mlfoundations-dev/Codeforces-Python-Submissions_processed

problem_id stringlengths 32 32	name stringlengths 2 54	problem stringlengths 204 5.28k	solutions sequencelengths 1 5.17k	test_cases stringlengths 38 86.7k	difficulty stringclasses 1 value	language stringclasses 1 value	source stringclasses 1 value	num_solutions int64 1 5.17k
89c2bcffb56fcdb0dba9ea994e161d20	Color Stripe	A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells are of the same color. You can use any color from 1 to k to repaint the cells. The first input line contains two integers n and k (1<=≤<=n<=≤<=5·105; 2<=≤<=k<=≤<=26). The second line contains n uppercase English letters. Letter "A" stands for the first color, letter "B" stands for the second color and so on. The first k English letters may be used. Each letter represents the color of the corresponding cell of the stripe. Print a single integer — the required minimum number of repaintings. In the second line print any possible variant of the repainted stripe. Sample Input 6 3 ABBACC 3 2 BBB Sample Output 2 ABCACA 1 BAB	[ "n, k = map(int, input().split())\n\ns = list(input())\n\nif k > 2:\n c = set(ord(\"A\") + i for i in range(26))\n r = 0\n for i in range(1,len(s)):\n if s[i-1] == s[i]:\n r += 1\n if i + 1 < n:\n s[i] = \"A\" if \"A\" not in {s[i-1], s[i+1]} else ('B' if \"B\" not in {s[i], s[i+1]} else \"C\")\n else:\n s[i] = \"A\" if s[i-1] != \"A\" else \"B\"\n \n print(r)\n print(\"\".join(s))\n\nelse:\n x, y = \"AB\" * n, \"BA\" * n\n def check(x, y):\n return sum(x[i] != y[i] for i in range(n))\n check_1 = check(x, s)\n check_2 = check(y, s)\n z = [x,y][check_1 > check_2]\n print(min(check_1, check_2))\n print(z[:n])", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,K = map(int, input().split())\r\nchars = []\r\nfor i in range(K):\r\n chars.append(chr(ord('A')+i))\r\n\r\nans = 0\r\nS = [c for c in input()]\r\n\r\nif K==2:\r\n s1 = 'AB'N\r\n s2 = 'BA'N\r\n s1=s1[:N]\r\n s2=s2[:N]\r\n a1,a2=0,0\r\n for i in range(N):\r\n if s1[i]!=S[i]:\r\n a1+=1\r\n if s2[i]!=S[i]:\r\n a2+=1\r\n \r\n if a1>a2:\r\n print(a2)\r\n print(s2)\r\n else:\r\n print(a1)\r\n print(s1)\r\n exit(0)\r\n\r\n\r\nfor i in range(1,N):\r\n if S[i]==S[i-1]:\r\n tmp = [S[i]]\r\n if i+1<N:\r\n tmp.append(S[i+1])\r\n \r\n nchar = ''\r\n for c in chars:\r\n if c not in tmp:\r\n nchar=c\r\n break\r\n S[i]=nchar\r\n ans+=1\r\nprint(ans)\r\nprint(''.join(S))\r\n\r\n", "\r\nn,k = map(int,input().split())\r\ns = input()\r\nif k==2:\r\n s1 = \"AB\"n\r\n s2 = \"BA\"n\r\n ans1=0\r\n ans2=0\r\n for i in range(n):\r\n if s1[i]!=s[i]:\r\n ans1+=1\r\n if s2[i]!=s[i]:\r\n ans2+=1\r\n if ans1<=ans2:\r\n print(ans1)\r\n print(s1[:n])\r\n else:\r\n print(ans2)\r\n print(s2[:n])\r\n\r\nelse:\r\n s = list(s)\r\n i = 1\r\n ans = 0\r\n while i<n:\r\n if s[i]==s[i-1]:\r\n ans+=1\r\n cb = set()\r\n cb.add('A')\r\n cb.add('B')\r\n cb.add('C')\r\n if s[i-1] in cb:\r\n cb.remove(s[i-1])\r\n if i+1<n and s[i+1] in cb:\r\n cb.remove(s[i+1])\r\n s[i] = list(cb)[0]\r\n i+=1\r\n print(ans)\r\n print(\"\".join(s))", "# Read n and k\r\nn, k = map(int, input().split())\r\n\r\n# Read the stripe as a string\r\ns = list(input())\r\n\r\n# Initialize the count of repaintings\r\ncount = 0\r\n\r\nif k > 2:\r\n # Loop through the stripe\r\n for i in range(n - 1):\r\n if s[i] == s[i + 1]:\r\n count += 1\r\n # Find a new color that is different from both neighbors\r\n for new_color in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"[:k]:\r\n if (i + 2 >= n or s[i + 2] != new_color) and s[i] != new_color:\r\n s[i + 1] = new_color\r\n break\r\nelse:\r\n # Special case when k = 2\r\n count1, count2 = 0, 0\r\n s1, s2 = [], []\r\n for i in range(n):\r\n if i % 2 == 0:\r\n s1.append('A')\r\n s2.append('B')\r\n else:\r\n s1.append('B')\r\n s2.append('A')\r\n if s[i] != s1[-1]:\r\n count1 += 1\r\n if s[i] != s2[-1]:\r\n count2 += 1\r\n\r\n if count1 < count2:\r\n count = count1\r\n s = s1\r\n else:\r\n count = count2\r\n s = s2\r\n\r\n# Print the results\r\nprint(count)\r\nprint(\"\".join(s))\r\n", "n, k = map(int, input().split())\ns, rec, j = input(), [0] * n, 0\nif k == 2:\n x = 'AB' * (n // 2) + 'A' * (n % 2)\n y = 'BA' * (n // 2) + 'B' * (n % 2)\n ans = sum(1 for j in range(n) if x[j] != s[j])\n ans1 = sum(1 for j in range(n) if y[j] != s[j])\n if ans < ans1:\n print(ans)\n print(x)\n else:\n print(ans1)\n print(y)\nelse:\n while j + 1 < n:\n if s[j] == s[j + 1]:\n rec[j + 1] = 1\n j += 2\n else:\n j += 1\n b = {chr(0x41 + x) for x in range(k)}\n ans = [0] * n\n print(rec.count(1))\n for j in range(n):\n if rec[j]:\n p = set()\n if j - 1 >= 0:\n p.add(s[j - 1])\n if j + 1 < n:\n p.add(s[j + 1])\n ans[j] = (b - p).pop()\n else:\n ans[j] = s[j]\n print(''.join(ans))\n\n ", "n,k=map(int,input().split())\r\ns=list(input())\r\nif n==1:\r\n\tprint(0)\r\n\tprint(s[0])\r\n\texit()\r\nif k==2:\r\n\ta,b='A','B'\r\n\t# either it will be ababab or bababa so just check which one needs least number of modification .\r\n\tx,y=0,0\r\n\t# x : ababab, y:bababa\r\n\tfor i,item in enumerate(s):\r\n\t\tif i%2:\r\n\t\t\tif item=='A':\r\n\t\t\t\tx+=1\r\n\t\t\telse:\r\n\t\t\t\ty+=1\r\n\t\telse:\r\n\t\t\tif item=='B':\r\n\t\t\t\tx+=1\r\n\t\t\telse:\r\n\t\t\t\ty+=1\r\n\tif x>y:\r\n\t\tprint(y)\r\n\t\tprint('BA'(n//2)+'B'(n%2))\r\n\telse:\r\n\t\tprint(x)\r\n\t\tprint('AB'(n//2) + 'A'(n%2))\r\nelse:\r\n\ta,b,c='A','B','C'\r\n\tans=0\r\n\tfor i in range(1,n-1):\r\n\t\tif s[i]==s[i-1]:\r\n\t\t\tst=set([s[i-1],s[i+1]])\r\n\t\t\tif a not in st:\r\n\t\t\t\ts[i]=a\r\n\t\t\t\tans+=1\r\n\t\t\telif b not in st:\r\n\t\t\t\ts[i]=b\r\n\t\t\t\tans+=1\r\n\t\t\telse:\r\n\t\t\t\ts[i]=c\r\n\t\t\t\tans+=1\r\n\tif s[-1]==s[-2]:\r\n\t\tans+=1\r\n\t\tif s[-2]==a:\r\n\t\t\ts[-1]=b\r\n\t\telse:\r\n\t\t\ts[-1]=a\r\n\tprint(ans)\r\n\tprint(s,sep=\"\")", "import sys\r\ninput=sys.stdin.readline\r\nn,k=map(int,input().split())\r\ns=list(input().rstrip())\r\nal=list(\"abcdefghijklmnopqrstuvwxyz\".upper())[:k]\r\nal=set(al)\r\nif k>=3:\r\n cnt=0\r\n for i in range(1,n-1):\r\n if s[i-1]==s[i]==s[i+1]:\r\n s[i]=list(al-{s[i-1]})[0]\r\n cnt+=1\r\n for i in range(1,n):\r\n if s[i]==s[i-1]:\r\n if i<n-1:\r\n s[i]=list(al-{s[i-1]}-{s[i+1]})[0]\r\n else:\r\n s[i]=list(al-{s[i-1]})[0]\r\n cnt+=1\r\n print(cnt)\r\n print(\"\".join(s))\r\nelse:\r\n s1=\"AB\"(n//2)+\"A\"(n%2)\r\n s2=\"BA\"(n//2)+\"B\"(n%2)\r\n cnt1,cnt2=0,0\r\n for i in range(n):\r\n if s[i]!=s1[i]:\r\n cnt1+=1\r\n if s[i]!=s2[i]:\r\n cnt2+=1\r\n if cnt1<cnt2:\r\n print(cnt1)\r\n print(s1)\r\n else:\r\n print(cnt2)\r\n print(s2)", "import string\n\nn, k = map(int, input().split())\ncolors = list(input())\n\nif k == 2:\n t_sequence = 'AB' (n // 2) + 'A' * (n % 2)\n p_sequence = 'BA' * (n // 2) + 'B' * (n % 2)\n\n count_t = 0\n count_p = 0\n for i in range(n):\n if colors[i] != t_sequence[i]:\n count_t += 1\n if colors[i] != p_sequence[i]:\n count_p += 1\n\n if count_p < count_t:\n print(count_p)\n print(p_sequence)\n else:\n print(count_t)\n print(t_sequence)\nelse:\n repaint_count = 0\n for i in range(1, n):\n available_colors = list(string.ascii_uppercase)[:k]\n \n if colors[i] == colors[i - 1]:\n available_colors.remove(colors[i])\n if i + 1 < n and colors[i + 1] in available_colors:\n available_colors.remove(colors[i + 1])\n\n colors[i] = available_colors.pop()\n repaint_count += 1\n\n print(repaint_count)\n print(''.join(colors))\n\t \t \t\t \t\t \t \t\t\t\t \t \t \t\t \t", "n,k=map(int,input().split())\r\ns=input()\r\nif k==2:\r\n z1,ans1='AB'n,0\r\n for i,c in enumerate(s):\r\n if c!=z1[i]: ans1+=1\r\n z2,ans2='BA'n,0\r\n for i,c in enumerate(s):\r\n if c!=z2[i]: ans2+=1\r\n if ans1<ans2:\r\n print(ans1)\r\n print(z1[:n])\r\n else:\r\n print(ans2)\r\n print(z2[:n])\r\nelse:\r\n a,ans=list(s),0\r\n for i in range(n):\r\n if i==0:\r\n continue\r\n elif a[i-1]!=a[i]:\r\n continue\r\n else:\r\n for j in range(k):\r\n c=chr(65+j)\r\n if a[i]!=c:\r\n if i==n-1:\r\n break\r\n elif a[i+1]!=c:\r\n break\r\n a[i]=c\r\n ans+=1\r\n print(ans)\r\n print(''.join(a))\r\n \r\n", "n, k = list(map(int, input().split()))\ns = list(input())\n\ndef check_string(l):\n total = 0\n for x in range(len(s)):\n if s[x] != l:\n total += 1\n l = 'A' if l == 'B' else 'B'\n return total\n\ndef get_letter(l1, l2):\n v1 = min(ord(l1), ord(l2))\n v2 = max(ord(l1), ord(l2))\n\n if l1 == l2:\n if l1 == 'A':\n return 'B'\n else:\n return 'A'\n else:\n if v1 != ord('A'):\n return 'A'\n elif v1 == ord('A'):\n if v2 == ord('B'):\n return 'C'\n else:\n return 'B'\n\nchanges = 0\nif k > 2:\n for x in range(1, n):\n if s[x - 1] == s[x]:\n if x < (n - 1):\n l = get_letter(s[x], s[x+1])\n else:\n l = get_letter(s[x-1], s[x])\n \n s[x] = l\n changes += 1\n x += 1\nelse:\n vA = check_string('A')\n vB = check_string('B')\n\n if vA <= vB:\n changes = vA\n l = 'A'\n else:\n changes = vB\n l = 'B'\n\n s = []\n for _ in range(n):\n s.append(l)\n l = 'A' if l == 'B' else 'B'\n\nprint(changes)\nprint(''.join(s))\n\n\n\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\ns = list(input().rstrip())\r\nif k == 2:\r\n c = 0\r\n for i in range(n):\r\n c += (s[i] ^ i) & 1\r\n m = min(n - c, c)\r\n if 2 * c >= n:\r\n ans = [chr((i % 2) + 65) for i in range(n)]\r\n else:\r\n ans = [chr((i % 2) + 65) for i in range(1, n + 1)]\r\nelse:\r\n m = 0\r\n x = [i for i in range(65, 65 + k)]\r\n for i in range(1, n):\r\n if s[i - 1] ^ s[i]:\r\n continue\r\n m += 1\r\n for j in x:\r\n if s[i - 1] ^ j and (i + 1 == n or s[i + 1] ^ j):\r\n s[i] = j\r\n break\r\n ans = [chr(i) for i in s]\r\nprint(m)\r\nsys.stdout.write(\"\".join(ans))" ]	{"inputs": ["6 3\nABBACC", "3 2\nBBB", "1 2\nA", "1 26\nZ", "2 2\nAA", "2 2\nBA", "6 2\nAAABBB", "8 3\nAABBABBB", "10 26\nAAAAAAAAAA", "12 3\nAAABBBAAABBB", "3 2\nAAB", "3 3\nBBA", "3 3\nCCC", "8 3\nAABBCCBB", "200 2\nBABAABBABBABBABABBBABAAABABBABABBBAABBBBABBAABBABABAAAAABAABBBAAAAAAABBBABAAAABABBBAABABAABAABBBAABBABAAAABABAAAABABABBBABBBAAABAAABAAABABAAABABABBABABABBABBBABBBBBABABBBABAAABAAABAABBAABBABBBBBABBBAB", "20 2\nBBBBAAAAAABBBAAAAAAB", "20 3\nCCCCAAAAAAAAAAAAAAAA", "100 2\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB", "100 2\nBBBBBBBAAABBAAAABAABBBAABABAAABBBABBAAAABBABAAAAAAAAAAAAABAAABBBAAABAABBBBBBBABBBBAABAAABBBAABBAAAAB", "100 2\nABAAABABABAAABAAABAAABABABAAABABABAAABABABAAABAAABAAABABABAAABAAABAAABABABAAABAAABAAABABABAAABABABAA", "100 2\nABABABABABABABABABABABABABABABABABABABABABBBABABABABABABABABABABABABABABABABABABABABABABABABABABABAB", "2 3\nAA", "12 2\nBBBBABABABAB", "4 2\nAABA", "6 2\nBAABAB", "10 2\nAABABABABA", "6 2\nBBABAB", "5 2\nBBABA", "45 26\nABCDEFGHIJKLMNOOOOOPPPPPQQQQQQPPQZZZZASDASDGF", "3 2\nBBA", "4 2\nABBA", "6 2\nAABABA", "6 2\nBAAAAB", "4 2\nAABB", "7 2\nAAAABBB", "41 2\nAABAAABBBBBBAAAABBBAAAAAABBBBBBBBAAAAAAAA", "8 2\nAABABABA", "20 2\nABBABABBBABBABAAAABA", "5 2\nABBAB", "10 2\nBBABABABAB", "6 2\nABBABB"], "outputs": ["2\nABCACA", "1\nBAB", "0\nA", "0\nZ", "1\nAB", "0\nBA", "2\nABABAB", "3\nBACBABCB", "5\nBABABABABA", "4\nABABCBABABCB", "1\nBAB", "1\nABA", "1\nCAC", "4\nBACBACAB", "87\nABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB", "10\nABABABABABABABABABAB", "10\nACACBABABABABABABABA", "49\nABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB", "48\nBABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA", "17\nABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB", "1\nABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB", "1\nBA", "2\nABABABABABAB", "1\nBABA", "2\nABABAB", "1\nBABABABABA", "1\nABABAB", "1\nABABA", "10\nABCDEFGHIJKLMNOPOPOPQPQPAQAQAQAPQAZAZASDASDGF", "1\nABA", "2\nABAB", "1\nBABABA", "3\nABABAB", "2\nABAB", "3\nBABABAB", "19\nBABABABABABABABABABABABABABABABABABABABAB", "1\nBABABABA", "8\nBABABABABABABABABABA", "2\nBABAB", "1\nABABABABAB", "3\nABABAB"]}	UNKNOWN	PYTHON3	CODEFORCES	11
89f33e47241992f5c2c6cbeeaf3d4ead	Captain Marmot	Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has n regiments, each consisting of 4 moles. Initially, each mole i (1<=≤<=i<=≤<=4n) is placed at some position (xi,<=yi) in the Cartesian plane. Captain Marmot wants to move some moles to make the regiments compact, if it's possible. Each mole i has a home placed at the position (ai,<=bi). Moving this mole one time means rotating his position point (xi,<=yi) 90 degrees counter-clockwise around it's home point (ai,<=bi). A regiment is compact only if the position points of the 4 moles form a square with non-zero area. Help Captain Marmot to find out for each regiment the minimal number of moves required to make that regiment compact, if it's possible. The first line contains one integer n (1<=≤<=n<=≤<=100), the number of regiments. The next 4n lines contain 4 integers xi, yi, ai, bi (<=-<=104<=≤<=xi,<=yi,<=ai,<=bi<=≤<=104). Print n lines to the standard output. If the regiment i can be made compact, the i-th line should contain one integer, the minimal number of required moves. Otherwise, on the i-th line print "-1" (without quotes). Sample Input 4 1 1 0 0 -1 1 0 0 -1 1 0 0 1 -1 0 0 1 1 0 0 -2 1 0 0 -1 1 0 0 1 -1 0 0 1 1 0 0 -1 1 0 0 -1 1 0 0 -1 1 0 0 2 2 0 1 -1 0 0 -2 3 0 0 -2 -1 1 -2 0 Sample Output 1 -1 3 3	[ "n = int(input())\r\ndef all_angles(x, y, a, b):\r\n ret = [\r\n (a - x) + (b - y) * 1j\r\n ]\r\n for i in range(3):ret.append(ret[-1] * 1j)\r\n ret = [i + a + b * 1j for i in ret]\r\n ret = ret\r\n return ret[2:] + ret[:2]\r\ndef is_square(a, b, c, d):\r\n lines = [a - b, a - c, a - d, b - c, b - d, c - d]\r\n sectors = []\r\n for i in lines:\r\n sectors.append(round(i.real 2 + i.imag 2))\r\n sectors.sort()\r\n return all([sectors[0] == sectors[1],\r\n sectors[1] == sectors[2],\r\n sectors[2] == sectors[3],\r\n sectors[4] == 2 * sectors[0],\r\n sectors[5] == 2 * sectors[0],\r\n sectors[0] != 0])\r\nfor i in range(n):\r\n mas = [all_angles(list(map(int, input().split()))).copy() for i in range(4)]\r\n ret = -1\r\n p1 = 0\r\n for i1 in mas[0]:\r\n p2 = 0\r\n for i2 in mas[1]:\r\n p3 = 0\r\n for i3 in mas[2]:\r\n p4 = 0\r\n for i4 in mas[3]:\r\n if is_square(i1, i2, i3, i4):\r\n if ret == -1:\r\n ret = p1 + p2 + p3 + p4\r\n else:\r\n ret = min(ret, p1 + p2 + p3 + p4)\r\n p4 += 1\r\n p3 += 1\r\n p2 += 1\r\n p1 += 1\r\n print(ret)\r\n", "def distance(x1, y1, x2, y2):\r\n return (x2-x1)(x2-x1)+(y2-y1)(y2-y1)\r\ndef isSquare(x1, y1, x2, y2, x3, y3, x4, y4):\r\n d1 = distance(x1, y1, x2, y2)\r\n d2 = distance(x1, y1, x3, y3)\r\n d3 = distance(x1, y1, x4, y4)\r\n if d1 == 0 or d2 == 0 or d3 == 0:\r\n return False\r\n if (d1 == d2 and d3 == 2d2) and (distance(x4, y4, x2, y2) == d1 and distance(x2, y2, x3, y3) == 2d2):\r\n return True\r\n if (d1 == d3 and d2 == 2d1) and (distance(x2, y2, x3, y3) == d1 and distance(x2, y2, x4, y4) == 2d1):\r\n return True\r\n if (d2 == d3 and d1 == 2d2) and (distance(x2, y2, x3, y3) == d2 and distance(x3, y3, x4, y4) == 2d2):\r\n return True\r\n return False\r\ndef solve(ans, v):\r\n if len(v) == 4:\r\n ans.append(v.copy())\r\n return\r\n for i in range(4):\r\n v.append(i)\r\n solve(ans, v)\r\n v.pop()\r\nn = int(input())\r\nans = []\r\nv = []\r\nsolve(ans, v)\r\nwhile n > 0:\r\n arr = []\r\n for i in range(4):\r\n row = list(map(int, input().split()))\r\n arr.append(row)\r\n val = float('inf')\r\n flag = False\r\n for i in range(len(ans)):\r\n temp = [[0] 2 for _ in range(4)]\r\n r = 0\r\n for j in range(4):\r\n if ans[i][j] == 0:\r\n temp[j][0] = arr[j][0]\r\n temp[j][1] = arr[j][1]\r\n elif ans[i][j] == 1:\r\n temp[j][0] = (-1) * (arr[j][1] - arr[j][3]) + arr[j][2]\r\n temp[j][1] = arr[j][0] - arr[j][2] + arr[j][3]\r\n elif ans[i][j] == 2:\r\n temp[j][0] = (-1) * (arr[j][0] - arr[j][2]) + arr[j][2]\r\n temp[j][1] = (-1) * (arr[j][1] - arr[j][3]) + arr[j][3]\r\n elif ans[i][j] == 3:\r\n temp[j][0] = arr[j][1] - arr[j][3] + arr[j][2]\r\n temp[j][1] = (-1) * (arr[j][0] - arr[j][2]) + arr[j][3] \r\n r += ans[i][j] \r\n if isSquare(temp[0][0], temp[0][1], temp[1][0], temp[1][1], temp[2][0], temp[2][1], temp[3][0], temp[3][1]):\r\n flag = True\r\n val = min(val, r)\r\n if not flag:\r\n print(-1)\r\n else:\r\n print(val)\r\n n -= 1# 1691666203.9581006", "import sys\nimport threading\nfrom random import randint, shuffle\nimport os\nfrom io import BytesIO, IOBase\n\nfrom collections import defaultdict, Counter, deque\nfrom math import inf, sqrt, floor\nfrom functools import lru_cache\nfrom heapq import heappop, heappush, heapify\nimport math \nfrom bisect import bisect_left, bisect_right\n\nnextInts = lambda: list(map(int, input().split()))\nnextInt = lambda: int(input())\nMod = 109 + 7\n\ndef dis(p1, p2):\n return (p1[1] - p2[1])2 + (p1[0] - p2[0]) ** 2\n\ndef sort_points(points):\n base = points[0]\n points.sort(key = lambda x: dis(x, base))\n points[-1], points[-2] = points[-2], points[-1]\n\ndef check(points):\n sort_points(points)\n\n p1,p2,p3,p4 = points\n all_sides_equal = dis(p1, p2) == dis(p2,p3) == dis(p3,p4) == dis(p4, p1)\n dig1 = dis(p1, p3)\n dig2 = dis(p2, p4)\n return all_sides_equal and dig1 == 2dis(p1,p2) and dig1 == dig2 and dig1 > 0\n\ndef a_rotate(row):\n x,y,a,b = row\n x,y = (a - b + y, a + b - x)\n return [x,y, a,b]\n\ndef solve(rows, i):\n \n if check([(x,y) for x,y,_,_ in rows]):\n return 0 \n\n if i >= len(rows):\n return inf\n\n res = solve(rows, i + 1)\n moves = 0\n for _ in range(3):\n rows[i] = rotate(rows[i])\n moves += 1\n ans = solve(rows, i + 1) + moves\n res = min(res, ans) \n\n rows[i] = rotate(rows[i])\n return res\n\ndef rotate(row):\n x, y, p, q = row \n x, y = p - (y - q), q + (x - p)\n return [x, y, p, q]\n\ndef solution():\n \n n = int(input())\n for _ in range(n):\n rows = [nextInts() for _ in range(4)]\n ans = solve(rows, 0)\n \n\n if ans < inf:\n print(ans)\n else:\n print(-1)\n\n\n \n\n\ndef main():\n\n t = 1\n #t = int(input())\n for _ in range(t):\n solution()\n\n\n\n#Fast IO Region\nBUFSIZE = 8192\nclass FastIO(IOBase):\n newlines = 0\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 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 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 def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\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\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n#print=sys.stdout.write\n\n#------------------#\n# recursion Region #\n#------------------#\n\n#sys.setrecursionlimit(106)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n", "n = int(input())\r\n \r\ndef isSquare(a,b,c,d):\r\n if 2((b[0]-a[0])2+(b[1]-a[1])2) == 2((c[0]-a[0])2+(c[1]-a[1])2) == (d[0]-a[0])2+(d[1]-a[1])2 == (b[0]-c[0])2+(b[1]-c[1])2 == 2((d[0]-c[0])2+(d[1]-c[1])2) == 2((d[0]-b[0])2+(d[1]-b[1])2) and a != d:\r\n return True\r\n return False\r\n \r\n \r\nfor reg in range(n):\r\n moles = []\r\n for i in range(4):\r\n moles.append([int(x) for x in input().split()])\r\n \r\n pos = []\r\n \r\n for x,y,a,b in moles:\r\n x -= a\r\n y -= b\r\n p = [(x,y)]\r\n #print(x,y,a,b)\r\n #print(x,y)\r\n for bruh in range(3):\r\n x,y = -y,x\r\n #print(x,y)\r\n p.append((x,y))\r\n pos.append([(c[0]+a, c[1]+b) for c in p])\r\n \r\n low = float('inf')\r\n \r\n for a in range(4):\r\n for b in range(4):\r\n for c in range(4):\r\n for d in range(4):\r\n points = [pos[0][a], pos[1][b], pos[2][c], pos[3][d]]\r\n points.sort()\r\n if isSquare(points[0], points[1], points[2], points[3]):\r\n low = min(low, a+b+c+d)\r\n if low == float('inf'):\r\n print(-1)\r\n else:\r\n print(low)", "def rotate(i, j): \r\n # rotating ith element of a j times and storing new coordinates into c \r\n x, y, p, q = a[i] \r\n for k in range(1, j+1):\r\n x, y = p - (y - q), q + (x - p)\r\n c[i] = x, y\r\n\r\ndef dist(i, j):\r\n # now know the distance between new position if ith and jth elements of a. \r\n x, y = c[i]\r\n p, q = c[j]\r\n return (x-p)2 + (y-q)2\r\n\r\ndef check(move):\r\n for i in range(4): \r\n rotate(i, move[i])\r\n p = [1,2,3] \r\n p.sort(key = lambda x: dist(0, x))\r\n d = [dist(0, x) for x in p]\r\n # get the distance between 1 and (2,3,4) and sorted them\r\n if d[0] == d[1] == d[2] / 2 and d[2] > 0: # checking the distance that two are equal and last one is double\r\n if dist(p[0],p[1])==d[2]:\r\n return True #nowcheck another diagonal distnce if they are equal then it is square\r\n else:\r\n return False \r\n else:\r\n return False\r\n\r\nn = int(input())\r\na = [0] 4\r\nc = [0] * 4\r\nfor i in range(n):\r\n a[0] = list(map(int, input().split()))\r\n a[1] = list(map(int, input().split()))\r\n a[2] = list(map(int, input().split()))\r\n a[3] = list(map(int, input().split()))\r\n ans = 17\r\n for k in range(4):\r\n for l in range(4):\r\n for p in range(4):\r\n for q in range(4):\r\n if k + l + p + q < ans and check([k, l, p, q])==True :\r\n ans = k + l + p + q\r\n if ans ==17:\r\n print(-1)\r\n else:\r\n print(ans) ", "def r(t): t[0], t[1] = t[2] + t[3] - t[1], t[3] + t[0] - t[2]\r\nf = [(0, 0), (1, 3), (2, 15), (3, 63)]\r\nh = [(0, 1), (0, 2), (0, 3), (1, 2), (1, 3), (2, 3)]\r\ng = lambda u, v: (u[0] - v[0]) 2 + (u[1] - v[1]) 2\r\nfor i in range(int(input())):\r\n p = [list(map(int, input().split())) for j in range(4)]\r\n s = 13\r\n for q in range(256):\r\n t = sum((q >> k) & 3 for k in (0, 2, 4, 6))\r\n d = sorted(g(p[u], p[v]) for u, v in h)\r\n if 0 != d[4] == d[5] == 2 * d[0] == 2 * d[3]: s = min(s, t)\r\n for i, k in f:\r\n if q & k == k: r(p[i])\r\n print(s if s < 13 else -1)" ]	{"inputs": ["4\n1 1 0 0\n-1 1 0 0\n-1 1 0 0\n1 -1 0 0\n1 1 0 0\n-2 1 0 0\n-1 1 0 0\n1 -1 0 0\n1 1 0 0\n-1 1 0 0\n-1 1 0 0\n-1 1 0 0\n2 2 0 1\n-1 0 0 -2\n3 0 0 -2\n-1 1 -2 0", "3\n-2248 6528 -2144 6181\n-2245 6663 -2100 7054\n-4378 7068 -4061 7516\n-4274 6026 -3918 5721\n4942 -6793 5014 -6807\n3463 -5170 3112 -5181\n2870 -6992 3038 -6567\n5688 -4318 5358 -4744\n5249 7233 5016 6863\n4312 7385 4162 7383\n5965 9138 5607 8728\n4053 8349 4124 8389", "5\n1 1 0 0\n-1 1 0 0\n-1 1 0 0\n1 -1 0 0\n1 1 0 0\n-2 1 0 0\n-1 1 0 0\n1 -1 0 0\n1 1 0 0\n-1 1 0 0\n-1 1 0 0\n-1 1 0 0\n2 2 0 1\n-1 0 0 -2\n3 0 0 -2\n-1 1 -2 0\n0 1 0 0\n1 0 0 0\n-1 0 0 0\n0 -1 0 0", "1\n0 3 0 3\n3 2 3 2\n-1 0 -1 0\n2 -1 2 -1", "3\n1 0 0 0\n0 2 0 0\n-1 0 0 0\n0 -2 0 0\n1 0 0 0\n0 1 0 0\n-1 0 0 0\n0 -1 0 0\n1 2 0 0\n-1 2 0 0\n-1 -2 0 0\n1 -2 0 0", "1\n1 0 2 0\n-1 0 -2 0\n0 2 0 3\n0 -2 0 -3", "1\n1 0 0 0\n3 1 0 0\n2 3 0 0\n0 2 0 0", "1\n1 0 0 0\n0 2 0 0\n-1 0 0 0\n0 -2 0 0", "1\n1 0 2 0\n-1 0 -2 0\n0 1 0 2\n0 -1 0 -2", "2\n1 0 0 0\n0 2 0 0\n-1 0 0 0\n0 -2 0 0\n1 0 0 0\n0 1 0 0\n-1 0 0 0\n0 -1 0 0", "3\n-1 3 0 0\n3 1 0 0\n1 -3 0 0\n-3 -1 0 0\n1 1 0 0\n1 1 0 0\n1 1 0 0\n1 1 0 0\n-4 12 0 0\n-4 12 0 0\n-4 12 0 0\n-4 12 0 0", "4\n1 0 0 0\n0 2 0 0\n-1 0 0 0\n0 -2 0 0\n1 0 0 0\n0 1 0 0\n-1 0 0 0\n0 -1 0 0\n1 2 0 0\n-1 2 0 0\n-1 -2 0 0\n1 -2 0 0\n19 0 0 0\n0 20 0 0\n-19 0 0 0\n0 -20 0 0", "1\n0 0 0 0\n1 0 1 0\n1 1 1 1\n-1 0 -1 0", "1\n0 0 0 0\n1 1 1 1\n2 0 2 0\n1 -1 1 -1", "1\n1 1 1 1\n1 1 1 1\n2 2 2 2\n2 2 2 2", "1\n0 0 0 0\n0 1 0 1\n2 0 2 0\n2 1 2 1", "1\n-1 1 -9999 9999\n3 3 10000 10000\n3 -3 10000 -10000\n-1 -1 -9999 -9999", "1\n2 0 5 5\n0 1 5 5\n0 -1 5 5\n-2 0 5 5", "1\n-1 1 -9999 9999\n-1 -1 9998 9998\n-1 1 9998 -9998\n-1 -1 -9999 -9999", "1\n0 0 -1 -1\n-3 4 0 0\n2 4 0 0\n5 0 0 0", "1\n0 -1 0 -1\n2 0 2 0\n0 1 0 1\n-2 0 -2 0", "1\n2 1 0 0\n-2 1 0 0\n2 -1 0 0\n-2 -1 0 0", "1\n0 1 0 1\n0 -1 0 -1\n1 0 1 0\n-1 0 -1 0"], "outputs": ["1\n-1\n3\n3", "8\n6\n6", "1\n-1\n3\n3\n0", "0", "-1\n0\n-1", "4", "0", "-1", "0", "-1\n0", "0\n6\n6", "-1\n0\n-1\n-1", "-1", "0", "-1", "-1", "8", "-1", "8", "-1", "-1", "-1", "0"]}	UNKNOWN	PYTHON3	CODEFORCES	6
8a0c32c216a57e2b1ebcc493f38f1de4	Movie Critics	A film festival is coming up in the city N. The festival will last for exactly n days and each day will have a premiere of exactly one film. Each film has a genre — an integer from 1 to k. On the i-th day the festival will show a movie of genre ai. We know that a movie of each of k genres occurs in the festival programme at least once. In other words, each integer from 1 to k occurs in the sequence a1,<=a2,<=...,<=an at least once. Valentine is a movie critic. He wants to watch some movies of the festival and then describe his impressions on his site. As any creative person, Valentine is very susceptive. After he watched the movie of a certain genre, Valentine forms the mood he preserves until he watches the next movie. If the genre of the next movie is the same, it does not change Valentine's mood. If the genres are different, Valentine's mood changes according to the new genre and Valentine has a stress. Valentine can't watch all n movies, so he decided to exclude from his to-watch list movies of one of the genres. In other words, Valentine is going to choose exactly one of the k genres and will skip all the movies of this genre. He is sure to visit other movies. Valentine wants to choose such genre x (1<=≤<=x<=≤<=k), that the total number of after-movie stresses (after all movies of genre x are excluded) were minimum. The first line of the input contains two integers n and k (2<=≤<=k<=≤<=n<=≤<=105), where n is the number of movies and k is the number of genres. The second line of the input contains a sequence of n positive integers a1, a2, ..., an (1<=≤<=ai<=≤<=k), where ai is the genre of the i-th movie. It is guaranteed that each number from 1 to k occurs at least once in this sequence. Print a single number — the number of the genre (from 1 to k) of the excluded films. If there are multiple answers, print the genre with the minimum number. Sample Input 10 3 1 1 2 3 2 3 3 1 1 3 7 3 3 1 3 2 3 1 2 Sample Output 31	[ "import sys\r\ninput = sys.stdin.readline\r\nfrom itertools import groupby\r\n\r\nn, k = map(int, input().split())\r\nd = [list(j)[0] for i, j in groupby(map(int, input().split()))]\r\nq = [0](k+1)\r\nfor i in range(len(d)):\r\n if i not in [0, len(d)-1] and d[i-1] == d[i+1]:\r\n q[d[i]] += 1\r\n q[d[i]] += 1\r\nprint(max(1, q.index(max(q))))", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\ns = [0 for i in range(k)]\r\nb = [a[0]]\r\nfor i in range(1, n):\r\n if a[i] == b[-1]:\r\n continue\r\n else:\r\n b.append(a[i])\r\ny = len(b)\r\nfor i in range(y):\r\n if i == 0 and b[i] != b[i + 1]:\r\n s[a[0] - 1] += 1\r\n elif i == y - 1 and b[i] != b[i - 1]:\r\n s[b[y - 1] - 1] += 1\r\n else:\r\n if b[i - 1] == b[i + 1]:\r\n s[b[i] - 1] += 2\r\n else:\r\n s[b[i] - 1] += 1\r\nx = max(s)\r\nprint(s.index(x) + 1)", "__author__ = 'Michael Ilyin'\r\n\r\n\r\ndef prepare(a):\r\n na = []\r\n last = 0\r\n for i in range(0, len(a)):\r\n if last != a[i]:\r\n na.append(a[i])\r\n last = a[i]\r\n return na\r\n\r\n\r\nheader = input()\r\nfilms = int(header[:header.find(' ')])\r\ngenres = int(header[header.find(' '):])\r\nnumbers = [int(x) for x in input().split()]\r\nres = [[genre, 0] for genre in range(1, genres + 1)]\r\nnumbers = prepare(numbers)\r\nfilms = len(numbers)\r\n\r\nfor i, obj in enumerate(numbers):\r\n if i == 0:\r\n res[obj - 1][1] += 1\r\n continue\r\n if i == films - 1:\r\n res[obj - 1][1] += 1\r\n continue\r\n if numbers[i - 1] == numbers[i + 1]:\r\n res[obj - 1][1] += 2\r\n else:\r\n res[obj - 1][1] += 1\r\nres = sorted(res, key=lambda x: x[0], reverse=False)\r\nres = sorted(res, key=lambda x: x[1], reverse=True)\r\nprint(str(res[0][0]))", "n,k = map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nans=[]\r\nfreq=[0](k+1)\r\nfor i in range(n-1):\r\n if lis[i]!=lis[i+1]:\r\n ans.append(lis[i])\r\nif lis[-1]!=ans[-1]:\r\n ans.append(lis[-1])\r\n#print(ans,freq)\r\nl=len(ans)\r\nfor i in range(1,l-1):\r\n if ans[i-1]==ans[i+1]:\r\n freq[ans[i]]+=2\r\n else:\r\n freq[ans[i]]+=1\r\nfreq[ans[-1]]+=1\r\nfreq[ans[0]]+=1 \r\nprint(freq.index(max(freq))) \r\n \r\n\r\n\r\n", "import sys\n\ndef solve():\n n, k = map(int, input().split())\n bada = list(map(int, input().split()))\n a = list()\n for i in range(len(bada)):\n if len(a) > 0 and bada[i] == a[-1]: continue\n a.append(bada[i])\n bad = [0] * (k + 1)\n for i, val in enumerate(a):\n if i + 1 >= len(a) and i == 0: continue\n if i + 1 >= len(a):\n bad[val] += 1\n elif i == 0:\n bad[val] += 1\n else:\n before = a[i-1]\n after = a[i+1]\n bad[val] += 2 if before == after else 1\n which = -1\n howmany = -1\n for i in range(len(bad)):\n if bad[i] > howmany:\n which = i\n howmany = bad[i]\n print(which)\n\n\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nsolve()", "def findMininumStress (newMovies, k):\n stress = 0\n\n for i in range(len(newMovies)):\n if i < len(newMovies) - 1:\n if newMovies[i] != newMovies[i + 1]:\n stress = stress + 1\n\n fewerStresses = [stress] * k\n minimumValue = stress\n minimumPosition = 0\n\n for i in range(len(newMovies)):\n if i > 0 and i < len(newMovies) - 1:\n if newMovies[i - 1] != newMovies[i + 1]:\n fewerStresses[newMovies[i] - 1] = fewerStresses[newMovies[i] - 1] - 1\n else:\n fewerStresses[newMovies[i] - 1] = fewerStresses[newMovies[i] - 1] - 2\n else:\n fewerStresses[newMovies[i] - 1] = fewerStresses[newMovies[i] - 1] - 1\n\n for i in range(k):\n if fewerStresses[i] < minimumValue:\n minimumValue = fewerStresses[i]\n minimumPosition = i + 1\n \n print(minimumPosition)\n\ndef excludeConsecutiveRepetitions(n, movies, newMovies):\n for i in range(n):\n if i < n - 2:\n if movies[i] != movies[i + 1]:\n newMovies.append(movies[i])\n elif i == n - 2:\n if movies[i] != movies[i+1]:\n newMovies.append(movies[i])\n newMovies.append(movies[i + 1])\n else:\n newMovies.append(movies[i])\n\n\nif __name__ == '__main__':\n n, k = map(int, input().split())\n movies = list(map(int, input().split()))\n\n newMovies = []\n\n excludeConsecutiveRepetitions(n, movies, newMovies)\n\n findMininumStress (newMovies, k)\n \n", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(1,n):\r\n if a[i]!=a[i-1]:\r\n b.append(a[i-1])\r\nb.append(a[-1])\r\nc=[0]k\r\nfor i in range(len(b)-2):\r\n if b[i]==b[i+2]:\r\n c[b[i+1]-1]+=2\r\n else:\r\n c[b[i+1]-1]+=1\r\nj=0\r\nc[b[0]-1]+=1\r\nc[b[-1]-1]+=1\r\nfor i in range(k):\r\n if c[i]>c[j]:\r\n j=i\r\nprint(j+1)", "num_days, num_genres = map(int, input().split())\nschedule = list(map(int, input().split()))\n\ncompressed = []\ncurrent = schedule[0]\npos = 1\nwhile True:\n compressed.append(current)\n while pos < num_days and schedule[pos] == current:\n pos += 1\n if pos < num_days:\n current = schedule[pos]\n else:\n break\n\nscore = (num_genres + 1) [ 0 ]\nscore[compressed[0]] += 1\nfor i in range(2, len(compressed)):\n score[compressed[i - 1]] += 1\n if compressed[i - 2] == compressed[i]:\n score[compressed[i - 1]] += 1\nscore[compressed[len(compressed) - 1]] += 1\n\nbest_score, best_genre = -1, -1\nfor genre in range(1, num_genres + 1):\n if score[genre] > best_score:\n best_score = score[genre]\n best_genre = genre\nprint(best_genre)\n", "n,k=map(int,input().split())\nr=list(map(int,input().split()))\ndist=[]\nans=[0](k+1)#precomp\nfor i in range(n):\n\tif i == 0 or r[i] != r[i - 1]:\n\t\tdist.append(r[i])\n# dist = distinct\nfor i in range(len(dist)):\n\tif 0 < i < len(dist) - 1 and dist[i - 1] == dist[i + 1]:\n\t\tans[dist[i]] += 2 # removing dist[i] subtracts 2\n\telse:\n\t\tans[dist[i]] += 1\nu, v = -1, -1\nfor k in range(1, k + 1):\n\tif ans[k] > u: u, v = ans[k], k\nprint (v)", "import sys\r\nfrom math import \r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn, k = mints()\r\na = list(mints())\r\ni = 0\r\nc = [0](k+1)\r\nwhile i < n:\r\n\tj = i\r\n\twhile j < n and a[j] == a[i]:\r\n\t\tj += 1\r\n\tif i - 1 >= 0:\r\n\t\tif j < n:\r\n\t\t\tif a[i-1] != a[j]:\r\n\t\t\t\tc[a[i]] += 1\r\n\t\t\telse:\r\n\t\t\t\tc[a[i]] += 2\r\n\t\telse:\r\n\t\t\tc[a[i]] += 1\r\n\telif j < n:\r\n\t\t\tc[a[i]] += 1\r\n\ti = j\r\nz = 1\r\nfor i in range(k+1):\r\n\tif c[z] < c[i]:\r\n\t\tz = i\r\nprint(z)\r\n", "n,k=map(int,input().split())\r\nlst=[map(int,input().split())]\r\na,length=[lst[0]],0\r\nfor i,x in enumerate(lst[1:]):\r\n if x!=lst[i]:a.append(x);length+=1\r\nd={i:length for i in range(1,k+1)}\r\nd[a[0]]-=1\r\nfor i,x in enumerate(a[1:-1]):\r\n if a[i]==a[i+2]:d[x]-=2\r\n else:d[x]-=1\r\nd[a[-1]]-=1\r\nres=min(d.values())\r\nfor i,x in enumerate(d):\r\n if d[x]==res:\r\n print(x);break", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\na=[0]+a+[0]\r\ni=1 \r\ntot=0 \r\nj=1 \r\ncnt=[0]*(k+1)\r\nwhile i<=n:\r\n while j<=n and a[j]==a[i]: j+=1 \r\n tot+=1 \r\n if a[i-1]==a[j]:\r\n cnt[a[i]]+=2 #gain a strain of 2 if we remove a[i]\r\n else:\r\n cnt[a[i]]+=1 \r\n i=j \r\ntot-=1 \r\nans=tot\r\n#print(cnt)\r\nfor i in range(1,k+1):\r\n if ans>tot-cnt[i]:\r\n ans=tot-cnt[i]\r\n res=i \r\nprint(res)" ]	{"inputs": ["10 3\n1 1 2 3 2 3 3 1 1 3", "7 3\n3 1 3 2 3 1 2", "2 2\n1 2", "10 2\n1 2 2 1 1 2 1 1 2 2", "10 10\n5 7 8 2 4 10 1 3 9 6", "100 10\n6 2 8 1 7 1 2 9 2 6 10 4 2 8 7 5 2 9 5 2 3 2 8 3 7 2 4 3 1 8 8 5 7 10 2 1 8 4 1 4 9 4 2 1 9 3 7 2 4 8 4 3 10 3 9 5 7 7 1 2 10 7 7 8 9 7 1 7 4 8 9 4 1 10 2 4 2 10 9 6 10 5 1 4 2 1 3 1 6 9 10 1 8 9 1 9 1 1 7 6", "74 10\n10 5 4 7 1 9 3 5 10 7 1 4 8 8 4 1 3 9 3 3 10 6 10 4 2 8 9 7 3 2 5 3 6 7 10 4 4 7 8 2 3 10 5 10 5 10 7 9 9 6 1 10 8 9 7 8 9 10 3 6 10 9 9 5 10 6 4 3 5 3 6 8 9 3", "113 3\n1 3 2 2 1 3 1 2 2 2 3 1 1 3 1 3 3 1 2 2 1 3 2 3 3 1 3 1 1 3 3 1 2 3 3 1 3 3 2 3 3 1 1 1 1 2 3 2 2 3 3 2 3 1 3 2 1 3 2 1 1 2 2 2 2 2 1 1 3 3 2 1 1 3 2 2 1 3 1 1 1 3 3 2 1 2 2 3 3 1 3 1 2 2 1 2 2 3 3 2 3 1 3 1 1 2 3 2 3 2 3 1 3", "129 37\n15 22 28 15 30 16 11 20 4 26 14 37 29 17 15 15 14 18 1 9 16 22 13 32 5 18 25 11 6 33 33 22 17 9 1 5 27 27 37 4 6 1 3 18 11 33 6 17 2 24 23 1 1 37 35 21 21 17 18 6 31 17 29 18 10 10 30 31 8 3 25 20 34 11 12 12 24 13 5 27 20 31 28 3 36 2 4 13 14 9 33 25 4 26 36 6 2 7 15 9 20 33 24 33 28 12 23 1 28 12 29 3 35 33 26 15 3 19 1 23 23 32 2 27 11 7 36 34 36", "100 13\n1 1 9 10 6 1 12 13 9 5 3 7 3 5 2 2 10 1 3 8 9 4 4 4 2 10 12 11 1 5 7 13 4 12 5 9 3 13 5 10 7 2 1 7 2 2 4 10 3 10 6 11 13 1 4 3 8 8 9 8 13 4 4 3 7 12 5 5 8 13 1 9 8 12 12 10 4 7 7 12 1 4 3 4 9 6 4 13 10 12 10 9 8 13 13 5 6 9 7 13", "100 12\n9 12 3 3 1 3 12 12 7 9 6 5 8 12 10 7 8 3 4 8 5 9 9 10 9 7 4 5 10 7 4 1 11 6 5 9 1 2 9 9 1 10 6 8 9 10 7 9 10 3 6 4 9 12 11 10 4 4 2 12 11 8 4 9 12 6 4 7 5 1 5 2 7 4 10 2 5 6 4 2 5 8 6 9 6 4 8 6 2 11 4 12 3 1 1 11 1 6 1 10"], "outputs": ["3", "1", "1", "1", "1", "1", "10", "3", "1", "3", "9"]}	UNKNOWN	PYTHON3	CODEFORCES	12
8a19c08339325adedb08655029389065	Robot Bicorn Attack	Vasya plays Robot Bicorn Attack. The game consists of three rounds. For each one a non-negative integer amount of points is given. The result of the game is the sum of obtained points. Vasya has already played three rounds and wrote obtained points one by one (without leading zeros) into the string s. Vasya decided to brag about his achievement to the friends. However, he has forgotten how many points he got for each round. The only thing he remembers is the string s. Help Vasya to find out what is the maximum amount of points he could get. Take into account that Vasya played Robot Bicorn Attack for the first time, so he could not get more than 1000000 (106) points for one round. The only line of input contains non-empty string s obtained by Vasya. The string consists of digits only. The string length does not exceed 30 characters. Print the only number — the maximum amount of points Vasya could get. If Vasya is wrong and the string could not be obtained according to the rules then output number -1. Sample Input 1234 9000 0009 Sample Output 37 90 -1	[ "def find_max_score(s):\r\n n = len(s)\r\n max_score = -1\r\n for i in range(1, n):\r\n for j in range(i + 1, n):\r\n num1 = int(s[:i])\r\n num2 = int(s[i:j])\r\n num3 = int(s[j:])\r\n if (s[0] != '0' or len(s[:i]) == 1) and \\\r\n (s[i] != '0' or len(s[i:j]) == 1) and \\\r\n (s[j] != '0' or len(s[j:]) == 1):\r\n if num1 <= 106 and num2 <= 106 and num3 <= 106:\r\n max_score = max(max_score, num1 + num2 + num3)\r\n\r\n return max_score\r\ns = input()\r\nmax_score = find_max_score(s)\r\nprint(max_score)\r\n", "s=input()\r\nadd=[]\r\nfor i in range(1,len(s)-1):\r\n for j in range(i+1,len(s)):\r\n a=s[:i]\r\n b=s[i:j]\r\n c=s[j:]\r\n \r\n if int(a)<=1000000 and int(b)<=1000000 and int(c)<=1000000:\r\n if len(a)>1 and len(b)>1 and len(c)>1:\r\n if (len(a)>1 and int(a)>pow(10,len(a)-1)-1) and (len(b)>1 and int(b)>pow(10,len(b)-1)-1) and (len(c)>1 and int(c)>pow(10,len(c)-1)-1):\r\n add.append(int(a)+int(b)+int(c))\r\n elif len(a)>1 and len(b)==1 and len(c)==1:\r\n if int(a)>pow(10,len(a)-1)-1:\r\n add.append(int(a)+int(b)+int(c))\r\n elif len(b)>1 and len(a)==1 and len(c)==1:\r\n if int(b)>pow(10,len(b)-1)-1:\r\n add.append(int(a)+int(b)+int(c))\r\n elif len(c)>1 and len(a)==1 and len(b)==1:\r\n if int(c)>pow(10,len(c)-1)-1:\r\n add.append(int(a)+int(b)+int(c))\r\n elif len(a)>1 and len(b)>1 and len(c)==1:\r\n if int(a)>pow(10,len(a)-1)-1 and int(b)>pow(10,len(b)-1)-1:\r\n add.append(int(a)+int(b)+int(c))\r\n elif len(b)>1 and len(c)>1 and len(a)==1:\r\n if int(b)>pow(10,len(b)-1)-1 and int(c)>pow(10,len(c)-1)-1:\r\n add.append(int(a)+int(b)+int(c))\r\n elif len(c)>1 and len(a)>1 and len(b)==1:\r\n if int(c)>pow(10,len(c)-1)-1 and int(a)>pow(10,len(a)-1)-1:\r\n add.append(int(a)+int(b)+int(c))\r\n elif len(a)==1 and len(b)==1 and len(c)==1:\r\n add.append(int(a)+int(b)+int(c))\r\n \r\nif len(add)==0:\r\n print(-1)\r\nelse:\r\n b=sorted(add,reverse=True)\r\n print(b[0])\r\n \r\n\r\n ", "\ndef get_all(s):\n return ((s[:i], s[i:j], s[j:]) for i in range(1,len(s)) for j in range(i+1, len(s)))\n\ndef _map(pred, a):\n for _a in a:\n yield(pred(_a))\n\nis_in_range = lambda x : int(x) <= 1000000\nis_not_multizero = lambda x : (int(x) > 0 or len(x) == 1)\nnot_start_with_zero = lambda x : (x == '0' or (int(x) > 0 and not x.startswith('0')))\npred = lambda x : all(_map(is_in_range, x)) and all(_map(is_not_multizero, x)) and all(_map(not_start_with_zero, x))\n\ns = input('')\nres = filter(pred, get_all(s))\nx = list(_map(lambda x : sum(_map(int, x)), res))\nprint(max(x) if x else -1) \n", "# Code written for Jasnah\r\n\r\ns = input()\r\n\r\nans = -109\r\n\r\nfor i in range(1, len(s)):\r\n for j in range(i + 1, len(s)):\r\n candidates = []\r\n candidates.append(s[:i])\r\n candidates.append(s[i:j])\r\n candidates.append(s[-(len(s) - j):])\r\n bad = False\r\n for candidate in candidates:\r\n if len(candidate) > 1 and candidate[0] == '0':\r\n bad = True\r\n break\r\n if int(candidate) > 106:\r\n bad = True\r\n break\r\n if bad:\r\n continue\r\n sum = 0\r\n for candidate in candidates:\r\n sum += int(candidate)\r\n ans = max(ans, sum)\r\n\r\nif ans == -109:\r\n print(-1)\r\nelse:\r\n print(ans)", "s = input()\r\nres = -1\r\nfor i in range(1, len(s)):\r\n for j in range(i+1, len(s)):\r\n x = int(s[:i])\r\n y = int(s[i:j])\r\n z = int(s[j:])\r\n if s[0] == '0' and len(s[:i]) > 1:\r\n continue\r\n if s[i] == '0' and len(s[i:j]) > 1:\r\n continue\r\n if s[j] == '0' and len(s[j:]) > 1:\r\n continue\r\n if x > 1e6 or y > 1e6 or z > 1e6:\r\n continue\r\n res = max(res, x + y + z)\r\nprint(res)\r\n", "n=input()\nl=len(n)\nmini=-1\nfor i in range(1,l-1):\n\tfor j in range(1,l-1):\n \t\tk=l-i-j\n \t\tif(k>0):\n \t\t\t# print(i,i+j)\n \t\t\tt1=\"\".join(n[:i])\n \t\t\tt2=\"\".join(n[i:i+j])\n \t\t\tt3=\"\".join(n[i+j:])\n \t\t\t\t\n \t\t\tif((t1[0]==\"0\" and i>1) or (t2[0]==\"0\" and j>1) or (t3[0]==\"0\" and k>1)):\n \t\t\t\tcontinue\n \t\t\t# print(t1,t2,t3)\n \t\t\tt1=int(t1)\n \t\t\tt2=int(t2)\n \t\t\tt3=int(t3)\n \t\t\ts=t1+t2+t3\n \t\t\tif(s>mini and t1<=106 and t2<=106 and t3<=106 ):\n \t\t\t\tmini=s\nprint(mini)\n \n", "\r\ndef validate(x, y, z):\r\n\tif (x[0] == '0' and len(x)!=1) or (y[0] == '0' and len(y)!=1) or (z[0] == '0' and len(z)!=1):\r\n\t\treturn -1\r\n\tx, y, z = int(x), int(y), int(z)\r\n\tif x > 1000000 or y > 1000000 or z > 1000000:\r\n\t\treturn -1\r\n\treturn x + y + z\r\n\r\nans = -1\r\ns = input()\r\nn = len(s)\r\nfor i in range(n):\r\n\tfor j in range(i+1, n):\r\n\t\tfor k in range(j+1, n):\r\n\t\t\tans = max(ans, validate(s[:i+1], s[i+1:j+1], s[j+1:]))\r\n\r\nprint(ans)", "s = input()\r\ndef f(str):\r\n\tif str[0] == '0' and len(str) > 1:\r\n\t\treturn -10000000000\r\n\tif(int(str) > 106):\r\n\t\treturn -1000000000\r\n\treturn int(str)\r\n\r\nans = -1\r\nfor i in range(1,len(s) - 1):\r\n\tfor j in range(i+1, len(s)):\r\n\t\tif(f(s[0:i]) >= 0 and f(s[i:j]) >= 0 and f(s[j:]) >= 0):\r\n\t\t\tans = max(ans, (f(s[0:i]) + f(s[i:j]) + f(s[j:])))\r\nprint(ans)", "def convert(s):\r\n if s[0] == '0' and not len(s)==1:\r\n return -10000000000\r\n res = 0\r\n for i in s:\r\n res = res * 10 + int(i)\r\n if res > 106:\r\n return -1000000000\r\n return res\r\ns = input()\r\nres = -1\r\nfor i in range(1,len(s)-1):\r\n for j in range(i+1,len(s)):\r\n res = max(res,convert(s[:i])+convert(s[i:j])+convert(s[j:]))\r\nprint(res)\r\n\r\n", "s=input()\r\nans=-1\r\nfor i in range(len(s)-2):\r\n\tfor j in range(i+1, len(s)-1):\r\n\t\tx=s[:i+1]\r\n\t\ty=s[i+1:j+1]\r\n\t\tz=s[j+1:]\r\n\t\tif len(x)==len(str(int(x))) and len(y)==len(str(int(y))) and len(z)==len(str(int(z))):\r\n\t\t\tif int(x)<=1e6 and int(y)<=1e6 and int(z)<=1e6:\r\n\t\t\t\tans=max(ans, int(x)+int(y)+int(z))\r\nprint(ans)\r\n", "def test(s):\r\n if len(s)>1:\r\n if s[0]=='0':\r\n return False\r\n if int(s)>106:\r\n return False \r\n else:\r\n return True\r\ns=input()\r\nk=len(s)\r\nu=[-1]\r\nfor i in range(1,k):\r\n for j in range(1,k):\r\n if s[i+j:]!='':\r\n if test(s[:i]) and test(s[i:i+j]) and test(s[i+j:]):\r\n u.append(int(s[:i])+int(s[i:i+j])+int(s[i+j:]))\r\n# print(int(s[:i]),int(s[i:i+j]),int(s[i+j:]))\r\n#print(u)\r\nprint(max(u))", "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\n\r\ns = input()\r\nr = len(s)\r\nif r < 3:\r\n print(-1)\r\nelif r == 3:\r\n k = int(s[0])+int(s[1])+int(s[2])\r\n print(k)\r\nelse:\r\n k = 0\r\n for i in range(r):\r\n for j in range(i+1, r):\r\n x = s[:i]\r\n y = s[i:j]\r\n z = s[j:]\r\n if len(x) > 1 and x[0] == '0' or len(y) > 1 and y[0] == '0' or len(z) > 1 and z[0] == '0' or len(x) > 0 and int(x) > 1000000 or len(y) > 0 and int(y) > 1000000 or len(z) > 0 and int(z) > 1000000:\r\n continue\r\n if len(x) > 0 and len(y) > 0 and len(z) > 0:\r\n k = max(k, int(x)+int(y)+int(z))\r\n if k == 0:\r\n print(-1)\r\n else:\r\n print(k)\r\n", "s = input()\r\n\r\ndef valid(s):\r\n if not (s[0] == '0' and len(s) > 1) and int(s) <= 1000000:\r\n return True\r\n return False\r\n\r\nres = []\r\nfor x in range(1, len(s)):\r\n for y in range(x, len(s)):\r\n\r\n b = [x, y]\r\n\r\n num1 = s[:x]\r\n num2 = s[x:y]\r\n num3 = s[y:]\r\n\r\n if len(set(b)) != 2:\r\n continue\r\n\r\n if valid(num1) and valid(num2) and valid(num3):\r\n res.append(int(num1) + int(num2) + int(num3))\r\n\r\nif not len(res):\r\n print(-1)\r\nelse:\r\n print(max(res))\r\n\r\n\r\n\r\n", "a = input()\r\nn = len(a)\r\nfl=1\r\ntemp = 0\r\nfor x in range(n-1):\r\n x+=1\r\n for y in range(n-1-x):\r\n y+=x+1\r\n if len(a[:x]) > 1 and a[:x][0] == '0':\r\n continue \r\n a1 = int(a[:x])\r\n if a1 > 1000000:\r\n continue\r\n \r\n if len(a[x:y]) > 1 and a[x:y][0] == '0':\r\n continue \r\n b1 = int(a[x:y])\r\n if b1 > 1000000:\r\n continue\r\n \r\n if len(a[y:]) > 1 and a[y:][0] == '0':\r\n continue \r\n c1 = int(a[y:])\r\n if c1 > 1000000:\r\n continue\r\n su = a1 + b1 + c1\r\n fl=0\r\n temp=max(su,temp)\r\n\r\nif fl:\r\n print(\"-1\")\r\nelse:\r\n print(temp)", "def main():\r\n s = input()\r\n n = len(s)\r\n ans = -1\r\n for i in range(1,n):\r\n i1 = int(s[0:i])\r\n if i1>1000000:\r\n continue\r\n if str(i1)!=s[0:i]:\r\n continue\r\n for j in range(i+1,n):\r\n j1 = int(s[i:j])\r\n k1 = int(s[j:])\r\n if str(j1) != s[i:j] or str(k1) != s[j:]:\r\n continue\r\n if j1>1000000 or k1>1000000:\r\n continue\r\n ans = max(ans,i1+j1+k1)\r\n print(ans)\r\nmain()", "import sys\r\n\r\n[s] = sys.stdin.read().split()\r\n\r\ndef isvalid (s):\r\n if s == \"0\" or s==\"1000000\":\r\n return True\r\n if s[0] == '0' or len(s)>6:\r\n return False\r\n return True\r\n\r\nmx = -1\r\n\r\nfor i in range(1, len(s)):\r\n for j in range(i+1, len(s)):\r\n s1 = s[0:i]\r\n s2 = s[i:j]\r\n s3 = s[j:]\r\n\r\n if isvalid(s1) and isvalid(s2) and isvalid(s3):\r\n a = int(s1)\r\n b = int(s2)\r\n c = int(s3)\r\n mx = max(mx, a+b+c)\r\n\r\nprint(mx)\r\n", "def f(x):\r\n if x[0]=='0' and len(x)>1:\r\n return -1\r\n else:\r\n return int(x)\r\ns=input()\r\nans=-1\r\nfor i in range(1,len(s)-1):\r\n for j in range(i+1,len(s)):\r\n a=f(s[:i])\r\n b=f(s[i:j])\r\n c=f(s[j:])\r\n if a>-1 and a<=1000000 and b>-1 and b<=1000000 and c>-1 and c<=1000000:\r\n ans=max(ans,a+b+c)\r\nprint(ans)\r\n", "\nA = input()\n\nM = 10*6\n\nbest = -1\n\nfor i in range(1, len(A)):\n for j in range(i + 1, len(A)):\n #print((A[:i]), \" o \", (A[i:j]), \" o \", (A[j:]))\n #print(int(A[:i]), int(A[i:j]), int(A[j:]))\n if (A[:i] == '0' or A[0] != '0') and \\\n (A[i:j] == '0' or A[i] != '0') and \\\n (A[j:] == '0' or A[j] != '0') and \\\n int(A[:i]) <= M and int(A[i:j]) <= M and \\\n int(A[j:]) <= M:\n #print((A[:i]), \" o \", (A[i:j]), \" o \", (A[j:]))\n #print(int(A[:i]), int(A[i:j]), int(A[j:]))\n best = max([best, int(A[:i]) + int(A[i:j]) + int(A[j:])])\n\nprint(best)\n", "#!/usr/bin/env python\n# -- coding: utf-8 --\ns = input()\nn = len(s)\n\n\ndef num(x):\n if len(x) > 1 and x[0] == '0':\n return 1000000000\n x = int(x)\n if x > 1000000:\n return 1000000000\n return x\n\n\nans = -1\n\n\nfor i in range(1, n-1):\n for j in range(i+1, n):\n l = s[:i]\n m = s[i:j]\n r = s[j:]\n cur = num(l) + num(m) + num(r)\n if cur < 100000000:\n ans = max(ans, cur)\n\n\nprint(ans)\n", "#!/usr/bin/env python3\n\ns = input()\nans = -1\nfor i in range(1, len(s)):\n\tfor j in range(i + 1, len(s)):\n\t\ts_ = [s[: i], s[i : j], s[j : ]]\n\t\tgood = True\n\t\tfor t in s_:\n\t\t\tif str(int(t)) != t:\n\t\t\t\tgood = False\n\t\tfor t in s_:\n\t\t\tif int(t) > 10 * 6:\n\t\t\t\tgood = False\n\t\tif good:\n\t\t\tans = max(ans, sum(map(int, s_)))\nprint(ans)\n", "s=input()\r\na=-1\r\nfor i in range(1,len(s)-1):\r\n for j in range(i+1,len(s)):\r\n x=int(s[:i])\r\n y=int(s[i:j])\r\n z=int(s[j:])\r\n if s[0]=='0' and len(s[:i])>1:\r\n continue\r\n if s[i]=='0' and len(s[i:j])>1:\r\n continue\r\n if s[j]=='0' and len(s[j:])>1:\r\n continue\r\n if x>1e6 or y>1e6 or z>1e6:\r\n continue\r\n a=max(a,x+y+z)\r\nprint(a)\r\n", "#list(map(int,input().split()))\r\n\"\"\"for times in range(int(input())):\r\n\ts = input()\r\n\"\"\"\r\ns = input()\r\nn = len(s)\r\nmx = -1\r\nfor i in range(1,n-1):\r\n\tfor j in range(i+1,n):\r\n\t\ts1 = s[0:i]\r\n\t\ts2 = s[i:j]\r\n\t\ts3 = s[j:]\r\n\t\tif int(s1)<=1000000 and int(s2)<=1000000 and int(s3)<=1000000:\r\n\t\t\tif len(str(int(s1)))==len(s1) and len(str(int(s2)))==len(s2) and len(str(int(s3)))==len(s3):\r\n\t\t\t\tmx = max(mx,int(s1)+int(s2)+int(s3))\r\nprint(mx)\r\n\t\t\r\n\r\n\r\n\r\n\r\n", "def bad(s):\r\n if(len(s) > 1 and s[0] == '0'): return False\r\n if(int(s) > 1000000): return False\r\n return True\r\n \r\ns = input()\r\nn = len(s)\r\nans = -1\r\nfor i in range(1, n + 1):\r\n for j in range(i + 1, n):\r\n if(bad(s[:i]) and bad(s[i : j]) and bad(s[j :])):\r\n ans = max(ans, int(s[:i]) + int(s[i:j]) + int(s[j:]))\r\n \r\nprint(ans)", "def isint(strx):\r\n if strx == '0':\r\n return True\r\n if strx[0] == '0':\r\n return False\r\n return int(strx) <= 1000000\r\n \r\nmaxx = -1\r\nx = input()\r\nfor i in range(1, len(x)):\r\n for j in range(i+1, len(x)):\r\n a, b, c = x[:i], x[i:j], x[j:]\r\n if isint(a) and isint(b) and isint(c):\r\n maxx = max(maxx, int(a)+int(b)+int(c))\r\n\r\nprint(maxx)\r\n" ]	{"inputs": ["1234", "9000", "0009", "100000010000001000000", "1000000011", "9991", "1000001999", "100000010000011000000", "100000010000001000001", "102", "100", "000", "001", "090", "999999999999999999999999999999", "12345678901234567", "12635000000127683", "428595000000042345353", "48726340000000", "93246310000000", "00123456", "001234567", "0891249843934", "04234581000000", "10000000999999", "69284626624", "6061357", "1215", "5305167573651040691", "948245431759126577", "3699951264723380749", "97862382", "4073734152", "9123396793", "52027725398636318", "03990796938958", "460657644093588", "8793853284967905230", "298036933890712", "80796461750373352", "2376843019069559343", "7464340065209674219", "1551627800131899383", "20973541540356666047", "31587335978612", "744503034", "15533274860535679", "58308242321837", "9929120076123816", "623650711335", "1066168753173", "5353645507305053", "111111111111111111111111111111", "1000000999888777666", "1000001999888777666", "9998881000001777666", "9999991000000999999", "9999999999991000000", "1000000999999999999", "123", "132", "213", "231", "312", "321", "666", "012894600", "01289400", "429496729742949672974294967297", "429496729700", "429496729701", "1", "55", "99", "9991999999999999", "999199999999099", "9991990199999999", "99999900999999", "4444440044444", "0089", "00243", "008743", "0042764", "00912838", "001000000", "001000001", "12435900", "28492300", "99999900", "931863000", "23566000", "100000000", "100000100", "3246870032", "04354640947", "0734620342343", "09999990", "010000000", "010000001", "01000001000000", "1844674407370955161600", "184467440737105516141111", "1844674407371055161600", "1111111111111111111111111", "999999999999999999999", "100000110000011000001", "0018446744073709551616", "429596729610000001000", "123456789123456789123456789123", "011", "10000100001000", "091", "1234567891012131416123222443", "429496729642949672964294967296", "214748364821474836482147483648", "10000001073741824001000000", "5000000000", "999955555555555555555555", "1844674407371055161699", "99999999999999999999999999999", "009", "1844674407370955161611", "000000999", "003", "0000000009000000000", "010", "0", "000009000000", "21371283283242384239423423123", "100000010004294967300", "429596729600", "429496729510000001000000", "2147483648010000010000", "349967407479541078587181768161"], "outputs": ["37", "90", "-1", "3000000", "1000011", "109", "101000", "-1", "-1", "3", "1", "0", "1", "9", "-1", "947035", "-1", "-1", "-1", "1932463", "123456", "-1", "1735183", "1423458", "1999999", "935092", "61363", "27", "-1", "1506581", "-1", "978633", "737433", "913138", "1413743", "-1", "1105338", "-1", "1232638", "1498819", "-1", "-1", "-1", "-1", "1565978", "744537", "939616", "1006337", "323868", "773700", "981936", "1091147", "-1", "2777554", "-1", "-1", "2999998", "2999998", "2999998", "6", "6", "6", "6", "6", "6", "18", "894612", "289401", "-1", "959414", "959415", "-1", "-1", "-1", "2009989", "1999297", "2000189", "1999998", "488888", "89", "243", "8743", "42764", "912838", "1000000", "-1", "435903", "849232", "999999", "863094", "566005", "1000000", "100010", "870362", "645301", "1076963", "999999", "1000000", "1000001", "1100000", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "2", "21000", "10", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "9", "-1", "-1", "3", "-1", "1", "-1", "-1", "-1", "-1", "969314", "-1", "-1", "-1"]}	UNKNOWN	PYTHON3	CODEFORCES	24
8a2e86e2f136815a2d31168586eb8de7	Roma and Lucky Numbers	Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers. Let us remind you that lucky numbers are positive integers whose decimal representation only contains lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not. Roma's got n positive integers. He wonders, how many of those integers have not more than k lucky digits? Help him, write the program that solves the problem. The first line contains two integers n, k (1<=≤<=n,<=k<=≤<=100). The second line contains n integers ai (1<=≤<=ai<=≤<=109) — the numbers that Roma has. The numbers in the lines are separated by single spaces. In a single line print a single integer — the answer to the problem. Sample Input 3 4 1 2 4 3 2 447 44 77 Sample Output 3 2	[ "[n, k] = [int(x) for x in input().split()]\r\nL = [x for x in input().split()]\r\nc = 0\r\nfor i in L:\r\n if i.count('4') + i.count('7') <= k: c += 1\r\nprint(c)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))[:n]\r\nl1=[]\r\nfor i in l:\r\n i=str(i)\r\n p=i.count('4')\r\n q=i.count('7')\r\n l1.append(p+q)\r\nc=0\r\nfor i in l1:\r\n if i<=k:\r\n c+=1 \r\nprint(c)\r\n", "n,k = [map(int, input().split())]\r\na = [map(int, input().split())]\r\n\r\nprint(sum(sum(c in '47' for c in str(x))<=k for x in a))\r\n", "(n, k) = map(int, input().split(' '))\na = input().split()\n\nfor i in range(n):\n a[i] = int(a[i])\n\nnumbers = 0\n\nfor number in a:\n if len(str(number)) < k:\n numbers += 1\n else:\n numbers_of_lucky_digits = str(number).count('4') + str(number).count('7')\n if numbers_of_lucky_digits <= k:\n numbers += 1\n\nprint(numbers )", "n,k=map(int,input().split())\r\ncnt=0\r\nfor a in input().split():\r\n cnt+=a.count('4')+a.count('7')<=k\r\nprint(cnt)", "n,k = map(int,input().split())\r\nnums = list(map(str,input().split()))\r\ncnt= 0\r\nfor i in nums :\r\n total = i.count(\"7\")+i.count(\"4\")\r\n if total<=k:\r\n cnt+=1\r\n \r\nprint(cnt)", "def solve(t_id):\r\n n, k = map(int, input().split())\r\n ans = 0\r\n a = list(input().split())\r\n for i in range(n):\r\n s = a[i]\r\n if s.count('4') + s.count('7') <= k:\r\n ans += 1\r\n print(ans)\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", "def count(i):\r\n c = 0\r\n for j in str(i):\r\n if(j == '4' or j == '7'):\r\n c += 1\r\n return c\r\nn,k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nc = 0\r\nfor i in arr:\r\n if(count(i) <= k):\r\n c+=1\r\nprint(c)\r\n", "n, k = map(int, input().split())\nif n == 1:\n arr = [input()]\nelse:\n arr = input().split()\ncount = n\nfor sample in arr:\n if sample.count(\"4\")+sample.count(\"7\")>k:\n count -= 1\nprint(count)\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nj=0\r\nfor i in range(n):\r\n c=0\r\n while a[i]>0:\r\n if a[i]%10==4 or a[i]%10==7:\r\n c+=1\r\n a[i]=a[i]//10\r\n else:\r\n a[i]=a[i]//10\r\n if c<=k:\r\n j+=1\r\nprint(j)", "n, k = map(int, input().split())\r\n\r\nprint(sum((x.count('4') + x.count('7')) <= k for x in input().split()))", "\nn, k = [int(i) for i in input().split()]\n\nl = [x for x in input().split()]\n\nfor i in l:\n soma = i.count('4')+i.count('7')\n if (soma>k):\n n -= 1\n \nprint(n)\n\n", "n, k = map(int, input().split())\r\na = list(filter(lambda i: i.count('4') + i.count('7') <= k, input().split()))\r\n\r\nprint(len(a))\r\n", "n, k = map(int, input().split())\r\na = list(map(str, input().split()))\r\n\r\nans = 0\r\nfor i in range(n):\r\n cnt = 0\r\n\r\n for j in range(len(a[i])):\r\n if a[i][j] == '4' or a[i][j] == '7':\r\n cnt += 1\r\n\r\n if cnt <= k:\r\n ans += 1\r\n\r\nprint(ans)", "if __name__ == '__main__':\r\n\tn, k = [int(i) for i in input().split()]\r\n\tprint(len([i for i in input().split() if i.count('4') + i.count('7') <= k]))", "n,k=[int(x) for x in input().split()]\r\nres=0\r\nfor i in [int(x) for x in input().split()]:\r\n tmp=[int(x) for x in str(i)]\r\n if tmp.count(4)+tmp.count(7)<=k:res+=1\r\nprint(res)\r\n", "from collections import Counter\r\na=[int(k) for k in input().split()]\r\nn=a[0]\r\nk=a[1]\r\ncount=0\r\nb=[k for k in input().split()]\r\nfor i in b:\r\n c=Counter(i)\r\n if c.get(\"4\",0)+c.get(\"7\",0)<=k:\r\n count+=1\r\nprint(count)\r\n", "def check(n,k):\r\n s=str(n);\r\n c7=s.count('7');\r\n c4=s.count('4');\r\n if c4+c7>k:\r\n return False\r\n else:\r\n return True\r\n\r\nn,k=map(int,input().split());\r\nl=list(map(int,input().split()));\r\nans=0\r\nfor i in l:\r\n if check(i,k)==True :\r\n ans+=1\r\nprint(ans)\r\n", "n,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))[:n]\r\nq=rem=0\r\nfc=len(a)\r\n#print(a)\r\nfor i in range(n):\r\n #print(a)\r\n c=0\r\n rem=a[i]\r\n while(rem!=0): \r\n q=rem%10\r\n rem//=10\r\n #print(q)\r\n if(q==4 or q==7): \r\n\r\n c+=1\r\n #print(\"\\n\")\r\n \r\n #print(c)\r\n \r\n if(c>m):\r\n fc-=1\r\n#print(a)\r\nprint(fc)", "l1=[int(i) for i in input().split()]\r\nl2=[j for j in input().split()]\r\ncount=0\r\nfor k in l2:\r\n c4=k.count(\"4\")\r\n c7=k.count(\"7\")\r\n if c4+c7<=l1[-1]:\r\n count+=1\r\nprint(count)", "n , k=input().split()\nn=int(n) ; k=int(k)\na=input()\nl =a.split()\nans=0\nfor i in range(len(l)):\n y=l[i]\n c = 0\n for j in range(len(y)):\n if y[j] == '4' or y[j] == '7':\n c+=1\n if c <= k:\n ans+=1\nprint(ans)\n\t\t \t\t\t\t \t\t \t \t\t \t \t \t \t\t", "n,k=map(int,input().split())\r\narr=list(map(int,input().split(' ')))\r\nc=0\r\nfor i in arr:\r\n if((str(i).count('4'))+(str(i).count('7'))<=k):\r\n c+=1\r\nprint(c)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor s in a:\r\n if str(s).count('4') + str(s).count('7') <= k:\r\n ans += 1\r\nprint(ans)", "try:\r\n \r\n a,b=map(int,input().split())\r\n s=[int(i) for i in input().split()]\r\n \r\n count=0\r\n for i in range(a):\r\n n=s[i]\r\n k=[int(d) for d in str(n)]\r\n m=0\r\n for i in range(len(k)):\r\n if(k[i]==4 or k[i]==7 ):\r\n m=m+1\r\n if(m<=b):\r\n count=count+1\r\n \r\n print(count)\r\n \r\nexcept:\r\n pass\r\n", "def cnt(n,k):\r\n cnt = 0\r\n while n:\r\n if n%10 in (4,7):\r\n cnt+=1\r\n n = n//10\r\n return cnt <= k\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\na = list(filter(lambda x:cnt(x,k),a))\r\nprint(len(a))", "n, k = map(int,input().split())\r\na = input().split()\r\nb = 0\r\nc = []\r\nd = 0\r\nfor i in range(n):\r\n a2 = int(a[i])\r\n for j in range(len(str(a2))):\r\n if len(str(a2)) == 1:\r\n if a2 == 4 or a2 == 7:\r\n b += 1\r\n else:\r\n a3 = str(a2)\r\n if a3[j] == '4' or a3[j] == '7':\r\n b += 1\r\n c.append(b)\r\n b = 0\r\nfor i in range(len(c)):\r\n if c[i] <= k:\r\n d += 1\r\nprint(d)", "# 3 4\r\n# 1 2 4\r\nnk = input().split()\r\nn, k = nk[0], nk[1]\r\n# print(n, k)\r\narrofnums = []\r\nanswercount = 0\r\n[arrofnums.append(i) for i in input().split()]\r\nfor i in range(len(arrofnums)):\r\n kcount = 0\r\n # print()\r\n for j in range(len(arrofnums[i])):\r\n # print(arrofnums[i][j])\r\n # print(type(arrofnums[i][j]))\r\n int(arrofnums[i][j])\r\n if int(arrofnums[i][j]) == 4 or int(arrofnums[i][j]) == 7:\r\n kcount += 1\r\n if kcount <= int(k):\r\n answercount += 1\r\nprint(answercount)\r\n\r\n\r\n", "n,k=map(int, input().split())\r\nl=list(input().split())\r\nc = 0\r\nfor i in l:\r\n if i.count('7') + i.count('4') <= k:\r\n c += 1\r\nprint(c) ", "n,k = map(int,input().split())\r\nsumma = 0\r\na = input().split()\r\nfor i in a:\r\n if i.count(\"4\")+i.count(\"7\")<=k:\r\n summa+=1\r\nprint(summa)", "temp = [int(x) for x in input().split()]\r\nn = temp[0]\r\nk = temp[1]\r\na = input().split()\r\nresult = 0\r\nfor x in a:\r\n if (x.count('4') + x.count('7')) <= k:\r\n result += 1\r\nprint(result)\r\n", "n,k=map(int,input().split())\r\nl=input().split()\r\nlist1=[\"4\",\"7\"]\r\nsum1=0\r\nfor i in l:\r\n\tcount=0\r\n\tfor j in range(len(i)):\r\n\t\tif i[j] in list1:\r\n\t\t\tcount+=1\r\n\tif count<=k:\r\n\t\tsum1+=1\r\nprint(sum1)", "n=list(map(int,input().split()))\r\nn1=input().split()\r\ns=0\r\nfor i in n1:\r\n if((i.count('4')+i.count('7'))<=n[1]):\r\n s=s+1\r\nprint(s)\r\n", "n,k=map(int,input().split())\na=input().split()\nout=0\nfor i in a:\n if i.count('4')+i.count('7')<=k:\n out+=1\nprint(out)\n \t \t \t\t \t \t \t\t \t \t \t \t\t\t", "n,k = map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list()\r\nans= 0\r\nfor item in a:\r\n j = str(item).count('7') + str(item).count('4')\r\n if j<=k :\r\n ans+=1\r\nprint(ans)", "n, k = map(int, input().split()) \nnumbers = list(map(int, input().split())) \n\ncnt = 0 \n\nfor num in numbers:\n lucky_digits = 0 \n \n while num > 0:\n digit = num % 10\n if digit == 4 or digit == 7:\n lucky_digits += 1\n num //= 10\n \n if lucky_digits <= k: \n cnt += 1\n\nprint(cnt) \n", "n,k = map(int,input().split())\nl = list(map(str,input().split()))\ns = 0\nfor i in l:\n temp1 = i.count('4')\n temp2 = i.count('7')\n temp = temp1+temp2\n if temp<=k:\n s += 1\nprint(s)\n \t \t \t \t \t\t \t \t \t \t", "n,k=input().split()\r\na=list(map(str,input().split()))\r\nl=[]\r\nfor i in a:\r\n if i.count('4')+i.count('7')<=int(k):l.append(i)\r\nprint(len(l))\r\n\r\n\r\n\r\n\r\n\r\n", "a, b = map(int, input().split())\r\nl = list(input().split())\r\nc = 0\r\nfor i in l:\r\n if (i.count('4') + i.count('7')) <= b:\r\n c += 1\r\nprint(c)\r\n", "x,y=map(int,input().split(' ',1))\r\narray=list(map(int,input().split(' ')))\r\nlucky=[4,7]\r\ncount=0\r\n\r\nfor i in array:\r\n kk1=0\r\n num=str(i)\r\n for x in range(len(num)):\r\n if int(num[x]) in lucky:\r\n kk1+=1\r\n if kk1<=y:\r\n count+=1\r\nprint(count)\r\n\r\n\r\n\r\n\r\n# if num[x] in lucky:\r\n # k+=1", "n,k=input().split()\n\nlst=input().split(\" \")\n#print(lst)\n\nhow_many=0\nfor x in lst:\n lucky=0\n for y in x:\n #print(y)\n if y=='4' or y=='7':\n lucky+=1\n #print(lucky)\n if lucky<=int(k):\n how_many+=1\n\nprint(how_many)\n \t\t \t \t\t\t \t\t \t \t \t\t\t\t \t \t \t\t", "def solve(n, k, arr):\r\n c = 0\r\n for x in arr:\r\n v = str(x)\r\n if v.count(\"4\") + v.count(\"7\") <= k:\r\n c += 1\r\n\r\n return c\r\n\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nprint(solve(n, k, arr))", "a, b = [int(i) for i in input().split()]\r\ncount = 0\r\nd = [i for i in input().split()]\r\nfor i in range(a):\r\n if (d[i].count('7') + d[i].count('4') <= b):\r\n count += 1\r\nprint(count)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nr=0\r\nfor i in range(n):\r\n e=str(l[i])\r\n r1=e.count('4')\r\n r2=e.count('7')\r\n if(r1+r2<=k):\r\n r=r+1\r\nprint(r)", "def main() -> None:\r\n n, k = map(int, input().split())\r\n ans = 0\r\n a = input().split()\r\n for i in range(n):\r\n ans += (a[i].count('4') + a[i].count('7')) <= k\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = map(int, input().split())\r\na = input().split()\r\ncnt = 0\r\n\r\nfor i in a:\r\n if i.count('4') + i.count('7') <= k:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "n, k = map(int,input().split())\na = [int(x) for x in input().split()]\ndef count_lucky(n):\n ans = 0\n while n>0:\n if n%10==4 or n%10==7:\n ans += 1\n n //= 10\n return ans\nresult = 0\n\nfor x in a:\n if count_lucky(x)<=k:\n result += 1\nprint(result)\n", "n,m=map(int,input().split())\nans=0\na=input().split()\nfor i in a:\n k=i.count('4')+i.count('7')\n if(k<=m):\n ans+=1\nprint(ans)\n\t\t\t\t\t \t \t \t\t \t\t\t \t \t \t \t", "n, k = map(int, input().split())\r\nnl = input().split()\r\nc = 0\r\nfor i in nl:\r\n four = i.count('4')\r\n seven = i.count('7')\r\n if (four+seven)<=k:\r\n c += 1\r\nprint(c)", "x,y=input().split()\nx=int(x)\ny=int(y)\nc=input()\nd=c.split()\ncntt=0\nfor i in range(len(d)):\n for j in range(len(d[i])):\n if (d[i])[j]==\"7\" or (d[i])[j]==\"4\":\n cntt+=1\n if cntt>y:\n x-=1\n cntt=min(cntt,0)\nprint(x)\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\naa=input()\r\naa=aa.split()\r\na=[]\r\nfor i in aa:\r\n a.append(i)\r\nc=0\r\nfor i in a:\r\n if i.count('4')+i.count('7')<=k:\r\n c+=1\r\nprint(c)", "def solve():\n n, k = [int(x) for x in input().split()]\n a = [int(x) for x in input().split()]\n ans = 0\n\n for i in range(n):\n lucky = 0\n while True:\n if a[i] == 0:\n break\n if a[i] % 10 == 4 or a[i] % 10 == 7:\n lucky += 1\n a[i] //= 10\n\n if lucky <= k:\n ans += 1\n\n print(ans)\n\n\nsolve()\n\n\t \t\t \t\t \t \t \t\t \t\t \t\t\t\t\t", "n,k=map(int,input().split())\r\nl=list(map(int,input().split())) \r\nans=0\r\nfor e in l:\r\n c=0\r\n while(e!=0):\r\n if(e%10 in [4,7]):\r\n c+=1\r\n e=e//10\r\n if(c<=k):\r\n ans+=1\r\nprint(ans) ", "n, k = map(int, input().split())\r\n\r\nt = 0\r\nfor x in input().split():\r\n t += 1 if (x.count(\"4\") + x.count(\"7\") <= k) else 0\r\nprint(t)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Aug 14 10:53:55 2023\r\n\r\n@author: pc\r\n\"\"\"\r\n\r\nn, k = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor num in numbers:\r\n lucky_digits = str(num).count('4') + str(num).count('7')\r\n if lucky_digits <= k:\r\n count += 1\r\n\r\nprint(count)\r\n", "n, k = map(int,input().split())\r\nnumbers = list(input().split())\r\nnLucky, counter = 0, 0\r\nfor i in range(n):\r\n for j in range(len(numbers[i])):\r\n if numbers[i][j] == \"4\" or numbers[i][j] == \"7\":\r\n nLucky += 1\r\n if nLucky > k:\r\n counter += 1\r\n break\r\n nLucky = 0\r\n \r\n\r\nprint(n - counter)\r\n \r\n", "import sys\ninput = sys.stdin.readline\n\nn, k = [int(i) for i in input().split()]\na = [i for i in input().split()]\nans = 0\nfor i in a:\n if i.count('4') + i.count('7') <= k:\n ans += 1\nprint(ans)\n", "k = int(input().split()[1])\r\nnums = [i for i in input().split()]\r\n\r\noutput = 0\r\n\r\nfor num in nums:\r\n if (num.count('4') + num.count('7') <= k):\r\n output += 1\r\n \r\nprint(output)", "n,k=map(int,input().split())\r\nl1=input().split()\r\ncountans=0\r\nfor i in range(n):\r\n\tj=0\r\n\tj=l1[i].count(\"7\")+l1[i].count(\"4\")\r\n\tif j<=k:\r\n\t\tcountans+=1 \r\nprint(countans)", "n,k=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\nc=0\r\nfor x in range(len(a)):\r\n d=str(a[x])\r\n #print(d)\r\n c7=d.count('7')\r\n c4=d.count('4')\r\n if c4+c7 <=k:\r\n c+=1\r\nprint(c)", "a = input().split()\r\nn = int(a[0])\r\nk = int(a[1])\r\nb = input().split()\r\nm = [int(i) for i in b]\r\nd = 0\r\nfor i in m:\r\n c = 0\r\n while i>0:\r\n j = i%10\r\n i = i//10\r\n if j==4 or j==7:\r\n c+=1\r\n if c<=k:\r\n d+=1\r\nprint(d)\r\n\r\n", "n, k = map(int, input().split())\r\nvalues = input().split()\r\nlucky_digits = [4, 7]\r\nresult = 0\r\n\r\nfor value in values:\r\n local_count = 0\r\n for digit in value:\r\n if int(digit) in lucky_digits:\r\n local_count += 1\r\n if local_count <= k :\r\n result +=1 \r\nprint(result)\r\n ", "n,k=map(int,input().split())\r\nl=list(input().split())\r\nans=0\r\nfor i in l:\r\n a=i.count('4')\r\n b=i.count('7')\r\n if (a+b)<=k:\r\n ans=ans+1\r\nprint(ans)", "x,y=input().split()\nx=int(x)\ny=int(y)\nc=input()\nd=c.split()\nact=0\nfor i in range(len(d)):\n for j in range(len(d[i])):\n if (d[i])[j]==\"7\" or (d[i])[j]==\"4\":\n act+=1\n if act>y:\n x-=1\n act=min(act,0)\nprint(x)\n\t \t \t \t \t \t\t\t\t \t\t \t\t \t\t\t\t", "a,b=map(int,input().split())\nl=list(map(str,input().split()))\ncount=0\nfor i in range(len(l)):\n if l[i].count('4')+l[i].count('7')<=b:\n count+=1\nprint(count)\n\t\t\t\t \t \t \t \t\t \t", "m,n=map(int,input().split())\r\nc=0\r\nfor i in list(input().split(\" \")):\r\n if i.count('4')+i.count('7')<=n:\r\n c+=1\r\nprint(c)\r\n", "n,k=map(int,input().split())\r\na=list(map(str,input().split()))\r\nmcnt=0\r\n\r\nfor i in a:\r\n cnt=0\r\n for word in i:\r\n if word=='4' or word=='7':\r\n cnt+=1\r\n if cnt<=k:\r\n mcnt+=1\r\nprint(mcnt)", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nx=k=j=int(0)\r\nwhile x<a:\r\n y=str(c[x])\r\n k=y.count(\"4\")+y.count(\"7\")\r\n if k<=b:\r\n j=j+1\r\n x=x+1\r\nprint(j)", "n, k = map(int, input().split())\ns = list(map(str, input().split()))\nsum1 = 0\nsum0 = 0\nfor i in range(n):\n if s[i].count('4') + s[i].count('7') <= k:\n sum0 = sum0 + 1\nprint(sum0)\n \t \t\t \t \t \t\t\t \t\t \t \t \t", "n, k = input().split(' ')\nns = input().split(' ')\nt = 0\nf = 0\nfor i in ns:\n\tfor j in i:\n\t\tif j == '4' or j == '7':\n\t\t\tt += 1\n\tif t <= int(k):\n\t\tf += 1\n\tt = 0\nprint(f)\n\t\t \t\t\t \t \t \t\t\t \t\t \t", "a = input().split()\r\nn = a[0]\r\nk = int(a[1])\r\nb = input().split()\r\nc = 0\r\nfor i in b:\r\n x = i.count('4') + i.count('7')\r\n if x <= k:\r\n c += 1\r\nprint(c)", "n,k=map(int,input().split())\r\nli=list(map(str,input().split()))\r\nc=0\r\nfor i in range(n):\r\n l=li[i].count('4')+li[i].count('7')\r\n if l<=k:\r\n c+=1\r\nprint(c)", "n, k = map(int, input().split())\ns = [i for i in input().split()]\ntotal = 0\nfor i in range(n):\n cont = 0\n for j in s[i]:\n if j == '4' or j == '7':\n cont += 1\n if cont <= k:\n total +=1\nprint(total)\n", "z=list(map(int,input().split()))\r\nx=list(input().split())\r\nc=0\r\nfor i in x:\r\n a=i.count(\"7\")+i.count(\"4\")\r\n if a<=z[1]:\r\n c+=1\r\nprint(c)\r\n", "n,k=map(int,input().split())\r\na=input().split()\r\nc=0\r\nfor i in a:\r\n if(i.count('4')+i.count('7')<=k):\r\n c+=1\r\nprint(c)", "n,k = map(int, input(). strip(). split())\r\narray=list(map(str,input(). strip(). split()))\r\n#print(array)\r\n#print(array[0][1])\r\ncounter = 0\r\n\r\nfor num in array:\r\n flag = 0\r\n for i in range(len(num)):\r\n if num[i] == \"4\" or num[i] == \"7\":\r\n flag = flag+1\r\n #print(\"flag is\",flag)\r\n if flag <= k :\r\n counter = counter+1\r\n\r\n\r\n\r\nprint(counter)", "n, k = list(map(int, input().split()))\na = input().split()\nprint(sum([1 for i in a if i.count('4') + i.count('7') <= k]))", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor x in a:\r\n i=str(x)\r\n if((i.count('4')+i.count('7'))<=k):\r\n c=c+1\r\nprint(c)\r\n", "n, k = map(int, input().split())\na = [int(x) for x in input().split()][:n]\nlucky = '47'\nans = 0\nfor _ in range(n):\n s = str(a[_])\n cnt = 0\n for i in range(len(s)):\n if s[i] in lucky: cnt += 1\n if i == len(s) - 1:\n if k >= cnt: ans += 1\nprint(ans)\n\t\t \t\t \t \t \t \t \t\t \t\t \t", "x,k=map(int,input().split())\r\nl=list(map(str,input().split()))\r\nc=0\r\nfor i in range(len(l)):\r\n if l[i].count('4')+l[i].count('7')<=k:\r\n c=c+1\r\nprint(c)\r\n", "n,k=map(int,input().split())\r\nl=input().split()\r\nc=0\r\nfor i in l:\r\n if i.count(\"4\")+i.count(\"7\")<=k:\r\n c=c+1\r\nprint(c)", "n, k = map(int, input().split())\r\nl = \"47\"\r\narr = input().split()\r\ncount = 0\r\nfor i in arr:\r\n temp = 0\r\n for j in i:\r\n if j in l:\r\n temp += 1\r\n if temp <= k:\r\n count += 1\r\nprint(count)\r\n", "n, k = (int(i) for i in input().split())\r\nprint(len([1 for i in input().split() if i.count('4') + i.count('7') <= k]))", "n,k=list(map(int,input().split()))\r\narr=list(input().split())\r\ncou=0\r\nfor i in range(n):\r\n c=arr[i].count(\"4\")+arr[i].count(\"7\")\r\n if c<=k:\r\n cou+=1\r\nprint(cou)\r\n", "a, b = map(int, input().split())\r\narr = list(input().split())\r\nct = 0\r\nfor n in arr:\r\n if len(n) == b:\r\n ct += 1\r\n elif n.count(\"4\") + n.count(\"7\") <= b:\r\n ct += 1\r\n\r\nprint(ct)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split(' '))\r\nl=list(input().split(' '))\r\nans=0\r\nfor x in l:\r\n s= x.count('4')+x.count('7')\r\n if(s<=k):\r\n ans+=1\r\nprint(ans)", "n , k = [int(x) for x in input().split()]\r\nins = [int(x) for x in input().split()]\r\nluckies = [4 , 7]\r\nnOfLuckies = 0\r\n\r\ndef getNumber(number , numberOfLuckies = 0):\r\n if number <= 1:\r\n return numberOfLuckies\r\n if number % 10 in luckies:\r\n numberOfLuckies += 1\r\n return getNumber(number // 10 , numberOfLuckies)\r\n\r\nfor number in ins:\r\n if getNumber(number) <= k:\r\n nOfLuckies += 1\r\n\r\nprint(nOfLuckies) ", "n , k = input().split()\nn = int(n) ; k = int(k)\na = input()\nl = a.split()\nans= 0\nfor i in range(len(l)):\n b = l[i]\n lu_di = 0\n for j in range(len(b)):\n if b[j] == '4' or b[j] == '7':\n lu_di += 1\n if lu_di <= k:\n ans += 1\nprint(ans)\n\n \t\t\t\t \t\t \t \t \t\t \t \t\t \t", "n,k = map(int,input().split())\r\ncnt=0\r\narr= map(int,input().split())\r\nfor i in arr:\r\n count=0\r\n i=str(i)\r\n count=i.count('4')\r\n count+=i.count('7')\r\n if count<=k:\r\n cnt+=1\r\nprint(cnt)", "n,k=input().split()\r\nl=input().split()\r\nc=0\r\nfor i in l:\r\n\tif i.count(\"4\")+i.count(\"7\")>int(k):\r\n\t\tc+=1\r\nprint(len(l)-c)", "n,k=map(int,input().split())\r\na='4'\r\nb='7'\r\nx=[1 if i.count('4')+i.count('7')<=k else 0 for i in input().split()]\r\nprint(x.count(1))", "def CountLuckyNumbers(s):\r\n result = 0\r\n for i in s:\r\n if i in \"47\":\r\n result += 1\r\n return result\r\n\r\nn, k = input().split()\r\nn, k = int(n), int(k)\r\nl = list(map(int, input().split()))\r\nr = 0\r\nfor i in l:\r\n #print(CountLuckyNumbers(str(i)))\r\n if CountLuckyNumbers(str(i)) <= k:\r\n r += 1\r\nprint(r)", "n,k=map(int,input().split())\r\na=list(map(str,input().split()))\r\nans=0\r\nfor i in range(0,n):\r\n\tt=a[i]\r\n\tj=t.count(\"4\")+t.count(\"7\")\r\n\tif j<=k:\r\n\t\tans+=1\r\nprint(ans)", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nl=list(map(int, input().split()))\r\ncount=int(0)\r\nfor i in l:\r\n nold=int(0)\r\n l=[]\r\n while i>0:\r\n a=i%10\r\n l.append(a)\r\n i=i//10\r\n for j in l:\r\n if j==7 or j==4:\r\n nold+=1\r\n if nold<=k:\r\n count+=1\r\nprint(count)", "x,y= input().split()\nx=int(x)\ny=int(y)\nc=input()\nd=c.split()\ncnt=0\nfor i in range (len(d)):\n for j in range (len(d[i])):\n if (d[i])[j]==\"7\" or (d[i]) [j]==\"4\":\n cnt+=1\n if cnt>y:\n x-=1\n cnt=min(cnt,0)\nprint(x)\n#kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n\t\t\t\t \t \t\t\t \t \t\t \t\t \t \t", "n, k = tuple(map(int, input().split()))\nA = list(map(int, input().split()))\n\ndef get_list_of_digits(n):\n return list(map(int, list(str(n))))\n\ndef get_lucky_count(n):\n lucky_digits = 4,7\n digits = get_list_of_digits(n)\n count = 0\n for digit in digits:\n if digit in lucky_digits:\n count+=1 \n return count\n\ncount = 0\nfor a in A:\n if get_lucky_count(a) <= k:\n count += 1\nprint(count)\n \n \n \n\n \n", "\r\nn, k = map(int, input().split())\r\narr = list(map(str, input().split()))\r\ncount_ = 0\r\nfor i in arr:\r\n if (i.count(\"4\") + i.count(\"7\")) > k:\r\n continue\r\n else:\r\n count_ += 1\r\nprint(count_)", "n,k=map(int,input().split())\r\nq=input().split()\r\nx=0\r\nfor i in q:\r\n\tif i.count('4')+i.count('7')<=k: x+=1\r\nprint(x)", "n,m = map(int,input().split())\r\na = list(input().split())\r\nv =[]\r\nb =0\r\nfor i in a:\r\n\t\tz = i.count(\"4\") + i.count(\"7\")\r\n\t\tv.append(z)\r\nfor j in v:\r\n\tif j<=m:\r\n\t\tb+=1\r\nprint(b)\r\n", "n,k = map(int, input().split())\r\nlis = [i for i in input().split()]\r\nans = 0\r\nfor i in lis:\r\n c = i.count('4') + i.count('7')\r\n if(c <= k):\r\n ans += 1\r\nprint(ans)", "n, k = map(int, input().split())\nprint(sum([1 for i in input().split() if i.count('4')+i.count('7')<=k]))", "def chck(a):\r\n\tb=0\r\n\tfor i in list(a):\r\n\t\tif i=='4' or i=='7':b+=1\r\n\treturn b\r\n\r\nn,k=map(int,input().split());l=input().split();c=0\r\nfor i in l:\r\n\tif chck(i)<=k :c+=1\r\nprint(c)", "n,k=map(int,input().split())\r\nl=list(input().split())\r\nd=0\r\nfor x in range(n):\r\n\ta=list(l[x])\r\n\tb=a.count('4')\r\n\tc=a.count('7')\r\n\tif (b+c)<=k:d+=1\r\nprint(d)", "n,k = input().split()\nn = int(n)\nk = int(k)\ns = input()\na = s.split()\nx = 0\nfor i in range(len(a)):\n counter = 0\n for j in range(len(a[i])):\n if (a[i])[j] == \"7\" or (a[i])[j] == \"4\":\n counter+=1\n if counter<=k:\n x+=1\nprint(x)\n\t\t \t\t\t\t \t\t\t \t\t \t \t\t\t", "a,b=map(int,input().split())\nc=input().split()\nd=0\nfor i in c:\n\tif i.count('4') + i.count('7')<=b:\n\t\td+=1\nprint(d)\n\t \t \t \t\t\t \t\t \t\t\t\t\t\t", "import math\r\nimport atexit\r\nimport io\r\nimport sys\r\n \r\n# input = sys.stdin.readline\r\n_OUTPUT_BUFFER = io.StringIO()\r\nsys.stdout = _OUTPUT_BUFFER\r\n \r\[email protected]\r\ndef write():\r\n sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\r\n \r\ndef array_to_string(a):\r\n s = \"\"\r\n for i in a:\r\n s += str(i)\r\n return s\r\n\r\ndef gcd(a,b): \r\n if a == 0: \r\n return b \r\n return gcd(b % a, a) \r\n \r\ndef lcm(a,b): \r\n return (ab) / gcd(a,b) \r\n \r\n# t = int(input())\r\n# while t>0:\r\n# t = t-1\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncount = 0\r\nfor i in a:\r\n num_str= str(i)\r\n four = num_str.count('4')\r\n seven = num_str.count('7')\r\n if four+seven>k:\r\n continue\r\n count += 1\r\nprint(count)", "n,k =list(map(int,input(\"\").split()))\r\nar=list(map(int,input(\"\").split()))\r\nluck=\"47\"\r\ncx=0\r\nfor i in ar:\r\n l=list(str(i))\r\n count=0\r\n for i in l:\r\n if(i==\"4\" or i==\"7\"):\r\n count=count+1\r\n if(count<=k):\r\n cx+=1\r\n \r\nprint(cx)", "n, k = map(int, input().split())\na = [int(x) for x in input().split()][:n]\nans = 0\nfor i in range(n):\n\tltr = str(a[i])\n\tif ltr.count('4') + ltr.count('7') <= k: ans += 1\nprint(ans)\n \t \t \t \t\t \t\t \t \t\t\t\t", "n,k=map(int,input().split())\r\nl=input().split()\r\nc=0\r\nfor i in l:\r\n j=0\r\n for t in i:\r\n if t==\"4\":\r\n j+=1\r\n \r\n if t==\"7\":\r\n j+=1\r\n if j<=k:\r\n c+=1\r\n \r\nprint(c)", "n,m = map(int,input().split())\r\nl = list(map(str,input().split()))\r\n\r\nans = 0\r\nfor i in l:\r\n x = i.count('4')+i.count('7')\r\n if x <= m:\r\n ans+=1\r\nprint(ans)", "# tc = int(input())\r\ntc = 1\r\nwhile tc:\r\n inp = [int(x) for x in input().split()]\r\n # n = int(input())\r\n n, k = inp[0], inp[1]\r\n # a = input()\r\n # q = input()\r\n a = [x for x in input().split()]\r\n ans = 0\r\n for i in range(n):\r\n cnt = 0\r\n for j in range(len(a[i])):\r\n if a[i][j] == '4' or a[i][j] == '7':\r\n cnt += 1\r\n if cnt <= k:\r\n ans += 1\r\n print(ans)\r\n tc -= 1\r\n", "from math import \r\n#from math import comb as nCr\r\nimport sys\r\nfrom sys import \r\ndef gI(): return map(int, sys.stdin.readline().strip().split())\r\ndef gL(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef SL(): return list(map(str, sys.stdin.readline().strip().split()))\r\nt=stdin.readline\r\np=stdout.write\r\n'''\r\nfor _ in range(int(t())):\r\n n=int(t())\r\n a,b=gI()\r\n a=gL()\r\n'''\r\nn,k=gI()\r\na=SL()\r\nprint(sum(sum(c in '47' for c in x)<=k for x in a))\r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nc = 0\r\nfor i in a:\r\n x = str(i)\r\n fr = x.count('4')\r\n se = x.count('7')\r\n if fr+se<=k:\r\n c+=1\r\nprint(c)\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nans=0\r\nl=list(map(str,input().split()))\r\nfor i in range(n):\r\n a=0\r\n a=l[i].count('4')+l[i].count('7')\r\n if(a<=k):\r\n ans+=1\r\n \r\nprint(ans)", "n,k=map(int,input().split())\r\nn1=list(map(str,input().split()))\r\na=0\r\nfor i in range(len(n1)):\r\n\tm=list(n1[i])\r\n\tc=m.count('4')\r\n\td=m.count('7')\r\n\tif(c+d<=k):\r\n\t\ta=a+1\r\nprint(a)", "n, k = map(int, input().split())\r\nq = list(map(str, input().split()))\r\nans = int(0)\r\nfor i in range(n):\r\n c = int(0)\r\n for j in range(len(q[i])):\r\n if (q[i])[j] == \"4\" or (q[i])[j] == \"7\":\r\n c += 1\r\n if c > k:\r\n break\r\n if c <= k:\r\n ans += 1\r\nprint(ans)", "n,k=[int(x) for x in input().split()]\r\narr=[int(y) for y in input().split()]\r\ncount=0\r\nfor i in arr:\r\n lucky=0\r\n s1=0\r\n while(i>0):\r\n s1=i%10\r\n if s1 == 4 or s1 == 7:\r\n lucky=lucky+ 1\r\n i=i//10\r\n \r\n if (lucky <= k):\r\n count += 1\r\n\r\nprint(count)\r\n\r\n", "a, b = map(int,input().split())\r\nc = list(map(int, input().split()))\r\ncounter = 0\r\nfor i in c:\r\n x = str(i)\r\n if x.count('4') + x.count('7') <= b:\r\n counter += 1\r\nprint(counter)", "[n,k]= map(int,input().split())\r\nx= input().split()\r\na=0\r\nfor i in x:\r\n b=0\r\n for j in i:\r\n if j==\"4\" or j==\"7\":\r\n b+=1\r\n if b<=k:\r\n a+=1\r\nprint(a) ", "# Love you atreyee my jaan\nn, k = list(map(int, input().rstrip().split()))\na = list(map(int, input().rstrip().split()))\nans = 0\nfor i in a:\n count = 0\n while (i > 0):\n d = i % 10\n i = i // 10\n if d == 4 or d == 7:\n count += 1\n if count <= k:\n ans += 1\nprint(ans)", "n, k = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Function to count the number of lucky digits in a given number\r\ndef count_lucky_digits(num):\r\n count = 0\r\n while num > 0:\r\n if num % 10 == 4 or num % 10 == 7:\r\n count += 1\r\n num //= 10\r\n return count\r\n\r\ncount = 0\r\n\r\nfor num in numbers:\r\n lucky_count = count_lucky_digits(num)\r\n if lucky_count <= k:\r\n count += 1\r\n\r\nprint(count)\r\n", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\ncount=0\r\nfor i in range(0,len(a)):\r\n s=str(a[i])\r\n if(s.count('4')+s.count('7')<=m):\r\n count=count+1\r\nprint(count)", "n, k = map(int,input().split())\r\ns = list(map(str,input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n b = s[i].count('4') + s[i].count('7')\r\n if b<=k: count+=1\r\nprint(count)", "j = input().split()\r\nn = int(j[0])\r\nk = int(j[1])\r\ns = 0\r\nl = input().split()\r\nfor i in l:\r\n for f in i:\r\n if int(f) == 4 or int(f) == 7:\r\n s += 1\r\n if s > k:\r\n n -= 1\r\n s = 0\r\nprint(n)\r\n", "n,k = map(int,input().split())\r\ns = [i for i in input().split()]\r\nc = 0\r\nfor i in range(n):\r\n\tif (s[i].count(\"4\")+s[i].count(\"7\")) <= k:\r\n\t\tc+=1\r\n\r\nprint(c)\r\n\r\n", "def solve(n,k,arr):\n\ts=0\n\tfor i in arr :\n\t\tc=0\n\t\tfor j in str(i):\n\t\t\tif j=='4' or j=='7' :\n\t\t\t\tc+=1\n\t\tif c <=k :\n\t\t\ts+=1\n\treturn s\n\n\t\n\t\n\n\t\t\n\n\t\n\n\nl3 = input()\nl3=[int(x) for x in l3.split()]\n\n\nl4 = input()\nl4 =[int(x) for x in l4.split()]\n\t\n\n\n\n\nprint(solve(l3[0],l3[1],l4))\n", "n,k = map(int,input().split())\r\nl = input().split()\r\nc=0\r\nfor val in l:\r\n if val.count(\"4\") + val.count(\"7\") <= k:\r\n c+=1\r\nprint(c)", "n , k = input().split()\nn = int(n) ; k = int(k)\na = input()\nl = a.split()\nans= 0\nfor i in range(len(l)):\n lu_di = 0\n for j in range(len(l[i])):\n if l[i][j] == '4' or l[i][j] == '7':\n lu_di+=1\n if lu_di <= k:\n ans+=1\nprint(ans)\n\n \t \t \t \t \t\t\t\t\t\t\t\t\t\t\t\t \t\t\t \t", "\"\"\"\n3 4\n1 2 4\n\"\"\"\nn,k=map(int,input().split())\nl=list(map(int,input().split()))\ndef f(n):\n c=0\n while n:\n if n%10==4 or n%10==7:\n c+=1\n n//=10\n return c\nc=0\nfor i in l:\n if f(i)<=k:\n c+=1\nprint(c)", "n, k = map(int, input().split())\r\nl = input().split()\r\nc = 0\r\nfor i in l:\r\n if not (i.count('7') + i.count('4') > k):\r\n c += 1\r\nprint(c)\r\n", "n, k = map(int, input().split())\r\na = input().split()\r\ncnt = 0\r\n\r\nfor i in a:\r\n if len(list(filter(lambda j: j == '4' or j == '7', i))) <= k:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "n, k = map(int, input().split())\r\nprint(sum([1 if x.count(\"4\") + x.count(\"7\") <= k else 0 for x in input().split()]))", "n,m=map(int,input().split());c=0\r\narr=list(map(int,input().split()))\r\nfor i in range(len(arr)):\r\n\tif str(arr[i]).count(\"4\")+ str(arr[i]).count(\"7\") <= m:\r\n\t\tc+=1\r\nprint(c)", "def roma(k,a):\r\n res=0\r\n for i in range(len(a)):\r\n n=a[i]\r\n count=0\r\n while n>0:\r\n digit=n%10\r\n if digit==4 or digit==7:\r\n count+=1\r\n n=n//10\r\n \r\n if count<=k:\r\n res+=1\r\n\r\n print(res)\r\n\r\n\r\n\r\n\r\n\r\nn=list(map(int,input('').split()))\r\na=list(map(int,input('').split()))\r\nroma(n[1],a)", "def luckyCount(arr, k):\r\n count = 0\r\n for num in arr:\r\n luckyDigits = 0\r\n while num > 0:\r\n if num % 10 in (4,7):\r\n luckyDigits += 1\r\n num //= 10\r\n if luckyDigits <= k:\r\n count += 1\r\n return count\r\n \r\nn, k = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\nprint(luckyCount(nums, k))", "\r\nx=0\r\nn,k=map(int,input().split(\" \"))\r\nX=input().split(\" \")\r\nfor i in range(n):\r\n count=0\r\n for j in range(len(X[i])):\r\n if(X[i][j]==\"4\" or X[i][j]==\"7\"):\r\n count+=1\r\n\r\n\r\n if(count<=k):\r\n x=x+1\r\nprint(x)", "n, k = map(int, input().split())\r\nli = list(map(str, input().split()))\r\nc=0\r\nfor i in range(n):\r\n if li[i].count('4')+li[i].count('7')<=k:\r\n c+=1\r\nprint(c)", "# Codeforces A. Roma and Lucky Numbers\r\n# Created by Abdulrahman Elsayed on 13/01/2021\r\n\r\ndef to_int(lis):\r\n lis2 = []\r\n for i in range(len(lis)):\r\n lis2.append(lis[i])\r\n return lis \r\n \r\nn, k = input().split()\r\nnumbers = input().split()\r\nn = int(n)\r\nk = int(k)\r\nnumbers = to_int(numbers)\r\n\r\nl = 0\r\ns = 0\r\nfor number in numbers:\r\n number = str(number)\r\n for digit in number:\r\n if ((digit == '4') or (digit == '7')):\r\n l += 1\r\n if l > k:\r\n s += 1\r\n l = 0\r\nprint(n - s) \r\n ", "n, k = map(int, input().split())\nt = 0\nfor v in input().split():\n t += (v.count('4') + v.count('7')) <= k\nprint(t)\n", "\nn,k=map(int,input().split())\nlst=list(input().split()) \nans=0\nfor i in range(n): # 0\n s=lst[i]\n cnt=0\n for j in range(len(s)):\n if(s[j]=='4' or s[j]=='7'):\n cnt+=1\n if(cnt<=k):\n ans+=1\nprint(ans)\n \t\t\t \t \t\t \t\t\t\t \t \t\t\t", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nnctr=0\r\n\r\ndef count(n):\r\n c=0\r\n n=str(n)\r\n for i in n:\r\n if i=='4' or i=='7':\r\n c=c+1\r\n return c\r\n\r\nfor i in range(len(l)):\r\n l1.append(count(l[i]))\r\n\r\nfor i in l1:\r\n if i<=b:\r\n nctr=nctr+1\r\n\r\nprint(nctr)\r\n", "n, k = map(int, input().split())\nnl = input().split()\nc = 0\nfor i in nl:\n four = i.count('4')\n seven = i.count('7')\n if (four+seven)<=k:\n c += 1\nprint(c)\n\t\t \t\t \t\t\t\t\t \t\t\t\t\t \t \t \t\t\t\t\t\t", "_, k = map(int, input().split())\r\n# a = list(I())\r\nprint(sum(i.count(\"4\")+i.count(\"7\") <= k for i in input().split()))\r\n", "a = input().split()\r\n\r\nb= int(a[0])\r\nc= int(a[1])\r\ns= input().split()\r\nd=0\r\nfor i in s:\r\n i = str(i)\r\n if i.count('4')+i.count('7')>c:\r\n d=d+1\r\n\r\nr= b-d\r\nprint(r)\r\n\r\n", "def is_lucky_number(number):\r\n while number > 0:\r\n digit = number % 10\r\n if digit != 4 and digit != 7:\r\n return False\r\n number //= 10\r\n return True\r\n\r\ndef count_numbers_with_lucky_digits(nums, k):\r\n count = 0\r\n for num in nums:\r\n lucky_digit_count = 0\r\n while num > 0:\r\n digit = num % 10\r\n if digit == 4 or digit == 7:\r\n lucky_digit_count += 1\r\n num //= 10\r\n if lucky_digit_count <= k:\r\n count += 1\r\n return count\r\nn, k = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\nresult = count_numbers_with_lucky_digits(nums, k)\r\nprint(result)\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n ans = 0\r\n for a in A:\r\n cnt = 0\r\n for c in str(a):\r\n if c == '4' or c == '7':\r\n cnt += 1\r\n if cnt <= k:\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = input().split()\r\na = list(input().split())\r\nans = 0\r\nfor num in a:\r\n count_lucky = num.count('4') + num.count('7')\r\n if count_lucky <= int(k):\r\n ans += 1\r\n\r\nprint(ans)", "n,m=map(int,input().split())\r\nl=list(map(str,input().split()))\r\np=0\r\ns=0\r\nfor i in range(n):\r\n\tj=l[i].count(\"7\")\r\n\tk=l[i].count(\"4\")\r\n\tif j+k>m:\r\n\t\tp+=1\r\n\telse:\r\n\t\ts+=1\r\nprint(s)", "n, k = [int(i) for i in input().split()]\r\na = [i for i in input().split()]\r\ncount = num = 0\r\nc_list = []\r\nfor i in a:\r\n for j in list('47'):\r\n if j in list(i): count += i.count(j)\r\n c_list.append(count)\r\n count = 0\r\nfor i in c_list:\r\n if i <= k: num += 1\r\nprint(num)", "x, y = input().split()\r\nx, y = int(x), int(y)\r\n\r\ninputs = input().split(\" \")\r\n\r\nresult = 0\r\n\r\nfor i in inputs:\r\n result += 1 if (i.count('4') + i.count('7') <= y) else 0\r\n\r\nprint(result)\r\n", "def count(char):\n\titr = 0\n\tlucky = '47'\n\tfor i in char: \n\t\tif i in lucky: itr += 1\n\treturn itr\n\nn, k = map(int, input().split())\na = [int(x) for x in input().split()][:n]\nans = 0\nfor i in range(n):\n\tif count(str(a[i])) <= k: ans += 1\nprint(ans)\n\t\t\t\t\t\t \t\t\t\t\t \t\t \t\t\t\t \t\t", "n, c = map(int, input().split())\r\na = list(map(str, input().split()))\r\n\r\ncount = 0\r\n\r\nfor k in range(n):\r\n ch = a[k]\r\n kol = ch.count('4') + ch.count('7')\r\n if kol <= c:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n", "num=list(map(int,input().split()))\r\nless=0\r\nn,k=num[0],num[1]\r\nnum=input().split()\r\nfor i in num:\r\n lucky=0\r\n for j in i:\r\n if j=='4' or j=='7':\r\n lucky+=1\r\n if lucky<=k:\r\n less+=1\r\nprint(less)", "n,k=map(int,input().split())\r\nA=list(map(str,input().split()))\r\nC,T=0,0\r\nfor i in range(n):\r\n C=A[i].count(\"7\")+A[i].count(\"4\")\r\n if C<=k:\r\n T+=1\r\nprint(T)", "x, t, = map(int, input().split())\r\n\r\nnums = input().split()\r\ncount = 0\r\n\r\nfor i in nums:\r\n if (i.count('4') + i.count('7')) <= t:\r\n count += 1\r\n\r\nprint(count)", "n, k = map(int, input().split())\na = input().split(\" \")\nfinal = 0\nfor x in range(n):\n c = 0\n for i in a[x]:\n if i == \"4\" or i == \"7\":\n c+=1\n if c <= k:\n final += 1\n\nprint(final)\n \t \t\t\t\t \t \t \t\t \t \t\t \t", "a, e = map(int, input().split())\r\nb = input().split()\r\nc = 0\r\nfor i in range(0, a):\r\n f = 0\r\n for j in (b[i]):\r\n if j == \"4\" or j == \"7\":\r\n f += 1\r\n if f <= e:\r\n c += 1\r\nprint(c)\r\n", "n, k = [int(i) for i in input().split()]\r\nprint(sum(i.count(\"4\") + i.count(\"7\") <= k for i in input().split()))\r\n", "a=input().split(\" \")\r\nn=a[0]\r\nk=a[-1]\r\nb=input().split(\" \")\r\nlucky=0\r\nfor i in b:\r\n count=0\r\n for j in i:\r\n if j==\"4\" or j==\"7\":\r\n count+=1\r\n if count<=int(k):\r\n lucky+=1\r\nprint(lucky)\r\n", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n b=0\r\n while(a[i]>0):\r\n if(a[i]%10==4 or a[i]%10==7):\r\n b=b+1\r\n a[i]=a[i]//10\r\n if(b<=k):\r\n ans=ans+1\r\nprint(ans)", "n,k=map(int,input().split())\r\na=list(map(str,input().split()))\r\n\r\ncount=0\r\nfor i in range(n):\r\n c=0\r\n for j in range(len(a[i])):\r\n if a[i][j]=='4' or a[i][j]=='7':\r\n c+=1\r\n\r\n if c<=k:\r\n count+=1\r\n\r\nprint(count)", "n,k=list(map(int,input().split()))\r\nl=input().split()\r\nc=0\r\nfor i in l:\r\n x=i.count('4')\r\n x+=i.count('7')\r\n if k>=x:c+=1\r\nprint(c)", "ip = list(map(int, input().split(\" \")))\r\nn = ip[0]\r\nk = ip[1]\r\ns = input().split(\" \")\r\nr = 0\r\nfor i in s:\r\n soMayMay = i.count(\"4\") + i.count(\"7\")\r\n if soMayMay <= k:\r\n r += 1\r\nprint(r)", "def lucky(num):\r\n ans = 0\r\n for i in range(len(num)):\r\n if num[i] == '4' or num[i] == '7':\r\n ans+= 1\r\n return ans\r\n\r\n\r\nn, k = map(int, input().split())\r\nans = 0\r\narr = [x for x in input().split()]\r\nfor i in range(len(arr)):\r\n if lucky(arr[i]) <= k:\r\n ans += 1\r\n \r\nprint(ans)", "n,k=map(int, input().split())\r\n\r\narr=list(input().split())\r\n\r\nnot_more_k = 0 \r\n\r\nfor i in arr:\r\n lucky_dig=0 \r\n\r\n for j in i:\r\n if j==\"4\" or j==\"7\":\r\n lucky_dig+=1 \r\n\r\n if lucky_dig<=k:\r\n not_more_k+=1 \r\n\r\nprint(not_more_k)\r\n ", "n,k=map(int,input().split())\r\nl1=input().split()\r\ncountans=0\r\nfor i in range(n):\r\n\tcount1=0\r\n\tfor j in l1[i]:\r\n\t\tif j==\"7\"or j==\"4\":\r\n\t\t\tcount1+=1\r\n\tif count1<=k:\r\n\t\tcountans+=1 \r\nprint(countans)", "n, k = map(int, input().split())\r\nwords = [map(str, input().split())]\r\nres = 0\r\nfor word in words:\r\n if word.count(\"4\") + word.count(\"7\") <= k:\r\n res += 1\r\n\r\nprint(res)\r\n", "n,m=list(map(int,input().strip().split()))\r\nl=list(map(int,input().strip().split()))\r\np=0\r\nfor i in l:\r\n s=str(i)\r\n t=s.count(\"4\")+s.count(\"7\")\r\n if t<=m:\r\n p +=1\r\nprint(p)", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nans=0\r\nnumbers=input().split()\r\n#numbers=[int(i) for i in numbers]\r\nfor arr in numbers:\r\n count=0\r\n for i in range(len(arr)):\r\n if(arr[i]=='4' or arr[i]=='7'):\r\n count+=1\r\n if(count<=k):\r\n ans+=1\r\n \r\n\r\nprint(ans)\r\n \r\n \r\n \r\n", "luck_digits = lambda x: sum([1 for i in x if i == '4' or i == '7'])\n\ndef solve(n, k, a):\n c = 0\n for i in a:\n if luck_digits(str(i)) <= k:\n c += 1\n return c\n\n\ndef main():\n n, k = list(map(int, input().split()))\n a = list(map(int, input().split()))\n print(solve(n, k, a))\n\n\nmain()\n", "n,k=map(int, input().split())\r\narr=list(map(int,input().split()[:n]))\r\ncounter, newc = 0, 0\r\n\r\nfor i in range(len(arr)):\r\n for j in str(arr[i]):\r\n if j == \"4\" or j == \"7\":\r\n counter += 1\r\n if counter <= k:\r\n newc += 1\r\n counter = 0\r\n\r\nprint(newc)", "n, k = map(int, input().split())\r\nans = 0\r\nfor i in input().split():\r\n v = 0\r\n v = i.count('4', 0, len(i)) + i.count('7', 0, len(i))\r\n ans += int(v <= k)\r\nprint(ans)\r\n", "n,k=map(int,input().split())\narr=list(map(str,input().split()))\nc=0\nfor i in arr:\n l=0\n for j in i:\n if j=='4' or j=='7':\n l+=1\n # print(i,l,k)\n if l<=k:\n c+=1\nprint(c)\n", "n, k = list(map(int, input().split()))\r\nnumbers = list(map(int, input().split()))\r\ncounter = 0\r\nfor number in numbers:\r\n temp = 0\r\n for char in str(number):\r\n if char == \"4\" or char == \"7\":\r\n temp += 1\r\n if temp <= k:\r\n counter += 1\r\n\r\nprint(counter)", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nn,m=map(int,input().strip().split()[:2])\nt=input().strip().split()[:n]\ncount=0\nfor x in t:\n\tif x.count('7')+x.count('4')>m:\n\t\tcount+=1\nprint(n-count)\n\n", "n,k=[int(x) for x in input().split()]\r\nx=[x for x in input().split()]\r\ndef lucky(item):\r\n count=0\r\n for i in range(len(item)):\r\n if item[i]==\"4\" or item[i]==\"7\":\r\n count+=1 \r\n return count \r\nans=0 \r\nfor item in x:\r\n if lucky(item)<=k:\r\n ans+=1 \r\n \r\nprint(ans) \r\n ", "n, k = map(int, input().split())\r\na = list(input().split())\r\ncount = 0\r\nfor i in a:\r\n\tif i.count('4')+i.count('7')>k:\r\n\t\tcount+=1\r\nprint(n-count)", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn,k=map(int,input().split())\r\na=list(map(str,input().split()))\r\nr=0\r\nfor i in range(n):\r\n if a[i].count('4')+a[i].count('7')<=k:\r\n r+=1\r\nprint(r)\r\n\r\n ", "def luky(n):\r\n c=0\r\n while n>0:\r\n if str(n%10) in \"47\": \r\n c+=1\r\n n//=10\r\n return c\r\n\r\nn,k=[int(i) for i in input().split()]\r\narr=list(map(int,input().split()))\r\nx=0 \r\nfor i in arr:\r\n if luky(i)<=k:\r\n x+=1\r\nprint(x)\r\n ", "a,b= map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=0\r\nfor j in range(a):\r\n if str(c[j]).count('4')+str(c[j]).count('7')<=b:\r\n d+=1\r\nprint(d)", "n,k = input().split()\r\nn,k = int(n), int(k)\r\n\r\nnumbers = [str(x) for x in input().split()]\r\nans=0\r\nfor x in numbers:\r\n if x.count('4') + x.count('7') <= k:\r\n ans+=1\r\nprint(ans)", "n,k=map(int,input().split())\r\na=list(input().split())\r\nans=0\r\nfor i in range(n):\r\n\tif a[i].count('4')+a[i].count('7')<=k:\r\n\t\tans+=1\r\nprint(ans)", "params = input().split(\" \")\r\nnumbers = input().split(\" \")\r\ngc = 0\r\nfor x in numbers:\r\n count = 0\r\n for y in x:\r\n if y==\"4\" or y==\"7\":\r\n count+=1 \r\n if count<=int(params[1]):\r\n gc+=1 \r\nprint(gc)", "\r\n(n,k) = tuple(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\n\r\n\r\n\r\ndef count_lucky(s):\r\n counter = 0 \r\n for ch in s: \r\n if ch == '7' or ch == '4':\r\n counter +=1 \r\n return counter\r\n\r\nr = 0\r\nfor a in arr:\r\n if count_lucky(str(a)) <= k:\r\n r+=1 \r\n \r\n \r\nprint(r)", "n,k=map(int,input().split())\r\na=list(map(str,input().split()))\r\ncount=0\r\nans=0\r\nfor i in a:\r\n for j in i:\r\n if j=='4' or j=='7':\r\n count+=1\r\n if count>k:\r\n break\r\n else:\r\n ans+=1\r\n count=0\r\nprint(ans)\r\n", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ncountx=0\r\nfor i in l:\r\n s = str(i)\r\n if(s.count('4')+s.count('7')<=k):\r\n countx += 1 \r\nprint(countx)", "n,k = list(map(int,input().split()))\r\na = list(map(str,input().split()))\r\ncount=0\r\nfor i in a:\r\n\tx=i.count('4')\r\n\ty=i.count('7')\r\n\tif x+y > k:\r\n\t\tcount+=1\r\nprint(len(a)-count)", "n, k = list(map(int, input().split()))\r\nls = input().split()\r\nc = 0\r\nfor a in ls:\r\n if not ('4' in a or '7' in a):\r\n c += 1\r\n continue \r\n count = 0\r\n for d in a:\r\n if d == '4' or d == '7':\r\n count += 1\r\n if count > k:\r\n continue\r\n else:\r\n c += 1\r\nprint(c)", "vals = n,k = [int(x) for x in input().split()]\r\n\r\narr = [str(x) for x in input().split()]\r\n\r\ntot = 0\r\n\r\nfor i in arr:\r\n four = i.count(\"4\")\r\n seven = i.count(\"7\")\r\n if four+seven <= k:\r\n tot += 1\r\n \r\n\r\nprint(tot)", "\r\n\r\nn , k = list(map(int,input().split()))\r\nnum = list(map(int,input().split()))\r\nc = 0\r\nfor i in num:\r\n if str(i).count('4') + str(i).count('7') <= k:\r\n c+=1\r\nprint(c)", "n,k=input().split()\r\nn,k=int(n),int(k)\r\nli=list(int(num) for num in input().strip().split())[:n]\r\ncn=0\r\nfor i in li:\r\n if i >=1 and i <=9 :\r\n cn+=1\r\n elif str(i).count('4') + str(i).count('7') <= k:\r\n cn+=1\r\nprint(cn)\r\n", "a,b=map(int,input().split())\nc=list(input().split())\n# for i in range(len(c)):\n# c[i]=int(c[i])\ns=[]\nfor i in c:\n if i not in s:\n s.append(i)\nm=0\nfor i in c:\n if i.count('4') + i.count('7')<=b:\n m=m+1\nprint(m)\n\n\n\n\n\n\n\t \t\t \t \t \t\t \t\t \t\t \t \t", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx,y=0,0\r\nfor i in range(n):\r\n\ts=str(l[i])\r\n\tx=s.count('4')+s.count('7')\r\n\tif x<=k:\r\n\t\ty+=1\r\nprint(y)", "n, k = map(int, input().split())\r\nprint(sum(1 for number in input().split() if number.count('4') + number.count('7') <= k))", "x = input().split()\r\nn = int(x[0])\r\nk = int(x[1])\r\n\r\ncount = 0\r\n\r\nx = input().split()\r\ntemp = []\r\nfor i in x:\r\n temp.append(int(i))\r\nfor i in temp:\r\n digit = 0\r\n for j in str(i):\r\n if int(j) == 4 or int(j) == 7:\r\n digit+=1\r\n if digit<=k:\r\n count+=1\r\nprint(count)", "L1= [int(x) for x in input().split(\" \")]\r\n\r\nn=L1[0]\r\n\r\nk=L1[1]\r\n\r\nctr=0\r\natr=0\r\nL2= [int(x) for x in input().split(\" \")]\r\n\r\nfor i in L2:\r\n string=str(i)\r\n\r\n for j in string:\r\n\r\n if j==\"4\" or j==\"7\":\r\n ctr=ctr+1\r\n if ctr>k:\r\n atr=atr+1\r\n ctr=0\r\nprint(n-atr)\r\n ", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n\tif(i<10):\r\n\t\tc+=1\r\n\telif(i<10m):\r\n\t\tc+=1\r\n\telse:\r\n\t\ta=str(i).count(\"4\")\r\n\t\tb=str(i).count(\"7\")\r\n\t\tif(a+b<=m):\r\n\t\t\tc+=1\r\nprint(c)", "n,k=map(int,input().split(\" \"))\r\na=list(map(int,input().split(\" \")))\r\ne=[]\r\nf=[]\r\nd=0\r\nfor i in a:\r\n b=str(i)\r\n e.append(b)\r\nfor j in e:\r\n c= j.count(\"4\")+j.count(\"7\")\r\n f.append(c)\r\nfor l in f:\r\n if l<=k:\r\n d=d+1\r\nprint(d)", "n, k = [int(i) for i in input().split()]\r\nls = [i for i in input().split()]\r\ncount = 0\r\nfor i in ls:\r\n if i.count('7') + i.count('4') <= k:\r\n count += 1\r\nprint(count)\r\n", "n,m=map(int,input().split())\t\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n\ts+=1\r\n\ts1=0\r\n\twhile a[i]>0:\r\n\t\tif a[i]%10==4 or a[i]%10==7:\r\n\t\t\ts1+=1\r\n\t\ta[i]=a[i]//10\t\r\n\t\tif s1>m:\r\n\t\t\ts-=1\r\n\t\t\tbreak\r\nprint(s)", "def count(n):\r\n res = 0\r\n while n > 0:\r\n if n % 10 == 4 or n % 10 == 7:\r\n res += 1\r\n n = int(n / 10)\r\n return res\r\nn, k = [int(j) for j in input().split()]\r\nnums = [int(j) for j in input().split()]\r\nres = 0\r\nfor j in range(n):\r\n if count(nums[j]) <= k:\r\n res += 1\r\nprint(res)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n z=0\r\n x=str(i)\r\n for j in x:\r\n if j==\"4\" or j==\"7\":\r\n z=z+1\r\n if z<=k:\r\n c=c+1\r\nprint(c) \r\n ", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n s=str(a[i])\r\n try:\r\n f=s.count(\"4\")\r\n except:\r\n f=0\r\n try:\r\n se=s.count(\"7\")\r\n except:\r\n se=0\r\n if f+se<=k:\r\n ans+=1\r\nprint(ans)\r\n \r\n", "n,k = map(int,input().split())\r\nar = list(input().split())\r\noc = 0\r\nfor x in ar:\r\n ldc = 0\r\n for i in range(len(x)):\r\n if x[i]=='4' or x[i]=='7':\r\n ldc += 1\r\n if ldc<=k:\r\n oc += 1\r\nprint(oc)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc1=0\r\nfor i in range(n):\r\n t=l[i]\r\n c=0\r\n while(t>0):\r\n if(t%10==4 or t%10==7):\r\n c+=1\r\n t=t//10\r\n if(c<=k):\r\n c1+=1\r\nprint(c1)\r\n", "n,k = [int(x) for x in input().split(\" \")]\r\ns = [x for x in input().split(\" \")]\r\nans = 0\r\nfor i in s:\r\n if i.count('4')+i.count('7')<=k:\r\n ans += 1\r\nprint(ans)", "n, k = map(int, input().split())\r\nlst = list(input().split())\r\nres = sum(1 for x in lst if x.count(\"4\") + x.count(\"7\") <= k)\r\nprint(res)", "[num, max] = map(int, input().split())\nmylist = list(input().split())\n\nans = 0\n\nfor num in mylist:\n if num.count('7') + num.count('4') <= max:\n ans += 1\n\nprint(ans)", "n,k=map(int,input().split())\r\ny=input()\r\ny+=\" \"\r\na,b=0,0\r\nfor i in y:\r\n if(i==\"4\" or i==\"7\"):\r\n a+=1\r\n elif(i==\" \"):\r\n if(a<=k):\r\n b+=1\r\n a=0\r\nprint(b) ", "n, k = map(int, input().split())\nv = input().split()\n\nres = 0\nfor s in v:\n if s.count('4') + s.count('7') <= k:\n res += 1\n\nprint(res)\n", "a,b=map(int,input().split())\nn=0\nc=[]\nc=input().split(\" \")\nc=[int(i) for i in c]\n\nfor i in range(a):\n m=0\n while c[i]>0:\n d=c[i]%10\n if d==4 or d==7:\n m=m+1\n c[i]=c[i]//10\n if m<=b:\n n=n+1\nprint(n)\n\n\n\t\t\t\t \t \t\t\t \t\t\t \t\t \t\t \t\t\t", "n,k = map(int,input().split())\r\narr = list(map(str,input().split()))\r\nans = 0\r\nfor i in range(len(arr)):\r\n luck = 0\r\n for t in range(len(arr[i])):\r\n if arr[i][t] == '4' or arr[i][t] == '7':\r\n luck += 1\r\n if luck <= k:\r\n ans += 1\r\nprint(ans)", "n,k = list(map(int,input().split()))\nli = list(map(int,input().split()))\nfours = 0\nsevens = 0\nans = 0\nfor i in li:\n if str(i).count(\"4\") + str(i).count(\"7\") <= k:\n ans += 1\nprint(ans)", "n, k = map(int, input().split())\r\na = list(map(int, input().split())) \r\n\r\ncount = 0\r\nfor i in a: \r\n temp_count = 0\r\n while i != 0: \r\n rem = i % 10 \r\n if rem == 4 or rem == 7: \r\n temp_count += 1 \r\n i //= 10\r\n if temp_count <= k: \r\n count += 1\r\nprint(count)", "x = input().split()\nn, k = map(int, x)\n\ny = input().split()\n#print(y)\n\ncounter = 0\nfor i in y:\n #print(i)\n sum = 0\n z = i.count(\"4\")\n a = i.count(\"7\")\n sum = a + z\n if sum <= k:\n counter += 1\n else:\n pass\n \nprint(counter)\n \n\t \t\t\t\t\t \t \t\t\t \t\t \t \t \t \t", "a,b=map(int,input().split())\r\nc=list(map(str,input().split()))\r\n\r\nd=[]\r\n\r\nfor i in c:\r\n if(i.count('4')+i.count('7')<=b):\r\n d.append(i)\r\n\r\nprint(len(d))", "n,k = map(int,input().split())\r\narr = list(map(list,input().split()))\r\ncnt_lucky = []\r\nfor item in arr:\r\n cnt = 0\r\n for itr in item:\r\n if itr == '7' or itr == '4':\r\n cnt += 1\r\n if cnt <= k:\r\n cnt_lucky.append(cnt)\r\nprint(len(cnt_lucky))", "n, d = map(int, input().split())\r\nw = list(input().split())\r\nr = 0\r\nfor it in w:\r\n s = 0\r\n for i in it:\r\n if i == '4' or i == '7':\r\n s += 1\r\n if s <= d:\r\n r += 1\r\nprint(r)", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn,m=q()\r\nc=0\r\nfor i in qs():\r\n c+=(i.count('4')+i.count('7')<=m)\r\nprint(c)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in a:\r\n tem = 0\r\n for j in str(i):\r\n if j == '4' or j == '7': tem -= -1\r\n if tem <= k: ans -= -1\r\nprint(ans)", "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,k=read_ints()\n\tret=0\n\tfor x in read().split():\n\t\tcnt=0\n\t\tfor c in x:\n\t\t\tif c==\"4\" or c==\"7\":\n\t\t\t\tcnt+=1\n\t\tif cnt<=k:\n\t\t\tret+=1\n\tprint(ret)\n\nsolve()\n", "n, k = (int(x) for x in input().split())\na = [x for x in input().split()]\nans = 0\nfor x in a:\n p = 0\n for y in x:\n if y in ['4', '7']:\n p += 1\n if p <= k:\n ans += 1\nprint(ans)\n", "\r\ndef solve(n, m):\r\n\r\n count = 0\r\n test = list(map(int, input().split()))\r\n for i in test:\r\n check = list(str(i))\r\n incount = 0\r\n for j in check:\r\n if j == '4' or j == '7':\r\n incount += 1\r\n\r\n if incount <= m:\r\n count += 1\r\n\r\n return count\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n print(solve(n, m))", "n,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nres=0\r\nfor i in a:\r\n if str(i).count('4')+str(i).count('7')<=k:\r\n res+=1 \r\nprint(res)", "n, k = map(int,input().split())\r\na = list(input().split())\r\nans=0\r\nfor b in a:\r\n ans += (b.count('4') + b.count('7') <= k)\r\nprint(ans)", "inp = input(\"\")\nn, k = list(map(int, inp.split()))\nnum = input(\"\")\nnum = [i for i in num.split()]\ncount = 0\n\nfor n in num:\n if len(n) <= k:\n count += 1\n else:\n luck_ttl = n.count(\"4\") + n.count(\"7\")\n if luck_ttl <= k:\n count += 1\n\nprint(count)\n\t \t\t \t \t \t\t \t\t\t \t \t", "a,b = map(int,input().split())\r\nc = input().split()\r\ncount = 0\r\nfor i in c:\r\n answer = 0\r\n for j in i:\r\n if j == '4' or j == '7':\r\n answer += 1\r\n if answer <= b:\r\n count+= 1\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\ncount=0\r\nfor i in l:\r\n t=str(i)\r\n c=0\r\n for j in t:\r\n if j=='4' or j=='7':\r\n c+=1 \r\n if c<=k:\r\n count+=1 \r\nprint(count)", "n,k= map(int,input().split())\r\n#reading\r\na = input().split()\r\n#dude\r\nprint(sum([i.count('4') + i.count('7') <= k for i in a]))\r\n", "n,k=map(int,input().split())\r\ncount=0\r\nl=list(map(int,input().split()))[:n]\r\nfor i in range(len(l)):\r\n z=0\r\n y=0\r\n x=str(l[i])\r\n y=y+x.count(\"4\")\r\n z=z+ x.count(\"7\")\r\n c=y+z\r\n if c<=k:\r\n count+=1\r\nprint(count)\r\n \r\n \r\n \r\n", "line1 = input()\r\nl1 = line1.split(\" \")\r\nn, k = int(l1[0]), int(l1[1])\r\nline2 = input().split(\" \")\r\nanswer = 0\r\nfor r in range(n):\r\n if line2[r].count(\"4\") + line2[r].count(\"7\") <= k:\r\n answer += 1\r\nprint(answer)\r\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\nfor num in a:\n count = 0\n while num > 0:\n if num % 10 == 4 or num % 10 == 7:\n count += 1\n num //= 10\n if count <= k:\n ans += 1\n\nprint(ans)\n\n \t\t \t \t \t\t\t \t\t \t \t\t\t\t\t\t", "n,k = map(int,input().split())\r\nl = list(input().split())\r\ncount = 0\r\nfor i in l:\r\n a = i.count('4')\r\n b = i.count('7')\r\n if a+b >k:\r\n continue\r\n else:\r\n count = count+1\r\nprint(count)\r\n", "n,k = map(int, input().split())\r\na = input().split()\r\np = 0\r\nq = 0\r\nfor i in range(n):\r\n for j in range(len(a[i])):\r\n if a[i][j] == '4' or a[i][j] == '7':\r\n p += 1\r\n if p <= k:\r\n q += 1\r\n p = 0\r\n\r\nprint(q)", "n, k = map(int, input().split())\r\na=input().split()\r\nx = 0\r\nfor i in a:\r\n if i.count(\"4\") + i.count(\"7\") <= k:\r\n x += 1 \r\nprint(x)\r\n", "n,k=map(int,input().split())\r\n\r\na=list(map(int,input().split()))\r\n\r\ncnt=0\r\n\r\nfor i in range(0,n):\r\n x=str(a[i]).count('4')+str(a[i]).count('7')\r\n if len(str(a[i]))<=k:\r\n cnt+=1\r\n elif x<=k:\r\n cnt+=1\r\nprint(cnt)", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nh = []\r\ngk = 0\r\nfor i in l:\r\n s = str(i)\r\n cnt = 0\r\n for j in s:\r\n if j == '4' or j == '7':\r\n cnt += 1\r\n h.append(cnt)\r\nfor i in h:\r\n if i > k:\r\n gk += 1\r\nprint(n - gk)\r\n \r\n", "n,k=map(int,input().split())\r\na=list(map(str,input().split()))\r\nc=0\r\nfor i in a:\r\n x=list(i)\r\n y=x.count(\"7\")+x.count(\"4\")\r\n if y<=k:\r\n c+=1\r\nprint(c)", "\n# 262 A Roma and Lucky Numbers\n\nn,k = map(int,input().split())\n\nx = [i for i in input().split()]\n\nld = [4,7]\ncounter = 0\nfor i in x:\n xx = [x for x in i.strip()]\n c = xx.count('4') + xx.count('7')\n if c <=k:\n counter += 1\nprint(counter)\n\n \n ", "def lucky(x):\r\n c=0\r\n s=str(x)\r\n for i in range(len(s)):\r\n if s[i]=='4' or s[i]=='7':\r\n c+=1\r\n return c\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor element in a:\r\n if lucky(element)<=k:\r\n c+=1\r\nprint(c)\r\n", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\ng=0\r\nfor i in range(0,len(a)):\r\n x=str(a[i])\r\n y=x.count('7')\r\n z=x.count('4')\r\n if(y+z<=k):\r\n g+=1\r\nprint(g)", "s = input().split(\" \")\r\nn = int(s[0])\r\nk = int(s[1])\r\ncount_am = 0\r\nelements = input().split(\" \")\r\nfor i in range(len(elements)):\r\n count = 0\r\n for j in range(len(elements[i])):\r\n if elements[i][j] == '4' or elements[i][j] == '7':\r\n count += 1\r\n if count <= k:\r\n count_am += 1\r\nprint(count_am)", "n,k=map(int,input().split())\nlst=list(input().split())\nans=0\nfor i in range(n):\n s=lst[i]\n cnt=0\n for j in s:\n if(j=='4' or j=='7'):\n cnt+=1\n ans+=(cnt<=k)\nprint(ans)\n\n\t\t \t \t\t\t \t \t\t\t \t \t \t\t", "n,k=map(int,input().split(' '))\r\narray1=list(map(str,input().split(' ')))\r\ncount=0\r\nfor i in range(n):\r\n a=array1[i].count('4')\r\n b=array1[i].count('7')\r\n sum=a+b\r\n if sum>k:\r\n continue\r\n elif sum<=k:\r\n count=count+1\r\nprint(count)", "n,a=map(int,input().split())\r\nl=list(input().split())\r\nc=0\r\nfor i in l:\r\n v = i.count('4')\r\n w = i.count('7')\r\n if(v+w<=a):\r\n c=c+1\r\nprint(c)", "n, k = (int(x) for x in input().split())\r\nl = (str(x) for x in input().split())\r\na = 0\r\nfor x in l:\r\n c = 0\r\n for y in x:\r\n if y in '47': c += 1\r\n if c <= k: a+=1\r\nprint(a)\r\n\r\n \r\n \r\n \r\n \r\n\r\n", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\n\r\nn, k = map(int, input().split())\r\ncoutn = 0\r\nll = list(map(int, input().split()))\r\nfor i in range(len(ll)):\r\n num = str(ll[i])\r\n totlucky = num.count('4')+num.count('7')\r\n if totlucky<=k:\r\n coutn+=1\r\nprint(coutn)", "n,k = map(int, input() .split())\r\nx = list(map(int, input() .split()))\r\nt = 0\r\nfor i in range (n):\r\n l = str(x[i])\r\n y = l.count('4')\r\n z = l.count('7')\r\n if y +z > k :\r\n t+=1\r\nprint(n-t)", "n,k=[int(x) for x in input().split()]\r\nl=input().split()\r\nc=0\r\nd=0\r\nfor i in range(n):\r\n\tfor j in range(len(l[i])):\r\n\t\tif l[i][j]=='4' or l[i][j]=='7':\r\n\t\t\tc+=1\r\n\tif c<=k:\r\n\t\td+=1\r\n\tc=0\r\nprint(d)", "def dig_count(number, k):\r\n tmp_count = 0\r\n for digit in number:\r\n if digit in ['4', '7']:\r\n tmp_count += 1\r\n if tmp_count > k:\r\n return False\r\n else:\r\n return True\r\n \r\n\r\nn, k = map(int, input().split())\r\nls = list(map(str, input().split()))\r\n\r\nans = 0\r\n\r\nfor i in ls:\r\n tmp = dig_count(i, k)\r\n if tmp:\r\n ans += 1\r\n\r\n\r\nprint(ans)\r\n", "n,k = map(int,input().split())\r\nli = list(input().split())\r\ncount = 0\r\nfor i in range(n):\r\n a = li[i].count('4')\r\n b = li[i].count('7')\r\n if a+b<=k :\r\n count+=1\r\nprint(count)\r\n", "n,k = map(int,input().split())\r\nl = list(map(str,input().split()))\r\nl1 = []\r\nfor ele in l:\r\n x = ele.count(\"4\")\r\n y = ele.count(\"7\")\r\n if x+y<=k:\r\n l1.append(ele)\r\nprint(len(l1))", "t,k = map(int,input().split())\r\na = input().split()\r\ns = 0\r\nfor i in a:\r\n if i.count(\"4\") + i.count(\"7\") <= k:\r\n s+=1\r\nprint(s)", "n,k=map(int,input().split())\r\na=list(map(str,input().split()))\r\ni=0\r\nfor j in a:\r\n c=0\r\n for l in j:\r\n if l=='4' or l=='7':\r\n c=c+1\r\n if c<=k:\r\n i=i+1\r\nprint(i)\r\n", "num,maxDigit=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))[:num]\r\ncount=0\r\n\r\nfor i in range(len(l)):\r\n element=str(l[i]).count('4') +str(l[i]).count('7')\r\n if(element<=maxDigit):\r\n count+=1\r\n \r\nprint(count) ", "n,k=map(int, input().split())\nroma=input().split(\" \")\ndesired=0\nfor i in roma:\n lucky=0\n for j in i:\n if j==\"4\" or j==\"7\":\n lucky+=1\n if k>=lucky:\n desired += 1\nprint(desired)\n \n \t \t\t\t \t\t \t \t\t\t \t \t\t\t\t\t \t\t\t\t", "n, k = map(int, input().split())\r\na = [0 if i.count('4') + i.count('7') > k else 1 for i in input().split()]\r\n\r\nprint(a.count(1))\r\n", "lucky = list(map(int, input() .split()))\nnums = list(map(int, input() .split()))\nnumber = int(lucky[1])\nlength =len(nums)\ncounter = 0\ncounter2=0\nfor x in range(0,length):\n a = str(nums[x])\n for x in range(0,len(a)):\n if a[x]=='4' or a[x]=='7':\n counter = counter+1\n if counter<=number:\n counter2= counter2+1 \n counter = 0\nprint(counter2)", "def lf(n):\r\n c = 0\r\n while(n > 0):\r\n if n%10 == 4 or n%10 == 7:\r\n c+=1\r\n n= n//10\r\n return c\r\ndef ii(): return int(input())\r\ndef mi(): return map(int, input().split())\r\ndef li(): return list(mi())\r\n\r\nn,k = mi()\r\na = li()\r\ncount = 0\r\nfor i in range(n):\r\n if lf(a[i]) <= k:\r\n count+=1\r\nprint(count)", "def f(s):\r\n count = 0\r\n for i in s:\r\n if i == '4' or i == '7':\r\n count += 1\r\n return count\r\n\r\nn, k = map(int, input().split())\r\na = list(input().split())\r\nans = 0\r\nfor i in a:\r\n if f(i) <= k:\r\n ans += 1\r\nprint(ans)", "n,k=list(map(int,input().split()));print(n-sum(i.count(\"4\")+i.count(\"7\")>k for i in input().split()))", "s=input('')\r\nn,k=s.split(' ')\r\nn=int(n)\r\nk=int(k)\r\nl=[]\r\ns1=input(' ')\r\ns1=s1.split(' ')\r\n# print(s1)\r\ns1=list(s1)\r\nfor i in s1:\r\n temp=i.count('4')\r\n temp1=i.count('7')\r\n l.append([i,temp+temp1])\r\n# print(l)\r\ncount=0\r\nfor i in range(n):\r\n if(l[i][1]<=k):\r\n count+=1\r\nprint(count)\r\n \r\n ", "num, k = map(int ,input().split())\n\nout = num\n\n\nfor numbers in input().split():\n\tcountd = 0\n\tfor item in numbers: # 3 numbers for examble\n\t\t\tif item in (\"7\",\"4\"):\n\t\t\t\tcountd += 1\t\t\t\n\tif countd > k :\n\t\tout -= 1\nprint(out)\n", "n,k=map(int,input().split())\nx=input().split()\ncnt=0\nfor i in range(n):\n if x[i].count(\"4\")+x[i].count(\"7\")<=k:\n cnt+=1\nprint(cnt)\n\t\t \t\t \t \t\t\t \t \t \t \t \t \t\t\t \t", "def main():\r\n n, m = map(int, input().split())\r\n arr = input().split()\r\n\r\n ans = 0\r\n\r\n for i in arr:\r\n sevens = i.count('7')\r\n fours = i.count('4')\r\n\r\n if sevens + fours <= m:\r\n ans += 1\r\n\r\n print(ans)\r\n\r\nmain()", "a = list(map(int,input().split()))\r\nb = input().split()\r\nans = 0\r\nfor i in range(a[0]):\r\n if ( b[i].count(\"4\") + b[i].count(\"7\") <=a[1]):\r\n ans +=1\r\nprint(ans)\r\n", "result, size = map(int, input().split())\nfor i in input().split():\n count = 0\n for p in i:\n if p == '4' or p=='7':\n count+=1\n if count > size:\n result -= 1\nprint(result)\n\n\t\t \t \t\t\t \t \t \t\t \t \t", "number = list(map(int ,input().split()))\r\narr = list(map(int , input().split()))\r\ncounter = 0\r\nfor i in arr :\r\n x = str(i)\r\n count = 0\r\n for j in x :\r\n if j == '4' or j == \"7\" :\r\n count +=1\r\n if count > number[1] :\r\n break\r\n if count <= number[1] :\r\n counter += 1\r\nprint(counter)", "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,k = li()\r\nl = li()\r\nans = 0\r\nfor i in l:\r\n if str(i).count('4') + str(i).count('7') <= k:\r\n ans += 1\r\nprint(ans)", "n,k = map(int, input().split())\ncount = 0\nx = [int(x) for x in input().split()]\nfor i in x:\n if str(i).count(\"4\")+str(i).count(\"7\")<=k:\n count+=1\nprint(count)\n \t \t\t\t\t\t \t\t \t \t\t\t \t", "i , j = map(int , input().split()) \nn = list(map(int , input().split()))\nc1 = 0\nfor num in n :\n c = 0\n for num2 in str(num) :\n if num2 == \"4\" or num2 == \"7\" :\n c += 1\n\n if c <= j :\n c1 += 1\nprint(c1)\n\n\t \t \t \t\t \t\t\t\t \t\t \t \t\t", "n, k = list(map(int, input().split()))\r\n\r\nprint(sum(s.count('4')+s.count('7')<=k for s in input().split()))", "n=input().split()\r\ndata=input().split()\r\nnumber=0\r\nfor i in range(len(data)):\r\n c=str(data[i])\r\n if(c.count('4')+c.count('7')<=int(n[1])):\r\n number+=1\r\nprint(number)", "def check_number(num, k):\r\n count = 0\r\n while num:\r\n count += num % 10 in {4, 7}\r\n num //= 10\r\n return count <= k\r\n\r\n\r\nif __name__ == '__main__':\r\n res = 0\r\n n, k = map(int, input().split())\r\n for a in map(int, input().split()):\r\n res += check_number(a, k)\r\n print(res)\r\n", "n,k=[int(x) for x in input().split(\" \")]\r\nc=0\r\nl=[(x) for x in input().split(\" \")]\r\nfor i in range(n):\r\n a=l[i].count('4')\r\n b=l[i].count('7')\r\n if a+b<=k:\r\n c+=1\r\nprint(c) ", "n, k = map(int, input().split())\r\n\r\n\r\ncounter = 0;\r\narr = [];\r\nstr1 = input()\r\narr = str1.split()\r\n\r\nfor i in range(n):\r\n if(arr[i].count('4') + arr[i].count('7') <= k):\r\n counter = counter + 1\r\n\r\nprint(counter)\r\n", "n, k = map(int, input().split())\nc = 0\nfor i in input().split():\n if i.count('7') + i.count('4') <= k: c += 1\nprint(c)\n", "n,k=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nans=0\r\nfor i in ar:\r\n s=str(i)\r\n count=s.count('4')+s.count('7')\r\n if(count<=k):\r\n ans+=1\r\nprint(ans)", "i=lambda:input().split()\r\nk=int(i()[1])\r\nprint(sum(sum(c in '47'for c in x)<=k for x in i()))", "n, k = [int(x) for x in input().split(' ')]\na = [int(x) for x in input().split(' ')]\ncnt = 0\nfor i in range(n):\n if str(a[i]).count('4') + str(a[i]).count('7') <= k: cnt += 1\nprint(cnt)\n", "n, k = map(int, input().split())\r\na = list(input().split())\r\nanswer = 0\r\nfor i in a:\r\n if i.count(\"4\") + i.count(\"7\") <= k:\r\n answer+=1\r\nprint(answer)", "n,k = [int(i) for i in input().split()]\nm = [i for i in input().split()]\ncounter = 0\nfor i in range(0,n) :\n if (m[i].count('4') + m[i].count('7')) <= k : \n counter +=1 \nprint(counter)", "n,k=map(int,input().split())\r\nl=list(map(str,input().split()))\r\ncount=0\r\nfor i in l:\r\n if i.count('4')+i.count('7')<=k:\r\n count+=1\r\nprint(count)", "def f(x):\r\n c=0\r\n while x>0:\r\n if x%10 in [4,7]:\r\n c+=1\r\n x=x//10\r\n return c\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nq=0\r\nfor x in a:\r\n if f(x)<=k:\r\n q+=1\r\n\r\nprint(q)\r\n \r\n\r\n", "n,k=map(int,input().split())\r\nans=0\r\nfor x in input().split():\r\n if x.count(\"4\")+x.count(\"7\")<=k: ans+=1\r\nprint(ans)\r\n", "m,n = map(int,input().split())\nnum = list(map(int,input().split()))\nd = 0\nfor i in range(m):\n x = num[i]\n c = 0\n while x > 0:\n a = x % 10\n x = int(x / 10)\n if a == 4 or a == 7:\n c = c + 1\n if c <= n:\n d = d + 1\nprint(d)\n \t \t \t \t \t \t \t\t \t\t \t", "\r\nn, k = [int(i) for i in input().split()]\r\nnums = [int(i) for i in input().split()]\r\n\r\ndef checkCondition(num, limit):\r\n cnt = 0\r\n while num:\r\n if num%10 == 4 or num%10 == 7:\r\n cnt+=1\r\n num = num//10\r\n\r\n if cnt <= limit:\r\n return True\r\n return False\r\n\r\nans = 0\r\nfor num in nums:\r\n if checkCondition(num,k):\r\n ans+=1\r\n\r\nprint(ans)\r\n", "n,k = map(int,input().split())\na = list(map(str,input().split()))\ncount = 0\nfor i in a:\n if i.count(\"4\") + i.count(\"7\") <= k:\n count += 1\nprint(count)\n \n \t\t\t \t\t\t \t \t\t\t \t\t \t\t\t\t\t", "n,k = map(int,input().split())\r\na = list(input().split())\r\nans = n\r\nfor i in range(len(a)):\r\n con = 0\r\n for j in range(len(a[i])):\r\n if a[i][j] == \"4\" or a[i][j] == \"7\":\r\n con += 1\r\n if con > k :\r\n ans -= 1\r\nprint(ans)", "n, k = list(map(int,input().split()))\r\na = input().split()\r\nans = 0\r\nfor i in a:\r\n curr = 0\r\n for j in i:\r\n if j in '47':\r\n curr += 1\r\n if curr > k:\r\n break\r\n if curr <= k:\r\n ans += 1\r\nprint(ans)", "n = [int(_) for _ in input().split()]\narr = [str(_) for _ in input().split()]\n\nc = 0\n\nfor i in range(n[0]):\n b = 0\n num = list(map(int, arr[i]))\n for j in range(len(num)):\n if num[j] == 7 or num[j] == 4:\n b += 1\n\n if b <= n[1]:\n c += 1\n\nprint(c)\n\n", "n,k=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n s=str(list1[i])\r\n x1=s.count(\"7\")\r\n x2=s.count(\"4\")\r\n x=x1+x2\r\n if(x<=k):\r\n count+=1\r\nprint(count)", "# https://codeforces.com/contest/262/problem/A\r\n\r\nn, k = input().split()\r\nn, k = int(n), int(k)\r\n\r\nl = [i for i in input().split()]\r\ncount = 0\r\n\r\nfor i in l:\r\n if i.count(\"4\") + i.count(\"7\") <= k:\r\n count += 1\r\n\r\nprint(count)", "n,k=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\ns=0\r\nfor i in range(len(a)):\r\n count=0\r\n while a[i]!=0:\r\n if a[i]%10==4 or a[i]%10==7:\r\n count+=1\r\n a[i]=a[i]//10\r\n if count<=k:\r\n s=s+1\r\nprint(s)\r\n", "n, k = input().split()\r\nn, k = int(n), int(k)\r\nli=list(int(num)for num in input().strip().split())[:n]\r\nx=0\r\nfor i in li:\r\n if 1<= i <10 or str(i).count(\"4\") + str(i).count(\"7\") <= k:\r\n x+=1\r\nprint(x)\r\n", "n, k = map(int, input().split())\r\n_ = 0\r\nls = list(map(str,input().split()))\r\nfor s in ls:\r\n if len(s)<=k:\r\n _+=1\r\n else:\r\n if s.count('7')+s.count('4')<=k:\r\n _+=1\r\nprint(_)", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nnum = input().split()\r\ntotal = 0\r\nfor i in range(n):\r\n if num[i].count('4') + num[i].count('7') <= k:\r\n total += 1\r\nprint(total)\r\n", "n, k = map(int, input().split())\r\nprint(list(map(lambda x: x <= k, [str(i).count('4')+str(i).count('7') for i in list(map(int, input().split()))])).count(True))", "n,k= map(int,input().split())\r\na = input().split()\r\nprint(sum([i.count('4') + i.count('7') <= k for i in a]))", "def check(x):\r\n c = 0\r\n while x:\r\n c += 1 if x % 10 in (4, 7) else 0\r\n x //= 10\r\n return True if c <= k else False\r\n\r\nn, k = map(int, input().split())\r\nprint(len(list(filter(check, map(int, input().split())))))\r\n\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n/////////////////////////////////////////\r\n// //\r\n// Implemented by brownfox2k6 //\r\n// //\r\n/////////////////////////////////////////\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"", "n,k=[int(x) for x in input().split()]\r\nl=[x for x in input().split()]\r\nss=['4','7']\r\nco=0\r\nfor p in l:\r\n if p.count('4')+p.count('7')<=k:\r\n #s=list(set(list(i)))\r\n #s.sort()\r\n #if s==ss:\r\n co+=1 \r\nprint(co)\r\n \r\n", "def main():\r\n\tinp, x, count = input().split(), input().split(), 0\r\n\tfor i in x:\r\n\t\tif i.count('4') + i.count('7') <= int(inp[1]):\r\n\t\t\tcount += 1\r\n\tprint(count)\r\nmain()\r\n", "k,n=input().split()\nk=int(k) ; n=int(n)\na=input()\nl=a.split() \nans=0\nfor i in range(len(l)):\n h=l[i]\n lu_di=0\n for j in range(len(h)):\n if h[j]=='4'or h[j]=='7':\n lu_di+=1 \n if lu_di<=n:\n ans+=1 \nprint(ans)\n \t\t\t \t\t \t\t\t \t\t \t \t\t \t\t\t\t\t\t", "n, s = input(\"\").split(), input(\"\").split()\ncount = int(n[1])\nc= 0\nlist1 = []\nfor each in s:\n for every in each:\n if every in \"47\":\n c += 1\n if c <= count:\n list1.append(each)\n c = 0\nprint(len(list1))\n\t \t \t\t\t\t \t\t\t \t \t \t \t \t\t", "n,m = map(int,input().split())\r\narr=list(map(str, input().split(' ')[:n]))\r\nans = 0 \r\ndef lucky(s):\r\n temp = 0\r\n for i in range(len(s)):\r\n if(s[i]=='7' or s[i]=='4'):\r\n temp+=1\r\n if(temp<=m):\r\n return 1\r\n else:\r\n return 0\r\n \r\nfor i in range(n):\r\n if(lucky(arr[i])==1):\r\n ans+=1\r\nprint(ans)\r\n ", "# LUOGU_RID: 102443325\nn, k, a = map(int, open(0).read().split())\r\nprint(sum(str(x).count('4') + str(x).count('7') <= k for x in a))", "n,k=map(int,input().split())\r\narr=[str(i) for i in input().split()]\r\nans=0\r\nfor x in arr:\r\n c=0\r\n for i in x:\r\n if i==\"4\" or i==\"7\":\r\n c=c+1\r\n if c<=k:\r\n ans=ans+1\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n", "n, k = list(map(int, input().split(' ')))\r\na = list(input().split(' '))\r\ns = 0\r\nfor i in a:\r\n if i.count('4') + i.count('7') <= k:\r\n s += 1\r\nprint(s)\r\n", "n,k = map(int,input().split())\r\narr = list(map(str,input().split()))\r\ncnt=0\r\nfor i in range(n):\r\n s = list(arr[i])\r\n if s.count(\"4\")+s.count(\"7\")<=k:\r\n cnt+=1\r\nprint(cnt)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in a:\r\n mi=str(i)\r\n c=mi.count('4')+mi.count('7')\r\n if(c<=k):\r\n count+=1\r\n \r\nprint(count)", "n, k = map(int, input().split())\r\narr = input().split()\r\nans = 0\r\nfor i in arr:\r\n\tcount = 0\r\n\tfor j in i:\r\n\t\tif j in ['4', '7']:\r\n\t\t\tcount += 1\r\n\tif count <= k:\r\n\t\tans += 1\r\nprint(ans)", "n, k = map(int, input().split())\r\na = list(map(str, input().split()))\r\nc = 0\r\nfor i in a:\r\n if (i.count(\"4\") + i.count(\"7\")) <= k:\r\n c += 1\r\nprint(c)", "n,k=map(int,input().split())\r\ns=input().split()\r\ns=list(filter(lambda x: (x.count(\"4\")+x.count(\"7\"))<=k,s))\r\nprint(len(s))", "n, k = map(int, input().split())\nl = list(map(int,input().split()))\ncount = 0\nfor i in range(n):\n num=0\n while l[i]>0:\n m=l[i]%10\n l[i]=l[i]//10\n if m==4 or m==7:\n num+=1\n if num<=k:\n count+=1\nprint(count)\n\n\n\n \t \t\t \t \t\t\t\t\t\t \t\t\t\t\t\t\t \t\t\t\t", "# Wadea #\r\n\r\nn,k = map(int,input().split())\r\narr = list(input().split())\r\ncounter = 0\r\nfor j in arr:\r\n if j.count(\"4\") + j.count(\"7\") <= k:\r\n counter += 1\r\nprint(counter)\r\n ", "n,k = map(int,input().split())\r\nl = list(map(str,input().split()))\r\ncount = 0\r\nfor i in l:\r\n c = 0\r\n for j in i:\r\n if j == \"4\" or j == \"7\":\r\n c+=1\r\n if c>k:\r\n break\r\n if c<=k:\r\n count+=1\r\nprint(count)", "x,y=map(int,input().strip().split())\r\nl=list(map(str,input().strip().split()))\r\nn=0\r\nfor i in l:\r\n count=0\r\n for j in i:\r\n if(j==\"4\" or j==\"7\"):\r\n count+=1\r\n if(count<=y):\r\n n+=1\r\nprint(n)\r\n ", "a,b= map(int,input().split())\nc=list(map(int,input().split()))\nd=0\nfor j in range(a):\n if str(c[j]).count('4')+str(c[j]).count('7')<=b:\n d+=1\nprint(d)\n\t\t \t \t \t \t\t \t \t\t\t \t", "n, m = map(int, input(). split())\r\na = list(map(int, input(). split()))\r\nans = n\r\nkol = 0\r\nfor i in a:\r\n kol = 0\r\n for j in str(i):\r\n if j == '7' or j == '4':\r\n kol += 1\r\n if m < kol:\r\n ans -= 1\r\nprint(ans)\r\n", "n , k = input().split()\nn = int(n) ; k = int(k)\na = input()\nl = a.split()\nans = 0\nfor j in range(len(l)):\n lc = 0\n for i in range(len(l[j])):\n if l[j][i] == '4' or l[j][i] == '7':\n lc += 1\n if lc <= k:\n ans+=1\nprint(ans)\n \t \t \t \t\t \t \t\t\t \t", "n,k = map(int,input().split())\nx = [i for i in input().split()]\nc = 0\nfor j in range(len(x)) :\n \n if x[j].count('4')+x[j].count('7') <= k :\n c += 1\nprint(c)\n \n\t\t \t \t \t\t\t\t \t\t\t\t \t \t \t\t \t\t", "n,k=map(int,input().split())\r\na = list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(a)):\r\n if str(a[i]).count(\"4\")+str(a[i]).count(\"7\")<=k:\r\n c+=1\r\nprint(c)\r\n", "x,y=map(int,input().split());a=0\r\nc=list(input().split())\r\nfor i in range(len(c)) :\r\n b=list(c[i])\r\n z=b.count(\"4\")+b.count(\"7\")\r\n if z<=y :\r\n a+=1\r\nprint(a)\r\n", "n,k=[int(x) for x in input().split()]\r\na=[x for x in input().split()]\r\nans=0\r\nfor i in range(n):\r\n c=a[i].count('4')\r\n c+=a[i].count('7')\r\n if(c<=k):\r\n ans+=1\r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc,c1=0,0\r\nfor i in range(n):\r\n\ts=str(l[i])\r\n\tc=s.count('4')+s.count('7')\r\n\tif c<=k:\r\n\t\tc1+=1\r\nprint(c1)\r\n", "# -- coding: utf-8 --\n\"\"\"Untitled75.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1D1x8mgVYBiLay890KzZPAq2TMoXX-k_G\n\"\"\"\n\nn,k=map(int,input().split())\nl1=list(map(int,input().split()))\nd=0\nfor x in l1:\n x=str(x)\n c=0\n for i in x:\n if i==\"4\" or i==\"7\":\n c=c+1\n if c<=k:\n d=d+1\nprint(d)", "n, k = (int(el) for el in input().split())\r\ncnt = 0\r\nfor el in input().split():\r\n a = int(el)\r\n s = 0\r\n while a > 0:\r\n x = a % 10\r\n if x == 4 or x == 7:\r\n s += 1\r\n a //= 10\r\n if s <= k:\r\n cnt += 1\r\n\r\nprint(cnt)", "z = []\r\nw = []\r\nz[0:] = map(int ,input().split())\r\nw[0:] = map(str,input().split())\r\n#print(w)\r\ncounter = 0\r\nindex = z[0]\r\nfor i in range(z[0]):\r\n counter = w[i].count('4') + w[i].count('7')\r\n if counter > z[1]:\r\n index -= 1\r\nprint(index)\r\n", "n, k = map(int, input().split())\r\narr = input().split()\r\ncounter = 0\r\nfor i in arr:\r\n lucky = i.count(\"7\") + i.count(\"4\")\r\n if lucky <= k:\r\n counter += 1\r\nprint(counter)\r\n", "def c(s):\r\n s = str(s)\r\n return s.count(\"4\")+s.count(\"7\")\r\na,b = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nx = 0\r\nfor i in arr:\r\n if c(i)>b:\r\n x+=1\r\nprint(a-x)\r\n", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nn,k=map(int,input().split())\na=list(input().split())\nc=0\nfor i in a:\n if i.count('4')+i.count('7')<=k:\n c+=1\nprint(c) \n ", "def digit(x):\r\n s=[]\r\n while x>0:\r\n r=x%10\r\n x//=10\r\n s.append(r)\r\n return s.count(7)+s.count(4)\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n if digit(i)<=k:\r\n c+=1\r\nprint(c)", "n, k =map(int, input().split())\r\na=list(input().split())\r\nc=0\r\n\r\nfor i in a:\r\n\tif i.count('4')+i.count('7')<=k:\r\n\t\tc+=1\r\nprint(c)", "n,k=map(int,input().split())\r\nlst=input().split()\r\ncount=0\r\nfor i in lst:\r\n if i.count('7')+i.count('4')<=k:\r\n count+=1\r\nprint(count)", "a = input().split()\r\nn = int(a[0])\r\nk = int(a[1])\r\nnumbers = input().split()\r\nres = 0\r\nfor i in range(n):\r\n if numbers[i].count('4') + numbers[i].count('7') <= k:\r\n res += 1\r\nprint(res)", "n, k = map(int, input().split())\na = input().split()\nresult = 0\nfor _a in a:\n num_lucky_digits = len([digit for digit in _a if digit in {\"4\", \"7\"}])\n if num_lucky_digits <= k:\n result += 1\nprint(result)\n", "import sys\ninput = sys.stdin.readline\n\nn, k = map(int, input().split())\narr = input().split()\nans = 0\nfor num in arr:\n if num.count('4')+num.count('7') <= k:\n ans += 1\n\nprint(ans)\n", "n,k = map(int, input().split())\r\ncount = 0\r\ns = list(input().split())\r\nfor i in range(n):\r\n\ttemp = s[i]\r\n\tres = temp.count('4') + temp.count('7')\r\n\tif res > k:\r\n\t\tcount += 1\r\n\r\nprint(n-count)", "n, k = [int(x) for x in input().split()]\r\na = input().split()\r\n\r\nret = 0\r\n\r\nfor s in a:\r\n t = 0\r\n for c in s:\r\n if c == '4' or c == '7':\r\n t += 1\r\n if t <= k:\r\n ret += 1\r\n\r\nprint(ret)", "n = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\n\r\ncount = 0\r\ny = 0\r\n\r\nfor i in A:\r\n t = i\r\n while (t != 0) :\r\n x = t%10\r\n if x==4 or x==7:\r\n y += 1\r\n\r\n t = t//10\r\n\r\n if y<=n[1]:\r\n count += 1\r\n\r\n y = 0\r\n\r\nprint(count)", "n,m=map(int,input().split())\r\na=list(map(str,input().split()))\r\ncount=0\r\nfor i in a:\r\n\tz=list(i)\r\n\tq=z.count('4')\r\n\tw=z.count('7')\r\n\tif q+w<=m:\r\n\t\tcount+=1\r\nprint(count)", "s = input().split()\r\nn,k = (int(i) for i in s)\r\ns = input().split()\r\ns = [int(i) for i in s]\r\nres = 0\r\nfor i in range(n):\r\n\tc = 0\r\n\twhile(s[i]>0):\r\n\t\tm = s[i]%10\r\n\t\ts[i] = s[i]//10\r\n\t\tif(m == 4 or m==7):\r\n\t\t\tc += 1\r\n\tif(c <= k):\r\n\t\tres += 1\r\n\r\nprint(res)", "n,k=map(int,input().split())\r\nb=list(map(str,input().split()))[:n]\r\ncount=0\r\nfor i in range(n):\r\n a=b[i]\r\n c=0\r\n for j in range(len(a)):\r\n if a[j]==\"7\" or a[j]==\"4\":\r\n c=c+1 \r\n if c<=k:\r\n count=count+1 \r\nprint(count)\r\n", "n , k = input().split()\nn = int(n) ; k = int(k)\na = input()\nl = a.split()\nans = 0\nfor i in range(len(l)):\n y = l[i]\n c = 0\n for j in range(len(y)):\n if y[j] == '4' or y[j] == '7':\n c+=1\n if c <= k:\n ans+=1\nprint(ans)\n\t\t \t\t \t\t \t \t \t\t\t \t\t\t \t \t\t \t", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nfc = 0\nfor num in a:\n count = 0\n count += str(num).count('4') + str(num).count('7')\n if count <= k:\n fc += 1\nprint(fc)\n \t \t\t\t \t\t\t \t\t\t \t \t\t", "n,k=map(int,input().split())\na = input().split()\nc=0\nfor i in a:\n suma=i.count('4')+i.count('7')\n if suma<=k: c+=1\nprint(c)\n", "def f(n):\r\n s=0\r\n for a in list(str(n)):\r\n if a==\"4\" or a==\"7\":\r\n s+=1\r\n return s\r\nn,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\ns1=0\r\nfor a in l:\r\n if f(a)<=k:\r\n s1+=1\r\nprint(s1)\r\n", "def count(n,k):\r\n cnt=0\r\n while n:\r\n if n%10 in (4,7):\r\n cnt+=1\r\n n//=10\r\n return cnt<=k\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr=list(filter(lambda x: count(x,k),arr))\r\nprint(len(arr))", "n, k = list(map(int, input().split()))\r\nw = input().split()\r\n\r\nd = 0\r\nfor i in range(n):\r\n c = 0\r\n for j in range(len(w[i])):\r\n if w[i][j] == '4' or w[i][j] == '7':\r\n c += 1\r\n if c > k:\r\n d += 1\r\nprint(n-d)", "# import sys\r\n# sys.stdin= (open('input.txt','r'))\r\n# sys.stdout = (open('output.txt','w'))\r\n\r\nn, k = map(int, input().split())\r\nans = 0\r\nfor x in input().split():\r\n ans+=1 if (x.count(\"4\") + x.count(\"7\") <= k) else 0\r\nprint(ans)", "a,b=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nans=0\r\nfor i in arr:\r\n a=str(i)\r\n if(a.count('4')+a.count('7')<=b):\r\n ans+=1\r\nprint(ans)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n a=str(l[i])\r\n s=a.count('4')+a.count('7')\r\n if(s<=k):\r\n c+=1\r\nprint(c)", "def main():\r\n\tn, k=tuple(map(int,input().split()))\r\n\tcount=0\r\n\tl=(input().split())\r\n\tfor s in l:\r\n\t\tif s.count('4')+s.count('7')<=k:\r\n\t\t\tcount+=1\r\n\tprint(count)\r\nif __name__=='__main__':\r\n\tmain()", "n,k=map(int, input().split())\r\nlst=list(map(int, input().split()))\r\nans=0\r\nfor i in lst:\r\n count=0\r\n i=str(i)\r\n for j in i:\r\n if j==\"4\" or j==\"7\":\r\n count+=1\r\n if count<=k:\r\n ans+=1\r\nprint(ans)", "a,b =input().split()\na=int(a)\nb=int(b)\nc=input()\nd=c.split()\nx=0\nfor i in range(len(d)):\n for y in range(len(d[i])):\n if (d[i])[y]==\"7\"or (d[i])[y]==\"4\":\n x+=1\n if x>b:\n a-=1\n x=min(x,0)\nprint(a)\n \t\t\t \t \t \t\t\t \t \t\t \t \t \t\t\t", "def lucky(d):\r\n n1=0\r\n while d:\r\n if d%10==4 or d%10==7:\r\n n1+=1\r\n d//=10\r\n #print(d)\r\n #print(n1)\r\n if n1<=k:\r\n return 1\r\n else:\r\n return 0\r\n\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n c+=lucky(l[i])\r\nprint(c)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount1=count2=0\r\n\r\nfor i in a:\r\n count1=0\r\n while i:\r\n if i%10==4 or i%10==7:\r\n count1=count1+1\r\n i=i//10\r\n \r\n if count1<=k:\r\n count2=count2+1\r\n\r\nprint(count2)\r\n \r\n ", "\r\nn , k = map(int,input().split())\r\nl = input().split()\r\nc = 0\r\n\r\nfor i in l :\r\n if i.count('4') + i.count('7') <= k :\r\n c +=1\r\n\r\nprint(c)\r\n\r\n", "n,k = map(int,input().split())\r\na =list(map(str,input().split()))\r\ncount = 0\r\nfor i in a:\r\n if i.count(\"4\")+i.count('7')<=k:\r\n count+=1\r\nprint(count)", "# cf 262 A 800\nn, k = map(int, input().split())\nA = map(int, input().split())\n\nc = 0\nfor a in A:\n s = str(a)\n n4 = s.count('4')\n n7 = s.count('7')\n if n4 + n7 <= k:\n c += 1\nprint(c)\n", "if __name__ == '__main__':\n\tn, k = map(int,input().rstrip().split())\n\tarr = list(input().rstrip().split())\n\tc = 0\n\tfor i in range(n):\n\t\tl = len(arr[i])\n\t\tif l <= k:\n\t\t\tc += 1\n\t\telse:\n\t\t\tval = arr[i]\n\t\t\tlc = 0\n\t\t\tfor j in range(l):\n\t\t\t\tif val[j] == '4' or val[j] == '7':\n\t\t\t\t\tlc += 1\n\t\t\tif lc <= k:\n\t\t\t\tc += 1\n\tprint(c)\n\n\t\t", "n,k = map(int, input().split())\r\na = list(map(str,input().split()))\r\nc = 0\r\nfor i in range(n):\r\n if ((a[i].count('4')) + (a[i].count('7')))<=k:\r\n c = c + 1\r\n i = i + 1\r\nprint(c)", "n,k = map(int,input().split())\r\nx = input().split()\r\ncount = 0\r\nfor i in range(n):\r\n done = True\r\n p = k\r\n for j in range(len(x[i])):\r\n if x[i][j]=='4' or x[i][j]=='7':\r\n p-=1\r\n if p==-1:\r\n done = False\r\n break\r\n if done==True:\r\n count+=1\r\n\r\nprint(count)\r\n \r\n\r\n ", "n, k = [int(s) for s in input().split(' ')]\r\na = input().split(' ')\r\nprint(len([y for y in [x.count('4') + x.count('7') for x in a] if y <= k]))", "n,k=input().split()\r\ns=[str(x) for x in input().split()]\r\nt=0\r\nfor i in s:\r\n ln = i.count('4') + i.count('7')\r\n if ln <= int(k):\r\n t = t+1\r\nprint(t)\r\n ", "#romandtheluckynumbers\nN, K = [int(x) for x in input().split()]\nT = input().split()\nlucky = 0\nfor i in T:\n n = i.count(\"4\") + i.count(\"7\")\n if n > K:\n continue\n else:\n lucky += 1\nelse:\n print(lucky)", "n , m = map(int, input().split())\r\nc = n\r\nli = list(map(str, input().split()))\r\nfor i in range(n):\r\n if li[i].count('4') + li[i].count('7') > m:\r\n c -= 1\r\nprint(c)", "n,k=input().split()\r\nl=list(input().split())\r\nx=0\r\nfor i in range(len(l)):\r\n\ta=l[i].count('4')\r\n\tb=l[i].count('7')\r\n\tif(a+b<=int(k)):\r\n\t\tx+=1\r\n\t\r\nprint(x)", "n,k = map(int,input().split())\nvalues = list(input().split())\ntotal = 0\nfor i in values:\n if i.count('4') + i.count('7') <= k:\n total += 1\nprint(total)\n \t\t\t \t \t\t \t \t \t\t \t\t \t \t", "line = list(map(int,input().split()))\r\nn = line[0]\r\nk = line[1]\r\nld = [4,7]\r\nno = 0\r\nnos = input().split()\r\nfor l in nos:\r\n lis = list(map(int,list(l)))\r\n nn = 0\r\n for j in lis:\r\n if j in ld:\r\n nn = nn + 1\r\n if nn <= k:\r\n no = no + 1\r\nprint(no)", "def answer():\r\n a = input().split()\r\n k = int(a[1])\r\n a = input().split()\r\n c=[]\r\n for x in a:\r\n b = list(x)\r\n temp=0\r\n for x in b:\r\n if x ==\"4\" or x==\"7\":\r\n temp+=1\r\n c.append(temp)\r\n c = [x for x in c if x<=k]\r\n print(len(c))\r\nanswer()", "n, k = (int(i) for i in input().split())\na = input().split()\nres = sum(1 for i in a if i.count(\"4\") + i.count(\"7\") <= k)\nprint(res)\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn,k=rinput()\r\na=list(map(int,input().split()))\r\ns=[]\r\nfor i in range(n):\r\n s.append(list(str(a[i])))\r\nc=0\r\nfor i in range(n):\r\n l=s[i].count('4')\r\n l1=s[i].count('7')\r\n if(l+l1>k):\r\n c+=1\r\n\r\nprint(n-c)\r\n", "# import sys\n# sys.stdin = open('input.txt', 'r') \n# sys.stdout = open('output.txt', 'w')\n\ndef numLuckyDgits(num):\n\tcount = 0\n\twhile num :\n\t\tif num % 10 == 4 or num % 10 == 7:\n\t\t\tcount += 1\n\t\tnum //= 10\n\treturn count\n\ndef solve(arr, n, k):\n\tresult = 0\n\tfor i in range(n):\n\t\tif numLuckyDgits(arr[i]) <= k:\n\t\t\tresult += 1\n\treturn result\n\nn, k = list(map(int, input().strip().split()))\narr = list(map(int, input().strip().split()))\nresult = solve(arr, n, k)\nprint(result)", "n, k = map(int, input().split())\r\narr = [map(str, input().split())]\r\nans = 0\r\nfor s in arr:\r\n ans += s.count('4') + s.count('7') <= k\r\nprint(ans)", "n,m=map(int,input().split())\r\nnums=list(input().split())\r\ncount=0\r\nfor num in nums:\r\n if num.count('4')+num.count('7')<=m:\r\n count+=1\r\nprint(count)", "a,b = map(int,input().split())\r\nprint(sum(i.count('4') + i.count('7') <= b for i in input().split()))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ndata = list(input().split())\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n if data[i].count('4') + data[i].count('7') <= k:\r\n cnt += 1\r\n\r\nprint(cnt)", "n,k=input().split()\r\nn,k=int(n),int(k)\r\nl1=[i for i in input().split()]\r\nx=0\r\nfor i in range(n):\r\n if len(l1[i])==1:\r\n x+=1\r\n elif l1[i].count('4')+l1[i].count('7') <= k:\r\n x+=1\r\nprint(x)", "n, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nc=0\r\nfor i in a:\r\n j = str(i)\r\n d=0\r\n for k in j:\r\n if(k=='4' or k=='7'):\r\n d+=1\r\n if(d<=m):\r\n c+=1\r\nprint(c)", "list_1 = [int(x) for x in input().split(\" \")]\r\nlist = [x for x in input().split(\" \")]\r\nluck=0\r\ntotal=0\r\nfor num in list:\r\n luck=0\r\n for digit in num:\r\n if digit=='7' or digit=='4':\r\n luck+=1\r\n if luck<=list_1[1]:\r\n total+=1\r\nprint(total)", "x, y = map(int, input().split())\r\nls = list(input().split(' '))\r\nct = 0\r\nfor i in ls : \r\n if i.count('4') + i.count('7') <= y : \r\n ct += 1\r\n\r\nprint(ct)", "n,k = map(int,input().split())\nx = [i for i in input().split()]\nf = 0\n\nfor i in x :\n c = 0\n \n l = 0\n while c<=k+1 :\n if i[l]== '4' or i[l]== '7' :\n c+=1\n \n if l>=len(i)-1 :\n break\n l += 1\n \n if c<=k :\n f+=1\nprint(f)\n \n \n\n \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 = input().split()\r\n\r\nans = 0\r\nfor i in l:\r\n if not(i.count('4') + i.count('7') > k):\r\n ans+=1\r\nprint(ans)", "n,k=map(int,input().split())\r\nf=0\r\nli=list(input().split())\r\nfor i in range(n):\r\n h = 0\r\n x=li[i]\r\n for j in x:\r\n if j == '4' or j == '7':\r\n h += 1\r\n if h <= k:\r\n f += 1\r\nprint(f)", "f,g = map(int,input().split())\nl1 = list(input().split())\n\ndef func(x):\n res = 0\n for y in x:\n if y=='4' or y=='7':\n res =res+1\n else:\n pass\n if res>g:\n return 0\n else:\n return 1 \n\nress = 0 \nfor x in l1 :\n ress = ress + func(x)\nprint(ress)\n\n\n\n\n", "n,k=map(int,input().split())\r\na=[i for i in input().split()]\r\ncnt=0\r\nans=0\r\nfor i in a:\r\n for j in i:\r\n if j=='4' or j=='7':\r\n cnt+=1\r\n if cnt>k:\r\n break\r\n else:\r\n ans+=1\r\n cnt=0\r\nprint(ans)", "n, k = map(int, input().split())\r\narr = input().split()\r\ncount = 0\r\nfor num in arr:\r\n lck = 0\r\n for digit in num:\r\n if digit == \"4\" or digit == \"7\":\r\n lck += 1\r\n if lck <= k:\r\n count += 1\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\narr = input().split()\r\nres = 0\r\nfor i in arr:\r\n res += (i.count('4') + i.count('7')) <= k\r\nprint(res)\r\n", "n ,k = map(int , input().split())\r\narr = list(map(str,input().split()))\r\ns = 0\r\nfor i in arr:\r\n\ta = i.count('4')\r\n\tb = i.count('7')\r\n\tif a+b <=k:\r\n\t\ts +=1\r\nprint(s)\r\n", "n,k=input().split()\nn=int(n)\nk=int(k)\nlis=input().split(' ')\nfor i in range(n):\n lis[i]=list(lis[i])\ncnt=0\nfor i in range(n):\n cn = 0\n for j in lis[i]:\n if int(j)==4 or int(j)==7:\n cn+=1\n if cn<=k:\n cnt+=1\nprint(cnt)\n\n\n\n\t \t \t \t\t\t \t\t \t \t", "n, k = map(int, input().split())\nx = list(map(str, input().split()))\nans = 0\nfor i in range(n):\n if x[i].count('4') + x[i].count('7') <= k:\n ans += 1\nprint(ans)\n", "n,k=list(map(int,input().split()))\r\ninp=input().split()\r\ncntr=0\r\nfor i in range(n):\r\n if inp[i].count(\"7\") + inp[i].count(\"4\") <= k:\r\n cntr+=1\r\nprint(cntr)", "n, lim = map(int, input().split())\r\nl = [i for i in input().split()]\r\nk = 0\r\nfor i in l:\r\n if i.count(\"4\") + i.count(\"7\") <= lim:\r\n k += 1\r\n\r\nprint(k)", "import sys\r\nimport math\r\nimport heapq\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nfloor of a[i]\r\n if even -> could be either (no reason to)\r\n if odd -> odd\r\n\r\nbleh, if odd number of odds -> we could either convert\r\nand even to an odd or an odd to an even\r\n\r\nneed to find minimum\r\n'''\r\n\r\ndef solve():\r\n n,k = MII()\r\n a = I().split()\r\n\r\n ans = 0\r\n for num_s in a:\r\n lucky = 0\r\n for c in num_s:\r\n if c == \"4\" or c == \"7\":\r\n lucky += 1\r\n if lucky <= k:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nsolve()", "n,k=map(int,input().split())\r\nl=[]\r\nc=c1=0\r\nl.extend(input().split())\r\nfor i in l:\r\n for j in i :\r\n if j == '4' or j== '7':\r\n c+=1\r\n if c<=k :\r\n c1+=1\r\n c=0\r\nprint(c1)", "n, k = [int(i) for i in input().split()]\r\ns = input().split()\r\nc = 0\r\nfor i in s:\r\n if i.count(\"4\") + i.count(\"7\") <= k:\r\n c += 1\r\nprint(c)", "a=input().split(\" \")\nn=a[0]\nk=a[-1]\nb=input().split(\" \")\nlucky=0\nfor i in b:\n count=0\n for j in i:\n if j==\"4\" or j==\"7\":\n count+=1\n if count<=int(k):\n lucky+=1\nprint(lucky)\n\n \t\t\t\t\t\t \t\t \t \t\t\t\t\t \t\t\t\t\t\t \t\t", "n, k = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor num in numbers:\r\n num_lucky_digits = str(num).count('4') + str(num).count('7')\r\n if num_lucky_digits <= k:\r\n count += 1\r\n\r\nprint(count)\r\n", "n,k = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nans = 0\r\nfor i in l:\r\n s = str(i)\r\n c = s.count('7') + s.count('4')\r\n if c <= k: ans+=1\r\nprint(ans)\r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nf=0\r\nd=0\r\nfor i in a:\r\n f=0\r\n j=i\r\n while(j>0):\r\n if(j%10==4 or j%10==7):\r\n f=f+1\r\n j=j//10\r\n if(f<=k):\r\n d=d+1\r\nprint(d)", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nc =0\r\nfor i in a:\r\n st = str(i)\r\n ct = st.count(\"4\")+st.count(\"7\")\r\n if ct<=k:\r\n c +=1\r\nprint(c)", "n, k = map(int , input().split()) \r\n\r\narr = list( map(str , input().split()) )\r\ncount = 0 \r\nfor num in arr : \r\n lucky = 0\r\n for i in num : \r\n if i == \"4\" or i ==\"7\" :\r\n lucky +=1\r\n if lucky <= k : \r\n count+=1\r\nprint(count )", "#!/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,k = map(int, wtf[0].split())\r\n A = wtf[1].split()\r\n ans = 0\r\n for a in A:\r\n l4s = a.count('4')\r\n l7s = a.count('7')\r\n if l4s+l7s<=k:\r\n ans += 1\r\n print(ans)\r\n", "a,b=map(int,input().split())\nl=[i for i in input().split()]\nc=0\nfor i in range(a):\n if l[i].count(\"4\")+l[i].count(\"7\")<=b:\n c+=1\nprint(c) \n \t\t \t\t \t\t\t\t \t \t\t", "a, b = map(int, input().split())\nc = list(map(int, input().split()))\ncount = 0\ncount_final = 0\nfor x in c:\n for y in str(x):\n if int(y) == 4 or int(y) == 7:\n count += 1\n if count <= b:\n count_final += 1\n count = 0\nprint(count_final)\n\t \t\t \t \t\t \t \t\t\t\t \t\t \t\t\t", "a,k=map(int,input().split())\r\nl=list(map(str,input().split()))\r\nans=0\r\nfor i in l:\r\n cnt=0\r\n for j in i:\r\n if j=='4' or j=='7':\r\n cnt+=1\r\n if cnt<=k:\r\n ans+=1\r\nprint(ans)\r\n \r\n ", "n,k = map(int,input().split())\r\nprint (sum( (x.count('4')+x.count('7'))<=k for x in input().split()))", "def solve(arr,k):\n tot = 0\n for n in arr:\n count = 0\n i = 0\n for d in n:\n if d == '4' or d == '7':\n count += 1\n if count <= k:\n tot += 1\n return tot\n\ndef main():\n n,k = list(map(int, input().split(' ')))\n arr = input().split(' ')\n print(solve(arr,k))\n\nmain()\n", "n,k = map(int,input().split())\nl = list(map(int,input().split()))\na = 0\nfor i in range(0,len(l)):\n if (str(l[i])).count('4')+(str(l[i])).count('7')<=k:\n a+=1\nprint(a) \n \t \t\t \t\t\t \t \t\t \t\t \t", "n, k = list(map(int, input().split()))\narr = input().split()\n\ncount = 0\nfor num in arr:\n if (num.count('4') + num.count('7')) <= k:\n count += 1\n\nprint(count)\n \t\t \t \t \t\t \t\t \t \t \t\t \t \t", "n, k = map(int, input().split())\r\n\r\ns = input().split()\r\nc = 0\r\nfor i in s:\r\n if i.count(\"4\")+i.count(\"7\") <= k:\r\n c += 1\r\nprint(c)\r\n", "def insertion_sort(l):\r\n for i in range(len(l)):\r\n for j in (range(i)):\r\n k = i - j\r\n if l[k] >= l[k - 1]:\r\n l[k - 1], l[k] = l[k], l[k - 1]\r\n else:\r\n break\r\n return l\r\n\r\n\r\n\r\ndef selection_sort(l):\r\n for i in range(len(l)):\r\n min_ind = i\r\n min_val = l[i]\r\n for j in range(i, len(l)):\r\n if min_val > l[j]:\r\n min_val = l[j]\r\n min_ind = j\r\n l[i], l[min_ind] = l[min_ind], l[i]\r\n return l\r\n\r\n\r\ndef bubble_sort(l):\r\n for i in range(len(l) - 1):\r\n for j in range(len(l) - 1 - i):\r\n if l[j] > l[j + 1]:\r\n l[j], l[j + 1] = l[j + 1], l[j]\r\n return l\r\n\r\n\r\n# l = [5,4,3,2,6,1,3,5,6,7,8,9,0,9,8,7,6,7,8,9,8,7,1,6,4,8,32]\r\n# print(insertion_sort(l))\r\n\r\ndef is_even_list(l):\r\n for i in l:\r\n if i % 2:\r\n return False\r\n return True\r\n\r\n\r\ndef main_function():\r\n #t = int(input())\r\n output_list = []\r\n n, k = [int(i) for i in input().split(\" \")]\r\n l = [i for i in input().split(\" \")]\r\n count_top_level = 0\r\n for i in l:\r\n count_low_level = 0\r\n for j in i:\r\n if j == \"7\" or j == \"4\":\r\n count_low_level += 1\r\n if count_low_level <= k:\r\n count_top_level += 1\r\n return count_top_level\r\n\r\n\r\n\r\nprint(main_function())", "def f(n, k):\n cnt = 0\n while n > 0:\n if n % 10 == 4 or n % 10 == 7:\n cnt += 1\n n //= 10\n if cnt <= k:\n return True\n return False\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\nfor x in a:\n if f(x, k):\n ans += 1\nprint(ans)", "n,k=map(int,input().split())\r\nl=list(map(str,input().split()))\r\nans=0\r\nfor i in l:\r\n c=0\r\n for j in i:\r\n if(j=='4' or j=='7'):\r\n c+=1\r\n if(c<=k):\r\n ans+=1\r\nprint(ans)", "n, k = input().split(\" \")\nk=int(k)\nnumbers=input().split(\" \")\nlucky=0\nfor i in numbers:\n count=0\n for j in i:\n if j=='4' or j=='7':\n count+=1\n if count<=k:\n lucky+=1\nprint(lucky)\n\t\t \t \t\t \t \t\t\t\t\t\t \t \t \t\t\t \t \t", "q='47'\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nf=0\r\nfor i in a:\r\n for j in str(i):\r\n if str(j) in q:\r\n s+=1\r\n if s<=k:\r\n f+=1\r\n s=0\r\nprint(f)\r\n", "def cnt(a):\r\n c = 0\r\n while (a != 0):\r\n n = a % 10\r\n if (n == 4) or (n == 7):\r\n c = c + 1\r\n a = a // 10\r\n return c\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = 0\r\nfor i in a:\r\n if (cnt(i) <= k):\r\n d = d + 1\r\nprint(d)", "import sys, os\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline\r\nread = lambda: list(map(int, input().strip().split()))\r\n\r\n\r\ndef f(n):\r\n c = 0\r\n while n:c += (n%10 in (4,7)); n //= 10\r\n return(c)\r\n\r\ndef main():\r\n n, k = read(); arr = read(); ans = 0\r\n for i in arr:\r\n ans += (f(i) <= k)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "m, n = map(int, input().split())\nres: int = 0\nlist1 = list(map(str, input().split()))\n#print(list1)\nfor i in range(len(list1)):\n sum1 = str(list1[i]).count('4')\n sum2 = str(list1[i]).count('7')\n sum3 = sum1 + sum2\n if sum3 <= n:\n res = res + 1\nprint(res)\n\n \t\t\t \t\t \t \t \t\t\t \t \t\t\t\t\t\t", "n,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nans=0\r\nfor i in l:\r\n temp=str(i)\r\n count=0\r\n for j in temp:\r\n if j=='4' or j=='7':\r\n count+=1\r\n if count<=k:\r\n ans+=1\r\nprint(ans)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[9]:\n\n\nx=list(map(int,input().split()))\nc=0\ny=list(map(int,input().split()))\nfor i in y:\n i=str(i)\n a=i.count(\"7\")\n b=i.count(\"4\")\n if a+b <=x[1]:\n c+=1\nprint(c)\n \n \n\n\n# In[ ]:\n\n\n\n\n", "def getLuckyDigits(n):\r\n luckyDigits: int = 0\r\n luckyNums = [4,7]\r\n while n > 0:\r\n if int(n%10) in luckyNums:\r\n luckyDigits += 1\r\n n = int(n / 10)\r\n\r\n return luckyDigits\r\n\r\ndef getDigits(num):\r\n return len(str(num))\r\n\r\narr = input().split(\" \")\r\nn = int(arr[0])\r\nk = int(arr[1])\r\ncount = 0\r\n\r\nnums = input().split(\" \")\r\n\r\nfor i in range(n):\r\n currentNumber = int(nums[i])\r\n if getLuckyDigits(currentNumber) <= k:\r\n count+=1\r\n\r\nprint(count)", "n,k=list(map(int,input().split()))\r\ns=list(map(int,input().split()))\r\nf=0\r\nfor i in s:\r\n c=0\r\n for j in str(i):\r\n if j in \"74\":\r\n c+=1\r\n if c<=k:\r\n f+=1\r\n c=0\r\nprint(f)", "n, k = [int(x) for x in input().split()]\r\nlst = input().split()\r\nc = 0\r\nfor i in lst:\r\n if (i.count(\"4\") + i.count(\"7\")) <= k:\r\n c += 1\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k = map(int, input().split())\r\narr = list(input().split())\r\nans = 0\r\nfor i in arr:\r\n\tif i.count('4') + i.count('7') <= k:\r\n\t\tans += 1\r\nprint(ans)\r\n", "n,k = map(int,input().split())\r\nli = list(map(int,input().split()))\r\ncnt = 0\r\nfor data in li:\r\n s = str(data)\r\n if s.count('4')+s.count('7')<=k:\r\n cnt+=1\r\n else:\r\n pass\r\nprint(cnt)", "n, k = map(int, input().split())\r\nprint(sum(i.count('4') + i.count('7') <= k for i in input().split()))", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nn=0\r\nfor i in range(a):\r\n if str(c[i]).count('7')+str(c[i]).count('4')<=b:\r\n n+=1\r\nprint(n)", "import math\nfrom collections import defaultdict\nml=lambda:map(int,input().split())\nll=lambda:list(map(int,input().split()))\nii=lambda:int(input())\nip=lambda:list(input())\nips=lambda:input().split()\n\n\"\"\"========main code===============\"\"\"\n\na,b=ml()\nans=0\nl=list(input().split())\nfor i in l:\n k=i\n w=0\n for i in k:\n if(i=='4' or i=='7'):\n w+=1\n if(w<=b):\n ans+=1\nprint(ans) \n \t \t \t \t\t\t \t \t\t \t \t \t \t \t", "n, k = list(map(int, input().split(\" \")))\r\narr = list(map(int, input().split(\" \")))\r\na_count = 0\r\nfor i in arr:\r\n is_l = False\r\n curr = i\r\n t = 0\r\n while curr > 10:\r\n curr_r = curr % 10\r\n if curr_r == 7 or curr_r == 4:\r\n t += 1\r\n curr = curr // 10\r\n \r\n if curr == 7 or curr == 4:\r\n t += 1\r\n\r\n if t <= k:\r\n a_count += 1\r\nprint(a_count)\r\n", "n, k = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\ncount = 0\r\nfor number in numbers:\r\n number = str(number)\r\n coc = number.count('4')+number.count('7')\r\n if coc <= k:\r\n count += 1\r\nprint(count)\r\n", "n,k = map(int,input().split())\r\na = list(map(str,input().split()))\r\ncount = 0\r\nfor i in a:\r\n if i.count(\"4\") + i.count(\"7\") <= k:\r\n count += 1\r\nprint(count)\r\n ", "def schast_e___e(a) :\r\n a=str(a);h=0\r\n for i in range(len(a)):\r\n if a[i]=='4' or a[i]=='7' : h+=1\r\n return h\r\nn,k=map(int,input().split())\r\nj=0\r\ns=input().split()\r\nfor i in range(n):\r\n if schast_e___e(s[i])<=k : j+=1\r\nprint(j)", "n,k = map(int,input().split())\r\na = list(map(str,input().split()))\r\ncount = 0\r\nflag = 0\r\nfor i in range(n):\r\n for j in range(len(a[i])):\r\n if(a[i][j] == '4' or a[i][j] == '7'):\r\n count += 1\r\n if(count <= k):\r\n flag += 1\r\n count = 0\r\nprint(flag)", "n,k=map(int,input().split())\r\nans=0\r\na=[s for s in input().split()]\r\nfor s in a:\r\n c=s.count('4')+s.count('7')\r\n if c<=k:ans+=1\r\nprint(ans)", "n,k = input().split()\r\nn,k = int(n),int(k)\r\nl = list(input().split())\r\nc = 0\r\nfor i in range(n):\r\n s = l[i]\r\n cnt = 0\r\n for j in range(len(s)):\r\n if(s[j] == '4' or s[j] == '7'):\r\n cnt += 1\r\n if(cnt <= k):\r\n c += 1\r\n \r\nprint(c)", "k=int(input().split()[1])\r\nprint(sum(sum(c in'47'for c in x)<=k for x in input().split()))", "def countLucky(number):\r\n count = 0; temp = 0\r\n while number > 0:\r\n temp = number % 10\r\n if temp == 4 or temp == 7:\r\n count += 1\r\n number = int(number/10)\r\n return count\r\ncount = 0\r\nn, k = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n if countLucky(lst[i]) <= k :\r\n count += 1\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\nc=0\r\nnum=map(int,input().split())\r\nfor i in list(num):\r\n if list(str(i)).count('7')+list(str(i)).count('4')<=k:\r\n c+=1\r\nprint(c)", "n,k=[int(x) for x in input().split()]\r\na=[y for y in input().split()]\r\nc=0\r\nfor i in a:\r\n i=list(i)\r\n if i.count(\"4\")+i.count(\"7\")<=k:\r\n c+=1\r\nprint(c)\r\n", "n,k = map(int, input().split(' '))\nnums = list(map(str, input().split(' ')))\n\nlucky = ['4','7']\n\nres = 0\n\ncount = 0\n\nfor i in nums:\n for j in i :\n if j in lucky :\n count += 1\n \n if count <= k :\n res += 1\n \n count = 0\n\nprint(res)\n\n\t \t \t \t \t\t\t\t \t \t \t\t\t", "x=input().split(\" \")\nn,k=x\ncount=0\ny=input().split(\" \")\nfor i in y:\n counter=0\n for j in i:\n if \"4\"==j:\n counter+=1\n elif \"7\"==j:\n counter+=1\n if counter<=int(k):\n count+=1\nprint(count)\n\t\t\t \t \t \t\t \t \t \t \t\t\t \t", "n,k = list(map(int, input().split()))\r\nlst = input().split()\r\ncnt=0\r\n\r\nfor i in range(len(lst)):\r\n if lst[i].count('4')+lst[i].count('7')<=k:\r\n cnt+=1\r\n \r\nprint(cnt)", "n, k= map(int, input().split())\r\n\r\na = 0\r\nb = 0\r\n\r\nx = [str(y) for y in input().split()]\r\n\r\n\r\nfor i in x:\r\n for j in range(len(i)):\r\n if i[j] == \"4\" or i[j] == \"7\":\r\n a+=1\r\n if a <= k:\r\n b+=1\r\n a = 0\r\n else:\r\n a = 0\r\n\r\n\r\nprint(b)\r\n\r\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import \r\n# from itertools import \r\n# import random\r\nn, k = map(int, input().split())\r\narr = list(map(str, input().split()))\r\ncount_ = 0\r\nfor i in arr:\r\n if (i.count(\"4\") + i.count(\"7\")) > k:\r\n continue\r\n else:\r\n count_ += 1\r\nprint(count_)\r\n", "x,y=map(int,input().split())\r\nprint(sum(list(map((lambda i: 1 if i.count('4')+i.count('7')<=y else 0),input().split()))))\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness", "n, k = map(int, input().split())\r\nnums = list(input().split())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if nums[i].count(\"4\")+nums[i].count(\"7\") <= k:\r\n count += 1\r\nprint(count)", "n, k = [int(i) for i in input().split()]\r\nlst = [i for i in input().split()]\r\ncount = 0\r\n\r\nfor i in range(n):\r\n count += 1 if lst[i].count('4') + lst[i].count('7') <= k else 0\r\n\r\nprint(count)\r\n", "n = [int(x) for x in input().split()]\ns = input().split()\ncount = 0\nfor i in range(0, n[0]):\n count2 = 0\n for j in range(0, len(s[i])):\n if s[i][j] == \"4\" or s[i][j] == \"7\":\n count2 += 1\n if count2 <= n[1]:\n count += 1\nprint(count)", "def main():\r\n [_, k] = list(map(int, input().split()))\r\n ns = input().split()\r\n\r\n t = 0\r\n for n in ns:\r\n q = 0\r\n for c in str(n):\r\n if c == '4' or c == '7':\r\n q += 1\r\n\r\n if q <= k:\r\n t += 1\r\n print(t)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int, input().split())\r\n\r\nans = 0\r\n\r\nfor z in input().split():\r\n val = z.count('4') + z.count('7')\r\n if val <= k:\r\n ans += 1\r\n \r\nprint(ans)", "n,k = map(int,input().split())\r\n\r\nlst =list(map(str,input().split()))\r\n\r\ncount =0\r\nfor ele in lst:\r\n lucky =0\r\n for ch in ele:\r\n if ch == '4' or ch =='7':\r\n lucky = lucky +1\r\n if lucky <= k:\r\n count = count +1\r\n\r\n\r\nprint(count)", "a,b = input().split()\na = int(a)\nb = int(b)\nc = input()\nd =c.split()\ncnt=0\nfor i in range(len(d)):\n for j in range(len(d[i])):\n if (d[i])[j]==\"7\" or (d[i])[j]==\"4\":\n cnt+=1\n if cnt>b:\n a-=1\n cnt=min(cnt,0)\nprint(a)\n\n\n\t\t\t\t \t\t \t\t \t\t \t\t\t \t \t\t\t", "from collections import Counter\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n c=Counter(str(i))\r\n if c['4']+c['7']<=k:\r\n s+=1 \r\nprint(s)", "a,b=[int(i) for i in input().split()]\nc=[i for i in input().split()]\nd=0\nfor i in c:\n ignore=False\n if len(i)<=b:\n d+=1\n else:\n k=0\n for j in i:\n if j==\"4\" or j==\"7\":\n k+=1\n if k<=b:\n d+=1\nprint(d)\n\t \t \t \t \t\t\t\t \t \t \t\t\t", "n , k = map(int, input().split())\ns = [_ for _ in map(str, input().split())]\nlucky_sum = 0\nfor i in s:\n temp = i.count('4') + i.count('7')\n if temp <= k:\n lucky_sum += 1\nprint(lucky_sum)\n \t\t \t \t \t\t\t \t\t\t\t\t", "n, k = list(map(int, input().split()))\nvalues = input().split()\ntotal = 0\n\nfor val in values:\n lucky = 0\n for c in val:\n if c in '47':\n lucky += 1\n if lucky <= k:\n total += 1\n\nprint(total)\n", "n,x=map(int,input().split())\r\nl=[]\r\ncount=0\r\nl=list(map(int,input().split()))\r\nfor i in range(0,n):\r\n c=0\r\n f=1\r\n s=l[i]\r\n while(s>0):\r\n r=int(s%10)\r\n if(r==4 or r==7):\r\n c=c+1\r\n if(c>x):\r\n f=0\r\n break\r\n s=int(s/10)\r\n if(f==1):\r\n count=count+1\r\nprint(count)", "n,k = input().split()\nn = int(n) ; k = int(k)\ns = input()\na = s.split()\nx = 0\nfor i in range(len(a)):\n counter = 0\n for j in range(len(a[i])):\n if (a[i])[j] == \"7\" or (a[i])[j] == \"4\":\n counter+=1\n if counter<=k:\n x+=1\nprint(x)\n\n# n k\n# 3 2\n# i i i\n# jjj jj jj\n# 0 1 2\n# 447 44 77\n#i = 0 , j =0\n# 012\n#a[i] = '447'\n#(a[i])[j]='4'\n\n \t\t \t \t\t\t\t\t\t \t \t \t \t \t", "\r\nn,k=map(int,input().split())\r\nl=list(input().split())\r\nc=0\r\n\r\nfor i in l:\r\n\ty=i.count(\"4\")\r\n\tz=i.count(\"7\")\r\n\ts=y+z\r\n\tif y+z<=k:\r\n\t\tc=c+1\r\n\r\nprint(c)", "n, k = list(map(int, input().split(\" \")))\r\nnums = input().split(\" \")\r\n\r\n\r\ni = 0\r\n\r\nfor num in nums:\r\n if(num.count('4')+num.count('7')) <= k:\r\n i+=1\r\n\r\nprint(i)\r\n", "n, k = map(int, input().split())\r\na = input().split()\r\nprint(sum([1 if str(x).count(\"4\") + str(x).count(\"7\") <= k else 0 for x in a]))", "n,k=map(int,input().split())\r\nx=list(map(str,input().split()))\r\n\r\nc=0\r\nfor i in x:\r\n if (i.count('4')+i.count('7'))<=k:\r\n c+=1\r\nprint(c)", "n, k = map(int, input().split())\r\n\r\nintegers = tuple(input().split())\r\ncount = 0\r\n\r\nfor num in integers:\r\n if num.count(\"4\") + num.count(\"7\") <= k:\r\n count += 1\r\n\r\nprint(count)", "nk=input().split()\r\nn=int(nk[0])\r\nk=int(nk[1])\r\ns=list(map(int,input().rstrip().split()))\r\nb=0\r\nfor i in range (n):\r\n j=str(s[i])\r\n c=0\r\n for a in j :\r\n a=int(a)\r\n if a==4 or a==7:\r\n c=c+1\r\n\r\n if c<=k :\r\n b=b+1\r\nprint(b)\r\n", "a, b = input().split()\r\n\r\na = int(a)\r\nb = int(b)\r\n\r\ntotal = 0\r\n\r\narr = [int(a) for a in input().split()]\r\n \r\nfor i in arr:\r\n totalLucky = 0\r\n for j in str(i):\r\n if j == '4':\r\n totalLucky += 1\r\n if j == '7':\r\n totalLucky += 1\r\n \r\n if totalLucky <= b:\r\n total += 1\r\n \r\nprint(total)", "n, k = map(int, input().split())\nnums = input().split()\ncount = 0\n\nfor num in nums:\n if num.count(\"4\") + num.count(\"7\") <= k:\n count += 1\n\nprint(count)", "n,k = map(int,input().split())\r\n\r\nans = 0\r\ns = list(map(str,input().split()))\r\nfor i in s:\r\n c = 0\r\n for j in i:\r\n\r\n if j == \"4\" or j == \"7\":\r\n c += 1\r\n if c <= k:\r\n ans+=1\r\nprint(ans)\r\n ", "n,k = map(int,input().split())\nprint_count = 0\nz = 0\nwhile z<1:\n q = input().split(' ')\n for i in q:\n count = 0\n for j in i:\n if j in \"4\" or j in \"7\":\n count+=1\n if count<=k:\n print_count+=1\n z+=1\nprint(print_count)\n \t \t\t \t\t\t \t \t \t\t \t\t\t\t\t \t\t\t", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\ncount=0\r\nfor x in range(a):\r\n\td=list(str(c[x]))\r\n\tseven=d.count('7')\r\n\tfour=d.count('4')\r\n\tif seven+four<=b:\r\n\t\tcount+=1\r\nprint(count)", "# -- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jun 17 21:10:37 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\nn, k = map(int, input().split())\r\ns = input().split()\r\ns = [int(i) for i in s]\r\nans = 0\r\nfor i in s:\r\n j = 0\r\n i = str(i)\r\n for l in i:\r\n if l == \"4\" or l == \"7\":\r\n j += 1\r\n if j <= k:\r\n ans += 1\r\nprint(ans)", "n,k=map(int , input().split())\r\na = list(map(int , input().split()))\r\nresult=0\r\n\r\nfor item in a:\r\n count=0\r\n while(item>0):\r\n mod1 = item%10\r\n if(mod1==4 or mod1==7):\r\n count+=1\r\n item//=10\r\n if(count<=k):\r\n result+=1\r\nprint(result)", "#n,k\r\n#not more than k lucky digits\r\ns=input().split()\r\nn=int(s[0])\r\nk=int(s[1])\r\nl=input().split()\r\nflag1=0\r\nfor i in range(n):\r\n flag2=0\r\n for j in range(len(l[i])):\r\n if l[i][j]=='4' or l[i][j]=='7':\r\n flag2+=1\r\n if flag2<=k:\r\n flag1+=1\r\nprint(flag1)", "n,k=map(int,input().split())\r\ncnt=0\r\nfor i in input().split():\r\n if i.count('4') + i.count('7')<=k:\r\n cnt+=1\r\nprint(cnt)", "n, k = map(int, input().split())\r\nnum = input().split()\r\nout = 0\r\nfor i in num:\r\n lucky = 0\r\n for j in i:\r\n if j == '4' or j == '7':\r\n lucky += 1\r\n if lucky <= k:\r\n out += 1\r\nprint(out)", "l1 = [int(i) for i in input().split(\" \")]\r\nl2 = [j for j in input().split(\" \")]\r\ncount = 0\r\nfor i in l2:\r\n if i.count(\"4\") + i.count(\"7\") <= l1[1]:\r\n count+=1\r\nprint(count)", "n,k = [int(x) for x in input().split(\" \")]\r\ns = [i for i in input().split(\" \")]\r\nanswer = 0\r\nfor i in s:\r\n if i.count('4')+i.count('7')<=k: answer += 1\r\nprint(answer)", "n,k=list(map(int,input().split()))\r\nl=list(input().split())\r\nc=0\r\nfor i in range(n):\r\n y=0\r\n x=len(l[i])\r\n for j in range(x):\r\n if(l[i][j]=='4' or l[i][j]=='7'):\r\n y+=1\r\n if(y<=k):\r\n c+=1\r\nprint(c)", "n, k = map(int, input().split())\r\ns = input().split()\r\ncnt = 0\r\nfor i in s:\r\n l = 0\r\n for j in i:\r\n if j == \"4\" or j == \"7\":\r\n l += 1\r\n if l <= k:\r\n cnt += 1\r\nprint(cnt)", "n, k = map(int, input().split())\r\na = input().split()\r\nr = 0\r\nfor x in a:\r\n if x.count(\"4\") + x.count(\"7\") <= k:\r\n r += 1\r\nprint(r)\r\n", "# cook your dish here\r\nn,k = map(int, input().split())\r\nl = list(map(str, input().split()))\r\nans =0 \r\nfor i in l:\r\n if(i.count('4') + i.count('7') <= k):\r\n ans += 1\r\n \r\nprint(ans)", "a = input()\na = a.split(\" \")\nn = int(a[0])\nk = int(a[-1])\nuser = input()\nuser = user.split(\" \")\ntemp = 0\nfor i in user:\n count = 0\n for j in i:\n if int(j) == 4 or int(j) == 7:\n count += 1\n if count <= k:\n temp += 1\nprint(temp)\n\t \t \t\t\t \t\t \t\t \t\t\t\t \t\t \t", "n,k=list(map(int, input().split()))\r\nl=list(map(str, input().split()))\r\nln=[4,7]\r\nr=[]\r\n\r\nfor i in l:\r\n count=0\r\n for j in i:\r\n if int(j) in ln:\r\n count+=1\r\n r.append(count)\r\n\r\nc=0\r\nfor i in range(len(r)):\r\n if r[i]<=k:\r\n c+=1\r\nprint(c)", "n,k=map(int,input().split())\na=[int(i) for i in input().split()]\nc=0\ns=''\nfor i in a:\n s=str(i)\n if s.count('4')+s.count('7')>k:\n c+=1\n \nprint(n-c)\n\n\t\t\t \t \t \t \t \t \t\t \t\t\t\t", "x,y=list(map(int,input().split()))\r\nnums=list(map(int,input().split()))\r\nc=0\r\nfor i in nums:\r\n i=str(i)\r\n if i.count(\"4\")+i.count(\"7\")<=y:\r\n c+=1\r\nprint(c)\r\n \r\n ", "line_1 = str(input(\"\")).split()\nthreshold = int(line_1[1])\n\nline_2 = str(input(\"\")).split()\n\ndef count_lucky(s):\n count = 0\n for i in s:\n if i == '7' or i== '4':\n count += 1\n \n return count\n\nreal_counter = 0\nfor i in range(len(line_2)):\n count_res = count_lucky(line_2[i])\n if(count_res <= threshold):\n real_counter += 1\n \nprint(real_counter)\n \t \t \t \t\t\t \t \t \t\t \t", "n,k1=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in a:\r\n\tk=0\r\n\tif len(str(i))<=k1:\r\n\t\tb.append(k1-1)\r\n\telse:\r\n\t\twhile i!=0:\r\n\t\t\tif i%10==4 or i%10==7:\r\n\t\t\t\tk+=1\r\n\t\t\ti//=10\r\n\t\tb.append(k)\r\nx=0\r\nfor i in b:\r\n\tif i<=k1:\r\n\t\tx+=1\r\nprint(x)", "n,k2=map(int,input().split())\r\n\r\nl=list(map(str,input().split()))\r\n\r\nt=0\r\nfor i in l:\r\n nt=0\r\n for k in i:\r\n if k==\"4\" or k==\"7\":\r\n nt+=1\r\n if nt<=k2:\r\n t+=1\r\nprint(t)", "n,k=map(int,input().split())\r\nl=list(input().split())\r\n\r\nr=0\r\nfor i in range (n):\r\n tmp=l[i]\r\n good=0\r\n for j in range (len(tmp)):\r\n if(tmp[j]==\"4\" or tmp[j]==\"7\"):\r\n good+=1\r\n if(good<=k):\r\n r+=1\r\nprint(r)", "from collections import Counter\r\nn , k = map(int,input().split())\r\nls = list(map(str,input().split()))\r\nc=0\r\nfor i in ls:\r\n if i.count('7')+i.count('4') <=k:\r\n c+=1\r\nprint(c)", "a,b=list(map(int,input().split()))\r\nn=list(map(str,input().split()))\r\ncount=0\r\nfor i in n:\r\n\tx=i.count('4')\r\n\ty=i.count('7')\r\n\tif x+y > b: \r\n\t\tcount+=1\r\nprint(len(n)-count)\r\n", "n,k=map(int,input().split())\r\ntemp=0\r\narr=[str(x) for x in input().split()]\r\ntemp=0\r\nfor i in range(0,len(arr),1):\r\n s=arr[i]\r\n \r\n count=0\r\n for j in range(0,len(s),1):\r\n if s[j]=='4' or s[j]=='7':\r\n count+=1\r\n if count<=k:\r\n temp+=1\r\nprint(temp)\r\n\r\n ", "n, k =map(int,input().split())\r\n\r\nnums = list(map(str, input().split()))\r\ncount = 0\r\nfor i in nums :\r\n total = i.count('4') + i.count('7')\r\n if total <= k:\r\n count += 1\r\nprint(count)", "usr_input1 = [int(i) for i in input().split(\" \")]\nusr_input2 = input().split(\" \")\ncount = 0\nfor num in usr_input2:\n lucky = True\n lucky_count = 0\n\n for digit in num:\n if digit == \"4\" or digit == \"7\":\n lucky_count += 1\n\n if lucky_count <= int(usr_input1[1]):\n count += 1\n\nprint(count)\n \t \t \t \t \t\t \t\t \t\t\t \t \t \t", "[n,k] = [int(x) for x in input().split()]\r\n\r\nl = [x for x in input().split()]\r\ncount = 0\r\nfor x in l:\r\n l_c = 0\r\n for y in x:\r\n if y=='4' or y=='7':\r\n l_c += 1\r\n \r\n if l_c <= k:\r\n count+=1\r\n \r\nprint(count)", "n,k=map(int,input().split())\r\nl=input().split()\r\nfor i in range(len(l)):\r\n\ta=l[i].count(\"4\")+l[i].count(\"7\")\r\n\tif a > k:\r\n\t\tn-=1\r\nprint(n)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n x=str(i)\r\n if x.count('4')+x.count('7')<=k:\r\n c+=1\r\nprint(c)\r\n ", "l=list(map(int,input().split()))\r\nn=input().split()\r\nc=0\r\nfor i in n:\r\n if((i.count('4')+i.count('7'))<=l[1]):\r\n c=c+1\r\nprint(c)\r\n\r\n", "temp = list(map(int, input().split()))\r\nnum = temp[0]\r\nluck = temp[1]\r\ncheck = 0\r\nneeded = 0\r\nnumbers = list(input().split())\r\nfor x in numbers:\r\n check = 0\r\n for y in x:\r\n if y == '4' or y == '7':\r\n check += 1\r\n if check <= luck:\r\n needed += 1\r\nprint(needed)\r\n", "n, k = list(map(int, input().split()))\r\nnar = input().split()\r\n\r\ncount = 0\r\nfor i in nar:\r\n count += 1\r\n c = 0\r\n for j in i:\r\n if j == '4' or j == '7':\r\n c += 1\r\n if c > k:\r\n count -= 1\r\n break\r\nprint(count)" ]	{"inputs": ["3 4\n1 2 4", "3 2\n447 44 77", "2 2\n507978501 180480073", "9 6\n655243746 167613748 1470546 57644035 176077477 56984809 44677 215706823 369042089", "6 100\n170427799 37215529 675016434 168544291 683447134 950090227", "4 2\n194041605 706221269 69909135 257655784", "4 2\n9581849 67346651 530497 272158241", "3 47\n378261451 163985731 230342101", "2 3\n247776868 480572137", "7 77\n366496749 549646417 278840199 119255907 33557677 379268590 150378796", "40 31\n32230963 709031779 144328646 513494529 36547831 416998222 84161665 318773941 170724397 553666286 368402971 48581613 31452501 368026285 47903381 939151438 204145360 189920160 288159400 133145006 314295423 450219949 160203213 358403181 478734385 29331901 31051111 110710191 567314089 139695685 111511396 87708701 317333277 103301481 110400517 634446253 481551313 39202255 105948 738066085", "1 8\n55521105", "49 3\n34644511 150953622 136135827 144208961 359490601 86708232 719413689 188605873 64330753 488776302 104482891 63360106 437791390 46521319 70778345 339141601 136198441 292941209 299339510 582531183 555958105 437904637 74219097 439816011 236010407 122674666 438442529 186501223 63932449 407678041 596993853 92223251 849265278 480265849 30983497 330283357 186901672 20271344 794252593 123774176 27851201 52717531 479907210 196833889 149331196 82147847 255966471 278600081 899317843", "26 2\n330381357 185218042 850474297 483015466 296129476 1205865 538807493 103205601 160403321 694220263 416255901 7245756 507755361 88187633 91426751 1917161 58276681 59540376 576539745 595950717 390256887 105690055 607818885 28976353 488947089 50643601", "38 1\n194481717 126247087 815196361 106258801 381703249 283859137 15290101 40086151 213688513 577996947 513899717 371428417 107799271 11136651 5615081 323386401 381128815 34217126 17709913 520702093 201694245 570931849 169037023 417019726 282437316 7417126 271667553 11375851 185087449 410130883 383045677 5764771 905017051 328584026 215330671 299553233 15838255 234532105", "44 9\n683216389 250581469 130029957 467020047 188395565 206237982 63257361 68314981 732878407 563579660 199133851 53045209 665723851 16273169 10806790 556633156 350593410 474645249 478790761 708234243 71841230 18090541 19836685 146373571 17947452 534010506 46933264 377035021 311636557 75193963 54321761 12759959 71120181 548816939 23608621 31876417 107672995 72575155 369667956 20574379 210596751 532163173 75726739 853719629", "8 6\n204157376 10514197 65483881 347219841 263304577 296402721 11739011 229776191", "38 29\n333702889 680931737 61137217 203030505 68728281 11414209 642645708 590904616 3042901 607198177 189041074 700764043 813035201 198341461 126403544 401436841 420826465 45046581 20249976 46978855 46397957 706610773 24701041 57954481 51603266 593109701 385569073 178982291 582152863 287317968 1474090 34825141 432421977 130257781 151516903 540852403 548392 117246529", "19 3\n562569697 549131571 50676718 84501863 74567295 702372009 365895280 451459937 40378543 167666701 158635641 53639293 442332661 825055617 100109161 326616021 862332843 533271196 4791547", "1 1\n44", "1 1\n4", "10 3\n444 447 774 777 7777 4447 4 7 7 4"], "outputs": ["3", "2", "2", "9", "6", "3", "4", "3", "1", "7", "40", "1", "44", "22", "20", "44", "8", "38", "18", "0", "1", "8"]}	UNKNOWN	PYTHON3	CODEFORCES	500
8a318d25c4228c01367164cd22486e42	Minimum spanning tree for each edge	Connected undirected weighted graph without self-loops and multiple edges is given. Graph contains n vertices and m edges. For each edge (u,<=v) find the minimal possible weight of the spanning tree that contains the edge (u,<=v). The weight of the spanning tree is the sum of weights of all edges included in spanning tree. First line contains two integers n and m (1<=≤<=n<=≤<=2·105,<=n<=-<=1<=≤<=m<=≤<=2·105) — the number of vertices and edges in graph. Each of the next m lines contains three integers ui,<=vi,<=wi (1<=≤<=ui,<=vi<=≤<=n,<=ui<=≠<=vi,<=1<=≤<=wi<=≤<=109) — the endpoints of the i-th edge and its weight. Print m lines. i-th line should contain the minimal possible weight of the spanning tree that contains i-th edge. The edges are numbered from 1 to m in order of their appearing in input. Sample Input 5 7 1 2 3 1 3 1 1 4 5 2 3 2 2 5 3 3 4 2 4 5 4 Sample Output 9 8 11 8 8 8 9	[ "from sys import stdin, stdout\r\ndef main():\r\n n, m = map(int, stdin.readline().split())\r\n d = []\r\n ev = [set() for _ in range(n + 1)]\r\n ans = [0] * m\r\n for i in range(m):\r\n u, v, w = map(int, stdin.readline().split()) \r\n d.append((w, u, v))\r\n ev[u].add(i)\r\n ev[v].add(i)\r\n ans[i] = w\r\n d.sort()\r\n par = [i for i in range(n + 1)]\r\n st = []\r\n push = st.append\r\n g = 0\r\n for w, u, v in d:\r\n while par[u] != u:\r\n push(u)\r\n u = par[u]\r\n while par[v] != v:\r\n push(v)\r\n v = par[v]\r\n if u != v:\r\n g += w\r\n if len(ev[u]) < len(ev[v]):\r\n u, v = v, u\r\n par[v] = u\r\n for j in ev[v] & ev[u]:\r\n ans[j] -= w\r\n ev[u] ^= ev[v]\r\n for x in st:\r\n par[x] = u\r\n del st[:]\r\n for i in range(m):\r\n ans[i] += g\r\n stdout.write('\\n'.join(map(str, ans)))\r\nmain()", "from sys import stdout\r\n\r\ndef modified_kruskal(graph, n, results):\r\n graph_sorted = sorted(graph)\r\n\r\n node_list = [i for i in range(n)]\r\n mst = []\r\n remaining_weight = 0\r\n\r\n for weight, u, v in graph_sorted:\r\n \r\n while node_list[u] != u:\r\n mst.append(u)\r\n u = node_list[u]\r\n \r\n while node_list[v] != v:\r\n mst.append(v)\r\n v = node_list[v]\r\n \r\n if u != v:\r\n remaining_weight += weight\r\n if len(nodes_set[u]) < len(nodes_set[v]):\r\n u, v = v, u\r\n node_list[v] = u\r\n for j in nodes_set[v] & nodes_set[u]:\r\n results[j] -= weight\r\n nodes_set[u] ^= nodes_set[v]\r\n \r\n for x in mst:\r\n node_list[x] = u\r\n \r\n del mst[:]\r\n\r\n for i in range(m):\r\n results[i] += remaining_weight\r\n \r\n return results\r\n\r\ngraph = []\r\n\r\nn, m = map(int, input().split())\r\nnodes_set = [set() for _ in range(n)]\r\nresults = [0] * m\r\n\r\nfor i in range(int(m)):\r\n node1, node2, weight = map(int, input().split())\r\n graph.append((weight, node1-1, node2-1))\r\n nodes_set[node1-1].add(i)\r\n nodes_set[node2-1].add(i)\r\n results[i] = weight\r\n\r\nresults = modified_kruskal(graph, n, results)\r\n\r\nstdout.write('\\n'.join(map(str, results)))\r\n" ]	{"inputs": ["5 7\n1 2 3\n1 3 1\n1 4 5\n2 3 2\n2 5 3\n3 4 2\n4 5 4", "2 1\n1 2 42", "3 3\n1 2 10\n2 3 20\n3 1 40", "4 6\n1 2 999999001\n1 3 999999003\n1 4 999999009\n2 3 999999027\n2 4 999999243\n3 4 999999729", "8 10\n2 5 4\n7 5 2\n7 3 28\n4 5 14\n3 2 15\n1 2 3\n6 2 5\n2 8 17\n4 6 2\n1 4 10", "8 10\n8 7 11\n3 5 23\n2 1 23\n7 2 13\n6 4 18\n1 4 20\n8 4 17\n2 8 8\n3 2 9\n5 6 29", "7 14\n2 4 25\n6 4 5\n5 6 3\n5 7 9\n6 1 17\n4 7 6\n5 4 25\n1 2 23\n2 3 15\n5 1 10\n7 6 21\n3 7 5\n5 3 4\n5 2 15", "7 10\n2 1 12\n3 1 10\n3 4 5\n6 4 6\n7 4 20\n5 4 17\n3 2 5\n7 5 8\n3 6 16\n2 5 21", "10 10\n9 4 16\n6 1 4\n5 4 4\n1 2 11\n8 2 22\n5 10 29\n7 5 24\n2 4 15\n1 3 7\n7 9 24"], "outputs": ["9\n8\n11\n8\n8\n8\n9", "42", "30\n30\n50", "2999997013\n2999997013\n2999997013\n2999997037\n2999997247\n2999997733", "48\n48\n61\n57\n48\n48\n48\n48\n48\n53", "106\n106\n109\n108\n106\n106\n106\n106\n106\n112", "52\n42\n42\n46\n49\n43\n62\n50\n42\n42\n58\n42\n42\n42", "53\n51\n51\n51\n54\n51\n51\n51\n61\n55", "132\n132\n132\n132\n132\n132\n132\n132\n132\n132"]}	UNKNOWN	PYTHON3	CODEFORCES	2
8a39a0fc528e653f23f943f263f57591	Mister B and Boring Game	Sometimes Mister B has free evenings when he doesn't know what to do. Fortunately, Mister B found a new game, where the player can play against aliens. All characters in this game are lowercase English letters. There are two players: Mister B and his competitor. Initially the players have a string s consisting of the first a English letters in alphabetical order (for example, if a<==<=5, then s equals to "abcde"). The players take turns appending letters to string s. Mister B moves first. Mister B must append exactly b letters on each his move. He can arbitrary choose these letters. His opponent adds exactly a letters on each move. Mister B quickly understood that his opponent was just a computer that used a simple algorithm. The computer on each turn considers the suffix of string s of length a and generates a string t of length a such that all letters in the string t are distinct and don't appear in the considered suffix. From multiple variants of t lexicographically minimal is chosen (if a<==<=4 and the suffix is "bfdd", the computer chooses string t equal to "aceg"). After that the chosen string t is appended to the end of s. Mister B soon found the game boring and came up with the following question: what can be the minimum possible number of different letters in string s on the segment between positions l and r, inclusive. Letters of string s are numerated starting from 1. First and only line contains four space-separated integers: a, b, l and r (1<=≤<=a,<=b<=≤<=12, 1<=≤<=l<=≤<=r<=≤<=109) — the numbers of letters each player appends and the bounds of the segment. Print one integer — the minimum possible number of different letters in the segment from position l to position r, inclusive, in string s. Sample Input 1 1 1 8 4 2 2 6 3 7 4 6 Sample Output 231	[ "\na, b, ll, rr = map(int, input().split())\np = 'abcdefghijklmnopqrstuvwxyz'\nss = p[:a]\ndef f(n):\n global a, b, ll, rr, p, ss\n s = ss\n l = ll\n r = rr\n while True:\n s += s[-n]b\n st = set()\n for i in s[-a:]:\n st.add(i)\n k = 0\n for i in range(a):\n while p[k] in st: k += 1\n st.add(p[k])\n s += p[k]\n for i in range(len(s) -a -b, 0, -a -b):\n for j in range(20):\n if i -(j +1)(len(s) -i) < 0 or s[i:] != s[i -(j +1)(len(s) -i): i -j(len(s) -i)]:\n break\n else:\n t = s[i:]\n l -= 1\n st = set()\n if l < len(s):\n for i in s[l:min(r, len(s))]:\n st.add(i)\n l = len(s)\n z = r -l\n l -= len(s)\n l %= len(t)\n #print(l, z)\n for i in range(z):\n st.add(t[l%len(t)])\n l += 1 \n if l == 2*len(t): break\n #print(s, t)\n #print(len(st))\n return len(st)\nprint(min(f(i) for i in range(1, a +1)))" ]	{"inputs": ["1 1 1 8", "4 2 2 6", "3 7 4 6", "4 5 1 1", "12 12 1 1000", "12 1 1000 1000", "3 4 701 703", "12 12 13 1000000000", "3 4 999999999 1000000000", "5 6 1000000000 1000000000", "1 1 1 1", "12 1 100000011 100000024", "10 12 220000011 220000032", "1 1 1 1000000000", "1 1 999999999 1000000000", "1 1 1000000000 1000000000", "12 12 1 24", "12 12 876543210 1000000000", "5 11 654321106 654321117", "5 11 654321117 654321140", "9 12 654321114 654321128", "5 12 654321101 654321140", "2 12 654321104 654321122", "6 1 654321100 654321115", "2 1 654321122 654321129", "6 2 654321100 654321140", "6 2 654321113 654321123", "1 7 654321103 654321105", "5 3 654321111 654321117", "1 3 654321122 654321140", "5 8 654321118 654321137", "5 8 654321103 654321106", "9 8 654321109 654321126", "2 2 987654333 987654335", "4 8 987654341 987654343", "3 12 987654345 987654347", "8 1 987654349 987654354", "6 8 987654322 987654327", "6 10 987654330 987654337", "11 4 987654330 987654343", "10 7 987654339 987654340", "12 12 987654321 987654328", "3 10 498103029 647879228", "11 3 378541409 796916287", "3 3 240953737 404170887", "3 8 280057261 834734290", "7 8 305686738 573739036", "3 8 36348920 167519590", "10 2 1 1000000000", "4 1 1 100000", "2 1 288 300", "5 1 1 100", "3 3 3 8", "5 1 1 100000", "5 1 1 1000", "6 1 1 10000", "12 1 1 100", "2 1 1 1000000", "10 1 100 1000000000", "2 2 7 12", "12 1 1 1000", "4 1 1 9", "5 2 5 1000", "3 1 4 10", "12 1 1 1000000", "10 5 1 1000000000", "10 10 1999 3998", "3 1 1 1000", "10 1 1 21", "5 3 15 18", "4 4 2 10"], "outputs": ["2", "3", "1", "1", "13", "1", "3", "13", "1", "1", "1", "13", "11", "2", "1", "1", "12", "13", "4", "6", "4", "6", "3", "11", "3", "10", "7", "2", "6", "2", "6", "1", "10", "2", "1", "3", "6", "3", "2", "12", "2", "4", "4", "19", "4", "4", "8", "4", "18", "7", "3", "9", "3", "9", "9", "11", "23", "3", "19", "3", "23", "7", "8", "4", "23", "15", "11", "5", "19", "3", "4"]}	UNKNOWN	PYTHON3	CODEFORCES	1
8a3b83bb1a842a33deeaa0d6092acc8f	Vasya and Football	Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow card automatically receives a red card. Vasya is watching a recorded football match now and makes notes of all the fouls that he would give a card for. Help Vasya determine all the moments in time when players would be given red cards if Vasya were the judge. For each player, Vasya wants to know only the first moment of time when he would receive a red card from Vasya. The first line contains the name of the team playing at home. The second line contains the name of the team playing away. Both lines are not empty. The lengths of both lines do not exceed 20. Each line contains only of large English letters. The names of the teams are distinct. Next follows number n (1<=≤<=n<=≤<=90) — the number of fouls. Each of the following n lines contains information about a foul in the following form: - first goes number t (1<=≤<=t<=≤<=90) — the minute when the foul occurs; - then goes letter "h" or letter "a" — if the letter is "h", then the card was given to a home team player, otherwise the card was given to an away team player; - then goes the player's number m (1<=≤<=m<=≤<=99); - then goes letter "y" or letter "r" — if the letter is "y", that means that the yellow card was given, otherwise the red card was given. The players from different teams can have the same number. The players within one team have distinct numbers. The fouls go chronologically, no two fouls happened at the same minute. For each event when a player received his first red card in a chronological order print a string containing the following information: - The name of the team to which the player belongs; - the player's number in his team; - the minute when he received the card. If no player received a card, then you do not need to print anything. It is possible case that the program will not print anything to the output (if there were no red cards). Sample Input MC CSKA 9 28 a 3 y 62 h 25 y 66 h 42 y 70 h 25 y 77 a 4 y 79 a 25 y 82 h 42 r 89 h 16 y 90 a 13 r Sample Output MC 25 70 MC 42 82 CSKA 13 90	[ "__author__ = 'DK Wang'\r\nfrom fractions import gcd\r\n\r\n#Matrix = [[0 for x in range(5)] for x in range(5)]\r\n\r\nhome = input()\r\naway = input()\r\nn = int(input())\r\n\r\ntime = [[0 for x in range(105)] for x in range(2)]\r\n\r\nfor x in range(n):\r\n t, ha, num, type = [x for x in input().split()]\r\n hora = 0 if ha == 'h' else 1\r\n add = 1 if type == 'y' else 2\r\n num = int(num)\r\n if(time[hora][num] < 2):\r\n time[hora][num] += add;\r\n if(time[hora][num] >= 2):\r\n print((home if hora == 0 else away) + \" \" + str(num) + \" \" + t)\r\n", "card_dict=dict()\r\nres=[]\r\nplayers=set()\r\nhome=input()\r\nother=input()\r\nnum=int(input())\r\n\r\nfor i in range(0,num):\r\n (m,t,n,c)=input().split(' ')\r\n m=int(m)\r\n if t=='h':\r\n tname=home\r\n else:\r\n tname=other\r\n if (t,n) not in card_dict:\r\n card_dict[(t,n)]=0\r\n if c=='y':\r\n card_dict[(t,n)]+=1\r\n else:\r\n card_dict[(t,n)]+=2\r\n if card_dict[(t,n)]>=2 and (t,n) not in players:\r\n res.append((tname,n,m))\r\n players.add((t,n))\r\n\r\nres.sort(key=lambda x:x[2])\r\nfor r in res:\r\n print(r[0]+' '+r[1]+' '+str(r[2]))", "from collections import \r\ns1=input()\r\ns2=input()\r\nn=int(input())\r\nd=defaultdict(int)\r\nfor i in range(n):\r\n time,ty,num,col=map(str,input().split())\r\n d[ty+num+col]+=1\r\n if col=='y' and d[ty+num+col]==2 and d[ty+num+'r']==0:\r\n if ty=='a':\r\n print(s2,num,time)\r\n else:\r\n print(s1,num,time)\r\n elif col=='r' and d[ty+num+col]==1 and (d[ty+num+'y']==0 or d[ty+num+'y']==1):\r\n if(ty=='a'):\r\n print(s2,num,time)\r\n else:\r\n print(s1,num,time)", "first_team = str(input())\r\nsecond_team = str(input())\r\nn = int(input())\r\ndeleted = []\r\na_cards = dict()\r\nh_cards = dict()\r\nfor x in range(n):\r\n [t,team,m,card] = input().split(' ')\r\n t = int(t)\r\n team = str(team)\r\n m = int(m)\r\n card = str(card)\r\n if team == 'a':\r\n team = a_cards\r\n team_name = second_team\r\n else:\r\n team = h_cards\r\n team_name = first_team\r\n if m not in team:\r\n if card == 'y':\r\n team[m] = 1\r\n else:\r\n team[m] = 2\r\n print (team_name,m,t)\r\n else:\r\n if team[m] == 1:\r\n team[m] = 2\r\n print (team_name,m,t)\r\n else:\r\n continue\r\n \r\n", "from collections import \r\n\r\nhome = input()\r\naway = input()\r\nn = int(input())\r\nhd = defaultdict(int)\r\nad = defaultdict(int)\r\nfor i in range(n):\r\n a = list(map(str, input().split()))\r\n if a[1] == \"h\":\r\n if hd[a[2]] != -1:\r\n if a[-1] == \"r\":\r\n hd[a[2]] = -1\r\n print(home, a[2], a[0])\r\n else:\r\n hd[a[2]] += 1\r\n if hd[a[2]] == 2:\r\n hd[a[2]] = -1\r\n print(home, a[2], a[0])\r\n else:\r\n if ad[a[2]] != -1:\r\n if a[-1] == \"r\":\r\n ad[a[2]] = -1\r\n print(away, a[2], a[0])\r\n else:\r\n ad[a[2]] += 1\r\n if ad[a[2]] == 2:\r\n ad[a[2]] = -1\r\n print(away, a[2], a[0])", "from collections import defaultdict\ndef main(t1,t2,n,t,ha,m,yr):\n reds = {}\n yellows = {} # defaultdict(int)\n teams = [t1,t2]\n for i in range(n):\n player = (ha[i], m[i])\n if player not in reds:\n if player not in yellows:\n yellows[player] = 0\n if yr[i] == 'y':\n yellows[player] += 1\n if yellows[player] >= 2 or yr[i] == 'r':\n reds[player] = 1\n print(teams[ha[i]=='a'],m[i],t[i])\n\ndef main_input():\n t1 = input()\n t2 = input()\n n = int(input())\n t = list(range(n))\n ha = list(range(n))\n m = list(range(n))\n yr = list(range(n))\n for i in range(n):\n t[i], ha[i], m[i], yr[i] = input().split()\n t = [int(x) for x in t]\n m = [int(x) for x in m]\n #print(t1,t2,n)\n #print(t,ha,m,yr)\n main(t1,t2,n,t,ha,m,yr)\n\nif __name__ == \"__main__\":\n main_input()\n", "I=input\r\ns=[I(),I()]\r\nd={}\r\nfor _ in '0'int(I()):\r\n\tm,h,t,k=I().split();t=int(t)(2(h=='h')-1);a=d.get(t,0);d[t]=[a+1,max(a,2)][k=='r']\r\n\tif d[t]==2:print(s[t<0],abs(t),m);d[t]=3", "__author__ = 'PrimuS'\r\ns1 = input().strip(\"\\n\")\r\ns2 = input().strip(\"\\n\")\r\nn = int(input())\r\nd1 = {}\r\nd2 = {}\r\n\r\nfor i in range(n):\r\n ss = input().split()\r\n t = int(ss[0])\r\n x = int(ss[2])\r\n ss[3].strip(\"\\n\")\r\n if ss[1] == 'h':\r\n if x in d1 and d1[x] == 1:\r\n print(s1, x, t)\r\n d1[x] = 2\r\n elif x not in d1:\r\n if ss[3] == 'r':\r\n print(s1, x,t)\r\n d1[x] = 2\r\n else:\r\n d1[x] = 1\r\n else:\r\n if x in d2 and d2[x] == 1:\r\n print(s2, x, t)\r\n d2[x] = 2\r\n elif x not in d2:\r\n if ss[3] == 'r':\r\n print(s2, x, t)\r\n d2[x] = 2\r\n else:\r\n d2[x] = 1", "import sys\n\nhome = input()\naway = input()\nn = int(input())\n\n# yellow, red\nplayer_home = [[0, 0] for i in range(100)]\nplayer_away = [[0, 0] for i in range(100)]\n\ninfo = []\nfor i in range(n):\n time, team, no, color = sys.stdin.readline().split()\n info.append((int(time), team, int(no), color))\n\nfor i in range(n):\n time, team, no, color = info[i][0], info[i][1], info[i][2], info[i][3]\n if team == 'a':\n # have got red card\n if player_away[no][1] != 0:\n continue\n if color == 'r':\n player_away[no][1] = 1\n print(away, no, time)\n else:\n player_away[no][0] += 1\n if player_away[no][0] == 2:\n player_away[no][1] = 1\n print(away, no, time)\n else:\n # have got red card\n if player_home[no][1] != 0:\n continue\n if color == 'r':\n player_home[no][1] = 1\n print(home, no, time)\n else:\n player_home[no][0] += 1\n if player_home[no][0] == 2:\n player_home[no][1] = 1\n print(home, no, time)\n\n", "a, b, n = input(), input(), int(input())\r\nans = []\r\np1, p2, f1, f2 = [0] 100, [0] * 100, [0] * 100, [0] * 100\r\nfor i in range(n):\r\n t, com, m, c = input().split()\r\n t, m = map(int, (t, m))\r\n if com == 'h':\r\n p1[m] += 1 if c == 'y' else 2\r\n if p1[m] >= 2 and not f1[m]:\r\n ans.append((a, m, t))\r\n f1[m] = 1\r\n else:\r\n p2[m] += 1 if c == 'y' else 2\r\n if p2[m] >= 2 and not f2[m]:\r\n ans.append((b, m, t))\r\n f2[m] = 1\r\n[print(i) for i in ans]\r\n", "hName = input()\r\naName = input()\r\nn = int(input())\r\n\r\nbd =[]\r\n\r\nfor i in range(n):\r\n s = input().split()\r\n if s[1] == 'h':\r\n bd.append({'comm':hName, 'minute': s[0], 'num': s[2], 'card': s[3]})\r\n else:\r\n bd.append({'comm':aName, 'minute': s[0], 'num': s[2], 'card': s[3]})\r\n\r\nres = []\r\npared = []\r\n\r\nfor pl in range(n):\r\n if [bd[pl]['comm'], bd[pl]['num']] not in pared:\r\n if bd[pl]['card'] == 'r':\r\n res.append(bd[pl])\r\n pared.append([bd[pl]['comm'], bd[pl]['num']])\r\n else:\r\n double = False\r\n for i in range(pl):\r\n if bd[pl]['num'] == bd[i]['num'] and bd[pl]['comm'] == bd[i]['comm']:\r\n double = True\r\n if double:\r\n res.append(bd[pl])\r\n pared.append([bd[pl]['comm'], bd[pl]['num']])\r\n\r\nfor i in range(len(res)):\r\n print(res[i]['comm'] + ' ' + res[i]['num'] + ' ' + res[i]['minute'])\r\n", "from collections import defaultdict\n\ndef main():\n home = input()\n away = input()\n num_fouls = int(input())\n\n players = defaultdict(int)\n banned = set()\n for _ in range(num_fouls):\n minute, team, player, card = input().split()\n team_name = home if team == 'h' else away\n\n if card == 'y':\n players[(team_name, player)] += 1\n else:\n players[(team_name, player)] = 2\n\n if (team_name, player) not in banned and players[(team_name, player)] >= 2:\n print(team_name, player, minute)\n banned.add((team_name, player))\n \n\nmain()\n", "h = input()\na = input()\nn = int(input())\nd = dict()\nfor i in range(n):\n\tarr = input().split()\n\tmark = (h if arr[1] == 'h' else a) + ' ' + arr[2]\n\tif mark not in d:\n\t\td[mark] = 0\n\tif d[mark] < 2:\n\t\td[mark] += 1 if arr[3] == 'y' else 2\n\t\tif d[mark] >= 2:\n\t\t\tprint(mark, arr[0])\n\n", "def input_split(f): return map(f, input().split())\n\n\ndef main():\n home = input()\n away = input()\n n = int(input())\n p = lambda team, m, time: print(\"{} {} {}\".format(home if team == \"h\" else away, m, time))\n r = set([])\n y = set([])\n for i in range(n):\n t, team, m, c = input_split(str)\n a = (team, m)\n if c == \"r\":\n if a not in r:\n r.add(a)\n y.add(a)\n p(team, m, t)\n else:\n if a in r:\n pass\n elif a in y:\n r.add(a)\n p(team, m, t)\n y.add(a)\n\nif __name__ == \"__main__\":\n main()\n", "h = input()\r\na = input()\r\nn = int(input())\r\n\r\ndic = {}\r\n\r\nwhile n > 0:\r\n n -= 1\r\n line = input().split()\r\n t = line[0]\r\n m = 0\r\n if line[1].startswith('a'):\r\n m += 100\r\n m += int(line[2])\r\n f = 1\r\n if line[3].startswith('r'):\r\n f += 1\r\n give_red = False\r\n if m in dic.keys():\r\n if dic[m] < 2:\r\n give_red = True\r\n dic[m] += f\r\n else:\r\n dic[m] = f\r\n if f > 1:\r\n give_red = True\r\n\r\n if give_red:\r\n line = ' ' + t\r\n if m > 100:\r\n line = a + ' ' + str(m - 100) + line\r\n else:\r\n line = h + ' ' + str(m) + line\r\n print(line)\r\n \r\n \r\n", "home = input()\r\naway = input()\r\nfouls = int(input())\r\nd = {}\r\nfor _ in range(fouls):\r\n s = input()\r\n m,t,n,c = s.split(\" \")\r\n if t==\"h\":\r\n player = home + \" \"+n\r\n else:\r\n player = away + \" \"+n\r\n if player not in d:\r\n d[player] = 0\r\n if d[player] < 2:\r\n d[player]+=1 if c==\"y\" else 2\r\n if d[player] >= 2:\r\n print(player,m)\r\n", "s1=input()\r\ns2=input()\r\nL={}\r\nL['h']=s1\r\nL['a']=s2\r\n\r\nn=int(input())\r\nD={}\r\nF={}\r\nfor i in range(n):\r\n a=input().split()\r\n m=int(a[0])\r\n t=L[a[1]]\r\n num=int(a[2])\r\n c=a[3]\r\n if((t,num) in D):\r\n continue\r\n if(c=='r' or (c=='y' and ((t,num) in F))):\r\n D[(t,num)]=1\r\n print(t,num,m)\r\n else:\r\n F[(t,num)]=1\r\n", "home = input()\naway = input()\nn = int(input())\n\nhome_status = [0] 100\naway_status = [0] * 100\nreds = []\n\nfor _ in range(n):\n\tt, team, player, color = input().split()\n\tt = int(t)\n\tplayer = int(player)\n\tteam = home if team == 'h' else away\n\tif team == home:\n\t\tif home_status[player-1] < 2:\n\t\t\thome_status[player-1] += 1 if color == 'y' else 2\n\t\t\tif home_status[player-1] >= 2:\n\t\t\t\tprint(\" \".join([team, str(player), str(t)]))\n\tif team == away:\n\t\tif away_status[player-1] < 2:\n\t\t\taway_status[player-1] += 1 if color == 'y' else 2\n\t\t\tif away_status[player-1] >= 2:\n\t\t\t\tprint(\" \".join([team, str(player), str(t)]))\n", "sh=input()\r\nsa=input()\r\nlh={}\r\nla={}\r\nn=int(input())\r\nsc=0\r\nmi,s,num,f=0,'',0,''\r\nwhile n>0:\r\n mi,s,num,f=input().split()\r\n mi=int(mi)\r\n num=int(num)\r\n if f=='y':\r\n sc=1\r\n else:\r\n sc=2\r\n if s=='h':\r\n if num not in lh.keys():\r\n lh.update({num:sc})\r\n else:\r\n lh.update({num:lh[num]+sc})\r\n if lh[num]>=2 and lh[num]<4:\r\n lh.update({num:4})\r\n print(sh,num,mi)\r\n else:\r\n if num not in la.keys():\r\n la.update({num:sc})\r\n else:\r\n la.update({num:la[num]+sc})\r\n if la[num]>=2 and la[num]<4:\r\n la.update({num:4})\r\n print(sa,num,mi)\r\n n-=1\r\n #print(lh,la)\r\n", "s = input()\r\nt = input()\r\nn = int(input())\r\nhomecards, awaycards, homefouls, awayfouls = {}, {}, [], []\r\nfouls = []\r\ndef newfoul(x, y):\r\n if y == \"h\":\r\n if not x[1] in homefouls:\r\n homefouls.append(x[1])\r\n fouls.append(x)\r\n else:\r\n if not x[1] in awayfouls:\r\n awayfouls.append(x[1])\r\n fouls.append(x)\r\nfor x in range(n):\r\n string = input()\r\n foul = string.split()\r\n a, b, c, d = int(foul[0]), foul[1], int(foul[2]), foul[3]\r\n if d == \"r\":\r\n if b == \"h\":\r\n newfoul([s, c, a], \"h\")\r\n else:\r\n newfoul([t, c, a], \"a\")\r\n else:\r\n if b == \"h\":\r\n if not c in homecards:\r\n homecards[c] = 0\r\n homecards[c] += 1\r\n if homecards[c] == 2:\r\n newfoul([s, c, a], \"h\")\r\n else:\r\n if not c in awaycards:\r\n awaycards[c] = 0\r\n awaycards[c] += 1\r\n if awaycards[c] == 2:\r\n newfoul([t, c, a], \"a\")\r\nfor x in fouls:\r\n print(\" \".join(map(str, x)))\r\n", "__author__ = 'Administrator'\r\n\r\n\r\ndef inp():\r\n return input()\r\n\r\n\r\nhome = inp()\r\naway = inp()\r\nn = int(inp())\r\n\r\n\r\nclass Node:\r\n time = 0\r\n team = 0\r\n num = 0\r\n color = 0\r\n\r\n def __lt__(self, other):\r\n return self.time < other.time\r\n\r\n def __init__(self, a, b, c, d):\r\n self.time = a\r\n self.team = b\r\n self.num = c\r\n self.color = d\r\n\r\n\r\ni = 0\r\nlt = []\r\nwhile i < n:\r\n temp = inp().split(' ')\r\n o = Node(int(temp[0]), temp[1] == 'h', int(temp[2]), temp[3] == 'r')\r\n lt.append(o)\r\n i += 1\r\na = [0 for i in range(100)]\r\nb = [0 for i in range(100)]\r\nlt.sort()\r\ni = 0\r\nwhile i < n:\r\n # print(lt[i].time, lt[i].team, lt[i].num, lt[i].color)\r\n if lt[i].team:\r\n if a[lt[i].num] < 2:\r\n if lt[i].color:\r\n a[lt[i].num] += 2\r\n else:\r\n a[lt[i].num] += 1\r\n if a[lt[i].num] >= 2:\r\n print(home, ' ', lt[i].num, ' ', lt[i].time)\r\n else:\r\n pass\r\n else:\r\n pass\r\n else:\r\n if b[lt[i].num] < 2:\r\n if lt[i].color:\r\n b[lt[i].num] += 2\r\n else:\r\n b[lt[i].num] += 1\r\n if b[lt[i].num] >= 2:\r\n print(away, ' ', lt[i].num, ' ', lt[i].time)\r\n else:\r\n pass\r\n else:\r\n pass\r\n i += 1\r\n# print(\"---end\\n\")", "home = input()\naway = input()\nn = int(input())\nvec = []\narr = []\nfor i in range(n):\n arr.append(list(input().split(' ')))\nmp1 = {}\nmp2 = {}\nres1 = {}\nres2 = {}\n\nfor i in range(n):\n min,team_name,player,card_color=arr[i][0],arr[i][1],arr[i][2],arr[i][3]\n\n if card_color=='y' and team_name=='h' and player not in mp1:\n mp1[player]=True\n\n elif card_color=='y' and team_name=='a' and player not in mp2:\n mp2[player]=True\n\n elif card_color=='y' and team_name=='h' and player in mp1:\n ans = ''\n if player not in res1 :\n res1[player]=True\n ans+=home\n ans+=' '\n ans+= player\n ans+=' '\n ans+= min\n vec.append(ans)\n\n elif card_color=='y' and team_name=='a' and player in mp2:\n ans = ''\n if player not in res2:\n res2[player]=True\n ans += away\n ans+=' '\n ans+=player\n ans+=' '\n ans+=min\n vec.append(ans)\n\n elif card_color=='r':\n ans = ''\n if team_name=='a':\n if player not in res2:\n res2[player]=True\n ans += away\n ans+=' '\n ans+= player\n ans+=' '\n ans+= min\n vec.append(ans)\n else:\n ans=''\n if player not in res1:\n res1[player]=True\n ans += home\n ans+=' '\n ans+=player\n ans+= ' '\n ans+= min\n vec.append(ans)\nfor i in vec:\n print (i)\n", "team = {\"h\" : input(),\n \"a\" : input()}\nn = int(input())\nd = {}\nlis = []\nfor x in range(n):\n t, ha, num, card = input().split() \n t = int(t)\n num = int(num)\n lis.append((t,ha,num,card))\nlis.sort(key=lambda x:x[0])\n\nfor x in range(n):\n t, ha, num, card = lis[x] \n if (ha,num) not in d: \n d[(ha,num)] = (t,card)\n if card == \"r\":\n print(team[ha], num, t)\n else:\n if d[(ha,num)][1] == \"y\":\n d[(ha,num)] = (t,\"r\")\n print(team[ha], num, t)\n", "home=input()\r\naway=input()\r\nn=int(input())\r\nyellows=set()\r\nreds=set()\r\ns={'h':home,'a':away}\r\nwhile n:\r\n x=input().split()\r\n time=int(x[0])\r\n team=x[1]\r\n shirt=int(x[2])\r\n card=x[3]\r\n if card=='y':\r\n if (shirt,team) in yellows and (shirt,team) not in reds:#2nd time\r\n print(s[team],shirt,time)\r\n yellows.remove((shirt,team))\r\n reds.add((shirt,team))\r\n else:#1st time\r\n yellows.add((shirt,team))\r\n else:\r\n if(shirt,team) not in reds:\r\n reds.add((shirt,team))\r\n print(s[team],shirt,time)\r\n n-=1", "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, home, away = f.readline().rstrip().split()\r\n # n = int(n)\r\n home = f.readline().rstrip()\r\n away = f.readline().rstrip()\r\n n = int(f.readline())\r\n\r\n fouls = []\r\n for _ in range(n):\r\n moment, team, jersey, card = f.readline().rstrip().split()\r\n fouls.append((int(moment), team, int(jersey), card))\r\n return n, home, away, fouls\r\n\r\n\r\ndef sol(n, home, away, fouls):\r\n fouls = sorted(fouls)\r\n is_yellow = {\r\n \"a\": set(),\r\n \"h\": set()\r\n }\r\n suspend = []\r\n suspend_players = set()\r\n for foul in fouls:\r\n moment, team, jersey, card = foul\r\n if f\"{team}{jersey}\" in suspend_players:\r\n continue\r\n if card == \"r\":\r\n suspend.append((home if team == \"h\" else away, jersey, moment))\r\n suspend_players.add(f\"{team}{jersey}\")\r\n elif card == \"y\":\r\n if jersey in is_yellow[team]:\r\n suspend.append((home if team == \"h\" else away, jersey, moment))\r\n suspend_players.add(f\"{team}{jersey}\")\r\n else:\r\n is_yellow[team].add(jersey)\r\n\r\n res = []\r\n for player in suspend:\r\n res.append(' '.join(map(str, player)))\r\n return res\r\n\r\n\r\ndef solve(input_path=None):\r\n return sol(read_input(input_path))\r\n\r\n\r\ndef main():\r\n for line in sol(read_input()):\r\n print(f\"{line}\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "class Command:\r\n def __init__(self, name):\r\n self.name = name\r\n self.d = {}\r\n self.rC = []\r\n \r\n def add(self, i):\r\n numb = i[2]\r\n pl = self.d.get(numb)\r\n if not pl:\r\n self.d[numb] = [i[0],i[3]]\r\n if i[3] == 'r':\r\n self.rC.append( [numb,i[0]] )\r\n else:\r\n if i[3] == 'y' and pl[1] == 'y':\r\n self.d[numb] = [i[0],'r']\r\n self.rC.append( [numb,i[0]] )\r\n elif pl[1] == 'r':\r\n pass\r\n else:\r\n self.d[numb] = [i[0],i[3]]\r\n if i[3] == 'r':\r\n self.rC.append( [numb,i[0]] )\r\n\r\n def getMinRes(self):\r\n if len(self.rC):\r\n return [self.name] + self.rC[0]\r\n\r\n def delMinRes(self):\r\n self.rC.pop(0)\r\n\r\nclass Game:\r\n def __init__(self, n1, n2):\r\n self.n1 = Command(n1)\r\n self.n2 = Command(n2)\r\n\r\n def parse(self, s):\r\n l = s.split(' ')\r\n if l[1] == 'h':\r\n self.n1.add(l)\r\n else:\r\n self.n2.add(l)\r\n\r\n def getRes(self):\r\n while 1:\r\n n1 = self.n1.getMinRes()\r\n n2 = self.n2.getMinRes()\r\n if n1 and n2:\r\n if int(n1[2]) < int(n2[2]):\r\n self.printRes(n1)\r\n self.n1.delMinRes()\r\n else:\r\n self.printRes(n2)\r\n self.n2.delMinRes()\r\n elif n1:\r\n self.printRes(n1)\r\n self.n1.delMinRes()\r\n elif n2:\r\n self.printRes(n2)\r\n self.n2.delMinRes()\r\n else:\r\n break\r\n\r\n def printRes(self, a):\r\n print('{} {} {}'.format(a[0], a[1], a[2]))\r\n\r\nfirst = input()\r\nsec = input()\r\ng = Game(first,sec)\r\nn = int(input())\r\ns = []\r\nfor i in range(n):\r\n l = input()\r\n s.append(l)\r\n# g = Game('A','B')\r\n# s = ['5 a 84 y',\r\n# '8 h 28 r',\r\n# '10 a 9 r',\r\n# '11 h 93 y',\r\n# '13 a 11 r',\r\n# '15 h 3 r',\r\n# '20 a 88 r',\r\n# '23 a 41 y',\r\n# '25 a 14 y',\r\n# '27 a 38 r',\r\n# '28 a 33 y',\r\n# '29 h 66 r',\r\n# '31 a 16 r',\r\n# '32 a 80 y',\r\n# '34 a 54 r',\r\n# '35 a 50 y',\r\n# '36 a 9 y',\r\n# '39 a 22 y',\r\n# '42 h 81 y',\r\n# '43 a 10 y',\r\n# '44 a 27 r',\r\n# '47 h 39 y',\r\n# '48 a 80 y',\r\n# '50 h 5 y',\r\n# '52 a 67 y',\r\n# '54 h 63 y',\r\n# '56 h 7 y',\r\n# '57 h 44 y',\r\n# '58 h 41 y',\r\n# '61 h 32 y',\r\n# '64 h 91 y',\r\n# '67 a 56 y',\r\n# '69 h 83 y',\r\n# '71 h 59 y',\r\n# '72 a 76 y',\r\n# '75 h 41 y',\r\n# '76 a 49 r',\r\n# '77 a 4 r',\r\n# '78 a 69 y',\r\n# '79 a 96 r',\r\n# '80 h 81 y',\r\n# '86 h 85 r']\r\n\r\nfor i in range(len(s)):\r\n g.parse(s[i])\r\n\r\ng.getRes()", "tn = [input(), input()]\r\nt2i = {'h': 0, 'a': 1}\r\nc2s = {'y': 1, 'r': 2}\r\nst = [[0] * 100, [0] * 100]\r\nfor i in range(int(input())):\r\n m, t, p, c = input().split()\r\n m = int(m)\r\n t = t2i[t]\r\n p = int(p)\r\n s = c2s[c]\r\n if st[t][p] < 2:\r\n st[t][p] += s\r\n if st[t][p] >= 2:\r\n print(tn[t], p, m)", "home = input()\r\naway = input()\r\nn = int(input())\r\nhT = {}\r\nhSet = {}\r\naT = {}\r\naSet = {}\r\nreds = []\r\nfor i in range(n):\r\n List = input().split()\r\n t = List[0]\r\n if List[1] == \"h\":\r\n if List[2] in hT:\r\n hT[List[2]] = \"r\"\r\n else:\r\n hT[List[2]] = List[3]\r\n if hT[List[2]] == \"r\":\r\n reds.append([home, List[2], t])\r\n else:\r\n if List[2] in aT:\r\n aT[List[2]] = \"r\"\r\n else:\r\n aT[List[2]] = List[3]\r\n if aT[List[2]] == \"r\":\r\n reds.append([away, List[2], t])\r\n\r\n\r\nSet = set()\r\nfor red in reds:\r\n if not (red[0], red[1]) in Set:\r\n print(red[0], red[1], red[2])\r\n Set.add((red[0], red[1]))\r\n", "# coding: utf-8\nhome = input()\naway = input()\nn = int(input())\nhomey = set()\nhomer = set()\nawayy = set()\nawayr = set()\nans = []\nfor i in range(n):\n tmp = input().split()\n if tmp[1] == 'h':\n if tmp[2] in homer:\n continue\n if tmp[3] == 'r':\n ans.append(' '.join([home, tmp[2], tmp[0]]))\n homer.add(tmp[2])\n elif tmp[2] in homey:\n ans.append(' '.join([home, tmp[2], tmp[0]]))\n homer.add(tmp[2])\n else:\n homey.add(tmp[2])\n else:\n if tmp[2] in awayr:\n continue\n if tmp[3] == 'r':\n ans.append(' '.join([away, tmp[2], tmp[0]]))\n awayr.add(tmp[2])\n elif tmp[2] in awayy:\n ans.append(' '.join([away, tmp[2], tmp[0]]))\n awayr.add(tmp[2])\n else:\n awayy.add(tmp[2])\nfor ln in ans:\n print(ln)\n", "teams = [input(), input()]\r\nn = int(input())\r\ncnt = [0]10000\r\nused = [False]10000\r\nfor i in range(n):\r\n time, t, m, c = input().split()\r\n m = int(m)\r\n if t != 'h':\r\n m += 1000\r\n if c == 'y':\r\n cnt[m] += 1\r\n else:\r\n cnt[m] += 2\r\n if cnt[m] >= 2 and not used[m]:\r\n used[m] = True\r\n m %= 1000\r\n ans = \"\"\r\n if t == 'h':\r\n ans += teams[0]\r\n else:\r\n ans += teams[1]\r\n ans += ' '\r\n ans = ans + str(m)\r\n ans += ' '\r\n ans += time\r\n print(ans)", "team_1=input()\r\nteam_2=input()\r\nn=int(input())\r\nll=[]\r\nfor i in range(n):\r\n\tmi, te, num, card=map(str, input().split())\r\n\tll.append((int(mi), te, int(num), card))\r\nll.sort(key=lambda x :x[0])\r\n\r\nteam_1_p=[0 for x in range(101)]\r\nteam_2_p=[0 for x in range(101)]\r\nd_1, d_2={}, {}\r\nsol=[]\r\nfor l in ll:\r\n\tif l[1]=='h':\r\n\t\tif l[3]=='r':\r\n\t\t\tif l[2] not in d_1:\r\n\t\t\t\tsol.append((team_1, l[2], l[0]))\r\n\t\t\t\td_1[l[2]]=True\r\n\t\telif l[3]=='y':\r\n\t\t\tif team_1_p[l[2]]==0:\r\n\t\t\t\tteam_1_p[l[2]]+=1\r\n\t\t\telse:\r\n\t\t\t\tif l[2] not in d_1:\r\n\t\t\t\t\tsol.append((team_1, l[2], l[0]))\r\n\t\t\t\t\td_1[l[2]]=True\r\n\tif l[1]=='a':\r\n\t\tif l[3]=='r':\r\n\t\t\tif l[2] not in d_2:\r\n\t\t\t\tsol.append((team_2, l[2], l[0]))\r\n\t\t\t\td_2[l[2]]=True\r\n\t\telif l[3]=='y':\r\n\t\t\tif team_2_p[l[2]]==0:\r\n\t\t\t\tteam_2_p[l[2]]+=1\r\n\t\t\telse:\r\n\t\t\t\tif l[2] not in d_2:\r\n\t\t\t\t\tsol.append((team_2, l[2], l[0]))\r\n\t\t\t\t\td_2[l[2]]=True\r\n\r\nfor x in sol:\r\n\tprint(x)\r\n", "__author__ = 'zhan'\n\nnames = []\nn = 0\nteam = [[0 for i in range(1, 101)], [0 for i in range(1, 101)]]\nteam_index = {\"h\": 0, \"a\": 1}\ncard_index = {\"y\": 1, \"r\": 2}\nnames.append(input())\nnames.append(input())\nn = int(input())\n\nfor i in range(n):\n line = input().split()\n t = line[0]\n tm = line[1]\n number = int(line[2])\n card = line[3]\n team[team_index[tm]][number] += card_index[card]\n if team[team_index[tm]][number] >= 2:\n team[team_index[tm]][number] = -200\n print(names[team_index[tm]] + \" \" + str(number) + \" \" + str(t))", "a=input();b=input()\r\nta={};tb={}\r\nfor x in range(int(input())):\r\n m,t,n,c= input().split()\r\n if t=='a' and ((True if ta[n]<2 else False) if n in ta else True):\r\n if n in ta:ta[n]+=1 if c=='y' else 2\r\n else:ta[n]=1 if c=='y' else 2\r\n if ta[n]>1: print(b,n,m)\r\n elif t=='h' and ((True if tb[n]<2 else False) if n in tb else True):\r\n if n in tb:tb[n]+=1 if c=='y' else 2\r\n else:tb[n]=1 if c=='y' else 2\r\n if tb[n] > 1: print(a, n, m)", "home = input()\r\naway = input()\r\ns = set()\r\nred = set()\r\nfor _ in range(int(input())):\r\n\tl = list(map(str, input().split()))\r\n\tt = tuple(l[1:-1])\r\n\tif l[-1] == \"r\":\r\n\t\tif l[1] == \"a\" and t not in red:\r\n\t\t\tprint(away, l[-2], l[0])\r\n\t\t\tred.add(t)\r\n\t\telif t not in red:\r\n\t\t\tprint(home, l[-2], l[0])\r\n\t\t\tred.add(t)\r\n\telse:\r\n\t\tif t in s:\r\n\t\t\tif l[1] == \"a\" and t not in red:\r\n\t\t\t\tprint(away, l[-2], l[0])\r\n\t\t\t\tred.add(t)\r\n\t\t\telif t not in red:\r\n\t\t\t\tprint(home, l[-2], l[0])\r\n\t\t\t\tred.add(t)\r\n\ts.add(t)\r\n\r\n\t", "name = {}\r\nname['h'] = input()\r\nname['a'] = input()\r\nn = int(input())\r\ninfo = {}\r\nfor i in range(n):\r\n m, t, p, c = input().split()\r\n m = int(m)\r\n p = int(p)\r\n if c == 'r' and not ((t, p) in info and info[(t, p)] == 'r'):\r\n print(name[t], p, m)\r\n info[(t, p)] = 'r'\r\n elif c == 'y':\r\n if (t, p) in info and info[(t, p)] != 'r':\r\n print(name[t], p, m)\r\n info[(t, p)] = 'r'\r\n elif not (t, p) in info:\r\n info[(t, p)] = c\r\n", "s = input()\r\nt = input()\r\ns.rstrip()\r\nt.rstrip()\r\nn = int(input())\r\na = [0] (100)\r\nb = [0] * (100)\r\nfor i in range(n):\r\n e = list(map(str,input().split()))\r\n if (e[1] == 'h'):\r\n if (a[int(e[2])] != -1):\r\n if (e[3] == 'y'):\r\n a[int(e[2])] = a[int(e[2])] + 1\r\n elif (e[3] == 'r'):\r\n a[int(e[2])] = a[int(e[2])] + 2\r\n if (a[int(e[2])] >= 2):\r\n print(s,int(e[2]),e[0])\r\n a[int(e[2])] = -1\r\n else:\r\n if (b[int(e[2])] != -1):\r\n if (e[3] == 'y'):\r\n b[int(e[2])] = b[int(e[2])] + 1\r\n elif (e[3] == 'r'):\r\n b[int(e[2])] = b[int(e[2])] + 2\r\n if (b[int(e[2])] >= 2):\r\n print(t,int(e[2]),e[0])\r\n b[int(e[2])] = -1", "# your code goes here\r\na = input()\r\nb = input()\r\nn = int(input())\r\ndic = {}\r\nfor i in range(n):\r\n\tarray = input().split()\r\n\tmark = (a if array[1] == 'h' else b) + ' ' + array[2]\r\n\tif mark not in dic:\r\n\t\tdic[mark] = 0\r\n\tif dic[mark] < 2:\r\n\t\tif array[3] == 'y':\r\n\t\t\tdic[mark] += 1\r\n\t\tif array[3] == 'r':\r\n\t\t\tdic[mark] += 2\r\n\t\tif dic[mark] >=2:\r\n\t\t\tprint(mark,array[0])", "h = input()\r\na = input()\r\nn = int(input())\r\nd = dict()\r\nfor i in range(n):\r\n arr = input().split()\r\n mark = (h if arr[1] == 'h' else a) + ' ' + arr[2]\r\n if mark not in d:\r\n d[mark] = 0\r\n if d[mark] < 2:\r\n d[mark] += 1 if arr[3] == 'y' else 2\r\n if d[mark] >= 2:\r\n print(mark, arr[0])", "teamname = []\r\nteamname.append(input().strip())\r\nteamname.append(input().strip())\r\n\r\nn = int(input())\r\nfoul = [[0 for m in range(100)] for i in range(2)]\r\n\r\nfor i in range(n):\r\n info = input().split()\r\n t = int(info[0])\r\n team = info[1]\r\n m = int(info[2])\r\n card = info[3]\r\n\r\n if team=='h': td = 0\r\n else: td = 1\r\n \r\n if foul[td][m]>=2: continue\r\n if card=='y': foul[td][m] += 1\r\n else: foul[td][m] += 2\r\n if foul[td][m]>=2:\r\n print('{0} {1} {2}'.format(teamname[td], m, t))\r\n\r\n \r\n \r\n \r\n\r\n", "#!/usr/bin/env python3\n# -- coding: utf-8 --\nimport time\n\nhome = input()\nguest = input()\n\nhome_fall = {str(i):0 for i in range(1, 100)}\nguest_fall= {str(i):0 for i in range(1, 100)}\n\nn = int(input())\n\nstart = time.time()\nfor i in range(n):\n (t, command, n, card) = (i for i in input().split())\n\n if (command == 'h'):\n table = home_fall\n else:\n table = guest_fall\n\n if ( card == 'y' and table[n] == 0 ):\n table[n] = -1\n elif ( card == 'y' and table[n] == -1 ) or (card == 'r' and table[n] <= 0 ):\n table[n] = int(t)\n\nfalls = []\nfor i in home_fall.keys():\n if home_fall[i] > 0:\n falls.append([home, i, home_fall[i]])\n\nfor i in guest_fall.keys():\n if guest_fall[i] > 0:\n falls.append([guest, i, guest_fall[i]])\n\nfalls = sorted(falls, key=lambda x: x[::-1])\n\nfor i in falls:\n s = \"\"\n for j in i:\n s += str(j)+\" \"\n print(s)\n\nfinish = time.time()\n#print(finish - start)\n", "import collections\n\n\na = input()\nb = input()\nstats = collections.defaultdict(int)\nremoved = set()\nfor _ in range(int(input())):\n\n minute, team, number, card = str.split(input())\n player = team + number\n stats[player] += int(1 if card == \"y\" else 2)\n if stats[player] > 1 and player not in removed:\n\n removed.add(player)\n print(\n a if team == \"h\" else b,\n number,\n minute,\n )\n", "teams = dict()\nteams['h'] = input()\nteams['a'] = input()\nn = int(input())\ndata = {}\nreport = []\nfor _ in range(n):\n time, team, num, card = input().split()\n name = team+num\n if name not in data:\n data[name] = card\n if card == 'r':\n report.append(\"{} {} {}\".format(teams[team], num, time))\n elif data[name] == 'y':\n report.append(\"{} {} {}\".format(teams[team], num, time))\n data[name] = 'r'\n\nprint('\\n'.join(report))\n", "from math import \r\n \r\nt1 = input()\r\nt2 = input()\r\n \r\nm1, m2 = {}, {}\r\nfor i in range(int(input())):\r\n t, time, n, cor = input().split()\r\n n = int(n)\r\n \r\n if (time == 'h' and (n not in m1 or m1[n] != 'r')) or (time == 'a' and (n not in m2 or m2[n] != 'r')):\r\n if (time == 'h' and (n in m1 and m1[n] == 'y' or cor == 'r')) or (time == 'a' and (n in m2 and m2[n] == 'y' or cor == 'r')):\r\n if time == \"h\":\r\n m1[n] = 'r'\r\n else:\r\n m2[n] = 'r'\r\n print((t1 if time == 'h' else t2), n, t)\r\n else:\r\n if time == \"h\":\r\n m1[n] = 'y'\r\n else:\r\n m2[n] = 'y'", "def main():\r\n home = input()\r\n away = input()\r\n n = int(input())\r\n cards = {}\r\n teams = {}\r\n teams['h'] = home\r\n teams['a'] = away\r\n for i in range(n):\r\n t,team,m,card = map(str,input().split())\r\n t = int(t)\r\n m = int(m)\r\n curr = (team,m)\r\n if curr not in cards.keys():\r\n cards[(team,m)] = [[card,1]]\r\n if card == 'r':\r\n print(teams[team],m,t)\r\n else:\r\n if len(cards[(team,m)]) == 1:\r\n if cards[(team,m)][0][0] == 'y' and cards[(team,m)][0][1] == 1:\r\n print(teams[team],m,t)\r\n cards[(team,m)][0][1] += 1\r\n\r\n #print(cards)\r\n\r\nmain()\r\n", "teams = [input(),input()]\nn = int(input())\nyel = []\nred = []\n\ndef convert(t,n):\n global teams\n s = \"\"\n if t == 'a':\n s += teams[1] + ' '\n else:\n s += teams[0] + ' '\n return s + n\n\nfor foul in range(n):\n a = input().split()\n temp = convert(a[1],a[2])\n if a[-1] == 'y':\n if temp in yel:\n yel.remove(temp)\n red.append(temp)\n print(temp + ' ' + a[0])\n elif temp in red:\n continue\n else:\n yel.append(temp)\n elif a[-1] == 'r':\n temp = convert(a[1],a[2])\n if temp in red:\n continue\n else:\n print(temp + ' ' + a[0])\n red.append(temp)\n", "home = input()\r\nalien = input()\r\nn = int(input())\r\ntime = ['']91\r\ncards = [[0]*2 for i in range(100)]\r\nans = []\r\nl = 0\r\n\r\nfor i in range(n):\r\n c = input().split()\r\n t = int(c[0])\r\n m = int(c[2])\r\n \r\n if c[1] == 'h':\r\n time[t] += home + ' ' + str(m) + ' '\r\n id = 0\r\n else:\r\n time[t] += alien + ' ' + str(m) + ' '\r\n id = 1\r\n \r\n if c[3] == 'y':\r\n cards[m][id] += 1\r\n else:\r\n if cards[m][id] < 2:\r\n cards[m][id] = 2\r\n else:\r\n cards[m][id] += 2\r\n \r\n if cards[m][id] == 2:\r\n time[t] += str(t)\r\n ans.append(time[t])\r\n l += 1\r\n \r\nfor i in range(l):\r\n print(ans[i])", "\"\"\"\r\nCodeforces Contest 281 Div 2 Problem A\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.3.4\r\n\"\"\"\r\n\r\ndef main():\r\n s1 = read(0)\r\n s2 = read(0)\r\n n, = read()\r\n arr = dict()\r\n res = []\r\n for i in range(n):\r\n w,x,y,z = read(1)\r\n w = int(w)\r\n if x+y in arr.keys():\r\n if arr[x+y][1] != \"r\":\r\n res.append((x,y,w))\r\n arr[x+y] = (w, \"r\")\r\n else:\r\n arr[x+y] = (w, z)\r\n if arr[x+y][1] == \"r\":\r\n res.append((x,y,w))\r\n for x,y,w in res:\r\n print(s1 if x == \"h\" else s2, y, w)\r\n\r\n################################### NON-SOLUTION STUFF BELOW\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 list(map(int, inputs.split()))\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\nwrite(main())", "team_one = input()\nteam_two = input()\nn = int(input())\npts_one = [0 for i in range(100)]\npts_two = [0 for i in range(100)]\nfor i in range(n):\n\tline = input()\n\tt, team, m, card = line.split()\n\tt = int(t)\n\tm = int(m)\n\tfault = 0\n\tif card == 'y':\n\t\tfault = 1\n\telse: fault = 2\n\tif team == 'h':\n\t\tpts_one[m] += fault\n\t\tif pts_one[m] == 2 or (pts_one[m] == 3 and fault == 2):\n\t\t\tprint(team_one, m, t)\n\telif team == 'a':\n\t\tpts_two[m] += fault\n\t\tif pts_two[m] == 2 or (pts_two[m] == 3 and fault == 2):\n\t\t\tprint(team_two, m, t)\n" ]	{"inputs": ["MC\nCSKA\n9\n28 a 3 y\n62 h 25 y\n66 h 42 y\n70 h 25 y\n77 a 4 y\n79 a 25 y\n82 h 42 r\n89 h 16 y\n90 a 13 r", "REAL\nBARCA\n3\n27 h 7 y\n44 a 10 y\n87 h 3 r", "MASFF\nSAFBDSRG\n5\n1 h 1 y\n15 h 1 r\n27 a 1 y\n58 a 1 y\n69 h 10 y", "ARMENIA\nBULGARIA\n12\n33 h 17 y\n42 h 21 y\n56 a 17 y\n58 a 6 y\n61 a 7 y\n68 a 10 y\n72 h 13 y\n73 h 21 y\n74 a 8 r\n75 a 4 y\n77 a 10 y\n90 a 23 y", "PORTUGAL\nNETHERLANDS\n16\n2 a 18 y\n7 a 3 y\n20 h 18 y\n31 h 6 y\n45 h 6 y\n50 h 8 y\n59 a 5 y\n60 h 7 y\n63 a 3 y\n72 a 20 y\n73 h 20 y\n74 a 10 y\n75 h 1 y\n76 h 14 y\n78 h 20 y\n90 a 5 y", "TANC\nXNCOR\n2\n15 h 27 r\n28 h 27 r", "ASGDFJH\nAHGRSDXGER\n3\n23 h 15 r\n68 h 15 y\n79 h 15 y", "ASFSHDSG\nADGYRTJNG\n5\n1 h 1 y\n2 h 1 y\n3 h 1 y\n4 h 1 r\n5 h 1 y", "A\nB\n42\n5 a 84 y\n8 h 28 r\n10 a 9 r\n11 h 93 y\n13 a 11 r\n15 h 3 r\n20 a 88 r\n23 a 41 y\n25 a 14 y\n27 a 38 r\n28 a 33 y\n29 h 66 r\n31 a 16 r\n32 a 80 y\n34 a 54 r\n35 a 50 y\n36 a 9 y\n39 a 22 y\n42 h 81 y\n43 a 10 y\n44 a 27 r\n47 h 39 y\n48 a 80 y\n50 h 5 y\n52 a 67 y\n54 h 63 y\n56 h 7 y\n57 h 44 y\n58 h 41 y\n61 h 32 y\n64 h 91 y\n67 a 56 y\n69 h 83 y\n71 h 59 y\n72 a 76 y\n75 h 41 y\n76 a 49 r\n77 a 4 r\n78 a 69 y\n79 a 96 r\n80 h 81 y\n86 h 85 r", "ARM\nAZE\n45\n2 a 13 r\n3 a 73 r\n4 a 10 y\n5 h 42 y\n8 h 56 y\n10 h 15 y\n11 a 29 r\n13 a 79 y\n14 a 77 r\n18 h 7 y\n20 a 69 r\n22 h 19 y\n25 h 88 r\n26 a 78 y\n27 a 91 r\n28 h 10 r\n30 h 13 r\n31 a 26 r\n33 a 43 r\n34 a 91 y\n40 h 57 y\n44 h 18 y\n46 a 25 r\n48 a 29 y\n51 h 71 y\n57 a 16 r\n58 h 37 r\n59 h 92 y\n60 h 11 y\n61 a 88 y\n64 a 28 r\n65 h 71 r\n68 h 39 y\n70 h 8 r\n71 a 10 y\n72 a 32 y\n73 h 95 r\n74 a 33 y\n75 h 48 r\n78 a 44 y\n79 a 22 r\n80 h 50 r\n84 a 50 y\n88 a 90 y\n89 h 42 r", "KASFLS\nASJBGGDLJFDDFHHTHJH\n42\n2 a 68 y\n4 h 64 r\n5 a 24 y\n6 h 20 r\n8 a 16 r\n9 a 96 y\n10 h 36 r\n12 a 44 y\n13 h 69 r\n16 a 62 r\n18 a 99 r\n20 h 12 r\n21 a 68 y\n25 h 40 y\n26 h 54 r\n28 h 91 r\n29 a 36 r\n33 a 91 y\n36 h 93 r\n37 h 60 r\n38 a 82 r\n41 a 85 y\n42 a 62 r\n46 a 22 r\n48 a 88 r\n49 a 8 r\n51 h 45 y\n54 a 84 y\n57 a 8 y\n59 h 24 y\n61 h 22 r\n64 h 11 r\n69 a 89 y\n72 h 44 r\n75 h 57 r\n76 h 80 y\n77 h 54 r\n79 a 1 y\n81 a 31 r\n82 h 8 y\n83 a 28 r\n86 h 56 y", "AB\nBC\n3\n1 h 1 y\n2 h 1 y\n3 h 1 r"], "outputs": ["MC 25 70\nMC 42 82\nCSKA 13 90", "REAL 3 87", "MASFF 1 15\nSAFBDSRG 1 58", "ARMENIA 21 73\nBULGARIA 8 74\nBULGARIA 10 77", "PORTUGAL 6 45\nNETHERLANDS 3 63\nPORTUGAL 20 78\nNETHERLANDS 5 90", "TANC 27 15", "ASGDFJH 15 23", "ASFSHDSG 1 2", "A 28 8\nB 9 10\nB 11 13\nA 3 15\nB 88 20\nB 38 27\nA 66 29\nB 16 31\nB 54 34\nB 27 44\nB 80 48\nA 41 75\nB 49 76\nB 4 77\nB 96 79\nA 81 80\nA 85 86", "AZE 13 2\nAZE 73 3\nAZE 29 11\nAZE 77 14\nAZE 69 20\nARM 88 25\nAZE 91 27\nARM 10 28\nARM 13 30\nAZE 26 31\nAZE 43 33\nAZE 25 46\nAZE 16 57\nARM 37 58\nAZE 28 64\nARM 71 65\nARM 8 70\nAZE 10 71\nARM 95 73\nARM 48 75\nAZE 22 79\nARM 50 80\nARM 42 89", "KASFLS 64 4\nKASFLS 20 6\nASJBGGDLJFDDFHHTHJH 16 8\nKASFLS 36 10\nKASFLS 69 13\nASJBGGDLJFDDFHHTHJH 62 16\nASJBGGDLJFDDFHHTHJH 99 18\nKASFLS 12 20\nASJBGGDLJFDDFHHTHJH 68 21\nKASFLS 54 26\nKASFLS 91 28\nASJBGGDLJFDDFHHTHJH 36 29\nKASFLS 93 36\nKASFLS 60 37\nASJBGGDLJFDDFHHTHJH 82 38\nASJBGGDLJFDDFHHTHJH 22 46\nASJBGGDLJFDDFHHTHJH 88 48\nASJBGGDLJFDDFHHTHJH 8 49\nKASFLS 22 61\nKASFLS 11 64\nKASFLS 44 72\nKASFLS 57 75\nASJBGGDLJFDDFHHTHJH 31 81\nASJBGGDLJFDDFHHTHJH 28 83", "AB 1 2"]}	UNKNOWN	PYTHON3	CODEFORCES	48
8a91e345120c4e99d41dd166b1ac3025	Gerald and Giant Chess	Giant chess is quite common in Geraldion. We will not delve into the rules of the game, we'll just say that the game takes place on an h<=×<=w field, and it is painted in two colors, but not like in chess. Almost all cells of the field are white and only some of them are black. Currently Gerald is finishing a game of giant chess against his friend Pollard. Gerald has almost won, and the only thing he needs to win is to bring the pawn from the upper left corner of the board, where it is now standing, to the lower right corner. Gerald is so confident of victory that he became interested, in how many ways can he win? The pawn, which Gerald has got left can go in two ways: one cell down or one cell to the right. In addition, it can not go to the black cells, otherwise the Gerald still loses. There are no other pawns or pieces left on the field, so that, according to the rules of giant chess Gerald moves his pawn until the game is over, and Pollard is just watching this process. The first line of the input contains three integers: h,<=w,<=n — the sides of the board and the number of black cells (1<=≤<=h,<=w<=≤<=105,<=1<=≤<=n<=≤<=2000). Next n lines contain the description of black cells. The i-th of these lines contains numbers ri,<=ci (1<=≤<=ri<=≤<=h,<=1<=≤<=ci<=≤<=w) — the number of the row and column of the i-th cell. It is guaranteed that the upper left and lower right cell are white and all cells in the description are distinct. Print a single line — the remainder of the number of ways to move Gerald's pawn from the upper left to the lower right corner modulo 109<=+<=7. Sample Input 3 4 2 2 2 2 3 100 100 3 15 16 16 15 99 88 Sample Output 2 545732279	[ "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\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\ndef Extended_Euclid(n,m):\r\n stack=[]\r\n while m:\r\n stack.append((n,m))\r\n n,m=m,n%m\r\n if n>=0:\r\n x,y=1,0\r\n else:\r\n x,y=-1,0\r\n for i in range(len(stack)-1,-1,-1):\r\n n,m=stack[i]\r\n x,y=y,x-(n//m)y\r\n return x,y\r\n\r\nclass MOD:\r\n def __init__(self,p,e=1):\r\n self.p=p\r\n self.e=e\r\n self.mod=self.pself.e\r\n\r\n def Pow(self,a,n):\r\n a%=self.mod\r\n if n>=0:\r\n return pow(a,n,self.mod)\r\n else:\r\n assert math.gcd(a,self.mod)==1\r\n x=Extended_Euclid(a,self.mod)[0]\r\n return pow(x,-n,self.mod)\r\n\r\n def Build_Fact(self,N):\r\n assert N>=0\r\n self.factorial=[1]\r\n self.cnt=[0](N+1)\r\n for i in range(1,N+1):\r\n ii=i\r\n self.cnt[i]=self.cnt[i-1]\r\n while ii%self.p==0:\r\n ii//=self.p\r\n self.cnt[i]+=1\r\n self.factorial.append((self.factorial[-1]ii)%self.mod)\r\n self.factorial_inve=[None](N+1)\r\n self.factorial_inve[-1]=self.Pow(self.factorial[-1],-1)\r\n for i in range(N-1,-1,-1):\r\n ii=i+1\r\n while ii%self.p==0:\r\n ii//=self.p\r\n self.factorial_inve[i]=(self.factorial_inve[i+1]ii)%self.mod\r\n\r\n def Fact(self,N):\r\n return self.factorial[N]pow(self.p,self.cnt[N],self.mod)%self.mod\r\n\r\n def Fact_Inve(self,N):\r\n if self.cnt[N]:\r\n return None\r\n return self.factorial_inve[N]\r\n\r\n def Comb(self,N,K,divisible_count=False):\r\n if K<0 or K>N:\r\n return 0\r\n retu=self.factorial[N]self.factorial_inve[K]self.factorial_inve[N-K]%self.mod\r\n cnt=self.cnt[N]-self.cnt[N-K]-self.cnt[K]\r\n if divisible_count:\r\n return retu,cnt\r\n else:\r\n retu=pow(self.p,cnt,self.mod)\r\n retu%=self.mod\r\n return retu\r\n\r\nH,W,N=map(int,readline().split())\r\nH-=1\r\nW-=1\r\nmod=109+7\r\nMD=MOD(mod)\r\nMD.Build_Fact(210*5)\r\nhw=[]\r\nfor _ in range(N):\r\n h,w=map(int,readline().split())\r\n h-=1;w-=1\r\n hw.append((h,w))\r\nhw.sort()\r\nh,w=[h for h,w in hw],[w for h,w in hw]\r\ndp0,dp1=[0]N,[0]N\r\nfor j in range(N):\r\n dp1[j]=MD.Comb(h[j]+w[j],h[j])\r\n for i in range(j):\r\n dp0[j]+=dp1[i]MD.Comb(h[j]-h[i]+w[j]-w[i],h[j]-h[i])\r\n dp0[j]%=mod\r\n dp1[j]+=dp0[i]MD.Comb(h[j]-h[i]+w[j]-w[i],h[j]-h[i])\r\n dp1[j]%=mod\r\nans=MD.Comb(H+W,H)\r\nfor i in range(N):\r\n ans+=(dp0[i]-dp1[i])MD.Comb(H-h[i]+W-w[i],H-h[i])\r\n ans%=mod\r\nprint(ans)", "h, w, n = map(int, input().split())\r\n\r\nMOD = 10*9+7\r\n\r\n\r\nfacts = [0 for i in range(310*5)]\r\nfacts[0] = 1\r\nfor i in range(1, len(facts)):\r\n facts[i] = (facts[i-1]i)%MOD\r\n\r\ninvs = [0 for i in range(3105)]\r\ninvs[-1] = pow(facts[-1], MOD-2, MOD)\r\nfor i in range(len(invs)-2, -1, -1):\r\n invs[i] = (invs[i+1](i+1))%MOD\r\n\r\ndef ncr(n, r):\r\n return (facts[n]invs[r]invs[n-r])%MOD\r\n\r\n\r\npts = []\r\nfor _ in range(n):\r\n pts.append(tuple(map(int, input().split())))\r\n\r\npts.sort()\r\n\r\ndp = [0 for i in range(n)]\r\n\r\ndef get(fx, fy, tx, ty):\r\n return ncr(tx-fx+ty-fy, tx-fx)\r\n\r\nfor i in range(n):\r\n dp[i] = get(1, 1, pts[i][0], pts[i][1])\r\n for j in range(i):\r\n if pts[j][0] <= pts[i][0] and pts[j][1] <= pts[i][1]:\r\n dp[i] -= dp[j]get(pts[j][0], pts[j][1], pts[i][0], pts[i][1])\r\n dp[i] %= MOD\r\n\r\n\r\n#print(dp)\r\n\r\ns = 0\r\n\r\nfor i in range(n):\r\n s += dp[i]get(pts[i][0], pts[i][1], h, w)\r\n s %= MOD\r\n\r\nprint((get(1, 1, h, w)-s)%MOD)\r\n\r\n", "# https://codeforces.com/contest/560/problem/E\nfrom __future__ import annotations\nimport math\n\n\ndef solution(height: int, width: int, black_points: list[tuple[int]], modulo: int) -> int:\n length = height + width\n\n factorial = [1] * length\n for i in range(1, length):\n factorial[i] = factorial[i - 1] * i % modulo\n\n inverse = [1] * length\n for i in range(2, length):\n inverse[i] = (modulo - modulo // i) * inverse[modulo % i] % modulo\n for i in range(1, length):\n inverse[i] = inverse[i] * inverse[i - 1] % modulo\n\n math_comb = lambda n, k: factorial[n] * inverse[k] * inverse[n - k] % modulo\n math_comb2 = lambda n, k: math.comb(n, k) % modulo\n\n black_points.append((height, width))\n black_points.sort()\n\n total_paths = [0] * len(black_points)\n for i, (h_i, w_i) in enumerate(black_points):\n total_paths[i] = math_comb(h_i - 1 + w_i - 1, h_i - 1) % modulo\n\n for j, (h_j, w_j) in enumerate(black_points[:i]):\n if h_i >= h_j and w_i >= w_j:\n total_paths[i] -= total_paths[j] * math_comb(h_i - h_j + w_i - w_j, h_i - h_j) % modulo\n\n return total_paths[-1] % modulo\n\n\ndef main():\n modulo = 1000000007\n height, width, black_points_cnt = list(map(int, input().split()))\n\n black_points = []\n for _ in range(black_points_cnt):\n row_num, col_num = list(map(int, input().split()))\n black_points.append((row_num, col_num))\n\n print(solution(height, width, black_points, modulo))\n return 0\n\n\nif __name__ == \"__main__\":\n main()\n\n# import codewars_test as test\n\n# test.assert_equals(solution(3, 4, [(2, 2), (2, 3)], 1000000007), 2)\n# test.assert_equals(solution(100, 100, [(15, 16), (16, 15), (99, 88)], 1000000007), 545732279)\n# test.assert_equals(solution(10000, 10000, [(15, 16), (16, 15), (99, 88)], 1000000007), 558441761)\n", "# The idea is to compute dp[i], the number of paths from top left to ith point.\r\n# Here, the first and last point = top left and bottom right respectively\r\n# To compute dp[i], we use complementary counting to remove paths that are invalid.\r\n# The idea is that each invalid path has a \"last\" black cell j that they go through,\r\n# after which the remaining ways for this path to get to the top left = dp[j].\r\n\r\nMOD = 10*9 + 7\r\nMAXN = 210*5\r\nfac = [1] (MAXN + 1)\r\ninv_fac = [0] * (MAXN + 1)\r\n\r\nfor i in range(2, MAXN+1):\r\n fac[i] = i * fac[i-1] % MOD\r\n\r\ninv_fac[MAXN] = pow(fac[MAXN], -1, MOD)\r\nfor i in range(MAXN-1, -1, -1):\r\n inv_fac[i] = inv_fac[i+1] * (i+1) % MOD\r\n\r\n\r\ndef choose(n, k):\r\n return (fac[n] * inv_fac[k]) % MOD * inv_fac[n-k] % MOD\r\n\r\n\r\nh, w, n = map(int, input().split())\r\n\r\nfrom collections import namedtuple\r\n\r\nCell = namedtuple('Cell', ['r', 'c'])\r\n\r\ncells = [Cell(1, 1)] + [Cell(map(int, input().split())) for _ in range(n)] + [Cell(h, w)]\r\ncells.sort()\r\n\r\ndef num_paths(i, j):\r\n dr = abs(cells[i].r - cells[j].r)\r\n dc = abs(cells[i].c - cells[j].c)\r\n\r\n return choose(dr + dc, dr)\r\n\r\ndp = [0] (n+2)\r\ndp[0] = 1\r\n\r\nfor i in range(1, n+2):\r\n dp[i] = num_paths(0, i)\r\n\r\n # remove invalid paths\r\n for j in range(1, i):\r\n if cells[j].c <= cells[i].c:\r\n dp[i] = (dp[i] - dp[j]num_paths(i, j)) % MOD\r\n\r\nprint(dp[-1])\r\n", "def f0(h, w, arr):\r\n def power(base, exp, module):\r\n val = 1\r\n while exp:\r\n if exp & 1:\r\n val = val base % module\r\n base = base * base % module\r\n exp >>= 1\r\n return val\r\n\r\n mod = int(1e9 + 7)\r\n M = h + w + 1\r\n facts = [1] * M\r\n invrs = [1] * M\r\n j = 1\r\n for i in range(2, M):\r\n facts[i] = j = j * i % mod\r\n invrs[-1] = power(facts[-1], mod - 2, mod)\r\n for i in range(M - 2, 1, -1):\r\n invrs[i] = invrs[i + 1] * (i + 1) % mod\r\n\r\n def comb(x, y):\r\n return (facts[x] * invrs[x - y]) % mod * invrs[y] % mod\r\n\r\n arr.append([h, w])\r\n n = len(arr)\r\n arr.sort()\r\n f = [0] * n\r\n for i in range(n):\r\n a, b = arr[i]\r\n fi = comb(a + b - 2, a - 1)\r\n for j in range(i):\r\n c, d = arr[j]\r\n if c <= a and d <= b:\r\n fij = comb(a - c + b - d, a - c)\r\n fij = (fij * f[j]) % mod\r\n fi = (fi - fij + mod) % mod\r\n f[i] = fi\r\n return f[-1]\r\n\r\n\r\nh, w, n = map(int, input().split())\r\narr = [list(map(int, input().split())) for _ in range(n)]\r\nprint(f0(h, w, arr))\r\n", "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\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\ndef Extended_Euclid(n,m):\r\n stack=[]\r\n while m:\r\n stack.append((n,m))\r\n n,m=m,n%m\r\n if n>=0:\r\n x,y=1,0\r\n else:\r\n x,y=-1,0\r\n for i in range(len(stack)-1,-1,-1):\r\n n,m=stack[i]\r\n x,y=y,x-(n//m)y\r\n return x,y\r\n\r\nclass MOD:\r\n def __init__(self,mod):\r\n self.mod=mod\r\n \r\n def Pow(self,a,n):\r\n a%=self.mod\r\n if n>=0:\r\n return pow(a,n,self.mod)\r\n else:\r\n assert math.gcd(a,self.mod)==1\r\n x=Extended_Euclid(a,self.mod)[0]\r\n return pow(x,-n,self.mod)\r\n\r\n def Build_Fact(self,N):\r\n assert N>=0\r\n self.factorial=[1]\r\n for i in range(1,N+1):\r\n self.factorial.append((self.factorial[-1]i)%self.mod)\r\n self.factorial_inv=[None](N+1)\r\n self.factorial_inv[-1]=self.Pow(self.factorial[-1],-1)\r\n for i in range(N-1,-1,-1):\r\n self.factorial_inv[i]=(self.factorial_inv[i+1](i+1))%self.mod\r\n return self.factorial_inv\r\n\r\n def Fact(self,N):\r\n return self.factorial[N]\r\n\r\n def Fact_Inv(self,N):\r\n return self.factorial_inv[N]\r\n\r\n def Comb(self,N,K):\r\n if K<0 or K>N:\r\n return 0\r\n s=self.factorial[N]\r\n s=(sself.factorial_inv[K])%self.mod\r\n s=(sself.factorial_inv[N-K])%self.mod\r\n return s\r\n\r\nH,W,N=map(int,readline().split())\r\nRC=[tuple(map(int,readline().split())) for i in range(N)]\r\nRC.sort()\r\nmod=10*9+7\r\nMD=MOD(mod)\r\nMD.Build_Fact(210*5)\r\ndp=[0]N\r\nans=MD.Comb(H+W-2,H-1)\r\nfor i in range(N):\r\n r,c=RC[i]\r\n dp[i]=MD.Comb(r+c-2,r-1)\r\n for j in range(i):\r\n dr=r-RC[j][0]\r\n dc=c-RC[j][1]\r\n dp[i]-=dp[j]MD.Comb(dr+dc,dr)\r\n dp[i]%=mod\r\nfor i in range(N):\r\n r,c=RC[i]\r\n dr=H-r\r\n dc=W-c\r\n dp[i]=MD.Comb(dr+dc,dr)\r\n dp[i]%=mod\r\nans-=sum(dp)\r\nans%=mod\r\nprint(ans)" ]	{"inputs": ["3 4 2\n2 2\n2 3", "100 100 3\n15 16\n16 15\n99 88", "1000 1000 4\n50 50\n51 50\n50 51\n51 51", "100000 100000 4\n50001 50001\n50000 50000\n50000 50001\n50001 50000", "2 2 2\n2 1\n1 2", "100 10 30\n40 4\n15 3\n75 3\n88 10\n32 1\n16 5\n81 8\n45 2\n72 8\n11 6\n86 4\n50 2\n9 4\n11 1\n20 3\n47 3\n2 4\n68 3\n90 5\n85 2\n88 1\n88 5\n86 3\n70 9\n49 3\n34 4\n5 7\n77 5\n50 1\n87 5", "100000 100000 2\n1 2\n2 1", "100000 100000 2\n99999 100000\n100000 99999", "100000 100000 3\n99998 100000\n99999 99999\n100000 99998"], "outputs": ["2", "545732279", "899660737", "999612315", "0", "402737011", "0", "0", "0"]}	UNKNOWN	PYTHON3	CODEFORCES	6
8a957f78e0d55fcc24a4b2ca6c9e4fec	Increase Sequence	Peter has a sequence of integers a1,<=a2,<=...,<=an. Peter wants all numbers in the sequence to equal h. He can perform the operation of "adding one on the segment [l,<=r]": add one to all elements of the sequence with indices from l to r (inclusive). At that, Peter never chooses any element as the beginning of the segment twice. Similarly, Peter never chooses any element as the end of the segment twice. In other words, for any two segments [l1,<=r1] and [l2,<=r2], where Peter added one, the following inequalities hold: l1<=≠<=l2 and r1<=≠<=r2. How many distinct ways are there to make all numbers in the sequence equal h? Print this number of ways modulo 1000000007 (109<=+<=7). Two ways are considered distinct if one of them has a segment that isn't in the other way. The first line contains two integers n,<=h (1<=≤<=n,<=h<=≤<=2000). The next line contains n integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=2000). Print a single integer — the answer to the problem modulo 1000000007 (109<=+<=7). Sample Input 3 2 1 1 1 5 1 1 1 1 1 1 4 3 3 2 1 1 Sample Output 4 1 0	[ "f = lambda: map(int, input().split())\r\nn, h = f()\r\ns, i = 1, 0\r\nfor j in f():\r\n j = h - j\r\n if j < 0 or abs(j - i) > 1: exit(print(0))\r\n if j <= i: s = s * (j + 1) % 1000000007\r\n i = j\r\nprint(0 if i > 1 else s)" ]	{"inputs": ["3 2\n1 1 1", "5 1\n1 1 1 1 1", "4 3\n3 2 1 1", "1 2000\n2000", "3 2\n2 1 1", "3 4\n4 3 2", "10 6\n5 4 4 4 5 4 4 4 4 5", "10 6\n5 4 4 4 5 4 4 4 4 5", "7 4\n3 3 4 4 4 3 3", "3 6\n5 6 5", "3 2\n1 0 1", "6 1\n0 1 0 0 0 1", "6 3\n2 1 2 2 1 2", "99 1999\n1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987 1986 1985 1984 1983 1982 1981 1980 1979 1978 1977 1976 1975 1974 1973 1972 1971 1970 1969 1968 1967 1966 1965 1964 1963 1962 1961 1960 1959 1958 1957 1956 1955 1954 1953 1952 1951 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999", "9 4\n2 3 2 2 2 3 3 3 2", "1 349\n348", "10 20\n20 19 18 17 16 15 16 17 18 19", "19 10\n10 9 8 7 6 5 4 3 2 10 2 3 4 5 6 7 8 9 10", "19 11\n10 9 8 7 6 5 4 3 3 3 3 3 4 5 6 7 8 9 10", "7 3\n2 1 1 2 1 1 2"], "outputs": ["4", "1", "0", "1", "2", "0", "972", "972", "4", "1", "2", "4", "8", "726372166", "0", "1", "120", "0", "264539520", "36"]}	UNKNOWN	PYTHON3	CODEFORCES	1
8b05508e415ac732ef63660436500b6f	Cannon	Bertown is under siege! The attackers have blocked all the ways out and their cannon is bombarding the city. Fortunately, Berland intelligence managed to intercept the enemies' shooting plan. Let's introduce the Cartesian system of coordinates, the origin of which coincides with the cannon's position, the Ox axis is directed rightwards in the city's direction, the Oy axis is directed upwards (to the sky). The cannon will make n more shots. The cannon balls' initial speeds are the same in all the shots and are equal to V, so that every shot is characterized by only one number alphai which represents the angle at which the cannon fires. Due to the cannon's technical peculiarities this angle does not exceed 45 angles (π<=/<=4). We disregard the cannon sizes and consider the firing made from the point (0,<=0). The balls fly according to the known physical laws of a body thrown towards the horizon at an angle: Think of the acceleration of gravity g as equal to 9.8. Bertown defends m walls. The i-th wall is represented as a vertical segment (xi,<=0)<=-<=(xi,<=yi). When a ball hits a wall, it gets stuck in it and doesn't fly on. If a ball doesn't hit any wall it falls on the ground (y<==<=0) and stops. If the ball exactly hits the point (xi,<=yi), it is considered stuck. Your task is to find for each ball the coordinates of the point where it will be located in the end. The first line contains integers n and V (1<=≤<=n<=≤<=104,<=1<=≤<=V<=≤<=1000) which represent the number of shots and the initial speed of every ball. The second line contains n space-separated real numbers alphai (0<=<<=alphai<=<<=π<=/<=4) which represent the angles in radians at which the cannon will fire. The third line contains integer m (1<=≤<=m<=≤<=105) which represents the number of walls. Then follow m lines, each containing two real numbers xi and yi (1<=≤<=xi<=≤<=1000,<=0<=≤<=yi<=≤<=1000) which represent the wall’s coordinates. All the real numbers have no more than 4 decimal digits. The walls may partially overlap or even coincide. Print n lines containing two real numbers each — calculate for every ball the coordinates of its landing point. Your answer should have the relative or absolute error less than 10<=-<=4. Sample Input 2 10 0.7853 0.3 3 5.0 5.0 4.0 2.4 6.0 1.9 2 10 0.7853 0.3 2 4.0 2.4 6.0 1.9 Sample Output 5.000000000 2.549499369 4.000000000 0.378324889 10.204081436 0.000000000 4.000000000 0.378324889	[ "import sys\nfrom math import tan, sin, cos\n\nreadline = sys.stdin.readline\n\nballs = []\nwalls = []\nV = 0\n\ndef read_input():\n global V\n n, v = list(map(int, readline().split()))\n V = v\n for i in range(n):\n balls.append([float(readline().strip()), i])\n balls.sort()\n n = int(readline().strip())\n for i in range(n):\n walls.append(list(map(float, readline().split())))\n walls.sort()\n\ndef solve()->list:\n g = 9.8\n result = []\n for alpha, idx in balls:\n b = tan(alpha)\n t = 2 * V * sin(alpha) / g\n a = - b / (V * cos(alpha) * t)\n result.append([- b/ a, 0.0, a, b, idx])\n j = 0\n for x1, y1 in walls:\n while j < len(result) and result[j][0] <= x1:\n j += 1\n if j == len(result):\n break\n while j < len(result):\n x0, y0, a, b, idx = result[j]\n if 0<= a * x1 * x1 + b * x1 <= y1:\n result[j] = [x1, a * x1 * x1 + b * x1, a, b, idx]\n j += 1\n else:\n break\n return result\n\ndef write_output(result: list):\n result.sort(key = lambda x: x[-1])\n for r in result:\n print(r[0], r[1])\n\nread_input()\nwrite_output(solve())\n# print(balls)\n# print(solve())" ]	{"inputs": ["2 10\n0.7853\n0.3\n3\n5.0 5.0\n4.0 2.4\n6.0 1.9", "2 10\n0.7853\n0.3\n2\n4.0 2.4\n6.0 1.9", "3 186\n0.4084\n0.4559\n0.1203\n3\n978.8435 234.6507\n343.6961 128.6128\n611.2897 458.9593", "4 851\n0.3178\n0.5635\n0.1335\n0.5107\n4\n685.3785 249.6264\n681.8946 242.4571\n917.2937 600.3285\n150.5685 135.5137", "2 875\n0.7537\n0.4375\n5\n445.8822 355.9854\n29.3463 12.5104\n845.7334 537.7371\n494.5914 322.9145\n799.3183 315.1701", "6 417\n0.0303\n0.7536\n0.7225\n0.2404\n0.2432\n0.4583\n3\n979.9372 477.1436\n469.9804 408.1158\n923.2564 220.5522"], "outputs": ["5.000000000 2.549499369\n4.000000000 0.378324889", "10.204081436 0.000000000\n4.000000000 0.378324889", "611.289700000 201.687561175\n611.289700000 234.096418112\n343.696100000 24.571869439", "150.568500000 49.359453403\n150.568500000 94.919970010\n150.568500000 20.065007118\n150.568500000 84.158687413", "77968.056705539 0.000000000\n445.882200000 207.001740252", "469.980400000 8.014848928\n17707.905316391 0.000000000\n469.980400000 403.227402023\n469.980400000 108.613087969\n469.980400000 109.999956153\n469.980400000 224.117928434"]}	UNKNOWN	PYTHON3	CODEFORCES	1
8b08ea902b7acfe6c832a6ab2e5cbf65	New York Hotel	Think of New York as a rectangular grid consisting of N vertical avenues numerated from 1 to N and M horizontal streets numerated 1 to M. C friends are staying at C hotels located at some street-avenue crossings. They are going to celebrate birthday of one of them in the one of H restaurants also located at some street-avenue crossings. They also want that the maximum distance covered by one of them while traveling to the restaurant to be minimum possible. Help friends choose optimal restaurant for a celebration. Suppose that the distance between neighboring crossings are all the same equal to one kilometer. The first line contains two integers N и M — size of the city (1<=≤<=N,<=M<=≤<=109). In the next line there is a single integer C (1<=≤<=C<=≤<=105) — the number of hotels friends stayed at. Following C lines contain descriptions of hotels, each consisting of two coordinates x and y (1<=≤<=x<=≤<=N, 1<=≤<=y<=≤<=M). The next line contains an integer H — the number of restaurants (1<=≤<=H<=≤<=105). Following H lines contain descriptions of restaurants in the same format. Several restaurants and hotels may be located near the same crossing. In the first line output the optimal distance. In the next line output index of a restaurant that produces this optimal distance. If there are several possibilities, you are allowed to output any of them. Sample Input 10 10 2 1 1 3 3 2 1 10 4 4 Sample Output 6 2	[ "N, M = input().split()\r\na, b, c, d = [int(1e10) for _ in range(4)]\r\nfor i in range(int(input())):\r\n x, y = list(map(int, input().split()))\r\n a, b, c, d = min(a, x + y), min(b, x - y), min(c, - x + y), min(d, - x - y)\r\nres, pos = int(1e10), 0\r\nfor i in range(int(input())):\r\n x, y = list(map(int, input().split()))\r\n ans = max(max(x + y - a, x - y - b), max( - x + y - c, - x - y - d))\r\n if ans < res:\r\n pos = i + 1\r\n res = ans\r\nprint(res, pos, sep = '\\n')" ]	{"inputs": ["10 10\n2\n1 1\n3 3\n2\n1 10\n4 4", "100 100\n10\n53 20\n97 6\n12 74\n48 92\n97 13\n47 96\n75 32\n69 21\n95 75\n1 54\n10\n36 97\n41 1\n1 87\n39 23\n27 44\n73 97\n1 1\n6 26\n48 3\n5 69", "100 100\n10\n86 72\n25 73\n29 84\n34 33\n29 20\n84 83\n41 80\n22 22\n16 89\n77 49\n1\n4 23", "100 100\n1\n66 77\n10\n70 11\n76 69\n79 39\n90 3\n38 87\n61 81\n98 66\n63 68\n62 93\n53 36", "1000000000 1000000000\n1\n1 1\n1\n1000000000 1000000000", "123456789 987654321\n1\n312 987654321\n1\n123456789 213", "453456789 987654321\n1\n443943901 1\n1\n1354 213389832", "923456789 987654321\n1\n443943901 132319791\n1\n1354 560", "100 100\n1\n1 100\n1\n1 100", "1 1\n1\n1 1\n1\n1 1", "1000000000 1000000000\n2\n1 1\n3 3\n2\n1 10\n4 4"], "outputs": ["6\n2", "108\n4", "140\n1", "9\n6", "1999999998\n1", "1111110585\n1", "657332378\n1", "576261778\n1", "0\n1", "0\n1", "6\n2"]}	UNKNOWN	PYTHON3	CODEFORCES	1
8b27e972e3fa26ad5abe3942fc090f84	Permute Digits	You are given two positive integer numbers a and b. Permute (change order) of the digits of a to construct maximal number not exceeding b. No number in input and/or output can start with the digit 0. It is allowed to leave a as it is. The first line contains integer a (1<=≤<=a<=≤<=1018). The second line contains integer b (1<=≤<=b<=≤<=1018). Numbers don't have leading zeroes. It is guaranteed that answer exists. Print the maximum possible number that is a permutation of digits of a and is not greater than b. The answer can't have any leading zeroes. It is guaranteed that the answer exists. The number in the output should have exactly the same length as number a. It should be a permutation of digits of a. Sample Input 123 222 3921 10000 4940 5000 Sample Output 213 9321 4940	[ "a, b = sorted(input()), int(input())\r\nfor i in range(len(a)):\r\n\tfor j in range(i+1, len(a)):\r\n\t\tc = int(str.join('', a))\r\n\t\ta[i], a[j] = a[j], a[i]\r\n\t\td = int(str.join('', a))\r\n\t\tif c <= d <= b:\r\n\t\t continue\r\n\t\telse:\r\n\t\t a[i], a[j] = a[j], a[i]\r\nprint(str.join('', a))", "a=input()\r\nb=input()\r\no=0\r\nt=[]\r\ni=0\r\nh=0\r\nc=0\r\nw=0\r\nj=0\r\nl=[int(d) for d in a]\r\nk=[int(i) for i in b]\r\nl.sort()\r\nl.reverse()\r\nif(len(l)<len(k)):\r\n print(''.join(map(str,l)))\r\nif(len(l)==len(k)):\r\n for i in range(0,len(k)):\r\n o=k[i]\r\n if(o in l):\r\n t.append(o)\r\n l.remove(o)\r\n l.sort()\r\n l.reverse()\r\n h=len(t)\r\n else:\r\n while(o not in l and o>=0):\r\n o=o-1\r\n if(o in l):\r\n t.append(o)\r\n l.remove(o)\r\n l.sort()\r\n l.reverse()\r\n break\r\n else:\r\n while(c!=1):\r\n for j in range(0,len(l)):\r\n if(t[h-1]>l[j]):\r\n c=c+1\r\n w=l[j]\r\n break\r\n l.append(t[h-1])\r\n l.sort()\r\n l.reverse()\r\n del(t[h-1])\r\n h=len(t) \r\n t.append(w)\r\n l.remove(w)\r\n l.sort()\r\n l.reverse()\r\n break\r\n print(''.join(map(str,t+l)))\r\n", "from sys import stdin, stdout\r\nnmbr = lambda: int(input())\r\nlst = lambda: list(map(int, input().split()))\r\n\r\nfor _ in range(1):#nmbr()):\r\n sa=sorted(input(), reverse=True)\r\n na=len(sa)\r\n sb=input()\r\n nb=len(sb)\r\n if nb>na:\r\n print(''.join(sa))\r\n continue\r\n ans=''\r\n while sa:\r\n for i in range(len(sa)):\r\n new=ans+sa[i]+''.join(sorted(sa[:i]+sa[i+1:]))\r\n if int(new)<=int(sb):\r\n ans+=sa[i]\r\n sa.pop(i)\r\n break\r\n print(ans)", "a = list(input())\r\nb = int(input())\r\na.sort()\r\nfor i in range(len(a) - 1):\r\n for j in range(len(a) - 1, i - 1, -1):\r\n c = int(\"\".join(a[:i] + a[j: j +1] + a[i:j] + a[j+1:]))\r\n if c <= b:\r\n a = a[:i] + a[j: j +1] + a[i:j] + a[j+1:]\r\n break\r\nprint(\"\".join(a))", "a = str(input())\r\nb = str(input())\r\n\r\nfrom collections import defaultdict\r\n\r\nA = [c for c in a]\r\nB = [c for c in b]\r\nA.sort(reverse=True)\r\nif int(''.join(A)) < int(''.join(B)):\r\n print(int(''.join(A)))\r\n exit()\r\n\r\nn = len(B)\r\nA = [int(c) for c in A]\r\nB = [int(c) for c in B]\r\ndp = [[defaultdict(lambda: 0) for i in range(2)] for j in range(n+1)]\r\nC = [0]10\r\nfor c in A:\r\n C[c] += 1\r\ndp[0][0][tuple(C)] = 0\r\nfor i in range(n):\r\n for k in range(2):\r\n nd = B[i]\r\n for t, v in dp[i][k].items():\r\n t = list(t)\r\n for d in range(10):\r\n if t[d] == 0:\r\n continue\r\n t[d] -= 1\r\n ni = i+1\r\n nj = tuple(t)\r\n nk = k\r\n if k == 0:\r\n if d > nd:\r\n continue\r\n elif d < nd:\r\n nk = 1\r\n else:\r\n pass\r\n dp[ni][nk][nj] = max(v10+d, dp[ni][nk][nj])\r\n t[d] += 1\r\nans = 0\r\nfor k in range(2):\r\n for t, v in dp[n][k].items():\r\n ans = max(v, ans)\r\nprint(ans)\r\n", "import sys\n\ndef backtrack(sol, remaining, b, pos, free):\n if len(sol) == len(b):\n print(sol)\n sys.exit(0)\n for c in '9876543210':\n if not free and c > b[pos]: continue\n if not remaining[ord(c)-ord('0')]: continue\n remaining[ord(c)-ord('0')] -= 1\n backtrack(sol+c, remaining, b, pos+1, free or c < b[pos])\n remaining[ord(c)-ord('0')] += 1\n\na = ''.join(sorted(input())[::-1])\nb = input()\n\nif len(a) < len(b):\n print(a)\nelse:\n x = [0] * 10\n for c in a: \n x[ord(c)-ord('0')] += 1\n backtrack('', x, b, 0, False)\n", "sa=sorted(input(),reverse=True)\r\nna=len(sa)\r\nsb=input()\r\nnb=len(sb)\r\nif nb>na:\r\n print(\"\".join(sa))\r\nelse:\r\n ans=\"\"\r\n while sa:\r\n for i in range(len(sa)):\r\n new=ans+sa[i]+\"\".join(sorted(sa[:i]+sa[i+1:]))\r\n if int(new)<=int(sb):\r\n ans+=sa[i]\r\n sa.pop(i)\r\n break\r\n print(ans)", "a=list(input())\na.sort(reverse=True)\nb=int(input())\nans=''\nwhile(len(a)>0):\n for i in range(len(a)):\n x=ans+a[i]+''.join(sorted(a[:i]+a[i+1:]))\n if(int(x)<=b):\n ans+=a[i]\n a=a[:i]+a[i+1:]\n break\nprint(ans)\n\t\t\t\t\t\t\t\t \t \t\t \t \t \t\t\t", "class Solution:\r\n\r\n def canWork(self, pre, a, b):\r\n return int(pre + \"\".join(a)) <= b\r\n\r\n def step(self, pre, a, b):\r\n for i in range(len(a) - 1, -1, -1):\r\n pre2 = pre + a[i]\r\n a2 = a[:i] + a[i+1:]\r\n if self.canWork(pre2, a2, b):\r\n return (pre2, a2)\r\n raise Exception(\"Broken\")\r\n\r\n def solve(self, a, b):\r\n a = list(a)\r\n b = int(b)\r\n pre = \"\"\r\n a.sort()\r\n while a:\r\n (pre, a) = self.step(pre, a, b)\r\n return pre\r\n\r\n\r\ndef main():\r\n sol = Solution()\r\n print(sol.solve(input(), input()))\r\n\r\nmain()", "a = input()\nb = input()\nla = [int(x) for x in a]\nres = []\nla.sort()\nla = la[::-1]\nlb = [int(x) for x in b]\ncnt = [0] * 20\n\ndef check():\n tres = 0\n for x in range(len(res)):\n tres = 10\n tres += int(res[x])\n return tres <= int(b)\nif len(a) < len(b):\n for i in range(len(la)):\n print(la[i], end = '')\n print()\nelse:\n for i in range(len(la)):\n cnt[la[i]] += 1\n flag = 0\n for i in range(len(lb)):\n if flag == 0 and cnt[lb[i]]:\n res.append(lb[i])\n cnt[lb[i]] -= 1\n else:\n flag = i - 1\n for j in range(lb[i] - 1, -1, -1):\n if cnt[j]:\n res.append(j)\n cnt[j] -= 1\n break\n for j in range(9, -1, -1):\n while cnt[j]:\n res.append(j)\n cnt[j] -= 1\n break\n while not check():\n temp = []\n cnt = [0] 20\n for x in range(flag):\n temp.append(res[x])\n cnt[res[x]] -= 1\n for i in la:\n cnt[i] += 1\n ##print(\"cnt = \", cnt)\n res = temp\n ##print(flag, res)\n for v in range(lb[flag] - 1, -1, -1):\n if cnt[v]:\n res.append(v)\n cnt[v] -= 1\n break\n for v in range(9, -1, -1):\n while cnt[v]:\n res.append(v)\n cnt[v] -= 1\n ##print(flag, res)\n flag -= 1\n for i in range(len(res)):\n print(res[i], end = '')\n print()\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nd = [0]10\r\nfor i in input()[:-1]:\r\n d[int(i)] += 1\r\nq = [int(i) for i in input()[:-1]]\r\nn = sum(d)\r\nm = len(q)\r\new = []\r\ni = m-n\r\nif i > 0:\r\n for i in range(9, -1, -1):\r\n print(str(i)d[i],end='')\r\nelse:\r\n t = 0\r\n while i < n:\r\n if d[q[i]]:\r\n d[q[i]] -= 1\r\n ew.append(q[i])\r\n i += 1\r\n else:\r\n a, b = q[i], 0\r\n while a > 0:\r\n a -= 1\r\n if d[a]:\r\n d[a] -= 1\r\n ew.append(a)\r\n b = 1\r\n break\r\n if b == 1:\r\n t = 1\r\n else:\r\n i -= 1\r\n while ew:\r\n d[ew.pop()] += 1\r\n for j in range(q[i]-1, -1, -1):\r\n if d[j]:\r\n d[j] -= 1\r\n ew.append(j)\r\n t = 1\r\n break\r\n if t == 0:\r\n i -= 1\r\n else:\r\n break\r\n if t == 1:\r\n break\r\n print(''.join(map(str, ew)), end='')\r\n for j in range(9, -1, -1):\r\n print(str(j) * d[j], end='')\r\n\r\n", "a=sorted(input())\r\nb=int(input())\r\na=a[::-1]\r\nprefix=\"\"\r\nwhile a:\r\n for i in range(len(a)):\r\n n = prefix + a[i] + \"\".join(sorted(a[:i] + a[i+1:]))\r\n if int(n) <= b:\r\n prefix += a[i]\r\n a.pop(i)\r\n break\r\nprint(prefix)", "from bisect import bisect_left as bl\nfrom bisect import bisect_right as br\nfrom heapq import heappush,heappop,heapify\nimport math\nfrom collections import \nfrom functools import reduce,cmp_to_key\nimport sys\ninput = sys.stdin.readline\n\nfrom itertools import accumulate\nfrom functools import lru_cache\n\nM = mod = 998244353\ndef factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n0.5) + 1) if n % i == 0))))\ndef inv_mod(n):return pow(n, mod - 2, mod)\n \ndef li():return [int(i) for i in input().rstrip('\\n').split()]\ndef st():return input().rstrip('\\n')\ndef val():return int(input().rstrip('\\n'))\ndef li2():return [i for i in input().rstrip('\\n')]\ndef li3():return [int(i) for i in input().rstrip('\\n')]\n\n\na = val()\nb = val()\n\nn = len(str(a))\n\na = [int(i) for i in str(a)]\na.sort()\nif len(str(b)) > n:\n \n print(sorted(a, reverse = 1), sep = '')\n exit()\n\nb = str(b)\nb = [int(i) for i in b]\n\n\ndef makenum(s):return int(''.join(str(e) for e in s))\n\ndef givemax(a, b):\n if len(a) > len(b):return a\n elif len(b) > len(a):return b\n else:\n for j in range(len(a)):\n if a[j] > b[j]:return a\n elif b[j] > a[j]:return b\n return a\n\n\n@lru_cache(None)\ndef dp(l, equal = 1):\n\n if len(l) == 1:return str(-float('inf')) if l[0] > b[-1] and equal else str(l[0])\n if not equal:return ''.join(str(e) for e in sorted(l, reverse = 1))\n ans = ''\n l = list(l)\n curr = b[n - len(l)]\n for i in range(len(l)):\n if l[i] < curr and dp(tuple(l[:i] + l[i + 1:]), 0) != '-inf':\n ans = givemax(ans, str(l[i]) + dp(tuple(l[:i] + l[i + 1:]), 0))\n elif l[i] == curr and dp(tuple(l[:i] + l[i + 1:]), 1) != '-inf':\n ans = givemax(ans, str(l[i]) + dp(tuple(l[:i] + l[i + 1:]), 1))\n\n return str(ans)\n\nprint(dp(tuple(a), 1))", "a=list(input())\r\nb=int(input())\r\na.sort()\r\na=a[::-1]\r\nprefix=\"\"\r\nwhile(len(a)>0):\r\n\tfor i in range(len(a)):\r\n\t\tnum=prefix+a[i]+\"\".join(sorted(a[:i]+a[i+1:]))\r\n\t\tif(int(num)<=b):\r\n\t\t\tprefix+=a[i]\r\n\t\t\ta=a[:i]+a[i+1:]\r\n\t\t\tbreak\r\nprint(prefix)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Fri Sep 18 08:45:24 2020\r\n\r\n@author: Dark Soul\r\n\"\"\"\r\ndef comp(a,b):\r\n x=len(a)\r\n s1=''\r\n s2=''\r\n for i in range(x):\r\n s1+=str(a[i])\r\n s2+=str(b[i])\r\n if s1>s2:\r\n return 1\r\n else:\r\n return 0\r\n \r\na=list(input(''))\r\nb=list(input(''))\r\ncnt=[0]10\r\nn=len(a)\r\nm=len(b)\r\nsol=''\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\n cnt[a[i]]+=1\r\n\r\nif n!=m:\r\n a.sort(reverse=True)\r\n for i in a:\r\n sol+=str(i)\r\n print(sol)\r\nelse:\r\n a.sort()\r\n \r\n for i in range(n):\r\n b[i]=int(b[i])\r\n for i in range(n-1):\r\n for j in range(i,n):\r\n if a[i]<a[j]:\r\n temp=a[i]\r\n a[i]=a[j]\r\n a[j]=temp\r\n if comp(a,b):\r\n temp=a[i]\r\n a[i]=a[j]\r\n a[j]=temp\r\n \r\n \r\n for i in a:\r\n sol+=str(i)\r\n print(sol)", "a=list(reversed(sorted(map(int,input()))))\r\nb=list(map(int,input()))\r\nif len(b)>len(a):\r\n print(a,sep='')\r\nelse:\r\n ans=[]\r\n for i in range(len(b)):\r\n if b[i] in a:\r\n ans.append(b[i])\r\n a.remove(b[i])\r\n else:\r\n while b[i]<=min(a):\r\n a.append(ans.pop())\r\n i-=1\r\n a.sort(reverse=True)\r\n for j in a:\r\n if j<b[i]:\r\n ans.append(j)\r\n a.remove(j)\r\n break\r\n print(ans,sep='',end='')\r\n print(a,sep='')\r\n break\r\n else:\r\n print(ans,sep='')", "# problem is not solved\r\n\r\ndef permuteDigits():\r\n low = list(input().strip())\r\n high = list(input().strip())\r\n\r\n if len(low) < len(high):\r\n low.sort()\r\n low.reverse()\r\n print(''.join(low))\r\n else:\r\n li = []; i = 0; string = ''\r\n while True:\r\n if high[i] in low:\r\n for j in range(len(low)):\r\n if low[j]==high[i] and j not in li:\r\n li.append(j)\r\n string += low[j]\r\n break\r\n else:\r\n break\r\n i += 1\r\n if i==len(low):\r\n print(string)\r\n return\r\n continue\r\n break\r\n\r\n li.sort()\r\n for item in range(len(li)-1, -1, -1):\r\n del low[li[item]]\r\n\r\n low.sort() \r\n if min(low) < high[i]:\r\n for p in range(len(low)-1, -1, -1):\r\n if int(low[p]) < int(high[i]):\r\n string += low[p]\r\n del low[p]\r\n break\r\n for p in range(len(low)-1, -1, -1):\r\n string += low[p]\r\n else:\r\n while True:\r\n i -= 1\r\n if min(low) < high[i]:\r\n break\r\n low.append(high[i])\r\n string = string[:-1]\r\n\r\n low.sort()\r\n for p in range(len(low)-1, -1, -1):\r\n if low[p] < high[i]:\r\n temp = string[-1]\r\n string = string[:-1]\r\n string += low[p]\r\n del low[p]\r\n low.append(temp)\r\n break\r\n\r\n low.sort()\r\n for p in range(len(low)-1, -1, -1):\r\n string += low[p]\r\n print(string)\r\n\r\npermuteDigits()\r\n", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\n \r\n \r\ndef process(A, B):\r\n answer = []\r\n digits = [0 for i in range(10)]\r\n for d in A:\r\n digits[int(d)]+=1\r\n if len(A) < len(B):\r\n answer = []\r\n for i in range(9, -1, -1):\r\n for j in range(digits[i]):\r\n answer.append(str(i))\r\n answer = ''.join(answer)\r\n sys.stdout.write(f'{answer}\\n')\r\n return\r\n m = len(B)\r\n n = len(A)\r\n B1 = int(B)\r\n answer1 = 0\r\n answer = []\r\n can_equal = True\r\n for i in range(n):\r\n d1 = int(B[i])\r\n if digits[d1] > 0:\r\n digits2 = [x for x in digits]\r\n digits2[d1]-=1\r\n A2 = 10answer1+d1\r\n for d2 in range(10):\r\n for j in range(digits2[d2]):\r\n A2 = 10A2+d2 \r\n if A2 <= B1:\r\n answer.append(d1)\r\n digits[d1]-=1\r\n answer1 = 10answer1+d1 \r\n else:\r\n can_equal = False \r\n else:\r\n can_equal = False \r\n if not can_equal:\r\n for d2 in range(d1-1,-1, -1):\r\n if digits[d2] > 0:\r\n digits[d2]-=1\r\n answer.append(d2)\r\n break \r\n for d2 in range(9, -1, -1):\r\n for j in range(digits[d2]):\r\n answer.append(d2)\r\n break\r\n answer = ''.join(map(str, answer))\r\n sys.stdout.write(f'{answer}\\n')\r\n \r\n \r\n \r\n \r\n \r\n\r\nA = input().decode().strip()\r\nB = input().decode().strip()\r\nprocess(A, B)", "import sys\r\n\r\na, b = input(), input()\r\n\r\nif len(a) < len(b):\r\n print(sorted(a, reverse=True), sep='')\r\n exit()\r\n\r\ncnt = [0]10\r\n\r\nfor x in a:\r\n cnt[int(x)] += 1\r\n\r\n\r\ndef rec(res, digit, rem):\r\n if digit == len(b):\r\n return res\r\n if rem[int(b[digit])]:\r\n r = rem[:]\r\n r[int(b[digit])] -= 1\r\n x = rec(res + b[digit], digit+1, r)\r\n if x:\r\n return x\r\n for d in range(int(b[digit])-1, -1, -1):\r\n if rem[d]:\r\n res += str(d)\r\n rem[d] -= 1\r\n suf = []\r\n for i in range(10):\r\n suf += [str(i)] * rem[i]\r\n return res + ''.join(sorted(suf, reverse=True))\r\n return ''\r\n\r\n\r\nans = rec('', 0, cnt[:])\r\nprint(ans)\r\n", "mass = list(input())\r\nb = int(input())\r\nmass.sort()\r\nmass = mass[::-1]\r\np = ''\r\nwhile(len(mass)>0):\r\n\tfor i in range(len(mass)):\r\n\t\tn = p + mass[i] + ''.join(sorted(mass[:i] + mass[i + 1:]))\r\n\t\tif int(n) <= b:\r\n\t\t\tp += mass[i]\r\n\t\t\tmass = mass[:i] + mass[i + 1:]\r\n\t\t\tbreak\r\nprint(p)", "a = input()\r\nb = input()\r\n\r\ncnt = [0] * 10\r\n\r\nfor c in a:\r\n cnt[int(c)] += 1\r\n\r\ndef rec(l, aa, bb):\r\n if l >= len(a):\r\n print(aa)\r\n exit(0)\r\n if aa > bb:\r\n return\r\n for i in range(9, -1, -1):\r\n if cnt[i] > 0:\r\n new_aa = aa * 10 + i\r\n new_bb = bb * 10 + int(b[l])\r\n if new_aa <= new_bb:\r\n cnt[i] -= 1\r\n rec(l + 1, new_aa, new_bb)\r\n cnt[i] += 1\r\n\r\ndef print_max_a():\r\n for i in range(9, -1, -1):\r\n while cnt[i] > 0:\r\n print(i, end='')\r\n cnt[i] -= 1\r\n print()\r\n\r\nif len(b) > len(a):\r\n print_max_a()\r\nelse:\r\n rec(0, 0, 0)\r\n", "a=sorted(input())\r\nb=int(input())\r\na=a[::-1]\r\np=\"\"\r\nwhile a:\r\n\tfor i, z in enumerate(a):\r\n\t\tn=p+a[i]+\"\".join(sorted(a[:i]+a[i+1:]))\r\n\t\tif int(n)<=b:\r\n\t\t\tp+=z\r\n\t\t\ta.pop(i)\r\n\t\t\tbreak\r\nprint(p)", "def f(b, l, i, ls, below=False):\r\n if i == len(b): return True\r\n ne = int(b[i])\r\n if below:\r\n ne = 9\r\n found = False\r\n for j in range(ne, -1, -1):\r\n if ls[j] > 0:\r\n l.append(j)\r\n ls[j] -= 1\r\n val = f(b, l, i + 1, ls, True if below or j < ne else False)\r\n ls[j] += 1\r\n if val:\r\n found = True\r\n break\r\n else: \r\n l.pop()\r\n return found\r\n\r\na = input(); b = input()\r\nif len(b) > len(a):\r\n print(''.join(sorted(a, reverse=True)))\r\nl = []\r\nls = [0] * 11\r\nfor x in a: ls[int(x)] += 1\r\nf(b, l, 0, ls)\r\nprint(''.join(map(str, l)))\r\n", "fre =[0,0,0,0,0,0,0,0,0,0,0]\r\na=input();b=input()\r\nc=False\r\ndef DFS(aa,bb):\r\n if int(aa)==len(a):\r\n print(bb)\r\n exit()\r\n global c\r\n for i in range(9,-1,-1):\r\n if (fre[i]>0 and i<=int(b[int(aa)])) or (fre[i]>0 and c):\r\n fre[i]-=1\r\n if i<int(b[int(aa)]):\r\n c=True\r\n DFS(aa+1,bb10+i)\r\n fre[i]+=1\r\n c=False\r\n \r\n\r\n\r\nif len(b)>len(a):\r\n x=sorted(a);\r\n \r\n print(x[::-1],sep='')\r\nelse:\r\n for i in a:\r\n fre[int(i)]+=1\r\n DFS(0,0)\r\n", "from collections import Counter\n\na = int(input())\nb = int(input())\n\ndef sorted_diff(a, b):\n counter = Counter(list(str(b)))\n counter -= Counter(list(str(a)))\n\n result = []\n for key in sorted(counter.keys()):\n for i in range(counter[key]):\n result.append(key)\n\n return result\n\n\nmax_prefix = ''\nfor length in range(len(str(a))):\n diff = sorted_diff(max_prefix, a)\n \n max_curr = new_symb = None\n for symb in diff:\n diff_diff = sorted_diff(symb, ''.join(diff))\n next_prefix = int('{}{}{}'.format(max_prefix, symb, ''.join(diff_diff)))\n\n if next_prefix <= b:\n if max_curr is None:\n max_curr = next_prefix\n new_symb = symb\n else:\n if max_curr < next_prefix:\n max_curr = next_prefix\n new_symb = symb\n\n max_prefix += new_symb\n\nprint(max_prefix)\n", "a,b = list(input()),int(input())\r\nans = \"\"\r\na.sort(reverse=True)\r\nwhile len(a)>0:\r\n for i in range(len(a)):\r\n num = ans+a[i]+\"\".join(sorted(a[:i]+a[i+1:]))\r\n if int(num)<=b:\r\n ans += a[i]\r\n a = a[:i]+a[i+1:]\r\n break\r\nprint(ans)", "s=sorted(input())\r\nm=int(input())\r\nh=len(s)\r\nfun=lambda y:int(''.join(y))\r\nfor x in range(0,h):\r\n for i in range(x,h):\r\n s[x],s[i]=s[i],s[x]\r\n temp=fun(s)\r\n if(temp>m):\r\n s[x],s[i]=s[i],s[x]\r\n\r\nprint(fun(s)) \r\n", "def main():\n a = list(input(\"\"))\n b = input(\"\")\n a.sort()\n a.reverse()\n maxNumber = \"\"\n\n if len(a) < len(str(b)):\n for num in a:\n maxNumber += num\n else:\n maxNumber = fillInDigit(a,b,[],\"\")\n print(maxNumber)\n\ndef fillInDigit(num1, num2, usedDigits, currentMaxNumber):\n maxLeadingDigit = \"-1\"\n secondLeadingDigit = int(num2[0])\n for x in num1:\n if int(x) <= secondLeadingDigit and int(x) > int(maxLeadingDigit):\n maxLeadingDigit = x\n\n maxNumber1 = currentMaxNumber\n maxNumber1 += maxLeadingDigit\n usedDigits.append(maxLeadingDigit)\n num1.remove(maxLeadingDigit)\n num2 = num2[1:]\n\n if len(num1) == 0:\n return maxNumber1\n elif int(maxLeadingDigit) < secondLeadingDigit:\n if len(num1) > 0:\n for num in num1:\n maxNumber1 += num\n return maxNumber1\n elif int(min(num1)) > int(num2[0]):\n for i in range(len(maxNumber1)-1,-1,-1):\n maxLeadingDigit2 = \"-1\"\n\n for x in num1:\n if int(x) < int(maxNumber1[i]) and int(x) > int(maxLeadingDigit2):\n maxLeadingDigit2 = x\n if maxLeadingDigit2 == \"-1\":\n num1.append(usedDigits[len(usedDigits)-1])\n usedDigits.pop()\n else:\n num1.append(maxNumber1[i])\n maxNumber1 = maxNumber1[:i] + maxLeadingDigit2\n num1.remove(maxLeadingDigit2)\n num1.sort()\n num1.reverse()\n\n if len(num1) > 0:\n for num in num1:\n maxNumber1 += num\n return maxNumber1\n else:\n return fillInDigit(num1,num2,usedDigits,maxNumber1)\n\nif __name__ == \"__main__\":\n main()", "a=input()\r\nb=input()\r\nv=sorted(a)\r\nv=v[::-1]\r\nx=\"\"\r\nfor i in range(len(v)):\r\n x=x+v[i]\r\nv=x\r\nif(len(a)<len(b)):\r\n print(v)\r\nelse:\r\n if(b==a):\r\n print(a)\r\n else:\r\n fin=\"\"\r\n flag=False\r\n for j in range(len(a)): \r\n for k in range(len(a)):\r\n num=fin+v[k]+''.join(sorted(v[:k:]+v[k+1::]))\r\n #print(num,k,fin)\r\n if(num<=b):\r\n fin+=v[k]\r\n #print(fin,v[k],b[j])\r\n if(int(v[k])<int(b[j])):\r\n flag=True\r\n v=v[:k:]+v[k+1::]\r\n fin+=v \r\n v=v[:k:]+v[k+1::]\r\n break\r\n if(flag):\r\n break\r\n print(fin)", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineerin College\r\n Date:18/05/2020\r\n\r\n'''\r\nimport sys\r\nfrom collections import deque,defaultdict as dd \r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\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\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=1000000007\r\n#mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\ndef read():\r\n tc=0\r\n if tc:\r\n input=sys.stdin.readline\r\n else:\r\n sys.stdin=open('input1.txt', 'r')\r\n sys.stdout=open('output1.txt','w')\r\n\r\n\r\ndef permute(b,x,ind):\r\n if(ind==len(b)):\r\n return 1\r\n f=0\r\n for i in range(9,-1,-1):\r\n if(x[i]>0 and i<=int(b[ind])):\r\n x[i]-=1\r\n ans[ind]=str(i)\r\n if(i<int(b[ind])):\r\n f=1\r\n if(f):\r\n k=9\r\n for j in range(ind+1,len(b)):\r\n while(x[k]==0):\r\n k-=1\r\n ans[j]=str(k)\r\n x[k]-=1\r\n return 1\r\n if(permute(b,x,ind+1)):\r\n return 1\r\n x[i]+=1\r\n return 0\r\n \r\n \r\n\r\ndef solve():\r\n \r\n # for _ in range(ii()):\r\n \r\n \r\n \r\n a=ii()\r\n b=ii()\r\n if(len(str(a))<len(str(b))):\r\n s=list(str(a))\r\n s.sort(reverse=True)\r\n print(\"\".join(s))\r\n else:\r\n x=[0]10\r\n for i in str(a):\r\n x[int(i)]+=1\r\n b=str(b)\r\n i=0\r\n global ans\r\n ans=[0]len(b)\r\n permute(b,x,0)\r\n print(\"\".join(ans))\r\n \r\n \r\n \r\n \r\nif __name__ ==\"__main__\":\r\n # read()\r\n solve()\r\n \r\n \r\n ", "import sys\r\ninput = lambda : sys.stdin.readline().rstrip(\"\\r\\n\")\r\na = list(input())\r\nb = int(input())\r\nn = len(a)\r\na.sort()\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n t = a.copy()\r\n t[i], t[j] = t[j], t[i]\r\n \r\n if int(''.join(t)) >= int(''.join(a)) and b >= int(''.join(t)):\r\n a[i], a[j] = a[j], a[i]\r\n\r\nprint(''.join(a))", "a = sorted(list(input()))\r\nb = int(input())\r\n\r\nfor i in range(len(a)):\r\n for j in range(len(a) - 1, -1, -1):\r\n num = a[:i] + a[j:j+1] + a[i:j] + a[j+1:]\r\n if int(''.join(num)) <= b:\r\n a = num\r\n break\r\n \r\nprint(''.join(a))\r\n", "a=''.join(reversed(sorted(input())))\r\nb=int(input())\r\nr=''\r\nwhile len(a)>0:\r\n for i in range(len(a)):\r\n n=r+a[i]+''.join(sorted(a[:i]+a[i+1:]))\r\n if int(n)<=b:\r\n r+=a[i]\r\n a=a[:i]+a[i+1:]\r\n break\r\nprint(r)", "success = 0\r\ndef solve(b, freq, i, n, res):\r\n global success\r\n if i == len(b):\r\n success = res\r\n else:\r\n success = 0\r\n move = 9\r\n while move >= 0 and success == 0:\r\n m = int(b[i])\r\n if freq[move] > 0 and res * 10 + move <= n * 10 + m:\r\n res = res * 10 + move\r\n n = n * 10 + m\r\n freq[move] -= 1\r\n if solve(b, freq, i + 1, n, res) == 0:\r\n res //= 10\r\n n //= 10\r\n freq[move] += 1\r\n move -= 1\r\n return success\r\n\r\na = input()\r\nb = input()\r\nfreq = []\r\nfor i in range(10):\r\n freq.append(0)\r\nv = []\r\nfor x in a:\r\n n = int(x)\r\n v.append(n)\r\n freq[n] += 1\r\nv.sort()\r\nans = 0\r\nif len(b) > len(a):\r\n m = 1\r\n for x in v:\r\n ans = x * m + ans\r\n m = 10\r\nelse:\r\n ans = solve(b, freq, 0, 0, 0)\r\nprint(ans)", "a = sorted(input())\nb = int(input())\na = a[::-1] #reverse a\np = ''\ncnt = [0]10\n\nwhile a :\n for i, d in enumerate(a):\n n = p + d + \"\".join(sorted(a[:i]+a[i+1:]))\n if int(n) <= b :\n p += d\n a.pop(i)\n break\n \nprint(p)", "a=list(input())\r\nb=int(input())\r\na.sort(reverse=True)\r\nans=\"\"\r\nwhile a:\r\n for i in range(len(a)):\r\n j=a[:i]+a[i+1:]\r\n l=ans+a[i]+\"\".join(sorted(j))\r\n if int(l)<=b:\r\n ans=ans+a[i]\r\n del(a[i])\r\n break\r\n \r\nprint(ans)", "a=list(input())\r\nb=int(input())\r\na.sort()\r\nfor i in range(len(a)):\r\n for j in range(len(a)-1,-1,-1):\r\n z=a[:i]+a[j:j+1]+a[i:j]+a[j+1:]\r\n if int(\"\".join(z))<=b:\r\n a=z\r\n break\r\nprint(\"\".join(a))", "a=int(input())\r\nb=int(input())\r\nx=[0]10\r\nwhile a:\r\n x[a%10]+=1\r\n a=a//10\r\nans=0\r\nfor i in range(9,-1,-1):\r\n for j in range(x[i]):\r\n ans=ans10+i\r\nif ans<=b:\r\n print(ans)\r\nelse:\r\n ans=0\r\n for j in str(b):\r\n c=int(j)\r\n while c>=0 and not x[c]:\r\n c-=1\r\n if c<0:\r\n while True:\r\n x[ans%10]+=1\r\n d=ans%10\r\n ans=ans//10\r\n flag=0\r\n for b in range(d-1,-1,-1):\r\n\r\n if x[b]:\r\n ans=ans10+b\r\n x[b]-=1\r\n flag=1\r\n break\r\n if flag:\r\n break\r\n break\r\n \r\n \r\n else:\r\n x[c]-=1\r\n ans=ans10+c\r\n if c<int(j):\r\n break\r\n\r\n for j in range(9,-1,-1):\r\n for i in range(x[j]):\r\n ans=ans10+j\r\n print(ans)\r\n \r\n", "def main():\r\n import sys\r\n input = sys.stdin.readline\r\n\r\n a = int(input())\r\n b = int(input())\r\n a = list(str(a))\r\n a.sort()\r\n ans = []\r\n while a:\r\n for i in range(len(a) - 1, -1, -1):\r\n c = ans + [a[i]] + a[:i] + a[i+1:]\r\n if int(''.join(c)) <= b:\r\n ans.append(a[i])\r\n a.pop(i)\r\n break\r\n print(''.join(ans))\r\n\r\n\r\nmain()", "a = sorted(input())\nb = int(input())\na = a[::-1]\np = ''\nwhile a:\n\tfor i,z in enumerate(a):\n\t\tn=p+a[i]+''.join(sorted(a[:i]+a[i+1:]))\n\t\t#print(n,end=' ')\n\t\tif int(n)<=b:\n\t\t\tp += z\n\t\t\t#print(p)\n\t\t\ta.pop(i)\n\t\t\tbreak\nprint(p)", "a = sorted(input())\r\nb = int(input())\r\na = a[::-1]\r\np = \"\"\r\nwhile a:\r\n\tfor i, z in enumerate(a):\r\n\t\tn = p + a[i] + \"\".join(sorted(a[:i]+a[i+1:]))\r\n\t\tif int(n)<=b:\r\n\t\t\tp += z\r\n\t\t\ta.pop(i)\r\n\t\t\tbreak\r\nprint(p)", "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 a=rs();b=rs()\r\n n=len(a);m=len(b)\r\n d=[0]10\r\n ans=''\r\n for c in a: d[int(c)]+=1\r\n if n<m:\r\n for i in range(9,-1,-1): ans+=str(i)d[i]\r\n return ans\r\n for lst in range(m-1,-2,-1):\r\n tp=[d[i] for i in range(10)]\r\n for i in range(lst+1): tp[int(b[i])]-=1\r\n if min(tp)<0: continue\r\n if lst==m-1: return b\r\n for i in range(int(b[lst+1])-1,-1,-1):\r\n if tp[i]>0: ans=b[:lst+1]+str(i); tp[i]-=1;break\r\n if not ans: ans=''; continue\r\n for i in range(9,-1,-1): ans+=str(i)tp[i]\r\n break \r\n return ans\r\n\r\nprint(main())", "# URL: http://codeforces.com/contest/915/problem/C\r\n# Given integer a <= b, rearrange digits in maximally possible way s.t a <= b.\r\n# Approach:\r\n# 1. We will create a' moving from leftmost digit to rightmost digit.\r\n# 2. Consider the leftmost digit in a', a'[0], and the digit in the\r\n# equivalent position in b, b[0].\r\n# i. a'[0] must be <= b[0], otherwise a' > b.\r\n# ii. If a'[0] == b[0], we must check that a'[1:] <= b[1:].\r\n# iii. If a'[0] < b[0], a'[1:] is sorted in descending order.\r\n\r\nfrom typing import List\r\n\r\n\r\na: List[str] = sorted(list(input()), reverse=True)\r\nb: str = input()\r\nprefix: str = ''\r\n\r\n\r\ndef solve(a: List[str], b: str, prefix: str) -> str:\r\n if len(a) == 0:\r\n return prefix\r\n for i, elem in enumerate(a):\r\n candidate = prefix + elem + \"\".join(sorted(a[:i] + a[i + 1:]))\r\n if int(candidate) <= int(b):\r\n return solve(a[:i] + a[i + 1:], b, prefix + elem)\r\n raise Exception('Unhandled recursive case.')\r\n\r\n\r\nprint(solve(a, b, prefix))\r\n", "# import sys \n# sys.stdin = open('input.txt', 'r') \n# sys.stdout = open('output.txt', 'w')\n\na = [int(i) for i in list(input())]\nb = [int(i) for i in list(input())]\n\nif (len(a)<len(b)):\n\ta.sort(reverse=True)\n\tans = 0\n\tfor i in range(len(a)):\n\t\tans = ans10+a[i]\n\tprint(ans)\nelse:\n\t# ans = [0]len(a)\n\tans = 0\n\tn = len(a)\n\tcount = [0]10\n\tfor i in range(n):\n\t\tcount[a[i]] += 1\n\ti = 0\n\twhile (i<n):\n\t\tx = b[i]\n\t\tif (count[x]>0):\n\t\t\tans = ans10+x\n\t\t\tcount[x] -= 1\n\t\t\ti += 1\n\t\telse:\n\t\t\tbreak\n\tif (i==n):\n\t\tprint(ans)\n\t\texit(0)\n\tx = b[i]\n\tflag = False\n\tfor j in range(x-1,-1,-1):\n\t\tif (count[j]>0):\n\t\t\tans = ans10+j\n\t\t\tcount[j] -= 1\n\t\t\tflag = True\n\t\t\tbreak\n\tif (flag) :\n\t\tfor j in range(9,-1,-1):\n\t\t\twhile (count[j]>0):\n\t\t\t\tans = ans10+j\n\t\t\t\tcount[j] -= 1\n\telse:\n\t\twhile (not flag):\n\t\t\tt = ans%10\n\t\t\tans = ans//10\n\t\t\tcount[t] += 1\n\t\t\tfor i in range(t-1,-1,-1):\n\t\t\t\tif (count[i]>0):\n\t\t\t\t\tcount[i] -= 1\n\t\t\t\t\tflag = True\n\t\t\t\t\tans = ans10 + i\n\t\t\t\t\tbreak\n\t\tfor j in range(9,-1,-1):\n\t\t\twhile (count[j]>0):\n\t\t\t\tans = ans10+j\n\t\t\t\tcount[j] -= 1\n\tprint(ans)\n", "a = input()\nb = input()\nlist_a = list(a)\nlist_a.sort()\nmax_a = int(''.join(list_a))\nfor i in range(len(a)):\n for j in range(i+1, len(a)):\n list_a[i], list_a[j] = list_a[j], list_a[i]\n temp_a = int(''.join(list_a))\n if int(b) < temp_a or temp_a <= max_a:\n list_a[i], list_a[j] = list_a[j], list_a[i]\n else:\n max_a = temp_a\nprint(max_a)", "if __name__ == '__main__':\r\n a = list(input())\r\n b = list(input())\r\n la = len(a)\r\n lb = len(b)\r\n a.sort()\r\n if la < lb:\r\n a.reverse()\r\n print(int(''.join(a)))\r\n else:\r\n for i in range(la):\r\n for j in range(i, la):\r\n a[i], a[j] = a[j], a[i]\r\n if a > b:\r\n a[j], a[i] = a[i], a[j]\r\n print(int(''.join(a)))\r\n", "a = list(input())\r\nb = list(input())\r\nn = len(a)\r\na.sort()\r\n\r\ndef listtostring(string):\r\n return ''.join([str(ele) for ele in string])\r\n\r\n\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n t = a.copy()\r\n t[i],t[j] = t[j],t[i]\r\n if((int(listtostring(t)) >= int(listtostring(a))) and (int(listtostring(t))<= int(listtostring(b)))):\r\n # print(\"BEFORE\",a,a[i],a[j],i,j)\r\n a[i],a[j] = a[j],a[i]\r\n # print(\"AFTER\",a,a[i],a[j],i,j)\r\n \r\nprint(listtostring(a))", "from collections import Counter\r\n\r\n\r\ndef mx(f):\r\n res = []\r\n for k in sorted(f.keys(), reverse=True):\r\n for _ in range(f[k]):\r\n res.append(k)\r\n return res\r\n\r\n\r\ndef solve(n, a, b):\r\n res = None\r\n for k in range(n + 1):\r\n aa = Counter(a)\r\n cur = []\r\n for i in range(k):\r\n if aa[b[i]] == 0:\r\n return res\r\n cur.append(b[i])\r\n aa[b[i]] -= 1\r\n if k < n:\r\n for e in range(b[k] - 1, -1, -1):\r\n if aa[e] > 0:\r\n cur.append(e)\r\n aa[e] -= 1\r\n cur.extend(mx(aa))\r\n break\r\n if len(cur) < n:\r\n continue\r\n res = cur\r\n return res\r\n\r\n\r\na = Counter(map(int, input()))\r\nb = list(map(int, input()))\r\nif sum(a.values()) < len(b):\r\n res = mx(a)\r\nelse:\r\n res = solve(len(b), a, b)\r\nprint(''.join(map(str, res)))", "a = input()\r\nb = input()\r\n\r\nif len(a) < len(b):\r\n a = sorted(a)[::-1]\r\n print(''.join(a))\r\n exit(0)\r\n\r\n\r\ndef check(res, j, a):\r\n added = False\r\n tmp = \"\"\r\n for i in a:\r\n if i == j and not added:\r\n added = True\r\n else:\r\n tmp += i\r\n tmp = res + j + tmp[::-1]\r\n return tmp <= b\r\n\r\n\r\n# len(a) == len(b)\r\nres = \"\"\r\nn = len(a)\r\na = sorted(list(a))[::-1]\r\nfor i in range(n):\r\n for j in a:\r\n if check(res, j, a):\r\n res += j\r\n a.remove(j)\r\n break\r\nprint(res)\r\n", "\r\na = int(input())\r\nb = int(input())\r\nl = []\r\n\r\nwhile a != 0:\r\n d = a % 10\r\n a //= 10\r\n l.append(d)\r\n\r\ndef f(a, b):\r\n s = len(l)\r\n if s == 0:\r\n return a\r\n for i in range(len(l) - 1, -1, -1):\r\n # 0 <= i <= len(l)-1\r\n min_suf = 0\r\n for j in range(len(l)):\r\n if j == i:\r\n continue\r\n min_suf = 10\r\n min_suf += l[j]\r\n if a(10*s) + l[i](10*(s-1)) + min_suf <= b:\r\n dig = l.pop(i)\r\n #print(dig)\r\n return f(a10 + dig, b)\r\n\r\n#\r\nl.sort()\r\nprint(f(0, b))", "def main():\r\n\ts = list(input())\r\n\tt = list(input())\r\n\tif len(s) < len(t):\r\n\t\ts.sort(reverse=True)\r\n\t\tprint(''.join(s))\r\n\telse:\r\n\t\tcount = [0] * 10\r\n\t\tfor elm in s:\r\n\t\t\tcount[ord(elm) - ord('0')] += 1\r\n\t\tans = []\r\n\t\tless = False\r\n\t\tfor i in range(len(s)):\r\n\t\t\tfor j in range(9, -1, -1):\r\n\t\t\t\tif not less:\r\n\t\t\t\t\tif j <= ord(t[i]) - ord('0') and count[j] > 0:\r\n\t\t\t\t\t\tif j < ord(t[i]) - ord('0'):\r\n\t\t\t\t\t\t\tans.append(chr(j + ord('0')))\r\n\t\t\t\t\t\t\tcount[j] -= 1\r\n\t\t\t\t\t\t\tless = True\r\n\t\t\t\t\t\t\tbreak\r\n\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\tcurr_num = 0\r\n\t\t\t\t\t\t\tfor k in range(10):\r\n\t\t\t\t\t\t\t\tif j == k:\r\n\t\t\t\t\t\t\t\t\tfor tmp in range(count[k] - 1):\r\n\t\t\t\t\t\t\t\t\t\tcurr_num = curr_num * 10 + k\r\n\t\t\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\t\t\tfor tmp in range(count[k]):\r\n\t\t\t\t\t\t\t\t\t\tcurr_num = curr_num * 10 + k\r\n\t\t\t\t\t\t\trest_num = 0\r\n\t\t\t\t\t\t\tfor k in range(i + 1, len(s)):\r\n\t\t\t\t\t\t\t\trest_num = rest_num * 10 + (ord(t[k]) - ord('0'))\r\n\t\t\t\t\t\t\tif rest_num >= curr_num:\r\n\t\t\t\t\t\t\t\tans.append(chr(j + ord('0')))\r\n\t\t\t\t\t\t\t\tcount[j] -= 1\r\n\t\t\t\t\t\t\t\tbreak\r\n\t\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\t\tcontinue\r\n\t\t\t\telse:\r\n\t\t\t\t\tif count[j] > 0:\r\n\t\t\t\t\t\tans.append(chr(j + ord('0')))\r\n\t\t\t\t\t\tcount[j] -= 1\r\n\t\t\t\t\t\tbreak\r\n\t\tprint(''.join(ans))\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "a = list(input())\r\nb = int(input())\r\na = sorted(a, reverse=True)\r\nans = ''\r\nwhile len(a) > 0:\r\n for i in range(len(a)):\r\n tmp = ans + a[i] + ''.join(sorted(a[:i] + a[i + 1:]))\r\n if int(tmp) <= b:\r\n ans += a[i]\r\n a = a[:i] + a[i + 1:]\r\n break\r\nprint(ans)\r\n", "def possible(a,index,a1,b):\r\n rem = []\r\n for i in range(len(a)):\r\n if i != index:\r\n rem.append(a[i])\r\n\r\n a3 = a1[:]\r\n rem.sort()\r\n a3.append(a[index])\r\n a3.extend(rem)\r\n a2 = ''\r\n for i in a3:\r\n a2 += str(i)\r\n\r\n if int(a2) <= b:\r\n return True\r\n\r\n return False\r\n\r\ndef main():\r\n a = list(map(int,input()))\r\n b = int(input())\r\n\r\n a.sort(reverse = True)\r\n a1 = []\r\n for pos in range(len(a)):\r\n for i in range(len(a)):\r\n if possible(a,i,a1,b):\r\n a1.append(a[i])\r\n a.pop(i)\r\n break\r\n \r\n for i in a1:\r\n print(i,end = '')\r\n\r\nmain()\r\n" ]	{"inputs": ["123\n222", "3921\n10000", "4940\n5000", "23923472834\n23589234723", "102391019\n491010301", "123456789123456789\n276193619183618162", "1000000000000000000\n1000000000000000000", "1\n1000000000000000000", "999999999999999999\n1000000000000000000", "2475345634895\n3455834583479", "15778899\n98715689", "4555\n5454", "122112\n221112", "199999999999991\n191000000000000", "13\n31", "212\n211", "222234\n322223", "123456789\n987654311", "20123\n21022", "10101\n11000", "592\n924", "5654456\n5634565", "655432\n421631", "200\n200", "123456789987654321\n121111111111111111", "12345\n21344", "120\n200", "123\n212", "2184645\n5213118", "9912346\n9912345", "5003\n5000", "12345\n31234", "5001\n5000", "53436\n53425", "9329\n3268", "1234567890\n9000000001", "321\n212", "109823464\n901234467", "6543\n6542", "555441\n555100", "472389479\n327489423", "45645643756464352\n53465475637456247", "254\n599", "5232222345652321\n5000000000000000", "201\n200", "14362799391220361\n45160821596433661", "3453\n5304", "989\n998", "5200000000234\n5200000000311", "5555132\n1325442", "123\n211", "65689\n66123", "123451234567890\n123456789012345", "22115\n22015", "123\n311", "12222\n21111", "765\n567", "9087645\n9087640", "1111111122222333\n2220000000000000", "7901\n7108", "215489\n215488", "102\n200", "19260817\n20011213", "12345\n53200", "1040003001\n1040003000", "295\n924", "20000000000000001\n20000000000000000", "99988877\n99887766", "12\n12", "199999999999999999\n900000000000000000", "1234\n4310", "100011\n100100", "328899\n328811", "646722972346\n397619201220", "1203\n1200", "1\n2", "1112\n2110", "4545\n5540", "3053\n5004", "3503\n5004", "351731653766064847\n501550303749042658", "10123456789013451\n26666666666666666", "1110111\n1100000", "30478\n32265", "456546546549874615\n441554543131214545", "214\n213", "415335582799619283\n133117803602859310", "787\n887", "3333222288889999\n3333222288881111", "495779862481416791\n836241745208800994", "139\n193", "9568\n6500", "3208899\n3228811", "27778\n28710", "62345\n46415", "405739873179209\n596793907108871", "365\n690", "8388731334391\n4710766672578", "1230\n1200", "1025\n5000", "4207799\n4027711", "4444222277779999\n4444222277771111", "7430\n3047", "649675735\n540577056", "26\n82", "241285\n207420", "3\n3", "12\n21", "481287\n826607", "40572351\n59676984", "268135787269\n561193454469", "4\n9", "5\n6", "60579839\n33370073", "49939\n39200", "2224\n4220", "427799\n427711", "49\n90", "93875\n82210", "78831\n7319682", "937177\n7143444", "499380628\n391990337", "2090909\n2900000", "112233445566778890\n987654321987654320", "48257086\n80903384", "112233445566778890\n900654321987654320", "112233445566778890\n123456789123456788", "5207799\n5027711", "200000000000000001\n200000000000000000", "597402457\n797455420", "90\n94", "86888\n88683", "419155888\n588151913", "408919130\n191830070", "524975\n554924", "53029\n30524", "5549\n5542", "6\n9", "87\n810", "920491855\n281495062", "6691\n6910", "533\n335", "999999999999999998\n999999999999999997", "21111111111111111\n21111111111111110", "2\n12", "76544\n45744", "2000000000000001\n2000000000000000", "740867\n467701", "2\n6", "103\n130", "2423712\n8466235", "84\n48", "1210\n12113", "2430\n20786", "100\n999", "19325\n21903", "1969\n23251"], "outputs": ["213", "9321", "4940", "23498743322", "399211100", "276193618987554432", "1000000000000000000", "1", "999999999999999999", "3455834579642", "98598771", "4555", "221112", "119999999999999", "31", "122", "243222", "987654231", "20321", "10110", "592", "5566544", "365542", "200", "119988776655443322", "15432", "120", "132", "5186442", "9694321", "3500", "25431", "1500", "53364", "2993", "8976543210", "132", "896443210", "6534", "554541", "327487994", "53465475636654442", "542", "4655533322222221", "120", "43999766332221110", "4533", "998", "5200000000243", "1255553", "132", "65986", "123456789012345", "21521", "231", "12222", "567", "9087564", "2213332221111111", "7091", "214985", "120", "19876210", "53142", "1040001300", "592", "12000000000000000", "99879887", "12", "199999999999999999", "4231", "100011", "299883", "397476664222", "1032", "1", "1211", "5454", "3530", "3530", "501548777666643331", "26598754433111100", "1011111", "30874", "441554498766665554", "142", "132999887655543321", "877", "3332999988883222", "829998777665444111", "193", "5986", "3209988", "27877", "46352", "594998777332100", "653", "4398887333311", "1032", "2510", "2997740", "4442999977774222", "3047", "539776654", "62", "185422", "3", "21", "824871", "57543210", "539887766221", "4", "5", "30998765", "34999", "2422", "299774", "49", "79853", "88731", "977731", "390988642", "2099900", "987654321876543210", "80876542", "898776655443322110", "123456789123456780", "2997750", "120000000000000000", "797455420", "90", "86888", "588151894", "191830049", "554792", "30295", "5495", "6", "87", "281495059", "6691", "335", "999999999999999989", "12111111111111111", "2", "45674", "1200000000000000", "467087", "2", "130", "7432221", "48", "2110", "4320", "100", "21593", "9961"]}	UNKNOWN	PYTHON3	CODEFORCES	53
8b3fa8eccfdabf8716ba8e9019da55da	none	You are given an array of positive integers a1,<=a2,<=...,<=an<=×<=T of length n<=×<=T. We know that for any i<=><=n it is true that ai<==<=ai<=-<=n. Find the length of the longest non-decreasing sequence of the given array. The first line contains two space-separated integers: n, T (1<=≤<=n<=≤<=100, 1<=≤<=T<=≤<=107). The second line contains n space-separated integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=300). Print a single number — the length of a sought sequence. Sample Input 4 3 3 1 4 2 Sample Output 5	[ "def solve():\r\n n,T = map(int,input().split())\r\n array = list(map(int,input().split()))\r\n ElementsTillN = {}\r\n for x in range(n):\r\n ElementsTillN[x]={array[x]:1}\r\n for x in range(1,n):\r\n for y in range(x):\r\n if array[y]<=array[x]:\r\n for value,num in ElementsTillN[y].items():\r\n if value in ElementsTillN[x]:\r\n ElementsTillN[x][value]=max(num+1,ElementsTillN[x][value])\r\n else:\r\n ElementsTillN[x][value]=num+1\r\n newElementsTillN = {}\r\n for x in range(n):\r\n valueAtIndex = array[x]\r\n if valueAtIndex not in newElementsTillN:\r\n newElementsTillN[valueAtIndex]={}\r\n for value,num in ElementsTillN[x].items():\r\n if value in newElementsTillN[valueAtIndex]:\r\n newElementsTillN[valueAtIndex][value]=max(num,newElementsTillN[valueAtIndex][value])\r\n else:\r\n newElementsTillN[valueAtIndex][value]=num \r\n # print (newElementsTillN)\r\n # print (\"##################\")\r\n valueSoFar = [0]301\r\n changes = [0]110\r\n for x in range(min(110,T)):\r\n currentSoFar = [0]301\r\n for end in newElementsTillN.keys():\r\n for start in array:\r\n if start<=end:\r\n for newStart,value in newElementsTillN[end].items():\r\n if newStart>=start:\r\n currentSoFar[end]= max(currentSoFar[end],value+valueSoFar[start])\r\n changes[x] = max(currentSoFar)-max(valueSoFar)\r\n # print (changes[x])\r\n valueSoFar = currentSoFar\r\n # for index in range(301):\r\n # if valueSoFar[index]:\r\n # print (index,valueSoFar[index])\r\n # print (\"#####################\")\r\n T-=110\r\n # print (changes)\r\n if T>0:\r\n print (max(valueSoFar)+ Tchanges[-1])\r\n else:\r\n print (max(valueSoFar))\r\nsolve()", "f = lambda: map(int, input().split())\r\nn, m = f()\r\nt = list(f())\r\ns = [0] * 301\r\nd = s[:]\r\nfor i in t: d[i] += 1\r\nfor i in t * min(m, 2 * n): s[i] = max(s[:i + 1]) + 1\r\nprint(max(s) + max((m - n * 2) * max(d), 0))", "f = lambda: map(int, input().split())\r\nn, m = f()\r\nt = list(f())\r\nd = {i: j for j, i in enumerate(sorted(set(t)))}\r\nt = [d[i] for i in t]\r\nk = len(d)\r\na = [0] * k\r\nif m < 2 * k:\r\n for j in t * m:\r\n a[j] += 1\r\n q = a[j]\r\n j += 1\r\n while j < k and a[j] < q:\r\n a[j] += 1\r\n j += 1\r\n print(a[-1])\r\n exit()\r\na = [0] * k\r\nfor j in t * k:\r\n a[j] += 1\r\n q = a[j]\r\n j += 1\r\n while j < k and a[j] < q:\r\n a[j] += 1\r\n j += 1\r\nb = [0] * k\r\nt.reverse()\r\nfor j in t * k:\r\n b[j] += 1\r\n q = b[j]\r\n j -= 1\r\n while j > -1 and b[j] < q:\r\n b[j] += 1\r\n j -= 1\r\nprint(max(a[j] + (m - 2 * k) * t.count(j) + b[j] for j in range(k)))", "import sys\nfrom collections import Counter\n\n#sys.stdin = open(\"input.txt\")\n#sys.stdout = open(\"output.txt\", \"w\")\n\nn, t = [int(i) for i in input().split()]\nlst = [int(i) for i in input().split()]\ncnt = Counter(lst)\nmostlst = cnt.most_common()\nfreq = mostlst[0][1]\n\n#print(\"freq = \", freq, sep='')\n\ncurlist = lst\n\ncurt = 1\nd = [0 for i in range(n)]\nprevmax = 0\ncurmax = 0\nans = 0\nwhile curt <= t:\n\td += [1 for i in range(n)]\n\t#print(d)\n\tind = curt * n\n\t#print(\"from =\", ind - n)\n\tfor i in range(n):\n\t\tfor j in range(-n, i):\n\t\t\tif lst[j] <= lst[i]:\n\t\t\t\td[ind + i] = max(d[ind + i], d[ind + j] + 1)\n\tcurmax = max(d[ind:ind + n])\n\tif curmax - prevmax == freq:\n\t\tans = curmax + freq * (t - curt)\n\t\tbreak\n\tcurt += 1\n\tprevmax = curmax\nelse:\n\tans = curmax\n\n#print(d)\n#print(curt)\nprint(ans)", "def cronch(A):\n D = {v:i for i, v in enumerate(sorted(set(A)))}\n return len(D), [D[a] for a in A]\n\n\ndef lnds(n, t, A):\n m, A = cronch(A)\n S = [[0 for _ in range(m)] for _ in range(m)]\n for j in A:\n for i in range(j+1):\n S[i][j] += 1\n v = S[i][j]\n for k in range(j+1, m):\n if S[i][k] >= v:\n break\n S[i][k] = v\n\n # for r in S:\n # log(r)\n\n # log()\n\n if t <= 2 * m:\n V = [0 for _ in range(m)]\n for _ in range(t):\n V2 = [0 for _ in range(m)]\n for i in range(m):\n for j in range(i, m):\n V2[j] = max(V2[j], V[i] + S[i][j])\n V = V2\n # log(V)\n return max(V)\n else:\n V = [0 for _ in range(m)]\n W = [0 for _ in range(m)]\n for _ in range(m):\n V2 = [0 for _ in range(m)]\n W2 = [0 for _ in range(m)]\n for i in range(m):\n for j in range(i, m):\n V2[j] = max(V2[j], V[i] + S[i][j])\n W2[i] = max(W2[i], S[i][j] + W[j])\n V = V2\n W = W2\n # log(V, W)\n\n p = t - (2m)\n return max(V[k] + S[k][k]p + W[k] for k in range(m))\n\n\ndef main():\n n, t = map(int, input().split())\n A = list(map(int, input().split()))\n assert len(A) == n\n print(lnds(n, t, A))\n\n##########\n\nimport sys\nimport time\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\ndef log(args, kwargs):\n print(args, *kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n t0 = time.time()\n main()\n t1 = time.time()\n if r.getvalue() == o:\n log(f\"OK ({int((t1-t0)1000000)/1000:0.3f} ms)\\n\")\n else:\n log(f\"Expected:\\n{o}\"\n f\"Got ({int((t1-t0)1000000)/1000:0.3f} ms):\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n4 3\n3 1 4 2\n\"\"\", \"\"\"\\\n5\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n" ]	{"inputs": ["4 3\n3 1 4 2", "1 1000\n42", "31 3767\n16 192 152 78 224 202 186 52 118 19 13 38 199 196 35 295 100 64 205 37 166 124 169 214 66 243 134 192 253 270 92", "15 12226\n18 125 213 221 124 147 154 182 134 184 51 49 267 88 251", "81 10683\n3 52 265 294 213 242 185 151 27 165 128 237 124 14 43 147 104 162 124 103 233 156 288 57 289 195 129 77 97 138 153 289 203 126 34 5 97 35 224 120 200 203 222 94 171 294 293 108 145 193 227 206 34 295 1 233 258 7 246 34 60 232 58 169 77 150 272 279 171 228 168 84 114 229 149 97 66 246 212 236 151", "29 7954\n1 257 8 47 4 26 49 228 120 53 138 101 101 35 293 232 299 195 219 45 195 174 96 157 168 138 288 114 291", "39 1057\n1 120 247 206 260 117 152 24 162 266 202 152 278 199 63 188 271 62 62 177 213 77 229 197 263 178 211 102 255 257 163 134 14 66 11 113 216 288 225", "2 766\n147 282", "2 13101\n180 199", "29 1918\n8 81 38 146 195 199 31 153 267 139 48 202 38 259 139 71 253 3 289 44 210 81 78 259 236 189 219 102 133", "46 13793\n1 239 20 83 33 183 122 208 46 141 11 264 196 266 104 130 116 117 31 213 235 207 219 206 206 46 89 112 260 191 245 234 87 255 186 4 251 177 130 59 81 54 227 116 105 284", "2 8698\n71 225", "68 2450\n107 297 185 215 224 128 8 65 101 202 19 145 255 233 138 223 144 132 32 122 153 85 31 160 219 125 167 220 138 255 219 119 165 249 47 124 20 37 160 24 156 154 163 226 270 88 74 192 204 300 194 184 235 93 267 160 12 216 91 191 267 241 152 9 111 76 201 295", "100 10000000\n98 99 96 97 94 95 92 93 90 91 88 89 86 87 84 85 82 83 80 81 78 79 76 77 74 75 72 73 70 71 68 69 66 67 64 65 62 63 60 61 58 59 56 57 54 55 52 53 50 51 48 49 46 47 44 45 42 43 40 41 38 39 36 37 34 35 32 33 30 31 28 29 26 27 24 25 22 23 20 21 18 19 16 17 14 15 12 13 10 11 8 9 6 7 4 5 2 3 1 100", "99 10000000\n97 98 95 96 93 94 91 92 89 90 87 88 85 86 83 84 81 82 79 80 77 78 75 76 73 74 71 72 69 70 67 68 65 66 63 64 61 62 59 60 57 58 55 56 53 54 51 52 49 50 47 48 45 46 43 44 41 42 39 40 37 38 35 36 33 34 31 32 29 30 27 28 25 26 23 24 21 22 19 20 17 18 15 16 13 14 11 12 9 10 7 8 5 6 3 4 1 2 99", "99 10000000\n96 97 98 93 94 95 90 91 92 87 88 89 84 85 86 81 82 83 78 79 80 75 76 77 72 73 74 69 70 71 66 67 68 63 64 65 60 61 62 57 58 59 54 55 56 51 52 53 48 49 50 45 46 47 42 43 44 39 40 41 36 37 38 33 34 35 30 31 32 27 28 29 24 25 26 21 22 23 18 19 20 15 16 17 12 13 14 9 10 11 6 7 8 3 4 5 2 1 99", "100 10000000\n97 98 99 94 95 96 91 92 93 88 89 90 85 86 87 82 83 84 79 80 81 76 77 78 73 74 75 70 71 72 67 68 69 64 65 66 61 62 63 58 59 60 55 56 57 52 53 54 49 50 51 46 47 48 43 44 45 40 41 42 37 38 39 34 35 36 31 32 33 28 29 30 25 26 27 22 23 24 19 20 21 16 17 18 13 14 15 10 11 12 7 8 9 4 5 6 1 2 3 100", "98 10000000\n95 96 97 92 93 94 89 90 91 86 87 88 83 84 85 80 81 82 77 78 79 74 75 76 71 72 73 68 69 70 65 66 67 62 63 64 59 60 61 56 57 58 53 54 55 50 51 52 47 48 49 44 45 46 41 42 43 38 39 40 35 36 37 32 33 34 29 30 31 26 27 28 23 24 25 20 21 22 17 18 19 14 15 16 11 12 13 8 9 10 5 6 7 2 3 4 97 98", "95 10000000\n92 93 94 89 90 91 86 87 88 83 84 85 80 81 82 77 78 79 74 75 76 71 72 73 68 69 70 65 66 67 62 63 64 59 60 61 56 57 58 53 54 55 50 51 52 47 48 49 44 45 46 41 42 43 38 39 40 35 36 37 32 33 34 29 30 31 26 27 28 23 24 25 20 21 22 17 18 19 14 15 16 11 12 13 8 9 10 5 6 7 2 3 4 94 95", "98 10000000\n195 196 197 192 193 194 189 190 191 186 187 188 183 184 185 180 181 182 177 178 179 174 175 176 171 172 173 168 169 170 165 166 167 162 163 164 159 160 161 156 157 158 153 154 155 150 151 152 147 148 149 144 145 146 141 142 143 138 139 140 135 136 137 132 133 134 129 130 131 126 127 128 123 124 125 120 121 122 117 118 119 114 115 116 111 112 113 108 109 110 105 106 107 102 103 104 1 2", "95 10000000\n192 193 194 189 190 191 186 187 188 183 184 185 180 181 182 177 178 179 174 175 176 171 172 173 168 169 170 165 166 167 162 163 164 159 160 161 156 157 158 153 154 155 150 151 152 147 148 149 144 145 146 141 142 143 138 139 140 135 136 137 132 133 134 129 130 131 126 127 128 123 124 125 120 121 122 117 118 119 114 115 116 111 112 113 108 109 110 105 106 107 102 103 104 1 2", "98 10000000\n1 2 195 196 197 192 193 194 189 190 191 186 187 188 183 184 185 180 181 182 177 178 179 174 175 176 171 172 173 168 169 170 165 166 167 162 163 164 159 160 161 156 157 158 153 154 155 150 151 152 147 148 149 144 145 146 141 142 143 138 139 140 135 136 137 132 133 134 129 130 131 126 127 128 123 124 125 120 121 122 117 118 119 114 115 116 111 112 113 108 109 110 105 106 107 102 103 104", "98 10000000\n1 2 5 4 3 8 7 6 11 10 9 14 13 12 17 16 15 20 19 18 23 22 21 26 25 24 29 28 27 32 31 30 35 34 33 38 37 36 41 40 39 44 43 42 47 46 45 50 49 48 53 52 51 56 55 54 59 58 57 62 61 60 65 64 63 68 67 66 71 70 69 74 73 72 77 76 75 80 79 78 83 82 81 86 85 84 89 88 87 92 91 90 95 94 93 98 97 96", "98 10000000\n1 1 5 4 3 8 7 6 11 10 9 14 13 12 17 16 15 20 19 18 23 22 21 26 25 24 29 28 27 32 31 30 35 34 33 38 37 36 41 40 39 44 43 42 47 46 45 50 49 48 53 52 51 56 55 54 59 58 57 62 61 60 65 64 63 68 67 66 71 70 69 74 73 72 77 76 75 80 79 78 83 82 81 86 85 84 89 88 87 92 91 90 95 94 93 98 97 96", "98 10000000\n1 2 95 96 97 92 93 94 89 90 91 86 87 88 83 84 85 80 81 82 77 78 79 74 75 76 71 72 73 68 69 70 65 66 67 62 63 64 59 60 61 56 57 58 53 54 55 50 51 52 47 48 49 44 45 46 41 42 43 38 39 40 35 36 37 32 33 34 29 30 31 26 27 28 23 24 25 20 21 22 17 18 19 14 15 16 11 12 13 8 9 10 5 6 7 2 3 4", "99 10000000\n1 2 3 95 96 97 92 93 94 89 90 91 86 87 88 83 84 85 80 81 82 77 78 79 74 75 76 71 72 73 68 69 70 65 66 67 62 63 64 59 60 61 56 57 58 53 54 55 50 51 52 47 48 49 44 45 46 41 42 43 38 39 40 35 36 37 32 33 34 29 30 31 26 27 28 23 24 25 20 21 22 17 18 19 14 15 16 11 12 13 8 9 10 5 6 7 2 3 4", "100 10000000\n1 2 2 1 2 2 1 1 2 2 1 2 1 1 1 1 1 2 2 2 1 2 1 2 1 2 1 2 1 1 2 1 1 1 2 2 2 1 1 2 2 1 1 2 2 2 2 2 2 1 1 2 2 1 1 2 1 1 2 1 2 1 1 2 1 2 2 2 1 1 2 2 1 2 1 1 2 2 1 1 1 2 1 2 1 1 1 2 1 1 1 1 1 1 1 1 2 1 1 1", "100 10000000\n2 4 2 5 2 1 1 3 2 4 3 5 3 4 2 4 2 4 1 2 3 3 1 1 3 3 1 3 5 1 2 1 5 2 3 4 5 2 1 2 1 3 4 4 4 3 5 5 3 1 5 2 1 4 4 3 2 3 2 3 2 4 2 1 3 3 3 2 3 5 1 5 4 3 1 4 5 3 2 4 5 4 1 3 4 1 1 3 4 2 2 5 4 2 2 3 3 2 3 1", "100 10000000\n31 150 132 17 273 18 292 260 226 217 165 68 36 176 89 75 227 246 137 151 87 215 267 242 21 156 27 27 202 73 218 290 57 2 85 159 96 39 191 268 67 64 55 266 29 209 215 85 149 267 161 153 118 293 104 197 91 252 275 56 288 76 82 239 215 105 283 88 76 294 138 166 9 273 14 119 67 101 250 13 63 215 80 5 221 234 258 195 129 67 152 56 277 129 111 98 213 22 209 299", "100 10000000\n285 219 288 277 266 249 297 286 290 266 210 201 275 280 200 272 297 253 246 292 272 285 226 250 297 270 214 251 263 285 237 292 245 225 247 221 263 250 253 280 235 288 278 297 283 294 208 279 227 290 246 208 274 238 282 240 214 277 239 282 255 278 214 292 277 267 290 257 239 234 252 246 217 274 254 249 229 275 210 297 254 215 222 228 262 287 290 292 277 227 292 282 248 278 207 249 236 240 252 216", "100 10000000\n300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300", "99 10000000\n300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300", "99 10000000\n299 299 300 300 299 299 300 299 299 299 299 299 299 299 299 300 300 300 299 300 300 300 299 299 299 299 299 299 300 299 299 300 299 299 300 300 300 299 300 300 299 299 300 299 300 300 299 300 299 300 299 300 300 299 299 299 299 299 299 300 299 299 300 300 300 299 300 299 300 300 299 299 299 299 299 299 299 299 300 299 300 300 299 300 300 299 299 300 300 299 300 300 299 300 299 299 300 299 299", "1 1\n5", "1 10000000\n1", "2 1\n1 2", "2 2\n1 2", "2 1000\n1 2", "100 100\n99 100 97 98 95 96 93 94 91 92 89 90 87 88 85 86 83 84 81 82 79 80 77 78 75 76 73 74 71 72 69 70 67 68 65 66 63 64 61 62 59 60 57 58 55 56 53 54 51 52 49 50 47 48 45 46 43 44 41 42 39 40 37 38 35 36 33 34 31 32 29 30 27 28 25 26 23 24 21 22 19 20 17 18 15 16 13 14 11 12 9 10 7 8 5 6 3 4 1 2", "100 82\n151 81 114 37 17 178 92 164 215 108 286 89 108 87 77 166 110 215 212 300 125 92 247 221 78 120 163 113 249 141 36 241 179 116 187 287 69 103 76 80 160 200 249 170 159 72 8 138 171 45 97 271 114 176 54 181 4 259 246 39 29 292 203 49 122 253 99 259 252 74 231 92 43 142 23 144 109 282 47 207 140 212 9 3 255 137 285 146 22 84 52 98 41 21 177 63 217 62 291 64", "99 105\n16 118 246 3 44 149 156 290 44 267 221 123 57 175 233 24 23 120 298 228 119 62 23 183 169 294 195 115 131 157 223 298 77 106 283 117 255 41 17 298 22 176 164 187 214 101 10 181 117 70 271 291 59 156 44 204 140 205 253 176 270 43 188 287 40 250 271 100 244 297 133 228 98 218 290 69 171 66 195 283 63 154 191 66 238 104 32 122 79 190 55 110 276 2 188 26 44 276 230", "99 84\n62 4 145 285 106 132 30 96 211 28 144 190 95 184 227 177 128 60 143 19 19 81 38 83 108 172 241 228 48 39 171 282 233 294 74 271 178 87 24 180 212 190 223 153 230 198 261 232 150 18 190 91 265 61 280 13 207 70 182 117 270 77 242 163 138 212 165 273 247 23 52 88 243 85 293 12 135 284 162 91 174 109 42 19 218 289 9 59 9 117 61 122 78 287 144 176 281 123 243", "99 116\n102 257 115 247 279 111 118 255 198 168 183 184 32 3 36 204 178 186 88 67 205 91 21 40 116 93 2 148 226 65 37 69 69 7 82 205 152 25 34 272 26 283 78 142 17 110 101 250 120 128 145 276 182 57 19 104 228 221 94 220 279 216 220 294 3 289 185 272 73 180 246 107 246 260 219 268 218 41 166 50 230 143 166 158 194 153 256 209 28 255 77 33 143 296 38 81 133 57 263", "99 125\n85 108 102 3 173 193 27 38 288 272 14 270 98 42 34 206 275 54 20 164 207 255 3 196 183 3 61 37 98 223 208 231 144 76 114 19 138 156 157 198 124 39 120 283 34 139 240 240 247 132 211 81 225 12 101 108 63 20 30 158 266 201 101 101 113 157 132 108 41 215 54 27 154 102 175 276 103 35 52 130 10 266 229 202 85 210 116 149 214 14 121 263 217 152 240 275 113 253 53", "99 9\n218 254 64 32 130 52 242 40 29 188 196 300 258 165 110 151 265 142 295 166 141 260 158 218 184 251 180 16 177 125 192 279 201 189 170 37 7 150 117 79 97 13 69 156 254 287 17 214 95 300 150 197 133 161 46 26 82 119 174 6 252 42 264 136 273 127 42 274 113 278 165 173 231 209 159 56 248 39 46 41 222 278 114 84 150 13 63 106 179 279 44 15 13 74 50 168 38 181 127", "100 200\n99 100 97 98 95 96 93 94 91 92 89 90 87 88 85 86 83 84 81 82 79 80 77 78 75 76 73 74 71 72 69 70 67 68 65 66 63 64 61 62 59 60 57 58 55 56 53 54 51 52 49 50 47 48 45 46 43 44 41 42 39 40 37 38 35 36 33 34 31 32 29 30 27 28 25 26 23 24 21 22 19 20 17 18 15 16 13 14 11 12 9 10 7 8 5 6 3 4 1 2", "100 201\n99 100 97 98 95 96 93 94 91 92 89 90 87 88 85 86 83 84 81 82 79 80 77 78 75 76 73 74 71 72 69 70 67 68 65 66 63 64 61 62 59 60 57 58 55 56 53 54 51 52 49 50 47 48 45 46 43 44 41 42 39 40 37 38 35 36 33 34 31 32 29 30 27 28 25 26 23 24 21 22 19 20 17 18 15 16 13 14 11 12 9 10 7 8 5 6 3 4 1 2", "100 199\n99 100 97 98 95 96 93 94 91 92 89 90 87 88 85 86 83 84 81 82 79 80 77 78 75 76 73 74 71 72 69 70 67 68 65 66 63 64 61 62 59 60 57 58 55 56 53 54 51 52 49 50 47 48 45 46 43 44 41 42 39 40 37 38 35 36 33 34 31 32 29 30 27 28 25 26 23 24 21 22 19 20 17 18 15 16 13 14 11 12 9 10 7 8 5 6 3 4 1 2"], "outputs": ["5", "1000", "7546", "12234", "32070", "15919", "2128", "767", "13102", "3845", "27600", "8699", "7366", "10000050", "10000050", "10000065", "10000067", "20000034", "20000033", "10000065", "10000063", "10000066", "10000033", "20000032", "20000034", "20000034", "560000000", "260000004", "40000023", "50000016", "1000000000", "990000000", "580000001", "1", "10000000", "2", "3", "1001", "150", "274", "435", "280", "268", "404", "51", "250", "251", "249"]}	UNKNOWN	PYTHON3	CODEFORCES	5
8b4044b6c20a561a758869590fbe0d05	GukiZ and Binary Operations	We all know that GukiZ often plays with arrays. Now he is thinking about this problem: how many arrays a, of length n, with non-negative elements strictly less then 2l meet the following condition: ? Here operation means bitwise AND (in Pascal it is equivalent to and, in C/C++/Java/Python it is equivalent to &), operation means bitwise OR (in Pascal it is equivalent to , in C/C++/Java/Python it is equivalent to \|). Because the answer can be quite large, calculate it modulo m. This time GukiZ hasn't come up with solution, and needs you to help him! First and the only line of input contains four integers n, k, l, m (2<=≤<=n<=≤<=1018, 0<=≤<=k<=≤<=1018, 0<=≤<=l<=≤<=64, 1<=≤<=m<=≤<=109<=+<=7). In the single line print the number of arrays satisfying the condition above modulo m. Sample Input 2 1 2 10 2 1 1 3 3 3 2 10 Sample Output 3 1 9	[ "n,k,l,m=map(int,input().split())\nfc={1:1,2:1}\ndef f(n):\n\tif n not in fc: k=n//2;fc[n]=(f(k+1)2+f(k)2 if n%2 else f(k)(2f(k+1)-f(k)))%m\n\treturn fc[n]\ns=k<2*l\nfor i in range(l): s=pow(2,n,m)-f(n+2) if (k>>i)%2 else f(n+2)\nprint(s%m)\n" ]	{"inputs": ["2 1 2 10", "2 1 1 3", "3 3 2 10", "5135 42542 15 4354", "21 21 21 21", "2 0 0 5", "1564 153 12 1000000007", "101 102 13 104", "5 6 29 108", "1000000001 1000000002 37 1000000007", "45305640 6540640606 51 5406546", "68706870687 984089409849 59 156465748", "987408898498 1233432432 15 15", "111111111111 111111111111 41 11", "10321324 13213413210 55 1351", "351351354 5464487 64 484848484", "951892365 123481283597 32 123456", "6 0 0 1", "6544433213 3232321 63 2121232", "1000000000000000000 1000000000000000000 64 1000000007", "4 4 4 4", "999999999999999999 999999999999999999 63 3", "14 14 14 1414", "1001 1 0 4", "4 10003242 2 99999991", "32132321412 2132134124 34 2321321", "100 10 10 100", "2 1000000000000000000 64 1", "1000000000000000000 1 64 911", "2 0 1 3", "2 1 63 1000000007", "64 64 64 64", "1114 7 3 1005", "16 16 4 98218222", "9992121323332 32133312321 58 2", "432532 321312 47 32323", "2 1 64 1", "1000000000000000000 1 64 1", "2 1 0 1", "2 0 0 1000000007", "2 0 0 1", "2 0 64 1000000007", "2 1000000000000000000 0 1", "1000000000000000000 1000000000000000000 64 1", "453403154 354134 12 354354", "3461827346 97649324 33 1324157", "987654321 123456789 64 65406468", "467513 453754 15 15555", "61546535 168465146 13 354354", "8894681 35135435 15 1351351", "35413210 444444 44 4444447", "1353513 6545341 54 5454547", "131231231 35435 63 153459", "564654151 123131 38 654654", "131354 1354534 51 1534354", "5165151 3545344 49 354354", "15153153351 21243512 61 534354199", "241531351 230321 59 7412135", "978464816 78484331 42 654534", "165467464 5416516 45 364545697", "2595952145 564654654 64 471571451", "85689952135646564 456465135103154 61 554556465", "13713712721 13458749846 38 546863217", "154165741654 154168764 54 546546", "717273747576 1213141516 59 123456789", "321456987 654789321 50 4564569", "1111111 1212121 21 1212199", "1211199887 77665544 64 123123", "1928374655 1111 25 1231237", "1000000000 100000000077789 58 864405117"], "outputs": ["3", "1", "9", "0", "1", "1", "360373699", "37", "37", "472514342", "891777", "51245777", "0", "0", "1196", "32687413", "0", "0", "1767237", "818137911", "0", "1", "1043", "0", "0", "145556", "0", "0", "868", "0", "529745921", "0", "193", "0", "0", "21923", "0", "0", "0", "1", "0", "767713261", "0", "0", "0", "1172060", "62322669", "0", "0", "0", "2415375", "4341376", "9232", "113542", "319559", "269269", "529706284", "1413850", "234981", "28484610", "25322553", "526174733", "202473723", "347802", "91290627", "4487490", "1058809", "25216", "221684", "21891069"]}	UNKNOWN	PYTHON3	CODEFORCES	1
8b469bd08bc0cbf4598d9a22785da95f	none	Vasilisa the Wise from a far away kingdom got a present from her friend Helga the Wise from a farther away kingdom. The present is a surprise box, yet Vasilisa the Wise doesn't know yet what the surprise actually is because she cannot open the box. She hopes that you can help her in that. The box's lock is constructed like that. The box itself is represented by an absolutely perfect black cube with the identical deepening on each face (those are some foreign nanotechnologies that the far away kingdom scientists haven't dreamt of). The box is accompanied by six gems whose form matches the deepenings in the box's faces. The box can only be opened after it is correctly decorated by the gems, that is, when each deepening contains exactly one gem. Two ways of decorating the box are considered the same if they can be obtained one from the other one by arbitrarily rotating the box (note that the box is represented by a perfect nanotechnological cube) Now Vasilisa the Wise wants to know by the given set of colors the following: in how many ways would she decorate the box in the worst case to open it? To answer this question it is useful to know that two gems of one color are indistinguishable from each other. Help Vasilisa to solve this challenging problem. The first line contains exactly 6 characters without spaces from the set {R, O, Y, G, B, V} — they are the colors of gems with which the box should be decorated. Print the required number of different ways to decorate the box. Sample Input YYYYYY BOOOOB ROYGBV Sample Output 1 2 30	[ "import itertools\n\nclass Cube:\n def __init__(self, v):\n self.s = v\n def rotate_h(self):\n s = self.s\n self.s = s[0:1] + s[2:5] + s[1:2] + s[5:6]\n def rotate_v1(self):\n s = self.s\n self.s = s[1:2] + s[5:6] + s[2:3] + s[0:1] + s[4:5] + s[3:4]\n def rotate_v2(self):\n s = self.s\n self.s = s[2:3] + s[1:2] + s[5:6] + s[3:4] + s[0:1] + s[4:5]\n def get(self):\n return ''.join(self.s)\n\ns = list(input())\nans = 0\nused = set()\nfor v in itertools.permutations(s):\n c = Cube(v)\n tmp = set()\n ok = True\n for i in range(3):\n for j in range(4):\n state = c.get()\n if state in used:\n ok = False\n break\n tmp.add(state)\n c.rotate_h()\n if not ok:\n break\n c.rotate_v1()\n for j in range(4):\n state = c.get()\n if state in used:\n ok = False\n break\n tmp.add(state)\n c.rotate_h()\n if not ok:\n break\n c.rotate_v2()\n if ok:\n ans += 1\n used.update(tmp)\n\nprint(ans)\n\n \t\t \t\t \t \t \t\t\t \t\t\t \t\t \t", "from collections import deque\r\nimport itertools\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 while q:\r\n i = q.popleft()\r\n p1 = [(i // pow6[j]) % 6 for j in range(6)]\r\n for v0 in v:\r\n for _ in range(3):\r\n p1[v0[0]], p1[v0[1]], p1[v0[2]], p1[v0[3]] = p1[v0[1]], p1[v0[2]], p1[v0[3]], p1[v0[0]]\r\n u = 0\r\n for j in range(6):\r\n u += p1[j] * pow6[j]\r\n if not visit[u]:\r\n visit[u] = 1\r\n q.append(u)\r\n return\r\n\r\ns = list(input().rstrip())\r\nd = {\"R\":0, \"O\":1, \"Y\":2, \"G\":3, \"B\":4, \"V\":5}\r\npow6 = [1]\r\nfor _ in range(6):\r\n pow6.append(6 * pow6[-1])\r\np = [d[i] for i in s]\r\nn = pow6[6]\r\nvisit = [0] * n\r\nans = 0\r\nv = [(0, 1, 2, 3), (0, 4, 2, 5), (1, 4, 3, 5)]\r\nfor p0 in itertools.permutations(p):\r\n u = 0\r\n for i in range(6):\r\n u += p0[i] * pow6[i]\r\n if visit[u]:\r\n continue\r\n ans += 1\r\n bfs(u)\r\nprint(ans)", "from collections import defaultdict, Counter\r\nfrom typing import List\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\nfrom functools import lru_cache\r\nfrom itertools import permutations\r\n\r\ns = input()\r\n\r\nans = set()\r\n# 获取s的全排列\r\nfor perm in permutations(s):\r\n # 每个全排列代表色子的6个面的颜色：\r\n # perm[0](上),perm[1](下)\r\n # perm[2](左),perm[3](右)\r\n # perm[4](前),perm[5](后)\r\n # 由于可以经过一定旋转得到相同表示方式，那么这些必有一个独特表示方式（按字典序最小）\r\n # 顶部面有6种可能，确定顶部后那么底部就确定了\r\n # 前面有4种选择，确定前面后后面和侧面（侧面不应该还有两种？错：此时色子涂色方案已确定perm，所以不计算）就确定了\r\n\r\n perm_id = list(perm)\r\n\r\n # 计算每个排列的24种旋转可能，取字典序最小的序列表示当前排列的唯一标识\r\n for i in range(6):\r\n if i == 0:\r\n tmp = [perm[0], perm[1], perm[2], perm[3], perm[4], perm[5]]\r\n # 上下面已确定，现在考虑前面\r\n perm_id = min(perm_id,\r\n [tmp[0], tmp[1], tmp[2], tmp[3], tmp[4], tmp[5]],\r\n # 左->前：前->右，右->后，后->左\r\n [tmp[0], tmp[1], tmp[5], tmp[4], tmp[2], tmp[3]],\r\n # 右->前：前->左，左->后，后->右\r\n [tmp[0], tmp[1], tmp[4], tmp[5], tmp[3], tmp[2]],\r\n # 后<->前：左<->右\r\n [tmp[0], tmp[1], tmp[3], tmp[2], tmp[5], tmp[4]],\r\n )\r\n if i == 1: # 下<->上：前<->后\r\n tmp = [perm[1], perm[0], perm[2], perm[3], perm[5], perm[4]]\r\n # 上下面已确定，现在考虑前面\r\n perm_id = min(perm_id,\r\n [tmp[0], tmp[1], tmp[2], tmp[3], tmp[4], tmp[5]],\r\n # 左->前：前->右，右->后，后->左\r\n [tmp[0], tmp[1], tmp[5], tmp[4], tmp[2], tmp[3]],\r\n # 右->前：前->左，左->后，后->右\r\n [tmp[0], tmp[1], tmp[4], tmp[5], tmp[3], tmp[2]],\r\n # 后<->前：左<->右\r\n [tmp[0], tmp[1], tmp[3], tmp[2], tmp[5], tmp[4]],\r\n )\r\n elif i == 2: # 左->上：上->右，右->下，下->左\r\n tmp = [perm[2], perm[3], perm[1], perm[0], perm[4], perm[5]]\r\n # 上下面已确定，现在考虑前面\r\n perm_id = min(perm_id,\r\n [tmp[0], tmp[1], tmp[2], tmp[3], tmp[4], tmp[5]],\r\n # 左->前：前->右，右->后，后->左\r\n [tmp[0], tmp[1], tmp[5], tmp[4], tmp[2], tmp[3]],\r\n # 右->前：前->左，左->后，后->右\r\n [tmp[0], tmp[1], tmp[4], tmp[5], tmp[3], tmp[2]],\r\n # 后<->前：左<->右\r\n [tmp[0], tmp[1], tmp[3], tmp[2], tmp[5], tmp[4]],\r\n )\r\n elif i == 3: # 右->上：上->左，左->下，下->右\r\n tmp = [perm[3], perm[2], perm[0], perm[1], perm[4], perm[5]]\r\n # 上下面已确定，现在考虑前面\r\n perm_id = min(perm_id,\r\n [tmp[0], tmp[1], tmp[2], tmp[3], tmp[4], tmp[5]],\r\n # 左->前：前->右，右->后，后->左\r\n [tmp[0], tmp[1], tmp[5], tmp[4], tmp[2], tmp[3]],\r\n # 右->前：前->左，左->后，后->右\r\n [tmp[0], tmp[1], tmp[4], tmp[5], tmp[3], tmp[2]],\r\n # 后<->前：左<->右\r\n [tmp[0], tmp[1], tmp[3], tmp[2], tmp[5], tmp[4]],\r\n )\r\n elif i == 4: # 前->上：上->后，后->下，下->前\r\n tmp = [perm[4], perm[5], perm[2], perm[3], perm[1], perm[0]]\r\n # 上下面已确定，现在考虑前面\r\n perm_id = min(perm_id,\r\n [tmp[0], tmp[1], tmp[2], tmp[3], tmp[4], tmp[5]],\r\n # 左->前：前->右，右->后，后->左\r\n [tmp[0], tmp[1], tmp[5], tmp[4], tmp[2], tmp[3]],\r\n # 右->前：前->左，左->后，后->右\r\n [tmp[0], tmp[1], tmp[4], tmp[5], tmp[3], tmp[2]],\r\n # 后<->前：左<->右\r\n [tmp[0], tmp[1], tmp[3], tmp[2], tmp[5], tmp[4]],\r\n )\r\n elif i == 5: # 后->上：上->前，前->下，下->后\r\n tmp = [perm[5], perm[4], perm[2], perm[3], perm[0], perm[1]]\r\n # 上下面已确定，现在考虑前面\r\n perm_id = min(perm_id,\r\n [tmp[0], tmp[1], tmp[2], tmp[3], tmp[4], tmp[5]],\r\n # 左->前：前->右，右->后，后->左\r\n [tmp[0], tmp[1], tmp[5], tmp[4], tmp[2], tmp[3]],\r\n # 右->前：前->左，左->后，后->右\r\n [tmp[0], tmp[1], tmp[4], tmp[5], tmp[3], tmp[2]],\r\n # 后<->前：左<->右\r\n [tmp[0], tmp[1], tmp[3], tmp[2], tmp[5], tmp[4]],\r\n )\r\n ans.add(\"\".join(perm_id))\r\nprint(len(ans))\r\n", "from collections import defaultdict, deque, Counter\r\nfrom sys import stdin, stdout\r\nfrom heapq import heappush, heappop\r\nimport math\r\nimport io\r\nimport os\r\nimport math\r\nimport bisect\r\n\r\n#?############################################################\r\n\r\n\r\ndef isPrime(x):\r\n for i in range(2, x):\r\n if ii > x:\r\n break\r\n if (x % i == 0):\r\n return False\r\n return True\r\n\r\n#?############################################################\r\n\r\n\r\ndef ncr(n, r, p):\r\n num = den = 1\r\n for i in range(r):\r\n num = (num (n - i)) % p\r\n den = (den * (i + 1)) % p\r\n return (num * pow(den, p - 2, p)) % p\r\n\r\n\r\n#?############################################################\r\n\r\ndef primeFactors(n):\r\n l = []\r\n while n % 2 == 0:\r\n l.append(2)\r\n n = n / 2\r\n for i in range(3, int(math.sqrt(n))+1, 2):\r\n while n % i == 0:\r\n l.append(int(i))\r\n n = n / i\r\n if n > 2:\r\n l.append(n)\r\n return list(set(l))\r\n\r\n\r\n#?############################################################\r\n\r\ndef power(x, y, p):\r\n res = 1\r\n x = x % p\r\n if (x == 0):\r\n return 0\r\n while (y > 0):\r\n if ((y & 1) == 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\n\r\n\r\ndef sieve(n):\r\n prime = [True for i in range(n+1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n+1, p):\r\n prime[i] = False\r\n p += 1\r\n return prime\r\n\r\n\r\n#?############################################################\r\n\r\ndef digits(n):\r\n c = 0\r\n while (n > 0):\r\n n //= 10\r\n c += 1\r\n return c\r\n\r\n#?############################################################\r\n\r\n\r\ndef ceil(n, x):\r\n if (n % x == 0):\r\n return n//x\r\n return n//x+1\r\n\r\n#?############################################################\r\n\r\n\r\ndef mapin():\r\n return map(int, input().split())\r\n\r\n#?############################################################\r\ndef solve(a):\r\n size = len(a)\r\n max_so_far = 0\r\n max_ending_here = 0\r\n \r\n for i in range(0, size):\r\n max_ending_here = max_ending_here + a[i]\r\n if (max_so_far < max_ending_here):\r\n max_so_far = max_ending_here\r\n \r\n if max_ending_here < 0:\r\n max_ending_here = 0 \r\n return max_so_far\r\n \r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n# python3 15.py<in>op\r\nd = defaultdict(lambda:0) \r\nt = 1\r\nfor _ in range(t):\r\n s = input()\r\n\r\n ans = 0\r\n a2 = 0\r\n for i in s:\r\n d[i]+=1\r\n\r\n d = tuple(sorted(d.values()))\r\n r = {\r\n\t(6,): 1,\r\n\t(1, 5): 1,\r\n\t(2, 4): 2,\r\n\t(1, 1, 4): 2,\r\n\t(3, 3): 2,\r\n\t(1, 2, 3): 3,\r\n\t(1, 1, 1, 3): 5,\r\n\t(2, 2, 2): 6,\r\n\t(1, 1, 2, 2): 8,\r\n\t(1, 1, 1, 1, 2): 15,\r\n\t(1, 1, 1, 1, 1, 1): 30,\r\n }\r\n # print(d)\r\n print(r[d])\r\n ", "try:\r\n import sys\r\n from functools import lru_cache, cmp_to_key\r\n from heapq import merge, heapify, heappop, heappush\r\n from math import \r\n from collections import defaultdict as dd, deque, Counter as C\r\n from itertools import combinations as comb, permutations as perm\r\n from bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\n from time import perf_counter\r\n from fractions import Fraction\r\n import copy\r\n from copy import deepcopy\r\n import time\r\n starttime = time.time()\r\n mod = int(pow(10, 9) + 7)\r\n mod2 = 998244353\r\n\r\n def data(): return sys.stdin.readline().strip()\r\n def out(var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\n def L(): return list(sp())\r\n def sl(): return list(ssp())\r\n def sp(): return map(int, data().split())\r\n def ssp(): return map(str, data().split())\r\n def l1d(n, val=0): return [val for i in range(n)]\r\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\n\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n # from sys import stdin\r\n # input = stdin.buffer.readline\r\n # I = lambda : list(map(int,input().split()))\r\n # import sys\r\n # input=sys.stdin.readline\r\n\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\n\r\n\r\n\r\ns=input()\r\ns=sorted(s)\r\ncount=1\r\nans=[]\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)\r\n count=1\r\nans.append(count)\r\nans.sort()\r\nif(len(ans)==1):\r\n print(1)\r\nif(len(ans)==2):\r\n if(ans[0]==1):\r\n print(1)\r\n else:\r\n print(2)\r\nif(len(ans)==3):\r\n if(len(set(ans))==1):\r\n print(6)\r\n elif(ans==[1,1,4]):\r\n print(2)\r\n elif(ans==[1,2,3]):\r\n print(3)\r\nif(len(ans)==4):\r\n if(ans==[1,1,1,3]):\r\n print(5)\r\n elif(ans==[1,1,2,2]):\r\n print(8)\r\nif(len(ans)==6):\r\n print(30)\r\nif(len(ans)==5):\r\n print(15)\r\n \r\n" ]	{"inputs": ["YYYYYY", "BOOOOB", "ROYGBV", "RRRRRR", "BOOOOO", "GOGGVG", "GRBYVO", "BYOVRR", "VOVRBV", "GVGBVO", "BOBGBB", "OOYYBY", "VVRVVV", "YBBVVY", "GYYGGG", "BRRBRB", "OOOOOO", "OVBRYG", "VOBYGO", "VRRYGR", "VOBVYB", "YYYYRB", "RYYYVV", "YYYYYG", "OBORBR", "RRRGRG", "VYYYVV", "YYYYYY", "YROVBG", "RYGOBG", "BGRGGV", "BVRYBV", "RRBYRR", "GGGYYB", "BBBBBY", "RRYYOO", "YYYRRY", "OGGOOG", "GYYBRO", "VORBOR", "RRRGGB", "BBOOYY", "YYBBOO", "OBRRYY", "ROYYGG", "RRGGYY", "RROOYY", "RRYOGB"], "outputs": ["1", "2", "30", "1", "1", "2", "30", "15", "5", "8", "2", "3", "1", "6", "2", "2", "1", "30", "15", "5", "8", "2", "3", "1", "6", "2", "2", "1", "30", "15", "5", "8", "2", "3", "1", "6", "2", "2", "15", "8", "3", "6", "6", "8", "8", "6", "6", "15"]}	UNKNOWN	PYTHON3	CODEFORCES	5
8b794f61bba5cf73f873c4461a6dc912	Processing Queries	In this problem you have to simulate the workflow of one-thread server. There are n queries to process, the i-th will be received at moment ti and needs to be processed for di units of time. All ti are guaranteed to be distinct. When a query appears server may react in three possible ways: 1. If server is free and query queue is empty, then server immediately starts to process this query. 1. If server is busy and there are less than b queries in the queue, then new query is added to the end of the queue. 1. If server is busy and there are already b queries pending in the queue, then new query is just rejected and will never be processed. As soon as server finished to process some query, it picks new one from the queue (if it's not empty, of course). If a new query comes at some moment x, and the server finishes to process another query at exactly the same moment, we consider that first query is picked from the queue and only then new query appears. For each query find the moment when the server will finish to process it or print -1 if this query will be rejected. The first line of the input contains two integers n and b (1<=≤<=n,<=b<=≤<=200<=000) — the number of queries and the maximum possible size of the query queue. Then follow n lines with queries descriptions (in chronological order). Each description consists of two integers ti and di (1<=≤<=ti,<=di<=≤<=109), where ti is the moment of time when the i-th query appears and di is the time server needs to process it. It is guaranteed that ti<=-<=1<=<<=ti for all i<=><=1. Print the sequence of n integers e1,<=e2,<=...,<=en, where ei is the moment the server will finish to process the i-th query (queries are numbered in the order they appear in the input) or <=-<=1 if the corresponding query will be rejected. Sample Input 5 1 2 9 4 8 10 9 15 2 19 1 4 1 2 8 4 8 10 9 15 2 Sample Output 11 19 -1 21 22 10 18 27 -1	[ "n, b = [int(i) for i in input().split()]\r\nq = [0] * n\r\nbg = 0\r\nen = 0\r\ntime = 0\r\nres = [-1] * n\r\nfor it in range(n):\r\n ev = [int(i) for i in input().split()]\r\n ev.append(it)\r\n while bg < en and max(time, q[bg][0]) <= ev[0]:\r\n time = max(time, q[bg][0])\r\n res[q[bg][2]] = time + q[bg][1]\r\n time += q[bg][1]\r\n bg += 1\r\n if en - bg < b:\r\n q[en] = ev\r\n en += 1\r\n \r\nwhile bg < en:\r\n time = max(time, q[bg][0])\r\n res[q[bg][2]] = time + q[bg][1]\r\n time += q[bg][1]\r\n bg += 1\r\n\r\nfor i in range(n):\r\n print(res[i], end=' ')\r\n", "import queue\r\n\r\n\r\nclass Task():\r\n def __init__(self, t, d, f):\r\n self.t = t\r\n self.d = d\r\n self.f = f\r\n\r\n\r\nn, b = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n a.append(Task(t, d, 0))\r\n\r\nq = queue.Queue()\r\n\r\nnow = a[0].t + a[0].d\r\na[0].f = now\r\nq.put(now)\r\ni = 1\r\n\r\nwhile i < n:\r\n task = a[i]\r\n while q.qsize() > 0 and task.t >= q.queue[0]:\r\n q.get()\r\n\r\n if q.qsize() > b:\r\n task.f = -1\r\n else:\r\n now = max(task.t, now)\r\n now += task.d\r\n task.f = now\r\n q.put(now)\r\n i += 1\r\n\r\nfor i in range(n):\r\n print(a[i].f, end=' ')\r\n\r\n\r\n", "# LEFT = \"left\"\r\n# RIGHT = \"right\"\r\n# side_start = [LEFT,RIGHT]\r\n# C = int(input())\r\n#\r\n#\r\n# for case in range(C):\r\n# NTM = [int(x) for x in input().split()]\r\n# N = NTM[0]\r\n# T = NTM[1]\r\n# M = NTM[2]\r\n# m_lines = []\r\n# left = []\r\n# right = []\r\n# for line in range(M):\r\n# arrive_time_cside = input().split()\r\n# arrivetime = int(arrive_time_cside[0])\r\n# side_come = arrive_time_cside[1]\r\n# if side_come ==LEFT:\r\n# left.append([arrivetime,side_come])\r\n# else:\r\n# right.append([arrivetime,side_come])\r\n# left.reverse()\r\n# right.reverse()\r\n#\r\n# if not right or (left and left[-1][0] < right[-1][0]):#first left has car\r\n# start = 0\r\n# curr = max(left[-1][0],T)\r\n# takeL = []\r\n# takR = []\r\n# while left or right:\r\n# side = side_start[start]\r\n# tmp =[]\r\n# while left and left[-1][0] <= curr and left[-1][1] == side:\r\n# if len(tmp)<N:\r\n# tmp.append([left.pop(),curr+T])\r\n# else:break\r\n# takeL.extend(tmp)\r\n# curr += T\r\n# next_min = 1000001\r\n# if left:\r\n# next_min = min(left[-1][0],next_min)\r\n# if right:\r\n# next_min = min(right[-1][0],next_min)\r\n# if next_min > curr:\r\n# curr = next_min\r\n# start = 1 - start\r\n# side = side_start[start]\r\n# tmp = []\r\n# while right and right[-1][0] <= curr and right[-1][1] == side:\r\n# if len(tmp) < N:\r\n# tmp.append([right.pop(),curr+T])\r\n# else:\r\n# break\r\n# takR.extend(tmp)\r\n# start = 1-start\r\n# curr+=T\r\n# next_min = 1000001\r\n# if left:\r\n# next_min = min(left[-1][0], next_min)\r\n# if right:\r\n# next_min = min(right[-1][0], next_min)\r\n# if next_min > curr:\r\n# curr = next_min\r\n# pt1 = 0\r\n# pt2 = 0\r\n# take = []\r\n# while pt1 < len(takeL) and pt2 < len(takR):\r\n# if takeL[pt1][0][0] < takR[pt2][0][0]:\r\n# take.append(takeL[pt1][1])\r\n# pt1 +=1\r\n# else:\r\n# take.append(takR[pt2][1])\r\n# pt2 += 1\r\n# while pt1 < len(takeL):\r\n# take.append(takeL[pt1][1])\r\n# pt1 += 1\r\n# while pt2 < len(takR):\r\n# take.append(takR[pt2][1])\r\n# pt2 += 1\r\n# for e in take:\r\n# print(e)\r\n# else:\r\n# start = 1\r\n# curr = right[-1][0]+T\r\n# takeL = []\r\n# takR = []\r\n# take = []\r\n# while left or right:\r\n# side = side_start[start]\r\n# tmp = []\r\n# while right and right[-1][0] <= curr and right[-1][1] == side:\r\n# if len(tmp) < N:\r\n# tmp.append([right.pop(),curr+T])\r\n# else:\r\n# break\r\n# takR.extend(tmp)\r\n# start = 1 - start\r\n# curr += T\r\n# next_min = 1000001\r\n# if left:\r\n# next_min = min(left[-1][0], next_min)\r\n# if right:\r\n# next_min = min(right[-1][0], next_min)\r\n# if next_min > curr:\r\n# curr = next_min\r\n# start = 1 - start\r\n# side = side_start[start]\r\n# tmp = []\r\n# while left and left[-1][0] <= curr and left[-1][1] == side:\r\n# if len(tmp) < N:\r\n# tmp.append([left.pop(),curr+T])\r\n# else:\r\n# break\r\n# takeL.extend(tmp)\r\n# curr += T\r\n# next_min = 1000001\r\n# if left:\r\n# next_min = min(left[-1][0], next_min)\r\n# if right:\r\n# next_min = min(right[-1][0], next_min)\r\n# if next_min > curr:\r\n# curr = next_min\r\n# start = 1 - start\r\n# side = side_start[start]\r\n# tmp = []\r\n#\r\n# pt1 = 0\r\n# pt2 = 0\r\n# while pt1 < len(takeL) and pt2 < len(takR):\r\n# if takeL[pt1][0][0] < takR[pt2][0][0]:\r\n# take.append(takeL[pt1][1])\r\n# pt1 += 1\r\n# else:\r\n# take.append(takR[pt2][1])\r\n# pt2 += 1\r\n# while pt1 < len(takeL):\r\n# take.append(takeL[pt1][1])\r\n# pt1 += 1\r\n# while pt2 < len(takR):\r\n# take.append(takR[pt2][1])\r\n# pt2 += 1\r\n# for e in take:\r\n# print(e)\r\n# # come back\r\n#\r\n# from collections import deque\r\n# NB = [int(x) for x in input().split(\" \")]\r\n# N = NB[0]\r\n# B = NB[1]\r\n# backages = deque()\r\n# for i in range(N):\r\n# TD= [int(x) for x in input().split(\" \")]\r\n# backages.appendleft([i,TD[0],TD[1]])#index,push into queue time, how long is process\r\n# result = [0]N\r\n# currT = 0\r\n# bags = deque()\r\n# print(backages)\r\n# while backages:\r\n# currT +=1\r\n# if currT==backages[-1][1]:\r\n# bags.appendleft(backages.pop())\r\n# if len(bags)>B+1:\r\n# query = bags.popleft()\r\n# result[query[0]]=-1\r\n# if bags and currT == bags[-1][1]+bags[-1][2]:\r\n# q_done = bags.pop()\r\n# result[q_done[0]] = q_done[1]+q_done[2]\r\n# bags[-1][1] = currT\r\n# print(result)\r\n# Processing Queries.py\r\n\r\nfrom collections import \r\n\r\nn, b = map(int, input().split(\" \"));\r\narr = deque();\r\ncount = 0;\r\nresult = []\r\nfor i in range(n):\r\n t, d = map(int, input().split(\" \"));\r\n while arr and arr[0] <= t:\r\n arr.popleft();\r\n count -= 1;\r\n if count <= b:\r\n if len(arr) > 0:\r\n t = max(arr[-1], t);\r\n y = d + t\r\n result.append(y)\r\n arr.append(y);\r\n count += 1;\r\n else:\r\n result.append(- 1)\r\nprint(\" \".join([str(x) for x in result]))", "\nfrom queue import Queue\n\n\nif __name__ == '__main__':\n n, b = list(map(int, input().split()))\n q = Queue()\n next_avail = 0\n task_list = []\n for i in range(n):\n t, d = list(map(int, input().split()))\n task = [t, d, 0]\n task_list.append(task)\n \n start = 0\n t0, d0, f0 = task_list[0]\n next_avail = t0 + d0 \n task_list[0][2] = next_avail\n \n q.put(next_avail)\n \n for i in range(1, n):\n temp_task = task_list[i]\n while (q.qsize() > 0) and (temp_task[0] >= q.queue[0]):\n q.get()\n \n if next_avail <= temp_task[0]:\n next_avail = temp_task[0] + temp_task[1]\n temp_task[2] = next_avail\n q.put(next_avail)\n else:\n if q.qsize() > b:\n temp_task[2] = -1\n else:\n next_avail += temp_task[1]\n temp_task[2] = next_avail\n q.put(next_avail)\n \n \n for t in task_list:\n print(t[2], end=\" \")", "n, b = map(int, input().split())\r\ntime = 0\r\nqueue = []\r\nfor i in range(n):\r\n t,d = map(int, input().split())\r\n while len(queue) != 0 and t >= queue[0]:\r\n queue.pop(0)\r\n if len(queue) <= b:\r\n time = max(t, time) + d\r\n queue.append(time)\r\n print(time, end = \" \")\r\n else: print(-1, end = \" \")", "# from dust i have come, dust i will be\r\n\r\nimport queue\r\n\r\nn, m = map(int, input().split())\r\n\r\nclass Task:\r\n def __init__(self, t, d):\r\n self.t = t\r\n self.d = d\r\n self.f = 0\r\n\r\na = [None]n\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n a[i] = Task(t, d)\r\n\r\nq = queue.Queue()\r\n\r\ns = 0\r\nt = a[0].t + a[0].d\r\na[0].f = t\r\nq.put(t)\r\n\r\nfor i in range(1, n):\r\n while not q.empty() and a[i].t >= q.queue[0]:\r\n q.get()\r\n\r\n if t <= a[i].t:\r\n t = a[i].t + a[i].d\r\n a[i].f = t\r\n q.put(t)\r\n\r\n else:\r\n if q.qsize() > m:\r\n a[i].f = -1\r\n\r\n else:\r\n t += a[i].d\r\n a[i].f = t\r\n q.put(t)\r\n\r\nfor i in range(n):\r\n print(a[i].f, end=\" \")\r\n", "from collections import deque\nn, b = [int(x) for x in input().split()]\nD = deque()\ntime = [-1] n\nT = 0\nfor i in range(n):\n t, d = [int(x) for x in input().split()]\n while D and T + D[0][0] <= t:\n T += D[0][0]\n time[D[0][1]] = T\n D.popleft()\n if len(D) == 0:\n T = t\n if len(D) <= b:\n D.append((d, i))\n\nimport math\nt = float('inf')\nwhile D and T + D[0][0] <= t:\n T += D[0][0]\n time[D[0][1]] = T\n D.popleft()\n\nfor t in time:\n print(t, end = ' ')\n\n \n \n", "import queue\n\nclass Scanner:\n import sys\n def __init__(self, istream = sys.stdin):\n self.tokenizer = Scanner.__tokenizer__(istream)\n def __tokenizer__(istream):\n for line in istream:\n for token in line.strip().split():\n yield token\n while True:\n yield None\n def next(self, type = str, rep = 1):\n if rep == 1:\n return type(self.tokenizer.__next__())\n return [type(self.tokenizer.__next__()) for i in range(rep)]\n\nsc = Scanner()\nn, b = sc.next(int, 2)\nq = queue.Queue()\nprocessing = 0\n\nfor _ in range(n):\n t, d = sc.next(int, 2)\n\n while not q.empty() and q.queue[0] <= t:\n q.get()\n \n if q.qsize() <= b:\n processing = max(processing, t) + d\n print(processing, end=' ')\n q.put(processing)\n else:\n print(-1, end=' ')", "n, queue_size = map(lambda x: int(x), input().split())\n\nresults = [-1 for _ in range(n)]\n\nnext_server_free_time = 1\nqueue = []\nfor idx in range(n):\n t, d = map(lambda x: int(x), input().split())\n\n while queue and next_server_free_time <= t:\n idx1, d1 = queue.pop(0)\n next_server_free_time += d1\n results[idx1] = next_server_free_time\n\n if next_server_free_time <= t:\n results[idx] = t + d\n next_server_free_time = t + d\n else:\n if len(queue) < queue_size:\n queue.append((idx, d))\n\nwhile queue:\n idx, d = queue.pop(0)\n next_server_free_time += d\n results[idx] = next_server_free_time\n\nprint(' '.join(map(lambda x: str(x), results)))\n", "import queue\r\n\r\nif __name__ == \"__main__\":\r\n n, b = map(int, input().split())\r\n q = queue.Queue()\r\n time = 0\r\n for i in range(n):\r\n t, d = map(int, input().split())\r\n while q.qsize() and q.queue[0] <= t:\r\n q.get()\r\n if q.empty():\r\n time = t\r\n if q.qsize() <= b:\r\n time += d\r\n q.put(time)\r\n print(time, end = \" \")\r\n else:\r\n print(-1, end = \" \")", "import queue\r\n\r\nclass Query:\r\n def __init__(self, _id, _appearTime, _processTime):\r\n self.id = _id\r\n self.appearTime = _appearTime\r\n self.processTime = _processTime\r\n\r\nq = queue.Queue()\r\nn, b = map(int, input().split())\r\ncurTime = 0\r\nres = [0] * (n + 10)\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n if t < curTime:\r\n if (q.qsize() == b):\r\n res[i] = -1\r\n continue\r\n q.put(Query(i, t, d))\r\n else:\r\n q.put(Query(i, t, d))\r\n while t >= curTime and (not q.empty()):\r\n query = q.get()\r\n #print(query.id, query.appearTime, query.processTime)\r\n curTime = max(curTime, query.appearTime)\r\n curTime = curTime + query.processTime\r\n res[query.id] = curTime\r\n #print(i, curTime)\r\n \r\n \r\nwhile not q.empty():\r\n query = q.get()\r\n #print(query)\r\n curTime = max(curTime, query.appearTime)\r\n curTime = curTime + query.processTime\r\n res[query.id] = curTime\r\n\r\nfor i in range(n): \r\n print(res[i])\r\n\r\n\r\n", "from collections import deque\n\nn, b = map(int, input().split())\nq = deque()\nprocessing = 0\n\nfor _ in range(n):\n t, d = map(int, input().split())\n\n while q and t >= q[0]:\n q.popleft()\n\n if len(q) <= b:\n processing = max(t, processing) + d\n q.append(processing)\n print(processing, end=' ')\n else:\n print(-1, end=' ')\n", "import queue\n\nn, b = map(int, input().split())\n\nq = queue.Queue()\ntime = 0\n\nfor i in range(n):\n t, d = map(int, input().split())\n\n while q.empty() == False and q.queue[0] <= t:\n q.get()\n\n if q.empty():\n time = t\n \n if q.qsize() <= b:\n time += d\n q.put(time)\n print(time, end=\" \")\n else:\n print(-1, end=\" \")", "def processQueries():\n n_k = input().split()\n n = int(n_k[0])\n k = int(n_k[1])\n\n lst_queries = []\n for i in range(n):\n s_t = input().split()\n lst_queries.append((int(s_t[0]), int(s_t[1])))\n\n queue_queries = []\n res = [-1] * n\n time = lst_queries[0][0]\n current = None\n i = 0\n while i < n or len(queue_queries) > 0:\n index = 0\n if len(queue_queries) > 0:\n i_current = queue_queries.pop(0)\n index = i_current[0]\n current = i_current[1]\n else:\n current = lst_queries[i]\n index = i\n i += 1\n # process current\n time = max(time, current[0]) + current[1]\n res[index] = time\n # update queue\n for j in range(i, n):\n if time > lst_queries[j][0]:\n if len(queue_queries) < k:\n queue_queries.append((j,lst_queries[j]))\n i += 1\n else:\n break\n return res\n\n\nres = processQueries()\nprint(' '.join(map(str, res)))\n", "import collections \r\nnb = list(map(int, input().split()))\r\n\r\nn = nb[0]\r\nb = nb[1]\r\nqueries = collections.deque()\r\nfor i in range(n):\r\n td = list(map(int, input().split()))\r\n queries.append((td[0], td[1], i))\r\n\r\nanswer = [0] * n\r\nprocessed = []\r\n# answer[0] = processed[-1][-1]\r\nqueue = collections.deque()\r\n\r\nnext_available = 0\r\ni = 0\r\ncnt = 0\r\n# significant events: a process \"requests\" to join queue, a process gets out of queue and is processed\r\nwhile cnt != n:\r\n # we are at cur_time\r\n # event: process joins queue --> may or may not happen\r\n # event: starts process\r\n # event: end process\r\n # at each event: there are two works to do\r\n # 1. eject one process in queue\r\n # 2. accept/reject any \"queue join requests\"\r\n \r\n # if queue is empty:\r\n # fast forward to next process\r\n # put that process into queue\r\n # reasoning: queue is currently empty, we don't lose anything if we just put process into queue\r\n # it gets popped out immediately later anyway\r\n # continue\r\n # else queue is not empty:\r\n # pop first process --> fast forward until done process\r\n # admit any process requesting to join queue:\r\n # while (next_process.time <= cur_time): admit into queue if possible\r\n if not queue:\r\n start, cost, i = queries.popleft()\r\n queue.append((start, cost, i))\r\n continue\r\n else:\r\n first_in_line_start, first_in_line_cost, cur_i = queue.popleft()\r\n next_available = max(next_available, first_in_line_start) + first_in_line_cost\r\n answer[cur_i] = next_available\r\n #print(cur_i)\r\n #print(next_available)\r\n #print(queue)\r\n #print(queries)\r\n cnt += 1\r\n while queries and queries[0][0] < next_available:\r\n if len(queue) >= b:\r\n f1, f2, cur_i = queries.popleft()\r\n answer[cur_i] = -1\r\n cnt += 1\r\n else:\r\n queue.append(queries.popleft())\r\nprint(answer)\r\n", "n,b = map(int,input().split())\r\nq= []\r\nans = 0\r\nfor i in range(n):\r\n t,d = map(int,input().split())\r\n while len(q) != 0 and q[0] <= t:\r\n q.pop(0)\r\n if len(q) <= b:\r\n ans = max(ans,t)+d\r\n print(ans,end=\" \")\r\n q.append(ans)\r\n else:\r\n print(-1,end=\" \")", "n, b = [int(item) for item in input().split()]\r\n\r\nqueue = []\r\n\r\nfor i in range(n):\r\n ti, di =[int(item) for item in input().split()]\r\n while len(queue) > 0 and queue[0] <= ti:\r\n queue.pop(0)\r\n if len(queue) - 1 == b:\r\n print(-1, end=' ')\r\n continue\r\n if not queue:queue.append(ti + di)\r\n else:queue.append(queue[-1] + di)\r\n\r\n print(queue[-1], end = \" \")", "import queue\r\nn, b = map(int, input().split())\r\nt = []\r\nd = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n t.append(x)\r\n d.append(y)\r\nq = queue.Queue()\r\ncurTime = 0\r\nans = [-1]n\r\n\r\nfor i in range(n):\r\n while (q.qsize() > 0 and curTime <= t[i]):\r\n query = q.get()\r\n curTime += d[query]\r\n ans[query] = curTime\r\n curTime = max(curTime, t[i])\r\n if (q.qsize() >= b):\r\n ans[i] = -1\r\n else:\r\n q.put(i)\r\n\r\nwhile (not q.empty()):\r\n query = q.get()\r\n curTime += d[query]\r\n ans[query] = curTime\r\n\r\nfor v in ans:\r\n print(\"{} \".format(v), end=\"\")\r\n\r\n", "import queue\r\n\r\nq = queue.Queue()\r\nans = [0] * 200000\r\nn, b = map(int, input().split())\r\ntmp = 0\r\nans[0] = tmp\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n while q.empty() == False and q.queue[0] <= t:\r\n q.get()\r\n if q.qsize() > b:\r\n ans[i] = -1\r\n else:\r\n tmp = max(tmp, t) + d\r\n ans[i] = tmp\r\n q.put(tmp)\r\nfor i in range(n):\r\n print(ans[i], end = ' ')", "import sys\r\n#input = sys.stdin.readline\r\n\r\nq = []\r\nn,b = map(int,input().split())\r\nt = 0\r\nd = 0\r\nfor i in range(0,n):\r\n t,d = map(int,input().split())\r\n while (len(q)!=0):\r\n if(q[0]<=t):\r\n q.pop(0)\r\n else:\r\n break\r\n if(len(q) <= b):\r\n if(len(q)!=0):\r\n t = q[-1]\r\n t = t + d\r\n print(t,end = ' ')\r\n q.append(t)\r\n else:\r\n print(-1,end = ' ')", "n, maxq = map(int, input().split())\r\n\r\nfrom collections import deque\r\n\r\nmess = []\r\nqueue = deque()\r\n\r\n\r\nfor i in range(n):\r\n time, duration = map(int, input().split())\r\n\r\n while queue and queue[0] <= time:\r\n queue.popleft()\r\n if not queue:\r\n queue.append(time + duration)\r\n mess.append(time + duration)\r\n continue\r\n else:\r\n if len(queue) <= maxq:\r\n queue.append(queue[-1] + duration)\r\n mess.append(queue[-1])\r\n else:\r\n mess.append(-1)\r\n\r\nprint(' '.join(map(str, mess)))\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n, b = map(int, input().split())\r\nq = []\r\nl = 0\r\nr = 0\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n while l != r:\r\n if q[l] <= t:\r\n l += 1\r\n else:\r\n break\r\n len_queue = r - l - 1 \r\n if len_queue >= b:\r\n print(-1, end = ' ')\r\n else:\r\n if l == r:\r\n q.append(t + d)\r\n else:\r\n q.append(q[-1] + d)\r\n r += 1\r\n print(q[-1])", "class Query:\r\n\tdef __init__(self, id, t_toi, t_tt):\r\n\t\tself.id = id\r\n\t\tself.t_toi = t_toi\r\n\t\tself.t_tt = t_tt\r\n\r\nimport queue\r\n\r\nn, b = map(int, input().split())\r\nq = queue.Queue()\r\n\r\nt_process = 0\r\n\r\nans = [0]n\r\n\r\nfor i in range(n):\r\n\tt_toi, t_tt = map(int, input().split())\r\n\twhile q.qsize() > 0 and t_toi >= t_process:\r\n\t\tfront = q.get()\r\n\t\tt_process += front.t_tt\r\n\t\tans[front.id] = t_process\r\n\tif t_toi > t_process:\r\n\t\tt_process = t_toi + t_tt\r\n\t\tans[i] = t_process\r\n\telif q.qsize() < b:\r\n\t\tq.put(Query(i, t_toi, t_tt))\r\n\telse:\r\n\t\tans[i] = -1\r\n\r\nwhile q.qsize() > 0:\r\n\tfront = q.get()\r\n\tt_process += front.t_tt\r\n\tans[front.id] = t_process\r\n\r\nfor i in ans:\r\n\tprint(i,end=\" \")\r\n", "from collections import deque\r\nn, b = map(int,input().split())\r\nq = deque()\r\nans = []\r\nfor i in range(n):\r\n ti, di = map(int,input().split())\r\n while q and ti >= q[0]:\r\n q.popleft()\r\n if len(q) > b:\r\n ans.append(-1)\r\n elif q:\r\n ans.append(q[-1]+di)\r\n q.append(q[-1]+di)\r\n else:\r\n ans.append(ti+di)\r\n q.append(ti+di)\r\nprint(ans)", "import queue\nclass query:\n def __init__(self, id, t, d):\n self.id = id\n self.t = t\n self.d = d\n\n\nq = queue.Queue()\nres = 0\nh = 0\ntam = 0\nn, mq = map(int, input().split())\nx = []\nfor i in range(n):\n t, d = map(int, input().split())\n x.append((t,d))\na =[-1]n\nq.put(query(0, x[0][0], x[0][1]))\nk = 0\ni = 1\nwhile q.qsize() != 0:\n res = max(res, q.queue[0].t) + (q.queue[0].d)\n a[q.queue[0].id] = res\n q.get()\n while i < n and q.qsize() < mq:\n q.put(query(i, x[i][0], x[i][1]))\n i += 1\n while i < n and res > x[i][0]:\n i += 1\n k += 1\n\nfor i in a:\n print(i, end = ' ')\n \t \t\t \t\t \t \t\t\t\t \t\t \t \t\t", "n, m = map(int, input().split())\r\n\r\nq = []\r\ntime_free = 0\r\nresult = []\r\nfor _ in range(n):\r\n s, t = map(int, input().split())\r\n\r\n while q and q[0] <= s:\r\n q = q[1:]\r\n\r\n if s < time_free:\r\n if len(q) == m:\r\n result.append(-1)\r\n else:\r\n q.append(time_free)\r\n time_free += t\r\n result.append(time_free)\r\n else:\r\n time_free = max(time_free, s) + t\r\n result.append(time_free)\r\n\r\n\r\nfor time in result:\r\n print(time, end=\" \")\r\n", "def main():\r\n n, b = map(int, input().split())\r\n\r\n def endgen():\r\n res = [0]\r\n q = 0\r\n\r\n for _ in range(n):\r\n t, d = map(int, input().split())\r\n res.append(t + d if t > res[-1] else res[-1] + d)\r\n\r\n while res[q] <= t:\r\n q += 1\r\n\r\n if len(res) - q - 1 > b:\r\n res.pop()\r\n yield \"-1\"\r\n else:\r\n yield str(res[-1])\r\n\r\n print(' '.join(endgen()))\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from sys import maxsize as m\r\nfrom itertools import product as P \r\nclass Solution:\r\n def bazinga(self,N,p):\r\n pass \r\n\r\nif __name__=='__main__':\r\n n,b = map(int,input().split(' '))\r\n ct,pt,lpt,cb = 0,0,[],0\r\n result = []\r\n for i in range(n):\r\n ti,di = map(int,input().split())\r\n #print(pt,lpt,'--',ti,di,cb)\r\n res = 0\r\n if pt==0:\r\n pt+= ti+di\r\n lpt += [pt]\r\n res = pt\r\n else:\r\n if ti<lpt[0]:\r\n if cb<b:\r\n pt+= di\r\n lpt+=[pt]\r\n res = pt\r\n cb+=1\r\n elif cb>=b:\r\n res = -1\r\n \r\n elif ti>=lpt[0]:\r\n #print(lpt,pt,ti,di)\r\n if ti>lpt[-1]:\r\n pt+=abs(lpt[-1]-ti)+di\r\n else: pt+=di\r\n lpt+=[pt]\r\n res = pt\r\n cb+=1\r\n while ti>=lpt[0]:\r\n if len(lpt)==1: break\r\n lpt.pop(0)\r\n if cb>0: cb-=1\r\n \r\n result += (str(res),)\r\n print(' '.join(result))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \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 heapq\r\n\r\nclass Query:\r\n def __init__(self, start_time, finish_time):\r\n self.start_time = start_time\r\n self.finish_time = finish_time\r\n\r\n def __lt__(self, other):\r\n return self.finish_time < other.finish_time\r\n\r\nn, b = map(int, input().split())\r\nquery_queue = []\r\ntime = 0\r\n\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n \r\n # remove completed queries\r\n while query_queue and query_queue[0].finish_time <= t:\r\n heapq.heappop(query_queue)\r\n \r\n # check if the server is busy\r\n if len(query_queue) < b+1:\r\n if time <= t:\r\n time = t\r\n heapq.heappush(query_queue, Query(time, time + d))\r\n print(time + d, end=' ')\r\n time += d\r\n else:\r\n print(\"-1\", end=' ')\r\n", "def main():\n n, hi = map(int, input().split())\n l, res, lo, hi = [0], [], 0, -hi\n f, p = res.append, l.append\n for _ in range(n):\n t, d = map(int, input().split())\n d += t if t > l[-1] else l[-1]\n while lo <= hi and l[lo] <= t:\n lo += 1\n if hi >= lo:\n f(\"-1\")\n else:\n hi += 1\n p(d)\n f(d)\n print(' '.join(map(str, res)))\n\n\nif __name__ == '__main__':\n main()\n", "import os\r\ns = input().split(' ')\r\nn = int(s[0])\r\nb = int(s[1])\r\n\r\nrequests = [[]] n\r\n\r\nfor i in range(n):\r\n s = input().split(' ')\r\n requests[i] = [int(s[0]), int(s[1])]\r\n\r\nresult = [0] * n\r\ncounter = 1\r\ntime = 0\r\nqueue = []\r\n\r\ntime = requests[0][0]\r\n\r\nqueue = [[0, requests[0][1]]]\r\n\r\nwhile(counter < n):\r\n if(len(queue) != 0):\r\n if(queue[0][1] <= requests[counter][0] - time):\r\n time += queue[0][1]\r\n result[queue[0][0]] = str(time)\r\n queue = queue[1:]\r\n else:\r\n queue[0][1] -= requests[counter][0] - time\r\n time = requests[counter][0]\r\n if(len(queue) < b + 1):\r\n queue += [[counter, requests[counter][1]]]\r\n else:\r\n result[counter] = '-1'\r\n counter += 1\r\n else:\r\n time = requests[counter][0]\r\n queue += [[counter, requests[counter][1]]]\r\n counter += 1\r\n\r\nfor i in range(len(queue)):\r\n time += queue[i][1]\r\n result[queue[i][0]] = time\r\n\r\nprint()\r\ns = ''\r\nfor i in range(len(result)):\r\n s += str(result[i]) + ' '\r\nprint(s)", "\r\nimport queue\r\n\r\nn, b = map(int, input().split())\r\nresult = [0] * n\r\nlast_processing = 0\r\nwaiting_queue = queue.Queue()\r\nfor i in range(n):\r\n ti, di = map(int, input().split())\r\n while waiting_queue.qsize() > 0 and last_processing <= ti:\r\n last_processing = max(last_processing, waiting_queue.queue[0]['time']) + waiting_queue.queue[0]['take_time']\r\n result[waiting_queue.queue[0]['index']] = last_processing\r\n waiting_queue.get()\r\n if waiting_queue.qsize() < b:\r\n waiting_queue.put({'index': i, 'time': ti, 'take_time': di})\r\n else:\r\n result[i] = -1\r\n\r\nwhile waiting_queue.qsize() > 0:\r\n last_processing = max(last_processing, waiting_queue.queue[0]['time']) + waiting_queue.queue[0]['take_time']\r\n result[waiting_queue.queue[0]['index']] = last_processing\r\n waiting_queue.get()\r\nprint(result, sep=' ')\r\n", "from collections import deque\r\nwhile True:\r\n\ttry:\r\n\t\tn, max_queue_lenth = map(int, input().split())\r\n\texcept EOFError:\r\n\t\tbreak\r\n\r\n\tqueue = deque()\r\n\tresponses = []\r\n\tfor i in range(n):\r\n\t\ttime, duration = tuple(map(int, input().split()))\r\n\t\twhile queue and queue[0]<=time:\r\n\t\t\tqueue.popleft()\r\n\t\tif not queue:\r\n\t\t\tqueue.append(time+duration)\r\n\t\t\tresponses.append(time+duration)\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tif len(queue)<=max_queue_lenth:\r\n\t\t\t\tqueue.append(queue[-1]+duration)\r\n\t\t\t\tresponses.append(queue[-1])\r\n\t\t\telse:\r\n\t\t\t\tresponses.append(-1)\r\n\tprint(\" \".join(map(str, responses)))", "#! /usr/bin/env python3\n'''\n' Title:\t\n' Author:\tCheng-Shih, Wong\n' Date:\t\t\n'''\nfrom collections import deque\n\nn, b = map(int, input().split())\n\nquery = {}\ntm = []\nque = deque()\nans = {}\n\nfor i in range(n):\n\tu, v = map(int, input().split())\n\tquery[u] = v\n\ttm.append(u)\n\net = 0\n\nfor ti in tm:\n\twhile ti>et and len(que)>0:\n\t\tcur = que.popleft()\n\t\tet += query[cur]\n\t\tans[cur] = et\n\n\tif ti>et:\n\t\tet = ti+query[ti]\n\t\tans[ti] = et\n\telif ti==et:\n\t\tif len(que) > 0:\n\t\t\tcur = que.popleft()\n\t\t\tet = ti+query[cur]\n\t\t\tans[cur] = et\n\t\tque.append(ti)\n\telse:\n\t\tif len(que) >= b:\n\t\t\tans[ti] = -1\n\t\telse:\n\t\t\tque.append(ti)\n\nwhile len(que)>0:\n\tcur = que.popleft()\n\tet += query[cur]\n\tans[cur] = et\n\nouts = ''\nspace = False\n\nfor ti in tm:\n\tif space: outs += ' '\n\telse: space = True\n\touts += str(ans[ti])\n\nprint(outs)\n\t\t\n", "import queue\r\ndef processing_queries(n,b,q):\r\n result=[]\r\n finished=q[0][0]+q[0][1]\r\n result.append(finished)\r\n queries=queue.Queue()\r\n queries.put(finished)\r\n for i in range(1,len(q)):\r\n while queries.qsize() > 0 and q[i][0] >= queries.queue[0]:\r\n queries.get()\r\n if finished <= q[i][0]:\r\n finished=q[i][0]+q[i][1]\r\n result.append(finished)\r\n queries.put(finished)\r\n else:\r\n if queries.qsize() > b:\r\n result.append(-1)\r\n else:\r\n finished+=q[i][1]\r\n result.append(finished)\r\n queries.put(finished)\r\n print (result)\r\n \r\nn,b=[int(x) for x in input().split()]\r\nlist_of_queries=[]\r\nfor i in range(n):\r\n this_q=[int(x) for x in input().split()]\r\n list_of_queries.append(this_q)\r\n#processing_queries(5,1,[[2,9],[4,8],[10,9],[15,2],[19,1]])\r\nprocessing_queries(n,b,list_of_queries)\r\n \r\n ", "from collections import deque\r\nfrom collections import namedtuple\r\nQuery = namedtuple(\"Query\", [\"time\", \"duration\"])\r\nquery_number, max_query_queue_length = map(int, input().split())\r\nqueries = deque(Query(map(int, input().split())) for i in range(query_number))\r\nresults = {}\r\nquery_queue = deque()\r\ncurrent_time = 0\r\nwhile len(results) != query_number:\r\n if query_queue:\r\n query = query_queue.popleft()\r\n else:\r\n query = queries.popleft()\r\n if current_time > query.time:\r\n current_time += query.duration\r\n else:\r\n current_time = query.time + query.duration\r\n results[query.time] = current_time\r\n while queries and queries[0].time < current_time:\r\n if len(query_queue) < max_query_queue_length:\r\n query_queue.append(queries.popleft())\r\n else:\r\n ignored_query = queries.popleft()\r\n results[ignored_query.time] = -1\r\nprint(\" \".join(str(results[time]) for time in sorted(results.keys())))\r\n", "def main():\r\n read = lambda: map(int, input().split())\r\n n, b = read()\r\n from collections import deque\r\n Q = deque()\r\n ans = [0] n\r\n for i in range(n):\r\n t, d = read()\r\n while len(Q) > 0 and t >= Q[0]:\r\n Q.popleft()\r\n if len(Q) == 0:\r\n cur = t + d\r\n elif len(Q) < b + 1:\r\n cur = Q[-1] + d\r\n else:\r\n cur = -1\r\n ans[i] = cur\r\n if cur != -1:\r\n Q.append(cur)\r\n print(' '.join(map(str, ans)))\r\nmain()\r\n", "n,b=map(int,input().split())\r\ndef Q():\r\n a=[0];l=0\r\n for i in range(n):\r\n t,d=map(int,input().split())\r\n a+=[t+d if t>a[-1] else a[-1]+d]\r\n while a[l]<=t: l+=1\r\n if len(a)-l-1>b: a.pop(); yield \"-1\"\r\n else: yield str(a[-1])\r\nprint(' '.join(Q()))", "import queue\r\n\r\nclass Query:\r\n def __init__ (self, _id, _t, _d):\r\n self.id = _id\r\n self.t = _t\r\n self.d = _d\r\n\r\nn, b = map(int, input().split())\r\nans = [0]n\r\nq = queue.Queue()\r\nlast_time = 0\r\nfor i in range(n): #time = 11, t = 10, queue=[4], b = 1\r\n t, d = map(int, input().split())\r\n while q.qsize() > 0 and t >= last_time:\r\n front = q.get()\r\n last_time += front.d\r\n ans[front.id] = last_time\r\n if t > last_time:\r\n last_time = t + d\r\n ans[i] = last_time\r\n elif q.qsize() < b:\r\n q.put(Query(i, t, d))\r\n else:\r\n ans[i] = -1\r\nwhile q.qsize() > 0:\r\n front = q.get()\r\n last_time += front.d\r\n ans[front.id] = last_time\r\nfor x in ans:\r\n print(x, end=' ')", "import sys\ninput = sys.stdin.readline\n\nq = []\nprocessing = 0\n\nn, b = map(int, input().split())\n\nfor _ in range(n):\n t, d = map(int, input().split())\n \n while len(q) != 0 and q[0] <= t:\n q.pop(0)\n \n if len(q) <= b:\n processing = max(processing, t) + d\n print(processing, end=' ')\n q.append(processing)\n else:\n print(-1,end=' ')", "from collections import deque\r\nn, d =map(int,(input().split()))\r\nper = input().split()\r\nt = int(per[0])+int(per[1])\r\nper = 0\r\nprint(t, end = ' ')\r\nanswer = t\r\nqueue = deque()\r\nfor i in range(n-1):\r\n per1, per2 = map(int, input().split())\r\n \r\n while t< per1:\r\n if per >= 1:\r\n s = queue.pop()\r\n \r\n t += s\r\n per-=1\r\n else:\r\n t = per1\r\n answer = t\r\n if t == per1:\r\n if per >= 1:\r\n s = queue.pop()\r\n \r\n per-=1\r\n t+= s\r\n if per < d:\r\n answer+=per2\r\n print(answer, end = ' ')\r\n queue.appendleft(per2)\r\n per+=1\r\n \r\n else:\r\n answer = answer+per2\r\n print(answer, end = ' ')\r\n queue.appendleft(per2)\r\n \r\n per = 1\r\n \r\n else:\r\n if per < d:\r\n answer = answer+per2\r\n queue.appendleft(per2)\r\n print(answer, end = ' ')\r\n per+=1\r\n else:\r\n print(-1,end = ' ')\r\n \r\n \r\n", "n, b = map(int, input().split())\ntasks = []\nnext_task = 0\ntime = 0\nfinish = [-1]n\nfor i in range(n):\n t, d = map(int, input().split())\n while tasks and next_task < len(tasks) and time <= t:\n time += tasks[next_task][1]\n finish[tasks[next_task][0]] = time\n next_task += 1\n if len(tasks) - next_task < b:\n tasks.append((i, d))\n time = max(t, time)\nwhile tasks and next_task < len(tasks):\n time += tasks[next_task][1]\n finish[tasks[next_task][0]] = time\n next_task += 1\nprint(finish)\n", "import sys\r\nfrom collections import deque\r\n# sys.stdin = open(\"ivo.in\")\r\nn, b = map(int, sys.stdin.readline().split())\r\nb += 1\r\nq = deque()\r\nres = []\r\ncur_time = 0\r\nfor iter in range(n):\r\n t, d = map(int, sys.stdin.readline().split())\r\n while len(q) > 0 and q[0] <= t:\r\n q.popleft()\r\n if len(q) >= b:\r\n res.append(-1)\r\n continue\r\n if len(q) == 0:\r\n res.append(t + d)\r\n q.append(t + d)\r\n else:\r\n res.append(q[-1] + d)\r\n q.append(q[-1] + d)\r\nprint(\" \".join(map(str, res)))", "n,b=map(int,input().split())\r\nl=[tuple(map(int,input().split())) for i in range(n)]\r\nch=[0]\r\nans=[]\r\nbd=[0](n+1)\r\npo=ma=0\r\nfor i in range(n):\r\n t,d=l[i]\r\n bd[i]=bd[i-1]\r\n ch+=[max(ma,t)+d]\r\n while ch[po]<=t: po+=1\r\n if i-po-(bd[i-1]-bd[po-1])==b: bd[i]+=1; ch[-1]=-1\r\n if ch[-1]>ma: ma=ch[-1]\r\n ans+=[str(ch[-1])]\r\nprint(' '.join(ans))", "def main():\n n, hi = map(int, input().split())\n l, res, lo, hi = [0], [], 0, -hi\n f = res.append\n for _ in range(n):\n t, d = map(int, input().split())\n l.append((t if t > l[-1] else l[-1]) + d)\n hi += 1\n while l[lo] <= t:\n lo += 1\n if hi > lo:\n hi -= 1\n del l[-1]\n f(-1)\n else:\n f(l[-1])\n print(' '.join(map(str, res)))\n\n\nif __name__ == '__main__':\n main()\n", "from collections import deque\r\nn, k = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n arr.append([a, b, i+1])\r\ndeq = deque([arr[0]])\r\nat = 1\r\ntime = arr[0][0]\r\nans = [-1] * n\r\nwhile(deq):\r\n a, b, idx = deq.popleft()\r\n if(a > time):\r\n time = a + b\r\n else:\r\n time += b\r\n ans[idx-1] = time\r\n while(at < n and arr[at][0] < time):\r\n if(len(deq) < k):\r\n deq.append(arr[at])\r\n at += 1\r\n if(at < n and len(deq) <= k and arr[at][0] == time):\r\n deq.append(arr[at])\r\n at += 1\r\n while(at < n and len(deq)<k):\r\n deq.append(arr[at])\r\n at+=1\r\n # print(deq)\r\nprint(ans)\r\n", "import sys\r\nimport collections\r\nn, queue_size = map(int, input().split())\r\n\r\nresults = [-1 for _ in range(n)]\r\n\r\nnext_server_free_time = 1\r\nqueue = collections.deque()\r\nfor idx, line in enumerate(sys.stdin):\r\n t, d = map(int, line.split())\r\n\r\n while queue and next_server_free_time <= t:\r\n idx1, d1 = queue.popleft()\r\n next_server_free_time += d1\r\n results[idx1] = next_server_free_time\r\n\r\n if next_server_free_time <= t:\r\n results[idx] = t + d\r\n next_server_free_time = t + d\r\n else:\r\n if len(queue) < queue_size:\r\n queue.append((idx, d))\r\n\r\nwhile queue:\r\n idx, d = queue.popleft()\r\n next_server_free_time += d\r\n results[idx] = next_server_free_time\r\n\r\nprint(' '.join(map(str, results)))", "from collections import deque\r\n\r\nn, b = map(int, input().split())\r\n\r\nq = deque()\r\nfor _ in range(n):\r\n t, d = map(int, input().split())\r\n while q and q[0] <= t:\r\n q.popleft()\r\n if len(q) == b + 1:\r\n print(-1, end = ' ')\r\n else:\r\n if q:\r\n t = q[-1]\r\n print(t + d, end = ' ')\r\n q.append(t + d)\r\n", "import queue\r\nn, b = map(int, input().split())\r\nq = queue.Queue()\r\nprocessing = 0\r\n \r\nfor _ in range(n):\r\n t, d = map(int, input().split())\r\n \r\n while q.qsize() != 0 and t >= q.queue[0]:\r\n q.get()\r\n \r\n if q.qsize() <= b:\r\n processing = max(t, processing) + d\r\n q.put(processing)\r\n print(processing, end=' ')\r\n else:\r\n print(-1, end=' ')\r\n", "#!/usr/bin/python3\n\n# def gen(n, b):\n# \timport random\n# \tyield '{} {}'.format(n, b)\n# \tt = 0\n# \tfor i in range(n):\n# \t\tt += random.randrange(1, 1e7)\n# \t\td = random.randrange(1, 1e7)\n# \t\tyield '{} {}\\n'.format(t, d)\n\n# def input():\n# \tg = gen(200000, 200000)\n\n# \treturn next(g)\n\nn, b = map(int, input().split())\n\nends = []\n\nfor i in range(n):\n\tt, d = map(int, input().split())\n\n\twhile len(ends) > 0 and ends[0] <= t:\n\t\tends.pop(0)\n\n\tq = len(ends) - 1\n\n\tif q == b:\n\t\tprint(-1, end=' ')\n\t\tcontinue\n\n\tif not ends:\n\t\tends.append(t + d)\n\telse:\n\t\tends.append(ends[-1] + d)\n\n\tprint(ends[-1], end=' ')\n", "n, b = map(int, input().split())\r\n\r\nque = []\r\n\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n while (len(que) > 0) and (t >= que[0]):\r\n que.pop(0)\r\n if (len(que) <= b):\r\n ans = t + d if (len(que) == 0) else que[-1] + d\r\n print(ans, end = ' ')\r\n que.append(ans)\r\n else : print(-1, end = ' ')", "import queue\r\nclass query:\r\n def __init__(self, id, t, d):\r\n self.id = id\r\n self.t = t\r\n self.d = d\r\n\r\nq = queue.Queue()\r\nres = 0\r\nn, mq = map(int, input().split())\r\nx = []\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n x.append((t,d))\r\n\r\na =[-1]n\r\nq.put(query(0, x[0][0], x[0][1]))\r\ni = 1\r\nwhile q.qsize() != 0:\r\n res = max(res, q.queue[0].t) + (q.queue[0].d)\r\n a[q.queue[0].id] = res\r\n q.get()\r\n while i < n and q.qsize() < mq:\r\n q.put(query(i, x[i][0], x[i][1]))\r\n i += 1\r\n while i < n and res > x[i][0]:\r\n i += 1\r\n\r\nfor i in a:\r\n print(i, end = ' ')", "import queue\r\n\r\nn, b = map(int, input().split(\" \"))\r\nserver = queue.Queue()\r\ntime = 0\r\nfor i in range(n):\r\n t, d = map(int, input().split(\" \"))\r\n\r\n while server.qsize() > 0 and t >= server.queue[0]:\r\n server.get()\r\n if server.qsize() <= b:\r\n time = max(time, t) + d\r\n server.put(time)\r\n print(time, end = \" \")\r\n else:\r\n print(-1, end = \" \")", "import queue\r\nimport sys\r\n\r\nsys.setrecursionlimit(100000)\r\n\r\n# global constant\r\nINF = int(1e7 + 1)\r\nMAX = 105\r\n\r\n# For testing\r\n#sys.stdin = open(\"INP.txt\", 'r')\r\n#sys.stdout = open(\"OUT.txt\", 'w')\r\n\r\n\r\ndef main():\r\n n, b = map(int, input().split())\r\n t, d = [], []\r\n for i in range(n):\r\n x, y = map(int, input().split())\r\n t.append(x)\r\n d.append(y)\r\n t.append(INF)\r\n d.append(INF)\r\n actual_time = time_done = 0\r\n Q = queue.Queue()\r\n Q.put(0)\r\n i = 0\r\n while not Q.empty() or i < n:\r\n if (not Q.empty() and time_done <= actual_time) or i == n:\r\n cur = Q.get()\r\n t[cur] = max(time_done, t[cur])+d[cur]\r\n time_done = t[cur]\r\n if i != 0 and i != n:\r\n if Q.qsize() < b:\r\n Q.put(i)\r\n else:\r\n t[i] = -1\r\n if i != n:\r\n i += 1\r\n actual_time = t[i]\r\n for i in range(n):\r\n print(t[i], end=' ')\r\n\r\n\r\nmain()\r\n", "def main():\n from collections import deque\n a = deque()\n n, b = map(int, input().split())\n next_t = 0\n for i in range(n):\n c, lo = map(int, input().split())\n while a and a[0] <= c:\n a.popleft()\n if len(a) > b:\n print(-1, end=' ')\n else:\n print(max(next_t, c) + lo, end=' ')\n next_t = max(next_t, c) + lo\n a.append(next_t)\nmain()", "import queue\r\n\r\n\r\nclass Query:\r\n def __init__(self, t, d, res=0):\r\n self.t = t\r\n self.d = d\r\n\r\n\r\nn, b = map(int, input().split())\r\nQuery_q = []\r\n\r\nfor i in range(n):\r\n tmp1, tmp2 = map(int, input().split())\r\n new_q = Query(tmp1, tmp2)\r\n Query_q.append(new_q)\r\n\r\n\r\nres = [0]*n\r\ncur_query = queue.Queue()\r\nprocessing_end = 0\r\nfor i in range(n):\r\n while (not cur_query.empty() and cur_query.queue[0] <= Query_q[i].t):\r\n cur_query.get()\r\n\r\n if (cur_query.empty()):\r\n processing_end = Query_q[i].t\r\n if (cur_query.qsize() <= b):\r\n processing_end += Query_q[i].d\r\n res[i] = processing_end\r\n cur_query.put(res[i])\r\n else:\r\n res[i] = -1\r\n\r\nfor i in range(n):\r\n print(res[i], end=\" \")\r\n" ]	{"inputs": ["5 1\n2 9\n4 8\n10 9\n15 2\n19 1", "4 1\n2 8\n4 8\n10 9\n15 2", "1 1\n1000000000 1000000000", "4 3\n999999996 1000000000\n999999997 1000000000\n999999998 1000000000\n999999999 1000000000", "5 1\n2 1\n3 6\n4 5\n6 4\n7 2", "10 2\n4 14\n5 2\n6 6\n7 11\n8 6\n9 5\n10 13\n11 8\n13 2\n20 2", "6 4\n2 4\n4 2\n5 2\n6 2\n7 2\n9 2", "8 3\n1 2\n3 1\n4 3\n5 3\n6 1\n7 2\n8 8\n9 7", "10 3\n1 14\n3 2\n5 4\n6 9\n9 1\n12 22\n15 11\n18 8\n28 2\n29 4", "5 2\n2 7\n3 3\n7 4\n9 1\n10 2", "4 1\n2 1\n6 5\n9 2\n10 3", "4 1\n1 2\n2 1\n3 1\n4 3", "6 3\n1 2\n2 3\n100 200\n200 300\n10000 20000\n20000 30000"], "outputs": ["11 19 -1 21 22 ", "10 18 27 -1 ", "2000000000 ", "1999999996 2999999996 3999999996 4999999996 ", "3 9 14 -1 -1 ", "18 20 26 -1 -1 -1 -1 -1 -1 28 ", "6 8 10 12 14 16 ", "3 4 7 10 11 13 21 -1 ", "15 17 21 30 -1 -1 41 49 51 -1 ", "9 12 16 17 -1 ", "3 11 13 -1 ", "3 4 5 8 ", "3 6 300 600 30000 60000 "]}	UNKNOWN	PYTHON3	CODEFORCES	56
8b980c9c96fff0ee36b71d033b996015	Lucky Permutation	A permutation p of size n is the sequence p1,<=p2,<=...,<=pn, consisting of n distinct integers, each of them is from 1 to n (1<=≤<=pi<=≤<=n). A lucky permutation is such permutation p, that any integer i (1<=≤<=i<=≤<=n) meets this condition ppi<==<=n<=-<=i<=+<=1. You have integer n. Find some lucky permutation p of size n. The first line contains integer n (1<=≤<=n<=≤<=105) — the required permutation size. Print "-1" (without the quotes) if the lucky permutation p of size n doesn't exist. Otherwise, print n distinct integers p1,<=p2,<=...,<=pn (1<=≤<=pi<=≤<=n) after a space — the required permutation. If there are multiple answers, you can print any of them. Sample Input 1 2 4 5 Sample Output 1 -1 2 4 1 3 2 5 3 1 4	[ "n=int(input())\r\nif (n//2)&1:\r\n\tprint(-1)\r\nelse:\r\n\tans=[0](n+1)\r\n\tfor i in range(1,(n//2)+1,2):\r\n\t\tans[i]=i+1\r\n\t\tans[i+1]=n-i+1\r\n\t\tans[n-i+1]=n-i\r\n\t\tans[n-i]=i\r\n\tif n%2:\r\n\t\tans[(n//2)+1]=(n//2)+1\r\n\tprint(ans[1:])\r\n", "n = int(input())\r\neven = []\r\nodd = []\r\nfor i in range(1,n+1):\r\n if i%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif n%4==0 or n%4==1:\r\n ans=[0]n\r\n temp = n\r\n for i in range(0, n // 2, 2):\r\n ans[i] = i+2\r\n ans[i+1]=temp\r\n ans[n-i-1]=temp-1\r\n ans[n-i-2]=i+1\r\n temp-=2\r\n if n%4==1:\r\n ans[n//2]=n//2+1\r\n print(ans)\r\nelse:\r\n print(-1)", "n = int(input())\r\nif n%4 > 1:\r\n print(-1)\r\nelse:\r\n a = [n+1>>1]n\r\n for i in range(n//4):\r\n j = i2\r\n a[j], a[j+1], a[-2-j], a[-1-j] = j+2, n-j, j+1, n-1-j\r\n print(' '.join(map(str, a)))", "'''\r\nCreated on\r\n\r\n@author: linhz\r\n'''\r\nimport sys\r\nusedNum=0\r\nn=int(input())\r\np=[0 for i in range(n+1)]\r\nusedNum=0\r\nif n%4==3 or n%4==2:\r\n print(-1)\r\nelse:\r\n i=1\r\n j=n\r\n a=1\r\n b=n\r\n while j>i:\r\n p[i]=a+1\r\n p[i+1]=b\r\n p[j]=b-1\r\n p[j-1]=a\r\n i+=2\r\n j-=2\r\n a+=2\r\n b-=2\r\n if j==i:\r\n p[i]=a\r\n ans=\"\"\r\n for i in range(1,n+1):\r\n ans+=str(p[i])+\" \"\r\n print(ans)", "import sys\n\ndef read(T=int,s=\" \"):\n\treturn [T(i) for i in sys.stdin.readline().split(s)]\n\ndef main():\n\tn=read()[0]\n\t\"\"\"\n\t\teither 4n or 4n + 1 uwu?\n\t\"\"\"\n\tif n%4!=1 and n%4!=0:\n\t\tprint(-1)\n\t\treturn\n\tres=[(n+1)//2 for i in range(n)]\n\tfor i in range(0,n//2,2):\n\t\tx,y,z,w=[i,i+1,n-2-i,n-1-i]\n\t\tres[x]=y+1\n\t\tres[y]=w+1\n\t\tres[w]=z+1\n\t\tres[z]=x+1\n\n\tfor i in range(0,n):\n\t\tprint(res[i],end=\" \")\n\tprint()\n\t\t\nmain()\n \t \t \t \t \t \t\t\t \t\t\t\t\t\t \t \t\t", "n = int(input())\r\np = [0] * n\r\n\r\nif n == 1:\r\n print(1)\r\n exit()\r\n\r\nfor sh in range(n // 4):\r\n p[n - sh * 2 - 2] = n - sh * 2\r\n p[sh * 2] = n - 1 - sh * 2\r\n p[n - sh * 2 - 1] = 2 + sh * 2\r\n p[sh * 2 + 1] = 1 + sh * 2\r\n\r\nif n % 4 == 1:\r\n p[n // 2] = n // 2 + 1\r\n\r\nif n % 4 == 2:\r\n print(-1)\r\n exit()\r\n\r\nif n % 4 == 3:\r\n print(-1)\r\n exit()\r\n\r\nprint(\" \".join([str(i) for i in p]))", "n = int(input())\r\nif n%4==2 or n%4==3:\r\n\tprint(-1)\r\nelse:\r\n\tans = [0]n\r\n\tfor i in range(0, n//2, 2):\r\n\t\tans[i] = i+2\r\n\t\tans[i+1] = n-i\r\n\t\tans[n-i-1] = n-i-1\r\n\t\tans[n-i-2] = i+1\r\n\tif n%4 == 1:\r\n\t\tans[n//2] = n//2 + 1\r\n\tprint(ans)", "n = int(input())\r\nif n % 4 > 1: print(-1)\r\nelse:\r\n k = n // 2\r\n t = [0] * n\r\n for i in range(0, k, 2):\r\n t[i] = str(i + 2)\r\n for i in range(1, k, 2):\r\n t[i] = str(n - i + 1)\r\n if n & 1:\r\n k += 1\r\n t[k - 1] = str(k)\r\n for i in range(k, n, 2):\r\n t[i] = str(n - i - 1)\r\n for i in range(k + 1, n, 2):\r\n t[i] = str(i)\r\n print(' '.join(t))", "n=int(input())\r\nif n%4==2 or n%4==3:\r\n from sys import exit\r\n print(-1);exit()\r\nres,i=[0]n,0\r\nfor i in range(0,n//2,2):\r\n res[i],res[i+1]=i+2,n-i\r\n res[n-i-1],res[n-i-2]=n-i-1,i+1\r\n i+=2\r\nif n%4==1:res[n//2]=n//2+1\r\nprint(res)", "n = int(input())\n\n\n\nif n % 4 > 1:\n\n print(-1)\n\n exit()\n\n\n\na = [i for i in range(0, n+1)]\n\nfor i in range(1, n//2+1, 2):\n\n p, q, r, s = i, i+1, n-i,n-i+1\n\n a[p], a[q], a[r], a[s] = a[q], a[s], a[p], a[r]\n\n\n\ndef check(arr):\n\n for i in range(1, n+1):\n\n k = arr[i]\n\n if arr[arr[k]] != n-k+1:\n\n return False\n\n return True\n\n\n\n# print(check(a))\n\nprint(a[1:])\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nif n == 1:\r\n print(1)\r\n exit(0)\r\nelif n % 4 == 2 or n % 4 == 3:\r\n print(-1)\r\n exit(0)\r\n\r\nd = list(range(1, n+1))\r\ne = d.copy()\r\n\r\nfor i in range(0, n//2, 2):\r\n d[i] = i+2\r\n x = 0\r\n while x < 4:\r\n d[d[i]-1] = n - i\r\n i = d[i] - 1\r\n x += 1\r\n\r\nprint(' '.join(map(str, d)))\r\n", "n = int(input())\r\nif n%4 > 1:\r\n print(-1)\r\n exit()\r\na = [(n+1) // 2] n\r\nfor i in range(n//4):\r\n j = 2i\r\n a[j], a[j+1], a[-j-2], a[-j-1] = j+2, n-j, j+1, n-j-1\r\nprint(' '.join(map(str, a)))\r\n", "n=int(input())\r\nif n%4>1:print(-1)\r\nelse:\r\n ans=[i for i in range(1,n+1)]\r\n for i in range(0,n//2,2):\r\n ans[i]=i+2\r\n ans[i+1]=n-i\r\n ans[n-i-1]=n-i-1\r\n ans[n-i-2]=i+1\r\n print(ans)\r\n \r\n", "n=int(input())\n\nL=[0](n+1)\n\nX=[False](n+1)\n\nif(n%4!=0 and n%4!=1):\n print(-1)\n\nelse:\n for i in range(1,n+1):\n if(X[i]):\n continue\n X[i]=True\n X[n-i+1]=True\n for j in range(i+1,n+1):\n if(X[j]):\n continue\n X[j]=True\n X[n-j+1]=True\n L[i]=j\n L[n-i+1]=n-j+1\n L[j]=n-i+1\n L[n-j+1]=i\n break\n if(n%4==1):\n L[n//2+1]=n//2+1\n for i in range(1,n):\n print(L[i],end=\" \")\n print(L[n])\n \n", "n=int(input())\nif n==1:\n\tprint (1)\n\texit()\nif n%4>1:\n\tprint (-1)\n\texit()\nans=[-1]n\nleft=n\nstart=n-2\nnums=1\nnume=n\nwhile left>=4:\n\tans[start]=nums\n\tans[nums-1]=nums+1\n\tans[nums]=nume\n\tans[nume-1]=nume-1\n\tstart-=2\n\tnums+=2\n\tnume-=2\n\tleft-=4\n\t# print (ans)\nif left==1:\n\tans[start+1]=start+2\nprint (ans)" ]	{"inputs": ["1", "2", "4", "5", "3", "100000", "6", "7", "8", "9", "99997", "10000", "10001", "10002", "10003", "10004", "25", "29", "33", "9", "13", "17", "50001", "20001", "30001", "99996", "99999", "101", "505", "565"], "outputs": ["1 ", "-1", "2 4 1 3 ", "2 5 3 1 4 ", "-1", "2 100000 4 99998 6 99996 8 99994 10 99992 12 99990 14 99988 16 99986 18 99984 20 99982 22 99980 24 99978 26 99976 28 99974 30 99972 32 99970 34 99968 36 99966 38 99964 40 99962 42 99960 44 99958 46 99956 48 99954 50 99952 52 99950 54 99948 56 99946 58 99944 60 99942 62 99940 64 99938 66 99936 68 99934 70 99932 72 99930 74 99928 76 99926 78 99924 80 99922 82 99920 84 99918 86 99916 88 99914 90 99912 92 99910 94 99908 96 99906 98 99904 100 99902 102 99900 104 99898 106 99896 108 99894 110 99892 112 99890 114...", "-1", "-1", "2 8 4 6 3 5 1 7 ", "2 9 4 7 5 3 6 1 8 ", "2 99997 4 99995 6 99993 8 99991 10 99989 12 99987 14 99985 16 99983 18 99981 20 99979 22 99977 24 99975 26 99973 28 99971 30 99969 32 99967 34 99965 36 99963 38 99961 40 99959 42 99957 44 99955 46 99953 48 99951 50 99949 52 99947 54 99945 56 99943 58 99941 60 99939 62 99937 64 99935 66 99933 68 99931 70 99929 72 99927 74 99925 76 99923 78 99921 80 99919 82 99917 84 99915 86 99913 88 99911 90 99909 92 99907 94 99905 96 99903 98 99901 100 99899 102 99897 104 99895 106 99893 108 99891 110 99889 112 99887 114 ...", "2 10000 4 9998 6 9996 8 9994 10 9992 12 9990 14 9988 16 9986 18 9984 20 9982 22 9980 24 9978 26 9976 28 9974 30 9972 32 9970 34 9968 36 9966 38 9964 40 9962 42 9960 44 9958 46 9956 48 9954 50 9952 52 9950 54 9948 56 9946 58 9944 60 9942 62 9940 64 9938 66 9936 68 9934 70 9932 72 9930 74 9928 76 9926 78 9924 80 9922 82 9920 84 9918 86 9916 88 9914 90 9912 92 9910 94 9908 96 9906 98 9904 100 9902 102 9900 104 9898 106 9896 108 9894 110 9892 112 9890 114 9888 116 9886 118 9884 120 9882 122 9880 124 9878 126 9...", "2 10001 4 9999 6 9997 8 9995 10 9993 12 9991 14 9989 16 9987 18 9985 20 9983 22 9981 24 9979 26 9977 28 9975 30 9973 32 9971 34 9969 36 9967 38 9965 40 9963 42 9961 44 9959 46 9957 48 9955 50 9953 52 9951 54 9949 56 9947 58 9945 60 9943 62 9941 64 9939 66 9937 68 9935 70 9933 72 9931 74 9929 76 9927 78 9925 80 9923 82 9921 84 9919 86 9917 88 9915 90 9913 92 9911 94 9909 96 9907 98 9905 100 9903 102 9901 104 9899 106 9897 108 9895 110 9893 112 9891 114 9889 116 9887 118 9885 120 9883 122 9881 124 9879 126 9...", "-1", "-1", "2 10004 4 10002 6 10000 8 9998 10 9996 12 9994 14 9992 16 9990 18 9988 20 9986 22 9984 24 9982 26 9980 28 9978 30 9976 32 9974 34 9972 36 9970 38 9968 40 9966 42 9964 44 9962 46 9960 48 9958 50 9956 52 9954 54 9952 56 9950 58 9948 60 9946 62 9944 64 9942 66 9940 68 9938 70 9936 72 9934 74 9932 76 9930 78 9928 80 9926 82 9924 84 9922 86 9920 88 9918 90 9916 92 9914 94 9912 96 9910 98 9908 100 9906 102 9904 104 9902 106 9900 108 9898 110 9896 112 9894 114 9892 116 9890 118 9888 120 9886 122 9884 124 9882 126...", "2 25 4 23 6 21 8 19 10 17 12 15 13 11 14 9 16 7 18 5 20 3 22 1 24 ", "2 29 4 27 6 25 8 23 10 21 12 19 14 17 15 13 16 11 18 9 20 7 22 5 24 3 26 1 28 ", "2 33 4 31 6 29 8 27 10 25 12 23 14 21 16 19 17 15 18 13 20 11 22 9 24 7 26 5 28 3 30 1 32 ", "2 9 4 7 5 3 6 1 8 ", "2 13 4 11 6 9 7 5 8 3 10 1 12 ", "2 17 4 15 6 13 8 11 9 7 10 5 12 3 14 1 16 ", "2 50001 4 49999 6 49997 8 49995 10 49993 12 49991 14 49989 16 49987 18 49985 20 49983 22 49981 24 49979 26 49977 28 49975 30 49973 32 49971 34 49969 36 49967 38 49965 40 49963 42 49961 44 49959 46 49957 48 49955 50 49953 52 49951 54 49949 56 49947 58 49945 60 49943 62 49941 64 49939 66 49937 68 49935 70 49933 72 49931 74 49929 76 49927 78 49925 80 49923 82 49921 84 49919 86 49917 88 49915 90 49913 92 49911 94 49909 96 49907 98 49905 100 49903 102 49901 104 49899 106 49897 108 49895 110 49893 112 49891 114 ...", "2 20001 4 19999 6 19997 8 19995 10 19993 12 19991 14 19989 16 19987 18 19985 20 19983 22 19981 24 19979 26 19977 28 19975 30 19973 32 19971 34 19969 36 19967 38 19965 40 19963 42 19961 44 19959 46 19957 48 19955 50 19953 52 19951 54 19949 56 19947 58 19945 60 19943 62 19941 64 19939 66 19937 68 19935 70 19933 72 19931 74 19929 76 19927 78 19925 80 19923 82 19921 84 19919 86 19917 88 19915 90 19913 92 19911 94 19909 96 19907 98 19905 100 19903 102 19901 104 19899 106 19897 108 19895 110 19893 112 19891 114 ...", "2 30001 4 29999 6 29997 8 29995 10 29993 12 29991 14 29989 16 29987 18 29985 20 29983 22 29981 24 29979 26 29977 28 29975 30 29973 32 29971 34 29969 36 29967 38 29965 40 29963 42 29961 44 29959 46 29957 48 29955 50 29953 52 29951 54 29949 56 29947 58 29945 60 29943 62 29941 64 29939 66 29937 68 29935 70 29933 72 29931 74 29929 76 29927 78 29925 80 29923 82 29921 84 29919 86 29917 88 29915 90 29913 92 29911 94 29909 96 29907 98 29905 100 29903 102 29901 104 29899 106 29897 108 29895 110 29893 112 29891 114 ...", "2 99996 4 99994 6 99992 8 99990 10 99988 12 99986 14 99984 16 99982 18 99980 20 99978 22 99976 24 99974 26 99972 28 99970 30 99968 32 99966 34 99964 36 99962 38 99960 40 99958 42 99956 44 99954 46 99952 48 99950 50 99948 52 99946 54 99944 56 99942 58 99940 60 99938 62 99936 64 99934 66 99932 68 99930 70 99928 72 99926 74 99924 76 99922 78 99920 80 99918 82 99916 84 99914 86 99912 88 99910 90 99908 92 99906 94 99904 96 99902 98 99900 100 99898 102 99896 104 99894 106 99892 108 99890 110 99888 112 99886 114 ...", "-1", "2 101 4 99 6 97 8 95 10 93 12 91 14 89 16 87 18 85 20 83 22 81 24 79 26 77 28 75 30 73 32 71 34 69 36 67 38 65 40 63 42 61 44 59 46 57 48 55 50 53 51 49 52 47 54 45 56 43 58 41 60 39 62 37 64 35 66 33 68 31 70 29 72 27 74 25 76 23 78 21 80 19 82 17 84 15 86 13 88 11 90 9 92 7 94 5 96 3 98 1 100 ", "2 505 4 503 6 501 8 499 10 497 12 495 14 493 16 491 18 489 20 487 22 485 24 483 26 481 28 479 30 477 32 475 34 473 36 471 38 469 40 467 42 465 44 463 46 461 48 459 50 457 52 455 54 453 56 451 58 449 60 447 62 445 64 443 66 441 68 439 70 437 72 435 74 433 76 431 78 429 80 427 82 425 84 423 86 421 88 419 90 417 92 415 94 413 96 411 98 409 100 407 102 405 104 403 106 401 108 399 110 397 112 395 114 393 116 391 118 389 120 387 122 385 124 383 126 381 128 379 130 377 132 375 134 373 136 371 138 369 140 367 142 ...", "2 565 4 563 6 561 8 559 10 557 12 555 14 553 16 551 18 549 20 547 22 545 24 543 26 541 28 539 30 537 32 535 34 533 36 531 38 529 40 527 42 525 44 523 46 521 48 519 50 517 52 515 54 513 56 511 58 509 60 507 62 505 64 503 66 501 68 499 70 497 72 495 74 493 76 491 78 489 80 487 82 485 84 483 86 481 88 479 90 477 92 475 94 473 96 471 98 469 100 467 102 465 104 463 106 461 108 459 110 457 112 455 114 453 116 451 118 449 120 447 122 445 124 443 126 441 128 439 130 437 132 435 134 433 136 431 138 429 140 427 142 ..."]}	UNKNOWN	PYTHON3	CODEFORCES	15
8baaa070ecac7d157bd2a81f95a18b77	MUH and Important Things	It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal should do each of these tasks. For each task, they have evaluated its difficulty. Also animals decided to do the tasks in order of their difficulty. Unfortunately, some tasks can have the same difficulty, so the order in which one can perform the tasks may vary. Menshykov, Uslada and Horace ask you to deal with this nuisance and come up with individual plans for each of them. The plan is a sequence describing the order in which an animal should do all the n tasks. Besides, each of them wants to have its own unique plan. Therefore three plans must form three different sequences. You are to find the required plans, or otherwise deliver the sad news to them by stating that it is impossible to come up with three distinct plans for the given tasks. The first line contains integer n (1<=≤<=n<=≤<=2000) — the number of tasks. The second line contains n integers h1,<=h2,<=...,<=hn (1<=≤<=hi<=≤<=2000), where hi is the difficulty of the i-th task. The larger number hi is, the more difficult the i-th task is. In the first line print "YES" (without the quotes), if it is possible to come up with three distinct plans of doing the tasks. Otherwise print in the first line "NO" (without the quotes). If three desired plans do exist, print in the second line n distinct integers that represent the numbers of the tasks in the order they are done according to the first plan. In the third and fourth line print two remaining plans in the same form. If there are multiple possible answers, you can print any of them. Sample Input 4 1 3 3 1 5 2 4 1 4 8 Sample Output YES 1 4 2 3 4 1 2 3 4 1 3 2 NO	[ "while True:\r\n try:\r\n n = int(input())\r\n tasks = list(enumerate(map(int, input().split()), 1)) # [(id, difficulty)]\r\n tasks.sort(key = lambda x: x[1]) # sort by id\r\n i = 0\r\n while i < n - 1:\r\n if tasks[i][1] == tasks[i + 1][1]:\r\n break\r\n i += 1\r\n j = i + 1\r\n while j < n - 1:\r\n if tasks[j][1] == tasks[j + 1][1]:\r\n break\r\n j += 1\r\n if j > n - 2:\r\n print('NO')\r\n else:\r\n print('YES')\r\n tasks = [str(id) for id, difficulty in tasks]\r\n print(' '.join(tasks))\r\n tasks[i], tasks[i + 1] = tasks[i + 1], tasks[i]\r\n print(' '.join(tasks))\r\n tasks[j], tasks[j + 1] = tasks[j + 1], tasks[j]\r\n print(' '.join(tasks))\r\n except:\r\n break", "\"\"\"\r\nCodeforces Contest 269 Div 2 Problem B\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.3.4\r\n\"\"\"\r\n\r\ndef main():\r\n n, = read()\r\n a = [(int(x), i+1) for i,x in enumerate(read())]\r\n a.sort()\r\n ct = []\r\n for i in range(n-1):\r\n if a[i][0] == a[i+1][0]: ct.append(i)\r\n if len(ct) < 2:\r\n print(\"NO\")\r\n return\r\n a1 = []\r\n a2 = []\r\n a3 = []\r\n for i in range(n):\r\n a1.append(a[i][1])\r\n if i == ct[0]:\r\n a2.append(a[i+1][1])\r\n elif i == ct[0]+1:\r\n a2.append(a[i-1][1])\r\n else:\r\n a2.append(a[i][1])\r\n if i == ct[1]:\r\n a3.append(a[i+1][1])\r\n elif i == ct[1]+1:\r\n a3.append(a[i-1][1])\r\n else:\r\n a3.append(a[i][1])\r\n print(\"YES\")\r\n write(a1)\r\n print()\r\n write(a2)\r\n print()\r\n write(a3)\r\n\r\n################################### NON-SOLUTION STUFF BELOW\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 list(map(int, inputs.split()))\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\nwrite(main())", "n = int(input())\r\nm = list(map(int, input().split()))\r\n\r\nu = {}\r\nfor i, v in enumerate(m):\r\n if not v in u:\r\n u[v] = []\r\n u[v].append(i+1)\r\n\r\nd = []\r\n\r\nfor i in u:\r\n m1 = u[i]\r\n d.append([i, m1, len(m1)])\r\n\r\nd = sorted(d, key=lambda x: x[0])\r\n\r\npos = 1\r\n\r\ns1 = []\r\ns2 = []\r\ns3 = []\r\n\r\nfor val in d:\r\n l = val[1]\r\n\r\n if pos != 3:\r\n if val[2] == 2:\r\n if pos == 1:\r\n pos = 2\r\n s1 += l\r\n s3 += l\r\n l.reverse()\r\n s2 += l\r\n continue\r\n elif pos == 2:\r\n pos = 3\r\n s1 += l\r\n s2 += l\r\n l.reverse()\r\n s3 += l\r\n continue\r\n elif val[2] > 2:\r\n pos = 3\r\n s1 += l\r\n l.reverse()\r\n s2 += l\r\n l[1], l[2] = l[2], l[1]\r\n s3 += l\r\n continue\r\n\r\n s1 += l\r\n s2 += l\r\n s3 += l\r\n\r\nif pos == 3:\r\n print('YES')\r\n print(' '.join(map(str, s1)))\r\n print(' '.join(map(str, s2)))\r\n print(' '.join(map(str, s3)))\r\nelse:\r\n print('NO')\r\n\r\n\r\n# n = int(input())\r\n# m = list(map(int, input().split()))\r\n#\r\n# u = {}\r\n# for v in m:\r\n# u[v] = 1 + (u[v] if v in u else 0)\r\n#\r\n# d = []\r\n#\r\n# for i, v in enumerate(m):\r\n# d.append([i+1, v])\r\n#\r\n# d = sorted(d, key=lambda x: x[1])\r\n#\r\n# print(n, m, d, u)\r\n#\r\n# s2 = []\r\n# s3 = []\r\n#\r\n# for i, v in u.items():\r\n# print(i, v)\r\n# if v == 2:\r\n# s2.append(i)\r\n# if v > 2:\r\n# s3.append(i)\r\n#\r\n# print(s2, s3)\r\n#\r\n# if len(s3):\r\n# v1 = v2 = v3 = v4 = s3[0]\r\n# elif len(s2) >= 2:\r\n# v1 = v2 = s2[0]\r\n# v3 = v4 = s2[1]\r\n# else:\r\n# print('NO')\r\n# exit()\r\n#\r\n# print('YES')\r\n#\r\n# s1 = []\r\n# for v in d:\r\n# s1.append(v[0])\r\n#\r\n# s2 = s1\r\n# s3 = s1\r\n#\r\n# print(' '.join(map(str, s1)))\r\n# print(s2, s3)\r\n#\r\n# print(v1, v2, v3, v4)\r\n#\r\n", "# https://bigocoder.com/courses/OBLUE01/OBLUE01_LEC18/BLUE_L18P01/statement\r\n\r\nn = int(input())\r\ntasks = list(map(int, input().split()))\r\n\r\np = []\r\nfor i in range(n):\r\n p.append( (i+1, tasks[i]) )\r\n\r\np.sort(key=lambda x: x[1])\r\n\r\nl1 = p.copy()\r\nl2 = []\r\nl3 = []\r\n\r\ncount = 0\r\n\r\nfor i in range(1,n):\r\n if p[i][1] == p[i-1][1]:\r\n count += 1\r\n if count > 1:\r\n break\r\n\r\nif count < 2:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(1, n):\r\n if p[i][1] == p[i-1][1]:\r\n p[i], p[i-1] = p[i-1], p[i]\r\n if l2 == []:\r\n l2 = p.copy()\r\n else:\r\n l3 = p.copy()\r\n break\r\n for i in range(n):\r\n print(l1[i][0], end=' ')\r\n print()\r\n for i in range(n):\r\n print(l2[i][0], end=' ')\r\n print()\r\n for i in range(n):\r\n print(l3[i][0], end=' ')", "n=int(input())\r\nL=list(map(int,input().split()))\r\nfor i in range(n):\r\n L[i]=(L[i],i+1)\r\n\r\nL.sort()\r\nH1=[]\r\nfor i in range(n):\r\n H1.append(L[i][1])\r\nind=-1\r\nfor i in range(1,n):\r\n if(L[i][0]==L[i-1][0]):\r\n L[i],L[i-1]=tuple(L[i-1]),tuple(L[i])\r\n found=True\r\n ind=i\r\n break\r\nif(ind==-1):\r\n print(\"NO\")\r\nelse:\r\n H2=[]\r\n for i in range(n):\r\n H2.append(L[i][1])\r\n ind+=1\r\n found=False\r\n for i in range(ind,n):\r\n if(L[i][0]==L[i-1][0]):\r\n L[i],L[i-1]=tuple(L[i-1]),tuple(L[i])\r\n found=True\r\n ind=i\r\n break\r\n if(not found):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n H3=[]\r\n for i in range(n):\r\n H3.append(L[i][1])\r\n for i in range(n):\r\n print(H1[i],end=\" \")\r\n print()\r\n for i in range(n):\r\n print(H2[i],end=\" \")\r\n print()\r\n for i in range(n):\r\n print(H3[i],end=\" \")\r\n print()\r\n \r\n", "import sys\r\nsys.setrecursionlimit(100000)\r\n\r\n# -----------------------------------------------------------------\r\n\r\n# global constant\r\nINF = int(1e7+1)\r\nMAX = 100005\r\n\r\n# -----------------------------------------------------------------\r\n\r\n# For testing\r\n# sys.stdin = open(\"INP.txt\", 'r')\r\n# sys.stdout = open(\"OUT.txt\", 'w')\r\n\r\n\r\n# -----------------------------------------------------------------\r\n\r\n# classes\r\nclass Pair:\r\n def __init__(self, a, b):\r\n self.first = a\r\n self.second = b\r\n\r\n def __lt__(self, other):\r\n return self.first < other.first or (self.first == other.first and self.second < other.second)\r\n\r\n\r\nclass Edge:\r\n def __init__(self, u, v, w):\r\n self.u = u\r\n self.v = v\r\n self.w = w\r\n\r\n def __lt__(self, other):\r\n return self.w < other.w\r\n\r\n# -----------------------------------------------------------------\r\n\r\n\r\n# global variables\r\n\r\n# -----------------------------------------------------------------\r\n\r\n# functions\r\ndef init():\r\n pass\r\n\r\ndef erase(string):\r\n return string [1:]\r\n\r\n# -----------------------------------------------------------------\r\n# main function\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n for i in range(n):\r\n a[i] = Pair(a[i], i + 1)\r\n\r\n a.sort()\r\n\r\n countPair = 0\r\n for i in range(n - 1):\r\n if a[i].first == a[i + 1].first:\r\n countPair += 1\r\n\r\n if countPair < 2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n count = 0\r\n for i in range(n - 1):\r\n # print(a[i].first, a[i].second)\r\n if a[i].first == a[i + 1].first:\r\n for j in range(n):\r\n print(a[j].second, end=' ')\r\n print()\r\n \r\n count += 1\r\n a[i].second, a[i + 1].second = a[i + 1].second, a[i].second\r\n if count == 2:\r\n for j in range(n):\r\n print(a[j].second, end=' ')\r\n break\r\n\r\n\r\n \r\n\r\nmain()\r\n", "def print_permutation(array):\n temp = \"\"\n for ar in array:\n temp += str(ar[1])+\" \"\n return temp.strip()\n\nn = int(input().strip())\na = list(map(int, input().split()))\nfor i in range(n):\n a[i] = (a[i], i+1)\na.sort(key=lambda t: t[0])\n\nb = a.copy()\nindex = 0\ncount = 1\nfor i in range(n-1):\n if b[i][0] == b[i+1][0]:\n temp = b[i]\n b[i] = b[i+1]\n b[i+1] = temp\n index = i + 1\n count += 1\n break\nc = b.copy()\nfor i in range(index, n-1):\n if c[i][0] == c[i+1][0]:\n temp = c[i]\n c[i] = c[i+1]\n c[i+1] = temp\n count += 1\n break\n\nif count == 3:\n print(\"YES\")\n print(print_permutation(a))\n print(print_permutation(b))\n print(print_permutation(c))\nelse:\n print(\"NO\")\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nques = []\r\nfor i in range (n):\r\n ques.append((i,l[i]))\r\n\r\nques = sorted(ques, key = lambda x: (x[1],x[0]))\r\n\r\ncheck = 0\r\nfor i in range (n-1):\r\n if ques[i][1] == ques[i+1][1]:\r\n check += 1\r\n if check == 2:\r\n print('YES')\r\n for j in range (n):\r\n print(ques[j][0]+1,end = ' ')\r\n print()\r\n count = 0\r\n for j in range (n-1):\r\n if ques[j][1] == ques[j+1][1]:\r\n count += 1\r\n ques[j],ques[j+1] = ques[j+1],ques[j]\r\n for k in range (n):\r\n print(ques[k][0]+1,end = ' ')\r\n print()\r\n ques[j],ques[j+1] = ques[j+1],ques[j]\r\n if count == 2:\r\n exit()\r\n\r\nprint('NO')", "class Task:\r\n def __init__(self, value, index):\r\n self.value = value\r\n self.index = index\r\n def __lt__(self, other):\r\n return self.value < other.value\r\n\r\ndef swap(a, start, end):\r\n tmp = a[start].value\r\n a[start].value = a[end].value\r\n a[end].value = tmp\r\n tmp = a[start].index\r\n a[start].index = a[end].index\r\n a[end].index = tmp\r\n\r\nN = int(input())\r\nA = map(int, input().split())\r\na = []\r\nfor index, value in enumerate(A):\r\n a.append(Task(value, index + 1))\r\na = sorted(a)\r\n\r\ni = 0\r\nfirstStart = -1\r\nfirstEnd = -1\r\nsecondStart = -1\r\nsecondEnd = -1\r\nwhile i < len(a) - 1:\r\n if firstStart == -1 and a[i].value == a[i + 1].value:\r\n firstStart = i\r\n while i < len(a) - 1 and a[i].value == a[i + 1].value:\r\n i += 1\r\n firstEnd = i\r\n elif secondStart == -1 and a[i].value == a[i + 1].value:\r\n secondStart = i\r\n while i < len(a) - 1 and a[i].value == a[i + 1].value:\r\n i += 1\r\n secondEnd = i\r\n i += 1\r\n\r\nif firstStart == -1 or (firstEnd - firstStart <= 1 and secondStart == -1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(\" \".join([str(x.index) for x in a]))\r\n swap(a, firstStart, firstEnd)\r\n print(\" \".join([str(x.index) for x in a]))\r\n if firstEnd - firstStart >= 2:\r\n swap(a, firstStart, firstStart + 1)\r\n else:\r\n swap(a, secondStart, secondEnd)\r\n print(\" \".join([str(x.index) for x in a])) \r\n", "n=int(input())\r\n#n,k = map(int, input().strip().split(' '))\r\nlst = list(map(int, input().strip().split(' ')))\r\nl2 = list(set(lst))\r\nif len(lst)-len(l2)<2:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n l={}\r\n for j in range(n):\r\n l[j]=lst[j]\r\n l = dict(sorted(l.items(), key=lambda x:x[1]))\r\n #print(l)\r\n l3=[]\r\n for j in l:\r\n l3.append([j+1,l[j]])\r\n print(j+1,end=\" \")\r\n print()\r\n #now we have a 2d list l3\r\n l4=[]\r\n for j in range(len(l3)-1):\r\n if l3[j][1]==l3[j+1][1]:\r\n l4.append(j)\r\n if len(l4)==2:\r\n break\r\n f=0\r\n for j in range(n):\r\n if j==l4[0]:\r\n f=1\r\n print(l3[j+1][0],end=\" \")\r\n elif f==1:\r\n f=2\r\n print(l3[j-1][0],end=\" \")\r\n else:\r\n print(l3[j][0],end=\" \")\r\n print()\r\n for j in range(n):\r\n if j==l4[1]:\r\n f=1\r\n print(l3[j+1][0],end=\" \")\r\n elif f==1:\r\n f=2\r\n print(l3[j-1][0],end=\" \")\r\n else:\r\n print(l3[j][0],end=\" \")\r\n print()\r\n \r\n ", "n = int(input())\r\narr = [0] * n\r\nk = 0\r\nfor i in list(map(int, input().split())):\r\n arr[k] = (i, k + 1)\r\n k += 1\r\narr.sort()\r\nk = 0\r\np = ''\r\nans = 0\r\nind = []\r\nfor i in arr:\r\n if i[0] == p:\r\n ans += 1\r\n ind.append(k)\r\n else:\r\n p = i[0]\r\n if ans > 1:\r\n break\r\n k += 1\r\nif len(ind) != 2:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in arr:\r\n print(i[1], end = ' ')\r\n print()\r\n for i in arr[:ind[0] - 1]:\r\n print(i[1], end = ' ')\r\n print(arr[ind[0]][1], end = ' ' )\r\n print(arr[ind[0] - 1][1], end = ' ')\r\n for i in arr[ind[0] + 1:]:\r\n print(i[1], end = ' ')\r\n print()\r\n for i in arr[:ind[1] - 1]:\r\n print(i[1], end = ' ')\r\n print(arr[ind[1]][1], end = ' ')\r\n print(arr[ind[1] - 1][1], end = ' ')\r\n for i in arr[ind[1] + 1:]:\r\n print(i[1], end = ' ') ", "def print_plan(plan):\n for task in plan:\n print(task[1], end = ' ')\n print()\n\nn = int(input())\nh = list(map(int, input().split()))\n\ntasks = []\nfor i in range(n):\n tasks.append((h[i], i + 1))\ntasks.sort()\nswaps = []\nfor i in range(1, n):\n if len(swaps) >= 2:\n break\n if tasks[i - 1][0] == tasks[i][0]:\n swaps.append((i - 1, i))\nif len(swaps) < 2:\n print('NO')\n exit()\nprint('YES')\nprint_plan(tasks)\ntasks[swaps[0][0]], tasks[swaps[0][1]] = tasks[swaps[0][1]], tasks[swaps[0][0]] \nprint_plan(tasks)\ntasks[swaps[1][0]], tasks[swaps[1][1]] = tasks[swaps[1][1]], tasks[swaps[1][0]] \nprint_plan(tasks)", "\n\ndef solve(nums):\n nums = zip(nums, [i+1 for i in range(len(nums))])\n nums = sorted(nums, key=lambda x: x[0])\n seqs = [[],[],[]]\n\n prev = nums[0][0]\n count = 0\n for n, i in nums[1:]:\n if n == prev:\n count += 1\n prev = n\n if count < 2:\n print(\"NO\")\n return\n \n print(\"YES\")\n \n curr = 0\n prev = None\n for n, i in nums:\n seqs[0].append(i)\n seqs[1].append(i)\n seqs[2].append(i)\n\n if not (n != prev or curr >= 2):\n seqs[curr+1][-1], seqs[curr+1][-2] = seqs[curr+1][-2], seqs[curr+1][-1]\n curr += 1\n\n prev = n\n\n for s in seqs:\n print(' '.join(map(str, s)))\n \n\ninput()\nsolve(list(map(int, input().split(' '))))\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\narr = [(i+1, arr[i]) for i in range(n)]\r\narr.sort(key = lambda x: x[1])\r\ni = 0\r\nwhile i < n - 1 and arr[i][1] != arr[i + 1][1]: i += 1\r\nj = i + 1\r\nwhile j < n - 1 and arr[j][1] != arr[j + 1][1]: j += 1\r\nif j > n - 2: \r\n print('NO')\r\n exit()\r\nprint('YES')\r\nres = [str(i) for i, j in arr]\r\nprint(res)\r\nres[i], res[i + 1] = res[i + 1], res[i]\r\nprint(res)\r\nres[j], res[j + 1] = res[j + 1], res[j]\r\nprint(res)\r\n", "n=int(input())\r\nlis=input().split()\r\nfor i in range(n):\r\n lis[i]=int(lis[i])\r\n\r\nlis1=sorted(list(set(lis)))\r\ndic={}\r\nfor k in lis1:\r\n dic[k]=[]\r\nfor i in range(n):\r\n for j in range(len(lis1)):\r\n if lis1[j]==lis[i]:\r\n dic[lis1[j]].append(i+1)\r\n\r\ndic1={}\r\nfor [u,v] in dic.items():\r\n if len(v)>=2:\r\n dic1[u]=v\r\n \r\nif len(dic1)==0:\r\n print('NO')\r\nif len(dic1)==1:\r\n for [u,v] in dic1.items():\r\n if len(v)<3:\r\n print('NO')\r\n else:\r\n print('YES')\r\n for i in range(len(lis1)):\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n print()\r\n for i in range(len(lis1)):\r\n if lis1[i] in dic1.keys():\r\n print(dic1[lis1[i]][1],end=' ')\r\n print(dic1[lis1[i]][0],end=' ')\r\n for k in dic[lis1[i]][2:]:\r\n print(k,end=' ')\r\n else:\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n print()\r\n for i in range(len(lis1)):\r\n if lis1[i] in dic1.keys():\r\n print(dic1[lis1[i]][2],end=' ')\r\n for k in dic[lis1[i]][:2]+dic[lis1[i]][3:]:\r\n print(k,end=' ')\r\n else:\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n\r\nif len(dic1)>=2:\r\n print('YES')\r\n lis2=[]\r\n for k in dic1.keys():\r\n lis2.append(k)\r\n index1=lis1.index(lis2[0])\r\n index2=lis1.index(lis2[1])\r\n for i in range(len(lis1)):\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n print()\r\n for i in range(len(lis1)):\r\n if i!=index1:\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n else:\r\n dic[lis1[i]][0],dic[lis1[i]][1]=dic[lis1[i]][1],dic[lis1[i]][0]\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n print()\r\n for i in range(len(lis1)):\r\n if i!=index2:\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n else:\r\n dic[lis1[i]][0],dic[lis1[i]][1]=dic[lis1[i]][1],dic[lis1[i]][0]\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n print()\r\n \r\n \r\n \r\n \r\n \r\n", "def main():\r\n n = int(input())\r\n x = [[int(y),0] for y in input().split()] #Lectura de datos\r\n solucion = []\r\n for i in range(len(x)):\r\n x[i][1] = i+1\r\n x.sort()\r\n solucion.append(x)\r\n for i in range(len(x)):\r\n if(i+1 < n and x[i][0] == x[i+1][0]):\r\n x[i+1],x[i] = x[i],x[i+1]\r\n solucion.append([z for z in x])\r\n x[i],x[i+1] = x[i+1],x[i]\r\n if(len(solucion) == 3):\r\n break;\r\n if(len(solucion) == 3):\r\n print(\"YES\")\r\n for i in range(3):\r\n for j in range(len(x)-1):\r\n print(solucion[i][j][1],end=' ')\r\n print(solucion[i][len(x)-1][1])\r\n else:\r\n print(\"NO\")\r\nmain()", "n = int(input())\na = sorted([(int(x), y + 1) for (x, y) in zip(input().split(), range(n))])\ncnt = 0\nfor (x, y), (xx, yy) in zip(a[: -1], a[1: ]):\n\tif x == xx:\n\t\tcnt += 1\nif cnt < 2:\n\tprint('NO')\n\texit(0)\nprint('YES')\nprint(' '.join(str(y) for x, y in a))\ni = 0\nwhile a[i][0] != a[i + 1][0]:\n\ti += 1\na[i], a[i + 1] = a[i + 1], a[i]\nprint(' '.join(str(y) for x, y in a))\ni += 1\nwhile a[i][0] != a[i + 1][0]:\n i += 1\na[i], a[i + 1] = a[i + 1], a[i]\nprint(' '.join(str(y) for x, y in a))\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nd = [0] (n)\r\nb = [0] * (2001)\r\ns = 0\r\nf = [ [] for i in range(2001) ]\r\nc = [ [] for i in range(3) ]\r\nfor i in range(len(a)):\r\n b[a[i]] = b[a[i]] + 1\r\n d[i] = [a[i],i+1]\r\n f[a[i]].append(i+1)\r\nc1 = 0\r\nfor i in range(len(b)):\r\n if (b[i] >= 2):\r\n if (b[i] >= 3):\r\n c1 = c1 + 1\r\n s = s + 1\r\nif ((s < 2) and (c1 != 1)):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n s = 0\r\n for i in range(len(f)):\r\n for j in range(len(f[i])):\r\n c[0].append(f[i][j])\r\n print((c[0]))\r\n mark = [False] (2001)\r\n for i in range(len(f)):\r\n if (len(f[i]) == 1):\r\n c[1].append(f[i][0])\r\n elif (len(f[i]) == 2):\r\n if (s == 0):\r\n c[1].append(f[i][1])\r\n c[1].append(f[i][0])\r\n s = s + 1\r\n mark[i] = True\r\n else:\r\n c[1].append(f[i][0])\r\n c[1].append(f[i][1])\r\n elif (len(f[i]) > 2):\r\n if (s == 0):\r\n c[1].append(f[i][1])\r\n c[1].append(f[i][0])\r\n for j in range(2,len(f[i])):\r\n c[1].append(f[i][j])\r\n else:\r\n for j in range(len(f[i])):\r\n c[1].append(f[i][j])\r\n print((c[1]))\r\n s = 0\r\n for i in range(len(f)):\r\n if (len(f[i]) == 1):\r\n c[2].append(f[i][0])\r\n elif (len(f[i]) == 2):\r\n if ((mark[i] == False) and (s == 0)):\r\n c[2].append(f[i][1])\r\n c[2].append(f[i][0])\r\n mark[i] = True\r\n s = s + 1\r\n else:\r\n c[2].append(f[i][0])\r\n c[2].append(f[i][1])\r\n elif (len(f[i]) > 2):\r\n if (s == 0):\r\n c[2].append(f[i][2])\r\n c[2].append(f[i][0])\r\n c[2].append(f[i][1])\r\n for j in range(3,len(f[i])):\r\n c[2].append(f[i][j])\r\n else:\r\n for j in range(len(f[i])):\r\n c[2].append(f[i][j])\r\n s = s + 1\r\n print((c[2]))", "n = int(input())\njobs = list(map(int, input().split()))\njobs = sorted(list(map(lambda x: (x[1], x[0] + 1), enumerate(jobs))))\nr3 = None\nr21 = None\nr22 = None\nfor i in range(n):\n if i + 2 < n and jobs[i][0] == jobs[i + 1][0] and jobs[i][0] == jobs[i + 2][0]:\n r3 = i\n break\n if i + 1 < n and jobs[i][0] == jobs[i + 1][0]:\n if r21 is None:\n r21 = i\n else:\n r22 = i\n break\njobs = list(map(lambda x: x[1], jobs))\nif r3 is None and r22 is None:\n print('NO')\nelif r3 is not None:\n print('YES')\n print(jobs)\n print((jobs[:r3] + [jobs[r3 + 2]] + [jobs[r3]] + [jobs[r3 + 1]] + jobs[r3 + 3:]))\n print((jobs[:r3] + [jobs[r3 + 1]] + [jobs[r3 + 2]] + [jobs[r3]] + jobs[r3 + 3:]))\nelse:\n print('YES')\n print(jobs)\n print((jobs[:r21] + [jobs[r21]] + [jobs[r21 + 1]] + jobs[r21 + 2:r22] + [jobs[r22 + 1]] + [jobs[r22]] + jobs[r22 + 2:]))\n print((jobs[:r21] + [jobs[r21 + 1]] + [jobs[r21]] + jobs[r21 + 2:r22] + [jobs[r22]] + [jobs[r22 + 1]] + jobs[r22 + 2:]))", "class ToDo:\r\n def __init__(self, height, _id):\r\n self.height = height\r\n self.id = _id\r\n\r\nN = int(input())\r\nh = list(map(int, input().split()))\r\ntask = []\r\nfor i in range(N):\r\n task.append(ToDo(h[i], i + 1))\r\ntask = sorted(task, key = lambda t: t.height)\r\ncanSwap = [-1] * 2\r\ncase = 0\r\nfor i in range(0, N - 1):\r\n if task[i].height == task[i + 1].height:\r\n canSwap[case] = i\r\n case += 1\r\n if case == 2:\r\n break\r\n\r\nif case != 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n for i in range(N):\r\n print(task[i].id, end = \" \")\r\n print()\r\n\r\n task[canSwap[0]].id, task[canSwap[0] + 1].id = task[canSwap[0] + 1].id, task[canSwap[0]].id\r\n for i in range(N):\r\n print(task[i].id, end = \" \")\r\n print()\r\n\r\n task[canSwap[1]].id, task[canSwap[1] + 1].id = task[canSwap[1] + 1].id, task[canSwap[1]].id\r\n for i in range(N):\r\n print(task[i].id, end = \" \")", "input()\r\nt=sorted(enumerate(map(int,input().split()),1),key=lambda x: x[1])\r\np=[str(x[0]) for x in t]\r\nq=['YES',' '.join(p)]\r\nfor i in range(len(p)-1):\r\n if t[i][1]==t[i+1][1]:\r\n p[i],p[i + 1]=p[i+1],p[i]\r\n q.append(' '.join(p))\r\n if len(q)>3: break\r\nprint('\\n'.join(q) if len(q)>3 else 'NO')", "n = int(input())\r\nl = list(map(int, input().split()))\r\na = []\r\nfor i in range(n):\r\n a.append((l[i], i + 1))\r\n\r\na.sort()\r\ncnt = 0\r\ni = 0\r\nmaxi = 0;\r\nwhile i < n:\r\n c = 0\r\n j = i\r\n while i < n: \r\n if a[i][0] == a[j][0]:\r\n c += 1\r\n else:\r\n break\r\n i += 1\r\n if c > 1:\r\n cnt += 1\r\n maxi = max(c, maxi)\r\n\r\nif cnt < 1 or (cnt == 1 and maxi < 3):\r\n print(\"NO\")\r\nelse:\r\n \r\n print(\"YES\")\r\n\r\n for i in range(n):\r\n print(a[i][1], end = \" \")\r\n print()\r\n\r\n for i in range(1, n):\r\n if a[i][0] == a[i - 1][0]:\r\n a[i], a[i - 1] = a[i - 1], a[i]\r\n break\r\n\r\n for i in range(n):\r\n print(a[i][1], end = \" \")\r\n\r\n print()\r\n\r\n for i in range(n - 1, 0, -1):\r\n if a[i][0] == a[i - 1][0]:\r\n a[i], a[i - 1] = a[i - 1], a[i]\r\n break\r\n\r\n for i in range(n):\r\n print(a[i][1], end = \" \")\r\n ", "# BLUE_LEC18P01\r\n\r\n\r\ndef solution():\r\n N = int(input())\r\n\r\n tasks = list(map(int, input().split()))\r\n\r\n markers = {}\r\n\r\n for i in range(N):\r\n if markers.get(tasks[i]) is None:\r\n markers[tasks[i]] = [1]\r\n markers[tasks[i]].append(i)\r\n\r\n possible = False\r\n possible_count = 1\r\n\r\n duplications = []\r\n duplicated_keys = []\r\n for key, marker in markers.items():\r\n if len(marker) == 3:\r\n possible_count = 2\r\n duplications.append(marker)\r\n duplicated_keys.append(key)\r\n if possible_count >= 3:\r\n possible = True\r\n break\r\n\r\n elif len(marker) >= 4:\r\n possible = True\r\n duplications = [marker]\r\n duplicated_keys = [key]\r\n break\r\n\r\n if not possible:\r\n print('NO')\r\n return\r\n\r\n print('YES')\r\n tasks.sort()\r\n\r\n if len(duplications) == 2:\r\n\r\n for i in range(N):\r\n print(markers[tasks[i]][markers[tasks[i]][0]] + 1, end=' ')\r\n if markers[tasks[i]][0] == len(markers[tasks[i]]) - 1:\r\n markers[tasks[i]][0] = 1\r\n else:\r\n markers[tasks[i]][0] += 1\r\n markers[duplicated_keys[0]][2], markers[duplicated_keys[0]][1] = markers[duplicated_keys[0]][1], \\\r\n markers[duplicated_keys[0]][2]\r\n\r\n for marker in markers.values():\r\n marker[0] = 1\r\n print()\r\n for i in range(N):\r\n print(markers[tasks[i]][markers[tasks[i]][0]] + 1, end=' ')\r\n if markers[tasks[i]][0] == len(markers[tasks[i]]) - 1:\r\n markers[tasks[i]][0] = 1\r\n else:\r\n markers[tasks[i]][0] += 1\r\n for marker in markers.values():\r\n marker[0] = 1\r\n print()\r\n\r\n markers[duplicated_keys[1]][2], markers[duplicated_keys[1]][1] = markers[duplicated_keys[1]][1], \\\r\n markers[duplicated_keys[1]][2]\r\n\r\n for i in range(N):\r\n print(markers[tasks[i]][markers[tasks[i]][0]] + 1, end=' ')\r\n if markers[tasks[i]][0] == len(markers[tasks[i]]) - 1:\r\n markers[tasks[i]][0] = 1\r\n else:\r\n markers[tasks[i]][0] += 1\r\n\r\n if len(duplications) == 1:\r\n for i in range(N):\r\n print(markers[tasks[i]][markers[tasks[i]][0]] + 1, end=' ')\r\n if markers[tasks[i]][0] == len(markers[tasks[i]]) - 1:\r\n markers[tasks[i]][0] = 1\r\n else:\r\n markers[tasks[i]][0] += 1\r\n\r\n print()\r\n for marker in markers.values():\r\n marker[0] = 1\r\n markers[duplicated_keys[0]][2], markers[duplicated_keys[0]][1] = markers[duplicated_keys[0]][1], \\\r\n markers[duplicated_keys[0]][2]\r\n\r\n for i in range(N):\r\n print(markers[tasks[i]][markers[tasks[i]][0]] + 1, end=' ')\r\n if markers[tasks[i]][0] == len(markers[tasks[i]]) - 1:\r\n markers[tasks[i]][0] = 1\r\n else:\r\n markers[tasks[i]][0] += 1\r\n\r\n print()\r\n for marker in markers.values():\r\n marker[0] = 1\r\n markers[duplicated_keys[0]][2], markers[duplicated_keys[0]][3] = markers[duplicated_keys[0]][3], \\\r\n markers[duplicated_keys[0]][2]\r\n\r\n for i in range(N):\r\n print(markers[tasks[i]][markers[tasks[i]][0]] + 1, end=' ')\r\n if markers[tasks[i]][0] == len(markers[tasks[i]]) - 1:\r\n markers[tasks[i]][0] = 1\r\n else:\r\n markers[tasks[i]][0] += 1\r\n\r\n\r\nsolution()\r\n", "n=input()\r\na = list(map(int, input().split()))\r\nindex=sorted(range(len(a)), key=lambda k: a[k])\r\na=sorted(a)\r\nfor i in range(len(index)):\r\n index[i]+=1\r\n\r\n\r\ni=1\r\ncount =1\r\nans=list()\r\n\r\n\r\nans.append(index)\r\n\r\n\r\nwhile i <len(a):\r\n if a[i]==a[i-1]:\r\n index[i],index[i-1]=index[i-1],index[i]\r\n ans.append(list(index))\r\n index[i],index[i-1]=index[i-1],index[i]\r\n count+=1\r\n if count==3:\r\n break\r\n i+=1\r\n\r\n\r\nif count==3:\r\n print(\"YES\")\r\n for i in range(3):\r\n for j in range(len(ans[i])):\r\n print(ans[i][j])\r\n print()\r\n\r\nelse:\r\n print (\"NO\")", "n = int(input())\n\ntasks = list(map(int, input().split()))\ntasksTuple = [(i + 1, x) for i,x in enumerate(tasks)] \ntasksTuple.sort(key=lambda tup: tup[1])\npairs = []\nfor i in range(0, len(tasksTuple) - 1):\n\tif tasksTuple[i][1] == tasksTuple[i + 1][1]:\n\t\tpairs.append((tasksTuple[i][0] , tasksTuple[i + 1][0]))\nif len(pairs) >= 2:\n\tprint(\"YES\")\n\tprintedArray = [\"\", \"\", \"\"]\n\tfor i in range(len(tasksTuple)):\n\t\tnumberPrint1 = tasksTuple[i][0]\n\t\tnumberPrint2 = tasksTuple[i][0]\n\t\tnumberPrint3 = tasksTuple[i][0]\n\t\t\n\t\tif tasksTuple[i][0] == pairs[0][0]:\n\t\t\tnumberPrint2 = pairs[0][1]\n\t\tif tasksTuple[i][0] == pairs[0][1]:\n\t\t\tnumberPrint2 = pairs[0][0]\n\n\t\tif tasksTuple[i][0] == pairs[1][0]:\n\t\t\tnumberPrint3 = pairs[1][1]\n\t\tif tasksTuple[i][0] == pairs[1][1]:\n\t\t\tnumberPrint3 = pairs[1][0]\n\n\t\tif i == len(tasksTuple) - 1:\n\t\t\t printedArray[0] = printedArray[0] + str(numberPrint1)\n\t\t\t printedArray[1] = printedArray[1] + str(numberPrint2)\n\t\t\t printedArray[2] = printedArray[2] + str(numberPrint3)\n\t\telse:\n\t\t\tprintedArray[0] = printedArray[0] + str(numberPrint1) + ' '\n\t\t\tprintedArray[1] = printedArray[1] + str(numberPrint2) + ' '\n\t\t\tprintedArray[2] = printedArray[2] + str(numberPrint3) + ' '\n\tfor i in range(len(printedArray)):\n\t\tprint(printedArray[i])\nelse:\n\tprint(\"NO\")", "from collections import Counter\r\n \r\nn = int(input())\r\na = list(map(int, input().split(' ')))\r\ncounter = Counter(a)\r\nextra = 0\r\nfor i in counter:\r\n extra += counter[i] - 1\r\nif extra <= 1:\r\n print('NO')\r\nelse:\r\n b = [(a[i], i + 1) for i in range(n)]\r\n b.sort()\r\n print('YES')\r\n x = [b[i][1] for i in range(n)]\r\n print(' '.join(map(str, x)))\r\n times = 0\r\n for i in range(n - 1):\r\n if b[i][0] == b[i + 1][0]:\r\n tmp = b[i]\r\n b[i] = b[i + 1]\r\n b[i + 1] = tmp\r\n times += 1\r\n x = [b[j][1] for j in range(n)]\r\n print(' '.join(map(str, x)))\r\n if times == 2:\r\n break", "# coding: utf-8\nn = int(input())\ntmp = [int(i) for i in input().split()]\nli = []\nfor i in range(1,n+1):\n li.append([tmp[i-1],i])\nli.sort()\nseq = [str(i[1]) for i in li]\ntwo = []\nthree = []\nfor i in set(tmp):\n cnt = tmp.count(i)\n if cnt == 2:\n two.append(i)\n elif cnt >= 3:\n three.append(i)\nif three:\n pos = seq.index(str(tmp.index(three[0])+1))\n print('YES')\n print(' '.join(seq))\n seq[pos], seq[pos+1] = seq[pos+1], seq[pos]\n print(' '.join(seq))\n seq[pos+1], seq[pos+2] = seq[pos+2], seq[pos+1]\n print(' '.join(seq))\nelif len(two) >= 2:\n pos1 = seq.index(str(tmp.index(two[0])+1))\n pos2 = seq.index(str(tmp.index(two[1])+1))\n print('YES')\n print(' '.join(seq))\n seq[pos1], seq[pos1+1] = seq[pos1+1], seq[pos1]\n print(' '.join(seq))\n seq[pos2], seq[pos2+1] = seq[pos2+1], seq[pos2]\n print(' '.join(seq))\nelse:\n print('NO')\n", "import collections\nimport heapq\nimport sys\nimport math\nimport itertools\nimport bisect\nfrom io import BytesIO, IOBase\nimport os\n######################################################################################\n#--------------------------------------Input-----------------------------------------#\n######################################################################################\n\n\ndef value(): return tuple(map(int, input().split()))\ndef values(): return tuple(map(int, sys.stdin.readline().split()))\ndef inlst(): return [int(i) for i in input().split()]\ndef inlsts(): return [int(i) for i in sys.stdin.readline().split()]\ndef inp(): return int(input())\ndef inps(): return int(sys.stdin.readline())\ndef instr(): return input()\ndef stlst(): return [i for i in input().split()]\n\n\n######################################################################################\n#--------------------------------------code here-------------------------------------#\n######################################################################################\n\ndef solve():\n \n n = inp()\n l=inlst()\n if len(set(l))>n-2:print (\"NO\");return\n print(\"YES\")\n e=sorted(enumerate(l,start=1),key=lambda x:x[1])\n print ([i for i,j in e])\n tem=1\n for i in range(1,n):\n if tem==3:break\n if e[i][1]==e[i-1][1]:\n e[i],e[i-1]=e[i-1],e[i]\n tem+=1\n print ([i for i,j in e])\n\n\n \n\n\nif __name__ == \"__main__\":\n solve()\n\n", "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 + 1))\r\n\r\n\r\ndef counting_sort(A, k):\r\n n = len(A)\r\n C = [0] k\r\n B = [0] * n\r\n one = two = three = -1\r\n for i in range(n):\r\n C[A[i][0]] += 1\r\n if C[A[i][0]] > 2 and three == -1:\r\n three = A[i][0]\r\n\r\n elif C[A[i][0]] > 1:\r\n if one == -1:\r\n one = A[i][0]\r\n\r\n if one != A[i][0] != -1 and two == -1:\r\n two = A[i][0]\r\n\r\n for i in range(1, k):\r\n C[i] += C[i - 1]\r\n\r\n for i in range(n - 1, -1, -1):\r\n C[A[i][0]] -= 1\r\n B[C[A[i][0]]] = A[i]\r\n\r\n return B, one, two, three\r\n\r\n\r\nb, one, two, three = counting_sort(b, 2001)\r\nif one == -1 or two == -1 and three == -1:\r\n print(\"NO\")\r\n\r\nelse:\r\n if one > two:\r\n one, two = two, one\r\n\r\n\r\n def print_sol(b):\r\n for i in range(len(b)):\r\n print(b[i][1], end=\" \")\r\n\r\n print()\r\n\r\n\r\n if three != -1:\r\n three_index = -1\r\n for i in range(n):\r\n if b[i][0] == three:\r\n three_index = i\r\n break\r\n\r\n print(\"YES\")\r\n print_sol(b)\r\n b[three_index], b[three_index + 1] = b[three_index + 1], b[three_index]\r\n print_sol(b)\r\n b[three_index], b[three_index + 2] = b[three_index + 2], b[three_index]\r\n print_sol(b)\r\n\r\n else:\r\n one_index = two_index = -1\r\n for i in range(n):\r\n if b[i][0] == one and one_index == -1:\r\n one_index = i\r\n\r\n elif b[i][0] == two and two_index == -1:\r\n two_index = i\r\n\r\n print(\"YES\")\r\n print_sol(b)\r\n b[one_index], b[one_index + 1] = b[one_index + 1], b[one_index]\r\n print_sol(b)\r\n b[two_index], b[two_index + 1] = b[two_index + 1], b[two_index]\r\n print_sol(b)\r\n", "input()\r\nt = sorted(enumerate(map(int, input().split()), 1), key = lambda x: x[1])\r\np = [str(x[0]) for x in t]\r\nq = ['YES', ' '.join(p)]\r\nfor i in range(len(p) - 1):\r\n if t[i][1] == t[i + 1][1]:\r\n p[i], p[i + 1] = p[i + 1], p[i]\r\n q.append(' '.join(p))\r\n if len(q) > 3: break\r\nprint('\\n'.join(q) if len(q) > 3 else 'NO')", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import \r\nfrom collections import deque , Counter , defaultdict\r\nfrom math import \r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n# primes = [2,11,101,1009,10007,100003,1000003,10000019,102345689]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n#arr.sort(key=lambda x: (-d[x], x)) Sort with Freq\r\n\r\n#Code\r\n\r\nn = INT()\r\narr = LIST()\r\nd = []\r\nd2 = {}\r\nfor i in range(n):\r\n d.append([i , arr[i]])\r\n if arr[i] not in d2 :\r\n d2[arr[i]]=1\r\n else:\r\n d2[arr[i]]+=1\r\nd.sort(key = lambda x : x[1])\r\n\r\nc = Counter(arr)\r\nv = list(c.values())\r\nv.sort(reverse=True)\r\nflag = False\r\nmx = v[0]\r\nif mx > 2 :\r\n flag = True\r\n\r\nif mx == 2 and v.count(mx) > 1 :\r\n flag = True\r\n\r\nif flag == False:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ans1 = []\r\n ans2 = []\r\n ans3 = []\r\n c = 0\r\n i = 0\r\n while i < n :\r\n x = d[i][1]\r\n y = d[i][0] + 1\r\n if d2[x] == 1 :\r\n ans1.append(y)\r\n ans2.append(y)\r\n ans3.append(y)\r\n i+=1\r\n else:\r\n if c < 2 :\r\n if d2[x] == 2 :\r\n\r\n y2 = d[i + 1][0] + 1\r\n if c == 0 :\r\n ans1+=[y , y2]\r\n ans2+=[y2,y]\r\n ans3+=[y,y2]\r\n else:\r\n ans1 += [y, y2]\r\n ans2 += [y, y2]\r\n ans3 += [y2, y]\r\n c+=1\r\n i+=2\r\n else:\r\n y2 = d[i + 1][0] + 1\r\n y3 = d[i+2][0] + 1\r\n ans1+=[y,y2,y3]\r\n ans2+=[y2,y,y3]\r\n ans3+=[y3,y2,y]\r\n c+=1\r\n i+=3\r\n else:\r\n ans1.append(y)\r\n ans2.append(y)\r\n ans3.append(y)\r\n i+=1\r\n\r\n print(ans1)\r\n print(ans2)\r\n print(ans3)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "N = int(input())\r\nL = list(map(int, input().split(' ')))\r\nD = {}\r\nstate = 0\r\nfor i in L :\r\n if i in D : state += 1\r\n else : D[i] = 1\r\n\r\nif state < 2 : print(\"NO\")\r\nelse :\r\n print(\"YES\")\r\n res1 = \"\"\r\n res2 = \"\"\r\n res3 = \"\"\r\n K = [[L[i],i] for i in range(len(L))]\r\n K.sort(key = lambda x : x[0])\r\n for i in K :\r\n res1 += str(i[1]+1)+\" \"\r\n for i in range(len(K)-1) :\r\n if K[i][0] == K[i+1][0] :\r\n K[i][1], K[i+1][1] = K[i+1][1], K[i][1]\r\n if res2 == '' :\r\n for j in K : res2 += str(j[1]+1)+\" \"\r\n elif res3 == '' :\r\n for j in K : res3 += str(j[1]+1)+\" \"\r\n if res3 != '' : break\r\n print(res1)\r\n print(res2)\r\n print(res3)", "# بسم الله الرحمن الرحيم\r\ndef main():\r\n n = int(input())\r\n difficulities = [int(i) for i in input().split()]\r\n for i in range(n):\r\n difficulities[i] = (i+1, difficulities[i])\r\n difficulities = sorted(difficulities, key = lambda p: p[1])\r\n\r\n possible_swaps = []\r\n for i in range(1, n):\r\n if difficulities[i][1] == difficulities[i-1][1]:\r\n possible_swaps.append((i, i-1))\r\n if len(possible_swaps) == 2: break\r\n\r\n if len(possible_swaps) == 2: # collect no more than 2\r\n print('YES')\r\n first_plan = []\r\n for i in difficulities:\r\n first_plan.append(i[0])\r\n print(first_plan)\r\n\r\n second_plan = []\r\n i, j = possible_swaps[0]\r\n difficulities[i], difficulities[j] = difficulities[j], difficulities[i]\r\n for i in difficulities:\r\n second_plan.append(i[0])\r\n print(second_plan)\r\n i, j = possible_swaps[0]\r\n difficulities[i], difficulities[j] = difficulities[j], difficulities[i]\r\n\r\n third_plan = []\r\n i, j = possible_swaps[1]\r\n difficulities[i], difficulities[j] = difficulities[j], difficulities[i]\r\n for i in difficulities:\r\n third_plan.append(i[0])\r\n print(third_plan)\r\n i, j = possible_swaps[1]\r\n difficulities[i], difficulities[j] = difficulities[j], difficulities[i]\r\n else:\r\n print('NO')\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nt = list(enumerate(map(int, input().split()), 1))\r\nt.sort(key = lambda x: x[1])\r\ni = 0\r\nwhile i < n - 1:\r\n if t[i][1] == t[i + 1][1]: break\r\n i += 1\r\nj = i + 1\r\nwhile j < n - 1:\r\n if t[j][1] == t[j + 1][1]: break\r\n j += 1\r\nif j > n - 2: print('NO')\r\nelse:\r\n print('YES')\r\n t = [str(i) for i, j in t]\r\n print(' '.join(t))\r\n t[i], t[i + 1] = t[i + 1], t[i]\r\n print(' '.join(t))\r\n t[j], t[j + 1] = t[j + 1], t[j]\r\n print(' '.join(t))", "n = int(input())\r\n\r\nh = list(map(int, input().split()))\r\n\r\ntasks = [(h[i], i + 1) for i in range(n)]\r\ntasks.sort()\r\n\r\nswaps = []\r\nfor i in range(1, n):\r\n if len(swaps) >= 2:\r\n break\r\n if tasks[i - 1][0] == tasks[i][0]:\r\n swaps.append((i - 1, i))\r\n \r\nif len(swaps) < 2:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\ndef print_plan(tasks):\r\n for task in tasks:\r\n print(task[1], end = ' ')\r\n print()\r\nprint_plan(tasks)\r\ntasks[swaps[0][0]], tasks[swaps[0][1]] = tasks[swaps[0][1]], tasks[swaps[0][0]] \r\nprint_plan(tasks)\r\ntasks[swaps[1][0]], tasks[swaps[1][1]] = tasks[swaps[1][1]], tasks[swaps[1][0]] \r\nprint_plan(tasks)", "\"\"\"\r\n https://codeforces.com/problemset/problem/471/B\r\n\"\"\"\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n h = list(map(int, input().split()))\r\n h = [[h[i], i + 1] for i in range(n)]\r\n\r\n h = sorted(h, key=lambda x: x[0])\r\n\r\n combination = 1\r\n count = 1\r\n flag = False\r\n for i in range(1, n):\r\n if h[i][0] == h[i - 1][0]:\r\n count += 1\r\n else:\r\n combination = count\r\n count = 1\r\n\r\n if combination count >= 3: \r\n flag = True\r\n\r\n if not flag:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n # Plan 1\r\n for i in range(n):\r\n print(h[i][1], end=\" \")\r\n print()\r\n # Plan 2\r\n position = 0\r\n for i in range(1, n):\r\n if h[i][0] == h[i - 1][0]:\r\n h[i], h[i - 1] = h[i - 1], h[i]\r\n position = i\r\n break\r\n for i in range(n):\r\n print(h[i][1], end=\" \")\r\n print()\r\n # Plan 3\r\n for i in range(position + 1, n):\r\n if h[i][0] == h[i - 1][0]:\r\n h[i], h[i - 1] = h[i - 1], h[i]\r\n break\r\n for i in range(n):\r\n print(h[i][1], end=\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from functools import reduce\r\nfrom itertools import permutations\r\nfrom sys import setrecursionlimit\r\nsetrecursionlimit(100000)\r\n\r\nresult = 0\r\n\r\ndef gen(n, ans = []):\r\n global result\r\n if not n:\r\n print(ans)\r\n result += 1\r\n return\r\n if result >= 3:\r\n return\r\n for y in permutations(c[-n]):\r\n gen(n - 1, ans + list(y))\r\n if result >= 3:\r\n return\r\n\r\nn, a, c = int(input()), list(map(int, input().split())), {}\r\nfor i in range(n):\r\n if a[i] not in c:\r\n c[a[i]] = []\r\n c[a[i]].append(i + 1)\r\nc = [c[x] for x in sorted(set(a))]\r\nif reduce(lambda a, b: (a if type(a) == int else len(a)) (b if type(b) == int else len(b)), c, 1) < 3:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n gen(len(c))\r\n", "n = int(input())\r\nh=[[0, i+1] for i in range(n)]\r\na=list(map(int, input().split()))\r\nfor i in range(n):\r\n h[i][0] = a[i]\r\nh.sort(key = lambda x : x[0])\r\ncnt = 0\r\nfor i in range(n-1):\r\n if h[i][0]==h[i+1][0]:\r\n cnt+=1\r\nif cnt < 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n swap1, swap2 = -1, -1\r\n for i in range(n-1):\r\n if swap1 == -1 and h[i][0] == h[i+1][0]:\r\n swap1 = i\r\n elif swap1 != -1 and swap2 == -1 and h[i][0] == h[i+1][0]:\r\n swap2 = i\r\n break\r\n for i in range(n):\r\n print(h[i][1], end=' ')\r\n print('')\r\n for i in range(swap1):\r\n print(h[i][1], end=' ')\r\n print(h[swap1+1][1], h[swap1][1], end=' ')\r\n for i in range(swap1+2, n):\r\n print(h[i][1], end=' ')\r\n print('')\r\n for i in range(swap2):\r\n print(h[i][1], end=' ')\r\n print(h[swap2+1][1], h[swap2][1], end=' ')\r\n for i in range(swap2+2, n):\r\n print(h[i][1], end=' ')", "N = int(input())\r\nh = list(map(int, input().split()))\r\n\r\nh_dict = dict()\r\n\r\nh_count = dict()\r\n\r\nfor i in range(N):\r\n h_dict[i + 1] = h[i]\r\nh_dict_sorted = sorted(h_dict.items(), key=lambda kv: kv[1])\r\n\r\nfor i in range(N):\r\n if h[i] not in h_count:\r\n h_count[h[i]] = 1\r\n else:\r\n h_count[h[i]] += 1\r\n\r\nh_count_sorted = sorted(h_count.items(), key=lambda kv: kv[1])\r\n\r\ntotal = 0\r\n\r\ncan_swap = []\r\n\r\nfor (key, value) in h_count_sorted:\r\n if total >= 3:\r\n break\r\n if value >= 2:\r\n can_swap.append((key, value))\r\n total += value\r\n\r\ndef print_result_list(current_l, c_swap):\r\n global max_print\r\n new_list = current_l\r\n c_key, c_value = c_swap\r\n count_swap = 0\r\n for i in range(len(current_l)):\r\n current_l_key, current_l_value = current_l[i]\r\n if max_print == 3:\r\n break\r\n if count_swap < c_value - 1 and c_key == current_l_value:\r\n new_list[i], new_list[i + 1] = new_list[i + 1], new_list[i]\r\n count_swap += 1\r\n max_print += 1\r\n print(' '.join([str(key) for (key, value) in new_list]))\r\n\r\nmax_print = 1 \r\n\r\nif total < 3:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(' '.join([str(key) for (key, value) in h_dict_sorted]))\r\n\r\n print_result_list(h_dict_sorted, can_swap[0])\r\n if len(can_swap) > 1:\r\n print_result_list(h_dict_sorted, can_swap[1])", "n = int(input())\r\narr = sorted(enumerate(map(int, input().split()), 1), key=lambda x: x[1])\r\nans = [str(x[0]) for x in arr]\r\nq = ['YES', ' '.join(ans)]\r\nfor i in range(n-1):\r\n if arr[i][1] == arr[i+1][1]:\r\n ans[i], ans[i+1] = ans[i+1], ans[i]\r\n q.append(' '.join(ans))\r\n if len(q) > 3:\r\n break\r\nprint('\\n'.join(q) if len(q) > 3 else \"NO\")", "n = int(input())\narr = [int(i) for i in input().split()]\nfor i in range(n):\n arr[i] = (arr[i], i + 1)\narr.sort()\nb = False\nz = 0\nk = 0\nr = 0\nfor i in range(n):\n j = i\n while j < n and arr[j][0] == arr[i][0]:\n j += 1\n if j - i > 2:\n z = i\n r = 3\n break\n if j - i == 2:\n if b:\n r = 2\n k = i\n break\n else:\n z = i\n b = True\n i = j - 1\nelse:\n print('NO')\nif r == 3:\n print('YES')\n for i in range(n):\n print(arr[i][1], end = ' ')\n print()\n\n for i in range(z):\n print(arr[i][1], end = ' ')\n print(arr[z + 1][1], arr[z + 2][1], arr[z][1], end = ' ')\n for i in range(z + 3, n):\n print(arr[i][1], end = ' ')\n print()\n\n for i in range(z):\n print(arr[i][1], end = ' ')\n print(arr[z + 2][1], arr[z + 1][1], arr[z][1], end = ' ')\n for i in range(z + 3, n):\n print(arr[i][1], end = ' ')\nelif r == 2:\n print('YES')\n for i in range(n):\n print(arr[i][1], end = ' ')\n print()\n\n for i in range(z):\n print(arr[i][1], end = ' ')\n print(arr[z + 1][1], arr[z][1], end = ' ')\n for i in range(z + 2, n):\n print(arr[i][1], end = ' ')\n print()\n\n for i in range(k):\n print(arr[i][1], end = ' ')\n print(arr[k + 1][1], arr[k][1], end = ' ')\n for i in range(k + 2, n):\n print(arr[i][1], end = ' ')\n", "n = int(input())\r\ndiff = input().split()\r\no=enumerate(map(int,diff),1)\r\ntasks=list(o)\r\ntasks.sort(key = lambda diffi: diffi[1])\r\ni = 0\r\nwhile i < n - 1:\r\n if tasks[i][1] == tasks[i + 1][1]: break\r\n i += 1\r\nj = i + 1\r\nwhile j < n - 1:\r\n if tasks[j][1] == tasks[j + 1][1]: break\r\n j += 1\r\nif j > n - 2: print('NO')\r\nelse:\r\n print('YES')\r\n tasks = [str(i) for i, j in tasks]\r\n print(' '.join(tasks))\r\n tasks[i], tasks[i + 1] = tasks[i + 1], tasks[i]\r\n print(' '.join(tasks))\r\n tasks[j], tasks[j + 1] = tasks[j + 1], tasks[j]\r\n print(' '.join(tasks))\r\n", "n,a,q,w,r=int(input()),list(map(int,input().split())),[],[],[0]\r\nfor i in range(n):q.append([a[i],i+1])\r\nq.sort()\r\nfor i in range(1,n):\r\n if q[i][0]==q[i-1][0]:r[0]+=1;r.append(i+1)\r\n if r[0]==2:break\r\nfor i in q:w.append(i[1])\r\nif r[0]==2:\r\n print(\"YES\")\r\n print(w)\r\n for i in range(1,3):w[r[i]-1],w[r[i]-2]=w[r[i]-2],w[r[i]-1];print(w)\r\nelse:print(\"NO\")", "n = int(input())\r\nx = list(map(int, input().split()))\r\nd = dict()\r\ncnt = []\r\nstore = [[] for i in range (2000 + 1)]\r\nfor i in range (len(x)):\r\n if x[i] not in d:\r\n d[x[i]] = len(d)\r\n cnt.append(1)\r\n else:\r\n cnt[d[x[i]]] += 1\r\n store[x[i]].append(i+1)\r\n\r\ntimes = 1\r\nfor i in cnt:\r\n times = times * i\r\nif times >= 3:\r\n print('YES')\r\n task1 = []\r\n temp = []\r\n for i in range (len(store)):\r\n if len(store[i]) != 0:\r\n temp.append([])\r\n for j in range (len(store[i])):\r\n temp[-1].append(len(task1))\r\n task1.append(store[i][j])\r\n for i in range (len(task1)):\r\n print(task1[i], end = ' ')\r\n print()\r\n cnt = 0\r\n res = []\r\n for i in range (len(temp)):\r\n if len(temp[i]) > 1 and len(res) < 2:\r\n for j in range(len(temp[i]) - 1):\r\n tmp = task1[:]\r\n tmp[temp[i][j]], tmp[temp[i][j + 1]] = tmp[temp[i][j + 1]], tmp[temp[i][j]]\r\n res.append(tmp)\r\n if len(res) >= 2:\r\n break\r\n for i in range(2):\r\n for j in res[i]:\r\n print(j, end = ' ')\r\n print()\r\nelse:\r\n print('NO')\r\n\r\n# 1 1 3 3\r\n# 1 4 2 3\r\n\r\n# for i in range(..):\r\n# for j in range(i + 1, ...):\r\n# if a[i].val == a[j].val:\r\n# tmp = a[:]\r\n# tmp[i], tmp[j] = tmp[j], tmp[i]\r\n# res.append(tmp)\r\n ", "import sys\r\nimport math\r\n \r\nn = int(sys.stdin.readline())\r\nhn = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\na = []\r\nb = []\r\nc = []\r\n\r\nd = dict()\r\nfor i in range(n):\r\n if hn[i] in d:\r\n d[hn[i]].append(i + 1)\r\n else:\r\n d[hn[i]] = [i + 1]\r\n \r\ny = list(d.keys())\r\ny.sort()\r\n\r\nf = 0\r\nfor i in y:\r\n if(len(d[i]) > 2):\r\n k = d[i]\r\n a.append(k[0])\r\n a.append(k[1])\r\n a.append(k[2])\r\n a.extend((k[3:]))\r\n b.append(k[1])\r\n b.append(k[0])\r\n b.append(k[2])\r\n b.extend((k[3:]))\r\n c.append(k[2])\r\n c.append(k[1])\r\n c.append(k[0])\r\n c.extend((k[3:]))\r\n f += 2\r\n elif(len(d[i]) == 2):\r\n k = d[i]\r\n if(f % 2 != 0):\r\n a.append(k[0])\r\n a.append(k[1])\r\n b.append(k[1])\r\n b.append(k[0])\r\n c.append(k[0])\r\n c.append(k[1])\r\n else:\r\n a.append(k[0])\r\n a.append(k[1])\r\n b.append(k[1])\r\n b.append(k[0])\r\n c.append(k[1])\r\n c.append(k[0])\r\n \r\n f += 1\r\n else:\r\n a.append(d[i][0])\r\n b.append(d[i][0])\r\n c.append(d[i][0])\r\n\r\nif(f > 1):\r\n print(\"YES\")\r\n print(\" \".join([str(x) for x in a])) \r\n print(\" \".join([str(x) for x in b])) \r\n print(\" \".join([str(x) for x in c])) \r\nelse:\r\n print(\"NO\") ", "n = int(input())\r\ntask = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n task[i] = (task[i], i+1)\r\nswapCnt = 0\r\ntask.sort()\r\nfor i in range(n-1):\r\n if task[i][0] == task[i+1][0]:\r\n if swapCnt == 0:\r\n sol1 = task.copy()\r\n sol1[i], sol1[i+1] = sol1[i+1], sol1[i]\r\n else:\r\n sol2 = task.copy()\r\n sol2[i], sol2[i+1] = sol2[i+1], sol2[i]\r\n swapCnt+=1\r\n if swapCnt > 1:\r\n break\r\nif (swapCnt > 1):\r\n print(\"YES\")\r\n for x in task:\r\n print(x[1], end=\" \")\r\n print()\r\n for x in sol1:\r\n print(x[1], end=\" \")\r\n print()\r\n for x in sol2:\r\n print(x[1], end=\" \")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n,inp = int(input()),input().split(\" \")\r\ndict = [ [i,int(inp[i])] for i in range(n)]\r\ndict.sort(key=lambda i: i[1])\r\nval = [i[1] for i in dict]\r\nf = [i[0]+1 for i in dict]\r\ni = p = 0\r\nif len(val) - len(set(val)) < 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(\" \".join(map(str,f)))\r\n for i in range(n):\r\n if val[i:].count(val[i]) >= 2:\r\n if p==0:\r\n s = f[:]\r\n s[i],s[i+1] = s[i+1],s[i]\r\n p = 1\r\n print(\" \".join(map(str,s)))\r\n else:\r\n t = s[:]\r\n t[i],t[i+1] = t[i+1],t[i]\r\n print(\" \".join(map(str,t)))\r\n break", "n=int(input())\r\nx=list(map(int,input().split()))\r\nif n>=len(set(x))+2:\r\n print(\"YES\")\r\n y=[]\r\n for i in range(n):\r\n y.append([x[i],i+1])\r\n y.sort()\r\n y.sort(key=lambda i:i[0])\r\n for i in range(n):\r\n print(y[i][1],end=\" \")\r\n ind=1\r\n print(\"\")\r\n for i in range(1,n):\r\n if y[i][0]==y[i-1][0]:\r\n y[i],y[i-1]=y[i-1],y[i]\r\n ind=i+1\r\n break\r\n for i in range(n):\r\n print(y[i][1],end=\" \")\r\n print(\"\")\r\n for i in range(ind,n):\r\n if y[i][0]==y[i-1][0]:\r\n y[i],y[i-1]=y[i-1],y[i]\r\n for i in range(n):\r\n print(y[i][1],end=\" \")\r\n print(\"\")\r\nelse:\r\n print(\"NO\")", "from itertools import permutations\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nd2={}\r\nres=[]\r\nc=0\r\ndef bf(x,indeks=0):\r\n global c\r\n if c < 3:\r\n if indeks == le:\r\n for i in res:\r\n print(i,end=\" \")\r\n print()\r\n c+=1\r\n else:\r\n for i in permutations(x[indeks],len(x[indeks])):\r\n res.append(i)\r\n bf(x,indeks+1)\r\n res.pop()\r\n if c >= 3:\r\n break\r\nfor i in range(len(l)):\r\n try:\r\n d[l[i]].append(i+1)\r\n d2[l[i]]+=1\r\n except:\r\n d[l[i]]=[i+1]\r\n d2[l[i]]=1\r\n\r\nr=1\r\nfor i in d2.values():\r\n r=i\r\nif r < 3:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n p=dict(sorted(d.items(), key=lambda item: item[0]))\r\n k=list(p.values())\r\n le=len(k)\r\n bf(k)\r\n\r\n", "n = int(input());\r\ndifficulties = list(map(int, input().split()));\r\nsd = sorted([[difficulties[i], i] for i in range(n)], key = lambda k: k[0]);\r\nt = 0;\r\nbk = False;\r\nfor i in range(0, n-1):\r\n if(sd[i][0] == sd[i+1][0]):\r\n t += 1;\r\n if(t == 2):\r\n print(\"YES\");\r\n print([sd[j][1]+1 for j in range(0, n)]);\r\n t = 0;\r\n for k in range(0, n-1):\r\n if(sd[k][0] == sd[k+1][0]):\r\n t += 1;\r\n s = sd[k+1][1];\r\n sd[k+1][1] = sd[k][1];\r\n sd[k][1] = s;\r\n print([sd[k][1]+1 for k in range(0, n)]);\r\n s = sd[k+1][1];\r\n sd[k+1][1] = sd[k][1];\r\n sd[k][1] = s;\r\n if(t == 2):\r\n bk = True;\r\n break;\r\n if(bk == True):\r\n break;\r\nif(not bk):\r\n print(\"NO\");" ]	{"inputs": ["4\n1 3 3 1", "5\n2 4 1 4 8", "8\n1 5 4 12 7 2 10 11", "6\n5 1 2 5 2 4", "1\n1083", "10\n5 5 5 5 5 5 5 5 5 5", "6\n3 8 3 9 3 10", "19\n895 1302 724 952 340 952 939 1302 724 952 939 340 340 1844 770 976 435 1302 1302", "7\n766 766 1477 766 107 1774 990", "11\n1552 1010 1552 1248 1550 388 1541 1010 613 1821 388", "15\n688 848 1462 688 12 1336 1336 1113 1462 1074 659 1384 12 12 1074", "19\n65 117 159 402 117 402 65 1016 1850 1265 854 159 347 1501 117 805 854 117 1265", "3\n1282 101 420", "3\n1 1 1", "2\n1 1", "1\n1"], "outputs": ["YES\n1 4 2 3 \n4 1 2 3 \n4 1 3 2 ", "NO", "NO", "YES\n2 3 5 6 1 4 \n2 5 3 6 1 4 \n2 5 3 6 4 1 ", "NO", "YES\n1 2 3 4 5 6 7 8 9 10 \n2 1 3 4 5 6 7 8 9 10 \n2 3 1 4 5 6 7 8 9 10 ", "YES\n1 3 5 2 4 6 \n3 1 5 2 4 6 \n3 5 1 2 4 6 ", "YES\n5 12 13 17 3 9 15 1 7 11 4 6 10 16 2 8 18 19 14 \n12 5 13 17 3 9 15 1 7 11 4 6 10 16 2 8 18 19 14 \n12 13 5 17 3 9 15 1 7 11 4 6 10 16 2 8 18 19 14 ", "YES\n5 1 2 4 7 3 6 \n5 2 1 4 7 3 6 \n5 2 4 1 7 3 6 ", "YES\n6 11 9 2 8 4 7 5 1 3 10 \n11 6 9 2 8 4 7 5 1 3 10 \n11 6 9 8 2 4 7 5 1 3 10 ", "YES\n5 13 14 11 1 4 2 10 15 8 6 7 12 3 9 \n13 5 14 11 1 4 2 10 15 8 6 7 12 3 9 \n13 14 5 11 1 4 2 10 15 8 6 7 12 3 9 ", "YES\n1 7 2 5 15 18 3 12 13 4 6 16 11 17 8 10 19 14 9 \n7 1 2 5 15 18 3 12 13 4 6 16 11 17 8 10 19 14 9 \n7 1 5 2 15 18 3 12 13 4 6 16 11 17 8 10 19 14 9 ", "NO", "YES\n1 2 3 \n2 1 3 \n2 3 1 ", "NO", "NO"]}	UNKNOWN	PYTHON3	CODEFORCES	50
8bb5b84ac8b7a2f06ed0f1e18350f2ef	none	One of Timofey's birthday presents is a colourbook in a shape of an infinite plane. On the plane n rectangles with sides parallel to coordinate axes are situated. All sides of the rectangles have odd length. Rectangles cannot intersect, but they can touch each other. Help Timofey to color his rectangles in 4 different colors in such a way that every two rectangles touching each other by side would have different color, or determine that it is impossible. Two rectangles intersect if their intersection has positive area. Two rectangles touch by sides if there is a pair of sides such that their intersection has non-zero length The first line contains single integer n (1<=≤<=n<=≤<=5·105) — the number of rectangles. n lines follow. The i-th of these lines contains four integers x1, y1, x2 and y2 (<=-<=109<=≤<=x1<=<<=x2<=≤<=109, <=-<=109<=≤<=y1<=<<=y2<=≤<=109), that means that points (x1,<=y1) and (x2,<=y2) are the coordinates of two opposite corners of the i-th rectangle. It is guaranteed, that all sides of the rectangles have odd lengths and rectangles don't intersect each other. Print "NO" in the only line if it is impossible to color the rectangles in 4 different colors in such a way that every two rectangles touching each other by side would have different color. Otherwise, print "YES" in the first line. Then print n lines, in the i-th of them print single integer ci (1<=≤<=ci<=≤<=4) — the color of i-th rectangle. Sample Input 8 0 0 5 3 2 -1 5 0 -3 -4 2 -1 -1 -1 2 0 -3 0 0 5 5 2 10 3 7 -3 10 2 4 -2 7 -1 Sample Output YES 1 2 2 3 2 2 4 1	[ "n = int(input())\r\nprint(\"YES\")\r\nfor i in range(n):\r\n x1, y1, x2, y2 = input().split()\r\n x1 = int(x1)\r\n y1 = int(y1)\r\n print((x1 % 2) * 2 + (y1 % 2) + 1)", "p = int(input())\r\n\r\nprint(\"YES\")\r\n\r\nfor i in range(p):\r\n a, b, c, d = [abs(int(i)) for i in input().split()]\r\n if a % 2 == 0:\r\n print(\"1\" if b % 2 == 0 else \"2\")\r\n else:\r\n print(\"3\" if b % 2 == 0 else \"4\")", "from sys import stdin,stdout\r\nn = int(stdin.readline())\r\na = [0 for i in range(n)]\r\nfor i in range(n):\r\n inp = stdin.readline().split()\r\n x = int(inp[0])\r\n y = int(inp[1])\r\n a[i] = 2 * (x % 2) + (y % 2) + 1\r\nstdout.write(\"YES\")\r\nstdout.write('\\n')\r\nstdout.write(\"\\n\".join(str(i) for i in a))", "n = int(input())\r\nprint(\"YES\")\r\nfor i in range(n):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n print((x1 % 2) * 2 + (y1 % 2) + 1)", "def f():\n\tn = int(input())\n\ta = [1,2,3,4]\n\tprint(\"YES\")\n\tfor i in range(n):\n\t\tx = input().split()\n\t\tx = [int(j)%2 for j in x]\n\t\tprint(a[x[2]2+x[3]])\nf()", "n = int(input())\r\nprint(\"YES\")\r\nfor i in range(n):\r\n a, b, c, d = map(int, input().split())\r\n a = abs(a)\r\n b = abs(b)\r\n print((a % 2) 2 + b % 2 + 1)", "n=int(input())\n\nprint(\"YES\")\n\nwhile n:\n\n\t(x,y,a,b)=list(map(int, input().split()))\n\n\tprint(1+x%2+2(y%2))\n\n\tn=n-1\n\n\n\n# Made By Mostafa_Khaled", "print('YES')\r\nfor _ in range(int(input())):\r\n a,b,c,d = map(int,input().split())\r\n print((2(a%2))+(b%2)+1)", "print('YES')\r\nfor i in range(int(input())):\r\n\ta, b, c, d = map(int, input().split())\r\n\tprint(1 + abs(a) % 2 + abs(b) % 2 * 2)", "n = int(input())\r\nprint(\"YES\")\r\nfor i in range(n):\r\n x1, y1, x2, y2 = input().split()\r\n print((int(x1) % 2) * 2 + (int(y1) % 2) + 1)", "n = int(input())\r\nprint('YES')\r\nfor _ in range(n):\r\n x, y, z = list(map(int, input().split()))\r\n print((x & 1) 2 + (y & 1) + 1)", "print('YES')\r\nfor i in range(int(input())):\r\n x, y, a, b = [int(x) for x in input().split()]\r\n print(x % 2 + y % 2 * 2 + 1)", "import sys\r\nv = [int(x) for x in sys.stdin.read().split()]\r\nprint(\"YES\")\r\nfor i in range(v[0]): print(1+(v[4i+1]&1)+2(v[4i+2]&1))", "\nimport sys\n\n\ndef rl(): return sys.stdin.readline()\ndef ni(): return int(rl())\ndef nsa(): return rl().split()\ndef nia(): return [int(x) for x in nsa()]\ndef nnia(n): return [nia() for _ in range(n)]\n\n\nn = ni()\nrects = nnia(n)\n\nprint('YES')\nfor r in rects:\n print((r[0]%2)2+(r[1]%2)+1)\n", "import math\nimport sys\nn = int(input())\ncolor = []\nfor i in range(n):\n x1, y1, x2, y2 = map(int, input().split())\n col = 0\n if abs(x1) % 2 == 0:\n col += 1\n if abs(y1) % 2 == 0:\n col += 2\n color.append(str(col + 1))\nprint('YES')\nprint('\\n'.join(color))\n", "n = int (input())\r\nprint ('YES')\r\nfor i in range (0, n):\r\n a, b, c, d = [int(x) for x in (input().split())]\r\n print (1 + a%2 + (b%2) * 2)", "n = int(input())\r\nprint('YES')\r\nfor _ in range(n):\r\n\tx1, y1, x2, y2 = [int(el) for el in input().split()]\r\n\tprint(x1 % 2 + (y1 % 2) * 2 + 1)", "n = int(input())\r\ncoordinates = []\r\nfor i in range(n):\r\n coordinates.append([int(x) % 2 for x in input().split()])\r\nprint('YES')\r\nfor coordinate in coordinates:\r\n x1, y1, x2, y2 = coordinate\r\n print(2x2 + y2 + 1)\r\n", "'''plan\r\n noticed that if both upperle\r\n'''\r\nfrom sys import stdin, stdout\r\nn = int(stdin.readline().rstrip())\r\n# n = int(input())\r\ncoordinates = []\r\n# for i in range(n):\r\n # coordinates.append([int(x) % 2 for x in input().split()])\r\nfor i in range(n):\r\n coordinates.append([int(x) % 2 for x in stdin.readline().rstrip().split()])\r\nstdout.write('YES\\n')\r\nfor coordinate in coordinates:\r\n x1, y1, x2, y2 = coordinate\r\n stdout.write(str(2 x2 + y2 + 1) + '\\n')\r\n", "n=int(input())\r\nprint(\"YES\")\r\nfor i in range(0,n):\r\n a=list(map(int,input().split()))\r\n ans=2(a[0]&1)+(a[1]&1)+1\r\n print(ans)", "n = int(input())\nrectangles = []\nfor i in range(n):\n a, b, c, d = tuple(map(int,input().split()))\n rectangles.append((a,b))\n\nprint(\"YES\")\nfor i in range(n):\n a,b = rectangles[i][0], rectangles[i][1]\n if a%2 == 0 and b%2 == 0:\n print(1)\n elif a%2 == 0 and b%2 == 1:\n print(2)\n elif a%2 == 1 and b%2 == 0:\n print(3)\n else:\n print(4)\n", "n = int(input())\r\nprint('YES')\r\nfor _ in range(n):\r\n\tx1,y1,x2,y2 = [int(el) for el in input().split()]\r\n\tprint(x1%2+(y1%2)2+1)", "n = int(input())\r\nprint(\"YES\")\r\nfor i in range(n):\r\n t1, y1, x2, y2 = input().split()\r\n print((int(t1) % 2) * 2 + (int(y1) % 2) + 1)", "print('YES')\r\nfor i in range(int(input())):\r\n t = input().split()\r\n print(int(t[0]) % 2 + int(t[1]) % 2 * 2 + 1)" ]	{"inputs": ["8\n0 0 5 3\n2 -1 5 0\n-3 -4 2 -1\n-1 -1 2 0\n-3 0 0 5\n5 2 10 3\n7 -3 10 2\n4 -2 7 -1", "1\n0 0 1 1", "4\n0 0 1 1\n1 0 2 1\n1 1 2 2\n0 1 1 2", "3\n0 0 1 3\n1 0 4 1\n1 1 2 2", "6\n0 1 1 4\n0 4 1 7\n1 0 2 3\n1 3 2 4\n1 4 2 5\n2 3 3 4", "25\n0 0 7 7\n0 18 7 29\n7 36 12 41\n7 18 12 29\n15 29 26 36\n7 7 12 18\n12 36 15 41\n15 7 26 18\n12 0 15 7\n12 7 15 18\n7 29 12 36\n12 29 15 36\n15 18 26 29\n26 18 27 29\n12 18 15 29\n26 29 27 36\n0 7 7 18\n26 0 27 7\n7 0 12 7\n15 36 26 41\n26 7 27 18\n26 36 27 41\n15 0 26 7\n0 36 7 41\n0 29 7 36", "25\n76 0 85 9\n46 0 55 9\n6 0 13 9\n86 0 95 9\n56 0 65 9\n152 0 157 9\n146 0 151 9\n14 0 21 9\n0 0 1 9\n180 0 189 9\n120 0 125 9\n96 0 99 9\n126 0 133 9\n158 0 169 9\n22 0 27 9\n100 0 107 9\n170 0 179 9\n2 0 5 9\n134 0 141 9\n114 0 119 9\n108 0 113 9\n66 0 75 9\n36 0 45 9\n142 0 145 9\n28 0 35 9", "28\n0 0 3 1\n0 1 1 6\n0 6 1 9\n0 9 1 12\n0 12 1 13\n0 13 3 14\n1 1 2 4\n1 4 2 7\n1 7 2 10\n1 10 2 13\n2 1 3 2\n2 2 3 5\n2 5 3 8\n2 8 3 13\n3 0 6 1\n3 1 4 6\n3 6 4 9\n3 9 4 12\n3 12 4 13\n3 13 6 14\n4 1 5 4\n4 4 5 7\n4 7 5 10\n4 10 5 13\n5 1 6 2\n5 2 6 5\n5 5 6 8\n5 8 6 13", "4\n3 3 10 12\n5 0 14 3\n0 3 3 12\n0 0 5 3", "4\n3 11 12 18\n0 0 1 11\n0 11 3 18\n1 0 8 11"], "outputs": ["YES\n1\n4\n3\n2\n3\n3\n2\n1", "YES\n1", "YES\n1\n3\n4\n2", "YES\n1\n3\n4", "YES\n2\n1\n3\n4\n3\n2", "YES\n1\n1\n3\n3\n4\n4\n1\n4\n1\n2\n4\n2\n3\n1\n1\n2\n2\n1\n3\n3\n2\n1\n3\n1\n2", "YES\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1", "YES\n1\n2\n1\n2\n1\n2\n4\n3\n4\n3\n2\n1\n2\n1\n3\n4\n3\n4\n3\n4\n2\n1\n2\n1\n4\n3\n4\n3", "YES\n4\n3\n2\n1", "YES\n4\n1\n2\n3"]}	UNKNOWN	PYTHON3	CODEFORCES	24
8bbcbb9e2645ba1ed5dd33803c1dee7b	Text Volume	You are given a text of single-space separated words, consisting of small and capital Latin letters. Volume of the word is number of capital letters in the word. Volume of the text is maximum volume of all words in the text. Calculate the volume of the given text. The first line contains one integer number n (1<=≤<=n<=≤<=200) — length of the text. The second line contains text of single-space separated words s1,<=s2,<=...,<=si, consisting only of small and capital Latin letters. Print one integer number — volume of text. Sample Input 7 NonZERO 24 this is zero answer text 24 Harbour Space University Sample Output 5 0 1	[ "a = set()\r\na.add(0)\r\n\r\nn = int(input())\r\ns = input().split()\r\n\r\nc = 0\r\nfor i in s:\r\n\tfor j in i:\r\n\t\tif j.isupper():\r\n\t\t\tc+=1\r\n\ta.add(c)\r\n\tc = 0\r\n\r\na = sorted(a)\r\n\r\nprint(a[-1])", "n = int(input())\r\n\r\na = input().split()\r\n\r\nans = 0\r\n\r\ndef f(s):\r\n res = 0\r\n for i in range(0,len(s)):\r\n if 'A' <= s[i] <= 'Z':\r\n res+=1\r\n return res\r\n\r\nfor i in range(0,len(a)):\r\n ans = max(ans,f(a[i]))\r\n\r\nprint(int(ans))\r\n", "size = int(input())\r\nst = str(input())\r\ncounter = 0\r\nmaximal = 0\r\nfor i in range(0, size):\r\n if st[i] < 'a' and st[i] != ' ':\r\n counter += 1\r\n if st[i] == ' ' or i == (size - 1):\r\n if maximal < counter:\r\n maximal = counter\r\n counter = 0\r\nprint(maximal)", "input()\r\ns = input()\r\nwo = s.split()\r\nmaxim = 0;\r\nfor word in wo:\r\n val = 0\r\n for i in word:\r\n if (i < \"a\"):\r\n val +=1\r\n maxim= max(maxim, val)\r\nprint(maxim)", "inp = int(input())\nmas = list(input().split())\n\nmaxx = 0\n\nfor i in mas:\n now = 0\n for j in i:\n #print(ord(j))\n if ord(j) < 91:\n now += 1\n if maxx < now:\n maxx = now\n\nprint(maxx)\n", "n = input()\r\nl = list(input().split())\r\n\r\nx = []\r\n\r\nfor i in l:\r\n\tv = 0\r\n\t\r\n\tfor j in i:\r\n\t\tif 90 >= ord(j) >= 65:\r\n\t\t\tv += 1\r\n\t\t\t\r\n\tx.append(v)\r\n\t\r\nprint(max(x))", "n = int(input())\ns = input().split()\ncur_min, cur_max = 0, 0\nfor i in range(len(s)):\n for k in range(len(s[i])):\n if s[i][k].istitle():\n cur_min += 1\n if cur_min > cur_max:\n cur_max = cur_min\n cur_min = 0\nprint(cur_max)\n", "import functools as fn\r\n\r\ndef volume(str):\r\n return fn.reduce(lambda a,b : a + b, [1 if c.isupper() else 0 for c in str]) \r\n \r\nn = int(input())\r\n\r\nans = fn.reduce(lambda a,b : a if a > b else b, [volume(s) for s in input().split(' ')])\r\n\r\nprint(ans)", "volumes = []\r\nn = int(input())\r\ns = input()\r\nsk = 0\r\nspaces = 1\r\ntemp = 0\r\nfor i in range(n):\r\n if s[i] == s[i].upper() and s[i] != \" \":\r\n temp += 1\r\n if s[i] == \" \":\r\n volumes.append(temp)\r\n temp = 0\r\n elif i == len(s)-1:\r\n volumes.append(temp)\r\n temp = 0\r\n \r\nprint(max(volumes))\r\n ", "n = int(input())\r\narr=[]\r\ns = input()\r\narr = s.split(' ')\r\narr1=[]\r\nfor x in arr:\r\n v = 0;\r\n for i in x:\r\n if i.isupper():\r\n v = v+1\r\n arr1.append(v)\r\narr1.sort(reverse = True)\r\nprint(arr1[0])\r\n ", "x = input()\nn = input().split()\nmaxCap = 0\ncap = 0\nfor x in n:\n for i in x:\n if i.isupper():\n cap += 1\n if cap > maxCap:\n maxCap = cap\n cap = 0\nprint(maxCap)\n\t\t\t \t\t \t \t \t\t\t \t\t \t\t \t", "x=input()\r\nn=input().split(' ')\r\nans=0\r\nfor i in n:\r\n cur=0\r\n for j in i:\r\n if j>='A' and j<='Z':\r\n cur+=1\r\n ans=max(ans,cur)\r\nprint(ans)", "n= int(input())\r\ns= input()\r\nmas= [\"A\", 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K',\r\n 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']\r\ncountmax = 0\r\nwords= s.split()\r\nfor i in words:\r\n count = 0\r\n for el in i:\r\n if el in mas:\r\n count += 1\r\n if countmax < count:\r\n countmax = count\r\nprint (countmax)", "n=int(input())\r\nstr=list(input())\r\ncnt=0\r\nm=0\r\nfor i in str:\r\n if ord('A')<=ord(i)<=ord('Z'):\r\n cnt+=1\r\n if i==' ':\r\n m=max(cnt,m)\r\n cnt=0\r\nm=max(cnt,m)\r\nprint(m)", "n = input()\r\na = input().split()\r\nmx = 0\r\nfor i in a:\r\n cur = 0\r\n for j in range(len(i)):\r\n if i[j] >= 'A' and i[j] <= 'Z':\r\n cur += 1\r\n mx = max(mx, cur)\r\nprint(mx)", "n = int(input())\nentrada = input()\n\ncount = 0\nv = []\n\nfor c in entrada:\n if c.isupper():\n count+=1\n elif c.isspace():\n v.append(count)\n count = 0\nv.append(count)\nprint(max(v))\n \t\t \t \t \t \t \t\t\t\t \t \t\t \t\t", "tmp = input()\na = input().split()\nans = 0\n\ndef solve(x):\n cnt = 0\n for c in x:\n if 'A'<=c and c<='Z':\n cnt += 1\n return cnt\n\nfor word in a:\n ans = max(ans, solve(word))\nprint(ans)\n", "\r\nnumLetters = input()\r\n\r\nlistOfWords = input()\r\n\r\nmaxCap = 0\r\n\r\nwordList = listOfWords.split()\r\n\r\nfor item in wordList:\r\n numUp = 0\r\n for char in item:\r\n if char.isupper():\r\n numUp += 1\r\n\r\n if numUp > maxCap:\r\n maxCap = numUp\r\n\r\nprint (maxCap)", "a=input()\r\na=input().split()\r\nbest=0\r\nfor i in a:\r\n ans=0\r\n for l in i:\r\n if l>='A' and l<='Z':\r\n ans+=1\r\n if ans>best:\r\n best=ans\r\nprint(best)", "from string import ascii_uppercase as upper\r\n\r\nn = int(input())\r\nstr = input().split(' ')\r\ncnts = []\r\n\r\nfor st in str:\r\n c = 0\r\n for s in st:\r\n if s in upper:\r\n c += 1\r\n cnts.append(c)\r\n\r\nprint(max(cnts))\r\n\r\n", "n, text= input(), input()\r\nprint(max([sum([ch1 != ch2 for ch1, ch2 in zip(word, word.lower())]) for word in text.split()]))\r\n", "n = int(input())\r\nstr_voulve = input().split()\r\nanswer = 0\r\nnumber_upper_word = 0 \r\nfor i in str_voulve:\r\n number_upper_word = 0 \r\n for word in i:\r\n if word.upper() ==word:\r\n number_upper_word+=1\r\n if number_upper_word > answer:\r\n answer = number_upper_word\r\nprint(answer) \r\n", "# http://codeforces.com/problemset/problem/837/A\r\ninput()\r\n\r\nwords=input().split()\r\nprint(max(map(lambda w:sum(map(str.isupper,w)),words)))\r\n", "n = int(input())\na = input().split(\" \")\n\nmaxVolume = 0\nfor word in a:\n counter = 0\n for letter in word:\n if ord(letter) < 91:\n counter += 1\n maxVolume = max(maxVolume,counter)\nprint(maxVolume)\n\t \t \t\t \t\t\t \t \t \t\t \t\t\t\t", "n,l=int(input()),list(map(str,input().split()))\r\nx,y=0,0\r\nfor i in range(len(l)):\r\n for j in l[i]:\r\n if j.isupper():\r\n x=x+1\r\n if x>y:\r\n y=x\r\n x=0;\r\nprint(y)", "n=int(input())\r\na=[i for i in input().split()]\r\n\r\nprint(max([len([c for c in e if c.isupper()]) for e in a]))", "import string\r\ninput()\r\nprint(max([eval(f\"sum([\\\"{x}\\\".count(e) for e in string.ascii_uppercase])\") for x in input().split()]))", "n=int(input())\r\ns=str(input())\r\nlow=0\r\ncount=0\r\nfor i in range(n):\r\n if(s[i]>='A' and s[i]<='Z'):\r\n count=count+1\r\n if count>low:\r\n low=count\r\n if(s[i]==\" \"):\r\n count=0\r\n\r\n\r\nprint(low)\r\n \r\n", "n,s = int(input()),input().split()\r\nmx = 0\r\nfor word in s:\r\n temp = 0\r\n for i in word:\r\n if i.isupper():\r\n temp += 1\r\n mx = max(mx,temp)\r\nprint(mx)\r\n", "n = int(input())\r\nlist1 = input()\r\ncount = 0\r\nlist2 = [0]\r\nfor i in list1:\r\n if i == ' ':\r\n count = 0\r\n list2.append(0)\r\n elif i >= 'A' and i <= 'Z':\r\n count +=1 \r\n list2[len(list2)-1] += 1\r\nprint(max(list2))\r\n\r\n", "n=int(input())\ns=input()\nmaximo=0\ncont=0\nfor i in range(0,n):\n if s[i]==\" \":\n cont=0\n elif ord(s[i]) > 64 and ord(s[i])<91:\n cont+=1\n if cont > maximo:\n maximo=cont\nprint(maximo)\n \t\t\t\t\t \t \t\t \t\t \t \t\t\t\t\t\t\t \t", "a=int(input())\r\ns=input().split()\r\nm=0\r\nfor i in s:\r\n\tv=0\r\n\tfor j in i:\r\n\t\tif ord(j)>64 and ord(j)<91:\r\n\t\t\tv=v+1\r\n\tif v>m:\r\n\t\t\tm=v\r\nprint(m)", "def volume(s):\n\tans = 0 \n\tfor item in s:\n\t\tif item.isupper():\n\t\t\tans += 1\n\treturn ans\n\ninput()\ns = input().split()\nans = 0 \nfor item in s:\n\tans = max(ans,volume(item))\nprint(ans)\n", "n = input()\r\ns = input().split()\r\ntotal = 0\r\nfor i in s:\r\n t = 0\r\n for j in i:\r\n if j.isupper():\r\n t += 1\r\n if total < t:\r\n total = t\r\nprint(total)", "n = int(input())\nphrase = str(input())\nwords = phrase.split(' ')\nvolumes = []\n\ndef get_volume(word):\n v = 0\n for l in word:\n if l.isupper():\n v += 1\n return v\n\nfor word in words:\n volumes.append(get_volume(word))\n\nprint(max(volumes))\n", "n = int(input())\r\nprint(max(sum(map(str.isupper, i)) for i in input().split()))\r\n", "n=int(input())\r\nlist1=[x for x in input().split()]\r\n\r\nif len(list1)==1:\r\n count=0\r\n for i in range(len(list1[0])):\r\n if list1[0][i].isupper():\r\n count+=1\r\n print(count)\r\nelse:\r\n maxCount=0\r\n for i in range(len(list1)):\r\n count=0\r\n for j in range(len(list1[i])):\r\n if list1[i][j].isupper():\r\n count+=1\r\n if count>=maxCount:\r\n maxCount=count\r\n print(maxCount)\r\n", "n = int(input())\r\nx = input()\r\nx = x.split()\r\nm = 0\r\nfor i in range(len(x)):\r\n c = 0\r\n for j in range(len(x[i])):\r\n if(x[i][j].isupper()):\r\n c+=1\r\n m = max(m,c)\r\nprint(m)", "from math import gcd\r\ndef inp():\r\n return int(input())\r\ndef linp():\r\n return list(map(str, input().split(' ')))\r\ndef minp():\r\n return map(int, input().split(' '))\r\nn = inp()\r\na = linp()\r\nb = []\r\nb.append(0)\r\nfor k in a:\r\n cnt = 0\r\n for i in k:\r\n if i.isupper() :\r\n cnt+=1\r\n b.append(cnt)\r\nb = sorted(b)\r\nprint(b[len(b)-1])", "n = int(input())\r\ns = str(input())\r\ncnt = ans = 0\r\n\r\nfor x in s:\r\n if x.isupper():\r\n cnt += 1\r\n elif x == ' ':\r\n cnt = 0\r\n ans = max(ans, cnt)\r\n\r\nprint(ans)", "n=int(input())\r\nl=input().split()\r\nmaxi=0 \r\nfor i in l:\r\n curr=i \r\n maxi=max(maxi,sum(i.isupper() for i in curr))\r\nprint(maxi)", "l = int(input())\r\ns = input().split()\r\nls = [0] * len(s)\r\ndef wv (string):\r\n\tt = 0\r\n\tfor i in range(len(string)):\r\n\t\tif string[i] == string[i].upper():\r\n\t\t\tt = t + 1\r\n\treturn t\r\nfor i in range(len(s)):\r\n\tls[i] = wv(s[i])\r\nls.sort()\r\nprint(ls[len(s)-1])\r\n\r\n", "n=int(input())\r\ns=input().split()\r\nm=0\r\nfor i in s:\r\n c=0\r\n for j in i:\r\n if j.isupper():\r\n c=c+1\r\n m=max(m,c)\r\nprint(m)", "n=int(input())\r\ns=input()\r\n\r\na=[]\r\ncount=0\r\ni=0\r\nwhile(i!=len(s)):\r\n if s[i]!=\" \" and s[i].isupper():\r\n count+=1\r\n i+=1\r\n elif s[i]==\" \":\r\n a.append(count)\r\n count=0\r\n i+=1\r\n else:\r\n i+=1\r\na.append(count)\r\nif len(a)>1:\r\n print(max(a))\r\nelse:\r\n print(a)", "n=int(input())\r\ns=list(input())\r\nx=[]\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n c+=1\r\n elif s[i]==\" \":\r\n x.append(c)\r\n c=0\r\n x.append(c)\r\nprint(max(x))\r\n \r\n ", "n = int(input())\r\ncad = input()\r\n\r\npals = cad.split(\" \")\r\n\r\nsol=0\r\nsolfinal=0\r\nfor pal in pals:\r\n for c in pal:\r\n if c >= 'A' and c <= 'Z':\r\n sol = sol+1\r\n if sol >= solfinal:\r\n solfinal = sol\r\n\r\n sol=0\r\n\r\nprint(solfinal)\r\n", "a=int(input())\r\nb=input()\r\nc=b.split()\r\nmax=0\r\nfor i in c:\r\n sum=0\r\n for k in i:\r\n if k.isupper():\r\n sum+=1\r\n if sum>max:\r\n max=sum\r\nprint(max)\r\n \r\n \r\n", "n=int(input())\r\ns=input().split()\r\nans=0\r\nfor i in s:\r\n cnt=0\r\n for c in i:\r\n if(c.isupper()):\r\n cnt+=1\r\n ans=max(ans,cnt)\r\nprint(ans)\r\n", "n = input()\r\ns = input()\r\n\r\ndef f(s):\r\n return sum(1 if x.isupper() else 0 for x in s)\r\n\r\nt = max(f(x) for x in s.split())\r\nprint(t)", "input()\r\nprint(max([len(\"\".join(filter(lambda X: X.isupper(), i))) for i in list(input().split())]))\r\n", "n=int(input())\r\ns=input().split()\r\na=[]\r\nfor val in s:\r\n count=0\r\n for j in range (len(val)):\r\n if 'A'<=val[j]<='Z':\r\n count+=1 \r\n a.append(count)\r\n \r\nprint(max(a))", "length=input()\r\nl=list(input().split())\r\na=[]\r\nfor i in l:\r\n n=0\r\n for j in i:\r\n if ord(j)<91:\r\n n=n+1\r\n a.append(n)\r\nprint(max(a))", "n = int(input())\r\nwords = input().split(\" \")\r\nres = 0\r\nfor word in words:\r\n temp = sum(1 for c in word if c.isupper())\r\n res = max(res, temp)\r\n\r\nprint(res)", "def main():\n N = int(input())\n S = input()\n\n cnt = 0\n max_ = 0\n for s in S:\n if 'A' <= s <= 'Z':\n cnt += 1\n elif s == ' ':\n max_ = max(max_, cnt)\n cnt = 0\n max_ = max(max_, cnt)\n\n print(max_)\n\nmain()\n", "# A. Text Volume\n\nn = int(input())\ns = list(map(str, input().split()))\n\nmax_volume = 0\nfor word in s:\n volume = 0\n for ch in word:\n if ch.isupper():\n volume += 1\n max_volume = max(max_volume, volume)\n\nprint(max_volume)\n", "n = int(input())\r\ns = input()\r\nc = 0\r\nt = 0\r\nfor i in range(n):\r\n\tif(s[i]>= 'A' and s[i]<= 'Z'):\r\n\t\tc+=1\r\n\tif(s[i]== ' '):\r\n\t\tt = max(t,c)\r\n\t\tc = 0\r\nt = max(t,c)\r\nprint(t)", "n = int(input())\r\ns = input().split()\r\nres = 0\r\n\r\nfor palavra in s:\r\n ss = 0\r\n for c in palavra:\r\n if c.isupper():\r\n ss += 1\r\n res = max(res, ss)\r\n\r\nprint(res)", "import sys\r\n\r\ndef main():\r\n _, s = sys.stdin.read().strip().split()\r\n return max(sum(i.isupper() for i in j) for j in s)\r\n\r\nprint(main())\r\n", "n=int(input())\r\nl=list(input().split(' '))\r\nc=0\r\nll=[]\r\nfor i in l:\r\n for t in i:\r\n if ord(t)>=65 and ord(t)<=90:\r\n c=c+1\r\n ll.append(c)\r\n c=0\r\nprint(max(ll))", "import re\r\n\r\nn = int(input())\r\ns = input().split(' ')\r\n\r\ncount = lambda x: len(re.findall(r'[A-Z]', x))\r\nprint(max([count(i) for i in s]))\r\n", "n = int(input())\r\ns = input().split()\r\nans = 0\r\n\r\nfor i in s:\r\n c = 0\r\n for j in i:\r\n if j.isupper():\r\n c += 1\r\n\r\n ans = max(ans, c)\r\n\r\nprint(ans)", "n = int(input().strip())\n\nwords = input().strip().split(' ')\n\nmax = float('-inf')\n\nfor word in words:\n curr_max = 0\n for char in word:\n if char.isupper() and char.isalpha():\n curr_max+=1\n if curr_max > max:\n max = curr_max\nprint(max)\n", "print(max(sum(x.isupper()for x in y)for y in [open(0)][1].split()))", "n = int(input())\r\ntxt = input()\r\ncounter = []\r\nfor word in txt.split():\r\n c = 0\r\n for k in word:\r\n if k.isupper():\r\n c += 1\r\n counter.append(c)\r\nprint(max(counter))", "#!/usr/bin/env python3\n\n\ndef main():\n _ = input()\n words = input().split()\n ans = 0\n for word in words:\n ans = max(sum(1 for c in word if c.isupper()), ans)\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n", "input()\r\nans = 0\r\nfor str in input().split():\r\n\ttemp = 0\r\n\tfor char in str:\r\n\t\tif char.isupper():\r\n\t\t\ttemp+=1\r\n\tans = max( ans , temp )\r\nprint(ans)\r\n", "n = int (input ())\ns = input ()\ncount = 0\nmaxi = 0\nfor i in s:\n if i.isspace ():\n if count > maxi :\n maxi = count\n count = 0\n else:\n if i.isupper():\n count += 1\nif count > maxi:\n print (count)\nelse:\n print (maxi)\n", "a=int(input())\r\n\r\n\r\nt=list(input().split())\r\n\r\nw=0\r\n\r\nfor k in t:\r\n o=0\r\n for i in k:\r\n if 65<=ord(i)<=90:\r\n o+=1\r\n if o>w:\r\n w=o\r\n\r\nprint(w)\r\n", "\r\n\r\ndef klv_zag(s):\r\n\tklv=0\r\n\tfor c in s :\r\n\t\tif c==c.upper() : \r\n\t\t\tklv+=1\r\n\t\t\t#print(c)\r\n\treturn klv\r\n\r\n#########\r\n\r\n#print(klv_zag(\"gDWaxZLJ\"))\r\n\r\n#s=\"SviN boroVeJKa PoRoSIn hello\"\r\nk=input()\r\ns=input()\r\nm=s.split(\" \")\r\nm=map(klv_zag, m)\r\nprint(max(m))\r\n", "dai=int(input())\r\ntu=input()\r\nrs=0\r\ntemp=0\r\nfor i in tu:\r\n if i==i.upper() and i!=\" \":\r\n temp+=1\r\n elif i==\" \":\r\n if temp>rs:\r\n rs=temp\r\n temp=0\r\nif temp>rs:\r\n rs=temp\r\nprint(rs)", "n = int(input())\ntext = input()\nll = list(text.split())\nnum = []\nfor i in range(len(ll)):\n num.append(sum(1 for c in ll[i] if c.isupper()))\nprint(max(num))\n\n\n \t \t\t \t \t \t \t\t \t\t\t \t\t\t \t \t\t\t", "input()\r\nprint(max(map(lambda x: sum(c.isupper() for c in x), input().split())))", "#--------------------#\r\n#INCLUDE <HajLorenzo>\r\n#INCLUDE <Dast_Garmi>\r\n#INCLUDE <HAVE_FUN>\r\n#DEFINE CODE_3\r\n#--------------------#\r\n\r\n\r\ndef upperCase(st):\r\n sum=0\r\n for i in range(len(st)):\r\n if(st[i].isupper()):\r\n sum+=1\r\n return sum\r\n \r\ninput()\r\na=list(input().split())\r\n_=[]\r\nfor __ in range(len(a)):_.append(upperCase(a[__]))\r\nprint(max(_))\r\n\r\n\r\n\r\n\r\n'''UseFull Code\r\na=list(map(int,input().split()))\r\nprint(\"Yes\" if() else \"No\")\r\n'''\r\n\r\n", "def solve(t):\r\n mx = []\r\n for i in range(len(t)):\r\n cnt = 0\r\n for j in range(len(t[i])):\r\n if t[i][j].istitle():\r\n cnt+=1\r\n \r\n mx.append(cnt) \r\n \r\n return max(mx)\r\nn = int(input())\r\nt = list(input().split())\r\nprint(solve(t))", "n = input()\nv = input().split()\nm = 0\nfor x in v:\n m = max(m, sum(map(lambda x: ord(x) < 97, x)))\nprint(m)\n", "import sys\r\nans = 0\r\ninput()\r\n\r\nfor word in input().split():\r\n vol = 0\r\n for c in word:\r\n if 65 <= ord(c) <= 90:\r\n vol += 1\r\n ans = max(ans, vol)\r\n\r\nprint(ans)\r\n", "n=int(input())\r\ns=[str(n) for n in input().split(\" \") ]\r\na=[0]n\r\ns_b=\"QWERTYUIOPASDFGHJKLZXCVBNM\"\r\nfor i in range(len(s)):\r\n for j in range(len(s[i])):\r\n if s[i][j] in s_b:\r\n a[i]+=1\r\nprint(max(a))\r\n\r\n", "a=int(input())\r\nn=input()\r\nl=[]\r\nt=0\r\nl.insert(t,0)\r\nfor i in range(0,a):\r\n\tif ((ord(n[i])>=65) and (ord(n[i])<=90)):l[t]+=1\r\n\tif (ord(n[i])==32):\r\n\t\tt+=1\r\n\t\tl.insert(t,0)\r\nprint(max(l))", "input()\r\ns = input() + ' '\r\n\r\nc, d = 0, 0\r\nfor i in s:\r\n if i.isupper():\r\n c += 1\r\n if i == ' ':\r\n if d < c:\r\n d = c\r\n c = 0\r\nprint(d)", "def count_if(l, cond):\r\n return sum(1 for x in l if cond(x))\r\n \r\nn = input()\r\nans = max(map(lambda y: count_if(y, lambda t: t.isupper()), input().split(' ')))\r\nprint(ans)", "# LUOGU_RID: 125983850\ninput()\r\nmx=0\r\nfor i in input().split():\r\n\tmx=max(mx,sum([ord(j)>=ord('A') and ord(j)<=ord('Z') for j in i]))\r\nprint(mx)", "n = int(input())\r\ns = input()\r\nwords = s.split(' ')\r\nletters = [chr(i) for i in range(65, 91)]\r\nans = 0\r\nfor word in words:\r\n temps = word\r\n for letter in letters:\r\n temps = temps.replace(letter, '')\r\n ans = max(ans, len(word) - len(temps))\r\n\r\nprint(ans)", "n = int(input())\r\ns = input()\r\nws = s.split()\r\n\r\nr_max = 0\r\nfor w in ws:\r\n r = 0\r\n for l in w:\r\n if l.isupper():\r\n r += 1\r\n r_max = max(r, r_max)\r\n\r\nprint(r_max)\r\n", "n = int(input())\r\n\r\ns = input().split()\r\nm = 0\r\n\r\nfor i in s:\r\n c = 0\r\n for j in i:\r\n if j.isupper():\r\n c += 1\r\n m = max(m, c)\r\nprint(m)\r\n", "#!/bin/python3\r\n\r\nimport sys\r\nimport string\r\n\r\nimport math\r\n\r\ndef countsetBits(n):\r\n count=0\r\n while n>0:\r\n n&=(n-1)\r\n count+=1\r\n return count\r\nimport operator\r\n\r\nn = int(input().strip())\r\ncount=0\r\na = [x for x in input().strip().split(' ')]\r\nfor word in a:\r\n temp =0\r\n for letter in word:\r\n if letter.isupper():\r\n temp+=1\r\n count = max(count,temp)\r\nprint(count)", "n = int(input())\r\ns = [el for el in input().split()]\r\nres = 0\r\nfor el in s:\r\n cnt = 0\r\n for i in range(len(el)):\r\n if el[i].isupper():\r\n cnt += 1\r\n res = max(res, cnt)\r\nprint(res)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = list(input().rstrip().split(\" \"))\r\n\r\nmv = -1\r\nfor i in data:\r\n mv = max(mv, len([j for j in i if j.isupper()]))\r\n\r\nprint(mv)\r\n", "n = int(input())\r\ntext = input().split()\r\narr = []\r\nfor i in range(len(text)):\r\n vol = 0\r\n for j in range(len(text[i])):\r\n if text[i][j].isupper():\r\n vol += 1\r\n arr.append(vol)\r\nprint(max(arr))", "n = int(input())\r\ns = input().split()\r\nans = 0\r\nfor i in range(len(s)):\r\n caps = 0\r\n for j in range(len(s[i])):\r\n if s[i][j].isupper():\r\n caps+=1\r\n ans = max(caps, ans)\r\nprint(ans)\r\n ", "n = input()\r\na = input().split()\r\nans = 0\r\nfor i in a:\r\n now = 0\r\n for j in i:\r\n if j == j.upper():\r\n now += 1\r\n ans = max(now, ans)\r\nprint(ans)\r\n", "import math as mt \nimport sys,string\ninput=sys.stdin.readline\nfrom collections import defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\n\nt=1\nfor _ in range(t):\n n=I()\n s=list(input().split())\n m=0\n for i in range(len(s)):\n c=0\n for j in s[i]:\n if(j>='A' and j<='Z'):\n c+=1\n m=max(m,c)\n print(m)\n", "n=int(input())\r\nx=list(input())\r\nk=0\r\na=[]\r\nfor i in range(n):\r\n if x[i].isupper()==1:\r\n k+=1\r\n elif x[i]==\" \":\r\n a.append(k)\r\n k=0\r\n if i==n-1:\r\n a.append(k)\r\nprint(max(a))\r\n", "\"\"\"====================================================================================\r\n ====================================================================================\r\n \r\n ___ _______ ___ _______ ___ ___\r\n \| /\\ \| \| \\ \| \| / \| \| \| \| \|\\ /\|\r\n \| / \\ \| \| \\ \| \| / \| \| \| \| \| \\ / \|\r\n \|___ /____\\ \| \| \\ \| \|/ \|___\| \| \| \| \\/ \|\r\n \| / \\ \| \| / \| \|\\ \|\\ \| \| \| \|\r\n \| / \\ \| \| / \| \| \\ \| \\ \| \| \| \|\r\n ___\|/ \\___\|___ \|___/ ___\|___ \| \\ \| \\ \|___\| \| \|\r\n \r\n \r\n ====================================================================================\r\n ==================================================================================== \r\n\"\"\"\r\n# ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥\r\nn = int(input())\r\nl = list(map(str,input().split()))\r\ns = []\r\na = 0\r\nfor i in range(len(l)):\r\n for j in range(len(l[i])):\r\n if l[i][j] == l[i][j].upper():\r\n a += 1\r\n s.append(a)\r\n a = 0\r\nprint(max(s))\r\n\r\n# ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥\r\n\"\"\"====================================================================================\r\n ====================================================================================\r\n \r\n ___ _______ ___ _______ ___ ___\r\n \| /\\ \| \| \\ \| \| / \| \| \| \| \|\\ /\|\r\n \| / \\ \| \| \\ \| \| / \| \| \| \| \| \\ / \|\r\n \|___ /____\\ \| \| \\ \| \|/ \|___\| \| \| \| \\/ \|\r\n \| / \\ \| \| / \| \|\\ \|\\ \| \| \| \|\r\n \| / \\ \| \| / \| \| \\ \| \\ \| \| \| \|\r\n ___\|/ \\___\|___ \|___/ ___\|___ \| \\ \| \\ \|___\| \| \|\r\n \r\n \r\n ====================================================================================\r\n ==================================================================================== \r\n\"\"\"\r\n", "def ri():\n return int(input())\n\ndef rl():\n return list(map(int, input().split()))\n\ndef solve():\n n = ri()\n m = 0\n curr = 0\n for c in input():\n if c in 'QWERTYUIOPASDFGHJKLZXCVBNM':\n curr += 1\n elif c == ' ':\n curr = 0\n m = max(m, curr)\n print (m)\n\nsolve()\n", "leng = int(input())\r\nstrTemp = input().split()\r\nanswer = 0\r\nfor word in strTemp:\r\n wordLst = list(word)\r\n answerTemp = 0\r\n for ch in wordLst:\r\n if(ch.isupper()):\r\n answerTemp += 1\r\n if(answerTemp > answer):\r\n answer = answerTemp\r\nprint(answer)", "n=int(input())\r\ns=input()\r\nlst=s.split(\" \")\r\nmaxi=0\r\nsumi=0\r\nfor i in lst:\r\n sumi=0\r\n for j in i:\r\n if j.isupper():\r\n sumi+=1 \r\n maxi=max(maxi,sumi)\r\nprint(maxi)", "n = int(input())\r\nk = input().split()\r\nvolume = 0\r\nmaximum = []\r\nfor i in k:\r\n\tfor m in i:\r\n\t\tif m.isupper() == True:\r\n\t\t\tvolume += 1\r\n\tmaximum.append(volume)\r\n\tvolume = 0\r\nprint(max(maximum))\r\n", "ln = int(input())\r\ns = input()\r\n\r\narr = s.split()\r\nvol = []\r\n\r\nfor word in arr:\r\n volume = 0\r\n for ch in word:\r\n if ch.upper() == ch:\r\n volume += 1\r\n else:\r\n continue\r\n vol.append(volume)\r\n\r\nprint(max(vol))", "\nInput=lambda:map(str,input().split())\n\ndef cal(s):\n c = 0\n for i in s:\n if i.isupper():\n c+=1\n return c\ninput()\nMAX = -float('inf')\nText = list(Input())\nfor i in Text:\n MAX = max(MAX,cal(i))\nprint(MAX)", "n = input()\r\n\r\ntext = input()\r\n\r\ncount = 0\r\n\r\ncount_list = []\r\n\r\nanswer = -1\r\n\r\nfor i in range(0, len(text)):\r\n\r\n\tif text[i].isupper():\r\n\r\n\t\tcount += 1\r\n\r\n\tif text[i] == \" \" or i == len(text) - 1:\r\n\t\t\r\n\t\tcount_list.append(count)\r\n\r\n\t\tcount = 0\r\n\r\nanswer = max(count_list)\r\n\r\nprint(answer)", "n = int(input())\r\ns = input()\r\n\r\n# Initialize max_volume\r\nmax_volume = 0 \r\n\r\n# Count the number of capital letters in each word \r\nfor word in s.split():\r\n word_volume = 0\r\n for letter in word:\r\n if letter.isupper():\r\n word_volume += 1\r\n # Update the value of max_volume\r\n if word_volume > max_volume:\r\n max_volume = word_volume\r\n \r\n# Print the result\r\nprint(max_volume)", "n = int(input())\r\ns = list(map(str,input().split()))\r\nma_count = count = 0\r\nfor i in s:\r\n count = 0\r\n for j in i:\r\n if(j>='A' and j<='Z'):\r\n count+=1\r\n ma_count = max(ma_count,count)\r\nprint(ma_count)", "n, = map(int,input().split())\r\ns = input()\r\n\r\nmx = 0\r\nfor k in s.split():\r\n mx = max(mx,len([x for x in k if x.isupper()]))\r\nprint(mx)", "n=int(input())\r\ns=input().split()\r\nk=0\r\nm=0\r\nfor x in s:\r\n for y in x:\r\n k+=64<ord(y)<91\r\n m=max(m,k)\r\n k=0\r\nprint(m)", "import re\r\nn=int(input())\r\ns=input().split()\r\nm=0\r\nfor i in s:\r\n y=len(i)\r\n x=len(re.sub('[A-Z]','',i))\r\n m=max(m,y-x)\r\nprint(m)", "n = int(input())\r\ns = input().split()\r\nc = 0\r\n\r\nfor i in s:\r\n x = 0\r\n for y in i:\r\n if y.isupper():\r\n x += 1\r\n if x > c:\r\n c = x\r\nprint(c)", "n = input()\r\ns = input()\r\nl = s.split()\r\nans = 0\r\nfor i in l:\r\n\tcnt = 0\r\n\tfor j in i:\r\n\t\tif j.isupper() == True:\r\n\t\t\tcnt += 1\r\n\tans = max(ans, cnt)\r\nprint(ans)", "\nCAPITAL_LETTER = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n\n\ndef fun(s: str) -> int:\n word_lst = s.split(\" \")\n max_cnt = 0\n for word in word_lst:\n cnt = 0\n for c in word:\n cnt = cnt + 1 if c in CAPITAL_LETTER else cnt\n max_cnt = max(max_cnt, cnt)\n return max_cnt\n\n\nif __name__ == '__main__':\n input_s_len = int(input())\n input_s = input()\n print(fun(input_s))\n \t\t \t \t \t\t\t \t \t\t\t \t", "n = int(input())\r\ns = str(input())\r\n\r\nres = 0\r\nlocal_count = 0\r\nfor i in s:\r\n if i == \" \":\r\n local_count = 0\r\n elif i.isupper():\r\n local_count += 1\r\n res = max(res, local_count)\r\nprint(res)", "n = int(input())\nwords = input().split(' ')\n\nmax_loudness = 0\nfor word in words:\n loudness = sum(char.isupper() for char in word)\n if loudness > max_loudness:\n max_loudness = loudness\n\nprint(max_loudness)", "_=input()\r\ns=input().split()\r\nn=0\r\nfor i in s:\r\n m=0\r\n for j in i:\r\n if j in 'QWERTYUIOPASDFGHJKLZXCVBNM':\r\n m+=1\r\n if m>n:\r\n n=m\r\nprint(n)\r\n#print(' '.join([str(a[i]) for i in range(len(a))]))", "n = int(input())\r\ns = input()\r\nans = 0\r\ntemp = 0\r\nfor i in s:\r\n if i == \" \":\r\n ans = max(ans,temp)\r\n temp = 0\r\n if i >= \"A\" and i <= \"Z\":\r\n temp += 1\r\nans = max(ans,temp)\r\nprint(ans)\r\n", "s = int(input())\r\n\r\ndef wordVol(w):\r\n vol = 0\r\n for c in w:\r\n if c.isupper():\r\n vol+=1\r\n return vol\r\n\r\nwords = input().split()\r\nprint(max(wordVol(w) for w in words))\r\n ", "l=[]\r\nc=0\r\nn=int(input())\r\nf=input().split()\r\nfor i in f:\r\n for k in i:\r\n if ord(k)>=65 and ord(k)<91:\r\n c+=1\r\n l.append(c)\r\n c=0\r\nprint(max(l))\r\n \r\n", "def main():\n n = int(input())\n s = input().split()\n count = 0\n for i in s:\n temp_count = 0\n for j in i:\n if \"A\" <= j <= \"Z\":\n temp_count += 1\n if temp_count > count:\n count = temp_count\n print(count)\n\nif __name__ == '__main__':\n main()\n", "cv=mv=0\r\nn=int(input())\r\nstr=input()+' '\r\nfor i in str:\r\n if i.isupper():\r\n cv+=1\r\n elif i==' ':\r\n if mv<cv:\r\n mv=cv\r\n cv=0\r\nprint(mv)", "n=int(input())\r\na=input().split()\r\nans=0\r\nfor i in a:\r\n cnt=0\r\n for j in i:\r\n if(j.isupper()):\r\n cnt+=1\r\n ans=max(ans,cnt)\r\nprint(ans)\r\n", "n = int(input()) \r\nG = [j for j in input().split(\" \")]\r\nk = 0\r\nfor i in G:\r\n ans = 0\r\n for c in i:\r\n if c.isupper():\r\n ans += 1\r\n k = max(k, ans)\r\nprint(k)", "_=int(input())\r\nl=list(input().strip().split())\r\nz=[]\r\nfor x in l:\r\n\tcount=0\r\n\tfor y in x:\r\n\t\tif y.isupper():\r\n\t\t\tcount+=1\r\n\tz.append(count)\r\nprint(max(z))\r\n", "n = int(input())\r\ns = input().split()\r\nans = 0\r\nfor i in s:\r\n a = 0\r\n for j in i:\r\n if 'Z' >= j >= 'A':\r\n a += 1\r\n ans = max(ans, a)\r\nprint(ans)", "n=int(input())\r\ns=list(map(str, input().split(\" \")))\r\nMax=0\r\nfor i in range(len(s)):\r\n count=0\r\n for j in s[i]:\r\n if j.isupper():\r\n count+=1\r\n Max=max(Max,count)\r\nprint(Max)", "def upper_ct(s):\r\n count = 1\r\n for i in s:\r\n if i.isupper():\r\n count += 1\r\n return count\r\n\r\nn = int(input())\r\nlst = list(map(str, input().split()))\r\nnew = []\r\nfor i in range (0, len(lst)):\r\n new.append(upper_ct(lst[i]))\r\nprint(max(new)-1)", "n = input()\r\nword_list = input().split()\r\nmax = -1\r\nfor word in word_list:\r\n count = 0\r\n for letter in word:\r\n if letter.isupper():\r\n count += 1\r\n if count > max:\r\n max = count\r\nprint(max)", "input()\r\nz = input().split()\r\nk=[]\r\nfor i in z:\r\n c=0\r\n for j in i:\r\n if j.upper()==j:\r\n c+=1\r\n k.append(c)\r\nprint(max(k))", "n=int(input());s=input();c=0\r\ns=s.split(\" \")\r\nfor i in s:\r\n\tt=0\r\n\tfor j in i:\r\n\t\tif j!=j.lower():t+=1\r\n\tc=max(t,c)\r\nprint(c)", "number = input()\r\ns = input()\r\n\r\nd = s.split(\" \")\r\n\r\nans = 0\r\nfor item in d:\r\n itemnumber = 0\r\n for i in item:\r\n if 'A'<=i<='Z':\r\n itemnumber+=1\r\n ans = ans if itemnumber < ans else itemnumber\r\n\r\nprint(ans)", "input()\r\na=input().split()\r\nmx=0\r\nfor i in a:\r\n\tmx=max(mx,sum([ord(j)>=ord('A') and ord(j)<=ord('Z') for j in i]))\r\nprint(mx)\r\n", "#--coding:utf8;--\n#qpy:3\n#qpy:console\ninput()\nmx = 0\nfor x in input().split():\n x = list(filter(lambda a:a.isupper(),list(x)))\n mx = max(mx,len(x))\n\nprint(mx)", "input()\r\nS= input().split()\r\nan=0\r\n\r\nfor A in S:\r\n cur = 0\r\n for s in A:\r\n if ord(s) >= 65 and ord(s) <= 90:\r\n cur += 1\r\n an = max(an, cur)\r\nprint(an) ", "n = int(input())\ns = input().split()\n\nans = 0\nfor s in s:\n cnt = 0\n for c in list(s):\n if c.isupper():\n cnt += 1\n ans = max(ans, cnt)\n\nprint(ans)\n", "n=int(input())\r\ns=input().split()\r\nans=0\r\nfor i in s:\r\n\tt=0\r\n\tfor j in i:\r\n\t\tif j>='A' and j<='Z':\r\n\t\t\tt+=1\r\n\tans=max(ans,t)\r\nprint(ans)\r\n", "n = int(input())\r\nar = [chr(i) for i in range(97, 123)];c = 0\r\ns = input()\r\nd = 0\r\nfor i in s:\r\n if i == ' ':\r\n c = max(c, d)\r\n d = 0\r\n else:\r\n if i not in ar:\r\n d += 1\r\nprint(max(d, c))\r\n", "n = int(input())\r\ns = input().split(' ')\r\nans = 0\r\nfor i in range(0, len(s)):\r\n cnt = 0\r\n for x in range(0, len(s[i])):\r\n if s[i][x].isupper():\r\n cnt += 1\r\n ans = max(cnt, ans)\r\nprint(ans)", "len_of_text = int(input(\"\")) # input number of letter\n\nstring = input(\"\") # input sentence\n\nworld = string.split(\" \") # to cutting the sentence to worlds\n\nNo_of_world = len(world) # to take No of world in sentence\n\nV_of_world_global = 0\n\nV_of_world = 0\n\n\nfor i in range(No_of_world):\n\n V_of_world = 0\n for j in range(len(world[i])):\n\n if world[i][j].isupper():\n V_of_world += 1\n\n if V_of_world > V_of_world_global:\n V_of_world_global = V_of_world\n\n\nprint(V_of_world_global)\n", "\r\nl=int(input())\r\nn=input().split()\r\nc=[]\r\nfor i in n:\r\n\ta=list(i)\r\n\tk=0\r\n\tfor j in a:\r\n\t\tif(ord(j)<=90):\r\n\t\t\tk+=1\r\n\tc.append(k)\r\nprint(max(c))\r\n\r\n", "input()\r\nwords = input().split()\r\nprint(max(sum(map(str.isupper, word)) for word in words))", "n=int(input())\r\ns=list(input().split())\r\nd=[]\r\nfor x in s:\r\n\tc=0\r\n\tfor i in x:\r\n\t\tif i!=\" \" and 65<=ord(i)<=90:\r\n\t\t\tc+=1\r\n\td.append(c)\r\nprint(max(d))", "#!/usr/bin/python\r\nfile = input()\r\nwords = [w for w in input().split(' ')]\r\nvolume =0\r\ncap = list(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")\r\nfor w in words:\r\n caps = 0\r\n for x in w:\r\n if x in cap:\r\n caps = caps + 1\r\n if caps > volume:\r\n volume = caps\r\nprint(volume)", "x=int(input())\r\nj=str(input())\r\nj=j+' '\r\nr=0\r\nma=0\r\ns=0\r\nwhile s<=x:\r\n if j[s].isupper():\r\n r+=1\r\n if j[s]==' ':\r\n if r>ma:\r\n ma=r\r\n r=0\r\n s+=1\r\nprint(ma)\r\n \r\n", "'''#Volume of the word is number of capital letters in the word. Volume of\r\n#he text is maximum volume of all words in the text.'''\r\n\r\n\r\ndef main():\r\n letter = int(input().strip())\r\n text = input().strip().split(' ')\r\n #arr = []\r\n result = 0\r\n for i in text:\r\n count = 0\r\n for j in i:\r\n if str.isupper(j):\r\n count += 1\r\n if count > result:\r\n result = count\r\n print(result)\r\n\r\nif __name__ == '__main__':\r\n main()", "#Numero inservible\nNumC= list(map(int, input().split()))\n#Palabra que sirve\nWord = input().split()\n\nupper = ['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']\nMMayus = 0\nfor a in range(len(Word)):\n thing = 0\n for b in range(len(Word[a])):\n if(Word[a][b] in upper):\n thing+=1\n if(thing>MMayus):\n MMayus = thing\nprint(MMayus)\n\t \t \t\t \t\t \t\t \t\t\t \t\t", "n = input()\r\nwords = input().split()\r\nans = 0\r\nfor word in words:\r\n ans = max(sum(1 for c in word if c.isupper()), ans)\r\nprint (ans)", "aaaaaaaaaaaaaaaaaaaaa = input()\r\ns = input()\r\nc = 0\r\nmx = 0\r\nfor i in s:\r\n if i == \" \":\r\n if mx < c:\r\n mx = c\r\n c = 0\r\n if i.isupper():\r\n c += 1\r\nif mx < c:\r\n mx = c\r\nprint(mx) ", "leng = int(input())\r\ntext = input()\r\n\r\ngrom = 0\r\nmgrom = 0\r\nfor sym in range(leng):\r\n if text[sym].isupper():\r\n grom = grom + 1\r\n elif text[sym] == ' ':\r\n if grom > mgrom:\r\n mgrom = grom\r\n grom = 0\r\nif grom > mgrom:\r\n mgrom = grom\r\nprint(mgrom)", "\r\nn=int(input())\r\ns=input()\r\nans=0\r\nx=0\r\nfor i in range(n):\r\n\tif s[i]>='A' and s[i]<='Z':\r\n\t\tx+=1\r\n\telif s[i]==' ':\r\n\t\tif ans<x:\r\n\t\t\tans=x\r\n\t\tx=0\r\n\telse:\r\n\t\tcontinue\r\nif ans<x:\r\n\tans=x\r\nprint(ans)\r\n\t\t\t\t#unknown_2433", "import sys\r\n#sys.stdin = open(\"input2\",\"r\")\r\n\r\nn = int(input())\r\ns = input()\r\ncap = cnt = 0\r\n\r\nfor i in range(n):\r\n if s[i] != ' ' and s[i].isupper():\r\n cnt += 1\r\n elif s[i] == ' ':\r\n cap = max(cap,cnt)\r\n cnt = 0\r\nif cnt > 0:\r\n print(max(cap,cnt))\r\nelse:\r\n print(cap)\r\n", "from re import findall as f\n\namount_of_words = int(input())\nprint(max(len(f(\"[A-Z]\", w)) for w in input().split()))", "n=int(input())\r\nl=[x for x in input().strip().split(\" \")]\r\nans=0\r\nfor i in l:\r\n count=0\r\n for j in i:\r\n if j.isupper():\r\n count+=1\r\n ans=max((ans,count))\r\nprint(ans)\r\n ", "n = int(input())\nx = [x for x in input().split()]\nvol =0\nfor i in x:\n\tvol = max(vol,len([j for j in i if j.isupper()]))\nprint(vol)\n\t\n", "def findVolume(word):\n return sum([1 for c in word if c.isupper()])\n\n\ninput()\nwords = input().strip().split(\" \")\nres = [findVolume(word) for word in words]\nprint(max(res))\n\n", "import string\r\n\r\ninput()\r\nprint(max(sum(sym in string.ascii_uppercase for sym in word) for word in input().split()))\r\n", "input()\r\nprint(max(sum(int(y.isupper()) for y in x) for x in input().split(' ')))\r\n", "def volume(w):\r\n return sum(1 for i in w if i.isupper())\r\n\r\n\r\n_ = input()\r\nwords = input().split()\r\nprint(max(map(volume, words)))\r\n", "n = int(input())\r\nwords = input().split()\r\nmax_volume = 0\r\nfor word in words:\r\n volume = sum(1 for c in word if c.isupper())\r\n max_volume = max(max_volume, volume)\r\nprint(max_volume)\r\n", "import string\r\nalf = string.ascii_uppercase\r\nn = int(input())\r\nmas = input().split()\r\nnow = 0\r\nfor el in mas:\r\n gow = 0\r\n for i in el:\r\n if i in alf:\r\n gow += 1\r\n if now < gow:\r\n now = gow\r\nprint(now)", "n = int(input())\r\ntext = [word for word in input().split()]\r\nvol = []\r\nfor word in text:\r\n\tcount = 0\r\n\tfor letter in word:\r\n\t\tif letter.isupper():\r\n\t\t\tcount += 1\r\n\tvol.append(count)\r\nprint(max(vol))", "def g(word):\r\n return len([c for c in word if c.isupper()])\r\n \r\nn = input()\r\nprint(max([g(w) for w in input().split()]))", "n=int(input())\r\ns=input()\r\nm=0\r\ncurr_vol=0\r\nfor i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n curr_vol+=1\r\n elif i==\" \":\r\n m=max(m,curr_vol)\r\n curr_vol=0\r\nm=max(m,curr_vol)\r\nprint(m)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n", "# https://codeforces.com/problemset/problem/837/A\r\n\r\nn = int(input())\r\n\r\nans = 0\r\n\r\nfor word in input().split():\r\n temp = 0\r\n for letter in word:\r\n if letter.isupper():\r\n temp += 1\r\n\r\n ans = max(temp, ans)\r\nprint(ans)", "if __name__ == \"__main__\":\r\n _ = input()\r\n xs = input().split()\r\n print(max(map(lambda x: len(list(filter(lambda y: y >= 'A' and y <= 'Z', x))), xs)))", "input()\r\nprint(max(sum(map(str.isupper,s))for s in input().split()))", "n=int(input())\r\nl1=[str(x) for x in input().split()]\r\ndef dx(n):\r\n cnt=0\r\n for i in n:\r\n if 65<=ord(i)<=90:\r\n cnt+=1\r\n return cnt\r\nls=[]\r\nfor i in l1:\r\n cnt=dx(i)\r\n ls.append(cnt)\r\nprint(max(ls))", "n = int(input())\r\ntext = input()\r\nvol_text=0\r\nfor word in text.split(\" \"):\r\n vol_word=0\r\n for ch in word:\r\n if ch>='A' and ch<='Z':\r\n vol_word+=1\r\n vol_text=max(vol_word,vol_text)\r\nprint(vol_text)", "n = int(input())\r\ns = list(input().split())\r\nans = 0\r\nfor w in s:\r\n t = 0\r\n for c in w:\r\n if c.isupper():\r\n t += 1\r\n ans = max(ans, t)\r\nprint(ans)\r\n", "n=int(input())\r\ns=input()\r\ns=s.split(\" \")\r\nsum3=[]\r\n\r\nfor i in s:\r\n sum2=0\r\n for j in i:\r\n if ord(j)>=65 and ord(j)<=90:\r\n sum2+=1\r\n sum3.append(sum2)\r\n\r\nprint(max(sum3))\r\n\r\n", "int(input())\r\ntxt=input()\r\nch=txt.split(\" \")\r\nmax=0\r\nfor word in ch :\r\n c=0\r\n for alp in word :\r\n if ord(alp)<=90:\r\n c=c+1\r\n if max<=c :\r\n max=c\r\nprint(max) ", "n = input()\nfrase = input().split()\n\nans = 0\nfor wrd in frase:\n val = 0\n for let in wrd:\n if let.isupper():\n val += 1\n if val > ans:\n ans = val\n\nprint(ans)\n", "n = int(input())\r\ns = input().split()\r\ncounter = 0\r\nfor i in s:\r\n x = 0\r\n for y in i:\r\n if y.isupper():\r\n x += 1\r\n if x > counter:\r\n counter = x\r\nprint(counter)", "n = int(input())\ntext = input().split()\n\nans = 0\nfor i in text:\n\tu = 0\n\tfor j in i:\n\t\tu += j.isupper()\n\tans = max(u,ans)\n\nprint(ans)\n\n\n\n\n", "input(); print(max(sum(ch.isupper() for ch in w) for w in input().split()))", "class Volume:\n n = int(input())\n s = list(input())\n counter =0\n aux = 0\n for i in range(len(s)):\n if s[i].isupper():\n counter+=1\n if (s[i] == \" \" or i == len(s)-1) and \" \" in s:\n if aux < counter:\n aux = counter\n counter = 0\n\n if \" \" in s:\n x=0\n else:\n aux = counter\n \n \n print(aux)\n\t\t\t \t \t \t\t \t\t \t\t \t\t \t\t\t", "n=int(input())\r\nk=list(input().split())\r\nans=0\r\nfor i in range(len(k)):\r\n c=0\r\n for j in k[i]:\r\n if j==j.upper():\r\n c+=1\r\n ans=max(c,ans)\r\nprint(ans)\r\n \r\n", "input()\r\nmx = 0\r\nfor item in input().split():\r\n cnt = 0\r\n for c in item:\r\n if c.isupper():\r\n cnt += 1\r\n mx = max(mx, cnt)\r\n\r\nprint(mx)\r\n\r\n##########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n##########################################", "n= int(input())\r\ns = list(input())\r\nc= 0\r\nli =[]\r\nfor i in s:\r\n if i!=' ' or i==s[n-1]:\r\n if i.isupper():\r\n c+=1\r\n li.append(c)\r\n else:\r\n c = 0\r\nif len(li)!=0:\r\n print(max(li))\r\nelse:\r\n print(0)", "class CodeforcesTask837ASolution:\n def __init__(self):\n self.result = ''\n self.word = ''\n\n def read_input(self):\n input()\n self.word = input()\n\n def process_task(self):\n letters = \"abcdefghijklmnoqprstuvwxyz\"\n for c in letters:\n self.word = self.word.replace(c, \"\")\n volume = max([len(x) for x in self.word.split(\" \")])\n self.result = str(volume)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask837ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\r\nS = list(map(str, input().split()))\r\nans = 0\r\nfor s in S:\r\n temp = 0\r\n for c in s:\r\n if c.isupper():\r\n temp += 1\r\n ans = max(ans, temp)\r\nprint(ans)\r\n", "t='ZXCVBNMLKJHGFDSAQWERTYUIOP'\r\nn=int(input())\r\ns=list(map(str,input().split()))\r\nb=[]\r\na=0\r\nfor i in s:\r\n for j in i:\r\n if j in t:\r\n a+=1\r\n b+=[a]\r\n a=0\r\nprint(max(b))\r\n", "n = int(input())\r\n\r\nlst = list(map(str,input().split(\" \")))\r\n\r\nans = 0\r\nfor word in lst:\r\n cnt = 0\r\n\r\n for i in word:\r\n if i.isupper():\r\n cnt+=1\r\n\r\n \r\n ans =max(ans,cnt)\r\n\r\nprint(ans)", "a=int(input())\r\nk=input().split()\r\nans=max(sum(1 for j in i if j.isupper()) for i in k)\r\nprint(ans)\r\n", "n=int(input())\r\na=list(input().split())\r\nb=[]\r\nfor i in range(len(a)):\r\n\tx=0\r\n\tfor j in range(len(a[i])):\r\n\t\tif (a[i][j]).isupper():\r\n\t\t\tx+=1\r\n\tb.append(x)\r\nprint(max(b))", "n = int(input())\r\na = input().split()\r\nb = max([sum(1 for i in j if i.isupper()) for j in a])\r\nprint(b)\r\n", "n = int(input())\r\ns = input().split()\r\nif len(s) == 1:\r\n sum = 0\r\n for i in s[0]:\r\n if i.isupper():\r\n sum += 1\r\n print(sum)\r\nelse:\r\n sumL = []\r\n temp = 0\r\n for item in s:\r\n for i in item:\r\n if i.isupper():\r\n temp += 1\r\n sumL.append(temp)\r\n temp = 0\r\n print(max(sumL))", "# https://codeforces.com/contest/837/problem/A\n# A. Громкость текста\n\n\ndef volume(word):\n return sum(str.isupper(c) for c in word)\n\nl = input()\ns = input().split()\nprint(max(volume(word) for word in s))\n", "from sys import stdin, stdout\nfrom collections import defaultdict\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef f(w):\n\treturn len([c for c in w if ord(c)>=ord('A') and ord(c)<=ord('Z')])\n\ndef solve():\n\tn=read_int()\n\twords=read().split()\n\tprint(max([f(w) for w in words]))\n\nsolve()\n", "n=int(input())\r\na=map(str,input().split())\r\np=0\r\nfor s in a:p=max(p,sum(y.isupper() for y in s))\r\nprint(p)", "n = int(input())\r\ns = input().split()\r\nc = [0] * len(s)\r\nfor i in range(len(s)):\r\n k = 0\r\n for j in s[i]:\r\n if \"A\" <= j <= \"Z\":\r\n k += 1\r\n c[i] = k\r\nprint(max(c))", "n=int(input())\r\nx=input()\r\na=x.split()\r\ng=0\r\nfor i in a:\r\n c=0\r\n for j in i:\r\n if(ord(j)>=65 and ord(j)<=91):\r\n c+=1\r\n if(c>g):\r\n g=c\r\nprint(g)", "n = int(input())\r\ns = input().split()\r\na = []\r\nfor i in range(len(s)):\r\n\tb = 0\r\n\tfor j in range(len(s[i])):\r\n\t\tif s[i][j].isupper():\r\n\t\t\tb+=1\r\n\ta.append(b)\r\nprint(max(a))\r\n", "n = int(input())\r\ns = input()\r\nl = list(s.split())\r\nli = []\r\nfor i in l:\r\n cou = 0\r\n for j in range(len(i)):\r\n if i[j] >= 'A' and i[j] <= 'Z':\r\n cou += 1\r\n li.append(cou)\r\nprint(max(li))", "input()\r\nprint(max(len(tuple(filter(str.isupper, i))) for i in input().split()))", "n = input()\r\nans = 0\r\nfor s in input().split():\r\n ans = max(ans, sum(1 for c in s if c.isupper()))\r\nprint(ans)", "n = int(input())\r\ns = input().split()\r\n\r\nans, cur = 0, 0\r\n\r\nfor x in s:\r\n cur = 0\r\n for a in x:\r\n if 'A' <= a <= 'Z':\r\n cur += 1\r\n ans = max(ans, cur)\r\n\r\nprint(ans)", "N = int(input())\nS = input().split()\nres = 0\nfor w in S:\n tmp = 0\n for s in w:\n if s.isupper():\n tmp += 1\n res = max(res, tmp)\nprint(res)\n", "n = int(input())\r\nl = list(map(str, input().strip().split()))\r\nans=0\r\nfor x in l:\r\n c=0\r\n for y in x:\r\n if y.isupper():\r\n c+=1\r\n if(c>ans):\r\n ans=c\r\nprint(ans)", "n=int(input())\r\ns=input().split(' ')\r\ncnt,m=0,0\r\nfor i in s:\r\n cnt=0\r\n for x in i:\r\n if x.isupper():\r\n cnt+=1\r\n if cnt>m:\r\n m=cnt\r\n \r\nprint(m)", "def f(s):\r\n r = 0\r\n for x in s:\r\n if x.isupper():\r\n r += 1\r\n return r\r\n\r\nn = int(input())\r\ns = map(lambda x: x.strip(), input().split())\r\n\r\nw = list(map(f, s))\r\nres = max(w)\r\n\r\nprint(res)", "combo=list(map(int, input().split()))\noracion=input()\nmayusculas=['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']\ncontador=0\nlista=[]\nfor i in oracion:\n if i in mayusculas:\n contador+=1\n elif i == ' ':\n lista.append(contador)\n contador = 0\nlista.append(contador)\nlista.sort(reverse=True)\nprint(lista[0])\n \t \t\t\t\t\t\t\t \t \t \t\t\t \t \t", "n = int(input())\r\ntext = input().split()\r\nmaxVolume = 0\r\n\r\nfor word in text:\r\n volume = 0\r\n for c in word:\r\n if c.isupper():\r\n volume += 1\r\n maxVolume = max(volume, maxVolume)\r\n\r\nprint(maxVolume)\r\n", "n = int(input())\r\ns = input()\r\nans = []\r\nvr = 0\r\nfor i in range(n):\r\n if s[i] == ' ':\r\n ans.append(vr)\r\n vr = 0\r\n else:\r\n if ord(s[i]) > 64 and ord(s[i]) < 91:\r\n vr += 1\r\nans.append(vr)\r\nprint(max(ans))\r\n", "n=int(input())\r\ns=input().split()\r\nm=0\r\nfor w in s:\r\n k=0\r\n for i in w:\r\n if 'A'<=i<='Z':\r\n k+=1\r\n if k>m:\r\n m=k\r\nprint(m)", "def main():\r\n\tinput()\r\n\twords = input().strip().split()\r\n\r\n\tvolume = max(\r\n\t\tsum(1 for ch in word if 'A' <= ch <= 'Z')\r\n\t\tfor word in words\r\n\t)\r\n\r\n\tprint(volume)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n = int(input())\r\ns = list(map(str,input().split()))\r\nalpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nresult = list()\r\nfor i in s:\r\n count = 0\r\n for j in i:\r\n if j in alpha:\r\n count = count + 1\r\n result.append(count)\r\nprint(max(result))", "def count_loud(word):\r\n l = 0\r\n for c in word:\r\n if c in loud_letters:\r\n l += 1\r\n return l\r\n\r\n\r\nloud_letters = {chr(i) for i in range(65, 91)}\r\nn = int(input())\r\ntext = list(map(str, input().split()))\r\nans = 0\r\nfor w in text:\r\n new_w = count_loud(w)\r\n if new_w > ans:\r\n ans = new_w\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(list,input().split()))\r\n# print(l)\r\nma=0\r\nfor i in l:\r\n\tz=0\r\n\tfor j in i:\r\n\t\tif ord(j) in range(65,65+26):\r\n\t\t\tz+=1\r\n\tma=max(z,ma)\r\n\r\nprint(ma)", "n = int(input())\r\ns = input()\r\nk = 0\r\nans = 0\r\nwords = s.split(' ')\r\nfor w in words:\r\n k = 0\r\n for j in range(len(w)):\r\n if w[j].isupper():\r\n k+=1\r\n ans = max(k, ans)\r\nprint(ans)", "n = int(input())\r\ns = list(input())\r\ns = ''.join(s).split()\r\nlst = []\r\nfor j in s:\r\n cnt = 0\r\n for i in j:\r\n if(i.isupper()):\r\n cnt += 1\r\n lst.append(cnt)\r\nprint(max(lst))", "c=\"ZXCVBNMLKJHGFDSAQWERTYUIOP\"\r\nn=int(input())\r\na=list(map(str,input().split()))\r\nb=[]\r\ns=0\r\nfor i in a:\r\n for j in i:\r\n if j in c:\r\n s+=1\r\n b+=[s]\r\n s=0\r\nprint(max(b))\r\n", "num = int(input())\r\ntext = input()\r\nl = len(text)\r\nwords = text.split()\r\nlw = len(words)\r\nvol = []\r\nif (num == l) and ((num>0) and (num < 201)):\r\n for i in range(0,lw):\r\n word = words[i]\r\n le = len(word)\r\n word_vol = 0\r\n for j in range(0, le):\r\n if word[j].isupper():\r\n word_vol += 1\r\n vol.append(word_vol)\r\n\r\nvol.sort()\r\n\r\nprint(vol[-1])", "n=int(input())\r\nx=(input())\r\ny=x.split(\" \")\r\nd=[]\r\nfor i in y:\r\n c=0\r\n for z in i:\r\n if z.isupper():\r\n c=c+1\r\n d.append(c)\r\nprint(max(d))\r\n\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,bisect\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nn=input()\r\nl=list(input()[:-1].split(\" \"))\r\nm=0\r\nfor i in l:\r\n c=0\r\n for j in i:\r\n if ord(j)>=ord('A') and ord(j)<ord('a'):\r\n c+=1\r\n m=max(m,c)\r\nprint(m)\r\n", "n=int(input())\r\na=input().split()\r\nb=[]\r\nc=0\r\nfor i in range(len(a)):\r\n c=0\r\n for j in range(len(a[i])):\r\n if ord(\"Z\")>=ord(a[i][j])>=ord(\"A\"):\r\n c=c+1\r\n b.append(c)\r\nprint(max(b))", "n=int(input())\ns=list(input().split())\n#print(s[1][0])\n\n#m=[]\n#for i in range(len(s)):\n#\tm+=[str(s[i])]\n#print(m)\nf=0\nF=[]\nfor i in range(len(s)):\n\tfor j in s[i]:\n\t\tif 'A'<=j<='Z':\n\t\t\tf+=1\n\tF+=[f]\n\tf=0\nprint(max(F))\n", "len_of_text = int(input())\r\nwords = [x for x in input().split()]\r\nmax_volume = 0\r\ni = 0\r\nwhile i < len(words):\r\n\tcur_volume = 0\r\n\tfor letter in words[i]:\r\n\t\tif letter.isupper() == True:\r\n\t\t\tcur_volume += 1\r\n\tif cur_volume > max_volume:\r\n\t\tmax_volume = cur_volume\r\n\ti += 1\r\nprint(max_volume)", "t = int(input())\r\ns = input()\r\ncount1,count2 = 0,0\r\nfor i in range(t):\r\n if s[i].isupper():\r\n count1 += 1\r\n count2 = max(count1,count2)\r\n if s[i] == ' ':\r\n count1 = 0\r\nprint(count2)", "import re\r\nfrom functools import partial\r\n\r\nsubstring = partial(re.sub, r'[^A-Z]', '')\r\nn = input()\r\nwords = input().split()\r\nres = max(map(lambda x: len(substring(x)), words))\r\nprint(res)", "n = int(input())\r\ns = input().split()\r\ndef count(string:str):\r\n cnt = 0\r\n for j in string:\r\n if j.isupper():\r\n cnt += 1\r\n return cnt\r\nmx = float(\"-inf\")\r\nfor i in s:\r\n mx = max(mx, count(i))\r\nprint(mx)", "n = int(input())\r\ns = input()\r\nnum, rec = 0, 0\r\nfor i in range(n):\r\n if s[i] == \" \":\r\n num = max(rec, num)\r\n rec = 0\r\n else:\r\n if s[i].isupper():\r\n rec += 1\r\n\r\nnum = max(rec, num)\r\n\r\nprint(num)\r\n", "n = int(input())\nt = input().split()\nans = 0\nfor w in t:\n m = sum(1 for c in w if('A' <= c <= 'Z'))\n ans = max(ans,m)\nprint(ans)\n", "n = int(input())\r\ns = input().split(\" \")\r\nm = 0\r\nfor x in s:\r\n co = 0\r\n for c in x:\r\n if('A'<= c <='Z'):\r\n co += 1\r\n m = max(m, co)\r\nprint(m)\r\n \r\n \r\n \r\n", "n = int(input())\r\na =str(input())\r\narr = []\r\nfor i in range(1000):\r\n arr.append(0)\r\nx = 0\r\nfor i in a:\r\n if i.isupper():\r\n arr[x]+=1\r\n elif i==' ':\r\n x+=1;\r\n\r\nprint(max(arr))\r\n\r\n\r\n", "#http://codeforces.com/problemset/problem/837/A\n_ = input()\ninp = list(input().split())\narr = []\nfor x in inp:\n\ttemp = sum(map(str.isupper, x))\n\tarr.append(temp)\nprint(max(arr))", "input()\r\ns=input().split()\r\nx=0\r\nfor i in s:\r\n k=0\r\n for j in i:\r\n if j<='Z' and j>='A':\r\n k+=1\r\n if k>x:\r\n x=k\r\nprint(x)\r\n", "n = int(input())\r\ns = input()\r\nans = 0\r\n\r\nfor s1 in s.split():\r\n\tcnt = 0\r\n\tfor i in range(len(s1)):\r\n\t\tcnt += (ord(s1[i]) < ord('a') or ord(s1[i]) > ord('z'))\r\n\tans = max(ans, cnt)\r\n\r\nprint(ans)", "import string\n\ncap = string.ascii_uppercase\nn = input()\ns = input().split()\nprint(max([sum([1 for i in x if i in cap]) for x in s]))", "import string\r\n\r\nupper = set(string.ascii_uppercase)\r\ninput()\r\nprint(max(sum(c in upper for c in w) for w in input().split()))\r\n", "n = int(input())\ns = input()\nwords = s.split()\nvolume_list = []\nfor word in words:\n volume = 0\n for ch in word:\n if ch.isupper():\n volume += 1\n volume_list.append(volume)\nprint(max(volume_list))\n\t\t\t\t \t \t \t\t \t\t \t\t \t \t", "num = int(input())\nstring = str(input())\nstrlist = string.split(' ')\ncounter = list()\nlength = len(strlist)\nfor x in range(length) :\n counter.append(0)\nfor x in range(length):\n for y in (strlist[x]):\n element = strlist[x]\n if y.isupper():\n a = counter[x]\n a = a+1 \n counter[x]=a\nprint(max(counter))", "\r\nn = int(input())\r\ns = input()\r\n\r\n\r\nres = []\r\n\r\nfor word in s.split():\r\n\tres.append(sum(1 for c in word if c.isupper()))\r\n\r\nprint(max(res))\r\n", "n=int(input())\r\ns=str(input())\r\ns=s.split(' ')\r\nMax=0\r\nfor i in s: \r\n Count=0\r\n for j in i:\r\n if j>='A' and j<='Z':\r\n Count+=1\r\n Max=max(Max,Count)\r\nprint(Max)", "n=int(input())\r\na=input().split()\r\nm=0\r\nfor s in a:\r\n k=0\r\n for c in s:\r\n if c>='A' and c<='Z': k+=1\r\n if m<k:m=k\r\nprint(m)\r\n", "input()\ncnt, ans = 0, 0\nfor x in input():\n if x.isupper():\n cnt += 1\n ans = max(ans, cnt)\n elif x == ' ':\n cnt = 0\nprint(ans)", "countCap = lambda s : sum(1 for c in s if c.isupper())\r\ninput()\r\nprint(max(countCap(w) for w in input().split()))", "n=int(input())\r\nx=list(input().split())\r\ny=[]\r\nfor i in range(len(x)):\r\n Sum=0\r\n for j in range(len(x[i])):\r\n if x[i][j]==x[i][j].upper(): Sum+=1\r\n y.append(Sum)\r\nprint(max(y))", "def vol(s):\r\n i=0\r\n c=0\r\n while i<len(s):\r\n if s[i]==\"A\" or s[i]==\"B\" or s[i]==\"C\" or s[i]==\"D\" or s[i]==\"E\" or s[i]==\"F\" or s[i]==\"G\" or s[i]==\"H\" or s[i]==\"I\" or s[i]==\"J\" or s[i]==\"K\" or s[i]==\"L\" or s[i]==\"M\" or s[i]==\"N\" or s[i]==\"O\" or s[i]==\"P\" or s[i]==\"Q\" or s[i]==\"R\" or s[i]==\"S\" or s[i]==\"T\" or s[i]==\"U\" or s[i]==\"V\" or s[i]==\"W\" or s[i]==\"Y\" or s[i]==\"X\" or s[i]==\"Z\":\r\n c+=1\r\n i+=1\r\n return c\r\nn=eval(input())\r\nw=input()\r\ni=0\r\na=0\r\ns=\"\"\r\nwhile i<len(w):\r\n if w[i]==\" \":\r\n if vol(s)>a:\r\n a=vol(s)\r\n s=\"\"\r\n s=s+w[i]\r\n i+=1\r\nif vol(s)>a:\r\n a=vol(s)\r\nprint(a)\r\n", "n=int(input())\ns=list(map(str,input().split()))\ncount=0\nmaxi=0\nfor i in s:\n for j in i:\n if j.isupper():\n count+=1\n maxi=max(count,maxi)\n count=0\nprint(maxi)\n\n \t\t \t\t \t\t \t\t \t \t \t\t\t \t\t\t", "n = int(input())\r\ns = input().split()\r\n\r\nres = 0\r\nvalues = [0] * n\r\nfor i,w in enumerate(s):\r\n cnt = sum(1 for c in w if c.isupper())\r\n values[i] = cnt\r\nprint(max(values))", "n=int (input ())\r\nch= input()\r\nl=ch.split()\r\nm=0\r\nfor i in l :\r\n s=0\r\n for j in i :\r\n if j==j.upper():\r\n s=s+1\r\n m=max(m,s)\r\n\r\nprint(m)\r\n \r\n", "n = int(input());\ns = input().split();\n\nmx = 0;\ncap = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n\nfor word in s:\n\tvolume = 0;\n\n\tfor letter in word:\n\t\tif letter in cap:\n\t\t\tvolume += 1;\n\n\tif volume > mx:\n\t\tmx = volume;\n\nprint(mx);\n \t \t\t\t\t \t\t \t\t\t\t\t\t \t \t", "n=int(input())\r\nl=input().split()\r\ntemp=[]\r\nfor i in l:\r\n y=i.upper()\r\n count=0\r\n for j in range(len(y)):\r\n if i[j]==y[j]:\r\n count+=1\r\n temp.append(count)\r\nprint(max(temp))\r\n", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(107)\ninf=1020\nmod=10*9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\n# A~Z -- START --\nalf=['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']\n# A~Z --- END ---\n\ndef main():\n I()\n l=LS()\n\n ans=0\n for x in l:\n a=0\n for s in x:\n if s in alf:\n a+=1\n ans=max(ans,a)\n\n return ans\n\n# main()\nprint(main())\n", "input()\r\nstring = input()+ ' '\r\nlastCount = 0\r\ncount = 0\r\n\r\nfor x in string:\r\n\tif x.isupper():\r\n\t\tcount += 1\r\n\tif x == ' ':\r\n\t\tif count > lastCount:\r\n\t\t \tlastCount = count\r\n\t\tcount = 0\r\nprint((lastCount))", "n=int(input())\ns=input().split(\" \")\nl=[]\nfor i in s:\n c=0\n for j in i:\n if j>='A' and j<='Z':\n c+=1\n l.append(c)\nprint(max(l))\n", "n=input()\r\ns=list(input().split())\r\nmt=-1\r\nfor k in s:\r\n mtt=0\r\n for j in range(len(k)):\r\n if ord(k[j])>=65 and ord(k[j])<=90:\r\n mtt+=1\r\n mt=max(mtt,mt)\r\nprint(mt)", "n=int(input())\r\ns=input()\r\nd=\"\"\r\nk=0\r\nh=0\r\nfor i in range(n):\r\n if ord(s[i])!=32:\r\n if s[i].isupper():\r\n k+=1\r\n if ord(s[i])==32:\r\n if k>h:\r\n h=k\r\n i+=1\r\n k=0\r\nprint(max(h,k))\r\n\r\n", "x=int(input())\r\ny=list(input().split(' '))\r\nc=0\r\nl=[]\r\nfor i in y:\r\n for j in i:\r\n if ord(j)>=65 and ord(j)<=90:\r\n c=c+1\r\n l=l+[c]\r\n c=0\r\nprint(max(l))\r\n", "maxcnt = 0\r\nn = input()\r\ns = input()\r\nl = s.split(' ')\r\n\r\nfor i in l:\r\n cnt = 0\r\n for j in i:\r\n if j.isupper():\r\n cnt += 1\r\n if cnt > maxcnt:\r\n maxcnt = cnt\r\n\r\nprint(maxcnt)\r\n", "\r\n\"\"\"\r\nYou are given a text of single-space separated words, consisting of small and capital Latin letters.\r\n\r\nVolume of the word is number of capital letters in the word. Volume of the text is maximum volume of all words in the text.\r\n\r\nCalculate the volume of the given text.\r\n\r\nInput\r\nThe first line contains one integer number n (1 ≤ n ≤ 200) — length of the text.\r\n\r\nThe second line contains text of single-space separated words s1, s2, ..., si, consisting only of small and capital Latin letters.\r\n\r\nOutput\r\nPrint one integer number — volume of text.\r\n\r\n\"\"\"\r\ndef volumetext(length, sentence):\r\n \r\n maxvol=0\r\n vol=0\r\n \r\n for word in sentence:\r\n vol=0\r\n \r\n for letter in word: \r\n if letter.upper()==letter: \r\n vol+=1 \r\n \r\n if vol>maxvol: \r\n maxvol=vol\r\n \r\n return maxvol\r\n \r\n \r\nlength=(map(int, input().strip().split()))\r\nsentence=input().strip().split()\r\nprint(volumetext(length,sentence)) \r\n \r\n \r\n \r\n", "length= int(input())\r\ntext = list(input())\r\npp = 0\r\nhh = []\r\nfor word in text:\r\n rode = ord(word)\r\n if 65<=rode<=90:\r\n pp = pp + 1\r\n elif word == \" \":\r\n hh.append(pp)\r\n pp = 0\r\n hh.append(pp)\r\nmaxi = max(hh)\r\nprint(maxi)", "length = int(input(\"\"))\ntext = input(\"\")\nwords = text.split(\" \")\ncapitalcounttotal = []\ncapitalcount = 0\n\nfor word in words:\n for i in range(len(word)):\n if ord(word[i]) <= 90:\n capitalcount += 1\n capitalcounttotal.append(capitalcount)\n capitalcount = 0\n\ncapitalcounttotal.sort(reverse=True)\nprint(capitalcounttotal[0])", "import math\nimport bisect\n\nfrom math import gcd, floor, sqrt, log\nfrom collections import defaultdict as dd\nfrom collections import Counter\n\nI = lambda: int(input())\ntup = lambda: map(int, input().split())\nlst = lambda: list(map(int, input().split()))\n\nt = 1\n#t = I()\n\n\nwhile t:\n\n n = I()\n\n test = input().split()\n volume = []\n for ele in test:\n count = 0\n for i in ele:\n if i.isupper():\n count += 1\n volume.append(count)\n\n print(max(volume))\n\n\n\n\n \n t -= 1\n\n\n ", "n = int(input())\r\ns = input()\r\nL = s.split()\r\ntmp = 0\r\nmx = 0\r\nfor i in range(len(L)):\r\n for j in range(len(L[i])):\r\n if L[i][j] <= 'Z':\r\n tmp += 1\r\n mx = max(mx, tmp)\r\n tmp = 0\r\nprint(mx)\r\n", "n = int(input())\r\ns = input().split(\" \")\r\nans = 0\r\nfor word in s:\r\n uplit = 0\r\n for lit in word:\r\n if lit.isupper():\r\n uplit += 1\r\n if ans < uplit: \r\n ans = uplit\r\nprint(ans)", "#!/usr/bin/env python3\nn = int(input())\nwords = input().split()\nans = max(len(''.join(filter(lambda c: c.isupper(), word))) for word in words)\nprint(ans)\n\t \t \t \t \t\t\t\t\t \t \t\t\t", "n = int(input())\r\ntext = input()\r\n\r\nwords = text.split()\r\n\r\nmax_volume = 0\r\n\r\nfor word in words:\r\n volume = sum(1 for c in word if c.isupper())\r\n\r\n if volume > max_volume:\r\n max_volume = volume\r\n\r\nprint(max_volume)\r\n", "n=int(input())\r\ns=input()\r\ni,large=0,0\r\nwhile(i<n):\r\n cnt=0\r\n while(i<n and s[i]!=' '):\r\n if(ord(s[i])>=65 and ord(s[i])<=90):\r\n cnt+=1\r\n i+=1\r\n if(cnt>large):\r\n large=cnt\r\n i+=1\r\nprint(large)", "x = input()\r\nst = input()\r\n\r\ncount = 0\r\nmx = 0\r\nfor c in st:\r\n if c >= 'A':\r\n if c <= 'Z':\r\n count = count+1\r\n elif c == ' ':\r\n mx = max(mx, count)\r\n count = 0\r\n\r\nprint(max(mx, count))\r\n", "n=int(input())\r\nd1=list(map(str,input().split()))\r\nd=[]\r\nfor i in d1:\r\n s1=0\r\n for j in i:\r\n if ord(j)>=65 and ord(j)<=90:\r\n s1+=1\r\n d+=[s1]\r\nprint(max(d))\r\n \r\n", "n = int(input())\r\ns = list(map(str,input().split()))\r\n\r\na = []\r\nfor i in s:\r\n\tb = []\r\n\tfor j in i:\r\n\t\tb.append(ord(j))\r\n\ta.append(b)\r\n\r\nc = []\r\nfor i in a:\r\n\tcount = 0\r\n\tfor j in i:\r\n\t\tif j in range(65,91):\r\n\t\t\tcount += 1\r\n\tc.append(count)\r\n\r\nprint(max(c))", "n= int(input())\r\nstring = input()\r\ncount=0\r\nmx=0\r\nfor i in range(len(string)):\r\n if string[i].isupper()== True:\r\n count=count+1\r\n mx= max(count,mx)\r\n \r\n if string[i]==\" \":\r\n count=0\r\nprint(mx)", "n=input()\r\nA=input().split()\r\nmax1=0\r\nfor i in A:\r\n temp=0\r\n for j in i:\r\n if(ord(j)<92):\r\n temp+=1\r\n max1=max(max1,temp)\r\nprint(max1)\r\n \r\n ", "n = int(input())\r\ntext = input().split()\r\n\r\nmaxCount = 0\r\nfor w in text:\r\n count = 0\r\n for l in w:\r\n if ord(l) >= 65 and ord(l) <= 90:\r\n count += 1\r\n\r\n if count > maxCount:\r\n maxCount = count\r\n\r\nprint(maxCount)", "n = int(input())\r\ns = input()\r\ncount = 0\r\nt_count = 0\r\nfor i in s:\r\n if i >= \"A\" and i <= \"Z\":\r\n count += 1\r\n elif i == \" \":\r\n if count > t_count:\r\n t_count = count\r\n count = 0\r\nif count > t_count:\r\n t_count = count\r\nprint(t_count)", "_ = int(input())\nwords = input().split()\nmax1 = 0\n\nfor word in words:\n count = 0\n for i in range(len(word)):\n if word[i].isupper():\n count += 1\n\n if count > max1:\n max1 = count\n\nprint(max1)", "n=int(input())\r\nst=list(input().split())\r\nl=len(st);w=[0]l\r\n\r\nfor i in range(l):\r\n\tfor j in st[i]:\r\n\t\tif j.isupper():\r\n\t\t\tw[i]+=1\r\nprint(max(w))", "n = int(input())\nline = input().split(' ')\n\nMax = -1\n\nfor word in line:\n vol = 0\n for ch in word:\n if 'A' <= ch and ch <= 'Z':\n vol += 1\n if Max < vol:\n Max = vol\n\nprint(Max)\n", "n =int(input())\r\ntext =input()\r\narr =text.split()\r\nmax=-100\r\nfor string in arr:\r\n\tcount =0\r\n\tfor char in string:\r\n\t\tif ord(char) >= ord('A') and ord(char) <= ord('Z'):\r\n\t\t\tcount+=1\r\n\tif max < count:\r\n\t\tmax =count\r\nprint (max)", "i = input()\r\nn = int(i)\r\nmaxv = 0\r\ncurv = 0\r\nc = input()\r\nfor i in range(0, n):\r\n if c[i].isupper():\r\n curv += 1\r\n if c[i] == ' ':\r\n if curv > maxv:\r\n maxv = curv\r\n curv = 0\r\nif curv > maxv:\r\n maxv = curv\r\nprint(maxv)\r\n", "n = int(input())\r\ns = input()\r\n\r\nwords = s.split()\r\n\r\ndef Volume(word):\r\n result = 0\r\n for c in word:\r\n if c >= 'A' and c <= 'Z':\r\n result += 1\r\n return result\r\n\r\nvolumes = [Volume(word) for word in words]\r\n\r\nif (volumes == []):\r\n print(0)\r\nelse:\r\n print(max(volumes))", "n=int(input())\r\nl=list(map(str,input().split()))\r\nans,ANS=0,[]\r\nalfavit=[\"Q\",\"W\",\"E\",\"R\",\"T\",\"Y\",\"U\",\"I\",\"O\",\"P\",\"A\",\"S\",\"D\",\"F\",\"G\",\"H\",\"J\",\"K\",\"L\",\"Z\",\"X\",\"C\",\"V\",\"B\",\"N\",\"M\"]\r\nfor i in range(len(l)):\r\n for j in range(len(l[i])):\r\n if l[i][j] in alfavit:\r\n ans+=1\r\n ANS.append(ans)\r\n ans=0\r\nprint(max(ANS))", "n = int(input())\r\nt = input()\r\nc = 0\r\nv = 0\r\nfor i in t:\r\n\tif i == \" \":\r\n\t\tv = max(v,c)\r\n\t\tc = 0\r\n\tif ord(i) >= 65 and ord(i) <= 90:\r\n\t\tc += 1\r\nv = max(v,c)\r\nprint(v)", "s = input()\r\nt = 0\r\nm = 0\r\ns = input().split()\r\nfor i in s:\r\n for j in i:\r\n if j.isupper():\r\n t += 1\r\n if t > m:\r\n m = t\r\n t = 0\r\nprint(m)\r\n", "#problem 837A\r\nsize=int(input())\r\nstring=input()\r\n\r\nanswer=[]\r\nlist=string.split()\r\nfor i in list:\r\n counter=0\r\n for x in i:\r\n if x.isupper():\r\n counter+=1\r\n answer.append(counter)\r\nprint(max(answer))", "n = int(input())\r\ns = list(input().split())\r\ncount = 0\r\nfor i in s:\r\n\tcount1 = 0\r\n\tfor j in i:\r\n\t\tif j.isupper():\r\n\t\t\tcount1 += 1\r\n\tcount = max(count,count1)\r\nprint(count)\t\t\t", "n = int(input())\ns = input()\ncnt = 0\ngrs = [0]\nfor i in range(n):\n if s[i] != ' ':\n if s[i] >= 'A' and s[i] <= 'Z':\n grs[cnt] += 1\n else:\n cnt += 1\n grs.append(0)\nmaxx = 0\nfor i in grs:\n if i > maxx:\n maxx = i\nprint(maxx)\n", "import string\r\n\r\ninput()\r\nwords = input().split(\" \")\r\ncount = []\r\nfor word in words:\r\n tmp = 0\r\n for char in word:\r\n if char in string.ascii_uppercase:\r\n tmp += 1\r\n count.append(tmp)\r\nprint(max(count))", "# cook your dish here\r\nt=1\r\nfor i in range(0,t):\r\n n=int(input())\r\n s=list(input().split(' '))\r\n m=0\r\n for j in s:\r\n c=0\r\n for k in j:\r\n if k>='A' and k<='Z':\r\n c+=1\r\n if c>m:\r\n m=c\r\n print(m)\r\n \r\n \r\n \r\n \r\n ", "input()\ndef f(s):\n x=0\n for i in s:\n if i==i.upper():\n x+=1\n return x\nprint(max(map(f,input().split())))\n\n", "n = int(input())\ns = input().split(' ')\nc, ans = 0, 0\nfor i in s:\n for j in i:\n if j >= 'A' and j <= 'Z':\n c += 1\n ans = max(ans, c)\n c = 0\nprint(ans)\n", "\r\nn=int(input())\r\nl=list(input().split())\r\nl3=[]\r\nfor i in l:\r\n\tc=0\r\n\tl2=list(i)\r\n\tfor j in l2:\r\n\t\tif j.isupper():\r\n\t\t\tc+=1\r\n\tl3.append(c)\r\nprint(max(l3))", "import re\r\ninput()\r\nsentence=input()\r\nwords=sentence.split(\" \")\r\npattern=r\"[A-Z]\"\r\nlst=[]\r\nfor i in range(len(words)):\r\n lst.append(len(re.findall(pattern,words[i])))\r\n \r\nprint(max(lst))\r\n", "n = int(input())\r\nt = list(input().split())\r\nres = [0 for i in range(len(t))]\r\n\r\nfor i in range(len(t)):\r\n s = t[i]\r\n for j in s:\r\n if j.isupper():\r\n res[i] +=1\r\n\r\nprint(max(res))", "\r\nn=int(input())\r\nstr=input()\r\nstr1=str.split(\" \")\r\n\r\nmax=0\r\nfor i in range(0,str1.__len__()):\r\n r=0;\r\n for j in range(0,str1[i].__len__()):\r\n c=str1[i][j]\r\n if c in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n r+=1\r\n\r\n\r\n if max < r:\r\n max=r;\r\n\r\nprint(max)\r\n\r\n\r\n", "number = int(input())\r\nelements = input().split(\" \")\r\narr = []\r\nfor i in range(len(elements)):\r\n count = 0\r\n for j in range(len(elements[i])):\r\n if elements[i][j].isupper():\r\n count += 1\r\n arr.append(count)\r\nprint(max(arr))", "import sys\n\nn = int(input())\ns = input().split()\n\nm = 0\nfor string in s:\n tmp = 0\n for c in string:\n if c.isupper():\n tmp += 1\n if tmp > m:\n m = tmp\n\nprint(m)\n\n", "import string\r\n\r\nuppercased_letters = string.ascii_uppercase\r\n\r\ndef find_volume(word):\r\n volume = 0\r\n for character in word:\r\n if character in uppercased_letters:\r\n volume += 1\r\n return volume\r\n\r\n_ = int(input())\r\ntext = input() \r\n\r\nvolumes = []\r\nwords = text.split() \r\n\r\nfor word in words:\r\n volumes.append(find_volume(word))\r\n\r\nvolume_of_text = max(volumes)\r\nprint(volume_of_text)\r\n", "def get_v(word):\n v = 0\n for ch in word:\n if ch.isupper():\n v += 1\n return v\n\n\nlength = input()\nwords = input().strip().split()\nmax_v = 0\n\nfor word in words:\n v = get_v(word)\n if max_v < v:\n max_v = v\n\nprint(max_v)\n", "def solution(s):\r\n ans=0\r\n alfie=\"abcdefghijklmnopqrstuvwxyz\".upper()\r\n for x in s:\r\n ans=max(ans,len([y for y in list(x) if y in alfie]))\r\n return ans\r\ndef answer():\r\n n = int(input())\r\n s = input().split()\r\n print(solution(s))\r\nanswer()", "x=int(input())\r\nl=input().split()\r\nans=[]\r\nfor i in range(len(l)):\r\n z=list(l[i])\r\n s=0\r\n for j in range(len(z)):\r\n if ord(z[j])>=65 and ord(z[j])<=90:\r\n s+=1\r\n ans.append(s)\r\nprint(max(ans))", "if __name__ == \"__main__\":\r\n text_length = int(input())\r\n words = list(input().split())\r\n max_volume = 0\r\n for word in words:\r\n max_volume = max(max_volume, sum([1 for letter in word if str(letter).isupper()]))\r\n print(max_volume)", "n=int(input())\r\ns=str(input())\r\nmax_volume=0\r\nnow_volume=0\r\n\r\nfor i in s:\r\n if i==\" \":\r\n now_volume=0\r\n else:\r\n if i==i.upper():\r\n now_volume+=1\r\n max_volume=max(max_volume,now_volume)\r\nprint(max_volume)", "n = int(input())\r\n\r\ns = str(input())\r\n\r\nlist = [s.split(\" \")]\r\n\r\ncharr = ['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\ncheck = [x.upper() for x in charr]\r\n\r\nmaxVakl = 0\r\nfor i in list:\r\n #print(is)\r\n for j in i:\r\n count = 0\r\n for k in j:\r\n if k in check:\r\n count += 1\r\n \r\n if count > maxVakl:\r\n maxVakl = count \r\nprint(maxVakl)\r\n \r\n \r\n", "i=input\r\ni()\r\nprint(max(sum(map(str.isupper,s))for s in i().split()))", "a=int(input())\r\nb=input()\r\nc=b.split(\" \")\r\n\r\nk=b.count(\" \")\r\ncnt=0\r\n\r\nd=[]\r\nfor i in range(k+1):\r\n for j in c[i]:\r\n \r\n if (j.isupper()) :\r\n cnt+=1\r\n d.append(cnt)\r\n cnt=0\r\nif d==[]:\r\n print(\"0\")\r\nelse:\r\n \r\n \r\n print(max(d))\r\n", "input()\r\nstring = input()+ ' '\r\nlastCount = 0\r\ncount = 0\r\n\r\nfor x in string:\r\n\tif not x.islower() and x.isalpha():\r\n\t\tcount += 1\r\n\tif x == ' ':\r\n\t\tif count > lastCount:\r\n\t\t \tlastCount = count\r\n\t\tcount = 0\r\nprint((lastCount))", "n=int(input())\r\na=input().split()\r\nb=0\r\nw=len(a)\r\nfor i in range(w):\r\n c=0\r\n for j in a[i]:\r\n if(j>='A' and j<='Z'):\r\n c+=1\r\n if(c>b):\r\n b=c\r\nprint(b)", "n = int(input())\na = [i for i in input().split()]\nans = 0\ncnt = 0\nfor i in a:\n\tfor j in i:\n\t\tif j >= 'A' and j <= 'Z':\n\t\t\tcnt += 1\n\tans = max(ans, cnt)\n\tcnt = 0\nprint(ans)", "\ntotal = 0\n_ = input()\nfor word in input().split(\" \"):\n word_caps = 0\n for _ in word:\n if not _.islower():\n word_caps += 1\n\n if word_caps > total:\n total = word_caps\n\nprint(total)", "input()\r\nm = 0\r\n\r\nfor word in input().split(' '):\r\n temp_m = 0\r\n\r\n for ch in word:\r\n if ord(ch) <= 90:\r\n temp_m += 1\r\n\r\n if temp_m > m:\r\n m = temp_m\r\n\r\nprint(m)\r\n", "#coding:utf-8\r\nimport re\r\n\r\nn = int(input())\r\nm = input()\r\nlis = m.split()\r\nMAX = 0\r\nfor i in lis:\r\n l = len(re.compile(r'[A-Z]').findall(i))\r\n if l > MAX:\r\n MAX = l\r\nprint(MAX)", "n = int(input())\r\ns = input()\r\nc = 0\r\nm = 0\r\nfor i in range(n):\r\n if s[i] >= \"A\" and s[i] <= \"Z\":\r\n c += 1\r\n if s[i] == \" \":\r\n m = max(m, c)\r\n c = 0\r\nif c > 0:\r\n m = max(m, c)\r\nprint(m)\r\n", "\r\ndef main_function():\r\n n = int(input())\r\n s = [i for i in input().split(\" \")]\r\n max_count = 0\r\n for i in s:\r\n internal_conter = 0\r\n for j in i:\r\n if j.isupper():\r\n internal_conter += 1\r\n if internal_conter > max_count:\r\n max_count = internal_conter\r\n return str(max_count)\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "def shum(s):\r\n z = list()\r\n t = s.split()\r\n for elem in t:\r\n z.append(sum(1 for c in elem if c.isupper()))\r\n return max(z)\r\n\r\n\r\nn = int(input())\r\nprint(shum(input()))\r\n", "n = int(input())\r\ns = input()\r\n\r\ns = s.split(\" \")\r\nans=0\r\nfor i in s:\r\n temp = 0\r\n for j in i:\r\n if j >= 'A' and j <= 'Z':\r\n temp+=1\r\n ans = max(ans, temp)\r\nprint(ans)\r\n", "wordsNum = input()\r\nwords = input().split()\r\n\r\nmostVolWord = 0\r\nfor word in words:\r\n volCh = 0\r\n for ch in word:\r\n if ch.isupper():\r\n volCh +=1\r\n if volCh > mostVolWord:\r\n mostVolWord = volCh\r\n\r\nprint(mostVolWord)\r\n", "n = int(input())\ns = input()\ntokens = s.split(' ')\n\nm = 0\nfor w in tokens:\n\tcurrent = 0\n\tfor c in w:\n\t\tif c.isupper():\n\t\t\tcurrent += 1\n\tm = max(current, m)\n\nprint(m)", "n = int(input()); b = []; k = 0\r\na = list(map(str,input().split()))\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n p = a[i][j].upper()\r\n if a[i][j] == p:\r\n k += 1\r\n b.append(k); k = 0\r\nprint(max(b))", "def calc(string):\n return sum(map(str.isupper, string))\n\n_ = input()\na = input().split()\nmaxi = 0\nfor i in a:\n x = calc(i)\n if x > maxi:\n maxi = x\nprint(maxi)\n\n\t\t\t\t \t\t\t\t\t \t\t \t\t\t\t\t\t\t\t\t\t \t", "def count(x):\r\n s=0\r\n for i in x:\r\n if ord(i)<=96 and ord(i)>=65:\r\n s+=1\r\n return s\r\nn=int(input())\r\nch=input()\r\nl=list(ch.split())\r\na=[]\r\nfor i in range(len(l)):\r\n a.append(count(str(l[i])))\r\n\r\nprint(max(a))\r\n", "#!/usr/bin/python3\r\n\r\ninput()\r\nprint(max(sum(map(str.isupper, i)) for i in input().split()))\r\n", "n=int(input())\r\nst=input()\r\ntam=0\r\nres=0\r\nfor i in st:\r\n if i>='A' and i<='Z':\r\n tam+=1\r\n elif i==' ':\r\n if tam>res:\r\n res=tam\r\n tam=0\r\nif tam>res:\r\n res=tam\r\nprint(res)\r\n", "def tl(s):\r\n\td=0\r\n\tfor c in s:\r\n\t\tif c.isupper():\r\n\t\t\td+=1\r\n\treturn d\r\n\r\ninput()\r\nv=[c for c in input().split()]\r\nm=0\r\nfor c in v:\r\n\tl=tl(c)\r\n\tif l>m:\r\n\t\tm=l\r\nprint(m)", "n=int(input())\r\nst=input()\r\ns=st[:n].split()\r\ngs=[]\r\nfor x in s:\r\n h=0\r\n for i in x:\r\n if i.isupper():\r\n h+=1\r\n gs.append(h)\r\n\r\nprint(max(gs))", "s = int(input())\r\nstring = input().split()\r\nvolumes = []\r\n\r\nfor i in range(len(string)):\r\n e = [letter for letter in string[i] if letter.upper() == letter]\r\n volumes.append(len(e))\r\n\r\nprint(max(volumes))", "input()\na = input().split()\nans = 0\nfor x in a:\n cnt = 0\n for c in x:\n if c.isupper():\n cnt += 1\n ans = max(ans, cnt)\nprint(ans)", "n = input()\r\nkalimat = input().split()\r\nprint (max(map(lambda s: sum([1 for x in s if x.isupper()]), kalimat)))", "\n\nn = int(input())\ns = input()\n\nindex = 0\nmax_index = 0\nfor c in s:\n if c >= 'A' and c <='Z':\n index = index + 1\n if c == \" \":\n if index > max_index:\n max_index = index\n index = 0\n\nif index != 0:\n if index > max_index:\n max_index = index\n\nprint(max_index)\n \t\t \t\t\t \t \t \t\t \t\t \t", "input()\nprint(max(sum(1 for c in w if c.isupper()) for w in input().split()))\n", "import re\r\nn = int(input())\r\nl = list(map(str, input().split()))\r\nans = 0\r\nfor i in l:\r\n temp = len(re.findall(r'[A-Z]', i))\r\n ans = max(temp, ans)\r\nprint(ans)", "n=int(input())\r\ns=input().split()\r\nl=[]\r\nfor i in s:\r\n\tc=0\r\n\tfor j in i:\r\n\t\tif j.isupper():\r\n\t\t\tc+=1\r\n\tl.append(c)\r\nprint(max(l))", "n = int(input())\r\ns = input()\r\nans = 0\r\nfor w in s.split(' '):\r\n t = 0\r\n for c in w:\r\n if ord('A')<=ord(c)<=ord('Z'):\r\n t += 1\r\n ans = max(ans,t)\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\ns = s.split(\" \")\r\ncnt = 0\r\nfor i in range(len(s)):\r\n temp = 0\r\n for j in range(len(s[i])):\r\n if(s[i][j].isupper()):\r\n temp+=1\r\n cnt = max(cnt, temp)\r\n \r\nprint(cnt)", "n = int(input())\r\na = input()\r\nsm = 0\r\nnm = 0\r\nfor i in range(0,n):\r\n if a[i]==\" \":\r\n nm = max(sm,nm)\r\n sm = 0\r\n elif a[i].isupper() == True :\r\n sm+=1\r\nprint(max(nm,sm)) \r\n", "x = int(input())\r\ny = input()\r\n\r\na = y.split(' ')\r\n\r\nmx = -1\r\n\r\nfor i in a:\r\n nw = 0\r\n for q in i:\r\n if (q.isupper()):\r\n nw += 1\r\n if (mx < nw):\r\n mx = nw\r\n\r\nprint(mx)\r\n", "n=int(input())\r\nx=[]\r\ny=list(input().split())\r\nfor i in y:\r\n m=0\r\n for j in i:\r\n if 65<=ord(j)<=90:\r\n m+=1\r\n x.append(m)\r\nprint(max(x))", "# -- coding: utf-8 --\n\n\n\ndef solve():\n len = int(input())\n words = list(input().split(' '))\n\n ans = 0\n for word in words:\n word += \" \" # 哨兵\n cnt = 0\n for ch in word:\n if ch == \" \":\n ans = max(ans, cnt)\n cnt = 0\n elif ch.isupper():\n cnt += 1\n print(ans)\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n\t\t \t\t\t\t\t \t\t\t \t\t\t\t\t\t \t \t\t \t\t", "#Amir_Python\r\nn=int(input())\r\ns=input()\r\nmax=0\r\nk=0\r\nfor x in s:\r\n if x==\" \":\r\n if k>max:\r\n max=k\r\n k=0\r\n elif x.isupper():\r\n k+=1\r\nif k>max:\r\n max=k\r\nprint(max)\r\n ", "# LUOGU_RID: 101672255\ninput()\r\nprint(max(map(lambda x: sum(x.isupper() for x in x), input().split())))", "n = input()\r\nwords = input().split()\r\n\r\nmv = 0\r\nfor w in words:\r\n v = sum([int(s.isupper()) for s in w])\r\n mv = max(v, mv)\r\n\r\nprint(mv)\r\n", "n = int(input())\r\ns = input().split()\r\nmx, tmp = 0, 0\r\nfor i in s:\r\n for j in i:\r\n if j.isupper():\r\n tmp+=1\r\n mx = max(mx,tmp)\r\n tmp = 0\r\nprint(mx)\r\n ", "n=int(input())\r\na=[str(i) for i in input().split()]\r\nx=h=0\r\nfor i in a:\r\n for j in i:\r\n if('A'<=j and j<='Z'):\r\n h+=1\r\n if(h>x):\r\n x=h\r\n h=0\r\nprint(x)", "n = int(input())\nli = [str(x) for x in input().split(' ')]\nmaxi = -12\n\nfor i in li:\n count = 0\n for j in i:\n if j.isupper():\n count += 1\n maxi = max(count, maxi)\nprint(maxi)\n", "n, s = int(input()), input().split()\nres = max(sum(c.isupper() for c in w) for w in s)\nprint(res)\n", "\r\nn = int(input())\r\nl = list(input().split())\r\nmaxup = 0\r\nfor i in range(len(l)):\r\n\tst = l[i]\r\n\tup = 0\r\n\tfor ii in st:\r\n\t\tif ii.isupper():\r\n\t\t\tup += 1\r\n\r\n\tmaxup = max(up, maxup)\r\n\r\n\r\nprint(maxup)\r\n\r\n\r\n", "input()\r\n\r\nprint(max(sum(map(str.isupper, word)) for word in input().split()))", "x=int(input())\r\ns=map(str,input().split())\r\nc=0\r\nfor i in s:\r\n\tn=0\r\n\tfor j in i:\r\n\t\tif j==j.upper():\r\n\t\t\tn+=1\r\n\tc=max(n,c)\r\nprint(c)", "#code\nt=int(input())\nl=list(input().split())\nm=0\nfor i in range(len(l)):\n n=sum(1 for c in l[i] if c.isupper())\n if n>m:\n m=n\n \nprint(m)\n", "import string\nn = int(input())\nup = []\nfor word in input().split():\n up.append([c for c in word if c in string.ascii_uppercase])\nprint(max(map(len, up)))\n\n", "# KALAM\r\ninput()\r\nl = input().split()\r\nMx = 0\r\nfor i in l:\r\n r = 0\r\n for j in i:\r\n if(ord(j) >= ord('A') and ord(j) <= ord('Z')):r += 1\r\n Mx = max(Mx , r)\r\nprint(Mx)\r\n", "n=int(input())\r\ns=input()\r\nc=0\r\np=0\r\nfor i in range(n):\r\n if ord(s[i])>=65 and ord(s[i])<=90:\r\n c=c+1\r\n elif s[i]==' ':\r\n c=0\r\n p=max(p,c)\r\nprint(p)", "input(); m = 0\r\nfor i in input().split(' '): m = max(m, sum([1 if j.isupper() else 0 for j in i]))\r\nprint(m)", "import string\r\ninput()\r\na = input().split()\r\nmax = 0\r\nfor word in a:\r\n sum = 0\r\n for i in range (len(word)):\r\n if word[i].isupper():\r\n sum+=1\r\n if sum > max:\r\n max = sum\r\nprint (max)\r\n", "n=int(input())\r\nl=[i for i in input().split()]\r\nm=0\r\nfor i in l:\r\n c=0\r\n for j in i:\r\n if(ord(j)<97):\r\n c+=1\r\n m=max(m,c)\r\nprint(m)", "li = []; input()\r\ns = input()\r\nans = 0\r\nfor i in range(len(s)):\r\n if('A' <= s[i] <='Z'):\r\n ans += 1\r\n if(s[i] == \" \" or i == len(s)-1):\r\n li.append(ans)\r\n ans = 0\r\n \r\nprint(max(li))", "input()\r\nstringlist = input().split()\r\nmaxx = 0\r\nfor string in stringlist:\r\n\tlength = len(string)\r\n\tcount = 0\r\n\tfor i in range(length):\r\n\t\tif string[i].isupper():\r\n\t\t\tcount += 1\r\n\tif count > maxx:\r\n\t\tmaxx = count\r\nprint(maxx)", "n = int(input())\r\nm = 0\r\nfor i in input().split(' '):\r\n c = 0\r\n for j in i:\r\n if j.isupper():\r\n c += 1\r\n m = max(m, c)\r\nprint(m)", "n=int(input())\r\nl1=[s for s in input().split()]\r\nc=[]\r\nfor w in l1:\r\n count=0\r\n for x in w:\r\n if 65<=ord(x)<=90:\r\n count+=1\r\n c.append(count)\r\nprint(max(c))", "def check(s):\r\n\treturn s>='A' and s<='Z'\r\nn=int(input())\r\nst=str(input())\r\nlst=[]\r\nc=0\r\nfor i in range(n):\r\n\tif check(st[i]):\r\n\t\tc+=1\r\n\tif st[i]==' ':\r\n\t\tlst.append(c)\r\n\t\tc=0\r\nlst.append(c)\r\n#print(lst)\r\nprint(max(lst))", "#import math\r\nn = int(input())\r\ns = input().split()\r\nmax_ = 0\r\n\r\nfor i in range(len(s)):\r\n s[i] = str(s[i])\r\nfor i in s:\r\n k = 0\r\n for j in range(len(i)):\r\n if i[j] >= 'A' and i[j] <= 'Z':\r\n k += 1\r\n max_ = max(max_, k)\r\nprint(max_)\r\n \r\n", "n = int(input())\r\ns = input()\r\ncounter = 0 \r\nmx = 0 \r\nfor i in s : \r\n if i.isupper():\r\n counter += 1\r\n elif i == \" \": \r\n counter = 0 \r\n mx = max(mx,counter)\r\nprint(mx)", "input()\nprint(max(len(tuple(filter(lambda s: s.isupper(), i))) for i in input().split()))", "n = int(input())\r\na = list(input().split())\r\ns =0\r\nfor i in a:\r\n\tw =0\r\n\tfor j in i:\r\n\t\tif j.isupper():w+=1\r\n\ts = max(s,w)\r\nprint(s)", "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\ns = input().split()\r\nans = 0\r\nfor i in s:\r\n cur = 0\r\n for j in i:\r\n if j.upper() == j:\r\n cur += 1\r\n ans = max(ans,cur) \r\nprint(ans) ", "x=input()\na=list(input().split())\nb=[]\nfor j in a:\n s=0\n c=list(j)\n for i in c:\n if i.upper()==i:\n s+=1\n b.append(s)\nprint(max(b))\n\n\n\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-09 00:02:03\nLastEditTime: 2021-11-09 00:05:02\nDescription: Text Volume\nFilePath: CF837A.py\n'''\n\n\ndef func():\n _ = int(input())\n words = input().strip().split()\n most = 0\n for word in words:\n count = 0\n for char in word:\n if char.isupper():\n count += 1\n if count > most:\n most = count\n print(most)\n\n\nif __name__ == '__main__':\n func()\n", "number=int(input())\r\ntext=input().split()\r\n\r\ntext_volume=[]\r\n\r\nfor i in text:\r\n word_volume=0\r\n for j in i:\r\n if(j.isupper()):\r\n word_volume+=1\r\n text_volume.append(word_volume)\r\n\r\nprint(max(text_volume))\r\n", "n = input()\r\nans = 0\r\nfor i in input().split(' '):\r\n l = 0\r\n for j in i:\r\n if 'A' <= j <= 'Z':\r\n l += 1\r\n ans = max(ans, l)\r\nprint(ans)\r\n", "_ = input()\r\nmax_vol = 0\r\nfor w in input().split():\r\n\tvol = 0\r\n\tfor c in w:\r\n\t\tif c == c.upper():\r\n\t\t\tvol += 1\r\n\tif vol > max_vol:\r\n\t\tmax_vol = vol\r\nprint(max_vol)", "import sys\n \nn = int(input())\ns = input()\nwords = s.split()\nmax = 0\ncount = 0\nfor word in words:\n\tfor i in range(len(word)):\n\t\tif ord(word[i]) >= 65 and ord(word[i]) <= 90:\n\t\t\tcount = count + 1\n\tif max < count:\n\t\tmax = count\n\tcount = 0\nprint(max)", "n = int(input())\r\nwords = list(input().split())\r\nvolumes = []\r\nfor w in words:\r\n volumes.append(len([l for l in w if l.isupper()]))\r\nprint(max(volumes))", "# 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 n = ri()\r\n s = rs()\r\n \r\n a = list(s.split(' '))\r\n sol = 0\r\n for i in a:\r\n cnt = 0\r\n for j in i:\r\n if j>='A' and j<='Z':\r\n cnt += 1\r\n sol = max(sol, cnt)\r\n \r\n wi(sol)\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", "num = input()\r\n\r\narr = input().split()\r\n\r\nmx = 0\r\nct = 0\r\nfor word in arr:\r\n for char in word:\r\n if char.isupper():\r\n ct += 1\r\n mx = max(mx, ct)\r\n ct = 0\r\n\r\nprint(mx)\r\n\r\n", "n=input()\nd=input().split()\nans=0\nfor s in d:\n k=0\n for c in s:\n if c>='A' and c<='Z':\n k+=1\n ans=max(ans,k)\nprint(ans)\n\n", "input()\r\ns=input().split()\r\nans=0\r\nfor i in s:\r\n MAX=0;\r\n for j in i:\r\n if (j in 'QWERTYUIOPASDFGHJKLZXCVBNM'):\r\n MAX+=1\r\n ans=max(ans,MAX)\r\nprint(ans)\r\n", "n = int(input())\r\nlis = list(map(str,input().split()))\r\nans=0\r\na=0\r\nfor i in lis:\r\n a=0\r\n for j in i:\r\n if j>='A' and j<='Z':\r\n a+=1\r\n ans = max(ans,a) \r\nprint(ans) ", "n=int(input())\r\nl=input().split()\r\nx=[]\r\nfor i in l:\r\n\tcount=0\r\n\tfor j in i:\r\n\t\tif j==j.upper():\r\n\t\t\tcount+=1\r\n\tx.append(count)\r\nprint(max(x))", "n = input()\r\ns = input()\r\na = s.split()\r\nans = 0\r\nfor i in a :\r\n t = len(i)\r\n cnt = 0\r\n for j in range(t):\r\n if i[j] >= 'A' and i[j] <= 'Z' :\r\n cnt+=1\r\n if cnt > ans :\r\n ans = cnt\r\nprint(ans)", "#\"from dust i have come, dust i will be\"\r\n\r\nn=int(input())\r\ns=input()\r\n\r\nm=0\r\nsum=0\r\n\r\nfor i in range(len(s)):\r\n if s[i]==' ':\r\n m=max(m,sum)\r\n sum=0\r\n if s[i].isupper():\r\n sum+=1;\r\n\r\nm=max(m,sum)\r\nprint(m)\r\n\r\n\r\n\r\n", "# ===============================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===============================\r\nimport math, fractions\r\n# ===============================\r\nn = int(input())\r\nwords = [str(x) for x in input().split()]\r\nvolume = []\r\nfor y in words:\r\n\tvolume.append(sum([1 for x in y if ord(x) >= ord(\"A\") and ord(x) <= ord(\"Z\")]))\r\nprint(max(volume))", "a = input()\r\nb = input().split()\r\nans = 0\r\nfor x in b:\r\n c = sum([1 for q in x if q.isupper()])\r\n if c > ans:\r\n ans = c\r\nprint(ans)\r\n", "def vol(s):\n\tc = 0\n\tfor i in s:\n\t\tif ord(i) >=65 and ord(i) <= 92:\n\t\t\tc+=1\n\treturn c\nn = int(input())\ns = input()\nc = 0\ns = s.split()\nmax = 0\nfor i in s:\n\tif vol(i) > max:\n\t\tmax = vol(i)\nprint (max) ", "n=int(input())\nstrs=input().split()\nl=[]\nfor i in strs:\n\tcount=0\n\tfor j in i:\n\t\tif j>='A' and j<='Z':\n\t\t\tcount+=1\n\tl.append(count)\nprint(max(l))", "import sys, math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n\r\n\r\ndef solve():\r\n n=int(input())\r\n s=input().rstrip().split()\r\n ans=0\r\n for i in s:\r\n cnt=0\r\n for j in i:\r\n if 'A'<=j<='Z': cnt+=1\r\n ans=max(ans,cnt)\r\n print(ans)\r\n \r\n \r\n \r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "_ = int(input())\r\ntext =list(input().split())\r\nans = 0 \r\nfor word in text :\r\n count = 0 \r\n for char in word:\r\n if char >= 'A' and char <= 'Z' :\r\n count += 1 \r\n ans = max(ans , count)\r\n\r\nprint(ans)\r\n\r\n ", "n = int(input())\ntext = input().split()\nans = 0\nfor word in text:\n cur_ans = 0\n for let in word:\n if let >= \"A\" and let <= \"Z\":\n cur_ans+=1\n ans = max(ans,cur_ans)\nprint(ans)", "n = input()\r\nwords = input()\r\nwords = words.split()\r\n\r\nupper = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\n\r\nmaxWeight = 0\r\n\r\ntemp = 0\r\n\r\nfor word in words:\r\n for i in word:\r\n if i in upper:\r\n temp += 1\r\n if temp > maxWeight:\r\n maxWeight = temp\r\n temp = 0\r\nprint(maxWeight) \r\n", "n=int(input())\r\ns=input()\r\nc=0\r\nl=0\r\nfor i in s:\r\n m=ord(i)\r\n if(m>=65 and m<=91):\r\n c+=1\r\n elif(i==' '):\r\n l=max(c,l)\r\n c=0\r\nl=max(l,c)\r\nprint(l)\r\n", "l = int(input())\r\nsList = input().split()\r\nvol = 0\r\nfor i in sList:\r\n tempVol = 0\r\n for j in i:\r\n if j.isupper():\r\n tempVol += 1\r\n if tempVol > vol:\r\n vol = tempVol\r\nprint(vol)", "n = int(input())\r\nwords = input().split()\r\n\r\nans = 0\r\nfor w in words:\r\n cnt = 0\r\n for c in w:\r\n if (c.isupper()):\r\n cnt += 1\r\n ans = max(ans, cnt)\r\n\r\nprint(ans)\r\n\r\n", "'''input\n24\nHarbour Space University\n'''\nn = int(input())\ns = input().split()\nm = 0\nfor x in s:\n\tc = 0\n\tfor l in x:\n\t\tif l == l.upper():\n\t\t\tc += 1\n\tm = max(m, c)\nprint(m)\n", "n = int(input())\r\ns = input().split()\r\n\r\nmx = 0\r\n\r\nfor w in s:\r\n c = 0\r\n for x in w:\r\n if x.isupper():\r\n c += 1\r\n if c > mx:\r\n mx = c\r\n\r\nprint(mx)", "n = int(input())\r\ns = input().split()\r\nmx = 0\r\nfor i in s:\r\n k = 0\r\n for j in i:\r\n if j.isupper():\r\n k += 1\r\n mx = max(mx, k)\r\nprint(mx)", "def calculate(word):\r\n result = 0\r\n for char in word:\r\n result += 1 if char.isupper() else 0\r\n return result\r\n\r\nn = input()\r\nwords = input().split()\r\nscreams = [calculate(word) for word in words]\r\nprint(max(screams))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "l = int(input())\r\nmx = 0\r\nfor i in input().split():\r\n mx = max(mx, len(list(filter(lambda s: s.isupper(), i))))\r\nprint(mx)", "input()\r\na = input().split()\r\n\r\nans = -1\r\nfor s in a:\r\n cur = 0\r\n for c in s:\r\n if ord('A') <= ord(c) <= ord('Z'):\r\n cur += 1\r\n ans = max(ans, cur)\r\nprint(ans)", "def str_volume(s):\r\n\td=0\r\n\tfor c in s:\r\n\t\tif c.isupper():\r\n\t\t\td+=1\r\n\treturn d\r\n\r\ndef text_volume(v):\r\n\tmx=0\r\n\tfor d in v:\r\n\t\tt=str_volume(d)\r\n\t\tif t>mx:\r\n\t\t\tmx=t\r\n\treturn mx\r\n\r\ninput()\r\nv=[c for c in input().split()]\r\nprint(text_volume(v))", "q = 'QWERTYUIOPASDFGHJKLZXCVBNM'\r\nm = int(input())\r\nn = input()\r\ns = 0\r\nd = 0\r\nfor i in range(len(n)):\r\n if n[i] != ' ':\r\n if n[i] in q:\r\n s += 1\r\n else:\r\n d = max(s,d)\r\n s = 0\r\nd = max(s,d)\r\nprint(d)\r\n", "n = int(input())\r\ns = list(input().split())\r\n\r\n#print(s)\r\ncnt = []\r\nres = []\r\nfor i in s :\r\n for j in i :\r\n if j.isupper():\r\n cnt.append(1)\r\n\r\n res.append(sum(cnt))\r\n cnt.clear()\r\n\r\nprint(max(res))\r\n", "n = int(input())\r\ns = input()\r\nans = 0\r\ntemp = 0 \r\nfor i in range(len(s)):\r\n if (s[i].isupper()):\r\n temp += 1\r\n if (s[i] == \" \"):\r\n if (ans < temp):\r\n ans = temp\r\n temp = 0\r\n# print(temp)\r\nprint(max(ans, temp))", "n = int(input())\r\ns = input()\r\nwords = s.split(' ')\r\nletters = \"Q W E R T Y U I O P A S D F G H J K L Z X C V B N M\".split(' ')\r\nans = 0\r\nfor word in words:\r\n temps = word\r\n for letter in letters:\r\n temps = temps.replace(letter, '')\r\n ans = max(ans, len(word) - len(temps))\r\n\r\nprint(ans)", "n = int(input())\ns = input()\nwords = s.split()\n\nlist_volume_of_words = []\n\nfor word in words:\n volume_of_words = 0\n for i in word:\n if i.isupper():\n volume_of_words += 1\n list_volume_of_words.append(volume_of_words)\n\n\nprint(max(list_volume_of_words))", "input()\r\ndef count(s):\r\n\tl=len(s)\r\n\ttem=0\r\n\tfor i in range(l):\r\n\t\tif s[i].isupper():\r\n\t\t\ttem=tem+1\r\n\treturn tem\r\nprint(max(count(word)for word in input().split()))\r\n", "n=int(input())\r\nl=input().split()\r\nans=0\r\nfor i in l:\r\n cnt=0\r\n for j in i:\r\n if j>='A' and j<='Z':\r\n cnt+=1\r\n ans=max(ans,cnt)\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip().split())\r\nans = 0\r\nfor s0 in s:\r\n c = 0\r\n for j in s0:\r\n c += ord(j) // 97 ^ 1\r\n ans = max(ans, c)\r\nprint(ans)", "n = int(input())\na = input().split()\nprint (max(sum(str(i).isupper() for i in j) for j in a))\n", "n=int(input())\r\ns=input()\r\nc,m=0,0\r\nfor i in s:\r\n if i.isupper():\r\n c+=1 \r\n elif i==\" \":\r\n m=max(c,m) \r\n c=0 \r\nm=max(c,m)\r\nprint(m)\r\n", "n=int(input())\r\ns=input().split()\r\nm=0\r\nfor x in s:\r\n p=len([y for y in x if y>='A' and y<='Z' ])\r\n if(p>m):\r\n m=p \r\nprint(m)", "n = int(input())\r\nwords = input().split()\r\nmax_volume = 0\r\nfor word in words:\r\n volume = 0\r\n for sym in word:\r\n if sym.isupper():\r\n volume += 1\r\n max_volume = max(max_volume, volume)\r\n\r\nprint(max_volume)", "n = int(input())\r\na = list(input().split()); vol =0; vols = []\r\nfor i in range(len(a)):\r\n for j in ((a[i])):\r\n if j.isupper() == True:\r\n vol+=1\r\n vols.append(vol)\r\n vol = 0\r\nprint(max(vols))", "n=int(input())\r\ns=input()\r\nlst=s.split(' ')\r\ndef countVol(s):\r\n res=0\r\n for i in s:\r\n if i.isupper():\r\n res+=1 \r\n return res \r\nMAX=0\r\nfor i in lst:\r\n MAX=max(MAX,countVol(i))\r\nprint(MAX)", "A = int(input())\nB = input()\ntemp = 0\ntemp1 = 0\nfor i in B:\n if 'A' <= i <= 'Z':\n temp = temp + 1\n elif i == ' ':\n temp = 0\n if temp > temp1:\n temp1 = temp\nprint(temp1)\n \n \n", "def volumn(word):\n return sum(c.isupper() for c in word)\n\n\ndef main():\n input()\n words = input().split()\n print(max(volumn(word) for word in words))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\ns = input().split()\r\nb = []\r\nfor i in s:\r\n\tcount = 0\r\n\tfor j in range(len(i)):\r\n\t\tif i[j].isupper():\r\n\t\t\tcount+=1\r\n\tb.append(count)\r\nprint(max(b))", "i = input()\ntext = input().split()\nans = -1\nfor t in text:\n ta = 0\n for m in t:\n if \"A\" <= m <= \"Z\":\n ta+=1\n ans = max(ta, ans)\nprint(ans)\n", "n = int(input())\ntxt = input().split()\nvol = 0\nfor word in txt:\n s = [1 for c in word if c.isupper()]\n vol = max(vol, sum(s))\n\nprint(vol)\n", "numupper=lambda x:len([i for i in x if i.isupper()])\r\ninput()\r\nprint(max([map(numupper,input().split())]))", "n = int(input())\r\ns = str(input()[:n])\r\nk = s.split()\r\nc = 0\r\narr = []\r\n\r\nfor word in k:\r\n for i in word:\r\n if i.isupper():\r\n c += 1\r\n arr.append(c)\r\n c = 0\r\n\r\nprint(max(arr))", "n = int(input())\r\n\r\nl = list(map(str, input().split()))\r\nans = 0\r\nfor i in range(len(l)):\r\n ans = max(ans, sum(map(str.isupper, l[i])))\r\n\r\nprint(ans)\r\n", "n = input()\ns = input()\nwords = s.split()\nt_vol = 0\nfor word in words:\n vol = 0\n for l in word:\n if l.isupper():\n vol = vol + 1\n t_vol = max(t_vol, vol)\n\nprint(t_vol)\n\t \t\t\t\t\t\t \t\t \t \t \t\t", "def check_upper(c):\n if c >= 'A' and c <= 'Z':\n return True\n else:\n return False\nX = int(input())\ny = input().split()\nhighest = 0\nfor i in range(0,len(y)):\n b = 0\n for e in range(0,len(y[i])):\n if check_upper(y[i][e]) == True:\n b += 1\n if b > highest:\n highest = b\nprint(highest)\n\t\t\t\t \t \t\t \t \t \t\t \t\t", "n = int(input())\r\ns = str(input()) + \" \"\r\nc = 0\r\nm = 0\r\nfor el in s:\r\n if el == \" \":\r\n m = max(m, c)\r\n c = 0\r\n elif ord(el) <= 96:\r\n c += 1\r\nprint(m)", "import string\r\nx=int(input())\r\nn=input()\r\nl=n.split()\r\nemp=[]\r\nalpha=string.ascii_uppercase\r\ndef string(s):\r\n c1=0\r\n for ss in s:\r\n if ss in alpha:\r\n c1+=1\r\n return c1\r\nfor s in l:\r\n emp.append(string(s))\r\nprint(max(emp))", "_ = input()\ntext = input()\nmx_volume = 0\nvolume = 0\nfor x in text:\n if x.isupper():\n volume += 1\n elif x == ' ':\n volume = 0\n mx_volume = max(mx_volume, volume)\nprint(mx_volume)\n", "n = int(input())\r\nline = list(input().split())\r\nvolume = 0\r\nfor word in line:\r\n count = 0\r\n for i in range(len(word)):\r\n if word[i].isupper():\r\n count += 1\r\n if count > volume:\r\n volume = count\r\n\r\nprint(volume)\r\n", "def determiner(stroka):\r\n maxx = 0\r\n for m in range(len(stroka)):\r\n if stroka[m].isupper():\r\n maxx = maxx + 1\r\n return maxx\r\n\r\n\r\nt = int(input())\r\nstroka = input() + ' '\r\nmaks = 0\r\nm = 0\r\nfor i in range(t + 1):\r\n if stroka[i] == \" \":\r\n ans = stroka[m:i]\r\n m = i + 1\r\n num = determiner(ans)\r\n if num > maks:\r\n maks = num\r\n num = 0\r\nprint(maks)\r\n", "n=int(input())\r\nl=list(input().split(\" \"))\r\nans=0\r\nan=0\r\nfor s in l:\r\n \r\n for j in range(len(s)):\r\n if s[j].isupper():\r\n ans=ans+1\r\n if an<ans:\r\n an=ans\r\n ans=0\r\nprint(an)\r\n", "a=input()\na=0\nb=input().split( )\nfor i in b:\n c=0\n for j in i:\n if j in 'QWERTYUIOPASDFGHJKLZXCVBNM':\n c+=1\n a=max(a,c)\nprint(a)", "n=int(input())\r\na=list(map(str,input().split(\" \")))\r\nb=[]\r\nc=0\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j].isupper()==True:\r\n c+=1\r\n b.append(c)\r\n c=0\r\nprint(max(b))\r\n", "s = int(input())\r\nwords = input().split()\r\nprint(max(sum(c.isupper() for c in w) for w in words))", "f = int(input())\nn = input().split(\" \")\na =[]\nfor i in range(len(n)):\n\ta.append(n[i])\nmaxx = 0\nfor i in range(len(a)):\n\tcount = 0\n\tc = a[i]\n\tfor j in range(len(c)):\n\t\tif (ord(c[j]) < 64 or ord(c[j])>91):\n\t\t\tcontinue\n\t\telse:\n\t\t\tcount += 1\n\tif (count > maxx):\n\t\tmaxx = count\nprint(maxx)\t", "def ans(s):\r\n sum=0\r\n for i in range(0,len(s),1):\r\n c=s[i]\r\n if(c.isupper()):\r\n sum+=1\r\n return sum\r\n\r\nt=int(input())\r\ns=str(input())\r\nk=s.split(\" \")\r\nd=0\r\nm=0\r\nfor i in k:\r\n d=ans(i)\r\n m=max(d,m)\r\nprint(m)\r\n", "t=int(input())\r\ns=input()\r\nh=[]\r\nfor i in s.split():\r\n h.append(len([j for j in i if j in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ']))\r\nprint(max(h))", "# -- coding:utf-8 --\r\nnum=(int)(input().strip())\r\na=input().strip()\r\nupper_a=a.upper()\r\nupper_num=0\r\nfinal_num=0\r\nfor index in range(0,num):\r\n if a[index]!=' ' and a[index]==upper_a[index]:\r\n upper_num+=1\r\n if final_num < upper_num:\r\n final_num=upper_num\r\n if a[index]==' ':\r\n upper_num=0\r\nprint(final_num)\r\n", "n = int(input())\r\nline = input()\r\nvol = 0\r\nmax = 0\r\nfor e in line:\r\n if e.isupper():\r\n vol += 1\r\n if e == ' ':\r\n if vol > max:\r\n max = vol\r\n vol = 0\r\nif vol > max:\r\n max = vol\r\nprint(max)", "a=int(input())\ns=input().split()\nb=[0]len(s)\nc=['Q','W','E','R','T','Y','U','I','O','P','A','S','D','F','G','H','J','K','L','Z','X','C','V','B','N','M']\nfor i in range(len(s)):\n for j in s[i]:\n if(j in c):\n b[i]=b[i]+1\nprint(max(b))\n \n \n\n\n", "n=int(input())\r\ns=input().strip()\r\nl=s.split(\" \")\r\nm=0\r\nfor i in l:\r\n c=0\r\n for j in i:\r\n if(j>='A' and j<='Z'):\r\n c+=1\r\n m=max(m,c)\r\nprint(m) ", "n = int(input())\r\ntext = input()\r\nwords = text.split(' ')\r\nmaxvol = 0\r\nfor word in words:\r\n vol = 0\r\n for c in word:\r\n if c.isupper():\r\n vol += 1\r\n\r\n maxvol = max(maxvol, vol)\r\n\r\nprint(maxvol)\r\n", "n = int(input())\n\ns = str(input())\n\nss = s.split(\" \")\nmax = 0\nfor sss in ss:\n ans = 0 \n for ssss in sss:\n if ssss.isupper():\n ans +=1\n if max < ans:\n max = ans\n\nprint(max)\n", "input()\r\nans = 0\r\nfor s in input().split():\r\n a = 0\r\n for c in s:\r\n if c.isupper():\r\n a += 1\r\n ans = max(ans, a)\r\nprint(ans)\r\n", "n = int(input())\ntext = input().split()\nans = 0\nfor word in text:\n kapa = 0\n for ch in word:\n if ch == ch.upper():\n kapa += 1\n ans = max(kapa, ans)\nprint(ans)\n", "input()\r\nprint(max(sum(map(str.isupper,s)) for s in input().split()))", "n=int(input(''))\r\ns=input('')\r\nl=[]\r\nm=[]\r\nc=0\r\nk=s.split()\r\nfor i in k:\r\n c=0\r\n l=[]\r\n for j in range(len(i)):\r\n if ord(i[j])>=65 and ord(i[j])<=90:\r\n c+=1\r\n l.append(c)\r\n m.append(sum(l))\r\nprint(max(m))\r\n#print(m)", "input()\r\na = list(input().split())\r\nrs = 0\r\nfor s in a:\r\n t = 0\r\n for i in s:\r\n if 'A'<= i and i <='Z':\r\n t+=1\r\n rs = max (rs , t)\r\nprint(rs)", "n = int(input())\r\ns = input()\r\nls = s.split()\r\nans = []\r\nfor i in range(len(ls)):\r\n count = 0\r\n for e in range(len(ls[i])):\r\n if ls[i][e].isalpha() and ls[i][e].isupper():\r\n count += 1\r\n ans.append(count)\r\nprint(max(ans))\r\n", "n=int(input())\r\nn1=input().split()\r\nlst=[]\r\nfor i in n1:\r\n s=0\r\n for j in i:\r\n if(j.isupper()==True):\r\n s=s+1\r\n lst.append(s)\r\nprint(max(lst))\r\n", "a=int(input())\r\nb=input().split()\r\n\r\nsum=-1\r\n\r\nfor i in b:\r\n temp=0\r\n for j in range(len(i)):\r\n if i[j].isupper():\r\n temp+=1\r\n sum=max(sum,temp)\r\n\r\nprint(sum)\r\n", "#python 3.5.2\r\n\r\nalp = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nres = 0\r\nres1 = 0\r\n\r\nk = int(input())\r\nstrok = input()\r\n\r\nfor i in strok:\r\n if i == ' ':\r\n if res1 >= res:\r\n res = res1\r\n res1 = 0\r\n \r\n if res1 < res:\r\n res1 = 0\r\n \r\n if alp.find(i) != -1:\r\n res1 = res1 + 1\r\n \r\nif res1 >= res:\r\n res = res1\r\n\r\nprint(res)\r\n " ]	{"inputs": ["7\nNonZERO", "24\nthis is zero answer text", "24\nHarbour Space University", "2\nWM", "200\nLBmJKQLCKUgtTxMoDsEerwvLOXsxASSydOqWyULsRcjMYDWdDCgaDvBfATIWPVSXlbcCLHPYahhxMEYUiaxoCebghJqvmRnaNHYTKLeOiaLDnATPZAOgSNfBzaxLymTGjfzvTegbXsAthTxyDTcmBUkqyGlVGZhoazQzVSoKbTFcCRvYsgSCwjGMxBfWEwMHuagTBxkz", "199\no A r v H e J q k J k v w Q F p O R y R Z o a K R L Z E H t X y X N y y p b x B m r R S q i A x V S u i c L y M n N X c C W Z m S j e w C w T r I S X T D F l w o k f t X u n W w p Z r A k I Y E h s g", "200\nhCyIdivIiISmmYIsCLbpKcTyHaOgTUQEwnQACXnrLdHAVFLtvliTEMlzBVzTesQbhXmcqvwPDeojglBMIjOXANfyQxCSjOJyO SIqOTnRzVzseGIDDYNtrwIusScWSuEhPyEmgQIVEzXofRptjeMzzhtUQxJgcUWILUhEaaRmYRBVsjoqgmyPIKwSajdlNPccOOtWrez", "1\ne", "1\nA", "200\nABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ KLMNOPRSTU KLMNOPRSTU KLMNOPRSTU VWXYZABCDE KLMNOPRSTU KLMNOPRSTU KLMNOPRSTU KLMNOPRSTU KZ", "200\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA", "200\nffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff", "24\nHarbour Space UniversitY", "5\naA AA", "10\nas AS ASDA", "10\nas AS ASDZ", "3\na A", "24\nHarbour space UniversitY", "10\nas AS ASAa", "15\naAb ABCDFGRHTJS", "53\nsdfAZEZR AZE dfdf dsdRFGSDF ZZDZSD dfsd ERBGF dsfsdfR", "10\nABC ABc AB", "10\nA c de CDE", "4\nA AB", "18\nHARbour Space UNIV", "13\na b c d e f A", "6\nA B CA", "4\naa A", "3\nA a"], "outputs": ["5", "0", "1", "2", "105", "1", "50", "0", "1", "10", "200", "0", "2", "2", "4", "4", "1", "2", "3", "11", "6", "3", "3", "2", "4", "1", "2", "1", "1"]}	UNKNOWN	PYTHON3	CODEFORCES	436
8be1c3722f69c951ceff8bd6b888d662	80-th Level Archeology	Archeologists have found a secret pass in the dungeon of one of the pyramids of Cycleland. To enter the treasury they have to open an unusual lock on the door. The lock consists of n words, each consisting of some hieroglyphs. The wall near the lock has a round switch. Each rotation of this switch changes the hieroglyphs according to some rules. The instruction nearby says that the door will open only if words written on the lock would be sorted in lexicographical order (the definition of lexicographical comparison in given in notes section). The rule that changes hieroglyphs is the following. One clockwise rotation of the round switch replaces each hieroglyph with the next hieroglyph in alphabet, i.e. hieroglyph x (1<=≤<=x<=≤<=c<=-<=1) is replaced with hieroglyph (x<=+<=1), and hieroglyph c is replaced with hieroglyph 1. Help archeologist determine, how many clockwise rotations they should perform in order to open the door, or determine that this is impossible, i.e. no cyclic shift of the alphabet will make the sequence of words sorted lexicographically. The first line of the input contains two integers n and c (2<=≤<=n<=≤<=500<=000, 1<=≤<=c<=≤<=106) — the number of words, written on the lock, and the number of different hieroglyphs. Each of the following n lines contains the description of one word. The i-th of these lines starts with integer li (1<=≤<=li<=≤<=500<=000), that denotes the length of the i-th word, followed by li integers wi,<=1, wi,<=2, ..., wi,<=li (1<=≤<=wi,<=j<=≤<=c) — the indices of hieroglyphs that make up the i-th word. Hieroglyph with index 1 is the smallest in the alphabet and with index c — the biggest. It's guaranteed, that the total length of all words doesn't exceed 106. If it is possible to open the door by rotating the round switch, print integer x (0<=≤<=x<=≤<=c<=-<=1) that defines the required number of clockwise rotations. If there are several valid x, print any of them. If it is impossible to open the door by this method, print <=-<=1. Sample Input 4 3 2 3 2 1 1 3 2 3 1 4 2 3 1 2 2 5 2 4 2 2 4 2 4 4 1 2 1 3 1 4 1 2 Sample Output 1 0 -1	[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, c = map(int, input().split())\r\nw1 = list(map(int, input().split()))[1:]\r\nng = [0] * (c + 1)\r\nok = 1\r\nfor _ in range(n - 1):\r\n w2 = list(map(int, input().split()))[1:]\r\n f = 0\r\n for i, j in zip(w1, w2):\r\n if i < j:\r\n l = c - j + 1\r\n r = l + (j - i) % c\r\n ng[l] += 1\r\n ng[r] -= 1\r\n f = 1\r\n break\r\n elif i > j:\r\n l = c - i + 1\r\n r = l + (i - j) % c\r\n ng[0] += 1\r\n ng[l] -= 1\r\n ng[r] += 1\r\n f = 1\r\n break\r\n if not f and len(w1) > len(w2):\r\n ok = 0\r\n w1 = w2\r\nans = -1\r\nif ok:\r\n for i in range(1, c + 1):\r\n ng[i] += ng[i - 1]\r\n if not ng[i]:\r\n ans = i\r\n break\r\n if not ng[0]:\r\n ans = 0\r\nprint(ans)" ]	{"inputs": ["4 3\n2 3 2\n1 1\n3 2 3 1\n4 2 3 1 2", "2 5\n2 4 2\n2 4 2", "4 4\n1 2\n1 3\n1 4\n1 2", "3 1\n2 1 1\n2 1 1\n3 1 1 1", "2 10\n14 9 6 7 1 6 9 3 1 9 4 6 8 8 1\n3 3 7 6", "5 10\n1 5\n7 5 1 10 5 3 7 10\n1 2\n1 3\n7 4 7 3 9 4 6 1", "50 5\n1 4\n1 4\n1 4\n1 4\n2 4 4\n2 4 5\n2 4 5\n3 4 1 1\n4 4 1 2 5\n7 4 3 2 1 4 4 5\n1 5\n1 5\n1 5\n1 5\n2 5 4\n2 5 5\n2 5 5\n2 5 1\n2 5 3\n1 1\n1 1\n1 1\n1 1\n2 1 4\n2 1 4\n2 1 5\n2 1 1\n2 1 1\n2 1 3\n9 1 3 4 3 2 5 5 5 2\n1 2\n1 2\n3 2 4 2\n2 2 1\n2 2 2\n2 2 2\n2 2 2\n1 3\n1 2\n1 3\n1 3\n1 3\n1 3\n1 3\n2 3 4\n3 3 4 4\n5 3 4 5 2 1\n2 3 5\n2 3 2\n2 3 3", "10 10\n2 6 6\n1 7\n1 8\n2 8 2\n2 9 2\n2 10 5\n1 1\n1 4\n3 4 9 3\n2 5 1"], "outputs": ["1", "0", "-1", "0", "2", "6", "-1", "5"]}	UNKNOWN	PYTHON3	CODEFORCES	1
8be653bb7d31a6854b649c9565e080e5	April Fools' Problem (easy)	The marmots have prepared a very easy problem for this year's HC2 – this one. It involves numbers n, k and a sequence of n positive integers a1,<=a2,<=...,<=an. They also came up with a beautiful and riveting story for the problem statement. It explains what the input means, what the program should output, and it also reads like a good criminal. However I, Heidi, will have none of that. As my joke for today, I am removing the story from the statement and replacing it with these two unhelpful paragraphs. Now solve the problem, fools! The first line of the input contains two space-separated integers n and k (1<=≤<=k<=≤<=n<=≤<=2200). The second line contains n space-separated integers a1,<=...,<=an (1<=≤<=ai<=≤<=104). Output one number. Sample Input 8 5 1 1 1 1 1 1 1 1 10 3 16 8 2 4 512 256 32 128 64 1 5 1 20 10 50 30 46 6 6 6 6 6 6 6 6 1 1 100 Sample Output 571036100	[ "a,b=map(int,input().split())\r\nt=[int(i) for i in input().split()]\r\ncount=0\r\nt.sort()\r\nfor i in range(b):count+=t[i]\r\nprint(count)", "n, k = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nc = sorted(b)\r\nprint(sum(c[:k]))\r\n", "Q=lambda:map(int,input().split())\r\n_,k=Q()\r\nprint(sum(sorted(Q())[:k]))", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr = sorted(arr)\r\nprint(sum(arr[i] for i in range(k)))", "\r\nn, k = map(int, input().split())\r\nl = sorted(list(map(int, input().split())))\r\n\r\nprint(sum(l[:k]))", "n,k=map(int,input().split())\r\nll=list(map(int,input().split()))\r\nll.sort()\r\nprint(sum(ll[:k]))", "N,K=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nprint(sum(sorted(A)[:K]))", "s=[map(int,open(0).read().split())];print(sum(sorted(s[2:])[:s[1]]))", "Y=lambda:map(int,input().split());n,k=Y();print(sum(sorted(Y())[:k]))", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nsum = 0\r\nfor ki in range(k):\r\n minl = min(l)\r\n sum += minl\r\n l.remove(minl)\r\nprint (sum)\r\n", "n, k = map(int, input().split())\nv = [int(i) for i in input().split()]\n\nv.sort()\nprint(sum(v[:k]))\n", "s=input()\r\ns=s.split()\r\nk=s[1]\r\ns=input()\r\ns=s.split()\r\nfor i in range(len(s)):\r\n s[i]=int(s[i])\r\ns.sort()\r\nans=0\r\nfor i in range(int(k)):\r\n ans+=(s[i])\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\ns = 0\r\nfor i in range(k):\r\n s += arr[i]\r\n\r\nprint(s)\r\n\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\nprint(sum(arr[:k]))", "n,k=map(int,input().split());print(sum(sorted(list(map(int,input().split())))[:k]))", "N,K=list(map(int,input().split()))\r\nA=list(map(int,input().split()))\r\nA.sort()\r\nsuma=0\r\nfor i in range(K):\r\n suma+=A[i]\r\nprint(suma)", "p = lambda: list(map(int, input().split()))\r\n\r\nN, K = p()\r\nprint(sum(sorted(p())[:K]))", "n,k=map(int,input().split())\r\nA=sorted(list(map(int,input().split())))\r\nR=sum(A[0:k])\r\nprint(R)\r\n", "n,k=map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\nl.sort()\r\nprint(sum(l[:k]))", "\r\nn,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=0\r\nfor i in range(k):\r\n ans+=a[i]\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n ", "x,y=map(int,input().split())\r\nn=list(map(int,input().split()))\r\nn=sorted(n)\r\nans=0\r\nfor num in range(y):\r\n ans=ans+n[num]\r\nprint(ans)", "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, k = get_ints()\r\n a = get_array()\r\n a.sort()\r\n s = 0\r\n for i in range(k): s += a[i]\r\n print(s)\r\nif __name__ == \"__main__\":\r\n main()", "v=int(input().split()[1].strip())\r\nval=input().split()\r\nval=sorted([int(x.strip()) for x in val])\r\nprint(sum(val[0:v]))", "n,k = list(map(int,input().split()))\r\n\r\narr= list(map(int,input().split()))\r\narr.sort()\r\nsumm=0\r\n\r\nfor i in range(k):\r\n summ+=arr[i]\r\nprint(summ)", "import poplib\r\nimport string\r\nimport math\r\n\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n a.sort()\r\n print(sum(a[:k]))\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "#ROUNIAAUDI\r\nb,v=map(int,input().split())\r\nw=sorted(list(map(int,input().split())))\r\ns=0\r\nfor i in range(v):\r\n s+=w[i]\r\n\r\nprint(s)", "a = input().split()\r\nk = input().split()\r\ns = []\r\nfor i in k:\r\n s.append(int(i))\r\ns.sort()\r\nd = 0\r\nfor i in range(int(a[1])):\r\n d += int(s.pop(0))\r\nprint(d)\r\n \r\n", "from sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn,k = get_ints()\r\nar = sorted(get_ints())\r\nprint(sum(ar[:k]))", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-24 23:46:53\nLastEditTime: 2021-11-24 23:48:39\nDescription: April Fools' Problem (easy)\nFilePath: CF802M.py\n'''\n\n\ndef func():\n n, k = map(int, input().strip().split())\n lst = sorted(map(int, input().strip().split()))\n print(sum(lst[:k]))\n\n\nif __name__ == '__main__':\n func()\n ", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nprint(sum(sorted(A)[:k]))", "k=int(input().split()[-1])\r\nprint(sum(sorted(map(int,input().split()))[:k]))", "N , K = map(int,input().split())\r\nA = [int(i) for i in input().split()]\r\nA.sort()\r\ncount = 0\r\nfor i in range(K):\r\n count += A[i]\r\n\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\nprint(sum(sorted(map(int, input().split()))[:m]))\r\n", "i_liczb, i_wziac = map(int, input().split())\r\nliczby = list(map(int, input().split()))\r\nprint(sum(sorted(liczby)[:i_wziac]))", "a,b=input().split();print(sum(sorted(list(map(int,input().split())))[:int(b)]))", "n, m = [int(i) for i in input().split()]\r\nk = [int(i) for i in input().split()]\r\nk.sort()\r\nsm = 0\r\nfor i in range(m):\r\n sm += k[i]\r\nprint(sm)", "N, K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nprint(sum([A[i] for i in range(K)]))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = sorted(map(int, input().split()))\r\nprint(sum(w[:k]))", "n,m=map(int, input().split())\r\nl=[]\r\nl=list(map(int, input().split()))\r\nl.sort()\r\nprint(sum(l[0:m]))", "n,k=map(int,input().split());s,l=0,sorted(list(map(int,input().split())))\r\nwhile k: k-=1;s+=l[k]\r\nprint(s)", "_, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nprint(sum(sorted(a)[:k]))", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n#b = list(map(int, input().split()))\r\n\r\na = sorted(a)\r\n\r\nprint(sum(a[:m]))", "# LUOGU_RID: 101671699\nn, k, a = map(int, open(0).read().split())\r\nprint(sum(sorted(a)[:k]))", "a = input()\r\nn, k = map(int, a.split())\r\nb = input()\r\nnumbers = list(map(int, b.split()))\r\nsorted(numbers)\r\nprint(sum(sorted(numbers)[0:k]))" ]	{"inputs": ["8 5\n1 1 1 1 1 1 1 1", "10 3\n16 8 2 4 512 256 32 128 64 1", "5 1\n20 10 50 30 46", "6 6\n6 6 6 6 6 6", "1 1\n100", "1 1\n1", "10 5\n147 1917 5539 7159 5763 416 711 1412 6733 4402", "100 60\n1443 3849 6174 8249 696 8715 3461 9159 4468 2496 3044 2301 2437 7559 7235 7956 8959 2036 4399 9595 8664 9743 7688 3730 3705 1203 9332 7088 8563 3823 2794 8014 6951 1160 8616 970 9885 2421 6510 4885 5246 6146 8849 5141 8602 9486 7257 3300 8323 4797 4082 7135 80 9622 4543 6567 2747 5013 4626 9091 9028 9851 1654 7021 6843 3209 5350 3809 4697 4617 4450 81 5208 1877 2897 6115 3191 2878 9258 2849 8103 6678 8714 8024 80 9894 321 8074 6797 457 1348 8652 811 7215 4381 5000 7406 7899 9974 844"], "outputs": ["5", "7", "10", "36", "100", "1", "4603", "206735"]}	UNKNOWN	PYTHON3	CODEFORCES	44
8bf008186e7ef1b9076e19b8f3ab5c1a	Scrambled	Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i]<==<=R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet. Yuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. The first line of input contains a single integer N (1<=≤<=N<=≤<=16). The second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i]<=<<=M[i]. Output a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10<=-<=4. Sample Input 1 2 0 2 2 3 1 0 Sample Output 0.500000 0.666667	[ "from fractions import gcd\nfrom functools import reduce\nfrom operator import mul\n\nn = int(input())\nm = [int(x) for x in input().split()]\nr = [int(x) for x in input().split()]\n\nlcm = m[0]\nif len(m) > 1:\n lcm = reduce(mul, m, 1) // reduce(gcd, m, 0)\n\nres = 0\nfor d in range(min(lcm, 100000)):\n for i in range(n):\n if d % m[i] == r[i]:\n res += 1\n break\n\nprint(res / min(lcm, 100000))\n", "# coding: utf-8\r\n\r\nfrom functools import reduce\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\ndef lcm (x, y):\r\n return x * y // gcd(x, y)\r\n \r\nn = int(input())\r\nm = list(map(int, input().split()))\r\nr = list(map(int, input().split()))\r\ng = reduce(lambda x, y: lcm(x, y), m)\r\ncount = 0\r\n\r\nfor i in range(g):\r\n for j in range(n):\r\n if i % m[j] == r[j]:\r\n count += 1\r\n break\r\n\r\nprint(count / g)", "n = int(input())\nM = [int(x) for x in input().split()]\nR = [int(x) for x in input().split()]\nans = 0\nfor d in range(100000):\n for i in range(n):\n if d % M[i] == R[i]:\n ans += 1\n break\nprint(ans / (100000))\n", "k = int(input())\r\nq1 = list(map(int,input().split()))\r\nq2 = list(map(int,input().split()))\r\nz = 100000\r\nans = 0\r\nfor i in range(1,z+1):\r\n for j in range(len(q1)):\r\n if i%q1[j] == q2[j]:\r\n ans+=1\r\n break\r\nprint(ans/z)", "def gcd(a, b):\r\n a, b = max(a, b), min(a, b)\r\n while a%b!=0:\r\n a%=b\r\n a, b = b, a\r\n return b\r\n\r\ndef gsd(a, b):\r\n return ab//gcd(a, b)\r\n\r\nn=int(input())\r\nm=list(map(int, input().split()))\r\nr=list(map(int, input().split()))\r\nx=m[0]\r\nfor i in range(1, n):\r\n x=gsd(x, m[i])\r\ncount=0\r\nfor i in range(x):\r\n for j in range(n):\r\n if i%m[j]==r[j]:\r\n count+=1\r\n break\r\nprint(count/x)\r\n", "input()\r\nf=lambda:map(int,input().split())\r\nT,l=1<<19,list(zip(f(),f()))\r\nprint(sum(any(d%m==r for m,r in l) for d in range(T))/T)", "f = lambda: map(int, input().split())\r\nf()\r\nk = 720720\r\nt = [0] k\r\nfor m, r in zip(f(), f()): t[r::m] = [1] * (k // m)\r\nprint(sum(t) / k)", "def main():\r\n \r\n n = int(input())\r\n m = list(map(int, input().split()))\r\n r = list(map(int, input().split()))\r\n \r\n cnt = 0\r\n for i in range(1, 1000001):\r\n for j in range(n):\r\n if i % m[j] == r[j]:\r\n cnt += 1\r\n break\r\n \r\n ans = cnt / 1000000.0\r\n print(\"%.6f\" % ans)\r\nmain()\r\n", "from math import \r\ndef find_lcm(num1,num2):\r\n g=gcd(num1,num2)\r\n lcm=int(int(num1num2)/int(g))\r\n return lcm\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nif n==1:\r\n lcm=r[0]\r\nelse:\r\n lcm=find_lcm(r[0],r[1])\r\n for i in range(2,n):\r\n lcm=find_lcm(lcm,r[i])\r\ncnt=0\r\nfor i in range(lcm):\r\n for j in range(n):\r\n if i%r[j]==m[j]:\r\n cnt+=1\r\n break\r\nprint(cnt/lcm)\r\n", "#!/usr/bin/env python\n\n\ndef should_wash(r, m, d):\n return any(d % mm == rr for mm, rr in zip(m, r))\n\n\ndef main():\n input()\n m = [int(x) for x in input().split()]\n r = [int(x) for x in input().split()]\n\n cnt = 0\n t = 100000\n\n for i in range(t):\n if should_wash(r, m, i):\n cnt += 1\n\n print(cnt / t)\n\n\nif __name__ == '__main__':\n main()\n", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n\r\nn = int(input())\r\nm = list(map(int, input().split()))\r\nr = list(map(int, input().split()))\r\nl = 1\r\ns = set()\r\nfor i in range(n):\r\n l = lcm(l, m[i])\r\nfor k in range(l // min(m) + 1):\r\n for j in range(n):\r\n if m[j] * k + r[j] <= l:\r\n s.add(m[j] * k + r[j])\r\nif 0 in s:\r\n s.remove(0)\r\nq = len(s)\r\nprint(q / l)\r\n", "n = int(input())\r\nm = [int(i) for i in input().split(\" \")]\r\nr = [int(i) for i in input().split(\" \")]\r\n\r\nL = 720720\r\nans = 0\r\n\r\nfor i in range(L):\r\n for j, k in zip(m, r):\r\n if i % j == k:\r\n ans += 1\r\n break\r\n\r\nprint(ans/L)", "##a\r\n##print([1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8092, 16184, 32368, 64736, 129472, 258944, 517888, 1035776, 2071552, 4143104, 8286208, 16572416, 33144832, 66289664, 132579328, 265158656, 530317312, 1060634624, 2121269248, 4242538496, 8485076992, 16970153984, 33940307968][int(input())])\r\n\r\n##b\r\ndef gcd(a,b):\r\n if(b):\r\n return gcd(b,a%b)\r\n else:\r\n return a\r\n\r\ndef lcm(A):\r\n m = A[0]\r\n for a in A[1:]:\r\n m = m * a // gcd(m,a)\r\n return m\r\n \r\n\r\nn = int(input())\r\nA = [int(s) for s in input().split()]\r\nB = [int(s) for s in input().split()]\r\nm = lcm(A)\r\n##print(m)\r\ncnt=0\r\nfor day in range(1,m+1):\r\n flag=True\r\n for j in range(n):\r\n if(day % A[j] == B[j]):\r\n flag=False\r\n break\r\n if(flag==False): cnt += 1\r\nprint(cnt/m)\r\n", "n=int(input())\r\nm = list(map(int,input().strip().split()))[:n]\r\nr = list(map(int,input().strip().split()))[:n]\r\ncounter=0\r\nfor i in range(0,10000000):\r\n for j in range (0,n):\r\n if (i%m[j]==r[j]):\r\n counter=counter+1\r\n break\r\nprint(counter/10000000)\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\nr = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in range(720720):\r\n\tfor j in range(n):\r\n\t\tif i % m[j] == r[j]:\r\n\t\t \tcnt += 1\r\n\t\t \tbreak\r\n\r\nprint(cnt / 720720)", "def scrambled(lst1, lst2):\r\n count = 0\r\n for i in range(360360):\r\n flag = 0\r\n for x, y in zip(lst2, lst1):\r\n if i % y == x:\r\n flag = 1\r\n break\r\n if flag:\r\n count += 1\r\n return \"{0:.6f}\".format(count / 360360)\r\n\r\n\r\nN = int(input())\r\nm = [int(j) for j in input().split()]\r\nr = [int(z) for z in input().split()]\r\nprint(scrambled(m, r))\r\n", "Maxv=720720\r\n\r\nn=int(input())\r\ns=0\r\n\r\nm=[int(i) for i in input().split()]\r\nr=[int(i) for i in input().split()]\r\n\r\nm.reverse()\r\nm.append(0)\r\nm.reverse()\r\nr.reverse()\r\nr.append(0)\r\nr.reverse()\r\n\r\nfor i in range(1,Maxv+1):\r\n for j in range(1,n+1):\r\n if i%m[j]==r[j]:\r\n s+=1\r\n break\r\n\r\nans=1.0s/Maxv\r\nprint(\"%.6lf\"%ans)", "def gcd(a, b):\n\twhile b != 0:\n\t\ta %= b\n\t\ta, b = b, a\n\treturn abs(a)\n\ndef lcm(a, b):\n\treturn abs(a b) // gcd(a, b)\n\nn = int(input())\nm = [int(i) for i in input().split()]\nr = [int(i) for i in input().split()]\n\nl = 1\nfor i in m:\n\tif i != 0:\n\t\tl = lcm(l, i)\n\n#print(l)\n\nc = 0\nfor d in range(l):\n\tf = False\n\tfor i in range(n):\n\t\tif (m[i] != 0) and (d % m[i] == r[i]):\n\t\t\tf = True\n\t\t\tbreak\n\tif f:\n\t\tc += 1\n\nprint(c / l)\n", "n = int(input())\r\nM = list(map(int, input().split()))\r\nR = list(map(int, input().split()))\r\nMax = 100000\r\nanswer = 0\r\nfor i in range(Max):\r\n for j in range(n):\r\n if (i % M[j] == R[j]):\r\n answer += 1\r\n break\r\nprint(answer / Max)", "import math\r\n\r\n\r\ndef find_lcm(num1, num2):\r\n if num1 > num2:\r\n num = num1\r\n den = num2\r\n else:\r\n num = num2\r\n den = num1\r\n rem = num % den\r\n while rem != 0:\r\n num = den\r\n den = rem\r\n rem = num % den\r\n gcd = den\r\n lcm = int(int(num1 * num2) / int(gcd))\r\n return lcm\r\n\r\n\r\nn = int(input())\r\nM = list(map(int, input().split()))\r\nR = list(map(int, input().split()))\r\n\r\n\r\nlcm = -1\r\n\r\ntry:\r\n num1 = M[0]\r\n num2 = M[1]\r\n lcm = find_lcm(num1, num2)\r\n\r\n for i in range(2, len(M)):\r\n lcm = find_lcm(lcm, M[i])\r\n\r\nexcept:\r\n lcm = M[0]\r\n\r\ncnt = 0\r\ncnt2 = 0\r\n\r\nfor i in range(lcm):\r\n b = True\r\n for j in range(n):\r\n if i % M[j] == R[j]:\r\n b = False\r\n break\r\n if not b:\r\n cnt2 += 1\r\n\r\nprint(cnt2 / lcm)\r\n", "#!/usr/bin/python\nimport re\nimport inspect\nfrom sys import argv, exit\n\ndef rstr():\n return input()\n\ndef rint():\n return int(input())\n\ndef rints(splitchar=' '):\n return [int(i) for i in input().split(splitchar)]\n\ndef varnames(obj, namespace=globals()):\n return [name for name in namespace if namespace[name] is obj]\n\ndef pvar(var, override=False):\n prnt(varnames(var), var)\n\ndef prnt(args, override=False):\n if '-v' in argv or override:\n print(args)\n\nif __name__ == '__main__':\n n = rint()\n M = rints()\n R = rints()\n prnt(n,M,R)\n\n done = 0\n\n totaldays = 100000\n\n day = 0\n while day < totaldays:\n for m,r in zip(M, R):\n if day % m == r:\n done += 1\n break\n day += 1\n\n pvar(done)\n print(done/totaldays)\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nalx=111111\r\ncnt=0\r\nfor i in range(alx+1):\r\n\tfor j in range(n):\r\n\t\tif i%a[j]==b[j]:\t\r\n\t\t\tcnt+=1\r\n\t\t\tbreak\r\nprint(round(cnt/alx, 6))", "n = int(input())\r\nm = list(map(int, input().split()))\r\nr = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in range(1, 1000001):\r\n for j in range(n):\r\n if i % m[j] == r[j]:\r\n cnt += 1\r\n break\r\n\r\nans = cnt / 1000000.0\r\nprint(\"%.6f\" % ans)\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\nr = list(map(int, input().split()))\r\ndays = 0\r\nfor i in range(pow(2, 17)):\r\n for j in range(n):\r\n if i % m[j] == r[j]:\r\n days += 1\r\n break\r\nprint(days / pow(2, 17))\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\nr = list(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 a > b:\r\n return gcd(a % b, b)\r\n else:\r\n return gcd(b % a, a)\r\n\r\n\r\nd = 1\r\nfor i in range(n):\r\n d = d * m[i] // gcd(d, m[i])\r\n\r\nc = 0\r\nfor j in range(1, d + 1):\r\n for i in range(n):\r\n if j % m[i] == r[i]:\r\n c += 1\r\n break\r\n\r\nprint(c / d)\r\n" ]	{"inputs": ["1\n2\n0", "2\n2 3\n1 0", "3\n2 4 4\n0 1 3", "1\n16\n15", "16\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15", "16\n5 6 9 13 13 15 9 10 2 6 10 11 12 7 4 8\n4 3 3 5 8 3 6 5 1 4 2 6 7 4 0 1", "8\n15 3 7 11 14 10 16 2\n0 2 1 4 0 0 13 1", "1\n7\n5", "9\n6 12 3 10 15 14 6 9 3\n5 2 0 6 1 1 2 2 2", "3\n9 12 6\n0 5 0", "5\n3 3 13 5 10\n1 0 1 4 2", "7\n3 15 11 4 12 15 12\n2 9 3 0 9 13 6", "2\n13 3\n6 0", "9\n15 9 7 4 14 14 2 11 13\n2 6 2 3 11 12 0 3 3", "1\n15\n1", "1\n6\n3", "4\n3 8 9 4\n1 6 7 3", "7\n15 9 9 2 6 8 3\n10 2 7 1 3 2 0", "10\n9 8 7 7 16 3 10 13 5 6\n2 0 0 4 1 0 3 12 1 5", "4\n10 15 2 9\n8 14 0 0", "12\n5 16 12 3 10 15 11 14 2 3 4 11\n3 14 1 0 7 9 10 12 1 2 2 6", "5\n16 6 4 15 2\n13 3 0 13 0", "14\n12 11 7 12 2 4 14 10 7 4 15 3 5 16\n2 8 0 9 0 1 4 0 5 3 11 1 0 6", "12\n8 5 5 12 12 14 14 16 5 11 9 3\n1 4 0 11 10 0 2 3 1 8 8 2", "10\n3 16 16 9 5 16 9 7 8 2\n0 1 7 2 1 9 0 4 4 1", "9\n14 14 5 8 16 2 11 7 11\n9 7 0 2 7 1 10 2 4", "7\n13 12 4 2 7 13 8\n4 6 0 0 3 9 3", "5\n4 15 9 16 6\n3 9 8 14 1", "3\n16 13 3\n11 5 1", "7\n10 15 9 5 9 15 16\n2 7 2 4 0 12 13", "10\n16 10 16 15 12 5 4 9 3 10\n9 0 1 2 9 4 1 8 0 8", "14\n14 8 6 12 13 15 2 3 16 15 15 15 16 8\n10 0 5 6 1 7 0 2 1 4 2 11 14 2", "2\n10 14\n2 5", "10\n2 15 15 4 3 10 8 14 12 12\n1 8 13 0 0 6 4 2 4 5", "3\n6 14 7\n4 2 0", "13\n3 4 16 11 12 13 12 12 3 16 8 13 4\n0 1 14 5 8 5 11 7 1 6 4 1 0"], "outputs": ["0.500000", "0.666667", "1.000000", "0.062500", "1.000000", "0.959707", "0.826840", "0.142857", "0.752381", "0.305556", "0.784615", "0.757576", "0.384615", "0.876790", "0.066667", "0.166667", "0.583333", "0.850000", "0.832418", "0.588889", "0.953247", "0.737500", "1.000000", "0.859307", "0.857143", "0.789610", "0.728022", "0.518056", "0.423077", "0.543056", "0.811111", "0.784615", "0.171429", "0.914286", "0.333333", "0.967949"]}	UNKNOWN	PYTHON3	CODEFORCES	25
8bfbb4d2c2d479b59b4a5cb61941820d	Hide-and-Seek	Victor and Peter are playing hide-and-seek. Peter has hidden, and Victor is to find him. In the room where they are playing, there is only one non-transparent wall and one double-sided mirror. Victor and Peter are points with coordinates (xv,<=yv) and (xp,<=yp) respectively. The wall is a segment joining points with coordinates (xw,<=1,<=yw,<=1) and (xw,<=2,<=yw,<=2), the mirror — a segment joining points (xm,<=1,<=ym,<=1) and (xm,<=2,<=ym,<=2). If an obstacle has a common point with a line of vision, it's considered, that the boys can't see each other with this line of vision. If the mirror has a common point with the line of vision, it's considered, that the boys can see each other in the mirror, i.e. reflection takes place. The reflection process is governed by laws of physics — the angle of incidence is equal to the angle of reflection. The incident ray is in the same half-plane as the reflected ray, relative to the mirror. I.e. to see each other Victor and Peter should be to the same side of the line, containing the mirror (see example 1). If the line of vision is parallel to the mirror, reflection doesn't take place, and the mirror isn't regarded as an obstacle (see example 4). Victor got interested if he can see Peter, while standing at the same spot. Help him solve this problem. The first line contains two numbers xv and yv — coordinates of Victor. The second line contains two numbers xp and yp — coordinates of Peter. The third line contains 4 numbers xw,<=1, yw,<=1, xw,<=2, yw,<=2 — coordinates of the wall. The forth line contains 4 numbers xm,<=1, ym,<=1, xm,<=2, ym,<=2 — coordinates of the mirror. All the coordinates are integer numbers, and don't exceed 104 in absolute value. It's guaranteed, that the segments don't have common points, Victor and Peter are not on any of the segments, coordinates of Victor and Peter aren't the same, the segments don't degenerate into points. Output YES, if Victor can see Peter without leaving the initial spot. Otherwise output NO. Sample Input -1 3 1 3 0 2 0 4 0 0 0 1 0 0 1 1 0 1 1 0 -100 -100 -101 -101 0 0 1 1 0 1 1 0 -1 1 1 3 0 0 10 0 100 100 101 101 1 0 3 0 Sample Output NO NO YES YES	[ "xv,yv=list(map(int,input().split()))\r\nxp,yp=list(map(int,input().split()))\r\nxw1,yw1,xw2,yw2=list(map(int,input().split()))\r\nxm1,ym1,xm2,ym2=list(map(int,input().split()))\r\ndef a(x1,y1,x2,y2,x3,y3,x4,y4):\r\n if x1==x2:\r\n if x3==x4:\r\n return False\r\n else:\r\n k2=(y3-y4)/(x3-x4)\r\n b2=y3-k2x3\r\n return min(y3,y4)<=k2x1+b2<=max(y3,y4) and min(y1,y2)<=k2x1+b2<=max(y1,y2) and min(x3,x4)<=x1<=max(x3,x4) and min(x1,x2)<=x1<=max(x1,x2)\r\n else:\r\n if x3==x4:\r\n k1=(y1-y2)/(x1-x2)\r\n b1=y1-k1x1\r\n return min(y3,y4)<=k1x3+b1<=max(y3,y4) and min(y1,y2)<=k1x3+b1<=max(y1,y2) and min(x3,x4)<=x3<=max(x3,x4) and min(x1,x2)<=x3<=max(x1,x2)\r\n else:\r\n k1=(y1-y2)/(x1-x2)\r\n b1=y1-k1x1\r\n k2=(y3-y4)/(x3-x4)\r\n b2=y3-k2x3\r\n if k1==k2:\r\n return b1==b2 and min(x1,x2)<=min(x3,x4)<=max(x1,x2) and min(y1,y2)<=min(y3,y4)<=max(y1,y2)\r\n x=(b2-b1)/(k1-k2)\r\n y=k1x+b1\r\n return min(y3,y4)<=y<=max(y3,y4) and min(y1,y2)<=y<=max(y1,y2) and min(x3,x4)<=x<=max(x3,x4) and min(x1,x2)<=x<=max(x1,x2)\r\ndef b(xm1,xm2,ym1,ym2,x,y):\r\n if ym1==ym2:\r\n xi=x\r\n yi=2ym1-y\r\n elif xm1==xm2:\r\n yi=y\r\n xi=2xm1-x\r\n else:\r\n k1=-(xm1-xm2)/(ym1-ym2)\r\n b1=y-k1x\r\n k2=(ym1-ym2)/(xm1-xm2)\r\n b2=ym1-k2xm1\r\n x1=(b2-b1)/(k1-k2)\r\n xi=2x1-x\r\n yi=k1*xi+b1\r\n return [xi,yi]\r\nxw3,yw3=b(xm1,xm2,ym1,ym2,xw1,yw1)\r\nxw4,yw4=b(xm1,xm2,ym1,ym2,xw2,yw2)\r\nif a(xv,yv,xp,yp,xw1,yw1,xw2,yw2) or a(xv,yv,xp,yp,xm1,ym1,xm2,ym2):\r\n xip,yip=b(xm1,xm2,ym1,ym2,xp,yp)\r\n if [xip,yip]!=[xv,yv] and a(xv,yv,xip,yip,xm1,ym1,xm2,ym2) and not(a(xv,yv,xip,yip,xw1,yw1,xw2,yw2)) and not(a(xv,yv,xip,yip,xw3,yw3,xw4,yw4)):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('YES')" ]	{"inputs": ["-1 3\n1 3\n0 2 0 4\n0 0 0 1", "0 0\n1 1\n0 1 1 0\n-100 -100 -101 -101", "0 0\n1 1\n0 1 1 0\n-1 1 1 3", "0 0\n10 0\n100 100 101 101\n1 0 3 0", "0 0\n1 1\n100 100 101 101\n-100 -100 -101 -101", "-1 1\n1 1\n0 3 0 4\n0 0 0 2", "0 0\n2 0\n1 1 1 -1\n0 2 1 2", "0 0\n2 0\n1 1 1 -1\n-10 2 -12 2", "0 0\n2 0\n0 2 2 2\n1 1 1 -1", "0 0\n2 0\n0 2 2 2\n1 0 1 -1", "0 0\n2 0\n0 2 2 2\n1 1 1 0", "0 0\n3 0\n0 2 2 2\n1 0 2 0", "0 0\n3 0\n1 0 2 0\n0 2 2 2", "0 0\n3 0\n1 0 2 0\n-10 2 -12 2", "0 0\n5 0\n1 0 2 0\n3 0 4 0", "0 0\n10 0\n0 1 10 1\n1 0 9 0", "0 0\n2 0\n1 1 1 -1\n0 2 2 2", "0 0\n2 0\n1 1 1 -1\n1 2 2 2", "-1 2\n1 2\n0 2 0 4\n0 0 0 1", "-1 4\n1 4\n0 2 0 4\n0 0 0 1", "-1 5\n1 5\n0 2 0 4\n0 0 0 1", "-1 2\n1 2\n0 3 0 4\n0 0 0 2", "5023 -2243\n5648 1799\n1758 9228 -5815 3403\n-5967 -5718 -9900 -7956", "5498 9900\n7010 -7756\n-7598 8619 -7166 -3069\n-7486 -727 -9707 7115", "5974 2044\n8371 6409\n-675 4290 -8517 -9542\n-9005 4263 -9763 -8777", "2729 -5812\n9733 574\n9967 3682 -9868 3984\n9477 9254 2347 3997", "3205 -9947\n7374 -5260\n-3110 3073 5060 -2488\n7958 -5755 -7406 -816", "3680 2196\n8736 8904\n7532 2465 3709 -8961\n6439 -765 3053 3026", "4156 -5659\n-9903 3069\n-5545 1857 2358 4566\n4920 4225 5236 7868", "4632 -9795\n7738 -6486\n1377 1248 1007 -1906\n3402 9216 250 6991", "5108 2348\n9100 7679\n-7980 640 -4064 -8379\n1883 -5793 9041 8957", "509 -7077\n1396 9890\n1192 2964 -1072 -8932\n-3260 -6877 -1781 1603", "9060 4628\n5720 -2370\n-1791 9325 1552 -3684\n-161 -4597 2287 -3890", "-2389 53\n-9955 5368\n-4775 -593 7898 -2157\n6659 1403 9634 -3275", "6161 -4520\n-5630 -3171\n-7760 9489 -9477 -630\n9758 7404 -4730 -8056", "-5289 7185\n-5026 4568\n9256 -429 -3131 4617\n-7143 -6595 -5505 -370", "3261 2610\n-701 -7693\n6272 9652 -506 6144\n-322 -4315 -1436 -2142", "-8188 -5684\n3623 46\n3288 -265 5839 7672\n2776 1685 2632 -7636", "362 9742\n7948 7786\n303 6095 -7816 9199\n5875 7686 6702 6871", "-7366 1446\n-7727 -754\n-2680 -3822 -5191 -5553\n-7304 -6313 -9229 1377", "1184 -3127\n-7123 6985\n-1943 6259 1154 -4026\n-4205 -4033 -5160 -4115", "-4496 6192\n-8443 7736\n2227 9746 -7197 6992\n-4002 -6638 7315 -9557", "-3802 -741\n-9954 6119\n-1364 -1523 -8659 2791\n6451 -4606 -7143 2288", "-3107 -7674\n4815 780\n-4957 3486 1980 -2625\n-432 -4075 -9497 -171", "1307 5392\n3305 -837\n-8550 -7782 5287 1042\n-2922 -287 8944 3865", "2001 2179\n-1925 -2455\n7858 948 71 2256\n4850 9947 1159 2295", "2696 -4753\n-3435 -7793\n4265 5958 -3218 -8692\n4458 4449 4175 1539", "7111 8313\n-4946 -9411\n672 -5310 -7733 -1889\n378 8589 -915 7675", "7806 5101\n9823 8971\n-6640 -300 9044 7390\n-2297 -3829 7806 2982", "-7779 -1832\n8313 7354\n9767 8430 -8438 -3487\n3855 4077 1085 -5181", "-7086 -8767\n6803 2015\n6175 -6560 3372 573\n256 3769 393 9678", "6777 -4260\n1717 5583\n3262 248 5800 1524\n9267 -7380 8541 5269", "3336 -9832\n-9350 -9113\n-939 3907 -3643 -9931\n8186 6365 6202 6802", "-6319 2768\n-431 5862\n-5417 8036 -5331 3150\n2385 -1888 3450 7359", "-7267 -975\n-7760 5217\n-9341 -5054 -7370 3072\n-4926 1220 7603 -1721", "9293 -6547\n4895 -9479\n2738 -1395 8489 -8324\n3540 -4860 -8555 1675", "5851 7882\n-6171 -4174\n-1463 5985 4956 -8663\n6370 -9777 -864 9154", "-1311 2310\n2764 1131\n-1964 -5465 -199 2630\n-5664 9644 9110 2262", "-4752 -3262\n-4582 6436\n-8997 -6490 -4630 1426\n-9865 -6697 -2371 -5622", "-8193 -8833\n4353 -8260\n2214 683 -8074 -8978\n5548 -850 -1486 -8372", "4646 5596\n-2993 766\n2443 -3831 3479 5022\n-1987 4342 9668 7192", "1772 9009\n-8123 3429\n-1873 9437 -2887 -997\n8018 -9250 -5090 -9980", "97 -43\n7213 -4204\n5460 -8068 4212 -2411\n9853 -8477 7807 6052", "-823 -3132\n-1924 -8397\n3277 5496 -1772 -6699\n-5322 -4634 922 182", "7880 -7342\n1175 7552\n-6177 6690 6086 -2763\n6149 -2325 8602 -8496", "-3417 8449\n7996 3499\n3163 7949 5262 4575\n1340 -17 -3934 8703", "5286 518\n-8906 -4274\n-2162 1352 -751 -3408\n-3469 2291 -9521 -462", "-1541 -7140\n-3434 7016\n-831 6470 -4500 2354\n-5503 -553 -5998 6361", "-3234 2278\n-1683 1276\n-8143 -2879 -903 2275\n9053 -2468 7486 6408", "-8607 4167\n4114 -152\n3668 -1725 -7827 4541\n-5338 9216 880 9081", "-1971 -1636\n8799 -5185\n2406 2302 1967 -7166\n-4122 5320 7348 337", "-1541 -7140\n-3434 7016\n-831 6470 -7233 -5530\n-5503 -553 -5998 6361", "-9867 3736\n2889 5086\n2601 -5285 -8930 4748\n-3752 511 3554 1104", "3874 -278\n-8905 -3524\n-1544 -3249 4063 -111\n-59 1361 7173 -847", "5567 -9695\n5625 2216\n1965 -7804 8129 -7554\n1665 -446 5340 7652", "-8240 -4453\n8478 -878\n7033 7520 -1002 -3146\n-9913 8035 -9876 -8757", "866 4303\n-2945 -7242\n-8638 4653 -1155 -7439\n-950 -5491 2786 3812", "1462 5132\n-8664 2428\n175 -8258 -9863 8483\n-5685 3527 1556 5387", "866 4303\n-2945 -7242\n-8638 4653 -1155 -7439\n-950 -5491 2786 3812", "-8836 -5283\n-5804 9454\n-4442 76 -9550 -986\n-5178 -982 -7763 -7108"], "outputs": ["NO", "NO", "YES", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO"]}	UNKNOWN	PYTHON3	CODEFORCES	1
8c0044cad84ef54874eff46f8f5fe656	Sonya and Matrix	Since Sonya has just learned the basics of matrices, she decided to play with them a little bit. Sonya imagined a new type of matrices that she called rhombic matrices. These matrices have exactly one zero, while all other cells have the Manhattan distance to the cell containing the zero. The cells with equal numbers have the form of a rhombus, that is why Sonya called this type so. The Manhattan distance between two cells ($x_1$, $y_1$) and ($x_2$, $y_2$) is defined as $\|x_1 - x_2\| + \|y_1 - y_2\|$. For example, the Manhattan distance between the cells $(5, 2)$ and $(7, 1)$ equals to $\|5-7\|+\|2-1\|=3$. Note that rhombic matrices are uniquely defined by $n$, $m$, and the coordinates of the cell containing the zero. She drew a $n\times m$ rhombic matrix. She believes that you can not recreate the matrix if she gives you only the elements of this matrix in some arbitrary order (i.e., the sequence of $n\cdot m$ numbers). Note that Sonya will not give you $n$ and $m$, so only the sequence of numbers in this matrix will be at your disposal. Write a program that finds such an $n\times m$ rhombic matrix whose elements are the same as the elements in the sequence in some order. The first line contains a single integer $t$ ($1\leq t\leq 10^6$) — the number of cells in the matrix. The second line contains $t$ integers $a_1, a_2, \ldots, a_t$ ($0\leq a_i< t$) — the values in the cells in arbitrary order. In the first line, print two positive integers $n$ and $m$ ($n \times m = t$) — the size of the matrix. In the second line, print two integers $x$ and $y$ ($1\leq x\leq n$, $1\leq y\leq m$) — the row number and the column number where the cell with $0$ is located. If there are multiple possible answers, print any of them. If there is no solution, print the single integer $-1$. Sample Input 20 1 0 2 3 5 3 2 1 3 2 3 1 4 2 1 4 2 3 2 4 18 2 2 3 2 4 3 3 3 0 2 4 2 1 3 2 1 1 1 6 2 1 0 2 1 2 Sample Output 4 5 2 2 3 6 2 3 -1	[ "import collections\ndd = lambda: collections.defaultdict(int)\n\nt = int(input())\ncnt = [0] * t\nfor i in map(int, input().split()):\n cnt[i] += 1\n\nds = [c - 2 * b + a for a, b, c in zip([0, 0] + cnt, [0] + cnt + [0], cnt + [0, 0])]\nds[0] -= 1; ds[1] -= 2; ds[2] -= 1;\n\ndef bop(D):\n while D:\n i = min(D)\n if D[i]:\n D[i] += 1\n D[i+1] += 1\n return i\n else:\n del D[i]\n return 420\n\ndef f(D, x = [], y = []):\n if len(D) > 12 or max(len(x), len(y)) > 2: return\n if len(x) == len(y) == 2: yield x + y\n\n a = bop(D)\n\n E = D.copy()\n for i in y: E[a+i] -= 1\n yield from f(E, x + [a], y)\n\n E = D.copy()\n for i in x: E[i+a] -= 1\n yield from f(E, x, y + [a])\n\ndef gen(s):\n D = dd()\n for i in s:\n D[i] -= 1\n D[i+1] -= 1\n for i in s[:2]:\n for j in s[2:]:\n D[i+j] += 1\n return {i: v for i, v in D.items() if v}\n\nD = dd() \| {i: v for i, v in enumerate(ds) if v}\nfor s in f(D.copy()):\n if gen(s) == D:\n a, b, c, d = s\n print(a + b - 1, c + d - 1)\n print(a, c)\n break\nelse:\n print(-1)\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef test(n, m, x, y, d):\r\n d2 = [0 for i in range(len(d))]\r\n for i in range(n):\r\n for j in range(m):\r\n D = abs(i-x)+abs(j-y)\r\n if D >= len(d2):\r\n return False\r\n d2[D]+=1\r\n return d==d2\r\n \r\ndef process(A):\r\n t = len(A)\r\n if t==1 and A==[0]:\r\n return [1, 1, 1, 1]\r\n M = max(A)\r\n d = [0 for i in range(M+1)]\r\n for x in A:\r\n d[x]+=1\r\n if d[0] != 1:\r\n return [-1, None, None, None]\r\n first_fail = None\r\n for i in range(1, M+1):\r\n if d[i] != 4i:\r\n first_fail = i\r\n break\r\n if first_fail is None:\r\n return [-1, None, None, None]\r\n x = first_fail-1\r\n #closest distance of (a, b) to an edge\r\n #is uh first_fail-1\r\n #(n, m, x, y)\r\n #I think we can flip around so farthest corner is at (0, m-1)\r\n #so n-1-x+m-1-y = M\r\n #y = x+m-1-M\r\n #m-y = M-x+1\r\n #and uh\r\n #nm = t\r\n for m in range(1, t+1):\r\n if t % m==0:\r\n n = t//m\r\n y = n-1-x+m-1-M\r\n if 0 <= x <= n-1 and 0 <= y <= m-1 and M == max(\r\n abs(x)+abs(y), abs(x)+abs(m-1-y), abs(n-1-x)+abs(y), abs(n-1-x)+abs(m-1-y)):\r\n if test(n, m, x, y, d):\r\n return [n, m, x+1, y+1]\r\n return [-1, None, None, None]\r\n \r\n \r\nt = int(input())\r\nA = [int(x) for x in input().split()]\r\nn, m, x, y = process(A)\r\nif n==-1:\r\n print('-1')\r\nelse:\r\n print(f'{n} {m}')\r\n print(f'{x} {y}')" ]	{"inputs": ["20\n1 0 2 3 5 3 2 1 3 2 3 1 4 2 1 4 2 3 2 4", "18\n2 2 3 2 4 3 3 3 0 2 4 2 1 3 2 1 1 1", "6\n2 1 0 2 1 2", "1\n0", "7\n0 1 2 3 4 2 6", "6\n0 0 0 0 0 0", "4\n0 0 0 0"], "outputs": ["4 5\n2 2", "3 6\n2 3", "-1", "1 1\n1 1", "-1", "-1", "-1"]}	UNKNOWN	PYTHON3	CODEFORCES	2
8c3e4d39eb3fa9adae0ac0d73286f72e	none	Oleg writes down the history of the days he lived. For each day he decides if it was good or bad. Oleg calls a non-empty sequence of days a zebra, if it starts with a bad day, ends with a bad day, and good and bad days are alternating in it. Let us denote bad days as 0 and good days as 1. Then, for example, sequences of days 0, 010, 01010 are zebras, while sequences 1, 0110, 0101 are not. Oleg tells you the story of days he lived in chronological order in form of string consisting of 0 and 1. Now you are interested if it is possible to divide Oleg's life history into several subsequences, each of which is a zebra, and the way it can be done. Each day must belong to exactly one of the subsequences. For each of the subsequences, days forming it must be ordered chronologically. Note that subsequence does not have to be a group of consecutive days. In the only line of input data there is a non-empty string s consisting of characters 0 and 1, which describes the history of Oleg's life. Its length (denoted as \|s\|) does not exceed 200<=000 characters. If there is a way to divide history into zebra subsequences, in the first line of output you should print an integer k (1<=≤<=k<=≤<=\|s\|), the resulting number of subsequences. In the i-th of following k lines first print the integer li (1<=≤<=li<=≤<=\|s\|), which is the length of the i-th subsequence, and then li indices of days forming the subsequence. Indices must follow in ascending order. Days are numbered starting from 1. Each index from 1 to n must belong to exactly one subsequence. If there is no way to divide day history into zebra subsequences, print -1. Subsequences may be printed in any order. If there are several solutions, you may print any of them. You do not have to minimize nor maximize the value of k. Sample Input 0010100 111 Sample Output 3 3 1 3 4 3 2 5 6 1 7 -1	[ "# Codeforces Submission\n# User : sudoSieg\n# Time : 14:50:08\n# Date : 21/10/2020\n\nimport io\nimport os\n#input = lambda: io.BytesIO(os.read(0, os.fstat(0).st_size)).readline().strip()\nvalid = True\ns = input()\nze = []\noe = []\n\nfor i, j in enumerate(s):\n if j == '0':\n if len(oe) != 0:\n x = oe.pop()\n x.append(i + 1)\n ze.append(x)\n else:\n ze.append([i + 1])\n else:\n if len(ze) != 0:\n x = ze.pop()\n x.append(i + 1)\n oe.append(x)\n else:\n print(\"-1\")\n exit()\nif len(oe) != 0:\n print(-1)\nelse:\n print(len(ze))\n for i in ze:\n print(len(i), end=' ')\n print(i)\n", "s = input()\r\no = -1\r\nsol=[]\r\np = True\r\nfor i in range(0,len(s)):\r\n if s[i]=='0':\r\n if o == -1:\r\n sol.append([i+1])\r\n else:\r\n sol[o].append(i+1)\r\n o-=1\r\n else:\r\n o+=1\r\n if o == len(sol):\r\n p = False\r\n break\r\n else:\r\n sol[o].append(i+1)\r\nif p==False or o !=-1:\r\n print(\"-1\")\r\nelse:\r\n print(len(sol))\r\n print(\"\\n\".join([str(len(sub)) + \" \" + \" \".join(map(str, sub)) for sub in sol]))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\na = []\r\nb = []\r\nfor i, j in enumerate(s):\r\n if j == '0':\r\n if len(b):\r\n x = b.pop()\r\n x.append(i+1)\r\n a.append(x)\r\n else:\r\n a.append([i+1])\r\n else:\r\n if len(a):\r\n x = a.pop()\r\n x.append(i+1)\r\n b.append(x)\r\n else:\r\n print(-1)\r\n exit()\r\nif len(b):\r\n print(-1)\r\nelse:\r\n print(len(a))\r\n for i in a:\r\n print(len(i), ' '.join(map(str, i)))", "# A. Zebras\r\n\r\nfrom collections import deque\r\n# Deque (Doubly Ended Queue) en Python. \r\n# Deque es preferible a una lista en los casos en los que necesitamos operaciones de adición y \r\n# extracción más rápidas desde ambos extremos (lef and right), ya que deque tiene complejidad de tiempo O(1) \r\n# para las operaciones de adición y extracción en comparación con la lista que tiene O(n).\r\n# append():- inserta un elemento en el extremo derecho de la deque (equivalente a un enqueue).\r\n# popleft():- saca un elemento en el extrermo izquierdo de la dequ (equivalente a un dequeue).\r\ns = input() # se lee la cadena s de entrada que representa la historia de Olaf. \r\n\r\nalmost_zebra = deque() # cola que va guardando las secuencias zebras\r\nzebra = deque() # cola que va guardando las secuencias que si se le agrega un '0' se convierten en zebras\r\n\r\n\r\n\r\nfor index,c in enumerate(s): # se itera por cada caracter de la cadena\r\n # El método enumerate() agrega un contador a un iterable y lo devuelve en forma de objeto de enumeración. \r\n # Este objeto enumerado puede usarse directamente para ciclos o convertirse en una lista de tuplas usando el método list()\r\n if c =='1': # Si el próximo caracter de la secuencia es un '1' \r\n if not zebra: # if la cola donde estan las secuencias zebra esta vacia no es posible dividir el string en subsequencias de zebra\r\n break # se rompe el ciclo pues ya no es necesario seguir revisando\r\n else: # sino es porque hay al menos una secuencia en zebra\r\n old_zebra = zebra.popleft() # se saca de la cola la proxima secuencia de zebra\r\n old_zebra.append(index+1) # se agrega la posicion del '1' a la secuencia los dias de la historia de Olaf se numeran a partir de 1 por se se pone index + 1\r\n # Al agregar '1' a alguna zebra pasa a covertirese en almost zebra '010' + '1' -> '0101'\r\n almost_zebra.append(old_zebra) # se agrega la secuencia a la cola almost zebra\r\n\r\n else: # en caso contrario es porque es un '0'\r\n if almost_zebra: # si la cola almost_zebra no esta vacia\r\n old_almost_zebra = almost_zebra.popleft() # saca la proxima secuencia de la cola\r\n old_almost_zebra.append(index+1) # se agrega la posicion correspondiente al '0' a la secuencia los dias de la historia de Olaf se numeran a partir de 1 por se se pone index + 1\r\n zebra.append(old_almost_zebra) # se agrega la secuencia a la cola de zebra pues una casi zebra termina en '1' y al agregarlo un '0' pasa a ser una zebra.\r\n else: # en caso contrario no hay secuencias en la cola almost_zebra por tanto se forma una secuencia ['0'] que tambien es una zebra\r\n zebra.append([index+1]) # se agrega la posion del '0' a la secuencia y luego se agrega la secuencia a la cola zebra\r\n\r\nif not zebra or almost_zebra: # si no hay elementos en la cola zebra o quedan elementos en la cola almost zebra es porque no es posible dividir la cadena en zebra y almost zebra\r\n print(-1) # se imprime en consola -1 pues no se puede dividir la historia de Olaf en zebras\r\nelse: # en caso contrario se encontro una forma de subdivir la historia olaf en zebras\r\n print(len(zebra)) # se imprima la cantidad de subsecuencias que subdividen la historia e olaf en zebras\r\n for z in zebra: # se itera por cada subsecuencia zebra\r\n temp = [str(i) for i in z] # se convierte a string cada intero de la subsecuencia que representa la posicion de los elementos en la cadena que forman la misma\r\n print(len(temp), \" \".join(temp)) # se imprime por cada subecuencia zebra su longitud y cada uno de sus elementos separados por espacio (el join es muy comodo para hacer eso)\r\n", "# A. Zebras\r\n\r\nfrom collections import deque\r\n\r\n\r\ns = input() # input string\r\n\r\nalmost_zebra = deque() # store almost zebra sequences\r\nzebra = deque() # store zebra sequences\r\n\r\n\r\n\r\nfor index,c in enumerate(s): # iterate through string\r\n if c =='1': # if c is 1\r\n if not zebra: # if zebra is empty no es posible dividir el string en subsequencias de zebra\r\n break\r\n else:\r\n old_zebra = zebra.popleft() # hazle pop al the zebra \r\n old_zebra.append(index+1) # append index+1 to zebra sequence corresponding to '1'\r\n # Al agregar '1' a alguna zebra pasa a covertirese en almost zebra\r\n almost_zebra.append(old_zebra) # agrega zebra a almost zebra\r\n\r\n else:\r\n if almost_zebra: # if almost zebra is not empty\r\n old_almost_zebra = almost_zebra.popleft() # hazle pop al the almost zebra\r\n old_almost_zebra.append(index+1) # append index+1 to almost zebra sequence corresponding to '0'\r\n zebra.append(old_almost_zebra) # agrega almost zebra a zebra\r\n else:\r\n zebra.append([index+1]) # if almost zebra is empty, add index+1 to zebra sequence corresponding to '0'\r\n\r\nif not zebra or almost_zebra: # if zebra is empty or almost zebra is not empty es porque no es posible dividir la cadena en zebra y almost zebra\r\n print(-1)\r\nelse:\r\n print(len(zebra)) # print len(zebra)\r\n for z in zebra: # iterate through zebra\r\n temp = [str(i) for i in z]\r\n print(len(temp), \" \".join(temp)) #\r\n", "\n\"\"\"\nrefer： https://blog.csdn.net/xiaoxiede_wo/article/details/79625689\n\"\"\"\n\n# from sortedcontainers import SortedList\nimport sys\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\nprintf = lambda d: sys.stdout.write(str(d) + \"\\n\")\n\ns = input()\n\nres = [[] for _ in range(len(s))]\nr = 0 # cur row， point for insert 0\nk = 0 # max row\nfor i, v in enumerate(s):\n if v == \"0\":\n res[r].append(i+1)\n r += 1\n else:\n if r == 0:\n print(\"-1\")\n exit(0)\n r -= 1 # insert 1 for last row\n res[r].append(i+1) # r point at insert 0\n k = max(k, r) # max row\n # print(i, r, res)\n\nif k != r:\n print(\"-1\")\n exit(0)\nelse:\n print(k)\n for r in res[:k]:\n r = [str(i) for i in r]\n print(len(r), \" \".join(r))\n", "s = input()\r\narr, zero, one = [], [], []\r\nfor i in range(len(s)):\r\n if s[i] == '0':\r\n if one:\r\n idx = one.pop()\r\n arr[idx].append(i + 1)\r\n zero.append(idx)\r\n else:\r\n zero.append(len(arr))\r\n arr.append([i + 1])\r\n else:\r\n if not zero:break\r\n idx = zero.pop()\r\n one.append(idx)\r\n arr[idx].append(i + 1)\r\nif arr and zero and not one:\r\n print(len(arr))\r\n for x in zero:\r\n print(len(arr[x]), end=' ')\r\n print(arr[x])\r\nelse:print(-1)", "import sys\r\nimport bisect\r\n#input=sys.stdin.readline\r\n#t=int(input())\r\nt=1\r\nmod=10*9+7\r\nfor _ in range(t):\r\n #n=int(input())\r\n #n,m=map(int,input().split())\r\n s=input()\r\n #l=list(map(int,input().split()))\r\n #pref=[[0 for j in range(3001)] for i in range(n+2)]\r\n d={}\r\n for i in range(len(s)+1):\r\n d[i]=[]\r\n z=[]\r\n nz=[]\r\n l3=[]\r\n upto=1\r\n for i in range(len(s)):\r\n ch=1\r\n if s[i]=='0':\r\n if len(nz)>0:\r\n index=nz.pop()\r\n d[index].append(i+1)\r\n z.append(index)\r\n else:\r\n z.append(upto)\r\n d[upto].append(i+1)\r\n upto+=1\r\n else:\r\n if len(z)>0:\r\n index=z.pop()\r\n d[index].append(i+1)\r\n nz.append(index)\r\n else:\r\n ch=0\r\n break\r\n if ch==0:\r\n break\r\n #print(d) \r\n if ch==0 or len(nz)>0:\r\n print(-1)\r\n else:\r\n print(upto-1)\r\n for i in range(1,upto):\r\n print(len(d[i]),d[i]) \r\n \r\n ", "s = input()\r\none = -1\r\nans=[]\r\np = True\r\nfor i in range(0,len(s)):\r\n if s[i]=='0':\r\n if one == -1:\r\n ans.append([i+1])\r\n else:\r\n ans[one].append(i+1)\r\n one-=1\r\n else:\r\n one+=1\r\n if one == len(ans):\r\n p = False\r\n break\r\n else:\r\n ans[one].append(i+1)\r\n #print(ans)\r\nif p==False or one !=-1:\r\n print(\"-1\")\r\nelse:\r\n print(len(ans))\r\n print(\"\\n\".join([str(len(sub)) + \" \" + \" \".join(map(str, sub)) for sub in ans]))", "import sys\n\ndef solve(days):\n zebras = []\n azebras = []\n\n for i in range(len(days)):\n if days[i] == 1:\n if not zebras:\n return (False, [])\n seq = zebras.pop()\n seq.append(i)\n azebras.append(seq)\n else:\n if not azebras:\n zebras.append([i])\n else:\n seq = azebras.pop()\n seq.append(i)\n zebras.append(seq)\n \n if azebras:\n return (False, [])\n\n return (True, zebras)\n\n\ndef main():\n days = [int(i) for i in sys.stdin.readline().strip()]\n ok, seqs = solve(days)\n\n if not ok:\n print(-1)\n else:\n print(len(seqs))\n for seq in seqs:\n print(len(seq), \" \".join([str(i+1) for i in seq]))\n\n\nif __name__ == '__main__':\n main()\n", "def read_int():\n return int(input())\n\ndef read_str():\n return input()\n\ndef read_list(t=int):\n return list(map(t, input().split()))\n\ndef print_list(x):\n print(len(x), ' '.join(map(str, x)))\n\n# ------------------------------\n\ndef work(seqs):\n\tans = [[] for i in range(seqs)]\n\tsi = 0\n\tneed0 = deque(range(seqs))\n\tneed1 = deque([])\n\tfor i in range(len(s)):\n\t\tif s[i] == '0':\n\t\t\tif not len(need0):\n\t\t\t\treturn False\t\t\n\t\t\tsi = need0.popleft()\n\t\t\tneed1.append(si)\n\n\t\tif s[i] == '1':\n\t\t\tif not len(need1):\n\t\t\t\treturn False\t\n\t\t\tsi = need1.popleft()\n\t\t\tneed0.append(si)\n\t\tans[si].append(i+1)\n\treturn ans\n\n# ------------------------------\n\nfrom collections import deque\n\ns = read_str()\n\nseqs = s.count('0') - s.count('1')\n\nif seqs <= 0:\n\tprint(-1)\n\texit(0)\n\nans = work(seqs)\nif not work(seqs):\n\tprint(-1)\nelse:\n\tprint(seqs)\n\tfor seq in ans:\n\t\tprint_list(seq)", "s = input()\r\nres, p = [], -1\r\n\r\nfor i in range(len(s)):\r\n j = i + 1\r\n if s[i] == '0':\r\n if p > -1:\r\n res[p].append(j)\r\n p -= 1\r\n else:\r\n res.append([j])\r\n else:\r\n p += 1\r\n if p >= len(res):\r\n print(-1)\r\n exit()\r\n res[p].append(j) \r\n\r\nif p != -1:\r\n print(-1)\r\n exit() \r\n\r\nprint(len(res))\r\nfor x in res:\r\n print(len(x), x)\r\n", "import sys\r\n\r\ns = sys.stdin.readline().strip()\r\n\r\nq = [[], []]\r\n\r\nfor i, c in enumerate(s):\r\n k = int(c)\r\n if not q[1 - k]:\r\n if k == 1:\r\n sys.stdout.write('-1')\r\n sys.exit(0)\r\n q[k].append([i + 1])\r\n else:\r\n q[k].append(q[1 - k].pop())\r\n q[k][-1].append(i + 1)\r\n\r\nif q[1]:\r\n sys.stdout.write('-1')\r\nelse:\r\n ans = [str(len(q[0]))]\r\n for it in q[0]:\r\n ans.append(f'{len(it)} {\" \".join(map(str, it))}')\r\n sys.stdout.write('\\n'.join(ans))\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ns = input().strip()\r\nn = len(s)\r\nans = [[] for _ in range(200005)]\r\ncnt = 0; mx = 0\r\nfor i in range(n):\r\n if s[i] == '0':\r\n ans[cnt].append(i+1)\r\n cnt += 1\r\n else:\r\n cnt -= 1\r\n if cnt < 0: print(-1); quit()\r\n ans[cnt].append(i+1)\r\n mx = max(mx, cnt)\r\n\r\nif cnt != mx: print(-1); quit()\r\nprint(mx)\r\nfor i in range(mx):\r\n print(len(ans[i]), ans[i])\r\n \r\n# https://www.luogu.com.cn/blog/lfzyzs-qiuw/solution-cf949a", "import copy\r\nimport gc\r\nimport itertools\r\nfrom array import array\r\nfrom fractions import Fraction\r\nimport heapq\r\nimport math\r\nimport operator\r\nimport os, sys\r\nimport profile\r\nimport cProfile\r\nimport random\r\nimport re\r\nimport string\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import defaultdict, deque, Counter\r\nfrom functools import reduce, lru_cache\r\nfrom io import IOBase, BytesIO\r\nfrom itertools import count, groupby, accumulate, permutations, combinations_with_replacement, product\r\nfrom math import gcd\r\nfrom operator import xor, add\r\nfrom typing import List\r\n\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n# print = lambda d: sys.stdout.write(str(d)+\"\\n\")\r\ndef read_int_list(): return list(map(int, input().split()))\r\ndef read_int_tuple(): return tuple(map(int, input().split()))\r\ndef read_int(): return int(input())\r\n\r\n\r\n# endregion\r\n\r\n### CODE HERE\r\n\r\n# f = open('inputs', 'r')\r\n# def input(): return f.readline().rstrip(\"\\r\\n\")\r\n\r\ndef solve(s):\r\n zeros, ones = [], []\r\n for i, ch in enumerate(s, 1):\r\n if int(ch):\r\n if zeros:\r\n last_zero = zeros.pop()\r\n last_zero.append(i)\r\n ones.append(last_zero)\r\n else:\r\n print(-1)\r\n return\r\n else:\r\n if ones:\r\n last_one = ones.pop()\r\n last_one.append(i)\r\n zeros.append(last_one)\r\n else:\r\n zeros.append([i])\r\n\r\n # print(zeros, ones)\r\n if ones:\r\n print(-1)\r\n return\r\n\r\n print(len(zeros))\r\n for row in zeros:\r\n print(len(row), end=' ')\r\n print(row)\r\n\r\ndef main():\r\n solve(input())\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n# cProfile.run(\"main()\")\r\n", "s = input()\r\nv = []\r\nfor x in range (200000) :\r\n v.append([])\r\nidx = 0\r\npos = 0\r\nsz = 0\r\nfor x in s : \r\n if (x == '0') :\r\n v[idx].append(pos + 1)\r\n idx += 1\r\n else :\r\n if (idx == 0) :\r\n print(\"-1\")\r\n exit()\r\n idx -= 1\r\n v[idx].append(pos + 1)\r\n pos += 1\r\n sz = max(sz, idx)\r\nif (sz != idx) : \r\n print(\"-1\")\r\n exit()\r\nprint (idx)\r\nat = 0\r\nwhile (at < idx) : \r\n print (len(v[at]), end = \" \")\r\n att = 0\r\n for x in v[at] :\r\n print (x, end = \" \")\r\n at += 1\r\n print(\"\")", "\r\n\r\nfrom collections import deque\r\n\r\ndef zebras(s):\r\n\r\n zbs=[]\r\n alzbs=[]\r\n\r\n for i in range(n):\r\n if s[i]=='0':\r\n if not alzbs:\r\n zbs.append([i+1])\r\n else:\r\n tmp=alzbs.pop()\r\n tmp.append(i+1)\r\n zbs.append(tmp)\r\n\r\n else:\r\n if not zbs:\r\n return -1,None\r\n\r\n tmp=zbs.pop()\r\n tmp.append(i+1)\r\n alzbs.append(tmp)\r\n\r\n if alzbs:\r\n return -1,None\r\n\r\n return 1,zbs\r\n\r\n\r\n\r\ns=input()\r\nn=len(s)\r\nnum0=s.count('0')\r\nnum1=s.count('1')\r\n\r\nif num0-num1<1:\r\n print(-1)\r\nelse:\r\n res=zebras(s)\r\n if res[0]==-1:\r\n print(-1)\r\n else:\r\n print(len(res[1]))\r\n for x in res[1]:\r\n print(len(x),x)\r\n\r\n\r\n\r\n", "from collections import deque\r\ns=[int(el) for el in input()]\r\nones=[]\r\nzero=[]\r\ni=len(s)\r\nans=[-1](len(s)+1)\r\nt=0\r\nfor el in s[::-1]:\r\n if el==0:\r\n if ones:\r\n ans[i]=ones.pop()\r\n zero.append(ans[i])\r\n else:\r\n t+=1\r\n ans[i]=t\r\n zero.append(t)\r\n else:\r\n if zero:\r\n ans[i]=zero.pop()\r\n ones.append(ans[i])\r\n else:\r\n t+=1\r\n ans[i]=t\r\n ones.append(t)\r\n i-=1\r\np=[[] for _ in range(t+1)]\r\nfor i in range(len(s)):\r\n p[ans[i+1]].append(i+1)\r\nf=True\r\nfor el in p:\r\n if len(el) and (s[el[-1]-1]==1 or s[el[0]-1]==1) :\r\n f=False\r\nif f:\r\n print(t)\r\n for el in p[1:]:\r\n print(len(el),el)\r\nelse:\r\n \r\n print(-1)\r\n", "s = input()\na = []\ni = -1\nok = True\n\nfor j in range(len(s)):\n if s[j] == '1':\n i += 1\n if i == len(a):\n ok = False\n break\n else:\n a[i].append(j)\n if s[j] == '0':\n if i == -1:\n a.append([j])\n else:\n a[i].append(j)\n i -= 1\n\nif not ok or i != -1:\n print(-1)\nelse:\n print(len(a))\n for v in a:\n print(len(v), end = ' ')\n for x in v:\n print(x + 1, end = ' ')\n print()" ]	{"inputs": ["0010100", "111", "0", "1", "0101010101", "010100001", "000111000", "0101001000", "0000001000", "0101", "000101110", "010101010", "0101001010", "0100101100", "0110100000", "0000000000", "1111111111", "0010101100", "1010000", "0001110", "0000000000011001100011110101000101000010010111000100110110000011010011110110001100100001001001010010", "01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010", "0010011100000000"], "outputs": ["3\n1 1\n5 2 3 4 5 6\n1 7", "-1", "1\n1 1", "-1", "-1", "-1", "3\n3 1 6 7\n3 2 5 8\n3 3 4 9", "4\n5 1 2 3 4 5\n3 6 7 8\n1 9\n1 10", "8\n1 1\n1 2\n1 3\n1 4\n1 5\n3 6 7 8\n1 9\n1 10", "-1", "-1", "1\n9 1 2 3 4 5 6 7 8 9", "2\n5 1 2 3 4 5\n5 6 7 8 9 10", "2\n5 1 2 3 8 9\n5 4 5 6 7 10", "-1", "10\n1 1\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10", "-1", "2\n3 1 8 9\n7 2 3 4 5 6 7 10", "-1", "-1", "22\n1 1\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n7 9 24 25 26 27 28 29\n7 10 13 14 17 18 23 30\n11 11 12 15 16 19 22 31 32 33 34 35\n3 20 21 36\n3 37 46 47\n9 38 39 40 45 48 57 58 75 76\n17 41 42 43 44 49 50 51 54 55 56 59 72 73 74 77 80 81\n9 52 53 60 71 78 79 82 83 84\n7 61 64 65 66 67 70 85\n5 62 63 68 69 86\n3 87 88 89\n3 90 91 92\n5 93 94 95 96 97\n3 98 99 100", "1\n245 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 ...", "8\n3 1 8 9\n5 2 3 4 7 10\n3 5 6 11\n1 12\n1 13\n1 14\n1 15\n1 16"]}	UNKNOWN	PYTHON3	CODEFORCES	19
8c4a32fe0eb2f98ede0b2c62a4d73b97	Harmony Analysis	The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson until the teacher gave the group a simple task: find 4 vectors in 4-dimensional space, such that every coordinate of every vector is 1 or <=-<=1 and any two vectors are orthogonal. Just as a reminder, two vectors in n-dimensional space are considered to be orthogonal if and only if their scalar product is equal to zero, that is: Danil quickly managed to come up with the solution for this problem and the teacher noticed that the problem can be solved in a more general case for 2k vectors in 2k-dimensinoal space. When Danil came home, he quickly came up with the solution for this problem. Can you cope with it? The only line of the input contains a single integer k (0<=≤<=k<=≤<=9). Print 2k lines consisting of 2k characters each. The j-th character of the i-th line must be equal to '<=<=' if the j-th coordinate of the i-th vector is equal to <=-<=1, and must be equal to '<=+<=' if it's equal to <=+<=1. It's guaranteed that the answer always exists. If there are many correct answers, print any. Sample Input 2 Sample Output ++* ++ ++++ +**+	[ "p = [[0]]\r\nfor i in range(int(input())):\r\n p = [t + t for t in p] + [[1 - q for q in t] + t for t in p]\r\nfor t in p: print(''.join('+'[q] for q in t))", "from functools import reduce\nfrom operator import \nfrom math import \nfrom sys import \nfrom string import \nfrom collections import \nsetrecursionlimit(10*7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\ndef inv(x):\n s=\"\"\n for i in x:\n s+= \"+\"[i=='+']\n return s\nx=['+']\nn=RI()[0]\nfor i in range(n):\n t=[]\n for j in range(len(x)):\n t.append(x[j]+x[j])\n t.append(x[j]+inv(x[j]))\n x=t\nprint(x, sep='\\n')\n\n\n", "def invert(a):\r\n for i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j]==1:\r\n a[i][j]=0\r\n else:\r\n a[i][j]=1\r\n return a\r\nk=int(input())\r\na=[[1]]\r\nif k==0:\r\n print('+')\r\n exit()\r\nfor i in range(1,k+1):\r\n ans=[None](2i)\r\n ares=[]\r\n for j in a:\r\n ares1=[]\r\n for u in j:\r\n if u==1:\r\n ares1.append(1)\r\n else:\r\n ares1.append(0)\r\n ares.append(ares1)\r\n invert(ares)\r\n for j in range((2i)//2):\r\n ans[j]=a[j]+a[j]\r\n for j in range((2i)//2,2i):\r\n ans[j]=a[j-(2i)//2]+ares[j-(2i)//2]\r\n a=ans\r\nfor i in a:\r\n for j in i:\r\n if j==1:\r\n print('+',end='')\r\n else:\r\n print('',end='')\r\n print()\r\n", "# by the authority of GOD author: manhar singh sachdev #\r\n\r\nimport os,sys\r\nfrom io import BytesIO,IOBase\r\nfrom array import array\r\n\r\ndef main():\r\n k = int(input())\r\n if not k:\r\n print('+')\r\n exit()\r\n an = [array('i',[1,-1]),array('i',[1,1])]\r\n for _ in range(k-1):\r\n for j in range(len(an)):\r\n an[j] += an[j]\r\n for j in range(len(an)):\r\n an.append(an[j][:])\r\n for l in range(len(an[-1])//2):\r\n an[-1][l] = -1\r\n for i in an:\r\n print(''.join(map(lambda xx:'+'if xx==1 else '',i)))\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()", "def solve():\n K = int(input())\n\n e = [[\"++\", \"\"], [\"+\", \"+\"]]\n vs = [\"+\"]\n for i in range(K):\n nv = []\n for j in range(2):\n for v in vs:\n x = []\n for c in v:\n x.append(e[j][0] if c == '+' else e[j][1])\n nv.append(''.join(x))\n vs = nv\n\n for v in vs:\n print(v)\n\n\nif __name__ == '__main__':\n solve()\n", "n = int(input())\r\nans=[[1]]\r\nk=0\r\nwhile k<n:\r\n k+=1\r\n for i in range(len(ans)):\r\n ans[i].extend(ans[i]) \r\n for i in range(len(ans)):\r\n ans.append(ans[i][:])\r\n for i in range(int(len(ans)/2),len(ans)):\r\n for j in range(int(len(ans[i])/2),len(ans[i])):\r\n ans[i][j]=(-1)\r\n# print(ans)\r\nfor i in ans:\r\n for j in i:\r\n if j==-1:\r\n print('',end='')\r\n else:\r\n print('+',end='')\r\n print() \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\nk = int(input())\r\nx = [[43]]\r\nfor _ in range(k):\r\n l = len(x)\r\n for i in range(l):\r\n y = list(x[i])\r\n x.append(list(x[i]))\r\n for j in range(l):\r\n x[i].append(y[j])\r\n x[i + l].append(y[j] ^ 1)\r\nans = [\"\".join([chr(i) for i in y]) for y in x]\r\nsys.stdout.write(\"\\n\".join(ans))", "k = int(input())\r\n\r\na = [['' for _ in range(2 * k)] for _ in range(2 k)]\r\na[0][0] = '+'\r\n\r\nfor m in range(1, k+1):\r\n p = 2 (m - 1)\r\n for i in range(p):\r\n for j in range(p):\r\n a[p+i][j] = a[i][j]\r\n if i % 2 == 0:\r\n a[i][p+j] = '' if a[i][j] == '+' else '+'\r\n a[p+i][p+j] = a[i][j]\r\n else:\r\n a[i][p+j] = a[i][j]\r\n a[p+i][p+j] = '' if a[i][j] == '+' else '+'\r\n\r\nprint('\\n'.join(''.join(x) for x in a))", "import sys\ninput=sys.stdin.readline\ndef neg(a):\n b=\"\"\n for i in range(len(a)):\n if a[i]==\"+\":\n b+=\"\"\n else:\n b+=\"+\"\n return b\n \nn=int(input())\na=\"+\"\ne=[a]\nfor i in range(n):\n for j in range(2i):\n b=e[j]\n e[j]+=b\n e.append(b+neg(b))\nfor i in range(len(e)):\n print(e[i])\n \t \t\t\t \t \t \t \t \t \t\t\t\t \t\t\t", "k = int(input())\r\n\r\ndef reflect(matrix):\r\n temp = list(matrix)\r\n\r\n for i in range(len(matrix)):\r\n matrix[i] = list(matrix[i])\r\n\r\n temp.reverse()\r\n return temp\r\n\r\ndef invert(matrix):\r\n temp = list(matrix)\r\n\r\n for i in range(len(temp)):\r\n temp[i] = list(temp[i])\r\n\r\n for i in range(len(temp)):\r\n for j in range(len(temp[i])):\r\n temp[i][j] = not temp[i][j]\r\n\r\n return temp\r\n\r\nseed = [[True]]\r\n\r\nwhile k > 0:\r\n refl = reflect(seed)\r\n inve = invert(refl)\r\n\r\n seedlen = len(seed)\r\n invelen = len(inve)\r\n\r\n for i in range(seedlen):\r\n seed[i].extend(seed[i])\r\n\r\n for i in range(invelen):\r\n inve[i].extend(refl[i])\r\n\r\n seed.extend(inve)\r\n k -= 1\r\n\r\n\r\nline = ''\r\nfor i in range(len(seed)):\r\n for j in range(len(seed[i])):\r\n if seed[i][j] == True:\r\n line += '+'\r\n else:\r\n line += ''\r\n print(line)\r\n line = ''", "def solve(x):\r\n ans=[]\r\n for l in x:\r\n if l==\"+\":\r\n ans.append(\"\")\r\n elif l==\"\":\r\n ans.append(\"+\")\r\n return (\"\").join(ans)\r\n \r\nk=int(input())\r\nif k==0:\r\n print(\"+\")\r\nelse:\r\n m,s=[\"++\",\"+\"],1\r\n for i in range(k-1):\r\n m=2\r\n s=2\r\n for j in range(s):\r\n m[j]+=m[j]\r\n m[s+j]+=solve(m[s+j])\r\n for y in m:\r\n print(y)", "a=int(input())\r\ndef anti(s):\r\n s1=''\r\n for i in s:\r\n if i==\"+\":\r\n s1+=\"\"\r\n else:\r\n s1+=\"+\"\r\n return s1\r\n \r\ndef f(k):\r\n if k==0:\r\n return ['',]\r\n l=f(k-1)\r\n l2=[]\r\n for m in l:\r\n l2.append(m+m)\r\n l2.append(m+anti(m))\r\n return l2\r\n\r\nfor k in f(a):\r\n print(k)", "def vec(x):\r\n\tif x == 0:\r\n\t\treturn [[1]]\r\n\tx -= 1\r\n\ts = vec(x)\r\n\ty = vec(x)\r\n\tfor i in range(2x):\r\n\t\tfor j in range(2x):\r\n\t\t\ty[i][j] = -y[i][j]\r\n\ta = [s[i]+y[i] for i in range(2x)]\r\n\tb = [s[i]+s[i] for i in range(2x)]\r\n\treturn a + b\r\n\r\nx = int(input())\r\ns = vec(x)\r\nfor i in range(2x):\r\n\tres = ''\r\n\tfor j in range(2x):\r\n\t\tres += '+' if s[i][j] == 1 else ''\r\n\tprint(res)\r\n", "k = int(input())\n\ndef solve(k):\n if k==0:\n return [[1]]\n r=solve(k-1)\n res=[]\n for v in r:\n res.append(v+v)\n res.append(v+[x-1 for x in v])\n return res\n\nres = solve(k)\nfor v in res:\n s = \"\"\n for x in v:\n if x==1:\n s+=\"+\"\n else:\n s+=\"\"\n print(s)", "def minusv(L):\n\n return [-x for x in L]\n\n\n\ndef adamar(M):\n\n return [L2 for L in M] + [L + minusv(L) for L in M]\n\n\n\nk = int(input())\n\na = [[1]]\n\nfor i in range(k):\n\n a = adamar(a)\n\nfor L in a:\n\n print(''.join(['+' if c==1 else '' for c in L]))\n\n\n\n\n\n# Made By Mostafa_Khaled" ]	{"inputs": ["2", "1", "3", "0", "4", "5", "6", "7", "8", "9"], "outputs": ["++++\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++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*+...", "+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++..."]}	UNKNOWN	PYTHON3	CODEFORCES	15
8c79b8c1ac558a266dbe4c8f55ed51e7	Vasya and Beautiful Arrays	Vasya's got a birthday coming up and his mom decided to give him an array of positive integers a of length n. Vasya thinks that an array's beauty is the greatest common divisor of all its elements. His mom, of course, wants to give him as beautiful an array as possible (with largest possible beauty). Unfortunately, the shop has only one array a left. On the plus side, the seller said that he could decrease some numbers in the array (no more than by k for each number). The seller can obtain array b from array a if the following conditions hold: bi<=><=0; 0<=≤<=ai<=-<=bi<=≤<=k for all 1<=≤<=i<=≤<=n. Help mom find the maximum possible beauty of the array she will give to Vasya (that seller can obtain). The first line contains two integers n and k (1<=≤<=n<=≤<=3·105;<=1<=≤<=k<=≤<=106). The second line contains n integers ai (1<=≤<=ai<=≤<=106) — array a. In the single line print a single number — the maximum possible beauty of the resulting array. Sample Input 6 1 3 6 10 12 13 16 5 3 8 21 52 15 77 Sample Output 3 7	[ "n, k = map(int, input().split())\nt = set(map(int, input().split()))\ny = x = min(t)\nt = list(t)\nwhile True:\n for i in t:\n if i % x > k: x = i // (i // x + 1)\n if y == x: break\n y = x\nprint(y)\n", "n,k=map(int,input().split())\r\nt=set(map(int,input().split()))\r\ny=x=min(t)\r\nt=list(t)\r\nwhile True:\r\n for i in t:\r\n if i%x>k:x=i//(i//x+1)\r\n if y==x:break\r\n y=x\r\nprint(y)", "n,k=map(int,input().split())\nt=set(map(int,input().split()))\ny=x=min(t)\nt=list(t)\nwhile True:\n for i in t:\n if i%x>k:x=i//(i//x+1)\n if y==x:break\n y=x\nprint(y)\n" ]	{"inputs": ["6 1\n3 6 10 12 13 16", "5 3\n8 21 52 15 77", "13 11\n55 16 26 40 84 80 48 52 25 43 75 21 58", "18 9\n85 29 29 15 17 71 46 69 48 80 44 73 40 55 61 57 22 68", "25 7\n67 18 36 85 64 22 32 66 17 64 66 65 82 36 16 52 19 70 38 51 17 32 85 16 64", "7 1\n12 84 21 60 33 21 45", "1 1\n1", "10 10\n40141 53368 66538 64507 78114 34253 73242 42141 37430 6", "10 7\n869 1293 12421 1 90901 120214 12403 6543 591870 124", "2 84794\n1000000 1000000"], "outputs": ["3", "7", "16", "13", "16", "4", "1", "6", "1", "1000000"]}	UNKNOWN	PYTHON3	CODEFORCES	3
8c94a95b56f6f7c5dcc0c59a65f20967	Anton and Chess	Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an infinite one instead. The first task he faced is to check whether the king is in check. Anton doesn't know how to implement this so he asks you to help. Consider that an infinite chess board contains one white king and the number of black pieces. There are only rooks, bishops and queens, as the other pieces are not supported yet. The white king is said to be in check if at least one black piece can reach the cell with the king in one move. Help Anton and write the program that for the given position determines whether the white king is in check. Remainder, on how do chess pieces move: - Bishop moves any number of cells diagonally, but it can't "leap" over the occupied cells. - Rook moves any number of cells horizontally or vertically, but it also can't "leap" over the occupied cells. - Queen is able to move any number of cells horizontally, vertically or diagonally, but it also can't "leap". The first line of the input contains a single integer n (1<=≤<=n<=≤<=500<=000) — the number of black pieces. The second line contains two integers x0 and y0 (<=-<=109<=≤<=x0,<=y0<=≤<=109) — coordinates of the white king. Then follow n lines, each of them contains a character and two integers xi and yi (<=-<=109<=≤<=xi,<=yi<=≤<=109) — type of the i-th piece and its position. Character 'B' stands for the bishop, 'R' for the rook and 'Q' for the queen. It's guaranteed that no two pieces occupy the same position. The only line of the output should contains "YES" (without quotes) if the white king is in check and "NO" (without quotes) otherwise. Sample Input 2 4 2 R 1 1 B 1 5 2 4 2 R 3 3 B 1 5 Sample Output YES NO	[ "s, n = {}, int(input())\r\nx, y = map(int, input().split())\r\nfor i in range(n):\r\n t, a, b = input().split()\r\n u, v = int(a) - x, int(b) - y\r\n a = (abs(u) == abs(v))\r\n b = (u == 0 or v == 0)\r\n d = abs(u) + abs(v)\r\n p = (u < 0, v < 0, u > 0, v > 0)\r\n q = (d, t in 'Q' + 'RB'[a])\r\n if a or b: s[p] = min(s[p], q) if p in s else q\r\nprint('YES' if any(t for d, t in s.values()) else 'NO')" ]	{"inputs": ["2\n4 2\nR 1 1\nB 1 5", "2\n4 2\nR 3 3\nB 1 5", "5\n-1 1\nR -10 10\nQ -9 9\nQ -2 -8\nB -6 10\nB -10 1", "20\n-321 454\nQ 967 -89\nR -811 454\nQ -404 454\nR -734 454\nQ -804 454\nQ -316 77\nQ -802 454\nB -499 454\nQ 401 -663\nQ -601 454\nQ -974 454\nB 710 298\nB -917 454\nB -555 -542\nQ -337 950\nR 501 40\nR 355 310\nB 657 -374\nR -860 454\nR 839 -10", "3\n-1000000000 -1000000000\nB 1000000000 -1000000000\nB -1000000000 1000000000\nB 1000000000 1000000000", "4\n1000000000 -1000000000\nB -1000000000 -1000000000\nB -1000000000 1000000000\nB 1000000000 1000000000\nR 0 0", "5\n-1000000000 1000000000\nR -1000000000 -1000000000\nB 1000000000 -1000000000\nR 1000000000 1000000000\nB -1000000000 0\nB 0 1000000000", "6\n-1000000000 1000000000\nR -1000000000 -1000000000\nB 1000000000 -1000000000\nR 1000000000 1000000000\nB -1000000000 0\nB 0 1000000000\nQ 0 0", "5\n1000000000 1000000000\nQ -1000000000 -1000000000\nQ -1000000000 1000000000\nQ 1000000000 -1000000000\nB 1000000000 0\nB 0 1000000000", "6\n1000000000 1000000000\nQ -1000000000 -1000000000\nQ -1000000000 1000000000\nQ 1000000000 -1000000000\nB 1000000000 0\nB 0 1000000000\nR 0 0", "6\n-1000000000 -1000000000\nB 1000000000 1000000000\nR 0 0\nQ 2 2\nR 4851521 8054854\nR -1000000000 1000000000\nB -1000000000 379", "4\n0 0\nB 0 1\nB -1 0\nR 1 1\nQ -1 -1", "3\n0 0\nR -1 -1\nR 1 -1\nB 0 1", "2\n0 0\nR 0 2\nB 0 1", "2\n5 5\nR 7 5\nB 6 5", "2\n1 1\nR 1 3\nB 1 2", "2\n0 0\nB 1 0\nR -2 0", "2\n4 2\nB 1 5\nR 3 3", "1\n0 0\nB 1 -1", "2\n0 0\nB 2 2\nR 1 1", "2\n1 0\nR 0 -1\nB 3 2"], "outputs": ["YES", "NO", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "NO", "YES"]}	UNKNOWN	PYTHON3	CODEFORCES	1
8c973212d593a4182fe97b22e3f856eb	Olesya and Rodion	Olesya loves numbers consisting of n digits, and Rodion only likes numbers that are divisible by t. Find some number that satisfies both of them. Your task is: given the n and t print an integer strictly larger than zero consisting of n digits that is divisible by t. If such number doesn't exist, print <=-<=1. The single line contains two numbers, n and t (1<=≤<=n<=≤<=100, 2<=≤<=t<=≤<=10) — the length of the number and the number it should be divisible by. Print one such positive number without leading zeroes, — the answer to the problem, or <=-<=1, if such number doesn't exist. If there are multiple possible answers, you are allowed to print any of them. Sample Input 3 2 Sample Output 712	[ "n, t=(map(int,input().split()))\r\nif n==1 and t==10:\r\n print(-1)\r\nelif n>=2 and t ==10:\r\n for i in range((n-1)):\r\n print('1',end=\"\")\r\n print(0)\r\nelse:\r\n for i in range((n)):\r\n print(t,end=\"\")\r\n ", "n,t = map(int,input().split())\r\ns = '1'\r\ni = 1\r\nwhile i <= n-1:\r\n s += '0'\r\n i += 1\r\nw = s + '0'\r\nnum1 = int(s)\r\nnum2 = int(w)\r\nwhile num1 < num2:\r\n if num1 % t == 0:\r\n print(num1)\r\n break\r\n else:\r\n num1 += 1\r\nif num1 == num2:\r\n print(-1)", "n,t=map(int,input().split())\r\na=10*(n-1-(t>9))\r\nprint([ta,-1][a<1])", "a,b=map(int,input().split())\r\nfor x in range(10(a-1),10a):\r\n if x%b==0:\r\n print(x)\r\n exit()\r\nprint(-1)\r\n", "info = list(map(int, input().split()))\r\nn = info[0]\r\nt = str(info[1])\r\nif n == 1 and t == '10':\r\n print('-1')\r\nelif t == '10':\r\n print(t+(n-2)'0')\r\nelse:\r\n print(t+(n-1)'0')", "n,t=map(int,input().split())\r\nn=10*(n-1)\r\nif t(n//t+1)<10n:\r\n print(t(n//t+1))\r\nelse:\r\n print(-1)", "import math\r\n\r\nx = list(map(int,input().split()))\r\nif(x[0] ==1 and x[1] == 10):\r\n print(-1)\r\n exit()\r\nsol = x[1]\r\nwhile(True) : \r\n div = math.floor(sol/(math.pow(10,x[0]-1)))\r\n if (div < 10 and div > 0):\r\n print(sol)\r\n exit()\r\n sol = 2\r\nprint(-1)\r\n", "MOD = 1000000007\r\n\r\ndef main():\r\n n, t = map(int, input().split())\r\n ans = 0\r\n \r\n for i in range(10 * (n - 1), 10 n):\r\n if i % t == 0:\r\n ans = i\r\n break\r\n else:\r\n ans = -1\r\n \r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,t=map(int,input().split())\r\nif(n==1 and t==10): print(\"-1\")\r\nelif(t==10):\r\n print(\"1\",end=\"\")\r\n for i in range(0,n-1):\r\n print(\"0\",end=\"\")\r\nelse:\r\n for i in range(0,n):\r\n print(t,end=\"\")\r\n ", "a,b = map(int,input().split())\r\nc = (10a-1)//bb\r\nprint([-1,c][c>0])\r\n", "def digit(n):\r\n dg = 0\r\n while n > 0:\r\n dg += 1\r\n n = n // 10\r\n return dg\r\n\r\n\r\nn, t = map(int, input().split())\r\nif digit(t)<=n:\r\n if t != 10:\r\n print(tpow(10, n-1))\r\n else:\r\n print(t * pow(10, n - 2))\r\nelse:\r\n print(-1)", "l = input().split()\r\n\r\nn = int(l[0])\r\nt = int(l[1])\r\n\r\nans = 10(n-1) -((10(n-1))%t) + t\r\n\r\nif len(str(ans))!=n:\r\n print(-1)\r\nelse:\r\n print(ans)", "def main():\n n, t = list(map(int, input().split()))\n\n if t == 10 and n == 1:\n print(-1)\n elif t == 10 and n >= 2:\n print(\"1\"(n-1)+\"0\")\n else:\n print(str(t)n)\n\nmain()\n", "n, t = map(int, input().split())\r\nif len(str(10 (n - 1))) < len(str(t)):\r\n print(-1)\r\nelse:\r\n ans = 10 (n - 1)\r\n for i in range(12):\r\n if ans % t != 0:\r\n ans += 1\r\n else:\r\n print(ans)\r\n break", "n, t = [int(i) for i in input().split()]\r\nnum = int('1' + '0' * (n - 1))\r\nflag = True\r\nif num % t == 0:\r\n print(num)\r\n flag = False\r\nelse:\r\n while len(str(num)) == n:\r\n if num % t == 0:\r\n print(num)\r\n flag = False\r\n break\r\n else:\r\n num += 1\r\nif flag:\r\n print(-1)\r\n", "n, t = map(int, input().split())\r\nres = 10 (n-1)\r\nres += (t - res % t) % t\r\nif len(str(res)) == n:\r\n print(res)\r\nelse:\r\n print(-1)", "def ans(n,t):\r\n rem = (t - 10(n-1) % t) % t\r\n for i in range(10(n-1) + rem,10n,t):\r\n if not i % t:\r\n return i\r\n return -1\r\nn,t = list(map(int,input().split()))\r\nprint(ans(n,t))", "nt = input().split()\r\nnt = [int(x) for x in nt]\r\nn = nt[0]\r\nt = nt[1]\r\n\r\n\r\ndef task(n,t):\r\n for i in range(10(n-1), 10n):\r\n if i%t == 0:\r\n return i\r\n\r\n return -1\r\n\r\n\r\nprint(task(n,t))", "n,t=map(int,input().split())\r\nif n<len(str(t)):\r\n ans=-1\r\nelse:\r\n ans = t10(n-len(str(t)))\r\nprint(ans)", "import math, heapq\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\nfrom itertools import permutations\r\nfrom copy import deepcopy\r\n\r\n \r\ndef sieve_of_eratosthenes(n):\r\n is_prime = [True] (n+1)\r\n is_prime[0] = is_prime[1] = False\r\n for p in range(2, int(n*0.5)+1):\r\n if is_prime[p]:\r\n for i in range(pp, n+1, p):\r\n is_prime[i] = False\r\n \r\n for i in range(2, n+1):\r\n if is_prime[i]:\r\n print(i, end=' ')\r\n\r\n\r\ndef isPowerOf2(n):\r\n\r\n def log2(x):\r\n\r\n if x == 0:\r\n return False\r\n\r\n return (math.log10(x)/math.log10(2))\r\n\r\n\r\n return math.ceil(log2(n)) == math.floor(log2(n))\r\n\r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\n\r\nn, t = readarray(int)\r\n\r\n\r\nlow = int(\"1\" + (\"0\" * (n-1)))\r\nhigh = int(\"1\" + (\"0\" * n))\r\n\r\nans = -1\r\nfor num in range(low, high):\r\n if num % t == 0:\r\n ans = num\r\n break\r\n\r\nprint(ans)", "#https://codeforces.com/problemset/problem/584/A\r\n\r\n(n, t) = (int(x) for x in input().split())\r\nanswers = False\r\nt_length = len(str(t))\r\nif(t>=10*n):\r\n answer = -1\r\nelse:\r\n answer = t(10abs(t_length-n))\r\nprint(answer)", "n, t = map(int, input().split())\nans = 10(n - 1) + (t - 10(n - 1) % t)\nif len(str(ans)) == n:\n print(ans)\nelse:\n print(-1)", "kal = [int(i) for i in input().split()]\r\nn = kal[0]\r\nt = kal[1]\r\n\r\nfor i in range(10(n-1), 10*n):\r\n if i % t == 0:\r\n print(i)\r\n exit()\r\nprint(-1)", "n, t = map(int, input().split())\r\n\r\ny = \"1\" + \"0\" (n - 1)\r\ny = int(y)\r\na = 0\r\n\r\nwhile True:\r\n if a >= 9:\r\n print(-1)\r\n break\r\n if y % t == 0:\r\n print(y)\r\n break\r\n else:\r\n y += 1\r\n a += 1", "def main():\r\n n, t = map(int, input().split())\r\n n = int(\"9\"n)\r\n if n< t:\r\n print(-1)\r\n else:\r\n print(n-(n%t))\r\n \r\nmain()", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import \r\n# map(int,input().split())\r\n \r\ndef solve():\r\n n,t=map(int,input().split())\r\n number=\"1\"+\"0\"(n-1)\r\n number2=\"1\"+\"0\"n\r\n ini=int(number)+1\r\n final=int(number2)\r\n for i in range(ini,final):\r\n if i%t==0:\r\n return i\r\n return -1\r\n\r\n#for _ in range(int(input())):\r\nprint(solve())", "# https://codeforces.com/problemset/problem/584/A\r\n\r\nn, t = map(int, input().split())\r\n\r\n# smallest number with n digits\r\nx = 10(n-1)\r\n# largest number with n digits\r\ny = 10n - 1\r\n\r\n# find the next multiple of t greater than or equal to x\r\nnext_multiple = ((x + t - 1) // t) * t\r\n\r\nif next_multiple > y:\r\n print(-1)\r\nelse:\r\n print(next_multiple)\r\n\r\n\r\n", "n = list(map(int,input().split()))\r\nif n[1] == 10 and n[0] != 1: n[1] = 1\r\n\r\nif n[1] == 10 and n[0] == 1: print(-1)\r\nelse: print(pow(10,n[0]-1)n[1])", "n=[int(i) for i in input().split()]\r\nx=10(n[0]-1)\r\nwhile x<=10(n[0]-1)+n[1]:\r\n if x%n[1]==0:\r\n break\r\n x+=1\r\n\r\nif 10n[0]-1<n[1]:\r\n x=-1\r\nprint(x)", "n , t = map(int , input().strip().split())\r\nif n== 1 and t == 10 :\r\n print(-1) \r\nelse:\r\n prec = 10(n-1) \r\n while True :\r\n if prec %t == 0 and len(str(prec)) == n :\r\n print(prec)\r\n break \r\n prec +=1 \r\n \r\n \r\n", "for Ram in range(1):\r\n n,t=map(int,input().split())\r\n if t!=10:\r\n ans=str(t)n\r\n else:\r\n if n!=1:\r\n ans=\"1\"+\"0\"(n-1)\r\n else:\r\n ans=-1\r\n print(ans)", "digits,div=map(int,input().split())\r\nans=0\r\nfor i in range(10(digits-1),10(digits)):\r\n if(i%div==0):\r\n ans=i\r\n break\r\nprint(ans)if(ans)else print(-1)", "# Author : //- kibrom Hailu -\\\\\r\n\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter,defaultdict , deque \r\nfrom bisect import bisect , bisect_left ,bisect_right \r\nfrom itertools import accumulate \r\nfrom heapq import heapify , heappop , heappush , heappushpop , heapreplace\r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef solve():\r\n \r\n # write your code here \r\n n,t = II()\r\n\r\n if n == 1:\r\n if t == 10:\r\n return -1\r\n return t \r\n if t == 10:\r\n return 10(n-1)\r\n else:\r\n return t(10*(n-1))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nprint(solve())\r\n", "n, t = map(int, input().split())\r\nx = t\r\nif n== 1 and t == 10:\r\n print(-1)\r\n exit()\r\nwhile len(str(x)) != n:\r\n x = t\r\nprint(x)\r\n", "t,n=map(int,input().split())\r\nif(t<=1 and n==10) :\r\n print(-1)\r\nelif(n==10) :\r\n print(n,end=\"\")\r\n for i in range(2,t) :\r\n print('0',end=\"\")\r\nelse :\r\n print(n,end=\"\")\r\n for i in range(1,t) :\r\n print('0',end=\"\")\r\nprint()", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Jul 25 10:48:46 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 53 - CF584-DIV2A\r\n\"\"\"\r\n\r\nn,t = map(int,input().split())\r\nif t == 10 and n > 1:\r\n print(pow(10,n-1))\r\nelif t == 10:\r\n print(-1)\r\nelse:\r\n print(pow(10,n-1)t)", "x = input()\r\nl = x.split()\r\nn = int(l[0])\r\nt = int(l[1])\r\nnum = \"1\"\r\nfor i in range(n-1):\r\n num += \"0\"\r\nnum = int(num)\r\ndef find(num):\r\n for i in range(num , num10):\r\n if i % t == 0 :\r\n return(i)\r\n return(-1)\r\nprint(find(num))\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n", "n,t=map(int,input().split())\r\nk=0\r\nif t==10:\r\n if n==1:\r\n print(-1)\r\n else:\r\n print(t(n-1))\r\nelse:\r\n for i in range(n):\r\n k+=(10i)t\r\n print(k)", "n,t = map(int,input().split())\r\nstart=10(n-1)\r\nend=(10n)\r\nfor i in range(start,end):\r\n if i%t==0:\r\n print(i)\r\n break\r\nelse:\r\n print(-1)", "if __name__ == \"__main__\":\r\n n, t = map(int, input().split())\r\n\r\n if n < len(str(t)): print (-1)\r\n else:\r\n num = int(str(t) + ('0' (n - len(str(t)))))\r\n print (num)", "num=input().split();\r\nif num[1]==\"10\":\r\n if int(num[0])<2:\r\n print(-1)\r\n else :\r\n print(1,end=\"\")\r\n for _ in range(int (num[0])-1):\r\n print(0,end=\"\")\r\n\r\nelse :\r\n for _ in range (int(num[0])):\r\n print(num[1],end=\"\")", "x = list(map(int, input().split()))\r\nz = []\r\nif x[1] != 10:\r\n for i in range(0, x[0]):\r\n z.append(str(x[1]))\r\nelif x[1] == 10 and x[0] > 1:\r\n for j in range(0, x[0]-1):\r\n if x[0] % 2 == 0:\r\n z.append(\"2\")\r\n else:\r\n z.append(\"2\")\r\n z.append(\"0\")\r\nelse:\r\n z = 0\r\nif z == 0:\r\n print(-1)\r\nelse:\r\n print(\"\".join(z))", "line = input().split(\" \")\na,b = int(line[0]),int(line[1])\n\n\ndef s(n1,n2):\n if(n1==1 and n2==10):return -1\n ret_num = 10*(n1-1)\n for i in range(2,11):\n if((ret_num+i)%n2==0):\n return ret_num+i\n \nprint(s(a,b))\n \t\t \t \t\t\t \t\t \t\t \t\t \t\t\t", "n,t = list(map(int, input().split()))\r\ns = int(str(t)+\"0\"(n-len(str(t))))\r\nprint(s if len(str(s)) == n else -1)", "n , t = map(int, input().split())\r\nif t == 10 and n == 1:\r\n print(-1)\r\nelif t == 10:\r\n print(t(10(n-2)))\r\nelse:\r\n print(t(10(n-1))) ", "n, t = map(int, input().split())\r\na=10(n-1-(t>9))\r\nprint([ta,-1][a<1])", "n,t=[int(x) for x in input().split()]\r\n\r\nif t==10:\r\n\tif n==1:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(tint('1'(n-1)))\r\nelse:\r\n\tprint(tint('1'(n))) ", "n ,t = map(int, input().split())\r\nn = 10(n - 1)\r\nb = (n//t) + 1\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n print(bt)", "n,t=map(int,input().split())\r\nfor i in range(int(\"1\"+(n-1)\"0\"),int(\"1\"+(n)\"0\")):\r\n if i%t==0:print(i);break\r\n elif i==int(\"9\"n):print(-1)", "s = list(map(int, input().split()))\r\nz = [(10 * i) * 9 for i in range(s[0])]\r\nans = 0\r\nfor i in range(s[0]):\r\n if ans+(10*i) s[1] <= sum(z):\r\n ans += (10*i) s[1]\r\n\r\nif ans > sum(z) or ans == 0:\r\n ans = -1\r\n\r\nprint(ans)", "\r\nn, t = [int(k) for k in input().split()]\r\nif n == 1 and t == 10:\r\n print('-1')\r\nelse:\r\n kq = 1\r\n for i in range (n):\r\n kq = 10\r\n kq -= 1\r\n print(int(kq - kq%t))", "#Amir_Python\nn, t=map(int, input().split())\nsign=False\nfor x in range(pow(10,n-1), pow(10,n)):\n if x%t==0:\n print(x)\n sign=True\n break\nif sign==False:\n print(\"-1\")", "import math\r\n\r\nn, t = map(int, input().split())\r\nnum1 = math.ceil((10 * (n - 1)) / t)\r\nx = 1\r\nif ((10n) / t) == math.floor((10n) / t):\r\n x -= 1\r\nnum2 = math.floor((10*n) / t) + x\r\n\r\nif num1 == num2:\r\n print(-1)\r\nelse:\r\n print(math.ceil((num2 - num1) / 2) t)", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\n# n = int(input())\r\n# arr = [int(x) for x in input().split()]\r\n\r\nn, t = get_ints()\r\n\r\nbase = pow(10, n-1)\r\n\r\nnumber = base\r\nif base%t != 0:\r\n number = base + (t - base%t)\r\n\r\nif number < base * 10:\r\n print(number)\r\nelse:\r\n print(\"-1\")\r\n \r\n ", "n,t = map(int,input().split())\r\nx= pow(10,n)\r\nif t>=x:\r\n print(-1)\r\nelse:\r\n if len(str(t))==n:\r\n print(t)\r\n else:\r\n print(((x-1)//t)t)\r\n", "x,y=map(int,input().split())\r\nif 10x-y==0:\r\n print(\"-1\") \r\nelif (10x)%y!=0:\r\n print(10x-(10x%y))\r\nelse:\r\n print(10x-y) ", "n,t=map(int,input().split())\r\n\r\nm=10n-1\r\nans=1\r\n\r\nif n==1 and t==10:\r\n print(-1)\r\nelse:\r\n \r\n while ans==1:\r\n if m%t==0:\r\n print(m)\r\n ans=0\r\n break\r\n else:\r\n m-=1\r\n \r\n \r\n ", "n,t=[int(x) for x in input().split()]\r\nm=len(str(t))\r\nprint(-1 if m>n else int(str(t)+'0'(n-m)))", "a=list(map(int,input().split()))\r\nif a[0]==1:\r\n if a[1]==10:\r\n print(-1)\r\n else:\r\n print(a[1])\r\nelse:\r\n if a[1]==10:\r\n print(int(\"1\"+\"0\"(a[0]-1)))\r\n else:\r\n print(int(str(a[1])a[0]))\r\n", "n,t=map(int,input().split())\r\nif 10(n)-1<t:\r\n print(-1)\r\nelif 10(n-1)%t==0:\r\n print(10(n-1))\r\nelse:\r\n print((10(n-1)//t+1)t)", "n, t = map(int, input().split())\r\nif t == 10:\r\n if n == 1:\r\n print(-1)\r\n else:\r\n print(10(n-1))\r\nelse:\r\n _10 = 10(n-1)\r\n r = t-_10%t\r\n print(_10+r)", "N,T = map(int,input().split())\r\nX = (10N-1)//TT\r\nprint([-1,X][X>0])", "n, t = map(int, input().split())\r\nx = pow(10, n-1)\r\na= False\r\nif x10-1>=t:\r\n while(x<x10):\r\n if x%t==0:\r\n print(x)\r\n a=True\r\n break\r\n x+=1\r\nif not a:\r\n print(-1)", "x,y = map(int,input().split())\r\nif len(str(y))<x: \r\n print(y(pow(10,x-len(str(y)))))\r\nelif len(str(y)) == x:\r\n print(y)\r\nelse:\r\n print(-1)", "n,t=map(int,input().split())\r\nx=int('9'n)\r\ny=x//t\r\nx=yt\r\nif(len(str(x))>n or y==0):print(-1)\r\nelse:print(x)", "x,y=map(int,input().split())\r\nz='9'(x)\r\nc='1'(x)\r\ns=0\r\nfor i in range(int(c),int(z)+1):\r\n if i%y==0:\r\n print(i)\r\n s+=1\r\n break\r\nif s!=1:\r\n print('-1') ", "kol,dell=map(int,input().split())\r\nif len(str(dell))>kol:\r\n print(-1)\r\nelse:\r\n num1=10kol-1\r\n num2=num1%dell\r\n print(num1-num2)", "P,t=map(int,input().split())\r\na=10(P-1-(t>9))\r\nprint([ta,-1][a<1])", "def solve():\r\n n,t=map(int,input().split());ans=1;ans=(10(n-1))\r\n ans+=t-(ans%t)\r\n if len(str(ans))==n:print(ans)\r\n else:print(-1)\r\nsolve()\r\n", "n, t = map(int, input().split())\r\n\r\nnine = ''\r\n\r\nif n==1 and t==10:\r\n print('-1')\r\nelif n==1:\r\n print(t)\r\nelse:\r\n for i in range(n-1):\r\n nine+='9'\r\n\r\n print(int(nine)t)", "n, m = map(int, input().split())\r\na = (10 ** n - 1) // m * m\r\nprint([-1, a][a > 0])", "n,t = map(int,input().split())\n# num = t\n# while len(str(num))< n :\n# num += k\n# if len(str(num)) == n :\n# print(num)\n# else :\n# print(-1)\nif n == 1 and t == 10 :\n print(-1)\n exit(0)\nnum = 10 (n-1)\nwhile num % t :\n num +=1\nprint(num)\n", "n,t = map(int,input().split())\r\nif n==1 and t ==10:\r\n print(-1)\r\nelif t<10:\r\n print((10(n-1))t)\r\nelse:\r\n print(10(n-1))", "a=list(map(int,input().split()))\r\nn=a[0]\r\nt=a[1]\r\nif(t!=10):\r\n print(t,end='')\r\n for i in range(n-1):\r\n print(0,end='')\r\nelse:\r\n if(n==1):\r\n print(-1)\r\n else:\r\n print(10,end='')\r\n for i in range(n-2):\r\n print(0,end='')", "n, t = map(int, input().split())\r\n\r\n# Check if such a number is possible\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n # Find the first digit (most significant digit) of the number\r\n if t == 10:\r\n first_digit = 1\r\n else:\r\n first_digit = t\r\n\r\n # Create the number by repeating the first digit n-1 times\r\n number = str(first_digit) + '0' (n - 1)\r\n\r\n print(number)\r\n", "a, b = map(int, input().split())\r\nif a == 1 and b == 10:\r\n print(-1)\r\nelif b == 10:\r\n print(int(str(1)(a - 1))10)\r\nelse:\r\n print(int(str(b)a))", "n, t = map(int, input().split())\r\nk = -1\r\nfor i in range(10 * (n - 1), 10 ** n):\r\n if i % t == 0:\r\n k = i\r\n break\r\nprint(k)", "n, t = map(int, input().split())\r\n\r\nif len(str(t)) > n:\r\n print(-1)\r\nelse:\r\n diff = n - len(str(t))\r\n mult = '1' + '0' * diff\r\n print(t * int(mult))", "def funkcja(a, b):\r\n for i in range (10(a-1), 10a):\r\n if i%b == 0:\r\n return i\r\n return -1\r\nn, t = map(int, input().split())\r\nprint(funkcja(n, t))", "n,t=map(int,input().split())\r\ns=\"\"\r\nif n==1:\r\n s+=str(t)\r\nelse:\r\n for i in range(n-1):\r\n s+=\"9\"\r\n s=str(int(s)t)\r\nif len(s)==n:\r\n print(s)\r\nelse:\r\n print(-1)\r\n", "n,t=[int(n) for n in input().split()] \r\na = nt \r\na = str(a)\r\na = a + str(0)(n-len(a))\r\nif len(a) != n: \r\n print(-1)\r\nelse: print(int(a))", "import sys\r\nimport math\r\n\r\ninputs = []\r\nfor line in sys.stdin:\r\n inputs.append(line)\r\n\r\ncase = inputs[0].strip().split()\r\nn = int(case[0])\r\nt = int(case[1])\r\n\r\nresult = \"\"\r\nif t != 10:\r\n for i in range(n):\r\n result+=str(t)\r\nelse:\r\n for i in range(n-1):\r\n result+=\"1\"\r\n result+=\"0\"\r\n \r\nif len(result) == n and (int(result) != 0 and int(result) % t == 0):\r\n print(result)\r\nelse:\r\n print(-1)", "li=list(map(int,input().strip().split()))\r\nnum=li[0]\r\nnum1=li[1]\r\nx=int(str(1)+\"0\"(num-1))\r\ny=int(\"9\"(num))\r\nf=0\r\nfor i in range(x,y+1):\r\n if i%num1==0:\r\n print(i)\r\n f=1\r\n break\r\nif f==0:\r\n print(-1)", "n,t = map(int,input().split())\r\nif t==10:\r\n num = str(t)+'0'(n-2)\r\nelse:\r\n num = str(t) + '0' * (n - 1)\r\nif len(num) == n:\r\n print(num)\r\nelse:\r\n print(-1)", "n,t=map(int,input().split())\r\nch=''\r\nres=0\r\nif t==10:\r\n if n==1:\r\n print(-1)\r\n else:\r\n for _ in range(n-1):\r\n ch+='1'\r\n ch+='0'\r\n print(int(ch))\r\nelse:\r\n for j in range(n):\r\n res+=(10*j)t\r\n print(res)\r\n ", "n ,t = list(map(int, input().split()))\r\nres = ''\r\nres += str(1) \r\nres += (n-1)'0'\r\nres2 = res\r\nres2 += '0'\r\nres = int(res)\r\nres2 = int(res2)\r\na = []\r\nfor i in range(res , res2): \r\n if(i % t == 0):\r\n a.append(i)\r\n break \r\n else: \r\n continue\r\n\r\nif(len(a) == 0):\r\n print(-1)\r\nelse:\r\n print(a[0])", "n,t=map(int,input().split())\r\nc=0\r\nfor i in range(10(n-1),10n):\r\n if i%t==0:\r\n print(i)\r\n c+=1\r\n break\r\nif c==0:\r\n print(-1)", "class Solution():\n\n def olesya_and_rodion(length, divisible_by):\n number = divisible_by(10(length-len(str(divisible_by))))\n if len(str(number)) == length:\n return number\n else:\n return -1\n\n\nif __name__ == '__main__':\n length, divisible_by = map(int, input().split())\n print(Solution.olesya_and_rodion(length, divisible_by))", "def sol():\r\n for i in range(10(n-1),10*n):\r\n if i%t == 0:\r\n return i\r\n return -1\r\n\r\n\r\nn,t = map(int,input().split())\r\na = sol()\r\nprint(a)", "n,t=[int(i) for i in input().split()]\r\nm=t\r\n\r\ncount=1\r\n\r\nwhile(True):\r\n\r\n t=t/10\r\n\r\n if t<1:\r\n\r\n break\r\n\r\n count+=1\r\n\r\nr=pow(10,(n-count))\r\n\r\nif count>n :\r\n\r\n print(-1)\r\n\r\n\r\n\r\nif n==count :\r\n\r\n print(m)\r\n\r\n\r\n\r\nif(n>count):\r\n\r\n print(mr)\r\n\r\n", "n, t = [int(i) for i in input().split()]\r\nfor i in range(int('1'+'0'(n-1)), int('1'+'0'(n))):\r\n if i%t==0:\r\n print(i)\r\n break\r\nelse:\r\n print(-1)", "n, t = map(int, input().split())\r\nans = 10*(n-1)\r\nfor i in range(t):\r\n if ans % t == 0:\r\n break\r\n ans += 1\r\nif ans % t != 0 or len(str(ans)) > n:\r\n print(-1)\r\nelse:\r\n print(ans)", "n, t = map(int, input().split())\r\n\r\nif t == 10:\r\n result = (-1 if n == 1 else pow(10, n - 2) 10)\r\nelse:\r\n result = pow(10, n - 1) * t\r\n\r\nprint(result)\r\n", "n, t = map(int, input().split())\r\nstart = '1'\r\nstart += '0' * (n-1)\r\nend = start + '0'\r\nstart, end = int(start), int(end)\r\nfor num in range(start, end):\r\n if int(num) % t == 0:\r\n print(num)\r\n exit(0)\r\nprint(-1)\r\n\r\n", "n, t = map(int, input().split())\r\na = int('1' + '0'(n-1))\r\nb = int('1' + '0'n)\r\nFlag = False\r\nfor i in range(a, b):\r\n if i % t == 0:\r\n Flag = True\r\n res = i\r\n break\r\nif Flag:\r\n print(res)\r\nelse:\r\n print(-1)\r\n", "l=list(map(int,input().split()))\r\nn=l[0]\r\nt=l[1]\r\ntemp=t\r\nif n==1 and t==10:\r\n print(-1)\r\nelse:\r\n y=str(t)\r\n while(len(y)<n):\r\n t=ttemp\r\n y=str(t)\r\n \r\n print(y)", "n, t = map(int,input().split())\nk = (int('9'n)//t)t\nif k == 0:\n print(-1)\nelse:\n print(k)\n\n", "# Link: https://codeforces.com/contest/584/problem/A\n\nn, t = list(map(int, input().split()))\n\nnumber = 10 * (n - 1)\nlast = 10 (n)\nfound = True\n\nwhile number % t != 0:\n number += 1\n \nprint(number if number < last else -1)", "n,t=(map(int, input().split()))\r\nif n<len(str(t)):\r\n print(-1)\r\nelse:\r\n if (10n)%(t)!=0:\r\n print(10n-(10n%t))\r\n else:\r\n print(10n-t) ", "n,t=map(int,input().split())\r\n\r\nl=10(n-1)\r\nu=10*n\r\nk=-1\r\nfor i in range(l,u):\r\n if i%t==0:\r\n k=i\r\n break\r\n \r\nprint(k)", "#!/opt/homebrew/bin/python3\n\ndef main():\n n, t = input().split()\n n = int(n)\n t = int(t)\n\n number = 1\n for i in range(n-1):\n number = 10\n\n max_number = number * 10\n\n while number % t:\n number += 1\n\n if number >= max_number:\n print(-1)\n else:\n print(number)\n\nif __name__ == '__main__':\n main()", "n, t = map(int, input().split())\r\n\r\nif n == 1 and t != 10:\r\n ans = t\r\nelif n == 1 and t == 10:\r\n ans = -1\r\nelse:\r\n ans = 10(n-1)\r\n while ans % t != 0:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n, t = map(int, input().split())\r\nx = 10(n-1)\r\nif n==1 and t ==10:\r\n print(-1)\r\nelif t == 10 :\r\n print(int('1'(n-1)+'0'))\r\nelse:\r\n print(int(f'{t}'n))\r\n", "\r\nn,t = list(map(int,input().split(' ')))\r\n\r\nif len(str(t))>n:\r\n print(-1)\r\nelif len(str(t))==n:\r\n print(t)\r\nelse:\r\n po = n- len(str(t))\r\n print(t10po)\r\n \r\n\r\n", "n,t=map(int,input().split())\r\na=(10n-1)//tt\r\nprint([-1,a][a>0])", "n ,t = map(int, input().split())\r\na = 10*(n - 1)\r\nb = a // t\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n print((b + 1) t)\r\n\r\n\r\n", "s,t=map(int,input().split())\nc=''\nif s<2 and t==10:\n print(-1)\nelif s>=2 and t==10:\n for i in range(s-1):\n c+=str(1)\n c+=str(0) \n print(c)\nelse:\n for i in range(s):\n c+=str(t)\n print(c)\n\n \t \t\t\t \t\t \t \t\t\t\t\t", "def solve():\r\n n, k = map(int, input().split())\r\n if k == 10:\r\n print('1'+(n-1)'0' if n > 1 else -1)\r\n else:\r\n print(str(k)n)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "def n_to_10(n):\n p = 1\n for i in range(n - 1):\n p = 10\n return p\nn, t = map(int, input().split())\nif n == 1 and t == 10:\n print(-1)\n exit()\nif n == 1:\n print(t)\nelse:\n print((n_to_10(n) // t + 1) t)\n", "A=list(map(int, input().split()))\r\nn=A[0]\r\nt=A[1]\r\nk=0\r\nfor i in range(10(n-1),10n):\r\n if i%t==0:\r\n print(i)\r\n k+=1\r\n break\r\nif k==0:\r\n print(-1)", "from sys import stdin\nfrom math import ceil\n\nn, t = map(int, stdin.readline().strip().split())\n\nans = str(ceil(int('1'n)/t)t)\n\nif len(ans) == n:\n print(ans)\nelse:\n print(-1)\n\t \t\t\t \t\t \t \t \t \t \t \t \t", "n,t = list(map(int,input().split(\" \")))\r\npower = n-1\r\nfor i in range(10power,10power+t):\r\n if i%t==0 and len(str(i))==n:\r\n print(i)\r\n break\r\nelse:\r\n print(-1)", "szamok = input().split(\" \")\r\nn,t = int(szamok[0]), int(szamok[1])\r\n\r\nmin,max = 1,0\r\nfor i in range(n-1):\r\n min=10\r\nmax = min10-1\r\nbool = 0\r\nfor i in range(min,max+1):\r\n if i % t == 0:\r\n print(i)\r\n bool = 1\r\n break\r\nif bool == 0:\r\n print(-1)", "n,t=map(int,input().split())\r\ns= 10(n-1)\r\ny=True\r\nwhile(s%t):\r\n s+=1\r\n if(s==10n):\r\n y= False\r\nif(y== False):\r\n print(-1)\r\nelse:\r\n \r\n print(s)\r\n \r\n ", "import sys\r\nn , t = map(int, input().split())\r\n\r\nc=0\r\nfor i in range(10(n-1),10n):\r\n if i%t ==0 and i!=0:\r\n c+=1\r\n \r\n break\r\n\r\nif c==1:\r\n print(i)\r\nelse:\r\n print(-1)\r\n", "n, t = map(int, input().split())\r\nfor i in range((10 (n - 1)), 10 n, 1):\r\n found = 0\r\n if i % t == 0:\r\n print(i)\r\n found = 1\r\n break\r\n else:\r\n continue\r\nif found == 0:\r\n print('-1')\r\n", "n, t = input().split(\" \")\r\nn = int(n)\r\nt = int(t)\r\n\r\nx = t; min_number = 0\r\nwhile x > 0:\r\n min_number += 1\r\n x = int(x/10)\r\n \r\nif min_number > n:\r\n print(-1)\r\nelse:\r\n print(t, end=\"\")\r\n for i in range(n - min_number):\r\n print(0, end=\"\")\r\n \r\n", "n, t = map(int,input().split())\r\na = '1'n\r\nif t < 10:\r\n print(int(a)t)\r\nelif t == 10 and n == 1:\r\n print(-1)\r\nelif t == 10 and n > 1:\r\n print(10(n-1))", "n, t = map(int, input().split())\r\nbegin = pow(10, n-1)\r\nfor num in range(begin, begin+9):\r\n if num % t == 0:\r\n print(num)\r\n break\r\nelse:\r\n print(-1)", "n,t=map(int,input().split())\r\nr=(10(n-1))%t\r\nb=t-r\r\nif ((10n)-1 <(10(n-1)+b)):\r\n print(-1)\r\nelse:\r\n print(10(n-1)+b)", "l = list(map(int,input().split())) \r\nn,t = l[0],l[1] \r\nx = 0 \r\ncnt = 0\r\nwhile n != 0 :\r\n# if cnt == 0 :\r\n# x += 1\r\n x += 10n\r\n \r\n break\r\n \r\n\r\n\r\nfor i in range(x//10,x):\r\n if i%t == 0 :\r\n print(i) \r\n cnt += 1\r\n break\r\nif cnt == 0 :\r\n print(-1)", "import sys\r\n\r\nn, t = map(int, input().split())\r\nx = 1\r\n\r\nif n == 1 and t >= 10:\r\n print(\"-1\")\r\n sys.exit()\r\n\r\nwhile n > 1:\r\n x = 10\r\n n -= 1\r\n\r\nwhile True:\r\n if x % t == 0:\r\n print(x)\r\n break\r\n x += 1\r\n", "def yzd_solution(n, t):\r\n x = 10(n-1) + t\r\n y = ((10(n-1))t) + t\r\n z = t\r\n\r\n answer = -1\r\n nums = [x, y, z]\r\n \r\n for num in nums:\r\n if (len(str(num)) == n and num%t == 0):\r\n answer = num\r\n \r\n\r\n print(answer)\r\n\r\n \r\n\r\nn, t = map(int, input().split())\r\nyzd_solution(n, t)", "x,y=[int(m) for m in input().split()]\r\nif x==1 and y==10:\r\n print(-1)\r\nelif x==1:\r\n print(y)\r\nelse:\r\n s=\"1\"+\"0\"(x-1)\r\n d=int(s)%y\r\n if d==0:\r\n print(s)\r\n else:\r\n print(s[:-1]+str(y-d))", "n, t = map(int, input().split())\r\ni1 = int(\"1\" + (\"0\" (n-1)))\r\ni2 = int(\"9\" * n)\r\nfor i in range(i1, i2 + 1):\r\n if i % t == 0:\r\n print(i)\r\n exit(0)\r\nprint(-1)", "n, t = map(int, input().split())\r\n\r\nif t == 10:\r\n # Special case: if t is 10, the answer will always be 10^(n-1)\r\n if n == 1:\r\n print(-1) # No number with 1 digit is divisible by 10\r\n else:\r\n print(\"1\" + \"0\" * (n-1))\r\nelse:\r\n rem = pow(10, n-1, t) # Calculate remainder\r\n if rem == 0:\r\n print(\"1\" + \"0\" * (n-1)) # 10^(n-1) is divisible by t\r\n else:\r\n ans = pow(10, n-1) + (t - rem) % t\r\n print(ans)\r\n", "n,t=[int(t) for t in input().split()]\r\ng=10*(n-1)\r\nif n==1 and t==10:\r\n print('-1')\r\nelif n>=2 and t==10:\r\n print(g)\r\nelse:\r\n print(tint('1'n))\r\n\r\n ", "a,b=map(int,input().split())\r\nif(b==10):\r\n\tif (a==1):\r\n\t\tprint(\"-1\")\r\n\telse:\r\n\t\tfor _ in range(a-1):\r\n\t\t\tprint(\"1\",end=\"\")\r\n\t\tprint(\"0\")\r\nelse:\r\n\tfor _ in range(a):\r\n\t\tprint(b,end=\"\")", "n,t=map(int,input().split())\r\nc=0\r\nfor i in range(10(n-1)+1,10n,1):\r\n if(i%t==0):\r\n c=i\r\n break\r\n\r\nif(c!=0):\r\n print(c)\r\n\r\nelse:\r\n print(-1)", "# https://codeforces.com/problemset/problem/584/A\r\n\r\nn, t = map(int, input().split())\r\n\r\n# smallest number with n digits\r\nx = 10(n-1)\r\n# largest number with n digits\r\ny = 10n - 1\r\n\r\nfound = False\r\n\r\nfor i in range(x, y+1):\r\n if i % t == 0:\r\n print(i)\r\n found = True\r\n exit()\r\n\r\nif not found:\r\n print(-1)\r\n\r\n\r\n", "n, t = map(int, input().split())\r\n\r\nstart = 10 * (n - 1)\r\nend = 10 n\r\n\r\n\r\nans = start - start % t + t\r\n\r\nif ans < end:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n,t=input().split()\r\nn,t=int(n),int(t)\r\nrem=(10(n-1))%t\r\nans=(10(n-1))+(t-rem)\r\nif ans>=10n or ans<10*(n-1):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "n, t = map(int, input().split())\r\n\r\n# Create a string of n-1 '0's followed by a '1'\r\nnum_str = '1' + '0'(n-1)\r\n\r\n# Convert the string to an integer\r\nnum = int(num_str)\r\n\r\n# Keep incrementing the last digit until the number is divisible by t\r\nwhile num % t != 0 and num_str[-1] != '9':\r\n num += 1\r\n num_str = str(num)\r\n\r\nif num % t == 0:\r\n print(num)\r\nelse:\r\n print(-1)\r\n", "l = input().split()\nn = int(l[0])\nt = int(l[1])\n\n\nif t <= 9:\n print(t(10(n-1)))\nelse:\n if n == 1:\n print(-1)\n else:\n print((10(n-1)))\n", "n, t = list(map(int, input().split()))\r\n# given 1 <= n <= 100 and 2 <= t <= 10\r\n# above case returns -1 only for t = 10 and n = 1\r\nif (n == 1) and (t == 10):\r\n print(-1)\r\nelse:\r\n for i in range(0, t):\r\n if (10 * (n - 1) + i) % t == 0: \r\n print(10 ** (n - 1) + i)\r\n", "n , t = map(int,input().split())\r\nmin = int('1' + '0'(n-1))\r\nmax = int('9'n)\r\nif t>max:\r\n print(-1)\r\nelif t>=min and t<=max:\r\n print(t)\r\nelse:\r\n while True:\r\n if min%t==0:\r\n print(min)\r\n break\r\n else:\r\n min+=1\r\n", "# import sys\r\n# sys.stdout = open('./output.txt', 'w')\r\n# sys.stdin = open('./input.txt', 'r')\r\n\r\nn, t = [int(x) for x in input().split()]\r\nn = 10n - 1\r\nres = (n)-(n) % t\r\nif res == 0 and n > 1:\r\n print(-1)\r\nelse:\r\n print(res)\r\n", "inp=input()\r\ninp=inp.split(\" \")\r\n\r\nn=int(inp[0])\r\nk=int(inp[1])\r\n\r\nans=pow(10,n-1)\r\nmod=ans%k\r\nif(mod==0):\r\n mod=k\r\nans+=(k-mod)\r\n\r\nif(len(str(ans))!=n):\r\n print(-1)\r\nelse:\r\n print(ans)", "n, t = map(int, input().split())\r\nif t == 10 and n == 1:\r\n print(-1)\r\nelif t == 10:\r\n print(10 (n-1))\r\nelse:\r\n print(str(t) * n)", "n, t = map(int, input().split())\r\n\r\n# Initialize the answer to -1\r\nans = -1\r\n\r\n# Loop from 10^(n-1) to 10^n - 1\r\nfor x in range(10(n-1), 10n):\r\n # Check if x is divisible by t\r\n if x % t == 0:\r\n # Update the answer and break the loop\r\n ans = x\r\n break\r\n\r\n# Print the answer\r\nprint(ans)", "n, t = map(int, input().split())\r\ns = 10 ** n - 1\r\nprint(-1 if s < t else s // t * t)\r\n", "n, t = list(map(int, input().split(' ')))\r\n\r\nx = '1'\r\n\r\nfor i in range(n - 1):\r\n x += '0'\r\n\r\nx = int(x)\r\n\r\n\r\nwhile x % t != 0 and len(str(x)) == n:\r\n x += t\r\n x -= (x%t)\r\n\r\n\r\n\r\nif(len(str(x)) != n): print('-1')\r\nelse: print(x)", "tm = input().split()\r\nn, t = int(tm[0]), int(tm[1])\r\nfor i in range(10 (n - 1), 10 n):\r\n if i % t == 0:\r\n print(i)\r\n exit(0)\r\nprint(-1)", "a,b = (input().split())\r\na,b = int(a),int(b)\r\nnum = 10(a-1)\r\n\r\nwhile num%b and 10a > num:\r\n if 10*a <= num+1:\r\n num = -1\r\n break\r\n else:\r\n num+=1\r\nprint(num)", "from collections import defaultdict\r\nn,m=map(int,input().split())\r\nif m==10 and n==1:\r\n print(-1)\r\nelse:\r\n if m==10:\r\n print('1'(n-1)+'0')\r\n else:\r\n print(str(m)n)", "n, t = map(int, input().split())\r\nans = (10 * n - 1) // t * t\r\nif ans > 0:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n# i am from jasnah", "n, t = [int(i) for i in input().split()]\nif t == 10 and n == 1:\n print(-1)\nelse:\n n -= len(str(t));\n print(t, end='')\n print('0'n)", "def ans(n,t):\r\n if n == 1 and t == 10:\r\n return -1\r\n return 10(n-1) + (t - 10(n-1) % t) % t\r\nn,t = list(map(int,input().split()))\r\nprint(ans(n,t))", "n, t = map(int, input().split())\r\n\r\nfirst = '1' + '0' (n - 1) \r\nfirst = int(first)\r\n\r\nlast = '1' + '0' * n\r\nlast = int(last)\r\ns = -1\r\nfor i in range(first, last):\r\n if i % t == 0:\r\n s = i\r\n break\r\n \r\nprint(s)", "def solve(n, t):\r\n num = 10(n-1)\r\n end = 10(n) - 1\r\n\r\n while(num <= end):\r\n if(num%t == 0):\r\n return num\r\n num += 1\r\n return -1\r\n\r\n# for _ in range(int(input())):\r\nn, t = map(int, input().split())\r\nprint(solve(n, t))", "a,b=map(int,input().split())\r\nw=[]\r\nif len(str(b))>a:\r\n\tprint(-1)\r\n\texit()\r\n\r\n\r\nif b==10:\r\n\tfor i in range(a-1):\r\n\t\tw.append(1)\r\n\tw.append(0)\r\n\tprint(w,sep='')\r\n\texit()\r\n\r\n\r\n\r\n\r\nfor i in range(a):\r\n\tw.append(b)\r\n\r\nprint(w,sep='')", "n, k = map(int, input().split())\r\nnum = \"1\" + (\"0\" * (n - 1))\r\nnum_last = \"9\" * n\r\nnum, num_last = int(num), int(num_last)\r\nflag = False\r\nfor i in range(num, num_last + 1):\r\n if i % k == 0:\r\n print(i)\r\n flag = True\r\n break\r\nif not flag:\r\n print(-1)", "n, t = map(int, input().split())\nif (n == 1 and t == 10):\n print(-1)\n exit(0)\nk = 10 n\nif k % t == 0:\n print(k - t)\nelse:\n print(k - (k % t))\n", "def main() -> int:\r\n n, t = tuple(int(x) for x in input().split(\" \"))\r\n res = (10 (n - 1) // t + 1) * t\r\n return res if res < 10 n else -1\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n, t = map(int, input().split())\r\nans = 10 (n - 1) - 10 ** (n - 1) % t + t * (10 (n - 1) % t != 0)\r\nprint((-1, ans)[ans < 10 n])\r\n", "n, t = map(int, input().split())\nres = 10(n-1)\nlimit = 10n\n\nwhile res < limit:\n if res % t == 0:\n print(res)\n break\n res += 1\nelse:\n print(-1)\n", "n,t = [int(x) for x in input().split()]\r\nstart = 10(n-1)\r\nend = 10n\r\nfound = False\r\nfor i in range(start,end):\r\n if i%t == 0:\r\n print(i)\r\n found = True\r\n break\r\n \r\nif found == False:\r\n print(-1)\r\n", "n, t = map(int, input().split())\r\nif t < 10:\r\n print(nstr(t))\r\nelse:\r\n print(-1 if n < 2 else \"1\"(n-1)+\"0\")", "def f(n, t):\r\n b = 10 (n - 1)\r\n c = 10 n\r\n for i in range(b, c):\r\n if i % t == 0:\r\n return i\r\n return -1\r\n\r\na = list(map(int, input().split()))\r\nn = a[0]\r\nt = a[1]\r\nprint(f(n, t))", "n,m=map(int,input().split())\r\ns=10*(n-1)\r\ns1=s+m-s%m\r\nif m==10 and n==1:print(-1)\r\nelse:print(s1)\r\n", "n,t=map(int,input().split())\r\nif n==1 and t==10:\r\n print('-1')\r\nelif n==1:\r\n print(t)\r\nelse:\r\n if t==10:\r\n s=str(t)+(n-2)'0'\r\n print(s)\r\n else:\r\n s = str(t) + (n - 1) * '0'\r\n print(s)\r\n", "a,b=map(int,input().split())\r\nstart=(\"1\"+(\"0\"(a-1)))\r\nre=-1\r\nwhile len(start)==a:\r\n if(int(start)%b==0):\r\n re=start\r\n break\r\n else:\r\n start=str(int(start)+1)\r\nprint(re)", "a=list(map(int,input().split()))\r\nb=a[0]\r\nc=str(a[1])\r\nif a==[1,10]:\r\n print(-1)\r\nelif a==[2,10]:\r\n print(10)\r\nelif a==[3,10]:\r\n print(100)\r\nelse:\r\n if b==1:\r\n print(c)\r\n elif c=='10':\r\n print(int(c+'0'(b-4)+c))\r\n else:\r\n print(int(c+'0'(b-2)+c))", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nlst = [int(x) for x in input().split()]\r\nn = lst[0]\r\nt = lst[1]\r\n\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n print(t,end=\"\")\r\n if t == 10:\r\n for i in range(n-2):\r\n print(0,end=\"\")\r\n else:\r\n for i in range(n-1):\r\n print(0,end=\"\")\r\n", "def find_number():\r\n n, m = map(int, input().split())\r\n a = (10n - 1) // m m\r\n return [-1, a][a > 0]\r\n\r\n# Пример использования\r\nresult = find_number()\r\nprint(result)\r\n", "n, t = map(int, input().split())\r\n\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n num = '1' + '0' * (n - 1)\r\n while int(num) % t != 0:\r\n num = str(int(num) + 1)\r\n if len(num) > n:\r\n print(-1)\r\n break\r\n else:\r\n print(num)\r\n", "n,t = map(int,input().split())\r\nb = 10(n-1)\r\nwhile b%t!=0:\r\n b+=1\r\nif n<len(str(t)):\r\n print(-1)\r\nelse:print(b)", "n,t = map(int,input().split())\r\nif n==1 and t>9:\r\n print(-1)\r\nelif t==10:\r\n print(10(n-1))\r\nelse:\r\n print(10 ** (n - 1)t)", "n,t=map(int,input().split())\r\nx=(t(int(str(9)n)//t))\r\nif x<=0:\r\n print(-1)\r\nelse:\r\n print(x)", "n, t = map(int, input().split())\nif n == 1 and t == 10:\n print(-1)\nelse:\n print(10 * (n - 1) // t * t + t)\n", "n,t = map(int,input().split())\r\nlen = 1\r\nfor i in range(1,n):\r\n len=10\r\nfor i in range(len,len10):\r\n if (i % t == 0):\r\n print(i)\r\n break\r\nelse:\r\n print(-1)", "# Link: https://codeforces.com/contest/584/problem/A\n\nn, t = list(map(int, input().split()))\n\nfirst = 10 (n - 1)\nlast = 10 (n)\nfound = True\n\nwhile first % t != 0:\n first += 1\n \n if first == last:\n found = False\n break\n \n\nif found:\n print(first)\nelse:\n print(-1)", "def readint():\r\n return int(input())\r\n \r\ndef readarray(typ):\r\n return list(map(typ, input().split()))\r\n\r\ndef main():\r\n n, t = readarray(int)\r\n if n < len(str(t)):\r\n print(-1)\r\n return\r\n \r\n pow10 = n - len(str(t))\r\n\r\n print(tpow(10, pow10))\r\n\r\nmain()", "op = False\r\nx = input()\r\nl = x.split()\r\nn = int(l[0])\r\nt = int(l[1])\r\nstart = int(\"1\"+\"0\"(n-1))\r\nend = int(\"1\"+\"0\"n)\r\nfor i in range(start , end):\r\n if i % t == 0 :\r\n op = True\r\n break\r\nif op :\r\n print(i)\r\nelse :\r\n print(-1)\r\n\r\n", "import math\nn,t = map(int, input().split())\n\nif t != 10:\n print(t(10(n-1)))\nelif n == 1 and t == 10:\n print(-1)\nelse:\n print(10(n-1))", "n, t =map(int, input().split())\r\n\r\n\r\nfor i in range(10(n-1), 10n):\r\n if i%t == 0:\r\n print(i)\r\n break\r\nelse:\r\n print(-1)\r\n", "o, r = map(int, input().split())\r\nif r == 10:\r\n if o == 1:\r\n print(-1)\r\n else:\r\n print(1,end=\"\")\r\n for i in range(0,o-1):\r\n print(0,end=\"\")\r\nelse:\r\n for i in range(0, o):\r\n print(r,end=\"\")", "n,t=list(map(int,input().split()))\r\ns=10(n-1)\r\nwhile len(str(s)) == n:\r\n if s%t==0:\r\n print(s)\r\n break\r\n s+=1\r\nelse:\r\n print(-1) ", "n, t = map(int, input().split())\r\nflag = 0\r\nfor i in range(10(n-1), 10*(n)):\r\n if i % t == 0:\r\n print(i)\r\n flag = 1\r\n break\r\nif flag == 0:\r\n print(-1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n N, T = map(int, input().split())\r\n\r\n answer:str = \"\"\r\n if N==1 and T==10 : answer = \"-1\"\r\n else :\r\n if T==10 : answer = \"1\"+(\"0\"(N-1))\r\n else : answer = str(T)N\r\n\r\n print(answer)\r\n\r\nmain()", "n,k = map(int,input().split())\r\nif len(str(k)) > n:\r\n print(-1)\r\nelse:\r\n print(k(((10*(n-1))//k)+1))", "n,t=map(int,input().split())\r\nt1=t\r\nif t==10:\r\n t1=1\r\n c=(n-2)str(t1)+str(t)\r\nelse:\r\n c=(n-1)str(t1)+str(t)\r\nif int(c)%t==0 and len(c)==n :\r\n print(c)\r\nelse:\r\n print(-1)", "n,t=map(int,input().split())\r\nif n==1 and t==10:\r\n print(-1)\r\nelif t==10:\r\n print(\"1\"+\"0\"(n-1))\r\nelse:\r\n print(str(t)n)", "n, t = [int(i) for i in input().split()]\r\nans = int(\"9\"n)\r\nif t > ans:\r\n ans = -1\r\nelse:\r\n while ans % t != 0:\r\n ans -= 1\r\nprint(ans)", "n,m = list(map(int,input().split()))\r\nx = str(m%10) * n\r\nif x=='0':\r\n print(-1)\r\nelif int(x) ==0:\r\n print(\"1\"+x[1:])\r\nelse:\r\n print(x)", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n n, t = map(int, input().split())\n if n > 1:\n if t == 10:\n print(10 ** (n - 1))\n else:\n print(t * (10 ** (n - 1)))\n else:\n if t == 10:\n print(-1)\n else:\n print(t)\n\n\nif __name__ == \"__main__\":\n main()\n", "n,t = input().split()\r\nn = int(n)\r\nwhile len(t) < n: t += '0'\r\nprint(-1 if len(t) > n else t)", "# LUOGU_RID: 101606173\na, b = map(int, input().split())\r\nif a == 1 and b == 10:\r\n print(-1)\r\nelse:\r\n print(str(b) + '0' * (a - len(str(b))))", "a = [int(s) for s in input().split()]\r\nx = 1\r\nresult = -1\r\n\r\nfor i in range(a[0]-1):\r\n x = 10\r\n\r\nfor i in range(x, x10):\r\n if i % a[1] == 0:\r\n result = i\r\n break\r\n \r\nprint(result)", "n, t = map(int, input().split())\nans = (10 ** n - 1) // t * t\nif ans > 0:\n print(ans)\nelse:\n print(-1)# 1690412458.136408", "\r\nn,l=map(int,input().split())\r\nfor i in range(10(n-1),10n):\r\n if i%l==0:\r\n print(i)\r\n exit()\r\nprint(-1)", "str=input()\narr=str.split(' ')\ncount=0\nn=int(arr[0])\nt=int(arr[1])\nstart=1\nend=10\nflag=0\nans=0\nif(n>1):\n start=start10(n-1)\n end=end10(n-1)\nfor i in range(start,end):\n if(i%t==0):\n ans=i\n flag=1\n break\nif(flag==0):\n print(\"-1\")\nelse:\n print(ans)\n \t \t \t \t \t\t\t\t \t\t \t\t\t \t\t", "def sol():\r\n n,t= map(int,input().split())\r\n if t == 10:\r\n if n == 1:print(-1)\r\n else :print(10(n-1))\r\n else:print(nstr(t))\r\n\r\n\r\nsol()\r\n \r\n \r\n \r\n", "n, t = map(int, input().split())\r\nnum = int('1' + '0' (n - 1))\r\nif t == 10:\r\n if n == 1:\r\n print(\"-1\")\r\n else:\r\n print(num)\r\nelse:\r\n print(num * t)\r\n\r\n\r\n\r\n\r\n", "import math\r\n\r\ninput1, input2 = input().split()\r\ninput1 = int(input1)\r\ninput2 = int(input2)\r\ndigits = math.floor(math.log(input2, 10)) + 1\r\nif(digits > input1):\r\n print(-1)\r\nelse:\r\n print(input2 * pow(10, input1 - digits))\r\n\r\n", "\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\nn, t = MII()\r\n\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n print(10(n-1) + t - ((10%t)(n-1))%t)\r\n \r\n\r\n\r\n\r\n", "n,t=map(int,input().split())\r\ns='9'n\r\nfor i in range(int(s),int('1'+'0'(n-1))-1,-1):\r\n if i%t==0:\r\n print(i)\r\n exit()\r\nprint(-1)", "n,t=map(int,input().split())\r\nif(10n <= t):\r\n print(-1)\r\nelse: \r\n print(10(n-1)+t-(10(n-1))%t)\r\n", "n, t = input().split(\" \")\r\nn = int(n)\r\nmin_number = len(t)\r\nt = int(t)\r\n\r\nif min_number > n:\r\n print(-1)\r\nelse:\r\n print(t, end=\"\")\r\n for i in range(n - min_number):\r\n print(0, end=\"\")\r\n \r\n", "n, t = map(int, input().split())\r\na = 10(n - 1 - (t > 9))\r\nprint([t * a, -1][a < 1])", "n, t = map(int, input().split())\r\nn = 10 ** n // 10\r\nif t >= n * 10:\r\n print(-1)\r\nelse:\r\n while n % t:\r\n n += 1\r\n print(n)", "a,b = map(int,input().split())\r\nif a == 0 or (a == 1 and b == 10) :\r\n print(-1)\r\nelse :\r\n if b == 10 :\r\n x = a-2\r\n print(str(b)+\"0\"x)\r\n else :\r\n string = str(b)\r\n print(stringa)", "n,t = map(int,input().split())\r\nstartt = 10 (n-1)\r\nresult = startt + t-startt % t\r\nif len(str(result))==n:\r\n print(result)\r\nelse:\r\n print(-1)", "n,t = map(int,input().split())\r\n\r\nres = 10(n-1)\r\n\r\nres = (res//t +1) * t\r\ntmp=res\r\ncnt=0\r\nwhile res:\r\n cnt = cnt+1\r\n res//=10\r\n\r\nif cnt>n:\r\n print(-1)\r\nelse:\r\n print(tmp)", "n,t=map(int,input().split())\r\ns=int('1'+'0'(n-1))\r\np=int('9'n)\r\nf=False\r\nfor i in range(s,p+1):\r\n if i%t==0:\r\n f=True\r\n break\r\nif f:\r\n print(i)\r\nelse:\r\n print(-1)", "input = (str(input().strip()))\n\nn, t = input.split()\n\nn, t = int(n), int(t)\n\nmin_range = 10 (n-1)\nmax_range = 10 (n)\n\nentered = False\nfor i in range(min_range, max_range):\n \n if i % t == 0:\n print(i)\n entered = True\n break\n \nif not entered:\n print (-1)\n\t \t\t\t\t\t\t\t\t\t\t \t \t\t\t \t\t\t", "a, s = map(int, input().split())\r\nd = 10 (a-1)\r\nwhile len(str(d)) == a:\r\n if d % s == 0:\r\n print(d)\r\n exit()\r\n else:\r\n d += 1\r\nprint('-1')", "n,t=map(int,input().split())\r\nn1=10(n-1)\r\ncount=0\r\nfor i in range(n1,n110):\r\n if i%t==0:\r\n print(i)\r\n count+=1\r\n break;\r\nif count==0:\r\n print(-1)\r\n ", "n,t = map(int,input().split())\r\na = int(\"1\"+(\"0\"n)) - 1\r\nif a >= t:\r\n a =a-a%t\r\n print(a)\r\nelse:print(-1)", "n,t=map(int,input().split())\r\nif t == 10:\r\n if n == 1 : print(-1)\r\n else:\r\n s=0\r\n for i in range(n-1):\r\n s=s10+1\r\n s=s10\r\n print(s)\r\nelse:\r\n s=0\r\n for i in range(n):\r\n s=s10+t\r\n print(s)\r\n ", "import math\r\nn,t = map(int, input().split())\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n kq = math.ceil(10(n-1)/t)t\r\n if len(str(kq)) == n:\r\n print(kq)\r\n else:\r\n kq = math.ceil(10*(n-1)2/t)t\r\n print(kq)", "a,b=map(int,input().split())\nm=10a-1\nif(m%b==0):\n ans=m\nelse:\n ans=(m-(m%b))\nif(ans>0):\n print(ans)\nelse:\n print(-1)\n", "n, t = map(int, input().split())\r\nif t < 10:\r\n print(str(t) n)\r\nelif len(str(t)) <= n:\r\n print(10 (n - 1))\r\nelse:\r\n print(-1)", "a,b=map(int,input().split())\r\nx=10(a-1)\r\ny=x%b\r\nz=(x+b-y)\r\nif len(str(z))!=a:\r\n print(-1)\r\nelse:\r\n print(z)", "n,t=map(int, input().split())\r\ni=10(n-1)\r\nm=10n\r\nwhile i<m:\r\n if i%t==0:\r\n print(i)\r\n break\r\n else:\r\n i+=1\r\n if i==m:\r\n print(\"-1\")\r\n break", "n, t = map(int, input().split(\" \"))\nresult = 0\nif t == 10:\n result = t(10(n-2))\nelse:\n result = t(10(n-1))\nif result >= t and len(str(result)) == n:\n print(result)\nelse:\n print(-1)", "n,t = map(int,input().split())\r\n\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n initial = 10(n-1)\r\n r = initial % t\r\n print(initial + (t - r))\r\n", "# https://codeforces.com/problemset/problem/584/A\r\n\r\nn, t = [int(x) for x in input().split()]\r\n\r\nif t == 10:\r\n if n == 1:\r\n print(-1)\r\n else:\r\n print('1'(n-1)+'0')\r\nelse:\r\n print(str(t)n)\r\n", "n , t = map(int,input().split())\r\nif(t==10):\r\n if(n==1):\r\n print(-1)\r\n else:\r\n print(10*(n-1))\r\nelse:\r\n for i in range(n):\r\n print(t,end=\"\")", "n, t = map(int, input().split())\ntemp = 1 10(n-1)\nif temp % t:\n temp += t - temp % t\n\ns = str(temp)\nprint(temp if len(s) == n else -1)", "x , y = map(int,input().split())\r\nanswer = 0\r\nnum = 0\r\nif 10x - 1 < y:\r\n print(-1)\r\n exit()\r\nelse:\r\n for i in range(10(x-1),10(x)):\r\n if i%y == 0 and num == 0:\r\n answer = i\r\n num+=1\r\n break\r\nprint(answer)", "n,t = map(int,input().split())\r\nif n==1 and t==10 :\r\n print(-1)\r\nelse :\r\n n= 10(n-1)\r\n while n%t != 0 : #减少时长，避免超时\r\n n+=1\r\n print(n)\r\n", "n, t = map(int,input().split())\r\nif 10(n-1)%t == 0:\r\n print(10(n-1))\r\nelse:\r\n if ((10(n-1)//t) + 1)t < 10(n):\r\n print(((10(n-1)//t) + 1)t)\r\n else:\r\n print('-1')", "lenght , div = map(int,input().split())\r\ndiv = str(div)\r\nif lenght < len(div) : quit(print(-1))\r\nnum = div + (\"\".join([\"0\"] * (lenght - len(div))))\r\nprint(num)", "import math\n\ndef main():\n n, t = map(int, input().split())\n if t == 10:\n if n == 1:\n print(-1)\n else:\n print(1, end=\"\")\n for i in range(1, n):\n print(0, end=\"\")\n print()\n else:\n for i in range(0, n):\n print(t, end=\"\")\n print()\n\n\nmain()\n", "number_of_digits, divisor = map(int, input().split())\n\ninferior_limit = 10 (number_of_digits - 1)\n\nupper_limit = 10 number_of_digits - 1\n\nrest_of_division_between_first_number_and_divisor = inferior_limit % divisor\n\nnumber_with_digits_and_divisible = inferior_limit + (divisor - rest_of_division_between_first_number_and_divisor\n if rest_of_division_between_first_number_and_divisor != 0 else 0)\n\nprint(number_with_digits_and_divisible if number_with_digits_and_divisible <= upper_limit else -1)\n", "a,b=map(int,input().split())\r\ns='1'\r\nk='10'\r\nl=0\r\nwhile len(s)<a:\r\n s+='0'\r\n k+='0'\r\nfor i in range(int(s),int(k)):\r\n if i%b==0:\r\n l+=1\r\n print(i)\r\n break\r\nif l==0:\r\n print(-1)\r\n", "n, t = [int(x) for x in input().split()]\r\nnum = 10n - 1\r\nif num < t:\r\n num = -1\r\nelse:\r\n num = num - (num % t)\r\nprint(num)", "n, t = map(int, input().split())\r\nlow = 10 (n - 1)\r\nhigh = 10 n - 1\r\nrem = high % t\r\nnum = high - rem if (high - rem) >= low else -1\r\nprint(num)", "n, t = map(int,input().split())\r\nres = 10(n-1) \r\nwhile(res%t != 0):\r\n res+=1\r\nif len(str(res)) > n:\r\n print(-1)\r\nelse:\r\n print(res)", "n, t = map(int, input().split())\r\nif int(\"9\"n) >= t:\r\n print((int(\"9\"n)//t)t)\r\nelse:\r\n print(-1)\r\n", "n, t = list(int(num) for num in input().split())\r\n\r\nif t < 10:\r\n print(list(t for i in range(n)), sep = '')\r\nelse: \r\n if n == 1:\r\n print(-1)\r\n else:\r\n print(list(1 for i in range(n - 1)), 0, sep = '')", "n,t=map(int,input().split())\r\nnum=1\r\na=n\r\nn-=1\r\nwhile n>0:\r\n num=num10\r\n n-=1\r\ni=num\r\nans=0\r\nwhile len(str(i))==a:\r\n if i%t==0:\r\n print(i)\r\n ans=1\r\n break\r\n i+=1\r\nif ans==0:\r\n print(-1)", "n, m = map(int, input().split())\r\np = 10*(n-1)\r\nl = -1\r\n\r\nfor i in range(p, p10):\r\n if p%m == 0:\r\n l = p\r\n break\r\n else:\r\n p+=1\r\nprint(l)", "i = [int(x) for x in input().split()]\nn, t = i[0], i[1]\n\nis_ten = False\nif t == 10:\n is_ten = True\n\nif n == 1 and t == 10:\n print(-1)\nelse:\n result = t * (10 (n - 1 - is_ten))\n print(result)\n", "a,b=map(int,input().split())\r\ng=10(a-1)\r\nwhile(len(str(g))<=a):\r\n if g%b==0:\r\n print(g)\r\n break\r\n else:\r\n g=g+1\r\nif len(str(g))>a:\r\n print(-1)", "n,t=map(int,input().split())\r\nnumber0=int('9'n)\r\nremainder=number0%t\r\nnumber1=number0-remainder\r\nif len(str(number1))==n and number1>0:\r\n print(number1)\r\nelse:\r\n print(-1)", "\r\na,b=map(int,input().split())\r\nfor i in range(10(a-1),10a):\r\n if i%b==0:\r\n print(i)\r\n break\r\n else:\r\n continue\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "n, t = map(int, input().split())\r\n\r\nanswer = 10 * (n - 1) // t * t + t\r\nif answer < 10 ** n:\r\n print(answer)\r\nelse:\r\n print(-1)\r\n", "n, t = list(map(int, input().strip().split()))\n\nif t == 10 and n == 1:\n print(-1)\nelse:\n if t < 10:\n p = n - 1\n print(t * 10*p)\n else:\n p = n - 2\n print(t 10*p)\n\t \t \t\t\t\t\t\t \t\t\t\t\t\t \t\t \t\t", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nn,t = li()\r\n\r\nif t != 10:\r\n print(nstr(t))\r\nelif t == 10 and n == 1:\r\n print(-1)\r\nelse:\r\n print('10'.ljust(n,'0'))", "n,t = map(int,input().split())\r\nif(n == 1 and t != 10):\r\n print(t)\r\nelif(n == 1):\r\n print(-1)\r\nelif(t == 10):\r\n print('1'+'0'(n-1))\r\nelse:\r\n print(str(t)n)", "n, t = map(int, input().split())\r\nstart = 10(n-1)\r\nend = 10n\r\nres=0\r\nfor i in range(start, end):\r\n if i%t==0:\r\n res = i\r\n print(i)\r\n break\r\nif res==0:\r\n print(-1)", "def main():\r\n n, t = input().split()\r\n \r\n if n == \"1\" and t == \"10\":\r\n print(\"-1\")\r\n return\r\n \r\n number = \"0\"int(n)\r\n print(t[0],number[1:],sep=\"\")\r\n \r\nmain()", "n,t = map(int, input().split())\r\n \r\nif n==1 and t==10:\r\n print(\"-1\")\r\nelif t==10:\r\n print(10(n-2) t)\r\nelse:\r\n print(10*(n-1) t)", "n, t = (int(i) for i in input().split())\nres = t\nwhile len(str(res)) < n:\n res = t\nres = res if len(str(res)) == n else -1\nprint(res)\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Fri Apr 7 16:24:55 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\na,b=map(int,input().split())\r\nnum=10(a-1)\r\nrem=num%b\r\nres=num+b-(num%b)\r\nif a==1 and b==10:\r\n res=-1\r\n\r\nprint(res)", "length,divider=map(int,input().split())\r\nstarting=\"1\"\r\nending=\"\"\r\nresult=False\r\n\r\nfor i in range(length-1):\r\n starting+=\"0\"\r\nfor i in range(length):\r\n ending+=\"9\"\r\nfor i in range(int(starting),int(ending)+1):\r\n if i%divider==0:\r\n result=True\r\n print(i)\r\n break\r\n \r\nif result==False:\r\n print(-1)", "n, t = map(int, input().split())\r\nnum = 10 * (n - 1)\r\nif num%t == 0:\r\n print(num)\r\nelse:\r\n a = num // t + 1\r\n num = a * t\r\n if len(str(num)) == n:\r\n print(num)\r\n else:\r\n print(-1)", "n = input()\r\nt = [int(i) for i in n.split() if i.isdigit()]\r\nrem = (10(t[0]-1))%t[1]\r\nif 10(t[0]-1) + t[1] - rem < 10t[0]:\r\n print(10(t[0]-1) + t[1] - rem)\r\nelse:\r\n print(-1) \r\n#print(rem)", "\r\ndef solve() : \r\n n,t=map(int,input().split())\r\n temp=10*(n-1) \r\n start=0\r\n while temp>0:\r\n start=start10+1\r\n temp=temp//10\r\n end=10(n)-1\r\n for i in range(start,end+1):\r\n if (i%t==0):\r\n print(i)\r\n return\r\n \r\n print(-1)\r\n return\r\n\r\ndef main() : \r\n solve() \r\n return\r\n\r\n\r\nif __name__== \"__main__\" : \r\n main()", "n, t = map(int, input().split())\r\nx = ((10 n - 1) // t) * t\r\nprint(x if x else -1)\r\n", "n,t=map(int,input().split())\ntemp=10*(n)\n\nif n==1:\n if t>9:\n print(-1)\n else:\n print(t)\n\nelse:\n if temp%t == 0 :\n ans = temp-t\n else:\n ans=temp-temp%t\n print(ans)", "from math import \r\na,b=map(int,input().split())\r\nn=10(a-1)\r\nf=0\r\nfor i in range(1,11):\r\n if((n+i)%b==0 and floor(log10(n+i))+1==a):\r\n print(n+i)\r\n f=1\r\n break\r\nif(f==0):\r\n print(-1)", "n,m=map(int,input().split())\r\nc=0\r\nfor i in range(10(n-1),10n):\r\n if i%m==0:\r\n print(i)\r\n c+=1\r\n break\r\n else:\r\n continue\r\nif c==0:\r\n print(\"-1\")", "n,x = list(map(int,input().split()))\r\nz = 10(n-1)x if x<10 else 10(n-1)\r\nif z % x == 0:\r\n print(z)\r\nelse:\r\n print(-1)", "# Olesya and Rodion\r\ns = input().split(\" \")\r\nn,t = int(s[0]),int(s[1])\r\nx = 1\r\nfor i in range(n-1):\r\n x = 10\r\ni = x\r\nflag = False\r\nwhile i < x10:\r\n if i % t == 0:\r\n flag = True\r\n break\r\n else:\r\n i += 1\r\nif flag == True:\r\n print(i)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nif m==10:\r\n if n==1:\r\n print('-1')\r\n exit\r\n else:\r\n for i in range(n-1):\r\n print('1',end='')\r\n print('0')\r\nelse:\r\n for i in range(n):\r\n print(m,end='')", "import sys\r\n\r\na, b = map(int, input().strip().split())\r\nc = 10(a-1)\r\nif b == 10 and a < 2:\r\n print(-1)\r\n sys.exit(0)\r\n\r\nwhile True:\r\n if len(list(str(c))) == a and c % b == 0:\r\n print(c)\r\n sys.exit(0)\r\n c += 1", "def solve():\r\n pass # Placeholder for the solve function, implement it if needed\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # w(x) {\r\n # solve();\r\n # }\r\n a, b = map(int, input().split())\r\n ANS = None\r\n ans = b\r\n\r\n digits = 0\r\n while b != 0:\r\n digits += 1\r\n b //= 10\r\n\r\n a -= digits\r\n if a < 0:\r\n print(-1)\r\n else:\r\n mul = 10 * a\r\n final = ans * mul\r\n print(final)\r\n", "a,b = map(int,input().split())\r\nr = 10 a\r\nl = 10 (a-1)\r\nfor i in range(l,r):\r\n if i % b == 0 and i >= 0:\r\n print(i)\r\n break\r\nelse:\r\n print(-1)\r\n", "n, t = map(int, input().split())\r\n\r\nif t==10 and n<2:\r\n print(-1)\r\nelif t==10 and n>1:\r\n print(\"1\"(n-1) + \"0\")\r\nelse:\r\n print(f\"{t}\"n)", "''' Author : Kunj Gandhi '''\r\n\r\n'''Functions'''\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\n\r\n'''Code'''\r\nn,t = sp_inp()\r\nif(n==1 and t==10): print(-1)\r\nelse:\r\n val = 10(n-1)\r\n rem = val%t\r\n val = val-rem+t\r\n print(val)", "import sys\r\n\r\nINF = 2e18 + 99\r\n\r\nn, t = map(int, input().split())\r\n\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelif n == 1:\r\n print(t)\r\nelse:\r\n if t == 10:\r\n t = 1\r\n print(t, end='')\r\n for i in range(n-1):\r\n print(0, end='')\r\n print() # added to print a newline character at the end of the output\r\n", "n,t=map(int,input().split())\r\nif t==10:\r\n t=1\r\n if n==1:\r\n print(-1)\r\n exit(0)\r\nprint(10(n-1)t)", "n,t=map(int,input().split())\r\nif n==1 and t==10:\r\n print(-1)\r\nelse:\r\n print(t,end=\"\")\r\n if t==10:\r\n for i in range(n-2):\r\n print(0,end=\"\")\r\n else:\r\n for i in range(n-1):\r\n print(0,end=\"\")", "def main():\n n,d = map(int, input().split())\n start = 10 * (n-1)\n while start % d != 0:\n start += 1\n if len(str(start)) > n:\n print(-1)\n return 0\n print(start)\n return 0\nmain()", "\r\nimport math\r\nn, t = map(int, input().split())\r\n\r\nresult = None\r\n\r\nif n == 1:\r\n if t > 9:\r\n result = -1\r\n else:\r\n result = t\r\nelse:\r\n result = 10 (n - 1) + (t - ((10 (n - 1)) % t))\r\n\r\nprint(result)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, t = map(int, input().split())\r\ni = int('1' +'0' * (n - 1))\r\nj = int('1' +'0' * n)\r\n\r\nans = 0\r\nfor num in range(i, j):\r\n if num % t == 0:\r\n ans = num\r\n break\r\n\r\nprint(-1) if ans == 0 else print(ans)", "import sys\r\nn,x=map(int,input().split())\r\nm=str(x)\r\n\r\nif n < len(m):\r\n print(-1)\r\n sys.exit()\r\n\r\nfor i in range(len(m),n):\r\n m+=str(0)\r\n\r\nprint(m)", "n,t = map(int, input().split())\r\nres=10(n-1)\r\nflag=-1\r\nwhile res<10n:\r\n if res%t==0:\r\n flag=1\r\n if flag==1:\r\n break\r\n res=res+1\r\nif flag==1:\r\n print(res)\r\nelse:\r\n print(-1)\r\n \r\n ", "a,b = map(int, input().split())\r\n\r\nl = int(f\"{b}\" + \"0\"(a-len(str(b))))\r\nprint(l if len(str(l)) == a else -1)", "n,t = map(int,input().split())\r\nif t==10:\r\n if n==1:\r\n print(-1)\r\n else:\r\n s='1'\r\n for i in range(1,n):\r\n s=s+'0'\r\n print(int(s))\r\nelse:\r\n s=str(t)\r\n for i in range(1,n):\r\n s=s+'0'\r\n print(int(s))\r\n", "def main():\n take = input().split()\n number = int(\"1\"+\"0\"(int(take[0])-1))\n num = None\n while len(str(number)) == int(take[0]):\n if number % int(take[1]) == 0:\n num = number\n break\n number += 1\n if num == None:\n print(-1)\n else:\n print(num)\nmain()\n", "n , t = [int(x) for x in input().split()]\r\nnum = ((10 ** (n - 1) ) // t) * t \r\n\r\nif num == 10 (n - 1):\r\n print(num)\r\nelif num + t < 10 (n):\r\n print(num + t)\r\nelse:\r\n print(-1)", "n, t = input().split()\r\nn = int(n)\r\nwhile len(t) < n:\r\n t += '0'\r\nif len(t) > n:\r\n print(-1)\r\nelse:\r\n print(t)\r\n", "n,t=map(int,input().split())\r\nnum=1\r\n\r\nfor i in range(1,n):\r\n num=num10\r\n\r\np=num\r\nwhile p>0:\r\n if (p%t)==0:\r\n break\r\n p+=1\r\nif p<num10:\r\n print(p)\r\nelse:\r\n print(-1)", "n,t=map(int,input().split())\r\nif n==1 and t==10:\r\n print(-1)\r\nelif t==10:\r\n print(int(\"9\"n)-9)\r\nelse:\r\n print(int(str(t)n))", "a,b=map(int,input().split())\r\nc=(10*a)-1\r\nif len(str(b))>a:print(-1)\r\nelse:\r\n d=c%b\r\n print(c-d) ", "n, t = [a for a in input().split()]\r\ntl = list(t)\r\nif int(n) == 0:\r\n print(-1)\r\nelif len(tl) > int(n):\r\n print(-1)\r\nelse:\r\n newnum = int(t) 10(int(n) - len(tl))\r\n print(newnum)", "n,t=map(int,input().split())\r\nfor i in range(10(n-1),10*n):\r\n if i%t==0:\r\n print(i);exit()\r\nprint(-1)", "n,t=input().split()\r\nc=0\r\nif int(n)==18 and int(t)==10:\r\n print(\"111111111111111110\")\r\nelif int(n)==8 and int(t)==10:\r\n print(\"11111110\")\r\nelse:\r\n \r\n for i in range(int(str(9)int(n)),0,-1):\r\n if len(str(i))==int(n) and i%int(t)==0:\r\n \r\n c+=1\r\n break\r\n \r\n if c>0:\r\n print(i)\r\n else:\r\n print(\"-1\")\r\n ", "str_a = input()\nn , t = [int(x) for x in str_a.split(' ')]\n\nstart = 10(n-1)\nend = 10(n) - 1\nnum = start\nfound = False\nwhile num <= end:\n if num % t == 0:\n print(num)\n found = True\n break\n else:\n num += 1\n \nif not found:\n print(-1)\n \t \t \t \t \t\t \t \t\t \t \t\t \t", "n, t = list(map(int, input().split()))\r\nstart = '1' + '0' * (n - 1)\r\nstart = int(start)\r\nstart_2 = start\r\nwhile True:\r\n if start % t == 0:\r\n print(start)\r\n break\r\n else:\r\n start += 1 \r\n if start == start_2 * 10:\r\n print(-1)\r\n break", "z=[0 for i in range(10)]\r\nz[0]=1\r\ndef solve():\r\n q,w=map(int,input().split())\r\n a=10(q-1)\r\n while(a%w!=0):\r\n a+=1\r\n if len(str(a))==q and a%w==0:\r\n print(a)\r\n else:\r\n print(-1)\r\na=1\r\nfor i in range(a):\r\n solve()\r\n", "n,t=map(int,input().strip().split())\r\nend=10n-1;\r\nif(t>end):\r\n print(\"-1\")\r\nelse:\r\n rem=end%t\r\n ans=end-rem\r\n print(ans)", "\r\na = input()\r\n\r\nn = int(a.split()[0])\r\n\r\nt = int(a.split()[1])\r\n\r\nk1 = '1' + (n - 1) * '0'\r\n\r\nk2 = '1' + (n) * '0'\r\n\r\nk1 = int(k1)\r\nk2 = int(k2)\r\ni = k1 - (k1 % t) + t\r\nif (i < k2):\r\n print(i)\r\nelse:\r\n print(\"-1\")\r\n", "n,k = map(int,input().split())\r\nif n==1 and k==10:\r\n print(-1)\r\nelif k==10:\r\n print('1'+'0'(n-1))\r\nelse:\r\n print(str(k)n)", "import sys\r\n\r\nn, t = map(int, input().split())\r\n\r\nif n == 1 and t == 10:\r\n print(\"-1\")\r\n sys.exit()\r\n\r\nif t == 10:\r\n t = 1\r\n\r\nprint(t, end=\"\")\r\nfor i in range(1, n):\r\n print(\"0\", end=\"\")", "\r\n\r\n\r\nx , y = input().split()\r\n\r\n\r\n\r\n\r\nif(len(y) > int(x)):\r\n print(-1)\r\nelif(int(y) == 10):\r\n f =(int(int(x)-1))\r\n z = \"1\"f\r\n z = z + \"0\"\r\n print(z)\r\n\r\nelse:\r\n z = int(x) y\r\n print(z)", "n,t = map(int, input().split())\r\nnum = 10(n-1)\r\noffset = num % t\r\nans = num - offset + t\r\nif (ans >= 10n):\r\n print(-1)\r\nelse:\r\n print(ans)", "lst = input().split()\r\nn = int(lst[0])\r\nt = int(lst[1])\r\nfor i in range(pow(10, n-1), pow(10, n)):\r\n if i % t == 0:\r\n print(i)\r\n exit(0)\r\nprint(-1)", "n,t=map(int,input().split())\r\nprint(int((t10(n-2+(t!=10))+1)(t!=10n)-1))", "l=[int(i) for i in input().split()]\r\nn=l[0]\r\nt=l[1]\r\nnum=int(\"1\"+(n-1)\"0\")\r\nrem=num%t\r\nif rem==0:\r\n rem=t\r\nif len(str(t-rem+num))>n:\r\n print(-1)\r\nelse:\r\n print(str(t-rem+num))", "\r\nn,t = map(int,input().split())\r\n\r\nif len(str(t)) > n:\r\n print(-1)\r\n\r\nelse:\r\n m = 10n - 1\r\n a = m % t\r\n z = m - a\r\n print(z)", "n, t = map(int, input().split())\r\n\r\n#if 10n-1 < t:\r\n# print(-1)\r\n#else:\r\n# print((10*n-1)//tt)\r\n\r\nif t<10:\r\n print(t if n==1 else t(10(n-1))+t)\r\nelse:\r\n print(-1 if n==1 else 10(n-1)+t)", "n, t = map(int,input().split())\r\na=(10n-1)//tt\r\nprint([-1, a][a>0])\r\n", "while True:\r\n n,t = map(int,input().split())\r\n if n == 1 and t == 10:\r\n print('-1')\r\n break\r\n elif n >= 2 and t == 10:\r\n print('1'(n-1)+'0')\r\n break\r\n else:\r\n print(str(t)n)\r\n break\r\n", "n, k = list( map(int, input().split()) )\r\n\r\nif k == 10:\r\n if n == 1:\r\n print(-1)\r\n else:\r\n print('1', '0'(n-1), sep='')\r\nelse:\r\n print(str(k)n)\r\n", "from sys import stdin;input = lambda: stdin.readline().rstrip('\\r\\n')\r\nn,t = map(int,input().split())\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelif t == 10:\r\n print('1'(n - 1) + \"0\")\r\nelse:\r\n print(str(t)n)\r\n", "n,m=map(int,input().split())\r\na=(10*n-1)//mm\r\nprint([-1,a][a>0])", "lst = list(map(int, input().split()))\r\nn = lst[0]\r\nt = lst[1]\r\nif (lst[0] == 1 and lst[1] == 10):\r\n print(-1)\r\nelse:\r\n print(10(n-1) + (t - (10(n-1))%t))", " \r\nuser_input = [int(x) for x in input().split()]\r\nsize = user_input[0]\r\ndivisible = user_input[1]\r\n\r\nlower_limit = int(\"1\" + ((\"0\") * (size-1)))\r\nupper_limit = int(\"1\" + ((\"0\") * (size)))\r\n\r\nvalues = []\r\nfor i in range(lower_limit, upper_limit):\r\n if i % divisible == 0:\r\n print(i)\r\n values.append(i)\r\n break\r\n\r\nif len(values) == 0:\r\n print(-1)\r\n\r\n", "n, t = map(int, input().split())\r\nif n < len(str(t)):print(-1)\r\nelse:print(str(t) + ('0' * (n - len(str(t)))))\r\n", "l=input()\r\nll=l.split(' ')\r\nn=int(ll[0])\r\nt=int(ll[1])\r\nflag=True\r\nnum=10(n-1)\r\nwhile(flag):\r\n if 10n<=t:\r\n num=-1\r\n flag=False\r\n else:\r\n if (num%t==0 and num<10*n):\r\n flag=False\r\n else:\r\n num=num+1\r\n\r\nprint(num)", "n, t = [int(k) for k in input().split()]\nif (n == 1 and t == 10):\n print(\"-1\")\n exit()\nr = 1\nwhile n != 1:\n r = 10\n n -= 1\nwhile r % t != 0:\n r += 1\nprint(r)\n", "n,t=map(int,input().split())\r\nz=0\r\nt=str(t)\r\nif n==1 and t=='10':\r\n z=1\r\nelif t=='10':\r\n for i in range(int(n)-2):\r\n t+='0'\r\nelse:\r\n for i in range(int(n)-1):\r\n t+='0'\r\nif(z==0):\r\n print(t)\r\nelse:\r\n print('-1')\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Sep 13 15:14:35 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn, t = map(int, input().split())\r\nif (res := 10(n-1) % t) == 0:\r\n print(10(n-1))\r\nelif (ans := 10(n-1) + t - res) < 10n:\r\n print(ans)\r\nelse:\r\n print(-1)" ]	{"inputs": ["3 2", "2 2", "4 3", "5 3", "10 7", "2 9", "18 8", "1 5", "1 10", "100 5", "10 2", "18 10", "1 9", "7 6", "4 4", "14 7", "3 8", "1 3", "2 8", "3 8", "4 3", "5 9", "4 8", "3 4", "9 4", "8 10", "1 6", "20 3", "15 10", "31 4", "18 9", "72 4", "76 8", "12 5", "54 5", "96 10", "15 9", "100 2", "99 3", "98 4", "97 5", "100 6", "99 7", "98 8", "97 9", "100 10", "3 10", "2 4", "2 10", "10 10", "4 10", "25 10", "50 10", "5 10", "99 10", "100 10", "1 2", "20 10", "99 7", "89 5", "6 10", "3 8", "1 9", "1 4", "100 7"], "outputs": ["222", "22", "3333", "33333", "7777777777", "99", "888888888888888888", "5", "-1", "5555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555", "2222222222", "111111111111111110", "9", "6666666", "4444", "77777777777777", "888", "3", "88", "888", "3333", "99999", "8888", "444", "444444444", "11111110", "6", "33333333333333333333", "111111111111110", "4444444444444444444444444444444", "999999999999999999", "444444444444444444444444444444444444444444444444444444444444444444444444", "8888888888888888888888888888888888888888888888888888888888888888888888888888", "555555555555", "555555555555555555555555555555555555555555555555555555", "111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111110", "999999999999999", "2222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222", "333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333", "44444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444", "5555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555", "6666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666", "777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777", "88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888", "9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999", "1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111110", "110", "44", "10", "1111111110", "1110", "1111111111111111111111110", "11111111111111111111111111111111111111111111111110", "11110", "111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111110", "1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111110", "2", "11111111111111111110", "777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777", "55555555555555555555555555555555555555555555555555555555555555555555555555555555555555555", "111110", "888", "9", "4", "7777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777"]}	UNKNOWN	PYTHON3	CODEFORCES	308
8ca09bef1240e1e23975c668191930e4	Headquarters	Sensation, sensation in the two-dimensional kingdom! The police have caught a highly dangerous outlaw, member of the notorious "Pihters" gang. The law department states that the outlaw was driving from the gang's headquarters in his car when he crashed into an ice cream stall. The stall, the car, and the headquarters each occupies exactly one point on the two-dimensional kingdom. The outlaw's car was equipped with a GPS transmitter. The transmitter showed that the car made exactly n movements on its way from the headquarters to the stall. A movement can move the car from point (x,<=y) to one of these four points: to point (x<=-<=1,<=y) which we will mark by letter "L", to point (x<=+<=1,<=y) — "R", to point (x,<=y<=-<=1) — "D", to point (x,<=y<=+<=1) — "U". The GPS transmitter is very inaccurate and it doesn't preserve the exact sequence of the car's movements. Instead, it keeps records of the car's possible movements. Each record is a string of one of these types: "UL", "UR", "DL", "DR" or "ULDR". Each such string means that the car made a single movement corresponding to one of the characters of the string. For example, string "UL" means that the car moved either "U", or "L". You've received the journal with the outlaw's possible movements from the headquarters to the stall. The journal records are given in a chronological order. Given that the ice-cream stall is located at point (0,<=0), your task is to print the number of different points that can contain the gang headquarters (that is, the number of different possible locations of the car's origin). The first line contains a single integer n (1<=≤<=n<=≤<=2·105) — the number of the car's movements from the headquarters to the stall. Each of the following n lines describes the car's possible movements. It is guaranteed that each possible movement is one of the following strings: "UL", "UR", "DL", "DR" or "ULDR". All movements are given in chronological order. Please do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin and cout stream or the %I64d specifier. Print a single integer — the number of different possible locations of the gang's headquarters. Sample Input 3 UR UL ULDR 2 DR DL Sample Output 9 4	[ "n = int(input())\r\nr = 1; c = 1\r\nfor i in range(n):\r\n s = input()\r\n if (len(s) == 4):\r\n r += 1; c += 1\r\n elif(s == \"UL\" or s == \"DR\"):\r\n r += 1\r\n else:\r\n c += 1\r\nprint(r * c)", "#!/usr/local/bin/python3\n\nn = int(input())\n\nw = 1\nh = 1\n\nfor _ in range(n):\n s = input()\n if s == 'ULDR':\n w += 1\n h += 1\n continue\n if s == 'UR' or s == 'DL':\n w += 1\n continue\n h += 1\n\nprint(w * h)\n", "def main():\n a = b = 1\n for _ in range(int(input())):\n s = input()\n if s in (\"UL\", \"DR\"):\n a += 1\n elif s in (\"UR\", \"DL\"):\n b += 1\n elif s == \"ULDR\":\n a += 1\n b += 1\n print(a * b)\n\n\nif __name__ == '__main__':\n main()\n", "import math,sys\r\n#from itertools import permutations, combinations;import heapq,random;\r\nfrom collections import defaultdict,deque\r\nimport bisect as bi\r\ndef yes():print('YES')\r\ndef no():print('NO')\r\n#sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');\r\ndef I():return (int(sys.stdin.readline()))\r\ndef In():return(map(int,sys.stdin.readline().split()))\r\ndef Sn():return sys.stdin.readline().strip()\r\n#sys.setrecursionlimit(1500)\r\ndef dict(a):\r\n d={} \r\n for x in a:\r\n if d.get(x,-1)!=-1:\r\n d[x]+=1\r\n else:\r\n d[x]=1\r\n return d\r\ndef find_gt(a, x):\r\n 'Find leftmost value greater than x'\r\n i = bi.bisect_left(a, x)\r\n if i != len(a):\r\n return i\r\n else: \r\n return -1\r\ndef main():\r\n try:\r\n n=I()\r\n a,b=1,1\r\n for i in range(n):\r\n s=Sn()\r\n if s=='UR' or s=='DL':\r\n a+=1\r\n if s=='UL' or s=='DR':\r\n b+=1\r\n if s=='ULDR':\r\n a+=1\r\n b+=1\r\n print(ab)\r\n except:\r\n pass\r\n \r\nM = 998244353\r\nP = 1000000007\r\n \r\nif __name__ == '__main__':\r\n # for _ in range(I()):main()\r\n for _ in range(1):main()\r\n#End#\r\n\r\n# **************** All The Best ***************** #" ]	{"inputs": ["3\nUR\nUL\nULDR", "2\nDR\nDL", "4\nUL\nUR\nDR\nDL", "10\nUL\nUL\nUL\nUL\nUL\nUL\nUL\nUL\nUL\nUL", "6\nUL\nDL\nDL\nUL\nUL\nDL", "1\nUL", "1\nUR", "1\nDR", "1\nDL", "1\nULDR", "2\nUL\nULDR", "4\nULDR\nUR\nULDR\nUR", "10\nUR\nDR\nUL\nDR\nUL\nULDR\nUR\nUL\nULDR\nUL", "4\nUL\nUR\nDR\nDL", "10\nUL\nUR\nUR\nDR\nDR\nDR\nDL\nDL\nDL\nDL", "6\nUR\nDL\nUR\nDL\nUR\nDL"], "outputs": ["9", "4", "9", "11", "16", "2", "2", "2", "2", "4", "6", "15", "45", "9", "35", "7"]}	UNKNOWN	PYTHON3	CODEFORCES	4
8cae00fef4c1eedada77f2a75ddf67f4	Inverse Function	Petya wrote a programme on C++ that calculated a very interesting function f(n). Petya ran the program with a certain value of n and went to the kitchen to have some tea. The history has no records concerning how long the program had been working. By the time Petya returned, it had completed the calculations and had the result. However while Petya was drinking tea, a sly virus managed to destroy the input file so that Petya can't figure out for which value of n the program was run. Help Petya, carry out the inverse function! Mostly, the program consists of a function in C++ with the following simplified syntax: - function ::= int f(int n) {operatorSequence}- operatorSequence ::= operator \| operator operatorSequence- operator ::= return arithmExpr; \| if (logicalExpr) return arithmExpr;- logicalExpr ::= arithmExpr<=><=arithmExpr \| arithmExpr<=<<=arithmExpr \| arithmExpr == arithmExpr- arithmExpr ::= sum- sum ::= product \| sum<=+<=product \| sum<=-<=product- product ::= multiplier \| product<=<=multiplier* \| product<=/<=multiplier- multiplier ::= n \| number \| f(arithmExpr)- number ::= 0\|1\|2\|... \|32767 The whitespaces in a operatorSequence are optional. Thus, we have a function, in which body there are two kinds of operators. There is the operator "return arithmExpr;" that returns the value of the expression as the value of the function, and there is the conditional operator "if (logicalExpr) return arithmExpr;" that returns the value of the arithmetical expression when and only when the logical expression is true. Guaranteed that no other constructions of C++ language — cycles, assignment operators, nested conditional operators etc, and other variables except the n parameter are used in the function. All the constants are integers in the interval [0..32767]. The operators are performed sequentially. After the function has returned a value other operators in the sequence are not performed. Arithmetical expressions are performed taking into consideration the standard priority of the operations. It means that first all the products that are part of the sum are calculated. During the calculation of the products the operations of multiplying and division are performed from the left to the right. Then the summands are summed, and the addition and the subtraction are also performed from the left to the right. Operations ">" (more), "<" (less) and "==" (equals) also have standard meanings. Now you've got to pay close attention! The program is compiled with the help of 15-bit Berland C++ compiler invented by a Berland company BerSoft, that's why arithmetical operations are performed in a non-standard way. Addition, subtraction and multiplication are performed modulo 32768 (if the result of subtraction is negative, then 32768 is added to it until the number belongs to the interval [0..32767]). Division "/" is a usual integer division where the remainder is omitted. Examples of arithmetical operations: Guaranteed that for all values of n from 0 to 32767 the given function is performed correctly. That means that: 1. Division by 0 never occures. 2. When performing a function for the value n<==<=N recursive calls of the function f may occur only for the parameter value of 0,<=1,<=...,<=N<=-<=1. Consequently, the program never has an infinite recursion. 3. As the result of the sequence of the operators, the function always returns a value. We have to mention that due to all the limitations the value returned by the function f is independent from either global variables or the order of performing the calculations of arithmetical expressions as part of the logical one, or from anything else except the value of n parameter. That's why the f function can be regarded as a function in its mathematical sense, i.e. as a unique correspondence between any value of n from the interval [0..32767] and a value of f(n) from the same interval. Given the value of f(n), and you should find n. If the suitable n value is not unique, you should find the maximal one (from the interval [0..32767]). The first line has an integer f(n) from the interval [0..32767]. The next lines have the description of the function f. In the description can be found extra spaces and line breaks (see the examples) which, of course, can’t break key words int, if, return and numbers. The size of input data can’t exceed 100 bytes. Output a single number — the answer to the problem. If there’s no answer, output "-1" (without quotes). Sample Input 17 int f(int n) { if (n < 100) return 17; if (n > 99) return 27; } 13 int f(int n) { if (n == 0) return 0; return f(n - 1) + 1; } 144 int f(int n) { if (n == 0) return 0; if (n == 1) return n; return f(n - 1) + f(n - 2); } Sample Output 99 1324588	[ "import sys\r\ny = int(input())\r\nlines = sys.stdin.read()\r\n \r\nmod = 32768\r\np1 = lines.find('{') + 1\r\np2 = lines.find('}')\r\nlines = lines[p1:p2].strip().replace('\\n', '').split(';')\r\nmp = {}\r\ncmd = \"def f(n):\\n\"\r\nfor line in lines:\r\n line = line.strip()\r\n if line == \"\":\r\n continue\r\n cmd += \"\\tif n in mp:\\n\\t\\treturn mp[n]\\n\"\r\n items = line.split(\"return\")\r\n pre, ex = \"\", items[-1].strip()\r\n \r\n if \"if\" in line:\r\n cmd += \"\\t\" + items[0].strip() + \":\\n\"\r\n pre = \"\\t\"\r\n \r\n cmd += pre + \"\\tmp[n] = \" + ex + \"\\n\"\r\n cmd += pre + \"\\tmp[n] %= mod \\n\"\r\n cmd += pre + \"\\treturn mp[n] \\n\"\r\ncmd = cmd.replace(\"/\", \"% mod //\")\r\nexec(cmd)\r\nans = -1\r\nfor x in range(mod):\r\n if f(x) == y:\r\n ans = x\r\nprint(ans)\r\n" ]	{"inputs": ["17\nint f(int n)\n{\nif (n < 100) return 17;\nif (n > 99) return 27;\n}", "13\nint f(int n)\n{\nif (n == 0) return 0;\nreturn f(n - 1) + 1;\n}", "144\nint f(int n)\n{\nif (n == 0) return 0;\nif (n == 1) return n;\nreturn f(n - 1) + f(n - 2);\n}", "32767\nint f(int n)\n{\nreturn n;\n}", "27926\nint f(int n)\n{\nreturn nn + 5n/3 + 19 * 1423;\n}", "1\nint f(int n)\n{\nif (n == 0) return 153/12+5;\nreturn 32767/n;\n}", "32\nint f(int n)\n{\nif (n == 0) return 1;\nreturn f(n - 1) * 7;\n}", "1\nint f(int n)\n{\nif (n == 0) return 1;\nreturn f(n - 1) * 7;\n}", "0\nint f(int n)\n{\nif (n < 2) return 1;\nreturn f(n - 1) + f(n - 2);\n}", "32\nint f(int n)\n{\nif (n < 2) return 1;\nreturn f(n - 1) + f(n - 2);\n}", "12351\nint f(int n)\n{\nif (n < 3) return n;\nreturn f(n - 1) * n + f(n - 2) + f(n - 3) / 5;\n}", "0\nint f(int n){if (n < 1) return 0;return f(f(f(f(f(f(f(f(f(f(f(f(f(f(f(f(f(0)))))))))))))))));}", "0\nint f(int n){if (n < 1) return 1;if (n < 2) return 0;return f(f(f(f(f(f(f(f(f(f(n-1))))))))));}", "1\nint f(int n){if (n < 1) return 1;if (n < 2) return 0;return f(f(f(f(f(f(f(f(f(f(n-1))))))))));}", "14\nint f(int n)\n{\nif (n < 1) return 0;\nreturn f(n / 2) + 1;\n}", "12\nint f(int n)\n{\nif (n < 1) return 0;\nreturn f(n / 2) + 1;\n}", "100\nint f(int n){if (n < 3) return 1;return f(n-1)+f(n-2)+f(n-3);}", "7113\nint f(int n)\n{\nif (n < 3) return n;\nreturn f(n - 1) * n + f(n - 2) + f(n - 3) / 5;\n}", "7169\nint f(int n){if (n < 7) return 1; return f(n-1)+f(n-2)+f(n-3)+f(n-4)+f(n-5)-f(n-6)-f(n-7);}", "32657\nint f(int n){if (n < 7) return 1; return f(n-1)+f(n-2)+f(n-3)+f(n-4)+f(n-5)-f(n-6)-f(n-7);}", "5\nint f(int n){if (n < 2) return 1;if (n < 8) return 2;if (n > 8) return 7;if (n > 2) return 5;}", "2\nint f(int n){if (n < 2) return 1;if (n < 8) return 2;if (n > 8) return 7;if (n > 2) return 5;}", "1\nint f(int n){if (n < 2) return 1;if (n < 8) return 2;if (n > 8) return 7;if (n > 2) return 5;}", "7\nint f(int n){if (n < 2) return 1;if (n < 8) return 2;if (n > 8) return 7;if (n > 2) return 5;}", "6\nint f(int n){if (n < 1025) return n5+12/6-n/315-7;return f(n/2)-f(n-7)f(n-7)-1024;}", "32763\nint f(int n){if (n < 1025) return n5+12/6-n/315-7;return f(n/2)-f(n-7)f(n-7)-1024;}", "280\nint f(int n){if (n < 1025) return n5+12/6-n/315-7;return f(n/2)-f(n-7)f(n-7)-1024;}", "1\nint f(int n){return 1;return 2;return 3;return 4;return 5;return 6;return 7;return 8;return 9;}", "2\nint f(int n){return 1;return 2;return 3;return 4;return 5;return 6;return 7;return 8;return 9;}", "3647\nint f(int n){return 123+234-345-456+567+nnn-n/2/4/5+n+1/2+396-12+17/76+1-1;}", "17463\nint f(int n){return 123+234-345-456+567+nnn-n/2/4/5+n+1/2+396-12+17/76+1-1;}", "17\nint f(int n){if (n > 1000) return n/n;if (n > 100) return n/2;if (n > 10) return n; return 7;}", "55\nint f(int n)\n{\nif (n < 2) return 0;if (f(n-1) == f(n-2)) return f(n-2)+1;return f(n-1);\n}", "3\nint f(int n)\n{\nif (n > 5) return 8;\nif (n < 3) return 1;\nreturn f(12/n/n)+1;\n}", "2\nint f(int n)\n{\nif (n > 5) return 8;\nif (n < 3) return 1;\nreturn f(12/n/n)+1;\n}", "354\nint f(int n)\n{\nif (n < 4) return 1;\nreturn f(n-1)f(n-2)f(n-3)f(n-4)+n;\n}", "9182\nint f(int n)\n{\nif (n < 4) return 1;\nreturn f(n-1)f(n-2)f(n-3)f(n-4)+n;\n}", "32767\nint f(int n)\n{\nif (n < 5) return 0-1;if (f(n/2)f(n-1) < 0) return f(n+28);return 10;\n}", "57\nint f(int n)\n{\nif (n/22 == n) return 1;\nif (n/22 == n-1) return 0;\nreturn 57;\n}", "1\nint f(int n)\n{\nif (n/22 == n) return 1;\nif (n/22 == n-1) return 0;\nreturn 57;\n}", "15\nint f(int n){if (n > 1) return f(n-2)/f(n-1)+15;if (n == 0) return 0;if (n == 1) return 1;}"], "outputs": ["99", "13", "24588", "32767", "29", "32767", "-1", "28672", "24575", "15959", "26464", "32767", "32767", "32766", "16383", "4095", "-1", "31277", "32258", "32308", "8", "7", "1", "32767", "-1", "1023", "32746", "32767", "-1", "23117", "9167", "17", "111", "-1", "5", "19794", "27142", "4", "-1", "32766", "32767"]}	UNKNOWN	PYTHON3	CODEFORCES	1
8cd687a88783833ff1c31127372696fe	George and Accommodation	George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory. George and Alex want to live in the same room. The dormitory has n rooms in total. At the moment the i-th room has pi people living in it and the room can accommodate qi people in total (pi<=≤<=qi). Your task is to count how many rooms has free place for both George and Alex. The first line contains a single integer n (1<=≤<=n<=≤<=100) — the number of rooms. The i-th of the next n lines contains two integers pi and qi (0<=≤<=pi<=≤<=qi<=≤<=100) — the number of people who already live in the i-th room and the room's capacity. Print a single integer — the number of rooms where George and Alex can move in. Sample Input 3 1 1 2 2 3 3 3 1 10 0 10 10 10 Sample Output 0 2	[ "n = int(input())\r\naccomodation = []\r\navailable = 0\r\n\r\nfor i in range(n):\r\n inhabitants, capacity = list(map(int, input().split()))\r\n accomodation.append((inhabitants, capacity))\r\n\r\n if capacity - inhabitants >= 2:\r\n available += 1\r\n else:\r\n continue\r\n\r\nprint(available)", "c = 0\r\nfor room in range(int(input())):\r\n p, q = map(int, input().split())\r\n if p + 2 <= q:\r\n c += 1\r\n else:\r\n c += 0\r\n\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def count_rooms_with_free_space(n, rooms):\r\n count = 0\r\n for i in range(n):\r\n pi, qi = rooms[i]\r\n if qi - pi >= 2:\r\n count += 1\r\n return count\r\n\r\n# Read input\r\nn = int(input())\r\nrooms = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Count the number of rooms with free space for George and Alex\r\nresult = count_rooms_with_free_space(n, rooms)\r\n\r\n# Print the output\r\nprint(result)\r\n", "n = int(input())\r\ncounter=0\r\nfor x in range(n):\r\n p ,q = map(int ,input().split())\r\n if (q-p)-2>=0:\r\n counter +=1\r\nprint(counter)", "n = int(input())\n\ncount = 0\nwhile n > 0:\n p, q = list(map(int, input().split(\" \")))\n if q - p >= 2:\n count+=1\n n-=1\nprint(count)", "n = int(input())\nans = 0\nfor i in range(n):\n a, b = input().split()\n a = int(a)\n b = int(b)\n if a+2 <= b:\n ans += 1\nprint(ans)\n\n\t \t\t \t \t\t \t\t\t \t \t\t\t \t\t\t\t \t \t\t", "n = int(input())\r\ncount = 0\r\nfor i in range(1,n+1):\r\n p,q = map(int,input().split())\r\n diff = abs(p-q)\r\n if diff >= 2:\r\n count+=1\r\nprint(count)", "t=int(input())\r\nk=0\r\nfor i in range(t):\r\n p,q=map(int,input().split())\r\n if(q-p>=2):\r\n k=k+1\r\nprint(k)", "x=int(input())\r\nc=0\r\nfor i in range(x):\r\n a,b=map(int,input().split())\r\n if (b-a)>=2:\r\n c+=1\r\nprint(c)", "s=0\r\nn = int(input())\r\nfor _ in range(n):\r\n lst = list(map(int,input().split()))[:2]\r\n if(lst[1]-lst[0]>=2):\r\n s+=1\r\nprint(s)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n string = input().split()\r\n p, q = int(string[0]), int(string[1])\r\n if q - p >= 2:\r\n count += 1\r\n else:\r\n continue\r\nprint(count)", "import sys\r\nn = int(input())\r\narr = []\r\ncounter = 0\r\nfor i in range(n):\r\n arr.append([int(i) for i in sys.stdin.readline().split()])\r\n \r\nfor i in range(len(arr)):\r\n if arr[i][1] - arr[i][0] >= 2:\r\n counter += 1\r\n \r\nprint(counter)", "t=int(input())\r\nc=0\r\nwhile(t):\r\n a,l=map(int,input().split())\r\n if((l-a)>1):\r\n c=c+1\r\n t=t-1\r\nprint(c)\r\n", "a=int(input())\r\nb=[]\r\nfor i in range(a):\r\n c=input().split()\r\n b.append(c)\r\ncount=0\r\nfor j in b:\r\n if (int(j[1])-int(j[0]))>=2:\r\n count+=1\r\nprint(count)", "n=int(input())\nans=0\nfor i in range(n):\n p,q=input().split()\n p=int(p)\n q=int(q)\n if (q-p) >= 2:\n ans += 1\nprint(ans)\n\t \t \t \t\t \t\t \t\t \t \t\t\t", "def accnumlist():\r\n return list(map(int, input().split()))\r\ndef accnums():\r\n return map(int, input().split())\r\ndef accstr():\r\n return input()\r\ndef accnum():\r\n return int(input())\r\n\r\nn = accnum()\r\nans = 0\r\nfor i in range(n):\r\n x, y = accnums()\r\n if y - x > 1:\r\n ans += 1\r\nprint(ans)\r\n", "num_of_rooms = int(input())\r\n\r\ncounter = 0\r\nfor i in range(num_of_rooms):\r\n exist, capacity = map(int, input().split())\r\n if exist <= (capacity-2):\r\n counter += 1\r\n\r\nprint(counter)", "n = int(input())\r\nc = 0\r\nfor i in range(n):\r\n p,r = list(map(int,input().split()))\r\n if r-p >= 2:\r\n c += 1\r\nprint(c)", "n = int(input())\r\ncounter = 0\r\nfor p_q in range(n):\r\n l = [int(x) for x in input().split()]\r\n counter += ((l[1] - l[0]) >= 2)\r\nprint(counter)", "rooms = int(input())\r\nc = 0\r\nfor i in range(rooms):\r\n people, cap = input().split()\r\n people = int(people)\r\n cap = int(cap)\r\n if (cap-people) >= 2:\r\n c = c + 1\r\nprint(c)\r\n ", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n a1,b1=input().split()\r\n a=int(a1)\r\n b=int(b1)\r\n if b-a>=2:\r\n c+=1\r\n else:\r\n continue\r\nprint(c)", "n = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n pi, qi = map(int,input().split())\r\n if qi -pi >=2:\r\n count +=1\r\nprint(count)", "n = int(input())\r\nrooms = 0\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n if (y - x) >= 2:\r\n rooms += 1\r\n else:\r\n pass\r\n\r\nprint(rooms)", "n = int(input())\r\nrooms = [tuple(map(int, input().split())) for _ in range(n)]\r\nprint(sum(1 for p, q in rooms if q - p >= 2))\r\n", "num = int(input())\r\n\r\ncount = 0\r\n\r\nfor i in range(num):\r\n pq = [int(a) for a in input().split()]\r\n if pq[1] - pq[0] >=2:\r\n count +=1\r\n pq = []\r\n\r\nprint(count)", "n= int(input())\r\ncount = 0\r\nfor i in range(n):\r\n p,c=map(int,input().split())\r\n if c-p>=2:\r\n count+=1\r\nprint(count)", "room = int(input())\r\nlist = []\r\nfor i in range(room):\r\n number = input().split()\r\n for l in range(len(number)):\r\n list.append(int(number[l]))\r\n# print(list)\r\na = 0\r\nfor i in range(0, len(list), 2):\r\n if list[i+1] - list[i] >= 2:\r\n a = a + 1\r\nprint(a)", "n=int(input())\r\ncount=0\r\nwhile(n>0):\r\n n=n-1\r\n p,q=map(int,input().split())\r\n if(q-p>=2):\r\n count=count+1\r\nprint(count)", "n = int(input())\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n s = input().split()\r\n p = int(s[0])\r\n q = int(s[1])\r\n diff = abs(p - q)\r\n if (diff > 1):\r\n count += 1\r\n\r\nprint(count)", "N = int(input())\nX = 0\nfor i in range(1,N+1):\n P,Q = input().split()\n P = int(P)\n Q = int(Q)\n if (Q-P)>=2:\n X+=1\nprint(X)\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", "ctr = 0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n ctr+=1\r\nprint(ctr)\r\n", "RoomNo = int(input())\r\ncount = 0\r\n\r\nfor i in range(RoomNo):\r\n a, b = map(int, input().split())\r\n if b - a >= 2:\r\n count += 1\r\nprint(count)", "num = int(input())\r\ncount = 0\r\nfor i in range(num):\r\n x,y = input().split()\r\n if int(y) - int(x) >= 2:\r\n count += 1\r\nprint(count)", "n = int(input())\r\nfree_rooms = 0\r\nfor _ in range(n):\r\n p, q = (int(x) for x in input().split())\r\n if q - p >= 2:\r\n free_rooms += 1\r\nprint(free_rooms)\r\n", "n = int(input())\r\nx = 0\r\nfor i in range(n):\r\n c, m = input().split(\" \")\r\n if int(m) - int(c) >= 2:\r\n x += 1\r\nprint(x)\r\n", "t=int(input())\r\ncount=0\r\nfor i in range(t):\r\n ls=list(map(int,input().split()))\r\n k=ls[0]\r\n j=ls[-1]\r\n if abs(k-j)>=2:\r\n count+=1\r\nprint(count)", "t= int(input())\r\nres=0\r\nfor i in range(t):\r\n p,q=[int(x) for x in input().split()]\r\n if q-p>=2:\r\n res+=1\r\nprint(res)", "rooms = int(input())\r\nrooms_arr = []\r\ncalc = 0\r\nfor i in range(rooms):\r\n people_in_room, capacity_of_room = map(int, input().split())\r\n room = capacity_of_room - people_in_room\r\n rooms_arr.append(room)\r\ncounter = 0\r\nfor j in rooms_arr:\r\n if j >= 2:\r\n counter += 1\r\nprint(counter)", "numberofrooms=int(input())\r\ni=0\r\nfor x in range(numberofrooms):\r\n a=input().split()\r\n peopleliving=int(a[0])\r\n peopleaccomodation=int(a[1])\r\n if peopleaccomodation-peopleliving>=2:\r\n i+=1\r\nprint(i)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n p, q = map(int, input().split())\r\n if q-p >=2:\r\n s=s+1\r\nprint(s);\r\n", "n=int(input())\r\npairs=[]\r\ncount=0\r\nfor i in range(n):\r\n l,c=map(int,input().split())\r\n pairs.append((l,c))\r\n\r\nfor (l,c) in pairs:\r\n if c>= (l+2):\r\n count+=1\r\n\r\nprint(count)", "# https://codeforces.com/problemset/submit\r\n\r\nn = int(input())\r\n\r\nc = 0\r\nfor i in range(n):\r\n p, q = [int(x) for x in input().split()]\r\n if p < q -1:\r\n c += 1\r\nprint(c)\r\n", "number_of_rooms = int(input())\r\n\r\nvalid_room_count = 0\r\nwhile number_of_rooms > 0:\r\n current, full = [int(i) for i in input().split()]\r\n if full - current >= 2:\r\n valid_room_count += 1\r\n\r\n # ---\r\n number_of_rooms -= 1\r\n\r\nprint(valid_room_count)\r\n", "n = int(input())\n\nans = 0\nfor i in range(n) :\n p , q = input().split()\n p = int(p)\n q = int(q)\n c = q - p\n if c >= 2 :\n ans += 1\n\nprint(ans)\n\n\t \t \t \t\t \t\t\t \t\t \t \t\t\t \t\t", "t = int(input())\r\nc = 0\r\nfor _ in range(0,t):\r\n l = list(int(x) for x in input().split())\r\n if l[1]-l[0] >= 2:\r\n c+=1\r\nprint(c)", "n = int(input())\r\ncount = 0\r\nfor i in range(0, n):\r\n p, q = input().split()\r\n if (int(q)-int(p)) >= 2: count +=1\r\n\r\nprint(count)", "n = int(input())\r\nr = 0\r\nfor i in range(n):\r\n p, q = input().split()\r\n if int(q) - int(p) >= 2:\r\n r += 1\r\n\r\nprint(r)\r\n", "no_of_ways = 0\r\nfor _ in range(int(input())):\r\n\tp, a = map(int, input(). split())\r\n\tif a-p>=2:\r\n\t\tno_of_ways += 1\r\nprint(no_of_ways)\r\n", "n = int(input())\r\nrooms = 0\r\n\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n if q - p >= 2:\r\n rooms += 1\r\n\r\nprint(rooms)\r\n", "n = int(input()) # Number of rooms\r\ncount = 0 # Initialize the count of rooms with free space\r\n\r\nfor _ in range(n):\r\n p, q = map(int, input().split()) # People already in the room and room's capacity\r\n if q - p >= 2: # There is free space for both George and Alex\r\n count += 1\r\n\r\nprint(count)\r\n", "c=0\r\nfor i in range(int(input())):\r\n l=list(map(int,input().split()))\r\n if(l[0]<l[1] and (l[1]-l[0])>=2):\r\n c+=1\r\nprint(c)\r\n \r\n\r\n", "count = input()\r\nanswer = 0\r\n\r\nfor x in range(int(count)):\r\n\r\n rooms= input()\r\n rooms_list = list(map(int,rooms.split()))\r\n\r\n if rooms_list[1] - rooms_list[0] >= 2:\r\n answer = answer + 1\r\n \r\nprint(answer)\r\n", "inp = int(input())\r\nres = 0\r\nfor i in range(inp):\r\n p,q = map(int,input().split())\r\n if q-p >= 2:\r\n res += 1\r\nprint(res)", "a=int(input())\r\nb=0\r\nfor i in range(a):\r\n x,y=input().split()\r\n x=int(x)\r\n y=int(y)\r\n if y - x >= 2:\r\n b+=1\r\n\r\nprint(b)", "n=int(input())\r\nd=0\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n if(a[1]-a[0]>=2):\r\n d=d+1\r\n a=[]\r\nprint(d)", "n = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n if q-p >= 2:\r\n count += 1\r\n else:\r\n continue\r\nprint(count)\r\n", "n=int(input())\r\nc=0\r\nfor i in range (n):\r\n a,b=map(int,input().split())\r\n if(a<b and b-a>=2):\r\n c=c+1\r\nprint(c)", "t = int(input())\r\nc = 0\r\nfor i in range(t):\r\n pp, cap = map(int, input().split())\r\n if cap - pp >= 2:\r\n c += 1\r\nprint(c)", "N=input()\nN=int(N)\nr=0\nfor i in range(1,N+1):\n p,q=input().split()\n p=int(p)\n q=int(q)\n if q-p>=2:\n r=r+1\nprint(r)\n\t \t\t\t\t \t \t \t\t\t\t \t \t \t \t\t", "n = int(input())\r\nnum_habit_libres = 0\r\nfor i in range(n):\r\n p,q = list(map(int,input().split()))\r\n if p < q and q - p > 1: \r\n num_habit_libres += 1\r\nprint(num_habit_libres)", "n = int(input())\r\np = []\r\nq = []\r\nk = 0\r\nfor i in range(n):\r\n p_i, q_i = map(int, input().split())\r\n p.append(p_i)\r\n q.append(q_i)\r\n if q_i - p_i >= 2:\r\n k += 1\r\nprint(k)\r\n", "# URL: https://codeforces.com/problemset/problem/467/A\nans = 0\nfor _ in range(int(input())):\n p, q = map(int, input().split())\n ans += (q - p) >= 2\nprint(ans)\n", "cnt = 0\r\nfor i in range(int(input())):\r\n p, q = map(int,input().split())\r\n if q - p >= 2:\r\n cnt += 1\r\nprint(cnt)", "c=0\r\np=int(input())\r\nfor i in range(p):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n c+=1\r\nprint(c)", "n = int(input())\r\n\r\ncol = 0\r\n\r\nfor i in range(n):\r\n p, q = map(int, input().split())\r\n \r\n if q - p >= 2:\r\n col += 1\r\nprint(col)", "n = int(input())\r\nr = 0\r\nfor i in range(n):\r\n p, q = [int(x) for x in input().split(\" \")]\r\n if q-p >= 2:\r\n r += 1\r\nprint(r)", "from sys import stdin\ninput = stdin.readline\n\n\nif __name__ == \"__main__\":\n n = int(input())\n data = [0] * n\n for i in range(n):\n p, q = map(int, input().split())\n data[i] = q-p > 1\n print(sum(data))\n\n\t\t \t\t \t\t \t\t\t\t\t \t\t\t \t \t \t\t", "raw=input()\r\ni=1\r\nn=0\r\nwhile i<=int(raw):\r\n a=input().split()\r\n b=int(a[1])-int(a[0])\r\n if b>=2:\r\n n+=1\r\n i+=1\r\nprint(n)", "i=int(input())\r\nc=0\r\nfor j in range(i):\r\n p,q=map(int, input().split())\r\n if((q-p)>=2):\r\n c=c+1\r\nprint(c)", "a=int(input())\r\nm=0\r\nfor i in range(0,a):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n m+=1\r\nprint(m)\r\n", "\r\nn=int(input())\r\nc=0\r\nfor i in range(n):\r\n pq_str=input()\r\n pq=pq_str.split()\r\n input_list = [int(element) for element in pq]\r\n p=input_list[0]\r\n q=input_list[1]\r\n if q-p >= 2:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nc = 0\r\nfor _ in range(n):\r\n p, q = input().split()\r\n p, q = int(p), int(q)\r\n c += 1 if q - p >= 2 else 0\r\nprint(c)", "num = int(input())\r\nflag = 0\r\ncount = 0\r\nfor i in range(num):\r\n p,q = list(map(int,input().split()))\r\n if p <= q-2:\r\n count = count + 1\r\n\r\nprint(count)", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\ncounter = 0\r\nn= int(input())\r\nfor i in range(n):\r\n lst = [int(x) for x in input().split()]\r\n p = lst[0]\r\n q = lst[1]\r\n if q - p >= 2:\r\n counter +=1\r\nprint(counter)\r\n", "n = int(input())\r\na=0 \r\n \r\nfor i in range(n):\r\n p, q = [ int(x) for x in input().split() ]\r\n if q-p>=2:\r\n a+=1\r\n \r\nprint(a)", "n=int(input())\r\ncnt=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if p+2<=q:\r\n cnt+=1\r\nprint(cnt)", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n if b - 2 >= a:\r\n k += 1\r\nprint(k)", "n = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n s,d =input().split(\" \")\r\n s = int(s)\r\n d = int(d)\r\n if d - s >= 2:\r\n cnt = cnt +1\r\n else:\r\n cnt = cnt\r\nprint(cnt)\r\n ", "a=int(input())\r\nc=0\r\nfor i in range(a):\r\n a1,b1=map(int,input().split())\r\n if(b1-a1>=2):\r\n c+=1\r\nprint(c)", "# 467a - George and Accommodation\r\n\r\nn = int(input())\r\ncount = 0\r\nfor i in range (n):\r\n p, q = list(map(int, input().split(' ')))\r\n if (q - p >= 2):\r\n count += 1\r\n \r\nprint(count)", "x = int(input())\r\n\r\nnum = 0\r\nfor i in range(x):\r\n y = list(map(int,input().split()))\r\n if y[1] - y[0] >= 2:\r\n num += 1\r\n\r\nprint(num) ", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Sep 26 10:20:32 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nn=int(input())\r\nsum=0\r\nfor i in range(n):\r\n list1=input().split()\r\n if int(list1[1])-int(list1[0])>=2:\r\n sum=sum+1\r\n else:pass\r\nprint(sum)", "# Read the number of rooms\r\nn = int(input())\r\n\r\n# Initialize a counter for rooms with enough capacity\r\nrooms_with_capacity = 0\r\n\r\n# Iterate through each room\r\nfor _ in range(n):\r\n # Read the number of people already in the room and its capacity\r\n pi, qi = map(int, input().split())\r\n \r\n # Check if there's enough capacity for George and Alex (2 people)\r\n if qi - pi >= 2:\r\n rooms_with_capacity += 1\r\n\r\n# Print the number of rooms with enough capacity\r\nprint(rooms_with_capacity)\r\n", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n pi, qi = map(int, input().split())\r\n if (qi-pi) >= 2:\r\n count += 1\r\nprint(count)", "n= int(input())\r\nc= 0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if q>= p+2:\r\n c+=1\r\n\r\nprint(c)", "def georgeandAccommodation():\r\n rooms = 0 \r\n n = int(input())\r\n for _ in range(n):\r\n p, q = map(int, input().split())\r\n if (q-p) >= 2: rooms = rooms + 1\r\n print(rooms)\r\n \r\ngeorgeandAccommodation()", "n = int(input())\n\nrooms = 0\nfor i in range(1,n+1):\n p,q = input().split()\n\n p = int(p)\n q = int(q)\n\n if q - p >= 2 and q >= 2:\n rooms += 1\n\nprint(rooms)\n\t\t\t \t \t\t\t \t\t\t \t\t \t \t \t\t", "n=int(input().strip())\r\nk=0\r\nfor i in range(n):\r\n a,b=list(map(int,input().strip().split()))\r\n if a+2<=b:\r\n k+=1\r\nprint(k)", "l=[]\r\nfor _ in range(int(input())):\r\n n,m=map(int,input().split())\r\n c=0\r\n if m-n>=2:\r\n c+=1\r\n l.append(c)\r\nprint(sum(l))", "def countFreeRooms(n, rooms):\r\n count = 0\r\n\r\n for room in rooms:\r\n p, q = room\r\n if q - p >= 2: # If there are at least 2 free places in the room\r\n count += 1\r\n\r\n return count\r\n\r\n# Read the number of rooms from input\r\nn = int(input().strip())\r\n\r\nrooms = []\r\n# Read the room information from input\r\nfor _ in range(n):\r\n p, q = map(int, input().strip().split())\r\n rooms.append((p, q))\r\n\r\n# Call the function and print the result\r\nresult = countFreeRooms(n, rooms)\r\nprint(result)\r\n", "#https://codeforces.com/problemset/problem/467/A\r\n\r\nnumber_rooms = int(input())\r\navailable_rooms = 0\r\nwhile number_rooms > 0:\r\n [p, q] = (int(x) for x in input().split(\" \"))\r\n if(abs(p - q) >=2):\r\n available_rooms += 1\r\n number_rooms -= 1\r\nprint(available_rooms)\r\n", "san = int(input())\r\ncount = 0\r\nfor i in range(san):\r\n line = input().split()\r\n if int(line[0])+2<=int(line[1]):\r\n count += 1\r\nprint(count)", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n k,l=map(int,input().split())\r\n if((l-k)>=2):\r\n c+=1\r\nprint(c)\r\n ", "n=int(input())\r\nnum=0\r\nfor _ in range(n):\r\n pq=input().split()\r\n p,q=int(pq[0]),int(pq[1])\r\n if q-p>=2:\r\n num+=1\r\nprint(num)\r\n \r\n\r\n\r\n", "case_num = int(input())\r\nrooms = 0\r\n\r\nfor pair in range(case_num):\r\n current, total = [int(x) for x in input().split()]\r\n available = total - current\r\n \r\n if available >= 2:\r\n rooms += 1\r\n\r\nprint(rooms)", "n = int(input())\r\nrooms_with_space = 0\r\n\r\nfor i in range(n):\r\n p, q = map(int, input().split())\r\n if q - p >= 2: # Check if there is space for George and Alex (at least 2)\r\n rooms_with_space += 1\r\n\r\nprint(rooms_with_space)\r\n", "def room_space(n):\r\n c=0\r\n for i in range(n):\r\n room_habitants = input()\r\n room_habitants = list(map(int, room_habitants.split()))\r\n if room_habitants[1]-room_habitants[0]>=2:\r\n c+=1\r\n return c\r\nnum=int(input())\r\nprint(room_space(num))", "n = int(input())\r\n\r\np = []\r\nq = []\r\ncount = 0\r\nfor i in range(n):\r\n pq = input().split()\r\n p.append(int(pq[0]))\r\n q.append(int(pq[1]))\r\n if q[i] - p[i] >= 2:\r\n count = count + 1\r\nprint(count)\r\n", "k = 0\r\nn = int(input())\r\nfor i in range(n):\r\n a = list(map(int, str(input()).split()))\r\n if a[1] - a[0] >= 2:\r\n k += 1\r\nprint(k)", "a=int(input())\r\nl=[]\r\nfor i in range(a):\r\n d=list(map(int,input().split()))\r\n l.append(d)\r\ncount=0\r\nfor i in range(len(l)):\r\n if(l[i][1]-l[i][0]>=2):\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n p,q = [int(x) for x in input().split(\" \")]\r\n\r\n if (p+2) <= q:\r\n count += 1\r\n\r\nprint(count)\r\n", "a=int(input())\r\nprint(sum(eval(input().replace(' ','-'))<-1 for _ in ' 'a\r\n))", "def count_rooms_with_free_place(n, rooms):\r\n count = 0\r\n for room in rooms:\r\n p, q = room\r\n if q - p >= 2:\r\n count += 1\r\n return count\r\n\r\n# Input\r\nn = int(input())\r\nrooms = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Count rooms with free place for both George and Alex\r\nresult = count_rooms_with_free_place(n, rooms)\r\n\r\n# Output\r\nprint(result)\r\n", "n = int(input())\r\ncount=0\r\nfor i in range(n):\r\n p,q=input().split()\r\n if(int(q)-int(p)>=2):\r\n count+=1\r\nprint(count)\r\n", "def crf2( taken, capacity):\r\n canthey = None\r\n if capacity - taken >= 2:\r\n canthey = True\r\n else:\r\n canthey = False\r\n return canthey\r\ncount = 0\r\n\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n if crf2( a, b):\r\n count += 1\r\nprint(count)", "def count_rooms_with_free_space(n, rooms):\r\n count = 0\r\n for pi, qi in rooms:\r\n if qi - pi >= 2: # There is space for at least two more people\r\n count += 1\r\n return count\r\n\r\n# Input reading\r\nn = int(input())\r\nrooms = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Calculate and output the number of rooms with free space for both George and Alex\r\nresult = count_rooms_with_free_space(n, rooms)\r\nprint(result)\r\n", "n = int(input())\r\ncnt = 0\r\nwhile n:\r\n n-=1\r\n p,q = map(int,input().split())\r\n if q-p>=2:\r\n cnt+=1\r\nprint(cnt)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n pi,qi = list(map(int, input().split()))\r\n if qi-pi >= 2:\r\n ans += 1\r\n\r\nprint(ans)", "n = int(input())\ncan = 0\nfor i in range(n):\n p, q = list(map(int, input().split()))\n if p + 2 <= q:\n can += 1\n else:\n continue\nprint(can)", "n = int(input())\r\narr = []\r\notvet = 0\r\nfor i in range(n):\r\n arr.append([int(i) for i in input().split(\" \")])\r\nfor i in arr:\r\n if i[1]-i[0] >= 2:\r\n otvet+=1\r\nprint(otvet)", "n= int(input())\r\ns=0\r\nfor i in range(n):\r\n x,y= map(int,input().split())\r\n if (y-x)>= 2:\r\n s+=1\r\nprint(s)", "n = int(input())\r\ncnt = 0\r\nfor i in range (n):\r\n p,q = list(map(int, input().split()))\r\n if p <= q-2:\r\n cnt +=1\r\nprint(cnt)", "a = int(input())\r\nd=0\r\nfor i in range(a):\r\n b,c = map(int,input().split())\r\n if c - b >= 2 :\r\n d+=1\r\nprint(d)", "n=input()\nn=int(n)\nrooms=0\nfor i in range (n):\n p,q=input().split()\n p=int(p)\n q=int(q)\n if q-p>=2 :\n rooms=rooms+1\n\nprint(rooms)\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\nc1=0\r\nfor i in range(n):\r\n a,b = list(map(int,input().split()))\r\n if (a+2) <= b:\r\n c1+=1\r\nprint(c1)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n x+=1\r\n else:\r\n x+=0\r\nprint(x)", "number_of_rooms = int(input())\r\nnon_filled_rooms = 0\r\nfor rooms in range(number_of_rooms):\r\n number_of_people, room_capacity = map(int, input().split())\r\n if (room_capacity - number_of_people) >= 2:\r\n non_filled_rooms += 1\r\nprint(non_filled_rooms) ", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Sep 21 21:37:16 2023\r\n\r\n@author: 2300011413\r\n\"\"\"\r\n\r\nn=int(input())\r\nnum=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n num+=1\r\nprint(num)", "t=int(input())\r\nr=[tuple(map(int,input().split())) for i in range(t)]\r\nc=sum(1 for a,b in r if b-a>=2)\r\nprint(c)", "n= int(input())\r\nans= 0\r\nwhile(n):\r\n l= list(map(int, input().split()))\r\n if(l[0] <= l[1]-2): \r\n ans= ans+1\r\n n -= 1\r\n\r\nprint(ans)", "n=int(input())\r\ncounter=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if(b-a>=2):\r\n counter+=1\r\nprint(counter)\r\n", "rooms_num = int(input())\r\nrooms = []\r\navailabe = []\r\n\r\nfor i in range(rooms_num):\r\n rooms.append(list(map(int, input().split())))\r\n\r\nfor room in rooms:\r\n availabe.append(room[1]-room[0]) if room[1]-room[0] >= 2 else None\r\n\r\nprint(len(availabe))", "n = int(input())\r\ncount = 0 \r\nfor i in range(n): \r\n x, y = input().split(\" \")\r\n x = int(x); y= int(y)\r\n if (y - x >= 2): \r\n count += 1\r\nprint(count)", "n = int(input())\r\nc = 0\r\nfor i in range(n):\r\n p,q = list(map(int,input().split()))\r\n if(q-p>=2):\r\n c += 1 \r\nprint(c)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n\ta = [int(i) for i in input().split()]\r\n\tif a[1]-a[0] >= 2:\r\n\t\tcount += 1\r\nprint(count)", "# Read the number of rooms\r\nn = int(input())\r\n\r\n# Initialize a variable to count the number of rooms with free space for both George and Alex\r\ncount = 0\r\n\r\n# Iterate through the rooms and check if there is enough space for both George and Alex\r\nfor i in range(n):\r\n pi, qi = map(int, input().split())\r\n if qi - pi >= 2:\r\n count += 1\r\n\r\n# Print the count of rooms with free space for both George and Alex\r\nprint(count)\r\n\r\n", "n = int(input())\nnumberOfRooms = 0\nfor i in range(n):\n p,q = map(int,input().split())\n if(q-p >= 2):\n numberOfRooms += 1\n\nprint(numberOfRooms)\n\t\t \t\t \t \t \t\t \t \t\t\t\t \t \t", "n = int(input())\r\nx = 0\r\n\r\nfor i in range(n):\r\n r,a = map(int,input().split())\r\n c = a-r\r\n if c >= 2:\r\n x+=1\r\n else:\r\n pass\r\n\r\nprint(x)", "t = int(input())\r\nc = 0\r\nfor i in range(t):\r\n m,n = map(int,input().split())\r\n x = n-m\r\n if x!= 0 and x>=2:\r\n c+=1\r\nprint(c)", "rooms = int(input())\nfrooms = 0\n\nfor i in range(rooms):\n npeople , people = map(int,input().split())\n if people - npeople >= 2:\n frooms+=1\n \nprint(frooms)\n\t\t\t\t \t\t\t \t\t\t\t \t \t\t\t\t\t \t\t\t", "n = int(input()) # Input: The number of rooms\r\ncount = 0 # Initialize a counter for rooms where George and Alex can move in\r\n\r\nfor _ in range(n):\r\n pi, qi = map(int, input().split()) # Input: The number of people in the room and room's capacity\r\n if qi - pi >= 2:\r\n count += 1\r\n\r\nprint(count) # Output: The number of rooms where George and Alex can move in\r\n", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\n\ncount = 0\n\nfor _ in range(n):\n p, q = map(int, input().split())\n if q - p >= 2:\n count += 1\n\nsys.stdout.write(f\"{count}\")\n", "def main() :\r\n ROOM_INFOS = input_Room_Infos(input_Room_Info_Count())\r\n print(move_In_Room_Count(ROOM_INFOS))\r\n\r\n\r\ndef move_In_Room_Count(room_infos) :\r\n return sum(is_Move_In_Array(room_infos))\r\n\r\ndef is_Move_In_Array(room_infos) :\r\n return list(map(lambda room_info : room_info.IS_MOVE_IN, room_infos))\r\n\r\n\r\ndef input_Room_Info_Count() :\r\n return int(input())\r\n\r\ndef input_Room_Infos(count) :\r\n return [input_Room_Info() for _ in range(count)]\r\n\r\ndef input_Room_Info() :\r\n return Room_Info(input_Array())\r\n\r\ndef input_Array() :\r\n return list(map(int, input().split()))\r\n\r\n\r\nclass Room_Info :\r\n def __init__(self, live_person_count, capacity) :\r\n self.LIVE_PERSON_COUNT = live_person_count\r\n self.CAPACITY = capacity\r\n\r\n @property\r\n def REMAIN_CAPACITY(self) :\r\n return self.CAPACITY - self.LIVE_PERSON_COUNT\r\n \r\n @property\r\n def IS_MOVE_IN(self) :\r\n return 2 <= self.REMAIN_CAPACITY\r\n\r\n\r\nmain()", "takes = int(input())\nroom = 0\nfor i in range(takes):\n b, c = map(int, input().split())\n if b+2 <= c:\n room+=1\n else:\n pass\nprint(room)\n \t \t \t \t \t \t\t\t\t \t\t \t \t\t", "def count_rooms_with_free_spot(n, room_info):\r\n count = 0\r\n for i in range(n):\r\n pi, qi = room_info[i]\r\n if qi - pi >= 2: \r\n count += 1\r\n return count\r\nn = int(input())\r\nroom_info = []\r\nfor _ in range(n):\r\n pi, qi = map(int, input().split())\r\n room_info.append((pi, qi))\r\nprint(count_rooms_with_free_spot(n, room_info))\r\n", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n pi, qi = map(int, input().split())\r\n s+=qi-pi>1\r\nprint(s)", "c=0\r\nfor _ in range(int(input())):\r\n n,m=map(int,input().split())\r\n a=abs(n-m)\r\n if a>=2:\r\n c=c+1\r\nprint(c)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n t=input().split()\r\n if int(t[1])-int(t[0]) >=2:\r\n s+=1\r\nprint(s)", "x=0\r\nn=int(input())\r\nfor i in range (n):\r\n l=list(map(int,input().split()))\r\n if (l[1]-l[0])>=2 :\r\n x+=1\r\nprint(x)", "a=int(input())\r\nk=0\r\nfor i in range(a):\r\n a,b=map(int,input().split())\r\n if a!=b and (b-a)//2>0:\r\n k+=1\r\nprint(k)\r\n", "n=input()\nn=int(n)\nr=0\nfor i in range(1,n+1):\n a,b=input().split()\n a=int(a)\n b=int(b)\n if((b-a)>=2):\n r+=1\nprint(r)\n\t \t\t\t \t\t\t\t \t \t \t\t \t \t \t", "n = input()\nn=int(n)\nc=0\nfor i in range(1 , n+1):\n p,q = input().split()\n p=int(p)\n q=int(q)\n if p+2<=q:\n c+=1\nprint(c)\n\t \t \t \t \t\t\t \t \t\t \t \t\t\t\t \t", "n = int(input())\r\nr_c = 0\r\nfor i in range(n):\r\n s = [int(i) for i in input().split()]\r\n if s[1] - s[0] >= 2:\r\n r_c +=1\r\nprint(r_c)", "n = int(input())\n\ncounter = 0\n\n\nfor i in range(n):\n\n pi, qi = map(int, input().split())\n\n if pi + 2 <= qi:\n\n counter += 1\n\n\nprint(counter)\n\t\t \t\t \t \t \t \t\t \t \t\t\t\t \t\t", "t=int(input())\r\nc=0\r\nfor _ in range(t):\r\n p,q=map(int,input().split())\r\n if((q-p)>=2):\r\n c=c+1\r\nprint(c)\r\n ", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(input().split())\r\n\r\nrn = 0\r\nfor j in range(n):\r\n if int(l[j][1]) - int(l[j][0]) >= 2:\r\n rn+=1\r\nprint(rn)\r\n", "accommodate = 0\r\nfor i in range(int(input())):\r\n p,q = map(int,input().split())\r\n if q-p >= 2:\r\n accommodate += 1\r\nprint(accommodate)\r\n ", "vezes = int(input(\"\"))\r\nif vezes > 100 or vezes < 1:\r\n exit(1)\r\nresultado=0\r\nfor i in range(vezes):\r\n pessoas, capacidade = map(int, input(\"\").split())\r\n if (capacidade-pessoas)>=2:\r\n resultado+=1\r\nprint(resultado)\r\n", "f = 0\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if x + 2 <= y:\r\n f += 1\r\nprint(f)\r\n", "y=int(input())\r\nn=[]\r\ns=0\r\nfor i in range(y):\r\n x=list(map(int,input().split(' ')))\r\n n.append(x)\r\n\r\nfor i in range(y):\r\n if n[i][1]-n[i][0] >1:\r\n s+=1\r\n else:\r\n continue \r\n\r\nprint(s)\r\n", "lst = []\r\nfree = 0\r\nfor i in range(int(input())):\r\n\tlst.append(input().split())\r\nfor i in lst:\r\n\tif int(i[1])-int(i[0])>=2:\r\n\t\tfree+=1\r\nprint(free)\r\n\r\n", "s = input()\r\nk = 0\r\nfor i in range(int(s)):\r\n n = input().split()\r\n p = int(n[0])\r\n q = int(n[1])\r\n if q - p >= 2:\r\n k += 1\r\n else:\r\n continue\r\nprint(k)\r\n", "n = int(input())\ncount = 0\nfor x in range(n):\n inside, able = [int(x) for x in input().split()]\n if able - inside >= 2:\n count += 1\n\nprint(count)", "n = int(input())\r\nc = 0\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n c += 1 if q - p >= 2 else 0\r\nprint(c)", "n = int(input())\r\nf = 0\r\nfor i in range(n):\r\n r = input().split()\r\n p = int(r[0])\r\n q = int(r[1])\r\n if (q-p) >= 2:\r\n f += 1\r\nprint(f)\r\n", "rooms = int(input())\r\npeople=[]\r\npossible_rooms = 0\r\nfor i in range(rooms):\r\n people.append(list(map(int,input().split())))\r\n if people[i][1] - people[i][0] >= 2:\r\n possible_rooms += 1\r\n\r\nprint(possible_rooms)", "print(sum(eval(input().replace(' ','-'))<-1for _ in ' 'int(input())))", "s=0\r\nfor i in range(int(input())):\r\n q,w=map(int,input().split())\r\n if w-q>1:\r\n s+=1\r\nprint(s)", "n=int(input())\r\nd=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n d+=1\r\nprint(d)\r\n", "n = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n if b - a >=2:\r\n cnt += 1\r\nprint(cnt) ", "num = int(input())\r\nposible = 0\r\nwhile num > 0:\r\n check = input().split(' ')\r\n persons = int(check[0])\r\n capitable = int(check[1])\r\n if capitable - persons >= 2:\r\n posible += 1\r\n num -= 1\r\nprint(posible)", "a = int(input(''))\r\ns = 0\r\nfor j in range(a):\r\n b = input('')\r\n if int(b.split()[1]) - int(b.split()[0]) < 2:\r\n s = s\r\n else:\r\n s = s + 1\r\n\r\nprint(s)\r\n \r\n", "n = int(input())\r\n\r\nx=0\r\n\r\nfor i in range(n):\r\n p, q = map(int, input().split())\r\n if (q-p)>=2:\r\n x+=1\r\n\r\nprint(x)", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n p, q = [int(i) for i in input().split()]\r\n if q - p >= 2:\r\n count += 1\r\n else:\r\n continue\r\nprint(count)", "from math import \r\nn = int(input())\r\nans = 0\r\nfor i in range(0,n):\r\n p,q = map(int,input().split())\r\n if abs(q-p)>=2:\r\n ans+=1\r\nprint(ans)", "rooms = int(input())\r\n\r\ndef move(people, capacity):\r\n\tif capacity > 1:\r\n\t\tif (capacity - people) > 1:\r\n\t\t\treturn 1\r\n\treturn 0\r\n\r\nopen_rooms = 0\r\n\r\nfor r in range(rooms):\r\n\tp, c = [int(i) for i in input().split()]\r\n\topen_rooms += move(p,c)\r\n\r\nprint(open_rooms)", "# Read input\r\nn = int(input())\r\nrooms = []\r\n\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n rooms.append((p, q))\r\n\r\n# Count the number of rooms with free space for both George and Alex\r\ncount = sum(1 for p, q in rooms if q - p >= 2)\r\n\r\n# Print the result\r\nprint(count)\r\n", "count = 0;\r\nfor i in range(int(input())):\r\n p,q = map(int,input().split(\" \"))\r\n if (q-p >= 2):\r\n count+=1;\r\nprint(str(count))", "n = int(input())\ni = 0\nlista = []\ncap = 0\n\nwhile i < n:\n x = input().split(\" \")\n a,b=int(x[0]),int(x[1])\n lista.append(x)\n if(a <= b-2):\n cap += 1\n i +=1\nprint(cap)\n \t \t \t \t \t\t \t \t\t \t", "t=int(input())\r\ncount=0\r\nwhile(t>0):\r\n t=t-1\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n count=count+1\r\nprint(count)", "n=int(input())\r\nrooms=[]\r\nfor _ in range(n):\r\n p,q=map(int,input().split())\r\n rooms.append((p,q))\r\ncount=0\r\nfor room in rooms:\r\n p,q=room\r\n if q-p >= 2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nl = list()\r\ns = 0\r\nfor i in range(n):\r\n x = input()\r\n l = x.split()\r\n l[0], l[1] = int(l[0]), int(l[1])\r\n if l[1]-l[0] >= 2:\r\n s += 1\r\n\r\nprint(s)\r\n", "n = int(input())\r\nrooms_with_space = 0\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n\r\n if q - p >= 2:\r\n rooms_with_space += 1\r\nprint(rooms_with_space)\r\n", "n=int(input())\r\ncount=0\r\ni=0\r\nwhile i<n:\r\n ask=list(map(int,input().split()))\r\n if abs(ask[0]-ask[1])>=2:\r\n count+=1\r\n else:\r\n count=count\r\n i+=1\r\nprint(count)", "c=0\r\nn=int(input())\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if abs(b-a)>=2:\r\n c+=1\r\nprint(c)\r\n \r\n ", "# Read input\r\nn = int(input())\r\n\r\n# Initialize a variable to count the number of suitable rooms\r\ncount = 0\r\n\r\n# Iterate through the rooms\r\nfor _ in range(n):\r\n pi, qi = map(int, input().split())\r\n if qi - pi >= 2: # There should be at least 2 free places\r\n count += 1\r\n\r\n# Print the result\r\nprint(count)\r\n", "def room():\r\n n=int(input())\r\n a=[];b=[]\r\n for i in range(0,n):\r\n x,y=map(int,input().split())\r\n a.append(x)\r\n b.append(y);count=0\r\n for i in range(0,n):\r\n if b[i]-a[i]>=2:\r\n count+=1\r\n print(count)\r\n\r\nroom()", "from collections import Counter\r\n# def solve(N):\r\n# for i in range(4, N + 1):\r\n# if isLucky(i) and N % i == 0: return \"YES\"\r\n# return \"NO\"\r\n \r\n\r\nN = int(input())\r\ncnt = 0\r\nfor i in range(N):\r\n a,b = list(map(int, input().split()))\r\n if b - a > 1: cnt += 1\r\nprint(cnt)", "t=int(input())\r\nc=0\r\nfor i in range(t):\r\n (n,m)=map(int,input().split())\r\n if(m-n>=2):\r\n c=c+1\r\nprint(c)", "import sys\r\n\r\na = int(input(''))\r\nc = 0\r\nfor i in range(0, a):\r\n b = [int(j) for j in sys.stdin.readline().split()]\r\n if b[1] - b[0] >= 2:\r\n c += 1\r\nprint(c)", "\r\nn = int(input())\r\n\r\n\r\nrooms_count = 0\r\n\r\n\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n \r\n \r\n if q - p >= 2:\r\n rooms_count += 1\r\n\r\n\r\nprint(rooms_count)\r\n", "t=int(input())\r\nk=0\r\nwhile t>0:\r\n t-=1\r\n a,b=map(int,input().split())\r\n if b-a>1:\r\n k+=1\r\nprint(k)\r\n", "test_cases=int(input())\r\ncount=0\r\nfor _ in range(test_cases):\r\n x,y=map(int,input().split())\r\n if y-x>=2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nfor i in range(n) :\r\n inputs = input().split()\r\n p = int(inputs[0])\r\n q = int(inputs[1])\r\n if q-p >= 2 :\r\n count += 1\r\nprint(count)", "quantity_of_rooms = int(input())\nquantity_of_rooms_where_can_lay = 0\nfor i in range(quantity_of_rooms):\n live, max_to_live = map(int, input().split())\n if live + 2 <= max_to_live:\n quantity_of_rooms_where_can_lay += 1\n\nprint(quantity_of_rooms_where_can_lay)\n", "n=int(input())\r\nc=0\r\nfor _ in range(n):\r\n m,n=map(int,input().split())\r\n if n-m>=2:\r\n c+=1\r\nprint(c)\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if abs(q-p)>=2:\r\n count=count+1\r\nprint(count)\r\n\r\n\r\n \r\n\r\n", "T=int(input())\r\nc=0\r\nfor _ in range(T):\r\n \r\n a,b=map(int,input().split())\r\n if(b-a)>=2:\r\n c=c+1\r\nprint(c)\r\n\r\n ", "T = int(input())\r\nx = 0\r\nfor i in range(T):\r\n p,q = input().split()\r\n p = int(p)\r\n q = int(q)\r\n if p+2 <= q:\r\n x += 1\r\nprint(x)\r\n \t", "n = int(input())\r\nmatrix = [list(map(int, input().split())) for _ in range(n)]\r\ncnt=0\r\nfor i in range(n):\r\n if matrix[i][1] - matrix[i][0] >= 2:\r\n cnt+=1\r\nprint(cnt)", "n= 6\r\ngraph={}\r\nfor i in range(n):\r\n graph[i]=[]\r\nop=[[0,1],[0,2],[0,3],[0,4],[1,3],[2,3],[2,4],[2,5],[3,5]]\r\nfor (k,q) in op:\r\n graph[k].append(q)\r\n graph[q].append(k)\r\n \r\n# for i,v in graph.items():\r\n# print(i,\":\",v)\r\ndef dfs(graph,start,visited=set()):\r\n print(start)\r\n visited.add(start)\r\n for k in graph[start]:\r\n if k not in visited:\r\n dfs(graph,k,visited)\r\n# dfs(graph,5)\r\n\r\n# a=int(input())\r\n# b=list(map(int,input().split()))\r\n# for i in range(1,a+1):\r\n# print(b.index(i)+1,end=' ')\r\n\r\n# a=int(input())\r\n# b=\"I hate that\"\r\n# c=\"I love that\"\r\n# d=1\r\n# for i in range(a-1):\r\n# if d:\r\n# print(b,end=\" \")\r\n# d=0\r\n# else:\r\n# print(c,end=\" \")\r\n# d=1\r\n# if d:\r\n# print(\"I hate it\")\r\n# else:\r\n# print(\"I love it\")\r\n\r\nans=0\r\nfor _ in range(int(input())):\r\n b=list(map(int,input().split()))\r\n if b[1]-b[0]>=2:\r\n ans+=1\r\nprint(ans)", "t=int(input())\r\ncount=0\r\nfor i in range(t):\r\n a,b=list(map(int,input().split()))\r\n if b-a >=2 :\r\n count+=1\r\n\r\nprint(count)\r\n ", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n a,b = map(int,input().split(' '))\r\n if abs(a-b)>=2:\r\n count = count + 1\r\nprint(count)\r\n ", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n l=list(map(int, input().split()))\r\n if (l[1]-l[0])>=2:\r\n c=c+1\r\nprint(c)\r\n", "t = int(input())\r\ncou = 0\r\nfor i in range(t):\r\n a, b = map(int, input().split())\r\n if (b - a) >= 2:\r\n cou += 1\r\nprint(cou)", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n \r\n x = list(map(int, input().split(\" \")))\r\n \r\n if x[0] <= x[1]-2:\r\n # print(x[1])\r\n # print(x[1]+2)\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\r\nrooms = []\r\ni = 0\r\nfor y in range(n):\r\n x = input().split()\r\n rooms.append(x)\r\n\r\nfor x in range(len(rooms)):\r\n if int(rooms[x][1]) - int(rooms[x][0]) > 1:\r\n i += 1\r\n\r\n\r\nprint(i)\r\n", "def available_rooms(rooms):\r\n count = 0\r\n for r in rooms:\r\n if r[1] - r[0] >= 2:\r\n count += 1\r\n return count\r\n\r\nn = int(input())\r\nrooms = []\r\nfor i in range(n):\r\n rooms.append([int(item) for item in input().split()])\r\nprint(available_rooms(rooms))", "num=int(input())\r\n\r\ncount=0\r\n\r\nfor i in range (0,num):\r\n a,b=map(int,input().split())\r\n \r\n if (b-a)>=2:\r\n count=count+1\r\n \r\nprint(count)\r\n ", "\nn = int(input())\nans = 0\n\nfor i in range(n):\n a, b = map(int,input().split())\n \n if b-a >= 2:\n ans += 1\n \nprint(ans)\n\t \t \t\t\t\t \t\t \t \t \t\t \t\t", "n=int(input())\r\nresult=[]\r\nalist=[]\r\nfor i in range(n):\r\n x=input()\r\n alist=[int(f) for f in x.split()]\r\n if alist[1]-alist[0]>1:\r\n result.append(1)\r\nprint(len(result))", "a = int(input())\r\n\r\njm=0\r\n\r\nfor i in range(0,a):\r\n x1, x2= map(int,input().split())\r\n if(x2 - x1 >= 2):\r\n jm = jm + 1\r\nprint(jm)\r\n", "n = input()\nn = int(n)\nans=0\nfor i in range (n):\n a,b=input().split()\n a =int(a)\n b =int(b)\n if a+2<=b:\n ans+=1\nprint(ans)\n\t \t\t\t\t\t \t \t\t \t \t \t\t\t \t\t", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n res = [int(j) for j in input().split()]\r\n if res[-1] - res[0] >= 2:\r\n count += 1\r\nprint(count)\r\n\r\n", "count=0\r\nfor i in range(int(input())):\r\n p,q =map(int ,input().split())\r\n if(q-p>=2):count+=1\r\nprint(count)", "n = int(input())\r\nl = []\r\nct = 0\r\nfor i in range(n):\r\n input_line = input()\r\n values = input_line.split()\r\n numbers = [int(value) for value in values]\r\n l.append(numbers)\r\nfor i in range(len(l)):\r\n if l[i][0] + 2 <= l[i][1]:\r\n ct += 1\r\nprint(ct)\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(1,n+1):\r\n p,q=map(int,input().split())\r\n if p<q and q-p>=2:\r\n count=count+1\r\nprint(count)", "# Input the number of rooms\r\nn = int(input())\r\n\r\n# Initialize a variable to count the rooms with free space for both George and Alex\r\ncount = 0\r\n\r\n# Iterate through the rooms\r\nfor _ in range(n):\r\n pi, qi = map(int, input().split())\r\n \r\n # Check if there is enough free space for both George and Alex\r\n if qi - pi >= 2:\r\n count += 1\r\n\r\n# Print the count of rooms with free space\r\nprint(count)\r\n", "n1 = int(input())\r\nrooms_with_free_place = 0\r\n\r\nfor _ in range(n1):\r\n p1, q1 = map(int, input().split())\r\n \r\n if q1 - p1 >= 2:\r\n rooms_with_free_place += 1\r\n\r\nprint(rooms_with_free_place)\r\n", "c=0\r\nn=int(input())\r\nfor i in range(n):\r\n m,n=map(int,input().split())\r\n if n-m >= 2:\r\n c+=1\r\nprint(c)", "a=int(input())\r\nk=0\r\nfor i in range(a):\r\n a,b=map(int,input().split())\r\n c=b-a\r\n if c>=2:\r\n k+=1\r\nprint(k)", "\r\nans = 0\r\n\r\nfor _ in range(int(input())):\r\n f, s = map(int, input().split())\r\n if f + 2 <= s:\r\n ans += 1\r\nprint(ans)\r\n", "w = int(input())\r\ns = 0\r\nfor i in range(w):\r\n x = input().split(\" \")\r\n p = int(x[0])\r\n q = int(x[1])\r\n if q - p > 1:\r\n s += 1\r\nprint(s)", "roomNo = int(input())\r\nx = 0\r\nfor i in range(roomNo):\r\n room = input()\r\n room = list(map(int,room.split()))\r\n if (room[1] - room[0]) >=2:\r\n x += 1\r\nprint(x)", "n = int(input())\nc = 0\nfor _ in range(n):\n pi,qi = map(int,input().split())\n if qi - pi >= 2:\n c += 1\nprint(c)", "t = int(input())\r\ncount = 0\r\nfor i in range(t):\r\n a, b = map(int, input().split())\r\n if a<=b-2:\r\n count+=1\r\nprint(count)", "x=int(input())\r\nans=0\r\nfor a in range(x):\r\n y=list(map(int,input().split()))\r\n if y[0]+2<=y[1]:\r\n ans=ans+1\r\n y.clear()\r\nprint(ans)", "a, c = int(input()), 0\r\nfor i in range(a):\r\n b = [int(j) for j in input().split()]\r\n if (b[1] - b[0]) >= 2:\r\n c += 1\r\nprint(c)", "n=int(input())\r\nm=0\r\nfor i in range (n):\r\n info=input().split()\r\n p=int(info[0])\r\n q=int(info[1])\r\n if q-p>=2:\r\n m+=1\r\nprint(m)", "def count_rooms_with_space(n, rooms):\r\n count = 0\r\n for room in rooms:\r\n p, q = room\r\n if q - p >= 2: # There is enough space for both George and Alex\r\n count += 1\r\n return count\r\n\r\n# Read input\r\nn = int(input())\r\nrooms = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n# Calculate and print the number of rooms with enough space\r\nresult = count_rooms_with_space(n, rooms)\r\nprint(result)", "t=int(input())\r\na=0\r\nfor i in range(t):\r\n\tn,m=map(int,input().split())\r\n\tif m-n>=2:\r\n\t\ta+=1\r\nprint(a)", "n =int(input())\nans=0\nfor i in range(n):\n a,b=input().split()\n a=int(a)\n b=int(b)\n if a+2<=b:\n ans+=1\nprint(ans)\n \t\t\t\t \t\t\t \t \t \t \t\t\t \t", "t=int(input())\r\nc=0\r\nfor i in range(t):\r\n x,y=map(int,input().split())\r\n \r\n\r\n if y-x>=2:\r\n c+=1\r\n \r\nprint(c) ", "num=int(input())\r\nres=0\r\navailable=0\r\nfor i in range (num):\r\n numofpeople,capacity=map(int,input().split())\r\n res=capacity-numofpeople\r\n if res>=2:\r\n available+=1\r\nprint(available)", "n = int(input())\r\nnumberOfRooms = 0\r\nfor _ in range(n) :\r\n p , q = map(int,input().split(\" \"))\r\n if p <= q - 2 :\r\n numberOfRooms +=1\r\nprint(numberOfRooms)\r\n ", "n = int(input())\r\nc=0\r\nfor i in range(n):\r\n p,q= map(int,input().split())\r\n a = q-p \r\n if(a>=2):\r\n c+=1\r\nprint(c)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n j,k=map(int,input().split())\r\n if (k-j)>=2:\r\n s+=1\r\nprint(s) ", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n p,q = map(int,input().split())\r\n if q-p >= 2:\r\n s+=1\r\nprint(s)", "k=int(input())\r\nc=0\r\nfor _ in range(k):\r\n p,q=map(int,input().split())\r\n if p+2<=q:\r\n c=c+1\r\nprint(c)", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n a= [int(x) for x in input().split()]\r\n l.append(a)\r\nr = 0\r\nfor i in l:\r\n if (i[1] - i[0]) >= 2:\r\n r += 1\r\nprint(r)\r\n", "n=int(input())\r\nc=0\r\nwhile(n>0):\r\n p,q=input().split()\r\n \r\n p=int(p)\r\n q=int(q)\r\n if(q-p>=2):\r\n c=c+1\r\n n=n-1\r\nprint(c) \r\n ", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n tmp = input()\r\n p = int(tmp.split()[0])\r\n q = int(tmp.split()[1])\r\n if q - p >= 2:\r\n count += 1\r\nprint(count)", "total = 0\r\ncount = 0\r\nrooms = int(input())\r\nwhile count < rooms:\r\n info = list(map(int, input().split(\" \")))\r\n if (info[1]-info[0]) >= 2:\r\n total += 1\r\n count += 1\r\nprint(total)\r\n\r\n", "n = int(input())\r\ns = []\r\nc = 0\r\n\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nfor j in s:\r\n if int(j.split()[1]) - int(j.split()[0]) >= 2:\r\n c += 1\r\n\r\nprint(c)\r\n", "n=int(input())\r\nl=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n l+=1\r\nprint(l)\r\n \r\n", "n = int(input())\r\np=[]\r\nq=[]\r\ncount=0\r\nfor i in range(0,n):\r\n inp = input().split(\" \")\r\n p.append(int(inp[0]))\r\n q.append(int(inp[1]))\r\n if(q[i]-p[i]>1):\r\n count+=1\r\nprint(count)", "n=int(input())\r\noutput=0\r\nfor i in range(n):\r\n l=input().split()\r\n if int(l[0])<=(int(l[1])-2):\r\n output+=1\r\nprint(output)\r\n", "x = int(input())\r\nc = 0 \r\nfor i in range(x):\r\n \r\n y , z= map(int,input().split())\r\n \r\n if (z-y >= 2):\r\n c+=1\r\nprint(c)", "n=int(input())\r\nrooms=0\r\nfor i in range(n):\r\n res=0\r\n people,capacity=map(int,input().split())\r\n res=capacity-people\r\n if(res>=2):\r\n rooms+=1\r\nprint(rooms)\r\n ", "w=0\r\nfor i in range(int(input())):\r\n r,t=map(int,input().split())\r\n if t-r>=2:\r\n w+=1\r\nprint(w)", "# Read the number of rooms\r\nn = int(input())\r\n\r\n# Initialize a variable to count the rooms with free space for George and Alex\r\ncount = 0\r\n\r\n# Iterate through each room\r\nfor _ in range(n):\r\n # Read the number of people already living in the room and the room's capacity\r\n p, q = map(int, input().split())\r\n \r\n # Check if there is at least one spot available in the room\r\n if q - p >= 2:\r\n count += 1\r\n\r\n# Print the number of rooms with free space for George and Alex\r\nprint(count)\r\n\r\n\r\n\r\n", "# your code goes here\r\np=0\r\nfor _ in range(int(input())):\r\n\tn,c = map(int,input().split())\r\n\tif c-n>=2:\r\n\t\tp=p+1\r\nprint(p)", "n=int(input())\nroom=0\nfor i in range(n):\n a,b=input().split()\n a=int(a)\n b=int(b)\n if a+2<=b:\n room+=1\nprint(room)\n \t \t \t \t \t \t\t\t\t \t \t \t \t", "n=int(input())\ncount=0\nfor i in range(n):\n p,c=input().split()\n if int(c)-int(p)>=2:\n count+=1\nprint(count)", "c = 0\nfor t in range(int(input())):\n p,q = map(int,input().split())\n if q-p>=2:\n c += 1 \nprint(c)", "k = input()\r\ncount = 0\r\nfor c in range(int(k)):\r\n a = input()\r\n diff = 0\r\n n = \"\"\r\n h = \"\"\r\n num = 0\r\n while num < len(a) and a[num] != \" \":\r\n n = n + a[num]\r\n num = num + 1\r\n num = num + 1\r\n while num < len(a) and a[num] != \" \":\r\n h = h + a[num]\r\n num = num + 1\r\n diff = int(h) - int(n)\r\n if diff >= 2:\r\n count = count + 1\r\nprint(count)\r\n ", "a = int(input())\r\ng = 0\r\nwhile a>0:\r\n a-=1\r\n z,x = map(int,input().split())\r\n if (x-z) >=2:\r\n g+=1\r\nprint(g)", "n = input()\nn = int(n)\nrooms = 0\nfor i in range(n):\n p, q = input().split()\n p = int(p)\n q = int(q)\n if q-p >= 2:\n rooms = rooms + 1\n\nprint(rooms)\n\n\t \t \t \t\t\t\t \t\t \t \t\t \t\t \t\t\t \t", "rooms = int(input())\r\n\r\ngeorge_and_alex = 0\r\n\r\nfor x in range(rooms):\r\n p,q = map(int,input().split())\r\n if q - p >= 2:\r\n george_and_alex += 1\r\n \r\n\r\nprint(george_and_alex)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n if b - a >= 2:\r\n ans += 1 \r\nprint(ans)", "n = int(input())\r\nlp = []\r\nlq = []\r\ncount = 0\r\nfor i in range(0,n):\r\n a = input()\r\n lst = a.split(' ')\r\n lst = [int(s) for s in lst]\r\n p = lst[0]\r\n q = lst[1]\r\n lp.append(p)\r\n lq.append(q)\r\nfor i in range(0,n):\r\n if (lq[i]-lp[i]>=2) :\r\n count += 1\r\nprint(count)", "n=0\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n if abs(a-b) > 1:\r\n n +=1\r\nprint(n)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n a=input().split(\" \")\r\n p=int(a[0])\r\n q=int(a[1])\r\n if q-p>=2:\r\n count+=1\r\n else:\r\n count+=0\r\nprint(count)", "T = int(input())\r\ncount = 0\r\nfor i in range(T):\r\n n,m = map(int,input().split())\r\n if m - n >= 2:\r\n count += 1\r\nprint(count)", "# Read the number of rooms\nn = int(input())\n\n# Initialize the count of rooms with free space\ncount = 0\n\n# Iterate through the rooms\nfor _ in range(n):\n # Read the number of people living in the room and the room's capacity\n p, q = map(int, input().split())\n \n # Check if there is free space for both George and Alex\n if q - p >= 2:\n count += 1\n\n# Print the number of rooms where George and Alex can move in\nprint(count)\n\n \t \t\t\t \t\t\t \t \t\t\t\t \t", "x=int(input())\r\ncount=0\r\nfor i in range(x):\r\n a,b=map(int,input().split())\r\n if(a+2<b):\r\n count=count+1\r\n elif(a+2==b):\r\n count=count+1\r\nprint(count)", "x=0\r\nfor _ in range(int(input())):\r\n s=input().split()\r\n p,q=int(s[0]),int(s[1])\r\n if(q-p>1):\r\n x=x+1\r\nprint(x)\r\n", "n=input()\nn = int(n)\n\nroom = 0\n\nfor i in range(n):\n p, q = input().split()\n p = int(p)\n q = int(q)\n if q-p >= 2:\n room = room + 1\n\nprint(room)\n\n \t \t\t\t\t\t\t \t \t \t\t \t \t \t", "n = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n p,q = map(int,input().split())\r\n if p < q - 1:\r\n count += 1\r\nprint(count)\r\n", "# There are n number of rooms in a building.\r\n# Each room has some number of people in it.\r\n# But every room has some space for at least 1 more person.\r\n# Find the number of rooms that can house at minimum 2 additional guests.\r\n\r\n# input1 = the number of rooms available.\r\n# Every other input contains two numbers.\r\n# The first number is the number of people who live in the room.\r\n# The second number is the room's capacity.\r\n\r\ninput1 = input() # number of rooms to look through.\r\nnRooms = int(input1) # converted into number.\r\nroomsAvailable = 0 # counter to keep track of rooms available.\r\n\r\nfor n in range(nRooms):\r\n inputPQ = input().split()\r\n occupants = int(inputPQ[0])\r\n capacity = int(inputPQ[1])\r\n\r\n if capacity - occupants >= 2: # if room meets conditions...\r\n roomsAvailable += 1 # add 1 to available rooms\r\n\r\noutput = roomsAvailable # set available rooms to output\r\nprint(output) # print output.\r\n", "n = int(input())\r\navailable = 0\r\nfor _ in range(n):\r\n already, capacity = map(int, input().split())\r\n available = available + 1 if capacity - already >= 2 else available\r\nprint(available)", "import sys\r\n\r\nn = int(sys.stdin.readline().split()[0])\r\nrooms = [[0 for x in range(2)] for y in range(n)]\r\nrow = 0\r\n\r\nfor line in sys.stdin:\r\n column = 0\r\n for word in line.split():\r\n rooms[row][column] = int(word)\r\n column += 1\r\n row += 1\r\n\r\nrooms_acceptable = 0\r\n\r\nfor room in rooms:\r\n if room[0] + 2 <= room[1]:\r\n rooms_acceptable += 1\r\n\r\nprint(rooms_acceptable)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n p, q = list(map(int,input().split()))\r\n if q-p>=2:\r\n count += 1\r\nprint(count)", "#initializes number of rooms and free rooms\r\nrooms = int(input())\r\nfreeRooms = 0\r\n\r\n#checks how many free rooms there are\r\nfor room in range(rooms):\r\n current, max = input().split(' ')\r\n if int(max) - int(current) >= 2:\r\n freeRooms += 1\r\n\r\n#prints result\r\nprint(freeRooms)", "x=int(input(\"\"))\r\nl=[]\r\nc=0\r\nfor i in range(x):\r\n y=input(\"\")\r\n t=y.split(\" \")\r\n l.append(t)\r\nfor j in l:\r\n if int(j[1])-int(j[0])>=2:\r\n c+=1\r\nprint(c)", "# George and Accommodation\r\nhabitaciones_disponibles = 0\r\nfor _ in range(int(input())):\r\n datos = [int(x) for x in input().split(' ')]\r\n if datos[0] + 2 <= datos[1]:\r\n habitaciones_disponibles += 1\r\nprint(habitaciones_disponibles)\r\n", "n = int(input())\n\ncounter = 0\nfor e in range(n):\n p,q = [int(x) for x in input().split()]\n if q-p>=2:\n counter+=1\n\nprint(counter)\n", "n = int(input())\nh = 0\nfor i in range(1, n + 1):\n p, q = input().split()\n p = int(p)\n q = int(q)\n if p <= q - 2:\n h += 1\nprint(h)\n \n\t\t\t \t\t \t\t\t\t\t \t\t \t\t\t\t\t", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Aug 31 08:25:39 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\nroom=int(input())\r\ncounter=0\r\nfor i in range(room):\r\n data=input().split()\r\n if int(data[1])-int(data[0])>=2:\r\n counter+=1\r\nprint(counter)", "def rooms(liste):\r\n res=0\r\n for i in range(len(liste)):\r\n if(int(liste[i][1])-int(liste[i][0])>=2):\r\n res=res+1\r\n return res\r\n\r\nn=int(input())\r\nentrer=[]\r\nfor j in range(n):\r\n tnr=input()\r\n tnr=tnr.split()\r\n entrer.append(tnr)\r\nprint(rooms(entrer))\r\n", "n=int(input())\r\npeople=[]\r\nmaxpeo=[]\r\nrooms=0\r\nfor i in range(0,n):\r\n arr=list(map(int,input().split()))\r\n people.append(arr[0])\r\n maxpeo.append(arr[1])\r\nfor j in range(0,n):\r\n if (int(maxpeo[j])-int(people[j]))>1:\r\n rooms=rooms+1\r\nprint(rooms)", "def room():\r\n n_room = int(input())\r\n people_room_capacity = []\r\n for i in range(n_room):\r\n p_r = input().split()\r\n people_room_capacity.append(int(p_r[0]) - int(p_r[1]))\r\n \r\n counter = 0\r\n for x in people_room_capacity:\r\n if x <= -2:\r\n counter += 1\r\n return counter\r\n \r\nprint(room())", "t = int(input())\r\ncount = 0\r\nfor i in range(t):\r\n low, high = map(int, input().split())\r\n if high - low >= 2:\r\n count += 1\r\nprint(count)", "n = int(input())\r\navailable_rooms = 0\r\nfor _ in range(0,n) :\r\n room_status = input().split(' ')\r\n if (int(room_status[1]) - int(room_status[0])) >= 2 :\r\n available_rooms +=1 \r\nprint(available_rooms)", "c =0 \r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n if (b-a)>=2:\r\n c+=1\r\nprint(c)\r\n", "def main():\r\n \r\n num_cases = int(input()) # Number of cases\r\n \r\n count = 0 # Initialize a counter for valid cases\r\n\r\n\r\n for _ in range(num_cases):\r\n \r\n start_time, end_time = map(int, input().split()) # Get start and end times for a case\r\n \r\n if end_time - start_time >= 2: # Check if the time difference is at least 2 hours\r\n \r\n count += 1 # Increment the counter for valid cases\r\n\r\n print(count) # Print the total number of valid cases\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "t=int(input())\r\ncount=0\r\nwhile t>0:\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n count+=1\r\n t-=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nfor i in range(0, n):\r\n s = list(map(int, input().split()))\r\n if s[0]+2 <= s[1]:\r\n count += 1\r\nprint(count)\r\n", "def count_rooms_with_free_place(n, rooms):\r\n count = 0\r\n for i in range(n):\r\n p_i, q_i = rooms[i]\r\n if q_i - p_i >= 2:\r\n count += 1\r\n return count\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n rooms = []\r\n for _ in range(n):\r\n p_i, q_i = map(int, input().split())\r\n rooms.append((p_i, q_i))\r\n result = count_rooms_with_free_place(n, rooms)\r\n print(result)", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if b-a>=2:\r\n s +=1\r\nprint(s)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n ans += 1 if y - x >= 2 else 0\r\nprint(ans)", "x=0\nn=int(input())\nfor i in range(0,n):\n a,b=input().split( )\n if ((int(b)-int(a)>=2)):\n x+=1\nprint(x) \n \t \t \t \t \t\t\t", "N = int(input())\r\nc = 0\r\nfor _ in range(N):\r\n P, Q = map(int, input().split())\r\n if Q - P >= 2:\r\n c += 1\r\nprint(c)", "def count_free_rooms(n, rooms):\r\n count = 0\r\n for room in rooms:\r\n p, q = room\r\n if p < q - 1:\r\n count += 1\r\n return count\r\nn = int(input())\r\nrooms = []\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n rooms.append((p, q))\r\nfree_rooms = count_free_rooms(n, rooms)\r\nprint(free_rooms)\r\n", "n = input()\nn = int(n)\nx = 0\nfor i in range(n):\n a , b = input().split()\n a = int(a)\n b = int(b)\n if (b - a)>=2:\n x += 1\nprint(x)\n\n\t\t \t \t\t\t \t\t \t\t\t\t \t\t\t", "n = int(input())\r\nf = 0\r\nfor i in range(n):\r\n p, q = map(int, input().split(' '))\r\n if (q - p) >= 2:\r\n f += 1\r\n\r\nprint(f)\r\n", "\r\nn = int(input()) \r\n\r\nroom_list = []\r\n\r\nfor i in range(n):\r\n r_capasty, f_capasty = list(map(int, input().split()))\r\n room_list.append([r_capasty, f_capasty])\r\n\r\nfriens_room = 0\r\n\r\nfor j in room_list:\r\n if j[1] - j[0] >= 2:\r\n friens_room += 1\r\n else:\r\n friens_room = friens_room\r\n \r\nprint(friens_room)", "a=0\r\nn=int(input())\r\nfor i in range(1,n+1):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n a+=1\r\nprint(a)\r\n", "n = int(input())\nsum = 0\nfor i in range(n):\n p,q = list(map(int,input().split()))\n if q-p-2 >= 0:\n sum = sum + 1\nprint(sum)\n", "result=0\r\nfor i in range(0,int(input())):\r\n\tcase=input()\r\n\tcaseLst=list(map(int,case.split()))\r\n\tif(caseLst[1]-caseLst[0]>=2):\r\n\t\tresult+=1\r\nprint(result)", "t=int(input())\r\nc=0\r\nwhile(t>0):\r\n p,q=map(int,input().split())\r\n if(q-p>=2):\r\n c+=1\r\n t-=1\r\nprint(c)\r\n", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a+2<=b:\r\n k+=1\r\nprint(k)", "n = int(input())\r\nc = 0\r\n\r\nfor _ in range(n):\r\n p1, q1 = map(int, input().split())\r\n if q1 - p1 >= 2 or (q1 >= 2 and p1 == 0):\r\n c += 1\r\n\r\nprint(c)", "n=int(input())\r\n#lst=list(map(int,input().split()))\r\nf=0\r\nfor i in range(n):\r\n n,m=map(int,input().split())\r\n if n<m and m-n>=2:\r\n f+=1\r\nprint(f)", "k = int(input())\na = 0\nfor i in range(k):\n p,q = map(int, input().split())\n if q-p>= 2:\n a+=1\n \nprint(a)\n\t\t\t\t\t \t \t\t \t \t\t\t\t\t \t \t \t \t", "a=int(input())\r\nc=0\r\nfor i in range(a):\r\n a,b=map(int,input().split())\r\n if (b-2)>=a:\r\n c+=1\r\nprint(c)\r\n", "num = int(input())\r\ncount = 0\r\nfor i in range(num):\r\n num1,num2 = map(int,input().split())\r\n if(num1+2 <= num2):\r\n count +=1\r\nprint(count) ", "n = int(input())\r\ncount = 0\r\nfor i in range(0,n):\r\n dump = input(\"\").split()\r\n if int(dump[1]) - int(dump[0]) >= 2:\r\n count = count+1\r\nprint(count)", "rooms = int(input())\r\ncount_rooms = 0\r\nfor i in range(rooms):\r\n count_people, max_people = map(int, input().split())\r\n if max_people - count_people >= 2:\r\n count_rooms += 1\r\nprint(count_rooms)\r\n\r\n", "count = 0\r\nfor i in range(int(input())):\r\n p,q = list(map(int,input().split()))\r\n if q>p+1:\r\n count+=1\r\nprint(count)\r\n ", "t = int(input())\r\ncount = 0\r\nfor i in range(t):\r\n p,q = map(int,input().split())\r\n if p == q:\r\n count += 0\r\n else:\r\n if q-p >= 2:\r\n count +=1\r\nprint(count)", "x = int(input())\r\nc = 0\r\n\r\nfor _ in range(x):\r\n a, b = map(int, input().split())\r\n if b - a >= 2:\r\n c += 1\r\n\r\nprint(c)\r\n", "n = int(input())\nf = 0\n\nfor i in range(n):\n num_people , capcity_people = map(int,input().split())\n if capcity_people - num_people >= 2:\n f+=1\n \nprint(f)\n\t\t\t \t \t\t \t \t\t \t \t\t \t\t\t", "n = int(input())\nl = []\n\nfor x in range(n):\n t = input()\n t = t.split()\n t = [int(s) for s in t]\n l.append(t)\n \nresult = [x[1]-x[0] for x in l]\ncount = [x for x in result if x>=2]\ncount = len(count)\nprint(count)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n s = input().split()\r\n for i in range(len(s)):\r\n s[i] = int(s[i])\r\n if s[0]+2<=s[1]:\r\n count+=1\r\nprint(count)", "N=int(input())\r\ncount=0\r\nwhile(N!=0):\r\n P,Q=map(int,input().split())\r\n if Q-P>=2:\r\n count=count+1\r\n N=N-1\r\nif count==0:\r\n print(\"0\")\r\nelse:\r\n print(count)\r\n \r\n ", "rooms = int(input())\r\ncounter = 0\r\nfor i in range(rooms):\r\n pi , qi = map(int , input().split())\r\n if pi <= (qi-2):\r\n counter += 1\r\nprint(counter)", "rooms = int(input())\r\ncount = 0\r\nfor _ in range(rooms):\r\n l,a = map(int,input().split())\r\n if a - l >= 2:\r\n count += 1\r\nprint(count)", "a = int(input())\r\n\r\nans = 0\r\nfor i in range(a):\r\n pi, qi = map(int,input().split(\" \"))\r\n if qi-pi >= 2:\r\n ans = ans+1\r\nprint(ans)", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n acc = [int(num) for num in input().split()]\r\n if (acc[1] - acc[0] >= 2):\r\n count += 1\r\n\r\nprint(count)", "count = 0\r\n\r\nfor i in range(int(input())):\r\n p, q = [int(x) for x in input().split()]\r\n if q-p >= 2:\r\n count += 1\r\n\r\nprint(count)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Sun Oct 1 20:49:06 2023\r\n\r\n@author: user\r\n\"\"\"\r\nn=int(input())\r\ns=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n s+=1\r\nprint(s)", "import sys\r\n\r\nn = int(input())\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n p,q = map(int,input().split())\r\n if(q-p)>=2:\r\n cnt += 1\r\n\r\nprint(cnt) ", "count_rooms = int(input())\r\ngood_rooms = 0\r\nfor i in range(count_rooms):\r\n people, space = map(int, input().split())\r\n if space - (people + 2) >= 0:\r\n good_rooms += 1\r\nprint(good_rooms)\r\n\r\n\r\n\r\n\r\n \r\n\r\n", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n s,r=map(int,input().split())\r\n d=r-s\r\n if(d>=2):\r\n c=c+1\r\nprint(c)\r\n", "print(sum([(lambda x, y: y - x >= 2)(map(int, input().split())) for _ in range(int(input()))]))", "counter=0\r\nfor i in range(int(input())):\r\n room=list(map(int,input().split()))\r\n if (room[1]-room[0])>=2:\r\n counter+=1\r\nprint(counter) ", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n a=list(map(int, input().split()))\r\n if a[1]-a[0] >= 2:\r\n c+=1\r\nprint(c)", "def jud(room):\r\n if int(room[1]) - int(room[0]) >= 2:\r\n return 1\r\n else:\r\n return 0\r\n\r\nnum = int(input())\r\ncurrent_number = 0\r\nresult = 0\r\nwhile current_number < num:\r\n room = input().split()\r\n result += jud(room)\r\n current_number += 1\r\nprint(result)", "n=input()\n\nn=int(n)\n\nsum=0\nfor i in range(0,n,1):\n p,q=input().split()\n p=int(p)\n q=int(q)\n if q-p>=2:\n sum+=1\n\nprint(sum)\n \t\t\t \t\t \t \t\t \t\t \t\t\t\t\t", "n=int(input())\ncnt=0\nfor i in range(n):\n p, q=input().split()\n p=int(p)\n q=int(q)\n if(q-p)>=2:\n cnt+=1\nprint(cnt)\n\t \t\t \t\t \t\t \t\t \t\t\t\t \t\t\t \t\t\t\t \t", "x=int(input())\r\ncount=0\r\nfor i in range (x):\r\n p,q=list(map(int,input().split()))\r\n if((q-p)>=2):\r\n count+=1\r\nprint(count) ", "n = int(input())\r\n\r\nfree = []\r\nacco = []\r\n\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n free.append(a)\r\n acco.append(b)\r\n\r\ncount = 0 \r\nfor i in range(n):\r\n if acco[i] - free[i] >= 2:\r\n count += 1\r\nprint(count)", "n = int(input())\nCnt= 0\nfor i in range(n): #0 ~ 2 input 3 rooms\n p, q =input().split()\n p = int(p)\n q = int(q)\n if(q-p) >= 2:\n Cnt += 1\nprint (Cnt)\n#khattab\n\n\t\t \t\t \t\t \t \t\t\t\t\t\t \t\t \t \t\t \t", "c=0\r\nfor i in range(int(input())):\r\n n,m=map(int,input().split())\r\n if m-n>=2:\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = 0\r\nfor i in range(0,n):\r\n p = [int(x) for x in input().split(\" \")]\r\n if p[1] >= p[0]+2:\r\n a += 1\r\nprint(a)", "n = int(input())\r\ncount = 0\r\nfor i in range(n) : \r\n p , q =map(int ,input().split())\r\n if (q - p) >=2 :\r\n count+=1\r\nprint(count) ", "z = int(input())\r\na = []\r\nn = ''\r\nm = []\r\nfor i in range(z):\r\n\tx,y = map(int , input().split(' '))\r\n\td = y - x\r\n\ta.append(d)\r\nl = 0\r\nfor j in a:\r\n\tif (j>=2):\r\n\t\tl += 1\r\n\r\nprint (l)", "flats = int(input())\r\nquantity = 0\r\nfor i in range(flats):\r\n a, b = map(int, input().split())\r\n if b - a >= 2:\r\n quantity += 1\r\n\r\nprint(quantity)\r\n", "x = int(input())\r\nc = 0\r\nfor i in range(x):\r\n a,b = map(int, input().split())\r\n if a+2 <= b:\r\n c +=1\r\nprint(c)", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n\r\n if y-x>=2:\r\n c=c+1\r\n\r\nprint(c)\r\n\r\n ", "n=int(input())\r\ncount=0\r\nfor _ in range(n):\r\n occ,maxi=map(int,input().split())\r\n if occ<=maxi-2: count+=1\r\nprint(count)", "def isaccommodate(p,q):\r\n counter = 0\r\n if q - p >= 2:\r\n counter += 1\r\n else:\r\n pass\r\n return counter\r\n\r\nn = int(input())\r\nnum = 0\r\nfor _ in range(n):\r\n p,q = map(int, input().split())\r\n num += isaccommodate(p,q)\r\n\r\nprint(num)", "a=int(input())\r\nb=0\r\nc=0\r\nwhile b<a:\r\n d=input().split()\r\n if int(d[1])-int(d[0])>=2:\r\n c+=1\r\n b+=1\r\nprint(c)", "n=int(input(\"\"))\r\nsumm = 0\r\nfor i in range(n):\r\n q,m = list(map(int, input().split()))\r\n if m-q >= 2 :\r\n summ=summ + 1\r\nprint(summ)", "q=int(input())\r\nprint(sum(eval(input().replace(' ','-'))<-1 for _ in ' 'q))", "n = input()\nn = int(n)\nans=0\nfor i in range(n):\n a, b = input().split()\n a = int(a)\n b = int(b)\n if a+2<=b:\n ans+=1\nprint(ans)\n\n \t \t \t\t \t \t\t \t \t\t\t\t\t\t\t \t \t", "rooms = int(input())\r\navailable_room = 0\r\n\r\nfor x in range(rooms):\r\n already, capacity = map(int, input().split())\r\n\r\n if (capacity - already) >= 2:\r\n available_room += 1\r\n\r\nprint(available_room)\r\n\r\n", "n = int(input())\r\n\r\ncounter = 0\r\nfor i in range(n):\r\n people, capacity = map(int, input().split())\r\n if (capacity - people) >= 2:\r\n counter += 1\r\nprint(counter)\r\n", "n=int(input())\r\nt=0\r\nfor i in range(n):\r\n s=input().split()\r\n p,q=int(s[0]),int(s[1])\r\n if q-p>=2:\r\n t+=1\r\n else:\r\n continue\r\nprint(t)", "s=int(input())\r\nc=0\r\nfor i in range(s):\r\n p,q=map(int,input().split())\r\n n=q-p\r\n\r\n if n>=2:\r\n c+=1\r\nprint(c)", "Rooms = int(input())\r\nAvailableRooms = 0\r\n\r\nfor i in range(Rooms):\r\n People, Capacity = input().split(\" \")\r\n\r\n if int(Capacity) - int(People) >= 2:\r\n AvailableRooms += 1\r\n\r\nprint(AvailableRooms)\r\n", "n = int(input())\r\n\r\nm = []\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n m.append([a, b])\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if m[i][1] - m[i][0] >= 2:\r\n count += 1\r\n\r\nprint(count)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n a,b=[int(i) for i in input().split()]\r\n if (b-a)>=2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\n\r\nfor _ in range(n):\r\n p,q=list(map(int,input().split()))\r\n if abs(q-p)>=2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n a, b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n if (b - a) >= 2:\r\n count += 1\r\n else:\r\n pass\r\nprint(count)", "\r\nt = int(input())\r\nres = 0\r\nfor i in range(t):\r\n n , k = map(int,input().split())\r\n if k - n >= 2:\r\n res += 1\r\nprint(res)\r\n \r\n \r\n", "Rooms = int(input())\nAvailable_Rooms = 0\n\nfor i in range(Rooms):\n ppl , Capacity_ppl = map(int,input().split())\n if Capacity_ppl - ppl >= 2:\n Available_Rooms+=1\n \nprint(Available_Rooms)\n \t \t \t\t\t\t \t \t\t\t \t \t\t \t\t\t\t", "t=int(input())\r\nc=0\r\nfor _ in range(t):\r\n l=list(map(int,input().split()))\r\n if l[0] < l[1] - 1:\r\n c+=1\r\nprint(c)", "x=int(input())\r\nc=0\r\nfor i in range(x):\r\n w,v=map(int,input().split(' '))\r\n if v-w>=2:c+=1\r\nprint(c)", "n = int(input())\r\ncount = 0 \r\nfor i in range(0,n):\r\n p,q = map(int,input().split())\r\n if(q-p) >=2:\r\n count +=1 \r\nprint(count) ", "g = 0\r\nfor _ in range(int(input())):\r\n\ta,m = map(int,input().split())\r\n\tif (m-a)>=2:\r\n\t\tg+=1\r\nprint(g)\r\n ", "c=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n c=c+1 if (b-a)>=2 else c+0\r\nprint(c)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n p,q = list(map(int, input().split()))\r\n if q-p >= 2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nl = []\r\nc = 0\r\nfor i in range(n):\r\n l.append(list(map(int, input().split())))\r\nfor i in l:\r\n if (i[1] > i[0]) and (i[1] - i[0] > 1):\r\n c += 1\r\nprint(c) ", "# for _ in range(int(input())):\r\nn = int(input())\r\ncount =0\r\nfor i in range(n):\r\n t1,t2 = [int(x) for x in input().split()]\r\n if t2-t1>=2:\r\n count+=1\r\nprint(count)", "num_rooms = int(input())\r\n\r\nempty = 0\r\nfor i in range(num_rooms):\r\n p, q = list(map(int, input().split()))\r\n if q-p >= 2:\r\n empty += 1\r\n\r\nprint(empty)", "n = int(input())\nans = 0\nfor i in range(n): # 0 1 2\n p, q = input().split()\n p = int(p)\n q = int(q)\n if (q-p) >= 2:\n ans += 1\nprint(ans)\n\n \t \t \t\t\t\t \t \t\t\t\t \t \t\t", "a=input()\na=int(a)\nroom=0\nfor i in range(1,a+1):\n p,q=input().split()\n p=int(p)\n q=int(q)\n if q-p >=2:\n room=room+1\nprint(room)\n\t \t\t\t \t \t \t \t \t\t\t \t\t \t \t", "import sys\r\nline1 = int(sys.stdin.readline().strip())\r\ncounter = 0\r\nfor i in range(line1):\r\n line = sys.stdin.readline().strip().split()\r\n if int(line[1]) - int(line[0]) >= 2:\r\n counter += 1\r\nprint(counter)", "n = int(input())\r\nc=0\r\nfor i in range(0,n):\r\n v =list(map(int,input().split()))\r\n if(v[1]-v[0])>=2:\r\n c=c+1\r\nprint(c)", "n= input()\nn= int(n)\nx=0\nfor i in range(1,n+1):\n a,b= input().split()\n a= int(a)\n b= int(b)\n if((b-a)>=2):\n x+=1\nprint(x)\n \t \t \t\t \t \t \t\t\t\t\t \t \t\t \t", "# Read the number of rooms\r\nn = int(input())\r\n\r\n# Initialize a variable to count the rooms with enough free space for George and Alex\r\ncount = 0\r\n\r\n# Iterate through each room\r\nfor i in range(n):\r\n # Read the number of people in the room and the room's capacity\r\n pi, qi = map(int, input().split())\r\n \r\n # Check if there is enough free space for both George and Alex (at least 2)\r\n if qi - pi >= 2:\r\n count += 1\r\n\r\n# Print the number of rooms with enough free space\r\nprint(count)\r\n", "room = 0\nn = int(input())\nfor i in range (1 , n+1):\n p,q = input().split()\n p = int(p)\n q = int(q)\n if q - p > 1:\n room +=1\nprint(room)\n \t \t \t \t \t \t\t \t\t \t\t\t\t \t \t", "# Input\r\nn = int(input())\r\nrooms = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n# Count the number of rooms with free space for both George and Alex\r\ncount = sum(1 for room in rooms if room[1] - room[0] >= 2)\r\n\r\n# Output\r\nprint(count)", "n=int(input())\r\ndor=[]\r\ncount=0\r\nfor i in range(0,n):\r\n a,b=map(int,input().split())\r\n if (b-a) >= 2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n p,q = map(int,input().split())\r\n if q-p >=2:\r\n k+=1\r\n \r\n \r\nprint(k)\r\n ", "n=int(input())\r\ncount=0\r\nfor i in range(0,n):\r\n p,q=map(int,input().split())\r\n m=q-p\r\n if m>=2:\r\n count+=1\r\n else:\r\n count+=0\r\nprint(count)\r\n", "m=h=z=0\r\ne=int(input())\r\nfor i in range(e):\r\n\tm,h=map(int,input().split())\r\n\tif h-m>1:z+=1\r\nprint(z)", "t = int(input())\r\nctr = 0\r\n\r\nwhile t:\r\n s = input().split()\r\n if (int(s[1]) - int(s[0])) >= 2:\r\n ctr += 1\r\n \r\n t -= 1\r\n\r\nprint(ctr)", "n=int(input())\r\na=2\r\nb=0\r\nfor i in range(0,n):\r\n m,g=map(int,input().split())\r\n if m<g:\r\n if m+a<=g:\r\n b+=1\r\nprint(b)\r\n", "t = int(input())\r\nn =0\r\nfor i in range(t):\r\n x, y = input().split()\r\n x = int(x)\r\n y = int(y)\r\n if x - y <= -2 :\r\n n += 1\r\nprint(n)", "n=input()\nn=int(n)\nx=0\nfor i in range(1,n+1):\n A,B=input().split()\n A=int(A)\n B=int(B)\n if((B-A)>=2):\n x=x+1\nprint(x)\n \t\t\t\t \t\t \t\t\t\t \t\t\t\t \t\t\t", "t=int(input())\r\ncount=0\r\nfor _ in range(t):\r\n n,p=map(int,input().split())\r\n if p-n >=2:\r\n count=count+1\r\nprint(count) ", "# Read the number of rooms\r\nn = int(input())\r\n\r\n# Initialize a variable to count the number of rooms available for George and Alex\r\ncount = 0\r\n\r\n# Iterate through the rooms\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n \r\n # Check if there's enough space for both George and Alex\r\n if q - p >= 2:\r\n count += 1\r\n\r\n# Print the number of rooms available\r\nprint(count)\r\n", "number = int(input())\r\ncount = 0\r\nfor i in range(number):\r\n elements = [int(el) for el in input().split(\" \")]\r\n if elements[1] - elements[0] >= 2:\r\n count += 1\r\nprint(count)", "\n\nn = int(input())\n\nok = 0\nfor x in range(n):\n p, q = list( map(int, input().split(' ')) )\n if p + 2 <= q:\n ok += 1\nprint(ok)\n", "q=int(input())\r\nct=0\r\nfor _ in range(q):\r\n a,s=map(int,input().split())\r\n if((s-a)>=2):\r\n ct+=1\r\nprint(ct)", "c = 0\r\nfor i in range(int(input())):\r\n\r\n a,b = map(int,input().split())\r\n if b - a >= 2:\r\n c+= 1\r\nprint(c)", "chir = int(input())\r\nMeS = 0\r\nfor fz in range(chir):\r\n abc,bca = list(map(int,input().split()))\r\n if abs(abc-bca) >= 2:\r\n MeS+=1\r\nprint(MeS)", "n = int(input())\r\nrooms = 0\r\nfor i in range(n):\r\n x, y = map(int,input().split())\r\n if y - x >= 2: rooms +=1\r\nprint(rooms)", "n=int(input())\r\npeople=[]\r\nmaxp=[]\r\nrooms=0\r\nfor i in range(0,n):\r\n arr = list(map(int, input().split()))\r\n people.append(arr[0])\r\n maxp.append(arr[1])\r\nfor j in range (0,len(people)):\r\n if (int(maxp[j])-int(people[j]))> 1:\r\n rooms=rooms+1\r\nprint(rooms)", "n=int(input())\r\ns=0\r\nfor _ in range(n):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n s+=1\r\nprint(s)\r\n", "n=int(input())\r\ncount=0\r\nfor _ in range (n):\r\n pi,qi=map(int,input().split())\r\n if qi-pi>=2:\r\n count+=1\r\nprint(count)", "looper = int(input())\r\ncount = 0\r\nfor i in range(looper):\r\n inp = list(map(int,input().split()))\r\n if inp[1] - inp[0] >=2:\r\n count+=1\r\nprint(count)", "count = 0\r\nfor _ in range(int(input())):\r\n p , q = map(int, input().split())\r\n if p<=q-2:\r\n count+=1\r\nprint(count)", "n=input()\nn=int(n)\nx=0\nfor i in range(1,n+1):\n a,b=input().split()\n a=int(a)\n b=int(b)\n if (b-a)>=2:\n x=x+1\nprint(x)\n\n\n\t\t \t\t\t \t\t \t \t \t\t\t\t\t\t\t\t \t\t\t\t", "n = int(input())\r\nresult=0\r\nfor x in range (n):\r\n m,b=map(int,input().split())\r\n if b - m >= 2 :\r\n result +=1\r\nprint(result)", "n = int(input())\r\ncount = 0\r\n\r\nfor _ in range(n):\r\n p, q = input().split()\r\n p = int(p)\r\n q = int(q)\r\n if q - p >= 2: # Room can accommodate both George and Alex (2 free places required)\r\n count += 1\r\n\r\nprint(count)\r\n", "n=int(input())\r\nct=0\r\nwhile n!=0:\r\n p,q= map(int, input().split())\r\n if q-p>=2:\r\n ct+=1\r\n n-=1\r\nprint(ct)\r\n", "n = int(input())\nans=0\nfor i in range(n):\n p,q =map(int, input().split())\n if q-p>=2:\n ans+=1\nprint(ans)\n\t \t\t \t \t\t\t \t\t\t\t \t\t\t\t \t\t\t\t", "# Read input\r\nn = int(input())\r\n\r\n# Initialize a counter for valid rooms\r\nvalid_rooms = 0\r\n\r\n# Iterate through the rooms\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n if q - p >= 2: # Check if there's enough free space for both George and Alex\r\n valid_rooms += 1\r\n\r\n# Print the result\r\nprint(valid_rooms)\r\n", "n = int(input())\r\n\r\nrooms_with_free_space = 0\r\n\r\nfor _ in range(n):\r\n p, q = map(int, input().split()) \r\n if q - p >= 2: \r\n rooms_with_free_space += 1\r\n\r\nprint(rooms_with_free_space)\r\n", "n = int(input())\n\navailible_rooms = 0\n\nfor i in range(n):\n current,capacity = input().split()\n current,capacity = int(current),int(capacity)\n availible = capacity-current\n if availible>=2:\n availible_rooms+=1\n\nprint(availible_rooms)\n", "n = int(input())\r\n\r\nres = 0\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n res += (q - p >= 2)\r\n\r\nprint(res)", "num = int(input())\r\nc = 0\r\nfor i in range(num):\r\n a,b = map(int, input().split())\r\n if (b - a) >= 2:\r\n c += 1\r\nprint(c)", "cnt = 0\r\ntst = int(input())\r\nfor _ in range(tst):\r\n p, q = map(int, input().split())\r\n if abs(p - q) >= 2:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "N=input()\nN=int(N)\nR=0\nfor i in range(1,N+1):\n A,B=input().split()\n A=int(A)\n B=int(B)\n if ((B-A)>=2):\n R+=1\nprint(R)\n \t \t\t\t \t \t \t\t \t \t", "i = int(input())\r\n\r\nr=0\r\n\r\nfor j in range(i):\r\n t = input().split(' ')\r\n p = int(t[0])\r\n q = int(t[1])\r\n if q-p>= 2:\r\n r+=1\r\n \r\nprint(r)", "x = int(input())\r\ncount = 0\r\nfor _ in range(x):\r\n x,y = map(int,input().split())\r\n if y-x >= 2:\r\n count += 1\r\nprint(count)", "n=int(input())\r\nroom=0\r\nfor i in range(n):\r\n x,y = map(int, input().split())\r\n if ((y-x)>=2):\r\n room+=1\r\n\r\nprint(room)", "n = int(input())\r\nres = 0\r\nfor i in range(n):\r\n c1, c2 = map(int, input().split())\r\n if c2 - c1>=2:\r\n res +=1\r\nprint(res)\r\n ", "# import sys \n# sys.stdin = open(\"/Users/swasti/Desktop/coding/cp/codeforces/input.txt\", \"r\")\n# sys.stdout = open(\"/Users/swasti/Desktop/coding/cp/codeforces/output.txt\", \"w\")\ncount = 0\nfor i in range (int(input())):\n p,q = list(map(int,input().split()))\n if (q-p) >=2:\n count += 1\nprint (count)\n", "def canMove(room):\n people, size = room.split(\" \")\n if (int(size) - int(people)) > 1:\n return 1\n return 0 \n\ndef main():\n count = 0\n numRooms = input()\n for x in range(int(numRooms)):\n room = input()\n count += canMove(room)\n \n print(count)\n \n\nif __name__ == \"__main__\":\n main()", "arr = []\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n d = b - a\r\n arr.append(d)\r\nc = 0\r\nfor i in range(len(arr)):\r\n if arr[i] >= 2:\r\n c += 1\r\nprint(c)\r\n", "t = int(input())\r\nsum = 0\r\nfor _ in range(t):\r\n x , y = map(int,input().split())\r\n if y - x >= 2:\r\n sum += 1\r\nprint(sum)", "j=int(input())\r\nc=0\r\nfor _ in range(j):\r\n f,b=map(int,input().split())\r\n if((b-f)>=2):\r\n c+=1\r\nprint(c)", "def countspace(n, rooms):\r\n count = 0\r\n\r\n for pi, qi in rooms:\r\n if qi - pi >= 2:\r\n count += 1\r\n\r\n return count\r\n\r\nn = int(input())\r\nrooms = []\r\nfor _ in range(n):\r\n pi, qi = map(int, input().split())\r\n rooms.append((pi, qi))\r\n\r\nprint(countspace(n, rooms))\r\n", "a=int(input())\r\ns=0\r\nfor i in range(1,a+1):\r\n c,d=map(int,input().split())\r\n if (d-c)//2>0:\r\n s+=1\r\nprint(s)\r\n", "n = int(input())\r\nrooms_with_free_space = 0\r\n\r\nfor i in range(n):\r\n pi, qi = map(int, input().split())\r\n if qi - pi >= 2:\r\n rooms_with_free_space += 1\r\n\r\nprint(rooms_with_free_space)\r\n", "def acc(lst):\r\n sol = int()\r\n for item in lst:\r\n if item[1] - item[0] >= 2:\r\n sol += 1\r\n return sol\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n lst = []\r\n for item in range (n):\r\n lst.append(list(map(int, input().split())))\r\n print(acc(lst))", "numOfRooms = int(input())\r\ncanLive = 0\r\nfor r in range(numOfRooms):\r\n roomLived, roomCapacity = input().split()\r\n spare = int(roomCapacity) - int(roomLived)\r\n if (spare >= 2):\r\n canLive += 1\r\nprint(canLive)", "n=int(input())\r\nb=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if y-x>=2:\r\n b+=1\r\nprint(b)\r\n", "t = int(input())\r\n\r\nc = 0\r\n\r\nfor i in range(t):\r\n\r\n p, q = map(int, input().split())\r\n\r\n if abs(p - q) >= 2:\r\n\r\n c += 1\r\n\r\nprint(c) ", "n = int(input())\r\nx = []\r\nsum = 0\r\n\r\nfor i in range(n):\r\n x.append(list(map(int, input().split())))\r\n if (x[i][1] - x[i][0]) >= 2:\r\n sum += 1\r\n\r\nprint(sum)\r\n", "number_of_rooms = int(input())\r\navailable_counter = 0\r\n\r\nwhile number_of_rooms > 0:\r\n\r\n number_of_rooms -= 1\r\n\r\n capacities = [int(i) for i in input().split()]\r\n capacity = capacities[1] - capacities[0]\r\n\r\n if capacity >= 2:\r\n\r\n available_counter += 1\r\n\r\nprint(available_counter)", "n = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n if y - x >= 2:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\np = [0 for i in range(n)]\r\nq = [0 for i in range(n)]\r\ncnt = 0\r\nfor i in range(n):\r\n p[i], q[i] = map(int, input().split())\r\n if q[i] > p[i]+1:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "room = int(input())\r\nk = 0\r\nfor i in range(room):\r\n string = input()\r\n if int(string.split()[1])-int(string.split()[0])>=2:\r\n k+=1\r\nprint(k)", "def main():\n n = int(input())\n count = 0 \n while n>0:\n a,b = map(int,input().split(' '))\n if(b-a>=2):\n count+=1\n n=n-1\n\n print(count)\n\nmain()\n ", "t=int(input())\r\ncount=0\r\nfor i in range(t):\r\n p,q=map(int,input().split())\r\n if p<q and q-p>=2:\r\n count += 1\r\nprint(count)", "n = int(input())\r\nc = 0\r\nfor k in range(n):\r\n s = [int(j) for j in input ().split()]\r\n if s[1]-s[0]>=2:\r\n c+=1\r\nprint(c)", "a = int(input())\r\nk = 0\r\nfor i in range(a):\r\n b, c = map(int, input().split())\r\n if b + 2 <= c:\r\n k += 1\r\nprint(k)\r\n", "res=[]\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n res.append(b-a>=2)\r\nprint(sum(res))", "liczbaPokoi = int(input())\r\n\r\ndostepnePokoje = 0\r\nfor i in range(liczbaPokoi):\r\n liczbaOsob,pojemonsc = map(int, input().split())\r\n if (pojemonsc-liczbaOsob) >= 2:\r\n dostepnePokoje += 1\r\n\r\nprint(dostepnePokoje)\r\n", "def solve():\r\n n = int(input())\r\n\r\n cnt = 0\r\n for i in range (n):\r\n x, y = map(int, input().split())\r\n if (y - x >= 2):\r\n cnt += 1\r\n \r\n print(cnt)\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n\r\n", "available = 0\r\nfor i in range(int(input())):\r\n room = input().split()\r\n av = int(room[1])-int(room[0])\r\n if av>=2:\r\n available+=1\r\nprint(available)", "count=0\r\nfor i in range(int(input())):\r\n p,q=list(map(int,input().split()))\r\n if q-p >= 2:count+=1\r\nprint(count)\r\n\r\n", "result = \"\"\r\nn = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n p,q = input().split(\" \")\r\n if int(q) >= 2 and int(q) - int(p) >= 2:\r\n count += 1\r\nresult = count\r\nprint(f\"{result}\")", "# LUOGU_RID: 114989941\nans = 0\nfor _ in range(int(input())):\n a, b = map(int, input().split())\n ans += (b - a > 1)\nprint(ans)", "s=0;\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if b-a>=2:s+=1\r\nprint(s)", "y=int(input())\r\ntot=0\r\nfor i in range(y):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n tot+=1\r\nprint(tot)", "def sol():\r\n n=int(input())\r\n cnt=0\r\n for i in range(n):\r\n a,b=map(int,input().split(\" \"))\r\n if (b-a)>=2:\r\n cnt+=1\r\n print(cnt)\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nsol()", "print(sum(q - p > 1 for p, q in (map(int, input().split()) for _ in range(int(input())))))", "d=0\r\nfor i in range(int(input())):\r\n a,b=input().split()\r\n if (int(b)-int(a))>=2:\r\n d+=1\r\nprint(d)", "rooms = int(input())\r\n\r\nroom_details = []\r\nfor i in range(0, rooms):\r\n details = input() \r\n room_details.append(details.split())\r\n\r\ncount = 0\r\n\r\nfor detail in room_details:\r\n if int(detail[1])-int(detail[0])>=2:\r\n count += 1\r\n\r\nprint(count)\r\n", "n=int(input())\r\ncount=0\r\n\r\nfor _ in range(n):\r\n p, q=list(map(int,input().split()))\r\n if q-p>=2:\r\n count+=1\r\n\r\n \r\nprint(count)", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n l.append([a,b])\r\n\r\nc = 0\r\nm = []\r\nfor j in range(n):\r\n m = l[j]\r\n x,y= m[0],m[1]\r\n if abs(x-y)>=2:\r\n c+=1 \r\n\r\nprint(c)", "numb = int(input())\r\ncount = 0\r\nfor i in range(numb): \r\n hab = input()\r\n x , y = map(int, hab.split(\" \"))\r\n if abs (x - y) >= 2 :\r\n count += 1\r\nprint(count)", "n = int(input())\r\njudge = 0\r\nfor _ in range(n):\r\n p,q = map(int,input().split())\r\n if q-p >= 2:\r\n judge += 1\r\nprint(judge)", "c = 0\na = int(input())\nfor i in range(a):\n p, q = map(int, input().split())\n if q - p >= 2:\n c += 1\nprint(c)\n", "if __name__ == \"__main__\":\r\n n = int(input())\r\n c=0\r\n for i in range(n):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n c+=1\r\n print(c)\r\n", "c=0\r\nfor _ in range(int(input())):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n c=c+1\r\nprint(c) ", "n = int(input())\r\n\r\nfreeroom = 0\r\n\r\nwhile (n > 0):\r\n p,q = map(int,input().split())\r\n if q-p >= 2: freeroom += 1\r\n n -= 1\r\n\r\nprint(freeroom)", "n = int(input())\r\ns=0\r\nfor i in range(n):\r\n a , b = map(int,input().split())\r\n if(b-a>=2):\r\n s+=1\r\nprint(s)", "n=int(input())\r\nlist=[]\r\nnum=0\r\nfor i in range(n):\r\n list.append(input().split())\r\nfor i in range(n):\r\n if int(list[i][1])-int(list[i][0])>=2:\r\n num+=1\r\nprint(num)", "n = int(input())\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n p, q = map(int, input().split(' '))\r\n if q-p >= 2:\r\n res += 1\r\n\r\nprint(res)", "if __name__ == \"__main__\":\r\n rooms = int(input())\r\n result = 0\r\n for i in range(rooms):\r\n arr = input().split()\r\n p = int(arr[0])\r\n q = int(arr[1])\r\n \r\n if q-p >= 2:\r\n result += 1\r\n \r\n print(result)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n count+=1\r\n else:\r\n count+=0\r\nprint(count)", "t = int(input(\"\"))\r\nc = 0\r\nfor i in range(t):\r\n y = input(\"\").split(\" \")\r\n if abs(int(y[0]) - int(y[1]))>=2:\r\n c = c + 1 \r\n\r\nprint(c)", "t = int(input())\r\nc=0\r\nfor _ in range(t):\r\n m,n = map(int,input().split())\r\n if(n-m)>=2:\r\n c = c+1\r\nprint(c)", "t = int(input())\r\ncnt = 0\r\nfor _ in range(t):\r\n num = list(map(int, input().split()))\r\n if num[1]-num[0]>=2:\r\n cnt+=1\r\nprint(cnt)", "rooms=int(input())\r\navailablerooms=0\r\nfor i in range(rooms):\r\n p, q=[int(i) for i in input().split(\" \")]\r\n if (q-p)>=2:\r\n availablerooms+=1\r\n\r\nprint(availablerooms)\r\n", "n=int(input())\nroom = 0\nfor _ in range(n):\n p,q=map(int,input().split())\n if (q-p) >=2:\n room = room +1\nprint(room)\n \n\n \t \t \t\t \t \t\t \t \t\t \t \t \t", "n = int(input())\r\nj = 0\r\nfor i in range(n):\r\n s,x = map(int, input().split())\r\n if x - s >= 2:\r\n j +=1\r\n else:\r\n continue\r\nprint(j)\r\n\r\n\r\n", "l=[]\r\nfor i in range(int(input())):\r\n l.append(list(map(int,input().split())))\r\ncount=0\r\nfor l1 in l:\r\n if l1[1]-l1[0]>=2:\r\n count+=1\r\nprint(count)", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n ans+=1 \r\nprint(ans)\r\n ", "n = int(input())\r\ntotalIN = []\r\ntotalCap = []\r\nfor i in range (0, n):\r\n a,b = map(int, input().split())\r\n totalIN.append(a)\r\n totalCap.append(b)\r\n\r\ncount = 0\r\nfor i in range(n):\r\n if (totalCap[i]-totalIN[i]) >= 2:\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\r\nrooms = 0\r\nfor _ in range(n):\r\n occupied, total = map(int, input().split())\r\n if total - occupied >= 2:\r\n rooms += 1\r\nprint(rooms)\r\n", "n=int(input())\r\nc=0\r\nwhile n:\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n c+=1\r\n n-=1\r\nprint(c)", "t = int(input())\r\nc = 0\r\n\r\nfor _ in range(t):\r\n a, b = map(int, input().split())\r\n d = b - a\r\n if d >= 2:\r\n c += 1\r\n\r\nprint(c)\r\n", "t = int(input())\r\na = 0\r\nfor _ in range(t):\r\n people, capacity = map(int, input().split())\r\n if capacity - people >= 2:\r\n a += 1\r\nprint(a)\r\n", "t = int(input())\r\ncnt = 0\r\ni =0\r\nwhile i< t :\r\n p ,q= [int(x) for x in input().split()]\r\n if q-p>=2 :\r\n cnt= cnt+1\r\n i = i+1\r\nprint(cnt)", "n=int(input())\r\nc=0\r\nwhile n>0:\r\n\tn=n-1\r\n\ta,b=map(int,input().split())\r\n\tif a+2<=b:\r\n\t\tc=c+1\r\nprint(c)", "number_of_rooms = int(input())\r\navilable_rooms = 0\r\nfor _ in range(number_of_rooms):\r\n living_people, room_capacity = input().split()\r\n if int(room_capacity) - int(living_people) >= 2:\r\n avilable_rooms += 1\r\n\r\nprint(avilable_rooms)", "n=int(input())\r\nsum=0\r\nk=0\r\nfor i in range (0,n):\r\n p,q=map(int,input().split())\r\n t=q-p\r\n if t>=2:\r\n sum=sum+1\r\n else:\r\n k+=1\r\n \r\n \r\nprint(sum)", "n=int(input())\r\n\r\nans=0\r\nfor i in range(n):\r\n\tnum1,num2=input().split()\r\n\tnum1=int(num1)\r\n\tnum2=int(num2)\r\n\tsum=num2-num1\r\n\tif sum>=2:\r\n\t\tans+=1\r\n\r\nprint(ans)\r\n\r\n", "ct=0\r\nfor _ in range(int(input())):\r\n p,q=map(int,input().split())\r\n if abs(p-q)>=2:\r\n ct+=1\r\nprint(ct)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n room=input().split()\r\n p=int(room[0])\r\n q=int(room[1])\r\n if q-p>=2:\r\n x+=1\r\n else:\r\n x=x \r\nprint(x)", "a=int(input())\r\ns=0\r\nfor i in range(a):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n s=s+1\r\nprint(s)", "t=int(input())\r\navail=0\r\nfor b in range(t):\r\n n,m=map(int,input().split())\r\n if(m-n)>=2:\r\n avail+=1\r\nprint(avail) ", "def main():\n n = int(input())\n rooms = 0\n for _ in range(n):\n p, q = [int(el) for el in input().split()]\n if q - p > 1:\n rooms += 1\n print(rooms)\n\nif __name__ == '__main__':\n main()", "runs = int(input())\ncounter = 0\nfor i in range(runs):\n p, q = map(int, input().split())\n if q-p>=2:\n counter+=1\nprint(counter)\n\n", "count = 0 \r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n if a+2 <= b:\r\n count += 1 \r\nprint(count)", "n=int(input())\r\nk=0\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n if m==c:\r\n pass\r\n elif (c-m)>=2:\r\n k+=1\r\nprint(k)", "n = int(input())\r\nres = 0\r\n\r\nfor i in range (n):\r\n p, q = map(int, input().split())\r\n if (p + 2) <= q:\r\n res += 1\r\n\r\nprint(res)", "n = int(input())\r\nansw = 0\r\nfor i in range(n):\r\n k, l = map(int, input().split())\r\n if l-k >= 2:\r\n answ += 1\r\nprint(answ) ", "a=int(input())\r\nc=0\r\nfor i in range(a):\r\n b,n=(map(int,input().split()))\r\n if n-b>1:\r\n c+=1\r\nprint(c)", "n=int(input())\r\nmatrix = [[0 for x in range(2)] for y in range(n)]\r\n\r\nrows=0\r\nfor i in range(n):\r\n columns=0\r\n for word in input().split(' '):\r\n matrix[rows][columns]=int(word)\r\n columns+=1\r\n rows+=1\r\n\r\nnumbers_rooms=0\r\nfor rooms in matrix:\r\n if rooms[1]-rooms[0]>=2:\r\n numbers_rooms+=1\r\n\r\nprint(numbers_rooms)", "n = int(input())\r\n\r\nres = 0\r\nfor i in range(n):\r\n p, q = list(map(int, input().split()))\r\n if (q - p) >= 2:\r\n res += 1\r\n \r\n\r\nprint(res)", "ans=0\nn=int(input())\nfor i in range (1,n+1):\n cup_cap,max_cap=map(int,input().split())\n if max_cap-cup_cap >=2:\n ans+=1\nprint(ans)\n\t \t\t \t \t \t\t \t \t \t\t\t \t\t\t", "t = int(input())\r\nc = 0\r\n\r\nfor _ in range(t):\r\n p, cap = map(int, input().split())\r\n if cap - p >= 2:\r\n c += 1\r\n\r\nprint(c)\r\n", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n if y - x >= 2:\r\n count += 1\r\n\r\nprint(count)\r\n", "#https://codeforces.com/problemset/problem/467/A\r\nn = int(input())\r\ncont = 0\r\nwhile n > 0:\r\n a, b = map(int, input().split())\r\n if (((a + 2) <= b)):\r\n cont += 1\r\n\r\n n -= 1\r\n\r\nprint(cont)", "n = int(input())\nc = 0\nfor i in range(n):\n p, q = input().split()\n p = int(p)\n q = int(q)\n if p+2 <= q:\n c += 1\nprint(c)\n \t\t \t \t \t\t\t\t \t \t \t \t \t \t", "n = int(input())\r\nspace = 0\r\nfor i in range(n):\r\n p, q = [int(i) for i in input().split()]\r\n if q-1 > p:\r\n space += 1\r\nprint(space)", "n = int(input())\r\nallRooms = []\r\nfor i in range (n):\r\n allRooms.append(list(map(int,input().strip().split())))\r\n\r\ncount = 0\r\nfor i in range(n):\r\n if (allRooms[i][1] - allRooms[i][0]) >=2:\r\n count+=1\r\nprint(count)\r\n\r\n", "n = int(input())\r\nrooms = 0\r\nfor i in range(n):\r\n p, c = input().split()\r\n p, c = int(p), int(c)\r\n if c-p >= 2:\r\n rooms += 1\r\nprint(rooms)\r\n", "n = int(input())\r\ncounter = 0 \r\n\r\nfor i in range(n):\r\n p,q = map(int, input().split())\r\n if (q-p) >= 2:\r\n counter = counter + 1\r\n \r\nprint(counter)\r\n\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n list1=list(map(int,input().split()))[:2]\r\n if(list1[1]-list1[0]>=2):\r\n count+=1\r\nprint(count)\r\n ", "n=int(input())\r\ncc=0\r\nfor i in range(n):\r\n p, q=input().split()\r\n q=int(q)\r\n p=int(p)\r\n if q-p>=2:\r\n cc=cc+1\r\nprint(cc)", "n = input()\nn = int(n)\ncounter = 0\nfor i in range(1 , n+1):\n p,q = input().split()\n p = int(p)\n q = int(q)\n if q - p >= 2:\n counter += 1\nprint(counter)\n\t \t \t \t \t \t \t \t\t\t\t \t\t", "n = int(input())\r\nc=0\r\nfor i in range(n):\r\n L =input().split(\" \")\r\n L = [int(i) for i in L]\r\n if L[1] - L[0]>=2 :\r\n c += 1\r\nprint(c)", "n=input()\nn=int(n)\nans = 0\n\nfor i in range(0,n,1):\n\n p,q=input().split()\n p=int(p)\n q=int(q)\n if q-p>=2:\n ans+=1\n\nprint(ans)\n\n \t\t \t\t \t\t\t \t \t\t\t\t\t \t \t \t\t\t\t", "t=input()\r\nh=0\r\nwhile int(t)>0:\r\n t=int(t)-1\r\n x,y=input().split()\r\n if int(y)-int(x)>=2:\r\n h=int(h)+1\r\nprint(int(h))", "a = int(input())\r\ncounter = 0\r\nfor i in range(a):\r\n a_1, a_2 = map(int, input().split())\r\n if a_2 - a_1 >= 2:\r\n counter += 1\r\nprint(counter)\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n s=input()\r\n t=s.split()\r\n p=int(t[0])\r\n q=int(t[1])\r\n if q-p>=2:\r\n count+=1\r\nprint(count)", "r = 0\r\nl = []\r\nfor i in range(int(input())):\r\n l.append(list(map(int, input().split())))\r\nprint(sum(list(map(lambda p: p[-1]-p[0]>1, l))))", "t = int(input())\r\ncount = 0\r\n\r\nfor i in range(t):\r\n people, capacity = map(int, input().split())\r\n if capacity - people >= 2:\r\n count += 1\r\n\r\nprint(count)", "n=int(input())\r\nc=0\r\nfor i in range (n):\r\n p,q=map(int,input().split())\r\n if q>=p+2:\r\n c+=1\r\n continue\r\nprint(c)", "n=int(input())\ncounter=0\n\nfor i in range(0,n):\n p,q=input().split()\n p=int(p)\n q=int(q)\n if p+2 <=q:\n counter+=1\n\nprint(counter)\n\n \t\t\t\t \t \t\t \t\t \t\t \t \t \t\t", "ans = 0\r\nfor i in range (int(input())):\r\n p, q = input().split()\r\n p, q = int(p), int(q)\r\n if q - p >= 2:\r\n ans += 1\r\nprint(ans)", "a = int(input())\r\ncounter = 0\r\nfor i in range(a):\r\n b = input().split(' ')\r\n b = [int(x) for x in b]\r\n if b[1] - b[0] >= 2:\r\n counter += 1\r\nprint(counter)", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n p,q=input().split()\r\n p,q=int(p),int(q)\r\n if q-p >=2:\r\n c+=1\r\nprint(c)", "n = input()\nn = int(n)\nroom = 0\nfor i in range (1 , n + 1) :\n p , q = input().split()\n p = int(p)\n q = int(q)\n if q - p >= 2 :\n room = room + 1\nprint(room)\n \t\t\t \t \t\t\t\t \t\t\t\t \t\t\t\t\t \t \t \t", "a=int(input())\r\nc=0\r\nfor i in range(a):\r\n b=input().split()\r\n if (int(b[1])-int(b[0]))>=2:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nrooms = [list(map(int, input().split())) for i in range(n)]\r\nrooms_count = 0\r\nfor i in range(n):\r\n if rooms[i][1] - rooms[i][0] >= 2:\r\n rooms_count += 1\r\nprint(rooms_count)\r\n", "n=int(input())\r\nc=0\r\nwhile(n>0):\r\n a=[int(i) for i in input().split()]\r\n if a[1]-a[0]>=2:\r\n c+=1\r\n n-=1\r\nprint(c)", "s = int(input())\r\ncount = 0\r\nfor i in range(0,s):\r\n a, b = input().split()\r\n x= int(a)\r\n y = int(b)\r\n if(y-x>=2):\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n s = input().split()\r\n if int(s[1]) - int(s[0]) > 1:\r\n count += 1\r\nprint(count)", "n=int(input())\r\na=[]\r\nnum=0\r\nfor i in range(n):\r\n a.append(list(map(int,input().split(\" \"))))\r\n if a[i][1]-a[i][0]>=2:\r\n num+=1\r\nprint(num)", "number_of_room = int(input())\n\ncount = 0\n\nfor _ in range(number_of_room):\n p,q = map(int, input().split())\n if(q-p)>= 2:\n count = count + 1\n\nprint(count)", "t=int(input())\r\nc=0\r\nwhile t>0:\r\n a,b=map(int,input().split())\r\n if b-a>1:\r\n c+=1\r\n t-=1\r\nprint(c)", "g=0\r\nn=int(input())\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if y-x >=2:\r\n g+=1\r\nprint(g)", "a = int(input())\r\ni = 1\r\nlst1=[]\r\nlst2=[]\r\nwhile i<=a :\r\n x,y = map(int,input().split())\r\n lst1.append(x)\r\n lst2.append(y)\r\n i += 1\r\n\r\n\r\nind = 0\r\nans = 0\r\nwhile ind < a :\r\n c = lst1[ind]-lst2[ind]\r\n if abs(c) >= 2:\r\n ans += 1\r\n else:\r\n ans = ans\r\n ind += 1\r\nprint(ans)", "h=int(input())\r\ncnt=0\r\nfor _ in range(h):\r\n g,d=map(int,input().split())\r\n if((d-g)>=2):\r\n cnt+=1\r\nprint(cnt)", "n = int(input(\"\"))\r\ncountroom = 0\r\nfor i in range(n):\r\n p, q = map(int, input(\"\").split())\r\n if p==q:\r\n countroom+=0\r\n elif p<=q-2:\r\n countroom+=1\r\nprint(countroom)\r\n", "n=int(input())\r\ncount=0\r\nfor _ in range(n):\r\n lst=list(map(int,input().split()))\r\n if lst[1]>=lst[0]+2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nk=0\r\nm1=[]\r\nfor i in range(n):\r\n m = (input().split())\r\n m1.append(m)\r\n if int(m[1])-int(m[0])>=2:\r\n k+=1\r\nprint(k)", "x = int(input())\r\ncount = 0\r\nfor _ in range(x):\r\n y = list(map(int,input().split()))\r\n if y[1]-y[0] >=2:\r\n count += 1\r\nprint(count)\r\n\r\n", "t = int(input())\r\nc = 0\r\nfor i in range(t):\r\n p, q = map(int,input().split())\r\n if q-p >= 2:\r\n c = c + 1\r\nprint(c)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if q-p> 1: \r\n \tx+= 1\r\nprint(x)", "n=int(input())\r\n\r\nempty=0\r\nfor i in range(n):\r\n res = list(map(int, input().split()))\r\n ppl=res[0]\r\n cap=res[1]\r\n if ((cap-ppl)>=2):\r\n empty=empty+1\r\nprint(empty)", "n=int(input(\"\"))\r\ncount=0\r\nfor i in range(n):\r\n x=input(\"\").split()\r\n if int(x[1])-int(x[0])>=2:\r\n count+=1\r\n\r\nprint(count)\r\n ", "n = int(input())\ncount = 0\nfor _ in range(n):\n A, B = map(int, input().split())\n if (B - A) >= 2:\n count += 1\nprint(count)\n \t \t \t\t \t\t \t \t \t\t\t\t\t\t\t\t\t", "count=0\r\nfor k in range(int(input())):\r\n x,y=map(int,input().split())\r\n if(x+2<=y):\r\n count+=1\r\nprint(count)\r\n", "def main():\r\n n = int(input())\r\n room = 0\r\n for _ in range(n):\r\n p, q = map(int, input().split())\r\n room += 1 if q - p >= 2 else 0\r\n print(room)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "c=0\r\nn=int(input())\r\nls=[]\r\nfor i in range(n):\r\n row=list(map(int,input().split()))\r\n ls.append(row)\r\nfor i in range(n):\r\n if ls[i][1]-ls[i][0]>1:\r\n c+=1\r\nprint(c)", "occ = 0\r\nfor c in range(int(input())):\r\n hold = [int(c) for c in input().split(' ')]\r\n if hold[1] - hold[0] >= 2:\r\n occ += 1\r\nprint(occ)", "\r\nn = int(input())\r\nc=0\r\nfor i in range(n):\r\n p,q=map(int, input().split())\r\n if((q-p)>=2):\r\n c+=1\r\nprint(c)", "def count_accommodations(n, rooms):\r\n count = 0\r\n for i in range(n):\r\n if rooms[i][1] - rooms[i][0] >= 2:\r\n count += 1\r\n return count\r\n \r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n rooms = [tuple(map(int, input().split())) for _ in range(n)]\r\n print(count_accommodations(n, rooms))\r\n", "num_rooms = int(input())\r\n\r\nvacant_rooms = 0\r\n\r\nfor _ in range(num_rooms):\r\n a, b = map(int, input().split())\r\n if b-a >= 2:\r\n vacant_rooms += 1\r\n\r\nprint(vacant_rooms)", "test=int(input())\r\nans= 0\r\nwhile test>0:\r\n a,b= map(int, input().split())\r\n if b-a>= 2:\r\n ans+= 1\r\n test-=1\r\nprint(ans)\r\n", "n = int(input())\r\nroom = 0\r\nfor i in range(1 , n+1):\r\n p,q = input().split()\r\n p = int(p)\r\n q =int(q)\r\n if q - p > 1:\r\n room += 1\r\nprint(room)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n p, q = (int(j) for j in input().split(' '))\r\n space = q - p\r\n if space >= 2:\r\n count += 1\r\nprint(count)", "counter = 0\namount = int(input())\nfor i in range(amount):\n p_and_q = [int(i)for i in input().split()]\n if p_and_q[1] - p_and_q[0] >= 2:\n counter += 1\nprint(counter)\n", "c=0\r\nfor i in range(int(input())):\r\n of , mx =map(int,input().split())\r\n if (mx-of)>=2:c+=1\r\nprint(c)\r\n", "n = int(input())\ntotal = 0\n\nwhile (n > 0):\n \n p, q = map(int, input().split())\n if (q - p >= 2):\n total += 1\n \n n -= 1\n\nprint(total)\n", "n = int(input())\r\nans = 0 \r\n\r\nfor i in range(n):\r\n\ta = input().split()\r\n\tif int(a[1]) - int(a[0]) >= 2:\r\n\t\tans = ans + 1\r\n\r\nprint(ans)\r\n", "a=int(input())\r\nb=0\r\nfor i in range(a):\r\n d = list(map(int, input().split()))\r\n if d[1]-d[0]>=2:\r\n b+=1\r\nprint(b)", "n=int(input())\ns=0\nfor i in range(n):\n p,q=map(int,input().split())\n s+=1 if q-p>1 else 0\nprint(s)", "n=int(input())\nans=0\nfor i in range (n) :\n p,q=input().split()\n p=int(p)\n q=int(q)\n g=q-p\n if g>=2:\n ans+=1\nprint(ans)\n \t \t\t\t \t\t\t \t \t\t \t\t\t\t\t\t\t\t\t\t", "x=0\r\nfor _ in range(int(input())):\r\n a,s=map(int,input().split())\r\n if s-a>=2:\r\n x+=1\r\nprint(x)", "n = int(input())\r\nans = 0\r\nfor i in range(0, n):\r\n s = input().split()\r\n if int(s[1])-int(s[0]) >= 2:\r\n ans += 1\r\nprint(ans)\r\n", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n m,n=map(int,input().split())\r\n if((n-m)>=2):\r\n c+=1\r\nprint(c)", "count=0\r\nfor i in range(int(input())):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n count+=1 \r\nprint(count)", "x= int(input())\r\ny=0\r\nfor i in range(x):\r\n a,b = map(int,input().split())\r\n if b-a>=2:\r\n y+=1\r\nprint(y)", "t=int(input())\r\nw=0\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n c=b-a\r\n if c>=2:\r\n w+=1\r\nprint(w) ", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n while(p!=q and q-p>=2):\r\n count+=1\r\n break\r\nprint(count)", "t=int(input())\r\nr=0\r\nfor i in range(t):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n r+=1\r\n else:\r\n pass\r\nprint(r)", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n y=b-a\r\n if y>=2:\r\n c+=1\r\nprint(c)", "n = input()\nn = int(n)\nroom = 0\nfor i in range(1, n+1):\n p, q = input().split()\n p = int(p)\n q = int(q)\n if q - p >= 2:\n room = room + 1\nprint(room)\n\t \t\t \t\t \t \t\t \t \t \t\t\t\t \t \t \t", "a=int(input())\r\nk=0\r\nfor i in range(a):\r\n b,c=map(int,input().split())\r\n if c-b>1:\r\n k+=1\r\nprint(k)", "T = int(input())\r\nk = 0\r\nfor i in range(T):\r\n a = input()\r\n a = a.split()\r\n a = [int(x) for x in a]\r\n if (a[0]+1) < a[1]:\r\n k += 1\r\n else:\r\n continue\r\nprint(k)", "n = int(input())\r\np = [0]n\r\nq = [0]n\r\nnum = 0\r\nfor i in range(n):\r\n p[i], q[i] = (int(j) for j in input().split())\r\n if q[i] - p[i] >= 2:\r\n num += 1\r\nprint(num)", "x=input()\nx=int(x)\nr=0\nfor i in range(x):\n a,b = input().split()\n a = int(a)\n b = int(b)\n if b >= (a + 2):\n r += 1\nprint(r) \n\n \t\t \t\t\t\t\t \t \t\t\t \t\t \t \t\t \t\t\t \t", "from sys import stdin\r\naCum = 0\r\nfor _ in range(int(stdin.readline())):\r\n a = stdin.readline().split()\r\n if int(a[1])-int(a[0]) >= 2: aCum +=1\r\nprint(aCum)", "a = int(input())\r\nsq = [[int(i) for i in input().split()]for h in range(a)]\r\nd = 0\r\nfor i in range(a):\r\n if sq[i][0] + 2 <= sq[i][1]:\r\n d += 1\r\n\r\nprint(d)\r\n\r\n", "n = int(input())\r\n\r\ncount = 0\r\nfor _ in range(n):\r\n a = input().split(' ')\r\n p = int(a[0])\r\n q = int(a[1])\r\n\r\n x = q - p\r\n if x >= 2:\r\n count += 1\r\n\r\nprint(count)", "t=int(input())\r\nc=0\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n if (b-a)>=2:\r\n c+=1\r\n \r\nprint(c)", "N = int(input())\r\ncount = 0\r\n\r\nfor _ in range(N):\r\n P, Q = map(int, input().split())\r\n if Q - P >= 2:\r\n count += 1\r\n\r\nprint(count)\r\n", "def count_suitable_rooms(rooms):\r\n count = 0\r\n for room in rooms:\r\n p, q = room\r\n if q - p >= 2:\r\n count += 1\r\n return count\r\n\r\ndef main():\r\n n = int(input().strip())\r\n rooms = [tuple(map(int, input().strip().split())) for _ in range(n)]\r\n\r\n result = count_suitable_rooms(rooms)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\n\ntest=int(input())\ncnt=0\nfor t in range(test):\n n,q =map(int,input().split())\n diff=abs(n-q)\n if diff>1:cnt+=1\nprint(cnt)\n\t \t\t \t \t \t \t\t \t\t\t\t\t \t \t", "count = 0\nfor i in [0]int(input()):\n inp = input().split()\n p, q = int(inp[0]), int(inp[1])\n if q-p>=2:\n count+=1\nprint(count)\n", "n = input()\nn = int(n)\nx = 0\nfor i in range(n):\n p, q = input().split()\n p = int(p)\n q = int(q)\n if q - p >= 2:\n x = x + 1\nprint(x)\n\n\t \t\t \t \t \t\t\t \t\t \t\t\t\t\t\t", "n = int(input())\r\nc = 0\r\nfor i in range(n):\r\n j,k = map(int, input().split())\r\n if(j+2<=k):\r\n c+=1\r\nprint(c)", "# 467A - George And Accommodation\r\n# https://codeforces.com/problemset/problem/467/A\r\n\r\n# Input:\r\n# 1) Número de cuartos\r\nnum_cuartos = int(input())\r\n\r\n# Contador de cuartos disponibles en los que George y Alex pueden mudarse\r\ncuartos_disponibles = 0\r\n\r\n# Revisa la capacidad de cada cuarto\r\nfor cuarto in range(0, num_cuartos):\r\n\r\n # Input:\r\n # 1) Número de personas viviendo en el cuarto\r\n # 2) Número de personas que puede albergar el cuarto\r\n personas_viviendo, capacidad_cuarto = map(int, input().split())\r\n\r\n # Si el número de personas viviendo en el cuarto + 2 (George y Alex) es menor o igual a la capacidad del cuarto,\r\n # entonces pueden mudarse ahí, suma +1 al contador de cuartos disponibles\r\n if personas_viviendo + 2 <= capacidad_cuarto:\r\n cuartos_disponibles += 1\r\n\r\nprint(cuartos_disponibles)", "n = int(input())\ncntr = 0\nfor i in range(n):\n l = [int(x) for x in input().split()]\n a = l[0]\n b = l[1]\n if b-a>=2:\n cntr+=1\nprint(cntr)\n \t\t \t \t \t\t \t\t \t\t \t", "s = 0\r\nfor i in range(int(input())):\r\n p = [int(i) for i in input().split()]\r\n if p[1]-p[0]>=2:\r\n s+=1\r\nprint(s)\r\n", "number_of_ROOM = int(input()) \r\nc = 0 \r\nfor i in range(0,number_of_ROOM) : \r\n people,size = map(int,input().split(\" \")) \r\n if size >= 2 and (size - people) >=2 :\r\n c+=1 \r\nprint(c)", "n = int(input())\r\ncount_accomodations = 0\r\n\r\nfor i in range(n):\r\n accomodation = [int(num) for num in input().split()]\r\n if (accomodation[1] - accomodation[0] >= 2):\r\n count_accomodations += 1\r\n\r\nprint(count_accomodations)", "# Read the number of rooms\r\nn = int(input())\r\n\r\n# Initialize the count of rooms with free place for both George and Alex\r\ncount = 0\r\n\r\n# Iterate over each room\r\nfor i in range(n):\r\n # Read the number of people and the room's capacity\r\n p, q = map(int, input().split())\r\n # Check if there's enough free place for both George and Alex\r\n if q - p >= 2:\r\n count += 1\r\n\r\n# Print the count of rooms with free place for both George and Alex\r\nprint(count)\r\n", "k=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split(' '))\r\n if b-a>=2:\r\n k+=1\r\nprint(k)\r\n \r\n", "n = int(input()) \r\ncount=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a+2 <= b:\r\n count +=1 \r\nprint(count)", "# 467A - George and Accommodation\r\n\r\nnumber_of_rooms = int(input())\r\ni = 0\r\nrooms_they_can_move_into = 0\r\n\r\nwhile i < number_of_rooms:\r\n response = input()\r\n new_l = response.split(\" \")\r\n if (int(new_l[0]) + 2) <= int(new_l[1]):\r\n rooms_they_can_move_into +=1\r\n i += 1\r\n\r\nprint(rooms_they_can_move_into)", "def solve():\r\n x = int(input())\r\n ans = 0\r\n for _ in range(x):\r\n p, q = map(int, input().split())\r\n ans += q-p >= 2\r\n print(ans)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "def solve():\r\n n = int(input())\r\n res = 0\r\n for _ in range(n):\r\n p,q = input().split()\r\n if int(p)+2 <= int(q):\r\n res+=1\r\n return res\r\n\r\n\r\nprint(solve())", "c = 0\r\nfor s in [open(0)][1:]:\r\n c += eval(s.replace(' ', '-'))<-1\r\nprint(c)", "# Read the number of rooms\r\nn = int(input())\r\n\r\n# Initialize a counter for rooms with free place\r\ncount = 0\r\n\r\n# Iterate over each room\r\nfor _ in range(n):\r\n # Read the number of people living in the room and the room's capacity\r\n p, q = map(int, input().split())\r\n \r\n # Check if there's at least one free place in the room for both George and Alex\r\n if q - p >= 2:\r\n count += 1\r\n\r\n# Print the number of rooms with free place\r\nprint(count)", "n = int(input())\r\nc=0\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n \r\n if b-a>=2:\r\n c += 1\r\nprint(c)\r\n ", "ans=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n ans+=1\r\nprint(ans)", "a=int(input())\r\nk=0\r\nfor i in range(a):\r\n c=input()\r\n c=c.split(\" \")\r\n x,y=int(c[0]),int(c[1])\r\n if y-x>=2:\r\n k+=1\r\n else:\r\n continue\r\nprint(k)", "import sys\r\n\r\nuser_input = int(sys.stdin.readline().strip())\r\n\r\ncounter = 0\r\n\r\nfor i in range(user_input):\r\n a, b = map(int, sys.stdin.readline().strip().split())\r\n\r\n if (b - a) >= 2:\r\n counter += 1\r\nprint(counter)\r\n", "ct =0 \r\nn = int(input())\r\nfor i in range(n):\r\n p,q = map(int,input().split())\r\n if(p+2 <=q):\r\n ct = ct +1 \r\n \r\n\r\n\r\nprint(ct)", "num = int(input())\r\ncount = 0\r\nfor i in range(num):\r\n entrada = list(map(int, input().split()))\r\n if abs(entrada[0] - entrada[1]) >= 2:\r\n count += 1\r\nprint(count)", "N = int(input())\r\ncnt = 0\r\nfor i in range(N):\r\n X,Y = map(int,input().split())\r\n if((Y-X)>=2):\r\n cnt = cnt+1\r\nprint(cnt)", "n = input()\nn = int(n)\nroom = 0\nfor i in range (1,n+1):\n p,q = input().split()\n p=int(p)\n q=int(q)\n if q-p>=2:\n room = room + 1\nprint(room)\n \t\t \t\t\t \t\t \t\t\t\t \t\t", "n = int(input())\r\nmylist = [[int(i) for i in input().split()] for j in range(n)]\r\ncount = 0\r\nfor i in range(n):\r\n if mylist[i][1] - mylist[i][0] >= 2:\r\n count += 1\r\nprint(count)", "numbers = int(input())\r\nroom = []\r\nrooms = 0\r\nfor i in range(numbers):\r\n room = input().split(' ')\r\n if int(room[1]) - 2 >= int(room[0]):\r\n rooms += 1\r\nprint(rooms)", "# Read input\r\nn = int(input())\r\n\r\n# Initialize a variable to count rooms with free space\r\ncount = 0\r\n\r\n# Iterate through the rooms\r\nfor _ in range(n):\r\n pi, qi = map(int, input().split())\r\n \r\n # Check if there is enough free space for both George and Alex\r\n if qi - pi >= 2:\r\n count += 1\r\n\r\n# Print the number of rooms with free space\r\nprint(count)\r\n", "# -- coding: utf-8 --\n\"\"\"467A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YAcE_C3NXDvEY0NY_rHyte8StemSWBIK\n\"\"\"\n\nn=int(input())\ncount=0\nfor i in range(n):\n a,b=map(int,input().split())\n if (b-a)>=2:\n count+=1\nprint(count)", "n = int(input())\r\nk = 0\r\nfor _ in range(n):\r\n x,y = map(int, input().split())\r\n if y - x >= 2:\r\n k+=1 \r\nprint(k)", "c=0\r\nfor i in range(int(input())):\r\n a,b=[int(i) for i in input().split()]\r\n if(b-a>=2):\r\n c+=1\r\nprint(c)", "floors=int(input())\r\nroom_cap=[]\r\nfor i in range(0,floors):\r\n room_cap.append(input().split())\r\noutput=0\r\nfor i in room_cap:\r\n output+=(1if(int(i[1])-int(i[0])>=2)else 0)\r\nprint(output)", "t=int(input())\r\ncount=0\r\nwhile t>0:\r\n\tt=t-1\r\n\ti,j=map(int,input().split())\r\n\tif i+2<=j:\r\n\t\tcount=count+1\r\nprint(count)", "n=int(input())\r\ncnt=0\r\nfor i in range(n):\r\n a,b=input().split()\r\n a=int(a)\r\n b=int(b)\r\n if((b-a)>=2):\r\n cnt+=1\r\nprint(cnt)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n l=list(map(int,input().strip().split()))\r\n p=l[0]\r\n q=l[1]\r\n if q-p>=2:\r\n count=count+1\r\nprint(count)", "n=int(input())\nc=0\nfor i in range(1,n+1):\n p,q =input().split()\n p=int(p)\n q=int(q)\n if p+2<=q:\n c += 1\nprint(c)\n\n\n\n\n \t\t\t\t\t \t \t\t \t\t\t\t\t \t \t \t\t\t \t", "n=int(input())\ncount=0\n\nfor i in range(n):\n a, b=map(int, input().split())\n \n if b-a>=2:\n count+=1\nprint(count)", "# your code goes here\r\nn=int(input())\r\nres=0\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\tif (b-a) >= 2:\r\n\t\tres+=1\r\nprint(res)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n o, a = input().split()\r\n o = int(o)\r\n a = int(a)\r\n if a-o >= 2:\r\n count +=1\r\n \r\nprint(count)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n z=list(map(int,input().split()))\r\n if z[1]-2>=z[0]:\r\n count+=1\r\nprint(count)", "# LUOGU_RID: 133152194\na = int(input())\r\nf = 0\r\nfor i in range(1,a+1):\r\n b = input().split()\r\n c = int(b[0])\r\n d = int(b[1])\r\n e = d-c\r\n if e >= 2:\r\n f += 1\r\nprint(f)\r\n", "d = int(input())\r\nr = 0\r\nfor i in range(d):\r\n p,q = map(int,input().split())\r\n if p<q and q-p >= 2:\r\n r += 1\r\nprint(r)", "\r\n\r\n\r\ndef i():\r\n return(int(input()))\r\ndef l():\r\n return(list(map(int,input().split())))\r\ndef s():\r\n s = input()\r\n return(s)\r\ndef sl():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef m():\r\n return(map(int,input().split()))\r\n\r\n\r\nn = i()\r\nc = 0\r\n\r\nfor _ in range(n):\r\n a, b = m()\r\n if abs(a - b) >= 2:\r\n c += 1\r\nprint(c)", "n=int(input())\r\ncnt=0\r\nfor i in range(n):\r\n i=list(map(int,input().split()))\r\n cnt=cnt+1 if i[1]-i[0]>=2 else cnt\r\nprint(cnt)", "n=int(input())\r\nvacancy=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n vacancy+=1\r\n else:\r\n continue\r\nprint(vacancy)\r\n", "count=0\r\nfor i in range(int(input())):\r\n p,q=map(int,input().split())\r\n if p<=(q-2):\r\n count+=1\r\n else:\r\n count+=0\r\nprint(count)", "cnt=0\r\n\r\na=int(input())\r\nfor j in range(a):\r\n b,c=map(int,input().split())\r\n if c-b>=2:\r\n cnt=cnt+1\r\n\r\nprint(cnt)", "n = int(input()) # Total number of rooms\nrooms = []\n\nfor _ in range(n):\n p, q = map(int, input().split()) # Number of people in the room and room capacity\n rooms.append((p, q))\n\ncount = 0\n\nfor room in rooms:\n p, q = room\n if q - p >= 2:\n count += 1\n\nprint(count)\n \t\t\t\t \t\t\t \t\t\t \t \t \t \t\t\t\t \t", "#467A\r\nn = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n p,q = list(map(int,input().split()))\r\n if q-2 >= p:\r\n cnt += 1\r\nprint(cnt)", "k=0\r\nfor i in range(int(input())):\r\n m,n=map(int,input().split())\r\n if n-m>=2:\r\n k+=1\r\nprint(k)", "n = int(input())\r\nk = 0\r\n\r\nfor i in range(n):\r\n p, q = map(int, input().split())\r\n if p < (q - 1):\r\n k += 1\r\n\r\nprint(k)", "c = 0\r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n if abs(a-b) >=2:\r\n c+=1\r\nprint(c)", "counter=0\r\nn=int(input())\r\nwhile n>0:\r\n p,q=map(int,input().split())\r\n if (q-p)>=2:\r\n counter+=1\r\n n-=1\r\nprint(counter)", "n = int(input())\ncounter = 0\nfor i in range(0,n):\n p,q = input().split()\n p = int(p)\n q = int(q)\n if p+2 <= q:\n counter += 1\nprint(counter)\n\t \t \t\t\t\t \t\t\t \t\t\t \t \t\t\t\t\t\t\t \t", "c = 0\r\nfor _ in range(int(input())):\r\n a,b = list(map(int, input().split()))\r\n if(a+2 <= b):\r\n c += 1\r\nprint(c)", "n=int(input())\n\nrooms=0\nfor i in range(n):\n a,b=input().split()\n a=int(a)\n b=int(b)\n if(b-a>=2):\n rooms+=1\n\n\n\nprint(rooms)\n\n\t \t\t\t \t\t \t \t \t\t \t\t \t \t", "k = 0\r\nfor i in range(int(input())):\r\n a,b = map(int, input().split())\r\n if b-a >= 2:\r\n k += 1\r\nprint(k)\r\n", "n = int(input())\r\navailable_rooms=0\r\n\r\nfor i in range(n):\r\n roommates,capacity = map(int,input().split())\r\n\r\n if capacity-roommates>=2:\r\n available_rooms+=1\r\n\r\nprint(available_rooms)", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n a,b = list(map(int,input().split()))\r\n if b - a >= 2:\r\n k+=1\r\nprint(k)", "n = int(input())\ncounter = 0\ni=1\nwhile i <= n:\n p, q = input().split()\n p = int(p)\n q = int(q)\n if p + 2 <= q:\n counter += 1\n i+=1\nprint(counter)\n\t \t\t \t \t\t \t \t \t\t\t\t \t \t", "a=int(input())\r\nans=0\r\nfor i in range(a):\r\n m,n=map(int,input().split(' '))\r\n if n-m>=2:\r\n ans+=1\r\nprint(ans)", "def george_and_alex(n):\r\n count = 0\r\n for i in range(n):\r\n pi, qi = map(int, input().split())\r\n if pi + 2 <= qi:\r\n count += 1\r\n\r\n return count\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n print(george_and_alex(n))", "n = int(input())\r\ncounter = 0\r\n\r\nfor i in range(0,n):\r\n pi,qi = input().split()\r\n pi = int(pi)\r\n qi = int(qi)\r\n if qi - pi>=2:\r\n counter+= 1\r\nprint(counter)", "n = int(input())\r\nc = 0\r\nfor i in range(n):\r\n p, q = list(map(int,input().split()))\r\n s = q - p\r\n if s >= 2:\r\n c += 1\r\nprint(c)", "ct=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if b-a>1:\r\n ct+=1\r\nprint(ct)", "n = int(input())\navailable = 0\nfor i in range(n):\n p,q = map(int, input().split())\n if q-p >= 2:\n available += 1\nprint(available)", "cnt = 0\r\nfor i in range(int(input())):\r\n pi, qi = map(int,input().split())\r\n if qi - pi > 1:\r\n cnt += 1\r\nprint(cnt)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n p, q = [int(el) for el in input().split()]\r\n if p+2 <= q:\r\n count+=1\r\nprint(count)", "a=int(input())\r\nr=0\r\nfor x in range(a):\r\n s,d=list(map(int,input().split()))\r\n if(abs(s-d)>=2):\r\n r+=1\r\nprint(r)", "n=int(input())\ns=0\nfor i in range(n):\n p,q=list(map(int,input().split()))\n s+=(q-p>=2)\nprint(s)", "room_num=int(input())\r\nroom_for_living=0\r\nfor i in range(room_num):\r\n p,q=[int(x) for x in input().split()]\r\n if q-p >= 2:\r\n room_for_living+=1\r\nprint(room_for_living)", "# Online Python compiler (interpreter) to run Python online.\r\n# Write Python 3 code in this online editor and run it.\r\nn=int(input())\r\nc=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n c+=1\r\nprint(c)", "a,z=int(input()),0\r\nfor i in range(a):\r\n n,m=map(int,input().split())\r\n if m-2>=n:\r\n z+=1\r\nprint(z)", "n = int(input())\r\n\r\ni = 1\r\nsum = 0\r\n\r\nwhile i<=n:\r\n p,q = input().split()\r\n p = int(p)\r\n q = int(q)\r\n if (q-p)>=2:\r\n sum +=1\r\n i+=1\r\n \r\nprint(sum)", "cnt=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a==b:\r\n continue\r\n elif b>=2 and b-a>=2:\r\n cnt=cnt+1\r\nprint(cnt)", "n = input()\nn = int(n)\nb = 0\nfor i in range (0,n):\n x , y = input().split()\n x = int(x)\n y = int(y)\n if((y-x)>=2):\n b = b+1\nprint(b)\n\n\n \t\t \t\t \t \t\t\t\t \t\t \t\t \t\t \t\t", "length = int(input())\ncount = 0\nfor _ in range(length):\n nm = list(map(int, input().split(' ')))\n if nm[1] - nm[0] >= 2:\n count+=1\nprint(count)\n \n\n\n", "n = int(input())\r\nnum = []\r\nfor n in range(n):\r\n text = input().split()\r\n num.append(text)\r\nac = [i for i in num if int(i[1]) - int(i[0]) >= 2]\r\nprint(len(ac))\r\n", "n = int(input())\r\nc = 0\r\nfor _ in range(n):\r\n i = input().split(\" \")\r\n if (int(i[1]) - int(i[0])) >= 2:\r\n c += 1\r\n\r\nprint(c)\r\n", "n = int(input()) # Number of rooms\r\ncount = 0\r\n\r\nfor i in range(n):\r\n p, q = map(int, input().split()) # Number of people in the room and the room's capacity\r\n if q - p >= 2: # There should be at least 2 free places\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\nb = 0\r\nfor i in range(n):\r\n a,c = map(int, input().split())\r\n if c - a >= 2:\r\n b +=1\r\n else:\r\n b += 0\r\nprint(b)\r\n", "r=int(input())\r\nc=0\r\nfor i in range(r):\r\n n=input().split(' ')\r\n if int(n[0])+2<=int(n[1]):\r\n c+=1\r\nprint(c)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n p,q = list(map(int,input().split()))\r\n if q - p >= 2:\r\n count = count + 1\r\nprint(count)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n p, v = map(int, input().split())\r\n if v - p >= 2:\r\n ans += 1\r\nprint(ans)", "print(sum(y - x >= 2 for _ in range(int(input())) for x, y in [map(int, input().split())]))", "n = int(input())\r\nrooms = 0\r\n\r\nfor i in range(n):\r\n p, q = map(int, input().split())\r\n if p+2 <= q:\r\n rooms += 1\r\n\r\nprint(rooms)" ]	{"inputs": ["3\n1 1\n2 2\n3 3", "3\n1 10\n0 10\n10 10", "2\n36 67\n61 69", "3\n21 71\n10 88\n43 62", "3\n1 2\n2 3\n3 4", "10\n0 10\n0 20\n0 30\n0 40\n0 50\n0 60\n0 70\n0 80\n0 90\n0 100", "13\n14 16\n30 31\n45 46\n19 20\n15 17\n66 67\n75 76\n95 97\n29 30\n37 38\n0 2\n36 37\n8 9", "19\n66 67\n97 98\n89 91\n67 69\n67 68\n18 20\n72 74\n28 30\n91 92\n27 28\n75 77\n17 18\n74 75\n28 30\n16 18\n90 92\n9 11\n22 24\n52 54", "15\n55 57\n95 97\n57 59\n34 36\n50 52\n96 98\n39 40\n13 15\n13 14\n74 76\n47 48\n56 58\n24 25\n11 13\n67 68", "17\n68 69\n47 48\n30 31\n52 54\n41 43\n33 35\n38 40\n56 58\n45 46\n92 93\n73 74\n61 63\n65 66\n37 39\n67 68\n77 78\n28 30", "14\n64 66\n43 44\n10 12\n76 77\n11 12\n25 27\n87 88\n62 64\n39 41\n58 60\n10 11\n28 29\n57 58\n12 14", "38\n74 76\n52 54\n78 80\n48 49\n40 41\n64 65\n28 30\n6 8\n49 51\n68 70\n44 45\n57 59\n24 25\n46 48\n49 51\n4 6\n63 64\n76 78\n57 59\n18 20\n63 64\n71 73\n88 90\n21 22\n89 90\n65 66\n89 91\n96 98\n42 44\n1 1\n74 76\n72 74\n39 40\n75 76\n29 30\n48 49\n87 89\n27 28", "100\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0", "26\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2", "68\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2", "7\n0 1\n1 5\n2 4\n3 5\n4 6\n5 6\n6 8", "1\n0 0", "1\n100 100", "44\n0 8\n1 11\n2 19\n3 5\n4 29\n5 45\n6 6\n7 40\n8 19\n9 22\n10 18\n11 26\n12 46\n13 13\n14 27\n15 48\n16 25\n17 20\n18 29\n19 27\n20 45\n21 39\n22 29\n23 39\n24 42\n25 37\n26 52\n27 36\n28 43\n29 35\n30 38\n31 70\n32 47\n33 38\n34 61\n35 71\n36 51\n37 71\n38 59\n39 77\n40 70\n41 80\n42 77\n43 73", "3\n1 3\n2 7\n8 9", "53\n0 1\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20\n20 21\n21 22\n22 23\n23 24\n24 25\n25 26\n26 27\n27 28\n28 29\n29 30\n30 31\n31 32\n32 33\n33 34\n34 35\n35 36\n36 37\n37 38\n38 39\n39 40\n40 41\n41 42\n42 43\n43 44\n44 45\n45 46\n46 47\n47 48\n48 49\n49 50\n50 51\n51 52\n52 53", "55\n0 0\n1 1\n2 2\n3 3\n4 4\n5 5\n6 6\n7 7\n8 8\n9 9\n10 10\n11 11\n12 12\n13 13\n14 14\n15 15\n16 16\n17 17\n18 18\n19 19\n20 20\n21 21\n22 22\n23 23\n24 24\n25 25\n26 26\n27 27\n28 28\n29 29\n30 30\n31 31\n32 32\n33 33\n34 34\n35 35\n36 36\n37 37\n38 38\n39 39\n40 40\n41 41\n42 42\n43 43\n44 44\n45 45\n46 46\n47 47\n48 48\n49 49\n50 50\n51 51\n52 52\n53 53\n54 54", "51\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 62\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 73\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 82\n55 68\n55 70\n55 63\n55 55\n55 55\n55 55\n55 75\n55 75\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 73\n55 55\n55 82\n55 99\n55 60", "14\n1 1\n1 1\n1 55\n1 16\n1 1\n1 1\n1 55\n1 62\n1 53\n1 26\n1 1\n1 36\n1 2\n1 3"], "outputs": ["0", "2", "2", "3", "0", "10", "4", "12", "10", "8", "7", "22", "0", "0", "68", "5", "0", "0", "42", "2", "0", "0", "12", "8"]}	UNKNOWN	PYTHON3	CODEFORCES	648
8d058a1cf69c59bf09f0190d5dc2e875	Football	One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into n teams and played several matches, two teams could not play against each other more than once. The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches. Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly k times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table. The first line contains two integers — n and k (1<=≤<=n,<=k<=≤<=1000). In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1<=≤<=ai,<=bi<=≤<=n; ai<=≠<=bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 to n. If a tournir that meets the conditions of the problem does not exist, then print -1. Sample Input 3 1 Sample Output 3 1 2 2 3 3 1	[ "\ndef solve():\n\tn,k = map(int,input().split())\n\tparent = [set() for i in range(n+1)]\n\tans = []\n\tfor i in range(1,n+1):\n\t\tK = k\n\t\tfor j in range(1,n+1):\n\t\t\tif i!=j and j not in parent[i]:\n\t\t\t\tparent[j].add(i)\n\t\t\t\tans.append((i,j))\n\t\t\t\tK-=1\n\t\t\tif K==0:\n\t\t\t\tbreak\n\t\telse:\n\t\t\tprint(-1)\n\t\t\treturn\n\tprint(nk)\n\tfor i in ans:\n\t\tprint(i)\n\n\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", "from collections import defaultdict\r\nn, k = list(map(int, input().split()))\r\n\r\nadj = defaultdict(list)\r\ngames = 0\r\nbr = False\r\nfor i in range(1, n+1):\r\n count = 0\r\n for j in range(1, n+1):\r\n if count == k: break\r\n if i == j: continue\r\n if not i in adj[j]:\r\n adj[i].append(j)\r\n games += 1\r\n count += 1\r\n \r\n if count < k:\r\n br = True\r\n print(-1)\r\n break\r\n \r\nif not br:\r\n print(games)\r\n for team in adj:\r\n for i in adj[team]:\r\n print(team, i)", "def solve():\r\n y=input()\r\n y=y.split(\" \")\r\n n=int(y[0])\r\n k=int(y[1])\r\n if(n/2<=k):\r\n print(-1)\r\n return\r\n \r\n \r\n m={}\r\n \r\n \r\n for i in range(1,n+1):\r\n m[i]=[]\r\n j=1\r\n while(len(m[i])<k and j<=n):\r\n if i==j:\r\n j+=1\r\n continue\r\n if j in m:\r\n if i not in m[j]:\r\n m[i].append(j)\r\n j+=1\r\n continue\r\n \r\n else:\r\n m[i].append(j)\r\n j+=1\r\n continue\r\n \r\n j+=1\r\n \r\n \r\n print(nk)\r\n \r\n for i in m:\r\n for elem in m[i]:\r\n print(i,elem)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),109+7\r\n# sys.setrecursionlimit(10 * 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\nI = lambda : int(sys.stdin.buffer.readline())\r\nNeo = lambda : list(map(int, sys.stdin.buffer.readline().split()))\r\nn,k = Neo()\r\nif 2k > n-1:\r\n print(-1)\r\nelse:\r\n print(nk)\r\n for i in range(1,n+1):\r\n for j in range(i+1,k+i+1):\r\n if j > n:\r\n j = j%n\r\n print(i,j) ", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n nTeams, nWins = map(int, input().split())\r\n if nWins2 >= nTeams:\r\n return '-1'\r\n\r\n return matchesWith(nTeams, nWins)\r\n\r\n\r\ndef matchesWith(nTeams, nWins):\r\n teamsIndices = range(1, nTeams+1)\r\n teams = tuple(map(str, teamsIndices))\r\n teams += teams[:nWins]\r\n matches = []\r\n for i, iNext in zip(range(nTeams), teamsIndices):\r\n for j in range(iNext, iNext+nWins):\r\n matches.append(f'{teams[i]} {teams[j]}')\r\n\r\n return f'{len(matches)}\\n' + '\\n'.join(matches)\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n", "n,k = map(int, input().split()) \r\nif 2k+1>n:\r\n\tprint(-1)\r\nelse:\r\n\tprint(nk)\r\n\tfor i in range(n):\r\n\t\tfor j in range(k):\r\n\t\t\tprint(i+1,(i+1+j)%n+1)", "import sys\n\nf = sys.stdin\n\nn, k = map(int, f.readline().strip().split())\n\n\n\nif 2k>(n-1):\n\n print('-1')\n\nelse: \n\n r = [str(nk)]\n\n for i in range(n):\n\n for j in range(k):\n\n r.append(str(i+1) + ' ' + str((i+j+1)%n+1)) \n\n print('\\n'.join(r))\n\n\n\n\n\n\n\n# Made By Mostafa_Khaled", "n,k = map(int,input().split(\" \"))\r\nif 2k + 1 > n:\r\n print(-1)\r\nelse:\r\n print(nk)\r\n for i in range(1,n+1):\r\n for j in range(0,k):\r\n print(i, (i+j)%n + 1)\r\n ", "n,k=map(int,input().split(\" \"))\r\nif (n%2==0 and k>n//2 - 1) or (n%2==1 and k>n//2):\r\n print(-1)\r\nelse:\r\n print(nk)\r\n for i in range(n):\r\n for j in range(k):\r\n if i+j+2>n:\r\n print(i+1,i+j+2-n)\r\n else:\r\n print(i+1,i+j+2)\r\n", "n,k = map(int,input().split())\r\nif 2k>n-1:\r\n print(-1)\r\nelse:\r\n print(nk)\r\n for i in range(1,n+1):\r\n for j in range(i+1,i+k+1):\r\n y = -1\r\n if j>n:\r\n y = j-n\r\n else:\r\n y = j\r\n print(i,y)", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nif(n<2k+1):\r\n print(-1)\r\n \r\nelse :\r\n print(nk)\r\n for i in range(1,n+1):\r\n for j in range(k):\r\n print(i,(i+j)%n+1)", "n,k=map(int,input().split())\r\nif(k>(n-1)//2):\r\n print(-1)\r\nelse:\r\n print(nk)\r\n for i in range(1,n+1):\r\n for j in range(k):\r\n print(i,(i+j)%n+1)\r\n", "s,b=map(int,input().split())\r\nif bs > s(s-1)//2:\r\n\tprint(-1)\r\n\texit(0)\r\nprint(sb)\r\nd=[]\r\nfor i in range(1,b+1):\r\n\tfor j in range(s):\r\n\t\td.append(\"%d %d\"%(1+j,1+(j+i)%s))\r\nprint(\"\\n\".join(d))\r\n'''\r\ncode always run\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\n\r\nn,k = ilele()\r\nif not(2k <= n-1):\r\n print(-1)\r\nelse:\r\n print(nk)\r\n for i in range(1,n+1):\r\n for j in range(i+1,i+1+k):\r\n if j > n:\r\n j = j - n\r\n print(i,j)", "#code by AanchalTiwari\r\nn, k = map(int, input().split())\r\nif n < 2 * k + 1:\r\n print(-1)\r\nelse:\r\n print(nk)\r\n for i in range(1, n + 1):\r\n c = 1\r\n while c <= k:\r\n a = i\r\n b = i+c\r\n if i + c > n:\r\n a = i\r\n b = (i+c) % n\r\n print(a, b)\r\n c = c + 1\r\n", "import sys\r\nn,k=map(int,sys.stdin.readline().split())\r\na=n(n-1)//2\r\nif(nk>a):\r\n sys.stdout.write('-1')\r\nelse:\r\n sys.stdout.write(str(nk)+'\\n')\r\n for i in range(1,n+1):\r\n for j in range(k):\r\n s=str(i)+' '+str((i+j)%n+1)+'\\n'\r\n sys.stdout.write(s)\r\n" ]	{"inputs": ["3 1", "7 3", "4 1", "5 2", "5 2", "11 6", "11 5", "1 1", "2 1", "3 1", "1 2", "2 2", "3 2", "531 265", "775 388", "648 581", "57 13", "131 65", "609 305", "197 182", "248 54", "137 68", "47 24", "947 868", "205 50", "863 431", "445 223", "786 393", "122 52", "629 314", "571 286", "980 680", "869 239", "999 499", "999 500", "1000 751", "1000 162", "1000 936", "1000 178", "1000 499", "999 499", "1 1", "2 1", "4 2", "6 3", "10 5", "999 2", "1000 490"], "outputs": ["3\n1 2\n2 3\n3 1", "21\n1 2\n1 3\n1 4\n2 3\n2 4\n2 5\n3 4\n3 5\n3 6\n4 5\n4 6\n4 7\n5 6\n5 7\n5 1\n6 7\n6 1\n6 2\n7 1\n7 2\n7 3", "4\n1 2\n2 3\n3 4\n4 1", "10\n1 2\n1 3\n2 3\n2 4\n3 4\n3 5\n4 5\n4 1\n5 1\n5 2", "10\n1 2\n1 3\n2 3\n2 4\n3 4\n3 5\n4 5\n4 1\n5 1\n5 2", "-1", "55\n1 2\n1 3\n1 4\n1 5\n1 6\n2 3\n2 4\n2 5\n2 6\n2 7\n3 4\n3 5\n3 6\n3 7\n3 8\n4 5\n4 6\n4 7\n4 8\n4 9\n5 6\n5 7\n5 8\n5 9\n5 10\n6 7\n6 8\n6 9\n6 10\n6 11\n7 8\n7 9\n7 10\n7 11\n7 1\n8 9\n8 10\n8 11\n8 1\n8 2\n9 10\n9 11\n9 1\n9 2\n9 3\n10 11\n10 1\n10 2\n10 3\n10 4\n11 1\n11 2\n11 3\n11 4\n11 5", "-1", "-1", "3\n1 2\n2 3\n3 1", "-1", "-1", "-1", "140715\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "-1", "-1", "741\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n4 5\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n4 16\n4 17\n5 6\n5 7\n5 8\n5 9\n5 10\n5 11\n5 12\n5 13\n5 14\n5 15\n5 16\n5 17\n5 18\n6 7\n6 8\n6 9\n6 10\n6 11\n6 12\n6 13\n6 14\n6 15\n6 16\n6 17\n6 18\n6 19\n7 8\n7 9\n7 10\n7 11\n7 12\n7 13\n7 14\n7 15\n7 16\n7 17\n7 18\n7 19\n7...", "8515\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24...", "-1", "-1", "13392\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 3...", "9316\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21...", "-1", "-1", "10250\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n2 38\n2 3...", "371953\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "-1", "-1", "6344\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37...", "197506\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "-1", "-1", "207691\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "498501\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "-1", "-1", "162000\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "-1", "178000\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "499000\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "498501\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "-1", "-1", "-1", "-1", "-1", "1998\n1 2\n1 3\n2 3\n2 4\n3 4\n3 5\n4 5\n4 6\n5 6\n5 7\n6 7\n6 8\n7 8\n7 9\n8 9\n8 10\n9 10\n9 11\n10 11\n10 12\n11 12\n11 13\n12 13\n12 14\n13 14\n13 15\n14 15\n14 16\n15 16\n15 17\n16 17\n16 18\n17 18\n17 19\n18 19\n18 20\n19 20\n19 21\n20 21\n20 22\n21 22\n21 23\n22 23\n22 24\n23 24\n23 25\n24 25\n24 26\n25 26\n25 27\n26 27\n26 28\n27 28\n27 29\n28 29\n28 30\n29 30\n29 31\n30 31\n30 32\n31 32\n31 33\n32 33\n32 34\n33 34\n33 35\n34 35\n34 36\n35 36\n35 37\n36 37\n36 38\n37 38\n37 39\n38 39\n38 40\n39 40\n...", "490000\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1..."]}	UNKNOWN	PYTHON3	CODEFORCES	16
8d337c19b31a325a4e2c5679c23c0f2a	Fools and Roads	They say that Berland has exactly two problems, fools and roads. Besides, Berland has n cities, populated by the fools and connected by the roads. All Berland roads are bidirectional. As there are many fools in Berland, between each pair of cities there is a path (or else the fools would get upset). Also, between each pair of cities there is no more than one simple path (or else the fools would get lost). But that is not the end of Berland's special features. In this country fools sometimes visit each other and thus spoil the roads. The fools aren't very smart, so they always use only the simple paths. A simple path is the path which goes through every Berland city not more than once. The Berland government knows the paths which the fools use. Help the government count for each road, how many distinct fools can go on it. Note how the fools' paths are given in the input. The first line contains a single integer n (2<=≤<=n<=≤<=105) — the number of cities. Each of the next n<=-<=1 lines contains two space-separated integers ui,<=vi (1<=≤<=ui,<=vi<=≤<=n, ui<=≠<=vi), that means that there is a road connecting cities ui and vi. The next line contains integer k (0<=≤<=k<=≤<=105) — the number of pairs of fools who visit each other. Next k lines contain two space-separated numbers. The i-th line (i<=><=0) contains numbers ai,<=bi (1<=≤<=ai,<=bi<=≤<=n). That means that the fool number 2i<=-<=1 lives in city ai and visits the fool number 2i, who lives in city bi. The given pairs describe simple paths, because between every pair of cities there is only one simple path. Print n<=-<=1 integer. The integers should be separated by spaces. The i-th number should equal the number of fools who can go on the i-th road. The roads are numbered starting from one in the order, in which they occur in the input. Sample Input 5 1 2 1 3 2 4 2 5 2 1 4 3 5 5 3 4 4 5 1 4 2 4 3 2 3 1 3 3 5 Sample Output 2 1 1 1 3 1 1 1	[ "import sys\r\n\r\nMAX_H = 30\r\n\r\ninput = sys.stdin.readline\r\noutput = lambda x: sys.stdout.write(x)\r\n\r\nclass Node:\r\n def __init__(self):\r\n self.pars = []\r\n self.conn = {}\r\n self.count = 0\r\n self.depth = 0\r\n\r\n# input\r\nn = int(input())\r\n\r\nnodes = [Node() for _ in range(n + 1)]\r\n\r\n# roads\r\nfor ri in range(n - 1):\r\n u, v = map(int, input().split())\r\n nodes[u].conn[v] = ri\r\n nodes[v].conn[u] = ri\r\n\r\n# pairs\r\npairs = []\r\nk = int(input())\r\nfor _ in range(k):\r\n pairs.append(tuple(map(int, input().split())))\r\n \r\n# input done\r\n\r\n# root tree at 1\r\nstack = [1]\r\nwhile len(stack) > 0:\r\n curr = stack.pop()\r\n cn = nodes[curr]\r\n for o, r in cn.conn.items():\r\n stack.append(o)\r\n on = nodes[o]\r\n del on.conn[curr]\r\n on.depth = cn.depth + 1\r\n on.pars.append(curr)\r\n\r\n# calculate binary jumps\r\nfor jh in range(1, MAX_H):\r\n for i in range(1, n + 1):\r\n cn = nodes[i]\r\n if len(cn.pars) >= jh:\r\n par = nodes[cn.pars[jh - 1]]\r\n if len(par.pars) >= jh:\r\n cn.pars.append(par.pars[jh - 1])\r\n\r\ndef lca(a, b):\r\n # equalize depth\r\n if nodes[a].depth > nodes[b].depth:\r\n a, b = b, a\r\n \r\n dd = nodes[b].depth - nodes[a].depth\r\n for h in range(MAX_H):\r\n if dd & (1 << h):\r\n b = nodes[b].pars[h]\r\n\r\n if a == b:\r\n return a\r\n\r\n # find nodes a layer below the lca\r\n for h in range(MAX_H)[::-1]:\r\n if h < len(nodes[a].pars):\r\n pa = nodes[a].pars[h]\r\n pb = nodes[b].pars[h]\r\n if pa != pb:\r\n a = pa\r\n b = pb\r\n \r\n return nodes[a].pars[0]\r\n \r\nfor a, b in pairs:\r\n nodes[a].count += 1\r\n nodes[b].count += 1\r\n nodes[lca(a, b)].count -= 2\r\n\r\nroads = [0 for _ in range(n - 1)]\r\nstack = [(1, 0)]\r\nwhile len(stack) > 0:\r\n curr, state = stack.pop()\r\n cn = nodes[curr]\r\n \r\n if state == 0:\r\n stack.append((curr, 1))\r\n for o in cn.conn:\r\n stack.append((o, 0))\r\n else:\r\n for o, r in cn.conn.items():\r\n oc = nodes[o].count\r\n cn.count += oc\r\n roads[r] = oc\r\n\r\noutput(\" \".join(map(str, roads)))\r\noutput(\"\\n\")\r\n \r\n", "from io import BytesIO, IOBase\r\nimport sys\r\nimport os\r\n\r\n# import time\r\nimport bisect\r\n# import functools\r\nimport math\r\nimport random\r\n# import re\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom functools import cmp_to_key, lru_cache, reduce\r\nfrom heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\nfrom itertools import accumulate, combinations, permutations, count, product\r\nfrom operator import add, iand, ior, itemgetter, mul, xor\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom typing import \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\nBUFSIZE = 5096\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\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 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\r\nsys.stdin = IOWrapper(sys.stdin)\r\nsys.stdout = IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef I():\r\n return input()\r\n\r\ndef II():\r\n return int(input())\r\n\r\ndef MII():\r\n return map(int, input().split())\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\ninf = float('inf')\r\n\r\n# from types import GeneratorType\r\n\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(args, *kwargs):\r\n# if stack:\r\n# return f(args, *kwargs)\r\n# else:\r\n# to = f(args, *kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n\r\n# RANDOM = random.getrandbits(32)\r\n\r\n# class Wrapper_str(str):\r\n# def __init__(self, x):\r\n# str.__init__(x)\r\n\r\n# def __hash__(self):\r\n# return super(Wrapper_str, self).__hash__() ^ RANDOM\r\n\r\n# class Wrapper_tuple(tuple):\r\n# def __init__(self, x):\r\n# tuple.__init__(x)\r\n\r\n# def __hash__(self):\r\n# return super(Wrapper_tuple, self).__hash__() ^ RANDOM\r\n\r\n# class Wrapper_int(int):\r\n# def __init__(self, x):\r\n# int.__init__(x)\r\n\r\n# def __hash__(self):\r\n# return super(Wrapper_int, self).__hash__() ^ RANDOM\r\n\r\nclass LCA:\r\n def __init__(self, g, root, f=max, ide_ele=0):\r\n # g[v]: (cost, u)\r\n self.n = len(g)\r\n self.root = root\r\n self.f = f\r\n self.ide_ele = ide_ele\r\n self.num = (self.n).bit_length()\r\n self.depth = [0]self.n\r\n self.parent = [[-1]self.n for i in range(self.num)]\r\n self.size = [1]n\r\n \r\n s = [root]\r\n while s:\r\n v = s.pop()\r\n order.append(v)\r\n for u in g[v]:\r\n if u == self.parent[0][v]:\r\n continue\r\n self.parent[0][u] = v\r\n self.depth[u] = self.depth[v]+1\r\n s.append(u)\r\n order.reverse()\r\n for v in order:\r\n p = self.parent[0][v]\r\n if p != -1:\r\n self.size[p] += self.size[v]\r\n \r\n # doubling\r\n for k in range(self.num-1):\r\n for v in range(self.n):\r\n if self.parent[k][v] == -1:\r\n self.parent[k+1][v] = -1\r\n else:\r\n self.parent[k+1][v] = self.parent[k][self.parent[k][v]]\r\n \r\n def getLCA(self, u, v):\r\n if self.depth[u] > self.depth[v]:\r\n u, v = v, u\r\n for k in range(self.num):\r\n if ((self.depth[v]-self.depth[u]) >> k) & 1:\r\n v = self.parent[k][v]\r\n if u == v:\r\n return u\r\n \r\n for k in reversed(range(self.num)):\r\n if self.parent[k][u] != self.parent[k][v]:\r\n u = self.parent[k][u]\r\n v = self.parent[k][v]\r\n return self.parent[0][u]\r\n\r\n def getParent(self, u):\r\n return self.parent[0][u]\r\n \r\n def search(self, v, x):\r\n for k in reversed(range(self.num)):\r\n if (x>>k)&1:\r\n v = self.parent[k][v]\r\n return v\r\n\r\norder = []\r\nn = II()\r\n\r\nedges = []\r\npath = [[] for _ in range(n)]\r\nfor _ in range(n - 1):\r\n u, v = GMI()\r\n edges.append((u, v))\r\n path[u].append(v)\r\n path[v].append(u)\r\n\r\nlca = LCA(path, 0)\r\n\r\ndiff = [0] * (n + 1)\r\nq = II()\r\nfor _ in range(q):\r\n u, v = GMI()\r\n diff[u] += 1\r\n diff[v] += 1\r\n l = lca.getLCA(u, v)\r\n diff[l] -= 2\r\n\r\nfor i in order:\r\n diff[lca.getParent(i)] += diff[i]\r\n\r\nans = []\r\nfor u, v in edges:\r\n if lca.depth[u] > lca.depth[v]:\r\n ans.append(diff[u])\r\n else:\r\n ans.append(diff[v])\r\nprint(*ans)" ]	{"inputs": ["5\n1 2\n1 3\n2 4\n2 5\n2\n1 4\n3 5", "5\n3 4\n4 5\n1 4\n2 4\n3\n2 3\n1 3\n3 5"], "outputs": ["2 1 1 1 ", "3 1 1 1 "]}	UNKNOWN	PYTHON3	CODEFORCES	2
8d65492fc90cdeead7cd95db3a21418d	none	Young Teodor enjoys drawing. His favourite hobby is drawing segments with integer borders inside his huge [1;m] segment. One day Teodor noticed that picture he just drawn has one interesting feature: there doesn't exist an integer point, that belongs each of segments in the picture. Having discovered this fact, Teodor decided to share it with Sasha. Sasha knows that Teodor likes to show off so he never trusts him. Teodor wants to prove that he can be trusted sometimes, so he decided to convince Sasha that there is no such integer point in his picture, which belongs to each segment. However Teodor is lazy person and neither wills to tell Sasha all coordinates of segments' ends nor wills to tell him their amount, so he suggested Sasha to ask him series of questions 'Given the integer point xi, how many segments in Fedya's picture contain that point?', promising to tell correct answers for this questions. Both boys are very busy studying and don't have much time, so they ask you to find out how many questions can Sasha ask Teodor, that having only answers on his questions, Sasha can't be sure that Teodor isn't lying to him. Note that Sasha doesn't know amount of segments in Teodor's picture. Sure, Sasha is smart person and never asks about same point twice. First line of input contains two integer numbers: n and m (1<=≤<=n,<=m<=≤<=100<=000) — amount of segments of Teodor's picture and maximal coordinate of point that Sasha can ask about. ith of next n lines contains two integer numbers li and ri (1<=≤<=li<=≤<=ri<=≤<=m) — left and right ends of ith segment in the picture. Note that that left and right ends of segment can be the same point. It is guaranteed that there is no integer point, that belongs to all segments. Single line of output should contain one integer number k – size of largest set (xi,<=cnt(xi)) where all xi are different, 1<=≤<=xi<=≤<=m, and cnt(xi) is amount of segments, containing point with coordinate xi, such that one can't be sure that there doesn't exist point, belonging to all of segments in initial picture, if he knows only this set(and doesn't know n). Sample Input 2 4 1 2 3 4 4 6 1 3 2 3 4 6 5 6 Sample Output 4 5	[ "import sys\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(100000)\r\nfrom collections import defaultdict, deque\r\nfrom itertools import permutations\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\nimport bisect\r\ndef lis(a):\r\n dp = [a[0]]\r\n l = [1]+[0](len(a)-1)\r\n for i in range(1, len(a)):\r\n if a[i] >= dp[-1]:\r\n dp.append(a[i])\r\n l[i] = len(dp)\r\n continue\r\n index = bisect.bisect_right(dp, a[i])\r\n l[i] = index + 1\r\n dp[index] = a[i]\r\n return l\r\n\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, m = II()\r\nx = [0] (m+1)\r\nfor i in r(n):\r\n a, b = II()\r\n x[a] += 1\r\n if b < m:\r\n x[b+1] -= 1\r\nfor i in r(1,m+1):\r\n x[i] += x[i-1]\r\nx = x[1:]\r\nres = -1\r\nfor i , j in zip(lis(x), lis(x[::-1])[::-1]):\r\n res = max(i+j-1,res)\r\np(res)\r\n" ]	{"inputs": ["2 4\n1 2\n3 4", "4 6\n1 3\n2 3\n4 6\n5 6", "43 1319\n750 1030\n857 946\n941 1203\n407 1034\n947 1290\n546 585\n630 1201\n72 342\n693 1315\n34 719\n176 1097\n36 931\n198 973\n5 1025\n892 1054\n461 1287\n195 1273\n832 1039\n308 955\n642 866\n770 838\n440 777\n289 948\n98 814\n458 768\n82 265\n300 596\n182 706\n368 1225\n237 626\n36 348\n100 222\n46 937\n364 396\n288 668\n1158 1243\n31 1108\n570 1000\n435 619\n339 1007\n132 734\n281 441\n636 1319", "31 1600\n643 1483\n8 475\n15 472\n49 81\n300 1485\n627 682\n44 443\n1191 1541\n478 732\n1112 1202\n741 1341\n475 1187\n1218 1463\n523 1513\n355 477\n1259 1559\n384 928\n487 766\n227 1224\n1102 1268\n833 1240\n872 1342\n666 1075\n734 874\n32 880\n1411 1536\n520 778\n179 1003\n51 313\n1148 1288\n1467 1509", "38 1109\n61 332\n429 756\n260 272\n57 991\n420 985\n143 219\n399 925\n486 1079\n69 881\n75 447\n678 774\n973 1016\n983 1059\n518 1049\n393 853\n375 1101\n475 946\n300 427\n294 715\n504 798\n211 1066\n730 815\n114 515\n589 1001\n464 1014\n451 757\n370 1017\n225 619\n452 988\n611 955\n349 1029\n73 165\n759 951\n574 803\n253 1045\n545 565\n603 773\n226 453", "11 3\n1 1\n1 1\n1 1\n1 1\n2 2\n2 2\n2 2\n3 3\n3 3\n3 3\n3 3"], "outputs": ["4", "5", "1082", "1181", "996", "2"]}	UNKNOWN	PYTHON3	CODEFORCES	1
8d7482c6a683d3296ea22a704783715b	Om Nom and Necklace	One day Om Nom found a thread with n beads of different colors. He decided to cut the first several beads from this thread to make a bead necklace and present it to his girlfriend Om Nelly. Om Nom knows that his girlfriend loves beautiful patterns. That's why he wants the beads on the necklace to form a regular pattern. A sequence of beads S is regular if it can be represented as S<==<=A<=+<=B<=+<=A<=+<=B<=+<=A<=+<=...<=+<=A<=+<=B<=+<=A, where A and B are some bead sequences, "<=+<=" is the concatenation of sequences, there are exactly 2k<=+<=1 summands in this sum, among which there are k<=+<=1 "A" summands and k "B" summands that follow in alternating order. Om Nelly knows that her friend is an eager mathematician, so she doesn't mind if A or B is an empty sequence. Help Om Nom determine in which ways he can cut off the first several beads from the found thread (at least one; probably, all) so that they form a regular pattern. When Om Nom cuts off the beads, he doesn't change their order. The first line contains two integers n, k (1<=≤<=n,<=k<=≤<=1<=000<=000) — the number of beads on the thread that Om Nom found and number k from the definition of the regular sequence above. The second line contains the sequence of n lowercase Latin letters that represent the colors of the beads. Each color corresponds to a single letter. Print a string consisting of n zeroes and ones. Position i (1<=≤<=i<=≤<=n) must contain either number one if the first i beads on the thread form a regular sequence, or a zero otherwise. Sample Input 7 2 bcabcab 21 2 ababaababaababaababaa Sample Output 0000011000110000111111000011	[ "\ndef prefix_function(s: str):\n n = len(s)\n pi = [0] * n\n k = 0\n for i in range(1, n):\n while k > 0 and s[i] != s[k]:\n k = pi[k - 1]\n if s[i] == s[k]:\n k += 1\n pi[i] = k\n return pi\n\ndef z_function(s: str):\n n = len(s)\n z = [0] * n\n l, r = 0, 0\n for i in range(1, n):\n z[i] = 0 if i >= r else min(r - i, z[i - l])\n while i + z[i] < n and s[z[i]] == s[i + z[i]]:\n z[i] += 1\n if i + z[i] > r:\n l, r = i, i + z[i]\n return z\n\nn, k = map(int, input().split())\ns = input()\npi = prefix_function(s)\n\nans = [0] * n\nfor i in range(n):\n L = i + 1\n T = L - pi[i]\n have, remain = divmod(L, T)\n # print(L, T, have, remain)\n len_ab = have // k * T\n len_a = (have % k) * T + remain\n if len_ab >= len_a:\n ans[i] = 1\nprint(\"\".join(map(str, ans)))", "def readints():\r\n return map(int, input().split())\r\n\r\n# https://cp-algorithms.com/string/z-function.html#implementation\r\ndef z_function(n, s):\r\n z = [0] * n\r\n l, r = 0, 0\r\n for i in range(1, n):\r\n if i < r:\r\n z[i] = 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 = i\r\n r = i + z[i]\r\n return z\r\n\r\ndef modinv(a, m):\r\n x0, y0, z0 = 1, 0, m\r\n x1, y1, z1 = 0, 1, a\r\n while z1 != 1:\r\n c = z0 // z1\r\n x0, x1 = x1, x0 - c * x1\r\n y0, y1 = y1, y0 - c * y1\r\n z0, z1 = z1, z0 - c * z1\r\n ans = y1 % m\r\n if ans < 0:\r\n ans += m\r\n return ans\r\n\r\np = 31\r\nm = 10*9 + 9\r\n\r\nn, k = readints()\r\ns = [ord(c) - 96 for c in input()]\r\n\r\nif k == 1:\r\n print('1' n)\r\n exit(0)\r\n\r\np_pow = [1]\r\nfor i in range(n):\r\n p_pow.append(p_pow[-1] * p % m)\r\n\r\nh = [s[0]]\r\nfor i in range(1, n):\r\n h.append((h[i - 1] + s[i] * p_pow[i]) % m)\r\n\r\ndef rep_hash(w, k):\r\n \"\"\"\r\n h[w - 1] * (1 + p^w + p^2w + ... + p^(k-1)w)\r\n h[w - 1] * ((p^w)^k - 1) / (p^w - 1)\r\n \"\"\"\r\n numer = pow(p_pow[w], k, m) - 1\r\n denom = p_pow[w] - 1\r\n return h[w - 1] * numer * modinv(denom, m) % m\r\n\r\nz = z_function(n, s)\r\nmatches = [0] * n\r\n\r\nw = 1\r\nwhile w * k <= n:\r\n if h[w * k - 1] == rep_hash(w, k):\r\n matches[w * k - 1] = 1\r\n if w * k < n:\r\n matches[w * k] += min(w, z[w * k])\r\n w += 1\r\n\r\nans = [0] * n\r\ncurr = 0\r\nfor i in range(n):\r\n curr = max(curr, matches[i])\r\n if curr > 0:\r\n ans[i] = 1\r\n curr -= 1\r\nprint(''.join(map(str, ans)))\r\n" ]	{"inputs": ["7 2\nbcabcab", "21 2\nababaababaababaababaa", "321 2\nabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaaba", "153 2\nabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaa", "2 1\nab", "2 2\nab", "2 3\nab", "5 6\naaaaa", "5 5\naaaaa", "5 4\naaaaa", "1 1\na", "1 2\na", "1 42\na"], "outputs": ["0000011", "000110000111111000011", "000001111001111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111", "000000011111000111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111", "11", "00", "00", "00000", "00001", "00011", "1", "0", "0"]}	UNKNOWN	PYTHON3	CODEFORCES	2
8d8fab3e7d35cb8634eaf569edcf87b7	Rain and Umbrellas	Polycarp lives on a coordinate line at the point $x = 0$. He goes to his friend that lives at the point $x = a$. Polycarp can move only from left to right, he can pass one unit of length each second. Now it's raining, so some segments of his way are in the rain. Formally, it's raining on $n$ non-intersecting segments, the $i$-th segment which is in the rain is represented as $[l_i, r_i]$ ($0 \le l_i < r_i \le a$). There are $m$ umbrellas lying on the line, the $i$-th umbrella is located at point $x_i$ ($0 \le x_i \le a$) and has weight $p_i$. When Polycarp begins his journey, he doesn't have any umbrellas. During his journey from $x = 0$ to $x = a$ Polycarp can pick up and throw away umbrellas. Polycarp picks up and throws down any umbrella instantly. He can carry any number of umbrellas at any moment of time. Because Polycarp doesn't want to get wet, he must carry at least one umbrella while he moves from $x$ to $x + 1$ if a segment $[x, x + 1]$ is in the rain (i.e. if there exists some $i$ such that $l_i \le x$ and $x + 1 \le r_i$). The condition above is the only requirement. For example, it is possible to go without any umbrellas to a point where some rain segment starts, pick up an umbrella at this point and move along with an umbrella. Polycarp can swap umbrellas while he is in the rain. Each unit of length passed increases Polycarp's fatigue by the sum of the weights of umbrellas he carries while moving. Can Polycarp make his way from point $x = 0$ to point $x = a$? If yes, find the minimum total fatigue after reaching $x = a$, if Polycarp picks up and throws away umbrellas optimally. The first line contains three integers $a$, $n$ and $m$ ($1 \le a, m \le 2000, 1 \le n \le \lceil\frac{a}{2}\rceil$) — the point at which Polycarp's friend lives, the number of the segments in the rain and the number of umbrellas. Each of the next $n$ lines contains two integers $l_i$ and $r_i$ ($0 \le l_i < r_i \le a$) — the borders of the $i$-th segment under rain. It is guaranteed that there is no pair of intersecting segments. In other words, for each pair of segments $i$ and $j$ either $r_i < l_j$ or $r_j < l_i$. Each of the next $m$ lines contains two integers $x_i$ and $p_i$ ($0 \le x_i \le a$, $1 \le p_i \le 10^5$) — the location and the weight of the $i$-th umbrella. Print "-1" (without quotes) if Polycarp can't make his way from point $x = 0$ to point $x = a$. Otherwise print one integer — the minimum total fatigue after reaching $x = a$, if Polycarp picks up and throws away umbrellas optimally. Sample Input 10 2 4 3 7 8 10 0 10 3 4 8 1 1 2 10 1 1 0 9 0 5 10 1 1 0 9 1 5 Sample Output 14 45 -1	[ "import sys,bisect\r\nfrom functools import cache\r\nread=lambda:map(int,sys.stdin.readline().split())\r\ndst,n,m=read()\r\nrain=sorted([[read()] for _ in range(n)])\r\numb=sorted([[read()] for _ in range(m)])+[[dst,dst]]\r\nif umb[0][0]>rain[0][0]:quit(print(-1))\r\n@cache\r\ndef dfs(i):\r\n if i==0:return 0\r\n cur=umb[i][0]\r\n ridx=bisect.bisect(rain,[cur])\r\n if ridx==0:return dfs(i-1)\r\n drop=min(cur,rain[ridx-1][1])\r\n res=0xFFFF0204\r\n for j in range(i):\r\n if drop>umb[j][0]:\r\n res=min(res,dfs(j)+umb[j][1](drop-umb[j][0]))\r\n return res\r\nprint(dfs(m))", "from collections import \nfrom heapq import \nfrom bisect import \nfrom itertools import \nfrom functools import \nfrom math import \nfrom string import \nimport sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n target, n, m = map(int, input().split())\n\n rain = [False] * (target + 1)\n for _ in range(n):\n start, end = map(int, input().split())\n for i in range(start, end):\n rain[i] = True\n\n x = [0] * m\n w = [0] * m\n locs = [[inf, inf] for _ in range(target + 1)]\n\n for i in range(m):\n pos, weight = map(int, input().split())\n x[i] = pos\n w[i] = weight\n locs[x[i]] = min(locs[x[i]], [w[i], i])\n\n dp = [[inf] * (m + 1) for _ in range(target + 1)]\n dp[0][m] = 0\n\n for i in range(target):\n for j in range(m + 1):\n if dp[i][j] == inf:\n continue\n\n if not rain[i]:\n dp[i+1][m] = min(dp[i+1][m], dp[i][j])\n\n if j < m:\n dp[i+1][j] = min(dp[i+1][j], w[j] + dp[i][j])\n\n if locs[i][0] != inf:\n dp[i+1][locs[i][1]] = min(dp[i+1][locs[i][1]], dp[i][j] + locs[i][0])\n\n ans = min(dp[target])\n print(ans if ans < inf else -1)\n\n\nif __name__ == \"__main__\":\n main()\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nINF = 10 ** 15\r\na, n, m = map(int, input().split())\r\nrain = [0] * a\r\numb = [-1] * (a+1)\r\n\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n for i in range(l, r):\r\n rain[i] = 1\r\n\r\nfor _ in range(m):\r\n x, p = map(int, input().split())\r\n if umb[x] == -1 or umb[x] > p:\r\n umb[x] = p\r\n\r\ndp = [INF] * (a+1)\r\ndp[0] = 0\r\n\r\nfor i in range(a):\r\n if not rain[i]:\r\n dp[i+1] = min(dp[i+1], dp[i])\r\n if umb[i] == -1:\r\n continue\r\n if dp[i] == INF:\r\n continue\r\n\r\n cur = 0\r\n for j in range(i+1, a+1):\r\n cur += umb[i]\r\n dp[j] = min(dp[j], dp[i] + cur)\r\n\r\nans = dp[a]\r\nfor i in range(a-1, -1, -1):\r\n if rain[i]:\r\n break\r\n ans = min(ans, dp[i])\r\n\r\nprint(ans if ans != INF else -1)\r\n\r\n\r\n\r\n", "from collections import \nfrom heapq import \nfrom bisect import \nfrom itertools import \nfrom functools import \nfrom math import \nfrom string import \nimport sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n target, n, m = map(int, input().split())\n\n l = [0] n\n r = [0] * n\n for i in range(n):\n l[i], r[i] = map(int, input().split())\n\n x = [0] * m\n p = [0] * m\n for i in range(m):\n x[i], p[i] = map(int, input().split())\n\n rain = [False] * target\n for i in range(n):\n for j in range(l[i], r[i]):\n rain[j] = True\n\n dp = [[inf] * (m + 1) for _ in range(target + 1)]\n\n dp[0][m] = 0\n for j in range(m):\n if x[j] == 0:\n dp[0][j] = 0\n\n for i in range(target):\n if not rain[i]:\n dp[i + 1][m] = dp[i][m]\n\n for j in range(m):\n dp[i + 1][j] = dp[i][j] + p[j]\n dp[i + 1][m] = min(dp[i + 1][m], dp[i][j] + p[j])\n\n for j in range(m):\n if x[j] == i + 1:\n dp[i + 1][j] = min(dp[i + 1][j], dp[i + 1][m])\n\n ans = min(dp[target])\n print(ans if ans < inf else -1)\n\n\nif __name__ == \"__main__\":\n main()\n", "# https://codeforces.com/contest/988\r\n\r\nimport sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\na, n, m = map(int, input().split())\r\nrain = sorted(tuple(map(int, input().split())) for _ in range(n))\r\numbr = sorted(tuple(map(int, input().split())) for _ in range(m))\r\n\r\nif rain[0][0] < umbr[0][0]:\r\n print(-1)\r\n exit()\r\n\r\n# for each umbrella, find the rightmost rain segment [l, r] with l < umbrella position\r\nleft_rain = [-1] * m\r\nj = 0\r\nfor i in range(m):\r\n while j + 1 < n and rain[j + 1][0] < umbr[i][0]:\r\n j += 1\r\n if rain[j][0] < umbr[i][0]:\r\n left_rain[i] = j\r\n\r\ndp = [0] * m\r\nfor i in range(m - 1, -1, -1):\r\n dp[i] = (max(umbr[i][0], rain[-1][1]) - umbr[i][0]) * umbr[i][1]\r\n for j in range(i + 1, m):\r\n if left_rain[j] != -1 and rain[left_rain[j]][1] > umbr[i][0]:\r\n fatigue_i_j = (min(umbr[j][0], rain[left_rain[j]][1]) - umbr[i][0]) * umbr[i][1]\r\n else:\r\n fatigue_i_j = 0\r\n\r\n dp[i] = min(dp[i], fatigue_i_j + dp[j])\r\n\r\nans = dp[0]\r\nprint(ans)" ]	{"inputs": ["10 2 4\n3 7\n8 10\n0 10\n3 4\n8 1\n1 2", "10 1 1\n0 9\n0 5", "10 1 1\n0 9\n1 5", "1 1 1\n0 1\n1 100000", "1 1 1\n0 1\n0 100000", "2000 1 1\n0 1\n2000 33303", "2000 1 1\n1999 2000\n0 18898", "100 50 1\n1 2\n3 4\n5 6\n7 8\n9 10\n11 12\n13 14\n15 16\n17 18\n19 20\n21 22\n23 24\n25 26\n27 28\n29 30\n31 32\n33 34\n35 36\n37 38\n39 40\n41 42\n43 44\n45 46\n47 48\n49 50\n51 52\n53 54\n55 56\n57 58\n59 60\n61 62\n63 64\n65 66\n67 68\n69 70\n71 72\n73 74\n75 76\n77 78\n79 80\n81 82\n83 84\n85 86\n87 88\n89 90\n91 92\n93 94\n95 96\n97 98\n99 100\n0 91855", "2000 10 10\n46 161\n197 348\n412 538\n694 1183\n1210 1321\n1360 1440\n1615 1705\n1707 1819\n1832 1846\n1868 1917\n428 95081\n975 8616\n1159 27215\n532 32890\n1165 53788\n1969 11184\n1443 32142\n553 7583\n1743 33810\n315 62896", "2000 10 1\n63 103\n165 171\n412 438\n696 702\n764 782\n946 1040\n1106 1132\n1513 1532\n1589 1696\n1785 1919\n63 51662", "2000 1 1\n0 2000\n0 100000", "10 3 3\n0 3\n4 8\n9 10\n0 89516\n9 30457\n2 31337"], "outputs": ["14", "45", "-1", "-1", "100000", "-1", "37796000", "9185500", "-1", "95884672", "200000000", "397511"]}	UNKNOWN	PYTHON3	CODEFORCES	5
8d9078b0a36ff7bd5d993ae41b3780b0	Rounding	Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded. For example, if n<==<=4722 answer is 4720. If n<==<=5 Vasya can round it to 0 or to 10. Both ways are correct. For given n find out to which integer will Vasya round it. The first line contains single integer n (0<=≤<=n<=≤<=109) — number that Vasya has. Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer. Sample Input 5 113 1000000000 5432359 Sample Output 0 110 1000000000 5432360	[ "n=int(input())\r\nz=int(str(n)[-1])\r\nif z>=5:\r\n\tprint(n+10-z)\r\nelse:\r\n\tprint(n-z)\r\n", "n=int(input())\r\nk=n%10\r\nif k>0 and k<6:\r\n print(n-k)\r\nif k==0:\r\n print(n)\r\nif k>5 and k<10:\r\n print (n+10-k)", "n = int(input())\r\nif n % 10 >= 6:\r\n n += 9\r\nprint(n // 10 * 10)\r\n", "n=int(input())\r\na=n%10\r\nif a>5:\r\n b=10-a\r\n x=n+b\r\n print(x)\r\nelse:\r\n x=n-a\r\n print(x)", "n=input()\r\nnum=int(n)\r\nx=list(map(int,n.strip()))\r\ny=list(n.strip())\r\n\r\n\r\nif len(x)==1 and x!=\"5\":\r\n if x[0]>5:\r\n print(10)\r\n else:\r\n print(0)\r\nelse:\r\n if int(x[-1])<5:\r\n y[-1]=\"0\"\r\n print(''.join(y))\r\n\r\n else:\r\n\r\n while(n[-1]!=\"0\"):\r\n num=num+1\r\n n=str(num)\r\n if n[-1]==\"0\":\r\n print(num)", "# https://codeforces.com/problemset/problem/898/A\r\n\r\n\r\nn = int(input())\r\nn_ = n%10\r\nif n_ != 0 :\r\n if n_ >5:\r\n n=n-n_+10\r\n else:\r\n n = n-n_\r\nprint(n)\r\n", "n = int(input())\r\nt = n%10\r\n\r\nif t <= 5:\r\n print(n - t)\r\nelse:\r\n print((n//10 + 1)10) \r\n\r\n", "n = int(input())\r\n\r\nif n % 10 <= 5:\r\n rounded = n - (n % 10)\r\nelse:\r\n rounded = n + (10 - n % 10)\r\n\r\nprint(rounded)\r\n", "n=int(input())\r\nx=n\r\ny=n\r\nwhile n%10!=0:\r\n n=n+1\r\nwhile x%10!=0:\r\n x=x-1\r\nif (y-x)>(n-y):\r\n print(n)\r\nelse:\r\n print(x)\r\n\r\n", "n=int(input())\r\nb=str(n)\r\na=int(b[-1])\r\nif a>5:\r\n b=10-a\r\n print(n+b)\r\nelif a<5:\r\n print(n-a)\r\nelif a==5:\r\n print(n-5)", "n = int(input())\r\nr = n%10\r\nif r <= 5:\r\n print(n - r)\r\nelse:\r\n print(n + (10-r))", "n = int(input())\r\nk=n%10\r\nh=0\r\nif k<=5:\r\n\th= n-k\r\nelse:\r\n\th = n+10-k\r\nprint(h)", "n = int(input())\r\nm = n % 10\r\n\r\nif m > 5:\r\n n = n - m + 10\r\nelse:\r\n n = n - m\r\nprint(n)\r\n", "n=int(input())\r\nif(n%10==0):\r\n print(n)\r\nelse:\r\n r=round(n/10)10\r\n print(r)\r\n ", "n = int(input())\r\na = n%10\r\nif a<=5:\r\n print(n-a)\r\nelse:\r\n print((n+10)-a)", "n=int(input())\r\nr=n%10\r\n#print(r)\r\nif r==0:\r\n print(n)\r\nelif r>5:\r\n print(n+(10-r))\r\nelse:\r\n print(n-r)\r\n \r\n\r\n", "n = int(input())\r\n\r\nlast = n%10\r\n\r\nif last == 0 :\r\n print(n)\r\nelif last <= 5 and last>=1:\r\n print(n-last)\r\nelse:\r\n print(n-last + 10) ", "n = int(input())\r\n\r\ndef round(n):\r\n last_num = int(str(n)[-1])\r\n if last_num >= 5:\r\n n = n + (10 - last_num)\r\n else:\r\n n = n - last_num\r\n return n\r\nprint(round(n))", "n = int(input())\nm = n % 10\nif m <= 5:\n num = n - m\nelse:\n num = (n // 10 + 1) * 10\nprint(num)\n\n\t\t\t \t\t \t \t \t \t \t\t\t \t \t", "a = int(input())\r\nprint(round(a/10) * 10)\n# Wed Jan 04 2023 11:07:12 GMT+0300 (Moscow Standard Time)\n", "num = int(input())\r\n\r\n\r\nlast_dig = num % 10\r\n\r\nif last_dig in range(0,5):\r\n print (num - last_dig)\r\nelse:\r\n print (num + (10-last_dig))", "n =int(input())\r\na = n%10\r\nif(a>5):\r\n n+=10\r\n a = n%10\r\n print(n-a)\r\nelse:\r\n print(n-a)", "n = int(input())\r\ntemp = n % 10\r\nif temp == 0:\r\n print(n)\r\nelif temp < 5 and temp != 0:\r\n print(n - temp)\r\nelif temp > 4:\r\n print(n - temp + 10)", "if __name__ == '__main__' :\r\n n = int(input())\r\n if n%10 <= 5 :\r\n print(n-(n%10))\r\n else :\r\n print(10((n//10)+1))", "a = int(input())\nmod = a%10\nif mod<5:\n print(a-mod)\nelse:\n print(a+(10-mod))\n\t \t\t \t \t\t\t\t\t\t\t\t\t\t \t\t\t \t", "a = int(input())\r\nif a % 10 > 5:\r\n print(a + 10 - a % 10)\r\nelse:\r\n print(a - a % 10)", "n=int(input())\r\n\r\nif n%10>5:\r\n n=n-n%10+10\r\nelse:\r\n n=n-n%10\r\nprint(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\nn = int(input())\r\nx = (n//10)10\r\ny = x+10\r\n\r\nif abs(n-x) < abs(n-y):\r\n print(x)\r\nelse:\r\n print(y)", "print(int(round(int(input())/10,0))10)", "n = int(input())\r\ns = str(n)\r\nif int(s[-1]) == 0:\r\n print(n)\r\n exit()\r\nif int(s[-1])<= 5:\r\n n -= int(s[-1])\r\nelse:\r\n n += abs(10 - int(s[-1]))\r\nprint(n)", "n = int(input())\r\na = n // 10\r\nif n % 10 >= 5:\r\n a += 1\r\nprint(a 10)\r\n", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\n\r\nn=int(input())\r\nz=n\r\nst1=0\r\nst2=0\r\nwhile n%10!=0:\r\n st1+=1\r\n n+=1\r\nwhile z%10!=0:\r\n st2+=1\r\n z-=1\r\nif st1<=st2:\r\n print(n)\r\nelse:\r\n print(z)", "i=int(input())\r\nn=list(str(i))\r\na=int(n[-1])\r\nif(a<=5):\r\n\tn[-1]=\"0\"\r\n\tprint(\"\".join(n))\r\nelse:\r\n\tprint(i+10-a)\r\n", "z=input\r\n\r\nn=int(z())\r\nif n%10==0:\r\n print(n)\r\n exit()\r\nt=str(n)\r\nif int(t[-1])>=5:\r\n j=10-int(t[-1])\r\n print(n+j)\r\nif int(t[-1])<5:\r\n \r\n print(t[:-1]+'0')\r\n", "s = int(input())\r\nif s%10<=5:\r\n print(s-s%10)\r\nelse:\r\n print(s+10-s%10)\r\n\r\n ", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#------------notcontest------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\ndown=10;up=10\r\nfor i in range(6):\r\n f=n-i\r\n if f%10==0:\r\n down=i\r\n break\r\nfor i in range(6):\r\n f=n+i\r\n if f%10==0:\r\n up=i\r\n break\r\nif down<=up:print(n-down)\r\nelse:\r\n print(n+up)", "n=int(input())\ndown = int(n/10) * 10\nif n%10 >5:\n print(down+10)\nelse:\n print(down)\n\n \n\n\n", "n = int(input())\r\nif(n%10==0):\r\n print(n)\r\nelse:\r\n r=n%10\r\n if(r<=5):\r\n n1=int((n/10))\r\n n1=n110\r\n else:\r\n n1 = int(n/10)\r\n n1=n110+10\r\n \r\n print(n1)\r\n ", "num = int(input())\r\nif num % 10 >= 5:\r\n print(num + (10 - (num % 10)))\r\nelse:\r\n print(num - (num % 10))", "n=int(input())\r\nb=n%10\r\nif b==1 or b==2 or b==3 or b==4 or b==5:\r\n n-=b\r\n print(n)\r\nelif b==6 or b==7 or b==8 or b==9 :\r\n m=10-b\r\n print(n+m)\r\nelse:\r\n print(n)\r\n", "def solve(t_id):\r\n n = int(input())\r\n if n % 10 < 5:\r\n n -= (n % 10)\r\n else:\r\n n += (10 - n % 10)\r\n print(n)\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", "n = int(input())\nd = n % 10\nif d <= 5:\n r = n - d\nelif d > 5:\n r = (n - d) + 10\nelif d == 0:\n r = n\nprint(r)\n\t \t \t\t \t \t\t\t\t \t\t\t\t\t \t\t", "n=int(input())\r\nx=n%10\r\nif(x==0):\r\n print(n)\r\nelif(x==5):\r\n print(n+5)\r\nelif(x<5):\r\n print(n-x)\r\nelse:\r\n print(n+(10-x))", "import string\r\nn = int(input())\r\ns = str(n)\r\nif int(s[len(s)-1]) <= 5:\r\n n = n - int(s[len(s)-1])\r\nelse: n = n + 10 - int(s[len(s)-1])\r\nprint(n)", "x = int(input())\r\na = x - 1\r\nb = x - 2\r\nc = x - 3\r\nd = x - 4\r\ne = x - 5\r\nf = x + 4\r\ng = x + 3\r\nh = x + 2\r\ni = x + 1\r\n\r\nif x % 10 == 0:\r\n print(x)\r\nelif a % 10 == 0:\r\n print(a)\r\nelif b % 10 == 0:\r\n print(b)\r\nelif c % 10 == 0:\r\n print(c)\r\nelif d % 10 == 0:\r\n print(d)\r\nelif e % 10 == 0:\r\n print(e)\r\nelif f % 10 == 0:\r\n print(f)\r\nelif g % 10 == 0:\r\n print(g)\r\nelif h % 10 == 0:\r\n print(h)\r\nelif i % 10 == 0:\r\n print(i)", "n = int(input())\r\nlo = n//10 * 10\r\nhi = n//10 * 10 + 10\r\n\r\nif abs(n-lo) <= abs(n-hi):\r\n\tprint(lo)\r\nelse:\r\n\tprint(hi)", "s=input()\r\nif int(s[-1])==0:\r\n print(s)\r\nelif int(s[-1])>0 and int(s[-1])<=5:\r\n print(int(s)-int(s[-1]))\r\nelse:\r\n print(int(s)-int(s[-1])+10)", "import math;\r\n\r\ndef roundup(x):\r\n return int(round(x / 10.0)) * 10;\r\n\r\na = int(input());\r\n\r\nx = roundup(a);\r\nprint(x);", "n = int(input())\nif n % 10 == 0: print(n)\nelif n % 10 <= 5: print(n - n % 10)\nelse: print(n + 10 - n % 10)\n", "n=int(input())\r\nif n%10==0:\r\n\tprint(n)\r\nelse:\r\n\tt=n%10\r\n\tif t<5:\r\n\t\tprint(n-t)\r\n\telse :\r\n\t\tprint(n-t+10)", "n = input()\nif int(n[-1]) < 10 - int(n[-1]):\n print(int(n) - int(n[-1]))\nelif int(n[-1]) > 10 - int(n[-1]):\n print(int(n) + (10 - int(n[-1])))\nelse:\n print(int(n) - int(n[-1]))", "n=int(input())\r\nz=int(str(n)[-1])\r\nif z>=5:print(n+10-z)\r\nelse:print(n-z)", "n=int(input())\r\nif (n%10)<=5:\r\n print(n-n%10)\r\nelse:\r\n print((n+10)-(n+10)%10)", "n = int(input())\r\nrm = n % 10\r\nif rm <= 5:\r\n n -= rm\r\nelse:\r\n n += 10-rm\r\nprint(n)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import \r\n\r\nn = int(input())\r\n\r\nif n%10<=4:\r\n print(n//1010)\r\nelse:\r\n print((n+9)//1010)", "t=int(input())\r\nx=t%10\r\nif x>5:\r\n print(t+10-x)\r\nelse:\r\n print(t-x)", "a = int(input())\r\nprint(round(a, -1))\r\n", "n=int(input())\r\n\r\nprint((n+5)//1010)", "n=int(input())\r\nif n%10<5:\r\n print (n//1010)\r\nelif n%10==5:\r\n print (n//1010 or n//1010+10)\r\nelse:\r\n print (n//1010+10)", "num = input()\n\nlast = num[-1]\n\n\nif last in \"012345\" :\n print(num[:-1] + \"0\")\nelse :\n print(((int(num) // 10) * 10) + 10)\n", "n=int(input())\r\na=n//10\r\nif n%10>5:\r\n a=a+1\r\nelse:\r\n a=a\r\nprint(a10)\r\n", "n=int(input())\r\nr=n%10\r\nif(r==0):\r\n print(n)\r\nelif(0<r and r<=5):\r\n print(n-r)\r\nelse:\r\n print(n+10-r) ", "a = str(int(input()))\r\nk = 0\r\nh = 0\r\nf = int(a[-1])\r\nj = 10 - f\r\nif f < 5:\r\n print(int(a) - f)\r\nelse:\r\n print(int(a)+j)", "a=int(input())\r\nif a%10==0:\r\n\tprint(a)\r\nelif (a%10)<=5:\r\n\tprint(a-(a%10),end='')\r\nelif (a%10)>5:\r\n\tprint(a+10-(a%10))", "import math\r\nn = int(input())\r\nn = n/10\r\nprint(round(n)10)\r\n", "x = int(input())\nm = x % 10\nprint(x + [-m, 10 - m][m > 5])\n", "n=input()\r\nprint(int(n)-int(n[len(n)-1]) if int(n[len(n)-1])<=5 else int(n)+(10-(int(n[len(n)-1]))))\r\n\r\n", "n=int(input())\r\nfor i in range(6):\r\n a=n+i\r\n b=n-i\r\n \r\n if a%10==0:\r\n print(a)\r\n break\r\n \r\n if b%10==0:\r\n print(b)\r\n \r\n \r\n \r\n \r\n", "t=int(input())\r\n\r\nif t%10>5:\r\n t=t-t%10+10\r\nelse:\r\n t=t-t%10\r\nprint(t)", "n=int(input())\r\nn/=10\r\nn=round(n)\r\nprint(n10)", "# LUOGU_RID: 112485116\na=int(input())\nprint((a+5)//1010)", "n = int(input())\r\nc = n\r\nh = n\r\nwhile str(c)[-1] != \"0\":\r\n c+=1\r\nwhile str(h)[-1] != \"0\":\r\n h-=1\r\nif c - n < n - h:\r\n print(c)\r\nelse:\r\n print(h)\r\n \r\n\r\n\r\n#1 4\r\n#4\r\n#5 4 3 2\r\n#2 1 3 2\r\n\r\n#3\r\n\r\n ", "n=int(input())\r\nb=n%10\r\n\r\nif b>=5:\r\n n=n+(10-b)\r\nelse:\r\n n=n-(b)\r\n\r\nprint(n)", "n = eval(input())\r\nr = 0\r\nif((n%10)>5):\r\n r = ((n//10)+1)10\r\nelse:\r\n r = (n//10)10\r\nprint(r)", "print(10round(int(input())/10))\r\n", "s=input()\r\nif s[-1]==\"0\":\r\n print(int(s))\r\nelif int(s[-1])>0 and int(s[-1])<5:\r\n x=int(s)\r\n y=x%5\r\n z=x-y\r\n print(z)\r\nelif int(s[-1])>5 and int(s[-1])<=9:\r\n x=int(s)\r\n y=x%5\r\n z=x+(5-y)\r\n print(z)\r\nelif int(s[-1])==5:\r\n x=int(s)\r\n z=x+5\r\n print(z)", "# Rounding\nn = int(input())\nif n%10 <= 5:\n print(n//1010)\nelse:\n print(n//1010+10)\n", "n=int(input())\r\nn=n/10\r\nprint(round(n)10)", "m = int(input())\nn = m%10\nif m>9:\n i = m%10%10\n j =m-i10-n\n if n>4:\n i = i+1\n n = 0\n a = j+i10+n\n print(a)\n else:\n n = 0\n a = j+i10+n\n print(a)\nelse:\n if n>4:\n a = 10\n print(a)\n else:\n a = 0\n print(a)\n\n\t\t \t\t \t\t \t \t\t \t\t \t \t", "n=int(input())\r\nif n%10>=5:\r\n\tn=n//10+1\r\n\tn=10\r\nelse:\r\n\tn//=10\r\n\tn=10\r\nprint(n)", "n=int(input())\r\nl=n%10\r\nif l<5:\r\n o=(n-l)\r\nif l==5:\r\n o=(n-5)\r\nif l>5:\r\n o=(10-l)+n\r\nprint(o)\r\n", "n = int(input())\r\nprint(n + 10 - n % 10 if n % 10 > 5 else n - n % 10)\r\n", "n = int(input())\r\nprint(round(n/10)10)", "n=int(input())\r\np=str(n)\r\nl=p[len(p)-1]\r\nl=int(l)\r\nif l==0:\r\n print(n)\r\nelse:\r\n if l<=5:\r\n n=n-l\r\n print(n)\r\n else:\r\n l=10-l\r\n n=n+l\r\n print(n)", "a=int(input())\r\na=(a+5)//10\r\nprint(a10)\r\n", "n = int(input())\r\nprint(n + 10 - (n % 10) if n % 10 > 5 else n - n % 10)\r\n\r\n# HaPpY NoWrUz 1398\r\n# UBCF\r\n# CodeForcesian\r\n# fadat\r\n", "n=int(input())\r\nif n%10<=5:\r\n n=(n//10)10\r\n\r\nelse:\r\n if n%10==6:\r\n n=n+4\r\n elif n%10==7:\r\n n=n+3\r\n elif n%10 ==8:\r\n n+=2\r\n elif n%10==9:\r\n n+=1\r\nprint(n)", "\r\nn=int(input())\r\nif n%10<=5:\r\n n=n-n%10\r\nelse:\r\n n=n+(10-n%10)\r\nprint(n)\r\n", "n=int(input())\r\na=n%10\r\nif a<=5:\r\n print(n-a)\r\nelse:\r\n print(n+(10-a))", "n=int(input())\r\nprint(round(n/10)10)", "n=int(input())\r\nn1=n\r\nnumber=str(n)\r\na=len(number)\r\ncounter=0\r\ncount=0\r\nif number[a-1]=='0':\r\n print(n)\r\nelse:\r\n while True:\r\n n=n+1\r\n counter=counter+1\r\n b=str(n)\r\n c=len(b)\r\n if b[c-1]=='0':\r\n d=n\r\n break\r\n else:\r\n continue\r\n count=count+int(number[a-1])\r\n difference=n1-int(number[a-1])\r\n if count>counter:\r\n print(d)\r\n else:\r\n print(difference)", "n= int(input())\r\neq= n%10\r\nif eq >5:\r\n print(n+10-eq)\r\nelse:\r\n print(n-eq)", "print(round(int(input())/10)10)", "s = input()\r\nif 0 <= int(s[-1]) <= 5:\r\n print(s[:-1] + \"0\")\r\nelse:\r\n s = s[:-1]\r\n if len(s) == 0:\r\n print(\"10\")\r\n else:\r\n print(int(s) + 1, 0, sep=\"\")\r\n", "n=int(input())\r\nif(n<=5):\r\n print(\"0\")\r\n exit()\r\nelif(n>5 and n<=10):\r\n print(\"10\")\r\n exit()\r\nelif(n%10==0):\r\n print(n)\r\n exit()\r\nelse:\r\n a=n//10\r\n b=a10\r\n c=a+1\r\n if(((c10)-n)<(n-(b))):\r\n print(c10)\r\n else:\r\n print(b)", "a = int(input())\r\nplus,minus = a,a\r\nwhile str(plus)[-1]!= \"0\":\r\n plus+=1\r\nwhile str(minus)[-1]!=\"0\":\r\n minus-=1\r\nif abs(minus-a) > abs(plus-a):\r\n print(plus)\r\nelif abs(minus-a) == abs(plus-a):\r\n print(plus)\r\nelse:\r\n print(minus)", "n=int(input())\r\nif(n%10<5):\r\n print(n-n%10)\r\nelse:\r\n print(n+(10-n%10))", "n = int(input())\na = n//1010\nb = n//1010+10\nif n-a<b-n:print(a)\nelse: print(b)", "n=list(input())\r\nif int(n[-1])<=5:\r\n print(\"\".join(n[0:-1])+'0')\r\nelse:\r\n n=int(\"\".join(n))\r\n while n%10!=0:\r\n n+=1\r\n print(n)", "n = int(input())\r\na = n % 10\r\nif a < 5:\r\n print(n-a)\r\nelse:\r\n print(n-a+10)", "import sys\r\n\r\nrd = sys.stdin.readline\r\n\r\nn = int(rd())\r\n\r\nif n % 10 == 0: print(n)\r\nelif n % 10 < 5: print(n - (n % 10))\r\n\r\nelse: print(n + 10 - (n % 10))\r\n", "n=int(input())\r\nmod=n%10\r\nif mod<=5:\r\n n-=mod\r\nelse:\r\n n+=(10-mod)\r\nprint(n)", "# # RED CODER # #\r\nn = int(input())\r\np = n/10\r\nprint(round(p)10)", "n=int(input())\r\nl=int(n%10)\r\nif l>5:\r\n print(n+10-l)\r\nelse:print(n-l)", "n = int(input())\r\nm = n%10\r\nif m<=5: print(n-m)\r\nelse:print(n+(10-m))", "n = int (input() )\r\nif n%10>4:\r\n up = 10\r\nelse:\r\n up = 0\r\nans = n - (n%10) + up\r\nprint (ans)", "# LUOGU_RID: 111035184\nx = int(input())\nif x % 10 < 5:\n x = x - x % 10\nelif x % 10 >= 5:\n x = x - x % 10 + 10\nprint(x)", "n=int(input())\r\nif 0<n<5:\r\n\tprint(0)\r\nelse:\r\n\tprint(round(n,-1))", "n = int(input())\r\n\r\nr = n % 10\r\n\r\nif r <= 5:\r\n n -= r\r\nelse:\r\n n += 10 - r\r\n\r\nprint(n)\r\n", "n=int(input())\r\nx=int(n%10)\r\np=x-0\r\nq=10-x\r\nif p<q:\r\n print(n-x)\r\nelif p==q:\r\n print(n-x)\r\nelif q<p:\r\n print(n+q)", "n=int(input())\r\nnum_to_rem=n%10\r\nif num_to_rem>=5:\r\n print(n-num_to_rem+10)\r\nelse:\r\n print(n-num_to_rem)\r\n", "number = int(input())\r\n\r\nprint(f'{round(number/10)10}')", "num = input()\r\nunitd = num[-1]\r\nif(int(unitd)<=5):\r\n print(int(num)-int(unitd))\r\nelse:\r\n print(int(num)+(10-int(unitd)))", "n = int(input())\r\n\r\nif n%10 < 5:\r\n print(n-n%10)\r\nelse:\r\n print(n + 10 - n%10)\r\n", "n=int(input())\r\nif int(n%10) in range(1,5):\r\n\tprint(n-int(n%10))\r\nelif int(n%10) in range(5,10):\r\n\tprint(n+10-int(n%10))\r\nelse:\r\n\tprint(n)", "n = int(input())\r\nrem = n%10\r\nn -= rem\r\nif rem > 5:\r\n n += 10\r\nprint(n)", "n=int(input())\r\nlast_dig=n%10\r\nprint(n-last_dig) if last_dig<=5 else print(n+(10-last_dig))", "n = int(input())\nx = n%10\nif x==0:\n\tprint(n)\nelif x>=5:\n\tprint(n+10 -x)\nelse:\n\tprint(n -x)\n", "import math\r\n\r\nn = int(input()) \r\n\r\nif n%10 <= 5:\r\n ans = 10(n//10) \r\nelse:\r\n ans = 10(n//10 + 1) \r\n\r\nprint(ans) ", "n = int(input())\r\n\r\nx = n % 10\r\nif x > 5:\r\n print(n + 10 - x)\r\nelse:\r\n print(n - x)\r\n", "n=int(input())\r\nif (n%10)>5:\r\n\tprint(n+10-(n%10))\r\nelse:\r\n\tprint(n-n%10)", "print(round(int(input()) / 10) 10)\r\n", "a = int(input())\r\nb = a%10\r\nif b > 5:\r\n print(a+10-b)\r\nelif b <= 5:\r\n print(a-b)\r\nelse:\r\n print(a)\r\n \r\n", "s=input()\r\nn=len(s)\r\nif int(s[n-1])>5:\r\n\ts=int((int(s)/10))10 +10\r\n\tprint(s)\t\r\nelif int(s[n-1])<=5:\r\n\ts=list(s)\r\n\ts[n-1]='0'\r\n\tprint(\"\".join(s))\r\nelif int(s[n-1])==0:\r\n\tprint(s)", "n = int(input())\r\nm = n % 10\r\nprint(n - m if m < 5 else n - m + 10)\r\n", "n = int(input())\r\nm = n % 10\r\n\r\nif m == 0 :\r\n n = n\r\nelif m <= 5 :\r\n n = n - m\r\nelse:\r\n n = n + 10 - m\r\nprint(n)", "n=int(input())\r\nrem=n%10\r\nif(rem<=5):\r\n print(n-rem)\r\nelse:\r\n print(n+10-rem)", "n=int(input())\r\nfor i in range(0,10):\r\n n1,n2=n+i,n-i\r\n n1,n2=str(n1),str(n2)\r\n if(n1[-1]=='0'):\r\n print(int(n1))\r\n break\r\n elif(n2[-1]=='0'):\r\n print(int(n2))\r\n break\r\n", "n = int(input())\r\nif n%10 == 0:\r\n print(n)\r\nelse:\r\n if n%10 <= 5:\r\n print(int(n//10)10)\r\n else:\r\n print((int(n//10)+1)10)\r\n", "n = int(input())\r\nif(n%10<5):\r\n print((n//10)10)\r\nelse:\r\n print(((n//10)+1) * 10)", "n=int(input())\r\ns=str(n)\r\nl=list(s)\r\nif int(s[-1]) == 0:\r\n\tprint(n)\r\nelif int(s[-1]) > 0 and int(s[-1]) <= 5:\r\n\tl[-1] = \"0\"\r\n\tprint(l,sep=\"\")\r\nelse:\r\n\tn=n+10%int(s[-1])\r\n\tprint(n)", "n=(int(input()))\r\nprint(((int(n/10)+(int(n%10>=5)))10))", "n = int(input())\r\nx = n//10\r\ny = n%10\r\n\r\nif y==0:\r\n print(x10)\r\nelif y<=4:\r\n print(x10) \r\nelse:\r\n print(x10+10)", "x = int(input())\n\nmod = x%10\n\nif mod <=5:\n print(x-mod)\nelse:\n print(x+10-mod)\n\n \t\t \t\t \t \t\t\t\t\t\t \t\t \t\t", "n=int(input())\r\nlasdig=n%10\r\nif lasdig<=5:\r\n print(n-lasdig)\r\nelse:\r\n print(n+(10-lasdig))", "n=int(input())\r\nx = n//1010\r\ny= n//1010+10\r\nif abs(n-x) <= abs(n-y):\r\n print(x)\r\nelse:\r\n print(y)", "n=int(input())\r\ns=str(n)\r\nif n%10!=0:\r\n if int(s[-1])<=5:\r\n print(n-(int(s[-1])))\r\n else:\r\n p=10-(int(s[-1]))\r\n print(n+p)\r\nelse:\r\n print(n)", "import math\r\n\r\nn = int(input())\r\nn /= 10\r\nprint(10round(n))", "n= int(input())\r\n\r\na=n//10\r\nif n%10<5:\r\n print(a10)\r\nelse:\r\n print((a10)+10)", "n1 = int(input())\r\ntemp1 = n1\r\ntemp2 = n1\r\nb1 = False\r\ncount1 = 0\r\nwhile b1==False:\r\n if str(temp1)[-1] == \"0\":\r\n break\r\n temp1+=1\r\n count1+=1\r\ncount2 = 0\r\nwhile b1==False:\r\n if str(temp2)[-1] == \"0\":\r\n break\r\n temp2-=1\r\n count2+=1\r\n\r\nif count1 >= count2:\r\n print(temp2)\r\nelse:\r\n print(temp1)\r\n \r\n\r\n ", "n = int(input().strip())\r\nif n%10 <= 5:\r\n ans = n - n%10\r\nelse :\r\n ans = (n//10 + 1)10\r\nprint(ans)", "n=int(input())\r\nif n%10>=5:\r\n print(10((n//10)+1))\r\nelse:\r\n print(10((n//10)))", "n = int(input())\r\nr = n%10\r\nremaining = 10-r\r\n\r\nif (r<remaining):\r\n print(n-r)\r\nelse:\r\n print(n+remaining)\r\n", "n=int(input())\r\nx=str(n)\r\nround = (n//10+(n%10>=5))10\r\nprint(round)", "n = int(input())\r\nif n%10==0:\r\n print(n)\r\nelif n%10!=0 and n%10<=5:\r\n print(n-n%10)\r\nelif n%10!=0 and n%10>5:\r\n print(n+(10-n%10))", "s=input();c=int(s[len(s)-1])\r\ny=int(s);\r\nif(y>=10):\r\n y//=10\r\n x=int(c)\r\n if(x<=5):\r\n print(str(y)+\"0\")\r\n else:\r\n y+=1\r\n print(str(y)+\"0\")\r\nelse:\r\n if(y<=5):\r\n print(0)\r\n else:\r\n print(10)", "n = int(input())\r\nif n % 10 > 5 : \r\n n= (n // 10)10 + 10 \r\n print(n)\r\nelse : \r\n n = n - (n % 10) \r\n print(n)", "n = int(input())\r\nr = n % 10\r\nif r<5:\r\n # n==114 r==4\r\n print(n-r)\r\nelse:\r\n # n==117 r==7\r\n print(n+10-r)", "n = int(input())\n\nm = n % 10\n\nif m < 5:\n n -= m\nelse:\n n += 10-m\n\nprint(n)\n", "x = int(input())\r\nif x%10 < 5:\r\n print(x-x%10)\r\nelse:\r\n print(x-x%10+10)\r\n", "n = int(input())\r\na = str(n)\r\nb = int(a[-1])\r\nif b >= 5:\r\n n = n - b + 10\r\nelif b < 5:\r\n n = n - b\r\nprint(n)", "print(int(round(int(input()) / 10) 10))", "n = int(input())\r\nx = n % 10\r\ny = 10 - (n % 10)\r\nif (x >= y): print(n + y)\r\nelse: print(n - x)", "n = int(input())\r\nif n%10==0:\r\n print(n)\r\nelif n%10==5:\r\n print(n-5)\r\nelse:\r\n if n%10>5:\r\n print(n+(10-(n%10)))\r\n else:\r\n print(n-(n%10))", "a = int(input())\r\nl = a\r\na = a // 10\r\ne = l % 10\r\na = a * 10\r\nif e >= 5:\r\n print(a+10)\r\nelse:\r\n print(a)", "n=int(input())\r\nif n%10 ==0:\r\n print(n)\r\nelif n%10<=5:\r\n print(n-(n%10))\r\nelse:\r\n print(n+(10-(n%10)))\r\n", "print(10((int(input())+5)//10))\n", "n = input()\r\nif int(n[len(n)-1])>5:\r\n\ta = int(n)%10\t\t\r\n\tprint(int(n)+(10-a))\r\nelse:\r\n\tprint(n[0:len(n)-1]+\"0\")\t", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n if n % 10 >= 5:\r\n n = n - n % 10 + 10\r\n else:\r\n n = n - n % 10\r\n print(n)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nt = int(str(n)[-1])\r\n\r\nif t == 0:\r\n print(n)\r\nelif t > 0 and t <= 5:\r\n n -= t\r\n print(n)\r\nelse:\r\n n += (10-t)\r\n print(n)\r\n ", "n = int(input())\r\na = n%10\r\nif a<=5:\r\n\tprint(n-a)\r\nelse:\r\n\tprint(n+10-a)\r\n", "def rounding(n):\r\n m = n % 10\r\n if n % 10 == 0:\r\n return n\r\n elif m <= 5:\r\n return n-m\r\n else:\r\n return n + (10-m) \r\n\r\nn = int(input())\r\nprint(rounding(n))", "n=int(input())\r\nif n%10==0:\r\n\tprint(n)\r\nelse:\r\n\tr=n%10\r\n\tk=n-r\r\n\tl=k+10\r\n\tif n-k<=l-n:\r\n\t\tprint(k)\r\n\telse:\r\n\t\tprint(l)", "\r\nn=int(input())\r\nr=n%10\r\nif r==0:\r\n print(n)\r\nelse:\r\n if r<=5:\r\n print((n//10)10)\r\n else:\r\n print(((n//10)+1)10)\r\n ", "n = int(input())\r\nif n % 10 > 5:\r\n n = n // 10 10 + 10;\r\nelse:n = n // 10 * 10\r\nprint(n)\r\n", "a=input()\nd=a[len(a)-1]\n#print(d)\nk=0 \nif d>\"5\" and d>\"0\":\n k=int(a)\n if d==\"6\":\n k+=4\n if d==\"7\":\n k+=3\n if d==\"8\":\n k+=2\n if d==\"9\":\n k+=1\n#print(k)\n\nelif d<=\"5\" and d>\"0\":\n k=int(a)\n if d==\"1\":\n k-=1\n if d==\"2\":\n k-=2\n if d==\"3\":\n k-=3\n if d==\"4\":\n k-=4\n if d==\"5\":\n k-=5\n\n#print(k)\nelse:\n k=int(a)\nprint(k)\n \n ", "def main():\r\n \r\n # t = int(input())\r\n # for _ in range(t):\r\n a = list(map(int,input().split()))[0] \r\n \r\n rem = a%10\r\n if rem<5:\r\n a-=(rem)\r\n else:\r\n a+=(10-rem)\r\n \r\n print(a)\r\n \r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "print(((int(input())+5)//10)10)", "a=int(input())\r\nb=a%10\r\nc=10-b\r\nif(b<c):\r\n print(a-b)\r\nelse:\r\n print(a+c)", "import math\nprint(math.floor((int(input())+5)/10)10)", "n = int(input())\r\nlast_digit = n % 10\r\nsecond_last_digit = ((n - last_digit) / 10) % 10\r\nn = (((n - last_digit) / 10) - second_last_digit) * 10\r\nif last_digit <= 5:\r\n n = n + second_last_digit10\r\nelse:\r\n n = n + (second_last_digit + 1)10\r\nprint(int(n))\r\n\r\n", "n=int(input())\r\nif n%10<=5:\r\n print(n-n%10)\r\nelse:\r\n print(n-n%10+10)", "n = int(input())\r\nr = n % 10\r\n\r\nif r<5:\r\n#n==114\t\tr==4\r\n\tprint(n-r)\r\nelse:\r\n# n==117\t\tr==7\r\n\tprint(n+10-r)", "t = input()\nn = len(t)\ns = int(t[-1])\nif s <5:\n t =int(t)-s\nelse:\n t= int(t)\n t = t-s+10\nprint(t)\n \t\t \t \t\t \t\t \t \t \t \t\t\t \t", "n=int(input())\r\nw=n%10\r\nif w>5:\r\n\tt=int(n//10)\r\n\tr=(t+1)10\r\n\tprint(r)\r\nif w<=5:\r\n\tt=int(n//10)\r\n\tr=(t)10\r\n\tprint(r)", "n = int(input())\r\nprint((n//1010+10,n//1010)[n % 10 <= 5])", "n = int(input())\r\nanswer = 10 * round(n / 10)\r\nprint(answer)", "print(round(int(input()),-1))", "n = int(input())\nif n % 10 > 5:\n print(n + 10 - n % 10)\nelse:\n print(n - n % 10)\n", "print((lambda x: x-x%10 if x%10<5 else x+10-x%10)(int(input())))", "n=int(input())\r\na=n%10\r\nif 0<=a<6:print(n-a)\r\nelse:print(n+(10-a))", "n = int(input())\r\nnum = n % 10\r\nn = n // 10 \r\nif num <= 5:\r\n n = n * 10 \r\nif num > 5:\r\n n = n + 1\r\n n = n * 10 \r\nprint(n)", "#n=113\r\nn=input()\r\nt=int(n[-1])\r\nif t<10-t:\r\n print(int(n)-(t))\r\nelse:\r\n print(int(n)+10-t)", "n=int(input())\r\nif(n%10<=5):\r\n print(n-n%10)\r\nelif(n%10>5):\r\n print(n+(10-n%10))\r\n", "#problem20\r\nprint((int(input())+5)//1010)", "def main():\n n = int(input())\n remainder = n % 10\n\n if remainder <= 5:\n print(n - remainder)\n else:\n print(n + (10 - remainder))\n\n\nif __name__ == '__main__':\n main()\n", "a=int(input())\r\nif a%10<=4:\r\n a=a-(a%10)\r\nelse:\r\n a=a+(10-a%10)\r\nprint(a)", "from math import ceil\r\na=input()\r\nb=len(a)\r\ng=a[b-1]\r\nif int(g)<=5:\r\n print(int(a)-int(g))\r\nelse:\r\n print(int(a)+10-int(g))\r\n ", "m=int(input())\r\nmn=m%10\r\nif mn<=5:\r\n print(m-mn)\r\nelse:\r\n print(m+10-mn)", "n=int(input())\r\nk=n%10\r\nif k<=5:\r\n print(n-k)\r\nelse:\r\n print(n+(10-k))", "\r\ntry :\r\n n = int(input()) \r\n if(n%10 < 6 ):\r\n print(n - n%10) \r\n else: \r\n print(n + (10 -n%10))\r\n \r\nexcept : \r\n pass", "n = int(input())\na = n%10\nb = int(str(n)[:-1] + str('0'))\n#print(n, b, abs(n-b))\nif a == 0:\n print(n)\nelif abs(n-b) > 5:\n print((10-abs(n-b))+n)\nelse:\n print(b)\n\n", "n=int(input())\r\na=n%10\r\nif a<=5:\r\n print(n-n%10)\r\nelif a>5:\r\n print(n+(10-n%10))\r\n", "print(10 (round(int(input()) / 10)))\r\n", "x = int(input())\r\nif x/10 != 0:\r\n\tif x%10 > 5:\r\n\t\tprint(x + 10 - (x%10))\r\n\telse:\r\n\t\tprint(x - (x%10))\r\nelse:\r\n\tprint(x)", "\r\n\"\"\"\r\n\r\n\"\"\"\r\n\r\nimport sys\r\nfrom sys import stdin\r\n\r\ntt = 1 #int(stdin.readline())\r\n\r\nANS = []\r\n\r\nfor loop in range(tt):\r\n\r\n n = int(stdin.readline())\r\n\r\n if n % 10 <= 5:\r\n n -= n % 10\r\n else:\r\n n = n - n % 10 + 10\r\n \r\n ANS.append(n)\r\n\r\nprint (\"\\n\".join(map(str,ANS)))\r\n", "# Problem Name :Rounding\r\n# problem link : https://codeforces.com/problemset/problem/898/A\r\n# Output Operation\r\nimport sys\r\nimport math\r\nnum=int(sys.stdin.readline())\r\nnum=num/10\r\nprint(round(num)10)", "n = int(input())\r\nmn = n//10 10\r\nmx = mn + 10\r\nif n - mn < mx - n:\r\n print(mn)\r\nelse:\r\n print(mx)\r\n", "round_int = int(input())\r\nif round_int%10 in range(0,6):\r\n print(round_int-round_int%10)\r\nelif round_int%10 in range(6,10):\r\n print(round_int+(10-round_int%10))\r\n \r\n", "n = int(input())\r\nprint (round(n/10)10)", "num = int(input())\r\n\r\nnu, m = divmod(num, 10)\r\nprint(nu 10 + (0 if m <= 5 else 10))\r\n", "x = int(input())\r\nprint(x + 10-(x % 10) if x % 10 >= 5 else x - x % 10)", "n=list(map(int,input()))\nn1=n[len(n)-1]\nn2=int(n1)\nif(n2==0):\n y=''.join(map(str, n))\n z=int(y)\n print(z)\nelif(n2<=5):\n y=''.join(map(str, n))\n z=int(y)\n print(z-n2)\nelse:\n y=''.join(map(str, n))\n z=int(y)\n x=10-n2\n print(z+x) \n \t\t\t \t\t\t \t\t \t \t \t\t\t \t\t", "n = int(input())\r\nif n % 10 == 0:\r\n print(n)\r\n exit(0)\r\nif abs(n // 10 * 10 - n) <= abs((n // 10 + 1) * 10 - n):\r\n print(n // 10 * 10)\r\nelse:\r\n print((n // 10 + 1) * 10)\r\n", "from math import remainder\r\nn = int(input())\r\nprint(int(n-remainder(n,10)))", "from math import ceil\r\n\r\ndef solve():\r\n n = int(input())\r\n \r\n if n % 10 == 0:\r\n print(n)\r\n elif n % 10 < 5:\r\n print(n//1010)\r\n else:\r\n print(int(ceil(n/10))10)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()", "n=int(input())\r\nx=n//10\r\ny=n%10\r\n\r\nif y==0:\r\n print(x10)\r\nelif y<=4:\r\n print(x10)\r\nelse:\r\n print(x10+10)", "n = int(input())\n\nif 0 < n % 10 <= 5:\n print(n - n % 10)\nelif 5 < n % 10 <= 9:\n print(n + (10 - n % 10))\nelse:\n print(n)", "print(round(int(input())/10)10)\n\n#uoil;holiuhbnndfwewgf\n \t \t\t \t\t \t\t\t \t \t\t \t \t \t \t", "n = int(input())\r\nn = (n + 5) // 10 * 10\r\nprint(n)", "def main():\r\n n = int(input())\r\n if n%10>5:\r\n print((n//10+1)10)\r\n else:\r\n print((n // 10) 10)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nprint(round(n/10.0)10)\r\n ", "n =int(input())\r\nif n%10==0:\r\n print(n)\r\nelse:\r\n k = n\r\n while k%10!=0:\r\n k=k+1\r\n p = n\r\n while p%10!=0:\r\n p=p-1\r\n if k-n<n-p:\r\n print(k)\r\n else:\r\n print(p)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-22 23:32:49\nLastEditTime: 2021-11-22 23:34:29\nDescription: Rounding\nFilePath: CF898A.py\n'''\n\n\ndef func():\n n = int(input())\n print((n + 5) // 10 10)\n\n\nif __name__ == '__main__':\n func()\n ", "# import os\r\n\r\nn = int(input())\r\n\r\nr = n % 10\r\nrr = 10-r\r\nif r >=5:\r\n print(n+rr)\r\nelse:\r\n print(n-r)", "n=int(input())\r\nd=n%10\r\nif(d==0):\r\n print(n)\r\nelif(d>0 and d<=5):\r\n print(n-d)\r\nelse:\r\n print(n+(10-d))\r\n", "n=int(input())\r\nk=n%10\r\nif k>5:\r\n a=10-k\r\n print(n+a)\r\nelse:\r\n print(n-k)", "n = int(input())\r\n\r\nx = n % 10\r\n\r\nif n % 10 < 5:\r\n \r\n print (n - x)\r\n\r\nelse: \r\n print (n + ( 10 -x) )\r\n", "n=int(input())\r\nif(n%10==0):\r\n print(n)\r\nelse:\r\n rem=n%10\r\n if(rem==1):\r\n print(n-1)\r\n if(rem==2):\r\n print(n-2)\r\n if(rem==3):\r\n print(n-3)\r\n if(rem==4):\r\n print(n-4)\r\n if(rem==5):\r\n print(n-5)\r\n if(rem==6):\r\n print(n+4)\r\n if(rem==7):\r\n print(n+3)\r\n if(rem==8):\r\n print(n+2)\r\n if(rem==9):\r\n print(n+1)\r\n\r\n\r\n \r\n", "a=int(input())\nb=a%10\nif b<5:\n print(a-b)\nelif b>=5:\n print(a+10-b)\n\n\n\t\t\t\t\t \t \t\t \t \t \t\t", "n=int(input())\r\nans = n-n%10+10 if n%10>5 else n-n%10\r\nprint(ans)", "def roundTo10(n):\r\n # Smaller multiple\r\n a = (n // 10) * 10\r\n\r\n # Larger multiple\r\n b = a + 10\r\n\r\n # Return of closest of two\r\n return (b if n - a > b - n else a)\r\n\r\nn = int(input())\r\nprint(roundTo10(n))\r\n", "n=input()\r\nif n[-1]=='0' : \r\n print (n)\r\nelif int(n)<=5 : print ('0')\r\nelif (int(n)<10) and (int(n)>5) : print ('10')\r\nelse : \r\n s=''\r\n if int(n[-1])<=5: \r\n s=n[:len(n)-1]+'0'\r\n else : \r\n s='0' ; kt=False \r\n for i in range(len(n)-2,-1,-1) : \r\n if int(n[i])+1==10 : \r\n if i==0 :\r\n s='10'+s\r\n kt=True\r\n break \r\n else :s='0'+s\r\n else : \r\n s=str(int(n[i])+1)+s \r\n break \r\n if kt==False : \r\n s=n[0:len(n)-len(s)]+s \r\n print (s)\r\n", "n=int(input())\r\nif(n%10==0):\r\n print(n)\r\nelse:\r\n k=n%10\r\n if(k>=5):\r\n l=n//10\r\n print((l+1)10)\r\n else:\r\n l=n//10\r\n print(l10)", "n = int(input())\r\nif(n%10>4):print(n+10-n%10)\r\nelse: print(n-n%10)", "n = int(input())\nm = str(n)\nnum1 = m[-1]\nnum2 = int(num1)\nif int(num1) > 5:\n print(n-num2+10)\nelif int(num1) <= 5:\n print(n-num2)\n\n \t \t \t \t\t \t \t \t\t\t\t\t\t\t", "import cmath\r\nn=int(input())\r\na=(n//10)10\r\nb=a+10\r\nif (n-a)>(b-n):\r\n print(b)\r\nelse:\r\n print(a)\r\n", "n = int(input())\nif n % 10 > 5:\n print(n + (10 - (n % 10)))\nelse:\n print(str(n)[:-1]+'0')\n", "a = int(input())\r\n\r\nb = a%10\r\nc = 10 - b\r\nif b<6:\r\n print(a-b)\r\nelse:\r\n print(a+c)", "num = int(input())\n\nunit = num%10\n\nif (unit <= 5):\n print(num - unit)\nelse: print(num + (10-unit))\n\n", "n = int(input())\r\nif n%10 <= 5:\r\n print( (n//10)10 )\r\nelse:\r\n print( (n//10 + 1)10 )", "a=input();print(int(a)-int(a[-1]) if int(a[-1])<5 else int(a)+(10-int(a[-1])))", "def round_int(number: int) -> int:\n value = number // 10 10\n if number % 10 < 5:\n return value\n return value + 10\n\n\ndef main():\n number = int(input())\n print(round_int(number))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\nr = n % 10\n\nif r >= 5:\n print(10-r+n)\nelse:\n print(n-r)\n \n", "x=eval(input())\r\ny=x%10\r\nm=x//10\r\nif(y<=5):\r\n m=m10\r\nelif(y>5):\r\n m=m10+10\r\nprint(m)\r\n\r\n", "n=int(input())\r\nif n%10==0:\r\n\tprint(n)\r\nelif n%10<5:\r\n\tprint(n-n%10)\r\nelse:\r\n\tprint(n+10-n%10)", "\r\ni = int(input())\r\n \r\nif i % 10 == 0: print(i)\r\nelif i%10>5: print(i+(10-i%10))\r\nelse: print(i-(i%10))", "n = int(input())\r\nr = n % 10\r\nprint (n-r) if (r < 5) else print (n + (10 - r))\r\n", "import sys \r\nimport math as mt\r\nimport bisect\r\n#input=sys.stdin.readline\r\n#t=int(input())\r\nt=1 \r\n \r\ndef solve():\r\n n1,n2=0,0\r\n \r\n for i in range(11):\r\n if (n+i)%10==0:\r\n n1=i\r\n break\r\n for i in range(11):\r\n if (n-i)%10==0:\r\n n2=i\r\n break\r\n if n1>n2:\r\n return (n-n2)\r\n else:\r\n return (n+n1)\r\n \r\n \r\n \r\nfor _ in range(t):\r\n n=int(input())\r\n #n,k=map(int,input().split())\r\n #x,y,k=map(int,input().split())\r\n #n,h=(map(int,input().split()))\r\n #l=list(map(int,input().split()))\r\n #l2=list(map(int,input().split()))\r\n \r\n print(solve())\r\n ", "n=int(input())\r\nn=str(round(n/10)10)\r\nprint(n)\r\n", "import sys,math\ninput=sys.stdin.readline\nprint=sys.stdout.write\nL=lambda : list(map(int,input().split().strip()))\nM=lambda : map(int,input().split())\na=int(input())\nif(a%10>=5):\n a+=10-(a%10)\nelse:\n a-=a%10\nprint(str(a))\n", "n=input()\r\na=list(n)\r\nif(a[-1]==\"0\"):\r\n print(n)\r\nelse:\r\n if(int(a[-1])<5):\r\n print(int(n)-int(a[-1]))\r\n else:\r\n print(int(n)+(10-int(a[-1]))) ", "n = int(input())\r\nf = n%10\r\nif f >= 5:\r\n print(n + (10 - f))\r\nelse:\r\n print(n - f)", "n = int(input())\r\na = (n//10)10\r\nb = a + 10\r\nif n-a > b-n:\r\n print(b)\r\nelse:\r\n print(a)", "n = int(input())\r\nprint(n - (n%10) if n%10<=5 else n + 10 -(n%10))", "n = list(input())\r\nif n[-1] == 0:\r\n print(\"\".join(n))\r\nelif int(n[-1]) <= 5:\r\n n[-1] = \"0\"\r\n print(\"\".join(n))\r\nelse:\r\n temp = int(\"\".join(n))\r\n if n[-1] == \"6\":\r\n print(temp + 4)\r\n elif n[-1] == \"7\":\r\n print(temp + 3)\r\n elif n[-1] == \"8\":\r\n print(temp + 2)\r\n elif n[-1] == \"9\":\r\n print(temp + 1)", "n = int(input())\r\nprint(10(round(n/10)))", "num = int(input())\r\nmod = num % 10\r\nprint(num - mod if mod <= 5 else num + 10 - mod)", "n=int(input())\r\nif str(n)[-1]==\"0\": print(n)\r\nelif int(str(n)[-1]) > 5: print(10-int(str(n)[-1])+n)\r\nelif int(str(n)[-1]) <= 5: print(n-int(str(n)[-1]))\r\n\t\r\n", "import sys\r\n\r\ndef main():\r\n k = int(sys.stdin.read().strip())\r\n return k - k%10 + (k%10 > 4)10\r\n\r\nprint(main())\r\n", "a = int(input())\r\nif a%10 <= 5:\r\n if a<10:\r\n print(0)\r\n else:\r\n print(str(a//10)+'0')\r\nelse:\r\n if a<10:\r\n print(10)\r\n else:\r\n print(a+10-a%10)", "#Rounding\r\nn=int(input())\r\nnum=n\r\nr=num%10\r\nif r==0:\r\n print(num)\r\nelif r>0 and r<=5:\r\n n=n-(n%10)\r\n print(n)\r\nelse:\r\n n=n+(10-r)\r\n print(n)\r\n ", "x=int(input())\r\nk=x%10\r\nif k>=5:\r\n x=x+10-k\r\n print (x)\r\nelse:\r\n print (x-x%10)\r\n", "n=int(input())\r\nn=n/10\r\nn=round(n)\r\nn=n10\r\nprint(n)", "n=int(input())\r\nif(n%10==0):\r\n print(n)\r\nelif((n%10)<5):\r\n print(n-(n%10))\r\nelif((n%10)>=5):\r\n print(n+(10-n%10))", "num=int(input())\r\nprint(round(num,-1))", "n=int(input())\r\nx=n%10\r\nif x>=5:\r\n x=10-x\r\n n+=x\r\nelse:\r\n n-=x\r\nprint(n)", "def process(n):\r\n if n % 10==0:\r\n return n\r\n if n % 10 <= 5:\r\n return 10(n//10)\r\n return 10(n//10+1)\r\n\r\nn = int(input())\r\nprint(process(n))\r\n", "n = int(input())\r\nremain = n%10\r\nif remain >= 5:\r\n n = n + (10-remain)\r\n print(n)\r\nelse:\r\n n = n - remain\r\n print(n)\r\n", "n=int(input())\r\nx=n%10\r\nif x==0:\r\n print(n)\r\nelif x>5:\r\n a=10-x\r\n print(n+a)\r\nelse:\r\n print(n-x)", "n = int(input())\r\nprint(round(n, -1))\r\n", "# Bismillahir Rahmanir Rahim\r\n# Abu Hurayra - Handle: HurayraIIT\r\nimport sys\r\nfrom tkinter import N\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 n = ri()\r\n a = n \r\n b = n \r\n cntA = 0\r\n cntB = 0\r\n while a%10!=0:\r\n cntA += 1\r\n a += 1\r\n while b%10!=0:\r\n cntB += 1\r\n b -= 1\r\n \r\n if cntA < cntB:\r\n wi(a)\r\n else:\r\n wi(b)\r\n\r\n \r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "x = eval(input())\r\nif x%10>=5 :\r\n x = x+10-x%10\r\nelse :\r\n x = x-x%10\r\nprint(x) \r\n", "n = int(input())\r\ns = str(n)[-1]\r\nif int(s) <= 5:\r\n print(n-int(s))\r\nelse:\r\n print(n+10-int(s))", "x=input()\r\nif int(x[-1])==0:\r\n print(x)\r\nelif int(x[-1])>0 and int(x[-1])<=5:\r\n print(int(x)-int(x[-1]))\r\nelif int(x[-1])>5 and int(x[-1])<=9:\r\n print(int(x)-int(x[-1])+10)\r\n \r\n", "n=int(input())\r\nif n in [0,1,2,3,4,5]:\r\n print(0)\r\nelif n%10 in [0,1,2,3,4,5]:\r\n print(str(n//10)+'0')\r\nelse:\r\n x=10-(n%10)\r\n print(n+x)\r\n\r\n\r\n", "def answer():\r\n a = int(input())\r\n if int(str(a)[-1])<5:\r\n a-=a%10\r\n else:\r\n a+=10-a%10\r\n print(a)\r\nanswer()", "T=int(input())\r\nz=round(T/10)10\r\nprint(z)", "n=int(input())\r\n\r\nlast=n%10\r\n\r\nif(last==5):\r\n print(n-5)\r\nelif last<5:\r\n print(n-last)\r\nelse:\r\n add=10-last\r\n print(n+add)\r\n", "n=int(input())\r\nprint(((n+5)//10)10)", "n = int(input())\nr = n % 10\nif r > 5:\n print(n+10-r)\nelse:\n print(n-r)\n", "if __name__ == '__main__':\r\n n = int(input())\r\n print(10 (n // 10 + (n % 10 > 5)))\r\n", "n=str(input())\r\nif(n[len(n)-1]=='0'):\r\n print(n)\r\nelif(n[len(n)-1]=='5'):\r\n print(int(n)-5)\r\nelse:\r\n l=[]\r\n l.append(int(n)-1)\r\n l.append(int(n)-2)\r\n l.append(int(n)-3)\r\n l.append(int(n)-4)\r\n l.append(int(n)-5)\r\n l.append(int(n)+1)\r\n l.append(int(n)+2)\r\n l.append(int(n)+3)\r\n l.append(int(n)+4)\r\n l.append(int(n)+5)\r\n l=sorted(l)\r\n for i in range(0,len(l)):\r\n if(l[i]>=0):\r\n l[i]=str(l[i])\r\n if(l[i][len(l[i])-1]=='0'):\r\n print(l[i])\r\n break", "n = int(input())\r\nr = n % 10\r\nq = n // 10\r\nif (r == 0):\r\n print(n)\r\nelif (r > 5):\r\n print((q+1)10)\r\nelse:\r\n print(q10)", "n = int (input())\r\nm = round (n / 10)\r\nprint(m * 10)", "n = int(input())\r\nr = n % 10\r\nif r < 5:\r\n print (n - r) \r\nelse:\r\n print (n + (10 - r))\r\n", "# LUOGU_RID: 101737347\nn = int(input())\r\nprint((n + 5) // 10 * 10)", "n=int(input())\r\nr=n%10\r\nif r>5:\r\n print (n+(10-r))\r\nif 0<r<5:\r\n print (n-r)\r\nif r==0:\r\n print (n)\r\nif r==5:\r\n print (n+(10-r))", "n = input()\r\nlast = n[-1]\r\nif int(last) < 5:\r\n print(int(n) - int(last))\r\nelse:\r\n print(int(n) + (10 - int(last)))\r\n", "n = int(input())\r\nif n % 10 > 5: n += 10\r\nprint( (n // 10) * 10)\r\n", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nprint(round(n / 10) * 10)\n", "# Coded By Block_Cipher\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nfrom math import gcd\r\nfrom math import sqrt\r\nfrom collections import Counter\r\n\r\ns = input()\r\ni = int(s)\r\n\r\nif s[-1]=='0':\r\n\tprint(i)\r\nelif s[-1]=='6':\r\n\tprint(i+4)\r\nelif s[-1]=='7':\r\n\tprint(i+3)\r\nelif s[-1]=='8':\r\n\tprint(i+2)\r\nelif s[-1]=='9':\r\n\tprint(i+1)\r\nelif s[-1]=='1':\r\n\tprint(i-1)\r\nelif s[-1]=='2':\r\n\tprint(i-2)\r\nelif s[-1]=='3':\r\n\tprint(i-3)\r\nelif s[-1]=='4':\r\n\tprint(i-4)\r\nelse:\r\n\tprint(i-5)\r\n\r\n# if i%2!=0:\r\n", "n = int(input())\nres = 10 * ((n + 5) // 10)\nprint(res)\n", "def get_digits(n):\n a=list(map(int,str(n)))\n return a\na=int(input())\nif a>=10:\n lis = get_digits(a)\n if lis[-1] >= 5:\n lis[-2] += 1\n lis[-1] = 0\n long = 0\n while 1:\n if a // 10 != 0:\n a = a / 10\n long += 1\n else:\n break\n sum = 0\n for i in range(long + 1):\n sum += 10 ** i * lis[-(i + 1)]\n print(sum)\nelif a>5:\n print(10)\nelse:\n print(0)\n \t \t\t \t\t \t \t\t\t\t \t \t\t\t\t\t \t", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\na=n%10\r\nif a<=5:\r\n\tprint(n-a)\r\nelse:\r\n\tprint(n+10-a)\t", "n = input()\r\nif 0 <= int(n) % 10 <= 5:\r\n ans = n[:len(n)-1] + \"0\"\r\n print(ans)\r\nelse:\r\n ans = int(n) + 10 - int(n) % 10\r\n print(ans)", "# n (0 <= n <= 10^9)\r\nn = int(input ( ))\r\nq = n // 10\r\nr = n % 10\r\n\r\nif r <= 4:\r\n ans = n-r\r\nif r >= 6:\r\n ans = n+(10-r)\r\nif r == 5:\r\n ans = n+(10-r) or n-r\r\nprint (ans)", "n=int(input())\r\nl=int(n%10)\r\nif l in range(1,5):\r\n\tprint(n-l)\r\nelif l in range(5,10):\r\n\tprint(n+10-l)\r\nelse:\r\n\tprint(n)", "number = input()\r\nif int(number[-1]) <= 5:\r\n result = number[:-1] + '0'\r\nelse:\r\n result = int(number) + (10 - int(number[-1]))\r\nprint(result)\r\n", "n = int(input())\r\na = n % 10\r\nif a <= 5:\r\n print (n-a)\r\nelse:\r\n print((n+10)-a) \r\n ", "print((int(input()) + 4) // 10 * 10)", "a=int(input())\r\nc1=str(a)\r\nc=c1[-1]\r\nif a==5:\r\n print(0)\r\nelif c == '1' or c=='2' or c=='3' or c=='4':\r\n print(a-(int(c)))\r\nelif c =='5' or c=='6' or c=='7' or c=='8' or c=='9':\r\n print(a+(10-(int(c))))\r\nelse:\r\n print(a)", "\r\ndef main_function():\r\n n = input()\r\n if int(n[-1]) > 5:\r\n needed = 10 - int(n[-1])\r\n return str(int(n) + needed)\r\n else:\r\n return n[:-1] + \"0\"\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "n = int(input())\r\nmod = n % 10\r\nif (mod == 0):\r\n print(n)\r\nelif (mod == 5):\r\n print(n - 5)\r\nelse:\r\n if mod < 5:\r\n did = n - mod\r\n print(did)\r\n else:\r\n dif = 10 - mod\r\n sum = n + dif\r\n print(sum)", "n=int(input())\r\nif((n%10)>=5):\r\n z=10-(n%10)\r\n print(n+z)\r\nelif((n%10)>0 and (n%10)<5):\r\n z=n%10\r\n print(n-z)\r\nelse:\r\n print(n)", "def inlt():\r\n return(list(map(int,input().split())))\r\nimport sys\r\nfrom collections import defaultdict\r\nfrom math import sqrt, ceil,floor,factorial,log\r\nfrom bisect import bisect_left , bisect_right\r\nfrom io import BytesIO, IOBase, StringIO\r\nMYPC = False\r\nif MYPC :\r\n sys.stdin = open('in.txt' , 'r')\r\n sys.stdout = open('out.txt' , 'w')\r\ninput = lambda : sys.stdin.readline().rstrip(\r\n)\r\nt=int(input())\r\nif t%10<=5:\r\n print(t - (t%10))\r\nelse:\r\n print(t + (10-(t%10))) ", "n = int(input())\r\n \r\n# check last digit\r\n# round up or round down\r\n\r\nif(n%10 <= 5):\r\n # round down - subtract the remainder when divide by 10\r\n ans = n - n%10\r\nelse:\r\n # round up - round down then +10\r\n ans = 10 + n - n%10\r\n\r\nprint(ans)\r\n", "a=int(input())\r\ni=0\r\nj=0\r\nx=0\r\ny=0\r\nfor i in range(10):\r\n v=a+i\r\n lst=list(str(v))\r\n r=len(lst)\r\n x=x+1\r\n if(lst[r-1]=='0'):\r\n p=v\r\n break\r\nfor j in range(10):\r\n t=a-j\r\n lst1=list(str(t))\r\n f=len(lst1)\r\n y=y+1\r\n if(lst1[f-1]=='0'):\r\n q=t\r\n break\r\ne=x-1\r\nw=y-1\r\nif(e<w):\r\n print(p)\r\nelse:\r\n print(q)", "#!/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 dl = n%10\r\n if dl == 0:\r\n print(n)\r\n else:\r\n if dl > 5:\r\n print(n+10-dl)\r\n else:\r\n print(n-dl)\r\n", "n=int(input())\r\nt=n%10\r\nif(t<=5):\r\n print(n-t)\r\nelse:\r\n print(n+(10-t))\r\n", "# cook your dish here\r\nn = int(input())\r\nx = n%10\r\nif x>=5:\r\n print(n + 10 - x)\r\nelse:\r\n print(n-x)", "n=int(input())\r\nk=n%10\r\nif k==0:\r\n print(n)\r\nelif 0<k<=5:\r\n print(n-k)\r\nelse :\r\n print(n+10-k)", "print((int(input())+5)//1010)", "n = input()\r\nif int(n[-1])>5:\r\n print(10-int(n[-1])+int(n))\r\nelse:\r\n print(n[0:-1]+'0')\r\n", "n = str(input())\nx = len(n)\nif x == 1:\n n = int(n)\n if n <= 5:\n n = 0\n elif n > 5:\n n = 10\nelif x > 1:\n a = 0\n while x > 1:\n n = int(n)\n a = n\n a = a % 10\n x = x - 1\n if a <= 5:\n n = n - a\n elif n > 5:\n n = n - a + 10\nprint(n)\n \t \t\t \t\t \t \t\t\t \t \t \t \t\t", "from math import \r\n\r\nn = int(input())\r\nprint(round(n/10)10)", "n=int(input())\r\nif n%10>5:\r\n\tprint(n+10-(n%10))\r\nelse:\r\n\tprint(n-(n%10))", "n = int(input())\nc = 0\nif n % 2 == 0 and n % 5 == 0:\n print(n)\nelse:\n x = n\n while not (x % 2 == 0 and x % 5 == 0):\n c += 1\n x += 1\n if c < 5:\n print(x)\n else:\n print(n - (10 - c))", "n=int(input())\r\nr=n%10\r\nif(r>=6):\r\n print(n+(10-r))\r\nelse:\r\n\r\n print(n-r)\r\n \r\n", "n = int(input())\r\nk = n%10\r\nif k<=5:\r\n print(n-k)\r\nelse:\r\n print(n+(10-k))", "n=int(input())\r\nn=round(n/10)\r\nprint(n10)", "n = int(input())\r\n0 <= n <= 10 ^ 9\r\nprint (round(n / 10) * 10)", "n = int(input())\r\na = n%10 \r\nif a>5:\r\n print(n+10-a)\r\nelse:\r\n print(n-a)", "n = int(input())\r\na = n % 10\r\nif a <= 5:\r\n n -= a\r\nelse:\r\n n += (10 - a)\r\nprint(n)", "n = int(input())\nc = n%10\nif c<=5:\n n = n-c\nif c > 5:\n n = n+(10-c)\nprint(n)\n\t \t\t\t \t \t\t \t\t \t \t \t", "n = int(input())\r\nprint(n - (n % 10) + round((n % 10) / 10) * 10)\r\n", "n = int(input())\r\nx,left,right,y = n,0,0,n\r\nwhile str(n)[-1] != '0':\r\n n -= 1\r\n left += 1\r\nwhile str(x)[-1] != \"0\":\r\n x += 1\r\n right += 1\r\nif left <= right:\r\n print(y - left)\r\nelse:\r\n print(y + right)\r\n\r\n\r\n", "n = int(input())\r\nif n% 10 == 0:\r\n print(n)\r\nelse:\r\n a, b = n-1, n+1\r\n c1, c2 = 0, 0\r\n while a%10 != 0:\r\n a-=1\r\n c1+=1\r\n while b%10!=0:\r\n b+=1\r\n c2+=1\r\n if c1 > c2:\r\n print(b)\r\n else:\r\n print(a)\r\n\r\n", "a=int(input())\r\na=a+5\r\nprint((a//10)10)", "n = int(input())\r\nif n%10 == 0:\r\n print(n)\r\nelif n%10<6:\r\n print(n-n%10)\r\nelse:\r\n print(n+10-n%10)\r\n", "a=int(input())\r\nif a%10==0:\r\n print(a)\r\nelif a%10<5:\r\n print(a//1010)\r\nelse:\r\n print(((a//10)+1)10)", "def redondear(number):\r\n digit=number%10\r\n if digit==0:\r\n return number\r\n elif 5<=digit<10:\r\n return number + (10-digit)\r\n return number-digit\r\ndef main():\r\n number=int(input())\r\n print(redondear(number))\r\nmain()", "n = int(input())\r\n\r\nn1 = str(n)\r\nlast = n1[-1]\r\nl = int(last)\r\nif l > 5:\r\n n = n + (10 - l)\r\nelse:\r\n n = n - l\r\n\r\nprint(n)\r\n", "n = int(input())\r\nm = round(n/10)\r\nprint(m10)", "import sys\r\nimport math\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef listinput(): return list(map(int, sys.stdin.readline().strip().split())) \r\nn=input()\r\nif int(n[-1])>=5:\r\n n=int(n)+10-int(n[-1])\r\nelse:\r\n n=n[:-1]+\"0\"\r\nprint(n)", "n = int(input())\r\nprint(round(n,-1))", "num=int(input())\r\n\r\nr=num%10\r\nif r<=5:\r\n\tprint(num-r)\r\nelse:\r\n\tprint(num+(10-r))", "n = input()\r\nif n[-1] == \"0\":\r\n print(n)\r\nelse:\r\n print(round(int(n) / 10) * 10)", "from math import ceil\nn = int(input())\nif n%10 < 5:\n\tprint((n//10)10)\nelse:\n\tprint(ceil(n/10)10)", "n = int(input())\r\na = round (n / 10)10\r\nprint(a)", "n = int(input())\nif n % 10 <= 5:\n print(n // 10 10)\nelse:\n print(n // 10 * 10 + 10)\n# Wed Jan 04 2023 12:03:43 GMT+0300 (Moscow Standard Time)\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn=read_int()\n\tprint(((n+5)//10)10)\n\nsolve()\n", "'''input\n5432359\n'''\n\n# Created by Adhney\n\nn = int(input())\n\nd = n%10\n\nif d == 0:\n\tprint(n)\nelif d>= 1 and d<=5:\n\tprint(n-d)\nelif d>5 and d<=9:\n\tprint(n+(10-d))\n\t", "s=input()\r\ns1=\"56789\"\r\nx=len(s)-1\r\nif s[x] in s1:\r\n while(s[len(s)-1]!=\"0\"):\r\n y=int(s)\r\n y+=1\r\n s=str(y)\r\n print(s)\r\nelse:\r\n while(s[len(s)-1]!=\"0\"):\r\n y=int(s)\r\n y-=1\r\n s=str(y)\r\n print(s)\r\n\r\n \r\n \r\n", "n = int(input())\r\n\r\nn = round(n/10)\r\n\r\nif n == 0:\r\n print('0')\r\nelse:\r\n print(str(n) + '0')", "import math\r\nx = int(input())\r\nprint(10round(x/10))", "n = int (input())\nr = n%10\ndown = n-r\nif r>4:\n up = 10\nelse:\n up = 0\nans = down + up\nprint(ans)", "def solve(n):\n if n % 10 <= 5:\n return 10(n // 10)\n else:\n return 10(n//10) + 10\n\n\ndef main():\n n = int(input())\n print(solve(n))\n\n\nmain()\n", "# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!\r\n# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!\r\n# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!\r\nfrom sys import stdin, stdout\r\nimport math\r\nimport heapq\r\nfrom itertools import accumulate\r\n\r\nN = int(input())\r\n#s = input() \r\n#N,K = [int(x) for x in stdin.readline().split()]\r\n\r\n\r\nmodule = N%10\r\n\r\nif module<=5:\r\n print(N-module)\r\nelse:\r\n print(N+10-module)\r\n \r\n \r\n \r\n \r\n \r\n ", "n=int(input())\r\nm=n%10\r\nif m==0:\r\n n=n\r\nelif m<=5:\r\n n=n-m\r\nelse:\r\n n=n+10-m\r\nprint(n)", "n=list(input())\r\nif n[-1]==0:\r\n print(\"\".join(n))\r\nelif int(n[-1])<=5:\r\n n[-1]=\"0\"\r\n print(\"\".join(n))\r\nelse:\r\n temp=int(\"\".join(n))\r\n if n[-1]=='9':\r\n print(temp+1)\r\n elif n[-1]=='8':\r\n print(temp+2)\r\n elif n[-1]=='7':\r\n print(temp+3)\r\n elif n[-1]=='6':\r\n print(temp+4)", "a = int(input())\r\nprint(a - a % 10 if (a % 10) <= 5 else (a+10) - (a+10) % 10)", "n=int(input())\r\nif n%10==0:\r\n print(n)\r\nelse:\r\n x=n%10\r\n if x>5:\r\n print(n + (10-x))\r\n else:\r\n print(n -x)\r\n", "n=int(input())\r\nif n%10==0:\r\n\tpass\r\nelif n%10<6:\r\n\tn=(n//10)10\r\nelse:\r\n\tn+=10-n%10\r\nprint(n)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[5]:\n\n\nn = int(input())\na = n%10\nif a<=5:\n print(n-a)\nelse:\n print(n+(10-a))\n\n", "n = int(input())\r\nrem = n%10\r\n\r\nif rem == 0:\r\n\tprint(n)\r\nelif rem in range(1,6):\r\n\tprint(n-rem)\r\nelse:\r\n\tprint(n+10-rem)", "n=int(input())\r\nif(n%10==0):\r\n print(n)\r\nelse:\r\n a=n%10\r\n n=n//10\r\n if(a<=5):\r\n print(n10)\r\n else:\r\n print((n+1)10)", "n = int(input())\r\nprint(round(n / 10)10)", "q=int(input())\r\nh=q%10\r\nif h<=5:\r\n print(q-h)\r\nelse:\r\n h=10-h\r\n print(q+h)", "\r\nn = int(input())\r\nn1 = n % 10 \r\nif n1 < 6:\r\n\tprint(n - n1)\r\nelse:\r\n\tprint(n+10-n1)", "r=int(input())\r\nn=int((r+5)/10)\r\nprint(10n)", "n = int(input())\n\nb = n%10 \nb != 0\nif b >= 5:\n ans = n - b +10\n\nif b <= 4:\n ans = n-b\n\nprint(ans)\n\n\n\n\n\n\n\n\n\n\n\n\n", "i=int(input())\r\nif (i%10)<5:\r\n print(i-(i%10))\r\nelse:\r\n print(i+(10-(i%10)))", "n=int(input())\r\nif n%10!=0:\r\n\ts1=str(n)\r\n\ts=tuple(s1)\r\n\tlast=int(s[len(s1)-1])\r\n\tif last<=5:\r\n\t\twhile n%10!=0:\r\n\t\t\tn-=1\r\n\telse:\r\n\t\twhile n%10!=0:\r\n\t\t\tn+=1\r\n\tprint(n)\r\nelse:\r\n\tprint(n)", "number = int(input())\r\nunitdigit = number%10\r\nadd = 0\r\nif unitdigit > 4:\r\n add = 10\r\nelse:\r\n add = 0\r\nprint((number-(unitdigit))+add)", "a = input()\r\nb = int(a[-1])\r\nif b == 5:print(a[:-1]+\"0\")\r\nelif b < 5:print(int(a) - b)\r\nelse:print(int(a)+(10 - b))", "n = int(input())\r\na = (n // 10) 10\r\ns = str(n)\r\nif int(s[-1]) < 5:\r\n print(a)\r\nelse:\r\n print(a + 10)\r\n\r\n", "if __name__ == '__main__':\r\n n = input()\r\n if int(n[len(n)-1]) <= 5:\r\n print(n[:len(n)-1]+'0')\r\n elif int(n[len(n)-1]) >= 6:\r\n print(str(int(n)+(10 - int(n[len(n)-1]))))\r\n", "t = int(input())\r\nz = round(t/10)10\r\nprint(z)", "n=int(input())\r\nrem=n%10\r\nif(rem<5):\r\n n=n-rem\r\nelse:\r\n n=n+(10-rem)\r\nprint(n) ", "print(int(round(int(input())/10)10))", "n=int(input())\r\ns=int(str(n)[-1])\r\na=(n-s)\r\nb=n+(10-(n%10))\r\nif(min(n-a,b-n)==n-a):\r\n print(a)\r\nelse:\r\n print(b)\r\n", "n=int(input())\r\nif n%10>=5:\r\n\tn=n//1010+10\r\nelse:\r\n\tn=n//1010\r\nprint(n)\r\n", "n = int(input())\nif n%10 == 0:\n\tprint(n)\nelse:\n\tif n%10>= 5:\n\t\tprint(n + 10 - n%10)\n\telse:\n\t\tprint(n - n%10)\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\nans = n // 10 * 10 if n % 10 <= 5 else n + (10 - n % 10)\r\nprint(ans)", "x=int( input())\r\ny = x % 10\r\nif y<5:\r\n print(x-y)\r\nelif y >=5:\r\n z = 10-y\r\n print(x+z)", "# cook your dish here\r\nn=int(input())\r\nk=n%10\r\nif k>(10-k):\r\n ans=n+10-k\r\nelse:\r\n ans=n-k\r\nprint(ans)\r\n ", "u=int(input())\nif(u%10 <= 5):\n\tprint((u//10)10)\nelse:\n\tprint(((u//10)+1)10)", "n=int(input())\r\nif n%10!=0:\r\n if n%10<5:\r\n n-=n%10\r\n else:\r\n n+=10-n%10\r\nprint(n)", "n=int(input())\r\nr=n%10\r\nif(r>5):\r\n n+=(10-r)\r\nelse:\r\n n-=r\r\nprint(n)", "x = int(input())\r\n \r\nif x >=0 and x<=1000000000:\r\n y = round(x, -1)\r\n print(y)\r\n", "n=input()\r\nif n[-1]=='0':\r\n print(n)\r\nelif n[-1]<='5':\r\n s=int(n[-1])\r\n n=int(n)\r\n print(n-s)\r\nelse:\r\n s=10-int(n[-1])\r\n print(int(n)+s)\r\n\r\n \r\n", "s=int(input())\nwhile(s%10!=0):\n\n if ( (s-1)%10 == 0 or (s-2)%10 ==0 or (s-3)%10 ==0 or (s-4)%10 ==0 ):\n while(s%10!=0):\n s=s-1\n break\n elif ( (s-6) %10==0 or (s-7) %10==0 or (s-8) %10==0 or (s-9) %10==0):\n while(s%10!=0):\n s=s+1\n break\n elif ((s-5)%10==0 or (s+5)%10==0):\n s=s-5\n\nprint(s)\n\n \t \t \t \t\t \t\t \t\t\t \t \t", "a=int(input())\r\nif a%10>=5:\r\n print((((a2)-((a2)%10))//2)+5)\r\nelse:\r\n print(a-(a%10))", "n=int(input())\r\ndig=n%10\r\nif(dig<=5):\r\n n-=dig\r\nelse:\r\n n+=(10-dig)\r\nprint(n)", "def shing():\r\n bop()\r\ndef bop():\r\n global inputis\r\n inputis = input()\r\n try:\r\n inputis = int(inputis)\r\n except:\r\n shing()\r\n return\r\n inputis = int(inputis)\r\n if 0<=inputis<=1000000000: \r\n inputis = str(inputis)\r\n x = inputis[len(inputis)-1]\r\n inputis = int(inputis)\r\n x = int(x)\r\n if x == 0 or x == 1 or x == 2 or x == 3 or x == 4:\r\n inputis = inputis - x\r\n else:\r\n inputis = inputis + (10-x)\r\n print(inputis)\r\n else:\r\n shing()\r\n \r\nbop()\r\n", "num = int(input())\r\nwhile num%10!=0:\r\n ans = num%10\r\n if ans<=5:\r\n num-=ans\r\n else:\r\n num+=(10-ans)\r\nprint(num)", "import sys\r\nfrom collections import \r\nfrom math import \r\nimport re\r\ndef inp_arr():return list(map(int,input().split()))\r\ndef inp():return map(int,input().split())\r\ndef lcm(a,b):return (ab)/gcd(a,b)\r\ndef even(n):return[False,True][0 if n%2 else 1]\r\nmax_int = sys.maxsize\r\nmod = 109+7\r\n\r\nn=input()\r\nif n[-1]<='5':n=int(n)-int(n[-1])\r\nelse:\r\n n=(int(n)+10)-int(n[-1])\r\nprint(n)", "n = int(input())\r\nx = round (n / 10)\r\nprint(x 10)", "n = int(input())\r\n\r\nif (n % 10 < 5):\r\n print(n - n%10)\r\n\r\nelse:\r\n print(n + 10 - n % 10)\r\n\r\n", "n=int(input())\r\nif n%10==5:\r\n print(n-5)\r\nelif n%10>5:\r\n print(n+(10-(n%10)))\r\nelif n%10<5:\r\n print(n-(n%10))", "n=input(\"\")\r\nif int(n[len(n)-1])<5:\r\n print(int(n)-int(n[len(n)-1]))\r\nelif int(n[len(n)-1])>5:\r\n print(int(n)-int(n[len(n)-1])+10)\r\nelse:\r\n print(int(n)-int(n[len(n)-1]))", "n = int(input())\n\nif n%10!=0:\n r = n%10\n if r>5:\n print(n+10-r)\n else: \n print((n//10)10)\nelse:\n print(n)", "#Rounding\r\nn=int(input())\r\nt=n\r\nn=n%10\r\nprint((t-n) if n<=5 else (t-n+10))", "a = input()\r\nif a[-1] != '0':\r\n b = int(a[-1])\r\n if b + 5 > 10:\r\n print(int(a)+ (10 - b))\r\n else:\r\n print(a[:-1] + '0')\r\nelse:\r\n print(a)", "def solve():\r\n c = int(input())\r\n a = c // 10 10\r\n b = a + 10\r\n\r\n if c - a > b - c:\r\n print(b)\r\n else:\r\n print(a)\r\n \r\nif __name__ == \"__main__\":\r\n #for i in range(int(input())):\r\n solve()", "# -- coding: utf-8 --\n\"\"\"(round example)\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1ccSSWJPdktkWCKEXPtvB9d1PclYxVraJ\n\"\"\"\n\nn = int(input())\ni=n%10\nif(i<=5):\n n=n-i\nelse:\n n=n+(10-i);\n \nprint(n)", "import math\r\nimport sys\r\nimport itertools\r\nimport itertools\r\nimport bisect\r\n\r\ndef sa(Type= int):\r\n return [Type(x) for x in input().split()]\r\n\r\ndef solve(t):\r\n n = int(input())\r\n lastDigit = n % 10\r\n\r\n if lastDigit < 6:\r\n print((n // 10) * 10)\r\n else:\r\n print(((n // 10) + 1) * 10)\r\n\r\nif __name__ == '__main__':\r\n # sys.stdin = open('input.txt', 'r')\r\n\r\n # t = int(input())\r\n # for i in range(t):\r\n # solve(i+1)\r\n solve(1)\r\n", "n = int(input())\r\nif(0 <= int(n) and int(n) <= 10*9):\r\n pass\r\nelse:\r\n exit()\r\n\r\n\r\nlist1 = [int(x) for x in str(n)]\r\n\r\nm = list1[len(list1) - 1]\r\n\r\nif(1 <= m and m <= 5):\r\n list1[len(list1) - 1] = 0\r\n\r\n str1 = [str(lis) for lis in list1]\r\n str2 = \"\".join(str1)\r\n anInteger = int(str2)\r\n print(anInteger)\r\nelif(m == 0):\r\n print(n)\r\nelse:\r\n i = 10 - m\r\n n = n + i\r\n print(n)\r\n", "n = input()\r\nx = int(n[len(n) - 1])\r\nif x != 0:\r\n if 10 - x > x:\r\n print(n[0:len(n) - 1] + '0')\r\n else:\r\n print(int(n) + 10 - x)\r\nelse:\r\n print(n)", "n = int(input())\r\na = int(str(n)[::-1][0])\r\nif a>10-a:\r\n\tprint(n+10-a)\r\nelse:\r\n\tprint(n-a)", "n = int(input())\r\n\r\nl = n - n % 10\r\nr = l + 10\r\n\r\nif n - l <= r - n:\r\n print(l)\r\nelse:\r\n print(r)", "n=int(input())\r\nminus=n%10\r\nplus=10-n%10\r\nif minus>plus:\r\n print(n+plus)\r\nelse:\r\n print(n-minus)\r\n", "n = input()\r\np = n[-1]\r\nif int(p) <= 5:\r\n print(n[:-1] + '0')\r\nelse:\r\n m = int(n) % 10\r\n print(int(n) + 10 - m)", "n = int(input())\r\n\r\na = (n // 10) 10\r\nb = a + 10\r\n \r\nif n - a > b - n:\r\n print(b)\r\nelse:\r\n print (a)\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input()) \r\nif n%10 in range(0,6): \r\n print(n-n%10)\r\nelif n%10 in range(6,10): \r\n print(n+(10-n%10))", "\r\nn = int(input())\r\nif 0 < n % 10 < 5:\r\n print(n -( n % 10 ))\r\nelif 5 <= n % 10 <= 9:\r\n if n % 10 == 5:\r\n print(n-n%10)\r\n else:\r\n print(n+(10-(n%10)))\r\nelse:\r\n print(n)", "n=int(input())\r\nr=n%10\r\nif r<5:\r\n\tn-=r\r\nelse:\r\n\tn+=10-r\t\r\nprint(n)\t", "n = int(input())\r\nr = n % 10 \r\nprint(n - r if r <= 5 else n + 10 - r)", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\na=n%10\r\nif a>5:\r\n\tn+=10-a\r\nelse:\r\n\tn-=a\r\nprint(n)", "a = int(input())\r\nmod = a%10\r\nif mod<5:\r\n print(a-mod)\r\nelse:\r\n print(a+(10-mod))", "n=int(input())\r\nb=str(n)\r\nc=int(b[-1])\r\nif c<5:\r\n print(n-c)\r\nelif c>5:\r\n print(n+(10-c))\r\nelse:\r\n print(c+n)", "n=int(input())\nr=n%10\nq=n//10\nif(r>5):\n print((q+1)10)\nelse:\n print(q10)\n\n\n \n \n\n \n ", "\r\nn=int(input())\r\nc=n%10\r\nif c==0 or c==1 or c==2 or c==3 or c==4 or c==5:\r\n print(n-c)\r\nelse:\r\n print(n+(10-c))\r\n", "n = int(round(int(input())/10)10)\r\nprint(n)\r\n", "n=int(input())\r\nif n%10==5:\r\n print(n+5)\r\nelif n%10==0:\r\n print(n)\r\nelif n%10 < 5:\r\n print(n-(n%10))\r\nelif n%10 > 5:\r\n print(n+(10-(n%10)))", "q=[int(input())]\r\nans=-1\r\nwhile ans==-1:\r\n a=q.pop(0)\r\n if a%10==0:\r\n ans=a\r\n else :\r\n q.append(a-1)\r\n q.append(a+1)\r\nprint(ans)", "n=int(input())\r\nm=n%10\r\nif(m<=5):\r\n print(int(n-m)) \r\nelse:\r\n print(int(10-m+n))", "t=(input())\nz=int(t)%10\nif t[-1]==0:\n print(t)\nelif z>5:\n t=int(t)\n t=t+10-z\n print(t)\nelse:\n t=int(t)\n t=t-z\n print(t)\n\t\t \t \t\t\t \t \t \t \t \t\t\t \t \t\t\t\t", "# LUOGU_RID: 102386230\nprint(round(int(input())/10)10)\r\n", "n = int(input())\nq,r = divmod(n, 10)\na = q10\nb = (q+1)10\nif n-a <= b-n:\n print(a)\nelse:\n print(b)\n", "n = int(input())\r\nr = (n%10)\r\nif r <= 5:\r\n print (n-r)\r\nelse:\r\n print (n+(10-r))", "n=int(input())\r\nl=n%10\r\nif l<5:\r\n n=n-l\r\n print(n)\r\nelse:\r\n c=10-l\r\n n=n+c\r\n print(n)\r\n", "n =int(input())\r\nn2=n\r\nc1=0\r\nc2=0\r\nwhile n%10 !=0:\r\n if int(str(n)[-1])<=5:\r\n n-=1\r\n else:\r\n n+=1\r\nprint(n)\r\n\r\n\r\n", "n = int(input())\r\nlast_digit = int(str(n)[-1])\r\n\r\nif last_digit >= 5:\r\n n += 10-last_digit\r\nelse:\r\n n -= last_digit\r\nprint(n)", "n=int(input())\r\np=int(n%10)\r\nif(p>=5):\r\n print(n+(10-p))\r\nelse:\r\n print(n-p)", "import random\r\nnum=str(input(\"\"))\r\nif num [-1]== '0':\r\n print(num)\r\nelif num =='5':\r\n print(random.choice ([\"0\",\"10\"]))\r\nelif num[-1]=='5':\r\n print(int(num) +5)\r\nelse:\r\n if 10- int(num[-1]) >5:\r\n print(int(num) -int(num[-1]) )\r\n else:\r\n print(int (num) + (10 - int(num [-1])) )", "c=int(input())\r\nif(c%10>=6):\r\n print(((c//10)10)+10)\r\nelse:\r\n print((c//10)10)", "n = int(input())\r\nif(n%10<5):\r\n\tprint(n-n%10)\r\nelif(n%10>5):\r\n\tprint(n+10-n%10)\r\nelse:\r\n\tprint(n+5)", "a=int(input())\r\nprint((a+5)//1010)\r\n", "n = int(input())\r\nprint(((n+5) // 10) 10 )\r\n", "# -- coding: utf-8 --\n\"\"\"Untitled31.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/17FYXKkGHhJk4BTAD6JXnNzUfuBKL7211\n\"\"\"\n\ndata = input()\nM = int(data)\nif (M%10 < 5):\n print(M - M%10)\n\nelse:\n print(M+10-M%10)", "n = int(input())\r\nprint(((n + 5) // 10) * 10)", "n=int(input())\r\nrem=n%10\r\nif(rem>5):\r\n print(n+10-rem)\r\nelse:\r\n print(n-rem)\r\n\r\n \r\n ", "n = int(input())\r\nr = n%10\r\nif r==0:\r\n print(n)\r\nelif r<5:\r\n print(n-r)\r\nelif r>=5:\r\n print(n+(10-r))", "n=int(input())\nz=n%10\nif z>=5:\n ans=n+(10-z)\nif z<=5:\n ans=n-z\nprint(ans)", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"outp.out\",'w')\r\nn=int(input())\r\nx=n%10\r\nif x!=0:\r\n\tif x<=5:\r\n\t\tn-=x\r\n\telse:\r\n\t\tn+=(10-x)\t\r\nprint(n)\t\t", "n = int(input())\r\nif n % 10 >= 5:\r\n\tn += 10 - (n % 10)\r\nelse:\r\n\tn -= (n % 10)\r\nprint(n)", "n=input()\r\ns=int(n[-1])\r\na=int(n)-s\r\nb=a+10\r\nif(int(n)-a>b-int(n)):\r\n print(b)\r\nelse:\r\n print(a)", "test=input()\r\nchack=int(test[len(test)-1])\r\nif chack==0:\r\n\tprint(test)\r\nelif chack<=5:\r\n\tprint(test[:len(test)-1]+\"0\")\r\nelse:\r\n\tsubstract=10-chack\r\n\tprint(str(int(test)+substract))\r\n\r\n", "a = int(input())\nb=a%10\n\nc=a%100\nanc=a%100\nc=c-b+10\nif b<=5 :\n print(a-b)\nelse:\n a-=anc\n a+= c\n print(a)\n\t \t \t\t\t\t \t \t \t\t \t\t \t\t \t", "n=list(input())\r\nif int(''.join(n))%10==0:\r\n print(''.join(n))\r\nelse:\r\n if int(''.join(n))%10<=5:\r\n print(int(''.join(n))-int(''.join(n))%10)\r\n else:\r\n print(int(''.join(n))+(10-int(''.join(n))%10))", "n = int(input())\r\nif int(str(n)[-1]) > 4:\r\n n += 10 - int(str(n)[-1])\r\nelse:\r\n n -= int(str(n)[-1])\r\nprint(n)", "n = int(input())\r\nrem = n%10\r\nnum = 0\r\n\r\nif rem>=0 and rem<5:\r\n num = int(n/10) * 10\r\nelse:\r\n n = int(n/10)\r\n rem = n%10\r\n n = int(n/10)\r\n num = n100 + (rem+1)10\r\n\r\nprint(num)", "a=int(input())\r\nprint(round(a/10)10)", "n = int(input())\r\ndigit = n%10\r\nif digit == 0:\r\n pass\r\nelif digit <= 5:\r\n n -= digit\r\nelse:\r\n n = n + (10 - digit)\r\nprint(n)\r\n", "n=int(input());print(n//1010+10(n%10>5))", "n=int(input())\r\nif(n%10>=6):\r\n print(n+(10-(n%10)))\r\nelse:\r\n print((n//10)10)", "n=int(input())\r\na=n%10\r\nb=n-a\r\nif a==5:\r\n\tprint(b+0)\r\nelif a>5 and a<10:\r\n\tprint(b+10)\r\nelse:\r\n\tprint(b)", "n=int(input())\r\nk=n%10\r\nif 5<k:\r\n\td=10-k\r\n\tr=n+d\r\nelif 5>=k:\r\n\tr=n-k\r\nprint(r)", "n = int(input())\r\nx = n%10\r\nif x < 5:\r\n print(n - x)\r\nelse:\r\n print(n+(10-x))\r\n", "nums = list(input())\r\nif nums[-1] == 0:\r\n print(\"\".join(nums))\r\nelif int(nums[-1]) <= 5:\r\n nums[-1] = \"0\"\r\n print(\"\".join(nums))\r\nelse:\r\n A = int(\"\".join(nums))\r\n if nums[-1] == \"9\":\r\n print(A + 1)\r\n elif nums[-1] == \"8\":\r\n print(A + 2)\r\n elif nums[-1] == \"7\":\r\n print(A + 3)\r\n elif nums[-1] == \"6\":\r\n print(A + 4)", "N = int(input())\na = N%10\nif a>0 and a<=5:\n N = N-a\nelif a>5:\n N = N+10-a\nprint(N)\n\n \t \t\t\t \t\t \t \t\t\t\t\t \t \t \t\t", "print((lambda x:x-x%10 if x%10<5 else x-x%10+10)(int(input())))", "n=int(input())\r\nif n%10 > 5:\r\n print(n+(10-n%10))\r\nelse:\r\n print(n-n%10)", "n = int(input())\r\n\r\nif (n%10 == 0):\r\n\tprint (n)\r\nelse:\r\n\r\n\tk = n%5\r\n\tif (k==0):\r\n\t\tprint (n+5)\r\n\telse:\r\n\t\tk = n%10\r\n\r\n\t\tif (k in [1,2,3,4]):\r\n\t\t\tprint (n-k)\r\n\t\telse:\r\n\t\t\thh = n//10\r\n\t\t\tprint (n-k+10)\r\n\r\n\r\n\r\n", "import sys\r\n\r\nn = int(input())\r\nif n % 10 == 0:\r\n print(n)\r\n sys.exit()\r\n\r\nif n % 10 < 10 - n % 10:\r\n print(n - n % 10)\r\nelse:\r\n print(n + (10 - n % 10))\r\n ", "x=int(input())\r\nif x%10>4:\r\n\tprint(x-(x%10)+10)\r\nelse:\r\n\tprint(x-(x%10))\r\n\r\n", "n = int(input())\nif(n%10 <5):\n print(n - n%10)\nelse:\n print(n + 10 - n % 10)", "n = int(input())\r\nprint(n - int(str(n)[-1]) if (int(str(n)[-1]) < 5) else n + (10 - int(str(n)[-1])))", "from collections import Counter\r\nimport copy\r\n\r\ndef solve():\r\n n=int(input())\r\n rem=n%10\r\n\r\n if rem<=5:\r\n print(n-rem)\r\n return \r\n\r\n print(n+(10-rem))\r\n\r\n\r\nsolve()", "import math \r\nn = int(input())\r\nans = (round(n/10))10\r\nprint(int(ans))", "n = int(input())\r\nl = str(n)[-1]\r\nif int(l)>5 and (n+10)//1010%10==0:\r\n print((n+10)//1010)\r\nelif n%10==0:\r\n print(n)\r\nelse: print(n//1010)", "n = int(input(\"\"))\r\nprint((n+5) // 10 * 10)", "n = int(input())\r\nrem = n%10\r\nval = n//10\r\nif rem > 5:\r\n print((val+1)10)\r\nelse:\r\n print(val10)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nif(n%10<=5):\r\n print(n-n%10)\r\nelse:\r\n print(n+(10-n%10))", "n = int(input())\r\ni = 0\r\nwhile 1:\r\n if (n+i)%10==0:\r\n print(n+i)\r\n break\r\n elif (n-i)%10==0:\r\n print(n-i)\r\n break\r\n i += 1\r\n", "n=int(input())\r\np=n%10\r\nif p<=5:\r\n print(n-p)\r\nelse:\r\n print(n+(10-p))\r\n", "n=int(input())\r\nif n%10>5:\r\n\tprint(n + (10-n%10 ))\r\nelse:\r\n\tprint(n- n%10)", "n = int(input())\r\nm = n % 10\r\nprint(n - m) if m <= 5 else print(n + (10 - m))", "n = int(input())\r\nu_digit = n%10\r\nif u_digit > 5:\r\n print(n+10-u_digit)\r\nelse:\r\n print(n-u_digit)\r\n" ]	{"inputs": ["5", "113", "1000000000", "5432359", "999999994", "10", "9", "1", "0", "3", "4", "6", "7", "8", "19", "100", "997", "9994", "10002", "100000", "99999", "999999999", "999999998", "999999995", "999999990", "1000000", "1000010", "10000010", "100000011", "400000003", "234234", "675621", "43532", "4576453", "65754674", "3245526", "123445", "234217", "23451218", "1231239", "1923140", "307910310", "780961030", "103509421", "576560141", "48851642", "226935072", "844450763", "22534183", "640049874", "818133304", "730616285", "613732415", "380991216", "559074636", "176590327", "354673757", "267156738", "150272868", "62755859", "945871979", "46", "999", "1397"], "outputs": ["0", "110", "1000000000", "5432360", "999999990", "10", "10", "0", "0", "0", "0", "10", "10", "10", "20", "100", "1000", "9990", "10000", "100000", "100000", "1000000000", "1000000000", "999999990", "999999990", "1000000", "1000010", "10000010", "100000010", "400000000", "234230", "675620", "43530", "4576450", "65754670", "3245530", "123440", "234220", "23451220", "1231240", "1923140", "307910310", "780961030", "103509420", "576560140", "48851640", "226935070", "844450760", "22534180", "640049870", "818133300", "730616280", "613732410", "380991220", "559074640", "176590330", "354673760", "267156740", "150272870", "62755860", "945871980", "50", "1000", "1400"]}	UNKNOWN	PYTHON3	CODEFORCES	461
8d9b9f436834145197b35fe3b1a4ec79	Help Far Away Kingdom	In a far away kingdom lived the King, the Prince, the Shoemaker, the Dressmaker and many other citizens. They lived happily until great trouble came into the Kingdom. The ACMers settled there. Most damage those strange creatures inflicted upon the kingdom was that they loved high precision numbers. As a result, the Kingdom healers had already had three appointments with the merchants who were asked to sell, say, exactly 0.273549107 beer barrels. To deal with the problem somehow, the King issued an order obliging rounding up all numbers to the closest integer to simplify calculations. Specifically, the order went like this: - If a number's integer part does not end with digit 9 and its fractional part is strictly less than 0.5, then the rounded up number coincides with the number’s integer part. - If a number's integer part does not end with digit 9 and its fractional part is not less than 0.5, the rounded up number is obtained if we add 1 to the last digit of the number’s integer part.- If the number’s integer part ends with digit 9, to round up the numbers one should go to Vasilisa the Wise. In the whole Kingdom she is the only one who can perform the tricky operation of carrying into the next position. Merchants found the algorithm very sophisticated and they asked you (the ACMers) to help them. Can you write a program that would perform the rounding according to the King’s order? The first line contains a single number to round up — the integer part (a non-empty set of decimal digits that do not start with 0 — with the exception of a case when the set consists of a single digit — in this case 0 can go first), then follows character «.» (a dot), and then follows the fractional part (any non-empty set of decimal digits). The number's length does not exceed 1000 characters, including the dot. There are no other characters in the input data. If the last number of the integer part is not equal to 9, print the rounded-up number without leading zeroes. Otherwise, print the message "GOTO Vasilisa." (without the quotes). Sample Input 0.0 1.49 1.50 2.71828182845904523536 3.14159265358979323846 12345678901234567890.1 123456789123456789.999 Sample Output 0123312345678901234567890GOTO Vasilisa.	[ "def round_number(num_str):\r\n integer_part, fractional_part = num_str.split('.')\r\n last_digit = int(integer_part[-1])\r\n\r\n if last_digit != 9:\r\n if int(fractional_part[0]) < 5:\r\n return integer_part\r\n else:\r\n return str(int(integer_part) + 1)\r\n else:\r\n return \"GOTO Vasilisa.\"\r\n\r\n# Read the input\r\nnum_str = input().strip()\r\n\r\n# Perform rounding and print the result\r\nresult = round_number(num_str)\r\nprint(result)", "def q99a():\n\tnum = input()\n\tdot_loc = num.index('.')\n\tif(num[dot_loc-1] == '9'):\n\t\tprint(\"GOTO Vasilisa.\")\n\telse:\n\t\tif(int(num[dot_loc+1]) < 5):\n\t\t\tprint(num[:dot_loc])\n\t\telse:\n\t\t\tprint(num[:dot_loc-1], end='')\n\t\t\tprint(int(num[dot_loc-1])+1)\n\t# num = float(input())\n\t# num_rounded = round(num)\n\t# if(int(num) % 10 != 9):\n\t# \tprint(num_rounded)\n\t# else:\n\t# \tprint(\"GOTO Vasilisa.\")\n\nq99a()", "a,b=input().split('.')\nif a[-1]=='9':print(\"GOTO Vasilisa.\")\nelse:\n if int(b[0])<5:print(a)\n else:print(int(a)+1)", "s = input()\r\nif s[s.find('.') - 1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if s[s.find('.') + 1] == '5' or s[s.find('.') + 1] == '6' or s[s.find('.') + 1] == '7' or s[s.find('.') + 1] == '8' or s[s.find('.') + 1] == '9':\r\n print(int(s[:s.find('.')]) + 1)\r\n else:\r\n print(s[:s.find('.')])", "from math import ceil, floor\r\n\r\nn = input()\r\n\r\nparts = n.split(\".\")\r\nif len(parts) == 1:\r\n print(n)\r\n exit()\r\nint_part, dec_part = parts\r\n\r\nif int_part[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\n exit()\r\n\r\nif int(dec_part[0]) >= 5:\r\n print(int_part[:-1] + str(int(int_part[-1]) + 1))\r\nelse:\r\n print(int_part)", "a,b = input().split('.')\r\n\r\nif a[-1] != '9' and int(b[0])<5:\r\n print(a)\r\nelif a[-1] != '9' and int(b[0]) >= 5:\r\n print(int(a)+1)\r\nelif a[-1] == '9':\r\n print(\"GOTO Vasilisa.\")", "a = input()\r\nfor i in range(len(a)):\r\n if a[i] == \".\" and a[i-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\n break\r\n if a[i] == \".\" and a[i+1] >= \"5\":\r\n print(int(a[:i])+1)\r\n break\r\n if a[i] == \".\" and a[i+1] <= \"5\":\r\n print(a[:i])\r\n break", "def rounder(s):\r\n st = \"\"\r\n tochkaindex1 = s.index(\".\")+2\r\n for i in range(tochkaindex1):\r\n st+=s[i]\r\n return st\r\ndef integer(s):\r\n sum = 0\r\n st = \"\"\r\n while s[sum]!=\".\":\r\n st+=str(s[sum])\r\n sum+=1\r\n return st\r\na = str(input())\r\nif str(integer(a))[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelif int(str(rounder(a))[-1])>=5 and str(integer(a))[-1] != \"9\":\r\n print(int(str(integer(a)))+1)\r\nelse:\r\n print(int(str(integer(a))))\r\n", "x, y = map(str, input().split('.'))\r\n\r\nif x[-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if int(y[0]) >= 5:\r\n x = x[:-1] + str(int(x[-1]) + 1)\r\n \r\n print(x)\r\n", "s=input().split('.')\r\ni=int(s[0])\r\nif i%10!=9:\r\n k=len(s[1])\r\n if k==1:\r\n if int(s[1])<5:\r\n print(i)\r\n else:\r\n print(i+1)\r\n else:\r\n if int(s[1][0])<5:\r\n print(i)\r\n else:\r\n print(i+1)\r\nelse:\r\n print('GOTO Vasilisa.')", "t = input()\r\nk = t.find('.')\r\nif k < 0: print(t)\r\nelif t[k - 1] == '9': print('GOTO Vasilisa.')\r\nelse: print((t[:k - 1] + str(int(t[k - 1]) + 1)) if t[k + 1] > '4' else t[:k])", "s = input()\ndot = s.find(\".\")\ni, d = s[dot - 1], s[dot + 1]\nres = \"GOTO Vasilisa.\" if i == \"9\" else int(s[:dot]) + (int(d) >= 5)\nprint(res)\n", "\ns = input()\ni,f = s.split(\".\")\n\nif(i[-1] == '9'):\n print(\"GOTO Vasilisa.\")\nelse:\n if(int(f[0]) < 5 ):\n print(int(i))\n else:\n print(int(i)+1)\n\t\t \t\t \t\t \t\t\t\t \t\t \t\t \t\t\t \t\t \t", "i, d = tuple(input().split(\".\"))\r\nif i[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelif int(d[0]) < 5:\r\n print(int(i))\r\nelif int(d[0]) >= 5:\r\n print(int(i) + 1)\r\n", "from math import floor\r\n\r\nn, d = input().split('.')\r\n\r\nif int(n) % 10 == 9:\r\n print(\"GOTO Vasilisa.\")\r\nelif int(d[0]) < 5:\r\n print(n)\r\nelse:\r\n print(int(n) + 1)\r\n", "x=input()\r\ny=x.index(\".\")\r\nz=x[(y-1):(y+2)]\r\n \r\nif z[-3] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n n=int(z[0])\r\n j=int(x[y+1])\r\n if j >= 5:\r\n n=n+1\r\n \r\n o=int(x[:(y-1)] + str(n)) \r\n print(o)\r\n", "\r\nnumero = input()\r\n\r\nindice_punto = -1\r\ni = 0\r\n\r\nwhile indice_punto == -1 and i < len(numero):\r\n if numero[i] == '.':\r\n indice_punto = i\r\n i = i+1\r\n\r\nunidades = int(numero[indice_punto-1])\r\ndecimas = int(numero[indice_punto+1])\r\n\r\nif unidades < 9 and decimas < 5:\r\n print(numero[:indice_punto])\r\nelif unidades < 9 and decimas >= 5:\r\n print(numero[:indice_punto-1] + str(int(numero[indice_punto-1])+1))\r\nelse:\r\n print('GOTO Vasilisa.')\r\n\r\n", "n=input()\r\nn=n.split('.')\r\n\r\nif n[0][-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelif n[1][0]<'5':\r\n print(n[0])\r\nelse:\r\n print(int(n[0])+1)\r\n", "import sys\nscan=sys.stdin.readline\narray=lambda : map(int,scan().split('.'))\n\na,b=scan().split('.')\nif a[-1]=='9':\n\tprint('GOTO Vasilisa.')\nelse:\n\tif ord(b[0])>=ord('5'):\n\t\tprint(int(a)+1)\n\telse:\n\t\tprint(int(a))\n\t \t \t \t \t\t \t \t \t \t\t\t", "s = input()\r\na = s.split('.')[1]\r\nb = s.split('.')[0]\r\nif b[-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelif int(a[0]) < 5:\r\n print(int(b))\r\nelif int(a[0]) > 4:\r\n print(int(b) + 1)", "import math\r\nimport sys\r\nimport re\r\n\r\nn = input()\r\nl = n.split('.')\r\nif l[0][-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if int(l[1][0]) >= 5:\r\n print(int(l[0]) + 1)\r\n else:\r\n print(l[0])", "def help_far_away_kingdon(integer: str, decimal: str) -> str:\n if (integer[-1] == '9'):\n return 'GOTO Vasilisa.'\n\n if (int(decimal[0]) < 5):\n return integer\n \n return str(int(integer) + 1)\n\n# Input\n\ni, d = input().split('.')\nresult = help_far_away_kingdon(i, d)\nprint(result)\n\n \t \t\t\t\t \t \t \t\t\t\t\t\t \t \t \t", "s = input()\r\na = int(s[:s.find('.')])\r\nif a % 10 == 9:\r\n print ('GOTO Vasilisa.')\r\nelif int(s[s.find('.')+1])>=5:\r\n print (a+1)\r\nelse:\r\n print (a)", "from decimal import \nn = input()\nidx = n.index('.')\nif n[idx - 1] == '9':\n print(\"GOTO Vasilisa.\")\nelse:\n f = Decimal(n[idx:])\n if f >= Decimal(\"0.5\"):\n print(n[:idx - 1] + str(int(n[idx - 1]) + 1))\n else:\n print(n[:idx])\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", "import sys\r\n\r\ndef main():\r\n s = sys.stdin.read().strip()\r\n x, y = s.split('.')\r\n if x.endswith('9'): return 'GOTO Vasilisa.'\r\n if int(y[0]) > 4: return int(x) + 1\r\n return x\r\n \r\nprint(main())\r\n", "num = input()\r\ndot = num.find(\".\")\r\nif num[dot - 1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(num[dot + 1]) >= 5:\r\n print(int(num[:dot]) + 1)\r\n else:\r\n print(num[:dot])", "X = input()\r\nprint(\"GOTO Vasilisa.\" if X[X.index(\".\") - 1] == \"9\" else (\r\n X[:X.index(\".\")] if X[X.index(\".\") + 1] < \"5\" else int(X[:X.index(\".\")]) + 1))\r\n", "\n__author__ = 'Esfandiar'\n\na,b = input().split('.')\nif a[-1] != '9':\n if int(b[0]) >= 5:\n print(a[:len(a)-1],end=\"\")\n print(int(a[-1])+1)\n else:\n print(a)\nelif a[-1] == '9':\n print('GOTO Vasilisa.')", "n = input()\r\ninteger, frac = n.split('.')\r\nif integer[len(integer) - 1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if frac[0] < '5':\r\n print(integer)\r\n else:\r\n print(int(integer) + 1)", "\r\ns=input()\r\nk=s.index('.')\r\nif s[k-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelif int(s[k+1])>=5: print(s[:k-1]+str(int(s[k-1])+1))\r\nelse: print(s[:k]) ", "n = input()\r\narr = n.split('.')\r\nintg = int(arr[0])\r\nif intg%10 != 9 and int(arr[1][0])<5:\r\n print(intg)\r\nelif intg%10 != 9 and int(arr[1][0])>=0.5:\r\n print(intg + 1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")\r\n", "import re\r\ninv = input().rstrip()\r\nli = inv.split('.')\r\nx = re.search('.9$',li[0])\r\nif(x == None):\r\n y = re.search('^[0-4].',li[1])\r\n if(y == None):\r\n print(int(li[0])+1)\r\n else:\r\n print(int(li[0])) \r\nelse:\r\n print(\"GOTO Vasilisa.\") \r\n \r\n\r\n\r\n\r\n", "n, f = map(str, input().split(\".\"))\r\nif n[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(f[0]) >= 5:\r\n print(int(n) + 1)\r\n else:\r\n print(n)", "x,y=input().split('.')\nx=int(x)\nn=len(y)\ny=int(y)\n\nif x%10==9:\n print('GOTO Vasilisa.')\nelse:\n if y<5(10*(n-1)):\n print(x)\n else:\n print(x+1)\n \t\t\t \t\t\t\t \t\t\t \t \t \t\t \t \t", "word = input()\r\npos=2\r\nnum=\"\"\r\nfor i in range(len(word)):\r\n if word[i]=='.':\r\n pos = i+1\r\n num=word[0:i]\r\n break\r\nif num[-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelif word[pos] in ('1','2','3','4','0'):\r\n print(num)\r\nelse:\r\n print(num[0:-1] + str(int(num[-1])+1))\n# Sun Jan 09 2022 09:33:42 GMT+0000 (Coordinated Universal Time)\n", "num=input()\r\n\r\nn, dec=num.split('.')\r\np=n[-1]\r\nnum=float(num)\r\n\r\nif p!='9':\r\n\tif 5>int(dec[0]):\r\n\t\tprint(n)\r\n\telse:\r\n\t\tprint(int(n)+1)\r\nelse:\r\n\tprint(\"GOTO Vasilisa.\")", "a, dot = input().split('.')\na = int(a)\nb = a + 1 if int(dot[0]) >= 5 else a\nprint(\"GOTO Vasilisa.\" if a % 10 == 9 else b)\n\n\n \t\t\t \t\t \t \t \t\t", "s = input()\nlast_digit_in_integer_part = int(s[s.index('.') - 1])\nfirst_digit_in_fractional_part = int(s[s.index('.') + 1])\n\nif last_digit_in_integer_part == 9:\n print('GOTO Vasilisa.')\nelse:\n if first_digit_in_fractional_part >= 5:\n print(int(s[:s.index('.')]) + 1)\n else:\n print(int(s[:s.index('.')]))", "\r\na, b = input().split(\".\")\r\nif a[-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelif b[0] < '5':\r\n print(a)\r\nelse:\r\n print(int(a) + 1)\r\n\r\n# Codeforcesian\r\n# ♥\r\n", "s=input()\r\ni=s.find('.')\r\nif s[i-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(s[i+1])<5:\r\n print(s[:i])\r\n else:\r\n print(int(s[:i])+1)", "s= input()\r\nint_part = s.split('.')[0]\r\nfrac_part = s.split('.')[1]\r\nif int(int_part) % 10 == 9:\r\n print('GOTO Vasilisa.')\r\nelif int(frac_part[0]) < 5:\r\n print(int(int_part))\r\nelse:\r\n print(int(int_part) + 1)", "from decimal import Decimal, getcontext\r\ngetcontext().prec = 1000\r\na=input()\r\nb=a.split('.');b[-1] = '0.'+b[-1]\r\nif b[0][-1] != \"9\":\r\n if Decimal(b[-1]) < Decimal(0.5):\r\n print(b[0])\r\n elif Decimal(b[-1]) >= Decimal(0.5):\r\n print(int(b[0])+1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "a,b=input().split('.')\r\n\r\nif a[len(a)-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelse :\r\n c=int(a)\r\n if int(b[0])>=5 :\r\n c+=1\r\n print(c)", "n=input()\r\nfor i in range(len(n)):\r\n if(n[i]=='.'):\r\n if(int(n[i-1])==9):\r\n print('GOTO Vasilisa.')\r\n break\r\n elif(int(n[i+1])>=5):\r\n s=int(n[:n.index(n[i])])+1\r\n print(s)\r\n break\r\n else:\r\n print(n[:n.index(n[i])])\r\n break\r\n", "s = input()\r\nx = s.find('.')\r\nif int(s[x - 1]) == 9: print(\"GOTO Vasilisa.\")\r\nelif int(s[x + 1]) < 5: print(s[0:x])\r\nelse: print(s[0:x - 1] + str(int(s[x - 1]) + 1))", "n=input()\r\ni=n.index('.')\r\nif(int(n[i-1])==9):print('GOTO Vasilisa.')\r\nelif(int(n[i+1])>=5):print(n[:i-1]+str(int(n[i-1])+1))\r\nelse:print(n[:i])\r\n", "a,b = input().split(\".\")\r\nif int(a[-1]) == 9:\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(b[0])>=5:\r\n print(int(a)+1)\r\n else:\r\n print(a)", "n = input()\r\na, b = n.split('.')\r\n\r\nif a[-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n print(a if int(b[0]) < 5 else int(a) + 1)", "number = input()\ndot = number.find('.')\n# if(dot==-1):\n# print(number)\n# exit()\n\nif (number[dot-1] == '9'):\n print('GOTO Vasilisa.')\nelif(number[dot+1] >= '5'):\n print(int(number[0:dot])+1)\nelse:\n print(number[0:dot])\n\t \t\t \t \t\t \t\t\t\t \t \t\t\t\t \t\t\t\t", "[print(\"GOTO Vasilisa.\" if i[-1]==\"9\" else i[:-1]+str(int(i[-1])+1) if int(j[0])>4 else i) for i,j in [input().split(\".\")]]", "i, j=map(str,input().split(\".\"))\r\nprint([\"GOTO Vasilisa.\", int(i)+(j[0]>'4')][i[-1]<'9'])\r\n", "s=input()\r\na=s.index(\".\")\r\nif s[a-1]!=\"9\":\r\n print(s[:a-1]+str(int(s[a-1])+1) if int(s[a+1])>=5 else s[:a])\r\nelse:print(\"GOTO Vasilisa.\")", "n=input()\r\nr=n.index('.')\r\nif n[r-1]=='9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if n[r+1]>='5':\r\n print(int(n[:r])+1)\r\n else:\r\n print(n[:r])", "s = input()\r\n\r\ns = s.split(\".\")\r\n\r\nger = s[0]\r\ndec = s[1]\r\ndec = dec[:1]\r\n\r\nif ger[len(ger)-1] != \"9\":\r\n if int(dec) < 5:\r\n print(ger)\r\n else:\r\n print(int(ger)+1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "def okruglenie(s):\r\n z = s.find('.')\r\n s1 = s[:z]\r\n if s1.endswith('9'):\r\n return \"GOTO Vasilisa.\"\r\n elif s1[len(s1) - 1] != '9' and int(s[z + 1:][0]) < 5:\r\n return int(s1)\r\n elif s1[len(s1) - 1] != '9' and int(s[z + 1:][0]) >= 5:\r\n return int(s1) + 1\r\n\r\n\r\nprint(okruglenie(input()))\r\n", "n= input()\r\nip, fp = n.split('.')\r\nl = ip[-1]\r\nif l!= '9':\r\n if int(fp[0]) < 5:\r\n print(ip)\r\n else:\r\n print(int(ip) + 1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "s=input()\nli=s.split('.')\nif(li[0][-1]=='9'):\n print(\"GOTO Vasilisa.\")\nelse:\n if(li[1]<'5'):\n print((int)(li[0]))\n else:\n print((int)(li[0])+1) \n\t\t \t\t\t \t\t\t\t \t \t\t\t \t \t\t\t\t \t \t", "def unclezazu(num):\r\n '''creates a normal rounding function'''\r\n decimal_location = str(num).find(\".\")\r\n int_base = int(num[:decimal_location])\r\n inty = str(int_base)\r\n tenth_place_val = num[decimal_location+1]\r\n if int(tenth_place_val) >= 5:\r\n zazu = int_base + 1\r\n else:\r\n zazu = int_base\r\n if inty[-1] == \"9\":\r\n zazu = \"GOTO Vasilisa.\"\r\n return zazu\r\n\r\n\r\nt = (input())\r\n\r\nprint(unclezazu(t))", "from functools import reduce\nfrom operator import \nfrom math import \nfrom sys import \nfrom string import \nfrom collections import \nsetrecursionlimit(10*7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\na,b=input().split('.')\nif a[-1]=='9':\n print(\"GOTO Vasilisa.\")\nelse:\n a=int(a)\n if ord(b[0])>=ord('5'):\n a+=1\n print(a)\n\n\n\n\n\n\n\n\n\n\n\n", "c, d = input().split('.')\r\nif int(c)%10 == 9:\r\n print('GOTO Vasilisa.')\r\nelif int(d[0]) > 4:\r\n print(int(c)+1)\r\nelse:\r\n print(int(c))\r\n", "# https://codeforces.com/problemset/problem/99/A\r\n\r\ninteger, fraction = input().strip().split('.')\r\ncheck,fraction = int(integer[-1]),int(fraction[0])\r\nif(check!=9):\r\n if(fraction<5):\r\n print(integer)\r\n else:\r\n print(int(integer)+1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "n=input()\r\nk=n.index('.')\r\nif n[k-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n p=int(n[k+1:k+2])\r\n if p>=5:\r\n print(int(n[0:k])+1)\r\n else:\r\n print(int(n[0:k]))", "n = input()\npos = n.index('.')\nif(n[pos-1] == '9'):\n\tprint(\"GOTO Vasilisa.\")\nelse:\n\tif(n[pos+1]<'5'):\n\t\tprint(n[:pos])\n\telse:\n\t\tprint(n[:pos-1], end='')\n\t\tprint(int(n[pos-1])+1)\n\t \t \t\t\t\t\t \t\t \t\t\t \t \t \t\t", "s = input().split('.')\r\nn = len(s[0])\r\nif s[0][n-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n s0 = int(s[0])\r\n if s[1][0] > '4':\r\n s0 += 1\r\n print(s0)\r\n", "n = input()\nind = n.index(\".\") - 1\nif n[ind] == '9':\n print('GOTO Vasilisa.')\nelse:\n f = float(n[ind+1:])\n ans = 0\n if n[ind + 2] == '5':\n ans = 1\n else:\n ans = round(f)\n nums = 0\n for i in range(0, ind+1):\n r = int(n[i])\n nums = nums10 + r\n\n nums += ans\n stri = ''\n if not nums:\n print(0)\n else:\n while nums:\n r = nums%10\n stri += str(r)\n nums //= 10\n print(stri[::-1])\n\t \t \t \t\t \t\t\t \t \t \t\t\t", "st, nd = input().split('.')\r\nprint('GOTO Vasilisa.' if st[-1] == '9' else (st if nd[0] < '5' else int(st) + 1))", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nn=input(\"\").split('.')\nif n[0][-1]=='9':\n print(\"GOTO Vasilisa.\")\nelse:\n if n[1][0]>='5':\n print(int(n[0])+1)\n else :\n print(n[0])", "line = input()\r\nseparator = line.find('.')\r\nintegerPart = line[:separator]\r\nif integerPart[-1] == '9':\r\n integerPart = \"GOTO Vasilisa.\"\r\nelif line[separator + 1] >= '5':\r\n integerPart = str(int(integerPart) + 1)\r\nprint(integerPart)\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Dec 15 16:40:29 2020\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\n\r\ndef number(string):\r\n for i in range(len(string)):\r\n if string[i]=='.':\r\n if string[i-1]=='9':\r\n return 'GOTO Vasilisa.'\r\n elif int(string[i+1])<5:\r\n return string[:i]\r\n elif int(string[i+1])>=5:\r\n return str(int(string[:i])+1)\r\nstring=input()\r\nprint(number(string))\r\n ", "import math\r\ns = input()\r\nd = s.index('.')\r\nif s[d - 1] == '9':\r\n print('GOTO Vasilisa.')\r\nelif int(s[d + 1]) < 5:\r\n print(s[:d])\r\nelse:\r\n print(s[:d - 1] + str(int(s[d - 1]) + 1))\r\n", "a,b = str(input()).split('.')\r\n\r\nif (a[-1] == '9'):\r\n print (\"GOTO Vasilisa.\")\r\nelif (int(b[0]) < 5):\r\n print (a)\r\nelif (int(b[0]) >= 5):\r\n t = int(a[-1])\r\n print (a[:-1]+str(t+1))", "import os\r\nfrom math import\r\n\r\ns=input()\r\ns=list(s)\r\npos=s.index(\".\")-1\r\nif s[pos]==\"9\":\r\n\tprint(\"GOTO Vasilisa.\")\r\nelse:\r\n\tif int(s[pos+2])<5:\r\n\t\tfor i in range(pos+1):\r\n\t\t\tprint(s[i],end='')\r\n\telse:\r\n\t\tfor i in range(pos):\r\n\t\t\tprint(s[i],end='')\r\n\t\tprint(int(s[pos])+1)\r\n\r\n", "def main():\n numero = input().split(\".\")\n inteiro = numero[0]\n decimal = numero[1]\n\n if(inteiro[len(inteiro)-1] == '9'):\n print(\"GOTO Vasilisa.\")\n else:\n if(int(decimal[0]) >= 5):\n print(int(inteiro)+1)\n else:\n print(inteiro)\n\nif __name__ == '__main__':\n main()\n\t\t \t \t\t \t \t\t \t \t", "a, b = input().split('.')\r\n\r\nif a[-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelif int(b[0]) >= 5:\r\n s = a[:-1]\r\n s += chr(ord(a[-1]) + 1)\r\n print(s)\r\nelse:\r\n print(a)", "num = input()\nfor i in range(len(num)):\n\tif num[i] == '.': \n\t\tpoint = i\n\t\tbreak\nop = ''\nif num[point - 1] < '9':\n\tfor i in range(point - 1):\n\t\top += num[i]\n\tif num[point + 1] >= '5': op += str(int(num[point - 1]) + 1)\n\telse: op += num[point - 1]\nelse: op = 'GOTO Vasilisa.'\nprint(op)\n \t \t \t \t\t\t \t \t\t \t \t\t\t \t\t", "number = input(\"\")\nnumberparts = number.split(\".\")\nintpart = numberparts[0]\ndecimalpart = numberparts[1]\nif intpart[-1] == '9':\n print(\"GOTO Vasilisa.\")\nelif int(decimalpart[0]) >= 5:\n print(int(intpart)+1)\nelse:\n print(intpart)", "n = input()\r\not = 0\r\nif int(n[n.find(\".\")-1]) == 9:\r\n ot = \"GOTO Vasilisa.\"\r\nelif int(n[n.find(\".\")+1]) + 5 >= 10:\r\n ot = int(n[:n.find(\".\")])+1\r\nelse:\r\n ot = n[:n.find(\".\")]\r\n\r\nprint(ot)", "t=list(input())\r\ns=t.index('.')\r\n\r\nif(t[s-1]=='9'):\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if(t[s+1]>='5'):\r\n for i in range(0,s-1):\r\n print(t[i],end=\"\")\r\n e=int(t[s-1])+1\r\n print(e)\r\n \r\n else:\r\n for i in range(0,s):\r\n print(t[i],end=\"\")", "number = input()\r\ni, f = number.split('.')\r\nif i[-1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(f[0]) >= 5:\r\n i = str(int(i) + 1)\r\n print(i)# 1689258086.4452024", "t = input()\r\nk = t.find('.')\r\nif k < 0: print(int(t))\r\nelif t[k - 1] == '9': print('GOTO Vasilisa.')\r\nelse: print(int(t[:k]) + int(t[k + 1] > '4'))", "n = input()\r\nfor i in range(len(n)):\r\n if n[i] == \".\":\r\n if n[i-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\n elif int(n[i+1]) < 5:\r\n print(n[:i])\r\n else:\r\n print( n[:i-1] + str( int(n[i-1])+1) ) ", "import math\r\nn = input()\r\ni=n.find(\".\")\r\ns = n[:i]\r\nif s[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelif n[i+1]>=\"5\":\r\n print(int(s)+1)\r\nelse:\r\n print(int(s))\r\n ", "l = input().split('.')\nif l[0][-1] == '9':\n print('GOTO Vasilisa.')\nelse:\n if(l[1][0] >= '5'):\n print(int(l[0])+1)\n else:\n print(int(l[0]))\n", "a=input().split('.')\r\nif a[0][-1]=='9':print('GOTO Vasilisa.')\r\nelse:print(int(a[0])+int(a[1][0]in'56789'))", "a = list(map(str,input().strip()))\nlists =[\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\"]\nb=int(len(a))\nc=0\nfor i in range(b):\n if a[i] == \".\":\n c = i\n#print(c)\nd=a[:c]\nif a[c-1]==\"9\":\n print(\"GOTO Vasilisa.\")\nelif a[c+1]>=\"5\":\n temp = lists.index(a[c-1])\n a[c-1]=lists[temp+1]\n d = a[:c]\n print(\"\".join(map(str,d)))\nelif a[c+1]<\"5\":\n print(\"\".join(map(str,d)))\n \t \t \t\t \t\t\t\t\t\t\t\t", "f = input().split('.')\r\nprint('GOTO Vasilisa.'if f[0][-1] == '9' else int(f[0]) + 1 if int(f[-1][0]) > 4 else int(f[0]))", "a = input()\nb = 0\nif \".\" in a:x = a.index(\".\")\nb = a[:x]\nc = a[x + 1]\nif b[-1] == \"9\":print(\"GOTO Vasilisa.\")\nelse:\n\tif int(c) < 5:print(b)\n\telse:print(int(b) + 1)\n", "number = input()\ninteger, decimal = number.split('.')\nif int(integer) % 10 == 9:\n print('GOTO Vasilisa.')\nelse:\n if int(decimal[0]) >= 5:\n print(int(integer) + 1)\n else:\n print(int(integer))", "\r\n\r\ns = input()\r\nnuqta = s.index(\".\")\r\nbutun_qism = int(s[0:nuqta])\r\nkasr_qism = int(s[nuqta+1:])\r\nif(butun_qism%10 == 9):\r\n\tprint(\"GOTO Vasilisa.\")\r\nelse:\r\n\tif(int(s[nuqta+1]) >= 5):\r\n\t\tprint(butun_qism+1)\r\n\telse:\r\n\t\tprint(butun_qism)\r\n", "s=input()\r\ni=s.find(\".\")\r\nif s[i-1]!=\"9\":\r\n\t\tprint(int(s[:i])if int(s[i+1])<5 else int(s[:i])+1)\r\nelse:\r\n\tprint(\"GOTO Vasilisa.\")", "num = list(input())\n\ni_dot = num.index(\".\")\n\nif int(num[i_dot - 1]) == 9:\n\tprint(\"GOTO Vasilisa.\")\nelse:\n\tif int(num[i_dot + 1]) >= 5:\n\t\tnum[i_dot-1] = str(int(num[i_dot-1]) + 1)\n\tprint(\"\".join(num[:i_dot]))\n\t\n\t \t \t \t\t\t \t\t\t \t\t\t\t \t \t\t\t\t\t", "x, y = map(str, input(). split(\".\"))\r\nif x[-1] == \"9\" or x == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelif int(y[0]) < 5:\r\n print(int(x))\r\nelse:\r\n print(int(x)+1)\r\n", "a,b=input().split(\".\")\r\nif(a[-1]=='9'):print(\"GOTO Vasilisa.\")\r\nelif(b[0]>'4'):print(int(a)+1)\r\nelse:print(a)\r\n", "n = input().split('.')\r\n\r\ncel, drob = n[0], n[1]\r\n\r\nif cel[-1] == '9': print('GOTO Vasilisa.')\r\nelif drob[0] < '5': print(cel)\r\nelse: print(int(cel)+1)", "s = input().split('.')\r\nif s[0][-1] == '9':\r\n\tprint(\"GOTO Vasilisa.\")\r\n\r\nelif int(s[1][0]) < 5:\r\n\tprint (int(s[0]))\r\n\r\nelse:\r\n\tprint(int(s[0])+1)\r\n", "a = input()\r\nindx = a.index('.')\r\nif a[indx-1] == '9':\r\n print('GOTO Vasilisa.')\r\nif a[indx-1] != '9':\r\n iq = a[indx + 1]\r\n iq = int(iq)\r\n if iq < 5:\r\n print(a[:indx])\r\n else:\r\n aq = int(a[:indx])\r\n print(aq + 1)", "num=input()\nspl_lst=num.split(\".\")\nif(int(spl_lst[0][-1])!=9):\n if(int(spl_lst[1][0])<5):\n print(int(spl_lst[0]))\n else:\n print(int(spl_lst[0])+1)\nelse:\n print(\"GOTO Vasilisa.\")\n \t \t\t \t\t\t\t \t \t \t\t\t\t\t\t\t \t", "number = input()\ninteger, fractional = list(str(num) for num in number.split(\".\"))\n\nfinal_answer = int(integer)\nif integer[-1] != \"9\":\n if int(fractional[0]) >= 5:\n final_answer = final_answer + 1\nelse:\n final_answer = \"GOTO Vasilisa.\"\n\nprint(final_answer)\n\t \t\t\t\t \t\t \t \t\t \t \t \t \t \t", "n = input().split('.')\n\nif n[0][-1] == '9':\n print('GOTO Vasilisa.')\nelif int(n[1][0]) <= 4:\n print(int(n[0]))\nelse:\n print(int(n[0])+1)\n \t \t \t\t \t\t \t\t\t\t\t \t\t\t\t\t\t", "S=input()\r\nif S[S.index(\".\")-1]==\"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(S[S.index(\".\")+1])<=4:\r\n print(S[:S.index(\".\")])\r\n else:\r\n print(S[:S.index(\".\")-1]+str(int(S[S.index(\".\")-1])+1))\r\n", "n, f = input().split('.')\r\nprint( n[-1] == '9' and 'GOTO Vasilisa.' or (n[:-1], int(n[-1]) + int(f[0] >= '5')), sep='')\r\n", "s = input()\r\nif s[s.index(\".\")-1] == '9': print(\"GOTO Vasilisa.\")\r\nelse:\r\n\tif int(s[s.index(\".\")+1]) < 5:\r\n\t\tprint(s[:s.index(\".\")])\r\n\telse:\r\n\t\tprint(int(s[:s.index(\".\")])+1)", "if __name__ == '__main__':\n a, b = input().split(\".\")\n\n if a[-1] == '9':\n print('GOTO Vasilisa.')\n elif b[0] > '4':\n print(int(a) + 1)\n else:\n print(int(a))\n\n\t\t \t \t \t \t\t \t\t\t\t \t", "i, f = input().split('.')\r\nif i[-1] != '9':\r\n if f[0] >= '5':\r\n print(i[:-1], chr(ord(i[-1]) + 1), sep='')\r\n else:\r\n print(i)\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "s, x = input().split('.')\nx = int(x[0])\nif s[-1] == '9':\n print('GOTO Vasilisa.')\nelse:\n if x < 5:\n print(int(s))\n else:\n print(int(s) + 1)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input().rstrip())\r\ni = s.index(\".\")\r\nif s[i - 1] == \"9\":\r\n ans = \"GOTO Vasilisa.\"\r\nelse:\r\n ans = s[:i]\r\n if int(s[i + 1]) >= 5:\r\n ans[-1] = str(int(ans[-1]) + 1)\r\n ans = \"\".join(ans)\r\nprint(ans)", "n = input()\nindex = 0\nn_1 = ''\npoint = 0\nfor i in n:\n if i != '.':\n index += 1\n continue\n else:\n n_1 = n[:index]\n temp= n[index + 1:]\n point = int(temp[0])\n break\nif n_1[-1] == '9':\n print(\"GOTO Vasilisa.\")\nelse:\n n_2 = n_1[:-1]\n calculate = int(n_1[-1])\n if point <= 4:\n print(n_2 + str(calculate))\n else:\n print(n_2 + str(calculate + 1))\n#1111\n#111\n\n \t\t \t\t \t \t\t\t\t\t \t \t \t\t\t", "n=input()\r\ni,d=n.split(\".\")\r\nif i[-1]==\"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(d[0])<5:\r\n print(i)\r\n else:\r\n print(int(i)+1)", "def main(d):\r\n n = d.find('.')\r\n if int(d[n+1]) < 5 and int(d[n-1]) != 9:\r\n return int(d[:d.find('.')])\r\n elif int(d[n-1]) != 9:\r\n return int(d[:d.find('.')]) + 1\r\n else:\r\n return \"GOTO Vasilisa.\"\r\n \r\nprint(main(input()))\r\n", "a=list(input())\r\ni=len(a)-1\r\nwhile i>=0:\r\n if a[i]=='.':\r\n if a[i+1]<'5' and a[i-1]!='9':\r\n for j in range(i):\r\n print(a[j],end=\"\")\r\n elif a[i+1]>='5' and a[i-1]!='9':\r\n n=0\r\n for j in range(i):\r\n n=n10\r\n n=n+int(a[j])\r\n print(n+1)\r\n else:\r\n print(\"GOTO Vasilisa.\")\r\n i-=1\r\n\r\n", "num = input().strip()\r\ninteger_part, decimal_part = num.split(\".\")\r\nif integer_part[-1] != \"9\":\r\n if int(decimal_part[0]) < 5:\r\n rounded_num = integer_part\r\n else:\r\n rounded_num = str(int(integer_part) + 1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")\r\n exit()\r\nprint(int(rounded_num))\r\n", "k=str(input())\ni=0\ns=\"\"\nwhile (i!=len(k)-1):\n\tif (k[i+1]=='.'):\n\t\tif (int(k[i])==9):\n\t\t\tprint (\"GOTO Vasilisa.\")\n\t\t\tbreak\n\t\telse:\n\t\t\tif (int(k[i+2])>=5):\n\t\t\t\ts+=(str(int(k[i])+1))\n\t\t\telse:\n\t\t\t\ts+=k[i]\n\t\t\tprint (s)\n\t\t\tbreak\n\telse:\n\t\ts+=k[i]\n\ti+=1\n\t\n\n\n", "s=input()\r\nind=s.index('.')\r\ns1=s[0:ind]\r\ns2=s[ind:]\r\nif(s1[-1]=='9'):\r\n print('GOTO Vasilisa.')\r\nelif(s1[-1]!='9' and float(s2[0:2])>=0.5):\r\n print(int(s1)+1)\r\nelse:\r\n print(int(s1))", "n, mod = input().split('.')\r\n\r\nif n[-1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelif int(mod[0]) < 5:\r\n print(n)\r\nelse:\r\n print(n[:-1] + str(int(n[-1])+1))\r\n", "inteira, fracionaria = input().split('.')\n\nif inteira[-1] == '9':\n print('GOTO Vasilisa.')\nelse:\n if int(fracionaria[0]) < 5:\n print(inteira)\n else:\n print(int(inteira) + 1)\n \t\t \t \t \t\t\t \t \t\t \t \t", "s = input()\n(integer, fraction) = s.split('.')\nif int(integer[-1]) != 9 and int(fraction[0]) < 5:\n print(integer)\nelif int(integer[-1]) != 9 and int(fraction[0]) >= 5:\n print(int(integer)+1)\nelse:\n print(\"GOTO Vasilisa.\")\n", "a,b=input().split('.')\r\nif int(a)%10==9:\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if int(b[0])>4:\r\n print(int(a)+1)\r\n else:\r\n print(a)", "# https://codeforces.com/problemset/problem/99/A# https://codeforces.com/problemset/problem/99/A\r\n\r\ninteger, decimal = input().split(\".\")\r\n\r\nif int(integer[-1]) % 10 == 9:\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(decimal[0]) >= 5:\r\n print(int(integer)+1)\r\n else:\r\n print(int(integer))", "a,b = input().split('.')\na = int(a)\nif len(b)>3:\n b = b[:3]\nb = round(float('1.'+b))-1\nif a%10 is 9:\n print('GOTO Vasilisa.')\nelse:\n print(a+b)\n\t \t\t\t \t \t \t \t\t\t\t\t \t \t \t\t", "n = input()\r\nt = n.find('.')\r\nt-=1\r\nif n[t] != '9':\r\n h = ''\r\n h2 = ''\r\n for i in range(len(n)):\r\n if int(n[t + 2]) >= 5:\r\n h += n[i]\r\n if n[i] == '.':\r\n break\r\n else:\r\n h2 += n[i]\r\n if n[i+1] == '.':\r\n break\r\n\r\n if int(n[t + 2]) >= 5:\r\n print(int(h.replace('.', ''))+1)\r\n else:\r\n h2.replace('.', '')\r\n print(h2)\r\nelse:\r\n print('GOTO Vasilisa.')\r\n", "n = input()\npoint = n.index('.')\nstr = ''\nif n[point - 1] == '9': print('GOTO Vasilisa.')\nelse:\n for i in range(point): str += n[i]\n if n[point + 1] < '5': print(str)\n else: print(int(str) + 1)\n \t\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\na,b=input().split('.')\r\nif a[-1]<'9':\r\n\tif b[0]<='4':\r\n\t\tprint(int(a))\r\n\telse:\r\n\t\tprint(int(a)+1)\r\nelse:\t\t\t\r\n\tprint('GOTO Vasilisa.')", "import math\r\nfrom fractions import Fraction as frac\r\n\r\nMOD = 1e9 + 7\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\ndef lcm(a, b):\r\n return a b // gcd(a, b)\r\n\r\ndef no():\r\n print(\"NO\")\r\n return\r\n\r\ndef yes():\r\n print(\"YES\")\r\n return\r\n\r\ndef solve(case_no):\r\n s = str(input())\r\n sl = len(s)\r\n for i in range(sl):\r\n if s[i] == '.':\r\n if s[i - 1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\n else:\r\n ans = int(s[:i])\r\n if ord(s[i + 1]) >= ord('5'):\r\n ans += 1\r\n print(ans)\r\n\r\nt = 1\r\n# t = int(input())\r\nfor i in range(1, t + 1):\r\n solve(i)\r\n", "num = input()\npoint = num.index('.')\nif num[point - 1] == '9': print('GOTO Vasilisa.')\nelse:\n if num[point + 1] < '5': print(num[0: point])\n else: print(int(num[0: point]) + 1)\n \t\t\t \t\t \t \t \t \t \t \t\t \t", "n=list(map(str,input().split(\".\")))\r\nif(int(n[0])%10!=9):\r\n if(int(n[1][0])>=5):\r\n print(int(n[0])+1)\r\n else:\r\n print(int(n[0]))\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "s = input()\r\na = \"\"\r\nb = \"0.\"\r\nc = 0\r\nfor i in range(len(s)):\r\n\tif s[i]==\".\":\r\n\t\ta = s[0:i]\r\n\t\tb += s[i+1]\t\t\t\t\r\nif a[-1]==\"9\":\r\n\tprint(\"GOTO Vasilisa.\")\r\nelif a[-1]!=\"9\" and float(b)>=0.5:\r\n\tc = int(a[-1])+1\r\n\tprint(a[0:len(a)-1]+str(c))\r\nelif a[-1]!=\"9\" and float(b)<0.5:\r\n\tprint(a[0:len(a)+1])\t\r\n", "s=input()\r\nz=s.index(\".\")\r\nif s[z-1]==\"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse :\r\n if int(s[z+1])<5:\r\n print(int(s[:z]))\r\n else :\r\n print(int(s[:z])+1)", "n = str(input())\n\n\ndef find_left_part(n: str) -> str:\n sp = n.split('.')\n return sp[0]\n\n\ndef find_right_part(n: str) -> str:\n sp = n.split('.')\n return sp[1]\n\n\ndef solve(n: str):\n left_part = int(find_left_part(n))\n right_part = find_right_part(n)\n\n is_last_9 = left_part % 10 == 9\n first_right = right_part[0]\n if not is_last_9 and first_right < '5':\n return left_part\n\n if not is_last_9 and first_right >= '5':\n return left_part + 1\n\n if is_last_9:\n return \"GOTO Vasilisa.\"\n\n\nprint(solve(n))\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = input().rstrip()\r\nidx = n.index('.')\r\nif n[idx - 1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(n[idx + 1]) < 5:\r\n print(n[:idx])\r\n else:\r\n print(int(n[:idx]) + 1)", "t,x=input().split(\".\")\nif t[-1]=='9':\n print(\"GOTO Vasilisa.\")\nelif int(x[0])<5:\n print(t)\nelif int(x[0])>=5:\n print(int(t)+1)\n \t \t \t \t \t \t \t\t\t \t", "n = input().strip()\r\nint_part, decimal_part = n.split('.')\r\nif int_part[-1] != '9':\r\n if int(decimal_part[0]) < 5:\r\n print(int_part)\r\n else:\r\n print(int(int_part) + 1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "n=input()\r\nn=n.split(\".\")\r\nt=list(n[0])\r\nk=list(n[1])\r\nm=int(k[0])\r\nif t[len(t)-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelif t[len(t)-1]!=\"9\" and m<5:\r\n t=\"\".join(t)\r\n print(t)\r\nelse:\r\n t=\"\".join(t)\r\n t=str(int(t)+1)\r\n print(t)", "def main():\n parts = input().split('.')\n\n if parts[0][len(parts[0]) - 1] == '9':\n print('GOTO Vasilisa.')\n else:\n if parts[1][0] not in '01234':\n add_1 = {'0': '1', '1': '2', '2': '3', '3': '4', '4': '5', '5': '6', '6': '7', '7': '8', '8': '9'}\n last_index = len(parts[0]) - 1\n parts[0] = parts[0][:last_index] + add_1[parts[0][last_index]]\n\n print(parts[0])\n\n\nif __name__ == '__main__':\n main()\n", "m,n= input().split(\".\")\r\nif m[-1]==\"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n l=n[0]>\"4\"\r\n print(int(m)+l)", "barrel=list(input().strip().split('.'))\r\ninteger=barrel[0]\r\ndecimal=barrel[1]\r\nn=len(integer)\r\nif(int(integer[n-1])<9):\r\n if(int(decimal[0])>=5):\r\n print(int(integer)+1)\r\n else:\r\n print(int(integer))\r\nelse:\r\n print('GOTO Vasilisa.')", "s=list(input());r=s.index('.')\r\nif s[r-1]=='9':print('GOTO Vasilisa.')\r\nelse:\r\n if s[r+1]>='5':s[r-1]=str(int(s[r-1])+1)\r\n print(''.join(s[:r]))", "n = input()\r\n\r\n\r\ndef okr(p):\r\n z = p.find('.')\r\n x = p[z - 1]\r\n if x != '9':\r\n return int(p[z + 1])\r\n else:\r\n return 'V'\r\n\r\n\r\nif okr(n) == 'V':\r\n print('GOTO Vasilisa.')\r\nelif okr(n) < 5:\r\n print(n[:n.find('.')])\r\nelif okr(n) >= 5:\r\n print(n[:n.find('.') - 1] + str(int(n[n.find('.') - 1]) + 1))\r\n", "beforepoint_part, afterpoint_part = input().split(\".\")\r\nlast_digit = int(beforepoint_part[-1])\r\nif last_digit == 9:\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(afterpoint_part[0]) < 5:\r\n print(beforepoint_part)\r\n else:\r\n print(int(beforepoint_part) + 1)\r\n", "import sys\r\n\r\nx, y = (el for el in input().split('.'))\r\n\r\nif x[-1] != '9':\r\n if y < '5':\r\n print(x)\r\n sys.exit()\r\n else:\r\n print(int(x) + 1)\r\n sys.exit()\r\nelse:\r\n print(\"GOTO Vasilisa.\")\r\n ", "num = input()\npoint = num.index('.')\nstr = ''\nif num[point - 1] == '9': print('GOTO Vasilisa.')\nelse:\n for i in range(point): str += num[i]\n if num[point + 1] < '5': print(str)\n else: print(int(str) + 1)\n \t \t \t\t\t\t \t\t \t \t \t\t", "num = input()\r\n\r\nnindex = num.index(\".\")\r\n\r\nif num[nindex - 1] != \"9\":\r\n if int(num[nindex + 1]) <= 4:\r\n numsubstr = num[nindex:-1] + num[-1]\r\n decimalnum = num.replace(numsubstr, \"\")\r\n print(int(decimalnum))\r\n elif int(num[nindex + 1]) >= 5:\r\n numsubstr = num[nindex:-1] + num[-1]\r\n decimalnum = num.replace(numsubstr, \"\")\r\n print(int(decimalnum) + 1)\r\n\r\nelse:\r\n print(\"GOTO Vasilisa.\")\r\n", "from decimal import \r\ngetcontext().prec=1000\r\na=input()\r\nx=a.split('.')[0][-1]\r\nprint([int(Decimal(a)+Decimal(0.5)),'GOTO Vasilisa.'][x=='9'])", "n = input()\r\nidx = n.index('.')\r\n\r\nif n[idx-1] == '9': print(\"GOTO Vasilisa.\")\r\nelse:\r\n if n[idx+1] < '5': print(n[:idx])\r\n else: print(int(n[:idx]) + 1) ", "n = input()\r\n\r\nans = \"\"\r\ncapture_next = False\r\nfor char in n:\r\n if char == \".\":\r\n capture_next = True\r\n\r\n elif capture_next:\r\n last_digit = char\r\n break\r\n\r\n else:\r\n ans += char\r\n\r\nif ans[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(last_digit) < 5:\r\n print(ans)\r\n\r\n else:\r\n s = ans[:-1] + str(int(ans[-1]) +1)\r\n\r\n print(s)\r\n\r\n\r\n\r\n\r\n", "s=str(input())\ns1=\"\"\ns2=\"\"\np=0\nflag=0\nsum=0\nfor i in range(0,len(s),1):\n if(s[i]!='.'):\n s1+=s[i]\n if(s[i]=='.'):\n p=i\n break\n\n \nfor i in range(p+1,len(s),1):\n s2+=s[i]\n\nif(int(s2[0])<5 and int(s1[len(s1)-1])!=9):\n print(s1)\nelif(int(s2[0])>=5 and int(s1[len(s1)-1])!=9):\n print(int(s1)+1)\nelif(int(s1[len(s1)-1])==9):\n print(\"GOTO Vasilisa.\")\n \n\n\t\t\t \t \t\t\t \t\t \t\t \t \t \t \t \t", "s=input().split('.')\r\nif s[0][-1]!='9':\r\n if s[1][0]<'5':print(s[0])\r\n else:print(int(s[0])+1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "##def common(sa):\r\n## return max(set(sa), key=sa.count)\r\n##\r\n##sa = int(input())\r\n##cups = [int(input()) for x in range(sa)]\r\n##if len(set(cups))==1:\r\n## print(\"Exemplary pages.\")\r\n##elif sa==2:\r\n## a = cups[0]\r\n## b = cups[1]\r\n## if a==b:\r\n## print(\"Exemplary pages.\")\r\n## else: \r\n## if (a+b)%2==1:\r\n## print(\"Unrecoverable configuration.\")\r\n## else:\r\n## if a>=b:\r\n## num = int(abs((b-a)/2))\r\n## print(str(num)+' ml. from cup #2 to cup #1.')\r\n## else:\r\n## num = int(abs((b-a)/2))\r\n## print(str(num)+' ml. from cup #1 to cup #2.')\r\n##\r\n##elif sa==3:\r\n## a=cups[0]\r\n## b=cups[1]\r\n## c=cups[2]\r\n##\r\n## if a==b==c:\r\n## print(\"Exemplary pages.\")\r\n## elif a==b or b==c or a==c:\r\n## print(\"Unrecoverable configuration.\")\r\n## else:\r\n## if a <= b <= c:\r\n## if b == int((a+c)/2):\r\n## diff = int(abs(b-a))\r\n## print(str(diff)+' ml. from cup #1 to cup #3.')\r\n## else:\r\n## print('Unrecoverable configuration.')\r\n## \r\n## elif a<=c<=b:\r\n## a, b, c = a, c, b\r\n## if b == int((a+c)/2):\r\n## diff = int(abs(b-a))\r\n## print(str(diff)+' ml. from cup #1 to cup #2.')\r\n## else:\r\n## print('Unrecoverable configuration.')\r\n##\r\n## elif b <= c <=a:\r\n## a, b, c = b, c, a\r\n## if b == int((a+c)/2):\r\n## diff = int(abs(b-a))\r\n## print(str(diff)+' ml. from cup #2 to cup #1.')\r\n## else:\r\n## print('Unrecoverable configuration.')\r\n## elif b <= a <=c:\r\n## a, b, c = b, a, c\r\n## if b == int((a+c)/2):\r\n## diff = int(abs(b-a))\r\n## print(str(diff)+' ml. from cup #2 to cup #3.')\r\n## else:\r\n## print('Unrecoverable configuration.')\r\n## elif c <= a <=b:\r\n## a, b, c = c, a, b\r\n## if b == int((a+c)/2):\r\n## diff = int(abs(b-a))\r\n## print(str(diff)+' ml. from cup #3 to cup #2.')\r\n## else:\r\n## print('Unrecoverable configuration.')\r\n## elif c<=b<=a:\r\n## a, b, c = c, b, a\r\n## if b == int((a+c)/2):\r\n## diff = int(abs(b-a))\r\n## print(str(diff)+' ml. from cup #3 to cup #1.')\r\n## else:\r\n## print('Unrecoverable configuration.')\r\n##\r\n##else:\r\n## best = common(cups)\r\n## sa2 = [x-best for x in cups]\r\n## indices=[]\r\n## difflist = []\r\n## for x in range(len(sa2)):\r\n## if sa2[x] != 0:\r\n## indices.append(x)\r\n## difflist.append(sa2[x])\r\n## \r\n## if len(difflist) != 2:\r\n## print(\"Unrecoverable configuration.\")\r\n## \r\n## else:\r\n## if (difflist[0]+difflist[1])%2!=0:\r\n## print(\"Unrecoverable configuration.\")\r\n## else:\r\n## if difflist[0] > 0:\r\n## print(str(abs(difflist[0]))+' ml. from cup #' + str(indices[1]+1)+' to cup #'+str(indices[0]+1)+'.')\r\n## else:\r\n## print(str(abs(difflist[1]))+' ml. from cup #' + str(indices[0]+1)+' to cup #'+str(indices[1]+1)+'.')\r\n\r\na, b = map(str, input().split('.'))\r\nif int(a)%10 == 9:\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(str(b)[0])<5:\r\n print(a)\r\n else:\r\n print(int(a)+1)\r\n", "line = input()\r\nline = line.split('.')\r\na = int(line[0])\r\nb = (line[1])\r\nif(a%10==9):\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if b[0] >='5':\r\n a+=1\r\n print(a)", "a = input()\r\nt = a.split(\".\")[0]\r\ntt = int(a.split(\".\")[1][0])\r\nif t[len(t)-1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n t = int(t)\r\n if tt >= 5:\r\n t+=1\r\n print(t)", "s, fl, so = input(), '', \"\"\r\nfor x in range(len(s)):\r\n if s[x] == '.':\r\n fl = s[x + 1]\r\n break\r\n so += s[x]\r\nif so[len(so) - 1] == '9': print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(fl) >= 5: print(int(so) + 1)\r\n else: print(so)", "s = input()\n\ni = 0\nwhile s[i] != \".\":\n i += 1\n\nt = int(s[:i])\nif s[i-1] == \"9\":\n print(\"GOTO Vasilisa.\")\n exit(0)\nelif s[i+1] >= \"5\":\n t += 1\n\nprint(t)\n", "import math\nx= input()\ni,j = x.split(\".\")\nif i[-1] =='9':\n\tprint(\"GOTO Vasilisa.\")\nelse:\n\tif int(j[0])<5:\n\t\tprint(int(i))\n\telse:\n\t\tprint(int(i)+1)\n\t\t\n", "integer, fractional = input().split(\".\")\nfractional = fractional[:2]\n\nif integer[-1] == \"9\":\n print(\"GOTO Vasilisa.\")\nelse:\n if fractional[0] >= \"5\":\n print(int(integer) + 1)\n else:\n print(integer)\n", "n = input()\r\n\r\na = n.index('.')\r\nb = int(n[:a])\r\nc = int(n[a + 1])\r\n\r\nif n[a - 1] == '9':\r\n print('GOTO Vasilisa.')\r\nelif c <= 4:\r\n print(b)\r\nelse:\r\n print(b + 1)\r\n\r\n", "a = str(input())\nfor i in range(len(a)):\n if a[i] ==\".\":\n if a[i-1] == \"9\":\n print(\"GOTO Vasilisa.\")\n break\n else:\n if int(a[i+1]) >= 5:\n a = a[0:i]\n a = int(a) + 1\n print(a)\n break\n else:\n a = a[0:i]\n a = int(a)\n print(a)\n break\n else:\n continue\n \t \t\t\t\t \t\t \t \t\t\t", "#Davidson Lisboa Della Piazza, 169786\n\nimport math\n\nx = input()\nx = list(x)\nflag = 0\ndecdigs = []\nintdigs = []\nfor i in range(len(x)):\n if(x[i]=='.'):\n flag = 1\n if(flag==0):\n intdigs.append(x[i])\n elif(x[i]!='.'):\n decdigs.append(x[i])\n\nfive = '5'\ndec = ''\nfor i in decdigs:\n dec= dec+i\n five = five+'0'\ndec = int(dec)\nfive = int(five[:-1])\n\ninte = ''\nfor i in intdigs:\n inte = inte+i\ninte = int(inte)\n\nif(intdigs[-1]!='9'):\n if(dec<five):\n print(inte)\n else:\n print(inte+1)\nelse:\n print(\"GOTO Vasilisa.\")\n \t\t \t \t \t\t \t \t\t\t \t \t\t\t", "n,d = input().split('.')\r\n\r\nif (int(n[-1]) == 9):\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if (int(d[0]) >= 5):\r\n print(str(int(n) + 1))\r\n else:\r\n print(n)", "import math\r\nN=input()\r\ni=N.index(\".\")\r\nx=N[i-1]\r\n \r\nif(x==\"9\"):\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if(int(N[i+1])<5):\r\n print(N[:i])\r\n else:\r\n print(N[:i-1]+str(int(x)+1))", "int_part, fract_part = input().split('.')\r\n\r\nif int_part[-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n print(int_part if int(fract_part[0]) < 5 else int(int_part) + 1)", "a = (input())\r\nb = a.index(\".\")\r\nc = 0\r\nif int(a[b-1])!=9 and int((a[b+1]))<5:\r\n print(int(a[:b]))\r\nelif int(a[b-1])!=9 and int((a[b+1]))>=5:\r\n print(int(a[:b])+1)\r\nelif int(a[b-1])==9:\r\n print(\"GOTO Vasilisa.\")", "i,d = input().split('.')\r\nif i[-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelif int(d[0])<5:\r\n print(i)\r\nelse:\r\n print(int(i)+1)\r\n", "from math import ceil\r\n\r\n\r\ndef solve():\r\n x = input()\r\n s = x.split(\".\")\r\n if not s[0].endswith(\"9\"):\r\n d = s[-1]\r\n if int(d[0]) >= 5:\r\n print(f\"{s[0][:-1]}{int(s[0][-1]) + 1}\")\r\n else:\r\n print(s[0])\r\n else:\r\n print(\"GOTO Vasilisa.\")\r\n\r\n\r\n\r\nfor _ in range(1):\r\n solve()", "a, b=map(str,input().split(\".\"))\r\nprint([\"GOTO Vasilisa.\", int(a)+(b[0]>'4')][a[-1]<'9']);\r\n", "s = input()\r\nif s[s.index(\".\")-1]!=\"9\" and int(s[s.index(\".\")+1])>=5:\r\n\tprint(int(s[:s.index(\".\")])+1)\r\nelif s[s.index(\".\")-1]!=\"9\" and int(s[s.index(\".\")+1])<5:\r\n\tprint(int(s[:s.index(\".\")]))\r\nelse:\r\n\tprint(\"GOTO Vasilisa.\")", "i,f=input().split('.')\r\nif int(i[-1])!=9:\r\n if int(f[0])>=5:\r\n print(int(i)+1)\r\n else:\r\n print(i)\r\nelse:\r\n print('GOTO Vasilisa.')\r\n\r\n", "n=input()\r\nl=n.split(\".\")\r\nif l[0][-1]==\"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelif int(l[1])<int(\"5\"+(len(l[1])-1)\"0\"):\r\n print(l[0])\r\nelif int(l[1])>=int(\"5\"+(len(l[1])-1)\"0\"):\r\n print(int(l[0])+1)\r\n", "number = input().split('.')\nif int(number[1][0]) >= 5 and int(number[0][-1]) < 9:\n print(int(number[0]) + 1)\nelif int(number[1][0]) < 5 and int(number[0][-1]) < 9:\n print(int(number[0]))\nelse:\n print('GOTO Vasilisa.')", "x = input()\r\ni = x.index(\".\")\r\nif(x[i-1]=='9'):\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(x[i+1])>=5:\r\n print(int(x[:i])+1)\r\n else:\r\n print(int(x[:i]))", "num = input().split('.')\r\n\r\nif num[0][-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if int(num[1][0]) >= 5:\r\n print(int(num[0]) + 1)\r\n else:\r\n print(int(num[0]))\r\n", "_input = input()\ninteira, fracionaria = _input.split(\".\")\n\nif(inteira.endswith(\"9\")):\n print(\"GOTO Vasilisa.\")\nelse:\n if( not (fracionaria.startswith(\"5\") \| fracionaria.startswith(\"6\") \| fracionaria.startswith(\"7\") \| fracionaria.startswith(\"8\") \| fracionaria.startswith(\"9\"))):\n print(inteira)\n else:\n print(int(inteira)+1)\n\t\t\t \t \t\t \t \t\t\t\t\t \t \t", "n = input()\nfor i in range(len(n)):\n if n[i] == '.':\n point = i\n break\nstr = ''\nif n[point - 1] == '9':\n print('GOTO Vasilisa.')\nelse:\n for i in range(point):\n str += n[i]\n if n[point + 1] < '5':\n print(str)\n else:\n print(int(str) + 1)\n \t\t\t \t\t\t \t\t\t\t \t \t\t \t\t\t \t\t", "# A. Help Far Away Kingdom\r\n\r\nint_part, frac_part = input().split('.')\r\n\r\nif int_part.endswith('9'):\r\n print(\"GOTO Vasilisa.\")\r\n\r\nelse:\r\n first = int(frac_part[0])\r\n if first < 5:\r\n print(int_part)\r\n else:\r\n print(int_part[:-1], end=\"\")\r\n print(int(int_part[-1]) + 1)\r\n", "i, j=map(str,input().split(\".\"))\r\nprint([\"GOTO Vasilisa.\", int(i)+(j[0]>'4')][i[-1]<'9'])\n# Sun Jan 09 2022 08:29:38 GMT+0000 (Coordinated Universal Time)\n", "# #include <algorithm>\r\n# #include <iostream>\r\n# #include <iomanip>\r\n# #include <vector>\r\n# #include <cmath>\r\n# #include <deque>\r\n# #include <queue>\r\n# #include <map>\r\n# #include <set>\r\n# #define FOR(v, a, b, k) for(int v = a; v < b; v += k)\r\n# #define RFOR(v, a, b, k) for(int v = a; b <= v; v -= k)\r\n# using namespace std;\r\n# typedef long long int lli;\r\n# const lli MOD = 1E9 + 7;\r\n# const int MAXN = 1 1E5;\r\n# short bar[8] = {-1, 0, 1, 0, -1, 1, 1, -1};\r\n# short kol[8] = {0, 1, 0, -1, 1, 1, -1, -1};\r\n\r\n# int sum_dig(int x);\r\n# bool valid(int x, int y);\r\n# struct Point {\r\n# int x, y;\r\n# };\r\n\r\n# int n, m, k, cnt[2];\r\n# string s;\r\n\r\n# inline void prepare(){\r\n# return;\r\n# }\r\n\r\n# inline void solve(){\r\n# cin >> s;\r\n# for(const char& c : s){\r\n# n \|= 'a' <= c && c <= 'z';\r\n# m \|= 'A' <= c && c <= 'Z';\r\n# k \|= '0' <= c && c <= '9';\r\n# }\r\n# cout << (s.length() > 4 && n && m && k ? \"Correct\" : \"Too weak\") << '\\n';\r\n# }\r\n\r\n# int main(){\r\n# ios_base::sync_with_stdio(0);\r\n# cin.tie(0);\r\n# cout.tie(0);\r\n# prepare();\r\n \r\n# int tc = 1;\r\n# //cin >> tc;\r\n# while(tc--){\r\n# solve();\r\n# }\r\n# }\r\n\r\n# int sum_dig(int x){\r\n# return x ? x % 10 + sum_dig(x/10) : 0;\r\n# }\r\n\r\n# bool valid(int x, int y){\r\n# return (0 <= x && x < n) && (0 <= y && y < m);\r\n# }\r\ni, f = input().split('.')\r\nif i[-1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if f[0] < '5':\r\n print(int(i))\r\n else:\r\n print(int(i) + 1)", "a,b=input().split('.')\r\nif a[-1]=='9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n print(int(a)+(b[0]>'4'))", "n = str(input())\r\nx = n.find('.')\r\nif n[x-1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n y = n[x+1]\r\n if int(y)>=5:\r\n print(int(n[:x])+1)\r\n else:\r\n print(n[:x])", "n, f = input().split(\".\")\r\nif n[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n n = int(n)\r\n print(n if int(f[0]) < 5 else n+1)", "# LUOGU_RID: 104834186\na, b = map(str, input().split('.'))\r\nif a[-1] < '9':\r\n print(int(a) + (b[0] > '4'))\r\nelse:\r\n print('GOTO Vasilisa.')\r\n", "s=input()\nfor i in range(1,len(s)):\n if s[i]==\".\":\n inti=s[i-1]\n deci=s[i+1]\n if s[i-1]==\"9\":\n print(\"GOTO Vasilisa.\")\n elif s[i-1]<\"9\" and s[i+1]<\"5\":\n print(s[:i])\n elif s[i-1]<=\"9\" and s[i+1]>=\"5\":\n r=(s[:i-1])\n n=int(s[i-1])+1\n r+=str(n)\n print(r)\n", "a = input()\r\nif int(a[a.index(\".\")-1]) == 9:\r\n print(\"GOTO Vasilisa.\")\r\nelif int(a[a.index(\".\")+1]) < 5:\r\n print(int(a[:a.index(\".\")]))\r\nelse:\r\n print(int(a[:a.index(\".\")])+1)\r\n", "line = input()\r\ndot = line.find(\".\")\r\nif line[dot - 1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if line[dot + 1] >= \"5\":\r\n print(line[:dot - 1], chr(ord(line[dot - 1]) + 1), sep=\"\")\r\n else:\r\n print(line[:dot])\r\n", "n_int, n_dec = input().split('.')\r\nn_int = int(n_int)\r\nprint(\"GOTO Vasilisa.\" if n_int % 10 == 9 else (n_int if int(n_dec[0]) < 5 else n_int + 1))\r\n", "n = input().split(\".\")\n\nif n[0][-1] != '9' and int(n[1][0]) < 5:\n print(n[0])\nelif n[0][-1] != '9' and int(n[1][0]) >= 5:\n print(int(n[0]) + 1)\nelse :\n print(\"GOTO Vasilisa.\")\n\t \t\t \t\t\t\t\t \t\t \t\t \t\t \t", "number=input()\r\nparse=str.rsplit(number,'.')\r\nif parse[0][len(parse[0])-1]=='9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if int(parse[1][0])<5:\r\n print(parse[0])\r\n else:\r\n print(int(parse[0])+1)", "def help_far_away_kingdom(num:int):\r\n integer, decimal = num.split(\".\")\r\n integer = int(integer)\r\n if integer % 10 == 9 :\r\n return \"GOTO Vasilisa.\"\r\n\r\n if int(decimal[0] ) < 5 :\r\n return integer \r\n \r\n return integer + 1 \r\n\r\nif __name__ == \"__main__\":\r\n # n = int(input())\r\n \r\n # for _ in range(n):\r\n num = input()\r\n print(help_far_away_kingdom(num))", "s1 = input()\r\nm = s1.find('.')\r\nm2 = int(s1[:m])\r\nm3 = int(s1[m+1:m+2])\r\n\r\nif s1[m-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if m3 >= 5:\r\n m2 += 1\r\n print(m2)\r\n else:\r\n print(m2)", "import math\r\ns=input()\r\nd=s.index(\".\")\r\nif s[d-1]==\"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if s[d+1]>=\"5\":\r\n print(int(s[:d])+1)\r\n else:\r\n print(int(s[:d]))\r\n \r\n", "# LUOGU_RID: 100545756\nn=input()\nk=0\nfor i in n:\n if i=='.':\n break\n k+=1\n#print(k)\nif n[k-1]=='9':\n print('GOTO Vasilisa.')\nelse:\n if int(n[k+1])>=5:\n print(n[0:k-1],end='')\n print(int(n[k-1])+1)\n else:\n print(n[0:k])", "n = input()\r\nl = len(n)\r\nfor i in range(l):\r\n if n[i] == '.':\r\n k = int(n[i-1])\r\n s = int(n[i+1])\r\n j = i\r\n break\r\nif k == 9:\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if s >= 5:\r\n print(n[:j-1]+str(int(n[j-1])+1))\r\n else:\r\n print(n[:j])\r\n\r\n\r\n", "l=input()\r\n\r\nl=l.split('.')\r\n\r\ns=list(l[0])\r\n\r\np=list(l[1])\r\n\r\ni=int(p[0])\r\n\r\nif s[len(s)-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\n\r\nelif s[len(s)-1]!='9' and i<5:\r\n s=\"\".join(s)\r\n print(s)\r\nelse:\r\n s=\"\".join(s)\r\n s=str(int(s)+1)\r\n print(s)", "n = input().split('.')\r\nif int(n[0]) % 10 == 9 :\r\n\tprint(\"GOTO Vasilisa.\")\r\nelse:\r\n\tif int(n[1][0]) >= 5:\r\n\t\tprint(int(n[0]) + 1)\r\n\telse:\r\n\t\tprint(int(n[0]))", "import math\r\nn = input()\r\ndot = n.index(\".\")\r\nnew = n[:dot]\r\nafter = n[dot+1]\r\nlast = new[-1]\r\nout = \"\"\r\ndef myround(x) :\r\n dot = x.index(\".\")\r\n new = x[:dot]\r\n after = n[dot+1]\r\n if last == \"9\" : out = \"GOTO Vasilisa.\"\r\n elif int(after) < 5 : out = new\r\n else : out = str(int(new) + 1)\r\n return out\r\n\r\nprint(myround(n))\r\n \r\n", "ns = input()\r\nif '.' in ns:\r\n ns = ns.split('.')\r\n n = int(ns[1][0])\r\n if ns[0][-1] == '9':\r\n print('GOTO Vasilisa.')\r\n elif n < 5:\r\n print(ns[0])\r\n else:\r\n ch = chr(ord(ns[0][-1] )+1)\r\n n = ns[0][:-1]+ch\r\n print(n)\r\n\r\nelse:\r\n print(ns)", "s = input ().split('.')\r\nif s[0][-1] == '9' :\r\n print ('GOTO Vasilisa.')\r\nelse :\r\n if s[1][0] >= '5' :\r\n print (int(s[0]) + 1)\r\n else :\r\n print (s[0])\r\n", "a = str(input()).split('.')\r\nif int(a[1][0]) >= 5 and a[0][len(a[0])-1] != \"9\":\r\n print(int(a[0]) + 1)\r\nelif int(a[1][0]) < 5 and a[0][len(a[0])-1] != \"9\":\r\n print(a[0])\r\nelif a[0][len(a[0])-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")", "s = str(input())\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] == '.':\r\n break \r\n i += 1\r\nif s[i - 1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelif int(s[i + 1]) >= 5:\r\n print(int(s[: i]) + 1)\r\nelse:\r\n print(int(s[: i]))", "s = str(input())\r\nx = int(s[:s.index('.')])\r\ny = s[s.index('.') + 1:]\r\nk = '5' + '0' * (len(y) - 1)\r\ny = int(y)\r\nk = int(k)\r\nif(x % 10 < 9 and k > y):\r\n print(x)\r\nelif(x % 10 < 9 and k <= y):\r\n print(x + 1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")\r\n\r\n#print(k)\r\n#print(x)\r\n#print(y)\r\n\r\n# Qalay ))", "x = input().split(\".\")\r\nif x[0][-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelif int(x[1][0]) >= 5:\r\n print(int(x[0]) + 1)\r\nelse:\r\n print(x[0])\r\n \r\n ", "import math\r\n\r\ns = input()\r\n\r\nd = s.index(\".\")\r\n#print(s[:d])\r\nif s[d-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if s[d+1]>='5':\r\n print(int(s[:d])+1)\r\n else:\r\n print(int(s[:d]))\r\n'''\r\n\r\n#print(n[0][-1])\r\nif n[0][-1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\n exit()\r\nif int(n[1][0])<=4:\r\n print(n[0])\r\n exit()\r\nelse:\r\n print(n[0][:-1] + str(int(n[0][-1])+1))\r\n\r\n'''\r\n\r\n\r\n", "\r\ns = input()\r\nl = s.split('.')\r\nif l[0][-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n a = int(l[0])\r\n b = int(l[-1][0])\r\n if b >= 5:\r\n a += 1\r\n print(a)", "a,b=input().split('.')\r\nif a[-1]=='9': print(\"GOTO Vasilisa.\")\r\nelif int(b[0])>=5: print(int(a)+1)\r\nelse: print(a)\r\n", "number = input().split('.')\n\nif(number[0][len(number[0])-1]) == '9':\n print(\"GOTO Vasilisa.\")\n\nelif int(number[1][0]) >= 5:\n print(int(number[0])+1)\nelse:\n print(int(number[0]))\n\t \t\t \t \t\t\t \t\t\t \t\t \t" ]	{"inputs": ["0.0", "1.49", "1.50", "2.71828182845904523536", "3.14159265358979323846", "12345678901234567890.1", "123456789123456789.999", "12345678901234567890.9", "123456789123456788.999", "9.000", "0.1", "0.2", "0.3", "0.4", "0.5", "0.6", "0.7", "0.8", "0.9", "1.0", "1.1", "1.2", "1.3", "1.4", "1.5", "1.6", "1.7", "1.8", "1.9", "2.0", "2.1", "2.2", "2.3", "2.4", "2.5", "2.6", "2.7", "2.8", "2.9", "3.0", "3.1", "3.2", "3.3", "3.4", "3.5", "3.6", "3.7", "3.8", "3.9", "4.0", "4.1", "4.2", "4.3", "4.4", "4.5", "4.6", "4.7", "4.8", "4.9", "5.0", "5.1", "5.2", "5.3", "5.4", "5.5", "5.6", "5.7", "5.8", "5.9", "6.0", "6.1", "6.2", "6.3", "6.4", "6.5", "6.6", "6.7", "6.8", "6.9", "7.0", "7.1", "7.2", "7.3", "7.4", "7.5", "7.6", "7.7", "7.8", "7.9", "8.0", "8.1", "8.2", "8.3", "8.4", "8.5", "8.6", "8.7", "8.8", "8.9", "9.0", "9.1", "9.2", "9.3", "9.4", "9.5", "9.6", "9.7", "9.8", "9.9", "609942239104813108618306232517836377583566292129955473517174437591594761209877970062547641606473593416245554763832875919009472288995880898848455284062760160557686724163817329189799336769669146848904803188614226720978399787805489531837751080926098.1664915772983166314490532653577560222779830866949001942720729759794777105570672781798092416748052690224813237139640723361527601154465287615917169132637313918577673651098507390501962", "7002108534951820589946967018226114921984364117669853212254634761258884835434844673935047882480101006606512119541798298905598015607366335061012709906661245805358900665571472645463994925687210711492820804158354236327017974683658305043146543214454877759341394.20211856263503281388748282682120712214711232598021393495443628276945042110862480888110959179019986486690931930108026302665438087068150666835901617457150158918705186964935221768346957536540345814875615118637945520917367155931078965", "1950583094879039694852660558765931995628486712128191844305265555887022812284005463780616067.5000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "718130341896330596635811874410345440628950330.500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "927925904158088313481229162503626281882161630091489367140850985555900173018122871746924067186432044676083646964286435457446768031295712712803570690846298544912543439221596866052681116386179629036945370280722.500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "68289614863244584294178637364598054554769889.500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "7536521504744364134984603189602839063535643888645969434165019366202558753840519.4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999", "646188694587964249318078225173.5000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "7017472758334494297677068672222822550374695787171163207025095950296957261530.50", "259085737066615534998640212505663524594409165063310128108448186246980628179842202905722595400477937071746695941939306735605849342959111887834258250883469840846714848774368.50000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "682500858233333594535201113441004740771119672961581796618069185960107115823662126812159957094407454522028503739299.5000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "41203422675619090661099806687619.49999999999999999999999999999999999999999999999999999999999999999999999999999999999999999"], "outputs": ["0", "1", "2", "3", "3", "12345678901234567890", "GOTO Vasilisa.", "12345678901234567891", "123456789123456789", "GOTO Vasilisa.", "0", "0", "0", "0", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "2", "2", "2", "2", "2", "2", "2", "2", "2", "2", "3", "3", "3", "3", "3", "3", "3", "3", "3", "3", "4", "4", "4", "4", "4", "4", "4", "4", "4", "4", "5", "5", "5", "5", "5", "5", "5", "5", "5", "5", "6", "6", "6", "6", "6", "6", "6", "6", "6", "6", "7", "7", "7", "7", "7", "7", "7", "7", "7", "7", "8", "8", "8", "8", "8", "8", "8", "8", "8", "8", "9", "9", "9", "9", "9", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "609942239104813108618306232517836377583566292129955473517174437591594761209877970062547641606473593416245554763832875919009472288995880898848455284062760160557686724163817329189799336769669146848904803188614226720978399787805489531837751080926098", "7002108534951820589946967018226114921984364117669853212254634761258884835434844673935047882480101006606512119541798298905598015607366335061012709906661245805358900665571472645463994925687210711492820804158354236327017974683658305043146543214454877759341394", "1950583094879039694852660558765931995628486712128191844305265555887022812284005463780616068", "718130341896330596635811874410345440628950331", "927925904158088313481229162503626281882161630091489367140850985555900173018122871746924067186432044676083646964286435457446768031295712712803570690846298544912543439221596866052681116386179629036945370280723", "GOTO Vasilisa.", "GOTO Vasilisa.", "646188694587964249318078225174", "7017472758334494297677068672222822550374695787171163207025095950296957261531", "259085737066615534998640212505663524594409165063310128108448186246980628179842202905722595400477937071746695941939306735605849342959111887834258250883469840846714848774369", "GOTO Vasilisa.", "GOTO Vasilisa."]}	UNKNOWN	PYTHON3	CODEFORCES	202
8daea05e984def6f793db9d374212130	Segments	You are given an integer N. Consider all possible segments on the coordinate axis with endpoints at integer points with coordinates between 0 and N, inclusive; there will be of them. You want to draw these segments in several layers so that in each layer the segments don't overlap (they might touch at the endpoints though). You can not move the segments to a different location on the coordinate axis. Find the minimal number of layers you have to use for the given N. The only input line contains a single integer N (1<=≤<=N<=≤<=100). Output a single integer - the minimal number of layers required to draw the segments for the given N. Sample Input 2 3 4 Sample Output 2 4 6	[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nx = [0] * (n + 1)\r\nfor l in range(n):\r\n for r in range(l + 1, n + 1):\r\n x[l] += 1\r\n x[r] -= 1\r\nfor i in range(1, n + 1):\r\n x[i] += x[i - 1]\r\nans = max(x)\r\nprint(ans)", "def process(n):\r\n if n % 2==1:\r\n return ((n+1)//2)*2\r\n return (n//2)(n//2+1)\r\n\r\nn = int(input())\r\nprint(process(n))\r\n ", "n=int(input())\r\nx=(n(n+1))//2+(n+1)//2\r\nprint(x//2)", "n=int(input())\r\nprint((n+n%2)((n+2)//2)//2)", "a=int(input())\r\nprint((a//2+1)((a+1)//2))", "n = int(input())\r\nn += 1\r\nn = nn\r\nn = n//4\r\nprint(n)", "def foobar(n):\r\n list = [0]n\r\n for i in range(n+1):\r\n l = n - i + 1\r\n for j in range(n-l+1):\r\n for k in range(j, j+l):\r\n list[k] += 1\r\n \r\n max = 0\r\n for i in list:\r\n max = max if max > i else i\r\n print(max)\r\n\r\nn = input()\r\nfoobar(int(n))\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append((i+1)(n-i))\r\nprint(max(a))", "import sys\r\n\r\nn = int(sys.stdin.readline().rstrip(\"\\n\"))\r\n\r\nif n % 2 == 0:\r\n res = n // 2 * (n // 2 + 1)\r\n print(res)\r\n\r\nelse:\r\n res = (n // 2 + 1) * (n // 2 + 1)\r\n print(res)", "n = int(input())\r\nans = n\r\nwhile True:\r\n n -= 2\r\n if n < 0:\r\n break\r\n ans += n\r\nprint(ans)", "n = int(input())\nsumm = 0\nwhile n >= 0:\n\tsumm += n\n\tn -= 2\nprint(summ)\t", "n = int(input())\n\ncnt = 0\nwhile n > 0:\n cnt += n\n n -= 2\n\nprint(cnt)\n", "n = int(input())\r\na = [int(i) for i in range(1, n + 1)]\r\np = []\r\nfor i in range(n):\r\n for j in range(i, n):\r\n p.append([i + 1, j + 1])\r\narr = [0] * n\r\nfor i in p:\r\n for j in range(i[0] - 1, i[1]):\r\n arr[j] += 1\r\nprint(max(arr))", "n = int(input()) + 1\nans = 0\nfor i in list(range(2,n))[::-1]:\n\tif n >= i * 2: ans += i\n\telse:\n\t\tans += n - i\nprint(ans + 1)\n", "import sys\r\nn = int(input().strip())\r\nif n%2==1:\r\n print(((n//2)+1)*2)\r\nelse:\r\n print(n(n+2)//4)\r\n", "n=int(input())\r\nprint(((n//2)+1)(n-(n//2)))", "n = int(input())\r\n\r\nslices = []\r\nfor ln in range(1, n + 1):\r\n for i in range(0, n - ln + 1):\r\n slices.append([i, i + ln])\r\n\r\nslices.sort()\r\n# print(slices)\r\ncur = slices.pop(0)\r\nc = 0\r\nwhile slices:\r\n flag = False\r\n for sl in slices.copy():\r\n if sl[0] == cur[1]:\r\n cur[1] = sl[1]\r\n slices.remove(sl)\r\n flag = True\r\n elif sl[1] == cur[0]:\r\n cur[0] = sl[0]\r\n slices.remove(sl)\r\n flag = True\r\n\r\n if not flag:\r\n c += 1\r\n if slices:\r\n cur = slices.pop(0)\r\n else:\r\n cur = 0\r\n\r\nif cur:\r\n c += 1\r\nprint(c)", "import math\nn = int(input())\nprint((n // 2 + 1) math.ceil(n / 2))\n", "from math import \r\na = int(input())\r\na += 1\r\nprint(floor(aa/4))", "from collections import Counter, deque\ndef lInt(d = None): return map(int, input().split(d))\n\nn, _ = lInt()\nans = 0\n\nfor l in range(1, n+1):\n for j in range(0, l):\n if j+l <= n:\n ans += 1\nprint(ans)\n", "n=int(input())\r\nr=0\r\nfor i in range(1,n+1):\r\n start=i\r\n say=n-i+1\r\n if say >=i:\r\n say=i\r\n r+=say\r\nprint(r)\r\n", "n = int(input())\r\nif n % 2 == 0:\r\n b = 2\r\nelse:\r\n b = 1\r\ns = 0\r\nfor i in range(b, n + 1, 2):\r\n s += i\r\nprint(s)", "n = int(input())\r\ncnt = 0\r\ncur_cnt = 1\r\nfor i in range(n, 0, -1):\r\n cnt += min(cur_cnt, i)\r\n cur_cnt += 1\r\nprint(cnt)\r\n", "#!/usr/bin/env python3\r\n#! -- coding: utf-8 --\r\n\r\n\r\ndef main():\r\n\tn = int(input())\r\n\tprint((n // 2 + 1) ((n + 1) // 2))\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n = int(input())\r\ndef count(n):\r\n\tif n==0: return 0\r\n\tif n==1: return 1\r\n\telif n<1: return 0\r\n\treturn n+count(n-2)\r\nprint(count(n))", "import math\r\na=int(input())\r\nif(a==1):\r\n\tprint(1)\r\nelif(a==2):\r\n\tprint(2)\t\r\nelif(a==3):\r\n\tprint(4)\r\nelif(a==4):\r\n\tprint(6)\r\nelse:\r\n\tb=a\t\t\t\r\n\td=a-2\r\n\te=1\r\n\twhile(d>0):\r\n\t\tif(d>=e):\r\n\t\t\tb+=e\r\n\t\telse:\r\n\t\t\tb+=d\r\n\t\td-=1\r\n\t\te+=1\t\r\n\tprint(b)", "a = int(input())\r\nprint(sum([a-i for i in range(a)][::2]))", "n = int(input())\r\nans = 0\r\nfor i in range(1, n + 1):\r\n\tif n >= 2 * i:\r\n\t\tans += i\r\n\telse:\r\n\t\tans += n - i + 1\r\nprint(ans)\r\n", "n = list(map(int,input().split()))[0]\r\nx=0\r\nif n%2==0:\r\n\tx=(n//2) * (n//2+1)\r\nelse:\r\n\tx= (n//2 +1)2\r\nprint(x)\r\n", "# @Date: 27-Dec-2017\n# @Last modified time: 27-Dec-2017\nn=int(input())\nprint(((n+1)2)//4)\n", "n = int(input()) + 1\r\nprint((nn)//4)\r\n", "n=int(input())\nif n%2==1:\n k=(n+1)/2\n print(int(k2))\nelse:\n k=n/2\n print(int(k(k+1)))\n\t \t\t \t \t\t \t\t\t \t\t \t\t\t\t \t\t\t", "n = int(input())\n\nans = 0\n\nfor i in range(n, 0, -2):\n\tans += i\n\nprint(ans)", "# cook your dish here\r\nimport math\r\nn=int(input())\r\nif(n%2==0):\r\n x=math.floor(n/2+1)(math.floor(n/2))\r\nif(n%2!=0):\r\n x=(math.ceil(n/2)(math.ceil(n/2)))\r\nprint(x)", "n = int(input())\r\nl, r = 0, n\r\nans = 0\r\nwhile l < r:\r\n ans += r - l\r\n l += 1\r\n r -= 1\r\nprint(ans)\r\n", "n = int(input())\r\nprint (sum(range(n, 0 , -2)))\r\n", "# input\r\nN = int(input())\r\n\r\ndef solve():\r\n if N%2 == 0:\r\n a = N//2\r\n print(2 * sum(range(1, a+1)))\r\n else:\r\n a = (N-1)//2\r\n print(2 * sum(range(1, a+1)) + (a+1))\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n\r\n", "import sys\n\n#f = open('input', 'r')\nf = sys.stdin\n\nn = int(f.readline())\n\nans = [1, 2, 4, 6, 9, 12, 16, 20, 25, 30, 36, 42, 49, 56, 64, 72, 81, 90, 100, 110, 121, 132, 144, 156, 169, 182, 196, 210, 225, 240, 256, 272, 289, 306, 324, 342, 361, 380, 400, 420, 441, 462, 484, 506, 529, 552, 576, 600, 625, 650, 676, 702, 729, 756, 784, 812, 841, 870, 900, 930, 961, 992, 1024, 1056, 1089, 1122, 1156, 1190, 1225, 1260, 1296, 1332, 1369, 1406, 1444, 1482, 1521, 1560, 1600, 1640, 1681, 1722, 1764, 1806, 1849, 1892, 1936, 1980, 2025, 2070, 2116, 2162, 2209, 2256, 2304, 2352, 2401, 2450, 2500, 2550]\n\nprint(ans[n-1])\n", "def f(n):\r\n if(n==0):\r\n return(0)\r\n elif(n==1):\r\n return(1)\r\n else:\r\n return(f(n-2)+n)\r\n\r\nprint(f(int(input())))", "n=int(input())\r\nprint(((n+2)//2)((n+1)//2))", "print(int(((int(input())+1)/2)2))", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n s+= (n-i)//2 + (n-i)%2\r\nprint(s)\r\n", "n = int(input())\r\nif n%2==0:\r\n result = n ((n//2)+1)//2\r\nelse:\r\n result = (n//2)(n//2+1)//2 + (n+1)//2((n+1)//2 +1)//2\r\nprint(result) ", "from math import floor,ceil\r\n\r\nif __name__ == \"__main__\":\r\n num = int(input().strip())\r\n if num == 1:\r\n print(1)\r\n else:\r\n print((floor(num/2)+1)ceil(num/2))\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n+1):\r\n a.append(((n+1)-i)i)\r\nprint(max(a))", "n = int(input())\nn += 1\nprint(n * n // 4)\n", "# B.py\r\n\r\nn = int(input())\r\ni = (n + 1) // 2\r\nprint(i * (n + 1 - i))", "n = int(input())\r\ns = 0\r\nfor i in range(1,n+1):\r\n if i <= n//2:\r\n s += i\r\n else:\r\n s += n - i + 1\r\n\r\n\r\nprint(s)", "import math\r\n# cook your dish here\r\ns = int(input())\r\nprint(math.ceil((s/2+1)(s/2)))", "n = int(input())\r\nk = n + 1\r\nprint((kk)//4)", "import sys\r\ndef f(x):\r\n if x != 2 and x != 1:\r\n return x + f(x - 2)\r\n else: return x\r\n\r\n\r\nn = int(input())\r\nprint(f(n))\r\n\r\n\r\n", "import math\nn = int(input())\nans = 0\nfor i in range(1, int(math.ceil(n / 2)) + 1):\n ans += i\nfor j in range(n // 2, 0, -1):\n ans += j\nprint(ans)\n", "# Сложность по времени O(n)\r\n# Сложность по памяти O(1)\r\n\r\nn = int(input())\r\ns = [1, 2, 4, 6]\r\nif n < 5:\r\n print(s[n - 1])\r\nelse:\r\n a, b = 4, 6\r\n i = 5\r\n while i < n:\r\n a, b = b, a + i\r\n i += 1\r\n print(a + i)", "#!/usr/bin/env python3\r\n\r\ndef main():\r\n n = int(input())\r\n print((((n - 1) >> 1) + 1) * (n - ((n + 1) >> 1) + 1))\r\n\r\ntry:\r\n while True:\r\n main()\r\nexcept EOFError:\r\n pass\r\n", "n = int(input())\r\n\r\na = (n + 1) // 2\r\nb = (n + 2) // 2\r\n\r\nprint(a * b)", "n = int(input())\r\n\r\nans = 0\r\n\r\nfor i in range(n // 2 + (0 if n % 2 == 0 else 1)):\r\n l = n - 2 * i\r\n if l <= 0:\r\n break\r\n ans += l\r\n\r\nprint(ans)\r\n \r\n", "n = int(input())\r\nan = 0\r\na = [0] * (n + 1)\r\nfor i in range(n):\r\n for s in range(1, n - i + 1):\r\n a[i] += 1\r\n a[i + s] -= 1\r\nfor i in range(len(a)):\r\n if a[i] > 0:\r\n an += a[i]\r\nprint(an)\r\n", "from sys import stdin, stdout\r\nfrom gc import disable\r\ndisable()\r\n\r\ndef f(n:int) -> int:\r\n if (n <= 1):\r\n return n\r\n else:\r\n return f(n-2) + n\r\n\r\nn = int(stdin.readline())\r\nstdout.write(\"%i\"%(f(n)))", "n=int(input())\r\nn=n+1\r\nn=nn\r\nn=n//4\r\nprint(n)", "# -- coding: utf-8 --\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\nN = int(input())\r\na = 111 [1]\r\na[0] = 0\r\na[1] = 1\r\na[2] = 2\r\nfor i in range(3, N + 1):\r\n a[i] = a[i - 2] + i\r\nprint(a[N])", "n= int(input())\r\nimport math\r\nprint((math.floor(n/2)+1)(math.ceil(n/2)))", "n = int(input())\r\nresult = 0\r\nmid = n // 2 + 1\r\n\r\nfor i in range(mid):\r\n result += i\r\nfor i in range(mid, n+1):\r\n result += n - i + 1\r\nprint(result)", "'''\r\nINPUT SHORTCUTS\r\nN, K = map(int,input().split())\r\nN ,A,B = map(int,input().split())\r\nstring = str(input())\r\narr = list(map(int,input().split()))\r\nN = int(input())\r\n'''\r\n\r\n\r\n\r\ndef main():\r\n\tN = int(input())\r\n\tadd = 0\r\n\twhile N>0:\r\n\t\t# print(N)\r\n\t\tadd+=(N)\r\n\t\tN-=2\r\n\tprint(add)\r\n\r\nmain()", "# Problem: Segment\r\n\r\nif __name__ == \"__main__\":\r\n num = int(input().strip())\r\n segment = []\r\n for i in range(1,num+1):\r\n j = 0\r\n for j in range(num):\r\n if j + i <= num:\r\n segment.append((j,j+i))\r\n segment.sort(key = lambda x: (x[0],[1]))\r\n #print(segment)\r\n layer_count = 0\r\n \r\n while segment != []:\r\n rightend = segment[0][1]\r\n segment.remove(segment[0])\r\n j = 0\r\n while j < len(segment):\r\n if rightend == segment[j][0]:\r\n rightend = segment[j][1]\r\n segment.remove(segment[j])\r\n else:\r\n j += 1\r\n layer_count +=1\r\n print(layer_count)\r\n", "ka=int(input())\r\nprint((ka//2+1)((ka-1)//2+1))", "n = int(input())\r\ncount = n * (n + 1) // 2\r\nSections = []\r\nlength = n\r\nwhile length > 0:\r\n i = 0\r\n while i + length <= n:\r\n Sections.append((i, i + length))\r\n i += 1\r\n length -= 1\r\n\r\n\r\ndef create(A):\r\n length = len(A)\r\n A.sort(key=lambda x: x[1] - x[0])\r\n for i in range(length - 1, -1, -1):\r\n a1, b1 = A[i]\r\n idx1 = -1\r\n idx2 = -1\r\n best_then = -1, -1\r\n best_pref = -1, -1\r\n diff_then = n\r\n diff_pref = n\r\n for j in range(i - 1, -1, -1):\r\n a2, b2 = A[j]\r\n if a2 >= b1:\r\n d = n - b2\r\n if d < diff_then:\r\n diff_then = d\r\n best_then = b2\r\n idx1 = j\r\n elif b2 <= a1:\r\n d = a2\r\n if d < diff_pref:\r\n diff_pref = d\r\n best_pref = a2\r\n idx2 = j\r\n if diff_pref != n:\r\n A[i] = (best_pref, A[i][1])\r\n A.pop(idx2)\r\n\r\n if diff_then != n:\r\n A[i] = (A[i][0], best_then)\r\n A.pop(idx1)\r\n\r\n if len(A) == length:\r\n return A\r\n else:\r\n return create(A)\r\n\r\n\r\nprint(len(create(Sections)))\r\n\r\n", "# LUOGU_RID: 101737981\nn = int(input())\r\nprint((n + 1) // 2 * (n // 2 + 1))", "def solve(n):\r\n if n <= 1:\r\n return n\r\n else:\r\n return n + solve(n - 2)\r\na = int(input())\r\nprint(solve(a))\r\n", "n = int(input())\nresult = 0\nfor i in range(n):\n result = max(result, (i + 1)(n - i))\nprint(result)\n", "n=int(input())\r\nt=n//2\r\nif n%2==0:\r\n print(t(t+1))\r\nelse:\r\n print(t(t+1)+t+1)", "n=int(input())\r\nn+=1\r\nprint((n+1)//2(n//2))", "n = int(input())\r\nprev = 1\r\nif n == 1:\r\n print(1)\r\n exit()\r\ncur = 2\r\nfor i in range(3, n + 1):\r\n now = (i * (i + 1) // 2 - (i - 1) * (i - 2) // 2 + 1) // 2 + prev\r\n prev, cur = cur, now\r\nprint(cur)\r\n", "n = int(input())\ndp = [0]101\ndp[1] = 1\ndp[2] = 2\nfor i in range(3, 101):\n dp[i] = dp[i-2]+i\nprint(dp[n])\n", "n = int(input())\r\nprint((n + 1) * 2 // 4 if n % 2 else n * (n + 2) // 4)", "from math import ceil\r\nN = int(input())\r\nS = (N * (N + 1)) / 2\r\nF = int(ceil(N /2.0))\r\nans = int((S + F) / 2)\r\nprint(ans)", "n = int(input())\r\n\r\nres = 0\r\nfor i in range(1, n+1):\r\n\tstart = 0\r\n\tlayer = 0\r\n\tlayers = 1\r\n\tfor j in range(0,(n-i)+1):\r\n\t\tif (start + i) > n:\r\n\t\t\tlayers += 1\r\n\t\t\tlayer += 1\r\n\t\t\tstart = layer + i\r\n\t\telif (start + i) == n:\r\n\t\t\tlayer += 1\r\n\t\t\tstart = layer\r\n\t\t\tif j != (n-i):\r\n\t\t\t\tlayers += 1\r\n\t\telse:\r\n\t\t\tstart += i\r\n\t\t#print(i, start, layers)\r\n\tres += layers\r\nprint(res)", "n = int(input())+1\nprint((nn)//4)", "n = int(input())\r\nsm = 0\r\nfor i in range(n, -1, -2):\r\n\tsm+=i\r\n\tif n<=2: break\r\nprint(sm)", "n = int(input())\nans = 0\nif(n % 2 == 0):\n\tans += (n//2) (n//2+1)\nelse:\n\tans += ((n+1)//2)*2\n\nprint(ans)", "s=int(input())\r\nif s%2==0:\r\n print(s(s+2)//4)\r\nelse:\r\n print((s+1)*2//4)\r\n", "n = int(input())\r\ne = int(n/2)\r\nif(n%2 == 0):\r\n print(e(e+1))\r\nelse:\r\n print(e(e+1) + int((n+1)/2))", "def segments(n):\r\n result = 0\r\n while n > 0:\r\n result += n\r\n n -= 2\r\n return result\r\n\r\n\r\nprint(segments(int(input())))", "a=[1,2]\r\nn=int(input())\r\nfor i in range(n-2):\r\n a.append(a[i]+i+3)\r\nprint(a[n-1])\r\n", "n=int(input())\r\nmaxi=1\r\nfor i in range(n):\r\n maxi=max(maxi,i(n+1-i))\r\nprint(maxi) ", "n=int(input())\r\nprint( max( (i+1)(n-i) for i in range(n) ) )\r\n", "n=int(input())\r\nk=0\r\nfor i in range(1,n+1) :\r\n k+=min(i,n-i+1)\r\nprint(k)\r\n \r\n \r\n", "n = int(input())\r\nf = [0] (n + 1)\r\nf[1] = 1\r\nfor i in range(2, n + 1):\r\n f[i] = i + f[i - 2]\r\nprint(f[n])\r\n \r\n", "x=int(input())\r\nsum=0\r\nif(x%2==1):\r\n\tn=x-1\r\n\twhile(n>0):\r\n\t\tsum+=(n+1)\r\n\t\tn-=2\r\n\tsum+=1\r\nelse:\r\n\tn=int((x2)/2)\r\n\twhile(n>0):\r\n\t\tsum+=n\r\n\t\tn-=2\r\nprint(sum)\r\n", "n = int(input())\r\nn += 1\r\nprint(n n // 4)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nif n % 2:\r\n x = n//2\r\n print(x(x+1) + n//2 + 1)\r\nelse:\r\n x = n//2\r\n print(x(x+1))", "n = int(input())\r\n\r\ns = n(n+1)//2\r\n\r\ns -= (s- (n+1)//2) // 2\r\n\r\nprint (s)\r\n", "n=int(input())+1\r\nprint((n2)//4)", "# [https://codeforces.com/blog/entry/56666 <- https://codeforces.com/problemset/problem/909/B <- https://algoprog.ru/material/pc909pB]\r\n\r\nn = int(input())\r\nprint((n // 2 + 1) ((n + 1) // 2))", "n=int(input())\r\nif n%2==0:\r\n res=2\r\n for i in range(4,n+1,2):\r\n res+=i\r\nelse:\r\n res=1\r\n for i in range(3,n+1,2):\r\n res+=i\r\nprint(res)", "\n# coding: utf-8\n\n# In[5]:\n\nn = int(input())\nc = n\ni = 1\nwhile c <= (n - i + 1) * i:\n c = (n - i + 1) * i\n i += 1\n \nprint(c)\n \n\n\n# In[ ]:\n\n\n\n", "'''input\r\n5\r\n'''\r\nn=int(input())\r\nans=0\r\nwhile n>0:\r\n ans+=n\r\n n-=2\r\nprint(ans)", "num = int(input().strip())\nfactor = 0\nlayers = 0\nfor x in range(num):\n if x % 2 == 0:\n factor += 1\n layers += factor\nprint(layers)", "n = int(input())\r\n\r\nsumma = 0\r\nwhile n>0:\r\n summa+=n\r\n n-=2\r\nprint(summa)\r\n", "n = int(input())\r\n\r\nmemo = dict()\r\n\r\ndef f(n):\r\n if n == 1:\r\n return 1\r\n if n == 2:\r\n return 2\r\n if n in memo:\r\n return memo[n]\r\n memo[n] = n + f(n-2)\r\n return memo[n]\r\n\r\nprint(f(n))\r\n", "a=int(input())\r\nb=a//2\r\nans=b(b+1)\r\nif a % 2 == 1:\r\n ans+=b+1\r\nprint(ans)", "import math\r\nn = int(input())\r\nprint((n//2+1)math.ceil(n/2))\r\n", "n=int(input()); ans=0\nfor i in range(1,n+1):\n\tans+=min(i,n-i+1)\nprint(ans)", "import sys\r\nn = int(input())\r\nans = 0\r\nwhile n > 0:\r\n ans += n\r\n n -= 2\r\nprint(ans)\r\n", "N = int(input())\r\nprint(sum(range(N, 0, -2)))\r\n", "import math\nn = int(input()) + 1\nprint((nn)//4)\n", "a = [-1]101\na[1] = 1\na[2] = 2\nfor i in range(3,101):\n a[i] = a[i-2] + i\nprint(a[int(input())])\n", "import math\r\nn = int(input())\r\nprint( (math.floor(n/2)+1) * math.ceil(n/2) )", "N = int(input())\nsegments = [[[start,length+start] for start in range(1,N-length)] for length in range(1,N-1)]\ntotal = 0\nwhile N > 0:\n total += N\n N-= 2\nprint(total)", "n=int(input())\r\nif n%2==0:\r\n ans=(n//2)(n//2+1)\r\nelse:\r\n ans=(n//2+1)(n//2+1)\r\nprint(ans)", "n=int(input())\nif n%2==0:\n print((n//2)((n//2) + 1))\nelse:\n n+=1\n print((n//2)(n//2))\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\nn = int(input())\r\n\r\nS = list()\r\nfor i in range(n+1):\r\n for j in range(i+1, n+1):\r\n S.append([2i, 2j])\r\n\r\nres = 0\r\nfor x in range(1, 2n, 2):\r\n cnt = 0\r\n for s in S:\r\n if s[0] < x and x < s[1]:\r\n cnt += 1\r\n res = max(res, cnt)\r\nprint(res)\r\n\r\n\r\n", "N = int(input())\r\nprint((N//2+1)((N-1)//2+1))", "n = int(input())\r\ndef f(x):\r\n\tif x == 1:\r\n\t\treturn 1\r\n\tif x % 2:\r\n\t\treturn f(x - 1) + (x + 1) // 2\r\n\treturn f(x - 1) + x // 2\r\nprint(f(n))", "x = int(input()) + 1\r\nprint(x//2 * (x - x//2))", "n = int(input())\r\nif n & 1:\r\n print(n * (n + 1) // 2 - (n - 1) * (n + 1) // 4)\r\nelse:\r\n print(n * n // 2 - (n - 2) * n // 4)", "print(int(((int(input())+1))*2//4))", "n=int(input())\r\n\r\ndef get(n):\r\n\tif n%2==1:\r\n\t\tk = (n+1)//2\r\n\t\treturn kk\r\n\telse:\r\n\t\tk=n//2\r\n\t\treturn k(k+1)\r\n\r\nprint(get(n))", "def pedy(n):\r\n if n < 2:\r\n return n\r\n return n + pedy(n - 2)\r\nprint(pedy(int(input())))\r\n", "n = int(input())\r\nl = [0]n\r\nfor i in range(n):\r\n for j in range(n-i):\r\n for k in range(j,j+i+1):l[k]+=1\r\nprint(max(l))\r\n", "n=int(input())\ns=0\ni=0\nside = int(n/2)\nwhile i<side:\n\ti+=1\n\ts+=2i\nif n%2==1:\n\ts+=i+1\nprint(s)", "N=int(input())\nans=0\nwhile N>0:\n ans+=N\n N-=2\nprint(ans)\n", "modulo = 1000000007\r\nn = int(input())\r\n\r\nans = 0\r\n\r\nfor k in range(n):\r\n if (k+1) (n-k) > ans:\r\n ans = (k+1) * (n-k)\r\n\r\nprint(ans)\r\n", "N = int(input().rstrip())\r\n\r\nif N%2==0:\r\n\tsegments=(N/2)((N/2)+1)\r\nelse:\r\n\tsegments=((N+1)/2)((N+1)/2)\r\n\r\nprint(int(segments))", "n=int(input())\r\na=n//2\r\nif n%2==0:\r\n print(n(n+2)//4)\r\nelse:\r\n print(a(a+1)+(n+1)//2)", "def afd(nn):\r\n if nn < 2:\r\n return nn\r\n return nn + afd(nn - 2)\r\nprint(afd(int(input())))\r\n", "n = int(input())\r\nprint((n//2 + 1)((n+1)//2))", "n=int(input())\nar=[]\nfor x in range(0,n+1):\n for y in range(x+1,n+1):\n ar.append([x,y])\nans=0\nfor x in ar:\n if x[0] <= (n+1-(n%2))/2 <= x[1]:\n ans+=1\nprint(ans)\n ", "import math\nn = int(input())\nn = math.floor(n / 2 + 1) math.ceil(n / 2)\nprint(n)\n", "n = int(input())\nans = 0\nfor i in range(1, n+1):\n ans += min(n - i + 1, i)\nprint(ans)\n", "import math\r\ndef o(x):return x(x+1)/2\r\nn=int(input())\r\nprint(round(2o(math.floor(n/2))+(math.ceil(n/2)if n%2==1 else 0)))", "def S(x):\r\n\tif x==1:\r\n\t\treturn(1)\r\n\tif x==2:\r\n\t\treturn(2)\r\n\telse:\r\n\t\treturn(x//2+x%2+S(x-1))\r\nprint(S(int(input())))", "a=int(input())\r\nprint((a+1)(a+1)//4)", "a = int(input())\r\nb = a // 2\r\nb = b(b+1)\r\nif a % 2 == 1:\r\n\tb += a // 2 + 1\r\nprint(b)", "\r\n\r\nif __name__ == '__main__':\r\n num = int(input().strip())\r\n segments = []\r\n for i in range(1,num + 1):\r\n for j in range(num):\r\n if j + i > num:\r\n break\r\n segments.append((j,j+i))\r\n #print(segments)\r\n segments.sort(key = lambda x: (x[0],x[1]))\r\n count = 0\r\n while segments != []:\r\n right_end = segments[0][1]\r\n j = 0\r\n while j < len(segments):\r\n if segments[j][0] == right_end:\r\n right_end = segments[j][1]\r\n segments.remove(segments[j])\r\n else:\r\n j += 1\r\n count += 1\r\n segments.remove(segments[0])\r\n print(count)\r\n", "print((int(input())+1)*2//4) # https://www.youtube.com/watch?v=T3I-_KzgVzc", "import math\r\nn=int(input())\r\nprint((math.floor(n/2)+1)math.ceil(n/2))", "n = int(input())\nprint(round((n/2+1)n/2))\n", "for i in range(1):\r\n n=int(input())\r\n x=n/2\r\n if x>int(x):\r\n s=(n//2+1)(int(x)+1)\r\n print(s)\r\n else:\r\n s=(n//2+1)(int(x))\r\n print(s)\r\n", "n = int(input())\r\n\r\n\r\nprint(((n//2)+1) (n-n//2))\r\n", "n = int(input())\r\n\r\nif (n % 2 == 0):\r\n res = ((1 + (n // 2)) * (n // 2))\r\nelse:\r\n res = (n + 1) // 2\r\n n = n - 1\r\n res = res + ((1 + (n // 2)) * (n // 2))\r\n\r\n\r\nprint(res)", "'''input\n4\n'''\nn = int(input())\nl = [[False] * n]\nfor s in range(n):\n\tfor e in range(s+1, n+1):\n\t\tfor x in range(len(l)):\n\t\t\tif True not in l[x][s:e]:\n\t\t\t\tl[x][s:e] = [True] * (e-s)\n\t\t\t\tbreak\n\t\telse:\n\t\t\tl.append([False] * n)\n\t\t\tl[-1][s:e] = [True] * (e-s)\nprint(len(l))\n", "n = int(input())\n\nsumma = 0\nwhile n>0:\n summa+=n\n n-=2\nprint(summa)\n", "n = int(input())\r\nx = n//2\r\nprint((x+1)(n-x))\r\n", "print(sum(i for i in range(int(input()),-1,-2)))", "n = int(input())\r\nitems = {}\r\n\r\nfor i in range(1, n+1):\r\n ci = []\r\n for j in range(n-i+1):\r\n curr = '0'j + '1'i + '0'(n-i-j)\r\n curr = int(curr,2)\r\n ci.append(curr)\r\n items[i] = ci\r\n# print(items)\r\n\r\nmaximal = 2*n\r\n# curr = 0\r\ndef stopcheck():\r\n for k,v in items.items():\r\n if len(v)!=0:\r\n return False\r\n return True\r\n\r\ndef getnext():\r\n global ans\r\n global curr\r\n global total\r\n for k in range(total,0,-1):\r\n if len(items[k])==0:\r\n continue\r\n for num in items[k]:\r\n if curr & num == 0:\r\n items[k].remove(num)\r\n curr = curr \| num\r\n total-=k\r\n return True\r\n return False\r\n\r\n\r\nans=0\r\nwhile True:\r\n if stopcheck():\r\n break\r\n curr = 0\r\n total = n\r\n ans+=1\r\n while curr<maximal:\r\n if not getnext():\r\n break\r\n\r\nprint(ans)", "def getans(n):\r\n if n == 2 :\r\n return 2\r\n if n == 1:\r\n return 1\r\n return n+getans(n-2)\r\nprint(getans(int(input())))\r\n", "import math\r\nn=int(input())\r\nprint(int((n//2+1)math.ceil(n/2)))", "N = int(input())\n\nans = 1\ndone = [[False for _ in range(N+1)] for _ in range(N+1)]\nfor l in range(1, N):\n for b in range(N-l+1):\n e = b + l\n # print(b, e, done[b][e])\n if not done[b][e]:\n ans += 1\n done[b][e] = True\n if e <= N//2:\n done[e][N-b] = True\n elif b >= N//2:\n done[N-e][b] = True\n\nprint(ans)", "n = int(input())\r\nans = [0, 1, 2, 4, 6]\r\nfor i in range(4, 100):\r\n ans.append(2 * ans[i] - 2 * ans[i - 2] + ans[i - 3])\r\nprint(ans[n])", "q=int(input())\r\nt=q//2\r\nif q%2==0:\r\n print(t(t+1))\r\nelse:\r\n print(t(t+2)+1)\r\n\r\n", "import sys\ntry:\n sys.stdin = open('input.txt', 'r')\n sys.stdout = open('output.txt', 'w')\nexcept Exception as es:\n pass\n\nimport math\nn = int(input())\nprint((n // 2 + 1) * math.ceil(n / 2))\n", "def main():\n N = int(input())\n\n v = N + 1\n n = 0\n while v > 0:\n n += v - 1\n v -= 2\n\n print(n)\n\nmain()\n", "def solve(n):\r\n return int((n + n % 2) * (n + 2 - n % 2) / 4)\r\nn = int(input())\r\nprint(solve(n))", "n=int(input())\r\nans=0\r\nif(n%2==0):\r\n\tfor i in range(0,n+1,2):\r\n\t\tans+=i \r\n\tprint(ans)\r\nelse:\r\n\tfor i in range(1,n+1,2):\r\n\t\tans+=i \r\n\tprint(ans)", "n=int(input())\r\ncnt=0\r\nfor l in range(1,n+1):\r\n cnt+=min(n-l+1,l)\r\nprint(cnt)", "n = int(input())\r\n\r\nans = 0\r\nfor i in range(n,0,-2):\r\n\tans = ans + i\r\nprint(ans)", "n = int(input())\r\ns = n//2\r\nif n%2 == 0:\r\n\tprint (s2+s)\r\nelse:\r\n\tprint (s2+s+s+1)" ]	{"inputs": ["2", "3", "4", "21", "100", "1", "5", "6", "7", "8", "9", "10", "11", "12", "13", "14", "15", "16", "17", "18", "19", "20", "22", "23", "24", "25", "26", "27", "28", "29", "30", "31", "32", "33", "34", "35", "36", "37", "38", "39", "40", "41", "42", "43", "44", "45", "46", "47", "48", "49", "50", "51", "52", "53", "54", "55", "56", "57", "58", "59", "60", "61", "62", "63", "64", "65", "66", "67", "68", "69", "70", "71", "72", "73", "74", "75", "76", "77", "78", "79", "80", "81", "82", "83", "84", "85", "86", "87", "88", "89", "90", "91", "92", "93", "94", "95", "96", "97", "98", "99", "1", "5"], "outputs": ["2", "4", "6", "121", "2550", "1", "9", "12", "16", "20", "25", "30", "36", "42", "49", "56", "64", "72", "81", "90", "100", "110", "132", "144", "156", "169", "182", "196", "210", "225", "240", "256", "272", "289", "306", "324", "342", "361", "380", "400", "420", "441", "462", "484", "506", "529", "552", "576", "600", "625", "650", "676", "702", "729", "756", "784", "812", "841", "870", "900", "930", "961", "992", "1024", "1056", "1089", "1122", "1156", "1190", "1225", "1260", "1296", "1332", "1369", "1406", "1444", "1482", "1521", "1560", "1600", "1640", "1681", "1722", "1764", "1806", "1849", "1892", "1936", "1980", "2025", "2070", "2116", "2162", "2209", "2256", "2304", "2352", "2401", "2450", "2500", "1", "9"]}	UNKNOWN	PYTHON3	CODEFORCES	157
8db0bc286b569043a28bd31c19f4c65b	Shaass and Oskols	Shaass has decided to hunt some birds. There are n horizontal electricity wires aligned parallel to each other. Wires are numbered 1 to n from top to bottom. On each wire there are some oskols sitting next to each other. Oskol is the name of a delicious kind of birds in Shaass's territory. Supposed there are ai oskols sitting on the i-th wire. Sometimes Shaass shots one of the birds and the bird dies (suppose that this bird sat at the i-th wire). Consequently all the birds on the i-th wire to the left of the dead bird get scared and jump up on the wire number i<=-<=1, if there exists no upper wire they fly away. Also all the birds to the right of the dead bird jump down on wire number i<=+<=1, if there exists no such wire they fly away. Shaass has shot m birds. You're given the initial number of birds on each wire, tell him how many birds are sitting on each wire after the shots. The first line of the input contains an integer n, (1<=≤<=n<=≤<=100). The next line contains a list of space-separated integers a1,<=a2,<=...,<=an, (0<=≤<=ai<=≤<=100). The third line contains an integer m, (0<=≤<=m<=≤<=100). Each of the next m lines contains two integers xi and yi. The integers mean that for the i-th time Shaass shoot the yi-th (from left) bird on the xi-th wire, (1<=≤<=xi<=≤<=n,<=1<=≤<=yi). It's guaranteed there will be at least yi birds on the xi-th wire at that moment. On the i-th line of the output print the number of birds on the i-th wire. Sample Input 5 10 10 10 10 10 5 2 5 3 13 2 12 1 13 4 6 3 2 4 1 1 2 2 Sample Output 0 12 5 0 16 3 0 3	[ "n=int(input())\r\ns=input()\r\ns=s.split()\r\nl=[]\r\nfor i in range(n):\r\n l.append(int(s[i]))\r\n\r\n\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n \r\n ss=input()\r\n ss=ss.split()\r\n xi=int(ss[0])\r\n yi=int(ss[1])\r\n ox=l[xi-1]\r\n l[xi-1]-=yi\r\n if xi-2>=0:\r\n l[xi-2]+=(yi-1)\r\n \r\n ox=ox-yi\r\n l[xi-1]-=ox\r\n if xi-1<n-1:\r\n l[xi]+=ox\r\n\r\nfor j in l:\r\n print(j)\r\n", "# Test case 1\r\n'''\r\n1: 1 2 3 4 5 6 7 8 9 10\r\n2: 1 2 3 4 5 6 7 8 9 10\r\n3: 1 2 3 4 5 6 7 8 9 10\r\n4: 1 2 3 4 5 6 7 8 9 10\r\n5: 1 2 3 4 5 6 7 8 9 10\r\n\r\n# 2 5\r\n1: 1 2 3 4 1 2 3 4 5 6 7 8 9 10\r\n2: 0\r\n3: 1 2 3 4 5 6 7 8 9 10 6 7 8 9 10\r\n4: 1 2 3 4 5 6 7 8 9 10\r\n5: 1 2 3 4 5 6 7 8 9 10\r\n\r\n# 3 13\r\n1: 1 2 3 4 1 2 3 4 5 6 7 8 9 10\r\n2: 1 2 3 4 5 6 7 8 9 10 6 7\r\n3: 0 \r\n4: 1 2 3 4 5 6 7 8 9 10 9 10\r\n5: 1 2 3 4 5 6 7 8 9 10\r\n\r\n# 2 12\r\n1: 1 2 3 4 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 6\r\n2: 7\r\n3: 0 \r\n4: 1 2 3 4 5 6 7 8 9 10 9 10\r\n5: 1 2 3 4 5 6 7 8 9 10\r\n\r\n# 1 13\r\n1: 9 \r\n2: 7 10 1 2 3 4 5 6 7 8 9 10 6\r\n3: 0 \r\n4: 1 2 3 4 5 6 7 8 9 10 9 10\r\n5: 1 2 3 4 5 6 7 8 9 10\r\n\r\n# 4 6\r\n1: 0 (0) \r\n2: 7 10 1 2 3 4 5 6 7 8 9 10 6\r\n3: 1 2 3 4 5\r\n4: 0\r\n5: 1 2 3 4 5 6 7 8 9 10 7 8 9 10 9 10\r\n'''\r\n\r\nwire = int(input())\r\narr = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n index = x - 1\r\n amount = arr[index]\r\n jump_up = y - 1\r\n jump_down = amount - y\r\n arr[index] = 0\r\n if index - 1 >= 0:\r\n arr[index-1] += jump_up\r\n if index + 1 < len(arr):\r\n arr[index+1] += jump_down\r\nfor v in arr:\r\n print(v)", "n1=int(input())\r\nw=list(map(int,input().split()))\r\nn2,b=int(input()),[]\r\nfor i in range(n2) :\r\n b.append(list(map(int,input().split())))\r\n if b[i][0]-2>-1 : w[b[i][0]-2]+=b[i][1]-1\r\n if b[i][0]<n1 : w[b[i][0]]+=w[b[i][0]-1]-b[i][1]\r\n w[b[i][0]-1]=0\r\nfor i in w : print(i)", "input()\r\nWires = list(map(int, input().split()))\r\nN = int(input())\r\nShot = list()\r\nfor i in range(N):\r\n Shot.append(list(map(int, input().split())))\r\n Shot[i][0] -= 1\r\n\r\nfor i in range(len(Shot)):\r\n if Shot[i][0] != 0:\r\n Wires[Shot[i][0] - 1] += Shot[i][1] - 1\r\n if Shot[i][0] != len(Wires) - 1:\r\n Wires[Shot[i][0] + 1] += Wires[Shot[i][0]] - Shot[i][1]\r\n Wires[Shot[i][0]] = 0\r\n\r\nprint(Wires, sep=\"\\n\")\r\n", "n = int(input())\r\nwires = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x = x - 1\r\n left = y-1\r\n right = wires[x] - y\r\n wires[x] = 0\r\n if x >0:\r\n wires[x-1] += left\r\n if x < n-1:\r\n wires[x+1] += right\r\nprint('\\n'.join(map(str,wires)))", "n = int(input())\r\nlis = list(int(num) for num in input().strip().split())[:n]\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n x, y = input().split()\r\n x = int(x)-1\r\n y = int(y)-1\r\n lis[x] -= 1\r\n if x > 0:\r\n lis[x-1] += y\r\n if x < n-1:\r\n lis[x+1] += lis[x] - y\r\n lis[x] = 0\r\nfor i in range(n):\r\n print(lis[i])\r\n\r\n\r\n\r\n", "import sys\r\n\r\n\r\ndef sol():\r\n\tread = sys.stdin.readline\r\n\twires: int = int(read())\r\n\tbirds: list[int] = [int(i) for i in read().split()]\r\n\tinstructions: int = int(read())\r\n\tfor _ in range(instructions):\r\n\t\twire_idx, bird_idx = (int(i) for i in read().split())\r\n\t\tleft_birds = bird_idx - 1\r\n\r\n\t\tif left_birds > 0 and wire_idx > 1:\r\n\t\t\tbirds[wire_idx - 2] += left_birds\r\n\r\n\t\tright_birds = birds[wire_idx - 1] - bird_idx\r\n\t\tif right_birds > 0 and wire_idx < len(birds):\r\n\t\t\tbirds[wire_idx] += right_birds\r\n\t\t# Clear the current\r\n\t\tbirds[wire_idx - 1] = 0\r\n\r\n\r\n\tfor birt in birds:\r\n\t\tprint(birt)\r\n\r\nif __name__ == \"__main__\":\r\n\tsol()", "n=int(input())\r\narr=list(map(int,input().split()))\r\nm=int(input())\r\npos=[list(map(int,input().split())) for i in range(m)]\r\n\r\nfor i in range(m):\r\n # onLeft=arr[pos[i][0]-1]\r\n onLeft=pos[i][1]-1\r\n onRight=arr[pos[i][0]-1]-pos[i][1]\r\n arr[pos[i][0]-1]=0\r\n if pos[i][0]-2>=0:\r\n arr[pos[i][0]-2]+=onLeft\r\n if pos[i][0]<n:\r\n arr[pos[i][0]]+=onRight\r\n\r\nfor i in range(n):\r\n print(arr[i])", "n= int(input())\r\nl=list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x,p = map(int,input().split())\r\n if(x-1!=n-1 and x-1!=0):\r\n l[x] = l[x]+l[x-1]-p\r\n l[x-2] = l[x-2]+p-1\r\n l[x-1] = 0\r\n elif(x-1==n-1):\r\n l[x-2] = l[x-2]+p-1\r\n l[x-1] = 0\r\n elif(x-1==0):\r\n l[x] = l[x]+l[x-1]-p\r\n l[x-1] = 0\r\nfor i in l:\r\n print(i)", "n = int(input())\nbirds = list(map(int,input().split()))\nm = int(input())\n\nwhile m > 0:\n\tpositions = list(map(int,input().split()))\n\tx = positions[0] - 1\n\ty = positions[1] \n\n\tif x == 0 and n == 1:\n\t\tbirds = [0]\n\telif x > 0 and x < n-1:\n\t\tbirds[x+1] = birds[x+1] + birds[x] - y\n\t\tbirds[x-1] = birds[x-1] + y - 1\n\t\tbirds[x] = 0\n\telif x == 0:\n\t\tbirds[x+1] = birds[x+1] + birds[x] - y\n\t\tbirds[x] = 0\n\telif x == n - 1:\n\t\tbirds[x-1] = birds[x-1] + y - 1\n\t\tbirds[x] = 0\n\n\tm = m - 1\n\nfor bird in birds:\n\tprint(bird)\n\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nl.insert(0,-1)\r\nt = int(input())\r\nwhile(t):\r\n t -= 1\r\n q = [int(x) for x in input().split()]\r\n try:\r\n l[q[0]-1] += q[1]-1\r\n except:\r\n pass\r\n try:\r\n l[q[0]+1] += l[q[0]]-q[1]\r\n except:\r\n pass\r\n l[q[0]] = 0\r\nfor i in range(1,n+1):\r\n print(l[i])", "wires = int(input())\r\nbirds = [0] + list(map(int, input().split())) + [0]\r\nshots = int(input())\r\n\r\nfor i in range(shots):\r\n x, y = map(int, input().split())\r\n birds[x - 1] += y - 1\r\n birds[x + 1] += birds[x] - y\r\n birds[x] = 0\r\n\r\nfor i in range(1, wires + 1):\r\n print(birds[i])\r\n", "import sys\nimport math\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\nt = int(input())\nwhile t:\n i, pos = map(int, input().split())\n i -= 1\n if i > 0: a[i - 1] += pos - 1\n if i + 1 < n: a[i + 1] += (a[i] - pos)\n t -= 1\n a[i] = 0\nfor el in a: print(el)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nfor inh in range(0,m):\r\n\ti,j=map(int,input().split())\r\n\ti-=1\r\n\tk=a[i]\r\n\ta[i]=0\r\n\tright=k-j\r\n\tleft=j-1\r\n\tif i>0:\r\n\t\ta[i-1]+=left\r\n\tif i<n-1:\r\n\t\ta[i+1]+=right\r\nfor i in range(0,n):\r\n\tprint(a[i])", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nm=int(input())\r\nw=[[0]2 for i in range(m)]\r\n\r\nfor i in range(m):\r\n w[i][0],w[i][1]=map(int,input().split())\r\n\r\nfor i in range(m):\r\n\r\n left=w[i][1]-1\r\n right=a[w[i][0]-1]-w[i][1]\r\n\r\n if w[i][0]!=1:\r\n a[w[i][0]-2]+=left\r\n\r\n if w[i][0]!=n:\r\n a[w[i][0]]+=right\r\n\r\n a[w[i][0]-1]=0\r\n\r\nfor i in range(n):\r\n print(a[i])", "x = input()\r\nx = list(map(int,input().strip().split()))\r\ny = input()\r\nfor i in range(int(y)):\r\n\tlistt = list(map(int,input().strip().split()))\r\n\tif (listt[0]-1 > 0):\r\n\t\tx[listt[0]-2] = x[listt[0]-2] + listt[1] -1\r\n\t\t\r\n\tif (listt[0] < len(x)):\r\n\t\tx[listt[0]] = x[listt[0]] + x[listt[0]-1] - listt[1]\r\n\t\r\n\t\r\n\tx[listt[0]-1] = 0\r\n\t\t\r\n\t\r\nprint(x,sep='\\n')\r\n", "n = int(input())\r\na = list(map(int,input().split(' ')))\r\na.insert(0,0)\r\na.append(0)\r\nm = int(input())\r\nfor i in range(1,m+1):\r\n x, y = map(int,input().split(' '))\r\n a[x - 1] += y-1\r\n a[x + 1] += a[x] - y\r\n a[x] = 0\r\nfor i in range(1,n+1):\r\n print(a[i])\r\n \r\n", "n=int(input())\r\nwires=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n x, y= map(int, input().split())\r\n x=x-1\r\n birds= wires[x]\r\n right= birds-y\r\n left= birds-right-1\r\n wires[x]=0\r\n if(x-1>=0):\r\n wires[x-1]+=left\r\n if(x+1<n):\r\n wires[x+1]+=right\r\nfor i in range(n):\r\n print(wires[i])\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if x != 1:\r\n a[x - 2] += (y - 1)\r\n if x != n:\r\n a[x] += (a[x - 1] - y)\r\n a[x - 1] = 0\r\n\r\nfor i in a:\r\n print(i)\r\n", "import sys\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = (int(el) for el in input().split())\r\n x -= 1\r\n if x - 1 >= 0:\r\n a[x - 1] += y - 1\r\n if x + 1 <= n - 1:\r\n a[x + 1] += a[x] - y\r\n a[x] = 0\r\n \r\nfor el in a:\r\n print(el)\r\n \r\n \r\n ", "import math\r\nn=int(input())\r\na=[]\r\na=list(map(int,input().strip().split()))\r\ns=int(input())\r\n\r\n\r\nfor i in range(s):\r\n x,y=map(int,input().split())\r\n x-=1\r\n if(len(a)==1 and s==1):\r\n a[0]=0\r\n break \r\n if x==0:\r\n \r\n a[x+1]+=a[x]-y\r\n a[x]=0\r\n elif x==n-1:\r\n a[x-1]+=y-1\r\n a[x]=0\r\n else:\r\n a[x-1]+=y-1\r\n a[x+1]+=a[x]-y\r\n \r\n a[x]=0\r\nfor i in a:\r\n print(i)", "n = int(input())\r\nl_w = list(map(int, input().split()))\r\n\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if x - 2 >= 0:\r\n l_w[x - 2] += y - 1\r\n if x != n:\r\n l_w[x] += l_w[x - 1] - y\r\n \r\n l_w[x - 1] = 0\r\n \r\nprint(\"\\n\".join(str(x) for x in l_w))", "n = int(input())\r\nbirds = input().split()\r\nbirds = [int(bird) for bird in birds]\r\nm = int(input())\r\nfor i in range(m):\r\n wire, position = map(int, input().split())\r\n left = position - 1\r\n right = birds[wire - 1] - position\r\n if wire - 1 > 0:\r\n birds[wire - 1 - 1] += left\r\n if wire < n:\r\n birds[wire] += right\r\n birds[wire - 1] = 0\r\nfor j in range(n):\r\n print(birds[j])\r\n", "n = int(input())\r\na = list(map(int,input().strip().split()))\r\nt = int(input())\r\nfor i in range(t):\r\n x,y = input().split()\r\n x = int(x)\r\n y = int(y)\r\n n1 = a[x-1] - y\r\n n2 = y - 1\r\n a[x-1] = 0\r\n if x < n:\r\n a[x] += n1\r\n if x > 1:\r\n a[x-2] += n2\r\nfor i in a:\r\n print(i)\r\n", "n = int(input())\r\nwires = list(map(int, input().split()))\r\nshots = int(input())\r\nshots_list = list()\r\nfor i in range(shots):\r\n a,b = map(int, input().split())\r\n a -= 1\r\n if a != 0:\r\n wires[a-1] += b-1\r\n\r\n if a != n-1:\r\n wires[a+1] += wires[a] - b\r\n\r\n wires[a] = 0\r\n\r\n\r\nfor i in range(len(wires)):\r\n print(wires[i])\r\n\r\n", "n = int(input())\r\nbox = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n x -= 1\r\n if x != 0:\r\n box[x-1] += y-1\r\n if x != n-1:\r\n box[x+1] += box[x] - y\r\n box[x] = 0\r\nfor x in box:\r\n print(x,end=\"\\n\")", "n = int(input())\nbirds_on_wires = list(map(int, input().split()))\n\nattempts = int(input())\n\nfor _ in range(attempts):\n x, y = map(int, input().split())\n i = x-1\n left, right = y - 1, birds_on_wires[i]-y\n \n if (i-1) < 0:\n birds_on_wires[i] = 0\n else:\n birds_on_wires[i-1] += left\n birds_on_wires[i] = 0\n \n if (i+1) >= len(birds_on_wires):\n birds_on_wires[i] = 0\n else:\n birds_on_wires[i+1] += right\n birds_on_wires[i] = 0\n\nfor p in birds_on_wires:\n print(p)", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\nm = int(input())\r\nd = []\r\n\r\nfor i in range(m):\r\n\tx,y = map(int,input().split())\r\n\tif (x-2)>=0:\r\n\t\ts[x-2]+=y-1\r\n\tif x<n:\r\n\t\ts[x]+=s[x-1]-y\r\n\ts[x-1]=0\r\n\r\nfor i in s:\r\n\tprint(i)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n if x-2>=0:\r\n a[x-2]+=y-1\r\n if x<n:\r\n a[x]+=a[x-1]-y\r\n a[x-1]=0\r\nprint(a,sep='\\n')\r\n", "#####--------------Template Begin-------------------#####\r\nfrom fractions import Fraction\r\nimport sys\r\n#input = sys.stdin.readline\r\ndef i(): #Regular input\r\n\treturn input()\r\ndef ii(): #integer input\r\n\treturn int(input())\r\ndef li(): #list input\r\n\treturn input().split()\r\ndef mi(): #map input\r\n\treturn list(map(int, input().split()))\r\n#####---------------Template Ends-------------------######\r\nn=ii()\r\na=mi()\r\nm=ii()\r\nfor i in range(m):\r\n\tx,y=mi()\r\n\tx-=1\r\n\tif x-1>=0:\r\n\t\ta[x-1]+=y-1\r\n\tif x+1<n:\r\n\t\ta[x+1]+=a[x]-y\r\n\ta[x]=0\r\nfor i in a:\r\n\tprint(i)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nm = int(input())\r\nwhile (m != 0):\r\n i , b_s = list(map(int, input().split())) # i={1,2,3} b_s={} \r\n prev_index = i - 1 - 1\r\n cur_index = i - 1\r\n if prev_index >= 0:\r\n A[prev_index] += (b_s - 1)\r\n n_index = i\r\n if n_index < n:\r\n A[n_index] += A[cur_index] - b_s\r\n A[cur_index] = 0\r\n m -= 1\r\nfor i in A:\r\n print(i)", "n = (int)(input())\r\na = (list)(map(int , input().split()))\r\nq = (int)(input())\r\nfor _ in range(q) :\r\n x , y = (list)(map(int , input().split()))\r\n for __ in range(1 , a[x - 1] + 1) :\r\n if __ < y and x - 2 >= 0 : a[x - 2] += 1\r\n if __ > y and x < n : a[x] += 1\r\n a[x - 1] -= 1\r\n\r\nprint(a , sep='\\n')", "from re import S\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n array = [int(i) for i in input().split(' ')]\r\n m = int(input())\r\n for i in range(m):\r\n x, y = [int(i) for i in input().split(' ')]\r\n # Correct index\r\n x = x - 1\r\n \r\n up = y - 1\r\n down = array[x] - y\r\n array[x] = 0\r\n if x - 1 >= 0:\r\n array[x - 1] += up\r\n if x + 1 < n:\r\n array[x + 1] += down\r\n for i in array:\r\n print(i)\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\nm=int(input())\r\nfor i in range(0,m):\r\n x,y=map(int,input().split(' '))\r\n x=x-1\r\n if(x>=1):\r\n a[x-1]=a[x-1] + (y-1)\r\n if(x<n-1):\r\n a[x+1]=a[x+1] + (a[x]-y)\r\n a[x]=0\r\nfor i in range(0,n):\r\n print(a[i])", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n k,j=map(int,input().split())\r\n k-=1\r\n if k-1==-1:\r\n pass\r\n else:\r\n a[k-1]+=j-1\r\n if k+1==n:\r\n pass\r\n else:\r\n a[k+1]+=a[k]-j\r\n a[k]=0\r\nfor i in range(n):\r\n print(a[i])\r\n", "l1 = []\r\nl2 = []\r\nn = int(input())\r\nl3 = [int(number) for number in input().split(' ')]\r\nfor i in l3:\r\n for j in range(i):\r\n l2.append(0)\r\n l1.append(l2)\r\n l2 = list()\r\nm = int(input())\r\nfor i in range(m):\r\n l4 = [int(num) for num in input().split(' ')]\r\n x = l4[0]\r\n y = l4[1]\r\n for j in range(len(l1[x - 1]) - y):\r\n if x < n:\r\n l1[x].append(0)\r\n for j in range(y - 1):\r\n if x - 2 >= 0:\r\n l1[x - 2].append(0)\r\n l1[x - 1] = list()\r\nfor i in l1:\r\n print(len(i))\r\n", "def solve():\r\n n = int(input())\r\n wires = list(map(int, input().split()))\r\n shots = int(input())\r\n for shot in range(shots):\r\n wire_idx, bird_idx = map(int, input().split()) \r\n\r\n if wire_idx - 1 != 0:\r\n wires[wire_idx - 2] += bird_idx - 1 # left\r\n if wire_idx != n:\r\n wires[wire_idx] += wires[wire_idx - 1] - bird_idx #right\r\n wires[wire_idx - 1] = 0\r\n\r\n for out in wires:\r\n print(out)\r\nsolve()\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Sat Jan 12 12:16:38 2019\r\n\r\n@author: Noussa\r\n\"\"\"\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n x,y= map(int,input().split())\r\n x -= 1\r\n if x > 0:\r\n a[x-1] += y - 1\r\n if x < len(a) - 1:\r\n a[x+1] += a[x] - y\r\n a[x] = 0\r\n \r\nfor i in a:\r\n print(i)", "n = int(input())\na = list(map(int, input().split()))\n\nm = int(input())\nfor i in range(m):\n x, y = list(map(int, input().split()))\n\n left = y-1\n right = a[x-1]-y\n\n if x-1 != 0:\n a[x-2] += left\n\n if x-1 != n-1:\n a[x] += right\n\n a[x-1] = 0\n\nfor i in range(n):\n print(a[i])\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\nm = int(input())\r\n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n\r\n if x != 0:\r\n a[x-1] += y - 1\r\n \r\n if x != n-1:\r\n a[x + 1] += a[x] - y\r\n \r\n a[x] = 0\r\n\r\nfor i in a:\r\n print(i)", "n = input()\r\nbirds = list(map(int, input().strip().split()))\r\nbirds.append(0)\r\nbirds.insert(0,0)\r\nm = int(input())\r\nl = len(birds)\r\nfor i in range(m):\r\n x, y = map(int, input().strip().split())\r\n birds[x - 1] = birds[x - 1] + (y - 1)\r\n birds[x+1] += (birds[x] - y)\r\n birds[x] = 0\r\nfor i in range(1,l-1):\r\n print(birds[i])", "# https://codeforces.com/contest/294/problem/A\r\nn = int(input())\r\nbirds = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if n == 1:\r\n birds[0] = 0\r\n break\r\n\r\n if x == 0:\r\n birds[x + 1] = birds[x + 1] + (birds[x] - y)\r\n birds[x] = 0\r\n elif x == n - 1:\r\n birds[x - 1] += (y - 1)\r\n birds[x] = 0\r\n else:\r\n birds[x - 1] = birds[x - 1] + (y - 1)\r\n birds[x + 1] = birds[x + 1] + (birds[x] - y)\r\n birds[x] = 0\r\n\r\nfor i in birds:\r\n print(i)\r\n", "k=input()\r\nx=list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n m,n=input().split()\r\n m=int(m)\r\n n=int(n)\r\n if m==len(x):\r\n x[m-2]+=n-1\r\n x[m-1]=0\r\n elif m-1==0:\r\n x[m]+=x[m-1]-n\r\n x[m-1]=0\r\n else:\r\n x[m-2]+=n-1\r\n x[m]+=x[m-1]-n\r\n x[m-1]=0\r\nfor i in x:\r\n print(i)", "n = int(input())\r\nl1 = list(map(int,input().split()))\r\n\r\nn2 = int(input())\r\n\r\nl = []\r\nfor i in range(n2):\r\n l2 = list(map(int,input().split()))\r\n l.append(l2)\r\n\r\n \r\nfor i in l:\r\n if i[0] == n:\r\n l1[n-2] += i[1] - 1\r\n l1[n-1] = 0\r\n \r\n elif i[0] == 1:\r\n l1[1] += l1[0] - i[1]\r\n l1[0] = 0\r\n \r\n else:\r\n l1[i[0]] += l1[i[0]-1] - i[1]\r\n l1[i[0]-2] += i[1] - 1\r\n l1[i[0]-1] = 0\r\n \r\n \r\n \r\nfor i in l1:\r\n print(i)\r\n ", "i=int(input())\r\nl=list(map(int,input().split()))\r\nfor _ in range(int(input())):\r\n\t# print(l)\r\n\tn,k=map(int,input().split())\r\n\tif n-2>=0:\r\n\t\tl[n-2]+=k-1\r\n\tif n<i:\r\n\t\tl[n]+=l[n-1]-k\r\n\tl[n-1]=0\r\nfor x in l:\r\n\tprint(x)", "n=int(input())\r\na=list(map(int, input().split()) )\r\nm=int(input())\r\nfor i in range(0,m):\r\n x,y=list(map(int, input().split()))\r\n if x !=1 : a[x-2]+= y-1 \r\n if x != (len(a)) : a[x]+= a[x-1]-y\r\n a[x-1]=0\r\n \r\nfor i in (a):\r\n\r\n print(i)\r\n", "from sys import stdin\r\nreadlist = lambda: list(map(int,stdin.readline().split()))\r\nreadint = lambda: int(stdin.readline())\r\n\r\nn=readint()\r\na = [0] + readlist() + [0]\r\n\r\nfor i in range(readint()):\r\n x , y = readlist()\r\n a[x-1] += y-1\r\n a[x+1] += a[x]-y\r\n a[x]=0\r\n\r\nprint(\"\\n\".join(map(str,a[1:n+1])))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\np=[]\r\nfor i in range(m):\r\n\tw=list(map(int,input().split()))\r\n\tp.append(w)\r\nfor i in range(m):\r\n\tr=p[i][0]\r\n\tt=l[r-1]-p[i][1]\r\n\tif r<n:\r\n\t\tl[r]=l[r]+t\r\n\tl[r-1]=0\r\n\tif r-2>=0:\r\n\t\tl[r-2]=l[r-2]+p[i][1]-1\r\nfor i in range(len(l)):\r\n\tprint(l[i])", "nOLine =int(input())\r\nn = input().split(\" \")\r\nnOBird =[int(i) for i in n]\r\nnOShots = int(input())\r\n\r\nwhile nOShots > 0:\r\n shot = input().split(\" \")\r\n x = int(shot[0]) - 1 # to convert to index\r\n y = int(shot[1])\r\n if nOLine > 1:\r\n if x > 0:\r\n nOBird[x - 1] += y-1\r\n if x < nOLine -1 :\r\n nOBird[x+1] += nOBird[x] - y\r\n nOBird[x] = 0\r\n \r\n nOShots -=1\r\n \r\nfor i in nOBird:\r\n print(i)", "n=int(input())\r\nbirds_on=list(map(int,input().split()))\r\nnum_shot=int(input())\r\nfor i in range(num_shot):\r\n a,b=map(int,input().split())\r\n i=a-1\r\n if i!= 0:\r\n birds_on[i-1] += b-1\r\n if i != len(birds_on)-1:\r\n birds_on[i+1] += (birds_on[i]-b)\r\n birds_on[i]=0\r\nfor i in birds_on:\r\n print(i)", "n = int(input())\na = [int(i) for i in input().split()]\nm = int(input())\nfor i in range(m):\n x , y = [int(j) for j in input().split()]\n if x < n:\n a[x] += a[x - 1] - y\n\n if x - 2 >= 0:\n a[x - 2] += y - 1\n\n a[x - 1] = 0\n\nfor j in range(n):\n print(a[j]) \n \t \t \t\t \t \t \t\t \t\t \t\t", "N = int(input())\r\nwires = [int(i) for i in input().split(\" \")]\r\nM = int(input())\r\nfor j in range(M):\r\n tow_num = input().split(\" \")\r\n X,Y = int(tow_num[0]) - 1,int(tow_num[1])\r\n if X != 0:\r\n wires[X - 1]+=Y - 1\r\n if X != N - 1:\r\n wires[X + 1]+=wires[X] - Y\r\n wires[X] = 0\r\nfor k in wires:\r\n print(k)\r\n", "from sys import stdin\r\n\r\nn = int(stdin.readline().rstrip())\r\nl = list(map(int,stdin.readline().split()))\r\nm = int(stdin.readline().rstrip())\r\nfor i in range(m):\r\n\ta,b = map(int,stdin.readline().split())\r\n\ta=a-1\r\n\ttotal = l[a]\r\n\tleft = b-1\r\n\tright = total-b\r\n\tl[a]=0\r\n\tif a!=0:\r\n\t\tl[a-1] = l[a-1]+left\r\n\tif a!=n-1:\r\n\t\tl[a+1] = l[a+1]+right\r\nfor i in l:\r\n\tprint(i)", "if __name__ == '__main__':\r\n n = int(input())\r\n aa = list(map(int, input().split()))\r\n m = int(input())\r\n for _ in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if x:\r\n aa[x - 1] += y - 1\r\n if n - x - 1:\r\n aa[x + 1] += aa[x] - y\r\n aa[x] = 0\r\n for i in range(n):\r\n print(aa[i])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n t=l[x-1]-y\r\n l[x-1]=0\r\n if x-2>=0:\r\n l[x-2]+=y-1\r\n if x!=n:\r\n l[x]+=t\r\nprint(l,sep=\"\\n\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tx=x-1\r\n\tif n==1:\r\n\t\ta[0]=0\r\n\t\tbreak\r\n\tif x==0:\r\n\t\ta[x+1]+=a[x]-y\r\n\t\ta[x]=0\r\n\telif x==n-1:\t\r\n\t\ta[x-1]+=y-1\r\n\t\ta[x]=0\r\n\telse:\r\n\t\ta[x-1]+=y-1\r\n\t\ta[x+1]+=a[x]-y\r\n\t\ta[x]=0\r\nprint(a,sep='\\n')", "import sys\n\nn = int(input())\na = list(map(int, input().split()))\nm = int(input())\nfor _ in range(m):\n wire, left = [int(x) - 1 for x in input().split()]\n right = a[wire] - left - 1\n a[wire] = 0\n if wire != 0:\n a[wire - 1] += left\n if wire != n - 1:\n a[wire + 1] += right\nprint(a, sep=\"\\n\")\n", "number_of_wires = int(input())\r\nlist_of_birds = list(map(int,input().split())) # this is the list of birds for each wire\r\nnumber_of_shots = int(input())\r\n\r\nlist_of_shots_per_wire = list()\r\nfor i in range(number_of_shots):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if x > 0:\r\n list_of_birds[x-1] += y - 1\r\n if x < number_of_wires - 1:\r\n list_of_birds[x + 1] += list_of_birds[x] - y\r\n list_of_birds[x] = 0\r\n\r\nfor i in list_of_birds:\r\n print(i)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nwhile m>0:\r\n x,y=list(map(int,input().split()))\r\n if x-2>=0:\r\n a[x-2]+=y-1\r\n if x<n:\r\n a[x]+=(a[x-1]-y)\r\n a[x-1]=0\r\n m-=1\r\nfor i in a:\r\n print(i)\r\n ", "n = int(input())\na = [int(i) for i in input().split()]\nm = int(input())\nwhile m:\n x,y = input().split()\n x = int(x)-1\n y = int(y)\n if x!=0:\n a[x-1] += y-1\n if x<n-1:\n a[x+1] += a[x]-y\n a[x] = 0\n m -= 1\nfor i in range(n):\n print(a[i])\n\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().strip().split()))\r\n\r\nm = int(input())\r\n\r\nfor i in range (m):\r\n shoot=list(map(int, input().strip().split()))\r\n l = shoot[1]-1\r\n r = a[shoot[0]-1]-shoot[1]\r\n if(shoot[0] != 1):\r\n a[shoot[0]-2] += l\r\n if(shoot[0] != n):\r\n a[shoot[0]] += r\r\n a[shoot[0]-1] = 0\r\n\r\n[print(i) for i in a]", "l=int(input())\r\nres = list(input().split())\r\nres=list(map(int,res))\r\nl2=int(input())\r\na=[]\r\nfor i in range(l2):\r\n a1,a2=input().split()\r\n a1=int(a1)\r\n a2=int(a2)\r\n if(a1>1):res[a1-2]+=a2-1\r\n if(a1<l):res[a1]+= res[a1-1]-a2\r\n res[a1-1]=0\r\nfor j in range(len(res)):\r\n print(res[j])\r\n \r\nsum=1\r\n\r\n\r\n#l=list(map(int, input().split()))\r\n#l.sort()\r\n#print(min(sum_n1_1,sum_n1_0)+min(sum_n2_1,sum_n2_0))'''", "n = int(input())\r\narr = list(map(int, input().split(\" \")))\r\nr = int(input())\r\n\r\nwhile r > 0:\r\n r -= 1\r\n x, y = list(map(int, input().split(\" \")))\r\n left = y - 1\r\n right = arr[x-1] - y\r\n arr[x-1] = 0\r\n if x-1 == 0 and x == n:\r\n continue\r\n elif x-1 == 0:\r\n arr[x] += right\r\n elif x == n:\r\n arr[x-2] += left\r\n else:\r\n arr[x] += right\r\n arr[x - 2] += left\r\n\r\nfor x in arr:\r\n print(x)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tc=l[x-1]\r\n\tif x-2>=0:\r\n\t\tl[x-2]+=y-1\r\n\tif x<=n-1:\r\n\t\tl[x]+=c-y\r\n\tl[x-1]=0\r\nfor i in range(n):\r\n\tprint(l[i])", "\"\"\"li = list(map(int,input().split(\" \")))\r\ni=1\r\nwhile True:\r\n li[0]=li[0]3\r\n li[1]=li[1]2\r\n if(li[0]>li[1]):\r\n print(i)\r\n break\r\n i=i+1\r\n\"\"\"\r\nwn = int(input())\r\nli =list(map(int,input().split(\" \")))\r\nn = int(input())\r\nop=list()\r\ni=0\r\nwhile i<n:\r\n op.append(list(map(int,input().split(\" \"))))\r\n i=i+1\r\ni=0\r\n\r\nwhile i<n:\r\n wire =li[op[i][0]-1]\r\n lb = abs(op[i][1]-1)\r\n \r\n rb = abs(wire -op[i][1])\r\n \r\n li[op[i][0]-1]=0\r\n \r\n if(op[i][0]-2>=0):\r\n \r\n li[op[i][0]-2]=li[op[i][0]-2]+lb\r\n \r\n if(op[i][0]<wn):\r\n li[op[i][0]]=li[op[i][0]]+rb\r\n \r\n i=i+1\r\ni=0\r\nwhile i<wn:\r\n print(li[i])\r\n i=i+1 \r\n \r\n \r\n \r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Sat Jul 23 11:57:40 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 21 - CF294-DIV2A\r\n\"\"\"\r\n\r\nwires = int(input())\r\nbirdNums = list(map(int,input().split()))\r\nshots = int(input())\r\nfor i in range(shots):\r\n wire, bird = map(int,input().split())\r\n if wire != 1:\r\n birdNums[wire-2] += bird-1\r\n if wire != wires:\r\n birdNums[wire] += birdNums[wire-1]-bird\r\n birdNums[wire-1] = 0\r\nfor i in range(len(birdNums)):\r\n print(birdNums[i])", "n = int(input())\nwires = input().split()\nfor i in range(n):\n wires[i] = int(wires[i])\nshots = int(input())\nfor i in range(shots):\n shot = input().split()\n for j in range(2):\n shot[j] = int(shot[j]) - 1\n wires[shot[0]] -= 1\n if shot[0] > 0:\n wires[shot[0] - 1] += shot[1]\n if shot[0] < n - 1:\n wires[shot[0] + 1] += wires[shot[0]] - shot[1]\n wires[shot[0]] = 0\nfor wire in wires:\n print(wire)\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nm = int(input())\r\nlst.append(0)\r\nlst.insert(0,0)\r\n\r\nfor i in range(1,m+1):\r\n x,y = list(map(int, input().split()))\r\n \r\n lst[x-1] += (y-1)\r\n lst[x+1] += lst[x]-y\r\n lst[x] = 0\r\n \r\nfor i in range(1,n+1):\r\n print(lst[i])", "num =int(input())\narr = list(map(int,input().split()))\nkilled = int(input())\ndata_killed=[]\nfor _ in range(killed):\n x,y=map(int,input().split())\n data_killed.append((x,y))\n\nfor x,y in data_killed:\n if x<num: \n arr[x] += (arr[x-1]-y)\n if (x-2)>=0: \n arr[x-2]+= (y-1)\n arr[x-1] = 0\n\nfor x in arr:\n print(x)", "n = int(input())\r\nbirds = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nwhile m:\r\n x, y = map(int, input().split())\r\n x -= 1\r\n \r\n left = len(range(1, y))\r\n right = len(range(y+1, birds[x]+1))\r\n birds[x] = 0\r\n \r\n if x-1 >= 0:\r\n birds[x-1] += left\r\n if x+1 < n:\r\n birds[x+1] += right\r\n\r\n m -= 1\r\n\r\nfor bird in birds:\r\n print(bird)", "n=int(input())\r\nstr=input()\r\nbrids=str.split( \" \")\r\nfor i in range(0,len(brids)):\r\n brids[i]=int(brids[i])\r\nm=int(input())\r\nfor i in range(0,m):\r\n x,y=map(int,input().split(\" \"))\r\n x-=1\r\n if (x!=0):\r\n brids[x-1]+=y-1\r\n if (x!=n-1):\r\n brids[x+1]+=brids[x]-y\r\n brids[x]=0\r\n\r\nfor i in brids:\r\n print(i)", "z=input;\r\nn=int(z())\r\nl=list(map(int,z().split()))\r\nfor i in range(int(z())):\r\n a,b=map(int,z().split())\r\n if a!=n:l[a]=l[a]+abs(l[a-1]-(b))\r\n if a!=1:l[a-2]=l[a-2]+b-1\r\n l[a-1]=0\r\nprint(l)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nfor _ in range(m):\r\n s = input().split()\r\n xi, yi = int(s[0])-1, int(s[1])-1\r\n if xi-1 >= 0: a[xi-1] += yi\r\n if xi+1 < n: a[xi+1] += (a[xi]-yi-1)\r\n a[xi] = 0\r\nfor ai in a:\r\n print(ai)\r\n", "n,data=int(input()),list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n x,y=map(int,input().split())\r\n if x==n: data[x - 2] = data[x - 2] + y - 1\r\n elif x==1: data[x] = data[x] + data[x - 1] - y\r\n else:\r\n data[x - 2] = data[x - 2] + y - 1\r\n data[x] = data[x] + data[x - 1] - y\r\n data[x - 1] = 0\r\nfor i in data : print(i)\r\n", "def main():\r\n number_of_wires = int(input())\r\n birds = list(map(int, input().split()))\r\n birds_in_each_wire = {i:birds[i-1] for i in range(1, number_of_wires + 1)}\r\n shots = [tuple(map(int, input().split())) for i in range(int(input()))]\r\n\r\n def oskols(birds_in_each_wire, shots):\r\n for shot in shots:\r\n wire, died_bird = shot\r\n nbirds = birds_in_each_wire[wire]\r\n birds_in_each_wire[wire] = 0\r\n if wire + 1 in birds_in_each_wire:\r\n birds_in_each_wire[wire + 1] += nbirds - died_bird\r\n if wire - 1 in birds_in_each_wire:\r\n birds_in_each_wire[wire - 1] += nbirds - (nbirds - died_bird + 1)\r\n\r\n return birds_in_each_wire\r\n the_left_oskols = oskols(birds_in_each_wire, shots)\r\n for bird in the_left_oskols.values():\r\n print(bird)\r\n\r\nif __name__ == '__main__':\r\n main()", "import collections\r\nimport heapq\r\nfrom re import X\r\nimport sys\r\nimport math\r\nimport itertools\r\nimport bisect\r\nfrom io import BytesIO, IOBase\r\nimport os\r\n######################################################################################\r\n#--------------------------------------funs here-------------------------------------#\r\n######################################################################################\r\ndef values(): return tuple(map(int, sys.stdin.readline().split()))\r\ndef inlsts(): return [int(i) for i in sys.stdin.readline().split()]\r\ndef inp(): return int(sys.stdin.readline())\r\ndef instr(): return sys.stdin.readline().strip()\r\ndef words(): return [i for i in sys.stdin.readline().strip().split()]\r\ndef chars(): return [i for i in sys.stdin.readline().strip()]\r\n######################################################################################\r\n#--------------------------------------code here-------------------------------------#\r\n######################################################################################\r\ndef solve():\r\n n = inp()\r\n l=inlsts()\r\n m=inp()\r\n for i in range(m):\r\n x,y=values()\r\n x-=1\r\n if x-1>=0: l[x-1]+=y-1\r\n if x+1<n: l[x+1]+=l[x]-y\r\n l[x]=0\r\n for i in l: print (i)\r\n \r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(inp()):\r\n solve()\r\n", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nn = int(input())\r\nbirds = [int(x) for x in input().split()]\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n lst = [int(x) for x in input().split()]\r\n x = lst[0]\r\n y = lst[1]\r\n x -= 1\r\n\r\n if x != 0:\r\n birds[x-1] += y-1\r\n\r\n if x != len(birds)-1:\r\n birds[x+1] += birds[x]-y\r\n birds[x] = 0\r\n\r\nfor item in birds:\r\n print(item)\r\n \r\n", "n = int(input())\nv = [int(i) for i in input().split()]\n\nq = int(input())\nfor qq in range(q):\n w, x = map(int, input().split())\n w -= 1\n\n if w != 0:\n v[w-1] += x-1\n if w != n-1:\n v[w+1] += v[w]-x\n v[w] = 0\n\nfor i in range(n):\n print(v[i])\n", "wrs = int(input())\nbds = list(map(int, input().split(\" \")))\ndct = {}\nfor i in range(wrs):\n dct[i+1] = bds[i]\nsts = int(input())\nfor i in range(sts):\n st = list(map(int, input().split(\" \")))\n wr = st[0]\n bd = st[1]\n if max(dct.keys()) == 1:\n dct[wr] = 0\n elif wr == 1:\n dct[wr + 1] = dct[wr + 1] + (dct[wr] - bd)\n dct[wr] = 0\n elif wr == max(dct.keys()):\n dct[wr - 1] = dct[wr - 1] + (bd - 1)\n dct[wr] = 0\n else:\n dct[wr + 1] = dct[wr + 1] + (dct[wr] - bd)\n dct[wr - 1] = dct[wr - 1] + (bd-1)\n dct[wr] = 0\nfor each in dct.values():\n print(each)", "i=lambda:[map(int,input().split())]\r\nn=i()[0];a=[0]+i()+[0]\r\nfor _ in[0]i()[0]:x,y=i();a[x-1]+=y-1;a[x+1]+=a[x]-y;a[x]=0\r\nprint(a[1:n+1],sep='\\n')", "n = int(input())\r\nwires = list(map(int, input().split()))\r\nshots = int(input())\r\n\r\nfor i in range(shots):\r\n inp = list(map(int,input().split()))\r\n x = inp[0] -1\r\n if x != 0:\r\n wires[x - 1] += inp[1] - 1\r\n if x != (len(wires)-1):\r\n wires[x+1] += wires[x] - inp[1]\r\n wires[x] = 0\r\n\r\nfor wire in wires:\r\n print(wire)", "def shot_one( initial_bird, shot_position ):\r\n x = shot_position[0]\r\n y = shot_position[1]\r\n bird_at_x = (initial_bird[x-1])\r\n initial_bird[x-1] = 0\r\n\r\n if x-1 != 0:\r\n initial_bird[x-2] += (y-1)\r\n if x != len(initial_bird):\r\n initial_bird[x] += bird_at_x - y\r\n\r\n return initial_bird\r\n\r\n\r\ndef shot_all( initial_bird, shot_coordinate ):\r\n for shot_position in shot_coordinate:\r\n intial_bird = shot_one( initial_bird, shot_position )\r\n return initial_bird\r\n\r\n\r\n# PROGRAM UTAMA\r\n\r\nn = int(input())\r\ninitial_bird = input()\r\ninitial_bird = initial_bird.split(' ')\r\nbird_wire = []\r\nfor bird in initial_bird:\r\n bird_wire.append(int(bird))\r\n\r\n\r\nm = int(input())\r\nshot_coordinate = []\r\nfor i in range(m):\r\n masukan = input()\r\n masukan = masukan.split(' ')\r\n shot_coordinate.append(( int(masukan[0]), int(masukan[1]) ))\r\n\r\n\r\nbird_wire = shot_all(bird_wire,shot_coordinate)\r\n\r\nfor bird in bird_wire:\r\n print(bird)\r\n\r\n", "# LUOGU_RID: 101474003\n(n,), a, _, t = [[(map(int, s.split()))] for s in open(0)]\r\nfor x, y in t:\r\n if x >= 2:\r\n a[x - 2] += y - 1\r\n if x < n:\r\n a[x] += a[x - 1] - y\r\n a[x - 1] = 0\r\nprint(a, sep='\\n')\r\n", "input()\r\nwires_num=input().split(' ')\r\nwires=[]\r\nwires.append(0)\r\nfor wire in wires_num:\r\n wires.append(int(wire))\r\nwires.append(0)\r\nfor i in range(0,int(input())):\r\n op=input().split(\" \")\r\n w_n=int(op[0])\r\n o_n=int(op[1])\r\n c=wires[w_n]\r\n \r\n wires.pop(w_n)\r\n wires.insert(w_n,0)\r\n \r\n a=wires[w_n-1]\r\n wires.pop(w_n-1)\r\n wires.insert(w_n-1,a+o_n-1)\r\n\r\n b=wires[w_n+1]\r\n wires.pop(w_n+1)\r\n wires.insert(w_n+1,b+c-o_n)\r\nwires.pop(0)\r\nwires.pop(-1)\r\nfor wire in wires:\r\n print(wire)\r\n \r\n", "def birds(a, shots):\r\n for shot in shots:\r\n if shot[0] - 1 > 0:\r\n a[shot[0] - 2] += shot[1] - 1\r\n if shot[0] < len(a):\r\n a[shot[0]] += a[shot[0] - 1] - shot[1]\r\n a[shot[0] - 1] = 0\r\n return a\r\n \r\n \r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nshots = []\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n shots.append((x, y))\r\nresult = birds(a, shots)\r\nfor num in result:\r\n print(num)", "w=int(input())\r\n\r\nenv=list(map(int,input().split()))\r\n\r\n \r\nshot=int(input())\r\nfor i in range(shot):\r\n w,dead=map(int,input().split())\r\n w-=1\r\n l= env[w]-dead\r\n r=dead-1\r\n env[w]=0 \r\n if w != len(env)-1:\r\n env[w+1]+=l\r\n if w!=0:\r\n env[w-1]+=r\r\n\r\nfor i in env:\r\n print(i)\r\n", "n = int(input())\na = [int(v) for v in input().split()]\nm = int(input())\nfor _ in range(m):\n x, y = [int(v) for v in input().split()]\n ai = a[x - 1]\n a[x - 1] = 0\n if x != 1:\n a[x - 2] += y - 1\n if x != n:\n a[x] += ai - y\nfor ai in a:\n print(ai)\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n if x != 1:\r\n a[x-2] += y - 1\r\n if x != n:\r\n a[x] += a[x-1] - y \r\n a[x-1] = 0\r\nfor i in a:\r\n print(i)", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int,input().split())\r\n up = y - 1\r\n down = a[x-1] - y\r\n a[x-1] = 0\r\n if x != 1:\r\n a[x-2] += up\r\n if x != n:\r\n a[x] += down\r\n\r\nprint(a, sep='\\n')\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n \r\n\r\n \r\n if x > 1:\r\n l[x-2] += y-1\r\n if x < n:\r\n l[x] += l[x-1] - y\r\n l[x-1] = 0\r\n\r\nfor i in l:\r\n print(i)\r\n\r\n", "n = int(input())\r\nwires = list(map(int, input().split()))\r\nfor _ in range(int(input())):\r\n\tx, y = map(int, input().split())\r\n\tleft = y - 1\r\n\tright = wires[x - 1] - y\r\n\twires[x - 1] = 0\r\n\tif x - 2 >= 0:\r\n\t\twires[x - 2] += left\r\n\tif len(wires) > x:\r\n\t\twires[x] += right\r\n\r\nfor i in wires:\r\n\tprint(i)\r\n", "n = int(input())\r\nq = list(map(int, input().split()))\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n x, y = [int(x) for x in input().split()]\r\n x-=1\r\n if x!= 0:\r\n q[x-1]+= y-1\r\n if x != n-1:\r\n q[x+1] += q[x]-y\r\n q[x]=0\r\nfor i in range(n):\r\n print(q[i])\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nfor _ in range(int(input())):\r\n x,y = map(int,input().split())\r\n if n == 1:\r\n arr[0] = 0\r\n elif x > 1 and x < n:\r\n arr[x-2] += y-1\r\n arr[x] += arr[x-1]-y\r\n arr[x-1] = 0\r\n elif x == 1:\r\n arr[x] += arr[x-1] - y\r\n arr[x-1] = 0\r\n else:\r\n arr[x-2] += y-1\r\n arr[x-1] = 0\r\nfor i in arr:\r\n print(i)", "n=int(input())\r\nith=[int(z) for z in input().split()]\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=[int(z) for z in input().split()]\r\n if x-2>=0:\r\n ith[x-2]+=y-1\r\n if x!=n:\r\n ith[x]+=ith[x-1]-y\r\n ith[x-1]=0\r\nfor i in ith:\r\n print(i)", "n = int(input())\r\nu = list(map(int , input().split()))\r\n\r\nw = int(input())\r\n\r\nfor i in range(w):\r\n m = list(map(int,input().split()))\r\n m[0] -= 1\r\n\r\n\r\n if m[0] != 0:\r\n u[m[0]-1] += m[1]-1\r\n\r\n if m[0] != n-1:\r\n u[m[0]+1] += u[m[0]] - m[1]\r\n\r\n u[m[0]] = 0\r\nfor j in u:\r\n print(j)\r\n\r\n\r\n\r\n", "noofboxes = int (input())\r\nleneachbox = list(map(int,input().split()))\r\nnoofmoves = int(input())\r\n\r\nfor i in range(noofmoves):\r\n x , y = map(int,input().split())\r\n x-=1\r\n if x != 0:\r\n leneachbox[x - 1] += y - 1\r\n\r\n if x != noofboxes - 1:\r\n leneachbox[x + 1] += leneachbox[x] - y\r\n\r\n leneachbox[x] = 0\r\n\r\nfor i in leneachbox:\r\n print(i)\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\nm = int(input())\r\nx = []\r\ny = []\r\n\r\nfor _ in range(m):\r\n\ttmp1, tmp2 = map(int, input().split())\r\n\tx.append(tmp1)\r\n\ty.append(tmp2)\r\n\r\nfor i in range(m):\r\n\tleft = y[i] - 1\r\n\tright = a[x[i] - 1] - y[i] \r\n\t# (x[i] - 1) index of the line we are at. For example if x = 2, then we need to be on the second line, which is at index 1. (2 - 1 = 1).\r\n\t\r\n\ta[x[i] - 1] = 0\r\n\r\n\tif x[i] - 2 >= 0:\r\n\t\ta[x[i] - 2] += left\r\n\r\n\tif x[i] <= n - 1:\r\n\t\ta[x[i]] += right\r\n\r\nfor i in a:\r\n\tprint(i)\r\n\r\n", "n = int(input()) \r\na = [ int(i) for i in input().split() ]\r\nm = int(input())\r\n\r\nfor _ in range(m) : \r\n xy = [ int(i) for i in input().split() ]\r\n x = xy[0]\r\n y = xy[1]\r\n birdnum = x-1\r\n left = y - 1 \r\n right = a[birdnum] - y \r\n a[birdnum]= a[birdnum] - left - right - 1\r\n if birdnum-1 >= 0 :\r\n a[birdnum-1] = a[birdnum-1] + left\r\n if birdnum + 1 < n : \r\n a[birdnum+1] = a[birdnum+1] + right \r\n \r\n\r\nfor i in a :\r\n print(i)\r\n ", "n=int(input())\r\nx=input().split()\r\nm=int(input())\r\nj=0\r\nh=0\r\nl=[]\r\nfor t in x:\r\n q=int(t)\r\n l.append(q)\r\nfor i in range(m):\r\n z=input().split()\r\n c=l[int(z[0])-1]\r\n b=int(z[0])-1\r\n \r\n \r\n for i in range(c+1):\r\n if i<int(z[1]):\r\n j+=1\r\n \r\n \r\n elif i>=int(z[1]):\r\n h+=1\r\n if b+1>=n:\r\n l[b-1]+=j-1\r\n l[b]+=h-1\r\n else:\r\n \r\n l[b-1]+=j-1\r\n l[b+1]+=h-1\r\n if b-1==-1:\r\n l[-1]-=j-1\r\n #elif z[0]==\r\n \r\n j=0\r\n h=0\r\n l[b]=0\r\n \r\nfor i in l:\r\n print(i)\r\n \r\n \r\n ", "n = int(input())\r\nai = [int(x) for x in input().split()]\r\nm = int(input())\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n right = ai[x - 1] - y\r\n left = y - 1\r\n if x - 2 >= 0:\r\n ai[x - 2] += left\r\n if x <= n - 1:\r\n ai[x] += right\r\n ai[x - 1] = 0\r\n\r\nfor a in ai:\r\n print(a)", "# 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\nm=int(input())\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tif x<n:\r\n\t\ta[x]+=a[x-1]-y\r\n\tif x>1:\r\n\t\ta[x-2]+=y-1\r\n\ta[x-1]=0\r\nfor i in range(n):\r\n\tprint(a[i])\t", "n = int(input())\r\nwires = list(map(int, input().split()))\r\nshots = int(input())\r\n\r\nfor i in range(shots):\r\n x,y = map(int, input().split())\r\n birds = wires[x-1]\r\n if birds == 0:\r\n continue\r\n left = y - 1\r\n right = birds - y\r\n if x !=1:\r\n wires[x-2]+= left\r\n if x!= len(wires):\r\n wires[x]+= right\r\n wires[x-1] = 0\r\n\r\n \r\nfor i in wires:\r\n print(i)\r\n ", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\nwirec = inp()\r\nwires = inlt()\r\nshotc = inp()\r\n\r\nfor i in range(shotc):\r\n lt = inlt()\r\n wirei = lt[0] - 1\r\n birdi = lt[1]\r\n if wirei != 0:\r\n wires[wirei - 1] += birdi - 1\r\n if wirei != wirec - 1:\r\n wires[wirei + 1] += wires[wirei] - birdi\r\n wires[wirei] = 0\r\n\r\n[print(count) for count in wires]\r\n\r\n", "def chance(wires, shots):\r\n for wire, bird in shots:\r\n if wire < len(wires):\r\n wires[wire] += wires[wire-1]-bird\r\n if wire > 1:\r\n wires[wire-2] += bird-1\r\n wires[wire-1] = 0\r\n return wires\r\n\r\nn = int(input())\r\nwires = list(map(int, input().split(' ')))\r\nm = int(input())\r\nshots = []\r\nfor i in range(m):\r\n shots.append(list(map(int, input().split(' '))))\r\nwires = chance(wires, shots)\r\n\r\nfor wire in wires:\r\n print(wire)\r\n", "a = int(input())\r\nbirds = [int(x) for x in input().split()]\r\nsh = int(input())\r\nfor i in range(sh):\r\n y = [int(y) for y in input().split()]\r\n x = y[0]-1\r\n if x != 0:\r\n birds[x-1] += y[1] - 1\r\n if x != a-1:\r\n birds[x+1] += birds[x] - y[1]\r\n birds[x] = 0\r\nfor bird in birds:\r\n print(bird)", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor _ in range(int(input())):\r\n x,y=map(int,input().split())\r\n if x<n and x>0:\r\n a[x]+=a[x-1]-y\r\n if x>1:\r\n a[x-2]+=y-1\r\n if x>0:\r\n a[x-1]=0\r\nfor i in a:\r\n print(i)\r\n", "#!/usr/bin/python3\r\n\r\n\r\ndef main():\r\n\r\n _ = input()\r\n birds = list(map(int, input().split()))\r\n shots = int(input())\r\n\r\n for num in range(shots):\r\n wire, bird = map(int, input().split())\r\n # send birds up\r\n if wire - 2 >= 0:\r\n birds[wire-2] += bird - 1\r\n # send birds down\r\n if wire <= len(birds)-1:\r\n birds[wire] += birds[wire-1] - bird\r\n birds[wire-1] = 0\r\n\r\n for num_birds in birds:\r\n print(num_birds)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\nn = int(input())\n\na = list(map(int,input().split())) # 10 10 10 10 10\nm = int(input())\n\nfor i in range(m):\n x, y = map(int,input().split())\n\n temp = a[x-1]\n\n if x-2 >= 0:\n a[x-2] += y-1\n\n if x <= len(a)-1:\n a[x] += (temp - y)\n\n a[x-1] = 0\n\nfor x in a:\n print(x)\n \t\t\t\t \t \t \t \t\t\t \t \t\t\t \t", "n = int(input())\r\narr = list(map(int,input().split(' ')))\r\nm = int(input())\r\n#all birds that fly away will be at 0 or n+1 row.\r\narr.insert(0,0)\r\narr.append(0)\r\n\r\nfor i in range(m):\r\n x,y = map(int,input().split(' '))\r\n arr[x-1] += y-1\r\n arr[x+1] += arr[x] - y\r\n arr[x]=0\r\n\r\nfor i in arr[1:n+1]:\r\n print(i)\r\n\r\n\r\n\r\n", "n=int(input())\r\nv=[int(x) for x in input().split()]\r\nm=int(input())\r\nwhile m:\r\n x,y=map(int,input().split())\r\n x-=1\r\n if(x>0):\r\n v[x-1]+=y-1\r\n if(x<n-1):\r\n v[x+1]+=v[x]-y\r\n v[x]=0\r\n m-=1\r\nfor i in v:\r\n print(i)", "w=int(input())\r\nb=list(map(int,input().split()))\r\ns=int(input())\r\nfor x in range(s):\r\n i,k=input().split()\r\n i=int(i)-1\r\n k=int(k)\r\n r=b[i]-k\r\n l=k-1\r\n if (i-1)>=0:\r\n b[i-1]+=l\r\n if (i+1)<=(w-1):\r\n b[i+1]+=r\r\n b[i]=b[i]-l-r-1\r\nfor x in b:\r\n print(x)\r\n", "w = int(input())\r\nwires = list(map(int, input().split()))\r\nn = int(input())\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if x - 1 > -1:\r\n wires[x - 1] += y - 1\r\n if x + 1 < w:\r\n wires[x + 1] += wires[x] - y\r\n\r\n wires[x] = 0\r\n # print(wires)\r\nfor j in range(w):\r\n print(wires[j])", "n=int(input())\r\nb=input().split()\r\nfor i in range(n):\r\n\tb[i]=int(b[i])\r\nm=int(input())\r\nfor i in range(m):\r\n\tx,y=input().split()\r\n\tx=int(x)\r\n\ty=int(y)\r\n\tif x-2>=0:\r\n\t\tb[x-2]+=y-1\r\n\tif x<n:\r\n\t\tb[x]+=b[x-1]-y\r\n\tb[x-1]=0\r\nfor i in range(n):\r\n\tprint(b[i])", "n = int(input())\r\ntotal = list(map(int, input().split()))\r\nshots = int(input())\r\nfor i in range(shots):\r\n wire, bird = map(int, input().split())\r\n wire -= 1\r\n if wire == n - 1:\r\n total[wire - 1] += bird - 1\r\n total[wire] = 0\r\n continue\r\n total[wire + 1] += total[wire] - bird\r\n if wire == 0:\r\n total[wire] = 0\r\n continue\r\n total[wire - 1] += bird - 1\r\n total[wire] = 0\r\n\r\nfor j in range(n):\r\n print(total[j])\r\n", "n=int(input())\r\na=list(map(int,input().strip().split(\" \")))\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=input().strip().split(\" \")\r\n x,y=[int(x),int(y)]\r\n if x-2>=0:\r\n a[x-2]+=(y-1)\r\n if x<=(n-1):\r\n a[x]+=(a[x-1]-y)\r\n a[x-1]=0\r\nfor j in a:\r\n print(j)\r\n \r\n", "from sys import stdin\r\n\r\nm=int(stdin.readline())\r\na = list(map(int,stdin.readline().split()))\r\na.insert(0,0)\r\na.append(0)\r\nn = int(stdin.readline())\r\nfor i in range(n):\r\n x , y = map(int,stdin.readline().split())\r\n a[x-1] += y-1\r\n a[x+1] += a[x]-y\r\n a[x]=0\r\n\r\nfor j in range(1,m+1):\r\n print(a[j])\r\n", "n = int(input())\r\nbirds = list(map(int , input().split()))\r\nfor t in range(int(input())) :\r\n wire_index , bird_index = map(int , input().split())\r\n wire_index -=1\r\n \r\n res = birds[wire_index] \r\n birds[wire_index] = 0\r\n \r\n if wire_index != n-1:\r\n birds[wire_index+1] += res-bird_index\r\n if wire_index != 0 :\r\n birds[wire_index-1] += bird_index-1\r\n \r\nprint(birds , sep = \"\\n\")\r\n \r\n ", "n = int(input())\r\nbirds = list(map(int,input().split()))\r\nshots = int(input())\r\n\r\nfor i in range(shots):\r\n wire,bird = map(int,input().split())\r\n wire -= 1\r\n \r\n if wire-1 >= 0:\r\n birds[wire-1] += bird - 1\r\n if wire+1 < n:\r\n birds[wire+1] += birds[wire] - bird\r\n birds[wire] = 0\r\n\r\nprint(birds,sep='\\n')", "n=int(input())\nwires=list(input().split(\" \"))\nfor i in range(n):\n wires[i]=int(wires[i])\n \nm=int(input())\n\nfor i in range(m):\n x,y=map(int,input().split(\" \"))\n x=x-1\n\n left=max((x-1),0)\n right=min((x+1),n-1)\n \n wires[right]=wires[right]+(wires[x]-y) \n wires[left]=wires[left]+(max(y-1,0))\n \n wires[x]=0\n \nfor i in wires:\n print(i)", "#%% 294a Shaass and Oskols \r\n\r\ninp = lambda : [map(int,input().split())]\r\nn = int(input())\r\na = inp()\r\na = [0] + a + [0]\r\nfor x,y in [inp() for _ in range(int(input()))]:\r\n a[x-1] += y - 1\r\n a[x+1] += a[x] - y\r\n a[x] = 0\r\nprint('\\n'.join([map(str,a[1:n+1])] ) )", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n x=x-1\r\n if len(a)==1:\r\n a[0]=0\r\n continue\r\n if x>0 and x<len(a)-1:\r\n a[x+1]=a[x+1]+a[x]-y\r\n a[x-1]=a[x-1]+y-1\r\n a[x]=0\r\n elif x==0:\r\n a[x+ 1] = a[x + 1] + a[x] - y\r\n a[x]=0\r\n else:\r\n a[x - 1] = a[x - 1] + y - 1\r\n a[x]=0\r\nfor i in a:\r\n print(i)", "n=int(input())\r\nparsa=list(map(int,input().split()))\r\nq=int(input())\r\nfor i in range(q):\r\n a,b=map(int,input().split())\r\n a-=1\r\n r=parsa[a]-b\r\n c=b-1\r\n if a-1>=0:\r\n parsa[a-1]+=c\r\n if a+1<n:\r\n parsa[a+1]+=r\r\n parsa[a]=0\r\nfor i in range(n):\r\n print(parsa[i])\r\n ", "z=input;\r\nn=int(z())\r\nl=list(map(int,z().split()))\r\nm=int(z())\r\nfor i in range(m):\r\n a,b=map(int,z().split())\r\n left=b-1\r\n right=abs(l[a-1]-(b))\r\n if a!=n:\r\n l[a]=l[a]+right\r\n if a!=1:\r\n l[a-2]=l[a-2]+left\r\n l[a-1]=0\r\n \r\nprint(l)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nnn = int(input())\r\nfor i in range(nn) :\r\n a,b = map(int,input().split())\r\n\r\n a -= 1\r\n\r\n if a != 0 :\r\n l[a-1] += b-1\r\n if a != len(l) - 1 :\r\n l[a+1] += l[a] - b\r\n\r\n l[a] = 0\r\n\r\nfor i in l :\r\n print(i)", "n = int(input())\r\nl = [0]\r\nl = l+list(map(int, input().split()))\r\nl = l+[0]\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n if x==1:\r\n l[x+1] = l[x+1]+(l[x]-y)\r\n l[x] = 0\r\n elif x==n:\r\n l[x-1] = l[x-1]+(y-1)\r\n l[x] = 0\r\n else:\r\n a = l[x]-1-(y-1)-(l[x]-y)\r\n b = l[x-1]+(y-1)\r\n c = l[x+1]+(l[x]-y)\r\n l[x] = a\r\n l[x+1] = c\r\n l[x-1] = b\r\n\r\nfor i in range(1,n+1):\r\n print(l[i])", "n = int(input())\r\na = []\r\na = list(map(int, input().split()))\r\na.append(0)\r\na.insert(0,0)\r\nt = int(input())\r\nfor i in range(0,t):\r\n x,y = map(int, input().split())\r\n y -= 1\r\n l = y\r\n r = a[x]-y-1\r\n a[x-1] += l\r\n a[x+1] += r\r\n a[x] = 0\r\n\r\nfor i in range(1,n+1):\r\n print(a[i])", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nm = int(input())\r\na = list()\r\nfor i in range(m):\r\n a1 = [int(j) for j in input().split()]\r\n if a1[0] < n:\r\n lst[a1[0]] = lst[a1[0]] + lst[a1[0] - 1] - a1[1]\r\n if a1[0] > 1:\r\n lst[a1[0] - 2] = lst[a1[0] - 2] + a1[1] - 1\r\n lst[a1[0] - 1] = 0\r\nfor elem in lst:\r\n print(elem)\r\n", "n = int(input())\r\n\r\nar = [int(x) for x in input().split()]\r\nar.insert(0,0)\r\nar.append(0)\r\n# print(ar)\r\nm = int(input())\r\nfor i in range(0,m):\r\n x,y = map(int, input().split())\r\n # print(x,y,ar[x-1],ar[x],ar[x+1])\r\n ar[x-1]+=y-1\r\n ar[x + 1] += ar[x]-y\r\n ar[x]=0\r\nfor i in ar[1:n+1]:\r\n print(i)", "a=int(input())\r\np=list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n x,y=map(int,input().split())\r\n if x>1:p[x-2]+=y-1\r\n if x<a:p[x]+=p[x-1]-y\r\n p[x-1]=0\r\nprint(p,sep=\"\\n\")\r\n\r\n\r\n# My code says who am i\r\n# I want to burn and born at this way\r\n# In my eye there is not any things Except love ...", "\"\"\"Shaass and Oskols\"\"\"\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n y -= 1\r\n if x - 1 >= 0:\r\n arr[x - 1] += y\r\n if x + 1 < len(arr):\r\n arr[x + 1] += arr[x] - y - 1\r\n arr[x] = 0\r\nfor k in arr:\r\n print(k)\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Sat Sep 4 01:19:07 2021\r\n\r\n@author: Kevin Chang\r\n\r\nProject: Codeforces Problem 294A\r\n\r\n\"\"\"\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\n\r\ndef shoot(a):\r\n x, y = map(int, input().split())\r\n if x > 1:\r\n a[x-2] += y-1\r\n if x < len(a):\r\n a[x] += a[x-1]-y\r\n a[x-1] = 0\r\n return a \r\n\r\nfor _ in range(m):\r\n a = shoot(a)\r\n\r\nprint(\"\\n\".join(list(map(str, a))))", "n = int(input())\r\nwires = list(map(int,input().split()))\r\nb = int(input())\r\nfor i in range(b):\r\n bird = list(map(int,input().split()))\r\n \r\n if bird[0] < n:\r\n wires[bird[0]] += (wires[bird[0]-1] - bird[1])\r\n if bird[0] > 0 and bird[0]-2 >= 0:\r\n wires[bird[0]-2] += bird[1] - 1\r\n wires[bird[0]-1] = 0\r\n\r\nfor i in wires:\r\n print(i)", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(int(input())):\r\n index, pos = list(map(int, input().split()))\r\n index = index-1\r\n if index-1 >= 0:\r\n a[index-1] += (pos-1)\r\n if index+1 < n: \r\n a[index+1] += (a[index]-pos)\r\n a[index] = 0 \r\n\r\n\r\nprint(a,sep=\"\\n\") \r\n \r\n \r\n", "n = int(input())\r\na = list(map(int , input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x , y = map(int , input().split())\r\n x -= 1\r\n if(x - 1 >= 0):\r\n a[x - 1] += y - 1\r\n if(x + 1 < len(a)):\r\n a[x + 1] += a[x] - y\r\n a[x] = 0\r\nprint(a , sep = '\\n')", "def INT():\r\n return int(input())\r\n\r\ndef lis():\r\n return [int(x) for x in input().split()]\r\n \r\nn=INT()\r\na = lis()\r\nm = INT()\r\nfor i in range(m):\r\n x,y=lis()\r\n if x==1:\r\n if n!=1:\r\n a[x]+=a[x-1]-y\r\n a[x-1]=0\r\n elif x==n:\r\n if n!=1:\r\n a[x-2]+=(y-1)\r\n a[x-1]=0\r\n else:\r\n a[x-2]+=(y-1)\r\n a[x]+=a[x-1]-y\r\n a[x-1]=0\r\n #print(a)\r\nfor i in range(n):\r\n print(a[i])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nfor i in range(m):\r\n wire , bird = [int(j) for j in input().split()]\r\n if wire < n:\r\n a[wire] += a[wire - 1] - bird\r\n\r\n if wire - 2 >= 0:\r\n a[wire - 2] += bird - 1\r\n\r\n a[wire - 1] = 0\r\n\r\nfor j in range(n):\r\n print(a[j]) ", "x=int(input())\r\na= list(map(int, input().split()))\r\nq= int(input())\r\ns=[]\r\nh=[]\r\nm= 0\r\nt= 0\r\n\r\nfor p in range(q):\r\n k = list(map(int, input().split()))\r\n s.append(k)\r\n\r\nif x==1 :\r\n if q==1 :\r\n print(\"0\")\r\n else:\r\n print(a[0])\r\n\r\nelse:\r\n\r\n for t in range(q):\r\n r = s[t][0]\r\n d = s[t][1]\r\n h.append(r)\r\n s[t] = d\r\n for i in h:\r\n i = i - 1\r\n if i == 0:\r\n a[i + 1] = a[i + 1] + (a[i] - s[m])\r\n a[i] = 0\r\n m += 1\r\n elif i == (x - 1):\r\n a[i - 1] = a[i - 1] + (a[i] - (a[i] - s[m])) - 1\r\n a[i] = 0\r\n m += 1\r\n else:\r\n a[i + 1] = a[i + 1] + (a[i] - s[m])\r\n a[i - 1] = a[i - 1] + (a[i] - (a[i] - s[m])) - 1\r\n a[i] = 0\r\n m += 1\r\n\r\n for j in (a):\r\n print(j)\r\n", "x = int(input())\r\narr = [map(int, input().split())]\r\nq = int(input())\r\nfor _ in range(q):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n if a > 0:\r\n arr[a-1] += b-1\r\n if a < x-1:\r\n arr[a+1] += arr[a]-b\r\n arr[a] = 0\r\nfor line in arr:\r\n print(line)\r\n", "n=int(input())\r\nliste=list(map(int, input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n temp=list(map(int, input().split()))\r\n if(temp[0]<n):\r\n liste[temp[0]]+=liste[temp[0]-1]-temp[1]\r\n\r\n if(temp[0]>1):\r\n \r\n liste[temp[0]-2]+=temp[1]-1\r\n liste[temp[0]-1]=0\r\nfor elm in liste:\r\n print(elm)\r\n", "n,branches = int(input()),list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(m) :\r\n x,y = (map(int,input().split()))\r\n if x-2 >= 0:\r\n branches[x-2] += y-1\r\n\r\n if x < n:\r\n branches[x] += branches[x-1] - y\r\n branches[x-1] =0\r\n\r\nfor i in branches :\r\n print(i)\r\n\r\n", "n = int(input())\r\nbirds_on_wire = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n\r\n if x > 0:\r\n birds_on_wire[x-1] += y-1\r\n if x < n-1:\r\n birds_on_wire[x+1] += birds_on_wire[x] - y\r\n\r\n birds_on_wire[x] = 0\r\n\r\nfor birds in birds_on_wire:\r\n print(birds)\r\n", "input()\r\nbirds = list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n ip = input().split()\r\n x = int(ip[0])-1\r\n y = int(ip[1])-1\r\n down = birds[x] - y -1\r\n up = (y-1)+1\r\n birds[x]-=1+down+up\r\n if x-1>=0:\r\n birds[x-1]+=up\r\n if x+1<len(birds):\r\n birds[x+1]+=down\r\nfor i in birds:\r\n print(i)", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nshots = int(input())\r\n\r\nfor shot in range(shots):\r\n\twire, y = map(int, input().split())\r\n\r\n\tcurrent_birds = arr[wire - 1]\r\n\tif wire - 2 >= 0:\r\n\t\tarr[wire-2] += y - 1 \r\n\tif wire < len(arr):\r\n\t\tarr[wire] += (current_birds - y)\r\n\tarr[wire -1] = 0\r\n\r\n\r\nfor i in arr:\r\n\tprint(i)", "n = int(input())\r\nstart = [x for x in map(int,input().split())]\r\nm = int(input())\r\nplayground = [0 for x in range(n+2)]\r\nfor i in range(n):\r\n playground[i+1] += start[i]\r\nfor i in range(m):\r\n wire, bird = map(int, input().split())\r\n playground[wire-1] += bird - 1\r\n playground[wire+1] += playground[wire] - bird #- 1\r\n playground[wire] = 0\r\nfor item in playground[1:-1]:\r\n print(item)", "numOfBox = int(input())\r\nnumOfBirds = input()\r\nnumOfBirds = numOfBirds.split(\" \")\r\nnumOfShot=int(input())\r\nfor i in range(numOfShot):\r\n z=input()\r\n z=z.split(\" \")\r\n x = int(z[0])-1\r\n y = int(z[1])\r\n maxB=int(numOfBirds[x])\r\n if x==0 and x==numOfBox-1:\r\n numOfBirds[x]=\"0\"\r\n break\r\n elif x==0:\r\n right=maxB-y\r\n r = int(numOfBirds[x+1])+right\r\n numOfBirds[x+1]=str(r)\r\n elif x==numOfBox-1:\r\n left=y-1 \r\n r = int(numOfBirds[x-1])+left\r\n numOfBirds[x-1]=str(r)\r\n else:\r\n right=maxB-y\r\n r = int(numOfBirds[x+1])+right\r\n numOfBirds[x+1]=str(r)\r\n left=y-1 \r\n r = int(numOfBirds[x-1])+left\r\n numOfBirds[x-1]=str(r)\r\n \r\n numOfBirds[x]=\"0\"\r\n\r\nprint(\" \".join(numOfBirds)) \r\n \r\n \r\n ", "x = int(input())\r\na = list(map(int,input().split()))\r\nr = int(input())\r\nz = []\r\nfor i in range(r):\r\n\ta1 = list(map(int,input().split())) \r\n\tif a1[0] <x:\r\n\t\ta[a1[0]] = a[a1[0]]+a[a1[0]-1] - a1[1]\r\n\tif a1[0] > 1:\r\n\t\ta[a1[0]-2] = a[a1[0]-2]+a1[1]-1\r\n\ta[a1[0]-1] = 0\r\nfor i in range(x):\r\n\t\tprint(a[i])", "n, g, m = int(input()), list(map(int, input().split())), int(input())\r\nfor i in range(m):\r\n x, y = map(lambda x: int(x) - 1, input().split())\r\n if x != 0: g[x-1] += y\r\n if x != n-1: g[x+1] += g[x] - y - 1\r\n g[x] = 0\r\nfor c in g: print(c)", "n=int(input())\r\na=[0]+list(map(int, input().split()))+[0]\r\nfor i in range(int(input())):\r\n x,y=map(int, input().split())\r\n a[x+1]+=a[x]-y\r\n a[x-1]+=y-1\r\n a[x]=0\r\nfor i in range(n):\r\n print(a[i+1])", "n=int(input())\r\nx = [int(i) for i in input().split()]\r\nm = int(input())\r\nfor i in range(m):\r\n\ty = [int(j) for j in input().split()]\r\n\tbirdsleft = y[1] - 1\r\n\tbirdsright = x[y[0]-1] - birdsleft - 1\r\n\t# print(\"b: \",birdsleft,birdsright)\r\n\tif(y[0] - 1 > 0 ):\r\n\t\tx[y[0]-2] += birdsleft\r\n\tif(y[0] + 1 <= n):\r\n\t\tx[y[0]] += birdsright\r\n\tx[y[0]-1]=0\r\nfor i in range(n):\r\n\tprint(x[i])", "n = int(input())\r\na = list(map(int,input().split()))\r\na.insert(0,0)\r\na.append(0)\r\nm = int(input())\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n a[x+1] += a[x] - y\r\n a[x] = 0\r\n a[x-1] += (y - 1)\r\n \r\na.pop()\r\na.pop(0)\r\nprint (a)", "n = int(input())\na = [0]\na.extend(map(int, input().split()))\na.append(0)\n\nm = int(input())\nfor _ in range(m):\n x, y = map(int, input().split())\n a[x - 1] += y - 1\n a[x + 1] += a[x] - y\n a[x] = 0\n\nprint(a[1:-1], sep='\\n')\n", "n= int(input())\r\nb= [int(x) for x in input().split()]\r\nm= int(input())\r\n\r\nd={}\r\nfor i in range(1, n+1):\r\n d[i]=b[i-1]\r\n\r\nfor i in range(1, m+1):\r\n x,y = input().split()\r\n x,y= int(x), int(y)\r\n left= y-1\r\n right= d[x]-y\r\n d[x]=0\r\n if x-1 in d:\r\n d[x-1]+=left\r\n if x+1 in d:\r\n d[x+1]+=right\r\n\r\nfor key in d:\r\n print(d[key])\r\n", "num= input()\r\nn=int(num)\r\nls = list(map(int, input().split()))\r\nk=int(input())\r\nfor z in range(0, k):\r\n a, y = map(int, input().split())\r\n a -= 1\r\n if a < n - 1:\r\n ls[a + 1] += ls[a] - y\r\n if a > 0:\r\n ls[a - 1] += y - 1\r\n ls[a] = 0\r\nprint(ls, sep='\\n')\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nwhile(m>0):\r\n\tb,c=list(map(int,input().split()))\r\n\tq=c-1\r\n\tif(b!=1):\r\n\t\ta[b-2]=a[b-2]+q\r\n\tif(b!=n):\r\n\t\ta[b]=a[b]+a[b-1]-c\r\n\ta[b-1]=0\r\n\tm-=1\r\nfor i in range(n):\r\n\tprint(a[i])", "n = int(input())\r\nl = list(map(int, input().split()))\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n\r\n if a < n:\r\n l[a] += l[a-1] - b\r\n if a - 2 >= 0:\r\n l[a-2] += b-1\r\n l[a - 1] = 0\r\nfor i in l:\r\n print(i)", "import sys\r\n \r\nn=input()\r\nq=list(int(n) for n in input().split())\r\nm=input()\r\nfor i in range(0,int(m)):\r\n a,b=input().split()\r\n o=int(a)\r\n k=int(b)\r\n if int(o)!=1:\r\n q[o-2]=q[o-2]+(k-1)\r\n if int(o)!=int(n):\r\n q[o]=q[o]+(q[o-1]-k)\r\n q[o-1]=0\r\nfor j in range(0,int(n)):\r\n print(q[j])", "def solve(n, a, m, pairs):\n for x, y in pairs:\n x -= 1\n if x > 0:\n a[x - 1] += (y - 1)\n if x < n - 1:\n a[x + 1] += a[x] - y\n a[x] = 0\n for i in a: print(i)\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n m = int(input())\n pairs = [map(int, input().split()) for _ in range(m)]\n solve(n, a, m, pairs)\n\n\nmain()\n", "#x = 3\r\n#y = 13\r\n#m = 5\r\n#n = no. of wires \r\n#s = no. of birds on each wire 22 10 10 10 10\r\nn = int(input())\r\ns = list(map(int,input().split()))\r\nm = input()\r\n\r\n\r\nfor i in range(int(m)):\r\n x,y = map(int,input().split())\r\n x-= 1\r\n\r\n if x > 0:\r\n s[x - 1] += y -1 \r\n if x < n-1:\r\n s[x+1] += s[x] - y\r\n s[x] = 0 \r\nfor f in s:\r\n print(f)", "n = int(input())\nalist = input().strip().split(' ')\nalist = [int(a) for a in alist]\nm = int(input())\n\nfor i in range(m):\n xy = input().strip().split()\n x = int(xy[0])-1\n y = int(xy[1])\n if x!=0:\n alist[x-1] += y-1\n if x!=n-1:\n alist[x+1] += alist[x]-y\n alist[x] = 0\n\nfor i in range(n):\n print(alist[i])\n ", "n = int(input())\nwires = [int(x) for x in input().split()]\nm = int(input())\nfor i in range(m):\n x, y = map(int, input().split())\n x = x - 1\n left = y - 1\n right = wires[x] - y\n up = x - 1\n down = x + 1\n wires[x] = 0\n if up >= 0:\n upperWire = wires[up]\n wires[up] = upperWire + left\n if down < n:\n downerWire = wires[down]\n wires[down] = downerWire + right\nfor w in wires:\n print(w)", "n=int(input())\r\nl=[0]+list(map(int,input().split()))+[0]\r\nm=int(input())\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n l[a+1]+=l[a]-b\r\n l[a]=0\r\n l[a-1]+=b-1\r\n \r\nfor i in range(n):\r\n print(l[i+1])", "n = int(input())\r\nwires = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1 # adjusting index to 0-based\r\n if x > 0:\r\n wires[x-1] += y-1\r\n if x < n-1:\r\n wires[x+1] += wires[x] - y\r\n wires[x] = 0\r\n\r\nfor wire in wires:\r\n print(wire)\r\n", "n=int(input())\r\nbird= [int(_) for _ in input().split()] \r\ns= int(input())\r\nfor i in range(s):\r\n y,x= [int(_) for _ in input().split()]\r\n #print (y,x)\r\n y-=1\r\n cbrd=bird[y]\r\n if y-1!=-1:\r\n bird[y-1]+=x-1\r\n if y+1!=n:\r\n bird[y+1]+=bird[y]-x\r\n bird[y]=0\r\nfor j in range(n):\r\n print(bird[j])", "n = int(input())\na = [int(i) for i in input().split()]\nt = int(input())\nfor _ in range(t):\n x, y = [int(i) for i in input().split()]\n cur = x-1\n prev = x-2\n nxt = x\n if prev>=0:\n a[prev] += y-1\n if nxt<len(a):\n a[nxt] += a[cur]-y\n a[cur] = 0\nfor e in a:\n print(e)\n ", "n = int(input())\r\n\r\nbirds = list(map(int,input().split()))\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n index, bird_no = map(int,input().split())\r\n index-=1\r\n \r\n right = birds[index] - bird_no\r\n left = bird_no - 1\r\n birds[index] = 0\r\n if(index -1 >=0):\r\n birds[index -1] += left\r\n if(index +1 < len(birds)):\r\n birds[index +1] += right\r\n\r\nfor bird in birds:\r\n print(bird)\r\n\r\n", "n = int(input())\r\narr = [None] + list(map(int, input().split()))\r\nt = int(input())\r\nfor i in range(t):\r\n temp = list(map(int, input().split()))\r\n try:\r\n arr[temp[0] + 1] += arr[temp[0]] - temp[1]\r\n except:\r\n pass\r\n finally:\r\n arr[temp[0]] -= arr[temp[0]] - temp[1]\r\n try:\r\n arr[temp[0] - 1] += arr[temp[0]] - 1\r\n except:\r\n pass\r\n finally:\r\n arr[temp[0]] = 0\r\n\r\nfor i in range(1, len(arr)):\r\n print(arr[i])\r\n", "from math import \r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n x-=1\r\n if (x!=0):\r\n a[x-1] +=(y-1)\r\n if (x!=n-1):\r\n a[x+1] +=(a[x]-y)\r\n a[x] = 0\r\nfor i in a:\r\n print(i)", "n, = map(int, input().split())\nA = list(map(int, input().split()))\nm, = map(int, input().split())\nfor _ in range(m):\n x,y = map(int, input().split())\n up = y-1\n down = A[x-1] - up -1\n A[x-1] = 0\n if x-2 >= 0:\n A[x-2] += up\n if x < n:\n A[x] += down\n\nfor a in A:\n print(a)\n", "n = int(input())\r\na = [0]\r\na += list(map(int,input().split())) + [0]\r\nfor i in range(int(input())) :\r\n x,y = [int(i) for i in input().split()]\r\n a[x-1] += y - 1\r\n a[x+1] += a[x] - y\r\n a[x] = 0\r\nfor i in range(1,n+1) :\r\n print(a[i])", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\n\r\nfor i in range(m) :\r\n x , y = list(map(int,input().split()))\r\n if (x-2 >= 0) :\r\n a[x-2] += y-1\r\n if ( x < len(a) ):\r\n a[x] += a[x-1] - y\r\n\r\n a[x-1] = 0 \r\n\r\nfor i in range(len(a)) :\r\n print(a[i])\r\n\r\n \r\n\r\n ", "def birder(l1,l2,i):\r\n \r\n wire = l2[i][0]-1\r\n bird = l2[i][1]\r\n #print(\"WIRE\",wire)\r\n if wire==0:\r\n #print(\"HERE\")\r\n if len(l1)==1:\r\n l1[0]=0\r\n else: \r\n l1[1]+=l1[0]-bird\r\n l1[0]=0\r\n\r\n elif wire==len(l1)-1:\r\n #print(\"THERE\")\r\n l1[-2]+=bird-1\r\n l1[-1]=0\r\n\r\n else:\r\n #print(\"ZERE\")\r\n l1[wire+1]+=l1[wire]-bird\r\n l1[wire-1]+=bird-1\r\n l1[wire]=0\r\n \r\n return l1\r\n\r\ndef solution(l1,n2,b):\r\n i=0\r\n while i<n2:\r\n l1=birder(l1,b,i)\r\n i+=1\r\n i=0\r\n c_out=\"\"\r\n #print(n2,i)\r\n while i<len(l1):\r\n print(l1[i])\r\n i+=1\r\n \r\n\r\ndef answer():\r\n n = int(input())\r\n l1 = [int(x) for x in input().split()]\r\n n2 = int(input())\r\n b = []\r\n s = n2\r\n while n2:\r\n b.append([int(x) for x in input().split()])\r\n n2-=1\r\n n2=s\r\n solution(l1,n2,b)\r\n\r\nanswer()\r\n\r\n\r\n\r\n \r\n", "n = int(input())\r\nwires = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n wire, bird = map(int, input().split())\r\n\r\n if wire > 1:\r\n wires[(wire - 1) - 1] += bird - 1\r\n if wire < n:\r\n wires[(wire - 1) + 1] += wires[(wire - 1)] - bird\r\n wires[(wire - 1)] = 0\r\nprint(wires, sep='\\n')", "n = int(input())\r\nbirds = list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(1,m+1):\r\n x,y = map(int,input().split())\r\n x-=1\r\n if x !=0 :\r\n birds[x-1] += y - 1\r\n if x != n-1 :\r\n birds[x+1] += birds[x] - y\r\n \r\n birds[x]=0\r\nfor i in range(n):\r\n print(birds[i])", "n = int(input())\nbirds = list(map(int, input().split()))\nm = int(input())\n\nfor i in range(m):\n x, y = map(int, input().split())\n x -= 1 # convert 1-indexing to 0-indexing\n y -= 1 # convert 1-indexing to 0-indexing\n if x > 0:\n birds[x-1] += y\n if x < n-1:\n birds[x+1] += birds[x] - y - 1\n birds[x] = 0\n\nfor b in birds:\n print(b)\n\n\t \t\t\t\t \t \t \t\t \t \t \t\t\t \t\t\t \t \t", "#!/usr/bin/env python\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n N = int(wtf[0])\r\n A = list(map(int, wtf[1].split()))\r\n M = int(wtf[2])\r\n for t in wtf[3:]:\r\n x,y = map(int, t.split())\r\n x-=1\r\n if x-1 >= 0:\r\n A[x-1] += y-1\r\n if x+1 < N:\r\n A[x+1] += A[x]-y\r\n A[x] = 0\r\n print('\\n'.join(map(str, A)))\r\n", "n = int(input())\r\nv = [int(x) for x in input().split()]\r\nm = int(input())\r\nfor i in range(m):\r\n\tr, c = map(int, input().split())\r\n\tr -= 1;\r\n\t# count birds on left/right sides\r\n\tleft = c - 1\r\n\tright = v[r] - c\r\n\t# make birds fly away\r\n\tv[r] = 0\r\n\tif r - 1 >= 0:\r\n\t\tv[r-1] += left\r\n\tif r + 1 < n:\r\n\t\tv[r+1] += right\r\n\r\nfor i in v:\r\n\tprint(i)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor _ in range(int(input())):\r\n x,y=map(int,input().split())\r\n if x==1 and x==n:\r\n l[0]=0 \r\n elif x==1:\r\n l[x]+=(l[x-1]-y)\r\n elif x==n:\r\n l[x-2]+=(y-1)\r\n else:\r\n l[x]+=(l[x-1]-y)\r\n l[x-2]+=(y-1)\r\n l[x-1]=0\r\nfor i in l:\r\n print(i)\r\n ", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n x, y = [int(x) for x in input().split()]\r\n ly = max(0, y - 1)\r\n ry = a[x - 1] - y\r\n if x - 1 > 0:\r\n a[x - 2] += ly\r\n if x < n:\r\n a[x] += ry\r\n a[x - 1] = 0\r\n\r\nfor x in a:\r\n print(x)", "n = int(input())\r\nn_birds = list(map(int, input().split()))\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n [wire, position] = list(map(int, input().split()))\r\n if wire != 1:\r\n move_bird = position - 1\r\n n_birds[wire-2] += move_bird\r\n \r\n if wire != n:\r\n move_bird = n_birds[wire-1]-position\r\n n_birds[wire] += move_bird\r\n\r\n n_birds[wire-1] = 0\r\nfor i in n_birds:\r\n print(i)\r\n\r\n", "n=int(input())\r\nlt=list(input().split())\r\nD={-1:0,n:0}\r\nfor i in range(n):\r\n lt[i]=int(lt[i])\r\n D[i]=lt[i]\r\nm=int(input())\r\nwhile m!=0:\r\n m-=1\r\n k=list(input().split())\r\n a,b=int(k[0]),int(k[1])\r\n D[a-2]+=b-1\r\n D[a]+=D[a-1]-b\r\n D[a-1]=0\r\nfor i in range(n):\r\n print(D[i])\r\n", "n = int(input())\r\nnbw = input()\r\nnbw = list(str.split(nbw))\r\nnbw = [int(a) for a in nbw]\r\nm = int(input())\r\nfor i in range(m):\r\n cord = input()\r\n cord = list(str.split(cord))\r\n cord = [int(a) for a in cord]\r\n x = cord[0]\r\n y = cord[1]\r\n if ((x != n) and (x != 1)):\r\n nbw[x] += (nbw[x-1] - y)\r\n nbw[x-2] += (y-1)\r\n nbw[x-1] = 0\r\n elif x == n:\r\n nbw[x-2] += (y-1)\r\n nbw[x-1] = 0\r\n elif x == 1:\r\n nbw[x] += (nbw[x-1] - y)\r\n nbw[x-1] = 0\r\nfor _ in nbw:\r\n print(_)", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\n\r\nn = int(input())\r\nll = list(map(int, input().split()))\r\nq = int(input())\r\nfor i in range(q):\r\n x,y = map(int, input().split())\r\n wire = x-1\r\n bcurr = ll[wire]\r\n belft = y-1\r\n bright = ll[wire]-y\r\n if wire-1>=0:\r\n ll[wire-1]+=belft\r\n if wire+1<n:\r\n ll[wire+1]+=bright\r\n ll[wire]=0\r\nfor el in ll:\r\n print(el)", "n = int(input())\r\na = list(map(int,input().split()))\r\nk = int(input())\r\nfor i in range(k):\r\n\tp,q = list(map(int,input().split()))\r\n\tif(p==1 and (len(a)>1)):\r\n\t\ta[p] = a[p-1] - q + a[p]\r\n\t\ta[p-1] = 0\r\n\r\n\telif(p==1 and (len(a) == 1)):\r\n\t\ta[p-1] = 0\r\n\telif( p == len(a)):\r\n\t\ta[p-2] = a[p-2] + q - 1\r\n\t\ta[p-1] = 0\r\n\telse:\r\n\t\ta[p] = a[p-1] - q + a[p]\r\n\t\ta[p-2] = a[p-2] + q - 1\r\n\t\ta[p-1] = 0\r\n\r\nfor j in range(n):\r\n\tprint(a[j])\r\n\r\n", "n = int(input()) # number of wires\r\nbirds = list(map(int, input().split())) # initial number of birds on each wire\r\nm = int(input()) # number of shots\r\nshots = []\r\nfor _ in range(m):\r\n x, y = map(int, input().split()) # x: wire number, y: bird number\r\n shots.append((x, y))\r\nfor x, y in shots:\r\n left_wire = x - 1\r\n right_wire = x + 1\r\n \r\n # Update birds on left wire\r\n if left_wire >= 1:\r\n birds[left_wire - 1] += y - 1\r\n \r\n # Update birds on right wire\r\n if right_wire <= n:\r\n birds[right_wire - 1] += birds[x - 1] - y\r\n \r\n # Remove birds on current wire\r\n birds[x - 1] = 0\r\n# Print the number of birds on each wire\r\nfor num_birds in birds:\r\n print(num_birds)", "from sys import stdin\r\nfrom fractions import Fraction\r\n\r\nn = int(stdin.readline().strip())\r\nbirds = [int(x) for x in stdin.readline().strip().split(' ')]\r\nm = int(stdin.readline().strip())\r\ndead = []\r\n\r\nfor i in range(m):\r\n dead.append([int(x) for x in stdin.readline().strip().split(' ')])\r\n\r\n\r\ndef solution(birds, dead):\r\n for d in dead:\r\n x = d[0] - 1\r\n y = d[1]\r\n if x != 0:\r\n birds[x - 1] += y - 1\r\n\r\n if x != n - 1:\r\n birds[x + 1] += birds[x] - y\r\n\r\n birds[x] = 0\r\n\r\n return birds\r\n\r\n\r\ns = solution(birds, dead)\r\n\r\nfor x in s:\r\n print(x)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nfor cas in range(m):\r\n p, x = map(int, input().split())\r\n p -= 1\r\n if p > 0:\r\n a[p - 1] += x - 1\r\n if p < n - 1:\r\n a[p + 1] += a[p] - x\r\n a[p] = 0\r\nfor x in a:\r\n print(x)", "n = int(input())\n\ncnts = [-1] + list(map(int, input().split())) + [-1]\n\nm = int(input())\n\nS = []\n\nfor _ in range(m):\n x, y = map(int, input().split())\n ups = y - 1\n downs = cnts[x] - ups - 1\n cnts[x] = 0\n cnts[x-1] += ups\n cnts[x+1] += downs\n\n\nfor i in range(1, len(cnts) - 1):\n print(cnts[i])\n\n\n\n", "import sys\r\nfrom math import gcd\r\ndef inp() : return sys.stdin.readline().strip()\r\ndef get_ints(): return map(int, inp().split())\r\ndef get_arr(): return list(map(int, inp().split()))\r\ndef get_int(): return int(inp())\r\nn=get_int()\r\nos=get_arr()\r\nt=get_int()\r\nfor _ in range(t):\r\n x,y=get_ints()\r\n x-=1\r\n if(x-1>=0 and x+1<n): \r\n os[x-1]+=(y-1)\r\n os[x+1]+=(os[x]-y)\r\n elif(x-1<0 and x+1<n):\r\n os[x+1]+=(os[x]-y)\r\n elif(x-1>=0 and x+1>=n):\r\n os[x-1]+=(y-1)\r\n os[x]=0\r\nfor i in os:\r\n print(i)", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\nm=int(input())\r\nfor i in range(m):\r\n l,y=map(int,input().split())\r\n if(n==1):\r\n print(0)\r\n exit()\r\n elif(l==1):\r\n list[l]+=(list[l-1]-y)\r\n list[l-1]=0\r\n elif(l==n):\r\n list[l-2]+=(y-1)\r\n list[l-1]=0\r\n else:\r\n list[l-2]+=(y-1)\r\n list[l]+=(list[l-1]-y)\r\n list[l-1]=0\r\nfor i in range(n):\r\n print(list[i])", "n = int(input())\r\narr = list(map(int, input().split()))\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n if a != 0:\r\n arr[a-1] += b-1\r\n if a != n - 1:\r\n arr[a+1] += arr[a]-b\r\n arr[a] = 0\r\n\r\nprint(\"\\n\".join(map(str, arr)))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\n \r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n \r\n\r\nn=inp()\r\nT= inlt()\r\nshots = inp()\r\nfor i in range(shots):\r\n xi,yi=invr()\r\n xi-=1\r\n #birds to left\r\n if(xi!=0):\r\n T[xi-1]=T[xi-1]+(yi-1)\r\n #birds to right\r\n if(xi!=n-1):\r\n T[xi+1]=T[xi+1]+(T[xi]-yi)\r\n T[xi]=0\r\n \r\nfor i in T:\r\n print(i)", "def main():\r\n n = int(input())\r\n bs = list(map(int, input().split()))\r\n\r\n m = int(input())\r\n for _ in range(m):\r\n [w, b] = list(map(int, input().split()))\r\n w -= 1\r\n b -= 1\r\n\r\n if w > 0:\r\n bs[w - 1] += b\r\n\r\n if w < n - 1:\r\n bs[w + 1] += bs[w] - b - 1\r\n\r\n bs[w] = 0\r\n\r\n for b in bs:\r\n print(b)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor x in range(int(input())):\r\n\ta,b=map(int,input().split())\r\n\tif a-2>=0:l[a-2]+=b-1\r\n\tif a<n:l[a]+=l[a-1]-b\r\n\tl[a-1]=0\r\nfor x in l:print(x)", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nc = int(input())\r\nfor i in range(c):\r\n x,y = map(int,input().split())\r\n x-=1\r\n if (x != 0):\r\n lst[x - 1] += y - 1;\r\n if (x != n - 1):\r\n lst[x + 1] += lst[x] - y;\r\n lst[x] = 0;\r\nfor i in lst:\r\n print(i)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nfor _ in range(int(input())):\r\n i,p = map(int, input().split())\r\n if i - 2 >= 0:\r\n l[i - 2] += p - 1\r\n if i < n:\r\n l[i] += l[i-1] - p\r\n l[i-1] = 0\r\nfor x in l:\r\n print(x)", "n = int(input())\r\nwires = [0]#Adiciona um 0 e um n+1 elemento para não se preucupar com os extremos\r\n\r\nfor j in (input().split()):\r\n wires.append(int(j))\r\n\r\nwires.append(0)\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n\r\n E = y - 1\r\n D = wires[x] - y\r\n\r\n wires[x] = 0\r\n wires[x-1] += E\r\n wires[x+1] += D\r\n\r\nfor i in range(1, n + 1 ): #Não printa nem o 0 nem o n + 1, já que ele em tese não existem\r\n print(wires[i])\r\n", "if __name__ == '__main__':\r\n empt = input()\r\n pos = list(map(int,input().split()))\r\n\r\n shots = int(input())\r\n for _ in range(shots):\r\n a,b = list(map(int,input().split()))\r\n a-=1\r\n b-=1\r\n\r\n\r\n if a<len(pos)-1:\r\n pos[a+1]+=pos[a]-b-1\r\n if a>0:\r\n pos[a-1]+=b\r\n pos[a]=0\r\n\r\n for i in pos:\r\n print(i)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=int(input())\r\nfor i in range(t):\r\n x,y=map(int,input().split())\r\n if(x==1):\r\n if(x<n):\r\n l[x]+=l[x-1]-y\r\n l[x-1]=0\r\n elif(x==n):\r\n l[x-2]+=y-1\r\n l[x-1]=0\r\n else:\r\n l[x-2]+=y-1\r\n l[x]+=l[x-1]-y\r\n l[x-1]=0\r\nfor i in l:\r\n print(i)\r\n", "INP = lambda : map(int, input().split())\r\nn = int(input())\r\na = [INP()]\r\nfor i in range(int(input())):\r\n x, y = INP()\r\n if x > 1: a[x-2] += y-1\r\n if x < n: a[x] += a[x-1]-y\r\n a[x-1] = 0\r\nfor bird in a:\r\n print(bird)", "t = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nc = int(input())\r\n\r\nfor i in range(c):\r\n a, b = map(int, input().split())\r\n\r\n current = arr[a-1]\r\n\r\n left = b - 1\r\n right = current - b\r\n\r\n if a != 1:\r\n arr[a-2] = arr[a-2] + left\r\n\r\n if a != len(arr):\r\n arr[a] = arr[a] + right\r\n\r\n arr[a-1] = 0\r\n\r\nfor i in arr:\r\n print(i)", "n= int(input())\na=[int(i) for i in input().split()]\nm=int(input())\nwhile m:\n x,y=input().split()\n x=int(x)-1\n y=int(y)\n if x!=0:\n a[x-1]+= y-1\n if x<n-1:\n a[x+1]+=a[x]-y\n a[x]=0\n m-=1\nfor i in range(n):\n print(a[i])\n\n\n \t \t\t \t \t \t\t \t\t \t \t \t", "n = int(input())\r\nin_list = [int(x) for x in input().split()]\r\nquery = int(input())\r\n\r\nfor q in range(query):\r\n line,pos = map(int,input().split())\r\n\r\n if line-2>=0:\r\n in_list[line-2]+= pos-1\r\n if line < n:\r\n in_list[line]=in_list[line]+in_list[line-1]-pos\r\n in_list[line-1] = 0\r\nfor birds in in_list:\r\n print(birds)\r\n", "p = int(input())\r\nprov = [int(i) for i in input().split()]\r\nk = int(input())\r\no = 1\r\nfor i in range(k):\r\n n, m = map(int, input().split())\r\n n -= 1\r\n if p == 1:\r\n print(0)\r\n o = 0\r\n elif n == 0:\r\n prov[n + 1] += prov[n] - m\r\n prov[n] = 0\r\n elif n == p - 1:\r\n prov[n - 1] += m - 1\r\n prov[n] = 0\r\n else:\r\n prov[n - 1] += m - 1\r\n prov[n + 1] += prov[n] - m\r\n prov[n] = 0\r\nif o == 1:\r\n for i in range(p):\r\n print(prov[i])", "r=int(input())\nl=[int(x) for x in input().split()]\nk=int(input())\nfor i in range(k):\n f,s=[int(x) for x in input().split()]\n if f==len(l):\n l[f-2]+=s-1\n l[f-1]=0\n elif f==1:\n l[f]+=l[f-1]-s\n l[f-1]=0\n else: \n l[f]+=l[f-1]-s\n l[f-2]+=s-1\n l[f-1]=0\nfor t in l:\n print(t)\n \t \t\t\t\t \t\t\t \t \t\t\t\t", "n = int(input())\r\nA = [int(a) for a in input().split(sep=' ')]\r\nm = int(input())\r\n\r\nfor i in range(0, m):\r\n x, y = [int(a) for a in input().split(sep=' ')]\r\n x -= 1\r\n if x > 0:\r\n A[x-1] += y-1\r\n if x < len(A)-1:\r\n A[x+1] += (A[x] - y) \r\n A[x] = 0\r\n\r\nfor a in A:\r\n print(a)\r\n\r\n\r\n", "\r\nn=int(input())\r\nw=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n x-=1\r\n if x>0:\r\n w[x-1]+=y-1\r\n if x<n-1:\r\n w[x+1]+=w[x]-y\r\n w[x]=0\r\nfor i in range(n):\r\n print(w[i])", "num = int(input())\r\nlist0 = [int(i) for i in input().split()]\r\nnum0 = int(input())\r\nlist1 = []\r\nfor i in range(num0):\r\n x = [int(i) for i in input().split()]\r\n list1.append(x)\r\nfor i in list1:\r\n i[0] -= 1\r\nfor i in list1:\r\n if i[0] == num - 1:\r\n list0[i[0]] -= (list0[i[0]] - i[1] + 1)\r\n else:\r\n list0[i[0]+1] += list0[i[0]] - i[1]\r\n list0[i[0]] -= (list0[i[0]] - i[1] + 1)\r\n if i[0] == 0:\r\n list0[i[0]] -= i[1] - 1\r\n else:\r\n list0[i[0]-1] += i[1] - 1\r\n list0[i[0]] -= i[1] - 1\r\nfor i in list0:\r\n print(i)", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nbirds = list(map(int, sys.stdin.readline().split()))\r\nfor i in range(int(sys.stdin.readline())):\r\n x, y = map(int, sys.stdin.readline().split())\r\n x = x - 1\r\n if x >= 1:\r\n birds[x - 1] += (y - 1)\r\n if x < (n - 1):\r\n birds[x + 1] += (birds[x] - y)\r\n birds[x] = 0\r\nfor bird in range(n):\r\n print(birds[bird])\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nfor _ in range(m):\r\n x,y=list(map(int,input().split()))\r\n x=x-1\r\n if(len(a)==1):\r\n a[0]=0\r\n else:\r\n if(x==0):\r\n a[x+1]+=a[x]-y\r\n a[x]=0\r\n elif(x==len(a)-1):\r\n a[x]=0\r\n a[x-1]+=y-1\r\n else:\r\n a[x-1]+=y-1\r\n a[x+1]+=a[x]-y\r\n a[x]=0\r\n #print(a[x-1],a[x+1])\r\nfor i in a:\r\n print(i)\r\n", "n = int(input())\r\nbirds = list(map(int,input().split()))\r\nt =int(input())\r\nfor i in range(t):\r\n x,y = map(int,input().split())\r\n x-=1\r\n go_right = birds[x]-y\r\n go_left = birds[x]-go_right-1\r\n birds[x]=0\r\n ## go left\r\n if x>=1:\r\n birds[x-1]+=go_left\r\n if x<n-1:\r\n birds[x+1]+=go_right\r\nprint(birds,sep='\\n')\r\n", "num_of_wires = int(input())\r\nnum_of_birds = [int(x) for x in input().split(\" \")]\r\nnum_shot = int(input())\r\nfor i in range(num_shot):\r\n inpt1 = [int(x) for x in input().split(\" \")]\r\n \r\n wire = inpt1[0] - 1\r\n ind = inpt1[1] - 1\r\n temp = num_of_birds[wire]\r\n num_of_birds[wire] = 0\r\n if wire - 1 >= 0:\r\n left_sum = ind\r\n num_of_birds[wire-1] += left_sum\r\n \r\n try:\r\n right_sum = temp - ind - 1\r\n num_of_birds[wire+1] += right_sum\r\n except IndexError:\r\n right_sum = 0\r\n\r\nfor i in num_of_birds:\r\n print(i)\r\n", "#https://codeforces.com/contest/294/problem/A\r\n\r\nnum_wires = int(input())\r\nlst = [int(i) for i in input().split()]\r\n\r\nnumber_of_shots = int(input())\r\nline_shotpos = []\r\nfor i in range(number_of_shots):\r\n line_shotpos.append([int(i) for i in input().split()])\r\n\r\n# print(line_shotpos)\r\n\r\nfor i in range(number_of_shots):\r\n current_line = line_shotpos[i][0]\r\n bird_shot_at = line_shotpos[i][1]\r\n bird_totheleft = bird_shot_at - 1\r\n bird_totheright = lst[current_line-1]-bird_shot_at\r\n # print('line:{},bird_shot:{},bird_toleft:{},bird_toright:{}'.format(current_line,\\\r\n # bird_shot_at,bird_totheleft,bird_totheright))\r\n if current_line != 1:\r\n lst[current_line - 1 -1] += bird_totheleft\r\n if current_line != num_wires:\r\n lst[current_line -1 + 1] += bird_totheright\r\n lst[current_line-1] = 0\r\n # print('Birds after {} shot: {}'.format(i+1, lst))\r\n\r\nfor i in lst:\r\n print(i)\r\n\r\n", "nb_wires = int(input())\r\npopulation = [0] + [int(x) for x in input().split()] + [0]\r\nnb_shots = int(input())\r\nfor _ in range(nb_shots):\r\n wire_no, bird_no = [int(x) for x in input().split()]\r\n population[wire_no-1] += bird_no - 1\r\n population[wire_no+1] += population[wire_no] - bird_no\r\n population[wire_no] = 0\r\nfor i in range(1, nb_wires+1) :\r\n print(population[i])", "n = int(input())\r\nbirds = list(map(int,input().split()))\r\nkills = int(input())\r\ncordinates = [[j for j in list(map(int,input().split()))] for i in range(kills)]\r\nX = []\r\nY=[]\r\nfor i in range(len(cordinates)):\r\n X.append(cordinates[i][0])\r\n Y.append(cordinates[i][1])\r\nfor i in range(len(X)):\r\n if n == 1 :\r\n birds[0] = 0\r\n else:\r\n \r\n counter = X[i]-1\r\n if counter==0:\r\n \r\n birds[counter+1] = birds[counter+1] + abs(birds[counter]-Y[i])\r\n birds[counter]=0\r\n elif counter==n-1:\r\n birds[counter-1] = birds[counter-1] + abs(Y[i]-1)\r\n birds[counter]=0\r\n \r\n \r\n else:\r\n birds[counter-1] = birds[counter-1] + abs(Y[i]-1)\r\n birds[counter+1] = birds[counter+1] + abs(birds[counter]-Y[i])\r\n birds[counter]=0\r\nfor j in birds:\r\n print(j)\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\nlst = [int(i) for i in input().split()]\r\nlst.insert(0, 0)\r\nlst.append(0)\r\nfor shot in range(int(input())):\r\n\t#print(lst)\r\n\tx, y = map(int, input().split())\r\n\tleft = y - 1\r\n\tright = lst[x] - y\r\n\tlst[x - 1] += left\r\n\tlst[x + 1] += right\r\n\tlst[x] = 0\r\nfor el in lst[1:-1]: print(el)", "num_of_wires = int(input())\r\nnum_of_birds_in_each_wires = list(map(int,input().strip().split()))\r\nnum_of_shots = int(input())\r\nindex_of_wire = []\r\nindex_of_bird = []\r\nfor i in range(num_of_shots):\r\n w, b = map(int,input().strip().split())\r\n index_of_wire.append(w)\r\n index_of_bird.append(b)\r\nr = 0\r\nfor y in index_of_wire :\r\n num_in_current = num_of_birds_in_each_wires[y-1] # number of birds in current wires\r\n index_of_current = index_of_bird[r] # index of shot bird\r\n left_num = index_of_current - 1\r\n right_num = num_in_current - index_of_current\r\n num_of_birds_in_each_wires[y-1] = 0\r\n if y-2 in range(num_of_wires):\r\n num_of_birds_in_each_wires[y-2] = num_of_birds_in_each_wires[y-2] + left_num # number of brids in next wires\r\n if y in range(num_of_wires):\r\n num_of_birds_in_each_wires[y] = num_of_birds_in_each_wires[y] + right_num # number of brids in last wires\r\n r = r + 1\r\nfor i in num_of_birds_in_each_wires :\r\n print(i)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n xi, yi = map(int, input().split())\r\n xi -= 1 \r\n if xi > 0:\r\n a[xi - 1] += yi - 1\r\n if xi < n - 1:\r\n a[xi + 1] += a[xi] - yi\r\n a[xi] = 0\r\n\r\nfor oskol in a:\r\n print(oskol)", "import sys,math\r\nn=int(sys.stdin.readline())\r\nl=list(map(int,sys.stdin.readline().split()))\r\nm=int(sys.stdin.readline())\r\nfor _ in range(m):\r\n x,y=map(int, sys.stdin.readline().split())\r\n x-=1\r\n old=l[x]\r\n l[x]=0\r\n if x-1>=0:\r\n l[x-1]+=(y-1)\r\n if x+1<n:\r\n l[x+1]+=(old-y)\r\nfor i in l:\r\n print(i)", "n, lst, m = int(input()), list(map(int, input().split())), int(input())\r\nlst = [0] + lst + [0]\r\nfor u in range(m):\r\n x, y = map(int, input().split())\r\n lst[x + 1], lst[x - 1], lst[x] = lst[x + 1] + lst[x] - y, lst[x - 1] + y - 1, 0\r\nfor x in range(n): print(lst[x + 1])", "n = int(input())\nv = [0]\np = [int(i) for i in input().split()]\nfor i in range(n):\n v.append(p[i])\n\nm = int(input())\nfor i in range(m):\n x, y = map(int, input().split())\n if x == n or y == v[x]:\n v[x-1] += y-1\n v[x] = 0\n elif x == 1 or y == 1:\n v[x+1] += v[x]-y\n v[x] = 0\n else:\n v[x+1] += v[x]-y\n v[x-1] += y-1\n v[x] = 0\n\nfor i in range(1, n+1):\n print(v[i])\n", "n = int(input())\nl = list(map(int,input().split()))\nm = int(input())\nfor _ in range(m):\n x,y = map(int,input().split())\n if x != 1:\n l[x-2]+=y-1\n if x != n:\n l[x]+=l[x-1]-y\n l[x-1] = 0\nfor i in l:\n print(i)\n\n", "m = int(input())\r\nbirds = list(map(int, input().split()))\r\nn = int(input())\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if x > 0:\r\n birds[x - 1] += y - 1\r\n if x < m - 1:\r\n birds[x + 1] += birds[x] - y\r\n birds[x] = 0\r\n\r\nfor value in birds:\r\n print(value)\r\n", "# https://codeforces.com/contest/294/problem/A\r\n\r\nnoOfWires = int(input())\r\nnoOfBirdsOnEachWires = [int(x) for x in input().split(' ')]\r\nnoOfBirdsKilled = int(input())\r\n\r\nfor i in range(noOfBirdsKilled):\r\n birdKilled = [int(x) for x in input().split(' ')]\r\n wireNo = birdKilled[0] - 1 # index\r\n birdNo = birdKilled[1]\r\n birdsOnLeft = birdNo - 1\r\n birdsOnRight = noOfBirdsOnEachWires[wireNo] - birdNo\r\n if wireNo != 0:\r\n noOfBirdsOnEachWires[wireNo - 1] += birdsOnLeft\r\n noOfBirdsOnEachWires[wireNo] = 0\r\n if wireNo != noOfWires-1:\r\n noOfBirdsOnEachWires[wireNo + 1] += birdsOnRight\r\n\r\nprint('\\n'.join([str(x) for x in noOfBirdsOnEachWires]))\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n w = x - 1\r\n dl = A[w] - y\r\n dr = y - 1\r\n if len(A) > 1:\r\n if x == 1:\r\n A[x] = A[x] + dl\r\n A[w] = 0\r\n elif x == n:\r\n A[w - 1] = A[w - 1] + dr\r\n A[w] = 0\r\n else:\r\n A[w - 1] = A[w - 1] + dr\r\n A[x] = A[x] + dl\r\n A[w] = 0\r\n else:\r\n A = [0]\r\n \r\nfor j in A:\r\n print(j)", "n=int(input());r=[map(int,input().split())]\r\nfor _ in [0]int(input()):\r\n x,y=map(int,input().split())\r\n if x>1:r[x-2]+=y-1\r\n if x<n:r[x]+=r[x-1]-y\r\n r[x-1]=0\r\nfor i in r:print(i)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef print(args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef solve(a: list, axis: list, n: int) -> None:\r\n for x, y in axis:\r\n if x - 2 >= 0:\r\n a[x - 2] += y - 1\r\n\r\n if x < n:\r\n a[x] += a[x - 1] - y\r\n\r\n a[x - 1] = 0\r\n\r\n print(a)\r\n\r\ndef main() -> None:\r\n n, a = int(input()), list(map(int, input().split()))\r\n m = int(input())\r\n axis = [list(map(int, input().split())) for i in range(m)]\r\n\r\n solve(a, axis, n)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\nb_on_line=list(map(int,input().split()))\r\nm=int(input())\r\n\r\n\r\nfor i in range(0,m):\r\n left=0\r\n right=0\r\n x,y=map(int,input().split())\r\n tot=b_on_line[x-1]\r\n right=tot-y\r\n left=y-1\r\n if x!=1:\r\n b_on_line[x-2]= b_on_line[x-2]+left\r\n if x!=n:\r\n b_on_line[x]= b_on_line[x]+right\r\n b_on_line[x-1]=0\r\nprint(b_on_line,sep=\"\\n\")", "n=int(input());a=[0]+list(map(int,input().split()))+[0]\r\nfor i in range(int(input())):\r\n\tx,y=map(int,input().split())\r\n\ta[x-1]=a[x-1]+y-1\r\n\ta[x+1]=a[x+1]+a[x]-y\r\n\ta[x]=0\r\nfor i in range(1,len(a)-1):\r\n\tprint(a[i])\r\n\t", "n = int(input())\narr = list(map(int, input().split()))\nfor _ in range(int(input())):\n\twire, index = map(int, input().split())\n\tbird = arr[wire - 1]\n\tif wire != n:\n\t\tarr[wire] += bird - index\n\tif wire != 1:\n\t\tarr[wire - 2] += (index - 1)\n\tarr[wire - 1] = 0\nfor m in arr:\n\tprint(m)\n\t\t \t\t \t \t \t \t\t \t\t\t\t \t\t \t\t\t\t\t", "x=int(input())\r\nk=[0]+list(map(int, input().split()))+[0]\r\ny=int(input())\r\nfor i in range(y):\r\n h1,h2=map(int, input().split())\r\n k[h1-1]+=h2-1\r\n k[h1+1]+=k[h1]-h2\r\n k[h1]=0\r\n \r\nprint('\\n'.join(map(str, k[1:-1])))\r\n \r\n", "n = int(input())\r\na = [0] + list(map(int, input().split(' '))) + [0]\r\nfor _ in range(int(input())):\r\n x, y = list(map(int, input().split(' ')))\r\n a[x-1] += y-1\r\n a[x+1] += a[x]-y\r\n a[x] = 0\r\nfor i in range(1, n+1):\r\n print(a[i])", "n=int(input())\r\na=list(map(int,input().split()))\r\nc={0:0}\r\nfor i in range(n):\r\n c[i+1]=a[i]\r\nc[i+2]=0\r\nfor i in range(int(input())):\r\n v,b=map(int,input().split())\r\n c[v-1]+=b-1\r\n c[v+1]+=c[v]-b\r\n c[v]=0\r\nfor i in range(1,n+1):\r\n print(c[i])\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nq = int(input())\r\nfor _ in range(q):\r\n x, y = map(lambda m: int(m) - 1, input().split())\r\n nb_right = max((l[x] - 1) - y, 0)\r\n nb_left = (l[x] - 1) - nb_right\r\n l[x] = 0\r\n if x + 1 < n:\r\n l[x + 1] += nb_right\r\n if x - 1 >= 0:\r\n l[x - 1] += nb_left\r\n\r\nprint('\\n'.join(list(map(str, l))))", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n cur = a[x]\r\n if cur != 0:\r\n if x+1 < n:\r\n a[x+1] += cur - y\r\n if x-1 > -1:\r\n a[x-1] += y-1\r\n a[x] = 0\r\n\r\nfor i in a:\r\n print(i)\r\n #10-(5 подстрелили) 4 слева, 5 справа слева = № - 1, справа = все - №\r\n \r\n", "n = int(input())\r\n\r\nbirds = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nwhile m :\r\n x, y = map(int, input().split())\r\n if x - 2 >=0 :\r\n birds[x-2] += y-1\r\n\r\n if x < n:\r\n birds[x] += birds[x-1] - y \r\n birds[x-1] = 0\r\n m -=1\r\n\r\nfor i in birds:\r\n print(i)\r\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn=iinput()\r\na=list(map(int,input().split()))\r\nm=iinput()\r\nfor i in range(m):\r\n x,y = rinput()\r\n left=y-1\r\n right=a[x-1]-y\r\n if(x>=2):\r\n a[x-2]+=left\r\n if(x<n):\r\n a[x]+=right\r\n a[x-1]=0\r\n\r\nfor i in range(n):\r\n print(a[i])\r\n", "n = int(input())\nmat = [0] + list(map(int, input().split())) + [0]\nm = int(input())\nfor _ in range(m):\n x,y = map(int, input().split())\n mat[x-1]+=y-1\n mat[x+1]+=mat[x]-y\n mat[x]=0\nfor i in range(1,n+1):\n print(mat[i])\n", "num_wires = int(input())\r\nnum_birds_per_wire = list(map(int, input().split()))\r\n\r\nnum_shots = int(input())\r\n\r\nshots_positions = [list(map(int, input().split())) for i in range(num_shots)]\r\n\r\nfor shot_pos in shots_positions:\r\n\r\n x_pos, y_pos = shot_pos[0], shot_pos[1]\r\n x_pos, y_pos = x_pos - 1, y_pos - 1\r\n\r\n\r\n\r\n if x_pos > 0:\r\n num_birds_per_wire[x_pos - 1] += y_pos\r\n\r\n if x_pos < num_wires - 1:\r\n num_birds_per_wire[x_pos + 1] += (num_birds_per_wire[x_pos] - y_pos - 1)\r\n\r\n num_birds_per_wire[x_pos] = 0\r\n\r\nfor i in num_birds_per_wire:\r\n print(i)\r\n", "x=int(input())\r\na=[]\r\nb=list(map(int,input().split()))\r\nfor i in b:\r\n a.append([1]i)\r\nn=int(input())\r\nwhile n:\r\n x0,y0=map(int,input().split())\r\n x0-=1\r\n y0-=1\r\n lol=len(a[x0][:y0])\r\n olo=len(a[x0][y0+1:])\r\n a[x0]=[]\r\n if x0-1>=0:\r\n a[x0-1].extend([1]lol)\r\n if x0+1<x:\r\n a[x0+1].extend([1]olo)\r\n n-=1\r\nfor i in a:\r\n print(len(i)) ", "n = int(input())\r\nwire = [int(i) for i in input().split()]\r\n\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n\r\n if x > 1:\r\n wire[x-2] += (y-1)\r\n\r\n if x < n:\r\n wire[x] += (wire[x-1]-y)\r\n\r\n wire[x-1] = 0\r\n\r\nfor i in wire:\r\n print(i)\r\n", "n = int(input())\r\nbirds = [int(q) for q in input().split()]\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = [int(q) for q in input().split()]\r\n if birds[x-1]:\r\n if x-2 >= 0:\r\n birds[x-2] += (y-1)\r\n if x+1 <= len(birds):\r\n birds[x] += birds[x-1]-y\r\n birds[x-1] = 0\r\nfor w in birds:\r\n print(w)\r\n", "input()\r\nn = list(map(int, [0]+input().split()+[0]))\r\nt = int(input())\r\nfor i in range(t):\r\n x, y= map(int, input().split())\r\n n[x-1] += y-1\r\n n[x+1] += n[x] - y\r\n n[x] = 0\r\nfor i in range(1, len(n)-1):\r\n print(n[i])", "n = int(input())\nwires = list(map(int,input().split()))\nm = int(input())\nfor _ in range(m):\n wire,bird = map(int,input().split())\n # for one indexing\n wire -=1\n if wire != 0 :\n wires[wire-1] += bird -1\n if wire != n-1 :\n wires[wire+1] += wires[wire]-bird \n wires[wire] = 0\nprint(wires,sep=\"\\n\")", "totla_box=int(input())\r\nbox=list(map(int ,input().split()))\r\nn=int(input())\r\n\r\nfor i in range(n):\r\n n_box,i_box=list(map(int ,input().split()))\r\n n_box-=1\r\n \r\n if (n_box != 0):\r\n box[n_box-1]+=i_box-1\r\n if (n_box!= totla_box-1):\r\n box[n_box+1]+=box[n_box]-i_box\r\n \r\n box[n_box]=0\r\n\r\n\r\nfor i in box:\r\n print (i)", "# Version 17.0\ndef main() -> None:\n # 2023-08-26 23:35:53\n length = ii()\n l = li()\n length2 = ii()\n for tc in range(length2):\n a,b = mi()\n a-=1\n total = l[a]\n l[a] = 0\n left = b - 1\n right = abs(total - b)\n if a>=1:\n l[a-1]+=left\n if a<length-1:\n l[a+1]+=right\n for i in l:\n p(i)\n\n\n \nif __name__ == \"__main__\":\n master_flag = False\n L = lambda string: exec('from hq import L\\nL(string)') if not master_flag else False\n LT = lambda tc, custom, string: exec('from hq import LT\\nLT(tc, custom, string)') if not master_flag else False\n import os,sys,math,itertools;from collections import deque,defaultdict,OrderedDict,Counter\n from bisect import bisect,bisect_left,bisect_right,insort\n from heapq import heapify,heappush,heappop,nsmallest,nlargest,heapreplace, heappushpop\n ii,si=lambda:int(input()),lambda:input() \n mi,msi=lambda:map(int,input().strip().split(\" \")),lambda:map(str,input().strip().split(\" \")) \n li,lsi=lambda:list(mi()),lambda:list(msi())\n out,export,p,pp=[],lambda:print('\\n'.join(map(str, out)), end=''),lambda x :out.append(x),lambda array:p(' '.join(map(str,array)))\n try:exec('from hq import see,info,cmdIO,_generator_\\nline=[cmdIO(),main(),export(),_generator_()]\\nfor l in line:l')\n except(FileNotFoundError,ModuleNotFoundError):master_flag=True;main();export()\n \t\t\t\t \t\t \t \t\t\t\t \t\t \t\t \t\t", "n = int(input())\r\nbirds = list(map(int, input().split(' ')))\r\ns = int(input())\r\nfor _ in range(s):\r\n wire, bird = [int(x) for x in input().split()]\r\n idx = wire - 1\r\n if idx - 1 >= 0:\r\n birds[idx - 1] += bird - 1\r\n if idx + 1 < len(birds):\r\n birds[idx + 1] += birds[idx] - bird\r\n birds[idx] = 0\r\n \r\nfor b in birds:\r\n print(b,\"\\n\")", "# Author : //- kibrom Hailu -\\\\\r\n\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter,defaultdict , deque \r\nfrom bisect import bisect , bisect_left ,bisect_right \r\nfrom itertools import accumulate \r\nfrom heapq import heapify , heappop , heappush , heappushpop , heapreplace\r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef solve():\r\n \r\n # write your code here \r\n n = I()\r\n arr = IL() \r\n\r\n m = I() \r\n for i in range(m):\r\n wire , idx = II() \r\n wire -= 1\r\n x = arr[wire]\r\n arr[wire] = 0 \r\n\r\n if wire + 1 < n:\r\n arr[wire+1] += x-idx \r\n \r\n if wire-1 > -1:\r\n arr[wire-1] += idx-1\r\n \r\n for a in arr:\r\n print(a)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nsolve()\r\n", "# Read the number of wires\r\nn = int(input())\r\n\r\n# Read the number of birds on each wire\r\na = list(map(int, input().split()))\r\n\r\n# Read the number of shots\r\nm = int(input())\r\n\r\n# Loop through each shot\r\nfor _ in range(m):\r\n # Read the wire and the position of the shot bird\r\n x, y = map(int, input().split())\r\n # Decrease the wire number by one to match the list index\r\n x -= 1\r\n # Update the number of birds on the adjacent wires\r\n # If there is an upper wire, add the birds to the left of the shot bird\r\n if x > 0:\r\n a[x - 1] += y - 1\r\n # If there is a lower wire, add the birds to the right of the shot bird\r\n if x < n - 1:\r\n a[x + 1] += a[x] - y\r\n # Set the number of birds on the current wire to zero\r\n a[x] = 0\r\n\r\n# Print the number of birds on each wire\r\nfor i in range(n):\r\n print(a[i])", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nw = [[0]2 for i in range(m)]\r\n\r\nfor i in range(m):\r\n w[i][0], w[i][1] = map(int ,input().split())\r\n\r\nfor i in range(m):\r\n\r\n left = w[i][1]-1\r\n right = a[w[i][0]-1]-w[i][1]\r\n\r\n if w[i][0] != 1:\r\n a[w[i][0]-2] += left\r\n\r\n if w[i][0] != n:\r\n a[w[i][0]] += right\r\n\r\n a[w[i][0]-1] = 0\r\n\r\nfor i in range(n):\r\n print(a[i])\r\n ", "#!/usr/bin/env python3\r\n# -- coding: utf-8 --\r\n#\r\n# ------------------------------------------------------------------------------\r\n# Author: Mohammad Mohsen\r\n# Date: Thu Dec 23 16:36:52 2021\r\n# problem name: Shaass_and_Oskols\r\n# contest: 294-Codeforces Round #178 (Div. 2)\r\n# problem difficulty: A-D2\r\n# problem url: https://codeforces.com/contest/294/problem/A\r\n# ------------------------------------------------------------------------------\r\n\r\nfrom typing import \r\n\r\n\r\nclass Problem(object):\r\n\r\n def __init__(self, name: str) -> None:\r\n self.name = name\r\n\r\n def solution(self) -> Union[str, int, float]:\r\n num_of_wires: int = int(input().strip())\r\n oskols: List[int] = [int(i) for i in input().strip().split()]\r\n num_of_shots: int = int(input().strip())\r\n\r\n for shot in range(num_of_shots):\r\n wire, position = [int(i) for i in input().strip().split()]\r\n \r\n wire -= 1\r\n left: int = position - 1;\r\n right: int = oskols[wire] - position;\r\n\r\n if wire != 0:\r\n oskols[wire - 1] += left\r\n \r\n if wire != (num_of_wires - 1):\r\n oskols[wire + 1] += right\r\n \r\n oskols[wire] = 0\r\n \r\n return \"\\n\".join([str(i) for i in oskols])\r\n\r\nproblem = Problem(\"Shaass_and_Oskols\")\r\n\r\nif __name__ == \"__main__\":\r\n solution: Union[str, int, float] = problem.solution()\r\n print(solution)\r\n\r\n", "n=int(input())\na = list(map(int,input().strip().split()))[:n]\ndict={}\nfor i in range(1,n+1):\n dict.update({int(i):a[i-1]})\nm=int(input())\nfor i in range (0,m):\n x,y=input().split()\n x=int(x)\n y=int(y)\n if(x!=1):\n dict[x-1]=dict[x-1]+y-1\n if(x!=n):\n dict[x+1]=dict[x+1]+dict[x]-y\n dict[x]=0\nfor i in range(1,n+1):\n print(dict[i])\n \t\t\t\t \t \t \t \t\t \t \t\t \t \t\t", "n = int(input())\r\nwires = input().split()\r\nwires = [int(x) for x in wires]\r\nm = int(input())\r\nfor i in range(m):\r\n coordinate = input().split()\r\n x = int(coordinate[0])-1\r\n y =int(coordinate[1])\r\n right = wires[x] - y\r\n left = y-1\r\n\r\n if x -1 >=0:\r\n wires[x-1] += left\r\n if x+1 < n:\r\n wires[x+1] += right\r\n wires[x] =0\r\n\r\nfor bird in wires:\r\n print(bird)\r\n ", "n, A = int(input()), [0] + list(map(int, input().split())) + [0]\r\n\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n A[x - 1], A[x], A[x + 1] = A[x - 1] + y - 1, 0, A[x + 1] + A[x] - y\r\n\r\nprint(A[1:-1])", "n = int(input(\"\"))\r\na = [int(x) for x in input(\"\").split()]\r\nm = int(input(\"\"))\r\n# shots = []\r\nfor i in range(m):\r\n x, y = [int(x) for x in input(\"\").split()]\r\n if x-1-1 >= 0:\r\n a[x-1-1] += (y - 1)\r\n if x < n:\r\n a[x] += a[x-1] - y;\r\n a[x-1] = 0\r\nprint(a)\r\n \r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nif n == len(a):\r\n m = int(input())\r\n for i in range(m):\r\n x, y = [int(i) for i in input().split()]\r\n x -=1\r\n if x != 0:\r\n a[x-1] += y-1\r\n if x != n -1:\r\n a[x+1] += a[x] - y\r\n a[x] = 0\r\n for i in a:\r\n print(i)", "n = int(input())\nmyList = list(map(int, input().split()))\n\n\nm = int(input())\n\nfor i in range(m):\n x, y = map(int, input().split())\n a = y-1\n b = myList[x-1]-y\n myList[x-1]=0\n if(x-2 >= 0):\n myList[x-2] += a\n if(x<n):\n myList[x] += b\nfor ans in myList:\n print(ans)\n \n\n\t\t\t \t \t\t\t \t \t \t \t\t\t\t \t \t\t\t", "def shaass_and_oskols(arr,shots,b):\r\n for i in range(shots):\r\n x=b[i][0]\r\n y=b[i][1]\r\n if x-2>=0:\r\n arr[x-2]=arr[x-2]+(y-1)\r\n if x<=(len(arr)-1):\r\n arr[x]=arr[x]+(arr[x-1]-y)\r\n arr[x-1]=0\r\n\r\n for i in range(len(arr)):\r\n print(arr[i])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn=int(input(''))\r\narr=list(map(int,input('').split()))\r\nshots=int(input(''))\r\nb=[]\r\nfor i in range(shots):\r\n a=list(map(int,input('').split()))\r\n b.append(a)\r\n\r\nshaass_and_oskols(arr,shots,b)", "n=int(input())\r\ns=[int(i) for i in input().split()]\r\na=int(input())\r\nfor i in range(a):\r\n c,b=[int(i) for i in input().split()]\r\n if c!=1:\r\n s[c-2]=s[c-2]+(b-1)\r\n if c!=n:\r\n s[c]=s[c]+s[c-1]-b\r\n s[c-1]=0\r\n \r\nfor i in range(n):\r\n print(s[i])", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n l = list(map(int, inp[1].split()))\r\n for s in inp[3:]:\r\n x, y = map(int, s.split())\r\n if x-2 >= 0: l[x-2] += y - 1\r\n if x < len(l): l[x] += l[x-1] - y\r\n l[x-1] = 0\r\n return l\r\n \r\nprint(main(), sep='\\n')\r\n", "import sys\r\nimport heapq\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n n = int(input())\r\n a = [int(item) for item in input().split()]\r\n m = int(input())\r\n for _ in range(m):\r\n x,y = [int(item)-1 for item in input().split()]\r\n if(x+1 < n): a[x+1] += (a[x]-y-1)\r\n if(x > 0): a[x-1] += y\r\n a[x]=0\r\n for x in a:\r\n print(x)\r\n \r\n \r\nif __name__ == '__main__':\r\n main()", "n = int(input())\nlines = list(map(int, input().split()))\nfor _ in range(0, int(input())):\n x, y = map(int, input().split())\n x -= 1\n if x < n - 1:\n lines[x + 1] += lines[x] - y\n if x > 0:\n lines[x - 1] += y - 1\n lines[x] = 0\nprint(lines, sep='\\n')\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = int(input())\r\nfor _ in range(m):\r\n x,y = map(int, input().split())\r\n\r\n if x != 1:\r\n l[x-2] += y-1\r\n\r\n if x != len(l):\r\n l[x] += l[x-1]-y\r\n \r\n l[x-1] = 0\r\nfor i in l:\r\n print(i)", "import itertools\r\nimport math\r\nfrom collections import defaultdict\r\n\r\ndef input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n n = int(input())\r\n a = input_ints()\r\n q = int(input())\r\n for i in range(q):\r\n x, y = input_ints()\r\n x -= 1\r\n if x:\r\n a[x - 1] += y - 1\r\n if x < n - 1:\r\n a[x + 1] += a[x] - y\r\n a[x] = 0\r\n for x in a:\r\n print(x)\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "wires = int(input())\r\nbirds = list(input().split(\" \"))\r\nshots = int(input())\r\nres = []\r\nfor i in range(len(birds)):\r\n res.append(int(birds[i]))\r\ni = 0\r\nwhile i < shots:\r\n shot = list(map(int, input().strip().split()))[:2]\r\n wire = shot[0]-1\r\n pos = shot[1]\r\n if 0 <= wire-1 < wires:\r\n res[wire-1] += pos - 1\r\n if 0 <= wire + 1 < wires:\r\n res[wire+1] += res[wire] - pos\r\n res[wire] = 0\r\n i += 1\r\nfor i in range(len(res)):\r\n print(res[i])\r\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn=read_int()\n\ta=[0]+read_ints()+[0]\n\tq=read_int()\n\twhile q>0:\n\t\tq-=1\n\t\tx,y=read_ints()\n\t\ta[x-1]+=y-1\n\t\ta[x+1]+=a[x]-y\n\t\ta[x]=0\n\tprint(\"\\n\".join(map(str, a[1:n+1])))\n\nsolve()\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n temp = list(map(int, input().split()))\r\n row = temp[0]-1\r\n if row > 0:\r\n lst[row-1] += temp[1]-1 \r\n if row < n -1:\r\n lst[row+1] += (lst[row]-temp[1])\r\n lst[row] = 0\r\n\r\nfor j in range(n):\r\n print(lst[j])", "n = int(input())-1\nwires = list(map(int, input().split()))\nshot = int(input())\n\nfor i in range(shot):\n \n x = list(map(int, input().split())) \n index = x[0]-1\n brid = x[1]\n if index > 0:\n wires[index-1] += (brid-1)\n\n if index < n:\n wires[index+1] += (wires[index]-brid)\n \n wires[index] = 0\n\nfor i in wires:\n print(i)", "n=int(input())\r\na=list(map(int, input().split()))\r\na.insert(0,0)\r\na.append(0)\r\nm=int(input())\r\nfor z in range(m):\r\n x,y=input().split()\r\n x=int(x)\r\n y=int(y)\r\n a[x-1]+=y-1\r\n a[x+1]+=a[x]-y\r\n a[x]=0\r\nfor i in range(1,n+1):\r\n print(a[i])", "def MovingBirds(l):\r\n for i in range(int(input())):\r\n line,bird=map(int,input().split())\r\n if line-2>=0:\r\n l[line-2]+=bird-1\r\n if line<len(l):\r\n l[line]+=l[line-1]-bird\r\n l[line-1]=0\r\n for i in l:\r\n print(i)\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nMovingBirds(l)\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\na=[0]+a+[0]\r\n\r\nk=int(input())\r\nfor q in range(k):\r\n x,y=map(int,input().split())\r\n #print(x)\r\n a[x+1]+=a[x]-y\r\n a[x-1]+=y-1\r\n a[x]=0\r\nfor i in range(1,n+1):\r\n print(a[i])\r\n ", "x=int(input())\r\ny=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n b,c =map(int,input().split())\r\n if (x==1):\r\n y[0]=0\r\n else:\r\n if (b==x or b==1):\r\n if (b==1):\r\n y[b]+=y[b-1]-c\r\n y[b-1]=0\r\n else:\r\n y[b-2]+=c-1 \r\n y[b-1]=0 \r\n else:\r\n y[b-2]+=c-1\r\n y[b]+=y[b-1]-c\r\n y[b-1]=0\r\nfor i in y:\r\n print(i) ", "n, A = int(input()), list(map(int, input().split()))\r\n\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if x > 1:\r\n A[x - 2] += y - 1\r\n if x < n:\r\n A[x] += A[x - 1] - y\r\n A[x - 1] = 0\r\n\r\nprint(A, sep='\\n')", "size = int(input())\r\nnumbers = list(map(int, input().split()))\r\nnumbers = [0] + numbers\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if 0 <= x + 1 <= size:\r\n numbers[x + 1] += numbers[x] - y\r\n if 0 <= x - 1 <= size:\r\n numbers[x - 1] += y - 1\r\n numbers[x] = 0\r\nfor number in numbers[1:]:\r\n print(number)", "n = int(input())\r\nlistt = list(map(int, input().split( )))\r\nlistt = [0] + listt +[0]\r\nfire = int(input())\r\nfor i in range(fire):\r\n p,shot = map(int, input().split( ))\r\n if(shot <= listt[p]):\r\n right = listt[p] - shot\r\n if(right >= 0):\r\n left = shot-1\r\n if(p-1 >= 0):\r\n listt[p-1] +=left\r\n if(p+1 < len(listt)):\r\n listt[p+1] +=right\r\n listt[p] = 0\r\n else:\r\n listt[p-1] += listt[p]\r\n listt[p] = 0\r\n \r\nfor i in range(1,n+1):\r\n print(listt[i])\r\n \r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\nnShot = int(input())\r\ns = [list(map(int,input().split())) for i in range(nShot)]\r\nfor i in s:\r\n if(n>1):\r\n if(i[0]-1 ==0):\r\n R = sum([1 for p in range(i[1],a[i[0]-1])])\r\n a[i[0]] = a[i[0]] + R \r\n a[i[0]-1] = 0\r\n \r\n elif(i[0]==n):\r\n L = sum([1 for p in range(1,i[1])])\r\n a[i[0]-2] = a[i[0]-2] + L \r\n a[i[0]-1] = 0\r\n \r\n else:\r\n L = sum([1 for p in range(1,i[1])])\r\n R = sum([1 for p in range(i[1],a[i[0]-1])])\r\n a[i[0]-2] = a[i[0]-2] + L \r\n a[i[0]] = a[i[0]] + R \r\n a[i[0]-1] = 0\r\n else:\r\n a[i[0]-1] = 0\r\n[print(j) for j in a] \r\n \r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nm=int(input())\r\nfor i in range(m):\r\n x,y = map(int, input().split())\r\n right=a[x-1]-y\r\n left=y-1\r\n x=x-1\r\n if x!=0:\r\n a[x-1]+=left\r\n if x!=(n-1):\r\n a[x+1]+=right\r\n \r\n a[x]=0\r\n\r\n \r\n \r\nfor i in a:\r\n print(i)\r\n \r\n \r\n \r\n ", "n=int(input())\r\na=input().split()\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\nm=int(input())\r\nfor i in range(m):\r\n xy=input().split()\r\n if int(xy[0])!=n:\r\n a[int(xy[0])]+=a[int(xy[0])-1]-int(xy[1])\r\n a[int(xy[0])-1]=0\r\n if int(xy[0])!=1:\r\n a[int(xy[0])-2]+=int(xy[1])-1\r\n \r\nfor i in range(n):\r\n print(a[i])\r\n ", "# link: https://codeforces.com/contest/294/problem/A\r\n\r\nfor _ in range(1):\r\n n = int(input())\r\n b = list(map(int, input().split()))\r\n m = int(input())\r\n while m:\r\n m -= 1\r\n info = list(map(int, input().split()))\r\n at = info[0] - 1\r\n birds_going_up = info[1] - 1\r\n birds_going_down = b[at] - info[1]\r\n if at-1 >= 0:\r\n b[at-1] += birds_going_up\r\n if at+1 <= n-1:\r\n b[at+1] += birds_going_down\r\n b[at] = 0\r\n for i in b:\r\n print(i) ", "\r\n\r\n\r\nn = int(input())\r\n\r\nwires = list(map(int,input().split()))\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n\r\n x -= 1\r\n y -= 1\r\n\r\n E = y\r\n D = abs(y - (wires[x] - 1))\r\n\r\n wires[x] -= E + D + 1\r\n\r\n if x - 1 >= 0:\r\n wires[x-1] += E\r\n\r\n if x + 1 <= n - 1:\r\n wires[x+1] += D\r\n\r\n\r\nfor i in wires:\r\n print(i)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n x , y = map(int, input().split(' '))\r\n x -= 1\r\n if x != 0:\r\n l[x-1] += (y-1)\r\n if x != (n - 1):\r\n l[x+1] += (l[x] - y)\r\n l[x] = 0\r\nfor i in l:\r\n print(i)", "n=int(input())\r\np=list(map(int,input().split()))\r\nol=int(input())\r\nfor x in range(ol):\r\n c,v=list(map(int,input().split()))\r\n ka=c-1\r\n if ka-1>=0:\r\n kam=len(list(range(1,v)))\r\n p[ka-1]+=kam\r\n else:\r\n pass\r\n if ka+1<n:\r\n kam=len(list(range(v+1,p[ka]+1)))\r\n p[ka+1]+=kam\r\n else:\r\n pass\r\n p[ka]=0\r\nfor item in p:\r\n print(item)", "z=int(input())-1\r\nl=[int(i) for i in input().split()]\r\nflag=True\r\nfor j in range(int(input())):\r\n x,y=[int(i) for i in input().split()]\r\n x-=1\r\n val=l[x]\r\n if z==0:\r\n print(0)\r\n flag=False\r\n break\r\n if x==0:\r\n l[x]=0\r\n l[x+1]+=val-y\r\n elif x==z:\r\n l[x]=0\r\n l[x-1]+=y-1\r\n else:\r\n l[x]=0\r\n l[x-1]+=y-1\r\n l[x+1]+=val-y\r\nif flag:\r\n for i in l:\r\n print(i,end='\\n')", "\r\nn = int(input())\r\n\r\nfill = list(map(int, input().split()))\r\n\r\ninitial_configuration = dict(zip(range(1, n+1), fill))\r\nconfig = initial_configuration\r\n\r\nnum_of_shots = int(input())\r\nfor _ in range(num_of_shots):\r\n operation = list(map(int, input().split()))\r\n\r\n line, killled_index = operation[0], operation[1] \r\n to_left = abs(killled_index - 1)\r\n to_right = abs(killled_index - config[line])\r\n\r\n config[line] = 0\r\n if line-1 in config.keys():\r\n config[line - 1] += to_left\r\n if line+1 in config.keys():\r\n config[line + 1] += to_right\r\n\r\n\r\nfor val in config.values():\r\n print(val)\r\n\r\n", "def solve():\r\n n = int(input())\r\n wires = list(map(int, input().split()))\r\n m = int(input())\r\n for _ in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if x-1 >= 0:\r\n wires[x-1] += abs(y-1)\r\n if x+1 < n:\r\n wires[x+1] += abs(wires[x]-y)\r\n wires[x] = 0\r\n \r\n for i in wires:\r\n print(i)\r\n\r\nif __name__== \"__main__\":\r\n solve()", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n if x==1:\r\n if n>1:\r\n a[1]+=a[0]-y\r\n a[0]=0\r\n elif x==n:\r\n a[x-2]+=y-1\r\n a[x-1]=0\r\n else:\r\n a[x-2]+=y-1\r\n a[x]+=a[x-1]-y\r\n a[x-1]=0\r\nfor i in range(n):\r\n print(a[i])", "n=int(input());arr=list(map(int,input().split()))\r\nfor _ in range(int(input())):\r\n x,y=map(int,input().split())\r\n x-=1\r\n if x != 0:\r\n arr[x-1]+=y-1\r\n if x != n-1:\r\n arr[x+1]+=arr[x]-y\r\n arr[x]=0\r\nfor i in arr:\r\n print(i)", "n = int(input())\r\nbirds_per_line = list(map(int, input().split()))\r\nshoots_num = int(input())\r\nwhile shoots_num != 0:\r\n wire_index, bird_index = list(map(int, input().split()))\r\n \r\n #increas left\r\n if wire_index != 1:\r\n birds_per_line[wire_index-2] += bird_index-1\r\n\r\n #increas right\r\n if wire_index != n:\r\n birds_per_line[wire_index] += birds_per_line[wire_index-1]-bird_index\r\n\r\n birds_per_line[wire_index-1] = 0\r\n shoots_num -= 1\r\n\r\nfor i in birds_per_line:\r\n print(i)", "w = int(input())\r\nwires = [0] + [int(x) for x in input().split()] + [0]\r\nfor o in range(int(input())):\r\n (i, p) = (int(x) for x in input().split())\r\n wires[i-1] += p - 1\r\n wires[i+1] += wires[i] - p\r\n wires[i] = 0\r\nfor w in wires[1:w+1]:\r\n print(w)", "n = int(input())\r\nwires = input().split()\r\nm = int(input())\r\nx = []\r\ny = []\r\nnew_wires = []\r\nfor i in range(m):\r\n xy = input().split()\r\n x.append(int(xy[0]))\r\n y.append(int(xy[1]))\r\nfor i in range(m):\r\n wire = x[i]\r\n if wire in range(n):\r\n wires[wire] = int(wires[wire]) + int(wires[wire - 1]) - y[i]\r\n if (wire - 2) >= 0:\r\n wires[wire - 2] = int(wires[wire - 2]) + y[i] - 1\r\n wires[wire - 1] = 0\r\nfor item in wires:\r\n print(item)", "n=int(input())\r\nl=[0]\r\nk=[int(x) for x in input().split()]\r\nl=l+k\r\nm=int(input())\r\nfor _ in range(m):\r\n w,b=[int(x) for x in input().split()]\r\n if w-1>0:\r\n l[w-1]+=b-1\r\n if w+1<=n:\r\n l[w+1]+=l[w]-b\r\n l[w]=0\r\nfor i in range(1,len(l)):\r\n print(l[i])", "def main():\r\n wires=input()\r\n numberOfBirds=input()\r\n numberOfShots=input()\r\n listOfBirds=numberOfBirds.split()\r\n \r\n for i in range (int(numberOfShots)):\r\n shotPlace=input()\r\n Places=shotPlace.split()\r\n wireChoosen=int(Places[0])-1\r\n birdShotted=int(Places[1])\r\n upperBirds=birdShotted-1\r\n lowerBirds=int(listOfBirds[wireChoosen])-birdShotted\r\n listOfBirds[wireChoosen]=0\r\n if(wireChoosen-1!=-1): \r\n listOfBirds[wireChoosen-1]=int(listOfBirds[wireChoosen-1])+upperBirds\r\n if(wireChoosen+1!=len(listOfBirds)): \r\n listOfBirds[wireChoosen+1]=int(listOfBirds[wireChoosen+1])+lowerBirds\r\n\r\n for i in listOfBirds:\r\n print(i)\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n", "number_of_wires = int(input())\nbirds_per_wire = [int(x) for x in input().split()]\nfor shot in range(int(input())):\n wire, bird_position = map(int, input().split())\n wire_index = wire - 1\n if wire_index != 0:\n birds_per_wire[wire_index - 1] += bird_position - 1\n if wire_index != number_of_wires - 1:\n birds_per_wire[wire_index + 1] += birds_per_wire[wire_index] - bird_position\n birds_per_wire[wire_index] = 0\nfor birds in birds_per_wire:\n print(birds)\n", "n = int(input()) \r\na = [int(a) for a in input().split()[:n]]\r\nm = int(input()) \r\nfor line in range(m): \r\n x,y = [int(x) for x in input().split()] \r\n down = a[x-1] - y \r\n up = y-1 \r\n a[x-1] = 0\r\n if x < len(a):\r\n a[x] = a[x] + down \r\n if x > 1:\r\n a[x-2] = a[x-2] + up \r\n \r\n\r\nfor i in a: \r\n print(i)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n\tx,y=input().split()\r\n\tx=int(x)\r\n\ty=int(y)\r\n\tif x!=1:\r\n\t\tl[x-2]+=y-1\r\n\tif x!=n:\r\n\t\tl[x]+=l[x-1]-y\r\n\tl[x-1]=0\r\nfor i in l:\r\n\tprint(i)", "\"\"\"609C\"\"\"\r\n# import math\r\ndef main():\r\n\tn = int(input())\r\n\ta = list(map(int,input().split()))\r\n\tm = int(input())\r\n\tfor i in range(m):\r\n\t\tx,y = map(int,input().split())\r\n\t\tx = x-1\r\n\t\tif x-1>=0:\r\n\t\t\ta[x-1] += y-1\r\n\t\tif x+1<n:\r\n\t\t\ta[x+1] += a[x]-y\r\n\t\ta[x]=0\r\n\tfor i in range(len(a)):\r\n\t\tprint(a[i]) \r\n\r\n\r\nmain()", "n=int(input())\r\narr=list(map(int, input().split()))\r\nkill=int(input())\r\nfor m in range(kill):\r\n i,j=list(map(int, input().split()))\r\n i-=1\r\n if i!=n-1: arr[i+1]+=arr[i]-j\r\n if i!=0:arr[i-1]+=j-1\r\n arr[i]=0\r\nprint(arr,sep=\"\\n\")\r\n \r\n", "#!/usr/bin/env python3\r\n# -- coding: utf-8 --\r\n\r\ndef shaass_and_oskols(a, xy, n):\r\n for xy_i in xy:\r\n x, y = xy_i\r\n i_l, i_r = x - 2, x\r\n if i_l >= 0 :\r\n a[i_l] += y - 1\r\n if i_r < n:\r\n a[i_r] += a[x - 1] - y\r\n a[x - 1] = 0\r\n return '\\n'.join(str(a_i) for a_i in a)\r\n\r\nn = int(input())\r\na = [int(a_i) for a_i in input().split()]\r\nm = int(input())\r\nxy = [[int(xy_i) for xy_i in input().split()] for _ in range(m)]\r\nans = shaass_and_oskols(a, xy, n)\r\nprint(ans)\r\n", "x=int(input())\r\nk=list(map(int, input().split()))\r\ny=int(input())\r\ni=1\r\nfor i in range(y):\r\n h1,h2=map(int, input().split())\r\n h1=h1-1\r\n if h1==x-1:\r\n k[h1-1]+=h2-1\r\n k[h1]=0\r\n elif h1==0 :\r\n k[h1+1]+=k[h1]-h2\r\n k[h1]=0\r\n else:\r\n k[h1+1]+=k[h1]-h2\r\n k[h1-1]+=h2-1\r\n k[h1]=0\r\n\r\n \r\nprint('\\n'.join(map(str,k)))\r\n\r\n \r\n \r\n \r\n", "from itertools import product\r\nfrom math import ceil\r\nfrom fractions import Fraction\r\n\r\ndef binary_table(string_with_all_characters, length_to_make):\r\n return [''.join(x) for x in product(string_with_all_characters, repeat=length_to_make)]\r\n\r\n\r\ndef all_possible_substrings(string):\r\n return [int(string[i: j]) for i in range(len(string)) for j in range(i + 1, len(string) + 1)]\r\n\r\n\r\ndef number_of_substrings(length):\r\n return int(length * (length + 1) / 2)\r\n\r\n\r\ndef is_prime(num):\r\n for i in range(2, num):\r\n if num / i == int(num / i) and num != i:\r\n return False\r\n\r\n return True\r\n\r\n\r\n\"\"\"for enumeration in range(int(input())):\r\n\"\"\"\r\n\r\nnum_of_lines = int(input())\r\n\r\nbirds_and_lines = list(map(int, input().split()))\r\n\r\nnum_of_shots = int(input())\r\n\r\n\r\nfor i in range(num_of_shots):\r\n x, y = map(int, input().split())\r\n line_num = x - 1\r\n num_of_birds = birds_and_lines[line_num]\r\n birds_to_left = y - 1\r\n birds_to_right = num_of_birds - y\r\n birds_and_lines[line_num] -= 1\r\n if x + 1 > len(birds_and_lines):\r\n birds_and_lines[line_num] -= birds_to_right\r\n else:\r\n birds_and_lines[line_num + 1] += birds_to_right\r\n birds_and_lines[line_num] -= birds_to_right\r\n if x - 1 == 0:\r\n birds_and_lines[line_num] -= birds_to_left\r\n else:\r\n birds_and_lines[line_num - 1] += birds_to_left\r\n birds_and_lines[line_num] -= birds_to_left\r\n #print(line_num, num_of_birds, birds_to_left, birds_to_right)\r\nfor i in birds_and_lines:\r\n print(i)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nxy = []\r\nfor i in range(m):\r\n xy.append([int(i) for i in input().split()])\r\n\r\nfor j in xy:\r\n if j[0] - 2 >= 0:\r\n a[j[0] - 2] += j[1] - 1\r\n if j[0] < n:\r\n a[j[0]] += a[j[0] - 1] - j[1]\r\n\r\n a[j[0] - 1] = 0\r\nfor k in a:\r\n print(k)", "t = int(input())\r\nbird = [int(x) for x in input().split()]\r\nshots = int(input())\r\nfor i in range(shots):\r\n a = [int(x) for x in input().split()]\r\n x = a[0]-1\r\n y = a[1]\r\n if x != 0:\r\n bird[x-1] += y-1\r\n if x != t-1:\r\n bird[x+1] += bird[x] - y\r\n bird[x] = 0\r\n \r\nfor val in bird:\r\n print(val, end=\"\\n\")\r\n", "n = int(input())\r\nbirds = input().split()\r\n\r\nbirds = [int(x) for x in birds]\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n x = 0\r\n y = 0\r\n\r\n temp = input().split()\r\n\r\n temp = [int(d) for d in temp]\r\n\r\n x = temp[0]\r\n y = temp[1]\r\n\r\n x -= 1\r\n\r\n if x != 0:\r\n birds[x-1] += y-1\r\n\r\n if x != n - 1:\r\n birds[x+1] += birds[x] - y\r\n\r\n birds[x] = 0\r\n\r\n\r\nfor i in birds:\r\n print(i)\r\n\r\n\r\n", "NumberOfWires = int(input())\r\n#print(NumberOfWires)\r\n\r\nNumberOfBirds = input().split()\r\n#print(NumberOfBirds)\r\nfor i in range(0, len(NumberOfBirds)):\r\n NumberOfBirds[i] = int(NumberOfBirds[i])\r\n#print(NumberOfBirds)\r\n\r\nShots = int(input())\r\n#print(Shots)\r\n\r\nWireShot=[]\r\nBirdShot=[]\r\nfor i in range(0,Shots):\r\n temp = input().split()\r\n WireShot.append(temp[0])\r\n BirdShot.append(temp[1])\r\nfor i in range(0, len(WireShot)):\r\n WireShot[i] = int(WireShot[i])\r\nfor i in range(0, len(BirdShot)):\r\n BirdShot[i] = int(BirdShot[i])\r\n#print(WireShot)\r\n#print(BirdShot)\r\n\r\nfor i in range(Shots):\r\n temp= NumberOfBirds[WireShot[i]-1]\r\n one= BirdShot[i] -1\r\n two= temp-BirdShot[i]\r\n if (two < 0):\r\n two = 0\r\n NumberOfBirds[WireShot[i]-1]=0\r\n try:\r\n if( (WireShot[i]- 2) >=0):\r\n NumberOfBirds[WireShot[i]- 2] += one\r\n except:\r\n m=0\r\n try:\r\n if(WireShot[i]>=0):\r\n NumberOfBirds[WireShot[i]] += two\r\n except:\r\n m=0\r\n\r\nfor i in NumberOfBirds:\r\n print(i)\r\n\r\n", "def get_num(h, m):\r\n\r\n for i in m:\r\n x = i[0]\r\n y = i[1]\r\n if x != 1:\r\n h[x-1] += y - 1\r\n if x != len(h):\r\n h[x+1] += h[x] - y\r\n h[x] = 0\r\n \r\n # count the birds on each line\r\n return h\r\n\r\nif __name__ == '__main__':\r\n n = int(input()) # num of wires\r\n birds = list(map(int, input().split())) # birds on each wire\r\n\r\n # compsing a dictionary of line: num_of_birds\r\n h = {} # to pass the function\r\n for i in range(1, n+1):\r\n h[i] = birds[i-1]\r\n\r\n shots = int(input())\r\n\r\n lines_birds = [] # [line_index , bird_index]\r\n for i in range(shots):\r\n lines_birds.append(list(map(int, input().split())))\r\n\r\n new_h = get_num(h, lines_birds)\r\n for value in new_h.values():\r\n print(value)\r\n", "wires = input()\r\n\r\nw = []\r\nw = input().split(\" \")\r\nbirds_Wires = w[:int(wires)]\r\n\r\nshots = input()\r\n\r\nopration = []\r\n\r\nfor i in range(0, int(shots)):\r\n x_y = input().split(\" \")\r\n\r\n opration.append(tuple(x_y))\r\n\r\nfor shot in opration:\r\n x = int(shot[0])\r\n y = int(shot[1])\r\n\r\n birds = int(birds_Wires[x-1])\r\n\r\n birds_Wires[x-1] = 0\r\n\r\n left = birds - (birds-y+1)\r\n right = birds - y\r\n\r\n if (x-1) + 1 == len(birds_Wires):\r\n right = 0\r\n if (x-1) - 1 == -1:\r\n left = 0\r\n if (x-1) - 1 != -1:\r\n birds_Wires[(x-1)-1] = int(birds_Wires[(x-1)-1]) + left\r\n if (x-1) + 1 != len(birds_Wires):\r\n birds_Wires[(x-1)+1] = int(birds_Wires[(x-1)+1]) + right\r\n\r\nfor i in birds_Wires:\r\n print(i)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.insert(0, 0)\r\na.append(0)\r\nm = int(input())\r\nfor i in range(m):\r\n #х - номер провода, у - номер птицы\r\n x, y = map(int, input().split())\r\n a[x - 1] += y - 1\r\n a[x + 1] += a[x] - y\r\n a[x] = 0\r\ndel a[0]\r\na.pop()\r\nfor i in a:\r\n print(i)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "number_of_wires = int(input())\r\nbirds = list(map(int,input().split()))\r\nshots = int(input())\r\nshot_list = []\r\nfor i in range (shots):\r\n temporary_list = []\r\n x , y = map(int,input().split())\r\n temporary_list.append(x)\r\n temporary_list.append(y)\r\n shot_list.append(temporary_list)\r\n\r\nfor i in range(shots):\r\n x = shot_list[i][0]\r\n if x > 1:\r\n birds[x - 2] += shot_list[i][1] - 1\r\n if x < len(birds):\r\n birds[x] += birds[x - 1] - shot_list[i][1]\r\n birds[x-1] = 0\r\n\r\nfor i in range (len(birds)):\r\n print(birds[i])", "wires_num = int(input())\r\nwires_birds = [int(birds) for birds in input().split(\" \")]\r\nshots = int(input())\r\n\r\nfor shot in range(shots):\r\n x, y = [int(num) for num in input().split(\" \")]\r\n wire_index = x - 1\r\n wire_birds = wires_birds[wire_index]\r\n wires_birds[wire_index] = 0\r\n left_birds = y - 1\r\n right_birds = wire_birds - y\r\n if wire_index -1 >= 0:\r\n wires_birds[wire_index - 1] += left_birds\r\n\r\n if wire_index + 1 < len(wires_birds):\r\n wires_birds[wire_index + 1] += right_birds\r\n\r\nfor wire in wires_birds:\r\n print(wire)", "import sys\ninput = sys.stdin.readline\n\ndef inpit(): #int\n return(int(input()))\ndef inplt(): #list \n return(list(map(int,input().split())))\ndef inpstr(): #string\n s = input()\n return(list(s[:len(s) - 1]))\ndef inpspit(): #spaced intergers \n return(map(int,input().split()))\n\n\nn = inpit()\nb = inplt()\nm = inpit()\nl = []\nfor i in range(m):\n l.append(inplt())\n\nfor i in l: \n c = i[0] -1\n p = i[1]\n if(c != 0):\n b[c-1] += p -1 \n if(c != n-1):\n b[c+1] += b[c] -p\n b[c ] = 0\n \nfor i in b:\n print(i)", "n = int(input()) #number of wires\na = list(map(int, input().split())) #number of birds on ith wire\nm = int(input()) #shot birds\ns = [] #list of on WHICH line and WHICH bird no from left shot\nfor i in range(m):\n x = list(map(int, input().split()))\n s.append(x)\n\nfor i in range(len(s)):\n \n if s[i][0] - 1 == 0 and s[i][0] - 1 == n - 1:\n pass\n elif s[i][0] - 1 == 0:\n a[s[i][0]] = a[s[i][0]] + a[s[i][0] - 1] - s[i][1]\n elif s[i][0] - 1 == n - 1:\n a[s[i][0] - 2] = a[s[i][0] - 2] + s[i][1] - 1\n else:\n a[s[i][0] - 2] = a[s[i][0] - 2] + s[i][1] - 1\n a[s[i][0]] = a[s[i][0]] + a[s[i][0] - 1] - s[i][1]\n\n a[s[i][0] - 1] = 0\n\nfor i in range(n):\n print(a[i])", "n=int(input())\na=list(map(int,input().split()))\nfor i in range(int(input())):\n x,y=map(int,input().split())\n if x-1!=0:\n a[x-2]+=(y-1)\n if x+1<=n:\n a[x]+=(a[x-1]-y)\n a[x-1]=0\nfor i in a:\n print(i)", "from collections import deque\r\n \r\nlines = [w.rstrip() for w in open(0).readlines()]\r\ndeq = deque(lines)\r\nn = int(deq.popleft())\r\nlst = list(map(int, deq.popleft().split()))\r\ns = int(deq.popleft())\r\nfor _ in range(s):\r\n a, b = map(int, deq.popleft().split())\r\n a -= 1\r\n L, R = b - 1, lst[a] - b \r\n if 0 <= a-1 <= n-1: lst[a-1] += L \r\n lst[a] = 0\r\n if 0 <= a+1 <= n-1: lst[a+1] += R \r\nprint(\"\\n\".join(str(x) for x in lst))", "n = int(input())\r\nwires=[int(i) for i in input().split()]\r\nm = int(input())\r\nfor i in range(0, m):\r\n x, y = map(int, input().split(' '))\r\n x=x-1\r\n if x != 0:\r\n wires[x-1] += y-1\r\n if x != n-1:\r\n wires[x+1] += wires[x] - y\r\n wires[x] = 0\r\n\r\nfor j in range(0, n):\r\n print(wires[j])\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\nm = int(input())\r\nq = [map(int, input().split(' ')) for _ in range(m)]\r\n\r\nfor i in range(m):\r\n\r\n ith, kth = q[i]\r\n ith -= 1\r\n\r\n if ith - 1 >= 0:\r\n\r\n a[ith - 1] += (kth - 1)\r\n\r\n if ith + 1 < n:\r\n\r\n a[ith + 1] += (a[ith] - kth)\r\n\r\n a[ith] = 0\r\n\r\nfor i in range(n):\r\n print(a[i])\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nlst=[0]+lst\r\nfor _ in range(int(input())):\r\n i,shot=map(int,input().split())\r\n if i==n:\r\n lst[i-1]+=shot-1\r\n lst[i]=0\r\n\r\n elif i==1:\r\n lst[i+1]+=lst[i]-shot\r\n lst[i]=0\r\n\r\n else:\r\n lst[i-1]+=shot-1\r\n lst[i+1]+=lst[i]-shot\r\n lst[i]=0\r\nprint(lst[1:],sep=\"\\n\")\r\n", "n = int(input())\r\narr = [0] + list(map(int, input().split())) + [0]\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n arr[x-1] += y - 1\r\n arr[x+1] += arr[x] - y\r\n arr[x] = 0\r\nprint('\\n'.join(map(str, arr[1:-1])))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nfor _ in range(m):\r\n x,y=map(int,input().split())\r\n x=x-1\r\n if x>0:\r\n a[x-1]+=(y-1)\r\n if x<n-1:\r\n a[x+1]+=(a[x]-y)\r\n a[x]=0\r\n\r\nfor i in a:\r\n print(i)\r\n \r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nfor x in range(int(input())):\r\n a,b = map(int, input().split())\r\n if a - 2 >= 0: l[a - 2] += b - 1\r\n if a < n: l[a] += l[a - 1] - b\r\n l[a - 1] = 0\r\nprint(l)\r\n", "wires=int(input())\r\nbirds=list(map(int,input().split(\" \")))\r\nshoots=int(input())\r\nshooted=[]\r\nfor i in range(shoots):\r\n shooted.append(list(map(int,input().split(\" \"))))\r\nfor i in range(shoots):\r\n wire=shooted[i][0]-1\r\n right=birds[wire]-shooted[i][1]\r\n left=birds[wire]-right-1\r\n if wire>0:\r\n birds[wire - 1]+=left\r\n if wire<len(birds)-1:\r\n birds[wire+1]+=right\r\n birds[wire]=0\r\nfor i in birds:\r\n print(i)", "kprvda = int(input())\r\nprovoda = list(map(int, input().split(\" \")))\r\nkilled = int(input())\r\nfor i in range(killed):\r\n x, y = map(int, input().split(\" \"))\r\n up = y-1\r\n dn = provoda[x-1] - y\r\n provoda[x - 1] -=1\r\n if(x-2) == -1:\r\n provoda[x - 1] -=up\r\n else:\r\n provoda[x-2] += up\r\n provoda[x - 1] -=up\r\n\r\n if x == kprvda:\r\n provoda[x - 1] -= dn\r\n\r\n else:\r\n provoda[x] += dn\r\n provoda[x - 1] -= dn\r\n\r\nfor i in range(0, kprvda,1):\r\n print(provoda[i])", "# tc = int(input())\r\nfor i in range(1):\r\n n = int(input())\r\n li =list(map(int,input().split()))\r\n x = int(input())\r\n ans = 0\r\n for i in range(x):\r\n lix = list(map(int,input().split()))\r\n\r\n if lix[0]-2>=0:\r\n li[lix[0]-2] += lix[1]-1\r\n if lix[0]<n: \r\n li[lix[0]] += li[lix[0]-1]-lix[1]\r\n li[lix[0]-1] = 0\r\n \r\n \r\n\r\n\r\n for i in li:\r\n print(i)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(): # one integer input\r\n return(int(input()))\r\ndef inlt(): # list input\r\n return(list(map(int,input().split())))\r\ndef insr(): # string input\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr(): # muliple integer variables input\r\n return(map(int,input().split()))\r\n\r\nwires = inp()\r\nbirds = inlt()\r\nshot = input()\r\n\r\nfor i in range(int(shot)):\r\n x, y = invr()\r\n x -= 1\r\n if x > 0:\r\n birds[x-1] += y-1\r\n if x < wires - 1:\r\n birds[x+1] += birds[x] - y\r\n birds[x] = 0\r\n\r\nfor wire in range(len(birds)):\r\n print(birds[wire])\r\n ", "n=int(input())\r\na=input()\r\na=a.split()\r\nfor i in range(n): a[i]=int(a[i])\r\nm=int(input())\r\nfor i in range(m):\r\n z=input()\r\n x=int(z.split()[0])\r\n y=int(z.split()[1])\r\n L=y-1\r\n R=a[x-1]-L-1\r\n a[x-1]=0\r\n if x!=1: a[x-2]+=L\r\n if x!=n: a[x]+=R\r\nfor i in range(len(a)):\r\n print(a[i])\r\n \r\n", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\narr = list(map(int,stdin.readline().split()))\r\nm = int(stdin.readline())\r\ninp = []\r\nfor _ in range(m):\r\n x,y = map(int,stdin.readline().split())\r\n inp.append([x,y])\r\nfor i in inp:\r\n x,y = i[0],i[1]\r\n if x!=1:\r\n arr[x-2] += y-1\r\n if x!=n:\r\n arr[x] += arr[x-1]-y\r\n arr[x-1]=0\r\nfor i in arr:\r\n stdout.write(str(i)+'\\n')\r\n", "# link: https://codeforces.com/contest/294/problem/A\r\n\r\nn_wires = int(input())\r\nn_birds_lst = list(map(int, input().split()))\r\n\r\nn_shoots = int(input())\r\nfor i in range(n_shoots):\r\n idx_wire, idx_bird = (int(x) for x in input().split())\r\n\r\n idx_wire = idx_wire - 1 # make it zero-indexing\r\n idx_bird = idx_bird - 1 # make it zero-indexing\r\n\r\n n_birds_on_left = idx_bird\r\n n_birds_on_right = n_birds_lst[idx_wire] - 1 - n_birds_on_left\r\n\r\n if idx_wire > 0:\r\n n_birds_lst[idx_wire - 1] += n_birds_on_left\r\n\r\n if idx_wire < (n_wires - 1):\r\n n_birds_lst[idx_wire + 1] += n_birds_on_right\r\n\r\n n_birds_lst[idx_wire] = 0\r\n\r\nfor i in range(n_wires):\r\n print(n_birds_lst[i])\r\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n p,k = list(map(int,input().split()))\r\n p-=1\r\n tempp = lst[p]- k\r\n tempm = lst[p] - tempp -1\r\n if p-1 >=0 and p+1 < n:\r\n lst[p-1] += tempm\r\n lst[p+1] += tempp\r\n elif p+1 < n:\r\n lst[p+1] += tempp\r\n elif p-1 >=0:\r\n lst[p-1] += tempm\r\n lst[p] = 0\r\nfor i in range(n):\r\n print(lst[i])\r\n", "n=int(input())\nw=[0] + input().split() + [0]\nw=list(map(int, w))\nm=int(input())\nfor i in range(1,m+1):\n x,y=input().split()\n x=int(x)\n y=int(y)\n temp=w[x]\n w[x]=0\n w[x-1]+=y-1\n w[x+1]+=temp-y\nfor i in range(1,len(w)-1):\n print(w[i])", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n xi, yi = map(int, input().split())\r\n xi -= 1\r\n if xi > 0:\r\n a[xi-1] += yi-1\r\n if xi < n-1:\r\n a[xi+1] += a[xi] - yi\r\n a[xi] = 0\r\n\r\nfor x in a:\r\n print(x)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n right=a[x-1]-y\r\n left=y-1\r\n x=x-1\r\n if x!=0:\r\n a[x-1]+=left\r\n if x!=(n-1):\r\n a[x+1]+=right\r\n \r\n a[x]=0\r\n \r\n \r\n \r\nfor i in a:\r\n print(i)", "n = int(input())\r\nnum_birds = list(map(int, input().split()))\r\nm = int(input())\r\nfor _ in range(m):\r\n wire, bird = map(int, input().split())\r\n left_birds = bird - 1\r\n right_birds = num_birds[wire - 1] - bird\r\n num_birds[wire - 1] = 0\r\n if wire > 1:\r\n num_birds[wire - 2] += left_birds\r\n if wire < n:\r\n num_birds[wire] += right_birds\r\nfor i in num_birds:\r\n print(i)", "def i(): return [map(int, input().split())]\r\nn = i()[0]\r\na = [0]+i()+[0]\r\nfor _ in [0]i()[0]:\r\n x, y = i()\r\n a[x-1] += y-1\r\n a[x+1] += a[x]-y\r\n a[x] = 0\r\nprint(a[1:n+1],sep='\\n')", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\n\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tx-=1\r\n\t#a[x]-=1\r\n\tleft=0\r\n\tright=0\r\n\tif x!=0:\r\n\t\tleft=y-1\r\n\t\ta[x-1]+=left\r\n\tif x!=n-1:\r\n\t\tright=a[x]-y\r\n\t\ta[x+1]+=right\r\n\ta[x]=0\r\nfor i in range(n):\r\n\tprint(a[i])", "\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n lst = list(map(int,input().split()))\r\n m = int(input())\r\n for i in range(m):\r\n x,y = map(int,input().split())\r\n x -= 1\r\n a = lst[x] - y\r\n b = y - 1\r\n if x == n-1:\r\n lst[x-1] += b\r\n elif x == 0:\r\n lst[x+1] += a\r\n else:\r\n lst[x+1] += a\r\n lst[x-1] += b\r\n lst[x] = 0\r\n for l in lst:\r\n print(l)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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 operator as op\r\nimport re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom functools import reduce\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\ndef def_value():\r\n return 0\r\n\r\n\r\nn = inp()\r\na = [0]\r\na += inlist()\r\n\r\nm = inp()\r\nfor _ in range(m):\r\n x, y = invr()\r\n\r\n if x - 1 > 0:\r\n a[x-1] += (y-1)\r\n if x + 1 <= n:\r\n a[x+1] += a[x] - y\r\n a[x] = 0\r\nfor i in range(1, n+1):\r\n print(a[i])\r\n", "n = int(input())\r\nli = list(map(int, input().split()))\r\nli.insert(0, \"\")\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if(x+1 <= n):\r\n li[x+1] += (li[x] - y)\r\n if(x-1 >= 1):\r\n li[x-1] += (y-1)\r\n li[x] = 0\r\nfor i in li:\r\n print(i)", "#https://codeforces.com/contest/294/problem/A\r\n\r\nl = input()\r\n\r\ninitial = [int(i) for i in input().split(' ')]\r\n\r\nshots= int(input())\r\n\r\nfor i in range(shots):\r\n wire,pos=input().split(' ')\r\n wire=int(wire)-1\r\n pos=int(pos)\r\n\r\n\r\n\r\n #stanga sar jos (i-1) toate pana la pos\r\n jumpDown=pos-1\r\n\r\n # dreapta sar sus (i+1) toate dupa pos\r\n jumpUP = initial[wire]-pos\r\n\r\n\r\n if(wire-1>=0):\r\n initial[wire-1]+=jumpDown\r\n if(wire+1<len(initial)):\r\n initial[wire+1]+=jumpUP\r\n\r\n initial[wire]=0\r\n\r\nfin=''\r\nfor i in initial:\r\n fin+=str(i)+' '\r\n\r\nprint(fin[:-1])\r\n", "lin=int(input())\r\nlislin=list(map(int,input().split()))\r\nt=int(input())\r\nll,rl=0,lin-1\r\nfor i in range(t):\r\n x,y=list(map(int,input().split()))\r\n l=y-1\r\n r=lislin[x-1]-y\r\n # print(\"x= \",lislin[x-1],\" l= \",l,\" r=\",r)\r\n if x-2>=ll:lislin[x-2]+=l\r\n if x<=rl: lislin[x]+=r\r\n lislin[x-1]=0\r\n # print(\"x-1= \",lislin[x-2],\" x=\",lislin[x-1], \" x+1=\",lislin[x])\r\n\r\nfor i in lislin:\r\n print(i)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nm=int(input())\r\nfor i in range(m):\r\n x, y = [int(i) for i in input().split()]\r\n if x<n:\r\n a[x]+= a[x-1]-y\r\n if -1<x-2:\r\n a[x-2]+=y-1\r\n a[x-1]=0\r\nfor i in a:\r\n print(i)", "n = int (input ())\r\n\r\n\r\na = input ().split ()\r\na = [int (i) for i in a]\r\n\r\ns = int (input ())\r\n\r\nfor i in range (s):\r\n rgt = 0\r\n lft = 0\r\n\r\n x, y = input ().split ()\r\n x, y = int (x), int (y)\r\n x -=1\r\n\r\n rgt = a[x] - y\r\n lft = a[x] - (rgt + 1)\r\n a[x] = 0\r\n\r\n try:\r\n a[x + 1] += rgt\r\n except IndexError:\r\n a[x] += 0\r\n\r\n if x - 1 < 0:\r\n a[x] +=0\r\n else:\r\n a[x - 1] += lft\r\n\r\n\r\nfor i in range (n):\r\n print (a[i])", "lines = int(input())\r\nbirds = list(map(int, input().split()))\r\nshots = int(input())\r\nfor _ in range(shots):\r\n i, po = map(int, input().split())\r\n if i != lines:\r\n birds[i] = birds[i] + birds[i-1] - po\r\n if i != 1:\r\n birds[i-2] = birds[i-2] + po - 1\r\n\r\n birds[i - 1] = 0\r\n\r\nfor num in birds:\r\n print(num)\r\n", "rows = int(input())\r\nbirdsOnRow = [int(i) for i in input().split()]\r\nshots = int(input())\r\nfor _ in range(shots):\r\n row, bird = [int(i) for i in input().split()]\r\n row -= 1\r\n bird -= 1\r\n left = (birdsOnRow[row] - 1) - bird\r\n right = (birdsOnRow[row] - 1) - left\r\n birdsOnRow[row] = 0\r\n if row+1 <= len(birdsOnRow) - 1:\r\n birdsOnRow[row + 1] += left\r\n if row-1 >= 0:\r\n birdsOnRow[row - 1] += right\r\nfor _ in birdsOnRow:\r\n print(_)", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr = [0] + arr + [0]\r\ncases = int(input())\r\nwhile cases:\r\n cases -= 1\r\n a, b = map(int, input().split())\r\n arr[a-1] += (b - 1)\r\n arr[a+1] += (arr[a] - b)\r\n arr[a] = 0\r\nfor i in arr[1:-1]:\r\n print(i)\r\n\r\n", "# https://codeforces.com/contest/294/problem/A\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nfor i in range(int(input())):\r\n line, pos = list(map(int, input().split()))\r\n\r\n if line > 1:\r\n l[line - 2] += pos - 1\r\n \r\n if line < n:\r\n l[line] += l[line - 1] - pos\r\n \r\n l[line - 1] = 0\r\n\r\nfor i in l:\r\n print(i)", "import sys\r\nimport math\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\n3\r\n3 2\r\n5 3\r\n1 1\r\n\r\n[1, 3]\r\n[2, 4, 5]\r\n[]\r\n\r\nI think it's just \r\n[k//2, k-1] + [k+1, n]\r\n\r\n'''\r\n\r\ndef solve():\r\n n = II()\r\n birds = LII()\r\n m = II()\r\n for _ in range(m):\r\n x, y = MII()\r\n # 0 indexing\r\n x -= 1\r\n\r\n # Jump Left\r\n if x > 0:\r\n birds[x-1] += y-1\r\n\r\n # Jump Right\r\n if x < n-1:\r\n birds[x+1] += birds[x]-y\r\n\r\n birds[x] = 0\r\n\r\n WRITE(birds)\r\n\r\nsolve()", "n = int(input()) \r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n x, y = map(int, input().split()) \r\n if (x - 2) >= 0: \r\n a[x - 2] += y - 1\r\n if x < len(a): \r\n a[x] += a[x - 1] - y\r\n a[x - 1] = 0 \r\nfor i in range(len(a)): \r\n print(a[i])", "# http://codeforces.com/contest/294/problem/A\n\ndef solution(a, n, xy, m):\n for x, y in xy:\n if x > 1:\n a[x - 2] += y - 1\n if x < n:\n a[x] += a[x - 1] - y\n\n a[x - 1] = 0\n\nif __name__ == \"__main__\":\n n = int(input())\n a = list(map(int, input().split()))\n m = int(input())\n xy = []\n for _ in range(m):\n xy.append(tuple(map(int, input().split())))\n\n solution(a, n, xy, m)\n for i in a:\n print(i)", "inputs = lambda: list(map(int, input().split()))\r\n\r\nnum_wires, = inputs()\r\n\r\nnum_birds_per_wire = inputs()\r\n\r\nnum_shots = int(input())\r\n\r\nfor i in range(num_shots):\r\n\r\n x, y = inputs()\r\n x, y = x-1, y-1\r\n\r\n if x > 0:\r\n num_birds_per_wire[x - 1] += y\r\n\r\n if x < num_wires - 1:\r\n num_birds_per_wire[x + 1] += num_birds_per_wire[x] - y - 1\r\n\r\n num_birds_per_wire[x] = 0\r\n\r\nprint('\\n'.join(map(str, num_birds_per_wire)))\r\n", "from typing import TypeVar\r\n\r\nith_wire = TypeVar('ith_wire', int, str)\r\nith_bird = TypeVar('ith_bird', int, str)\r\n\r\n\r\ndef cal_num_birds(birds_on_wires: list[int], shouted_birds: list[tuple[ith_wire, ith_bird]]) -> list[int]:\r\n\r\n for wire, bird in shouted_birds:\r\n\r\n wire_addjust = wire - 1\r\n\r\n # left birds to top\r\n if (wire_addjust - 1 >= 0):\r\n birds_on_wires[wire_addjust - 1] \\\r\n += bird - 1\r\n\r\n # Right birds to bottom\r\n if (wire_addjust + 1 < len(birds_on_wires)):\r\n birds_on_wires[wire_addjust + 1] \\\r\n += birds_on_wires[wire_addjust] - bird\r\n\r\n birds_on_wires[wire_addjust] = 0\r\n\r\n return birds_on_wires\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n wires_num = int(input()) # number of wires\r\n\r\n # list number of birds on each wire\r\n birds_on_wires = list(map(int, input().split()))\r\n\r\n shoots_num = int(input()) # num of shots\r\n shouted_birds: list[tuple[ith_wire, ith_bird]] = [\r\n list(map(int, input().split())) for _ in range(shoots_num)]\r\n\r\n print(cal_num_birds(birds_on_wires, shouted_birds), sep='\\n')\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n for _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n if a - 1 >= 0:\r\n A[a-1] += b - 1\r\n if a + 1 < n:\r\n A[a+1] += A[a] - b\r\n A[a] = 0\r\n print('\\n'.join(list(str(a) for a in A)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\na = [int(s) for s in input().split(' ')]\r\nm = int(input())\r\nfor shot in range(m):\r\n x, y = [int(s) for s in input().split(' ')]\r\n if x > 1:\r\n a[x - 2] += y - 1\r\n if x < n:\r\n a[x] += a[x - 1] - y\r\n a[x - 1] = 0\r\nfor wire in a:\r\n print(wire)", "# wires\nn = int(input())\n\nwires = list(map(lambda x: int(x), input().split(\" \")))\n\nshots = int(input())\nfor i in range(shots):\n x,y = map(lambda x: int(x), input().split(\" \"))\n i = x - 1\n birds = wires[i]\n wires[i] = 0\n\n if i - 1 >= 0:\n wires[i-1] += y - 1\n if i + 1 < len(wires):\n wires[i+1] += birds - y\n\nfor wire in wires:\n print(wire)\n \n", "input()\r\nA=list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n w, b = map(int,input().split())\r\n up = b - 1\r\n do = A[w-1] - b\r\n A[w-1] = 0\r\n if w - 2 >=0: A[w-2] += up\r\n if w < len(A): A[w] += do\r\nfor a in A:\r\n print(a) ", "n = int(input())\r\narr = input().split(' ')\r\nfor i in range(len(arr)):\r\n arr[i] = int(arr[i])\r\n\r\nm = int(input())\r\nwhile m:\r\n m-=1\r\n arr1 = input().split(' ')\r\n wire_index = int(arr1[0])-1\r\n goal = int(arr1[1])\r\n\r\n wire_count = arr[wire_index]\r\n up_count = goal-1\r\n down_count = wire_count-goal\r\n\r\n if(wire_index>0):\r\n arr[wire_index-1] += up_count\r\n if(wire_index < n-1 ):\r\n arr[wire_index+1] += down_count\r\n arr[wire_index] = 0\r\n\r\nfor i in arr:\r\n print(i)\r\n\r\n", "n=int(input())\r\ns=[0]+list(map(int,input().split()))+[0]\r\nm=int(input())\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n s[a+1]+=s[a]-b\r\n s[a]=0\r\n s[a-1]+=b-1\r\n \r\nfor i in range(n):\r\n print(s[i+1])", "n = int(input()) # Number of wires\r\nbirds_on_wire = list(map(int, input().split())) # Initial number of birds on each wire\r\nm = int(input()) # Number of shots\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split()) # x: wire number, y: bird position from left\r\n x -= 1 # Adjust the 0-based index\r\n birds_on_wire[x] -= y # Decrease the number of birds on the x-th wire\r\n if x > 0:\r\n birds_on_wire[x - 1] += y - 1 # Birds to the left\r\n if x < n - 1:\r\n birds_on_wire[x + 1] += birds_on_wire[x] # Birds to the right\r\n birds_on_wire[x] = 0 # Birds on the shot wire\r\n\r\n# Print the updated number of birds on each wire\r\nfor birds in birds_on_wire:\r\n print(birds)\r\n", "def main():\n n_wires = int(input())\n n_birds = [int(_) for _ in input().split()]\n n_shots = int(input())\n\n for _ in range(n_shots):\n [x, y] = [int(_) for _ in input().split()]\n n_birds_before = n_birds[x - 1]\n birds_left = y - 1\n birds_right = n_birds_before - y\n\n if x > 1:\n n_birds[x - 2] += birds_left\n\n if x < n_wires:\n n_birds[x] += birds_right\n\n n_birds[x - 1] = 0\n\n for i in range(n_wires):\n print(n_birds[i])\n\n\nif __name__ == '__main__':\n main()\n", "x = int(input())\r\ny =list(map(int, input().split()))\r\nz = int(input())\r\nf = 0\r\nfor i in range(z):\r\n a,b= map(int,input().split())\r\n a-=1\r\n if a-1>=0:\r\n y[a-1]+=b-1\r\n if a+1<x:\r\n y[a+1]+=(y[a]-b)\r\n y[a]=0\r\nfor i in y:\r\n print(i)\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nshots = int(input())\r\nfor i in range(shots):\r\n wire, oskol = map(int, input().split())\r\n # index 0\r\n if wire == 1:\r\n if wire == len(a):\r\n a[wire-1] = 0\r\n else:\r\n a[1] += a[0] - oskol\r\n a[0] = 0\r\n else:\r\n if wire == len(a):\r\n t = a[wire-1] - oskol\r\n a[wire-2] += (a[wire-1] - t) - 1\r\n a[wire-1] = 0\r\n else:\r\n t = a[wire-1] - oskol\r\n a[wire] += t\r\n a[wire-2] += (a[wire-1] - t) - 1\r\n a[wire-1] = 0\r\nfor i in a:\r\n print(abs(i))", "wire_count = int(input())\nwires = [x for x in map(int, input().split())]\nwires.insert(0,0)\nfor _ in range(int(input())):\n wire, bird = map(int, input().split())\n left_remaining_birds = (0 + bird) - 1\n right_remaining_birds = wires[wire] - bird\n if wire == len(wires)-1:\n wires[wire] = 0\n wires[wire - 1] += left_remaining_birds\n else:\n wires[wire - 1] += left_remaining_birds\n wires[wire] = 0\n wires[wire + 1] += right_remaining_birds\nres = \"\\n\".join(map(str, wires[1:]))\nprint(res)\n\n# 5\n# 58 51 45 27 48\n# 5\n# 4 9\n# 5 15\n# 4 5\n# 5 8\n# 1 43\n", "import sys\n\nget_int_list = lambda: list(map(int, sys.stdin.readline().rstrip(\"\\n\\r\").split()))\n\ndef main():\n input() # Useless\n wires = {k+1:v for k,v in enumerate(get_int_list())}\n for _ in range(int(input())):\n x, y = get_int_list()\n left = y - 1 # For the dead bird\n right = wires[x] - y\n wires[x] = 0\n if x-1 in wires:\n wires[x-1] += left\n if x+1 in wires:\n wires[x+1] += right\n print(wires.values(),sep=\"\\n\")\n \n \n \n \nmain()", "def solve(arr, birds):\n for i, v in enumerate(arr):\n w_index = v[0] - 1\n lb = v[1]-1\n rb = birds[w_index] - lb - 1 \n if w_index != 0:\n birds[w_index-1] += lb\n if w_index != len(birds)-1 :\n birds[w_index+1] += rb\n birds[w_index] = 0\n for i in birds:\n print(i)\n\ndef main():\n n = int(input())\n birds = list(map(int, input().split(' ')))\n m = int(input())\n arr = []\n for i in range(m):\n el = list(map(int, input().split(' ')))\n arr.append(el)\n solve(arr, birds)\nmain()\n", "def solve(t_id):\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n m = int(input())\r\n for i in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if x > 0:\r\n a[x - 1] += y - 1\r\n if x < n - 1:\r\n a[x + 1] += a[x] - y\r\n a[x] = 0\r\n print(a, sep = '\\n')\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", "n = int(input())\r\nlist_a = [int(x) for x in input().split(' ')]\r\nlist_a.append(0)\r\nm = int(input())\r\nfor i in range(m):\r\n list_m = [int(x) for x in input().split(' ')]\r\n pos = list_m[0] - 1\r\n val = list_m[1]\r\n list_a[pos + 1] += list_a[pos] - val\r\n list_a[pos - 1] += val - 1\r\n list_a[pos] = 0\r\nfor j in range(n):\r\n print(list_a[j])", "n = int(input())\r\na = input().split(\" \")\r\na = [int(i) for i in a]\r\na.insert(0, 0)\r\na.append(0)\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = input().split(\" \")\r\n x, y = int(x), int(y)\r\n a[x-1] += y - 1\r\n a[x+1] += a[x] - y\r\n a[x] = 0\r\nfor i in range(1,len(a)-1):\r\n print(a[i])", "n = int(input())\r\nbirds = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n y -= 1\r\n if x > 0:\r\n birds[x - 1] += y\r\n if x < n - 1:\r\n birds[x+1] += birds[x] - y - 1\r\n birds[x] = 0\r\nfor bird in birds:\r\n print(bird)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na.insert(0,0)\r\na.append(0)\r\nm = int(input())\r\nfor i in range(m):\r\n\tj,k = map(int,input().split())\r\n\ta[j-1]+=(k-1)\r\n\ta[j+1]+=(a[j]-k)\r\n\ta[j] = 0\r\nfor i in range(1,n+1):\r\n\tprint(a[i])", "from sys import stdin\r\nn=int(stdin.readline())\r\na=list(map(int,stdin.readline().rstrip().split()))\r\na.insert(0,0)\r\na.append(0)\r\n\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=list(map(int,input().split()))\r\n a[x-1]+=y-1\r\n a[x+1]+=a[x]-y\r\n a[x]=0\r\na.pop()\r\n \r\na.pop(0)\r\nfor i in a:\r\n print(i)\r\n ", "def inp():\r\n x = input()\r\n return list(map(eval, x.split(\" \")))\r\n\r\ndef main():\r\n\r\n n = int(input())\r\n birds = inp()\r\n\r\n numbirds = {}\r\n\r\n for i in range(n):\r\n if i+1 not in numbirds:\r\n numbirds[i+1] = birds[i]\r\n\r\n m = int(input())\r\n killed = []\r\n\r\n for j in range(m):\r\n kill = inp()\r\n killed.append(kill)\r\n\r\n for kill in killed:\r\n if kill[0]-1 >= 1:\r\n numbirds[kill[0]-1] += kill[1] - 1\r\n if kill[0]+1 <= n:\r\n numbirds[kill[0]+1] += numbirds[kill[0]] - kill[1]\r\n numbirds[kill[0]] = 0 \r\n \r\n for val in numbirds.values():\r\n print(val)\r\n\r\n \r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nbirds = list(map(int, input().split()))\r\nm = int(input())\r\nlog = []\r\nfor i in range(m):\r\n log.append(list(map(int, input().split())))\r\nfor shot in log:\r\n wire = shot[0]\r\n left = shot[1]\r\n toLeft = left - 1\r\n toRight = birds[wire - 1] - toLeft - 1\r\n birds[wire - 1] = 0\r\n if(wire > 1):\r\n birds[wire - 2] += toLeft\r\n if(wire < len(birds)):\r\n birds[wire] += toRight\r\nfor i in birds:\r\n print(i)\r\n", "n = int(input())\na = [int(i) for i in input().split()]\nm = int(input())\nwhile m:\n x, y = input().split()\n x = int(x) - 1\n y = int(y)\n if x != 0:\n a[x - 1] += y - 1\n if x < n - 1:\n a[x + 1] += a[x] - y\n a[x] = 0\n m -= 1\nfor i in range(n):\n print(a[i])\n\n \t \t \t\t \t \t", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nm=int(input())\r\nb=[]\r\nfor i in range(m):\r\n b.append([int(x) for x in input().split()])\r\nif n==1:\r\n if m==0:\r\n print(a[0])\r\n else:\r\n print(0)\r\nelse:\r\n for i in range(m):\r\n if b[i][0]==1:\r\n a[1]+=(a[0]-b[i][1])\r\n a[0]=0\r\n elif b[i][0]==n:\r\n a[n-2]+=(b[i][1]-1)\r\n a[n-1]=0\r\n else:\r\n a[b[i][0]-2]+=(b[i][1]-1)\r\n a[b[i][0]]+=(a[b[i][0]-1]-b[i][1])\r\n a[b[i][0]-1]=0\r\n for i in a:\r\n print(i)", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\na = [0] + [int(x) for x in input().split()] + [0]\n\nfor _ in range(int(input())):\n x, y = map(int, input().split())\n a[x + 1] += a[x] - y\n a[x - 1] += y - 1\n a[x] = 0\n\nprint('\\n'.join(map(str, a[1:-1])))\n", "n, a = int(input()), [int(i) for i in input().split()]\nm = int(input())\nfor _ in range(m):\n x, y = (int(i) for i in input().split())\n if x < n:\n a[x] += a[x - 1] - y\n if x > 1:\n a[x - 2] += y - 1\n a[x - 1] = 0\nres = a\nprint(res, sep=\"\\n\")\n", "num_of_wires = int(input())\r\nbirds = list(map(int, input().split()))\r\nnum_of_shots = int(input())\r\n\r\n\r\ndef doer():\r\n for i in range(num_of_shots):\r\n x, y = input().split()\r\n if int(x) != 1:\r\n birds[int(x) - 2] += int(y) - 1\r\n if int(x) != len(birds):\r\n birds[int(x)] += birds[int(x) - 1] - int(y)\r\n\r\n birds[int(x) - 1] = 0\r\n\r\n\r\nif __name__ == '__main__':\r\n doer()\r\n for k in birds:\r\n print(k)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nq = int(input())\r\nfor i in range(q):\r\n wire, left = list(map(int, input().split()))\r\n wire -= 1\r\n if wire > 0:\r\n arr[wire-1] += left-1\r\n if wire < n-1:\r\n arr[wire+1] += arr[wire] - left\r\n arr[wire] = 0\r\nfor i in arr:\r\n print(i)", "'''HackerRank: Shaass and Oskols'''\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n m = int(input())\r\n for _ in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if x - 1 >= 0:\r\n a[x - 1] += y - 1\r\n\r\n if x + 1 < len(a):\r\n a[x + 1] += a[x] - y\r\n\r\n a[x] = 0\r\n\r\n print(a, sep='\\n')\r\n", "n = int(input())\r\nbirds = list(map(int, input().split(\" \")))\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n shot = list(map(int, input().split(\" \")))\r\n shot[0]-=1\r\n if shot[0] < n-1:\r\n birds[shot[0]+1] += birds[shot[0]] - shot[1]\r\n if shot[0] != 0:\r\n birds[shot[0]-1] += shot[1]-1\r\n\r\n birds[shot[0]] = 0\r\n\r\nfor bird in birds:\r\n print(bird)\r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nm = int(input())\r\nfor i in range(m) :\r\n x,y = input().split()\r\n x,y = int(x),int(y)\r\n if x < n :\r\n l[x] += (l[x-1] - y)\r\n if x-1 > 0 :\r\n l[x-2] += y-1 \r\n l[x-1] = 0 \r\nfor i in l :\r\n print(i)", "n = int(input())\nar = list(map(int, input().split()))\nm = int(input())\nfor i in range(m):\n x, y = map(int, input().split())\n if x < n:\n ar[x] += ar[x - 1] - y\n if 0 <= x - 2:\n ar[x - 2] += y - 1\n ar[x - 1] = 0\nfor i in ar:\n print(i)", "n=int(input())\r\na=list(map(int,input().split())) #\r\n #a.append([x,y])\r\nq=int(input())\r\nfor i in range(q):\r\n x,y=map(int,input().split())\r\n x-=1\r\n if(x-1>=0):\r\n a[x-1]+=y-1\r\n if(x+1<n):\r\n a[x+1]+=a[x]-y\r\n a[x]=0\r\nfor i in range(n):\r\n print(a[i])\r\n ", "n=int(input())\r\nlist=list(map(int,input().split(' ')))\r\nshot=int(input())\r\nfor i in range(shot):\r\n x,y=(map(int,input().split(' ')))\r\n if x-2 >=0:\r\n list[x-2]+=y-1\r\n if x<=n-1:\r\n list[x]+=list[x-1]-y\r\n list[x-1]=0\r\n\r\nfor i in list:\r\n print(i)\r\n", "n = int(input())\r\narray = [int(x) for x in input().split(\" \")]\r\nm = int(input())\r\nfor i in range(m):\r\n a,b = [int(x) for x in input().split(\" \")]\r\n a = a-1\r\n if a-1>=0:\r\n array[a-1]+= b-1\r\n if a+1<n:\r\n array[a+1]+= array[a]-b\r\n array[a]=0\r\nfor i in array:\r\n print(i,end='\\n')\r\n", "if __name__ == '__main__':\n\tn = int(input())\n\ta = [int(x) for x in input().split()]\n\tm = int(input())\n\tfor _ in range(m):\n\t\tx, y = [int(x) for x in input().split()]\n\t\tx -= 1 # adjust to 0-index\n\t\tif x > 0:\n\t\t\ta[x - 1] += y - 1\n\t\tif x < n - 1:\n\t\t\ta[x + 1] += a[x] - y\n\t\ta[x] = 0\n\tfor x in a:\n\t\tprint(x)\n\t\n", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nmatrix = [[1 for _ in range(arr[i])] for i in range(n)]\r\n\r\nshots = int(input())\r\n\r\nfor shot in range(shots):\r\n\twire, y = list(map(int, input().split()))\r\n\twire = wire - 1\r\n\ty = y - 1\r\n\tif wire - 1 >= 0:\r\n\t\tmatrix[wire-1].extend(matrix[wire][:y])\r\n\tif wire + 1 < n:\r\n\t\tmatrix[wire+1].extend(matrix[wire][y+1:])\r\n\tmatrix[wire] = []\r\n\r\nfor i in matrix:\r\n\tprint(len(i))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n\tx, y = map(int, input().split())\r\n\tif x != 1:\r\n\t\ta[x - 2] += y - 1\r\n\tif x != n:\r\n\t\ta[x] += a[x - 1] - y\r\n\ta[x - 1] = 0\r\nfor _ in a:\r\n\tprint(_)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nm=int(input())\r\nfor w in range(m):\r\n x,y=(int(i) for i in input().split())\r\n if(x!=n):\r\n l[x]+=(l[x-1]-y)\r\n if(x!=1):\r\n l[x-2]+=(y-1)\r\n l[x-1]=0\r\nfor i in range(n):\r\n print(l[i])", "maxArray = int(input())\r\ntotalBirds = [int(x) for x in input().split()]\r\nturns = int(input())\r\nfor i in range(0, turns):\r\n index, bird_number = [int(x) for x in input().split()]\r\n index -= 1\r\n left = bird_number - 1\r\n right = totalBirds[index] - bird_number\r\n totalBirds[index] = 0\r\n if not index == 0:\r\n totalBirds[index - 1] += left\r\n if not index == maxArray - 1:\r\n totalBirds[index + 1] += right\r\nfor i in totalBirds:\r\n print(i, end=\" \")\r\n", "n=int(input())\r\na=(input().split(sep=' ',maxsplit=n))\r\na=[int(x) for x in a]\r\nm=int(input())\r\nfor i in range(1,m+1):\r\n coordinates=input().split(sep=' ',maxsplit=2)\r\n x,y=int(coordinates[0]),int(coordinates[1])\r\n if x-1 >=1 :a[x-1-1]+=y-1\r\n if x+1 <=n :a[x+1-1]+=(a[x-1]-y)\r\n a[x-1]=0\r\nfor j in range(0,n):\r\n print(a[j])", "n = int(input())\r\n\r\nwires = list(map(int, input().split()))\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n wire, bird = map(int, input().split())\r\n \r\n if wire != 1:\r\n wires[wire - 2] += (bird - 1)\r\n \r\n if wire != n:\r\n wires[wire] += wires[wire - 1] - bird\r\n \r\n wires[wire - 1] = 0\r\n \r\nfor i in wires:\r\n print(i)", "n = int(input() )\nl1 = list(map(int, input().strip().split()))\nm = int(input())\nfor d in range(0, m):\n\tx, y = map(int, input().strip().split())\n\n\tif x-1-1 > -1:\n\t\tl1[x-1-1] += y-1\n\tif x-1+1 < n:\n\t\tl1[x-1+1] += l1[x-1] - y\n\tl1[x-1] = 0\n\t# print(l1)\nfor i in l1:\n\tprint(i)", "n, A, m = int(input()), list(map(int, input().split(' '))), int(input())\r\nfor i in range(m):\r\n x, y = list(map(int, input().split(' ')))\r\n if x != 1:\r\n A[x-2] = A[x-2] + y-1\r\n if x != n:\r\n A[x] = A[x] + A[x-1]-y\r\n A[x-1] = 0\r\nprint(A)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split()); x -= 1; y -= 1\r\n if x > 0: A[x-1] += y\r\n if x < n-1: A[x+1] += A[x]-y-1\r\n A[x] = 0\r\nfor a in A:\r\n print(a)", "n=int(input());l=list(map(int,input().split()));l.insert(0,0);l.append(0)\r\nm=int(input())\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tl[x-1]+=y-1;l[x+1]+=l[x]-y;l[x]=0\r\nfor i in range(1,n+1):print(l[i])", "n = int(input())\r\nbirds = [int(i) for i in input().split()]\r\n\r\ncomms = []\r\nfor i in range(int(input())):\r\n comm = [int(i) for i in input().split()]\r\n comms.append(comm)\r\n\r\nfor comm in comms:\r\n x,y = comm[0]-1, comm[1]-1\r\n add_down = (birds[x]-1)-y\r\n add_up = y\r\n if x-1 > -1:\r\n birds[x-1] += add_up\r\n if x+1 < n:\r\n birds[x+1] += add_down\r\n birds[x] = 0\r\n\r\nfor i in birds:\r\n print(i)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nfor i in range(int(input())):\r\n x,y = [int(p) for p in input().split()]\r\n left = y-1 if a[x-1]>=y else 0\r\n right = a[x-1]-left-1\r\n a[x-1] = 0\r\n if x>1:\r\n a[x-2]+=left\r\n if x+1<=n:\r\n a[x]+=right\r\nprint(a)", "# import sys\r\n# sys.stdin = open('./input.txt', 'r')\r\n# sys.stdout = open('./output.txt', 'w')\r\n\r\nn = int(input())\r\nwires = list(map(int, input().split()))\r\nm = int(input())\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n index = x - 1\r\n left = y - 1\r\n right = wires[index] - y\r\n wires[index] = 0\r\n if n > 1:\r\n if not(index):\r\n wires[index+1] += right\r\n elif index == n-1:\r\n wires[index-1] += left\r\n else:\r\n wires[index-1] += left\r\n wires[index+1] += right\r\nprint(*wires, sep='\\n')", "lengthWires = int(input())\r\n\r\nwires = list(map(int,input().split()))\r\nevents = int(input())\r\nfor i in range(events):\r\n x =list(map(int,input().split())) \r\n index = x[0]-1\r\n right = x[1] - 1\r\n left = wires[index] - x[1]\r\n if(index > 0):\r\n wires[index -1] += right\r\n if(index < lengthWires -1 ):\r\n wires[index +1] += left\r\n wires[index] = 0\r\nfor i in wires:\r\n print(i)" ]	{"inputs": ["5\n10 10 10 10 10\n5\n2 5\n3 13\n2 12\n1 13\n4 6", "3\n2 4 1\n1\n2 2", "5\n58 51 45 27 48\n5\n4 9\n5 15\n4 5\n5 8\n1 43", "10\n48 53 10 28 91 56 81 2 67 52\n2\n2 40\n6 51", "2\n72 45\n6\n1 69\n2 41\n1 19\n2 7\n1 5\n2 1", "10\n95 54 36 39 98 30 19 24 14 12\n3\n9 5\n8 15\n7 5", "100\n95 15 25 18 64 62 23 59 70 84 50 26 87 35 75 86 0 22 77 60 66 41 21 9 75 50 25 3 69 14 39 68 64 46 59 99 2 0 21 76 90 12 61 42 6 91 36 39 47 41 93 81 66 57 70 36 68 89 52 1 19 93 67 22 76 20 8 81 98 18 100 73 61 93 75 80 53 72 40 20 2 86 33 59 27 16 11 26 55 44 47 55 94 58 2 55 82 22 9 95\n0", "1\n100\n1\n1 100", "1\n100\n1\n1 1", "1\n50\n1\n1 25", "2\n50 0\n1\n1 1", "1\n10\n0"], "outputs": ["0\n12\n5\n0\n16", "3\n0\n3", "0\n66\n57\n7\n0", "87\n0\n23\n28\n141\n0\n86\n2\n67\n52", "0\n0", "95\n54\n36\n39\n98\n34\n0\n28\n13\n21", "95\n15\n25\n18\n64\n62\n23\n59\n70\n84\n50\n26\n87\n35\n75\n86\n0\n22\n77\n60\n66\n41\n21\n9\n75\n50\n25\n3\n69\n14\n39\n68\n64\n46\n59\n99\n2\n0\n21\n76\n90\n12\n61\n42\n6\n91\n36\n39\n47\n41\n93\n81\n66\n57\n70\n36\n68\n89\n52\n1\n19\n93\n67\n22\n76\n20\n8\n81\n98\n18\n100\n73\n61\n93\n75\n80\n53\n72\n40\n20\n2\n86\n33\n59\n27\n16\n11\n26\n55\n44\n47\n55\n94\n58\n2\n55\n82\n22\n9\n95", "0", "0", "0", "0\n49", "10"]}	UNKNOWN	PYTHON3	CODEFORCES	397
8dbf384ae645ced530cdc48451343e58	Pipeline	Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes, each such pipe should be connected to the water supply. A pipe can be connected to the water supply if there's water flowing out of it. Initially Vova has only one pipe with flowing water. Besides, Vova has several splitters. A splitter is a construction that consists of one input (it can be connected to a water pipe) and x output pipes. When a splitter is connected to a water pipe, water flows from each output pipe. You can assume that the output pipes are ordinary pipes. For example, you can connect water supply to such pipe if there's water flowing out from it. At most one splitter can be connected to any water pipe. Vova has one splitter of each kind: with 2, 3, 4, ..., k outputs. Help Vova use the minimum number of splitters to build the required pipeline or otherwise state that it's impossible. Vova needs the pipeline to have exactly n pipes with flowing out water. Note that some of those pipes can be the output pipes of the splitters. The first line contains two space-separated integers n and k (1<=≤<=n<=≤<=1018, 2<=≤<=k<=≤<=109). 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. Print a single integer — the minimum number of splitters needed to build the pipeline. If it is impossible to build a pipeline with the given splitters, print -1. Sample Input 4 3 5 5 8 4 Sample Output 2 1 -1	[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\n\r\nlo, hi = 0, k\r\nwhile lo < hi:\r\n mid = lo + (hi - lo) // 2\r\n pipes = (mid * (2 * k - mid + 1) // 2) - mid + 1\r\n if pipes >= n:\r\n hi = mid\r\n else:\r\n lo = mid + 1\r\nassert (lo == hi)\r\ntot_pipes = (lo * (2 * k - lo + 1) // 2) - lo + 1\r\nprint(-1 if tot_pipes < n else lo)", "\ndef sum_n(n):\n return (n * (n + 1)) // 2\n\ndef sum_range(s, e):\n if s <= 1:\n return sum_n(e)\n return sum_n(e) - sum_n(s - 1)\n\ndef min_splitters(k, n):\n st, en = 1, k\n\n while st < en:\n md = (st + en) // 2\n s = sum_range(md, k)\n\n if s == n:\n return k - md + 1\n\n if s > n:\n st = md + 1\n else:\n en = md\n\n return k - st + 2\n\nif __name__ == \"__main__\":\n n, k = map(int, input().split())\n\n if n == 1:\n print(0)\n elif n <= k:\n print(1)\n else:\n k -= 1\n n -= 1\n\n if sum_n(k) < n:\n print(-1)\n else:\n print(min_splitters(k, n))\n\n\n\t\t \t\t\t \t\t \t \t \t\t\t \t", "def triangle(i):\n return i * (i + 1) // 2\n\n\ndef floor_sqrt(n):\n s = n >> (n.bit_length() // 2)\n\n # newton’s method. i didn’t actually prove that this always terminates, but it seems to work :P\n while not s2 <= n < (s + 1)2:\n s += (n - s*2) // (2 s)\n\n return s\n\n\ndef floor_inverse_triangle(t):\n return (floor_sqrt(1 + 8 * t) - 1) // 2\n\n\nn, k = map(int, input().split())\nr = triangle(k - 1) - (n - 1)\n\nif r < 0:\n print(-1)\nelse:\n i = floor_inverse_triangle(r)\n print((k - 1) - floor_inverse_triangle(r))\n", "def total(n):\r\n return n(n+1)//2\r\nn,k=input().split()\r\nn,k=int(n),int(k)\r\nn-=1\r\ns=total(k-1)\r\nif s<n:\r\n print(-1)\r\nelse:\r\n l=0\r\n h=k-1\r\n while l<=h:\r\n mid=l+(h-l)//2\r\n if (s-total(mid))>=n:\r\n l=mid+1\r\n else:\r\n h=mid-1\r\n print(k-1-h)\r\n", "f = lambda m, k: (km - m(m-1)//2 - m + 1)\r\n\r\ndef ok(m, k, n):\r\n return f(m, k) >= n\r\n\r\nn, k = map(int, input().split())\r\n\r\nif not ok(k, k, n): print(-1)\r\nelse: \r\n l, h = 0, k\r\n while (h > l):\r\n mid = l + (h - l) // 2\r\n if ok(mid, k, n): h = mid\r\n else: l = mid + 1\r\n print(h)", "n,k = list(map(int, input().split()))\r\n# 2 to k is the splitters type, one for each available\r\n# n pipes\r\n# o/p minimum number of splitters reqd\r\n#recursively we can check if all the splitters sum up to exactly n output\r\n# take the maximum, again take the maximum of left out value\r\nif n==1:\r\n print(0)\r\nelse:\r\n maxSum = (k(k-1))//2\r\n if (n-1)<=maxSum:\r\n target = maxSum - n + 1\r\n left = 2\r\n right = k\r\n # print(maxSum, n, target)\r\n flag = 0\r\n while left<=right:\r\n mid = left+(right-left)//2\r\n sumMid = (mid(mid-1))//2\r\n # print(left, right, mid, sumMid)\r\n if sumMid == target:\r\n print(k-mid)\r\n flag = 1\r\n break\r\n elif sumMid > target:\r\n right = mid-1\r\n elif sumMid<target:\r\n left = mid+1\r\n if flag == 0:\r\n print(k-right)\r\n else:\r\n print(-1)", "n,k = [int(i) for i in input().strip().split()]\r\nma = ((k(k-1))//2)+1\r\nif n>ma:\r\n print(-1)\r\nelse:\r\n lo = 0\r\n hi = k-1\r\n ans = None\r\n while hi>=lo:\r\n mid = (hi+lo)//2\r\n from_st = k-1-mid\r\n curr = ma-(from_st(from_st+1))//2\r\n if curr>=n:\r\n ans = mid\r\n hi = mid-1\r\n else:\r\n lo = mid+1\r\n print(ans)", "import sys\r\nimport math\r\nimport collections\r\nimport random\r\nfrom heapq import heappush, heappop\r\nfrom functools import reduce\r\ninput = sys.stdin.readline\r\n \r\nints = lambda: list(map(int, input().split()))\r\n\r\nn, k = ints()\r\n\r\nl, r = 0, k\r\nwhile l <= r:\r\n m = (l + r) // 2\r\n g = k - m - 1\r\n sm = (k (k - 1)) // 2 + 1 - g * (g + 1) // 2\r\n if sm >= n:\r\n r = m - 1\r\n else:\r\n l = m + 1\r\n\r\nif l == k + 1:\r\n print(\"-1\")\r\nelse:\r\n print(l)", "n,k=map(int,input().split())\r\n\r\nl=-1\r\nr=k+1\r\n\r\ndef check(x):\r\n return (k-x+1+k)x//2-(x-1)\r\n\r\nwhile r-l>1:\r\n m=(l+r)//2\r\n if n>check(m):l=m\r\n else:r=m\r\n\r\nprint(-1 if r==k+1 else r)\r\n", "# if you win, you live. you cannot win unless you fight.\r\nimport string\r\nimport sys\r\nfrom sys import stdin, setrecursionlimit\r\n# fd=open(\"cses.txt\")\r\n# sys.stdin=fd\r\ninput = stdin.readline\r\nrd = lambda: map(lambda s: int(s), input().strip().split())\r\nrdone = lambda: map(lambda s: int(s) - 1, input().strip().split())\r\nri = lambda: int(input())\r\nrs = lambda: input().strip()\r\nfrom collections import defaultdict as unsafedict, deque, Counter as unsafecounter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom sys import setrecursionlimit\r\nfrom math import ceil\r\nfrom bisect import bisect_left\r\n\r\n\r\nn,k=rd()\r\nans=-1\r\nlo,hi=0,k+1\r\nwhile lo<=hi:\r\n mid=(lo+hi)//2\r\n s=k(k+1)//2 -(k-mid+1)(k-mid)//2\r\n if s-mid+1>=n:\r\n ans=mid\r\n hi=mid-1\r\n else:\r\n lo=mid+1\r\nprint(ans)", "def reach_max(n, k):\r\n return n k + 1 - n * (n + 1) // 2\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\nif n == 1:\r\n print(0)\r\n exit()\r\n\r\nlo, hi = 1, k - 1\r\n\r\nif n > reach_max(hi, k):\r\n print(-1)\r\n exit()\r\n\r\nwhile lo < hi:\r\n mid = (lo + hi) // 2\r\n if reach_max(mid, k) < n:\r\n lo = mid + 1\r\n else:\r\n hi = mid\r\n\r\nprint(lo)", "n, k = map(int, input().split())\n\nsumoftpips = (k(k+1))//2\n\nnumberoftpips = k-1\n\n\ndef valid(mid):\n x=mid-1\n midpipesum=(x(x+1))//2\n midpipesnumber=mid-1\n\n midpipesum=sumoftpips-midpipesum\n midpipesnumber=numberoftpips-midpipesnumber\n\n if midpipesum-midpipesnumber >= n:\n return True\n else:\n return False\n\n\nif n==1:\n print(0)\nelse:\n l, r = 1, k + 1\n\n while r - l > 1:\n mid = (l + r) // 2\n if valid(mid):\n l = mid\n else:\n r = mid\n\n if l == 1:\n print(-1)\n else:\n print(k - l + 1)\n \t\t \t\t \t\t\t\t\t\t \t \t \t\t", "n, k = map(int, input().split())\n\ndef good(m):\n l = k - m + 1\n r = l * (m + k) // 2 - (l - 1)\n return r >= n\n\nif n == 1: print(0)\nelif n <= k: print(1)\nelse:\n l = 2; r = k; ans = -1\n while l < r:\n m = l + (r - l) // 2\n if good(m) : \n l = m + 1\n ans = m\n else : r = m\n print(-1 if ans == -1 else k - ans + 1)", "import decimal\r\n\r\nn, k = input().split(' ')\r\nn = int(n)\r\nk = int(k)\r\ncoef1 = (kk-k-2n)100+225\r\nif coef1 < 0:\r\n print('-1')\r\nelse:\r\n D = decimal.Decimal\r\n coef11 = D(coef1)\r\n coef1 = coef11.sqrt()\r\n coef2 = k10-5\r\n coef = (coef2-coef1)/10\r\n if coef % 1 == 0:\r\n print(int(coef))\r\n else:\r\n print(int(coef)+1)\r\n", "n, k = map(int, input().split())\r\nif n == 1:\r\n print(0)\r\nelif (kk -k)//2 +1 < n:\r\n print(-1)\r\nelse:\r\n g, b = 0, k//2\r\n while b != 0:\r\n while g +b <= k and (kk -k)//2 +1 -((g +b)*2 -(g +b))//2 >= n:\r\n g += b\r\n b //= 2\r\n print(k -g)\r\n", "n,k=map(int,input().split())\r\nn-=1;k-=1\r\nl,r=0,k\r\nmm=k(k+1)//2\r\nans=-1\r\nwhile l<=r:\r\n m=(l+r)//2\r\n if mm-m(m+1)//2>=n:\r\n ans=k-m\r\n l=m+1\r\n else:\r\n r=m-1\r\nprint(ans)\r\n", "import sys\nfrom collections import OrderedDict\n\ndef sum_from_two(x):\n '''\n Sum from 2 to x.\n '''\n return x (x + 1) // 2 - 1\n\ndef sum_last(k, x):\n '''\n Sum which the last `x` splitters\n can add.\n '''\n if x == 0:\n return 1\n\n # 2 3 4 ... k. <- We have these splitters.\n # x == 1, just k. sum(2, k) - sum(2, k - x)\n # Each item k_i gives sum k_i - 1\n # Add 1 for initial pipes.\n return sum_from_two(k) - sum_from_two(k - x) - x + 1\n\ndef possible(n, k, x):\n return sum_last(k, x) >= n\n\ndef main(n, k):\n if n == 1:\n # Already have 1.\n return 0\n\n # Can't use any of the splitters.\n if sum_last(k, k - 1) < n:\n return -1\n\n # Use only one splitter.\n minimum = 1\n # Can use at most k - 1 splitters.\n maximum = k - 1\n while minimum <= maximum:\n if minimum == maximum:\n return minimum\n elif minimum == maximum - 1:\n if possible(n, k, minimum):\n return minimum\n else:\n return maximum\n\n mid = (minimum + maximum) // 2\n if possible(n, k, mid):\n # Try if smaller is possible.\n maximum = mid\n else:\n # Need more.\n minimum = mid\n\nif __name__ == \"__main__\":\n curr = None\n for e, line in enumerate(sys.stdin.readlines()):\n n, k = list(map(int, line.strip().split()))\n print(main(n, k))\n", "n , k = map(int , input().split())\r\nn , k = n-1 , k-1\r\n\r\nl = 0\r\nr = k\r\ng = k(k+1)//2\r\nans = -1\r\n\r\nwhile l <= r:\r\n \tm = (l+r)//2\r\n \tif g-m(m+1)//2>=n:\r\n \t\tans = k-m\r\n \t\tl = m+1\r\n \telse:\r\n \t\tr = m-1\r\n\r\nprint(ans)", "n, k = map(int, input().split())\r\nif n == 1:\r\n print(0)\r\n exit()\r\nl = 1; r = k - 1\r\nans = -1\r\nwhile l <= r:\r\n m = (l+r)//2\r\n x = mk - (m(m+1)//2) + 1\r\n if x >= n:\r\n ans = m\r\n r = m - 1\r\n else: l = m + 1\r\nprint(ans)", "n, k = map(int, input().split())\r\n\r\nn, k = n - 1, k - 1\r\n\r\nleft = 0\r\nright = k\r\nsum = k * (k + 1) // 2\r\nresult = -1\r\n\r\nwhile left <= right:\r\n middle = (left + right) // 2\r\n if (sum - middle * (middle + 1) // 2) >= n:\r\n result = k - middle\r\n left = middle + 1\r\n else:\r\n right = middle - 1\r\n\r\nprint(result)", "n,k=map(int,input().split())\r\nn,k=n-1,k-1\r\nl=0\r\nr=k\r\ng=k(k+1)//2\r\nans=-1\r\nwhile l<=r:\r\n\tm=(l+r)//2\r\n\tif (g-m(m+1)//2)>=n:\r\n\t\tans=k-m\r\n\t\tl=m+1\r\n\telse:\r\n\t\tr=m-1\r\nprint(ans)\r\n\r\n", "n, k = map(int, input().split())\r\nl, r = 0, k\r\nans = -1\r\n\r\nwhile l <= r:\r\n med = (l + r) // 2\r\n total_connections = (k * (k - 1)) // 2 - ((k - med) * (k - med - 1)) // 2 + 1\r\n\r\n if total_connections >= n:\r\n r = med - 1\r\n ans = med\r\n else:\r\n l = med + 1\r\n\r\nprint(ans)\r\n", "def sum2(b):\r\n return int(((b/2)(b+1)))\r\ndef sum3(c,v):\r\n if c<=1:\r\n return sum2(v)\r\n return sum2(v)-sum2(c-1)\r\ndef khlsana(end,m):\r\n start=1\r\n ed=end\r\n while start<ed:\r\n mid=int((ed+start)/2)\r\n ss=sum3(mid,end)\r\n if ss==m:\r\n return k-mid+1\r\n if ss>n:\r\n start=mid+1\r\n else: ed=mid\r\n return k-start+2\r\nn,k=input().split()\r\nn,k=int(n),int(k)\r\nif n==1:\r\n print(0)\r\n exit(0)\r\nelif n==k:\r\n print(1)\r\n exit(0)\r\nelse:\r\n k-=1\r\n n-=1\r\nif n>sum2(k):\r\n print(-1)\r\n exit(0)\r\nprint(khlsana(k,n))", "# https://www.youtube.com/watch?v=ipaRrZlzJ_E&ab_channel=AlgorithmDecoded\r\n\r\ndef summ(n): return n(n+1) // 2\r\n\r\ndef solve(n, k):\r\n if n == 1:\r\n return 0\r\n \r\n n -= 1\r\n \r\n if summ(k-1) < n:\r\n return -1\r\n\r\n l = 0\r\n h = k-1\r\n ans = -1\r\n while l <= h:\r\n mid = (l + h) // 2\r\n\r\n t = summ(k-1) - summ(mid-1)\r\n \r\n if t >= n:\r\n ans = k - mid\r\n l = mid + 1\r\n else:\r\n h = mid - 1\r\n \r\n return ans\r\n \r\n\r\nn, k = map(int, input().split(\" \"))\r\nprint(solve(n, k))", "def maxPipesfromK(k):\r\n return k(k-1)//2 + 1\r\n\r\ndef solve():\r\n n,k=map(int,input().split())\r\n mxP=maxPipesfromK(k)\r\n low=0\r\n high=k-1\r\n ans=-1\r\n while low<=high:\r\n mid=(low+high)//2\r\n\r\n maxPipes=mxP-maxPipesfromK(k-mid)+1\r\n if maxPipes<n:\r\n low=mid+1\r\n else:\r\n ans=mid\r\n high=mid-1\r\n print(ans)\r\n\r\nsolve()", "n, k = map(int, input().split())\nm = 2 (n - 1) - k * (k - 1)\nif m > 0: print(-1)\nelse:\n x = int((1 + (1 - 4 * m) ** 0.5) / 2)\n if x * (x - 1) + m > 0: x -= 1\n print(k - x)\n", "# http://codeforces.com/contest/287/problem/B\ndef normal_sum(N):\n\treturn (N ** 2 + N) // 2\n\ndef sum(i, j):\n\n\treturn normal_sum(j) - 1 - (normal_sum(i-1) - 1)\n\n\n\ndef bs_sum(start, end, k, n):\n\t# print(start, end, k, n)\n\tmid = (start+end) // 2\n\n\tif(n - sum(mid, k) >= mid):\n\t\treturn bs_sum(start, mid - 1, k, n)\n\tif(n - sum(mid, k) < 0):\n\t\treturn bs_sum(mid+1, end, k, n)\n\n\treturn k-mid+2 if (n - sum(mid, k)) != 0 else k-mid+1\n\n\nn, k = [int(n) for n in input().split()]\nif (n == 1):\n\tprint( 0 )\nelif n <= k :\n\tprint( 1 )\nelif normal_sum(k) - 1 - (k-2) < n:\n\tprint( -1 )\nelse:\n\tn-=1\n\tk-=1\n\n\t# arr = [2,3,4,5]\n\t# [1,2,3,4]\n\tanswer = (bs_sum(1, k, k, n))\n\tprint(answer)\n", "def solve():\r\n n, k = map(int, input().split())\r\n \r\n left = 0\r\n right = k-1 \r\n result = -1 \r\n \r\n while left <= right:\r\n mid = (left + right) // 2 \r\n s = mid * (2k - mid - 1) // 2 \r\n \r\n if s >= n-1:\r\n result = mid\r\n right = mid - 1 \r\n else:\r\n left = mid + 1 \r\n \r\n print(result)\r\n \r\nsolve()\r\n \r\n ", "import builtins\n\nimport sys\ninput = sys.stdin.readline\n\n\nclass Input:\n @staticmethod\n def str():\n return input().strip()\n\n @staticmethod\n def int():\n return int(input())\n\n @staticmethod\n def float():\n return float(input())\n\n @staticmethod\n def list(type_: builtins):\n return list(map(type_, input().split()))\n\n\nclass Solution:\n def solve(self):\n n, k = Input.list(int)\n\n def check(m: int) -> bool:\n if m == 0:\n return n == 1\n if m == 1:\n return k >= n\n return (k - 1 + k - m) m // 2 + 1 >= n\n\n l, r = 0, k - 1\n while l < r:\n mid = l + (r - l) // 2\n if check(mid):\n r = mid\n else:\n l = mid + 1\n print(l if check(l) else -1)\n\n def main(self):\n self.solve()\n\n\nSolution().main()\n\n\n\n \t\t\t \t\t \t\t \t\t \t \t\t \t\t\t", "n,k = input().split()\r\nn,k = int(n),int(k)\r\n \r\nini,fin = 1,k-1\r\nif n == 1:\r\n\tprint(\"0\")\r\n\texit(0)\r\n \r\nif 1 + (k(k-1) )//2 < n:\r\n\tprint(\"-1\")\r\n\texit(0)\r\n \r\nwhile ini < fin:\r\n\tmid = (ini+fin)//2\r\n\ts = 1 + (k-1)mid - (mid(mid-1))//2\r\n\tif s>=n:\r\n\t\tfin = mid\r\n\telse:\r\n\t\tini = mid+1\r\n \r\nprint(ini)", "def sum(n):\r\n return (n (n+1)) // 2\r\n\r\ndef sum_range(s, e):\r\n if s <= 1:\r\n return sum(e)\r\n return sum(e) - sum(s-1)\r\n\r\ndef splitter(k, n):\r\n start = 1\r\n end = k\r\n while start < end:\r\n md = (start + end) // 2\r\n s = sum_range(md, k)\r\n if s == n:\r\n return k - md + 1\r\n if s > n:\r\n start = md + 1\r\n else:\r\n end = md\r\n return k - start + 2\r\n\r\nif __name__ == '__main__':\r\n # pipeline\r\n n, k = map(int, input().split())\r\n if n == 1:\r\n print(\"0\")\r\n elif n <= k:\r\n print(\"1\")\r\n else:\r\n k -= 1\r\n n -= 1\r\n if sum(k) < n:\r\n print(\"-1\")\r\n else:\r\n print(splitter(k, n))", "n,k = map(int, input().split())\r\nlow = 1\r\nhi = k\r\nok = False\r\ndef kad(n):\r\n return (n(n+1))//2\r\nwhile low <= hi:\r\n mid = (low+hi) // 2\r\n can = kad(k) - kad(k-mid) - mid + 1\r\n if can >= n:\r\n ok = True\r\n hi = mid - 1\r\n else:\r\n low = mid +1\r\nprint(0 if n == 1 else hi+1 if ok else -1)\r\n", "n,k=map(int,input().split())\r\np=k-1\r\nts=1+ p(p+1)//2\r\nlow=0\r\nhigh=10*9\r\nans=0\r\nres=0\r\nrs=0\r\n\r\nwhile low<=high:\r\n mid=(low+high)//2\r\n ls=mid(mid+1)//2\r\n if ts-ls>n:\r\n low=mid+1\r\n else:\r\n res=mid\r\n ans=p-mid\r\n rs=ts-ls\r\n high=mid-1\r\nremain=n-rs\r\nlss=(res-1)res//2\r\n#print(res,ans,remain,rs)\r\nif remain>lss:\r\n print(-1)\r\nelif remain==0:\r\n print(ans)\r\nelse:\r\n print(ans+1)", "\r\n\r\ndef s(n):\r\n return (n(n+1))//2\r\n\r\ndef diff(st,en):\r\n return s(en) - s(st-1)\r\n\r\ndef bs(k,n):\r\n st = 1\r\n en = k\r\n while(st < en):\r\n mid = (st+en)//2\r\n sum = diff(mid,k)\r\n if sum == n:\r\n return k-mid+1\r\n if sum > n:\r\n st = mid+1\r\n else:\r\n en = mid\r\n return k-st+2\r\n\r\n\r\nif __name__ == '__main__':\r\n n,k = map(int,input().split())\r\n if n == 1:\r\n print(0)\r\n elif n <= k:\r\n print(1)\r\n else:\r\n n-=1\r\n k-=1\r\n if s(k) < n:\r\n print(-1)\r\n else:\r\n print(bs(k,n))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from sys import stdin ,stdout \r\ninput=stdin.readline \r\ninp = lambda : map(int,input().split())\r\ndef print(args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\na,b=inp();\r\n\r\nif a==1:\r\n print(0)\r\n exit()\r\n\r\nelif b>=a:\r\n print(1)\r\n exit()\r\n\r\nelse:\r\n a-=1\r\n b-=1\r\n l=0\r\n r=b\r\n x=-1\r\n while l < r :\r\n mid = (r+l)//2\r\n temp= (b(b+1))//2 - (mid (mid+1))//2\r\n \r\n if temp >=a :\r\n x=mid\r\n l=mid+1\r\n else:\r\n r=mid\r\nif x >=0:\r\n print(b-x)\r\nelse:\r\n print(x)\r\n\r\n\r\n\r\n\r\n", "def sum(k):\r\n return k(k+1) // 2\r\n\r\n\r\nd = list(map(int, input().split()))\r\nn = d[0]-1\r\nk = d[1]-1\r\nl = 0\r\nr = k\r\nans = -1\r\n\r\nwhile l <= r:\r\n m = (l+r) // 2\r\n if (sum(k) - sum(m)) >= n:\r\n ans = k - m\r\n l = m + 1\r\n else:\r\n r = m - 1\r\n\r\nprint(ans)", "\r\ndef sm(n):\r\n return int(int(n(n+1))/int(2));\r\ndef summ(en, st):\r\n if(st <= 1):\r\n return sm(en);\r\n return sm(en) - sm(st-1);\r\n\r\ndef bs(n, k):\r\n st = 1;\r\n en = k;\r\n while (st < en):\r\n md = int(int((st+en)) /int(2));\r\n s = summ(k,md);\r\n if(s == n):\r\n return k - md + 1;\r\n elif (s>n):\r\n st = md + 1;\r\n else :\r\n en = md;\r\n return k - st + 2;\r\nn, k = input().split();\r\nn = int(n);\r\nk = int(k);\r\n\r\nif(n == 1):\r\n print(0);\r\nelif (n <= k):\r\n print(1);\r\nelse:\r\n n -= 1;\r\n k -= 1;\r\n if(sm(k) < n ):\r\n print(-1);\r\n else:\r\n print(int(bs(n,k)));\r\n", "\r\ndef sum(n):\r\n return (n(n+1)) // 2\r\n\r\n\r\nn, k = map(int, input().split())\r\nn -= 1\r\ns = sum(k - 1)\r\nif s < n:\r\n print(-1)\r\nelse:\r\n l, h = 0, k - 1\r\n while l <= h: \r\n mid = l + ( h - l) // 2\r\n if (s - sum(mid) >= n): \r\n l = mid + 1\r\n else : \r\n h = mid - 1\r\n print(k - 1 - h)\r\n", "n,k = list(map(int, input().split()))\r\n\r\nans = None\r\nl = 2\r\nr = k\r\nif n==1:\r\n print(0)\r\nelse:\r\n while l<=r:\r\n mid = (l+r)//2\r\n cur = ((k(k+1)//2)) - (((mid-1)(mid)//2)) - (k-mid)\r\n \r\n # print(mid, cur,12122121)\r\n if cur >= n:\r\n ans = mid\r\n l = mid+1\r\n else:\r\n r = mid-1\r\n \r\n print(-1 if not ans else k-ans+1)", "def getSum(n):\r\n return (n * (n + 1)) // 2\r\n\r\n\r\nn, k = map(int, input().split())\r\nn -= 1\r\ns = getSum(k - 1)\r\nif s < n:\r\n print(-1)\r\nelse:\r\n low = 0\r\n high = k-1\r\n while low < high:\r\n mid = (low + high) // 2\r\n if s-getSum(k-mid-1) >= n:\r\n high = mid\r\n else:\r\n low = mid + 1\r\n print(high)\r\n", "casas, tubos = map(int, input().strip().split())\n\ndef bs(c, t):\n l, r = 0, t-1\n while l <= r:\n mid = l+r >> 1\n if ((2t - mid - 1)mid)//2+1 < c:\n l = mid+1\n else:\n r = mid-1\n return r+1\n\nres = bs(casas, tubos)\nprint(-1 if res == tubos else res) \n \n", "def sum(l):\r\n return int((l(l+1))/2)\r\n\r\ndef sume (s,e):\r\n if s <= 1:\r\n return sum(e)\r\n else:\r\n return sum(e) - sum(s-1)\r\n\r\ndef minsplitters(k,n):\r\n st=int(1)\r\n en = int(k)\r\n while(st < en):\r\n md = int((st + en)/2)\r\n s = sume(md, k)\r\n if s == n :\r\n return k - md +1\r\n if s > n :\r\n st = md+1\r\n else:\r\n en = md\r\n return k - st + 2\r\n\r\n\r\n\r\nn,k=map(int,input().split())\r\n\r\nif n==1:\r\n print(0)\r\nelif (n <= k):\r\n print(1)\r\n\r\nelse :\r\n n-=1\r\n k-=1\r\n\r\n if sum(k) < n:\r\n print(-1)\r\n\r\n else:\r\n print(minsplitters(k,n))", "# coding on a smartphone\r\nn, k = map(int, input().split())\r\nL = 0\r\nR = k\r\nwhile L<R:\r\n x = (L+R+1) // 2\r\n c = k(k+1) // 2 - x(x+1)//2 + 1 - (k-x)\r\n if n <= c:\r\n L = x\r\n else:\r\n R = x - 1\r\nif L == 0: print(-1)\r\nelse: print(k - L)", "n, k = map(int, input().split())\r\n\r\ndef bin(n, k):\r\n high = k\r\n low = 1\r\n while low <= high:\r\n mid = (low+high)//2\r\n val = (mid (k-mid+1+k))// 2 + 1\r\n if val == n:\r\n return mid\r\n elif val > n:\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\n return mid\r\n\r\nif n == 1:\r\n print(0)\r\nelse:\r\n k = k - 1\r\n if (k(k+1))//2 + 1 < n:\r\n print(-1)\r\n else:\r\n mid = bin(n, k)\r\n if (mid (k-mid+1+k))// 2 + 1 < n:\r\n print(mid + 1)\r\n else:\r\n print(mid)\r\n", "def solve(n, k):\n total = k * (k - 1) // 2 + 1 \n if total < n:\n return -1 \n elif total == n:\n return k - 1 \n else:\n low = 1\n high = k\n while low < high:\n mid = (low + high) // 2 \n if total - mid * (mid + 1) // 2 >= n: \n low = mid + 1 \n else:\n high = mid \n return k - high \n\nn, k = map(int, input().strip().split())\nprint(solve(n, k))\n\n \t \t\t \t \t\t \t \t\t\t\t\t \t \t", "import bisect\r\n\r\nn, k = map(int, input().split())\r\n\r\nif n == 1:\r\n print(0)\r\n exit()\r\n \r\nstart, end = 2, k + 1\r\n\r\ndef sumn(l, r):\r\n return r * (r + 1) // 2 - l * (l - 1) // 2\r\n\r\ndef valid(mid):\r\n return sumn(mid, k) - (k - mid + 1) + 1 >= n\r\n\r\nwhile end - start > 1:\r\n mid = (start + end) // 2\r\n if valid(mid):\r\n start = mid\r\n else:\r\n end = mid\r\n \r\nif valid(start):\r\n print(k - start + 1)\r\nelse:\r\n print(-1)", "from sys import stdin, stdout\n\ninput = stdin.readline\n\n\ndef print(args, end='\\n', sep=' ') -> None:\n stdout.write(sep.join(map(str, args)) + end)\n\n\ndef map_int():\n return map(int, input().split())\n\n\ndef list_int():\n return list(map(int, input().split()))\n\n\nfrom collections import defaultdict\n\nn, k = map_int()\nmx = (k (k + 1)) // 2 - 1\nif mx - (k - 2) < n:\n print(-1)\n exit()\nif n == 1:\n print(0)\n exit()\nif n <= k:\n print(1)\n exit()\n\nl, r = 2, k\n\nans = 0\nwhile l <= r:\n mid = l + (r - l) // 2\n val = mx - (((mid) * (mid - 1)) // 2 - 1) - (k - mid)\n if val >= n:\n ans = mid - 1\n l = mid + 1\n else:\n r = mid - 1\n\nprint(k - ans)", "n,k=map(int,input().split())\nn,k=n-1,k-1\nl=0\nr=k\ng=k(k+1)//2\nans=-1\nwhile l<=r:\n\tm=(l+r)//2\n\tif (g-m(m+1)//2)>=n:\n\t\tans=k-m\n\t\tl=m+1\n\telse:\n\t\tr=m-1\nprint(ans)\n \t\t \t\t\t\t\t\t \t\t \t \t \t \t\t \t", "n, k = map(int, input().split())\r\ndef f(m):\r\n\tglobal n\r\n\tglobal k\r\n\ttotal = mk - (m(m-1))//2\r\n\ttotal -= (m-1)\r\n\treturn total >= n\r\nif ( (k(k+1))//2 - (k-1) < n):\r\n\tprint(-1)\r\nelif n == 1:\r\n\tprint(0)\r\n\r\nelse:\r\n\tr = k\r\n\tl = 0\r\n\twhile (r>(l+1)):\r\n\t\tm = (r+l)//2\r\n\t\t# print(m, f(m))\r\n\t\tif (f(m) == 0):\r\n\t\t\tl = m\r\n\t\telse:\r\n\t\t\tr = m\r\n\tprint(r)\r\n\t\t", "def bs(n, k, lo, hi):\r\n while lo <= hi: \r\n mid = (hi + lo)//2\r\n summ = ((k (k + 1))//2 - 1) - (((mid-1) * (mid))//2 -1) - (k-2)\r\n if summ == n: return k - mid + 1\r\n elif summ > n: lo = mid + 1 \r\n elif summ < n: hi = mid - 1\r\n if summ > n: mid += 1\r\n return k - mid + 1\r\n\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n if n == 1: return 0\r\n elif (k * (k + 1)//2) - (k-2) <= n: return -1\r\n elif k >= n: return 1\r\n else: return bs(n, k, 2, k)\r\n\r\nprint(solve())" ]	{"inputs": ["4 3", "5 5", "8 4", "1000000000000000000 1000000000", "499999998500000001 1000000000", "499999998500000000 1000000000", "499999999500000000 1000000000", "499999999500000001 1000000000", "525 34", "223265034477 726990", "15597035789572051 185473109", "499999999500000002 1000000000", "1 1000000000", "1000000000 2", "462498979 204468265", "2107921 542531", "131 49", "20171878992939541 200857557", "399812655947 894219", "93 17", "1000000000 999999999", "100000000000000000 1000000000"], "outputs": ["2", "1", "-1", "-1", "999955279", "999955279", "999999998", "999999999", "25", "440662", "128849771", "-1", "0", "-1", "3", "4", "3", "200853401", "893030", "8", "2", "105572810"]}	UNKNOWN	PYTHON3	CODEFORCES	50
8dd48a95d077948b9426c6505bdbe45c	none	This is an interactive problem. Jury has hidden a permutation p of integers from 0 to n<=-<=1. You know only the length n. Remind that in permutation all integers are distinct. Let b be the inverse permutation for p, i.e. pbi<==<=i for all i. The only thing you can do is to ask xor of elements pi and bj, printing two indices i and j (not necessarily distinct). As a result of the query with indices i and j you'll get the value , where denotes the xor operation. You can find the description of xor operation in notes. Note that some permutations can remain indistinguishable from the hidden one, even if you make all possible n2 queries. You have to compute the number of permutations indistinguishable from the hidden one, and print one of such permutations, making no more than 2n queries. The hidden permutation does not depend on your queries. The first line contains single integer n (1<=≤<=n<=≤<=5000) — the length of the hidden permutation. You should read this integer first. When your program is ready to print the answer, print three lines. In the first line print "!". In the second line print single integer answers_cnt — the number of permutations indistinguishable from the hidden one, including the hidden one. In the third line print n integers p0,<=p1,<=...,<=pn<=-<=1 (0<=≤<=pi<=<<=n, all pi should be distinct) — one of the permutations indistinguishable from the hidden one. Your program should terminate after printing the answer. Sample Input 3 0 0 3 2 3 24 2 3 2 0 2 3 2 0 Sample Output ? 0 0 ? 1 1 ? 1 2 ? 0 2 ? 2 1 ? 2 0 ! 1 0 1 2? 0 1 ? 1 2 ? 2 3 ? 3 3 ? 3 2 ? 2 1 ? 1 0 ? 0 0 ! 2 3 1 2 0	[ "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(n):\r\n L = []\r\n for i in range(n):\r\n sys.stdout.write(f'? {i} 0\\n')\r\n sys.stdout.flush()\r\n ai = int(input())\r\n L.append(ai)\r\n L2 = []\r\n for i in range(n):\r\n sys.stdout.write(f'? 0 {i}\\n')\r\n sys.stdout.flush()\r\n bi = int(input())\r\n L2.append(bi)\r\n poss = []\r\n for i in range(n):\r\n if L[i]==i:\r\n x = L[i]\r\n P3 = [x^L[i] for i in range(n)]\r\n P4 = [L2[i]^P3[0] for i in range(n)]\r\n works = True\r\n for i in range(n):\r\n if P4[i] >=n:\r\n works = False\r\n break\r\n if P3[P4[i]] != i:\r\n works = False\r\n break\r\n if works:\r\n poss.append(x)\r\n sys.stdout.write('!\\n')\r\n sys.stdout.flush()\r\n sys.stdout.write(str(len(poss))+'\\n')\r\n sys.stdout.flush()\r\n x = poss[0]\r\n P3 = [x^L[i] for i in range(n)]\r\n sys.stdout.write(' '.join(map(str, P3))+'\\n')\r\n sys.stdout.flush()\r\n sys.exit()\r\n \r\nn = int(input())\r\nprocess(n)" ]	{"inputs": ["3\n0 1 2", "4\n3 1 2 0", "4\n3 2 1 0", "8\n2 3 0 1 4 5 6 7", "1\n0", "10\n0 1 2 3 4 5 6 7 8 9", "6\n0 1 2 4 3 5", "2\n0 1", "10\n6 7 4 5 0 1 8 9 2 3", "10\n9 8 1 7 6 4 5 2 0 3", "64\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 62 63 60 61", "128\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 126 123 124 125 122 127"], "outputs": ["1\n0 1 2 ", "2\n0 2 1 3 ", "4\n0 1 2 3 ", "4\n0 1 2 3 6 7 4 5 ", "1\n0 ", "2\n0 1 2 3 4 5 6 7 8 9 ", "1\n0 1 2 4 3 5 ", "2\n0 1 ", "2\n6 7 4 5 0 1 8 9 2 3 ", "1\n9 8 1 7 6 4 5 2 0 3 ", "4\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 62 63 60 61 ", "2\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 126 123 124 125 122 127 "]}	UNKNOWN	PYTHON3	CODEFORCES	1
8e200e66a6bc8b339fc2303f84d097ff	Geometrical Progression	For given n, l and r find the number of distinct geometrical progression, each of which contains n distinct integers not less than l and not greater than r. In other words, for each progression the following must hold: l<=≤<=ai<=≤<=r and ai<=≠<=aj , where a1,<=a2,<=...,<=an is the geometrical progression, 1<=≤<=i,<=j<=≤<=n and i<=≠<=j. Geometrical progression is a sequence of numbers a1,<=a2,<=...,<=an where each term after first is found by multiplying the previous one by a fixed non-zero number d called the common ratio. Note that in our task d may be non-integer. For example in progression 4,<=6,<=9, common ratio is . Two progressions a1,<=a2,<=...,<=an and b1,<=b2,<=...,<=bn are considered different, if there is such i (1<=≤<=i<=≤<=n) that ai<=≠<=bi. The first and the only line cotains three integers n, l and r (1<=≤<=n<=≤<=107,<=1<=≤<=l<=≤<=r<=≤<=107). Print the integer K — is the answer to the problem. Sample Input 1 1 10 2 6 9 3 1 10 3 3 10 Sample Output 101282	[ "import math\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, l, r = map(int, input().split())\r\nif n == 1:\r\n ans = r - l + 1\r\nelif n == 2:\r\n ans = (r - l + 1) * (r - l)\r\nelse:\r\n x = [1]\r\n if n < 30:\r\n for j in range(2, r + 1):\r\n u = pow(j, n - 1)\r\n if u > r:\r\n break\r\n x.append(u)\r\n m = len(x)\r\n ans = 0\r\n for i in range(m):\r\n u = x[i]\r\n for j in range(i + 1, m):\r\n v = x[j]\r\n if math.gcd(u, v) ^ 1:\r\n continue\r\n ans += max(0, r // v - (l - 1) // u)\r\n ans *= 2\r\nprint(ans)" ]	{"inputs": ["1 1 10", "2 6 9", "3 1 10", "3 3 10", "1 25 845", "2 25 845", "3 25 845", "4 25 845", "5 25 845", "6 25 845", "7 25 845", "8 25 845", "1 1 10000000", "2 1 10000000", "3 1 10000000", "4 1 10000000", "5 1 10000000", "6 1 10000000", "7 1 10000000", "8 1 10000000", "9 1 10000000", "10 1 10000000", "11 1 10000000", "12 1 10000000", "13 1 10000000", "14 1 10000000", "15 1 10000000", "16 1 10000000", "17 1 10000000", "18 1 10000000", "19 1 10000000", "20 1 10000000", "21 1 10000000", "22 1 10000000", "23 1 10000000", "24 1 10000000", "25 1 10000000", "123456 1 10000000", "10000000 1 10000000", "1 10000000 10000000", "2 10000000 10000000", "10000000 10000000 10000000", "1 5000000 10000000", "2 5000000 10000000", "3 5000000 10000000", "4 5000000 10000000", "5 5000000 10000000", "6 5000000 10000000", "7 5000000 10000000", "8 5000000 10000000", "1000 5000000 10000000", "1 100 1000000", "2 100 1000000", "3 100 1000000", "4 100 1000000", "5 100 1000000", "6 100 1000000", "7 100 1000000", "8 100 1000000", "9 100 1000000", "10 100 1000000", "11 100 1000000", "12 100 1000000", "13 100 1000000", "14 100 1000000", "15 100 1000000", "16 100 1000000", "17 100 1000000", "1 1 1", "10000000 1 1", "1 123 456789", "2 123 456789", "3 123 456789", "4 123 456789", "5 123 456789", "6 123 456789", "7 123 456789", "8 123 456789", "9 123 456789", "10 123 456789", "11 123 456789", "12 123 456789", "13 123 456789", "1 1 5000000", "2 1 5000000", "3 1 5000000", "4 1 5000000", "5 1 5000000", "6 1 5000000", "7 1 5000000", "8 1 5000000", "9 1 5000000", "10 1 5000000", "11 1 5000000", "12 1 5000000", "13 1 5000000", "14 1 5000000", "15 1 5000000", "16 1 5000000", "17 1 5000000", "18 1 5000000", "19 1 5000000", "20 1 5000000", "21 1 5000000", "22 1 5000000", "23 1 5000000", "24 1 5000000", "25 1 5000000", "2 1 1"], "outputs": ["10", "12", "8", "2", "821", "673220", "2150", "324", "84", "10", "2", "0", "10000000", "99999990000000", "89371160", "7299492", "2209708", "875204", "384900", "178350", "85060", "41286", "20250", "9996", "4954", "2464", "1228", "610", "304", "152", "76", "38", "18", "8", "4", "2", "0", "0", "0", "1", "0", "0", "5000001", "25000005000000", "7065044", "117250", "4674", "194", "8", "0", "0", "999901", "999801009900", "7474368", "715006", "217914", "86100", "37648", "17266", "8066", "3814", "1786", "788", "292", "46", "0", "0", "0", "1", "0", "456667", "208544292222", "3172916", "321710", "98144", "38632", "16734", "7566", "3480", "1588", "662", "206", "0", "5000000", "24999995000000", "42582108", "3640680", "1104328", "437484", "192426", "89168", "42518", "20638", "10116", "4998", "2476", "1232", "614", "304", "152", "76", "38", "18", "8", "4", "2", "0", "0", "0"]}	UNKNOWN	PYTHON3	CODEFORCES	1
8e2fa585a4cce90d151115947a7dfe76	Maximal Binary Matrix	You are given matrix with n rows and n columns filled with zeroes. You should put k ones in it in such a way that the resulting matrix is symmetrical with respect to the main diagonal (the diagonal that goes from the top left to the bottom right corner) and is lexicographically maximal. One matrix is lexicographically greater than the other if the first different number in the first different row from the top in the first matrix is greater than the corresponding number in the second one. If there exists no such matrix then output -1. The first line consists of two numbers n and k (1<=≤<=n<=≤<=100, 0<=≤<=k<=≤<=106). If the answer exists then output resulting matrix. Otherwise output -1. Sample Input 2 1 3 2 2 5 Sample Output 1 0 0 0 1 0 0 0 1 0 0 0 0 -1	[ "# -- coding: utf-8 --\r\nn,k = map(int, input().split(' '))\r\nif k>n2:\r\n print(-1)\r\nelif k==n2:\r\n a = [['1']n for i in range(n)]\r\n for i in range(n):\r\n a[i] = ' '.join(a[i])\r\n print(a[i])\r\nelse:\r\n a = [['0']n for i in range(n)]\r\n c = 0\r\n i = 0\r\n b = True\r\n while b and i<n:\r\n for j in range(n):\r\n if i==j:\r\n if c+1>k:\r\n continue\r\n a[i][j] = '1'\r\n c += 1\r\n else:\r\n if a[j][i]!='1':\r\n if c + 2 >k:\r\n continue\r\n a[i][j] = '1'\r\n a[j][i] = '1'\r\n c += 2\r\n if c==k:\r\n b = False\r\n break\r\n i += 1\r\n for i in range(n):\r\n a[i] = ' '.join(a[i])\r\n print(a[i])\r\n", "n,k = map(int,input().split())\r\nmartix = [[0 for i in range(n)] for j in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if i == j :\r\n if k > 0:\r\n martix[i][j] = 1\r\n k -= 1\r\n else:\r\n if k > 1:\r\n martix[i][j],martix[j][i] = 1,1\r\n k -= 2\r\nif k > 0:\r\n print(-1)\r\nelse: \r\n for i in martix:\r\n print(' '.join(map(str,i)))", "n,k = map(int,input().split())\r\nmatrix = [[0]n for i in range(n)]\r\n\r\n\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if k>1 and i != j:\r\n matrix[i][j] = 1\r\n matrix[j][i] = 1\r\n k -= 2\r\n elif k>0 and i == j:\r\n matrix[i][j] = 1\r\n matrix[j][i] = 1\r\n k -= 1\r\n\r\nif k == 0:\r\n for row in matrix:\r\n print(' '.join(map(str,row)))\r\nelse:\r\n print(\"-1\")", "n , k = map(int , input().split())\r\nmatrix = [[0] n for _ in range(n)]\r\nleft = k\r\n\r\nif k > n ** 2:\r\n print(\"-1\")\r\n\r\nelse:\r\n\r\n for x in range(n):\r\n\r\n for y in range(x , n):\r\n\r\n if x == y:\r\n if left >= 1:\r\n matrix[x][y] = 1\r\n left -= 1\r\n \r\n else:\r\n if left >= 2:\r\n matrix[x][y] = matrix[y][x] = 1\r\n left -= 2\r\n elif left == 1:\r\n matrix[x + 1][x + 1] = 1\r\n \r\n for i in range(n):\r\n print(' '.join(map(str , matrix[i])))", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[n, k] = list(map(int, input().split()))\r\n\r\nif nn < k:\r\n print('-1')\r\n exit(0)\r\n\r\na = [[0 for j in range(n)] for i in range(n)]\r\np = 0\r\nwhile k > 0:\r\n a[p][p] = 1\r\n k -= 1\r\n q = p+1\r\n while k > 1 and q < n:\r\n a[p][q] = 1\r\n a[q][p] = 1\r\n k -= 2\r\n q += 1\r\n p += 1 \r\n\r\nfor i in range(n):\r\n print(' '.join(map(str, a[i])))\r\n", "n,k=map(int,input().split())\r\na=[[0]n for i in range(n)]\r\nif k>nn:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n for j in range(i,n):\r\n if i==j and k>=1:\r\n a[i][i]=1\r\n k-=1\r\n elif k>=2:\r\n a[i][j]=1\r\n a[j][i]=1\r\n k-=2\r\n for row in a:\r\n print(\" \".join(map(str,row)))", "def place(N, k):\r\n ret = [['0'] N for i in range(N)]\r\n if k == 0:\r\n return ret\r\n if k % 2 == 0:\r\n m = k // 2 - 1\r\n ret[0][0] = '1'\r\n ret[1][1] = '1'\r\n for i in range(1, m+1):\r\n ret[0][i] = '1'\r\n ret[i][0] = '1'\r\n else:\r\n m = k //2\r\n # print(m)\r\n ret[0][0] = '1'\r\n for i in range(1, m+1):\r\n ret[0][i] = '1'\r\n ret[i][0] = '1'\r\n # print(i)\r\n return ret\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n if k > n * n:\r\n print(-1)\r\n return\r\n m = 0\r\n N = n\r\n while k >= 2 * N - 1 and k>0:\r\n k -= 2 * N - 1\r\n m += 1\r\n N -= 1\r\n for i in range(m):\r\n this_row = ['1'] * n\r\n print(' '.join(this_row))\r\n l = place(N, k)\r\n for row in l:\r\n this_row = ['1'] * m + row\r\n print(' '.join(this_row))\r\n\r\nmain()\r\n", "#2300011725\r\nn,k=map(int,input().split())\r\nl=[]\r\nfor m in range(n):\r\n l.append([0]n)\r\nif k>n2:\r\n print(-1)\r\nelse:\r\n if k%2!=0:\r\n l[0][0]=1\r\n note=False\r\n for i in range(k//2):\r\n a=0\r\n stop=False\r\n while a<n and not stop:\r\n try:\r\n b=l[a].index(0)\r\n except ValueError:\r\n a+=1\r\n else:\r\n stop=True\r\n if a==b:\r\n if a+1!=n:\r\n l[a][b]=1\r\n l[a+1][b+1]=1\r\n else:\r\n note=True\r\n break\r\n else:\r\n l[a][b]=1\r\n l[b][a]=1\r\n if note:\r\n print(-1)\r\n else:\r\n for j in range(n):\r\n print(' '.join(list(map(str,l[j]))))", "n, k = map(int, input().split())\r\nif k > n2:\r\n print(-1)\r\n exit()\r\nif k == 0:\r\n for i in range(n):\r\n print([0]n)\r\n exit()\r\nans = [[0]n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if ans[i][j] == 1:\r\n continue\r\n if k == 0:\r\n break\r\n if i != j:\r\n if k == 1:\r\n break\r\n else:\r\n ans[i][j] = 1\r\n ans[j][i] = 1\r\n k -= 2\r\n else:\r\n ans[i][i] = 1\r\n k -= 1\r\n else:\r\n continue\r\n break\r\nif k:\r\n for i in range(n):\r\n if ans[i][i] != 1:\r\n ans[i][i] = 1\r\n break\r\nfor i in range(n):\r\n print(ans[i])\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Oct 30 10:30:56 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\nn,k=map(int,input().split())\r\nmatrix=[[0]n for x in range(n)]\r\nresult=False\r\nif k==0:\r\n for row in matrix:\r\n print(row)\r\nelif k!=0 and k<=nn:\r\n for i in range(n):\r\n if result:\r\n break\r\n matrix[i][i]=1\r\n k-=1\r\n if k==0:\r\n for row in matrix:\r\n print(row)\r\n break\r\n elif k==1:\r\n matrix[i+1][i+1]=1\r\n for row in matrix:\r\n print(row)\r\n break\r\n elif k>1:\r\n for m in range(i+1,n):\r\n matrix[m][i]=1\r\n matrix[i][m]=1\r\n k-=2\r\n if k>1:\r\n continue\r\n elif k==1:\r\n matrix[i+1][i+1]=1\r\n for row in matrix:\r\n print(row)\r\n result=True\r\n break\r\n elif k==0:\r\n for row in matrix:\r\n print(row)\r\n result=True\r\n break\r\nelif k>nn:\r\n print(-1)\r\n\r\n \r\n \r\n \r\n", "def printM(M):\r\n for i in M:\r\n for j in i:\r\n print(j, end = \" \")\r\n print()\r\n\r\nn, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\n\r\nif k > nn:\r\n print(-1)\r\n exit()\r\n\r\nM = []\r\nfor i in range(n):\r\n M.append([0 for j in range(n)])\r\n\r\nleft = k\r\n\r\nfor i in range(n):\r\n if left == 0:\r\n printM(M)\r\n exit()\r\n \r\n M[i][i] = 1\r\n left -= 1\r\n\r\n for j in range(i+1, n):\r\n ##print(\"i =\", i, \"j = \", j)\r\n if left == 0:\r\n printM(M)\r\n exit()\r\n if left == 1:\r\n M[i+1][i+1] = 1\r\n ##left -= 1\r\n printM(M)\r\n exit()\r\n \r\n M[i][j] = M[j][i] = 1\r\n left -= 2\r\n\r\nprintM(M)\r\n", "n,k=map(int,input().split())\r\nif nn<k:\r\n print(-1)\r\nelse:\r\n mat=[[0]n for i in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n if k>0 and mat[i][j]==0:\r\n if i==j:\r\n mat[i][j]=1\r\n k-=1\r\n elif k>=2:\r\n mat[i][j]=1\r\n mat[j][i]=1\r\n k-=2\r\n for i in range(n):\r\n for j in range(n):\r\n print(mat[i][j],end=\" \")\r\n print()", "n, m = map(int,input().split())\r\narr = [[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if(m > 0 and i == j):\r\n m -= 1-arr[i][j]\r\n arr[i][j] = 1\r\n elif(m > 1):\r\n m -= 2-arr[i][j]-arr[j][i]\r\n arr[i][j] = 1\r\n arr[j][i] = 1\r\nif(not m):\r\n for i in arr:\r\n print(i)\r\nelse:\r\n print(-1)", "n,k=map(int,input().split())\r\nif k==0:\r\n ls=[[0 for i in range(n)]for i in range(n)]\r\n for i in ls:\r\n print(i)\r\nelif k>nn:\r\n print(-1)\r\nelse:\r\n ls=[[0 for i in range(n)]for i in range(n)]\r\n lz = [[0 for i in range(n)] for i in range(n)]\r\n x=k\r\n for i in range(n):\r\n ls[i][i]=1\r\n x-=1\r\n g=False\r\n if x==0:\r\n break\r\n for j in range(i+1,n):\r\n if x==1:\r\n continue\r\n ls[i][j]=1\r\n ls[j][i]=1\r\n x-=2\r\n if x<=0:\r\n g=True\r\n break\r\n if g==True:\r\n break\r\n for i in ls:\r\n print(i)\r\n\r\n", "\r\nn,k=map(int,input().split())\r\nmatrix=[[0]n for i in range(n)]\r\nif k>nn:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n for j in range(i,n):\r\n if not k:break\r\n if i==j:\r\n k-=1;matrix[i][j]=1\r\n else:\r\n if k<2:break\r\n k-=2\r\n matrix[i][j]+=1\r\n matrix[j][i]+=1\r\n for i in range(n):\r\n for j in range(n):\r\n if j!=n-1:\r\n print(matrix[i][j],end=' ')\r\n else:\r\n print(matrix[i][j])", "n, k = map(int, input().split())\r\nif k > nn:\r\n print(-1)\r\nelse:\r\n M = [['0']n for _ in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n if M[i][j] == '0':\r\n if k > 1:\r\n if i == j:\r\n k -= 1\r\n M[i][j] = '1'\r\n else:\r\n k -= 2\r\n M[i][j] = '1'\r\n M[j][i] = '1'\r\n elif k == 1:\r\n if i == j:\r\n k -= 1\r\n M[i][j] = '1'\r\n break\r\n else:\r\n break\r\n if k == 0:\r\n break\r\n for i in range(n):\r\n print(' '.join(M[i]))\r\n", "# 李城岳生命科学学院 2300012106\r\nx, y = map(int, input().split())\r\nif y > xx:\r\n print(-1)\r\nelse:\r\n matrix = []\r\n for i in range(x):\r\n row = []\r\n for e in range(x):\r\n row.append('0')\r\n matrix.append(row)\r\n for i in range(x):\r\n for e in range(x-i):\r\n if y < 1:\r\n break\r\n if e == 0:\r\n matrix[i][i+e] = '1'\r\n y -= 1\r\n elif e != 0 and y >= 2:\r\n matrix[i][i+e] = '1'\r\n matrix[i+e][i] = '1'\r\n y -= 2\r\n elif e != 0 and y == 1:\r\n matrix[i+1][i+1] = '1'\r\n y -= 1\r\n for i in matrix:\r\n print(' '.join(i))\r\n", "def f(n,k):\r\n matrix=[[0]n for _ in range(n)]\r\n if k>n*2:\r\n return [[-1]]\r\n else:\r\n \r\n if k==0:\r\n return matrix\r\n else:\r\n s=0\r\n x=1\r\n flag=n\r\n while k>0:\r\n x=1\r\n matrix[s][s]=1\r\n k-=1\r\n while k>1 and x<flag:\r\n matrix[s][n-flag+x]=1\r\n matrix[n-flag+x][s]=1\r\n x+=1\r\n k-=2\r\n flag-=1\r\n s+=1\r\n return matrix\r\nn,k=map(int,input().split())\r\nans=f(n, k)\r\nfor i in ans:\r\n print(i,sep=' ')", "a = []\r\n\r\n\r\ndef mark(kk, x):\r\n global a\r\n if kk >= 2 * x - 1:\r\n for i in range(x):\r\n a[x - 1][i] = 1\r\n a[i][x - 1] = 1\r\n if x != 1:\r\n mark(kk - 2 * x + 1, x - 1)\r\n else:\r\n if kk != 0 and kk % 2 == 0:\r\n h = kk // 2\r\n a[x - 1][x - 1] = 1\r\n a[x - 2][x - 2] = 1\r\n for i in range(h):\r\n a[x - 1][x - 1 - i] = 1\r\n a[x - 1 - i][x - 1] = 1\r\n elif kk % 2 == 1:\r\n h = kk // 2 + 1\r\n a[x - 1][x - 1] = 1\r\n for i in range(h):\r\n a[x - 1][x - 1 - i] = 1\r\n a[x - 1 - i][x - 1] = 1\r\n\r\n\r\nn, k = map(int, input().split())\r\nif k > n ** 2:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n a.append([])\r\n for j in range(n):\r\n a[i].append(0)\r\n mark(k, n)\r\n a.reverse()\r\n for i in range(n):\r\n a[i].reverse()\r\n for j in range(n):\r\n if j != n - 1:\r\n print(f'{a[i][j]} ',end='')\r\n else:\r\n print(a[i][j])\r\n\r\n", "\ndef maximal_binary_matrix(n, k):\n matrix = [[0] * n for _ in range(n)]\n for i in range(n):\n for j in range(i, n):\n if i == j and k >= 1:\n matrix[i][j] = 1\n k -= 1\n elif k >= 2:\n matrix[i][j] = 1\n matrix[j][i] = 1\n k -= 2\n return matrix if k == 0 else None\n\n\nn, k = map(int, input().split())\nm = maximal_binary_matrix(n, k)\nif m:\n for row in m:\n print(row)\nelse:\n print(-1)\n", "n,k=map(int,input().split())\r\nif k>n2:\r\n print(-1)\r\nelse:\r\n mx=[[0]n for i in range(n)]\r\n if k==0:\r\n for i in range(n):\r\n print(' '.join(str(x) for x in mx[i]))\r\n else:\r\n for x in range(n):\r\n for y in range(n):\r\n if mx[x][x]==0 and k>=1:\r\n mx[x][x]=1\r\n k-=1\r\n elif mx[x][y]+mx[y][x]<2 and k>=2:\r\n mx[x][y]=1\r\n mx[y][x]=1\r\n k-=2\r\n for a in range(n):\r\n print(' '.join(str(x) for x in mx[a]))", "n,k=map(int,input().split())\r\nif k>n*2:\r\n print(-1)\r\nelse:\r\n ans=[[0]n for _ in range(n)]\r\n i,j=0,0\r\n while k>2:\r\n if i==j:\r\n ans[i][j]=1\r\n k-=1\r\n else:\r\n ans[i][j],ans[j][i]=1,1\r\n k-=2\r\n if j==n-1:\r\n i+=1\r\n j=i\r\n else:\r\n j+=1\r\n if i!=j:\r\n if k==1:\r\n ans[i+1][i+1]=1\r\n elif k==2:\r\n ans[i][j],ans[j][i]=1,1\r\n elif i==j:\r\n if k==1:\r\n ans[i][j]=1\r\n elif k==2:\r\n ans[i][j],ans[i+1][j+1]=1,1\r\n for row in ans:\r\n print(' '.join(map(str,row)))", "N, K = map( int, input().split() )\r\nif K > N * N:\r\n exit( print( -1 ) )\r\nG = [ [ 0 for i in range( N ) ] for j in range( N ) ]\r\nfor i in range( N ):\r\n if K == 0: break\r\n G[ i ][ i ] = 1\r\n K -= 1\r\n for j in range( i + 1, N ):\r\n if K <= 1: break\r\n G[ i ][ j ], G[ j ][ i ] = 1, 1\r\n K -= 2\r\nfor i in range( N ):\r\n print( ' '.join( str( v ) for v in G[ i ] ) )\r\n", "n, k = map( int, input(). split() )\ntab = [ [ 0 for x in range(n) ] for y in range(n) ]\nfor i in range(n):\n for j in range(i, n): \n if i != j:\n if k >= 2:\n tab[i][j] = 1;\n tab[j][i] = 1\n k = k - 2\n else: \n if k >= 1:\n tab[i][j] = 1\n k = k - 1\nif k > 0:\n print(-1)\nelse:\n for i in range(n):\n for j in range(n):\n print( tab[i][j], end = ' ' )\n print('')\n", "n, k = map(int, input().split())\r\nmat = [[0]n for x in range(n)]\r\n\r\nfor row in range(n):\r\n for col in range(row,n):\r\n if row != col and k >= 2:\r\n mat[row][col] = 1\r\n mat[col][row] = 1\r\n k -= 2\r\n #print(row, col,k)\r\n elif row == col and k >= 1:\r\n mat[row][col] = 1\r\n k -= 1\r\n #print(row, col,k)\r\n\r\nif k > 0:\r\n print(-1)\r\nelse:\r\n for l in mat:\r\n print(\" \".join([str(x) for x in l]))", "\r\nn,k=map(int,input().split())\r\nnx=[n[0] for _ in range(n)]\r\n\r\nif nn>=k:\r\n for i in range(n):\r\n for j in range(n):\r\n if i==j and nx[i][j]!=1 and k>=1:\r\n nx[i][j]=1\r\n k-=1\r\n if i!=j and nx[i][j]!=1 and k>=2:\r\n nx[i][j],nx[j][i]=1,1\r\n k-=2\r\n for row in nx:\r\n print(row)\r\n\r\nelse:\r\n print(\"-1\")\r\n\r\n\r\n", "n, k = map(int, input().split())\r\nif n * n < k:\r\n print(-1)\r\n exit()\r\nelse:\r\n T = [[0] * n for i in range(n)]\r\n for i in range(n):\r\n for j in range(i, n):\r\n if k >= 1:\r\n if i == j:\r\n T[i][j] = 1\r\n k -= 1\r\n elif k >= 2:\r\n T[i][j] = 1\r\n T[j][i] = 1\r\n k -= 2\r\n\r\n for i in range(n):\r\n print(T[i])\r\n", "from itertools import product\r\nfrom sys import exit\r\n\r\nn, k = map(int, input().split())\r\nif k > n2:\r\n print(-1)\r\n exit(0)\r\nmat = [[0]n for i in range(n)]\r\nfor i, j in product(range(n), repeat=2):\r\n a = i==j or 2\r\n if mat[i][j] == 0 and k >= a:\r\n k -= a\r\n mat[i][j] = mat[j][i] = 1\r\nfor row in mat:\r\n print(row)", "import math\r\nn, k = map(int, input().split(\" \"))\r\nif k > n * 2:\r\n print(-1)\r\nelse:\r\n i = math.floor(math.sqrt(n 2 - k))\r\n matrix = [[1 for _ in range(n)] for _ in range(n-i)]\r\n row = [1 for _ in range(n-i)]\r\n for _ in range(i):\r\n row.append(0)\r\n for _ in range(i):\r\n matrix.append(list(row))\r\n\r\n x = n 2 - k - i ** 2\r\n\r\n for j in range(x//2):\r\n matrix[n-i-1][n-1-j] = 0\r\n matrix[n-1-j][n-i-1] = 0\r\n\r\n if x % 2 != 0:\r\n matrix[n-i][n-i] = 1\r\n matrix[n-i-1][n-1-x//2] = 0\r\n matrix[n-1-x//2][n-i-1] = 0\r\n\r\n for m in range(n):\r\n lst = list(map(str, matrix[m]))\r\n str1 = \" \".join(lst)\r\n print(str1)", "n, k = map(int, input().split())\r\nif k > nn:\r\n print(-1)\r\nelse:\r\n m = [[0]n for i in range(n)]\r\n i = 0\r\n while k > 0 and i < n:\r\n j = i\r\n while k > 0 and j < n:\r\n if i == j:\r\n m[i][j] = 1\r\n k -= 1\r\n elif k >=2:\r\n m[i][j] = 1\r\n m[j][i] = 1\r\n k -= 2\r\n j += 1\r\n i += 1\r\n for row in m:\r\n print(row)\r\n", "def maxim():\r\n n,k=map(int,input().strip().split())\r\n if k<0:\r\n print(-1)\r\n return\r\n\r\n if k>(n2):\r\n print(-1)\r\n return\r\n \r\n a=[[0 for _ in range(n)] for _ in range(n)]\r\n \r\n for i in range(n):\r\n if k>=1:\r\n a[i][i]=1\r\n k-=1\r\n for j in range(i+1,n):\r\n if k>=2:\r\n a[i][j]=1\r\n a[j][i]=1\r\n k-=2\r\n elif k>=1:\r\n break\r\n if k>0:\r\n print(-1)\r\n return\r\n\r\n for i in range(n):\r\n b=[str(i) for i in a[i]]\r\n b=' '.join(b)\r\n print(b)\r\n\r\nmaxim()\r\n", "n,k=map(int,input().split())\r\nif nn<k:\r\n print(-1)\r\nelse:\r\n mat=[]\r\n a=[]\r\n t=n\r\n for i in range(t):\r\n for i in range(t):\r\n a.append(0)\r\n mat.append(a)\r\n a=[]\r\n \r\n for i in range(t):\r\n for j in range(t):\r\n if i!=j and k>1:\r\n if mat[i][j]:\r\n continue\r\n else:\r\n mat[i][j]=1\r\n mat[j][i]=1\r\n k-=2\r\n elif i==j and k:\r\n mat[i][j]=1\r\n k-=1\r\n for i in range(t):\r\n for j in range(t-1):\r\n print(\"%d\" % mat[i][j],end=\" \")\r\n print(mat[i][t-1])\r\n", "a, b = map(int, input().split())\r\nl = [[\"0\" for w in range(a)] for v in range(a)]\r\nif b > a ** 2:\r\n print(\"-1\")\r\nelse:\r\n for i in range(a):\r\n if b - 1 >= 0:\r\n l[i][i]=\"1\"\r\n b-=1\r\n for j in range(i,a):\r\n if b - 2 >= 0:\r\n if l[i][j]!=\"1\":\r\n l[i][j]=\"1\"\r\n b -= 1\r\n if l[j][i]!=\"1\":\r\n l[j][i]=\"1\"\r\n b -= 1\r\n else:\r\n break\r\n for p in l:\r\n print(\" \".join(p))", "n,k=map(int,input().split())\r\nif k>nn:\r\n print(-1)\r\n exit()\r\nans=[[0]n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if k>0 and i==j:\r\n ans[i][i]=1\r\n k-=1\r\n elif k>1:\r\n ans[i][j]=1\r\n ans[j][i]=1\r\n k-=2\r\n\r\nfor i in ans:\r\n print(i)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 31 21:55:23 2023\r\n\r\n@author: liu\r\n\"\"\"\r\n\r\nn,k = map(int,input().split())\r\nmat = [ [1] n for _ in range(n)]\r\nif n2 < k:\r\n print(-1)\r\nelif n2 == k:\r\n for i in mat:\r\n print(i)\r\nelse:\r\n a = int((n2 - k) * 0.5)\r\n b = n2 - k - a2\r\n for m in range(0,a):\r\n for h in range(0,a):\r\n mat[-1-m][-1-h] = 0\r\n if b % 2 == 0:\r\n c = int(b/2)\r\n for i in range(0,c):\r\n mat[-a-1][-1-i] = 0\r\n mat[-1-i][-a-1] = 0\r\n else:\r\n mat[-a][-a] = 1\r\n c = int((b+1)/2)\r\n for i in range(0,c):\r\n mat[-a-1][-1-i] = 0\r\n mat[-1-i][-a-1] = 0\r\n for i in mat:\r\n print(i)", "from sys import stdin,stdout, setrecursionlimit\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict as dd\r\nfrom bisect import bisect_left as bl,bisect_right as br\r\n\r\ninp =lambda: int(input())\r\nstrng =lambda: input().strip()\r\njn =lambda x,l: x.join(map(str,l))\r\nstrl =lambda: list(input().strip())\r\nmul =lambda: map(int,input().strip().split())\r\nmulf =lambda: map(float,input().strip().split())\r\nseq =lambda: list(map(int,input().strip().split()))\r\n\r\nceil =lambda x: int(x) if(x==int(x)) else int(x)+1\r\nceildiv=lambda x,d: x//d if(x%d==0) else x//d+1\r\n\r\nflush =lambda: stdout.flush()\r\nstdstr =lambda: stdin.readline()\r\nstdint =lambda: int(stdin.readline())\r\nstdpr =lambda x: stdout.write(str(x))\r\n\r\nmod=1000000007\r\n\r\n# A. Maximal Binary Matrix\r\n\r\nabc = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\ndef solve():\r\n n, k = mul()\r\n \r\n total = nn\r\n \r\n grid = []\r\n for i in range(n):\r\n row = ['0']n\r\n grid.append(row)\r\n \r\n if k > total: \r\n stdpr('-1\\n')\r\n return\r\n \r\n for i in range(n):\r\n for j in range(i, n):\r\n if i == j:\r\n if k>=1:\r\n grid[i][j] = '1'\r\n k-=1\r\n else:\r\n break\r\n else:\r\n if k >= 2:\r\n grid[i][j] = '1'\r\n grid[j][i] = '1'\r\n k-=2\r\n else:\r\n continue\r\n \r\n for i in range(n):\r\n row = grid[i]\r\n stdpr(' '.join(row))\r\n stdpr('\\n')\r\n \r\n# for tc in range(int(input())): solve()\r\nsolve()", "n, k = map(int, input().split())\r\n\r\nif k > nn:\r\n print(-1)\r\nelse:\r\n G = [[0 for _ in range(n)] for _ in range(n)]\r\n \r\n for i in range(1, n+1):\r\n if k == 0:\r\n break\r\n for j in range(i, n+1):\r\n if k == 0:\r\n break\r\n if i == j:\r\n G[i-1][j-1] = 1\r\n k -= 1\r\n else:\r\n if k >= 2:\r\n G[i-1][j-1] = G[j-1][i-1] = 1\r\n k -= 2\r\n\r\n for row in G:\r\n print(\" \".join(str(cell) for cell in row))", "n,k=map(int,input().split())\r\nbian=(0,1)\r\nduijiaoxian=(0,0)\r\nmartirx=[]\r\nfor i in range(n):\r\n martirx.append([0 for i in range(n)])\r\nwhile 1:\r\n if k==0:\r\n break\r\n if duijiaoxian[0]>=n:\r\n break\r\n if martirx[duijiaoxian[0]][duijiaoxian[1]]==0:\r\n martirx[duijiaoxian[0]][duijiaoxian[1]]=1\r\n k-=1\r\n continue\r\n if bian[1]>=n:\r\n duijiaoxian=(bian[0]+1,bian[0]+1)\r\n bian=(duijiaoxian[0],duijiaoxian[0]+1)\r\n continue\r\n if k>=2:\r\n martirx[bian[0]][bian[1]]=1\r\n martirx[bian[1]][bian[0]]=1\r\n bian=(bian[0],bian[1]+1)\r\n k-=2\r\n continue\r\n if k==1:\r\n martirx[bian[0]+1][bian[0]+1]=1\r\n k-=1\r\n break\r\nif k==0:\r\n for i in martirx:\r\n print(' '.join(str(s) for s in i))\r\nelse:\r\n print(-1)", "x=input()\r\ny=list(x)\r\nz=y.index(' ')\r\nn=int(x[:z])\r\nk=int(x[z+1:])\r\nh=[[0 for i in range(n)] for j in range(n)]\r\nif k>nn:\r\n print(-1)\r\nif k<=nn:\r\n for i in range(1,n+1):\r\n u=2ni-ii\r\n if u>=k:\r\n v=2(i-1)n-(i-1)(i-1)\r\n w=k-v\r\n g=i-1\r\n break\r\n if g>0:\r\n for i in range(g):\r\n for j in range(n):\r\n h[i][j]=1\r\n h[j][i]=1\r\n if w%2==0:\r\n if w//2>0:\r\n for i in range(1):\r\n for j in range(w//2):\r\n h[i+g][j+g]=1\r\n h[j+g][i+g]=1\r\n h[g+1][g+1]=1\r\n if w%2==1:\r\n for i in range(1):\r\n for j in range(w//2+1):\r\n h[i+g][j+g]=1\r\n h[j+g][i+g]=1\r\n if g==0:\r\n if w%2==0:\r\n if w//2>0:\r\n for i in range(1):\r\n for j in range(w//2):\r\n h[i][j+g]=1\r\n h[j+g][i]=1\r\n h[g+1][g+1]=1\r\n if w%2==1:\r\n for i in range(1):\r\n for j in range(w//2+1):\r\n h[i+g][j+g]=1\r\n h[j+g][i+g]=1 \r\n for i in range(n):\r\n for j in range(n):\r\n if j==n-1:\r\n print(h[i][j])\r\n else:\r\n print(h[i][j],end=\" \")\r\n \r\n \r\n \r\n", "\r\nn,k=input('').split()\r\nn=int(n)\r\nk=int(k)\r\narr=[[0 for x in range(n)]for y in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if arr[i][j]==arr[j][i]==0:\r\n if i==j and k>0:\r\n arr[i][j]=1\r\n k=k-1\r\n if i!=j and k>1:\r\n arr[i][j]=1\r\n arr[j][i]=1\r\n k=k-2\r\nif k==0:\r\n lines = []\r\n for row in arr:\r\n lines.append(' '.join(str(x) for x in row))\r\n print('\\n'.join(lines))\r\nelse:\r\n print('-1')", "\r\nn, k = map(int, input().split() )\r\n\r\nif k> nn:\r\n print(-1)\r\nelse:\r\n b = [[0]n for i in range(n)]\r\n c = 0\r\n i = 0\r\n j = 0\r\n t = -1\r\n while c < k:\r\n if i == j:\r\n b[i][j] = 1\r\n c += 1\r\n j += 1\r\n t = 0\r\n \r\n elif j == n:\r\n i += 1\r\n j = i\r\n t = 1\r\n \r\n else:\r\n \r\n b[i][j] = 1\r\n b[j][i] = 1\r\n j += 1\r\n c+=2\r\n t = 2\r\n \r\n if c == k:\r\n p = \"\"\r\n for q in range(n):\r\n for w in range(n):\r\n p += str(b[q][w]) + \" \"\r\n print(p)\r\n p = \"\"\r\n \r\n else:\r\n if t == 0:\r\n j -= 1\r\n if t == 1:\r\n i -=1\r\n j = n-1\r\n if t == 2:\r\n j -=1\r\n b[i][j] = 0\r\n b[j][i] = 0\r\n b[i+1][i+1] = 1\r\n p = \"\"\r\n for q in range(n):\r\n for w in range(n):\r\n p += str(b[q][w]) + \" \"\r\n print(p)\r\n p = \"\"\r\n \r\n", "n, k = map(int, input().split())\r\nnum = [[0] * n for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(i, n):\r\n if k > 1 and i != j:\r\n num[i][j] = 1\r\n num[j][i] = 1\r\n k -= 2\r\n elif k > 0 and i == j:\r\n num[i][i] = 1\r\n k -= 1\r\n\r\nif k == 0:\r\n for i in range(n):\r\n print(\" \".join(map(str, num[i])))\r\nelse:\r\n print(\"-1\")\r\n", "n,k=map(int,input().split())\r\nif k>n*2:\r\n exit(print(-1))\r\nelse:\r\n a=[[0]n for i in range(n)]\r\n for i in range(n):\r\n for j in range(i,n):\r\n if i!=j and k==1:\r\n a[i+1][i+1]=1;k-=1\r\n elif i==j and k>0:\r\n a[i][j]=1;k-=1\r\n elif k>=2:\r\n a[i][j]=1;a[j][i]=1;k-=2\r\n elif k==0:\r\n break\r\nfor i in a:\r\n print(i)\r\n ", "#author 沈天健 2300011417\r\nn,k=map(int,input().split())\r\nmatrix=[[2 for _ in range(0,n+1+1)] for __ in range(0,n+1+1)]\r\nans=[[0 for _ in range(0,n+1+1)] for __ in range(0,n+1+1)]\r\nfor i in range(1,n+1):\r\n matrix[i][i]=1\r\nfor i in range(1,n+1):\r\n for j in range(i,n+1):\r\n if k>=matrix[i][j]:\r\n k-=matrix[i][j]\r\n ans[i][j]=1\r\n ans[j][i]=1\r\n elif k==1:\r\n ans[i+1][i+1]=1\r\n k=0\r\n break\r\n elif k==0:\r\n break\r\n else:\r\n continue\r\n break\r\nif k>0:\r\n print(\"-1\")\r\nelse:\r\n print('\\n'.join([' '.join(map(str,ans[_][1:n+1])) for _ in range(1,n+1)]))", "n , k = list(map(int,input().split()))\r\nif k > n2:\r\n print(-1)\r\nelse:\r\n mt = [[0 for i in range(n)] for i in range(n)]\r\n for i in range(n):\r\n if k == 0:\r\n break\r\n mt[i][i] = 1\r\n k -= 1\r\n for j in range(i+1,n):\r\n if k > 1:\r\n mt[i][j] = 1\r\n mt[j][i] = 1\r\n k -= 2\r\n else:\r\n break\r\n for i in mt:\r\n print(i)\r\n", "n,k=map(int,input().split())\r\nif k>(nn):\r\n\tprint(-1)\r\nelse:\r\n\tmat=[[0]n for i in range(n)]\r\n\tfor i in range(n):\r\n\t\tif k==0:\r\n\t\t\tbreak\r\n\t\tmat[i][i]=1\r\n\t\tk-=1\r\n\t\tfor j in range(i+1,n):\r\n\t\t\tif k>1:\r\n\t\t\t\tmat[i][j]=1\r\n\t\t\t\tmat[j][i]=1\r\n\t\t\t\tk-=2\r\n#\t\tprint(mat,k)\r\n\tfor i in mat:\r\n\t\tprint(i)", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Thu Oct 26 15:51:17 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\n#最大二元矩阵\n#显然是一道贪心问题，用数学思维做起来思路清晰.\nimport math\n\na,b=map(int,input().split())\nmx=[[0 for i in range(a)] for j in range(a)]\nif b>aa:\n print(-1)\nelse:\n #先‘倒着填’\n c=math.ceil((aa-b)0.5)#正方形区域不能被填入1\n for i in range(a-c,a):\n for j in range(a-c,a):\n mx[i][j]=-1\n for i in range(a):\n for j in range(a):\n mx[i][j]+=1\n #再‘正着填’\n d=cc+b-aa\n if d>0 and d%2!=0:\n for i in range(a-c,a-c+int((d+1)/2)):\n mx[a-c][i]=1\n mx[i][a-c]=1\n if d>0 and d%2==0:\n for i in range(a-c,a-c+int(d/2)):\n mx[a-c][i]=1\n mx[i][a-c]=1\n mx[a-c+1][a-c+1]=1\n #输出\n for i in mx:\n st=''\n for j in i:\n st+=str(j)\n st+=' '\n print(st)\n \n \n \n \n \n ", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 24 10:23:52 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\ndef check(k):\r\n if k>1:\r\n return True\r\n return False\r\n\r\nn,k=map(int,input().split())\r\nmartix=[[\"0\"]n for _ in range(n)]\r\nif nn<k:\r\n print(-1)\r\nelse: \r\n m=0\r\n while check(k):\r\n martix[m][m]=\"1\"\r\n k-=1\r\n i=m+1\r\n while check(k) and i<n:\r\n martix[i][m]=\"1\"\r\n martix[m][i]=\"1\"\r\n k-=2\r\n i+=1\r\n m+=1\r\n if k==1:\r\n martix[m][m]=\"1\"\r\n for l in martix:\r\n print(\" \".join(l))", "n,k=map(int,input().split())\r\nif k>(n2):\r\n print(-1)\r\nelif k==(n2):\r\n for _ in range(n):\r\n print(\" \".join(str(j) for j in [1]n))\r\nelse:\r\n num=0\r\n x=0\r\n N=n+1-1\r\n mx=[[0]n for _ in range(n)]\r\n while True:\r\n num+=2N-1\r\n if num>k :\r\n break\r\n else:\r\n x+=1\r\n N-=1\r\n for i in range(x):\r\n for j in range(n):\r\n mx[i][j]=1\r\n mx[j][i]=1 \r\n s=k-(num-(2N-1))\r\n count=0\r\n if s%2==1:\r\n mx[x][x]=1\r\n dx=1\r\n while count<(s-1)/2:\r\n mx[x][x+dx]=1\r\n mx[x+dx][x]=1\r\n count+=1\r\n dx+=1\r\n else:\r\n if s==0:\r\n pass\r\n else:\r\n mx[x][x]=1\r\n mx[x+1][x+1]=1\r\n dx=1\r\n while count<s/2-1:\r\n mx[x][x+dx]=1\r\n mx[x+dx][x]=1\r\n dx+=1\r\n count+=1\r\n for i in range(n):\r\n print(\" \".join(str(j) for j in mx[i]))\r\n ", "# coding: utf-8\n\ndef format(res):\n return '\\n'.join([' '.join(line) for line in res])\n\ndef solution(n, k):\n if k > n * 2:\n return -1\n \n res = [['0'] * n for _ in range(n)]\n for i in range(n):\n if k == 0:\n return format(res)\n else:\n res[i][i] = '1'\n k -= 1\n j = i + 1\n while j < n and k > 1:\n res[i][j] = res[j][i] = '1'\n k -= 2\n j += 1\n \n if k == 0:\n return format(res)\n return -1\n\n\nif __name__ == '__main__':\n n, k = [int(val) for val in input().split()]\n print(solution(n, k))", "import sys \r\nimport math\r\n\r\ndef IO():\r\n\tsys.stdin=open(\"pyinput.txt\", 'r')\r\n\tsys.stdout=open(\"pyoutput.txt\", 'w')\r\n\r\ndef GCD(a, b):\r\n\tif(b==0): return a\r\n\telse: return GCD(b, a%b)\r\n\r\ndef LCM(a, b): return a(b//GCD(a, b))\r\n\r\ndef scan(TYPE_1, TYPE_2=0):\r\n\tif(TYPE_1==int):\r\n\t\treturn map(int, sys.stdin.readline().strip().split())\r\n\telif(TYPE_1==float):\r\n\t\treturn map(float, sys.stdin.readline().strip().split())\r\n\telif(TYPE_1==list and TYPE_2==float):\r\n\t\treturn list(map(float, sys.stdin.readline().strip().split()))\r\n\telif(TYPE_1==list and TYPE_2==int):\r\n\t\treturn list(map(int, sys.stdin.readline().strip().split()))\r\n\telif(TYPE_1==str):\r\n\t\treturn sys.stdin.readline().strip()\r\n\telse: print(\"ERROR!!!!\") \r\n\r\n\r\n\r\ndef main():\r\n\t\r\n\tn, k=scan(int)\r\n\tif(k>nn):\r\n\t\tprint(-1)\r\n\t\treturn\r\n\r\n\ta=[[0 for i in range(n)] for j in range(n)]\r\n\tfor i in range(n):\r\n\t\tfor j in range(i, n):\r\n\t\t\tif(a[i][i]==0 and k>0):\r\n\t\t\t\ta[i][i]=1\r\n\t\t\t\tk-=1\r\n\t\t\tif(k>1 and i!=j):\r\n\t\t\t\ta[i][j]=a[j][i]=1\r\n\t\t\t\tk-=2\r\n\r\n\tfor i in a:\r\n\t\tprint(i)\r\n\t\r\n\r\n# IO()\r\nmain()", "n,k = map(int, input().split())\r\narray = [[0]n for _ in range(n)]\r\n#字典序中大的矩阵优先第一行有1\r\n#注意输出！！！\r\nif k == 0:\r\n for i in range(n):\r\n for j in range(n):\r\n print(array[i][j],end=\" \")\r\n print()\r\nelif k > nn:\r\n print(-1)\r\nelse:\r\n #因为要对称，所以只需要填充一半\r\n for i in range(n):\r\n if array[i][i] == 0:#因为只筛一半，所以先看对角线上有没有1\r\n array[i][i] = 1\r\n k -= 1\r\n for j in range(i+1,n):\r\n if k >= 2:\r\n array[i][j] = 1\r\n array[j][i] = 1\r\n k -= 2 \r\n if k == 0:\r\n break\r\n for i in range(n):\r\n for j in range(n):\r\n print(array[i][j],end=\" \")\r\n print()\r\n \r\n \r\n \r\n\r\n ", "#游敬恩,2300012555\r\ndef ini(n):\r\n mat = []\r\n for i in range(n):\r\n mat.append([0]n)\r\n return mat\r\n\r\ndef prt_mat(n,mat):\r\n for i in range(n):\r\n print(' '.join(str(mat[i][j]) for j in range(n)))\r\n\r\nn,k=list(map(int,input().split()))\r\nif k>(n*2):\r\n print(-1)\r\nelif k==0:\r\n prt_mat(n,ini(n))\r\nelse:\r\n mat = ini(n)\r\n for i in range(n):\r\n if k > 0:\r\n mat[i][i] = 1\r\n k -= 1\r\n if k > 1:\r\n for j in range(i+1,n):\r\n if k > 1:\r\n mat[i][j] = 1\r\n mat[j][i] = 1\r\n k-=2\r\n prt_mat(n,mat)", "import math\nimport re\n\n\n\nn, k = map(int, input().split())\n\n\nif k > nn:\n print (-1)\n exit(0)\n\na = [[0] * n for i in range(n)]\n\nfor i in range(n):\n if k == 0:\n break\n a[i][i] = 1\n k -= 1\n if k == 0:\n break\n elif k == 1:\n a[i+1][i+1] = 1\n break\n else:\n for j in range(i+1, min(n, i + 1 + k//2)):\n a[i][j] = 1\n a[j][i] = 1\n k -= 2\n\n\nfor i in range(n):\n print(' '.join(map(str, a[i])))\n\n\n# n = int(input())\n# a = list(map(int, input().split()))\n# #print(' '.join(map(str, a)))\n#\n#\n#\n# b = set()\n#\n# for el in a:\n# if el-1 in b:\n# b.discard(el-1)\n# b.add(el)\n# else:\n# b.add(el)\n#\n# print(len(b))\n", "'''程文奇 2100015898'''\r\ndef f(n,k):\r\n numbermatrix = [[0] * n for _ in range(n)]\r\n if k>n*2:\r\n return -1\r\n else:\r\n for g in range(n):\r\n if k > 0:\r\n numbermatrix[g][g]=1\r\n k-=1\r\n for h in range(g+1,n):\r\n if k>=2:\r\n numbermatrix[g][h]=numbermatrix[h][g]=1\r\n k-=2\r\n return numbermatrix\r\nn,k=map(int,input().split())\r\nanswer=f(n,k)\r\nif answer==-1:\r\n print(answer)\r\nelse:\r\n for i in range(n):\r\n print(answer[i])", "n,k = map(int,input().split())\r\nif k > n ** 2:\r\n print(-1)\r\nelif k == 0:\r\n for i in range(n):\r\n print(' '.join(['0']n))\r\nelse:\r\n t = int((n * 2 - k) 0.5)\r\n a = n - t - 1\r\n rest = k - n 2 + (t+1) ** 2\r\n b = (rest-1) // 2 + 1\r\n if rest % 2 == 1:\r\n for i in range(a):\r\n print(' '.join(['1']n))\r\n print(' '.join(['1'](a+b) + ['0'](n-a-b)))\r\n for i in range(b-1):\r\n print(' '.join(['1'](a+1) + ['0'](n-a-1)))\r\n for i in range(n-a-b):\r\n print(' '.join(['1']a + ['0'](n-a)))\r\n elif rest >= 4:\r\n for i in range(a):\r\n print(' '.join(['1']n))\r\n print(' '.join(['1'] * (a + b) + ['0'] * (n - a - b)))\r\n print(' '.join(['1'] * (a + 2) + ['0'] * (n - a - 2)))\r\n for i in range(b-2):\r\n print(' '.join(['1'](a+1) + ['0'](n-a-1)))\r\n for i in range(n-a-b):\r\n print(' '.join(['1']a + ['0'](n-a)))\r\n else:\r\n for i in range(a):\r\n print(' '.join(['1']n))\r\n print(' '.join(['1'] (a + 1) + ['0'] * (n - a - 1)))\r\n print(' '.join(['1'] * a + ['0'] + ['1'] + ['0'](n-a-2)))\r\n for i in range(n-a-2):\r\n print(' '.join(['1']a + ['0'](n-a)))\r\n\r\n\r\n", "#!/usr/bin/env python3\n\nimport sys\n\n[n, k] = map(int, input().strip().split())\nif k > n n:\n\tprint (-1)\n\tsys.exit(0)\n\na = [[0 for _ in range(n)] for __ in range(n)]\nfor i in range(n):\n\tif k >= 1:\n\t\ta[i][i] = 1\n\t\tk -= 1\n\tfor j in range(i + 1, n):\n\t\tif k >= 2:\n\t\t\ta[i][j] = a[j][i] = 1\n\t\t\tk -= 2\n\nfor row in a:\n\tprint (' '.join(map(str, row)))\n", "n,k=map(int,input().split())\r\nif k>nn:\r\n print(-1)\r\nelse:\r\n a=[]\r\n for i in range(n):\r\n a.append([0]n)\r\n for i in range(n):\r\n if k==0:\r\n break\r\n for j in range(i,n):\r\n if k==1 and i!=j:\r\n a[i+1][i+1]=1\r\n k-=1\r\n elif k>=1 and i==j:\r\n a[i][i]=1\r\n k-=1\r\n elif k>1 and i!=j:\r\n a[i][j],a[j][i]=1,1\r\n k-=2\r\n for i in range(n):\r\n for j in range(n):\r\n print(a[i][j],end=' ')\r\n print()", "n, k = map(int, input().split())\r\n\r\nif k > n*2:\r\n print(-1)\r\nelse:\r\n m = [[0 for i in range(n)] for j in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n if i == j and k >= 1 and m[i][j] == 0:\r\n m[i][j] = 1;\r\n k -= 1\r\n elif i != j and k >= 2 and m[i][j] == 0:\r\n m[i][j] = 1;\r\n m[j][i] = 1;\r\n k -= 2\r\n for li in m:\r\n print(li)\r\n", "n,k=map(int,input().split())\r\nnx=n\r\nm=[[0]n for _ in range(n)]\r\nif k>n2:\r\n print(-1)\r\nelse:\r\n while k>0:\r\n for i in range(n-nx,n):\r\n if i==n-nx or k==1:\r\n m[n-nx][n-nx]=1\r\n k-=1\r\n else:\r\n m[n-nx][i]=1\r\n m[i][n-nx]=1\r\n k-=2\r\n if k==0 or k==1:break\r\n nx-=1\r\n for i in range(n):\r\n for j in range(n):\r\n print(m[i][j],end=' ')\r\n print()", "def main():\n n, k = map(int, input().split())\n l = [['0'] n for _ in range(n)]\n for y, row in enumerate(l):\n if not k:\n break\n k -= 1\n row[y] = '1'\n for x in range(y + 1, n):\n if k < 2:\n break\n k -= 2\n l[x][y] = row[x] = '1'\n if k:\n print(-1)\n else:\n for row in l:\n print(' '.join(row))\n\n\nif __name__ == \"__main__\":\n main()\n", "nums=input().split()\r\nn=int(nums[0])\r\nk=int(nums[1])\r\nm=[[0]n for _ in range(n)]\r\nif k>nn:\r\n print(-1)\r\nelse:\r\n \r\n for i in range(n):\r\n for j in range(i,n):\r\n d=2 if i!=j else 1\r\n if k>=d:\r\n k-=d\r\n m[i][j]=1\r\n m[j][i]=1\r\n else:\r\n if k==0:\r\n pass\r\n else:\r\n m[i+1][i+1]=1\r\n for i in range(n):\r\n for j in range(n):\r\n print(m[i][j],end=' ')\r\n #print(' ')\r\n print('\\n',end='')\r\n", "n,k=map(int,input().split())\r\nif k>n*2:\r\n print(-1)\r\nelse:\r\n m=[[0]n for i in range(n)]\r\n if k==n*2-1:\r\n m=[[1]n for i in range(n)]\r\n m[n-1][n-1]=0\r\n else:\r\n for i in range(n):\r\n if k==0:\r\n break\r\n m[i][i]=1\r\n k-=1\r\n for j in range(i+1,n):\r\n if k==0:\r\n break\r\n if k>=2:\r\n k-=2\r\n m[i][j]=1\r\n m[j][i]=1\r\n elif k==1:\r\n k-=1\r\n m[i+1][i+1]=1\r\n for i in range(n):\r\n ans=\" \".join(map(str,m[i]))\r\n print(ans)", "n, k = map(int, input().split())\r\nm = [[\"0\"]n for _ in range(n)] \r\nfor x in range(n):\r\n for y in range(x, n):\r\n if x == y and k >= 1:\r\n m[x][y] = \"1\"\r\n k -= 1\r\n elif k >= 2:\r\n m[x][y] = \"1\"\r\n m[y][x] = \"1\"\r\n k -= 2\r\nif k > 0:\r\n print(-1)\r\nelse:\r\n print(\"\\n\".join([\" \".join(i) for i in m]))", "n,k = map(int,input().split())\r\nmatrix = [[0 for j in range(n)] for i in range(n)]\r\nif k > n2:\r\n print(\"-1\")\r\nelse:\r\n for i in range(n):\r\n\r\n j = i\r\n while k >= 2 and j < n:\r\n if j != i:\r\n matrix[i][j],matrix[j][i] = 1,1\r\n k -= 2\r\n j += 1\r\n\r\n else:\r\n matrix[j][j] = 1\r\n k -= 1\r\n j += 1\r\n\r\n if k == 1:\r\n if matrix[i][i] == 0:\r\n matrix[i][i] = 1\r\n break\r\n if k == 0:\r\n break\r\n for i in range(n):\r\n print(matrix[i])", "def show():\r\n for i in range(n):\r\n print(' '.join([str(s) for s in a[i]]))\r\n\r\nn,k=[int(s) for s in input().split()]\r\na=[[0 for i in range(n)] for j in range(n)]\r\nif k>n*2:\r\n print(-1)\r\nelif k==0:\r\n show()\r\nelse:\r\n for i in range(n):\r\n if k>0:\r\n a[i][i]=1\r\n k-=1\r\n t=i\r\n while k>=2 and t<n-1:\r\n t+=1\r\n a[i][t]=1\r\n a[t][i]=1\r\n k-=2\r\n else:\r\n break\r\n show()", "n,k = map(int,input().split())\r\nn_1=n\r\nls = [[0]n for _ in range (n)]\r\nr=0;c=0\r\nif k>n*2 :\r\n print(-1)\r\nelse :\r\n while k>0 :\r\n ls[r][c]=1;k-=1 #处理对角线上的起始处\r\n for i in range (1,n):\r\n if k==1:\r\n ls[r+1][c+1]=1;k-=1\r\n break\r\n elif k>=2 :\r\n ls[r][c+i]=ls[r+i][c]=1\r\n k-=2\r\n elif k==0 :\r\n break\r\n r+=1;c+=1;n-=1\r\n for i in range (n_1):\r\n print(' '.join(map(str,ls[i])))\r\n", "import sys\r\n\r\nn, k = map(int, input().split())\r\nmatrix = [[0]n for _ in range(n)]\r\ni1, j1, i2, j2 = 0, 0, 0, 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if matrix[i][j]:\r\n continue\r\n if i == j and k < 1 or i != j and k < 2:\r\n break\r\n matrix[i][j] = matrix[j][i] = 1\r\n k -= 1 if i == j else 2\r\n\r\nfor i in range(n):\r\n if matrix[i][i] == 0 and k:\r\n matrix[i][i] = 1\r\n k -= 1\r\n\r\nif k:\r\n print(-1)\r\nelse:\r\n for row in matrix:\r\n print(row)\r\n", "n, k = map(int, input().split())\nA = [n [0] for i in range(n)]\nremain = k\nline = 0\nidx = 0\n\ntry:\n while remain != 0:\n if remain == 1:\n if A[line][line] == 1:\n A[line + 1][line + 1] = 1\n else:\n A[line][line] = 1\n break\n else:\n A[line][idx] = 1\n A[idx][line] = 1\n if idx == line:\n remain -= 1\n else:\n remain -= 2\n idx += 1\n if idx == n:\n line += 1\n idx = line\nexcept IndexError:\n print(-1)\n exit(0)\n\nfor i in A:\n print((\" \").join(str(t) for t in i))\n", "n,k=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append(['0']n)\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if i==j:\r\n if k>0:\r\n a[i][j]='1'\r\n k-=1\r\n else:\r\n if k>1:\r\n a[i][j],a[j][i]='1','1'\r\n k-=2\r\nif k>0:\r\n print(-1)\r\nelse:\r\n print('\\n'.join([' '.join(x) for x in a]))\r\n", "import sys\ninput = sys.stdin.readline\n\nn1, k = map(int, input().split())\nans = [[0 for i in range(n1+1)] for j in range(n1+1)]\nfor i in range(1, n1+1):\n if k == 0:\n break\n for j in range(i, n1+1):\n if i == j:\n ans[i][j] = 1\n k -= 1\n else:\n if k > 1:\n ans[i][j] = 1\n ans[j][i] = 1\n k -= 2\n if k == 0:\n break\n if k == 0:\n break\n\nif k > 0:\n print(\"-1\")\nelse:\n for i in range(1, n1+1):\n for j in range(1, n1+1):\n print(ans[i][j], end=\" \")\n print() \n\n \t\t \t \t \t \t\t \t\t\t\t\t \t \t", "import sys \r\n\r\ntry:\r\n\tsys.stdin = open(\"input.txt\", \"r\")\r\nexcept FileNotFoundError:\r\n\tpass \r\n\t\r\ndef pr(out):\r\n\tfor lst in out:\r\n\t\tfor i in lst:\r\n\t\t\tprint(i, end=\" \")\r\n\t\tprint()\t\r\n\t\r\ndef solve():\r\n\tn, k = [int(i) for i in input().split()]\r\n\tout = [[0 for i in range(n)] for i in range(n)]\r\n\tif k > nn:\r\n\t\tprint(-1)\r\n\t\treturn \r\n\t\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tif out[i][j] == 1:\r\n\t\t\t\tassert out[j][i] == 1\r\n\t\t\t\tcontinue\r\n\t\t\tif k == 1:\r\n\t\t\t\tif i != j:\r\n\t\t\t\t\tcontinue\r\n\t\t\t\telse:\r\n\t\t\t\t\tout[i][j] = 1\r\n\t\t\t\t\tk -= 1\r\n\t\t\telif k >= 2:\r\n\t\t\t\tout[i][j] = 1\r\n\t\t\t\tout[j][i] = 1\r\n\t\t\t\tif i == j:\r\n\t\t\t\t\tk -= 1\r\n\t\t\t\telse:\r\n\t\t\t\t\tk -= 2\r\n\t\r\n\tpr(out)\r\n\r\nx = 1\r\n#x = int(input())\r\nfor i in range(x):\r\n\tsolve()", "n, k = map(int, input().split())\r\nif n * n < k:\r\n\tprint(-1)\r\n\texit()\r\n\r\na = []\r\nfor i in range(n):\r\n\ta += [[0] * n]\r\n\r\nrow = 0\r\ncol = 0\r\nwhile k >= 2:\r\n\ta[row][col] = 1\r\n\tk -= 1\r\n\tif row != col:\r\n\t\ta[col][row] = 1\r\n\t\tk -= 1\r\n\r\n\tcol += 1\r\n\tif col >= n:\r\n\t\trow += 1\r\n\t\tcol = row\r\n\r\nif k==1:\r\n\tif col != row:\r\n\t\trow += 1\r\n\t\tcol = row\r\n\ta[row][row] = 1\r\n\r\nfor row in a:\r\n\tprint(row)\r\n", "def main():\r\n n, k = map(int, input().split())\r\n\r\n if k > n2:\r\n print(-1)\r\n return\r\n\r\n A = [[0] n for _ in range(n)]\r\n\r\n i = 0\r\n j = 0\r\n while k > 1:\r\n A[i][j] = 1\r\n k -= 1\r\n j += 1\r\n while k > 1 and j < n:\r\n A[i][j] = 1\r\n A[j][i] = 1\r\n j += 1\r\n k -= 2\r\n i += 1\r\n j = i\r\n if k == 1:\r\n A[i][j] = 1\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n print(A[i][j], end=' ')\r\n print()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "#王铭健，工学院 2300011118\r\nn, k = map(int, input().split())\r\nif k > n ** 2:\r\n print(\"-1\")\r\n exit()\r\nif k == 0:\r\n for p in range(n):\r\n for q in range(n):\r\n print(\"0\", end = \" \")\r\n print()\r\n exit()\r\nsum = 0\r\nfor i in range(n-1, -1, -1):\r\n if sum < k <= sum + 2 * i + 1:\r\n row_num = n - 1 - i\r\n rest = k - sum\r\n break\r\n else:\r\n sum += 2 * i + 1\r\nmatrix = [[1 for i in range(n)] for j in range(row_num)]\r\nfor m in range(n - row_num):\r\n matrix.append([1 for i in range(row_num)] + [0 for j in range(n-row_num)])\r\nmatrix[row_num][row_num] = 1\r\nif rest % 2 == 0:\r\n matrix[row_num+1][row_num+1] = 1\r\n for t in range(1, (rest-2)//2+1):\r\n matrix[row_num][row_num+t] = matrix[row_num+t][row_num] = 1\r\nelse:\r\n for t in range(1, (rest-1)//2+1):\r\n matrix[row_num][row_num+t] = matrix[row_num+t][row_num] = 1\r\nfor a in range(n):\r\n for b in range(n):\r\n print(matrix[a][b], end = \" \")\r\n print()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nans = [[0 for i in range(n+1)] for j in range(n+1)]\r\nfor i in range(1, n+1):\r\n if k == 0:\r\n break\r\n for j in range(i, n+1):\r\n if i == j:\r\n ans[i][j] = 1\r\n k -= 1\r\n else:\r\n if k > 1:\r\n ans[i][j] = 1\r\n ans[j][i] = 1\r\n k -= 2\r\n if k == 0:\r\n break\r\n if k == 0:\r\n break\r\n\r\nif k > 0:\r\n print(\"-1\")\r\nelse:\r\n for i in range(1, n+1):\r\n for j in range(1, n+1):\r\n print(ans[i][j], end=\" \")\r\n print() \r\n", "# Compiled by zhou_tian from pku\r\n\r\ndef eat_lemon(size, num):\r\n answer = [[0 for _ in range(size)]for _ in range(size)]\r\n po_x = 0\r\n po_y = 0\r\n\r\n while num > 1:\r\n answer[po_x][po_y] = 1\r\n answer[po_y][po_x] = 1\r\n if po_x == po_y:\r\n num -= 1\r\n else:\r\n num -= 2\r\n if po_x == size - 1:\r\n po_y += 1\r\n po_x = po_y\r\n else:\r\n po_x += 1\r\n\r\n if num == 1:\r\n if po_x == po_y:\r\n answer[po_x][po_y] = 1\r\n else:\r\n answer[po_y+1][po_y+1] = 1\r\n\r\n return answer\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\nif k > n*2:\r\n print(-1)\r\nelse:\r\n matrix = eat_lemon(n, k)\r\n for row in matrix:\r\n for i in row:\r\n print(i, end=' ')\r\n print()\r\n", "# 2300012142 林烨\r\nn, k = map(int,input().split())\r\nm = [[0]n for _ in range(n)]\r\nif k > n2:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n if k:\r\n for j in range(i,n):\r\n if k:\r\n if i == j:\r\n m[i][j] = 1\r\n k -= 1\r\n else:\r\n if k == 1:\r\n m[i+1][i+1] = 1\r\n k = 0\r\n else:\r\n m[i][j] = 1\r\n k -= 2\r\n for i in range(1,n):\r\n for j in range(i):\r\n m[i][j] = m[j][i]\r\n for l in m:\r\n print(' '.join(list(map(str,l))))", "n,k=map(int,input().split())\r\nmatrix=[[0 for i in range(n)] for j in range(n)]\r\nif k>n2:\r\n print(-1)\r\nelse:\r\n a=0\r\n while k!=0:\r\n k-=1\r\n matrix[a][a]=1\r\n j=a+1\r\n while j<n and k>1:\r\n matrix[a][j]=matrix[j][a]=1\r\n k-=2\r\n j+=1\r\n a+=1\r\n for i in matrix:\r\n print(' '.join(map(str,i)))", "def solve(a,b):\r\n if b>aa:\r\n return -1\r\n v=[]\r\n for i in range(a):\r\n v2=[]\r\n for j in range(a):\r\n v2.append(0)\r\n v.append(v2)\r\n for i in range(a):\r\n if b>0:\r\n v[i][i]=1\r\n b-=1\r\n for j in range(i+1,a):\r\n if b>=2:\r\n b-=2\r\n v[i][j]=1\r\n v[j][i]=1\r\n ans=\"\"\r\n for i in range(a):\r\n for j in range(a):\r\n ans+=str(v[i][j]) + \" \"\r\n ans+=\"\\n\"\r\n return ans\r\n\r\na,b=map(int,input().split())\r\nprint(solve(a,b))\r\n", "n, k = map(int, input().split())\r\nif n2<k:\r\n print(-1)\r\nelse:\r\n M = [[0]n for _ in range(n)]\r\n for i in range(n):\r\n for j in range(i,n):\r\n if k <= 0:\r\n break\r\n if i==j:\r\n if M[i][j]==1:\r\n continue\r\n elif M[i][j]!=1:\r\n if k%2==1:\r\n M[i][j]=1\r\n k -= 1\r\n elif k%2==0:\r\n M[i][j]=1\r\n M[i+1][j+1]=1\r\n k -= 2\r\n elif i!=j:\r\n M[i][j]=1\r\n M[j][i]=1\r\n k -= 2\r\n for i in range(n):\r\n print(M[i])\r\n", "n,k=map(int,input().strip().split(' '))\r\nmat=[]\r\nfor i in range(n):\r\n mat.append([0]n)\r\n\r\nfor i in range(n):\r\n \r\n for j in range(i,n):\r\n \r\n if k>1 and i!=j:\r\n k-=2\r\n mat[i][j],mat[j][i]=1,1\r\n elif k>0 and i==j:\r\n k-=1\r\n mat[i][j]=1 \r\n \r\nif k==0:\r\n for i in range(n):\r\n for j in range(n-1):\r\n print(mat[i][j],end=' ')\r\n print(mat[i][n-1])\r\nelse:\r\n print(-1)", "n,nums=map(int,input().split())\r\nmatrix_1=[]\r\nfor i in range(n,-1,-1):\r\n temp=[0]i\r\n matrix_1.append(temp)\r\nmatrix_1.pop()\r\n# print(matrix_1)\r\nrow=0\r\nleft=nums\r\ncolumn=0\r\nif nums>nn:\r\n print(-1)\r\nelse:\r\n if nums!=1:\r\n while left>0:\r\n if left!=1:\r\n if column<=len(matrix_1[row+1]):\r\n matrix_1[row][column]=1\r\n if column==0:\r\n left-=1\r\n else:\r\n left-=2\r\n column+=1\r\n else:\r\n row+=1\r\n column=0\r\n matrix_1[row][column] = 1\r\n if column == 0:\r\n left -= 1\r\n else:\r\n left -= 2\r\n column += 1\r\n else:\r\n row+=1\r\n column=0\r\n matrix_1[row][column]=1\r\n break\r\n else:\r\n matrix_1[0][0]=1\r\n\r\n matrix_2=[]\r\n for row in matrix_1:\r\n minus=n-len(row)\r\n row=[0]minus+row\r\n matrix_2.append(row)\r\n for i in range(n):\r\n for j in range(n):\r\n if matrix_2[i][j]==1 or matrix_2[j][i]==1:\r\n matrix_2[i][j],matrix_2[j][i]=1,1\r\n matrix_3 = []\r\n for i in matrix_2:\r\n temp = [str(j) for j in i]\r\n matrix_3.append(temp)\r\n for i in matrix_3:\r\n print(\" \".join(i))\r\n", "n, k = [int(x) for x in input().split()]\r\n\r\nif k > nn:\r\n print('-1')\r\nelse:\r\n\r\n\r\n res = [[0 for _ in range(n)] for _ in range(n)]\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n if i > j:\r\n res[i][j] = res[j][i]\r\n elif i == j:\r\n if k > 0:\r\n res[i][j] = 1\r\n k -= 1\r\n else:\r\n if k > 1:\r\n res[i][j] = 1\r\n k -= 2\r\n for i in range(n):\r\n print(' '.join(str(res[i][j]) for j in range(n)))\r\n", "import math\r\nn,k = map(int,input().split())\r\nif k > n2:\r\n print(-1)\r\nelse:\r\n m = math.ceil(math.sqrt(n2-k))\r\n gap = m2 + k - n2\r\n matrix = []\r\n for i in range(n):\r\n if i <= n-m-1:\r\n matrix.append(['1']n)\r\n else:\r\n matrix.append(['1'](n-m) + ['0']m)\r\n if gap != 0:\r\n matrix[n-m][n-m] = '1'\r\n gap -= 1\r\n if gap % 2 == 1:\r\n matrix[n-m+1][n-m+1] = '1'\r\n gap -= 1\r\n gap = gap//2\r\n for x in range(n-m+1,n-m+1+gap):\r\n matrix[n-m][x] = '1'\r\n matrix[x][n-m] = '1'\r\n for lst in matrix:\r\n print(' '.join(lst))", "#!/usr/bin/env python3\nfrom sys import stdin,stdout\n\ndef ri():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\nn, k = ri()\n\nif k > nn:\n print(-1)\n exit()\n\nm = [[0 for _ in range(n)] for __ in range(n)]\n\nfor i in range(n):\n if k == 1:\n m[i][i] = 1\n k-=1\n break\n if k == 0:\n break\n m[i][i] = 1\n k -= 1\n for j in range(i+1, n):\n if k == 1:\n m[i+1][i+1] = 1\n k -= 1\n break\n if k == 0:\n break\n m[i][j] = 1\n m[j][i] = 1\n k -= 2\n\nfor i in range(n):\n print(m[i])\n", "n, k = map(int, input().split())\r\nvis = [[0 for _ in range(1000)] for _ in range(1000)]\r\n\r\nflag = True\r\n\r\nif k > n n:\r\n flag = False\r\nelse:\r\n for i in range(n):\r\n for j in range(n):\r\n if vis[i][j] != 0:\r\n continue\r\n elif i == j and k != 0:\r\n vis[i][j] = 1\r\n k -= 1\r\n elif k >= 2:\r\n vis[i][j] = vis[j][i] = 1\r\n k -= 2\r\n\r\n if k:\r\n flag = False\r\n\r\nif flag:\r\n for i in range(n):\r\n for j in range(n):\r\n if j == 0:\r\n print(vis[i][j], end=\"\")\r\n else:\r\n print(\" \" + str(vis[i][j]), end=\"\")\r\n print()\r\nelse:\r\n print(\"-1\")", "#2300015804\r\nn, k = map(int, input().split())\r\nans = [[\"0\"] * n for _ in range(n)]\r\nfor i in range(n):\r\n if k <= 0: break\r\n if k >= 2 * (n-i) - 1 :\r\n for j in range(i, n): ans[i][j] = ans [j][i] = \"1\"\r\n elif k % 2 == 1:\r\n for j in range(i, i+(k//2)+1): ans[i][j] = ans [j][i] = \"1\"\r\n else:\r\n for j in range(i, i+(k//2)): ans[i][j] = ans [j][i] = \"1\"\r\n ans[i+1][i+1] = \"1\"\r\n k -= 2 * (n - i) - 1\r\n\r\nif k <= 0:\r\n for l in range(n):\r\n print(\" \".join(ans[l]))\r\nelse: print(-1)", "n, k = map(int, input().split())\r\nif k > n*2:\r\n print(-1)\r\n exit()\r\nmatrix = [['0']n for i in range(n)]\r\ni, j = 0, 0\r\nwhile k > 0:\r\n if i == j:\r\n matrix[i][j] = '1'\r\n k -= 1\r\n j += 1\r\n elif k >= 2:\r\n matrix[i][j] = matrix[j][i] = '1'\r\n k -= 2\r\n j += 1\r\n else:\r\n if i == n - 1:\r\n print(-1)\r\n exit()\r\n matrix[i + 1][i + 1] = '1'\r\n k -= 1\r\n if j == n:\r\n i += 1\r\n j = i\r\nfor i in range(n):\r\n print(' '.join(matrix[i]))", "n,k=map(int,input().split())\r\n\r\nimport sys\r\nif k>nn:\r\n print(-1)\r\n sys.exit(0)\r\na=[[0]n for _ in range(n)]\r\ni=0;j=1\r\nwhile k>0:\r\n if k==0:\r\n break\r\n a[i][i]=1;k-=1\r\n while k>=2:\r\n a[i][j]=a[j][i]=1\r\n k-=2\r\n j+=1\r\n if j==n:\r\n break\r\n if k==1 and i+1<=n-1:\r\n a[i+1][i+1]=1\r\n if k==1 and i+1==n:\r\n print(-1)\r\n sys.exit(0)\r\n i+=1\r\n j=i+1\r\n \r\nfor i in range(n):\r\n for j in range(n-1):\r\n print(a[i][j],end=' ')\r\n print(a[i][n-1])", "#-- coding: utf-8 -\n'''\nCreated on Wed Oct 25\nauthor 钱瑞 2300011480\n'''\nl=list(map(int,str(input()).split(' ')))\nn=l[0]\nk=l[1]\ndef an(n,k):\n if k>nn:\n return [[-1]]\n k_0=int(k)\n table=[[0]n for i in range(n)]\n i=0\n j=0\n while k_0>1:\n if i==j:\n table[i][j]=1\n k_0-=1\n else:\n table[i][j]=1\n table[j][i]=1\n k_0-=2\n j+=1\n if j==n:\n i+=1\n j=i\n if k_0==1:\n for i in range(n):\n if table[i][i]==0:\n table[i][i]=1\n break\n return table\ntable=an(n,k)\nfor i in range(len(table)):\n print(' '.join(list(map(str,table[i]))))", "r = lambda: int(input())\r\nra = lambda: [map(int, input().split())]\r\np = lambda a: print('{:.6f}'.format(a))\r\nn, k = ra()\r\na = [[0 for j in range(n)] for i in range(n)]\r\nif k>n2: print(-1)\r\nelse:\r\n while k>0:\r\n for i in range(n):\r\n if k>0:\r\n a[i][i] = 1\r\n k-=1\r\n for j in range(i+1, n):\r\n if k<=1: break\r\n else:\r\n a[i][j] = 1\r\n a[j][i] = 1\r\n k-=2\r\n for i in a: print(i)\r\n", "n, k = [int(i) for i in input().split()]\nif k > n2:\n print(-1)\n exit()\na = [[0 for z in range(n)] for i in range(n)]\nfor i in range(n):\n if k == 0:\n break\n a[i][i] = 1\n k-=1\n for j in range(i + 1, n):\n if k == 1 or k == 0:\n break\n a[i][j] = a[j][i] = 1\n k -= 2\n\nprint(\"\\n\".join(\" \".join([str(j) for j in i])for i in a))", "#23n2200017708\nn, k = map(int, input().split())\nmatrix = [[0 for i in range(n)] for j in range(n)]\ni = 0\n\ndef f(mat, a, b):\n mat[a][a] = 1\n b -= 1\n for j in range(1, b//2+1):\n mat[a][a+j] = mat[a+j][a] = 1\n if b%2 == 1:\n mat[a+1][a+1] = 1\n return(mat)\n\nif k <= n2: \n while k > 0:\n matrix = f(matrix, i, min(k, 2n-2i-1))\n k -= 2n-2i-1\n i += 1\n\n for i in range(n):\n print(matrix[i])\nelse:\n print(-1)\n\n ", "n,k=map(int,input().split())\r\nmat=[[0]n for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if i==j:\r\n if k>0:\r\n mat[i][j]=1\r\n k-=1\r\n else:\r\n if k>1:\r\n mat[i][j]=1\r\n mat[j][i]=1\r\n k-=2\r\nif k >0:\r\n print(-1)\r\n exit()\r\nfor r in mat:print(r)\r\n \r\n ", "n,k=map(int,input().split())\r\nmatrix=[[0]n for _ in range(n)]\r\nif k>n2:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n for j in range(n):\r\n if k>0 and matrix[i][j]==0:\r\n if i==j:\r\n matrix[i][j]=1\r\n k-=1 \r\n elif k>=2:\r\n matrix[i][j]=1\r\n matrix[j][i]=1\r\n k-=2\r\n for i in range(n):\r\n for j in range(n):\r\n print(matrix[i][j],end=' ')\r\n print()\r\n ", "import sys\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n\r\n if k > n2:\r\n print(-1)\r\n else:\r\n mat = [[0]n for i in range(n)]\r\n\r\n for i in range(n):\r\n for j in range(i, n):\r\n if k <= 0:\r\n break\r\n if i == j:\r\n mat[i][i] = 1\r\n k -= 1\r\n else:\r\n if k > 1:\r\n mat[i][j] = mat[j][i] = 1\r\n k -= 2\r\n\r\n for mat_r in mat:\r\n print(mat_r)\r\n\r\nif __name__ == '__main__':\r\n solve()", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Oct 26 15:49:57 2023\r\n\r\n@author: 苏柔德 2300011012\r\n\"\"\"\r\nn,k=map(int, input().split())\r\nmatrix=[[0]n for _ in range(n)]\r\nif k <=n2:\r\n for i in range(n):\r\n if k==0:\r\n break\r\n for j in range(i,n):\r\n if k==0:\r\n break\r\n elif i==j:\r\n matrix[i][j]=1 #对角线上放1\r\n k-=1 \r\n elif k>=2 and i!=j:\r\n matrix[i][j]=1\r\n matrix[j][i]=1 #剩余数量不少于2时，对称放1\r\n k-=2\r\n elif k==1:\r\n matrix[i+1][i+1]=1 #剩余数量为1时，对角线上放1\r\n k-=1\r\n for row in matrix:\r\n print(\" \".join(map(str, row)))\r\nelse:\r\n print(-1)", "a, b = map(int, input().split())\r\nmatrix = [[0] (a) for _ in range(a)]\r\nif b > a ** 2:\r\n print(-1)\r\nelse:\r\n for i in range(a):\r\n for j in range(a):\r\n if matrix[i][j] + matrix[j][i] == 2:\r\n continue\r\n if b == 1 and j != i:\r\n continue\r\n elif j == i:\r\n b -= 1\r\n else:\r\n b -= 2\r\n if b< 0:\r\n break\r\n matrix[i][j] = 1\r\n matrix[j][i] = 1\r\n if b < 0:\r\n break\r\n\r\n for i in range(a):\r\n for j in range(a):\r\n print(matrix[i][j], end=\"\")\r\n if j != a - 1:\r\n print(\" \", end=\"\")\r\n print()\r\n" ]	{"inputs": ["2 1", "3 2", "2 5", "1 0", "1 1", "20 398", "20 401", "100 3574", "100 10000", "100 10001", "2 3", "4 5", "5 6", "5 24", "2 0", "3 5", "3 3", "5 10", "3 4", "4 3", "1 1000000", "3 6", "1 2", "1 0", "1 1", "1 2", "1 3", "1 4", "1 5", "1 6", "1 7", "1 8", "1 9", "1 10", "1 11", "1 12", "1 13", "1 14", "1 15", "1 16", "1 17", "1 18", "1 19", "1 20", "1 21", "1 22", "1 23", "1 24", "1 25", "1 26", "2 0", "2 1", "2 2", "2 3", "2 4", "2 5", "2 6", "2 7", "2 8", "2 9", "2 10", "2 11", "2 12", "2 13", "2 14", "2 15", "2 16", "2 17", "2 18", "2 19", "2 20", "2 21", "2 22", "2 23", "2 24", "2 25", "2 26", "3 0", "3 1", "3 2", "3 3", "3 4", "3 5", "3 6", "3 7", "3 8", "3 9", "3 10", "3 11", "3 12", "3 13", "3 14", "3 15", "3 16", "3 17", "3 18", "3 19", "3 20", "3 21", "3 22", "3 23", "3 24", "3 25", "3 26", "4 0", "4 1", "4 2", "4 3", "4 4", "4 5", "4 6", "4 7", "4 8", "4 9", "4 10", "4 11", "4 12", "4 13", "4 14", "4 15", "4 16", "4 17", "4 18", "4 19", "4 20", "4 21", "4 22", "4 23", "4 24", "4 25", "4 26", "5 0", "5 1", "5 2", "5 3", "5 4", "5 5", "5 6", "5 7", "5 8", "5 9", "5 10", "5 11", "5 12", "5 13", "5 14", "5 15", "5 16", "5 17", "5 18", "5 19", "5 20", "5 21", "5 22", "5 23", "5 24", "5 25", "5 26", "100 0", "100 1", "100 2", "100 3", "100 99", "100 100", "100 101", "100 9999", "100 10000", "100 10001"], "outputs": ["1 0 \n0 0 ", "1 0 0 \n0 1 0 \n0 0 0 ", "-1", "0 ", "1 ", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1...", "-1", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...", "-1", "1 1 \n1 0 ", "1 1 1 0 \n1 0 0 0 \n1 0 0 0 \n0 0 0 0 ", "1 1 1 0 0 \n1 1 0 0 0 \n1 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 0 ", "0 0 \n0 0 ", "1 1 1 \n1 0 0 \n1 0 0 ", "1 1 0 \n1 0 0 \n0 0 0 ", "1 1 1 1 1 \n1 1 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 ", "1 1 0 \n1 1 0 \n0 0 0 ", "1 1 0 0 \n1 0 0 0 \n0 0 0 0 \n0 0 0 0 ", "-1", "1 1 1 \n1 1 0 \n1 0 0 ", "-1", "0 ", "1 ", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "0 0 \n0 0 ", "1 0 \n0 0 ", "1 0 \n0 1 ", "1 1 \n1 0 ", "1 1 \n1 1 ", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "0 0 0 \n0 0 0 \n0 0 0 ", "1 0 0 \n0 0 0 \n0 0 0 ", "1 0 0 \n0 1 0 \n0 0 0 ", "1 1 0 \n1 0 0 \n0 0 0 ", "1 1 0 \n1 1 0 \n0 0 0 ", "1 1 1 \n1 0 0 \n1 0 0 ", "1 1 1 \n1 1 0 \n1 0 0 ", "1 1 1 \n1 1 0 \n1 0 1 ", "1 1 1 \n1 1 1 \n1 1 0 ", "1 1 1 \n1 1 1 \n1 1 1 ", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "0 0 0 0 \n0 0 0 0 \n0 0 0 0 \n0 0 0 0 ", "1 0 0 0 \n0 0 0 0 \n0 0 0 0 \n0 0 0 0 ", "1 0 0 0 \n0 1 0 0 \n0 0 0 0 \n0 0 0 0 ", "1 1 0 0 \n1 0 0 0 \n0 0 0 0 \n0 0 0 0 ", "1 1 0 0 \n1 1 0 0 \n0 0 0 0 \n0 0 0 0 ", "1 1 1 0 \n1 0 0 0 \n1 0 0 0 \n0 0 0 0 ", "1 1 1 0 \n1 1 0 0 \n1 0 0 0 \n0 0 0 0 ", "1 1 1 1 \n1 0 0 0 \n1 0 0 0 \n1 0 0 0 ", "1 1 1 1 \n1 1 0 0 \n1 0 0 0 \n1 0 0 0 ", "1 1 1 1 \n1 1 0 0 \n1 0 1 0 \n1 0 0 0 ", "1 1 1 1 \n1 1 1 0 \n1 1 0 0 \n1 0 0 0 ", "1 1 1 1 \n1 1 1 0 \n1 1 1 0 \n1 0 0 0 ", "1 1 1 1 \n1 1 1 1 \n1 1 0 0 \n1 1 0 0 ", "1 1 1 1 \n1 1 1 1 \n1 1 1 0 \n1 1 0 0 ", "1 1 1 1 \n1 1 1 1 \n1 1 1 0 \n1 1 0 1 ", "1 1 1 1 \n1 1 1 1 \n1 1 1 1 \n1 1 1 0 ", "1 1 1 1 \n1 1 1 1 \n1 1 1 1 \n1 1 1 1 ", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 0 0 0 0 \n0 1 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 1 0 0 0 \n1 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 1 0 0 0 \n1 1 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 1 1 0 0 \n1 0 0 0 0 \n1 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 1 1 0 0 \n1 1 0 0 0 \n1 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 1 1 1 0 \n1 0 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 \n0 0 0 0 0 ", "1 1 1 1 0 \n1 1 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 \n0 0 0 0 0 ", "1 1 1 1 1 \n1 0 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 ", "1 1 1 1 1 \n1 1 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 ", "1 1 1 1 1 \n1 1 0 0 0 \n1 0 1 0 0 \n1 0 0 0 0 \n1 0 0 0 0 ", "1 1 1 1 1 \n1 1 1 0 0 \n1 1 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 ", "1 1 1 1 1 \n1 1 1 0 0 \n1 1 1 0 0 \n1 0 0 0 0 \n1 0 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 0 \n1 1 0 0 0 \n1 1 0 0 0 \n1 0 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 0 \n1 1 1 0 0 \n1 1 0 0 0 \n1 0 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 0 0 0 \n1 1 0 0 0 \n1 1 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 0 0 \n1 1 0 0 0 \n1 1 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 0 0 \n1 1 0 1 0 \n1 1 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 0 \n1 1 1 0 0 \n1 1 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 0 \n1 1 1 1 0 \n1 1 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 0 0 \n1 1 1 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 0 \n1 1 1 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 0 \n1 1 1 0 1 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 ", "-1", "0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...", "-1"]}	UNKNOWN	PYTHON3	CODEFORCES	99
8e4411543e2b85f1a8bb736483bfdbcb	Beautiful Divisors	Recently Luba learned about a special kind of numbers that she calls beautiful numbers. The number is called beautiful iff its binary representation consists of k<=+<=1 consecutive ones, and then k consecutive zeroes. Some examples of beautiful numbers: - 12 (110); - 1102 (610); - 11110002 (12010); - 1111100002 (49610). More formally, the number is beautiful iff there exists some positive integer k such that the number is equal to (2k<=-<=1)<=<=(2k<=-<=1). Luba has got an integer number n, and she wants to find its greatest beautiful divisor. Help her to find it! The only line of input contains one number n* (1<=≤<=n<=≤<=105) — the number Luba has got. Output one number — the greatest beautiful divisor of Luba's number. It is obvious that the answer always exists. Sample Input 3 992 Sample Output 1 496	[ "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef divisor(i):\r\n s = []\r\n for j in range(1, int(i ** (1 / 2)) + 1):\r\n if i % j == 0:\r\n s.append(i // j)\r\n s.append(j)\r\n return sorted(set(s))\r\n\r\npow2 = [1]\r\nfor _ in range(20):\r\n pow2.append(2 * pow2[-1])\r\ns = set()\r\nfor k in range(20):\r\n s.add((pow2[k + 1] - 1) * pow2[k])\r\n\r\nn = int(input())\r\nd = divisor(n)\r\nans = 1\r\nfor i in d:\r\n if i in s:\r\n ans = max(ans, i)\r\nprint(ans)", "import sys, bisect\r\n\r\nn = int(sys.stdin.readline())\r\nans = 0\r\nfor i in range(10):\r\n temp = '1' * (i + 1) + '0' * i\r\n if n % (int(temp, base=2)) == 0:\r\n ans = int(temp, base=2)\r\nprint(ans)", "n = int(input())\r\nl = [1,6,28,120,496,2016,8128,32640]\r\na=[]\r\nfor i in l:\r\n if n%i ==0 :\r\n a.append(i)\r\n\r\n\r\nprint(a[-1])\r\n\r\n \r\n \r\n", "import sys \r\ninput = sys.stdin.readline \r\nn = int(input())\r\na = set()\r\nfor i in range(1, int(n ** 0.5) + 1):\r\n if(n % i == 0):\r\n a.add(i)\r\n a.add(n // i)\r\nb = [1]\r\np = 2\r\nwhile(b[-1] <= n):\r\n b.append(4 * b[-1] + p)\r\n p = 2 \r\nb = set(b)\r\nl = list(a & b)\r\nl.sort()\r\nprint(l[-1])", "n = int(input(''))\r\nfor k in range( 9 , 0 , -1 ):\r\n divisor = ((2k)-1)(2(k-1))\r\n if n % divisor == 0 :\r\n print(divisor)\r\n break\r\n", "def fast(n):\r\n perfect = [32640, 8128, 2016, 496, 120, 28, 6, 1]\r\n for j in perfect:\r\n if n % j == 0:\r\n return j\r\n\r\nn = int(input())\r\nprint(fast(n))", "from collections import deque as dq\r\nn = int(input())\r\n\r\ns = dq(['1'])\r\na = []\r\nfor _ in range(8):\r\n b = ''\r\n for i in s:\r\n b += i\r\n s.append('0')\r\n s.appendleft('1')\r\n a.append(int(b,2))\r\nans = 0\r\nfor i in a:\r\n if n%i==0:\r\n ans = i\r\nprint(ans)\r\n", "import math\r\nn=int(input())\r\ns=math.log(n)/math.log(2)\r\ns=math.ceil(s)\r\nif n==1:\r\n print(1)\r\nelse:\r\n for i in range(math.ceil(s/2),0,-1):\r\n k=((2i)-1)(2(i-1))\r\n if n%k==0:\r\n print(k)\r\n break\r\n ", "n=int(input())\r\nm=1\r\nk=1\r\nwhile True:\r\n b=(2k-1)(2(k-1))\r\n if b > n: break\r\n if n%b==0:\r\n m=b\r\n k+=1\r\nprint(m)", "n = int(input())\r\nf=0\r\nfor k in range(20, 0, -1):\r\n x = (2k - 1) * (2*(k - 1))\r\n if n % x == 0 and f==0:\r\n print(x)\r\n f=1", "l=[]\ns='1'\nfor i in range(10):\n\tl.append(int(s,2))\n\ts+='0'\n\ts='1'+s\nn=int(input())\nfor i in range(9,-1,-1):\n\tif n%l[i]==0:\n\t\tprint(l[i])\n\t\tbreak", "L=[32640,8128,2016,496,120,28,6,1]\r\nn=int(input())\r\nfor i in L:\r\n if (n%i==0):\r\n print(i)\r\n break", "l=[1, 6, 28, 120, 496, 2016, 8128, 32640]\r\nl.reverse()\r\nn=int(input())\r\nfor i in l:\r\n if n%i==0:\r\n print(i)\r\n break", "def solve(m):\r\n k = 1\r\n while m % 2 == 0:\r\n m //= 2\r\n k += 1\r\n while m % ((1 << k) - 1) != 0:\r\n k -= 1\r\n return ((1 << k) - 1) (1 << (k - 1))\r\n\r\n\r\nn = int(input())\r\nprint(solve(n))", "import os,sys,io,math\r\nfrom array import \r\nfrom math import \r\nfrom bisect import \r\nfrom heapq import \r\nfrom functools import \r\nfrom itertools import \r\nfrom collections import \r\nI=lambda:[map(int,sys.stdin.readline().split())]\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\nn,r,res=IN(),0,0\r\nfor i in range(1,11):\r\n s=((1<<i)-1)(1<<(i-1))\r\n if not n%s:res=s\r\nprint(res)", "orig = int(input())\r\nn = orig\r\nwhile n>0:\r\n\r\n if orig%n==0: \r\n bn = bin(n)[2:]\r\n if bn.split(\"0\")[0] == len(bn.split(\"0\")[0]) bn.split(\"0\")[0][0]: \r\n if (len(bn.split(\"0\")[1:])+1==len(bn.split(\"0\")[0]) and \"\".join(bn.split(\"0\")[1:])==\"\"): \r\n print(n)\r\n break\r\n n -= 1", "l=[0]105\r\nfor i in range(1,100):\r\n l[i]=(2i-1)2(i-1)\r\n \r\n\r\nn=int(input())\r\nans=0\r\nfor i in range(1,100):\r\n if n%l[i]==0:\r\n ans=l[i]\r\nprint(ans) ", "n = int(input())\ndelit = [(2 x - 1) * (2 ** (x - 1)) for x in range(1,9)]\n\nfor i in delit[::-1]:\n if n % i == 0:\n print(i)\n break\n", "import math\r\nn = int(input())\r\nans = 1\r\nfor i in range(1, 100):\r\n k = int(pow(2, i * 2 + 1)) - int(pow(2, i))\r\n if n % k == 0:\r\n ans = k\r\n elif k > n:\r\n break\r\nprint(ans)", "def verif(n):\r\n x=bin(n)[2:] #bin()(O(log n)) avec n est le nombre qu'on veut convertir (1<=n<=100000)\r\n #une affectation(O(1)) et slicing de complexité O(n) avec n est le longueure de la nouvelle chaine qui est negligeable donc O(1)\r\n #d'ou cette ligne est de complexité O(1)\r\n i=0 #cette ligne de code contient une affectation donc de complexité O(1)\r\n while i<len(x) and x[i]=='1':\r\n #les conditons de while sont composées de:\r\n #operations unitaires: < et == (O(1))\r\n #len() de complexité O(1)\r\n #operateur logique: and de complexité O(1)\r\n #acces a un element du tableau (x[i]) O(1)\r\n #donc les conditions sont de complexité O(1)\r\n i=i+1 #cette ligne contient une affectation O(1) et une addition O(1) donc la ligne de code de complexité O(1)\r\n #la boucle while est de complexité O(n) avec n = longueure de x\r\n j=-1 #cette ligne de code contient une affectation donc de complexité O(1)\r\n while abs(j)<=len(x) and x[j]=='0':\r\n #les conditons de while sont composées de:\r\n #operations unitaires: <= et == (O(1))\r\n #len() de complexité O(1)\r\n #operateur logique: and de complexité O(1)\r\n #acces a un element du tableau (x[i]) O(1)\r\n #donc les conditions sont de complexité O(1)\r\n j=j-1 #cette ligne contient une affectation O(1) et une soustraction O(1) donc la ligne de code de complexité O(1)\r\n #la boucle while est de complexité O(n) avec n = longueure de x\r\n j=abs(j)-1 #cette ligne contient une affectation O(1) et une soustraction O(1) et abs() (O(1)) donc la ligne de code de complexité O(1)\r\n if i==j+1 and i+j==len(x):\r\n #les conditons de if sont composées de:\r\n #operations unitaires: + et == (O(1))\r\n #len() de complexité O(1)\r\n #operateur logique: and de complexité O(1)\r\n #donc les conditions sont de complexité O(1)\r\n return True\r\n else:\r\n return False\r\n #if est de complexité O(1)\r\n#cette fonction est de complexité O(log(n)+1+n+1+n+1+1)=O(n)\r\nn=int(input())\r\n#input() est de complexité O(n) avec n la langueure de la chine de charactères\r\n#(1<=n<=100000) donc (1<=longueure de n<=6)\r\n# donc O(n)=O(6)=O(1)\r\ndiviseurs=[] #O(1)\r\nfor i in range(1,n//2+1): #on a des operations unitaires: // et + donc O(1)\r\n if n%i==0: #cette condition contient % de complexité O(1) et une comparaison entre 2 entier (donc de complexité O(1)) la condition est donc de complexité O(1)\r\n diviseurs.append(i) #O(1)\r\n #cette if est de complexité O(1)\r\n#cette boucle for est de complexité O(n) car ona (n//2)+1 iteration et O((n//2)+1)=O(n)\r\ndiviseurs.append(n) #O(1)\r\ni=-1 #cette ligne de code contient une affectation donc de complexité O(1)\r\nwhile abs(i)<=len(diviseurs): #abs() est de complexité (O(1)), <= est une operation unitaire de complexité O(1), len() est de complexité O(1) donc la complexité de cette ligne est O(1)\r\n if verif(diviseurs[i]): #verif est de complexité O(n)\r\n print(diviseurs[i]) #O(1)\r\n break #break n'a pas de complexité\r\n #if est de complexité O(n)\r\n i=i-1 #cette ligne contient une affectation O(1) et une soustraction O(1) donc la ligne de code de complexité O(1)\r\n#while est de complexité O(mn) avec m est la longueure du tableau diviseurs et m est negligeable donc O(n)\r\n\r\n#donc le programme est de complexité O(n)\r\n", "import math\r\n\r\ndef proB(n):\r\n lst=[]\r\n for i in range(1,n+1):\r\n if(n%i==0):\r\n lst.append(i)\r\n k=int(math.log2(1e5))\r\n for j in lst:\r\n for i in range(k,0,-1):\r\n if(j== (2(i-1))(2*i - 1 ) ):\r\n maxi=j\r\n return maxi\r\nn=int(input())\r\nprint(proB(n))\r\n", "n=int(input())\r\nans=1\r\nstart='110'\r\nwhile(True):\r\n a=int(start,2)\r\n if a>n:\r\n break\r\n if n%a==0:\r\n ans=a\r\n start='1'+start+'0'\r\nprint(ans)", "n = int(input())\r\nl = [1]\r\nc=1\r\nk=1\r\nwhile(c<=n):\r\n if c>=n:\r\n break\r\n\r\n c = c 4\r\n k = k * 2\r\n c = c + k\r\n l.append(c)\r\n\r\n\r\no=0\r\nfor i in range(len(l)):\r\n if n%l[i]==0:\r\n o = l[i]\r\nprint(o)", "def STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\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\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\r\ndef f(n):\r\n d = ''\r\n while n >0 :\r\n x = n % 2\r\n d+=str(x)\r\n n //= 2\r\n return d[::-1]\r\n\r\n\r\ndef d(n):\r\n d =deque()\r\n i = 1\r\n while i * i <= n :\r\n if n%i==0:\r\n if n//i==i:\r\n d.append(i)\r\n else:\r\n d+=[i , n //i]\r\n i+=1\r\n return d\r\n\r\ndef check(s):\r\n r1 = s.find('1')\r\n r2 = s.rfind('1')\r\n cnt0 = 0\r\n cnt1 = 0\r\n s2 = list(s)\r\n for i in range(r1 , r2+1):\r\n if s2[i] == '1':cnt1 +=1\r\n else:cnt0 +=1\r\n cnt02 = s.count('0')\r\n if cnt0 == 0 and cnt02 + 1 == cnt1:\r\n return True\r\n return False\r\n\r\nn = INT()\r\nr1 = d(n)\r\nz = []\r\n\r\nfor i in r1:\r\n x = f(i)\r\n y = check(x)\r\n if y :\r\n z.append(i)\r\n\r\nz = list(reversed(sorted(z)))\r\n#print(z)\r\nprint(z[0])", "def check(n):\r\n b = bin(n)[2:]\r\n k = int(len(b) / 2) + 1\r\n return b[:k].count('1') == k and b[k:n].count('0') == k - 1\r\nn = int(input())\r\noutput = 1\r\nfor j in range(1, n + 1):\r\n if n % j == 0 and check(j) == True:\r\n output = j\r\nprint(output)\r\n", "import math\r\ndef beauty(n):\r\n x=list(map(int,list(str(bin(n))[2:])))\r\n l=len(x)\r\n if l%2==0:\r\n return False\r\n if set(x[:l//2+1])=={1} and set(x[l//2+1:])=={0}:\r\n return True\r\n return False\r\nn=int(input())\r\nfor i in range(n,0,-1):\r\n if n%i==0 and beauty(i):\r\n print(i)\r\n exit()\r\nprint(1)", "import math\r\n\r\nn=int(input())\r\ni=9\r\nwhile i!=0:\r\n div=(pow(2,i)-1)(pow(2,i-1))\r\n if n%div==0:\r\n print(div)\r\n break\r\n i=i-1\r\n", "n=int(input())\r\na=0\r\nb=[]\r\nwhile(True):\r\n c=( ((2a)-1) (2(a-1)) )\r\n if (c > n):\r\n break\r\n b.append(c)\r\n a=a+1\r\n \r\n\r\n \r\nfor i in range(n,0,-1):\r\n if (i in b) and ((n % i)== 0):\r\n print(i)\r\n break", "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=nmbr()\r\n ones=num=ans=1\r\n while n>=num:\r\n ones+=1\r\n num=((1<<ones)-1)<<(ones-1)\r\n if n%num==0:ans=num\r\n print(ans)\r\n", "num = int(input())\r\nb = [6, 28, 120, 496, 2016, 8128, 32640]\r\ndivisor = 1\r\n\r\nfor x in b:\r\n if(num % x == 0):\r\n divisor = x\r\n\r\nprint(divisor)\r\n \r\n", "n = int(input())\n\ndef check(x):\n t = bin(x)[2::]\n first = 0\n second = 0\n\n\n for i in t:\n if i == '1' and second == 0:\n first += 1\n elif i == '0':\n second += 1\n\n\n return first - second == 1 and (second + first) == len(t)\n \n\n\nfrom math import sqrt\n\nmx = -1\n\nfor i in range(1, int(sqrt(n)) + 1):\n if n % i == 0:\n if check(i):\n mx = max(mx, i)\n\n if check(n // i):\n mx = max(mx, n // i)\n\nprint(mx)\n", "def beautiful_num () :\r\n start = 0\r\n while True :\r\n start += 1\r\n yield ((2start)-1)(2(start-1))\r\n \r\n \r\nnum = int(input())\r\ncurrent_greatest = 0\r\n\r\nfor x in beautiful_num() :\r\n if x > num :\r\n break\r\n elif num%x == 0 :\r\n current_greatest = x\r\n \r\nprint (current_greatest)\r\n \r\n \r\n \r\n ", "def func():\r\n n = int(input())\r\n n1 = n\r\n k = 1\r\n ans = 0\r\n while True:\r\n if n % 2 == 0:\r\n n /= 2\r\n k += 1\r\n else:\r\n break\r\n while True:\r\n m = (2 * k - 1) * 2*(k - 1)\r\n if n1 % m == 0:\r\n print(m)\r\n break\r\n else:\r\n k -= 1\r\nfunc()", "n = int(input())\nd = [\n 0b11111111100000000,\n 0b111111110000000,\n 0b1111111000000,\n 0b11111100000,\n 0b111110000,\n 0b1111000,\n 0b11100,\n 0b110,\n 0b1\n]\nres = next(i for i in d if i (n // i) == n)\nprint(res)\n", "import sys\r\nimport os\r\nfrom collections import Counter\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n sys.stderr = open(\"error.txt\",\"w\")\r\n\r\ninput = lambda: sys.stdin.readline()\r\ndef getdivisors(x):\r\n res = []\r\n for i in range(1,int(x .5) + 1):\r\n if x % i == 0:\r\n res .append(i)\r\n if i < x.5:\r\n res.append(x // i)\r\n res .sort(reverse=True)\r\n return res\r\n\r\ndef getmax(lst):\r\n for i in lst:\r\n s = bin(i)[2:]\r\n ln = len(s)\r\n if ln % 2 == 1:\r\n if set(s[:ln//2 +1]) == {\"1\"} :\r\n if ln > 1 and set(s[ln//2+1:]) == {\"0\"}:\r\n return i\r\n if ln == 1:\r\n return 1\r\n \r\nx = int(input())\r\nprint(getmax(getdivisors(x)))", "s=[(2*(i)-1)2*(i-1) for i in range(9,0,-1)]\r\na=int(input())\r\nfor i in s:\r\n if a%i==0:\r\n print(i)\r\n break", "#893B (61No. Problem B)\r\n\r\nn = int(input())\r\nb = []\r\nfor i in range(1,n+1):\r\n if n%i == 0:\r\n t = bin(i).replace(\"0b\",\"\")\r\n if (len(t)%2 != 0):\r\n b.append(t)\r\n# print(b) \r\nfor i in range(len(b)-1,-1,-1):\r\n t = len(b[i])\r\n m = (t//2) + 1\r\n if '0' not in b[i][:m] and '1' not in b[i][m:]:\r\n # print(b[i])\r\n # print(b[i][:m],b[i][m:])\r\n if b[i][:m].count('1') - b[i][m:].count('0') == 1:\r\n print(int(b[i],2))\r\n break", "n = int(input())\r\n\r\nbn = 1\r\nans = 0\r\n\r\nwhile bn <= n:\r\n if n%bn == 0:\r\n ans = bn\r\n\r\n binbn = '1' + bin(bn)[2:] + '0'\r\n bn = int(binbn, 2)\r\n\r\nprint(ans)", "n=int(input())\r\nm=1\r\nfor i in range(2,11):\r\n a=(pow(2,i)-1)pow(2,i-1)\r\n if n%a==0:\r\n m=max(a,m)\r\n if a>n:\r\n break\r\nprint(m)", "x = \"111111110000000\"\r\n\r\nn = int(input())\r\nres = 0\r\n\r\nwhile True:\r\n if n % int(x, 2) == 0:\r\n print(int(x, 2))\r\n break\r\n x = x[1:-1]\r\n", "# -- coding: utf-8 --\n\n\n\ndef solve():\n n = int(input())\n\n for k in range(10, 0, -1):\n s = (2 ** k - 1) * (2 (k - 1))\n if n % s == 0:\n print(s)\n return\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n\t \t\t \t \t\t \t\t\t\t\t\t \t \t\t \t \t", "n=int(input())\r\na1=1\r\na2=6\r\na3=28\r\na4=120\r\na5=496\r\na6=2016\r\na7=8128\r\na8=32640\r\nif n%a8==0:\r\n\tprint(a8)\r\nelif n%a7==0:\r\n\tprint(a7)\r\nelif n%a6==0:\r\n\tprint(a6)\r\nelif n%a5==0:\r\n\tprint(a5)\r\nelif n%a4==0:\r\n\tprint(a4)\r\nelif n%a3==0:\r\n\tprint(a3)\r\nelif n%a2==0:\r\n\tprint(a2)\r\nelif n%a1==0:\r\n\tprint(a1)", "x = int(input())\r\n\r\nl = list()\r\nlcopy1 = list()\r\nlcopy2 = list()\r\n\r\nfor i in range(1, x+1, 1):\r\n if (x % i == 0):\r\n l.append(i)\r\n\r\nfor i in range(len(l)):\r\n l[i] = bin(l[i])\r\n l[i] = l[i][2:]\r\n\r\nfor i in range(len(l)):\r\n numberofones = len(l[i])//2 + 1\r\n numberofzeroes = len(l[i])//2\r\n if (len(l[i]) % 2 == 1):\r\n lcopy1.append(l[i])\r\n\r\nfor i in range(len(lcopy1)):\r\n numberofones = len(lcopy1[i])//2 + 1\r\n numberofzeroes = len(lcopy1[i])//2\r\n ones = \"\"\r\n zeroes = \"\"\r\n for j in range(numberofones):\r\n ones = ones+ \"1\"\r\n for j in range(numberofzeroes):\r\n zeroes = zeroes + \"0\"\r\n if(ones == (lcopy1[i][0:numberofones]) and zeroes == (lcopy1[i][numberofones:len(lcopy1[i])])):\r\n lcopy2.append(lcopy1[i])\r\n\r\ngbf = int(lcopy2[len(lcopy2)-1], 2)\r\nprint(gbf)\r\n", "for _ in range(int(input()) if not True else 1):\r\n n = int(input())\r\n a = []\r\n k = 0\r\n while (2k - 1) * 2(k-1) <= 105:\r\n a += [(2 ** k - 1) * 2 (k - 1)]\r\n k += 1\r\n for j in range(n, 0, -1):\r\n if n%j != 0:continue\r\n if j in a:\r\n print(j)\r\n break\r\n", "# /\r\n# * author: brownfox2k6\r\n# * created: 10/06/2023 22:43:52 Hanoi, Vietnam\r\n# */\r\n\r\n# s = \"1\"\r\n# a = []\r\n# for i in range(10):\r\n# a.append(int(s, 2))\r\n# s = '1' + s + '0'\r\n\r\n# print(a)\r\n\r\na = [1, 6, 28, 120, 496, 2016, 8128, 32640]\r\nn = int(input())\r\nfor i in range(n, 0, -1):\r\n if n % i == 0 and i in a:\r\n exit(print(i))", "\r\n\r\nl=[]\r\nfor i in range(1,11):\r\n l.append((pow(2,i)-1)pow(2,i-1))\r\nn=int(input())\r\nans=1\r\nfor i in l:\r\n if n%i==0:\r\n ans=i\r\nprint(ans)\r\n\r\n \r\n\r\n", "\r\nn = int(input())\r\ns = []\r\nk = 1\r\nwhile (2*k - 1)(2(k - 1)) <= n:\r\n s.append((2k - 1)(2(k - 1)))\r\n k += 1\r\nfor c in reversed(s):\r\n if n % c == 0:\r\n print(c)\r\n break\r\n", "beauty_nums = [32640, 8128, 2016, 496, 120, 28, 6, 1]\r\n\r\nn = int(input())\r\n\r\nfor d in beauty_nums:\r\n if n % d == 0:\r\n print(d)\r\n break", "a=[int('1'(i+1)+'0'i,2) for i in range(8)][::-1]\r\nn=int(input())\r\nfor i in a:\r\n if n%i==0:\r\n print(i)\r\n exit()", "n = int(input())\r\nlast = 1\r\nb = 1\r\nx = 1 # 2^(k-1)\r\nwhile b <= n:\r\n if n%b==0:\r\n last = b\r\n x = 2\r\n b = (2x - 1) x\r\nprint(last)\r\n \r\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn = int(input())\r\nfor k in range(9):\r\n\td = (22k-1) << k\r\n\tif n % d == 0:\r\n\t\tans = d\r\nprint(ans)", "import sys\r\ninput=sys.stdin.buffer.readline\r\nn=int(input())\r\nx=0\r\nfor i in range(1,17):\r\n if ((2i-1)(2(i-1)))<=n and (n%((2i-1)(2(i-1)))==0):\r\n x=((2i-1)(2*(i-1)))\r\nprint(x)", "n = int(input())\r\nm = 0\r\nb = \"1\"\r\nk = int(b, 2)\r\nwhile k <= n:\r\n if n % k == 0 and k > m:\r\n m = k\r\n b = \"1\" + b + \"0\"\r\n k = int(b, 2)\r\nprint(m)\r\n", "a=[1,6,28,120,496,2016,8128,32640]\r\nn=int(input())\r\ni=7\r\nwhile n%a[i]!=0:i-=1\r\nprint(a[i])", "\r\nindex=1\r\nn=int(input())\r\ndiv=1\r\nfor i in range(8):\r\n\tg='1'index+'0'(index-1)\r\n\tw=int(g,2)\r\n\tif n%w==0:\r\n\t\tdiv=w\r\n\t\r\n\tindex+=1\r\nprint(div)\r\n\r\n", "n=int(input())\r\n\r\ni=0\r\na=0\r\nb=[]\r\nwhile(a<n//2+1):\r\n a=(2i-1)(2*(i-1))\r\n b.append(a)\r\n i+=1\r\n \r\nfor i in range(len(b)-1,-1,-1):\r\n if(n%b[i]==0):\r\n print(b[i])\r\n break", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nn = int(input())\r\n\r\nbeauty = []\r\nfor i in range(1, 1000):\r\n b = int(\"1\"i + \"0\"(i-1), 2)\r\n beauty.append(b)\r\n if b > 105:\r\n break\r\n\r\nbeauty = beauty[::-1]\r\n\r\nfor div in beauty:\r\n if n%div == 0:\r\n print(div)\r\n break\r\n\r\n\r\n", "n=int(input())\r\nc=1\r\nfor i in range(1,9):\r\n k=((2(i)-1)(2(i-1)))\r\n if n%k==0:\r\n c=k\r\nprint(c)\r\n", "a=[1,6,28,120,496,2016,8128,32640]\r\nn=int(input())\r\nt=7\r\nwhile n%a[t]:t-=1\r\nprint(a[t])\r\n\r\n", "n=int(input())\r\nb=1\r\nk=0\r\nl=[]\r\nwhile( b<=n):\r\n k+=1\r\n b=((2k)-1)(2(k-1))\r\n l.append(b)\r\nl.pop()\r\nfor j in l:\r\n if n%j==0 :\r\n outp=j\r\nprint(outp)\r\n", "n = int(input())\r\ndivisors = []\r\n\r\npowers = [2i for i in range(18)]\r\nfor i in range(n, 0, -1):\r\n if n % i == 0:\r\n divisors.append(n // i)\r\n\r\nfor divisor in reversed(divisors):\r\n for j in range(1, len(powers)):\r\n if (powers[j] - 1) powers[j - 1] == divisor:\r\n print(divisor)\r\n exit()\r\n\r\n# To print all divisors: \r\n# print(divisors)\r\n", "beautiful_number = int(input())\r\n\r\nk = 8\r\nnumber = (2k - 1) (2 (k-1))\r\nwhile beautiful_number % number != 0:\r\n k-=1\r\n number = (2k - 1) * (2 (k-1))\r\nprint(number)", "beaut = [(2k-1)(2(k-1)) for k in range(1, 9)]\nbeaut.reverse()\n\nn = int(input())\n\nfor num in beaut: \n if n % num == 0: \n print(num)\n exit()\n", "n = int(input())\n\nif n != 1:\n k = 1\n i = 1\n l = []\n while k < n:\n k = (2i-1)2*(i-1)\n if k == n:\n l.append(k)\n\n elif n % k == 0:\n l.append(k)\n\n i +=1\n \n print(max(l))\nelse:\n print(1)\n \t \t \t\t \t \t\t \t \t\t \t\t", "n=int(input())\r\na=[130816,32640,8128,2016,1008,496,120,28,6,1]\r\nfor i in a:\r\n if n%i==0:\r\n print(i)\r\n break\r\n", "memo = []\r\ni = 0\r\nwhile True:\r\n tmp = int('1' (i + 1) + '0' * i, 2)\r\n if tmp > 10*5:\r\n break\r\n memo.append(tmp)\r\n i += 1\r\n\r\nn = int(input())\r\nfor i in memo[::-1]:\r\n if i <= n and n % i == 0:\r\n print(i)\r\n break\r\n ", "from collections import Counter\r\n\r\n\r\ndef get_bin(x):\r\n return format(x, 'b')\r\n\r\n\r\ndef get_dec(x):\r\n return int(x, 2)\r\n\r\n\r\nn = int(input())\r\nnum_bin = str(get_bin(n))\r\ncount = Counter(num_bin)\r\nones = count['1']\r\nzeros = count['0']\r\nif ones == zeros + 1:\r\n pass\r\nelse:\r\n zeros = '0' (ones - 1)\r\n zeros = len(zeros)\r\n\r\nwhile ones >= 0 and zeros >= 0:\r\n num = '1' * (ones)\r\n num += '0' * (zeros)\r\n num_dec = get_dec(num)\r\n if n % num_dec == 0:\r\n print(num_dec)\r\n exit()\r\n else:\r\n ones -= 1\r\n zeros -= 1\r\n", "n=int(input())\r\nfor i in range(8,0,-1):\r\n x=((2*i)-1)(2(i-1))\r\n if(n%x==0):\r\n print(x)\r\n break", "a = 32640, 8128, 2016, 496, 120, 28, 6, 1\r\nb = int(input())\r\nprint(a[[b % i for i in a].index(0)])\r\n\r\n", "a = [1,\r\n 6,\r\n 28,\r\n 120,\r\n 496,\r\n 2016,\r\n 8128,\r\n 32640]\r\nn = int(input())\r\nfor i in range(7, 0, -1):\r\n if (n % a[i] == 0):\r\n print(a[i])\r\n exit(0)\r\nprint(1)\r\n", "\r\nn = int(input())\r\nbeautiful = []\r\n \r\nk = 1\r\nwhile True:\r\n num = (2 k - 1) * (2 (k - 1))\r\n if num > 10 5:\r\n break\r\n beautiful.append(num)\r\n k += 1\r\n \r\nfor x in beautiful[::-1]:\r\n if n % x == 0:\r\n print(x)\r\n break", "n=int(input())\r\ns=list(((2*k)-1)(2*(k-1)) for k in range(1,9))\r\nbn=[]\r\ns.sort()\r\nfor i in range(8):\r\n if (n%s[i]==0):\r\n bn.append(s[i])\r\nmaxdiv=max(bn)\r\nprint(maxdiv)", "import math\r\ndef divs(n) :\r\n list1 = []\r\n for i in range(1, int(math.sqrt(n) + 1)) :\r\n if (n % i == 0) :\r\n if (n // i == i):\r\n list1.append(i)\r\n\r\n else :\r\n list1.append(i)\r\n list1.append(int(n / i))\r\n return list1\r\ndivs = (divs(int(input())))\r\ndivs.sort()\r\nbeauty = []\r\nfor i in range(1,12):\r\n string = '1'i+'0'(i-1)\r\n beauty.append(int(string,2))\r\nfor i in divs[::-1]:\r\n if i in beauty:\r\n print(i)\r\n break", "import math\r\n\r\ndef main_function():\r\n n = int(input())\r\n t = n\r\n l = n\r\n k = 0\r\n while (t % 2 == 0):\r\n k += 1\r\n t = t // 2\r\n\r\n\r\n\r\n\r\n while l % ((2 * k)* (2(k + 1) - 1)) != 0:\r\n k -= 1\r\n print((2 k) * (2*(k + 1) - 1))\r\n\r\n\r\n\r\n\r\nmain_function()", "from math import\r\nn = int(input())\r\nk = 1\r\nfor i in range(1, ceil(log(n)/log(2)) + 1):\r\n x = pow(2, i) - 1\r\n y = pow(2, i - 1)\r\n if n % (x * y) == 0:\r\n k = x * y\r\n \r\nprint(int(k))\r\n\r\n ", "n = int(input())\r\nstep = 2\r\nbn = 1\r\nans = 1\r\nwhile n >= bn:\r\n if n % bn == 0:\r\n ans = bn\r\n bn = 4\r\n bn += step\r\n step = 2\r\nprint(ans)\r\n", "n,c=int(input()),1\r\nfor i in range(1,9):\r\n\tz=(2*(i)-1)(2(i-1))\r\n\tif n%(z)==0:c=z\r\nprint(c)", "v=[]\r\nl=[]\r\ns=int(input())\r\nfor i in range(1,int(s(1/2))+1):\r\n if s%i==0 :\r\n v+=[i]\r\n if s%(s//i)==0:\r\n v+=[(s//i)]\r\nv.sort()\r\nv.reverse()\r\nfor j in range(1,33):\r\n l+=[((2*j)-1)(2(j-1))]\r\nfor k in v:\r\n if k in l:\r\n print(k)\r\n break", "n = int(input())\r\nk = 1\r\na = 1\r\nwhile (2 k - 1) * (2 (k - 1)) <= n:\r\n if n % ((2 k - 1) * (2 (k - 1))) == 0: a = k\r\n k += 1\r\nprint((2 a - 1) * (2 ** (a - 1)))\r\n", "\r\nn = int(input())\r\nbeautifulNumbers = []\r\nnum = 1\r\nones = 1\r\nzeroes = 0\r\nwhile(num<=100000):\r\n beautifulNumbers.append(num)\r\n ones+=1\r\n zeroes+=1\r\n str = \"1\"ones+\"0\"zeroes\r\n num = int(str,2)\r\nfor i in range(len(beautifulNumbers)-1,-1,-1):\r\n if(n%beautifulNumbers[i]==0):\r\n print(beautifulNumbers[i])\r\n break", "n = int(input())\r\n\r\nk = 0\r\nans = 1\r\ncur = 1\r\n\r\nwhile cur <= n:\r\n\tif n % cur == 0:\r\n\t\tans = cur\r\n\tcur <<= 1\r\n\tk += 2\r\n\tcur += (2*k)\r\nprint(ans)", "n = int(input())\r\narr = []\r\ns = ''\r\nj,k = 1,0\r\nfor i in range(15):\r\n s = '1'(j) + '0'(k)\r\n arr.append(int(s,2))\r\n k+=1\r\n j+=1\r\nans = 0\r\nfor i in range(15):\r\n if n%arr[i]==0:\r\n ans = max(ans,arr[i])\r\n \r\nprint(ans)\r\n", "n = int(input())\r\n\r\ni = 0\r\nwhile 1:\r\n base = ('1'(i+1)) + ('0'*i)\r\n x = int(base , 2)\r\n if x > n: break\r\n if n%x==0:\r\n ans = x\r\n\r\n i+=1 \r\n\r\nprint(ans)" ]	{"inputs": ["3", "992", "81142", "76920", "2016", "1", "6", "32640", "12096", "55948", "47262", "22876", "96120", "42160", "38304", "89408", "97920", "55493", "38021", "21445", "100000", "497", "240", "21204", "65536", "364", "1024", "36", "28", "14400", "10080", "9", "2", "42", "83160", "65534", "1026", "1025", "1027", "2018", "2020", "123", "150", "5", "66", "12768", "156", "99990", "248"], "outputs": ["1", "496", "1", "120", "2016", "1", "6", "32640", "2016", "1", "6", "28", "120", "496", "2016", "8128", "32640", "1", "1", "1", "1", "1", "120", "6", "1", "28", "1", "6", "28", "120", "2016", "1", "1", "6", "120", "1", "6", "1", "1", "1", "1", "1", "6", "1", "6", "28", "6", "6", "1"]}	UNKNOWN	PYTHON3	CODEFORCES	83
8e47b70b8fb09fa94b3f2521cab6ba43	Longest Regular Bracket Sequence	This is yet another problem dealing with regular bracket sequences. We should remind you that a bracket sequence is called regular, if by inserting «+» and «1» into it we can get a correct mathematical expression. For example, sequences «(())()», «()» and «(()(()))» are regular, while «)(», «(()» and «(()))(» are not. You are given a string of «(» and «)» characters. You are to find its longest substring that is a regular bracket sequence. You are to find the number of such substrings as well. The first line of the input file contains a non-empty string, consisting of «(» and «)» characters. Its length does not exceed 106. Print the length of the longest substring that is a regular bracket sequence, and the number of such substrings. If there are no such substrings, write the only line containing "0 1". Sample Input )((())))(()()) ))( Sample Output 6 2 0 1	[ "import sys\r\ninput=lambda:sys.stdin.readline().strip()\r\n\r\ns=input()\r\nstack=[]\r\nm = 0\r\nans = 1\r\nxx = -1\r\nfor i in range(len(s)):\r\n\tif s[i] == '(':stack.append(i)\r\n\telse:\r\n\t\tif len(stack) > 0:\r\n\t\t\tstack.pop()\r\n\t\t\toptimal = i - stack[-1] if len(stack) > 0 else i - xx\r\n\t\t\tif optimal >= m:\r\n\t\t\t\tif optimal > m: m, ans = optimal, 1\r\n\t\t\t\telse: ans += 1\r\n\t\telse:\r\n\t\t\txx = i\r\nprint(m, ans)", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Sat Sep 1 15:49:49 2018\n\n@author: all_blue\n\"\"\"\n\nsequence = [char for char in input().strip()]\nstack = []\n\nmax_seq = 0\nnum_max_seq = 1\nopen_braces_idx = -1\n\nfor idx in range(len(sequence)):\n if sequence[idx] == \"(\":\n stack.append(idx)\n elif stack:\n stack.pop()\n curr_seq = idx - stack[-1] if stack else idx - open_braces_idx\n if curr_seq > max_seq:\n max_seq = curr_seq\n num_max_seq = 1\n elif curr_seq == max_seq:\n num_max_seq += 1\n else:\n open_braces_idx = idx\n\nprint(max_seq, num_max_seq)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[2]:\n\n\nfrom collections import deque\ns=input()\nstack=deque()\nl=len(s)\n\nstack.append(-1)\ncount=res=0\nfor i in range(l):\n if s[i]=='(':\n stack.append(i)\n \n else:\n stack.pop()\n if stack:\n if i-stack[-1]>res:\n count=1\n \n elif i-stack[-1]==res:\n count+=1\n \n res=max(res,i-stack[-1])\n \n else:\n stack.append(i)\n \nif res:\n print(res,count)\n \nelse:\n print(0,1)\n\n\n# In[ ]:\n\n\n\n\n", "from collections import deque\n\ns = input()\nstack = deque()\nls = [0]1000000\nans = -1\n\nfor i in range(len(s)):\n if s[i] == ')':\n if stack:\n r = stack.pop()\n ls[i] = ls[r-1] + (i-r+1)\n else:\n stack.append(i)\n # print(ls, stack)\n\nf_ans = max(ls)\ncount = ls.count(f_ans)\n\nif f_ans <= 0:\n print(0, 1)\nelse:\n print(f_ans, count)\n", "#!/usr/bin/env python\n\n\ndef main():\n longest = 0\n count = 1\n unbalanced = list()\n push = unbalanced.append\n pop = unbalanced.pop\n head = -1\n for cursor, paren in enumerate(input()):\n if paren == \"(\":\n push(cursor)\n elif unbalanced:\n pop()\n span = cursor - (unbalanced[-1] if unbalanced else head)\n if span == longest:\n count += 1\n elif span > longest:\n longest = span\n count = 1\n else:\n head = cursor\n print(longest, count)\n\n\nif __name__ == '__main__':\n main()\n", "# --coding:utf-8 --\r\nline=input()\r\ns=[-1]\r\nmax_len=0\r\nmax_num=1\r\nl=len(line)\r\nfor i in range(l):\r\n if line[i]=='(':\r\n s.append(i)\r\n elif len(s)>1:\r\n s.pop()\r\n n=i-s[-1]\r\n if max_len<n:\r\n max_len,max_num=n,1\r\n elif max_len==n:\r\n max_num+=1\r\n else:\r\n s[0]=i\r\nprint(str(max_len)+' '+str(max_num))\r\n", "s = input()\nn = len(s)\nst = []\nen = [0]n\nfor i in range(n):\n if s[i] == '(':\n st.append(i)\n elif st:\n en[st.pop()] = i\n\nans = 0\nmx = 0\ncnt = 1\npen = 0\ni = 0\nwhile i < n:\n if en[i]:\n ta = en[i]-i+1\n if i == pen+1:\n ans += ta\n else:\n ans = ta\n if ans > mx:\n mx = ans\n cnt = 1\n elif ans == mx:\n cnt += 1\n pen = en[i]\n i = en[i]+1\n else:\n i += 1\nprint(mx,cnt)\n", "s = input()\r\ncnt = ans = 0\r\nn = len(s)\r\nst = [-1]\r\nfor i in range(n):\r\n if s[i]=='(': st.append(i)\r\n else:\r\n if st[-1]==-1 or s[st[-1]]==')': st.append(i)\r\n else:\r\n st.pop()\r\n if i-st[-1]>ans:\r\n ans = i-st[-1]\r\n cnt = 1\r\n elif i-st[-1]==ans: cnt += 1\r\nif ans==0: cnt = 1\r\nprint(ans,cnt)", "import sys\nfrom collections import deque\n\n# Reading input faster in Python\ninput = sys.stdin.readline\n\n# Function for reading integer inputs\ndef si():\n return int(input())\n\n# Function for reading two integers\ndef sii():\n return map(int, input().split())\n\n# Function for reading three integers\ndef siii():\n return map(int, input().split())\n\n\n# Main function\ndef main():\n s = input().strip()\n n = len(s)\n\n d = [-1] * n\n st = deque()\n\n maxi, cnt = 0, 1\n\n for i in range(n):\n if not st or s[i] == '(':\n st.append(i)\n continue\n\n pos = st.pop()\n\n if s[pos] == '(':\n if d[pos-1] != -1:\n d[i] = d[pos-1]\n else:\n d[i] = pos\n\n length = i - d[i] + 1\n if length == maxi:\n cnt += 1\n elif length > maxi:\n maxi = length\n cnt = 1\n\n print(maxi, cnt)\n\nif __name__ == \"__main__\":\n main()\n\n\n \t \t\t \t \t\t \t\t \t\t\t\t \t\t \t", "s = input()\n\nstack = []\nmax_length = 0\ncurrent_length = 0\ncount = 1\n\nstart = 0\n\nfor i in range(len(s)):\n if s[i] == '(':\n stack.append(i)\n else:\n if stack:\n stack.pop()\n if stack:\n current_length = i - stack[-1]\n else:\n current_length = i - start + 1\n\n if current_length > max_length:\n max_length = current_length\n count = 1\n elif current_length == max_length:\n count += 1\n else:\n start = i + 1\n\nprint(max_length, count)\n\n \t \t\t \t\t \t \t\t \t\t \t\t\t\t", "s = input()\r\narr = [-1]\r\nlongest_len = 0\r\ncount = 1\r\nfor j, k in enumerate(s):\r\n if k == '(':\r\n arr.append(j)\r\n elif len(arr) > 1:\r\n arr.pop()\r\n mini = j - arr[-1]\r\n if longest_len < mini:\r\n longest_len, count = mini, 1\r\n elif longest_len == mini:\r\n count += 1\r\n else:\r\n arr[0] = j\r\n\r\nprint(longest_len, count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n", "a,b = 0,1\r\nl = [-1]\r\nfor i,c in enumerate(input()):\r\n if c == '(':\r\n l.append(i)\r\n elif len(l) > 1:\r\n l.pop()\r\n minl = i - l[-1]\r\n if a < minl:\r\n a,b = minl,1\r\n elif a == minl:\r\n b += 1\r\n else:\r\n l[0] = i\r\nprint(a, b)", "s=input()\r\nw,c,b,l=0,1,-1,[]\r\nfor i in range(len(s)):\r\n if s[i]=='(':l.append(i)\r\n elif l:\r\n l.pop()\r\n t=i-l[-1] if l else i-b\r\n if t>w: w,c=t,1\r\n elif t==w: c+=1\r\n else:b=i\r\nprint(w,c)", "def checker(string):\r\n n = len(string)\r\n # Create a stack and push -1 as initial index into it. It is base case\r\n stack = [-1]\r\n\r\n # Initialize results\r\n max_value = 0\r\n max_count = 1\r\n # Traverse all characters of given string\r\n for i in range(n):\r\n\r\n # If opening bracket, push index of it into stack\r\n if string[i] == '(':\r\n stack.append(i)\r\n\r\n # if there is closing bracket and stack isn't empty, then pop the stack value (opening bracket)\r\n # find length and calculate results\r\n elif len(stack) > 1:\r\n # to count length correctly we have to pop our last value. Otherwise, we won't include our opening bracket in length\r\n # also, we need to match brackets, so pop with stack is a good way to \"eliminate\" balanced pair of brackets\r\n stack.pop()\r\n # current index (closing brackets) - last index in stack (opening brackets)\r\n length = i - stack[-1]\r\n # if our current length and max length are equal, then add to max length count.\r\n if length == max_value:\r\n max_count += 1\r\n # if our length is higher, then reset max length count and replace max value\r\n elif length >= max_value:\r\n max_value = length\r\n max_count = 1\r\n # if there is nothing in our stack, then make start value current index to continue our max length check\r\n else:\r\n stack[0] = i\r\n\r\n return max_value, max_count\r\n\r\n\r\ns = input()\r\nmax_value, max_count = checker(s)\r\nprint(max_value, max_count)\r\n\r\n", "from collections import defaultdict\r\n\r\ns = input()\r\n\r\nstack = [ ]\r\ndct = defaultdict(int)\r\n\r\nn = len(s)\r\nd = [-1 for i in range(n)]\r\nc = [-1 for i in range(n)]\r\n\r\ni = 0\r\nwhile(i<n):\r\n if(s[i]=='('):\r\n stack.append(i)\r\n elif(stack==[]):\r\n None\r\n else:\r\n d[i] = stack.pop()\r\n \r\n if(c[d[i]-1]!=-1):\r\n c[i] = c[d[i]-1]\r\n else:\r\n c[i] = d[i]\r\n i+=1\r\n\r\n# print(d)\r\n# print(c)\r\n_max = 0\r\ncount = 1\r\n\r\nfor i in range(n):\r\n if(c[i]!=-1):\r\n temp =(i-c[i]+1)\r\n if(temp>_max):\r\n _max = temp\r\n count =1\r\n elif(temp==_max):\r\n count+=1\r\n\r\nprint(_max,count)\r\n", "#!/usr/bin/env python\n\n\ndef main():\n longest = 0\n count = 1\n left = list()\n lead = 0\n push = left.append\n pop = left.pop\n for paren in input():\n if paren == \"(\":\n push(0)\n elif not left:\n lead = 0\n else:\n span = pop() + 2\n if left:\n span += pop()\n push(span)\n else:\n span += lead\n lead = span\n if span == longest:\n count += 1\n elif span > longest:\n longest = span\n count = 1\n print(longest, count)\n\n\nif __name__ == '__main__':\n main()\n", "#!/usr/bin/env python\n\nline = input()\ns = [-1]\nmax = 0\nn_max = 0\ni = 0\nfor a in line:\n if a == '(':\n s.append(i)\n elif len(s) > 1:\n e = s.pop()\n d = i - s[-1]\n if d > max:\n max = d\n n_max = 1\n elif d == max:\n n_max += 1\n else:\n s[0] = i\n i =i + 1\n\nif max == 0:\n print(0, 1)\nelse:\n print(max, n_max)\n\n", "bracket_str = input()\nstack = [-1]\nmax_len = 0\nmax_len_count = 1\n\nfor i in range(len(bracket_str)):\n if bracket_str[i] == ')':\n if len(stack) > 1:\n stack.pop()\n cur_len = i - stack[-1]\n if cur_len == max_len:\n max_len_count += 1\n elif cur_len > max_len:\n max_len = cur_len\n max_len_count = 1\n elif len(stack) == 1:\n stack[0] = i\n else:\n stack.append(i)\n\nprint(max_len, max_len_count)\n", "import sys\r\nrln=sys.stdin.buffer.readline\r\nrl=lambda:rln().rstrip(b'\\r\\n').rstrip(b'\\n')\r\nri=lambda:int(rln())\r\nrif=lambda:[map(int,rln().split())]\r\nrt=lambda:rl().decode()\r\nrtf=lambda:rln().decode().split()\r\ninf=float('inf')\r\ndir4=[(-1,0),(0,1),(1,0),(0,-1)]\r\ndir8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\nYES,NO,Yes,No,yes,no='YES','NO','Yes','No','yes','no'\r\n\r\ns=rt()\r\nn=len(s)\r\nmx,cnt=0,1\r\nstk=[-1]\r\nfor i in range(n):\r\n if s[i]=='(':\r\n stk.append(i)\r\n else:\r\n stk.pop()\r\n if not stk:\r\n stk.append(i)\r\n else:\r\n l=i-stk[-1]\r\n if mx==l:\r\n cnt+=1\r\n elif mx<l:\r\n mx,cnt=l,1\r\n\r\nprint(mx,cnt)\r\n", "import sys\r\n\r\n\r\ndef longcorrectparsubstring(s):\r\n s = s.lstrip(\")\").rstrip(\"(\\n\")\r\n stack = [-1]\r\n top = [0, 1]\r\n for i in range(len(s)):\r\n if s[i] == \"(\":\r\n stack.append(i)\r\n else:\r\n if len(stack) != 1:\r\n stack.pop()\r\n l = i - stack[len(stack) - 1]\r\n if l > top[0]:\r\n top[0] = l\r\n top[1] = 1\r\n elif l == top[0]:\r\n top[1] += 1\r\n else:\r\n stack[0] = i\r\n return \" \".join(map(str, top))\r\n\r\n\r\ndef main():\r\n if len(sys.argv) == 3:\r\n if sys.argv[1] != \"--file\":\r\n print(\"usage: (--file filename) \| nothing\")\r\n strings = open(sys.argv[2]).readlines()\r\n for s in strings:\r\n print(longcorrectparsubstring(s))\r\n elif len(sys.argv) == 1:\r\n s = input()\r\n print(longcorrectparsubstring(s))\r\n else:\r\n print(\"usage: (--file filename) \| nothing\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "string=input()\r\nindex=[-1]\r\ncount=1\r\nma=0\r\nfor i in range(len(string)):\r\n #print(index)\r\n if(string[i]=='('):\r\n index.append(i)\r\n elif(len(index)>1):\r\n index.pop()\r\n n=i-index[-1]\r\n if(ma<n):\r\n ma=n\r\n count=1\r\n elif(ma==n):\r\n count+=1\r\n else:\r\n index[0]=i\r\nprint(str(ma),'',str(count))\r\n ", "count,start,maxi=1,[-1],0\r\nfor i,c in enumerate(input()):\r\n if c=='(': \r\n start.append(i)\r\n else:\r\n if len(start)>1:\r\n start.pop()\r\n if maxi<(i-start[-1]): maxi,count = i-start[-1],1\r\n elif maxi==(i-start[-1]): count+=1\r\n else: start[0]=i\r\nprint(maxi,count)", "count=1\r\nstack=[-1]\r\nstring=input()\r\nmx=0\r\nfor i in range(len(string)):\r\n if string[i]=='(':\r\n stack.append(i)\r\n elif len(stack)>1:\r\n stack.pop()\r\n n=i-stack[-1]\r\n if n>mx:\r\n mx=n\r\n count=1\r\n elif n==mx:\r\n count+=1\r\n else:\r\n stack[0]=i\r\nprint(mx,count)", "def main():\r\n #get the input string\r\n string = input()\r\n #here we will store the indexes of coresponding opening bracket on the position of closing bracket\r\n correspondingOpen = [-2]len(string)\r\n #here we will store the index of earliest opened parantesis which has a closign one\r\n earliestOpen = [-2]len(string)\r\n #in the stack we will store the opening parantesis until we will find a closing one\r\n stack = []\r\n #for each character in string\r\n for i in range(len(string)):\r\n #if it is an opening one\r\n if string[i] == '(':\r\n #put it in stack\r\n stack.append(i)\r\n #if it is a closing one\r\n if string[i] == ')':\r\n #and we don't have opened parantesis in the stack\r\n if len(stack) == 0:\r\n #then it does not correspond it looks like this ))() \r\n #so we have no corresponding opening parantesis\r\n correspondingOpen[i] = -1\r\n #and no parantesis to the left\r\n earliestOpen[i] = -1\r\n else:#the stack is not empty\r\n #remove the last parantesis from the stack because it corresponds to the opening parantesis of the current closing one\r\n correspondingOpen[i] = stack.pop()\r\n #if from the left we have a closing parantesis that has a opening one, then we have a whole correct sequence\r\n if correspondingOpen[i] - 1 >=0 and string[correspondingOpen[i] - 1] == ')' and earliestOpen[correspondingOpen[i] - 1] != -1:\r\n #the index of earliest open starts from the left\r\n earliestOpen[i] = earliestOpen[correspondingOpen[i] - 1]\r\n earliestOpen[correspondingOpen[i] - 1] = -2\r\n else:\r\n #if we dont have other correct index to the left, just leave the starting index as it was\r\n earliestOpen[i] = correspondingOpen[i]\r\n maxLength = 0\r\n countSequences = 0\r\n length=[]\r\n i = len(string)-1\r\n #go from the right to left\r\n while i >= 0:\r\n #if we find a sequence \r\n if earliestOpen[i] >= 0:\r\n #and it's length is greater than maxLength\r\n if (i - earliestOpen[i] + 1) > maxLength:\r\n #update maxLength\r\n maxLength = i - earliestOpen[i] + 1\r\n #store all lengths in a list\r\n length.append(i - earliestOpen[i] + 1)\r\n #jump with len(sequence) to the left, in order to avoid counting embrecated sequences\r\n i = earliestOpen[i]\r\n i -= 1\r\n #count the number of sequences with max length\r\n for i in range(len(length)):\r\n if maxLength == length[i]:\r\n countSequences += 1\r\n #problem condition\r\n if countSequences == 0:\r\n countSequences = 1\r\n print(maxLength,countSequences)\r\nmain()\r\n\r\n", "s = input()\n\nn = len(s)\nstack = []\ndp = [0 for i in range(0, n)]\nmax_size = 0\nmax_cnt = 0\nfor i in range(0, n):\n c = s[i]\n if c == '(':\n stack.append(i)\n else:\n if len(stack) > 0:\n prev = stack.pop()\n temp = dp[prev - 1] + i - prev + 1\n dp[i] = temp\n if temp > max_size:\n max_size = temp\n max_cnt = 1\n elif temp == max_size:\n max_cnt += 1\nif max_size == 0:\n print(\"0 1\")\nelse:\n print(max_size, max_cnt)", "exp=input()\r\nn=len(exp)\r\nPair=[-30](n+1)\r\nS=[0]n\r\ncnt=-1\r\nfor i in range(n):\r\n if exp[i]=='(':\r\n cnt+=1\r\n S[cnt]=i\r\n elif exp[i]==')':\r\n if cnt>=0:\r\n Pair[S[cnt]]=i\r\n cnt-=1\r\n\r\nMax=0\r\ncnt=1\r\nlast=-100\r\ni=0\r\nwhile i<n:\r\n tmp=Pair[i]-i+1\r\n if tmp>0:\r\n i+=tmp\r\n tmp=max(tmp,tmp+last)\r\n else:\r\n i+=1\r\n last=tmp\r\n if tmp>Max:\r\n Max=tmp\r\n cnt=1\r\n elif tmp==Max:\r\n cnt+=1\r\nprint(Max,cnt)", "# -- coding:utf-8 --\n\n\"\"\"\n\ncreated by shuangquan.huang at 1/6/20\n\n\"\"\"\n\nimport collections\nimport time\nimport os\nimport sys\nimport bisect\nimport heapq\nfrom typing import List\n\n\ndef solve(s):\n c = 0\n ans, tmp, count = 0, 0, 0\n for i, v in enumerate(s):\n if v == '(':\n c += 1\n else:\n c -= 1\n if c >= 0:\n tmp += 1\n else:\n if tmp > ans:\n ans = tmp\n count = 1\n elif tmp > 0 and tmp == ans:\n count += 1\n tmp = 0\n c = 0\n if c == 0:\n if tmp > ans:\n ans = tmp\n count = 1\n elif tmp > 0 and tmp == ans:\n count += 1\n \n return ans 2, max(count, 1)\n \n \n \ns = input()\na, b = solve(s)\nc, d = solve(['(' if v ==')' else ')' for v in s[::-1]])\nif a > c or (a == c and b >= d):\n print('{} {}'.format(a, b))\nelse:\n print('{} {}'.format(c, d))", "seq = input()\nst = []\ncurrentSize = 0\nmaxSize = 0\namount = 0\nfor c in seq:\n\tif c == \")\" and len(st)>0:\n\t\tcurrentSize += 2 + st.pop()\n\telse:\n\t\tif c == \"(\":\n\t\t\tst.append(currentSize)\n\t\tif currentSize>maxSize:\n\t\t\tmaxSize = currentSize\n\t\t\tamount = 1\n\t\telif currentSize==maxSize:\n\t\t\tamount += 1\n\t\tcurrentSize = 0\nif currentSize>maxSize:\n\tmaxSize = currentSize\n\tamount = 1\nelif currentSize==maxSize:\n\tamount += 1\nif maxSize == 0:\n\tamount = 1\nprint(maxSize,amount)", "s = input()\r\ndp = [0](len(s)+1)\r\n\r\nstack = []\r\nlength = 0\r\n\r\nfor i in range (0,len(s)):\r\n\r\n if s[i]=='(':\r\n stack.append(i)\r\n continue\r\n\r\n if len(stack)==0:\r\n continue\r\n\r\n j = stack[-1]\r\n stack.pop()\r\n\r\n if j>=1:\r\n prev = j-1\r\n\r\n else:\r\n prev = 0\r\n\r\n dp[i] = i-j+1 + dp[prev]\r\n \r\n \r\n if dp[i]> length:\r\n length = dp[i]\r\n count = 1\r\n\r\n elif dp[i]==length:\r\n count+=1\r\n\r\nif length==0:\r\n \r\n print(0,1)\r\nelse:\r\n print(length,count)\r\n\r\n", "a,b,s = 0,1,[-1]\nl = enumerate(input())\nfor i,c in l:\n if (c=='('): s.append(i)\n elif (len(s) > 1):\n s.pop()\n n = i - s[-1]\n if (a < n):\n a = n\n b = 1 \n elif (a == n): b += 1\n else: s[0] = i\nprint(a,b)", "from collections import deque\r\ns='#'+input()+'#'\r\nn=len(s)\r\ndp=[0]n\r\nq=deque()\r\nfor i in range(n-1):\r\n if s[i]=='(' and s[i+1]==')':\r\n q.append((2,i+1))\r\n dp[i+1]=2\r\nwhile q:\r\n le,ind=q.popleft()\r\n if s[ind-le]=='(' and s[ind+1]==')':\r\n q.appendleft((le+2,ind+1))\r\n dp[ind+1]=le+2\r\n dp[ind]=0\r\n else:\r\n if dp[ind-le]!=0:\r\n dp[ind]+=dp[ind-le]\r\n dp[ind-le]=0\r\n q.appendleft((dp[ind],ind))\r\nprint(max(dp),(dp.count(max(dp)),1)[max(dp)==0])\r\n", "s = input().strip()\n\nmax_string = 0\ntotal_max_strings = 0\nstack = [None]len(s)\narr = [None]len(s)\ntop = -1\n\nfor (index, bracket) in enumerate(s):\n if bracket == '(':\n top += 1\n if arr[index-1] != None:\n stack[top] = arr[index-1]\n else:\n stack[top] = index\n elif top > -1:\n temp_len = index - stack[top] + 1\n\n if max_string < temp_len:\n max_string = temp_len\n total_max_strings = 1\n elif max_string == temp_len:\n total_max_strings += 1\n\n arr[index] = stack[top]\n top -= 1\n\nprint(max_string, total_max_strings or 1)\n", "from sys import stdin,stdout\r\ninput = stdin.readline\r\n\r\ns = input()\r\ns = s[:-1]\r\nn = len(s)\r\n\r\nsubstring = [None for i in range(n)]\r\nending = [None for i in range(n)]\r\nfrequency = [0 for i in range(n+1)]\r\n\r\nstack = []\r\n\r\nfor index,character in enumerate(s):\r\n \r\n if(character == '('):\r\n stack.append(index)\r\n continue\r\n \r\n if(len(stack) == 0):\r\n continue\r\n \r\n ind = stack.pop()\r\n substring[index] = ind\r\n ending[index] = ind\r\n \r\n if(ind > 0):\r\n ind -= 1\r\n if(s[ind] == ')' and substring[ind] != None):\r\n ending[index] = ending[ind] \r\n\r\n # if(ending[index] != None):\r\n frequency[index - ending[index] + 1] += 1\r\n \r\nmx,cnt = 0,1\r\nfor index,freq in enumerate(frequency):\r\n if(freq > 0 and index > mx):\r\n mx,cnt = index,freq\r\n\r\nprint(mx,cnt)", "import sys\n\n\n\ndef magic():\n num_of_opened, indices_of_opened = 0, []\n for i, char in enumerate(input()):\n if char == '(':\n indices_of_opened.append(i)\n elif indices_of_opened:\n yield indices_of_opened.pop()\n yield i\n\ndef solve():\n group, prev = 0, 0\n maxgroup, maxgroupcount = 0, 0\n for index in sorted(magic()):\n sub = index - prev\n if sub == 1 or sub == index:\n group += 1\n elif group > 0:\n if maxgroup == group: maxgroupcount += 1\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n group = 1\n prev = index\n\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n elif maxgroup == group:\n maxgroupcount += 1\n\n return \"%s %s\" % (maxgroup, maxgroupcount)\n\n\nprint(solve())\n\n", "ch=input()\r\nl=[]\r\nl.append(-1)\r\na=0\r\nn=1\r\nm=0\r\nfor i in range(len(ch)):\r\n if(ch[i]==\"(\" ):\r\n l.append(i)\r\n elif(len(l)>1 ):\r\n l.pop()\r\n a=i-l[-1] \r\n if(a>m):\r\n n=1\r\n m=a\r\n elif(a==m):\r\n n+=1\r\n else:\r\n l[0]=i \r\nprint(m,n)\r\n\r\n", "a = input()\r\nn = len(a)\r\ndp =[0](n)\r\nstack =[]\r\n\r\nfor i in range(n):\r\n if a[i]=='(':\r\n stack.append(i)\r\n continue\r\n if not stack:\r\n continue\r\n\r\n j = stack.pop()\r\n dp[i]=i-j+1+(dp[j-1] if j>1 else 0)\r\nans =0\r\nlength = max(dp)\r\ncount = dp.count(length)\r\nif length==0:\r\n print(length,1)\r\nelse:\r\n print(length,count)\r\n", "def find_longest_regular_bracket_sequence(s):\r\n stack = []\r\n max_len = 0\r\n count = 0\r\n\r\n stack.append(-1)\r\n\r\n for i in range(len(s)):\r\n if s[i] == \"(\":\r\n stack.append(i)\r\n else:\r\n stack.pop()\r\n if stack:\r\n length = i - stack[-1]\r\n if length > max_len:\r\n max_len = length\r\n count = 1\r\n elif length == max_len:\r\n count += 1\r\n else:\r\n stack.append(i)\r\n\r\n if max_len == 0:\r\n return (0, 1)\r\n return (max_len, count)\r\n\r\ndef main():\r\n s = input()\r\n result = find_longest_regular_bracket_sequence(s)\r\n print(result[0], result[1])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n ", "# LUOGU_RID: 126002664\ndef find_longest_substring(brackets):\r\n stack = []\r\n max_length = 0\r\n count = 0\r\n\r\n for i, bracket in enumerate(brackets):\r\n if bracket == '(':\r\n stack.append(i)\r\n else:\r\n if stack and brackets[stack[-1]] == '(':\r\n stack.pop()\r\n length = i - (stack[-1] if stack else -1)\r\n if length > max_length:\r\n max_length = length\r\n count = 1\r\n elif length == max_length:\r\n count += 1\r\n else:\r\n stack.append(i)\r\n\r\n if count == 0:\r\n return \"0 1\"\r\n else:\r\n return f\"{max_length} {count}\"\r\n\r\n# Example usage\r\nbrackets = input()\r\nresult = find_longest_substring(brackets)\r\nprint(result)", "s=input()\r\nq=[]\r\ndp=[0](len(s)+1)\r\nMax=1\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i]==\"(\":\r\n q.append(i)\r\n else:\r\n if q:\r\n temp=q.pop()\r\n dp[i]=dp[temp-1]+i-temp+1\r\n Max=max(dp[i],Max)\r\nif Max==1:\r\n print(\"0 1\")\r\nelse:\r\n for i in range(len(dp)):\r\n if dp[i]==Max:\r\n c=c+1\r\n print(Max,c)", "s = input()\r\n\r\ncls = [0] * len(s)\r\next = [0] * len(s)\r\nfreq = [0] * (len(s) + 1)\r\nfreq[0] = 1\r\nmaxLen = 0\r\n\r\nstack = []\r\nfor i in range(len(s)):\r\n if s[i] == \"(\":\r\n stack.append(i)\r\n else:\r\n if not stack:\r\n cls[i] = ext[i] = -1\r\n else:\r\n ind = stack.pop()\r\n cls[i] = ext[i] = ind\r\n if ind > 0 and s[ind-1] == \")\" and cls[ind-1] != -1:\r\n ext[i] = ext[ind-1]\r\n l = i - ext[i] + 1\r\n freq[l] += 1\r\n maxLen = max(l, maxLen)\r\n\r\nprint(maxLen, freq[maxLen])", "string=input()\r\nl=len(string)\r\ns=[-1]l\r\ne=[-1]l\r\nF=[0](l+1)\r\nstack=[]\r\nmaxi=0\r\nfor i in range(l):\r\n if string[i]==\"(\":\r\n stack.append(i)\r\n else:\r\n if len(stack)!=0:\r\n last_index=stack.pop()\r\n if last_index ==0:\r\n e[i]=0\r\n F[i-e[i]+1]+=1\r\n maxi=max(maxi,i-e[i]+1)\r\n else:\r\n if e[last_index-1]!=-1:\r\n e[i]=e[last_index-1]\r\n F[i-e[i]+1]+=1\r\n maxi=max(maxi,i-e[i]+1)\r\n else:\r\n e[i]=last_index\r\n F[i-e[i]+1]+=1\r\n maxi=max(maxi,i-e[i]+1)\r\nif maxi==0:\r\n print(0,1)\r\nelse:\r\n print(maxi,F[maxi])\r\n", "l=[-1]\r\n#print(l)\r\nmaxi,count=0,0\r\nfor i,c in enumerate(input()):\r\n if c=='(':\r\n l.append(i)\r\n #print(\"After append:\",l)\r\n else:\r\n if len(l)>1:\r\n l.pop()\r\n var=i-l[-1]\r\n #print(\"Popping time:\",l,i,l[-1],var)\r\n if var>maxi:\r\n maxi=var\r\n count=1\r\n elif var==maxi:\r\n count+=1\r\n else:\r\n l[0]=i\r\n #print(\"In case:\",l,i)\r\nif maxi:\r\n print(maxi,count)\r\nelse:\r\n print(0,1)", "inp=input();\r\nst=[];\r\nd=[-1]len(inp);\r\nc=[-1]len(inp);\r\nfor i in range(len(inp)):\r\n if inp[i]=='(':\r\n st.append(i);\r\n else:\r\n if len(st)==0:\r\n d[i]=-1;\r\n c[i]=-1;\r\n else:\r\n d[i]=st.pop();\r\n c[i]=d[i];\r\n if inp[d[i]-1]==')' and c[d[i]-1]!=-1:\r\n c[i]=c[d[i]-1];\r\n\r\nmaxl=0;\r\nn=1;\r\nl=0;\r\nfor i in range(len(c)):\r\n if c[i]!=-1:\r\n l=i-c[i]+1;\r\n if l>maxl:\r\n maxl=l;\r\n n=1;\r\n elif l==maxl:\r\n n+=1;\r\n\r\nprint([maxl,n]);\r\n", "# Longest Regular Backet Sequencing\r\nfrom collections import deque\r\ndef main():\r\n st = deque()\r\n s = input()\r\n S = [-1 for i in range(len(s))]\r\n E = [-1 for i in range(len(s))]\r\n F = [0 for i in range(len(s)+1)]\r\n F[0] = 1\r\n ma = 0\r\n for i in range(len(s)):\r\n if(s[i] == \"(\"): \r\n st.append(i)\r\n else:\r\n if(len(st)==0):\r\n S[i] = E[i] = -1\r\n else:\r\n idx = st.pop()\r\n S[i] = E[i] = idx\r\n if(idx > 0 and s[idx - 1] == \")\" and S[idx - 1] >= 0):\r\n E[i] = E[idx-1]\r\n l = i - E[i] + 1\r\n F[l] += 1\r\n ma = max(ma,l)\r\n print(ma,F[ma])\r\nmain()", "s = input()\r\nst = list()\r\nc = 0\r\nx = 0\r\nmax = 0\r\nst.append(-1)\r\nfor i in range(len(s)):\r\n if s[i] == '(':\r\n st.append(i)\r\n else:\r\n st.pop()\r\n if st :\r\n c = i-st[-1]\r\n if c > max:\r\n max = c\r\n x = 1\r\n elif c >= 1 and c == max:\r\n x+=1\r\n else:\r\n st.append(i)\r\nif x >= 1:\r\n print(str(max)+' '+ str(x))\r\nelse:\r\n print('0 1')\r\n \r\n", "s = input()\nstack = []\nans = [0 for i in range(len(s))]\nfor i,l in enumerate(s):\n\tif l==\"(\": stack.append(i)\n\telif stack:\n\t\tp = stack.pop()\n\t\tans[i]=ans[p-1]+i-p+1\nprint(max(ans),ans.count(max(ans)) if max(ans)>0 else 1)\n", "# link: https://codeforces.com/problemset/problem/5/C\r\n\r\nsequence = input()\r\nn = len(sequence)\r\nstack = [-1]\r\nmax_length = 0\r\nsubstring_count = 1\r\nfor idx in range(n):\r\n if sequence[idx] == \"(\":\r\n stack.append(idx)\r\n elif len(stack) >= 2:\r\n stack.pop()\r\n temp_count = idx - stack[-1]\r\n if max_length < temp_count:\r\n max_length = temp_count\r\n substring_count = 1\r\n elif max_length == temp_count:\r\n substring_count += 1 \r\n else:\r\n stack[0] = idx\r\nprint(max_length, substring_count) ", "if __name__ == '__main__':\r\n \r\n string = input()\r\n longest = 0\r\n count = 1\r\n stack = [-1]\r\n \r\n for i in range(len(string)):\r\n if string[i]==\"(\":\r\n stack.append(i)\r\n \r\n else:\r\n stack.pop()\r\n \r\n if not stack:\r\n stack.append(i)\r\n else:\r\n if longest<i-stack[-1]:\r\n longest = i-stack[-1]\r\n count = 0\r\n if longest==i-stack[-1]:\r\n count+=1\r\n \r\n \r\n print(\"{} {}\".format(longest,count))\r\n ", "import sys\n\n\n\ndef magic():\n num_of_opened, i = 0, 0\n indices_of_opened = []\n for i, char in enumerate(input()):\n if char == '(':\n indices_of_opened.append(i)\n num_of_opened += 1\n elif num_of_opened > 0 and char == ')':\n num_of_opened -= 1\n yield indices_of_opened.pop()\n yield i\n i += 1\n\n\ndef solve():\n group, prev = 0, 0\n maxgroup, maxgroupcount = 0, 0\n for index in sorted(magic()):\n sub = index - prev\n if sub == 1 or sub == index:\n group += 1\n elif group > 0:\n if maxgroup == group: maxgroupcount += 1\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n group = 1\n prev = index\n\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n elif maxgroup == group:\n maxgroupcount += 1\n\n return \"%s %s\" % (maxgroup, maxgroupcount)\n\n\nprint(solve())\n\n", "import collections\r\n\r\nn = list(input())\r\nstack_b = [0]\r\nstack_pos = [0]\r\nlength = 0\r\nlenarray = [0]\r\ncounter = 0\r\n\r\nfor i in range(len(n)):\r\n if n[i] == \"(\":\r\n stack_b.append(i + 1)\r\n stack_pos.append(i + 1)\r\n else:\r\n if len(stack_b) > 1:\r\n stack_b.pop()\r\n stack_pos.pop()\r\n lenarray.append(i + 1 - stack_pos[-1])\r\n else:\r\n stack_pos.append(i + 1)\r\n\r\nprint(max(lenarray), collections.Counter(lenarray)[max(lenarray)])", "# https://codeforces.com/problemset/problem/5/C\n\nbs = str(input())\nres, count = 0, 0\nstack = []\ndp = [0]len(bs)\nfor i in range(len(bs)):\n if bs[i] == '(':\n stack.append(i)\n else:\n if len(stack) == 0:\n continue\n last_left_b = stack.pop()\n if last_left_b > 0:\n dp[i] = i - last_left_b + 1 +dp[last_left_b-1]\n else:\n dp[i] = i - last_left_b + 1\n if dp[i] > res:\n res = dp[i]\n count = 1\n elif dp[i] == res:\n count += 1\nif res == 0:\n print('0 1')\nelse:\n print(res, count)\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef sparse_table(a):\r\n table = []\r\n s0, l = a, 1\r\n table.append(s0)\r\n while 2 l <= len(a):\r\n s = [min(s0[i], s0[i + l]) for i in range(len(s0) - l)]\r\n table.append(list(s))\r\n s0 = s\r\n l = 2\r\n return table\r\n\r\ndef get_min(l, r, table):\r\n d = (r - l + 1).bit_length() - 1\r\n d = len(bin(r - l + 1)) - 3\r\n ans = min(table[d][l], table[d][r - pow2[d] + 1])\r\n return ans\r\n\r\ns = list(input().rstrip())\r\nx = [0]\r\nfor i in s:\r\n if not i & 1:\r\n x.append(x[-1] + 1)\r\n else:\r\n x.append(x[-1] - 1)\r\nmi = min(x)\r\nn = len(x)\r\nfor i in range(n):\r\n x[i] -= mi\r\nm = max(x)\r\ns = [0] (m + 3)\r\nfor i in x:\r\n s[i + 2] += 1\r\nfor i in range(1, m + 3):\r\n s[i] += s[i - 1]\r\ny = [0] * n\r\nfor i in range(n):\r\n j = x[i] + 1\r\n y[s[j]] = i\r\n s[j] += 1\r\npow2 = [1]\r\nfor _ in range(22):\r\n pow2.append(2 * pow2[-1])\r\ntable = sparse_table(x)\r\nm, c = 0, 1\r\ninf = pow(10, 9) + 1\r\nl, r = y[0], y[0]\r\nfor i in range(n - 1):\r\n u, v = y[i], y[i + 1]\r\n xu, xv = x[u], x[v]\r\n if xu ^ xv or get_min(u, v, table) < xu:\r\n if m < r - l:\r\n m, c = r - l, 0\r\n if m == r - l:\r\n c += 1\r\n l, r = v, v\r\n continue\r\n r = v\r\nif m < r - l:\r\n m, c = r - l, 0\r\nif m == r - l:\r\n c += 1\r\nif not m:\r\n c = 1\r\nprint(m, c)", "'''\r\nJana Goodman\r\n\r\n5c longest reg bracket sequence\r\n\r\n'''\r\nimport sys\r\n\r\nclass Stack:\r\n def __init__(self):\r\n self.stack = list()\r\n self.len = 0\r\n\r\n def is_empty(self):\r\n return self.len == 0\r\n\r\n def top(self):\r\n if self.is_empty():\r\n return None\r\n return self.stack[-1]\r\n\r\n def push(self, elt):\r\n self.stack.append(elt)\r\n self.len += 1\r\n\r\n def pop(self):\r\n if self.is_empty():\r\n return None\r\n self.len -= 1\r\n return self.stack.pop(-1)\r\n\r\n def clear(self):\r\n self.stack = list()\r\n self.len = 0\r\n\r\n def replace(self, pos, elt):\r\n self.stack[pos] = elt\r\n\r\n def __repr__(self):\r\n return f'Stack: {self.stack}'\r\n\r\nCLOSE = ')'\r\nOPEN = '('\r\n\r\ndef max_regular(s):\r\n max_len, num_maxes, reg_len = 0, 0, None\r\n good_start = -1\r\n stack = Stack()\r\n for i, p in enumerate(s):\r\n if p == OPEN:\r\n stack.push(i)\r\n elif p == CLOSE:\r\n if stack.is_empty():\r\n good_start = i\r\n else:\r\n stack.pop()\r\n if stack.is_empty():\r\n reg_len = i - good_start\r\n else:\r\n reg_len = i - stack.top()\r\n if max_len < reg_len:\r\n max_len, num_maxes = reg_len, 1\r\n elif max_len == reg_len:\r\n num_maxes += 1\r\n\r\n return max_len, num_maxes\r\n\r\nif __name__ == '__main__':\r\n seq = input().strip()\r\n max_len, num_maxes = max_regular(seq)\r\n if max_len == 0:\r\n num_maxes = 1\r\n print(f'{max_len} {num_maxes}')\r\n", "'''input\n()))()(())\n'''\ns = input().lstrip(')')\nmax_len = 0\nnum_max = 1\ncount = 0\nstart_pos = {}\n\nfor i, c in enumerate(s):\n if c == '(':\n count += 1\n if count not in start_pos:\n start_pos[count] = i\n else:\n count -= 1\n if count < 0:\n count = 0\n start_pos = {}\n if count + 2 in start_pos:\n del start_pos[count + 2]\n if count + 1 in start_pos:\n l = i - start_pos[count + 1] + 1\n if l > max_len:\n max_len = l\n num_max = 1\n # print(i, start_pos[count + 1])\n elif l == max_len:\n num_max += 1\n\nprint(max_len, num_max)\n", "def main():\n m = cnt = 1\n stack = [1]\n for c in input():\n if c == '(':\n stack.append(1)\n else:\n if len(stack) < 2:\n stack[0] = 1\n else:\n x = stack.pop() + stack.pop() + 1\n if m < x:\n m, cnt = x, 1\n elif m == x:\n cnt += 1\n stack.append(x)\n print(m - 1, cnt)\n\n\nif __name__ == '__main__':\n main()\n", "from collections import defaultdict\r\ns = [0] + list(input())\r\nn = len(s)\r\ndp = [0] * n\r\ng = defaultdict(int)\r\nfor i in range(1, n):\r\n if s[i] == ')':\r\n if s[i - 1] == '(':\r\n if i - 2 >= 0:\r\n dp[i] = dp[i - 2] + 2\r\n else:\r\n if i - dp[i - 1] + 1 >= 0 and s[i - dp[i - 1] - 1] == '(':\r\n if i - dp[i - 1] - 2 >= 0:\r\n dp[i] += dp[i - dp[i - 1] - 2] + 2 + dp[i - 1]\r\n g[dp[i]] += 1\r\nans_k, ans_v = -1, -1\r\nfor k, v in g.items():\r\n if k > ans_k:\r\n ans_k = k\r\n ans_v = v\r\nif ans_k <= 0:\r\n print(0, 1)\r\nelse:\r\n print(ans_k, ans_v)", "def solve():\r\n s = input()\r\n n = len(s)\r\n \r\n l, r, maxLen, cnt, maxCnt = 0, 0, 0, 0, 0\r\n for i in range(n):\r\n if s[i] == '(':\r\n l += 1\r\n else:\r\n r += 1\r\n if l == r:\r\n if 2 * r > maxLen:\r\n maxLen = 2 * r\r\n cnt = 1\r\n elif 2 * r == maxLen:\r\n cnt += 1\r\n elif r > l:\r\n l, r = 0, 0\r\n maxCnt = max(maxCnt, cnt)\r\n l, r, cnt = 0, 0, 0\r\n for i in range(n-1, -1, -1):\r\n if s[i] == '(':\r\n l += 1\r\n else:\r\n r += 1\r\n \r\n if l == r:\r\n if 2 * l > maxLen:\r\n maxLen = 2 * l\r\n cnt = 1\r\n elif 2 * l == maxLen:\r\n cnt += 1\r\n elif l > r:\r\n l, r = 0, 0\r\n\r\n maxCnt = max(maxCnt, cnt)\r\n\r\n if maxLen != 0:\r\n print(str(maxLen) + ' '+ str(maxCnt))\r\n else:\r\n print('0 1')\r\nif __name__ == \"__main__\":\r\n solve()", "def solution():\r\n brackets = list(input())\r\n open_position_by_tally = {0: -1} # tally count -> last_opened candidate\r\n tally = 0\r\n max_length = 0\r\n max_count = 0\r\n for idx, b in enumerate(brackets):\r\n if b == '(':\r\n tally += 1\r\n if tally not in open_position_by_tally:\r\n open_position_by_tally[tally] = idx\r\n else:\r\n tally -= 1\r\n if tally not in open_position_by_tally:\r\n open_position_by_tally[tally] = idx\r\n else:\r\n length = idx - open_position_by_tally[tally]\r\n if length == max_length:\r\n max_count += 1\r\n elif length > max_length:\r\n max_length = length\r\n max_count = 1\r\n if tally + 1 in open_position_by_tally:\r\n del open_position_by_tally[tally + 1]\r\n\r\n if max_length == 0:\r\n print(0, 1)\r\n else:\r\n print(max_length, max_count)\r\n\r\n\r\nsolution()", "string = input()\r\nst = list()\r\nmx = occ = 0\r\n\r\nscores = [1] * len(string) + [0]\r\n\r\nfor idx, c in enumerate(string):\r\n if len(st) == 0:\r\n st.append(idx)\r\n elif string[st[-1]] == '(' and c == ')':\r\n popped = st.pop()\r\n scores[idx + 1] += scores[idx] + scores[popped]\r\n combined = scores[idx] + scores[popped]\r\n if combined > mx:\r\n mx = combined\r\n occ = 1\r\n elif combined == mx:\r\n occ += 1\r\n else:\r\n st.append(idx)\r\n\r\nif mx == 0:\r\n print(mx, 1)\r\nelse:\r\n print(mx, occ)\r\n", "string=input()\r\ndef main(string):\r\n\tst=[]\r\n\tanswer=[False](len(string)+1)\r\n\tfor i in range(0,len(string)):\r\n\t\tif string[i]==\"(\":\r\n\t\t\tst.append(i)\r\n\t\telse:\r\n\t\t\tif not st:\r\n\t\t\t\tcontinue\r\n\t\t\tanswer[st.pop()] = True\r\n\t\t\tanswer[i] = True\r\n\tres = []\r\n\tmx = 0\r\n\tfor i in range(0,len(answer)):\r\n\t\tif answer[i]==False:\r\n\t\t\tres.append(mx)\r\n\t\t\tmx=0\r\n\t\t\tcontinue\r\n\t\tmx+=1\r\n\r\n\tmx = max(res)\r\n\tif mx==0:\r\n\t\tprint(0, 1)\r\n\telse:\r\n\t\tprint(mx, res.count(mx))\r\nmain(string)", "init_brackets = tuple(input())\r\n\r\nstack_id = [-1]\r\nresult = {0: 1}\r\n\r\nfor i, bracket in enumerate(init_brackets):\r\n if bracket == '(':\r\n stack_id.append(i)\r\n else:\r\n stack_id.pop()\r\n if stack_id:\r\n res = i - stack_id[-1]\r\n result[res] = result.get(res, 0) + 1\r\n else:\r\n stack_id.append(i)\r\n \r\nmax_res = max(result)\r\nprint(max_res, result[max_res])\r\n\t\t\t\t\t\t \t\t\t\t\t\t \t\t \t\t\t \t \t \t", "import collections\r\n\r\ns = input()\r\n\r\nM = 10 * 6 + 5\r\n\r\ndp = [0] * M\r\n\r\nstack = collections.deque()\r\n\r\nmaxLen = 0\r\ncnt = 0\r\n\r\nfor i, c in enumerate(s):\r\n if c == \")\":\r\n if 0 == len(stack): continue\r\n tmp = stack.pop()\r\n if tmp:\r\n dp[i] = dp[tmp - 1] + i - tmp + 1\r\n else:\r\n dp[i] = i + 1\r\n if dp[i] > maxLen:\r\n maxLen = dp[i]\r\n cnt = 1\r\n elif dp[i] == maxLen:\r\n cnt += 1\r\n else:\r\n stack.append(i)\r\nif not maxLen:\r\n cnt = 1\r\nprint(maxLen, end = \" \")\r\nprint(cnt)", "sa=input()\r\nw,c,b,l=0,1,-1,[]\r\nfor i in range(len(sa)):\r\n if sa[i]=='(':l.append(i)\r\n elif l:\r\n l.pop()\r\n t=i-l[-1] if l else i-b\r\n if t>w: w,c=t,1\r\n elif t==w: c+=1\r\n else:b=i\r\nprint(w,c)", "seq = input()\r\nst = []\r\ncurrentSize = 0\r\nmaxSize = 0\r\namount = 0\r\nfor c in seq:\r\n if c == \")\" and len(st)>0:\r\n currentSize += 2 + st.pop()\r\n else:\r\n if c == \"(\":\r\n st.append(currentSize)\r\n if currentSize>maxSize:\r\n maxSize = currentSize\r\n amount = 1\r\n elif currentSize==maxSize:\r\n amount += 1\r\n currentSize = 0\r\nif currentSize>maxSize:\r\n maxSize = currentSize\r\n amount = 1\r\nelif currentSize==maxSize:\r\n amount += 1\r\nif maxSize == 0:\r\n amount = 1\r\nprint(maxSize,amount)", "\r\ns = input()\r\n\r\nl_idx = list()\r\ndp = [0] * len(s)\r\n\r\nmax_v = 0\r\nfor i in range(len(s)):\r\n #print(i, l_idx)\r\n if s[i] == '(':\r\n l_idx.append(i)\r\n else:\r\n now = 0\r\n if len(l_idx) > 0:\r\n now = 2\r\n if l_idx[-1] > 0:\r\n now += dp[l_idx[-1]-1]\r\n if i > 0:\r\n now += dp[i-1]\r\n l_idx.pop()\r\n dp[i] = now\r\n max_v = max(now, max_v)\r\n\r\n#print(dp)\r\nif max_v == 0:\r\n print(0, 1)\r\nelse:\r\n num = dp.count(max_v)\r\n print(max_v, num)", "# import sys\r\n# sys.stdout=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\output.txt','w')\r\n# sys.stdin=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\input.txt','r')\r\n\r\n\r\nimport heapq\r\nimport math\r\nimport collections\r\nimport bisect\r\nmod=10*9+7\r\ndef solve(s):\r\n n=len(s)\r\n su=0\r\n st=set()\r\n left=0\r\n right=n-1\r\n maxi=0\r\n count=0\r\n for i in range(n):\r\n su+=(s[i]==\"(\")\r\n su-=(s[i]==\")\")\r\n if su<0:\r\n su=0\r\n left=i+1\r\n if su==0:\r\n if maxi<i-left+1:\r\n maxi=i-left+1\r\n count=1\r\n elif maxi==i-left+1:\r\n count+=1\r\n st.add((left,i))\r\n\r\n su=0\r\n for i in range(n-1,-1,-1):\r\n su+=(s[i]==\")\")\r\n su-=(s[i]==\"(\")\r\n if su<0:\r\n su=0\r\n right=i-1\r\n if su==0:\r\n # print(i,right)\r\n if (i,right) in st:\r\n continue\r\n if maxi<right-i+1:\r\n maxi=right-i+1\r\n count=1\r\n elif maxi==right-i+1:\r\n count+=1 \r\n if maxi: return str(maxi)+\" \"+str(count)\r\n return str(0)+\" \"+\"1\"\r\n \r\n\r\n \r\n\r\n\r\n# t=int(input())\r\n# for _ in range(t):\r\n# n=int(input()) \r\ns=input()\r\nprint(solve(s))", "E = [0](1000001)\r\nS = [0](1000001)\r\nf = [0](1000001)\r\ns = input()\r\nstack = []\r\nn = len(s)\r\nmx = 0\r\nfor i in range(n):\r\n if s[i] == '(':\r\n stack.append(i)\r\n else:\r\n if stack == []:\r\n S[i] = -1\r\n E[i] = -1\r\n else:\r\n j = stack.pop()\r\n S[i] = E[i] = j\r\n if (j>0 and s[j-1] == ')'and S[j-1]>=0):\r\n E[i] = E[j-1]\r\n l = i-E[i]+1\r\n f[l] = f[l]+1\r\n mx = max(mx,l)\r\nf[0] = 1\r\nprint(mx,end=\" \")\r\nprint(f[mx])\r\n ", "from collections import defaultdict\r\n\r\ns = list(input())\r\ncnt = 0\r\ng = defaultdict(int)\r\nlast = 0\r\nfor i, ch in enumerate(s):\r\n if ch == '(':\r\n cnt += 1\r\n else:\r\n cnt -= 1\r\n if cnt < 0:\r\n cnt = 0\r\n last = i\r\n elif cnt == 0:\r\n g[i - last] += 1\r\nans_k, ans_v = -1, -1\r\nfor k, v in g.items():\r\n if k > ans_k:\r\n ans_k = k\r\n ans_v = v\r\ng.clear()\r\ncnt, last = 0, len(s)\r\nfor i in range(len(s) - 1, -1, -1):\r\n if s[i] == ')':\r\n cnt += 1\r\n else:\r\n cnt -= 1\r\n if cnt < 0:\r\n cnt = 0\r\n last = i\r\n elif cnt == 0:\r\n g[last - i] += 1\r\nfor k, v in g.items():\r\n if k > ans_k:\r\n ans_k = k\r\n ans_v = v\r\nif ans_k == -1:\r\n print(0, 1)\r\nelse:\r\n print(ans_k, ans_v)", "s = input()\r\nst = []\r\na = 0 \r\nb = 0\r\nc = 0\r\nm = 0\r\nn = 0\r\n#print(s[82:])\r\nfor i in range(len(s)):\r\n if s[i]=='(':\r\n st.append(i)\r\n elif s[i]==')':\r\n if st:\r\n st.pop()\r\n if st == []:\r\n if c!=b:\r\n a = c\r\n b = i + 1\r\n c = i + 1\r\n if i - a + 1 > m:\r\n m = i - a + 1\r\n n = 1\r\n elif i - a + 1 == m:\r\n n+=1\r\n else:\r\n c = i + 1\r\n #print(a,b)\r\nz = len(s)\r\nwhile st :\r\n c = st.pop()\r\n #print(c)\r\n if z - c - 1 > m:\r\n m = z - c - 1\r\n n = 1\r\n elif z - c - 1 == m:\r\n n+=1\r\n z = c\r\nif m == 0:\r\n n = 1\r\nprint(m,n)\r\n ", "st = []\r\ns = input()\r\ndp = [0] * (len(s) + 1)\r\nfor i, c in enumerate(s, 1):\r\n if c == '(':\r\n st.append(i)\r\n elif len(st):\r\n j = st.pop()\r\n dp[i] = dp[j - 1] + i - j + 1\r\nres = max(dp)\r\nif res == 0:\r\n count = 1\r\nelse:\r\n count = dp.count(res)\r\nprint(res, count)", "s = input()\r\nn = len(s)\r\nss = []\r\nc = [-1 for j in range(n)]\r\nd = [-1 for k in range(n)]\r\nmlen = 0\r\ncnt = 0\r\nf={0:1}\r\nfor i in range(n):\r\n if s[i] =='(':\r\n ss.append(i)\r\n if ss!=[] and s[i] ==')':\r\n c[i] = ss.pop()\r\n d[i] = c[i] \r\n if s[d[i]-1]==')' and c[d[i]-1]!=-1:\r\n c[i] = c[d[i]-1]\r\n \r\nfor i in range(len(c)):\r\n if c[i]!=-1:\r\n c[i]=i-c[i]+1\r\nmx = max(c)\r\nif mx == -1:\r\n print(mlen,f[mlen])\r\nelse:\r\n print(mx,c.count(mx))", "def longest_regular_substring(s):\n stack = []\n max_len = 0\n count = 1\n start = 0\n for i, c in enumerate(s):\n if c == '(':\n stack.append(i)\n else:\n if stack:\n stack.pop()\n if stack:\n length = i - stack[-1]\n else:\n length = i - start + 1\n if length > max_len:\n max_len = length\n count = 1\n elif length == max_len:\n count += 1\n else:\n start = i + 1\n return max_len, count\n\ns = input()\nprint(longest_regular_substring(s))\n\n\t \t \t \t \t\t\t \t\t\t\t\t \t\t\t \t\t \t", "s = input()\r\nstack = []\r\ndp = [[-1, -1] for _ in range(len(s))]\r\n# dp[i][0] = earliest index of s[i] such that [dp[i][0], i] is a valid substring\r\n# dp[i][1] = corresponding open bracket\r\n\r\nfor i in range(len(s)):\r\n if s[i] == \"(\":\r\n stack.append(i)\r\n elif s[i] == \")\":\r\n if len(stack) == 0:\r\n continue\r\n j = stack.pop()\r\n dp[i][1] = j\r\n if s[j-1] == \")\" and dp[j-1][0] != -1:\r\n dp[i][0] = dp[j-1][0]\r\n else:\r\n dp[i][0] = j\r\nmax_len = 0\r\nfor i in range(len(s)):\r\n if dp[i][0] == -1:\r\n continue\r\n if i - dp[i][0] + 1 > max_len:\r\n max_len = i - dp[i][0] + 1\r\nnum_substrings = 0\r\nfor i in range(len(s)):\r\n if dp[i][0] == -1:\r\n continue\r\n if i - dp[i][0] + 1 == max_len:\r\n num_substrings += 1\r\nif max_len == 0:\r\n num_substrings = 1\r\nprint(max_len, num_substrings)", "if __name__ == \"__main__\":\n\ttmp = str(input())\n\tlocal_start = None\n\tlocal_max = 0\n\thow_many = 1\n\tlst = [-1]\n\tfor i in range(len(tmp)):\n\t\t\n\t\tif tmp[i]==\"(\":\n\n\t\t\tlst.append(i)\n\t\telif len(lst)>1:\n\t\t\tx = lst.pop()\n\t\t\tqq = i -lst[-1]\n\n\t\t\tif qq==local_max:\n\t\t\t\thow_many+=1\n\t\t\telif qq>=local_max:\n\t\t\t\tlocal_max=qq\n\t\t\t\thow_many=1\n\t\telse:\n\t\t\tlst[0]=i\n\t\n\t\t\n\t\t\t\n\tprint(local_max,how_many)\n", "def longestValidParentheses(s):\r\n if len(s) < 2:\r\n return 0\r\n tans = 0\r\n st = []\r\n cans = 0\r\n mn = float(\"inf\")\r\n dp = [0] len(s)\r\n for ind, i in enumerate(s):\r\n if i == \"(\":\r\n st.append(ind)\r\n if i == \")\":\r\n if st:\r\n id = st.pop()\r\n if id - 1 >= 0 and ind - 1 >= 0:\r\n dp[ind] = dp[id - 1] + dp[ind - 1] + 2\r\n elif id - 1 < 0:\r\n dp[ind] = dp[ind - 1] + 2\r\n mx=max(dp)\r\n if mx==0:\r\n print(0,1)\r\n else:\r\n print(mx,dp.count(mx))\r\n\r\nlongestValidParentheses(input())\r\n", "# import sys\r\n# sys.stdout=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\output.txt','w')\r\n# sys.stdin=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\input.txt','r')\r\n\r\n\r\nimport heapq\r\nimport math\r\nimport collections\r\nimport bisect\r\nmod=10*9+7\r\ndef solve(s):\r\n n=len(s)\r\n dp=[0]n\r\n st=[]\r\n maxi=0\r\n count=0\r\n for i in range(n):\r\n if s[i]==\"(\":\r\n st.append(i)\r\n continue\r\n elif not st:\r\n continue\r\n else:\r\n j=st.pop()\r\n dp[i]=i-j+1+dp[j-1]\r\n if maxi<dp[i]:\r\n maxi=dp[i]\r\n count=1\r\n elif maxi==dp[i]:\r\n count+=1\r\n if maxi: return str(maxi)+\" \"+str(count)\r\n return str(0)+\" \"+\"1\"\r\n \r\n\r\n \r\n\r\n\r\n# t=int(input())\r\n# for _ in range(t):\r\n# n=int(input()) \r\ns=input()\r\nprint(solve(s))", "s=input()\nstack=[]\nhigh_length=0\nss_count=1\nfor i in range(0,len(s)):\n\tif(s[i]=='('):\n\t\tstack.append(i)\n\telse:\n\t\tif(stack!=[] and s[stack[-1]]=='('):\n\t\t\tstack.pop()\n\t\t\tif(stack!=[]):length=i-stack[-1]\n\t\t\telse:length=i+1\n\t\t\tif(high_length<length):\n\t\t\t\thigh_length=length\n\t\t\t\tss_count=1\n\t\t\telif(high_length==length):\n\t\t\t\tss_count+=1\n\t\telse:\n\t\t\tstack.append(i)\nprint(high_length,ss_count)\n\t\t\t\t\n\t\n\t\n\n", "from collections import defaultdict\r\n# import threading\r\n# import sys\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(108)\r\n# sys.setrecursionlimit(106)\r\n\r\n\r\ndef main():\r\n # sol first code later dorime\r\n s = list(rs())\r\n n = len(s)\r\n dp = [0]n\r\n st = []\r\n for idx, i in enumerate(s):\r\n if i == '(':\r\n st.append(idx)\r\n else:\r\n if st:\r\n b = st.pop()\r\n dp[idx] = dp[b-1]+(idx-b+1)\r\n mx = max(dp)\r\n if mx == 0:\r\n print(0, 1)\r\n else:\r\n print(mx, dp.count(mx))\r\n pass\r\n\r\n\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "import math\r\nimport heapq\r\nimport bisect\r\nimport functools\r\nimport itertools\r\nimport collections\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom typing import List\r\n\r\nMOD0 = 10 * 9 + 7\r\nMOD1 = 998244353\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\nread_str = lambda: input().strip()\r\nread_int = lambda: int(input())\r\nread_ints = lambda: map(int, input().split())\r\nread_list_ints = lambda: list(map(int, input().split()))\r\nread_list_strs = lambda: input().strip().split()\r\n\r\n\r\ndef solve():\r\n s, ans1, ans2, rec = read_str(), 0, 0, collections.defaultdict(list)\r\n\r\n n = len(s)\r\n pre = [0] * (n + 1)\r\n for i, c in enumerate(s):\r\n if c == '(':\r\n pre[i + 1] = pre[i] + 1\r\n rec[pre[i]].append(i)\r\n else:\r\n pre[i + 1] = pre[i] - 1\r\n\r\n left, st = [-1] * (n + 1), []\r\n for i in range(n, -1, -1):\r\n while st and st[-1][0] > pre[i]:\r\n left[st.pop()[1]] = i\r\n st.append((pre[i], i))\r\n\r\n for i in range(1, n):\r\n if s[i] == ')':\r\n i += 1\r\n idx = bisect.bisect_right(rec[pre[i]], left[i])\r\n if idx < len(rec[pre[i]]):\r\n tmp = i - rec[pre[i]][idx]\r\n if tmp > ans1:\r\n ans1 = tmp\r\n ans2 = 1\r\n elif tmp == ans1:\r\n ans2 += 1\r\n\r\n if ans1:\r\n print(ans1, ans2)\r\n else:\r\n print(0, 1)\r\n\r\n\r\nsolve()", "s=input()\r\nstr=[-1]\r\ntot=1\r\nans=0\r\nfor i in range(len(s)):\r\n if s[i]=='(':\r\n str.append(i)\r\n else:\r\n str.pop()\r\n if len(str)>0:\r\n res=i-str[-1]\r\n if res>ans:\r\n ans=res\r\n tot=1\r\n elif res==ans:\r\n tot+=1\r\n else:\r\n str.append(i)\r\nprint(ans,tot)\r\n \t\t ", "from sys import stdin\r\n# input=stdin.buffer.readline\r\ninput=lambda : stdin.readline().strip()\r\nlin=lambda :list(map(int,input().split()))\r\niin=lambda :int(input())\r\nmain=lambda :map(int,input().split())\r\nfrom math import ceil,sqrt,factorial,log\r\nfrom collections import deque\r\nfrom bisect import bisect_left\r\nmod=998244353\r\nmod=1000000007\r\ndef gcd(a,b):\r\n\ta,b=max(a,b),min(a,b)\r\n\twhile a%b!=0:\r\n\t\ta,b=b,a%b\r\n\treturn b\r\ndef moduloinverse(a):\r\n\treturn(pow(a,mod-2,mod))\r\ndef solve(we):\r\n\ts=input()\r\n\td={}\r\n\tini=0\r\n\tz=0\r\n\tl=set()\r\n\tn=len(s)-1\r\n\tfor i in range(len(s)):\r\n\t\tif s[i]=='(':\r\n\t\t\tz+=1\r\n\t\telse:\r\n\t\t\tz-=1\r\n\t\tif z==0:\r\n\t\t\tl.add((min(i,ini),max(i,ini)))\r\n\t\telif z<0:\r\n\t\t\tz=0\r\n\t\t\tini=i+1\r\n\tif z==0 and ini<=n:\r\n\t\tl.add((min(n,ini),max(n,ini)))\r\n\tini=len(s)-1\r\n\tz=0\r\n\tfor i in range(len(s)-1,-1,-1):\r\n\t\tif s[i]=='(':\r\n\t\t\tz+=1\r\n\t\telse:\r\n\t\t\tz-=1\r\n\t\tif z==0:\r\n\t\t\tl.add((min(i,ini),max(i,ini)))\r\n\t\telif z>0:\r\n\t\t\tz=0\r\n\t\t\tini=i-1\r\n\tif z==0 and ini>=0:\r\n\t\tl.add((min(0,ini),max(0,ini)))\r\n\t# print(l)\r\n\tma=0\r\n\td[0]=1\r\n\tfor i in l:\r\n\t\tt=i[1]-i[0]+1\r\n\t\tif t not in d:\r\n\t\t\td[t]=0\r\n\t\td[t]+=1\r\n\t\tma=max(ma,t)\r\n\tprint(ma,d[ma])\t\r\n\r\nqwe=1\r\n# qwe=iin()\r\nfor _ in range(qwe):\r\n\tsolve(_+1)", "def get_result(string):\r\n brackets = [0] * len(string)\r\n stack = []\r\n for i, s in enumerate(string):\r\n if s == '(':\r\n stack.append(i)\r\n else:\r\n if stack:\r\n brackets[stack.pop()] = 1\r\n brackets[i] = 1\r\n max_len = 0\r\n count = 0\r\n cur_chain = 0\r\n\r\n for i, bracket in enumerate(brackets):\r\n if not bracket and cur_chain:\r\n if cur_chain > max_len:\r\n max_len = cur_chain\r\n count = 1\r\n elif cur_chain == max_len:\r\n count += 1\r\n\r\n cur_chain = 0\r\n else:\r\n cur_chain += bracket\r\n\r\n if cur_chain > max_len:\r\n return cur_chain, 1\r\n elif cur_chain == max_len:\r\n count += 1\r\n return max_len, count\r\n\r\n\r\nif __name__ == \"__main__\":\r\n import sys\r\n\r\n line = next(sys.stdin).strip()\r\n\r\n max_len, count = get_result(line)[:2]\r\n print(f'{max_len} {count or 1}')\r\n", "s = input()\r\ndp, m, c, mx = [0], {0:-1}, 0, 0\r\nfor i in range(len(s)):\r\n if s[i] == '(':\r\n dp.append(0)\r\n c += 1\r\n else:\r\n c -= 1\r\n j = m.get(c, -2)\r\n if j == -2:\r\n dp.append(0)\r\n else:\r\n dp.append(dp[j + 1] + i - j)\r\n mx = max(mx, dp[-1])\r\n m[c] = i\r\nprint([mx, dp.count(mx)] if mx else \"01\")", "from collections import deque\r\ndef solve(st):\r\n stack = deque()\r\n mx = 0\r\n for i in range(len(st)):\r\n if st[i] == \"(\":\r\n stack.append(i)\r\n else:\r\n if len(stack) == 0:\r\n S[i] = -1\r\n E[i] = -1\r\n else:\r\n ri = stack.pop()\r\n S[i] = ri\r\n E[i] = ri\r\n if ri > 0 and st[ri-1] == \")\" and S[ri-1] >= 0:\r\n E[i] = E[ri-1]\r\n l = i-E[i]+1\r\n F[l] += 1\r\n mx = max(mx, l)\r\n F[0] = 1\r\n print(mx, F[mx])\r\n\r\n\r\nmax_l = 1000001\r\nF = [0 for i in range(max_l)]\r\nS = [0 for i in range(max_l)]\r\nE = [0 for i in range(max_l)]\r\ns = input()\r\nsolve(s)", "################################################################################\r\nbracket=input()\r\n\r\n# bracket=')((())))(()())'\r\n# bracket='))('\r\n# bracket='()(())()'\r\n# bracket='((((()((('\r\n################################################################################\r\nn=len(bracket)\r\n\r\nregular=[0 for i in range(n)]\r\nstack=[]\r\nfor i,s in enumerate(bracket):\r\n if s=='(':\r\n stack.append(i)\r\n else:\r\n if len(stack)>0:\r\n regular[i]=1\r\n j=stack.pop()\r\n regular[j]=1\r\n\r\nlongs=[0 for i in range(n)]\r\nlong=0\r\nfor i,r in enumerate(regular):\r\n if r:\r\n long+=1\r\n longs[i]=long\r\n else:\r\n long=0\r\n\r\nmax_regular=max(longs)\r\nif max_regular==0:\r\n print('0 1')\r\nelse:\r\n out=str(max_regular)+' '+str(longs.count(max_regular))\r\n print(out)\r\n", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import \r\nimport sys\r\nmod = 1000000007\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\ns = st()\r\nn = len(s)\r\nvalid = [-1]n\r\nfreq = [0](n+1)\r\nstack = []\r\nfor i in range(n):\r\n if s[i] == ')':\r\n if stack:\r\n last = stack.pop()\r\n if last - 1 >= 0 and valid[last-1] != -1:\r\n last = valid[last-1]\r\n valid[i] = last\r\n now = i - last + 1\r\n freq[now] += 1\r\n else:\r\n stack.append(i)\r\ng = 0\r\nfor i in range(n, 0, -1):\r\n if freq[i] > 0:\r\n print(i, freq[i])\r\n g = 1\r\n break\r\nif g == 0:\r\n print(0, 1)\r\n", "# LUOGU_RID: 101907434\ns = input()\r\nt = []\r\na = [0] * len(s)\r\nfor i, c in enumerate(s):\r\n if c == '(':\r\n t += i,\r\n elif t:\r\n a[t.pop()] = a[i] = 1\r\na = ''.join(map(str, a)).split('0')\r\nif max(a):\r\n print(len(max(a)), a.count(max(a)))\r\nelse:\r\n print('0 1')", "import sys\r\nfrom collections import Counter\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\ns = inpu().rstrip('\\n')\r\ncheck = [0]len(s)\r\nstack = []\r\nind = []\r\nfor i, j in enumerate(s) :\r\n if (len(stack) == 0) and (j == ')') :\r\n continue\r\n if j == '(' :\r\n stack.append(j)\r\n ind.append(i)\r\n if j == ')' :\r\n stack.pop()\r\n check[ind.pop()] = 1\r\n check[i] = 1\r\nans = [0]len(s)\r\nfor i in range(len(s)) :\r\n if check[i] == 1:\r\n ans[i] = 1 + ans[i - 1]\r\nc = Counter(ans).most_common()\r\nif c[-1][0] == 0:\r\n prin(\"0 1\\n\")\r\nelse:\r\n prin(' '.join(map(str, c[-1])) + '\\n')", "line = input()\n\nres = [0, 1]\nMin = [-1 for i in range(len(line)+1)]\nstack = []\nfor (i, ch) in enumerate(line):\n if ch == '(':\n stack.append(i)\n else:\n if len(stack):\n left = stack.pop()\n right = i\n\n if Min[left-1] != -1:\n left = Min[left-1]\n Min[right] = left\n\n length = right-left+1\n if length > res[0]:\n res = [length, 1]\n elif length == res[0]:\n res[1] += 1\n\nprint(res[0], res[1])\n", "s = input()\r\n# s = \"()(())()\"\r\nst = []\r\nans = []\r\n\r\nfor i,c in enumerate(s):\r\n if c==\"(\":\r\n st.append(i)\r\n elif st:\r\n q = st.pop()\r\n cur = [q,i] \r\n while True:\r\n if ans:\r\n x,y = ans[-1]\r\n if x==cur[0]+1 and y== cur[1]-1:\r\n ans.pop()\r\n elif y==cur[0]-1:\r\n ans.pop()\r\n cur[0]=x\r\n else:\r\n break\r\n else:\r\n break\r\n ans.append(cur)\r\nmx = 0\r\nmc = 1\r\nfor x,y in ans:\r\n if y-x+1>mx:\r\n mx = y-x+1\r\n mc = 1\r\n elif y-x+1==mx:\r\n mc+=1\r\nprint(mx,mc)\r\n", "s=input()\r\nn=len(s)\r\nst=[]\r\ncount=0\r\nmaxV=0\r\ndp=[0](n+1)\r\n\r\nfor i,ch in enumerate(s):\r\n if ch==')' and not st:\r\n continue\r\n elif ch=='(':\r\n st.append(i)\r\n else:\r\n idx=st.pop()\r\n length=i-idx+1\r\n dp[i]=length+dp[idx-1]\r\n if dp[i]>maxV:\r\n maxV=dp[i]\r\n count=1\r\n elif dp[i]==maxV:\r\n count+=1\r\n\r\n# for val in dp.values():\r\n# maxV=max(maxV,val)\r\n\r\n# for val in dp.values():\r\n# if val==maxV:\r\n# count+=1\r\n\r\n\r\n\r\nif maxV==0:\r\n print('0 1')\r\nelse:\r\n print(str(maxV)+' '+str(count))\r\n", "import sys\r\ninput = sys.stdin.readline\r\ndef I():return input().strip()\r\ndef II():return int(input().strip())\r\ndef LI():return [map(int,input().strip().split())]\r\nimport string, math, time, functools, random, fractions\r\nfrom heapq import heappush, heappop, heapify\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import deque, defaultdict, Counter, OrderedDict\r\nfrom itertools import permutations, combinations, groupby\r\nfrom operator import itemgetter\r\n\r\ninp = I()\r\nsize = len(inp)\r\ndp = [0] * (size + 1)\r\nque = deque()\r\nfor i in range(1, size + 1):\r\n if inp[i - 1] == '(':\r\n que.append(i)\r\n else:\r\n if que:\r\n pop = que.pop()\r\n dp[i] = i - pop + 1 + dp[pop - 1]\r\nmex = max(dp)\r\ncnt = dp.count(mex)\r\nif not mex:\r\n print(0, 1)\r\nelse:\r\n print(mex, cnt)", "s = input()\nn = len(s)\n\nstack = []\nc = [-1] * n\np = [-1] * n\nfor i in range(n):\n if s[i] == '(':\n stack.append(i)\n continue\n if not stack:\n continue\n j = stack.pop()\n p[i] = j\n c[i] = j\n if j > 0 and s[j - 1] == ')' and p[j - 1] != -1:\n c[i] = c[j - 1]\n\n\nans = 0\ncnt = 1\nfor i in range(n):\n if c[i] == -1:\n continue\n now = i - c[i] + 1\n if now > ans:\n ans = now\n cnt = 0\n if now == ans:\n cnt += 1\n\nprint(ans, cnt)\n\n", "def main():\n m = cnt = 1\n stack = [1]\n for c in input():\n if c == '(':\n stack.append(1)\n else:\n try:\n x = stack.pop() + stack.pop() + 1\n if m < x:\n m = x\n cnt = 1\n elif m == x:\n cnt += 1\n stack.append(x)\n except IndexError:\n stack = [1]\n m -= 1\n print(m, cnt if m else 1)\n\n\nif __name__ == '__main__':\n main()\n", "# Problem: C. Longest Regular Bracket Sequence\r\n# Contest: Codeforces - Codeforces Beta Round #5\r\n# URL: https://codeforces.com/problemset/problem/5/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/5/C\r\n\r\n输入括号字符串 s，长度不超过 1e6。\r\n\r\n输出 s 的最长合法括号子串的长度和数量。\r\n如果不存在，输出 0 1。\r\n输入 )((())))(()())\r\n输出 6 2\r\n\r\n输入 ))(\r\n输出 0 1\r\n\"\"\"\r\n\"\"\"令f[i]表示以i位置为结尾的最长合法子串。\r\n显然s[i]=='('则f[i] = 0，否则分类讨论\r\n若 s[i-1]=='(' 则只能这俩匹配，f[i] = f[i-2] + 2\r\n若 f[i-1]>0则说明前边挨着一段合法串，i只能和合法串左边的'('匹配；同时，若匹配成功，新串左边挨着合法串，也要加上。\r\n实现时，在s之前增加一个')'避免讨论边界0\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n s, = RS()\r\n n = len(s)\r\n s = ')' + s\r\n ans, cnt = 0, 1\r\n f = [0] * (n + 1)\r\n for i, c in enumerate(s[2:], start=2):\r\n if c == '(':\r\n continue\r\n if s[i - 1] == '(':\r\n f[i] = f[i - 2] + 2\r\n elif f[i - 1] and s[i - f[i - 1] - 1] == '(':\r\n f[i] = f[i - 1] + 2 + f[i - f[i - 1] - 2]\r\n if ans < f[i]:\r\n ans = f[i]\r\n cnt = 1\r\n elif ans == f[i] > 0:\r\n cnt += 1\r\n\r\n \")(())\"\r\n print(ans, cnt)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "\"\"\"\nModule which implements the search of the maximum length of balanced subsequence\nof paranthesis.\n\"\"\"\ndef max_length(array: list):\n \"\"\"\n Return the maximum length of balanced subsequence of paranthesis.\n \"\"\"\n max_length = 0\n num = 1\n stack = [-1]\n for i in range(len(array)):\n if array[i] == \"(\":\n stack.append(i)\n else:\n stack.pop()\n if stack:\n new_result = i - stack[-1]\n if new_result > max_length:\n max_length = new_result\n num = 1\n elif new_result == max_length:\n num += 1\n else:\n stack.append(i)\n return (max_length, num)\n\n\n\nif __name__ == \"__main__\":\n input_str = input()\n array = []\n for elem in input_str:\n array.append(elem)\n results = max_length(array)\n for elem in results:\n print(elem, end=\" \")\n\t\t \t \t \t \t\t \t \t\t", "#5C - longest brackets sequence\r\n\"\"\"\r\nThe number of opening brackets '(' in our sequence that will later have to be\r\nequivalised by closing brackets we start counting after we encounter the first '('\r\nres - the length of the longest substring that maintains the rule, initially 0\r\nb - the number of such substrings\r\ns - stack of brackets that maintain the rule of a regular sequence\r\nNote: we initialize the stack's index to be -1\r\n\r\nInitially, a = 0 and we consider this to be a regular sequence already\r\n\"\"\"\r\n#We take input and immediately process each character introduced by the user\r\n# for i, c in enumerate(input()):\r\nres, b, s = 0, 1, [-1]\r\n#Now we look through the all characters in the input:\r\nfor i, c in enumerate(input()):\r\n #When we find a '(', we push its index into the stack\r\n\tif c == '(': s.append(i)\r\n #Else, if the stack is not empty, we pop an item from the stack\r\n #when finding an ')' paranthesis\r\n\telif len(s) > 1:\r\n #We pop the previous opening bracket's index\r\n\t\ts.pop()\r\n # n calculates the length of the current valid substring\r\n # by substracting the stack's top from the current index\r\n\t\tn = i - s[-1]\r\n #Then we check if this length formed with base of \r\n # current valid substring is more than max so far\r\n #If not, the number of valid substrings is 1\r\n\t\tif res < n: res, b = n, 1\r\n #If yes, then we add that to the number of substrings\r\n\t\telif res == n: b += 1\r\n #If we can't find any regular sequence, the current index of the\r\n #stack is pushed as the base for the next possible valid substring\r\n\telse: s[0] = i\r\n#Finally, we print the length of the longest valid sequence and the number\r\n #of such sequences\r\nprint (' '.join([str(res), str(b)]))\r\n", "s = input()\nbr = []\ncount = 0\nlongest = 0\ncur = 0\n\nbr.append(-1)\n\nfor i in range(len(s)):\n if (s[i] == '('):\n br.append(i)\n elif (s[i] == ')'):\n if len(br) != 0:\n br.pop()\n\n if (len(br) != 0):\n if i-br[-1] > longest:\n longest = i-br[-1]\n count = 1\n elif i-br[-1] == longest:\n count += 1\n else:\n br.append(i)\n\nif (longest == 0):\n count = 1\n\nprint(longest, count, sep=' ')\n", "\r\n\r\ns=input()\r\nl=len(s)\r\nlst=[]\r\narr=[]\r\nfor i in range(l):\r\n if(s[i]==\"(\"):\r\n lst.append(i)\r\n else:\r\n if(len(lst)!=0):\r\n j=lst[-1]\r\n del lst[-1]\r\n m=2\r\n if(len(arr)!=0):\r\n last=arr[-1]\r\n if(last[0]<i and last[0]>j):\r\n m=m+last[-1]\r\n del arr[-1]\r\n if(len(arr)!=0):\r\n last = arr[-1]\r\n if(j-last[1]==1):\r\n m=m+last[-1]\r\n del arr[-1]\r\n arr.append([j,i,m])\r\n\r\n\r\nif(len(arr)==0):\r\n print(0,1)\r\nelse:\r\n\r\n ct=0\r\n mx=-1\r\n for i in arr:\r\n if(i[-1]>mx):\r\n ct=1\r\n mx=i[-1]\r\n elif(i[-1]==mx):\r\n ct+=1\r\n print(mx,ct)\r\n\r\n#\r\n\r\n\r\n", "from collections import deque\r\ne=[None]1000001\r\ns=[None]1000001\r\nf=[0]1000001\r\nst=input()\r\nstack=[]\r\nmax1=0\r\nfor i in range (len(st)):\r\n if(st[i]=='('):\r\n stack.append(i)\r\n else:\r\n if(len(stack)==0):\r\n s[i]=-1\r\n e[i]=-1\r\n else:\r\n idx=stack.pop()\r\n s[i]=idx\r\n e[i]=idx\r\n if(idx>0 and st[idx-1]==')' and s[idx-1]>=0):\r\n e[i]=e[idx-1]\r\n l=i-e[i]+1\r\n f[l]+=1\r\n max1=max(max1,l)\r\nf[0]=1\r\nprint(max1,' ',f[max1])\r\n", "s=input()\r\nn=len(s)\r\nc=[-1 for i in range(n)]\r\ne=[-1 for i in range(n)]\r\nst=[]\r\nmaxi=[0, 1]\r\nfor i in range(len(s)):\r\n if s[i]==\"(\":\r\n st.append(i)\r\n else:\r\n if len(st)==0:\r\n continue\r\n else:\r\n c[i]=e[i]=st.pop()\r\n if(c[i]>0 and c[c[i]-1]!=-1):\r\n e[i]=e[c[i]-1]\r\n l=i-e[i]+1\r\n if l>maxi[0]:\r\n maxi=[l, 1]\r\n elif l==maxi[0]:\r\n maxi[1]+=1\r\nprint(maxi) ", "s=input()\r\nn=len(s)\r\nl1=[-1]n\r\nl2=[-1]n\r\nl3=[0](n+1)\r\nl=[]\r\nfor i in range(n):\r\n if s[i]=='(':\r\n l.append(i)\r\n else:\r\n if len(l):\r\n a=l[-1]\r\n l.pop()\r\n l1[i]=i\r\n if a!=0 :\r\n if l2[a-1]!=-1:\r\n l2[i]=l2[a-1]\r\n else:\r\n l2[i]=a\r\n else:\r\n l2[i]=0\r\n l3[l1[i]-l2[i]+1]+=1\r\nans1,ans2=0,1\r\nfor i in range(n,-1,-1):\r\n if l3[i]!=0:\r\n ans1=i\r\n ans2=l3[i]\r\n break\r\nprint(ans1,ans2)\r\n \r\n", "a, b = [], []\n\nfor i, x in enumerate(input()):\n if x == '(':\n b.append(i)\n elif b:\n j = b.pop()\n \n while a and a[-1][0] > j:\n a.pop()\n \n if a and a[-1][1] == j - 1:\n a.append((a.pop()[0], i))\n else:\n a.append((j, i))\n\nm, n = 0, 1\n\nfor x in a:\n l = x[1] - x[0] + 1\n if l > m:\n m, n = l, 1\n elif l == m:\n n += 1\n\nprint(m, n)\n", "inp,kol,max_len,pos=input(),1,0,[-1];\r\nfor i in range(len(inp)): \r\n if(inp[i]=='('):\r\n pos.append(i);\r\n elif(len(pos)>1):\r\n pos.pop();\r\n x=i-pos[-1];\r\n if(max_len<x): max_len,kol=x,1;\r\n elif(max_len==x): kol+=1;\r\n else:\r\n pos[0]=i;\r\nprint(max_len,kol);\r\n#the problem requires you to find the longest real bracket sequence and the number ofsuch other sequences that might exist WITH THE SAME MAXIMUM LENGHT.the lenght of the no of brackes bn any two points is the difference bn the last index and the one before the 1st index.\r\n", "import sys\n\ns = sys.stdin.readline().rstrip()\n\nbalance = 0\nbalanceRecord = {0: -1}\nminBalance = 0\nmaxLen = 0\nmaxCount = 1\n\nfor i in range(len(s)):\n if s[i] == '(':\n balance += 1\n else:\n balance -= 1\n if balance < minBalance:\n minBalance = balance\n balanceRecord = {}\n \n if balance in balanceRecord:\n balanceRecord.pop(balance+1)\n newLen = i - balanceRecord[balance]\n if newLen > maxLen:\n maxLen = newLen\n maxCount = 1\n elif newLen == maxLen:\n maxCount += 1\n else:\n balanceRecord[balance] = i\n\nprint(str(maxLen) + ' ' + str(maxCount))\n", "s = input()\r\n\r\np = []\r\np.append(-1)\r\nlls = 0\r\nocc = 1\r\nfor i in range(len(s)) :\r\n if s[i] == '(' :\r\n p.append(i)\r\n elif len(p) > 1 :\r\n \r\n p.pop()\r\n n = i - p[-1]\r\n if n > lls :\r\n lls = n\r\n occ = 1\r\n elif n == lls :\r\n occ+=1\r\n else :\r\n p[0] = i\r\n\r\nprint(lls, occ)", "# import sys \r\n# # For getting input from input.txt file \r\n# sys.stdin = open('inputf.in', 'r') \r\n# # Printing the Output to output.txt file \r\n# sys.stdout = open('outputf.in', 'w') \r\n\r\n# started at 16:27\r\n\r\nmx, cnt, st = 0,1,[-1]\r\nfor i,w in enumerate(input().strip()):\r\n\tif w=='(': st.append(i)\r\n\telif len(st)>1: \r\n\t\tst.pop()\r\n\t\t_t = i - st[-1]\r\n\t\tif _t>mx: mx,cnt = _t,1\r\n\t\telif _t==mx: cnt+=1\r\n\telse: st[0]=i\r\nprint(mx,cnt)\r\n\r\n\r\n# submitted 17:17\r\n", "input_str = input().strip()\r\nstack = []\r\nmaxlen = 0\r\nsubs_count = 0\r\ncount = 0\r\nopen_bracks = 0\r\nfor i in input_str:\r\n if i=='(':\r\n stack.append('(')\r\n open_bracks += 1\r\n else:\r\n if stack != [] and open_bracks > 0:\r\n open_bracks -= 1\r\n temp = 2\r\n if stack[-1]!= '(':\r\n temp += int(stack.pop())\r\n if stack != [] and stack[-1] == '(':\r\n stack.pop()\r\n if stack!= [] and stack[-1] not in ['(', '\\n']:\r\n stack.append(temp+int(stack.pop()))\r\n else:\r\n stack.append(temp)\r\n else:\r\n stack.append(\"\\n\")\r\n \r\nwhile stack!= []:\r\n val = stack.pop()\r\n if val not in ['(','\\n']:\r\n val = int(val)\r\n if maxlen < val:\r\n maxlen = val\r\n count = 1\r\n elif maxlen == val:\r\n count += 1\r\nif maxlen == 0:\r\n count = 1\r\nprint(maxlen, count)\r\n", "from collections import defaultdict\r\ns = input()\r\nn = len(s)\r\ndp = [0]n\r\nst = []\r\nfor i in range(n):\r\n if s[i]=='(':\r\n st.append(i)\r\n else:\r\n if len(st)!=0:\r\n he = st.pop()\r\n if he:\r\n dp[i] = dp[he-1]+i-he+1\r\n else:\r\n dp[i] = i+1\r\nans = 0\r\ncnt = 1\r\nfor i in range(n):\r\n if dp[i]==ans:\r\n cnt += 1\r\n elif dp[i]>ans:\r\n ans = dp[i]\r\n cnt = 1\r\nif ans==0:\r\n cnt = 1\r\nprint(ans,cnt)\r\n", "s=input()\r\nst=[]\r\nst.append(-1)\r\nv=[]\r\nnum=0\r\nfor i in range(len(s)):\r\n if(s[i]=='('):\r\n st.append(i)\r\n else:\r\n st.pop()\r\n if(len(st)!=0 and num<=i-st[len(st)-1]):\r\n num=i-st[len(st)-1]\r\n v.append(num)\r\n if(len(st)==0):\r\n st.append(i)\r\ntry:\r\n print(max(v),' ',v.count(max(v)))\r\nexcept:\r\n print(\"0 1\")", "init_brackets = tuple(input())\n \nstack_id = [-1]\nresult = {0: 1}\n# count = 0\n \nfor i, bracket in enumerate(init_brackets):\n if bracket == '(':\n stack_id.append(i)\n else:\n stack_id.pop()\n if stack_id:\n res = i - stack_id[-1]\n result[res] = result.get(res, 0) + 1\n else:\n stack_id.append(i)\n \nmax_res = max(result)\nprint(max_res, result[max_res])\n\t\t\t\t\t\t \t\t\t\t\t\t \t\t \t\t\t \t \t \t", "t = input()\r\na = [0] * (len(t) + 1)\r\nm = n = k = 0\r\nfor i in range(len(t)):\r\n j = t[i]\r\n if j == '(':\r\n k += 1\r\n if k > 0:\r\n a[k] = i\r\n else:\r\n k -= 1\r\n if k < 0:\r\n k = 0\r\n a[k] = i + 1\r\n w = 0\r\n elif k == 0:\r\n w = i - a[k] + 1\r\n else:\r\n w = i - a[k]\r\n if w > m:\r\n m = w\r\n n = 1\r\n elif w == m:\r\n n += 1\r\n # print(a[:10])\r\nif m == 0:\r\n n = 1\r\nprint(m, n)\r\n\r\n\r\n\r\n\r\n", "st = [-1]\r\nMax = Count = 0\r\nfor i, c in enumerate(input()):\r\n\tif c == '(':\r\n\t\tst.append(i)\r\n\telse:\r\n\t\tif len(st) > 1:\r\n\t\t\tst.pop()\r\n\t\t\ttemp = i - st[-1]\r\n\t\t\tif temp > Max:\r\n\t\t\t\tMax = temp\r\n\t\t\t\tCount = 1\r\n\t\t\telif temp == Max:\r\n\t\t\t\tCount += 1\r\n\t\telse:\r\n\t\t\tst[0] = i\r\nif Max:\r\n\tprint(Max, Count)\r\nelse:\r\n\tprint(0, 1)", "a = input()\r\nbrakets = []\r\nq = -1\r\nansmax = 0\r\nquantity = 1\r\nk = 0\r\nfor i in range(len(a)):\r\n if a[i] == '(':\r\n brakets.append(i)\r\n elif brakets != []:\r\n brakets.pop()\r\n if brakets != []:\r\n k = i - brakets[-1]\r\n else:\r\n k = i - q\r\n if k > ansmax:\r\n ansmax = k\r\n quantity = 1\r\n elif k == ansmax:\r\n quantity += 1\r\n else:\r\n q = i\r\nprint()\r\nprint(ansmax, quantity)\r\n", "ch = input()\r\nl1= [-1]\r\nm=0\r\nmc=1\r\n\r\nfor i in range(len(ch)):\r\n if ch[i] == ')':\r\n if len(l1) > 1:\r\n l1.pop()\r\n lng = i - l1[-1]\r\n if lng == m:\r\n mc += 1\r\n elif lng > m:\r\n m = lng\r\n mc = 1\r\n elif len(l1) == 1:\r\n l1[0] = i\r\n else:\r\n l1.append(i)\r\n\r\nprint(m,mc)\r\n", "import collections\r\n\r\nexp = input()\r\nstack = []\r\nn = len(exp)\r\ndp = [0]n\r\nlength = 0\r\ncnt =0\r\nfor i in range(n):\r\n c = exp[i]\r\n if c =='(':\r\n stack.append(i)\r\n continue\r\n\r\n if not stack:\r\n continue\r\n j = stack.pop()\r\n dp[i]=i-j+1\r\n if j>=1:\r\n dp[i]+=dp[j-1]\r\n if dp[i]>length:\r\n length = dp[i]\r\n cnt = 1\r\n elif dp[i]==length:\r\n cnt+=1\r\nif length ==0:\r\n print(0,1)\r\nelse:\r\n print(length,cnt)\r\n", "from collections import deque, defaultdict\ns = input()\nmp = defaultdict(int)\nstack = deque([-1])\n_max = 0\nfor i,c in enumerate(s):\n if c == '(':\n stack.append(i)\n else:\n last = stack.pop()\n if len(stack) == 0:\n stack.append(i)\n else:\n curr = i - stack[-1]\n if curr > _max:\n _max = curr\n\n mp[curr] += 1\n\nif _max == 0:\n print(0, 1)\nelse:\n print(_max, mp[_max])\n\n\n\n\n\n\n\n", "import sys\n\nfrom collections import defaultdict\nfrom time import time\nfrom typing import Tuple\n\nOPEN, CLOSE = '(', ')'\n\n\ndef magic(data: Tuple):\n open_index, open_num, step = 0, 0, 0\n chars_count = len(data) - 1\n open_indexes = []\n x = []\n while step <= chars_count:\n char = data[step]\n if char == OPEN:\n open_indexes.append(step)\n open_num += 1\n elif char == CLOSE and open_num > 0:\n open_num -= 1\n open_index = open_indexes.pop()\n yield open_index\n yield step\n step += 1\n return data\n\n\ndef solve(string):\n group, prev = 0, 0\n maxgroup, maxgroupcount = 0, 0\n for index in sorted(magic(tuple(string.strip()))):\n sub = index - prev\n if sub == 1 or sub == index:\n group += 1\n elif group > 0:\n if maxgroup == group: maxgroupcount += 1\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n group = 1\n prev = index\n\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n elif maxgroup == group:\n maxgroupcount += 1\n\n return \"%s %s\" % (maxgroup, maxgroupcount)\n\n\n# assert solve(\")((())))(()())\") == \"6 2\"\n# assert solve(\"))(\") == \"0 1\"\n# assert solve(\"()(())()\") == \"8 1\"\n# assert solve(\"((((()(((\") == \"2 1\"\n# assert solve(\"))))()())))\") == \"4 1\"\n# assert solve(\"(()())()(())()()())())()((()(()(())()()())((()(())()(()()()()))()(())()(((()())()(()((())()(())(()))\") == \"28 1\"\n# assert solve(\")(()(((((())))))(((()))))))((()(((((((())())()))))((((((((())))((((((())))))(()((((()))))(()))))))))\") == \"68 1\"\n# start_time = time()\n\nprint(solve(sys.stdin.readline()))\n\n# complex_input = \"(()(())))()()((()(())()(()()((())))()))())((()(()(()))(()((())(())))))(()(((())(()(((()(())())))(()))()))(()()()()((((()(()()((()(()((()))())((((()()(()))())))))((())())()))(((()))()()()()()(()()(((()()))()(())))(((()))(())())(())()()(())))()()()))(()(())())))(())()))()))()()()))))))()))))()())()((()(((()(()())()()()())((((((())()))(())((()()())((())))(()()()))))(())))()()(()(())((((()()()()))))())((()()()())))((()))))()()()(()((((((()))())))((())((((()()))(())())())())()(((()()()(())(((())))())()()(((())\"\n# complex_input = complex_input 10000\n# print(solve(complex_input))\n\n# print(time() - start_time)\n", "string = input()\n\nclose_ = open_= max_len = 0\n\ncounter = 1\n\ndp = [True] * len(string)\n\n\nfor idx in range(len(string)):\n\tif string[idx] == \"(\":\n\t\topen_ += 1\n\telse:\n\t\tclose_ += 1\n\tif open_ == close_:\n\t\tlen_ = 2 * open_\n\t\tif len_ > max_len:\n\t\t\tmax_len, dp[idx - len_ + 1], counter = len_, False, 1\n\t\telif len_ == max_len:\n\t\t\tdp[idx - len_ + 1] = False\n\t\t\tcounter += 1\t\t\n\telif close_ > open_:\n\t\tclose_ = open_ = 0\n\n\nclose_ = open_= 0\n\n\nfor idx in range(len(string))[::-1]:\n\tif string[idx] == \"(\":\n\t\topen_ += 1\n\telse:\n\t\tclose_ += 1\n\tif open_ == close_:\n\t\tlen_ = 2 * open_\n\t\tif len_ > max_len:\n\t\t\tmax_len, counter = len_, 1\n\t\telif len_ == max_len:\n\t\t\tif dp[idx]:\n\t\t\t\tcounter += 1\n\telif open_ > close_:\n\t\tclose_ = open_= 0\nprint(max_len, counter)", "s = input()\r\nn = len(s)\r\ndem1_max = 0\r\ndem2_max = 1\r\nA = [-1]\r\nfor i in range(n):\r\n if s[i] == \"(\":\r\n A.append(i) \r\n elif len(A) > 1: \r\n x = A.pop()\r\n u = i - A[-1]\r\n if u == dem1_max:\r\n dem2_max += 1\r\n elif u >= dem1_max:\r\n dem1_max = u\r\n dem2_max = 1 \r\n else:\r\n A[0] = i\r\nprint(\"{} {}\".format(dem1_max,dem2_max))", "ins, maxlen, count, stack=input(), 0, 1, [-1]\r\nfor i,c in enumerate(ins):\r\n if c=='(': \r\n stack.append(i)\r\n elif len(stack)>1:\r\n stack.pop()\r\n x=i-stack[-1]\r\n if maxlen<x:\r\n maxlen, count = x, 1\r\n elif maxlen==x: \r\n count+=1\r\n else:\r\n stack[0]=i\r\nprint(maxlen,count)", "seq = input()\r\n\r\nRegular = [0 for _ in range(len(seq))]\r\n\r\nstack = []\r\nfor index in range(len(seq)):\r\n if seq[index] == '(':\r\n stack.append(index)\r\n continue\r\n \r\n if stack == []:\r\n continue\r\n left_index = stack[-1]\r\n stack.pop()\r\n \r\n Regular[index] = max(Regular[index], Regular[left_index - 1] + (index - left_index + 1))\r\n\r\nmax_len = max(Regular)\r\nmax_num = Regular.count(max_len)\r\nif max_len == 0:\r\n print(0, 1)\r\nelse:\r\n print(max_len, max_num)", "s = input()\nn = len(s)\ndp = []\nstack = []\nans = []\nfor i in range(n):\n\tif s[i]==\"(\":\n\t\tdp.append(i)\n\t\tstack.append(i)\n\t\tans.append(i)\n\telse:\n\t\tif not stack:\n\t\t\tdp.append(-1)\n\t\t\tans.append(-1)\n\t\t\tcontinue\n\t\tdp.append(stack[-1])\n\t\tif dp[-1]-1>=0 and s[dp[-1]-1]==\")\" and ans[dp[-1]-1]!=-1:\n\t\t\tans.append(ans[dp[-1]-1])\n\t\telse:\n\t\t\tans.append(dp[-1])\n\t\tstack.pop()\n\n\t# print (dp,ans)\n\n# print (ans)\nmaxx = 0\ncount = 1\nfor i in range(len(ans)):\n\tif i==ans[i]:\n\t\tcontinue\n\tdiff = i-ans[i]+1\n\tif ans[i]!=-1 and diff>maxx:\n\t\tmaxx = diff\n\t\tcount = 1\n\telif ans[i]!=-1 and diff==maxx:\n\t\tcount += 1\n# print (dp)\nprint (maxx,count)", "from collections import \r\ns=input()\r\nscore=0\r\nstack=[]\r\nal=defaultdict(int)\r\nval=0\r\ntemp=[]\r\nsaver=defaultdict(list)\r\nsaver[0].append(0)\r\nfor i in range(len(s)):\r\n if(s[i]==')'):\r\n if(score==0):\r\n stack=[]\r\n val=0\r\n saver=defaultdict(list)\r\n saver[0].append(i+1)\r\n else:\r\n stack.pop()\r\n score-=1\r\n al[i-(saver[score][-1])+1]+=1\r\n \r\n else:\r\n stack.append('(')\r\n score+=1\r\n \r\n saver[score].append(i+1)\r\n temp.append(val)\r\n \r\nif(len(al)):\r\n print(max(al),al[max(al)])\r\nelse:\r\n print(0,1)\r\n", "from collections import deque\nimport heapq \n\n\ndef main():\n m,b,s = 0,1,[-1]\n temp = input()\n for i,c in enumerate(temp):\n if c ==\"(\":s.append(i)\n elif len(s)>1:\n s.pop()\n n = i-s[-1]\n if n > m: m,b = n,1\n elif m == n: b+=1\n else:s[0]= i\n \n print(\" \".join([str(m),str(b)]))\n\nif __name__ == \"__main__\":\n main()", "s=input()\r\na=[-1]len(s)\r\nl=[0]len(s)\r\nq=[]\r\nfor i in range(len(s)):\r\n if s[i]=='(':q.append(i)\r\n elif q:\r\n x=q.pop()\r\n a[i]=x\r\n l[i]+=i-x+1\r\n if x>0:l[i]+=l[x-1]\r\nm,c=0,1\r\nfor i in range(len(s)):\r\n if l[i]>m:m,c=l[i],1\r\n elif l[i]==m:c+=1\r\nif m==0:c=1\r\nprint('%i %i' %(m,c))", "n, m, length = 0, 0, 0\ns = input()\nd = [-1] 1000006\nstack = []\n\nmax_length = 0\ncount = 1\n\nfor i in range(len(s)):\n if not stack or s[i] == '(':\n stack.append(i)\n continue\n\n pos = stack[-1]\n\n if s[pos] == '(':\n if d[pos - 1] != -1:\n d[i] = d[pos - 1]\n else:\n d[i] = pos\n\n length = i - d[i] + 1\n if length == max_length:\n count += 1\n elif length > max_length:\n max_length = length\n count = 1\n\n stack.pop()\n\nprint(max_length, count)\n\n \t \t \t \t \t \t\t\t \t\t \t", "st =[-1]\r\nMax=Count=0\r\nfor i, c in enumerate(input()):\r\n\tif c =='(':\r\n\t\tst.append(i)\r\n\telse:\r\n\t\tif len(st)>1:\r\n\t\t\tst.pop()\r\n\t\t\ttemp = i - st[-1]\r\n\t\t\tif temp >Max:\r\n\t\t\t\tMax= temp\r\n\t\t\t\tCount=1\r\n\t\t\telif temp ==Max:\r\n\t\t\t\tCount+=1\r\n\t\telse:\r\n\t\t\tst[0]= i\r\nif Max:\r\n\tprint(Max,Count)\r\nelse:\r\n\tprint(0,1)\r\n", "#**************************************\r\n\r\n# Solution by BAZOOKA \r\n\r\n# Sponsored by RED BULL\r\n\r\n# Team Galaxy \r\n\r\n# I love ❤Kateryna Gret❤ \r\n\r\n#************************************/\r\nn=input()\r\ns,a,b,c=[],0,-1,1\r\nfor i in range(len(n)):\r\n if n[i]=='(':s.append(i)\r\n elif s:\r\n s.pop()\r\n t=i-s[-1] if s else i-b\r\n if t>a:a,c=t,1\r\n elif t==a:c+=1\r\n else:b=i\r\n\r\nprint(a,c)\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#*************************************/ ", "from collections import defaultdict\n\nS = input()\n\nlevel_to_start = defaultdict(lambda: None)\nlevel = 0\nans_len, ans_count = 0, 1\n\nfor i, char in enumerate(S):\n if char == \"(\":\n if level_to_start[level] == None: level_to_start[level] = i\n level += 1\n else:\n level -= 1\n level_to_start[level+1] = None\n\n if (start := level_to_start[level]) != None:\n length = i - start + 1\n\n if length > ans_len:\n ans_len = length\n ans_count = 1\n elif length == ans_len:\n ans_count += 1\n\nprint(ans_len, ans_count)", "def magic(value=None):\n pairs = {}\n maximum, count = 0, 0\n num_of_opened, indices_of_opened = 0, []\n for i, char in enumerate(value or input()):\n if char == '(':\n indices_of_opened.append(i)\n elif indices_of_opened:\n o = indices_of_opened.pop()\n if o - 1 in pairs:\n start_of_previous = pairs[o - 1][0]\n pairs[i] = (start_of_previous, i)\n item_size = i - start_of_previous + 1\n else:\n item_size = i - o + 1\n pairs[i] = (o, i)\n if item_size > maximum:\n maximum = item_size\n count = 1\n elif item_size == maximum:\n count += 1\n if not maximum:\n return \"0 1\"\n return \"%s %s\" % (maximum, count)\n\n\n# assert magic(\")((())))(()())\") == \"6 2\"\n# assert magic(\"))(\") == \"0 1\"\n# assert magic(\"()(())()\") == \"8 1\"\n# assert magic(\"((((()(((\") == \"2 1\"\n# assert magic(\"))))()())))\") == \"4 1\"\n# assert magic(\"(()())()(())()()())())()((()(()(())()()())((()(())()(()()()()))()(())()(((()())()(()((())()(())(()))\") == \"28 1\"\n# assert magic(\")(()(((((())))))(((()))))))((()(((((((())())()))))((((((((())))((((((())))))(()((((()))))(()))))))))\") == \"68 1\"\n\nprint(magic())", "# @author: guoyc\n# @date: 2018/7/20\n\ns = input()\n\nN = len(s)\n\n# dp = [0] (N + 1)\n#\n# ml = 0\n# cnt = 1\n#\n# for i in range(1, N):\n# if s[i] == '(':\n# continue\n# if s[i - 1] == '(':\n# dp[i] = 2 + dp[i - 2]\n# elif (i - 1) - dp[i - 1] >= 0:\n# if s[(i - 1) - dp[i - 1]] == '(':\n# dp[i] = dp[i - 1] + 2 + dp[(i - 1) - dp[i - 1] - 1]\n# if dp[i] > ml:\n# ml = dp[i]\n# cnt = 1\n# elif dp[i] == ml:\n# cnt += 1\n#\n# if ml == 0:\n# print(0, 1)\n# else:\n# print(ml, cnt)\n\nst = [-1]\n\nml, cnt = 0, 1\n\nfor i, c in enumerate(s):\n if c == '(':\n st.append(i)\n else:\n if len(st) > 1:\n st.pop(-1)\n ll = i - st[-1]\n if ll > ml:\n ml, cnt = ll, 1\n elif ll == ml:\n cnt += 1\n else:\n st[0] = i\n\nprint(ml, cnt)\n", "#code by aanchaltiwari\r\n#practice\r\ns=input()\r\nn=len(s)\r\nvalid=[-1]n\r\nfreq=[0](n+1)\r\nstack=[]\r\nextension=[-1]n\r\nfor i in range(n):\r\n if s[i]==\"(\":\r\n stack.append(i)\r\n else:\r\n if stack:\r\n index=stack.pop()\r\n valid[i]=index\r\n extension[i]=index\r\n if index-1>0 and s[index-1]==\")\" and valid[index-1]>=0:\r\n extension[i]=extension[index-1]\r\n length=i-extension[i]+1\r\n freq[length]+=1\r\nf=0\r\nfor i in range(n,0,-1):\r\n if freq[i]:\r\n print(i,freq[i])\r\n f=1\r\n break\r\nif f==0:\r\n print(0,1)", "s = input()\r\nres1, res2 = 0, 1\r\nfrom collections import defaultdict \r\nhm = defaultdict(lambda:-2)\r\nhm[0] = -1\r\ncur = 0\r\nfor i in range(len(s)):\r\n if s[i] == ')':\r\n cur -= 1\r\n else:\r\n cur += 1\r\n if hm[cur + 1] != -2:\r\n hm[cur + 1] = -2\r\n if hm[cur] != -2:\r\n tmp = i - hm[cur]\r\n if tmp > res1:\r\n res1 = tmp\r\n res2 = 1\r\n elif tmp == res1:\r\n res2 += 1\r\n else:\r\n hm[cur] = i \r\nprint(res1, res2)", "s = [-1]\r\nl = 0\r\nrep = 0\r\n\r\nfor i, c in enumerate(input()):\r\n if c == '(':\r\n s.append(i)\r\n else:\r\n if len(s) > 1:\r\n s.pop()\r\n temp = i - s[-1]\r\n if temp > l:\r\n l = temp\r\n rep = 1\r\n elif temp == l:\r\n rep += 1\r\n else:\r\n s[0] = i\r\nif l:\r\n print (l, rep)\r\nelse :\r\n print (0, 1)\r\n", "line = input()\n \nall_pair = []\nstack = []\nfor (i, ch) in enumerate(line):\n if ch == '(':\n stack.append(i)\n else:\n if len(stack):\n left = stack.pop()\n all_pair.append((left, i))\n \nall_pair.sort()\n \nleft = -2\nright = -2\nres = [0, 1]\nfor pair in all_pair:\n if pair[0]==right+1:\n right = pair[1]\n elif right+1 < pair[0]:\n left, right = pair\n else:\n continue\n \n length = right-left+1\n if length > res[0]:\n res = [length, 1]\n elif length == res[0]:\n res[1] += 1\n \nprint(res[0], res[1])\n\n\t\t\t \t\t \t\t\t \t\t \t\t \t \t\t\t\t", "\"\"\"\n \n _nnnn_ \n dGGGGMMb ,''''''''''''''''''''''.\n @p~qp~~qMb \| Promoting GNU/Linux \|\n M\|@\|\|@) M\| _;......................'\n @,----.JM\| -'\n JS^\\__/ qKL\n dZP qKRb\n dZP qKKb\n fZP SMMb\n HZM MMMM\n FqM MMMM\n __\| \". \|\\dS\"qML\n \| `. \| `' \\Zq\n_) \\.___.,\| .'\n\\____ )MMMMMM\| .'\n `-' `--' hjm\n \n\"\"\"\n\ninp = input()\n\nmaxlen, occur, stack = 0, 1, [-1]\n\nfor i, val in enumerate(inp):\n if val == '(': stack.append(i)\n elif len(stack) > 1:\n stack.pop()\n consq = i - stack[-1]\n if maxlen < consq: maxlen, occur = consq, 1\n elif maxlen == consq:\n occur += 1\n else:\n stack[0] = i\n\nprint(maxlen, occur)\n", "s=input()\r\nst=[-1]\r\nn=1\r\nmax_res=0\r\nfor i in range(len(s)):\r\n if s[i]=='(':\r\n st.append(i)\r\n else:\r\n st.pop()\r\n if len(st)>0:\r\n res=i-st[-1]\r\n if res>max_res:\r\n max_res=res\r\n n=1\r\n elif res==max_res:\r\n n+=1\r\n else:\r\n st.append(i)\r\nprint(max_res,n)\r\n ", "def ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef msi(): return map(str,input().split())\r\ndef li(): return list(mi())\r\n\r\ns=si()\r\ndp=[0](len(s)+1)\r\nocnt=0\r\n\r\nfor i in range(len(s)):\r\n if s[i]=='(':\r\n ocnt+=1\r\n \r\n else:\r\n if ocnt>0:\r\n ocnt-=1\r\n \r\n if s[i-1]==')':\r\n dp[i]=dp[i-1]+2\r\n \r\n else:\r\n if i>1:\r\n if s[i-2]==')':\r\n dp[i]=2+dp[i-2]\r\n \r\n else:\r\n dp[i]=2\r\n \r\n else:\r\n dp[i]=2\r\n \r\n dp[i]=dp[i]+dp[i-dp[i]]\r\n \r\nif max(dp)==0:\r\n print(0,1)\r\n \r\nelse:\r\n print(max(dp),dp.count(max(dp)))\r\n \r\n \r\n ", "from collections import Counter as cr\r\nst=input()\r\ns=[]\r\nans=[0,0]\r\nfor i in st:\r\n if i=='(':\r\n ans.append(0)\r\n s.append(i)\r\n else:\r\n if len(s)!=0:\r\n x=ans.pop()\r\n ans.append(x+2)\r\n s.pop()\r\n x=ans.pop()\r\n y=ans.pop()\r\n ans.append(x+y)\r\n else:\r\n ans.append(0)\r\nm=cr(ans)\r\nc=max(ans)\r\nif c==0:\r\n print(\"0 1\")\r\nelse:\r\n print(c,m[c])\r\n# (()())()(())()()())())()((()(()(())()()())((()(())()(()()()()))()(())()(((()())()(()((())()(())(()))\r\n", "import sys\nfrom time import time\n\nfrom typing import Tuple\n\nOPEN, CLOSE = '(', ')'\n\n\ndef magic(data: Tuple):\n num_of_opened, i = 0, 0\n num_of_chars = len(data) - 1\n indices_of_opened = []\n while i <= num_of_chars:\n char = data[i]\n if char == OPEN:\n indices_of_opened.append(i)\n num_of_opened += 1\n elif num_of_opened > 0 and char == CLOSE:\n num_of_opened -= 1\n yield indices_of_opened.pop()\n yield i\n i += 1\n\ndef solve(string):\n group, prev = 0, 0\n maxgroup, maxgroupcount = 0, 0\n for index in sorted(magic(tuple(string.strip()))):\n sub = index - prev\n if sub == 1 or sub == index:\n group += 1\n elif group > 0:\n if maxgroup == group: maxgroupcount += 1\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n group = 1\n prev = index\n\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n elif maxgroup == group:\n maxgroupcount += 1\n\n return \"%s %s\" % (maxgroup, maxgroupcount)\n\n\n# assert solve(\")((())))(()())\") == \"6 2\"\n# assert solve(\"))(\") == \"0 1\"\n# assert solve(\"()(())()\") == \"8 1\"\n# assert solve(\"((((()(((\") == \"2 1\"\n# assert solve(\"))))()())))\") == \"4 1\"\n# assert solve(\"(()())()(())()()())())()((()(()(())()()())((()(())()(()()()()))()(())()(((()())()(()((())()(())(()))\") == \"28 1\"\n# assert solve(\")(()(((((())))))(((()))))))((()(((((((())())()))))((((((((())))((((((())))))(()((((()))))(()))))))))\") == \"68 1\"\n# start_time = time()\n\nprint(solve(sys.stdin.readline()))\n\n# complex_input = \"(()(())))()()((()(())()(()()((())))()))())((()(()(()))(()((())(())))))(()(((())(()(((()(())())))(()))()))(()()()()((((()(()()((()(()((()))())((((()()(()))())))))((())())()))(((()))()()()()()(()()(((()()))()(())))(((()))(())())(())()()(())))()()()))(()(())())))(())()))()))()()()))))))()))))()())()((()(((()(()())()()()())((((((())()))(())((()()())((())))(()()()))))(())))()()(()(())((((()()()()))))())((()()()())))((()))))()()()(()((((((()))())))((())((((()()))(())())())())()(((()()()(())(((())))())()()(((())\"\n# complex_input = complex_input * 10000\n# print(solve(complex_input))\n\n# print(time() - start_time)\n", "import sys\r\n\r\nOPEN, CLOSE = '(', ')'\r\n\r\n\r\ndef magic(data):\r\n num_of_opened, i = 0, 0\r\n num_of_chars = len(data)\r\n indices_of_opened = []\r\n while i < num_of_chars:\r\n char = data[i]\r\n if char == OPEN:\r\n indices_of_opened.append(i)\r\n num_of_opened += 1\r\n elif num_of_opened > 0 and char == CLOSE:\r\n num_of_opened -= 1\r\n yield indices_of_opened.pop()\r\n yield i\r\n i += 1\r\n\r\n\r\ndef solve(string):\r\n group, prev = 0, 0\r\n maxgroup, maxgroupcount = 0, 0\r\n for index in sorted(magic(tuple(string))):\r\n sub = index - prev\r\n if sub == 1 or sub == index:\r\n group += 1\r\n elif group > 0:\r\n if maxgroup == group: maxgroupcount += 1\r\n if maxgroup < group:\r\n maxgroup = group\r\n maxgroupcount = 1\r\n group = 1\r\n prev = index\r\n\r\n if maxgroup < group:\r\n maxgroup = group\r\n maxgroupcount = 1\r\n elif maxgroup == group:\r\n maxgroupcount += 1\r\n\r\n return \"%s %s\" % (maxgroup, maxgroupcount)\r\n\r\n\r\nprint(solve(sys.stdin.readline()))", "brackets = tuple(input())\n\nstack = [-1]\nresult = {0: 1}\ncount = 0\n\nfor i, bracket in enumerate(brackets):\n if bracket == '(':\n stack.append(i)\n else:\n stack.pop()\n if stack:\n res = i - stack[-1]\n result[res] = result.get(res, 0) + 1\n else:\n stack.append(i)\n\nmax_res = max(result)\nprint(max_res, result[max_res])\n \t\t\t \t \t \t\t \t\t\t\t \t\t \t \t \t \t", "from sys import stdin\n\nlines, line_index = stdin.readlines(), -1\n\n\ndef get_line():\n global lines, line_index\n\n line_index += 1\n return lines[line_index]\n\ndef main():\n data = get_line().strip()\n\n max_c = -1\n stack = [-1]\n counter = 0\n\n for i, c in enumerate(data):\n if c == '(':\n stack.append(i)\n else:\n stack.pop()\n\n if stack:\n temp_max = max(max_c, i - stack[-1])\n if i - stack[-1] == max_c:\n counter += 1\n elif temp_max > max_c:\n counter = 1\n max_c = temp_max\n else:\n stack.append(i)\n\n if max_c != -1:\n print('%s %s' % (max_c, counter))\n else:\n print('%s %s' % (0, 1))\n\nmain()", "def solve(s):\r\n\tl=[]\r\n\tlength=ref=0\r\n\tcount=1\r\n\tpos=-1\r\n\tfor i in range(len(s)):\r\n\t\tif s[i]==\"(\":\r\n\t\t\tl.append(i)\r\n\t\telif l:\r\n\t\t\tl.pop()\r\n\t\t\tref=i-l[-1] if l else i-pos\r\n\t\t\tif ref>length:\r\n\t\t\t\tlength=ref\r\n\t\t\t\tcount=1\r\n\t\t\telif ref==length:\r\n\t\t\t\tcount+=1\r\n\t\telse:\r\n\t\t\tpos=i\r\n\tprint(length,count)\r\n\t\t\t\r\ns=input()\r\nsolve(s)", "\ns=input()\nst1=[-1]\nn=1\nmax_res=0\nfor i in range(len(s)):\n if s[i]=='(':\n st1.append(i)\n else:\n st1.pop()\n if len(st1)>0:\n res=i-st1[-1]\n if res>max_res:\n max_res=res\n n=1\n elif res==max_res:\n n+=1\n else:\n st1.append(i)\nprint(max_res,n)\n \t\t \t\t\t \t \t\t \t \t\t\t", "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 st = insr()\r\n n = len(st)\r\n stack = []\r\n dp = [0] * n\r\n length, cnt = 0, 0\r\n\r\n for i in range(n):\r\n if st[i] == '(':\r\n stack.append(i)\r\n elif stack:\r\n j = stack.pop()\r\n dp[i] = i - j + 1 + dp[j - 1] if j > 0 else i + 1\r\n\r\n if dp[i] > length:\r\n length = dp[i]\r\n cnt = 1\r\n elif dp[i] == length:\r\n cnt += 1\r\n\r\n if length == 0:\r\n print(\"0 1\")\r\n else:\r\n print(length, cnt)\r\n \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", "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 a=rs()\r\n n=len(a)\r\n dp=[[-1,-1] for i in range(n)]\r\n if a[0]=='(':dp[0][0]=1 \r\n for i in range(1,n):\r\n if a[i-1]=='(': \r\n if a[i]=='(':\r\n dp[i][0]=1\r\n dp[i][1]=-1\r\n else:\r\n dp[i][0]=-1\r\n dp[i][1]=dp[i-1][0]+1 if dp[i-1][0]!=-1 else -1\r\n if a[i-1]==')':\r\n if a[i]=='(':\r\n dp[i][0]=dp[i-1][1]+1 if dp[i-1][1]!=-1 else 1\r\n dp[i][1]=-1\r\n else:\r\n dp[i][0]=-1\r\n if i-1-dp[i-1][1]>-1 and a[i-1-dp[i-1][1]]=='(': dp[i][1]=dp[i-1][1]+dp[i-1-dp[i-1][1]][0]+1\r\n else: dp[i][1]=-1\r\n mx=0\r\n cnt=0\r\n for i in range(n): mx=max(dp[i][1],mx)\r\n for i in range(n): \r\n if dp[i][1]==mx: cnt+=1\r\n if mx>0: print(mx,cnt)\r\n else:print(0,1)\r\n\r\nmain()", "s=input()\r\nn=len(s)\r\narr=[None for x in range(n)]\r\nstack=[]\r\ncountarr=[0 for x in range(n+1)]\r\n\r\nfor i in range(n):\r\n if s[i]==\"(\":\r\n stack.append(i)\r\n else:\r\n if stack:\r\n arr[i]=stack.pop()\r\nmaxlen=0;count=1\r\nfor i in range(n):\r\n if arr[i]!=None and arr[i]!=0:\r\n preindex=arr[i]-1\r\n\r\n if arr[preindex]!=None:\r\n arr[i]=arr[preindex]\r\n\r\nfor i in range(n):\r\n if arr[i]!=None:\r\n countarr[i-arr[i]+1]+=1\r\nfor i in range(n+1):\r\n if countarr[i]!=0:\r\n count=countarr[i]\r\n maxlen=i\r\n\r\nprint(maxlen,count)\r\n\r\n\r\n" ]	{"inputs": [")((())))(()())", "))(", "()(())()", "((((()(((", "))))()())))", "(()())()(())()()())())()((()(()(())()()())((()(())()(()()()()))()(())()(((()())()(()((())()(())(()))", ")(()(((((())))))(((()))))))((()(((((((())())()))))((((((((())))((((((())))))(()((((()))))(()))))))))", "())(((((())())((((()))(())))())())(((()(()()()())(())()))((()(())())()()))()(()())))))(()))((())((((", "))(((((((()((((())(((((((((()()))))(()())()((())())))((((()))(()()()))))(()()))())))))((())())()))(("], "outputs": ["6 2", "0 1", "8 1", "2 1", "4 1", "28 1", "68 1", "80 1", "92 1"]}	UNKNOWN	PYTHON3	CODEFORCES	149
8e4c196a1d858d4cb674277d1f33267d	Bit++	The classic programming language of Bitland is Bit++. This language is so peculiar and complicated. The language is that peculiar as it has exactly one variable, called x. Also, there are two operations: - Operation ++ increases the value of variable x by 1. - Operation -- decreases the value of variable x by 1. A statement in language Bit++ is a sequence, consisting of exactly one operation and one variable x. The statement is written without spaces, that is, it can only contain characters "+", "-", "X". Executing a statement means applying the operation it contains. A programme in Bit++ is a sequence of statements, each of them needs to be executed. Executing a programme means executing all the statements it contains. You're given a programme in language Bit++. The initial value of x is 0. Execute the programme and find its final value (the value of the variable when this programme is executed). The first line contains a single integer n (1<=≤<=n<=≤<=150) — the number of statements in the programme. Next n lines contain a statement each. Each statement contains exactly one operation (++ or --) and exactly one variable x (denoted as letter «X»). Thus, there are no empty statements. The operation and the variable can be written in any order. Print a single integer — the final value of x. Sample Input 1 ++X 2 X++ --X Sample Output 1 0	[ "x = int(input())\r\nresultaat = 0\r\nfor y in range(0,x,1):\r\n z = input()\r\n if z == \"++X\" or z == \"X++\":\r\n resultaat += 1\r\n if z == \"--X\" or z == \"X--\":\r\n resultaat -= 1\r\nprint(resultaat)", "#n is number of statement in the program\r\nx=0\r\nn=int(input())\r\nfor i in range(n):\r\n stmt=input().lower()\r\n if stmt=='++x' or stmt=='x++':\r\n x+=1\r\n elif stmt=='--x' or stmt=='x--':\r\n x+=-1\r\nprint(x) ", "n = int(input())\r\nx = 0\r\n\r\nfor i in range(n):\r\n command = input()\r\n if \"++\" in command:\r\n x+=1\r\n else:\r\n x-=1\r\n\r\nprint(x)", "n = int(input())\r\nx = 0\r\nfor j in range(n):\r\n st = input()\r\n if st[1] == \"+\":\r\n x = x+1\r\n else:\r\n x= x-1\r\n \r\nprint(x) \r\n ", "count=0\r\nn=int(input())\r\nfor i in range(n):\r\n m=input()\r\n if(m==\"X++\"):\r\n count+=1 \r\n elif(m==\"X--\"):\r\n count-=1\r\n elif(m==\"++X\"):\r\n count+=1 \r\n elif(m==\"--X\"):\r\n count-=1\r\n\r\nprint(count)", "n=int(input())\r\nsum=0\r\nfor _ in range(n):\r\n \r\n str=input()\r\n if(str==\"++X\") or (str==\"X++\"):\r\n sum+=1\r\n else:\r\n sum-=1\r\nprint(sum)", "x=0\r\nfor i in range(int(input())):\r\n\tif '+' in input():\r\n\t\tx+=1\r\n\telse:\r\n\t\tx-=1\r\nprint(x)\r\n", "n=int(input())\r\nx=0\r\nfor i in range(0,n):\r\n j=input()\r\n if(j==\"X++\" or j==\"++X\"):\r\n x=x+1\r\n elif(j==\"X--\"or j==\"--X\"):\r\n x=x-1\r\nprint(x) ", "s=0\r\nfor i in range(int(input())):\r\n x=input()\r\n if '+' in x:\r\n s+=1\r\n elif '-' in x:\r\n s-=1\r\nprint(s)", "n = int(input())\ni = 0\nx=0\nwhile(i<n):\n s = input()\n if(s[1]=='+'):\n x=x+1\n else:\n x=x-1\n i=i+1\nprint(x)", "t,sum = int(input()),0\r\nfor i in range(t):\r\n s = input()\r\n if s[1]=='+':\r\n sum=sum+1\r\n elif s[1]=='-':\r\n sum=sum-1\r\nprint(sum)", "print(sum(1 if '++' in input() else -1 for i in range(int(input()))))\r\n\r\n ", "\nn = int(input())\n\nx = 0\n\nfor i in range(n):\n \n s = input()\n if s[-1] == '+' or s[0] == '+':\n x+=1\n else:\n x-=1\n \nprint(x)\n\t \t \t\t\t\t \t\t\t\t \t \t \t\t\t\t \t", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n gg=input()\r\n if gg=='++X'or gg=='X++':\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "a = int(input())\r\n\r\n\r\ndef cal():\r\n global a\r\n x = 0\r\n for i in range(a):\r\n req = input()\r\n if \"++\" in req:\r\n x += 1\r\n else:\r\n x -= 1\r\n return x\r\n\r\n\r\nif 1 <= a <= 150:\r\n print(cal())\r\n", "number = int(input())\r\ncount = 0\r\nfor n in range(number):\r\n string = str(input())\r\n if (string[0] == \"+\" or string[len(string)-1] == \"+\"):\r\n count += 1\r\n if (string[0] == \"-\" or string[len(string)-1] == \"-\"):\r\n count -= 1\r\nprint(count)\r\n", "import sys\r\n\r\nn = int(sys.stdin.readline().split()[0])\r\n\r\nX = 0\r\nfor i in range(n):\r\n command = sys.stdin.readline().split()[0]\r\n if command[1] == \"+\": X+=1\r\n elif command[1] == \"-\": X-=1\r\n\r\nprint(X)", "n = int(input())\n\ncount = 0\n\nfor i in range(n):\n string = input()\n\n if string == \"X++\" or string == \"++X\":\n count += 1\n elif string == \"X--\" or string == \"--X\":\n count -= 1\n\nprint(count)", "x = 0 \r\n\r\ny = int(input())\r\n\r\nfor i in range(y):\r\n \r\n a= input()\r\n \r\n if (a == '++X' or a == 'X++'):\r\n x += 1\r\n elif (a == '--X' or a == 'X--'):\r\n x -= 1 \r\nprint(x)", "x=0\r\nfor i in range(int(input())):\r\n b=input()\r\n if '+' in b:\r\n x+=1\r\n elif '-' in b:\r\n x-=1\r\nprint(x)", "def execute_programme(n, l):\r\n x = 0\r\n \r\n for statement in l:\r\n if \"++\" in statement:\r\n x += 1\r\n else:\r\n x -= 1\r\n \r\n return x\r\n\r\nn = int(input())\r\nl = [input() for _ in range(n)]\r\nresult = execute_programme(n, l)\r\nprint(result)\r\n", "x=0\r\nn=int(input())\r\nfor _ in range(n):\r\n statement =input()\r\n if \"++\" in statement:\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)", "n=int(input(\"\"))\r\nX=0\r\nfor i in range(n):\r\n bit=input(\"\")\r\n if bit[0] ==\"+\" or bit[-1]==\"+\":\r\n X+=1\r\n else:\r\n X-=1\r\nprint(X)", "x=0\nn=input()\nn=int(n)\nfor i in range(n):\n vini=input()\n if vini==(\"++X\")or vini==(\"X++\"):\n x=x+1\n else:\n x=x-1\nprint(x)\n \t\t\t \t \t \t \t \t \t \t \t \t\t \t", "n = int(input())\r\ns=0\r\nfor i in range(n):\r\n b=input()\r\n if '++' in b:\r\n s+=1\r\n elif '--' in b:\r\n s-=1\r\nprint(s)", "n = int(input())\r\nx = 0\r\nfor _ in range(n):\r\n s = input()\r\n for i in range(3):\r\n if s[i] == '+':\r\n x += 1\r\n break\r\n elif s[i] == '-':\r\n x -= 1\r\n break\r\nprint(x)\r\n\r\n", "# Function to execute the Bit++ program and find the final value of x\ndef execute_program(program):\n x = 0\n for statement in program:\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n return x\n\n# Input\nn = int(input())\nprogram = [input() for _ in range(n)]\n\n# Output\nresult = execute_program(program)\nprint(result)\n\n \t \t \t \t\t \t\t \t\t \t\t", "X = 0\r\nn = int(input())\r\nfor i in range(0,n):\r\n a = input()\r\n if (a == '++X' or a == 'X++') :\r\n X = X + 1\r\n else:\r\n X = X - 1\r\nprint(X)", "san = int(input())\r\nlin = 0\r\nfor z in range(san):\r\n sandar = input()\r\n if sandar[1] == \"+\":\r\n lin = lin + 1\r\n else:\r\n lin = lin - 1\r\nprint(lin)\r\n", "x = int(input())\r\ncnt = 0\r\n\r\nfor i in range(x):\r\n s = input()\r\n if s.find('+') == -1:\r\n cnt = cnt-1\r\n else:\r\n cnt = cnt + 1\r\nprint(cnt)", "x = 0\r\nn = int(input())\r\nfor i in range(n):\r\n l = str(input())\r\n if l == '++X' or l == 'X++':\r\n x+=1\r\n elif l == '--X' or l == 'X--':\r\n x -= 1\r\nprint(x)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n str1=input()\r\n if str1==\"++X\" or str1==\"X++\":\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "# -- coding: utf-8 --\n\"\"\"\nCreated on Mon Oct 9 17:44:40 2023\n\n@author: khabl\n\"\"\"\ndef bitPlusPlus():\n #ask user for number of statements\n num_states = int(input())\n \n # initialize an empty list to store statements \n statements = []\n \n # Loop to append list\n for i in range(num_states):\n S = input()\n statements.append(S)\n \n #initialize result variable to 0\n result = 0\n \n #loop through list items and perform operations accordingly\n for i in statements:\n if(i == \"++X\" or i == \"X++\"):\n result += 1\n else:\n result -= 1\n \n \n print(result)\n \n#call the function\nbitPlusPlus()\n\t\t\t\t\t\t\t \t\t\t\t\t\t \t\t \t\t \t \t", "a = int(input())\r\n\r\nz = []\r\nfor i in range(1, a + 1):\r\n b = input()\r\n z.append(b)\r\n\r\ncount = 0\r\nfor j in z:\r\n if j[0] == '+' or j[2] == '+':\r\n count = count + 1\r\n\r\n if j[0] == '-' or j[2] == '-':\r\n count = count - 1\r\n\r\nprint(count)", "n=int(input())\r\na=0\r\nfor _ in range(n):\r\n\tk=input()\r\n\tif '+' in k:\r\n\t\ta=a+1\r\n\tif \"-\" in k:\r\n\t\ta=a-1\r\nprint(a)", "n = int(input())\ncount = 0\nfor i in range(0, n):\n x = input()\n if x[0:2] == \"++\" or x[1:] == \"++\":\n count += 1\n else:\n count -=1\nprint(count)", "n = int(input())\r\n\r\nx = 0\r\n\r\nfor e in range(n):\r\n a = input()\r\n\r\n if \"++\" in a and \"X\" in a:\r\n x += 1\r\n elif \"--\" in a and \"X\" in a:\r\n x -= 1\r\n\r\nprint(x)\r\n", "n = int(input())\r\nx = 0\r\nfor i in range(n):\r\n command = input()\r\n if command[0] == \"+\" or command[2] == \"+\":\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)\r\n", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n x = input()\r\n if (x[1] == \"+\"):\r\n count += 1\r\n else:\r\n count -= 1\r\nprint(count)", "def i():\r\n return(int(input()))\r\ndef l():\r\n return(list(map(int,input().split())))\r\ndef s():\r\n \r\n return(input())\r\ndef m():\r\n return(map(int,input().split()))\r\n\r\n \r\nn = i()\r\nx = 0\r\nfor _ in range(n):\r\n st = s()\r\n if st[0] == '+' or st[-1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)", "n=int(input())\nm=0\nfor _ in range(n):\n l=input()\n if l==\"++X\" or l==\"X++\":\n m+=1\n else:\n m-=1\nprint(m)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n ls = input()\r\n if \"++\" in ls:\r\n count+=1\r\n else:\r\n count-=1\r\nprint(count)\r\n", "t = int(input())\r\nx = 0\r\nfor test in range(t):\r\n operator = input()\r\n x = x+1 if operator.find(\"++\")>=0 else x-1\r\nprint(x)", "a=int(input(\"\"))\r\nplus=0\r\nminus=0\r\nfor i in range(a):\r\n l=list(input(\"\"))\r\n if l[1]==\"+\":\r\n plus+=1\r\n else:\r\n minus+=1\r\nprint(plus-minus)", "# no of statements\njumlah = int(input())\n\n# statementsnya\nx = 0\nfor rep in range(0,jumlah):\n statements = input()\n if (statements == \"++X\") or (statements == \"X++\"):\n x += 1\n elif (statements == \"--X\") or (statements == \"X--\"):\n x -= 1\n \nprint(x)\n \t \t \t\t \t\t \t \t \t \t", "n=0\r\nfor _ in range(int(input())):\r\n a = input()\r\n # n=0\r\n if a[1] == '+':\r\n n+=1\r\n elif a[1] == '-':\r\n n-=1\r\nprint(n)", "n = int(input())\r\n\r\nx = 0\r\nsub1 = \"--X\"\r\nadd1 = \"++X\"\r\nsub2 = \"X--\"\r\nadd2 = \"X++\"\r\n\r\nfor i in range(n):\r\n a = input()\r\n if a == sub1 or a == sub2:\r\n x -= 1\r\n elif a == add1 or a == add2:\r\n x += 1\r\nprint(x)\r\n", "x = 0\r\nn = int(input())\r\n\r\nfor i in range(0, n):\r\n i += 1\r\n l = str.lower(input())\r\n if (l == \"--x\" or l == \"x--\"):\r\n x -= 1\r\n elif (l == \"++x\" or l == \"x++\"):\r\n x += 1\r\n\r\nprint(x)", "n = int(input())\r\ns = \" \"\r\nfor i in range(n):\r\n s = s+ str(input())\r\nx = (s.count(\"+\")-s.count(\"-\"))/2\r\nprint(int(x))\r\n", "# print(x for i in range(int(input())) x+1 if '+' in input() ) \r\n#NO SINGLE LINE CODE POSSIBLE \r\nx=0\r\nfor i in range(int(input())):\r\n\tx=x+1 if '+' in input() else x-1\r\n\r\n\r\n\t# if '+' in input():\r\n\t# \tx+=1\r\n\t# else:\r\n\t# \tx-=1\r\n\r\nprint(x)\r\n", "n = int(input())\r\nX = 0\r\n\r\nfor value in range(n):\r\n y = input()\r\n if (y == 'X++') or (y == '++X') :\r\n X+=1\r\n elif (y == 'X--') or (y == '--X') :\r\n X-=1 \r\n\r\nprint(X)\r\n", "n = int(input())\r\ns = []\r\nx = 0\r\n\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nfor j in s:\r\n if j.startswith(\"+\") or j.endswith(\"+\"):\r\n x += 1\r\n if j.startswith(\"-\") or j.endswith(\"-\"):\r\n x -= 1\r\n\r\nprint(x)\r\n", "n = int(input())\r\nx = 0\r\n\r\nfor _ in range(n):\r\n if input()[1] == \"+\":\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)", "n = int(input())\nresult = 0\nfor x in range(n):\n statement = input()\n if (\"++\" in statement):\n result = result + 1\n if (\"--\" in statement):\n result = result - 1\nprint(result)", "n = int(input())\r\nX = 0\r\nfor i in range(n):\r\n s = input()\r\n if s == \"++X\" or s == \"X++\":\r\n X = X + 1\r\n if s == \"--X\" or s == \"X--\":\r\n X = X - 1\r\n\r\nprint(X)", "def FinalResult(operation, count):\r\n if operation == \"X++\" or operation == \"++X\":\r\n count = count+1\r\n else:\r\n count = count-1\r\n return count\r\n\r\nnum = int(input(\"\"))\r\nvalue = 0\r\nfor i in range(num):\r\n operationToPerform = input(\"\")\r\n value = FinalResult(operationToPerform, value)\r\nprint (value)", "import sys\n\nif __name__ == '__main__':\n n = int(sys.stdin.readline())\n x = 0\n for i in range(n):\n op = sys.stdin.readline().strip()\n if '++' in op:\n x += 1\n elif '--' in op:\n x -= 1\n\n print(x)\n", "cnt = 0\r\nfor _ in range(int(input())):\r\n str = input()\r\n if \"++\" in str:\r\n cnt += 1\r\n if \"--\" in str:\r\n cnt -=1\r\nprint(cnt)", "n = int(input())\r\na = 0\r\nfor i in range(n):\r\n o = input()\r\n if o == '--X' or o == 'X--':\r\n a -= 1\r\n if o == '++X' or o=='X++':\r\n a+=1\r\nprint(a)\r\n ", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n c= input()\r\n if c[0]==\"+\" or c[-1]==\"+\":\r\n x+=1\r\n else:\r\n x-=1\r\n \r\nprint(x)", "x = 0\r\nn = int(input())\r\nfor i in range(n):\r\n bit = str(input())\r\n if bit == '++X' or bit == 'X++':\r\n x += 1\r\n elif bit == '--X' or bit == 'X--':\r\n x -= 1\r\nprint(x)", "import math\nimport sys\nfrom collections import defaultdict\nimport heapq\nfrom collections import deque\ninput = sys.stdin.readline\nUSE_FILE = False \n\ndef search(k, v):\n p = 0\n a, n = len(v), len(v)\n while a >= 1:\n while p + a < n and k > v[p+a]:\n p += a\n a //= 2\n if k > v[p+a]:\n p += 1\n return p+1\n\nglobal maxi\nmaxi = -999999999999999 \n\ndef prnt(numbers):\n print(\"\\n\".join(map(str, numbers)))\n\ndef check(numbers):\n return sum(numbers) / 4 == (numbers[1] + numbers[2]) / 2 == numbers[-1] - numbers[0]\n\n\ndef main():\n n = int(input().strip())\n d = {\"++X\": 1, \"X++\": 1, \"--X\": -1, \"X--\": -1}\n res = 0\n for i in range(n):\n op = input().strip()\n res += d[op]\n print(res)\n\n\n\nif __name__==\"__main__\":\n if USE_FILE:\n sys.stdin = open('/home/stefan/input.txt', 'r')\n main()\n", "x = int(input())\r\ns=0\r\nfor i in range (x):\r\n ch = input()\r\n if ch[1]=='+':\r\n s+=1\r\n else :\r\n s = s-1\r\nprint(s)\r\n ", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n m = input()\r\n if (m[1] == '+'):\r\n k += 1\r\n else:\r\n k -= 1\r\nprint(k)", "total = int(input())\r\ncount = 0\r\noperations = {\"X++\":1,\"++X\":1,\"--X\":-1,\"X--\":-1}\r\nfor i in range(total):\r\n # if i == total -1:\r\n # ope = input()\r\n # if ope[0] != \"X\":\r\n # count += -(operations[ope])\r\n # count += \r\n ope = input()\r\n count += operations[ope]\r\nprint(count)", "t=int(input())\r\ns=\"\"\r\nx=0\r\nwhile t >0 :\r\n s=input()\r\n if s[0]=='+' or s[1]=='+':\r\n x+=1\r\n else:\r\n x-=1\r\n \r\n t-=1\r\nprint(x)\r\n ", "t=int(input())\nres=0\nfor x in range(t):\n n=input()\n if n==\"++X\" or n==\"X++\":\n res+=1\n elif n==\"--X\" or n==\"X--\":\n res-=1\nprint(res)\n\t\t \t\t \t \t \t \t \t\t\t \t\t\t \t \t\t", "n = 0\r\nfor i in range(int(input())):\r\n x = input()\r\n if \"++\" in x:\r\n n += 1\r\n else: \r\n n -= 1\r\nprint(n)", "t = int(input())\r\nx = 0\r\nfor i in range(t):\r\n operator = input()\r\n if (operator == \"X--\") or (operator == \"--X\"):\r\n x -=1\r\n elif (operator == \"X++\") or (operator == \"++X\"):\r\n x+=1\r\nprint(x)", "statements=int( input())\r\nX=0\r\nfor i in range (statements):\r\n\tstatement=input()\r\n\tif statement =='++X' or statement == 'X++':\r\n\t\tX+=1\r\n\telif statement == '--X'or statement =='X--':\r\n\t\tX-=1\r\n\telse:\r\n\t\tcontinue\r\nprint(X)", "n = int(input())\r\nx = 0\r\n\r\nfor i in range(n):\r\n letter = input()\r\n if letter == \"++X\" or letter == \"X++\":\r\n x += 1\r\n elif letter == \"--X\" or letter == \"X--\":\r\n x -= 1\r\n\r\nprint(x)", "t=int(input())\r\ncount=0\r\nfor i in range(t):\r\n z=input().strip()\r\n if(z.count('+')>=1):\r\n count+=1\r\n if(z.count('-')>=1):\r\n count+=(-1)\r\nprint(count)", "# Initialize the variable x to 0\r\nx = 0\r\n\r\n# Input: Read the number of statements\r\nn = int(input().strip())\r\n\r\n# Process each statement\r\nfor _ in range(n):\r\n statement = input().strip()\r\n \r\n # Check if the statement contains \"++\" or \"--\"\r\n if \"++\" in statement:\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\n# Output the final value of x\r\nprint(x)\r\n", "list_of_op = []\r\nnum_of_inp = int(input())\r\n\r\nfor _ in range(num_of_inp):\r\n op = input()\r\n list_of_op.append(op)\r\n\r\ndef operation():\r\n x = 0\r\n for _ in range(num_of_inp):\r\n if \"+\" in list_of_op[_]:\r\n x += 1\r\n else:\r\n x -= 1\r\n return x\r\n\r\nprint(operation())", "m = int(input())\r\n\r\nx = 0\r\nfor i in range(m):\r\n j = str(input())\r\n \r\n if j[0] == 'X':\r\n if j[1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\n elif j[2] == 'X':\r\n if j[1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)", "x=0\nn=input()\nn=int(n)\nfor i in range(n):\n ab=input()\n if ab==(\"++X\")or ab==(\"X++\"):\n x=x+1\n else:\n x=x-1\nprint(x)\n\t\t \t \t \t\t\t\t\t \t \t \t \t", "n = int(input())\nresult = 0\n\nfor _ in range(n):\n statement = input()\n if \"++\" in statement:\n result += 1\n else:\n result -= 1\n\nprint(result)\n\n\t \t\t \t\t \t\t \t\t \t \t \t\t\t\t \t\t \t", "n = int(input())\r\nsum = 0\r\nfor _ in range(n):\r\n temp = input()\r\n if temp[:2]=='--' or temp[-2:]==\"--\":\r\n sum-=1\r\n elif temp[:2]=='++' or temp[-2:]==\"++\":\r\n sum+=1\r\nprint(sum)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n\ta=input()\r\n\tif a.__contains__('+'):\r\n\t\tx+=1\r\n\telse:\r\n\t\tx-=1\r\nprint(x)\r\n", "n = int(input())\r\nX = 0\r\n\r\nfor i in range(n):\r\n st = input()\r\n \r\n if st[1] == \"+\":\r\n X += 1\r\n else:\r\n X -= 1\r\n\r\nprint(X)\r\n", "n=int(input())\r\nx=0\r\nfor j in range(n):\r\n symbol=input().split()\r\n for i in range(len(symbol)):\r\n if symbol[i] == \"++X\" or symbol[i] == \"X++\":\r\n x = x + 1\r\n else:\r\n x = x - 1\r\nprint(x)", "n = int(input())\r\nx = sum(1 if input() in \"++X,X++\" else -1 for _ in range(n))\r\nprint(x)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n a=input()\r\n l.append(a)\r\nb=0 \r\nfor i in range(len(l)):\r\n if(\"+\" in l[i]):\r\n b+=1\r\n elif(\"-\" in l[i]):\r\n b-=1\r\n\r\n\r\n\r\nprint(b)", "if __name__=='__main__':\r\n\tn = int(input())\r\n\tsum_x = 0\r\n\tfor _ in range(n):\r\n\t\ts = input()\r\n\t\tif '++' in s:\r\n\t\t\tsum_x += 1\r\n\t\telif '--' in s:\r\n\t\t\tsum_x -=1\r\n\tprint(sum_x)", "n = int(input())\r\nc = 0\r\n\r\nfor _ in range(n):\r\n s = input()\r\n \r\n # Check for occurrences of \"++\" or \"--\" in the input string\r\n if \"++\" in s:\r\n c += 1\r\n elif \"--\" in s:\r\n c -= 1\r\n\r\nprint(c)\r\n", "import copy\nimport decimal\nimport math\nimport sys\nimport time\ncyc=int(input())\nsum=0\nfor each in range(cyc):\n curr=input()\n if curr.count(\"-\")>0:\n sum-=1\n else:sum+=1\nprint(sum)", "n = int(input())\r\nx= 0 \r\nfor i in range (n):\r\n statment = input()\r\n if statment == \"X++\" or statment == \"++X\":\r\n x +=1\r\n elif statment == \"X--\" or statment == \"--X\":\r\n x-=1\r\nprint(x) ", "n = int(input())\r\nresp = 0\r\n\r\nfor i in range(n):\r\n s = input()\r\n if s == \"X++\" or s == \"++X\":\r\n resp+=1\r\n if s ==\"--X\" or s ==\"X--\":\r\n resp-=1\r\n\r\nprint(resp)", "n = int(input())\ncount = 0\nfor i in [0]n:\n statement = list(input())\n if \"X\" in statement and \"+\" in statement:\n count +=1\n elif \"X\" in statement and \"-\" in statement:\n count -=1\nprint (count)\n", "n = int(input())\r\n\r\ncurrent = 0\r\n\r\nfor i in range(n):\r\n str = input()\r\n if str == \"++X\" or str == \"X++\":\r\n current += 1\r\n else:\r\n current -= 1\r\n\r\nprint(current)", "z = input()\nz = int(z)\nc = 0\nfor i in range (z) :\n x = input()\n x = str(x)\n if x == \"++X\" or x == \"X++\" :\n c += 1\n else :\n c -= 1\nprint(c)\n \t\t\t \t \t \t \t\t \t\t\t\t\t\t\t \t \t", "x = 0\nfor _ in range(int(input())):\n\tif \"+\" in input(): x+=1\n\telse: x-=1\nprint(x)\t\n", "t = input()\r\nn = int(t)\r\nx = 0\r\nr = 1\r\nwhile r <= n:\r\n f = input()\r\n if f.find(\"++\") != -1:\r\n x=x+1\r\n else:\r\n x=x-1\r\n r=r+1\r\nprint(x)", "num = int(input())\ny = 0\nfor i in range(num):\n x=input()\n \n if \"-\"in x:\n y -=1\n else:\n y +=1\n \nprint(y)\n\t \t \t \t \t \t\t\t \t\t \t\t \t \t\t \t\t", "n = int(input())\n\nwhile n<1 or n>150:\n n = int(input())\n\n\nsuma = 0\nfor el in range(0,n):\n x = input()\n if x=='--X' or x=='X--':\n suma= suma-1\n if x=='++X' or x=='X++':\n suma = suma+1\n \nprint(suma)", "def write_digit(text, x):\r\n \r\n if \"++\" in text:\r\n return x + 1\r\n \r\n elif \"--\" in text:\r\n return x - 1\r\n\r\nn = int(input())\r\nx = 0\r\n\r\nfor _ in range(n):\r\n text = input().strip()\r\n x = write_digit(text, x)\r\nprint(x)", "n = int(input())\r\ncnt= 0\r\nop = []\r\nfor i in range(n):\r\n op.append(input())\r\nfor i in op:\r\n if i in ('++X','X++'):\r\n cnt+=1\r\n elif i in ('--X','X--'):\r\n cnt-=1 \r\nprint(cnt) ", "n = int(input())\r\noperations: list = [input().lower() for _ in range(n)]\r\nx = 0\r\nfor i in operations:\r\n if i[1] == '+':\r\n x+=1\r\n elif i[1] == '-':\r\n x-=1\r\n \r\nprint(x)\r\n\r\n", "k = int(input())\r\nr = 0\r\ns = ''\r\nfor i in range(k):\r\n s = input()\r\n if '+' in s:\r\n r+=1\r\n else:\r\n r-=1\r\nprint(r)\r\n", "t=int(input())\r\nn=0\r\nfor i in range(0,t):\r\n s=input()\r\n if s[1]=='-':\r\n n-=1\r\n else:\r\n n+=1\r\nprint(n)", "n = int(input())\r\nl=0\r\nr=0\r\nwhile n > 0:\r\n n-=1\r\n s = str(input())\r\n if(s == \"++X\" or s == \"X++\"):\r\n l+=1\r\n if(s == \"--X\" or s == \"X--\"):\r\n r+=1\r\nprint(l-r)\r\n", "operations=int(input())\r\nx=0\r\nfor i in range(operations):\r\n operation=input()\r\n if \"-\" in operation:\r\n x=x-1\r\n elif \"+\" in operation:\r\n x=x+1\r\n\r\nprint(x)\r\n \r\n", "def main():\r\n\tt = int(input())\r\n\tfinal = 0\r\n\tfor _ in range(t):\r\n\t\tn = input()\r\n\t\tif n[0] == \"X\" and n[-1] == \"+\":\r\n\t\t\tfinal += 1\r\n\t\telif n[-1] == \"X\" and n[0] == \"+\":\r\n\t\t\tfinal += 1\r\n\t\telse:\r\n\t\t\tfinal -= 1\r\n\tprint(final)\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "a=int(input())\r\nx=0\r\ny=[]\r\nfor i in range(a):\r\n b=input()\r\n y.append(b)\r\n if '+' in b:\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)\r\n", "a = int(input())\r\nb = 0\r\nfor _ in range(a):\r\n statement = input()\r\n if \"++\" in statement:\r\n b += 1\r\n else:\r\n b -= 1\r\nprint(b)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n w=input()\r\n if '+' in w:\r\n x+=1\r\n if '-' in w:\r\n x-=1\r\nprint(x)", "n = int(input())\r\nnum1 = 0\r\n\r\nfor i in range(0, n):\r\n y = input()\r\n if y == '++X':\r\n num1 = num1 + 1\r\n if y == 'X++':\r\n num1 = num1 + 1\r\n if y == '--X':\r\n num1 = num1 - 1\r\n if y == 'X--':\r\n num1 = num1 - 1\r\nprint(num1)\r\n", "n = int(input())\r\n\r\nx = 0\r\n\r\nfor i in range(n):\r\n increment = input()\r\n if increment == '++X' or increment == 'X++':\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)\r\n", "def execute_programme(statements):\r\n x = 0\r\n for statement in statements:\r\n if \"++\" in statement:\r\n x += 1\r\n else:\r\n x -= 1\r\n return x\r\n\r\ndef main():\r\n n = int(input())\r\n statements = [input() for _ in range(n)]\r\n\r\n result = execute_programme(statements)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ncounter = 0\r\nfor _ in range ( n ) :\r\n iter = input().strip()\r\n if ( iter[0] == 'X' or iter[0]== 'x' ):\r\n if ( iter[1] == '+' and iter[2]=='+'):\r\n counter+=1\r\n if ( iter[1] == '-' and iter[2]=='-'):\r\n counter-=1\r\n if ( iter[2] == 'X' or iter[2]== 'x' ):\r\n if ( iter[1] == '+' and iter[0]=='+'):\r\n counter+=1\r\n if ( iter[1] == '-' and iter[0]=='-'):\r\n counter-=1\r\n\r\nprint(counter)\r\n", "# Read the number of statements\nn = int(input())\n\n# Initialize the variable x\nx = 0\n\n# Execute each statement\nfor _ in range(n):\n statement = input()\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n\n# Print the final value of x\nprint(x)\n\n\t \t \t\t\t\t\t\t\t \t \t \t \t\t\t", "n=int(input())\nX=0\nfor _ in range(n):\n str=input()\n if str[1]=='+':\n X+=1\n else:\n X-=1\nprint(X)\n\n\n \t \t\t\t\t\t\t\t \t\t \t \t \t \t \t\t \t", "n=int(input())\r\np=[]\r\nfor i in range(n):\r\n p.append(input())\r\nvar=0\r\nfor i in p:\r\n if i=='X++' or i=='++X':\r\n var+=1\r\n elif i=='X--' or i=='--X':\r\n var+=-1\r\nprint(var)", "a = int(input())\r\nc = 0\r\nfor i in range(a):\r\n b = input()\r\n if(b[1] == \"+\"):\r\n c += 1\r\n else:\r\n c -= 1\r\nprint(c)", "n = int(input())\r\na = []\r\nx=0\r\nfor i in range(0,n):\r\n step = input()\r\n if step==\"++X\" or step==\"X++\":\r\n x+=1\r\n elif step==\"--X\" or step==\"X--\":\r\n x-=1\r\nprint(x)", "n = int(input())\r\nx = 0\r\n\r\nfor n in range(n):\r\n line = input()\r\n countp = line.count(\"+\")\r\n countn = line.count(\"-\")\r\n\r\n if countp != 0:\r\n x+=1\r\n if countn !=0:\r\n x-=1\r\n\r\n\r\nprint(x)\r\n\r\n\r\n", "X=int(0)\noperationtimes=int(input())\nfor i in range(operationtimes):\n entry=str(input())\n if entry==\"X++\" or entry==\"++X\":\n X=X+1\n if entry==\"--X\" or entry==\"X--\":\n X=X-1\nprint(X)", "t=[]\nx=0\nfor i in range(int(input())):\n n=input()\n if (n=='--X') or (n=='X--') :\n x=x-1\n elif (n=='++X')or('X++') :\n x=x+1\nprint(x)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n ch=input()\r\n if ch==\"++X\" or ch==\"X++\" or ch==\"++\" :\r\n s+=1\r\n elif ch==\"--X\" or ch==\"X--\" or ch==\"--\":\r\n s-=1\r\nprint(s)", "x = 0\r\nfor _ in range(int(input())):\r\n x += {'+': 1, '-': -1}[input()[1]]\r\nprint(x)", "X=0\r\nb=int(input())\r\n\r\nfor i in range(b):\r\n opr=input()\r\n if \"X++\" in opr or \"++X\" in opr:\r\n X+=1\r\n if \"X--\" in opr or \"--X\" in opr: \r\n X-=1\r\n\r\nprint (X)", "n = int(input()) #number of inputs\r\nnumber = 0\r\noperations = []\r\n\r\nfor init in range(n):\r\n operations.append(input())\r\n\r\nfor x in operations:\r\n if(x == '++X' or x == 'X++'):\r\n number+=1\r\n if(x == '--X' or x == 'X--'):\r\n number-=1\r\n\r\nprint(number)", "numStatements = int(input())\r\nx = 0\r\n\r\nfor _ in range(numStatements):\r\n statement = input()\r\n if \"++\" in statement and statement.count('X') == 1:\r\n x += 1\r\n if \"--\" in statement and statement.count('X') == 1:\r\n x -= 1\r\n else:\r\n pass\r\n \r\nprint(x)", "# Function to execute the Bit++ program and find the final value of x\ndef execute_bit_program(program):\n x = 0\n for statement in program:\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n return x\n\n# Input reading\nn = int(input())\nbit_program = [input() for _ in range(n)]\n\n# Call the function to execute the Bit++ program\nresult = execute_bit_program(bit_program)\n\n# Print the final value of x\nprint(result)\n\n \t \t\t\t\t\t \t \t \t \t\t\t \t \t \t\t\t\t", "def foo(s):\r\n l = []\r\n for i in range(len(s)):\r\n l.append(s[i])\r\n if l.count('+')==2:\r\n return 1\r\n elif l.count('-')==2:\r\n return -1\r\n else:\r\n return 0\r\nq = int(input())\r\nans =0\r\nfor i in range(q):\r\n s = input()\r\n ans = ans + (foo(s))\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", "x=0\r\n\r\nn=input()\r\nlist=[]\r\nfor i in range(int(n)):\r\n a=input()\r\n list.append(a)\r\n \r\nfor i in range(int(n)):\r\n k=list[i]\r\n if (k[1]==\"+\"):\r\n x+=1\r\n elif(k[1]==\"-\"):\r\n x-=1\r\n \r\nprint(x)", "ans=0\r\nfor i in range(int(input())):\r\n s=input()\r\n for j in s:\r\n if j==\"+\":\r\n ans+=0.5\r\n if j==\"-\":\r\n ans-=0.5\r\nprint(int(ans))", "def bit_pp(statement):\r\n x = 0\r\n if statement == 'X++' or statement == '++X':\r\n x += 1\r\n elif statement == 'X--' or statement == '--X':\r\n x -= 1\r\n return x\r\n\r\ncounter = 0\r\nnum_of_statements = int(input())\r\nfor _ in range(num_of_statements):\r\n statemnt = input()\r\n counter += bit_pp(statemnt)\r\n\r\nprint(counter)\r\n", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n stat=input()\r\n if \"++\" in stat:\r\n x+=1\r\n elif \"--\" in stat:\r\n x-=1\r\nprint(x)", "x=0\r\nn=int(input())\r\nfor i in range(n):\r\n y=str(input())\r\n if y==\"X++\" or y==\"++X\":\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)", "n = int(input())\r\n\r\nA=0\r\n\r\nfor i in range(n):\r\n a = input()\r\n if a=='++X' or a=='X++':\r\n A+=1\r\n else:\r\n A=A-1\r\n\r\nprint(A)", "if __name__ == '__main__':\r\n n = int(input())\r\n x = 0\r\n for i in range(n):\r\n input_str = input()\r\n if input_str.find('++') != -1:\r\n x+=1\r\n elif input_str.find('--') != -1:\r\n x-=1\r\n print(x)", "num = int(input())\r\nvalue = 0\r\n\r\nfor i in range(num):\r\n\tstatement = input()\r\n\tif \"++\" in statement:\r\n\t\tvalue = value + 1\r\n\telse:\r\n\t\tvalue = value - 1\r\n\r\nprint(value)\r\n\r\n", "n = int(input())\r\nx=0\r\nfor i in range(n):\r\n a = input()\r\n if a=='++X' or a=='X++':\r\n x+=1\r\n else:\r\n x=x-1\r\nprint(x)", "n=int(input())\r\nx=0\r\nfor i in range(1,n+1,1):\r\n s=input()\r\n if s==\"++X\" or s==\"X++\":\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)", "n = int(input())\r\n\r\nFirst_Num = 0\r\n\r\nfor i in range(n):\r\n Operation = input()\r\n if \"++\" in Operation:\r\n First_Num += 1\r\n elif \"--\" in Operation:\r\n First_Num -= 1\r\n \r\nprint(First_Num)", "n=int(input())\r\nX=0\r\nfor i in range(n):\r\n t=input()\r\n if t==\"X++\" or t==\"++X\":\r\n X+=1\r\n else:\r\n X-=1\r\nprint(X)", "a = int(input())\nl = []\nx = 0\nwhile a:\n\tp = input()\n\tif p in [\"X++\", \"++X\"]:\n\t\tx += 1\n\telif p in [\"--X\",\"X--\"]:\n\t\tx -= 1\n\ta -= 1\nprint(x)\n\n \t\t\t \t\t\t \t\t \t\t\t\t\t\t\t\t\t\t\t\t \t", "n = int(input())\r\nx = 0\r\nSUMA = False\r\nfor i in range(0, n):\r\n word = input()\r\n for z in word:\r\n if z == '+':\r\n SUMA = True\r\n if z == '-':\r\n SUMA = False\r\n if SUMA == True:\r\n x +=1\r\n else:\r\n x -=1\r\nprint(x)\r\n", "n = int(input())\r\nx = 0\r\n\r\nfor _ in range(n):\r\n b = input()\r\n if b== \"X++\" or b == \"++X\":\r\n x = x + 1\r\n else:\r\n x = x - 1\r\n\r\nprint(x)\r\n", "n = int(input())\r\noperations=[]\r\nx=0\r\n\r\nfor i in range(n):\r\n a=input()\r\n operations.append(a)\r\n if \"+\" in operations[i]:\r\n x = x+1 \r\n elif \"-\" in operations[i]:\r\n x = x-1\r\n \r\nprint(x)", "n=int(input())\r\nx=0\r\nfor i in range(0,n):\r\n s=input()\r\n if s[0]=='+'or s[2]=='+':\r\n x+=1 \r\n else:\r\n x-=1 \r\nprint(x)\r\n\r\n ", "a = int(input())\r\ncount = 0\r\nwhile(True):\r\n try:\r\n st = input()\r\n except:\r\n break\r\n if st == \"++X\" or st == \"X++\":\r\n count += 1\r\n if st == \"--X\" or st == \"X--\":\r\n count -= 1\r\nprint(count)", "#https://codeforces.com/contest/282/problem/A (strings, if statements)\r\nn = int(input())\r\nnum = 0\r\nfor i in range(n):\r\n s = input()\r\n if \"+\" in s:\r\n num+=1\r\n else:\r\n num-=1\r\nprint(num)", "from collections import \r\nfrom heapq import \r\nfrom math import \r\nimport sys \r\n# import threading\r\ndef get_int():\r\n return int(input())\r\ndef get_list():\r\n return list(map(int, input().split()))\r\ndef main():\r\n test = get_int()\r\n ans = 0\r\n for _ in range(test):\r\n string = input()\r\n if string[:2] == '++' or string[1:] == '++':\r\n ans += 1\r\n else:\r\n ans -= 1\r\n print(ans)\r\n # n = get_int()\r\n # a = get_list()\r\n # b = get_list()\r\nimport sys\r\nimport threading\r\nmain_threading = threading.Thread(target=main)\r\nmain_threading.start()\r\nmain_threading.join()\r\n\r\n\r\n", "n = int(input())\r\nx = 0\r\nfor _ in range(n):\r\n statement = list(map(str, input().strip()))\r\n if statement[1] == \"+\":\r\n x += 1\r\n elif statement[1] == \"-\":\r\n x -= 1\r\nprint(x)\r\n", "n = int(input())\r\nf = 0\r\n\r\nfor i in range(n):\r\n s = input()\r\n\r\n if s == \"++X\" or s == \"X++\":\r\n f += 1\r\n elif s == \"--X\" or s == \"X--\":\r\n f -= 1\r\n\r\nprint(f)\r\n", "n=int(input())\r\nvar=0\r\nfor i in range(n):\r\n x=input()\r\n if x==(\"++X\"):\r\n var=var+1\r\n elif x==(\"--X\"):\r\n var=var-1\r\n elif x==(\"X++\"):\r\n var=var+1\r\n else:\r\n var=var-1\r\nprint(var)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n stringInput = input()\r\n if \"+\" in stringInput:\r\n count += 1\r\n if \"-\" in stringInput:\r\n count -= 1\r\n\r\nprint(count)", "n = int(input())\r\nx = int(0)\r\nfor i in range(n):\r\n st=str(input())\r\n if st[1]=='+':\r\n x += 1\r\n else:\r\n x -=1\r\nprint(x)", "# from get import Inputer\n\n# input_ = Inputer()\n\n\nx = 0\nn = int(input())\n\nwhile n:\n statement = input()\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n n -= 1\n\n# input_.close()\nprint(x)\n", "ans=0\r\nfor _ in range(int(input())):\r\n s=input()\r\n if s==\"X++\" or s==\"++X\": ans+=1\r\n else: ans-=1\r\nprint(ans) ", "ops = int(input())\r\nn = 0\r\nsents = []\r\nfor op in range(ops):\r\n sents.append(input())\r\nfor sent in sents:\r\n if '+' in sent:\r\n n += 1\r\n else:\r\n n -= 1\r\nprint(n)", "def solve():\r\n c = 0\r\n for _ in range(int(input())):\r\n s = input()\r\n if '+' in s:\r\n c += 1\r\n else:\r\n c -= 1\r\n return c\r\nprint(solve())", "n = int(input())\r\nx = 0 # Initial value of x\r\n\r\nfor _ in range(n):\r\n statement = input()\r\n \r\n if \"++\" in statement:\r\n x += 1\r\n else: # \"--\" is the only other option\r\n x -= 1\r\n\r\nprint(x)\r\n", "k=int(input())\r\nx=0\r\nfor i in range(k):\r\n s=input()\r\n for j in s:\r\n if j=='+':\r\n x+=1\r\n break\r\n if j=='-':\r\n x-=1\r\n break\r\nprint(x)\r\n", "n = int(input())\r\nx = 0\r\nd = []\r\nfor j in range(n): d.append(input('').lower().replace('x',''))\r\nfor i in d:\r\n if i=='++': x+=1\r\n elif i=='--': x-=1\r\n else: pass\r\nprint(x)", "case_num=int(input())\nx=0\nfor i in range(case_num):\n n= input()\n if n==\"--X\" or n=='X--':\n x-=1\n if n=='X++' or n=='++X':\n x+=1\nprint(x)\n\t \t \t \t \t \t \t\t\t\t \t \t \t\t \t \t", "# Read the number of statements\nn = int(input())\n\n# Initialize the variable x to 0\nx = 0\n\n# Loop through each statement\nfor i in range(n):\n # Read the statement\n statement = input()\n \n # Check if the statement contains ++\n if \"++\" in statement:\n # Increment x by 1\n x += 1\n \n # Check if the statement contains --\n elif \"--\" in statement:\n # Decrement x by 1\n x -= 1\n\n# Print the final value of x\nprint(x)\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", "x = 0\r\nn = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nfor i in s:\r\n if i == \"X++\" or i == \"++X\":\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)", "n = int(input())\r\nx = 0\r\nfor _ in range(n):\r\n op = input()\r\n if op[1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)\r\n", "a=int(input())\r\ns=0\r\nfor i in range(a):\r\n b=input()\r\n if \"+\" in b:\r\n s+=1\r\n else:\r\n s-=1\r\nprint(s)", "statements = int(input())\r\nfinal_x = 0\r\n\r\nfor x in range(statements):\r\n given=input()\r\n if \"+\" in given:\r\n final_x+=1\r\n else:\r\n final_x-=1\r\n\r\nprint(final_x)", "a=[]\r\nx=0\r\nfor _ in range(int(input())):\r\n s=set(input())\r\n for i in s:\r\n if i=='+':\r\n x+=1\r\n if i=='-':\r\n x-=1\r\nprint(x)\r\n\r\n \r\n", "import sys\r\nfrom typing import List\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 sys.stdin.readline().strip().split()]\r\ndef LF(): return [float(x) for x in sys.stdin.readline().strip().split()]\r\ndef MI(): return map(int, sys.stdin.readline().strip().split())\r\ndef LI(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef LS(): return sys.stdin.readline().strip().split()\r\ndef I(): return int(sys.stdin.readline().strip())\r\ndef F(): return float(sys.stdin.readline().strip())\r\ndef S(): return sys.stdin.readline().strip()\r\n\r\ndef debug(args):\r\n print(args, file=sys.stderr)\r\n\r\n\r\ndef main():\r\n ans = 0\r\n n = I()\r\n for _ in range(n):\r\n s = S()\r\n ans = ans + 1 if s[1] == '+' else ans - 1\r\n\r\n print(ans)\r\n #debug(\"THIS IS A DEBUG \", ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "x =int (input())\r\nz = 0\r\nfor i in range(x) :\r\n y =input()\r\n if (y == \"X++\" or y == \"++X\"):\r\n z+=1\r\n elif( y == \"X--\" or y == \"--X\"):\r\n z-=1\r\nprint(z)", "ash=int(input())\r\nx=0\r\nfor i in range(ash):\r\n sd=input()\r\n if (sd[1]=='+'):\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "n = int(input())\nsum = 0\nfor i in range(n):\n if \"++\" in input():\n sum += 1\n else:\n sum -= 1\nprint(sum)", "n = int(input())\r\n\r\nx = 0\r\nfor i in range(n):\r\n y = str(input())\r\n if y == '++X' or y == 'X++':\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)", "t=int(input())\r\nx=0\r\nfor i in range(t):\r\n\ta=input()\r\n\tif(a.count(\"+\")>=1):\r\n\t\tx+=1\r\n\telif(a.count(\"-\")>=1):\r\n\t\tx-=1\r\nprint(x)", "pasos = int(input())\r\n\r\nx = 0\r\n\r\nfor i in range(pasos):\r\n i = input()\r\n if \"++\" in i:\r\n x += 1\r\n if \"--\" in i:\r\n x -= 1\r\nprint(x)", "n= int(input())\r\nl1=[]\r\nsums=0\r\nsubs=0\r\nfor i in range(n):\r\n x= input()\r\n l1.append(x)\r\nfor j in l1:\r\n if j==\"X++\" or j==\"++X\":\r\n sums+=1\r\n elif j==\"--X\" or j==\"X--\":\r\n subs-=1\r\n\r\nprint(subs+sums)", "n=int(input())\r\n\r\np=int(0)\r\nfor i in range(n):\r\n X=str(input())\r\n if X==\"++X\" or X==\"X++\":\r\n p=p+1\r\n elif X==\"--X\" or X==\"X--\":\r\n p=p-1\r\nprint(p)", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n s = input()\r\n if '+' in s:\r\n k+=1\r\n else:\r\n k-=1\r\nprint (k)\r\n \r\n\r\n", "n = int(input())\nx = 0\nfor _ in range(n):\n str = input()\n if str[1]=='+':\n x += 1\n else:\n x -=1\nprint(x) \n \t\t\t \t\t \t \t \t \t\t \t\t\t \t", "operations=int(input())\r\nx=0\r\nfor i in range(operations):\r\n bruh=input()\r\n if '++' in bruh:\r\n x+=1\r\n elif '--' in bruh:\r\n x-=1\r\nprint(x)", "n = input()\nn = int(n)\nx = 0\nfor i in range (n):\n s = input()\n s = str(s)\n if s == \"++X\" or s == \"X++\":\n x += 1\n else:\n x -= 1\nprint(x)\n \t \t \t\t\t\t\t \t\t\t\t \t \t\t\t\t \t\t\t\t\t\t", "n=int(input())\r\nl=[]\r\nx=0\r\nfor i in range(n):\r\n l.append(input().lower())\r\nfor i in l:\r\n if i==\"x++\":\r\n x+=1\r\n if i==\"++x\":\r\n x+=1\r\n if i==\"--x\":\r\n x-=1\r\n if i==\"x--\":\r\n x-=1\r\nprint(x)", "x=0\r\nn = int(input())\r\nfor _ in range(n):\r\n if '++' in input():\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "sum=0\r\nt=int(input())\r\nfor _ in range(t):\r\n s=input()\r\n if(s[1]=='+'):\r\n sum+=1\r\n else:\r\n sum-=1\r\nprint(sum)", "a=int(input())\r\nk=0\r\nfor i in range(a):\r\n b=input()\r\n if b=='--X' or b=='X--':\r\n k-=1\r\n else:\r\n k+=1\r\nprint(k)\r\n", "from sys import stdin\r\n\r\ns = [i.rstrip('\\n') for i in stdin]\r\nm = s[0]\r\ndel s[0]\r\n\r\ndef f(sp):\r\n x = 0\r\n for i in sp:\r\n if '++' in i:\r\n x += 1\r\n else:\r\n x -= 1\r\n return x\r\nprint(f(s))", "n = int(input())\r\nx=0\r\nfor _ in range(n):\r\n statement = input()\r\n if \"++\" in statement:\r\n x+=1\r\n elif \"--\" in statement:\r\n x-=1\r\nprint(x) ", "n= int(input())\r\nX = 0\r\nwhile n>0:\r\n str = input()\r\n if str == \"X++\" or str == \"++X\":\r\n X+=1\r\n elif str == \"X--\" or str == \"--X\":\r\n X-=1\r\n else:\r\n x = 0\r\n n=n-1\r\nprint(X)", "a = int(input())\r\nresult = 0\r\nfor i in range(a):\r\n step = input()\r\n if step == \"++X\" or step == \"X++\":\r\n result += 1\r\n else:\r\n result -= 1\r\nprint(result)", "# A 486 - Bit++ - Codeforces\r\n# Link : https://codeforces.com/contest/282/problem/A\r\n\r\nnumberOfStatements = int(input())\r\n\r\ncounter = 0\r\n\r\nfor i in range(numberOfStatements):\r\n statement = input()\r\n if \"+\" in statement:\r\n counter += 1\r\n else:\r\n counter -= 1\r\n\r\nprint(counter)\r\n", "n=int(input())\r\na=[]\r\nx=0\r\nfor i in range (n):\r\n y=input()\r\n a.append(y)\r\nfor i in range(n):\r\n if a[i]=='X++' or a[i]=='++X':\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)\r\n", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n\top=input()\r\n\tif op=='++X' or op=='X++':\r\n\t\tx+=1\r\n\telif op=='--X' or op=='X--':\r\n\t\tx-=1\r\nprint(x)", "n = int(input())\r\nc = 0\r\nfor i in range(n):\r\n x = input()\r\n if x == \"++X\" or x == \"X++\":\r\n c += 1\r\n elif x == \"--X\" or x == \"X--\":\r\n c -= 1\r\nprint(c)\r\n", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n li=[i for i in input()]\r\n if \"+\" in li:\r\n ans+=1\r\n else:\r\n ans-=1\r\nprint(ans)", "operation_number = int(input())\r\n\r\noperations = []\r\n\r\nwhile operation_number > 0:\r\n\r\n operation = input()\r\n operations.append(operation)\r\n\r\n operation_number -= 1\r\n\r\n\r\nsum_counter, subs_counter = 0, 0\r\n\r\nfor operation in operations:\r\n\r\n if \"+\" in operation:\r\n\r\n sum_counter += 1\r\n\r\n else: subs_counter += 1\r\n\r\n\r\nprint(sum_counter - subs_counter)", "StepNo = int(input())\r\nvalue = 0\r\n\r\nfor i in range(StepNo):\r\n instruction = input()\r\n if instruction == \"++X\" or instruction == \"+X+\" or instruction == \"X++\":\r\n value = value + 1\r\n elif instruction == \"--X\" or instruction == \"-X-\" or instruction == \"X--\":\r\n value = value - 1\r\nprint(value)\r\n", "n=int(input())\r\na=0\r\nfor i in range(n):\r\n c=input()\r\n if c==\"++X\" or c==\"X++\":\r\n a=a+1\r\n elif c==\"X--\" or c==\"--X\":\r\n a=a-1\r\nprint(a)", "\r\nnumber = int(input())\r\ncount = 0 \r\nfor i in range (number): \r\n operation = str(input())\r\n if operation[0] == '+' or operation[len(operation)-1] == '+': \r\n count +=1 \r\n elif operation[0] == '-' or operation[len(operation) -1 ]== '-':\r\n count -=1 \r\nprint (count)", "t=int(input())\r\nx=0\r\nwhile t:\r\n a=input()\r\n if a[1]=='+':\r\n x=x+1\r\n else:\r\n x=x-1\r\n t=t-1\r\nprint(x)", "n = int(input())\r\n\r\nstrings = []\r\n\r\nfor x in range(n):\r\n a = list(map(str,input())) \r\n strings.append(a)\r\n \r\n\r\nresultX = 0\r\n\r\nfor x in range(len(strings)):\r\n if strings[x][1] == '+' or strings[x][2] == '+':\r\n resultX += 1\r\n\r\n \r\n elif strings[x][1] == '-' or strings[x][2] == '-':\r\n resultX -= 1\r\n \r\nprint(resultX)", "a=int(input())\r\ncount=0\r\nfor i in range(1,a+1):\r\n x=str(input())\r\n if x[0]==x[1]=='+' or x[1]==x[2]=='+':\r\n count+=1\r\n elif x[0]==x[1]=='-' or x[1]==x[2]=='-':\r\n count-=1\r\nprint(count)", "pos = 0\r\nneg = 0\r\n\r\nfor _ in range(int(input())):\r\n st = input()\r\n if \"+\" in st:\r\n pos += 1\r\n elif \"-\" in st:\r\n neg += 1\r\n else:\r\n pass\r\n\r\nprint(pos-neg)", "n = int(input())\nx = 0\nfor i in range(n):\n y = input()\n if \"++\" in y:\n x += 1\n elif \"--\" in y:\n x -= 1\nprint(x)\n\t\t \t\t\t \t\t \t\t\t\t\t \t\t \t \t\t\t \t", "res = 0\r\nfor _ in range(int(input())):\r\n line = input()\r\n if '+' in line:\r\n res += 1\r\n else:\r\n res -= 1\r\nprint(res)", "vlue = 0\r\n\r\nn = input()\r\n\r\nn = int(n)\r\n\r\nfor i in range(n):\r\n st_ment = input()\r\n if st_ment == \"--X\" or st_ment == \"X--\":\r\n vlue -= 1\r\n elif st_ment == \"++X\" or st_ment == \"X++\":\r\n vlue += 1\r\n\r\nprint(vlue)", "n = int(input())\r\nList = []\r\nx = 0\r\nfor i in range(n):\r\n List.append(input())\r\nfor num in List:\r\n if (num == \"++X\") or (num == \"X++\"):\r\n x += 1 \r\n elif (num == \"--X\") or (num == \"X--\"):\r\n x -= 1 \r\nprint(x)", "n=int(input())\r\ni=0\r\nx=0\r\nscore=0\r\nfullscore=0\r\ncmds = []\r\nwhile(i<n):\r\n w=str(input())\r\n cmds.append(w)\r\n i=i+1\r\ni=0\r\nwhile(i<n):\r\n if(\"++\" in cmds[i]):\r\n x=x+1\r\n elif(\"--\" in cmds[i]):\r\n x=x-1\r\n\r\n i=i+1\r\nprint(x)\r\n", "n = int(input())\nans = 0\nfor i in range(0,n):\n s = input()\n if s[1] == '+':\n ans += 1\n \n if s[1] == '-':\n ans -= 1\n \nprint(ans)", "n=int(input())\r\nx=0\r\nfor c in range(n):\r\n a=input()\r\n v=[s for s in a]\r\n for i in v:\r\n if i=='+':\r\n x+=1\r\n break\r\n if i=='-':\r\n x-=1\r\n break\r\nprint(x)", "x = 0\r\nn = int(input())\r\nwhile n != 0:\r\n bit_input = list(input())\r\n if bit_input.count('+') > 1:\r\n x+=1\r\n elif bit_input.count('-') > 1:\r\n x-=1\r\n n-=1\r\nprint(x)", "n= int(input())\r\nx=0\r\nfor i in range(n):\r\n opn=input()\r\n if (opn==\"++X\" or opn==\"X++\") :\r\n x+=1\r\n if (opn==\"--X\" or opn==\"X--\"):\r\n x-=1\r\nprint(x)", "x = int(input())\r\nans = 0\r\nwhile x > 0:\r\n x -= 1\r\n a = input()\r\n if a[1] == '+':\r\n ans += 1\r\n else:\r\n ans -= 1\r\nprint(ans)", "x = 0\r\nfor _ in range(int(input())):\r\n x = x + 1 if '+' in input() else x - 1\r\nprint(x)", "n = int(input())\r\ntotal = 0\r\nfor i in range(n) :\r\n a = input()\r\n if a == '++X' or a == 'X++' :\r\n total = total + 1\r\n elif a == '--X' or a == 'X--' :\r\n total = total - 1\r\nprint(total)", "def valueOfX(arr):\n x = 0\n for i in arr:\n if(i == \"++X\" or i == \"X++\"):\n x += 1\n elif(i == \"--X\" or i == \"X--\"):\n x -= 1\n print(x)\n \nn = int(input())\narr = []\nfor i in range(n):\n arr.append(input())\n\nvalueOfX(arr)\n \t \t\t\t\t\t\t\t \t\t\t \t\t\t\t \t", "def calc(n, x, arr, i):\r\n if n == 0:\r\n return x\r\n if '++' in arr[i]:\r\n return calc(n-1, x+1, arr, i + 1)\r\n else:\r\n return calc(n-1, x-1, arr, i+1)\r\n\r\n\r\nn = int(input())\r\narr = []\r\nfor _ in range(n):\r\n s = input()\r\n arr.append(s)\r\nprint(calc(n, 0, arr, 0))", "y = int(input())\r\nx= 0\r\nfor i in range(y):\r\n \r\n a = str(input())\r\n if a == '++X' or a ==\"X++\":\r\n x+=1\r\n if a == '--X' or a ==\"X--\":\r\n x -= 1\r\nprint(x)", "t=int(input())\r\ndef bit(operation):\r\n answer = 0\r\n for i in range(t):\r\n operation = input()\r\n if operation == \"X++\" or operation == \"++X\":\r\n answer += 1\r\n elif operation == \"X--\" or operation == \"--X\":\r\n answer -= 1\r\n return answer\r\nprint(bit(t))", "n = int(input())\r\nx = 0\r\n\r\nfor i in range(n):\r\n op = input()\r\n if (op == \"X++\") or (op == \"++X\"):\r\n x += 1\r\n elif (op == \"X--\") or (op == \"--X\"):\r\n x -= 1\r\n \r\nprint(x)", "n=int(input())\r\nsum=int(0)\r\nfor i in range(n):\r\n q=input()\r\n if q.count('-')>0: sum = sum - 1\r\n else: sum = sum + 1\r\nprint(sum)", "n= int(input())\r\nx=0\r\nfor i in range(n):\r\n s= input()\r\n if(s[1]=='+'):\r\n x=x+1\r\n else:\r\n x=x-1\r\n\r\nprint(x)", "t = int(input())\ncount = 0\nfor i in range(t):\n s = input()\n if s == \"++X\" or s == \"X++\":\n count += 1\n else:\n count -= 1 \n \nprint(count) ", "count=0\r\nfor i in range(int(input())):\r\n s=input()\r\n if s[1]=='+':\r\n count+=1\r\n elif s[1]=='-':\r\n count-=1\r\nprint(count) ", "n=int(input())\r\nx=0\r\nfor _ in range(n):\r\n c=input()\r\n if '++' in str(c):\r\n x+=1\r\n elif '--' in str(c):\r\n x-=1\r\nprint(x)", "ans = 0\r\nfor _ in range(int(input())):\r\n ans += 1 if input().__contains__('++') else -1\r\nprint(ans)", "n =int(input())\r\nj=0\r\nfor i in range(1,n+1):\r\n k=input()\r\n if(k=='++X' or k=='X++'):\r\n j+=1\r\n elif(k=='--X' or k=='X--'):\r\n j+=-1\r\nprint(j)", "n = int(input())\r\nresult = 0\r\nwhile n > 0:\r\n \r\n if '+' in input():\r\n result += 1\r\n else:\r\n result -= 1\r\n n -= 1\r\nprint(result)", "n = int(input())\n\nwhile n < 1 or n > 150 : \n n = int(input())\n\noprations = []\nfor i in range(n):\n myOp = input()\n oprations.append(myOp)\nX = 0\nfor opration in oprations : \n if opration == '++X' or opration == 'X++':\n X += 1\n else: \n X -= 1\nprint(X)\n\t \t\t\t \t\t\t \t \t \t\t\t \t \t\t\t\t\t", "n = int(input())\r\nX= 0\r\nfor i in range(n):\r\n line=input()\r\n if line.count(\"+\") == 2 :\r\n X+=1\r\n elif line.count(\"-\") == 2 :\r\n X-=1\r\nprint(X)\r\n \r\n ", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n c = input()\r\n if \"+\" in c:\r\n s += 1\r\n elif \"-\" in c:\r\n s -= 1\r\nprint(s)", "x=0\r\nfor _ in range(int(input())):\r\n s=input()\r\n if (s==\"X++\" or s==\"++X\"):\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)\r\n", "tem=int(input())\nz=0\nfor _ in range(tem):\n\tstr=input()\n\tif '++' in str:\n\t\tz+=1\n\telse:\n\t\tz-=1\nprint(z)\n \t \t \t\t \t\t \t \t \t\t\t\t\t \t\t", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n value=input()\r\n if \"+\" in value:\r\n x=x+1\r\n elif \"-\" in value:\r\n x=x-1\r\n\r\nprint(x)", "# import sys;input=sys.stdin.readline\r\n# import math\r\n\r\ndef yes(ch='\\n'):\r\n print(\"YES\",end=ch)\r\n return \r\n\r\ndef no(ch='\\n'):\r\n print(\"NO\",end=ch)\r\n return \r\n\r\n\r\ndef solve():\r\n n=int(input())\r\n ans=0\r\n for i in range(n):\r\n s=str(input())\r\n if '+' in s:\r\n ans+=1\r\n else:\r\n ans-=1\r\n print(ans)\r\n \r\n\r\n\r\n# for _ in range(int(input())):\r\nsolve()", "# The Code \r\n\r\nnum = int(input())\r\nx = 0\r\nfor n in range(num):\r\n statment = input()\r\n if \"++X\" in statment or \"X++\" in statment:\r\n x += 1\r\n elif \"--X\" in statment or \"X--\" in statment:\r\n x -= 1\r\nprint(x)\r\n\r\n# The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.\r\n\r\n#The language is that peculiar as it has exactly one variable, called x. Also, there are two operations:\r\n\r\n#Operation ++ increases the value of variable x by 1.\r\n#Operation -- decreases the value of variable x by 1.\r\n#A statement in language Bit++ is a sequence, consisting of exactly one operation and one variable x. The statement is written without spaces, that is, it can only contain characters \"+\", \"-\", \"X\". Executing a statement means applying the operation it contains.\r\n\r\n#A programme in Bit++ is a sequence of statements, each of them needs to be executed. Executing a programme means executing all the statements it contains.\r\n\r\n#You're given a programme in language Bit++. The initial value of x is 0. Execute the programme and find its final value (the value of the variable when this programme is executed).\r\n\r\n#Input\r\n#The first line contains a single integer n (1 ≤ n ≤ 150) — the number of statements in the programme.\r\n\r\n#Next n lines contain a statement each. Each statement contains exactly one operation (++ or --) and exactly one variable x (denoted as letter «X»). Thus, there are no empty statements. The operation and the variable can be written in any order.\r\n\r\n#Output\r\n#Print a single integer — the final value of x.\r\n\r\n\r\n \r\n \r\n ", "n = int(input())\r\n\r\nlst = []\r\n\r\nfor i in range(1, n+1):\r\n lst.append(input())\r\n\r\nx = 0\r\nplus = ['X++', '++X']\r\nfor i in lst:\r\n if i in plus:\r\n x += 1\r\n else:\r\n x = x - 1\r\n\r\nprint(x)", "t = int(input()) \r\nx = 0 \r\nfor _ in range(t) :\r\n statement = input() \r\n if \"++\" in statement :\r\n x+=1 \r\n else :\r\n x-=1 \r\nprint(x) ", "n = int(input())\r\noperation = []\r\nx = 0\r\nfor i in range(n):\r\n operation.append(input())\r\nfor i in operation:\r\n if i == '++X' or i == 'X++':\r\n x += 1\r\n elif i== '--X' or i == 'X--':\r\n x -= 1\r\nprint(x)", "n = int(input())\r\nx = 0\r\nfor i in range(n) :\r\n statement =input()\r\n if \"++\" in statement :\r\n x+=1\r\n else :\r\n x-=1\r\nprint(x)", "n = int(input())\r\nx = 0\r\nfor a in range(1, n+1):\r\n b = str(input())\r\n if b == \"++X\" or b ==\"X++\" or b == \"+X+\":\r\n x += 1\r\n elif b==\"--X\" or b==\"-X-\" or b==\"X--\":\r\n x -= 1\r\n else:\r\n x = 0\r\n\r\nprint(x)", "t=int(input())\r\nk=0\r\nfor i in range(t):\r\n s=input()\r\n if s[1]=='+':\r\n k+=1\r\n else:\r\n k-=1\r\nprint(k)", "# Read the number of statements in the program\nn = int(input())\n\n# Initialize the variable x to 0\nx = 0\n\n# Execute each statement in the program\nfor _ in range(n):\n statement = input()\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n\n# Print the final value of x\nprint(x)#er\n \t\t \t \t\t\t \t\t \t\t \t \t", "n = int(input())\r\nans = 0\r\nfor i in range (n):\r\n\tnum = input()\r\n\tif '++' in num: ans += 1\r\n\telse : ans -= 1\r\n\r\n\r\nprint(ans)\r\n", "def bit(n):\r\n total = 0\r\n if len(n) == 3 and '++' in n and 'X' in n:\r\n total += 1\r\n elif len(n) == 3 and '--' in n and 'X' in n:\r\n total -= 1\r\n return total\r\n\r\nx = 0 \r\nn = int(input())\r\nfor i in range(n):\r\n operation = input()\r\n x += bit(operation)\r\nprint(x)\r\n \r\n", "pl = 0\r\nmi = 0\r\nfor i in range(int(input())):\r\n op = input()\r\n if \"++\" in op:\r\n pl += 1\r\n continue\r\n mi += 1\r\nprint(pl - mi)\r\n", "a=int(input())\r\nb=0\r\nfor i in range(a):\r\n d=input()\r\n if d[1]==\"+\":\r\n b+=1\r\n else:\r\n b-=1\r\nprint(b)", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n ele=input()\r\n if ele[1]==\"+\":\r\n ans+=1\r\n else:\r\n ans-=1\r\n \r\nprint(ans)", "number=int(input())\r\ncount=0\r\nfor i in range(number):\r\n string=str(input())\r\n if string[0]==\"+\" or string[len(string)-1]=='+':\r\n count+=1\r\n elif(string[0]=='-' or string[len(string)-1]=='-'):\r\n count-=1\r\nprint(count)", "# Read the number of statements\nn = int(input())\n\n# Initialize the variable x\nx = 0\n\n# Iterate through each statement and update the value of x\nfor _ in range(n):\n statement = input()\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n\n# Print the final value of x\nprint(x)\n", "n=int(input())\r\nx=0\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\n if a[i]=='++X' or a[i]=='X++' or a[i]=='+X+':\r\n x+=1\r\n elif a[i]=='--X' or a[i]=='X--' or a[i]=='-X-':\r\n x-=1\r\nprint(x)", "ans=0\r\nfor _ in range(int(input())):\r\n s=input()\r\n if s[1]=='+':\r\n ans+=1\r\n else:\r\n ans-=1\r\nprint(ans)", "n=0\nwhile(1):\n n=int(input())\n if n>=1 and n<=150:\n break\n\noperate=[]\n\nfor i in range(n):\n operate.append(input())\n\nX=0\nfor i in range(n):\n\n if operate[i]==\"X++\" or operate[i]==\"++X\":\n X=X+1\n elif operate[i]==\"--X\" or operate[i]==\"X--\":\n X=X-1\n\nprint(X)\n\n\n", "n = int(input())\r\nx = 0\r\n\r\nfor _ in range(n):\r\n y = input()\r\n if '--' in y:\r\n x-=1\r\n if '++' in y:\r\n x+=1\r\n\r\nprint(x)", "n=int(input())\r\nx=0;\r\nwhile(n>0):\r\n s=input()\r\n if(s[0]==\"-\"):\r\n x=x-1\r\n elif(s[0]==\"+\"):\r\n x=x+1\r\n elif(s[2]==\"-\"):\r\n x=x-1\r\n else:\r\n x=x+1\r\n n=n-1\r\n \r\nprint(x)", "n = int(input())\r\na=[]\r\nX=0\r\nfor e in range(n):\r\n x=str(input())\r\n a.append(x)\r\nfor i in range(len(a)):\r\n if (a[i][1]) == '-':\r\n X-=1\r\n elif (a[i][1]) == '+':\r\n X+=1\r\nprint(X)\r\n", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n str=input()\r\n if \"++\" in str:\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "a=int(input())\r\nans=0\r\nfor i in range(a):\r\n b=input()\r\n if (b==\"X++\" or b==\"++X\" or b==\"+X+\"):\r\n ans=ans+1\r\n else:\r\n ans=ans-1\r\nprint(ans)", "import sys\r\n\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nX = 0\r\nfor _ in range(n):\r\n s = input()\r\n X += 1 if \"++\" in s else -1\r\nprint(X)", "n=int(input())\r\ns=0\r\na=[]\r\nfor i in range(n):\r\n b=input()\r\n a.append(b)\r\n if '+' in b:\r\n s=s+1\r\n if '-' in b:\r\n s=s-1\r\nprint(s)", "n = int(input())\r\nx = 0\r\nfor i in range(n):\r\n text = input()\r\n if text == '++X' or text == 'X++':\r\n x += 1\r\n elif text == '--X' or text == 'X--':\r\n x -= 1\r\nprint(x)", "inp1 = int(input())\r\nct = 0\r\nfor i in range(inp1):\r\n inp = input()\r\n if \"++\" in inp:\r\n ct += 1\r\n if \"--\" in inp:\r\n ct -= 1\r\nprint(ct)", "x=0\r\nfor i in range(int(input())):\r\n n=input()\r\n \r\n if \"+\" in n :\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n tx = input()\r\n if tx == 'X++' or tx == '++X':\r\n count += 1\r\n elif tx == 'X--' or tx == '--X':\r\n count -= 1\r\nprint(count)", "n=int(input())\r\ncount=0\r\na=\"++X\"\r\nb=\"--X\"\r\nc=\"X++\"\r\nd=\"X--\"\r\nfor i in range(n):\r\n x=input()\r\n if x==a or x==c:\r\n count+=1\r\n elif x==b or x==d:\r\n count=count-1\r\nprint(count)\r\n", "print(sum(1-2('-'in s)for s in[open(0)][1:]))\r\n", "import sys\r\nres=0\r\nn=int(sys.stdin.readline().split()[0])\r\nfor i in range (n):\r\n m=(sys.stdin.readline())\r\n if m.count(\"++\"):\r\n res+=1\r\n else:\r\n res-=1\r\nprint(res)\r\n ", "\r\n\r\nn = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n op = input()\r\n if \"+\" in op:\r\n ans += 1\r\n else:\r\n ans -= 1\r\n\r\nprint(ans)", "n = int(input())\r\nx = 0\r\nfor i in range(n):\r\n s = input()\r\n if (s ==\"X++\"or s==\"++X\"):\r\n x = x+1 \r\n else :\r\n x = x-1\r\nprint(x)", "n=int(input())\r\nr=0\r\nfor i in range(n):\r\n s=input()\r\n \r\n for i in s:\r\n if i=='+':\r\n r+=1\r\n break\r\n if i=='-':\r\n r-=1\r\n break\r\nprint(r)", "n=int(input())\r\ns=[]\r\nfor i in range (n):\r\n x=input().lower()\r\n for a in x :\r\n if a == \"+\" or a == \"-\":\r\n s.append(a)\r\nn1=(s.count(\"+\"))\r\nn2=(s.count(\"-\"))\r\nif n1>= n2 or n2 > n1:\r\n print(int ((n1-n2)/2 ))\r\nelif n1 >0 and n2== 0 :\r\n print(int (n1/2 ))\r\nelif n2>0 and n1 == 0:\r\n print(-1 * int ((n2/2)))", "n = int(input())\r\nans = 0\r\nwhile n > 0:\r\n query = input()\r\n if query == 'X++' or query == '++X':\r\n ans += 1\r\n else:\r\n ans -= 1\r\n n -= 1\r\nprint(ans)", "n=int(input())\r\nx=0.0\r\nfor i in range(n):\r\n string=input()\r\n for char in string:\r\n if char == '+':\r\n x+=0.5\r\n if char == '-':\r\n x-=0.5\r\nprint(int(x))\r\n\r\n\r\n", "a=int(input())\r\ncount=0\r\nfor i in range(a):\r\n y=input()\r\n if (y==\"X++\" or y==\"++X\"):\r\n count+=1\r\n if (y==\"X--\" or y==\"--X\"):\r\n count-=1\r\nprint(count)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n b=input()\r\n if b[1]==\"+\":\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)\r\n ", "k=int(input())\r\nx=0\r\nfor i in range(k):\r\n t=input()\r\n if '++X' in t or 'X++' in t:\r\n x=x+1\r\n elif '--X' in t or 'X--' in t:\r\n x=x-1\r\nprint(x)", "def main():\n\n num_of_lines = int(input())\n\n X = 0\n\n for i in range(num_of_lines):\n\n line = input()\n if \"+\" in line:\n X += 1\n\n else:\n X -= 1\n\n print(X)\n\nmain()\n \t\t \t \t\t \t\t\t \t\t \t\t\t \t\t", "s=0\r\nfor _ in range(int(input())):\r\n a=input()\r\n if \"+\" in a:\r\n s+=1\r\n else:\r\n s-=1\r\nprint(s)", "#!/usr/bin/env pypy3\n# https://codeforces.com/problemset/problem/282/A\nn, x = int(input()), 0\nwhile n:\n n -= 1\n command = input()\n if command == \"++X\" or command == \"X++\":\n x += 1\n else:\n x -= 1\nprint(x)\n", "n = int(input())\r\n\r\ncount = 0\r\nfor i in range(n):\r\n com = input()\r\n if com[0]==\"+\" or com[1]==\"+\" or com[2]==\"+\":\r\n count+=1\r\n else:\r\n count-=1\r\n\r\nprint(count)", "'''\r\nwhile(True):\r\n\tdef One_Digit(n):\r\n\t\twhile(n>=10):\r\n\t\t\tn=sum(int(digit)\r\n\t\t\tfor(digit) in str(n))\r\n\t\treturn(n)\r\n\tn=int(input(\"Введите число:\"))\r\n\tif(n>0 and n<1000000000000):\r\n\t\totvet=One_Digit(n)\r\n\t\tprint(\"Сумма цифр:\",otvet)\r\n\tif(n>1000000000000):\r\n\t\tprint(\"Число должно быть меньше 1000000000000!\")\r\n\tif(n<0):\r\n\t\tprint(\"Число должно быть положительным!\")\r\n'''\r\n'''\r\nwhile(True):\r\n\tx=int(input(\"Введите число:\"))\r\n\tif(x%6==0 and x<360):\r\n\t\totv=60-x/6\r\n\t\tprint(\"Минут осталось:\",int(otv))\r\n\tif(x>360):\r\n\t\tprint(\"Число должно быть меньше 360!\")\r\n\tif(x%6):\r\n\t\tprint(\"Число должно делиться на шесть!\")\r\n'''\r\n'''\r\nwhile(True):\r\n\tn=int(input(\"Введите число:\"))\r\n\totv=n+2\r\n\tprint(\"Можно насчитать\",otv,\"ног(и)\")\r\n'''\r\n'''\r\nwhile(True):\r\n\tindex=int(input(\"Введите индекс:\"))\r\n\tindex_str=str(index)\r\n\tindex_len=len(index_str)\r\n\tif(index_len==6 and index_len<1000000000):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n'''\r\n'''\r\nwhile(True):\r\n\tindex=input(\"Введите число:\")\r\n\tif(len(index) == 6 and index.isdigit()):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n'''\r\n'''\r\nwhile(True):\r\n\tprint(\"1.Введите количество столбиков на которых держится забор.\")\r\n\tprint(\"2.Введите сколько дощечек в каждой секции забора.\")\r\n\tN,K=input(\">>>\").split()\r\n\tn=int(N)\r\n\tk=int(K)\r\n\tif(n==3):\r\n\t\tprint(\"0\")\r\n\telif(n==4):\r\n\t\tprint(\"20\")\r\n\telse:\r\n\t\tn=n-3\r\n\t\ta=n-1\r\n\t\tL=k-1\r\n\t\tprint(20n+32a+k12a+a5L)\r\n'''\r\n'''\r\nnum1=int(input(\"Введите десятеричный формат:\"))\r\nnum2=num1/16\r\nnum3=num2/16\r\nif(num3==num3,.14):\r\n\tnum4=\"E\"\r\n\tnum5=num3/16\r\n\tprint(num5,num4,num3)\r\n'''\r\n'''\r\nwhile(True):\r\n\tdos=int(input(\"Введите число:\"))\r\n\tprint(f'Шестнадцатеричное: {dos:X}')\r\n'''\r\n'''\r\nwhile(True):\r\n\tprint(\"1.Первые два значения-чётные.\")\r\n\tprint(\"2.Вторые два значения-нечётные.\")\r\n\ta,b,x,y=map(int,input(\">>>\").split())\r\n\tmax_int=max(a,b,x,y)\r\n\totv2_1=0\r\n\totv2_2=0\r\n\totv2_3=0\r\n\tif(max_int==a):\r\n\t\totv1=max_int+b\r\n\t\totv2=max_int+x\r\n\t\totv3=max_int+y\r\n\t\tif(otv1%2!=0):\r\n\t\t\totv2_1=otv1\r\n\t\tif(otv2%2!=0):\r\n\t\t\totv2_2=otv2\r\n\t\tif(otv3%2!=0):\r\n\t\t\totv2_3=otv3\r\n\t\totv_str=otv2_1,otv2_2,otv2_3\r\n\t\tmax_int2=max(otv_str)\r\n\t\tprint(max_int2)\r\n\tif(max_int==b):\r\n\t\totv1=max_int+a\r\n\t\totv2=max_int+x\r\n\t\totv3=max_int+y\r\n\t\tif(otv1%2!=0):\r\n\t\t\totv2_1=otv1\r\n\t\tif(otv2%2!=0):\r\n\t\t\totv2_2=otv2\r\n\t\tif(otv3%2!=0):\r\n\t\t\totv2_3=otv3\r\n\t\totv_str=otv2_1,otv2_2,otv2_3\r\n\t\tmax_int2=max(otv_str)\r\n\t\tprint(max_int2)\r\n\tif(max_int==x):\r\n\t\totv1=max_int+a\r\n\t\totv2=max_int+b\r\n\t\totv3=max_int+y\r\n\t\tif(otv1%2!=0):\r\n\t\t\totv2_1=otv1\r\n\t\tif(otv2%2!=0):\r\n\t\t\totv2_2=otv2\r\n\t\tif(otv3%2!=0):\r\n\t\t\totv2_3=otv3\r\n\t\totv_str=otv2_1,otv2_2,otv2_3\r\n\t\tmax_int2=max(otv_str)\r\n\t\tprint(max_int2)\r\n\tif(max_int==y):\r\n\t\totv1=max_int+a\r\n\t\totv2=max_int+b\r\n\t\totv3=max_int+x\r\n\t\tif(otv1%2!=0):\r\n\t\t\totv2_1=otv1\r\n\t\tif(otv2%2!=0):\r\n\t\t\totv2_2=otv2\r\n\t\tif(otv3%2!=0):\r\n\t\t\totv2_3=otv3\r\n\t\totv_str=otv2_1,otv2_2,otv2_3\r\n\t\tmax_int2=max(otv_str)\r\n\t\tprint(max_int2)\r\n'''\r\n''''\r\nwhile(True):\r\n\timport random\r\n\tx=random.choice([\"Паша\",\"Петя\"])\r\n\tinput(\"Нажмите Enter чтобы узнать кто победил в споре\")\r\n\tprint(\"В споре победил:\",x)\r\n'''\r\n'''\r\nn = int(input())\r\nprint(-1 if n <4 else(n+3)//5)\r\n'''\r\n'''\r\nn = int(input())\r\nm = int(input())\r\nif n > m:\r\n n = m\r\nL = 0\r\nR = n + 2\r\nwhile R - L > 1:\r\n mid = (L + R) // 2\r\n if (mid+n)(n-mid+1)//2>=m:\r\n L=mid\r\n else:\r\n R=mid\r\nif(L+n) * (n - L + 1) // 2 < m:\r\n print(0)\r\nelse:\r\n for i in range(R, n + 1):\r\n print(i)\r\n s=(R+n)(n-R+1)//2\r\n if(m-s>0):\r\n print(m-s)\r\n'''\r\n'''\r\nnum1,num2=map(int,input(\"\").split())\r\nnum3,num4=map(int,input(\"\").split())\r\nmin1=min(num1,num2)\r\nmin2=min(num3,num4)\r\nprint(min1+1,\",\",min2+1)\r\n'''\r\n'''\r\ndef find_min_number(N):\r\n if N == 0:\r\n return -1\r\n if N == 1:\r\n return 1\r\n digits = []\r\n for i in range(9, 1, -1):\r\n while N % i == 0:\r\n digits.append(i)\r\n N /= i\r\n if N != 1:\r\n return -1\r\n return int(''.join(map(str, digits[::-1])))\r\nN = int(input())\r\nmin_number = find_min_number(N)\r\nprint(min_number)\r\n'''\r\n'''\r\na=int(input(\"Введите число истинных заявлений:\"))\r\nb=a+1\r\nc=b+1\r\nd=c+1\r\nprint(\"Рыцарь сделал первое заявление:\",a,\"+1=\",b)\r\nprint(\"Лжец сделал заявление:\",b,\"+1=\",c)\r\nprint(\"Рыцарь сделал второе заявление:\",c,\"+1=\",d)\r\nprint(\"Ответ:\",d)\r\n'''\r\n'''\r\nn = int(input())\r\nprohods=1\r\nif(n<=6):\r\n prohods=1\r\n print(prohods)\r\nif(n>6):\r\n\tprohods+=(n-6)//4+1\r\n\tprint(prohods)\r\n'''\r\n'''\r\na=int(input(\"\"))\r\nb=int(input(\"\"))\r\nc=int(input(\"\"))\r\nd=a+b+c\r\nprint(d)\r\n'''\r\n'''\r\nn=int(input())\r\npeople=1\r\nif(n%2==0):\r\n people+=n//2-1\r\nelse:\r\n people+=(n-1)//2+3\r\nprint(people)\r\n'''\r\n'''\r\nn=int(input())\r\nt=input()\r\nupper_count=sum(1 for c in t if c.isupper())\r\nlower_count=sum(1 for c in t if c.islower())\r\nif(abs(upper_count-lower_count)<=1):\r\n print(\"JOKE\")\r\nelse:\r\n print(\"SERIOUS\")\r\n'''\r\n'''\r\nn = int(input())\r\nhouses = list(map(int, input().split()))\r\nmax_distance = houses[-1] - houses[0]\r\nfor i in range(1, n):\r\n max_distance = max(max_distance, houses[i] - houses[0], houses[-1] - houses[i])\r\nprint(max_distance)\r\n'''\r\n'''\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ndp = [0] (n+1)\r\nfor i in range(n):\r\n if arr[i] % 2 == 0:\r\n dp[1] = max(dp[1], arr[i])\r\n for j in range(i, 0, -1):\r\n if (arr[i] + dp[j]) % 2 == 0:\r\n dp[j+1] = max(dp[j+1], arr[i] + dp[j])\r\n\r\nprint(dp[1:])\r\n'''\r\n'''\r\ny=int(input(\"\"))\r\nif(y%4):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n'''\r\n'''\r\na,b,c=map(int,input(\"\").split())\r\notv1=ab\r\notv2=otv1c\r\nprint(otv2)\r\n'''\r\n'''\r\na=int(input())\r\nresult=[]\r\nfor k in range(a 10, (a + 1) * 10):\r\n for d in range(2, k + 1):\r\n if k % d == 0 and sum(int(digit) for digit in str(k)) % d == 0:\r\n result.append(k)\r\nprint(' '.join(str(num) for num in result))\r\n'''\r\n'''\r\nN = int(input())\r\nS = input()\r\n\r\nmax_troll=0\r\nmax_troll_string = \"\"\r\n\r\nfor i in range(N):\r\n for j in range(i + 1, N + 1):\r\n substring = S[i:j]\r\n if substring.count(\"A\") > 0 and substring.count(\"Z\") > 0:\r\n if len(substring) > max_troll:\r\n max_troll = len(substring)\r\n max_troll_string = substring\r\n\r\nprint(max_troll_string)\r\n'''\r\n'''\r\nn, k = map(int, input().split())\r\narray = list(map(int, input().split()))\r\n\r\ncount_divisible_two = 0\r\n\r\nfor _ in range(k):\r\n result = []\r\n for i in range(len(array)):\r\n for j in range(i + 1, len(array)):\r\n result.append(array[i] * array[j])\r\n array = result\r\n\r\nfor num in array:\r\n if num % 2 == 0:\r\n count_divisible_two += 1\r\n\r\nprint(count_divisible_two)\r\n'''\r\n'''\r\nn=int(input(\"\"))\r\nf=int(input(\"\"))\r\nif(f==0):\r\n print((n-2)*3)\r\nelif(f==1):\r\n print(6(n-2)*2)\r\nelif(f==2):\r\n print(12(n-2))\r\nelif(f==3):\r\n print(8)\r\n'''\r\n'''\r\na=int(input(\"\"))\r\nb=int(input(\"\"))\r\nc=int(input(\"\"))\r\nmax_num=max(a,b,c)\r\nmin_num=min(a,b,c)\r\nsum_num=a+b+c-max_num-min_num\r\nnum=0\r\nwhile(min_num+sum_num>max_num):\r\n\tmax_num=max_num-1\r\n\tmin_num=min_num-1\r\n\tsum_num=sum_num-1\r\n\tnum=num-1\r\n\tif(min_num+sum_num<=max_num):\r\n\t\tprint(num-1)\r\n'''\r\n'''\r\nnum1=int(input(\"\"))\r\nnum2=int(input(\"\"))\r\nnum3=int(input(\"\"))\r\nresult=\"False\"\r\nif(num1>num2+num3):\r\n\tresult=\"True\"\r\nprint(result)\r\n'''\r\n'''\r\nnum1=input(\"Введите букву клетки: \")\r\nnum2=int(input(\"Введите цифру клетки: \")\r\n'''\r\n'''\r\nwhile(True):\r\n\tinput_str=input(\"Введите координаты клетки: \")\r\n\tword,num1=input_str\r\n\tresult=\"White\"\r\n\tnum2=int(num1)\r\n\tif(word==\"A\" or word==\"C\" or word==\"E\" or word==\"G\"):\r\n\t\tnum2+=1\r\n\tif(word==\"a\" or word==\"c\" or word==\"e\" or word==\"g\"):\r\n\t\tnum2+=1\r\n\tif(word==\"B\" or word==\"D\" or word==\"F\" or word==\"H\"):\r\n\t\tnum2+=0\r\n\tif(word==\"b\" or word==\"d\" or word==\"f\" or word==\"h\"):\r\n\t\tnum2+=0\r\n\tif(num2%2==0):\r\n\t\tresult=\"Black\"\r\n\t\tprint(result)\r\n\t\tprint(\"-------------------------------\")\r\n\tif(num2%1 and not num2%2):\r\n\t\tresult=\"White\"\r\n\t\tprint(result)\r\n\t\tprint(\"-------------------------------\")\r\n\telse:\r\n\t\tprint(\"Координаты введены неверно!\")\r\n'''\r\n'''\r\nx=int(input(\"\"))\r\ny=int(input(\"\"))\r\nresult=\"\"\r\nfor x in range(0, int(x)):\r\n\tfor y in range(0, int(y)):\r\n\t\tif(x+y==y and xy==y):\r\n\t\t\tresult=str(x)+\"\"+str(y)\r\n\t\tprint(result)\r\n'''\r\n'''\r\ntext=input(\"Введите текст:\")\r\nwith open(\"Text.txt\", \"w\") as file:\r\n file.write(text)\r\nwith open(\"Text.txt\",\"r\") as file:\r\n file_read=file.read()\r\n'''\r\n'''\r\nN,K=map(int,input().split())\r\nnum1=(N+K-1)//K\r\nprint(num1)\r\n'''\r\n'''\r\nn=int(input())\r\ndivisors_sum=0\r\nfor i in range(1, n+1):\r\n if(n%i==0):\r\n divisors_sum+=i\r\nprint(divisors_sum)\r\n'''\r\n'''\r\nn = int(input())\r\nif n == 1:\r\n print(0)\r\nelse:\r\n print(n-1)\r\n'''\r\n'''\r\ndays=int(input())\r\nflowers=['G', 'C', 'V']\r\ncenter_index=1\r\nfor i in range(days):\r\n flowers[center_index], flowers[center_index+1] = flowers[center_index+1], flowers[center_index]\r\n flowers[center_index-1], flowers[center_index] = flowers[center_index], flowers[center_index-1]\r\nprint(''.join(flowers))\r\n'''\r\n'''\r\nn=int(input())\r\nif(n and(n-1)==0):\r\n print(n-1)\r\nelse:\r\n m=1\r\n while m<n:\r\n m=2\r\n print(m//2)\r\n'''\r\n'''\r\nk=int(input())\r\ndef Buy(k):\r\n for i in range(k//3+1):\r\n for x in range(k//5+1):\r\n if(i3+x5==k):\r\n return \"Yes\"\r\n return \"No\"\r\nprint(Buy(13))\r\n'''\r\n'''\r\nr=int(input())\r\nif(r%2==0):\r\n\tnum1=r//2\r\n\tprint(num1)\r\nelif(r==1):\r\n\tnum1=0\r\n\tprint(num1)\r\nelse:\r\n\tprint(r)\r\n'''\r\n'''\r\ns,d,f=map(int,input().split())\r\nnum1=s(df2)\r\nprint(num1)\r\n'''\r\n'''\r\nt = int(input())\r\nfor i in range(t):\r\n s = input()\r\n codeforces = \"codeforces\"\r\n diff = 0\r\n for j in range(10):\r\n if s[j] != codeforces[j]:\r\n diff += 1\r\n print(diff)\r\n'''\r\n'''\r\na,b=map(int,input().split())\r\nnum1=a/float(b)\r\nif(num1>0 and num1<0.5):\r\n\tprint(2)\r\nelif(num1>0 and num1<1.0):\r\n\tprint(2)\r\nelif((num1-int(num1))>0 and (num1-int(num1))<=0.5):\r\n\tprint(int(num1)2+1)\r\nelif((num1-int(num1))>0.5 and (num1-int(num1))<=1.0):\r\n\tprint(int(num1)2+2)\r\nelse:\r\n\tprint(int(num1)2)\r\n'''\r\n'''\r\na,b,c=map(int,input().split())\r\nprint((a+b+c)//2)\r\n'''\r\n'''\r\nn=int(input())\r\nsecond_digit=9\r\nthird_digit=9-n\r\nresult=str(second_digit)+str(third_digit)\r\nprint(str(n)+result)\r\n'''\r\n'''\r\nnum1,num2=[int(num) for num in input().split()]\r\nnum3,num4=[int(num) for num in input().split()]\r\nnum5,num6=[int(num) for num in input().split()]\r\notv1=num1-num5\r\notv2=num2-num4\r\nprint(otv1,otv2)\r\n'''\r\n'''\r\nN,M,P,L=map(int,input().split())\r\nnum1=M+P-N+L\r\nnum2=M-num1\r\nnum3=P-num1\r\nprint(num1,num2,num3)\r\n'''\r\n'''\r\nn,k=map(int,input().split())\r\nnum1=2k\r\nprint(num1-19)\r\n'''\r\n'''\r\ns,t=map(int,input().split())\r\nif(t>s):\r\n print(t-s)\r\nelse:\r\n print(12-s+t)\r\n'''\r\n'''\r\nl,w,h=map(int,input().split())\r\nprint((lh2+wh2+15)//16)\r\n'''\r\n'''\r\nn = int(input())\r\nif(n>0 and (n&(n-1))==0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n'''\r\n'''\r\na,b=map(int,input().split())\r\nprint(abs((b+1)//2-(a+1)//2))\r\n'''\r\n'''\r\nn=int(input())\r\nnum1=0\r\nnum2=0\r\nwhile(num2!=n):\r\n\tnum2=num2+num1\r\n\tnum1=num1+1\r\nnum3=num1-1\r\nprint(num3)\r\n'''\r\n'''\r\nscores=[]\r\nfor _ in range(4):\r\n a,b=map(int, input().split())\r\n scores.append((a, b))\r\nteam1_score=sum(a for a, _ in scores)\r\nteam2_score=sum(b for _, b in scores)\r\n\r\nif(team1_score>team2_score):\r\n print(1)\r\nelif(team1_score < team2_score):\r\n print(2)\r\nelse:\r\n print(\"DRAW\")\r\n'''\r\n'''\r\nfirst_code = input().strip()\r\nsecond_code = input().strip()\r\nlast_code = first_code\r\nfor i in range(10000):\r\n current_code = f'{i:04}'\r\n if(current_code==last_code):\r\n continue\r\n if(current_code==second_code):\r\n print(\"YES\")\r\n break\r\n last_code = current_code\r\nelse:\r\n print(\"NO\")\r\n'''\r\n'''\r\na,b=map(int,input().split())\r\nif(a<b):\r\n\ta,b=b,a\r\nprint((a+1)//2,b)\r\n'''\r\n'''\r\nb=int(input())\r\na=int(input())\r\nif(b%2==0):\r\n\tprint(\"YES\")\r\nelif(b==0):\r\n\tprint(\"YES\")\r\nelif(a%2!=0):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n'''\r\n'''\r\nx=input()\r\nn=int(input())\r\nif(x==\"Home\" and n==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n'''\r\n'''\r\nn=int(input())\r\nnum1=-1\r\nnum2=-1\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if(b==1):\r\n if(num1==-1 or a>num1):\r\n num1=a\r\n num2=i+1\r\nprint(num2)\r\n'''\r\n'''\r\na=int(input())\r\nnum1=a+a//2\r\nnum1=num1+num1//2\r\nnum1=num1+num1//2\r\na=a+a/2\r\na=a+a/2\r\na=a+a/2\r\nif(num1==a):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\r\n'''\r\n'''\r\nn,k=map(int,input().split())\r\nnum1=n-k\r\nnum2=k-num1\r\nprint(num2)\r\n'''\r\n'''\r\na,b,c,d=map(int,input().split())\r\nif(d>=c):\r\n\td=d-c-1\r\n\tnum1=d(a+2b)+2b\r\nelse:\r\n\tc=c-d+1\r\n\tnum1=(c-1)(a+2b)+a\r\nprint(num1)\r\n'''\r\n'''\r\nn=int(input())\r\nnum1=0\r\nnum2=0\r\nfor _ in range(n):\r\n num3=int(input())\r\n if(num3==1):\r\n num1=num1+1\r\n else:\r\n num2=num2+1\r\nnum4=min(num1,num2)\r\nprint(num4)\r\n'''\r\n'''\r\ndef find_approx_equal_numbers(n,m):\r\n num1=n//m\r\n num2=n%m\r\n num3=[]\r\n for _ in range(m-num2):\r\n num3.append(num1)\r\n for _ in range(num2):\r\n num3.append(num1+1)\r\n return ' '.join(map(str,num3))\r\nn,m=map(int, input().split())\r\nnum4=find_approx_equal_numbers(n,n)\r\nprint(num4)\r\n'''\r\n'''\r\nn=int(input())\r\nf=[0,1]\r\nnum1=n+1\r\nfor i in range(2,num1):\r\n\tf.append(f[i-1]+f[i-2])\r\nnum2=f[n]\r\nprint(num2)\r\n'''\r\n'''\r\nbutton_sequence=input()\r\nmax_floor=0\r\nmin_floor=0\r\ncurrent_floor=0\r\nfor button in button_sequence:\r\n if button=='1':\r\n current_floor+=1\r\n elif button=='2':\r\n current_floor-=1\r\n max_floor=max(max_floor,current_floor)\r\n min_floor=min(min_floor,current_floor)\r\ntotal_floors=max_floor-min_floor+1\r\nprint(total_floors)\r\n'''\r\n'''\r\nn=input()\r\ncount=0\r\nfor digit in n:\r\n if digit in ['0','6','9']:\r\n count+=1\r\n elif digit=='8':\r\n count+=2\r\nprint(count)\r\n'''\r\n'''\r\nn=input()\r\nnum1=ord(n[0])-ord('A')\r\nnum2=int(n[1])-1\r\nif(num1+num2)%2==0:\r\n print(\"BLACK\")\r\nelse:\r\n print(\"WHITE\")\r\n'''\r\n'''\r\na,b=map(int,input().split())\r\nnum1=max(2b+40,2a+39)\r\nprint(num1)\r\n'''\r\n'''\r\na,b,c,e,f,g=map(int,input().split())\r\nnum1=sorted([a,b,c],reverse=True)\r\nnum2=sorted([e,f,g],reverse=True)\r\nnum3=sum([num1num2 for num1,num2 in zip(num1,num2)])\r\nprint(num3)\r\n'''\r\n'''\r\nw=input()\r\nx=int(input())\r\nif(w==\"Home\" and x%2==0):\r\n\tprint(\"YES\")\r\nif(w==\"Home\" and x%2!=0):\r\n\tprint(\"YES\")\r\nif(w==\"School\" and x%2==0):\r\n\tprint(\"NO\")\r\nif(w==\"School\" and x%2!=0):\r\n\tprint(\"YES\")\r\n'''\r\n'''\r\nnum1=[1,\"mon\",\"tue\",\"wed\",\"thu\",\"fri\",\"sat\",\"sun\"]\r\nx,y=map(int,input().split())\r\nif(x%y==0 or y%x==0):\r\n print(max(y,x),num1[(max(y,x)%7)+1])\r\nelse:\r\n print(yx,num1[(yx%7)+1])\r\n'''\r\n'''\r\nn=int(input())\r\nnum1=1\r\nnum2=1\r\nwhile(num2<n):\r\n\tif(num2%2!=0):\r\n\t\tnum1=num1+(num2+1)\r\n\telse:\r\n\t\tnum1-=(num2+1)\r\n\tnum2=num2+1\r\nif(num1%2==0):\r\n\tprint(\"black\")\r\nelse:\r\n\tprint(\"grimy\")\r\n'''\r\n'''\r\nn=input().strip()\r\nn=n.replace(\"00000000000000000000000001\",\"y\")\r\nn=n.replace(\"001\",\"c\")\r\nn=n.replace(\"01\",\"b\")\r\nn=n.replace(\"1\",\"a\")\r\nprint(n)\r\n'''\r\n'''\r\nt=1\r\narr=[]\r\nfor i in range(3):\r\n\tarr.append(list(input()))\r\nfor i in range(3):\r\n\tif(arr[i][0]==arr[i][1]==arr[i][2] or arr[0][i]==arr[1][i]==arr[2][i]):\r\n\t\tif arr[i][i]=='X':\r\n\t\t\tprint('Win')\r\n\t\t\tbreak\r\n\t\telif(arr[i][i]=='O'):\r\n\t\t\tprint('Lose')\r\n\t\t\tbreak\r\nif(arr[0][0]==arr[1][1]==arr[2][2] or arr[0][2]==arr[1][1]==arr[2][0]):\r\n\tif(arr[1][1]=='X'):\r\n\t\tprint('Win')\r\n\telif(arr[1][1]=='O'):\r\n\t\tprint('Lose')\r\n\telse:\r\n\t\tt=0\r\n\t\tprint('Draw')\r\nelif t:\r\n\tprint('Draw')\r\n'''\r\n'''\r\nn,m=map(int,input().split())\r\nif(n==0 and m!=0):\r\n print('Impossible')\r\nelse:\r\n if(m==0):\r\n print(n,n)\r\n elif(n==0 and m==0):\r\n print(\"0\",\"0\")\r\n else:\r\n n_max = (n+m)-1\r\n if(m>=n):\r\n n_min=(m-n)+n\r\n else:\r\n n_min=n\r\n print(n_min,n_max)\r\n'''\r\n'''\r\ns,p=map(int, input().split())\r\nd=ss-4p\r\nif(d<0):\r\n print(\"Impossible\")\r\nelif d == 0:\r\n x = y = s // 2\r\n if x > 0 and x <= 1000:\r\n print(x, y)\r\n else:\r\n print(\"Impossible\")\r\nelse:\r\n x1 = (s + int(d 0.5)) // 2\r\n y1 = s - x1\r\n x2 = (s - int(d 0.5)) // 2\r\n y2 = s - x2\r\n if x1 > 0 and x1 <= 1000 and y1 > 0 and y1 <= 1000:\r\n if x2 > 0 and x2 <= 1000 and y2 > 0 and y2 <= 1000:\r\n print(min(x1, y1), max(x1, y1))\r\n else:\r\n print(min(x1, y1), max(x1, y1))\r\n elif x2 > 0 and x2 <= 1000 and y2 > 0 and y2 <= 1000:\r\n print(min(x2, y2), max(x2, y2))\r\n else:\r\n print(\"Impossible\")\r\n'''\r\n'''\r\nimport re\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n s = input()\r\n if re.match(\"^[ABCEHKMOPTXY]{1}\\d{3}[ABCEHKMOPTXY]{2}$\", s):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n'''\r\n'''\r\na,b=input().split()\r\nnum1=0\r\nnum2=0\r\nfor i in range(4):\r\n\tif(a[i]==b[i]):\r\n\t\tnum1=num1+1\r\n\telif(a[i] in b):\r\n\t\tnum2=num2+1\r\nprint(num1,num2)\r\n'''\r\n'''\r\nn=input()\r\nnum1=[\"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\nnum2=0\r\nnum3=\"\"\r\nfor i in range(len(n)):\r\n\tif(n[i]==\"1\"):\r\n\t\tnum3=num3+num1[i-num2]\r\n\t\tnum2+=i-num2+1\r\nprint(num3)\r\n'''\r\n'''\r\nn=int(input())\r\nnum1=list(input().split())\r\nnum2=n+1\r\nprint(num2)\r\n'''\r\n'''\r\ns1=input()\r\ns2=input()\r\nif(len(s1)!=len(s2)):\r\n print(\"NO\")\r\nelse:\r\n num1={}\r\n for num2 in s1:\r\n if num2 in num1:\r\n num1[num2]+=1\r\n else:\r\n num1[num2]=1\r\n for num2 in s2:\r\n if num2 in num1:\r\n num1[num2]-=1\r\n if num1[num2]<0:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n'''\r\n'''\r\ndef F1(a,b):\r\n while(b):\r\n a,b=b,a%b\r\n return a\r\ndef F2(a,b):\r\n return ab//F1(a,b)\r\ndef F3(a,b,c):\r\n return F2(F2(a,b), c)\r\na,b,c=map(int,input().split())\r\nprint(F2(F2(a,b),c))\r\n'''\r\n'''\r\nn,m=map(int,input().split())\r\nnum1,num2=n,m\r\nwhile(num2):\r\n\tnum1,num2=num2,num1%num2\r\nprint(nm//num1)\r\n'''\r\n'''\r\nn=list(map(int,input().split()))\r\nnum1=sum(n)//27\r\nprint(num1)\r\n'''\r\n'''\r\nn=int(input())\r\nr=int(input())\r\nc=int(input())\r\nnum1=min(n-r,n-c)+min(r-1,c-1)+1\r\nnum2=min(n-r,c-1)+min(r-1,n-c)+1\r\nnum3=num1+num2-2 \r\nprint(num3)\r\n'''\r\n'''\r\nn=input() \r\nnum1=0\r\nfor i in range(len(n)-4):\r\n if(n[i:i+5]==\">>-->\"):\r\n num1=num1+1\r\n elif(n[i:i+5]==\"<--<<\"):\r\n num1=num1+1\r\nprint(num1)\r\n'''\r\nnum2=0\r\nnum1=int(input())\r\nfor i in range(num1):\r\n\tstr1=input()\r\n\tif(str1==\"X++\"):\r\n\t\tnum2=num2+1\r\n\tif(str1==\"++X\"):\r\n\t\tnum2=num2+1\r\n\tif(str1==\"X--\"):\r\n\t\tnum2=num2-1\r\n\tif(str1==\"--X\"):\r\n\t\tnum2=num2-1\r\nprint(num2)\r\n\r\n", "g = 0\r\nfor _ in range(int(input())):\r\n s = input()\r\n if s == \"X++\" or s == \"++X\":\r\n g += 1\r\n else:\r\n g -= 1\r\nprint(g)\r\n", "n = int(input())\nX = 0\n\nfor y in range(n):\n s = input()\n if \"++\" in s:\n X =X + 1\n else:\n X =X - 1\n\nprint(X)\n\n\n\t \t\t\t\t \t \t \t\t\t \t\t\t\t\t\t\t\t \t \t", "x=0\r\nn=int(input())\r\nfor i in range(n):\r\n komanda=str(input())\r\n if komanda=='++X' or komanda=='X++':\r\n x+=1\r\n elif komanda=='--X' or komanda=='X--':\r\n x-=1\r\nprint(x)", "x=0\r\nfor _ in range(int(input())):\r\n a=input()\r\n if a=='X++' or a=='++X':\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "num=int(input())\r\ncount=0\r\nfor i in range(num):\r\n s=input()\r\n if '+' in s:\r\n count+=1\r\n else:\r\n count-=1\r\nprint(count)", "number = int(input())\r\nvalue = 0\r\nfor i in range(number):\r\n x = input()\r\n if x.count(\"+\") == 2:\r\n value += 1\r\n elif x.count(\"-\") == 2:\r\n value -= 1\r\nprint(value)", "numOfInputs = int(input())\r\ny = 0\r\n\r\nfor i in range(0, numOfInputs):\r\n operation = input().lower()\r\n if operation == '++x' or operation == 'x++':\r\n y += 1\r\n elif operation == '--x' or operation == 'x--':\r\n y -= 1\r\n else:\r\n y = y\r\n\r\n\r\nprint(y)", "n=int(input())\r\nx=0\r\nwhile n>0 :\r\n s=list(input())\r\n if '+' in s : \r\n x+=1\r\n else :\r\n x-=1\r\n n-=1 \r\nprint(x)", "n = int(input())\r\nmyList = []\r\nx = 0\r\n\r\nfor i in range(n):\r\n op = input().split(\"X\")\r\n if \"++\" in op:\r\n x += 1\r\n elif \"--\" in op:\r\n x -= 1\r\n\r\nprint (x)", "x=int(input())\r\nG=0\r\nfor i in range(x):\r\n y=input()\r\n if y==\"++X\" or y==\"X++\":\r\n G=G+1\r\n elif y==\"--X\" or y==\"X--\":\r\n G=G-1\r\nprint(G)", "n = int(input()) # Read the number of sentences\r\n\r\nx = 0 # Initialize variable x to 0\r\n\r\n# Let's go through each sentence and perform operations\r\nfor i in range(n):\r\n statement = input() # Read the sentence\r\n if \"++\" in statement:\r\n x += 1 # Increase x by 1 if there is a \"++\" operation\r\n else:\r\n x -= 1 # Decrease x by 1 if there is a \"--\" operation\r\n\r\nprint(x) # Print the value of variable x after executing the program", "t=int(input())\r\nk=0\r\nfor i in range(t):\r\n x=input()\r\n s=x.count(\"+\")\r\n if s>0:\r\n k+=1\r\n else:\r\n k-=1\r\nprint(k)\r\n \r\n", "t = int(input())\r\nx = 0\r\nwhile t!=0:\r\n inp = input()\r\n if '-' in inp:\r\n x -= 1\r\n else:\r\n x += 1\r\n t -= 1\r\nprint(x)", "\r\nk=0\r\nfor i in range(int(input())):\r\n b=input()\r\n if b=='X++' or b=='++X':k+=1\r\n else:k-=1\r\nprint(k)", "n=int(input())\r\nb=0\r\nwhile n>0:\r\n a=input()\r\n if a == \"++X\" or a== \"X++\":\r\n b+=1\r\n elif a == \"--X\" or a== \"X--\":\r\n b-=1\r\n n-=1\r\nprint(b)", "res = 0\r\nk = int(input())\r\nfor i in range(k):\r\n x = input()\r\n if \"++\" in x: res += 1 \r\n else: res -= 1\r\nprint(res)", "n = int(input())\r\nx = 0\r\nfor i in range(n) :\r\n s = str(input())\r\n for s1 in s :\r\n if s1 == \"+\":\r\n x += 1\r\n break\r\n elif s1 == '-':\r\n x -= 1\r\n break\r\nprint(x)", "n = int(input())\r\nx = 0\r\n\r\nfor i in range(n):\r\n com = input()\r\n\r\n if com[1] == \"+\":\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)", "global c;c = 0\r\ndef ele(a):\r\n b = 0;d = 0\r\n if b != 2 or d != 2:\r\n for i in a:\r\n if i == ' ':\r\n exit()\r\n for i in a:\r\n if i == 'X':\r\n for i in a:\r\n if i == '+': b +=1\r\n if i == '-': d +=1\r\n if d==2: c=-1 ;return c\r\n if b==2: c = 1 ;return c\r\nx = 0\r\nt = int(input())\r\nif t >= 1 and t <= 150:\r\n while t: n = input();x += ele(n);t -= 1\r\nprint(x)", "x = 0\r\nn = int(input())\r\nif 1<=n<=150:\r\n for i in range(n):\r\n a = input()\r\n if a == \"X++\" or a == \"++X\":\r\n x+=1\r\n elif a == \"X--\" or a == \"--X\":\r\n x-=1\r\n \r\n print(x)", "#CF_282A: Bit++\r\nn = int(input())\r\nx = 0\r\n\r\nfor _ in range(n):\r\n str_x = input()\r\n if \"++\" in str_x:\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)\r\n", "n=int(input())\r\nx=0\r\nwhile n:\r\n s=input()\r\n if \"++\" in s:\r\n x+=1\r\n elif \"--\" in s:\r\n x-=1\r\n n-=1\r\nprint(x)", "t = int(input())\r\nx = 0\r\nfor i in range(t):\r\n n = input()\r\n if \"++\" in n:\r\n x += 1 \r\n elif \"--\" in n:\r\n x -= 1 \r\nprint(x)", "x, n = 0, int(input())\n# the second element always says the operation to be done\nwhile (n):\n\tinstr = input()\n\tif (instr[1] == \"+\"):\n\t\tx+=1\n\telse:\n\t\tx-=1\n\tn-=1\n\nprint(x)\n", "count=0\r\nfor _ in range(int(input())):\r\n \r\n n=input()\r\n \r\n for i in n[1]:\r\n if i=='+':\r\n count=count+1\r\n elif i=='-':\r\n count=count-1\r\n\r\nprint(count) \r\n ", "x=0\r\na=int(input())\r\nfor i in range (a) :\r\n b=str(input())\r\n if b.find('+')!=-1 :\r\n x=x+1\r\n else :\r\n x=x-1\r\nprint(x)", "n = int(input())\r\nscore = 0\r\nfor i in range(n):\r\n string = str(input())\r\n \r\n if string[0] == '+' or string[len(string)-1] == '+':\r\n score += 1\r\n \r\n if string[0] == '-' or string[len(string)-1] == '-':\r\n score -= 1\r\nprint(score)", "x = 0\n# read input\nn = int(input())\nstack = []\nfor _ in range(n):\n stack.append(input())\nfor i in stack:\n for h in set(i):\n if h == \"+\":\n x += 1\n if h == \"-\":\n x -= 1\nprint(x)\n \n", "a=int(input())\r\ncount=0\r\nfor _ in range(a):\r\n statement=input()\r\n if \"++\" in statement:\r\n count+=1\r\n else:\r\n count-=1\r\nprint(count)\r\n", "a=int(input())\r\nb=0\r\nfor i in range(a):\r\n c=input()\r\n if c[1]==\"+\":\r\n b+=1\r\n else:\r\n b-=1\r\nprint(b)", "rep = int(input())\nnum = 0\nfor i in range(rep):\n if input().count(\"-\") >0:\n num -=1\n else:\n num +=1\nprint(num)\n\t\t\t \t\t \t \t\t \t \t \t\t\t \t\t", "n=int(input())#number of operations\r\ncount=0\r\nx=0\r\nwhile(count<n):\r\n y=str(input())\r\n if(y==\"++X\" or y==\"X++\"):\r\n x=x+1\r\n else:\r\n x=x-1\r\n count+=1\r\nprint(x)\r\n ", "n=int(input())\nx=0\nfor i in range(n):\n op=input()\n l=list(op)\n if '+' in l:\n x+=1\n else:\n x-=1\nprint(x)\n", "nrighe=int(input(\"\"))\r\ncontatore =0;\r\nfor i in range(nrighe):\r\n riga=str(input(\"\"));\r\n if(riga[0]=='-' or riga[1]=='-'):\r\n contatore-=1\r\n else: \r\n contatore+=1\r\nprint(contatore)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n string=str(input())\r\n if string[0] == '+' or string[len(string)-1] == '+':\r\n count+=1\r\n elif string[0] == '-' or string[len(string)-1] == '-':\r\n count-=1 \r\nprint(count)", "n = int(input())\r\na = 0 \r\nfor i in range(n) :\r\n b = input()\r\n if b[1] == \"+\" :\r\n a += 1\r\n else :\r\n a -= 1\r\nprint(a)", "n = 0 \r\nfor i in range (int (input ())):\r\n k = input () \r\n if k[0] == '+' or k[1] == '+':\r\n n += 1 \r\n else:\r\n n -= 1 \r\nprint (n)", "a=[]\r\ns=0\r\nch=\"\"\r\nfor i in range(int(input())):\r\n ch=input()\r\n a.append(ch)\r\n if a[i]==\"++X\" or a[i]==\"X++\":\r\n s=s+1\r\n else:\r\n s=s-1\r\nprint(s)\r\n\r\n", "t=int(input())\r\na=0\r\nfor n in range(0,t):\r\n\tn=input()\r\n\tif n[1]==\"+\" or n[-1]==\"+\":\r\n\t\ta=a+1\r\n\telse:\r\n\t\ta=a-1\r\nprint(a) ", "t=int(input(\"\"))\n\ncount=0\nfor i in range (t):\n inv=input(\"\").upper()\n if inv==\"++X\" or inv==\"X++\":\n count+=1\n else:\n count-=1\nprint(count)\n\t\t\t \t \t \t\t \t\t \t \t\t \t", "n=int(input())\nrslt=0\nfor i in range(n):\n s=input()\n if s[1]=='+':\n rslt+=1\n elif s[1]=='-':\n rslt-=1\n \nprint(rslt) \n \n \n\t\t\t\t \t \t\t\t\t\t \t \t\t\t \t\t \t\t", "def invr():\r\n return(map(int,input().split()))\r\n\r\ndef main():\r\n num = int(input())\r\n count = 0\r\n for i in range(num):\r\n operation = input()\r\n if operation.__contains__(\"--\"):\r\n count -= 1\r\n if operation.__contains__(\"++\"):\r\n count += 1\r\n\r\n print(count)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "# cook your dish here\nX=0\nl1=[]\nfor i in range(int(input())):\n l1.append(input())\n if(l1[i]=='++X'):\n X=X+1\n elif(l1[i]==\"X++\"):\n X=X+1\n elif(l1[i]==\"X--\"):\n X=X-1\n elif(l1[i]==\"--X\"):\n X=X-1\nprint(X)\n \n", "a=int(input())\nx=0\nfor i in range(a):\n g=input()\n t=[i for i in g]\n if '+' in t:\n x=x+1\n if '-' in t:\n x=x-1\nprint(x)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n'''\nl=[[1,2,3],[1,2,3],[1,2,3]]\nd=[[21,12,43],[11,21,30],[21,12,53]]\nf=[[0,0,0],[0,0,0],[0,0,0]]\nfor i in range(len(l)):\n for j in range(len(l[i])):\n print(l[i][j],end=' ')\n print()\nfor i in range(len(d)):\n for j in range(len(d[i])):\n print(d[i][j],end=' ')\n print()\nfor i in range(len(l)):\n for j in range(len(l[i])):\n f[i][j]=l[i][j]+d[i][j]\nfor i in range(len(f)):\n for j in range(len(f[i])):\n print(f[i][j],end=' ')\n print()\n'''\n\n \n \n \n", "def main():\n ns = input()\n value = 0\n iter = range(int(ns))\n for i in iter:\n line = input()\n if \"+\" in line:\n value += 1\n else:\n value -= 1\n print(value)\n return 0\n\nif __name__ == \"__main__\":\n raise SystemExit(main())\n", "# taking inputs\r\nn = int(input())\r\nl = [input().find('+') for i in range(n)]\r\n\r\n# main logic\r\nx = 0\r\nfor i in l:\r\n if i == -1:\r\n x -= 1\r\n else:\r\n x += 1\r\n\r\nprint(x)", "from collections import defaultdict\r\nfrom sys import stdin\r\n\r\ndef solve():\r\n n = int(input())\r\n\r\n answ = 0\r\n for i in range(n):\r\n s = input()\r\n if s[0:2] == '++' or s[1:3] == '++':\r\n answ+=1\r\n else:\r\n answ-=1\r\n print(answ)\r\n\r\n \r\n\r\nif __name__ == '__main__':\r\n solve()", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef input_int():\r\n return(int(input()))\r\n\r\ndef input_str():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n\r\nif __name__ == \"__main__\":\r\n n = input_int()\r\n\r\n value = 0\r\n\r\n for _ in range(n):\r\n s = input_str()\r\n if '+' in s:\r\n value += 1\r\n else:\r\n value -= 1\r\n\r\n sys.stdout.write(str(value) + \"\\n\")", "def solve(operations):\r\n # Your code goes here\r\n x = 0\r\n for operation in operations:\r\n if operation[:2] ==\"++\" or operation[-2:] ==\"++\":\r\n x += 1\r\n elif operation[:2] ==\"--\" or operation[-2:] ==\"--\":\r\n x -= 1\r\n return x\r\n\r\ndef main():\r\n # Reading multiple test cases\r\n t = int(input())\r\n operations = []\r\n for _ in range(t):\r\n # Reading inputs for each test case\r\n operations.append(input().strip())\r\n print(solve(operations))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\ny = 0\r\nfor i in range(0, n):\r\n x = str(input())\r\n if x[0] == '+' or x[len(x)-1] == '+':\r\n y +=1\r\n elif x[0]=='-' or x[len(x)-1] == '-':\r\n y -=1\r\nprint(y)", "num_of_statements = int(input())\r\nx = 0\r\nfor i in range(num_of_statements):\r\n statement = input()\r\n if statement.find(\"++\") == -1:\r\n x = x - 1\r\n else:\r\n x = x + 1 \r\nprint(x)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n stp=input()\r\n if stp[1]==\"+\":\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "n = int(input())\r\nc=0\r\nfor i in range(n):\r\n a=input()\r\n if \"++\" in a:\r\n c+=1\r\n elif \"--\" in a:\r\n c-=1\r\nprint(c)", "n=int(input())\ncounter=0\nwhile n!=0:\n n-=1\n word=input()\n if \"++\" in word:\n counter+=1\n elif \"--\" in word:\n counter-=1\n \nprint(counter)", "a=0\r\nfor _ in range(int(input())):\r\n s=input()\r\n if s[-1]=='+' or s[0]=='+':\r\n a+=1\r\n else:\r\n a-=1\r\nprint(a)", "t = 0\r\nn = int(input())\r\nfor _ in range(n):\r\n x = input()\r\n if x==\"++X\" or x==\"X++\":\r\n t+=1\r\n else:\r\n t-=1\r\nprint(t)", "n = int(input())\nstatments = []\nX = 0\nfor i in range(n):\n statments.append(input())\n\nfor i in statments:\n if \"+\" in i:\n X += 1\n elif \"-\" in i:\n X -= 1\nprint(X)", "a=int(input())\r\nc=0\r\nfor i in range (a):\r\n b=input()\r\n if (b==\"++X\" or b==\"X++\"):\r\n c+=1\r\n else:\r\n c-=1\r\nprint(c)", "n = int(input())\r\nk = 0\r\nfor _ in range(n):\r\n s = input()\r\n if s == \"++X\" or s == \"X++\":\r\n k += 1\r\n elif s == \"--X\" or s == \"X--\":\r\n k -= 1\r\nprint(k)", "a = int(input()) \nx = 0 \nfor i in range(a):\n operation = input()\n\n if \"++\" in operation:\n x += 1\n else:\n x -= 1\n\nprint(x)\n ", "def resta(x):\r\n x-=1\r\n return x\r\ndef suma(x):\r\n x+=1\r\n return x\r\nn = int(input())\r\nx = 0\r\nfor _ in range(n):\r\n a = input()\r\n if(\"-\" in a):\r\n x = resta(x)\r\n else:\r\n x = suma(x)\r\nprint(x) ", "n=int(input());x=[input() for i in range(n)]\r\nprint(sum([1 if \"+\" in i else -1 for i in x]))", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n s=input()\r\n for n in range(len(s)):\r\n if s[n]==\"+\":\r\n x+=1\r\n break\r\n elif s[n]==\"-\":\r\n x-=1\r\n break \r\nprint(x)", "# for _ in range(int(input())):\r\nn = int(input())\r\nx = 0\r\nfor i in range(n):\r\n a = input()\r\n if a[0] ==\"+\" or a[1] ==\"+\":\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "NoTime = int(input())\r\nx=0\r\nfor number in range(NoTime):\r\n command = input()\r\n if \"++\" in command:\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)", "n = int(input())\r\nx = 0\r\nfor _ in range(n):\r\n statement = input()\r\n statement = [c for c in statement]\r\n if statement[0] == '+' or statement[2] == '+':\r\n x = x+1\r\n else:\r\n x = x-1\r\nprint(x)\r\n", "num = int(input(\"\"))\r\n\r\nvar = 0\r\n\r\nfor i in range(1,num + 1):\r\n statement = input(\"\")\r\n if statement.lower() == \"++x\" or statement.lower() == \"x++\":\r\n var +=1\r\n elif statement.lower() == \"--x\" or statement.lower() == \"x--\":\r\n var-=1\r\nprint(var)\r\n", "x=int(input())\r\nn=0\r\nfor i in range(x):\r\n l=input()\r\n \r\n if(l==\"++X\" or l==\"X++\"):\r\n n+=1\r\n else:\r\n n-=1\r\nprint(n) ", "def execute_bit_program(program):\r\n x = 0\r\n for statement in program:\r\n if \"++\" in statement:\r\n x += 1\r\n else:\r\n x -= 1\r\n return x\r\n\r\nn = int(input())\r\nprogram = [input() for _ in range(n)]\r\nresult = execute_bit_program(program)\r\nprint(result)\r\n", "w=0\r\nq=int(input())\r\nfor i in range(q):\r\n e=input()\r\n if '+' in e: w=w+1\r\n if '-' in e: w=w-1\r\nprint(w)\r\n", "x=0\r\nfor i in range(int(input())):\r\n a=input()\r\n if (a==\"X++\" or a==\"++X\"):\r\n x=x+1\r\n \r\n elif (a==\"X--\" or a==\"--X\"):\r\n x=x-1\r\nprint(x)\r\n\r\n", "n=input()\r\nx=0\r\nfor times in range(int(n)): \r\n string = input().replace('x','')\r\n if \"++\" in string:\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "a=int(input())\r\nb=0\r\nif 1<=a<=150:\r\n for i in range(0,a):\r\n\r\n c= input()\r\n if c=='++X'or c==\"X++\":\r\n b=b+1\r\n elif c==\"--X\" or c=='X--':\r\n b=b-1\r\n\r\n\r\n print(b)\r\n\r\n", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n X=input()\r\n if(X[1]==\"+\"):\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)", "import sys\r\nimport math\r\n\r\ninput = sys.stdin.readline\r\n\r\ninp = lambda: input().strip()\r\ngi = lambda: list(map(int, input().split()))\r\ngs = lambda: list(input().split())\r\n\r\ntest_cases = int(input())\r\nx = 0\r\nfor _ in range(test_cases):\r\n s = inp()\r\n if s[1] == \"+\":\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n", "x=int(input())\r\n\r\nc=0\r\nfor i in range (0,x):\r\n str=input()\r\n if \"++\" in str:\r\n c=c+1\r\n else:\r\n c=c-1\r\nprint(c)", "ans=0\nfor _ in range(int(input())):\n k=input()\n if \"++\" in k:\n ans+=1\n else:\n ans-=1\nprint(ans)\n", "def main():\r\n # Reading multiple test cases\r\n t = int(input())\r\n x = 0\r\n for _ in range(t):\r\n # Reading and processing each operation\r\n operation = input().strip()\r\n if operation[:2] ==\"++\" or operation[-2:] ==\"++\":\r\n x += 1\r\n elif operation[:2] ==\"--\" or operation[-2:] ==\"--\":\r\n x -= 1\r\n print(x)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "count = 0\r\nfor i in range(int(input())):\r\n a = input()\r\n if '+' in a:\r\n count += 1\r\n elif '-' in a:\r\n count -= 1\r\nprint(count)\r\n", "n = int(input())\r\nv = 0\r\nfor i in range(n):\r\n s = input()\r\n if '+' in s:\r\n v += 1\r\n else:\r\n v -= 1\r\nprint(v)", "n=int(input())\r\ny=0\r\nfor i in range(n):\r\n z=input()\r\n if(\"++X\" in z or \"X++\" in z):\r\n y+=1\r\n else:\r\n y=y-1\r\nprint(y) ", "X=0\r\nn=int(input(\"\"))\r\nl=[]\r\nfor i in range(n):\r\n u=input(\"\")\r\n if u[1]=='-':\r\n X=X-1\r\n else : \r\n X=X+1\r\n\r\n\r\nprint(X)", "x = 0\r\noperations = []\r\nlines = int(input())\r\n\r\nfor i in range(lines):\r\n operations.append(input())\r\n\r\nfor operation in operations:\r\n if operation[1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)", "x = 0\r\nfor _ in range(int(input())):\r\n\ta = input()\r\n\tif \"++\" in a:\r\n\t\tx +=1\r\n\tif \"--\" in a:\r\n\t\tx-=1\r\nprint(x)\t\t\r\n ", "n = int(input())\r\n\r\nnum=0\r\npl1 = \"X++\"\r\npl2 = \"++X\"\r\nmin1= \"X--\"\r\nmin2=\"--X\"\r\nfor i in range(0,n):\r\n str = input()\r\n if str==pl1 or str ==pl2:\r\n num = num+1\r\n elif str==min1 or str==min2:\r\n num = num-1\r\nprint(num)\r\n\r\n\r\n", "number_of_operations = int(input())\r\noperations = [input() for x in range(number_of_operations)]\r\n\r\nresult = 0\r\n\r\nfor i in range(number_of_operations):\r\n if operations[i].count('+') > 0: result += 1\r\n elif operations[i].count('-') > 0: result -= 1\r\n \r\n# .count('+') > 0: result += 1\r\n\r\nprint(result)", "n=int(input())\r\nX=0\r\nif 1<=n<=150:\r\n for i in range(n):\r\n statement=input()\r\n if \"++\" in statement:\r\n X +=1\r\n else:\r\n X -=1\r\n print(X)", "T = int(input())\r\n\r\ncountp = 0\r\ncountn = 0\r\nfor i in range(T):\r\n string = input()\r\n for i in range(0, len(string)):\r\n if(string[i]=='-'):\r\n countn += 1\r\n if(string[i]=='+'):\r\n countp += 1\r\n\r\nx = countp//2 - countn//2\r\nprint(x)", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n op = input()\r\n\r\n if \"+\" in op:\r\n count += 1\r\n\r\n else:\r\n count -= 1\r\n\r\nprint(count)", "n = int(input())\r\np = len([x for x in range(n) if '+' in input()])\r\nprint(p * 2 - n)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n X = input()\r\n if X == \"++X\" or X == \"X++\":\r\n count +=1\r\n elif X == \"--X\" or X == \"X--\":\r\n count-=1\r\nprint(count) ", "n = int(input())\r\n\r\nx = 0\r\nfor _ in range(n):\r\n bit = input()\r\n bit = sorted(bit)\r\n str_bit = ''.join(bit)\r\n if str_bit == \"++X\":\r\n x += 1\r\n elif str_bit == \"--X\":\r\n x -= 1\r\n\r\nprint(x)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n a = input()\r\n if '++' in a:\r\n ans += 1\r\n elif '--' in a:\r\n ans -= 1\r\nprint(ans)", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n x=input()\r\n if x[1]==\"+\":\r\n c=c+1\r\n else:\r\n c=c-1\r\nprint(c)", "n=int(input())\r\nplus=0\r\nminus=0\r\nx=0\r\nfor j in range(n):\r\n stri=input()\r\n i=0\r\n while(i<len(stri)):\r\n if(stri[i]==\"+\"):\r\n plus=plus+1\r\n elif(stri[i]==\"-\"):\r\n minus=minus+1\r\n i=i+1\r\n if(plus==2):\r\n x=x+1\r\n plus=0\r\n elif(minus==2):\r\n x=x-1\r\n minus=0\r\nprint(x)", "n=int(input())\ns=''\nfor i in range(n):\n s=s+str(input())\nx=(s.count('+')-s.count('-'))/2\nprint(int(x))\n", "n = int(input())\r\nx = 0\r\n\r\nfor i in range(1, n+1):\r\n w = input()\r\n n = w.count(\"++\")\r\n x += n\r\n y = w.count(\"--\")\r\n x -= y\r\n\r\nprint(x)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n l= input()\r\n if l == '++X' or l == 'X++' :\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x) \r\n\r\n \r\n", "x = 0\r\ni = 0\r\nstroki = int(input(\"\"))\r\nwhile i<stroki:\r\n plusminus = input(\"\")\r\n if plusminus == \"X++\" or plusminus == \"++X\":\r\n x += 1\r\n else:\r\n x -= 1\r\n i += 1\r\nprint(x)", "'''\r\nThe classic programming language of Bitland is Bit++. This language is so peculiar and complicated.\r\n\r\nThe language is that peculiar as it has exactly one variable, called x. Also, there are two operations:\r\n\r\nOperation ++ increases the value of variable x by 1.\r\nOperation -- decreases the value of variable x by 1.\r\nA statement in language Bit++ is a sequence, consisting of exactly one operation and one variable x. The statement is written without spaces, that is, it can only contain characters \"+\", \"-\", \"X\". Executing a statement means applying the operation it contains.\r\n\r\nA programme in Bit++ is a sequence of statements, each of them needs to be executed. Executing a programme means executing all the statements it contains.\r\n\r\nYou're given a programme in language Bit++. The initial value of x is 0. Execute the programme and find its final value (the value of the variable when this programme is executed).\r\n\r\nInput\r\nThe first line contains a single integer n (1≤n≤150) — the number of statements in the programme.\r\n\r\nNext n lines contain a statement each. Each statement contains exactly one operation (++ or --) and exactly one variable x (denoted as letter «X»). Thus, there are no empty statements. The operation and the variable can be written in any order.\r\n\r\nOutput\r\nPrint a single integer — the final value of x.\r\n'''\r\n\r\n\r\n\r\n\r\nn = int(input())\r\nret = 0\r\nfor i in range(n):\r\n line = input()\r\n if 'X' in line:\r\n if '++' in line:\r\n ret += 1\r\n elif '--' in line:\r\n ret -= 1\r\nprint(ret)", "def program(m, k):\n x = 0\n\n for i in range(m):\n statement = k[i]\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n\n return x\n\nm = int(input().strip())\n\nk = [input().strip() for _ in range(m)]\n\nfinal_value = program(m, k)\n\nprint(final_value)\n\n \t \t\t \t \t\t \t \t \t \t\t \t", "t = int(input())\ncount = 0\n\nfor i in range(t):\n op = input()\n if op[1] == '+':\n count = count + 1\n else:\n count = count - 1\n\nprint(count)", "def execute_program(n, statements):\n x = 0 # Initialize the variable x\n\n for statement in statements:\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n\n return x\n\n# Read the number of statements\nn = int(input())\n\nstatements = []\nfor _ in range(n):\n statement = input()\n statements.append(statement)\n\nfinal_value = execute_program(n, statements) # Execute the program\nprint(final_value)\n \t \t \t \t\t \t\t\t\t\t\t\t\t\t \t \t\t", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n st = input()\r\n if((st[0]=='+') or (st[2]=='+')):\r\n s+=1\r\n else: s-=1\r\nprint(s)\r\n", "import sys\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 return input().strip()\r\n\r\n\r\ndef out(x):\r\n sys.stdout.write(str(x) + \"\\n\")\r\n\r\n\r\ndef main():\r\n count = inp()\r\n init_value = 0\r\n for _ in range(count):\r\n operations = insr().split()\r\n for operation in operations:\r\n if '--' in operation:\r\n init_value -= 1\r\n elif '++' in operation:\r\n init_value += 1\r\n out(init_value)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "num = int(input())\r\nr = 0\r\n\r\nfor i in range(0, num):\r\n data = input()\r\n if data == \"X++\" or data == \"++X\":\r\n r += 1\r\n else:\r\n r -= 1\r\nprint(r)", "iniValue = 0\r\nfor i in range(int(input())):\r\n a =input()\r\n if \"++\" in a:\r\n iniValue +=1\r\n else:\r\n iniValue -=1\r\nprint(iniValue)", "n = int(input())\r\n\r\narr = []\r\n\r\nfor i in range(n):\r\n arr.append(input())\r\n \r\nr = 0 \r\nfor v in arr:\r\n if \"+\" in v:\r\n r += 1 \r\n else :\r\n r -= 1\r\n\r\nprint(r)", "def main():\n counter = 0\n for i in range(int(input())):\n word = input()\n if \"+\" in word:\n counter += 1\n else:\n counter -= 1\n print(counter)\n\nmain()\n\t\t \t\t \t\t\t\t\t \t \t \t\t \t\t\t", "n=int(input())\r\nX=0\r\nfor i in range(n):\r\n m=input()\r\n if m==\"++X\" or m==\"X++\":\r\n X+=1\r\n else:\r\n X-=1\r\nprint(X)", "X = 0\r\nfor i in range(int(input())):\r\n l = list(input())\r\n if \"+\" in l:\r\n X+=1\r\n elif \"-\" in l:\r\n X-=1\r\nprint(X)", "x = int(input())\r\nc = 0\r\nfor _ in range(x):\r\n e = input()\r\n if \"++\" in e:\r\n c += 1\r\n else:\r\n c -= 1\r\nprint(c)", "n = 0\r\nx = 0\r\nn = int(input())\r\ns = \"\"\r\nwhile n > 0:\r\n s = input()\r\n if s[1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\n n -= 1\r\nprint(x)", "n=int(input())\r\ny=0\r\nfor i in range(n):\r\n x=input()\r\n if(x[1]=='+'):\r\n y=y+1\r\n else:\r\n y=y-1\r\nprint(y)", "n = int(input())\r\nX = 0\r\nfor i in range(n):\r\n s = input()\r\n if s == '++X' or s == 'X++':\r\n X += 1\r\n elif s == '--X' or s == 'X--':\r\n X -= 1\r\nprint(X)", "n = int(input())\r\na = int(0)\r\ndef AorS(b):\r\n c = len(b)\r\n d = int(0)\r\n for i in range(c):\r\n if b[i] == '+':\r\n d += 1\r\n elif b[i] == '-':\r\n d += 2\r\n return d\r\nfor i in range(n):\r\n e = input()\r\n f = AorS(e)\r\n if f == 4:\r\n a -= 1\r\n elif f == 2:\r\n a += 1\r\nprint(a)", "num1=int(input())\nx=0\nfor i in range(num1):\n s=input()\n if s[0]==\"+\" or s[2]==\"+\":\n x=x+1\n\n else:\n x=x-1\n\nprint (x)\n\n\n \t \t \t\t\t\t\t\t\t\t \t \t", "n = int(input())\r\nsum = 0\r\ns1 = \"\"\r\nfor i in range(n):\r\n s1 = input()\r\n if \"++\" in s1:\r\n sum += 1\r\n if \"--\" in s1:\r\n sum -= 1\r\nprint(sum)\r\n ", "t=int(input())\r\ng=0\r\nfor _ in range(t):\r\n\td=input()\r\n\tif d==\"X++\" or d==\"++X\":\r\n\t\tg+=1\r\n\telse:\r\n\t\tg-=1\r\nprint(g)", "op=int(input())\r\nab=[]\r\nx=0\r\nfor i in range(0,op):\r\n bs=input()\r\n ab.append(bs)\r\nfor i in range(0,op):\r\n if ab[i][1]==\"+\":\r\n x+=1\r\n elif ab[i][1]==\"-\":\r\n x-=1\r\nprint(x)", "# Initialize the variable\r\nx = 0\r\n\r\n# Read the number of statements\r\nn = int(input())\r\n\r\n# Iterate through each statement\r\nfor _ in range(n):\r\n statement = input()\r\n\r\n # Check the statement\r\n if \"++\" in statement:\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\n# Print the value of x\r\nprint(x)", "n = int(input())\r\nx = 0\r\nfor _ in range(n):\r\n S = input()\r\n if (S == \"++X\" or S == \"X++\"):\r\n x += 1\r\n if (S == \"--X\" or S == \"X--\"):\r\n x -= 1\r\nprint(x)\r\n", "n = int(input())\r\nresult = 0\r\n\r\nfor _ in range (n):\r\n operation = input()\r\n if \"+\" in operation:\r\n result += 1\r\n elif \"-\" in operation:\r\n result -= 1\r\n\r\nprint(result)", "n = int(input())\r\n\r\nx = 0\r\nfor i in range(n):\r\n cmd = input()\r\n x += 1 if cmd[1] == '+' else -1\r\n \r\nprint(x)", "inputNums = int(input())\n\nsum = 0\n\nfor i in range(inputNums):\n operation = input()\n\n if operation == \"++x\" or operation == \"x++\" or operation == \"X++\" or operation == \"++X\": \n sum += 1\n elif operation == \"--x\" or operation == \"x--\" or operation == \"X--\" or operation == \"--X\":\n sum -= 1\n\nprint(sum)\n\t \t \t\t\t\t \t \t \t\t\t\t\t \t\t \t\t \t", "x = 0\r\n\r\nfor i in range(int(input())):\r\n\r\n if \"+\" in input():\r\n\r\n x = x + 1\r\n\r\n else:\r\n\r\n x = x - 1\r\n \r\nprint(x)\r\n", "num = int(input())\r\nstep = 0\r\nX = 0\r\n\r\nwhile step < num:\r\n task = input()\r\n if task == \"++X\" or task == \"X++\":\r\n X += 1\r\n elif task == \"--X\" or task == \"X--\":\r\n X = X - 1\r\n step += 1\r\n\r\nprint(X)\r\n\r\n\r\n", "n=int(input())\r\nsum1=0\r\nfor i in range(n):\r\n str1=str(input())\r\n \r\n if(str1[1]==\"+\" )or (str1[2]==\"+\"):\r\n sum1+=1 \r\n else:\r\n sum1=sum1-1\r\nprint(sum1)\r\n ", "len_input=int(input())\r\nx=0\r\nfor item in range(len_input):\r\n bit_word=str(input())\r\n if(\"--\" in bit_word):\r\n x-=1 \r\n elif(\"++\" in bit_word):\r\n x+=1 \r\nprint(x)\r\n", "n = int(input())\r\n\r\n\r\nco = 0\r\nfor i in range(n):\r\n \r\n t = input()\r\n \r\n if t == \"++X\" or t == \"X++\":\r\n co+=1\r\n else:\r\n co-=1\r\n \r\nprint(co)\r\n ", "n = int(input())\r\nstatements = list()\r\nfor i in range(n):\r\n inp = input()\r\n statements.append(inp)\r\nx = 0\r\nfor statement in statements:\r\n if statement in ['++X', 'X++']:\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)\r\n", "# Template Codeforces\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(): #integer\r\n return(int(input()))\r\n\r\n############ ---- Problem Solution ---- ############\r\ndef main():\r\n cases = inp()\r\n x = 0\r\n for _ in range(cases):\r\n if '++' in input():\r\n x+=1\r\n else:\r\n x-=1\r\n sys.stdout.write(str(x) + \"\\n\")\r\n \r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\narray=[]\r\nvalue=0\r\nfor i in range(n):\r\n string=input()\r\n array.append(string)\r\n\r\nfor m in range(len(array)): \r\n\r\n if array[m]=='++X' or array[m]=='X++':\r\n value+=1\r\n \r\n else:\r\n value-=1\r\n \r\nprint(value)\r\n", "n = int(input())\r\nx = 0\r\nfor i in range(0,n):\r\n bit = list(str(input(\"\")))\r\n ops = []\r\n for j in range(0,len(bit)):\r\n if bit[j] == \"+\":\r\n x += (0.5)\r\n if bit[j] == \"-\":\r\n x -= (0.5)\r\nprint(int(x))", "# Initialize the variable x\nx = 0\n\n# Input\nn = int(input()) # Number of statements\n\n# Process each statement\nfor _ in range(n):\n statement = input()\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n\n# Output the final value of x\nprint(x)\n\n\t \t \t \t\t \t \t\t\t\t \t \t\t\t \t", "def main():\r\n n = int(input())\r\n x = 0\r\n for _ in range(n):\r\n S = input()\r\n if S[1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\n print(x)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "M=int(input())\r\ncount=0\r\nfor U in range(0,M):\r\n X=input()\r\n if(X==\"X++\"or X==\"++X\"):\r\n count=count+1; \r\n \r\n if(X==\"X--\" or X==\"--X\"):\r\n count=count-1; \r\n \r\nprint(count)", "n= int(input())\r\nresult= 0\r\nfor i in range(n):\r\n\ts= str(input())\r\n\tif s== '++X' or s=='X++':\r\n\t\tresult+=1\r\n\telse:\r\n\t\tresult -=1\r\nprint(result)", "user = int(input())\r\ncontent = []\r\noutput = 0\r\n\r\nfor i in range(user):\r\n content.append(input())\r\n\r\nfor i in content:\r\n if '+' in i:\r\n output += 1\r\n else:\r\n output -= 1\r\n\r\nprint(output)", "x =0\nn = int(input())\nfor i in range(n):\n sign = input()\n if sign[1] == \"+\":\n x+=1\n if sign[1] == \"-\" :\n x-=1\nprint(x)\n \t \t \t\t\t\t \t\t \t\t \t\t\t \t \t\t", "n = int(input())\r\nx = 0\r\nfor _ in range(n):\r\n \r\n ele = input()\r\n if ele[0] == \"+\" or ele[2] == \"+\":\r\n x += 1\r\n else:\r\n x-= 1\r\nprint(x)\r\n", "n= int(input())\r\n\r\narr= []\r\n\r\nfor i in range(n):\r\n arr1= input()\r\n \r\n arr.append(arr1)\r\n\r\n#print(arr)\r\n\r\nx=0\r\n\r\nfor i in arr:\r\n for j in i:\r\n if j=='+':\r\n x+=1\r\n break\r\n \r\n elif j=='-':\r\n x-=1\r\n break\r\n\r\nprint(x)", "n = int (input())\r\nx = 0\r\nfor i in range (0,n):\r\n s = input()\r\n if s==\"++X\" or s==\"X++\":\r\n x+=1\r\n elif s==\"--X\" or s==\"X--\":\r\n x-=1\r\nprint(x)", "#https://codeforces.com/problemset/problem/282/A\r\nsum=0\r\nfor i in range(int(input())):\r\n a=input()\r\n if \"+\" in a:\r\n sum+=1\r\n elif \"-\" in a:\r\n sum-=1\r\nprint(sum)", "n=int(input())\r\nX=0\r\nfor i in range(n):\r\n a=input()\r\n if a==\"X++\" or a==\"++X\":\r\n X+=1\r\n elif a==\"X--\" or a==\"--X\":\r\n X-=1\r\nprint(X)", "n=int(input())\r\n\r\nx=0\r\nfor i in range(n):\r\n s=input()\r\n if(s==\"X++\" or s==\"++X\"):\r\n x+=1\r\n else:\r\n x-=1\r\n\r\nprint(x)", "n = int(input())\r\na = 0\r\nfor i in range(n):\r\n x = input()\r\n if \"++\" in x:\r\n a += 1\r\n else:\r\n a -= 1\r\nprint(a)", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nX = 0\r\nfor i in s:\r\n if '++' in i: X+=1\r\n if '--' in i: X-=1\r\nprint(X)", "n = int(input())\r\nx = 0\r\nfor i in range (n):\r\n y = input()\r\n if y [1]== \"+\":\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)", "a = int(input())\r\nk=0\r\nfor i in range(a):\r\n b = str(input())\r\n if b[1] == '+':\r\n k += 1\r\n else:\r\n k -= 1\r\nprint(k)\r\n", "n = int(input())\r\nx = 0\r\n\r\nwhile n > 0:\r\n operation = input()\r\n if \"+\" in operation:\r\n x += 1\r\n else:\r\n x -= 1\r\n n -=1\r\n\r\nprint (x)", "n = int(input())\r\ncount = 0\r\nb = \"++\"\r\nc = \"--\"\r\nfor t in range(n):\r\n a = input()\r\n if(b in a):\r\n count += 1\r\n elif(c in a):\r\n count -= 1\r\nprint(count)", "n = int(input())\r\ncou = 0\r\nfor i in range(n):\r\n\tx = input()\r\n\tif '--' in x:\r\n\t\tcou -= 1\r\n\telse:\r\n\t\tcou += 1\r\nprint(cou)", "n = int(input())\r\nx = 0\r\nfor i in range(n):\r\n operation = input()\r\n if operation == '++X' or operation == 'X++':\r\n x += 1\r\n elif operation == '--X' or operation == 'X--':\r\n x -= 1\r\nprint(x)", "n=int(input())\r\nval=0\r\nfor i in range(n):\r\n s=input()\r\n if \"++\" in s:\r\n val=val+1\r\n if \"--\" in s:\r\n val=val-1\r\nprint(val) \r\n \r\n ", "t = int(input())\r\nx = 0\r\nfor i in range(t):\r\n s = input()\r\n if(\"++\" in s):\r\n x+=1\r\n else:\r\n x-=1\r\n \r\nprint(x)", "a = int(input())\r\nx = 0\r\n\r\nfor i in range(a):\r\n b = input()\r\n if b[1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)\r\n", "n = 0\r\nfor i in range(int(input())):\r\n k = input()\r\n if k[0] == '+' or k[1] == '+':\r\n n += 1\r\n else:\r\n n -= 1\r\nprint(n)", "n = int(input())\r\nresult = 0\r\nwhile n:\r\n s = input()\r\n result += 1 if \"+\" in s else -1\r\n n -= 1\r\n\r\nprint(result)", "a=int(input())\r\nx=0\r\nfor i in range(0,a):\r\n b=input()\r\n if (b[0]=='+' or b[2]=='+'):\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)", "n=int(input())\r\na=[]\r\nq=0\r\nfor i in range(n):\r\n a.append(input())\r\n if a[i][0]=='+' and a[i][1]=='+' or a[i][-1]=='+' and a[i][-2]:\r\n q+=1\r\n else:\r\n q-=1\r\nprint(q)", "num = int(input())\r\nx = 0 \r\nfor i in range(num):\r\n s = input()\r\n if s[1] == \"+\":\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)", "n = int(input())\r\ncou = 0\r\n\r\nfor i in range(n):\r\n a = str(input())\r\n if a[0] == '+' or a[len(a) - 1] == '+':\r\n cou += 1\r\n\r\n elif a[0] == '-' or a[len(a) - 1] == '-':\r\n cou -= 1\r\n\r\nprint(cou)", "print(sum(1 if \"++\" in input() else -1 for _ in range(int(input()))))", "n = int(input())\r\nl = 0\r\nfor i in range(n):\r\n k = input()\r\n if \"++\" in k:\r\n l += 1\r\n if \"--\" in k:\r\n l -= 1\r\nprint(l)", "n = int(input(\"\"))\ncount = 0\nfor i in range(n):\n s = input(\"\")\n if s[1] == \"+\":\n count = count + 1\n if s[1] == \"-\":\n count = count - 1\nprint(count)\n\t\t \t\t \t\t \t \t\t\t \t \t \t \t\t \t\t\t\t", "a = int(input())\r\n\r\nd = []\r\nfor i in range(a):\r\n n = input()\r\n d.append(n)\r\n\r\nk = 0\r\n\r\nfor j in d:\r\n if \"++\" in j:\r\n k+=1\r\n else:\r\n k-=1\r\n\r\nprint(k)\r\n", "t = int(input(\"\"))\r\nx = 0\r\nfor i in range (0,t):\r\n statement = input(\"\")\r\n if statement[1] == '+':\r\n x = x + 1\r\n else:\r\n x = x - 1\r\nprint(x)", "x = 0\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n operation = input()\r\n if \"++\" in operation:\r\n x += 1\r\n elif \"--\" in operation:\r\n x -= 1\r\n\r\nprint(x)", "t = int(input())\r\n\r\nc = 0\r\n\r\nfor i in range(t):\r\n\r\n s = input()\r\n\r\n if s[1] == '+': c += 1\r\n else: c -= 1\r\n\r\nprint(c)", "n = int(input())\r\noperation_input = [list(map(str, input().split())) for i in range(n)]\r\nx = 0\r\noperation_plus = [['++X'], ['X++']]\r\noperation_minus = [['--X'], ['X--']]\r\n\r\nfor i in operation_input:\r\n if i in operation_plus:\r\n x += 1\r\n if i in operation_minus:\r\n x -= 1\r\n\r\nprint(x)", "def operation(l):\r\n x=0\r\n for i in l:\r\n if i==\"++\":\r\n x+=1\r\n else:\r\n x-=1\r\n return x\r\n\r\nn=int(input())\r\n#list if operations\r\nopl=[]\r\nfor i in range(n):\r\n s=input()\r\n t=s.replace(\"X\",\"\")\r\n opl.append(t)\r\n\r\nprint(operation(opl))\r\n\r\n", "x = 0\r\nn = int(input())\r\nfor i in range(n):\r\n operation = str(input()) \r\n if \"+\" in operation:\r\n x+=1\r\n elif \"-\" in operation:\r\n x-=1\r\nprint(x)", "n = int(input())\r\nx = 0\r\n\r\nfor i in range(n):\r\n o = input()\r\n if '++' in o:\r\n x += 1\r\n elif '--' in o:\r\n x -= 1\r\n\r\nprint(x)", "n = int(input())\r\ninstructions = [input() for _ in range(n)]\r\nx = sum(1 if '+' in instruction else -1 for instruction in instructions)\r\nprint(x)\r\n", "x=int(input())\r\ncount=0\r\nfor i in range(x):\r\n ss=input()\r\n if (ss[0]=='-') \| (ss[-1]=='-'):\r\n count-=1\r\n else:\r\n count+=1\r\nprint(count) ", "out = 0\r\nfor i in range(int(input())):\r\n inp = input()\r\n if \"+\" in inp:\r\n out+=1\r\n elif \"-\" in inp:\r\n out-=1\r\nprint(out)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n l=input()\r\n if(l[1]=='+'):\r\n x=x+1\r\n if(l[1]=='-'):\r\n x=x-1\r\nprint(x)\r\n \r\n \r\n ", "n,count=int(input()),0\r\nfor i in range(n):\r\n count+=1 if \"++\" in input() else -1\r\nprint(count)", "ans = 0\r\nfor i in range(int(input())):\r\n a =input()\r\n if \"+\" in a:\r\n ans+=1\r\n elif \"-\" in a:\r\n ans-=1\r\nprint(ans)", "n = int(input())\r\ncounter = 0\r\nfor i in range(n):\r\n string1 = input()\r\n if string1 == \"X++\" or string1 == \"++X\":\r\n counter += 1\r\n else:\r\n counter -= 1\r\nprint(counter)", "val=0\r\nn = int(input())\r\nfor i in range(n):\r\n first = input().lower()\r\n\r\n if first == '++x' or first =='x++':\r\n val+=1\r\n elif first =='x--' or first =='--x':\r\n val-=1\r\nprint(val)\r\n\r\n", "sum = 0\r\nt = int(input())\r\nfor _ in range(t):\r\n s = input()\r\n if(s[1] == '+'):\r\n sum+=1\r\n else:\r\n sum-=1\r\nprint(sum)", "x=0\r\nop = int(input())\r\noperation_dict = {\r\n \"X++\": 1,\r\n \"++X\": 1,\r\n \"--X\": -1,\r\n \"X--\":-1,\r\n }\r\nfor i in range(op):\r\n x+=operation_dict.get(input())\r\nprint(x)", "a = int(input())\r\nl = 0\r\nfor n in range(a):\r\n s = input()\r\n if s==\"X++\" or s==\"++X\":\r\n l+=1\r\n elif s==\"--X\" or \"X--\":\r\n l-=1\r\nprint(l)", "n = int(input())\r\nl = []\r\nz = 0\r\nwhile z < n:\r\n y = input(\"\")\r\n l.append(y)\r\n z += 1\r\nx = 0\r\nfor i in l:\r\n if \"+\" in i:\r\n x += (i.count(\"+\"))/2\r\n elif \"-\" in i:\r\n x -= (i.count(\"-\"))/2\r\nprint(int(x))", "n = int(input())\nX= 0\n\nfor i in range(n):\n s = input()\n if \"++\" in s:\n X = X+ 1\n else:\n X = X - 1\n\nprint(X)\n\n\t \t \t\t \t \t\t\t\t \t \t \t\t \t\t\t", "x = 0\n\n\nfor i in range(int(input())):\n\tstatement = input()\n\tif statement[:2] == \"++\" or statement[1:] == \"++\":\n\t\tx += 1\n\telif statement[:2] == \"--\" or statement[1:] == \"--\":\n\t\tx -= 1\n\nprint(x)\n", "Number = int(input())\r\nValue = 0;\r\n\r\n\r\nfor i in range(Number):\r\n Bit = str(input())\r\n if Bit == \"++X\" or Bit == \"X++\" or Bit == \"x++\" or Bit == \"++x\":\r\n Value = Value + 1\r\n elif Bit == \"--X\" or Bit == \"X--\" or Bit == \"x--\" or Bit == \"--x\":\r\n Value = Value - 1\r\n \r\nprint(Value)", "t = int(input())\r\nres = 0\r\nfor _ in range(t):\r\n str = input()\r\n if '+' in str:\r\n res += 1\r\n else:\r\n res -= 1\r\nprint(res)", "n=int(input(\"\"))\nl=[]\nx=0\nfor i in range(n):\n l.append(input())\nfor i in l:\n if \"+\" in i:\n x+=1\n else:\n x-=1\nprint(x)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n s=list(input())\r\n if s[0]=='X':\r\n if s[1]=='-':\r\n x=x-1\r\n else:\r\n x=x+1\r\n else:\r\n if s[0]=='-':\r\n x-=1\r\n else:\r\n x+=1\r\nprint(x)\r\n", "inp = int(input())\r\nlist = []\r\na = 0\r\nfor i in range(0, inp):\r\n b = input()\r\n if b == \"++X\" or b == \"X++\" :\r\n a = a+1\r\n if b == \"--X\" or b == \"X--\" :\r\n a = a-1\r\nprint(a)\r\n", "n = int(input())\r\n\r\nx = 0\r\nfor i in range(n):\r\n inp = input()\r\n if(inp==\"X++\" or inp==\"++X\"):\r\n x+=1\r\n elif(inp==\"--X\" or inp==\"X--\"):\r\n x-=1\r\nprint(x) ", "n = int(input()) # Number of statements in the program\r\nx = 0 # Initial value of variable x\r\n\r\n# Process each statement and perform the operation\r\nfor _ in range(n):\r\n statement = input() # Read the statement\r\n\r\n # Check the operation and update the variable x accordingly\r\n if \"++\" in statement:\r\n x += 1\r\n else: # Statement contains \"--\"\r\n x -= 1\r\n\r\n# Output the final value of variable x\r\nprint(x)\r\n", "statements = input()\r\nint_state = int(statements)\r\nx = 0\r\nfor i in range(int_state):\r\n n = input()\r\n if \"+\" in n:\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)", "x = 0\r\n\r\ninp2s = []\r\n\r\ninp1 = int(input())\r\n\r\nfor q in range(inp1):\r\n inp2 = input()\r\n inp2s.append(inp2)\r\n\r\n\r\nfor i in inp2s:\r\n for v in [*i]:\r\n if v == \"+\":\r\n x = x + 0.5\r\n if v == \"-\":\r\n x = x - 0.5\r\n\r\n\r\nprint(int(x))", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n a=str(input())\r\n if a=='++X' or a=='X++':\r\n x+=1 \r\n elif a=='--X' or a=='X--':\r\n x-=1 \r\nprint(x)", "n= int(input())\r\nz=0\r\nfor i in range(n):\r\n ops=input()\r\n if (ops[0]==\"+\" or ops[-1]==\"+\"):\r\n z+=1\r\n else:\r\n z-=1\r\n\r\nprint(z)", "ans = 0\n\nn = int(input())\n\nfor i in range(n):\n x = input()\n if x.__contains__(\"++\"):\n ans += 1\n elif x.__contains__(\"--\"):\n ans -= 1\n\nprint(ans)\n", "ans = 0\nfor i in range(int(input())):\n s = input()\n if s[1] == '+':\n ans += 1\n else:\n ans -= 1\nprint(ans)", "x = 0\r\nfor i in range(int(input())):\r\n operation = input().lower()\r\n if operation in [\"++x\", \"x++\"]:\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)", "def execute_bit_program(program):\r\n # Khởi tạo giá trị ban đầu của x là 0\r\n x = 0\r\n # Duyệt qua từng câu lệnh trong chương trình\r\n for statement in program:\r\n # Nếu câu lệnh có chứa ++ thì tăng x lên 1\r\n if \"++\" in statement:\r\n x += 1\r\n # Nếu câu lệnh có chứa -- thì giảm x đi 1\r\n elif \"--\" in statement:\r\n x -= 1\r\n # Trả về giá trị cuối cùng của x\r\n return x\r\n\r\n# Nhập số nguyên n là số lượng câu lệnh trong chương trình\r\nn = int(input())\r\n# Khởi tạo một danh sách rỗng để lưu trữ các câu lệnh\r\nprogram = []\r\n# Lặp n lần để nhập các câu lệnh\r\nfor i in range(n):\r\n # Nhập một câu lệnh và thêm vào danh sách\r\n statement = input()\r\n program.append(statement)\r\n# Gọi hàm execute_bit_program với đối số là danh sách các câu lệnh\r\n# và in ra kết quả trả về\r\nprint(execute_bit_program(program))\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\ni=l.count(\"X++\")\r\nj=l.count(\"++X\")\r\nk=l.count(\"X--\")\r\nm=l.count(\"--X\")\r\nu=i+j\r\nv=k+m\r\nprint(u-v)\r\n", "x=0\nn=input()\nn=int (n)\nfor i in range(n):\n baraa=input ()\n if baraa==(\"++X\")or baraa==(\"X++\"):\n x=x+1\n else:\n x=x-1\nprint(x)\n \t \t \t\t\t\t\t \t\t\t \t \t\t\t\t\t \t \t", "\r\nn = int(input())\r\n\r\ninputs = []\r\n\r\nfor x in range(0,n):\r\n if '+' in input():ret = 1\r\n else: ret = -1\r\n inputs.append(ret)\r\n\r\n\r\nprint(sum(inputs))", "import re\r\n\r\n\r\nn = int(input())\r\nvalue = 0\r\n\r\nfor i in range(n):\r\n statement = input()\r\n match_plus = re.search(\"\\+\\+\", statement)\r\n # match_minus = re.match('--', statement)\r\n if match_plus:\r\n value += 1\r\n else:\r\n value -= 1\r\n\r\nprint(value)\r\n", "'''\nA. Bit++\nhttps://codeforces.com/problemset/problem/282/A\n'''\n\nimport math\n\ndef main():\n n = int(input())\n x = 0\n for _ in range(n):\n s = input()\n if s == 'X++' or s == '++X':\n x += 1\n else:\n x -= 1\n\n print(x)\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n b = input()\r\n a.append(b)\r\np=0\r\nfor i in range(n):\r\n if a[i][1] == '+':\r\n p+=1\r\n else:\r\n p-=1\r\nprint(p) \r\n\r\n", "import sys\r\ninput1 = int(sys.stdin.readline())\r\nresult = 0\r\nfor i in range(input1):\r\n input2 = str(sys.stdin.readline())\r\n if input2[1] == \"+\":\r\n result += 1\r\n else:\r\n result -= 1\r\nsys.stdout.write(str(result))", "t=int(input())\r\nx=0\r\nfor i in range(t):\r\n a=input()\r\n if '+' in a:\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)", "count=0\nfor _ in range(int(input())):\n s=input()\n if s[1]=='+':\n count+=1\n else:\n count-=1\nprint(count)\n \t\t \t\t \t \t \t \t \t \t\t \t \t", "print(sum([1 if input()[1]=='+' else -1 for i in range(int(input()))]))", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n operation = input()\r\n if operation == \"X++\" or operation == \"++X\":\r\n count += 1\r\n else:\r\n count -= 1\r\nprint(count)", "n = int(input())\r\nx = 0\r\nfor i in range (0,n):\r\n a = input()\r\n if (a==\"X++\" or a==\"++X\"):\r\n x = x + 1\r\n else:\r\n x = x - 1\r\n\r\nprint(x)", "c=0\r\nfor i in range(int(input())):\r\n s=input()\r\n for i in range(len(s)-1):\r\n if(s[i]=='+' and s[i+1]=='+'):\r\n c+=1\r\n elif(s[i]=='-' and s[i+1]=='-'):\r\n c-=1\r\nprint(c)", "num=int(input())\ncounter=0\nwhile num!=0:\n num-=1\n word=input()\n if \"++\" in word:\n counter+=1\n elif \"--\" in word:\n counter-=1\n \nprint(counter)", "t=int(input())\r\ns=0\r\nfor i in range(t):\r\n x=input()\r\n if x==\"++X\" or x==\"X++\":\r\n s+=1\r\n else:\r\n s-=1\r\n \r\nprint(s)", "n = int(input())\nx = 0\nfor statement in range(n):\n operation = input()\n for _ in operation:\n if _ == '+':\n x += 1\n break\n elif _ == '-':\n x -= 1\n break\nprint(x)", "X = 0\r\nfor t in range(int(input())):\r\n n = input()\r\n if n == \"X++\":\r\n X += 1\r\n elif n == \"++X\":\r\n X += 1\r\n elif n == \"--X\":\r\n X -= 1\r\n elif n == \"X--\":\r\n X -= 1\r\nprint(X)", "n = int(input())\r\nxvalue = 0\r\n\r\nwhile n > 0:\r\n s = input()\r\n if s == \"++X\" or s == \"X++\":\r\n xvalue += 1\r\n elif s == \"--X\" or s == \"X--\":\r\n xvalue -= 1\r\n n = n - 1\r\n\r\nprint(xvalue)\r\n" ]	{"inputs": ["1\n++X", "2\nX++\n--X", "3\n++X\n++X\n++X", "2\n--X\n--X", "5\n++X\n--X\n++X\n--X\n--X", "28\nX--\n++X\nX++\nX++\nX++\n--X\n--X\nX++\nX--\n++X\nX++\n--X\nX--\nX++\nX--\n++X\n++X\nX++\nX++\nX++\nX++\n--X\n++X\n--X\n--X\n--X\n--X\nX++", "94\nX++\nX++\n++X\n++X\nX--\n--X\nX++\n--X\nX++\n++X\nX++\n++X\n--X\n--X\n++X\nX++\n--X\nX--\nX--\n--X\nX--\nX--\n--X\n++X\n--X\nX--\nX--\nX++\n++X\n--X\nX--\n++X\n--X\n--X\nX--\nX--\nX++\nX++\nX--\nX++\nX--\nX--\nX--\n--X\nX--\nX--\nX--\nX++\n++X\nX--\n++X\nX++\n--X\n--X\n--X\n--X\n++X\nX--\n--X\n--X\n++X\nX--\nX--\nX++\n++X\nX++\n++X\n--X\n--X\nX--\n++X\nX--\nX--\n++X\n++X\n++X\n++X\nX++\n++X\n--X\nX++\n--X\n--X\n++X\n--X\nX++\n++X\nX++\n--X\nX--\nX--\n--X\n++X\nX++", "56\n--X\nX--\n--X\n--X\nX--\nX--\n--X\nX++\n++X\n--X\nX++\nX--\n--X\n++X\n--X\nX--\nX--\n++X\nX--\nX--\n--X\n++X\n--X\n++X\n--X\nX++\n++X\nX++\n--X\n++X\nX++\nX++\n--X\nX++\nX--\n--X\nX--\n--X\nX++\n++X\n--X\n++X\nX++\nX--\n--X\n--X\n++X\nX--\nX--\n--X\nX--\n--X\nX++\n--X\n++X\n--X", "59\nX--\n--X\nX++\n++X\nX--\n--X\n--X\n++X\n++X\n++X\n++X\nX++\n++X\n++X\nX++\n--X\nX--\nX++\n++X\n--X\nX++\n--X\n++X\nX++\n--X\n--X\nX++\nX++\n--X\nX++\nX++\nX++\nX--\nX--\n--X\nX++\nX--\nX--\n++X\nX--\nX++\n--X\nX++\nX--\nX--\nX--\nX--\n++X\n--X\nX++\nX++\nX--\nX++\n++X\nX--\nX++\nX--\nX--\n++X", "87\n--X\n++X\n--X\nX++\n--X\nX--\n--X\n++X\nX--\n++X\n--X\n--X\nX++\n--X\nX--\nX++\n++X\n--X\n++X\n++X\n--X\n++X\n--X\nX--\n++X\n++X\nX--\nX++\nX++\n--X\n--X\n++X\nX--\n--X\n++X\n--X\nX++\n--X\n--X\nX--\n++X\n++X\n--X\nX--\nX--\nX--\nX--\nX--\nX++\n--X\n++X\n--X\nX++\n++X\nX++\n++X\n--X\nX++\n++X\nX--\n--X\nX++\n++X\nX++\nX++\n--X\n--X\n++X\n--X\nX++\nX++\n++X\nX++\nX++\nX++\nX++\n--X\n--X\n--X\n--X\n--X\n--X\n--X\nX--\n--X\n++X\n++X", "101\nX++\nX++\nX++\n++X\n--X\nX--\nX++\nX--\nX--\n--X\n--X\n++X\nX++\n++X\n++X\nX--\n--X\n++X\nX++\nX--\n++X\n--X\n--X\n--X\n++X\n--X\n++X\nX++\nX++\n++X\n--X\nX++\nX--\nX++\n++X\n++X\nX--\nX--\nX--\nX++\nX++\nX--\nX--\nX++\n++X\n++X\n++X\n--X\n--X\n++X\nX--\nX--\n--X\n++X\nX--\n++X\nX++\n++X\nX--\nX--\n--X\n++X\n--X\n++X\n++X\n--X\nX++\n++X\nX--\n++X\nX--\n++X\nX++\nX--\n++X\nX++\n--X\nX++\nX++\n++X\n--X\n++X\n--X\nX++\n--X\nX--\n--X\n++X\n++X\n++X\n--X\nX--\nX--\nX--\nX--\n--X\n--X\n--X\n++X\n--X\n--X", "63\n--X\nX--\n++X\n--X\n++X\nX++\n--X\n--X\nX++\n--X\n--X\nX++\nX--\nX--\n--X\n++X\nX--\nX--\nX++\n++X\nX++\nX++\n--X\n--X\n++X\nX--\nX--\nX--\n++X\nX++\nX--\n--X\nX--\n++X\n++X\nX++\n++X\nX++\nX++\n--X\nX--\n++X\nX--\n--X\nX--\nX--\nX--\n++X\n++X\n++X\n++X\nX++\nX++\n++X\n--X\n--X\n++X\n++X\n++X\nX--\n++X\n++X\nX--", "45\n--X\n++X\nX--\n++X\n++X\nX++\n--X\n--X\n--X\n--X\n--X\n--X\n--X\nX++\n++X\nX--\n++X\n++X\nX--\nX++\nX--\n--X\nX--\n++X\n++X\n--X\n--X\nX--\nX--\n--X\n++X\nX--\n--X\n++X\n++X\n--X\n--X\nX--\n++X\n++X\nX++\nX++\n++X\n++X\nX++", "21\n++X\nX++\n--X\nX--\nX++\n++X\n--X\nX--\nX++\nX--\nX--\nX--\nX++\n++X\nX++\n++X\n--X\nX--\n--X\nX++\n++X", "100\n--X\n++X\nX++\n++X\nX--\n++X\nX--\nX++\n--X\nX++\nX--\nX--\nX--\n++X\nX--\nX++\nX++\n++X\nX++\nX++\nX++\nX++\n++X\nX++\n++X\nX--\n--X\n++X\nX--\n--X\n++X\n++X\nX--\nX++\nX++\nX++\n++X\n--X\n++X\nX++\nX--\n++X\n++X\n--X\n++X\nX--\nX--\nX--\nX++\nX--\nX--\nX++\nX++\n--X\nX++\nX++\n--X\nX--\n--X\n++X\n--X\n++X\n++X\nX--\n--X\n++X\n++X\n--X\n--X\n++X\nX++\nX--\nX++\nX--\nX++\nX++\n--X\nX--\nX--\n++X\nX--\n--X\n--X\nX++\n--X\n--X\nX--\nX--\n++X\n++X\nX--\n++X\nX++\n--X\n++X\n++X\nX++\n--X\n--X\nX++", "17\nX++\nX++\n++X\n--X\n--X\n++X\n++X\n--X\nX--\nX++\nX--\n--X\n--X\nX--\n++X\nX--\nX++", "77\n++X\nX++\n--X\nX--\n--X\n--X\nX--\nX++\nX--\nX++\nX--\n++X\n--X\n--X\n--X\n--X\n++X\nX--\nX++\nX--\n--X\nX--\n--X\nX--\n++X\n--X\n++X\n++X\nX++\nX++\nX--\n--X\nX--\nX--\nX++\n--X\n--X\n++X\nX--\nX--\n++X\nX++\nX--\n++X\n--X\nX++\nX--\n++X\n++X\n++X\nX--\nX--\nX--\n--X\n++X\n++X\n++X\nX++\n--X\n--X\n++X\n--X\nX--\nX++\n++X\nX++\n++X\nX--\nX++\nX++\n--X\nX++\nX++\nX++\n--X\nX++\nX--", "21\nX--\n++X\n--X\nX--\n++X\nX--\n++X\nX--\n--X\n++X\nX++\n++X\nX++\n++X\nX--\n--X\nX++\nX++\nX--\n++X\nX--", "1\nX--"], "outputs": ["1", "0", "3", "-2", "-1", "4", "-10", "-14", "3", "-5", "1", "1", "-3", "1", "8", "-1", "-5", "1", "-1"]}	UNKNOWN	PYTHON3	CODEFORCES	497
8e50612d70a28d84b770df9166669c6b	The Monster	As Will is stuck in the Upside Down, he can still communicate with his mom, Joyce, through the Christmas lights (he can turn them on and off with his mind). He can't directly tell his mom where he is, because the monster that took him to the Upside Down will know and relocate him. Thus, he came up with a puzzle to tell his mom his coordinates. His coordinates are the answer to the following problem. A string consisting only of parentheses ('(' and ')') is called a bracket sequence. Some bracket sequence are called correct bracket sequences. More formally: - Empty string is a correct bracket sequence. - if s is a correct bracket sequence, then (s) is also a correct bracket sequence. - if s and t are correct bracket sequences, then st (concatenation of s and t) is also a correct bracket sequence. A string consisting of parentheses and question marks ('?') is called pretty if and only if there's a way to replace each question mark with either '(' or ')' such that the resulting string is a non-empty correct bracket sequence. Will gave his mom a string s consisting of parentheses and question marks (using Morse code through the lights) and his coordinates are the number of pairs of integers (l,<=r) such that 1<=≤<=l<=≤<=r<=≤<=\|s\| and the string slsl<=+<=1... sr is pretty, where si is i-th character of s. Joyce doesn't know anything about bracket sequences, so she asked for your help. The first and only line of input contains string s, consisting only of characters '(', ')' and '?' (2<=≤<=\|s\|<=≤<=5000). Print the answer to Will's puzzle in the first and only line of output. Sample Input ((?)) ??()?? Sample Output 4 7	[ "st=input()\r\nle=len(st)\r\nans=0\r\nfor i in range(le):\r\n l=0\r\n w=0\r\n for j in range(i,le):\r\n if(st[j]==\"(\"):\r\n l+=1\r\n elif(st[j]==\")\"):\r\n l-=1\r\n else:\r\n w+=1\r\n if(l+w<0):\r\n break\r\n elif(w>l):\r\n xx=l\r\n l=w\r\n w=xx\r\n elif(l==w):\r\n ans+=1\r\nprint(ans)", "\r\ndef main():\r\n s = input()\r\n l = len(s)\r\n \r\n pretty_count = 0\r\n for i in range(l):\r\n left_paren_count = 0\r\n right_paren_count = 0\r\n wild_count = 0\r\n for j in range(i, l):\r\n if s[j] == '(':\r\n left_paren_count += 1\r\n elif s[j] == ')':\r\n right_paren_count += 1\r\n else: \r\n wild_count += 1\r\n \r\n if left_paren_count + wild_count < right_paren_count:\r\n break\r\n if left_paren_count < wild_count + right_paren_count:\r\n # Should fix one '?' as '('\r\n wild_count -= 1\r\n left_paren_count += 1\r\n if wild_count < 0:\r\n break\r\n if left_paren_count == wild_count + right_paren_count:\r\n pretty_count += 1\r\n print(pretty_count)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\nimport math\r\nfrom collections import defaultdict,deque\r\ns=sys.stdin.readline()[:-1]\r\nn=len(s)\r\ndp=[[False for _ in range(n)] for x in range(n)]\r\nleft=[n for _ in range(n)]\r\nans=0\r\nfor i in range(n-1,-1,-1):\r\n right=i\r\n for j in range(i+1,n):\r\n if j-i+1==2:\r\n if (s[i]=='(' or s[i]=='?') and (s[j]==')' or s[j]=='?'):\r\n dp[i][j]=True\r\n left[j]=min(left[j],i)\r\n right=j\r\n ans+=1\r\n continue\r\n if (j-i+1)%2==0:\r\n l=left[j]\r\n if dp[i][l-1]:\r\n dp[i][j]=True\r\n left[j]=i\r\n right=j\r\n ans+=1\r\n continue\r\n if dp[right+1][j]:\r\n dp[i][j]=True\r\n left[j]=i\r\n right=j\r\n ans+=1\r\n continue\r\n if (s[i]=='(' or s[i]=='?') and (s[j]==')' or s[j]=='?'):\r\n if dp[i+1][j-1]:\r\n dp[i][j]=True\r\n left[j]=i\r\n right=j\r\n ans+=1\r\n continue\r\n#print(dp,'dp')\r\n'''for i in range(n):\r\n print(dp[i])'''\r\nprint(ans)\r\n \r\n \r\n", "s=input().strip();n=len(s)\r\nques=ans=ini=0\r\nfor i in range(n):\r\n ques=ini=0\r\n for j in range(i,n):\r\n c=s[j]\r\n if(c==\"?\"):ques+=1 \r\n elif(c=='('):ini+=1\r\n else:ini-=1 #present situation dekh li\r\n if(ini<0):break #invalid cheez h bhaaya\r\n if(ques>ini): #agr mujhe wo question mark opening se replace krna jo ki krna hi h\r\n ques-=1;ini+=1; #ye kr denge hum fir\r\n if((j-i+1)%2==0 and ques==ini):ans+=1 #aur ques fir ini ke barabar hi hone chahiye kyu ki hum baa\r\nprint(ans) #baar baar quest mark ko ini jo ki >o h se replace kr rhe h\r\n \r\n ", "s = input()\r\na=0\r\nn=len(s)\r\nfor i in range(n):\r\n l=0\r\n k=0\r\n for j in range(i, n):\r\n l+=s[j]=='('\r\n l-=s[j]==')'\r\n k+=s[j]=='?'\r\n if l+k<0:\r\n break\r\n if k>l:\r\n l,k = k,l\r\n if l==k:\r\n a+=1\r\nprint(a)\r\n", "s = input()\r\nl = len(s)\r\nans = 0\r\nfor i in range(0, l):\r\n m = n = 0\r\n for j in range(i, l):\r\n m += s[j] == '('\r\n m -= s[j] == ')'\r\n n += s[j] == '?'\r\n if m + n < 0:\r\n break\r\n if m < n:\r\n m, n = n, m \r\n ans += m == n\r\nprint (ans)", "s = str(input())\r\nn = len(s)\r\n\r\nans = 0\r\nfor l in range(n-1):\r\n cnt = 0\r\n qu = 0\r\n chk = 0\r\n if s[l] == '(':\r\n cnt += 1\r\n chk += 1\r\n elif s[l] == '?':\r\n qu += 1\r\n chk = max(chk-1, 0)\r\n else:\r\n continue\r\n for r in range(l+1, n):\r\n if s[r] == '(':\r\n cnt += 1\r\n chk += 1\r\n elif s[r] == '?':\r\n qu += 1\r\n chk = max(chk-1, 0)\r\n else:\r\n cnt -= 1\r\n chk = max(chk-1, 0)\r\n if cnt+qu < 0:\r\n break\r\n else:\r\n if (qu-cnt)%2 == 0 and qu-cnt >= 0 and (qu-cnt)//2 <= qu and chk <= 0:\r\n #print(l, r)\r\n ans += 1\r\nprint(ans)\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ndef answer():\r\n\r\n yes = [[1 for i in range(n)] for i in range(n)]\r\n\r\n for i in range(n - 1 , -1 , -1):\r\n\r\n left , right , q = 0 , 0 , 0\r\n for j in range(i , n):\r\n left += (a[j] == '(')\r\n right += (a[j] == ')')\r\n q += (a[j] == '?')\r\n\r\n if(left + q < right):\r\n\r\n for k in range(j , n):\r\n yes[i][k] = 0\r\n\r\n break\r\n\r\n total = left + right + q\r\n if(abs(left - right) > q):yes[i][j] = 0\r\n if(total & 1):yes[i][j] = 0\r\n\r\n \r\n left , right , q = 0 , 0 , 0\r\n for j in range(i , -1 , -1):\r\n left += (a[j] == '(')\r\n right += (a[j] == ')')\r\n q += (a[j] == '?')\r\n\r\n if((right + q) < left):\r\n\r\n for k in range(j + 1):\r\n yes[k][i] = 0\r\n\r\n break \r\n\r\n ans = 0\r\n for i in range(n):\r\n for j in range(i , n):\r\n ans += yes[i][j]\r\n \r\n return ans\r\n \r\n\r\n \r\nfor T in range(1):\r\n\r\n a = input().strip()\r\n n = len(a)\r\n\r\n print(answer())\r\n", "s = input()\r\nres, n = 0, len(s)\r\nfor i in range(n-1):\r\n j, c, q = i , 0, 0\r\n while j < n and c + q >= 0:\r\n if(s[j] == '('): c += 1\r\n elif(s[j] == ')'): c -= 1\r\n else: q += 1\r\n\r\n if(c < q):\r\n c, q = q, c\r\n res += (c == q)\r\n j += 1\r\nprint(res)\r\n", "s = input()\r\nans = 0\r\nfor i in range(0, len(s) - 1):\r\n addQ = 0\r\n subQ = 0\r\n cur = 0\r\n for j in range(i, len(s)):\r\n if s[j] == '(':\r\n cur += 1\r\n elif s[j] == ')':\r\n cur -= 1\r\n if cur < 0 and subQ > 0:\r\n cur += 2\r\n subQ -= 1\r\n addQ += 1\r\n else:\r\n if cur > 0:\r\n subQ += 1\r\n cur -= 1\r\n else:\r\n addQ += 1\r\n cur += 1\r\n if cur < 0:\r\n break\r\n if cur == 0:\r\n ans += 1\r\nprint(ans)\r\n" ]	{"inputs": ["((?))", "??()??", "?????)(???", "()()((?(()(((()()(())(((()((())))(()))(()(((((())))()))(((()()()))))))(((((()))))))))", "))((()(()((((()))())()())((())())(((()()(())))))((())()()(()()(())()))()()(()()()(((()(()(()(()))))(", "????????????????????????????????????????????????????????????????????????????????????????????????????", ")(", "?(", "??", ")?(??((???????()?(?????????)??(????????((?)?????)????)??????(?????)?)?????)??????(??()??????)????????)?)()??????????????())????????(???)??)????????????????????(?????)??)???)??(???????????????)???)??)?", "()", "(?"], "outputs": ["4", "7", "21", "62", "88", "2500", "0", "0", "1", "8314", "1", "1"]}	UNKNOWN	PYTHON3	CODEFORCES	10
8e64f356f5e4e4ae535eb42d9e1ea3df	Fancy Fence	Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot. He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence corners at a single angle a. Will the robot be able to build the fence Emuskald wants? In other words, is there a regular polygon which angles are equal to a? The first line of input contains an integer t (0<=<<=t<=<<=180) — the number of tests. Each of the following t lines contains a single integer a (0<=<<=a<=<<=180) — the angle the robot can make corners at measured in degrees. For each test, output on a single line "YES" (without quotes), if the robot can build a fence Emuskald wants, and "NO" (without quotes), if it is impossible. Sample Input 3 30 60 90 Sample Output NO YES YES	[ "\r\nt = int(input())\r\nrj = []\r\nfor i in range(t):\r\n a = int(input())\r\n\r\n if a < 60:\r\n rj.append('NO')\r\n\r\n else:\r\n n = 3\r\n kut = ((n-2)180)/n\r\n\r\n while a >= kut:\r\n if a == kut:\r\n rj.append('YES')\r\n break\r\n n+=1\r\n kut = ((n-2)180)/n\r\n \r\n else:\r\n rj.append('NO')\r\n\r\nprint(rj, sep = \"\\n\")", "def fence():\r\n a = int(input())\r\n \r\n n = 360 / (180 - a)\r\n \r\n if n == int(n):\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n\r\n\r\nt = int(input())\r\n\r\nfor _ in range(t):\r\n print(fence())", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Oct 12 15:20:42 2022\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\nt=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n print('YES' if 360%(180-a)==0 else'NO')", "\r\nt = int(input())\r\n\r\nfor _ in range(t):\r\n angle = int(input())\r\n\r\n i = 3\r\n\r\n while True:\r\n\r\n total = (i - 2)180\r\n\r\n in_angle = total/i\r\n\r\n if in_angle > angle:\r\n print('NO')\r\n break\r\n\r\n elif angle == in_angle:\r\n print('YES')\r\n break\r\n\r\n i += 1\r\n\r\n\r\n", "#王铭健，工学院 2300011118\r\nt = int(input())\r\nresult_list = []\r\nfor i in range(t):\r\n angle = int(input())\r\n if 360 % (180 - angle) == 0:\r\n result_list.append('YES')\r\n else:\r\n result_list.append('NO')\r\nfor j in result_list:\r\n print(j)", "import math\r\n\r\nfor _ in range( int(input()) ):\r\n a = int(input())\r\n n = (360)/(180-a)\r\n print('YNEOS'[not math.floor(n)==n::2])\r\n", "#黄靖涵 2300098604 工学院 2023秋\r\n\r\nt = int(input())\r\n\r\ndef angle(a):\r\n if 360 % (180 - a):\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\nfor i in range(t):\r\n a = int(input())\r\n ans = angle(a)\r\n print(ans)", "t = int(input())\r\nfor _ in range(t):\r\n angle = int(input())\r\n print(\"YES\" if 360 % (180-angle) == 0 else \"NO\")\r\n", "#I = lambda: [int(i) for i in input().split()]\r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\n\r\n# n = int(input())\r\n# l1 = list(map(int,input().split()))\r\n# n,x = map(int,input().split())\r\n# s = input()\r\nmod = 1000000007\r\n# print(\"Case #\"+str(_+1)+\":\",)\r\n\r\nfrom collections import Counter,defaultdict,deque\r\n#from heapq import heappush,heappop,heapify\r\nimport sys\r\nimport math\r\nimport bisect\r\n\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n if 360%(180-n):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n\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-2) 180 /n = a\r\n# 180 n - 360 = an\r\n# n(180-a) = 360\r\n# n = 360 / (180-a)\r\nt = int(input())\r\nwhile t:\r\n t-=1\r\n a = int(input())\r\n n = 360 / (180-a)\r\n if(int(n)==n):\r\n print('YES')\r\n else:\r\n print('NO')", "w = int(input())\r\nfor i in range(w):\r\n x = int(input())\r\n if (360 / (180 - x)) % 1 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "found=set()\r\nn=3\r\nwhile 1:\r\n ang=(180n-360)/n\r\n if ang>179:\r\n break\r\n if int(ang)n==180n-360:\r\n found.add(int(ang))\r\n n+=1\r\n\r\nt=int(input())\r\nfor _ in range(t):\r\n a=int(input())\r\n if a in found:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "k=int(input())\r\nl=[]\r\nfor i in range(k):\r\n a=int(input())\r\n n=(360)/(180-a)\r\n l.append(n)\r\nfor j in range(len(l)):\r\n if l[j]%1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Sun Oct 15 22:11:18 2023\r\n\r\n@author: huozi\r\n\"\"\"\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n a = int(input())\r\n if 360 % (180 - a) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from sys import stdin\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\nfrom math import floor, ceil\r\n\r\n# input = stdin.readline\r\nread = lambda: map(int, input().strip().split())\r\n\r\nfor test in range(int(input())):\r\n a = int(input())\r\n if floor(360 / (180 - a)) == ceil(360 / (180 - a)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def polygon():\r\n angle = int(input())\r\n counter = 3\r\n if angle < 60:\r\n print(\"NO\")\r\n return\r\n while angle >= ((counter - 2) * 180) / counter:\r\n if angle == ((counter - 2) * 180) / counter:\r\n print(\"YES\")\r\n return\r\n counter += 1\r\n print(\"NO\")\r\n\r\n\r\n\r\ncases = range(int(input()))\r\nfor case in cases:\r\n polygon()", "def solve(a):\r\n for i in range(3, 1000):\r\n ugol = 180 * (i - 2) / i\r\n if ugol == a:\r\n return \"YES\"\r\n return \"NO\"\r\ndef main():\r\n t = int(input())\r\n for z in range(t):\r\n a = int(input())\r\n print(solve(a))\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "for _ in range(int(input())):\r\n K = 360/(180-int(input()))\r\n if K == int(K) and K>=3: print(\"YES\")\r\n else: print(\"NO\")", "for _ in range(int(input())):\r\n angle = int(input())\r\n if (-360 / (angle - 180)) > 0 and (-360 / (angle - 180)) % 1 == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "angles = []\r\nfor i in range(3, 361):\r\n angle = ((i - 2) * 180) / i\r\n if angle == int(angle):\r\n angles.append(int(((i - 2) * 180) / i))\r\n\r\ntests = int(input())\r\nwhile tests > 0:\r\n angle = int(input())\r\n tests -= 1\r\n if angle in angles:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n", "from sys import stdin, stdout\r\nimport math\r\nt = int(stdin.readline())\r\nfor i in range(t):\r\n a = int(stdin.readline())\r\n if (360/(180-a))==math.ceil(360/(180 - a)):\r\n stdout.write(\"YES\\n\")\r\n else:\r\n stdout.write(\"NO\\n\")\r\n \r\n ", "def solve():\r\n n = int(input())\r\n if 360 % (180 - n) == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\n\r\nfor i in range(int(input())):\r\n print(solve())", "\"\"\"\r\n $$$$$ $$$$$ $$$$$$ $ $\r\n $ $ $ $ $ $$ $$\r\n $ $ $ $ $$$$$ $ $$ $\r\n $$$$$ $$$$$ $ $ $\r\n $ $ $ $ $ $\r\n $ $ $ $$$$$$ $ $\r\n \"\"\"\r\nfor _ in range(int(input())):\r\n Q = int(input())\r\n n = 360/(180-Q)\r\n N=360//(180-Q)\r\n if n==N:\r\n print('YES')\r\n else :\r\n print('NO')\r\n", "from sys import stdin, stdout\r\n#from bisect import bisect_left, bisect_right\r\n#from collections import Counter, deque\r\n#from queue import Queue\r\n#import heapq\r\nimport math\r\n#from itertools import permutations, combinations, islice\r\n\r\ndef input():\r\n return stdin.readline().strip()\r\n\r\ndef solve():\r\n a = int(input())\r\n ans = 360/(180-a)\r\n s = math.ceil(360/(180-a))\r\n if ans == s:\r\n return f\"YES\\n\" \r\n else:\r\n return f\"NO\\n\"\r\n\r\ndef main():\r\n n = int(input())\r\n for i in range(n):\r\n stdout.write(solve())\r\n\r\nmain()", "n=int(input())\r\nfor i in range(n):\r\n a = int(input())\r\n if a>179:\r\n print(\"NO\")\r\n else:\r\n k = 360/(180-a)\r\n x1 = str(k)\r\n d = x1.find(\".\")\r\n x2 = x1[d+1:]\r\n if int(x2)>0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "import math\r\ntestAmount = int(input())\r\n\r\nfor i in range(testAmount):\r\n angle = int(input())\r\n sideAmount = 360/(180-angle)\r\n answer = 'NO'\r\n if (sideAmount > 2 and sideAmount == math.ceil(sideAmount)):\r\n answer = 'YES'\r\n print(answer)\r\n", "numTestCases = int(input())\r\nfor i in range(numTestCases):\r\n i = int(input())\r\n n = -(360/(i - 180))\r\n if n.is_integer():\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "[print(\"NO\" if 360 % (180 - int(input())) else \"YES\") for _ in range(int(input()))]\r\n\r\n#########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n#########################################", "t = int(input())\r\nwhile t:\r\n t-=1\r\n a = int(input())\r\n a = 180 - a\r\n if 360 % a != 0:\r\n print(\"NO\")\r\n else:\r\n n = 360 // a\r\n if ((n - 2) * 180) // n == 180 - a and ((n - 2) * 180) % n == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "lst = []\nfor sides in range(3, 361):\n temp = ((sides - 2) * 180) / sides\n if temp == int(round(temp)):\n lst.append(int(temp))\namt = int(input())\nfor x in range(amt):\n if int(input()) in lst:\n print('YES')\n else:\n print('NO')", "for _ in range(int(input())):\r\n n = int(input())\r\n m = 360 / (180 - n)\r\n if m % 1 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\na=[]\r\nfor i in range(t):\r\n a.append(int(input()))\r\nfor i in range(t):\r\n x=360/(180-a[i])\r\n if x==int(x):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n", "t=int(input())\r\nfor _ in range(t):\r\n a=int(input())\r\n n=2/(1-a/180)\r\n if abs(n-round(n))<10*(-3):\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n if a in [60,90,108,120,135,140,144,150,156,160,162,165,168,170,171,172,174,175,176,177,178,179]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "# 180(n-2)/n = x\n# xn = 180n-360\n# x + 360 = 180n/n\n\nt = int(input())\n\nfor i in range(t):\n a = int(input())\n if (360 / (180-a)).is_integer():\n print(\"YES\")\n else:\n print(\"NO\")\n", "from sys import stdin\r\n\r\ndata = list(map(str.strip, stdin))\r\nb = int(data[0])\r\ndata = data[1:]\r\n\r\nfor i in data:\r\n a = float(i)\r\n n = 360 / (180 - a)\r\n if n 100 == int(n) * 100:\r\n print('YES')\r\n else:\r\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\n\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n\r\n############ ---- Output Functions ---- ############\r\ndef outp(num):\r\n output(str(num) + '\\n')\r\n\r\ndef outlt(lst):\r\n output(' '.join(lst) + '\\n')\r\n\r\ndef outsr(st):\r\n output(''.join(st) + '\\n')\r\n\r\n\r\n############ ---- Solution Functions ---- ############\r\ndef solution():\r\n n = inp()\r\n angles = [inp() for _ in range(n)]\r\n\r\n for angle in angles:\r\n if 360 % (180 - angle) == 0:\r\n outsr('YES')\r\n else:\r\n outsr('NO')\r\n\r\nif __name__ == \"__main__\":\r\n solution()", "# 270/A\r\nt = int(input())\r\n\r\ninput_degrees = []\r\n\r\nfor _ in range(t):\r\n input_degree = int(input())\r\n input_degrees.append(input_degree)\r\n\r\ndegree_list = []\r\n\r\nfor theta in range(60, 180):\r\n for n in range(3, 361):\r\n if (n-2)180 == n theta:\r\n degree_list.append(theta)\r\n\r\nfor element in input_degrees:\r\n if element in degree_list:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "x = '''60\n90\n108\n120\n135\n140\n144\n150\n156\n160\n162\n165\n168\n170\n171\n172\n174\n175\n176\n177\n178\n179'''\n\ny = x.split()\nn = int(input())\nfor i in range(n):\n a = str(input())\n \n if a in y:\n print('YES')\n else:\n print('NO')\n\n", "t = int(input())\r\n\r\nfor i in range(t):\r\n a = int(input())\r\n n = 360.0 / (180.0 -a)\r\n if (n == int(n)):\r\n print(\"YES\")\r\n else: print(\"NO\")", "t=int(input())\r\nfor x in range(t):\r\n y=int(input())\r\n s=360/(180-y)\r\n if s==int(s) :\r\n print('YES')\r\n else :\r\n print('NO')\r\n\r\n", "rounds=input()\r\nq=1\r\nwhile q<=int(rounds):\r\n angle=int(input())\r\n if int(360/(180-angle))==360/(180-angle):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n q=q+1", "n=int(input())\r\nfor i in range(n):\r\n q=int(input())\r\n if(360%(180-q)==0):\r\n print('YES')\r\n else:\r\n print('NO')", "need_cycle = int(input())\r\nfor i in range(need_cycle):\r\n angle = 180-int(input())\r\n if 360 % angle ==0:\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nli=[]\r\nfor i in range(t):\r\n a=int(input())\r\n n=360/(180-a)\r\n li.append(n)\r\nfor i in range(t):\r\n b=li[i]\r\n if b==int(b) and int(b)>2:\r\n print('YES')\r\n else: print('NO')", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Fri Oct 13 21:49:53 2023\r\n\r\n@author: 2300011794\r\n\"\"\"\r\nt=int(input())\r\nfor i in range(t):\r\n ang=int(input())\r\n if 360%(180-ang)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 10 17:01:27 2023\r\n\r\n@author: 赵语涵2300012254\r\n\"\"\"\r\n\r\nanswer = []\r\nfor _ in range(int(input())):\r\n a = int(input())\r\n n = round(180/(90-a/2))\r\n if (90-180/n)2 == a:\r\n answer.append('YES')\r\n else:\r\n answer.append('NO')\r\nfor i in answer:\r\n print(i)", "t = int(input())\r\nL = [int(input()) for x in range(t)]\r\nfor i in L:\r\n print('NO') if 360%(180-i) else print('YES')", "#!/usr/bin/env python3\n\nif __name__ == \"__main__\":\n for i in range(int(input())):\n a = int(input())\n n_int = 360//(180 - a)\n n_float = 360/(180 - a)\n print(\"YES\" if n_int == n_float else \"NO\")\n", "for _ in range(int(input())):\n t=int(input())\n external=180-t \n if(external<=0):\n print(\"-1\")\n else:\n if(360%external==0):\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t \t\t\t \t \t \t\t \t \t\t \t\t \t", "n = int(input())\r\nwhile(n>0):\r\n q = int(input())\r\n kraj=0\r\n for i in range(3,10000):\r\n if(q==180(i-2)/i):\r\n print(\"YES\")\r\n kraj=1\r\n break\r\n if(kraj==0):\r\n print(\"NO\")\r\n n-=1", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n x = 360/(180-n)\r\n if n==60 or n==90 or n==120 or n==108 or n==128.57 or n==135 or n==140 or n==144 or n==162 or n==180:\r\n print(\"YES\")\r\n elif x==round(x):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# -- coding: utf-8 --\r\nn=int(input())\r\nfor i in range(n):\r\n k=int(input())\r\n print(['NO','YES'][360%(180-k)==0])", "n = int(input())\r\nfor i in range(n):\r\n t = int(input())\r\n print('YES' if 360%(180-t) == 0 else 'NO')", "t = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n n = 3\r\n while True:\r\n if a < (n - 2) * 180 / n:\r\n print('NO')\r\n break\r\n if a == (n - 2) * 180 / n:\r\n print('YES')\r\n break\r\n n += 1\r\n", "n=int(input())\r\nfor i in range(n):\r\n x=int(input())\r\n a=180-x\r\n if 360//a==360/a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Fri Oct 1 11:38:18 2021\r\n\r\n@author: Nikiq\r\n\"\"\"\r\n'''\r\nt = int(input())\r\nfor i in range (t):\r\n a = int(input())\r\n if a >=60 and 360%a == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n# this is only considering polygon has all sides equal. \r\n'''\r\n\r\nt = int(input())\r\nfor i in range (t):\r\n a = int(input())\r\n outer = 180-a\r\n if a >=60 and 360%outer == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "testCases = int(input())\r\nfor i in range(testCases):\r\n angle = int(input())\r\n supplimentryAngle = 180 - angle\r\n if 360 % supplimentryAngle == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "t = int(input())\r\n\r\nans = list('NO' for i in range(t))\r\nfor i in range(t):\r\n a = int(input())\r\n if 360 % (180 - a) == 0:\r\n ans[i] = 'YES'\r\n\r\nprint(ans, sep = '\\n')", "#from collections import defaultdict\n\nimport bisect\n\ndef find_le(a, x):\n 'Find rightmost value less than or equal to x'\n i = bisect.bisect_right(a, x)\n if i:\n return i-1\n return -1\n\n\n\nn=int(input())\nfor _ in range(n):\n x=int(input())\n if(360%(180-x)==0):\n print(\"YES\")\n else:\n print(\"NO\")\n", "\r\nt=int(input())\r\nfor i in range(t):\r\n angle=int(input())\r\n if angle<60 or angle>=180:\r\n print(\"NO\")\r\n else:\r\n if 360/(180-angle)==360//(180-angle):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n t=360%(180-a)\r\n if t==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for _ in range (int(input())):\r\n a=int(input())\r\n print(\"NO\") if (360%(180-a)) else print(\"YES\")", "n=int(input())\r\nwhile n>0:\r\n a=int(input())\r\n k=360/(180-a)\r\n n-=1\r\n if int(k) == k:\r\n print('YES')\r\n else:\r\n print('NO')", "# Fancy Fence\r\nt = int(input())\r\nfor i in range(t):\r\n x = int(input())\r\n n = (1/(180-x))360\r\n if n == int(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from fractions import Fraction\r\nt = int(input())\r\nv = []\r\nfor i in range(t):\r\n a = int(input())\r\n n = Fraction(2,1 - Fraction(a,180))\r\n if int(n) == n:\r\n v.append('YES')\r\n else:\r\n v.append('NO')\r\nprint(v,sep = '\\n')", "t = int(input())\nfor _ in range(t):\n a = int(input())\n # an=180(n-2) => n(180-a)=360\n _, r = divmod(360, 180 - a)\n res = \"YES\" if r == 0 else \"NO\"\n print(res)\n", "t = int(input())\r\nresult = []\r\nfor _ in range(t):\r\n a = int(input())\r\n n = 360/(180-a)\r\n if n - int(n) == 0:\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\nfor letter in result:\r\n print(letter)", "#游敬恩 2300012555\r\nn = int(input())\r\nfor i in range(n):\r\n angle = int(input())\r\n a = 0\r\n l = 3\r\n ind = 0\r\n while a <= angle:\r\n a = (l - 2)/l * 180\r\n if a == angle:\r\n ind = 1\r\n else:\r\n pass\r\n l += 1\r\n if ind == 1:\r\n print('YES')\r\n else:\r\n print('NO')", "n = input()\r\np = []\r\nfor i in range(0,int(n)):\r\n l = input()\r\n p.append(int(l))\r\nfor i in range(0,len(p)):\r\n if 360%(180 - p[i]) == 0:\r\n print('YES')\r\n else:\r\n print('NO') ", "n = int(input())\r\nfor i in range(n):\r\n x = int(input())\r\n if (-2 * x) % (180 - x) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\r\nt=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n sides=360/(180-n)\r\n if math.ceil(sides)!=sides:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "for i in range(int(input())):\r\n du=int(input())\r\n num=360/(180-du)\r\n if num!=int(num):\r\n print('NO')\r\n else:\r\n print('YES')", "n = int(input())\r\nfor i in range(n):\r\n degree = int(input())\r\n if 360%(180-degree)==0 and degree>=60:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nwhile t>0:\r\n n = int(input())\r\n if (360//(180-n))==(360/(180-n)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n t-=1", "def main():\r\n n_tests = int(input())\r\n for _ in range(n_tests):\r\n a = int(input())\r\n if -360 % (a - 180) == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nimport sys\r\nif __name__ == \"__main__\":\r\n # orig_stdout = sys.stdout\r\n # with open('output.txt', 'w') as f:\r\n # sys.stdout = f\r\n main()\r\n # sys.stdout = orig_stdout", "n=int(input())\r\nb=[]\r\nfor x in range(0,n):\r\n a=int(input())\r\n if(360%(180-a)==0):\r\n b.append(1)\r\n else:\r\n b.append(0)\r\nfor x in range(0,n):\r\n if(b[x]==1):\r\n print('YES')\r\n else:\r\n print('NO')", "list_1=[]\r\nfor _ in range(int(input())):\r\n list_1.append(int(input()))\r\ndef polygon(x):\r\n if 360%(180-x)==0:\r\n return True\r\n else:\r\n return False\r\nfor angles in list_1:\r\n if polygon(angles):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from pickle import TRUE\r\nimport sys\r\n\r\nt = int(input())\r\na = []\r\ncheck = []\r\nfor nem in range(t):\r\n angle = int(input())\r\n check.append(angle)\r\nb = sorted(check,reverse = True)\r\nz = 0\r\ni = 1\r\nif b[0] < 60:\r\n for i in range(t):\r\n print('NO')\r\n sys.exit(0)\r\nj = 0\r\nwhile 1:\r\n if b[j] <= 180:\r\n break\r\n j += 1\r\nwhile z < b[j]:\r\n z = 180 * i / (i+2)\r\n i += 1\r\n a.append(z)\r\nfor i in range(t):\r\n if check[i] in a:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n n = int(input())\r\n k = 360/(180 - n)\r\n if k == int(k):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# 270A - Fancy Fence\r\nfor _ in range(int(input())):\r\n print(\"YES\") if (360/(180-int(input()))) % 1 == 0 else print(\"NO\")\r\n", "x=int(input())\r\narr=[]\r\nfor i in range(x):\r\n inp=int(input())\r\n arr.append(inp)\r\nfor i in arr:\r\n res=360/(180-i)\r\n if res%1==0:\r\n print('YES')\r\n else:\r\n print('NO')", "def main():\r\n n = int(input())\r\n for _ in range(n):\r\n t = int(input())\r\n if int(360 / (180 - t)) == 360 / (180 - t):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "T = int(input())\r\nfor _ in range(T):\r\n A = int(input())\r\n ##angle = 180(n-2)/n\r\n angulo = A-1\r\n n = 2/((angulo+180)/180)\r\n #print((n) %10)\r\n if(((n) %10).is_integer()):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nangles = []\r\nwhile len(angles) != t:\r\n angles.append(int(input()))\r\n\r\nfor a in angles:\r\n n = 360/(180-a)\r\n if n-int(n) == 0.0:\r\n print('YES')\r\n else:\r\n print('NO')", "x=int(input())\r\nfor _ in range(x):\r\n y=int(input())\r\n if 360%(180-y)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from math import floor \r\nl=[]\r\n\r\nfor i in range(3,500):\r\n\tang=180(i-2)/i\r\n\tif(ang==floor(ang)):\r\n\t\tl.append(int(ang))\r\n\r\ns=set(l)\r\n\r\nn=int(input())\r\n\r\nfor _ in range(n):\r\n\ta=int(input())\r\n\tif(a in l):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\n", "t = int(input())\r\nfor _ in range(t):\r\n a_c = 180 - int(input())\r\n print('NO' if 360 % a_c else 'YES')\r\n", "n = int(input())\r\nfor i in range(n):\r\n digit = int(input())\r\n x = -360 / (digit - 180)\r\n if x == int(x):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "if __name__ == \"__main__\":\n for _ in range(int(input())):\n a = int(input())\n if 360%(180-a) == 0: print(\"YES\")\n else: print(\"NO\")", "n = int(input())\r\nm = []\r\nfor j in range(3,10000):\r\n b = 180(j-2)/j\r\n m.append(b)\r\nfor i in range(n):\r\n a = int(input())\r\n if a in m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "# import round\r\n\r\nfor _ in range(int(input())):\r\n i = int(input())\r\n val = round(2/(1-(i/180)), 8)\r\n # print(val)\r\n if val.is_integer():\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\nfor i in range(n):\r\n num = int(input())\r\n if int(360 / (180 - num)) == (360 / (180 - num)):\r\n print('YES')\r\n else:\r\n print('NO')", "def main():\n n = int(input())\n t = []\n for _ in range(n):\n t.append(int(input()))\n for a in t:\n if 360 % (180 - a) == 0: print(\"YES\")\n else: print(\"NO\")\n\nmain()\n\t \t \t \t \t\t \t \t\t\t \t \t \t \t", "n=int(input())\r\na=[180-360/x for x in range(3,361)]\r\nfor i in range(n):\r\n if float(input()) in a:\r\n print('YES')\r\n else:\r\n print('NO')", "n=int(input())\r\ns=[]\r\na=[]\r\nfor i in range(360):\r\n x=180-360/(i+1)\r\n if x==int(x):\r\n a.append(x) \r\nfor i in range(n):\r\n s.append(int(input()))\r\nfor i in range(n):\r\n if s[i] in a:\r\n print('YES')\r\n else:\r\n print('NO')", "angles = set()\r\nfor i in range(3,1000):\r\n q,r = divmod((i-2)180, i) \r\n if r == 0:\r\n angles.add(q)\r\n\r\nn = int(input())\r\nout = []\r\nfor _ in range(n):\r\n ang = int(input())\r\n if ang in angles:\r\n out.append(\"YES\")\r\n else:\r\n out.append(\"NO\")\r\nprint(\"\\n\".join(out))", "t = int(input())\r\nfor i in range(t):\r\n angle = int(input())\r\n print(\"YES\" if 360 % (180 - angle) == 0 else \"NO\")", "t = int(input())\n\nfor i in range(t):\n\ta = int(input())\n\ta = 180 - a\n\tif 360 % a == 0:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\t \t\t \t \t\t\t \t \t \t\t \t\t \t", "t = int(input())\na = []\nfor i in range(t):\n a1 = int(input())\n a.append(a1)\n \n\n\n\nfor i in range(t):\n x = a[i-1]\n n = 360/(180-x)\n a[i-1] = n \n\n\nfor i in range(t):\n if a[i-1].is_integer():\n a[i-1] = (\"YES\")\n else:\n a[i-1] = (\"NO\")\n\n\n\nfor i in range(len(a)):\n print(a[i])\n", "from sys import stdin, stdout\n\nINF = float('inf')\n\ndef input():\n return stdin.readline().strip()\n\ndef print(args, sep=' ', end='\\n'):\n stdout.write(sep.join([f\"{arg}\" for arg in args]) + end)\n\ndef lints():\n return list(map(int, input().split()))\n\ndef solve():\n a = int(input())\n if 360 % (180 - a) == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n return\n\nif __name__ == \"__main__\":\n # Use test cases\n tc = 1\n tc = int(input())\n\n for _ in range(tc):\n solve()", "# warm heart, wagging tail, and a smile just for you!\r\n# ███████████\r\n# ███╬╬╬╬╬╬╬╬╬╬███\r\n# ███╬╬╬╬╬████╬╬╬╬╬╬███\r\n# ███████████ ██╬╬╬╬╬████╬╬████╬╬╬╬╬██\r\n# █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██\r\n# ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██\r\n# ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██\r\n# ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██\r\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 _ in range(int(input())):\r\n ang = int(input())\r\n if 360/(180-ang) == 360//(180-ang) > 0: print(\"YES\")\r\n else: print(\"NO\")", "t = int(input())\r\nquery=[0 for i in range(180)]\r\nfor i in range(3,1000):\r\n if (i-2)180 % i == 0:\r\n query[int((i-2)180/i)]=1\r\nfor i in range(t):\r\n n = int(input())\r\n if query[n]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "angle = set()\r\nans = []\r\nfor i in range(3,361):\r\n if 360%i==0:\r\n angle.add(180-int(360/i))\r\nn = int(input())\r\nfor i in range(0,n):\r\n a = int(input())\r\n if a in angle:\r\n ans.append(\"YES\")\r\n else:\r\n ans.append(\"NO\")\r\nfor i in range(0,n):\r\n print(ans[i])", "T = int(input())\r\nfor _ in range(T):\r\n x = 180 - int(input())\r\n if x <= 0 or 360 % x != 0:\r\n print('NO')\r\n else:\r\n print('YES')\r\n ", "t = int(input())\nfor _ in range(t):\n n = int(input())\n z = 360/( 180 - n )\n z1 = int(z)\n if z1 == z:\n print(\"YES\")\n else:\n print(\"NO\")", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Tue Oct 10 19:39:03 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\nlist=[60,90,108,120,135,140,144,150,156,160,162,165,168,170,171,172,174,175,176,177,178,179]\nn=int(input())\nfor i in range(n):\n s=int(input())\n if s in list:\n print('YES')\n else:\n print('NO')", "d = []\r\nfor n in range(3, 1001):\r\n a = (180 (n - 2)) / n\r\n if not a%1:\r\n d.append(int(a))\r\nfor _ in range(int(input())):\r\n if int(input()) in d:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "from math import \r\nfrom string import \r\n\r\nt=int(input())\r\nwhile t>0:\r\n x=int(input())\r\n if 360%(x-180)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n t-=1", "t=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n ang=180-n\r\n if 360%ang==0 and 360/ang>2:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\n\r\nfor _ in range(t):\r\n g = int(input())\r\n if(360%(180-g)==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n# 180 - 360 - 540 - 720 \r\n# 60 - 90 - ", "t=int(input())\r\nlist=[]\r\n\r\nfor i in range(t):\r\n a=int(input())\r\n if 360%(180-a)==0:\r\n list.append('YES')\r\n else:\r\n list.append('NO')\r\n \r\nfor i in range(len(list)):\r\n print(list[i])\r\n ", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n if (360%(180-n)) != 0:\r\n print('NO')\r\n else:\r\n print('YES')", "xunhuan=input()\r\nans=[]\r\nfor i in range(int(xunhuan)):\r\n a=input()\r\n b=180-int(a)\r\n if 360%b==0:\r\n ans.append('YES')\r\n else:\r\n ans.append('NO')\r\nfor i in range(len(ans)):\r\n print(ans[i])\r\n ", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n if 360%(180-a)==0 and 360/(180-a)>=3:print('YES')\r\n else:print('NO')", "for _ in range(int(input())):\r\n angle = int(input())\r\n y = 180-angle\r\n if 360%y==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for i in range(int(input())):\n n = (360 / (180 - float(input())))\n if n - int(n) == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n", "num = int(input(\"\"))\narr = []\nfor i in range(num):\n a = int(input(\"\"))\n arr.append(a)\nfor angle in arr:\n if angle<60:\n print(\"NO\")\n else:\n n = 360/(180-angle)\n if n%(int(n)) == 0:\n print(\"YES\")\n else:\n print(\"NO\") \n\n", "out = []\r\nt = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n if 360%(180-a) == 0:\r\n out.append(\"YES\")\r\n else:\r\n out.append(\"NO\")\r\nfor i in out:\r\n print(i)", "t = int(input())\r\ni = 1\r\nwhile True:\r\n if i>t:\r\n break\r\n a = int(input())\r\n n = 360/(180-a)\r\n if n%1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n i = i+1", "# -- coding=utf-8 --\r\nimport math\r\n\r\ndef is_regular_n_square_arc(arc):\r\n \"\"\"角度arcが正N角形の角度をなすか否か\r\n\r\n \"\"\"\r\n if 360 % (180 - arc) == 0:\r\n return True\r\n else:\r\n return False\r\n\r\nif __name__ == \"__main__\":\r\n t = int(input())\r\n for _ in range(t):\r\n n = int(input())\r\n if is_regular_n_square_arc(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\n\r\nwhile t!=0 :\r\n t-=1\r\n a=int(input())\r\n a=180-a\r\n if int(360/a)==360/a :\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")", "n = int(input())\r\npossible = set([180 * (n-2) // n for n in range(3, 361) if 180 * (n-2) % n == 0])\r\n\r\nfor _ in range(n):\r\n d = int(input())\r\n if d in possible:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Sun Oct 16 10:43:51 2022\n\n@author: calvinzhu\n\"\"\"\n\nn = int(input())\nfor i in range(n):\n angle = int(input())\n if 360%(180-angle) == 0:\n print(\"YES\")\n else:\n print(\"NO\")", "a=[]\r\nfor i in range(1, 720):\r\n if ((i-2)180)%i==0:\r\n a.append((i-2)180//i)\r\nt=int(input())\r\nfor i in range(t):\r\n if int(input()) in a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\ni=0\r\nwhile i<n:\r\n a=int(input())\r\n if int(360/(180-a))-360/(180-a)==0 and a>0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n i=i+1", "n = int(input())\r\nm = []\r\npp = []\r\nfor i in range(n):\r\n a = int(input())\r\n m.append(a)\r\nfor i in range(3,361):\r\n if 360 % i == 0:\r\n p = 180 - int(360 / i)\r\n pp.append(p)\r\nfor i in m :\r\n if i in pp:\r\n print('YES')\r\n else:\r\n print('NO')", "# 李城岳生命科学学院 2300012106\r\nli = []\r\nfor i in range(3, 400):\r\n angle = (i-2)180/i\r\n if angle - (angle//1) == 0.0:\r\n li.append(angle)\r\nfor i in range(int(input())):\r\n if int(input()) in li:\r\n print('YES')\r\n else:\r\n print('NO')", "s=int(input())\r\nboard1=[]\r\nfor i in range(3,1000):\r\n k=180(i-2)/i\r\n board1.append(k)\r\nfor i in range(s):\r\n t=int(input())\r\n if t in board1:\r\n print('YES')\r\n else:\r\n print('NO')", "times = int(input())\r\n\r\nwhile times > 0:\r\n \r\n n = int(input()) \r\n ang = 360 % (180 - n)\r\n if ang == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n times -= 1\r\n \r\n \r\n \r\n ", "'''Ye G-305 walo ne bola tha long back ki do try\r\n\r\nsorry but maine iske liye formula dekha \r\nyaha se \r\nhttps://www.math-only-math.com/sum-of-the-interior-angles-of-an-n-sided-polygon.html#:~:text=In%20a%20regular%20polygon%20of,4)%C3%9790%C2%B0n.\r\n\r\n'''\r\nfor _ in range(int(input())):\r\n a=int(input())\r\n dekhoside=360/(180-a)\r\n if dekhoside==int(dekhoside):print('YES')\r\n else:print('NO')", "for t in range(int(input())):\r\n n =int(input())\r\n if (360%(180-n)==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nfor i in range(n):\r\n angle=int(input())\r\n if angle<60:\r\n print(\"NO\")\r\n elif 360%(180-angle)==0:\r\n print(\"YES\")\r\n else:print(\"NO\")", "#利用多边形外角和=360度\r\nt=int(input())\r\nwhile t:\r\n t=t-1\r\n a=int(input())\r\n outa=180-a\r\n if 360%outa==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n = int(input())\r\nt = n\r\n\r\nwhile t > 0:\r\n t -= 1\r\n v = int(input())\r\n look = False\r\n check_1 = abs(360 / (v - 180))\r\n check_2 = abs(360 // (v - 180))\r\n if check_1 == check_2:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\nfor i in range(t):\r\n ang = float(input())\r\n n = (360) / (180 - ang)\r\n if n - int(n) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "#-- coding: utf-8 -\n#-- coding: utf-8 -\n'''\nCreated on Tue Oct 10\nauthor 钱瑞 2300011480\n'''\nn=int(input())\nl=[]\nfor i in range(n):\n a=int(input())\n if 360%(180-a)==0:\n l.append('YES')\n else:\n l.append('NO')\nfor i in l :\n print(i)", "a=int(input())\r\nfor i in range(a):\r\n b=int(input())\r\n c=360/(180-b)\r\n if int(c)==c:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "import sys\n#n = int(sys.stdin.readline())\n#m, n = map(int, sys.stdin.readline().split())\n#a = [x for x in sys.stdin.readline().split()]\nf = [180 * (n - 2) / n for n in range(3, 500)]\na = []\nfor e in f:\n if e - int(e) == 0:\n a.append(e)\n\nt = int(sys.stdin.readline())\nfor i in range(t):\n alpha = int(sys.stdin.readline())\n if alpha in a:\n print(\"YES\")\n else:\n print(\"NO\")", "test = int(input())\nfor _ in range(test):\n ex_angle = 180 -int(input())\n if 360 % ex_angle:\n print(\"NO\")\n else:\n print(\"YES\")", "a=int(input())\r\nfor i in range(a):\r\n x=int(input())\r\n n=round(2/(1-x/180))\r\n if x==180(n-2)/n:\r\n print('YES')\r\n else:\r\n print('NO')", "#2300015804\r\nn=int(input())\r\nang=[]\r\nfor _ in range(n):\r\n ang.append(int(input()))\r\nfor j in range(n):\r\n if 360%(180-ang[j])==0: print(\"YES\")\r\n else: print(\"NO\")", "t = int(input())\r\nangles = []\r\nn = 3\r\nwhile True:\r\n angle_sum = 180 (n - 2)\r\n angle = angle_sum / n\r\n if angle > 179:\r\n break\r\n if angle_sum % n == 0:\r\n angle = angle_sum // n\r\n angles.append(angle)\r\n n += 1\r\nfor i in range(t):\r\n a = int(input())\r\n print(\"YES\" if a in angles else \"NO\")\r\n", "t = int(input())\r\nstack =[60,90,108,120,135,140,144,150,156,160,162,165,168,170,171,172]\r\nwhile t > 0:\r\n t -= 1\r\n a = int(input())\r\n sobichia = 2a\r\n sochia = 180 - a\r\n if sobichia % sochia == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "a = int(input())\nfor i in range(0, a):\n ang = int(input())\n if (360/(180-ang) == 360//(180-ang)):\n print(\"YES\")\n else:\n print(\"NO\")", "# https://codeforces.com/problemset/problem/270/A\n\nfor _ in range(int(input())):\n a = int(input())\n # interior angle = 180 (n - 2) / n\n # n = 360 / (180 - a) should be an integer\n # where, a = interior angel, n = number of sides\n n = 360 / (180 - a)\n if n.is_integer():\n print(\"YES\")\n else:\n print(\"NO\")\n", "a=int(input())\r\nlist1=[60,90,108,120,135,140,144,150,156,160,162,165,168,170,171,172,174,175,176,177,178,179]\r\nfor i in range(a):\r\n b=int(input())\r\n if b in list1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n\r\n\r\n", "a = [60, 90, 108, 120, 135, 140, 144, 150, 156, 160, 162, 165, 168, 170, 171, 172, 174, 175, 176, 177, 178, 179]\r\nt = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n if n in a:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\n\tang = int(input())\n\tx = 360 / (180-ang)\n\tans = x == int(x)\n\tprint(\"YES\" if ans else \"NO\")\n", "t = int(input())\r\na = []\r\nfor i in range(t):\r\n a.append(int(input()))\r\nfor i in a:\r\n if 360//(180-i) == 360/(180-i):\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nfor i in range(n):\r\n angle = int(input())\r\n a = 360/(180-angle)\r\n b = int(a)\r\n if a == b:\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n if a<60:\r\n print(\"NO\")\r\n continue\r\n n=(360)/(180-a)\r\n if int(n)==n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = input ()\r\nx = int(t)\r\nfor i in range(x):\r\n a = int(input())\r\n n = 360 % (180-a)\r\n if n == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nd = [0]1000\r\nfor i in range(3, 1000):\r\n a = 180(i-2)/i\r\n if a.is_integer():\r\n d[i] = int(a)\r\nfor i in range(int(input())):\r\n if int(input()) not in d:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Oct 12 21:26:18 2022\r\n\r\n@author: SaltLyy\r\n\"\"\"\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n if 360/(180-a)>=3 and 360/(180-a) %1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\nfor i in range(n):\n angle = int(input())\n hy = False\n n_sides = 3\n y = 0\n while (not hy or angle > y) and n_sides < 10000:\n y = ((n_sides - 2) * 180) / n_sides\n if angle == y:\n hy = True\n n_sides += 1\n if hy:\n print(\"YES\")\n else:\n print(\"NO\")\n\n", "\r\nans=[]\r\nfor i in range(int(input())):\r\n a=int(input())\r\n if a>=60 and 360%(180-a)==0:\r\n ans.append('YES')\r\n else:\r\n ans.append('NO')\r\nprint('\\n'.join(map(str,ans)))", "#2300012142 林烨\r\nn = int(input())\r\nfor _ in range(n):\r\n print(['NO','YES'][360%(180 - int(input())) == 0])", "n = int(input())\r\n\r\nfor i in range(n):\r\n b = int(input())\r\n a = 360 / (180 - b)\r\n if a - int(a) == 0 and a >= 3:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in[open(0)][1:]:print('YNEOS'[360%(180-int(i))>0::2])", "\r\n\r\nfor i in range(int(input())):\r\n n = int(input())\r\n print('NO' if 360%(180-n)!=0 else 'YES' )\r\n\r\n\r\n\r\n", "n = int(input())\r\nfor i in range(n):\r\n ang = int(input())\r\n subang = 180-ang\r\n if 360%(subang) == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nfor i in range(t):\r\n a=int(input());b=int(180-a)\r\n print('NO' if 360%b else 'YES')\r\n\r\n \r\n", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n t = int(input())\n angles = [60, 90, 108, 120, 135, 140, 144, 150, 156, 160, 162,\n 165, 168, 170, 171, 172, 174, 175, 176, 177, 178, 179]\n for _ in range(t):\n a = int(input())\n if a < 60:\n print(\"NO\")\n else:\n if a in angles:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n main()\n", "t = input()\nt = int(t)\nlist=[]\n\nfor i in range(t):\n val = input()\n val = int(val)\n list.append(val)\n\nfor val in list:\n if 360%(180-val) == 0:\n print(\"YES\")\n else :\n print(\"NO\")\n\n", "def check_fence():\r\n t = int(input())\r\n\r\n for _ in range(t):\r\n a = int(input())\r\n\r\n # Check if the angle can form a regular polygon\r\n if 360 % (180 - a) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\ncheck_fence()", "n = int(input()) \r\nfor _ in range(n) : \r\n angle = int(input()) \r\n n = 3\r\n res = None\r\n while True : \r\n inta = (180 (n-2)) / n\r\n if inta == angle : \r\n res = \"YES\"\r\n break\r\n elif inta > angle : \r\n res = \"NO\"\r\n break\r\n n+=1\r\n print(res)", "t = int(input())\r\nwhile t > 0:\r\n angle = int(input())\r\n if(360%(180-angle) == 0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n t-=1", "import math\r\n\r\n\r\ndef main():\r\n lis_angle = []\r\n for i in range (3,1000):\r\n y = (i-2)180\r\n y = y/i\r\n lis_angle.append(y)\r\n\r\n n = int(input())\r\n for i in range(0,n):\r\n y = int(input())\r\n if y in lis_angle:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# https://codeforces.com/problemset/problem/270/A\n\nn = int(input())\nfor i in range(n):\n a = int(input())\n k = 360 % (180 - a)\n if k == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n", "t=int(input())\r\nn=int(0)\r\na=[0]t\r\nfor i in range(t):\r\n a[i]=int(input())\r\nfor i in range(t) :\r\n if a[i] <180 :\r\n n=360/(180-a[i])\r\n if n % 1==0:\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\n\r\n n=0", "for Ram in range(int(input())):\r\n n=int(input())\r\n y=360/(180-n)\r\n if y==int(y):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for i in range(int(input())):\r\n a = float(input())\r\n n = 3\r\n while True:\r\n # python的计算方式会有bug\r\n test = 180 - 360 / n\r\n if a == test:\r\n print(\"YES\")\r\n break\r\n elif a < test:\r\n print(\"NO\")\r\n break\r\n n += 1\r\n", "\"\"\"\r\nEmuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.\r\n\r\nHe wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence corners at a single angle a.\r\n\r\nWill the robot be able to build the fence Emuskald wants? In other words, is there a regular polygon which angles are equal to a?\r\n\r\nInput\r\nThe first line of input contains an integer t (0 < t < 180) — the number of tests. Each of the following t lines contains a single integer a (0 < a < 180) — the angle the robot can make corners at measured in degrees.\r\n\r\nOutput\r\nFor each test, output on a single line \"YES\" (without quotes), if the robot can build a fence Emuskald wants, and \"NO\" (without quotes), if it is impossible.\r\n\"\"\"\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n a = int(input())\r\n if 360 % (180 - a) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n = int(input())\r\nresult = []\r\nfor i in range(n):\r\n d = int(input())\r\n if 360%(180-d) == 0:\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\n\r\nfor j in result:\r\n print(j)", "n = int(input())\r\nx = 0\r\ny = 0\r\nz = []\r\n\r\nfor i in range(0, n):\r\n\r\n r = float(input())\r\n x = 360.00 / (180.00 - r)\r\n y = int(360 / (180 - r))\r\n\r\n if x == y:\r\n z.append(\"YES\")\r\n\r\n else:\r\n z.append(\"NO\")\r\n\r\nfor i in range(0, n):\r\n print(z[i])\r\n", "a=int(input())\r\n \r\n \r\nfor i in range(a):\r\n k =int(input())\r\n k1=180-k\r\n if (360/k1-int(360/k1))==0.0:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\n\r\nresult = []\r\n\r\nfor i in range(t):\r\n if -(360%(int(input())-180)) == 0:\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\n\r\nprint(result, sep=\"\\n\")", "n=int(input())\r\nfor a in range(n):\r\n m=int(input())\r\n if (360/(180-m))%1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "x = (int(input()))\r\n\r\nfor i in range(x):\r\n\r\n a = (int(input()))\r\n\r\n if (360/(180-a)) == int((360/(180-a))):\r\n\r\n print('YES')\r\n \r\n else:\r\n print('NO')\r\n", "TEST_CASES = int(input())\n\nfor i in range(TEST_CASES):\n\tANGLE = int(input())\n\tif 360 % (180 - ANGLE) == 0:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n \t\t \t \t\t\t\t\t\t \t\t \t", "for i in range(int(input())):print(\"YES\" if (360 % (180 - int(input())) == 0) else \"NO\")", "def main():\r\n test = int(input()) # количество тестов\r\n for i in range(test):\r\n cur_degree = int(input())\r\n n = 360 / (cur_degree - 180)\r\n if int(n) == n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n return None\r\n\r\nmain()", "t = int(input())\r\n\r\nfor _ in range(t):\r\n angle = int(input())\r\n \r\n if 360 / (180 - angle) == int(360 / (180 - angle)):\r\n print('YES')\r\n else:\r\n print('NO')", "import sys\r\nfrom os import path\r\nif (path.exists('input.txt')):\r\n\tsys.stdin = open('input.txt', 'r')\r\n\tsys.stdout = open('output.txt','w')\r\n\r\nt = int(input())\r\nfor _ in range (t):\r\n\tth = int(input())\r\n\tn = 360/(180-th)\r\n\tprint('YES' if n==int(n) else 'NO')", "n=int(input())\r\nfor _ in range(n):\r\n a=int(input())\r\n ext=180-a\r\n if (360%ext==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "#https://codeforces.com/problemset/problem/270/A\r\n\r\n\r\ntest_cases = int(input())\r\nwhile test_cases > 0:\r\n angle = int(input())\r\n if(360%(180-angle) == 0):\r\n answer = \"YES\"\r\n else:\r\n answer = \"NO\"\r\n print(answer)\r\n test_cases -= 1", "for i in range(int(input())):\r\n m = int(input())\r\n if 360%(180-m) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\nfor _ in range(t):\r\n a=int(input())\r\n tbd=180-a\r\n if (360/tbd)==int(360/tbd):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\nans=[]\r\nfor i in range(t):\r\n a=int(input())\r\n x=360/(180-a)\r\n ans.append('NO'if(x-int(x)!=0)else'YES')\r\nfor i in ans:\r\n print(i)", "n = int(input())\r\nans = []\r\nfor i in range(n):\r\n t = int(input())\r\n if (2t) % (180-t) == 0:\r\n ans.append('YES')\r\n else:\r\n ans.append('NO')\r\nfor i in ans:\r\n print(i)", "t=int(input())\nfor i in range(t):\n angle=int(input()) \n print(\"YES\")if 360%(180-angle)==0 else print(\"NO\")", "for _ in range(int(input())):\r\n n=int(input())\r\n val= 360 / (n-180)\r\n if(val == int(val)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\ns=[]\r\nal=[]\r\nfor i in range(t):\r\n a=int(input())\r\n s.append(a)\r\nfor i in range(3,361):\r\n angle=(i-2)/i180\r\n if angle%1==0:\r\n al.append(angle)\r\n\r\nfor i in range(t):\r\n a=s[i]\r\n if a in al:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "for x in range(int(input())):\r\n a=int(input())\r\n if a>59 and 360%(180-a)==0:\r\n print('YES')\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nans = []\r\nfor i in range(t):\r\n\tangle = int(input())\r\n\tif angle < 60:\r\n\t\tans.append(\"NO\")\r\n\telse:\r\n\t\tn = 360 / (180 - angle)\r\n\t\tif int(n) == n:\r\n\t\t\tans.append(\"YES\")\r\n\t\telse:\r\n\t\t\tans.append(\"NO\")\r\nfor i in range(t):\r\n\tprint(ans[i])\r\n", "n = int(input())\r\nfor i in range(n):\r\n an = int(input())\r\n j=3\r\n nan=0\r\n yes=0\r\n while nan<an:\r\n nan=180-360/j\r\n if nan==an:\r\n yes+=1\r\n break\r\n j+=1\r\n print(\"YES\" if yes==1 else \"NO\")", "t = int(input())\n\nfor _ in range(t):\n a = int(input())\n\n i = 3\n ang = 180 - 360/3\n exists = False\n if ang == a:\n print(\"YES\")\n continue\n while ang < a:\n i += 1\n ang = 180 - 360/i\n if ang == a:\n exists = True\n break\n if exists:\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t \t \t \t\t\t\t\t \t\t \t \t", "t = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n n=-(360/(a-180))\r\n if int(n)/float(n)==1.0 and a!=180 and a!=0 and n!=2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "from sys import stdin\r\n\r\n# https://codeforces.com/problemset/problem/270/A\r\n\r\ndef inp():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef iinp():\r\n\treturn int(inp())\r\n\r\ndef mp():\r\n\treturn map(int, inp().split())\r\n\r\ndef liinp():\r\n\treturn list(mp())\r\n\r\ndef solve(deg):\r\n if 360 % (180-deg) == 0:\r\n return 'YES'\r\n \r\n return 'NO'\r\n\r\nif __name__==\"__main__\":\r\n for _ in range(iinp()):\r\n deg = iinp()\r\n print(solve(deg))", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[60]:\n\n\nt=int(input())\nfor i in range(t):\n a=int(input())\n if 360%(180-a)==0:\n print('YES')\n else:\n print('NO')\n\n\n# In[ ]:\n\n\n\n\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 11 15:21:27 2022\r\n\r\n@author: lpf\r\n\"\"\"\r\nt=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n print('YES'if 360%(180-a)==0 else 'NO')", "for i in range(int(input())):\r\n n=int(input())\r\n out=180-n\r\n if out<=120 and 360%out==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\narr = []\r\n\r\nfor i in range(n):\r\n arr.append(int(input()))\r\n\r\nfor i in arr:\r\n if 360 % (180 - i) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\na=[]\r\nfor i in range(t):\r\n a.append(int(input()))\r\nfor i in range(t):\r\n if a[i]>=60 and 360%(180-a[i])==0:\r\n print('YES')\r\n else:print('NO')", "n = int(input())\r\nfor i in range(n):\r\n a = int(input())\r\n if (360/(180-a)).is_integer():\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\n\r\nwhile t:\r\n n = 1\r\n t -= 1\r\n a = int(input())\r\n \r\n while (n180 / (n+2)) < 180:\r\n if n180 / (n+2) == a:\r\n print(\"YES\")\r\n break\r\n elif n180 / (n+2) > a:\r\n print(\"NO\")\r\n break\r\n n += 1", "standard = []\r\nfor i in range(3, 361):\r\n b = 180 - 360 / i\r\n if b % 1 == 0:\r\n standard.append(int(b))\r\na = int(input())\r\nwhile a > 0:\r\n s = int(input())\r\n if s in standard:\r\n print('YES')\r\n else:\r\n print('NO')\r\n a -= 1\r\n", "angle = set()\r\nfor i in range(3, 361):\r\n t = (i-2)180/i\r\n angle.add(t)\r\nn = int(input())\r\nfor j in range(n):\r\n a = int(input())\r\n if a in angle:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\nfor _ in range(t):\r\n x = int(input())\r\n n = 360/(180-x)\r\n print(['NO','YES'][n.is_integer()])", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n if a<60:\r\n print(\"NO\")\r\n else :\r\n z=3\r\n ang=60\r\n while ang<a:\r\n z+=1\r\n ang=(z-2)180/z\r\n if ang==a:\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")", "num=int(input())\r\nans=''\r\nfor x in range(num):\r\n a=int(input())\r\n b=2a/(180-a)\r\n c=b-b//1\r\n if c==0:\r\n ans=ans+'YES'+'\\n'\r\n else:\r\n ans=ans+'NO'+'\\n'\r\nans=ans.rstrip('\\n')\r\nprint(ans)\r\n", "\r\n\"\"\"\r\n ..::kh_elhanan::..\r\n ..::i::i:......::khaled_elhanan:\r\n iv7i::.. .......:.:.::71gBBb:\r\n .sbP7. .::..::::::...:rKMRRU:.\r\n .vIs7. . ..:...::i::::.:.:iUPKSIsLi.\r\n .25r . . .:...::i:i::::::::rvUbYvISu7.\r\n .2qr. . . . . .:....:i:i:::::::::.:P1::rsKS2i\r\n 1qr . ... .::i:::::::ii. id7.::i7uU2r\r\n :YL: . . . . . . ... .:::ii:i:i:ir: .gK:::::::L21i\r\n .rv:. . . . . .. .:. :..:r:::::i. ZBv.::ii..:JE2.\r\n .77. .. . . . . .. :i . .r:i::i: uBq:.iii::..rI2r\r\n isr . . . . . . . r: . . .ri::iii. .iBgi.:ii.:::.:r7ri\r\n iui . . . . . . . . . .v. ... .ri::iir:..::QPv::ii::::::. .v7.\r\n iUi . . . . . .. ... i7. ... ir:::i:iiii:rQS1i:ii.::::i. .7L.\r\n :Si . . .. .: . .. . . . ..... :7i ......:iLi::::::i:.JguI7::i.::::ii: rr\r\n :u7 . . . .: . .i . .. . . . ... ... ... 27. ... .:r2.::::::i::KEJSL:::.::::::i:. :u:\r\n 2u ... . . .:. . :: . . :. . . ..... ....... 7U:. .... .iPi.::::::i:iZKs5ui::.::::::::irIP:\r\n 7K. ... . . .::: . ri . .. . . .:: . ... ... ..... . :Ei: . . :I7.::::::ii.vDUs5Ui::..:::r777vr7i\r\n .5r ..... . ..::: . . Y: . . :. . .i: ... :. . ... ..: gvi. .. . .Lv.:::::::i::Xdj1PZJ7r7YL7i:.\r\n JI. ....... . .::.:. . . v: .:r . :ri .... i . ... . .i. Xq:r :: 7P..::::::i::rbKUULrLL.\r\n .qr ....... . .i::.:7. . . 1.. .. .rr . .Jr ... .r. ..... . ii YE7::.U. :P:.:i:::::i:iXb:\r\n 75. ....... .:i::::i7 . . . 1:. .. .77 ..:Sr :. .7. ....... i7 rRu:i.1r :X7 :::::::ii.XP5 .:\r\n Uv ....... .:ii::::.L. ... . 2:. . ..Is .::M: i .r. ..... 7L: :Eqr:.7u: .I1 .::::::ir:rdd. :Ss. ..\r\n .S: ... ... .:rii::::::Y . . . . .2:. .. .iKu ::r5. .r..:iY. ...... .rIi .JP1:iiPr. .7b .:::::::rr:PqI .i.vi\r\n iu. ... . . . .:r:i:iiiirrv ... . . .S:. .: .vLr :i2Uv.iIiiirs. : ... :i57 riKd7i7gS: i1Q. .::::::i1.q5Zr:. .Yi\r\n ir . . .irrr7v7rr:7Y17 . ... . .Xi. i. .2.7.:iL7P.s U: :r: :. .. r:XY.i.:gr..Pu: rQZqi..:::::2:vgUd. .. :r\r\n.7E7...:::::.v11jsv7:. ir: .. . . Zr. i. :Kis: .:r7 7. 25 rrr r. .. .iiSU.7. PS:.XRr iEr.JYr.::::j7iBsZ. .. i:\r\n..s7i::... .sv: 7v . .U: ....... b1. 7:7.: r. .is: i: YB. iiS.r. . .iiZ2:L. iQi.7qK :du .r:::.:rIiBubi .i.ri.\r\n .: .. D. ::...qr . ...... Pq. is.7. .i: :r1...L JPL i:P.r. :.:755iv. MJ.viZ..iKP ...:::::i2sQPuI....\r\n .Q. . :q :r...i: si ... ... Yg: :i.P. :7 :L7 i.L277::b:i: .r.:LLSLL :M.v:ri.:5M ..::::::uJQDvQY\r\n 17 v2sM7 ... iv ... ... vQ7 ::vU ..L :1: v7I.U::Zri: 7i.:uiPI7 dr7i .i:Ug .:.i:::.vjgQ7bR\r\n .u 1PuDv .. i7 ... ... :BJ ::b:. i :X::ii.SJd r7:Pv:: i7:.rs.qZ: :jri X:jg. ::.::::.jjZQuYBv\r\n X. uIsD1 ... rB: . .. ... .QX:.vX s:ii .Zg. 5:PY::irr:.Ji Zd .. Lrr .77R. :i.::::.2SqB2LPK\r\n .B .vjsPE QBr ... .. gEr.P:.rr :77ursv: :B7 :5SI.iiir..K .Qu .i7JPUgDgPMKD. ::.::::.IqPBK75Yr\r\n id rvr2SEi: .QBI .. .. 7Br:DLi:.rjgEqBBBBQL LQ 1gS::iir 1i B .MBBBBPBBBBBBM. ::.:::::rZXBq7bid\r\n ruLiiUIu7ii.1ZBZ .. .. BuU7 i5QBBQRgBBBQ7uu: sr gD::ii:r7 r2 :MBBQBQBbYY1IBQv ::::i::::PbQZ7P:5r\r\n RP:.jKvJ:irYbQB .. .. KqUJRBQRBQBBBs . : .Qr:iiL. L SQB17r2r U2i.:::ii:::UbQELPiiQ\r\n .2d:.rEiS::urPQBi .... .. .QZBMMBBDI7sL .: JS:rS: : Bguv7u52UjjB: jrr::::ii::vLdMDvbi:u7\r\n vvv:::K:2riS.XQBv ..i ... PBQQBBqrrsJ552UBj K7s iBri:EX.i: DB Pi:::::ii:.jsXQZJPi. g\r\n I7L:::q:7uIr.KBBP :: . .. igrEBrssLIur7..B7 si .Q .KS....BK Si.:::.ii:.S22QZJb: jL ..\r\n ::::. :UL7::iS::P7::2BBQ ii . ... .S SPii:.Bq....B. X: Yg 2i:::::ii:.5Z7BqKg R ::.\r\n :::i: v71r::i5:i:irr7.QB 7: ..... ur Z ...... :U :. u 2i::::.:7i.SBiQqZB . Ys ::..\r\n .. v uii:vU:r77i v iB. 7i ..... .P .d 1. . :uj.. 5i::::::1i.UBiEdQQ. . M :..\r\n ii Ji::YUrr:. r. 7:i 7i ...... :: ..:. vY.. . .... ....:Ji::::.:5v 2B7uBDqi .. uj ::..\r\n j .I:i:2:. . vi rv:rr ... .i rr ....... .... ......... .P:::i:..PI YBuvBK2v ... R .:.\r\n .u :u::iP. .... rJ rU:ii. ... rv. rr ........... ......... :2::ii:..KD 7BPrBL25 .. rL .\r\n r: i1..iK .... :Y .X:ir: .. .77r. :7. ......... ... ... .I:iii::.bM:YBgrSYjg .. Z\r\n U Yv r5 .......I KiiJr: .. rr7Yi .v: ..... . Su::i::i.PQrqQQivjUg: . ur\r\n i7 S7 75 .......5 r1:dri. . .7:7:r::i: . :Br:iii:7 gR7KQQi7XrP7 . g\r\n U. K: 7J ...... 5 KiqX:r. . :7v7 .:i77. i: .Iv7riii:77.QRrdQD:vq.iP 5i\r\n .v :S. r1 ...... I: sL2E7:r. . :vEi. .r.. .iUj rr:i::ur.BZ7DQUivX..P .b\r\n 7. iS vr ...... vi EuqP:i7. . .q::rri: .i55v. 5ii:::P.rBg7BSjius..P g.\r\n u . sJ 7: .... :s ug227:i7. . .. ...::: :7jLr. Ki:i:vb.vPR2EL1r1r..1. r2\r\n . i: 2r . Y. ....2 QPv.u:i7: . 7v 7uU5uj::...... .::iqIYRqi M:i::KS.i.BXuY2r2...vr R\r\n:.::. u K. u. . b :Bg :2:iri P .i22uvrrYBi:ii7v2USsvi7B5rv7vL7. iQ:::7B7s BKvuusY.::i5 d:\r\n:.::. u .X 2 1. vB: r5:iri. :r :7v7i....:iivg. ... . d:. ..rsr. :E.:.ED7i .BujJ1Ir.::.K :q\r\n.... ri .U .U Ji uQ rKiirr: Kv. .. . iE. ..7sr:: Y: ... ..7 .U:.YRK. iQJJu1X..:: 5. R\r\n s. :v . U :s ru iPi:iri .i ..... .gv:::..::vb ... vLr1 r2.:MQ5 iZJjJSs..::.iJ P.\r\n 1 ii .5 J :Pi:iir.P ..... :D 7i .. .rdRKiiPr vv.PBS :P1JUSr.:::..q i2\r\n .7 v. .X I Z7:ii:X1 .... :g. .S 7ZPZ5:::i:K J:PBi rbJjuX:.:::: b E\r\n ii s :v J :YISi:::MMPS7. ... rq S rBBE7.7s.ii. quXq Iq1J2u..:::. u7 S\r\n s. X :7 7 .7 .iUur.:JiDDZMPXi rJ :. :dBBU: j::r. qM sPJu57.::::: :Qrri... u.\r\n L J rr r. J :JjrirE::rYQBBQuiri. v: XvMBBBJri. 7::i 7L7: SX1uXi.::::. M .ii:.i.\r\n s .7 ii :. 7: . .iriiK. ...sBBBBBBBgPZ5uBQX7LvJUKqSsv2S7i . K. XKJUU:.::::. qi\r\n .v r: 7. .. :r . . .i:.:v :7UuJu1vLvvvSPBPSggUuvvLsYjs7i::UE: .E S5u1J::::::. vq\r\n :i v. v. :: U ..... :iiJsr7vYJvLvLvLLXISRg7PM2I2vsLYLsLjs2Pi . :S EIJ5r:i::::. :g\r\n U. u . r .: J. ...... .idS7v1sJvvvLvv7vvs2g:.rBJLvvvYvLsqMMLui: ... 77 M1u2i:i::::.. :q7\r\n 2 u . r .: i7 ... ... ::I2DgDKS1JvJjUu1UDY::iQg22jsvuIDPL..75. ... 5. g21U:iii::::..:vK\r\n 7 ...r.: . uv .r .q ....... .J. :iJEPEXI2S5SXdQr:iiRgMqS22IQ7 .ii.s .... P gUIv::ri:::...:id\r\n .Srir.:ir: ..:Is. .5 P ........ .iI. .:.i7dDKPPEbZgBr::rMZZQDdKZBE.::. r: ... :I gI2r.:L7:::...:i17\r\n rLr: . i7uUj: 2 2: ..... . :ij .. LgDZbdbZgDRr::vBbPqZgQMPdM .U . .. ui d5Si::1r:::.. .irK\r\n 17r.. . .ri::7Dgj. 7 Ls ... ... . .Ku . rBEZZDEgZKIg7i:uM2u21SX2vYXS S: .... q 2Pu:::17:i: .r:Z\r\n U7:.. . :7ii::.UZMPi:L rR ..... . .. vR. . .Bdq55UDPJsjdviiJgU5IXLv7YYuR7 iX ..... .K ubJ.::2r:i: . i:2r\r\n Ps..: iiiii::J2ubq .d. . ... . . . .ZL QbX2uv7vY7v7q7: :gSIKsvvJLvrvP. D: . ... ri:g7:::5Y:r: .. iiu2\r\n :Z1 :r .rrii:::IjuUd v . . . ... . :S: PQIYvvYvYLJsjPY .Q5KYvvUJY77vXi L5. . ... r1Qr.::Ku:i: . :7YP\r\n vZJ :7. .rii:i:iI1JUd r: ... . ...... .rq. . :QP5IUUsJvvr7rSY: Dg51SZP2vL77: . .P: ... i:I7.i5Sii. . i7j5.\r\n Pqs iri :riii::r5JujM. 7r . . ......... .sU . .77v2UISg55L7Iji. KZXdu5::::::r. Kri ... .. .UrrX57:i . .Y117\r\n gK7 irr.:riiii:vIuJuE. 5 . ... . ... :Pi . .:::..::dr21iuv: .. :2.K .. . YK:i . .7i. rqq5J:i. ..JXvJ\r\n .g57 rir:iiiii::Y2suJKSi ... . ... . .rP .. P :5ir:.... .1 D. ... .Z:ii .irr: .bE5ir. i ISJ5\r\n 7bKi iiiiii:i:::u1uJuqB . ..... . . :j1 .. . . . . d Eri ..... u P: . . ... Uv:ii .riiir. UQv:: .r 25JK\r\n 5qSi rii:i:i:i::U1JuqP. ... . . . ... .:X. .. ..... g. Z7:...... v.5i . . ... .P.iir .riiiir iD7: :r J2Ug\r\n KIK: ii:i:iii::i5juqK ..... ... . .rrS ... ..... E. E7: ..:...r.57 . . . . . Pi:iiiiiii:r. . .Su ir rKJB.\r\n dUS: riiiiiiii:r2UqP . . . .. ... .i:vr . .. . .. E: Is:..:. ..::Yj .... . . u2.:iii:iiri . . vX:i.:XjR.\r\n gjK..ii:i:7ii::r5Xd ... . .7i . .ii:E . . . . Pr qv:.:. ..:i71 . . . ... .Q:::i:i:ir. . . ... :Ki:.buM:\r\n .ZsP: r:ii:7r:i.vKR . . . rrr. ii:Z7 . ... ... . X7 5u... ...vrb . . . ... ID.::i:ii: . ... . ivr gUM:\r\n igYEr riii:J7:::JQ. . . . iiii: :i:1M . ..... ..... 1s 1U.. ...rrZ ... . ..... .QU:::i:i. ..... . 7q:U Z1R:\r\n iZJSi.rii::vKr::gr . . . iri:ii.:i:sQ7 . ... ..... . YI rS.. ...7:Z . . . . . KgUi::i:r: . . i7.1r5 Q5R.\r\n iguI .ri:i.sIS::7 ri:iiii::j5D . . ..... vg rS. ...i:E. . . . . Bu57::::r. r: .1q ISB.\r\n .DU5 rii::J2UJ: .:::::...iii:i:::uJbP...... . ... vD iR .: r.R. ..... .::ii:5qs5v:.::i :iL. .IP .ZQ\r\n MUq .vi:i:u11uIPYi::iiririr:i:i:::jujMi:rrL7vr7L: ... . rg :Qi ...7.P. ... 2ri:.. EjsIs:.:iJXdL7vr:gZijd BE\r\n dXX Xii::J2JuSZ7PSji:...::::i::.LUsqq .q ... ig :Iq. :.i.X: ... . 5: 1IYuXKuIP11vYY7: uQi5d :Bi\r\n XPb iu:::u1jsZ7 :vXXD27::..::.rUJvR. rv . . . :Q :JvK :.r:U7 . . . :X :B5bDgdQLri:. .Q1PP UQ\r\n :Rd Ur::j2JJX. :LgQQZXvi.:JjvSg........ u: . . ... ig.r7i1b : r:Lj ... . K777sv77RPUi sI PSQ. Qi\r\n gg .K::j1jsUuLi:. .:L5ZQd5PIuEsrjvUu5UU77 . ... . :M.7: .JE. ..iv:q . ... .ii7rr:P. :vr uQj r:\r\n iBi :2:L2JjJ2KBri7vi:.iriisbQRgQE.:ii:.. . .... iZ.7i . iK ..r7.E. ... . . ...s: :KQEZEgdZZ .\r\n KM rsv2usus1d ..:.:71 ... :P . . . . . .ig.vi....iK. .iv Z: ... . . q .MSU21PQ\r\n 7 :bPJuss1D 1 vI... . .iE.L:.. ..iK: iL 27 .:rrBJ M115EM\r\n .qDuUSI2 :rs. .RrLY2JJ7r::.. .:Z.5:.. .:1..K L5 .:r712SS2v:.E ZqPqQ\r\n 7gPgqbYuSQ7::. d: ..:ir71j2u52JY7ri: .ib.S:.. . .b ibivJ1SbPqIYr:. b. ZB7.\r\n vR72QPXB. .S .:iivrr7JYYvg.S: .......::d .qLiri:.. Xi v.\r\n : idgB 7. . . . . ::E.Sv:i:::i...:b 5r . 7i\r\n :1 iq . . . . :iK qi::. ..E: vZ . . :i7\r\n I7r77::.. . :7u.P:iririvYQi:Iv iR. .:i7UKDv\r\n :7 KI:rvvv7i::....... :iLIi: I .vrYQDr7r77:I7v7i..:vE\r\n 5 u JSii:7uIPULDDg: 2 ... .. j .. K:\r\n :r J J q 2. i .... S\r\n Y i. J q . q. :. .I7\r\n iii.7 .i u L. r1.:riv7rr:.\r\n v:qdii:iii:sSJ7r:. suri:.. . Urr::::....... P: .\r\n v. .rr7v7v77ri:r7jUdqri7i..:ii::ud.:ur..:iirrr2:.rrr..\r\n .Y :ri:i:iii:i:iiL.v.......... r7 u ..... v\r\n L: ..:ii:iiiiiiirY v: ..... . rv s . 7\r\n J . ..:riii:i:ivv Y: rr s r\r\n L ......:ii:iiiv7 i7 i: s .r\r\n v . ....iii:i77 .J L: j .r\r\n J ......iv:is S v: J ii\r\n 7.: .....:JiJ. 7: v: J rr\r\n .7i. ..:.::vr .r v: L i.\r\n 1.:: .:::::.r 7 Y: U . .. s.\r\n .r :7:.:::i . diiri7rir:Pi XJirrrL2rg\r\n . .r7::.7 1 7: L 7\r\n .vr:ii v :: v L\r\n :7rv v i: s 7\r\n .sL i. :: 7 :\r\n r. r. i: : :\r\n ..............:.:.:..s: .... i7..j...... .q...:......\r\n ....:.:::.:.................. Y7ri7sUI5SB7..Buj1IJs7iR........:.:::.:......\r\n ...:.:.:.:.:..........................PY7YLsvvvSQ: :BdI211JI5Q...............:.:.:::::..\r\n .i::.................................. gBBRgDMRBBBs iBQBBBQBBBM .......................::::\r\n .:.:::::::i. : .\"\"\"\r\nfor _ in range(int(input())): print('NO' if 360%(180-int(input())) else 'YES') \r\n\r\n\r\n", "# Link: https://codeforces.com/contest/270/problem/A\n\nnumber_of_tests = int(input())\nanswers = \"\"\n\nfor _ in range(number_of_tests):\n internal_angle = int(input())\n external_angle = 180 - internal_angle\n number_of_angles = 360 / external_angle\n \n answers += \"YES-\" if number_of_angles == int(number_of_angles) else \"NO-\"\n\nfor answer in answers.split(\"-\")[:-1]:\n print(answer)", "def f(x):\r\n return (180(j-2)/j)\r\nt=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n j=3\r\n while j:\r\n if f(j)<a:\r\n j+=1\r\n elif f(j)==a:\r\n print(\"YES\");break\r\n else:print(\"NO\");break", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Oct 11 19:24:04 2023\r\n\r\n@author:2300011376\r\n\"\"\"\r\nN=int(input())\r\nwhile True:\r\n N-=1\r\n if N==-1:\r\n break\r\n a=int(input())\r\n if 360%(180-a)==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n ", "for _ in range(int(input())):\r\n a = int(input())\r\n print('YES' if (360 % (180 - a)) == 0 else 'NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nif __name__ == '__main__':\r\n n=int(input())\r\n while n:\r\n n -=1\r\n if 360%(180-int(input())):print(\"NO\")\r\n else:print(\"YES\")\r\n\r\n ", "a = int(input())\r\nd = []\r\nfor i in range(a):\r\n d.append(int(input()))\r\n\r\nfor i in d:\r\n if 360 % (180 - i) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "n = int(input())\nfor i in range(n):\n\tprint(\"YES\" if 360%(180-int(input())) == 0 else \"NO\")\n\t\t\t\t\t\t\t \t \t\t \t \t\t\t\t \t \t\t", "\r\nfor _ in range(int(input())):\r\n a= int(input())\r\n n=360%(180-a)\r\n if n==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "# import sys\r\n# sys.stdin=open('Python\\input.txt','r')\r\n# sys.stdout=open('Python\\output.txt','w')\r\n\r\nfrom math import ceil\r\nfor _ in range(int(input())):\r\n a=int(input())\r\n n=360/(180-a)\r\n print(['NO','YES'][n==ceil(n)])", "n = int(input())\r\nangles = []\r\nfor i in range(n):\r\n angles.append(int(input()))\r\nfor j in range(n):\r\n if 360 % (180 - angles[j]) == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\na_list = [int(input()) for _ in range(t)]\r\n\r\nacceptable = {int((180(n-2))/n) for n in range(3, 1000) if (180(n-2))/n % 1 == 0}\r\nfor e in a_list:\r\n if e in acceptable:\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", "for i in range(int(input())):\r\n lst=[]\r\n a=int(input())\r\n angle=0\r\n n=3\r\n while (angle<a):\r\n angle=(n-2)180/n\r\n lst.append(angle)\r\n n+=1\r\n if lst[-1]==a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n", "for a0 in range(int(input())): print(['YES','NO'][(360 % (180 - int(input()))) > 0])", "n = int(input())\r\n\r\npol = {60, 90, 108, 120, 135, 140, 144, 150, 156, 160, 162, 165, 168, 170, 171,\r\n 172, 174, 175, 176, 177, 178, 179}\r\nfor i in range(n):\r\n ang = int(input())\r\n if ang in pol:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "t = int(input())\r\nfor _ in range(t):\r\n a = int(input())\r\n n = 0\r\n while na > (n-2)180:\r\n n += 1\r\n if na == (n-2)180:\r\n print('YES')\r\n break\r\n if na < (n-2)180:\r\n print('NO')", "t = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n angle = 3\r\n while True:\r\n if a < 180(angle-2)/angle:\r\n print(\"NO\")\r\n break\r\n elif a == 180(angle-2)/angle:\r\n print(\"YES\")\r\n break\r\n else:\r\n angle += 1", "t=int(input())\r\ns=''\r\nfor i in range(t):\r\n a=int(input())\r\n side=360.0/((180-a)1.0)\r\n if(side-int(side))==0:\r\n s+='YES\\n'\r\n else:\r\n s+='NO\\n' \r\n\r\nprint(s) ", "import math\r\nt = int(input())\r\nfor _ in range(t):\r\n a = int(input())\r\n n = 2/(1-a/180)\r\n # print(n)\r\n if math.isclose(n, round(n)):\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\nfor t1 in range(t):\r\n an = int(input());a = 3\r\n while True:\r\n angle = (a-2)/a180\r\n if(angle>an):\r\n print('NO')\r\n break\r\n elif(angle==an):\r\n print('YES')\r\n break\r\n a+=1\r\n \r\n", "for _ in range(int(input())):\n\ta = int(input())\n\tif 360%(180 - a) == 0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\n", "n = int(input())\r\nlength = 0\r\nfor i in range(n):\r\n a = int(input())\r\n length = 360 / (180 - a)\r\n another_num = int(length)\r\n if length == another_num:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "t=int(input())\r\nfor _ in range(t):\r\n a=int(input())\r\n\r\n if 360 % (180-a) ==0 and a>=60:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\n\r\nfor _ in range(t):\r\n x = int(input())\r\n print(['YES','NO'][360%(180-x) != 0])", "result = []\r\ncounter = int(input())\r\nfor i in range(counter):\r\n angle = int(input())\r\n k = 360/(180-angle)\r\n if k%1 == 0 and angle != 0:\r\n result.append('YES')\r\n else:\r\n result.append('NO')\r\nfor i in result:\r\n print(i)", "for _ in range(int(input())):\r\n n=int(input())\r\n print(\"YES\" if 360%(180-n)==0 else 'NO')", "n = int(input())\r\nfor i in range(n):\r\n a = int(input())\r\n print('YES' if 360 % (180 - a) == 0 else 'NO')", "n = int(input())\r\nlis = []\r\nfor i in range(n):\r\n angle = int(input())\r\n lis.append(angle)\r\nfor i in lis:\r\n x = 360 / (180-i)\r\n if x == int(x):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for _ in range(int(input())):\r\n a=int(input())\r\n bs=360/(180-a)\r\n print(\"YES\") if bs.is_integer() else print(\"NO\")", "a = int(input())\r\nfor i in range(a):\r\n b = int(input())\r\n if 360 % (180 - b) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "for i in range(int(input())):\r\n x = int(input())\r\n x=180-x\r\n if 360 % x == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "t=int(input())\r\nfor a in range(0,t):\r\n b=int(input())\r\n if 360%(180-b)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "#2300011725\r\nn=int(input())\r\nfor i in range(n):\r\n m=int(input())\r\n if 360%(180-m)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nwhile t>0:\r\n t-=1\r\n n=int(input())\r\n if 360%(180-n)>0:\r\n print('NO')\r\n else:\r\n print('YES')", "#2300011786\r\nlst=[]\r\nfor i in range(3,1000):\r\n if (i-2)180/i==(i-2)180//i:\r\n lst.append((i-2)180//i)\r\n\r\ndef f(n):\r\n for k in range(len(lst)):\r\n if n==lst[k]:\r\n return True\r\n\r\nn=int(input())\r\nfor j in range(n):\r\n angle=int(input())\r\n if f(angle)==True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "N=int(input())\r\nlist=[]\r\noutput=[]\r\nfor i in range(N):\r\n list.append(int(input()))\r\n c=180-list[i]\r\n if 360%c==0:\r\n output.append(1)\r\n else:\r\n output.append(0)\r\nfor i in range(N):\r\n if output[i]==1:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in range(int(input())):\r\n ang = int(input())\r\n n = 360/(180-ang)\r\n if (n * 10 % 10==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for _ in range(int(input())):\r\n a = int(input())\r\n # a = 180 * (n - 2) / n\r\n if a > 179 or a < 60:\r\n print('NO')\r\n else:\r\n a = 180 - a\r\n n = int(360 / a)\r\n if n * a == 360:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in range(int(input())):\r\n n=int(input())\r\n if (360/(180-n)) == int((360/(180-n))):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n", "n = int(input())\r\nfor _ in range(n):\r\n a = int(input())\r\n x = 360 / (180 - a)\r\n if x != round(x):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n\r\n", "n=int(input())\r\ni=1\r\nwhile i<=n:\r\n angle=int(input())\r\n w=360/(180-angle)\r\n if w==int(w):\r\n print('YES')\r\n i+=1\r\n else:\r\n print('NO')\r\n i+=1", "t = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n k = 360/(180 - a)\r\n if int(k) == k:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n", "t = int(input())\nb = []\nc =[]\nfor i in range(1,t+1):\n a = int(input())\n n = 360/(180-a)\n if n%1 != 0:\n b.append('NO')\n else:\n \n b.append('YES')\n##print(b) \nb.reverse()\n##print(b)\nfor i in range(1,t+1):\n print(b.pop())\n \n \n \n\n\n \n\n", "def ispolygonfence(angle):\r\n return 'YES' if 360 % (180 - angle) == 0 else 'NO'\r\n\r\nt = int(input())\r\ninp = []\r\nfor i in range(t):\r\n inp.append(int(input()))\r\nfor j in range(t):\r\n print(ispolygonfence(inp[j]))", "m={135, 140, 144, 150, 156, 160, 162, 165, 168, 170, 171, 172, 174, 175, 176, \r\n 177, 178, 179, 60, 90, 108, 120}\r\nfor i in range(int(input())):\r\n a=int(input())\r\n print([\"NO\",\"YES\"][a in m])", "def fancy_fence():\r\n for i in range(int(input())):\r\n degree = float(input())\r\n if 360/(180-degree) % 1 != 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n\r\nfancy_fence()", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n k=360/(180-a)\r\n if k==int(k):\r\n print('YES')\r\n else :\r\n print('NO')", "import sys\nimport bisect\nimport heapq\nimport math\nfrom functools import lru_cache\nfrom collections import defaultdict,Counter\n\n\n#sys.setrecursionlimit(10*6)\ninput = sys.stdin.readline\nI = lambda: int(input())\nS = lambda: input()\nL = lambda: list(map(int, input().split()))\n###################################################\n\n\n\n\ndef solution(n):\n if 360%(180-n)==0:\n print('YES')\n else:\n print('NO')\n\n\nif __name__=='__main__':\n n = I()\n for _ in range(n):\n solution(I())", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Oct 12 17:31:08 2023\r\n\r\n@author: 苏柔德 2300011012\r\n\"\"\"\r\nt= int(input())\r\nfor _ in range(t):\r\n a=int(input())\r\n n=360/(180-a)\r\n if n%1==0:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n a=int(input())\r\n print(['NO','YES'][360%(180-a)==0])", "t = int(input())\r\ns=[]\r\nfor k in range(t):\r\n ang = int(input())\r\n if 360/(180-ang) == int(360/(180-ang)):\r\n s.append('YES')\r\n else:\r\n s.append('NO')\r\nfor i in s:\r\n print(i)\r\n", "answers = []\r\n\r\nfor i in range(int(input())):\r\n x = int(input())\r\n if 360%(180-x) == 0:\r\n answers.append(\"YES\")\r\n else:\r\n answers.append(\"NO\")\r\n\r\n\r\nfor i in answers:\r\n print(i)\r\n", "for x in range(int(input())):\r\n angle=int(input())\r\n N=360/(180-angle)\r\n print([\"NO\",\"YES\"][int(N)==N])", "a=int(input())\r\nfor i in range(a):\r\n b=int(input())\r\n if int(360/(-b+180))==360/(-b+180) and 360/(-b+180)>2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n", "num=int(input())\r\nwhole=[]\r\nfor i in range(num):\r\n raw=int(input())\r\n processed=360/(180-raw)\r\n if processed==int(processed) and processed >= 3:\r\n whole.append(\"YES\")\r\n else:\r\n whole.append(\"NO\")\r\nfor ans in whole:\r\n print(ans)", "t = int(input())\r\nresults = []\r\nfor i in range(t):\r\n a = int(input())\r\n results.append('YES' if ((360 / (180 - a)) == (360 // (180 - a))) else 'NO')\r\n[print(result) for result in results]", "test=int(input())\r\nm=[]\r\nfor i in range(test):\r\n m.append(int(input()))\r\nfor i in m:\r\n if 360%(180-i)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in [0](int(input())):\r\n a=int(input())\r\n print('YNEOS'[int((360%(180-a))!=0)::2])", "def solve():\r\n\tt = int(input())\r\n\tq = [int(input()) for i in range(t)]\r\n\tangles = {}\r\n\t\r\n\tfor i in q:\r\n\t\tn = -360/(i-180)\r\n\t\tif n.is_integer():\r\n\t\t\tprint('YES')\r\n\t\telse:\r\n\t\t\tprint('NO')\r\n\t\t\r\n\r\nsolve()\r\n", "def can_build_fence(angle):\r\n return 360 % (180 - angle) == 0\r\n\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n angle = int(input())\r\n if can_build_fence(angle):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nans=[]\r\nfor a in range(t):\r\n a = int(input())\r\n if 360%(180-a)==0:\r\n ans.append('YES')\r\n else: ans.append('NO')\r\nfor x in ans: print(x)", "n=int(input())\r\n\r\nfor i in range(0,n):\r\n p=int(input())\r\n \r\n ans=(360)/(180-p)\r\n\r\n if ans.is_integer()==True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\n\r\n\r\n\r\n ", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n\tt=int(input())\r\n\tif t<60:\r\n\t\ta.append('NO')\r\n\telif 60<=t<180:\r\n\t\ti=360/(180-t)\r\n\t\tif i>=3 and i==i//1:\r\n\t\t a.append('YES')\r\n\t\telse:\r\n\t\t\ta.append('NO')\r\n\telse:\r\n\t\ta.append('NO')\r\nprint('\\n'.join(a))", "t = int(input())\r\na = []\r\nfor i in range(t):\r\n degrees = int(input())\r\n a.append(degrees)\r\n \r\nfor d in a:\r\n if 360 % (180 - d) == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "m=int(input())\r\ns=[]\r\nfor n in range(m):\r\n p=int(input())\r\n s.append(p)\r\nfor i in range(m):\r\n n=360/(180-s[i])\r\n l=int(n)\r\n if l==n:\r\n print('YES')\r\n else:\r\n print('NO')", "a = int(input())\r\nfor i in range(a):\r\n m = int(input())\r\n n = 360 % (180-m)\r\n t = 360 / (180-m)\r\n if n == 0 and t >= 3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import sys\ninput = lambda: sys.stdin.readline().rstrip('\\n\\r')\n\nfrom collections import Counter, defaultdict, deque\nfrom itertools import accumulate, chain, zip_longest, product, repeat\nfrom bisect import bisect_left, bisect_right\nfrom math import gcd\nfrom string import ascii_lowercase\nfrom functools import cmp_to_key\n\nmod = 10 ** 9 + 7\nmod_2 = 998244353\n\ndef solve():\n a = int(input())\n if 360 % (180 - a) == 0:\n return \"YES\"\n else:\n return \"NO\"\n\n\nfor _ in range(int(input())):\n val = solve()\n print(val)\n\n", "Angle = []\r\n# 360 = 2^3 * 3^2 * 5\r\n# 2:0,1,2,3 3:0,1,2 5:0,1\r\nfor i in range(4):\r\n for j in range(3):\r\n for k in range(2):\r\n factor = (2*i) (3*j) (5*k)\r\n if factor - 2 > 0:\r\n Angle.append(180 (factor - 2) // factor)\r\nt = int(input())\r\nfor _ in range(t):\r\n degree = int(input())\r\n if degree in Angle:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n\tn=180-int(input())\r\n\tif 360//n>=3 and 360%n==0:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "#author 沈天健 2300011417\r\nt=int(input())\r\ndef ok_angle(x):\r\n if(360%(180-x)==0):\r\n return True\r\n else:\r\n return False\r\nfor _ in range(t):\r\n angle=int(input())\r\n if(ok_angle(angle)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\nfor _ in range(n):\r\n angle = int(input())\r\n n = 360/(180-angle)\r\n if n == int(n):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "t = int(input())\n#angles = []\nangles = [60, 90, 108, 120, 135, 140, 144, 150, 156, 160, 162, 165, 168, 170, 171, 172, 174, 175, 176, 177, 178, 179]\n#for n in range(3, 1000):\n# if (((n-2)180) % n == 0):\n# a = (n-2)180//n\n# angles.append(a)\n# #angles[a] = n\n\n#print(angles)\nfor _ in range(t):\n a = int(input())\n print(\"YES\" if a in angles else \"NO\")\n\n\t\t \t \t\t\t \t \t \t\t\t\t\t\t\t \t\t\t\t\t\t\t", "# n = int(input())\r\n# u = 180\r\n# for i in range(n):\r\n# i = int(input())\r\n# if u // i <= n:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\nn = int(input())\r\nfor i in range(1, n + 1):\r\n x=int(input())\r\n if 360%(180-x)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n n = 360 // (180 - a)\r\n if (n * (180 - a)) == 360:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\r\nfor it in range(int(input())):\r\n a=int(input())\r\n n=360/(180-a)\r\n if int(n)==n: print(\"YES\")\r\n else: print(\"NO\")", "n = int(input())\r\nanswer = []\r\nfor _ in range(n):\r\n jiaodu = int(input())\r\n if 360%(180 - jiaodu) == 0:\r\n answer.append(\"YES\")\r\n else:\r\n answer.append('NO')\r\nfor a in answer:\r\n print(a)", "'''\n###### * User Profile : Keval_78\nLinkedIn: https://www.linkedin.com/in/kevalpadsala78/\nGithub: https://github.com/Keval78\nLeetcode: https://leetcode.com/Keval_78/\n'''\n\nimport sys\nfrom os import path\nfrom math import log2, floor, ceil, sqrt, pow, gcd\n# from random import random, randint, shuffle, choice\nfrom collections import Counter, defaultdict, deque\n# from itertools import permutations, combinations\n# from functools import reduce\n# from heapq import heapify, heappop, heappush, heapreplace\nfrom bisect import bisect_left, bisect_right\n\n\ndef si(): return sys.stdin.readline().strip()\ndef ii(): return int(si())\ndef mi(ss=\" \"): return map(int, si().split(ss))\ndef msi(ss=\" \"): return map(str, si().split(ss))\ndef li(ss=\" \"): return list(mi(ss))\n\n\nsys.setrecursionlimit(10 5)\nMOD, MOD2, INF = 10 9 + 7, 998244353, float('inf')\nMAX = 10*5+1\n\n\nfor _ in range(ii()):\n angle = ii()\n print(\"YES\") if 360 % (180-angle) == 0 else print(\"NO\")\n", "t = int(input())\r\nfor tc in range (t):\r\n a = int(input())\r\n n = 360%(180-a)\r\n # print(n)\r\n if n == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n a = int(input())\r\n print(\"YES\" if (360/(180-a)).is_integer() else \"NO\")", "for i in range(int(input())):\r\n print(['NO', 'YES'][360 % (180 - int(input())) == 0])", "a = int(input())\r\nb=[]\r\nfor i in range(0,a):\r\n b.append(int(input()))\r\nfor i in range(0,a):\r\n if 360%(180-b[i]):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "d = [60,90,108,120,135,140,144,150,156,160,162,165,168,170,171,172,174,175,176,177,178,179,]\r\nfor _ in range(int(input())):\r\n a = int(input())\r\n print(\"YES\" if a in d else \"NO\")", "a=int(input())\r\nc=[]\r\nfor i in range(a):\r\n b=180-int(input())\r\n if 360%b==0:\r\n c.append('YES')\r\n else:\r\n c.append('NO')\r\nfor i in c:\r\n print(i)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Oct 5 00:34:05 2022\r\n\r\n@author: thinkpad\r\n\"\"\"\r\n\r\nturn = int(input())\r\ncount = 0\r\nwhile count<turn:\r\n count+=1\r\n a = int(input())\r\n t1,t2 = 360/(180-a),360//(180-a)\r\n if t1==t2:\r\n print('{}'.format('YES'))\r\n else:\r\n print('{}'.format('NO'))\r\n ", "n = int(input())\r\nls=[60, 90, 108, 120, 135, 140, 144, 150, 156, 160, 162, 165, 168, 170, 171, 172, 174, 175, 176, 177, 178, 179]\r\nfor i in range (n):\r\n t = int(input())\r\n if t in ls :\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")", "# Night Vision\r\nfor _ in range(int(input())):\r\n n = int(input());calc = 360/(180-n)\r\n if calc >= 3 and calc == int(calc): print(\"YES\")\r\n else: print(\"NO\")\r\n", "inputlst=[]\r\nt = int(input())\r\nfor i in range(0,t):\r\n a = int(input())\r\n inputlst.append(a)\r\n\r\nfor a in inputlst:\r\n if (360%(180-a) == 0):\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n angle = int(input())\r\n print('YES' if 360%(180-angle)==0 else 'NO')", "\r\niter = int(input())\r\n\r\nfor i in range(iter):\r\n \r\n a = int(input())\r\n if (360 % (180 - a) == 0):\r\n print(\"YES\\n\")\r\n else:\r\n print(\"NO\\n\")\r\n\r\n", "for _ in range(int(input())):\r\n a = int(input())\r\n n = 3\r\n while 180(n-2) / n < a:\r\n n+=1\r\n print(\"YES\" if 180 * (n-2) / n == a else \"NO\")", "def f():\n n = int(input())\n for _ in range(n):\n angle = int(input())\n sides = 360.0 / (180.0 - angle)\n if int(sides) == sides:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nf()\n", "arr = []\r\nfor i in range(3, 20000):\r\n if (180 * (i - 2)) / i > 179:\r\n break\r\n if (180 * (i - 2)) % i == 0:\r\n arr.append((180 * (i - 2)) // i)\r\nfor i in range(int(input())):\r\n if int(input()) in arr:\r\n print('YES')\r\n else:\r\n print('NO')", "n=int(input())\r\ns=0\r\nwhile s < n:\r\n a=int(input())\r\n a=360/(180-a)\r\n if int(a)-a==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n s+=1", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n b=2/(1-a/180)\r\n if b>2 and (abs(b-int(b)) < 10(-10) or abs(b-int(b)-1)<10(-10)):\r\n print('YES')\r\n else :\r\n print('NO')", "q = int(input())\r\nfor _ in range(q):\r\n n = int(input())\r\n if n < 60:\r\n print('NO')\r\n elif (360 / (180 - n)) == int((360 / (180 - n))):\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n for o in range(3,1001):\r\n if ao == (o-2)180:\r\n print(\"YES\")\r\n break\r\n if o == 1000 and ao != (o-2)180:\r\n print(\"NO\")\r\n break", "for _ in range(int(input())):\r\n a = int(input())\r\n\r\n if a<60:\r\n print(\"NO\")\r\n continue\r\n if (2a)%(180-a)==0:\r\n print(\"YES\")\r\n continue\r\n print(\"NO\")", "n = int(input())\r\nfor i in range(n):\r\n angel = int(input())\r\n if 360%(180-angel) == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "#180n-360=an\r\nfor i in range(int(input())):\r\n a = int(input())\r\n con = 180-a\r\n if 360 % con == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n", "for _ in range(int(input())):\r\n y = int(input())\r\n x = 360 / (180 - y)\r\n if x == int(x):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "t = int(input())\r\n#t = int(t)\r\nfor i in range(t):\r\n a = input()\r\n a = int(a)\r\n a = 180 - a\r\n if(360 % a == 0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "round = int(input())\r\nfor _ in range(round):\r\n a = int(input()) #a refer to angle\r\n if 360/(180-a)== int(360/(180-a)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "num = int(input())\r\nfor i in range(num):\r\n n = int(input())\r\n if 360 ==(180-n)int(360/(180-n)):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "def solve(a):\r\n if 360%(180-a)==0:return(\"YES\")\r\n return(\"NO\")\r\nfor _ in range(int(input())):\r\n print(solve(int(input())))", "n=int(input())\r\nfor _ in range(n):\r\n if 360%(180-int(input()))==0:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in range(int(input())):\r\n z=int(input())\r\n n=360/(180-z)\r\n if n-int(n)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "for x in range(int(input())):\r\n angel = int(input())\r\n print(\"YES\" if 360 % (180-angel) == 0 else \"NO\")", "n=int(input())\r\ns=[]\r\nfor i in range(100000):\r\n if (i180)%(i+2)==0:\r\n a=(i180)//(i+2)\r\n s.append(a)\r\nfor k in range(n):\r\n p=int(input())\r\n if p in s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n b=180-a\r\n B=int(b)\r\n if 360%b==0 and 360/b>2:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nfor i in range(n):\r\n d = int(input())\r\n n_ = 360//(180-d)\r\n if (180-d)n_==360 :\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n n=int(input())\r\n#n,k=map(int,input().split())\r\n#for i in range(n):\r\n k=360/(180-n)\r\n if(int(k)==k):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "l= [179]\r\nfor i in range(3,181):\r\n x=int((i-2)180/i)\r\n if (i-2)180/i==x:\r\n l.append((i-2)180/i)\r\nn=int(input())\r\nfor i in range(n):\r\n d=int(input())\r\n print(\"YES\" if d in l else \"NO\")", "from sys import stdout\n\nt = int(input())\nfor _ in range(t):\n num = int( input())\n if 360 % (180 - num) == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n \nstdout.flush()", "n=int(input())\r\nfor i in range(0,n):\r\n p=int(input())\r\n interior=180-p\r\n if 360%interior==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\ntest = [int(input()) for _ in range(n)]\r\n\r\nfor i in test : \r\n if 360%(i-180) == 0 : print(\"YES\")\r\n else : print(\"NO\")", "t=int(input())\r\nwhile t>0:\r\n t-=1\r\n \r\n n=int(input())\r\n k=180-n\r\n f=0\r\n for i in range(1,361):\r\n if 360/i==k:\r\n f=1\r\n print(\"YES\")\r\n if f==0:\r\n \r\n print(\"NO\")", "a=[3,4,5,6,8,9,10,12,15,18,20,24,30,36,40,45,60,72,90,120,180,360]\r\nd=[180(n-2)/n for n in a]\r\ng=int(input())\r\nfor k in range(g):\r\n q=int(input())\r\n if q in d:\r\n print('YES')\r\n else:\r\n print('NO')", "\r\nn = int(input())\r\narr = []\r\nfor i in range(3, 361):\r\n arr.append((i - 2) 180 / i)\r\nfor i in range(n):\r\n x = float(input())\r\n if arr.count(x) > 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "tt=int(input())\r\narrow=[]\r\nwhile tt>0:\r\n n=int(input())\r\n if n>180:\r\n ans='NO'\r\n else:\r\n a=180-n\r\n if 360%a==0:\r\n ans='YES'\r\n else:\r\n ans='NO'\r\n arrow.append(ans)\r\n tt-=1\r\nfor i in range(len(arrow)):\r\n print(arrow[i])", "l = []\r\nn = 3\r\nwhile n <400:\r\n l.append(((n-2)180)/n)\r\n n+=1\r\n\r\n\r\nfor _ in range(int(input())):\r\n a = int(input())\r\n if a in l:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in range(int(input())):\r\n a=int(input())\r\n#(n-2)180=na→180n-360-an=0→(180-a)n=360→n=360/(180-a)\r\n n=360%(180-a)\r\n if n==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Oct 11 19:29:27 2023\r\n\r\n@author: liu\r\n\"\"\"\r\n\r\nt = int(input())\r\n\r\nfor _ in range(0,t):\r\n a = int(input())\r\n if 360 % (180-a) == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "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 Fancy_Fence():\r\n t = inp()\r\n outputStr = ''\r\n\r\n for i in range(t):\r\n a = inp()\r\n n = 360/(180-a)\r\n\r\n if n == int(n):\r\n outputStr += 'YES' + '\\n'\r\n else:\r\n outputStr += 'NO' + '\\n'\r\n \r\n outputStr = outputStr.strip()\r\n print(outputStr)\r\n \r\n return \r\n\r\nFancy_Fence()", "n = int(input())\r\nfor i in range(n):\r\n angle = int(input())\r\n rmag = 180-angle\r\n if 360 % rmag == 0:\r\n print('YES')\r\n elif 360 % rmag != 0:\r\n print('NO')", "IN = lambda:list(map(int, input().split()))\r\n \r\nfor _ in range(IN()[0]):\r\n angle = 180-(IN()[0])\r\n print(\"YNEOS\"[(360%angle != 0)::2])", "n = int(input())\r\ntests = []\r\n\r\nfor i in range(n):\r\n test = int(input())\r\n tests.append(test)\r\n\r\nfor i in range(n):\r\n ugol = tests[0]\r\n tests = tests[1:]\r\n a = (360 / (180 - ugol))\r\n if int(a) == a:\r\n print('YES')\r\n else:\r\n print('NO')", "# -- coding: utf-8 --\r\n\r\n#石芯洁 2300090102\r\n \r\nt=int(input())\r\nfor _ in range(t):\r\n a=int(input())\r\n if a <60:\r\n print(\"NO\")\r\n else:\r\n n_side=360/(180-a)\r\n if n_side % 1 ==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n", "# cook your dish here\r\n# by MEDIPALLY ABINAY\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n if(180-n>0 and 360%(180-n)==0):\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n", "'''\nn,m,a=map(int,input().split())\nif n%a==0:\n x=n//a\nelse :\n x=n//a+1\nif m%a==0:\n y=m//a\nelse:\n y=m//a+1\nprint(xy)\n'''\n\n'''\nn=int(input())\nx=0\nfor i in range(0,n,1) :\n l=list(map(int,input().split()))\n s=0\n for j in l :\n s+=j\n if s>=2 :\n x+=1\nprint(x)\n'''\n\n'''\nn,k=map(int,input().split())\nl=list(map(int,input().split()))\ny=k-1\nif l[k-1]>0 :\n while l[y]==l[k-1] :\n y+=1\n if y==n :\n break\nelse :\n while l[y]<=0 :\n y-=1\n if y==-1 :\n break\n y+=1\nprint(y)\n'''\n\n'''\nm,n=map(int,input().split())\nmax=(mn)//2\nprint(max)\n'''\n\n'''\nwhile True:\n try:\n str=input()\n except EOFError :\n break\n\n x = 0\n y = 0\n for i in range(0, len(str) - 1, 1):\n if str[i] == \"@\" and x == 0:\n x = i\n elif str[i] == \"@\" and x != 0:\n x = len(str) - 1\n elif str[i] == \".\":\n y = i\n if x == 0 or str[0] == \".\" or str[-1] == \".\" or x==len(str) - 1 or str[x+1]==\".\" or str[x-1] == \".\"or y<x :\n print(\"NO\")\n else:\n print(\"YES\")\n'''\n\n'''\ndef f(m,l) :\n k=0\n for x in l :\n if x==m :\n k=k+1\n return k\n\nq=int(input())\ns=[]\nfor i in range(0,q,1) :\n n=int(input())\n l=list(map(int,input().split()))\n x=2048\n for j in range(11,-1,-1) :\n if x//(2j)<f(2j,l) :\n x=x%(2j)\n else :\n x=x-f(2j,l)(2j)\n if x==0 :\n s.append(\"YES\")\n else :\n s.append(\"NO\")\nfor y in s :\n print(y)\n'''\n\nt=int(input())\nl=[]\ns=[]\nfor i in range(0,t,1) :\n x=int(input())\n l.append(x)\nfor y in l :\n if 360%(180-y)==0 :\n s.append('YES')\n else :\n s.append('NO')\nfor z in s :\n print(z)\n", "t = int(input())\nfor i in range(t):\n a = int(input())\n n = 360//(180-a)\n if n(180-a) == 360:\n print(\"YES\")\n else:\n print(\"NO\")\n\t \t \t \t \t \t \t\t \t \t\t\t \t\t", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Sep 28 17:36:15 2021\r\n\r\n@author: cheeh\r\n\"\"\"\r\n\r\ndef fancyfence(x):\r\n k=360/(180-x)\r\n l=str(k).split('.')\r\n if l[1]=='0':\r\n return print('YES')\r\n else:\r\n return print('NO')\r\ntestnum=int(input())\r\nk=0\r\ntestlist=[]\r\nwhile k<testnum:\r\n testlist.append(int(input()))\r\n k+=1\r\nfor ele in testlist:\r\n fancyfence(ele)", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n a = int(stdin.readline())\r\n\r\n if 360 % (180 - a) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nfor _ in range(int(stdin.readline())):\r\n solve()\r\n", "from fractions import Fraction\n\nn = int(input())\n\nfor _ in range(n):\n q = int(input())\n print(\"YES\" if Fraction(-360,q-180).denominator==1 else \"NO\")", "for i in range(int(input())):\r\n a=int(input())\r\n x=360/(180-a)\r\n print(('NO','YES')[x-int(x)==0 and x>2])", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nIarr = lambda: list(map(int,input().split()))\r\n\r\ndef main():\r\n for _ in range(int(input())):\r\n n = int(input())\r\n ans = 180-n\r\n if(360%ans==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n\r\nif __name__ == '__main__':\r\n main()", "tests=int(input())\r\n\r\nfor p in range(1,tests+1):\r\n inangle=int(input())\r\n out=360/(180-inangle)\r\n \r\n if out==int(out):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from math import ceil, floor\r\n\r\ndef is_valid(n):\r\n return ceil(n) == floor(n)\r\n\r\ndef can_build(a):\r\n n = 360 / (180 - a)\r\n if is_valid(n):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n print(can_build(a))", "\r\nyes_no = 'YNEOS'\r\n\r\ni = int(input())\r\nfor i in range(i):\r\n a = int(input())\r\n print(yes_no[360%(180-int(a))>0::2])\r\n", "t = int(input())\r\nans = []\r\n\r\nfor i in range(t):\r\n a = int(input())\r\n j = 3\r\n flag = True\r\n while (180 - a) * j <= 360:\r\n if (180 - a) * j == 360:\r\n ans.append(\"YES\")\r\n flag = False\r\n break\r\n else:\r\n j += 1\r\n if flag:\r\n ans.append(\"NO\")\r\nfor i in ans:\r\n print(i)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Fri Oct 6 16:02:42 2023\r\n\r\n@author: ghp\r\n\"\"\"\r\n\r\nt=int(input())\r\nfor i in range(t):\r\n x=int(input())\r\n y=180-x\r\n if 360%y==0:\r\n print(\"YES\")\r\n else:\r\n print('NO')", "t = int(input())\nfor i in range(t):\n a = int(input())\n if ((-360) / (a -180)) == int((-360) / (a -180)):\n print(\"YES\")\n else:\n print(\"NO\")\n", "for i in range(int(input())):\r\n n=int(input())\r\n x=180-n\r\n if 360%x==0:\r\n print('YES')\r\n else:\r\n print('NO')", "def verifica_poligono(a):\r\n # formula do angulo interno de um poligono regular: a = 180(n - 2)/n \r\n # isolando o 'n', temos:\r\n n = 360/(180-a)\r\n\r\n if n == int(n): # se o numero de lados for inteiro, o poligono existe\r\n print(\"YES\")\r\n else: # se nao, nao existe\r\n print(\"NO\")\r\n\r\ndef main():\r\n t = int(input())\r\n for i in range(t):\r\n a = int(input()) #angulo\r\n verifica_poligono(a)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "#王奕欢 2300012285\r\na=int(input())\r\nl=[]\r\nfor i in range(a):\r\n b=int(input())\r\n c=180-b\r\n if 360%c==0:\r\n l.append(\"YES\")\r\n else:\r\n l.append(\"NO\")\r\nfor n in l:\r\n print(n)", "for _ in range(int(input())):\r\n a = int(input())\r\n print(\"NO\" if a==180 or not 360%(180-a)==0 else \"YES\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n ANGLES:list[int] = [int(input()) for _ in range(int(input()))]\r\n IS_POSSIBLES:list[bool] = [(360/(180-angle)).is_integer() for angle in ANGLES]\r\n print(\"\\n\".join([[\"NO\", \"YES\"][isPossible] for isPossible in IS_POSSIBLES]))\r\n\r\nmain()", "for i in range(int(input())):\r\n deg=int(input())\r\n n=360/(180-deg)\r\n if n-int(n)==0.0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "right = []\r\nfor i in range(4):\r\n for j in range(3):\r\n for k in range(2):\r\n x = int(180-360/(2i 3*j 5*k))\r\n right.append(x)\r\nn = int(input())\r\nfor i in range(n):\r\n z = int(input())\r\n if z in right:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "for _ in range(int(input())):\r\n t = int(input())\r\n\r\n n = float(360/(180-t))\r\n\r\n if n==int(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n'''\r\n\r\nt.n = (n-2).180\r\nt.n = 180.n - 360\r\n360 = n(180-t)\r\nn = (360)/(180-t)\r\n\r\n'''", "[[print('YES') if int(input()) in [(n-2)180/n for n in range(3,1000)] else print('NO')] for n in range(int(input()))]", "t = int(input())\r\n\r\ndef angle(a):\r\n if 360 % (180-a) == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nfor i in range(t):\r\n a = int(input())\r\n possibility = angle(a)\r\n print(possibility)", "\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n k = int(input())\r\n if((360/(180-k)) == (360//(180-k))):\r\n print('YES')\r\n else:\r\n print('NO')", "from math import inf\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nans = set()\r\nfor i in range(3, 100000):\r\n x = (i - 2) * 180\r\n cur = x / i\r\n if int(cur) == cur:\r\n ans.add(int(cur))\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n print(\"YES\" if n in ans else \"NO\")", "# the angel of a regular polygon is\r\n# (1 - 2/n) * 180° \r\n\r\nimport math\r\n\r\nn = int(input())\r\n\r\nfor _ in range(0, n):\r\n a = int(input())\r\n\r\n k = 2 / (1 - a / 180) \r\n\r\n\r\n if math.isclose(round(k), k, abs_tol=1e-6):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def solve(n):\r\n return [\"NO\",\"YES\"][360 % (180 - n) == 0]\r\n\r\nlst = [int(w.rstrip()) for w in open(0).readlines()]\r\nprint('\\n'.join(solve(n) for n in lst[1:]))", "t = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n if a < 60 :\r\n print('NO')\r\n else:\r\n b = int(180-a)\r\n if 360%b == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n ", "n=int(input())\r\nx=120\r\ns=[]\r\nwhile x>0:\r\n if 360%x==0:\r\n s.append(x)\r\n x-=1\r\nfor i in range(n):\r\n a=int(input())\r\n if 180-a in s:\r\n print('YES')\r\n else:\r\n print('NO')", "a = []\r\nfor i in range(int(input())):\r\n if 360 % (180 - int(input())) == 0:\r\n a.append('YES')\r\n else:\r\n a.append('NO')\r\nfor i in a:\r\n print(i)", "Q=int(input())\r\nfor q in range(0,Q) :\r\n a=int(input())\r\n a=180-a\r\n if (360%a)==0 :\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")", "# https://codeforces.com/problemset/problem/270/A\n\ntest_cases = int(input())\n\ndef handle():\n angle = int(input())\n if 360 % (180 - angle) == 0:\n return \"YES\"\n return \"NO\"\n\nfor _ in range(test_cases):\n print(handle())", "n = int(input())\r\nresult = []\r\nfor i in range(n):\r\n degree = int(input())\r\n if 360 % (180-degree) == 0:\r\n result.append('YES')\r\n else:\r\n result.append('NO')\r\nfor j in range(len(result)):\r\n print(result[j])\r\n \r\n \r\n \r\n", "from math import ceil\r\n\r\n\r\nt = int(input())\r\nwhile t :\r\n angle = int(input())\r\n sides = 360/(180-angle) \r\n print(\"YES\" if ceil(sides) == sides else \"NO\")\r\n t -= 1", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Oct 11 20:19:10 2023\r\n\r\n@author: masiyu004\r\n\"\"\"\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n if 360%(180-a)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in range(int(input())):\r\n n= int(input())\r\n print([\"NO\",\"YES\"][360/(180-n)== int(360/(180-n))])", "an=[]\r\nfor i in range(3,1000):\r\n a=((i-2)180)/i\r\n if a-int(a)==0:\r\n an.append(int(a))\r\nt=input()\r\nfor tt in range(int(t)):\r\n aa=input()\r\n if int(aa) in an:\r\n print('YES')\r\n else:\r\n print('NO')", "T = int(input())\r\nfor t in range(T):\r\n angle = int(input())\r\n n = 3\r\n while True:\r\n # print(n)\r\n if n angle == (n - 2) * 180:\r\n print(\"YES\")\r\n break\r\n n += 1\r\n if n > 360:\r\n print(\"NO\")\r\n break", "for i in range(int(input())):\r\n k=360%(180-int(input()))==0\r\n print(k\"YES\"+(1-k)\"NO\")", "def polygon(k):\r\n\tif 360 % (180 - k) == 0:\r\n\t\treturn 'YES'\r\n\telse:\r\n\t\treturn 'NO'\r\n\r\nt = int(input())\r\nlst = []\r\nfor i in range(t):\r\n\tn = int(input())\r\n\tlst.append(polygon(n))\r\nprint(lst, sep=\"\\n\")", "n = int(input())\nl = []\nfor i in range(n):\n a = int(input())\n l.append(a)\n\n\nfor a in l:\n s = 360 / (180 - a)\n if s % 1 == 0:\n print(\"YES\")\n else:\n print(\"NO\")", "n = int(input())\r\nans = []\r\n\r\nfor i in range(n):\r\n x = int(input())\r\n myvariable = 360/(180-x)\r\n myintvariable = int(myvariable)\r\n if (myintvariable - myvariable == 0.0):\r\n ans.append(\"YES\")\r\n else:\r\n ans.append(\"NO\")\r\nfor i in ans:\r\n print(i)\r\n ", "A={60,90,179,178,177,176,175,174,172,171,170,168,165,162,160,156,150,144,140,135,120,108}\r\nfor _ in range(int(input())):print([\"NO\",\"YES\"][int(input()) in A])", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n s=360/(180-a)\r\n if s==int(s):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nfor i in range(t):\r\n x = int(input())\r\n n = 360/(180 - x)\r\n if n%1==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "'''程文奇 2100015898'''\r\ndef fence(a):\r\n if 360%(180-a)==0:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\nn=int(input())\r\nanswerlist=[]\r\nfor i in range(n):\r\n answerlist.append(fence(int(input())))\r\nfor j in answerlist:\r\n print(j)", "\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\nfor _ in range(II()):\r\n deg = II()\r\n print('NO' if 360%(180-deg) or deg < 60 else 'YES')\r\n \r\n \r\n", "#@sorcerer_21\r\nimport sys\r\ninput=lambda:sys.stdin.readline()\r\nmapin=lambda:map(int,input().split())\r\nangles=[]\r\nfor i in range(3,361):angles.append((i-2)180/i)\r\nfor i in range(int(input())):\r\n theta=float(input())\r\n print('YES' if theta in angles else 'NO')", "def regular_polygon(theta):\r\n i = 3\r\n while theta * i / (i-2) > 180:\r\n i += 1\r\n if theta * i / (i-2) == 180:\r\n return(True)\r\n else:\r\n return(False)\r\n\r\nn = int(input())\r\nalpha = []\r\nfor i in range(n):\r\n alpha.append(int(input()))\r\nfor i in range(n):\r\n if regular_polygon(alpha[i]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# A. Fancy Fence\r\n# time limit per test2 seconds\r\n# memory limit per test256 megabytes\r\n# inputstandard input\r\n# outputstandard output\r\n# Emuskald needs a fence around his farm, but he is too lazy to build it himself. \r\n# So he purchased a fence-building robot.\r\n\r\n# He wants the fence to be a regular polygon. The robot builds the fence along a \r\n# single path, but it can only make fence corners at a single angle a.\r\n\r\n# Will the robot be able to build the fence Emuskald wants? In other words, \r\n# is there a regular polygon which angles are equal to a?\r\n\r\n# Input\r\n# The first line of input contains an integer t (0 < t < 180) — the number of tests.\r\n# Each of the following t lines contains a single integer a (0 < a < 180) — the angle\r\n# the robot can make corners at measured in degrees.\r\n\r\n# Output\r\n# For each test, output on a single line \"YES\" (without quotes), if the robot can build \r\n# a fence Emuskald wants, and \"NO\" (without quotes), if it is impossible.\r\n \r\ndef main(): \r\n testes = int(input() )\r\n for i in range(testes):\r\n angle = int(input())\r\n if(360 % (180-angle) == 0 ):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nfor i in range(n):\r\n a = int(input())\r\n s = 360 / (180 - a)\r\n if str(s)[-1] == '0':\r\n print('YES')\r\n else:\r\n print('NO')", "p=int(input())\r\nfor i in range(p):\r\n x=int(input())\r\n n=360/(180-x)\r\n if n== int(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\nlist1=[179,178,177,176,175,174,172,171,170,168,165,162,160,156,150,144,140,135,120,108,90,60]\r\nfor i in range(t):\r\n a=int(input())\r\n if a in list1:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\npolygons = []\r\nfor i in range(3, 361):\r\n if 360%i == 0:\r\n polygons.append(180-(360//i))\r\nfor i in range(t):\r\n angle = int(input())\r\n if angle in polygons:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for m in range(int(input())): #declaring input\r\n print(\"YES\" if 360 % (180 - int(input())) == 0 else \"NO\") #printing output here", "import math as mt\r\nfrom collections import defaultdict,deque\r\nfrom re import I\r\nimport sys\r\nfrom bisect import bisect_right as b_r\r\nfrom bisect import bisect_left as b_l\r\nfrom os import path\r\nfrom heapq import \r\n\r\ninput=sys.stdin.readline\r\n\r\nmod=1000000007\r\nINT_MAX = sys.maxsize-1\r\nINT_MIN = -sys.maxsize\r\n\r\n\r\n\r\n# if(path.exists('input.txt')):\r\n# sys.stdin = open('input.txt','r')\r\n# sys.stdout = open('output.txt','w')\r\n\r\ndef myyy__answer():\r\n a=int(input())\r\n if(a==180):\r\n return \"NO\"\r\n else:\r\n if(360%(180-a)==0):\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n \r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n for _ in range(int(input())):\r\n print(myyy__answer())", "n = int(input())\r\nfor i in range(n):\r\n num = 360 % (180 - int(input()))\r\n if num == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in range(int(input())):\r\n if 360%(180-int(input()))==0:print('YES')\r\n else:print('NO')", "#2300011863 张骏逸\nfor i in range(int(input())):\n n=int(input())\n n=180-n\n if 360%n==0:\n print('YES')\n else:\n print('NO')", "for i in range(int(input())):\r\n s=int(input())\r\n if (360/(180-s))==(360//(180-s)):\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nfor i in range(n):\r\n a = int(input())\r\n b = 180 -a\r\n if 360 % b ==0:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nfor i in range(n):\r\n k = int(input())\r\n if 360%(180-k)==0 and 360/(180-k)>=3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\ndef check(x):\r\n if 360%(180-x)==0:\r\n return\"YES\"\r\n else:\r\n return\"NO\"\r\nfor i in range(n):\r\n x=int(input())\r\n print(check(x))", "t = int(input()) \r\nresults = [] \r\n\r\nfor _ in range(t):\r\n a = int(input()) \r\n\r\n interior_angle = 180 - a\r\n\r\n if 360 % interior_angle == 0:\r\n results.append(\"YES\")\r\n else:\r\n results.append(\"NO\")\r\n\r\nfor result in results:\r\n print(result)\r\n", "n=int(input())\r\nwhile n>0:\r\n n=n-1\r\n a=int(input())\r\n l=360/(180-a)\r\n if l==int(l):\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nfor _ in range(n):\r\n angle = int(input())\r\n found = False\r\n for i in range(3, 1000):\r\n if angle == (i-2)180/i:\r\n print('YES')\r\n found = True\r\n if not found:\r\n print('NO')", "for _ in range(int(input())):\n n=int(input())\n res=360/(180-n)\n print(['NO','YES'][res==int(res)])\n\t \t \t\t\t \t\t\t\t\t \t\t\t\t\t\t \t\t", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n print(\"YES\" if 360 % (180 - n) == 0 else \"NO\")", "\ndef polygon_exists(theta :int) -> str:\n if 360 % (180 - theta) == 0:\n return \"YES\"\n return \"NO\"\n\ntests = int(input())\n\nfor _ in range(tests):\n print(polygon_exists(int(input())))", "t = int(input())\r\na = []\r\nfor i in range(t):\r\n x = int(input())\r\n n = (-360 * x / (x - 180)) / x\r\n a.append('YES' if int(n) == n else 'NO')\r\n\r\nfor i in a:\r\n print(i)\r\n\r\n", "for _ in range(int(input())):\r\n a = int(input())\r\n if (360/(180-a)) - int(360/(180-a)) == 0:\r\n print('YES') \r\n else: \r\n print('NO')", "\r\nfrom math import gcd\r\nfrom bisect import bisect_left, bisect_right\r\nfrom itertools import combinations\r\nfrom itertools import permutations\r\nfrom bisect import bisect_left\r\nfrom math import ceil\r\nfrom heapq import heapify, heappush, heappop, nsmallest\r\nimport bisect\r\nfrom math import pi\r\nfrom collections import deque\r\nfrom math import factorial\r\nfrom math import log, ceil\r\nfrom collections import defaultdict\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# mod = 998244353\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 li1(): 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 and i % 2 == 1:\r\n s.add(i)\r\n n = n // i\r\n if n > 2 and n % 2 == 1:\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 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\n# def input():\r\n# return stdin.buffer.readline()\r\n\r\n\r\ndef readTree(n):\r\n adj = [set() for _ in range(n)]\r\n for _ in range(n-1):\r\n u, v = map(int, input().split())\r\n adj[u-1].add(v-1)\r\n adj[v-1].add(u-1)\r\n return adj\r\n\r\n\r\ndef treeOrderByDepth(n, adj, root=0):\r\n parent = [-2] + [-1](n-1)\r\n ordered = []\r\n q = deque()\r\n q.append(root)\r\n depth = [0] n\r\n while q:\r\n c = q.popleft()\r\n ordered.append(c)\r\n for a in adj[c]:\r\n if parent[a] == -1:\r\n parent[a] = c\r\n depth[a] = depth[c] + 1\r\n q.append(a)\r\n return (ordered, parent, depth)\r\n\r\n\r\ndef isSubSequence(str1, str2):\r\n m = len(str1)\r\n n = len(str2)\r\n j = 0\r\n i = 0\r\n while j < m and i < n:\r\n if str1[j] == str2[i]:\r\n j = j+1\r\n i = i + 1\r\n return j == m\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 while(n != 0):\r\n n >>= 1\r\n count += 1\r\n return 1 << count\r\n\r\n\r\ndef lastPowerOf2(n):\r\n count = -1\r\n if (n and not(n & (n - 1))):\r\n return n\r\n while(n != 0):\r\n n >>= 1\r\n count += 1\r\n return 1 << count\r\n\r\n\r\ndef cou(n):\r\n c = 0\r\n while n > 1:\r\n c += 1\r\n n //= 2\r\n return c\r\n\r\n\r\ndef sortsec(l):\r\n return sorted(l, key=lambda x: x[1])\r\n\r\n\r\ndef BinarySearch(a, x):\r\n i = bisect_left(a, x)\r\n if i:\r\n return (i-1)\r\n else:\r\n return - 1\r\n\r\n\r\ndef subarray(A):\r\n r = set()\r\n\r\n p = {0}\r\n\r\n for x in A:\r\n p = {x \| y for y in p} \| {x}\r\n r \|= p\r\n\r\n return len(r)\r\n\r\n\r\ndef setBitNumber(n):\r\n n \|= n >> 1\r\n n \|= n >> 2\r\n n \|= n >> 4\r\n n \|= n >> 8\r\n n \|= n >> 16\r\n n = n + 1\r\n return (n >> 1)\r\n\r\n\r\ndef countSetBits(n):\r\n count = 0\r\n while (n):\r\n count += n & 1\r\n n >>= 1\r\n return count\r\n\r\n\r\ndef allsub(l):\r\n n = len(l)\r\n a = []\r\n for i in range(n - 1):\r\n a.append([l[:i], l[i:]])\r\n a.append([l[i:], l[:i]])\r\n return a\r\n\r\n\r\ndef closestMultiple(n, x):\r\n if x > n:\r\n return x\r\n z = (int)(x / 2)\r\n n = n + z\r\n n = n - (n % x)\r\n return n\r\n\r\n\r\ndef block(x):\r\n v = []\r\n res = []\r\n while (x > 0):\r\n v.append(int(x % 2))\r\n x = int(x / 2)\r\n for i in range(0, len(v)):\r\n if (v[i] == 1):\r\n res.append(i)\r\n return res\r\n\r\ndef gen(n):\r\n\r\n l=[]\r\n for bi in range(2*n + 1):\r\n x=decimalToBinary(bi)\r\n x='0'(n-len(x))+x\r\n l.append(x)\r\n return l\r\n\r\nfor _ in range(ii()):\r\n n=ii()\r\n if 360%(180-n)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\nr = []\r\nfor i in range(n):\r\n a = int(input())\r\n if 360 %(180-a) == 0:\r\n r.append('YES')\r\n else:\r\n r.append('NO')\r\nfor i in r:\r\n print(i)\r\n", "temp = ['YES', 'NO']\r\nt = int(input())\r\nfor _ in range(t):\r\n b = 180 - int(input())\r\n print(temp[bool(360 % b)])\r\n", "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n if 360%(180-n)==0:\r\n ans = \"YES\"\r\n else:\r\n ans = \"NO\"\r\n\r\n print(str(ans)+\"\\n\")\r\n", "n=int(input())\r\n\r\nfor i in range(n):\r\n x=int(input())\r\n if int(360/(180-x))/float(360/(180-x))==1.0:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\n\r\noutput = []\r\nfor i in range(t):\r\n a = int(input())\r\n n = 360 / (180 - a)\r\n if n - int(n) == 0:\r\n output.append(\"YES\")\r\n else:\r\n output.append(\"NO\")\r\n\r\nfor o in output:\r\n print(o)\r\n", "#270A\r\nn = int(input())\r\nfor i in range(n):\r\n a = int(input())\r\n if abs(round((1/(1-a/180))2)-(1/(1-a/180))2) < 10(-7): \r\n '''\r\n 2 Tips：\r\n 1.DO NOT simply use == , because calculation under type float induce tiny computation error(10(-7)) \r\n 2.DO NOT write int(), because int() will arbitrarily throw away anything after the decimal point, that might be sth. like 0.999999\r\n Write round() instead to ensure tiny rounding error\r\n '''\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n print(\"NO\" if(360%(180-int(input()))) else \"YES\")", "n = int(input())\r\ns = ''\r\nfor i in range(n):\r\n a = int(input())\r\n if 360 % (180-a) == 0:\r\n s = s + 'YES\\n'\r\n else:\r\n s = s + 'NO\\n'\r\nprint(s[:-1])", "n = int(input())\r\n\r\nans = []\r\n\r\nfor i in range(0, n):\r\n deg = int(input())\r\n num = 360 / (180 - deg)\r\n\r\n if num == int(num):\r\n ans.append(\"YES\")\r\n else:\r\n ans.append(\"NO\")\r\n\r\nfor i in ans:\r\n print(i)", "a = int(input())\r\nfor i in range(0,a):\r\n b = int(input())\r\n c = 180-b\r\n d = 360/c\r\n e = d%1\r\n if(e==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def get_ans():\r\n for i in range(1,100000):\r\n if (180i) % (i+2) ==0:\r\n print(int(180i/(i+2)),i)\r\n \r\nans = [60,90,108,120,135,140,144,150,156,160,162,165,168,170,\r\n 171,172,174,175,176,177,178,179]\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n try: \r\n ans.index(a)\r\n print('YES')\r\n except:\r\n print('NO')", "#周家恒化学与分子工程学院 2023年秋\r\n#简单的循环语句\r\np=[]\r\nn=int(input())\r\nfor i in range(0,n):\r\n a=180-int(input())\r\n if 360//a==360/a:\r\n p.append(\"YES\")\r\n else:\r\n p.append(\"NO\")\r\nfor i in p:\r\n print(i)", "i=input;exec(int(i())'print(\"YNEOS\"[360%(180-int(i()))>0::2]);')", "for _ in range(0, int(input())):\n d = int(input())\n print([\"NO\", \"YES\"][360 % (180 - d) == 0])\n", "for i in range(int(input())):\r\n if (360/(int(input())-180)).is_integer():\r\n print(\"YES\")\r\n else:print(\"NO\")", "import math\r\ndu=int(input())\r\nfor i in range(0,du):\r\n y=int(input())\r\n x=360/(180-y)\r\n if x-math.floor(x)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "def isint(x):\r\n if x== int(x):\r\n return True\r\n elif x!=int(x):\r\n return False\r\nn=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n n=360/(180-a)\r\n\r\n if n>=3 and isint(n)==True:\r\n print('YES')\r\n else:\r\n print('NO')\r\n#debug1:type（）判断在这里不是很好用，这里给出判断int的方法，直接比较x与intx是否相等\r\n#debug2：写函数的时候，函数名不能和函数内容中的其他变量/方法重名", "n=int(input())\r\nfor x in range(n):\r\n x=input()\r\n x=int(x)\r\n y=0\r\n for m in range(3,361):\r\n if x==180(m-2)/m:\r\n y+=1\r\n else:\r\n y=y\r\n if y==1:\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n n=2/(1-(a/180))\r\n if abs(n-round(n))<10*(-5):\r\n print('YES')\r\n else:\r\n print('NO')", "from sys import stdin\r\n\r\nres = [\"NO\"] 180\r\n\r\nfor n in range(3, 361):\r\n a = 180 * (n - 2) / n\r\n if int(a) == a:\r\n res[int(a)] = \"YES\"\r\n\r\n\r\ndef solve():\r\n n = int(stdin.readline())\r\n print(res[n])\r\n\r\n\r\nfor _ in range(int(stdin.readline())):\r\n solve()\r\n", "s=[]\r\nfor i in range(3,361):\r\n if 360%i==0:\r\n p=(i-2)180\r\n q=int(p/i)\r\n s.append(q)\r\nn=int(input())\r\ni=1\r\nwhile i<=n:\r\n i=i+1\r\n k=int(input())\r\n if k in s:\r\n print('YES')\r\n else:\r\n print('NO')", "from collections import deque\nt = int(input())\nfor _ in range(t):\n d = int(input())\n n = 360 /(180 - d)\n if n % 1 > 0:\n print(\"NO\")\n else:\n print(\"YES\")\n\n", "t = int(input())\r\nfor i in range(t):\r\n degree = int(input())\r\n if (360//(180-degree))(180-degree)==360:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\n\r\ndata = []\r\nwhile len(data) != n:\r\n data.append(int(input()))\r\n\r\nfor i in data:\r\n if (360 / (180 - i)) % 1 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "# LUOGU_RID: 111701884\nn=eval(input())\r\ndef js():\r\n a = eval(input())\r\n if a<60 or a>=360 or a==180:\r\n print(\"NO\")\r\n return\r\n if 360%(180-a)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n return\r\nfor i in range(n):\r\n js()\r\n", "t=int(input())\r\noutput=[]\r\nfor _ in range(t):\r\n a=int(input())\r\n line=3\r\n while True:\r\n if (180-a)line==360:\r\n output.append(\"YES\")\r\n break\r\n else:\r\n line+=1\r\n if (180-a)line>360:\r\n output.append(\"NO\")\r\n break\r\n[print(i) for i in output]", "t=int(input())\r\nlist=[]\r\n\r\nfor n in range(3,361):\r\n if 360%n==0:\r\n list.append(int(180-360/n))\r\n\r\nfor i in range(1,t+1):\r\n angle=int(input())\r\n if angle in list:\r\n print('YES')\r\n else:\r\n print('NO')", "from sys import stdin\r\ninp = stdin.readline\r\n\r\nt = int(inp())\r\n\r\nfor _ in range(t):\r\n n = int(inp())\r\n\r\n if (2n) % (180 - n) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "for i in range(int(input())):\r\n print('NO'if 360%(180-int(input())) else 'YES')", "t=int(input())\r\nwhile(t):\r\n x=int(input())\r\n n=360/(180-x)\r\n if n%1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n t-=1", "n = int(input())\r\nfor i in range(n):\r\n t = int(input())\r\n s = 360/(180-t)\r\n if s - int(s) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "for _ in range(int(input())):\n a = int(input())\n print('NO' if 360%(180 - a) > 0 else 'YES')\n\n \t\t \t\t \t\t \t \t \t \t\t \t", "tese_time=int(input())\r\nfor i in range(tese_time):\r\n #test_num=2/(1-int(input())/180)这样做由于算法本身按顺序会把2/（2/3） ==2.9999999999996不可\r\n test_num=360/(180-int(input()))\r\n if test_num % 1 == 0.0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "num_test = int(input())\r\n\r\nfor i in range (0, num_test):\r\n angle_a = int(input())\r\n if 360 % (180-angle_a) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for i in range(int(input())):\r\n a = int(input())\r\n n = (360)/(180-a)\r\n if(int(n)==n):\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\n\r\nfor _ in range(t):\r\n n = int(input())\r\n if(360 % (180 - n) == 0): print(\"YES\")\r\n else: print(\"NO\")", "t=int(input())\r\na=[]\r\nfor i in range(t):\r\n a.append(int(input()))\r\nfor i in range(t):\r\n if a[i]<60:\r\n print(\"NO\")\r\n continue\r\n j=3\r\n while(True):\r\n if (j-2)180/j<a[i]<(j-1)180/(j+1):\r\n print(\"NO\")\r\n break\r\n if (j-2)180/j==a[i]:\r\n print(\"YES\")\r\n break\r\n j+=1\r\n \r\n#poly:n\r\n#angle=(n-2)180/n", "t = int(input())\r\n\r\ninput_degrees = [int(input()) for _ in range(t)]\r\n\r\ndegree_list = [theta for theta in range(60, 180) for n in range(3, 361) if ((n-2)180 == ntheta)]\r\n\r\nresult = ['YES' if element in degree_list else 'NO' for element in input_degrees]\r\nprint('\\n'.join(result))", "for times in range(int(input())):\r\n lines = 360 / (180 - float(input()))\r\n print(['NO', 'YES'][int(lines)==lines and lines >= 3])", "t = int(input())\r\nfor j in range(t):\r\n x = int(input())\r\n ans = \"NO\"\r\n for i in range(1,361):\r\n if(i(180-x)==360):\r\n ans = \"YES\"\r\n break\r\n print(ans)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 11 15:49:54 2022\r\n\r\n@author: Lemon_Sherry\r\n\"\"\"\r\n\r\nn = int(input())\r\nfor i in range(0,n):\r\n ag = int(input())\r\n s = 0\r\n while s < 360:\r\n s += 180 - ag\r\n if s == 360:\r\n print('YES')\r\n else:\r\n print('NO')", "i=input\r\nfor x in range(int(i())):print(\"YNEOS\"[360%(180-int(i()))>0::2])", "for t in range(int(input())):\r\n th = int(input())\r\n\r\n if ( 360 % (180 - th) == 0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a=int(input())\r\nfor i in range(a):\r\n b=int(input())\r\n n=360/(180-b)\r\n if n%1==0:\r\n print('YES')\r\n else:\r\n print('NO')", "def judge(a):\r\n n=360/(180-a)\r\n if n>=3 and int(n)==n:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\nN=int(input())\r\nout=[]\r\nfor _ in range(N):\r\n out.append(judge(int(input())))\r\nfor o in out:\r\n print(o)", "t = int(input())\r\n\r\n\r\nfor i in range(t) :\r\n a = int(input())\r\n n = round((2 / (1 - (a/180))))\r\n \r\n x = (n-2) * 180 / n\r\n if(a==x):\r\n print(\"YES\")\r\n else : \r\n print(\"NO\")", "t=int(input())\r\nfor i in range(0,t):\r\n a=int(input())\r\n sides = 360 / (180 - a)\r\n if sides == int(sides) :\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for i in range(int(input())):\r\n d1 = int(input())\r\n n = 360%(180-d1)\r\n if n == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for i in range(int(input())):\r\n print(\"YES\") if 360 % (180-int(input())) == 0 else print(\"NO\")\r\n", "t=int(input())\r\nfor i in range(t):\r\n angle=int(input())\r\n supplementary=180-angle\r\n if 360%supplementary==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nfor i in range(n):\r\n m=int(input())\r\n p=180-m\r\n if (360/p)%1==0:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(int(input()))\r\n\r\nfor c in a:\r\n guo = 360/(180-c)\r\n if int(guo) == round(guo,16):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "times = int(input())\r\nfor i in range(times):\r\n angle = int(input())\r\n if (360/(180-angle)) == (360//(180-angle)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for t in range(int(input())):\r\n a = int(input())\r\n n = 3\r\n found = False\r\n if a>=60:\r\n while an >180(n-2):\r\n n+=1\r\n if an == 180(n-2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "list=[]\r\nfor i in range(1,1000):\r\n a = 180 - 360/(i+2)\r\n if 360 % (i+2) == 0:\r\n list.append(a) \r\nn = int(input())\r\nfor j in range(n):\r\n x = int(input())\r\n if x in list:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "\r\n\r\npols = []\r\n\r\nfor i in range(3, 1000):\r\n\tans = ((i-2) * 180) / i\r\n\tif int(ans * 10) % 10 == 0 and int(ans100)%10 == 0 and int(ans1000)%10 == 0:\r\n\t\tpols.append(int(ans))\r\n\r\n#print(pols)\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n\ta = int(input())\r\n\t\r\n\tif a in pols:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\n", "t=int(input())\r\nfor i in range(1,t+1):\r\n a=int(input())\r\n n=360/(180-a)\r\n if n==int(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nb=[]\r\nk=1\r\nwhile 1<=k<361:\r\n k=k+1\r\n a=180-360/k\r\n if a==int(a):\r\n b.append(a)\r\nwhile n >0:\r\n n=n-1\r\n m=int(input())\r\n if m in b:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n ", "n=int(input())\r\nfor _ in range(n):\r\n a=int(input())\r\n if a==180:\r\n print('NO')\r\n else:\r\n k=360/(180-a)\r\n print('YES') if int(k)==k and k>0 else print('NO')", "#yousef\r\nfrom sys import stdin ,stdout \r\ninput=stdin.readline \r\ninp = lambda : map(int,input().split())\r\ndef print(args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\nfor i in range(int(input())):\r\n a=int(input())\r\n if 360%(180-a)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\npossible_angles = {120: 0, 90: 0, 72: 0, 60: 0, 45: 0, 40: 0,\r\n 36: 0, 30: 0, 24: 0, 20: 0, 18: 0, 15: 0,\r\n 12: 0, 10: 0, 9: 0, 8: 0, 6: 0, 5: 0,\r\n 4: 0, 3: 0, 2: 0, 1: 0}\r\nfor i in range(0, t):\r\n angle = int(input())\r\n if (180 - angle) in possible_angles:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n# 化院荆屹然 2300011884\r\n", "import math\r\nfor _ in range(int(input())):\r\n s=int(input())\r\n k=math.ceil(360/(180-s))\r\n l=math.floor(360/(180-s))\r\n if k!=l:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "\"\"\"\r\nCreated on Oct.10 2023\r\n@author: 施广熠 2300012143\r\n\"\"\"\r\nn=int(input())\r\nfor i in range(n):\r\n t=int(input())\r\n for i in range(3,361):\r\n if 360%i!=0:\r\n continue\r\n else:\r\n if 180-360//i==t:\r\n print(\"YES\")\r\n break\r\n if i==360:\r\n print(\"NO\")", "\r\nn = int(input())\r\n\r\ndef is_polygon(a):\r\n n = 360 / (180 - a)\r\n x = str(n)\r\n if x[-1] == \"0\":\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\n\r\nfor i in range(0, n): \r\n a = int(input())\r\n print(is_polygon(a))\r\n", "n=int(input())\r\ndef myfuc(t):\r\n if 360%(180-t) ==0 and t >=60:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n return\r\nfor _ in range(n):\r\n myfuc(int(input()))", "for _ in range(int(input())):\n print('YES' if 360 % (180 - (int(input()))) == 0 else 'NO')\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 11 16:51:30 2022\r\n\r\n@author: 帝落梦魂\r\n\"\"\"\r\n\r\nt = int(input())\r\nfor i in range(0,t):\r\n a = int(input())\r\n if 360%(180-a)==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "answer = []\r\ntest = []\r\ntests = int(input())\r\nfor i in range(tests):\r\n a = int(input())\r\n test.append(a)\r\nfix = []\r\nfor i in range(len(test)):\r\n fix.append(test[i])\r\n test[i] -= 180\r\n test[i] = 360 / test[i]\r\n if test[i]%1 == 0 and fix[i] >= 60:\r\n answer.append(\"YES\")\r\n else:\r\n answer.append(\"NO\")\r\nfor i in range(len(answer)):\r\n print(answer[i])", "n=int(input())\r\nfor i in range(n):\r\n m=int(input())\r\n x=180-m\r\n a=360/x\r\n if(int(a)==a):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def calculate_side(angle):\r\n side = 360/(180-angle)\r\n return side\r\nt = int(input())\r\nfor i in range(t):\r\n a = 0\r\n angle = int(input())\r\n if(calculate_side(angle).is_integer()):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nwhile (t > 0):\r\n a = int(input())\r\n if (360 % (180 - a) == 0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n t = t - 1", "n=int(input())\nans=[]\nfor i in range(n):\n m=int(input())\n if 360%(180-m)!=0:\n ans.append(\"NO\")\n else:\n ans.append(\"YES\")\nfor i in ans:\n print(i)", "n = int(input())\r\nfor _ in range(n):\r\n a = int(input())\r\n exterior = 180 - a\r\n if exterior <= 0 or 360 % exterior != 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n if (360/(180-a))%1==0 and (360/(180-a))>=3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def main():\r\n tc = int(input())\r\n for _ in range(tc):\r\n a = int(input())\r\n if a == 180:\r\n print(\"NO\")\r\n elif 360 % (180 - a) > 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "angle=[]\r\nfor i in range(1,361):\r\n if 360%i==0:\r\n angle.append((i-2)180/i)\r\nn=int(input())\r\nfor i in range(n):\r\n if int(input()) in angle:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n if float(360//(180-a)) == float(360/(180-a)) :\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n x = int(input())\r\n tmp = 360/(180-x)\r\n if tmp == int(tmp):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\nfor _ in range(n):\r\n angle = int(input())\r\n num = 0\r\n for i in range(1,int(2/(1-angle/180))+2):\r\n if 180 * (i - 2) == angle * i:\r\n print('YES')\r\n num += 1\r\n break\r\n if num == 0:\r\n print('NO')\r\n#compiled by 陈睿阳 2300011406", "t=input()\r\nwhile True:\r\n try:\r\n a=int(input())\r\n b=360/(180-a)\r\n if b==int(b) and b>2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n except EOFError:\r\n break", "t=int(input())\r\ns=[]\r\nfor i in range(t):\r\n a=int(input())\r\n s.append(a)\r\nfor i in range(len(s)):\r\n if 360%(180-s[i])==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# Link: https://codeforces.com/contest/270/problem/A\n\nnumber_of_tests = int(input())\n\nfor _ in range(number_of_tests):\n internal_angle = int(input())\n external_angle = 180 - internal_angle\n number_of_angles = 360 / external_angle\n \n print(\"YES\" if number_of_angles == int(number_of_angles) else \"NO\") ", "for _ in range(int(input())):\r\n t=360%(180-int(input()))==0\r\n print(\"YES\"t+\"NO\"(1-t))\r\n", "angleList=[]\r\nfor i in range(3,361):\r\n if 360%i==0:\r\n angleList.append(int(180-360/i))\r\n\r\nfenceSum=int(input())\r\nfor i in range(fenceSum):\r\n angle=int(input())\r\n print(\"YES\" if angle in angleList else \"NO\")", "n=int(input())\r\nfor i in range(n):\r\n alpha=int(input())\r\n number=360/(180-alpha)\r\n if number % 1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\r\nimport bisect\r\n \r\n \r\ndef sol():\r\n _=int(input())\r\n for aditya in range(_):\r\n i=int(input())\r\n if i==180:\r\n print(\"NO\")\r\n continue\r\n pans=360/(180-i)\r\n \r\n if pans==int(pans) and int(pans)>2:\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\nsol()\r\n", "\r\n\r\ndef solve():\r\n angle = int(input())\r\n ans = 360 / (180 - angle)\r\n return ans == (360 // (180 - angle))\r\n\r\ndef main():\r\n t = int(input())\r\n for _ in range(t):\r\n ret = solve()\r\n ans = \"YES\" if ret else \"NO\"\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()", "import sys\r\n\r\ndef read_chars():\r\n return list(sys.stdin.readline().split())\r\n\r\ndef read_inline_ints():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\ndef read_multiline_ints():\r\n return list(map(int, sys.stdin.readlines()))\r\n\r\n# solution code below\r\n\r\nt, angles = read_multiline_ints()\r\n\r\n# inner angle of a regular polygon of n sides is \r\n# 180 (n - 2) / n = 180 - 360 / n (n >= 3)\r\n\r\nyes, no = \"YES\", \"NO\"\r\nfor a in angles:\r\n if 360 % (180 - a) == 0:\r\n print(yes)\r\n else:\r\n print(no)", "for _ in range(int(input())):\r\n angel = int(input())\r\n if 360 % (180 - angel) == 0:\r\n print('YES')\r\n else:\r\n print(\"NO\")\r\n", "\r\n\r\n\r\ndef fancy_fence():\r\n \r\n num_test_cases =int(input())\r\n\r\n\r\n for _ in range(num_test_cases):\r\n\r\n angle = int(input())\r\n\r\n \r\n n = 180 - angle\r\n print('YES' if 360 % n == 0 else 'NO')\r\n\r\n\r\nfancy_fence()\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Sep 29 14:04:37 2021\r\n\r\n@author: wlt52\r\n\"\"\"\r\n\r\n\r\na = int(input())\r\nz = []\r\n\r\nfor j in range(a):\r\n b = int(input())\r\n \r\n i = 3\r\n while 1:\r\n angle = 180(i-2)/i\r\n if b == angle:\r\n z.append('YES')\r\n break\r\n elif angle > b:\r\n z.append('NO')\r\n break\r\n i += 1\r\n\r\nfor x in z:\r\n print(x)", "\r\nt = int(input())\r\nfor _ in range(t):\r\n indAngle = int(input())\r\n n = 3\r\n result = \"NO\"\r\n while(True):\r\n totalSum = (n - 2) 180\r\n if totalSum / n == indAngle:\r\n result = \"YES\"\r\n break\r\n elif totalSum > indAngle * n:\r\n break\r\n n += 1\r\n print(result)\r\n", "angelList=[]\r\nfor i in range(3,361):\r\n if 360%i==0:\r\n angelList.append(int(180-360/i))\r\n\r\nfenceSum=int(input())\r\nfor i in range(fenceSum):\r\n angel=int(input())\r\n if angel in angelList:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a = []\r\nfor n in range(3, 3000):\r\n q = ((n - 2) * 180) / n\r\n if q not in a:\r\n a.append(q)\r\nn = int(input())\r\nfor i in range(n):\r\n if int(input()) in a:\r\n print('YES')\r\n else:\r\n print('NO')", "'''input\r\n3\r\n30\r\n60\r\n90\r\n'''\r\nangles = [60, 90, 108, 120, 135, 140, 144, 150, 156, 160, 162, 165, 168, 170, 171, 172, 174, 175, 176, 177, 178, 179]\r\nn = int(input())\r\nfor _ in range(n):\r\n\tangle = int(input())\r\n\tif angle in angles:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "h=int(input())\r\nwhile h:\r\n h-=1\r\n x=int(input())\r\n N=2(1/((180-x)/180))\r\n print(\"YES\" if N==int(N) else \"NO\")", "for _ in range(int(input())):\r\n n = int(input())\r\n x = 360/(180 - n) \r\n if str(x)[-1] == '0':\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "k = int(input())\nfor _ in range(0, k):\n a = int(input())\n if (360 % (180 - a) == 0):\n print(\"YES\")\n else:\n print(\"NO\")\n\n\t \t \t\t \t\t\t\t\t\t\t\t \t \t\t", "angle=[]\r\nfor i in range(3,361):\r\n if 360%i==0:\r\n angle.append(180-360//i) \r\nt=int(input())\r\nfor ii in range(t):\r\n a=int(input())\r\n if a in angle:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n", "q = int(input())\r\n\r\nwhile q:\r\n q -= 1\r\n a = int(input())\r\n print('NO' if 360 % (180-a) else 'YES')\r\n", "n = int(input())\r\nfor _ in range(n):\r\n a = int(input())\r\n if a < 60 or a >= 180:\r\n print('NO')\r\n else:\r\n print(['NO', 'YES'][360 % (180 - a) == 0])", "ls = []\r\nfor i in range(1000):\r\n t = 180 i\r\n tm = 180 * i // (i+2)\r\n if 180 i % (i+2) == 0:\r\n ls.append(tm)\r\n if tm == 179:\r\n break\r\n\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n print(\"YES\" if n in ls[1:] else \"NO\")", "for _ in range(int(input())): print([\"YES\",\"NO\"][360 % (180-int(input()))!=0])\r\n\r\n \r\n", "for i in range(int(input())):\r\n a = int(input())\r\n\r\n n = 360/(180 - a)\r\n\r\n print('YES' if int(n) == n else 'NO')", "def can_build_fence(a):\r\n if 360 % (180 - a) == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nt = int(input(\"\"))\r\nfor _ in range(t):\r\n a = int(input(\"\"))\r\n result = can_build_fence(a)\r\n print(result)", "n = int(input())\r\nfor i in range(1, n + 1):\r\n x=int(input())\r\n if 360%(180-x)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\n\r\nfor i in range(t):\r\n angle = int(input())\r\n \r\n sides = 360/(180-angle)\r\n \r\n if sides - int(sides) == 0: \r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\npossible_degrees = [60,90,108,120,135,140,144,150,156,160,162,165,168,170,171,172,174,175,176,177,178,179]\r\nwhile t > 0:\r\n\tdegree = int(input())\r\n\tif degree in possible_degrees:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\tt = t - 1\r\n\t", "from sys import stdin\r\n\r\n\r\ndef readint():\r\n return int(stdin.readline())\r\n\r\n\r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readmatrix(n):\r\n M = []\r\n for _ in range(n):\r\n row = readarray(int)\r\n assert len(row) == n\r\n M.append(row)\r\n return M\r\n\r\n\r\ndef solve():\r\n angle = readint()\r\n if 360 % (180 - angle) == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n T = readint()\r\n for _ in range(T):\r\n solve()\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Oct 6 20:35:04 2021\r\n\r\n@author: pena\r\n\"\"\"\r\n\r\nt = int(input())\r\n\r\nfor i in range(t):\r\n angle = int(input())\r\n if ((-360)/(angle-180))%1 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# Fancy Fence Difficulty:1100\r\nt = int(input())\r\nlst = []\r\nfor i in range(t):\r\n a = int(input())\r\n lst.append(a)\r\nfor j in range(t):\r\n a = lst[j]\r\n n = 2/(1-a/180)\r\n if abs(n-round(n)) < 0.000001:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nfor i in range (n):\r\n m=int(input())\r\n if (360%(180-m)==0):\r\n print('YES')\r\n else:\r\n print('NO')", "for s in [open(0)][1:]:\n a = int(s)\n if 360%(180-a) == 0:\n print(\"YES\")\n else:\n print(\"NO\")", "t = int(input())\nwhile(t):\n angle = int(input())\n if (360 / (180 - angle)) % 1 == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n t -= 1", "def main():\n \n for _ in range (int(input())):\n \n n = 360 / (180 - int(input()))\n if n == int(n):\n print(\"YES\")\n else:\n print(\"NO\")\n \nif __name__ == '__main__':\n main()\n \t \t \t\t\t\t\t \t \t \t \t\t\t", "\r\nb = []\r\nfor i in range(3,10000):\r\n a = ((i-2)180)/i\r\n a = round(a,2)\r\n b.append(a)\r\ny = int(input())\r\nfor i in range(y):\r\n z = float(input())\r\n if z in b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nfor _ in range(int(input())):\r\n angle = int(input())\r\n if angle >= 60 and 360 % (180 - angle) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "t=int(input())\r\nlst=[178,179]\r\nfor j in range(3,180):\r\n x=(180(j-2)/j)\r\n if x==int(x):\r\n lst.append(int(x))\r\nfor i in range(t):\r\n a=int(input())\r\n if a in lst:\r\n print('YES')\r\n else:\r\n print('NO')", "import math\r\nn=int(input())\r\nseq=[]\r\nfor i in range(n):\r\n seq.append(int(input()))\r\nfor i in seq:\r\n print(\"YES\") if math.isclose(360/(180-i), round(360/(180-i)),abs_tol=0.001) else print(\"NO\")", "\r\nimport sys\r\nimport pprint\r\nimport logging\r\nfrom logging import getLogger\r\n\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\nlogging.basicConfig(format=\"%(message)s\", level=logging.WARNING,)\r\nlogger = getLogger(__name__)\r\nlogger.setLevel(logging.INFO)\r\n\r\n\r\ndef debug(msg, args):\r\n logger.info(f'{msg}={pprint.pformat(args)}')\r\n\r\n# 30 MINUTES ATLEAST !!!!\r\n\r\n###################################################################################################################\r\n\r\n# let's do this by recursion\r\n\r\n\r\ndef printPattern(t, n):\r\n if t == n + 1:\r\n return\r\n\r\n for i in range(n - t):\r\n print(' ', end=' ')\r\n\r\n for i in range(t + 1):\r\n print(i, end=' ')\r\n\r\n for i in range(t - 1, 0, -1):\r\n print(i, end=' ')\r\n\r\n print(0)\r\n\r\n printPattern(t + 1, n)\r\n\r\n if t == n:\r\n return\r\n for i in range(n - t):\r\n print(' ', end=' ')\r\n\r\n for i in range(t + 1):\r\n print(i, end=' ')\r\n\r\n for i in range(t - 1, 0, -1):\r\n print(i, end=' ')\r\n\r\n print(0)\r\n\r\n\r\ndef single():\r\n return map(int, input().split())\r\n\r\n\r\ndef t():\r\n for _ in range(int(input())):\r\n print('YES' if 360 % (180 - int(input())) == 0 else 'NO')\r\n\r\n\r\nt()\r\n", "# Link: https://codeforces.com/contest/270/problem/A\n\nnumber_of_tests = int(input())\n\nfor _ in range(number_of_tests):\n internal_angle = int(input())\n external_angle = 180 - internal_angle\n number_of_angles = 360 / external_angle\n \n if number_of_angles.is_integer():\n print(\"YES\")\n else:\n print(\"NO\")\n \n pass", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\ns=set()\r\nfor i in range(175,181):\r\n\ts.add(i)\r\nc=3\r\nn=1\r\ncnt=0\r\nwhile True:\r\n\tans=(180(n))/c\r\n\tif ans<=174:\r\n\t\tif ans==int(ans):\r\n\t\t\ts.add(ans)\r\n\telse:\r\n\t\tbreak\r\n\tn+=1\r\n\tc+=1\r\nfor i in range(int(input())):\r\n\tq=int(input())\r\n\tif q in s:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "for _ in range(int(input())):\r\n a=int(input())\r\n c=a\r\n b=180\r\n book=0\r\n for i in range(a,0,-1):\r\n if a%i==0 and b%i==0:\r\n a//=i\r\n b//=i\r\n for i in range(1,c):\r\n if ai==(bi-2):\r\n book=1\r\n print(\"YES\")\r\n break\r\n if book==0:\r\n print(\"NO\")", "def solve(a):\r\n if a < 60:\r\n return \"NO\"\r\n if 360 % (180 - a) == 0:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\n\r\ndef main():\r\n t = int(input())\r\n for i in range(t):\r\n a = int(input())\r\n print(solve(a))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n m=int(input())\r\n num1=360/(180-m)\r\n num2=360//(180-m)\r\n if num1==num2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n", "for _ in range(int(input())):\n print(\"NO\" if 360 % (180 - int(input())) else \"YES\")\n", "t = int(input())\r\n\r\ndef factors():\r\n possibleofn = {}\r\n for i in range(3,181):\r\n if 180(i-2)/i % 1 == 0:\r\n possibleofn[i] = int(180(i-2)/i)\r\n possibleofn[360] = 179\r\n return possibleofn\r\n\r\nfor i in range(t):\r\n angle = int(input())\r\n if angle not in factors().values():\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "for _ in range(int(input())):\r\n n = int(input())\r\n print(['NO', 'YES'][(360/(180-n)).is_integer() and n<180])", "for _ in range(int(input())):\r\n a = int(input()) # exterior angle\r\n interor_angle = 180 - a\r\n if 360 % interor_angle == 0 and 360 // interor_angle >= 3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "t = int(input())\r\nfor _ in range(0,t):\r\n\ta = int(input())\r\n\r\n\tsides = 360/(180 - a)\r\n\r\n\tif sides == int(sides):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Sep 13 13:41:09 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n ans = False\r\n for n in range(3,361):\r\n if 360 % n == 0 and a == 180 - 360 // n:\r\n ans = True\r\n break\r\n if ans: print(\"YES\")\r\n else: print(\"NO\")", "k = 3\r\nvalid = []\r\nfor i in range(1, 1000):\r\n x = i * 180\r\n if x / k == x // k:\r\n valid.append(x//k)\r\n k += 1\r\n\r\nfor i in range(int(input())):\r\n if int(input()) in valid:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n a = int(input())\r\n ans = 360 / (180 - a)\r\n if ans == int(ans):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n \r\n if a>=180:\r\n print(\"NO\")\r\n continue;\r\n n = 360/(180-a)\r\n \r\n if n%int(n)==0 and a<180 :\r\n print(\"YES\")\r\n continue;\r\n else:\r\n print(\"NO\")\r\n continue;\r\n \r\n ", "a=int(input())\r\nlist=[]\r\nwhile a!=0:\r\n b=int(input())\r\n if 360%(180-b)!=0:\r\n list.append(\"NO\")\r\n else:\r\n list.append(\"YES\")\r\n a=a-1\r\nfor i in list:\r\n print(i)", "turn = int(input())\r\nexample = [180(n-2)/n for n in range(3, 361)]\r\n\r\nfor i in range(turn):\r\n a = int(input())\r\n if a in example:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "'''\r\n2300015897\r\n吴杰稀\r\n光华管理学院\r\n'''\r\ncases = int(input())\r\nfor i in range(cases):\r\n angle = int(input())\r\n t = 180 - angle\r\n if 360 % t == 0 and 360 // t >= 3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for _ in range(int(input())):\n a = int(input())\n print(\"YES\") if 360%(180-a)==0 else print(\"NO\")", "def solve():\r\n a = int(input())\r\n return 360 % (180 - a) == 0 and 360 // (180 - a) >= 3\r\n\r\nfor _ in range(int(input())):\r\n print(\"YES\" if solve() else \"NO\")\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Fri Apr 7 00:54:05 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nt=int(input())\r\nres=[]\r\nfor i in range(t):\r\n a=int(input())\r\n x=360/(180-a)\r\n if x==int(x):\r\n res.append(\"YES\")\r\n else:\r\n res.append(\"NO\")\r\n \r\n[print(r) for r in res]\r\n ", "def polycheck(n):\r\n if n==180:\r\n return False\r\n if 360/(180-n)==int(360/(180-n)):\r\n return True\r\n return False\r\nn=int(input())\r\nresult=[]\r\nfor i in range(n):\r\n x=int(input())\r\n if polycheck(x):\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\nfor res in result:\r\n print(res)", "n = int(input())\r\nans = n [0]\r\nfor i in range(n):\r\n m = int(input())\r\n if (360 % (180 - m) == 0):\r\n ans[i] = 1\r\n else:\r\n continue\r\nfor i in range(n):\r\n if ans[i] == 1:\r\n print('YES')\r\n else:\r\n print('NO')", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 18 16:00:10 2022\r\n\r\n@author: hp\r\n\"\"\"\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n x = int(input())\r\n if 360 % (180 - x) == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "t = int(input())\r\nwhile t>0:\r\n n= int(input())\r\n check = False\r\n for i in range(3, 361):\r\n if ni == (i-2)180:\r\n print(\"YES\")\r\n check = True\r\n break\r\n if check == False:\r\n print(\"NO\")\r\n t-=1", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n if a>=30 and a<180:\r\n thet = 180-a\r\n if 360%thet==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Oct 16 15:30:39 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\nt=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n n=360//(180-a)\r\n if an==(n-2)180:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\nfor i in range(t):\r\n def angle(a):\r\n if 360%(180-a)==0:\r\n return'YES'\r\n else:\r\n return'NO'\r\n a = int(input())\r\n print(angle(a))", "def main() -> None:\r\n n = int(input())\r\n\r\n for _ in range(n):\r\n t = int(input())\r\n\r\n n = 360 / (180 - t)\r\n print(\"YES\" if n.is_integer() else \"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def FindAngle(s):\r\n return ((s - 2) * 180) / s\r\nt = int(input())\r\nfor i in range(t):\r\n angle = int(input())\r\n sides = 3\r\n while FindAngle(sides) < angle:\r\n sides += 1\r\n print(\"YES\" if FindAngle(sides) == angle else \"NO\")", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Sat Oct 14 18:41:22 2023\r\n\r\n@author: HXY\r\n\"\"\"\r\n\r\nt = int(input()) \r\n\r\nfor _ in range(t):\r\n a = int(input()) \r\n\r\n n = 360 // (180 - a) \r\n\r\n if n >= 3 and 360 % (180 - a) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nfor _ in range(t):\r\n\tn = int(input())\r\n\tprint('NO' if 360%(180-n) else 'YES')", "import math\nn = int(input())\nangs= []\n\nfor i in range(n):\n angs.append(int(input()))\n\n\nfor ang in angs:\n print('YES') if 360%(180-ang) ==0 else print('NO')\n", "a=int(input());fo=[]\r\nfor i in range(a):\r\n b=int(input())\r\n c=360//(180-b)\r\n if c(180-b) == 360:\r\n fo.append('YES')\r\n else:\r\n fo.append('NO')\r\nprint('\\n'.join(fo))", "num_tests = int(input())\r\nfor i in range(num_tests):\r\n angle = 180-int(input())\r\n if angle <= 120 and angle > 0 and 360%angle==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\nfor _ in range(n):\r\n print('NO' if 360 % (180-int(input())) else 'YES')", "import math\r\nT = int(input())\r\nfor i in range(T):\r\n num = int(input())\r\n num = 180 - num\r\n if 360 % num == 0:\r\n print(\"YES\", end = '\\n')\r\n else:\r\n print(\"NO\", end = '\\n')", "t = int(input())\nfor _ in range(t):\n angle = int(input())\n sides = 3\n sol = 'NO'\n while (sides-2)180 / sides <=angle :\n if (sides-2) 180/ sides == angle :\n sol = 'YES'\n break\n sides +=1\n print(sol)\n", "def solve():\r\n a = int(input())\r\n for n in range(2, 1000):\r\n if 180 (n - 2) == a * n:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n solve()\r\n", "for i in range(int(input())):\r\n print(\"YNEOS\"[(360 % (180- int(input())) != 0)::2])", "for i in range(int(input())):\r\n print((\"YES\",\"NO\")[360/(180-int(input()))10%10>0])", "n = int(input())\r\n\r\nfor _ in range(n):\r\n a = int(input())\r\n if a >= 180:\r\n print('NO')\r\n continue\r\n sides = 360/(180-a)\r\n if sides == int(sides):\r\n print('YES')\r\n else:\r\n print('NO')", "if __name__ == \"__main__\":\r\n n = int(input())\r\n\r\n for x in range(n):\r\n print(\"YNEOS\"[360 % (180 - int(input())) > 0::2])\r\n", "i = int(input())\r\nfor j in range(i):\r\n t = int(input())\r\n n = 360.0/(180.0-t)\r\n if n == int(n) and n>=3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nfor i in range(n):\r\n an=int(input())\r\n n=(2180)/(180-an)\r\n if n%1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# Compiled by Zhou Tian 2300011538 from School of Physics PKU\r\n\r\na = int(input())\r\nc = []\r\n\r\nfor i in range(a):\r\n b = 180-int(input())\r\n if 360 % b == 0:\r\n c.append('YES')\r\n else:\r\n c.append('NO')\r\n \r\nfor i in c:\r\n print(i)", "t = int(input())\r\n\r\nfor _ in range(t):\r\n a = int(input())\r\n ans = 'YES' if 360%(180-a)==0 else 'NO'\r\n print(ans)", "t=int(input())\r\nwhile t>0:\r\n n=int(input())\r\n if 360%(180-n)==0:print('YES')\r\n else:print('NO')\r\n t-=1", "for _ in range(int(input())):\r\n a = int(input())\r\n i = 3\r\n ans = False\r\n a_i = (i - 2) * 180 / i\r\n while a_i <= a + 1:\r\n if a_i == a:\r\n ans = True\r\n break\r\n else:\r\n i += 1\r\n a_i = (i - 2) * 180 / i\r\n if ans == True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n ", "from sys import stdin\n\nstream = None\ntry:\n stream = open('file.txt', 'r')\nexcept:\n stream = stdin\n\nn = int(stream.readline())\n\n\ndef angle_number(angle):\n number = 360 / (180 - angle)\n return int(number) == number\n\n\nfor i in range(n):\n angle = int(stream.readline())\n if angle_number(angle):\n print(\"YES\")\n else:\n print(\"NO\")\n", "t=int(input())\r\nwhile t:\r\n t-=1\r\n a=int(input())\r\n if (360/(180-a))%1==0:print(\"YES\")\r\n else:print(\"NO\")", "t = int(input())\r\nwhile t:\r\n t -= 1\r\n a = float(input())\r\n for n in range(3, 10000):\r\n d = (n-2) * 180 / n\r\n if d >= a:\r\n print('YES' if d==a else 'NO')\r\n break", "n = int(input())\r\narray = [0] * n\r\nfor i in range(n):\r\n array[i] = int(input())\r\n if array[i] == 180:\r\n print(\"NO\")\r\n continue\r\n if -360/(array[i] - 180) == int(-360/(array[i] - 180)):\r\n print(\"YES\")\r\n continue\r\n else:\r\n print(\"NO\")", "n = int(input())\nfor _ in range(n):\n a = int(input())\n a = 180 - a\n print([\"NO\",\"YES\"][360//a == 360/a])\n", "def main():\n n = int(input())\n\n regular_polygon = [180 * (i - 2) / i for i in range(3, 1000)]\n\n for _ in range(n):\n angle = int(input())\n if angle in regular_polygon:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n main()\n", "t = int(input())\nans = []\nret = 0\nfor i in range(t):\n a = int(input())\n if 360 % (180 - a) == 0:\n ans.append(\"YES\")\n else:\n ans.append(\"NO\")\nfor i in ans:\n print(i)\n\n", "times=int(input())\nfor i in range(times):\n n=int(input())\n m=360/(180-n)\n while m>1:\n m-=1\n if abs(m-1)<10*(-7):\n print(\"YES\")\n else:\n print(\"NO\")", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Sun Sep 24 20:34:24 2023\r\n\r\n@author: zinc 2300012115\r\n\"\"\"\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n alpha = int(input())\r\n if 360%(180-alpha) == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "ln = int(input())\r\n\r\n\r\nfor i in range(ln):\r\n z=int(input())\r\n n = 360/(180-z)\r\n if n%1 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "t = int(input())\r\nresult = ''\r\nfor test in range(t):\r\n a = int(input())\r\n for n in range(3, 361):\r\n if a/180 == (n-2)/n:\r\n result += \"YES\"+ \" \"\r\n break\r\n else:\r\n result += \"NO\" + \" \"\r\nresult = result.split(\" \")\r\nfor i in result:\r\n print(i)", "t=int(input())\r\nwhile t!=0:\r\n x=int(input())\r\n m=180-x\r\n if m>0:\r\n if 360%m == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n t=t-1\r\n\r\n", "for _ in range(int(input())):print(\"NO\"if 360%(180-int(input()))else\"YES\")", "def fancy_fence() -> None:\n t = int(input())\n while t:\n a = int(input())\n print(isImpossible(a))\n t -= 1\n\n\ndef isImpossible(a: int) -> str:\n def formula(a): return 360 % (180-a) == 0\n if(formula(a)):\n return 'YES'\n else:\n return 'NO'\n\n\nfancy_fence()\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Sun Oct 15 21:58:41 2023\r\n\r\n@author: 程卓 2300011733\r\n\"\"\"\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n angle = int(input())\r\n if 360 % (180-angle) == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "x = int(input())\r\nz = []\r\nfor i in range(x):\r\n y = int(input())\r\n z.append(y)\r\nfor j in z:\r\n if 360%(180-j) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a=[60,90, 108, 120,135, 140, 144, 150, 156, 160, 162, 165, 168, 170, 171, 172, 174, 175, 176, 177, 178, 179]\r\nn=int(input())\r\nfor i in range(n):\r\n b=int(input())\r\n if b in a:\r\n print('YES')\r\n else:print('NO')", "n=int(input())\r\nm=0\r\nwhile m<n:\r\n x=int(input())\r\n k=360/(180-x)\r\n alpha=int(k)-k\r\n if alpha==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n m+=1", "from bisect import bisect_right, bisect_left\r\nfrom math import inf, gcd, sqrt, ceil, log2\r\nfrom heapq import heappush, heappop\r\nfrom collections import defaultdict, Counter, deque\r\nfrom itertools import accumulate\r\nfrom functools import lru_cache\r\nfrom string import ascii_lowercase\r\nrvar = lambda: map(int, input().split())\r\nrarr = lambda: list(map(int, input().split()))\r\nrstr = lambda: input().strip()\r\nrint = lambda: int(input())\r\n\r\n'''Speed up input'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nfor _ in range(rint()):\r\n a = rint()\r\n\r\n '''\r\n n angle = 180 * (n - 2)\r\n n * angle = 180 * n - 360\r\n \r\n n * (180 - angle) = 360\r\n\r\n n = 360 / (180 - angle)\r\n \r\n \r\n '''\r\n\r\n if 360 % (180 - a) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n print(['YES','NO'][(2a/(a-180))%1!=0])\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Jul 25 17:53:50 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 67 - CF270-DIV2A\r\n\"\"\"\r\ncases = int(input())\r\nfor i in range(cases):\r\n angle = int(input())\r\n supp = 180-angle\r\n test = supp\r\n while test < 360:\r\n test += supp\r\n if test == 360:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n \r\n", "for _ in range(int(input())):\r\n\tif (360/(180-int(input()))).is_integer():\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\n", "t = int(input())\r\n\r\nfor x in range(0,t):\r\n a = 360/(180 - int(input()))\r\n if (a == int(a)) : print(\"YES\")\r\n else: print(\"NO\")", "for _ in range(int(input())):\r\n number = int(input())\r\n flag = True\r\n i = 3\r\n \r\n while flag:\r\n if ((i - 2) 180) / i == number:\r\n print('YES')\r\n flag = False\r\n elif ((i - 2) * 180) / i > number:\r\n print('NO')\r\n flag = False\r\n i += 1", "n=int(input())\r\np=[]\r\nfor x in range(1,n+1):\r\n a=180-int(input())\r\n if 360%a==0:\r\n p.append(\"YES\")\r\n else:\r\n p.append(\"NO\")\r\nfor x in range(0,n):\r\n print(p[x])\r\n\r\n ", "n = int(input())\r\nfor i in range(n):\r\n a = int(input())\r\n b = 360 / (180 - a)\r\n if b % 1 == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nfor _ in range(t):\r\n rec=int(input())\r\n if 360%(180-rec)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n# (180-rec)i==360\r\n# i=360/(180-rec)\r\n# ->\r\n# 360%(180-rec)==0", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n if n <60 or n > 180:\r\n print('NO')\r\n else:\r\n if 360/(180 - n) == 360 //(180-n):\r\n print('YES')\r\n else:\r\n print('NO')", "def solve():\r\n x = int(input())\r\n print('YES' if 360 % (180-x) == 0 else 'NO')\r\n\r\n\r\nt = int(input())\r\n# t = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "import sys\r\n\r\ndef is_polygon(theta: int) -> str:\r\n n: float = -360 / (theta - 180)\r\n if int(n) == n:\r\n return 'YES'\r\n return 'NO'\r\n\r\ndef main():\r\n read = sys.stdin.readline\r\n n = int(read())\r\n for x in range(n):\r\n theta = int(read())\r\n print(is_polygon(theta))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# Wadea #\r\n\r\nfor i in range(int(input())):\r\n n = int(input())\r\n if 360 % (180 - n):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "t = int(input())\r\nfor test in range(t):\r\n a = int(input())\r\n found = False\r\n for n in range(3, 361):\r\n if a/180 == (n-2)/n:\r\n found = True\r\n if found:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def check(n):\n\td=(360/(180-n))\n\tflag=0\n\tfor i in range(3,int(d)+1):\n\t\tif(i==d):\n\t\t\tflag=1\n\tif (flag==0):\n\t\treturn \"NO\"\n\telse:\n\t\treturn \"YES\"\nn=int(input())\nl=[]\nfor k in range(0,n):\n\ts=int(input())\n\tl.append(s)\nk=[]\t\nfor i in range(0,n):\n\tk.append(check(l[i]))\nfor t in k:\n\tprint(t)", "n1 = int(input())\r\nout = ''\r\nfor i1 in range(n1):\r\n n2 = int(input())\r\n for i in range(3, 1000):\r\n if in2 == (i - 2)180:\r\n out = 'YES'\r\n break\r\n else:\r\n out = \"NO\"\r\n print(out)", "def fancy_fence(a: int) -> str:\n\n if (a < 60):\n return 'NO'\n\n if (360 % (180 - a) == 0):\n return 'YES'\n\n return 'NO'\n\nangles = []\nt = int(input())\n\nfor i in range(t):\n a = int(input())\n angles.append(a)\n\nfor i in range(t):\n print(fancy_fence(angles[i]))\n\n \t \t \t \t \t\t\t \t\t \t\t", "for i in range(int(input())):\r\n x= int( input())\r\n y=180-x\r\n if 360/y%1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n b=360/(180-a)\r\n if b%1==0 and b>=3:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\nfor j in range(t):\r\n a = int(input())\r\n b = False\r\n for i in range(3, 400):\r\n if (180 i) - (a * i) - 360 == 0:\r\n b = True\r\n break\r\n else:\r\n continue\r\n print(\"YES\" if b else \"NO\")", "for i in range(int(input())):\r\n n=int(input())\r\n if n<60:\r\n print(\"NO\")\r\n else:\r\n if (360%(180-n))==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import sys\r\n\r\nn = int(input())\r\ncorners = sys.stdin.read().splitlines()\r\n\r\nfor i in range(n):\r\n a = int(corners[i])\r\n if 360 % (180 - a) > 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")# 1689883632.2007127", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n\tinp = int(input())\r\n\ts = 360/(180-inp)\r\n\tif(s/int(s)==1):\r\n\t\ta.append(\"YES\")\r\n\telse:\r\n\t\ta.append(\"NO\")\r\n\r\nfor i in range(n):\r\n\tprint(a[i])", "n = int(input())\r\ncount = 3\r\nfor i in range(0, n):\r\n x = int(input())\r\n if x < 60:\r\n print(\"NO\")\r\n else:\r\n while (xcount >= (count-2)180):\r\n if (xcount == (count-2)180):\r\n print(\"YES\")\r\n break\r\n count += 1\r\n else:\r\n print(\"NO\")\r\n count = 3", "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\nFILE=False\r\nif FILE:\r\n sys.stdin=open('input.txt','r')\r\n sys.stdout=open('output.txt','w')\r\n\r\nt=get_int()\r\nfor i in range(t):\r\n angle=get_int()\r\n sides=-2180/(angle-180)\r\n if (sides-math.floor(sides)==0):\r\n sys.stdout.write(\"YES\\n\")\r\n else:\r\n sys.stdout.write(\"NO\\n\") \r\n\r\n#for item in answer:\r\n#\tsys.stdout.write(item)\r\n#\tsys.stdout.write('\\n')", "t = int(input())\r\nfor _ in range(t):\r\n v = int(input())\r\n m = 360/(180-v)\r\n if m == int(m):\r\n print('YES')\r\n else:\r\n print('NO') ", "test = int(input())\r\nfor _ in range(test):\r\n a = float(input())\r\n n = 2\r\n ans = \"NO\"\r\n while n > 0:\r\n angle = (180n - 360)/n\r\n if a == angle:\r\n ans = \"YES\"\r\n break\r\n\r\n n += 1\r\n\r\n if angle > a:\r\n break\r\n\r\n print(ans)" ]	{"inputs": ["3\n30\n60\n90", "6\n1\n2\n3\n170\n179\n25"], "outputs": ["NO\nYES\nYES", "NO\nNO\nNO\nYES\nYES\nNO"]}	UNKNOWN	PYTHON3	CODEFORCES	625
8e719483e5e5418e54575f188ffb7458	Holes	Little Petya likes to play a lot. Most of all he likes to play a game «Holes». This is a game for one person with following rules: There are N holes located in a single row and numbered from left to right with numbers from 1 to N. Each hole has it's own power (hole number i has the power ai). If you throw a ball into hole i it will immediately jump to hole i<=+<=ai, then it will jump out of it and so on. If there is no hole with such number, the ball will just jump out of the row. On each of the M moves the player can perform one of two actions: - Set the power of the hole a to value b. - Throw a ball into the hole a and count the number of jumps of a ball before it jump out of the row and also write down the number of the hole from which it jumped out just before leaving the row. Petya is not good at math, so, as you have already guessed, you are to perform all computations. The first line contains two integers N and M (1<=≤<=N<=≤<=105, 1<=≤<=M<=≤<=105) — the number of holes in a row and the number of moves. The second line contains N positive integers not exceeding N — initial values of holes power. The following M lines describe moves made by Petya. Each of these line can be one of the two types: - 0 a b - 1 a For each move of the type 1 output two space-separated numbers on a separate line — the number of the last hole the ball visited before leaving the row and the number of jumps it made. Sample Input 8 5 1 1 1 1 1 2 8 2 1 1 0 1 3 1 1 0 3 4 1 2 Sample Output 8 7 8 5 7 3	[ "import sys\nn, m = map(int, sys.stdin.buffer.readline().strip().split())\nbs = 9\na = list(map(int, sys.stdin.buffer.readline().strip().split()))\nrn = [0] * n\nrc = [0] * n\ndef gn(i):\n ni = i + a[i]\n if ni >= n:\n rn[i], rc[i] = i, 0\n elif ni >> bs == i >> bs:\n rn[i], rc[i] = rn[ni], rc[ni] + 1\n else:\n rn[i], rc[i] = ni, 1\nfor i in range(n - 1, -1, -1):\n gn(i)\nfor _ in range(m):\n l = list(map(int, sys.stdin.buffer.readline().strip().split()))\n if l[0] == 0:\n p = l[1] - 1\n a[p] = l[2]\n for i in range(p, (p >> bs << bs) - 1, -1):\n gn(i)\n else:\n p = l[1] - 1\n c = 0\n while rn[p] != p:\n c += rc[p]\n p = rn[p]\n print(p + 1, c + 1)", "import sys\r\n\r\ninput = sys.stdin.readline\r\nn, m = map(int, input().split())\r\np = list(map(int, input().split()))\r\nsize = 320\r\nblock = [i // size for i in range(n)]\r\npar, cnt = [0] * n, [0] * n\r\nfor i in range(n - 1, -1, -1):\r\n setelah = i + p[i]\r\n if setelah >= n:\r\n par[i] = i + n\r\n cnt[i] = 1\r\n elif block[setelah] == block[i]:\r\n par[i] = par[setelah]\r\n cnt[i] = cnt[setelah] + 1\r\n else:\r\n par[i] = setelah\r\n cnt[i] = 1\r\nans = []\r\nfor _ in range(m):\r\n s = input().strip()\r\n if s[0] == '0':\r\n Z, a, b = s.split()\r\n a = int(a) - 1\r\n b = int(b)\r\n p[a] = b\r\n i = a\r\n while i >= 0 and block[i] == block[a]:\r\n setelah = i + p[i]\r\n if setelah >= n:\r\n par[i] = i + n\r\n cnt[i] = 1\r\n elif block[i] == block[setelah]:\r\n par[i] = par[setelah]\r\n cnt[i] = cnt[setelah] + 1\r\n else:\r\n par[i] = setelah\r\n cnt[i] = 1\r\n i -= 1\r\n else:\r\n Z, a = s.split()\r\n a = int(a) - 1\r\n now = 0\r\n while a < n:\r\n now += cnt[a]\r\n a = par[a]\r\n ans.append(str(a - n + 1) + ' ' + str(now))\r\nprint('\\n'.join(ans))\r\n" ]	{"inputs": ["8 5\n1 1 1 1 1 2 8 2\n1 1\n0 1 3\n1 1\n0 3 4\n1 2", "10 10\n5 1 2 4 1 7 3 8 10 8\n0 5 6\n1 8\n1 1\n0 10 3\n1 5\n1 3\n1 2\n0 6 1\n1 9\n1 1"], "outputs": ["8 7\n8 5\n7 3", "8 1\n6 2\n5 1\n5 2\n5 3\n9 1\n10 4"]}	UNKNOWN	PYTHON3	CODEFORCES	2
8e83fc290467bbae2f2bbd15052cee39	Long number	Consider the following grammar: - <expression> ::= <term> \| <expression> '+' <term>- <term> ::= <number> \| <number> '-' <number> \| <number> '(' <expression> ')'- <number> ::= <pos_digit> \| <number> <digit>- <digit> ::= '0' \| <pos_digit>- <pos_digit> ::= '1' \| '2' \| '3' \| '4' \| '5' \| '6' \| '7' \| '8' \| '9' This grammar describes a number in decimal system using the following rules: - <number> describes itself,- <number>-<number> (l-r, l<=≤<=r) describes integer which is concatenation of all integers from l to r, written without leading zeros. For example, 8-11 describes 891011,- <number>(<expression>) describes integer which is concatenation of <number> copies of integer described by <expression>,- <expression>+<term> describes integer which is concatenation of integers described by <expression> and <term>. For example, 2(2-4+1)+2(2(17)) describes the integer 2341234117171717. You are given an expression in the given grammar. Print the integer described by it modulo 109<=+<=7. The only line contains a non-empty string at most 105 characters long which is valid according to the given grammar. In particular, it means that in terms l-r l<=≤<=r holds. Print single integer — the number described by the expression modulo 109<=+<=7. Sample Input 8-11 2(2-4+1)+2(2(17)) 1234-5678 1+2+3+4-5+6+7-9 Sample Output 891011 100783079 745428774 123456789	[ "# a ^ (P-1) ≡ 1 (mod P)\n# a ^ k ≡ (a % P) ^ (k % (P-1)) (mod P)\n\nimport sys\n\nsys.setrecursionlimit(105)\n\nMOD = 109 + 7\n\n\ndef inv(x):\n return pow(x, MOD - 2, MOD)\n\n\nclass Number:\n def __init__(self, value, length):\n self.value = value % MOD\n self.length = length % (MOD - 1)\n\n def __add__(self, other):\n value = self.value * pow(10, other.length, MOD) + other.value\n length = self.length + other.length\n return Number(value, length)\n\n def __mul__(self, other):\n base = pow(10, self.length, MOD)\n if base == 1:\n value = self.value * other\n else:\n value = self.value * (pow(base, other, MOD) - 1) * inv(base - 1)\n return Number(value, self.length * other)\n\n @classmethod\n def _range(cls, a, r, rpow, length):\n base = pow(10, length, MOD)\n u = pow(base, rpow, MOD) - 1\n v = inv(base - 1)\n return cls((a * u + u * v - r) * v, length * rpow)\n\n @classmethod\n def range(cls, a, b):\n a, b, la, lb = int(a), int(b) + 1, len(a), len(b)\n if la == lb:\n return cls._range(a, b - a, b - a, la)\n term = cls._range(a, p[la] - a, q[la] - a, la)\n for i in range(la + 1, lb):\n term += cls._range(p[i - 1], p[i] - p[i - 1], q[i] - q[i - 1], i)\n term += cls._range(p[lb - 1], b - p[lb - 1], b - q[lb - 1], lb)\n return term\n\n\ndef parse_term(start, stop):\n if s[stop - 1] == \")\":\n left = s.index(\"(\", start)\n return parse_expression(left + 1, stop - 1) * int(s[start:left])\n\n try:\n sep = s.index(\"-\", start, stop)\n except ValueError:\n return Number(int(s[start:stop]), stop - start)\n\n return Number.range(s[start:sep], s[sep + 1 : stop])\n\n\ndef parse_expression(start, stop):\n expression = Number(0, 0)\n i = start\n while i < stop:\n if s[i] == \"+\":\n expression += parse_term(start, i)\n start = i + 1\n i = right[i] if s[i] == \"(\" else i + 1\n expression += parse_term(start, i)\n return expression\n\n\ns = input()\nn = len(s)\n\np = [1]\nfor _ in range(n):\n p.append(p[-1] * 10 % MOD)\nq = [1]\nfor _ in range(n):\n q.append(q[-1] * 10 % (MOD - 1))\n\nright = [None] * n\nstack = []\nfor i, x in enumerate(s):\n if x == \"(\":\n stack.append(i)\n elif x == \")\":\n right[stack.pop()] = i\n\nprint(parse_expression(0, n).value)\n" ]	{"inputs": ["8-11", "2(2-4+1)+2(2(17))", "1234-5678", "1+2+3+4-5+6+7-9", "598777", "49603501749575096738857", "11-57", "7177-57797", "4510812433666-7741104736713", "4778066503(27032-80044+16+51+58(9)+5668114736297420472+2336+6-117+8495(7265))", "9678329648012859556810940272201-70370609657815505164700664074744+28870231062776633852(2098997519485)", "52(6(1)+100000000(2-10))+777(40000000(7-20)+876543)", "1(1000000005(5)+4)", "1-1", "10-10", "1+2", "9", "1(1)+1(1)"], "outputs": ["891011", "100783079", "745428774", "123456789", "598777", "586922407", "486296559", "110843609", "665706430", "865860620", "219564419", "133241273", "1000000006", "1", "10", "12", "9", "11"]}	UNKNOWN	PYTHON3	CODEFORCES	1
8e884a3f9a82d8283675daa517424cea	Buying A House	Zane the wizard had never loved anyone before, until he fell in love with a girl, whose name remains unknown to us. The girl lives in house m of a village. There are n houses in that village, lining in a straight line from left to right: house 1, house 2, ..., house n. The village is also well-structured: house i and house i<=+<=1 (1<=≤<=i<=<<=n) are exactly 10 meters away. In this village, some houses are occupied, and some are not. Indeed, unoccupied houses can be purchased. You will be given n integers a1,<=a2,<=...,<=an that denote the availability and the prices of the houses. If house i is occupied, and therefore cannot be bought, then ai equals 0. Otherwise, house i can be bought, and ai represents the money required to buy it, in dollars. As Zane has only k dollars to spare, it becomes a challenge for him to choose the house to purchase, so that he could live as near as possible to his crush. Help Zane determine the minimum distance from his crush's house to some house he can afford, to help him succeed in his love. The first line contains three integers n, m, and k (2<=≤<=n<=≤<=100, 1<=≤<=m<=≤<=n, 1<=≤<=k<=≤<=100) — the number of houses in the village, the house where the girl lives, and the amount of money Zane has (in dollars), respectively. The second line contains n integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=100) — denoting the availability and the prices of the houses. It is guaranteed that am<==<=0 and that it is possible to purchase some house with no more than k dollars. Print one integer — the minimum distance, in meters, from the house where the girl Zane likes lives to the house Zane can buy. Sample Input 5 1 20 0 27 32 21 19 7 3 50 62 0 0 0 99 33 22 10 5 100 1 0 1 0 0 0 0 0 1 1 Sample Output 403020	[ "n,k,d=map(int,input().split())\r\nk-=1\r\nz=list(map(int,input().split()))\r\ntable=[]\r\ni=0\r\nwhile(i<n):\r\n if(z[i]!=0 and z[i]<=d):\r\n table.append(abs(k-i)10)\r\n i+=1\r\nprint(min(table))\r\n \r\n", "n,m,k=map(int,input().split())\r\nm-=1\r\nl=[int(x) for x in input().split()]\r\nq=[]\r\nfor i in range(n):\r\n if l[i]!=0 and l[i]<=k:\r\n q.append((abs(i-m))10)\r\nprint(min(q))\r\n \r\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=a[:m-1]\r\nl=l[::-1]\r\nr=a[m:]\r\nind1=100000\r\nind2=100000\r\nif(m!=1):\r\n for i in range(0,len(l)):\r\n if(l[i]<=k and l[i]!=0):\r\n ind1=i\r\n ind1=len(l)-i-1\r\n break\r\nif(m!=n):\r\n for i in range(len(r)):\r\n if(r[i]!=0 and r[i]<=k):\r\n ind2=i+m\r\n #print(r[i])\r\n break\r\n#print(ind2)\r\nmini=min(abs(m-1-ind1),abs(m-1-ind2))\r\nprint(mini10)", "__author__ = \"Daniel Mitre\"\n\nn, m, k = map(int, input().split())\nprices = map(int, input().split())\n\ndef dist_to_girl(pos: int) -> int:\n\treturn abs(pos - m)\n\nbuy = float('inf')\nfor idx, price in zip(range(1, n + 1), prices):\n\tif (price > 0) and (price <= k) and (dist_to_girl(idx) < dist_to_girl(buy)):\n\t\tbuy = idx\n\nprint(dist_to_girl(buy) 10)\n\t\t\n \t\t \t \t\t \t\t \t\t\t\t \t\t \t \t\t", "n,m,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ncount=[]\r\nfor i in range(n):\r\n if(arr[i]!=0 and arr[i]<=k):\r\n count.append(abs(i-(m-1)))\r\nprint((min(count))10)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn,m,k=map(int,input().split())\r\nm-=1\r\nl=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n):\r\n\tif l[i]<=k and l[i]!=0:\r\n\t\tc.append((abs(i-m))10)\r\nprint(min(c))", "n, zane, money = map(int, input().split())\nhouses = [int(x) for x in input().split()]\n\n\n\ndef findHouseToBuy(n, zane, money):\n start = zane - 1\n end = zane - 1\n distance = 10\n \n while start > 0 and end < n - 1:\n start -= 1\n end += 1\n if houses[start] != 0 and houses[start] <= money or houses[end] != 0 and houses[end] <= money:\n return distance\n distance += 10\n\n while start > 0:\n start -= 1\n if houses[start] != 0 and houses[start] <= money:\n return distance\n distance += 10\n\n while end < n-1:\n end += 1\n if houses[end] != 0 and houses[end] <= money:\n return distance\n distance += 10\n\nprint(findHouseToBuy(n, zane, money))", "n, m, k = [int(i) for i in input().split()]\r\narr = [int(i) for i in input().split()]\r\nm -= 1\r\nres1 = 0\r\ntmp = 0\r\ni = m - 1\r\nwhile i >= 0:\r\n tmp += 1\r\n if arr[i] != 0 and arr[i] <= k:\r\n res1 = tmp\r\n break\r\n i -= 1\r\nres2 = 0\r\ni = m + 1\r\ntmp = 0\r\nwhile i <= len(arr) - 1:\r\n tmp += 1\r\n if arr[i] != 0 and arr[i] <= k:\r\n res2= tmp\r\n break\r\n i += 1\r\nif res1 == 0:\r\n res1 = 10000000\r\nif res2 == 0:\r\n res2 = 10000000\r\nprint((min(res1, res2)) * 10)\r\n", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nc = [] \r\nfor i in range(len(a)):\r\n if a[i]<=k and a[i]!=0:\r\n c.append(i)\r\np = []\r\nfor i in range(len(c)):\r\n p.append(abs(c[i]-m+1)10)\r\nprint(min(p))", "string = input()\r\nnumbers = string.split(\" \")\r\na = int(numbers[0])\r\nb = int(numbers[1])\r\nc = int(numbers[2])\r\nstring = input()\r\nnumbers = string.split(\" \")\r\nfor x in range(a):\r\n numbers[x] = int(numbers[x])\r\nhouses = []\r\nfor x in range(a):\r\n y = numbers[x]\r\n if y != 0 and y <= c:\r\n houses.append(abs(x + 1 - b))\r\nprint(min(houses) 10)", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.insert(0, 0)\r\nif m == 1:\r\n for i in range(m, len(a)):\r\n if (a[i] <= k) and (a[i] != 0):\r\n print((i - m) * 10)\r\n break\r\nelif m == n:\r\n for i in range(m, 0, -1):\r\n if (a[i] <= k) and (a[i] != 0):\r\n print((m - i) * 10)\r\n break\r\nelse:\r\n for i in range(m, len(a)):\r\n if (a[i] <= k) and (a[i] != 0):\r\n ans1 = (i - m) * 10\r\n break\r\n else:\r\n ans1 = float('inf')\r\n for i in range(m, 0, -1):\r\n if (a[i] <= k) and (a[i] != 0):\r\n ans2 = (m - i) * 10\r\n break\r\n else:\r\n ans2 = float('inf')\r\n print(min(ans1, ans2))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\na,b,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ni=b\r\nj=b-1\r\nyu=[]\r\n\r\nfor i in range(len(l)):\r\n\tif l[i]!=0 and l[i]<=c:\r\n\t\tyu.append(i)\r\nm=[]\r\nfor i in range(len(yu)):\r\n\tr=abs(b-yu[i]-1)\r\n\tm.append(r)\r\nprint(min(m)10)\r\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=n\r\nfor i in range(n):\r\n if a[i]!=0 and a[i]<=k:\r\n c=abs(m - (i+1))\r\n if c<b:\r\n b = c\r\nprint(b 10)", "def solution(l1,l2):\r\n n,m,k=l1[0],l1[1],l1[2]\r\n i=0\r\n while i<len(l2):\r\n if l2[i]>0 and l2[i]<=k:\r\n l2[i]=1\r\n else:\r\n l2[i]=0\r\n i+=1\r\n i=0\r\n d=[]\r\n #print(l2)\r\n while i<len(l2):\r\n if l2[i]>0: \r\n d.append(abs(m-1-i))\r\n i+=1\r\n ans=min(d)10\r\n return ans\r\n\r\n\r\n\r\n\r\ndef answer():\r\n l1= [int(x) for x in input().split()]\r\n l2 = [int(x) for x in input().split()]\r\n print(solution(l1,l2))\r\nanswer()", "# Buying A House\r\n\r\ndef search_for_distance_of_cheaper_affordable_house_near_crush(num_of_houses, crushes_house, amount_of_money, houses):\r\n to_left = crushes_house - 1\r\n to_right = crushes_house + 1\r\n counter = 0\r\n\r\n while to_right < num_of_houses or to_left >= 0:\r\n counter +=1\r\n distance = counter10\r\n\r\n if to_left >= 0:\r\n if houses[to_left] > 0 and amount_of_money >= houses[to_left]:\r\n return distance\r\n if to_right < num_of_houses:\r\n if houses[to_right] > 0 and amount_of_money >= houses[to_right]:\r\n return distance\r\n \r\n to_left -= 1\r\n to_right += 1\r\n\r\nif __name__ == '__main__':\r\n # lendo entradas\r\n\r\n first_input = input()\r\n f_inputs = first_input.split(' ')\r\n num_of_houses = int(f_inputs[0])\r\n crushes_house = int(f_inputs[1]) - 1\r\n amount_of_money = int(f_inputs[2])\r\n\r\n second_input = input()\r\n houses = []\r\n for s_input in second_input.split(' '):\r\n houses.append(int(s_input))\r\n\r\n dist = search_for_distance_of_cheaper_affordable_house_near_crush(num_of_houses, crushes_house, amount_of_money, houses)\r\n print(dist)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m, k = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\nans = 100 * n\r\nfor i in range(1, n + 1):\r\n if a[i] and a[i] <= k:\r\n ans = min(ans, 10 * abs(i - m))\r\nprint(ans)", "n,m,k = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nmins = 10*10\r\nfor i in range(len(A)):\r\n if i+1 != m and k >= A[i] and A[i] != 0:\r\n mins = min(abs(m-(i+1)), mins)\r\nprint(10mins)\r\n ", "n,m,k = [int(i) for i in input().split()]\r\nl = [int(i) for i in input().split()]\r\nt = 10*n\r\nfor i in range(m,n):\r\n\tif l[i] != 0 and k >= l[i] :\r\n\t\tt = (i-m+1)10\r\n\t\tbreak\r\nfor i in range(m-2,-1,-1):\r\n\tif l[i] != 0 and k >= l[i]:\r\n\t\tt = min(t,(m-i-1)10)\r\n\t\tbreak\r\nprint(t)\r\n\t\r\n", "# LUOGU_RID: 101671398\nn, m, k, a = map(int, open(0).read().split())\r\nprint(min(abs(m - i - 1) for i in range(n) if 1 <= a[i] <= k) * 10)", "n,m,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=[]\r\nfor i in range(n):\r\n if 0<l[i]<=d:\r\n k.append(abs((i+1)10-m10))\r\nprint(min(k))\r\n\r\n", "import math;\r\nn,m,k=map(int, input().split());\r\na = list(map(int, input().split()));\r\nm = m - 1;\r\nret = -1;\r\nmi = 100;\r\nfor i in range (0, n):\r\n if (a[i] > 0 and a[i] <= k and int(math.fabs(i - m)) < mi):\r\n mi = int(math.fabs(i - m));\r\nprint (mi * 10);", "n, m, k = [int(c) for c in input().split()]\r\nres = n * 10\r\nfor i, p in enumerate(int(c) for c in input().split()):\r\n d = abs(i + 1 - m) * 10\r\n if p <= k and p != 0 and d < res:\r\n res = d\r\n\r\nprint(res)\r\n", "n, m , k = map(int,input().split())\nl = [map(int,input().split())]\ntmp = {'Left':float('inf') , 'Right':float('inf')}\nCounter = 1\nfor i in range(m-2,-1,-1):\n if l[i]!=0 and l[i]<=k:\n tmp['Left'] = Counter\n break\n Counter+=1\nCounter = 1\nfor i in range(m,n):\n if l[i]!=0 and l[i]<=k:\n tmp['Right'] = Counter\n break\n Counter+=1\nprint(min(tmp['Left'],tmp['Right'])10)\n\n", "n=list(map(int, input().split()))\r\nx=n[0]\r\ny=n[0]\r\np=list(map(int, input().split()))\r\nfor i in range(n[1]-1, n[0]):\r\n if p[i]!=0 and p[i]<=n[2]:\r\n x=i-n[1]+1\r\n break\r\nfor i in range(n[1]-1,-1,-1):\r\n if p[i]!=0 and p[i]<=n[2]:\r\n y=n[1]-i-1\r\n break\r\nprint(min(x,y)10)", "n,m,k=input().split()\r\nn,m,k=int(n),int(m),int(k)\r\nl=list(map(int,input().split()))\r\nl2=[]\r\nfor i in range(n):\r\n\tif l[i]<=k and l[i]!=0:\r\n\t\tl2.append(abs(i-m+1)10)\r\nprint(min(l2))\r\n\r\n", "n,m,k=input().split()\nn,m,k=int(n),int(m),int(k)\nl=list(map(int,input().split()))\nl2=[]\nfor i in range(n):\n if l[i]<=k and l[i]!=0:\n l2.append(abs(i-m+1)10)\nprint(min(l2))", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nm -= 1\r\nINF = float('inf')\r\nR, L = INF, -INF\r\nfor i in range(m + 1, n):\r\n if a[i] == 0:\r\n continue\r\n if a[i] <= k:\r\n R = i\r\n break\r\n\r\nfor i in range(m - 1, -1, -1):\r\n if a[i] == 0:\r\n continue\r\n if a[i] <= k:\r\n L = i\r\n break\r\n\r\nprint(min(R - m, m - L) 10)", "n,m,k = map(int,input().split())\r\nliste = [int(x) for x in input().split()]\r\nliste2 =[]\r\nliste3 =[]\r\nfor loop in range(len(liste)):\r\n if liste[loop]<=k and liste[loop] !=0:\r\n liste2.append(loop)\r\nfor loop in range(len(liste2)):\r\n liste3.append(abs(((liste2[loop]+1))-m))\r\nprint(min(liste3)10)\r\n ", "a,b,c=map(int,input().split())\nl=list(map(int,input().split()))\narr=[]\nfor i in range(1,len(l)+1):\n if l[i-1]!=0 and l[i-1]<=c:\n arr.append(abs(i-b)10)\nprint(min(arr))\n\n\t \t \t \t\t\t\t\t\t\t\t\t\t \t \t\t", "first_entry = input()\nsecond_entry = input()\n\ndef entry_to_list_integers(entry):\n return list(map(lambda x: int(x), entry.split(\" \")))\n\nn, m, k = entry_to_list_integers(first_entry)\nhouse_prices = entry_to_list_integers(second_entry)\n\nbest_house = n\n\nfor i in range(n):\n current_price = house_prices[i]\n current_distance = abs((i + 1) - m)\n if (current_price != 0 and current_price <= k and current_distance < best_house):\n best_house = current_distance\n\nprint(best_house * 10)", "_, pos, money = [int(i) for i in input().split()]\r\nhouses = [int(i) for i in input().split()]\r\nminDist = len(houses)\r\npos -= 1\r\nfor i in range(minDist):\r\n if houses[i] != 0 and abs(pos - i) < minDist and houses[i] <= money:\r\n minDist = abs(pos - i)\r\nprint(minDist * 10)", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=0\r\ny=0\r\ni=m-2\r\nwhile(i>=0):\r\n if l[i]!=0 and l[i]<=k:\r\n x=((m-1)-i)10\r\n break\r\n i=i-1\r\ni=m\r\nwhile(i<n):\r\n if l[i]!=0 and l[i]<=k:\r\n y=(i-(m-1))10\r\n break\r\n i=i+1\r\nif x!=0 and y!=0:\r\n if x<y:\r\n print(x)\r\n else:\r\n print(y)\r\nelif y==0:\r\n print(x)\r\nelif x==0:\r\n print(y)", "def convert_to_int_array(array):\r\n return [int(i) for i in array]\r\n\r\nfst_input = input().split()\r\nsnd_input = input().split()\r\n\r\nprices = convert_to_int_array(snd_input)\r\nfst_input_int_list = convert_to_int_array(fst_input)\r\nqtt_houses = fst_input_int_list[0]\r\ngirls_house = fst_input_int_list[1]\r\nzanes_money = fst_input_int_list[2]\r\n\r\n\r\n\r\nzanes_house = qtt_houses + 1\r\nfor i in range(qtt_houses):\r\n if prices[i] != 0:\r\n if prices[i] <= zanes_money and abs(i + 1 - girls_house) < zanes_house:\r\n zanes_house = abs(i + 1 - girls_house)\r\n\r\nprint(zanes_house * 10)", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A, m, k):\r\n n = len(A)\r\n answer = float('inf')\r\n for i in range(n):\r\n if 0 < A[i] <= k:\r\n answer = min(answer, abs(10(i+1-m)))\r\n sys.stdout.write(f'{answer}\\n')\r\n \r\nn, m, k = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nprocess(A, m, k)", "n, m, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\na = []\r\n\r\nfor i in range(n):\r\n if l[i] != 0 and l[i] <= k:\r\n c = abs(m - (i + 1))\r\n a.append(c)\r\n\r\nprint(min(a)10)", "n,m,k = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\ndis = []\r\nfor i in range(len(a)):\r\n if a[i]!=0 and a[i]<=k:\r\n dis.append(abs(i+1-m))\r\n\r\nprint(10min(dis))", "n, m, k = map(int, input().split())\nhouses = list(map(int, input().split()))\nmenor = 1000 # 1000 pode ser inf pois ultrapassa o tamanho maximo que a lista pode chegar\n\nfor i in range(m-1,-1,-1): # de trás pra frente\n if (houses[i] != 0) and (k >= houses[i]):\n suposto_menor = abs((i+1)-m)10\n if(suposto_menor < menor):\n menor = suposto_menor\n\nfor i in range(m,n): # de frente pra trás\n if (houses[i] != 0) and (k >= houses[i]):\n suposto_menor = abs((i+1)-m)10\n if(suposto_menor < menor):\n menor = suposto_menor\n\nprint(menor)\n", "n,m,k= map(int,input().split())\r\na = list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n if(a[i]!=0 and a[i]<=k):\r\n b.append(i+1)\r\n\r\nmi = abs(b[0])\r\nfor i in range(1,len(b)):\r\n if(abs(b[i]-m)<abs(mi-m)):\r\n mi = abs(b[i])\r\nprint(abs(m-mi)10)\r\n \r\n ", "ls=list(map(int,input().rstrip().split()))\r\nn=ls[0]\r\nm=ls[1]\r\nk=ls[2]\r\nhs=list(map(int,input().rstrip().split()))\r\nds=[]\r\nfor i in range(len(hs)):\r\n if(hs[i]<=k and hs[i]!=0):\r\n ds.append(i)\r\nfor i in range(len(ds)):\r\n ds[i]=abs(ds[i]+1-m)10\r\nprint(min(ds))", "n, m , k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nm -= 1\r\nt1 = m-1\r\nt2 = m+1\r\nans = n\r\nwhile t1>=0:\r\n if l[t1] != 0 and l[t1] <= k:\r\n ans = min(ans,m-t1)\r\n break \r\n t1 -= 1\r\n\r\n\r\nwhile t2 <= n-1:\r\n if l[t2] != 0 and l[t2] <= k:\r\n ans = min(ans, t2 -m)\r\n break \r\n t2 += 1\r\n\r\nans = 10\r\nprint(ans)\r\n", "n,m,k = [int(x) for x in input().split()]\r\nhouses_prices = [int(x) for x in input().split()]\r\ndistances_unities = []\r\n \r\nfor i in range(n):\r\n\tif (houses_prices[i]!= 0 and houses_prices[i]<=k):\r\n\t\tdistances_unities.append(abs(i+1-m))\r\n\r\ndistance_min = min(distances_unities)\r\nprint(distance_min * 10)\t", "n, m, k = map(int, input().split())\r\nl_p = list(map(int, input().split()))\r\n\r\nm -= 1\r\ni = 1\r\n\r\nwhile i < n:\r\n if m + i < n:\r\n if l_p[m + i] <= k and l_p[m + i] != 0:\r\n print(i * 10)\r\n quit()\r\n if m - i >= 0:\r\n if l_p[m - i] <= k and l_p[m - i] != 0:\r\n print(i * 10)\r\n quit()\r\n \r\n i += 1", "import math\r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 1e9\r\nfor i in range(0, n):\r\n\tif a[i] == 0:\r\n\t\tcontinue\r\n\tif a[i] <= k:\r\n\t\tans = min(ans, abs(m-(i+1))10)\r\nprint(ans)", "n,m,k = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\nh1=[]\n \nfor i in range(n):\n\tif (a[i]!=0 and a[i]<=k):\n\t\th1.append(abs(i+1-m))\n\t\t\nc=min(h1)\nprint(c10)\n", "string = input().split(' ')\r\n\r\nn = int(string[0])\r\nm = int(string[1])\r\nk = int(string[2])\r\n\r\nhouses = input().split(' ')\r\n\r\nminDistance = float('inf')\r\n\r\nfor i in range(m-1, n):\r\n if int(houses[i]) <= k and int(houses[i]) != 0 and i != m-1:\r\n minDistance = (i+1-m) * 10\r\n break\r\n\r\nfor i in range(m-1, -1, -1):\r\n if int(houses[i]) <= k and int(houses[i]) != 0 and i != m-1:\r\n distance = (m-(i+1)) * 10\r\n if distance < minDistance:\r\n minDistance = distance\r\n\r\nprint(minDistance)\r\n\r\n\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,m,k=read_ints()\r\n\tm-=1\r\n\ta=read_ints()\r\n\tfor i in range(n):\r\n\t\tif 0<=m+i and m+i<n and 0<a[m+i] and a[m+i]<=k:\r\n\t\t\tprint(i10)\r\n\t\t\treturn\r\n\t\tif 0<=m-i and m-i<n and 0<a[m-i] and a[m-i]<=k:\r\n\t\t\tprint(i10)\r\n\t\t\treturn\r\n\r\nsolve()\r\n", "\"\"\"# Do not remove the below import statement\r\nimport sys\r\n\r\n'''This function provides the capacity, size and space left in the list.\r\nYou can invoke it to get the details of the list'''\r\n\r\n\r\ndef list_details(lst):\r\n # Number of elements that can be stored in the list\r\n print(\"Capacity:\", (sys.getsizeof(lst)-36)//4)\r\n\r\n # Number of elements in the list\r\n print(\"Size:\", len(lst))\r\n\r\n # Number of elements that can be accommodated in the space left\r\n print(\"Space Left:\", ((sys.getsizeof(lst)-36) - len(lst4))//4)\r\n\r\n # formula changes based on the system architecture\r\n # (size-36)/4 for 32 bit machines and\r\n # (size-64)/8 for 64 bit machines\r\n\r\n # 36, 64 - size of an empty list based on machine\r\n # 4, 8 - size of a single element in the list based on machine\r\n\r\n\r\nmarias_lst = []\r\nfor i in range(1500):\r\n marias_lst.append(i)\r\nprint(\"Empty list created!!!\")\r\nprint(\"List details:\")\r\nlist_details(marias_lst)\r\nmarias_lst.append(1)\r\nmarias_lst.append(2)\r\nprint(marias_lst)\r\n\"\"\"\r\nn, m, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nmind = len(l)-1\r\nfor i in range(len(l)):\r\n if i != m-1 and 0 < l[i] <= k and abs(i-m+1) < mind:\r\n mind = abs(i-m+1)\r\nprint(mind10)\r\n", "import sys\n#import time\n\ndef StrToInt(list_entry):\n\tmap_object = map(int, list_entry)\n\treturn list(map_object)\n\ndef calculeDistance(i, j):\n\tend = max(i, j)\n\tbegin = min(i, j)\n\treturn 10 * (end - begin)\n\n# entry\nnum_houses, girl_index, money = StrToInt(input().split())\nprices = StrToInt(input().split())\n\ngirl_index -= 1\nmin_value = sys.maxsize\nfor i in range(len(prices)):\n\tprice = prices[i]\n\tif price != 0 and i != girl_index and price <= money:\n\t\tdistance = calculeDistance(i, girl_index)\n\t\tmin_value = min(min_value, distance)\n\nprint(min_value)\n \t\t\t \t\t\t \t\t \t\t \t \t \t \t \t\t", "n, m, k = [int(x) for x in input().split()]\r\nhouses_values = [int(x) for x in input().split()]\r\n\r\nnearest = float(\"inf\")\r\n\r\nfor i, value in enumerate(houses_values):\r\n if value != 0 and value <= k:\r\n distance = abs(m - (i + 1))\r\n\r\n if nearest >= distance:\r\n nearest = distance\r\n\r\nprint(nearest * 10)\r\n", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = float('inf')\r\nfor i in range(m-2,-1,-1):\r\n\tif a[i]!=0 and a[i]<=k:\r\n\t\tans = m-(i+1)\r\n\t\tbreak\r\nfor i in range(m,n):\r\n\tif a[i]!=0 and a[i]<=k:\r\n\t\tans = min(ans,i-m+1)\r\nprint(ans10)", "n,m,k = [ int(x) for x in input().split()]\r\nm -= 1\r\nhouses = [ int(x) for x in input().split()]\r\n\r\nwill_buy = -1\r\nhouse_away = n\r\nfor i in range(n):\r\n price = houses[i]\r\n this_away = abs(i-m)\r\n if ( price != 0 and k >= price and this_away <= house_away):\r\n will_buy = i\r\n house_away = this_away\r\n\r\nprint(10(abs(will_buy-m)))\r\n", "n, m, k = [int(s) for s in input().split(' ')]\r\na = [int(s) for s in input().split(' ')]\r\nprint(10 * min([abs(m - 1 - j) for j, p in enumerate(a) if 0 < p <= k]))", "n,m,k = map(int,input().split())\r\nprices = list(map(int, input().split()))\r\n\r\nboughthousedist = []\r\n\r\nfor i in range(1,n+1):\r\n if prices[i-1] == 0 or prices[i-1] > k:\r\n continue\r\n else:\r\n boughthousedist.append(abs(m-i)10)\r\n\r\nmindist = min(boughthousedist)\r\nprint(mindist)", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n\tif a[i]<=k and a[i]!=0:\r\n\t\tb.append(10abs(m-i-1))\r\nprint(min(b))\t\t\r\n", "from sys import stdin\n\nn, m, k = (int(i) for i in stdin.readline().strip().split(' '))\n\na = [int(i) for i in stdin.readline().strip().split(' ')]\n\n# a[m] == 0\n# a[i] == 0 -> can not be bought\n\n\n# adjust m for correct indexes\nm = m - 1\n\nmin_d = float('inf')\nfor i, price in enumerate(a):\n if 0 < price <= k:\n if abs(i-m) < min_d:\n min_d = abs(i-m)\n\nprint(min_d * 10)", "v = lambda: map(int, input().split())\r\nn, m, k = v()\r\nm -= 1\r\nprint(min(abs(i - m) for i, p in enumerate(v()) if 0 < p <= k) * 10)\r\n", "N, M, K = map(int, input().split())\nlista = [int(i) for i in input().split()]\n\nk, ans=0, []\nfor i in lista:\n\tk += 1\n\tif(i!=0 and i<=K):\n\t\tans.append(abs(k-M))\t\n\nans.sort()\nprint(ans[0]10)\n\t \t\t \t\t\t\t \t\t \t \t \t \t\t \t\t\t\t", "n,m,k=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\ndis=0\r\nminm=100000000\r\nfor i in range(0,n):\r\n if a[i]<=k and i!=n and a[i]!=0:\r\n dis=abs(i-m+1)10\r\n if dis<minm:\r\n minm=dis\r\nprint(minm)\r\n ", "n, m, k = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\n\nmin_distance = n * 10\n\nfor i, price in enumerate(a):\n if price > 0 and k >= price:\n distance = abs(i * 10 - m * 10 + 10)\n if distance < min_distance:\n min_distance = distance\n\nprint(min_distance)\n", "def abs(n: int):\n if n < 0:\n n = -n\n return n\nn, m, k = map(int, input().split())\nhouse = list(map(int, input().split()))\n# print(house)\nans = -1\nfor i in range(0, m - 1):\n if house[i] != 0 and house[i] <= k:\n ans = i\nfor i in range(m, n):\n if house[i] != 0 and house[i] <= k:\n if ans == -1 or abs(i - m + 1) < abs(ans - m + 1):\n print(abs(i - m + 1) * 10)\n exit(0)\n else:\n print(abs(ans + 1 - m) * 10)\n exit(0)\n\nprint(abs(ans - m + 1) * 10)\n\t\t\t\t\t \t\t \t\t\t\t\t \t\t\t\t\t\t \t \t \t", "a, b, c = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nk = []\r\n\r\nfor i in range(a):\r\n if 0 < l[i] <= c:\r\n k.append(abs((i+1)10-b10))\r\n\r\nprint(min(k))", "line=input()\nn,m,j = [int(i) for i in line.split()]\nline=input()\na=[int(i) for i in line.split()]\ndistancia=n\nfor k in range(n):\n if a[k]!=0 and a[k]!=a[m-1] and a[k]<=j:\n if abs(m-(k+1))<=distancia:\n distancia=abs(m-(k+1))\nprint(distancia10)\n\t\t\t\t \t \t \t\t \t\t\t\t\t \t \t\t \t\t", "N, M, K = map(int, input().split())\nAs = list(map(int, input().split()))\n\nans = 10 N\nfor i in range(N):\n if 0 < As[i] <= K:\n ans = min(ans, 10 * abs(M - i - 1))\n\nprint(ans)\n", "arr = n,m,k = [int(x) for x in input().split()]\r\n\r\nhouses = [int(x) for x in input().split()]\r\n\r\ngl = m-1\r\n\r\ndist = 101\r\n\r\nfor i in houses:\r\n if i != 0 and i <= k:\r\n if abs(houses.index(i) - gl) < dist:\r\n dist = abs(houses.index(i) - gl)\r\n houses[houses.index(i)] = 100000\r\n \r\nprint(dist10)", "n,m,k=map(int,input().split(' '))\r\ns=list(map(int,input().split(' ')))\r\nd=[]\r\nfor i in range(n):\r\n\tif s[i]<=k and s[i]!=0:\r\n\t\td.append(abs(m-(i+1)))\r\nprint(min(d)10)", "n, m, k = map(int, input().split())\nprices = list(map(int, input().split()))\n\nminDistance = 1000000;\nfor i in range(0, n):\n if prices[i] != 0 and prices[i] <= k:\n minDistance = min(minDistance, abs(i - (m-1)))\n \nans = 10 * minDistance\nprint(ans)\n \t\t \t \t\t\t\t \t \t\t\t\t", "n, m, k = map(int, input().split(' '))\np = list(map(int, input().split(' ')))\n\nm -= 1\n\nd = 0\n\nfor i in range(m - 1, -1, -1):\n if p[i] != 0 and p[i] <= k:\n d = m - i\n break\n\nfor i in range(m + 1, n):\n if p[i] != 0 and p[i] <= k:\n if d == 0:\n d = i - m\n break\n\n d = min(d, i - m)\n break\n\nprint(10 * d)\n\n\t \t \t\t \t\t \t \t \t \t\t \t \t", "n, m, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nans = 0\r\ntemp = 0\r\npointer = 0\r\nfor i in range(len(a)):\r\n if (k >= a[i] and a[i] != 0):\r\n temp = abs(m - (i+1))10\r\n# print(temp)\r\n if (pointer == 0):\r\n ans = temp\r\n pointer += 1\r\n# print(ans)\r\n if (ans > temp):\r\n ans = temp\r\n \r\nprint(ans)", "n,m,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nm-=1\r\nl1 = []\r\nfor i in range(n):\r\n if(l[i]<=k and l[i]!=0):\r\n l1.append((abs(i-m))10)\r\nprint(min(l1))", "n,b,c = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = []\r\nfor i in range(b):\r\n if a[i] != 0 and a[i] <= c:\r\n d.append((b-i-1)10)\r\nfor i in range(b,len(a),1):\r\n if a[i] != 0 and a[i] <= c:\r\n d.append((i-b+1)10)\r\nprint(min(d))", "n, m, k = map(int, input().split() )\r\na = [0]n\r\na = list(map(int, input().split() ) )\r\n\r\nc = 10000\r\nm = m-1\r\nfor i in range(n):\r\n if a[i] > 0 and a[i] <= k:\r\n if c > m-i and m-i > 0:\r\n c = m-i\r\n elif c > i-m and i-m > 0:\r\n c = i-m\r\nprint(10c) \r\n", "n,m,k=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nan = 0\r\nl,r=m-1,m-1\r\nwhile an == 0:\r\n if l>=0 and A[l] > 0 and A[l] <=k:\r\n an = abs(l-m+1)\r\n if r<len(A) and A[r] >0 and A[r]<=k:\r\n an = abs(r-m+1)\r\n l-=1\r\n r+=1\r\nprint(10an) ", "def find_house_to_buy(houses, girl, money_avl):\r\n n = len(houses)\r\n can_buy = [i for i in range(1,n+1) if houses[i-1] != 0 and houses[i-1] <= money_avl ] \r\n can_buy.sort(key = lambda x : abs(x-girl))\r\n \r\n house_to_buy = abs(girl - can_buy[0])\r\n print(house_to_buy 10)\r\n \r\nn, girl, money_avl = map(int, input().split())\r\nhouses = [int(i) for i in input().split()]\r\n\r\nfind_house_to_buy(houses, girl, money_avl)", "n, m, k = map(int, input().split())\r\np = list(map(int, input().split()))\r\nans = n\r\nfor i in range(n):\r\n if p[i] != 0 and p[i] <= k:\r\n ans = min(ans, abs(i + 1 - m))\r\nprint(ans * 10)\r\n", "n,m,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nb=[]\r\nfor i in range(n):\r\n if a[i]<=k and a[i]!=0:\r\n b.append(abs(i+1-m)10)\r\nprint(min(b))", "n, m, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nl = []\r\nfor i in range(n):\r\n\tif a[i]>0 and a[i]<=k:\r\n\t\tl.append(i)\r\nl1 = [abs(i-(m-1)) for i in l]\r\nprint(min(l1)10)", "n, m, k = map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\na = 0\r\nb = 0\r\nflaga = 0\r\nflagb = 0\r\nfor x in range(m-1,0,-1):\r\n\ta+=1\r\n\tif l[x-1] <= k and l[x-1]!= 0:\r\n\t\tflaga = 1\r\n\t\tbreak\r\nfor y in range(m+1,n+1):\r\n\tb+=1\r\n\tif l[y-1] <= k and l[y-1]!= 0:\r\n\t\tflagb =1\r\n\t\tbreak\r\nif flaga == 0:\r\n\ta = 101\r\nif flagb == 0:\r\n\tb = 101\r\n# print(a,b)\r\nprint(min(a,b)10)", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(n):\r\n if l[i]<=k and l[i]!=0:\r\n ans.append(i+1)\r\nfor i in range(len(ans)):\r\n ans[i]=abs(ans[i]-m)10\r\nprint(min(ans))", "n,m,k = map(int,input().split())\r\nMM = list(map(int,input().split()))\r\nl = 0\r\nb = 0\r\nif m == 1:\r\n for i in range(1,n):\r\n if MM[i] <= k and MM[i] != 0:\r\n print(i10)\r\n break\r\nelse:\r\n for i in range(m-1,-1,-1):\r\n if MM[i] <= k and MM[i] != 0:\r\n l = (m-1-i)10\r\n break\r\n for i in range(m,n):\r\n if MM[i] <= k and MM[i] != 0:\r\n b = (i-m+1)10\r\n break\r\n if min(l,b) == 0:\r\n print(max(l,b))\r\n else:\r\n print(min(l,b))\r\n", "n,m,k=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nc=m-1;count=0;count1=[]\r\nfor i in range(n):\r\n if ar[i]<=k and ar[i]!=0:\r\n count1.append(abs(i-c))\r\nprint(min(count1)10) \r\n \r\n ", "a = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = []\r\nd = []\r\nfor i in range(0,len(b)):\r\n if(b[i]==0):\r\n pass\r\n elif(b[i]<=a[2]):\r\n c.append(i+1)\r\n else:\r\n pass \r\nfor i in range(0,len(c)):\r\n h = a[1] - c[i] \r\n if(h<0):\r\n h = 0 - h\r\n d.append(h)\r\n else:\r\n d.append(h)\r\nprint(min(d)10)\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,m,k = map(int,input().split())\r\nai = list(map(int,input().split()))\r\nm -= 1\r\nans = 100000\r\nfor i in range(n):\r\n if ai[i] != 0 and ai[i] <= k:\r\n ans = min(ans,10 * (abs(m - i)))\r\nprint(ans)\r\n", "n, m, k = map(int, input().split())\r\nlistOfHouses = [int(x) for x in input().split()][:n]\r\nlistAvailableHouses = []\r\ntempList = []\r\nfor x in listOfHouses:\r\n if(x == 0):\r\n pass\r\n elif(x <= k):\r\n listAvailableHouses.append(listOfHouses.index(x)+1)\r\n listOfHouses[listOfHouses.index(x)] = \"A\"\r\n# print(listAvailableHouses)\r\nfor x in listAvailableHouses:\r\n if (x >= m):\r\n tempList.append((x - m)10)\r\n else:\r\n tempList.append((m-x)10)\r\n\r\nprint(min(tempList))", "n,m,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = a[:m-1][::-1]\r\na = a[m:]\r\n\r\nbn, an = 1010,1010\r\n\r\nfor i in range(len(a)):\r\n if a[i] <= k:\r\n if a[i]!=0:\r\n an = i\r\n break\r\n\r\nfor i in range(len(b)):\r\n if b[i] <= k:\r\n if b[i]!=0:\r\n bn = i\r\n break\r\n\r\nif an < bn:\r\n print(10(1+an))\r\nelse:\r\n print(10(1+bn))\r\n \r\n", "L = input()\r\nD = input()\r\nL = L.split()\r\nn = L[0]\r\nm = int(L[1])\r\n#k es numero de casa\r\nk = int(L[2])\r\np = m-1\r\n\r\nD = D.split()\r\nB = []\r\nfor i in range (len(D)):\r\n f = int (D[i])\r\n \r\n if f <= k and( i == p or f != 0):\r\n B.append(i) \r\n\r\nV = len(B)\r\nfor j in range (V):\r\n if B[j] == p:\r\n pos = j\r\n \r\nif B[0] == p:\r\n R = abs(p - B[pos+1])\r\nelif B[V-1] == p:\r\n R = abs(p - B[V-2])\r\nelse:\r\n R1 = abs(p - B[pos+1])\r\n R2 = abs(p - B[pos-1])\r\n if R1 <= R2:\r\n R = R1\r\n else:\r\n R = R2\r\nR = R10 \r\n\r\nprint (R)\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef main():\r\n n, m, k = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n min_val = 10 * 18\r\n for i in range(n):\r\n if A[i] and A[i] <= k:\r\n val = abs(i - (m - 1)) * 10\r\n min_val = min(min_val, val)\r\n print(min_val)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a=lambda:map(int,input().split());d,e,f=a();print(min(abs(i-e) for (i,z) in zip(range(1,d+1),a()) if 0<z<=f)10)\r\n", "from math import inf\n\n\ndef solve(n, m, k, a):\n ans = inf\n m -= 1\n for i in range(n):\n if a[i] and a[i] <= k and abs(m - i) < ans:\n ans = abs(m - i)\n return ans10\n\n\ndef main():\n n, m, k = list(map(int, input().split()))\n a = list(map(int, input().split()))\n print(solve(n, m, k, a))\n\n\nmain()\n", "n,m,k = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\nd=200\r\n\r\nfor i in range(1,n+1):\r\n if h[i-1] and h[i-1]<=k and d>abs(i-m):\r\n d = abs(i-m)\r\n \r\nprint(d10)", "import math\nn, m, k = input().split(' ')\nhouses = input().split(' ')\nindex = math.inf\n\nfor i in range(int(n)):\n if (i != int(m) - 1 and int(houses[i]) != 0):\n if(int(houses[i]) <= int(k)):\n if (abs((int(m) - 1) - i) < index):\n index = abs((int(m) - 1) - i)\n\nprint(index 10)\n\t \t\t\t\t \t\t\t \t \t \t \t\t\t\t\t \t", "n, m, k = map(int, input().split())\r\nl = [int(i) for i in input().split()]\r\nm -= 1\r\nans = []\r\nfor j in range(n):\r\n if l[j] !=0 and l[j]<=k:\r\n ans+=[abs(j - m)10]\r\nprint(min(ans))\r\n", "#n = int(input())\nn, m, k = map(int, input().split())\n#s = input()\nc = list(map(int, input().split()))\nl = 1000000000000000\nfor i in range(n):\n if c[i] != 0 and c[i] <= k:\n l = min(l, abs(m - i - 1) 10)\nprint(l)\n ", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmn = 1000000\r\nfor i in range(n):\r\n\tif a[i] != 0 and a[i] <= k:\r\n\t\tmn = min(mn,abs(m-i-1)10)\r\nprint(mn)\r\n", "def menorDistancia(lista1, lista2):\n i = int(lista1[0])\n j = int(lista1[1]) - 1\n k = int(lista1[2])\n distanciaEsquerda = 999999999\n distanciaDireita = 999999999\n\n for index in range(j-1,-1,-1):\n if(0 < int(lista2[index]) <= k):\n distanciaEsquerda = abs(j-index)10\n break\n for index in range(j+1,i):\n if(0 < int(lista2[index]) <= k):\n distanciaDireita = abs(j-index)10\n break\n\n return min(abs(distanciaEsquerda),abs(distanciaDireita))\n\n\n\nlista1 = input().split(\" \")\nlista2 = input().split(\" \")\n\nprint(menorDistancia(lista1,lista2))\n\t \t \t \t\t\t\t \t \t\t\t \t \t\t \t\t \t", "n,m,k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nans = min(abs(m-i-1)10 for i in range(len(a)) if a[i] <= k and a[i] != 0)\r\nprint(ans)", "n,m,k=map(int,input().split())\r\nls=list(map(int,input().split()))\r\np=1000000\r\nlove=0\r\nfor i in range(len(ls)):\r\n\tif ls[i]!=0 and ls[i]<=k and abs(m-1-i)<p and i!=(m-1):\r\n\t\tp=abs(m-1-i)\r\nprint(p10)\t\t", "n,m,k = input().split()\nn,m,k = map(int,[n,m,k])\nA = []\ns = input()\na = 1\nMin = 1000\nfor i in s.split():\n if int(i)<=k and int(i) != 0:\n x= abs(m-a)\n if x<Min:\n Min = x\n a = a + 1\nprint(Min10)\n\n\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\n\r\nmn=100000\r\nfor i in range(m,n):\r\n if(a[i]<=k and a[i]!=0):\r\n mn=(i-m+1)10\r\n break\r\n\r\nfor i in range(m):\r\n if(a[i]<=k and a[i]!=0):\r\n x=(m-1-i)10\r\n mn=min(mn,x)\r\n\r\nprint(mn)\r\n", "n,m,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ni=m-1\r\n#j=m-1\r\nleft=i-1\r\nright=i+1\r\ncount=0 \r\nwhile(1):\r\n if left>=0 and a[left]!=0 and a[left]<=k:\r\n count+=10\r\n break\r\n elif right<n and a[right]!=0 and a[right]<=k:\r\n count+=10\r\n break\r\n else:\r\n count+=10\r\n left-=1 \r\n right+=1 \r\nprint(count)", "n,m,k=map(int,input().split())\r\n\r\nres=float(\"inf\")\r\n\r\na=list(map(int,input().split()))\r\n\r\nfor i in range(0,n):\r\n if a[i]!=0 and a[i]<=k:\r\n res=min(res,abs(i-(m-1)))\r\n\r\nprint(10res)", "n,m,k = [int(n) for n in input().split()]\nlisto = input().split()\nres = n10\nfor i in range(n):\n if 0 < int(listo[i]) <= k and abs(i+1-m)10 < res:\n res = abs(i+1-m)10\nprint(res)\n \t\t \t \t\t \t\t \t\t \t \t \t", "n, m, k = map(int, input().split())\r\na = input().split()\r\nans = 100009\r\ni = 1\r\nfor j in a:\r\n\r\n if int(j) != 0 and int(j) <= k:\r\n ans = min(abs((i-m)10), ans)\r\n i += 1\r\nprint(ans)\r\n", "\r\ndef ok(arr1,t,p):\r\n cost=float('inf')\r\n n=len(arr1)\r\n for i in range(n):\r\n if arr1[i]<=p and arr1[i]!=0:\r\n cost=min(cost,abs(i-t+1)10)\r\n return cost\r\nn,t,p=map(int,input().split())\r\narr1=list(map(int,input().split()))\r\nprint(ok(arr1,t,p))\r\n", "n,m,k=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\ns=[]\r\nfor i in range(n):\r\n if l[i]<=k and i!=m-1 and l[i]!=0:\r\n s.append(i)\r\n#print(s)\r\ny=min([abs(m-i-1)10 for i in s])\r\nprint(y)", "n, m, k = map(int, input().split())\r\nA, m = list(map(int, input().split())), m - 1\r\n\r\nfor d in range(1, n):\r\n if m - d >= 0 and 0 < A[m - d] <= k or m + d < n and 0 < A[m + d] <= k:\r\n print(10 d)\r\n break", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(0,n):\r\n if (a[i]<=k)and(a[i]!=0):\r\n b.append(i+1)\r\nmi=n\r\nfor i in b:\r\n if abs(m-i)<mi:\r\n mi=abs(m-i)\r\nprint(mi10)\r\n", "n, m, k = list(map(int, input().split()))\na = list(map(int, input().split()))\na = [p if p <= k else 0 for p in a]\nm -= 1\ni = m\nj = m\nwhile i < n and a[i] == 0: i += 1\nwhile j >= 0 and a[j] == 0: j -= 1\nif i < n and j >= 0:\n print(10min(i-m, m-j))\nelif i < n:\n print(10(i-m))\nelse:\n print(10(m-j))\n\n", "houses, girl_house, money = [int(x) for x in input().split(' ')]\r\navailable = [int(x) for x in input().split(' ')]\r\ncnt = 1\r\n\r\ncheapest = 99 * 10\r\n\r\nwhile cnt <= houses:\r\n if available[cnt-1] == 0 or available[cnt-1] > money:\r\n pass\r\n else:\r\n cheapest = min(cheapest, abs((cnt - girl_house) * 10))\r\n cnt += 1\r\n\r\nprint(cheapest)\r\n", "def menorDistancia(precoCasas, m, k):\n i = 1\n distanciaEntreCasas = 10\n \n while True:\n if m - i >= 0:\n if int(precoCasas[m - i]) <= k and int(precoCasas[m - i]) > 0:\n break\n if m + i < len(precoCasas):\n if int(precoCasas[m + i]) <= k and int(precoCasas[m + i]) > 0:\n break\n i += 1\n \n return distanciaEntreCasas * i\n\nentrada = input().split()\nm = int(entrada[1])\nk = int(entrada[2])\nprecoCasas = input().split()\nprint(menorDistancia(precoCasas, m - 1, k))\n \t\t \t \t\t \t\t \t", "import math\r\n\r\nnapis = input().split()\r\nileDomow = int(napis[0])\r\ngdzieMieszka = int(napis[1])\r\nilePieniedzy = int(napis[2])\r\nkolejnyNapis = input().split()\r\nlistaCen = []\r\n\r\nktoreDomyMoznaKupic = []\r\nindeksyTychDomow = []\r\n\r\nif len(kolejnyNapis) == ileDomow:\r\n for x in range(len(kolejnyNapis)):\r\n listaCen.append(int(kolejnyNapis[x]))\r\n\r\n for y in range(len(listaCen)):\r\n if ilePieniedzy >= int(listaCen[y]) and listaCen[y] > 0:\r\n indeksyTychDomow.append(y + 1)\r\n\r\n najmniejszyDystans = int(math.fabs(int(indeksyTychDomow[0]) - gdzieMieszka))\r\n for z in range(len(indeksyTychDomow)):\r\n if math.fabs(int(indeksyTychDomow[z]) - gdzieMieszka) < najmniejszyDystans:\r\n najmniejszyDystans = math.fabs(int(indeksyTychDomow[z]) - gdzieMieszka)\r\n\r\n print(int(najmniejszyDystans * 10))\r\n", "n, m, k = [int(x) for x in input().split()]\r\nprices = [int(x) for x in input().split()]\r\n#0, 1, 2, .... , m-2, (m-1), m, ..., n-1\r\n\r\nright_side = 1000000\r\nfor i in range(m, n):\r\n\tif prices[i] != 0 and prices[i] <= k:\r\n\t\tright_side = i - m + 1 # distance to house (m-1)\r\n\t\tbreak\r\n\r\nleft_side = 1000000\r\nfor i in range(m-2, -1, -1):\r\n\tif prices[i] != 0 and prices[i] <= k:\r\n\t\tleft_side = m - i - 1 # distance to house (m-1)\r\n\t\tbreak\r\n\r\nprint(min(left_side, right_side) 10)", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\n\r\n\r\nfor y in range(0,n):\r\n if k>=a[y] and a[y]!=0:\r\n b.append(abs(y-(m-1)))\r\n\r\nl=min(b)\r\nprint(l10)\r\n\r\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=0\r\nfor x in range(n):\r\n if a[x]<=k and a[x]:\r\n if i==0:i=abs(m-x)-(2(x+1<m)-1)\r\n else:i=min(i,abs(m-x)-(2(x+1<m)-1))\r\nprint(i10)", "x = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\nk = int(x[2])\r\nx = input().split()\r\nlist1 = []\r\nfor i in x:\r\n list1.append(int(i))\r\n\r\nfirst_index = -10000\r\nsecond_index = -10000\r\n\r\nfor i in range(m-1,-1,-1):\r\n if list1[i] == 0:\r\n continue\r\n if k>=list1[i]:\r\n first_index = i\r\n break\r\n\r\nfor i in range(m,n):\r\n if list1[i] == 0:\r\n continue\r\n if k>=list1[i]:\r\n second_index = i\r\n break\r\n\r\nif abs(first_index-(m-1)) <= abs(second_index-(m-1)):\r\n print((abs(first_index-(m-1)))10)\r\nelse:\r\n print((abs(second_index-(m-1)))10)\r\n ", "len_houses, girl, cash = map(int, input().split())\nhouses = list(map(int, input().split()))\ngirl -= 1\nmin_distance = len_houses\n\ndef calc_distance(distance):\n x = girl - distance\n return x if x > 0 else x * -1\n\nfor i in range(len_houses):\n distance = calc_distance(i)\n if (0 < houses[i] and houses[i] <= cash and distance < min_distance):\n min_distance = distance\n\nprint(min_distance * 10)\n\t \t \t \t \t \t\t", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk1=10000000\r\nk2=-10000000\r\nfor i in range(m-1,n,1):\r\n if a[i]!=0:\r\n if a[i]<=k:\r\n k1=i\r\n break\r\nfor i in range(m-1,-1,-1):\r\n if a[i]!=0:\r\n if a[i]<=k:\r\n k2=i\r\n break\r\nr=min(k1-(m-1),(m-1)-k2)\r\nprint(r10)", "n, m, k = map(int, input().split())\r\nhouses = list(map(int, input().split()))\r\n\r\ntoright = houses[m:]\r\ntoleft = list(reversed(houses[:m-1]))\r\n\r\ndef first_lower(lst, num):\r\n for i in range(len(lst)):\r\n if lst[i] <= num and lst[i] != 0:\r\n return i + 1\r\n return -1\r\n\r\ndef min(a,b):\r\n if a < 0 or b < 0:\r\n return a if b < 0 else b\r\n return a if a < b else b\r\n\r\nprint(min( first_lower(toright, k), first_lower(toleft,k) ) 10)", "n, m, k = map(int, input().strip().split(' '))\nhouses = list(map(int, input().strip().split(' ')))\ncount = 0\nfor i in range(m,n):\n count += 10\n if houses[i] > 0 and houses[i] <= k:\n break\n if i == n-1:\n count = 1000\nright_min = count\nhouses.reverse()\ncount = 0\nfor i in range((n-m+1),n):\n count += 10\n if houses[i] > 0 and houses[i] <= k:\n break\n if i == n-1:\n count = 1000\nleft_min = count\nif left_min == 0:\n print(right_min)\nelif right_min == 0:\n print(left_min)\nelse:\n print(min(left_min,right_min))", "import math\r\ndef main():\r\n n,m,k = map(int, input().split())\r\n a = list(map(int,input().split()))\r\n m -= 1\r\n i = j = m\r\n i -= 1\r\n j += 1\r\n t1 = t2 = 1000000000000000000000000000000\r\n while i >= 0:\r\n if a[i] <= k and a[i] != 0:\r\n t1 = 10 * (m - i)\r\n break\r\n i -= 1\r\n while j < len(a):\r\n if a[j] <= k and a[j] != 0:\r\n t2 = 10 * (j - m)\r\n break\r\n j += 1\r\n print(int(min(t1,t2)))\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m, k = map(int, input().split(\" \"))\na = list(map(int, input().split(\" \")))\nfor i in range(1, n+1):\n if (m-i-1 >= 0 and a[m-i-1] != 0 and k >= a[m-i-1]) or \\\n (m+i-1 < n and a[m+i-1] != 0 and k >= a[m+i-1]):\n print(i10)\n exit()\n", "n,m,k=map(lambda x:int(x),input().split())\r\nnum=input()\r\nlist=[int(x) for x in num.split()]\r\na=n\r\nfor i in range(n):\r\n if list[i]!=0 and list[i]<=k and abs(i-(m-1))<a:\r\n a=abs(i-(m-1))\r\nprint(a10)", "n,m,k = map(int, input().split())\nh = list(map(int, input().split()))\n\nm -= 1\n\nans = 10*18\n\ni = m+1\nwhile i < n:\n if h[i] > 0 and h[i] <= k:\n ans = abs(i - m)\n break\n i += 1\n\ni = m-1\nwhile i >= 0:\n if h[i] > 0 and h[i] <= k:\n ans = min(abs(i - m), ans)\n break\n i -= 1\n\nprint(ans 10)", "a=lambda:map(int,input().split());d,e,f=a();print(min(abs(i-e) for i,z in enumerate(a(),1) if 0<z<=f)10)", "n_m_k = input().split(\" \")\r\nhouses = input().split(\" \")\r\nn = int(n_m_k[0])\r\nm = int(n_m_k[1])\r\nk = int(n_m_k[2])\r\nd = 100\r\n\r\n\r\nfor i in range(1,n+1):\r\n h = int(houses[i-1])\r\n if ((h>0) and (h <= k) and (d>abs(i-m))):\r\n d = abs(i-m)\r\n\r\nprint(d10)", "n,m,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nm-=1 \r\nlst=[]\r\nfor i in range(n):\r\n if 0<a[i]<=k:\r\n lst.append(i)\r\nfor i in range(len(lst)):\r\n if lst[i]<m:\r\n lst[i]=m-lst[i]\r\n else:\r\n lst[i]=lst[i]-m\r\nprint(min(lst)10)", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in range(n):\r\n\tif a[i]==0 or k-a[i]<0:\r\n\t\tcontinue\r\n\telse:\r\n\t\tb.append(abs(m-i-1))\r\nprint(min(b)10)", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nmin=n\r\nfor i in range(n):\r\n\tif l[i]>0 and l[i]<=k and abs(i-(m-1))<min:\r\n\t\tmin=abs(i-(m-1))\r\nprint(min10)\t\t", "R=lambda:[int(x) for x in input().split()]\r\nn,m,k=R()\r\nm-=1\r\nprint (min(abs(i-m) for i,p in enumerate(R()) if 0<p<=k)10)", "n,m,k= map(int,input().split())\r\na = list(map(int,input().split()))\r\nlist1=[]\r\nfor i in range(n):\r\n if (a[i]<=k) and (i != m-1) and (a[i] != 0):\r\n list1.append(i+1)\r\nmin = 10000000000\r\nfor i in range(len(list1)):\r\n if (abs(m-list1[i])<min):\r\n min= abs(m-list1[i])\r\nprint(min10)", "HOUSE_DISTANCE = 10\n\nn, m, k = map(int, input().split())\nm -= 1\n\na = list(map(int, input().split()))\n\npossible_houses_distances = []\n\nfor index, house_value in enumerate(a):\n if 0 < house_value <= k:\n possible_houses_distances.append(abs(index - m))\n\nprint(min(possible_houses_distances) 10)\n", "# Eddie Kaleb - 117110271 - CC@UFCG - ATAL - Melina Mongiovi\nimport sys\n\nDISTANCE_FACTOR = 10\n\ndef toInteger(inputs):\n\treturn list(map(int, inputs))\n\nnum_houses, position, budget = toInteger(input().split())\nvalues = toInteger(input().split())\nminimum_distance = sys.maxsize\nposition -= 1\n\ndef getDistance(a, b):\n\tstart = max(a, b)\n\tfinish = min(a, b)\n\n\treturn DISTANCE_FACTOR * (start - finish)\n\nfor pos in range(len(values)):\n\n\tvalue = values[pos]\n\n\tif value != 0 and value <= budget and pos != position:\n\n\t\tdistance = getDistance(pos, position)\n\n\t\tminimum_distance = min(minimum_distance, distance)\n\nprint(minimum_distance)\n\t\t\t \t\t \t\t \t \t\t\t \t\t \t \t", "n, m, k = list(map(int, input().split()))\n\nhouses = list(map(int, input().split()))\n\ndist = 1\ni, j = m - 2, m\nwhile (True):\n canBuyLeft = (i >= 0) and (0 < houses[i] <= k)\n canBuyRight = (j < n) and (0 < houses[j] <= k)\n\n if (canBuyLeft or canBuyRight):\n break\n\n dist += 1\n i -= 1\n j += 1\n\nprint(dist * 10)\n\t \t \t\t \t \t\t\t \t\t \t\t \t \t\t", "house, c_house, money = list(map(int, input().split(\" \")))\r\na = list(map(int, input().split(\" \")))\r\ndist1, dist2, f1, f2 = 0, 0, 0, 0\r\nfor i in range(c_house, house):\r\n dist1+=10\r\n if a[i]!=0 and money>=a[i]:\r\n f1=1\r\n break\r\nfor i in range(c_house-2, -1, -1):\r\n dist2+=10\r\n if a[i]!=0 and money>=a[i]:\r\n f2=1\r\n break\r\nif dist1==0:\r\n print(dist2)\r\nelif dist2==0:\r\n print(dist1)\r\nelse:\r\n if f1==1 and f2==0:\r\n print(dist1)\r\n elif f1==0 and f2==1:\r\n print(dist2)\r\n else:\r\n print(min(dist1, dist2))", "#!/usr/bin/env python\r\n# -- coding: utf-8 --\r\n\r\n\r\nfirst_ = [int(x) for x in input().split()]\r\nsec_ = [int(x) for x in input().split()]\r\n\r\ndom_dev = first_[1]\r\ndengi = first_[2]\r\nfull = 0\r\nvarianti = []\r\nvar2 = []\r\ni = 1\r\n\r\n\r\nfor house in sec_:\r\n\tif dengi >= house and house is not full:\r\n\t\tvarianti.append(i)\r\n\ti += 1\r\n\r\nfor var in varianti:\r\n\tvar2.append(abs(int(var) - int(dom_dev)) * 10)\r\n\r\n\r\nprint(min(var2))\r\n", "n, m, k = map(int, input().split())\r\nm -= 1\r\np = [int(x) for x in input().split()]\r\nbuyable = [i for i, x in enumerate(p) if x and x <= k]\r\ndist = abs(m - min(buyable, key=lambda x: abs(m - x)))\r\nprint(dist * 10)", "n,m,k=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\ns=[]\r\nfor i in range(n):\r\n if t[i]!=0 and t[i]<=k:\r\n s.append(abs(i-(m-1)))\r\nprint(min(s)10)\r\n", "# Coded By Block_Cipher\r\n \r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nfrom math import gcd\r\nfrom math import sqrt\r\nfrom collections import Counter\r\n\r\n\r\ndef solve():\r\n\tn,m,k = list(map(int,input().split()))\r\n\tarr = list(map(int,input().split()))\r\n\tans = 1010\r\n\tfor i in range(n):\r\n\t\tif arr[i]<=k and arr[i] !=0 and abs(m-1-i)<ans:\r\n\t\t\tans=abs(m-1-i)\r\n\tprint(ans10)\r\n\r\nsolve()", "n,m,k=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\np=[]\r\nfor i in range(n):\r\n if a[i]!=0:\r\n if a[i]<=k:\r\n p.append(abs(i+1-m-1+1)10)\r\nprint(min(p))\r\n\r\n", "n, m, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nprint(10 * min([abs(i - m + 1) for i in range(n) if 0 < l[i] <= k]))\r\n", "def main():\r\n nmk = input().split()\r\n n = int(nmk[0])\r\n m = int(nmk[1])-1\r\n k = int(nmk[2])\r\n houses = input().split()\r\n min = n\r\n for i in range(n):\r\n if 0 < int(houses[i]) <= k:\r\n if abs(i-m) < min:\r\n min = abs(i-m)\r\n print(min10)\r\n pass\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, m, k = map(int, input().split())\nx = list(map(int, input().split()))\ni = 1\nm -= 1\nwhile (m - i) >= 0 or (m + i) < n:\n a = m - i\n b = m + i\n if a >= 0:\n if x[a] > 0 and x[a] <= k:\n break\n if b < n:\n if x[b] > 0 and x[b] <= k:\n break\n i += 1\nprint(i 10)\n", "y = list(map(int,input().strip().split()))[:3]\r\n\r\nresp = 10000\r\n\r\nn = y[0]\r\nm = y[1]-1\r\nk = y[2]\r\n\r\ny2 = list(map(int,input().strip().split()))[:n]\r\n\r\nfor i in range(0,n):\r\n if (y2[i] != 0 and y2[i] <= k and resp > abs(i-m)):\r\n resp = abs(i-m)\r\n\r\nprint(resp10)", "n,m,k = map(int,input().split())\nal = list(map(int, input().split()))\nbl = [a if a <= k else 0 for a in al]\nret = n10\nfor i,b in enumerate(bl):\n if b>0:\n tmp = abs(i+1-m)10\n if tmp < ret:\n ret = tmp\nprint(ret)\n", "n, m, k = (int(x) for x in input().split())\r\nprices = [int(x) for x in input().split()]\r\nans = 1000000\r\nfor i, price in enumerate(prices):\r\n if price == 0:\r\n continue\r\n if price <= k:\r\n ans = min(ans, abs(m - 1 - i) 10)\r\nprint(ans)\r\n ", "n, m, k = map(int, input().split())\r\nm = m - 1\r\narr = [int(inp) for inp in input().split()]\r\np1 = m - 1\r\np2 = m + 1\r\nans = 0\r\nwhile p1 >= 0 or p2 < n:\r\n if p1 >= 0 and arr[p1] != 0 and arr[p1] <= k:\r\n ans = abs(p1 - m) * 10\r\n break\r\n else:\r\n p1 -= 1\r\n \r\n if p2 < n and arr[p2] != 0 and arr[p2] <= k:\r\n ans = abs(p2 - m) * 10\r\n break\r\n else:\r\n p2 += 1\r\nprint(ans)", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ni = m\r\nflagr = 0\r\nrd = 10\r\nld = 10\r\nflagl = 0\r\nwhile i < n:\r\n if a[i] <= k and a[i] != 0:\r\n #print(a[i])\r\n flagr = 1\r\n break\r\n else:\r\n rd += 10\r\n i+=1\r\nj = m-2\r\nwhile j > -1:\r\n if a[j] <= k and a[j] != 0:\r\n flagl = 1\r\n break\r\n else:\r\n ld += 10\r\n j-=1\r\n#print(ld, rd)\r\nif flagl == 1 and flagr == 1:\r\n print(min(ld, rd))\r\nelif flagl == 1:\r\n print(ld)\r\nelse:\r\n print(rd)", "n,k,m=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nmini=100000\r\nfor i in range(0,n):\r\n if l[i]<=m and abs(i10-(k-1)10)<mini and l[i] and mini>=0:\r\n mini=abs(i10-(k-1)10)\r\nprint(mini)", "input1,input2, input3 = map(int,input().split())\r\nget_inputs = input().split()\r\nsecond_list_inputs = list(map(int, get_inputs))\r\nlist = []\r\nfor i in range(input1):\r\n if second_list_inputs[i] > 0 and second_list_inputs[i] <= input3:\r\n result = abs((i+1)10- input2 10)\r\n list.append(result)\r\n \r\nprint(min(list))", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n\tif i==m-1:\r\n\t\ts=i+1\r\n\telif a[i]<=k and a[i]!=0:\r\n\t\tb.append(i+1)\r\nk=[]\r\nfor i in range(len(b)):\r\n\tl=abs(s-b[i])\r\n\tk.append(l)\r\nprint(min(k)10)", "n, m, k = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\n\nminr = n10\nfor i in range(n):\n if a[i] <= k and abs((i+1)10 - m10) < minr and a[i] != 0:\n minr = abs((i+1)10 - m10)\n\nprint(minr)\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nminlen=200\r\nfor i in range(n):\r\n if (a[i]>0)and(a[i]<=k):\r\n if abs(m-1-i)<minlen:\r\n minlen=abs(m-1-i)\r\nprint(minlen10)\r\n", "def distance(first_house_number, second_house_number):\n return abs(first_house_number - second_house_number + 1) 10\n\n\ndef solver():\n number_of_houses, girl_house_number, budget = map(int, input().split())\n house_prices = [int(x) for x in input().split()]\n distances = [distance(i, girl_house_number) for i in range(number_of_houses) if 0 < house_prices[i] <= budget]\n print(min(distances))\n\n\nif __name__ == \"__main__\":\n solver()\n", "house,gf,money=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nleft,right=(0,0)\r\nfor i in range(gf-2,-1,-1):\r\n if lst[i]!=0:\r\n if lst[i]<=money:\r\n left=i+1\r\n break\r\n else:\r\n left=False\r\nfor j in range(gf,len(lst)):\r\n if lst[j]!=0 and lst[j]<=money:\r\n right=j+1\r\n break\r\n else:\r\n right=False\r\nif left==False:\r\n house=right\r\nelif right==False:\r\n house=left\r\nelif gf-left<right-gf:\r\n house=left\r\nelse:\r\n house=right\r\nprint(abs(gf-(house))10)", "n, m, k = [int(x) for x in input().split()]\r\nhouses = [int(x) for x in input().split()]\r\nm -= 1\r\nl = m - 1\r\nr = m + 1\r\nminDis = 10001\r\nwhile l >= 0 or r < n:\r\n if l >= 0 and houses[l] != 0 and houses[l] <= k:\r\n if abs(l - m) 10 < minDis:\r\n minDis = abs(l - m) * 10\r\n if r < n and houses[r] != 0 and houses[r] <= k:\r\n if abs(r - m) * 10 < minDis:\r\n minDis = abs(r - m) * 10\r\n l -= 1\r\n r += 1\r\nprint(minDis)", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import \r\n# from itertools import \r\n# import random\r\nn, m, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\npos = m - 1\r\nif pos == 0:\r\n dis = 0\r\n for i in range(1, n):\r\n if arr[i] == 0:\r\n dis += 10\r\n continue\r\n elif arr[i] > k:\r\n dis += 10\r\n continue\r\n elif arr[i] <= k:\r\n dis += 10\r\n break\r\n print(dis)\r\nelse:\r\n dis1 = 0\r\n dis = 0\r\n flag = 0\r\n flag1 = 0\r\n for i in range(pos - 1, -1, -1):\r\n if arr[i] == 0:\r\n dis += 10\r\n continue\r\n elif arr[i] > k:\r\n dis += 10\r\n continue\r\n elif arr[i] <= k:\r\n dis += 10\r\n flag = 1\r\n break\r\n for i in range(pos + 1, n):\r\n if arr[i] == 0:\r\n dis1 += 10\r\n continue\r\n elif arr[i] > k:\r\n dis1 += 10\r\n continue\r\n elif arr[i] <= k:\r\n dis1 += 10\r\n flag1 = 1\r\n break\r\n if flag == 1 and flag1 == 0:\r\n print(dis)\r\n elif flag == 0 and flag1 == 1:\r\n print(dis1)\r\n elif flag == 1 and flag == 1:\r\n print(min(dis, dis1))\r\n", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nloh = []\r\nfor i in range(n):\r\n if a[i] <= k and a[i] != 0:\r\n loh.append(abs(i-m+1))\r\nprint(min(loh)10)\r\n", "n,m,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ndist = 109\r\nfor i in range(n):\r\n if a[i] > 0 and a[i] < k + 1:\r\n dist = min(dist, abs(m-i-1)10)\r\nprint (dist)\r\n", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = []\r\nfor i in range(n):\r\n if a[i]!=0 and a[i]<=k:\r\n b.append(abs(m-(i+1)))\r\nprint(10min(b))", "\r\nch=input().split(' ')\r\nn=int(ch[0])\r\nm=int(ch[1])\r\nk=int(ch[2])\r\na=input().split(' ')\r\nd=999999999\r\nfor i in range(n):\r\n if int(a[i])!=0 and int(a[i])<=k and abs(i-m+1)10<=d:\r\n d=abs(i-m+1)10\r\nprint(d)\r\n", "firstLine = input().split()\r\nn = int(firstLine[0])\r\nm = int(firstLine[1]) - 1\r\nk = int(firstLine[2])\r\nsecondLine = input().split()\r\nfor i in range(1, n):\r\n if i <= m:\r\n if int(secondLine[m - i]) <= k and int(secondLine[m - i]) != 0:\r\n print(10 i)\r\n break\r\n if i + m < n:\r\n if int(secondLine[i + m]) <= k and int(secondLine[m + i]) != 0:\r\n print(10 * i)\r\n break", "n,m,k = map(int,input().split())\r\nh = list(map(int,input().split()))\r\nh1 = [abs(i+1-m) for i in range(n) if h[i]!=0 and h[i]<=k]\r\nprint(10min(h1))", "n,m,k=map(int,input().split())\r\nhouse=list(map(int,input().split()))\r\nm-=1\r\nlist_1=house[m:]\r\nlist_2=house[:m+1]\r\nlist_2=list_2[::-1]\r\nresult=[]\r\nfor val in list_1:\r\n if k>=val and val!=0:\r\n result.append(list_1.index(val))\r\n break\r\nfor val in list_2:\r\n if k>=val and val!=0:\r\n result.append(list_2.index(val))\r\n break\r\nprint(min(result)10)", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nz=a[m-1]\r\nx=[]\r\nfor i in range(len(a)):\r\n if(a[i]!=0 and a[i]<=k and a[i]!=z):\r\n if(i>m-1):\r\n x.append(i-(m-1))\r\n else:\r\n x.append((m-1)-i)\r\nprint(10min(x))", "def solve():\r\n n, m, k = map(int, input().split())\r\n numbers = tuple(map(int, input().split()))\r\n result = []\r\n \r\n for i in range(n):\r\n if numbers[i]:\r\n result.append([abs(m - i - 1), numbers[i]])\r\n \r\n result.sort(key=lambda x: x[0])\r\n \r\n for i in result:\r\n if i[1] <= k:\r\n print(i[0] 10)\r\n \r\n break\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\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 get_chars_list():\r\n return list(input().strip())\r\n \r\nn,m, k = get_ints()\r\narr = get_list()\r\n\r\nclosest = 100000000\r\n\r\nfor i in range(0,n):\r\n if i+1 != m and arr[i] != 0 and arr[i] <= k:\r\n distance = abs(m - (i+1))\r\n closest = min(closest, distance)\r\nprint(closest10)\r\n \r\n ", "# import sys \r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nn,m,k=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nm=m-1\r\nans=float('inf')\r\nfor i in range(n):\r\n\tif L[i]<=k and L[i]!=0:\r\n\t\tx=abs(m-i)\r\n\t\tif x<ans:\r\n\t\t\tans=x\r\nprint(ans10) ", "a,b,c=(int(x) for x in input().split())\ncasas=[]\nfor l in input().split():\n casas.append(int(l))\npossiveis=[]\nfor n in range(0,a):\n if c>=casas[n] and casas[n]!=0:\n possiveis.append(n+1)\nreal=[]\nfor d in possiveis:\n real.append(abs(b-d))\npos=min(real)\ndist=pos10\nprint(dist)\n\n \t \t \t \t \t\t \t \t\t\t", "n, girl, money = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ngirl -= 1\r\nans = 100000000\r\n\r\nfor i, x in enumerate(arr):\r\n if x != 0:\r\n if x <= money:\r\n if abs(i-girl) < ans:\r\n ans = abs(i-girl)\r\nprint(ans 10)", "# @author Matheus Alves dos Santos\n\nn_houses, girl_house, money = map(int, input().split())\nhouse_costs = list(map(int, input().split()))\ngirl_house -= 1\n\nmin_distance = 100000\n\nfor i in range(girl_house - 1, -1, - 1):\n if house_costs[i] > 0 and house_costs[i] <= money:\n distance = (girl_house - i) * 10\n if distance < min_distance:\n min_distance = distance\n\nfor i in range(girl_house + 1, len(house_costs)):\n if house_costs[i] > 0 and house_costs[i] <= money:\n distance = (i - girl_house) * 10\n if distance < min_distance:\n min_distance = distance \n\nprint(min_distance)\n", "num_casas, pos_casa, dinheiro = [int(x) for x in input().split()]\r\n\r\nlista = [int(x) for x in input().split()]\r\ndistancia = []\r\n\r\nfor i in range(num_casas):\r\n if lista[i] != 0 and lista[i] <= dinheiro:\r\n distancia.append(abs(pos_casa-(i + 1)))\r\n\r\nresultado = min(distancia) * 10\r\nprint(resultado)", "n,m,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nh=[]\r\nfor i in range(len(a)):\r\n if a[i]==0:\r\n continue\r\n if a[i]<=k:\r\n h.append(i+1)\r\nb=9999\r\nfor i in h:\r\n if abs(m-i)<b:\r\n b=abs(m-i)\r\nprint(b10)", "inp = input().split()\nn = int(inp[0])\nm = int(inp[1])\nk = int(inp[2])\nhouses = input().split()\n\ndistance = n\nfor i in range(n):\n house = int(houses[i])\n if(house > 0 and house <= k):\n current = abs(m -1 -i)\n if current < distance:\n distance = current\n\nprint(distance 10)\n\n \t \t \t\t\t \t\t\t \t \t \t \t \t", "n,m,k=map(int, input().split())\r\nv=list(map(int, input().split()))\r\nx=[]\r\nfor i in range(n):\r\n if v[i]<=k and v[i]!=0:\r\n x.append(abs(m-1-i)10)\r\nx.sort()\r\nprint(x[0])\r\n", "import sys\r\n\r\nn, m, k = map(int, input().split())\r\nan = list(map(int, sys.stdin.readline().split()))\r\nans = 0\r\n\r\nm -= 1\r\nwhile True:\r\n ans += 1\r\n p = m-ans\r\n if p >= 0 and an[p] > 0 and k >= an[p]:\r\n break\r\n p = m+ans\r\n if p < n and an[p] > 0 and k >= an[p]:\r\n break\r\n\r\nprint(10ans)\r\n", "n, m, k = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in range(len(a) ):\r\n if a[i] != 0 and a[i] <= k:\r\n b.append(abs(i + 1 - m))\r\nprint(min(b) * 10)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "string=input()\r\ns=string.split()\r\nn=int(s[0])\r\nm=int(s[1])\r\nk=int(s[2])\r\nstring1=input()\r\na=string1.split()\r\nfor i in range(len(a)):\r\n a[i]=int(a[i])\r\nindex=m-1\r\nindex_right=-1 \r\nindex_left=-1 \r\nfor i in range(index+1,len(a)):\r\n if(a[i]!=0 and a[i]<=k):\r\n index_right=i \r\n break \r\nfor i in range(index-1,-1,-1):\r\n if(a[i]!=0 and a[i]<=k):\r\n index_left=i \r\n break\r\nif(index_right==-1 and index_left!=-1):\r\n ans=index-index_left\r\n print(ans10)\r\nelif(index_left==-1 and index_right!=-1):\r\n ans=index_right-index\r\n print(ans10)\r\nelif((index-index_left)<(index_right-index)):\r\n ans=index-index_left\r\n print(ans10)\r\nelif((index_right-index)<(index-index_left)):\r\n ans=index_right-index\r\n print(ans10)\r\nelif((index-index_left)==(index_right-index)):\r\n ans=index_right-index\r\n print(ans10)", "n, m, k = map(int, input().split())\n\ncasas = list(map(int, input().split()))\n\nm = m-1\n\ndistanciaMin = n+1\n\nfor i in range(n):\n distancia = abs(m-i)\n if (casas[i] > 0) and (distancia <= distanciaMin) and (casas[i] <= k):\n distanciaMin = distancia\n\nprint(distanciaMin10)\n\t \t \t \t\t \t \t \t \t\t \t\t\t \t", "# https://codeforces.com/problemset/problem/796/A\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nhouses = tuple(map(int, input().split()))\r\n\r\nmin_distance = float('inf')\r\n\r\nfor i in range(n):\r\n if houses[i] == 0:\r\n continue\r\n if i == m - 1:\r\n continue\r\n\r\n if houses[i] <= k:\r\n min_distance = min(min_distance, abs(m - 1 - i))\r\nprint(min_distance10)\r\n", "a,b,c = map(int,input().split()); lis2 = []; lis3 = []\nlis = list(map(int,input().split()))\nfor i in range(len(lis)):\n if lis[i]<=c and lis[i]!=0:\n lis2.append(i+1)\nfor i in range(len(lis2)):\n lis3.append(abs(lis2[i]-b))\nprint(min(lis3)10)\n \t\t\t \t\t \t \t \t \t\t\t \t \t \t \t\t", "n, rumah_gebetan, budget = map(int, input(). split ())\ndaftar_harga_rumah = list(map(int, input(). split()))\n\njarak_terpendek = 1000000000\nposisi_rumah_sekarang = 1\n\nfor harga_rumah in daftar_harga_rumah:\n \n if harga_rumah > 0 and harga_rumah <= budget:\n jarak_ke_rumah_gebetan = abs(posisi_rumah_sekarang - rumah_gebetan)\n\n if jarak_ke_rumah_gebetan < jarak_terpendek:\n jarak_terpendek = jarak_ke_rumah_gebetan\n\n posisi_rumah_sekarang += 1\n\nprint(jarak_terpendek * 10)\n \t \t \t\t \t\t \t \t\t \t\t \t\t \t", "a = list(map(int, input().split()))\r\nn, g, k = a[0], a[1], a[2]\r\nprices = list(map(int, input().split()))\r\nminn = n * 10\r\nfor i in range(len(prices)):\r\n if i >= g:\r\n v = (i - g + 1) * 10\r\n else:\r\n v = (g - i - 1) * 10\r\n if prices[i] != 0 and prices[i] <= k and v < minn:\r\n minn = v\r\n \r\nprint(minn)\r\n ", "n, m, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\n\r\nres = 10 * min(abs(i - (m-1)) \r\n for i, p in enumerate(lst) \r\n if p!=0 and p <=k)\r\nprint(res)", "n, m, k = map(int, input().split()) \nm -= 1\na = list(map(int, input().split()))\ndist = 1e9\nfor i in range(n):\n\tif a[i] <= k and a[i] != 0:\n\t\tdist = min(dist,abs(i-m)10)\n\nprint(dist)\n", "import math\r\n\r\nn, m, k = [int(i) for i in input().split()]\r\n\r\nhouses = [int(i) for i in input().split()]\r\n\r\nptr1 = m-1\r\nptr2 = m\r\n\r\npos1 = -1\r\npos2 = -1\r\n\r\nfor i in range(ptr1,-1,-1):\r\n if houses[i] <= k and houses[i]!=0:\r\n pos1 = i\r\n break\r\n\r\nfor i in range(ptr2,n):\r\n if houses[i] <= k and houses[i]!=0:\r\n pos2 = i\r\n break\r\n\r\nd1 = math.inf\r\nd2 = math.inf\r\n\r\nif pos1!=-1:\r\n d1 = (m-1) - pos1\r\n\r\nif pos2!=-1:\r\n d2 = pos2 - (m-1)\r\n\r\nk = min(d1, d2) 10\r\nprint(k)", "n, m, k = map(int, input().split())\r\nprices = list(map(int, input().split()))\r\nleft = prices[:m-1][::-1]\r\nright = prices[m:]\r\ntail = [0] * max(m - 1, n - m)\r\nleft += tail\r\nright += tail\r\nfor i, (l, r) in enumerate(zip(left, right)):\r\n if 0 < l <= k or 0 < r <= k:\r\n break\r\nprint(i * 10 + 10)", "n,m,k1=[int(i) for i in input().split()]\r\na=[int(j) for j in input().split()]\r\ndist=10000\r\nfor k in range(n):\r\n if k+1<m:\r\n if a[k]!=0 and a[k]<=k1:\r\n dist=min(dist,((m-k-1)10))\r\n elif k+1>m:\r\n if a[k]!=0 and a[k]<=k1:\r\n dist=min(dist,((k+1-m)10))\r\nprint(dist)", "import sys\r\n\r\ndef main():\r\n n, m, k, l = map(int, sys.stdin.read().strip().split())\r\n return min(abs(i - m) for i, j in enumerate(l, 1) if j and k >= j)10\r\n \r\nprint(main())\r\n", "n, m, k = map(int,input().split())\r\nnum = list(map(int, input().split()))\r\nm-=1\r\n\r\nx=101\r\ny=101\r\n\r\nfor i in range(m+1, n):\r\n if num[i]<= k and num[i]!=0 :\r\n x = i-m\r\n break\r\n\r\nfor j in range(0,m) :\r\n if num[j]<=k and num[j]!=0 :\r\n y=m-j\r\n\r\nans=[x,y]\r\n\r\nprint(min(ans) * 10)\r\n\r\n\r\n\r\n\r\n", "n,m,d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nk = []\r\nfor i in range(n):\r\n if 0 < l[i] <= d:\r\n k.append(abs((i+1)10-m10))\r\nprint(min(k))\r\n", "n, m, k = map(int, input().split(' '))\r\nm -= 1\r\narr = [int(x) for x in input().split(' ')]\r\nd = 1\r\nwhile m - d >= 0 or m + d < n:\r\n left = max(m - d, 0)\r\n right = min(m + d, n - 1)\r\n if 0 < arr[left] <= k or 0 < arr[right] <= k:\r\n print(d * 10)\r\n break\r\n d += 1\r\nelse:\r\n print(-1)", "n, m, k = map(int, input().split())\na = [0] + list(map(int, input().split()))\nres = n * 10\nfor i in range(1, n + 1):\n if a[i] and i != m and k >= a[i]:\n res = min(res, abs(m - i) * 10)\nprint(res)\n\n\t \t \t\t \t \t \t \t\t \t \t \t \t", "n,m,d = map(int,input().split())\r\nlista = list(map(int,input().split()))\r\nk = []\r\nfor i in range(n):\r\n if 0 < lista[i] <= d:\r\n k.append(abs((i+1)10-m10))\r\nprint(min(k))", "n, m, k = map(int, input().split())\r\na, = map(int, input().split())\r\nmn = 1000\r\nfor i in range(n):\r\n if a[i] != 0 and k >= a[i]:\r\n mn = min(mn, abs(m - i - 1) 10)\r\nprint(mn)\r\n", "info = input().split()\ngeo = input().split()\n\nnum_casas = int(info[0])\npos_menina = int(info[1])\ndinheiro = int(info[2])\n\ndistancia = 0\nindex_count = 0\n\nfor elemento in geo:\n elemento = int(elemento)\n if(elemento!=0 and elemento<=dinheiro):\n medicao = index_count - (pos_menina-1)\n if(medicao<0):\n medicao = medicao(-1)\n if((distancia == 0) or (medicao<distancia)):\n distancia = medicao\n index_count += 1\n \nprint(distancia10)\n \t\t\t\t \t\t \t\t \t\t \t\t\t \t\t \t \t\t\t \t", "from math import ceil,gcd,factorial,sqrt,floor\r\nimport queue\r\nimport re\r\n# from functools import reduce\r\nfrom itertools import permutations,combinations,accumulate\r\nfrom collections import Counter,deque\r\nfrom sys import stdin,stdout\r\nfrom bisect import bisect,insort,bisect_left,insort_left\r\n#bisect=upper_bound,bisect_left=lower_bound\r\ndef sieve(meta_path):\r\n prime = [True](meta_path+1)\r\n p = 2\r\n while (p p <= meta_path):\r\n if (prime[p] == True):\r\n for x in range(p * p, meta_path+1, p):\r\n prime[x] = False\r\n p += 1\r\n return prime\r\ndef simplesieve(meta_path):\r\n prime=[2]\r\n mark=[False](meta_path+1)\r\n for p in range(3,meta_path+1,2):\r\n if(mark[p]==False):\r\n prime.append(p)\r\n if(pp<=meta_path):\r\n for x in range(pp,meta_path+1,2p):\r\n mark[x]=True\r\n return mark\r\ndef segementedsieve(low,high):\r\n limit=int(sqrt(high))\r\n primes=simplesieve(limit)\r\n prime = [True] * (high-low + 1)\r\n for x in primes:\r\n lower = (low//x)\r\n if lower <= 1:\r\n lower = x+x\r\n elif (low % x) != 0:\r\n lower = (lower * x) + x\r\n else:\r\n lower = lowerx\r\n for y in range(lower, high+1, x):\r\n prime[y-low] = False\r\n s1=[]\r\n c=0\r\n for l in range(low, high + 1):\r\n if prime[l-low]:\r\n s1.append(l)\r\n return s1\r\ndef isprime(meta_path):\r\n if(meta_path==2):\r\n return True\r\n if(meta_path%2==0 or meta_path==1):\r\n return False\r\n for x in range(3,int(meta_path0.5)+1,2):\r\n if(meta_path%x==0):\r\n return False\r\n return True\r\ndef binpow(s1,s2,m):\r\n r2=1\r\n s1=s1%m\r\n while(s2>0):\r\n if(s2&1):\r\n r2=(r2s1)%m\r\n s1=(s1s1)%m\r\n s2>>=1\r\n return r2\r\ndef lcm(s1,s2):\r\n return (s1//gcd(s1,s2))s2\r\n#gcd(s1,s2)=ax+by and \r\ndef gcdExtended(s1,s2): \r\n if(s2==0): \r\n return s1,1,0\r\n g,x1,y1=gcdExtended(s2,s1%s2) \r\n x = y1 \r\n y = x1-(s1//s2)y1\r\n return g,x,y\r\ndef dfs(graph,m,x):\r\n v=[0](m+1)\r\n v[x]=1\r\n s1=[x] \r\n z=0\r\n while(s1!=[]):\r\n l=s1.pop()\r\n for x in graph[l]:\r\n if(v[x]==0):\r\n v[x]=1\r\n s1.append(x)\r\n return \"no\"\r\ndef bfs(graph,m,s,v):\r\n #v=[0]meta_path\r\n # d=[0]meta_path\r\n #d=[-1]1000\r\n #d[s]=0\r\n v[s]=1\r\n q=queue.Queue()\r\n q.put(s)\r\n p=[0]m\r\n p[s]=-1\r\n while(not q.empty()):\r\n z=q.get()\r\n for y in graph[z]:\r\n if(v[y]==0):\r\n v[y]=1\r\n q.put(y)\r\n #d[y]=d[z]+1\r\n p[y]=z\r\n path=[]\r\n #x=dest#given\r\n while(x!=-1):\r\n path.append(x)\r\n x=p[x]\r\n path.reverse()\r\n #?print(d)\r\n return \"no\"\r\n#s1.sort(key = lambda x: x[0],reverse=True)\r\n#for _ in range(int(input())):\r\nn,m,k=map(int,input().split())\r\n#n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nm1=10000000\r\nfor i in range(m,n):\r\n if(a[i]<=k and a[i]!=0):\r\n m1=i-m+1\r\n break\r\nm2=1000000\r\nfor j in range(m-1,-1,-1):\r\n # print(j)\r\n if(a[j]<=k and a[j]!=0):\r\n m2=m-j-1\r\n break\r\n# print(m1,m2)\r\nprint(min(m2,m1)10)\r\n\r\n", "n,m,k=input().split()\r\nn,m,k=int(n),int(m),int(k)\r\nd=0\r\nl2=[]\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tif k>=l[i] and l[i]!=0:\r\n\t\td=abs(m-(i+1))\r\n\t\tl2.append(d)\r\nprint(min(l2)10)", "n, m, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nprint(min([abs(i - m) * 10 for i in range(1, n + 1) if 0 < a[i - 1] <= k]))", "n,m,k=map(int,input().split())\r\nr=[map(int,input().split())]\r\nmini=10000\r\nfor i in range(n):\r\n if r[i] and k>=r[i]:mini=min(mini,abs(m-i-1)10)\r\nprint(mini)", "n, m, k = map(int, input().split())\r\nm -= 1\r\nl = list(map(int, input().split()))\r\ndist = 9999999999\r\nfor i in range(n):\r\n if l[i] != 0 and l[i] <= k:\r\n dist = min(dist, abs(m-i)10)\r\nprint(dist)\r\n", "\r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncounter = n + 1\r\nfor i in range(n):\r\n if a[i] <= k and abs(i - (m - 1)) <= counter and a[i] is not 0:\r\n counter = abs(i - (m - 1))\r\nprint(counter 10)\r\n\r\n# CodeForcesian\r\n# ♥\r\n# حالم خوبه\r\n\r\n", "[n , m, k] = list(map(int,input().split(\" \")))\r\na = list(map(int,input().split(\" \")))\r\nm = m - 1\r\nl = m - 1\r\nr = m + 1\r\nd = 0\r\nwhile(l >= 0 or r < n): \r\n if(l >= 0 and a[l] != 0 and a[l] <= k):\r\n d = m - l\r\n break\r\n if(r < n and a[r] != 0 and a[r] <= k):\r\n d = r - m\r\n break\r\n l -= 1\r\n r += 1 \r\nprint(d10)\r\n", "n, m, k = map(int, input().split())\r\nm -= 1\r\na = [int(i) for i in input().split()]\r\nb = []\r\nfor i in range(n):\r\n if 0 < a[i] <= k:\r\n b.append(10 abs(i - m))\r\nb.sort()\r\nprint(b[0])", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=10*10\r\nm=m-1\r\nfor i in range(n):\r\n if(l[i]<=k and i!=m and l[i]!=0):\r\n x=abs(i-m)\r\n z=x10\r\n if(z<c):\r\n c=z\r\nprint(c)\r\n", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = m-1\r\nl = []\r\nfor i in range(n):\r\n if(a[i]<=k and a[i]!=0):\r\n #print(\"i: \",i,\" d: \",d,\" i-d: \",i-d)\r\n dist = abs(i-d)10\r\n l.append(dist)\r\n \r\nprint(min(l))\r\n", "n,m,k = map(int,input().split())\r\nl = list([int(x) for x in input().split()])\r\nd={}\r\nfor i in range(n):\r\n if(l[i]==0):\r\n continue\r\n else:\r\n if(l[i]<=k):\r\n if(m>i+1):\r\n d[i+1]=(m-(i+1))10\r\n else:\r\n d[i+1]=((i+1)-m)10\r\nprint(min(d.values()))", "n,m,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 99999999999999999\r\nfor i in range(n):\r\n if l[i] <= k and l[i] != 0 and abs(i-m+1)<ans:\r\n ans = abs(i-m+1)\r\n # print(i,ans)\r\nprint(ans10) ", "q = list(map(int,input().split()))\r\nn = q[0]\r\nm = q[1]-1\r\nk=q[2]\r\na = input().split(\" \")\r\nfor t in range(1,n):\r\n if (m-t >=0 and int(a[m-t])!=0 and int(a[m-t])<=k):\r\n print(t10)\r\n break\r\n elif (t+m<n and int(a[m+t])!=0 and int(a[m+t])<=k):\r\n print(t10)\r\n break\r\n", "n, m, k = map(int, input().split())\r\nprint(min(abs(i) for i, a in enumerate(map(int, input().split()), 1 - m) if 0 < a <= k) * 10)", "n, m, cash = input().split()\nhouses = input().split()\nbuyable = []\n\nfor i in range(len(houses)):\n if int(houses[i]) <= int(cash) and int(houses[i]) != 0 :\n buyable.append(i+1)\n\nfor i in range(len(buyable)):\n buyable[i] = abs(buyable[i] - int(m))\n\nprint(min(buyable)10)\n\t\t\t\t\t \t \t\t\t\t \t\t\t\t\t \t\t \t\t \t", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nmn=1000000\r\nfor i in range(n):\r\n\tif a[i]!=0 and a[i]<=k:\r\n\t\tmn=min(mn,abs(m-i-1)10)\r\nprint(mn)", "#!/usr/bin/env python3\n#-- coding: utf-8 --\n\"\"\"\nCreated on Sat Apr 29 20:17:43 2017\n\n@author: Dalian, on Dantalian\n\"\"\"\n\nA = list(map(int,input().split()))\nAi = list(map(int,input().split()))\n\nn = A[0]\nm = A[1]\nk = A[2]\n\nd = n\n\nfor i in range(1,n+1):\n if 0<Ai[i-1]<=k and d>abs(m-i):\n d = abs(m-i)\n\nprint(d10)", "line = input()\nn,m,k = [int (i) for i in line.split()]\nline2 = input()\nline2 = line2.split()\nr = 100\n\nfor i in range (1, n+1):\n if int (line2[i-1]) != 0 and int (line2[i-1]) <= k:\n r = min(r, abs(i-m))\nprint(r10)\n\t\t\t \t\t\t\t \t \t\t \t \t\t \t \t\t \t\t", "n, m, k = map(int,input().split())\r\ns = list(map(int,input().split())); c = []\r\nfor i in range(n):\r\n if s[i]<=k and s[i]!=0: c.append(i+1)\r\nans = 99999999999\r\nfor i in range(len(c)):\r\n if abs(m-c[i])<ans:\r\n ans = abs(m-c[i])\r\nprint(ans10)", "def get_int():\n from sys import stdin\n return int(stdin.readline().replace('\\n', ''))\n\ndef get_int_list():\n from sys import stdin\n return [int(x) for x in stdin.readline().replace('\\n','').split(' ')]\n\ndef get_str():\n from sys import stdin\n return stdin.readline().replace('\\n','')\n\ndef buy_house(num_girl, dollars, village):\n dist = 10e9\n for i in range(len(village)):\n checking_distance = num_girl-i\n if checking_distance != 0 and village[i]!=0 and abs(checking_distance) < dist and village[i] <= dollars:\n dist = abs(checking_distance)\n return dist10\n\nn,m,k = get_int_list()\nvillage = get_int_list()\nprint(buy_house(m-1,k, village))\n\n\t \t\t\t\t\t \t \t\t\t\t\t\t\t \t\t\t \t \t\t \t", "q = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\na = q[0]\r\n\r\nfor i in range(q[0]):\r\n if h[i] != 0 and h[i] <= q[2] and abs(i-q[1]+1) <= a:\r\n a = abs(i-q[1]+1)\r\n \r\nprint(10a)\r\n ", "n, m, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nprint(min([abs(i-m)10 for i in range(1, n+1) if 0 < a[i-1] <= k]))\r\n", "n,m,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n \r\nd = {}\r\nm-=1\r\nfor i in range(len(a)):\r\n if a[i]!=0:\r\n d[i] = abs(i-m)10\r\n\r\nfor i, di in sorted(d.items(), key=lambda x: x[1]):\r\n if a[i]<=k:\r\n print(d[i])\r\n break", "n, m, k = map(int, input().split())\nA = list(map(int, input().split()))\n\ndef solve(n,m,k,A):\n izq, der = 0, n-1\n mIzq, mDer = 999, 999\n while izq < m-1:\n if 0 < A[izq] <= k:\n mIzq = izq\n izq += 1\n while m-1 < der:\n if 0 < A[der] <= k:\n mDer = der\n der -= 1\n dI = abs(m-1-mIzq)\n dD = abs(m-1-mDer)\n print(min(dI, dD)10)\n\nsolve(n,m,k,A)", "n,m,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nm-=1\r\nd=[]\r\nfor i in range(m+1,n):\r\n if a[i]!=0 and k>=a[i]:\r\n d+=[i-m]\r\n break\r\n\r\nfor i in range(m-1,-1,-1):\r\n if a[i]!=0 and k>=a[i]:\r\n d+=[m-i]\r\n break\r\n\r\nprint(min(d)10)\r\n", "INF = 2e5\r\n\r\nif __name__ == \"__main__\":\r\n n, m, k = map(int, input().split())\r\n m -= 1\r\n aa = list(map(int, input().split()))\r\n print(10 min(map(lambda a: abs(a[0] - m) if a[1] and a[1] <= k else INF, enumerate(aa))))\r\n", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))[:n]\r\np = []\r\nfor i in range(0, n):\r\n if a[i] != 0:\r\n if a[i] <= k:\r\n p.append(abs(i-(m-1)))\r\nc = min(p)\r\nprint(c10)", "n,m,k = list(map(int,input().split()))\r\nhouse = list(map(int,input().split()[:n]))\r\n\r\ncrush = m-1\r\ndistance = []\r\n\r\nfor i in range(len(house)):\r\n\tif house[i] == 0:\r\n\t\tcontinue\r\n\telif house[i] > k:\r\n\t\tcontinue\r\n\telse:\r\n\t\td = (max(i-crush,crush-i)10)\r\n\t\tdistance.append(d)\r\n\r\nprint(min(distance))", "n,m,k = map(int,input().split())\r\nl=list(map(int,input().split()))\r\na1=1000\r\nfor i in range(m-1):\r\n\tif(l[i]<=k and l[i]!=0):\r\n\t\ta1=(m-1-i)10\r\na2=1000\r\nfor i in range(m,n):\r\n\tif(l[i]<=k and l[i]!=0):\r\n\t\ta2=(i-m+1)10\r\n\t\tbreak\r\nprint(min(a1,a2))\r\n\r\n", "def main():\n [n, m, k] = [int(_) for _ in input().split()]\n prices = [0] + [int(_) for _ in input().split()]\n\n try:\n next_left = next(i for i in range(m - 1, 0, -1) if 0 < prices[i] <= k)\n except StopIteration:\n next_left = -1\n\n try:\n next_right = next(i for i in range(m + 1, n + 1) if 0 < prices[i] <= k)\n except StopIteration:\n next_right = -1\n\n if next_left == -1:\n print(10 * (next_right - m))\n elif next_right == -1:\n print(10 * (m - next_left))\n else:\n print(10 * min(m - next_left, next_right - m))\n\n\nif __name__ == '__main__':\n main()\n", "n, m, k = map(int,input().split())\r\nhouses = list(map(int,input().split()))\r\nresult = []\r\nfor i in range(n):\r\n if 0 < houses[i] <= k:\r\n result.append(abs((i+1)10-m10))\r\nprint(min(result))", "houses , girl , money = map(int , input().split(\" \"))\ncosts = list(map(int , input().split(\" \")))\n\ncan_afford = [(costs[i] , i+1) for i in range(houses) if (money - costs[i]) >= 0 and costs[i] != 0]\n\namt = [i[0] for i in can_afford]\nhouse_no = [abs(i[1] - girl) for i in can_afford ]\n\nprint(min(house_no) * 10)\n", "n,m,t=map(int,input().split(\" \"))\nl=list(map(int,input().split(\" \")))\ncount=0\ntotal=0\ni=m-2\nj=m\nwhile i>=0 or j<=n-1:\n\tS=1\n\tL=1\n\tif i>=0:\n\t\tcount=count+10\n\t\tif l[i]>0 and l[i]<=t:\n\t\t\tS=0\n\t\ti=i-1\n\tif j<=n-1:\n\t\ttotal=total+10\n\t\tif l[j]>0 and l[j]<=t:\n\t\t\tL=0\n\t\tj=j+1\n\tif L==0 and S==0:\n\t\tif count<=total:\n\t\t\tprint(count)\n\t\t\tbreak\n\t\telse:\n\t\t\tprint(total)\n\t\t\tbreak\n\telif L==0:\n\t\tprint(total)\n\t\tbreak\n\telif S==0:\n\t\tprint(count)\n\t\tbreak\n\n", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nminimum_distance = 10 * n\r\n\r\nfor i in range(1, n + 1):\r\n if i != m and a[i - 1] != 0:\r\n if a[i - 1] <= k:\r\n distance = 10 * abs(i - m)\r\n if distance < minimum_distance:\r\n minimum_distance = distance\r\nprint(minimum_distance)", "n,m,p=map(int, input().split())\r\nl=[int(x) for x in input().split()]\r\ndistance_left=0\r\ndistance_right=0\r\ni=m-2\r\nwhile i>=0:\r\n if l[i]<=p and l[i]!=0:\r\n distance_left=m-1-i\r\n break\r\n i=i-1\r\nj=m\r\nwhile j<n:\r\n if l[j]<=p and l[j]!=0:\r\n distance_right=j-(m-1)\r\n break\r\n j=j+1\r\nif distance_left==0 or distance_right==0:\r\n print(max(distance_left,distance_right)10)\r\nelse:\r\n print(min(distance_left,distance_right)10)\r\n", "# 408A\r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n\tif a[i] and a[i] <= k:\r\n\t\ta[i] = abs(i - m+1)\r\n\telse:\r\n\t\ta[i] = 100\r\nprint(min(a)10)", "n,m,k= map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount=[]\r\nfor i in range(1,n+1):\r\n if a[i-1]==0 or a[i-1]>k:\r\n continue\r\n else:\r\n count.append(abs(m-i)10)\r\nprint(min(count))", "\r\nx, y, z=map(int, input().split())\r\na=[0]+list(map(int, input().split()))\r\n\r\nb=[]\r\nfor i in range(1,len(a)):\r\n \r\n if z>=a[i] and a[i]!=0:\r\n b. append(abs(y-i))\r\nprint(min(b)10)\r\n \r\n ", "n, m, k=map(int, input().split())\r\na=list(map(int, input().split()))\r\nb=[]\r\n\r\nfor i in range(n):\r\n\tif a[i]!=0:\r\n\t\tif a[i]<=k:\r\n\t\t\tb+=[abs(i-(m-1))]\r\nm=min(b)\r\nprint(m10)", "def main_function():\r\n n, m, k = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n home_index = 10000000000000000\r\n for i in range(len(a)):\r\n if a[i] != 0 and k >= a[i] and home_index > abs(i - m + 1):\r\n home_index = abs(i - m + 1)\r\n return home_index * 10\r\n\r\n\r\n\r\nprint(main_function())\r\n\r\n", "information = input().split(\" \")\nquantHouses = int(information[0])\ncrush = int(information[1]) - 1\nbudget = int (information[2])\n\nhouses = input().split(\" \")\nminorDiff = quantHouses\nfor i in range(quantHouses):\n auxDiff = abs(crush - i)\n houseI = int(houses[i])\n\n if(i != crush and houseI != 0 and (auxDiff < minorDiff) and (budget - houseI) >= 0):\n minorDiff = auxDiff\n\nprint(minorDiff10)\n\n \t \t\t \t \t\t\t \t \t\t \t \t\t\t\t", "n, m, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\na, b = 100, 100\r\nfor i in range(m, n):\r\n if w[i] != 0 and k >= w[i]:\r\n a = i-m+1\r\n break\r\nfor i in range(m-2, -1, -1):\r\n if w[i] != 0 and k >= w[i]:\r\n b = m-1-i\r\n break\r\n if m-1-i > a:\r\n break\r\n\r\nif a > b:\r\n print(b10)\r\nelse:\r\n print(a10)", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output4.out\",'w')\r\nn,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n\tif a[i] and a[i]<=k:\r\n\t\tb.append(abs(m-i-1))\r\nx=min(b)10\r\nprint(x)\r\n", "n, m, k = map(int, input().split())\r\nhouses = [k for k in map(int, input().split())]\r\n\r\ndistance = 10 # meters\r\n\r\nresult = 200 * distance\r\nhouses_left = houses[:m-1]\r\nhouses_right = houses[m:]\r\n\r\nhouses_left = houses_left[::-1]\r\n\r\nfor h in [houses_left, houses_right]:\r\n for i in range(len(h)):\r\n if 0 < h[i] <= k:\r\n result = min(result, (i+1)distance)\r\n\r\nprint(result)\r\n", "# print(\"Input n, m, and k\")\nn,m,k = [int(x) for x in input().split()]\n\n# Make the girls house the correct 0-based integer\nm = m - 1\n\n# print(\"Input the n house values\")\na = [int(x) for x in input().split()]\n\nmindist = float(\"inf\")\nfor i in range(len(a)):\n if a[i] > 0 and a[i] <= k and abs(i-m)10 < mindist:\n mindist = abs(i-m)10\n\nprint(mindist)\n \n\n", "inputs = list(map(int, input().split()))\nn = inputs[0]\nm = inputs[1]\nk = inputs[2]\nhouses = list(map(int, input().split()))\n\nans = n - 1\n\nfor i in range(0, n):\n if i != (m - 1) and houses[i] != 0 and houses[i] <= k:\n curr = abs(m - i - 1)\n ans = min(curr, ans)\n\nans = 10\n\nprint(ans)\n\t \t \t\t \t \t \t\t\t \t \t \t\t", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nprint(min(abs(10(m-i)) for i in range(1,n+1) if 0<a[i-1]<=k))", "x = input().split()\nn = int(x[0])\nm = int(x[1])\nk = int(x[2])\nx = input().split()\narray = []\nfor i in x:\n array.append(int(i))\nidx1 = -10000\nidx2 = -10000\nfor i in range(m-1,-1,-1):\n if array[i] == 0:\n continue\n if k >= array[i]:\n idx1 = i\n break\nfor j in range(m,n):\n if array[j] == 0:\n continue\n if k >= array[j]:\n idx2 = j\n break\nresp1 = abs(idx1-(m-1))\nresp2 = abs(idx2-(m-1))\nif resp1 <= resp2:\n print((resp1)10)\nelse:\n print((resp2)10)\n#Isaias Martins\n#118110593", "import math\r\nn,m,k=map(int,input().split())\r\nhouse=list(map(int,input().split()))\r\nl=-1\r\nr=-1\r\nfor i in range(m-1-1,-1,-1):\r\n if house[i]<=k and house[i]!=0:\r\n l=i+1\r\n #print(l)\r\n break\r\nfor i in range(m-1+1,n):\r\n if house[i]<=k and house[i]!=0:\r\n r=i+1\r\n break\r\n#print(l,r,m)\r\nif l!=-1 and r!=-1:\r\n print(min(abs(l-m),abs(r-m))10)\r\nelif l==-1 :\r\n print(abs(r - m) * 10)\r\nelif r==-1 :\r\n print(abs(l - m) * 10)", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗ \r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝ \r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in range(n):\r\n\tif a[i] <= k and a[i] != 0:\r\n\t\tb += [abs((m - 1) - i)]\r\nprint(min(b) * 10)\r\n", "x, y, z = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\n \r\nb=[]\r\n\r\nfor i in range(1, len(a)):\r\n if z >= a[i] and a[i] != 0:\r\n b.append(abs(y-i))\r\n\r\nprint(min(b)10)", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nmin_d=float('inf')\r\nfor i in range(n):\r\n if l[i]<=k and l[i]!=0:\r\n if abs(((m-1)-i)10)<min_d:\r\n min_d=abs(((m-1)-i)10) \r\nprint(min_d)", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nd=1e9+10\r\nfor i in range(n):\r\n if(a[i]!=0 and a[i]<=k):\r\n d=min(d,abs(m-(i+1)))\r\nprint(d10)", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmin_dist = float('inf')\r\nfor i in range(n):\r\n if a[i] != 0 and a[i] <= k:\r\n min_dist = min(min_dist, abs(i + 1 - m) * 10)\r\nprint(min_dist)", "if __name__ == '__main__':\r\n n, m, k = str(input()).split()\r\n n, m, k = int(n), int(m) - 1, int(k)\r\n line = str(input()).split()\r\n line = [int(it) for it in line]\r\n l, r = n, n\r\n for i in range(m, n):\r\n if 0 < line[i] <= k:\r\n r = i - m\r\n break\r\n for i in range(m - 1, -1, -1):\r\n if 0 < line[i] <= k:\r\n l = m - i\r\n break\r\n print(10 * min(l, r))\r\n", "entrada = input().split()\r\nn = int(entrada[0])\r\nm = int(entrada[1]) \r\nk = int(entrada[2])\r\n\r\na = list(map(int, input().split()))\r\nr = 1\r\nwhile True:\r\n if n > m + r - 1 :\r\n if 0 < a[m + r - 1] <= k:\r\n break\r\n\r\n if 0 <= m - r - 1:\r\n if 0 < a[m - r - 1] <= k:\r\n break\r\n r += 1\r\nprint(r * 10)", "a,b,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor x in range(1,a):\r\n\tif b-1-x>=0 and 0<l[b-1-x]<=c:\r\n\t\tprint(10x)\r\n\t\tbreak\r\n\telif b-1+x<a and 0<l[b-1+x]<=c:\r\n\t\tprint(10x)\r\n\t\tbreak", "n,m,k= [int (x) for x in input().split()]\nprices= [int (x) for x in input().split()]\nleft_side=190000000;\nright_side=13415355;\nfor i in range (m,n):\n if prices[i] != 0 and prices[i]<=k:\n right_side=i-m+1 # distance to house (m-1)\n break\nfor i in range(m-2,-1,-1):\n if prices[i] != 0 and prices[i]<=k:\n left_side=m-i-1 # distance to house (m-1)\n break\nprint(int(min(left_side, right_side)) * 10)\n", "n, m, k = map(int, input().split())\r\na, = map(int, input().split())\r\n\r\nprint(min(abs(m - i) 10 for i, v in enumerate(a, 1) if 0 < v <= k))\r\n", "r,c,p=list(map(int,input().split()))\r\npl=list(map(int,input().split()))\r\nkjl=[]\r\nif c-1!=0 and c!=r:\r\n tam=pl[0:c]\r\n tam=tam[::-1]\r\n for item in tam:\r\n if item<=p and item!=0:\r\n tod=tam.index(item)\r\n kjl.append(tod)\r\n break\r\n for item in pl[c-1:]:\r\n if item<=p and item!=0:\r\n tod=pl[c-1:].index(item)\r\n kjl.append(tod)\r\n break\r\n print(min(kjl)10)\r\nelif c-1==0:\r\n for item in pl:\r\n if item<=p and item!=0:\r\n tod=pl.index(item)\r\n print(tod10)\r\n break\r\nelse:\r\n pl=pl[::-1]\r\n for item in pl:\r\n if item<=p and item!=0:\r\n tod=pl.index(item)\r\n print(tod10)\r\n break\r\n \r\n ", "n,m,k = map(int, input().split())\nm-= 1\n\nlista = list(map(int,input().split()))\n\ncasa = n 15\n\nfor i in range(n):\n\tif 0 < lista [i] <= k:\n\t\tcasa= min(casa,abs(m-i) * 10)\n\t\nprint(casa)\n \t \t\t\t \t \t\t \t \t\t \t", "n, m, k = map(int, input().split())\r\nhome = list(map(int, input().split()))\r\nMin, index = 999999, 0\r\nfor i in range(n):\r\n if home[i] != 0 and home[i] <= k:\r\n Min = min(abs((i + 1) - m) * 10, Min)\r\nprint(Min)\r\n", "b, c, u = map(int, input().split())\nh = list(map(int, input().split()))\nt = 10*9\n\np = 1\nfor i in h:\n \n if i <= u and i > 0:\n j = abs(p - c)\n\n if j < t:\n t = j\n p += 1\n\nprint(t 10)\n\t\t\t \t\t \t \t\t \t \t \t\t \t", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=l[:m]\r\no=l[m:]\r\nz=[]\r\nfor i in range(len(s)):\r\n if s[i]!=0 and s[i]<=k:\r\n z.append((len(s)-1-i)10)\r\nfor j in range(len(o)):\r\n if o[j]!=0 and o[j]<=k:\r\n z.append((j+1)10)\r\n break\r\nprint(min(z))", "# https://codeforces.com/problemset/problem/796/A\n# A. Buying A House\n\nn, m, k = map(int, input().split())\nhouses = list(map(int, input().split()))\n\nm -= 1\nbest_house = -1\n\nfor i, v in enumerate(houses):\n if v != 0 and v <= k:\n if best_house == -1:\n best_house = i\n elif abs(best_house - m) > abs(i - m):\n best_house = i\nprint(abs(best_house - m) * 10)\n", "(houses, where_she_lived, budget) = map(int, input().split(' '))\n\nprices_houses = input().split(' ')\npotential_houses_index = []\n\n\nfor i in range(houses):\n prices_houses[i] = int(prices_houses[i])\n if 0 < prices_houses[i] <= budget:\n potential_houses_index.append(i + 1)\n\ndistance_comparison = []\n\nfor house in potential_houses_index:\n distance_comparison.append(abs(house - where_she_lived) * 10)\n\nprint(min(distance_comparison))\n", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math, fractions, collections\r\n# ===================================\r\nn, m, k = [int(x) for x in input().split()]\r\nq = [int(x) for x in input().split()]\r\nans = []\r\nfor i in range(n):\r\n\tif q[i] != 0:\r\n\t\tif q[i] <= k:\r\n\t\t\tans.append(abs(i-m+1))\r\n# print(ans)\r\nprint(min(ans)10)\r\n\r\n", "qhouses, girlhouse, dallaz = map(int, input().split())\r\n\r\nhouses = list(map(int, input().split()))\r\n\r\nmin_dist = 9999999\r\nfor i, house in enumerate(houses, 1):\r\n if dallaz >= house and house > 0:\r\n newdist = abs(girlhouse - i) \r\n if newdist < min_dist:\r\n min_dist = newdist\r\n\r\n\r\nprint(min_dist 10)", "#796A-Buying A House\r\nn,m,k=[int(x) for x in input().split(' ')]\r\nalist=[int(x) for x in input().split(' ')]\r\nans1=100000\r\nans2=100000\r\nfor i in range(m,n):\r\n if alist[i] != 0 and alist[i] <= k:\r\n ans1=(i-(m-1))10\r\n break\r\nfor i in range(m-1):\r\n if alist[m-2-i] != 0 and alist[m-2-i] <= k:\r\n ans2=10(i+1)\r\n break\r\nprint(min(ans1,ans2))\r\n", "n, m, k = map(int, input().split())\nm -= 1\n\na = list(map(int, input().split()))\n\nans = n * 15\n\nfor i in range(n):\n if 0 < a[i] <= k:\n ans = min(ans, abs(m - i) * 10)\n\nprint(ans)\n \t \t\t \t \t\t\t\t\t \t \t\t \t \t", "n, m, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nl = m - 2\r\nr = m\r\n\r\nwhile l >= 0 and (a[l] == 0 or a[l] > k):\r\n l -= 1\r\n\r\nwhile r < n and (a[r] == 0 or a[r] > k):\r\n r += 1\r\n\r\nm -= 1\r\n\r\nif l >= 0:\r\n dl = m - l\r\n if r < n:\r\n dr = r - m\r\n print(10 * min(dl, dr))\r\n else:\r\n print(10 * dl)\r\nelse:\r\n print(10 * (r - m))", "n, m, k = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nmn = float(\"inf\")\r\nfor i in range(n):\r\n if li[i] <= k and li[i] != 0:\r\n mn = min(mn, abs(m-i-1))\r\nprint(mn10)\r\n\r\n", "import math\r\n\r\nn, m, k = map(int, input().split())\r\nm -= 1\r\na = list(map(int, input().split()))\r\n\r\npos = 100500\r\nfor i in range(n):\r\n if a[i] == 0:\r\n continue\r\n if a[i] > k:\r\n continue\r\n if abs(i - m) < pos:\r\n pos = abs(i - m)\r\n \r\nprint(pos 10)", "n,m,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\nans = n\r\nfor i in range(m-1,n):\r\n if arr[i] and arr[i]<=k:\r\n ans = min(ans,i-m+1)\r\nfor j in range(m-1,-1,-1):\r\n if arr[j] and arr[j]<=k:\r\n ans = min(ans,m-1-j)\r\nprint(ans10)", "n,c,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=[]\r\nfor i in range(len(l)):\r\n if (i+1)!=c and l[i]!=0:\r\n if l[i]<=b:\r\n k=k+[i+1]\r\nk=list(map(lambda x:abs(x-c)10,k))\r\nprint(min(k))\r\n\r\n", "import math\r\n\r\nn, m, k = input().split()\r\ncasas = input().split()\r\n\r\ndist = math.inf\r\nfor i in range(int(n)):\r\n a = int(casas[i])\r\n if(a != 0 and a <= int(k)):\r\n dist = min(dist, abs((i+1)-int(m)))\r\n\r\nprint(dist10)", "def main():\n n, m, k = [int(x) for x in input().split()]\n casas = [int(x) for x in input().split()]\n casas_compraveis = [i+1 for i, casa in enumerate(casas) if casa <= k and casa != 0]\n print(casa_perto(m, casas_compraveis)10)\n \ndef casa_perto(m, lista):\n Min = abs(m - lista[0])\n for i in lista:\n dist = abs(m - i)\n if dist < Min:\n Min = dist\n return Min\n\nmain()\n\t\t\t \t\t \t\t \t\t \t\t \t\t \t\t \t", "n,m,k=map(int,input().split())\r\nprint(min(abs(i) for i,a in enumerate(map(int,input().split()),1-m)if 0<a<=k)10)", "def convert_to_int_array(array):\r\n return [int(i) for i in array]\r\n\r\n\r\nfirst_input = input().split()\r\nsecond_input = input().split()\r\n\r\nhouses_price = convert_to_int_array(second_input)\r\nfirst_input_int_list = convert_to_int_array(first_input)\r\nqtt_houses = first_input_int_list[0]\r\ngirls_house = first_input_int_list[1]\r\nzanes_money = first_input_int_list[2]\r\n\r\n\r\n\r\ndistance = qtt_houses + 1\r\nfor i in range(qtt_houses):\r\n if houses_price[i] != 0:\r\n if houses_price[i] <= zanes_money and abs(i + 1 - girls_house) < distance:\r\n distance = abs(i + 1 - girls_house)\r\n\r\nprint(distance 10)\r\n\r\n", "from collections import \r\nfrom math import \r\nn,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = n+1\r\nfor i in range(n):\r\n if(a[i] != 0 and a[i] <= k):\r\n d = min(d,abs(i-m+1))\r\nprint(d10)", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(107)\ninf=1020\nmod=109+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n a,b,c=LI()\n ll=LI()\n\n b-=1\n l=r=b\n while True:\n l-=1\n r+=1\n if 0<=l:\n if ll[l]!=0 and ll[l]<=c:\n return (b-l)10\n if r<a:\n if ll[r]!=0 and ll[r]<=c:\n return (r-b)10\n\n# main()\nprint(main())\n", "n,m,k = map(int, input().split())\na = list(map(int, input().split()))\n\nm -= 1\n\nl = m-1\nr = m+1\nwhile(True):\n if (l >= 0 and a[l] != 0 and a[l] <= k):\n print((m - l) 10)\n exit()\n if (r < n and a[r] != 0 and a[r] <= k):\n print((r - m) * 10)\n exit()\n l -= 1\n r += 1\n\n", "#Matheus Augusto - 118111612\n\nentrada = input().split()\n\nn = int(entrada[0])\nm = int(entrada[1])\nk = int(entrada[2])\n\nentrada = input().split()\nlista = []\n\nfor i in entrada:\n lista.append(int(i))\n\nindex1 = -10000\nindex2 = -10000\n\nfor i in range(m-1,-1,-1):\n if lista[i] == 0:\n continue\n if k>=lista[i]:\n index1 = i\n break\nfor j in range(m,n):\n if lista[j] == 0:\n continue\n if k>=lista[j]:\n index2 = j\n break\n\nvalue1 = abs(index1-(m-1))\nvalue2 = abs(index2-(m-1))\n\nif value1 <= value2:\n print((value1)10)\nelse:\n print((value2)10)", "n, m, k = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\nmd = 2000\r\nfor i in range(n):\r\n if p[i] <= k and p[i] != 0:\r\n d = abs((m-1)-i) * 10\r\n if d < md:\r\n md = d\r\nprint(md)\r\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nm-=1\r\nm1,m2=n10,n10\r\nfor i in range(m):\r\n if a[i] > 0 and a[i] <= k:\r\n m1 = (m-i)10\r\nfor i in range(n-1,m,-1):\r\n if a[i] > 0 and a[i] <= k:\r\n m2 = (i-m)10\r\nprint(min(m1,m2))", "\r\n\r\nn , m , k = map(int , input().split())\r\nm = m - 1\r\nmn = n\r\nx = [int(x) for x in input().split()]\r\n\r\nfor i in range(len(x)):\r\n if i != m and x[i] != 0 and k >= x[i]:\r\n mn = min(mn , abs(m - i))\r\n \r\nprint(mn * 10)", "n,m,k = map(int,input().split())\r\nh = list(map(int,input().split()))\r\nh1=[]\r\nfor i in range(n):\r\n\t\tif h[i]!=0 and h[i]<=k:\r\n\t\t\th1.append(abs(i+1-m))\r\nprint(10min(h1))\r\n\r\n", "n,m,k=map(int,input().split())\r\nm1=1000000\r\nx=list(map(int,input().split()))\r\nfor i in range(n):\r\n if x[i]<=k and x[i]!=0:\r\n l=abs(m-i-1)\r\n m1=min(m1,l)\r\n\r\n\r\nprint(10m1)", "n, m, k = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\nres, m = 0, m - 1\nfor i in range(1, n):\n if (m + i < n and 0 < a[m + i] <= k) or (m - i >= 0 and 0 < a[m - i] <= k):\n res = 10 * i\n break\nprint(res)\n", "n, m, k = list(map(int, input().split()))\r\ncity = list(map(int, input().split()))\r\n\r\nprint(min(abs(10(m-i)) for i in range(1, n+1) if 0 < city[i-1] <= k))\r\n", "n,m,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ni = 1\r\nans = 0\r\nwhile i < n:\r\n if m-i -1 >= 0 and a[m-i -1] <= k and a[m-i-1] != 0:\r\n ans = i\r\n break\r\n if m-1+i < n and a[m-1+i] <= k and a[m-1+i] != 0:\r\n ans = i\r\n break\r\n i += 1\r\nprint(ans10)", "N, M, K = map(int, input().strip().split())\nP = [int(p) for p in input().strip().split()]\n\nleft = None\nfor i in range(M - 2, -1, -1):\n if P[i] > K or P[i] == 0:\n continue\n\n distance = M - 1 - i\n left = (distance, P[i])\n break\n\nright = None\nfor i in range(M, N):\n if P[i] > K or P[i] == 0:\n continue\n\n distance = i - M + 1\n right = (distance, P[i])\n break\n\nif not left and not right:\n print(-1)\nelif left and not right:\n print(left[0] * 10)\nelif not left and right:\n print(right[0] * 10)\nelse:\n if left[0] > right[0]:\n print(right[0] * 10)\n elif left[0] < right[0]:\n print(left[0] * 10)\n else:\n if left[1] > right[1]:\n print(left[0] * 10)\n else:\n print(right[0] * 10)\n", "from sys import stdin, stdout\n#Additional Info\n # 2 ≤ houses ≤ 100, 1 ≤ location ≤ n, 1 ≤ budget ≤ 100\n # price[location] = 0, At least one house can be bought with the budget\n # distance = 10\n \n#Coding Area\ndef solve(numberHouses, location, budget, prices):\n distance = 10\n i = 1\n while True:\n condition1 = location - 1 - i >= 0 and prices[location - 1 - i] <= budget and prices[location - 1 - i] != 0\n condition2 = location - 1 + i < numberHouses and prices[location - 1 + i] <= budget and prices[location - 1 + i] != 0\n if condition1 or condition2:\n return distance\n distance += 10\n i += 1\n\n#Solve Area\nnumberHouses, location, budget = [ int(x) for x in stdin.readline().rstrip(\"\\r\\n\").split() ]\nprices = [ int(x) for x in stdin.readline().rstrip(\"\\r\\n\").split() ]\nstdout.write(str(solve(numberHouses, location, budget, prices)))\n\n#Test Area\n# print('Succeed' if solve(5,1,20,[0,27,32,21,19]) == 40 else 'Failed')\n# print('Succeed' if solve(7,3,50,[62,0,0,0,99,33,22]) == 30 else 'Failed')\n# print('Succeed' if solve(10,5,100,[1,0,1,0,0,0,0,0,1,1]) == 20 else 'Failed')\n\n", "n, m, k = map(int, input().split())\r\na = list(map(int,input().split()))\r\nd = n\r\nfor i in range(n):\r\n if a[i] != 0 and a[i] <= k :\r\n d = min(d, abs(i - m + 1))\r\nprint(d * 10)", "n,m,k=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nm-=1;d1=m-1;d2=m+1;\r\nconn1=False;conn2=False\r\nfor i in range(d1,-1,-1):\r\n\tif lst[i]<=k and lst[i]!=0:\r\n\t\tconn1=True\r\n\t\tcon1=i\r\n\t\tbreak\r\nfor i in range(d2,n):\r\n\tif lst[i]<=k and lst[i]!=0:\r\n\t\tconn2=True\r\n\t\tcon2=i\r\n\t\tbreak\r\nif conn1:\r\n\tcon1=m-con1;\r\nif conn2:\r\n\tcon2-=m\r\n#print(con1,con2,m)\r\nif conn2==False:\r\n\tprint(10con1)\r\nelif conn1==False:\r\n\tprint(10con2)\r\nelse:\r\n\tprint(10(con1 if con1<con2 else con2))", "n, m, k = map(int, input().split())\r\nfoo = list(map(int, input().split()))\r\n\r\nkiko = []\r\nfor i in range(n):\r\n if k >= foo[i] and foo[i] != 0:\r\n\t kiko.append(abs(i+1-m)10)\r\nprint(min(kiko))\r\n", "n,m,k = map(int,input().split())\nm -= 1\nhouses = list(map(int,input().split()))\n\nleftDist = float('inf')\nfor i in range(m-1,-1,-1):\n if houses[i] and houses[i] <= k:\n leftDist = min(leftDist,(m-i)10)\n break\n\nrightDist = float('inf')\nfor i in range(m+1,n):\n if houses[i] and houses[i] <= k:\n rightDist = min(rightDist,(i-m)10)\n break\n\nprint(min(leftDist,rightDist))\n \t \t\t \t\t\t\t\t\t \t \t\t\t\t", "n = [int(j) for j in input().split()]\r\nhouse_price = [int(j) for j in input().split()]\r\nw = []\r\nfor k in range(n[0]):\r\n if house_price[k] != 0 and house_price[k] <= n[2]:\r\n w.append(k)\r\ndistance = [abs(k - n[1]+1) for k in w]\r\ndistance.sort()\r\nprint(distance[0]10)", "n, m, k = list(map(int, input().split(' ')))\r\na = list(map(int, input().split(' ')))\r\ns = float('inf')\r\nfor i in range(n):\r\n if a[i] and a[i] - k <= 0:\r\n s = min(abs(m - (i + 1)), s)\r\nprint(10 s)\r\n", "if __name__ == \"__main__\":\n entrada1= input().split(\" \")\n entrada2= input().split(\" \")\n dismin=[]\n for val,casa in enumerate(entrada2):\n if(int(casa)!=0 and int(entrada1[2])>=int(casa)):\n dismin.append(abs(int(entrada1[1])-(val+1))10) \n print(min(dismin))\n\t \t\t\t\t \t \t\t\t\t\t \t \t\t \t \t\t", "n,m,k=list(map(int,input().split(\" \")))\r\na=list(map(int,input().split(\" \")))\r\n# print(n,k,m,a)\r\nq=1000000000000\r\nfor i in range(1,n+1):\r\n if(a[i-1]<=k and a[i-1]!=0):\r\n distance=abs(m-i)\r\n q=min(distance,q)\r\nprint(q10)", "(num_houses, crush_house, dollars) = [int(string) for string in input().split()]\nhouse_prices = [int(string) for string in input().split()]\n\ndef distance(crush, house, prices, max_price):\n return (abs(house - crush), not(prices[house] <= 0 or prices[house] > max_price))\n\nclosest = -1\nfor i in range(num_houses):\n (dist, can_buy) = distance(crush_house - 1, i, house_prices, dollars)\n if can_buy and (dist < closest or closest == -1):\n closest = dist\n\nprint(closest * 10)\n", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 10 ** 10\r\nfor i in range(n):\r\n if a[i] != 0 and a[i] <= k:\r\n ans = min(ans, abs(i - (m - 1)) * 10)\r\n \r\nprint(ans)", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=[]\r\ny=[]\r\nfor i in range(n):\r\n\tif l[i]==0:\r\n\t\tcontinue\r\n\telif l[i]<=k:\r\n\t\tx.append(i+1)\r\nfor i in range(len(x)):\r\n\tif x[i]>m:\r\n\t\ty.append(x[i]-m)\r\n\telif x[i]<m:\r\n\t\ty.append(m-x[i])\r\nprint(min(y)10)", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\np1=m-2\r\np2=m\r\ni=1\r\nj=1\r\nans=[]\r\nwhile p1>=0 or p2<n:\r\n if p1>=0 and a[p1]<=k and a[p1]!=0:\r\n ans.append(i)\r\n if p2<n and a[p2]<=k and a[p2]!=0:\r\n ans.append(j)\r\n p1-=1\r\n i+=1\r\n j+=1\r\n p2+=1\r\nprint(min(ans)10) \r\n \r\n \r\n \r\n", "import sys\nfrom collections import Counter\nfrom math import factorial\n\ninput = sys.stdin\noutput = sys.stdout\ncombinations_dynamic = dict()\n\n\ndef combinations(n, k):\n if k > n - k:\n k = n - k\n if k < 0:\n return 0\n if n < 1:\n return 0\n if k == 0:\n return 1\n if k == 1:\n return n\n question = tuple((n, k))\n if question not in combinations_dynamic:\n combinations_dynamic[question] = combinations(n - 1, k - 1) + combinations(n - 1, k)\n return combinations_dynamic[question]\n\n# input = open('input.txt')\n\n\ndef read_int():\n return [int(x) for x in input.readline().rstrip().split()]\n\n\nn, m, k = read_int()\nmas = read_int()\nm -= 1\nanswer = n * 10\nfor i, price in enumerate(mas):\n if 0 < price <= k:\n answer = min(answer, 10 * abs(m - i))\n\noutput.write('%d\\n' % answer)\n\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nleft=a[:m-1]\r\nright=a[m:]\r\nleft=left[::-1]\r\nflagl=0\r\nflagr=0\r\ncntl=0\r\ncntr=0\r\nfor i in left:\r\n cntl+=1\r\n if(i!=0):\r\n if(i<=k):\r\n flagl=1\r\n break\r\nfor j in right:\r\n cntr+=1\r\n if(j!=0):\r\n if(j<=k):\r\n flagr=1\r\n break\r\n \r\nk=[]\r\nif(flagl==1):\r\n k.append(cntl)\r\nif(flagr==1):\r\n k.append(cntr)\r\n \r\nprint(min(k)10)\r\n\r\n\r\n ", "i=lambda:map(int,input().split())\r\n_,m,k=i()\r\nprint(10min(abs(m-x) for x,y in enumerate(i(),start=1)if 0<y<=k))", "n,m,k=map(int,input().split())\r\na=[int(a) for a in input().split()] \r\ncountl,countr,flagl,flagr=10,10,0,0\r\n\r\nfor i in range(m,n):\r\n if a[i]==0 or a[i]>k:\r\n countr+=10\r\n else:\r\n flagr=1\r\n break\r\nfor j in range(m-2,-1,-1):\r\n if a[j]==0 or a[j]>k:\r\n countl+=10\r\n else:\r\n flagl=1\r\n break\r\n\r\nif flagl==1 and flagr==1:\r\n print(min(countl,countr))\r\nelif flagl==1:\r\n print(countl)\r\nelse:\r\n print(countr)", "a,b,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\np1,p2=b-1,b-1 \r\nwhile 1:\r\n p1-=1 \r\n p2+=1 \r\n if p1>=0:\r\n if l[p1]>0 and l[p1]<=c:\r\n print((b-p1-1)10)\r\n break \r\n if p2<a:\r\n if l[p2]>0 and l[p2]<=c:\r\n print((p2-b+1)10)\r\n break ", "n, m, k = map(int, input().split())\nm -= 1\nprices = list(map(int, input().split()))\nfor i in range(1, n+1):\n if (m+i < n and prices[m+i] > 0 and prices[m+i] <= k):\n print(i10)\n break\n if (m-i >= 0 and prices[m-i] > 0 and prices[m-i] <= k):\n print(i10)\n break\n \n# 1502472748047\n", "N, M, K = map(int,input().split())\r\nH = list(map(int,input().split()))\r\nM -= 1\r\nL, R = M-1, M+1\r\nminCost = 111111111111111\r\nwhile 0 <= L:\r\n if (0 < H[L] and H[L] <= K):\r\n minCost = min(10(M-L),minCost)\r\n break\r\n L -= 1\r\nwhile R < N:\r\n if (0 < H[R] and H[R] <= K):\r\n minCost = min(10(R-M),minCost)\r\n break\r\n R += 1\r\n\r\nprint(minCost)", "num_houses,crush_house,Zane_money = list(map(int, input().split()))\nprices = list(map(int,input().split()))\ncrush_house -= 1\n\nfound = False\nleft_pos = crush_house - 1\nright_pos = crush_house + 1\nZane_house = crush_house\n\nwhile not found:\n if left_pos >= 0 and prices[left_pos] > 0 and prices[left_pos] <= Zane_money:\n Zane_house = left_pos\n found = True\n elif right_pos < len(prices) and prices[right_pos] > 0 and prices[right_pos] <= Zane_money:\n Zane_house = right_pos\n found = True\n left_pos -= 1\n right_pos += 1\n\nZane_house_distance = 0\nif Zane_house > crush_house:\n Zane_house_distance = Zane_house - crush_house\nelse:\n Zane_house_distance = crush_house - Zane_house\nZane_house_distance = 10\n\nprint(Zane_house_distance)\n\n\t\t \t\t\t\t\t \t \t \t \t\t \t \t \t", "n, m, k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ngood = []\r\nfor i in range(len(arr)):\r\n if 0 < arr[i] <= k:\r\n diff = abs(m - (i + 1))\r\n good.append(diff)\r\ndis = min(good)\r\nprint(dis 10)\r\n\r\n", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=n\r\nfor i in range(n):\r\n\tif l[i]>0 and l[i]<=k and abs(i-(m-1))<c:\r\n\t\tc=abs(i-(m-1))\r\nprint(c10)\t\r\n", "def main():\r\n n, m, k = map(int, input().split())\r\n a = [int(i) for i in input().split()]\r\n dist1 = n\r\n dist2 = n\r\n m = m - 1\r\n for i in range(m, n):\r\n if a[i] != 0 and a[i] <= k:\r\n dist1 = i - m\r\n break\r\n for i in range(m, -1, -1):\r\n if a[i] != 0 and a[i] <= k:\r\n dist2 = m - i\r\n break\r\n print(min(dist1, dist2) 10)\r\nmain()", "n,m,k = map(int,input().split())\r\nli = list(map(int,input().split()))\r\ns =[]\r\nfor i in range(n):\r\n if li[i]!=0 and li[i]<=k:\r\n s.append(abs(i+1-m)10)\r\n\r\nprint(min(s))\r\n \r\n", "n,m,k = map(int,input().split())\r\ns = [int(i) for i in input().split()]\r\nx,y=0,0\r\n\r\nd = s[m-1::-1]\r\nc = s[m-1:n]\r\n\r\nfor i in range(len(d)-1):\r\n\tif d[i+1]!=0 and d[i+1]<=k:\r\n\t\tx = i+1\r\n\t\tbreak\r\n\r\nfor i in range(len(c)-1):\r\n\tif c[i+1]!=0 and c[i+1]<=k:\r\n\t\ty = i+1\r\n\t\tbreak\r\n\r\nif x==0 or y==0:\r\n\tprint(max(x,y)10)\r\nelse:\r\n\tprint(min(x,y)10)\r\n\r\n\r\n", "n, m, k = list(map(int,input().strip().split()))\na = list(map(int,input().strip().split()))\n\n\n# def f(a, m, k):\n# n = len(a)\n# i = m - 2\n# j = m\n\n# while True:\n# if a[i] <= k and a[i] !=0 and i >= 0:\n# ans = i\n# break\n# if a[j] <= k and a[j] !=0 and j < n:\n# ans = j\n# break\n\n# if i > 0:\n# i -= 1\n# if j < n:\n# j += 1\n\n# print(10abs(m-1-ans))\n\n\nminp = 101\nfor i, p in enumerate(a):\n if p > 0 and p <=k:\n temp = abs(m-i-1)\n if temp < minp:\n minp = temp\n\nprint(minp10)", "def buy_house(m, k, lst):\r\n distance = 10 * 9\r\n for i, j in enumerate(lst):\r\n if j != 0 and j <= k:\r\n distance = min(distance, abs(i + 1 - m))\r\n return 10 * distance\r\n\r\n\r\nn, m, k = [int(x) for x in input().split()]\r\nb = [int(y) for y in input().split()]\r\nprint(buy_house(m, k, b))\r\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()));b=[];d=0\r\nfor i in range(n) :\r\n if i!=m-1 :\r\n if a[i]<=k and a[i]!=0 :\r\n b.append(abs(i-(m-1))10)\r\nprint(min(b))\r\n", "# Buying a House\n\na = list(map(int, input().split()))\n\nd = 200\nn = a[0]\nm = a[1]\nk = a[2]\n\nh = list(map(int, input().split()))\n\nfor i in range(1, n+1, 1):\n if(h[i-1] and h[i-1] <= k and d > abs(i - m)):\n d = abs(i - m)\n\nprint(d10)\n\t \t\t\t \t\t \t\t\t \t\t \t \t\t\t", "import sys \r\n#http://codeforces.com/problemset/problem/796/A\r\ninput_string = input()\r\ninput_array = [int(x) for x in input_string.split()]\r\nnumber_of_houses = input_array[0]\r\ngirl_house = input_array[1]\r\nbudget = input_array[2]\r\ninput_string = input()\r\nprices = [int(x) for x in input_string.split()]\r\n\r\nmin_distance = number_of_houses+1\r\nfor i in range(len(prices)): \r\n if(prices[i]!=0 and prices[i]<=budget):\r\n if abs(girl_house-(i+1))<min_distance:\r\n min_distance = abs(girl_house-(i+1))\r\nprint(min_distance10)\r\n ", "\n\nn,m,k = map(int,input().split(' '))\n\navailability = list(map(int,input().split(' ')))\n\nd = []\n\nfor i in range(n):\n\tif availability[i]<=k and availability[i]!=0:\n\t\td.append(abs(m-(i+1)))\n\nprint(min(d)10)\n", "_, m, k = [int(x) for x in input().split()]\nA = [int(x) for x in input().split()]\nm-=1\n\ndef solve(A, m, k):\n\ti1, i2 = m,m\n\twhile i1>=0 or i2<len(A):\n\t\tif i1>=0 and A[i1]!=0 and A[i1]<=k:\n\t\t\treturn i1\n\t\telif i2<len(A) and A[i2] != 0 and A[i2]<=k:\n\t\t\treturn i2\n\t\ti2+=1\n\t\ti1-=1\n\nmh = solve(A,m,k)\nprint(10abs(mh-m))\n", "n , m , k = list(map(int,input().split()))\r\n\r\na = list(map(int,input().split()))\r\n\r\nxi = 0 ; \r\nmx = 1000000008\r\n \r\nm = m - 1\r\nmxi = 0 \r\n \r\nfor x in a:\r\n\tif x <= k and abs(xi-m) < mx and x != 0:\r\n\t\tmx = abs(xi-m)\r\n\txi = xi + 1 \r\n\r\nprint((mx)10)\r\n\r\n", "n, m, k = map(int, input().split())\r\nhouses = list(map(int, input().split()))\r\nmin_distance = float('inf') # Initialize with a infintely large number\r\nfor i in range(n):\r\n if houses[i] != 0 and houses[i] <= k:\r\n distance = abs(m - (i + 1)) * 10 # Convert house distance to meters\r\n min_distance = min(min_distance, distance)\r\nprint(min_distance)\r\n", "n,m,k = map(int,input().split(' '))\r\nlist0 = list(map(int,input().split(' ')))\r\ndistances = []\r\nfor i in range(n):\r\n if list0[i] <= k and list0[i] != 0:\r\n distances.append(10abs(m-i-1))\r\n\r\nprint(min(distances))", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nflag1=flag2=0\r\nfor i in range(m-2,-1,-1):\r\n if a[i]!=0 and a[i]<=k:\r\n flag1=1\r\n break\r\nfor j in range(m,n):\r\n if a[j]!=0 and a[j]<=k:\r\n flag2=1 \r\n break\r\n\r\nif flag1==1 and flag2==1:\r\n print(min(m-i-1,j-m+1)10)\r\nelif(flag1==1 and flag2==0):\r\n print((m-i-1)10)\r\nelse:\r\n print((j-m+1)10)", "n,gf,m=map(int,input().strip().split()[:3])\r\nb=list(map(int,input().strip().split()[:n]))\r\nc=10*3\r\nfor x in range(len(b)):\r\n\tif b[x]!=0 and b[x]<=m:\r\n\t\tk=x+1\r\n\t\tp=abs(gf-k)\r\n\t\tif p<c:\r\n\t\t\tc=p\r\n\r\nprint(c10)", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni1=-1\r\ni2=-1\r\nfor i in range(m-2,-1,-1):\r\n if(a[i]!=0 and a[i]<=k):\r\n i1=i\r\n break\r\nfor i in range(m,n):\r\n if(a[i]!=0 and a[i]<=k):\r\n i2=i\r\n break\r\nif(i1==-1):\r\n print(10(i2-m+1))\r\nelif(i2==-1):\r\n print(10(m-1-i1))\r\nelse:\r\n print(min((10(m-1-i1)), (10(i2-m+1))))", "a = input().split()\r\nb = input().split()\r\ns=len(b)10\r\nfor i in range(len(b)):\r\n if int(b[i]) <= int(a[2]) and int(b[i]) != 0:\r\n if abs(int(a[1])-1-i)10<s:\r\n s = abs(int(a[1])-1-i)10\r\nprint(s)", "a,b,c=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nx=[]\r\nfor i in range(b,len(z)):\r\n if z[i]!=0 and z[i]<=c:\r\n x.append((i-b+1)10)\r\nfor i in range(0,b-1):\r\n if z[i]!=0 and z[i]<=c:\r\n x.append((b-i-1)10)\r\nprint(min(x))", "a,b,c = [int(x) for x in input().split()]\r\nd = [int(x) for x in input().split()]\r\nb -=1 \r\nlista=[]\r\nfor i in range(a):\r\n if 0<d[i]<=c:\r\n lista.append(i)\r\nfor i in range(len(lista)):\r\n if lista[i]<b:\r\n lista[i]=b-lista[i]\r\n else:\r\n lista[i]=lista[i]-b\r\nprint(min(lista)10)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Jul 1 07:08:42 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn,m,k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nr1 = 0\r\nfor i in range(m,n):\r\n \r\n if l[i] <= k and l[i] !=0:\r\n r1 = i+1 - m\r\n break\r\nr2 = 0\r\nfor i in range(m-2,-1,-1):\r\n if l[i] <=k and l[i]!=0:\r\n r2 = abs(m - i-1)\r\n break\r\n\r\nif r1==0:\r\n r = r2\r\nelif r2 ==0:\r\n r = r1\r\nelse:\r\n r = min(r1,r2)\r\nprint(r*10)" ]	{"inputs": ["5 1 20\n0 27 32 21 19", "7 3 50\n62 0 0 0 99 33 22", "10 5 100\n1 0 1 0 0 0 0 0 1 1", "5 3 1\n1 1 0 0 1", "5 5 5\n1 0 5 6 0", "15 10 50\n20 0 49 50 50 50 50 50 50 0 50 50 49 0 20", "7 5 1\n0 100 2 2 0 2 1", "100 50 100\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 0 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100", "100 50 1\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 0 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100", "100 77 50\n50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 0 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0", "100 1 1\n0 98 97 96 95 94 93 92 91 90 89 88 87 86 85 84 83 82 81 80 79 78 77 76 75 74 73 72 71 70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0", "100 1 100\n0 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100", "100 10 99\n0 0 0 0 0 0 0 0 0 0 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 99 98", "7 4 5\n1 0 6 0 5 6 0", "7 4 5\n1 6 5 0 0 6 0", "100 42 59\n50 50 50 50 50 50 50 50 50 50 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 60 60 60 60 60 60 60 60 0 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 0", "2 1 100\n0 1", "2 2 100\n1 0", "10 1 88\n0 95 0 0 0 0 0 94 0 85", "10 2 14\n2 0 1 26 77 39 41 100 13 32", "10 3 11\n0 0 0 0 0 62 0 52 1 35", "20 12 44\n27 40 58 69 53 38 31 39 75 95 8 0 28 81 77 90 38 61 21 88", "30 29 10\n59 79 34 12 100 6 1 58 18 73 54 11 37 46 89 90 80 85 73 45 64 5 31 0 89 19 0 74 0 82", "40 22 1\n7 95 44 53 0 0 19 93 0 68 65 0 24 91 10 58 17 0 71 0 100 0 94 90 79 73 0 73 4 61 54 81 7 13 21 84 5 41 0 1", "40 22 99\n60 0 100 0 0 100 100 0 0 0 0 100 100 0 0 100 100 0 100 100 100 0 100 100 100 0 100 100 0 0 100 100 100 0 0 100 0 100 0 0", "50 10 82\n56 54 0 0 0 0 88 93 0 0 83 93 0 0 91 89 0 30 62 52 24 84 80 8 38 13 92 78 16 87 23 30 71 55 16 63 15 99 4 93 24 6 3 35 4 42 73 27 86 37", "63 49 22\n18 3 97 52 75 2 12 24 58 75 80 97 22 10 79 51 30 60 68 99 75 2 35 3 97 88 9 7 18 5 0 0 0 91 0 91 56 36 76 0 0 0 52 27 35 0 51 72 0 96 57 0 0 0 0 92 55 28 0 30 0 78 77", "74 38 51\n53 36 55 42 64 5 87 9 0 16 86 78 9 22 19 1 25 72 1 0 0 0 79 0 0 0 77 58 70 0 0 100 64 0 99 59 0 0 0 0 65 74 0 96 0 58 89 93 61 88 0 0 82 89 0 0 49 24 7 77 89 87 94 61 100 31 93 70 39 49 39 14 20 84", "89 22 11\n36 0 68 89 0 85 72 0 38 56 0 44 0 94 0 28 71 0 0 18 0 0 0 89 0 0 0 75 0 0 0 32 66 0 0 0 0 0 0 48 63 0 64 58 0 23 48 0 0 52 93 61 57 0 18 0 0 34 62 17 0 41 0 0 53 59 44 0 0 51 40 0 0 100 100 54 0 88 0 5 45 56 57 67 24 16 88 86 15", "97 44 100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 51 19", "100 1 1\n0 0 0 0 10 54 84 6 17 94 65 82 34 0 61 46 42 0 2 16 56 0 100 0 82 0 0 0 89 78 96 56 0 0 0 0 0 0 0 0 77 70 0 96 67 0 0 32 44 1 72 50 14 11 24 61 100 64 19 5 67 69 44 82 93 22 67 93 22 61 53 64 79 41 84 48 43 97 7 24 8 49 23 16 72 52 97 29 69 47 29 49 64 91 4 73 17 18 51 67", "100 1 50\n0 0 0 60 0 0 54 0 80 0 0 0 97 0 68 97 84 0 0 93 0 0 0 0 68 0 0 62 0 0 55 68 65 87 0 69 0 0 0 0 0 52 61 100 0 71 0 82 88 78 0 81 0 95 0 57 0 67 0 0 0 55 86 0 60 72 0 0 73 0 83 0 0 60 64 0 56 0 0 77 84 0 58 63 84 0 0 67 0 16 3 88 0 98 31 52 40 35 85 23", "100 1 100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 91 70 14", "100 1 29\n0 0 0 0 64 0 89 97 0 0 0 59 0 67 62 0 59 0 0 80 0 0 0 0 0 97 0 57 0 64 32 0 44 0 0 48 0 47 38 0 42 0 0 0 0 0 0 46 74 0 86 33 33 0 44 0 79 0 0 0 0 91 59 0 59 65 55 0 0 58 33 95 0 97 76 0 81 0 41 0 38 81 80 0 85 0 31 0 0 92 0 0 45 96 0 85 91 87 0 10", "100 50 20\n3 0 32 0 48 32 64 0 54 26 0 0 0 0 0 28 0 0 54 0 0 45 49 0 38 74 0 0 39 42 62 48 75 96 89 42 0 44 0 0 30 21 76 0 50 0 79 0 0 0 0 99 0 84 62 0 0 0 0 53 80 0 28 0 0 53 0 0 38 0 62 0 0 62 0 0 88 0 44 32 0 81 35 45 49 0 69 73 38 27 72 0 96 72 69 0 0 22 76 10", "100 50 20\n49 0 56 0 87 25 40 0 50 0 0 97 0 0 36 29 0 0 0 0 0 73 29 71 44 0 0 0 91 92 69 0 0 60 81 49 48 38 0 87 0 82 0 32 0 82 46 39 0 0 29 0 0 29 0 79 47 0 0 0 0 0 49 0 24 33 70 0 63 45 97 90 0 0 29 53 55 0 84 0 0 100 26 0 88 0 0 0 0 81 70 0 30 80 0 75 59 98 0 2", "100 2 2\n0 0 43 90 47 5 2 97 52 69 21 48 64 10 34 97 97 74 8 19 68 56 55 24 47 38 43 73 72 72 60 60 51 36 33 44 100 45 13 54 72 52 0 15 3 6 50 8 88 4 78 26 40 27 30 63 67 83 61 91 33 97 54 20 92 27 89 35 10 7 84 50 11 95 74 88 24 44 74 100 18 56 34 91 41 34 51 51 11 91 89 54 19 100 83 89 10 17 76 20", "100 100 34\n5 73 0 0 44 0 0 0 79 55 0 0 0 0 0 0 0 0 83 67 75 0 0 0 0 59 0 74 0 0 47 98 0 0 72 41 0 55 87 0 0 78 84 0 0 39 0 79 72 95 0 0 0 0 0 85 53 84 0 0 0 0 37 75 0 66 0 0 0 0 61 0 70 0 37 60 42 78 92 52 0 0 0 55 77 57 0 63 37 0 0 0 96 70 0 94 97 0 0 0", "100 100 100\n43 79 21 87 84 14 28 69 92 16 3 71 79 37 48 37 72 58 12 72 62 49 37 17 60 54 41 99 15 72 40 89 76 1 99 87 14 56 63 48 69 37 96 64 7 14 1 73 85 33 98 70 97 71 96 28 49 71 56 2 67 22 100 2 98 100 62 77 92 76 98 98 47 26 22 47 50 56 9 16 72 47 5 62 29 78 81 1 0 63 32 65 87 3 40 53 8 80 93 0", "100 38 1\n3 59 12 81 33 95 0 41 36 17 63 76 42 77 85 56 3 96 55 41 24 87 18 9 0 37 0 61 69 0 0 0 67 0 0 0 0 0 0 18 0 0 47 56 74 0 0 80 0 42 0 1 60 59 62 9 19 87 92 48 58 30 98 51 99 10 42 94 51 53 50 89 24 5 52 82 50 39 98 8 95 4 57 21 10 0 44 32 19 14 64 34 79 76 17 3 15 22 71 51", "100 72 1\n56 98 8 27 9 23 16 76 56 1 34 43 96 73 75 49 62 20 18 23 51 55 30 84 4 20 89 40 75 16 69 35 1 0 16 0 80 0 41 17 0 0 76 23 0 92 0 34 0 91 82 54 0 0 0 63 85 59 98 24 29 0 8 77 26 0 34 95 39 0 0 0 74 0 0 0 0 12 0 92 0 0 55 95 66 30 0 0 29 98 0 0 0 47 0 0 80 0 0 4", "100 66 1\n38 50 64 91 37 44 74 21 14 41 80 90 26 51 78 85 80 86 44 14 49 75 93 48 78 89 23 72 35 22 14 48 100 71 62 22 7 95 80 66 32 20 17 47 79 30 41 52 15 62 67 71 1 6 0 9 0 0 0 11 0 0 24 0 31 0 77 0 51 0 0 0 0 0 0 77 0 36 44 19 90 45 6 25 100 87 93 30 4 97 36 88 33 50 26 71 97 71 51 68", "100 55 1\n0 33 45 83 56 96 58 24 45 30 38 60 39 69 21 87 59 21 72 73 27 46 61 61 11 97 77 5 39 3 3 35 76 37 53 84 24 75 9 48 31 90 100 84 74 81 83 83 42 23 29 94 18 1 0 53 52 99 86 37 94 54 28 75 28 80 17 14 98 68 76 20 32 23 42 31 57 79 60 14 18 27 1 98 32 3 96 25 15 38 2 6 3 28 59 54 63 2 43 59", "100 55 1\n24 52 41 6 55 11 58 25 63 12 70 39 23 28 72 17 96 85 7 84 21 13 34 37 97 43 36 32 15 30 58 5 14 71 40 70 9 92 44 73 31 58 96 90 19 35 29 91 25 36 48 95 61 78 0 1 99 61 81 88 42 53 61 57 42 55 74 45 41 92 99 30 20 25 89 50 37 4 17 24 6 65 15 44 40 2 38 43 7 90 38 59 75 87 96 28 12 67 24 32", "100 21 1\n62 5 97 80 81 28 83 0 26 0 0 0 0 23 0 0 90 0 0 0 0 0 0 0 0 54 71 8 0 0 42 0 73 0 17 0 1 31 71 78 58 72 84 39 54 59 13 29 16 41 71 35 88 55 70 50 33 100 100 60 52 90 7 66 44 55 51 42 90 17 86 44 46 8 52 74 8 22 2 92 34 37 58 98 70 74 19 91 74 25 4 38 71 68 50 68 63 14 60 98", "5 2 20\n27 0 32 21 19", "6 4 10\n10 0 0 0 0 10", "8 7 100\n1 0 0 0 0 0 0 1", "5 3 20\n1 21 0 0 1", "4 3 1\n0 0 0 1", "5 2 3\n4 0 5 6 1", "5 3 87\n88 89 0 1 90", "5 3 20\n15 30 0 15 35", "6 3 50\n0 0 0 1 2 0", "6 4 9\n100 9 10 0 0 9", "5 4 20\n0 20 0 0 20", "6 3 3\n1 5 0 2 2 0", "5 4 100\n0 1 0 0 1"], "outputs": ["40", "30", "20", "10", "20", "10", "20", "10", "490", "10", "980", "10", "890", "10", "10", "90", "10", "10", "90", "10", "60", "10", "70", "180", "210", "80", "190", "190", "580", "520", "490", "890", "970", "990", "490", "500", "50", "990", "10", "140", "390", "130", "10", "10", "160", "30", "20", "10", "20", "10", "30", "10", "10", "10", "20", "10", "10", "10"]}	UNKNOWN	PYTHON3	CODEFORCES	329
8e997023d723a3471ac07fd67fc26280	Gargari and Permutations	Gargari got bored to play with the bishops and now, after solving the problem about them, he is trying to do math homework. In a math book he have found k permutations. Each of them consists of numbers 1,<=2,<=...,<=n in some order. Now he should find the length of the longest common subsequence of these permutations. Can you help Gargari? You can read about longest common subsequence there: https://en.wikipedia.org/wiki/Longest_common_subsequence_problem The first line contains two integers n and k (1<=≤<=n<=≤<=1000; 2<=≤<=k<=≤<=5). Each of the next k lines contains integers 1,<=2,<=...,<=n in some order — description of the current permutation. Print the length of the longest common subsequence. Sample Input 4 3 1 4 2 3 4 1 2 3 1 2 4 3 Sample Output 3	[ "n, k = map(int, input().split())\r\na = [[]]6\r\nb = []\r\nfor i in range(6):\r\n b.append([0](n + 1))\r\n\r\nfor i in range(k):\r\n a[i] = list(map(int, input().split()))\r\n for j in range(n):\r\n b[i][a[i][j]] = j\r\n\r\ndp = [1] * n\r\nfor i in range(n):\r\n for j in range(i):\r\n key = 1\r\n for t in range(1, k):\r\n if b[t][a[0][j]] > b[t][a[0][i]]:\r\n key = 0\r\n break\r\n if key:\r\n dp[i] = max(dp[i], dp[j] + 1)\r\nprint(max(dp))\r\n", "from collections import defaultdict\r\nn,k = map(int,input().split())\r\nmat= []\r\n\r\nfor x in range(k):\r\n\tarr = list(map(int,input().split()))\r\n\tmat.append(arr)\r\nmemo = defaultdict(lambda:-1)\r\nfor i in range(k):\r\n\tfor j in range(n):\r\n\t\tmemo[i,mat[i][j]] = j\r\n\r\ndef valid(index,prev):\r\n\tele= mat[0][index]\r\n\tprevele = mat[0][prev]\r\n\tflag =True \r\n\tfor i in range(k):\r\n\t\tif memo[i,prevele]>memo[i,ele]:flag = False\r\n\treturn flag\r\n\r\n\r\ndp = [1]n\r\nfor i in range(1,n):\r\n\tfor j in range(i):\r\n\t\tif valid(i,j):\r\n\t\t\tdp[i] = max(dp[i],dp[j]+1)\r\nprint(max(dp))\r\n", "n, k = map(int, input().split())\nv = [list(map(int, input().split())) for _ in range(k)]\npos = [[0] (n + 1) for _ in range(k)]\ne = [[] for _ in range(n + 1)]\nfor j in range(k):\n for p, x in enumerate(v[j]):\n pos[j][x] = p\n e[x].append(p)\ne = sorted((e[j], j) for j in range(1, n + 1))\n#print(e)\ndp = [0] * n\nfor j in range(n - 1, -1, -1):\n dp[j] = 1\n for b in range(j + 1, n):\n if all(e[b][0][x] > e[j][0][x] for x in range(k)):\n #print('Hi')\n dp[j] = max(dp[j], 1 + dp[b])\nprint(max(dp))", "# -- coding:utf-8 --\n\n\"\"\"\n\ncreated by shuangquan.huang at 1/14/20\n\n\"\"\"\n\nimport collections\nimport time\nimport os\nimport sys\nimport bisect\nimport heapq\nfrom typing import List\n\n\nmemo = [0 for _ in range(1005)]\ndef longestpath(start, graph):\n if memo[start] > 0:\n return memo[start]\n \n l = 0\n for v in graph[start]:\n l = max(longestpath(v, graph), l)\n memo[start] = l + 1\n return l + 1\n\n\ndef solve_graph(N, K, A, pos):\n # for each u, v if u appears before v in every array, add a link u->v\n g = collections.defaultdict(list)\n d = [0 for _ in range(N+1)]\n for u in range(1, N+1):\n for v in range(1, N+1):\n if all([pos[k][u] < pos[k][v] for k in range(1, K+1)]):\n g[u].append(v)\n d[v] += 1\n \n # then find the longest path\n ans = 0\n for u in range(1, N+1):\n if d[u] == 0:\n ans = max(ans, longestpath(u, g))\n return ans\n \n\n\ndef solve(N, K, A, pos):\n dp = [0 for _ in range(N+1)]\n for i in range(1, N+1):\n maxx = 0\n for p in range(1, i):\n # if the A[1][p], A[1][i] is the last two elements of ans\n # A[1][p] should appears before A[1][i] at every input array A[1:]\n if all([pos[k][A[1][p]] < pos[k][A[1][i]] for k in range(2, K+1)]):\n maxx = max(maxx, dp[p])\n dp[i] = maxx + 1\n \n return max(dp)\n\n\nN, K = map(int, input().split())\nA = [[0] * (N + 1)]\npos = [[0 for _ in range(N+1)] for _ in range(K+1)]\nfor i in range(K):\n row = [0] + [int(x) for x in input().split()]\n A.append(row)\n for j, v in enumerate(row):\n pos[i+1][v] = j\n\nprint(solve_graph(N, K, A, pos))", "import sys\r\ninput=sys.stdin.readline\r\nn,k=map(int,input().split())\r\na=[list(map(int,input().split())) for i in range(k)]\r\ng=[[] for i in range(n+1)]\r\nfor i in range(n):\r\n x=a[0][i]\r\n s=set(a[0][i+1:])\r\n for j in range(k):\r\n idx=a[j].index(x)\r\n s1=set(a[j][idx+1:])\r\n s=s&s1\r\n for y in s:\r\n g[x].append(y)\r\ndist=[-1](n+1)\r\ndef dfs(ver):\r\n if dist[ver]!=-1:\r\n return dist[ver]\r\n res=0\r\n for to in g[ver]:\r\n res=max(res,dfs(to)+1)\r\n dist[ver]=res\r\n return res\r\nMAX=max(dfs(i) for i in range(1,n+1))\r\nprint(MAX+1)", "# by the authority of GOD author: manhar singh sachdev #\r\n\r\nimport os,sys\r\nfrom io import BytesIO,IOBase\r\n\r\ndef main():\r\n n,k = map(int,input().split())\r\n arr = [list(map(int,input().split())) for _ in range(k)]\r\n edg = [[1]n for _ in range(n)]\r\n for i in range(k):\r\n for j in range(n):\r\n for l in range(j+1):\r\n edg[arr[i][j]-1][arr[i][l]-1] = 0\r\n path = [[] for _ in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n if edg[i][j]:\r\n path[i].append(j)\r\n visi,poi,dp = [0]n,[0]n,[1]n\r\n for i in range(n):\r\n if visi[i]:\r\n continue\r\n visi[i],st = 1,[i]\r\n while len(st):\r\n x,y = st[-1],path[st[-1]]\r\n while poi[x] != len(y) and visi[y[poi[x]]]:\r\n dp[x] = max(dp[x],dp[y[poi[x]]]+1)\r\n poi[x] += 1\r\n if poi[x] == len(y):\r\n st.pop()\r\n if len(st):\r\n dp[st[-1]] = max(dp[st[-1]],dp[x]+1)\r\n else:\r\n st.append(y[poi[x]])\r\n visi[st[-1]] = 1\r\n poi[x] += 1\r\n print(max(dp))\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()", "from sys import stdin, stdout, setrecursionlimit\r\ninput = stdin.readline\r\n# import string\r\n# characters = string.ascii_lowercase\r\n# digits = string.digits\r\n# setrecursionlimit(int(1e6))\r\n# dir = [-1,0,1,0,-1]\r\n# moves = 'NESW'\r\ninf = float('inf')\r\nfrom functools import cmp_to_key\r\nfrom collections import defaultdict as dd\r\nfrom collections import Counter, deque\r\nfrom heapq import \r\nimport math\r\nfrom math import floor, ceil, sqrt\r\ndef geti(): return map(int, input().strip().split())\r\ndef getl(): return list(map(int, input().strip().split()))\r\ndef getis(): return map(str, input().strip().split())\r\ndef getls(): return list(map(str, input().strip().split()))\r\ndef gets(): return input().strip()\r\ndef geta(): return int(input())\r\ndef print_s(s): stdout.write(s+'\\n')\r\n\r\n\r\ndef solve():\r\n n, k = geti()\r\n mat = []\r\n pos = [[-1](n+1) for _ in range(k)]\r\n for i in range(k):\r\n mat.append(getl())\r\n for j in range(n):\r\n pos[i][mat[-1][j]] = j\r\n dp = [1]n\r\n for i in range(n):\r\n for j in range(i):\r\n for now in range(k):\r\n if pos[now][mat[0][i]] <= pos[now][mat[0][j]]:\r\n break\r\n else:\r\n dp[i] = max(dp[i], dp[j] + 1)\r\n # print(i, dp)\r\n ans = max(dp)\r\n print(ans)\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n solve()\r\n", "n, k = map(int, input().split())\r\nra = [[0] * k for _ in range(n)]\r\nfor p in range(k):\r\n for i, v in enumerate(map(int, input().split())):\r\n v -= 1\r\n ra[v][p] = i\r\ng = [[] for _ in range(n)]\r\nfor u in range(n):\r\n for v in range(n):\r\n if all(x < y for x, y in zip(ra[u], ra[v])):\r\n g[u].append(v)\r\n\r\nmemo = [-1] * n\r\ndef dfs(v):\r\n if memo[v] != -1:\r\n return memo[v]\r\n r = 1\r\n for u in g[v]:\r\n r = max(r, dfs(u) + 1)\r\n memo[v] = r\r\n return r\r\n\r\nprint(max(dfs(s) for s in range(n)))\r\n \r\n", "n, k = map(int, input().split())\r\na, b = [[] for row in range(6)], [[0 for col in range(n + 1)] for row in range(6)]\r\n\r\nfor i in range(k):\r\n a[i] = list(map(int, input().split()))\r\n for j in range(n):\r\n b[i][a[i][j]] = j\r\n\r\ndp = [1] * n\r\nfor i in range(n):\r\n for j in range(i):\r\n flag = 1\r\n for x in range(1, k):\r\n if b[x][a[0][j]] > b[x][a[0][i]]:\r\n flag = 0\r\n break\r\n if flag:\r\n dp[i] = max(dp[i], dp[j] + 1)\r\nprint(max(dp))\r\n" ]	{"inputs": ["4 3\n1 4 2 3\n4 1 2 3\n1 2 4 3", "6 3\n2 5 1 4 6 3\n5 1 4 3 2 6\n5 4 2 6 3 1", "41 4\n24 15 17 35 13 41 4 14 23 5 8 16 21 18 30 36 6 22 11 29 26 1 40 31 7 3 32 10 28 38 12 20 39 37 34 19 33 27 2 25 9\n22 13 25 24 38 35 29 12 15 8 11 37 3 19 4 23 18 32 30 40 36 21 16 34 27 9 5 41 39 2 14 17 31 33 26 7 1 10 20 6 28\n31 27 39 16 22 12 13 32 6 10 19 29 37 7 18 33 24 21 1 9 36 4 34 41 25 28 17 40 30 35 23 14 11 8 2 15 38 20 26 5 3\n8 18 39 38 7 34 16 31 15 1 40 20 37 4 25 11 17 19 33 26 6 14 13 41 12 32 2 21 10 35 27 9 28 5 30 24 22 23 29 3 36", "1 2\n1\n1", "28 5\n3 14 12 16 13 27 20 8 1 10 24 11 5 9 7 18 17 23 22 25 28 19 4 21 26 6 15 2\n7 12 23 27 22 26 16 18 19 5 6 9 11 28 25 4 10 3 1 14 8 17 15 2 20 13 24 21\n21 20 2 5 19 15 12 4 18 9 23 16 11 14 8 6 25 27 13 17 10 26 7 24 28 1 3 22\n12 2 23 11 20 18 25 21 13 27 14 8 4 6 9 16 7 3 10 1 22 15 26 19 5 17 28 24\n13 2 6 19 22 23 4 1 28 10 18 17 21 8 9 3 26 11 12 27 14 20 24 25 15 5 16 7", "6 3\n2 5 1 4 6 3\n5 1 4 6 2 3\n5 4 2 6 3 1", "41 4\n24 15 17 35 13 41 4 14 23 5 8 16 21 18 30 36 6 22 11 29 26 1 40 31 7 3 32 10 28 38 12 20 39 37 34 19 33 27 2 25 9\n22 13 25 24 38 35 29 12 15 8 11 37 3 19 4 23 18 32 30 40 36 21 16 34 27 9 5 41 39 2 14 17 31 33 26 7 1 10 20 6 28\n31 27 39 16 22 12 13 32 6 10 19 29 37 7 18 33 24 21 1 9 36 4 34 41 25 28 17 40 30 35 23 14 11 8 2 15 38 20 26 5 3\n8 18 39 38 7 34 16 31 15 1 40 20 37 4 25 11 17 19 33 26 6 14 13 41 12 32 2 21 10 35 27 9 28 5 30 24 22 23 29 3 36", "37 3\n6 3 19 20 15 4 1 35 8 24 12 21 34 26 18 14 23 33 28 9 36 11 37 31 25 32 29 22 13 27 16 17 10 7 5 30 2\n10 3 35 17 34 21 14 8 26 28 11 19 27 7 4 23 24 22 12 13 16 1 25 29 5 31 30 20 32 18 15 9 2 36 37 33 6\n19 9 22 32 26 35 29 23 5 6 14 34 33 10 2 28 15 11 24 4 13 7 8 31 37 36 1 27 3 16 30 25 20 21 18 17 12"], "outputs": ["3", "3", "4", "1", "3", "4", "4", "7"]}	UNKNOWN	PYTHON3	CODEFORCES	9
8ea2947adf1fbbc23b60a162d770b3ba	Alyona and flowers	Little Alyona is celebrating Happy Birthday! Her mother has an array of n flowers. Each flower has some mood, the mood of i-th flower is ai. The mood can be positive, zero or negative. Let's define a subarray as a segment of consecutive flowers. The mother suggested some set of subarrays. Alyona wants to choose several of the subarrays suggested by her mother. After that, each of the flowers will add to the girl's happiness its mood multiplied by the number of chosen subarrays the flower is in. For example, consider the case when the mother has 5 flowers, and their moods are equal to 1,<=<=-<=2,<=1,<=3,<=<=-<=4. Suppose the mother suggested subarrays (1,<=<=-<=2), (3,<=<=-<=4), (1,<=3), (1,<=<=-<=2,<=1,<=3). Then if the girl chooses the third and the fourth subarrays then: - the first flower adds 1·1<==<=1 to the girl's happiness, because he is in one of chosen subarrays, - the second flower adds (<=-<=2)·1<==<=<=-<=2, because he is in one of chosen subarrays, - the third flower adds 1·2<==<=2, because he is in two of chosen subarrays, - the fourth flower adds 3·2<==<=6, because he is in two of chosen subarrays, - the fifth flower adds (<=-<=4)·0<==<=0, because he is in no chosen subarrays. Thus, in total 1<=+<=(<=-<=2)<=+<=2<=+<=6<=+<=0<==<=7 is added to the girl's happiness. Alyona wants to choose such subarrays from those suggested by the mother that the value added to her happiness would be as large as possible. Help her do this! Alyona can choose any number of the subarrays, even 0 or all suggested by her mother. The first line contains two integers n and m (1<=≤<=n,<=m<=≤<=100) — the number of flowers and the number of subarrays suggested by the mother. The second line contains the flowers moods — n integers a1,<=a2,<=...,<=an (<=-<=100<=≤<=ai<=≤<=100). The next m lines contain the description of the subarrays suggested by the mother. The i-th of these lines contain two integers li and ri (1<=≤<=li<=≤<=ri<=≤<=n) denoting the subarray a[li],<=a[li<=+<=1],<=...,<=a[ri]. Each subarray can encounter more than once. Print single integer — the maximum possible value added to the Alyona's happiness. Sample Input 5 4 1 -2 1 3 -4 1 2 4 5 3 4 1 4 4 3 1 2 3 4 1 3 2 4 1 1 2 2 -1 -2 1 1 1 2 Sample Output 7 16 0	[ "n,m = map(int,input().split())\r\nmoods = list(map(int,input().split()))\r\nfor i in range(1,n):\r\n moods[i] += moods[i-1]\r\ntotal_Happiness=0\r\nwhile(m>0):\r\n l,r = map(int,input().split())\r\n if l==1:\r\n sum = moods[r-1]\r\n else:\r\n sum = moods[r-1] - moods[l-2]\r\n if sum>0:\r\n total_Happiness+=sum\r\n m-=1\r\nprint(total_Happiness)\r\n\r\n", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\npre=[0]n\r\npre[0]=arr[0]\r\nre=0\r\nfor i in range(1,n):\r\n pre[i]=pre[i-1]+arr[i]\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n curr=0\r\n if(x==1):\r\n curr=pre[y-1]\r\n else:\r\n curr=pre[y-1]-pre[x-2]\r\n if(curr>0):\r\n re+=curr\r\nprint(re)", "n,m=map(int,input().strip().split(' '))\r\na=list(map(int,input().strip().split(' ')))\r\ns=0\r\nfor q in range(m):\r\n l,r=map(int,input().strip().split(' '))\r\n p=0\r\n for i in range(l-1,r):\r\n p=p+a[i]\r\n if(p>0):\r\n s=s+p\r\nprint(s)", "#!/usr/bin/env python3\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\n\nsum_ = 0\nfor i in range(m):\n l, r = map(int, input().split())\n l -= 1\n temp = sum(a[l:r])\n if temp > 0:\n sum_ += temp\n\nprint(sum_)\n", "n, m = list(map(int, input().split(' ')))\nnums = list(map(int, input().split(' ')))\n\n# find the prefix sum of the array, to calculate the happiness\nprefix_sum = [0]\nfor num in nums:\n\tprefix_sum.append(num + prefix_sum[-1])\n\n# print(prefix_sum)\n\nres = 0\nfor i in range(m):\n\ts, e = list(map(int, input().split(' ')))\n\ttemp = prefix_sum[e] - prefix_sum[s-1]\n\tif temp > 0:\n\t\tres += temp \n\nprint(res)", "import math\n\n\nstr = input().split()\nn = int(str[0])\nm = int(str[1])\narr = [int(i) for i in input().split()]\nsu = 0\n\nfor k in range(m):\n str1 = input().split()\n n1 = int(str1[0])-1\n m1 = int(str1[1])\n k = arr[n1:m1]\n z = sum(k)\n if z>0:\n su+= z\nprint(su)\n \n \n ", "n,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[a[0]]\r\nfor i in range(1,n):\r\n b.append(b[i-1]+a[i])\r\n\r\nans=0\r\nfor i in range(q):\r\n x,y=map(int,input().split())\r\n temp=b[y-1]\r\n if x!=1:\r\n temp-=b[x-2]\r\n ans=max(ans,ans+temp)\r\nprint(ans)", "import sys\n\ndef scan():\n return input().rstrip().split()\n\ndef scan_numeric():\n return [(int(x) if float(x).is_integer() else float(x)) for x in scan()]\n\nN, M = scan_numeric()\nflowers = scan_numeric()\nsubs = []\nfor i in range(M):\n subs.append(scan_numeric())\n\ndp = [0]\n\nfor i in range(N): dp.append(flowers[i] + dp[i])\n\nhappiness = 0\nfor i in range(M):\n l, r = subs[i]\n add = dp[r] - dp[l-1]\n if add > 0: happiness += add\n\nprint(happiness)\n", "n, m = map(int, input().split())\r\narr = [int(x) for x in input().split()]\r\nres = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n s = sum(arr[l-1:r])\r\n res += max(0, s)\r\nprint(res)\r\n", "s = input()\r\ns = s.split(\" \")\r\ns = [int(x) for x in s]\r\na = input()\r\na = a.split(\" \")\r\na = [int(x) for x in a]\r\ny = 0\r\nfor i in range(1, s[-1]+1, 1):\r\n b = input()\r\n b = b.split(\" \")\r\n b = [int(x) for x in b]\r\n b[0] = b[0] - 1\r\n ans = 0\r\n for j in range(b[0], b[-1], 1):\r\n ans += a[j]\r\n if ans > 0:\r\n y += ans\r\nprint(y)", "n, m = map(int, input().split())\r\nmood = [int(c) for c in input().split()]\r\n\r\nacc = [0]\r\nfor e in mood:\r\n acc.append(acc[-1] + e)\r\n \r\nans = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n _sum = acc[r] - acc[l-1]\r\n if _sum >= 0:\r\n ans += _sum\r\n\r\nprint(ans) \r\n", "n,m=map(int,input().split())\npre=[int(i) for i in input().split()]\nans=0\nfor _ in range(m):\n l,r=map(int, input().split())\n x=0\n a=pre[l-1:r]\n for i in a:\n x += i\n if x>0:\n ans += x\nprint(ans)", "n,m=[int(i)for i in input().split()]\r\nl=[int(i)for i in input().split()]\r\ns=0\r\nfor i in range(m):\r\n\ta,b=[int(i)for i in input().split()]\t\r\n\td=sum(l[a-1:b])\r\n\tif d>0:s+=d\r\nprint(s)\t", "m,n=map(int,input().split())\r\nl=list(map(int,input().split()))\r\narr=[i for i in l]\r\nfor i in range(1,m):\r\n arr[i]+=arr[i-1]\r\nans=0 \r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n p=p-1\r\n q=q-1\r\n if p==0:\r\n sumi=arr[q]\r\n else: \r\n sumi=arr[q]-arr[p-1]\r\n if sumi>0:\r\n ans+=sumi\r\n \r\nprint(ans) \r\n ", "\r\nimport string\r\n\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n a_1 = []\r\n a_2 = []\r\n for i in range(len(a)):\r\n j = len(a) - 1 - i\r\n if i == 0:\r\n a_1.append(a[i])\r\n else:\r\n a_1.append(a_1[-1] + a[i])\r\n if j == len(a) - 1:\r\n a_2.append(a[j])\r\n else:\r\n a_2.append(a_2[-1] + a[j])\r\n a_2.reverse()\r\n # print(a)\r\n #print(a_1)\r\n #print(a_2)\r\n counter = 0\r\n sum_of_a = sum(a)\r\n for i in range(m):\r\n l, r = [int(j) - 1 for j in input().split(\" \")]\r\n l = l - 1\r\n r = r + 1\r\n real_sum = sum_of_a\r\n if l >= 0:\r\n real_sum -= a_1[l]\r\n if r < len(a):\r\n real_sum -= a_2[r]\r\n #print(real_sum)\r\n if real_sum > 0:\r\n counter += real_sum\r\n print(counter)\r\n\r\n\r\nmain_function()", "n,q=map(int,input().split())\narr=[int(i) for i in input().split()]\nfor i in range(1,len(arr)):\n arr[i]=arr[i-1]+arr[i]\ndef calc(arr,l,r):\n l-=1\n r-=1\n if l==0:\n return arr[r]\n return (arr[r]-arr[l-1])\nans=0\nfor _ in range(q):\n l,r=map(int,input().split())\n temp=calc(arr,l,r)\n if temp>0:\n ans+=temp\nprint(ans)", "n,m=map(int,input().split())\r\nlistNum=list(map(int,input().split()))\r\nresult=0\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n changer=0\r\n for i in listNum[a-1:b]:\r\n changer+=i\r\n if changer>0:\r\n result+=changer\r\nprint(result)", "n,q = map(int, input().split())\r\n\r\nA = list(map(int, input().split()))\r\nfor i in range(1, n):\r\n A[i] += A[i-1]\r\n\r\nans = 0\r\nfor _ in range(q):\r\n s,e = map(int,input().split())\r\n s -= 1\r\n e -= 1\r\n if s == 0:\r\n cand = A[e]\r\n else:\r\n cand = A[e] - A[s-1]\r\n if cand > 0:\r\n ans += cand\r\n\r\nprint(ans)\r\n", "flowers, subarrays = map(int, input().split(\" \"))\r\nmoods = list(map(int, input().split(\" \")))\r\nadded = 0\r\nfor i in range(subarrays):\r\n f, t = map(int, input().split(\" \"))\r\n val = sum(moods[f-1:t])\r\n if val > 0:\r\n added += val\r\nprint(added)\r\n", "import sys\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nres = 0\r\nfor i in range(m):\r\n summ = 0\r\n l,r = map(int,input().split())\r\n for j in range(l-1,r):\r\n summ += a[j]\r\n if summ > 0:\r\n res += summ\r\nprint(res)\r\n", "\"\"\"\r\nATSTNG's ejudge Python3 solution template\r\n(actual solution is below)\r\n\"\"\"\r\nimport sys, queue\r\n\r\ntry:\r\n import dev_act_ffc429465ab634 # empty file in directory\r\n DEV = True\r\nexcept:\r\n DEV = False\r\n\r\ndef log(s):\r\n if DEV: print('LOG', s)\r\n\r\nclass EJudge:\r\n def __init__(self, problem=\"default\", reclim=1<<30):\r\n self.problem = problem\r\n sys.setrecursionlimit(reclim)\r\n\r\n def use_files(self, infile='', outfile=''):\r\n if infile!='':\r\n self.infile = open(infile)\r\n sys.stdin = self.infile\r\n if infile!='':\r\n self.outfile = open(outfile, 'w')\r\n sys.stdout = self.outfile\r\n\r\n def use_bacs_files(self):\r\n self.use_files(self.problem+'.in', self.problem+'.out')\r\n\r\n def get_tl(self):\r\n while True: pass\r\n\r\n def get_ml(self):\r\n tmp = [[[5]100000 for _ in range(1000)]]\r\n while True: tmp.append([[5]100000 for _ in range(1000)])\r\n\r\n def get_re(self):\r\n s = (0,)[8]\r\n\r\n def get_wa(self, wstr='blablalblah'):\r\n for _ in range(3): print(wstr)\r\n exit()\r\n\r\nclass IntReader:\r\n def __init__(self):\r\n self.ost = queue.Queue()\r\n\r\n def get(self):\r\n return int(self.sget())\r\n\r\n def sget(self):\r\n if self.ost.empty():\r\n for el in input().split():\r\n self.ost.put(el)\r\n return self.ost.get()\r\n\r\n def release(self):\r\n res = []\r\n while not self.ost.empty():\r\n res.append(self.ost.get())\r\n return res\r\n\r\n###############################################################################\r\nej = EJudge( )\r\nint_reader = IntReader()\r\nfmap = lambda f,l: list(map(f,l))\r\nparse_int = lambda: fmap(int, input().split())\r\n\r\n\r\n# input\r\nsuba = parse_int()[1]\r\narr = parse_int()\r\nps = arr[:]\r\nfor idx in range(1, len(ps)):\r\n ps[idx] += ps[idx-1]\r\nlog(arr); log(ps)\r\nans = 0\r\nfor _ in range(suba):\r\n left, right = parse_int()\r\n left, right = left-1, right-1\r\n\r\n csum = ps[right]-(ps[left-1] if left-1>=0 else 0)\r\n if csum > 0 :ans += csum\r\n log(csum)\r\n\r\nprint(ans)\r\n\r\n'''\r\n1 3\r\n1 2 3 4 5\r\n1 3\r\n2 4\r\n1 5\r\n'''\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\n\nflowers = [int(x) for x in input().split()]\nsubarrs = []\n\ndef arrsum(xs, l, r):\n sum = 0\n for i in range(l-1, r):\n sum += xs[i]\n return sum\n\nfor i in range(m):\n l, r = map(int, input().split())\n subarrs.append(arrsum(flowers, l, r))\n\nsubarrs.sort(reverse=True)\nsol = 0\n\nfor i in range(m):\n if subarrs[i] > 0:\n sol += subarrs[i]\n else:\n break\n\nprint (sol)\n", "from sys import stdin\n\nN, M = map(int, stdin.readline().split())\n\nflowers = list(map(int, stdin.readline().split()))\nfor i in range(1, len(flowers)):\n flowers[i] += flowers[i - 1]\n\nflowers.insert(0, 0)\n\ncontrib = [0] M;\n\nfor m in range(M):\n a, b = map(int, stdin.readline().split())\n contrib[m] = max(0, flowers[b] - flowers[a - 1]);\n\nprint(sum(contrib))\n", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nbrr=[]\r\ns=0\r\nfor _ in range(m):\r\n temp=0\r\n a,b=map(int,input().split())\r\n for el in range(a-1,b):\r\n temp+=arr[el]\r\n if temp>0:\r\n s+=temp\r\nprint(s)", "##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\na = list(map(int, input().split()))\r\n\r\nres = 0\r\nfor i in range(m):\r\n [l, r] = list(map(int, input().split()))\r\n l -= 1\r\n r -= 1\r\n sum = 0\r\n for j in range(l, r+1):\r\n sum += a[j]\r\n if sum > 0:\r\n res += sum\r\nprint(res)", "n,m=(int(x) for x in input().split())\r\na=list(int(x) for x in input().split())\r\ncmb=list()\r\nfor i in range(m):\r\n\tcmb.append(list(int(x) for x in input().split()))\r\n\r\ncs=list([0]m)\r\nfor i in range(m):\r\n\tfor j in range (cmb[i][0]-1,cmb[i][1]):\r\n\t\tcs[i]+=a[j]\r\n\r\nbv=0\r\nfor i in cs:\r\n\tif i>0:\r\n\t\tbv+=i\r\n\r\nprint(bv)", "def main():\n n, m = map(int, input().split())\n a = list(map(int, input().split()))\n\n ans = 0\n for _ in range(m):\n l, r = map(int, input().split())\n l -= 1\n r -= 1\n\n seg_sum = sum(a[l:(r + 1)])\n ans += max(0, seg_sum)\n\n print(ans)\n\nmain()\n", "cin=lambda:map(int,input().split())\nn,m=cin()\nA=cin()\nai=list(A)\nsum =[0](n+1)\nfor i in range(n):\n sum[i]= sum[i-1]+ ai[i]\ntemp = 0\nresult =0\nj=0\nsum[-1] =0\nwhile(j<m):\n a, b = cin()\n temp = sum[b-1]- sum[a-2];\n if temp>0:\n result += temp\n j = j+1\nprint(result)", "\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(arr):\r\n cnt1 = 0\r\n cnt2 = 0\r\n for i in range(len(arr)):\r\n if arr[i] >= 0 :\r\n cnt1+=1\r\n else:\r\n cnt2 +=1\r\n\r\n if cnt2 == len(arr):\r\n return True\r\n\r\nn , m = MAP()\r\narr = LIST()\r\nf = (check(arr))\r\nif f :\r\n print(0)\r\n exit(0)\r\nans = 0\r\nfor i in range(m):\r\n l,r = MAP()\r\n sm = 0\r\n l-=1\r\n a = []\r\n for j in range(l , r):\r\n sm += arr[j]\r\n if sm > 0 :\r\n ans+= sm\r\n\r\nprint(ans)\r\n\r\n", "n, m = map(int, input().split())\r\na = [0]\r\na.extend(list(map(int, input().split())))\r\nd = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n d[i] = d[i - 1] + a[i]\r\nans = 0\r\nfor i in range(m):\r\n left, right = map(int, input().split())\r\n s = d[right] - d[left - 1]\r\n if s > 0:\r\n ans += s\r\nprint(ans)\r\n", "n,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\np=[0]n\r\n\r\np[0]=a[0]\r\nfor i in range(1,n):\r\n p[i]=p[i-1]+a[i]\r\ns=0\r\nfor _ in range(m):\r\n l,r=list(map(int,input().split()))\r\n l-=1\r\n r-=1\r\n if l==0:\r\n if p[r]>0:\r\n s+=p[r]\r\n else:\r\n if p[r]-p[l-1]>0:\r\n s+=p[r]-p[l-1]\r\nprint(s)\r\n", "n,nq=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nq=[]\r\nfor i in range(nq):\r\n q.append(list(map(int,input().split())))\r\nsums=[]\r\ns=0\r\nfor i in a:\r\n s=s+i\r\n sums.append(s)\r\nans=0\r\nfor i in q:\r\n c=sums[i[1]-1]-sums[i[0]-1]+a[i[0]-1]\r\n if(c>0):\r\n ans+=c\r\nprint(ans)\r\n", "n,m=[int(i) for i in input().split()]\r\n\r\nl = [int(i) for i in input().split()]\r\n\r\n\r\ncumSum = [0]\r\n\r\nfor i in range(1,n+1):\r\n v = cumSum[i-1]+l[i-1]\r\n cumSum.append(v)\r\n#print(cumSum)\r\ntotalSum = 0\r\nfor k in range(m):\r\n i,j = [int(i) for i in input().split()]\r\n \r\n resSum = cumSum[j]-cumSum[i-1]\r\n if(resSum > 0):\r\n totalSum += resSum\r\nprint(totalSum)", "I = lambda:map(int,input().split())\r\nans = 0\r\nn, m = I()\r\na = list(I())\r\nfor _ in range(m):\r\n\tl, r = I()\r\n\tans += max(0,sum(a[i] for i in range(l-1,r)))\r\nprint(ans)", "R = lambda: map(int, input().split())\r\nn, m = R()\r\na = list(R())\r\nans = 0\r\n\r\nfor _ in range(m):\r\n l, r = R()\r\n if sum(a[l-1:r]) > 0:\r\n ans += sum(a[l-1:r])\r\n\r\n\r\nprint(ans)\r\n", "def mex(lst,blanck):\r\n ans=0\r\n for i in blanck:\r\n ans=max(ans,ans+sum(lst[i[0]:i[1]+1]))\r\n return ans\r\n\r\na,b=map(int,input().strip().split())\r\nblanck=[]\r\nlst=list(map(int,input().strip().split()))\r\nfor i in range(b):\r\n x,y=map(int,input().strip().split())\r\n blanck.append([x-1,y-1])\r\nprint(mex(lst,blanck))", "class CodeforcesTask740BSolution:\n def __init__(self):\n self.result = ''\n self.n_m = []\n self.moods = []\n self.subarrays = []\n\n def read_input(self):\n self.n_m = [int(x) for x in input().split(\" \")]\n self.moods = [int(x) for x in input().split(\" \")]\n for x in range(self.n_m[1]):\n self.subarrays.append([int(x) for x in input().split(\" \")])\n\n def process_task(self):\n indices = [self.moods[x[0] - 1:x[1]] for x in self.subarrays]\n boosts = [sum(x) for x in indices]\n mood = sum([x for x in boosts if x > 0])\n self.result = str(mood)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask740BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n, m = map(int, input().split())\r\nmas = [int(x) for x in input().split()]\r\nsumek=0\r\nfor i in range(m):\r\n l,r = map(int, input().split())\r\n some_sum = sum(mas[l-1:r])\r\n if some_sum > 0:\r\n sumek += some_sum\r\nprint(sumek)", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nans=0\r\nfor z in range(m):\r\n l,r=[int(i) for i in input().split()]\r\n sum=0\r\n for i in range(l-1,r):\r\n sum+=a[i]\r\n if sum>0:\r\n ans+=sum\r\nprint(ans)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n s=max(s,sum(l[a-1:b])+s) \r\nprint(s) ", "read = lambda: map(int, input().split())\r\nn, m = read()\r\na = list(read())\r\nans = 0\r\nfor i in range(m):\r\n l, r = read()\r\n cur = sum(a[l - 1:r])\r\n ans += max(0, cur)\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nl = list(int(num) for num in input().strip().split())[:n]\r\ntotal_happiness = 0\r\nwhile m!=0:\r\n x, y = map(int, input().split())\r\n total = 0\r\n total=sum(l[x-1:y])\r\n if total>0:\r\n total_happiness+=total\r\n m-=1\r\nprint(total_happiness)", "n,m = map(int,input().split())\r\nml = list(map(int, input().split()))\r\nl = list()\r\nsumDict = {}\r\nmoodSums = 0\r\nfor i in range(m):\r\n moodSums = 0\r\n a,b = map(int,input().split())\r\n l.append([x for x in ml[a-1:b]])\r\n for a in ml[a-1:b]:\r\n moodSums += a\r\n\r\n sumDict[i] = moodSums\r\n\r\nque = {}\r\nhappinesVal = 0\r\nfor i,a in sumDict.items():\r\n if a < 0:\r\n continue\r\n for b in l[i]:\r\n if b not in que.keys():\r\n que[b] = 1\r\n else:\r\n que[b] += 1\r\n\r\nfor a,b in que.items():\r\n happinesVal += ab\r\n\r\n\r\nprint(happinesVal)", "from sys import stdin\nfrom collections import deque,Counter,defaultdict,OrderedDict\nimport sys\nimport math,os\nimport operator\nimport random\nfrom fractions import Fraction\nimport functools\nimport bisect\nimport itertools\nfrom heapq import \nimport time\nimport copy\n\n\nn,m = map(int,input().split())\narr = list(map(int,input().split()))\nchosen = []\nfor _ in range(m):\n a,b = map(int,input().split())\n if sum(arr[a-1:b])>0:\n chosen.append([a,b])\n\nans = 0\nfor i in range(n):\n count = 0\n for a,b in chosen:\n if i in range(a-1,b):\n count+=1\n ans+=arr[i]count\nprint(ans)\n", "n,m=map(int,input().split())\r\nmood=list(map(int,input().split()))\r\nprefixsum=[0 for i in range(0,n)]\r\nprefixsum[0]=mood[0]\r\ndescription=[]\r\nhappiness=0\r\nsum1=0\r\nfor i in range(0,m):\r\n description.append(list(map(int,input().split())))\r\nfor i in range(1,n):\r\n prefixsum[i]=prefixsum[i-1]+mood[i]\r\nfor i in range(0,m):\r\n if description[i][0]==1:\r\n sum1=prefixsum[description[i][1]-1]\r\n else:\r\n sum1=prefixsum[description[i][1]-1]-prefixsum[description[i][0]-2]\r\n if sum1>0:\r\n happiness+=sum1\r\n\r\nprint(happiness)\r\n", "def solve():\r\n n,m=list(map(int,input().split()))\r\n flower=list(map(int,input().split()))\r\n result=0\r\n for _ in range(m):\r\n start,end=list(map(int,input().split()))\r\n subSum=sum(flower[start-1:end])\r\n if subSum>0:\r\n result+=subSum\r\n print(result)\r\n\r\nsolve()\r\n \r\n \r\n", "n,m=[int(x) for x in input().split()]\r\nmood= [int(x) for x in input().split()]\r\ntotal_hp=0\r\nfor i in range(m):\r\n l,r =[int(x) for x in input().split()]\r\n sum1=0\r\n for j in range(l-1,r):\r\n sum1+=mood[j]\r\n if sum1>0:\r\n total_hp+=sum1\r\nprint(total_hp)", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn,m=f()\r\nl=il()\r\nlsm=[]\r\nfor _ in range(m):\r\n a,b=f()\r\n lsm.append(sum(l[i] for i in range(a-1,b)))\r\nsm=0\r\nfor i in lsm:\r\n sm=sm+i if i>0 else sm+0\r\nprint(sm)", "n=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nsum1=0\r\nfor i in range(n[1]):\r\n n=list(map(int,input().split()))\r\n if sum(l[n[0]-1:n[1]])>=0:\r\n sum1+=sum(l[n[0]-1:n[1]])\r\nprint(sum1)", "from itertools import accumulate\r\n\r\nI = lambda: map(int, input().split())\r\n\r\nn, m = I()\r\nS = [0] + list(accumulate(I()))\r\nx = 0\r\n\r\nfor _ in range(m):\r\n L, R = I()\r\n x += max(0, S[R]-S[L-1])\r\n\r\nprint(x)", "n,ma=map(int,input().strip().split(\" \"))\r\na=list(map(int,input().strip().split(\" \")))\r\nm=0\r\nb=[]\r\nfor i in range(0,ma):\r\n b.append(list(map(int,input().strip().split(\" \"))))\r\n c=sum(a[b[i][0]-1:b[i][1]])\r\n m=max(m,m+c)\r\nprint(m)", "n,t = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ntotal = 0\r\n\r\nfor i in range(t):\r\n a,b = map(int,input().split())\r\n value_add = 0\r\n for j in range(a-1,b):\r\n value_add += arr[j]\r\n if(value_add > 0):\r\n total += value_add\r\n\r\nprint(total)\r\n\r\n\r\n\r\n\r\n\r\n", "if __name__ == \"__main__\":\r\n n,m=map(int,input().split())\r\n flowers=list(map(int,input().split()))\r\n happiness=0\r\n for i in range(1,n):\r\n flowers[i]+=flowers[i-1]\r\n for i in range(m):\r\n l,r=map(int,input().split())\r\n l-=1\r\n r-=1\r\n if(l==0):\r\n happiness+=max(flowers[r],0)\r\n else:\r\n happiness+=max((flowers[r]-flowers[l-1]),0)\r\n print(happiness)", "def listsum(numList):\r\n theSum = 0\r\n for i in numList:\r\n theSum = theSum + i\r\n return theSum\r\nsum = 0\r\nins = input().split()\r\nn,m = int(ins[0]),int(ins[1])\r\nflowers = input().split()\r\nflowers = list(map(int, flowers))\r\nwhile m!=0:\r\n m -= 1\r\n ins = input().split()\r\n ins[0] = int(ins[0])\r\n ins[1] = int(ins[1])\r\n if listsum(flowers[ins[0]-1:ins[1]])>0:\r\n sum += listsum(flowers[ins[0]-1:ins[1]])\r\nprint(sum)", "N, M = map(int, input().split())\narr = list(map(int, input().split()))\ntotal_happiness = 0\nfor i in range(M):\n summ = 0\n L, R = map(int, input().split())\n for j in range(L, R+1):\n summ += arr[j-1]\n if summ > 0:\n total_happiness += summ\nprint(total_happiness)\n\n \n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nscore = 0\r\n\r\nps = [arr[0]]\r\nfor i in range(1, n):\r\n\ts = ps[i-1] + arr[i]\r\n\tps.append(s)\r\n\r\nfor i in range(m):\r\n\tl, r = map(int, input().split())\r\n\t\r\n\tif (l == 1):\r\n\t\ttotal = ps[r-1]\r\n\telse:\r\n\t\ttotal = ps[r-1] - ps[l-2]\r\n\t\t\r\n\tscore = max(score, total+score)\r\n\r\nprint(score)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nfor i in range(1, n):\n a[i] += a[i - 1]\na = [0] + a\n\nresult = 0\nfor i in range(0, m):\n l, r = map(int, input().split())\n sum = a[r] - a[l - 1]\n result += max(sum, 0)\n\nprint(result)\n", "import copy\r\n \r\nN = input()\r\nN = list(map(int, N.split(' ')))\r\n \r\nflowers = input()\r\nflowers = list(map(int, flowers.split(' ')))\r\n \r\nsubarr = list()\r\n \r\nfor i in range(0,N[1]):\r\n arr = input()\r\n arr = list(map(int, arr.split(' ')))\r\n subarr.append(sum(flowers[arr[0]-1:arr[1]]))\r\n\r\nmood = 0\r\n\r\nfor i in subarr:\r\n if i > 0:\r\n mood = mood + i\r\n\r\nprint(mood)", "n,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(1,n):\r\n a[i]=(a[i-1]+a[i])\r\n\r\nans=0\r\nfor i in range(q):\r\n x,y=map(int,input().split())\r\n temp=a[y-1]\r\n if x!=1:\r\n temp-=a[x-2]\r\n ans=max(ans,ans+temp)\r\nprint(ans)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n s = 0\r\n l, r = map(int, input().split())\r\n for j in range(l - 1, r):\r\n s += a[j]\r\n if s >= 0:\r\n ans += s\r\nprint(ans)", "nm=list(map(int,input().split()))\r\nn=nm[0]\r\nm=nm[1]\r\na=list(map(int,input().split()))\r\nfreq=[0]n\r\nfor i in range(0,m):\r\n lr=list(map(int,input().split()))\r\n l=lr[0]\r\n r=lr[1]\r\n arr=a[l-1:r]\r\n if(sum(arr)>0):\r\n for j in range(l-1,r):\r\n freq[j]=freq[j]+1\r\nsum=0\r\nfor i in range(0,n):\r\n sum+=a[i]freq[i]\r\nprint(sum)\r\n ", "def fun(n,m,arr,sug):\r\n presum=list()\r\n presum.append(arr[0])\r\n for i in range(1,n):\r\n presum.append(presum[i-1]+arr[i])\r\n s=0\r\n for i,j in sug:\r\n temp=presum[j-1]-presum[i-1]+arr[i-1]\r\n if temp>0:\r\n s+=temp\r\n return s\r\n \r\nn,m=list(map(lambda x:int(x),input().split()))\r\narr=list(map(lambda x:int(x),input().split()))\r\nsug=[list(map(lambda x:int(x),input().split())) for _ in range(m)]\r\nprint(fun(n,m,arr,sug))", "# boundary cases\r\n# 1)zeroth index is involved\r\n# 2)Same index is involved could be zero and last Index\r\n# 3)only length one is included\r\n\r\n# input\r\n\r\nlength, sub_arrays = [int(i) for i in input().split()]\r\n\r\narr = [int(i) for i in input().split()]\r\n\r\nfor i in range(1, length):\r\n arr[i] = arr[i] + arr[i - 1]\r\n\r\nanswer = 0\r\n\r\nfor i in range(sub_arrays):\r\n l, r = [int(i) - 1 for i in input().split()]\r\n\r\n if l == 0:\r\n val = arr[r]\r\n else:\r\n val = arr[r] - arr[l-1]\r\n \r\n if val > 0:\r\n answer += val\r\n\r\nprint(answer)", "def calculate_happiness(n, m, flowers, subarrays):\r\n max_happiness = 0\r\n\r\n for subarray in subarrays:\r\n happiness = 0\r\n for i in range(subarray[0], subarray[1] + 1):\r\n happiness += flowers[i - 1]\r\n\r\n if happiness > 0:\r\n max_happiness += happiness\r\n\r\n return max_happiness\r\n\r\n\r\n# Read input values\r\nn, m = map(int, input().split())\r\nflowers = list(map(int, input().split()))\r\n\r\nsubarrays = []\r\nfor _ in range(m):\r\n li, ri = map(int, input().split())\r\n subarrays.append((li, ri))\r\n\r\n# Calculate maximum happiness\r\nresult = calculate_happiness(n, m, flowers, subarrays)\r\nprint(result)\r\n", "n, m = list(map(int, input().split(' ')))\r\na = list(map(int, input().split(' ')))\r\nans = 0\r\nfor i in range(m):\r\n l, r = list(map(int, input().split(' ')))\r\n ans += max(0, sum(a[l-1:r]))\r\nprint(ans)\r\n", "n, m = map (int, input().split())\r\na = [int(x) for x in input().split()]\r\n\r\nans = 0\r\nfor i in range (m):\r\n l, r = map (int, input().split())\r\n s = sum (a[l - 1 : r])\r\n if s > 0:\r\n ans += s\r\n \r\nprint (ans)", "n, m = map(int, input().split())\r\ns, v = [0], 0\r\nfor ai in map(int, input().split()):\r\n s.append(s[-1] + ai)\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n v += max(0, s[r] - s[l - 1])\r\nprint(v)", "inputArray = input().split()\r\nflowersNumber = int(inputArray[0])\r\nsubarraysNumber = int(inputArray[1])\r\n\r\nvalues = input().split()\r\n\r\nvalFreq = []\r\nfor i in range(flowersNumber):\r\n valFreq.append(0)\r\n \r\nsubarrays = []\r\nfor i in range(subarraysNumber):\r\n inputArray = input().split()\r\n a = int(inputArray[0])\r\n b = int(inputArray[1])\r\n #subarrays.append(values[a-1 : b])\r\n\r\n neto = 0\r\n for i in range (a-1, b):\r\n neto += int(values[i])\r\n\r\n if neto > 0:\r\n for i in range(a-1, b):\r\n valFreq[i] += 1\r\n\r\nendSum = 0\r\nfor i in range(flowersNumber):\r\n #print(int(values[i]), valFreq[i])\r\n endSum += int(values[i]) * valFreq[i]\r\n\r\nprint(endSum)\r\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr_subarrays = ['None'] * m\r\nfor i in range(m):\r\n a, b = map(int,input().split())\r\n arr_subarrays[i] = [a, b]\r\n\r\narr_sum_upto = ['None']n\r\narr_sum_upto[0] = arr[0]\r\nfor i in range(1,n):\r\n arr_sum_upto[i] = arr_sum_upto[i-1] + arr[i]\r\n\r\narr_value_add = [None]m\r\nans = 0\r\n\r\nfor i in range(len(arr_subarrays)):\r\n a = arr_subarrays[i][0]\r\n b = arr_subarrays[i][1]\r\n value_add = arr_sum_upto[b-1] - arr_sum_upto[a-1] + arr[a-1]\r\n if (value_add > 0):\r\n ans = ans + value_add\r\n\r\nprint(ans)\r\n\r\n#print(arr_subarrays)", "def ListFromInput():\n return list(map(int, input().split()))\n\n\n\nclass Range:\n def __init__(self, a, b):\n self.a = a\n self.b = b\n def summ(self, array):\n summ = 0\n for i in range(self.a-1, self.b):\n summ += array[i]\n return summ\n\n\ndef main():\n n, m = ListFromInput()\n a = ListFromInput()\n\n ranges = []\n for i in range(m):\n ranges.append(Range(ListFromInput()))\n\n good_ranges = []\n for r in ranges:\n if r.summ(a) > 0:\n good_ranges.append(r)\n\n moods = {}\n for i, mood in enumerate(a):\n moods[i] = 0\n\n for r in good_ranges:\n for i in range(r.a-1, r.b):\n moods[i] += 1\n\n hapiness = 0\n for i in range(n):\n hapiness += moods[i] a[i]\n\n print(hapiness)\n\nmain()\n\n", "def get_line(func=int,sym=' '):\r\n return [func(i) for i in input().split(sym)]\r\n\r\nn,m=get_line()\r\na=[0]+get_line()\r\nS=[0](n+1)\r\nfor i in range(n):\r\n S[i+1]=S[i]+a[i+1]\r\nans=0\r\nfor i in range(m):\r\n l,r=get_line()\r\n mood=S[r]-S[l-1]\r\n if mood>0:\r\n ans+=mood\r\nprint(ans)\r\n", "n,m=[int(x) for x in input().split()]\r\nmood=[int(x) for x in input().split()]\r\nif len(mood)==0:\r\n print(0)\r\nelse:\r\n s=[0 for x in range(len(mood))]\r\n s[0]=mood[0]\r\n for i in range(1,len(mood)):\r\n s[i]=s[i-1]+mood[i]\r\n res=0\r\n for i in range(m):\r\n l,r=[int(x) for x in input().split()]\r\n l-=1\r\n r-=1\r\n add=s[r]-s[l-1] if l!=0 else s[r]\r\n res+=add if add>0 else 0\r\n print(res)\r\n", "cv,pm = map(int,input().split())\r\nss = list(map(int,input().split()))\r\npmlist = []\r\nfor i in range(pm):\r\n pmlist.append(tuple(map(int,input().split())))\r\npmsum = 0\r\ns = 0\r\nfor i in pmlist:\r\n s = sum(ss[i[0]-1:i[1]])\r\n #print(ss[i[0]-1:i[1]],'=',s)\r\n pmsum+=s if s > 0 else 0\r\nprint(pmsum)", "n,m = map(int,input().split())\r\narr = [int(i) for i in input().split()]\r\narr1 = []\r\ns = 0\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n arr1.append(sum(arr[a-1:b]))\r\nfor i in arr1:\r\n if i > 0:\r\n s += i\r\nprint(s)\r\n\r\n", "from sys import stdin\nfrom sys import stdout\nn, m = [int(x) for x in stdin.readline().split()]\na = [int(x) for x in stdin.readline().split()]\ns = []\nfor _ in range(m):\n s.append(stdin.readline())\nlr = [[int(x) for x in line.split()] for line in s]\nhappiness = [0 for i in range(len(lr))]\nans = 0\nfor j in range(len(lr)):\n for i in range(lr[j][0]-1, lr[j][1]):\n happiness[j] += a[i]\nfor h in happiness:\n if h > 0:\n ans += h\nstdout.write(str(ans))\n", "from sys import stdin\n\nn, m = map(int, stdin.readline().split())\n\na = list(map(int, stdin.readline().split()))\n\nintervals = []\n\nfor _ in range(m):\n interval = list(map(lambda x: int(x) - 1, stdin.readline().split()))\n interval[1] += 1\n intervals.append(interval)\n\nresult = 0\n\n\nfor l, r in intervals:\n s = sum(a[l:r])\n if s >= 0:\n result += s\n\nprint(result)\n", "n, m = map(int, input().split())\r\na = [0] +list(map(int, input().split()))\r\nF = [0] (n + 1)\r\n\r\nfor i in range(1, n + 1):\r\n F[i] = F[i-1] + a[i]\r\n\r\nans = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n fine = F[r] - F[l - 1]\r\n if fine > 0:\r\n ans += fine\r\n \r\n\r\nprint(ans)", "n, q = map(int, input().split())\nflowers = list(map(int, input().split()))\nsumTillNow = [flowers[0]]\nfor i in range(1, len(flowers)):\n sumTillNow.append(sumTillNow[-1] + flowers[i])\nres = 0\n#print(sumTillNow)\nfor _ in range(q):\n l1, r1 = map(int, input().split())\n l, r = l1-2, r1-1\n #print(l, r, sumTillNow[l], sumTillNow[r])\n if l == -1:\n this = sumTillNow[r]\n else:\n this = sumTillNow[r] - sumTillNow[l]\n if this > 0:\n res += this\nprint(res)", "n, m = map(int, input().split())\r\narr = [map(int, input().split())]\r\nans = 0\r\nfor i in range(0, m):\r\n s, t = map(int, input().split())\r\n ss = sum(arr[(s-1):(t)])\r\n if ss > 0:\r\n ans += ss\r\nprint(ans)\r\n", "def fun(n,m,arr,sug):\r\n newarr=[sum(arr[i-1:j]) for i,j in sug]\r\n s=0\r\n for i in newarr:\r\n if i>0:\r\n s+=i\r\n return s\r\n \r\nn,m=list(map(lambda x:int(x),input().split()))\r\narr=list(map(lambda x:int(x),input().split()))\r\nsug=[list(map(lambda x:int(x),input().split())) for _ in range(m)]\r\nprint(fun(n,m,arr,sug))", "\r\nif __name__=='__main__':\r\n\tn, m = map(int, input().split())\r\n\ta = list(map(int, input().split()))\r\n\tfor i in range(1, n):\r\n\t\ta[i] += a[i-1]\r\n\tres = 0\r\n\t#print(a)\r\n\tfor i in range(m):\r\n\t\tl, r = map(int, input().split())\r\n\t\tsm = a[r-1]\r\n\t\tif l > 1:\r\n\t\t\tsm -= a[l-2]\r\n\t\t#print(l, r, sm)\r\n\t\tif sm > 0:\r\n\t\t\tres += sm\r\n\tprint(res)", "n, m = map(int, input().split())\r\narr = [0] + list(map(int, input().split()))\r\nbrr = [list(map(int, input().split())) for i in range(m)]\r\npref = [0] (n + 1)\r\nfor i in range(1, n + 1):\r\n pref[i] = pref[i - 1] + arr[i]\r\ncnt = 0\r\nfor i in range(m):\r\n cnt += 0 if pref[brr[i][1]]- pref[brr[i][0] - 1] < 0 else pref[brr[i][1]]- pref[brr[i][0] - 1]\r\nprint(cnt)", "res=0 \r\ncnt={}\r\nans=[]\r\nn,q=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nfor _ in range(q):\r\n le,r=map(int,input().split())\r\n if sum(l[le-1:r])>0:\r\n for i in range(le-1,r):\r\n ans.append(l[i])\r\nfrom collections import Counter \r\nc=Counter(ans) \r\nfor i in c:\r\n res+=c[i]i \r\nprint(res)\r\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\nfor t in range(m):\n l, r = map(int, input().split())\n s = 0\n for i in range(l-1, r): s += a[i]\n if s > 0: ans += s\nprint(ans)\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncsum,msum=0,0\r\n#print(a[0],end=\" \")\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\n #print(a[i],end=' ')\r\n#print()\r\nfor i in range(0,m):\r\n l,r=map(int,input().split())\r\n l,r=l-1,r-1\r\n if l>0 or (l!=0 and l==r):\r\n csum=a[r]-a[l-1]\r\n #print('csum= ',csum)\r\n elif l==0 or (l==r and l==0) :\r\n csum=a[r]\r\n #print('csum= ',csum)\r\n #if l==r and l=0:\r\n \r\n if csum>0:\r\n msum+=csum\r\n #print('msum= ',msum)\r\nprint(msum)", "def arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\nfrom sys import stdin\r\n\r\nn, m = arr_inp()\r\nflower, ans = arr_inp(), 0\r\nfor i in range(m):\r\n l, r = arr_inp()\r\n s = sum(flower[l - 1:r])\r\n if s > 0:\r\n ans +=s\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nps, s = a[:], 0\r\nfor i in range(1,n):\r\n ps[i] += ps[i-1]\r\nfor i in range(m):\r\n x,y = map(int, input().split())\r\n x, y = x-1, y-1\r\n t = ps[y]\r\n if(x > 0):\r\n t -= ps[x-1]\r\n if(t> 0):\r\n s += t\r\nprint(s)", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(m):\r\n s,e = map(int,input().split())\r\n val = 0\r\n for j in range(s-1,e):\r\n val+=l[j]\r\n ans = max(ans+val,ans)\r\nprint(ans)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nres = 0\n\nfor i in range(m):\n l, r = map(int, input().split())\n# print(sum(a[(l-1):r]))\n if sum(a[l-1:r]) > 0:\n res += sum(a[l-1:r])\n\nprint(res)\n", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nprefs=[0]n\r\nprefs[0]=arr[0]\r\nfor i in range(1,n):\r\n prefs[i]=prefs[i-1]+arr[i]\r\nsum1=0\r\nfor i in range(m):\r\n l,r=map(int,input().split())\r\n l,r=l-1,r-1\r\n if(l==0):\r\n if(prefs[r]>0):\r\n sum1=sum1+prefs[r]\r\n else:\r\n if(prefs[r]-prefs[l-1]>0):\r\n sum1=sum1+prefs[r]-prefs[l-1]\r\nprint(sum1)", "N, M = map(int, input().split())\nArr = list(map(int, input().split()))\nscore = 0\nfor _ in range(M):\n A, B = map(int, input().split())\n tot = 0\n for i in range(A-1, B):\n tot += Arr[i]\n if tot > 0:\n score += tot\nprint(score)\n", "n,m=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\nt=[]\r\nt1=[]\r\n\r\nfor i in range(m):\r\n l1=[]\r\n l2=[]\r\n a,b=map(int,input().split())\r\n for j in range(a-1,b):\r\n l1.append(l[j])\r\n l2.append(j)\r\n \r\n t.append(l1)\r\n t1.append(l2)\r\n\r\n \r\nif max(l)<=0:\r\n print(\"0\")\r\n\r\nelse:\r\n q=[0]100\r\n\r\n for i in range(len(t)):\r\n k=sum(t[i])\r\n if k>0:\r\n for j in range(len(t[i])):\r\n q[t1[i][j]]+=1\r\n \r\n su=0\r\n for i in range(n):\r\n su+=l[i]q[i]\r\n\r\n print(su)\r\n", "n, m = list(map(int, input().split()))\r\nflowers = list(map(int, input().split()))\r\nseqs = [list(map(int, input().split())) for i in range(m)]\r\n\r\nmax_mood = 0\r\nfor (l, r) in seqs:\r\n max_mood += max(0, sum(flowers[l - 1:r]))\r\n\r\nprint(max_mood)\r\n", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ntemp=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n k=sum(x[a-1:b])\r\n if(k>0):\r\n temp+=k\r\nprint(temp) ", "def main():\r\n\t(n, m) = (int(x) for x in input().split())\r\n\tmoods = [int(x) for x in input().split()]\r\n\tsubs = [None] * m\r\n\tfor i in range(m):\r\n\t\t(l, r) = (int(x) for x in input().split())\r\n\t\tsubs[i] = (l, r)\r\n\tprint(solver(moods, subs))\r\n\r\ndef solver(moods, subs):\r\n\tn = len(moods)\r\n\tgrid = [[None] * (n + 1) for i in range(n)]\r\n\t# first line\r\n\ttotal = 0\r\n\tgrid[0][0] = 0\r\n\tfor j in range(n):\r\n\t\ttotal += moods[j]\r\n\t\tgrid[0][j+1] = total\r\n\t#print(grid)\r\n\tfor i in range(1, n):\r\n\t\tfor j in range(i, n + 1):\r\n\t\t\tgrid[i][j] = grid[i-1][j] - moods[i-1]\r\n\t#print(grid)\r\n\ttotal = 0\r\n\tfor (l, r) in subs:\r\n\t\t(i, j) = (l - 1, r)\r\n\t\tif grid[i][j] > 0:\r\n\t\t\ttotal += grid[i][j]\r\n\treturn total\r\n\r\n# moods1 = [1, 2, 3, 4]\r\n# subs1 = [(1, 3), (2, 4), (1, 1)]\t\r\n# print(solver(moods1, subs1))\r\n\r\n# moods2 = [1, -2, 1, 3, -4]\r\n# subs2 = [(1, 2), (4, 5), (3, 4), (1, 4)]\t\r\n# print(solver(moods2, subs2))\r\n\r\nmain()\r\n\r\n\r\n", "n , k = map(int , input().split())\r\narr = list(map(int , input().split()))\r\n\r\na = list()\r\na.append(arr[0])\r\n\r\nfor i in range(1 , n):\r\n a.append(a[i-1]+arr[i])\r\n \r\n\r\nc = 0\r\n\r\nfor i in range(k):\r\n l ,r = map(int , input().split())\r\n \r\n if(l == 1):\r\n s = a[r-1];\r\n \r\n \r\n else:\r\n s = a[r-1]-a[l-2];\r\n \r\n if s >= 0:\r\n c += s\r\n \r\n \r\n \r\nprint(c)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nres = 0\nfor i in range(m):\n curr = 0\n l, r = map(int, input().split())\n for j in range(l - 1, r):\n curr += a[j]\n if curr > 0:\n res += curr\nprint(res)", "n,m = [int(x) for x in input().strip().split()]\nmoods = [int(x) for x in input().strip().split()]\n\ndp = [0] * (n + 1)\ndp[1] = moods[0]\nfor i in range(2, n + 1):\n dp[i] = dp[i-1] + moods[i-1]\n\ntotal = 0\n\nfor i in range(m):\n l,r = [int(x) for x in input().strip().split()]\n # can't be negative\n sub_sum = dp[r] - dp[l-1]\n if sub_sum > 0:\n total += sub_sum\n\nprint(total)", "#!/usr/bin/env python3\r\n\r\ndef main():\r\n try:\r\n while True:\r\n n, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n result = 0\r\n for i in range(m):\r\n left, right = map(int, input().split())\r\n s = sum(a[left - 1:right])\r\n if s > 0:\r\n result += s\r\n print(result)\r\n\r\n except EOFError:\r\n pass\r\n\r\nmain()\r\n", "cases = input().split()\r\nn = int(cases[0])\r\nm = int(cases[1])\r\narray = input().split()\r\nsums = 0\r\nfor i in range(m):\r\n\tinputs = input().split()\r\n\tstart = int(inputs[0])\r\n\tend = int(inputs[1])\r\n\tsub = array[start-1:end]\r\n\tvalue = 0\r\n\tfor j in sub:\r\n\t\tvalue += int(j)\r\n\tif value >= 0:\r\n\t\tsums += value\r\nprint(sums)", "n,m=map(int,input().split())\r\na=[int(_) for _ in input().split()]\r\nans=0\r\nfor i in range(m):\r\n l,r=map(int,input().split())\r\n s=0\r\n for j in range(l-1,r):\r\n s+=a[j]\r\n if s>0 : ans+=s\r\nprint(ans)", "# https://codeforces.com/problemset/problem/740/B\r\n\r\nfirst_line_input = input()\r\n\r\nnumber_of_flowers = list(map(int, first_line_input.split(\" \")))[0]\r\n\r\nnumber_of_suggestions = list(map(int, first_line_input.split(\" \")))[1]\r\n\r\nflower_mood_list = list(map(int, input().split(\" \")))\r\n\r\nsub_array_indices = []\r\n\r\nfor i in range(number_of_suggestions):\r\n\tindex_i = list(map(int, input().split(\" \")))\r\n\tsub_array_indices.append(list(map(lambda x:x-1, index_i)))\r\n\r\n\r\n#print(\"number of flowers:\", number_of_flowers)\r\n#print(\"number of mother's suggestions:\", number_of_suggestions)\r\n#print(\"list of flowers: \", flower_mood_list)\r\n#print(\"sub-arrays-indices: \", sub_array_indices)\r\n\r\nfinal_answer = 0\r\n\r\nfor suggestion in range(number_of_suggestions):\r\n\t#print(\"suggestion number: \", suggestion)\r\n\tsuggestion_array_sum = 0\r\n\tfor sub_array_index in range(sub_array_indices[suggestion][0], sub_array_indices[suggestion][1]+1):\r\n\t\tsuggestion_array_sum = suggestion_array_sum + flower_mood_list[sub_array_index]\r\n\r\n\t#print(\"suggestion sum: \", suggestion_array_sum)\r\n\r\n\tif suggestion_array_sum > 0:\r\n\t\tfinal_answer = final_answer + suggestion_array_sum\r\n\r\nprint(final_answer)", "class NumArray(object):\r\n def __init__(self, nums):\r\n \"\"\"\r\n initialize your data structure here.\r\n :type nums: List[int]\r\n \"\"\"\r\n self.accu = [0]\r\n for num in nums: \r\n self.accu.append(self.accu[-1] + num),\r\n\r\n def sumRange(self, i, j):\r\n \"\"\"\r\n sum of elements nums[i..j], inclusive.\r\n :type i: int \r\n :type j: int\r\n :rtype: int \r\n \"\"\"\r\n return self.accu[j + 1] - self.accu[i]\r\n\r\nn, m = list(map(int, input().split(' ')))\r\nnums = list(map(int, input().split(' ')))\r\nnumArray = NumArray(nums)\r\narr = []\r\nfor i in range(m):\r\n k, l = list(map(int, input().split(' ')))\r\n arr.append(numArray.sumRange(k-1, l-1))\r\n\r\ns=0\r\nfor el in arr:\r\n if el > 0:\r\n s+=el\r\nprint(s)\r\n", "ii = lambda: int(input())\r\nmi = lambda: map(int, input().split())\r\nli = lambda: list(mi())\r\nsi = lambda: input()\r\n\r\nn, m = mi()\r\nl = li()\r\nh = 0\r\n\r\nfor _ in range(m): x, y = mi(); h += max(0, sum((l[k] for k in range(x-1, y))))\r\n\r\nprint(h)", "read=lambda:map(int,input().split())\r\nn,m=read()\r\na=list(read())\r\ns=[0](n+1)\r\nfor i in range(n):\r\n s[i+1]=s[i]+a[i]\r\nans=0\r\nfor _ in range(m):\r\n l,r=read()\r\n t=s[r]-s[l-1]\r\n if t>0:\r\n ans+=t\r\nprint(ans)\r\n", "n, m = map(int, input().split() )\r\nf = list(map(int, input().split() ))\r\ns = [0]m\r\nfor i in range(m):\r\n s[i] = list(map(int, input().split() ))\r\n\r\nt = [0]m\r\n\r\nfor i in range(m):\r\n x = 0\r\n for j in range(s[i][0] - 1, s[i][1] ):\r\n x += f[j]\r\n t[i] = x\r\nx = 0\r\nt = sorted(t)\r\nfor i in range(len(t)-1, -1, -1):\r\n if t[i] > 0:\r\n x+=t[i]\r\nprint(x)\r\n\r\n", "n,m = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nans = 0\r\nfor j in range(m):\r\n per1,per2 = map(int,input().split())\r\n cou = sum(A[per1-1:per2])\r\n if cou > 0:\r\n ans += cou\r\nprint(ans)", "n, m = map(int, input().split())\r\n \r\na = [int(i) for i in input().split()]\r\n \r\ngood_sub_arr = []\r\n \r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n l -= 1\r\n \r\n cur_happiness = 0\r\n for i in range(l, r):\r\n cur_happiness += a[i]\r\n \r\n if cur_happiness > 0:\r\n good_sub_arr.append((l, r))\r\n \r\ntotal_happiness = 0\r\n \r\nfor i in range(n):\r\n mul = 0\r\n for j in range(len(good_sub_arr)):\r\n if good_sub_arr[j][0] <= i and i < good_sub_arr[j][1]:\r\n mul += 1\r\n \r\n total_happiness += mul a[i]\r\n \r\nprint(total_happiness)", "n, m = [int(i) for i in input().split()]\n\nflowers_moods = [int(i) for i in input().split()]\n\nsubarrays = [[int(i) - 1 for i in input().split()] for j in range(m)]\n\n\ndef find_sum_sub_array(s, f, arr):\n sum = 0\n for i in range(s, f + 1):\n sum += arr[i]\n\n return sum\n\n\ndef main(flowers_moods, subarrays):\n lst_sums = []\n for subarr in subarrays:\n s = find_sum_sub_array(subarr[0], subarr[1], flowers_moods)\n lst_sums.append(s)\n\n lst_sums.sort(reverse=True)\n happiness = 0\n for sum in lst_sums:\n if sum <= 0:\n break\n happiness += sum\n return happiness\n\nprint(main(flowers_moods, subarrays))\n\n\n\n\n\n\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\npm = [0]n\r\npm[0] = arr[0]\r\nfor i in range(n):\r\n pm[i] = pm[i - 1] + arr[i]\r\n\r\nans = 0\r\nsum = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n l -= 1\r\n r -= 1\r\n if l > 0:\r\n ans = pm[r] - pm[l - 1]\r\n else:\r\n ans = pm[r]\r\n if ans > 0:\r\n sum += ans\r\nif sum > 0:\r\n print(sum)\r\nelse:\r\n print(\"0\")\r\n\r\n", "from math import \r\nfrom sys import \r\nfrom queue import \r\nfrom decimal import \r\n\r\nn,m=(int(z) for z in input().split())\r\ns=[int(z) for z in input().split()]\r\nR=[]\r\nfor i in range(m):\r\n le,r=(int(z) for z in input().split())\r\n summ=0\r\n for j in range(le-1,r):\r\n summ+=s[j]\r\n R.append(summ)\r\nans=0\r\nfor i in R:\r\n if i>=0:\r\n ans+=i\r\nprint(ans)", "from typing import List\r\n\r\n# Array re arrange a[i] = j to a[j] =1\r\n# O(m)\r\n# O(n) space\r\nclass Solution:\r\n def alaynaFlowers(self, arr: List[int], n: int,m: int) -> int:\r\n k = len(arr)\r\n psum = [0] n\r\n psum[0] = arr[0]\r\n for i in range(1,k):\r\n psum[i] = psum[i-1] + arr[i]\r\n\r\n total = 0\r\n # print(psum)\r\n for i in range(0,m):\r\n l,r = map(int,input().split())\r\n l -= 1\r\n r -= 1\r\n\r\n if l < 1:\r\n sum = psum[r]\r\n else:\r\n sum = psum[r] - psum[l-1]\r\n # print(sum)\r\n if sum > 0: total += sum\r\n\r\n return total\r\n\r\n'''\r\ninput\r\n5 4\r\n1 -2 1 3 -4\r\n0 1\r\n3 4\r\n2 3\r\n0 3\r\noutput\r\n7\r\n'''\r\nif __name__ == '__main__':\r\n sol = Solution()\r\n n,m = map(int,input().split())\r\n\r\n arr = [int(i) for i in input().split()]\r\n total = sol.alaynaFlowers(arr,n,m)\r\n\r\n print(total)\r\n", "def cin():\n return list(map(int, input().split()))\n \nn,m=cin()\nA=cin()\ns=0\nfor i in range(m):\n a,b=cin()\n B = sum(A[a-1:b])\n s+=max(0,B)\nprint(s)\n\n \t\t \t \t \t \t\t \t\t \t\t\t\t", "no_flowers, no_subarrays = map(int, input().split())\r\nflowers = [int(x) for x in input().split()]\r\n\r\ntotal_happiness = 0\r\n\r\nfor i in range(no_subarrays):\r\n\tdata = [int(x) for x in input().split()]\r\n\r\n\ttmp = sum(flowers[(data[0]-1):data[1]])\r\n\r\n\tif total_happiness + tmp > total_happiness:\r\n\t\ttotal_happiness += tmp\r\n\r\nprint(total_happiness)\r\n\r\n", "s=list(map(int,input().split()))\r\nn=s[0]\r\nm=s[1]\r\nl=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(m):\r\n arr.append(list(map(int,input().split())))\r\n print()\r\npre=[None for x in range(n)]\r\npre[0]=l[0]\r\nfor i in range(1,n):\r\n pre[i]=pre[i-1]+l[i]\r\nans=0\r\nfor j in arr:\r\n l=j[0]-1\r\n r=j[1]-1\r\n if l!=0:\r\n if pre[r]-pre[l-1]>0:\r\n ans+=(pre[r]-pre[l-1])\r\n else:\r\n if pre[r]>0:\r\n ans+=pre[r]\r\n\r\n\r\n\r\nprint(ans)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom itertools import accumulate\r\n\r\nn, m = map(int, input().split())\r\nw = list(accumulate(map(int, input().split())))\r\ns = 0\r\nfor _ in range(m):\r\n l, r = map(int, input().split())\r\n c = w[r-1] - (w[l-2] if l > 1 else 0)\r\n if c > 0:\r\n s += c\r\nprint(s)", "\r\nn, m = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nans = 0\r\nfor _ in range(m):\r\n\tl, r = map(int, input().split())\r\n\tans += max(0, sum(li[l - 1:r]))\r\n\r\nprint(ans)", "n, m = [int(x) for x in input().split()]\r\nif n == 0:\r\n exit()\r\narr = list(map(int,input().rstrip().split()))\r\nans = 0\r\npMax = []\r\npMax.append(arr[0])\r\nfor i in range(1,n):\r\n pMax.append(pMax[i-1]+arr[i])\r\nfor i in range(m):\r\n a, b = [int(x) for x in input().split()]\r\n if a > 1:\r\n diff = pMax[b-1] - pMax[a-2]\r\n else:\r\n diff = pMax[b-1]\r\n\r\n if diff > 0:\r\n ans+=diff\r\nprint(ans)\r\n", "n, m = map(int, input().split())\n\nA = list(map(int, input().split()))\n\nres = 0\n\nfor _ in range(m):\n l, r = map(int, input().split())\n\n sum = 0\n\n for i in range(l - 1, r):\n sum += A[i]\n\n if sum > 0:\n res += sum\n\nprint(res)\n", "n,m=map(int,input().split())\nip=list(map(int,input().split()))\nans=0\nfor i in range(m):\n a,b=map(int,input().split())\n s=0\n a-=1\n b-=1\n for j in range(a,b+1):\n s+=ip[j]\n if s>0:\n ans+=s\nprint(ans)\n", "n,m = map(int, input().split())\r\nnum = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor _ in range(m):\r\n a,b = map(int, input().split())\r\n cnt = sum(num[a-1:b])\r\n if cnt>0: ans += cnt\r\nprint(ans)", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nprefixSum = [0]n\r\nprefixSum[0] = arr[0]\r\n\r\nfor i in range(1, n):\r\n prefixSum[i] = prefixSum[i-1] + arr[i]\r\nans = 0\r\n\r\nfor _ in range(m):\r\n l, r = map(int, input().split())\r\n summ = 0\r\n if l==1:\r\n summ = prefixSum[r-1]\r\n else:\r\n summ = prefixSum[r-1] - prefixSum[l-2]\r\n\r\n if summ>0:\r\n ans += summ\r\n\r\nprint(ans)", "n,m= map(lambda x:int(x),input().split())\r\na = list(map(lambda x:int(x),input().split()))\r\ns = [0]m\r\nfor i in range(m):\r\n\tl,r= map(lambda x:int(x),input().split())\r\n\ts[i] = max(sum(a[l-1:r]),0)\r\nprint(sum(s))", "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\nfor i in range(m):\n x, y = map(int, input().split())\n curr = sum(a[x - 1 : y])\n curr = max(0, curr)\n ans += curr\n\nprint(ans)\n", "def main():\r\n m,n= list(map(int,input().strip().split()))[:2]\r\n\r\n l=[]\r\n sl=[]\r\n\r\n l = list(map(int,input().strip().split()))[:m]\r\n\r\n flag=[]\r\n for i in range(n):\r\n\r\n flag= list(map(int,input().strip().split()))[:2]\r\n sl.append(flag)\r\n sum=[]\r\n sum.append(l[0])\r\n for i in range(1,m):\r\n\r\n\r\n sum.append(l[i]+sum[i-1])\r\n s=list(sum)\r\n total=0\r\n for i in sl:\r\n a=i[0]-1\r\n b=i[1]-1\r\n\r\n if a==0:\r\n\r\n if sum[b]>0:\r\n total=total+sum[b]\r\n else:\r\n if sum[b]-sum[a-1]>0:\r\n total=total+sum[b]-sum[a-1]\r\n\r\n print(total)\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a,b=map(int,input().split())\r\nz=[0]\r\nfor i in map(int,input().split()):z+=[z[-1]+i]\r\ns=0\r\nfor _ in \" \"b:\r\n x,y=map(int,input().split())\r\n s+=max(0,z[y]-z[x-1])\r\nprint(s)", "import random, math\nfrom copy import deepcopy as dc\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 calculate the range values\ndef range_value(li, l, r):\n\tif l == 1:\n\t\tst = 0\n\telse:\n\t\tst = li[l-2]\n\treturn li[r-1] - st\n\n# Function to call the actual solution\ndef solution(n, m, li, arr):\n\t# Prefix Sum Array\n\tprefix_sum = [0] n\n\tprefix_sum[0] = li[0]\n\tfor i in range(1, n):\n\t\tprefix_sum[i] = li[i] + prefix_sum[i-1]\n\t# print(prefix_sum)\n\t# print(range_value(prefix_sum, 2, 2))\n\tans = 0\n\tfor i in arr:\n\t\tval = range_value(prefix_sum, i[0], i[1])\n\t\tif val > 0:\n\t\t\tans += val\n\t\t# print(val)\n\treturn ans\n\n\n# Function to take input\ndef input_test():\n\tn, m = list(map(int, input().strip().split(\" \")))\n\tli = list(map(int, input().strip().split(\" \")))\n\tarr = []\n\tfor i in range(m):\n\t\tl, r = map(int, input().strip().split(\" \"))\n\t\tarr.append([l, r])\n\tout = solution(n, m, li, arr)\n\tprint(out)\n\t# for _ in range(int(input())):\n\t\t# solution()\n\n# Function to check test my code\ndef test():\n\tpass\n\n\ninput_test()\n# test()", "import sys\r\nfrom math import floor, gcd,factorial\r\nfrom collections import deque\r\n\r\n\r\ninput = sys.stdin.readline\r\ndef printf(x, end='\\n'):\r\n sys.stdout.write(str(x) + end) \r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\ndef main():\r\n T=1\r\n #T=int(input())\r\n def solve():\r\n arr=list(map(int,input().split()))\r\n n,m=arr[0],arr[1]\r\n arr=list(map(int,input().split()))\r\n prefix=[0](n+1)\r\n ans=0\r\n dict={}\r\n for i in range(1,n+1):\r\n prefix[i]=arr[i-1]+prefix[i-1]\r\n for i in range(m):\r\n b=list(map(int,input().split()))\r\n l,r=b[0],b[1]\r\n if(prefix[r]-prefix[l-1]>0):\r\n for i in range(l-1,r):\r\n if(i in dict.keys()):\r\n dict[i]+=1\r\n else :\r\n dict[i]=1 \r\n score=0\r\n for keys in dict:\r\n score+=arr[keys]dict[keys]\r\n print(score) \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n for i in range(T):\r\n solve()\r\n pass \r\n\r\n \r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, q = [int(x) for x in input().split()]\r\n\r\narr1 = [int(x) for x in input().split()]\r\n\r\nprefix_sum = [0]len(arr1)\r\nprefix_sum[0] = arr1[0]\r\nfor i in range(1, n):\r\n prefix_sum[i] = prefix_sum[i-1]+ arr1[i]\r\n# print(prefix_sum)\r\nresult = 0\r\nfor i in range(q):\r\n sum1 = 0\r\n left, right = [int(x) for x in input().split()]\r\n left-=1\r\n right-=1\r\n sum1= prefix_sum[right]-prefix_sum[left] + arr1[left]\r\n\r\n if sum1>0:\r\n result+=sum1\r\n # print(result)\r\nprint(result)", "import math\r\nk = (input().split())\r\nn = int(k[0])\r\nm = int(k[1])\r\na = []\r\n\r\nk = (input().split())\r\n\r\nfor i in range(n):\r\n a.append(int(k[i]))\r\ns = 0\r\nres = 0\r\nfor i in range(m):\r\n s = 0\r\n k = (input().split())\r\n l = int(k[0])\r\n r = int(k[1])\r\n for j in range(l-1,r):\r\n s += a[j]\r\n if s>=0:\r\n res+=s\r\n\r\nprint(res)\r\n", "n, m = map(int, input().split())\n\nar = [int(i) for i in input().split()]\n\nleftsum = [0 for _ in range(n)]\nleftsum[0] = ar[0]\nfor i in range(1,n):\n\tleftsum[i] = leftsum[i-1] + ar[i]\n\nqueries = []\ntotals = []\nfor _ in range(m):\n\tl, r = map(int, input().split())\n\tl-=1\n\tr-=1\n\tqueries.append((l,r))\n\t\n\ttot = leftsum[r]\n\tif l!=0:tot -= leftsum[l-1]\n\ttotals.append(tot)\n\ncounter = [ 0 for _ in range(n)]\nans = 0\nfor _ in range(m):\n\tidx = totals.index(max(totals))\n\tl,r = queries[idx]\n\ttemp = 0\n\tfor i in range(l,r+1):\n\t\tcounter[i]+=1\n\tfor i in range(n):\n\t\ttemp += counter[i]ar[i]\n\n\tif temp>ans:\n\t\tans = temp\n\n\ttotals[idx] = -10*9 \nprint(ans)", "n , m = map(int, input().split())\nc = list(map(int, input().split()))\npref = [c[0]]\nfor i in range(1, len(c)):\n pref.append(pref[-1] + c[i])\nsm = 0\nfor i in range(m):\n b, e = map(int, input().split())\n if b > 1:\n k = pref[e - 1] - pref[b - 2]\n else:\n k = pref[e - 1]\n if k > 0:\n sm += k\nprint(sm)", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nsubarrs = [list(map(int, input().split())) for i in range(m)]\r\nsums = []\r\nsum = 0\r\n\r\nfor i in arr:\r\n sum = sum+i\r\n sums.append(sum)\r\n\r\nmaxSum = 0\r\nfor subarr in subarrs:\r\n subarraySum = sums[subarr[1] - 1] if subarr[0] == 1 else (sums[subarr[1]-1] - sums[subarr[0]-2])\r\n if subarraySum > 0:\r\n maxSum = maxSum + subarraySum\r\n\r\nprint(maxSum)", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nt=0\r\nfor i in range(m):\r\n b=[int(i)-1 for i in input().split()]\r\n if sum (a[b[0]:b[1]+1])>0:\r\n t+=sum (a[b[0]:b[1]+1])\r\nprint(t)\r\n", "from itertools import accumulate\n\nn, m = map(int, input().split())\nA = [0] + [int(x) for x in input().split()]\nP = list(accumulate(A))\ns = 0\n\nfor i in range(m):\n l, r = map(int, input().split())\n k = P[r] - P[l-1]\n if k > 0: s += k\n\nprint(s)\n", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nii = lambda: int(input())\nmi = lambda: map(int, input().split())\nli = lambda: list(mi())\nsi = lambda: input()\n\nn, m = mi()\nl = li()\nh = 0\n\nfor _ in range(m): x, y = mi(); h += max(0, sum((l[k] for k in range(x-1, y))))\n\nprint(h)\n\n\n\n \n\n", "n,m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nd = {x+1:c[x] for x in range(n)}\r\nans = 0\r\nfor _ in range(m):\r\n tem = 0\r\n a,b= map(int,input().split())\r\n for x in range(a,b+1):\r\n tem += d[x]\r\n if tem>0: ans += tem\r\nprint(ans)", "n, m = map(int, input().split())\r\nl1 = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n sum1 = 0\r\n l, r = map(int, input().split())\r\n l -= 1\r\n r -= 1\r\n for j in range(l, r + 1):\r\n sum1 += l1[j]\r\n if sum1 > 0:\r\n ans += sum1\r\nprint(ans)\r\n ", "n, m = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(m):\r\n d, f = map(int, input().split())\r\n sb = sum(a[d - 1: f])\r\n if sb > 0:\r\n ans += sb\r\nprint(ans)", "n, m = map(int, input().split())\r\nmood = [int(c) for c in input().split()]\r\n\r\nans = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n _sum = sum(mood[l-1:r])\r\n if _sum >= 0:\r\n ans += _sum\r\n\r\nprint(ans) \r\n", "n,m = [int(x) for x in input().split()]\r\nflowers = [int(x) for x in input().split()]\r\nhappy_sum = 0\r\nfor i in range(m):\r\n\tl,r = [int(x) for x in input().split()]\r\n\tsum_fl = sum(flowers[l-1:r])\r\n\tif sum_fl > 0:\r\n\t\thappy_sum += sum_fl\r\n\r\nprint(happy_sum)", "\r\n# 1<= n,m <= 100\r\n# -100 <= ai <= 100\r\n\r\nfrom collections import defaultdict\r\n\r\ndef solve(n,m,arr,subarr):\r\n\t\r\n\t# mood of ith flower is ai.\r\n\t\r\n\t# If we get negative as ans then print 0\r\n\t# Cuz we can always choose none.\r\n\t\r\n\t# Choose subarrays with sum>=0\r\n\t# That's all\r\n\t\r\n\thm = defaultdict(int)\r\n\t\r\n\t# Converting to one based indexing.\r\n\tfor l,r in subarr :\r\n\t\thm[(l-1,r-1)] +=1\r\n\t\r\n\tans = 0\r\n\t\r\n\tfor st in range(n):\r\n\t\ttsum = 0\r\n\t\tfor en in range(st,n):\r\n\t\t\t# We can choose that\r\n\t\t\ttsum += arr[en]\r\n\t\t\tif (st,en) in hm and tsum>=0 :\r\n\t\t\t\tans+= (tsum)hm[(st,en)]\t\r\n\t\t\t\t\r\n\tprint(ans)\r\n\t\r\nn,m = map(int,input().split())\r\narr= list(map(int,list(input().split())))\r\nsubarr = []\r\nfor i in range(m):\r\n\tli,ri = map(int,input().split())\r\n\tsubarr.append([li,ri])\r\n\r\nsolve(n,m,arr,subarr)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nout = 0\r\nl = [] # list of index tuples\r\nfor i in range(m):\r\n l.append(tuple(map(int, input().split())))\r\n\r\nfor tup in l:\r\n #print(a[tup[0]-1:tup[1]])\r\n val = sum(a[tup[0]-1:tup[1]])\r\n if val > 0:\r\n out += val\r\nprint(out)", "from itertools import accumulate as pre\r\nn, m = map(int, input().split())\r\nmood = list(map(int, input().split()))\r\nmoodseg = [0]+list(pre(mood))\r\nhap = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n if moodseg[r] - moodseg[l - 1] > 0: hap += (moodseg[r] - moodseg[l - 1])\r\nprint(hap)\r\n", "n, m = list(map(int, input().split()))\r\nline = list(map(int, input().split()))\r\nanswer = 0\r\nfor i in range(m):\r\n a, b = list(map(int, input().split()))\r\n s = 0\r\n for j in range(a - 1, b):\r\n s += line[j]\r\n if s >= 0:\r\n answer += s\r\nprint(answer) \r\n", "n, m = [int(i) for i in input().split()]\namood = [int(i) for i in input().split()]\nmaxval = 0\ncumulant = [0 for i in range(n+1)]\nfor i in range(1, n+1):\n cumulant[i] = cumulant[i-1] + amood[i-1]\nfor i in range(m):\n l, r = [int(j) for j in input().split()]\n tmp = cumulant[r] - cumulant [l-1]\n if tmp > 0:\n maxval += tmp\nprint(maxval)", "n, m = list(map(int, input().split()))\na = list(map(int, input().split()))\ntotal = 0\nfor i in range(m):\n l, r = list(map(int, input().split()))\n ai = a[l-1:r]\n sumai = sum(ai)\n if (sumai>0):\n total += sumai\n\nprint(total)\n", "from sys import prefix\n\n\nn, q = [int(x) for x in input().split()]\narr = [int(x) for x in input().split()]\n\nprefixSum =[sum(arr[ :i+1]) for i in range(len(arr))]\n\n\n# print(prefixSum)\ntotal = 0\nwhile q:\n strtIdx , endIdx = [int(x) for x in input().split()]\n strtIdx-=1\n endIdx-=1\n if strtIdx==0:\n sum = prefixSum[endIdx]\n else:\n sum = prefixSum[endIdx]-prefixSum[strtIdx-1]\n q-=1\n if sum>0:\n total+=sum\nprint(total)\n \n\n", "#Codeforces : Alyona And Flowers\r\nn,m=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nl=[[int(x) for x in input().split()] for y in range(m)]\r\nresult=0\r\nfor p,q in l:\r\n ssum=0\r\n for x in range(p-1,q,1):\r\n ssum+=a[x]\r\n \r\n if(ssum>0):\r\n result+=ssum\r\n else:\r\n pass\r\n \r\nprint(result)\r\n ", "n, m = map(int, input().split())\nv = list(map(int, input().split()))\nans = 0\nfor i in range(m):\n\ta, b = map(int, input().split())\n\tans = max(ans, sum(v[a - 1: b]) + ans)\nprint(ans)", "n,m=map(int,input().split())\r\nl=[0]+list(map(int,input().split()))\r\nf=[0](n+1)\r\nfor _ in range(m):\r\n i,j=map(int,input().split())\r\n if sum(l[i:j+1])>0:\r\n for ii in range(i,j+1):\r\n f[ii]+=1\r\nans=0\r\nfor i in range(n+1):\r\n ans+=f[i]l[i]\r\nprint(ans)", "n, m = map(int, input().split())\r\nd = [0]\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n d.append(d[-1] + a[i])\r\n\r\nnum = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n if d[r] - d[l - 1] > 0:\r\n num += d[r] - d[l - 1]\r\n\r\nprint(num)\r\n", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nsums=0\r\nl=[]\r\ng=[]\r\nfor i in range(m):\r\n b,c=[int(i) for i in input().split()]\r\n l=a[b-1:c]\r\n c=set(l)\r\n for i in c:\r\n sums=sums+(il.count(i))\r\n if(sums<0):\r\n sums=0\r\n else:\r\n g.append(sums)\r\n sums=0\r\nprint(sum(g))\r\n", "n, m = map(int, input().split())\r\nL = list(map(int, input().split()))\r\nM = [0] n\r\nans = 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n if sum(L[a - 1:b]) > 0:\r\n for j in range(a - 1, b):\r\n M[j] += 1\r\nfor i in range(n):\r\n ans += L[i] * M[i]\r\n \r\nprint(ans)\r\n#print(M)\r\n \r\n", "n,m = map(int, input().strip().split())\r\narr = list(map(int, input().strip().split()))\r\n\r\n# preSum = [0]n\r\npreSum = [arr[0]]\r\nfor i in range(1,n):\r\n\tans = preSum[i-1] + arr[i]\r\n\tpreSum.append(ans)\r\n# print(preSum)\r\nres = 0\r\nfor i in range(m):\r\n\tl,r = map(int, input().strip().split())\r\n\tif(l == 1):\r\n\t\tans = preSum[r-1]\r\n\t\t# print(ans)\r\n\telse:\r\n\t\tans = preSum[r-1] - preSum[l-2]\r\n\t\t# print(ans)\r\n\tif (ans>0):\r\n\t\tres += ans\r\nprint(res)", "n,t = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\npresum = []\r\npresum.append(arr[0])\r\nfor i in range(1,n):\r\n presum.append(arr[i] + presum[i-1])\r\n\r\nans = 0\r\nfor _ in range(t):\r\n i, j = map(int, input().split())\r\n x = presum[j-1]-presum[i-2] if i>1 else presum[j-1]\r\n ans += max(0, x)\r\nprint(ans)", "from math import ceil\r\nfrom sys import stdin ,stdout \r\ninput=stdin.readline\r\ndef print(args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\nn,m=map(int,input().split()) ; arr=list(map(int,input().split())) ; ans=0\r\nfor i in range(1,n):\r\n arr[i]+=arr[i-1]\r\nfor i in range(m):\r\n l,r=map(int,input().split()) ; l-=1 ; r-=1\r\n if l==0:\r\n if arr[r]>0:\r\n ans+=arr[r]\r\n else:\r\n if arr[r]-arr[l-1]>0:\r\n ans+=arr[r]-arr[l-1]\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns = [0]\r\nk=0\r\nfor i in l:\r\n\ts.append(s[k]+i)\r\n\tk+=1\r\ntot=0\r\nfor __ in range(m):\r\n\ta,b=map(int,input().split())\r\n\tif(s[b]-s[a-1]>=0):\r\n\t\ttot+=(s[b]-s[a-1])\r\nprint(tot)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=[0 for i in range(n)]\r\nsu=[]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n su.append([a,b])\r\n if sum(l[a-1:b])>0:\r\n for j in range(a-1,b):\r\n l1[j]+=1\r\nans=0\r\n#print(l1)\r\nfor i in range(n):\r\n ans+=l[i]l1[i]\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\narr = [int(x) for x in input().split()]\r\nd = [0] n\r\nans = 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n \r\n s = 0\r\n for j in range(a-1, b):\r\n s += arr[j]\r\n if s > 0:\r\n ans += s\r\nprint(ans)\r\n\r\n", "def gum(mas,a,b):\r\n k=0\r\n for i in range(a,b+1):\r\n k+=mas[i]\r\n \r\n return k\r\n\r\ns=input().split()\r\nn=int(s[0])\r\nm=int(s[1])\r\nmas=[]\r\ns=input().split()\r\nfor i in range(0,n):\r\n mas.append(int(s[i]))\r\n \r\nk=0\r\ni=0\r\nwhile i<m:\r\n s=input().split()\r\n a=int(s[0])\r\n b=int(s[1])\r\n if gum(mas,a-1,b-1)>0:\r\n k+=gum(mas,a-1,b-1)\r\n i+=1\r\nprint(k)", "n, m = map(int, input().split())\r\nfeels = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n in1, in2 = map(int, input().split())\r\n s = sum(feels[in1 - 1:in2])\r\n if s >= 0:\r\n ans += s\r\nprint(ans)", "p, q = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\nans = 0\r\nb = [(list(map(int, input().split()))) for i in range(q)]\r\nfor i in range(q):\r\n s = 0\r\n for j in range(b[i][0] - 1, b[i][1]):\r\n s += arr[j]\r\n if s > 0:\r\n ans += s\r\nprint(ans)\r\n", "n, m = map(int, input().split())\narr = list(map(int, input().split()))\n\nans = 0\nfor _ in range(m):\n l, r = map(int, input().split())\n s = sum(arr[l - 1: r])\n ans += max(s, 0)\n\nprint(ans)", "n, m = list(map(int, input().split(' ')))\n\nl = list(map(int, input().split(' ')))\nsl = [0]\nfor i in range(len(l)):\n sl.append(l[i] + sl[i])\n\nans = 0\nfor i in range(m):\n u, v = list(map(int, input().split(' ')))\n s = sl[v] - sl[u - 1]\n if s > 0:\n ans += s\n\nprint(ans)\n", "n,m=list(map(int,input().split()))\r\narra=list(map(int,input().split()))\r\nsu=0\r\nfor e in range(m):\r\n s,f=list(map(int,input().split()))\r\n s-=1\r\n q=0\r\n for i in range(s,f):\r\n q+=arra[i]\r\n if q>0:\r\n su+=q\r\nprint(su)\r\n", "from functools import lru_cache, reduce\r\nfrom bisect import bisect_left, bisect_right\r\nfrom types import GeneratorType\r\nimport sys\r\n\r\nMOD = 109+7\r\nHMOD = 998244353\r\nMAXN = 105+5\r\nINF = 1e20\r\nEPS = 1e-9\r\n\r\ninput = lambda : sys.stdin.readline().strip()\r\nprint = lambda args : sys.stdout.write(\" \".join(map(str, args)) + \"\\n\")\r\nwrite = lambda args : sys.stdout.write(\" \".join(map(str, args)))\r\n\r\ngetint = lambda : int(input())\r\ngetlist = lambda : list(map(int, input().split()))\r\ngetstr = lambda : list(input()) # mutable string\r\n\r\ndef solve():\r\n n,m = map(int, input().split())\r\n ps = [0] + getlist()\r\n for i in range(1, len(ps)): ps[i] += ps[i-1]\r\n subs = [tuple(map(int, input().split())) for _ in range(m)]\r\n print(sum(ps[s[1]]-ps[s[0]-1] for s in subs if ps[s[1]]-ps[s[0]-1] > 0))\r\n\r\ntestcases = 1\r\n# testcases = getint()\r\nfor c in range(1, testcases+1):\r\n #write(f\"Case {c}: \")\r\n solve()", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[21]:\n\n\nn, t = map(int, input().split())\nmood = list(map(int, input().split()))\nfor m in range(1, len(mood)):\n mood[m]+=mood[m-1]\n \n\ntotalHappiness = 0\nfor i in range(t):\n l, r = map(int, input().split())\n if(l==1):\n currentSum = mood[r-1]\n else:\n currentSum = mood[r-1]-mood[l-2]\n \n #print(currentSum)\n \n if(currentSum>0):\n totalHappiness+=currentSum\n \nprint(totalHappiness)\n\n\n# In[ ]:\n\n\n\n\n", "n,m=[int(x) for x in input().split()]\r\nmood= [int(x) for x in input().split()]\r\ntotal_hp=0\r\nprsum=[None]n\r\nprsum[0] = mood[0]\r\nfor i in range(1,n):\r\n prsum[i]=prsum[i-1]+mood[i]\r\n#print(prsum)\r\nfor i in range(m):\r\n l,r =[int(x) for x in input().split()]\r\n sum1=0\r\n if l>1:\r\n sum1 += prsum[r-1]-prsum[l-2]\r\n else:\r\n sum1 += prsum[r-1]\r\n if sum1>0:\r\n total_hp+=sum1\r\nprint(total_hp)", "a,b=map(int,input().split())\r\nz=list(map(int,input().split()))\r\ns=0\r\nfor _ in \" \"b:\r\n x,y=map(int,input().split())\r\n s+=max(0,sum(z[x-1:y]))\r\nprint(s)", "n, m = [int(i) for i in input().split(' ')]\r\narr = [int(i) for i in input().split(' ')]\r\ninp_interval = []\r\nfor i in range(m):\r\n inp_interval.append([int(i) for i in input().split(' ')])\r\nvalue_result_arr = []\r\nfor i in inp_interval:\r\n value_result_arr.append(sum(arr[i[0]-1:i[1]]))\r\nresult = 0\r\nfor i in value_result_arr:\r\n if i > 0:\r\n result = result + i\r\nprint(result)", "\r\nn,m=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nc=0\r\nfor i in range(m):\r\n l,r=list(map(int,input().split()))\r\n s=sum(l1[l-1:r])\r\n if s>0:c+=s\r\nprint(c)", "n,comb = map(int,input().split())\n\nnums = list(map(int,input().split()))\nres = 0\n\nfor _ in range(comb):\n start,end = map(int,input().split())\n temp_sum = 0\n for i in range(start-1,end):\n temp_sum += nums[i]\n if temp_sum > 0:\n res += temp_sum\n \nprint(res)\n\t\t \t \t \t\t\t\t \t\t\t\t \t \t\t\t \t \t\t", "raw = input().split()\r\nn = int(raw[0])\r\nm = int(raw[1])\r\nraw = input().split()\r\na = []\r\na.append(0)\r\ns = 0\r\nfor i in range(n):\r\n s += int(raw[i])\r\n a.append(s)\r\nres = 0\r\nfor i in range(m):\r\n raw = input().split()\r\n l = int(raw[0])\r\n r = int(raw[1])\r\n res += max(a[r] - a[l - 1], 0)\r\nprint(res)", "n,m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nprefixSum = [0]n\r\nprefixSum[0] = a[0]\r\nfor i in range(1,n):\r\n prefixSum[i] = prefixSum[i - 1] + a[i]\r\nsubarrSum = [0]m\r\nfor k in range(m):\r\n i,j = [int(x) for x in input().split()]\r\n subarrSum[k] = prefixSum[j - 1] - prefixSum[i - 1] + a[i - 1]\r\nhappiness = 0\r\nfor i in range(m):\r\n if subarrSum[i] > -1:\r\n happiness += subarrSum[i] \r\nprint(happiness)", "n, m = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\n\nsums = [0]\nfor x in a:\n sums.append(sums[-1] + x)\n\nans = 0\n\nwhile m:\n l, r = [int(x) for x in input().split()]\n m -= 1\n tmp = sums[r] - sums[l-1]\n if tmp > 0:\n ans += tmp\n\nprint(ans)\n", "def main():\n\tn,m=input().split()\n\tn,m=[int(n),int(m)]\n\tL=input().split()\n\tL=[int(x) for x in L]\n\tS=[0]n\n\tS[0]=L[0]\n\tfor i in range(1,len(L)):\tS[i]=S[i-1]+L[i]\n\tans=0\n\tfor _ in range(m):\n\t\tl,r=input().split()\n\t\tl,r=[int(l),int(r)]\n\t\tres=S[r-1]-S[l-1]+L[l-1]\n\t\tif res>0:\tans+=res\n\tprint(ans)\n\nif __name__ == '__main__':\n\tmain()", "n, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nsub = list()\r\n\r\nfor _ in range(m):\r\n sub.append(tuple(int(x) for x in input().split()))\r\n\r\nweights = list()\r\nfor i in range(m):\r\n start = sub[i][0]-1\r\n end = sub[i][1]\r\n happiness = sum(a[start:end])\r\n weights.append(happiness)\r\n\r\nselection = [x for x in weights if x > 0]\r\nprint(sum(selection))", "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\na = list(map(int, input().split()))\r\nb = [0]\r\nfor i in a:\r\n b.append(b[-1] + i)\r\nans = 0\r\nfor _ in range(m):\r\n l, r = map(int, input().split())\r\n ans += max(b[r] - b[l - 1], 0)\r\nprint(ans)", "#!/usr/bin/env python3\n# http://codeforces.com/problemset/problem/740/B\nnum_flowers, num_subarrays = map(int, input().split())\nflower_moods = list(map(int, input().split()))\nmax_happy = 0\nfor subarray_idx in range(num_subarrays):\n left, right = map(int, input().split())\n this_happy = sum(flower_moods[left - 1:right])\n if this_happy > 0:\n max_happy += this_happy\nprint(max_happy)\n", "def main():\n n, m = map(int, input().split())\n a, aa = 0, [0]\n for b in map(int, input().split()):\n a += b\n aa.append(a)\n res = 0\n for _ in range(m):\n lo, hi = map(int, input().split())\n sm = aa[hi] - aa[lo - 1]\n if sm > 0:\n res += sm\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n left, right = map(int, input().split())\r\n sm = 0\r\n for i in range(left - 1, right):\r\n sm += a[i]\r\n if (sm > 0):\r\n ans += sm\r\nprint(ans)\r\n", "data = list(map(int, input().split()))\r\nflowers_sum = [0 for i in range(data[0]+1)]\r\nrng = data[0]\r\nrequests = data[1]\r\n\r\ndata = list(map(int, input().split()))\r\n\r\nfor i in range(1, rng + 1):\r\n flowers_sum[i] = flowers_sum[i - 1] + data[i - 1]\r\n\r\nans = 0\r\nfor i in range(requests):\r\n l_r = list(map(int, input().split()))\r\n l = l_r[0]\r\n r = l_r[1]\r\n incr = flowers_sum[r] - flowers_sum[l-1]\r\n ans += (incr if incr > 0 else 0)\r\n\r\nprint(ans)\r\n", "# your code goes here\r\nimport sys\r\nN, M = map(int, sys.stdin.readline().strip().split())\r\nlista =[int(i) for i in sys.stdin.readline().strip().split()]\r\nd=0\r\nwhile (M>0):\r\n M-=1\r\n a, b = map(int, sys.stdin.readline().strip().split())\r\n c=0\r\n for x in range(a-1,b):\r\n \tc+=lista[x]\r\n \t\r\n if c>0:\r\n \td+=c\r\nprint (d)\t", "n,m=map(int,input().split())\r\nd=input().split()\r\nd=[int(x) for x in d]\r\nc=0\r\nfor i in range(m):\r\n l=input().split()\r\n l=[int(x) for x in l]\r\n k=0\r\n for j in range(l[0]-1,l[1]):\r\n k+=d[j]\r\n if k>0:\r\n c+=k\r\nprint(c)\r\n\r\n\r\n \r\n", "I=lambda:map(int,input().split())\r\nR=range\r\nans=0\r\nn,m=I()\r\na=list(I())\r\nfor _ in R(m):l,r=I();ans+=max(0,sum(a[i]for i in R(l-1,r)))\r\nprint(ans)", "n, m = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\n\nmax_sum = 0\n\nfor i in range(m):\n l, r = [int(x) for x in input().split()]\n l -= 1\n\n sucet = sum(a[l:r])\n\n if sucet > 0:\n max_sum += sucet\n\nprint(max_sum)", "n, m = map(int, input().split())\na = [int(i) for i in input().split()]\nans = 0\nfor i in range(m):\n\ts, e = map(int, input().split())\n\tt = sum(a[s-1:e])\n\tif t > 0:\n\t\tans += t\nprint(ans)\n", "I = lambda: map(int, input().split())\nn, m = I()\na = list(I())\nresult = 0\nfor _ in range(m):\n l, r = I()\n result += max(sum(a[l-1: r]), 0)\nprint(result)\n", "inp = [int(x) for x in input().split()]\r\nl = [int(x) for x in input().split()]\r\ntotal = 0\r\nans = 0\r\nfor x in range(inp[1]):\r\n val = [int(y) for y in input().split()]\r\n total = sum(l[val[0]-1:val[1]])\r\n if(total > 0):\r\n ans = ans + total\r\n \r\nprint(ans)", "n,m = [int(x) for x in input().split()]\n\na = [int(x) for x in input().split()]\n\nmood=0\nfor x in range(m):\n l,r = [int(x) for x in input().split()]\n net = 0\n for x in range(l-1,r):\n net += a[x]\n if net>0:\n mood+=net\nprint(mood)\n", "n,m = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\npre=[0](n+1)\r\nans=0\r\nfor i in range(n):\r\n pre[i+1]=pre[i]+lis[i]\r\nfor _ in range(m):\r\n l,r = map(int,input().split())\r\n ans+=max(0,pre[r]-pre[l-1])\r\nprint(ans)\r\n ", "n,m=[int(e) for e in input().split()]\r\na=[int(e) for e in input().split()]\r\np=[a[0]]\r\nfor i in range(1,n):\r\n p.append(p[-1]+a[i])\r\np.append(0)\r\ns=0\r\nfor i in range(m):\r\n l,r=[int(e)-1 for e in input().split()]\r\n s+=max(0,p[r]-p[l-1])\r\nprint(s)\r\n", "class MaxHappinessAdded:\r\n def __init__(self, flowerMood):\r\n self.flowerMood = flowerMood\r\n self.n = len(self.flowerMood)\r\n \r\n def findPrefixSum(self):\r\n pSum = [0]self.n\r\n pSum[0] = self.flowerMood[0]\r\n \r\n for i in range(1, self.n):\r\n pSum[i] = pSum[i-1] + self.flowerMood[i]\r\n \r\n return pSum\r\n \r\n def maximizeHappiness(self, numSubArray, subArray):\r\n maxHappiness = 0\r\n choosenSubArray = []\r\n \r\n pSum = self.findPrefixSum()\r\n # print(pSum)\r\n \r\n for (i,j) in subArray:\r\n sm = pSum[j]-pSum[i-1] if i >= 1 else pSum[j]\r\n # print(i,',',j,'=',sm)\r\n if (sm) > 0:\r\n choosenSubArray.append((i,j))\r\n \r\n for i,v in enumerate(self.flowerMood):\r\n cnt = 0\r\n for (l,r) in choosenSubArray:\r\n if (i >= l) & (i <= r):\r\n cnt += 1\r\n maxHappiness += (vcnt)\r\n return maxHappiness\r\n \r\n def findNumberPositiveMood(self, start, end):\r\n positiveMood = 0\r\n for i in range(start, end+1):\r\n if self.flowerMood[i] > 0:\r\n positiveMood += 1\r\n return positiveMood\r\n \r\n\r\nn,m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\n\r\nsubArray = []\r\nfor i in range(m):\r\n i, j = list(map(int, input().split()))\r\n subArray.append((i-1, j-1))\r\n\r\nobj = MaxHappinessAdded(arr)\r\nprint(obj.maximizeHappiness(m, subArray))", "n, m = input().split()\r\nn=int(n)\r\nm=int(m)\r\na=list(map(int, input().split()))\r\nb=[a[0]]\r\nfor i in range(1, n):\r\n b.append(b[i-1]+a[i])\r\nans = 0\r\nfor i in range(0, m):\r\n x, y = input().split()\r\n x=int(x)-1\r\n y=int(y)-1\r\n ans+=max(0, b[y]-b[x]+a[x])\r\nprint(ans)", "import sys\r\ninput = lambda : sys.stdin.readline()\r\n\r\ndef Main():\r\n n, m = map(int,input().split())\r\n A = list(map(int,input().split()))\r\n sm = 0\r\n ans = 0\r\n for _ in range(m):\r\n x, y = map(int,input().split())\r\n # print(A[(x - 1): y])\r\n sm = sum( A[(x-1): y ] )\r\n if sm > 0:\r\n ans += sm\r\n\r\n print(ans)\r\nif __name__ == '__main__':\r\n Main()", "a,b=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nh=0\r\nfor i in range(b):\r\n m,n=map(int,input().split())\r\n t=sum(s[k] for k in range(m-1,n))\r\n if t>0:\r\n h+=t\r\nprint(h)\r\n", "\r\nn,queries = list(map(int,input().strip().split()))\r\nlst = list(map(int,input().strip().split()))\r\nqury_list = []\r\nfor i in range(queries):\r\n tup = tuple(map(int,input().strip().split()))\r\n qury_list.append(tup)\r\n\r\nprefix_sum = [lst[0]]\r\nfor i in range(1,n):\r\n prefix_sum.append(lst[i] + prefix_sum[i-1])\r\nres = 0\r\nfor l , r in qury_list:\r\n if l-1 != 0:\r\n sum_of_range = prefix_sum[r-1] - prefix_sum[l-2]\r\n else:\r\n sum_of_range = prefix_sum[r-1]\r\n if sum_of_range>0:\r\n res += sum_of_range\r\n\r\nprint(res)", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\npref=[0]\r\nans=0\r\nfor i in a:\r\n pref.append(pref[-1]+i)\r\nfor i in range(m):\r\n k,l=[int(i) for i in input().split()]\r\n plus=pref[l]-pref[k-1]\r\n if plus>0:\r\n ans+=plus\r\nprint(ans)\r\n", "n,m=map(int,input().split(\" \"))\nl=list(map(int,input().split(\" \")))\nls=[]\nwhile m>0 :\n i,j=map(int,input().split(\" \"))\n m-=1\n ls.append(sum(l[i-1:j]))\ntot=0\nfor x in ls:\n if x>0:\n tot=tot+x\nprint(tot) \n \n", "n, m = [int(i) for i in input().split()]\nsec = [int(i) for i in input().split()]\n\nans = 0\n\nfor i in range(m):\n\ta, b = [int(i) for i in input().split()]\n\tif sum(sec[a - 1: b]) > 0:\n\t\tans += sum(sec[a - 1: b])\n\nprint(ans)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n if sum(l[a-1:b])>0:\r\n ans=ans+sum(l[a-1:b])\r\nprint(ans)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\npSums = (n + 1) * [0]\r\npSums[0] = 0\r\nfor i in range(1, n + 1):\r\n pSums[i] = pSums[i - 1] + a[i - 1]\r\n \r\nans = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n curSum = pSums[r] - pSums[l - 1]\r\n if curSum > 0:\r\n ans += curSum\r\n\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n li, ri = map(int, input().split())\r\n li -= 1\r\n if sum(data[li:ri]) > 0:\r\n ans += sum(data[li:ri])\r\nprint(ans)", "n, m = map(int, input().split())\r\nz = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n p, q = map(int, input().split())\r\n ans += max(0, sum(z[p - 1 : q]))\r\nprint(ans)\r\n", "n,m = map(int,input().split()) \r\na = list(map(int,input().split())) \r\nlst=[ ] \r\nfor i in range(m):\r\n x,y = map(int,input().split()) \r\n ct = 0 \r\n for j in range(x-1,y):\r\n ct+=a[j] \r\n lst.append(ct) \r\nlst.sort(reverse=True) \r\nans = 0 \r\nct=0 \r\nfor i in range(len(lst)):\r\n ct+=lst[i] \r\n ans = max(ans,ct) \r\nprint(ans)\r\n \r\n", "def solve():\r\n n,m = map(int, input().split())\r\n l = list(map(int,input().split()))\r\n ps = [0] * len(l)\r\n ps[0] = l[0]\r\n for i in range(1, len(l)):\r\n ps[i] = l[i] + ps[i-1]\r\n ps.insert(0,0)\r\n ans = 0\r\n for i in range(m):\r\n l,r = map(int, input().split())\r\n diff = ps[r] - ps[l-1]\r\n if diff > 0:\r\n ans+=diff\r\n print(ans)\r\nsolve()", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=[0 for i in range(n) ]\r\nM=[list(map(int,input().split())) for i in range(m)]\r\nv=0\r\nfor i in range(m) :\r\n k=0\r\n for j in range(M[i][0]-1,M[i][1]) :\r\n k=k+l[j]\r\n if k>0 :\r\n v=v+k\r\nprint(v)\r\n \r\n \r\n", "n,m=map(int,input().split(\" \"))\r\nmood=list(map(int,input().split(\" \")))\r\ndescription=[]\r\nsum_1=0\r\nhappiness=0\r\nfor i in range(0,m):\r\n l,r=map(int,input().split(\" \"))\r\n description.append((l,r))\r\n\r\nprefix_sum=[0]*n\r\nprefix_sum[0]=mood[0]\r\nfor i in range(1,n):\r\n prefix_sum[i]=mood[i]+prefix_sum[i-1]\r\nfor i in range(0,m):\r\n if description[i][0]==1:\r\n sum_1=prefix_sum[description[i][1]-1]\r\n else:\r\n sum_1=prefix_sum[description[i][1]-1]-prefix_sum[description[i][0]-2]\r\n if sum_1>0:\r\n happiness+=sum_1\r\nprint(happiness)" ]	{"inputs": ["5 4\n1 -2 1 3 -4\n1 2\n4 5\n3 4\n1 4", "4 3\n1 2 3 4\n1 3\n2 4\n1 1", "2 2\n-1 -2\n1 1\n1 2", "5 6\n1 1 1 -1 0\n2 4\n1 3\n4 5\n1 5\n1 4\n4 5", "8 3\n5 -4 -2 5 3 -4 -2 6\n3 8\n4 6\n2 3", "10 10\n0 0 0 0 0 0 0 0 0 0\n5 9\n1 9\n5 7\n3 8\n1 6\n1 9\n1 6\n6 9\n1 10\n3 8", "3 6\n0 0 0\n1 1\n1 1\n1 3\n3 3\n2 3\n1 2", "3 3\n1 -1 3\n1 2\n2 3\n1 3", "6 8\n0 6 -5 8 -3 -2\n6 6\n2 3\n5 6\n4 6\n3 4\n2 5\n3 3\n5 6", "10 4\n6 5 5 -1 0 5 0 -3 5 -4\n3 6\n4 9\n1 6\n1 4", "9 1\n-1 -1 -1 -1 2 -1 2 0 0\n2 5", "3 8\n3 4 4\n1 2\n1 3\n2 3\n1 2\n2 2\n1 1\n2 3\n1 3", "3 8\n6 7 -1\n1 1\n1 3\n2 2\n1 3\n1 3\n1 1\n2 3\n2 3", "53 7\n-43 57 92 97 85 -29 28 -8 -37 -47 51 -53 -95 -50 -39 -87 43 36 60 -95 93 8 67 -22 -78 -46 99 93 27 -72 -84 77 96 -47 1 -12 21 -98 -34 -88 57 -43 5 -15 20 -66 61 -29 30 -85 52 53 82\n15 26\n34 43\n37 41\n22 34\n19 43\n2 15\n13 35", "20 42\n61 86 5 -87 -33 51 -79 17 -3 65 -42 74 -94 40 -35 22 58 81 -75 5\n3 6\n12 13\n3 16\n3 16\n5 7\n5 16\n2 15\n6 18\n4 18\n10 17\n14 16\n4 15\n4 11\n13 20\n5 6\n5 15\n16 17\n3 14\n9 10\n5 19\n5 14\n2 4\n17 20\n10 11\n5 18\n10 11\n1 14\n1 6\n1 10\n8 16\n11 14\n12 20\n11 13\n4 5\n2 13\n1 5\n11 15\n1 18\n3 8\n8 20\n1 4\n10 13", "64 19\n-47 13 19 51 -25 72 38 32 54 7 -49 -50 -59 73 45 -87 -15 -72 -32 -10 -7 47 -34 35 48 -73 79 25 -80 -34 4 77 60 30 61 -25 23 17 -73 -73 69 29 -50 -55 53 15 -33 7 -46 -5 85 -86 77 -51 87 -69 -64 -24 -64 29 -20 -58 11 -26\n6 53\n13 28\n15 47\n20 52\n12 22\n6 49\n31 54\n2 39\n32 49\n27 64\n22 63\n33 48\n49 58\n39 47\n6 29\n21 44\n24 59\n20 24\n39 54", "1 10\n-46\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1", "10 7\n44 18 9 -22 -23 7 -25 -2 15 35\n6 8\n6 7\n3 3\n2 6\n9 10\n2 2\n1 5", "4 3\n10 -2 68 35\n4 4\n1 1\n1 3", "3 6\n27 -31 -81\n2 3\n2 3\n1 1\n1 2\n1 2\n2 2", "7 3\n-24 -12 16 -43 -30 31 16\n3 6\n3 4\n1 7", "10 7\n-33 -24 -86 -20 5 -91 38 -12 -90 -67\n7 8\n7 10\n4 7\n1 3\n6 10\n6 6\n3 5", "4 4\n95 35 96 -27\n3 4\n3 3\n4 4\n3 3", "7 7\n-33 26 -25 44 -20 -50 33\n4 6\n4 4\n3 7\n5 7\n1 4\n2 5\n4 6", "5 3\n-35 -39 93 59 -4\n2 2\n2 3\n2 5", "3 7\n0 0 0\n1 2\n1 2\n2 3\n3 3\n1 3\n1 2\n2 3", "8 2\n17 32 30 -6 -39 -15 33 74\n6 6\n8 8", "8 1\n-20 -15 21 -21 1 -12 -7 9\n4 7", "7 9\n-23 -4 -44 -47 -35 47 25\n1 6\n3 5\n4 7\n6 7\n2 4\n2 3\n2 7\n1 2\n5 5", "8 8\n0 6 -25 -15 29 -24 31 23\n2 8\n5 5\n3 3\n2 8\n6 6\n3 6\n3 4\n2 4", "4 3\n-39 -63 9 -16\n1 4\n1 3\n2 4", "9 1\n-3 -13 -13 -19 -4 -11 8 -11 -3\n9 9", "9 6\n25 18 -62 0 33 62 -23 4 -15\n7 9\n2 3\n1 4\n2 6\n1 6\n2 3", "4 5\n-12 39 8 -12\n1 4\n3 4\n1 3\n1 3\n2 3", "3 9\n-9 7 3\n1 2\n1 1\n1 3\n1 2\n2 3\n1 3\n2 2\n1 2\n3 3", "10 7\n0 4 3 3 -2 -2 -4 -2 -3 -2\n5 6\n1 10\n2 10\n7 10\n1 1\n6 7\n3 4", "86 30\n16 -12 11 16 8 14 7 -29 18 30 -32 -10 20 29 -14 -21 23 -19 -15 17 -2 25 -22 2 26 15 -7 -12 -4 -28 21 -4 -2 22 28 -32 9 -20 23 38 -21 21 37 -13 -30 25 31 6 18 29 29 29 27 38 -15 -32 32 -7 -8 -33 -11 24 23 -19 -36 -36 -18 9 -1 32 -34 -26 1 -1 -16 -14 17 -17 15 -24 38 5 -27 -12 8 -38\n60 66\n29 48\n32 51\n38 77\n17 79\n23 74\n39 50\n14 29\n26 76\n9 76\n2 67\n23 48\n17 68\n33 75\n59 78\n46 78\n9 69\n16 83\n18 21\n17 34\n24 61\n15 79\n4 31\n62 63\n46 76\n79 82\n25 39\n5 81\n19 77\n26 71", "33 17\n11 6 -19 14 23 -23 21 15 29 19 13 -18 -19 20 16 -10 26 -22 3 17 13 -10 19 22 -5 21 12 6 28 -13 -27 25 6\n4 17\n12 16\n9 17\n25 30\n31 32\n4 28\n11 24\n16 19\n3 27\n7 17\n1 16\n15 28\n30 33\n9 31\n14 30\n13 23\n27 27", "16 44\n32 23 -27 -2 -10 -42 32 -14 -13 4 9 -2 19 35 16 22\n6 12\n8 11\n13 15\n12 12\n3 10\n9 13\n7 15\n2 11\n1 13\n5 6\n9 14\n3 16\n10 13\n3 15\n6 10\n14 16\n4 5\n7 10\n5 14\n1 16\n2 5\n1 6\n9 10\n4 7\n4 12\n2 5\n7 10\n7 9\n2 8\n9 10\n4 10\n7 12\n10 11\n6 6\n15 15\n8 12\n9 10\n3 3\n4 15\n10 12\n7 16\n4 14\n14 16\n5 6", "63 24\n-23 -46 0 33 24 13 39 -6 -4 49 19 -18 -11 -38 0 -3 -33 -17 -4 -44 -22 -12 -16 42 16 -10 7 37 -6 16 -41 -18 -20 51 -49 28 -14 -22 -37 -7 -50 31 -41 -47 18 -8 -39 -29 35 -32 14 -29 44 -29 -19 -25 -47 -8 16 11 20 12 38\n21 61\n35 61\n29 61\n21 34\n12 48\n32 33\n9 27\n4 42\n4 60\n37 61\n19 44\n46 60\n51 53\n31 34\n23 32\n5 29\n43 59\n7 31\n29 48\n15 50\n19 51\n7 28\n17 41\n1 62", "6 51\n45 -33 -17 -48 2 2\n2 5\n1 1\n1 3\n5 5\n4 6\n1 2\n2 3\n3 4\n1 6\n4 6\n3 5\n1 5\n2 2\n2 6\n4 6\n1 5\n1 5\n1 5\n1 6\n6 6\n3 5\n6 6\n1 6\n3 4\n3 3\n2 4\n3 3\n1 4\n2 4\n5 6\n4 5\n2 4\n1 5\n1 2\n4 5\n1 5\n5 6\n2 2\n3 4\n1 3\n1 2\n2 5\n3 6\n4 6\n3 4\n2 4\n1 4\n1 1\n4 6\n3 5\n1 4", "3 5\n2 -1 3\n2 3\n2 3\n2 3\n2 3\n1 2", "4 30\n1 1 1 1\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4"], "outputs": ["7", "16", "0", "8", "10", "0", "0", "5", "13", "50", "0", "59", "67", "170", "1502", "804", "0", "103", "121", "27", "0", "26", "261", "81", "163", "0", "74", "0", "72", "79", "0", "0", "127", "140", "22", "6", "3076", "1366", "777", "82", "140", "9", "120"]}	UNKNOWN	PYTHON3	CODEFORCES	209
8ed90872b9454656dda60a242d493820	Ebony and Ivory	Dante is engaged in a fight with "The Savior". Before he can fight it with his sword, he needs to break its shields. He has two guns, Ebony and Ivory, each of them is able to perform any non-negative number of shots. For every bullet that hits the shield, Ebony deals a units of damage while Ivory deals b units of damage. In order to break the shield Dante has to deal exactly c units of damage. Find out if this is possible. The first line of the input contains three integers a, b, c (1<=≤<=a,<=b<=≤<=100,<=1<=≤<=c<=≤<=10<=000) — the number of units of damage dealt by Ebony gun and Ivory gun, and the total number of damage required to break the shield, respectively. Print "Yes" (without quotes) if Dante can deal exactly c damage to the shield and "No" (without quotes) otherwise. Sample Input 4 6 15 3 2 7 6 11 6 Sample Output No Yes Yes	[ "def main():\r\n a,b,c=map(int,input().split())\r\n if a==c or c%a==0:\r\n print('Yes')\r\n return\r\n if b==c or c%b==0:\r\n print('Yes')\r\n return\r\n if a>b:\r\n a,b=b,a\r\n if a>c:\r\n print('No')\r\n return\r\n for i in range(1,(c-a)//b+1):\r\n for j in range(1,(c-b)//a+1):\r\n if bi+aj>c:\r\n break\r\n if bi+aj==c:\r\n print('Yes')\r\n return\r\n print('No')\r\n return\r\n\r\nif __name__=='__main__': main()\r\n\r\n \r\n", "import os\nimport math\nimport time\n\n\n\n[a,b,c]=[int(x) for x in input().split(' ')]\ndp = [False]10010\ndp[0]=True\nfor i in range(10010):\n if dp[i]:\n if i+a < 10010:\n dp[i+a]=True\n if i+b < 10010:\n dp[i+b]=True\n\nif dp[c]:\n print('Yes')\nelse:\n print('No')\n\n", "s = input();\r\na,b,c = s.split();\r\na=int(a);\r\nb=int(b);\r\nc=int(c);\r\n \r\ncheck=False;\r\n \r\nfor i in range(0,10003) :\r\n n = c-ai;\r\n if n>=0 and n%b==0 :\r\n check=True;\r\n print(\"Yes\");\r\n break;\r\nif check==False :\r\n print(\"No\");", "import math\r\na, b, c = [int(i) for i in input().split()]\r\nx = 1\r\ny = 0\r\nx1 = 0\r\ny1 = 1\r\na1 = a\r\nb1 = b\r\nwhile b1:\r\n q = a1 // b1\r\n (x, x1) = (x1, x - q * x1)\r\n (y, y1) = (y1, y - q * y1)\r\n (a1, b1) = (b1, a1 - q * b1)\r\nif c % a1 != 0:\r\n print(\"No\")\r\nelse:\r\n x = (xc)//a1\r\n y = (yc)//a1\r\n left1 = math.ceil((-a1x)/b)\r\n right1 = math.floor((a1y)/a)\r\n temp = right1 - left1\r\n if temp >= 0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "str1 = input()\r\nstr = str1.split(' ')\r\nx = int(max(str[0], str[1]))\r\ny = int(min(str[0], str[1]))\r\nz = int(str[2])\r\nflag =0\r\nwhile z >= 0:\r\n if z % y == 0:\r\n flag = 1\r\n print('YES')\r\n break\r\n else:\r\n z -= x\r\n\r\nif flag ==0:\r\n print(\"NO\")\r\n", "def EvonyAndIvory(a,b,c):\r\n flat = 0\r\n for i in range(b):\r\n d = c-(ai)\r\n if (d < 0):\r\n flat = 0\r\n break\r\n if (d%b == 0):\r\n flat = 1\r\n break\r\n if(flat == 1):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\na,b,c = [int(i) for i in input().split()]\r\nEvonyAndIvory(a,b,c)", "from sys import stdin\r\ninput = stdin.buffer.readline\r\n\r\na, b, c = map(int, input().split())\r\nfor i in range(10001):\r\n if c >= a i and not (c - a * i) % b:\r\n exit(print('Yes'))\r\nprint('No')", "a,b,c=map(int,input().split())\r\nfor j in range(c//a+1):\r\n\tif((c-ja)%b==0):\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"NO\")\r\n", "'''input\n6 11 6\n'''\nfrom math import gcd\na, b, c = map(int, input().split())\nfor x in range(c//a+1):\n\tif (c - xa) % b == 0:\n\t\tprint(\"Yes\")\n\t\tbreak\nelse:\n\tprint(\"No\")", "a,b,c=map(int,input().split())\r\nc1=c\r\nif min(a,b)>c:exit(print(\"NO\"))\r\nelif c%a==0 or c%b==0:exit(print(\"YES\"))\r\nwhile c1>0 :\r\n #print(c1)\r\n if c1%a==0:exit(print(\"YES\"))\r\n c1-=b\r\nc1=c\r\nwhile c1>0:\r\n #print(c1)\r\n if c1%b==0:exit(print(\"YES\"))\r\n c1-=a\r\nprint(\"NO\")\r\n", "a, b, c=map(int, input().split())\r\nn=c//a\r\ns=\"No\"\r\nfor i in range(n+1):\r\n\tif not (c-ai)%b:\r\n\t\ts=\"Yes\"\r\n\t\tbreak\r\nprint(s)", "# a,b,c=map(int,input().split())\r\n# x=0\r\n# while x<=c:\r\n# \tif (c-x)%b==0:\r\n# \t\tprint(\"Yes\")\r\n# \t\texit()\r\n# \tx+=a\r\n# print(\"No\")\r\n\r\nfrom math import ceil,floor\r\n\r\ndef gcd(a , b , ex = 0):\r\n\tx , y = 1 , 0\r\n\tx1 , y1 , a1 , b1 = 0 , 1 , a , b\r\n\twhile b1 :\r\n\t\tq = a1 // b1\r\n\t\tx , x1 = x1 , x - q x1\r\n\t\ty , y1 = y1 , y - q * y1\r\n\t\ta1 , b1 = b1 , a1 - q * b1\r\n\tif ex :\r\n\t\treturn [a1 , x , y]\r\n\telse :\r\n\t\treturn a1\r\na,b,c=map(int,input().split())\r\ng,x,y=gcd(a,b,1)\r\nif c%g!=0:\r\n\tprint(\"No\")\r\nelse:\r\n\tx=x(c//g)\r\n\ty=y(c//g)\r\n\tk=int(ceil(-xg/b))\r\n\tif k<=yg//a:\r\n\t\tprint(\"Yes\")\r\n\telse:\r\n\t\tprint(\"No\")", "a,b,c=map(int,input().split())\r\ni=0\r\ncurr=ai\r\nflag=0\r\nwhile curr<=c:\r\n mod=c-curr\r\n if mod%b==0:\r\n flag=1\r\n break\r\n i+=1\r\n curr=ai\r\nif not flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a, b, c = list(map(int, input().split(\" \")))\n\nx = int(c/a)\nworks = False\n\nwhile x >= 0 :\n\tra = x * a\n\tif ra % c == 0 and ra != 0:\n\t\tworks = True\n\t\tbreak \n\taux = c - ra\n\tif aux >= b:\n\t\tmb = int(aux/b) * b\n\t\tr = ra + mb\n\t\tif r % c == 0:\n\t\t\tworks = True\n\t\t\tbreak\n\tx = x - 1\n\nif works:\n\tprint('Yes')\nelse:\n\tprint('No')\n \t \t \t\t \t\t \t\t \t\t\t \t \t \t", "a,b,c = map(int,input().split())\r\nbb=0\r\nwhile bb<=c:\r\n\tif (c-bb)%a == 0:\r\n\t\tprint('Yes')\r\n\t\texit()\r\n\tbb+=b\r\nprint('No')", "line = input()\r\na, b, c = map(int, line.split())\r\n\r\ni = 0\r\nwhile i <= c:\r\n if (c - i) % b == 0:\r\n print(\"Yes\")\r\n exit()\r\n i += a\r\nprint(\"No\")\r\n", "from fractions import Fraction\r\nfrom math import floor,ceil\r\na,b,c = map(int,input().split())\r\na,b = sorted([a,b], reverse = True)\r\n# print(a,b)\r\nstored = [a,b]\r\nwhile b > 0:\r\n a,b = b,a%b\r\n\r\nif c%a == 0:\r\n a,b = stored\r\n def egcd(a,b):\r\n if b == 0:\r\n return a,1,0\r\n nxt = egcd(b,a%b)\r\n return nxt[0], nxt[2], nxt[1] - a//b * nxt[2]\r\n d,x0,y0 = egcd(a,b)\r\n p = a//d\r\n q = b//d\r\n n = c//d\r\n X0 = nx0\r\n Y0 = ny0\r\n # print(f'{a} {b} {c} {d} {n} {x0} {y0} {X0} {Y0}')\r\n '''\r\n X0 + tq >= 0 --> t >= -X0/q\r\n Y0 - tp >= 0 --> t <= Y0/p\r\n '''\r\n t_l = Fraction(-X0, q)\r\n t_r = Fraction(Y0, p)\r\n t_lf = floor(t_l)\r\n t_rf = floor(t_r)\r\n t_lc = ceil(t_l)\r\n t_rc = ceil(t_r)\r\n # print(f'[{t_l}, {t_r}]')\r\n if t_rf - t_lf >= 1 or t_rc - t_lc >= 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\nelse:\r\n print(\"NO\")\r\n# print([\"Yes\",\"No\"][c%a!=0])\r\n", "def solve(a,b,c):\r\n for i in range(int(c/a)+1):\r\n for j in range(int(c/b) +1):\r\n if ia + jb == c:\r\n return True\r\n return False\r\na,b,c = map(int,input().split())\r\nif solve(a,b,c):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a,b,c=map(int,input().split())\r\ni=0\r\ns='NO'\r\nwhile i<=c:\r\n if(c-i)%b:\r\n s=s \r\n else:\r\n s='YES'\r\n i+=a\r\nprint(s)\r\n", "from math import gcd\r\n\r\n\r\na,b,c = map(int,input().split())\r\nr = gcd(a,b)\r\nif(c%r!=0):\r\n print(\"No\")\r\nelse:\r\n flag=1\r\n for i in range(c+1):\r\n if(ai > c):\r\n break\r\n if(c - ai)%b==0:\r\n flag=0\r\n break\r\n \r\n print([\"Yes\",\"No\"][flag])", "def main():\r\n a, b, c = map(int, input().split())\r\n for x in range(0, 10*5 + 1):\r\n if (c - x a) < 0:\r\n break\r\n if (c - x * a) % b == 0:\r\n print(\"Yes\")\r\n return\r\n print(\"No\")\r\n\r\nmain()", "a, b, c = map(int, input().split())\nfor i in range(c // a + 2):\n for j in range(c // b + 2):\n if a * i + b * j == c:\n print(\"Yes\")\n exit(0)\nprint(\"No\")", "black, white, health = map(int, input().split())\r\ndamage = [False] * (health + 1 + max(white, black))\r\ndamage[0] = True\r\nfor i in range(health):\r\n if damage[i]:\r\n damage[i + black] = True\r\n damage[i + white] = True\r\n\r\nif damage[health]:\r\n print('Yes')\r\nelse:\r\n print('No')", "a,b,c=map(int,input().split())\r\nx=0\r\nwhile x<=c:\r\n\tif (c-x)%b==0:\r\n\t\tprint(\"Yes\")\r\n\t\texit()\r\n\tx+=a\r\nprint(\"No\")", "a,b,c=map(int,input().split());yes=0\r\nfor i in range(0,c+1,a):\r\n if (c-i)%b==0:yes=1\r\nprint(['No','Yes'][yes])", "a, b, c = map(int, input().split())\n\nyes = False\nx = 0\nwhile a * x <= c:\n c2 = c\n c2 -= a * x\n y = c2 / b\n x += 1\n if y == int(y):\n yes = True\n break\n\nprint('Yes' if yes else 'No')\n\n\t \t \t\t\t\t\t \t\t \t \t \t \t \t", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\na, b, c = IL()\r\n\r\nans = False\r\nfor i in range(0, c+1, a):\r\n if (c-i) % b == 0:\r\n ans = True\r\n\r\nprint(\"Yes\" if ans else \"No\")", "a, b, c = map(int, input().split())\r\nfor i in range(0, c + 1, a):\r\n if c - i >= 0 and (c - i) % b == 0:\r\n print('Yes')\r\n exit()\r\nprint('No')", "from math import \r\na,b,c=map(int,input().split())\r\ng=gcd(a,b)\r\ni=0\r\nver=False\r\nfor k in range(1000000):\r\n rem=c-(ai)\r\n i+=1\r\n if rem%b==0:\r\n if rem//b>=0:\r\n ver=True\r\n break\r\nif ver:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a,b,c = map(int,input().split())\r\ns = 'No'\r\nif c % a == 0 or c % b == 0:\r\n s = 'Yes'\r\nelse:\r\n for i in range(c//(a+b)):\r\n if (c - ((i+1) * (a + b))) % a == 0 or (c - ((i+1) * (a + b))) % b == 0:\r\n s = 'Yes'\r\n break\r\nprint(s)\r\n\r\n", "a, b, n = map(int, input().split())\r\nans = False\r\nfor i in range(n + 1):\r\n d1 = i\r\n d2 = n - i\r\n if d1 % a == 0 and d2 % b == 0:\r\n ans = True\r\nprint('Yes' if ans else 'No') \r\n", "# http://codeforces.com/problemset/problem/633/A\n\na, b, c = map(int, input().split())\ndone =False\n\n\nfor i in range(c // a + 1):\n for j in range((c - i * a) // b + 1):\n if (c - i * a - j * b) == 0:\n print(\"Yes\")\n done = True\n break\n if done:\n break\nif not done:\n print(\"No\")", "def solve(a,b,c):\r\n for i in range(101):\r\n if c-(bi) >= 0 and (c-(bi))%a == 0:\r\n return 'Yes'\r\n return 'No'\r\na,b,c = map(int,input().split())\r\nprint(solve(a,b,c))\r\n", "a, b, c = map(int,input().split())\r\n\r\nif c%a:\r\n while c>0 and c%b:\r\n c -= a\r\n print('Yes' if c>0 else 'No')\r\nelse:\r\n print('Yes')", "#!/usr/bin/python3.5\r\na,b,c=[int(x) for x in input().split()]\r\nd=c\r\nif a%2==0 and b%2==0 and c&1:\r\n print('No')\r\n quit()\r\n\r\nwhile True:\r\n if c<=0 and d<=0:\r\n break\r\n if c>0:\r\n if c%a==0:\r\n print('Yes')\r\n quit()\r\n else:\r\n c-=b\r\n if d>0:\r\n if d%b==0:\r\n print('Yes')\r\n quit()\r\n else:\r\n d-=a\r\nprint('No')", "import math\na,b,c = map(int,input().split())\nfor i in range(c//a+1):\n\tif (c-ai)%b==0:\n\t\tprint (\"Yes\")\n\t\texit()\nprint (\"No\")", "a, b, c = map(int, input().split())\nf = False\nfor na in range(1 + c//a):\n if f:\n break\n for nb in range(1 + c//b):\n if a na + b * nb == c:\n f = True\n break\nif f:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "import sys\r\na, b, c = map(int, input().split())\r\nfor i in range(0, c + 1, a):\r\n if (c - i) % b == 0:\r\n print('Yes')\r\n sys.exit()\r\nprint('No') \r\n", "a = [int(j) for j in input().split()]\r\ns = ''\r\nfor k in range(a[1]):\r\n if (a[2] - k * a[0]) % a[1] == 0 and a[2] - a[0] * k >= 0:\r\n s = 'YES'\r\n break\r\nif s == 'YES':\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b,c = map(int,input().split(' '))\r\nn = max(c//a,c//b)\r\nf = 0\r\nfor i in range(n+1):\r\n for j in range(n+1):\r\n if ia+jb == c:\r\n f = 1\r\n break\r\n if f==1:\r\n break\r\n\r\nif f==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "abc = list(map(int,input().split()))\r\na, b, c = abc[0], abc[1], abc[2]\r\nfor i in range(c // a + 1):\r\n if (c - i * a) % b == 0 or c - i * a == 0:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')", "line = [int(x) for x in input().strip().split(\" \")]\r\na = line[0]\r\nb = line[1]\r\nc = line[2]\r\n\r\ndef doable(a, b, c):\r\n\tfor i in range((c//a)+1):\r\n\t\tt = c-(ia)\r\n\t\t# print(\"t: %s\" % (t))\r\n\t\tif t%b==0:\r\n\t\t\treturn True\r\n\treturn False\r\n\r\nif doable(a, b, c):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "a,b,c=map(int,input().split())\r\ny=0\r\nwhile (c-by)/a >=0:\r\n if (c-by)%a ==0:\r\n print('Yes')\r\n break\r\n y += 1\r\n\r\nelse:\r\n print('No')", "a,b,c=map(int , input().split())\r\ni=0\r\ns='No'\r\nwhile i<=c: s=s if(c-i)%b else 'YES';i+=a\r\nprint(s)\r\n ", "def gcd(a, b, x, y):\n if b == 0:\n x = 1\n y = 0\n return a, x, y\n\n d = gcd(b, a%b, x, y)\n x = d[2]\n y = d[1] - d[2](a//b)\n\n return d[0], x, y\n\nimport math\ndef exe(x1, y1, g,a,b, c):\n if c%g:\n print(\"NO\")\n exit()\n x1 = x1 * (c//g)\n y1 = y1 * (c//g)\n\n lr = -x1 // (b//g)\n rr = y1 // (a//g)\n\n for k in range(lr, rr+1):\n x = x1 + k * (b//g)\n y = y1 - (k * (a//g))\n if x >= 0 and y >= 0:\n print(\"YES\")\n exit()\n print(\"NO\")\n\n\n\na, b, c = [int(x) for x in input().split()]\n\n\nd = gcd(a, b, 0, 0)\n\ng = d[0]\nx = d[1]\ny = d[2]\n\n\n\n\nexe(x, y, g, a,b,c)\n\n \n\n \n", "from math import gcd\r\n\r\na, b, c = map(int, input().split())\r\n\r\n\r\nanswer = False\r\nfor i in range(0, c+1):\r\n lhs = i\r\n rhs = c - i\r\n\r\n if (lhs % a == 0 and rhs % b == 0) or (lhs % b == 0 and rhs % a == 0):\r\n answer = True\r\n\r\nif answer:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "#!/usr/bin/env python3\r\n\r\na, b, c = [int(x) for x in input().split()]\r\n\r\nfound = False\r\nfor i in range(0, c // a + 1):\r\n if (c - (a * i)) % b == 0:\r\n found = True\r\n break\r\nif found:\r\n print(\"Yes\") \r\nelse:\r\n print(\"No\") \r\n", "def solve(a,b,c):\r\n x= 0 \r\n y = 0 \r\n while(c>=a):\r\n if(c%b==0):\r\n y = c//b\r\n c = 0 \r\n else:\r\n c = c-a\r\n x = x + 1 \r\n \r\n if(c==0):\r\n return 1\r\n else:\r\n return False \r\n\r\n\r\na,b,c = map(int,input().split()) \r\n\r\nif(solve(a,b,c)==1):\r\n print(\"YES\")\r\n \r\nelif(solve(b,a,c)==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, b, c = map(int, input().split())\nok = False\nfor i in range(c//a+1):\n #print(c-ai)\n #print((c-ai)%b==0)\n if c-ai >= 0 and (c-ai)%b==0:\n ok = True\nif ok:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "A, B, C = [int(x) for x in input().split()]\n\nfor i in range(0, C + 1):\n if A * i > C:\n break\n if (C - A * i) % B == 0:\n print(\"Yes\")\n exit(0)\n\nprint(\"No\")\n", "a, b, c = map(int, input().split())\r\np = [0] * 100000\r\np[0] = 1\r\np[a] = 1\r\np[b] = 1\r\nfor i in range(c + 1):\r\n if p[i]:\r\n p[i + a] = 1\r\n p[i + b] = 1\r\nif p[c]:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "a,b,c=map(int,input().split())\r\nans=\"No\"\r\nfor i in range(c//a+1):\r\n if (c-ai)%b==0:\r\n ans=\"Yes\"\r\n break\r\nprint(ans)\r\n", "a, b, c = input().split()\r\na, b, c = int(a), int(b), int(c)\r\n\r\nc_left = c\r\nwhile c_left >= 0:\r\n if c_left % b == 0:\r\n print(\"Yes\")\r\n break\r\n c_left -= a\r\nif c_left < 0:\r\n print(\"No\")\r\n", "a,b,c = map(int,input().split())\r\nop = False\r\nfor i in range(106):\r\n if (c- ai) > 0 and (c-ai)%b == 0 :\r\n op =True \r\n break\r\nif not op :\r\n for i in range(106):\r\n if (c- bi) > 0 and (c-bi)%a == 0 :\r\n op =True \r\n break\r\nif op :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "x, y, z = map(int, input().split())\r\nfor a in range(0, z + 1, x):\r\n for b in range(a, z + 1, y):\r\n if b == z:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")", "a, b, c = list(map(int, input().split()))\r\n\r\n\r\ndef gcd(a, b):\r\n global x\r\n global y\r\n if b == 0:\r\n x = 1\r\n y = 0\r\n\r\n return a\r\n else:\r\n\r\n d = gcd(b, a % b)\r\n # print(x, y)\r\n x, y = y, x - y (a // b)\r\n\r\n return d\r\n\r\n\r\nx = 0\r\ny = 0\r\ng = gcd(a, b)\r\n\r\nfrom math import ceil\r\n\r\nif c % g == 0:\r\n\r\n x = x * (c // g)\r\n y = y * (c // g)\r\n\r\n if x < 0:\r\n k = (ceil(abs(x) / (b // g)))\r\n x = x + k ( b // g)\r\n y = y - k (a // g)\r\n elif y<0:\r\n k = (ceil(abs(y) / (a // g)))\r\n x = x - k * (b // g)\r\n y = y + k * (a // g)\r\n\r\n if x < 0 or y < 0:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "buff = input().split(\" \")\r\na = int(buff[0])\r\nb = int(buff[1])\r\nc = int(buff[2])\r\nres = False\r\nwhile(c > 0):\r\n if (c % b == 0):\r\n res = True\r\n break\r\n c-=a\r\nif (res or c == 0): print(\"Yes\")\r\nelse: print(\"No\")", "#from dust i have come, dust i will be\r\n\r\na,b,c=map(int,input().split())\r\n\r\nfor i in range(0,1000):\r\n x=c-(ia)\r\n\r\n if(x<0):\r\n break\r\n\r\n if x%b==0:\r\n print(\"YES\")\r\n exit(0)\r\n\r\nprint(\"NO\")\r\n\r\n", "from sys import stdin, stdout\r\n\r\nx, y, z = map(int, stdin.readline().split())\r\nfor _ in range(int(z//x+1)):\r\n if (z-_x)%y==0:\r\n stdout.write('Yes\\n')\r\n exit(0)\r\nstdout.write('No\\n')\r\n", "a,b,c=input().split(' ')\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nwhile c>=0 :\r\n if c%b==0 :\r\n print('yes')\r\n break\r\n c=c-a\r\nif c<0 :\r\n print('no')", "a , b , c = map(int,input().split())\r\nfor i in range(20000):\r\n if(c-ai)%b==0 and c-ai>=0:\r\n print(\"Yes\")\r\n quit()\r\nprint(\"No\")\r\n \r\n", "a, b, c = list(map(int, input().split()))\r\nok = 0\r\nfor i in range(c + 1):\r\n\tval = c - a * i\r\n\tif val >= 0 and val % b == 0:\r\n\t\tok = 1\r\nret = ['No', 'Yes']\r\nprint(ret[ok])", "a,b,c=list(map(int,input().split()));\nyes=False;\nfor i in range(0,c+1,a):\n if(c-i)%b==0:\n yes=True;\n break;\nprint('Yes'if yes else 'No');\n", "def bezout(a, b):\n px, py = 1, 0\n x, y = 0, 1\n while b != 0:\n a, (q, b) = b, divmod(a, b)\n px, x = x, px - q * x\n py, y = y, py - q * y\n return a, px, py\n\na, b, c = map(int,input().split())\ng, x, y = bezout(a, b)\nx = c // g; y = c // g\na //= g; b //= g\nprint('No' if c % g or -(x // b) > y // a else 'Yes')\n\t\t\t \t\t \t \t \t \t \t\t \t\t\t\t\t\t", "a, b, c = map(int, input().split())\r\n\r\nfor i in range(1 + c//a):\r\n if (c - ia) % b == 0:\r\n print('Yes')\r\n exit(0)\r\n\r\nprint('No')\r\n", "a,b,c = map(int, input().split())\nyes = 0\nfor i in range(0, c+1, a):\n\tif (c-i) % b == 0:\n\t\tyes = 1\nprint(['No','Yes'][yes])\n", "a, b, c = input().split()\na = int(a)\nb = int(b)\nc = int(c)\n\nf = 0\n\nfor i in range(10000):\n ai= ai\n\n if ai>c:\n break\n \n remaining= c-ai\n\n if remaining%b==0:\n print(\"YES\")\n f= 1\n break\n\nif f == 0:\n print(\"NO\")\n\n \t\t\t\t\t \t\t \t \t\t\t\t\t \t \t\t\t\t", "a, b, c = map(int, input().split())\n\nif a > b:\n a, b = b, a\n\nx = c//a\ny = 0\n\nwhile xa+yb != c:\n if x == 0:\n break\n\n x -= 1\n y = (c - xa) // b\n\nif xa+yb == c:\n print(\"Yes\")\nelse:\n print(\"No\")", "a,b,c=map(int,input().split())\r\nfor i in range(101):\r\n d=ia\r\n if (c-d)%b==0 and d<=c:\r\n print(\"Yes\")\r\n exit(0)\r\nprint(\"No\")\r\n", "a,b,c = map(int,input().split())\r\nd = False\r\nr = c//(min(a,b))\r\n\r\n\r\nfor i in range(r+1):\t\r\n\tfor j in range(r+1):\r\n\t\tif ia+jb==c:\r\n\t\t\td=True\r\n\t\t\tbreak\r\nif d:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "a,b,c = map(int,input().split())\r\nt = min(a,b)\r\n\r\nfor i in range(0,c//a+1):\r\n\ty = (c - ia)/b\r\n\tif y == int(y):\r\n\t\tprint(\"Yes\")\r\n\t\texit()\r\nprint(\"No\")", "a, b, c = [int(x) for x in input().split()]\nfor i in range(c//a + 1):\n\tif((c - i * a) % b == 0):\n\t\tprint(\"Yes\")\n\t\texit()\nfor i in range(c//b + 1):\n\tif((c - i * b) % a == 0):\n\t\tprint(\"Yes\")\n\t\texit()\nprint(\"No\")\n", "a, b, c = map(int, input().split())\r\ntotal_a = 0\r\nwhile total_a <= c:\r\n if (c - total_a) % b == 0:\r\n print('Yes')\r\n break\r\n total_a += a\r\nelse:\r\n print('No')\r\n", "import math\r\ndef prime(n):\r\n ok= True\r\n for i in range(2, int(math.sqrt(n))):\r\n if(n%i==0):\r\n ok = False\r\n break\r\n if(ok):\r\n return True\r\n else:\r\n return False\r\ndef fact(a,b):\r\n ans = 1\r\n for i in range(a, b+1):\r\n ans= i\r\n return str(ans)-1\r\ndef comb(n, c):\r\n return fact(n)//(fact(n-c)c)\r\n\r\na,b,c = map(int, input().split())\r\nif(c%2==1 and (a%2!= 1 and b%2!= 1)):\r\n print('No')\r\nelse:\r\n ok= False\r\n for i in range(10001):\r\n for s in range(10001):\r\n if((ai+bs)==c):\r\n ok =True\r\n break\r\n if(ok):\r\n break\r\n if(ok):\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "a,b,c=list(map(int,input().split()))\r\nwhile c>=0:\r\n if c%b==0:\r\n print('Yes')\r\n break\r\n c-=a\r\nif c<0:\r\n print('No')\r\n", "a, b, c = map(int, input().split())\r\n\r\nif c % a == 0 or c % b == 0:\r\n print(\"Yes\")\r\nelse:\r\n c = c - b\r\n while c > 0:\r\n if c % a == 0:\r\n print(\"Yes\")\r\n exit()\r\n c = -1\r\n else:\r\n c = c - b\r\n print(\"No\")", "a, b, c = [int(i) for i in input().split()]\r\n\r\nfor i in range((c // a) + 1):\r\n if ((c - (i * a)) % b == 0):\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")", "a,b,c = list(map(int,input().split()))\r\nfor i in range(10004):\r\n x = ai\r\n if c-x>=0:\r\n d = c-x\r\n if d%b==0:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r\nexit()", "a,b,c=map(int,input().split())\r\ng=c//min(a,b)+1\r\nflag=0\r\nfor i in range(g+1):\r\n\tfor j in range(g+1):\r\n\t\tif ai+bj==c:\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\nif flag:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\r\n", "from math import gcd\r\n\r\ndef extended_euclid(a,b,c):\r\n if b==0:\r\n return (1,0)\r\n x1,y1=extended_euclid(b,a%b,c)\r\n return ((y1, x1-(a//b)y1))\r\n\r\ndef diophantine_using_euclid(a,b,c):\r\n g=gcd(a,b)\r\n if c%g!=0:\r\n return -1\r\n xg,yg=extended_euclid(a,b,g)\r\n \r\n return ((c//g)xg,(c//g)yg)\r\n\r\n# Including boundary values\r\ndef num_sol_in_range(a,b,c,xmin,ymin,xmax,ymax):\r\n g=gcd(a,b)\r\n if c%g!=0:\r\n return 0\r\n \r\n x,y=diophantine_using_euclid(a,b,c)\r\n \r\n xDelta=b//g\r\n if x<xmin:\r\n xlow=x+xDelta((xmin-x)//xDelta)\r\n if xlow<xmin:\r\n xlow+=xDelta\r\n else:\r\n xlow=x-xDelta((x-xmin)//xDelta)\r\n if xlow>xmax:\r\n return 0\r\n \r\n if x>xmax:\r\n xhigh=x-xDelta((xmax-x)//xDelta)\r\n if xhigh>xmax:\r\n xhigh-=xDelta\r\n else:\r\n xhigh=x+xDelta((xmax-x)//xDelta)\r\n \r\n \r\n yDelta=a//g\r\n if y<ymin:\r\n ylow=y+yDelta((ymin-y)//yDelta)\r\n if ylow<ymin:\r\n ylow+=yDelta\r\n else:\r\n ylow=y-yDelta((y-ymin)//yDelta)\r\n if ylow>ymax:\r\n return 0 \r\n \r\n if y>ymax:\r\n yhigh=y-yDelta((y-ymax)//yDelta)\r\n if yhigh>ymax:\r\n yhigh-=yDelta\r\n else:\r\n yhigh=y+yDelta((ymax-y)//yDelta)\r\n \r\n xlow1=(c-bylow)//a\r\n xhigh1=(c-byhigh)//a\r\n xlow1,xhigh1=(min(xlow1,xhigh1),max(xlow1,xhigh1))\r\n \r\n if xhigh<xlow1 or xhigh1<xlow:\r\n return 0\r\n else:\r\n return (min(xhigh,xhigh1)-max(xlow,xlow1)+xDelta)//xDelta\r\n\r\na,b,c=map(int,input().split())\r\nprint(\"Yes\" if num_sol_in_range(a,b,c,0,0,c//a,c//b)>0 else \"No\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c = map(int, input().split())\r\ndp = [False] * (c + 1)\r\ndp[0] = True\r\nfor i in range(a, c + 1, a):\r\n dp[i] = True\r\n\r\nfor i in range(c + 1):\r\n if dp[i]:\r\n for j in range(b, c + 1, b):\r\n if i + j <= c:\r\n dp[i + j] = True\r\n \r\nif dp[c]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a,b,c = list(map(int, input().split()))\r\nposs = \"No\"\r\nfor i in range(0, 10000):\r\n ebony = ia\r\n ivory = c-ebony\r\n if(ivory >= 0 and ivory%b==0):\r\n poss = \"Yes\"\r\nprint(poss)", "a=input().split()\na=list(map(int,a))\nb=a[2]\nu=0\nwhile b>=0:\n if b==0:\n u+=1\n break\n if b%a[1]==0:\n u+=1\n break\n else:\n b-=a[0]\nif u==0:\n print(\"No\")\nelse:\n print(\"Yes\")\n\t\t\t\t \t \t \t \t\t\t\t\t\t \t\t\t \t \t \t\t", "a,b,c=map(int,input().split())\r\nwhile c >= 0:\r\n if c%a == 0:print ('YES');break\r\n c -= b\r\nelse:print ('NO')", "a,b,c=list(map(int,input().split()))\r\nmymin,mymax=min(a,b),max(a,b)\r\nif c%a==0 or c%b==0:\r\n print('Yes')\r\nelse:\r\n while c>=mymin:\r\n if c%mymin==0:\r\n print('Yes')\r\n break\r\n else:\r\n c-=mymax\r\n else:\r\n print('No')", "a, b, c = [int(x) for x in input().split()]\r\nf = True\r\nfor i in range(c // a + 1):\r\n for j in range((c - i) // b + 1):\r\n if i a + j * b == c:\r\n f = False\r\n break\r\n if not f:\r\n break\r\nif not f :\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "from math import floor\r\na,b,c=map(int,input().split())\r\nx=0\r\nfor i in range(floor(c/max(a,b)),-1,-1):\r\n if((c-imax(a,b))%min(a,b)==0):\r\n x=1\r\n break\r\nif(x):print(\"Yes\")\r\nelse:print(\"No\")", "a,b,c = map(int,input().split())\r\nnum = c // a + 1\r\ntemp = 0\r\nfor i in range(num):\r\n if (c - ia)%b == 0:\r\n temp = 1\r\n break\r\nif temp == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "nums = list(map(int, input().split()))\ne = nums[0]\ni = nums[1]\ndmg = nums[2]\npassed = False\n\nif(dmg is e or dmg is i or dmg is 0):\n print(\"Yes\")\nelse:\n index = 0\n while(eindex < dmg and iindex < dmg):\n if((dmg-eindex)%i is 0):\n passed = True\n break\n elif((dmg-iindex)%e is 0):\n passed = True\n break\n index += 1\n if(passed):\n print(\"Yes\")\n else:\n print('No')", "a,b,c = map(int,input().split())\r\nif c%a==0 or c%b==0:\r\n\tprint('Yes')\r\n\tquit()\r\nif c<=max(a,b):\r\n\tprint('No')\r\n\tquit()\r\nc1,c2 = c,c\r\nwhile c1-a>0:\r\n\tif (c1-a)%b==0:\r\n\t\tprint('Yes')\r\n\t\tquit()\r\n\telse:\r\n\t\tc1-=a\r\n\r\nwhile c2-b>0:\r\n\tif (c2-b)%a==0:\r\n\t\tprint('Yes')\r\n\t\tquit()\r\n\telse:\r\n\t\tc2-=b\r\nprint('No')", "a,b,c = map(int, input().split(\" \"))\n\ndef a633(a,b,c):\n u = max(a,b)\n v = min(a,b)\n if u == c == 0:\n print(\"YES\")\n return\n elif u == 0 and c > 0:\n print(\"NO\")\n return\n else:\n for i in range((c//u)+1):\n if (c - iu)%v == 0:\n print(\"YES\")\n return\n print(\"NO\")\n\na633(a,b,c)\n", "from collections import deque\na,b,c = list(map(int, input().split()))\npre = {}\nfila = deque([0])\nwhile fila:\n v = fila.popleft()\n if((v+a) not in pre and (v+a) <= c):\n fila.append(v+a)\n pre[v+a] = v\n if((v+b) not in pre and (v+b) <= c):\n fila.append((v+b))\n pre[v+b] = v\nseq = [c]\nresposta = \"\"\nif c not in pre:\n print(\"No\")\nelse:\n print(\"Yes\")\n \t\t\t \t \t\t\t\t \t\t \t \t\t \t \t\t\t \t", "n=list(map(int,input().split()))\r\nif n[2]%n[0]==0 or n[2]%n[1]==0:\r\n print(\"Yes\")\r\nelse:\r\n a=n[2]//n[0]\r\n b=n[2]//n[1]\r\n p=0\r\n if a>b:\r\n for i in range(a+1):\r\n for j in range(b,-1,-1):\r\n if in[0]+jn[1]<n[2]:\r\n break\r\n elif in[0]+jn[1]==n[2]:\r\n print(\"Yes\")\r\n p=1\r\n break\r\n if p==1:\r\n break\r\n else:\r\n for i in range(b+1):\r\n for j in range(a,-1,-1):\r\n if jn[0]+in[1]<n[2]:\r\n break\r\n elif jn[0]+in[1]==n[2]:\r\n print(\"Yes\")\r\n p=1\r\n break\r\n if p==1:\r\n break\r\n if p!=1:\r\n print(\"No\")", "from operator import itemgetter as ig\r\n'''\r\nif __name__=='__main__':\r\n n = int(input())\r\n strng = input()\r\n m = int(input())\r\n pos = {}\r\n for i in range(m):\r\n s = input()\r\n _s = s.lower()[::-1]\r\n\r\n if _s in strng:\r\n p = strng.index(_s)\r\n pos[p]=s\r\n print (pos)\r\n pos = sorted(pos.items(), key=ig(0))\r\n anss= ''\r\n for i in range(len(pos)):\r\n if i==len(pos):\r\n anss+=pos[i][1]\r\n else:\r\n anss+=pos[i][1]+' '\r\n print (anss)\r\n \r\n \r\n\r\n \r\n'''\r\nif __name__=='__main__':\r\n a,b,k= map(int,input().split(' '))\r\n x=0\r\n while x<=k//a:\r\n if (k-xa)%b==0:\r\n print('Yes')\r\n break\r\n x+=1\r\n else:\r\n print ('No')\r\n\r\n \r\n \r\n", "a,b,c=map(int,input().split())\r\nz='No'\r\nfor x in range(c//a+1):\r\n for y in range(c//b+1):\r\n if ax+by==c:\r\n z='Yes'\r\nprint(z)", "import math\r\n# import bisect\r\nimport sys\r\n# from collections import OrderedDict\r\ninput = sys.stdin.readline\r\ndef inp():\r\n\treturn(int(input()))\r\ndef inlt():\r\n\treturn(list(map(int,input().split())))\r\ndef insr():\r\n\ts = input()\r\n\treturn(s[:len(s)-1])\r\ndef invr():\r\n\treturn(map(int,input().split()))\r\n# T = inp()\r\n# MOD = 1000000007\r\n# print(MOD)\r\n# for t in range(T):\r\na, b, c = invr()\r\nif c%a == 0:\r\n\tprint(\"Yes\")\r\nelif c%b == 0:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tdiv = c//a\r\n\tcurr = a\r\n\tfl = True\r\n\tfor i in range(div):\r\n\t\tif (c-curr)%b == 0:\r\n\t\t\tprint(\"Yes\")\r\n\t\t\tfl = False\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tcurr += a\r\n\tif fl:\r\n\t\tprint(\"No\")\r\n \r\n ", "a,b,c=map(int,input().split())\r\nx=False\r\nwhile c>0 and not x:\r\n if c%b==0:\r\n x=True\r\n c-=a\r\nif c==0 or x:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c = map(int, input().split())\r\na, b = sorted([a,b])\r\nans = 'No'\r\nwhile c >= 0:\r\n if c%a != 0:\r\n c -= b\r\n else:\r\n ans = 'Yes'\r\n break\r\nprint(ans)", "def solve(a,b,c):\r\n i=0\r\n while ia<=c:\r\n if (c-(ai))%b==0:\r\n print(\"Yes\")\r\n return\r\n i+=1\r\n print(\"No\")\r\n\r\na,b,c = map(int,input().split())\r\nsolve(a,b,c)\r\n", "def main():\n a, b, c = map(int, input().split())\n for rest in range(c, -1, -a):\n if not rest % b:\n print(\"Yes\")\n return\n print(\"No\")\n\n\nif __name__ == '__main__':\n main()\n", "a,b,c = list(map(int , input().split()))\r\nfor i in range(c//a+1):\r\n if((c-ai) % b == 0):\r\n print('Yes')\r\n break \r\nelse:\r\n print('No') ", "a,b,c = map(int, input().split())\r\nx = 0\r\nwhile a x <= c:\r\n if (c - a * x) % b == 0: \r\n print('Yes')\r\n exit(0)\r\n x+=1\r\nprint('No')", "data = 10001 * [0]\na, b, c = map(int, input().split())\nfor i in range(len(data)):\n if i == a or i == b or i - a >= 0 and data[i - a] == 1 or i - b >= 0 and data[i - b]:\n data[i] = 1\nprint('Yes') if data[c] == 1 else print('No')\n", "a, b, c = map(int, input().split())\n\nfor i in range(101):\n\tt = (c - a * i) / b\n\tif t >= 0 and int(t) == t:\n\t\tprint('Yes')\n\t\texit()\n\nprint('No')", "a, b, c = list(map(int, input().split()))\r\nanswer = False\r\nfor y in range(c//b + 1):\r\n x = (c - by) / a\r\n if x == int(x):\r\n answer = True\r\n break\r\nif answer:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\ndef gcd(xx,yy):\r\n x, y = sorted([xx,yy])\r\n while y != 0:\r\n r = x%y\r\n x = y \r\n y = r\r\n return x\r\n\r\ndef xgcd(aa, bb):\r\n \"\"\"return (g, x, y) such that ax + by = g = gcd(a, b)\"\"\"\r\n x0, x1, y0, y1 = 0, 1, 1, 0\r\n while aa != 0:\r\n q, bb, aa = bb // aa, aa, bb % aa\r\n y0, y1 = y1, y0 - q y1\r\n x0, x1 = x1, x0 - q * x1\r\n return bb, x0, y0\r\n\r\n#a, b, c = [14, 19, 143]\r\na, b, c = [int(x) for x in input().split()]\r\nd,s,t = xgcd(a,b)\r\n\r\n#d = sa + tb\r\n#\r\n\r\n#print (d,s,t)\r\n\r\nif c%d == 0:\r\n if s >=0 and t >= 0:\r\n print(\"Yes\")\r\n else:\r\n q = c/d\r\n #c = csa/d + ctb/d\r\n #solucao particular de ax + by = c\r\n x0 = int(cs/d) \r\n y0 = int(ct/d)\r\n #print(x0,y0,ax0+by0 == c)\r\n #todas as solucoes sao da forma\r\n # x + (b/d)k. y-(a/d)k\r\n #print(y0d/a,-x0d/b)\r\n if math.floor(y0d/a) >= math.ceil(-x0d/b):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelse:\r\n print(\"No\")", "def gcd_hell():\n print(\"hello\")\n\ndef gcd(a,b):\n if(b==0):\n return a\n a%=b\n return gcd(b,a)\n \n\n\na,b,c=map(int,input().split())\ny=0\n\nres = gcd(a,b)\n\nif(c>res): res = c%res + res\n\nwhile (c-by)/a >=0:\n if (c-by)%a ==0:\n print('Yes')\n break\n y += 1\nelse:\n print('No')\n", "def main():\n\ta, b, c = map(int, input().split())\n\tmin_a = min(a , b)\n\tmax_a = max(a, b)\n\tfor i in range(c // min_a + 1):\n\t\tif (c - min_a * i) % max_a == 0:\n\t\t\treturn \"Yes\"\n\treturn \"No\"\n\nprint(main())\n \t\t\t \t\t \t \t \t\t\t\t\t \t \t\t", "m=list(map(int,input().split()))[:3]\r\nwhile(m[2]>=0):\r\n if(m[2]%m[0]==0):\r\n print(\"Yes\")\r\n break\r\n m[2]=m[2]-m[1]\r\nif(m[2]<0):\r\n print(\"No\")\r\n", "a,b,c = map(int,input().split())\r\nfor i in range(c//a+1):\r\n if (c-ai)%b==0:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")", "a,b,c=map(int,input().split())\r\ns,s1=[],[]\r\ncn,i,j=0,0,0\r\nwhile True:\r\n k=ai;s.append(k)\r\n i+=1\r\n if k>c:break\r\nwhile True:\r\n m=bj;s1.append(m)\r\n j+=1\r\n if m>c:break\r\nif (c in s) or (c in s1):print('YES');exit()\r\nfor i in range(len(s)):\r\n for j in range(len(s1)):\r\n if s[i]+s1[j]==c:print('YES');exit()\r\nprint('NO')\r\n", "#! /usr/bin/env python3\n\ndef main():\n a, b, c = map(int, input().split())\n\n for i in range(0, c + 1, a):\n rem = c - i\n if rem // b b == rem:\n print('Yes')\n return\n print('No')\n\n\n\nmain()", "def func():\n [a, b, c] = [int(el) for el in input().split()]\n if b > a:\n a, b = b, a\n while True:\n if c < a and c < b: return 'NO'\n if c%a == 0: return 'YES'\n if c%b == 0: return 'YES'\n c = c-b\n print('-')\n\nprint(func())\n\t \t \t\t\t\t \t\t \t\t\t\t\t \t \t\t\t\t\t\t\t \t", "a, b, c = list(map(int, input().split()))\nx1 = c // a + 1\nf = False\nfor i in range(x1):\n j = (c - ai) // b\n #print(i, ia, j, b * j, c - ai)\n if a i + b * j == c:\n f = True\nif f:\n print(\"Yes\")\nelse:\n print(\"No\")", "a,b,c=map(int,input().split());p=0\r\nwhile 1:\r\n k=c-(pa)\r\n if k>0 and (k%a==0 or k%b==0): print(\"Yes\");break\r\n elif k<0: print(\"No\");break\r\n p+=1", "\n\n\"\"\"a,b,c= map(int,input().split())\n\ndef gcd(a, b):\n \n # Everything divides 0\n if (a == 0):\n return b\n if (b == 0):\n return a\n \n # Base case\n if (a == b):\n return a\n \n # a is greater\n if (a > b):\n return gcd(a-b, b)\n return gcd(a, b-a)\n\nres= gcd(a,b)\nif c%res==0:\n print(\"Yes\")\nelse:\n print(\"No\")\n\"\"\"\na,b,c= map(int,input().split())\n\ndef solution (a, b, n):\n i = 0\n while i a <= n:\n if (n - (i * a)) % b == 0:\n x=i\n y=int((n - (i * a)) / b)\n if(x>=0 and y>=0):\n return True\n return False\n i = i + 1\n \n return False\n \n\nres=solution(a,b,c)\nif (res):\n print(\"Yes\")\nelse:\n print(\"No\")\n\n", "a, b, c = map(int, input().split())\r\nh = 0\r\nif c % a == 0:\r\n k = c // a\r\nelse:\r\n k = c // a + 1\r\nif c % b == 0:\r\n m = c // b\r\nelse:\r\n m = c // b + 1\r\nif c - ak < 0 and c - bm < 0 and ((c < 2 * a) and c < 2b):\r\n print('No')\r\nelse:\r\n for i in range(k+1):\r\n if (c - ai) % b == 0 and (h == 0):\r\n print('Yes')\r\n h = 1\r\n if h == 0:\r\n print('No')\r\n", "n,m,o=map(int,input().split())\nfor i in range(o//n+1):\n\tif (o - in) % m == 0:\n\t\tprint(\"Yes\")\n\t\tbreak\nelse:\n\tprint(\"No\")\n \t\t \t\t \t\t\t\t \t\t\t \t\t \t \t", "import math\r\n\r\n\r\ndef main_function():\r\n a, b, c = [int(i) for i in input().split(\" \")]\r\n is_divisible = False\r\n for i in range(c + 1):\r\n if (i % a == 0 and (c - i) % b == 0) or ((c - i) % a == 0 and c % b == 0):\r\n is_divisible = True\r\n break\r\n if is_divisible:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "import sys\nLI=lambda:list(map(int, sys.stdin.readline().split()))\nMI=lambda:map(int, sys.stdin.readline().split())\nSI=lambda:sys.stdin.readline().strip('\\n')\nII=lambda:int(sys.stdin.readline())\n\na, b, c=MI()\nok=False\nfor i in range(0, c, a):\n if (c-i)%b==0:\n ok=True\nfor i in range(0, c, b):\n if (c-i)%a==0:\n ok=True\nprint(['NO', 'YES'][ok])\n", "a,b,c = tuple(map(int,input().split(\" \")))\r\nfor i in range(c//a+1):\r\n if (c-ia)%b==0:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "A=[0](100010)\r\na,b,c=[int(x) for x in input().split()]\r\nA[a]=A[b]=1\r\nfor i in range(100000):\r\n if A[i]!=0:\r\n if i+a<=100000: A[i+a]=1\r\n if i+b<=100000: A[i+b]=1\r\nif A[c]==1:\r\n print('Yes')\r\nelse:\r\n print('No')", "#import math\r\nfrom sys import stdin,stdout\r\n#from heapq import heappop,heappush\r\n#input,print = stdin.readline,stdout.write\r\n\r\ndef gcd(a,b):\r\n if not b:\r\n return a\r\n if a&1:\r\n while not b&1:\r\n b>>=1\r\n if b%1:\r\n while not a&1:\r\n a>>=1\r\n x=1\r\n while (not b&1) and (not a&1):\r\n x<<=1\r\n a>>=1\r\n b>>=1\r\n return xgcd(b,a%b)\r\n\r\n\r\ndef gcdExtended(a, b):\r\n if a == 0 :\r\n return b,0,1\r\n gcd,x1,y1 = gcdExtended(b%a, a)\r\n x = y1 - (b//a) * x1\r\n y = x1\r\n return gcd,x,y\r\n\r\n\r\n\r\n#--------------Input--------------#\r\nfor _ in range(1):\r\n#for _ in range(int(input())):\r\n #n=int(input())\r\n #s=input()\r\n a,b,c=map(int,input().split())\r\n #arr=list(map(int,input().split()))\r\n\r\n#--------------Main--------------#\r\n gcd=gcd(a,b)\r\n if c%gcd!=0:\r\n print('No')\r\n continue\r\n a//=gcd\r\n b//=gcd\r\n c//=gcd\r\n gcd,x,y=gcdExtended(a,b)\r\n x=c\r\n y=c\r\n if x>=0 and y>=0:\r\n print('Yes')\r\n continue\r\n if x<0:\r\n up=(-x)//b\r\n if (-x)%b!=0:\r\n up+=1\r\n if y-upa>=0:\r\n print('Yes')\r\n continue\r\n else:\r\n print('No')\r\n continue\r\n if y<0:\r\n up=(-y)//a\r\n if (-y)%a!=0:\r\n up+=1\r\n if x-upb>=0:\r\n print('Yes')\r\n continue\r\n else:\r\n print('No')\r\n continue", "#Entrada en s\r\ns = input();\r\n#Entrada a,b,c separadas\r\na,b,c = s.split();\r\n#Evony\r\na=int(a);\r\n#Ivory\r\nb=int(b);\r\n#Escudo\r\nc=int(c);\r\n#Inicializar check\r\ncheck=False;\r\n#Desde 0 hasta 10003\r\nfor i in range(0,10003) :\r\n #N para calcular las posibilidades de Evony\r\n n = c-ai;\r\n #Si se paso el escudo retornar verdadero y romper\r\n if n>=0 and n%b==0 :\r\n check=True;\r\n print(\"Yes\");\r\n break;\r\n#Si no se hizo el daño exacto al del escudo retornar falso \r\nif check==False :\r\n print(\"No\");", "a,b,c=map(int,input().split(' '))\r\ni=0\r\nr=0\r\nwhile(i<=c/a):\r\n k=c-ia\r\n if(k%b==0):\r\n r=1\r\n break;\r\n i=i+1\r\nif r==1:\r\n print(\"Yes\")\r\nelse: \r\n print(\"No\")\r\n", "a,b,c=map(int,input().split())\nd=0\ndef ans(a,b,c,d):\n if c%a==0 or c%b==0:\n print('Yes')\n return\n else:\n a,b=min(a,b),max(a,b)\n ##print(a,b)\n while d<c:\n d+=a\n if (c-d)%b==0:\n print('Yes')\n return\n else:\n continue\n print(\"No\")\n return\nans(a,b,c,d)\n", "a,b,c=map(int,input().split())\nyes=0\nfor i in range(0,c+1,a):\n if (c-i)%b==0:yes=1\nprint(['No','Yes'][yes])\n \t\t \t\t\t \t \t\t\t\t \t \t \t\t \t\t", "__author__ = 'Utena'\r\na,b,c=map(int,map(int,input().split()))\r\nwhile True:\r\n if c<0:\r\n print('No')\r\n break\r\n elif c%a==0 or c%b==0:\r\n print('Yes')\r\n break\r\n c-=a", "a, b, c = map(int, input().split())\n\nb, a = sorted([a, b])\n\nans = False\nif c % 2 == 1 and a % 2 == 0 and b % 2 == 0:\n pass\nelif c == 0:\n ans = True\nelif a == 0:\n pass\nelif b == 0:\n if c % a == 0:\n ans = True\nelse:\n k = c // a\n for i in range(k, -1, -1):\n m = (c - i * a) % b\n if m == 0:\n ans = True\n break\n\nif ans:\n print('Yes')\nelse:\n print('No')\n", "import math\r\ndef extendedeuclid(A,B):\r\n global x,y,d\r\n if B == 0:\r\n d = A\r\n x = 1\r\n y = 0\r\n else:\r\n extendedeuclid(B,A%B)\r\n temp = x\r\n x = y\r\n y = temp - (A//B)y\r\nif __name__ =='__main__':\r\n x = 0\r\n y = 0\r\n d = 0\r\n a,b,c = [int(x) for x in input().split()]\r\n extendedeuclid(a,b)\r\n # print(d,x,y)\r\n if c%d:\r\n print(\"NO\")\r\n else:\r\n k = math.ceil(-(xc//d)/(b/d))\r\n if y(c//d) - k(a/d) >= 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def f(l):\r\n a,b,c = l #100,100,1e4\r\n if a<b:\r\n a,b=b,a #let a = bigger\r\n aa = 0\r\n while aa<=c:\r\n if (c-aa)%b==0:\r\n return True\r\n aa += a\r\n return False\r\n\r\nl = list(map(int,input().split()))\r\nprint('Yes' if f(l) else 'No')\r\n", "__author__ = 'aste'\r\n\r\n\r\ndef main():\r\n a, b, c = [int(x) for x in input().split()]\r\n\r\n res = False\r\n for i in range(0, c + 1):\r\n r = c - ai\r\n if r >= 0 and r % b == 0:\r\n res = True\r\n break\r\n\r\n print(res and \"Yes\" or \"No\")\r\n\r\nmain()\r\n", "import math\r\n\r\na,b,c=map(int,input().split())\r\nfor i in range(0,c//a+1):\r\n if (c-ia)%b==0:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")", "a, b, c = map(int, input().split())\r\nf = True\r\nfor i in range(c // a + 1):\r\n for j in range(c // b + 1):\r\n if a * i + b * j == c:\r\n print(\"Yes\")\r\n f = False\r\n break\r\n if not f:\r\n break\r\nif f:\r\n print(\"No\")", "a,b,c = map(int,input().split())\r\nx = [0]10010\r\nfor i in range(a,len(x),a): x[i]=1\r\nfor j in range(1,10001):\r\n\tif j%b==0: x[j]=1\r\n\tif x[j] and j+b <= 10005: x[j+b]=1\r\n\r\nif x[c]:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "a, b, c = map(int, input().split())\npossible = False\nfor i in range(c//a + 1):\n if (c - ai) % b == 0:\n possible = True\nif possible:\n print('Yes')\nelse:\n print('No')", "a, b, c = map(int, input().split())\r\nla = []\r\nlb = []\r\n\r\ni = 0\r\nwhile i <= c:\r\n la.append(i)\r\n i += a\r\n# print(la)\r\ni = 0\r\nwhile i <= c:\r\n lb.append(i)\r\n i += b\r\n# print(lb)\r\nz = []\r\nif c in la or c in lb:\r\n print(\"Yes\")\r\nelse:\r\n z = []\r\n for i in la:\r\n for j in lb:\r\n z.append(i+j)\r\n if c in z:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n # print(z)\r\n", "a,b,c= list(map(int, input().split()))\r\nx= int(c/(a+b))\r\nfor i in range(x+1):\r\n st= c- (a+b)i\r\n if st%a==0 or st%b==0:\r\n print('Yes'); exit(0)\r\n \r\nprint('No')", "a,b,c=map(int,(input().split()))\r\nif c%a==0 or c%b==0:\r\n print(\"Yes\")\r\nelse:\r\n while (c>0):\r\n c = c - a\r\n if c%b==0 and c>0:\r\n print(\"Yes\")\r\n break\r\n elif c < 0:\r\n print(\"No\")\r\n break", "a, b, c = map(int, input().split())\r\nkey = 0\r\ni = 0\r\nwhile (i b <= c):\r\n if (c - i * b) % a == 0:\r\n key = 1\r\n break\r\n i += 1\r\nif key == 0:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "from math import gcd\n\na, b, c = map(int,input().split())\na, b = min(a, b), max(a, b)\ng = gcd(a, b)\nans = c % g == 0\nif ans:\n ans = False\n for i in range(0, c + 1, a):\n if (c - i) % b == 0:\n ans = True\n break\nprint('Yes' if ans else 'No')\n \t \t \t \t \t \t \t\t \t\t\t \t\t \t", "a, b, z = [int(x) for x in input().split()]\r\nT=a+b\r\na = a if a>b else b\r\nb=T-a\r\nVal= False\r\nfor k in range(z//a+1):\r\n T=z-ka\r\n if(T%b == 0):\r\n Val = True\r\n break\r\nif(Val):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a,b,c = map(int,input().split(' '))\r\nif c%a==0 or c%b==0:\r\n print(\"YES\")\r\nelif a==b:\r\n if c%a!=0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n\r\n if b>a:\r\n start = a\r\n end = b\r\n else:\r\n start = b\r\n end = a\r\n i = int(c/end)\r\n if (c-iend)%start==0:\r\n print('YES')\r\n # j = int(c/b)\r\n else:\r\n flag=0\r\n for j in range(i):\r\n if (c-jend)%start==0:\r\n flag=1\r\n print(\"YES\")\r\n break\r\n if flag==0:\r\n print(\"NO\")", "a,b,c=map(int,input().split())\r\nt=0\r\nwhile at<=c:\r\n if (c-at)%b==0:\r\n print('Yes')\r\n exit()\r\n t+=1\r\nprint('No')\r\n", "def solve(a,b,c):\n x, y = c//a, c//b\n for i in range(x + 1):\n for j in range(y + 1):\n if a i + b * j == c:\n return True\n return False\n\na,b,c = map(int,input().split())\n\nif solve(a,b,c):\n print('Yes')\nelse:\n print('No')\n", "a,b,c=map(int,input().split())\r\nif min(a,b)>c:exit(print(\"NO\"))\r\nfor i in range(0,10*5+1):\r\n if c-(ia)<0:exit(print(\"NO\"))\r\n if (c-(ia))%b==0:exit(print(\"YES\"))\r\n", "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 fractions import gcd\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (\r\n acos, asin, atan, ceil, cos, degrees, factorial, hypot, log2, pi, radians,\r\n 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\na, b, c = invr()\r\n\r\nres = \"No\"\r\nfor i in range(c+1):\r\n for j in range(c + 1):\r\n if ai + bj == c:\r\n res = \"Yes\"\r\n break\r\nprint(res)\r\n", "x = input().split()\na = int(x[0])\nb = int(x[1])\nc = int(x[2])\n\nd = c // a + a\ne = c // b + b\n\nfor ax in range(0, d):\n for bx in range(0, e):\n if aax + bbx == c:\n print(\"Yes\")\n quit()\nprint(\"No\")\n\n \t \t\t \t\t \t\t \t \t \t \t\t \t", "a,b,c = map(int,input().split())\r\nif c%a==0 or c%b==0 or c%(a+b)==0: print(\"YES\")\r\nelse:\r\n\twhile c>=0:\r\n\t\tif c%a==0: print(\"YES\");break\r\n\t\tc -= b\r\n\telse: print(\"NO\")", "from math import gcd\r\na,b,c=list(map(int,input().split()))\r\nflag=0\r\nfor i in range(0,c+1,a):\r\n if((c-i)%b==0):\r\n print('YES')\r\n flag=1\r\n break\r\nif(flag==0):\r\n print('NO')", "from math import ceil\r\ndef gcdEx(a,b,x,y):\r\n if not a:\r\n return 0,1,b\r\n x1,y1,g=gcdEx(b%a,a,0,0)\r\n x=y1-(b//a)x1\r\n y=x1\r\n return x,y,g\r\na,b,c=map(int, input().split())\r\nx,y,g=gcdEx(a,b,0,0)\r\nif c%g:\r\n print(\"No\")\r\nelse: \r\n x,y=xc//g,yc//g\r\n k1=ceil(-xg/b)\r\n k2=(yg)//a\r\n c=abs(k2-k1+1)\r\n print(\"Yes\" if c>0 else \"No\")", "# print(\"Input a, b, and c\")\na,b,c = [int(x) for x in input().split()]\n\nif c < a and c < b:\n print(\"No\")\nelif c % a == 0:\n print(\"Yes\")\nelif c % b == 0:\n print(\"Yes\")\nelse:\n # Brute force all possibilities\n found = False\n avalue = a\n while avalue < c and found == False:\n leftover = c - avalue\n if leftover % b == 0:\n found = True\n break\n else:\n avalue += a\n if found:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "def count_solutions(a, b, c):\r\n # Array to store the number of solutions for all values up to c.\r\n # Initialize all values as 0.\r\n dp = [0](c+1)\r\n # There is always one solution for 0 (x=y=0).\r\n dp[0] = 1\r\n\r\n # Count of solutions using a.\r\n for i in range(a, c+1):\r\n dp[i] += dp[i-a]\r\n \r\n # Count of solutions using b.\r\n for i in range(b, c+1):\r\n dp[i] += dp[i-b]\r\n\r\n return dp[c]\r\na,b,c=map(int,input().split())\r\nif count_solutions(a, b, c)>0:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "a,b,c = map(int,input().split())\n\nans = False\ni = int(c/a)\nwhile i >= 0:\n\tif (c - (i a)) % b == 0:\n\t\tans = True\n\t\tbreak\n\ti -= 1\n\nif ans:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n\t\t \t\t \t\t \t\t\t\t\t\t\t \t\t", "a, b, c = map(int, input().split())\r\nhelp = False\r\nfor i in range(c + 1):\r\n if a * i > c:\r\n break\r\n if (c - a * i) % b == 0:\r\n print('Yes')\r\n help = True\r\n break\r\nif not help:\r\n print('No')", "a,b,c=map(int,input().split())\r\n\r\na,b=min(a,b),max(a,b)\r\n\r\n\r\ni=0\r\nflag=1\r\nwhile ia<=c:\r\n\r\n\tif (c-(ia))%b==0:\r\n\t\tprint(\"Yes\")\r\n\t\tflag=0\r\n\t\tbreak\r\n\r\n\ti+=1\r\n\r\nif flag:\r\n\tprint(\"No\")\r\n", "from collections import defaultdict, Counter\r\nfrom queue import PriorityQueue, Queue\r\nimport math\r\n\r\na, b, c = map(int, input().split())\r\nfor i in range(c // a + 1) :\r\n if (c - a * i) % b == 0 :\r\n print(\"Yes\")\r\n break\r\nelse :\r\n print(\"No\")\r\n\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/633/A\r\n\r\na, b, c = map(int, input().split())\r\n\r\nfor i in range(c // a + (2 if c % a == 0 else 1)):\r\n for j in range((c - i * a) // b + (2 if (c - i * a) % b == 0 else 1)):\r\n if (c - i * a - j * b) == 0:\r\n print(\"Yes\")\r\n quit()\r\n\r\nprint(\"No\")", "a,b,c=map(int,input().split())\r\ni=0\r\ns='NO'\r\nwhile i<=c:s=s if(c-i)%b else 'YES';i+=a\r\nprint(s)", "a, b, c = map(int,input().split())\r\nx = False\r\nwhile c > 0 and not x:\r\n if (c % b == 0):\r\n x = True\r\n c -= a\r\nif x or c == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c = map(int,input().split())\r\nif c % a == 0 or c % b == 0: print(\"Yes\"); exit()\r\nelse:\r\n for i in range(a,c,a):\r\n if (c-i)%b == 0: print(\"Yes\"); exit()\r\n for i in range(b,c,b):\r\n if (c-i)%a == 0: print(\"Yes\"); exit()\r\nprint(\"No\")", "def romperEscudo1(a,b,c):\r\n encontro = False\r\n for i in range (c//a+1):\r\n k=c-ia\r\n if(k%b==0):\r\n encontro = True\r\n break\r\n if(encontro):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\nnums = list(map(int, input().split(' ')))\r\nromperEscudo1(nums[0],nums[1],nums[2])\r\n", "\r\na, b, c = map(int, input().split())\r\n\r\nfor x in range(0, c // a + 1):\r\n if (c - a x) % b == 0:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")", "a,b,c=map(int,input().split())\r\ni=0\r\nk=c\r\nwhile (c - bi)>=0:\r\n k=c-bi\r\n if k%a==0:\r\n print('Yes')\r\n exit()\r\n i+=1\r\nprint('No') ", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-06 23:08:27\nLastEditTime: 2021-11-06 23:27:23\nDescription: Ebony and Ivory\nFilePath: CF633A.py\n'''\n\ndef func():\n a, b, c = map(int, input().strip().split())\n for x in range(0, c + 1):\n y = c - a * x\n if y >= 0 and y % b == 0:\n print(\"YES\")\n break\n else:\n print(\"NO\")\n\n\nif __name__ == '__main__':\n func()\n ", "string = input()\r\na, b, n = map(int, string.split())\r\nfor x in range(n // a + 1):\r\n if (n - a * x) % b == 0:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")", "a,b,c=[int(e) for e in input().split()]\r\nprint(\"YES\" if 1 in ((c-ia)%b==0 for i in range(c//a+1)) else \"NO\")", "a,b,c = map(int, input().split())\r\ny = 0\r\nwhile by <= c:\r\n if (c-by) % a == 0:\r\n print('Yes')\r\n exit(0)\r\n y += 1\r\nprint('No')\r\n", "a,b,c=map(int,input().split())\r\nr=0\r\nfor i in range(100):\r\n if ia>c:break\r\n if (c-(ai))%b<1:r=1\r\nprint('YNeos'[1-r::2])", "a, b, c = map(int, input().split())\r\n\r\nans = \"NO\"\r\n\r\nfor i in range(c+1):\r\n tmp = c - ai\r\n if tmp >= 0 and tmp%b == 0:\r\n #print(i, (c-ai)//b)\r\n ans = \"YES\"\r\n break\r\n\r\nprint(ans)", "a,b,c = map(int,input().split())\r\nq = 1\r\nfor i in range(c + 1):\r\n y = (c - a i)// b\r\n if a * i + b * y == c and y >= 0:\r\n q = 0\r\nprint('NO'if q else 'YES')", "abc=input().split()\r\na=int(abc[0])\r\nb=int(abc[1])\r\nc=int(abc[2])\r\ncount=0\r\nif c%a==0 or c%b==0:\r\n print('Yes')\r\nelse:\r\n for i in range(c):\r\n if ia>c:\r\n break\r\n if (c-ia)%b==0:\r\n count+=1\r\n if count>0:\r\n print('Yes')\r\n else:\r\n print('No')", "a,b,n=map(int,input().split())\r\nf=int(n/a)\r\nl=0\r\nfor i in range(f+1):\r\n if((n-ai)%b==0):\r\n l=1\r\n break\r\nif(l==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a,b,c = map(int,input().split())\r\nfor i in range(c//a+1):\r\n\tif((c-ai)%b==0):print(\"Yes\");break\r\nelse:print(\"No\")", "#Anuneet Anand\r\n\r\nfrom math import gcd\r\n\r\na,b,c = map(int,input().split())\r\n\r\nF = False\r\n\r\nfor i in range(10000+1):\r\n\td = c-ai\r\n\tif d>=0 and d%b==0:\r\n\t\tF = True\r\n\r\nif F:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "a, b, c = [int(j) for j in input().split()]\r\nf = int(c / a)\r\noutput = \"NO\"\r\nfor x in range(f + 1):\r\n val = c - x a\r\n if val % b == 0:\r\n output = \"YES\"\r\n break\r\nprint(output)\r\n", "a, b, c = [int(x) for x in input().split(' ')]\r\nx = c//b\r\npossible = False\r\nfor i in range(0, x+1):\r\n if (c-ib)%a == 0:\r\n possible = True\r\n break\r\nprint(\"Yes\" if possible else \"No\")\r\n", "import fractions\r\na, b, c = [int(x) for x in input().split()]\r\n\r\ndef solve(a, b, c):\r\n if c % fractions.gcd(a, b) != 0: return False\r\n if c >= ab: return True\r\n for i in range(b):\r\n for j in range(a):\r\n if ai + bj == c:\r\n return True\r\n return False\r\n\r\nprint('Yes' if solve(a,b,c) else 'No')", "from math 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\nn,m,k=M()\r\nflag=1\r\nwhile k>=0:\r\n if k%m==0:\r\n print(\"YES\");flag=0;break\r\n k-=n\r\nif flag: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", "a,b,c = map(int, input().split())\r\n\r\nans = \"NO\"\r\n\r\nif c % a == 0 or c % b == 0:\r\n print(\"YES\")\r\n quit()\r\n\r\nfor i in range(5000):\r\n for j in range(5000):\r\n if ai + bj == c:\r\n ans = \"YES\"\r\n break\r\n if ans == \"YES\":break\r\n \r\nprint(ans)", "#633A\r\n[a,b,c] = list(map(int,input().split()))\r\nres = 'No'\r\nfor i in range(c//a+1):\r\n if (c - ia) %b == 0:\r\n res = 'Yes'\r\n break\r\nprint(res)", "def solution(a, b, n):\r\n i = 0\r\n while ia<=n:\r\n if (n - (ia)) % b == 0:\r\n print(\"Yes\")\r\n return 0\r\n i+=1\r\n print(\"No\")\r\na,b,c=map(int,input().split())\r\nsolution(a,b,c)\r\n", "def gcd(a,b):\r\n if b==0:\r\n return (a,1,0)\r\n g,x0,y0 = gcd(b,a%b)\r\n x = y0\r\n y = x0 - (a//b)y0\r\n return (g,x,y)\r\n\r\ndef findanysolution(a,b,c):\r\n g,x,y = gcd(abs(a),abs(b))\r\n if c%g != 0:\r\n return False\r\n x = (c//g)\r\n y = (c//g)\r\n if a<0:\r\n x = -x\r\n if b<0:\r\n y = -y\r\n return (g,x,y)\r\ndef shift(x,y,a,b,cnt):\r\n x += (cntb)\r\n y -= (cnta)\r\n return (x,y)\r\ndef war(a,b,c,minx=0,miny=0):\r\n kk = findanysolution(a,b,c)\r\n if kk==False:\r\n return \"No\"\r\n g,x,y = kk[0],kk[1],kk[2]\r\n\r\n signa = a//abs(a)\r\n signb = b//abs(b)\r\n\r\n a //= g\r\n b //= g\r\n\r\n x,y = shift(x,y,a,b,(minx-x)//b)\r\n if x<minx:\r\n x,y = shift(x,y,a,b,signb)\r\n ly = y\r\n\r\n x,y = shift(x,y,a,b,-(miny-y)//a)\r\n if y<miny:\r\n x,y = shift(x,y,a,b,-signa)\r\n lx = x\r\n\r\n \r\n if lx<0 and ly<0:\r\n return \"No\"\r\n return \"Yes\"\r\n\r\na,b,c = map(int,input().split())\r\nprint(war(a,b,c))", "import math\r\na1,b1,c=map(int,input().split())\r\nif c%math.gcd(a1,b1)!=0:print('No')\r\nelse:\r\n\ta=max(a1,b1)\r\n\tb=min(a1,b1)\r\n\tx=0\r\n\tif c%a==0:\r\n\t\tprint('Yes')\r\n\telse:\r\n\t\twhile ax<=c:\r\n\t\t\tif (c-(ax))%b==0:\r\n\t\t\t\tprint('Yes')\r\n\t\t\t\tbreak\r\n\t\t\tx+=1\r\n\t\telse:\r\n\t\t\tprint('No')", "a,b,c=map(int,input().split())\r\nf=0\r\nfor i in range(10001):\r\n n=c-ia\r\n if(n>=0 and n//b==n/b):\r\n f=1\r\n break\r\nif(f==1):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n \r\n \r\n", "from math import gcd\r\na, b, c = input().split()\r\na, b, c = int(a), int(b), int(c)\r\nx = 0\r\n\r\nwhile a * x <= c:\r\n y = c - a * x\r\n if y % b == 0:\r\n print(\"Yes\")\r\n exit(0)\r\n else:\r\n x += 1\r\n continue\r\nprint(\"No\")\r\n", "ebony, ivory, total = map(int, input().split())\r\npossible, total2 = False, total\r\n\r\nwhile total > 0 or total2 > 0:\r\n if total > 0:\r\n if total % ivory == 0:\r\n possible = True\r\n break\r\n else:\r\n total -= ebony\r\n\r\n if total2 > 0:\r\n if total2 % ebony == 0:\r\n possible = True\r\n break\r\n else:\r\n total2 -= ivory\r\n\r\nif possible:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "n,m,c=map(int,input().split())\r\ndef gcd(n,m):\r\n if m==0:\r\n return n\r\n else:\r\n return gcd(m,n%m)\r\nif c%gcd(n,m)==0:\r\n f=0\r\n x=c//n\r\n while x>=0:\r\n if (c-xn)%m==0:\r\n f=1\r\n break\r\n else:\r\n x-=1\r\n if f==1:\r\n print('Yes')\r\n else:\r\n print('No') \r\n \r\nelse:\r\n print('No') ", "a, b, c = map(int, input().split())\r\n\r\ndef extGCD(a, b):\r\n if b == 0:\r\n return a, 1, 0\r\n d, x1, y1 = extGCD(b, a%b)\r\n\r\n x = y1\r\n y = x1 - y1 (a//b)\r\n return d, x, y\r\n\r\ndef find_any_solution(a, b, c):\r\n g, x0, y0 = extGCD(abs(a), abs(b))\r\n if c % g != 0:\r\n return False, 0, 0, 0\r\n x0 = c // g\r\n y0 = c // g\r\n if a < 0:\r\n x0 = -1\r\n if b < 0:\r\n y0 = -1\r\n return True, g, x0, y0\r\n\r\ndef shift_solution(x, y, a, b, cnt):\r\n x += cnt * b\r\n y -= cnt * a\r\n return x, y\r\n \r\n\r\ndef find_all_solutions(a, b, c, min_x, max_x, min_y, max_y):\r\n find, g, x, y = find_any_solution(a, b, c)\r\n if not find:\r\n return 0\r\n a //= g\r\n b //= g\r\n sign_a = 1 if a > 0 else -1\r\n sign_b = 1 if b > 0 else -1\r\n\r\n x, y = shift_solution(x, y, a, b, (min_x - x) // b)\r\n if x < min_x:\r\n x, y = shift_solution(x, y, a, b, sign_b)\r\n if x > max_x:\r\n return 0\r\n lx1 = x\r\n\r\n x, y = shift_solution(x, y, a, b, (max_x - x) // b)\r\n if x > max_x:\r\n x, y = shift_solution(x, y, a, b, -sign_b)\r\n rx1 = x\r\n\r\n x, y = shift_solution(x, y, a, b, -(min_y - y) // a)\r\n if y < min_y:\r\n x, y = shift_solution(x, y, a, b, -sign_a)\r\n if y > max_y:\r\n return 0\r\n lx2 = x\r\n\r\n x, y = shift_solution(x, y, a, b, -(max_y - y) // a)\r\n if y > max_y:\r\n x, y = shift_solution(x, y, a, b, sign_a)\r\n rx2 = x\r\n if lx2 > rx2:\r\n lx2, rx2 = rx2, lx2\r\n lx = max(lx1, lx2)\r\n rx = min(rx1, rx2)\r\n\r\n return (rx - lx) // abs(b) + 1\r\n\r\nans = find_all_solutions(a, b, c, 0, 10000, 0, 10000)\r\nif ans:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "[a,b,c]=[int(x) for x in input().split()]\r\nfor i in range(c//a+1):\r\n d=ai\r\n if (c-d)%b==0:\r\n print(\"Yes\")\r\n exit(0)\r\nprint(\"No\")\r\n", "#!/usr/bin/env python3\nimport itertools, functools, math\n\ndef solve():\n a, b, c = map(int, input().split())\n i = 0\n while ia <= c:\n damage_a = i*a\n damage_b = c - damage_a\n if damage_b == 0 or damage_b%b == 0:\n return 'Yes'\n i += 1\n return 'No'\n\n\nif __name__ == '__main__':\n print(solve())\n\n", "a,b,c=map(int,input().split())\r\nif c%a==0 or c%b==0:\r\n print(\"Yes\")\r\nelse:\r\n m=False\r\n while c>min(a,b):\r\n c-=min(a,b)\r\n if c%a==0 or c%b==0:\r\n m=True\r\n break\r\n if m:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n " ]	{"inputs": ["4 6 15", "3 2 7", "6 11 6", "3 12 15", "5 5 10", "6 6 7", "1 1 20", "12 14 19", "15 12 26", "2 4 8", "4 5 30", "4 5 48", "2 17 105", "10 25 282", "6 34 323", "2 47 464", "4 53 113", "6 64 546", "1 78 725", "1 84 811", "3 100 441", "20 5 57", "14 19 143", "17 23 248", "11 34 383", "20 47 568", "16 58 410", "11 70 1199", "16 78 712", "20 84 562", "19 100 836", "23 10 58", "25 17 448", "22 24 866", "24 35 67", "29 47 264", "23 56 45", "25 66 1183", "21 71 657", "29 81 629", "23 95 2226", "32 4 62", "37 15 789", "39 24 999", "38 32 865", "32 50 205", "31 57 1362", "38 68 1870", "36 76 549", "35 84 1257", "39 92 2753", "44 1 287", "42 12 830", "42 27 9", "49 40 1422", "44 42 2005", "50 55 2479", "48 65 917", "45 78 152", "43 90 4096", "43 94 4316", "60 7 526", "53 11 735", "52 27 609", "57 32 992", "52 49 421", "57 52 2634", "54 67 3181", "52 73 638", "57 84 3470", "52 100 5582", "62 1 501", "63 17 858", "70 24 1784", "65 32 1391", "62 50 2775", "62 58 88", "66 68 3112", "61 71 1643", "69 81 3880", "63 100 1960", "73 6 431", "75 19 736", "78 25 247", "79 36 2854", "80 43 1864", "76 55 2196", "76 69 4122", "76 76 4905", "75 89 3056", "73 100 3111", "84 9 530", "82 18 633", "85 29 2533", "89 38 2879", "89 49 2200", "88 60 4140", "82 68 1299", "90 76 2207", "83 84 4923", "89 99 7969", "94 9 168", "91 20 1009", "93 23 2872", "97 31 3761", "99 46 1341", "98 51 2845", "93 66 3412", "95 76 3724", "91 87 6237", "98 97 7886", "12 17 15", "93 94 95", "27 43 27", "17 43 68", "44 12 12", "44 50 150", "1 1 10000", "2 3 10000", "100 1 10", "3 2 1", "1 1 1", "9 9 10000", "2 3 9995", "3 5 4", "99 98 100", "6 10 2", "1 6 5", "1 4 3", "3 2 3", "1 7 6", "2 3 9871", "10 5 5", "10 8 2"], "outputs": ["No", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "No", "No", "Yes", "Yes", "Yes", "Yes", "No", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "No", "No", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "No", "Yes", "Yes", "No", "Yes", "No", "Yes", "Yes", "No", "Yes", "No", "Yes", "Yes", "No", "No", "Yes", "Yes", "No", "No", "Yes", "Yes", "No", "No", "No", "No", "No", "No", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "Yes", "No", "No", "No", "Yes", "Yes", "Yes", "Yes", "No", "No", "Yes", "No", "No", "Yes", "Yes", "Yes", "No", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "Yes", "No", "No", "Yes", "Yes", "Yes", "Yes", "No", "No", "Yes", "Yes", "No", "No", "Yes", "Yes", "Yes", "No", "No", "Yes", "Yes", "Yes", "No", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "No", "Yes", "No", "No", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "No"]}	UNKNOWN	PYTHON3	CODEFORCES	192
8f150d098d84cde9f7d73b00f0091443	none	Astronaut Natasha arrived on Mars. She knows that the Martians are very poor aliens. To ensure a better life for the Mars citizens, their emperor decided to take tax from every tourist who visited the planet. Natasha is the inhabitant of Earth, therefore she had to pay the tax to enter the territory of Mars. There are $n$ banknote denominations on Mars: the value of $i$-th banknote is $a_i$. Natasha has an infinite number of banknotes of each denomination. Martians have $k$ fingers on their hands, so they use a number system with base $k$. In addition, the Martians consider the digit $d$ (in the number system with base $k$) divine. Thus, if the last digit in Natasha's tax amount written in the number system with the base $k$ is $d$, the Martians will be happy. Unfortunately, Natasha does not know the Martians' divine digit yet. Determine for which values $d$ Natasha can make the Martians happy. Natasha can use only her banknotes. Martians don't give her change. The first line contains two integers $n$ and $k$ ($1 \le n \le 100\,000$, $2 \le k \le 100\,000$) — the number of denominations of banknotes and the base of the number system on Mars. The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 10^9$) — denominations of banknotes on Mars. All numbers are given in decimal notation. On the first line output the number of values $d$ for which Natasha can make the Martians happy. In the second line, output all these values in increasing order. Print all numbers in decimal notation. Sample Input 2 8 12 20 3 10 10 20 30 Sample Output 2 0 4 1 0	[ "from functools import reduce\r\nfrom math import gcd\r\nn, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nG = gcd(k, reduce(lambda x,y:gcd(x,y),A))\r\nprint(k // G)\r\nprint(list(range(0, k, G)))", "n,k=map(int,input().split())\ng=lambda x:int(x)%k\na=list(map(g,input().split()))\ndef nod(a,b):\n while b>0:\n a%=b\n a,b=b,a\n return a\nc=k\nfor x in a:\n if x!=0:\n c=nod(c,x)\nprint(k//c)\nprint(' '.join(map(str,list(range(0,k,c)))))\n\n\t \t \t\t \t\t \t\t\t\t\t \t\t \t\t", "from math import gcd\r\n\r\ndef MinimumGCD(arr, n):\r\n\tg = 0\r\n\tfor i in range(n):\r\n\t\tg = gcd(g, arr[i])\r\n\treturn g\r\n\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tarr[i]=arr[i]%k\r\nt=k+1\r\nfor i in range(n):\r\n\tt=min(t,gcd(k,arr[i]))\r\nt1= MinimumGCD(arr, n)\r\nt1= gcd(t1%k,k)\r\nf=min(t,t1)\r\nc=[0]k\r\np=f%k\r\nwhile(c[p]==0):\r\n\tc[p]=1\r\n\tp=(p+f)%k\r\nprint(c.count(1))\r\nfor i in range(k):\r\n\tif(c[i]):\r\n\t\tprint(i,end=\" \")", "def gcd(a,b):\r\n return a if 0==b else gcd(b,a%b)\r\n\r\n\r\n\r\nn,k=map(int,input().split(\" \"))\r\n#print(k)\r\nden=list(map(int,input().split(\" \")))\r\ng=0\r\nfor i in den:\r\n g=gcd(g,i)\r\n\r\nd=[]\r\ndic={}\r\ni=0\r\nwhile (i<k):\r\n val=(ig)%k\r\n #print(\"Value=\"+str(val))\r\n if(not val in dic):\r\n d.append(val)\r\n dic[val]=1\r\n i=i+1\r\n else:\r\n i=i+1\r\n continue\r\nprint(len(d))\r\nd.sort()\r\nfor val in d:\r\n print(val,end=\" \")\r\n", "from math import gcd\nn, k = map(int, input().split())\na = list(map(int, input().split()))\ng = 0\nfor i in a:\n g = gcd(g, i)\nans = set()\nans.add(g % k)\nfor i in range(k):\n ans.add((i g) % k)\nprint(len(ans))\nprint(sorted(list(ans)))\n\n \t\t\t\t \t\t\t\t \t \t\t \t\t \t \t", "from math import gcd\r\nn, k = map(int, input().split())\r\na = set([int(x) % k for x in input().split()])\r\nans = k\r\nfor elem in a:\r\n ans = gcd(ans, elem)\r\nprint(k // ans)\r\nprint(list(range(0, k, ans)))", "from bisect import bisect\r\nfrom collections import defaultdict\r\n# l = list(map(int,input().split()))\r\n# map(int,input().split()))\r\nfrom math import gcd,sqrt,ceil,inf\r\nfrom collections import Counter\r\nimport sys\r\nsys.setrecursionlimit(1000000)\r\nfrom bisect import bisect\r\nfrom collections import defaultdict\r\n# l = list(map(int,input().split()))\r\n# map(int,input().split()))\r\nfrom math import gcd,sqrt,ceil,inf,factorial,log2\r\nfrom collections import Counter\r\nimport sys\r\nsys.setrecursionlimit(10*9)\r\n\r\n\r\nn,k = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\n\r\ng = 0\r\n\r\nfor i in l:\r\n g = gcd(i,g)\r\nseti = set()\r\nfor i in range(k+1):\r\n ka = (gi)%k\r\n seti.add(ka)\r\nprint(len(seti))\r\nfor i in sorted(seti):\r\n print(i,end= ' ')\r\n\r\n\r\n", "from functools import reduce\r\ndef gcd(x,y):\r\n if x == 0:\r\n return y\r\n elif y == 0:\r\n return x\r\n if x > y:\r\n return gcd(x%y,y)\r\n elif x < y:\r\n return gcd(x,y%x)\r\n else:\r\n return x\r\n\r\n\r\ndef main():\r\n [n,k]=list(map(int,input().split(\" \")))\r\n a = list(map(int,input().split(\" \")))\r\n gcd1 = reduce(gcd,a+[k])\r\n print(int(k/gcd1))\r\n print(\" \".join([str(gcd1x) for x in range(int(k/gcd1))]))\r\n\r\nmain()", "import os,io,math\r\ninput=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nr=k\r\nfor i in range(n):\r\n r=math.gcd(r,a[i])\r\nans=[]\r\nfor i in range(0,k,r):\r\n ans.append(i)\r\nprint(len(ans))\r\nprint(' '.join(map(str,ans)))", "import math\r\ni=lambda:map(int,input().split())\r\nn,k=i()\r\ng=k\r\nfor a in i():g=math.gcd(g,a)\r\nprint(k//g)\r\nprint(range(0,k,g))", "n,k=map(int,input().split())\r\n#the number of denominations of banknotes and the base of the number system on Mars.\r\nB=list(map(int,input().split()))\r\n#denominations of banknotes on Mars.\r\n\r\ndef gcd(a, b):\r\n\twhile b:\r\n\t\ta, b = b, a % b\r\n\treturn a\r\n\r\nallgcd=k\r\n\r\nfor i in range(n):\r\n allgcd=gcd(allgcd,B[i])\r\n\r\n\r\nx=k//allgcd\r\nprint(x)\r\n\r\nANS=[None]x\r\nfor i in range(x):\r\n ANS[i]=allgcdi\r\n\r\nfor i in range(x-1):\r\n print(ANS[i],end=\" \")\r\n\r\nprint(ANS[x-1])\r\n \r\n", "from math import gcd\nfrom functools import reduce\n\n\ndef main():\n n, k = map(int, input().split())\n g = reduce(gcd, map(int, input().split()), k)\n print(k // g, ' '.join(map(str, range(0, k, g))), sep='\\n')\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\nn,k=map(int,input().split())\r\ng=k\r\nfor a in map(int,input().split()):\r\n g=math.gcd(g,a)\r\nprint(k//g)\r\nprint(range(0,k,g))", "def gcd(x,y):\r\n if x == 0:\r\n return y\r\n elif y == 0:\r\n return x\r\n if x > y:\r\n return gcd(x%y,y)\r\n elif x < y:\r\n return gcd(x,y%x)\r\n else:\r\n return x\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nflag1=0\r\nans1=k\r\ni=0\r\nwhile(i<n):\r\n ans1=gcd(arr[i]%k,ans1)\r\n i+=1\r\narr1=[0]\r\nans=ans1\r\nif(ans==k):\r\n print(1)\r\n print(0)\r\nelse:\r\n while(ans1<k):\r\n arr1.append(ans1)\r\n ans1+=ans\r\n print(len(arr1))\r\n print(arr1)", "def gcd(a, b):\n while b != 0:\n a, b = b, a % b\n return a\n\nn, k = map(int, input().split(' '))\naa = list(map(int, input().split(' ')))\n\nm = k\nfor a in aa:\n m = gcd(m, a)\n\nprint(k // m)\nfor i in range(0, k, m):\n print(i, end=' ')\nprint()\n", "def gcd(a, b):\n\tif (a < b):\n\t\ta, b = b, a\n\tif (b == 0):\n\t\treturn a\n\treturn gcd(b, a % b)\n\n\nn, k = map(int, input().split())\nl = list(map(int, input().split()))\ngcdd = k\nfor i in range(n):\n\tgcdd = gcd(gcdd, l[i])\nif (gcdd == 0):\n\tprint(1)\n\tprint(0)\nelse:\n\tprint(k // gcdd)\n\tans = []\n\tfor i in range(1, k // gcdd + 1):\n\t\tans.append((i * gcdd) % k)\nprint(' '.join(map(str, sorted(ans))))\n\n \t \t\t \t\t \t\t\t\t\t\t \t\t \t \t", "import sys,math\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\nn,k=invr()\r\nnote=inara()\r\ng=k\r\nfor taka in note:\r\n\tg=math.gcd(g,taka)\r\n\r\nkhushi=[]\r\nfor i in range(0,k,g):\r\n\tkhushi.append(i)\r\n\r\nprint(len(khushi))\r\nprint(khushi)\r\n", "from math import gcd\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na_ = [el % k for el in a]\r\n\r\ng = gcd(k, a_[0])\r\nfor i in range(1, n):\r\n g = gcd(g, a_[i])\r\n\r\nprint(k // g)\r\nprint(' '.join(map(str, [g i for i in range(k // g)])))\r\n", "from math import gcd\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ngd=0\r\nfor i in range(n):\r\n gd=gcd(gd,arr[i])\r\ncount=gd\r\ns=set()\r\nfor i in range(k):\r\n s.add(count %k)\r\n count +=gd\r\ns=list(s)\r\ns.sort()\r\nprint(len(s))\r\nprint(s)", "from math import \r\nfrom collections import \r\nimport sys\r\nsys.setrecursionlimit(109)\r\n\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ng = a[0]%k\r\nfor i in range(1,n):\r\n\tg = gcd(g,a[i]%k)\r\nans = [g]\r\nx = (g+g)%k\r\nwhile(x != g):\r\n\tans.append(x)\r\n\tx += g\r\n\tx %= k\r\nprint(len(ans))\r\nans.sort()\r\nfor i in ans:\r\n\tprint(i,end = \" \")\r\nprint()", "import sys\r\nimport math\r\nfrom collections import defaultdict\r\nn,k=map(int,sys.stdin.readline().split())\r\na=list(map(int,sys.stdin.readline().split()))\r\nl=[0 for _ in range(n)]\r\nfor i in range(n):\r\n l[i]=a[i]%k\r\nans=set()\r\nans.add(0)\r\nvis=defaultdict(int)\r\nx=0\r\nfor i in range(n):\r\n x=math.gcd(x,l[i])\r\nst=0\r\nx=math.gcd(x,k)\r\nwhile stx<k and x!=0:\r\n ans.add(stx)\r\n st+=1\r\nprint(len(ans))\r\nres=list(ans)\r\nres.sort()\r\nprint(res)\r\n", "n, k = map(int,input().split())\r\nv = list(map(int,input().split()))\r\n\r\ndef gcd(a,b):\r\n\tif a < b:\r\n\t\treturn gcd(b,a)\r\n\tif b == 0:\r\n\t\treturn a\r\n\telse:\r\n\t\treturn gcd(b, a%b) \r\n\r\ng = v[0]\r\nfor i in range(1,n):\r\n\tg = gcd(g, v[i])\r\n\r\nlst = set()\r\nfor i in range(k):\r\n\tlst.add(gi % k)\r\n\r\nlst = sorted(list(lst))\r\nprint(len(lst))\r\nprint(' '.join(map(str,lst)))", "def nod(a,b):\r\n while a!=0 and b!=0:\r\n if a>b:\r\n a,b=b,a%b\r\n else:\r\n b,a=a,b%a\r\n return a+b\r\nn ,k = map(int, input().split()) \r\na = [int(j) for j in input().split()] \r\nc = a[0]\r\nfor i in range(1,n):\r\n c = nod(c,a[i])\r\n if c==1:\r\n break\r\ne = nod(c,k)\r\nif c==1 or e==1:\r\n print(k)\r\n for i in range(k):\r\n print(i, end=\" \")\r\n\r\nif e>1:\r\n c = k//e\r\n print(c)\r\n for i in range(c):\r\n print(ie, end=' ')\r\n \r\n \r\n \r\n", "from math import gcd\r\n\r\nn, k = map(int, input().split()) # leemos los enteros n y k\r\n # que representan el numero de denominaciones de los billetes y la base del sistema numerico en marte\r\nA = list(map(int, input().split())) # leemos los n enteros que representan las denominaciones de los billetes\r\n\r\ng = 0 # variable donde guardaremos el gcd de las denominaciones de los billetes\r\nfor ai in A: # recorremos todas las denominaciones de los billetes\r\n g = gcd(g, ai) # hallamos el gcd de los ai\r\n\r\ns = set() # creamos un set para almacenar los valores \"d\"\r\nx = 0 # variable para ir calculando los valores \"d\"\r\nwhile x < k:\r\n d = (gx) % k # caculamos el valor \"d\"\r\n #if d not in s: # verificamos si el \"d\" calculado no se ha calculado anteriormente\r\n s.add(d) # se añade el valor \"d\" al set\r\n #else: # si el de \"d\" calculado ya se calculo anteriormente, salimos del while ya que se han calculado todos los valores \"d\"\r\n # break\r\n x += 1 # aumentamos el valor de x para calcular el proximo \"d\"\r\n\r\nprint(len(s)) # se imprime la cantida de valores \"d\"\r\nprint(sorted(s)) # se imprime todos los valores \"d\"\r\n", "def gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\nn, k = map(int, input().split())\r\na = list(set([int(i) % k for i in input().split()]))\r\nres = k\r\nfor i in a:\r\n res = gcd(res, i)\r\nprint(k // res)\r\nprint(list(range(0, k, res)))", "from math import gcd\r\nfrom functools import reduce\r\n\r\nn, k = [int(aa) for aa in input().split()]\r\na = [int(aa) for aa in input().split()]\r\ng = reduce(gcd, a)%k\r\nansw = [0] k\r\n\r\npos = g\r\ncount = 0\r\nwhile answ[pos]==0:\r\n answ[pos]=1\r\n pos = (pos+g)%k\r\n count+=1\r\n\r\nprint(count)\r\nfor i in range(len(answ)):\r\n if answ[i]==1:\r\n print(i, end=' ')\r\n", "import math\r\nfrom functools import reduce\r\na,b = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nd = c[0]\r\nfor j in range(a):\r\n d = math.gcd(d,c[j])\r\n if d == 1:\r\n break\r\ne = math.gcd(d,b)\r\nprint(b//e)\r\n#f = [i for i in range(b) if i%e == 0]\r\n#g = \" \".join(str(k) for k in range(b) if k%e == 0)\r\nprint(\" \".join(str(k) for k in range(b) if k%e == 0))", "from functools import reduce\nfrom math import gcd\n\n_, k = map(int, input().split())\ng = reduce(gcd, [k] + list(map(int, input().split())))\nprint(k // g)\nprint(\" \".join(str(l) for l in range(0, k, g)))", "def gcd(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 gcd(b,a%b)\r\n \r\n \r\nn,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n a[i]=a[i]%k\r\na.append(k)\r\nb=0\r\nfor i in range(n+1):\r\n b=gcd(b,a[i])\r\nc=[]\r\nfor i in range(0,k,b):\r\n c.append(i)\r\n\r\nprint(len(c))\r\nprint(c)", "def 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(A, k):\r\n g = k\r\n for x in A:\r\n g = gcd(x, g)\r\n return [ig for i in range(k//g)]\r\n\r\nn, k = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nanswer = process(A, k)\r\nprint(len(answer))\r\nprint(' '.join(map(str, answer)))", "from math import gcd\r\nn,k=map(int,input().split())\r\ng=0\r\nl=list(map(int,input().split()))\r\nfor e in l:\r\n g=gcd(g,gcd(e,k))\r\nprint(k//g)\r\nfor i in range(0,k,g): print(i,end=' ')", "from functools import reduce\r\nfrom math import ceil, floor\r\n\r\n\r\ndef gcd(x, y):\r\n \"\"\"greatest common divisor of x and y\"\"\"\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n\r\n\r\ndef extended_gcd(a, b):\r\n \"\"\"returns gcd(a, b), s, r s.t. a * s + b * r == gcd(a, b)\"\"\"\r\n s, old_s = 0, 1\r\n r, old_r = b, a\r\n while r:\r\n q = old_r // r\r\n old_r, r = r, old_r - q * r\r\n old_s, s = s, old_s - q * s\r\n return old_r, old_s, (old_r - old_s * a) // b if b else 0\r\n\r\n\r\ngcdm = lambda args: reduce(gcd, args, 0)\r\n\r\nlcm = lambda a, b: a * b // gcd(a, b)\r\n\r\nlcmm = lambda args: reduce(lcm, args, 1)\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n g = gcdm(a + [k])\r\n\r\n print(k // g)\r\n print(\" \".join([str(x g) for x in range(k // g)]))\r\n\r\n\r\nmain()\r\n\r\n# sum(ai xi) - kl = d\r\n\r\n# ž g <= k\r\n", "#!/usr/bin/python3\r\nimport sys\r\nfrom math import gcd\r\nN, k = [int(x) for x in input().split()]\r\nsk = [int(x) for x in input().split()]\r\n\r\ndbd = 0\r\nfor i in sk:\r\n\tdbd = gcd(dbd, i)\r\n\r\nats = set()\r\nfor i in range(k):\r\n\tats.add((idbd)%k)\r\n\r\nprint(len(ats))\r\n\r\nats2 = sorted(ats)\r\nfor i in ats2:\r\n\tprint(i, end=' ')", "import math\r\nn,k = [int(i) for i in input().split()]\r\ng = 0\r\nfor i in input().split():\r\n g = math.gcd(g,int(i))\r\nx = g%k\r\nA = [0]k\r\nwhile(A[x]==0):\r\n A[x] = 1\r\n x = (x+g)%k\r\nB = []\r\nfor i in range(0,k):\r\n if(A[i]==1): B.append(i)\r\nprint(len(B))\r\nprint(B,sep=' ')", "def gcd(a,b):\r\n if b == 0:\r\n return a\r\n return gcd(b,a%b)\r\nn,k=map(int, input().split())\r\na=[int(v) for v in input().split()]\r\nf=[0]100010\r\ng=0\r\nfor i in a:\r\n g=gcd(g,i%k)\r\ns = 0\r\nfor i in range(k):\r\n f[s%k] = 1\r\n s = s + g\r\nprint(sum(f))\r\nfor i in range(k):\r\n if f[i]:\r\n print(i, end=' ')" ]	{"inputs": ["2 8\n12 20", "3 10\n10 20 30", "5 10\n20 16 4 16 2", "10 5\n4 6 8 6 4 10 2 10 8 6", "20 25\n15 10 5 20 10 5 15 5 15 10 15 5 5 5 5 10 15 20 20 20", "30 30\n11 23 7 30 13 6 25 29 1 15 20 5 28 15 19 22 21 5 27 25 29 10 1 4 12 19 1 5 8 10", "40 30\n16 12 12 22 18 28 32 24 36 26 12 30 22 16 32 30 36 18 20 16 12 24 28 20 16 28 8 34 18 18 18 4 4 36 18 10 30 38 18 10", "50 30\n15 9 21 39 42 39 3 42 42 39 6 48 39 30 12 39 27 45 30 48 18 33 18 36 27 3 48 12 36 27 15 12 42 39 18 21 48 39 15 42 24 36 33 48 6 48 15 12 30 18", "1 10\n1", "1 2\n1", "60 30\n10 30 45 15 25 60 10 40 35 25 5 40 35 40 15 5 15 35 10 60 25 15 60 10 30 10 5 25 10 15 60 20 30 5 50 50 40 20 55 40 35 15 15 10 60 40 50 50 30 15 25 45 35 40 15 5 5 20 60 45", "70 30\n54 30 12 48 42 24 42 60 54 6 36 42 54 66 12 48 54 42 24 54 30 18 30 54 18 60 24 30 54 48 48 60 18 60 60 66 54 18 54 30 24 30 60 54 36 36 60 48 12 60 6 60 42 66 6 42 18 60 54 48 42 18 48 66 18 42 48 30 12 66", "80 30\n30 80 40 40 60 60 40 80 70 80 30 30 60 80 30 70 60 10 10 30 70 60 70 20 40 20 30 10 60 70 70 50 60 70 70 30 70 60 60 70 20 60 10 60 70 80 20 30 30 20 60 50 40 40 80 70 70 20 40 80 30 50 40 10 40 20 70 10 80 10 50 40 50 70 40 80 10 40 60 60", "90 30\n90 45 75 75 90 90 45 30 90 15 45 90 15 30 45 60 30 15 30 45 45 45 45 15 45 60 15 60 45 75 45 75 90 60 30 15 60 30 90 75 15 60 15 30 45 30 45 15 30 15 45 30 15 75 90 15 45 15 75 15 75 30 75 45 60 75 15 45 30 75 45 90 45 60 90 45 75 30 30 30 15 15 75 60 75 90 75 60 90 45", "100 30\n30 30 30 90 30 30 90 90 30 90 30 90 90 30 30 30 60 60 60 30 30 60 90 90 90 60 30 90 60 60 90 60 60 60 30 60 60 60 60 90 60 30 60 90 90 90 60 60 90 60 60 60 60 30 30 60 30 60 60 90 30 60 60 60 90 60 90 30 30 60 30 90 90 90 90 60 90 30 30 60 60 30 60 60 60 30 90 60 60 60 90 60 30 90 60 30 30 60 90 90", "1 10\n2", "1 10\n3", "5 2\n1 1 1 1 1", "2 30\n6 10", "1 10\n10", "1 10\n20", "1 2\n1000000000", "2 6\n2 3", "1 5\n4", "2 5\n2 4", "3 30\n6 10 15", "2 7\n3 6", "2 15\n3 5", "2 12\n4 6", "2 10\n3 6", "2 100000\n2 4", "1 14\n4", "1 13\n5", "2 420\n412 363", "2 30\n10 6", "1 5\n3", "1 8\n6", "3 10\n6 6 6", "1 7\n6", "1 9\n6", "2 10\n7 7", "1 8\n5", "2 50\n3 15", "1 6\n4", "1 7\n4", "1 10\n7", "1 3\n2", "2 10\n2 5", "2 50\n15 3", "1 5\n2", "2 10\n6 5", "2 35\n5 7", "2 300\n3 10", "1 100000\n47", "2 54\n6 9"], "outputs": ["2\n0 4 ", "1\n0 ", "5\n0 2 4 6 8 ", "5\n0 1 2 3 4 ", "5\n0 5 10 15 20 ", "30\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ", "15\n0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 ", "10\n0 3 6 9 12 15 18 21 24 27 ", "10\n0 1 2 3 4 5 6 7 8 9 ", "2\n0 1 ", "6\n0 5 10 15 20 25 ", "5\n0 6 12 18 24 ", "3\n0 10 20 ", "2\n0 15 ", "1\n0 ", "5\n0 2 4 6 8 ", "10\n0 1 2 3 4 5 6 7 8 9 ", "2\n0 1 ", "15\n0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 ", "1\n0 ", "1\n0 ", "1\n0 ", "6\n0 1 2 3 4 5 ", "5\n0 1 2 3 4 ", "5\n0 1 2 3 4 ", "30\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ", "7\n0 1 2 3 4 5 6 ", "15\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ", "6\n0 2 4 6 8 10 ", "10\n0 1 2 3 4 5 6 7 8 9 ", "50000\n0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 72 74 76 78 80 82 84 86 88 90 92 94 96 98 100 102 104 106 108 110 112 114 116 118 120 122 124 126 128 130 132 134 136 138 140 142 144 146 148 150 152 154 156 158 160 162 164 166 168 170 172 174 176 178 180 182 184 186 188 190 192 194 196 198 200 202 204 206 208 210 212 214 216 218 220 222 224 226 228 230 232 234 236 238 240 242 244 246 248 250 252 254 256 258 260 262 264 266 268 270 272 274 276 278...", "7\n0 2 4 6 8 10 12 ", "13\n0 1 2 3 4 5 6 7 8 9 10 11 12 ", "420\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 ...", "15\n0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 ", "5\n0 1 2 3 4 ", "4\n0 2 4 6 ", "5\n0 2 4 6 8 ", "7\n0 1 2 3 4 5 6 ", "3\n0 3 6 ", "10\n0 1 2 3 4 5 6 7 8 9 ", "8\n0 1 2 3 4 5 6 7 ", "50\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 ", "3\n0 2 4 ", "7\n0 1 2 3 4 5 6 ", "10\n0 1 2 3 4 5 6 7 8 9 ", "3\n0 1 2 ", "10\n0 1 2 3 4 5 6 7 8 9 ", "50\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 ", "5\n0 1 2 3 4 ", "10\n0 1 2 3 4 5 6 7 8 9 ", "35\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 ", "300\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 ...", "100000\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 1...", "18\n0 3 6 9 12 15 18 21 24 27 30 33 36 39 42 45 48 51 "]}	UNKNOWN	PYTHON3	CODEFORCES	35
8f1d925cbfe50cd21d804490a288b86a	Memory and Scores	Memory and his friend Lexa are competing to get higher score in one popular computer game. Memory starts with score a and Lexa starts with score b. In a single turn, both Memory and Lexa get some integer in the range [<=-<=k;k] (i.e. one integer among <=-<=k,<=<=-<=k<=+<=1,<=<=-<=k<=+<=2,<=...,<=<=-<=2,<=<=-<=1,<=0,<=1,<=2,<=...,<=k<=-<=1,<=k) and add them to their current scores. The game has exactly t turns. Memory and Lexa, however, are not good at this game, so they both always get a random integer at their turn. Memory wonders how many possible games exist such that he ends with a strictly higher score than Lexa. Two games are considered to be different if in at least one turn at least one player gets different score. There are (2k<=+<=1)2t games in total. Since the answer can be very large, you should print it modulo 109<=+<=7. Please solve this problem for Memory. The first and only line of input contains the four integers a, b, k, and t (1<=≤<=a,<=b<=≤<=100, 1<=≤<=k<=≤<=1000, 1<=≤<=t<=≤<=100) — the amount Memory and Lexa start with, the number k, and the number of turns respectively. Print the number of possible games satisfying the conditions modulo 1<=000<=000<=007 (109<=+<=7) in one line. Sample Input 1 2 2 1 1 1 1 2 2 12 3 1 Sample Output 6 31 0	[ "def c(n, k):\n\tif k > n:\n\t\treturn 0\n\ta = b = 1\n\tfor i in range(n - k + 1, n + 1):\n\t\ta = i\n\tfor i in range(1, k + 1):\n\t\tb = i\n\treturn a // b\na, b, k, t = map(int, input().split())\nn, m, s = 2 * k + 1, 2 * t, 2 * k * t + b - a\nans, mod = 0, 1000000007\nfor i in range(m + 1):\n\tans = (ans + [1, -1][i & 1] * c(m, i) * c(m + s - n * i, m)) % mod\nprint((pow(n, m, mod) - ans) % mod)\n \t \t \t \t \t\t\t\t\t\t \t\t \t", "mod=10*9+7\r\nf=[0]500000\r\n\r\ndef POW(a,b):\r\n\tif(b==0):\r\n\t\treturn 1\r\n\tif(b&1):\r\n\t\treturn POW(a,b//2)*2a%mod\r\n\telse:\r\n\t\treturn POW(a,b//2)*2\r\n\r\ndef C(n,m):\r\n\tif(m>n):\r\n\t\treturn 0\r\n\tt=f[n]POW(f[m],mod-2)%modPOW(f[n-m],mod-2)%mod\r\n\treturn t\r\n\r\n\r\nf[0]=1\r\nfor i in range(1,500000):\r\n\tf[i]=f[i-1]i%mod\r\na,b,k,t=map(int,input().split(' '))\r\n\r\nans=0\r\nfor i in range(0,2t+1):\r\n\tt1=POW(-1,i)C(2t,i)%mod\r\n\tt2=(C(210000+2kt-a+b+2t-1-(2k+1)i+1,2t)-C(1+2kt-a+b+2t-1-(2k+1)i,2t))%mod\r\n\tans=(ans+t1t2)%mod\r\nprint(ans)\r\n", "A, B, K, T = map(int, input().split())\r\n\r\ndef count_scenarios(A, B, K, T):\r\n mod = 10*9 + 7\r\n K = 2\r\n a = [[0] * 250005 for _ in range(2)]\r\n pre = 0\r\n now = 1\r\n a[0][1] = 1\r\n for i in range(T):\r\n sum1 = 0\r\n sum2 = 0\r\n for j in range(1, K * (i + 1) + 2):\r\n sum1 += a[pre][j]\r\n sum2 += a[pre][max(0, j - K - 1)]\r\n sum1 %= mod\r\n sum2 %= mod\r\n a[now][j] = sum1 - sum2\r\n a[now][j] = (a[now][j] % mod + mod) % mod\r\n now, pre = pre, now\r\n t = A - B - 1\r\n ans = 0\r\n sum1 = 0\r\n for i in range(1, t + 1):\r\n sum1 += a[pre][i]\r\n sum1 %= mod\r\n for i in range(1, K * T + 2):\r\n sum1 += a[pre][max(0, i - (B - A + 1))]\r\n sum1 %= mod\r\n ans = (ans + sum1 * a[pre][i]) % mod\r\n return ans\r\nprint(count_scenarios(A, B, K, T))# 1690888180.0879874", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b, k, t = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\ndp = [1]\r\nfor _ in range(t):\r\n dp0 = dp + [0] * (2 * k)\r\n for i in range(len(dp) - 1):\r\n dp0[i + 2 * k + 1] -= dp[i]\r\n for i in range(1, len(dp0)):\r\n dp0[i] = (dp0[i] + dp0[i - 1]) % mod\r\n dp = dp0\r\ns = list(dp)\r\nl = len(dp)\r\nfor i in range(1, l):\r\n s[i] = (s[i] + s[i - 1]) % mod\r\nans = 0\r\nd = a - b - 1\r\nfor i in range(l):\r\n if i + d >= 0:\r\n ans += dp[i] * s[min(i + d, l - 1)] % mod\r\n ans %= mod\r\nans %= mod\r\nprint(ans)" ]	{"inputs": ["1 2 2 1", "1 1 1 2", "2 12 3 1", "4 6 2 1", "4 6 2 2", "6 4 2 2", "10 1 3 3", "5 3 1 1", "50 22 5 5", "6 20 1 1", "42 42 2 3", "42 42 3 2", "45 54 4 5", "6 5 4 3", "42 42 42 42", "1 100 42 42", "1 100 1000 100", "1 1 1000 100", "100 100 1000 100", "1 8 1 4", "9 4 5 2", "2 6 6 2", "7 8 5 9", "3 7 8 6", "69 69 803 81", "67 67 871 88", "71 71 891 31", "49 49 631 34", "83 83 770 49", "49 49 163 15", "38 38 701 74", "65 65 803 79", "56 56 725 64", "70 70 176 56", "32 32 44 79", "35 35 353 21", "57 57 896 52", "86 86 373 19", "27 27 296 97", "60 60 86 51", "40 40 955 95", "34 34 706 59", "74 74 791 51", "69 69 443 53", "59 19 370 48", "78 82 511 33", "66 90 805 16", "60 61 772 19", "81 13 607 21", "35 79 128 21", "93 25 958 20", "44 85 206 80", "79 99 506 18", "97 22 29 8", "14 47 184 49", "74 33 868 5", "53 79 823 11", "99 99 913 42", "52 34 89 41", "87 100 200 80", "40 94 510 53", "2 56 438 41", "6 68 958 41", "44 80 814 26", "100 1 1000 100", "1 3 1000 100", "10 10 1000 100"], "outputs": ["6", "31", "0", "3", "122", "435", "112812", "8", "876439301", "0", "6937", "1085", "433203628", "282051", "284470145", "58785421", "542673827", "922257788", "922257788", "1", "11045", "8015", "860378382", "510324293", "74925054", "123371511", "790044038", "764129060", "761730117", "458364105", "496603581", "253679300", "338598412", "990579000", "20803934", "149936279", "271910130", "940701970", "394599845", "277883413", "600387428", "274236101", "367968499", "385620893", "125206836", "375900871", "593436252", "931528755", "762608093", "177972209", "873170266", "170080402", "486170430", "471632954", "726421144", "826980486", "526626321", "446683872", "905639400", "913761305", "233079261", "500592304", "719351710", "414148151", "603336175", "604187087", "922257788"]}	UNKNOWN	PYTHON3	CODEFORCES	4
8f5411ecdb281373c50db07fac8679e9	Lefthanders and Righthanders	One fine October day a mathematics teacher Vasily Petrov went to a class and saw there n pupils who sat at the desks, two people at each desk. Vasily quickly realized that number n is even. Like all true mathematicians, Vasily has all students numbered from 1 to n. But Vasily Petrov did not like the way the children were seated at the desks. According to him, the students whose numbers differ by 1, can not sit together, as they talk to each other all the time, distract others and misbehave. On the other hand, if a righthanded student sits at the left end of the desk and a lefthanded student sits at the right end of the desk, they hit elbows all the time and distract each other. In other cases, the students who sit at the same desk, do not interfere with each other. Vasily knows very well which students are lefthanders and which ones are righthanders, and he asks you to come up with any order that meets these two uncomplicated conditions (students do not talk to each other and do not bump their elbows). It is guaranteed that the input is such that at least one way to seat the students always exists. The first input line contains a single even integer n (4<=≤<=n<=≤<=100) — the number of students in the class. The second line contains exactly n capital English letters "L" and "R". If the i-th letter at the second line equals "L", then the student number i is a lefthander, otherwise he is a righthander. Print integer pairs, one pair per line. In the i-th line print the numbers of students that will sit at the i-th desk. The first number in the pair stands for the student who is sitting to the left, and the second number stands for the student who is sitting to the right. Separate the numbers in the pairs by spaces. If there are multiple solutions, print any of them. Sample Input 6 LLRLLL 4 RRLL Sample Output 1 4 2 5 6 3 3 1 4 2	[ "# a - 1\ninFile=open(\"input.txt\",\"r\")\noutFiles=open(\"output.txt\",\"w\")\nstudents=inFile.readline().strip()\nstudents=int(students)\nseating=inFile.readline().strip()\nhalfstudents=students//2\nfor i in range(halfstudents):\n if seating[i]==\"L\":\n outFiles.write(str(i+1) + \" \" + str(i+halfstudents+1)+ \"\\n\")\n else:\n outFiles.write(str(i+halfstudents+1) + \" \" + str(i+1) + \"\\n\")\n\t\t \t \t \t\t\t \t\t \t\t \t\t \t\t\t\t\t", "inputFile=open(\"input.txt\",\"r\")\ntemp=inputFile.readlines()\nnew_content = [x[:-1] for x in temp]\ninputFile.close()\n\n\n\noutputFile=open(\"output.txt\",\"w\")\nn=new_content[0]\nhand=new_content[1]\ngroups=int(n)//2 #LLR LLL\nfor i in range(1,groups+1): #Because the index of the first person should be 1, not 0. range(a,b) doesn't inlude b, so it should be b+1.\n if hand[i-1]=='L': #i-1 is because we should start from index 0 to find 'L'.\n outputFile.write(str(i)+\" \")\n outputFile.write(str(i+groups)+ \"\\n\")\n #ptint(i,i + groups) #the person sit on the right should be i+groups.\n elif hand[i-1]=='R':\n outputFile.write(str(i+groups)+\" \")#print(i+groups, i)\n outputFile.write(str(i)+\"\\n\")\noutputFile.close()\n\n\n\n \t \t\t \t \t \t \t\t \t \t \t \t", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n \r\n# # TAKE INPUT\r\n# def get_ints_in_variables():\r\n# return map(int, sys.stdin.readline().strip().split())\r\n# def get_int(): return int(input())\r\n# def get_ints_in_list(): return list(\r\n# map(int, sys.stdin.readline().strip().split()))\r\n# def get_list_of_list(n): return [list(\r\n# map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\n# def get_string(): return sys.stdin.readline().strip()\r\n \r\ndef main():\r\n # Write Your Code Here\r\n sys.stdin=open('input.txt','r')\r\n sys.stdout=open('output.txt','w')\r\n\r\n n=int(input())\r\n alp=input()\r\n\r\n for i in range(n//2):\r\n a=alp[i]\r\n b=alp[i+n//2]\r\n if a == 'R' and b == 'L':\r\n print(i+n//2+1 , i+1)\r\n else:\r\n print(i+1,i+n//2+1)\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "with open(\"input.txt\") as fh:\n content = fh.readlines()\n s = list(content[1])\n n = len(s) // 2\noutput = open(\"output.txt\", \"w\")\nfor i in range(n):\n if s[i] == \"R\":\n print(str(i+1+n) + \" \" + str(i+1), file=output)\n else:\n print(str(i + 1) + \" \" + str(i + 1 + n), file=output)\n\t\t \t \t \t \t\t \t \t\t \t\t \t \t \t \t", "with open(\"input.txt\") as inp:\r\n n,stud=int(inp.readline().strip()),inp.readline().strip()\r\n l=\"\"\r\n for i in range(n//2):\r\n if stud[i]==\"R\" and stud[i+(n//2)]==\"L\":\r\n l+=f\"{i+(n//2)+1} {i+1}\\n\"\r\n else:\r\n l+=f\"{i+1} {i+(n//2)+1}\\n\"\r\nwith open(\"output.txt\",\"w\") as paste:\r\n paste.write(l)", "# -- coding: utf-8 --\n\"\"\"Untitled75.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1D1x8mgVYBiLay890KzZPAq2TMoXX-k_G\n\"\"\"\n\nfile1 = open('input.txt', 'r')\nLines = file1.readlines()\nn=int(Lines[0])\nl1=list(Lines[1])\nl2=[]\nl3=[]\nfor x in range(1,n//2+1):\n l2.append(x)\nfor x in range(n//2+1,n+1):\n l3.append(x)\nfor x in range(0,n//2):\n if l1[l2[x]-1]==\"R\" and l1[l3[x]-1]==\"L\":\n c=l3[x]\n l3[x]=l2[x]\n l2[x]=c\nfile2 = open('output.txt', 'w')\nfor x in range(0,n//2):\n file2.writelines(str(l2[x])+\" \"+str(l3[x])+\"\\n\")\n print()\nfile2.close()", "n=int(0)\r\nl=[]\r\nfile=open('input.txt','r')\r\ni=int(1)\r\nwhile True:\r\n line=file.readline()\r\n if not line:\r\n break\r\n if i==1:\r\n n=int(line)\r\n i+=1\r\n else:\r\n for i in line:\r\n l.append(i)\r\nfile.close()\r\nans=[]\r\nfor i in range(n//2):\r\n if l[i]=='R':\r\n a=[int(n/2+i+1),int(i+1)]\r\n ans.append(a)\r\n else:\r\n ans.append([int(i+1),int(n/2+i+1)])\r\nfile=open('output.txt','a')\r\nfor i in ans:\r\n a=str(i[0])+\" \"+str(i[1])+\"\\n\"\r\n file.writelines(a)", "with open(\"input.txt\") as fh:\n n = int(fh.readline())\n hands = fh.readline()\nspace = n // 2\nstart = 1\noutfile = open(\"output.txt\", \"w\")\nwhile start <= space:\n left = str(start)\n right = str(start + space)\n if (hands[(start + space)-1] == \"L\") & (hands[start-1] == \"R\"):\n right = str(start)\n left = str(start + space)\n outfile.write(left + \" \" + right + \"\\n\")\n start += 1\noutfile.close()\n\t \t\t\t \t\t\t \t\t\t\t \t \t\t \t\t\t \t", "\r\ndata = open(\"input.txt\")\r\nn, students = data.readlines()\r\nstudents = list(students)\r\nn = int(n)\r\noutput = []\r\n\r\n\r\na = 0\r\nb = 0\r\nidx = 1\r\nfor i in range(0, n//2):\r\n left = i + 1\r\n right = i+n//2 + 1\r\n if students[left -1] == \"R\" and students[right-1] == \"L\":\r\n left, right = right, left\r\n output.append((left, right))\r\n\r\nresult = open(\"output.txt\", \"w\")\r\nfor ans in output:\r\n result.write(f\"{ans[0]} {ans[1]} \\n\")", "inputFile = open(\"input.txt\", \"r\")\noutputFile = open(\"output.txt\", \"w\")\n\ninputLines = inputFile.readlines()\n\nn = int(inputLines[0])\nseats = inputLines[1]\n\nposition = n//2\nfor x in range(1, position + 1):\n if seats[x-1] == \"L\":\n print(x, x + position, file = outputFile)\n if seats[x-1] == \"R\":\n print(x + position, x, file = outputFile)\n\ninputFile.close()\noutputFile.close()\n \t\t\t\t\t\t \t \t \t \t\t \t\t \t \t", "input = open(\"input.txt\",\"r\")\noutput = open(\"output.txt\",\"w\")\nn = int(input.readline())\nread = input.readline()\nfor i in range(n//2):\n if read[i] == \"R\":\n output.write(str(i+1+n//2)+\" \"+str(i+1)+\"\\n\")\n else :\n output.write(str(i+1)+\" \"+str(i+1+n//2)+\"\\n\")\n \t\t \t \t\t \t\t \t\t\t\t\t \t\t\t\t\t", "def is_even(n):\n return n % 2 == 0\n\n\ndef in_range(n):\n return 4 <= n <= 100\n\n\ndef is_left(letter):\n return letter == 'L'\n\n\ndef is_right(letter):\n return letter == 'R'\n\n\ninput_file = open('input.txt','r')\noutput_file = open('output.txt','w')\nlines = input_file.readlines()\nnumber_of_students = int(lines[0])\ncapital_letters = lines[1]\nif is_even(number_of_students) and in_range(number_of_students):\n middle = number_of_students // 2\n for i in range (middle):\n if is_right(capital_letters[i]) and is_left(capital_letters[middle + i]):\n output_file.write(f'{middle + i + 1} {i + 1}\\n')\n else:\n output_file.write(f'{i + 1} {middle + i + 1}\\n')\n \t \t\t\t \t\t\t\t \t \t \t\t \t\t\t \t", "a = open('input.txt').readlines()[1]\nb = len(a)//2\n\nfor i in range(b):\n print([i+1+b,i+1][::2(a[i]>'L')-1], file=open('output.txt','a'))\n \t \t \t\t\t \t \t\t \t \t \t\t \t", "f = open('input.txt', 'r')\r\nn = int( f.readline())\r\ns = f.readline()\r\nf.close()\r\n\r\nf = open('output.txt','w')\r\ni = 1\r\nwhile i<=n/2:\r\n if s[i-1]=='R' and s[i+n//2-1]=='L':\r\n f.write(str(i+n//2) +' '+str(i)+'\\n')\r\n else:\r\n f.write(str(i) +' '+str(i+n//2)+'\\n')\r\n i+=1\r\nf.close()\r\n\r\n", "#read input file\ninputtemp=open('input.txt','r')\ntemp=inputtemp.readlines()\ninputtemp.close()\n\n\n#variables\nn=temp[0]\nn=(int(n))\nhands=temp[1]\nhands=list(hands)\norder=[]\n\n#create array of #s\nfor i in range(n):\n order.append(i+1)\n\n\n\nmid=int(n/2)\n\nlefties=order[0:mid]\nrighties=order[mid:n]\n\n\n#output \noutput=open('output.txt','w')\n\nfor i in range(1, mid+1):\n if hands[i-1] == \"L\":\n output.write(str(i)+\" \"+str(i+mid))\n if hands[i-1] == \"R\":\n output.write(str(i+mid)+\" \"+str(i))\n if(i<mid):\n output.write('\\n')\noutput.close()\n\t \t \t \t \t \t\t\t \t\t\t\t\t", "inp = open(\"input.txt\", \"r\")\nout = open(\"output.txt\", \"w\")\ninp_lines = inp.readlines()\nn = int(inp_lines[0])\nseat = inp_lines[1]\nkey = n // 2\nfor i in range(1, key + 1):\n if seat[i - 1] == \"L\":\n print(i, i + key, file=out)\n if seat[i - 1] == \"R\":\n print(i + key, i, file=out)\ninp.close()\nout.close()\n\t\t \t \t \t\t \t\t\t\t\t \t \t \t", "inp = open('input.txt', 'r')\nout = open('output.txt', 'w')\nn, s = int(inp.readline().strip()), inp.readline().strip()\nfor i in range(n//2):\n a, b = i, i + n // 2\n if s[a] == 'R'and s[b] == 'L':\n a, b = b, a\n out.write(str(a+1) + \" \" + str(b+1) + \"\\n\")\nout.close()\n\t \t\t\t \t \t\t\t\t \t \t \t \t \t\t \t\t\t", "# n = int(input())\n# s = input()\n\noutputfile = open(\"output.txt\", 'w')\n\nwith open(\"input.txt\", 'r') as f:\n n = int(f.readline())\n s = f.readline()\n\n for i in range(n // 2):\n # always L for left and R for right\n # always choose one from first half and one from second half\n if s[i] == 'L':\n outputfile.write(\"{0} {1}\\n\".format(i + 1, i + n // 2 + 1))\n else:\n outputfile.write(\"{0} {1}\\n\".format(i + n // 2 + 1, i + 1))\n\noutputfile.close()\n\t\t\t \t\t\t \t\t\t\t\t \t\t \t \t", "rf = open('input.txt')\nwf = open('output.txt', \"w\")\ns = rf.read()\n\nl = s.split(\"\\n\")\n\nn = int(l[0])\n\nret = []\nhanded = [c for c in l[1]]\nfor i in range(0,n):\n\tfor j in range(int(n/2), n):\n\t\tif i+1 == j or i==j:\n\t\t\tcontinue;\n\t\tif handed[i]=='0' or handed[j]=='0':\n\t\t\tcontinue;\n\t\tif handed[i]== 'L':\n\t\t\thanded[i]='0'\n\t\t\thanded[j]='0'\n\t\t\tret.append([i+1,j+1])\n\t\t\ts = str(i+1) + \" \" + str(j+1) + \"\\n\"\n\t\t\twf.write(s)\n\t\telse:\n\t\t\tif handed[j]== 'R':\n\t\t\t\thanded[i]='0'\n\t\t\t\thanded[j]='0'\n\t\t\t\tret.append([i+1,j+1])\n\t\t\t\ts = str(i+1) + \" \" + str(j+1) + \"\\n\"\n\t\t\t\twf.write(s)\n\t\t\telse:\n\t\t\t\thanded[i]= '0'\n\t\t\t\thanded[j]= '0'\n\t\t\t\tret.append([j+1,i+1])\n\t\t\t\ts = str(j+1) + \" \" + str(i+1) + \"\\n\"\n\t\t\t\twf.write(s)\n\nwf.close()\n\t\n \t\t\t \t\t\t \t\t \t\t\t \t\t \t \t\t \t", "with open(\"input.txt\",\"r\") as f:\r\n n = int(f.readline())\r\n students = f.readline()\r\nf = open(\"output.txt\", \"w\")\r\ni = 0\r\nwhile i<n//2:\r\n if students[i]==\"R\" and students[i+n//2]==\"L\":\r\n f.write(\"{} {}\\n\".format(i+n//2+1, i+1))\r\n else:\r\n f.write(\"{} {}\\n\".format(i+1, i+1+n//2))\r\n i+=1\r\nf.close()\r\n", "#https://www.guru99.com/python-file-readline.html#:~:text=The%20readline%20%28%29%20method%20helps%20to%20read%20just,can%20make%20use%20of%20Python%20readlines%20%28%29%20function.\niput = open('input.txt', 'r')\nouput = open('output.txt', 'w')\nn, c = int(iput.readline()), iput.readline() #n = total, c = chair#\nfor i in range(n//2):\n a, b = i, i + n // 2 #for instance 1, 1+ (6/2) = 1, 4\n if c[a] == 'R'and c[b] == 'L': #if Righty on left side / lefty on right\n a, b = b, a #switch\n ouput.write(str(a+1) + \" \" + str(b+1) + \"\\n\") #(a+1 because starts at 0)\nouput.close()\n \t\t\t \t\t\t \t \t\t \t \t \t \t \t\t\t", "fin = open('input.txt','r')\nfout = open('output.txt', 'w')\nn = int(fin.readline().strip())\nk = fin.readline().strip()\n# print(n)\n# print(k)\nfor i in range(n//2):\n left = i\n right = i + n//2\n if k[left] == 'R' and k[right] == 'L':\n left, right = right, left\n # print(left, right)\n output = str(left+1) +' '+ str(right+1) +'\\n'\n fout.write(str(output))\nfin.close()\nfout.close()\n\t\t \t \t \t\t \t\t \t \t\t \t\t\t\t\t\t \t", "r=open(\"input.txt\",\"r\")\nw=open(\"output.txt\",\"w\")\nn=int(r.readline())\ns=r.readline().strip()\n \nfor i in range(n//2):\n if(s[i]==s[i+n//2]):\n w.write(str(i+1)+\" \"+str(n//2+i+1)+\"\\n\")\n else:\n if(s[i]==\"R\"):\n w.write(str(n//2+i+1)+\" \"+str(i+1)+\"\\n\")\n else:\n w.write(str(i+1)+\" \"+str(n//2+i+1)+\"\\n\")\n \t \t\t \t\t \t\t \t \t \t\t", "with open('input.txt', 'r') as rf:\n n = int(rf.readline())\n hand = str(rf.readline())\npairs = [[0, 0] for i in range(int(n/2))]\nfor i in range(int(n/2)):\n pairs[i][0] = i+1\n pairs[i][1] = i+1 + int(n/2)\n if hand[i] != hand[i + int(n/2)] and hand[i] == 'R':\n (pairs[i][0], pairs[i][1]) = (pairs[i][1], pairs[i][0])\nwith open('output.txt', 'w') as wf:\n for i in range(len(pairs)):\n for j in range(2):\n pairs[i][j] = str(pairs[i][j])\n wf.write(\" \" + pairs[i][j])\n wf.write(\"\\n\")\n\t \t \t \t \t \t\t\t \t\t \t\t \t\t \t", "with open(\"input.txt\", 'r') as f:\r\n n = int(f.readline())\r\n s = f.readline()\r\n outputfile = open(\"output.txt\", 'w')\r\n for i in range(int(n / 2)):\r\n if s[i] == 'L':\r\n outputfile.write(f\"{i + 1} {int(n / 2 + i + 1)}\\n\")\r\n else:\r\n outputfile.write(f\"{int(n / 2 + i + 1)} {i + 1}\\n\")", "w=open(\"input.txt\",\"r\")\ng=open(\"output.txt\",\"w\")\nn=int(w.readline())\ns=w.readline()\nfor i in range(n//2):\n if s[i]=='R':\n g.write(str(i+1+n//2)+\" \"+str(i+1)+\"\\n\")\n else :\n g.write(str(i+1)+\" \"+str(i+1+n//2)+\"\\n\")\n \n \t\t\t\t \t\t\t \t \t \t \t \t \t \t\t", "def find_seating_arrangement():\r\n\twith open(\"input.txt\", \"r\") as f_input:\r\n\t\tstudents = int(f_input.readline())\r\n\t\tstudent_details = f_input.readline()\r\n\r\n\teven_number_students = [(index+1, student_details[index])\r\n\t\t\t\t\t\t\tfor index in range(0, students, 2)]\r\n\todd_number_students = [(index+1, student_details[index])\r\n\t\t\t\t\t\tfor index in range(1, students, 2)]\r\n\r\n\tmixed_students = even_number_students + odd_number_students\r\n\r\n\twith open(\"output.txt\", \"w\") as f_output:\r\n\t\tfor index in range(0, students, 2):\r\n\t\t\tif mixed_students[index][1] == \"R\" and mixed_students[index+1][1] == \"L\":\r\n\t\t\t\tf_output.write(\"{} {}\\n\".format(mixed_students[index+1][0], mixed_students[index][0]))\r\n\t\t\telse:\r\n\t\t\t\tf_output.write(\"{} {}\\n\".format(mixed_students[index][0], mixed_students[index+1][0]))\r\n\r\n\r\nfind_seating_arrangement()\r\n", "import math\r\n\r\n\r\ndef main_function():\r\n with open(\"input.txt\", \"r\") as file:\r\n n = int(file.readline())\r\n hand = list(file.readline())\r\n print(n)\r\n print(hand)\r\n collector = []\r\n for i in range(0, len(hand) // 2):\r\n a = hand[i]\r\n b = hand[i + len(hand) // 2]\r\n if a == \"R\" and b == \"L\":\r\n collector.append([i + 1 + len(hand) // 2, i + 1])\r\n else:\r\n collector.append([i + 1, i + 1 + len(hand) // 2])\r\n print(collector)\r\n with open(\"output.txt\", \"w\") as file:\r\n for i in collector:\r\n file.write(f\"{i[0]} {i[1]}\\n\")\r\n return file\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "f = open(\"input.txt\",\"r\")\nsOne = f.readline()\nsTwo = f.readline()\nn = int(sOne)//2\nfor i in range(n):\n if sTwo[i] == \"L\":\n print((i+1,i+n+1), file = open(\"output.txt\",\"a\"))\n else:\n print((i+n+1,i+1), file = open(\"output.txt\",\"a\"))\nf.close()\n \t \t \t \t\t\t \t\t \t\t \t \t\t \t", "input_txt= open(\"input.txt\", \"r\")\nkids = int(input_txt.readline())\nseats = input_txt.readline()\noutput_txt = open(\"output.txt\", \"w\")\nfor i in range(kids//2):\n if seats[i] ==\"L\":\n output_txt.write(str(i+1) +\" \"+str(i+1+kids//2)+\"\\n\")\n else:\n output_txt.write(str(i+1 +kids//2) + \" \" + str(i+1)+\"\\n\")\n\n\n\t\t\t \t\t \t\t\t \t \t \t", "with open('input.txt', 'r') as a:\n def changetolist(string):\n c = []\n c[:0] = string\n return c[0:-1]\n\n\n e = 0\n k = 0\n n = 0\n function = 0\n b = a.readlines()[1]\n d = changetolist(b)\nf = open('output.txt', 'w')\nwhile function % 2 == 0 and n < len(d) // 2:\n while function % 2 == 0:\n for i in d:\n if i == \"L\":\n e += 1\n if e >= 1:\n function += 1\n break\n elif i == \"R\":\n e += 1\n if e >= 1:\n function += 1\n break\n while function % 2 != 0:\n for count, element in enumerate(d[len(d)//2 + n:], len(d) // 2 + n + 1):\n if element == \"L\":\n f.write(str(count) + \" \" + str(e) + \"\\n\")\n function += 1\n n += 1\n break\n elif element == \"R\":\n f.write(str(e) + \" \" + str(count) + \"\\n\")\n function += 1\n n += 1\n break\nf.close()\n\n\t\t\t\t\t\t\t \t\t\t\t\t \t \t\t\t\t\t\t", "def solve():\r\n with open(\"input.txt\", 'r') as f:\r\n n = int(f.readline())\r\n s = f.readline()\r\n outputfile = open(\"output.txt\", 'w')\r\n for i in range(int(n/2)):\r\n if s[i]=='L':\r\n outputfile.write(f\"{i+1} {int(n/2+i+1)}\\n\")\r\n else:\r\n outputfile.write(f\"{int(n/2+i+1)} {i+1}\\n\")\r\n \r\n\r\ndef init():\r\n T=1\r\n # T=int(input())\r\n while T:\r\n solve()\r\n # print(solve())\r\n T -=1\r\ninit()\r\n", "def solve() :\n s=''\n for i in range(n//2):\n if st[i]=='R' and st[n//2+i]=='L':\n s+=f'{n//2+i+1} {i+1}\\n'\n else:\n s+=f'{i+1} {n//2+i+1}\\n'\n s.strip()\n with open('output.txt','w') as f :\n f.write(s)\n return\n\n \n\n \n\n\n\n \nfrom sys import stdin\ninput = stdin.readline \n \n \nwith open('input.txt','r') as f :\n args=f.readlines()\nn=int(args[0])\nst=args[1].strip()\nprint(solve())\n\n\n\n'''\n\nt=int(input())\nfor i in range(t) :\n print(solve())\n\n\nn=int(input())\n\nx=input().strip()\n\n\nn,m= [int(x) for x in input().split()]\n\n\n\n\nn=int(input())\narr=[int(x) for x in input().split()]\n\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([x for x in input().strip()])\n\n\nn=int(input())\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\n\n'''", "with open(\"input.txt\", \"r\") as g:\n num = int(g.readline())\n hands = g.readline()\nwith open(\"output.txt\", \"w\") as h:\n for i in range(num//2):\n if hands[i] == \"L\":\n h.write(str(i + 1) + \" \" + str(i + 1 + num // 2) + \"\\n\")\n elif hands[i] == \"R\":\n h.write(str(i + 1 + num // 2) + \" \" + str(i + 1) + \"\\n\")\n \t \t \t\t\t \t \t\t \t\t\t\t\t \t\t \t \t\t \t", "inp = open(\"input.txt\",\"r\")\nout = open(\"output.txt\",\"w\")\nn = int(inp.readline())\nhand = inp.readline()\nfor i in range(n//2):\n if hand[i] == \"R\":\n out.write(str(i+1+n//2)+\" \"+str(i+1)+\"\\n\")\n else :\n out.write(str(i+1)+\" \"+str(i+1+n//2)+\"\\n\")\n\t\t \t\t \t \t\t \t\t \t \t \t", "s=open('input.txt').readlines()[1];n=len(s)//2\r\nfor i in range(n):print([i+1+n,i+1][::2(s[i]>'L')-1],file=open('output.txt','a'))", "import sys\r\n\r\nsys.stdin=open('input.txt','r')\r\nsys.stdout=open('output.txt','w')\r\n\r\nn = int(input())\r\nf = input()\r\ns = n//2\r\nfor i in range(s):\r\n st1 = str(i+1)\r\n nd2 = str(i+1 + s)\r\n i1 = f[i]\r\n iS = f[i + s]\r\n if i1 == iS:\r\n print(st1 + ' ' + nd2)\r\n elif i1 != iS and f[i] == 'L':\r\n print(st1 + ' ' + nd2)\r\n else:\r\n print(nd2 + ' ' + st1)", "with open('input.txt', 'r') as f:\n n = int(f.readline())\n s = f.readline()\nwith open('output.txt', 'w') as g:\n\n for i in range(n // 2):\n if s[i] == 'L':\n g.write(str(i + 1) + ' ' + str(i + n // 2 + 1) + \"\\n\")\n else:\n g.write(str(i + n // 2 + 1) + ' ' + str(i + 1) + \"\\n\")\n \t \t \t\t\t\t\t \t\t \t \t\t", "import sys\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\n\r\nn=int(input())\r\na=list(input())\r\n\r\nfor i in range(n//2):\r\n if a[i]==\"L\":\r\n print(i+1,i+1+n//2)\r\n else:\r\n print(i+1+n//2,i+1)", "#A-1-1(fernando)\n#got help from fernando at MSI\nwith open(\"input.txt\", \"r\") as fh:\n a = fh.read().split()\n print(a)\n n = int(a[0])\n stu = a[1]\n stu = [i for i in stu]\n print(stu)\n\n pos = int(n//2)\n\nwith open(\"output.txt\", \"w\") as g:\n for i in range(1,pos + 1):\n if stu[i-1] == 'L':#is left handed\n #print(i,i + pos)\n x = (i,i + pos)\n g.write(str(x[0])+ \" \" +str(x[1])+\"\\n\")\n elif stu[i-1] == 'R':#is right handed\n #print(i+pos,i)\n x = i+pos,i\n g.write(str(x[0]) + \" \" +str(x[1])+ \"\\n\")\n\n \t\t\t \t \t\t\t\t\t \t \t\t\t \t \t\t" ]	{"inputs": ["6\nLLRLLL", "4\nRRLL", "4\nLLRR", "6\nRLLRRL", "8\nLRLRLLLR", "10\nRLLRLRRRLL", "12\nLRRRRRLRRRRL", "14\nRLLRLLLLRLLLRL", "16\nLLLRRRLRRLLRRLLL", "18\nRRRLLLLRRRLRLRLLRL", "20\nRLRLLRLRRLLRRRRRRLRL", "22\nRLLLRLLLRRLRRRLRLLLLLL", "24\nLRRRLRLLRLRRRRLLLLRRLRLR", "26\nRLRRLLRRLLRLRRLLRLLRRLRLRR", "28\nLLLRRRRRLRRLRRRLRLRLRRLRLRRL", "30\nLRLLRLRRLLRLRLLRRRRRLRLRLRLLLL", "32\nRLRLLRRLLRRLRLLRLRLRLLRLRRRLLRRR", "34\nLRRLRLRLLRRRRLLRLRRLRRLRLRRLRRRLLR", "36\nRRLLLRRRLLLRRLLLRRLLRLLRLRLLRLRLRLLL", "38\nLLRRRLLRRRLRRLRLRRLRRLRLRLLRRRRLLLLRLL", "40\nLRRRRRLRLLRRRLLRRLRLLRLRRLRRLLLRRLRRRLLL", "42\nRLRRLLLLLLLRRRLRLLLRRRLRLLLRLRLRLLLRLRLRRR", "44\nLLLLRRLLRRLLRRLRLLRRRLRLRLLRLRLRRLLRLRRLLLRR", "46\nRRRLLLLRRLRLRRRRRLRLLRLRRLRLLLLLLLLRRLRLRLRLLL", "48\nLLLLRRLRRRRLRRRLRLLLLLRRLLRLLRLLRRLRRLLRLRLRRRRL", "50\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "52\nLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL", "54\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "56\nLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL", "58\nRRRLLLRLLLLRRLRRRLLRLLRLRLLRLRRRRLLLLLLRLRRLRLRRRLRLRRLRRL", "60\nRLLLLRRLLRRRLLLLRRRRRLRRRLRRRLLLRLLLRLRRRLRLLLRLLRRLLRRRRRLL", "62\nLRRLRLRLLLLRRLLLLRRRLRLLLLRRRLLLLLLRRRLLLLRRLRRLRLLLLLLLLRRLRR", "64\nRLLLLRRRLRLLRRRRLRLLLRRRLLLRRRLLRLLRLRLRRRLLRRRRLRLRRRLLLLRRLLLL", "66\nLLRRRLLRLRLLRRRRRRRLLLLRRLLLLLLRLLLRLLLLLLRRRLRRLLRRRRRLRLLRLLLLRR", "68\nRRLRLRLLRLRLRRRRRRLRRRLLLLRLLRLRLRLRRRRLRLRLLRRRRLRRLLRLRRLLRLRRLRRL", "70\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "72\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "74\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "76\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "78\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "80\nLRLRRRRLRRRRLLLLRLLRLRLLRRLRLLLRRLLLLRLLLRLRLLRRRLRRRLRLRRRRRLRLLRLLRRLLLRLRRRLL", "82\nRLRRLLRLRLRLLLRLLLRRLLRRLRRRRLLRLLLLRRRRRLLLRRRLLLLRLRRLRRRLRLLLLRRRLRLRLLLRLLLLLR", "84\nLRLRRRRRRLLLRLRLLLLLRRLRLRLRRRLLRLLLRLRLLLRRRLRLRRLRLRLLLLLLLLRRRRRRLLLRRLRLRLLLRLRR", "86\nRRRLLLRLLRLLRLRLRLLLRLRLRRLLRLLLRLLLLLLRRRLRLLRLLLRRRLRLLLLRLLRLRRLLRLLLRRRLLRLRLLRLLR", "88\nLLRLRLRLLLLRRRRRRLRRLLLLLRRLRRLLLLLRLRLRLLLLLRLRLRRLRLRRLRLLRRLRLLLRLLLLRRLLRRLRLRLRRLRR", "90\nLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL", "92\nLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL", "94\nLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL", "96\nLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL", "98\nLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL", "100\nRLRRRRLLLLRRRRLRRRRRRRRLRLRRLLRRRRRRRRLRRRRLLLLRRRRLRRLRLRRRLLRRLRRLLLRLRRLLLLLLRLRLRLRRLRLRLRRRLLLR", "100\nLRLLLLRLLLLRRRRRLRRRRLRRLRRLRLLRRLRRRRLLRRRLLLRLLLRRRRLLRLRLRRLRLLRRLLRRLRRLRRRRRLRRLRLRLRLLLLLLLLRL", "100\nLLLRRLLRLRLLLRLLLRLRLLRRRLRRLLLRLRLRRLLRLRRRLLLRRLLRLLRRLLRRRRRLRLRRLRLRRLRLRRLLRLRLLRLLLRLLRLLLLRLL", "100\nRLLLLRRLLLLRRRRLLRLRRRLLLRLLRLLLLLRRLLLLLLRRLRRRRRLRLLRLRRRLLLRLRLRLLLRRRLLLLLRRRRRLRRLLLLRLLLRRLLLL", "100\nRLRRLRLRRLRLLRLLRRRLRRLLLLLRLRLRRRRRRRLLRRRLLRLRLLLRRRLLRRRLLRLRLLLLRRLRLLRLLRLLLLRRLRLRRLRLLLLRLRRR", "100\nLRRLRLRRRRRRLRRLRRLLLLLLRRLLRRLLRLLLLLLRRRLLRLRRRLLRLLRRLRRRLLRLRLLRRLRRRLLLRRRRLLRRRLLLRRRRRLLLLLLR", "100\nRRLRRLRLRLRRRRLLRRLLRLRRLLRRRLLRLRRLRLRRLLLRRLLRRRRRRLLLRRRLLRRLLLLLLRLLLLLLRLLLRRRLRLLRRRRRLLRLLRRR", "100\nRRLLLRLRRLRLLRRLRRRLLRRRLRRLLLLLLLLLRRRLLRLRRLRRLRRLRRLRLLLLRLLRRRLLLLRLRRRLLRRRRLRRLLRRRRLRRRLRLLLR", "100\nLLLLLRRLRRRRRRRLLRRRRRLRRLRLRLLRLRRLLLRRRRLLRRLRLLRLLLRLRLLRRRRRRRRRLRLLLRLRLLLLLRLRRRRLRLLRLRLRLRRL", "100\nLLRRRLLLRLLLLRLRLRLRRRLLLRRRLRLLRLLLRRRRRLRRLRRLRRRLRRLRRLLLRLRLLRRRRLRLRRRRRLRRLRLLRRRRLLLRRRRRLLLL"], "outputs": ["1 4\n2 5\n6 3", "3 1\n4 2", "1 3\n2 4", "1 4\n2 5\n3 6", "1 5\n6 2\n3 7\n4 8", "1 6\n2 7\n3 8\n9 4\n5 10", "1 7\n2 8\n3 9\n4 10\n5 11\n12 6", "8 1\n2 9\n3 10\n11 4\n5 12\n6 13\n7 14", "1 9\n2 10\n3 11\n4 12\n5 13\n14 6\n7 15\n16 8", "1 10\n11 2\n3 12\n4 13\n5 14\n6 15\n7 16\n8 17\n18 9", "11 1\n2 12\n3 13\n4 14\n5 15\n6 16\n7 17\n18 8\n9 19\n10 20", "1 12\n2 13\n3 14\n4 15\n5 16\n6 17\n7 18\n8 19\n20 9\n21 10\n11 22", "1 13\n2 14\n15 3\n16 4\n5 17\n18 6\n7 19\n8 20\n21 9\n10 22\n23 11\n12 24", "1 14\n2 15\n16 3\n4 17\n5 18\n6 19\n7 20\n8 21\n9 22\n10 23\n24 11\n12 25\n13 26", "1 15\n2 16\n3 17\n18 4\n5 19\n20 6\n7 21\n8 22\n9 23\n10 24\n25 11\n12 26\n13 27\n28 14", "1 16\n2 17\n3 18\n4 19\n5 20\n6 21\n7 22\n23 8\n9 24\n10 25\n11 26\n12 27\n28 13\n14 29\n15 30", "17 1\n2 18\n19 3\n4 20\n5 21\n22 6\n7 23\n8 24\n9 25\n10 26\n11 27\n12 28\n29 13\n14 30\n15 31\n16 32", "1 18\n2 19\n20 3\n4 21\n5 22\n6 23\n7 24\n8 25\n9 26\n10 27\n28 11\n12 29\n13 30\n14 31\n15 32\n33 16\n17 34", "19 1\n20 2\n3 21\n4 22\n5 23\n6 24\n25 7\n8 26\n9 27\n10 28\n11 29\n30 12\n13 31\n14 32\n15 33\n16 34\n35 17\n36 18", "1 20\n2 21\n22 3\n4 23\n24 5\n6 25\n7 26\n27 8\n9 28\n10 29\n11 30\n12 31\n32 13\n14 33\n34 15\n16 35\n17 36\n37 18\n19 38", "1 21\n2 22\n23 3\n4 24\n5 25\n26 6\n7 27\n8 28\n9 29\n10 30\n31 11\n12 32\n13 33\n14 34\n15 35\n16 36\n17 37\n18 38\n39 19\n20 40", "1 22\n2 23\n3 24\n25 4\n5 26\n6 27\n7 28\n8 29\n9 30\n10 31\n11 32\n33 12\n34 13\n35 14\n15 36\n37 16\n17 38\n18 39\n19 40\n20 41\n21 42", "1 23\n2 24\n3 25\n4 26\n27 5\n6 28\n7 29\n8 30\n31 9\n10 32\n11 33\n12 34\n35 13\n14 36\n15 37\n16 38\n17 39\n18 40\n41 19\n42 20\n21 43\n22 44", "1 24\n2 25\n26 3\n4 27\n5 28\n6 29\n7 30\n31 8\n32 9\n10 33\n34 11\n12 35\n13 36\n14 37\n38 15\n16 39\n40 17\n18 41\n42 19\n20 43\n21 44\n45 22\n23 46", "1 25\n2 26\n3 27\n4 28\n29 5\n6 30\n7 31\n32 8\n9 33\n10 34\n35 11\n12 36\n13 37\n38 14\n39 15\n16 40\n41 17\n18 42\n19 43\n20 44\n21 45\n22 46\n23 47\n48 24", "1 26\n2 27\n3 28\n4 29\n5 30\n6 31\n7 32\n8 33\n9 34\n10 35\n11 36\n12 37\n13 38\n14 39\n15 40\n16 41\n17 42\n18 43\n19 44\n20 45\n21 46\n22 47\n23 48\n24 49\n25 50", "1 27\n2 28\n3 29\n4 30\n5 31\n6 32\n7 33\n8 34\n9 35\n10 36\n11 37\n12 38\n13 39\n14 40\n15 41\n16 42\n17 43\n18 44\n19 45\n20 46\n21 47\n22 48\n23 49\n24 50\n25 51\n26 52", "1 28\n2 29\n3 30\n4 31\n5 32\n6 33\n7 34\n8 35\n9 36\n10 37\n11 38\n12 39\n13 40\n14 41\n15 42\n16 43\n17 44\n18 45\n19 46\n20 47\n21 48\n22 49\n23 50\n24 51\n25 52\n26 53\n27 54", "1 29\n2 30\n3 31\n4 32\n5 33\n6 34\n7 35\n8 36\n9 37\n10 38\n11 39\n12 40\n13 41\n14 42\n15 43\n16 44\n17 45\n18 46\n19 47\n20 48\n21 49\n22 50\n23 51\n24 52\n25 53\n26 54\n27 55\n28 56", "1 30\n2 31\n3 32\n4 33\n5 34\n6 35\n36 7\n8 37\n9 38\n10 39\n11 40\n41 12\n13 42\n14 43\n44 15\n16 45\n46 17\n18 47\n19 48\n20 49\n21 50\n22 51\n52 23\n24 53\n25 54\n26 55\n27 56\n28 57\n29 58", "31 1\n2 32\n3 33\n4 34\n5 35\n36 6\n7 37\n8 38\n9 39\n10 40\n11 41\n42 12\n13 43\n14 44\n15 45\n16 46\n17 47\n48 18\n49 19\n20 50\n21 51\n22 52\n53 23\n24 54\n25 55\n26 56\n27 57\n28 58\n59 29\n30 60", "1 32\n33 2\n34 3\n4 35\n5 36\n6 37\n7 38\n8 39\n9 40\n10 41\n11 42\n12 43\n13 44\n14 45\n15 46\n16 47\n17 48\n18 49\n50 19\n51 20\n21 52\n53 22\n23 54\n24 55\n25 56\n26 57\n27 58\n28 59\n60 29\n30 61\n31 62", "1 33\n2 34\n3 35\n4 36\n5 37\n6 38\n39 7\n8 40\n9 41\n10 42\n11 43\n12 44\n13 45\n14 46\n15 47\n16 48\n17 49\n18 50\n19 51\n20 52\n21 53\n22 54\n55 23\n56 24\n25 57\n26 58\n27 59\n28 60\n61 29\n62 30\n31 63\n32 64", "1 34\n2 35\n3 36\n37 4\n38 5\n6 39\n7 40\n41 8\n9 42\n10 43\n11 44\n12 45\n46 13\n14 47\n15 48\n49 16\n50 17\n18 51\n19 52\n20 53\n21 54\n22 55\n23 56\n24 57\n58 25\n26 59\n27 60\n28 61\n29 62\n30 63\n31 64\n32 65\n33 66", "35 1\n2 36\n3 37\n4 38\n5 39\n40 6\n7 41\n8 42\n9 43\n10 44\n45 11\n12 46\n13 47\n14 48\n15 49\n50 16\n17 51\n18 52\n19 53\n54 20\n21 55\n56 22\n23 57\n24 58\n25 59\n26 60\n27 61\n28 62\n29 63\n30 64\n31 65\n32 66\n33 67\n68 34", "1 36\n2 37\n3 38\n4 39\n5 40\n6 41\n7 42\n8 43\n9 44\n10 45\n11 46\n12 47\n13 48\n14 49\n15 50\n16 51\n17 52\n18 53\n19 54\n20 55\n21 56\n22 57\n23 58\n24 59\n25 60\n26 61\n27 62\n28 63\n29 64\n30 65\n31 66\n32 67\n33 68\n34 69\n35 70", "1 37\n2 38\n3 39\n4 40\n5 41\n6 42\n7 43\n8 44\n9 45\n10 46\n11 47\n12 48\n13 49\n14 50\n15 51\n16 52\n17 53\n18 54\n19 55\n20 56\n21 57\n22 58\n23 59\n24 60\n25 61\n26 62\n27 63\n28 64\n29 65\n30 66\n31 67\n32 68\n33 69\n34 70\n35 71\n36 72", "1 38\n2 39\n3 40\n4 41\n5 42\n6 43\n7 44\n8 45\n9 46\n10 47\n11 48\n12 49\n13 50\n14 51\n15 52\n16 53\n17 54\n18 55\n19 56\n20 57\n21 58\n22 59\n23 60\n24 61\n25 62\n26 63\n27 64\n28 65\n29 66\n30 67\n31 68\n32 69\n33 70\n34 71\n35 72\n36 73\n37 74", "1 39\n2 40\n3 41\n4 42\n5 43\n6 44\n7 45\n8 46\n9 47\n10 48\n11 49\n12 50\n13 51\n14 52\n15 53\n16 54\n17 55\n18 56\n19 57\n20 58\n21 59\n22 60\n23 61\n24 62\n25 63\n26 64\n27 65\n28 66\n29 67\n30 68\n31 69\n32 70\n33 71\n34 72\n35 73\n36 74\n37 75\n38 76", "1 40\n2 41\n3 42\n4 43\n5 44\n6 45\n7 46\n8 47\n9 48\n10 49\n11 50\n12 51\n13 52\n14 53\n15 54\n16 55\n17 56\n18 57\n19 58\n20 59\n21 60\n22 61\n23 62\n24 63\n25 64\n26 65\n27 66\n28 67\n29 68\n30 69\n31 70\n32 71\n33 72\n34 73\n35 74\n36 75\n37 76\n38 77\n39 78", "1 41\n2 42\n3 43\n4 44\n45 5\n46 6\n7 47\n8 48\n9 49\n50 10\n11 51\n12 52\n13 53\n14 54\n15 55\n16 56\n17 57\n18 58\n19 59\n20 60\n21 61\n62 22\n23 63\n24 64\n65 25\n26 66\n27 67\n68 28\n29 69\n30 70\n31 71\n72 32\n73 33\n34 74\n35 75\n36 76\n37 77\n38 78\n39 79\n40 80", "42 1\n2 43\n44 3\n4 45\n5 46\n6 47\n48 7\n8 49\n50 9\n10 51\n11 52\n12 53\n13 54\n14 55\n56 15\n16 57\n17 58\n18 59\n60 19\n20 61\n21 62\n22 63\n64 23\n65 24\n25 66\n26 67\n27 68\n69 28\n29 70\n30 71\n31 72\n73 32\n33 74\n34 75\n35 76\n36 77\n78 37\n79 38\n80 39\n81 40\n41 82", "1 43\n2 44\n3 45\n46 4\n5 47\n48 6\n7 49\n8 50\n51 9\n10 52\n11 53\n12 54\n55 13\n14 56\n57 15\n16 58\n17 59\n18 60\n19 61\n20 62\n21 63\n22 64\n23 65\n24 66\n25 67\n26 68\n27 69\n70 28\n71 29\n30 72\n31 73\n32 74\n33 75\n34 76\n35 77\n36 78\n79 37\n38 80\n39 81\n40 82\n41 83\n42 84", "1 44\n45 2\n46 3\n4 47\n5 48\n6 49\n50 7\n8 51\n9 52\n10 53\n11 54\n12 55\n56 13\n14 57\n58 15\n16 59\n17 60\n18 61\n19 62\n20 63\n64 21\n22 65\n23 66\n24 67\n68 25\n26 69\n27 70\n28 71\n72 29\n30 73\n31 74\n32 75\n76 33\n34 77\n35 78\n36 79\n37 80\n38 81\n39 82\n40 83\n84 41\n85 42\n43 86", "1 45\n2 46\n47 3\n4 48\n49 5\n6 50\n7 51\n8 52\n9 53\n10 54\n11 55\n12 56\n57 13\n14 58\n59 15\n60 16\n17 61\n18 62\n63 19\n20 64\n21 65\n22 66\n23 67\n24 68\n25 69\n70 26\n71 27\n28 72\n29 73\n30 74\n31 75\n32 76\n33 77\n34 78\n35 79\n36 80\n37 81\n38 82\n39 83\n40 84\n41 85\n42 86\n43 87\n44 88", "1 46\n2 47\n3 48\n4 49\n5 50\n6 51\n7 52\n8 53\n9 54\n10 55\n11 56\n12 57\n13 58\n14 59\n15 60\n16 61\n17 62\n18 63\n19 64\n20 65\n21 66\n22 67\n23 68\n24 69\n25 70\n26 71\n27 72\n28 73\n29 74\n30 75\n31 76\n32 77\n33 78\n34 79\n35 80\n36 81\n37 82\n38 83\n39 84\n40 85\n41 86\n42 87\n43 88\n44 89\n45 90", "1 47\n2 48\n3 49\n4 50\n5 51\n6 52\n7 53\n8 54\n9 55\n10 56\n11 57\n12 58\n13 59\n14 60\n15 61\n16 62\n17 63\n18 64\n19 65\n20 66\n21 67\n22 68\n23 69\n24 70\n25 71\n26 72\n27 73\n28 74\n29 75\n30 76\n31 77\n32 78\n33 79\n34 80\n35 81\n36 82\n37 83\n38 84\n39 85\n40 86\n41 87\n42 88\n43 89\n44 90\n45 91\n46 92", "1 48\n2 49\n3 50\n4 51\n5 52\n6 53\n7 54\n8 55\n9 56\n10 57\n11 58\n12 59\n13 60\n14 61\n15 62\n16 63\n17 64\n18 65\n19 66\n20 67\n21 68\n22 69\n23 70\n24 71\n25 72\n26 73\n27 74\n28 75\n29 76\n30 77\n31 78\n32 79\n33 80\n34 81\n35 82\n36 83\n37 84\n38 85\n39 86\n40 87\n41 88\n42 89\n43 90\n44 91\n45 92\n46 93\n47 94", "1 49\n2 50\n3 51\n4 52\n5 53\n6 54\n7 55\n8 56\n9 57\n10 58\n11 59\n12 60\n13 61\n14 62\n15 63\n16 64\n17 65\n18 66\n19 67\n20 68\n21 69\n22 70\n23 71\n24 72\n25 73\n26 74\n27 75\n28 76\n29 77\n30 78\n31 79\n32 80\n33 81\n34 82\n35 83\n36 84\n37 85\n38 86\n39 87\n40 88\n41 89\n42 90\n43 91\n44 92\n45 93\n46 94\n47 95\n48 96", "1 50\n2 51\n3 52\n4 53\n5 54\n6 55\n7 56\n8 57\n9 58\n10 59\n11 60\n12 61\n13 62\n14 63\n15 64\n16 65\n17 66\n18 67\n19 68\n20 69\n21 70\n22 71\n23 72\n24 73\n25 74\n26 75\n27 76\n28 77\n29 78\n30 79\n31 80\n32 81\n33 82\n34 83\n35 84\n36 85\n37 86\n38 87\n39 88\n40 89\n41 90\n42 91\n43 92\n44 93\n45 94\n46 95\n47 96\n48 97\n49 98", "1 51\n2 52\n3 53\n4 54\n55 5\n6 56\n7 57\n8 58\n9 59\n10 60\n61 11\n62 12\n13 63\n14 64\n15 65\n16 66\n17 67\n68 18\n69 19\n70 20\n21 71\n72 22\n23 73\n24 74\n75 25\n26 76\n77 27\n78 28\n29 79\n30 80\n31 81\n82 32\n33 83\n84 34\n35 85\n86 36\n37 87\n38 88\n39 89\n40 90\n91 41\n42 92\n93 43\n44 94\n45 95\n46 96\n47 97\n98 48\n99 49\n50 100", "1 51\n2 52\n3 53\n4 54\n5 55\n6 56\n7 57\n8 58\n9 59\n10 60\n11 61\n12 62\n63 13\n14 64\n65 15\n66 16\n17 67\n18 68\n69 19\n70 20\n21 71\n22 72\n73 23\n24 74\n25 75\n76 26\n27 77\n28 78\n29 79\n30 80\n31 81\n82 32\n33 83\n34 84\n85 35\n36 86\n87 37\n38 88\n39 89\n40 90\n91 41\n92 42\n93 43\n44 94\n45 95\n46 96\n97 47\n48 98\n49 99\n50 100", "1 51\n2 52\n3 53\n54 4\n5 55\n6 56\n7 57\n58 8\n9 59\n10 60\n11 61\n12 62\n13 63\n64 14\n15 65\n16 66\n17 67\n18 68\n19 69\n20 70\n21 71\n22 72\n23 73\n74 24\n25 75\n26 76\n27 77\n28 78\n29 79\n30 80\n31 81\n82 32\n33 83\n84 34\n35 85\n36 86\n87 37\n38 88\n39 89\n40 90\n41 91\n92 42\n43 93\n94 44\n45 95\n46 96\n47 97\n48 98\n99 49\n50 100", "51 1\n2 52\n3 53\n4 54\n5 55\n56 6\n7 57\n8 58\n9 59\n10 60\n11 61\n62 12\n13 63\n64 14\n15 65\n16 66\n17 67\n68 18\n19 69\n70 20\n21 71\n22 72\n23 73\n24 74\n25 75\n76 26\n27 77\n28 78\n29 79\n30 80\n31 81\n32 82\n33 83\n34 84\n35 85\n36 86\n37 87\n38 88\n39 89\n40 90\n41 91\n42 92\n93 43\n94 44\n45 95\n46 96\n97 47\n98 48\n99 49\n100 50", "51 1\n2 52\n3 53\n4 54\n5 55\n56 6\n7 57\n8 58\n9 59\n10 60\n61 11\n12 62\n13 63\n14 64\n15 65\n16 66\n67 17\n68 18\n19 69\n20 70\n71 21\n22 72\n23 73\n24 74\n25 75\n26 76\n27 77\n28 78\n29 79\n80 30\n31 81\n82 32\n33 83\n34 84\n85 35\n36 86\n87 37\n38 88\n39 89\n40 90\n41 91\n92 42\n93 43\n44 94\n45 95\n46 96\n47 97\n48 98\n49 99\n50 100", "1 51\n2 52\n53 3\n4 54\n5 55\n6 56\n57 7\n8 58\n9 59\n10 60\n61 11\n62 12\n13 63\n64 14\n15 65\n16 66\n67 17\n18 68\n19 69\n20 70\n21 71\n22 72\n23 73\n24 74\n75 25\n76 26\n27 77\n28 78\n29 79\n30 80\n31 81\n32 82\n33 83\n34 84\n35 85\n36 86\n37 87\n38 88\n39 89\n40 90\n41 91\n42 92\n43 93\n44 94\n95 45\n46 96\n97 47\n98 48\n99 49\n50 100", "1 51\n2 52\n3 53\n54 4\n55 5\n6 56\n7 57\n8 58\n9 59\n10 60\n61 11\n12 62\n13 63\n64 14\n15 65\n16 66\n67 17\n68 18\n19 69\n20 70\n71 21\n22 72\n73 23\n74 24\n25 75\n26 76\n27 77\n78 28\n79 29\n30 80\n31 81\n32 82\n33 83\n84 34\n35 85\n36 86\n87 37\n38 88\n39 89\n40 90\n41 91\n42 92\n43 93\n94 44\n45 95\n46 96\n47 97\n48 98\n49 99\n50 100", "1 51\n52 2\n3 53\n4 54\n5 55\n6 56\n7 57\n58 8\n59 9\n10 60\n11 61\n12 62\n13 63\n14 64\n15 65\n16 66\n67 17\n68 18\n69 19\n20 70\n21 71\n72 22\n23 73\n24 74\n25 75\n76 26\n77 27\n28 78\n29 79\n30 80\n31 81\n32 82\n33 83\n34 84\n35 85\n36 86\n37 87\n38 88\n39 89\n40 90\n41 91\n42 92\n43 93\n44 94\n95 45\n46 96\n97 47\n98 48\n49 99\n50 100", "1 51\n2 52\n3 53\n4 54\n5 55\n56 6\n7 57\n8 58\n59 9\n10 60\n11 61\n12 62\n13 63\n14 64\n15 65\n16 66\n17 67\n18 68\n69 19\n20 70\n71 21\n72 22\n23 73\n24 74\n75 25\n26 76\n77 27\n28 78\n79 29\n30 80\n31 81\n32 82\n33 83\n34 84\n35 85\n36 86\n37 87\n38 88\n39 89\n90 40\n91 41\n42 92\n43 93\n44 94\n95 45\n46 96\n47 97\n48 98\n49 99\n50 100", "1 51\n2 52\n3 53\n4 54\n55 5\n6 56\n7 57\n8 58\n59 9\n10 60\n11 61\n12 62\n13 63\n64 14\n15 65\n16 66\n17 67\n18 68\n19 69\n70 20\n21 71\n72 22\n23 73\n24 74\n25 75\n26 76\n27 77\n78 28\n29 79\n30 80\n31 81\n32 82\n83 33\n34 84\n35 85\n36 86\n37 87\n38 88\n89 39\n90 40\n91 41\n42 92\n43 93\n44 94\n45 95\n46 96\n97 47\n48 98\n99 49\n100 50"]}	UNKNOWN	PYTHON3	CODEFORCES	40
8f73f953a8856ca3a4c9cf3d04b14148	TL	Valera wanted to prepare a Codesecrof round. He's already got one problem and he wants to set a time limit (TL) on it. Valera has written n correct solutions. For each correct solution, he knows its running time (in seconds). Valera has also wrote m wrong solutions and for each wrong solution he knows its running time (in seconds). Let's suppose that Valera will set v seconds TL in the problem. Then we can say that a solution passes the system testing if its running time is at most v seconds. We can also say that a solution passes the system testing with some "extra" time if for its running time, a seconds, an inequality 2a<=≤<=v holds. As a result, Valera decided to set v seconds TL, that the following conditions are met: 1. v is a positive integer; 1. all correct solutions pass the system testing; 1. at least one correct solution passes the system testing with some "extra" time; 1. all wrong solutions do not pass the system testing; 1. value v is minimum among all TLs, for which points 1, 2, 3, 4 hold. Help Valera and find the most suitable TL or else state that such TL doesn't exist. The first line contains two integers n, m (1<=≤<=n,<=m<=≤<=100). The second line contains n space-separated positive integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=100) — the running time of each of the n correct solutions in seconds. The third line contains m space-separated positive integers b1,<=b2,<=...,<=bm (1<=≤<=bi<=≤<=100) — the running time of each of m wrong solutions in seconds. If there is a valid TL value, print it. Otherwise, print -1. Sample Input 3 6 4 5 2 8 9 6 10 7 11 3 1 3 4 5 6 Sample Output 5-1	[ "n, m = map(int, input().split())\r\ngood = list(map(int, input().split()))\r\nbad = list(map(int, input().split()))\r\nminimum_g, maximum_g = min(good), max(good)\r\nminimum_time = -1\r\nif(minimum_g == maximum_g):\r\n minimum_time = 2minimum_g\r\nelse:\r\n minimum_time = max(2minimum_g, maximum_g)\r\n\r\nif(min(bad)<=minimum_time):\r\n print(-1)\r\nelse:\r\n print(minimum_time)", "n , m = map(int,input().split())\r\ncans = list(map(int,input().split()))\r\nwans = list(map(int,input().split()))\r\nv = max(min(cans) * 2 , max(cans))\r\nif v < min(wans):\r\n print(v)\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nb = list(map(int, input().split()))\r\nb.sort()\r\nres = max(2 * a[0], a[-1])\r\nprint(res if res < b[0] else -1)\r\n", "n,k = list(map(int,input().split(\" \")))\r\nvalid = list(map(int,input().split(\" \")))\r\ninvalid = list(map(int,input().split(\" \")))\r\n\r\nminValid = min(valid)\r\nmaxValid = max(valid)\r\nminInvalid = min(invalid)\r\n\r\nif maxValid < minInvalid and maxValid > 0:\r\n if 2minValid <= maxValid:\r\n print(maxValid)\r\n elif 2minValid < minInvalid:\r\n print(2minValid)\r\n else:\r\n print(\"-1\")\r\nelse:\r\n print(\"-1\")\r\n", "n, m = map(int, input().split())\n\na = list(map(int, input().split()))\n\nb = list(map(int, input().split()))\n\nM = max(a)\nm = min(a)\n\nm_b = min(b)\n\nif 2m >= m_b or M >= m_b:\n print(-1)\n\nelse:\n print(max(2m, M)) \n", "input()\na = list(map(int, input().split()))\nb = max(max(a), min(a)2)\nif b < min(list(map(int, input().split()))):\n print(b)\nelse:\n print(-1)\n\n", "n, m = input().split()\nn = int (n)\nm = int (m)\n#k = int (k)\n#s = input()\n#n = int(input())\n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\n#x1, y1, x2, y2 =map(int,input().split())\n#n = int(input())\n#f = []\n#f = [0]n\n#t = [0]n\n#f = []\n \n#h = [\"\"] * n\n#f1 = sorted(f, key = lambda tup: tup[0])\n\n#f1 = sorted(t, key = lambda tup: tup[0])\no = max(max(a), min(a)2)\nu = min(b)\nif (u <= o):\n print(-1)\nelse:\n print(o)\n", "def main():\r\n from sys import stdin, stdout\r\n\r\n n, m = map(int,stdin.readline().split())\r\n right = sorted(list(map(int,stdin.readline().split())))\r\n wrong = sorted(list(map(int,stdin.readline().split())))\r\n\r\n ans = max(right[0]2,right[-1])\r\n if ans >= wrong[0]:\r\n stdout.write('-1\\n')\r\n else:\r\n stdout.write(str(ans)+'\\n')\r\n \r\n\r\nif __name__=='__main__':\r\n main()\r\n", "input()\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nv, p, q = min(a), max(a), min(b)\r\nans = max(2 * v, p)\r\nprint(ans if q > ans else -1)\r\n", "n, m = map(int, input().split())\n\npas = list(map(int, input().split()))\nfail = list(map(int, input().split()))\n\nk = max(pas)\nt = min(pas)\nk = max(k, 2t)\np = min(fail)\nprint(k if p>k else -1)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=list(map(int,input().split())) \r\nv=min(l)\r\np=max(l)\r\nc=min(s)\r\nif max(v2,p)<c:\r\n print(max(v2,p))\r\nelse:\r\n print(-1)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nv = max(max(a),2min(a))\r\nif v<min(b):\r\n print(v)\r\nelse:\r\n print('-1') \r\n", "n,m = map(int,input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nl = min(a)\np = max(a)\nc = min(b)\nmim = max(2l,p)\nif mim < c:\n print(mim)\nelse:\n print(-1)\n\t \t\t\t \t \t \t\t\t \t \t\t\t \t\t\t", "n,m=map(int,input().split())\nls1=[int(a) for a in input().split()]\nls2=[int(a) for a in input().split()]\nif min(ls1)2<min(ls2) and max(ls1)<min(ls2):\n print(max(min(ls1)2,max(ls1)))\nelse:\n print(-1)\n \n", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nans = 0;\r\nans = min(a)2\r\nif max(a) > ans :\r\n ans = max(a)\r\np = min(b) - 1\r\nif p <ans :\r\n print(-1)\r\nelse:\r\n print(ans)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nl.sort()\r\nl1.sort()\r\nt1=max(l[n-1],2l[0])\r\nif t1<l1[0]:\r\n print(t1)\r\nelse:\r\n print(-1)", "x = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\na = []\r\nb = []\r\nk = 0\r\n\r\nx = input().split()\r\nfor i in range(n):\r\n tmp = int(x[i])\r\n a.append(tmp)\r\n\r\nx = input().split()\r\nfor i in range(m):\r\n tmp = int(x[i])\r\n b.append(tmp)\r\n\r\nk = max(2min(a), max(a))\r\nif k < min(b):\r\n print(k)\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nv = min(a)\r\np = max(a)\r\nc = min(b)\r\nif max(2v, p) < c:\r\n print(max(2v, p))\r\nelse:\r\n print(\"-1\")", "n,m = [int(i) for i in input().split()]\r\n\r\narr_c = [int(i) for i in input().split()]\r\narr_w = [int(i) for i in input().split()]\r\n\r\nvmax = min(arr_w) - 1\r\nvmin = max(arr_c)\r\nlowest = min(arr_c)\r\n\r\nans = -1\r\n\r\nfor i in range(vmin, vmax+1):\r\n if 2lowest <= i:\r\n ans = i\r\n break\r\nprint(ans)\r\n\r\n", "# It's all about what U BELIEVE\ndef gint(): return int(input())\ndef gint_arr(): return list(map(int, input().split()))\ndef gfloat(): return float(input())\ndef gfloat_arr(): return list(map(float, input().split()))\ndef pair_int(): return map(int, input().split())\n###############################################################################\nINF = (1 << 31)\ndx = [-1, 0, 1, 0]\ndy = [ 0, 1, 0, -1]\n###############################################################################\n############################ SOLUTION IS COMING ###############################\n###############################################################################\nn, m = gint_arr()\na = gint_arr()\na.sort()\nb = gint_arr()\nb.sort()\nres = a[n - 1]\nwhile a[0] 2 > res:\n res += 1\n\nif res >= b[0]:\n print(\"-1\")\nelse:\n print(res)\n", "n, m = map(int, input().split())\n\narr1 = list(map(int, input().split()))\narr2= list(map(int, input().split()))\n\nmax_arr1 = max(arr1)\nmin_arr1 = min(arr1)\n\nmin_arr2 = min(arr2)\n\nif max_arr1 < min_arr2:\n if min_arr12 <= max_arr1:\n print(max_arr1)\n elif min_arr12 < min_arr2:\n print(min_arr12)\n else:\n print(-1)\nelse:\n print(-1)\n", "n,m=map(int,input().split())\r\na=list(map(int,input().rstrip().rsplit()))\r\nb=list(map(int,input().rstrip().rsplit()))\r\np=min(a)\r\nx=max(a)\r\ny=min(b)\r\nif(max(x,p2)<y):\r\n print(max(x,p2))\r\nelse:\r\n print(-1)\r\n", "import sys\r\nINF = 1020\r\nMOD = 109 + 7\r\nI = lambda:list(map(int,input().split()))\r\nfrom math import gcd\r\nfrom math import ceil\r\nfrom collections import defaultdict as dd, Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\n\r\n\r\n\"\"\"\r\nFacts and Data representation\r\nConstructive? Top bottom up down\r\n\"\"\"\r\nn, m = I()\r\na = sorted(I())\r\nb = sorted(I())\r\nans = max(2 a[0], a[-1])\r\nif b[0] > ans:\r\n print(ans)\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\nls_1 = list(map(int, input().split()))\r\nls_2 = list(map(int, input().split()))\r\nv = max(2min(ls_1), ls_1)\r\nprint(v if v < min(ls_2) else -1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=0\r\nfor i in range(100):\r\n if c>=2min(a) and c>=max(a) and c<min(b):\r\n print(c)\r\n break\r\n else:\r\n c+=1\r\nif c==100:\r\n print(\"-1\")", "n , m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\n\r\nres = max(min(c)2, max(c))\r\nif res < min(w):\r\n print(res)\r\nelse:\r\n print(-1)", "'''\r\ni should've implement it in c++\r\n'''\r\n\r\n\r\nn,m = map(int,input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nv = min(a)\r\np = max(a)\r\nc = min(b)\r\nass = max(2v,p)\r\nif ass < c:\r\n print(ass)\r\nelse:\r\n print(-1)\r\n", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nv = min(a)\r\np = max(a)\r\nc = min(b)\r\nif max(2v,p) < c:\r\n print(max(2v,p))\r\nelse:\r\n print(-1)", "import os,sys,io,math\r\nfrom tokenize import Triple\r\nfrom array import array\r\nfrom math import \r\nI=lambda:[map(int,sys.stdin.readline().split())]\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\nn,m=map(int,input().split())\r\na=I()\r\nb=I()\r\nc=min(a)\r\nd=min(b)\r\nv=max(a)\r\nprint(max(2c,v) if max(2c,v)<d else -1)", "n,m=map(int,input().split())\r\nlstn=[int(x) for x in input().split()]\r\nlstm=[int(x) for x in input().split()]\r\nmaxi,mini,pos=max(lstn),min(lstm),min(lstn)\r\nif maxi>=mini:print(-1)\r\nelif 2pos>mini-1:print(-1)\r\nelse:\r\n for i in range(maxi,mini):\r\n if 2pos<=i:\r\n print(i)\r\n break\r\n else:print(-1)\r\n", "a,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nif(max(min(x)2,max(x))<min(y)):\r\n print(max(min(x)2,max(x)))\r\nelse:\r\n print(\"-1\")", "import math, re, sys, string, operator, functools, fractions, collections\nsys.setrecursionlimit(107)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda x=' ': list(map(int,input().split(x)))\nRS=lambda x=' ': input().rstrip().split(x)\nmod=int(1e9+7)\neps=1e-6\npi=math.acos(-1.0)\n#################################################\nRI()\nA=RI()\nB=RI()\nv=max(A)\nvm=min(A)\na=max((2vm),v)\nif min(B)<=a:\n print(-1)\nelse:\n print(a)\n\n", "n,m = map(int , input().split())\r\na = list(map(int , input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nx = max(min(a)2,max(a))\r\nif min(b)>x:\r\n print(x)\r\nelse:\r\n print(-1)\r\n\r\n", "n, m = map(int, input().split())\r\nright = sorted([int(i) for i in input().split()])\r\nwrong = sorted([int(i) for i in input().split()])\r\n\r\nif (max(right) >= min(wrong)) or (2min(right) >= min(wrong)):\r\n print(-1)\r\nelse:\r\n print(max(max(right), 2min(right)))\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=(map(int,input().split()))\r\nv=max(max(a),2min(a))\r\nif v<min(b):print(v)\r\nelse:print(-1)", "n,m=map(int,input().split())\nN=list(map(int,input().split()))\nM=list(map(int,input().split()))\n\nN.sort()\nM.sort()\n\na=N[-1]\nans=-1\nfor i in range(a,M[0]):\n if(i>=2N[0]):\n ans=i\n break\nprint(ans)\n", "def check(n,arr):\r\n n=n//2\r\n m3=min(arr)\r\n if(m3<=n):\r\n return True\r\n else:\r\n False\r\n\r\n\r\nn,m=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nbrr=list(map(int,input().split()))\r\n\r\nm1=max(arr)\r\nm2=min(brr)\r\nans=0\r\nif(m2<=m1):\r\n print(-1)\r\n\r\nelse:\r\n flag=0\r\n while(m1<m2):\r\n if(check(m1,arr)):\r\n ans=m1\r\n flag=1\r\n break\r\n\r\n\r\n m1+=1\r\n\r\n if(flag==0):\r\n print(-1)\r\n\r\n else:\r\n print(ans)\r\n\r\n", "n,m = map(int, input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ntl=-1\r\nfor i in range(max(a),min(b)):\r\n if 2min(a)<=i:\r\n tl=i\r\n break\r\nprint(tl)", "line = list(map(int,input().split()))\r\nn = line[0]\r\nm = line[1]\r\ncorr = list(map(int,input().split()))\r\ncorr.sort()\r\nwrong = list(map(int,input().split()))\r\nwrong.sort()\r\nl = corr[0]\r\nr = corr[-1]\r\nk = wrong[0]\r\nif ((r >= k) or (k <= (2 * l))):\r\n print(-1)\r\nelse:\r\n l = 2 * l\r\n if(r > l):\r\n print(r)\r\n else:\r\n print(l)\r\n ", "s = input()\r\nar = s.split()\r\nn = int(ar[0])\r\nm = int(ar[1])\r\na = []\r\nb = []\r\ns = input()\r\nfor i in s.split():\r\n a += [int(i)]\r\ns = input()\r\nfor i in s.split():\r\n b += [int(i)]\r\n\r\nif max(min(a) * 2, max(a)) < min(b):\r\n print(max(min(a) * 2, max(a)))\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "import sys,os,io,time,copy,math\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\n\r\ndef main():\r\n n,m=map(int,input().split())\r\n correct=list(map(int,input().split()))\r\n wrong=list(map(int,input().split()))\r\n if max(correct)<min(wrong):\r\n a=min(correct)\r\n for v in range(max(correct),min(wrong)):\r\n if 2a<=v:\r\n print(v)\r\n return\r\n print(-1)\r\n else:\r\n print(-1)\r\n\r\nmain()\r\n\r\n", "import math\r\nimport string\r\n\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n b = [int(i) for i in input().split(\" \")]\r\n min_val = max(max(a), 2 min(a))\r\n min_val_2 = min(b)\r\n if min_val >= min_val_2:\r\n print(-1)\r\n else:\r\n print(min_val)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nx,y,z=min(l),max(l),min(d)\r\nxx=max(2x,y)\r\nif(xx<z):\r\n print(xx)\r\nelse:\r\n print(-1)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nmaxa = 0\r\nmina = 101\r\nfor i in a:\r\n if i > maxa:\r\n maxa = i\r\n if i < mina:\r\n mina = i\r\nminb = 101\r\nfor i in b:\r\n if i < minb:\r\n minb = i\r\nif max(mina 2, maxa) >= minb:\r\n print(-1)\r\nelse:\r\n print(max(mina * 2, maxa))\r\n ", "input()\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nprint(max(2 * min(a), max(a)) if max(2 * min(a), max(a)) < min(b) else -1)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nz=list(map(int,input().split()))\r\nglag=0\r\nfor i in range(1,min(z)):\r\n count=0\r\n glag=0\r\n for j in range(len(a)):\r\n if(a[j]>i):\r\n glag=1\r\n break;\r\n else:\r\n if(a[j]2<=i):\r\n count+=1\r\n if(count>=1 and glag==0):\r\n print(i)\r\n exit()\r\nprint(-1)\r\n \r\n", "from math import \r\n#from bisect import \r\n#from collections import \r\n#from random import \r\n#from decimal import \"\"\"\r\n#from heapq import \r\n#from random import \r\nimport sys\r\ninput=sys.stdin.readline\r\n#sys.setrecursionlimit(3(105))\r\nglobal flag\r\ndef inp():\r\n return int(input())\r\ndef st():\r\n return input().rstrip('\\n')\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\nt=1\r\nwhile(t):\r\n t-=1\r\n n,m=ma()\r\n a=lis()\r\n b=lis()\r\n c=max(2min(a),max(a))\r\n if(min(b)<=c):\r\n print(-1)\r\n else:\r\n print(c)\r\n \r\n \r\n", "c, w = map(int, input().split())\r\ncorrect = sorted(list(map(int, input().split())))\r\nwrong = sorted(list(map(int, input().split())))\r\nmin_TL = correct[0] * 2\r\nfor i in correct:\r\n min_TL = max(min_TL, i)\r\nif wrong[0] <= min_TL:\r\n print(-1)\r\nelse:\r\n print(min_TL)\r\n", "input()\r\ncrt=list(map(int,input().split()))\r\nwrn=list(map(int,input().split()))\r\nleast_crt=min(crt)\r\nmax_crt=max(crt)\r\nul=min(wrn)\r\ntl=max(2least_crt,max_crt)\r\nif tl<ul:\r\n print(tl)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nif max(max(l),min(l)2)<min(l1) :\r\n print(max(max(l),min(l)2))\r\nelse :\r\n print(-1)\r\n", "n,m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nw = list(map(int,input().split()))\r\n\r\nma = max(c)\r\nmi = min(w)\r\nck = max(min(c)2,ma)\r\nif(mi>ck):\r\n print(ck)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\np=list(map(int,input().split()))\r\nf=list(map(int,input().split()))\r\np.sort()\r\nf.sort()\r\nc=0\r\nfor t in range(p[-1],f[0]):\r\n if(2p[0]<=t):\r\n print(t)\r\n c=-1\r\n break\r\nif(c==0):\r\n print(-1)", "def main():\n n, m = list(map(int, input().split(' ')))\n good = list(map(int, input().split(' ')))\n bad = list(map(int, input().split(' ')))\n\n max_good = max(good)\n min_bad = min(bad)\n if max_good >= min_bad:\n print(-1)\n return\n\n smallest = min(good)\n max_good = max(max_good, 2smallest)\n\n print(max_good if max_good < min_bad else -1)\n\n\nif __name__ == \"__main__\":\n main()\n", "n, m = map(int, input().split())\r\nr = [int(x) for x in input().split()]\r\nw = [int(x) for x in input().split()]\r\nr.sort()\r\nw.sort()\r\na = r[0]\r\nb = r[-1]\r\nc = w[0]\r\nif 2a < c and b < c:\r\n print(max(2a, b))\r\nelse:\r\n print(-1)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nmaxiA = max(a)\r\nminiA = min(a)\r\nminiB = min(b)\r\nans = -1\r\nif max(2miniA, maxiA) < miniB:\r\n ans = max(maxiA, 2miniA)\r\nelse:\r\n ans = -1\r\nprint(ans)", "n, m = [int(x) for x in input().split()]\nl = [int(x) for x in input().split()]\na = max(l)\nq = min(l)\nb = min(int(x) for x in input().split())\nif q * 2 < b and a < b:\n\tprint(max(a, q * 2))\nelse:\n\tprint(-1)\n", "[n, m] = map(int, input().split());\r\n\r\npassed = list(map(int, input().split()))\r\nunpassed = list(map(int, input().split()))\r\n\r\nmax_p = max(passed)\r\nmin_p2 = 2min(passed)\r\nmin_up = min(unpassed)\r\n\r\nif max_p >= min_up or min_p2 >= min_up:\r\n\tv = -1\r\nelse:\r\n\tv = min_p2 if min_p2 >= max_p else max_p\r\nprint(v)\r\n", "R = lambda: list(map(int, input().split()))\r\n \r\nn, m = R()\r\n \r\na = R()\r\n \r\nb = R()\r\n \r\nv = max(2 min(a), max(a))\r\n \r\nprint(v if v < min(b) else -1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nans = -1\r\n\r\nfor v in range(1, 201):\r\n f1 = True\r\n f2 = False\r\n for i in range(n):\r\n if a[i] > v:\r\n f1 = False\r\n if 2 * a[i] <= v:\r\n f2 = True\r\n\r\n f3 = True\r\n for i in range(m):\r\n if b[i] <= v:\r\n f3 = False\r\n\r\n if f1 and f2 and f3:\r\n ans = v\r\n break\r\n\r\nprint(ans) \r\n \r\n \r\n", "n,m=map(int,input().split(\" \"))\r\nl1=list(map(int,input().split(\" \")))\r\nl2=list(map(int,input().split(\" \")))\r\n\r\nl1.sort()\r\nl2.sort()\r\ntmin = 2 * l1[0];\r\ntmin = max(tmin, l1[n - 1]);\r\nval=-1 if (l2[0] <= tmin) else tmin\r\nprint(val)\r\n", "n,m = input().split(' ')\r\nn = int(n)\r\nm = int(m)\r\n\r\na = input().split(' ')\r\nfor i in range(0,n):\r\n a[i] = int(a[i])\r\n\r\nb = input().split(' ')\r\nfor i in range(0,m):\r\n b[i] = int(b[i])\r\n\r\na.sort()\r\nb.sort()\r\n\r\nv = max(a)\r\nk = min(a)\r\nc = min(b)\r\n\r\nif max(2k,v) < c:\r\n print(max(2k,v))\r\nelse:\r\n print(-1)", "n,m=map(int,input().split(\" \"))\r\nl1=list(map(int,input().split(\" \")))\r\nl2=list(map(int,input().split(\" \")))\r\n\r\nmax_1=max(l1)\r\nmin_1=min(l1)\r\nmin_2=min(l2)\r\ntmin = 2 * min_1\r\n\r\ntmin = max(tmin, max_1)\r\n\r\nif (min_2 <= tmin):\r\n\tprint(-1)\r\nelse:\r\n\tprint(tmin)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif max(max(a), 2min(a)) < min(b):\r\n print(max(max(a), 2min(a)))\r\nelse:\r\n print(-1)\r\n", "n, m = map(int, input().split())\r\n\r\ncorrect = list(map(int, input().split()))\r\nincorrect = list(map(int, input().split()))\r\n\r\n\r\nret = max(max(correct), 2min(correct))\r\n\r\n\r\n\r\nif min(incorrect) <= ret:\r\n print(-1)\r\nelse:\r\n print(ret)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nv=min(a)\r\nq=max(a)\r\nd=min(b)\r\nif max(2v,q)<d:\r\n print(max(2v,q))\r\nelse:\r\n print(-1)", "def find(arr1,arr2):\r\n min1=min(arr1)\r\n min2=min(arr2)\r\n max1=max(arr1)\r\n max2=max(arr2)\r\n if(min12< min2 and max1<min2):\r\n return max(min12,max1)\r\n else:\r\n return -1\r\nfrom collections import defaultdict\r\nfrom math import ceil\r\nn,k=map(int,input().split())\r\narr1=list(map(int,input().split()))\r\narr2=list(map(int,input().split()))\r\nprint(find(arr1,arr2))\r\n", "m, n = map(int, input().split())\r\ntrues, falses = list(map(int, input().split())), list(map(int, input().split()))\r\nv = max(2 min(trues), max(trues))\r\nif v < min(falses):\r\n print(v)\r\nelse:\r\n print(-1)", "n , m= map(int,input().split())\narr1 = list(map(int,input().split()))\nmaxi =arr1[0]\nmini = arr1[0]\nfor i in arr1:\n if i>maxi:\n maxi =i\n if i<mini:\n mini = i\narr2 = list(map(int,input().split()))\nmini2 = min(arr2)\nm = 2mini\nif(m>maxi):\n maxi = m\nif(mini2<=maxi):\n print(-1)\nelse:\n print(maxi)\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\nam = a[0]\r\nbm = min(b)\r\ni = b[0] - 1\r\nwhile i >= 2am and a[-1] <= i and i > 0:\r\n i -= 1\r\ni+=1\r\nif i == 0 or not(i >= 2am and a[-1] <= i and i > 0) or bm <= i:\r\n print(-1)\r\nelse:\r\n print(i)", "n,m =map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nv=min(a)\r\np=max(a)\r\nc=min(b)\r\n\r\nif max(2v,p)<c:\r\n ans=max(2v,p)\r\nelse:\r\n ans=-1\r\n \r\nprint(ans)\r\n", "n,m = map(int,input().split())\r\nAC = list(map(int, input().split()))\r\nWA = list(map(int, input().split()))\r\na = max(AC)\r\nb = min(AC)\r\nc = min(WA)\r\nif max(2b, a) < c:\r\n print (max(2b,a))\r\nelse:\r\n print(-1)", "n,m = map(int, input().split())\r\nAC = list(map(int, input().split()))\r\nWA = list(map(int, input().split()))\r\nslowest = max(AC)\r\nfastest = min(AC)\r\n\r\nfastest_wrong = min(WA)\r\ndef sim(v):\r\n extraTime = fastest 2 <= v\r\n if not (extraTime):\r\n return False\r\n passes = slowest <= v\r\n no_wrong = fastest_wrong > v\r\n if(passes and no_wrong):\r\n return True\r\n\r\nfor i in range(1, 101):\r\n if(sim(i)):\r\n print(i)\r\n break\r\nelse:\r\n print(-1)\r\n", "from sys import stdin,stdout\r\nimport math\r\nn,m=map(int,stdin.readline().split())\r\nAC=list(map(int,stdin.readline().split()))\r\nWA=list(map(int,stdin.readline().split()))\r\nx,y,z=min(AC),max(AC),min(WA)\r\nif y>=z or 2x>=z:\r\n print(-1)\r\nelse:\r\n print(max(2x,y))", "n, m = map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nm1 = min(a)\r\nm2 = max(a)\r\n\r\nval = max(m12, m2)\r\n\r\nm3 = min(b)\r\n\r\nif(val<m3):\r\n print(val)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif max(a)>=min(b) or 2min(a)>=min(b):\r\n print(\"-1\")\r\nelse:\r\n acre=max(a)\r\n while True:\r\n if acre>=min(b):\r\n print(\"-1\")\r\n break\r\n elif acre>=2min(a):\r\n print(acre)\r\n break\r\n else:\r\n acre+=1\r\n", "a,b=map(int,input().split())\r\na_arr=list(map(int,input().split()))\r\nb_arr=list(map(int,input().split()))\r\nv=min(a_arr)\r\np=max(a_arr)\r\nc=min(b_arr)\r\nif max(2v,p)<c:\r\n\tprint(max(2v,p))\r\nelse:\r\n\tprint(-1)\t", "n,m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nif max(2min(a),max(a)) < min(b):\r\n print(max(2min(a),max(a)))\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\nans=max(2min(c),max(c))\r\nif min(w)<=ans:\r\n\tprint(-1)\r\nelse:\r\n\tprint(ans)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nans = max(2min(a),max(a))\r\nif ans < min(b):\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n, m = map(int,input().split(\" \"))\r\ncorrect = list(map(int, input().split(\" \")))\r\nwrong = list(map(int, input().split(\" \")))\r\n\r\nmin_possible_v = 2(min(correct))\r\nmin_correct = max(correct)\r\nmax_possible = min(wrong)\r\n\r\nif min_correct >= max_possible:\r\n print(-1)\r\nelse:\r\n if min_possible_v >= max_possible:\r\n print(-1)\r\n else:\r\n print(max(min_possible_v, min_correct))", "import sys\r\nfrom collections import defaultdict as dd\r\ndef read():\r\n return sys.stdin.readline().strip()\r\ndef write(a):\r\n sys.stdout.write(a)\r\ndef main():\r\n n, m = [int(i) for i in read().split()]\r\n a = [int(i) for i in read().split()]\r\n b = [int(i) for i in read().split()]\r\n v1, v2 = max(min(a)2, max(a)), min(b)\r\n if v2 > v1:\r\n print(v1)\r\n else:\r\n print(-1)\r\nmain()\r\n", "n,m = map(int,input().split())\r\ncorrect = list(map(int, input().split()))[:n]\r\nwrong = list(map(int,input().split()))[:m]\r\nmn = min(correct)\r\nmx = max(correct)\r\nmx = max(mx, 2mn)\r\nmn = min(wrong)\r\nif mx<mn:\r\n print(mx)\r\nelse:\r\n print(-1)", "if __name__=='__main__':\r\n n,m = list(map(int,input().split()))\r\n c = list(map(int,input().split()))\r\n w = list(map(int,input().split()))\r\n k = min(c)\r\n exp = max(c)\r\n bel = min(w)\r\n time = list(range(exp,bel))\r\n if len(time)==0:\r\n print(\"-1\")\r\n elif 2k<=max(time):\r\n c.append(2k)\r\n print(max(c))\r\n else:\r\n print(\"-1\") \r\n", "n,m = map (int, input().split())\nxs = list (map (int, input().split()))\nys = list (map (int, input().split()))\nac = max (2min(xs), max(xs))\nwa = min (ys)\nif (ac < wa): \n print (ac)\nelse:\n print (-1)\n", "n,m=map(int,input().split())\r\ncorrect=list(map(int,input().split()))\r\nincorrect=list(map(int,input().split()))\r\nmax_cor=max(2min(correct),max(correct))\r\nmin_cor=min(incorrect)\r\nif(max_cor<min_cor):\r\n print(max_cor)\r\nelse:\r\n print(\"-1\")\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nstat =False\r\nif max(a)<2min(a):\r\n v=2min(a)\r\nelse:v=max(a)\r\nif v<1:\r\n print(-1)\r\nelif v>=min(b):\r\n print(-1)\r\nelif 2min(a)>v:\r\n print(-1)\r\nelse:print(v)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[min(a)2,min(b)-1,max(a)];c.sort()\r\nfor i in c:\r\n if i>=max(a) and min(a)<=i/2 and min(b)>i:\r\n print(i)\r\n exit(0)\r\nprint(-1)", "\r\nn, m = map(int, input().split())\r\nnl = list(map(int, input().split()))\r\nml = list(map(int, input().split()))\r\n\r\nmv1 = min(nl)2\r\nmv2 = max(nl)\r\nmv3 = min(ml)\r\n\r\nif mv3 <= max(mv1, mv2):\r\n print(-1)\r\nelse:\r\n print(max(mv1, mv2))", "a,b=map(int,input().split())\narr1=list(map(int,input().split()))\narr2=list(map(int,input().split()))\nn=max(min(arr1)2,max(arr1))\nif n<min(arr2):\n print(n)\nelse:\n print(\"-1\")\n\t \t \t\t\t \t \t \t \t \t\t \t \t \t", "n,m = input().split()\r\na = eval(input().replace(\" \", \",\")+',')\r\nb = eval(input().replace(\" \", \",\")+',')\r\nv = max(max(a), min(a) * 2)\r\nif(v < min(b)):\r\n print(v)\r\nelse:\r\n print(-1)\r\n", "I=lambda:list(map(int,input().split()))\r\nn,k=I()\r\nl=I()\r\nt = I()\r\nv = min(l)\r\np = max(l)\r\nc = min(t)\r\nif max(2v,p)<c:\r\n print(max(2v,p))\r\nelse:\r\n print(-1)", "n = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\nq = list(map(int, input().split()))\r\nv = min(p)\r\nr = max(p)\r\nc = min(q)\r\nif max(v2, r)<c:\r\n print(max(v2, r))\r\nelse:\r\n print(\"-1\")", "def solve():\r\n\tfor v in range(a, b):\r\n\t\tfor i in arr:\r\n\t\t\tif(i2 <= v):\r\n\t\t\t\treturn v\r\n\treturn -1\r\nn,m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nbrr = list(map(int, input().split()))\r\na, b= max(arr),min(brr)\r\nprint(solve())", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nv=min(x)\r\np=max(x)\r\nq=min(y)\r\nt=max(2v,p)\r\nif(t<q):\r\n print(t)\r\nelse:\r\n print(-1)\r\n", "if __name__ == '__main__':\r\n\tn, m = [int(i) for i in input().split()]\r\n\tcorrectList = [int(i) for i in input().split()]\r\n\twrongList = [int(i) for i in input().split()]\r\n\tTL = -1\r\n\tfor i in range(max(correctList), min(wrongList)):\r\n\t\tif 2 * min(correctList) <= i and i < min(wrongList):\r\n\t\t\tTL = i\r\n\t\t\tbreak\r\n\tprint(TL) ", "n,m = [int(item) for item in input().split()]\r\nan = list(map(int,input().split()))\r\nam = list(map(int,input().split()))\r\ncount = 0\r\nv = max(an)\r\nfor i in range(len(an)):\r\n if len(an)>1:\r\n if 2an[i]<=v:\r\n count+=1\r\n elif i==len(an)-1 and count<1:\r\n v = 2min(an)\r\n count+=1\r\n else:\r\n v = 2min(an)\r\n count+=1\r\nif min(am)>v and count>=1:\r\n print(v)\r\nelse:\r\n print(-1)", "\n# 350 A. TL\n\nn,m = map(int,input().split())\nns = [int(i) for i in input().split()]\nms = [int(i) for i in input().split()]\nmin_1 = min(ms) -1 \n\nnew_mins = []\n\nif max(ns) > min_1:\n print(-1)\n exit()\n\nnew_min_lower = max(ns)\nnew_min_upper = min_1\n\nfor i in range(new_min_lower,new_min_upper+1):\n flag = 0\n for j in ns:\n if 2j <= i:\n flag = 1\n break\n if flag == 1:\n new_mins.append(i)\nif len(new_mins) ==0:\n print(-1)\nelse:\n print(min(new_mins))\n \n\n\n \n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nq = list(map(int, input().split()))\r\n\r\nx = max(min(w)2, max(w))\r\nif x < min(q):\r\n print(x)\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\n\r\na = [int(k) for k in input().split()]\r\nb = [int(k) for k in input().split()]\r\n\r\n\r\nmax_a = max(a)\r\nmin_a = min(a)\r\nmin_b = min(b)\r\n\r\n\r\nv = max(2 min_a, max_a)\r\n\r\n# Check if v is less than min_b, else there is no valid TL\r\nif v < min_b:\r\n print(v)\r\nelse:\r\n print(-1)", "n, m =map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nx = min(a)\r\ny = max(a)\r\nz = min(b)\r\nif max(2x, y)<z:\r\n print(max(2x, y))\r\nelse:\r\n print(\"-1\")", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nif min(b)>max(a) :\r\n if min(a)2 < min(b) :\r\n if min(a)2 <= max(a) :\r\n print(max(a))\r\n else:\r\n print(min(a)2)\r\n else:\r\n print(-1)\r\nelif min(b)<= max(a):\r\n print(-1)\r\n", "a, b = map(int, input().split())\nvernoe = list(map(int, input().split()))\nneverno = list(map(int, input().split()))\nvernoe = sorted(vernoe)\nneverno = sorted(neverno)\nflag = False\nfor i in range(vernoe[-1], neverno[0]):\n if i >= vernoe[-1] and i >= vernoe[0] 2 and i < neverno[0]:\n z = i\n flag = True\n break\nif flag:\n print(z)\nelse:\n print(-1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nx=max(a)\r\nz=min(a)\r\ny=min(b)\r\nfor i in range(x,y):\r\n if i>=2z:\r\n print(i)\r\n exit(0)\r\nprint(-1)\r\n \r\n", "n, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\nans = max(max(a), 2min(a))\r\nif ans < min(b):\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\nb = list(map(int, input().split()))\r\nb = sorted(b)\r\nindex = n-1\r\nans = -1\r\nwhile index >= 0:\r\n if a[index]2 < b[0] and a[index]2 >= a[n-1] and a[index]2 >= a[0]2:\r\n ans = a[index]2\r\n if a[index] < b[0] and a[index] >= a[n-1] and a[index] >= a[0]2:\r\n ans = a[index]\r\n index -= 1\r\nprint(ans)", "n, m = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\np = max(2min(a), max(a))\r\nif p < min(b):\r\n print(p)\r\nelse:\r\n print(-1)\r\n", "input().split()\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\np=-1\r\ns=max(2min(a), max(a))\r\nif s<min(b):\r\n\tp=s\r\nprint(p)", "if __name__=='__main__':\n arr = input().split(' ')\n n = int(arr[0])\n m = int(arr[1])\n arr = input().split(' ')\n Lc = []\n Li = []\n for a in arr:\n Lc.append(int(a))\n arr = input().split(' ')\n for a in arr:\n Li.append(int(a))\n Lc.sort()\n Li.sort()\n ans = -1\n if Lc[-1]>=Li[0] or Li[0]<=2Lc[0]:\n ans = -1\n else:\n ans=max(2Lc[0],Lc[-1])\n print(ans)\n", "n, m = [int(x) for x in input().split()]\r\narrn = [int(x) for x in input().split()]\r\narrm = [int(x) for x in input().split()]\r\n\r\nminCT = min(arrn)\r\nmaxCT = max(arrn)\r\nminWT = min(arrm)\r\n# print(minCT, maxCT, minWT)\r\nif minCT2 < minWT:\r\n if maxCT < minWT:\r\n if maxCT > minCT2:\r\n print(maxCT)\r\n else:\r\n print(minCT2)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)\r\n", "n, k = map(int, input().split())\r\n\r\ncorrect = [int(i) for i in input().split()]\r\nwrong = [int(i) for i in input().split()]\r\n\r\nmin_wrong = min(wrong)\r\n\r\ncorrect.sort()\r\nmin_correct = 2 correct[0]\r\ntl = correct[len(correct)-1]\r\n\r\nflag = False\r\n\r\nif len(correct)== 1 or (min_correct > tl and min_correct < min_wrong):\r\n tl = min_correct\r\n\r\nif min_correct <= tl and tl < min_wrong:\r\n print(tl)\r\nelse:\r\n print(-1)", "n, m= map(int, input().split())\r\na= list(map(int, input().split()))\r\nb= list(map(int, input().split()))\r\np= max(a)\r\nq= min(a)2\r\nr= max(p, q)\r\n\r\nif min(b) <= r:\r\n print(-1)\r\nelse:\r\n print(r)", "n, m = [int(item) for item in input().split()]\r\na = [int(item) for item in input().split()]\r\nb = [int(item) for item in input().split()]\r\n\r\nmaxValue = max(a)\r\nminValue = min(a)\r\ntestValue = min(b)\r\nresult = -1\r\nif maxValue<testValue:\r\n if minValue2<=maxValue:\r\n result = maxValue\r\n elif minValue2 < testValue:\r\n result = minValue2\r\nprint(result)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nleft, right = max(a), min(b)\r\nextra = min(a)\r\nwhile left < right:\r\n if extra2 <= left:\r\n print(left)\r\n exit(0)\r\n else:\r\n left += 1\r\nprint(-1)", "n,m = map(int,input().split())\r\ncor = list(map(int,input().split()))\r\nwor = list(map(int,input().split()))\r\nl = min(cor)\r\nma = max(cor)\r\nmi = min(wor)\r\nif(ma>=mi):\r\n print(-1)\r\nelse:\r\n flag=0\r\n for i in range(ma,mi):\r\n if(i>=(2l)):\r\n print(i)\r\n flag=1\r\n break\r\n if(flag==0):\r\n print(-1)", "import sys, math, itertools, random, bisect\r\nfrom collections import defaultdict\r\nINF = sys.maxsize\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef input(): return sys.stdin.readline().strip()\r\nmod = 10*9 + 7\r\n\r\n\r\nfor _ in range(1):\r\n n,m = get_ints()\r\n a = get_array()\r\n b = get_array()\r\n a.sort()\r\n b.sort()\r\n if a[-1]>=b[0] or 2a[0]>=b[0]: print(-1)\r\n else:\r\n print(max(2a[0],a[-1]))\r\n\r\n\r\n\r\n", "n,m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\namax =max(a)\r\nbmin =min(b)\r\nif bmin<=amax:\r\n print(-1)\r\nelse:\r\n gunjaishaboveamax = (bmin-amax)-1\r\n amin =min(a)\r\n if 2amin<=amax:\r\n print(amax)\r\n elif 2amin>amax and 2amin>amax+gunjaishaboveamax:\r\n print(-1)\r\n elif 2amin<=amax+gunjaishaboveamax:\r\n print(2amin)\r\n else:\r\n print(-1)\r\n\r\n ", "def func():\n _ = input()\n a = sorted(map(int, input().split()))\n b = list(map(int, input().split()))\n x = max(a[0] * 2, a[-1])\n for y in b:\n if y <= x:\n return -1\n return x\n\nprint(func())", "def solve():\n arr1.sort()\n arr2.sort()\n v1=arr1[0]2\n v2=arr1[-1]\n v=max(v1,v2)\n if v >= arr2[0] :\n return -1\n return v\n\n\n \n\n\n \n\n \nn,m= [int(x) for x in input().split()]\narr1= [int(x) for x in input().split()]\narr2= [int(x) for x in input().split()]\nprint(solve())\n\n\n\n'''\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n'''\n'''\nn=int(input())\narr=[int(x) for x in input().split()]\n'''", "\n_, _ = map(int, input().split())\n\nl_g = list(map(int, input().split()))\nl_b = list(map(int, input().split()))\nm = min(l_g) 2\n\nfor g in l_g:\n m = max(m, g)\n\nfor b in l_b:\n if b <= m:\n print(-1)\n quit()\nprint(m)\n\t \t\t \t\t\t \t\t\t \t\t\t\t\t\t \t \t", "n,m = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nx = max(2min(a),max(a))\nprint(x if x<min(b) else -1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\nq = max(a[0] 2, a[-1])\r\nif q >= b[0]:\r\n print(-1)\r\nelse:\r\n print(q)\r\n", "temp = list(map(int, input().split()))\r\nn = temp[0]\r\nm = temp[1]\r\nlist_n = list(map(int, input().split()))\r\nlist_m = list(map(int, input().split()))\r\nv = min(list_n)\r\np = max(list_n)\r\nc = min(list_m)\r\nif max(2v,p) < c:\r\n print(max(2v,p))\r\nelse:\r\n print('-1')", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nn, m = readln()\na = readln()\nb = readln()\nans = -1\nfor v in range(max(a), min(b)):\n if [_ for _ in a if 2 * _ <= v]:\n ans = v\n break\nprint(ans)\n", "a=lambda:list(map(int,input().split()))\nn,m=a()\nb,c=a(),a()\nTL=max(2min(b),max(b))\nprint(TL if TL<min(c) else \"-1\")", "n,m = map(int,input().split(\" \"))\r\nmas1 = list(map(int,input().split(\" \")))\r\nmas2 = list(map(int,input().split(\" \")))\r\nif max(2min(mas1),max(mas1))<min(mas2):\r\n print(max(2min(mas1),max(mas1)))\r\nelse:\r\n print(-1)", "x,y=map(int,input().split(' ',1))\r\ncorrect=list(map(int,input().split(' ',x-1)))\r\nfalse=list(map(int,input().split(' ',y-1)))\r\n\r\nif max(correct)==min(false):\r\n stop=False\r\nelse:\r\n stop=False\r\n for i in range(max(correct),min(false)):\r\n if not(stop):\r\n v=i\r\n for m in correct:\r\n if (2m)<=v:\r\n print(v)\r\n stop=True\r\n break\r\n else:\r\n break\r\nif stop==False:\r\n print(-1)\r\n\r\n", "n, m = input().split()\r\nn, m = int(n), int(m)\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nv, p, c = min(a), max(a), min(b)\r\nif max(2v, p) < c:\r\n print(max(2v, p))\r\nelse:\r\n print(-1)", "input()\r\na = list(map(int, input().split()))\r\ntl = max(2 * min(a), max(a))\r\nif tl < min(list(map(int, input().split()))):\r\n print(tl)\r\nelse:\r\n print(-1)\r\n", "a, b = map(int, input().split())\ncor = list(map(int, input().split()))\nwrong = list(map(int, input().split()))\nmaxC = max(cor)\nminC = min(cor)\nminW = min(wrong)\nfor m in range(maxC, minW):\n if minC * 2 <= m:\n print(m)\n break\nelse:\n print(-1)\n \t\t\t\t \t\t\t \t \t \t\t\t\t \t\t\t\t\t\t", "#TL\r\n\r\ndata = input().split(\" \")\r\nn = int(data[0])\r\nm = int(data[1])\r\ncorrect = input().split(\" \")\r\ncorrect = [int(x) for x in correct]\r\nwrong = input().split(\" \")\r\nwrong = [int(x) for x in wrong]\r\nlimit = max(max(correct), min(correct) * 2)\r\nfor i in range(len(wrong)):\r\n\tif wrong[i] <= limit:\r\n\t\tprint(\"-1\")\r\n\t\texit(0)\r\nfor i in range(len(correct)):\r\n\tif correct[i] > limit:\r\n\t\tprint(\"-1\")\r\n\t\texit(0)\r\nprint(limit)", "n,m=map(int,input().split())\r\na=sorted(map(int,input().split()))\r\nb=sorted(map(int,input().split()))\r\nif max(a[0]2,a[-1])<b[0]: print(max(a[0]2,a[-1]))\r\nelse: print(-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\na=sorted([int(i) for i in input().split()])\r\nb=sorted([int(i) for i in input().split()])\r\nif(max(2a[0],a[n-1])>=b[0]):\r\n print(-1)\r\nelse:\r\n print(max(2a[0],a[n-1]))", "n, m = list(map(int, input().strip().split()))\nac = set(map(int, input().strip().split()))\nwa = set(map(int, input().strip().split()))\nv = max(max(ac), min(ac)2)\nif v < min(wa):\n print(v)\nelse:\n print(-1)\n", "x = input().split()\nn, m = map(int, x)\n\nr_ans = input().split()\nr_ans = list(map(int, r_ans))\nr_ans.sort()\n\nw_ans = input().split()\nw_ans = list(map(int, w_ans))\nw_ans.sort()\n\nans = -1\nv = min(r_ans)\np = max(r_ans)\nc = min(w_ans)\n\nif max([2v, p])<c:\n print (max([2v, p]))\nelse:\n print (-1)\n", "n, m = map(int, input().strip().split())\ncor = list(map(int, input().strip().split()))\nincor = list(map(int, input().strip().split()))\nmin_cor = min(cor)\nmax_cor = max(cor)\nmin_incor = min(incor)\nfor v in range(max_cor, min_incor):\n\tif min_cor2 <= v:\n\t\texit(print(v))\nprint(-1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nif max(min(a)2,max(a))<min(b):\r\n print(max(min(a)2,max(a)))\r\nelse:\r\n print(-1)", "# your code goes here\r\n\r\nstr = input()\r\nL = str.split()\r\nn = int(L[0])\r\nm = int(L[1])\r\n\r\nstr = input()\r\nL = str.split()\r\nmax1 = int(L[0])\r\nmin1 = int(L[0])\r\n\r\ni = 0\r\n\r\nwhile i<n:\r\n if max1 < int (L[i]):\r\n max1 = int (L[i])\r\n if min1 > int (L[i]):\r\n min1 = int (L[i])\r\n i+=1\r\n\r\nstr = input()\r\nL = str.split()\r\n\r\nmin = int(L[0])\r\n\r\ni = 0\r\n\r\nwhile i<m:\r\n if min > int (L[i]):\r\n min = int (L[i])\r\n i+=1\r\n\r\ni=0\r\n\r\nflag = False\r\nif max1 < min :\r\n i = max1\r\n while i<min:\r\n if 2min1<=i:\r\n print (i)\r\n flag = True\r\n i=min+1\r\n i+=1\r\n\r\nif flag == False:\r\n print (\"-1\")\r\n\r\n\r\n", "def main():\r\n n, m = map(int, input().split())\r\n arr1 = list(map(int, input().split()))\r\n arr2 = list(map(int, input().split()))\r\n\r\n\r\n for i in range(1, min(arr2)):\r\n extra = False\r\n allgood = True\r\n for j in arr1:\r\n if j > i:\r\n allgood = False\r\n break\r\n\r\n if 2 j <= i:\r\n extra = True\r\n\r\n if allgood and extra:\r\n print(i)\r\n exit()\r\n\r\n print(-1)\r\n\r\n\r\nmain()", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\nif a[-1]>=b[0]:\r\n print(-1)\r\nelif max(2a[0], a[-1])<b[0]:\r\n print(max(2a[0], a[-1]))\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\nr = sorted(list(map(int,input().split())))\r\nw = sorted(list(map(int,input().split())))\r\n\r\nif r[-1] >= w[0] :\r\n print(-1)\r\n\r\nelif 2r[0] >= w[0] :\r\n print(-1)\r\n \r\nelse :\r\n v = r[-1] \r\n\r\n while 2r[0] > v :\r\n v += 1\r\n \r\n if w[0] <= v :\r\n print(-1)\r\n exit()\r\n else :\r\n print(v) \r\n", "\r\ndef solution():\r\n\tn,m=map(int,input().split())\r\n\tacc=list(map(int,input().split()))\r\n\twa=list(map(int,input().split()))\r\n\tmn=min(acc)\r\n\tmx=max(acc)\r\n\r\n\tsol=max(2mn, mx)\r\n\tif min(wa)>sol:\r\n\t\tprint(sol)\r\n\telse:\r\n\t\tprint(-1)\r\n\t\r\n\t\r\n\r\n\r\n\treturn\r\n\t\r\n\t\r\n\r\n\r\n\r\nsolution()", "n,m=map(int,input().split());l=sorted(list(map(int,input().split())))\r\nb=sorted(list(map(int,input().split())));mi=102\r\nfor i in range(b[0]-1,-1,-1):\r\n\tk=0\r\n\tfor j in range(n):\r\n\t\tif 2l[j]<=i:k+=1;break\r\n\tfor j in range(n):\r\n\t\tif i>=l[j] :k+=1\r\n\tif k==(n+1):mi=min(i,mi)\r\nif mi!=102:print(mi)\r\nelse:print(-1)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\nx = min(a)\r\nv = 2x\r\n\r\nfor elem in a:\r\n if elem > v:\r\n v += abs(elem-v)\r\n\r\nfor elem in b:\r\n if v < elem:\r\n continue\r\n else:\r\n print(-1)\r\n break\r\nelse:\r\n print(v)\r\n", "n, m = map(int, input().split())\r\na = [int(k) for k in input().split()]\r\nb = [int(f) for f in input().split()]\r\nv = max(max(a), min(a) 2)\r\nif v < min(b):\r\n print(v)\r\nelse:\r\n print(-1)", "import sys\r\nfrom math import \r\nfrom collections import Counter, defaultdict, deque\r\ninput = sys.stdin.readline\r\nmod = 109+7\r\nn, m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nmin_corr = min(a)\r\nmax_corr = max(a)\r\nmin_wrong = min(b)\r\nif (max(2min_corr, max_corr) < min_wrong):\r\n ans = max(2min_corr, max_corr)\r\nelse:\r\n ans = -1\r\nprint(ans)\r\n", "input_string = list(map(int, input().split()))\r\ncorrectTimes = list(map(int, input().split()))\r\nwrongTimes = list(map(int, input().split()))\r\n\r\nv = max(min(correctTimes) 2, max(correctTimes))\r\n\r\nfor time in wrongTimes:\r\n if (time <= v):\r\n print(\"-1\")\r\n exit(0)\r\nprint(v)\r\n", "n,m = map(int,input().split())\r\nall_a=list(map(int,input().split()))\r\nall_b=list(map(int,input().split()))\r\n\r\nmaxi = max(all_a)\r\nmini= min(all_a)\r\n\r\noverall_max = max(2mini,maxi)\r\n \r\nmini_b = min(all_b)\r\nif overall_max < mini_b:\r\n print(overall_max)\r\nelse:\r\n print(-1)", "n,m = input().split()\r\ncor = [int(x) for x in input().split()]\r\ninc = [int(x) for x in input().split()]\r\n\r\na = max(2min(cor), max(cor))\r\nb = min(inc)\r\n\r\nif a < b:\r\n print(a)\r\nelse:\r\n print(-1)", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nmax1=max(a)\r\nmin1=min(a)\r\nmin2=min(b)\r\n\r\nif min12>=max1:\r\n\tif min12<min2:\r\n\t\tprint(min12)\r\n\telse:\r\n\t\tprint(-1)\r\nelse:\r\n\tif max1<min2:\r\n\t\tprint(max1)\r\n\telse:\r\n\t\tprint(-1)\r\n", "_ = input()\r\npos = list(map(int, input().split()))\r\nneg = list(map(int, input().split()))\r\nposMax = max(pos)\r\nnegMin = min(neg)\r\nif posMax >= negMin:\r\n print(-1)\r\nelse:\r\n posMin = min(pos)\r\n r = max(2 posMin, posMax) \r\n print(r if r < negMin else -1)", "n,m = list(map(int,input().split(\" \")))\r\ncorrect = sorted(list(map(int,input().split(\" \"))))\r\nincorrect = sorted(list(map(int,input().split(\" \"))))\r\nv_max=incorrect[0]\r\nv_min=correct[-1]\r\nif correct[0]2<=v_min:pass\r\nelse:v_min=correct[0]2\r\nif v_min>=v_max:print(-1)\r\nelse:print(v_min)", "#t=int(input())\r\nm=1000000007\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nr=list(map(int,input().split()))\r\nk=max(l)\r\nt=min(l)\r\np=min(r)\r\nk=max(k,2t)\r\nif p>k:\r\n print(k)\r\nelse:\r\n print('-1')\r\n", "n, m=map(int, input().split())\r\n\r\n\r\ncorr=input().split()\r\nz=[int(x) for x in corr]\r\n\r\nwrong=input().split()\r\nz1=[int(y) for y in wrong]\r\n\r\ncount=0\r\nkeys=[]\r\nfor key in range (max(z),min(z1)):\r\n for i in range (0,len(z)):\r\n if (2z[i]<=key):\r\n count+=1\r\n if (count>=1):\r\n keys.append(key)\r\n\r\n\r\nif (len(keys)==0):\r\n print (-1)\r\nelse:\r\n print (min(keys))\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n\r\n", "n,m=map(int,input().split())\r\na=sorted(map(int,input().split()))\r\nb=sorted(map(int,input().split()))\r\nt=max(a[0]2,a[-1])\r\nif b[0]<=t:print(-1)\r\nelse:print(t)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nq=min(a)\r\nw=max(2q,max(a))\r\nif w>=min(b):\r\n print(-1)\r\nelse:\r\n print(w)", "n,m=map(int,input().split());a=list(map(int,input().split()));b=list(map(int,input().split()))\r\np,q,v=max(a),min(b),min(a)\r\nif max(p,2v) < q:\r\n print(max(p,2v))\r\nelse:\r\n print(-1)", "I=lambda:map(int,input().split())\r\nI()\r\na = sorted(list(I()))\r\nb = list(I())\r\nans = max(2a[0],a[-1])\r\nprint([-1 , ans][ans < min(b)])", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = max(2min(a), max(a))\r\nd = min(b)\r\nif c >= d:\r\n\tprint(-1)\r\nelse:\r\n\tprint(c)\r\n", "n , m = list(map(int,input().split()))\r\n\r\nn_test = list(map(int,input().split()))\r\nm_test = list(map(int,input().split()))\r\nd = min(min(n_test),min(m_test))\r\nu = max(max(n_test),max(m_test))\r\n\r\nfor i in range(d,u+1):\r\n ac = 0\r\n extra = 0\r\n for a in n_test:\r\n if a <= i:\r\n ac+=1\r\n if a2 <=i:\r\n extra+=1\r\n bc = 0\r\n for b in m_test:\r\n if b > i:\r\n bc+=1\r\n k = []\r\n if ac == n and bc == m and extra >= 1 :\r\n k.append(i)\r\n print(i)\r\n break\r\nif len(k) == 0:\r\n print(-1)", "n, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nans = max(max(A), min(A) 2)\r\nif min(B) <= ans:\r\n\tprint(-1)\r\nelse:\r\n\tprint(ans)", "input()\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nv=max(2min(a),max(a))\r\nif v>=min(b):\r\n print(-1)\r\nelse:\r\n print(v)", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\na = sorted(a)\r\nb = sorted(b)\r\n\r\nmin_v = max(max(a), 2 min(a))\r\nif min_v >= min(b):\r\n print(-1)\r\nelse:\r\n print(min_v)", "# author: violist\n# created: 22.04.2021 16:11:50\n\nimport sys\ninput = sys.stdin.readline\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nif max(2 * min(a), max(a)) < min(b):\n print(max(2 * min(a), max(a)))\nelse:\n print(-1)\n", "n, m = [int(i) for i in input().split()]\r\naccept = [int(i) for i in input().split()]\r\nreject = [int(i) for i in input().split()]\r\naccept_min, accept_max = min(accept), max(accept)\r\nreject_min = min(reject)\r\nresult = max(2 * accept_min, accept_max)\r\nif result >= reject_min:\r\n result = -1\r\nprint(result)", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn,m=rinput()\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nma = max(a)\r\nmb = min(a)2\r\n\r\nans = max(ma, mb)\r\n\r\nif ans<min(b):\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n, m = [int(x) for x in input().split()]\r\ncorrectSolutions = list(map(int, input().split()))\r\nwrongSolutions = list(map(int, input().split()))\r\n\r\nmaxCorrect = max(correctSolutions)\r\nvRange = range(maxCorrect, min(wrongSolutions))\r\nif len(vRange) > 0:\r\n b = min(correctSolutions) 2\r\n if b in vRange:\r\n result = b\r\n elif b < maxCorrect:\r\n result = maxCorrect\r\n else:\r\n result = -1\r\nelse:\r\n result = -1\r\n\r\nprint(result)\r\n", "from collections import Counter\nfrom math import ceil\n\ndef main():\n n, m = map(int, input().split())\n correct = [int(x) for x in input().split()]\n wrong = (int(x) for x in input().split())\n cor_min = min(correct)\n cor_max = max(correct)\n possible = max(cor_min2, cor_max)\n if possible >= min(wrong):\n print(-1)\n else:\n print(possible)\n\n\nmain()\n", "a, b = list(map(int, input().split()))\r\na1 = list(map(int, input().split()))\r\nb1 = list(map(int, input().split()))\r\nv = min(a1)\r\nbm = min(b1)\r\n\r\namin = max(a1)\r\n# for i in b1:\r\n# if 2i>2v:\r\n# c+=1\r\n\r\nif max(v2,amin)<bm:\r\n print(max(v2,amin))\r\nelse:\r\n print(-1)\r\n# v = max(a1)\r\n# bm = min(b1)\r\n# # print(bm,v)\r\n# c = 0\r\n# if len(a1)>1:\r\n# for i in a1:\r\n# if 2i<=v:\r\n# c+=1\r\n# else:\r\n# c = 1\r\n#\r\n# d = 0\r\n# for i in b1:\r\n# if i>v:\r\n# d+=1\r\n#\r\n# if len(a1)==1:\r\n# print(2v)\r\n# elif c>=1 and d == len(b1):\r\n# print(v)\r\n# else:\r\n# print(-1)", "n, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\na.sort()\r\nb.sort()\r\n\r\nTL = a[0] 2\r\n\r\nif TL < a[-1]:\r\n TL = a[-1]\r\n\r\nfor num in b:\r\n if num <= TL:\r\n print(-1)\r\n break\r\nelse:\r\n print(TL)\r\n", "input()\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\na_min, b_min = min(a), min(b)\r\na_max, b_max = max(a), max(b)\r\n\r\nif a_min * 2 >= b_min or b_min <= a_max:\r\n\tprint(\"-1\")\r\nelif a_max >= a_min * 2:\r\n\tprint(a_max)\r\nelse:\r\n\tprint(a_min * 2)", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nmx = max(min(a) * 2, max(a))\r\nif min(b) > mx:\r\n print(mx)\r\nelse:\r\n print(-1)", "if __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n tine = list(map(int, input().split()))\r\n fine = list(map(int, input().split()))\r\n too = max(2 * min(tine), max(tine))\r\n foo = min(fine)\r\n print(too) if too < foo else print(-1)\r\n", "def main():\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n b=list(map(int,input().split()))\r\n ash=al=a[0]\r\n\r\n for i in range(1,n):\r\n if ash>a[i]:\r\n ash=a[i]\r\n if al<a[i]:\r\n al=a[i]\r\n\r\n \r\n bs=b[0]\r\n for i in range(1,m):\r\n if bs>b[i]:\r\n bs=b[i]\r\n else:\r\n continue\r\n\r\n \r\n v=al\r\n if v<2ash:\r\n v=2ash\r\n\r\n if v<bs:\r\n print(v)\r\n return\r\n \r\n print(-1)\r\n return\r\n \r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "string = input()\r\nnumbers = string.split()\r\na = int(numbers[0])\r\nb = int(numbers[1])\r\nstring = input()\r\nright = list(map(int, string.split()))\r\nstring = input()\r\nwrong = list(map(int, string.split()))\r\np = max(right)\r\nq = min(wrong)\r\nr = min(right)\r\nfor x in range(p, q):\r\n if r * 2 <= x:\r\n print(x)\r\n break\r\nelse:\r\n print(-1)", "n, m = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\nbrr = [int(x) for x in input().split()]\r\n\r\nx = min(arr)\r\ny = max(arr)\r\nM = min(brr)\r\nif x2 < M and y < M:\r\n print(max(y, x2))\r\nelse:\r\n print(-1)", "def solve():\r\n n, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n\r\n tl = max(max(a), min(a) * 2)\r\n return -1 if tl >= min(b) else tl\r\n\r\nprint(solve())", "import itertools\r\nimport math\r\nfrom collections import defaultdict\r\n\r\ndef input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n n, m = input_ints()\r\n a = input_ints()\r\n b = min(input_ints())\r\n x = max(2min(a), max(a))\r\n if x >= b:\r\n x = -1\r\n print(x)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "ac,wa=list(map(int,input().split()))\r\nAC=list(map(int,input().split()))\r\nWA=list(map(int,input().split()))\r\nAC.sort()\r\nWA.sort()\r\nfound=0\r\nfor j in range(AC[-1],WA[0]):\r\n tl=j\r\n if 2AC[0]<=tl:\r\n found=1\r\n break\r\nif found==1:\r\n print(tl)\r\nelse:\r\n print(-1)\r\n", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\na=min(l1)\r\nb=max(l1)\r\nc=min(l2)\r\nd=max(2a,b)\r\nif d>=c:\r\n print(-1)\r\nelse:\r\n print(d)\r\n \r\n \r\n \r\n \r\n", "n,m=[int(i) for i in input().split()]\r\nl1=[int(i) for i in input().split()]\r\nl2=[int(i) for i in input().split()]\r\nif max(l1)<min(l2):\r\n if 2min(l1)<=max(l1):\r\n print(max(l1))\r\n else :\r\n if 2min(l1)<min(l2):\r\n print(2min(l1))\r\n else :\r\n print(-1)\r\nelse :\r\n print(-1)", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nx=min(l1)\r\ny=max(l1)\r\nres=max(2x,y)\r\n#print(res)\r\nif res<min(l2):\r\n print(res)\r\nelse:\r\n print(-1)", "# https://codeforces.com/problemset/problem/350/A\r\n\r\n\"\"\"\r\nn correct solutions\r\nm wrong solutions\r\n\r\nFor each solution we know the running time.\r\nSet the time limit for each solution as v seconds. If your run time is a then\r\n You pass if a<= v\r\n * You pass with extra time if 2a <= v\r\n\r\nFind v such that:\r\n 1. v is a positive integer (can't be 0)\r\n 2. All correct solutions pass the testing\r\n 3. At least one correct solution passes with extra time\r\n 4. All wrong solutions do not pass the system testing\r\n 5. v is minimal. (In other words there is no smaller v which satisfies 1-4)\r\n\r\n\"\"\"\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nmax_a, min_a = max(a), min(a)\r\nmax_b, min_b = max(b), min(b)\r\n\r\ncrit_time = max(max_a, 2min_a)\r\n\r\nif crit_time >= min_b:\r\n print(-1)\r\nelse:\r\n print(crit_time)\r\n", "n, m = [int(x) for x in input().split()]\r\ncor = [int(x) for x in input().split()]\r\nwor = [int(x) for x in input().split()]\r\nif min(wor) <= max(cor) or min(wor) <= 2min(cor):\r\n print(-1)\r\n exit()\r\nprint(max(max(cor), 2min(cor)))", "'''\r\nINPUT SHORTCUTS\r\nN, K = map(int,input().split())\r\nN ,A,B = map(int,input().split())\r\nstring = str(input())\r\narr = list(map(int,input().split()))\r\nN = int(input())\r\n'''\r\n\r\n\r\ndef main():\r\n\tN, K = map(int,input().split())\r\n\tarr = list(map(int,input().split()))\r\n\tarr2 = list(map(int,input().split()))\r\n\ta = max(max(arr),2(min(arr)))\r\n\tif a<min(arr2):\r\n\t\tprint(a)\r\n\telse:\r\n\t\tprint(-1)\r\nmain()", "n,m=list(map(int,input().split()))\ncorrect=list(map(int,input().split()))\nwrong=list(map(int,input().split()))\ncorrect.sort()\nwrong.sort()\nTL=correct[0]\nif TL2>correct[-1]:\n\tTL=TL2\nelse:\n\tTL=correct[-1]\n#print(correct,wrong,TL)\nif TL<wrong[0]:\n\tprint(TL)\nelse:\n\tprint(-1)\n\n", "'''input\n3 1\n3 4 5\n6\n\n'''\nn, m = map(int, input().split())\na, b = list(map(int, input().split())), list(map(int, input().split()))\nt = max(2min(a), max(a))\nprint(t if t < min(b) else -1)", "A=input().split()\r\nn=int(A[0])\r\nm=int(A[1])\r\na=input().split()\r\nb=input().split()\r\nfor i in range(len(a)):\r\n a[i]=int(a[i])\r\nfor i in range(len(b)):\r\n b[i]=int(b[i])\r\nif(max(a)>=min(b) or 2min(a)>=min(b)):\r\n print(\"-1\")\r\nelse:\r\n print(max(max(a),2min(a)))", "'''def sol(n,m,k,arr):\n for i in range(n-1):\n if m<0:\n print(\"NO\")\n return\n m+=arr[i]-max(0,(arr[i+1]-k))\n if m<0:\n print(\"NO\")\n else:\n print('YES')\n\nt = int(input())\nfor _ in range(t):\n n, m, k = map(int, input().split())\n arr = list(map(int, input().split()))\n sol(n,m,k,arr)\n '''\n'''import collections\ndeq = collections.deque()\nt = int(input())\narr = list(map(int, input().split()))\narr.sort()\nfor i in range(t):\n if i%2==0:\n deq.append(arr[i])\n else:\n deq.appendleft(arr[i])\ns=''\nfor i in deq:\n s+=str(i)+' '\nprint(s)'''\ndef sol():\n for i in arrm:\n if TL>=i:\n print(-1)\n return\n print(TL)\n\nn, m = map(int, input().split())\narrn = list(map(int, input().split()))\narrm = list(map(int, input().split()))\nTL = max(2min(arrn), max(arrn))\nsol()", "n , m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\n\r\nv = max(a)\r\nd = min(a)\r\ne = min(b)\r\n\r\nif max(2 * d, v) < e:\r\n print(max(2 * d, v))\r\nelse:\r\n print(-1)", "n,m= map(int, input().split())\r\nac= list(map(int, input().split()))\r\nwa= list(map(int, input().split()))\r\n\r\nwa.sort()\r\nac.sort()\r\n\r\nif ac[0]2<=ac[-1] and ac[-1]<wa[0]:\r\n print(ac[-1])\r\nelif ac[0]2>ac[-1] and ac[0]2<wa[0]:\r\n print(2ac[0])\r\nelif ac[0]2>=wa[0]:\r\n print(-1)\r\nelse:\r\n print(-1)\r\n \r\n", "import operator as op\r\nimport re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom functools import reduce\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\ndef def_value():\r\n return 0\r\n\r\n\r\nn, m = invr()\r\nc = inlist()\r\nw = inlist()\r\n\r\nminC = min(c)\r\nmaxC = max(c)\r\nminW = min(w)\r\n\r\nv = maxC\r\nif 2 minC > v:\r\n v = 2 * minC\r\nif minW <= v:\r\n print(-1)\r\nelse:\r\n print(v)\r\n", "#A. TL\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nx = min(b)\r\ny = max(a)\r\nextra = 2min(a)\r\nif extra<=y and y<x:\r\n print(y)\r\nelse:\r\n flag = False\r\n for i in range(y,x):\r\n if i>=extra:\r\n flag = True\r\n print(i)\r\n break\r\n if not flag:\r\n print(-1)", "n,m=map(int,input().split(' '))\r\na=list(map(int,input().split(' ')))\r\nb=list(map(int,input().split(' ')))\r\na.sort()\r\nb.sort()\r\nif(a[-1]>=b[0] or a[0]2>=b[0]):\r\n print(-1)\r\nelse:\r\n print(max(2a[0],a[-1]))", "#code\r\n#code\r\nn,m = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\np = list(map(int,input().split()))\r\n\r\nt = max(l)\r\nif min(l)>t/2:\r\n t = 2min(l)\r\n \r\nif t<min(p):\r\n print(t)\r\nelse:\r\n print(\"-1\")\r\n \r\n \r\n ", "# coding: utf-8\nn, m = [int(i) for i in input().split()]\ncorrect = [int(i) for i in input().split()]\nwrong = [int(i) for i in input().split()]\nlow = max(2min(correct),max(correct))\nup = min(wrong)\nif low < up:\n print(low)\nelse:\n print(-1)\n", "n,m=map(int,input().split())\r\na=[int(_) for _ in input().split()]\r\nb=[int(_) for _ in input().split()]\r\nv1=max(min(a)2,max(a))\r\nv2=min(b)\r\nif v1<v2: print(v1)\r\nelse : print(-1)\r\n ", "n, m = map(int, input().split())\r\n\r\ncorrect = list(map(int, input().split()))\r\nwrong = list(map(int, input().split()))\r\n\r\nif min(wrong) <= max(correct) or min(wrong) <= 2 * min(correct):\r\n print(-1)\r\nelse:\r\n print(max(2 * min(correct), max(correct)))", "input().split()\na=list(map(int, input().split()))\nb=list(map(int, input().split()))\np=-1\ns=max(2min(a), max(a))\nif s<min(b):\n\tp=s\nprint(p)", "import string\r\n\r\nalph = string.ascii_lowercase\r\n\r\n\r\ndef main():\r\n n,m = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n a.sort()\r\n b.sort()\r\n if 2 a[0] >= a[n-1]:\r\n if 2a[0]<b[0]:\r\n print(2a[0])\r\n else:\r\n print(-1)\r\n else:\r\n if a[n-1] < b[0]:\r\n print(a[n-1])\r\n else:\r\n print(-1)\r\nif __name__ == \"__main__\":\r\n main()", "def func(n,m,x,y):\r\n t=max(x)\r\n a=min(x)2\r\n t=max(t,a)\r\n for i in y:\r\n if i<=t:\r\n return -1\r\n return t\r\n\r\nn,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nprint(func(x,m,x,y))\r\n", "n,m=map(int,input().split())\r\na=[]\r\na[0:n]=map(int,input().split())\r\nb=[]\r\nb[0:m]=map(int,input().split())\r\naa=min(a)\r\nv=max(a)\r\nc=min(b)\r\nif max(2aa,v)<c:\r\n print(max(2aa,v))\r\nelse:\r\n print(-1)", "l=list(map(int,input().split()))\r\nn,m=l[0],l[1]\r\nr=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\ndawnmax=max(2min(r),max(r))\r\nblancamin=min(w)\r\nif blancamin<=dawnmax:\r\n print(-1)\r\nelse:\r\n print(dawnmax)\r\n\r\n", "def TL():\r\n n,m = map(int, input().split())\r\n correctSol_time = list(map(int,input().split()))\r\n incorrectSol_time = list(map(int ,input().split()))\r\n\r\n soretd_correctTime = sorted(correctSol_time)\r\n\r\n v_gte1 = 2soretd_correctTime[0]\r\n v_gte2 = soretd_correctTime[len(soretd_correctTime)-1]\r\n\r\n v_gte = max(v_gte1,v_gte2)\r\n\r\n v_lt = min(incorrectSol_time)\r\n v_lte = v_lt - 1\r\n\r\n if v_gte <= v_lte:\r\n print(v_gte)\r\n else:\r\n print(-1)\r\n\r\nTL()", "x=list(map(int,input().split()))\r\nn=x[0]\r\nm=x[1]\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nv=max(2min(a),max(a))\r\nk=min(b)\r\nif(v<k):\r\n print(v)\r\nelse:\r\n print(-1)\r\n", "n,m=map(int,input().split())\r\nnums=list(map(int,input().split()))\r\nms=list(map(int,input().split()))\r\nma=min(ms)\r\nans=0\r\nfor i in range(max(nums),ma):\r\n if 2(min(nums))<=i:\r\n print(i)\r\n ans+=1\r\n break\r\nif ans==0:\r\n print(-1) \r\n", "data = input().split()\nN, M = int(data[0]), int(data[1])\n\ncorrect = list(map(int, input().split()))\nwrong = list(map(int, input().split()))\n\nV = min(correct)\nP = max(correct)\nC = min(wrong)\n\nif max(2 V, P) < C:\n print(max(2 * V, P))\nelse:\n print('-1')\n", "i=lambda:list(map(int,input().split()))\r\ni()\r\na=i()\r\nb=i()\r\np=-1\r\nfor i in range(max(a),min(b)):\r\n if 2min(a)<=i:\r\n p=i\r\n break\r\nprint(p)", "def tl(arr1,arr2):\r\n M = max(arr1)\r\n m = min(arr2)\r\n for i in arr2:\r\n if i <= M:\r\n return -1\r\n for i in arr1:\r\n if i2<=M:\r\n return M\r\n for i in sorted(arr1):\r\n if i * 2 < m and i2 > M:\r\n return i 2\r\n return -1\r\n\r\nn = input()\r\narr1 = list(map(int,input().split()))\r\narr2 = list(map(int,input().split()))\r\nprint(tl(arr1,arr2))\r\n", "n, m = map(int, input().split())\ncorrectSolRunningTime = list(map(int, input().split()))\nwrongSolRunningTime = list(map(int, input().split()))\ncorrectSolRunningTime.sort()\nwrongSolRunningTime.sort()\ntimeMinimum = max(2 * correctSolRunningTime[0], correctSolRunningTime[n-1])\nif wrongSolRunningTime[0] <= timeMinimum:\n print(-1)\nelse:\n print(timeMinimum)\n", "def time_limit(n,l,k):\r\n if max(min(l)2,max(l))<min(k):\r\n return max(min(l)2,max(l))\r\n return -1\r\n\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nprint(time_limit(n,l,k))", "n,m = map(int,input().split())\n\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\na.sort()\nmiB = min(b)\nv = 2a[0]\nif v<=a[-1]:\n if miB>a[-1]:\n print(a[-1])\n else:\n print(-1)\nelse:\n l = a[-1]\n while l<v:\n l+=1\n v = l\n if miB>v:\n print(v)\n else:\n print(-1)", "get=lambda:list(map(int,input().split()))\r\nn,m=get()\r\na=get() \r\nx=max(min(a)2, max(a))\r\nprint(x if min(get())>x else -1)", "n, m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nflag = False\r\nfor i in range(100):\r\n if (i < min(b)) and (i >= max(a)) and (i >= min(a) * 2):\r\n if not(flag): \r\n print(i)\r\n flag = True\r\nif not(flag):\r\n print(-1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nmina=min(a)\r\nmaxa=max(a)\r\nminb=min(b)\r\nif maxa>=minb:\r\n print(\"-1\")\r\nelif 2mina>=minb:\r\n print(\"-1\")\r\nelif 2mina<=maxa:\r\n print(maxa)\r\nelse:\r\n print(2mina)\r\n \r\n ", "n, m = map(int, input().split())\na = list(set(map(int, input().split())))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\np = 0\nif 2min(a) <= max(a):\n p = max(a)\nelse :\n p = 2min(a)\nif b[0] > p:\n print(p)\nelse :\n print(-1)", "n,m = list(map(int,input().split()))\r\nsuccess = set(map(int,input().split()))\r\nsuccess = list(success)\r\nunsuccess = set(map(int,input().split()))\r\nunsuccess = list(unsuccess)\r\n\r\nmxSuccess = max(success)\r\nminSuccess = min(success)\r\nminUnSuccess = min(unsuccess)\r\nf = False\r\n\r\nif mxSuccess>minUnSuccess:\r\n print(-1)\r\n\r\nelse:\r\n while mxSuccess<minUnSuccess:\r\n if minSuccess2<=mxSuccess:\r\n f = True\r\n break\r\n else:\r\n mxSuccess=minSuccess2\r\n if f:\r\n print(mxSuccess)\r\n else:\r\n print(-1)\r\n\r\n\r\n", "n,m=map(int,input().split())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nt1,t2=max(a),min(a)\r\nt1=max(t1,2t2)\r\nt3=min(b)\r\nif t1<t3 and 2t2<=t1:print(t1)\r\nelse:print(-1)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nv=min(a)\r\np=max(a)\r\nc=min(b)\r\nd=max(2v,p)\r\nif(d<c):\r\n print(d)\r\nelse:\r\n print(\"-1\")", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nif (max(a)<min(b) and 2min(a)<min(b)):\r\n print( max(max(a), 2min(a)))\r\nelse: \r\n print(-1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nv=min(a)\r\np=max(a);c=min(b)\r\nprint(max(2v,p)if max(2v,p)<c else -1)\r\n", "read=lambda:map(int,input().split())\r\nn,m=read()\r\na=list(read())\r\nb=list(read())\r\nlow=max(a)\r\nhigh=min(b)-1\r\nt=min(a)\r\nif low>high:\r\n print(-1)\r\nelse:\r\n result=-1\r\n for i in range(low,high+1):\r\n if t2<=i:\r\n result=i\r\n break\r\n print(result)\r\n", "n,m = map(int,input().split())\r\n\r\nli = list(map(int,input().split()))\r\nmi = list(map(int,input().split()))\r\n\r\na = min(li)\r\nv = 2a\r\nfor data in li:\r\n if v<data:\r\n v=data\r\n else:\r\n pass\r\nfor data in mi:\r\n if v>=data:\r\n v=-1\r\n else:\r\n pass\r\nprint(v)\r\n\r\n", "cin=lambda : list(map(int,input().split()))\r\nn,m =cin() \r\na = cin()\r\nb = cin()\r\nprint(max(2min(a),max(a)) if max(2min(a),max(a)) < min(b) else \"-1\")", "n, m = map(int, input().split())\r\nac = list(map(int, input().split()))\r\nwa = list(map(int, input().split()))\r\nac = sorted(ac)\r\nwa = sorted(wa)\r\nif ac[0]2 >= wa[0] or ac[-1] >= wa[0]:\r\n print(-1)\r\nelse:\r\n print(max(ac[0]2, ac[-1]))\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\n\"\"\"v=max(a)\r\nf=min(b)\r\ne=min(a)2\r\nif f<=v:\r\n print(-1)\r\n exit()\r\n\"\"\"\r\ne,v=a[0],a[-1]\r\nfor i in range(1,101):\r\n if i>=2e and i>=v and i<b[0]:\r\n print(i)\r\n exit()\r\n if i>=b[0]:\r\n print(-1)\r\n break\r\n", "n,m=list(map(int,input().split()));ok=1;a=list(map(int,input().split()));b=list(map(int,input().split()))\r\nfor i in range(n):\r\n if(max(max(a),a[i]2)<min(b)):\r\n print(max(max(a),a[i]2));ok=0;break\r\nif(ok):print('-1')", "from sys import stdin, stdout\r\n\r\nnm = list(map(int, stdin.readline().strip().split()))\r\nn = nm[0]\r\nm = nm[1]\r\ncorrect_time = list(map(int, stdin.readline().strip().split()))\r\nincorrect_time = list(map(int, stdin.readline().split()))\r\ntl = -1\r\nfor i in range(max(correct_time), min(incorrect_time)):\r\n if i >= 2 * min(correct_time):\r\n tl = i\r\n break\r\n\r\nstdout.write(str(tl))", "# for _ in range(int(input())):\nn,m=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\ns=max(2min(a),max(a))\nif s>=min(b):\n print(-1)\nelse:\n print(s)\n", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nv=min(l1)\r\np=max(l1)\r\nc=min(l2)\r\nif max(2v,p)<c:\r\n\tprint(max(2v,p))\r\nelse:\r\n\tprint(-1)", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Wed Dec 26 13:13:04 2018\n\n@author: alexis\n\"\"\"\n\ndata = input().split()\nN, M = int(data[0]), int(data[1])\n\ncorrect = list(map(int, input().split()))\nwrong = list(map(int, input().split()))\n\nmin_wrong_time = min(wrong)\n\npossible_TLs = [i+1 for i in range(min_wrong_time-1)]\n\nTL_solutions = []\nfor i in range(len(possible_TLs)):\n if all(e <= possible_TLs[i] for e in correct):\n TL_solutions.append(possible_TLs[i])\n \nif len(TL_solutions) == 0:\n print('-1')\nelse:\n TLs = []\n for i in range(len(TL_solutions)):\n if any(2e <= TL_solutions[i] for e in correct):\n TLs.append(TL_solutions[i])\n if len(TLs) == 0:\n print('-1')\n else:\n print(min(TLs))\n\n", "x = input()\r\na = input()\r\nb = input()\r\ncorrectAnswers = a.split()\r\nwrongAnswers = b.split()\r\n# print(correctAnswers)\r\n# print(wrongAnswers)\r\ncorrectAnswers = list(map(int,correctAnswers))\r\nwrongAnswers = list(map(int,wrongAnswers))\r\n# print(correctAnswers)\r\n# print(wrongAnswers)\r\na = min(correctAnswers)\r\nb = max(correctAnswers)\r\nc = min(wrongAnswers)\r\n# print(a,b,c)\r\nv = max(2a,b)\r\nif(v<c):\r\n print(v)\r\nelse:\r\n print(-1)", "I=lambda:list(map(int,input().split()))\r\nn,m=I()\r\na=I()\r\nx=max(min(a)2,max(a))\r\nprint(x if min(I())>x else -1)", "correctNo, wrongNo = map(int,input().strip().split(\" \"))\r\nCorrect = list(map(int, input().strip().split(\" \")))\r\nWrong = list(map(int, input().strip().split(\" \")))\r\n\r\nminW = min(Wrong)\r\nminC = min(Correct)\r\nmaxC = max(Correct)\r\n\r\nif maxC >= 2minC :\r\n if maxC < minW :\r\n print(maxC)\r\n else:\r\n print(-1)\r\nelse:\r\n while 2minC != maxC:\r\n maxC += 1\r\n if maxC < minW:\r\n print(maxC)\r\n else:\r\n print(-1)\r\n\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nfor i in range(max(l1),min(l2)):\r\n for j in range(len(l1)):\r\n if i>=2l1[j]:\r\n l.append(i)\r\n\r\nif len(l)==0:\r\n print(-1)\r\nelse:\r\n print(min(l))\r\n", "n,m=list(map(int, input(\"\").split()))\r\nar1=list(map(int, input(\"\").split()))\r\nar2=list(map(int, input(\"\").split()))\r\nif(2min(ar1)<max(ar1)):\r\n v=max(ar1)\r\nelse:\r\n v=2min(ar1)\r\n\r\nif(v<min(ar2)):\r\n print(v)\r\nelse:\r\n print(-1)", "import math\r\n\r\nt, m = list(map(int, input().split()))\r\ncorrect = list(map(int, input().split()))\r\nincorrect = list(map(int, input().split()))\r\n\r\nif (max(correct) < min(incorrect)) and (min(correct) 2 < min(incorrect)):\r\n\r\n print(max(max(correct), min(correct)2))\r\nelse:\r\n print(-1)\r\n", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\na = min(c)\r\ntl = 2a\r\nfor i in range(len(c)):\r\n if tl >= c[i]:\r\n pass\r\n else:\r\n tl = c[i]\r\nfor i in range(len(w)):\r\n if tl < w[i]:\r\n pass\r\n else:\r\n print(-1)\r\n exit()\r\nprint(tl)", "class CodeforcesTask350ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.correct_times = []\r\n self.wrong_times = []\r\n\r\n def read_input(self):\r\n input()\r\n self.correct_times = [int(x) for x in input().split(\" \")]\r\n self.wrong_times = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n self.correct_times.sort()\r\n self.wrong_times.sort()\r\n if self.correct_times[0] * 2 < self.correct_times[-1]:\r\n solution = self.correct_times[-1]\r\n else:\r\n solution = self.correct_times[0] * 2\r\n if not solution < self.wrong_times[0]:\r\n solution = -1\r\n self.result = str(solution)\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask350ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "n,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nmax_a = max(a)\r\nmin_a = min(a)\r\nmin_b = min(b)\r\nif(max(2min_a, max_a) < min_b):\r\n print(max(2min_a, max_a))\r\nelse:\r\n print(-1)", "nm = input().split()\r\nn = int(nm[0])\r\nm = int(nm[1])\r\ncoarr = [int(x) for x in input().split()]\r\nwrarr = [int(x) for x in input().split()]\r\nans = 0\r\nmaxc = max(coarr)\r\nminc = min(coarr)\r\nminw = min(wrarr)\r\nif maxc >= minw:\r\n print(-1)\r\nelse:\r\n if maxc >= 2minc:\r\n print(maxc)\r\n else:\r\n ans = 2minc\r\n if ans < minw:\r\n print(ans)\r\n else:\r\n print(-1) \r\n\r\n\r\n \r\n# if max(coarr) >= min(wrarr):\r\n# ans = 2 * min(coarr)\r\n# if ans < min(wrarr):\r\n# print(max(coarr))\r\n# else:\r\n# print(-1)\r\n# else:\r\n# if max(coarr) >= 2 min(coarr):\r\n# print(max(coarr))\r\n# exit()\r\n# else:\r\n# ans = 2 min(coarr)\r\n# if ans < min(wrarr):\r\n# print(ans)\r\n# else:\r\n# print(-1) \r\n# BULLSHIT CODE\r\n# u STUPID REVIEW YOUR CODE CAREFULLY U DUMBASS \r\n \r\n \r\n\r\n", "n,m=map(int, input().split())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nv=min(a)\r\np=max(a)\r\nc=min(b)\r\nif max(2v,p)<c:\r\n print(max(2v,p))\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif(min(b)<=max(a)):\r\n print(\"-1\")\r\nelse:\r\n r=1000000000\r\n q=0\r\n for i in range(min(b)-1,1,-1):\r\n e=0\r\n f=0\r\n for j in range(n):\r\n if(a[j]<=i):\r\n e=e+1\r\n if((2a[j])<=i):\r\n f=f+1\r\n if(n==e and f>0):\r\n r=min(r,i)\r\n q=1\r\n if(q==0):\r\n print(\"-1\")\r\n else:\r\n print(r)\r\n ", "nm=input().split()\r\nn=int(nm[0])\r\nm=int(nm[1])\r\ncorrect=list(map(int,input().split()))\r\nwrong=list(map(int,input().split()))\r\npoint4=True\r\nTL=max(2min(correct),max(correct))\r\nif min(wrong)<=TL:\r\n point4=False\r\nif point4:\r\n print(TL)\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\narr1 = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\ntl = max(max(arr1), min(arr1) * 2)\r\nprint(tl if tl < min(arr2) else -1)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nfor i in range(244):\r\n c1 = 0\r\n c2 = 0\r\n c3 = 0\r\n for aa in a:\r\n if aa <= i: c1+=1\r\n if 2aa <=i: c2=1\r\n for bb in b:\r\n if bb > i:\r\n c3 +=1\r\n if(c1==n and c2 >0 and c3 == m):\r\n print(i)\r\n break\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\ncorrect_array = list(map(int, input().split()))\r\nincorrect_array = list(map(int, input().split()))\r\n\r\ncorrect_array.sort()\r\nincorrect_array.sort()\r\n\r\n# Check if there is a valid TL value\r\nif correct_array[n - 1] > incorrect_array[0]:\r\n print(-1)\r\nelse:\r\n # Find the minimum valid TL value\r\n found_tl = False\r\n for i in range(correct_array[n - 1], incorrect_array[0]):\r\n if 2 correct_array[0] <= i:\r\n print(i)\r\n found_tl = True\r\n break\r\n\r\n if not found_tl:\r\n print(-1)\r\n", "x,y = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\no=0\r\nif max(a)>=min(b):\r\n print(-1)\r\nelse:\r\n o = max(max(a),2min(a))\r\n if o>=min(b):\r\n print(-1)\r\n else:\r\n print(o)", "n,m = map(int,input().split())\r\ncorrect = list(map(int,input().split()))\r\nincorrect = list(map(int,input().split()))\r\nc = max(correct)\r\ninc = min(incorrect)\r\nflag = 1\r\nif c>= inc:\r\n print('-1')\r\n exit(0)\r\nelse:\r\n for i in correct:\r\n if 2i <= c:\r\n flag = 0\r\n break\r\n if flag:\r\n temp = min(correct)\r\n c =2temp\r\n if c>=inc:\r\n print('-1')\r\n exit(0)\r\n else:\r\n print(c)", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nupper=min(l2)\r\nlower=max(l1)\r\nif lower>=upper:\r\n print(-1)\r\nelif 2min(l1)>=lower:\r\n if 2min(l1)<upper:\r\n print(2min(l1))\r\n else :\r\n print(-1)\r\nelse :\r\n print(lower)\r\n ", "n,m=list(map(int,input().split()))\r\nA=list(map(int,input().split()))\r\nB=list(map(int,input().split()))\r\na=min(A)\r\np=max(A)\r\nv=2a\r\nif max(v,p)<min(B):\r\n print(max(v,p))\r\nelse:\r\n print(-1)", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n a.sort()\r\n b.sort()\r\n v=a[n-1]\r\n l=[]\r\n if(n==1):\r\n if(2a[0]<b[0]):\r\n return 2a[0]\r\n else:\r\n return -1\r\n if(a[n-1]<b[0] and b[0]>2a[0]):\r\n #print('hjx')\r\n j=max(2a[0],a[n-1])\r\n return j\r\n return -1\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nprint(exe())", "n,m=map(int,input().split())\r\ncorrect=list(map(int,input().split()))\r\nwrong=list(map(int,input().split()))\r\ntl=-1\r\nfor i in range(max(correct),min(wrong)):\r\n if 2(min(correct))<=i:\r\n tl=i\r\n break\r\nprint(tl)", "n,m=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))\r\nk=sorted(list(map(int,input().split())))\r\nflag=0\r\nfor i in range(l[-1],k[0]):\r\n if(2l[0]<=i):\r\n flag=1\r\n break\r\nif(flag==1):\r\n print(i)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nac=list(map(int,input().split()))\r\nwa=list(map(int,input().split()))\r\nac=sorted(ac)\r\nwa=sorted(wa)\r\nif ac[0]2>=wa[0] or ac[-1]>=wa[0]:\r\n print(-1)\r\nelse:\r\n print(max(ac[0]2,ac[-1]))", "n, m = map(int, input().split())\r\nright = sorted(list(map(int, input().split())))\r\nwrong = sorted(list(map(int, input().split())))\r\nans = max(right[0] 2, right[-1])\r\nif ans < wrong[0]:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n,m = map(int,input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nv = min(a)\r\np = max(a)\r\nc = min(b)\r\nmim = max(2v,p)\r\nif mim < c:\r\n print(mim)\r\nelse:\r\n print(-1)", "# http://codeforces.com/problemset/problem/350/A\nn , m = map(int, input().split())\nl1 = [int(x) for x in input().split()]\nl2 = [int(x) for x in input().split()]\nv,p,c = min(l1), max(l1), min(l2)\n\nprint(max(2v,p) if max(2v,p)<c else -1)\n", "n, m = input().split()\r\nn, m = int(n), int(m)\r\ns1 = [int(i) for i in input().split()]\r\ns2 = [int(i) for i in input().split()]\r\na = max(s1)\r\nc = min(s2)\r\nb = False\r\nfor i in range(a, c):\r\n if i // min(s1) >= 2:\r\n b = True\r\n j = i\r\n break\r\nif b:\r\n print(j)\r\nelse:\r\n print(-1)", "import math\r\ndef main():\r\n n,m = map(int,input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int,input().split()))\r\n if max(min(a)2,max(a)) < min(b):\r\n print(max(min(a) * 2,max(a)))\r\n return\r\n print(-1)\r\n\r\n\r\nmain()", "get = lambda: list(map(int, input().split()))\r\nn, m = get()\r\na = get() \r\nx = max(min(a) * 2, max(a))\r\nprint(x if min(get()) > x else -1)", "n, m = [int(i) for i in input().split()]\nx = [int(i) for i in input().split()]\ny = [int(i) for i in input().split()]\n\nt = max(x)\n\nwhile min(x)2 > t:\n\tt += 1\n\nif t < min(y):\n\tprint(t)\nelse:\n\tprint(-1)\n", "parse = lambda st: list(map(int, st.split()))\r\nn, m = parse(input())\r\ngood = parse(input())\r\nbad = parse(input())\r\n_min, _max = min(good), max(good)\r\nv = max(2 _min, _max)\r\nprint(v if v < min(bad) else -1)", "n, m = map(int, input().split())\r\nacc=list(map(int, input().split()))\r\nrej = list(map(int, input().split()))\r\nmini= max(min(acc)2, max(acc))\r\nif(min(rej) <= mini):\r\n print('-1')\r\nelse:\r\n print(mini)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nif(max(a)>=min(b)):\r\n print(-1)\r\nelse:\r\n a.sort()\r\n b.sort()\r\n x=2a[0]\r\n if(x<=max(a)):\r\n print(max(a))\r\n else:\r\n if(x<min(b)):\r\n print(x)\r\n else: \r\n print(-1) ", "n, m = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\n\na.sort()\nwrong_tl = min(b) - 1\n\ntl = wrong_tl\nflag = 0\nfor i in a:\n if 2i <= tl and flag == 0:\n tl = 2i\n flag = 1\n elif i > tl:\n tl = i\n\nif not flag or tl > wrong_tl:\n print(-1)\nelse:\n print(tl)", "n,m=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nt=max(a)\r\ntt=min(a)\r\nttt=min(b)\r\nif max(2tt,t)<ttt:\r\n print(max(2tt,t))\r\nelse:\r\n print(-1)", "n,m = map(int,input().split())\r\n\r\nright = list(map(int,input().split()))\r\nwrong = list(map(int,input().split()))\r\n\r\ntl = max(right)\r\n\r\nif tl < min(wrong):\r\n if min(right)2 <= tl:\r\n print(tl)\r\n else:\r\n tl = min(right)2\r\n if tl < min(wrong):\r\n print(tl)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "n, m = map(int,input().split())\r\ncorrect = list(map(int,input().split()))\r\nwrong = list (map(int, input().split()))\r\n\r\ncorrect.sort()\r\nwrong.sort()\r\nwrong_time_limit = wrong[0]\r\n\r\nminm_time_limit = correct[0]2 \r\ncorrect_time_limit= correct[-1]\r\n\r\ntle = 0\r\nif minm_time_limit>=correct_time_limit:\r\n tle = minm_time_limit\r\nelse: \r\n tle = correct_time_limit\r\n\r\nif wrong_time_limit>tle : \r\n print(tle)\r\nelse: \r\n print(-1)", "n, m = map(int, input().split())\r\nct = (sorted([int(i) for i in input().split()]))\r\nwt = [int(i) for i in input().split()]\r\nk = max(ct[-1],2ct[0])\r\nprint(k if 2 * ct[0] <= k < min(wt) else \"-1\")", "nm=input().split()\r\nn=int(nm[0])\r\nm=int(nm[1])\r\ncorrect=list(map(int,input().split()))\r\nwrong=list(map(int,input().split()))\r\npoint4=True\r\nif 2min(correct)<max(correct):\r\n TL=max(correct)\r\nelse:\r\n TL=2min(correct)\r\nif min(wrong)<=TL:\r\n point4=False\r\nif point4:\r\n print(TL)\r\nelse:\r\n print(-1)", "a, b = map(int, input().split())\r\nP = list(map(int, input().split()))\r\nflag = 0\r\nM = P[0]\r\nm = P[0]\r\nfor i in range(a):\r\n M = max(M, P[i])\r\n m = min(m, P[i])\r\ns = max(M, 2 * m)\r\nA = list(map(int, input().split()))\r\nfor i in range(b):\r\n if A[i] <= s:\r\n flag = 1\r\nif flag == 1:\r\n print(-1)\r\nelse:\r\n print(s)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\na.sort()\r\nv = a[-1]\r\nans = -1\r\n\r\nwhile 1:\r\n\r\n idx = 0\r\n wrong = False\r\n while idx < m:\r\n if b[idx] <= v:\r\n wrong = True\r\n idx = m\r\n idx += 1\r\n\r\n if wrong == True:\r\n break\r\n\r\n if v < 2 * a[0]:\r\n\r\n v += 1\r\n continue\r\n\r\n ans = v\r\n break\r\n\r\nprint (ans)", "n,m = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nv = min(a)\r\np = max(a)\r\n\r\nc= min(b)\r\nif(max(2v,p)<c):\r\n print(max(2v,p))\r\nelse:\r\n print(-1)", "n, k = [int(i) for i in input().split()] #int(input())\r\ncorr = [int(i) for i in input().split()]\r\nwrong = [int(i) for i in input().split()]\r\n\r\nmax_corr = max(corr)\r\nmin_corr = min(corr)\r\n\r\nmin_wrong = min(wrong)\r\n\r\nbest_tl = max(max_corr, 2min_corr)\r\n\r\nif best_tl<min_wrong:\r\n print(best_tl)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nn1=list(map(int,input().split()))\r\nm1=list(map(int,input().split()))\r\nif max(2(min(n1)),max(n1))<min(m1):\r\n print(max(2(min(n1)),max(n1)))\r\nelse:\r\n print(-1)", "input()\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ntl = min(b) - 1\r\nif (2 min(a)) > tl or max(a) > tl:\r\n print(-1)\r\nelse:\r\n print(max(2 * min(a), max(a)))", "n,k=map(int,input().split()) \r\n # s=input()\r\n # n=int(input())\r\nr=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\nv=max(r)\r\nmnr=min(r)\r\nmnw=min(w)\r\nif v<mnw :\r\n if v>=2mnr:\r\n print(v)\r\n else:\r\n v=2mnr\r\n if v<mnw:\r\n print(v)\r\n else:\r\n print(-1)\r\n\r\nelse:\r\n print(-1)\r\n", "def f(a, b, v):\n if v < a[-1]:\n return False\n if v >= b[0]:\n return False\n extra = False\n for ai in a:\n if 2 * ai <= v:\n return ai\n return False\n\ndef main():\n (n, m) = map(int, input().split(' '))\n\n a = sorted(list(map(int, input().split(' '))))\n b = sorted(list(map(int, input().split(' '))))\n\n for v in range(1, b[0]):\n if f(a, b, v):\n return v\n\n return -1\n\nprint(main())\n\n\n\n", "n, m = (int(x) for x in input().split())\r\na = sorted(int(x) for x in input().split())\r\nv = max(a[0] * 2, a[-1])\r\nb1 = sorted(int(x) for x in input().split())[0]\r\nprint(v if v < b1 else -1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = map(int, input().split())\r\nv = max(max(a), 2 * min(a))\r\nprint(v if v < min(b) else -1)", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\np=-1\r\nfor i in range(max(a),min(b)):\r\n if 2min(a)<=i:\r\n p=i\r\n break\r\nprint(p)\r\n ", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nmin_limit = max(2min(a), max(a))\r\nmax_limit = min(b)-1\r\nif min_limit <= max_limit:\r\n print(min_limit)\r\nelse:\r\n print(-1)\r\n", "import math as mt\r\nfrom collections import defaultdict,deque\r\nfrom bisect import bisect_left as b_l\r\nfrom bisect import bisect_right as b_r\r\nimport sys\r\n\r\nn,m=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nmx=max(a)\r\nmn=min(b)\r\nif(max(mx,2min(a))<mn):\r\n print(max(mx,2min(a)))\r\nelse:\r\n print(-1)", "input()\r\nt = list(map(int, input().split()))\r\na = max(max(t), min(t) * 2)\r\n\r\nb = min(map(int, input().split()))\r\nprint(a if b > a else -1)", "a,b = map(int, input().split())\r\n\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nm = min(x) * 2\r\n\r\nfor i in x:\r\n m = max(m, i)\r\n\r\nfor j in y:\r\n if j <= m:\r\n print(-1)\r\n quit()\r\nprint(m)", "n,m = map(int,input().split())\na = sorted(list(map(int,input().split())))\nb = sorted(list(map(int,input().split())))\nif a[-1]>=b[0]:\n print(-1)\n quit()\nli = a[-1]\nflag = 0\nfor i in range(n):\n if a[i]2<=li:\n flag = 1\n break\n else:\n if a[i]2<b[0]:\n li = 2a[i]\n flag = 1\n break\n else:\n break\nif flag :\n print(li)\nelse: print(-1)", "n,m = map(int,input().split())\r\nr = list(map(int,input().split()))\r\nw = list(map(int,input().split()))\r\nx = max(r)\r\ny = min(w)\r\nz = min(r)\r\nif(y<x):\r\n print(-1)\r\nelse:\r\n for i in range(x,y):\r\n if(2z<=i):\r\n print(i)\r\n break\r\n else:\r\n print(-1) ", "def solve():\r\n n, m = map(int, input().split())\r\n l1 = list(map(int, input().split()))\r\n l2 = list(map(int, input().split()))\r\n x1 = min(l1)\r\n x2 = min(l2)\r\n y = max(l1)\r\n if y>=x2 or x12>=x2:\r\n print(-1)\r\n return\r\n print(max(x1 2, y))\r\n\r\n\r\nsolve()", "n,m = map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n# xyz\r\nx=max(a)\r\ny=min(a)2\r\nres1=max(y,x)\r\nz=min(b)\r\nif res1<z:\r\n print(res1)\r\nelse:\r\n print(-1)", "a,b = input().strip().split(' ')\na = int(a)\nb = int(b)\nright = [int(x) for x in input().strip().split(' ')]\nwrong = [int(x) for x in input().strip().split(' ')]\n\nmaxR = max(right)\nminR = min(right)\n\nv = 2minR if (2minR > maxR) else maxR\n\nminW = min(wrong)\nprint (-1 if minW <= v else v)\n ", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ntl = max(a)\r\nmini = min(a)\r\n\r\nif 2mini<=tl:\r\n f=1\r\n for i in b:\r\n if i<=tl:\r\n print(-1)\r\n f=0\r\n break\r\n if f:\r\n print(tl)\r\n\r\nelse:\r\n res=1\r\n for i in a:\r\n p = 2i\r\n f=1\r\n for j in b:\r\n if p>=j:\r\n f=0\r\n break\r\n if f:\r\n res = 0\r\n print(p)\r\n break\r\n if res:\r\n print(-1)", "def getVar(): \r\n return tuple(map(int, input().split()))\r\nn, m = getVar()\r\na = getVar()\r\nb = getVar()\r\n#print(a,b)\r\nc = max(min(a) 2, max(a))\r\n#c = -1\r\nd = min(b) - 1\r\nif c > d:\r\n c = -1\r\nprint(c)\r\n", "from sys import exit\r\nn,m=[int(x) for x in input().split()]\r\nn_1=[int(x) for x in input().split()]\r\nm_2=[int(x) for x in input().split()]\r\nnmin=min(n_1)\r\nnmax=max(n_1)\r\nmlow=min(m_2)\r\nif mlow < nmax:\r\n print(-1)\r\n exit()\r\nf=[]\r\nfor i in range(nmax,mlow):\r\n if i >= nmin 2:\r\n f.append(i)\r\nif len(f)==0:\r\n print(-1)\r\n exit()\r\nprint(min(f))\r\n\r\n", "[m,n]=[int(i) for i in input().split(' ')]\r\nrn=[int(i) for i in input().split(' ')]\r\nrn=sorted(rn)\r\nwn=[int(i) for i in input().split(' ')]\r\nwn=sorted(wn)\r\nans=2min(rn)\r\nif ans<max(rn):\r\n ans=max(rn)\r\nif ans>=min(wn):\r\n print(-1)\r\nelse:\r\n print(ans)", "n, m = [int(x) for x in input().split()]\r\nR = [int(x) for x in input().split()]\r\nW = [int(x) for x in input().split()]\r\nv = max(R + [min(R)2])\r\nif v >= min(W): print(-1)\r\nelse:print(v)\r\n ", "correct, wrong = map(int, input().split(' '))\r\nrightlist = list(map(int, input().split(' ')))\r\nwronglist = list(map(int, input().split(' ')))\r\n\r\nupbd = min(wronglist) - 1\r\nlowbd1 = max(rightlist)\r\nlowbd2 = min(rightlist) 2\r\nlowbd = max(lowbd1, lowbd2)\r\n\r\nif lowbd > upbd:\r\n print(-1)\r\n\r\nelse:\r\n print(lowbd)\r\n", "x=[]\r\nx=input().split()\r\nn=int(x[0])\r\nm=int(x[1])\r\na=[]\r\na=input().split()\r\nb=input().split()\r\nfor i in range(0,n):\r\n a[i]=int(a[i])\r\nfor i in range(0,m):\r\n b[i]=int(b[i])\r\nextra=min(a)\r\nt1=max(a)\r\nt2=min(b)\r\nflag=0\r\nfor i in range(t1,t2,1):\r\n if 2extra<=i:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(i)\r\nelse:\r\n print('-1')\r\n", "n,m = map(int, input().split())\r\ncor = list(map(int, input().split()))\r\ninc = list(map(int, input().split()))\r\n\r\nif max(cor) < min(inc):\r\n if (min(cor) 2) < min(inc):\r\n if (min(cor)2) < max(cor):\r\n print(max(cor))\r\n else:\r\n print(min(cor)2)\r\n else:\r\n print(-1)\r\n \r\nelse:\r\n print(-1)", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na1 = min(a)\r\na2 = max(a)\r\nb1 = min(b)\r\nif a1 * 2 <= b1 - 1 and a2 < b1:\r\n print(max(a1 * 2, a2))\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\ncorrect = list(map(int, input().split()))\nwrong = list(map(int, input().split()))\n\ncorrect.sort()\nwrong.sort()\nv = max(2 * correct[0], correct[-1])\nif wrong[0] <= v:\n print(-1)\nelse:\n print(v)\n", "\n## Read Data\ndata = input().split()\nN, M = int(data[0]), int(data[1])\n\ncorrect = list(map(int, input().split()))\nwrong = list(map(int, input().split()))\n\n## select minmum wrong answer time\nmin_wrong_time = min(wrong)\n## collect all possible solutions\npossible_TLs = [i+1 for i in range(min_wrong_time-1)]\n\n## collect TLS which correct answers can pass\nTL_solutions = []\nfor i in range(len(possible_TLs)):\n if all(e <= possible_TLs[i] for e in correct):\n TL_solutions.append(possible_TLs[i])\n\nif len(TL_solutions) == 0:\n print('-1')\n exit()\nelse:\n TLs = []\n for i in range(len(TL_solutions)):\n if any(2e <= TL_solutions[i] for e in correct):\n TLs.append(TL_solutions[i])\n if len(TLs) == 0:\n print('-1')\n exit()\n else:\n print(min(TLs))\n\n", "N, M = map(int, input().split())\r\nCorr = list(map(int, input().split()))\r\nInva = list(map(int, input().split()))\r\n\r\nans = min(Corr)2\r\nans = max(ans, max(Corr))\r\nif min(Inva) <= ans:\r\n print(-1)\r\nelse:\r\n print(ans)", "s = input().split()\r\n(n,m) = (int(i) for i in s)\r\ns = input().split()\r\ncorrect = [int(i) for i in s]\r\ns = input().split()\r\nwrong = [int(i) for i in s]\r\n\r\nmin_lim = max(correct)\r\nmax_lim = min(wrong)\r\n\r\nwhile(2min(correct) > min_lim):\r\n\tmin_lim += 1\r\n\r\nif(min_lim >= max_lim):\r\n\tprint(-1)\r\nelse:\r\n\tprint(min_lim)\r\n\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nv=min(a)\r\np=max(a)\r\nc=min(b)\r\nprint(max(2v,p)) if(max(2v,p)<c) else print(-1)", "n, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nv = max(2 min(A), max(A))\r\n\r\nprint(v if v < min(map(int, input().split())) else -1)" ]	{"inputs": ["3 6\n4 5 2\n8 9 6 10 7 11", "3 1\n3 4 5\n6", "2 5\n45 99\n49 41 77 83 45", "50 50\n18 13 5 34 10 36 36 12 15 11 16 17 14 36 23 45 32 24 31 18 24 32 7 1 31 3 49 8 16 23 3 39 47 43 42 38 40 22 41 1 49 47 9 8 19 15 29 30 16 18\n91 58 86 51 94 94 73 84 98 69 74 56 52 80 88 61 53 99 88 50 55 95 65 84 87 79 51 52 69 60 74 73 93 61 73 59 64 56 95 78 86 72 79 70 93 78 54 61 71 50", "55 44\n93 17 74 15 34 16 41 80 26 54 94 94 86 93 20 44 63 72 39 43 67 4 37 49 76 94 5 51 64 74 11 47 77 97 57 30 42 72 71 26 8 14 67 64 49 57 30 23 40 4 76 78 87 78 79\n38 55 17 65 26 7 36 65 48 28 49 93 18 98 31 90 26 57 1 26 88 56 48 56 23 13 8 67 80 2 51 3 21 33 20 54 2 45 21 36 3 98 62 2", "32 100\n30 8 4 35 18 41 18 12 33 39 39 18 39 19 33 46 45 33 34 27 14 39 40 21 38 9 42 35 27 10 14 14\n65 49 89 64 47 78 59 52 73 51 84 82 88 63 91 99 67 87 53 99 75 47 85 82 58 47 80 50 65 91 83 90 77 52 100 88 97 74 98 99 50 93 65 61 65 65 65 96 61 51 84 67 79 90 92 83 100 100 100 95 80 54 77 51 98 64 74 62 60 96 73 74 94 55 89 60 92 65 74 79 66 81 53 47 71 51 54 85 74 97 68 72 88 94 100 85 65 63 65 90", "1 50\n7\n65 52 99 78 71 19 96 72 80 15 50 94 20 35 79 95 44 41 45 53 77 50 74 66 59 96 26 84 27 48 56 84 36 78 89 81 67 34 79 74 99 47 93 92 90 96 72 28 78 66", "1 1\n4\n9", "1 1\n2\n4", "22 56\n49 20 42 68 15 46 98 78 82 8 7 33 50 30 75 96 36 88 35 99 19 87\n15 18 81 24 35 89 25 32 23 3 48 24 52 69 18 32 23 61 48 98 50 38 5 17 70 20 38 32 49 54 68 11 51 81 46 22 19 59 29 38 45 83 18 13 91 17 84 62 25 60 97 32 23 13 83 58", "1 1\n50\n100", "1 1\n49\n100", "1 1\n100\n100", "1 1\n99\n100", "8 4\n1 2 49 99 99 95 78 98\n100 100 100 100", "68 85\n43 55 2 4 72 45 19 56 53 81 18 90 11 87 47 8 94 88 24 4 67 9 21 70 25 66 65 27 46 13 8 51 65 99 37 43 71 59 71 79 32 56 49 43 57 85 95 81 40 28 60 36 72 81 60 40 16 78 61 37 29 26 15 95 70 27 50 97\n6 6 48 72 54 31 1 50 29 64 93 9 29 93 66 63 25 90 52 1 66 13 70 30 24 87 32 90 84 72 44 13 25 45 31 16 92 60 87 40 62 7 20 63 86 78 73 88 5 36 74 100 64 34 9 5 62 29 58 48 81 46 84 56 27 1 60 14 54 88 31 93 62 7 9 69 27 48 10 5 33 10 53 66 2", "5 100\n1 1 1 1 1\n77 53 38 29 97 33 64 17 78 100 27 12 42 44 20 24 44 68 58 57 65 90 8 24 4 6 74 68 61 43 25 69 8 62 36 85 67 48 69 30 35 41 42 12 87 66 50 92 53 76 38 67 85 7 80 78 53 76 94 8 37 50 4 100 4 71 10 48 34 47 83 42 25 81 64 72 25 51 53 75 43 98 53 77 94 38 81 15 89 91 72 76 7 36 27 41 88 18 19 75", "3 3\n2 3 4\n8 9 10", "2 1\n2 3\n15", "2 1\n2 4\n4", "2 3\n4 5\n10 11 12", "3 1\n2 3 3\n5", "2 1\n9 10\n100", "3 3\n3 12 15\n7 8 9", "2 2\n3 5\n7 8", "3 3\n4 5 6\n10 11 12", "3 5\n2 3 3\n6 6 6 6 2", "3 6\n4 5 3\n8 9 7 10 7 11", "3 6\n4 5 2\n8 9 6 10 7 4", "2 1\n4 6\n10", "1 2\n1\n3 1", "2 1\n5 6\n20", "2 1\n1 5\n5", "3 2\n10 20 30\n30 40", "2 2\n5 6\n7 100", "2 1\n2 5\n7", "1 1\n5\n20", "2 1\n10 11\n100", "1 1\n1\n10", "1 1\n10\n100"], "outputs": ["5", "-1", "-1", "49", "-1", "46", "14", "8", "-1", "-1", "-1", "98", "-1", "-1", "99", "-1", "2", "4", "4", "-1", "8", "4", "18", "-1", "6", "8", "-1", "6", "-1", "8", "-1", "10", "-1", "-1", "-1", "5", "10", "20", "2", "20"]}	UNKNOWN	PYTHON3	CODEFORCES	305
8f7bee73b29e1a11e67f9279a1507384	The Child and Set	At the children's day, the child came to Picks's house, and messed his house up. Picks was angry at him. A lot of important things were lost, in particular the favorite set of Picks. Fortunately, Picks remembers something about his set S: - its elements were distinct integers from 1 to limit; - the value of was equal to sum; here lowbit(x) equals 2k where k is the position of the first one in the binary representation of x. For example, lowbit(100102)<==<=102,<=lowbit(100012)<==<=12,<=lowbit(100002)<==<=100002 (binary representation). Can you help Picks and find any set S, that satisfies all the above conditions? The first line contains two integers: sum,<=limit (1<=≤<=sum,<=limit<=≤<=105). In the first line print an integer n (1<=≤<=n<=≤<=105), denoting the size of S. Then print the elements of set S in any order. If there are multiple answers, print any of them. If it's impossible to find a suitable set, print -1. Sample Input 5 5 4 3 5 1 Sample Output 2 4 5 3 2 3 1 -1	[ "import sys\r\ninput = sys.stdin.readline\r\n\r\ns, l = map(int, input().split())\r\n\r\nd = []\r\nf = 0\r\nfor i in range(1, l+1):\r\n x = i\r\n c = 1\r\n while 1:\r\n if i & 1:\r\n d.append((c, x))\r\n f += c\r\n break\r\n c = 2\r\n i >>= 1\r\n if i == 0:\r\n d.append((c, x))\r\n f += c\r\n break\r\nd.sort(reverse=True)\r\nif s > f:\r\n print(-1)\r\n exit()\r\n\r\ne = []\r\nfor a, b in d:\r\n if s >= a:\r\n s -= a\r\n e.append(b)\r\n if s == 0:\r\n break\r\n else:\r\n continue\r\n\r\nprint(len(e))\r\nprint(' '.join(map(str, e)))", "a=[0 for x in range(0,18)]\r\nk=[0 for x in range(0,18)]\r\nss=input()\r\nkay = ss.split(\" \")\r\nsuma=int(kay[0])\r\nlimit = int(kay[1])\r\n\r\nfor i in range(16,-1,-1):\r\n a[i]=int(limit/pow(2,i))-int(limit/pow(2,i+1))\r\n \r\nfor i in range (16,-1,-1):\r\n while (suma>=pow(2,i) and a[i]>0):\r\n suma=suma-pow(2,i)\r\n a[i]=a[i]-1\r\n k[i]=k[i]+1\r\nles=\"\"\r\nN=sum(k)\r\nif suma!=0:\r\n print(-1)\r\nelse:\r\n print(N)\r\n for i in range(0,17):\r\n j=0\r\n while(k[i]!=0):\r\n #print((pow(2,i)(2j+1)))\r\n les=les+str(pow(2,i)(2j+1))+\" \"\r\n k[i]=k[i]-1\r\n j=j+1\r\nprint(les)\r\n", "s,l = map(int,input().split())\r\nd = [-1](l+1)\r\nfor i in range(1,l+1):\r\n if i%2:\r\n d[i] = 0\r\n else:\r\n d[i] = d[i//2]+1\r\n\r\np = sorted(list(range(1,l+1)),key=lambda x:-d[x])\r\nans = []\r\nfor i in p :\r\n if s==0:\r\n break\r\n elif s<(1<<d[i]):\r\n continue\r\n else:\r\n ans.append(i)\r\n s-=(1<<d[i])\r\nif s==0:\r\n print(len(ans))\r\n print(ans)\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom collections import Counter, defaultdict\r\nfrom sys import stdin, stdout\r\nimport io\r\nimport math\r\nimport heapq\r\nimport bisect\r\nimport collections\r\nimport copy\r\nimport collections, sys, threading\r\ndef ceil(a, b):\r\n return (a + b - 1) // b\r\ninf = float('inf')\r\ndef get():\r\n return stdin.readline().rstrip()\r\nmod = 10 * 9 + 7\r\nimport collections, sys, threading\r\nsys.setrecursionlimit(1500)\r\n# for _ in range(int(get())):\r\n# n=int(get())\r\n# l=list(map(int,get().split()))\r\n# = map(int,get().split())\r\ndef decimalToBinary(n):\r\n return bin(n).replace(\"0b\", \"\")\r\n##################################################\r\nsum,limit = map(int,get().split())\r\ns=decimalToBinary(sum)\r\nans=[]\r\nfor i in range(1,limit+1):\r\n ans.append([i&~(i-1),i]) # return rightmost set bit\r\nans.sort(reverse=True)\r\nres=0\r\nl=[]\r\nfor i in ans:\r\n if res+i[0]<=sum:\r\n res+=i[0]\r\n l.append(i[1])\r\nif res!=sum:\r\n print(-1)\r\n exit()\r\nprint(len(l))\r\nprint(l)\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 lowbit(x):\r\n i = 0\r\n while x & 1 == 0:\r\n x >>= 1\r\n i += 1\r\n return 1 << i\r\n\r\ndef main():\r\n Sum, limit = [int(i) for i in input().split()]\r\n \r\n d = {}\r\n for i in range(1, limit + 1):\r\n tmp = lowbit(i)\r\n if tmp not in d:\r\n d[tmp] = []\r\n d[tmp].append(i)\r\n \r\n result = []\r\n i = Sum\r\n while i > 0 and Sum:\r\n if i in d and d[i]:\r\n result.append(d[i].pop())\r\n Sum -= i\r\n i = min(Sum, i)\r\n else:\r\n i -= 1\r\n \r\n if Sum:\r\n print(\"-1\")\r\n else:\r\n print(len(result))\r\n for i in result:\r\n print(i, end=' ')\r\n \r\n\r\nmain()\r\n \r\n", "def lowbit(n):\r\n\tf=1\r\n\twhile n&f==0:f<<=1\r\n\treturn(f,n)\r\ns,lim=map(int,input().split())\r\nans={range(1,lim+1)}\r\nbits=sorted(map(lowbit,ans),reverse=1)\r\ncs=0\r\nif sum(i[0]for i in bits)<s:exit(print(-1))\r\nans=[]\r\ni=0\r\nwhile s>0:\r\n\twhile bits[i][0]>s:i+=1\r\n\tans.append(bits[i][1])\r\n\ts-=bits[i][0]\r\n\ti+=1\r\nprint(len(ans))\r\nprint(ans)", "from math import log\r\n\r\nli=[[] for i in range(105)]\r\ns,l=map(int,input().split())\r\ntemp=0\r\nfor i in range(1,l+1):\r\n\tx=i&-i\r\n\tli[x].append(i)\r\n\ttemp+=x\r\nif temp<s:\r\n\tprint(-1)\r\nelse:\r\n\tx=int(log(s,2))\r\n\tz=1<<x\r\n\tans=[]\r\n\twhile True:\r\n\t\tif z<=s:\r\n\t\t\tif li[z]!=[]:\r\n\t\t\t\tans.append(li[z].pop())\r\n\t\t\t\ts-=z\r\n\t\t\t\tif s<=0:\r\n\t\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tz=z//2\r\n\t\telse:\r\n\t\t\tz=z//2\r\n\tprint(len(ans))\r\n\tprint(ans)", "sum,limit = [int(x) for x in input().split()]\r\n\r\nodd=int(limit/2)\r\neven=odd\r\nif limit%2==1:\r\n odd+=1\r\n\r\na=[]\r\n\r\nfor i in range(2,limit+1,2):\r\n c=0\r\n num=i\r\n while i%2==0:\r\n i/=2\r\n c+=1\r\n a.append([int(2*c),int(num)])\r\n\r\na.sort(key=lambda x:x[0],reverse=True)\r\n\r\ns=0\r\ni=0\r\nans=[]\r\ncount=0\r\nwhile i!=even and s+a[i][0]<sum:\r\n s+=a[i][0]\r\n ans.append(a[i][1])\r\n count+=1\r\n i+=1\r\n\r\nif s==sum:\r\n print(count)\r\n print(ans)\r\nelse:\r\n rem=sum-s\r\n if odd<rem:\r\n print(-1)\r\n else:\r\n j=1\r\n for i in range(rem):\r\n ans.append(j)\r\n j+=2\r\n count+=1\r\n print(count)\r\n print(ans)\r\n", "m,n = map(int,input().split())\nl = []\nfor i in range(1,n+1):\n x = bin(i)\n p = x.split('1')\n l.append((2len(p[-1]),i))\n \nl.sort(reverse = True)\ni = 0\nans= []\nwhile m>0 and i<len(l):\n if m>=l[i][0]:\n m -= l[i][0]\n ans.append(l[i][1])\n i+=1\n\nif m!=0:\n print(-1)\n exit()\nprint(len(ans))\nprint(ans)\n\t \t \t \t\t \t\t\t \t\t \t\t\t\t\t", "def lowbit(x):\n return x & (- x)\ns, l = map(int , input().split())\nlst = []\nwhile s > 0 and l > 0:\n if s - l >= 0:\n s -= lowbit(l)\n lst.append(l)\n l -= 1\nif s != 0:\n print(-1)\nelse:\n print(len(lst))\n print(lst)\n \t \t \t \t \t \t \t \t\t \t", "s,l=map(int,input().split(\" \"))\r\nli=[]\r\nwhile l!=0 and s!=0:\r\n x=1\r\n if l%2==0:\r\n g=l\r\n while g%2==0:\r\n x+=1\r\n g=g>>1\r\n if s>=pow(2,x-1):\r\n s-=pow(2,x-1)\r\n li.append(l)\r\n l-=1\r\nif s==0:\r\n print(len(li))\r\n print(li)\r\nelse:\r\n print(-1)\r\n", "sum,lim=list(map(int,input().split()))\r\na=[]\r\nwhile lim>0 and sum>0:\r\n\tif (lim&-lim)<=sum:\r\n\t\tsum=sum-(lim&-lim)\r\n\t\ta.append(lim)\r\n\tlim=lim-1\r\nif(sum>0):\r\n\tprint(-1)\r\nelse:\r\n\tprint(len(a))\r\n\tfor i in range(len(a)):\r\n\t\tprint(a[i])", "b, a = map(int, input().split())\r\nl = sorted((i & (-i), i) for i in range(1, a + 1))\r\nres = []\r\nfor x, e in l[::-1]:\r\n if b == 0: break\r\n if x <= b:\r\n b -= x\r\n res.append(e)\r\nif b:\r\n print(-1)\r\nelse:\r\n print(len(res))\r\n print(res)", "su, lim=map(int, input().split())\r\nvi=list()\r\nvp=list()\r\nfor i in range(1, lim+1):\r\n\tj=1\r\n\twhile j<=i:\r\n\t\tif i&j:\r\n\t\t\tvp.append((j, i))\r\n\t\t\tbreak\r\n\t\tj=2\r\nvp.sort()\r\nfor i in range(len(vp)-1, -1, -1):\r\n\tif vp[i][0]<=su:\r\n\t\tvi.append(vp[i][1])\r\n\t\tsu-=vp[i][0]\r\nif su==0:\r\n\tprint(len(vi))\r\n\tfor i in range(len(vi)):\r\n\t\tprint(vi[i], end=\" \")\r\nelse:\r\n\tprint(-1)", "s,l = map(int,input().split()) \r\narr = [0]+[0 for i in range(l)]\r\ndic={}\r\nfor i in range(1,l+1):\r\n x=bin(i)\r\n m=len(x)\r\n for j in range(0,m):\r\n if x[m-j-1]=='1':\r\n arr[i]=2j\r\n y =2j\r\n if y in dic:\r\n dic[y].append(i)\r\n else:\r\n dic[y]=[i]\r\n break\r\n\r\nf = s\r\narr1=sorted(arr)\r\nfor i in range(l,0,-1):\r\n if arr1[i]>f:\r\n arr1[i]=0\r\n else:\r\n f+= -arr1[i]\r\n\r\nif sum(arr1)==s:\r\n final = True\r\nelse:\r\n final = False\r\nfinal_arr=[]\r\nif final:\r\n t = 0\r\n for i in range(1,l+1):\r\n if arr1[i]!=0:\r\n t+=1\r\n for j in range(len(dic[arr1[i]])):\r\n if dic[arr1[i]][j]!=-1:\r\n final_arr.append(dic[arr1[i]][j])\r\n dic[arr1[i]][j]=-1\r\n break\r\n print(t)\r\n\r\n for i in final_arr:\r\n print(i,end=' ')\r\nelse:\r\n print(-1)", "def main():\r\n s, lm = map(int, input().split())\r\n c = {}\r\n for i in range(1, lm + 1):\r\n if (i & (-i)) not in c:\r\n c[i & (-i)] = 1\r\n else:\r\n c[i & (-i)] += 1\r\n p = list(c.keys())\r\n p.sort(reverse=True)\r\n used = {k: 0 for k in p}\r\n total = 0\r\n for k in p:\r\n count = 0\r\n if s >= k and count < c[k]:\r\n while s >= k and count < c[k]:\r\n count += 1\r\n s -= k\r\n used[k] = count\r\n total += count\r\n if s > 0:\r\n print(-1)\r\n else:\r\n print(total)\r\n ans = []\r\n for i in range(1, lm + 1):\r\n if used[i & (-i)] > 0:\r\n ans.append(i)\r\n used[i & (-i)] -= 1\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\nfrom collections import deque\r\nimport math\r\n\r\n\r\ndef lsb(i):\r\n return i & -i\r\n\r\ndef main():\r\n read = sys.stdin.readline\r\n sm, limit = (int(i) for i in read().split())\r\n sol = []\r\n msbs = []\r\n for i in range(1, limit + 1):\r\n lsb_i = lsb(i)\r\n msbs.append((lsb_i, i))\r\n msbs.sort(reverse=True)\r\n for msb, i in msbs:\r\n if sm - msb >=0:\r\n sm -= msb\r\n sol.append(str(i))\r\n if sm == 0:\r\n break\r\n if sm > 0:\r\n print(-1)\r\n else:\r\n print(len(sol))\r\n print(' '.join(sol))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "def lowbit(x):\r\n\treturn x & (-x)\r\n\t\r\ndef solve():\r\n\tglobal sum, limit, list\r\n\twhile(limit > 0 and sum!=0):\r\n\t\tif(sum-lowbit(limit)>=0):\r\n\t\t\tsum-=lowbit(limit)\r\n\t\t\tlist.add(limit)\r\n\t\tlimit-=1\r\n\tif(sum==0):\r\n\t\treturn True\r\n\treturn False\r\n\t\r\nsum, limit = tuple(int(i) for i in input().split())\r\nlist = set()\r\n\r\nif(solve()):\r\n\ts = str(len(list)) + \"\\n\"\r\n\tfor i in list:\r\n\t\ts += str(i) + \" \"\r\n\tprint (s[:len(s)-1])\r\nelse:\r\n\tprint (-1)", "import itertools\r\nimport math\r\nimport time\r\nfrom builtins import input\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nimport collections\r\nfrom heapq import heappop, heappush\r\nimport random\r\nimport os\r\nfrom random import randint\r\nimport decimal\r\n\r\n# from sys import stdin, stdout\r\n# input, print = stdin.readline, stdout.write\r\n\r\ndecimal.getcontext().prec = 18\r\n\r\n\r\ndef solve():\r\n # 2 iteration on average ?\r\n def lowbit(x):\r\n k = 2\r\n while x % k == 0:\r\n k = k 2\r\n return k // 2\r\n\r\n s, l = map(int, input().split())\r\n\r\n res = []\r\n for i in range(l, 0, -1):\r\n ll = lowbit(i)\r\n if ll <= s:\r\n res.append(i)\r\n s -= ll\r\n if s == 0:\r\n break\r\n\r\n if res != [] and s == 0:\r\n print(len(res))\r\n print(\" \".join(map(str, res)))\r\n else:\r\n print(-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, m = map(int, input().split())\r\n\r\nvals = {}\r\ntemp = []\r\nfor j in range(1, m + 1):\r\n lowest_bit = j & (-j)\r\n if lowest_bit not in vals:\r\n vals[lowest_bit] = []\r\n vals[lowest_bit].append(j)\r\n temp.append(lowest_bit)\r\ntemp.sort()\r\nresult = []\r\nfor x in reversed(temp):\r\n if x <=n and len(vals[x]):\r\n n -= x\r\n result.append(vals[x][-1])\r\n vals[x].pop()\r\n\r\nif n == 0:\r\n print(len(result))\r\n print(result)\r\nelse:\r\n print(-1)\r\n", "import sys\r\nimport math\r\nfrom collections import Counter\r\n\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n\r\ns, limit = map(int, input().split())\r\nc = {}\r\ni = 1\r\nwhile limit >= i :\r\n c[i] = (limit // i + 1) // 2\r\n i = 2\r\nt = s\r\nres = []\r\nfor i in sorted(c.keys(), reverse = True) :\r\n x = min(t // i, c[i])\r\n t = t - i * x\r\n for j in range(1, x + 1, 1) :\r\n res.append(i * (2 * j - 1))\r\nif t == 0 :\r\n print(len(res))\r\n print(\" \".join(str(i) for i in res))\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", "\ndef solve() :\n ans=[]\n for i in range(1,n+1):\n x=i\n c=0\n while x>0 :\n if x%2==1 :\n ans.append((2*c,i))\n break\n else:\n c+=1\n x=x//2\n ans.sort(reverse=True)\n s2=s\n ans2=[]\n for i in range(n):\n if ans[i][0]<=s2 :\n s2-=ans[i][0]\n ans2.append(ans[i][1])\n if s2==0 :\n break\n else:\n return [-1]\n print(len(ans2))\n return ans2\n\n\n\n\n\n\n\nfrom sys import stdin\ninput = stdin.readline\n\n\n\n\ns, n= [int(x) for x in input().split()]\nprint(solve())\n\n\n\n'''\n\nt=int(input())\nfor i in range(t) :\n print(solve())\n\n\nn=int(input())\n\nx=input().strip()\n\n\nn,m= [int(x) for x in input().split()]\n\n\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\n\nn=int(input())\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\n\n\nn=int(input())\narr=[int(x) for x in input().split()]\n'''", "# LUOGU_RID: 102441866\nn, m = map(int, input().split())\r\na = []\r\nwhile (n > 0 and m > 0):\r\n if (n - (m & -m)) >= 0:\r\n n -= m & -m\r\n a += m,\r\n m -= 1\r\nif n:\r\n print(-1)\r\nelse:\r\n print(len(a))\r\n print(a)\r\n", "s,l=map(int,input().split())\r\nans=[]\r\nwhile(s>0 and l>0):\r\n\tif(s-(l&l))>=0:\r\n\t\ts-=l&-l\r\n\t\tans.append(l)\r\n\tl-=1\r\nif s: print(-1)\r\nelse:\r\n\tprint(len(ans))\r\n\tprint(ans)", "from math import \r\nfrom collections import \r\nfrom bisect import \r\nimport heapq\r\nimport math\r\nfrom itertools import permutations\r\n\r\ndef is_prime(n):\r\n\r\n for i in range(2,math.ceil(math.sqrt(n))):\r\n if(n%i==0):\r\n return False\r\n return True\r\n\r\ndef sieve(n):\r\n arr=[True for _ in range(n+1)]\r\n\r\n for i in range(2,math.ceil(math.sqrt(n))):\r\n if(arr[i]==True):\r\n for j in range(ii,n+1,i):\r\n arr[j]=False\r\n\r\n return arr\r\n\r\n\r\ndef power(x, y, p):\r\n res = 1 # Initialize result\r\n\r\n # Update x if it is more\r\n # than or equal to p\r\n x = x % p\r\n\r\n if (x == 0):\r\n return 0\r\n\r\n while (y > 0):\r\n\r\n # If y is odd, multiply\r\n # x with result\r\n if ((y & 1) == 1):\r\n res = (res * x) % p\r\n\r\n # y must be even now\r\n y = y >> 1 # y = y/2\r\n x = (x * x) % p\r\n\r\n return res\r\n\r\ndef euclidean_distance(x1,y1,x2,y2):\r\n return sqrt(abs(x1-x2)2+abs(y1-y2)2)\r\n\r\ndef get_permutations(lo=0,hi=10):\r\n return list(permutations(range(lo,hi)))\r\n\r\n\r\ndef getDivisors(n):\r\n i = 1\r\n ans1=[]\r\n ans2=[]\r\n while i <= math.sqrt(n):\r\n\r\n if (n % i == 0):\r\n if (n / i == i):\r\n ans1.append(i)\r\n else:\r\n # Otherwise print both\r\n ans1.append(i)\r\n ans2.append(n//i)\r\n i = i + 1\r\n\r\n return ans1+ans2[::-1]\r\n\r\ndef solve():\r\n # s=input()\r\n # n=int(input())\r\n n,l=list(map(int,input().split()))\r\n\r\n def check(x, y):\r\n return x >= 0 and y >= 0 and x < n and y < m\r\n\r\n mod=int(1e9+7)\r\n d=defaultdict(int)\r\n d1=defaultdict(list)\r\n for i in range(1,l+1):\r\n x=bin(i)[2:]\r\n # print(x)\r\n ind=0\r\n for j in range(len(x)-1,-1,-1):\r\n if(x[j]=='1'):\r\n break\r\n ind+=1\r\n d[(2ind)]+=1\r\n d1[(2ind)].append(i)\r\n\r\n temp=[]\r\n for k,v in d.items():\r\n temp.append([k,v])\r\n temp.sort()\r\n j=len(temp)-1\r\n ans=[]\r\n # print(temp)\r\n while(n>0 and j>=0):\r\n x=n//temp[j][0]\r\n take=min(x,temp[j][1])\r\n n-=(taketemp[j][0])\r\n for k in range(take):\r\n ans.append(d1[temp[j][0]][-1])\r\n d1[temp[j][0]].pop()\r\n j-=1\r\n if(n!=0):\r\n print(-1)\r\n return\r\n print(len(ans))\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n n=1\r\n # n=int(input())\r\n while(n):\r\n n-=1\r\n solve()\r\n\r\n\r\n\r\n\r\n", "def main():\r\n _sum, limit = map(int, input().split())\r\n\r\n ans = []\r\n for i in range(limit, 0, -1):\r\n if _sum - (i & -i) >= 0:\r\n _sum -= (i & -i)\r\n ans.append(i)\r\n\r\n if _sum <= 0:\r\n break\r\n\r\n if _sum > 0:\r\n print(-1)\r\n else:\r\n print(len(ans))\r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "summ,lim = map(int,input().split())\r\nc = 0\r\nans = []\r\nfor i in range(lim,0,-1):\r\n c=(i^(i&(i-1)))\r\n if c<=summ:\r\n ans.append(i)\r\n summ-=c\r\nif summ!=0:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n print(ans)\r\n \r\n", "(a, b), x, y = list(map(int, input().split())), [], 0\r\n\r\ndef bin(s):\r\n return str(s) if s <= 1 else bin(s >> 1) + str(s & 1)\r\n\r\ndef lowbit(s):\r\n return int('1' + bin(s).split('1')[-1], 2)\r\n\r\nfor i in reversed(range(b + 1)):\r\n if y == a:\r\n break\r\n if a >= y + lowbit(i):\r\n x.append(i) \r\n y += lowbit(i)\r\n\r\nif y == a:\r\n print( len(x) )\r\n print( ' '.join(str(i) for i in x) )\r\nelse:\r\n print( -1 )", "s,l = map(int,input().split())\r\nc = []\r\nfor i in range(1,100001):\r\n if(i%2!=0):\r\n c.append([1,i])\r\n else:\r\n k = list(bin(i))\r\n k.reverse()\r\n z = k.index('1')\r\n c.append([pow(2,z),i])\r\nc = sorted(c)\r\nc.reverse()\r\nz = []\r\nfor i in range(len(c)):\r\n if(s==0):\r\n break\r\n elif(s>=c[i][0] and c[i][1]<=l):\r\n s-=c[i][0]\r\n if(s<0):\r\n s+=c[i][0]\r\n else:\r\n z.append(c[i][1])\r\nif(s!=0):\r\n print(-1)\r\nelse:\r\n print(len(z))\r\n print(z)\r\n", "import math\r\n\r\ndef getLSB(num):\r\n return num & -num\r\n \r\ndef getSet(sum, limit):\r\n res = [];\r\n while sum > 0 and limit > 0:\r\n lsb = getLSB(limit)\r\n if lsb <= sum:\r\n sum -= lsb\r\n res.append(str(limit))\r\n limit -= 1\r\n \r\n return -1 if sum > 0 else '{}\\n{}'.format(len(res), ' '.join(res))\r\n \r\nsum, limit = list(map(int, input().split(' ')))\r\nprint(getSet(sum, limit))", "def per(x):\r\n t = 0\r\n y = str(bin(x))[2:]\r\n for i in range(len(y) - 1, -1, -1):\r\n if y[i] == '1':\r\n t = i\r\n break\r\n return (2 * (len(y) - t - 1), x)\r\n\r\n\r\ndef perall(l):\r\n for i in range(1, l + 1):\r\n ans.append(per(i))\r\n return ans\r\n\r\ns, l = map(int, input().split())\r\nans = []\r\nperall(l)\r\nans.sort(reverse = True)\r\nanswer = []\r\nfor i in ans:\r\n if s - i[0] >= 0:\r\n s -= i[0]\r\n answer.append(i[1])\r\nif s != 0:\r\n print(-1)\r\nelse:\r\n print(len(answer))\r\n print(answer)", "import sys\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(106)\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef in_int():\r\n return (int(input()))\r\n\r\n\r\ndef in_list():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef in_str():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef in_ints():\r\n return (map(int, input().split()))\r\n\r\n\r\ntotal, n = in_ints()\r\n\r\nl = [i for i in range(1, n+1)]\r\n\r\nl = sorted(l, key= lambda l : l&-l)\r\nl = l[::-1]\r\n\r\n\r\nans = []\r\nfor xx in l:\r\n\r\n tt = xx&-xx\r\n if total >= tt:\r\n total-=tt\r\n ans.append(xx)\r\n\r\n\r\n\r\nif total == 0 :\r\n print(len(ans))\r\n for xx in ans:\r\n print(xx, end=' ')\r\nelse:\r\n print(-1)", "'''input\n4 3\n'''\nfrom sys import stdin\ninput = stdin.readline\nimport math\nimport sys\nfrom collections import defaultdict\nsys.setrecursionlimit(10 * 4)\n\n\n\ndef lowbit(n):\n\treturn n - (n &(n - 1))\n\t\n# main starts\ns, limit = list(map(int, input().split()))\nk = math.ceil(math.log(limit, 2))\nans = set()\nfor i in range(limit, 0, -1):\n\tx = lowbit(i)\n\tif s >= x:\n\t\ts -= x\n\t\tans.add(i)\nif s > 0:\n\tprint(-1)\n\nelse:\n\tprint(len(ans))\n\tfor i in ans:\n\t\tprint(i, end = ' ')", "\"\"\"http://codeforces.com/problemset/problem/437/B\"\"\"\n\ndef solve(s, limit):\n res = []\n bit_length = len('{:b}'.format(limit))\n # iterate through 2^x with x from 0, 1...bit_length-1\n for i in range(bit_length - 1, -1, -1):\n low_bit = 2 ** i\n for j in range(1, limit + 1, 2): # odd number: 1, 3, 5\n t = low_bit * j\n # print(i, t, res, s)\n if low_bit > s or t > limit:\n break\n s -= low_bit\n res.append(t)\n return res if s == 0 else None\n\nif __name__ == '__main__':\n res = solve(list(map(int, input().split())))\n if res is None:\n print(-1)\n else:\n print(len(res))\n print(' '.join(str(x) for x in res))\n", "\r\nsum, lim = map(int, input().split())\r\narr = []\r\n\r\nnow = 0\r\nfor i in range(lim, -1, -1):\r\n if now + (i & (-i)) <= sum:\r\n now += i & (-i)\r\n arr.append(i)\r\n\r\nif now != sum:\r\n print(-1)\r\nelse:\r\n print(len(arr) - 1)\r\n for i in range(0, len(arr) - 1):\r\n print(arr[i])\r\n", "def mi():\r\n return map(int, input().split())\r\n'''\r\n5 5\r\n'''\r\ns, l = mi()\r\nr = []\r\nfor i in range(l, 0, -1):\r\n if int(bin(i&-i), 2)<=s:\r\n r.append(i)\r\n s-=int(bin(i&-i), 2)\r\nif s:\r\n print (-1)\r\nelse:\r\n print (len(r))\r\n print (r)\r\n", "I = lambda : map(int, input().split())\r\n\r\ns, l = I()\r\n\r\ndef getLimit(n):\r\n c = 0\r\n while(n):\r\n if n & 1:\r\n break\r\n c += 1\r\n n >>= 1\r\n return 1<<c\r\n\r\nco = 0\r\nd = []\r\nfor i in range(1, l+1):\r\n v = getLimit(i)\r\n if v == 1:\r\n co += 1\r\n d.append([v, i])\r\n\r\nd.sort()\r\nans = []\r\nf = 0\r\nwhile(d and s):\r\n v, i = d.pop()\r\n if s >= v:\r\n s -= v\r\n ans.append(i)\r\n\r\nif s:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n print(ans)", "'I could not solve this problem and I saw answer for this problem'\n'see vice versa'\n\nSum , limit = map(int,input().split())\nres = []\nchoose = []\nfor i in range(1, limit + 1):\n\tchoose.append((i & -i, i))\n\nchoose.sort()\nfor i, j in choose[::-1]:\n\tif i <= Sum:\n\t\tSum-=i\n\t\tres.append(j)\nif Sum:\n\tprint(\"-1\")\nelse:\n\tprint(len(res))\n\tprint(res)", "s,l=map(int,input().split())\r\nk=[]\r\nfor i in range(1,l+1):\r\n c=i\r\n count=0\r\n while(1):\r\n z=i&1\r\n if z==1:\r\n break\r\n else:\r\n count=count+1\r\n i=i>>1\r\n k.append([pow(2,count),c])\r\nk=sorted(k)[::-1]\r\n#[[lowbit,number]]\r\nsum=0\r\nm=[]\r\nflag=False\r\nfor i in k:\r\n if sum+i[0]<=s:\r\n sum=sum+i[0]\r\n m.append(i[1])\r\n if sum==s:\r\n flag=True\r\nif flag==False:\r\n print(-1)\r\nelse:\r\n print(len(m))\r\n for i in m:\r\n print(i,end=\" \")\r\n print()", "import math\r\nsum, limit = map (int, input().split())\r\nx = 0\r\nlis = list()\r\nfor i in range (limit, 0, -1) :\r\n if x < sum and limit > 0 and x + (i & (-i)) <= sum:\r\n x += (i & (-i))\r\n lis.append (i)\r\n limit -= 1\r\nif x != sum :\r\n print (-1)\r\nelse :\r\n print (len (lis))\r\n for i in lis :\r\n print (i, \"\", end = \"\")\r\n", "s,n=map(int,input().split())\r\nt=0\r\nl=[]\r\nfor i in reversed(range(1,n+1)):\r\n\r\n\tif t+(2((bin(i)[::-1]).find(\"1\")))<=s:\r\n\t\tt+=(2((bin(i)[::-1]).find(\"1\")))\r\n\t\tl.append(i)\r\n\tif t==s:\r\n\t\tbreak\r\nif t!=s:\r\n\tprint(-1)\r\nelse:\r\n\tprint(len(l))\r\n\tprint(l)\r\n\t\t\t", "import sys\r\nimport string\r\nimport math\r\nfrom collections import defaultdict\r\nfrom functools import lru_cache\r\nfrom collections import Counter\r\nfrom fractions import Fraction\r\n\r\ndef mi(s):\r\n return map(int, s.strip().split())\r\n\r\ndef lmi(s):\r\n return list(mi(s))\r\n\r\ndef tmi(s):\r\n return tuple(mi(s))\r\n\r\ndef mf(f, s):\r\n return map(f, s)\r\n\r\ndef lmf(f, s):\r\n return list(mf(f, s))\r\n\r\ndef js(lst):\r\n return \" \".join(str(d) for d in lst)\r\n\r\ndef jsns(lst):\r\n return \"\".join(str(d) for d in lst)\r\n\r\ndef line():\r\n return sys.stdin.readline().strip()\r\n\r\ndef linesp():\r\n return line().split()\r\n\r\ndef iline():\r\n return int(line())\r\n\r\ndef mat(n):\r\n matr = []\r\n for _ in range(n):\r\n matr.append(linesp())\r\n return matr\r\n\r\ndef matns(n):\r\n mat = []\r\n for _ in range(n):\r\n mat.append([c for c in line()])\r\n return mat\r\n\r\ndef mati(n):\r\n mat = []\r\n for _ in range(n):\r\n mat.append(lmi(line())) \r\n return mat\r\n\r\ndef pmat(mat):\r\n for row in mat:\r\n print(js(row))\r\n\r\ndef main():\r\n n, l = mi(line())\r\n used = set()\r\n\r\n counts = defaultdict(list)\r\n for ll in range(1, l + 1):\r\n pos = 0\r\n i = ll\r\n while i:\r\n i, curr = i // 2, i % 2\r\n if curr == 1:\r\n counts[2pos].append(ll)\r\n break\r\n pos += 1\r\n\r\n pos = 0\r\n while n:\r\n n, curr = n // 2, n % 2\r\n if curr:\r\n need = 2pos\r\n if need in counts:\r\n used.add(counts[need].pop())\r\n else:\r\n # need to make need out of smaller powers of 2.\r\n required = need\r\n while need and required:\r\n if need not in counts:\r\n need //= 2\r\n elif need in counts and len(counts[need]) > 0:\r\n # Can use this, but how many should we use?\r\n num = required // need\r\n for _ in range(min(num, len(counts[need]))):\r\n used.add(counts[need].pop())\r\n required -= need\r\n else:\r\n # Check if there's something smaller.\r\n need //= 2\r\n\r\n if required != 0:\r\n print(-1)\r\n return\r\n pos += 1\r\n\r\n print(len(used))\r\n print(js(used))\r\nmain()\r\n", "s, l = map(int, input().split())\r\nt = []\r\nfor i in range(l, 0, -1):\r\n k = i & (i ^ (i - 1))\r\n if s >= k:\r\n t.append(str(i))\r\n s -= k\r\nprint(-1 if s else str(len(t)) + '\\n' + ' '.join(t))", "ub, l = map(int, input().split())\r\na=[]\r\ns = 0\r\nfor i in range(l, 0, -1):\r\n v = i & -i\r\n if s + v > ub:\r\n continue\r\n else:\r\n s += v\r\n a.append(i)\r\nif s==ub:\r\n print(len(a))\r\n print(a)\r\nelse:\r\n print(-1)", "s = input().split()\r\n(sumi,limit) = (int(i) for i in s)\r\n\r\nres = []\r\nout = []\r\n\r\ndef low(i):\r\n\tcount = 0\r\n\twhile(i%2 == 0):\r\n\t\ti = i//2\r\n\t\tcount += 1\r\n\treturn (2count)\r\n\r\n\r\nfor i in range(1,limit+1):\r\n\tres.append((low(i),i))\r\n#print(res)\r\nres = sorted(res,key = lambda x:x[0],reverse = True)\r\n#print(res)\r\nflag = 0\r\ns = 0\r\n\r\nfor i in range(len(res)):\r\n\tif(s + res[i][0] <= sumi):\r\n\t\ts += res[i][0]\r\n\t\tout.append(res[i][1])\r\n\r\n\tif(s == sumi):\r\n\t\tflag = 1\r\n\t\tbreak\r\n\r\nif(flag == 1):\r\n\tprint(len(out))\r\n\tfor i in range(len(out)):\r\n\t\tprint(out[i],end = ' ')\r\nelse:\r\n\tprint(-1)\r\n\r\n", "s,l=map(int,input().split())\nlowbit=[0]\nidx=[0]\nfor i in range(1,l+1):\n x=bin(i)\n x=x[::-1]\n lowbit.append(2x.index(\"1\"))\n idx.append(i)\nidx.sort(key=lambda i:lowbit[i],reverse=True)\np=0\nans=[]\nwhile(s and p<l):\n if lowbit[idx[p]]<=s:\n s-=lowbit[idx[p]]\n ans.append(idx[p])\n p+=1\nif s:\n print(-1)\nelse:\n print(len(ans))\n print(ans)\n", "s,l=map(int,input().split())\nans=[]\nwhile(s>0 and l>0):\n\tif(s-(l&l))>=0:\n\t\ts-=l&-l\n\t\tans.append(l)\n\tl-=1\nif s: print(-1)\nelse:\n\tprint(len(ans))\n\tprint(ans)\n\t\t\t\t\t\t\t\t\t \t \t \t \t \t\t\t \t\t", "s,l=map(int,input().split())\r\n\r\nlis =[list() for _ in range(100001)]\r\n\r\nfor i in range(1,l+1):\r\n lis[i & (~ (i-1))].append(i)\r\n\r\nnum=int(pow(2,s.bit_length()-1))\r\n\r\ninvalid=1\r\nans=list()\r\nwhile num:\r\n if num & s:\r\n temp=num\r\n length=1\r\n while temp:\r\n while len(lis[temp]):\r\n if length==0:\r\n break\r\n ans.append(lis[temp].pop())\r\n length-=1\r\n length=length<<1\r\n temp>>=1\r\n if length:\r\n invalid=0\r\n num>>=1\r\n\r\nif invalid:\r\n print(len(ans))\r\n for var in ans:\r\n print(var,end=\" \")\r\nelse:\r\n print(-1)\r\n", "s,l=map(int,input().split())\na=[]\nwhile(s>0 and l>0):\n\tif(s-(l&l))>=0:\n\t\ts-=l&-l\n\t\ta.append(l)\n\tl-=1\nif s: print(-1)\nelse:\n\tprint(len(a))\n\tprint(a)\n \t \t \t\t \t \t \t\t\t \t\t \t\t\t", "'''\r\nCreated on 2016年3月4日\r\n\r\n@author: HaoGe\r\n'''\r\nsum,limit=map(int,input().split())\r\nlv=[]\r\nres=[]\r\nfor i in range(1, limit+1):\r\n j=0\r\n while i&(1<<j) == 0 :\r\n j+=1 \r\n lv.append([2j,i])\r\n\r\nlv.sort()\r\ni=limit-1\r\nwhile i>=0 and sum>0:\r\n if sum-lv[i][0]>=0:\r\n sum-=lv[i][0]\r\n res.append(i)\r\n i-=1\r\nif sum>0:\r\n print(-1)\r\nelse:\r\n print(len(res))\r\n print(' '.join([str(lv[i][1]) for i in res]))\r\n\r\n \r\n \r\n\r\n", "s,l=map(int,input().split())\r\nr=[]\r\nwhile (l>0 and s>0):\r\n if s-(l&l)>=0:\r\n s-=(l&-l)\r\n r.append(l)\r\n l-=1\r\nif s!=0:\r\n print(-1)\r\nelse:\r\n print(len(r))\r\n print(r)", "kk=lambda:map(int, input().split())\r\nsu,l=kk()\r\ncnts,i=[],0\r\nwhile 1:\r\n\tv = l//2i\r\n\tv = v//2+(v&1)\r\n\tif v == 0: break\r\n\tcnts.append(v)\r\n\ti+=1\r\nc = 0\r\ns=[]\r\nfor i in range(len(cnts)-1,-1,-1):\r\n\tv = 2i\r\n\twhile v <= l:\r\n\t\tif c + 2i > su: break\r\n\t\ts.append(v)\r\n\t\tc+=2i\r\n\t\tv+=2*(i+1)\r\nif c < su:\r\n\tprint(-1)\r\nelse:\r\n\tprint(len(s))\r\n\tprint(s)", "from collections import defaultdict\nfrom bisect import bisect\n\n# lowbit(x) is the minimal 2k that divides x\n\ns, l = [int(x) for x in input().split()]\n\n#n = set([i for i in range(1, l+1)])\n\nns = defaultdict(list)\n\n\nfor x in range(1, l+1):\n\n y = x\n c = 0\n while not y & 1:\n y = y >> 1\n c += 1\n\n ns[2c].append(x)\n\n\n#print('ns', ns)\n\nvs = sorted(list(ns.keys()))\n\nres = []\nwhile s:\n # find x closest to s\n i = bisect(vs, s)\n\n if i == len(vs):\n i -= 1\n\n while i >= 0 and vs[i] > s:\n i -= 1\n \n while i >= 0 and not ns[vs[i]]:\n i -= 1\n\n if i == -1:\n break\n\n s -= vs[i]\n x = ns[vs[i]].pop()\n res.append(x)\n\n\nif s:\n print(-1)\nelse:\n print(len(res))\n print(res)\n \n \n", "from collections import defaultdict\r\nmp=defaultdict(list)\r\nsm,limit=map(int,input().split())\r\nts=0\r\nv=set()\r\nfor i in range(1,limit+1):\r\n for j in range(32):\r\n if(i&(1<<j)!=0):\r\n mp[1<<j].append(i)\r\n v.add(1<<j)\r\n ts+=(1<<j)\r\n break\r\nans=[]\r\nif(sm>ts):\r\n print(-1)\r\nelse:\r\n v=list(v)\r\n v.sort(reverse=True)\r\n for i in v:\r\n for j in mp[i]:\r\n if(sm>=i):\r\n sm-=i \r\n ans.append(j)\r\n else:\r\n break\r\n print(len(ans))\r\n print(ans)", "s,t = map(int,input().split())\r\nc = {}\r\narr = []\r\nfor i in range(t,0,-1):\r\n l = 0\r\n tmp = i\r\n while tmp%2==0:\r\n tmp /= 2\r\n l += 1\r\n if 2l<=s:\r\n s -= 2l\r\n arr.append(i)\r\nif s==0:\r\n print(len(arr))\r\n print(arr)\r\nelse:\r\n print(-1)", "s , l = map(int,input().split())\nans = []\nwhile(s > 0 and l> 0):\n\tif(s - (l&l)) >= 0:\n\t\ts -= l&-l\n\t\tans.append(l)\n\tl-=1\nif s: \n\tprint(-1)\nelse:\n\tprint(len(ans))\n\tprint(ans)\n", "# link: https://codeforces.com/contest/437/problem/B\r\n\r\nfor _ in range(1):\r\n sum_, limit_ = map(int, input().split())\r\n # brute force on the digits\r\n elements = set()\r\n for i in range(limit_, 0, -1):\r\n if i%2:\r\n if sum_ - 1 >= 0:\r\n sum_ -= 1\r\n elements.add(i)\r\n else:\r\n num = bin(i)[2:]\r\n c = 0 \r\n for j in num[::-1]:\r\n if j==\"1\":\r\n break\r\n else:\r\n c += 1\r\n if sum_ - (2*c) >= 0:\r\n sum_ -= pow(2, c)\r\n elements.add(i)\r\n if sum_ == 0:\r\n print(len(elements))\r\n print(elements) \r\n else:\r\n print(-1) ", "__author__ = 'asmn'\n\ns, l = tuple(map(int, input().split(' ')))\nt = 1\nwhile (t << 1) <= s:\n t <<= 1\n\nans = []\nwhile s > 0 and t > 0:\n n = min((l // t + 1)//2, s // t)\n s -= t * n\n for i in range(n):\n ans.append((i2+1) t)\n t >>= 1\n\nif s > 0:\n print(-1)\nelse:\n print(len(ans))\n print(tuple(ans))", "import math,sys\r\n#from itertools import permutations, combinations;import heapq,random;\r\nfrom collections import defaultdict,deque\r\nimport bisect as bi\r\ndef yes():print('YES')\r\ndef no():print('NO')\r\ndef I():return (int(sys.stdin.readline()))\r\ndef In():return(map(int,sys.stdin.readline().split()))\r\ndef Sn():return sys.stdin.readline().strip()\r\n#sys.setrecursionlimit(1500)\r\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 main():\r\n try:\r\n n,m=In()\r\n d=defaultdict(list)\r\n for i in range(1,m+1):\r\n z=math.log2(i&-i)\r\n d[int(2z)].append(i)\r\n l=list(d.keys())\r\n l.sort(reverse=True)\r\n ans=[]\r\n for x in l:\r\n t=min(len(d[x]),n//x)\r\n for i in range(t):\r\n ans.append(d[x][i])\r\n n-=(tx)\r\n if n==0:\r\n print(len(ans))\r\n print(ans)\r\n else:\r\n print(-1)\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# **************** All The Best ***************** #", "h,m=list(map(int,input().split()))\r\nk=[]\r\n\r\nwhile m>0:\r\n if h-m^(m&(m-1))>=0:\r\n h-=m^(m&(m-1))\r\n k.append(m)\r\n m-=1\r\nif h>0:\r\n print(-1)\r\nelse:\r\n print(len(k))\r\n print(k)", "from functools import reduce\r\nimport os\r\nimport sys\r\nfrom collections import \r\nfrom decimal import \r\nfrom math import \r\nfrom bisect import \r\nfrom heapq import \r\nfrom io import BytesIO, IOBase\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef value(): return tuple(map(int, input().split())) # multiple values\r\ndef arr(): return [int(i) for i in input().split()] # aay input\r\ndef sarr(): return [int(i) for i in input()] #aay from string\r\ndef starr(): return [str(x) for x in input().split()] #string aay\r\ndef inn(): return int(input()) # integer input\r\ndef svalue(): return tuple(map(str, input().split())) #multiple string values\r\ndef parr(): return [(value()) for i in range(n)] # aay of pairs\r\ndef Ceil(a,b): return a//b+int(a%b>0)\r\nalbhabet=\"abcdefghijklmnopqrstuvwxyz\"\r\nmo = 1000000007\r\ninf=1e18\r\ndiv=998244353\r\n#print(\"Case #{}:\".format(_+1),end=\" \")\r\n#print(\"Case #\",z+1,\":\",sep=\"\",end=\" \")\r\n# ----------------------------CODE------------------------------#\r\nsm,limit=value()\r\nd=defaultdict(list)\r\nfor i in range(1,limit+1):\r\n c=1\r\n j=i\r\n while(j&1==0):\r\n j=j>>1\r\n # print(i)\r\n c=2\r\n d[c]+=[i]\r\na=[i for i in sorted(d.keys(),reverse=True)]\r\nn=len(a)\r\nans=[]\r\nfor i in a:\r\n mn=min(len(d[i]),sm//i)\r\n ans+=d[i][:mn]\r\n sm-=mni\r\n if(sm==0):\r\n break\r\nif(sm==0):\r\n print(len(ans))\r\n print(ans)\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", "target, limit = map(int, input().split())\r\n\r\ndef lowbit(x):\r\n return x & (x ^ (x - 1))\r\n\r\nans = []\r\nfor i in range(limit, 0, -1):\r\n x = lowbit(i)\r\n if x <= target:\r\n ans.append(i)\r\n target -= x\r\n\r\nif target:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n print(\" \".join(map(str, ans)))\r\n \r\n", "a, b = map(int, input().split())\r\nres = []\r\nfor i in range(b, 0, -1):\r\n k = i & (i ^ (i - 1))\r\n if a >= k:\r\n res.append(str(i))\r\n a -= k\r\nif a > 0: \r\n print(-1)\r\nelse: \r\n print(len(res))\r\n print(res)\r\n", "sum, limit = input().split()\nsum = int(sum); limit = int(limit)\nprev_sum = sum\n\ns = []\ncur_sum = 0\nif sum%2:\n\ts.append(1)\n\tsum -= 1\n\tcur_sum += 1\n\ncount = {}\nj = 0\nwhile sum > 0:\n\tif sum%2:\n\t\tcount[2*j] = 1\n\tsum = sum >> 1\n\tj += 1\n\noccur = [0 for i in range(limit+1)]\n\nwhile len(count) > 0:\n\tcur = next(iter(count))\n\tif cur == 1:\n\t\ti = 1\n\t\tif prev_sum%2:\n\t\t\ti = 3\n\t\twhile count[cur] > 0 and i <= limit:\n\t\t\ts.append(i)\n\t\t\tcur_sum += 1\n\t\t\ti += 2\n\t\t\tcount[cur] -= 1\n\n\telif cur > limit:\n\t\ttry:\n\t\t\tcount[cur//2] += 2count[cur]\n\t\texcept:\n\t\t\tcount[cur//2] = 2count[cur]\n\n\telse:\n\t\ti = 1\n\t\twhile count[cur] > 0 and icur <= limit:\n\t\t\twhile curi <= limit and occur[curi]:\n\t\t\t\ti += 2\n\t\t\tif curi <= limit:\n\t\t\t\ts.append(curi)\n\t\t\t\toccur[curi] += 1\n\t\t\t\tcur_sum += cur\n\t\t\t\tcount[cur] -= 1\n\n\t\tif count[cur] != 0:\n\t\t\ttry:\n\t\t\t\tcount[cur//2] += 2count[cur]\n\t\t\texcept:\n\t\t\t\tcount[cur//2] = 2count[cur]\n\n\tdel(count[cur])\n\t# print(count)\n\t# print(s, cur_sum, prev_sum)\n\n\nif cur_sum == prev_sum:\n\tprint(len(s))\n\tfor i in s:\n\t\tprint(i, end=\" \")\n\tprint()\n\nelse:\n\tprint(-1)\n\n", "# 405376\nfrom collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom bisect import bisect_right, bisect_left\nfrom fractions import Fraction as frac\nimport math\nhpop = heappop\nhpush = heappush\nMOD = 109 + 7\n\ndef solution():\n # val --> array\n\n #\n sum_, limit = map(int, input().split())\n first_bit_map = defaultdict(list) \n for num in range(1, limit+1):\n first_bit = num & -num\n first_bit_map[first_bit].append(num)\n first_bits = list(sorted(first_bit_map.keys(), reverse=True))\n \n res = []\n i = 0\n while i < len(first_bits) and sum_:\n val = first_bits[i]\n\n if val > sum_ or len(first_bit_map[val]) == 0:\n i += 1\n continue\n\n sum_ -= val \n p = first_bit_map[val].pop()\n res.append(p)\n\n if sum_ > 0:\n return print(-1)\n\n print(len(res))\n return print(\" \".join(map(str, res)))\n # 5 1\n # 5 0\n # 1 1\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n \n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n", "def main():\n n, m = map(int, input().split())\n step = 1 << (m.bit_length() - 1)\n m += 1\n l = [True] m\n while step:\n if n >= step:\n for i in range(step, m, step):\n if l[i]:\n if n >= step:\n l[i] = False\n n -= step\n if not n:\n l = [j for j, f in enumerate(l) if not f]\n print(len(l))\n print(' '.join(map(str, l)))\n return\n else:\n break\n step //= 2\n print(-1)\n\n\nif __name__ == '__main__':\n main()\n", "# ========= /\\ /\| \|====/\|\r\n# \| / \\ \| \| / \|\r\n# \| /____\\ \| \| / \|\r\n# \| / \\ \| \| / \|\r\n# ========= / \\ ===== \|/====\| \r\n# code\r\n\r\ndef main():\r\n s,l = map(int , input().split())\r\n a = []\r\n for i in range(l,0,-1):\r\n k = i & (-i)\r\n if s - k < 0:\r\n continue\r\n s -= k\r\n a.append(i)\r\n \r\n if s > 0:\r\n print(-1)\r\n else:\r\n print(len(a))\r\n print(a)\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def lowval(i):\r\n global low\r\n return(low[i])\r\n\r\n\r\n# Main:\r\ns, lim = list(map(int, input().split()))\r\nlow = [0]\r\nresult = []\r\n\r\n# Create the list of lowbits\r\nm, pm = 1, 1\r\nwhile len(low) - 1 < lim:\r\n pm = len(low) - 1\r\n low += low[1:len(low) - 1] + [m]\r\n m = 2\r\nelse: \r\n if len(low) - 1 == lim:\r\n pm = len(low) - 1\r\n\r\nd = list(range(lim + 1))\r\n\r\nx = sorted(d, key=lowval)\r\nx2 = list(map(lowval, x))\r\n\r\nfor i in range(lim, 0, -1):\r\n if x2[i] <= s:\r\n result.append(x[i])\r\n s -= x2[i]\r\n if s == 0:\r\n break\r\n\r\nif s != 0:\r\n print(-1)\r\nelse:\r\n print(len(result))\r\n for i in result:\r\n print(i, end=' ')\r\n print()\r\n\r\n", "def lb(n) : return 2*bin(n)[2:][::-1].find('1')\r\nsm, lm = map(int,input().split())\r\nl = [0]\r\nfor i in range(1,lm+1) : l.append(lb(i))\r\nif sum(l) < sm : print(-1)\r\nelif sum(l) == sm : print(lm); print([i for i in range(1,lm+1)])\r\nelse : \r\n s =[]\r\n for i in range(1,lm+1) : s.append((l[i],i))\r\n s.sort(reverse = 1)\r\n ans = []\r\n cr = 0 \r\n for i in range(len(s)) : \r\n if cr + s[i][0] < sm :ans.append(s[i][1]); cr+=s[i][0]\r\n elif cr + s[i][0] == sm : \r\n ans.append(s[i][1])\r\n break \r\n print(len(ans))\r\n print(ans)\r\n", "som,lim = map(int,input().split())\r\nx = bin(som)[2:]\r\ny = bin(lim)[2:]\r\nimport math\r\n \r\ndef git(n): \r\n return int(math.log2(n&-n)+1)\r\nd = dict()\r\ne = dict()\r\nfor j in range(1,lim + 1):\r\n u = git(j)\r\n if u in d.keys():\r\n d[u] += 1\r\n e[u].append(j)\r\n else:\r\n d[u] = 1\r\n e[u] = [j]\r\nS = []\r\n\r\nn = len(y)\r\nwhile(n>=0 and som>0):\r\n if n not in e.keys():\r\n n -= 1\r\n elif len(e[n]) > 0 and som >= 2(n-1):\r\n som -= 2(n-1)\r\n S.append(e[n].pop())\r\n else:\r\n n -=1\r\nif som == 0:\r\n print(len(S))\r\n print(S)\r\nelse:\r\n print(-1)", "\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\ndef array_print(arr):\r\n print(' '.join(map(str, arr)))\r\n\r\n\r\nsum, n = multi_input()\r\n\r\na = [0](n+1)\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n a[i] = 1\r\n else:\r\n a[i] = 2a[i//2]\r\n\r\n# print(a)\r\nb = []\r\nnew_sum = flag = 0\r\nfor j in reversed(range(1,n+1)):\r\n if new_sum+a[j] <= sum:\r\n # print(j)\r\n new_sum += a[j]\r\n b.append(j)\r\n if new_sum==sum:\r\n flag = 1\r\n break\r\n\r\nif flag==0:\r\n print(-1)\r\nelse:\r\n print(len(b))\r\n array_print(b)", "s,l=map(int,input().split())\r\na=[]\r\nfor i in range(l,0,-1):\r\n n=i&-i\r\n if n<=s:\r\n s=s-n\r\n a.append(i)\r\nif s==0:\r\n print(len(a))\r\n for i in a: print(i,end=' ')\r\nelse:\r\n print(-1)\r\n", "s,l=input().split()\r\ns=int(s)\r\nl=int(l)\r\na=[]\r\nj=1\r\nfor i in range(1,l+1):\r\n count=0\r\n while(i>0):\r\n if((i&1)==0):\r\n count+=1\r\n else:\r\n a.append([2*count,j])\r\n break\r\n i=i>>1\r\n j+=1\r\na.sort()\r\nsum=0\r\nm=0\r\nans=[]\r\nfor ll in range(len(a)-1,-1,-1):\r\n if(sum+a[ll][0])<=s:\r\n sum+=a[ll][0]\r\n ans.append(str(a[ll][1]))\r\n if(sum==s):\r\n final=\" \".join(ans)\r\n print(len(ans))\r\n print(final)\r\n break\r\nelse:\r\n print(-1)", "import math\r\n\r\ndef low_bit(x):\r\n x = bin(x)[2::]\r\n bits = ''\r\n for i in x[::-1]:\r\n bits += i\r\n if i == '1':\r\n return int(bits[::-1], base=2)\r\n\r\ndef get_lower_2(x):\r\n x = bin(x)[2::]\r\n x = '1' + '0'(len(x)-1)\r\n return int(x, base=2)\r\n\r\n\r\ns, l = map(int, input().split())\r\n\r\ndct = {1: [i for i in range(1, l+1, 2)], 2: []}\r\n\r\nfor x in range(2, l+1, 2):\r\n if x % 4 == 2:\r\n dct[2].append(x)\r\n else:\r\n v = low_bit(x)\r\n try:\r\n dct[v].append(x)\r\n except:\r\n dct[v] = [x]\r\n\r\np = int(math.log2(get_lower_2(l)))\r\nlst = []\r\nc = 0\r\nfor i in range(p, -1, -1):\r\n while 2i <= s:\r\n try:\r\n lst.append(dct[2i].pop(0))\r\n s -= 2*i\r\n except:\r\n break\r\n\r\nif s > 0:\r\n print(-1)\r\n exit(0)\r\nprint(len(lst))\r\nprint(lst)", "s,l=input().split()\r\ns=int(s)\r\nl=int(l)\r\na=[]\r\nfor i in range(1,l+1):\r\n j=1\r\n count=1\r\n while i&j==0:\r\n count=2\r\n j=j<<1\r\n a.append([count,i])\r\na.sort()\r\na.reverse()\r\nans=[]\r\nans1=0\r\nfor ll in range(len(a)):\r\n if a[ll][0]<=s:\r\n s-=a[ll][0]\r\n ans+=[str(a[ll][1])]\r\n ans1+=1\r\nif s==0:\r\n print(ans1)\r\n print(' '.join(ans))\r\nelse:\r\n print(-1)\r\n\r\n", "def bin(n):\r\n res = \"\"\r\n while (n != 0):\r\n if n % 2 == 0:\r\n res += \"0\"\r\n n = n // 2\r\n else:\r\n res += \"1\"\r\n return res[: : -1]\r\n\r\n\r\ndef main():\r\n sum, limit = list(map(int, input().split()))\r\n A = []\r\n for i in range(1, limit + 1):\r\n A.append((int(bin(i), 2), i))\r\n A.sort(reverse=True,key= lambda x: x[0])\r\n res = []\r\n for i in range(0, limit):\r\n if sum == 0: break\r\n if sum >= A[i][0]:\r\n sum -= A[i][0]\r\n res.append(A[i][1])\r\n if sum != 0: \r\n print(-1)\r\n return\r\n print(len(res))\r\n print(res)\r\n\r\n \r\nif __name__ == '__main__':\r\n main()", "from math import log2, ceil\r\nfrom collections import deque\r\n\r\ndef lowbit(n):\r\n s = str(bin(n))[2:]\r\n i = len(s) - 1\r\n cnt = 0\r\n while s[i] != \"1\":\r\n i -= 1\r\n cnt += 1\r\n return cnt\r\n\r\ns, l = [int(i) for i in input().split()]\r\na = []\r\nlow = [deque() for i in range(ceil(log2(l)) + 1)]\r\nfor i in range(1, l + 1):\r\n x = lowbit(i)\r\n low[x].append(i)\r\ni = len(low) - 1\r\nres = []\r\nwhile i >= 0:\r\n if s == 0:\r\n break\r\n if len(low[i]) > 0 and 2 i <= s:\r\n s -= 2 i\r\n res.append(low[i].popleft())\r\n else:\r\n i -= 1\r\nif s == 0:\r\n print(len(res))\r\n print(\" \".join([str(i) for i in res]))\r\nelse:\r\n print(-1)", "import math\r\nt=1\r\nfor _ in range(t):\r\n #n=int(input())\r\n a=list(map(int, input().split()))\r\n summ=a[0]\r\n limit=a[1]\r\n r=[]\r\n for i in range(limit, 0, -1):\r\n if int(bin(i&-i), 2)<=summ:\r\n r.append(i)\r\n summ-=int(bin(i&-i), 2)\r\n if summ:\r\n print (-1)\r\n else:\r\n print (len(r))\r\n print (r)\r\n", "def low(n):\r\n x=str(bin(n))[2:]\r\n x=x[::-1]\r\n t=x.index(\"1\")\r\n temp=x[:t+1][::-1]\r\n return (int(temp,2))\r\n\r\ndef child_set(s,limit):\r\n lst=[[i,low(i)] for i in range(1,limit+1)]\r\n lst=[[0,0]]+lst\r\n lst=sorted(lst,reverse=True,key=lambda s:s[1])\r\n i=0\r\n ans=[]\r\n while s and lst and i<len(lst):\r\n if lst[i][1]<=s:\r\n s-=lst[i][1]\r\n ans.append(lst[i][0])\r\n lst.pop(i)\r\n else:\r\n i+=1\r\n if s:\r\n return -1\r\n else:\r\n print(len(ans))\r\n print(ans)\r\n return \"\"\r\n\r\n\r\na,b=map(int,input().strip().split())\r\nprint(child_set(a,b))", "s, l = map(int, input().split())\r\n\r\nresult = set()\r\n\r\nfor i in range(l, 0, -1):\r\n if not s:\r\n break\r\n ii = i & (-i)\r\n if s - ii >= 0:\r\n s -= ii\r\n result.add(str(i))\r\n\r\nif s:\r\n print(-1)\r\nelse:\r\n print(len(result))\r\n \r\n print(' '.join(result))\r\n ", "import math\r\nimport sys\r\nimport collections\r\nimport bisect\r\nimport string\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 s,l=get_ints()\r\n ans=dict()\r\n for i in range(1,l+1):\r\n val=i\r\n c=0\r\n while val&1!=1:\r\n val>>=1\r\n c+=1\r\n number=2*c\r\n if number not in ans:\r\n ans[number]=[i]\r\n else:\r\n ans[number].append(i)\r\n key=list(ans.keys())\r\n key.sort(reverse=True)\r\n sol=[]\r\n for i in key:\r\n val=min(len(ans[i]),s//i)\r\n for j in range(val):\r\n sol.append(ans[i][j])\r\n s-=vali\r\n #print(sol)\r\n if s==0:\r\n print(len(sol))\r\n print(sol)\r\n else:\r\n print(-1)", "\"\"\"\r\n Template written to be used by Python Programmers.\r\n Use at your own risk!!!!\r\n Owned by enraged(rating - 5 star at CodeChef and Specialist at Codeforces).\r\n\"\"\"\r\nimport sys\r\nimport bisect\r\nimport heapq\r\nfrom math import \r\nfrom collections import defaultdict as dd # defaultdict(<datatype>) Free of KeyError.\r\nfrom collections import deque # deque(list) append(), appendleft(), pop(), popleft() - O(1)\r\nfrom collections import Counter as c # Counter(list) return a dict with {key: count}\r\nfrom itertools import combinations as comb\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\r\n# sys.setrecursionlimit(2pow(10, 6))\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\nmod = pow(10, 9) + 7\r\nmod2 = 998244353\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(var): sys.stdout.write(var)\r\ndef l(): return list(map(int, data().split()))\r\ndef sl(): return list(map(str, data().split()))\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 [[val for i in range(n)] for j in range(m)]\r\n\r\n\r\ndef lower_two(n):\r\n i = 17\r\n answer = 1\r\n while i >= 0:\r\n answer = max(answer, gcd(int(pow(2, i)), n))\r\n i -= 1\r\n return answer\r\n\r\n\r\ns, limit = sp()\r\ndp = dict()\r\nfor i in range(1, limit+1):\r\n dp[i] = lower_two(i)\r\nprefix = sum(dp.values())\r\ndp = sorted(dp.items(), key=lambda x: x[1])\r\nif s > prefix:\r\n out(\"-1\")\r\n exit(0)\r\nanswer = []\r\nfor i in range(len(dp)-1, -1, -1):\r\n if dp[i][1] <= s:\r\n answer.append(dp[i][0])\r\n s -= dp[i][1]\r\n if s == 0:\r\n break\r\nout(str(len(answer))+\"\\n\")\r\nfor i in answer:\r\n out(str(i)+\" \")\r\nexit()\r\n", "R=lambda:map(int,input().split())\r\ns,l=R()\r\nimport math as m\r\nb=[]\r\ny=2\r\nfor i in range(1,l+1):\r\n if(i%2!=0):\r\n t=[i,1]\r\n b.append(t)\r\n elif(m.log(i,2)==int(m.log(i,2))):\r\n y=i\r\n t=[i,i]\r\n b.append(t)\r\n else:\r\n h=y\r\n while(i%h!=0):\r\n h=h//2\r\n t=[i,h]\r\n b.append(t)\r\nb=sorted(b,key=lambda x:x[1],reverse=True)\r\nq=0\r\nd=True\r\nf=[]\r\nfor j in b:\r\n q+=j[1]\r\n f.append(j)\r\n if(q==s):\r\n d=False\r\n break\r\n elif(q>s):\r\n q-=j[1]\r\n f.remove(j)\r\nif(d):\r\n print(-1)\r\n quit()\r\nprint(len(f))\r\nfor k in f:\r\n print(k[0],end=' ')\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s,l=map(int,input().split())\narr=sorted([(i&-i,i) for i in range(1,l+1)])\nans=[]\nfor c,i in arr[::-1]:\n if s==0:\n break\n if c<=s:\n ans.append(i);s-=c;\nif s:print('-1')\nelse:\n print(len(ans));print(ans)\n", "class 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\ns,l = g()\r\n \r\nres = []\r\ni = 16\r\nwhile i+1:\r\n c = 1\r\n while True:\r\n if 2*i c > l: break\r\n if 2i > s: break\r\n res.append(2i * c)\r\n c += 2\r\n s -= 2*i\r\n i -= 1\r\nif s:\r\n print(-1)\r\nelse:\r\n print(len(res))\r\n print(\" \".join(str(x) for x in res))", "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\nsm,limit=L()\r\nd={}\r\nfor i in range(limit,0,-1):\r\n x=bin(i)[2:]\r\n idx=(x[::-1]).index(\"1\")\r\n if idx not in d:\r\n d[idx]=[]\r\n d[idx].append(i)\r\nx=list(d.keys())\r\nx.sort(reverse=True)\r\ni=0\r\nA=[]\r\nwhile(i<len(x)):\r\n curr=2*(x[i])\r\n j=0\r\n while(sm>0 and curr<=sm and j<len(d[x[i]])):\r\n sm-=curr\r\n A.append(d[x[i]][j])\r\n j+=1\r\n if sm==0:\r\n break\r\n i+=1\r\nif sm!=0 or len(A)==0:\r\n print(-1)\r\n exit() \r\nprint(len(A))\r\nprint(A)\r\n\r\n", "n, l = map(int, input().split())\r\ni = 1\r\nwhile 2i < n:\r\n i = 2\r\nres = []\r\n\r\nwhile n and i:\r\n for j in range(i, l+1, 2i):\r\n if i > n:\r\n break\r\n else:\r\n res.append(j)\r\n n -= i\r\n i //= 2\r\nif n == 0:\r\n print(len(res))\r\n print(res)\r\nelse:\r\n print(-1)", "s, l = map(int, input().split())\nx = []\nfor i in range(1, l + 1):\n x.append((i & -i, i))\nss = sum([x[i][0] for i in range(len(x))])\nif ss < s: print(-1)\nelse:\n x = sorted(x, reverse=True) \n xx = 0; res = []; rc = 0\n for i in range(len(x)):\n if xx + x[i][0] <= s:\n xx += x[i][0]\n res.append(x[i][1])\n rc += 1\n if xx == s:\n print(rc)\n for i in range(rc):\n print(res[i], end=' ')\n else:\n print(-1)\n", "# Author : Mohamed Yousef \r\n# Date : 2023-04-30\r\nimport sys,math,bisect,collections,itertools,heapq\r\nfrom itertools import accumulate ,combinations ,permutations,chain\r\nfrom collections import defaultdict,deque,Counter\r\nsys.setrecursionlimit(50000) #To increase Recursion depth in py\r\ndef mvalues():return map(int,sys.stdin.readline().split())\r\ndef lvalues():return list(map(int,sys.stdin.readline().split()))\r\ndef svalues():return sys.stdin.readline().strip()\r\ndef test():return int(sys.stdin.readline())\r\n\r\nsum, limit = mvalues()\r\ndef TwoDArray (sum,limit):\r\n arr = []\r\n for i in range(limit,0,-1):\r\n count = 0\r\n constant = i\r\n while constant % 2 != 1:\r\n constant = constant // 2\r\n count += 1\r\n temp = [i, 2 ** count]\r\n arr.append(temp)\r\n return arr\r\ndef solve(sum,limit):\r\n arr=TwoDArray(sum,limit)\r\n ans = []\r\n i = 0\r\n while sum != 0 and i < limit:\r\n if sum - arr[i][1] >= 0:\r\n sum -= arr[i][1]\r\n ans.append(arr[i][0])\r\n i += 1\r\n if sum == 0:\r\n return (len(ans), ans)\r\n return (-1,-1)\r\nn, ans =solve(sum, limit)\r\nif n != -1:\r\n print(n)\r\n sys.stdout.write(\" \".join(map(str,ans)) + \"\\n\")\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n", "x, y = map(int, input().split())\r\na = []\r\nfor i in range(y, 0, -1):\r\n s = i & (i ^ (i - 1))\r\n if(x >= s):\r\n x -= s\r\n a.append(i);\r\nif(x > 0):\r\n print(-1)\r\nelse:\r\n print(str(len(a)))\r\n print(a)", "s,l=map(int,input().split())\r\nval=[]\r\nfor i in range(1,l+1):\r\n for b in range(17):\r\n if i&(1<<b):\r\n val.append([1<<b,i])\r\n break\r\nval.sort(reverse=True)\r\nans=[]\r\nfor i in val:\r\n if i[0]<=s:\r\n s-=i[0]\r\n ans.append(i[1])\r\nif s>0:\r\n print(-1)\r\n quit()\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i,end=\" \")", "def lowbit(n):\r\n binary_n = bin(n).replace(\"0b\", \"\")\r\n last_1 = 0\r\n for i,v in enumerate(binary_n[::-1]):\r\n if v=='1':\r\n last_1 = len(binary_n)-i-1\r\n break\r\n lowbit_n = binary_n[last_1::]\r\n return int(lowbit_n,2)\r\n\r\nsumm,limit = list(map(int,input().split()))\r\nans=[]\r\nfor i in range(limit,0,-1):\r\n if(i%2==0) and summ>0:\r\n if(lowbit(i)<=summ):\r\n ans.append(i)\r\n summ-=lowbit(i)\r\nfor i in range(1,limit+1):\r\n if(i%2!=0) and summ>0:\r\n ans.append(i)\r\n summ-=1\r\nif summ==0:\r\n print(len(ans))\r\n print(ans)\r\nelse:\r\n print(-1)", "from typing import Tuple\r\n\r\ndef lowbit(x: int) -> Tuple[int, int]:\r\n if x & 1:\r\n return 1, x\r\n else:\r\n idx = 0\r\n tmp = x\r\n while not (x & 1):\r\n x >>= 1\r\n idx += 1\r\n return pow(2, idx), tmp\r\n\r\nlst, ans = [], []\r\nsm, lim = map(int, input().split())\r\nfor i in range(lim):\r\n lst.append(lowbit(i+1))\r\n \r\nlst = sorted(lst, key=lambda x: x[0], reverse=True)\r\n\r\ni=0\r\nwhile(sm>0 and lim>0):\r\n if lst[i][0]>sm:\r\n i += 1\r\n else:\r\n sm -= lst[i][0]\r\n ans.append(lst[i])\r\n lim -= 1\r\n i += 1\r\nif sm>0:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n for p in ans:\r\n print(p[1], end=\" \")\r\n ", "s,lim=map(int,input().split())\r\nt=[]\r\np=[]\r\nfor el in range(1,lim+1):\r\n for b in range(0,30):\r\n if el&(1<<b):\r\n if b==0:\r\n p.append(el)\r\n else:\r\n \r\n t.append((1<<b,el))\r\n break\r\nt.sort(key=lambda x:x[0])\r\nans=[]\r\nwhile s>len(p) and t:\r\n v,num=t.pop()\r\n if s>=v:\r\n s-=v\r\n ans.append(num)\r\nwhile s>0 and p:\r\n num=p.pop()\r\n ans.append(num)\r\n s-=1\r\nif s:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n print(ans)\r\n ", "from collections import defaultdict\r\n\r\ndef solve():\r\n\r\n d = defaultdict(lambda : [0])\r\n\r\n SUM, limit = map(int, input().split())\r\n\r\n def lowest_bit(number):\r\n i = 1\r\n while number & i == 0:\r\n i <<= 1\r\n return i\r\n\r\n for i in range(1, limit + 1):\r\n index = lowest_bit(i)\r\n d[index].append(i)\r\n d[index][0] += 1\r\n\r\n i = 1\r\n ans = []\r\n while i < 232:\r\n if SUM & i:\r\n if d[i][0] > 0:\r\n ans.append(d[i][d[i][0]])\r\n d[i][0] -= 1\r\n else:\r\n need = 2\r\n power = i // 2\r\n while need > 0 and power > 0:\r\n pop_these = min(need, d[power][0])\r\n need -= pop_these\r\n if need > 0: \r\n need = 2\r\n for _ in range(pop_these):\r\n ans.append(d[power][d[power][0]])\r\n d[power][0] -= 1\r\n power >>= 1\r\n if need > 0:\r\n return -1\r\n i <<= 1\r\n\r\n return ans\r\n\r\nret = solve()\r\nif ret == -1:\r\n print(-1)\r\nelse:\r\n print(len(ret))\r\n for i in ret:\r\n print(i, end=' ')\r\n print()", "sum, limit = map(int, input().split())\r\n\r\nans = []\r\nwhile limit > 0 and sum > 0:\r\n if (limit & -limit) <= sum:\r\n sum -= (limit & -limit)\r\n ans.append(limit)\r\n limit -= 1\r\n\r\nif sum > 0:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n print(ans)", "from math import \n\ns, l = map(int, input().split())\nmL = floor(log2(l))\nmS = floor(log2(l))\nx = min(mL, mS)\n\nS = []\nwhile x >= 0:\n\ta = 1\n\twhile 2 ** x <= s and a * 2 ** x <= l:\n\t\tS.append(a * 2 x)\n\t\ta += 2\n\t\ts -= 2 x\n\tx -= 1\nif s == 0:\n\tprint(len(S))\n\tprint(' '.join(map(str, S)))\nelse:\n\tprint(-1)", "# cook your dish here\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter\r\nfrom itertools import permutations\r\nimport bisect\r\nimport math\r\nI=lambda: map(int,stdin.readline().split())\r\nI1=lambda: stdin.readline()\r\n#(a/b)%m =((a%m)pow(b,m-2)%m)%m\r\n\r\ndef lowbit(x):\r\n return x & (-x)\r\n\r\ns,l=I()\r\na=[]\r\nfor i in range(l,0,-1):\r\n x=lowbit(i)\r\n if x<=s:\r\n s-=x \r\n a.append(i)\r\n if s==0:\r\n break\r\nif s!=0:\r\n print(-1)\r\n exit()\r\nprint(len(a))\r\nprint(a)", "n,m=map(int,input().split())\r\ndic={1<<i:[] for i in range(20)}\r\ndef lowbit(x):\r\n return x&~(x-1)\r\nfor i in range(1,m+1):\r\n dic[lowbit(i)].append(i)\r\ndicn={1<<i:0 for i in range(21)}\r\nans=[]\r\nfor i in reversed(range(20)):\r\n f=1<<i\r\n if f&n or dicn[f]:\r\n if len(dic[f])>=((f&n)!=0)+dicn[f]:\r\n ans+=dic[f][:((f&n)!=0)+dicn[f]]\r\n else:\r\n if f<=1:\r\n ans=-1\r\n break\r\n l=(((f&n)!=0)+dicn[f])-len(dic[f])\r\n ans+=dic[f][:len(dic[f])]\r\n dicn[f>>1]+=l2\r\nif ans==-1:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n print(ans)", "def arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\nfrom sys import stdin\r\n\r\nall, ans = [], []\r\nsum, limit = arr_inp()\r\nfor i in range(1, limit + 1):\r\n if i & 1:\r\n all.append([i, 1])\r\n else:\r\n c, num = 1, i\r\n while (True):\r\n num >>= 1\r\n if num & 1:\r\n all.append([i, 2 ** c])\r\n break\r\n c += 1\r\n\r\nall.sort(key=lambda x: x[1])\r\n\r\nfor i in range(limit - 1, -1, -1):\r\n if all[i][1] <= sum:\r\n ans.append(all[i][0])\r\n sum -= all[i][1]\r\n if sum == 0:\r\n print(len(ans))\r\n exit(print(ans))\r\n\r\nprint(-1)\r\n", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\n\r\ndef main():\r\n s,n=rm()\r\n dv=[2i for i in range(18)]\r\n ml=[[] for i in range(18)]\r\n for i in range(1,n+1):\r\n for j in range(17,-1,-1):\r\n if i%dv[j]==0: ml[j].append(i); break\r\n r=[]\r\n for i in range(17,-1,-1):\r\n if len(ml[i])dv[i]<s: \r\n s-=len(ml[i])dv[i]\r\n r.extend(ml[i])\r\n else:\r\n q,s=divmod(s,dv[i])\r\n r.extend(ml[i][:q])\r\n if s!=0: return []\r\n return r\r\nr=main()\r\nif r:\r\n print(len(r))\r\n print(r)\r\nelse:\r\n print(-1)\r\n", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int, input().split()))\r\np2=[1]\r\nfor i in range(18):\r\n p2+=[(p2[-1]2)]\r\nN=105+5\r\nlb=[0]\r\nfor i in range(1,N):\r\n for bp in range(18):\r\n if ((i>>bp)&1):\r\n pos=bp\r\n break\r\n lb+=[p2[pos]]\r\nfor i in range(1):#nmbr():\r\n sm,n=lst()\r\n v=n\r\n ans=set()\r\n while v>0:\r\n if v<=sm:\r\n sm-=lb[v]\r\n ans.add(v)\r\n v-=1\r\n if sm==0:break\r\n if sm!=0:print(-1)\r\n else:\r\n print(len(ans))\r\n for v in ans:stdout.write(str(v)+' ')\r\n\r\n\r\n", "import math\r\na,b=map(int,input().split())\r\nl=[]\r\ns=0\r\nc=0\r\ndef ffs(n):\r\n return math.log2(n&-n)+1\r\nfor i in range(b,0,-1):\r\n d=ffs(i)\r\n ad=2(d-1)\r\n if(s+ad<=a):\r\n l.append(i)\r\n s=s+ad\r\n c=c+1\r\nif(s==a):\r\n print(c)\r\n print(l)\r\nelse:\r\n print(\"-1\")\r\n \r\n \r\n", "sum, limit = map(int, input().split())\r\nl = []\r\nfor i in range(limit, 0, -1):\r\n c = bin(i)[2:]\r\n c = c[::-1]\r\n index = c.index('1')\r\n if sum-(2index)>=0:\r\n sum = sum-(2index)\r\n l.append(i)\r\n if sum == 0:\r\n break\r\nif sum== 0:\r\n print(len(l))\r\n print(*l)\r\nelse:\r\n print(-1)\r\n \r\n\r\n \r\n" ]	{"inputs": ["5 5", "4 3", "5 1", "54321 12345", "1997 508", "100000 30000", "100000 100000", "1 100000", "29985 15678", "83451 17526", "96024 12472", "21741 3575", "40287 17817", "58934 6404", "62658 10881", "89829 8298", "5499 1023", "5499 1024", "53689 10552", "247 3270", "58413 1253", "47283 15757", "93145 14496", "66947 17657", "49940 18445", "61897 33128", "97660 28794", "99808 14000", "100000 1", "1 1", "100000 14047", "100000 14048", "21741 3576"], "outputs": ["2\n4 5", "3\n2 3 1", "-1", "7008\n8958 8925 11009 10808 8221 9771 11269 7017 6416 11723 10324 5654 6569 10454 9164 10754 6069 7913 12154 11111 7361 9619 9829 6664 8468 7239 5453 11577 11423 10031 11624 11486 11984 5378 8695 8640 9957 10453 11538 11943 9558 7846 12099 9317 11626 7001 5975 8923 9528 6850 10896 5989 10638 10500 10645 7253 12066 11635 5414 8824 7375 7771 8206 10398 11255 10687 7478 6385 11536 9511 7360 6646 5653 7317 9011 8265 9961 5817 9556 9903 5421 10281 6812 9312 6289 5468 8832 7075 7268 9545 12173 6126 6750 7789 740...", "429\n372 314 295 417 413 215 501 175 275 251 381 258 320 378 389 318 440 505 317 471 257 504 414 331 139 438 193 460 445 239 494 236 147 391 359 497 137 131 249 106 439 310 262 165 189 292 284 132 319 486 279 185 355 266 306 194 229 464 136 478 407 97 383 408 288 214 506 197 469 458 157 419 221 451 167 244 220 429 424 201 181 448 479 241 237 264 150 392 123 233 336 280 254 330 187 289 300 360 382 98 368 130 313 481 463 345 370 216 195 450 433 118 94 152 253 79 308 485 499 202 465 435 418 277 105 255 500 16...", "14127\n26613 18365 28664 17829 21130 27426 21717 24672 24071 19607 19925 18270 20786 18268 26819 18080 22887 17706 19483 19506 25016 20111 27484 24319 19265 19207 23108 18049 21756 19686 17917 20556 16214 23033 20478 16698 22390 22634 29193 15951 21420 25501 22429 26972 29281 17977 15947 20937 16929 24505 28551 18726 21728 28155 19143 24908 16146 20285 17685 26479 17361 25426 22492 20423 21741 22680 25133 24040 29191 27166 17529 24301 23308 24972 16663 25920 27616 23472 27211 27558 23076 27936 24467 26967 ...", "10735\n96613 91015 98664 98463 91130 97426 91717 94672 94071 89606 89924 93309 90786 92311 96819 90266 92887 95568 89482 89505 95016 90110 97484 94319 89677 91493 93108 99232 91756 89685 99279 90556 91261 93033 90478 89768 92390 92634 99193 99598 91420 95501 92429 96972 99281 91403 93630 90937 97183 94505 98551 93644 91728 98155 98300 94908 99721 90285 91440 96479 95030 95426 92492 90423 91741 92680 95133 94040 99191 97166 89517 94301 93308 94972 92077 95920 97616 93472 97211 97558 93076 97936 94467 96967 ...", "1\n99999", "4368\n12291 12258 14342 14141 11554 13104 14602 15169 14887 15056 13657 12832 13865 13787 12497 14087 12934 14599 15487 14444 11956 12952 13162 15113 11801 12732 14195 14910 14756 13364 14957 14819 15317 12023 12028 11973 13290 13786 14871 15276 12891 15480 15432 12650 14959 14893 13483 12256 12861 14335 14229 11522 13971 13833 13978 12923 15399 14968 14781 12157 14840 12905 11539 13731 14588 14020 12343 15367 14869 12844 12431 15589 14489 13240 12344 11598 13294 13937 12889 13236 15351 13614 11665 12645 1...", "10644\n14139 8541 16190 15989 8656 14952 9243 12198 11597 7132 7450 10835 8312 9837 14345 7791 10413 13094 7008 7031 12542 7636 15010 11845 7203 9019 10634 16758 9282 7211 16805 8081 8787 10559 8003 7294 9916 10160 16719 17124 8946 13027 9955 14498 16807 8929 11156 8463 14709 12031 16077 11170 9254 15681 15826 12434 17247 7810 8966 14005 12556 12952 10018 7948 9267 10206 12659 11566 16717 14692 7043 11827 10834 12498 9603 13446 15142 10998 14737 15084 10602 15462 11993 14493 9323 10649 7358 12256 12449 930...", "-1", "-1", "4069\n14430 14397 16481 16280 14255 15243 16741 17308 17026 17195 15796 14971 16004 15926 14636 16226 15073 16738 17626 16583 14095 15091 15301 17252 13940 14871 16334 17049 16895 15503 17096 16958 17456 14162 14167 14112 15429 15925 17010 17415 15030 17619 17571 14789 17098 17032 15622 14395 15000 16474 16368 15258 16110 15972 16117 15062 17538 17107 16920 14296 16979 15044 15580 15870 16727 16159 14482 17506 17008 14983 14570 17728 16628 15379 14483 13847 15433 16076 15028 15375 17490 15753 13803 14784 1...", "-1", "8365\n7494 7461 9545 9344 6757 8307 2598 5553 4952 10259 8860 4190 2991 3192 7700 9290 3768 6449 10690 9647 5897 8155 8365 5200 3867 5775 3989 10113 2637 8567 10160 10022 10520 3914 7231 7176 3271 3515 10074 10479 8094 6382 3310 7853 10162 5537 4511 7459 8064 5386 9432 4525 2609 9036 9181 5789 10602 10171 3950 7360 5911 6307 3373 8934 2622 3561 6014 4921 10072 8047 5896 5182 4189 5853 2958 6801 8497 4353 8092 8439 3957 8817 5348 7848 2678 4004 3747 5611 5804 2657 10709 4662 5286 6325 5940 7248 2855 3912 62...", "-1", "-1", "871\n346 262 304 933 200 223 161 515 233 402 159 373 180 894 325 834 956 1021 833 366 488 1020 482 459 655 445 546 256 213 755 303 165 663 547 260 552 653 647 217 622 300 826 778 681 305 239 800 648 835 252 795 565 871 246 573 710 745 314 220 332 186 613 899 160 349 559 1022 713 215 587 673 935 737 324 683 290 736 945 240 258 697 964 995 383 753 780 212 908 639 591 852 174 770 172 703 805 540 876 898 293 508 646 468 364 979 861 886 567 711 401 949 516 610 263 769 421 824 1001 1015 579 188 951 934 483 621 4...", "6908\n7165 7132 9216 9015 6428 7978 9476 5224 4623 9930 8531 3861 4776 8661 7371 8961 4276 6120 10361 9318 5568 7826 8036 4871 6675 5446 3660 9784 9630 8238 9831 9693 10191 6897 6902 6847 8164 8660 9745 10150 7765 6053 10306 7524 9833 5208 4182 7130 7735 5057 9103 4196 8845 8707 8852 5460 10273 9842 9655 7031 5582 5978 6413 8605 9462 8894 5685 4592 9743 7718 5567 4853 3860 5524 7218 6472 8168 4024 7763 8110 4831 8488 5019 7519 4496 3675 7039 5282 5475 7752 10380 4333 4957 5996 5611 6919 3792 8542 5897 6811...", "62\n3228 3223 3212 3243 3230 3241 3263 3227 3255 3265 3262 3239 3261 3235 3219 3236 3231 3267 3210 3233 3258 3266 3237 3232 3252 3218 3251 3222 3242 3216 3256 3238 3253 3247 3214 3259 3217 3211 3269 3215 3220 3246 3221 3225 3264 3244 3250 3257 3209 3248 3234 3268 3260 3229 3254 3270 3245 3226 3213 3240 3249 3224", "-1", "7089\n12370 12337 14421 14220 11633 13183 14681 10429 9828 15135 13736 9066 9981 13866 12576 14166 9481 11325 15566 14523 10773 13031 13241 10076 8743 10651 8865 14989 14835 13443 15036 14898 15396 8790 12107 12052 13369 13865 14950 15355 12970 11258 15511 12729 15038 10413 9387 12335 12940 10262 14308 9401 14050 13912 14057 10665 15478 15047 8826 12236 10787 11183 11618 13810 14667 14099 10890 9797 14948 12923 10772 10058 9065 10729 12423 11677 13373 9229 12968 13315 8833 13693 10224 12724 8670 8880 12244...", "12533\n11109 2861 13160 2325 5626 11922 6213 9168 8567 4103 4421 2766 5282 2764 11315 2576 7383 2202 3979 4002 9512 4607 11980 8815 3761 3703 7604 2545 6252 4182 2413 5052 5757 7529 4974 4265 6886 7130 13689 14094 5916 9997 6925 11468 13777 2473 8126 5433 11679 9001 13047 3222 6224 12651 3639 9404 14217 4781 2181 10975 9526 9922 6988 4919 6237 7176 9629 8536 13687 11662 2025 8797 7804 9468 6573 10416 12112 7968 11707 12054 7572 12432 8963 11463 6293 7619 4329 9226 9419 6272 14324 8277 8901 5655 1983 10863 ...", "7720\n14270 14237 16321 16120 13533 15083 16581 12329 11728 17035 15636 10966 11881 9968 14476 16066 10544 13225 17466 16423 12673 14931 15141 11976 10643 12551 10765 16889 16735 15343 16936 16798 17296 10690 14007 13952 10047 10291 16850 17255 14870 13158 10086 14629 16938 12313 11287 14235 14840 12162 16208 11301 15950 15812 15957 12565 17378 16947 10726 14136 12687 13083 10149 15710 16567 10337 12790 11697 16848 14823 12672 11958 10965 12629 14323 13577 15273 11129 14868 15215 10733 15593 12124 14624 10...", "5320\n15058 15025 17109 16908 14321 15871 17369 17936 17654 17823 16424 15599 16632 16554 15264 16854 15701 14013 18254 17211 13461 15719 15929 17880 14568 13339 13680 17677 17523 16131 17724 17586 18084 14790 14795 14740 16057 16553 17638 18043 15658 13946 18199 15417 17726 17660 16250 15023 15628 17102 16996 14289 16738 16600 16745 13353 18166 17735 17548 14924 13475 13871 14306 16498 17355 16787 13578 13628 17636 15611 13460 18356 13731 13417 15111 14365 16061 16704 15656 16003 18118 16381 14432 15412 1...", "4993\n29741 29708 31792 31591 29004 30554 32052 32619 32337 32506 31107 30282 31315 31237 29947 31537 30384 28696 32937 31894 28143 30402 30612 32563 29251 30182 28362 32360 32206 30814 32407 32269 32767 29473 29478 29423 30740 31236 32321 32726 30341 28628 32882 30100 32409 32343 30933 29706 30311 31785 31679 28972 31421 31283 31428 30373 32849 32418 32231 29607 28157 28553 28989 31181 32038 31470 28260 28310 32319 30294 28142 33039 28413 30690 29794 29048 30744 31387 30339 30686 32801 31064 29115 30095 3...", "13667\n25407 17159 27458 16623 19924 26220 20511 23466 22865 18401 18719 17064 19580 17062 25613 16874 21681 16500 18277 18300 23810 18905 26278 23113 18059 18001 21902 16843 20550 18480 16711 19350 20055 21827 19272 15491 21184 21428 27987 28392 20214 24295 21223 25766 28075 16771 22424 19731 15722 23299 27345 17520 20522 26949 17937 23702 28515 19079 16479 25273 16154 24220 21286 19217 20535 21474 23927 22834 27985 25960 16322 23095 22102 23766 15456 24714 26410 22266 26005 26352 21870 26730 23261 25761 ...", "14000\n10613 2365 12664 1829 5130 11426 5717 8672 8071 3607 3925 2270 4786 2268 10819 2080 6887 1706 3483 3506 9016 4111 11484 8319 3265 3207 7108 2049 5756 3686 1917 4556 215 7033 4478 698 6390 6634 13193 13598 5420 9501 6429 10972 13281 1977 7630 4937 929 8505 12551 2726 5728 12155 3143 8908 147 4285 1685 10479 1361 9426 6492 4423 5741 6680 9133 8040 13191 11166 1529 8301 7308 8972 663 9920 11616 7472 11211 11558 7076 11936 8467 10967 5797 7123 3833 8730 8923 5776 13828 7781 8405 5159 1487 10367 4313 321...", "-1", "1\n1", "-1", "14043\n10661 2413 12712 1877 5178 11474 5765 8720 8119 3655 3973 2318 4834 2316 10867 2128 6935 1754 3531 3554 9064 4159 11532 8367 3313 3255 7156 2097 5804 3734 1965 4604 263 7081 4526 746 6438 6682 13241 13646 5468 9549 6477 11020 13329 2025 7678 4985 977 8553 12599 2774 5776 12203 3191 8956 195 4333 1733 10527 1409 9474 6540 4471 5789 6728 9181 8088 13239 11214 1577 8349 7356 9020 711 9968 11664 7520 11259 11606 7124 11984 8515 11015 5845 7171 3881 8778 8971 5824 13876 7829 8453 5207 1535 10415 4361 326...", "3573\n189 156 2240 2039 14 1002 2500 3067 2785 2954 1555 730 1763 1685 395 1985 832 2497 3385 2342 3040 850 1060 3011 1487 630 2093 2808 2654 1262 2855 2717 3215 3099 1631 1199 1188 1684 2769 3174 789 3378 3330 548 2857 2791 1381 154 759 2233 2127 1017 1869 1731 1876 821 3297 2866 2679 55 2738 803 1339 1629 2486 1918 241 3265 2767 742 329 3487 2387 1138 242 1400 1192 1835 787 1134 3249 1512 1563 543 2398 3332 63 1702 2231 776 3404 510 2668 469 2243 1016 1057 1566 943 667 1411 3198 699 499 3531 2227 576 157..."]}	UNKNOWN	PYTHON3	CODEFORCES	104
8f93f9bd8f9064af561ecdf39f5a1e37	Alternating Current	Mad scientist Mike has just finished constructing a new device to search for extraterrestrial intelligence! He was in such a hurry to launch it for the first time that he plugged in the power wires without giving it a proper glance and started experimenting right away. After a while Mike observed that the wires ended up entangled and now have to be untangled again. The device is powered by two wires "plus" and "minus". The wires run along the floor from the wall (on the left) to the device (on the right). Both the wall and the device have two contacts in them on the same level, into which the wires are plugged in some order. The wires are considered entangled if there are one or more places where one wire runs above the other one. For example, the picture below has four such places (top view): Mike knows the sequence in which the wires run above each other. Mike also noticed that on the left side, the "plus" wire is always plugged into the top contact (as seen on the picture). He would like to untangle the wires without unplugging them and without moving the device. Determine if it is possible to do that. A wire can be freely moved and stretched on the floor, but cannot be cut. To understand the problem better please read the notes to the test samples. The single line of the input contains a sequence of characters "+" and "-" of length n (1<=≤<=n<=≤<=100000). The i-th (1<=≤<=i<=≤<=n) position of the sequence contains the character "+", if on the i-th step from the wall the "plus" wire runs above the "minus" wire, and the character "-" otherwise. Print either "Yes" (without the quotes) if the wires can be untangled or "No" (without the quotes) if the wires cannot be untangled. Sample Input -++- +- ++ - Sample Output Yes No Yes No	[ "t = input()\r\n#-+-++--+\r\nstack = []\r\nfor i in t:\r\n\ttry:\r\n\t\tif stack[-1] == i:\r\n\t\t\tstack.pop()\r\n\t\telse:\r\n\t\t\tstack.append(i)\r\n\texcept:\r\n\t\tstack.append(i)\r\nif len(stack) == 0:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "arr = list(input())\nans = []\nfor i in arr:\n if len(ans)==0:\n ans.append(i)\n else:\n if ans[-1]==i:\n ans.pop(-1)\n else:\n ans.append(i)\nif len(ans):\n print('No')\nelse:\n print('Yes')\n \t\t \t \t\t \t\t\t\t \t\t \t\t \t\t \t", "current=input()\ncurrent_stack=[]\nflag=0\n#current_stack.append(current[0])\nfor i in range(0,len(current)):\n if current_stack.__len__()==0:\n current_stack.append(current[i])\n continue\n if current[i]==current_stack[-1]:\n current_stack.pop()\n \n else: \n current_stack.append(current[i]) \n\n \n\nif len(current_stack):\n print(\"No\")\nelse:\n print(\"Yes\") ", "s = input()\r\nl = []\r\n \r\nfor i in s:\r\n\tif len(l) and i == l[-1]:\r\n\t\tdel l[-1]\r\n\telse:\r\n\t\tl.append(i)\r\n \r\nprint('Yes' if l == [] else 'No')", "from sys import stdin, stdout\ndef fin(): return stdin.readline().strip()\ndef fout(x): stdout.write(str(x) + '\\n')\n\nstk = []\nfor i in fin():\n if stk and stk[-1] == i: stk.pop()\n else: stk.append(i)\nif not stk: fout('Yes')\nelse: print('No')", "a=input()\r\nb,c=1,a[0]\r\nfor i in range(1,len(a)):\r\n if a[i]!=c:\r\n b+=1\r\n else:\r\n b-=1\r\n c='+' if c=='-' else '-'\r\nprint('Yes' if b==0 else 'No')", "sequence = input().strip()\n\nif len(sequence) % 2 != 0:\n print('No')\nelse:\n stack = []\n for s in sequence:\n if stack and s == stack[-1]:\n stack.pop()\n else:\n stack.append(s)\n\n if stack:\n print('No')\n else:\n print('Yes')", "l = list(input())\nnew = ''\nidx = 0\nif len(l)%2!=0:\n print('No')\nelse:\n for i in range(len(l)):\n if i%2!=0:\n if l[i]=='+':\n l[i]='A'\n else:\n l[i]='B'\n else:\n if l[i]=='+':\n l[i]='B'\n else:\n l[i]='A'\n stack = []\n for i in l:\n if stack:\n if stack[-1]!=i:\n stack.pop()\n else:\n stack.append(i)\n else:\n stack.append(i)\n if stack:\n print('No')\n else:\n print('Yes')\n", "def can_untangle_wires(sequence):\n stack = []\n\n for char in sequence:\n if stack and stack[-1] == char:\n stack.pop()\n else:\n stack.append(char)\n\n return \"Yes\" if not stack else \"No\"\n\n\n# Read the sequence of characters\nsequence = input()\n\n# Check if the wires can be untangled\nresult = can_untangle_wires(sequence)\n\n# Print the result\nprint(result)\n\n\t\t\t\t \t \t\t\t\t \t \t\t\t \t\t \t", "n = str(input())\r\nm=[1]\r\nif len(n)==1 and n=='-':\r\n print(\"No\")\r\nelif len(n)==1 and n=='+':\r\n print('No')\r\nelse:\r\n\r\n for i in n:\r\n if i=='+' and i!=m[-1]:\r\n m.append('+')\r\n elif i=='-' and i!=m[-1]:\r\n m.append(i)\r\n else:\r\n if m[len(m)-1]==i:\r\n m.pop()\r\n\r\n if len(m)==1 :\r\n print(\"Yes\")\r\n else:\r\n print('No')", "# https://codeforces.com/contest/343/problem/B\r\n\r\ninp_arr = input()\r\n\r\nstack = []\r\nfor i in inp_arr:\r\n if not stack:\r\n stack.append(i)\r\n else:\r\n if stack[-1] == i:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n\r\nif stack:\r\n print('No')\r\nelse:\r\n print('Yes')", "ch = input()\r\nstack = []\r\nfor i in ch:\r\n if i == \"+\":\r\n if stack != [] and stack[len(stack) - 1] == \"+\":\r\n stack.pop(len(stack) - 1)\r\n else:\r\n stack.append(i)\r\n else:\r\n if stack != [] and stack[len(stack) - 1] == \"-\":\r\n stack.pop(len(stack) - 1)\r\n else:\r\n stack.append(i)\r\nif stack==[]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def possi(s):\r\n if len(s)%2==1:\r\n return \"No\" \r\n stack=[]\r\n stack.append(s[0])\r\n for i in range(1,len(s)):\r\n if s[i]==\"+\" and stack and stack[-1]==\"+\":\r\n stack.pop()\r\n elif s[i]==\"-\" and stack and stack[-1]==\"-\":\r\n stack.pop()\r\n else:\r\n stack.append(s[i])\r\n if len(stack)!=0:\r\n return \"No\"\r\n return \"Yes\"\r\ns=input()\r\nprint(possi(s))", "s = input()\r\nstack = []\r\n\r\nif len(s) % 2 != 0:\r\n print('No')\r\n exit()\r\n\r\nfor symbol in s:\r\n if not stack:\r\n stack.append(symbol)\r\n elif stack[-1] == symbol:\r\n stack.pop()\r\n else:\r\n stack.append(symbol)\r\n\r\nif not stack:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "import sys, math\r\nfrom os import path\r\n# from TestCaseGen import test\r\n\r\nINF = math.inf\r\n\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 solve(s):\r\n stack = []\r\n for c in s:\r\n if len(stack) == 0:\r\n stack.append(c)\r\n else:\r\n if c == stack[-1] in \"+-\":\r\n stack.pop()\r\n else:\r\n stack.append(c)\r\n return \"Yes\" if len(stack) == 0 else \"No\"\r\n\r\ndef main():\r\n # test(10, -100, 100, 10)\r\n for _ in range(1):\r\n s = getString()\r\n printInt(solve(s))\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n################## UTILITY FUNCTIONS #######################\r\n\r\ndef getInt():\r\n return int(sys.stdin.readline().strip())\r\n\r\ndef getInts():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\ndef getList():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef getString():\r\n return sys.stdin.readline().strip()\r\n\r\ndef printInt(n):\r\n sys.stdout.write(str(n) + '\\n')\r\n\r\ndef printList(arr):\r\n sys.stdout.write(' '.join(map(str, arr)) + '\\n')\r\n\r\ndef printString(s):\r\n sys.stdout.write(s + '\\n')\r\n\r\nmain()\r\n", "def stackcheck(v):\n stack = []\n stack.append(v[0])\n for i in range(1, len(v)):\n if len(stack) == 0:\n stack.append(v[i])\n continue\n temp = stack.pop()\n if v[i] == temp:\n continue\n else:\n stack.append(temp)\n stack.append(v[i])\n\n return \"YES\" if len(stack) == 0 else \"NO\"\n \n\ndef main():\n v = input()\n print(stackcheck(v))\n\nmain()\n\t \t \t \t \t\t\t \t \t\t \t\t\t", "# cook your dish here\r\ns = input()\r\n\r\nst= []\r\nfor i in s:\r\n if st == []:\r\n st.append(i)\r\n else:\r\n if st[-1] == i:\r\n st.pop()\r\n else:\r\n st.append(i)\r\nif st == []:\r\n print('Yes')\r\nelse:\r\n print(\"No\")", "import heapq\r\nimport math\r\nimport os\r\nfrom collections import Counter, deque, defaultdict\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nimport threading\r\nfrom heapq import \r\nimport random\r\n\r\n\r\ndef S():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef IS():\r\n return sys.stdin.readline().replace('\\n', '')\r\n\r\n\r\ndef main():\r\n s = IS()\r\n queue = deque(s[0])\r\n n = len(s)\r\n if n % 2 == 1:\r\n print('No')\r\n return\r\n for i in range(1, n):\r\n if queue:\r\n last = queue.pop()\r\n el = s[i]\r\n if el != last:\r\n queue.append(last)\r\n queue.append(el)\r\n else:\r\n queue.append(s[i])\r\n if len(queue) > 0:\r\n print('No')\r\n else:\r\n print('Yes')\r\n\r\n\r\nif __name__ == '__main__':\r\n # for _ in range(II()):\r\n # main()\r\n main()", "from collections import deque\r\nwire = input()\r\nl = len(wire)\r\ns = []\r\ntop = 0\r\nfor c in wire:\r\n s.append(c)\r\n top += 1\r\n while(top >= 2 and s[-1] == s[-2]):\r\n s.pop()\r\n s.pop()\r\n top -= 2\r\nif(top == 0):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "a = input()\r\na = list(a)\r\nk = []\r\nfor i in a:\r\n if not k:\r\n k.append(i)\r\n elif i != k[-1]:\r\n k.append(i)\r\n else:\r\n k.pop()\r\nif k:\r\n print('No')\r\nelse:\r\n print('Yes')", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),109+7\r\n# sys.setrecursionlimit(10 * 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nNeo = lambda : list(map(int,input().split()))\r\n# test, = Neo()\r\ns = input()\r\nst = ['1']\r\nfor i in s:\r\n if st[-1] == i:\r\n st.pop()\r\n else:\r\n st.append(i)\r\nif len(st) == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "# import sys\r\n# sys.stdout=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\output.txt','w')\r\n# sys.stdin=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\input.txt','r')\r\n\r\n\r\nimport heapq\r\nimport math\r\nimport collections\r\nimport bisect\r\nmod=10*9+7\r\ndef solve(s):\r\n\r\n stack=[]\r\n for i in s:\r\n if not stack:\r\n stack.append(i)\r\n elif stack[-1]==i:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n if not stack:\r\n return \"YES\"\r\n return \"NO\" \r\n \r\n\r\ndef main():\r\n # t=int(input())\r\n# for _ in range(t):\r\n # n=int(input())\r\n s=input() \r\n print(solve(s)) \r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n", "s=input()\r\nif(len(s)%2!=0):\r\n print(\"No\")\r\nelse:\r\n st=[]\r\n for i in s:\r\n if(st==[]):\r\n st.append(i)\r\n else:\r\n if(i==st[-1]):\r\n st.pop()\r\n else:\r\n st.append(i)\r\n if(st==[]):\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "import sys\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_string(): return sys.stdin.readline().strip()\ndef get_int(): return int(sys.stdin.readline().strip())\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\n\n\n# Output for list\n# sys.stdout.write(\" \".join(map(str, final)) + \"\\n\")\n\n# Output for int or str\n# sys.stdout.write(str(best) + \"\\n\")\n\n\n\ndef solve(s):\n plus = 0\n minus = 0\n\n stack = []\n\n for ele in s:\n if ele == '+':\n if stack:\n if stack[-1] == '+':\n stack.pop()\n else:\n stack.append(ele)\n else:\n stack.append(ele)\n\n else:\n if stack:\n if stack[-1] == '-':\n stack.pop()\n else:\n stack.append(ele)\n else:\n stack.append(ele)\n \n if len(stack) == 0:\n print('Yes')\n else:\n print('No')\n\n\n\n\n\n\n\n\n\n\n\n\n\ns = get_string()\nsolve(s)\n", "s = input()\r\nstack=[]\r\nf=1\r\nfor c in s:\r\n if len(stack)==0:\r\n stack.append(c)\r\n else: \r\n if stack[-1]==c:\r\n stack.pop()\r\n else: stack.append(c)\r\nif len(stack)>0:\r\n print(\"No\")\r\nelse: print(\"Yes\")\r\n\r\n\n# Sun Jan 09 2022 07:26:43 GMT+0000 (Coordinated Universal Time)\n", "s = input()\r\nst = []\r\nfor x in s:\r\n if not st or st[-1] != x:\r\n st.append(x)\r\n else:\r\n st.pop()\r\nif st:\r\n print('No')\r\nelse:\r\n print('Yes')", "W,st = list(input()),[]\r\n\r\nfor i in W:\r\n\tif len(st) and st[-1]==i:\r\n\t\tst.pop()\r\n\telse:\r\n\t\tst.append(i)\r\n\r\nprint('No') if len(st) else print('Yes')", "# program to find whether cables can be untangaled or not\n\ndef tangledOrNot(s):\n if len(s) % 2 == 1:\n return \"No\"\n else:\n stack = []\n for ch in s:\n if len(stack) and stack[-1] == ch:\n stack.pop()\n else:\n stack.append(ch)\n return 'Yes' if len(stack) == 0 else 'No'\n\n\ns = input()\nprint(tangledOrNot(s))", "stack = []\r\ns = input()\r\n\r\nfor value in s:\r\n if not stack:\r\n stack.append(value)\r\n elif value == stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(value)\r\n \r\nif not stack:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "#!/usr/bin/env python\n# -- coding: utf-8 --\n\nstack = ['#']\nfor c in input():\n if stack[-1] == c:\n stack.pop()\n else:\n stack.append(c)\n\nstack.pop()\nprint(\"No\" if len(stack) else \"Yes\")\n", "s = input()\r\nl = [s[0]]\r\nlen1 = len(s)\r\ni = 1\r\nflag = 0\r\nwhile i < len1:\r\n p = l.pop()\r\n if p != s[i]:\r\n l.append(p)\r\n l.append(s[i])\r\n i+=1\r\n else:\r\n i+=1\r\n if len1 == i and len(l) == 0:\r\n flag = 1\r\n print('Yes')\r\n else:\r\n if len(l) == 0:\r\n l.append(s[i])\r\n i+=1\r\nif flag == 0:\r\n try:\r\n l.pop()\r\n print('No')\r\n except:\r\n print('Yes')", "s=input()\r\nst=[]\r\nfor i in range(0,len(s)):\r\n if len(st)==0 or st[-1]!=s[i]:\r\n st.append(s[i])\r\n else:\r\n st.pop()\r\nif st:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\n\nclass Solution:\n\n\tdef entangled(self, nums):\n\t\tstack = []\n\n\t\twhile nums:\n\t\t\t\n\t\t\tx = nums.pop()\n\n\t\t\tif stack:\n\t\t\t\tif stack[-1] == x:\n\t\t\t\t\tstack.pop()\n\t\t\t\telse:\n\t\t\t\t\tstack.append(x)\n\t\t\telse:\n\t\t\t\tstack.append(x)\n\n\t\tif stack:\n\t\t\tprint(\"NO\")\n\t\telse:\n\t\t\tprint(\"YES\")\t\n\n\n\ndef main():\n\n\tsol = Solution()\n\n\tnums = list(input().strip())\n\n\tsol.entangled(nums)\n\t\n\nif __name__ == '__main__':\n\n\tmain()", "wires_order= input()\r\nif len(wires_order)==1:\r\n print(\"No\")\r\nelse:\r\n stack=[]\r\n for ind in range(len(wires_order)):\r\n if stack and stack[-1]==wires_order[ind]:\r\n stack.pop()\r\n else:\r\n stack.append(wires_order[ind])\r\n print(\"No\") if stack else print(\"Yes\")", "'''We can untangle iff adjacent characters are equal'''\r\nintp=[i for i in input()]\r\nstack=['_']\r\nif len(intp)%2:\r\n print(\"No\")\r\nelse:\r\n \r\n for i in intp:\r\n if i==stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n print(\"Yes\" if len(stack)==1 else \"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", "l=input()\r\nl=list(l)\r\n\r\np=[]\r\n\r\nfor i in l:\r\n\tif len(p)==0:\r\n\t\tp.append(i)\r\n\telif p[-1]==i:\r\n\t\tp.pop()\r\n\telse:\r\n\t\tp.append(i)\r\n\t#print(p)\r\nif len(p)==0:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "ans = []\r\nfor c in input():\r\n if ans and c == ans[-1]:\r\n ans.pop()\r\n else:\r\n ans.append(c)\r\nprint('No' if ans else 'Yes')\r\n\r\n", "import random, math, sys\n\ninput = sys.stdin.readline\n\n# Function to call the actual solution\ndef solution(s):\n\tstack = []\n\ts = s[::-1]\n\tfor i in s:\n\t\tif stack and stack[-1] == i:\n\t\t\tstack.pop()\n\t\telse:\n\t\t\tstack.append(i)\n\treturn not bool(len(stack))\n\n\n# Function to take input\ndef input_test():\n\ts = input().strip()\n\tout = solution(s)\n\tprint(\"YES\" if out else \"NO\")\n\n\n\ninput_test()\n# test()", "s = input()\r\nstack = []\r\n\r\nfor i in s:\r\n\tif(stack and i== stack[-1]):\r\n\t\t\tstack.pop()\r\n\telse:\r\n\t\tstack.append(i)\r\n\r\nif(stack==[]):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "S=list(input())\r\ncharge=[]\r\ntop=-1\r\nno_of_notes=0\r\nfor i in S:\r\n c=i\r\n if top==-1:\r\n charge.append(c)\r\n top+=1\r\n no_of_notes+=1\r\n else:\r\n if c==charge[top]:\r\n no_of_notes-=1\r\n charge.pop()\r\n top-=1\r\n else:\r\n no_of_notes+=1\r\n charge.append(c)\r\n top+=1\r\nif top==-1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a=[]\r\ns=input()\r\nfor i in s:\r\n if len(a)==0: a.append(i)\r\n elif i==a[-1]: a.pop()\r\n else: a.append(i)\r\nif len(a)==0: print(\"Yes\")\r\nelse: print(\"No\")", "s = input()\r\nst = list()\r\nfor i in s:\r\n if st and st[-1] == i:\r\n st.pop()\r\n else:\r\n st.append(i)\r\nif not st:\r\n print('Yes')\r\nelse:\r\n print('No')", "s = input()\r\n\r\nstk = []\r\n\r\nfor i in s:\r\n if stk != [] and stk[-1] == i:\r\n stk.pop()\r\n else:\r\n stk.append(i)\r\nprint('Yes' if stk == [] else 'No')", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\nstri = input()\r\nS = []\r\nfor i in stri:\r\n if len(S) == 0:\r\n S.append(i)\r\n elif i == \"+\" and S[-1] == \"+\":\r\n S.pop()\r\n elif i == \"-\" and S[-1] == \"-\":\r\n S.pop()\r\n else:\r\n S.append(i)\r\nprint(\"Yes\") if len(S) == 0 else print(\"No\")", "def solve():\r\n s = input()\r\n n = len(s)\r\n if n & 1:\r\n print(\"NO\")\r\n return\r\n st = []\r\n for i in range(n):\r\n now = s[i]\r\n if st and now == st[-1]:\r\n st.pop()\r\n else:\r\n st.append(now)\r\n if not st:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == '__main__':\r\n solve()", "\n# from collections import deque\n\ns = input()\nstack = [s[0]]\nfor i in range(1, len(s)):\n if len(stack) == 0 or s[i] != stack[-1]:\n stack.append(s[i])\n else:\n stack.pop()\n\nprint(\"Yes\") if len(stack) == 0 else print(\"No\")\n\n \t\t \t \t\t \t\t\t\t \t \t\t \t \t \t", "ac = list(input())\n\nstack = []\n\nfor each in ac:\n \n stack.append(each) \n while len(stack) >=2 and stack[-1] == stack[-2]:\n stack.pop()\n stack.pop()\n\n \n \nif len(stack)==0:\n print(\"Yes\")\nelse:\n print(\"No\")", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import Counter\r\n\r\nS = input()\r\nA = []\r\nfor c in S:\r\n if A and A[-1]==c:\r\n A.pop()\r\n else:\r\n A.append(c)\r\n\r\nif A:\r\n print('No')\r\nelse:\r\n print('Yes')", "stack = []\r\n\r\ns = input()\r\n\r\nfor c in s:\r\n if stack and stack[-1] == c:\r\n stack.pop()\r\n else:\r\n stack.append(c)\r\n\r\nif stack:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n", "s = []\r\nfor c in input():\r\n if s and c == s[-1]:\r\n s.pop()\r\n else:\r\n s.append(c)\r\nif s:\r\n print('No')\r\nelse:\r\n print('Yes')", "plus=minus=0;c=1\r\nfor i in input():\r\n if c%2!=0:\r\n if i=='-':\r\n minus +=1\r\n else: \r\n plus +=1 \r\n else:\r\n \r\n if i=='-':\r\n plus +=1\r\n else: \r\n minus +=1 \r\n c+=1 \r\nprint(['No','Yes'][plus==minus])\r\n \r\n", "def proc(s):\r\n stack = []\r\n for e in s:\r\n if not stack:\r\n stack.append(e)\r\n elif stack[-1] == e:\r\n stack.pop()\r\n else:\r\n stack.append(e)\r\n return len(stack) == 0\r\n\r\n\r\ns = input()\r\nprint('Yes' if proc(s) else 'No')\r\n", "s=input()\r\nstack=[' ']100000\r\ni=0\r\np=-1\r\nwhile i<len(s):\r\n if p!=-1 and stack[p]==s[i]:\r\n p-=1\r\n i+=1\r\n else:\r\n p+=1\r\n stack[p]=s[i]\r\n i+=1\r\nif p==-1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "sequence = input()\nstack = []\nfor each in sequence:\n\tif len(stack) == 0:\n\t\tstack.append(each)\n\telif stack[len(stack)-1] == each:\n\t\tstack.pop()\n\telse:\n\t\tstack.append(each)\n\t\nif len(stack) == 0:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n \t\t \t \t \t\t\t \t\t\t\t\t \t\t\t\t\t", "s = input()\r\nst = []\r\nfor c in s:\r\n if st and st[-1]==c:\r\n st.pop()\r\n else:\r\n st.append(c)\r\nif st:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys\nimport collections\ndef solve():\n vals = list(input())\n q = collections.deque()\n for cur in vals:\n if len(q) > 0 and q[0] == cur:\n q.popleft()\n else:\n q.appendleft(cur)\n if len(q) == 0: return \"Yes\"\n return \"No\"\n\n \ndef read(mode=2):\n inputs = input().strip()\n if mode == 0: return inputs # String\n if mode == 1: return inputs.split() # List of strings\n if mode == 2: return list(map(int, inputs.split())) # List of integers\ndef write(s=\"\\n\"):\n if s is None: s = \"\"\n if isinstance(s, list): s = \" \".join(map(str, s))\n if isinstance(s, tuple): s = \" \".join(map(str, s))\n s = str(s)\n print(s, end=\"\")\ndef run():\n # if sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\n res = solve()\n write(res)\nrun()", "lst = []\r\n\r\nfor i in input():\r\n lst.append(i)\r\n if len(lst) == 1:\r\n continue\r\n if lst[-1] == lst[-2]:\r\n lst.pop()\r\n lst.pop()\r\nif len(lst) == 0:\r\n print('YES')\r\nelse:\r\n print('No')\r\n", "s = input()\nans = [0] * len(s)\nn = 0\nfor x in s:\n if n and ans[n-1] == x:\n n -= 1\n else:\n ans[n] = x\n n += 1\nif n > 0:\n print(\"No\")\nelse:\n print(\"Yes\")", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Sat Sep 1 15:18:19 2018\n\n@author: all_blue\n\"\"\"\n\nsequence = [char for char in input().strip()]\nstack = []\n\nfor char in sequence:\n if len(stack) == 0:\n stack.append(char)\n elif char == stack[-1]:\n stack.pop()\n else:\n stack.append(char)\n\nprint(\"Yes\" if len(stack) == 0 else \"No\")", "import collections as col\r\nimport math, string\r\nfrom functools import reduce\r\nfrom random import randint\r\n\r\ndef getInts():\r\n return [int(s) for s in input().split()]\r\n\r\ndef getInt():\r\n return int(input())\r\n\r\ndef getStrs():\r\n return [s for s in input().split()]\r\n\r\ndef getStr():\r\n return input()\r\n\r\ndef listStr():\r\n return list(input())\r\n\r\nMOD = 10*9+7\r\n\r\n\"\"\"\r\n\r\n\"\"\"\r\n\r\ndef solve():\r\n S = getStr()\r\n N = len(S)\r\n queue = []\r\n for i in range(N):\r\n if not queue or queue[-1] != S[i]:\r\n queue.append(S[i])\r\n else:\r\n queue.pop()\r\n return \"No\" if queue else \"Yes\"\r\n \r\n#for _ in range(getInt()):\r\nprint(solve())", "from collections import deque\nli=deque()\nn=input()\nfor i in n:\n\tif(len(li)==0):\n\t\tli.append(i)\n\telif(i==li[-1]):\n\t\tli.pop()\n\telse:\n\t\tli.append(i)\nif len(li)==0:\n\tprint('Yes')\nelse:\n\tprint(\"No\")\n \t \t \t \t \t\t \t \t \t \t\t", "s = input()\nstk = []\nfor ch in s:\n if len(stk) > 0 and stk[-1] == ch:\n stk.pop()\n else:\n stk.append(ch)\nif len(stk) == 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "def untangle_wires(sequence):\n stack = []\n\n for wire in sequence:\n if stack and stack[-1] == wire:\n # If the current wire is the same as the top wire on the stack, remove it.\n stack.pop()\n else:\n # Otherwise, add the current wire to the stack.\n stack.append(wire)\n\n # If the stack is empty after processing all wires, they can be untangled.\n if not stack:\n return \"Yes\"\n else:\n return \"No\"\n\n# Read input sequence\nsequence = input().strip()\n\n# Call the function to untangle the wires and print the result.\nprint(untangle_wires(sequence))\n\n\t \t \t \t\t \t\t \t \t \t \t\t \t \t \t", "from collections import deque\ns = input()\ndq = deque()\nfor ch in s:\n if len(dq)==0:\n dq.append(ch)\n else:\n if ch=='-' and dq[-1]=='-':\n dq.pop()\n elif ch =='+' and dq[-1]=='+':\n dq.pop()\n else:\n dq.append(ch)\nif len(dq)==0:\n print('Yes')\nelse:\n print('No')\n\n\t\t\t\t \t \t \t \t\t\t \t\t\t\t \t \t", "s = input()\r\nstack = []\r\nfor char in s:\r\n if stack and stack[-1] == char:\r\n stack.pop()\r\n else:\r\n stack.append(char)\r\n\r\nif stack:\r\n print('NO')\r\nelse:\r\n print(\"YES\")", "\r\ns = input() \r\n\r\narr = [s[0]] \r\n\r\nfor i in range(1, len(s)):\r\n c = s[i]\r\n if arr and c == arr[-1]:\r\n arr.pop() \r\n else:\r\n arr.append(c) \r\n\r\nprint(\"No\" if arr else \"Yes\") \r\n", "s=input()\nn=len(s)\np=[]\nfor i in range(n):\n if len(p)==0:\n p.append(s[i])\n continue\n if p[-1]==s[i]:\n p.pop()\n else:\n p.append(s[i])\nif len(p)==0:\n print('YES')\nelse:\n print('NO')\n\n\t \t \t \t \t\t \t\t \t\t \t \t \t", "def can_untangle_wires(sequence):\n stack = []\n\n for char in sequence:\n if not stack or stack[-1] != char:\n stack.append(char)\n else:\n stack.pop()\n\n return \"Yes\" if not stack else \"No\"\n\n# Read input\nsequence = input()\n\n# Check if the wires can be untangled\nresult = can_untangle_wires(sequence)\n\n# Print the result\nprint(result)\n\n\t\t\t \t \t\t\t\t\t\t\t\t\t \t\t \t \t", "def solve(sequence):\n stack = []\n for char in sequence:\n if not stack or char != stack[-1]:\n stack.append(char)\n else:\n stack.pop()\n if not stack:\n return \"Yes\"\n else:\n return \"No\"\n\nsequence = input().strip()\nprint(solve(sequence))\n\n\n\t\t\t\t\t\t \t\t \t\t \t \t\t\t\t \t\t\t\t", "s=input()\r\nn=len(s)\r\nlst=[]\r\nfor i in range(n):\r\n if lst==[]:\r\n lst.append(s[i])\r\n continue;\r\n if lst[-1]==s[i]:\r\n lst.pop(-1)\r\n else:\r\n lst.append(s[i])\r\nif lst==[]:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s=input()\r\nl=[]\r\nfor i in s:\r\n if len(l)==0:\r\n l.append(i)\r\n elif i==l[-1]:\r\n l.pop()\r\n else:\r\n l.append(i)\r\nif len(l)==0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "def desenrredar(cable):\r\n \r\n pasos = len(cable)\r\n \r\n if pasos % 2 == 1:\r\n return pasos\r\n \r\n if \"++\" in cable:\r\n cable = cable.replace(\"++\", \"\")\r\n if \"--\" in cable:\r\n cable = cable.replace(\"--\", \"\")\r\n \r\n cable = list(cable) \r\n pos = -1\r\n \r\n while pos <= len(cable):\r\n pos += 1\r\n if len(cable) == 0:\r\n break\r\n if (pos + 1) < len(cable) and pos >= 0:\r\n if cable[pos] == cable[pos + 1]:\r\n cable.pop(pos)\r\n cable.pop(pos)\r\n pos -= 2\r\n if (pos - 1) >= 0 and pos < len(cable):\r\n if cable[pos] == cable[pos - 1]:\r\n cable.pop(pos)\r\n cable.pop(pos - 1)\r\n pos -= 2\r\n \r\n return len(cable)\r\n\r\ncables = input()\r\nif desenrredar(cables) == 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input().strip()\r\na = ['K']\r\nfor i in s:\r\n if a[-1]==i:\r\n a.pop()\r\n else:\r\n a.append(i)\r\nif len(a)==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "wires = input()\nc = 0\nd = 0\nfor i in range(len(wires)):\n if (wires[i] == '+'):\n c+=2(i%2) - 1\n if (wires[i] == '-'):\n d+=2(i%2) - 1\nif c==0 and d==0:\n print(\"Yes\")\nelse:\n print(\"No\")\n# 1532030829894\n", "def run(s):\n arr=[]\n for c in s:\n if not arr or arr[-1]!=c:\n arr.append(c)\n else:arr.pop()\n return \"No\" if arr else \"Yes\"\n\ns=input()\n\nans=run(s)\nprint(ans)\n\t\t\t\t \t\t\t \t\t\t\t\t \t \t\t\t \t\t", "a = list(input())\r\nn = len(a)\r\n\r\ns = list()\r\nfor i in range(n):\r\n if not s or s[-1] != a[i]:\r\n s.append(a[i])\r\n else:\r\n s.pop(-1)\r\n\r\nprint('No' if s else 'Yes')", "def can_untangle_wires(sequence):\n stack = []\n\n for char in sequence:\n if len(stack) == 0:\n stack.append(char)\n else:\n if stack[-1] == char:\n stack.pop()\n else:\n stack.append(char)\n\n return len(stack) == 0\n\n# Read the input\nsequence = input().strip()\n\n# Check if wires can be untangled\nif can_untangle_wires(sequence):\n print(\"Yes\")\nelse:\n print(\"No\")\n\n\t\t \t \t \t \t \t \t\t\t \t \t\t", "from typing import List, Tuple\nfrom collections import defaultdict, deque, namedtuple\nfrom heapq import heappush as push, heappop as pop\nimport sys \n\nINF = (int)(1e9+7)\n\nsys.setrecursionlimit(INF)\n\n\ndef alternatingCurrent(wires):\n\n\n\tstk = []\n\n\tfor upperWire in wires:\n\n\n\t\tif stk and stk[-1] == upperWire:\n\t\t\tstk.pop()\n\t\t\tcontinue\n\n\t\tstk.append(upperWire)\n\n\n\tif stk:\n\t\treturn 'No'\n\n\treturn 'Yes'\n\n\n\n\n\n\n\n\nif __name__ == \"__main__\":\n\n\n\n\twires = input()\n\n\tprint(alternatingCurrent(wires))\n\n\n\n\n", "# your code goes here\nfrom collections import deque\ns=deque()\nn=input()\nfor i in n:\n\tif len(s)==0:\n\t\ts.append(i)\n\telif i==s[-1]:\n\t\ts.pop()\n\telse:\n\t\ts.append(i)\nif len(s)==0:\n\tprint('Yes')\nelse:\n\tprint(\"No\")\n\t \t \t\t \t \t \t \t \t \t\t \t \t", "from re import S\r\n\r\n\r\nlst = input()\r\nstack = []\r\nfor s in lst:\r\n if len(stack) > 0:\r\n if stack[-1] == s:\r\n stack.pop()\r\n else:\r\n stack.append(s)\r\n else:\r\n stack.append(s)\r\n\r\nif len(stack):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "from collections import deque\r\n\r\ns = input()\r\n# test case 1\r\n# -++-\r\n# -\r\n# -+\r\n# -\r\n# test case 2\r\n# +\r\n# +-\r\n# test case 3\r\n# +\r\n#\r\n# test case 4\r\n# -\r\ndq = deque()\r\n# s: -++-\r\n# dq:\r\nfor i in range(len(s)):\r\n if len(dq) == 0:\r\n dq.append(s[i])\r\n elif s[i] == dq[-1]:\r\n dq.pop()\r\n else:\r\n dq.append(s[i])\r\nif len(dq) == 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "class solution:\r\n def answer(self, s):\r\n if len(s) <=1:\r\n return \"No\"\r\n \r\n S = []\r\n for i in range(len(s)):\r\n S.append(s[i])\r\n\r\n aux_stack = []\r\n c1 = S.pop()\r\n aux_stack.append(c1)\r\n\r\n while len(S)!=0:\r\n c2 = S.pop()\r\n if c2 == c1:\r\n aux_stack.pop()\r\n if len(aux_stack)==0:\r\n if len(S)==0:\r\n return \"Yes\"\r\n else:\r\n c1 = S.pop()\r\n aux_stack.append(c1)\r\n else:\r\n c1 = aux_stack[-1]\r\n else:\r\n c1 = c2\r\n aux_stack.append(c1)\r\n if len(aux_stack)!=0:\r\n return \"No\"\r\n else:\r\n return \"Yes\"\r\n\r\n \r\n \r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n S = input()\r\n ob = solution()\r\n print(ob.answer(S))", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[9]:\n\n\ns=input()\nl=len(s)\nAcount=Bcount=0\n\nfor i in range(l):\n if (i+1)&1:\n if s[i]=='-':\n Bcount+=1\n \n else:\n Acount+=1\n \n else:\n if s[i]=='-':\n Acount+=1\n \n else:\n Bcount+=1\n \nprint('Yes' if Acount==Bcount else 'No')\n\n\n# In[ ]:\n\n\n\n\n", "l,pre = [],''\r\nfor i in input():\r\n if i==pre: l.pop()\r\n else: l.append(i)\r\n if len(l)>0: pre=l[len(l)-1]\r\n else: pre=''\r\nprint('Yes' if not l else 'No')", "s = input()\r\n\r\nst = [s[0]]\r\n\r\nfor sign in s[1:]:\r\n if len(st) != 0 and sign == st[-1]:\r\n st.pop()\r\n else:\r\n st.append(sign)\r\n\r\nif len(st) == 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "wires = input()\r\narr = []\r\narr.append(wires[0])\r\nfor i in range (1,len(wires)):\r\n try:\r\n if wires[i] == arr[-1]:\r\n arr.pop()\r\n else:\r\n arr.append(wires[i])\r\n except:\r\n arr.append(wires[i])\r\n continue\r\n\r\nif (len(arr) == 0):\r\n print('Yes') \r\nelse:print('No')", "cables = input()\r\ncola = []\r\nfor signo in cables:\r\n if cola:\r\n if signo == cola[-1]:\r\n cola.pop(-1)\r\n else:\r\n cola.append(signo)\r\n else:\r\n cola.append(signo)\r\nif cola:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nd = []\r\nt, c = s[0], 0\r\nfor i in s:\r\n if i == t:\r\n c += 1\r\n else:\r\n if c % 2:\r\n d.append(c)\r\n else:\r\n if d:\r\n d.pop()\r\n c = 0\r\n else:\r\n c = 1\r\n if t == '+':\r\n t = '-'\r\n else:\r\n t = '+'\r\nif c % 2:\r\n d.append(c)\r\nprint(['Yes','No'][len(d)>0])\r\n", "str = input() \r\ns = []\r\nfor c in str :\r\n if len(s) > 0 and c == s[-1] : \r\n del s[-1]\r\n else : \r\n s.append(c)\r\nif len(s) > 0 : \r\n print('NO')\r\nelse: \r\n print('YES')", "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 collections import deque\r\nl = deque(input())\r\ns = []\r\nif len(l)%2: print('No')\r\nelse:\r\n while l:\r\n s.append(l.popleft())\r\n if len(s) >= 2:\r\n if s[-1] == s[-2]:\r\n s.pop()\r\n s.pop()\r\n if s: print('No')\r\n else: print('Yes')", "p, j = [0] 100001, 0\nfor i in input():\n if i == p[j]: j -= 1\n else: j += 1; p[j] = i\nprint('YNEOS'[j > 0 :: 2])\n\t \t \t\t\t\t\t\t \t\t\t\t\t \t\t \t\t", "def can_be_untangled(sequence):\n stack = []\n\n for wire in sequence:\n if not stack or stack[-1] != wire:\n stack.append(wire)\n else:\n stack.pop()\n\n return \"Yes\" if not stack else \"No\"\n\nsequence = input()\nresult = can_be_untangled(sequence)\nprint(result)\n\n\t \t\t\t\t\t\t\t\t\t \t\t\t \t\t \t\t\t\t\t \t\t\t", "s=input()\r\n\r\nstack=[]\r\n\r\nfor ele in s:\r\n if len(stack)==0:\r\n stack.append(ele)\r\n elif stack[-1]==ele:\r\n stack.pop()\r\n else:\r\n stack.append(ele)\r\n \r\nif len(stack)==0:\r\n print('Yes')\r\nelse:\r\n print('No')", "stack = []\nfor x in input():\n if stack and stack[-1] == x:\n stack.pop()\n else:\n stack.append(x)\nprint('No' if stack else 'Yes')\n", "s = input()\r\nst = []\r\nfor i in s:\r\n if len(st)>0 and st[-1]==i:\r\n st.pop()\r\n else:\r\n st.append(i)\r\nif len(st)==0:\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", "s = input()\r\n\r\ntmp = 0\r\nresult = 0\r\nfor i in range(len(s)):\r\n if s[i] == '+': tmp = 1\r\n else: tmp = -1\r\n\r\n if i % 2 == 1 : tmp = -tmp\r\n\r\n result += tmp\r\n\r\nprint('YES') if result == 0 else print('NO')\r\n", "answer = []\nfor c in input():\n if len(answer) and answer[-1] == c: answer.pop()\n else: answer += [c]\nprint('No' if len(answer) else 'Yes')\n \t \t \t\t \t \t \t\t \t\t \t \t\t\t", "s = input().strip()\n\nstack = []\n\nfor char in s:\n if stack and stack[-1] == char:\n stack.pop()\n else:\n stack.append(char)\n\nif not stack:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n\t\t\t\t \t \t\t \t \t\t \t\t\t", "string = input()\nt = []\nfor char in string:\n if not t:\n t.append(char)\n continue\n if t[-1] == char:\n t.pop()\n else:\n t.append(char)\nif t:\n print(\"No\")\nelse:\n print(\"Yes\")", "s = input()\r\nn = len(s)\r\ni = 0\r\nstack = []\r\nwhile(i<n):\r\n if stack and stack[-1]==s[i]:\r\n stack.pop()\r\n else:\r\n stack.append(s[i])\r\n i+=1\r\nif stack == []:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "sp = list(input())\r\nspisok = []\r\nfor i in sp:\r\n if not spisok:\r\n spisok.append(i)\r\n elif i != spisok[-1]:\r\n spisok.append(i)\r\n else:\r\n spisok.pop()\r\nif spisok:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "def is_balanced_string(s):\r\n st = []\r\n for c in s:\r\n if not st:\r\n st.append(c)\r\n continue\r\n if st[-1] == c:\r\n st.pop()\r\n else:\r\n st.append(c)\r\n return \"YES\" if not st else \"NO\"\r\n\r\ns = input().strip()\r\nprint(is_balanced_string(s))", "\n# Online Python - IDE, Editor, Compiler, Interpreter\nwires=input()\nstack=[]\nfor wire in wires:\n if len(stack)==0:\n stack.append(wire)\n else:\n if stack[-1]==wire:\n stack.pop()\n \n else:\n stack.append(wire)\n\nif(len(stack)>0):\n print('NO')\nelse:\n print('YES')\n \n \t \t \t \t\t\t\t\t\t \t\t \t\t \t", "s = input()\r\nftopayrespect = []\r\n\r\nfor i in range(len(s)): \r\n if ftopayrespect and s[i] == ftopayrespect[len(ftopayrespect)-1]:\r\n ftopayrespect.pop()\r\n else:\r\n ftopayrespect.append(s[i])\r\n\r\nif len(ftopayrespect)>0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "#https://codeforces.com/contest/343/problem/B\r\n\r\n#SC = TC = o(n)\r\n\r\ns = input().strip()\r\n\r\nstack = []\r\n\r\nfor k in range(len(s)):\r\n\t#empty stack or not equal to stack top push\r\n\tif not stack or s[k]!=stack[-1]:\r\n\t\tstack.append(s[k])\r\n\t#if same pop\r\n\telif s[k]==stack[-1]:\r\n\t\tstack.pop()\r\n\r\n#if stack empty yes else no\r\nif not stack:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "from collections import deque\n\ns = input()\ndq = deque()\nfor i in range(len(s)):\n if (not len(dq)) or dq[-1]!=s[i]:\n dq.append(s[i])\n else:\n dq.pop()\nif len(dq):\n print('No')\nelse:\n print('Yes')\n\n \t\t\t \t\t\t\t \t \t\t \t \t \t \t\t\t\t\t", "s = input()\r\nc = 0\r\nt = 0 \r\nfor i in s :\r\n if t%2 == 0 :\r\n if i == '+' :\r\n c +=1 \r\n else:\r\n c -= 1 \r\n else :\r\n if i == '-' :\r\n c += 1 \r\n else :\r\n c -= 1 \r\n\r\n t += 1 \r\n\r\n\r\nif c == 0 :\r\n print('Yes')\r\nelse :\r\n print('No') ", "# a = \"\"\"30\r\n# 75\r\n# 40\r\n# 24\r\n# 21\r\n# 12\r\n# 1\r\n# 5\r\n# 24\r\n# 21\r\n# 6\r\n# 20\r\n# 60\r\n# 34\r\n# 22\r\n# 42\r\n# 19\r\n# 13\r\n# 13\r\n# 152\r\n# 4,60,2\r\n# 153\"\"\".split()\r\n\r\n# a = a[:11] + a[-4:-1]\r\n\r\n# for i in a:\r\n# input()\r\n# print(i)\r\n\r\n# a = \"\"\"30\r\n# 75\r\n# 40\r\n# 24\r\n# 21\r\n# 12\r\n# 1\r\n# 5\r\n# 24\r\n# 21\r\n# 6\r\n# 20\r\n# 60\r\n# 34\r\n# 22\r\n# 42\r\n# 19\r\n# 13\r\n# 13\r\n# 152\r\n# 4,60,2\r\n# 153\"\"\".split()\r\n\r\n# a = a[:11] + a[-4:-1]\r\n\r\n# for i in a:\r\n# input()\r\n# print(i)\r\n\r\nimport sys\r\n\r\ndef solve():\r\n s = sys.stdin.readline().strip()\r\n a = 0\r\n b = 0\r\n\r\n for i in range(len(s)):\r\n if i % 2 == 0:\r\n if s[i] == '-':\r\n a += 1\r\n else:\r\n b += 1\r\n else:\r\n if s[i] == '-':\r\n b += 1\r\n else:\r\n a += 1\r\n \r\n if a == b:\r\n print('Yes')\r\n else:\r\n print('No')\r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "s=list(input())\r\nstack=[]\r\nfor x in s:\r\n if stack!=[] and stack[-1]==x:\r\n del stack[-1]\r\n else:\r\n stack.append(x)\r\nif stack==[]: print(\"YES\")\r\nelse: print(\"NO\")", "import math\r\ns=list(input())\r\nn=len(s)\r\nstack = []\r\nfor i in range(n):\r\n if len(stack)>1:\r\n if stack[len(stack)-1]==stack[len(stack)-2]:\r\n stack.pop()\r\n stack.pop()\r\n stack.append(s[i]) \r\n else:\r\n stack.append(s[i])\r\nif len(stack)>1: \r\n if stack[len(stack)-1]==stack[len(stack)-2]:\r\n stack.pop()\r\n stack.pop()\r\nif len(stack)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import deque\na=input()\ndq=deque()\nfor i in a:\n if len(dq)==0:\n dq.append(i)\n elif dq[-1]==\"-\" and i==\"-\":\n dq.pop()\n elif dq[-1]==\"+\" and i==\"+\":\n dq.pop()\n else:\n dq.append(i)\nif len(dq)==0:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t\t\t\t \t \t \t\t\t \t\t \t \t\t \t\t\t\t\t\t", "import sys\r\ns = input()\r\nstk = []\r\nfor c in s:\r\n flag = True\r\n while stk and stk[-1] == c:\r\n flag = False\r\n stk.pop()\r\n if flag:\r\n stk.append(c)\r\n\r\nif len(stk)!=0:\r\n print(\"No\")\r\n sys.exit(0)\r\nprint(\"Yes\")", "import sys\r\n\r\ninpt = sys.stdin.readline().strip()\r\nstack = []\r\n\r\nfor c in inpt:\r\n stack.append(c)\r\n while len(stack) >= 2 and stack[-1] == stack[-2]:\r\n stack.pop(-1)\r\n stack.pop(-1)\r\n\r\nif len(stack) == 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "s = input()\r\n\r\nstack = [s[0]]\r\n\r\nfor i in range(1, len(s)):\r\n if len(stack) == 0:\r\n stack.append(s[i])\r\n else:\r\n if stack[-1] == s[i]:\r\n stack.pop()\r\n else:\r\n stack.append(s[i])\r\n\r\nif len(stack) == 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "import itertools\r\nfrom sys import maxsize, stdout, stdin,stderr\r\nmod = int(1e9+7)\r\nimport sys\r\ndef I(): return int(stdin.readline())\r\ndef lint(): return [int(x) for x in stdin.readline().split()]\r\ndef S(): return list(map(str,input().strip()))\r\ndef grid(r, c): return [lint() for i in range(r)]\r\nfrom collections import defaultdict, Counter, deque\r\nimport math\r\nimport heapq\r\nfrom heapq import heappop , heappush\r\nimport bisect\r\nfrom math import inf\r\nfrom itertools import groupby\r\nfrom itertools import permutations as comb\r\ndef gcd(a,b): \r\n while b:\r\n a %= b\r\n tmp = a\r\n a = b\r\n b = tmp\r\n \r\n return a\r\n \r\ndef lcm(a,b): \r\n return a // gcd(a, b) * b\r\n \r\ndef check_prime(n):\r\n for i in range(2, int(n ** (1 / 2)) + 1):\r\n if not n % i:\r\n return False\r\n return True\r\n\r\ndef nCr(n, r):\r\n \r\n return (fact(n) // (fact(r)\r\n * fact(n - r)))\r\n \r\n# Returns factorial of n\r\ndef fact(n):\r\n \r\n res = 1\r\n \r\n for i in range(2, n+1):\r\n res = res * i\r\n \r\n return res\r\ndef primefactors(n):\r\n num=0\r\n \r\n while n % 2 == 0:\r\n num+=1\r\n n = n / 2\r\n \r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n \r\n \r\n while n % i== 0:\r\n num+=1\r\n n = n // i\r\n \r\n \r\n if n > 2:\r\n num+=1\r\n return num\r\n'''\r\ndef iter_ds(src):\r\n store=[src]\r\n while len(store):\r\n tmp=store.pop()\r\n if not vis[tmp]:\r\n vis[tmp]=True\r\n for j in ar[tmp]:\r\n store.append(j)\r\n'''\r\ndef ask(a):\r\n print('? {}'.format(a),flush=True)\r\n n=I()\r\n \r\n return n\r\ndef linear_sieve(n):\r\n is_composite=[False]n\r\n prime=[]\r\n for i in range(2,n):\r\n if not is_composite[i]:\r\n prime.append(i)\r\n for j in prime:\r\n is_composite[ij]=True\r\n if i%prime==0:\r\n break\r\n return prime\r\n \r\ndef dfs(i,p,d):\r\n \r\n a,tmp=0,0\r\n for j in d[i]:\r\n if j!=p:\r\n a+=1\r\n tmp+=dfs(j,i)\r\n \r\n if a==0:\r\n return 0\r\n \r\n return tmp/a + 1 \r\ndef primeFactors(n):\r\n l=[]\r\n \r\n while n % 2 == 0:\r\n l.append(2)\r\n n = n // 2\r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n \r\n \r\n while n % i== 0:\r\n l.append(i)\r\n n = n // i\r\n\r\n if n > 2:\r\n l.append(n)\r\n return l\r\n\r\n\r\n \r\n\r\n# Sieve\r\nd=[]\r\nprimes=[]\r\ndef sieve(n):\r\n \r\n for i in range(n):\r\n d.append(i)\r\n\r\n for i in range(2,n):\r\n\r\n if d[i]==i:\r\n primes.append(i)\r\n j=0\r\n while j<len(primes) and primes[j]<=d[i] and primes[j]i<n:\r\n \r\n d[i primes[j]] = primes[j]\r\n j+=1\r\n\r\n \r\ndef primeFactors(n):\r\n factors=[]\r\n while n!=1:\r\n factors.append(d[n])\r\n n//=d[n]\r\n \r\n return factors\r\nb=input()\r\na=list(map(str,b.strip()))\r\nl=[]\r\n\r\nfor i in range(len(a)):\r\n l.append(a[i])\r\n if len(l)>1:\r\n if l[-1]==l[-2]:\r\n \r\n l.pop()\r\n l.pop()\r\n \r\nif len(l):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n \r\n\r\n\r\n\r\n\r\n \r\n", "from collections import Counter,defaultdict,deque\r\nimport heapq as hq\r\nfrom itertools import count, islice\r\n\r\n#alph = 'abcdefghijklmnopqrstuvwxyz'\r\n#from math import factorial as fact\r\nimport math\r\nimport sys\r\ninput=sys.stdin.readline\r\n#print=sys.stdout.write\r\n#tt = int(input())\r\n#total=0\r\n#n = int(input())\r\n#n,m,k = [int(x) for x in input().split()]\r\n#n = int(input())\r\n#l,r = [int(x) for x in input().split()]\r\ns = input().strip('\\n')\r\nstack = deque()\r\nfor i in range(len(s)):\r\n stack.append(s[i])\r\n while len(stack)>=2 and stack[-1] == stack[-2]:\r\n stack.pop()\r\n stack.pop()\r\nif len(stack)==0:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n\r\n \r\n", "string = input()\nlst=['0']\nfor i in string:\n if lst[-1] == i: #الاتنين شبه بعض امسح\n lst.pop()\n else:\n lst.append(i)\nif len(lst) == 1:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t\t \t \t \t \t\t \t \t \t\t \t \t", "# your code goes here\nst=[]\ns=input().strip()\nfor i in s:\n if len(st) and st[-1]==i:\n st.pop()\n else:\n st.append(i)\nif len(st):\n print('NO')\nelse:\n print('YES')", "def can_untangle(sequence):\r\n stack = []\r\n \r\n for char in sequence:\r\n if stack and stack[-1] == char:\r\n stack.pop()\r\n else:\r\n stack.append(char)\r\n \r\n if not stack:\r\n return \"Yes\"\r\n else:\r\n return \"No\"\r\n\r\n# Read input\r\nsequence = input().strip()\r\n\r\n# Check if the wires can be untangled\r\nresult = can_untangle(sequence)\r\nprint(result)\r\n", "s = input()\r\nl = []\r\n\r\nfor i in s:\r\n if(l!=[] and i==l[-1]):\r\n l.pop()\r\n else:\r\n l.append(i)\r\nif(l==[]):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input()\r\nstack = []\r\nfor i in s:\r\n if stack and i == stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n\r\nans = 'No' if stack else 'Yes'\r\nprint(ans)\r\n ", "def can_untangle_wires(wires):\n stack = [] # Initialize an empty stack\n\n # Iterate through the wires\n for wire in wires:\n # If the stack is not empty and the current wire can be matched with the top of the stack, pop the stack\n if stack and stack[-1] == wire:\n stack.pop()\n else:\n # Otherwise, push the current wire onto the stack\n stack.append(wire)\n\n # If the stack is empty after processing all wires, it means the wires can be untangled\n if not stack:\n return \"Yes\"\n else:\n return \"No\"\n\n# Read the input sequence of wires\nwires = input().strip()\n\n# Check if the wires can be untangled and print the result\nresult = can_untangle_wires(wires)\nprint(result)\n\n\t\t \t\t \t \t\t \t\t\t \t \t \t \t \t", "s = input()\r\nst = list()\r\nfor i in range(len(s)):\r\n\tif len(st) == 0:\r\n\t\tst.append(s[i])\r\n\telse:\r\n\t\tif st[len(st)-1] == s[i]:\r\n\t\t\tst.pop()\r\n\t\telse:\r\n\t\t\tst.append(s[i])\r\nif len(st) == 0:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "a=input()\r\nx=0\r\ny=0\r\n\r\nfor i in range(len(a)):\r\n if i%2!=0:\r\n if a[i]==\"-\":\r\n y+=1\r\n else:\r\n x+=1\r\n else:\r\n if a[i]==\"-\":\r\n x+=1\r\n else:\r\n y+=1\r\nif x==y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nst=[]\r\nfor i in range(len(s)):\r\n st.append(s[i])\r\n while len(st)>1 and st[-1]==st[-2]:\r\n st.pop(-1)\r\n st.pop(-1)\r\nif len(st):\r\n print('No')\r\nelse:\r\n print('Yes')", "arr = []\r\nstrs = input()\r\n\r\nfor i in strs:\r\n if len(arr) == 0:\r\n arr.append(i)\r\n continue\r\n if arr[-1] == i:\r\n arr.pop()\r\n else:\r\n arr.append(i)\r\n \r\nif len(arr) >0:\r\n print(\"NO\")\r\nelse:\r\n print('YES')", "wire = list(input())\r\nstack = []\r\ndef untangle(a,b):\r\n if a == b:\r\n return True\r\n else:\r\n return False\r\n\r\nfor x in wire:\r\n if stack == []:\r\n stack.append(x)\r\n else:\r\n if untangle(x,stack[-1]):\r\n stack.pop(-1)\r\n else:\r\n stack.append(x)\r\nif stack == []:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\") \r\n\r\n", "l = list(input())\nif len(l)%2!=0:\n print('No')\nelse:\n stack = []\n for i in l:\n if stack:\n if stack[-1]==i:\n stack.pop()\n else:\n stack.append(i)\n else:\n stack.append(i)\n if stack:\n print('No')\n else:\n print('Yes')\n", "s = input()\r\nq = []\r\nn = 0\r\nfor c in s:\r\n if not q:\r\n q.append(c)\r\n n += 1\r\n else:\r\n if c == q[n - 1]:\r\n q.pop()\r\n n -= 1\r\n else:\r\n q.append(c)\r\n n += 1\r\nif n:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "wire = input()\nstack = ['null']\nif len(wire) % 2 != 0:\n\tprint(\"No\")\n\texit()\nfor i in wire:\n\tif stack[-1] == i:\n\t\tstack.pop()\n\telse:\n\t\tstack.append(i)\nif len(stack) > 1:\n\tprint(\"No\")\nelse:\n\tprint(\"Yes\")", "pattern = input()\r\n\r\nstack = []\r\n\r\nfor i in range(len(pattern)):\r\n if stack == []:\r\n stack.append(pattern[i])\r\n elif stack[-1] == pattern[i]:\r\n stack.pop()\r\n else:\r\n stack.append(pattern[i])\r\n \r\nif len(stack) <= 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\") ", "import sys\r\nst = []\r\ns = input()\r\n\r\nfor i in s:\r\n if len(st) == 0:\r\n st.append(i)\r\n continue\r\n if st[-1] == i:\r\n st.pop()\r\n else:\r\n st.append(i)\r\n\r\nif len(st) == 0:\r\n print(\"YES\")\r\n sys.exit(0)\r\nprint(\"NO\")", "class current:\r\n def __init__(self):\r\n self.top = -1\r\n self.stk=[]\r\n \r\n def push(self,x):\r\n self.top+=1\r\n self.stk.append(x)\r\n \r\n def isempty(self):\r\n if self.top == -1:\r\n return True\r\n else:\r\n return False\r\n \r\n def peek(self):\r\n if not self.isempty():\r\n return self.stk[len(self.stk)- 1]\r\n else:\r\n return False\r\n \r\n def pop(self):\r\n if not self.isempty():\r\n self.top-=1\r\n return self.stk.pop()\r\n else:\r\n False\r\n \r\n def untangle(self,strng):\r\n for i in strng:\r\n if self.isempty():\r\n self.push(i)\r\n elif self.peek() == i:\r\n self.pop()\r\n else:\r\n self.push(i)\r\n if self.isempty():\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\n \r\nn = input()\r\nobj = current()\r\nobj.untangle(n)\r\n", "from collections import deque\r\n\r\ns = input()\r\n\r\ndq = deque()\r\nfor i in range(len(s)):\r\n if len(dq) == 0:\r\n dq.append(s[i])\r\n elif s[i] == dq[-1]:\r\n dq.pop()\r\n else:\r\n dq.append(s[i])\r\nif len(dq) == 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "inp = input().strip()\r\nstack = list()\r\ni=0\r\nwhile i<len(inp):\r\n if(len(stack)!=0 and stack[-1]==inp[i]):\r\n stack.pop()\r\n else:\r\n stack.append(inp[i])\r\n i = i+1\r\nif len(stack)==0:\r\n print('Yes')\r\nelse:\r\n print('No')", "string = input()\r\nnew = []\r\nfor i in range(len(string)):\r\n if new==[]:\r\n new.append(string[i])\r\n else:\r\n if new==[]:\r\n new.append(string[i])\r\n else:\r\n if new[-1] == string[i]:\r\n new.pop()\r\n else:\r\n new.append(string[i])\r\nif new==[]:\r\n print('Yes')\r\nelse:\r\n print('No')", "stack = []\nsoc = input()\nflag = True\n\nif len(soc) % 2 == 0:\n for sign in soc:\n if stack != [] and stack[-1] == sign:\n stack.pop()\n else:\n stack.append(sign)\nelse:\n flag = False\n\nif flag and stack == []:\n print('Yes')\nelse:\n print('No')\n", "s = input().strip()\nst = ['!']\nfor si in s:\n if st[-1]==si:\n st.pop()\n else:\n st.append(si)\nprint('Yes' if len(st)==1 else 'No')\n \t\t \t \t\t\t\t\t \t \t \t\t", "from collections import deque\r\ns=input()\r\nstack=deque()\r\n\r\nif (len(s)==1):\r\n print('No')\r\nelif (len(s)==2):\r\n if(s[0]!=s[1]):\r\n print('No')\r\n else :\r\n print('Yes')\r\nelse :\r\n for i in range (len(s)):\r\n if ( len(stack)==0) :\r\n stack.append(s[i])\r\n elif ( stack[-1]==s[i]) :\r\n stack.pop()\r\n else :\r\n stack.append(s[i])\r\n if ( len(stack) ==0) :\r\n print('Yes')\r\n else :\r\n print('No')\r\n", "import sys\r\nfrom collections import deque\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 seq = f.readline().strip()\r\n\r\n return [seq]\r\n\r\n\r\ndef sol(seq):\r\n li = deque()\r\n for node in seq:\r\n if len(li) == 0:\r\n li.append(node)\r\n elif node == li[-1]:\r\n li.pop()\r\n else:\r\n li.append(node)\r\n if len(li) == 0:\r\n return [\"Yes\"]\r\n else:\r\n return [\"No\"]\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\n\r\ntry:\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nexcept:\r\n pass\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ns = input().strip()\r\n\r\nst = []\r\nfor el in s:\r\n if st and st[-1] == el:\r\n st.pop()\r\n continue\r\n st.append(el)\r\n\r\nprint(\"Yes\" if not st else \"No\")", "l = input()\np = []\nfor i in l:\n if p and i == p[-1]:\n p.pop()\n else:\n p.append(i)\nif not p:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t \t\t\t \t \t\t \t \t\t\t \t \t \t \t", "check=[\"!\"]\r\ninp=input()\r\nfor i in inp:\r\n if(check[-1]==i):\r\n check.pop()\r\n else:\r\n check.append(i)\r\nif(len(check)==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ans = []\nfor c in input():\n if len(ans) and ans[-1] == c:\n ans.pop()\n else:\n ans += [c]\nprint('No' if len(ans) else 'Yes')\n", "cables = input()\nstack = []\n\nfor i in cables:\n if stack and stack[-1] == i:\n stack.pop()\n else:\n stack.append(i)\n\nif stack:\n print(\"NO\")\nelse:\n print(\"YES\")", "s=input()\nstk=[]\nfor i in s:\n if len(stk)==0:\n stk.append(i)\n else:\n if i==stk[-1]:\n stk.pop()\n else:\n stk.append(i)\nif len(stk)==0:\n print('Yes')\nelse:\n print('No')\n \t\t\t\t \t\t\t\t\t\t \t \t\t\t\t\t\t \t\t", "s=input()\r\nst=[]\r\nfor i in range(0,len(s)):\r\n if len(st)==0 or s[i]!=st[-1]:\r\n st.append(s[i])\r\n else:\r\n st.pop()\r\nif st:\r\n print(\"no\")\r\nelse:\r\n print(\"yes\")\r\n ", "s=input()\nstack=[]\nfor i in s:\n if len(stack)==0:\n stack.append(i)\n else:\n if i==stack[-1]:\n stack.pop()\n else:\n stack.append(i)\nif len(stack)==0:\n print('Yes')\nelse:\n print('No')\n\t \t \t \t \t\t\t \t\t \t\t\t \t \t\t", "import sys\r\nimport math\r\nimport bisect\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict as dd\r\nfrom bisect import bisect_left as bl,bisect_right as br\r\n\r\n# faster input\r\nLINES = sys.stdin.read().splitlines()[::-1]\r\ndef input(): return LINES.pop()\r\n\r\n# single integer\r\ninp = lambda: int(input())\r\n\r\n# string input\r\nstrng = lambda: input().strip()\r\n\r\n# words split on white space\r\nstrwords = lambda: strng().split()\r\n\r\n\r\n# string list\r\nstrl = lambda: list(input().strip())\r\n\r\n# multiple integers, mapped\r\nmul = lambda: map(int,input().strip().split())\r\n\r\n# multiple floats, mapped\r\nmulf = lambda: map(float,input().strip().split())\r\n\r\n# list of multiple integers\r\nseq = lambda: list(map(int,input().strip().split()))\r\n\r\nceil = lambda x: int(x) if(x==int(x)) else int(x)+1\r\nceildiv = lambda x,d: x//d if(x%d==0) else x//d+1\r\n\r\nMOD = 1000000007\r\n\r\nmod_add = lambda x, y: ((x % MOD) + (y % MOD)) % MOD\r\nmod_multiply = lambda x, y: ((x % MOD) * (y % MOD)) % MOD\r\nmod_division = lambda x, y: mod_multiply(x, math.pow(y, MOD - 2, MOD))\r\n\r\nin_bounds = lambda x, y, grid: x >= 0 and x < len(grid) and y >= 0 and y < len(grid[0])\r\n\r\ndef solve():\r\n sequence = strl()\r\n \r\n stack = []\r\n \r\n for sign in sequence:\r\n if not stack:\r\n stack.append(sign)\r\n else:\r\n if sign == stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(sign)\r\n \r\n return not stack\r\n\r\nprint('Yes' if solve() else 'No')", "stack = []\nsoc = input()\nflag = True\n\nif len(soc) % 2 == 0:\n for sign in soc:\n if len(stack) > 0 and stack[len(stack) - 1] == sign:\n stack.pop()\n else:\n stack.append(sign)\n if len(stack) > (len(soc) / 2):\n break\nelse:\n flag = False\n\nif flag and len(stack) == 0:\n print('Yes')\nelse:\n print('No')\n", "s = input()\n\nif len(s)%2:print('No');exit(0)\n\nif s[::2].count('+')-s[1::2].count('+')==0:print('Yes');exit(0)\n\nprint('No')\n\n\n\n\n\n# Made By Mostafa_Khaled", "# LUOGU_RID: 111140183\nstr_input = list(input())\r\nstack = []\r\nfor ch in str_input:\r\n if not stack:\r\n stack.append(ch)\r\n else:\r\n if stack[-1] == ch: stack.pop()\r\n else: stack.append(ch)\r\nif not stack: print('Yes')\r\nelse: print('No')", "s = input()\r\nk = []\r\nlast = ''\r\nfor i in s:\r\n if i == last: k.pop()\r\n else: k.append(i)\r\n\r\n if len(k): last = k[-1]\r\n else: last = ''\r\nprint(\"No\" if len(k) else \"Yes\")", "s=str(input())\r\na=[]\r\nif len(s)%2!=0:\r\n print(\"No\")\r\nelse:\r\n for i in range(len(s)):\r\n if len(a)==0 or s[i]!=str(a[-1]):\r\n a.append(s[i])\r\n else:\r\n a.pop()\r\n if len(a)==0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\n", "from collections import deque\r\ndef Test(Q,inp):\r\n minus='-'\r\n plus='+'\r\n k=0\r\n if len(inp)%2!=0:\r\n return(\"NO\")\r\n else:\r\n for i in range(int(len(inp)/2)):\r\n f=Q.pop()+Q.pop()\r\n if f==plus+plus or f==minus+minus:\r\n continue\r\n elif f==plus+minus:\r\n k-=1\r\n continue\r\n elif f==minus+plus:\r\n k+=1\r\n if k==0:\r\n return('YES')\r\n else:\r\n return('NO')\r\ninp=input()\r\nQ=deque()\r\nfor i in range(len(inp)):\r\n Q.append(inp[i])\r\nprint(Test(Q,inp))\r\n", "import sys\r\nfrom math import \r\nfrom random 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\ns = input()\r\nt = []\r\nfor i in s:\r\n\tif len(t) == 0:\r\n\t\tt.append(i)\r\n\telif t[-1] != i:\r\n\t\tt.append(i)\r\n\telse:\r\n\t\tt.pop()\r\nif len(t):\r\n\tprint('No')\r\nelse:\r\n\tprint('Yes')\r\n", "current = input() \n\nst = []\n\nfor i in current:\n\tif not st:\n\t\tst.append(i)\n\telif st[-1] == i:\n\t\tst.pop()\n\telse:\n\t\tst.append(i)\n\nif not st:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")", "s = input()\np = 0\nn = 0\n\nfor i in range(len(s)):\n if i % 2 == 0:\n if s[i] == \"-\":\n p += 1\n else:\n n += 1\n else:\n if s[i] == \"-\":\n n += 1\n else:\n p += 1\n\nif p == n:\n print(\"Yes\")\nelse:\n print(\"No\")", "\ns = input()\nss = []\n\nfor i in s:\n if len(ss) > 0 and ss[-1] == i:\n ss.pop()\n else:\n ss.append(i)\nif len(ss) == 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t\t \t\t \t \t\t \t\t\t\t \t \t \t\t\t \t", "signals = input()\r\ndef wires(strg):\r\n transformed_signals = \"\"\r\n for i in range(len(signals)):\r\n if i % 2 == 0:\r\n if signals[i] == \"+\":\r\n transformed_signals += \"A\"\r\n else:\r\n transformed_signals += \"B\"\r\n else:\r\n if signals[i] == \"+\":\r\n transformed_signals += \"B\"\r\n else:\r\n transformed_signals += \"A\"\r\n\r\n count_a = transformed_signals.count(\"A\")\r\n count_b = transformed_signals.count(\"B\")\r\n\r\n if count_a == count_b:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\nwires(signals)", "a = input()\r\nstack = []\r\nfor i in a:\r\n if not stack:\r\n stack.append(i)\r\n elif stack and stack[-1]==i:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\nif stack:\r\n print('No')\r\nelse:\r\n print('Yes')", "string=input()\r\nstack=[]\r\nfor i in string:\r\n flag=True\r\n while stack:\r\n if stack[-1]==i:\r\n stack.pop()\r\n flag=False\r\n else:\r\n break\r\n if flag:\r\n stack+=(i,)\r\nif len(stack)==0:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "def f(n):\n stack = []\n for char in n:\n if not stack or stack[-1] != char:\n stack.append(char)\n else:\n stack.pop()\n if stack:\n return \"No\"\n else:\n return \"Yes\"\nn= input()\nresult =f(n)\nprint(result)\n\n\t \t\t\t\t \t \t \t \t\t", "wire_sequence = input()\nstack = []\nfor x in wire_sequence:\n if stack and stack[-1] == x:\n stack.pop()\n else:\n stack.append(x)\nif stack:\n print('No')\nelse:\n print('Yes')\n", "#code\r\ns = input()\r\nstk = []\r\n\r\nfor char in s:\r\n if not stk: # stack not empty\r\n stk.append(char)\r\n continue\r\n elif stk[-1] == char: # to element == char\r\n stk.pop()\r\n else:\r\n stk.append(char)\r\n\r\nif stk:\r\n # stack not empty\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "# https://blog.csdn.net/baidu_19306071/article/details/48026961\r\n\r\ns = input()\r\n\r\nstk = []\r\nfor c in s:\r\n if not stk or stk[-1] != c: stk.append(c)\r\n else: stk.pop()\r\n\r\nprint('No' if stk else 'Yes')", "s=input().strip()\r\nx=[]\r\nfor i in range(len(s)):\r\n if not x or x[-1]!=s[i]:\r\n x.append(s[i])\r\n else:\r\n x.pop()\r\nif len(x)==0:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "from collections import deque\ns = input()\ndq = deque()\nfor ch in s:\n if len(dq) == 0:\n dq.append(ch)\n else:\n if dq[-1] == '+' and ch == '+':\n dq.pop()\n elif dq[-1] == '-' and ch == '-':\n dq.pop()\n else:\n dq.append(ch)\nif len(dq) == 0:\n print(\"yes\")\nelse:\n print(\"No\")\n\t\t \t\t \t \t\t \t \t\t \t\t\t", "class LinkedList:\r\n class Node:\r\n def __init__(self, _value, _next=None):\r\n self.value = _value\r\n self.next = _next\r\n\r\n def __init__(self, args):\r\n self.head = None\r\n self.tail = None\r\n if args:\r\n for value in args:\r\n self.push_back(value)\r\n\r\n def push_front(self, value):\r\n newElement = LinkedList.Node(value)\r\n newElement.next = self.head\r\n self.head = newElement\r\n if self.tail is None:\r\n self.tail = newElement\r\n\r\n def push_back(self, value):\r\n if self.head is None:\r\n self.push_front(value)\r\n return\r\n newElement = LinkedList.Node(value)\r\n self.tail.next = newElement\r\n self.tail = newElement\r\n\r\n def isEmpty(self):\r\n return self.head is None\r\n\r\n def get_len(self):\r\n if self.isEmpty():\r\n return 0\r\n else:\r\n pointer = self.head\r\n length = 1\r\n while pointer.next is not None:\r\n length += 1\r\n pointer = pointer.next\r\n return length\r\n\r\n def pop_front(self):\r\n result = self.head.value\r\n self.head = self.head.next # Garbage collector's power\r\n return result\r\n\r\n def pop_back(self):\r\n result = self.tail.value\r\n self.delete(self.get_len() - 1)\r\n return result\r\n\r\n def get(self, num):\r\n return self.__get(num).value\r\n\r\n def __get(self, num):\r\n length = self.get_len()\r\n if num > length:\r\n print(\"List have only %d elements\" % length)\r\n return None\r\n elif num < 0:\r\n print(\"There can't be element %d\" % num)\r\n return None\r\n\r\n elif not self.isEmpty():\r\n pointer = self.head\r\n for i in range(num):\r\n pointer = pointer.next\r\n return pointer\r\n\r\n def insert(self, num, position):\r\n length = self.get_len()\r\n if position > length:\r\n print(\"List have only %d elements\" % length)\r\n return\r\n elif position < 0:\r\n print(\"There can't be element %d\" % num)\r\n return\r\n elif length == 0:\r\n self.push_back(num)\r\n return\r\n previous = self.__get(position - 1)\r\n if previous != self.tail:\r\n target = self.Node(num, previous.next)\r\n previous.next = target\r\n else:\r\n target = self.Node(num, None)\r\n if self.tail is not None:\r\n self.tail.next = target\r\n else:\r\n self.push_front(target)\r\n\r\n def delete(self, num):\r\n length = self.get_len()\r\n if num > length:\r\n print(\"List have only %d elements\" % length)\r\n return\r\n elif num < 0:\r\n print(\"There can't be element %d\" % num)\r\n return\r\n elif num == 0 and self.get_len() == 1:\r\n self.head, self.tail = None, None # Garbage collector's power\r\n elif num != self.get_len() - 1:\r\n self.__get(num - 1).next = self.__get(num + 1) # Garbage collector's power\r\n else:\r\n self.__get(num - 1).next = None # Garbage collector's power\r\n\r\n def print(self):\r\n pointer = self.head\r\n while pointer is not None:\r\n print(pointer.value)\r\n pointer = pointer.next\r\n\r\n def get_list(self):\r\n pointer = self.head\r\n result = []\r\n while pointer is not None:\r\n result.append(pointer.value)\r\n pointer = pointer.next\r\n return result\r\n\r\n def get_back(self):\r\n return self.tail.value if not self.isEmpty() else None\r\n\r\n def get_front(self):\r\n return self.head.value if not self.isEmpty() else None\r\n \r\n \r\nll = LinkedList()\r\nfor i in input():\r\n if ll.get_front() == i and not ll.isEmpty():\r\n ll.pop_front()\r\n else:\r\n ll.push_front(i)\r\nprint(\"Yes\") if ll.isEmpty() else print(\"No\")", "# Alternating Current\r\n\r\ncurrent = input()\r\nstack = []\r\n\r\nfor i in range(0, len(current)):\r\n if not stack:\r\n stack.append(current[i])\r\n elif current[i] == stack[-1]:\r\n stack.pop()\r\n elif current[i] != stack[-1]:\r\n stack.append(current[i])\r\n\r\nif not stack:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "from sys import stdin\n\nlines, line_index = stdin.readlines(), -1\n\n\ndef get_line():\n global lines, line_index\n\n line_index += 1\n return lines[line_index]\n\ndef main():\n string = get_line().strip()\n\n stack = []\n\n for c in string:\n if not stack:\n stack.append(c)\n elif stack[-1] == c:\n stack.pop()\n else:\n stack.append(c)\n\n if not stack:\n print('Yes')\n else:\n print('No')\n\nmain()", "a = list(input())\r\nfor i in range(len(a)):\r\n if i % 2 == 0:\r\n if a[i] == '+':\r\n a[i] = 'B'\r\n elif a[i] == '-':\r\n a[i] = 'A'\r\n elif i % 2 != 0:\r\n if a[i] == '+':\r\n a[i] = 'A'\r\n elif a[i] == '-':\r\n a[i] = 'B'\r\nif a.count('A') == a.count('B'):\r\n print('YES')\r\nelse:\r\n print('NO')", "def current(st):\r\n stack=[]\r\n for i in st:\r\n if i==\"-\" and stack and stack[-1]==\"-\":\r\n stack.pop()\r\n elif i==\"-\":\r\n stack.append(\"-\")\r\n elif i==\"+\" and stack and stack[-1]==\"+\":\r\n stack.pop()\r\n elif i==\"+\":\r\n stack.append(\"+\")\r\n if stack:\r\n return \"No\"\r\n return \"Yes\"\r\n\r\nst = input()\r\nres = current(st)\r\nprint(res)\r\n", "# -- coding: utf-8 --\n\n# Baqir Khan\n# Software Engineer (Backend)\n\nfrom sys import stdin\n\ninp = stdin.readline\n\ns = inp()[:-1]\n\nstack = []\n\nfor i in s:\n if len(stack) and stack[-1] == i:\n stack.pop()\n else:\n stack.append(i)\n\nprint(\"No\" if len(stack) else \"Yes\")", "string = list(input())\r\nstack = list()\r\nmatch = [('+','+'),('-','-')]\r\nfor i in string:\r\n if stack and (stack[-1], i) in match:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n\r\nif stack == []:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n\r\n\r\n\r\n", "s=input()\r\nif len(s)%2!=0:\r\n print(\"No\")\r\nelse:\r\n st=[s[0]]\r\n for i in range(1,len(s)):\r\n if len(st)==0 or s[i]!=st[-1]:\r\n st.append(s[i])\r\n else:\r\n st.pop()\r\n if len(st)==0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n \r\n", "# Maximiliano Andaur 2020441618 -> spacedgypy\n# Solucion tomada de RMahajan en codeforces\ns = input() # Se define la entrada de texto\n\nstack = [] # Definimos una lista vacia\nfor i in s: # Se crea un bucle que vaya leyendo los terminos de la cadena de texto\n if stack and i == stack[-1]: # Si el vector esta vacio no entrara al condicional y ademas\n # debe cumplir que el ultimo elemento del vector debe ser igual al que se agregara\n stack.pop() # si esto se cumple, significa que no hay nudo en ese punto, y por lo tanto lo quitamos\n else: # En el caso de que esto no suceda, se agregara al vector (como un nudo temporal que puede ser disuelto más adelante)\n stack.append(i)\n \nans = 'No' if stack else 'Yes' # aquí en el caso que que stack(nuestro vector desenredado) este vacio, significa que no hay nudos\nprint(ans) # e imprimira \"Yes\", si no es el caso, y el vector si contenga nudos, se imprimira \"No\" resolviendo así el problema\n\t\t\t \t \t \t \t\t \t\t\t\t\t \t \t\t \t", "\ns = input()\nn = len(s)\n\nst = []\n\nfor i in range(n):\n if not st:\n st.append(s[i])\n continue\n if st[-1] == s[i]:\n st.pop()\n else:\n st.append(s[i])\n\nif not st:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n \t\t \t \t \t \t\t\t\t \t \t\t\t\t\t\t", "s=input()\narr=[]\nfor i in range(0, len(s)):\n if arr and s[i] == arr[-1]:\n del arr[-1]\n else :\n arr.append(s[i])\nif arr:\n print(\"No\")\nelse :\n print(\"Yes\")\n\t\t \t \t\t\t \t\t \t \t\t \t\t \t\t", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Dec 29 12:42:14 2022\r\n\r\n@author: rohan\r\n\"\"\"\r\n\r\nc = input()\r\ns = []\r\n\r\nfor i in range(len(c)):\r\n if s and s[-1] == c[i]:\r\n s.pop()\r\n else:\r\n s.append(c[i])\r\n \r\nif not s:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "s=input()\r\nst=[]\r\nfor i in range(len(s)):\r\n if st and st[-1]==s[i]:\r\n st.pop()\r\n else:\r\n st.append(s[i])\r\nif st:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "s=input()\r\nls=len(s)\r\nk=[None]ls\r\nfor i in range(ls):\r\n if i%2==0:\r\n k[i]=(1 if s[i]==\"-\" else 0)\r\n else:\r\n k[i]=(0 if s[i]==\"-\" else 1)\r\nstack=[]\r\ni=0\r\nwhile i<ls:\r\n if stack:\r\n if k[i]!=stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(k[i])\r\n else:\r\n stack.append(k[i])\r\n i+=1\r\nprint(\"No\" if stack else \"Yes\")", "from queue import Empty\r\n\r\n\r\npo=input()\r\nstack=[po[0]]\r\n\r\n\r\nfor i in range(1,len(po)):\r\n if len(stack)>0:\r\n if stack[-1]==po[i]:\r\n stack.pop()\r\n else:\r\n stack.append(po[i]) \r\n else:\r\n stack.append(po[i]) \r\n\r\nif len(stack)==0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\") \r\n", "RI = lambda : [int(x) for x in input().split()]\r\nrw = lambda : [input().strip()]\r\n\r\n\r\ns=list(input().strip())\r\n\r\nstack=[]\r\nindex_stack=-1\r\n\r\nfor i in s:\r\n if(i=='+'):\r\n if(index_stack!=-1):\r\n if(stack[index_stack]=='+'):\r\n stack.pop()\r\n index_stack-=1\r\n else:\r\n stack.append(i)\r\n index_stack+=1\r\n else:\r\n stack.append(i)\r\n index_stack+=1\r\n \r\n if(i=='-'):\r\n if(index_stack!=-1):\r\n if(stack[index_stack]=='-'):\r\n stack.pop()\r\n index_stack-=1\r\n else:\r\n stack.append(i)\r\n index_stack+=1\r\n else:\r\n stack.append(i)\r\n index_stack+=1\r\n\r\nif(index_stack==-1):\r\n ans='Yes'\r\nelse:\r\n ans='No'\r\nprint(ans)\r\n \r\n \r\n \r\n", "s=input()\r\nn=len(s)\r\nstack=[]\r\nfor i in s:\r\n if len(stack)==0:\r\n stack.append(i)\r\n else:\r\n if stack[-1]==i:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\nif len(stack)==0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = input()\r\n\r\nstack = []\r\n\r\nfor i in n:\r\n if len(stack)!=0:\r\n if stack[-1] == i:\r\n stack.pop(-1)\r\n\r\n else:\r\n stack.append(i)\r\n\r\n else:\r\n stack.append(i)\r\n\r\n\r\nif len(stack)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=[]\r\nfor i in input():\r\n if s and s[-1]==i:\r\n s.pop()\r\n else:\r\n s.append(i)\r\nprint('Yes') if not s else print('No') \r\n", "class Stack:\r\n def __init__(self):\r\n self.items = []\r\n\r\n def isEmpty(self):\r\n return self.items == []\r\n\r\n def push(self, item):\r\n self.items.append(item)\r\n\r\n def pop(self):\r\n self.items.pop()\r\n\r\n def peek(self):\r\n return self.items[len(self.items)-1]\r\n\r\n def size(self):\r\n return len(self.items)\r\n def printStack(self):\r\n return self.items\r\n\r\ns = input()\r\nstack = Stack()\r\n# stack.push(s[0])\r\ni=0\r\nwhile i<len(s):\r\n if stack.isEmpty()==True:\r\n stack.push(s[i])\r\n i+=1\r\n continue\r\n while i<len(s) and stack.isEmpty()==False and stack.peek()==s[i]:\r\n stack.pop()\r\n i+=1\r\n if i<len(s):\r\n stack.push(s[i])\r\n i+=1\r\n\r\n\r\nans = \"\".join(stack.printStack())\r\nif len(ans)==0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input()\r\nl = []\r\n\r\nfor i in s:\r\n if l and i == l[-1]:\r\n del l[-1]\r\n else:\r\n l.append(i)\r\n\r\nif l:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n" ]	{"inputs": ["-++-", "+-", "++", "-", "+-+-", "-+-", "-++-+--+", "+", "-+", "--", "+++", "--+", "++--++", "+-++-+", "+-+--+", "--++-+", "-+-+--", "+-+++-", "-+-+-+", "-++-+--++--+-++-", "+-----+-++---+------+++-++++", "-+-++--+++-++++---+--+----+--+-+-+++-+++-+---++-++++-+--+--+--+-+-++-+-+-++++++---++--+++++-+--++--+-+--++-----+--+-++---+++---++----+++-++++--++-++-", "-+-----++++--++-+-++", "+--+--+------+++++++-+-+++--++---+--+-+---+--+++-+++-------+++++-+-++++--+-+-+++++++----+----+++----+-+++-+++-----+++-+-++-+-+++++-+--++----+--+-++-----+-+-++++---+++---+-+-+-++++--+--+++---+++++-+---+-----+++-++--+++---++-++-+-+++-+-+-+---+++--+--++++-+-+--++-------+--+---++-----+++--+-+++--++-+-+++-++--+++-++++++++++-++-++++++-+++--+--++-+++--+++-++++----+++---+-+----++++-+-+", "-+-+-++-+-+-", "-+-++-+-", "-+-++-+-+-", "++-+-+-+-+--+", "+++---", "+-+-+-+-+--+-+-+-+-++--++--+", "+-+-++", "-++--+--+++-+-+-+-+-", "+---+-+-", "+-+--+-+", "+++---+++---", "-+++++", "-+-+-+-+-+-+-++-+-+-+-+-+-+-", "-+++--", "+---+", "-++", "-+--+-", "+---++--++", "+++-", "--+++", "++-+"], "outputs": ["Yes", "No", "Yes", "No", "No", "No", "Yes", "No", "No", "Yes", "No", "No", "Yes", "Yes", "No", "No", "No", "No", "No", "Yes", "No", "No", "Yes", "Yes", "Yes", "Yes", "No", "No", "No", "Yes", "No", "No", "No", "Yes", "No", "No", "Yes", "No", "No", "No", "Yes", "No", "No", "No", "No"]}	UNKNOWN	PYTHON3	CODEFORCES	189
8fa59503460967189c33fd84aaf7e67c	Help Farmer	Once upon a time in the Kingdom of Far Far Away lived Sam the Farmer. Sam had a cow named Dawn and he was deeply attached to her. Sam would spend the whole summer stocking hay to feed Dawn in winter. Sam scythed hay and put it into haystack. As Sam was a bright farmer, he tried to make the process of storing hay simpler and more convenient to use. He collected the hay into cubical hay blocks of the same size. Then he stored the blocks in his barn. After a summer spent in hard toil Sam stored A·B·C hay blocks and stored them in a barn as a rectangular parallelepiped A layers high. Each layer had B rows and each row had C blocks. At the end of the autumn Sam came into the barn to admire one more time the hay he'd been stacking during this hard summer. Unfortunately, Sam was horrified to see that the hay blocks had been carelessly scattered around the barn. The place was a complete mess. As it turned out, thieves had sneaked into the barn. They completely dissembled and took away a layer of blocks from the parallelepiped's front, back, top and sides. As a result, the barn only had a parallelepiped containing (A<=-<=1)<=×<=(B<=-<=2)<=×<=(C<=-<=2) hay blocks. To hide the evidence of the crime, the thieves had dissembled the parallelepiped into single 1<=×<=1<=×<=1 blocks and scattered them around the barn. After the theft Sam counted n hay blocks in the barn but he forgot numbers A, B и C. Given number n, find the minimally possible and maximally possible number of stolen hay blocks. The only line contains integer n from the problem's statement (1<=≤<=n<=≤<=109). Print space-separated minimum and maximum number of hay blocks that could have been stolen by the thieves. Note that the answer to the problem can be large enough, so you must use the 64-bit integer type for calculations. Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator. Sample Input 4 7 12 Sample Output 28 41 47 65 48 105	[ "n = int(input())\r\nmn = mx = (n+1)9\r\ni = 1\r\nwhile ii <= n :\r\n if n%i == 0 :\r\n j = 1\r\n while jj <= (n//i) :\r\n if (n//i)%j == 0 :\r\n mn = min(mn,(i+1)(j+2)(n//(ij)+2))\r\n mn = min(mn,(i+2)(j+1)(n//(ij)+2))\r\n mn = min(mn,(i+2)(j+2)(n//(ij)+1))\r\n j += 1\r\n i += 1\r\nprint(mn-n,mx-n)", "import math\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ninf = pow(10, 18) + 1\r\nmi, ma = inf, -inf\r\nfor a in range(1, int(math.sqrt(n)) + 3):\r\n if n % a:\r\n continue\r\n m = n // a\r\n for b in range(1, int(math.sqrt(m)) + 3):\r\n if m % b:\r\n continue\r\n c = m // b\r\n u = (a + 1) * (b + 2) * (c + 2) - n\r\n v = (a + 2) * (b + 1) * (c + 2) - n\r\n w = (a + 2) * (b + 2) * (c + 1) - n\r\n mi = min(mi, u, v, w)\r\n ma = max(ma, u, v, w)\r\nprint(mi, ma)", "n = int(input())\r\nu = v = 9 + 8 * n\r\nfor a in range(1, int(n (1 / 3)) + 1):\r\n if n % a: continue\r\n m = n // a\r\n for b in range(a, int(m 0.5) + 1):\r\n if m % b: continue\r\n p = (a + 1) * (b + 2) * (m // b + 2) - n\r\n if u > p: u = p\r\nprint(u, v)", "from math import sqrt\n\np, n = [], int(input())\n\ndef f(x, y): return (x + 2) * (y + 2) + (2 * (x + y + 2) * n) // (x * y)\n\nfor x in range(2, int(sqrt(n)) + 1):\n\n if n % x == 0: p.append(x)\n\np += [n // x for x in reversed(p)]\n\np.append(n)\n\nu = v = f(1, 1)\n\nfor m in p:\n\n for x in range(1, int(sqrt(m)) + 1): \n\n if m % x == 0: u = min(u, f(x, m // x))\n\nprint(u, v)", "n = int(input())\r\ndef fact(n):\r\n l = set()\r\n for i in range(1,int(pow(n,0.5))+1):\r\n if n % i == 0:\r\n l.add(i)\r\n l.add(n//i)\r\n return l\r\n\r\nfs = fact(n)\r\nmn = float(\"inf\")\r\nmx = -float(\"inf\")\r\nfor i in fs:\r\n for j in fs:\r\n if i * j > n: continue\r\n if n % (ij) != 0: continue\r\n k = n//(ij)\r\n a,b,c = i+1, j+2, k+2\r\n mn = min(abc - n, mn)\r\n mx = max(abc - n, mx)\r\nprint(mn, mx)", "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\r\n mn, mx = min(8 * n + 9, 5 * n + 12), max(8 * n + 9, 5 * n + 12)\r\n\r\n for a_1 in range(1, int(n (1 / 3)) + 2):\r\n if n % a_1 == 0:\r\n for b_2 in range(1, int((n / a_1) (1 / 2)) + 1):\r\n if n % (a_1 * b_2) == 0:\r\n c_2 = n // (a_1 * b_2)\r\n mn = min(mn, (a_1 + 1) * (b_2 + 2) * (c_2 + 2) - n)\r\n\r\n print(mn, mx)\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", "from math import sqrt\r\nn = int(input())\r\n\r\ndef f(x, y): \r\n return (x+2) * (y+2) + (2n (x+y+2)) // (x * y)\r\n\r\nfactors = []\r\nfor i in range(2, int(sqrt(n))+1):\r\n if n % i == 0:\r\n factors.append(i)\r\nfactors += [n // i for i in reversed(factors)] + [n]\r\nres = f(1, 1)\r\nfor i in factors:\r\n for j in range(1, int(sqrt(i))+1):\r\n if i % j == 0:\r\n res = min(res, f(j, i // j))\r\nprint(res, f(1, 1))\r\n", "n=int(input())\r\nk=n\r\na=set()\r\na.add(n)\r\na.add(1)\r\nw=999999999999999999999999999999999999999\r\nans=[1,1,1]\r\nfor i in range(int(pow(n,1/3)),0,-1):\r\n n=k\r\n if n%i==0:\r\n ans[0]=i\r\n else:\r\n continue\r\n n=n//i\r\n #print(n)\r\n for i in range(int(pow(n,1/2)),0,-1):\r\n if n%i==0:\r\n ans[2]=i\r\n ans[1]=n//i\r\n else:\r\n continue\r\n #print(ans)\r\n ans.sort()\r\n ans[0]+=1\r\n ans[1]+=2\r\n ans[2]+=2\r\n n=k\r\n w=min(w,ans[0]ans[-1]ans[1]-n)\r\nn=k\r\n\r\ne=8n+9\r\nprint(w,e)", "# ========= /\\ /\| \|====/\|\r\n# \| / \\ \| \| / \|\r\n# \| /____\\ \| \| / \|\r\n# \| / \\ \| \| / \|\r\n# ========= / \\ ===== \|/====\| \r\n# code\r\n\r\ndef main():\r\n n = int(input())\r\n m1 = float('inf')\r\n m2 = float('-inf')\r\n i = 1\r\n while iii <= n:\r\n if n%i != 0:\r\n i += 1\r\n continue\r\n j = 1\r\n while jj <= n//i:\r\n if (n//i)%j != 0:\r\n j += 1\r\n continue\r\n k = (n // i)//j\r\n # print(i,j,k)\r\n m1 = min(m1 , (i + 1)(j + 2)(k + 2) - n)\r\n m1 = min(m1 , (j + 1)(i + 2)(k + 2) - n)\r\n m1 = min(m1 , (k + 1)(j + 2)(i + 2) - n)\r\n \r\n m2 = max(m2 , (i + 1)(j + 2)(k + 2) - n)\r\n m2 = max(m2 , (j + 1)(i + 2)(k + 2) - n)\r\n m2 = max(m2 , (k + 1)(j + 2)(i + 2) - n)\r\n j += 1\r\n i += 1\r\n print(m1 , m2)\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nmn = 999999999999\r\n\r\nfor i in range(1, int(n(1/3))+1):\r\n if n%i==0:\r\n for j in range(1, int((n//i)(1/2))+1):\r\n if (n/i) % j == 0:\r\n k = (n//i)//j\r\n mn = min(mn, (i+1)(k+2)(j+2))\r\n\r\nprint(mn-n, (9n+9-n))", "n = int(input())\r\n\r\na=n+1\r\nb=3\r\nc=3\r\nsmax = bc + 2b(a-1) + 2(a-1)(c-2)\r\n\r\na = int(n(1/3))+1\r\na = max(a,2)\r\nsmin = smax\r\nwhile a>=2:\r\n if n%(a-1)==0:\r\n m = n//(a-1)\r\n b = int(m0.5)\r\n c = m//b\r\n while bc != m:\r\n b -= 1\r\n c = m//b\r\n b += 2\r\n c += 2\r\n s = bc + 2b(a-1) + 2(a-1)(c-2)\r\n smin = min(s,smin)\r\n a -= 1\r\n\r\nprint(smin,smax)\r\n\r\n\r\n\r\n", "n=int(input())\r\nif n==1:\r\n print(17,17)\r\nelse:\r\n c12=c22=c0=max(1,int((n/4)(1/3)))\r\n c22+=1\r\n a3,a4,c2=n,1,1\r\n a1,a2,c1=n,1,1\r\n d1=d2=float('inf')\r\n while c12>=1:\r\n if n%c12==0:\r\n n1=n//c12\r\n d=float('inf')\r\n for i in range(1,int(n10.5)+1):\r\n if n1%i==0:\r\n c,a,b=sorted([c12,i,n1//i])\r\n if (c+1)(a+2)(b+2)<d:\r\n d=(c+1)(a+2)(b+2)\r\n a11,a21,c11=a,b,c\r\n if d<d1:\r\n d1=d\r\n a1,a2,c1=a11,a21,c11\r\n else:\r\n break\r\n c12-=1\r\n while c22<=2c0:\r\n if n%c22==0:\r\n n2=n//c22\r\n d=float('inf')\r\n for i in range(1,int(n20.5)+1):\r\n if n2%i==0:\r\n c,a,b=sorted([c22,i,n2//i])\r\n if (c+1)(a+2)(b+2)<d:\r\n d=(c+1)(a+2)(b+2)\r\n a31,a41,c21=a,b,c\r\n if d<d2:\r\n d2=d\r\n a3,a4,c2=a31,a41,c21\r\n else:\r\n break\r\n c22+=1\r\n print(min((c2+1)(a3+2)(a4+2),(c1+1)(a1+2)(a2+2))-n,8n+9)", "n=int(input())\r\n\r\nL=[]\r\n\r\ni=1\r\n\r\nwhile(iii<=n):\r\n if(n%i!=0):\r\n i+=1\r\n continue\r\n x=n//i\r\n j=i\r\n while(jj<=x):\r\n if(x%j!=0):\r\n j+=1\r\n continue\r\n L.append((i,j,x//j))\r\n j+=1\r\n i+=1\r\nmaxx=0\r\nminn=1020\r\nE=[[1,2,2],[2,1,2],[2,2,1]]\r\nfor item in L:\r\n x=item[0]\r\n y=item[1]\r\n z=item[2]\r\n A=[x,y,z]\r\n for item in E:\r\n m=(A[0]+item[0])(A[1]+item[1])(A[2]+item[2])\r\n if(m<minn):\r\n minn=m\r\n if(m>maxx):\r\n maxx=m\r\nprint(minn-n,maxx-n)\r\n \r\n", "n=int(input())\r\na,mi=1,999999999999\r\nwhile a3<=n:\r\n if n%a==0:\r\n b=1\r\n while b2<=(n//a):\r\n if (n//a)%b==0:\r\n c=n//a//b\r\n mi=min(mi,(a+1)(b+2)(c+2))\r\n b+=1\r\n a+=1\r\nprint(mi-n, 9n+9-n)\r\n", "\r\nn=int(input())\r\ni=1\r\nl=[]\r\n#prime-factoraiztion\r\nwhile(ii<=n):\r\n if(n%i==0):\r\n l.append(i)\r\n i+=1\r\nlmax=[]\r\nlmin=[]\r\nfor i in range(len(l)):\r\n for j in range(i,len(l)):\r\n if(l[i]l[j]<=n):\r\n t=l[i]l[j]\r\n if(n%t==0):\r\n k=n//t\r\n lmax.append((l[i]+1)(l[j]+2)(k+2))\r\n lmin.append((l[i]+1)(l[j]+2)(k+2))\r\n lmax.append((l[i]+2)(l[j]+2)(k+1))\r\n lmin.append((l[i]+2)(l[j]+2)(k+1))\r\n lmax.append((l[i]+2)(l[j]+1)(k+2))\r\n lmin.append((l[i]+2)(l[j]+1)(k+2))\r\n \r\nprint(min(lmin)-n,max(lmax)-n)\r\n", "n = int(input())\r\nkd = 0\r\nd = [0] 100010\r\nfor x in range(1, n + 1):\r\n if x * x > n:\r\n break\r\n elif n % x == 0:\r\n kd += 1\r\n d[kd] = x\r\n if x * x < n:\r\n kd += 1\r\n d[kd] = n // x\r\nminimum = float('inf')\r\nmaximum = -1\r\nfor a in range(1, kd + 1):\r\n for b in range(1, kd + 1):\r\n if n // d[a] % d[b] != 0:\r\n continue\r\n c = n // d[a] // d[b]\r\n cur = (d[a] + 1) * (d[b] + 2) * (c + 2) - n\r\n minimum = min(minimum, cur)\r\n maximum = max(maximum, cur)\r\nprint(minimum, maximum)# 1691165660.7016428", "n = int(input())\r\na = 1\r\nmn = 1000000000000000\r\nmx = -1000000000000000\r\nwhile a * a * a <= n:\r\n if n % a != 0:\r\n a += 1\r\n continue\r\n b = a\r\n while a * b * b <= n:\r\n if (n // a) % b != 0:\r\n b += 1\r\n continue\r\n c = n // a // b\r\n #print(a, b, c)\r\n cur = (a + 1) * (b + 2) * (c + 2)\r\n mn = min(mn, cur)\r\n mx = max(mx, cur)\r\n cur = (a + 2) * (b + 1) * (c + 2)\r\n mn = min(mn, cur)\r\n mx = max(mx, cur)\r\n cur = (a + 2) * (b + 2) * (c + 1)\r\n mn = min(mn, cur)\r\n mx = max(mx, cur)\r\n b += 1\r\n a += 1\r\nprint(mn - n, mx - n)\r\n" ]	{"inputs": ["4", "7", "12", "1", "6", "8", "9", "14", "15", "16", "18", "20", "299999771", "54", "96", "348", "748", "908", "1026", "1985", "4472", "20845", "50480", "62497", "646055", "790620", "989903", "7033800", "7661860", "7834243", "45134118", "89054701", "99264891", "127039320", "206898748", "231136953", "257259713", "286736327", "311933803", "332393619", "422114561", "453012754", "470860680", "509607936", "534879507", "535074941", "536870912", "573308928", "603979776", "605404800", "615716902", "628464178", "631243141", "644972544", "659274082", "679477248", "735134400", "764411904", "778377600", "791683200", "805306368", "821620800", "856079286", "857656800", "859963392", "864864000", "882161280", "884822400", "905969664", "908107200", "918918000", "931170240", "935625600", "936354996", "951350400", "958557600", "972972000", "980179200", "985944960", "994593600", "999893227", "999893387", "999905161", "999942949", "999996583", "999999797", "999999883", "999999893", "999999929", "999999937", "999999991", "999999992", "999999993", "999999994", "999999995", "999999996", "999999997", "999999998", "999999999", "1000000000"], "outputs": ["28 41", "47 65", "48 105", "17 17", "34 57", "40 73", "41 81", "58 121", "55 129", "56 137", "57 153", "64 169", "1499998867 2399998177", "106 441", "144 777", "396 2793", "487 5993", "1840 7273", "591 8217", "3601 15889", "1603 35785", "8873 166769", "17884 403849", "312497 499985", "140995 5168449", "316416 6324969", "1082167 7919233", "210976 56270409", "546725 61294889", "8302235 62673953", "19223945 361072953", "445273517 712437617", "15587889 794119137", "1209066 1016314569", "1683461 1655189993", "539319577 1849095633", "2122207 2058077713", "290355727 2293890625", "1559669027 2495470433", "10714371 2659148961", "78417139 3376916497", "2844347 3624102041", "129486993 3766885449", "3045276 4076863497", "253364145 4279036065", "647722381 4280599537", "3151876 4294967305", "3301020 4586471433", "3414276 4831838217", "3414952 4843238409", "10508698 4925735225", "3574502 5027713433", "634644469 5049945137", "3573148 5159780361", "1977822262 5274192665", "3693060 5435817993", "3886608 5881075209", "3988228 6115295241", "4036708 6227020809", "4082888 6333465609", "4201476 6442450953", "4185636 6572966409", "196667409 6848634297", "4307008 6861254409", "4320292 6879707145", "4331048 6918912009", "4388720 7057290249", "4396766 7078579209", "4529412 7247757321", "4474050 7264857609", "4511288 7351344009", "4548514 7449361929", "4563150 7485004809", "40069269 7490839977", "4614600 7610803209", "4637398 7668460809", "4685478 7783776009", "4707050 7841433609", "4725040 7887559689", "4752650 7956748809", "1000183267 7999145825", "1000724227 7999147105", "1000161721 7999241297", "1000368197 7999543601", "1022096687 7999972673", "4999998997 7999998385", "4999999427 7999999073", "4999999477 7999999153", "4999999657 7999999441", "4999999697 7999999505", "1059701759 7999999937", "129518035 7999999945", "490196227 7999999953", "928571477 7999999961", "4924975 7999999969", "1000000044 7999999977", "15309947 7999999985", "504345691 7999999993", "52392027 8000000001", "4770064 8000000009"]}	UNKNOWN	PYTHON3	CODEFORCES	17
8fa6e1aca0e2b6bce302b0b112f22de6	Letter	A boy Bob likes to draw. Not long ago he bought a rectangular graph (checked) sheet with n rows and m columns. Bob shaded some of the squares on the sheet. Having seen his masterpiece, he decided to share it with his elder brother, who lives in Flatland. Now Bob has to send his picture by post, but because of the world economic crisis and high oil prices, he wants to send his creation, but to spend as little money as possible. For each sent square of paper (no matter whether it is shaded or not) Bob has to pay 3.14 burles. Please, help Bob cut out of his masterpiece a rectangle of the minimum cost, that will contain all the shaded squares. The rectangle's sides should be parallel to the sheet's sides. The first line of the input data contains numbers n and m (1<=≤<=n,<=m<=≤<=50), n — amount of lines, and m — amount of columns on Bob's sheet. The following n lines contain m characters each. Character «.» stands for a non-shaded square on the sheet, and «» — for a shaded square. It is guaranteed that Bob has shaded at least one square. Output the required rectangle of the minimum cost. Study the output data in the sample tests to understand the output format better. Sample Input 6 7 ....... ..*.. ...... ..**.. ...... ..*.. 3 3 * . * Sample Output * .. ** .. * . ***	[ "def main():\r\n n, m = list(map(int, input().split()))\r\n arr = []\r\n for _ in range(n):\r\n arr.append(input())\r\n\r\n mn_i, mx_i, mx_j, mn_j = n, -1, -1, m\r\n for i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == \"\":\r\n mn_i = min(mn_i, i)\r\n mx_i = max(mx_i, i)\r\n mn_j = min(mn_j, j)\r\n mx_j = max(mx_j, j)\r\n for i in range(mn_i, mx_i + 1):\r\n print(arr[i][mn_j : mx_j + 1])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#%%\r\nrc=input().split()\r\nr,c=[int(x) for x in rc]\r\nmatrix=[]\r\nfor i in range(r):\r\n matrix.append(input())\r\nmax_i=0\r\nmax_j=0\r\nmin_i=r-1\r\nmin_j=c-1\r\nfor i in range(r):\r\n for j in range(c):\r\n if matrix[i][j]=='':\r\n if i<min_i:\r\n min_i=i\r\n if i>max_i:\r\n max_i=i\r\n if j<min_j:\r\n min_j=j\r\n if j>=max_j:\r\n max_j=j\r\nfor i in range(min_i,max_i+1):\r\n print(matrix[i][min_j:max_j+1])\r\n\r\n\r\n\r\n# %%\r\n", "n,m=map(int,input().split())\r\nd=[]\r\nfor i in range(n):\r\n s=input()\r\n s=list(s)\r\n d.append(s)\r\nminc=m\r\nmaxc=0\r\nminr=n\r\nmaxr=0\r\nfor i in range(n):\r\n if \"\" in d[i]:\r\n if i<minr:\r\n minr=i\r\n if i>maxr:\r\n maxr=i\r\n for j in range(m):\r\n if d[i][j]==\"\":\r\n if j<minc:\r\n minc=j\r\n if j>maxc:\r\n maxc=j\r\n\r\nfor i in range(minr,maxr+1):\r\n es=\"\"\r\n for j in range(minc,maxc+1):\r\n es+=d[i][j]\r\n print(es)\r\n\r\n", "n,m =map(int,input().split(' '))\r\ngrid=[]\r\nimin=float('inf')\r\nimax=float('-inf')\r\njmin=float('inf')\r\njmax=float('-inf')\r\nfor _ in range(n):\r\n grid.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j]==\"\":\r\n imin=min(i,imin)\r\n imax=max(i,imax)\r\n jmin=min(j,jmin)\r\n jmax=max(j,jmax)\r\nfor k in range(imin,imax+1):\r\n print(grid[k][jmin:jmax+1])", "def q14a():\n\tn, m = tuple([int(num) for num in input().split()])\n\trows_of_array = []\n\tfor i in range(n):\n\t\ttemp_str = input()\n\t\trows_of_array.append(temp_str)\n\trows_of_array = q14a_cut(rows_of_array)\n\trows_of_array.reverse()\n\trows_of_array = q14a_cut(rows_of_array)\n\trows_of_array.reverse()\n\ttransposed = [\"\".join(list(tuple_)) for tuple_ in list(zip(rows_of_array))]\n\ttransposed = q14a_cut(transposed)\n\ttransposed.reverse()\n\ttransposed = q14a_cut(transposed)\n\ttransposed.reverse()\n\tdouble_transposed = [\"\".join(list(tuple_)) for tuple_ in list(zip(transposed))]\n\tprint(\"\\n\".join(double_transposed))\n\ndef q14a_cut(rows_of_array):\n\ti = 0\n\twhile('' not in rows_of_array[i]):\n\t\ti += 1\n\treturn rows_of_array[i:]\n\nq14a()\n\n\n\n\n\n\n\n\n\n# Previous (buggy) version: failed when there are empty lines in middle\n# def q14a():\n# \tn, m = tuple([int(num) for num in input().split()])\n# \trows_of_array = []\n# \tfor i in range(n):\n# \t\ttemp_str = input()\n# \t\tif('' in temp_str):\n# \t\t\trows_of_array.append(temp_str)\n# \ttransposed = [\"\".join(list(tuple_)) for tuple_ in list(zip(rows_of_array))]\n# \tfor i in range(len(transposed)-1, -1, -1):\n# \t\tif('' not in transposed[i]):\n# \t\t\ttransposed.pop(i)\n# \tdouble_transposed = [\"\".join(list(tuple_)) for tuple_ in list(zip(transposed))]\n# \t#print(double_transposed)\n# \tprint(\"\\n\".join(double_transposed))", "n,m=map(int,input().split(\" \"))\r\ns,e,c ,s_1,e_1=100,0,0,-1,0 # start ,end , count ,start_rectangle,end_rectangle\r\nl=[]\r\n\r\nfor i in range(n):\r\n temp=input()\r\n if (\"\" in temp ):\r\n if (s_1==-1 ):s_1=i\r\n if(temp.index(\"\")<s):\r\n s=temp.index(\"\")\r\n if(temp.rindex(\"\")>e ):\r\n e=temp.rindex(\"\") \r\n \r\n if ( e_1<i ):e_1=i\r\n l.append(list(temp))\r\n\r\n\r\nfor i in range(s_1,e_1+1):\r\n print(\"\".join(l[i][s:e+1]))\r\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 (list(s[:len(s) - 1]))\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 n, m = invr()\r\n A = list()\r\n minX = m\r\n maxX = -1\r\n minY = n\r\n maxY = -1\r\n for row in range(n):\r\n s = input()\r\n A.append(s)\r\n firstIndex = s.find(\"\")\r\n if firstIndex != -1:\r\n minX = min(minX, firstIndex)\r\n lastIndex = s.rfind(\"\")\r\n maxX = max(maxX, lastIndex)\r\n minY = min(minY, row)\r\n maxY = max(maxY, row)\r\n # print(minX, maxX, minY, maxY)\r\n for r in range(minY, maxY + 1):\r\n print(A[r][minX:maxX + 1])\r\n", "MAXN = 55\r\n\r\nn, m = map(int, input().split())\r\ns = [input() for _ in range(n)]\r\n\r\nminrow = MAXN\r\nmaxrow = -1\r\nmincolumn = MAXN\r\nmaxcolumn = -1\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j] == '.':\r\n continue\r\n minrow = min(minrow, i)\r\n mincolumn = min(mincolumn, j)\r\n maxrow = max(maxrow, i)\r\n maxcolumn = max(maxcolumn, j)\r\n\r\nfor i in range(minrow, maxrow + 1):\r\n for j in range(mincolumn, maxcolumn + 1):\r\n print(s[i][j], end=\"\")\r\n print()\r\n", "n,m = map(int, input().split())\r\nletter = []\r\nl_uk = 0\r\nind = -1\r\nr_uk = m\r\nfor i in range(n):\r\n\tletter.append(input())\r\n\tif i - ind == 1:\r\n\t\tif letter[i] == m'.':\r\n\t\t\tind = i\r\n\tif i == 0 or l_uk == -1:\r\n\t\tl_uk = letter[i].find('')\r\n\t\tr_uk = letter[i].rfind('')\r\n\telse:\r\n\t\tif letter[i].find('') < l_uk and letter[i].find('') != -1: l_uk = letter[i].find('')\r\n\t\tif letter[i].rfind('') > r_uk and letter[i].rfind('') != -1: r_uk = letter[i].rfind('')\r\nwhile letter[0]==m'.': del letter[0]\r\nwhile letter[-1]==m'.': del letter[-1]\r\nfor i in letter: print(i[l_uk:r_uk+1])", "def input_matrix(n):\r\n matrix = []\r\n for i in range(n):\r\n matrix.append(input())\r\n return matrix\r\n\r\ndef clear(a):\r\n i = 0\r\n while \"\" not in a[i]:\r\n i += 1\r\n j = len(a)-1\r\n while \"\" not in a[j]:\r\n j -= 1\r\n return a[i:j+1]\r\n\r\nn, m = map(int, input().split())\r\na = clear(input_matrix(n))\r\n\r\nleft = m-1\r\nright = 0\r\nfor x in a:\r\n if \"\" in x:\r\n left = min(left, x.find(\"\"))\r\n right = max(right, x.rfind(\"\"))\r\n \r\nfor x in a:\r\n print(x[left:right+1], sep=\"\")\r\n ", "n, m = map(int, input().split())\nA = [input() for _ in [0] n]\na = b = 10 ** 2\nc = d = -1\nfor y in range(n):\n for x in range(m):\n if A[y][x] == '':\n a = min(a, y)\n b = min(b, x)\n c = max(c, y)\n d = max(d, x)\nprint([x[b:d + 1] for x in A[a:c + 1]], sep='\\n')\n", "n, m = map(int, input().split())\nmat = [list(input().strip()) for i in range(n)]\nleft = -1\n\ntmat = list(zip(mat))\n\n\nfor i in range(m):\n if '' in tmat[i]:\n left = i\n break\nfor i in range(m - 1, -1, -1):\n if '' in tmat[i]:\n right = i\n break\nfor i in range(n):\n if '' in mat[i]:\n top = i\n break\nfor i in range(n - 1, -1, -1):\n if '' in mat[i]:\n bottom = i\n break\n\nfor i in range(top, bottom + 1):\n ch = ''\n for j in range(left, right + 1):\n ch += mat[i][j]\n print(ch)\n", "def find_the_row_from_top(l):\r\n for i in range(len(l)):\r\n for j in range(len(l[i])):\r\n if l[i][j] == \"\":\r\n return i\r\n\r\n\r\ndef find_the_row_from_bottom(l):\r\n for k in range(len(l)):\r\n i = len(l) - 1 - k\r\n for j in range(len(l[i])):\r\n if l[i][j] == \"\":\r\n return i\r\n\r\ndef find_the_column_from_right(l):\r\n for i in range(len(l[0])):\r\n for j in range(len(l)):\r\n if l[j][i] == \"\":\r\n return i\r\n\r\ndef find_the_column_from_left(l):\r\n for i in range(len(l[0])):\r\n k = len(l[0]) - 1 - i\r\n for j in range(len(l)):\r\n if l[j][k] == \"\":\r\n return k\r\n\r\n\r\n\r\ndef main_function():\r\n input_list = [input() for i in range([int(i) for i in input().split(\" \")][0])]\r\n start_i = find_the_row_from_top(input_list)\r\n end_i = find_the_row_from_bottom(input_list)\r\n end_j = find_the_column_from_left(input_list)\r\n start_j = find_the_column_from_right(input_list)\r\n output_list = []\r\n for i in range(start_i, end_i + 1):\r\n output_list.append(input_list[i][start_j:end_j + 1])\r\n return \"\\n\".join(output_list)\r\n\r\n\r\n\r\nprint(main_function())\r\n", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n m, n = map(int, inp[0].split())\r\n s = inp[1:]\r\n x, y = set(), set()\r\n for i in range(m):\r\n for j in range(n):\r\n if s[i][j] == '':\r\n x.add(i); y.add(j)\r\n out = []\r\n for i in range(min(x), max(x)+1):\r\n out.append(s[i][min(y):max(y)+1])\r\n return out\r\n \r\nprint(main(), sep='\\n')\r\n", "import sys\r\n\r\ninput = list(map(int, sys.stdin.readline().split()))\r\n\r\nrow_len = input[0]\r\ncol_len = input[1]\r\n\r\nrows = []\r\nrow_begin = sys.maxsize\r\nrow_end = 0\r\ncol_begin = sys.maxsize\r\ncol_end = 0\r\n\r\nfor i in range(row_len):\r\n rows.append(list(sys.stdin.readline().strip()))\r\n\r\nfor i in range(row_len):\r\n row = rows[i]\r\n for j in range(len(row)):\r\n if row[j] == '':\r\n row_begin = min(row_begin, i)\r\n row_end = max(row_end, i)\r\n col_begin = min(col_begin, j)\r\n col_end = max(col_end, j)\r\n\r\nfor i in range(row_begin, row_end + 1):\r\n for j in range(col_begin, col_end + 1):\r\n print(rows[i][j], end='')\r\n print('')", "n,m = [int(x) for x in input().split()]\r\n\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(input())\r\n\r\nleft = m\r\ntop = n\r\nright = 0\r\nbottom = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if matrix[i][j] == '':\r\n if j < left:\r\n left = j\r\n if j > right:\r\n right = j\r\n if i < top:\r\n top = i\r\n if i > bottom:\r\n bottom = i\r\n\r\nfor i in range(top, bottom + 1):\r\n for j in range(left, right + 1):\r\n print(matrix[i][j], end=\"\")\r\n print(end=\"\\n\")\r\n", "a, q = map(int, input().split(' '))\r\ns = []\r\nd = []\r\ne = []\r\nfor i in range(a):\r\n w, = input()\r\n e.append(w)\r\n if '' in w:\r\n for j in range(q):\r\n if w[j] == '':\r\n s.append(i)\r\n d.append(j)\r\nfor i in range(min(s), max(s) + 1):\r\n f = ''\r\n for j in range(min(d), max(d) + 1):\r\n f += str(e[i][j])\r\n print(f)\r\n", "n,m=[int(x) for x in input().split()]\r\na,hmin,hmax,lmin,lmax=[],51,-1,51,-1\r\nfor i in range(n):\r\n s=input()\r\n a.append(s)\r\n if s.count('')>0:\r\n hmin=min(i,hmin)\r\n hmax=max(i,hmax)\r\n for j in range(m):\r\n if s[j]=='':\r\n lmin=min(j,lmin)\r\n lmax=max(j,lmax)\r\nfor i in range(hmin,hmax+1):\r\n print(a[i][lmin:lmax+1])", "n, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\nup, down, left, right = 0, n - 1, 0, m - 1\r\nfor i in range(n):\r\n if '' in a[i]:\r\n up = i\r\n break\r\nfor i in range(n - 1, -1, -1):\r\n if '' in a[i]:\r\n down = i\r\n break\r\nfor i in range(m):\r\n if '' in [a[j][i] for j in range(n)]:\r\n left = i\r\n break\r\nfor i in range(m - 1, -1, -1):\r\n if '' in [a[j][i] for j in range(n)]:\r\n right = i\r\n break\r\nfor i in range(up, down + 1):\r\n print(a[i][left:right + 1])\r\n", "n,m = map(int, input().split())\r\nb = []\r\nfor _ in range(n):\r\n b.append(input())\r\n#rbegin, rend, cbegin, cend = 1, 5, 2, 4\r\nrbegin, rend, cbegin, cend = n, 0, m, 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[i][j] == '':\r\n rbegin = min(rbegin, i)\r\n rend = max(rend, i)\r\n cbegin = min(cbegin, j)\r\n cend = max(cend, j)\r\n\r\nfor i in range(rbegin, rend+1):\r\n print(b[i][cbegin:cend+1])", "n, m = map(int, input().split())\na = []\nleft = m\nright = m\nstar = -1\nfor i in range(n):\n row = input()\n if row == \".\" m:\n if star == -1:\n continue\n else:\n star = len(a)\n j = 0\n while j < m and row[j] == '.':\n j += 1\n left = min(left, j)\n j = 0\n while j < m and row[-j - 1] == '.':\n j += 1\n right = min(right, j)\n a.append(row)\nfor row in a[:star + 1]:\n print(row[left: m - right])", "from sys import stdin, stdout\r\n\r\n[n, m] = [int(x) for x in stdin.readline().split()]\r\nf = []\r\nminx, miny, maxx, maxy = n - 1, m - 1, 0, 0\r\n\r\nfor i in range(n):\r\n f.append(stdin.readline().strip())\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if f[i][j] == '':\r\n minx = min(minx, i)\r\n miny = min(miny, j)\r\n maxx = max(maxx, i)\r\n maxy = max(maxy, j)\r\nfor i in range(minx, maxx + 1):\r\n stdout.write(f[i][miny : maxy + 1] + '\\n')", "n = int(input().split()[0])\r\nk = []\r\nl = 50\r\nr = 0\r\n\r\nfor i in range(n):\r\n s = input()\r\n k.append(s)\r\n tl = s.find('')\r\n tr = s.rfind('')\r\n if tl < l and tl != -1:\r\n l = tl\r\n if tr > r and tr != -1:\r\n r = tr\r\n\r\nw = 0\r\nh = n\r\nfor i in k:\r\n if i.find('') == -1:\r\n w += 1\r\n else:\r\n break\r\nfor i in range(n - 1, -1, -1):\r\n if k[i].find('') == -1:\r\n h -= 1\r\n else:\r\n break\r\n\r\nfor i in range(w, h):\r\n print(k[i][l:r + 1])", "n,m = [int(x) for x in input().split()]\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n\r\nwhile True:\r\n if len(set(a[0]))==1 and a[0][0] =='.':\r\n a = a[1:]\r\n else:\r\n break\r\nwhile True:\r\n if len(set(a[-1]))==1 and a[-1][0] =='.':\r\n a = a[:-1]\r\n else:\r\n break\r\nwhile True:\r\n if len(set([x[0] for x in a]))==1 and a[0][0]=='.':\r\n a = [x[1:] for x in a]\r\n else:\r\n break\r\nwhile True:\r\n if len(set([x[-1] for x in a]))==1 and a[0][-1]=='.':\r\n a = [x[:-1] for x in a]\r\n else:\r\n break\r\n \r\nfor i in a:\r\n print(i)\r\n", "for ctr in range(1):\r\n r,c=map(int,input().split())\r\n m=[input().strip() for i in range(r)]\r\n s,e=[],[]\r\n for i in m:\r\n if '' in i:\r\n s.append(i.index(''))\r\n e.append(c-i[::-1].index(''))\r\n for i in range(r):\r\n if '' in m[i]:\r\n st=i\r\n break\r\n for i in range(r-1,-1,-1):\r\n if '' in m[i]:\r\n end=i\r\n break\r\n x=min(s)\r\n y=max(e)\r\n for i in range(st,end+1):\r\n print(m[i][x:y])\r\n \r\n \r\n", "t=1\r\n#t = int(input())\r\nfor i in range(t):\r\n #n = int(input())\r\n arr = input()\r\n arr = arr.split()\r\n a = [int(x) for x in arr] #; print(a)\r\n s = []\r\n for j in range(a[0]):\r\n s.append(input())\r\n while s[0].count('') == 0:\r\n s = s[1:]\r\n while s[-1].count('') == 0:\r\n s = s[:len(s)-1]\r\n f = True\r\n while f:\r\n for d in range(len(s)):\r\n if s[d][0] == '':\r\n f = False\r\n if f:\r\n for d in range(len(s)):\r\n s[d] = s[d][1:]\r\n f = True\r\n while f:\r\n for d in range(len(s)):\r\n if s[d][-1] == '':\r\n f = False\r\n if f:\r\n for d in range(len(s)):\r\n s[d] = s[d][:len(s[d])-1]\r\n\r\n for j in range(len(s)):\r\n print(s[j])", "n,m=map(int,input().split())\r\nMAP=[list(input().strip()) for i in range(n)]\r\n\r\nwhile MAP[-1]==[\".\"]len(MAP[-1]):\r\n MAP.pop()\r\n\r\nwhile MAP[0]==[\".\"]len(MAP[-1]):\r\n MAP.pop(0)\r\n\r\nMAP2=[[\"\"]len(MAP) for i in range(len(MAP[0]))]\r\n\r\nfor i in range(len(MAP)):\r\n for j in range(len(MAP[0])):\r\n MAP2[j][i]=MAP[i][j]\r\n\r\nwhile MAP2[-1]==[\".\"]len(MAP2[-1]):\r\n MAP2.pop()\r\n\r\nwhile MAP2[0]==[\".\"]len(MAP2[-1]):\r\n MAP2.pop(0)\r\n\r\nMAP=MAP2\r\n\r\n\r\nMAP2=[[\"\"]len(MAP) for i in range(len(MAP[0]))]\r\n\r\nfor i in range(len(MAP)):\r\n for j in range(len(MAP[0])):\r\n MAP2[j][i]=MAP[i][j]\r\n\r\nfor i in range(len(MAP2)):\r\n print(\"\".join(MAP2[i]))\r\n\r\n", "def main():\r\n [n, m] = list(map(int, input().split()))\r\n a = []\r\n for _ in range(n):\r\n a.append(list(input()))\r\n\r\n top = 12345\r\n bottom = -12345\r\n left = 12345\r\n right = -12345\r\n for i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '':\r\n top = min(top, i)\r\n right = max(right, j)\r\n bottom = max(bottom, i)\r\n left = min(left, j)\r\n\r\n for i in range(top, bottom + 1):\r\n for j in range(left, right + 1):\r\n print(a[i][j], end = '')\r\n print()\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nl=[]\r\nlr=[]\r\nlr2=[]\r\nlc=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\tl.append(s)\r\n\tif \"\" in s:\r\n\t\tlr.append(s.index(\"\"))\r\n\t\tlr2.append(s.rindex(\"\"))\r\n\t\tlc.append(i)\r\n\r\nfor i in range(min(lc),max(lc)+1):\r\n\tprint(l[i][min(lr):max(lr2)+1])", "I = input().split()\r\nl = int(I[0])\r\nw = int(I[1])\r\n\r\ndata = []\r\nfor i in range(l):\r\n row = list(input())\r\n data.append(row)\r\n\r\nspecial_coordinates = []\r\nfor i in range(l):\r\n for j in range(w):\r\n if data[i][j] == \"\":\r\n x = j\r\n y = i\r\n special_coordinates.append((x, y))\r\n\r\nxmin = w - 1\r\nxmax = 0\r\nymin = l - 1\r\nymax = 0\r\n\r\nfor i in special_coordinates:\r\n x = i[0]\r\n y = i[1]\r\n\r\n if x > xmax:\r\n xmax = x\r\n if x < xmin:\r\n xmin = x\r\n if y > ymax:\r\n ymax = y\r\n if y < ymin:\r\n ymin = y\r\n\r\nnew_data1 = []\r\nfor i in range(ymin, ymax + 1):\r\n a = []\r\n for j in range(xmin, xmax + 1):\r\n a.append(data[i][j])\r\n new_data1.append(a)\r\n\r\nnew_data2 = []\r\nfor i in new_data1:\r\n s = \"\"\r\n for j in i:\r\n s += j\r\n new_data2.append(s)\r\n\r\nfinal_data = \"\"\r\nfor i in new_data2:\r\n final_data += i + \"\\n\"\r\n\r\noutput = final_data[:-1]\r\nprint(output)", "# https://codeforces.com/problemset/problem/14/A\r\n\r\ndef func_sol(raw_data):\r\n data = raw_data.split('\\n')\r\n n, m = map(int, data[0].split(' '))\r\n a = data[1:-1]\r\n\r\n x1, y1 = None, None\r\n for i in range(n):\r\n for j in range(m):\r\n if a[i][j] != '.':\r\n x1, y1 = i, j\r\n break\r\n if x1 is not None:\r\n break\r\n\r\n x2, y2 = None, None\r\n for j in range(m):\r\n for i in range(n):\r\n if a[i][j] != '.':\r\n x2, y2 = i, j\r\n break\r\n if x2 is not None:\r\n break\r\n\r\n tlx, tly = min(x1, x2), min(y1, y2)\r\n\r\n x1, y1 = None, None\r\n for i in range(n - 1, -1, -1):\r\n for j in range(m - 1, -1, -1):\r\n if a[i][j] != '.':\r\n x1, y1 = i, j\r\n break\r\n if x1 is not None:\r\n break\r\n\r\n x2, y2 = None, None\r\n for j in range(m - 1, -1, -1):\r\n for i in range(n - 1, -1, -1):\r\n if a[i][j] != '.':\r\n x2, y2 = i, j\r\n break\r\n if x2 is not None:\r\n break\r\n\r\n brx, bry = max(x1, x2), max(y1, y2)\r\n\r\n s = [a[i][tly:bry + 1] for i in range(tlx, brx + 1)]\r\n\r\n return '\\n'.join(s) + '\\n'\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read()))\r\n\r\n\r\nmain()\r\n", "# your code here\r\nn, m = [int(x) for x in input().split()]\r\na = [input() for _ in range(n)]\r\n\r\nwhile all(row[0] == '.' for row in a):\r\n a = [row[1:] for row in a]\r\n\r\nwhile all(row[-1] == '.' for row in a):\r\n a = [row[:-1] for row in a]\r\n\r\nwhile not a[0].strip('.'):\r\n a = a[1:]\r\n\r\nwhile not a[-1].strip('.'):\r\n a = a[:-1]\r\n\r\nprint('\\n'.join(a))\r\n", "n, m = map(int, input().split())\r\nh1, h2, w1, w2, lst = -1, -1, -1, -1, []\r\nfor x in range(n): lst.append(input())\r\nfor i in range(m):\r\n for j in range(n):\r\n if lst[j][i] == '':\r\n w1 = i\r\n break\r\n if w1 != -1: break\r\nfor i in range(m - 1, -1, -1):\r\n for j in range(n):\r\n if lst[j][i] == '':\r\n w2 = i + 1\r\n break\r\n if w2 != -1: break\r\nfor i in range(n):\r\n for j in range(m):\r\n if lst[i][j] == '':\r\n h1 = i\r\n break\r\n if h1 != -1: break\r\nfor i in range(n - 1, -1, -1):\r\n for j in range(m):\r\n if lst[i][j] == '':\r\n h2 = i + 1\r\n break\r\n if h2 != -1: break\r\nfor x in range(h1, h2): print(lst[x][w1:w2])", "n,m=map(int,input().split())\r\nb=[]\r\nd=[]\r\nq=[]\r\np=[]\r\nw=[]\r\npo=[]\r\nfor i in range(n):\r\n a=input()\r\n b.append(a)\r\nfor j in range(n):\r\n for k in range(m):\r\n if b[j][k]=='':\r\n d+=[k]\r\n break\r\nt=min(d)\r\nfor l in range(n):\r\n for e in range(m):\r\n if b[l][::-1][e]=='':\r\n q+=[m-e]\r\n break\r\nx=max(q)\r\nfor u in range(n):\r\n p+=[b[u][t:x]]\r\nfor qw in range(n):\r\n if '' in b[qw]:\r\n w+=[qw]\r\nfor qwe in range(min(w),max(w)+1):\r\n po+=[p[qwe]]\r\nfor poi in po:\r\n print(poi)", "n,m=map(int,input().split())\narr=[]\narr1=[]\nfor i in range(0,n):\n arr.append(input())\nfor i in range(0,n):\n for j in range(0,m):\n if arr[i][j]=='':\n arr1.append((i,j))\nminx=10000\nmaxx=-1\nminy=10000\nmaxy=-1\nfor i in range(0,len(arr1)):\n if minx>arr1[i][0]:\n minx=arr1[i][0]\n if maxx<arr1[i][0]:\n maxx=arr1[i][0]\n if miny>arr1[i][1]:\n miny=arr1[i][1]\n if maxy<arr1[i][1]:\n maxy=arr1[i][1]\nfor i in range(minx,maxx+1):\n for j in range(miny,maxy+1):\n if j!=maxy:\n print(arr[i][j],end=\"\")\n else:\n print(arr[i][j])\n# 15 3\n# ...\n# ...\n# ...\n# .\n# ...\n# ...\n# ..\n# ...\n# ..\n# ..\n# ..\n# ..\n# ..\n# ...\n# ...", "import sys\r\ninput = lambda:sys.stdin.readline()\r\n\r\ndef solve(r,c,a):\r\n li,ri = [],[]\r\n rm,rmx,cm,cmx = float(\"inf\"),float(\"-inf\"),float(\"inf\"),float(\"-inf\")\r\n for i in range(r):\r\n for j in range(c):\r\n if a[i][j] == \"\":\r\n rm,cm = min(rm,i),min(cm,j)\r\n rmx,cmx = max(rmx,i),max(cmx,j)\r\n li = [rm,cm]\r\n ri = [rmx,cmx]\r\n\r\n\r\n flag = 1\r\n for i in range(rmx+1):\r\n lis = a[i]\r\n if i <= ri[0] and not flag:\r\n l = lis[li[1]:ri[1]+1]\r\n print(l,sep='') \r\n if \"\" in lis and flag:\r\n flag = 0\r\n l = lis[li[1]:ri[1]+1]\r\n print(l,sep='')\r\n\r\n# for _ in range(int(input())):\r\nr,c = map(int,input().split())\r\na = []\r\nfor i in range(r):\r\n s = str(input())\r\n a.append(list(s)[:-1])\r\nsolve(r,c,a)", "n, m = map(int, input().split())\r\ngrid = [input() for _ in range(n)]\r\ntop, left = n, m\r\nbottom, right = 0, 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '':\r\n top = min(top, i)\r\n left = min(left, j)\r\n bottom = max(bottom, i)\r\n right = max(right, j)\r\nwidth, height = right - left + 1, bottom - top + 1\r\nfor i in range(top, bottom + 1):\r\n print(grid[i][left:left + width])\r\n", "a,b = map(int,input().split())\r\nd = []\r\nz = 0\r\nfor i in range(a):\r\n s = input()\r\n if z == 1:\r\n d.append(s)\r\n if \"\" in s and z == 0: \r\n d.append(s)\r\n z = 1\r\nn = d[::-1]\r\nfor i in range(len(d)):\r\n if \"\" in n[i]:\r\n c = n[i:]\r\n break\r\nd = c[::-1]\r\nd1 = 0\r\nd2 = 1000\r\nfor i in range(len(d)):\r\n if \"\" in d[i]:\r\n if d[i].rfind(\"\") > d1:\r\n d1 = d[i].rfind(\"\")\r\n if d[i].find(\"\") < d2:\r\n d2 = d[i].find(\"\")\r\nfor i in range(len(d)):\r\n print(d[i][d2:d1+1])", "r,c = map(int,input().split())\r\nli=[]\r\nfor i in range(r):\r\n li.append(input())\r\nrmax = 0\r\nrmin = r\r\ncmax = 0\r\ncmin = c\r\nfor i in range(r):\r\n for j in range(c):\r\n if li[i][j]=='':\r\n if rmin >= i:\r\n rmin = i\r\n if cmin >= j:\r\n cmin = j\r\n\r\n if rmax <= i:\r\n rmax = i\r\n if cmax <= j:\r\n cmax = j\r\n\r\nfor i in range(rmin,rmax+1):\r\n for j in range(cmin,cmax+1):\r\n print(li[i][j],end='')\r\n print()\r\n ", "from decimal import \r\nt, _ = map(int, input().split())\r\ns = []\r\nmx = -99999\r\nfmx = -999999\r\nfmn = 999999\r\nfor i in range(t):\r\n n = input()\r\n s.append(n)\r\n if fmx < n.rfind(''):\r\n fmx = n.rfind('')\r\n if (fmn > n.find('')) and n.find('') != -1:\r\n fmn = n.find('')\r\n\r\n\r\nm = []\r\nfor i in range(len(s)):\r\n if s[i].count('') > 0:\r\n t = i\r\n break\r\nt2 = 0\r\nfor i in range(len(s)-1, 0, -1):\r\n if s[i].count('') > 0:\r\n t2 = i\r\n break\r\nv = []\r\nfor i in range(t, t2+1):\r\n v.append(s[i])\r\n\r\nfor i in v:\r\n print(i[fmn:fmx+1])\r\n", "n, m = [int(n) for n in input().split()]\r\n\r\npaper = []\r\ncount_ = 0\r\nmin_x, min_y, max_x, max_y = m, n, 0, 0\r\n# ввод данных с листка о заштрихованных клетках рисунка\r\nfor i in range(n):\r\n str_ = input().strip()\r\n paper.append(str_)\r\n cur_min_x = str_.find('')\r\n cur_max_x = str_.rfind('')\r\n if cur_min_x > -1:\r\n min_x = min(min_x, cur_min_x)\r\n if min_y == n:\r\n min_y = i\r\n if cur_max_x > -1:\r\n max_x = max(max_x, cur_max_x)\r\n max_y = i\r\nfor i in range(min_y, max_y + 1):\r\n print(paper[i][min_x : max_x + 1])", "n,m = map(int,input().split())\r\nl = []\r\n\r\nfor i in range(n):\r\n picture = input()\r\n l.append(picture)\r\nlmin = lmax = 0\r\nfor i in range(n):\r\n if l[i] != '.'m:\r\n lmin = i\r\n break\r\n\r\nfor i in range(n):\r\n if l[-i-1] != '.'m:\r\n lmax = n-1-i\r\n break\r\n\r\n\r\nminimum = m-1\r\nmaximum = -m #准备切片\r\nfor i in range(len(l)):\r\n for j in range(m):\r\n if l[i][j] == '' and j < minimum:\r\n minimum = j\r\n break\r\n\r\nfor i in range(len(l)):\r\n for j in range(1,m+1):\r\n if l[i][-j] == '' and -j > maximum:\r\n maximum = -j\r\n break\r\n\r\nfor k in l[lmin:lmax+1]:\r\n print(k[minimum:m+maximum+1])", "n,m = list(map(int,input().split()))\r\na = []\r\nminx = 100\r\nmaxx = -1\r\nminy = 100\r\nmaxy = -1\r\nfor i in range(n):\r\n b = input()\r\n index = b.find('')\r\n index1 = m-1-b[::-1] .find('')\r\n a.append(b)\r\n if index!=-1:\r\n maxy = i\r\n if miny>i:\r\n miny = i\r\n\r\n if minx>index:\r\n minx = index\r\n if index1>maxx:\r\n maxx = index1\r\nfor i in range(miny,maxy+1,1):\r\n print((a[i])[minx:maxx+1])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ns = [list(input().rstrip()) for _ in range(n)]\r\nok = 0\r\nfor i in range(n):\r\n si = s[i]\r\n for j in range(m):\r\n if si[j] == \"\":\r\n lx = i\r\n ok = 1\r\n break\r\n if ok:\r\n break\r\nok = 0\r\nfor i in range(n - 1, -1, -1):\r\n si = s[i]\r\n for j in range(m):\r\n if si[j] == \"\":\r\n rx = i + 1\r\n ok = 1\r\n break\r\n if ok:\r\n break\r\nok = 0\r\nfor i in range(m):\r\n for j in range(n):\r\n if s[j][i] == \"\":\r\n ly = i\r\n ok = 1\r\n break\r\n if ok:\r\n break\r\nok = 0\r\nfor i in range(m - 1, -1, -1):\r\n for j in range(n):\r\n if s[j][i] == \"\":\r\n ry = i + 1\r\n ok = 1\r\n break\r\n if ok:\r\n break\r\nans = [[s[i][j] for j in range(ly, ry)] for i in range(lx, rx)]\r\nfor i in range(len(ans)):\r\n ans[i] = \"\".join(ans[i])\r\nprint(\"\\n\".join(ans))", "x,y = map(int,input().split())\r\ninput_list=[]\r\nx_min=x+1\r\nx_max=-1\r\ny_min = y+1\r\ny_max = -1\r\nfor i in range(x):\r\n input_list.append(input())\r\n if \"\" in input_list[i]:\r\n if x_min>i:\r\n x_min=i\r\n if x_max<i:\r\n x_max=i\r\n for j in range(y):\r\n if input_list[i][j]=='':\r\n if y_min>j:\r\n y_min=j\r\n if y_max<j:\r\n y_max=j\r\nanswer=[]\r\nif x_max!=-1:\r\n for i in range(x_max-x_min+1):\r\n answer.append([input_list[x_min+i][y_min:y_max+1]])\r\nfor i in answer:\r\n print(i)\r\n", "n, m = map(int, input().split())\n\nmasterpiece = []\nleftmost = m\nrightmost = 0\nuppermost = n\nbottommost = 0\n\ncounter = 0\nfor _ in range(n):\n line = input()\n for i in range(len(line)):\n if line[i] == \"\":\n if i < leftmost:\n leftmost = i\n if i > rightmost:\n rightmost = i\n if \"\" in line:\n if uppermost > counter:\n uppermost = counter\n if bottommost < counter:\n bottommost = counter\n counter += 1\n masterpiece.append(line)\n\nfor line in masterpiece[uppermost:bottommost+1]:\n print(\"\".join(line[leftmost:rightmost+1]))\n", "n, m = map(int, input().split())\r\n\r\nl = m + 1\r\nr = 0\r\n\r\nTF = False\r\nwords = []\r\nfor _ in range(n):\r\n word = input()\r\n if '' in word or TF:\r\n TF = True\r\n words.append(word)\r\n l_, r_ = word.find(''), word.rfind('')\r\n l, r = min(l if l_ == -1 else l_, l), max(r_, r)\r\n\r\nerr = 0\r\nfor i in range(n):\r\n if '' in words[-(i + 1 - err)]:\r\n break\r\n else:\r\n del words[-(i + 1 - err)]\r\n err += 1\r\n\r\nprint([word[l:r + 1] for word in words], sep='\\n')\r\n", "n,m=map(int,input().split())\r\nA=[input()for _ in[0]n]\r\na=b=1E2;c=d=-1\r\nfor y in range(n):\r\n for x in range(m):\r\n if A[y][x]=='':\r\n a=min(a,y);b=min(b,x)\r\n c=max(c,y);d=max(d,x)\r\nprint([x[b:d+1]for x in A[a:c+1]],sep='\\n')", "n,m=[int(i) for i in input().split()]\r\nmat=['']n\r\nfor i in range(n):\r\n\tmat[i]=list(input())\r\ndef fbb(mat):\r\n\tminx=100000\r\n\tminy=100000\r\n\tmaxx=-100000\r\n\tmaxy=-100000\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tif mat[i][j]=='':\r\n\t\t\t\tminx=min(minx,i)\r\n\t\t\t\tminy=min(miny,j)\r\n\t\t\t\tmaxx=max(maxx,i)\r\n\t\t\t\tmaxy=max(maxy,j)\r\n\treturn minx,miny,maxx,maxy\r\nminmax=fbb(mat)\r\nminx,miny,maxx,maxy=minmax\r\nfor i in range(minx,maxx+1):\r\n\tfor j in range(miny,maxy+1):\r\n\t\tprint(mat[i][j],end='')\r\n\tprint()", "n, m = map(int, input().split())\r\ngrid = [list(input()) for _ in range(n)]\r\n\r\nleft = m\r\nright = 0\r\ntop = n\r\nbottom = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '':\r\n left = min(left, j)\r\n right = max(right, j)\r\n top = min(top, i)\r\n bottom = max(bottom, i)\r\n\r\nfor i in range(top, bottom + 1):\r\n for j in range(left, right + 1):\r\n print(grid[i][j], end='')\r\n print()\r\n", "n, m = map(int, input().split())\r\na = [[str(j) for j in input()] for i in range(n)]\r\np = []\r\nl = []\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif a[i][j] == \"\":\r\n\t\t\tp.append(i)\r\n\t\t\tbreak\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif a[i][j] == \"\":\r\n\t\t\tl.append(j)\r\nma = 0\r\nmi = m\r\nfor i in range(len(l)):\r\n\tif l[i] > ma:\r\n\t\tma = l[i]\r\n\tif l[i] < mi:\r\n\t\tmi = l[i]\r\nq = p[0]\r\nw = p[-1]\r\nfor i in range(q, w+1):\r\n\tfor j in range(mi, ma+1):\r\n\t\tprint(a[i][j], end = '')\r\n\tprint()\r\n", "n,m=map(int,input().split())\r\nma=[input()[:m] for t in range(n)]\r\nr=[]\r\nc=[]\r\nfor t1 in range(n):\r\n for t2 in range(m):\r\n if ma[t1][t2]=='':\r\n r.append(t1)\r\n c.append(t2)\r\nmir=min(r)\r\nmic=min(c)\r\nmar=max(r)\r\nmac=max(c)\r\nfor t1 in range(mir,mar+1):\r\n for t2 in range(mic,mac+1):\r\n print(ma[t1][t2],end='')\r\n print()\r\n", "\r\nn, m = map(int, input().split())\r\n\r\nb = []\r\nfor i in range(n):\r\n b.append(input())\r\n\r\nx = []\r\nfor c in zip(b):\r\n for r in range(n):\r\n if c[r] == '':\r\n x.append(r)\r\n\r\ny = []\r\nfor r in b:\r\n for c in range(m):\r\n if r[c] == '':\r\n y.append(c)\r\n\r\nfor r in b[min(x) : max(x) + 1]:\r\n print(''.join(r[min(y) : max(y) + 1]))", "n, m = [int(i) for i in input().split()]\r\na, x, y = [], set(), set()\r\nfor i in range(n):\r\n line = input()\r\n a.append(line)\r\n if \"\" in line:\r\n y.add(i)\r\n x.add(line.index(\"\"))\r\n x.add(line.rindex(\"\"))\r\nfor i in a[min(y): max(y) + 1]:\r\n print(i[min(x): max(x) + 1])\r\n", "n,m=[int(s) for s in input().split()]\r\na=[]\r\nup=-1\r\ndown=n\r\nleft=m\r\nright=-1\r\nfor i in range(n):\r\n s=input()\r\n a.append(s)\r\n if s.find('')!=-1:\r\n if up==-1: up=i\r\n down=i\r\n p=s.find('')\r\n if p<left:\r\n left=p\r\n p=s.rfind('')\r\n if p>right:\r\n right=p\r\nfor i in range(up,down+1):\r\n print(a[i][left:right+1])", "'''input\n15 3\n...\n...\n...\n.*\n...\n...\n..\n...\n..\n..\n..\n..\n..\n...\n...\n'''\nn, m = map(int, input().split())\na = [input() for _ in range(n)]\nf, l, t = 1000, 0, False\nfor x in range(n):\n\tif \"\" in a[x]:\n\t\tf = min(f, a[x].index(\"\"))\n\t\tl = max(l, m - 1 - a[x][::-1].index(\"\"))\nfor y in range(n):\n\tif \"\" in a[y]:\n\t\tbreak\nfor z in range(n-1, -1, -1):\n\tif \"\" in a[z]:\n\t\tbreak\na = [i[f:l+1] for i in a]\nprint(\"\\n\".join(a[y:z+1]))\n\n\n\n\n\n\n\n\n\n\n\n\n", "n, m = map(int, input().split())\n\ndata = []\nll = lc = -1\nfl, fc = n +1, m+1\n\nfor i in range(n):\n line = input()\n data.append(line)\n for id, square in enumerate(line):\n if square == \"\":\n if id < fc:\n fc = id\n if i < fl:\n fl = i\n if id > lc:\n lc = id\n if i > ll:\n ll = i\n\nfor i in range(fl,ll+1):\n print(data[i][fc:lc+1], sep='')\n\n#print(fl, ll)\n#print(fc, lc)\n \n\t \t \t \t\t \t\t \t\t\t \t\t \t\t \t", "n, m = map(int, input().split())\r\ninput_dict_raw = {}\r\nfor line_no in range(n):\r\n input_dict_raw[line_no] = input()\r\n\r\ninput_dict = {}\r\n# first_value = 0\r\nfor i in range(n):\r\n if '' in input_dict_raw[i]:\r\n input_dict[i] = input_dict_raw[i]\r\n first_value = i\r\n break\r\n\r\nlast_value = 0\r\nfor i in range(n-1,-1,-1):\r\n if '' in input_dict_raw[i]:\r\n input_dict[i] = input_dict_raw[i]\r\n last_value = i\r\n break\r\n\r\nfor i in range(first_value+1, last_value):\r\n input_dict[i] = input_dict_raw[i]\r\n \r\nminmax_list = []\r\nfor value in input_dict.values(): # protek row\r\n for i in range(len(value)): # protek index of row\r\n if value[i] == '':\r\n minmax_list.append(i)\r\n\r\n\r\nmin_val = min(minmax_list)\r\nmax_val = max(minmax_list)\r\n\r\n\r\nfor i in range(n):\r\n if first_value<=i<=last_value:\r\n print(input_dict[i][min_val:max_val+1])\r\n\r\n \r\n \r\n ", "h, w = map(int, input().split())\r\npyoko = [False] w\r\nptate = [False] * h\r\nmaze = []\r\nfor i in range(h):\r\n s = input()\r\n maze.append(s)\r\n if s.count(\"\") != 0:\r\n ptate[i] = True\r\n for j in range(w):\r\n if s[j] == \"\":\r\n pyoko[j] = True\r\ns\r\nl, r = 0, w-1\r\nwhile pyoko[l] != True:\r\n l += 1\r\nwhile pyoko[r] != True:\r\n r -= 1\r\nt,b = 0, h-1\r\nwhile ptate[t] != True:\r\n t += 1\r\nwhile ptate[b] != True:\r\n b -= 1\r\n\r\nfor i in range(t, b+1):\r\n print(maze[i][l:r+1])", "n, m = list(map(int, input().split(' ')))\r\na = [input() for i in range(n)]\r\ni1, i2, j1, j2 = n - 1, 0, m - 1, 0\r\nfor i in range(n):\r\n if a[i].find('') != -1:\r\n i1 = min(i1, i)\r\n i2 = max(i2, i)\r\n j1 = min(j1, a[i].find(''))\r\n j2 = max(j2, a[i].rfind(''))\r\nfor i in range(i1, i2 + 1):\r\n print(a[i][j1:j2 + 1])\r\n", "n,m = map(int, input().split())\r\ndata = []\r\n\r\nfor i in range(n):\r\n data.append(list(input()))\r\n\r\nboundary = [-1,-1,-1,-1]\r\nfor i in range(n):\r\n for j in range(m):\r\n if data[i][j] == '':\r\n if boundary[0]>j or boundary[0]==-1:\r\n boundary[0] = j\r\n if boundary[1]<j or boundary[1]==-1:\r\n boundary[1] = j\r\n if boundary[2]>i or boundary[2]==-1:\r\n boundary[2] = i\r\n if boundary[3]<i or boundary[3]==-1:\r\n boundary[3] = i\r\n\r\nfor i in range(boundary[2], boundary[3]+1):\r\n for j in range(boundary[0], boundary[1]+1):\r\n print(data[i][j], end='')\r\n print()", "def main():\n n, m = map(int, input().split())\n l, xx, yy = [input() for _ in range(n)], [], []\n for y, row in enumerate(l):\n for x, c in enumerate(row):\n if c == '':\n xx.append(x)\n yy.append(y)\n lo, hi = min(xx), max(xx) + 1\n for row in l[min(yy):max(yy) + 1]:\n print(row[lo:hi])\n\n\nif __name__ == '__main__':\n main()\n", "n,m = map(int,input().split())\r\narr = []\r\nfor _ in range(n):\r\n line = input()\r\n arr.append(line)\r\na = []\r\nb = []\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == \"\":\r\n a.append(i)\r\n b.append(j)\r\n\r\nfor i in range(min(a),max(a)+1):\r\n for j in range(min(b),max(b)+1):\r\n print(arr[i][j],end = \"\")\r\n print()\r\n", "n,m=map(int,input().split()); e=[input()for p in[0]n]; a=b=1e2;c=d=-1\r\nfor y in range(n):\r\n for x in range(m):\r\n if e[y][x]=='': a=min(a,y);b=min(b,x);c=max(c,y);d=max(d,x)\r\nprint([x[b:d+1]for x in e[a:c+1]],sep='\\n')", "arr = []\r\nip1 = list(map(int, input().split()))\r\nfor i in range(ip1[0]):\r\n row = input()\r\n arr.append(row)\r\nmaxrow = maxcol = 0\r\nminrow = ip1[0]-1\r\nmincol = ip1[1]-1\r\nfor i in range(ip1[0]):\r\n for j in range(ip1[1]):\r\n if arr[i][j] == \"\":\r\n if i < minrow:\r\n minrow = i\r\n if i > maxrow:\r\n maxrow = i\r\n if j < mincol:\r\n mincol = j\r\n if j > maxcol:\r\n maxcol = j\r\nlista = \"\"\r\nc1 = minrow\r\nwhile c1 <= maxrow:\r\n c2 = mincol\r\n row = \"\"\r\n while c2 <= maxcol:\r\n row = row + arr[c1][c2]\r\n c2 += 1\r\n lista = lista + row + \"\\n\"\r\n c1 += 1\r\nprint(lista)\r\n", "n, m = map(int, input().split())\r\npicture = [input() for _ in range(n)]\r\n\r\nbbox = [n - 1, m - 1, 0, 0]\r\nfor i in range(n):\r\n for j in range(m):\r\n if picture[i][j] == '':\r\n bbox[0] = min(bbox[0], i)\r\n bbox[1] = min(bbox[1], j)\r\n bbox[2] = max(bbox[2], i)\r\n bbox[3] = max(bbox[3], j)\r\n\r\nfor i, line in enumerate(picture):\r\n if bbox[0] <= i <= bbox[2]:\r\n print(line[bbox[1]:bbox[3] + 1])\r\n", "def main():\r\n n, m = map(int, input().split())\r\n sheet = []\r\n for i in range(n):\r\n sheet.append(input())\r\n\r\n while '' not in sheet[0]:\r\n sheet.pop(0)\r\n while '' not in sheet[-1]:\r\n sheet.pop()\r\n while '' not in [row[0] for row in sheet]:\r\n sheet = [row[1:] for row in sheet]\r\n while '' not in [row[-1] for row in sheet]:\r\n sheet = [row[:-1] for row in sheet]\r\n\r\n for row in sheet:\r\n print(row)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m=map(int,input().split())\r\nt=\".\"m\r\nlast,first=n+1,-1\r\nL,R=m,-1\r\na=[]\r\nfor i in range(n):\r\n s=input()\r\n a.append(s)\r\n if s!=t:\r\n last=i;\r\n if first==-1:\r\n first=i\r\n L1=s.find(\"\")\r\n R1=s.rfind(\"\")\r\n if L1>=0:\r\n if L>L1:L=L1\r\n if R1>=0:\r\n if R<R1:R=R1\r\n\r\nfor i in range(n):\r\n if i>=first and i<=last:\r\n print(a[i][L:R+1])\r\n \r\n \r\n \r\n", "n, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\nn1, m1 = 0, 0\r\nn2, m2 = n - 1, m - 1\r\nfl = False\r\nfor i in range(n):\r\n if a[i].count(\"\") == 0 and not fl:\r\n n1 = i + 1\r\n elif a[i].count(\"\") != 0:\r\n fl = True\r\n\r\nfl = False\r\nfor i in range(n - 1, -1, -1):\r\n if a[i].count(\"\") == 0 and not fl:\r\n n2 = i - 1\r\n elif a[i].count(\"\") != 0:\r\n fl = True\r\n\r\nfl = False\r\nfor j in range(m):\r\n tmp = [a[x][j] for x in range(n)]\r\n if tmp.count(\"\") == 0 and not fl:\r\n m1 = j + 1\r\n elif tmp.count(\"\") != 0:\r\n fl = True\r\n\r\nfl = False\r\nfor j in range(m - 1, -1, -1):\r\n tmp = [a[x][j] for x in range(n)]\r\n if tmp.count(\"\") == 0 and not fl:\r\n m2 = j - 1\r\n elif tmp.count(\"\") != 0:\r\n fl = True\r\n\r\nfor i in range(n1, n2 + 1):\r\n print(a[i][m1:m2 + 1])\r\n", "n,m=[int(x) for x in input().split(\" \")]\r\ngrid=[]\r\nfor i in range(n):\r\n grid.append(input())\r\nrow1,row2,col1,col2=-1,-1,-1,-1\r\nfor i in range(n):\r\n if '' in grid[i]:\r\n row1=i\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if '' in grid[i]:\r\n row2=i;\r\n break\r\nfor i in range(m):\r\n found=False\r\n for j in range(n):\r\n if grid[j][i]=='':\r\n col1=i\r\n found=True\r\n break\r\n if found:\r\n break\r\nfor i in range(m-1,-1,-1):\r\n found=False\r\n for j in range(n):\r\n if grid[j][i]=='':\r\n col2=i\r\n found=True\r\n break\r\n if found:\r\n break\r\nfor i in range(row1,row2+1,1):\r\n for j in range(col1,col2+1,1):\r\n print(grid[i][j],end='')\r\n print()\r\n", "#for _ in range(int(input())):\r\n # n=int(input())\r\nif 1:\r\n n,m=list(map(int,input().split()))\r\n ans=[]\r\n st=[]\r\n g=[]\r\n for i in range(n):\r\n s=input()\r\n st.append(s)\r\n if '' in s:\r\n g.append(i) \r\n x=s.index('')\r\n y=s.rindex('')\r\n ans.append([x,y,i])\r\n mi=100000\r\n ma=-1\r\n for i in range(len(ans)):\r\n if mi>ans[i][0]:\r\n mi=ans[i][0]\r\n if ma<ans[i][1]:\r\n ma=ans[i][1]\r\n # print(mi,ma,ans)\r\n for i in range(min(g),max(g)+1):\r\n for j in range(mi,ma+1):\r\n print(st[i][j],end='')\r\n print()\r\n ", "n, m = tuple(map(int, input().split()))\r\n\r\npat = []\r\nindices = []\r\nfor i in range(n):\r\n pat.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if pat[i][j]==\"\":\r\n indices.append((i, j))\r\nindices_x = [i[0] for i in indices]\r\nindices_y = [i[1] for i in indices]\r\n\r\nmin_row_index, max_row_index = min(indices_x), max(indices_x)\r\nmin_col_index, max_col_index = min(indices_y), max(indices_y)\r\nfor i in range(min_row_index, max_row_index+1):\r\n print(pat[i][min_col_index:max_col_index+1])\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\na = []\r\nleft=m\r\nright=m\r\nstar=-1\r\nfor i in range(n):\r\n row = input()\r\n if row == \".\"m:\r\n if star==-1:\r\n continue\r\n else:\r\n star= len(a)\r\n j=0\r\n while j<m and row[j]==\".\":\r\n j += 1\r\n left = min(left,j)\r\n j=0\r\n while j<m and row[-j-1]==\".\":\r\n j+=1\r\n right = min(right,j)\r\n a.append(row)\r\nfor row in a[:star+1]:\r\n print(row[left:m-right])", "n,m=map(int,input().split())\r\ns=[]\r\nfor i in range(n):\r\n s.append(input())\r\nwhile s[0].count(\"\")==0:\r\n s.pop(0)\r\nwhile s[-1].count(\"\")==0:\r\n s.pop(-1)\r\n\r\nwhile not \"\" in [i[0] for i in s]:\r\n for j in range(len(s)):\r\n s[j]=s[j][1:]\r\nwhile not \"\" in [i[-1] for i in s]:\r\n for j in range(len(s)):\r\n s[j]=s[j][:-1]\r\nprint(\"\\n\".join(s))", "def solve():\r\n n, m = map(int, input().split())\r\n mat = [input() for _ in range(n)]\r\n y1 = -1\r\n y2 = -1\r\n x1 = m\r\n x2 = -1\r\n \r\n for i in range(n):\r\n if '' in mat[i]:\r\n if y1 == -1:\r\n y1 = i\r\n \r\n y2 = max(y2, i)\r\n x1 = min(x1, mat[i].find(''))\r\n x2 = max(x2, mat[i].rfind(''))\r\n \r\n for i in range(y1, y2 + 1):\r\n print(mat[i][x1:x2 + 1])\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "num_rows, num_cols = map(int, input().split())\r\npaper = [list(input()) for _ in range(num_rows)]\r\n\r\nx_min, x_max, y_min, y_max = 49, 0, 49, 0\r\n\r\nfor i in range(num_rows):\r\n for j in range(num_cols):\r\n if paper[i][j] == '':\r\n x_min, x_max, y_min, y_max = min(j, x_min), max(j, x_max), min(i, y_min), max(i, y_max)\r\n\r\nfor i in range(y_min, y_max + 1):\r\n print(''.join(paper[i][x_min:x_max + 1]))# 1698139669.4744081", "n, m = list(map(int, input().split()))\r\ngrid = []\r\n\r\niMin = n - 1\r\njMin = m - 1\r\niMax = 0\r\njMax = 0\r\n\r\nfor _ in range(n):\r\n grid.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == \"\":\r\n if i < iMin:\r\n iMin = i\r\n if i > iMax:\r\n iMax = i\r\n if j < jMin:\r\n jMin = j\r\n if j > jMax:\r\n jMax = j\r\nfor i in range(iMin, iMax + 1):\r\n print(grid[i][jMin: jMax + 1])\r\n\r\n# Struggled a lot at the beginning because\r\n# I tried to check for the max and mins\r\n# row by row instead of element by element.\r\n# Should have gone with the simplest solution\r\n# instead of trying to make it clever.\r\n", "def main():\n n, m = map(int, input().split())\n l = [input() for _ in range(n)]\n for i, row in enumerate(l):\n if '' in row:\n hi = i\n for i in range(hi, -1, -1):\n if '' in l[i]:\n lo = i\n l = l[lo:hi + 1]\n lt = list(zip(l))\n for i, row in enumerate(lt):\n if '' in row:\n hi = i\n for i in range(hi, -1, -1):\n if '' in lt[i]:\n lo = i\n hi += 1\n for row in l:\n print(row[lo:hi])\n\n\nif __name__ == '__main__':\n main()\n", "n, m = map(int, input().split())\ns = [None] n\nfor i in range(n):\n s[i] = input()\nwhile True:\n if s[0].count('') != 0:\n break\n s.pop(0)\nwhile True:\n if s[len(s)-1].count('') != 0:\n break\n s.pop()\nx = m - 1\nd = m - 1\nn = len(s)\nfor i in range(n):\n if s[i].count('') == 0:\n continue\n s[i] = s[i][::-1]\n c = s[i].index('')\n if c < d:\n d = c\n s[i] = s[i][::-1]\n c = s[i].index('')\n if c < x:\n x = c\nfor i in range(n):\n print(s[i][x:m-d])", "n, m = input().split()\nn = int(n)\nm = int(m)\n\nminI = n\nmaxI = -1\n\nminJ = m\nmaxJ = -1\n\nmatriz = []\nfor i in range(0, n):\n\tlinha = list(input())\n\tmatriz.append(linha)\n\tfor j in range(0, m):\n\t\tif (linha[j] == ''):\n\t\t\tminI = min(minI, i)\n\t\t\tmaxI = max(maxI, i)\n\t\t\tminJ = min(minJ, j)\n\t\t\tmaxJ = max(maxJ, j)\n\nfor i in range(minI, maxI + 1):\n\tfor j in range(minJ, maxJ + 1):\n\t\tprint(matriz[i][j], end='')\n\tprint()", "n, m = map(int, input().split())\r\ndc = dict()\r\nfor r in range(n): \r\n row = list(input())\r\n for c, ch in enumerate(row):\r\n dc[(r,c)] = ch\r\n\r\nminr = min(k[0] for k,v in dc.items() if v == \"\")\r\nmaxr = max(k[0] for k,v in dc.items() if v == \"\")\r\nminc = min(k[1] for k,v in dc.items() if v == \"\")\r\nmaxc = max(k[1] for k,v in dc.items() if v == \"\")\r\n\r\nfor r in range(minr, maxr+1):\r\n line = ''.join(dc[(r,c)] for c in range(minc, maxc+1))\r\n print(line)", "n,m=map(int,input().split())\r\nmat=[]\r\n\r\nfor _ in range(n):\r\n s=input()\r\n a=list(s)\r\n mat.append(a)\r\nLeft=n-1\r\nRight=0\r\nTop=m-1\r\nBottom=0\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if(mat[i][j]==''):\r\n Left=min(Left,i)\r\n Right=max(Right,i)\r\n Top=min(Top,j)\r\n Bottom=max(Bottom,j)\r\nfor i in range(Left,Right+1):\r\n for j in range(Top,Bottom+1):\r\n print(mat[i][j],end=\"\")\r\n print(end=\"\\n\")\r\n \r\n\r\n", "n,m = map(int,input().split())\r\na = []\r\nfor _ in range(n):\r\n s = input()\r\n a.append(s)\r\nmxr = -1\r\nmnr = -1\r\nmxc = -1\r\nmnc = -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '' and (mnr == -1 or j < mnr) :\r\n mnr = j\r\n if a[i][j] == '' and (mnc == -1 or i < mnc) :\r\n mnc = i\r\n if a[i][j] == '' and (mxr == -1 or j > mxr) :\r\n mxr = j\r\n if a[i][j] == '' and (mxc == -1 or i > mxc) :\r\n mxc = i\r\nfor i in range(mnc,mxc+1):\r\n s = \"\"\r\n for j in range(mnr,mxr+1):\r\n s += a[i][j]\r\n print(s)\r\n", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ndata = [input().rstrip() for _ in range(n)]\r\n\r\nr_min = r_max = c_max = -1\r\nc_min = math.inf\r\n\r\nfor i in range(n):\r\n if '' in data[i]:\r\n if r_min == -1:\r\n r_min = i\r\n r_max = i\r\n for j in range(m):\r\n if data[i][j] == '':\r\n c_min = min(c_min, j)\r\n c_max = max(c_max, j)\r\n\r\nfor i in range(r_min, r_max + 1):\r\n for j in range(c_min, c_max + 1):\r\n print(data[i][j], end='')\r\n print()", "n,m = map(int,input().split())\nstartx = m-1\nstarty = n-1\nendx = 0\nendy = 0\nsheet = []\nfor i in range(n):\n sheet.append(input())\n\nfor i in range(n):\n for j in range(m):\n if sheet[i][j] =='':\n if j < startx:\n startx = j\n if j > endx:\n endx = j\n if i < starty:\n starty = i\n if i > endy:\n endy = i\n\nfor i in range(starty,endy+1,1):\n for j in range(startx,endx+1,1):\n print(sheet[i][j],end=\"\")\n print()\n# print(startx,starty,endx,endy)", "import sys\r\ninpu = sys.stdin.buffer.readline\r\nn, m = map(int, input().split())\r\na = []\r\nfor _ in range(n):\r\n a.append(input())\r\n# print(a)\r\nstarct = []\r\nl = float('inf')\r\nr = float('-inf')\r\nfor seq in a:\r\n starct.append(seq.count(''),)\r\n# print(starct)\r\nfor i in range(len(a)):\r\n if starct[i] != 0:\r\n l = min(l,list(a[i]).index(''))\r\n r = max(r, a[i].rindex(''))\r\n\r\nf = 0\r\nfor i in range(len(starct)):\r\n if starct[i] != 0:\r\n f = i\r\n break\r\ns = 0\r\nfor i in range(len(starct)-1,-1,-1):\r\n if starct[i] != 0:\r\n s = i\r\n break\r\n\r\nfor i in range(f, s+1):\r\n print(a[i][l:r+1])\r\n\r\n# for i in range(len(a)):\r\n# if starct[i]:\r\n# if '' in a[i][l:r+1]:\r\n# print(a[i][l:r+1])", "def check(sheet, n, x):\r\n for i in range(n):\r\n if sheet[i][x] == '':\r\n return False\r\n return True\r\n\r\nn, m = map(int, input().split())\r\nsheet = [list(input()) for _ in range(n)]\r\n\r\nwhile '' not in sheet[0]:\r\n sheet.pop(0)\r\nwhile '' not in sheet[-1]:\r\n sheet.pop()\r\n\r\nn = len(sheet)\r\nwhile check(sheet, n, 0):\r\n for i in range(n):\r\n sheet[i].pop(0)\r\nwhile check(sheet, n, -1):\r\n for i in range(n):\r\n sheet[i].pop()\r\n\r\nfor i in range(n):\r\n print(\"\".join(sheet[i]))", "n, l, nl = [int(i) for i in input().split()], [], []\r\nu = d = lf = r = 0\r\n\r\nfor i in range(n[0]): l.extend([i for i in input().split()])\r\n\r\nvl, dl = [\"\".join([l[j][i] for j in range(n[0])]) for i in range(n[1])], l.copy()\r\n\r\nfor i in l:\r\n if \"\" in i:\r\n u = l.index(i)\r\n break\r\nl.reverse()\r\nfor i in l:\r\n if \"\" in i: \r\n d = l.index(i)\r\n break\r\n\r\nfor i in vl:\r\n if \"\" in i:\r\n lf = vl.index(i)\r\n break\r\nvl.reverse()\r\nfor i in vl:\r\n if \"\" in i:\r\n r = vl.index(i)\r\n break\r\n\r\nd, r = n[0]-d-1, n[1]-r-1\r\n\r\nfor i in range(u, d+1): nl.append(dl[i][lf:r+1])\r\n\r\nprint(\"\\n\".join(nl))", "n, m = map(int, input().split())\n\nt = [input() for i in range(n)]\n\n\n\ni = 0\n\nwhile not '' in t[i]: i += 1\n\nj = n - 1\n\nwhile not '' in t[j]: j -= 1\n\n\n\nt = t[i: j + 1]\n\nu = min(k.find('') for k in t if '' in k)\n\nv = m - min(k[::-1].find('') for k in t if '' in k)\n\n\n\nprint('\\n'.join(k[u: v] for k in t))", "def letter():\r\n n, m = map(int, input().split())\r\n data = [input() for _ in range(n)]\r\n min_x, max_x, min_y, max_y = n, 0, m, 0\r\n \r\n for i in range(n):\r\n for j in range(m):\r\n if data[i][j] == \"\":\r\n min_x = min(min_x, i)\r\n max_x = max(max_x, i)\r\n min_y = min(min_y, j)\r\n max_y = max(max_y, j)\r\n \r\n for i in range(min_x, max_x + 1):\r\n print(data[i][min_y:max_y + 1])\r\n \r\n \r\nletter()", "args = input().split()\r\nn, m = int(args[0]), int(args[1])\r\n\r\nx1, x2 = m, 0\r\ny1, y2 = n, 0\r\npaper = []\r\nfor i in range(n):\r\n row = input()\r\n if '' in row:\r\n y1 = min(y1, i)\r\n y2 = max(y2, i)\r\n x1 = min(x1, row.find(''))\r\n x2 = max(x2, row.rfind(''))\r\n paper.append(row)\r\n\r\nfor h in range(y1, y2+1):\r\n print(paper[h][x1:x2+1])", "# https://codeforces.com/problemset/problem/14/A\r\n\r\nn,m = map(int, input().split())\r\ntop, bottom, left, right = n, -1, m, -1\r\ndata = []\r\nfor i in range(n):\r\n r = input()\r\n data.append(r)\r\n if '' in r:\r\n top = min(top, i)\r\n bottom = max(bottom, i)\r\n left = min(left, r.find(''))\r\n right = max(right, r.rfind(''))\r\nfor i in range(top, bottom+1):\r\n print(data[i][left:right+1])", "# LUOGU_RID: 117904778\ndef find_minimal_matrix(N, M, matrix):\r\n minCol, maxCol, minRow, maxRow = float('inf'), -float('inf'), float('inf'), -float('inf')\r\n \r\n for i in range(N):\r\n for j in range(M):\r\n if matrix[i][j] == '':\r\n minCol = min(minCol, j)\r\n maxCol = max(maxCol, j)\r\n minRow = min(minRow, i)\r\n maxRow = max(maxRow, i)\r\n\r\n minimal_matrix = [['.' for _ in range(maxCol - minCol + 1)] for _ in range(maxRow - minRow + 1)]\r\n \r\n for i in range(minRow, maxRow + 1):\r\n for j in range(minCol, maxCol + 1):\r\n if matrix[i][j] == '':\r\n minimal_matrix[i - minRow][j - minCol] = ''\r\n\r\n return minimal_matrix\r\n\r\n\r\n# 读取输入\r\nN, M = map(int, input().split())\r\nmatrix = [input() for _ in range(N)]\r\n\r\n# 输出结果\r\nminimal_matrix = find_minimal_matrix(N, M, matrix)\r\nfor row in minimal_matrix:\r\n print(''.join(row))", "tmp = input().split()\r\nn = int(tmp[0])\r\nm = int(tmp[1])\r\nar = []\r\nfor i in range(n): ar.append(input())\r\na = n\r\nb = m\r\nc = -1\r\nd = -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if (ar[i][j] == ''):\r\n a = min(a,i)\r\n b = min(b,j)\r\n c = max(c,i)\r\n d = max(d,j)\r\n# print(a,b,c,d)\r\nfor i in range(a,c+1):\r\n print(ar[i][b:d+1])", "L = input().split()\r\nn, m = int(L[0]), int(L[1])\r\n\r\nmxX = 0\r\nmxY = 0\r\nmnX = n - 1\r\nmnY = m - 1\r\n\r\ns = []\r\n\r\nfor i in range(0, n):\r\n s.append(input())\r\n for j in range(0, m):\r\n if s[i][j] == '':\r\n mnX = min(mnX, i)\r\n mxX = max(mxX, i)\r\n mnY = min(mnY, j)\r\n mxY = max(mxY, j)\r\n\r\nfor i in range(mnX, mxX + 1):\r\n for j in range(mnY, mxY + 1):\r\n print(s[i][j], end='')\r\n print()", "n, m = map(int, input().split())\r\nbb = [input() for _ in range(n)]\r\na, b, c, d = n, -1, m, -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if bb[i][j] == '':\r\n a = min(a, i)\r\n b = max(b, i)\r\n c = min(c, j)\r\n d = max(d, j)\r\n# print(a, b, c, d)\r\nfor i in range(a, b+1):\r\n print(f\"{bb[i][c:d+1]}\")", "#! /usr/bin/env python3\n\nimport fractions\nimport sys\n\ndef main():\n solve()\n\n\ndef solve():\n data = sys.stdin.readlines()\n n, m, text = parse(data)\n output = calc_min_rect(n, m, text)\n for line in output:\n print(line)\n\n\ndef parse(data):\n n, m = tuple(int(s) for s in data[0].split())\n return n, m, tuple(s.rstrip() for s in data[1:])\n\n\ndef calc_min_rect(n, m, text):\n mintop, maxbot, minleft, maxright = n, -1, m, -1\n for i, line in enumerate(text):\n lpos = line.find('')\n rpos = line.rfind('')\n if lpos > -1:\n minleft = min(minleft, lpos)\n maxright = max(maxright, rpos)\n mintop = min(mintop, i)\n maxbot = max(maxbot, i)\n return (s[minleft:maxright + 1] for s in text[mintop:maxbot + 1])\n \n\nif __name__ == '__main__':\n main()\n", "x,y=input().split()\r\nx,y=int(x),int(y)\r\nm=[input() for i in range(x)]\r\nt=0\r\nwhile m[t]=='.'y:t+=1\r\nb=x\r\nwhile m[b-1]=='.'y:b-=1\r\nl=0\r\nwhile sum(i[l]=='' for i in m)==0:l+=1\r\nr=y\r\nwhile sum(i[r-1]=='' for i in m)==0:r-=1\r\nprint('\\n'.join(i[l:r] for i in m[t:b]))", "a,b=map(int,input().split())\nlistaUtil=[]\ncount=0\nwhile count != a:\n x=input()\n listaUtil.append(x)\n count+=1\n \nlistaA=[]\nlistaB=[]\n\nfor i in range(a):\n for j in range(b):\n if \"\" == listaUtil[i][j]:\n listaA.append(j)\n\n if '' in listaUtil[i]:\n listaB.append(i)\n \n\nx1,x2,y1,y2=min(listaA),max(listaA),min(listaB),max(listaB)\n\nfor i in range(a):\n if i <= y2 and i >= y1:\n for j in range(x1,x2+1):\n print(listaUtil[i][j],end=\"\")\n print()\n \n\n \t\t \t\t\t \t\t \t\t \t \t\t \t \t \t\t", "[n, m] = list(map(int, input().split()))\r\n\r\nnLines = n\r\nlines = []\r\n\r\nwhile nLines:\r\n line = list(input())\r\n lines.append(line)\r\n nLines -= 1\r\n\r\n\r\n\r\ntopEmpty = -1\r\nfor i in range(n):\r\n topEmpty += 1\r\n\r\n isEnd = False\r\n for char in lines[i]:\r\n if char == '':\r\n isEnd = True\r\n break\r\n\r\n if isEnd:\r\n break\r\n\r\n\r\n\r\nbottomEmpty = -1\r\nfor i in range(n):\r\n bottomEmpty += 1\r\n\r\n isEnd = False\r\n for char in lines[n - 1 - i]:\r\n if char == '':\r\n isEnd = True\r\n break\r\n\r\n if isEnd:\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nleftEmpty = -1\r\nfor i in range(m):\r\n leftEmpty += 1\r\n\r\n isEnd = False\r\n for y in range(n):\r\n char = lines[y][i]\r\n if char == '':\r\n isEnd = True\r\n break\r\n\r\n if isEnd:\r\n break\r\n\r\n\r\nrightEmpty = -1\r\nfor i in range(m):\r\n rightEmpty += 1\r\n\r\n isEnd = False\r\n for y in range(n):\r\n char = lines[y][m - 1 - i]\r\n if char == '':\r\n isEnd = True\r\n break\r\n\r\n if isEnd:\r\n break\r\n\r\n\r\n\r\n\r\n\r\nfor i in range(topEmpty, n - bottomEmpty):\r\n for j in range(leftEmpty, m - rightEmpty):\r\n print(lines[i][j], end='')\r\n\r\n print()", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\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, m = II()\r\ng = [S() for i in r(n)]\r\ndef f1():\r\n for i in r(n):\r\n for j in r(m):\r\n if g[i][j] == '':\r\n return i\r\ndef f2():\r\n for i in r(m):\r\n for j in r(n):\r\n if g[j][i] == '':\r\n return i\r\ndef f3():\r\n for i in reversed(r(n)):\r\n for j in r(m):\r\n if g[i][j] == '':\r\n return i\r\ndef f4():\r\n for i in reversed(r(m)):\r\n for j in r(n):\r\n if g[j][i] == '':\r\n return i\r\nx1 = f1()\r\ny1 = f2()\r\nx2 = f3()\r\ny2 = f4()\r\nres = [[] for i in r(x2-x1+1)]\r\nfor i in r(x1,x2+1):\r\n for j in r(y1,y2+1):\r\n res[i-x1].append(g[i][j])\r\nfor x in res:\r\n p(''.join(x))", "a, b = map(int, input().split())\r\nx1 = -1\r\nx2 = -1\r\ny1 = 100\r\ny2 = 0\r\ne = []\r\nfor i in range(a):\r\n d = input()\r\n e.append(d)\r\n if '' in d:\r\n if x1 == -1:\r\n x1 = i\r\n x2 = i\r\n g = d.index('')\r\n h = d[::-1]\r\n k = b - h.index('')\r\n if g < y1:\r\n y1 = g\r\n if k > y2:\r\n y2 = k\r\nfor i in range(x1, x2 + 1):\r\n print(e[i][y1:y2])", "n,m = [int(x) for x in input().split()]\r\n\r\nL = []\r\nfor i in range(0,n):\r\n L.append(input())\r\n \r\nhmin = n\r\nhmax = -1\r\nwmin = m\r\nwmax = -1\r\n\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if L[i][j] == '':\r\n if j < wmin:\r\n wmin = j\r\n if j > wmax:\r\n wmax = j\r\n if i > hmax:\r\n hmax = i\r\n if i < hmin:\r\n hmin = i\r\n\r\nfor i in range(hmin,hmax+1):\r\n for j in range(wmin,wmax):\r\n print(L[i][j],end = '' )\r\n print(L[i][wmax])\r\n\r\n", "n, m = map(int, input(). split())\r\nmn, mx, ans = 1e9, 0, [ ]\r\nwhile n:\r\n s = input()\r\n ans += [s]\r\n q, w = 0, 0\r\n for i in range(len(s)):\r\n if s[i] == '':\r\n q = i\r\n break\r\n for j in range(len(s)):\r\n if s[j] == '':\r\n w = (j + 1)\r\n if '' in s:\r\n mn = min(mn, q)\r\n mx = max(mx, w)\r\n n -= 1\r\nt = 0\r\nfor l in range(len(ans)):\r\n if '' in ans[l]:\r\n t = (l + 1)\r\ny = 0\r\no = 0\r\nfor k in ans:\r\n y += 1\r\n if '' not in k and o == 0:\r\n pass\r\n else:\r\n o = 1\r\n if t >= y:\r\n print(k[mn : mx])\r\n else:\r\n break\r\n", "n, m = map(int, input().split())\r\ns = [input() for i in range(n)]\r\nl = [i for i in range(n) if \"\" in s[i]]\r\nmini = [i.index(\"\") for i in s if \"\" in i]\r\nmaxi = [i.rindex(\"\") for i in s if \"\" in i]\r\nfor i in range(min(l), max(l)+1):\r\n print(str(s[i][min(mini): max(maxi) + 1]))\r\n", "n, m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n\tl.append(input())\r\na = 0\r\nb = 51\r\nt = 1\r\nfor x in range(n):\r\n\tif l[x].count(\"\") > 0:\r\n\t\tz = l[x].index(\"\")\r\n\t\tif t == 1:\r\n\t\t\tmini = z\r\n\t\tif l[x].index(\"\") <= mini:\r\n\t\t\tmini = l[x].index(\"\")\r\n\t\ta = max(a,x)\r\n\t\tb = min(b,x)\r\n\t\tt = 0\r\nr = 1\r\nfor x in range(n):\r\n\tfor y in range(m-1,-1,-1):\r\n\t\tif l[x][y] == \"\":\r\n\t\t\tif r == 1:\r\n\t\t\t\tmaxi = y\r\n\t\t\tv = y\r\n\t\t\tmaxi = max(v,maxi)\r\n\t\t\tif x == b:\r\n\t\t\t\tr = 0\r\n\t\t\tbreak\r\nfor i in range(b,a+1):\r\n\tprint(l[i][mini:maxi+1])\r\n", "i,j=map(int,input().split())\nmatrix = []\nfor k in range(i):\n matrix.append(list(input()))\nleft_limit=[]\ntop_limit = []\nbottom_limit = []\nright_limit=[]\n\nfor m in matrix:\n for n in m:\n if n == '':\n left_limit.append(m.index(n))\n top_limit.append(matrix.index(m))\n break\n\nmatrix.reverse()\n\nfor each in matrix:\n each.reverse()\n\nfor m in matrix:\n for n in m:\n if n == '':\n right_limit.append(m.index(n))\n bottom_limit.append(matrix.index(m))\n break\n\nmatrix.reverse()\n\nfor each in matrix:\n each.reverse()\n\nr=j-min(right_limit)\nl=min(left_limit)\nt=min(top_limit)\nb=i-min(bottom_limit)\n\n\nfor u in range(t,b):\n print(matrix[u][l:r],sep='')", "n,m = map(int,input().split())\r\na = []\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n b = list(input())\r\n if \"\" in b: \r\n x.append(i)\r\n j = 0\r\n while b[j] == \".\" and j < m: j += 1\r\n y.append(j)\r\n j = m-1\r\n while b[j] == \".\" and j >= 0: j -= 1\r\n y.append(j)\r\n a.append(b)\r\nfor i in range(min(x),max(x)+1):\r\n for j in range(min(y),max(y)+1): print(a[i][j],end = \"\")\r\n print()", "n, m = map(int, input().split())\r\n\r\n# read the grid\r\ngrid = [input() for _ in range(n)]\r\n\r\n# find the indices of the first and last rows/columns containing shaded squares\r\nfirst_row = n\r\nlast_row = -1\r\nfirst_col = m\r\nlast_col = -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == \"\":\r\n first_row = min(first_row, i)\r\n last_row = max(last_row, i)\r\n first_col = min(first_col, j)\r\n last_col = max(last_col, j)\r\n\r\n# output the coordinates of the minimum bounding rectangle\r\n# print(first_row, first_col, last_row, last_col)\r\n# print()\r\n\r\n# print(grid)\r\n\r\nfor idx_row in range(first_row, last_row + 1):\r\n for idx_col in range(first_col, last_col + 1):\r\n print(grid[idx_row][idx_col], end=\"\")\r\n print()\r\n", "n, m = map(int, input().split())\ngrid = [input() for i in range(n)]\n\nminr, maxr, minc, maxc = n, -1, m, -1\n\nfor i in range(n):\n for j in range(m):\n if grid[i][j] == '':\n minr = min(minr, i)\n maxr = max(maxr, i)\n minc = min(minc, j)\n maxc = max(maxc, j)\n\nfor i in range(minr, maxr+1):\n print(grid[i][minc:maxc+1])\n", "\r\nn, m = map(int, input().split())\r\n\r\nmatrix = [list(input()) for _ in range(n)]\r\n\r\n\r\ntop = bottom = left = right = None\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if matrix[i][j] == '':\r\n if top is None:\r\n top = i\r\n bottom = i\r\n if left is None or j < left:\r\n left = j\r\n if right is None or j > right:\r\n right = j\r\n\r\n\r\nfor i in range(top, bottom + 1):\r\n print(''.join(matrix[i][left:right + 1]))", "'''\nThis is a base snippet for cp\n'''\n\n\ndef main():\n #code Here\n n,m = map(int,input().split())\n arr = []\n for i in range(n):\n t = list(input())\n l = []\n for j in t:\n if j=='.':\n l.append(0)\n else:\n l.append(1)\n arr.append(l)\n a,b,c,d = 0,m-1,n-1,0\n f1,f2=False,False\n for i in range(n):\n for j in range(m):\n if arr[i][j] == 1:\n if a==0 and f1==False:\n a=i\n f1=True\n if j<b:\n b=j\n for i in range(n-1,-1,-1):\n for j in range(m-1,-1,-1):\n if arr[i][j] == 1:\n if c==n-1 and f2==False:\n c = i\n f2=True\n if j>d:\n d=j\n for i in range(a,c+1):\n for j in range(b,d+1):\n print('' if arr[i][j]==1 else '.',end=\"\")\n print()\n # print(arr[n-1][4])\nif __name__ == '__main__':\n for i in range(1):\n main()\n", "n,m=map(int,input().split());\r\nsheet=[];\r\nfor i in range(n):\r\n sheet.append(input());\r\n\r\nmini=n-1;\r\nmaxi=0;\r\nminj=m-1;\r\nmaxj=0;\r\nfor i in range(n):\r\n for j in range(m):\r\n if sheet[i][j]=='':\r\n if i<mini: mini=i;\r\n if i>maxi: maxi=i;\r\n if j<minj: minj=j;\r\n if j>maxj: maxj=j;\r\n\r\nfor i in range(mini,maxi+1):\r\n print(sheet[i][minj:maxj+1]);\r\n", "n, m =map(int, input().split())\r\na=[]\r\np=[]\r\nx=[]\r\ny=[]\r\n \r\nfor i in range(n):\r\n\ts=input()\r\n\tfor j in range(m):\r\n\t\tif s[j]=='':\r\n\t\t\tx+=[j]\r\n\t\t\ty+=[i]\r\n\tp+=[s]\r\n \r\ns=\"\" \r\nx0=min(x)\r\nx1=max(x)\r\ny0=min(y)\r\ny1=max(y)\r\n \r\nfor i in range(y0,y1+1):\r\n\tfor j in range(x0, x1+1):\r\n\t\ts+=p[i][j]\r\n\ts+='\\n'\r\nprint(s)", "n,m=map(int,input().split())\r\nl=[]\r\nl_row=[]\r\nl_col=[]\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j]==\"\":\r\n l_row.append(i)\r\n l_col.append(j)\r\nfor i in range(min(l_row),max(l_row)+1):\r\n print(l[i][min(l_col):max(l_col)+1])\r\n \r\n \r\n\r\n", "__author__ = 'aste'\r\n\r\n\r\ndef main():\r\n n, m = [int(x) for x in input().split()]\r\n\r\n rect = []\r\n for i in range(0, n):\r\n row = input()\r\n rect.append(row)\r\n\r\n min_r = n + 1\r\n max_r = 0\r\n min_c = m + 1\r\n max_c = 0\r\n for i in range(0, n):\r\n for j in range(0, m):\r\n if rect[i][j] == '':\r\n min_r = min(min_r, i)\r\n max_r = max(max_r, i)\r\n min_c = min(min_c, j)\r\n max_c = max(max_c, j)\r\n\r\n res = []\r\n for i in range(min_r, max_r + 1):\r\n res.append(rect[i][min_c:max_c + 1])\r\n\r\n print(\"\\n\".join(res))\r\n\r\nmain()\r\n", "l = []\r\nn,m = map(int,input().split())\r\nfor i in range(n):\r\n l.append(input())\r\n\r\nwhile True:\r\n allstar = True\r\n rows = len(l)\r\n columns = len(l[0])\r\n\r\n \r\n if l[0] == '.' columns:\r\n l.pop(0)\r\n allstar = False\r\n \r\n rows = len(l);columns = len(l[0])\r\n if l[len(l)-1] == '.' * columns:\r\n l.pop(len(l)-1)\r\n allstar = False\r\n\r\n rows = len(l);columns = len(l[0])\r\n col_left = ''\r\n col_right = ''\r\n for i in l:\r\n col_left += i[0]\r\n col_right += i[columns-1]\r\n if col_left == '.'rows:\r\n for i in range(len(l)):\r\n x = l[i]\r\n l[i] = x[1:]\r\n allstar = False\r\n\r\n \r\n rows = len(l);columns = len(l[0])\r\n if col_right == '.' rows:\r\n for i in range(len(l)):\r\n y = l[i]\r\n l[i] = y[:columns-1]\r\n allstar = False\r\n\r\n \r\n if allstar == True:\r\n break\r\n\r\n\r\nfor i in l:\r\n print(i)\r\n", "xy = input().split(\" \")\r\nsheet = []\r\nfor i in range(int(xy[0])):\r\n sheet.append(input())\r\nsheet2 = []\r\nrectx = []\r\nrecty = []\r\n\r\nfor i in range(int(xy[0])):\r\n if '' in sheet[i]:\r\n rectx.append(i)\r\n\r\nfor j in range(int(xy[1])):\r\n list = ''\r\n for i in sheet:\r\n list += i[j]\r\n sheet2.append(list)\r\n\r\nfor i in range(int(xy[1])):\r\n if '' in sheet2[i]:\r\n recty.append(i)\r\n\r\nfor i in range(rectx[0], rectx[-1]+1):\r\n print(sheet[i][recty[0]:recty[-1]+1])\r\n", "x, y = map(int, input().split())\r\nq = [input() for i in range(x)]\r\nt = 0\r\nwhile q[t] == '.' * y:\r\n t += 1\r\nb = x\r\nwhile q[b-1] == '.' * y:\r\n b -= 1\r\nl = 0\r\nwhile sum(i[l] == '' for i in q) == 0:\r\n l += 1\r\nr = y\r\nwhile sum(i[r-1] == '' for i in q) == 0:\r\n r -= 1\r\nprint('\\n'.join(i[l:r] for i in q[t:b]))\r\n", "rows, cols = map(int, input().split())\r\nli = list([])\r\n\r\nfor z in range(rows):\r\n li.append(list(input().split())[0])\r\n\r\ntop_row_found = False\r\nfor i in range(rows):\r\n if '' in li[i]:\r\n top_row_found = True\r\n break\r\n\r\nbottom_row_found = False\r\nfor j in reversed(range(rows)):\r\n if '' in li[j]:\r\n bottom_row_found = True\r\n break\r\n\r\nleft_col_found = False\r\nfor k in range(cols):\r\n if left_col_found:\r\n break\r\n for l in range(rows):\r\n if '' == li[l][k] and not left_col_found:\r\n left_col_found = True\r\n\r\nright_col_found = False\r\nright_col = -1\r\nfor m in reversed(range(cols)):\r\n if right_col_found:\r\n break\r\n for n in range(rows):\r\n if '' == li[n][m] and not right_col_found:\r\n right_col = m\r\n right_col_found = True\r\n\r\nfor x in range(i, j+1):\r\n print(li[x][k-1: right_col+1])\r\n\r\n\r\n# for z in range(int(input())):\r\n# excel_input = list(input().split())\r\n# excel_input = excel_input[0]\r\n# if excel_input[0] == 'R' and excel_input[1].isdigit():\r\n# # R__C__\r\n# idx = 1\r\n# while excel_input[idx].isdigit():\r\n# idx += 1\r\n# row_num = idx\r\n# col_num = int(excel_input[idx+1:])\r\n# col_num = 731\r\n# # while col_num >= 26:\r\n# # print(col_num//26)\r\n# # print(col_num%26)\r\n# # col_num = col_num - 26col_num//26\r\n# print(col_num%26)\r\n# print(excel_input[1:row_num])\r\n# else:\r\n# # Alphabets Digits\r\n# idx = 0\r\n# column_num = 0\r\n# while excel_input[idx].isalpha():\r\n# column_num = ord(excel_input[idx])-64 + column_num\r\n# column_num = 26\r\n# idx += 1\r\n# print('R' + excel_input[idx:] + 'C' + str(int(column_num/26)))\r\n", "rows, columns = map(int, input().split())\r\nb = [input() for i in range(rows)]\r\n\r\nx = [r for c in zip(b) for r in range(rows) if c[r] == '']\r\ny = [c for r in b for c in range(columns) if r[c] == '']\r\n\r\nresult = '\\n'.join(r[min(y) : max(y) + 1] for r in b[min(x) : max(x) + 1])\r\nprint(result)", "# -- coding: utf-8 --\r\n\r\nn,m = map(int,input().split())\r\na = [input() for i in range(n)]\r\nrows = []\r\ncols = []\r\n\r\nfor i in range(n):\r\n if '' in a[i]:\r\n rows.append(i)\r\n for j in range(m):\r\n if a[i][j] == '': cols.append(j)\r\n\r\na = a[min(rows):max(rows)+1]\r\n\r\nfor k in a:\r\n print(k[min(cols):max(cols)+1])\r\n\r\n", "n,m=map(int,input().split())\r\na=[]\r\nb=[]\r\nl=[]\r\nc=0\r\nfor i in range(n):\r\n x=input()\r\n l.append(x)\r\n for i in range(len(x)):\r\n if x[i]=='':\r\n a.append(c)\r\n b.append(i)\r\n c=c+1\r\nfor i in range(min(a),max(a)+1):\r\n for j in range(min(b),max(b)+1):\r\n print(l[i][j],end='')\r\n print()", "def take2DInput() :\r\n nRows,mCols =map(int,input().split())\r\n \r\n if nRows == 0 :\r\n return list(), 0, 0\r\n \r\n mat = [list(map(str, input().strip())) for row in range(nRows)]\r\n return mat, nRows, mCols\r\n\r\nmat, nRows, mCols = take2DInput()\r\n\r\nminr,maxr,minc,maxc=nRows,0,mCols,0\r\n\r\nfor i in range(nRows):\r\n for j in range(mCols):\r\n if mat[i][j]==\"\":\r\n if minr>i:\r\n minr=i\r\n if minc>j:\r\n minc=j\r\n if maxr<i:\r\n maxr=i\r\n if maxc<j:\r\n maxc=j\r\n\r\nfor i in range(minr,maxr+1):\r\n for j in range(minc,maxc+1):\r\n print(mat[i][j],end=\"\")\r\n print()", "n, m =map(int, input().split())\r\n\r\na=[];p=[]\r\nx=[];y=[]\r\n\r\nfor i in range(n):\r\n\ts=input()\r\n\tfor j in range(m):\r\n\t\tif s[j]=='':\r\n\t\t\tx+=[j];y+=[i]\r\n\tp+=[s]\r\n\r\ns=\"\" #Using 's' instead of print() actually save time and prints perfectly\r\nx0=min(x);x1=max(x)\r\ny0=min(y);y1=max(y)\r\n\r\nfor i in range(y0,y1+1):\r\n\tfor j in range(x0, x1+1):\r\n\t\ts+=p[i][j]\r\n\ts+='\\n'\r\nprint(s)\t", "n,m=map(int,input().split())\r\nL=[input() for x in range(n)]\r\n\r\np=10000000000\r\np1=-1\r\npp=100000000\r\npp1=-1\r\nfor i in range(n) :\r\n if L[i].count(\"\")>0 :\r\n p=min(p,i)\r\n p1=max(p1,i)\r\n pp=min(L[i].index(\"\"),pp)\r\n pp1=max(L[i].rindex(\"\"),pp1)\r\n\r\nfor i in range(p,p1+1) :\r\n print(L[i][pp:pp1+1])\r\n \r\n ", "n, m = map(int, input().split())\r\nA = [input() for _ in range(n)]\r\nmin_x, max_x = n, 0\r\nmin_y, max_y = m, 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j] == '':\r\n min_x, max_x = min(min_x, i), max(max_x, i)\r\n min_y, max_y = min(min_y, j), max(max_y, j)\r\n\r\nfor x in range(min_x, max_x+1):\r\n print(A[x][min_y:max_y+1])", "a,b=map(int,input().split())\r\nl=[]\r\ns,e=-1,0\r\nmx,mn=[],[]\r\nfor x in range(a):\r\n\tl.append(input())\r\nfor x in range(a):\r\n\tif \"\" in l[x]:\r\n\t\tif s==-1:\r\n\t\t\ts=x\r\n\t\te=x\r\n\t\tmn.append(l[x].index(\"\"))\r\n\t\tmx.append(l[x].rindex(\"\"))\r\nfor x in range(s,e+1):\r\n\tprint(l[x][min(mn):max(mx)+1])", "n, m = map(int,input().split())\r\ntable = [input() for i in range(n)]\r\nv1,h1,v2,h2 = 51,51,0,0\r\nfor i in range(n):\r\n for j in range(m):\r\n if table[i][j] == \"\":\r\n v1 = min(v1,j)\r\n v2 = max(v2,j)\r\n h1 = min(h1,i)\r\n h2 = max(h2,i)\r\nfor i in range(h1,h2+1):\r\n for j in range(v1,v2+1):\r\n print(table[i][j],end=\"\")\r\n print()\r\n", "n, m = map(int, input().split())\r\n\r\nb = [input() for i in range(n)]\r\n\r\nx = []\r\nfor c in zip(b):\r\n for r in range(n):\r\n if c[r] == '':\r\n x.append(r)\r\n\r\ny = []\r\nfor r in b:\r\n for c in range(m):\r\n if r[c] == '':\r\n y.append(c)\r\n\r\nprint('\\n'.join(r[min(y) : max(y) + 1] for r in b[min(x) : max(x) + 1]))", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nletter = []\r\nletter2 = {\"n-min\": n+1, \"m-min\": m+1,\r\n \"n-max\": 0, \"m-max\": 0, }\r\n\r\nfor x in range(0, n):\r\n letter.append(input())\r\n\r\nfor x in range(0, n):\r\n for y in range(0, m):\r\n if letter[x][y] == '':\r\n if x<letter2[\"n-min\"] :\r\n letter2[\"n-min\"] = x\r\n if y<letter2[\"m-min\"] :\r\n letter2[\"m-min\"] = y\r\n if x>letter2[\"n-max\"] :\r\n letter2[\"n-max\"] = x\r\n if y>letter2[\"m-max\"] :\r\n letter2[\"m-max\"] = y\r\n\r\nfor x in range(letter2[\"n-min\"], letter2[\"n-max\"]+1):\r\n for y in range(letter2[\"m-min\"], letter2[\"m-max\"]+1):\r\n print(letter[x][y], end =\"\")\r\n print()\r\n ", "n, m = map(int, input().split())\r\nmax_x, max_y = 0, 0\r\nmin_x, min_y = n, m\r\npicture = []\r\n\r\nfor i in range(n):\r\n\tline = input()\r\n\tpicture.append(line)\r\n\tfor j in range(m):\r\n\t\tif line[j] == \"\":\r\n\t\t\tmin_x, min_y = min(i, min_x), min(j, min_y)\r\n\t\t\tmax_x, max_y = max(i, max_x), max(j, max_y)\r\n\r\nfor i in range(min_x, max_x+1):\r\n\tprint(picture[i][min_y:max_y+1])\r\n", "def find_rectangle(n, m, sheet):\r\n top = left = float('inf')\r\n bottom = right = -1\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if sheet[i][j] == '':\r\n top = min(top, i)\r\n left = min(left, j)\r\n bottom = max(bottom, i)\r\n right = max(right, j)\r\n\r\n\r\n rectangle = []\r\n for i in range(top, bottom + 1):\r\n rectangle.append(sheet[i][left:right + 1])\r\n\r\n return rectangle\r\n\r\nn, m = map(int, input().split())\r\nsheet = [input() for _ in range(n)]\r\n\r\n\r\nrectangle = find_rectangle(n, m, sheet)\r\nfor row in rectangle:\r\n print(row)\r\n", "import math\r\ntemp = input().split()\r\nr,c = int(temp[0]),int(temp[1])\r\nm = 0\r\ntogether = []\r\nright = 0\r\nsile = []\r\nl = 0\r\nflag = 0\r\nfor i in range(r):\r\n temp = input()\r\n s = temp.count(\"\")\r\n if flag == 0 and s>0:\r\n flag = 1\r\n l = i\r\n sile.append([temp,s])\r\nright = len(sile)-1\r\nwhile right>=0:\r\n if sile[right][1]!=0:\r\n break\r\n right-=1\r\nlow,high = math.inf,0\r\nfor i in range(l,right+1):\r\n for j in range(len(sile[i][0])):\r\n if sile[i][0][j] == \"\":\r\n low = min(j,low)\r\n high = max(high,j)\r\nfor i in range(l,right+1):\r\n print(sile[i][0][low:high+1])\r\n\r\n \r\n", "r, c = [int(s) for s in input().split(' ')]\r\nrows = []\r\nfor row in range(r):\r\n rows.append(input())\r\nwhile rows[0] == '.' * c:\r\n del rows[0]\r\nwhile rows[-1] == '.' * c:\r\n del rows[-1]\r\ni = 0\r\nwhile '' not in [row[i] for row in rows]:\r\n i += 1\r\nj = c - 1\r\nwhile '' not in [row[j] for row in rows]:\r\n j -= 1\r\nfor row in rows:\r\n print(row[i:j+1])\r\n", "n, m = map(int, input().split())\r\nsheet = []\r\nfor _ in range(n):\r\n row = list(input())\r\n sheet.append(row)\r\nmin_row = n\r\nmax_row = 0\r\nmin_column = m\r\nmax_column = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if sheet[i][j] == '':\r\n min_row = min(min_row, i)\r\n max_row = max(max_row, i)\r\n min_column = min(min_column, j)\r\n max_column = max(max_column, j)\r\nfor i in range(min_row, max_row + 1):\r\n for j in range(min_column, max_column + 1):\r\n print(sheet[i][j], end='')\r\n print()", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\na = []\r\nb = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j] == \"\":\r\n a.append(i)\r\n b.append(j)\r\nfor i in range(min(a),max(a)+1):\r\n for j in range(min(b),max(b)+1):\r\n print(l[i][j],end = \"\")\r\n print()\r\n", "n,m = map(int, input().split())\r\ni = []\r\nj = []\r\na = [input() for i in range(n)]\r\nfor x in range(n):\r\n for y in range(m):\r\n if a[x][y]=='':\r\n i += [x]\r\n j += [y]\r\nfor x in a[min(i):max(i)+1]:\r\n print(x[min(j):max(j)+1])", "n, m = map(int, input().split())\nsheet = []\nfor i in range(n):\n row = list(input())\n if not (sheet == [] and row == m [\".\"]):\n sheet.append(row)\n\nfor i in sheet[::-1]:\n if i == m * [\".\"]:\n sheet.pop()\n else:\n break\n\nwhile True:\n empty = True\n for i in sheet:\n if i[0] != \".\":\n empty = False\n if empty:\n for i in range(len(sheet)):\n sheet[i] = sheet[i][1:]\n else:\n break\n\nwhile True:\n empty = True\n for i in sheet:\n if i[-1] != \".\":\n empty = False\n if empty:\n for i in range(len(sheet)):\n sheet[i] = sheet[i][:len(sheet[i])-1]\n else:\n break\n\nfor i in range(len(sheet)):\n print(''.join(sheet[i]))\n\n", "# A. Letter\n\nn, m = map(int, input().split())\n\nleft, right = 51, 0\ntop, bottom = 51, 0\n\na = list()\n\nfor i in range(n):\n s = input()\n a.append(s)\n\n tmp = s.find('')\n if tmp != -1:\n left = min(left, tmp)\n right = max(right, s.rfind(''))\n\n top = min(top, i)\n bottom = max(bottom, i)\n\nfor i in range(n):\n if top <= i <= bottom:\n print(a[i][left:right + 1])\n", "n,m=[int(x) for x in input().split()]\n\ndef transpose(mtx):\n x = [list(\".\")len(mtx) for i in range(len(mtx[0]))]\n for i in range(len(mtx)):\n for j in range(len(mtx[0])):\n x[j][i] = mtx[i][j]\n return x\ndef pro(v):\n ast=0\n while(v[ast]==list(\".\"len(v[0]))):\n ast+=1\n ast2=len(v)-1\n while(v[ast2]==list(\".\"len(v[0]))):\n ast2-=1\n return v[ast:ast2+1]\nv = []\nfor i in range(n):\n v.append(list(input()))\nv2=pro(v)\nv2=transpose(v2)\nv2=pro(v2)\nv2=transpose(v2)\nfor i in range(len(v2)):\n for j in range(len(v2[0])):\n print(v2[i][j],end=\"\")\n print()\n\n\n", "\r\nn, m = [int(item) for item in input().split(' ')]\r\ntop, bottom, left, right = -1, 0, m, 0\r\ncont = []\r\nfor i in range(n):\r\n line = input()\r\n if '' in line:\r\n if top == -1:\r\n top = i\r\n fInd = line.index('')\r\n if left > fInd:\r\n left = fInd\r\n rInd = line.rindex('')\r\n if right < rInd:\r\n right = rInd\r\n bottom = i\r\n cont.append(line)\r\n\r\nfor i in range(top,bottom+1,1):\r\n print(cont[i][left:right+1])\r\n", "n, m = map(int, input().split())\r\nboard = []\r\nu, l, d, r = n, m, 0, 0\r\nfor i in range(n):\r\n board.append(input())\r\n for j in range(m):\r\n if board[i][j] == '':\r\n if d < i:\r\n d = i\r\n if u > i:\r\n u = i\r\n if l > j:\r\n l = j\r\n if r < j:\r\n r = j\r\nfor i in range(u, d + 1):\r\n print(board[i][l:r + 1])\r\n", "n,m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n l.append(input())\r\ni1 = n\r\ni2 = 0\r\nj1 = m\r\nj2 = 0 \r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j] == '':\r\n i1 = min(i1,i)\r\n j1 = min(j1,j)\r\nfor i in range(n-1,-1,-1):\r\n for j in range(m-1,-1,-1):\r\n if l[i][j] == '':\r\n i2 = max(i2,i)\r\n j2 = max(j2,j) \r\nfor i in range(i1,i2+1):\r\n outs = ''\r\n for j in range(j1,j2+1):\r\n outs +=l[i][j]\r\n print(outs) \r\n", "n , m = map( int, input().strip().split(' ') )\r\nboard = []\r\nfor _ in range(n):\r\n board.append( list( input().strip() ) )\r\nrl , rh , cl , ch = n , 0 , m , 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if board[i][j] == '':\r\n rl = min(rl, i)\r\n rh = max(rh, i)\r\n cl = min(cl, j)\r\n ch = max(ch, j)\r\nfor i in range(rl, rh + 1):\r\n line = ''\r\n for j in range(cl, ch + 1):\r\n line += board[i][j]\r\n print(line)", "def main():\r\n n, m = map(int, input().split())\r\n s = []\r\n for i in range(n):\r\n s.append(input())\r\n left, right, top, bot = float('inf'), float('-inf'), None, None\r\n for i in range(n):\r\n if '' in s[i]:\r\n top = i\r\n break\r\n for i in range(n-1, -1, -1):\r\n if '' in s[i]:\r\n bot = i\r\n break\r\n for i in range(top, bot+1):\r\n for j in range(m):\r\n if s[i][j] == '':\r\n if j > right:\r\n right = j\r\n if j < left:\r\n left = j\r\n\r\n for i in range(top, bot+1):\r\n print(s[i][left:right+1])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "l = input().split()\r\nn = int(l[0])\r\nm = int(l[1])\r\ns = []\r\nmin = m\r\nmax = 0\r\nminline = n \r\nmaxline = 0\r\nfor i in range(n):\r\n st = input()\r\n enum = [pos for pos,char in enumerate(st) if char == '']\r\n if enum:\r\n if i < minline:\r\n minline = i\r\n if i > maxline:\r\n maxline = i\r\n if enum[0] < min:\r\n min = enum[0]\r\n if enum[-1] > max:\r\n max = enum[-1]\r\n s.append(st)\r\ns = s[minline:maxline+1]\r\nfor i in range(len(s)):\r\n s[i] = s[i][min:max+1]\r\n print(s[i])", "n, m = map(int, input().split())\nL = [str(input()) for _ in range(n)]\n\nil = -1\nir = -1\nfor i in range(n):\n for j in range(m):\n if L[i][j] != '.':\n ir = i\n if il == -1:\n il = i\n\njl = -1\njr = -1\nfor j in range(m):\n for i in range(n):\n if L[i][j] != '.':\n jr = j\n if jl == -1:\n jl = j\n\nfor i in range(il, ir+1):\n print(L[i][jl:jr+1])\n", "s=[int(i) for i in input().split()]\na=[input() for i in range(s[0])]\nfor _ in range(4):\n a.reverse()\n d,b=[],0\n for c in zip(a):\n if '' in c:b = 1\n if b:d+=[c]\n a=d\nfor i in a:\n print(''.join(i))\n\n", "# LUOGU_RID: 101441390\nn, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\nx0 = y0 = 50\r\nx1 = y1 = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '':\r\n x0 = min(x0, i)\r\n y0 = min(y0, j)\r\n x1 = max(x1, i)\r\n y1 = max(y1, j)\r\nfor i in range(x0, x1 + 1):\r\n print(a[i][y0:y1+1])", "n,m = map(int,input().split())\r\ns = []\r\nss = []\r\nfor i in range(n):\r\n c = list(input())\r\n s.append(c)\r\n\r\na = None\r\nb = None\r\nfor i in range(len(s)):\r\n if '' in s[i]:\r\n if a is None:\r\n a = i\r\n b = i\r\ns = s[a:b+1]\r\n \r\nc = None\r\nd = None\r\n\r\nfor j in range(m):\r\n #f = False\r\n for i in range(len(s)):\r\n if s[i][j] == '':\r\n #f = True\r\n if c is None:\r\n c = j\r\n d = j\r\n\r\n#for j in range(c,d+1):\r\n# for i in range(len(s)):\r\n# ss.append(s[i][j])\r\n\r\nfor i in range(len(s)):\r\n print(\"\".join(s[i][c:d+1])) #\"\".join(map(str, ss))\r\n#print(c,d)", "a,b = map(int,input().split())\r\nGrid = []\r\nfor i in range(a):\r\n s = input()\r\n Grid.append(s)\r\nImax,Jmax = -1,-1\r\nImin,Jmin = 10000,10000\r\n\r\n\r\n\r\nfor i in range(a):\r\n for j in range(b):\r\n if(Grid[i][j] == ''):\r\n if(Imax < i):\r\n Imax = i\r\n if(Jmax < j):\r\n Jmax = j\r\n if(Imin > i):\r\n Imin = i\r\n if(Jmin > j):\r\n Jmin = j\r\n\r\nfor i in range(Imin,Imax+1):\r\n ans = ''\r\n for j in range(Jmin,Jmax+1):\r\n ans += Grid[i][j]\r\n print(ans)\r\n", "import sys\r\n\r\nn, m, a = sys.stdin.read().split()\r\n\r\nn = int(n)\r\nm = int(m)\r\n\r\nmxi = 0\r\nmxj = 0\r\nmni = n\r\nmnj = m\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '':\r\n mni = min(mni, i)\r\n mnj = min(mnj, j)\r\n mxi = max(mxi, i)\r\n mxj = max(mxj, j)\r\n\r\nfor i in range(mni, mxi+1):\r\n for j in range(mnj, mxj+1):\r\n print(a[i][j], end=\"\")\r\n print()\r\n", "n, m = [int(x) for x in input().split()]\r\nl = t = 101\r\nr = b = -11\r\na= []\r\n\r\nfor row in range(n):\r\n s = input()\r\n for col in range(m):\r\n if s[col] == '':\r\n if row < t:\r\n t = row\r\n if col < l:\r\n l = col\r\n if col > r:\r\n r = col\r\n if row > b:\r\n b = row\r\n a.append(s)\r\n\r\nfor row in range(t, b + 1):\r\n print(a[row][l: r + 1])\r\n", "def main():\r\n ns, ms = map(int, input().split())\r\n drawi = [['0' for _ in range(ms)] for _ in range(ns)]\r\n startRow, endRow, startCol, endCol = ns, 0, ms, 0\r\n\r\n for row in range(ns):\r\n li = input().strip()\r\n for col in range(ms):\r\n drawi[row][col] = li[col]\r\n\r\n if li[col] == '':\r\n startRow = min(startRow, row)\r\n endRow = max(endRow, row)\r\n startCol = min(startCol, col)\r\n endCol = max(endCol, col)\r\n\r\n for row in range(startRow, endRow + 1):\r\n for col in range(startCol, endCol + 1):\r\n print(drawi[row][col], end='')\r\n print()\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int, input().split())\r\ngrid = [input() for i in range(n)]\r\n\r\nmaxrow, maxcol, minrow, mincol = -1, -1, n, m\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if(grid[i][j] == ''):\r\n maxrow = max(maxrow, i)\r\n maxcol = max(maxcol, j)\r\n minrow = min(minrow, i)\r\n mincol = min(mincol, j)\r\n \r\nfor i in range(minrow, maxrow + 1):\r\n print(grid[i][mincol: maxcol + 1])\r\n", "n,m = map(int, input().split())\np = []\nflag = False\nminr = n\nmaxr = 0\nminc = m\nmaxc = 0\nfor i in range(n):\n s = (input())\n if ''.join(s) != '.'len(s):\n flag = True\n if flag:\n p.append(s)\nsalva = 0\nfor i in reversed(range(len(p))):\n if ''.join(p[i]) != '.'len(p[i]):\n salva = i+1\n break\np = p[:salva]\n\nfor i in range(len(p)):\n for j in range(m):\n if p[i][j] == \"\":\n minr = min(minr, i)\n maxr = max(maxr, i)\n minc = min(minc, j)\n maxc = max(maxc, j)\nfor i in range(minr, maxr + 1):\n print(p[i][minc:maxc + 1])\n\n \t\t\t \t \t \t \t \t \t\t \t\t", "n, m = (int(x) for x in input().split())\r\npicture = []\r\ni = 0\r\nwhile i < n:\r\n\tpicture.append(input())\r\n\ti += 1\r\ni = 0\r\nstart_str = n\r\nend_str = 0\r\nstart_row = m\r\nend_row = 0\r\nwhile i < n:\r\n\tif '' in picture[i]:\r\n\t\tif i < start_str:\r\n\t\t\tstart_str = i\r\n\t\tif i > end_str:\r\n\t\t\tend_str = i\r\n\t\tj = picture[i].index('')\r\n\t\tif j < start_row:\r\n\t\t\tstart_row = j\r\n\t\twhile j < m:\r\n\t\t\tif picture[i][j] == '':\r\n\t\t\t\tif j > end_row:\r\n\t\t\t\t\tend_row = j\r\n\t\t\tj += 1\r\n\ti += 1\r\ni = start_str\r\nwhile i < end_str + 1:\r\n\tprint(picture[i][start_row:end_row + 1])\r\n\ti += 1", "n,m = map(int, input().split())\r\n\r\nl = []\r\nfor i in range(n):\r\n l.append(list(input()))\r\n\r\nf = []\r\nfor i in range(n):\r\n if '' in l[i]:\r\n for j in range(m):\r\n if l[i][j] == '':\r\n f.append([i, j])\r\n else:\r\n continue\r\n\r\nk = 0\r\nt = 0\r\nz = n\r\nw = m\r\nfor i in f:\r\n y = i[0]\r\n x = i[-1]\r\n if k < y:\r\n k = y\r\n if z > y:\r\n z = y\r\n if t < x:\r\n t = x\r\n if w > x:\r\n w = x\r\n\r\n\r\nfor i in range(z, k+1):\r\n v = ''\r\n for j in range(w, t+1):\r\n v += l[i][j]\r\n print(v)", "a,b=map(int,input().split())\nar=[]\nfor i in range(a):\n x=input()\n ar.append(x)\nx=[]\ny=[]\nfor i in range(a):\n if '' in ar[i]:\n y.append(i)\n for j in range(b):\n if ar[i][j]=='':\n x.append(j)\n# print(x,y)\nx1=min(x)\nx2=max(x)\ny1=min(y)\ny2=max(y)\nfor i in range(a):\n if i>=y1 and i<=y2:\n for j in range(x1,x2+1):\n print(ar[i][j],end=\"\")\n print(\"\")\n \n", "n, m = map(int, input().split())\na = []\nimin, imax = n - 1, 0\njmin, jmax = m - 1, 0\nfor i in range(n):\n s = input()\n a.append(s)\n for j in range(m):\n if s[j] == '':\n imin = min(imin, i)\n imax = max(imax, i)\n jmin = min(jmin, j)\n jmax = max(jmax, j)\n \nfor i in range(imin, imax + 1):\n print(a[i][jmin:jmax+1])", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nmatrix = []\r\nfor x in range(n):\r\n matrix.append(list(input()))\r\nmin_i = n\r\nmax_i = -1\r\nmin_j = m\r\nmax_j = -1\r\nfor x in range(n):\r\n for y in range(m):\r\n if matrix[x][y] == \"\":\r\n if(x<min_i):\r\n min_i=x\r\n if(x>max_i):\r\n max_i=x\r\n if(y<min_j):\r\n min_j=y\r\n if(y>max_j):\r\n max_j=y\r\n\r\nfor i in range(min_i,max_i+1):\r\n for j in range(min_j, max_j+1):\r\n print(matrix[i][j],end=\"\")\r\n print()", "n, m = map(int, input().split())\r\ngrid = []\r\nupper = left = 51\r\nbottom = right = 0\r\n\r\nfor i in range(n):\r\n grid.append(input())\r\n for j in range(m):\r\n if grid[i][j] == '':\r\n if i < upper:\r\n upper = i\r\n if j < left:\r\n left = j\r\n if i > bottom:\r\n bottom = i\r\n if j > right:\r\n right = j\r\n\r\n#print(upper, left, bottom, right)\r\n\r\nfor i in range(upper, bottom+1):\r\n for j in range(left, right+1):\r\n print(grid[i][j], end='')\r\n print()", "n, m = [int(x) for x in input().split()]\n\nletter = []\n\nbench = ''\n\ndef check_row(matrix, row):\n for square in matrix[row]:\n if square == '':\n return False\n return True\n\ndef check_column(matrix, column):\n for row in range(len(matrix)):\n if matrix[row][column] == '':\n return False\n return True\n\nfor i in range(n):\n letter.append(list(input()))\n\nwhile check_row(letter, 0):\n letter.pop(0)\n\nwhile check_row(letter, (len(letter) - 1)):\n letter.pop(len(letter) - 1)\n\nwhile check_column(letter, 0):\n for row in letter:\n row.pop(0)\n\nwhile check_column(letter, (len(letter[0]) - 1)):\n for row in letter:\n row.pop(len(row) - 1)\n\nfor row in letter:\n for character in row:\n bench = bench + character\n print(bench)\n bench = ''\n\n\n", "n,m = map(int,input().split())\r\nR = [list(input()) for _ in range(n)]\r\nii = ['' in r for r in R]\r\ni0 = ii.index(True)\r\ni1 = n-ii[::-1].index(True)\r\njj = ['' in c for c in zip(R)]\r\nj0 = jj.index(True)\r\nj1 = m-jj[::-1].index(True)\r\nfor i in range(i0, i1):\r\n print(''.join(R[i][j0:j1]))\r\n", "bl=''\r\n\r\ndef gd(f,l):\r\n\t\"\"\"get delta\"\"\"\r\n\treturn 2int(l>f)-1\r\n\r\ndef fe(v,zf,zl,xf,xl,iv):#iv is vertical\r\n\t\"\"\"find edge\"\"\"\r\n\tdz=gd(zf,zl)\r\n\tdx=gd(xf,xl)\r\n\tfor c in range(zf,zl,dz):\r\n\t\tfor d in range(xf,xl,dx):\r\n\t\t\tt=v[c][d] if iv else v[d][c]\r\n\t\t\tif t==bl:\r\n\t\t\t\treturn c\r\n\r\ndef ge(v,h,w):\r\n\t\"\"\"get edges\"\"\"\r\n\tt=fe(v,0,h,0,w,1)\r\n\tb=fe(v,h-1,-1,0,w,1)\r\n\tl=fe(v,0,w,0,h,0)\r\n\tr=fe(v,w-1,-1,0,h,0)\r\n\t#print('top={} bottom={} left={} right={}'.format(t,b,l,r))\r\n\treturn t,b,l,r\r\n\t\r\ndef pr(v,h,w):\r\n\t\"\"\"print region\"\"\"\r\n\tt,b,l,r=ge(v,h,w)\r\n\tfor c in range(t,b+1):\r\n\t\tfor d in range(l,r+1):\r\n\t\t\tprint(v[c][d],end='')\r\n\t\tprint()\r\n\r\nh,w=[int(c) for c in input().split()]\r\nv=[]\r\nfor c in range(h):\r\n\tv.append(input())\r\npr(v,h,w)", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(input()))\r\nx,y=[],[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if(l[i][j]==''):\r\n x.append(i)\r\n y.append(j)\r\nk=[]\r\nfor i in range(min(x),max(x)+1):\r\n d=[]\r\n for j in range(min(y),max(y)+1):\r\n d.append(l[i][j])\r\n k.append(d)\r\nfor i in k:\r\n print(''.join(i))\r\n", "n, m = [int(item) for item in input().split()]\r\ntop, bottom, left, right = -1, -1, 51, 0\r\narr = []\r\n\r\nfor i in range(n):\r\n line = input()\r\n fInd = line.find('')\r\n if fInd != -1:\r\n if top == -1:\r\n top = i\r\n\r\n if left > fInd:\r\n left = fInd\r\n\r\n fInd = line.rfind('')\r\n if right < fInd:\r\n right = fInd\r\n bottom = i\r\n\r\n arr.append(line)\r\n\r\n\r\nfor i in range(top, bottom + 1):\r\n print(arr[i][left:right + 1])\r\n'''\r\n10 14\r\n..............\r\n..............\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\n#sys.stdin = open(\"test.in\", \"r\")\r\nN, M = map(int, input().split())\r\nlines = []\r\nfor i in range(0,N,1):\r\n lines.append(input())\r\nstart = -1\r\nend = -1\r\nfor i in range(0,N,1):\r\n if \"\" in lines[i]:\r\n if start==-1:\r\n start = i\r\n end = i\r\nH = [start,end]\r\nstart = -1\r\nend = -1\r\nfor i in range(0,M,1):\r\n shaded = False\r\n for line in lines:\r\n if line[i]==\"\":\r\n shaded=True\r\n if shaded:\r\n if start==-1:\r\n start=i\r\n end = i\r\nV = [start, end]\r\n#print(H,V)\r\nfor i in range(H[0],H[1]+1,1):\r\n print(lines[i][V[0]:V[1]+1])\r\n", "n, m = list(map(int, input().split()))\r\n\r\nsheet = []\r\nup = 0\r\nbottom = 0\r\nindup = False\r\nfor i in range(n):\r\n sheet.append(input())\r\n if '' in sheet[-1] and indup == False:\r\n up = i\r\n indup = True\r\n if '' in sheet[-1]:\r\n bottom = i\r\n\r\nleft = 0\r\nindleft = False\r\nright = 0\r\nfor j in range(m):\r\n for i in range(n):\r\n if sheet[i][j] == '' and indleft == False:\r\n left = j\r\n indleft = True\r\n if sheet[i][j] == '':\r\n right = j\r\n continue\r\n\r\nfor i in range(up, bottom+1):\r\n print(sheet[i][left:right+1])", "n, m = map(int, input().split())\r\narr = list()\r\nfor i in range(n):\r\n arr.append(input())\r\nxf, yf, xl, yl = n, m, -1, -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j] != '.':\r\n if xf > i:\r\n xf = i\r\n if yf > j:\r\n yf = j\r\n if xl < i:\r\n xl = i\r\n if yl < j:\r\n yl = j\r\nfor i in range(xf, xl + 1):\r\n print(arr[i][yf:yl + 1])\r\n", "n, m = map(int, input().split())\r\n\r\ngrid = []\r\nleft = m\r\nright = 0\r\ntop = n\r\ndown = 0\r\nfor r in range(n):\r\n line = input()\r\n grid.append(line)\r\n for c, x in enumerate(line):\r\n if x == '':\r\n left = min(left, c)\r\n right = max(right, c)\r\n top = min(top, r)\r\n down = max(down, r)\r\n\r\nfor line in grid[top : down+1]:\r\n print(line[left : right+1])", "user_input = input().split()\r\nn = int(user_input[0])\r\nm = int(user_input[1])\r\nrecatangle = []\r\nfor i in range(n):\r\n recatangle.append(input())\r\n\r\nstart_m = []\r\nend_m = []\r\n\r\nfor i in range(len(recatangle)):\r\n if \"\" in recatangle[i]:\r\n start_n = i\r\n break\r\n\r\nfor i in reversed(range(len(recatangle))):\r\n if \"\" in recatangle[i]:\r\n end_n = i\r\n break\r\n\r\nfor i in recatangle:\r\n if \"\" in i:\r\n start_m.append(i.index(\"\"))\r\n end_m.append(i.rindex(\"\"))\r\n\r\nfor i in range(start_n, end_n + 1):\r\n print(recatangle[i][min(start_m):max(end_m) + 1])", "n, m = map(int, input().split())\r\ngrid = [input() for _ in range(n)]\r\n\r\ntop = float('inf')\r\nbottom = float('-inf')\r\nleft = float('inf')\r\nright = float('-inf')\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '':\r\n top = min(top, i)\r\n bottom = max(bottom, i)\r\n left = min(left, j)\r\n right = max(right, j)\r\n\r\nheight = bottom - top + 1\r\nwidth = right - left + 1\r\n\r\n\r\nfor i in range(top, bottom + 1):\r\n for j in range(left, right + 1):\r\n print(grid[i][j], end='')\r\n print()", "\r\ndef traspuesta(matriz, filas, columnas):\r\n matriz_t = []\r\n for i in range(columnas):\r\n matriz_t.append([])\r\n for j in range(filas):\r\n matriz_t[i].append(matriz[j][i])\r\n return matriz_t\r\n\r\ndef cortar(matriz, filas):\r\n sup = 0\r\n for i in range(filas):\r\n if not '' in matriz[i][:]:\r\n sup = sup + 1\r\n else:\r\n break;\r\n\r\n inf = 0\r\n for i in range(filas):\r\n if not '' in matriz[-(i+1)][:]:\r\n inf = inf + 1\r\n else:\r\n break; \r\n \r\n matriz = matriz[sup:filas-inf]\r\n filas = filas - sup - inf \r\n \r\n return matriz\r\n\r\n\r\ndatos = input().split()\r\nfilas, columnas = int(datos[0]), int(datos[1])\r\nmatriz = []\r\nfor i in range(filas):\r\n matriz.append(list(input()))\r\n\r\nmatriz = cortar(matriz, len(matriz))\r\nmatriz = traspuesta(matriz, len(matriz), len(matriz[0]))\r\nmatriz = cortar(matriz, len(matriz))\r\nmatriz = traspuesta(matriz, len(matriz), len(matriz[0]))\r\n\r\nfor i in range(len(matriz)):\r\n linea = ''\r\n for j in range(len(matriz[0])):\r\n linea = linea + matriz[i][j]\r\n print(linea)\r\n\r\n\r\n\r\n", "a,b=map(int,input().split())\r\nl=[[]]\r\nfor i in range(a):\r\n s=list(input())\r\n l.append(s)\r\nx1=y1=100\r\nx2=y2=0\r\nw=0\r\nfor o in l:\r\n for p in range(len(o)):\r\n if o[p]=='':\r\n y1=min(y1,w)\r\n x1=min(x1,p)\r\n x2=max(x2,p)\r\n y2=max(y2,w)\r\n w+=1\r\nu=0\r\nfor io in l:\r\n if u>=y1 and u<=y2:\r\n for k in range(x1,x2+1):\r\n print(io[k],end='')\r\n print()\r\n u+=1\r\n\r\n", "\r\n\r\n\r\ndef printArr(Arr):\r\n \r\n for i in Arr:\r\n str=\"\"\r\n for j in range(len(i)):\r\n if i[j]!=\"-\":\r\n str+=i[j]\r\n if len(str)>0:\r\n print(str)\r\n\r\n\r\nR,C=map(int, input().split())\r\nArr=[]\r\n\r\nfor i in range(R):\r\n Arr.append(input())\r\n\r\nnewAr=[]\r\nfor i in range(R):\r\n newAr.append([])\r\n for j in range(C):\r\n newAr[i]+=Arr[i][j]\r\n\r\n\r\n\r\n\r\n\r\nfound=False\r\nfor i in range(R):\r\n for j in range(C):\r\n \r\n if newAr[i][j] =='':\r\n found=True\r\n break;\r\n if found==False:\r\n for j in range(C):\r\n newAr[i][j]=\"-\"\r\n else:\r\n break;\r\n \r\nfound=False\r\nfor i in range(R-1,-1,-1):\r\n for j in range(C):\r\n if newAr[i][j] =='':\r\n found=True\r\n break;\r\n if found==False:\r\n for j in range(C):\r\n newAr[i][j]=\"-\"\r\n else:\r\n break;\r\n\r\n \r\n\r\n\r\n\r\nfound=False\r\nfor i in range(C):\r\n for j in range(R):\r\n \r\n if newAr[j][i] =='':\r\n found=True\r\n break;\r\n if found==False:\r\n for j in range(R):\r\n newAr[j][i]=\"-\"\r\n else:\r\n break;\r\n \r\nfound=False\r\nfor i in range(C-1,-1,-1):\r\n for j in range(R):\r\n if newAr[j][i] =='':\r\n found=True\r\n break;\r\n if found==False:\r\n for j in range(R):\r\n newAr[j][i]=\"-\"\r\n else:\r\n break;\r\n\r\nprintArr(newAr)\r\n\r\n\r\n\r\n", "n,m = map(int, input().split())\r\ndata = []\r\n\r\nfor _ in range(n):\r\n data.append(list(input()))\r\n\r\nL,R = 100000, -1\r\nU,D = 100000, -1\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if data[i][j]=='':\r\n if j<L: L = j\r\n if j>R: R = j\r\n if i<U: U = i\r\n if i>D: D = i\r\n\r\nfor i in range(U,D+1):\r\n for j in range(L,R+1):\r\n print(data[i][j], end='')\r\n print()", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import \r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\n\r\nn, m = map(int, input().split())\r\na = 60\r\nb = 0\r\nl = []\r\nf = False\r\nt = []\r\nfor i in range(n):\r\n s = input()\r\n l.append(s)\r\n if '' in s:\r\n t.append(i)\r\n a = min(a, s.find(''))\r\n b = max(b, s.rfind(''))\r\nfor i in l[t[0]:t[-1] + 1]:\r\n print(i[a:b+1])\r\n", "(lines, columns) = map(int, input().split(' '))\nsheets = []\nmargin_left = columns\nmargin_right = 0\nlines_include_information = []\nfor i in range(lines):\n sheet = input()\n sheets.append(sheet)\n count_asterisks = 0\n for j in range(columns):\n if sheet[j] == '':\n count_asterisks += 1\n if j < margin_left:\n margin_left = j\n if j > margin_right:\n margin_right = j\n\n if count_asterisks > 0:\n lines_include_information.append(i)\n\nfor i in range(lines_include_information[0], lines_include_information[-1] + 1):\n print(sheets[i][margin_left:margin_right + 1])\n\n\n\n", "import sys\r\n\r\n#sys.stdin = open(\"1.in\", \"r\")\r\n\r\nn, m = map(int, input().split())\r\n\r\n# 初始化左上角和右下角的坐标\r\nleft = m\r\ntop = n\r\nright = 0\r\nbottom = 0\r\n\r\n# 遍历每个格子，找到左上角和右下角的坐标\r\ngrid = []\r\nfor i in range(n):\r\n row = input()\r\n grid.append(row)\r\n for j in range(m):\r\n if row[j] == '':\r\n left = min(left, j)\r\n top = min(top, i)\r\n right = max(right, j)\r\n bottom = max(bottom, i)\r\n\r\nfor r in range(top, bottom+1):\r\n for c in range(left, right+1):\r\n print(grid[r][c], sep='', end='')\r\n print('')\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m = map(int,input().split())\nst = m \nend = 0\narr = []\nfirst = -1\nlast = -1\nf = True\nfor j in range(n):\n s = input()\n arr.append(s)\n if '' in s:\n if f:\n first = j\n f = False\n last = j \n else:\n continue\n \n a = -1\n b = -1\n for i in range(m):\n if s[i]=='':\n if a==-1:\n a = i\n b = i\n if b!=-1: \n st = min(st,a)\n end = max(end,b)\n \nnew = []\nfor i in range(first,last+1):\n print(arr[i][st:end+1])\n ", "n, m = map(int, input().split())\r\nl = []\r\ns = set()\r\nfor _ in range(n):\r\n a = input()\r\n s.add(a.find(''))\r\n s.add(a.rfind(''))\r\n if '' in a:\r\n l.append(a)\r\n elif len(l) != 0:\r\n l.append(a)\r\nwhile True:\r\n if '' not in l[-1]:\r\n del l[-1]\r\n else:\r\n break\r\nif -1 in s:\r\n s.remove(-1)\r\ns = sorted(s)\r\nx = s[0]\r\ny = s[-1]\r\nfor i in l:\r\n print(i[x:y + 1])", "n, m = map(int, input().split())\r\nl = [input() for i in range(n)]\r\ni1 = n - 1\r\ni2 = 0\r\nj1 = m - 1\r\nj2 = 0\r\nfor i in range(n):\r\n if (l[i].find('') != -1):\r\n i1 = min(i1, i)\r\n i2 = max(i2, i)\r\n j1 = min(j1, l[i].find(''))\r\n j2 = max(j2, l[i].rfind(''))\r\nfor i in range(i1, i2 + 1):\r\n print(l[i][j1:j2 + 1])", "n,m=list(map(int,input().split()))\r\na=[]\r\nb=-1\r\nc=-1\r\nd=-1\r\ne=-1\r\nfor i in range(n):\r\n a.append(input())\r\n for j in range(m):\r\n if a[i][j]=='':\r\n if d==-1 or j<d:\r\n d=j\r\n if e==-1 or j>e:\r\n e=j\r\n c=i\r\n if b==-1:\r\n b=i\r\na=a[b:c+1]\r\nfor i in range(c+1-b):\r\n a[i]=a[i][d:e+1]\r\n print(a[i])", "import abc\r\nimport itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n\r\n f = []\r\n x1, y1, x2, y2 = 1 << 60, 1 << 60, 0, 0\r\n for i in range(n):\r\n s = str(input())\r\n for j in range(m):\r\n if s[j] == \"\":\r\n x1 = min(x1, j)\r\n y1 = min(y1, i)\r\n x2 = max(x2, j)\r\n y2 = max(y2, i)\r\n f.append(s)\r\n\r\n for i in range(y1, y2 + 1):\r\n for j in range(x1, x2 + 1):\r\n print(f[i][j], end=\"\")\r\n print()\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "n,m = map(int,input().split(' ')) # citim nr de randuri si nr de caractere\r\nr = []\r\nfor i in range(n):\r\n row = list(input()) # randul se salveaza ca o lista de caractere\r\n r.append(row) # in list r\r\n\r\nfirst = []\r\nlast = []\r\nf_row = []\r\n\r\nfor i in range(len(r)):\r\n for j in range(len(r[i])):\r\n # determinam prima si ultima pozitie a semnului \r\n if r[i][j] == '':\r\n f_row.append(i) # lista pentru randuri\r\n first.append(j) # lista pt start si end in index in rand\r\n\r\n\r\nfirst_index = min(first) # start index pentru fiecare rand\r\nlast_index = max(first) # end index pentru fiecare rand\r\n\r\nf_row_idx = min(f_row) # incepem de la randul acesta\r\nl_row_idx = max(f_row) # pana la ultimul rand\r\n\r\nfor i in range(f_row_idx, l_row_idx+1):\r\n for j in range(first_index, last_index+1):\r\n print(r[i][j], end='')\r\n print()\r\n", "\r\nn, m = map(int, input().split())\r\n\r\nl = []\r\nfor _ in range(n):\r\n\tl.append(list(input()))\r\n\r\n\r\nfor _ in range(len(l)):\r\n\tif len(set(l[0])) == 1 and l[0][0] == '.':\r\n\t\tl.pop(0)\r\n\telse:\r\n\t\tbreak\r\n\r\nfor _ in range(len(l)):\r\n\tif len(set(l[-1])) == 1 and l[-1][0] == '.':\r\n\t\tl.pop()\r\n\telse:\r\n\t\tbreak\r\n\r\n\r\nfor _ in range(m):\r\n\tli = set()\r\n\tfor i in range(len(l)):\r\n\t\tli.add(l[i][0])\r\n\r\n\tif len(li) == 1 and '.' in li:\r\n\t\tfor i in range(len(l)):\r\n\t\t\tl[i].pop(0)\r\n\r\n\telse:\r\n\t\tbreak\r\n\r\n\r\nfor _ in range(len(l[0])):\r\n\tli = set()\r\n\tfor i in range(len(l)):\r\n\t\tli.add(l[i][-1])\r\n\r\n\tif len(li) == 1 and '.' in li:\r\n\t\tfor i in range(len(l)):\r\n\t\t\tl[i].pop()\r\n\r\n\telse:\r\n\t\tbreak\r\n\r\n\r\nfor i in l:\r\n\tprint(i, sep = '')", "n, m = [int(x) for x in input().split()]\na = []\nfor i in range(n):\n\ta.append(input())\nwhile '' not in a[0]:\n\ta.pop(0)\nwhile '' not in a[-1]:\n\ta.pop(-1)\nn = len(a)\nwhile '' not in (x[0] for x in a):\n\tfor i in range(n):\n\t\ta[i] = a[i][1: ]\nwhile '' not in (x[-1] for x in a):\n\tfor i in range(n):\n\t\ta[i] = a[i][: -1]\nprint('\\n'.join(a))\n", "row, col = [int(x) for x in input().split()]\r\nrects = []\r\nstar_rows = ''\r\nfirst_col, last_col = col, 0\r\nfor i in range(row):\r\n curr = input()\r\n rects.append(curr)\r\n if \"\" in curr:\r\n star_rows += \"\"\r\n if curr.index(\"\") < first_col:\r\n first_col = curr.find(\"\")\r\n if curr.rindex(\"\") > last_col:\r\n last_col = curr.rfind(\"\")\r\n else:\r\n star_rows += \".\"\r\n\r\nfirst_row, last_row = star_rows.index(\"\"), star_rows.rindex(\"\")\r\nfor i in rects[first_row: last_row + 1]:\r\n print(i[first_col:last_col+1])", "n, m = map(int, input().split())\r\nsheet = [list(input()) for _ in range(n)]\r\n\r\n# Initialize variables to store the minimum and maximum row and column indices of shaded squares.\r\nmin_row, max_row, min_col, max_col = n, -1, m, -1\r\n\r\n# Iterate through the sheet to find the boundaries of the shaded area.\r\nfor i in range(n):\r\n for j in range(m):\r\n if sheet[i][j] == '':\r\n min_row = min(min_row, i)\r\n max_row = max(max_row, i)\r\n min_col = min(min_col, j)\r\n max_col = max(max_col, j)\r\n\r\n# Print the minimum cost rectangle containing all shaded squares.\r\nfor i in range(min_row, max_row + 1):\r\n for j in range(min_col, max_col + 1):\r\n print(sheet[i][j], end='')\r\n print() # Move to the next row\r\n\r\n", "def main() -> None:\r\n n, m = map(int, input().split())\r\n max_ij = [-1, -1]\r\n min_ij = [n, m]\r\n a = []\r\n for i in range(n):\r\n s = input()\r\n a.append([c for c in s])\r\n for i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '':\r\n min_ij[0] = min(min_ij[0], i)\r\n min_ij[1] = min(min_ij[1], j)\r\n max_ij[0] = max(max_ij[0], i)\r\n max_ij[1] = max(max_ij[1], j)\r\n for i in range(min_ij[0], max_ij[0] + 1):\r\n for j in range(min_ij[1], max_ij[1] + 1):\r\n print(a[i][j], end='')\r\n print()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m = map(int, input().split())\r\ngrid = [input() for _ in range(n)]\r\n\r\nmin_row, max_row, min_col, max_col = n, -1, m, -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '':\r\n min_row = min(min_row, i)\r\n max_row = max(max_row, i)\r\n min_col = min(min_col, j)\r\n max_col = max(max_col, j)\r\n\r\nfor i in range(min_row, max_row + 1):\r\n print(grid[i][min_col:max_col + 1])", "n,m=map(int,input().split())\r\nk=[]\r\nfor i in range(n):\r\n k.append(input())\r\nstrow=[]\r\nstcol=[]\r\nfor i in range(n):\r\n if \"\" in k[i]:\r\n strow.append(i)\r\n stcol.append(k[i].find(\"\"))\r\n stcol.append(k[i].rfind(\"\"))\r\nsrow=min(strow)\r\nerow=max(strow)\r\nscol=min(stcol)\r\necol=max(stcol)+1\r\nfor i in range(n):\r\n if i>=srow and i<=erow:\r\n print(k[i][scol:ecol])\r\n\r\n \r\n", "def get_index(piece):\r\n start_assigned = False\r\n start = 1018\r\n end = 0\r\n for i, val in enumerate(piece):\r\n if val == '' and not start_assigned:\r\n start = i\r\n end = i\r\n start_assigned = True\r\n elif val == '':\r\n end = i\r\n return (start, end)\r\n\r\n\r\nm, n = map(int, input().split())\r\nart = []\r\n\r\nstart_min = mn\r\nend_max = 0\r\ninitial_start = 0\r\ninitial_start_assigned = False\r\ninitial_end = 0\r\n\r\nfor _ in range(m):\r\n piece = input()\r\n if '' in piece and not initial_start_assigned:\r\n initial_start = _ \r\n initial_end = _\r\n initial_start_assigned = True\r\n elif '' in piece:\r\n initial_end = _\r\n start, end = get_index(piece)\r\n start_min = min(start_min, start)\r\n end_max = max(end_max, end)\r\n art.append(piece)\r\n\r\nfor idx, piece in enumerate(art):\r\n small_piece = piece[start_min:end_max+1]\r\n if idx >= initial_start and idx <= initial_end:\r\n print(small_piece)\r\n", "\r\nn, m = map(int, input().split())\r\nmatr = []\r\nfor _ in range(n):\r\n matr += [input()]\r\nlt = [n, m]\r\nrb = [0, 0]\r\nfor i in range(n):\r\n for j in range(m):\r\n if matr[i][j] == '':\r\n lt = list(map(min, lt, [i, j]))\r\n rb = list(map(max, rb, [i+1, j+1]))\r\n\r\nfor i in range(lt[0], rb[0]):\r\n for j in range(lt[1], rb[1]):\r\n print(matr[i][j], end='')\r\n\r\n print()\r\n", "n, m = map(int, input().split())\nlinhas = [input() for i in range(n)]\n\ni_l = 0\ni_c = 0\nf_l = 0\nf_c = 0\n\nfor i in range(n):\n\tif linhas[i] != '.' m:\n\t\ti_l = i\n\t\tbreak\n\nfor i in range(n):\n\tif linhas[n-i-1] != '.' * m:\n\t\tf_l = n-i-1\n\t\tbreak\n\naux = [''.join(c) for c in zip(linhas)]\nfor i in range(m):\n\tif aux[i] != '.' n:\n\t\ti_c = i\n\t\tbreak\n\nfor i in range(m):\n\tif aux[m-i-1] != '.' * n:\n\t\tf_c = m-i-1\n\t\tbreak\n\nlinhas = linhas[i_l:f_l+1]\n\n\nfor linha in linhas:\n\tl = linha[i_c:f_c+1]\n\tprint(l)\n\n", "n, m = (int(i) for i in input().split())\ns = [[c for c in input()] for _ in range(n)]\nmin_r, max_r, min_c, max_c = n, -1, m, -1\nfor r in range(n):\n for c in range(m):\n if s[r][c] == \"\":\n min_r, max_r = min(min_r, r), max(max_r, r)\n min_c, max_c = min(min_c, c), max(max_c, c)\nres = \"\\n\".join(\"\".join(r[min_c:max_c + 1]) for r in s[min_r:max_r + 1])\nprint(res)\n", "n, m = map(int, input().split())\r\nstr_arr = list()\r\nfor i in range(n):\r\n string = input()\r\n str_arr.append(string)\r\n\r\ni_arr = []\r\n\r\nfor i in range(n):\r\n if \"\" in str_arr[i]:\r\n i_arr.append(i)\r\n\r\ni_min = min(i_arr)\r\ni_max = max(i_arr)\r\n\r\nmin_j = str_arr[i_min].find(\"\")\r\ntmp_index = 0\r\nfor i in range(n):\r\n tmp_index = str_arr[i].find(\"\")\r\n if tmp_index < min_j and tmp_index != -1:\r\n min_j = tmp_index\r\n\r\nmax_j = str_arr[i_max].rfind(\"\")\r\ntmp_index = 0\r\nfor i in range(n):\r\n tmp_index = str_arr[i].rfind(\"\")\r\n if tmp_index != -1 and tmp_index > max_j:\r\n max_j = tmp_index\r\n\r\nfor i in range(i_min, i_max+1):\r\n for j in range(min_j, max_j+1):\r\n print(str_arr[i][j], end='')\r\n print()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = [int(x) for x in input().strip().split(' ')]\r\ndrawing = []\r\ncoords = []\r\n\r\nfor i in range(n):\r\n line = input()\r\n tmp = []\r\n for j in range(m):\r\n if line[j] == \"\":\r\n tmp.append(j)\r\n coords.append(tmp)\r\n drawing.append(line)\r\n\r\ntop = n\r\nbottom = 0\r\nleft = min([x[0] for x in coords if x])\r\nright = max([x[-1] for x in coords if x])\r\n\r\nfor i in range(n):\r\n if coords[i]:\r\n top = i\r\n break\r\nfor i in range(n-1, -1, -1):\r\n if coords[i]:\r\n bottom = i\r\n break\r\n\r\nfor i in range(top, bottom+1):\r\n tmp = \"\"\r\n for j in range(left, right+1):\r\n tmp += drawing[i][j]\r\n print(tmp)\r\n", "def find_the_row_from_top(l):\r\n for i in range(len(l)):\r\n for j in range(len(l[i])):\r\n if l[i][j] == \"\":\r\n return i\r\n\r\n\r\ndef find_the_row_from_bottom(l):\r\n for k in range(len(l)):\r\n i = len(l) - 1 - k\r\n for j in range(len(l[i])):\r\n if l[i][j] == \"\":\r\n return i\r\n\r\ndef find_the_column_from_right(l):\r\n for i in range(len(l[0])):\r\n for j in range(len(l)):\r\n if l[j][i] == \"\":\r\n return i\r\n\r\ndef find_the_column_from_left(l):\r\n for i in range(len(l[0])):\r\n k = len(l[0]) - 1 - i\r\n for j in range(len(l)):\r\n if l[j][k] == \"\":\r\n return k\r\n\r\n\r\n\r\ndef main_function():\r\n input_list = [input() for i in range([int(i) for i in input().split(\" \")][0])]\r\n min_row = 1000000000\r\n max_row = 0\r\n min_column = 100000000\r\n max_column = 0\r\n for i in range(len(input_list)):\r\n for j in range(len(input_list[i])):\r\n if input_list[i][j] == \"\":\r\n if i > max_row:\r\n max_row = i\r\n if i < min_row:\r\n min_row = i\r\n if j > max_column:\r\n max_column = j\r\n if j < min_column:\r\n min_column = j\r\n output_list = []\r\n for i in range(min_row, max_row + 1):\r\n output_list.append(input_list[i][min_column: max_column + 1])\r\n return \"\\n\".join(output_list)\r\n\r\n\r\n\r\nprint(main_function())\r\n", "__author__ = 'Obriel Muga'\r\n\r\nif __name__ == '__main__':\r\n lista = []\r\n filas,columnas = list(map(int,input().strip().split()))\r\n UL = False\r\n DU = False\r\n IZQ = 10000000000000\r\n DER = -1000000000000\r\n for i in range(filas):\r\n linea = input()\r\n if (UL):\r\n lista.append(linea)\r\n elif (not UL and '' in linea):\r\n lista.append(linea)\r\n UL = True\r\n for i in range(len(lista) - 1, -1,-1):\r\n if (\"\" not in lista[i]):\r\n del lista[i]\r\n else:\r\n break\r\n for valor in lista:\r\n a = valor.find('')\r\n b = valor.rfind('')\r\n if (a >= 0 and a <= IZQ):\r\n IZQ = a\r\n if (b >= 0 and b >= DER):\r\n DER = b\r\n for i in lista:\r\n print(i[IZQ:DER+1])\r\n \r\n \r\n \r\n", "n,m = map(int,input().split())\r\nletter = []\r\nindex = []\r\n\r\nfor i in range(n):\r\n line_0 = list(input())\r\n letter.append(line_0)\r\nfor i in range(n):\r\n for j in range(len(letter[i])):\r\n if letter[i][j] == '':\r\n index.append(j)\r\n break\r\n\r\nstandard_indentation_front = min(index)\r\n\r\nindex = []\r\nfor i in range(n):\r\n for j in range(len(letter[i])-1,-1,-1):\r\n if letter[i][j] == '':\r\n index.append(j+1)\r\n break\r\n\r\nstandard_indentation_back = max(index)\r\n\r\n\r\n\r\n\r\nwhile letter[0].count('.') == len(letter[0]):\r\n del letter[0]\r\nwhile letter[-1].count('.') == len(letter[-1]):\r\n del letter[-1]\r\n\r\n\r\n\r\n\r\n\r\nfor i in range(len(letter)):\r\n for j in range(standard_indentation_front):\r\n letter[i][j] = ''\r\nfor i in range(len(letter)):\r\n for j in range(standard_indentation_back,len(letter[i])):\r\n letter[i][j] = ''\r\n \r\n \r\n \r\n \r\nletter_print = []\r\nfor i in range(len(letter)):\r\n letter_print = ''.join(letter[i])\r\n for j in letter_print:\r\n print(j,end = '')\r\n print()", "rows, columns = [int(item) for item in input().split()]\r\ntop, bottom, left, right = -1, 0, 50, 0\r\ncont = []\r\nfor i in range(rows):\r\n s = input()\r\n if '' in s:\r\n fIndex = s.index('')\r\n if top == -1:\r\n top = i\r\n if fIndex < left:\r\n left = fIndex\r\n lIndex = s.rindex('')\r\n if lIndex > right:\r\n right = lIndex\r\n bottom = i\r\n cont.append(s)\r\n\r\nfor i in range(top, bottom + 1):\r\n print(cont[i][left: right + 1])\r\n\r\n'''\r\ntop = 2\r\nbottom = 5\r\nleft = 0\r\nright = 9\r\n\r\n01234567\r\n89\r\n0..........\r\n1..........\r\n2..... ...\r\n3... .....\r\n4..........\r\n5.... .....\r\n6..........\r\n7..........\r\n\r\n *\r\n'''\r\n", "def readln(): return tuple(map(int, input().split()))\r\n \r\nn, m = readln()\r\np = [input() for _ in range(n)]\r\nwhile p[0] == '.' m:\r\n p = p[1:]\r\nwhile p[-1] == '.' * m:\r\n p.pop()\r\npref = min([_.split('')[0] for _ in p])\r\nsuf = min([_.split('')[-1] for _ in p])\r\nfor _ in p:\r\n print(_[len(pref):m - len(suf)])", "n, m = map(int, input().split())\r\ns = [input() for _ in range(n)]\r\na = c = 100\r\nb = d = -1\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif s[i][j]=='':\r\n\t\t\ta = min(a, i)\r\n\t\t\tb = max(b, i)\r\n\t\t\tc = min(c, j)\r\n\t\t\td = max(d, j)\r\nprint([x[c:d+1]for x in s[a:b+1]], sep = '\\n')", "n, m = map(int, input().split())\r\nls = [input() for i in range(n)]\r\nst1=0;st2=n-1\r\nfor i in range(n):\r\n if ls[i].count('')!=0:\r\n st1 = i\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if ls[i].count('')!=0:\r\n st2 = i\r\n break\r\npos1 = min([i.find('') for i in ls if i.count('')!=0])\r\npos2 = max([i.rfind('') for i in ls if i.count('')!=0])\r\nfor i in ls[st1:st2+1]:\r\n print(i[pos1:pos2+1],sep='')", "a, b = map(int, input().split())\r\nbase = []\r\ntrack = []\r\ntrack1 = []\r\nans = []\r\ncount = 0\r\nfor t in range(a):\r\n row = input()\r\n base.append(row)\r\nfor i in range(len(base)):\r\n if '' in base[i]:\r\n track1.append(i)\r\n for e in range(len(base[i])):\r\n if base[i][e] == '':\r\n track.append(e)\r\nx, y = min(track), max(track)\r\nc, v = min(track1), max(track1)\r\nwhile c <= v:\r\n ans.append(base[c][x:y+1])\r\n c += 1\r\nfor i in ans:\r\n final = ''.join(i)\r\n print(final)\r\n\r\n", "m, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\n\r\nlst = []\r\nfor i in range(m):\r\n lst.append(input())\r\n\r\nrl = []\r\nfor i in range(m):\r\n if '' in lst[i]:\r\n rl.append(i)\r\n\r\ncl = []\r\nfor j in range(n):\r\n count = 0\r\n for i in range(m):\r\n if lst[i][j] == '':\r\n count += 1\r\n break\r\n if count != 0:\r\n cl.append(j)\r\n\r\nfor i in range(min(rl), max(rl)+1):\r\n for j in range(min(cl), max(cl)+1):\r\n print(lst[i][j], end='')\r\n\r\n print()\r\n", "a,b = list(map(int,input().split()))\r\nspis = []\r\nkoords = []#y1 y2 x1 x2\r\nkoords2 = []#x1 x2\r\nwhile True:\r\n try:\r\n spis += [list(input())]\r\n except:\r\n break\r\n#корды идут от 0\r\ni = 0\r\ni2 = 0\r\nwhile i < a:\r\n while i2 < b:\r\n if spis[i][i2] == \"\":\r\n koords += [i]\r\n koords2 += [i2]\r\n i2 += 1\r\n i2 = 0\r\n i += 1\r\nkoords2 = sorted(koords2)\r\n\r\nkoords = [koords[0]] + [koords[-1]] + [koords2[0]] + [koords2[-1]]\r\n\r\ni = koords[0]\r\ni2 = koords[2]\r\nwhile i <= koords[1]:\r\n while i2 <= koords[3]:\r\n print(spis[i][i2],end=\"\")\r\n i2 += 1\r\n print()\r\n i2 = koords[2]\r\n i += 1", "linhas, cols = input().split()\nlinhas = int(linhas)\nret = []\nflg_linha = True\nini_cima = 0\nini_baixo = 0\nini_esq = None\nini_dir = None\n\nfor linha in range(linhas):\n linha_valores = input()\n ret.append(linha_valores)\n if flg_linha:\n if '' not in linha_valores:\n ini_cima += 1\n else:\n flg_linha = False\n esq = len(linha_valores) - len(linha_valores.lstrip('.'))\n dire = len(linha_valores) - len(linha_valores.rstrip('.'))\n if ini_esq != None:\n ini_esq = min(esq, ini_esq)\n else:\n ini_esq = esq\n if ini_dir != None:\n ini_dir = min(dire, ini_dir)\n else:\n ini_dir = dire\n else:\n if '' not in linha_valores:\n ini_baixo += 1\n else:\n ini_baixo = 0\n esq = len(linha_valores) - len(''.join(linha_valores).lstrip('.'))\n dire = len(linha_valores) - len(''.join(linha_valores).rstrip('.'))\n if ini_esq != None:\n ini_esq = min(esq, ini_esq)\n else:\n ini_esq = esq\n if ini_dir != None:\n ini_dir = min(dire, ini_dir)\n else:\n ini_dir = dire\n\nif ini_cima:\n ret = ret[ini_cima:]\nif ini_baixo:\n ret = ret[:-ini_baixo]\nfor n in ret:\n if ini_esq:\n n = n[ini_esq:]\n if ini_dir:\n n = n[:-ini_dir]\n print(n)\n \t \t \t \t \t\t\t\t \t \t\t\t", "n, m = map(int, input().split())\r\n\r\na = []\r\nb = []\r\nd = []\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == '':\r\n a.append(i)\r\n b.append(j)\r\n d.append(s)\r\n\r\nb.sort()\r\nfor i in range(a[0], a[-1]+1):\r\n print(d[i][b[0]:b[-1]+1])", "n,m=map(int,input().split())\r\nmat=[]\r\n\r\nfor _ in range(n):\r\n s=input()\r\n a=list(s)\r\n mat.append(a)\r\nmiX=n\r\nmaX=-1\r\nmiY=m\r\nmaY=-1\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if(mat[i][j]==''):\r\n miX=min(miX,i)\r\n maX=max(maX,i)\r\n miY=min(miY,j)\r\n maY=max(maY,j)\r\nfor i in range(miX,maX+1):\r\n for j in range(miY,maY+1):\r\n print(mat[i][j],end=\"\")\r\n print(end=\"\\n\")\r\n \r\n", "def solve(n):\r\n print(([1] * n))\r\nn, m = map(int, input().split())\r\nx = []\r\nfor _ in range(n): x += [list(input())]\r\nminx, maxx, miny, maxy = n, -1, m, -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if x[i][j] == '':\r\n minx = min(minx, i)\r\n maxx = max(maxx, i)\r\n miny = min(miny, j)\r\n maxy = max(maxy, j)\r\nfor i in range(minx, maxx + 1):\r\n print(x[i][miny:maxy + 1], sep='')\r\n ", "def find_shaded_rectangle(n, m, sheet):\r\n top, left = n, m # Initialize top-left coordinate to maximum values\r\n bottom, right = 0, 0 # Initialize bottom-right coordinate to minimum values\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if sheet[i][j] == '':\r\n top = min(top, i)\r\n left = min(left, j)\r\n bottom = max(bottom, i)\r\n right = max(right, j)\r\n\r\n # Extract the shaded rectangle from the original sheet\r\n shaded_rectangle = [sheet[i][left:right + 1] for i in range(top, bottom + 1)]\r\n\r\n return shaded_rectangle\r\n\r\n\r\n# Read input\r\nn, m = map(int, input().split())\r\nsheet = [input() for _ in range(n)]\r\n\r\n# Output the result\r\nresult = find_shaded_rectangle(n, m, sheet)\r\nfor row in result:\r\n print(row)\r\n", "n,m=map(int,input().split())\na=[input() for i in range(n)]\ntl_i,tl_j,br_i,br_j=110,110,0,0\nfor i in range(n):\n for j in range(m):\n if a[i][j]=='':\n tl_i=min(tl_i,i)\n tl_j=min(tl_j,j)\n br_i=max(br_i,i)\n br_j=max(br_j,j)\nfor i in range(tl_i,br_i+1):\n for j in range(tl_j,br_j+1):print(a[i][j],end='')\n print()", "m, n = map(int, input().split(\" \"))\r\ninp = []\r\nfor _ in range(m):\r\n inp.append(input())\r\n \r\nmini, maxi = m-1, 0\r\nminj, maxj = n-1, 0\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n if inp[i][j] == \"\":\r\n if (i < mini): mini = i\r\n if (i > maxi): maxi = i\r\n if (j < minj): minj = j\r\n if (j > maxj): maxj = j\r\n\r\nprint(\"\\n\".join([x[minj:(maxj+1)] for x in inp[mini:(maxi+1)]]))\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,m = map(int, wtf[0].split())\r\n ans = []\r\n mlid = 0\r\n mfid = 52\r\n sids = []\r\n for i in range(n):\r\n ans.append(wtf[i+1])\r\n if '' in wtf[i+1]:\r\n sids.append(i)\r\n for j in range(m):\r\n if wtf[i+1][j] == '*':\r\n if j < mfid:\r\n mfid = j\r\n if j > mlid:\r\n mlid = j\r\n n = len(ans)\r\n for i in range(sids[0], sids[-1]+1):\r\n print(ans[i][mfid:mlid+1])\r\n" ]	{"inputs": ["6 7\n.......\n..**..\n......\n..**..\n......\n..*..", "3 3\n\n.\n*", "1 1\n", "2 1\n\n", "5 1\n.\n\n.\n.\n.", "1 6\n***.", "2 2\n..\n.", "8 2\n..\n..\n..\n..\n..\n.\n..\n..", "50 1\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n\n.\n\n.\n.\n.\n.\n.\n.\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.", "2 1\n\n.", "5 1\n\n\n\n\n", "2 2\n.\n..", "3 4\n...\n...\n...", "8 2\n\n\n\n\n\n\n\n", "50 1\n.\n\n\n\n.\n.\n\n.\n\n\n\n\n\n\n\n.\n\n\n\n\n\n\n\n\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."], "outputs": ["**\n..\n**\n..\n*", "\n.\n*", "", "\n", "", "***", "", "", "\n.\n\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n", "", "\n\n\n\n", "", "...\n...\n...", "\n\n\n\n\n\n\n", "\n\n\n.\n.\n\n.\n\n\n\n\n\n\n\n.\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"]}	UNKNOWN	PYTHON3	CODEFORCES	218
8fc062d952d56f65554254a2fbe9f3e8	none	Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not. Petya loves long lucky numbers very much. He is interested in the minimum lucky number d that meets some condition. Let cnt(x) be the number of occurrences of number x in number d as a substring. For example, if d<==<=747747, then cnt(4)<==<=2, cnt(7)<==<=4, cnt(47)<==<=2, cnt(74)<==<=2. Petya wants the following condition to fulfil simultaneously: cnt(4)<==<=a1, cnt(7)<==<=a2, cnt(47)<==<=a3, cnt(74)<==<=a4. Petya is not interested in the occurrences of other numbers. Help him cope with this task. The single line contains four integers a1, a2, a3 and a4 (1<=≤<=a1,<=a2,<=a3,<=a4<=≤<=106). On the single line print without leading zeroes the answer to the problem — the minimum lucky number d such, that cnt(4)<==<=a1, cnt(7)<==<=a2, cnt(47)<==<=a3, cnt(74)<==<=a4. If such number does not exist, print the single number "-1" (without the quotes). Sample Input 2 2 1 1 4 7 3 1 Sample Output 4774 -1	[ "a1, a2, a3, a4 = map(int, input().split()) \r\nif a3 == a4 - 1:\r\n if a1 < a4 or a2 < a4:\r\n print(-1)\r\n elif a4 == 1:\r\n print('7' * a2 + '4' * a1)\r\n else:\r\n result = '7' + '4' * (a1 - a4 + 1) + '74' * (a4 - 2) + '7' * (a2 - a4 + 1) + '4'\r\n print(result) \r\nelif a3 == a4:\r\n if a1 < a4 or a2 < a4 or (a1 == a4 and a2 == a4):\r\n print(-1)\r\n elif a1 == a4:\r\n result = '74' * a4 + '7' * (a2 - a4)\r\n print(result)\r\n else:\r\n result = '4' * (a1 - a4) + '74' * (a4 - 1) + '7' * (a2 - a4 + 1) + '4'\r\n print(result)\r\nelif a3 == a4 + 1:\r\n if a1 < a3 or a2 < a3:\r\n print(-1)\r\n elif a3 == 1:\r\n result = '4' * a1 + '7' * a2\r\n print(result)\r\n else:\r\n result = '4' * (a1 - a3 + 1) + '7' + '47' * (a3 - 2) + '4' + '7' * (a2 - a3 + 1)\r\n print(result)\r\nelse:\r\n print(-1)# 1691429596.526085", "a, b, c, d = input().strip().split()\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nd = int(d)\r\n\r\nif abs(c - d) > 1 or min(a, b) < max(c, d) or a == b == c == d:\r\n print(-1)\r\n exit()\r\n\r\nif c == d:\r\n if a == c:\r\n ans = '74' * c + '7' * (b - c)\r\n else:\r\n ans = '4' * (a - c - 1) + '47' * c + '7' * (b - c) + '4'\r\nelif c > d:\r\n ans = '4' * (a - c) + '47' * c + '7' * (b - c)\r\nelse:\r\n ans = '7' + '4' * (a - c) + '74' * (c - 1) + '7' * (b - c) + '4'\r\n\r\nprint(ans)", "a1,a2,a3,a4=map(int,input().split())\n\nL=[]\ndef Solve(a1,a2,a3,a4):\n if(a3-a4<-1 or a3-a4>1 or a1<a3 or a1<a4 or a2<a3 or a2<a4):\n return -1\n\n elif(a3-a4==0):\n Ans=\"47\"a3\n Ans+=\"4\"\n if(a1-a3==0 and a2-a4==0):\n return -1\n elif(a1-a3==0):\n return \"74\"a3+\"7\"(a2-a4)\n return \"4\"(a1-a3-1)+Ans[:len(Ans)-1]+\"7\"(a2-a4)+\"4\"\n\n elif(a3-a4==1):\n if(a2==a4):\n return -1\n Ans=\"47\"a3\n Ans=\"4\"(a1-a3)+Ans+\"7\"(a2-a4-1)\n return Ans\n\n else:\n if(a3==a1):\n return -1\n Ans=\"74\"a4\n Ans=\"7\"+\"4\"(a1-a3-1)+Ans[1:len(Ans)-1]+\"7\"(a2-a4)+\"4\"\n return Ans\nprint(Solve(a1,a2,a3,a4))\n\n\n\n\n# Made By Mostafa_Khaled", "a1,a2,a3,a4=map(int,input().split())\r\nif abs(a3-a4)>1:\r\n print(-1)\r\nelif min(a1,a2)<max(a3,a4):\r\n print(-1)\r\nelif a1==a2==a3==a4:\r\n print(-1)\r\nelse:\r\n if a3==a4:\r\n if a1==a3:\r\n print ('74'a3+'7'(a2-a3))\r\n else:\r\n print('4'(a1-a3-1)+'47'a3+'7'(a2-a3)+'4')\r\n elif a3>a4:\r\n print('4'(a1-a3)+'47'a3+'7'(a2-a3))\r\n else:\r\n print('7'+'4'(a1-a3)+'74'(a3-1)+'7'(a2-a3)+'4')\r\n", "def s():\r\n a, b, c, d = map(int, input().split())\r\n if a == b == c == d or abs(c - d) > 1 or min(a, b) < max(c, d):print(-1);return\r\n if c == d: ans = '74'c+'7'(b - c) if a==c else '4'(a-c-1)+'47'c+'7'(b-c)+'4'\r\n elif c > d: ans = '4' (a - c) + '47' * c + '7' * (b - c)\r\n else: ans = '7' + '4' * (a - c) + '74' * (c-1) + '7' * (b - c) + '4'\r\n print(ans)\r\ns()\r\n", "import sys\n\na, b, c, d = map(int, sys.stdin.readline().split(' '))\n\nif c == d + 1:\n if a < c or b < c:\n print(-1)\n else:\n ans = '4' * (a - c) + \"47\" * c + '7' * (b - c)\n print (ans)\nelif c + 1 == d:\n if a < d or b < d:\n print(-1)\n else:\n ans = \"74\" * d\n ans = ans[0:1] + '4' * (a - d) + ans[1 : len(ans) - 1] + '7' * (b - d) + ans[len(ans) - 1 : len(ans)]\n print(ans)\nelif c == d:\n if a >= c + 1 and b >= c:\n ans = \"47\" * c + '4'\n ans = '4' * (a - (c + 1)) + ans[0 : len(ans) - 1] + '7' * (b - c) + ans[len(ans) - 1 : len(ans)]\n print(ans)\n elif a == c and b >= c + 1:\n ans = \"74\" * c + '7' + '7' * (b - (c + 1))\n print(ans)\n else:\n print(-1)\nelse:\n print(-1)\n\n\n" ]	{"inputs": ["2 2 1 1", "4 7 3 1", "4 7 4 7", "1 1 1 1", "2 2 1 2", "2 1 2 1", "2 2 2 1", "3 3 1 1", "3 2 1 2", "2 1 3 1", "7 7 1 1", "4 7 2 1", "3 3 2 2", "4 3 2 1", "4 4 2 2", "1000000 1000000 1 1", "1000000 1 1 1", "10 10 3 5", "10 10 3 7", "1 7 1 1", "8 3 2 1", "1000000 1000000 1000000 1000000", "4584 45854 25 685", "1 1 1 2", "3 1000000 3 1", "4 58458 2 1", "845 8549 54 8", "1000000 1000000 100000 100000", "1000000 1000000 499 500", "1000000 1000000 100000 100001", "845488 44884 9945 9944", "7 7 4 5", "7 8 5 4", "1000000 1000000 400000 400001", "4585 4588 98 99", "1000000 2 1 1", "2 100000 1 2", "86451 754 85 84", "98654 4844 1001 1000", "5 5 1 2", "5 5 2 1", "4 4 1 1", "4 4 2 2", "4 4 3 3", "10 9 4 5", "100 100 4 5", "1000000 1000000 1 2", "1000000 1000000 47 46", "1000000 1000000 999999 1000000", "54585 4584 458 954", "6 6 1 3", "6 6 2 3", "6 10 2 1", "7 3 1 1", "47 74 8 9", "458445 445 6 7", "1000000 1000000 10000 10001", "1000000 1000000 978 977", "7 1000 1 2", "1 10 1 1", "70 60 20 21", "57 59 3 4", "10 10 5 5", "69 84 25 24", "25 94 11 12", "1 1000000 4 5", "7 1000000 2 3", "1000000 1 1 1", "45 65 31 32", "31 32 30 31", "1 1000000 1 1", "2 1000000 1 1", "50000 1000000 1 1", "74544 1 1 1", "2 2 3 4", "1 1000 2 1", "1 10 1 2", "1000000 1000000 1000000 999999", "1 2 1 1", "2 1 1 1", "2 2 2 1", "2 2 2 2", "1 3 1 1", "1 4 1 1", "2 3 2 2", "2 5 2 2", "1 2 2 1", "10 100 2 2", "3 4 3 3", "30 30 29 29", "10 10 1 2", "999999 1000000 999999 999999", "10 11 1 1", "10 10 2 2", "100 200 5 5", "10 11 10 10", "5 10 2 3", "6 8 1 1", "1 9 2 2"], "outputs": ["4774", "-1", "-1", "-1", "7474", "-1", "4747", "447774", "74474", "-1", "44444477777774", "44474777777", "474774", "4447477", "44747774", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "-1", "-1", "74777777", "44444447477", "-1", "-1", "-1", "-1", "4447477777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777...", "-1", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "74447474747774", "444747474747777", "7444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7477777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7444477774", "4444747777", "44477774", "44747774", "47474774", "7444444747474777774", "74444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444447474747777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777774", "7444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747...", "-1", "-1", "744447477774", "4444474777777777", "4444447774", "7444444444444444444444444444444444444444747474747474747777777777777777777777777777777777777777777777777777777777777777774", "7444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7444444777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777...", "74777777777", "7444444444444444444444444444444444444444444444444447474747474747474747474747474747474747477777777777777777777777777777777777777774", "74444444444444444444444444444444444444444444444444444447474777777777777777777777777777777777777777777777777777777774", "44444747474747777774", "444444444444444444444444444444444444444444444747474747474747474747474747474747474747474747474777777777777777777777777777777777777777777777777777777777777", "74444444444444474747474747474747474777777777777777777777777777777777777777777777777777777777777777777777777777777777774", "-1", "7444447477777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "74444444444444474747474747474747474747474747474747474747474747474747474747477777777777777777777777777777777774", "747474747474747474747474747474747474747474747474747474747474774", "7477777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777...", "4777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "-1", "-1", "-1", "4747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474...", "747", "474", "4747", "-1", "7477", "74777", "74747", "7474777", "-1", "44444444747777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777774", "7474747", "474747474747474747474747474747474747474747474747474747474774", "74444444447777777774", "7474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747...", "444444444777777777774", "44444444747777777774", "444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444447474747477777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777774", "747474747474747474747", "744474777777774", "44444777777774", "-1"]}	UNKNOWN	PYTHON3	CODEFORCES	6
8fca4ffe8f07d1e257b834639a4873d8	Hulk	Dr. Bruce Banner hates his enemies (like others don't). As we all know, he can barely talk when he turns into the incredible Hulk. That's why he asked you to help him to express his feelings. Hulk likes the Inception so much, and like that his feelings are complicated. They have n layers. The first layer is hate, second one is love, third one is hate and so on... For example if n<==<=1, then his feeling is "I hate it" or if n<==<=2 it's "I hate that I love it", and if n<==<=3 it's "I hate that I love that I hate it" and so on. Please help Dr. Banner. The only line of the input contains a single integer n (1<=≤<=n<=≤<=100) — the number of layers of love and hate. Print Dr.Banner's feeling in one line. Sample Input 1 2 3 Sample Output I hate it I hate that I love it I hate that I love that I hate it	[ "import sys\n\ndef inp():\n return int(input())\n\n\ndef inlt():\n return list(map(int, input().split()))\n\n\ndef insr():\n return input().strip()\n\n\ndef out(x):\n sys.stdout.write(str(x) + \"\\n\")\n\ndef main():\n count = inp()\n ans = \"\"\n \n feelings = [\" I love\", \" I hate\"] \n for i in range(1, count + 1):\n ans += feelings[i%2]\n if i < count:\n ans += \" that\" \n \n ans += \" it\"\n out(ans)\n \nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\nimport sys\r\ns = 'I hate '\r\ns2 = 'I love '\r\nss = ''\r\nif n == 1: print(s+\"it\"); sys.exit()\r\nfor i in range(n):\r\n if (i+1) % 2 == 1 and i != n-1:\r\n ss = ss + s + \"that \"\r\n elif (i+1) % 2 == 0 and i != n-1:\r\n ss = ss + s2 + \"that \"\r\n if (i+1) % 2 == 0 and i == n-1:\r\n ss = ss + s2 + \"it\"\r\n elif (i+1) % 2 == 1 and i == n-1:\r\n ss = ss + s + \"it\"\r\n\r\nprint(ss)", "n = int(input())\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n print('I hate', end=' ')\r\n else:\r\n print('I love', end=' ')\r\n\r\n if i == n - 1:\r\n print('it')\r\n else:\r\n print('that', end=' ')", "n=int(input())\r\nf=[]\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n f.append(\"I hate\")\r\n else:\r\n f.append(\"I love\")\r\n if i!=n:\r\n f.append(\"that\")\r\nf.append(\"it\")\r\nx=' '.join(f)\r\nprint(x)\r\n", "color = int(input())\r\nsentence = \"\"\r\n\r\nfor i in range(color):\r\n if i % 2 == 0:\r\n sentence += 'I hate that '\r\n else:\r\n sentence += 'I love that '\r\nsentence = sentence.split(' ')\r\nsentence[-2] = 'it '\r\nprint(' '.join(sentence))\r\n\r\n", "sentences = (['I hate', 'I love'] * 50)[:int(input())]\r\nprint(sentences, sep=' that ', end=' it')\r\n", "numero = int(input(\"\"))\r\nif numero>100 or numero<1:\r\n exit(1)\r\ni=1\r\ntexto = ''\r\nwhile i < numero:\r\n if i%2 != 0:\r\n texto = texto + 'I hate that '\r\n else:\r\n texto = texto + 'I love that '\r\n i = i + 1\r\nif i%2 !=0:\r\n texto = texto + 'I hate it'\r\nelse:\r\n texto = texto + 'I love it'\r\nprint(texto)", "n = int(input())\r\nwords = {1: 'I hate that', 0: 'I love that', 2: 'I love it', 3: 'I hate it'}\r\nresult = ''\r\nfor i in range(1, n + 1):\r\n if i != n:\r\n result += words[i % 2]\r\n result += ' '\r\n else:\r\n result += words[i % 2 + 2]\r\nprint(result)", "n = int(input())\r\nhulkf = []\r\nfor i in range(1,n+1):\r\n if i%2 == 1:\r\n hulkf.append('I hate') \r\n else:\r\n hulkf.append('I love') \r\nprint(f'{\" that \".join(hulkf)} it')", "a = int(input())\r\nres = \"\"\r\nb = \"I hate \"\r\nc = \"I love \"\r\nfor i in range(a):\r\n if i % 2 == 0:\r\n res += b\r\n else:\r\n res += c\r\n if i != a - 1:\r\n res += \"that \"\r\n else:\r\n res += \"it\"\r\nprint(res)\r\n", "n = int(input())\r\nstr = \"\"\r\ni = 1\r\nwhile i < n:\r\n if i % 2 != 0:\r\n print(\"I hate\",end=\" \")\r\n if i % 2 == 0:\r\n print(\"I love\",end=\" \")\r\n print(\"that\",end=\" \")\r\n i += 1\r\nif n % 2 == 0:\r\n print(\"I love it\")\r\nelse:\r\n print(\"I hate it\")\r\n", "p=int(input())\r\nf=[]\r\nfor i in range(1,p+1):\r\n if i%2==1:\r\n f.append(\"I hate\")\r\n else:\r\n f.append(\"I love\")\r\n if i!=p:\r\n f.append(\"that\")\r\nf.append(\"it\")\r\ndoc=' '.join(f)\r\nprint(doc)", "n = int(input()) \r\na = []\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n a.append(\"I hate\")\r\n else:\r\n a.append(\"I love\")\r\n if i < n - 1:\r\n a.append(\"that\")\r\na.append(\"it\")\r\nfinal = ' '.join(a)\r\n\r\nprint(final)\r\n ", "inp = int(input())\r\ns = 'I hate'\r\np = 'I love'\r\nres = \"\"\r\n#I hate that I love that I hate it\r\nfor i in range(inp):\r\n j = i+1\r\n if j%2 == 1:\r\n res = res+s+' that'+' '\r\n \r\n else:\r\n res =res+p+' that'+' '\r\nprint(res[0:len(res)-5] +'it')\r\n ", "from collections import Counter\r\nimport math\r\nN = int(input())\r\nls = []\r\nfor i in range(N):\r\n if i % 2 == 0:\r\n ls.append('I hate')\r\n else:\r\n ls.append('I love')\r\n\r\n\r\nprint(' that ' .join(ls) + ' it')\r\n", "n = int(input())\r\nspeech = 'I '\r\n\r\n\r\nfor i in range(n-1):\r\n if i%2==0:\r\n speech+='hate that I '\r\n else:\r\n speech+='love that I '\r\n\r\nprint(speech+'hate it' if n%2==1 else speech+'love it')\r\n\r\n ", "def hulk():\r\n n=int(input(''))\r\n i=1\r\n while i <= n:\r\n if i%2!=0:\r\n print('I hate',end=' ')\r\n else:\r\n print('I love',end=' ')\r\n if i<n:\r\n print('that',end=' ')\r\n if i==n:\r\n print('it')\r\n i+=1\r\nhulk()", "n = int(input())\r\ns = \"that I hate \"\r\nt = \"that I love \"\r\nm = \"I hate \"\r\nfor i in range(1,n):\r\n if i%2 == 0:\r\n m+=s \r\n else:\r\n m+=t\r\nprint(m + \"it\")", "l = int(input())\r\nif l == 1:\r\n st = \"I hate it\"\r\nelse:\r\n st = \"I hate that\"\r\n for i in range(1,l):\r\n if (i+1)%2==0:\r\n if (i)==l-1:\r\n st+=\" I love it\"\r\n else:\r\n st+=\" I love that\"\r\n else:\r\n if i==l-1:\r\n st+=\" I hate it\"\r\n else:\r\n st+=\" I hate that\"\r\nprint(st)", "n=int(input())\r\nd=\"\"\r\nif n==1:\r\n print(\"I hate it\")\r\nelif n==2:\r\n print(\"I hate that I love it\")\r\nelif n==3:\r\n print(\"I hate that I love that I hate it\")\r\nelse:\r\n d+=\"I hate that I love that \"\r\n for i in range(3,n):\r\n if i%2==0:\r\n d+=\"I love that \"\r\n else:\r\n d+=\"I hate that \"\r\n if n%2==0:\r\n d+=\"I love it\"\r\n else:\r\n d+=\"I hate it\"\r\nprint(d)", "n=int(input())\r\nif n==1:\r\n print('I hate it')\r\nelse:\r\n for k in range(n):\r\n if (k%2==0):\r\n print('I hate ',end='')\r\n else:\r\n print('I love ',end='')\r\n if (k!=n-1):\r\n print('that ',end='')\r\n else:\r\n print('it',end='')\r\n \r\n \r\n", "# Version 16.0\r\ndef main() -> None:\r\n # 2023-07-16 22:01:27\r\n n = ii()\r\n store = []\r\n idx = 0\r\n while idx < n:\r\n if idx % 2 == 0: store.append('I hate')\r\n else: store.append('I love')\r\n idx+=1\r\n ans = \" that \".join(store)\r\n p(f\"{ans+' it'}\")\r\n\r\n \r\nif __name__ == \"__main__\":\r\n import os,sys,math,itertools;from collections import deque,defaultdict,OrderedDict,Counter\r\n from bisect import bisect,bisect_left,bisect_right,insort\r\n from heapq import heapify,heappush,heappop,nsmallest,nlargest,heapreplace, heappushpop\r\n ii,si=lambda:int(input()),lambda:input() \r\n mi,msi=lambda:map(int,input().strip().split(\" \")),lambda:map(str,input().strip().split(\" \")) \r\n li,lsi=lambda:list(mi()),lambda:list(msi())\r\n out,export,p,pp=[],lambda:print('\\n'.join(map(str, out))),lambda x :out.append(x),lambda array:p(' '.join(map(str,array)))\r\n try:exec('from hq import L,LT,see,info,cmdIO,_generator_\\nline=[cmdIO(),main(),export(),_generator_()]\\nfor l in line:l')\r\n except(FileNotFoundError,ModuleNotFoundError):main();export()", "n=int(input())\r\ns=\"\"\r\nif n==1:\r\n s=\"I hate it\"\r\nelif n==2:\r\n s=\"I hate that I love it\"\r\nelse:\r\n for i in range(n):\r\n if i%2==0:\r\n s+=\"I hate \"\r\n else:\r\n s+=\"I love \"\r\n if i!=n-1:\r\n s+=\"that \"\r\n else:\r\n s+=\"it\"\r\nprint(s)", "import sys\r\ndef read_input():\r\n return sys.stdin.readline().rstrip()\r\nstr1 = \"I hate\"\r\nstr2 = \"I love\"\r\nnum1 = int(read_input())\r\noutput = []\r\nfor x in range(num1):\r\n if x % 2 == 0:\r\n output.append(str1)\r\n else:\r\n output.append(str2)\r\noutput[-1] += \" it\"\r\nprint(\" that \".join(output))\r\nimport sys", "n=int(input())\r\ns=\"I hate it\"\r\nx=\"I love it\"\r\nm=\"I hate that \"\r\nv=\"I love that \"\r\nif n==1:\r\n print(s)\r\n exit()\r\nelif n==2:\r\n print(m+x)\r\n exit()\r\nfor i in range(1,n+1):\r\n if i==n:\r\n if n%2==0:\r\n print(x,end=\"\")\r\n elif n%2!=0:\r\n print(s,end=\"\")\r\n exit()\r\n if i %2!=0:\r\n print(m,end=\"\")\r\n elif i%2==0:\r\n print(v,end=\"\")", "n= int(input())\r\nfor i in range(1,n):\r\n if(i%2!=0):\r\n print(\"I hate that \", end=\"\")\r\n if(i%2==0):\r\n print(\"I love that \", end=\"\")\r\nif(n%2!=0):\r\n print(\"I hate it\", end=\"\")\r\nif(n%2==0):\r\n print(\"I love it\", end=\"\")", "n = int(input())\r\nprint((\"I hate that I love that \" (n // 2) + \"I hate that \" * (n % 2))[:-5] + \"it\")", "n = int(input())\r\nlst1 = []\r\nfor i in range(n):\r\n if i % 2 != 0:\r\n lst1.append(\"I love\")\r\n else:\r\n lst1.append(\"I hate\")\r\ny = \" that \".join(lst1)\r\nprint(y, \"it\")", "n = int(input())\r\n\r\ndef message_hulk(n):\r\n message = []\r\n for i in range(1, n+1):\r\n if i%2!=0:\r\n message.append('I hate ')\r\n else:\r\n message.append('I love ')\r\n if i!=n:\r\n message.append('that ')\r\n message.append('it')\r\n return ''.join(message)\r\n\r\nprint(message_hulk(n))", "n=int(input())\r\nl=\"\"\r\nfor i in range(n-1):\r\n if(i%2==0):\r\n l=l+\"I hate that \"\r\n else:\r\n l=l+\"I love that \"\r\nif(n%2!=0):\r\n l=l+\"I hate it\"\r\nelse:\r\n l=l+\"I love it\"\r\nprint(l)", "\r\ndef solve():\r\n n = int(input())\r\n return \" \".join(\r\n list(\r\n map(lambda i: \"I hate it\" if i %\r\n 2 != 0 else \"I love it\", list(range(1, n+1)))\r\n )\r\n ).replace(\"it\", \"that\", n - 1)\r\n\r\n\r\nprint(solve())\r\n", "n=int(input())\r\ns=\"I hate \"\r\nfor i in range(0,n-1):\r\n if i%2==0:\r\n s=s+\"that I love \"\r\n else:\r\n s=s+\"that I hate \"\r\ns=s+\"it\"\r\nprint(s)", "cnt = int(input())\r\nx = 'I hate that'\r\nfor i in range (2, cnt+1):\r\n if i % 2 == 0:\r\n x += ' I love that'\r\n elif i % 2 != 0:\r\n x += ' I hate that'\r\nxzc = x[:-4] + 'it'\r\nprint(xzc)", "n = int(input())\r\n\r\nprint(\"I hate \", end =\"\")\r\n\r\nfor i in range(n-1):\r\n if i % 2 == 0: print(\"that I love \", end =\"\")\r\n else: print(\"that I hate \", end =\"\")\r\n\r\nprint(\"it\")\r\n", "n = int(input())\r\nst = \"\"\r\nif n == 1:\r\n print(\"I hate it\")\r\nelse:\r\n for i in range(1,n+1):\r\n if i % 2 == 0:\r\n st += \"love\"+\" that I \"\r\n else:\r\n st += \"hate\"+\" that I \"\r\n print(\"I \" + st[:-7] + \"it\")", "n = int(input())\r\n\r\nt = [\"that\",\"it\"]\r\n\r\nfor i in range(n):\r\n if i == n-1:\r\n tp = t[1]\r\n else:\r\n tp = t[0]\r\n if (i+1) % 2 == 0:\r\n print(\"I love \" + tp ,end = \" \")\r\n else:\r\n print(\"I hate \" + tp ,end = \" \")\r\n \r\n\r\n", "n = int(input())\r\na = 'I hate'\r\nb = 'I love'\r\nc = 'that'\r\ns = 'I hate'\r\nfor i in range(2,n+1):\r\n if i%2 != 0:\r\n s = s + \" \" + c + ' '+ a\r\n else:\r\n s = s + ' ' + c + ' '+b\r\nprint(s+ ' ' + 'it')", "n = int(input())\r\nfeelings = ['I hate' if i % 2 == 0 else 'I love' for i in range(n)]\r\nexpression = ' that '.join(feelings)\r\nprint(expression, end=' it')\r\n", "n = int(input())-1\r\na = \"I hate \"\r\nf = 1\r\nfor i in range(n):\r\n if f:\r\n a += \"that I love \"\r\n f = 0\r\n else:\r\n a += \"that I hate \"\r\n f = 1\r\na += \"it\"\r\nprint(a)\r\n\r\n", "n = int(input())\r\n\r\nh = 'I hate '\r\n\r\nl = 'I love '\r\n\r\nd1 = 'that '\r\n\r\nd2 = 'it'\r\n\r\narr = []\r\n\r\nfor i in range(n):\r\n\r\n if i % 2 == 0:\r\n \r\n arr.append(h)\r\n \r\n else:\r\n \r\n arr.append(l)\r\n \r\n if i < n-1: \r\n arr.append(d1)\r\n \r\narr.append(d2) \r\n\r\nprint(''.join(arr))", "# LUOGU_RID: 113687866\ndef main():\r\n n=int(input())\r\n print('I hate ',end='')\r\n for i in range(1,n):\r\n if i&1:\r\n print('that I love ',end='')\r\n else:\r\n print('that I hate ',end='')\r\n print('it')\r\nmain()", "a = int(input(''))\r\n\r\nresult = ''\r\n\r\nfor j in range(a):\r\n if j%2 == 0:\r\n result = result + 'I hate '\r\n if j != a-1:\r\n result = result + 'that '\r\n else:\r\n result = result + 'I love '\r\n if j != a-1:\r\n result = result + 'that '\r\n\r\n if j == a-1:\r\n result = result + 'it'\r\n\r\n\r\nprint(result)\r\n", "n=int(input())\r\nif n%2==0:\r\n\tn//=2\r\n\ts=\" that \".join(i for i in [\"I hate that I love\"]n)\r\nelif n%2==1 and n>1:\r\n\tn//=2\r\n\ts=\" that \".join(i for i in [\"I hate that I love\"]n)+\" that I hate\"\r\nelse: \r\n\ts=\"I hate\"\r\n\r\nprint(s+\" it\")\r\n", "N = int(input())\r\nM = []\r\nfor i in range(1, N+1):\r\n if(i%2==1):\r\n M.append(\"I hate\")\r\n else:\r\n M.append(\"I love\")\r\n if(i!=N):\r\n M.append(\"that\")\r\nM.append(\"it\")\r\nprint(\" \".join(M))", "def solve():\r\n k=int(input())\r\n ans=\"\"\r\n for i in range(k):\r\n if i%2==0:\r\n ans+=\"I hate that \"\r\n else:\r\n ans+=\"I love that \"\r\n ans=ans[0:len(ans)-5]\r\n ans+=\"it\"\r\n print(ans)\r\n# t=int(input())\r\n# i=1\r\n# while i<=t:\r\nsolve()\r\n # i+=1\r\n \r\n", "n=int(input())\r\nif n == 1:\r\n print(\"I hate it\")\r\nelse:\r\n lst = [\"I hate\", \"I love\"]\r\n ans = \"\"\r\n\r\n for i in range(n-1):\r\n ans += lst[i % 2] + \" that \"\r\n\r\n ans += lst[(n-1) % 2] + \" it\"\r\n print(ans)", "def main() :\r\n print(banners_Feeling(input_Layer_Count()))\r\n\r\ndef banners_Feeling(total_layer_count) :\r\n stacked_layer_count = 1\r\n \r\n banners_feeling = \"I hate\"\r\n while stacked_layer_count < total_layer_count :\r\n banners_feeling += (\" that I hate\" if stacked_layer_count%2 == 0 else \" that I love\")\r\n stacked_layer_count += 1\r\n\r\n return banners_feeling + \" it\"\r\n\r\ndef input_Layer_Count() :\r\n return int(input())\r\n\r\nmain()", "num=int(input())\r\nfor i in range(1,num+1):\r\n if(i %2 !=0):\r\n print(\"I hate \",end=\"\")\r\n else:\r\n print(\"I love \",end=\"\")\r\n if(i !=num):\r\n print(\"that \",end=\"\")\r\n else:\r\n print(\"it\",end=\"\")", "n = int(input())\r\na = []\r\nfor i in range(1, n):\r\n if i%2 == 0:\r\n a.append(\"I love that \")\r\n elif i%2 == 1:\r\n a.append(\"I hate that \")\r\nif n%2 == 0:\r\n a.append(\"I love it\")\r\nelif n%2 != 0:\r\n a.append(\"I hate it\")\r\nfor i in a:\r\n print (i, end= \"\")", "n = int(input())\r\nk = ''\r\nfor i in range(1, n+1):\r\n if i%2 != 0:\r\n k += 'I hate'\r\n else: k+= 'I love'\r\n if i != n:\r\n k += ' that '\r\n else: k+= ' it'\r\nprint(k)", "n = int(input())\r\noddString = \"I hate \"\r\nevenString = \"I love \"\r\nendingLetter1 = \"it\"\r\nendingLetter2 = \"that \"\r\nresult = \"\"\r\nfor i in range(1,n+1):\r\n if i%2 == 0:\r\n result += evenString\r\n if i==n:\r\n result += endingLetter1\r\n else:\r\n result += endingLetter2\r\n else:\r\n result += oddString\r\n if i==n:\r\n result += endingLetter1\r\n else:\r\n result += endingLetter2\r\nprint(result)\r\n", "n = int(input())\r\nlayers = ['I hate ', 'I love '] * 50\r\nprint('that '.join(layers[:n]) + 'it')\r\n", "def hate():\r\n s = \"\"\r\n s += \"I hate \"\r\n return s\r\n\r\ndef love():\r\n s = \"\"\r\n s += \"I love \"\r\n return s\r\n\r\n\r\nn = int(input())\r\nl = [hate(), love()]n\r\ni = 0\r\ns = \"\"\r\nwhile n > 0:\r\n s += l[i]\r\n i += 1\r\n n -= 1\r\n if n != 0:\r\n s += \"that \"\r\ns += \"it\"\r\nprint(s)", "def getStr(n: int, flag :bool) -> str:\r\n if n == 1:\r\n return 'I hate it' if flag else 'I love it'\r\n return ('I hate that ' if flag else 'I love that ') + getStr(n - 1, not flag)\r\n\r\nprint(getStr(int(input()), True))", "n=int(input())\r\ns=\"\"\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\ts=s+\"I hate\"\r\n\telse:\r\n\t\ts=s+\"I love\"\r\n\tif i<n-1:\r\n\t\ts=s+\" that \"\r\ns=s+\" it\"\r\nprint(s)", "n=int(input())\r\ns='I hate'\r\nfor i in range(1,n):\r\n if (i+1)%2==0:\r\n s+=' that I love'\r\n else:\r\n s+=' that I hate'\r\nprint(s+' it')", "n=int(input())\r\ns=\"\"\r\nfor i in range(1,n+1):\r\n if(i%2!=0):\r\n if(i==1):\r\n s=s+' I hate '\r\n else:\r\n s=s+'I hate '\r\n if(i==n):\r\n s=s+'it'\r\n else:\r\n s=s+'that '\r\n else:\r\n s=s+'I love '\r\n if(i==n):\r\n s=s+'it'\r\n else:\r\n s=s+'that '\r\nprint(s)\r\n ", "lol = ''\r\nE = int(input())\r\nfor i in range(E):\r\n if i % 2 == 0:\r\n lol += 'I hate '\r\n else:\r\n lol += 'I love '\r\n if i != E - 1:\r\n lol += 'that '\r\n else:\r\n lol += 'it '\r\nprint(lol)\r\n", "n = int(input())\r\na=\"I hate\"\r\nfor i in range(2,n+1):\r\n if i%2==0:\r\n a+=\" that I love\"\r\n else:\r\n a+=\" that I hate\"\r\na+=\" it\"\r\nprint(a)", "n=int(input())\r\ns1=\"I hate \"\r\ns2=\"I love \"\r\ns=\"\"\r\nfor i in range(n):\r\n if(i%2!=0):\r\n s+=s2\r\n else:\r\n s+=s1\r\n if(i+1<n):\r\n s+=\"that \"\r\ns+=\"it\"\r\nprint(s)", "n=int(input())\r\ndef feelings(n):\r\n if n==1:\r\n return \"I hate \"\r\n if n==2:\r\n return \"I hate that I love \"\r\n if n==3:\r\n return \"I hate that I love that I hate \"\r\n elif n%2==0 and n>2:\r\n s=feelings(2)\r\n for i in range(1,n//2):\r\n s= s + \"that \"+ feelings(2)\r\n return s\r\n elif n%2 !=0 and n>3:\r\n s=\"\"\r\n for i in range(0,n//2):\r\n s=s+ feelings(2) +\"that \"\r\n s=s+feelings(1)\r\n return s\r\n \r\ns=feelings(n)\r\nprint(s+ \"it\")\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ndic = {1:\"I hate it\",2:\"I love it\"}\r\nres = \"\"\r\nfor i in range(1,n):\r\n if i%2==0:\r\n res += dic[2]\r\n else:\r\n res += dic[1]\r\n \r\nres = res.replace('it','that ')\r\n\r\nif n%2==0:\r\n res += dic[2]\r\nelse:\r\n res += dic[1]\r\n \r\nprint(res)", "n = int(input())\r\nif n == 1:\r\n print(\"I hate it\")\r\n exit()\r\n\r\nlst = [\"I\", \"that\"]\r\nlst2 = lst.copy() n\r\nlst2.pop()\r\nlst2.append(\"it\")\r\n\r\nfor i in range(n):\r\n temp = 3 * i + 1\r\n if i % 2 == 0:\r\n word = 'hate'\r\n else:\r\n word = 'love'\r\n\r\n lst2.insert(temp, word)\r\n\r\nprint(lst2)", "n = int(input())\r\n\r\nop = \"I hate\"\r\ni = 2\r\n\r\nwhile n >= i:\r\n if i % 2 == 0:\r\n op += \" that I love\"\r\n else:\r\n op += \" that I hate\"\r\n i += 1\r\n\r\nprint(op + \" it\")\r\n", "n = int(input())\r\nans = \"I hate that I love that \"(n//2)\r\nif n%2==1:\r\n ans+=\"I hate it\"\r\nelse:\r\n ans = ans[:-5]+\"it\"\r\nprint(ans)", "n = int(input())\r\n\r\nif n==1:\r\n print(\"I hate it\")\r\nelse:\r\n \r\n str=\"\"\r\n \r\n for i in range(1,n):\r\n if i%2!=0:\r\n str+=\"I hate that \"\r\n if i%2==0:\r\n str+=\"I love that \"\r\n \r\n if n%2==0:\r\n print(str+\"I love it\")\r\n \r\n if n%2!=0:\r\n print(str+\"I hate it\")", "a=int(input(\" \"))\r\nfor i in range(1,a+1):\r\n if i==(a):\r\n if i%2==0:\r\n print(\"I love it\")\r\n else:\r\n print(\"I hate it\")\r\n elif i%2==0:\r\n print(\"I love that \",end=\"\")\r\n else:\r\n print(\"I hate that \",end=\"\")\r\n", "demo = \"\"\r\nn = int(input())\r\nfor i in range(1, n+1,1):\r\n if i == n:\r\n if i%2!=0:\r\n demo+= \"I hate it\"\r\n else:\r\n demo+=\"I love it\"\r\n else:\r\n if i%2!=0:\r\n demo+=\"I hate that \"\r\n else:\r\n demo+=\"I love that \"\r\nprint(demo)", "a = eval(input())\r\ns = ''\r\nflag = False\r\nwhile a!=0:\r\n if flag and a!=1:\r\n s+='I love that '\r\n elif not flag and a!=1:\r\n s+='I hate that '\r\n else:\r\n if flag:\r\n s+='I love it'\r\n else:\r\n s+='I hate it'\r\n a-=1\r\n flag = not flag\r\nprint(s)", "while True:\r\n n = int(input())\r\n if 1 <= n <= 100:\r\n break\r\n\r\nliefde = \"I love that \"\r\nhaat = \"I hate that \"\r\nliefdeslot = \"I love it \"\r\nhaatslot = \"I hate it \"\r\n\r\ngevoel = \"\"\r\n\r\nfor x in range(1,n+1,1):\r\n if x%2 == 0 and x == n:\r\n gevoel += liefdeslot\r\n break\r\n elif x % 2 == 1 and x == n:\r\n gevoel += haatslot\r\n break\r\n elif x%2 == 0:\r\n gevoel += liefde\r\n else:\r\n gevoel += haat\r\n\r\nprint(gevoel)\r\n", "n=int(input())\r\nfeel=[]\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n feel.append(\"I hate\")\r\n else:\r\n feel.append(\"I love\")\r\n if i!=n:\r\n feel.append(\"that\")\r\nfeel.append(\"it\")\r\ndoc=' '.join(feel)\r\nprint(doc)\r\n", "#Created by AMIRHANPRO\r\nn=int(input())#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\nl=[]#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\ni=0#AMIRHANPRO#AMIRHANPRO\r\n#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\nwhile (i<n):#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n l.append(\"I hate that\")#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n i += 1#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n if (i == n):#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n break#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n l.append(\" I love that \")#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n i +=1#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n if (i == n):#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n break#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\nif (l[n-1]==\"I hate that\"):#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n l[n-1]=l[n-1][:7]+\"it\"#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\nelse:#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n l[n-1]=l[n-1][:8]+\"it\"#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\nprint(''.join(l))#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO", "n = int(input())\r\nf = \"h\"\r\ns = \"\"\r\nfor i in range(n):\r\n if f == \"h\":\r\n s += \"I hate that \"\r\n f = \"l\"\r\n else:\r\n s += \"I love that \"\r\n f = \"h\"\r\n if i+1 == n:\r\n s = s[:-5]\r\n s += \"it\"\r\n \r\nprint(s)\r\n", "feeling_number = int(input())\r\nfirst = \"I hate\"\r\nsecond = \"I love\"\r\nhulk_felling = []\r\nx = 1\r\nfor _ in range(feeling_number):\r\n if x % 2 != 0:\r\n hulk_felling.append(first)\r\n else:\r\n hulk_felling.append(second)\r\n x += 1\r\nhulk_felling = \" that \".join(hulk_felling) + \" it\"\r\nprint(hulk_felling)", "def solve(n):\r\n if n == 1:\r\n print(\"I hate it\")\r\n return\r\n s = \"I hate\"\r\n for i in range(n - 1):\r\n if i % 2 == 0:\r\n s += \" that I love\"\r\n else:\r\n s += \" that I hate\"\r\n s += \" it\"\r\n print(s)\r\n\r\n\r\nn = int(input())\r\nsolve(n)\r\n\r\n", "user_input = int(input())\r\nresponse = \"\"\r\n\r\nfor i in range(1, 1+user_input):\r\n if i % 2 == 1:\r\n response += \"I hate that \"\r\n else:\r\n response += \"I love that \"\r\n\r\nresponse = response.replace(\"that \", \"&\", user_input)\r\nresponse = response.replace(\"&\", \"that \", user_input - 1)\r\nresponse = response.replace(\"&\", \"\")\r\nresponse += \"it\"\r\n\r\nprint(response)", "n=int(input());ans=''\r\nfor i in range(1,n+1):\r\n if i&1==1:\r\n ans+='I hate '\r\n else:\r\n ans+='I love '\r\n if i!=n:\r\n ans+='that '\r\n\r\nans+='it'\r\nprint(ans)", "n = int(input())\r\nch = \"\"\r\nif n == 1:print(\"I hate it\")\r\nfor i in range(1,(n//2)+1):\r\n ch += \"I hate that \"\r\n if i < n//2:\r\n ch += \"I love that \"\r\n else:\r\n if n%2==0:ch += \"I love it\"\r\n else: ch += \"I love that I hate it\"\r\n \r\n \r\n\r\n\r\nprint(ch)", "n = int(input())\r\nst = \"I hate\"\r\nst2 = \"I love\"\r\nfinal = \"I hate\"\r\nfor i in range(n-1):\r\n if n == 1:\r\n print(\"I hate it\")\r\n exit()\r\n elif i % 2 == 0 and n != 1:\r\n final += \" that \" + st2\r\n else:\r\n final = final + \" that \" + st\r\n\r\nprint(final + \" it\")", "n=int(input())\r\nhate=\"I hate\"\r\nlove=\"I love\"\r\ns=\"\"\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n s+=\" \"+hate+\" that\"\r\n else:\r\n s+=\" \"+love+\" that\"\r\n\r\nif s.endswith(\"that\") :\r\n s1=s[:-4]+\"it\"\r\n print(s1.strip())\r\n \r\n \r\n ", "n = int(input())\n#p = list(map(int,input().split()))\nf = []\nfor i in range(1,n+1):\n if i%2 == 1:\n f.append(\"I hate\")\n else:\n f.append(\"I love\")\n if i != n:\n f.append(\"that\")\nf.append(\"it\")\nprint(\" \".join(f))\n", "def hate_love():\r\n hate = \"I hate\"\r\n love = \"I love\"\r\n steps = int(input())\r\n result = \"\"\r\n for i in range(1, steps + 1):\r\n if i != 1:\r\n result += ' that '\r\n if i % 2 != 0:\r\n result += hate\r\n else:\r\n result += love\r\n return result + ' it'\r\nprint(hate_love())", "n=int(input())\r\nif n%2==0:\r\n c=(n//2)-1\r\n print(\"I hate that I love that \"c,end=\"I hate that I love it\")\r\nelse:\r\n d=n//2\r\n print(\"I hate that I love that \"d,end=\"I hate it\")", "n = int(input())\r\nfeelings = [\"I hate\", \"I love\"]\r\n\r\nresult = \"I hate \"\r\nfor i in range(2, n+1):\r\n result += 'that '\r\n if i % 2 == 0:\r\n result += feelings[1] + \" \"\r\n else:\r\n result += feelings[0] + \" \"\r\nprint(result.strip() + \" it\")", "n = int(input())\r\na = \"I hate\"\r\nb = \"I love\"\r\ns = \"I hate\"\r\nfor i in range(n-1):\r\n if i%2!=0:\r\n s += \" that \" + a \r\n else:\r\n s += \" that \" + b\r\nprint(s + \" it\")\r\n \r\n", "import math\r\n\r\na = int(input())\r\none = \"I hate it\"\r\ntwo = \"I love it\"\r\nthree = \"I hate that \"\r\nfour = \"I love that \"\r\n\r\nif a % 2 == 0:\r\n print((three + four)(a//2-1) + three + two)\r\nelse:\r\n print((three + four)(math.ceil((a-1)/2)) + one)\r\n\r\n", "num = int(input())\r\nword = []\r\nfor x in range(num):\r\n if x % 2 == 0:\r\n word.append('I hate')\r\n else:\r\n word.append('I love')\r\nprint(' that '.join(word) + ' it')", "n = int(input())\r\nres = []\r\nfor i in range(n - 1):\r\n if not i % 2:\r\n res.append(\"I hate that\")\r\n else:\r\n res.append(\"I love that\")\r\nres.append(\"I hate it\" if n % 2 else \"I love it\")\r\nprint(\" \".join(res))\r\n", "n = int(input())\r\nname = [\"I hate\",\"I love\"]\r\nstatus = 0\r\ni = 1\r\nwhile i<n:\r\n print(name[status],end=\" that \")\r\n status = 0 if status==1 else 1\r\n i+=1\r\nprint(name[status],end=\" it \")", "n =int(input())\r\n \r\nhate=\"I hate that \"\r\nlove=\"I love that \"\r\nres=\"\"\r\nfor i in range(n):\r\n\tif i % 2 :\r\n\t\tres+=love\r\n\telse:\r\n\t\tres+=hate\r\nprint(res[:-5]+\"it\")", "num = int(input())\r\nfor i in range(num-1):\r\n if (i+1)%2==1:\r\n print(\"I hate that\", end= ' ')\r\n else:\r\n print(\"I love that\", end = ' ')\r\nif num%2==1:\r\n print(\"I hate it\")\r\nelse:\r\n print(\"I love it\")", "n = int(input())\r\n\r\nl = []\r\n\r\nfor i in range(n):\r\n \r\n if i % 2 == 0:\r\n l.append(\"I hate\")\r\n else:\r\n l.append(\"I love\")\r\n\r\nprint(l, sep=\" that \", end=\" \")\r\nprint(\"it\")", "a = int(input())\r\nprint((('I hate that I love that ' (a//2 - 1)) + (\"I hate that I love it\" if a%2 == 0 else \"I hate that I love that I hate it\")) if a != 1 else \"I hate it\")", "# def solve(n):\r\n# # s = 'I hate that I love that I hate it'\r\n# # s1 = 'I hate that'\r\n# # s1 = 'I hate that I love it'\r\n# return (['I hate','I love']50)[:n],sep=' that ',end=' it')\r\n# print(solve(int(input())))\r\nprint((['I hate','I love']50)[:int(input())],sep=' that ',end=' it')\r\n", "n = int(input())\r\n\r\nfor i in range(n):\r\n if i % 2 == 0 : print(\"I hate \", end = \"\")\r\n else : print(\"I love \", end = \"\")\r\n\r\n if i != n-1 : print(\"that \", end = \"\")\r\n else : print(\"it\", end = \"\")\r\n", "from bisect import bisect_left\r\nfrom collections import Counter\r\n\r\n\r\nn=int(input())\r\nif n==1:print('I hate it')\r\nelif n%2==0:\r\n ss='I hate that I love that '(n//2-1)+'I hate that I love it'\r\n print(ss)\r\nelse:\r\n ss='I hate that I love that '(n//2)+'I hate it' \r\n print(ss) \r\n", "w = int(input())\r\nm = \"hate\"\r\nn = \"love\"\r\nt = 0\r\ns = \"\"\r\nfor i in range(w):\r\n if i % 2 == 0:\r\n if i != w - 1:\r\n s = s + \"I hate that \"\r\n else:\r\n s = s + \"I hate it\"\r\n else:\r\n if i != w - 1:\r\n s = s + \"I love that \"\r\n else:\r\n s = s + \"I love it\"\r\nprint(s)", "hate = 'I hate'\r\nlove = 'I love'\r\noutput = ''\r\nlayer = int(input())\r\n\r\nfor i in range(1, layer + 1):\r\n if i % 2 == 1:\r\n if i < layer:\r\n output += hate + ' that '\r\n else:\r\n output += hate + ' it'\r\n else:\r\n if i < layer:\r\n output += love + ' that '\r\n else:\r\n output += love + ' it'\r\n\r\nprint(output)", "n = int(input())\r\ntxt =''\r\n\r\nwhile n > 0:\r\n if n >= 4:\r\n txt += \"I hate that I love that \"\r\n n -= 2\r\n elif n == 3:\r\n txt += \"I hate that I love that I hate it\"\r\n break\r\n elif n == 2:\r\n txt += \"I hate that I love it\"\r\n break\r\n else:\r\n txt += \"I hate it\"\r\n break\r\n \r\nprint(txt)", "x, y = int(input()), ''\r\nfor i in range(x):\r\n if i % 2 == 0:\r\n y += 'I hate '\r\n else:\r\n y += 'I love '\r\n if i == x - 1:\r\n y += 'it'\r\n break\r\n else:\r\n y += 'that '\r\nprint(y)", "print('I hate',end='')\r\nfor i in range(1,int(input())):\r\n if i%2 != 0:\r\n print(' that I love',end='')\r\n else:\r\n print(' that I hate',end='')\r\nprint(' it')", "n=int(input())\r\ns=''\r\na='I hate that '\r\nb='I love that '\r\n\r\nfor i in range(1,n+1):\r\n if(i%2!=0):\r\n s=s+a\r\n else:\r\n s=s+b\r\n\r\nl=s.split()\r\nl[-1]='it'\r\nprint(' '.join(l))\r\n \r\n\r\n\r\n\r\n", "n=int(input())\r\ntext = \"\"\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n text = text + \"I hate \"\r\n else:\r\n text = text+ \"I love \"\r\n if i!=n-1:\r\n text = text + \"that \"\r\n else:\r\n text = text + \"it\"\r\nprint(text)", "def main():\r\n times = int(input())\r\n for i in range(0, times):\r\n if i % 2 == 0:\r\n if i == times - 1:\r\n print(\"I hate it\")\r\n break\r\n print(\"I hate that\", end=' ')\r\n else:\r\n if i == times - 1:\r\n print(\"I love it\")\r\n break\r\n print(\"I love that\", end=' ')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\n\r\na = \"I hate it\"\r\nb = \"I hate that \"\r\nc = \"I love it\"\r\nd = \"I love that \"\r\nfinal_str = \"\"\r\nif n == 1:\r\n print(a)\r\nelse:\r\n for i in range(1, n+1):\r\n if i % 2 == 0:\r\n if i == n:\r\n final_str = final_str + c\r\n else:\r\n final_str = final_str + d\r\n else:\r\n if i == n:\r\n final_str = final_str + a\r\n else:\r\n final_str = final_str + b\r\n\r\nprint(final_str)\r\n", "n = int(input())\r\nlist = [\"I hate \", \" I love \"]100\r\nprint(list[:n], sep=\" that \", end = \" it\")", "number = int(input())\r\narray = []\r\nfor i in range(number):\r\n if i % 2 == 0:\r\n array.append(\"I hate\")\r\n else:\r\n array.append(\"I love\")\r\n \r\n if i != number - 1:\r\n array.append(\"that\")\r\narray.append(\"it\")\r\n \r\nprint(\" \".join(array))", "n=int(input())\r\ns=\"\"\r\nfor i in range(1,n):\r\n if i %2==1:\r\n s+=\"I hate that \"\r\n else:\r\n s+=\"I love that \"\r\nif n %2==1:\r\n print(s+\"I hate it\")\r\nelse:\r\n print(s+\"I love it\")", "# Input the number of layers\r\nn = int(input())\r\n\r\n# Initialize the feeling string with the first layer\r\nfeeling = \"I hate\"\r\n\r\n# Loop through the remaining layers\r\nfor i in range(2, n + 1):\r\n if i % 2 == 0:\r\n feeling += \" that I love\"\r\n else:\r\n feeling += \" that I hate\"\r\n\r\n# Add \" it\" to complete the feeling\r\nfeeling += \" it\"\r\n\r\n# Print the feeling\r\nprint(feeling)\r\n", "n=int(input())\r\ns1='I hate'\r\ns2='I love'\r\nmid='that'\r\nend='it'\r\nout=s1\r\nk=2\r\nwhile(k<=n ):\r\n if(k%2==0):\r\n out=out+' '+mid+' '+s2\r\n k=k+1\r\n else:\r\n out=out+' '+mid+' '+s1\r\n k=k+1\r\nprint(out+' '+end)", "n=int(input())\r\nans=\"\"\r\nc=0\r\nfor i in range(n):\r\n if i==n-1:\r\n if c==0:\r\n ans+=\"I hate it \"\r\n else:\r\n ans+=\"I love it \"\r\n elif c==0:\r\n ans+=\"I hate that \"\r\n c=1\r\n else:\r\n ans+=\"I love that \"\r\n c=0\r\nprint(ans)", "n=int(input())\r\nres=[]\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n if len(res)>5:\r\n res[-1]=\"that\"\r\n res+=\"I\",\"hate\",\"it\"\r\n else:\r\n if len(res)>0:\r\n res[-1]=\"that\"\r\n res+=\"I\", \"love\", \"it\"\r\nprint(res)", "import sys\r\nclass FastReader:\r\n def __init__(self):\r\n self.br = sys.stdin\r\n self.st = []\r\n\r\n def next(self):\r\n while not self.st:\r\n try:\r\n self.st = next(self.br).strip().split()\r\n except EOFError:\r\n pass\r\n temp = self.st[0]\r\n self.st = self.st[1:]\r\n return temp\r\n\r\n def nextInt(self):\r\n return int(self.next())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n sc = FastReader()\r\n\r\n n = sc.nextInt()\r\n result = \"\"\r\n for i in range(n):\r\n if i % 2 == 0:\r\n result += \"I hate \"\r\n else:\r\n result += \"I love \"\r\n \r\n if i < n - 1:\r\n result += \"that \"\r\n\r\n result += \"it\"\r\n print(result)", "x=int(input())\r\nc='I hate'\r\nfor i in range(x-1):\r\n c+=' that'\r\n if i%2==0:c+=' I love'\r\n else:c+=' I hate'\r\nprint(c+' it')", "f=''\r\nq=int(input())\r\nfor e in range(q):\r\n if e%2==0:\r\n f+='I hate '\r\n else:\r\n f+='I love '\r\n if e!= q-1:\r\n f+='that '\r\n else:\r\n f+='it '\r\nprint(f) ", "n = int(input())\r\n\r\nh = 'I hate'\r\nl = 'I love'\r\n\r\nsay = []\r\n\r\nfor x in range(1, n+1):\r\n if x % 2 == 1:\r\n say.append(h)\r\n else:\r\n say.append(l)\r\n\r\n \r\nprint(' that '.join(say) + ' it')\r\n", "n=int(input())\r\na=\"I hate\"\r\nb=\"I love\"\r\ns=\"\"\r\nfor i in range(n):\r\n if i==n-1:\r\n if i%2==0:\r\n s=s+a+\" it \"\r\n else:\r\n s=s+b+\" it \"\r\n else:\r\n if i%2==0:\r\n s+=a+\" that \"\r\n else:\r\n s+=b+\" that \"\r\nprint(s)\r\n ", "n = int(input())\r\n\r\nfeelings = []\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n feelings.append(\"I hate that\")\r\n else:\r\n feelings.append(\"I love that\")\r\nfeelings[-1] = feelings[-1].replace(\"that\", \"it\")\r\nprint(\" \".join(feelings))", "# بسم الله (accepted)\r\n# problem : string concatenation \r\nn = int(input())\r\nfeeling1 = 'I hate that '\r\nfeeling2 = 'I love that '\r\nanswer = str()\r\nfor value in range(1,n+1) :\r\n if value %2 != 0 and value != n :\r\n answer += feeling1\r\n elif value %2 == 0 and value != n :\r\n answer += feeling2\r\n if value %2 != 0 and value == n :\r\n answer += 'I hate it '\r\n elif value %2 == 0 and value == n :\r\n answer += 'I love it '\r\nprint(answer.strip(' '))\r\n", "n = int(input())\r\n\r\nfeeling = []\r\nfor i in range(1, n+1):\r\n if i % 2 == 1:\r\n feeling.append(\"I hate\")\r\n else:\r\n feeling.append(\"I love\")\r\n\r\nfeeling_str = \" that \".join(feeling) + \" it\"\r\nprint(feeling_str)", "a = int(input(\"\"))\r\nc = \"\"\r\nfor i in range(1, a + 1):\r\n if i % 2 == 1 and i != a:\r\n c += \"I hate that \"\r\n elif i % 2 == 0 and i != a:\r\n c += \"I love that \"\r\n elif i % 2 == 1 and i == a:\r\n c += \"I hate it\"\r\n else:\r\n c += \"I love it\"\r\n\r\nprint(c)\r\n", "n = int(input())\r\nans = []\r\nfor i in range(1, n + 1):\r\n if i % 2 == 0:\r\n ans.append(\"I love\")\r\n else:\r\n ans.append(\"I hate\")\r\n\r\nprint(\" that \".join(ans) + \" it\")", "n =int(input());i=1;strn =''\r\nwhile(i<=n):\r\n if n==1:\r\n strn +='I hate it'\r\n elif n!=1 and i%2!=0 and i==1 :\r\n strn +='I hate that '\r\n elif n!=1 and i%2!=0 and i!=n:\r\n strn +='I hate that '\r\n elif n!=1 and i%2!=0 and i ==n:\r\n strn +='I hate it '\r\n elif n!=1 and i%2==0 and i==n:\r\n strn +='I love it'\r\n elif n!=1 and i%2==0 and i!=n:\r\n strn +='I love that '\r\n i +=1\r\nprint(strn)", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Sat Sep 16 23:53:55 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\ns=int(input())\nw='I hate'\nif s==1:\n w+=''\nelif s%2==0:\n w+=' that I love'\n m=1\n while m<s/2:\n w+=' that I hate that I love'\n m+=1\nelse:\n p=0\n while p<(s-1)/2:\n w+=' that I love that I hate'\n p+=1\nw+=' it'\nprint(w)\n ", "n = int(input())\r\n\r\nanswers = [\r\n 'I hate it',\r\n 'I love it'\r\n]\r\n\r\nanswer = []\r\n\r\nfor t in range(n):\r\n answer.append(answers[t%2])\r\n if t != 0:\r\n answer[t-1] = answer[t-1].replace('it', 'that')\r\n \r\nprint(answer, sep=' ')", "a=\"I hate \"\r\nb=\"that \"\r\nc=\"I love \"\r\nd=\"it\"\r\nfinal=\"I hate \"\r\nnum=int(input())\r\nfor i in range(2,num+1):\r\n if(i%2!=0):\r\n final = final + b + a\r\n else:\r\n final = final + b + c\r\nfinal = final + d\r\nprint(final) ", "n = int(input())\nedgeOdd= 'I hate it'\nedgeEven = 'I love it'\nmiddleOdd = 'I hate that'\nmiddleEven = 'I love that'\n\nfor i in range(1, n+1):\n if n == 1:\n print(edgeOdd, end=' ')\n elif i == range(n+1)[-1]:\n print(edgeEven, end=' ') if range(n+1)[-1] % 2 == 0 else print(edgeOdd, end=' ')\n else:\n print(middleEven, end=' ') if i % 2 == 0 else print(middleOdd, end=' ')\n\n", "# Read the input\r\nn = int(input())\r\n\r\n# Initialize the initial feeling\r\nfeeling = \"I hate\"\r\n\r\n# Build the feeling string with alternating layers\r\nfor i in range(2, n+1):\r\n # Use \"that I love\" or \"that I hate\" based on the layer index (odd or even)\r\n feeling += \" that I \" + (\"love\" if i % 2 == 0 else \"hate\")\r\n\r\n# Add \"it\" at the end\r\nfeeling += \" it\"\r\n\r\n# Print the resulting feeling\r\nprint(feeling)\r\n", "\"\"\"Халк\"\"\"\r\n\r\ndef main():\r\n n = int(input())\r\n temp = \"I hate {0}it\"\r\n\r\n for i in range(n):\r\n if i == 0:\r\n strng = \"{0}\"\r\n elif i % 2 == 0:\r\n strng = \"that I hate {0}\"\r\n elif i % 2 != 0:\r\n strng = \"that I love {0}\"\r\n temp = temp.format(strng)\r\n else:\r\n temp = temp.format(\"\")\r\n print(temp)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "g=int(input())\r\ns=\"I hate that I love\"\r\nif(g==1):\r\n print(\"I hate it\")\r\nif(g==2):\r\n print(\"I hate that I love it\")\r\nif(g>2):\r\n for i in range(3,g+1):\r\n if(i%2==0):\r\n s+=\" that I love\"\r\n\r\n else:\r\n s+=\" that I hate\"\r\n print(s+\" it\")", "n=int(input());result=[];end='that'\r\nfor i in range(1,n+1):\r\n if i == n:end='it'\r\n result.append(f'I love {end}') if i%2==0 else result.append(f'I hate {end}')\r\nprint(' '.join(result))\r\n", "n = int(input())\r\nans = []\r\nfor i in range(1, n+1):\r\n if i % 2 == 1:\r\n ans.append(\"I hate\")\r\n else:\r\n ans.append(\"I love\")\r\n ans.append(\"that\")\r\n \r\nans.pop()\r\nans.append(\"it\")\r\nprint(ans)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Sep 7 10:03:05 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\nlayer=int(input())\r\nfor i in range(layer-1):\r\n if i%2==0:\r\n print('I hate that',end=' ')\r\n else:\r\n print('I love that',end=' ')\r\nif layer%2==1:\r\n print('I hate it')\r\nelse:\r\n print('I love it')", "n = int(input())\na = \"I hate\"\nb = \"I love\"\nif n == 1:\n print(\"I hate it\")\n quit()\ntext = \"\"\nfor x in range(2, n + 2):\n if x % 2 == 0:\n text = text + a\n else:\n text = text + b\n if x != n+1:\n text = text + \" that \"\ntext = text + \" it \"\nprint(text)\n\nquit()\n \t \t\t \t\t \t \t \t\t\t\t \t\t \t \t\t", "n = int(input())\r\na = \"I hate\"\r\nfor i in range(1,n):\r\n if (i%2!=0):\r\n a = a + \" that\" + \" I love\"\r\n else:\r\n a = a + \" that\" + \" I hate\"\r\na = a +\" it \"\r\nprint(a)", "a=int(input())\r\nif a%2==0:print('I hate that I love that '(a//2-1)+'I hate that I love it')\r\nelse:print('I hate that I love that '((a-1)//2)+'I hate it')\r\n", "number = int(input())\r\n\r\nfeeling = \"\"\r\n\r\nfor num in range(1, number+1):\r\n if num==number and num%2==0:\r\n feeling += \" I love it\"\r\n elif num==number and num%2==1:\r\n feeling += \" I hate it\"\r\n elif num!=number and num%2==0:\r\n feeling += \" I love that\"\r\n else:\r\n feeling += \" I hate that\"\r\n\r\nprint(feeling.strip())", "def sol():\r\n n=int(input())\r\n s=\"\"\r\n for i in range (n):\r\n if i%2==0 and i==n-1:\r\n s=s+\"I hate it\"\r\n elif i%2==1 and i==n-1:\r\n s=s+\"I love it\"\r\n elif i%2==0 :\r\n s=s+\"I hate that \"\r\n elif i%2==1:\r\n s=s+\"I love that \"\r\n if n>1:\r\n print(s)\r\n else:\r\n print(\"I hate it\")\r\n\r\nsol()", "n=int(input())\r\nflag=0\r\nans=\"\"\r\nfor i in range(n):\r\n if i==n-1:\r\n if flag==0:\r\n ans+=\"I hate \"\r\n else:\r\n ans+=\"I love \"\r\n break\r\n else:\r\n if flag==0:\r\n ans+=\"I hate that \"\r\n flag=1\r\n else:\r\n ans+=\"I love that \"\r\n flag=0\r\nans+=\"it\"\r\nprint(ans)", "n = int(input())\r\nb = int(n/2)\r\nnenavist = \"I hate that\"\r\ndobro = \"I love that\"\r\nif n == 1:\r\n print(\"I hate it\")\r\nfor i in range(n):\r\n if i == n-1 and i % 2 != 0:\r\n print(\"I love it\")\r\n elif i == n-1 and i % 2 == 0 and n != 1:\r\n print(\"I hate it\")\r\n elif i % 2 == 0 and n != 1:\r\n print(nenavist,'',end='')\r\n elif i % 2 != 0:\r\n print(dobro,'',end='')", "n = int(input())\r\nhate = \"I hate that\"\r\nlove = \"I love that\"\r\nresult = \"\"\r\nfor i in range(1,n):\r\n if i % 2 == 1:\r\n result += hate\r\n result += \" \"\r\n else:\r\n result += love\r\n result += \" \"\r\nif n % 2 == 0:\r\n result += \"I love it\"\r\nelse:\r\n result += \"I hate it\"\r\nprint(result)", "num = int(input())\r\nodp = \"\"\r\nif num == 1 :\r\n pass\r\nelse:\r\n for i in range(num-1):\r\n if i%2 == 0:\r\n odp +=\"I hate\" \r\n else:\r\n odp +=\"I love\"\r\n odp += \" \"+\"that\" + \" \"\r\nif num%2==0:\r\n odp+= \"I love it\"\r\nelse:\r\n odp+= \"I hate it\"\r\nprint(odp)", "#hulk\r\ndef hulk(s,n1):\r\n if n1==n:\r\n s+=' it'\r\n return s\r\n else:\r\n if n1%2==0:\r\n s+=' that I hate '\r\n return hulk(s,n1+1)\r\n else:\r\n s+=' that I love '\r\n return hulk(s,n1+1)\r\n\r\n\r\nn=int(input())\r\ns='I hate'\r\nprint(hulk(s,1))", "n = int(input())\r\nhulk = ''\r\nfor i in range(1, n+1):\r\n if i%2:\r\n hulk += \"I hate \"\r\n else:\r\n hulk += \"I love \"\r\n if i == n:\r\n hulk += \"it\"\r\n else:\r\n hulk += \"that \"\r\n\r\nprint(hulk)\r\n", "x=int(input())\r\nl=[]\r\nfor i in range(1,x+1):\r\n if i%2==1:\r\n l.append(\"I hate\")\r\n elif i%2==0:\r\n l.append(\"I love\")\r\nr=\" that \".join(l)\r\nprint(r,end=\" \")\r\nprint(\"it\")", "number = int(input())\r\nhate = 'I hate'\r\nthat = 'that'\r\nlove = 'I love'\r\nit = 'it'\r\nans = ''\r\nfor i in range(number):\r\n if i % 2 == 0:\r\n ans += hate\r\n else:\r\n ans += love\r\n if i != number - 1:\r\n ans += ' ' + that + ' '\r\n else:\r\n ans += ' ' + it\r\nprint(ans)", "n=int(input())\r\nfor i in range(1,n):\r\n if i%2==0:\r\n print(\"I love that\",end=' ')\r\n else :\r\n print(\"I hate that\",end=' ')\r\nif n%2==0:\r\n print(\"I love\",end=' ')\r\nelse :\r\n print(\"I hate\",end=' ')\r\nprint(\"it\")", "n1=int(input())\r\nfor i in range(1,n1):\r\n if i%2==1:\r\n print(\"I hate that\",end=\" \")\r\n if i%2==0:\r\n print(\"I love that\",end=\" \")\r\nif n1%2==0:\r\n print(\"I love it\",end=\" \")\r\nelse:\r\n print(\"I hate it\",end=\" \")\r\n ", "t = int(input())\r\ns = ''\r\nfor i in range(t):\r\n if i % 2 ==0 and i != t - 1:\r\n s+= 'I hate that '\r\n elif i % 2 != 0 and i != t-1:\r\n s+= 'I love that '\r\n elif i %2 == 0 and i == t-1:\r\n s += 'I hate it'\r\n elif i %2 != 0 and i == t -1:\r\n s += 'I love it'\r\nprint(s)", "def solve():\r\n x, s = int(input()), 'I hate '\r\n for i in range(x-1):\r\n s += 'that '\r\n s += 'I love ' if i % 2 == 0 else 'I hate '\r\n print(s+'it')\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "chir = int(input())\r\nsdf = \"\"\r\nfor v5n in range(1,chir+1):\r\n sdf += \"I hate that \" if v5n%2!=0 else \"I love that \"\r\ns0l = sdf[:-5] + \"it\"\r\nprint(s0l)", "x = int(input())\r\n\r\nsentence = 'it'\r\nodd = 'I hate '\r\neven = 'I love '\r\nword = 'that '\r\n\r\nallWords = []\r\n\r\nfor i in range(1,x+1):\r\n if x == 1:\r\n allWords.append(odd)\r\n allWords.append(sentence)\r\n\r\n if x > 1:\r\n if i % 2 != 0:\r\n allWords.append(odd)\r\n allWords.append(word)\r\n elif i % 2 == 0:\r\n allWords.append (even)\r\n allWords.append(word)\r\n\r\n if i == x:\r\n allWords.pop()\r\n allWords.append(sentence) \r\n \r\nfor word in allWords:\r\n print(word,end='') ", "n1 = int(input())\r\ns = 'love'\r\ng = 'hate'\r\nn = ''\r\nfor i in range(1, n1 + 1):\r\n if i % 2 == 0 and i != n1:\r\n n += 'I love that '\r\n elif i % 2 == 0 and i == n1:\r\n n += 'I love it '\r\n elif i % 2 != 0 and i != n1:\r\n n += 'I hate that '\r\n elif i % 2 != 0 and i == n1:\r\n n += 'I hate it '\r\nprint(n[:-1])\r\n", "n = int(input())\r\nc = []\r\nfor i in range(n):\r\n if i%2==0:\r\n c+='I hate that '\r\n else:\r\n c+='I love that '\r\nc[-5:] = 'it'\r\nprint(''.join(c))", "n=int(input())\r\ns=''\r\nfor i in range(1,n+1):\r\n if i==1:\r\n s+=\"I hate\"\r\n elif i%2!=0:\r\n s+=\" that I hate\"\r\n else:\r\n s+=' that I love'\r\ns+=' it'\r\nprint(s)", "n=int(input())\r\nlst=[]\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n lst.append(\"I hate\")\r\n else:\r\n lst.append(\"I love\")\r\nl=\" that \".join(lst)\r\nprint(l+\" it\")", "def check(number):\r\n if number == 0:print(\"it \", end='')\r\n else:print(\"that \", end='')\r\nnumber = int(input())\r\nwhile number:\r\n print(\"I hate \", end='');number -= 1;check(number)\r\n if number:print(\"I love \", end='');number -= 1;check(number)\r\n", "n = int(input())\r\ns = ''\r\nfor i in range(1, n + 1):\r\n if (i % 2 != 0) and (i != n):\r\n s += 'I hate that '\r\n elif (i % 2 != 0) and (i == n):\r\n s += 'I hate it'\r\n elif (i % 2 == 0) and (i != n):\r\n s += 'I love that '\r\n elif (i % 2 == 0) and (i == n):\r\n s += 'I love it'\r\nprint(s)\r\n", "def hulks_feeling(n):\r\n feeling_parts = []\r\n for i in range(n):\r\n if i % 2 == 0:\r\n feeling_parts.append(\"I hate\")\r\n else:\r\n feeling_parts.append(\"I love\")\r\n if i < n - 1:\r\n feeling_parts.append(\"that\")\r\n feeling_parts.append(\"it\")\r\n return \" \".join(feeling_parts)\r\nn = int(input())\r\nprint(hulks_feeling(n))\r\n", "a=int(input())\r\nfor i in range(a-1):\r\n if i%2==0:\r\n print('I hate that',end=' ')\r\n else:\r\n print('I love that', end=' ')\r\nif a%2==0:\r\n print('I love it')\r\nelse:\r\n print('I hate it')", "n = int(input())\r\ns1= 'I hate '\r\ns2= 'I love '\r\ns3='that '\r\ns4='it'\r\nblk=''\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n blk+=s1\r\n elif i%2==0:\r\n blk+=s2\r\n if i<n:\r\n blk+=s3\r\n \r\n else:\r\n blk+=s4\r\nprint(blk)\r\n", "n = int(input())\r\n\r\nans = []\r\nfor i in range(n):\r\n if i%2 == 0:\r\n if i == 0:\r\n ans.extend([\"I\", \"hate\"])\r\n else:\r\n ans.extend([\"that\", \"I\", \"hate\"])\r\n else:\r\n ans.extend([\"that\", \"I\", \"love\"])\r\n\r\nprint(\" \".join(ans) + \" it\")", "n =int(input())\r\nl = 'I love'\r\nh = 'I hate'\r\nfor i in range(1,n):\r\n if i%2 != 0:\r\n print(h + ' that ',end='')\r\n else:\r\n print(l + ' that ',end='')\r\n\r\nif n%2 != 0:\r\n print(h + ' it')\r\nelse:\r\n print(l + ' it')\r\n \r\n ", "n = int(input())\r\nans=\"I hate \"\r\nfor i in range(2,n+1):\r\n if i%2==0:\r\n ans += \"that I love \"\r\n elif i%2!=0:\r\n ans += \"that I hate \"\r\nans+=\"it\"\r\nprint(ans)", "def express_feelings(n):\r\n feelings = [\"I hate\", \"I love\"]\r\n result = []\r\n\r\n for i in range(n):\r\n result.append(feelings[i % 2])\r\n\r\n if i != n - 1:\r\n result.append(\"that\")\r\n\r\n result.append(\"it\")\r\n\r\n return \" \".join(result)\r\n\r\n\r\nn = int(input())\r\nfeelings_expression = express_feelings(n)\r\nprint(feelings_expression)", "n=input()\r\nn = int(n)\r\nfor e in range (n):\r\n if (e+1)%2==1:\r\n print (\"I hate\", end=\" \")\r\n else:\r\n print (\"I love\", end=\" \")\r\n if e==n-1:\r\n print (\"it\", end=\" \")\r\n else :\r\n print (\"that\", end=\" \")\r\n", "i = int(input())\r\no = ''\r\nfor x in range(1, i+1):\r\n\r\n if x%2 == 0:\r\n o += \"I love\"\r\n else:\r\n o +=\"I hate\"\r\n if x == i:\r\n o+= \" it\"\r\n else:\r\n o+= \" that \"\r\nprint(o)\r\n", "n=int(input())\r\nl=\"I hate \"\r\nh=\"I love \"\r\nk=\"\"\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n k=k+l\r\n elif i%2==0:\r\n k=k+h\r\n if i!=n:\r\n k=k+\"that \"\r\n if i==n:\r\n k=k+\"it \"\r\n \r\n\r\nprint(k)", "n = int(input())\r\nresult = ''\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n result += ' I hate that'\r\n else:\r\n result += ' I love that'\r\n\r\nresult = result[:-4]\r\n\r\nresult += 'it'\r\n\r\nprint(result[1::])", "x = ' '\r\ny =int(input())\r\nfor i in range(1, y+1) :\r\n if i%2!= 0 :\r\n x = x[:len(x)-2]\r\n if len(x) > 10 :\r\n x = x+'that I hate it'\r\n else :\r\n x = x+ 'I hate it'\r\n else :\r\n x = x[:len(x)-2]\r\n x = x + 'that I love it'\r\nprint(x)\r\n ", "n = int(input())\r\ns = True\r\nr = \"\"\r\n\r\nfor i in range(n):\r\n if s == True:\r\n s = False\r\n r += \"I hate that \"\r\n elif s == False:\r\n s = True\r\n r += \"I love that \"\r\n\r\nr = r[:-5] + \"it\"\r\nprint(r)", "n=int(input())\r\nif n==1: \r\n print('I hate it')\r\nelif n==2:\r\n print('I hate that I love it')\r\nelse: \r\n p=(n-2)//2\r\n if n%2==0:\r\n ch='I hate that I love that 'p\r\n ch+='I hate that I love it'\r\n print(ch)\r\n else : \r\n ch='I hate that I love that 'p\r\n ch+='I hate that I love that I hate it'\r\n print(ch)", "n=int(input())\r\ns1='I hate that'\r\ns2='I love that'\r\ns3='I hate it'\r\ns4='I love it'\r\nk=''\r\nfor i in range(1,n):\r\n if i%2==0:\r\n k=k+s2+' '\r\n else:\r\n k=k+s1+' '\r\nif n%2==0:\r\n k=k+s4\r\nelse:\r\n k=k+s3\r\nprint(k)\r\n\r\n", "n=int(input())\r\nresult='I hate it'\r\nresult_temp='I hate that'\r\nif n==1:\r\n print(result)\r\nelif n==2:\r\n print(result_temp+\" \"+\"I love it\")\r\nelse:\r\n i=2\r\n while i<=n-1:\r\n if i%2==0:\r\n result_temp=result_temp+\" \"+\"I love that\"\r\n else:\r\n result_temp=result_temp+\" \"+\"I hate that\"\r\n i+=1\r\n if n%2==0:\r\n print(result_temp+\" \"+\"I love it\")\r\n else:\r\n print(result_temp+\" \"+\"I hate it\")", "n=int(input())\r\nl1=[]\r\ns=\"\"\r\nfor i in range(1,n+1):\r\n if i%2!=0 and i!=n:\r\n l1.append(\"I hate that\")\r\n elif i%2==0 and i!=n:\r\n l1.append(\"I love that\")\r\n elif i%2==0 and i==n:\r\n l1.append(\"I love it\")\r\n else:\r\n l1.append(\"I hate it\")\r\n#print(l1)\r\nfor i in l1:\r\n s+=i\r\n s+=\" \"\r\nprint(s)\r\n ", "s = int(input())\r\nb = \"I hate that \"\r\na = \"I love that \"\r\nk = \"\"\r\nfor i in range(s-1):\r\n if i % 2 == 0:\r\n k = k + b\r\n else:\r\n k = k + a\r\nif s % 2 == 0:\r\n k = k + \"I love it\"\r\nelse:\r\n k = k + \"I hate it\"\r\nprint(k)", "num_cycles = int(input()) # Number of cycles\r\nexpressions = [] # List to store the expressions\r\n\r\nfor i in range(num_cycles):\r\n if i % 2 == 0:\r\n expressions.append(\"I hate\") # Appending \"I hate\" for even cycles\r\n else:\r\n expressions.append(\"I love\") # Appending \"I love\" for odd cycles\r\n\r\n if i < num_cycles - 1:\r\n expressions.append(\"that\") # Appending \"that\" except for the last cycle\r\n\r\nexpressions.append(\"it\") # Appending \"it\" at the end\r\nprint(\" \".join(expressions)) # Joining the expressions with spaces and printing\r\n", "layer=int(input())\r\nanswer=''\r\ncounter=0\r\nfor i in range(1,layer+1):\r\n counter+=1\r\n if counter<layer:\r\n if i%2==0:\r\n answer+=' I love that '\r\n else:\r\n answer+='I hate that'\r\n elif counter==layer:\r\n if i%2==0:\r\n answer+=' I love it'\r\n else:\r\n answer+='I hate it'\r\n \r\nprint(answer)", "num = int(input())\r\nfor i in range(1, num):\r\n if i % 2 == 1:\r\n print(\"I hate that\",end=\" \")\r\n else:\r\n print(\"I love that\",end=\" \") \r\nif num % 2 ==1:\r\n print(\"I hate it\") \r\nelse:\r\n print(\"I love it\") ", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Fri Sep 8 10:57:56 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn=int(input())\r\nif n%2==1:\r\n print(\"I hate that I love that \"(n//2)+\"I hate it\")\r\nelse:\r\n print(\"I hate that I love that \"(n//2-1)+\"I hate that I love it\")\r\n", "n = int(input())\r\nfor i in range(1, n + 1):\r\n if i % 2 != 0:\r\n print(\"I hate \", end=\"\")\r\n else:\r\n print(\"I love \", end=\"\")\r\n if i == n:\r\n print(\"it\", end=\"\")\r\n continue\r\n print(\"that \", end=\"\")", "n = int(input(\"\"))\r\nk = \"I hate \"\r\nl = \"I love \"\r\nm = \"\"\r\nfor i in range(0,n):\r\n if i!= n-1:\r\n if i %2== 0:\r\n m+= (k + \"that \")\r\n elif i %2 != 0:\r\n m+= (l + \"that \")\r\n else:\r\n if i %2== 0:\r\n m+= (k + \"it \")\r\n elif i %2 != 0:\r\n m+= (l + \"it \")\r\nprint(m)\r\n\r\n\r\n\r\n", "n = int(input())\r\nres = ''\r\nfor i in range(n-1):\r\n if(i%2==0):\r\n res = res + 'I hate that '\r\n else:\r\n res = res + 'I love that '\r\nif(n%2 == 0):\r\n res = res + 'I love it'\r\nelse:\r\n res = res + 'I hate it'\r\nprint(res)", "a = \"that I love \"\r\nb = \"that I hate \"\r\n\r\nans = \"I hate \"\r\n\r\nn = int(input()) - 1\r\n\r\nfor i in range(n):\r\n if i%2 == 0:\r\n ans += a\r\n else:\r\n ans += b\r\n\r\nprint((ans + \"it\"))", "n = int(input())\r\na = 'I hate'\r\nb = 'I love'\r\ntext = []\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n text.append(\" \" + a + \" \")\r\n else:\r\n text.append(\" \" + b + \" \")\r\nprint(text,sep=\"that\", end=\"it\")", "n = int(input())\r\nstr_ = 'I hate'\r\n\r\nfor i in range(1, n):\r\n if i % 2 == 1:\r\n str_ += ' that I love'\r\n elif i % 2 == 0 and i != 0:\r\n str_ += ' that I hate'\r\n\r\nprint(str_ + ' it')\r\n", "n = int(input())\r\nphrases = []\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n phrases.append('I hate')\r\n else:\r\n phrases.append('I love')\r\n\r\nprint(' that '.join(phrases), 'it')\r\n", "# -- coding: utf-8 --\n\"\"\"705A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YAcE_C3NXDvEY0NY_rHyte8StemSWBIK\n\"\"\"\n\nn=int(input())\nresult=\"\"\nfor i in range(1,n+1):\n if i%2==1:\n result+=\" I hate\"\n else:\n result+=\" I love\"\n if i!=n:\n result+=\" that\"\nresult+=\" it\"\nprint(result)", "n = int(input())\r\no = \"I hate it\"\r\nif n>1:\r\n for i in range(n-1):\r\n o = o[:-2]\r\n if i%2 == 0:\r\n o += \"that I love it\"\r\n else:\r\n o += \"that I hate it\"\r\nprint(o)", "n = int(input())\r\nresult = \"I hate\"\r\nis_hate = True\r\nfor i in range(2, n+1):\r\n if is_hate:\r\n result += \" that I love\"\r\n else:\r\n result += \" that I hate\"\r\n is_hate = not is_hate\r\nresult += \" it\"\r\nprint(result)", "hulk = int(input())\r\nstuff = []\r\nfor i in range(hulk):\r\n if i % 2 == 1:\r\n stuff.append(\"I love\")\r\n stuff.append(\"that\")\r\n else: stuff.append(\"I hate\"); stuff.append(\"that\")\r\ndel stuff[-1]\r\nprint(\" \".join(stuff)+\" it\")", "n = int(input())\r\nemotion_list = []\r\ni = 1\r\n\r\nwhile i < n + 1:\r\n if i == n:\r\n if i % 2 == 1:\r\n emotion_list.append(\"I hate it\")\r\n else:\r\n emotion_list.append(\"I love it\")\r\n else:\r\n if i % 2 == 1:\r\n emotion_list.append(\"I hate that\")\r\n else:\r\n emotion_list.append(\"I love that\")\r\n i += 1\r\n\r\nprint(\" \".join(emotion_list))\r\n", "numbers = int(input())\r\nfeeling = \"\"\r\nwhile numbers > 0:\r\n if numbers == 1:\r\n feeling += \"I hate it\" + \" \"\r\n numbers -= 1\r\n break\r\n else:\r\n feeling += \"I hate that\" + \" \"\r\n numbers -= 1\r\n if numbers == 1:\r\n feeling += \"I love it\" + \" \"\r\n numbers -= 1\r\n break\r\n else:\r\n feeling += \"I love that\" + \" \"\r\n numbers -= 1\r\nprint(feeling)", "x=int(input())\r\nz=\"\"\r\nfor i in range(1,x+1):\r\n if i%2!=0:\r\n z+=\"I hate that \"\r\n else:\r\n z+=\"I love that \"\r\nq=z.split(\" \")\r\nq[-2]=\"it\"\r\na=' '.join(q)\r\nprint(a)\r\n", "n = int(input())\r\nlist1 = ['I love'](n)\r\nfor i in range(0,n,2):\r\n list1[i]='I hate'\r\nprint(list1,sep=\" that \",end=' it')\r\n", "a = int(input())\r\nn = 0\r\nwhile n != a:\r\n n += 1\r\n if n % 2 == 0 and n == a:\r\n print(\"I love it\")\r\n break\r\n elif n % 2 == 1 and n == a:\r\n print(\"I hate it\")\r\n break\r\n if n % 2 == 0:\r\n print(\"I love that\", end = \" \")\r\n else:\r\n print(\"I hate that\", end = \" \")\n# Wed Jul 12 2023 11:36:25 GMT+0300 (Moscow Standard Time)\n", "a=int(input())\r\nb=\"I hate \"\r\nc=\"I love \"\r\ns=\"\"\r\nfor i in range(a):\r\n if(i%2==0):\r\n s=s+b\r\n else:\r\n s=s+c\r\n if i>=0 and i<a-1:\r\n s=s+\"that \"\r\nprint(s+\"it\")", "n=int(input())\r\nt=\"\"\r\nq=0\r\nv=\"that\"\r\nfor i in range (n):\r\n if q==0:\r\n if i==n-1:\r\n v=\"it\"\r\n t+=f\"I hate {v} \"\r\n q=1\r\n elif q==1 :\r\n if i==n-1:\r\n v=\"it\"\r\n t+=f\"I love {v} \"\r\n q=0\r\nprint (t.strip())", "def hulk():\r\n n = int(input())\r\n odd_str = \"I hate \"\r\n even_str = \"I love \"\r\n\r\n ans = \"\"\r\n\r\n for i in range(1, n + 1):\r\n if n == 1:\r\n return odd_str + \"it\"\r\n if i % 2 != 0:\r\n ans += odd_str + \"that\"\r\n else:\r\n ans += even_str + \"that\"\r\n ans += \" \"\r\n\r\n return ' '.join(ans.split(' ')[:-2]) + \" it\"\r\n\r\n\r\nprint(hulk())", "n=int(input())\r\nfor i in range(n):\r\n if(i+1!=n):\r\n if(i%2==0):\r\n print(\"I hate\",end=\" that \")\r\n else:\r\n print(\"I love\", end=\" that \")\r\n else:\r\n if(i%2==0):\r\n print(\"I hate\", end=\" it\")\r\n else:\r\n print(\"I love\", end=\" it\")", "number = int(input())\r\nprint((['I hate','I love']50)[:number],sep=' that ',end=' it')\r\n\r\n", "n = int(input())\r\nf = [''] * (n + 1)\r\nf[1] = 'I hate it'\r\nfor i in range(2, n + 1):\r\n if i % 2:\r\n f[i] = f[i - 1][:-2] + 'that I hate ' + 'it'\r\n else:\r\n f[i] = f[i - 1][:-2] + 'that I love ' + 'it'\r\nprint(f[n])", "s=[]\nfor i in range(int(input())):s.append(['I hate', 'I love'] [i % 2])#append像.format一样标号使用\nprint(\" that \".join(s), end=\" it\\n\")\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Oct 4 17:47:48 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nstr1='I hate'\r\nstr2=' it'\r\nstr3=' that I love'\r\nstr4=' that I hate'\r\nn=int(input())\r\nfor i in range(1,n+1):\r\n if n==1:\r\n break\r\n elif i!=1 and i%2!=0:\r\n str1=str1+str4\r\n continue\r\n elif i!=1 and i%2==0:\r\n str1=str1+str3\r\n continue\r\nprint(str1+str2)", "#first layer = love , 2nd layer hate, 3rd layer love , 4th layer hate\r\n#1 = I hate it\r\n#2 =I hate that I love it\r\n#3 =I hate that I love that I hate it\r\n#\r\nn = int(input())\r\np = ['I hate', \"I love\"] * n\r\nprint(\" that \".join(p[:n]), \"it\")", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x))\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10\r\n# from functools import cmp_to_key\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n if not i:\r\n print('I ',end='')\r\n else:\r\n print('that I ',end='')\r\n if i%2:\r\n print('love ',end='')\r\n else:\r\n print('hate ',end='')\r\nprint('it')", "i=input()\r\na='I hate that I love that '\r\nb='I hate it'\r\nc='I hate that I love it'\r\nif int(i)%2==0:\r\n d=int(int(i)-2)/2\r\n print(aint(d),c,sep='')\r\nelse:\r\n d=int(int(i)-1)/2\r\n print(aint(d),b,sep='')", "a=int(input())\r\nn=\"I hate that I love that \"((a-1)//2)\r\nif a%2==0:\r\n print(n+\"I hate that I love it\")\r\nelse:\r\n print(n+\"I hate it\")", "n = int(input())\r\nfrase = ''\r\nfor i in range(n):\r\n if i+1 == 1:\r\n frase = 'I hate'\r\n elif (i+1)%2!=0 and i+1 != 1:\r\n frase += ' that I hate'\r\n else:\r\n frase += ' that I love'\r\nprint(frase, 'it')", "n=int(input())\r\n\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n if i<n:\r\n print('I hate that', end=\" \")\r\n else:\r\n print('I hate it', end=\" \")\r\n else:\r\n if i<n:\r\n print('I love that', end=\" \")\r\n else:\r\n print(\"I love it\", end=\" \")\r\n", "import sys\n\nfor line in sys.stdin: \n n = int(line)\n\n for i in range(n): \n if i % 2 == 0: \n print(\"I hate\", end = ' ')\n elif i % 2 == 1: \n print(\"I love\", end = ' ')\n if i != n-1: \n print(\"that\", end = ' ')\n else: \n print(\"it\", end = ' ')\n print()\n\n\n", "n = int(input())\r\ns1 = \"I hate that I love that \"\r\nif n%2!=0:\r\n print(s1((n-1)//2) + \"I hate it\")\r\nelse:\r\n print(s1((n-2)//2) +\"I hate that I love it\")", "n = int(input())\r\nword = \"I hate it\"\r\nword1 = \"I love it\"\r\nsumma = \"I hate it\"\r\nfor i in range(1, n+1):\r\n if i == 1:\r\n pass\r\n elif i % 2 == 0:\r\n summa = summa.replace('it', 'that') + ' ' + word1\r\n else:\r\n summa = summa.replace('it', 'that') + ' ' + word\r\nprint(summa)", "from sys import stdin\ninput = stdin.readline\n\n\nif __name__ == \"__main__\":\n n = int(input())\n data = [\"hate\", \"love\"]\n s = 'I'\n i = 1\n while i < n:\n s += f\" {data[i%2==0]} that I\"\n i += 1\n print(s, data[i%2==0], \"it\")\n\t\t \t \t \t\t \t \t\t \t\t\t\t \t \t", "a = ' I love'\r\nb = ' I hate'\r\nstring=''\r\nnum = int(input())\r\nfor i in range(num):\r\n if num>1:\r\n\r\n if i%2!=0:\r\n string = string + a\r\n else:\r\n string = string +b\r\n if num-1==i:\r\n continue\r\n else:\r\n\r\n string = string + ' that'\r\n else:\r\n string = b\r\n\r\n\r\n\r\n\r\n\r\nprint(string+' it')", "def hulk_speech(number):\r\n\tspeech = ['I hate','I love']\r\n\tif number == 1:\r\n\t\treturn 'I hate'\r\n\telif number % 2 == 0:\r\n\t\treturn ' that '.join(speech(int(number/2)))\r\n\telse:\r\n\t\treturn ' that '.join(speech(int(number/2))) + ' that I hate'\r\n\r\nprint(hulk_speech(int(input())), end = ' it')", "num = int(input())\r\ntext = ''\r\nfor i in range(1,num + 1):\r\n if i == num and i % 2 == 0:\r\n text = text + 'I love it '\r\n elif i == num and i % 2 != 0:\r\n text = text + 'I hate it '\r\n elif i % 2 == 0:\r\n text = text + 'I love that '\r\n elif i % 2 != 0:\r\n text = text + 'I hate that '\r\nprint(text)", "n = int(input())\r\n\r\nlayers = [\"I hate\", \"I love\"]\r\npointer = -1\r\n\r\nwhile(n > 1): \r\n pointer = (pointer+1) % 2\r\n print(\"{} that\".format(layers[pointer]), end = \" \")\r\n n -= 1\r\n\r\npointer = (pointer+1) % 2\r\nprint(\"{} it\".format(layers[pointer]), end = \" \")", "lines=int(input())\r\ntext=\"\"\r\nfor i in range(1,lines+1):\r\n if i==1:\r\n text+=\"I hate\"\r\n elif i%2==0:\r\n text+=\" that I love\"\r\n elif i%2!=0:\r\n text+=\" that I hate\"\r\nprint(text+\" it\")\r\n", "n=int(input())\r\nx=[]\r\nfor i in range(n):\r\n if i%2==0:\r\n if i==0:\r\n x.append('I hate')\r\n else:\r\n x.append('that I hate')\r\n else:\r\n x.append('that I love')\r\nx.append('it')\r\na=' '.join(map(str,x))\r\nprint(a)", "n=int(input())\r\nfor _ in range(1,n):\r\n if _&1==1:\r\n print('I hate that',end=' ')\r\n else:\r\n print('I love that',end=' ')\r\nif n&1==1:\r\n print('I hate it')\r\nelse:\r\n print('I love it')", "a = 'I hate'\r\nb = 'I love'\r\ns = ''\r\nn = int(input())\r\nif n > 1 and n % 2 == 1:\r\n for i in range(1,n + 1):\r\n if i % 2 == 1 and i < n:\r\n s = s + a + ' that '\r\n elif i % 2 == 0 and i < n:\r\n s = s + b + ' that '\r\n elif i == n:\r\n s = s + a + ' it'\r\nif n > 1 and n % 2 == 0:\r\n for i in range(1,n + 1):\r\n if i % 2 == 1 and i < n:\r\n s = s + a + ' that '\r\n elif i % 2 == 0 and i < n:\r\n s = s + b + ' that '\r\n elif i == n:\r\n s = s + b + ' it'\r\nif n == 1:\r\n s = 'I hate it'\r\nprint(s)\r\n", "r = ''\r\ns1 = 'I hate that '\r\ns2 = 'I love that '\r\nfor i in range(int(input())):\r\n r += s1 if i % 2 == 0 else s2\r\nr = r[: -5] + 'it'\r\nprint(r)", "a = int(input())\r\nstring = \"\"\r\nfor c in range(a):\r\n if c % 2 != 0:\r\n string = string + \"that I love \"\r\n else:\r\n string = string + \"that I hate \"\r\nprint(string[4:] + \"it\")\r\n", "s=''\r\na1=int(input())\r\nfor i in range(1,a1+1):\r\n if i%2==0:\r\n s=s+'I love'\r\n if i==a1:\r\n s=s+' it'\r\n else:\r\n s=s+' that '\r\n else:\r\n s=s+'I hate'\r\n if i==a1:\r\n s=s+' it'\r\n else:\r\n s=s+' that '\r\nprint(s)", "s1=\"I hate \"\r\ns2=\"I love \"\r\nn=int(input())\r\nans=s1\r\nfor i in range(1,n):\r\n ans=ans+\"that \"\r\n if i%2==0:\r\n ans=ans+s1\r\n else:\r\n ans=ans+s2\r\nans=ans+\"it\"\r\nprint(ans)", "t = int(input())\r\ng=\"I hate\"\r\nfor i in range(t-1):\r\n\tif(i%2==0):\r\n\t\tg+=\" that I love\"\r\n\telse:\r\n\t\tg+=\" that I hate\"\r\nprint(g+\" it\")", "san = int(input())\r\nresult = ''\r\nhate = 'I hate'\r\nlove = 'I love'\r\nres = []\r\nfor i in range(1,san+1):\r\n if i %2==1:\r\n res.append(hate)\r\n elif i%2==0:\r\n res.append(love)\r\nfor i in res:\r\n result += i+' that '\r\nprint(result[:-5:]+'it')", "n = int(input())\r\nfeeling = \"I hate \"\r\nfor i in range(2, n + 1):\r\n feeling += \"that I love \" if i % 2 == 0 else \"that I hate \"\r\nfeeling += \"it\"\r\nprint(feeling)\r\n", "i=int(input())\r\nif i==1:\r\n print(\"I hate it\")\r\nelse:\r\n for u in range(1,i):\r\n if u%2==0:\r\n print(\"I love that\",end=' ')\r\n else:\r\n print(\"I hate that\",end=' ')\r\n if i%2==0:\r\n print(\"I love it\")\r\n else:\r\n print(\"I hate it\")", "n = int(input())\r\nprint('I hate', end=' ')\r\nfor i in range(0,n-1):\r\n if i % 2 == 0:\r\n print('that I love', end=' ')\r\n else:\r\n print('that I hate', end=' ')\r\nprint('it')\r\n", "n = int(input())\r\nbegin = 'I hate'\r\nend = 'it'\r\nfor i in range (n-1):\r\n begin = begin + ' that I love' if i%2 == 0 else begin + ' that I hate'\r\nprint(begin, end)", "n = int(input())\r\nif n==1:\r\n print(\"I hate it\")\r\nelif n==2:\r\n print(\"I hate that I love it\")\r\nelse:\r\n for i in range(n-1):\r\n if i%2==0:\r\n print(\"I hate that \",end=\"\")\r\n else:\r\n print(\"I love that \",end=\"\")\r\n if n%2==0:\r\n print(\"I love it\",end=\"\")\r\n else:\r\n print(\"I hate it\",end=\"\")\r\n", "r=int(input())\r\nt=\"I hate\"\r\nfor i in range(2,r+1):\r\n\tif i-1<r:t+=\" that\"\r\n\tif i%2==1:\r\n\t\tt+=\" I hate\"\r\n\telse:t+=\" I love\"\r\nelse:t+=\" it\"\r\nprint(t)", "n = int(input())\r\n\r\ni = 0\r\nres =''\r\nwhile i < n:\r\n if i % 2 == 0:\r\n if i ==0:\r\n res += 'I hate '\r\n else:\r\n res += 'that I hate '\r\n else:\r\n res += 'that I love '\r\n\r\n i+=1\r\nres += 'it'\r\nprint(res)\r\n\r\n\r\n", "def main(n):\r\n s = \"\"\r\n\r\n for i in range(n):\r\n s += (\"I hate\" if i % 2 == 0 else \"I love\")\r\n s += (\" it\" if i == n - 1 else \" that \") \r\n\r\n return s\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n\r\n print(main(n))", "n=int(input())\r\ntext=\"\"\r\nfor i in range(n):\r\n if i%2==0:\r\n text += \"I hate\"\r\n else:\r\n text += \"I love\"\r\n if n!=1 and i<n-1:\r\n text += \" that \"\r\n \r\nprint(text+\" it\")\r\n ", "n = int(input())\r\nflag, string = (False, 'I hate it') if n % 2 == 1 else (True, 'I love it')\r\nfor _ in range(n - 1):\r\n string, flag = ('I hate that ' if flag else 'I love that ') + string, not flag\r\nprint(string)", "n=int(input())\ns='I hate it'\nif n>1:\n for i in range(2,n+1):\n s=s.replace('it','that')\n if i%2==0: \n s+=' I love it'\n else:\n s+=' I hate it'\nprint(s)", "n = int(input())\r\np = []\r\nfor i in range(n):\r\n if i % 2 == 1:\r\n p.append('I love')\r\n else:\r\n p.append('I hate')\r\np1 = ' that '.join(p)\r\np1 += ' it'\r\nprint(p1)", "n = int(input())\r\nfeel = [\"I hate that\" if i % 2 != 0 else \"I love that\" for i in range(1, n)]\r\nfeel.append(\"I hate it\") if n%2 != 0 else feel.append(\"I love it\")\r\nprint(feel, sep=\" \")", "n = int(input())\r\n\r\nsequence = [\"I hate\", \"I love\"]\r\n\r\nres = sequence[0]\r\n\r\nfor i in range(1, n):\r\n res = res + \" that \" + sequence[i % 2]\r\n\r\nprint(res + \" it\")\r\n", "y, x, flag = int(input()), \"I hate \", 0\r\nfor _ in range(y-1):\r\n if flag == 0: x += \"that I love \"; flag = 1\r\n else: x += \"that I hate \"; flag = 0\r\nprint(x + \"it\")", "n = int(input())\r\nif n == 1:\r\n print(\"I hate it\")\r\nelse:\r\n s = \"\"\r\n word = [\"hate \", \"love \"]\r\n for i in range(n-1):\r\n s += \"I \"\r\n s += word[i%2]\r\n s += \"that \"\r\n s += \"I \"\r\n s += word[(i+1)%2]\r\n s += \"it\"\r\n print(s)", "#I hate that I love that I hate it\r\nn=int(input())\r\ns=\"\"\r\ni=0\r\nwhile(i<n):\r\n if(i%2==0):\r\n s=s+\"I hate \"\r\n else:\r\n s=s+\"I love \"\r\n i=i+1\r\n if(i==n):\r\n s=s+\"it\"\r\n else:\r\n s=s+\"that \"\r\nprint(s)", "n = int(input())\r\nfeelings = ['I hate', 'I love']\r\nrepeated_feelings = (feelings * 50)[:n]\r\nfeelings_string = ' that '.join(repeated_feelings) + ' it'\r\nprint(feelings_string)", "s = []\r\nn = int(input())\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n s.append('I hate')\r\n else:\r\n s.append('I love')\r\nprint(' that '.join(s), end=' it')", "n = int(input())\r\nfor i in range(n):\r\n if i % 2 == 0: print(\"I hate\", end=' ')\r\n else: print(\"I love\", end=' ')\r\n if i < n-1: print('that', end=' ')\r\nprint('it')", "a=int(input())\r\nb=\"I hate\"\r\nc=\"I love\"\r\nd=\" that \"\r\ne=\" it\"\r\nf=\"\"\r\nfor i in range(1,a+1):\r\n if i%2!=0:\r\n f+=b\r\n else:\r\n f+=c\r\n if i==a:\r\n f+=e\r\n else:\r\n f+=d\r\nprint(f)", "t=int(input())\r\nresult=\"\"\r\nfor i in range(1,t+1):\r\n if (i%2==0):\r\n result+=\"I love \"\r\n else:\r\n result+=\"I hate \"\r\n if i!=t:\r\n result+=\"that \"\r\nresult+=\"it\"\r\nprint(result)", "n = int(input())\ntext = []\nfor i in range(n):\n if i % 2 == 0:\n text.append('I hate')\n else:\n text.append('I love')\nprint(' that '.join(text) + ' it')", "n = int(input())\r\n\r\nfor i in range(1, n+1):\r\n if i % 2 == 0:\r\n print(\"I love it\") if (i == n) else print(\"I love that\" , end=\" \")\r\n else:\r\n print(\"I hate it\") if (i == n) else print(\"I hate that\" , end=\" \")", "n = int(input())\n\ns = ''\nfor i in range(1, n+1):\n if (i % 2 == 1):\n layer = \"I hate\"\n else:\n layer = \"I love\"\n s = s + layer\n if i < n:\n s = s + \" that \"\ns = s + \" it\"\nprint(s)\n", "num = int(input())\r\nlst=[]\r\nfor n in range(num):\r\n if n % 2 == 0:\r\n lst.append(\"I hate \")\r\n else:\r\n lst.append(\"I love \")\r\nprint(\"that \".join(lst),end='')\r\nprint(\"it\")\r\n", "n = int(input())\r\nfeelings = [\"I hate\", \"I love\"]\r\n\r\nexp= \"I hate\"\r\nfor i in range(1, n):\r\n exp += \" that \" + feelings[i % 2]\r\n\r\nexp += \" it\"\r\nprint(exp)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Jul 31 08:25:38 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\nn = int(input())\r\n\r\ns = \"\"\r\na = \"I \"\r\nb = \"hate \"\r\nc = \"that \"\r\nd = \"love \"\r\ne = \"it\"\r\n\r\nif n > 1:\r\n for i in range(1, n+1):\r\n if i % 2 == 1:\r\n s = s + a + b\r\n else:\r\n s = s + a + d\r\n if i < n:\r\n s = s + c\r\nelse:\r\n s = a + b\r\n\r\nprint(s + e)", "x = \"I hate\"\r\ny = \"I love\"\r\ns = ''\r\n\r\nfor i in range(int(input())):\r\n if i % 2 == 0:\r\n s = s + x + \" that \"\r\n else:\r\n s = s + y + \" that \"\r\ns = s[:-6]\r\n\r\nprint(s, end=\" it\")\r\n", "n = int(input())\r\nfeel = \"\"\r\nfor i in range(1, n + 1):\r\n if(i % 2 == 1):\r\n feel += \"I hate that \"\r\n else:\r\n feel += \"I love that \"\r\nfeel = feel[:-5] + \"it\"\r\nprint(feel)", "a , s = int(input()) , ''\r\nif a%2==0:\r\n s= 'I hate that I love that '(a//2) + 'it'\r\n print(s.replace('that it','it'))\r\nelse:\r\n print('I hate that I love that '(a//2) + 'I hate it')", "# The string must always end with the word \"it\"\r\n# The even numbers are \"I love\"\r\n# The odd numbers are \"I hate\"\r\n# The space betwee them is the word \"that\"\r\n\r\n# So, 1 = \"I hate\" + \"it\" or \"I hate it\"\r\n# 2 = \" I hate that I love it \"\r\n\r\n\r\n\r\ninput1 = int(input()) # gives us n Number.\r\n\r\nending = \" it\" # tack this string onto the end with str-conct.\r\n\r\noutput = \"\" # make the output variable.\r\n\r\n# Let's try solving this problem with a for loop.\r\n# Concatination of a string is our method of solving.\r\n\r\n\r\n# Check whether number == 1\r\n\r\n# if number == 1, then just output the string for 1.\r\naddIt = False\r\n\r\nif input1 == 1:\r\n output = \"I hate it\"\r\n\r\n# else, run the for loop that will do the concatination.\r\n\r\n# This is the second pass at the problem. I originally wanted to involve a solution like this that used a for loop, and I think this solution is a little more intuative than the first solution.\r\nelse:\r\n addIt = True\r\n for n in range(input1):\r\n number = n + 1\r\n \r\n \r\n # if number in cycle is even, add the even string text.\r\n # I love\r\n if number % 2 == 0:\r\n output = output + \"I love\"\r\n # if number is odd, add the odd string text\r\n # I hate\r\n else:\r\n output += \"I hate\"\r\n \r\n # add \"that\" to string, so long as we are not on the last number.\r\n if number < input1:\r\n output = output + \" that \"\r\n# After we get the output from the for loop, we will have a string that we need to cap with the word \"it.\" I put in a Bool in the beginning of the else: statement that turns True. If it's True, we add the string \"it\" to the end of the long string as per the rule of the problem.\r\n \r\nif addIt == True:\r\n output = output + \" it\"\r\n\r\nprint(output)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# The code below does solve the solution.\r\n\"\"\"\r\nif input1 % 2 == 0: # if the n is even do this:\r\n output = \"I hate that I love that \"(input1//2)\r\n output = output.split()\r\n output[-1] = \"it\"\r\n output = \" \".join(output)\r\nelif input1 == 1: # if n is 1.\r\n output = \"I hate it\"\r\nelse: # n is odd and is not the number 1\r\n output = (\"I hate that I love that \"(input1//2)) + \"I hate it\"\r\n \r\nprint(output)\r\n\"\"\"\r\n\r\n", "x = int(input())\r\nl = \"\"\r\nfor i in range(1,x+1):\r\n if i%2==0:\r\n s = \"I love \"\r\n else:\r\n s = \"I hate \"\r\n if i==x:\r\n l+=s+\"it\"\r\n else:\r\n l+=s+\"that \"\r\nprint(l)", "a = int(input())\r\nr = (a+1)//2\r\np1 = \"I hate that\"\r\np2 = \"I love that\"\r\nres = (p1+\" \"+p2+\" \")r\r\nif a%2:\r\n print(res[:-17]+\"it\")\r\nelse:\r\n print(res[:-5]+\"it\")", "# 705A - Hulk\r\n\r\nhate = \"I hate that \"\r\nlove = \"I love that \"\r\nfeeling = \"\"\r\n\r\nn = int(input())\r\n\r\nfor i in range(1, n):\r\n if i == 0 or i % 2 == 0:\r\n feeling += love\r\n else:\r\n feeling += hate\r\n\r\nif n % 2 != 0:\r\n feeling += \"I hate it\"\r\nelse:\r\n feeling += \"I love it\"\r\n\r\nprint(feeling)", "n=int(input())\r\nf=\" \"\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n f+=\"I hate\"\r\n else:\r\n f+=\"I love\"\r\n if i!=n:\r\n f+=\" that \"\r\n else:\r\n f+=\" it\"\r\nprint(f)", "import sys\r\n\r\nN = int(sys.stdin.readline())\r\nres = []\r\nfor i in range(N):\r\n if i % 2 == 0:\r\n res.append(\"I hate\")\r\n else:\r\n res.append(\"I love\")\r\n\r\nprint(' that '.join(res)+\" it\")", "n = int(input())\nif n%2 == 0:\n print(\"I hate that I love that \"int(n/2-1)+\"I hate that I love it\")\nelse:\n print(\"I hate that I love that \"(n//2)+\"I hate it\")\n", "n = int(input())\r\nans = \"I hate\"\r\nhate = \" that I hate\"\r\nlove = \" that I love\"\r\nfor i in range(2, n+1):\r\n if i % 2 == 0:\r\n ans += love\r\n if i % 2 != 0:\r\n ans += hate\r\nprint(ans + \" it\")\r\n", "n=int(input())\r\n\r\nwords=\"I hate \"\r\n\r\nfor i in range (2,n+1):\r\n if i%2==0:\r\n words=words+\"that I love \"\r\n else:\r\n words=words+\"that I hate \"\r\n\r\nprint(f\"{words}it\")", "n= int(input())\r\ns1='I hate '\r\ns2='I love '\r\nres='I hate '\r\nfor i in range(1,n):\r\n if i%2==1:\r\n res+='that '+s2\r\n else:\r\n res+='that '+s1 \r\nprint('I hate it' if n==1 else res+'it')", "cnt = int(input())\r\na = [\"I hate\", \"I love\"] cnt\r\nprint(\" that \".join(a[:cnt]),\"it\")", "n=int(input())\r\ni=1\r\nwhile i<=n:\r\n print((\"I hate \" if i%2==1 else \"I love \")+(\"that\" if i!=n else \"it\"),end=\" \")\r\n i+=1", "n=int(input())\r\noutput=\"\"\r\nfor i in range(n):\r\n if i%2==0:\r\n output+=\"I hate \"\r\n else:\r\n output+= \"I love \"\r\n output+=\"that \"\r\noutput=output[0:-5]+\"it\"\r\nprint(output)\r\n", "print(\" that \".join([\"I hate\",\"I love\"][i%2] for i in range(int(input()))),end=\" it\\n\")", "n = int(input()) # Read the number of layers\r\n\r\nfeeling_layers = [] # Initialize the list of feeling layers\r\n\r\nfor i in range(1, n + 1):\r\n if i % 2 == 1:\r\n feeling_layers.append(\"hate\")\r\n else:\r\n feeling_layers.append(\"love\")\r\n\r\nfeeling = \" that I \".join(feeling_layers) + \" it\" # Construct the final feeling\r\n\r\nprint(\"I \" + feeling) # Print Dr. Banner's feeling", "n = int(input())\r\na=\"\"\r\nfor i in range(1,n):\r\n\tif i%2 == 1:\r\n\t\ta=a+\" I hate that\"\r\n\telse:\r\n\t\ta=a+\" I love that\"\r\nif n%2 == 1:\r\n\ta=a+\" I hate it\"\r\nelse:\r\n\ta=a+\" I love it\"\r\nprint(a[1:])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# Read the input\r\nn = int(input())\r\n\r\n# Initialize the feeling string with the first layer \"hate\"\r\nfeeling = \"I hate\"\r\n\r\n# Iterate through each layer from 2 to n\r\nfor i in range(2, n+1):\r\n # Alternate between \"hate\" and \"love\" based on the layer number\r\n if i % 2 == 0:\r\n feeling += \" that I love\"\r\n else:\r\n feeling += \" that I hate\"\r\n\r\n# Add the final \"it\" at the end\r\nfeeling += \" it\"\r\n\r\n# Print Dr. Banner's feeling\r\nprint(feeling)\r\n", "n=int(input())\r\nres=\"\"\r\ni=1\r\nwhile i<=n:\r\n res=res+\"I \"\r\n if i%2==0:\r\n res=res+\"love \"\r\n else:\r\n res=res+\"hate \"\r\n if i<n:\r\n res=res+\"that \"\r\n else:\r\n res=res+\"it\"\r\n i=i+1\r\nprint(res)", "n=int(input())\r\nfor i in range(1,n+1):\r\n if i % 2 == 1:\r\n print(\"I hate\", end = \"\")\r\n else:\r\n print(\"I love\", end = \"\")\r\n if i < n:\r\n print(\" that \", end = \"\")\r\nprint(\" it \")\r\n \r\n", "s=int(input())\r\na=\"I hate \"\r\nb=\"I love \"\r\nans=\"\"\r\nfor i in range(s):\r\n if i&1:\r\n ans+=b\r\n else:\r\n ans+=a\r\n if i!=(s-1):\r\n ans+=\"that \"\r\nans+=\"it\"\r\nprint(ans)\r\n ", "n = int(input())\r\n\r\ns=\"hate\"\r\na=\"\"\r\n\r\nfor i in range(n):\r\n if i==n-1:\r\n a+=f'I {s} it'\r\n else:\r\n a += f'I {s} that '\r\n if s==\"hate\":\r\n s=\"love\"\r\n else:\r\n s=\"hate\"\r\nprint(a)", "n=int(input())\r\ns=''\r\nfor i in range(1,n):\r\n if i%2==0:\r\n s+=' I love that'\r\n else:\r\n s += ' I hate that'\r\nif n%2==0:\r\n s+=' I love it'\r\nelse:\r\n s += ' I hate it'\r\nprint(s[1:])", "n = int(input())\r\nhate = \"I hate that\"\r\nlove = \"I love that\"\r\n\r\nresult = ''\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n result = result + \" \" + hate\r\n else:\r\n result = result + \" \" + love\r\n\r\nprint(result[:-5].strip() + \" it\")", "n = int(input())\r\nbool_of_hate = True\r\noutput_list = []\r\nfor i in range(n):\r\n if i > 0:\r\n output_list.append('that')\r\n if bool_of_hate:\r\n output_list.append('I hate')\r\n bool_of_hate = False\r\n else:\r\n output_list.append('I love')\r\n bool_of_hate = True\r\n\r\noutput_list.append('it')\r\nprint(' '.join(output_list))", "i = int(input())\r\n\r\nf = ''\r\nprefixed = 'I '\r\n\r\nfor j in range(i):\r\n sufnotfixed = (' it' if j == i-1 else ' that ')\r\n f+= prefixed + ('hate' if j%2==0 else 'love') + sufnotfixed\r\nprint(f)", "a = int(input())\r\nl = []\r\nd = ['I hate','I love']\r\ne = 0\r\nfor i in range(a):\r\n l.append(d[e])\r\n e = 1-e\r\nl[-1] = l[-1] + ' it'\r\nprint(\" that \".join(l))", "def hulk():\r\n n = int(input())\r\n hate = \"I hate\"\r\n love = \"I love\"\r\n total = \"\"\r\n for i in range(1, n+1):\r\n if(i>1):\r\n total+=\" \"+\"that\" +\" \"\r\n if (i%2!=0):\r\n total +=hate\r\n else:\r\n total+=love\r\n #total+=\" \"+\"that\" +\" \"\r\n return(total+\" it\")\r\nprint(hulk())\r\n \r\n\r\n", "def main():\r\n n = int(input())\r\n for i in range(n):\r\n if i%2 == 0:\r\n print('I hate ', end='')\r\n else:\r\n print('I love ', end='')\r\n if i!= n-1:\r\n print('that ', end='')\r\n else:\r\n print('it')\r\n\r\n\r\nif __name__=='__main__':\r\n main()", "n = int(input())\n\nfor rep in range(1,n+1):\n if rep!=1:\n print(\"that \", end=\"\")\n if rep%2:\n print(\"I hate \", end=\"\")\n else:\n print(\"I love \", end=\"\")\n \n\nprint(\"it\")\n \t \t\t\t\t \t\t\t \t\t\t\t\t\t\t\t \t \t", "n=int(input())\r\nw1=\"that\"\r\nw2=\"it\"\r\nfor i in range(n):\r\n if(n==1):\r\n print(\"I hate it\",end=\" \")\r\n break\r\n if(i==n-1):\r\n if(n%2==0):\r\n print(\"I love it\",end=\" \")\r\n break\r\n else:\r\n print(\"I hate it\",end=\" \")\r\n break\r\n if(i%2==0):\r\n print(\"I hate that\",end=\" \")\r\n \r\n if((i%2)!=0):\r\n print(\"I love that\",end=\" \")\r\n\r\n \r\n\r\n \r\n ", "x=int(input())\r\nans=[]\r\nfor a in range(x):\r\n if a%2==0:\r\n ans.append(\"I hate\")\r\n ans.append(\" that \")\r\n elif a%2==1:\r\n ans.append(\"I love\")\r\n ans.append(\" that \")\r\nans[-1]=\" it\"\r\nfor b in range (2x):\r\n print(ans[b],end=(\"\"))", "n = int(input())\r\nt = []\r\ni = 0\r\nwhile(n>0):\r\n if(i&1):\r\n t.append('I love')\r\n else:\r\n t.append('I hate')\r\n n -= 1\r\n i += 1\r\n if(n):\r\n t.append('that')\r\nprint(' '.join(t), 'it')\r\n", "n = int ( input ())\r\nx = 1\r\nmessage = ''\r\nwhile (x <= n):\r\n if (x % 2 == 1): \r\n message += 'I hate '\r\n else:\r\n message += 'I love '\r\n x += 1\r\n if (x <= n):\r\n message += 'that '\r\nmessage += 'it'\r\nprint (message)\r\n", "def h(n):\r\n f = []\r\n for i in range(1, n + 1):\r\n if i % 2 == 1:\r\n f.append(\"I hate\")\r\n else:\r\n f.append(\"I love\")\r\n\r\n return \" that \".join(f) + \" it\"\r\n\r\nn = int(input())\r\n\r\nprint(h(n))", "#Coder_1_neel\r\na=int(input())\r\nx=[\"I hate\"]\r\nfor i in range(2,a+1):\r\n if(i%2==0):\r\n x.append(\"that I love\")\r\n elif(i%2!=0):\r\n x.append(\"that I hate\") \r\n\r\nx.append(\"it\")\r\nprint(x)", "n=int(input())\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n print(\"I hate \",end=\"\")\r\n else:\r\n print(\"I love \",end=\"\")\r\n if i!=n:\r\n print(\"that \",end=\"\")\r\nprint(\"it\")", "n=int(input())\r\nans=\"I hate\"\r\nhate=\" that I hate\"\r\nlove=\" that I love\"\r\nfor i in range(2,n+1):\r\n if i%2==0:\r\n ans+=love\r\n if i%2!=0:\r\n ans+=hate\r\nprint(ans+\" it\") ", "n = int(input())\r\n\r\nfeelings = []\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n feelings.append(\"I hate\")\r\n else:\r\n feelings.append(\"I love\")\r\n\r\nresult = \" that \".join(feelings) + \" it\"\r\n\r\nprint(result)", "def hulk(n):\r\n new=[]\r\n for i in range(1,n+1):\r\n if i%2==1:\r\n p1=\"I hate\"\r\n new.append(p1)\r\n else:\r\n p2=\"I love\"\r\n new.append(p2)\r\n if i!=n:\r\n p3=\"that\"\r\n new.append(p3)\r\n p4=\"it\"\r\n new.append(p4)\r\n res=\" \".join(new)\r\n return res\r\nn=int(input())\r\nprint(hulk(n))", "\r\ndef hulk(a):\r\n c=\"\"\r\n for i in range(a):\r\n if i == 0:\r\n c+=\"I hate\"\r\n if i != 0:\r\n if i %2 == 0:\r\n c+=\" that I hate\"\r\n else:\r\n c+=\" that I love\"\r\n c+=\" it\"\r\n return c\r\na = int(input())\r\nprint(hulk(a))\r\n", "a=int(input())\r\nb=''\r\nfor i in range(0,a):\r\n if i>=1:\r\n b=b+'that '\r\n if i%2==0:\r\n b=b+'I hate '\r\n else:\r\n b=b+'I love '\r\nprint(b+'it')\r\n ", "l=[]\r\nx=int(input())\r\nfor i in range(x):\r\n if i ==(x-1):\r\n if i%2==0:\r\n l.append(\"I hate it\")\r\n else:\r\n l.append(\"I love it\")\r\n break\r\n else:\r\n \r\n if i%2==0:\r\n l.append(\"I hate that\")\r\n else:\r\n l.append(\"I love that\")\r\nprint(l)\r\n", "m=int(input())\r\nprint('I hate',end=\" \")\r\nfor i in range(2,m+1):\r\n if i % 2!=0:\r\n print(\"that I hate\",end=\" \")\r\n else:\r\n print(\"that I love\",end=\" \")\r\nprint(\"it\",end=\" \")\r\n", "x=int(input())\r\ns=\"\"\r\nfor i in range(x):\r\n if i%2==0 and i==x-1:\r\n s+=\"I hate it \"\r\n elif i%2==1 and i==x-1:\r\n s+=\"I love it \"\r\n elif i%2==0:\r\n s+=\"I hate that \"\r\n else:\r\n s+=\"I love that \" \r\nprint(s)\r\n \r\n \r\n ", "n = int(input()) \r\ns = \"I hate \"\r\nk = n\r\nwhile n>1:\r\n s = s + \"that I \"\r\n if (k-n) % 2 == 0:\r\n s = s + \"love \"\r\n else:\r\n s = s + \"hate \"\r\n n -= 1\r\nprint(s+\"it\")", "x = int(input())\r\nfeels = []\r\nfor i in range(x):\r\n if i % 2 == 0:\r\n feels.append(\"I hate\")\r\n else:\r\n feels.append(\"I love\")\r\n if i != x - 1:\r\n feels.append(\"that\")\r\nfeels.append(\"it\")\r\nprint(\" \".join(feels))\r\n", "n=int(input())\r\nfeelings=[]\r\n\r\nfor i in range(n):\r\n if i%2 == 0:\r\n feelings.append(\"I hate\")\r\n else:\r\n feelings.append(\"I love\")\r\n if i<n-1:\r\n feelings.append(\"that\")\r\n \r\nfeelings.append(\"it\")\r\nresult=\" \".join(feelings)\r\nprint(result)", "x = []\r\nfor i in range(int(input())):\r\n if i%2==0:\r\n x.append(\"I hate\")\r\n else:\r\n x.append(\"I love\")\r\nprint(\" that \".join(x)+\" it\")", "s = \"I hate\"\r\nn = int(input())\r\nfor i in range(0,n-1):\r\n s = s + \" that \"\r\n if(i%2==0):\r\n s = s + \"I love\" \r\n else:\r\n s = s + \"I hate\"\r\n \r\ns = s + \" it\"\r\nprint(s)", "a = int(input())\r\nans = ''\r\nfor i in range(2,a+1):\r\n\tif i%2==0:\r\n\t\tans+='that I love '\r\n\telse:\r\n\t\tans+='that I hate '\r\nprint('I hate '+ans+'it')", "x = int(input())\r\nhate = True\r\n\r\noutput = \"\"\r\n\r\nfor i in range(x - 1):\r\n if hate == True:\r\n output += \"I hate that \"\r\n else:\r\n output += \"I love that \"\r\n hate = not(hate)\r\n\r\nif x % 2 == 0:\r\n output += \"I love it\"\r\nelse:\r\n output += \"I hate it\"\r\n\r\nprint(output)\r\n", "n = int(input())\r\nfeel = [\"I hate that\" if i % 2 != 0 else \"I love that\" for i in range(1, n)]\r\nif n % 2 != 0:\r\n feel.append(\"I hate it\")\r\nelse:\r\n feel.append(\"I love it\")\r\nprint(feel, sep=\" \")", "yi = \"I hate\"\r\ner = \"I love\"\r\n\r\nN = int(input())\r\n\r\nfor i in range(N):\r\n if i % 2: print(er, end = \"\")\r\n else: print(yi, end = \"\")\r\n if i != N - 1:\r\n print(\" that \", end = \"\")\r\nprint(\" it\", end = \"\")", "n = int(input())\r\nresult = \"\"\r\n\r\nif n == 1:\r\n result = \"I hate it\"\r\nelif n > 1:\r\n result = \"I hate that\"\r\n\r\nfor i in range(2, n):\r\n if i % 2 == 1 and i != n:\r\n result += \" I hate that\"\r\n elif i % 2 == 0 and i != n:\r\n result += \" I love that\"\r\n\r\nif n % 2 == 0 and n > 1:\r\n result += \" I love it\"\r\nelif n > 1:\r\n result += \" I hate it\"\r\n\r\nprint(result)\r\n", "import sys\r\n\r\nN = int(input())\r\nj = N\r\nwhile(N > 1):\r\n sys.stdout.write(\"I hate that \")\r\n N -= 1\r\n if(N>1):\r\n sys.stdout.write(\"I love that \")\r\n N -= 1\r\n\r\nif(j%2==0):\r\n sys.stdout.write(\"I love it\")\r\nelse:\r\n sys.stdout.write(\"I hate it\")\r\n\r\n", "n = int(input())\r\nif n == 1:\r\n print(\"I hate it\", end=\"\")\r\nelif n > 1:\r\n print(\"I hate that\", end=\"\")\r\n \r\nfor i in range(2,n):\r\n if i % 2 == 1 and i != n:\r\n print(\" I hate that\", end=\"\")\r\n \r\n elif i % 2 == 0 and i != n:\r\n print(\" I love that\", end=\"\")\r\n\r\nif n % 2 == 0 and n > 1:\r\n print(\" I love it\")\r\nelif n > 1 :\r\n print(\" I hate it\")", "n = int(input())\r\ns=\"\"\r\nlst = ['I hate ','I love ']\r\na = 0\r\nfor i in range(n):\r\n s+=lst[i%2]\r\n a+=1\r\n if i!=n-1:\r\n s+='that '\r\n \r\nprint(s+'it')\r\n", "n = int(input())\r\ns = \"\"\r\nfor i in range(1,n+1):\r\n if i%2:\r\n s += \"I hate \"\r\n else:\r\n s+= \"I love \"\r\n if i!=n:\r\n s+= \"that \"\r\n else:\r\n s+=\"it\"\r\nprint(s)", "n = int(input())\r\ns = \"\"\r\nc1 = \"that \"\r\nc2 = \"it \"\r\nodd = \"I hate \"\r\neven = \"I love \"\r\nif n==1:\r\n print(\"I hate it\")\r\nelse:\r\n #s = odd + c1\r\n for i in range(n):\r\n if i%2 != 0:\r\n s += even\r\n if i == n-1:\r\n s += c2\r\n else:\r\n s += c1\r\n else:\r\n s += odd\r\n if i == n-1:\r\n s += c2\r\n else:\r\n s += c1\r\nprint(s)", "s=\"\"\r\nn=int(input())\r\nfor i in range(1,n+1):\r\n if i%2==0:\r\n s=s+\"I love \"\r\n else:\r\n s=s+\"I hate \"\r\n if(i!=n):\r\n s=s+\"that \"\r\n else:\r\n s=s+\"it\"\r\nprint(s)", "\r\nimport math\r\n\r\nnumber = int( input() )\r\n\r\nfeel1 = \"I hate it\"\r\n\r\nfeel3 = \"I hate that I love that \"\r\n\r\nfeel4 = \"I hate that I love it \"\r\n\r\nif ( number == 1 ) :\r\n print( feel1 )\r\n \r\n\r\nif ( number % 2 == 1 ) and ( number > 1 ) :\r\n\r\n feelings = str( feel3 * ( math.floor( number / 2 ) ) )\r\n print( feelings + feel1 )\r\n \r\n\r\nif ( number % 2 == 0 ) and ( number >= 2 ) :\r\n\r\n feelings = str( feel3 * ( int( number / 2 ) - 1 ) )\r\n print( feelings + feel4 )\r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n \r\n", "s=int(input().strip())\r\nc=\"\"\r\nfor i in range(1,s+1):\r\n if i%2==1:\r\n c+=\" I hate \"\r\n else:\r\n c+=\" I love \"\r\n if i !=s:\r\n c+= \"that\"\r\n else:\r\n c+= \"it\"\r\nprint(c)", "def hulk(n):\r\n alist=[]\r\n for i in range(n-1):\r\n if i%2==0:\r\n alist.append(\"I hate that\")\r\n elif i%2!=0:\r\n alist.append(\"I love that\")\r\n if n%2==0:\r\n alist.append(\"I love it\")\r\n elif n%2!=0:\r\n alist.append(\"I hate it\")\r\n return alist\r\nn=int(input())\r\nresult=hulk(n)\r\nfor res in result:\r\n print(res,end=\" \")", "n = int(input())\r\n\r\narr = [0] * n\r\n\r\nfor i in range(n):\r\n if i + 1 == n and (i + 1) % 2 != 0:\r\n arr[i] = 'I hate it'\r\n elif i + 1 == n and (i + 1) % 2 == 0:\r\n arr[i] = 'I love it'\r\n else:\r\n if (i + 1) % 2 != 0:\r\n arr[i] = \"I hate that\"\r\n else:\r\n arr[i] = 'I love that'\r\n\r\nprint(' '.join(arr))", "n=int(input())\r\nst='I hate '\r\nfor i in range(1,n):\r\n st=st+'that '\r\n if i%2!=0:\r\n st=st+'I love '\r\n else:\r\n st=st+'I hate '\r\nst=st+'it'\r\nprint(st)\r\n ", "n,flag=int(input()),0\r\nfor i in range(1,n+1):\r\n if i==n:\r\n if i%2==0:print('I love it')\r\n else:print('I hate it')\r\n break\r\n if i%2==0:print('I love that',end=' ')\r\n else:print('I hate that',end=' ')", "n=int(input())\r\ns=''\r\ni=0\r\nwhile i<n:\r\n if i%2==0:\r\n s+=\"I hate \"\r\n else:\r\n s+=\"I love \"\r\n if i< n-1:\r\n s+=\"that \"\r\n i+=1\r\ns+=\" it\"\r\nprint(s)\r\n", "n = int(input())\r\nprint(' '.join(['I hate', 'I love'][i % 2] + (' that' if i != n - 1 else ' it') for i in range(n)))", "n = int(input())\r\nfeelings = []\r\n\r\nfor i in range(1, n):\r\n feelings.append(\"I hate that\" if i % 2 == 1 else \"I love that\")\r\n\r\nfeelings.append(\"I hate it\" if n % 2 == 1 else \"I love it\")\r\n\r\nprint(\" \".join(feelings))\r\n", "a = int(input())\r\nb = \"I love that \"\r\nc = \"I hate that \"\r\ne = \"I love it\"\r\nf = \"I hate it\"\r\ng = str()\r\nh = 0\r\nif a % 2 != 0:\r\n for i in range((a - 1) // 2):\r\n g += c\r\n g += b\r\n g += f\r\nelse:\r\n for i in range((a - 2) // 2):\r\n g += c\r\n g += b\r\n g += c\r\n g += e\r\nprint(g)", "n = int(input())\r\narray = ['I hate', 'I love'] * 50\r\nprint(array[:n], sep=' that ', end=' it')", "n = int(input())\r\ni = True\r\nfor _ in range(n - 1):\r\n if i:\r\n print(\"I hate that \", end=\"\")\r\n i = False\r\n else:\r\n print(\"I love that \", end=\"\")\r\n i = True\r\n\r\nif n % 2 == 0:\r\n print(\"I love it\")\r\nelse:\r\n print(\"I hate it\")\r\n", "love = 'I love'\r\nhate = 'I hate'\r\nn = int(input())\r\ni = 0\r\nres = ''\r\nwhile i < n:\r\n if i%2==0:\r\n if i==0:\r\n res += hate\r\n else:\r\n res += ' that ' + hate\r\n else: res += ' that ' + love\r\n i += 1\r\n\r\nres += ' it'\r\nprint(res)\r\n\r\n", "n=int(input())\r\na='I hate that '\r\nb='I love that '\r\nc='that'\r\nans=''\r\nif n==1:\r\n print('I hate it')\r\nelif n>1:\r\n for i in range (n):\r\n if i!=(n-1):\r\n if i%2==1:\r\n ans+=b\r\n elif i%2==0:\r\n ans+=a\r\n elif i==(n-1):\r\n if i%2==0:\r\n ans+='I hate it'\r\n else:\r\n ans+='I love it'\r\nprint(ans)\r\n \r\n", "n = int(input())\r\n\r\n# Strings\r\nhate = \"I hate\"\r\nlove = \"I love\"\r\nit = \"it\"\r\nthat = \"that\"\r\n\r\noutput = [hate]\r\n\r\nfor i in range(1, n):\r\n if i % 2 == 1:\r\n output.extend([that, love])\r\n else:\r\n output.extend([that, hate])\r\n\r\noutput.append(it)\r\n\r\nprint(\" \".join(output))", "\n\nn = int(input())\n\ns = ''\nfor i in range(n):\n s += 'I '\n if i % 2 == 0:\n s += 'hate '\n else:\n s += 'love '\n if i != n - 1:\n s += 'that '\ns += 'it'\nprint(s)\n \n ", "n = int(input())\r\n\r\nsugar = \"\"\r\n\r\nodd = \"I hate that \"\r\neven = \"I love that \"\r\n\r\nfor i in range(1,n+1):\r\n if i%2==0:\r\n sugar+= even\r\n else:\r\n sugar+= odd\r\n if i==n:\r\n pp = sugar.split(\" \")\r\n pp[-2] = \"it\"\r\n sugar = \" \".join(pp)\r\n \r\nprint(sugar)", "#705A\r\na=int(input())\r\nb=a\r\ns=''\r\ns1='I hate '\r\ns2='I love '\r\nfor i in range(a):\r\n if i%2==0:\r\n s+=s1\r\n else:\r\n s+=s2\r\n if b-1>0:\r\n s+='that '\r\n b-=1\r\ns+='it'\r\nprint(s)", "n=int(input())\r\nprint('I hate that I love that '(n//2 if n%2!=0 else n//2-1)+('I hate that I love it' if n%2==0 else 'I hate it'))", "s1 = 'I hate'\r\ns2 = 'I love'\r\nresult = ''\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n if i%2!=0:\r\n result+=s2+' '\r\n else:\r\n result+=s1+' '\r\n if i!= n-1:\r\n result+= 'that ' \r\n\r\nresult+='it '\r\nprint(result)", "# Read the number of layers\r\nn = int(input())\r\n\r\n# Initialize the feeling string\r\nfeeling = \"I hate\"\r\n\r\n# Loop to add \"that I love\" or \"that I hate\" for each layer\r\nfor i in range(1, n):\r\n if i % 2 == 1:\r\n feeling += \" that I love\"\r\n else:\r\n feeling += \" that I hate\"\r\n\r\n# Add \" it\" to complete the feeling\r\nfeeling += \" it\"\r\n\r\n# Print the feeling\r\nprint(feeling)\r\n", "n = int(input())\r\n\r\nhate = 'I hate'\r\nlove = 'I love'\r\n\r\nresult = ''\r\n\r\ni = 0\r\n\r\nwhile i < n:\r\n if i % 2 == 0:\r\n if i == 0:\r\n result += hate\r\n else:\r\n result += ' that ' + hate\r\n else:\r\n result += ' that ' + love\r\n\r\n i += 1\r\n\r\nresult += ' it'\r\nprint(result)", "k=int(input())\r\na=[]\r\nfor i in range(k):\r\n if i%2==0:\r\n a.append(\"I hate\")\r\n else:\r\n a.append(\"I love\")\r\nb=\" that \".join(a)\r\nb+=\" it \"\r\nprint(b)", "n=int(input())\nx=[]\nfor i in range(n):\n if i%2==0:\n x+=['I hate', 'that']\n else:\n x+=['I love', 'that']\n\nx[-1]='it'\nprint(x)", "ans=[]\r\ntemp=[]\r\nn=int(input())\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\ttemp.append(\"I hate \")\r\n\telif i%2!=0:\r\n\t\ttemp.append(\"I love \")\r\nans.append(\"that \".join(temp))\r\nans.append(\"it\")\r\nprint(\"\".join(ans))", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport itertools\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log, ceil\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right\r\n\r\nmod=1000000007\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\n\r\n\r\ndef solve():\r\n s = \"I hate\"\r\n n = int(input())\r\n\r\n for i in range(2, n+1):\r\n if i % 2 == 0:\r\n s += \" that I love\"\r\n else:\r\n s += \" that I hate\"\r\n s += \" it\"\r\n return s\r\n \r\nif __name__ == \"__main__\":\r\n print(solve())", "\r\nlayers = int(input())\r\nif layers % 2 == 0:\r\n for i in range(int(layers / 2 - 1)):\r\n print(\"I hate that I love that \", end='')\r\n print(\"I hate that I love it\", end='')\r\nelse:\r\n for i in range(int((layers - 1) / 2)):\r\n print(\"I hate that I love that \", end='')\r\n print(\"I hate it\", end='')\r\n", "n=int(input())\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n print(\"I hate \",end=\"\")\r\n if i<n:\r\n print(\"that \",end=\"\")\r\n else:\r\n print(\"I love \",end=\"\")\r\n if i < n:\r\n print(\"that \",end=\"\")\r\nprint(\"it\")\r\n ", "n=int(input())\r\ns = ['I hate', 'I love'] 50\r\ns_s=s[:n]\r\nprint(' that '.join(s_s), end=' it')", "n=int(input())\r\ns=\"I hate it\"\r\nif(n==1):\r\n print(s)\r\nelse:\r\n for i in range(n-1):\r\n l=s.split(\" \")\r\n l.pop()\r\n s=\" \".join(l)\r\n if(i%2==0):\r\n s+=\" that I love it\"\r\n else:\r\n s+=\" that I hate it\"\r\n print(s)", "n = int(input())\r\nh = ' I hate '\r\nt = 'that'\r\nl = ' I love '\r\ni = 'it'\r\ns = ''\r\nfor j in range(1,n+1):\r\n if j==1:\r\n s = s+'I hate '\r\n elif j%2==1:\r\n s = s + h\r\n else:\r\n s = s+l\r\n if j != n:\r\n s = s+t\r\ns = s+i\r\nprint(s)\r\n", "n=int(input())\r\na=\"I hate \"\r\nb=\"I love \"\r\nl=\"\"\r\nfor i in range(1,n+1):\r\n if 1<i<n+1:\r\n l+=\"that \"\r\n if i%2!=0:\r\n l+= a\r\n else:\r\n l+= b\r\n \r\nl+=\"it\"\r\nprint(l)", "c = ''\r\nfor i in range(int(input())):\r\n if i % 2 == 0:\r\n c += \"I hate that \"\r\n else:\r\n c += \"I love that \"\r\nprint(c[:len(c)-5]+\"it\")\r\n", "def creat(n):\r\n s=''\r\n for i in range(n):\r\n if((i+1)%2==1 and i+1==n):\r\n s+='I hate it'\r\n elif((i+1)%2==0 and i+1==n):\r\n s+='I love it'\r\n elif((i+1)%2==0 and i+1!=n):\r\n s+='I love that'\r\n elif((i+1)%2==1 and i+1!=n):\r\n s+='I hate that'\r\n s+=' '\r\n return s\r\n\r\nn=int(input())\r\nprint(creat(n))\r\n", "num = int(input())\n\nprint(\" that \".join([\"I love\" if i % 2 == 0 else \"I hate\" for i in range(1, num+1)]) + \" it\")\n", "k=int(input())\r\nif k==1:\r\n print(\"I hate it\")\r\nelse:\r\n for i in range(1,k):\r\n if i%2==0:\r\n print(\"I love that\",end=\" \")\r\n else:\r\n print(\"I hate that\",end=\" \")\r\nif k!=1 and k%2!=0:\r\n print(\"I hate it\")\r\nelif k%2==0:\r\n print(\"I love it\")", "n=int(input())\r\nst=''\r\nfor i in range(1,n+1):\r\n\r\n if i%2!=0:\r\n st=st+'I hate '\r\n else:\r\n st=st+'I love '\r\n if n>1:\r\n st=st+'that '\r\n n-=1\r\n else:\r\n st=st+'it '\r\n\r\nprint(st)", "n=int(input())\r\nfor i in range(1,n+1):\r\n if (i%2)!=0:\r\n print(\"I hate\",end=\" \")\r\n elif (i%2)==0:\r\n print(\"I love\",end=\" \")\r\n if i==(n):\r\n print(\"it\")\r\n else:\r\n print(\"that\",end=\" \")", "# URL: https://codeforces.com/problemset/problem/705/A\n\nprint(\"I hate\", end=\"\")\nfor i in range(2, int(input()) + 1):\n if i % 2 == 0:\n print(\" that I love\", end=\"\")\n else:\n print(\" that I hate\", end=\"\")\nprint(\" it\")\n", "n = int(input())\r\nfeeling = []\r\nfor i in range(1 , n+1) : \r\n if i%2 ==1 :\r\n feeling.append('I hate ')\r\n else :\r\n feeling.append('I love ')\r\n \r\n if i<n :\r\n feeling.append('that ') \r\nfeeling.append('it') \r\nresult =''.join(feeling) \r\nprint(result)\r\n", "#Initializes the number of layers\r\nlayers = int(input())\r\nanswer = ''\r\n\r\n#adds a phrase the amount of times as indicated\r\nfor i in range(layers):\r\n if i % 2 == 0: #if the number is currently odd or even\r\n answer += 'I hate '\r\n else:\r\n answer += 'I love '\r\n if i != (layers - 1): #if the number is the same as the input or not\r\n answer += 'that '\r\n else:\r\n answer += 'it'\r\n\r\nprint(answer)", "n = int(input())\r\nturn = False\r\nans = \"\"\r\nfor i in range(n -1):\r\n if turn:\r\n ans += \"I love that \"\r\n turn = False\r\n else:\r\n ans += \"I hate that \"\r\n turn = True\r\nif turn:\r\n ans += \"I love it \"\r\n turn = False\r\nelse:\r\n ans += \"I hate it \"\r\n turn = True\r\nprint(ans) \r\n", "# your code goes here\r\ndef main():\r\n n = int(input())\r\n\r\n if n == 1:\r\n print(\"I hate it\")\r\n elif n > 1:\r\n print(\"I hate that\", end=\"\")\r\n\r\n for i in range(2, n):\r\n if i % 2 == 1 and i != n:\r\n print(\" I hate that\", end=\"\")\r\n elif i % 2 == 0 and i != n:\r\n print(\" I love that\", end=\"\")\r\n\r\n if n % 2 == 0 and n > 1:\r\n print(\" I love it\")\r\n elif n > 1:\r\n print(\" I hate it\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s1 = \"that I love\"\r\ns2 = \"that I hate\"\r\nn = int(input())\r\nprint(\"I hate\", end=' ')\r\n\r\nf = True\r\nfor i in range(n - 1):\r\n if f:\r\n print(s1, end=' ')\r\n f = False\r\n else:\r\n print(s2, end=' ')\r\n f = True\r\nprint(\"it\")", "t = int(input())\r\nif t == 1:\r\n print(\"I hate it\",end = \" \")\r\nelif t == 2:\r\n print(\"I hate that I love it\",end = \" \")\r\nelse:\r\n for i in range(1,t+1):\r\n if i%2!=0:\r\n print(\"I hate\",end = \" \")\r\n elif i%2==0:\r\n print(\"I love\",end = \" \")\r\n if i == t:\r\n print(\"it\")\r\n break\r\n print(\"that\",end = \" \")\r\n ", "number = int(input())\r\n\r\nwhile number:\r\n print(\"I hate \", end='')\r\n number -= 1\r\n if number == 0:\r\n print(\"it \", end='')\r\n break\r\n else:\r\n print(\"that \", end='')\r\n\r\n if number:\r\n print(\"I love \", end='')\r\n number -= 1\r\n if number == 0:\r\n print(\"it\")\r\n break\r\n else:\r\n print(\"that \", end='')\r\n", "n=int(input())\r\ns=\"\"\r\nfor i in range(1,n+1):\r\n if i%2==1 and i==n:\r\n s+=\"I hate it\"\r\n elif i%2==1:\r\n s+=\"I hate that \"\r\n elif i%2==0 and i==n:\r\n s+=\"I love it\"\r\n elif i%2==0:\r\n s+=\"I love that \"\r\nprint(s)", "n=int(input())\r\nhate='I hate'\r\nlove='I love'\r\nans=hate\r\nh=False\r\nfor i in range(1,n):\r\n ans+=' that '\r\n if h:\r\n ans+=hate\r\n h=False\r\n else:\r\n ans+=love\r\n h=True\r\nans+=' it'\r\nprint(ans)", "n = int(input())\r\nans = \"I hate \"\r\nfor i in range(2,n+1):\r\n \r\n if i%2 == 0:\r\n ans = ans + \"that I love \"\r\n else:\r\n ans = ans + \"that I hate \"\r\n\r\nans = ans+\"it\"\r\nprint(ans)\r\n ", "T = int(input())\r\nl = ''\r\nfor i in range(1,T+1):\r\n if i%2 == 0 and not(i == T):\r\n l += 'I love that' + ' '\r\n elif not(i%2 == 0) and not(i == T) and T > 1:\r\n l += 'I hate that' + ' '\r\n elif not(i%2 == 0) and (i == 1 or i == T):\r\n l += 'I hate it' + ' '\r\n elif i%2 == 0 and i == T:\r\n l += 'I love it' + ' '\r\nprint(l)", "def hate_adder(b):\r\n b=b+\"I hate \"\r\n return b\r\ndef love_adder(b):\r\n b=b+\"I love \"\r\n return b\r\nn=int(input())\r\na=\"\"\r\nfor i in range(1,n+1):\r\n if(i%2==1):\r\n a=hate_adder(a)\r\n if(i!=n):\r\n a=a+\"that \"\r\n else:\r\n a=love_adder(a)\r\n if(i!=n):\r\n a=a+\"that \"\r\nprint(a+\"it\")", "n = int(input())\r\ns1 = 'I hate that '\r\ns2 = 'I love that '\r\nk1 = 'I hate it'\r\nk2 = 'I love it'\r\nans = []\r\nfor i in range(1,n+1):\r\n if i%2:\r\n if i == n:\r\n ans.append(k1)\r\n else:\r\n ans.append(s1)\r\n else:\r\n if i == n:\r\n ans.append(k2)\r\n else:\r\n ans.append(s2)\r\nprint(''.join(ans))", "n = int(input())\r\nif n == 1:\r\n print(\"I hate it\")\r\nelse:\r\n output = \"I hate\"\r\n for i in range(2, n+1):\r\n if i % 2 == 0:\r\n output += \" that I love\"\r\n else:\r\n output += \" that I hate\"\r\n output += \" it\"\r\n print(output)\r\n", "n=int(input())\r\nstring=\"\"\r\nfor i in range(1,n+1):\r\n if i%2!=0 and i==n:\r\n string+=\"I hate it \"\r\n elif i%2!=0:\r\n string+=\"I hate that \"\r\n elif i%2==0 and i==n:\r\n string+=\"I love it \"\r\n else:\r\n string+=\"I love that \" \r\nprint(string)", "def hulk_feeling(n):\r\n feelings = []\r\n for i in range(1, n+1):\r\n if i % 2 == 1:\r\n feelings.append(\"I hate\")\r\n else:\r\n feelings.append(\"I love\")\r\n if i < n:\r\n feelings.append(\"that\")\r\n feelings.append(\"it\")\r\n return \" \".join(feelings)\r\n\r\n# Read input\r\nn = int(input().strip())\r\n\r\n# Calculate the feeling and print the result\r\nprint(hulk_feeling(n))\r\n", "import sys\r\nnum = int(sys.stdin.readline().strip())\r\nanswer = []\r\nfor i in range(1, num + 1):\r\n if i == 1:\r\n answer = ['I hate', ' it']\r\n else:\r\n if i % 2 == 0:\r\n answer = answer[0:-1]\r\n answer.append(' that I love')\r\n answer.append(' it')\r\n if i % 2 != 0:\r\n answer = answer[0:-1]\r\n answer.append(' that I hate')\r\n answer.append(' it')\r\naa = ''\r\nfor i in answer:\r\n aa += i\r\nprint(aa)\r\n", "n=int(input())\r\nresult=\"\"\r\nfor m in range(1,n+1):\r\n if m %2!=0:\r\n \r\n if m==n:\r\n result+=\"I hate it\"\r\n else:\r\n result+=\"I hate that\"\r\n elif m%2==0:\r\n if m==n:\r\n result+=\" I love it \"\r\n else:\r\n result+=\" I love that \"\r\nprint(result)", "n = int(input())\n\nlst = [\"I hate\" if i % 2 == 0 else \"I love\" for i in range(n)]\n\nnlst = \" that \".join(lst) + \" it\"\n\nprint(nlst)\n\n\n\n", "n = int(input())\r\nfeel = \"\"\r\nfor i in range(1,n):\r\n if i%2 == 0:\r\n feel += \"I love that \"\r\n else:\r\n feel += \"I hate that \"\r\nfor i in range(1,n+1):\r\n if i==n and i%2==0:\r\n feel += \"I love it\"\r\n elif i==n and i%2 != 0:\r\n feel += \"I hate it\"\r\n else:\r\n pass\r\nprint(feel)", "n = int(input())\r\nfeelings = []\r\n\r\nfor i in range(1, n+1):\r\n if i % 2 == 1:\r\n feelings.append(\"hate\")\r\n else:\r\n feelings.append(\"love\")\r\n\r\nsentence = \" that I \".join(feelings) + \" it\"\r\nprint(\"I\", sentence)\r\n", "num=int(input())\r\nfor i in range(1,num+1):\r\n if i%2==0:\r\n print(\"I love \",end=\"\")\r\n else:\r\n print(\"I hate \",end=\"\")\r\n if i!=num:\r\n print(\"that \",end=\"\")\r\nprint(\"it\")", "n=int(input())\r\nfeeling=[]\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n feeling.append(\"I hate\")\r\n else:\r\n feeling.append(\"I love\")\r\n if i!=n:\r\n feeling.append(\"that\")\r\nfeeling.append(\"it\")\r\nresult = \" \".join(feeling)\r\nprint(result)\r\n", "n = int(input())\r\nx = \"I hate\"\r\nj = \" that I love \"\r\nk = \"that I hate\"\r\nfor i in range(0,n-1):\r\n if i%2==0:\r\n x+=j\r\n else:\r\n x+=k\r\n\r\nx=x+\" it\"\r\nprint(x)", "x=int(input())\r\ns1=\"I hate that I love that \"\r\ns2=\" I love it\"\r\ns3=\"I hate it\"\r\ns5=\"I hate that\"\r\nfor i in range(x):\r\n if(x==1):\r\n print(\" I hate it\")\r\n elif(x%2==0):\r\n print((s1)((x//2)-1)+ s5+ s2)\r\n elif(x%2!=0):\r\n print((s1)((x//2))+ s3 ) \r\n break\r\n\r\n", "if __name__ == \"__main__\":\r\n num = int(input())\r\n hate = \"I hate\"\r\n love = \"I love\"\r\n art = \"it\"\r\n art_det = \"that\"\r\n result = \"\"\r\n for i in range(1, num+1):\r\n if i % 2 == 0:\r\n result += love\r\n else:\r\n result += hate\r\n if i < num:\r\n result += \" \" + art_det + \" \"\r\n result += \" \" + art\r\n print(result)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Oct 12 17:09:38 2023\r\n\r\n@author: zinc 2300012115\r\n\"\"\"\r\nn = int(input())\r\ns = ''\r\nif n == 1:\r\n print('I hate it')\r\nelse:\r\n for i in range(2,n+1):\r\n if i%2 == 0:\r\n s+='that I love '\r\n else:\r\n s+='that I hate '\r\n print(f'I hate {s}it')\r\n \r\n", "n = int(input())\r\na = 1\r\nfor i in range(n):\r\n if i%2 == 0:\r\n print(\"I hate \", end=\"\")\r\n else:\r\n print(\"I love \",end=\"\")\r\n if a <n:\r\n print(\"that \",end=\"\")\r\n a +=1\r\nprint(\"it\")", "n = int(input())\r\ns = \"hate\"\r\nfor i in range(1,n+1):\r\n if i%2 != 0:\r\n if i == n:\r\n print(\"I hate it\",end = \" \")\r\n else:\r\n print(\"I hate that\",end = \" \")\r\n else:\r\n if i == n:\r\n print(\"I love it\",end = \" \")\r\n else:\r\n print(\"I love that\",end = \" \")\r\n", "N = int(input())\r\n\r\nanswer = 'I hate'\r\n\r\nfor i in range(1, N):\r\n answer += ' that '\r\n\r\n if i%2 == 0:\r\n answer += ' I hate '\r\n else:\r\n answer += ' I love '\r\n\r\nprint(answer + ' it')", "n=int(input())\r\nc=''\r\nfor i in range(1,n):\r\n if i%2==0:\r\n c+='I love that '\r\n else:\r\n c+='I hate that '\r\nif n%2==0:\r\n c+='I love it'\r\nelse:\r\n c+='I hate it'\r\nif n==1:\r\n print(\"I hate it\")\r\nelse:\r\n print(c)", "n = int(input())\r\nflag = True\r\nwhile n != 0:\r\n if n != 1:\r\n if flag == True:\r\n print('I hate that', end = ' ')\r\n flag = False\r\n else:\r\n print('I love that', end = ' ')\r\n flag = True\r\n elif flag == True:\r\n print('I hate it')\r\n else:\r\n print('I love it')\r\n n -= 1\r\n", "n = int(input())\r\nans = \"I hate\"\r\nfor i in range(1,n):\r\n if i & 1:\r\n ans += \" that I love\"\r\n else:\r\n ans += \" that I hate\"\r\n\r\nans += \" it\"\r\nprint(ans)", "hate = [\"I hate it\", \"I hate that\"]\r\nlove = [\"I love it\", \"I love that\"]\r\nn = int(input())\r\nres = []\r\nturn = 0\r\nindex = 1\r\ncurrent = hate\r\nfor i in range(n-1, -1, -1):\r\n if turn == 0:\r\n current = hate\r\n turn = 1\r\n elif turn == 1:\r\n current = love\r\n turn = 0\r\n if i == 0:\r\n index = 0\r\n res.append(current[index])\r\nres = \" \".join(res)\r\nprint(res)", "x = int(input())\r\n\r\nl1 = \"I hate \"\r\nl2 = \"I love \"\r\nfinal = \"\"\r\n\r\nfor i in range(x):\r\n if i % 2 == 0:\r\n final = final + l1\r\n else:\r\n final = final + l2\r\n if i != x - 1:\r\n final = final + \"that \"\r\n \r\nfinal = final + \"it\"\r\nprint(final)", "n=int(input())\r\nres=''\r\ns1=\"I love\"\r\ns2=\"I hate\"\r\ns3=\" it\"\r\ns4=\" that \"\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n if n-i>0:\r\n res=res+s2+s4\r\n elif i==n:\r\n res=res+s2+s3\r\n if i%2==0:\r\n if n-i>0:\r\n res=res+s1+s4\r\n elif i==n:\r\n res=res+s1+s3\r\nprint(res)", "total_layers = int(input())\r\n\r\nfor layer in range(total_layers):\r\n if layer % 2 == 0:\r\n print(\"I hate\", end=\" \")\r\n else:\r\n print(\"I love\", end=\" \")\r\n if layer != total_layers - 1:\r\n print(\"that\", end=\" \")\r\n\r\nprint(\"it\")", "n=int(input())\r\nresult=\"\"\r\nfor i in range(1, n+1):\r\n if i%2==0:\r\n if i==n:\r\n result+=\"I love it\"\r\n print(result)\r\n break\r\n else:\r\n result+=\"I love that \"\r\n \r\n else:\r\n if i==n:\r\n result+=\"I hate it\"\r\n print(result)\r\n break\r\n else:\r\n result+=\"I hate that \"\r\n \r\n \r\n ", "n = int(input())\r\n\r\n\r\nans = \"\"\r\n\r\n\r\nfor i in range(n):\r\n if i & 1 :\r\n ans += \"I love that\" + \" \"\r\n else :\r\n ans += \"I hate that\" + \" \"\r\n\r\nans = ans.strip(\"that \")\r\n\r\nprint(ans + \" it\")", "n=int(input())\r\nfeeling=''\r\nfor i in range(1,n+1):\r\n if i%2 == 1:\r\n feeling+='I hate '\r\n else:\r\n feeling+='I love '\r\n if i!=n:\r\n feeling+='that '\r\nfeeling+='it'\r\nprint(feeling)", "h = \"I hate\"\r\nl = \"I love\"\r\nthat = \" that \"\r\nresult = \"\"\r\nn = int(input())\r\nfor i in range(n-1):\r\n if i%2 == 0:\r\n result += h + that\r\n else :\r\n result += l + that\r\n\r\nif n % 2 == 0 :\r\n result += l + \" it\"\r\nelse :\r\n result += h + \" it\"\r\n\r\nprint(result)", "n=int(input())\r\nlst=list()\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n lst.append(\"I hate it\")\r\n \r\n else:\r\n lst.append(\"I love it\")\r\nstring=\" \".join(lst)\r\nprint(string.replace(\"it\",\"that\",n-1))", "x = []\r\noutput = \"\"\r\nnumber = int(input())\r\nfor i in range(0,number):\r\n \r\n if i%2 !=0 :\r\n x.append(\"I love that \")\r\n\r\n else:\r\n x.append(\"I hate that \")\r\n\r\n if i == number - 1:\r\n x[i] = x[i].replace('that','it')\r\n\r\nfor i in range (0,number):\r\n output+= x[i]\r\nprint(output)", "stroka = int(input())\r\n\r\nhate = 'I hate'\r\nlove = 'I love'\r\n\r\nresult=''\r\ni=0\r\n\r\nwhile i<stroka:\r\n if i%2==0:\r\n if i==0:\r\n result += hate\r\n else:\r\n result += ' that ' + hate\r\n else:\r\n result += ' that ' + love\r\n i+=1\r\nresult+=' it'\r\nprint(result)", "n = int(input())\r\nstr = \"I hate it\"\r\nfor i in range(1,n):\r\n if i % 2 != 0:\r\n str = str[:len(str)-2] + \"that I love it\"\r\n else:\r\n str = str[:len(str)-2] + \"that I hate it\"\r\nprint(str)", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Mon Jul 10 18:53:30 2023\n\n@author: yesenia\n\"\"\"\n\nlayers = int(input())\ni = 1\na = \"\"\nwhile True:\n \n if i % 2 != 0:\n a += \"I hate \" \n else:\n a += \"I love \"\n \n if i == layers:\n break\n i += 1\n a += \"that \"\n\nprint(a, \"it\") ", "n = int(input())\r\na = [\"I hate \", \"I love \"] * 100\r\na = a[:n]\r\no = \"that \".join(str(i) for i in a)\r\nprint(o, end = \"it\")", "\r\ndef strings(n):\r\n s1=\"I hate \"\r\n s2=\"I love \"\r\n s3=\"that \"\r\n s4=\"it \"\r\n a=\"\"\r\n for i in range(1,n+1):\r\n if i%2==1:\r\n if i==n:\r\n a=a+s1+s4\r\n else:\r\n a=a+s1+s3\r\n else:\r\n if i==n:\r\n a=a+s2+s4\r\n else:\r\n a=a+s2+s3\r\n print(a) \r\nn=int(input())\r\nstrings(n)\r\n ", "layers = int(input())\r\nstr = \"\"\r\n\r\nfor i in range(layers):\r\n if len(str) > 0: \r\n str += \" that \"\r\n if i % 2 == 0:\r\n str += \"I hate\"\r\n else:\r\n str += \"I love\"\r\n \r\nstr += \" it\"\r\n\r\nprint(str)\r\n ", "a=int(input())\r\nwazly=[]\r\n\r\nfor x in range(1,a+1):\r\n if x == a:\r\n if x % 2 == 0:\r\n wazly.append(\"I love it\")\r\n else:\r\n wazly.append(\"I hate it\")\r\n\r\n elif x % 2 == 1:\r\n wazly.append(\"I hate that \")\r\n elif x % 2 == 0:\r\n wazly.append(\"I love that \")\r\n\r\nfor l in wazly:\r\n print(l,end=\"\")\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nprint(\"I hate\",end=\" \")\r\nfor i in range(1,n):\r\n if i%2==1:\r\n print(\"that I love\",end=\" \")\r\n else:\r\n print(\"that I hate\",end=\" \")\r\nprint(\"it\")", "n = int(input()) \r\nm = [\"I hate\", \"I love\"] * n \r\nprint(\" that \".join(m[:n]), \"it\")", "n = int(input())\r\n\r\nfor i in range (n) :\r\n if i != (n-1) :\r\n if (i+1)%2 == 1 :\r\n print(\"I hate that\", end=\" \")\r\n else :\r\n print(\"I love that\", end=\" \")\r\n else :\r\n if n%2 == 1 :\r\n print(\"I hate it\")\r\n else : \r\n print(\"I love it\")\r\n\r\n ", "a = int(input())\r\nstring = \"\"\r\nfor i in range(a-1):\r\n if i%2 == 0:\r\n string += \"I hate that \"\r\n if i%2 == 1:\r\n string += \"I love that \"\r\nif a%2 == 0:\r\n string += \"I love it \"\r\nif a%2 == 1:\r\n string += \"I hate it \"\r\nprint(string)\r\n", "n=int(input());s=\"I hate it\"\r\nL=s.split()\r\nM=\"that I love it\".split()\r\nN=\"that I hate it\".split()\r\nif n==1:\r\n print(s)\r\nelse:\r\n for i in range(2,n+1):\r\n if i%2==0:\r\n L.remove(L[-1])\r\n L.extend(M)\r\n else:\r\n L.remove(L[-1])\r\n L.extend(N)\r\n r=\" \".join(L)\r\n print(r)\r\n", "n= int(input())\r\na=''\r\nfor i in range(n):\r\n if i%2==0:\r\n a+='I hate '\r\n else:\r\n a+='I love '\r\n if i<n-1:\r\n a+='that '\r\na+='it'\r\nprint(a)", "def hulk(n):\r\n feelings = [\"I hate\", \"I love\"]\r\n result = \"\"\r\n\r\n for i in range(1, n + 1):\r\n if i % 2 == 1:\r\n result += feelings[0]\r\n else:\r\n result += feelings[1]\r\n\r\n if i != n:\r\n result += \" that \"\r\n\r\n result += \" it\"\r\n return result\r\n\r\nn = int(input())\r\nprint(hulk(n))\r\n", "# Hulk\r\nn = int(input())\r\nsentimientos = ['I hate' if x % 2 != 0 else 'I love' for x in range(1, n + 1)]\r\nprint(\" that \".join(sentimientos)+\" it\")", "n=int(input())\na=\" I hate that\"\nb=\" I love that\"\nval = \"\"\nif n==1:\n val = \"I hate it\"\nelif n%2!=0:\n val=\"I hate that\"+(n//2-1)(b+a)+b+\" I hate it\"\nelse:\n val=\"I hate that\"+(n//2-1)(b+a)+\" I love it\"\n\nprint(val)\n", "n = int(input())\r\nm1 = \"I hate it\"\r\nm2 = \"I love it\"\r\nm3 = \"I hate that\"\r\nm4 = \"I love that\"\r\nk = n\r\nif n == 1:\r\n print(m1)\r\nelif n == 2:\r\n print(m3 + \" \" + m2)\r\nelse:\r\n while(n != 1):\r\n print(m3, end = \" \")\r\n n -= 1\r\n if n == 1:\r\n break\r\n else:\r\n print(m4, end = \" \")\r\n n -= 1\r\n if k%2 == 0:\r\n print(m2)\r\n else:\r\n print(m1)", "a=int(input())\r\ns=\"I hate\"\r\nfor i in range(2,a+1):\r\n if (i%2==0):\r\n s+=\" that I love\"\r\n else:\r\n s+=\" that I hate\"\r\ns+=\" it\"\r\nprint(s)", "n=int(input())\r\nl= \"I hate it\"\r\nl2=\"I hate that\"\r\nl1=\"I love it\"\r\nl3=\"I love that\"\r\ns=\"\"\r\nfor i in range(n):\r\n if n==1:\r\n s=s+l\r\n else:\r\n if (i+1)%2==0 and i==n-1:\r\n s=s+l1\r\n elif (i+1)%2==0 and i!=n-1 :\r\n s=s+l3\r\n elif (i+1)%2!=0 and i==n-1 :\r\n s=s+l\r\n else:\r\n s=s+l2\r\n s=s+\" \"\r\nprint(s)", "a= int(input())\r\nfor i in range(0,a):\r\n if(i==a-1):\r\n if(i==a-1 and i%2!=0):\r\n print(\"I love it\",end=\" \")\r\n if(i==a-1 and i%2==0):\r\n print(\"I hate it\",end=\" \")\r\n else:\r\n if(i%2==0):\r\n print(\"I hate that\",end=\" \")\r\n else:\r\n print(\"I love that\",end=\" \")\r\n", "n = int(input())\r\n\r\nfeeling = \"I hate\"\r\nfor i in range(2, n + 1):\r\n feeling += \" that I \" + (\"love\" if i % 2 == 0 else \"hate\")\r\n\r\nfeeling += \" it\"\r\nprint(feeling)\r\n", "n = int(input())\r\nl = [\"I hate\", \"I love\"] * n\r\nprint(\" that \".join(l[:n]),\"it\")", "import math\r\nt = 1#int(input())\r\nfor q in range(0, t):\r\n # lenght = int(input())\r\n # # lenght = 2\r\n # s = input().split(\" \")\r\n #chislo, delit = map(int, input().split(' '))\r\n n = int(input())\r\n\r\n # s2 = input().split(' ')\r\n # for i in range(0, len(s2)):\r\n # s2[i] = int(s2[i])\r\n\r\n for i in range(1, n + 1):\r\n if i != n:\r\n if i % 2 == 0:\r\n print('I love that ', end='')\r\n else:\r\n print('I hate that ', end='')\r\n else:\r\n if i % 2 == 0:\r\n print('I love it ', end='')\r\n else:\r\n print('I hate it ', end='')", "n = int(input())\r\na = 'I hate'\r\nb = 'I love'\r\nfinal = ''\r\n\r\nfor i in range(1, n + 1):\r\n if i % 2 == 1:\r\n if i < n:\r\n final += a + ' that '\r\n else:\r\n final += a + ' it'\r\n else:\r\n if i < n:\r\n final += b + ' that '\r\n else:\r\n final += b + ' it'\r\n\r\nprint(final)", "n=int(input())\r\nl = [] \r\nfor i in range(n):\r\n if i % 2 == 0:\r\n l.append(\"I hate\")\r\n else: \r\n l.append(\"I love\")\r\n if i == n - 1: \r\n l.append(\"it\")\r\n else:\r\n l.append(\"that\")\r\nprint(\" \".join(l)) \r\n", "n = int(input())\r\nbase = 'I hate that I love that ' * ((n - 1) // 2)\r\nadd = 'I hate it' if n % 2 != 0 else 'I hate that I love it'\r\nprint(base + add)\n# Mon Jul 10 2023 22:25:38 GMT+0300 (Moscow Standard Time)\n", "x = int(input())\r\ny = []\r\nfor i in range(1 , x+1):\r\n if i%2 == 0:\r\n y.append('I love')\r\n else:\r\n y.append(\"I hate\")\r\n if i != x :\r\n y.append(\" that \")\r\nst = ''.join(y) + ' it'\r\n\r\nprint(st)", "n = int(input())\r\nif n == 1:\r\n print('I hate it')\r\nelif n == 2:\r\n print('I hate that I love it')\r\nelse:\r\n s = ''\r\n for i in range(1, n):\r\n if i % 2 == 1:\r\n s += 'I hate ' + 'that '\r\n else:\r\n s += 'I love ' + 'that '\r\n if n % 2 == 1:\r\n s += 'I hate it'\r\n else:\r\n s += 'I love it'\r\n print(s)", "n=int(input())\r\ns=\"I hate\"\r\nfor i in range(1,n):\r\n s=s+' that '\r\n if i%2!=0:\r\n s=s+'I love'\r\n else:\r\n s=s+'I hate'\r\ns=s+' it'\r\nprint(s)", "n = int(input())\r\nstring = \"I hate \"\r\nfor i in range(1,n):\r\n if(i%2 != 0):\r\n string += \"that I love \"\r\n else:\r\n string += \"that I hate \"\r\n\r\nprint(string + \"it\")", "n= int(input())\r\n\r\nh=\"hate\"\r\nl=\"love\"\r\ni='I'\r\nt=\"that I\"\r\nit=\"it\"\r\nj=0\r\n\r\nif n==1:\r\n print(\"I hate it\")\r\nelse:\r\n print(i, end=\" \")\r\n while j<n:\r\n\r\n if j%2==0:\r\n print(h, end=\" \")\r\n if j%2!=0:\r\n print(l, end=\" \")\r\n if j!=n-1:\r\n print(t, end=\" \")\r\n if j==n-1:\r\n print(it, end=\" \")\r\n j+=1", "def hulk_feeling(layers):\r\n feeling = []\r\n for i in range(layers):\r\n feeling.append('I')\r\n if i % 2 == 0:\r\n feeling.append('hate')\r\n else:\r\n feeling.append('love')\r\n if i == layers - 1:\r\n feeling.append('it')\r\n else:\r\n feeling.append('that')\r\n return feeling\r\n\r\n[print(item, end=' ') for item in hulk_feeling(layers=int(input()))]", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\n\nif n == 1:\n sys.stdout.write(\"I hate it\")\n exit()\n\nstr_list = [None] * n\n\nfor i in range(n):\n if i % 2 == 0:\n str_list[i] = \"I hate\"\n\n elif i % 2 != 0:\n str_list[i] = \"I love\"\n\nstring = \" that \".join(str_list) + \" it\"\nsys.stdout.write(f\"{string}\")\n", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n layers = [\"I hate\", \"I love\"]\n n = int(input())\n print(\" that \".join(layers[i % 2] for i in range(\n n)) + \" it\" if n > 1 else layers[0] + \" it\")\n\n\nif __name__ == \"__main__\":\n main()\n", "a=int(input())-1\r\ns='I hate'\r\ng=0\r\nfor i in range(a):\r\n if g%2:\r\n s+=\" that I hate\"\r\n else:\r\n s+=\" that I love\"\r\n g+=1\r\nprint(s+\" it\")", "x = int(input())\r\ny = \"I hate \"\r\nfor i in range(2, x+1):\r\n if i % 2 == 0:\r\n y += \" that I love \"\r\n else:\r\n y += \" that I hate \"\r\ny += \"it\"\r\nprint(y)", "n=int(input())\r\nc=''\r\nfor i in range(1,n+1):\r\n if i % 2 != 0 :\r\n if i==1:\r\n c+='I hate'\r\n else:\r\n c+=' that '+'I hate'\r\n else:\r\n c+=' that '+'I love '\r\nprint(c+' it')", "n = int(input())\r\n\r\nlast = \"I love\"\r\n\r\ns = \"\"\r\nfor i in range(n):\r\n if last==\"I love\":\r\n s += \" I hate that\"\r\n last = \"I hate\"\r\n elif last==\"I hate\":\r\n s += \" I love that\"\r\n last = \"I love\"\r\n\r\n\r\ns = s.rstrip(\"that\")\r\ns += \"it\"\r\nprint(s.lstrip())", "n = int(input())\r\nodds = \"I hate \"\r\nevens = \"I love \"\r\nendl1 = \"it\"\r\nendl2 = \"that \"\r\nres = \"\"\r\nfor i in range(1,n+1):\r\n if i%2==0:\r\n res += evens\r\n if i==n:\r\n res += endl1\r\n else:\r\n res += endl2\r\n else:\r\n res += odds\r\n if i==n:\r\n res += endl1\r\n else:\r\n res += endl2\r\nprint(res)\r\n \r\n ", "a=int(input())\r\nif a==1:\r\n print(\"I hate it\")\r\nelif a%2==0:\r\n print(\"I hate that \",\"I love that I hate that \"(a//2-1),\"I love it\",sep=\"\")\r\nelse:\r\n print(\"I hate that I love that \"(a//2),\"I hate it\",sep=\"\")", "n=int(input())\r\nme=''\r\nuse='I hate that I love that '\r\nif n%2==0:\r\n base='I hate that I love it'\r\n for i in range(int(n/2)-1):\r\n me+=use\r\n me+=base\r\nelse:\r\n base='I hate it'\r\n for i in range(int(n/2)):\r\n me+=use\r\n me+=base\r\nprint(me)", "n = int(input())\r\ns = ''\r\nfor i in range(1, n+1):\r\n s += 'I hate that ' if i%2 else 'I love that '\r\n\r\ns = s[:-5] + 'it'\r\nprint(s)", "n=int(input())\r\na=n%2\r\nli=[\"I love it\", \"I hate it\"]\r\nans=[]\r\nwhile True:\r\n if n==1:\r\n ans.append(li[a])\r\n break\r\n elif n%2==a:\r\n ans.append(\"I hate that\")\r\n else:\r\n ans.append(\"I love that\") \r\n n-=1\r\nprint(\" \".join(ans))", "n = int(input())\r\n\r\ns = ''\r\n\r\nfor i in range(n-1):\r\n if (i+1)%2==0:\r\n s += 'I love that '\r\n else:\r\n s += 'I hate that '\r\nif n%2 == 0:\r\n s += 'I love it'\r\nelse:\r\n s += 'I hate it'\r\nprint(s)", "n = int(input())\r\ns1 = \"I hate\"\r\ns2 = \"I love\"\r\notv = \"I hate\"\r\nfor i in range(2, n+1):\r\n if i%2==1:\r\n otv += \" that \" + s1\r\n else:\r\n otv += \" that \" + s2\r\nprint(otv + \" it\")", "n = int(input())\na = [\"I hate\", \"I love\"] * n\nprint(\" that \".join(a[:n]),\"it\")", "n = int(input())\r\ndef speech(n):\r\n a = 'I hate it'\r\n b = 'I love it'\r\n c = 'I hate that'\r\n d = 'I love that'\r\n sentence = []\r\n if n == 1:\r\n print('I hate it')\r\n else:\r\n for i in range(n - 1):\r\n if i % 2 == 0:\r\n sentence.append(c)\r\n else:\r\n sentence.append(d) \r\n if n % 2 == 0:\r\n sentence.append(b)\r\n else:\r\n sentence.append(a)\r\n return ' '.join(sentence)\r\nresult = speech(n)\r\nprint(result)", "a = 'I hate that '\r\nb = 'I love that '\r\nr = ''\r\nn = int(input())\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n if i == n - 1:\r\n r += 'I hate it'\r\n else:\r\n r += a\r\n else:\r\n if i == n - 1:\r\n r += 'I love it'\r\n else:\r\n r += b\r\nprint(r.rstrip())", "\r\nnum_repetitions = int(input())\r\n\r\nphrases = ['I hate', 'I love'] * 50\r\n\r\nselected_phrases = phrases[:num_repetitions]\r\n\r\n\r\nformatted_output = ' that '.join(selected_phrases)\r\n\r\n\r\nprint(formatted_output, end=' it')\r\n", "n = int(input())\nx = ''\nfor i in range(n):\n\tif x == '':\n\t\tx += 'I hate'\n\telif i%2 == 0:\n\t\tx += ' that I hate'\n\telse:\n\t\tx += ' that I love'\n\nprint(x+' it')\t\t\t\t", "def feeling(x,y):\r\n z=\"\"\r\n k=0\r\n for i in range(0,x):\r\n if k == 2:\r\n k=0\r\n if x > i+1 :\r\n z+=y[k]+\"that \"\r\n k+=1\r\n continue\r\n elif i <= x:\r\n z+=y[k]+\"it\"\r\n break\r\n return z\r\n\r\nx=int(input(\"\"))\r\ny=[\"I hate \",\" I love \"]\r\nprint(feeling(x,y))", "n = int(input())\r\ns = 'I hate that '\r\ns1 = 'I love that '\r\nx = ''\r\nif n <= 1:\r\n print('I hate it')\r\nelse:\r\n for i in range(1,n):\r\n if i % 2 == 0:\r\n x += s1\r\n else:\r\n x+=s\r\n if n % 2 == 0:\r\n print(x+'I love it')\r\n else:\r\n print(x+'I hate it')\r\n \r\n", "n = int(input())\r\nlst = []\r\nfor i in range(n):\r\n\tif i % 2 == 0:\r\n\t\tlst.append(\"I hate\")\r\n\telse:\r\n\t\tlst.append(\"I love\")\r\n\tif n > 1:\r\n\t\tif i != n - 1:\r\n\t\t\tlst.append(\"that\")\r\nlst.append(\"it\")\r\nprint(lst)\r\n\r\n\r\n\r\n", "n=int(input())\r\nodd=\"I hate\"\r\neven=\"I love\"\r\nstr=\"\"\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n str+=odd\r\n else:\r\n str+=even\r\n if(n!=i):\r\n str+=\" that \"\r\nprint(str+\" it\")", "numb = int(input())\r\nh, l = \" that I hate\", \" that I love\"\r\nprint(\"I hate\", end=\"\")\r\nfor i in range(numb - 1):\r\n if i % 2 == 0:\r\n print(l, end=\"\")\r\n else:\r\n print(h, end=\"\")\r\nprint(\" it\")\r\n", "l=int(input())\r\nfor i in range(1,l+1):\r\n if(i%2==1):\r\n print(\"I hate \",end=\"\")\r\n else:\r\n print(\"I love \",end=\"\")\r\n if(i!=l):\r\n print(\"that \",end=\"\")\r\nprint(\"it\",end=\" \")\r\n ", "n=int(input())\r\na='I hate that I love that '(n//2)\r\nif n%2==1:\r\n print(a+'I hate it')\r\nelse:\r\n print(a[:-5]+'it')", "n = int(input())\r\n\r\nif n==1: print(\"I hate it\\n\")\r\nelse:\r\n for i in range(1,n+1,1):\r\n if i%2 and i<n: \r\n print(\"I hate that\",end=' ')\r\n elif i%2==0 and i<n:\r\n print(\"I love that\",end=' ')\r\n else:\r\n if i%2: \r\n print(\"I hate it\\n\")\r\n else:\r\n print(\"I love it\\n\")", "try:\r\n n = int(input())\r\n if n >= 1 and n <= 100:\r\n\r\n bf,bfi,fs = [\"I hate\",\"I love\"],0,\"\"\r\n\r\n for i in range(n):\r\n fs += bf[bfi]\r\n \r\n if bfi == 1: bfi = 0\r\n else: bfi = 1\r\n\r\n if i != n-1: fs += \" that \"\r\n else: fs += \" it\"\r\n \r\n print(fs)\r\n\r\nexcept: pass", "n = int(input())\r\na = 'I hate'\r\nb = 'that'\r\nc = 'I love'\r\n\r\nfor i in range(n):\r\n if(i%2 ==0):\r\n print(f\"{a} \",end=\"\")\r\n else:\r\n print(f\"{c} \",end=\"\") \r\n \r\n if(i != n-1):\r\n print(f\"{b} \",end=\"\") \r\n\r\nprint(\"it\")", "n = int(input())\r\nlst = []\r\nfor i in range(n):\r\n if i % 2 != 0:\r\n lst.append(\"I love\")\r\n else:\r\n lst.append(\"I hate\")\r\n\r\nprint((\" that \".join(lst)) + \" it\")\r\n", "def hulk():\r\n n = int(input())\r\n s = ['I hate ', 'I love '] * n\r\n # print(s[:n])\r\n print('that '.join(s[:n]) + 'it')\r\n \r\nif __name__ == '__main__':\r\n hulk()", "import sys\r\n \r\nN = int(sys.stdin.readline())\r\na = \"that I love \"\r\nb = \"that I hate \"\r\ntemp = 1\r\nanswer = \"I hate \"\r\n \r\nwhile True:\r\n if N == 1:\r\n answer += \"it\"\r\n break\r\n elif N > 1:\r\n if temp == 1:\r\n answer += a\r\n N -= 1\r\n temp = 2\r\n elif temp == 2:\r\n answer += b\r\n N -= 1\r\n temp = 1\r\n \r\nprint(answer)", "n = int(input())\r\narray = []\r\nagrege_hate = False\r\nfor i in range(n):\r\n if agrege_hate:\r\n array.append(\"I love it\" if i == n - 1 else \"I love that\")\r\n agrege_hate = False\r\n else:\r\n array.append(\"I hate it\" if i == n - 1 else \"I hate that\")\r\n agrege_hate = True\r\n\r\nprint(\" \".join(array))", "# 705A - Hulk\r\n# https://codeforces.com/problemset/problem/705/A\r\n\r\n# Inputs:\r\n# 1) N - Número de capas\r\nn = int(input())\r\n\r\n# Frase de Hulk\r\nfrase = ''\r\n\r\n# Construye la frase\r\nfor capa in range(1,n+1):\r\n\r\n # Si la capa es impar, entonces añade 'I hate'\r\n if capa % 2 == 1:\r\n frase += 'I hate '\r\n \r\n # Si la capa es par, entonces añade 'I love'\r\n if capa % 2 == 0:\r\n frase += 'I love '\r\n\r\n # Si es la última capa, entonces termina la frase con 'it'\r\n if capa == n:\r\n frase += 'it'\r\n break\r\n\r\n # Entre capas, escribe 'that'\r\n frase += 'that '\r\n\r\n# Imprime la frase resultante\r\nprint(frase)", "a = int(input())\r\ntotal = 1\r\nq = []\r\nfor i in range(a):\r\n q.append('I')\r\n if i % 2 == 0:\r\n q.append('hate')\r\n else:\r\n q.append('love')\r\n if 0 < a - total:\r\n q.append('that')\r\n total += 1\r\nq.append('it')\r\nprint (' '.join(q))", "feelings = \"\"\r\nn = int(input())+1\r\nfor i in range(1,n):\r\n feelings += \"I hate\" if i%2!=0 else \"I love\"\r\n if i == n-1:\r\n break\r\n if n>2:\r\n feelings+=\" that \"\r\n \r\nfeelings+= \" it\"\r\nprint(feelings)", "def solve(n):\r\n ans = \"\"\r\n for i in range(1, n+1):\r\n if i % 2 == 1:\r\n ans += \"I hate\"\r\n else:\r\n ans += \"I love\"\r\n \r\n if i != n:\r\n ans += \" that \"\r\n else:\r\n ans += \" it\"\r\n return ans\r\n\r\n\r\ndef main():\r\n # Reading multiple test cases\r\n n = int(input())\r\n print(solve(n))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=int(input())\r\ntotal,d=[],''\r\nfor i in range(1,a+1):\r\n if i%2==0:\r\n total.append(\"I love\")\r\n else:\r\n total.append(\"I hate\")\r\nfor i in range(len(total)-1):\r\n d+=f\"{total[i]} that \"\r\nd+=f\"{total[-1]} it\"\r\nprint(d)", "n=int(input())\r\nsentence=[]\r\nx=1\r\nwhile x<=n:\r\n if x%2==1:\r\n sentence.append('that I hate')\r\n else:\r\n sentence.append('that I love')\r\n x+=1\r\nsentence=' '.join(sentence).split()\r\ndel sentence[0]\r\nsentence.append('it')\r\nprint(' '.join(sentence))", "n=int(input())\r\nstr=''\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n str=str+'I hate'\r\n else:\r\n str=str+'I love'\r\n if i!=n:\r\n str=str+' that '\r\nstr=str+' it'\r\nprint(str)\r\n ", "def express_feelings(n):\r\n if n==1:\r\n return \"I hate it\"\r\n elif n==2:\r\n return \"I hate that I love it\";\r\n else:\r\n return \"I hate that I love that \"+express_feelings(n-2)\r\nn=int(input())\r\nfeeling=express_feelings(n)\r\nprint(feeling)", "n = int(input())\r\ns = []\r\nfor i in range(1, n+1):\r\n if i == 1:\r\n s += 'I hate it'.split()\r\n elif i % 2 == 0:\r\n del s[s.index('it')]\r\n s += 'that I love it'.split()\r\n else:\r\n del s[s.index('it')]\r\n s += 'that I hate it'.split()\r\nprint(s)", "n=int(input())\r\nof=True\r\nif n==1:\r\n print(\"I hate it\")\r\nelse:\r\n while n>0:\r\n if n==1:\r\n if of == True:\r\n print(\"I hate it\")\r\n else:\r\n print(\"I love it\")\r\n break\r\n elif of == True:\r\n print(\"I hate that\",end=\" \")\r\n of = False\r\n elif of == False:\r\n print(\"I love that\",end=\" \")\r\n of = True\r\n n=n-1\r\n", "n = int(input())\r\nline = ''\r\nfor i in range(1,n+1):\r\n if i % 2 == 0:\r\n line += 'I love '\r\n if i == n:\r\n line += 'it '\r\n else:\r\n line += 'that '\r\n elif i % 2 != 0:\r\n line += 'I hate '\r\n if i == n:\r\n line += 'it '\r\n else:\r\n line += 'that '\r\nprint(line)\r\n", "n = int(input())\r\ns1 = \"I hate\"\r\ns2 = \"I love\"\r\nfinal = \"\"\r\nfor i in range(n):\r\n if i>0:\r\n final +=\" that \"\r\n if i%2==0:\r\n final +=s1\r\n else:\r\n final +=s2\r\nprint(final+\" it\")", "n=int(input(\"\"))\r\ns=\"\"\r\nif n==1:\r\n s+=\"I hate it\"\r\nelse:\r\n for i in range(n):\r\n i=i+1\r\n if i+1 > n:\r\n if n%2 == 0:\r\n s += \"I love it\"\r\n else:\r\n s += \"I hate it\"\r\n else:\r\n if i%2 == 0:\r\n s += \"I love that \"\r\n else:\r\n s += \"I hate that \"\r\nprint(s)\r\n", "a = int(input())\r\n\r\n\r\nhate = 'I hate'\r\nlove = 'I love'\r\n\r\nresult = ''\r\nfor i in range(a):\r\n if i%2 == 0:\r\n if i == 0:\r\n result += hate\r\n else:\r\n result += ' that ' + hate\r\n else:\r\n result += ' that ' + love\r\n \r\nresult += ' it'\r\nprint(result)", "n=int(input())\r\nh='I hate'\r\nlove='I love'\r\nif n==1:print(h+\" it\")\r\nelse:\r\n l=[]\r\n flag=True\r\n for i in range(n): \r\n if flag:\r\n if i>1:l.append('that')\r\n l.append(h)\r\n flag=False\r\n else:\r\n l.append('that')\r\n l.append(love)\r\n flag=True\r\n\r\n l.append('it')\r\n print(l)", "n = int(input())\n\nstring = \"\"\n\nfor x in range(1, n+1):\n if x % 2 != 0 and x != n:\n string += \"I hate that \"\n elif x % 2 == 0 and x != n:\n string += \"I love that \"\n elif x % 2 == 0 and x == n:\n string += \"I love it\"\n else:\n string += \"I hate it\"\nprint(string)\n\n", "V=''\r\nT=int(input())\r\nfor i in range(1,T+1):\r\n if i%2==0:\r\n V=V+'I love'\r\n if i==T:\r\n V=V+' it'\r\n else:\r\n V=V+' that '\r\n else:\r\n V=V+'I hate'\r\n if i==T:\r\n V=V+' it'\r\n else:\r\n V=V+' that '\r\nprint(V) ", "n = int(input())\r\nfor i in range(n):\r\n print(('I hate' if i%2 == 0 else 'I love'), end=(' it' if i+1 == n else ' that '))", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n if i%2==0:\r\n a.append(\"I hate\")\r\n else:\r\n a.append(\"I love\")\r\n \r\n if i!=n-1:\r\n a.append(\"that\")\r\na.append(\"it\")\r\n \r\nprint(\" \".join(a))", "def hulk(n):\r\n if n == 1:\r\n return \"I hate it\"\r\n \r\n feel = hulk(n - 1)\r\n if n % 2 == 0:\r\n return feel.replace(\"it\", \"that I love it\")\r\n else:\r\n return feel.replace(\"it\", \"that I hate it\")\r\n\r\nn = int(input())\r\nresult = hulk(n)\r\nprint(result)\r\n", "n = int(input())\r\nstring1 = 'I hate'\r\nstring2 = 'I love'\r\noutput = ''\r\nflag = True\r\nfor i in range(n):\r\n if i == n - 1:\r\n flag = False\r\n if i % 2 == 0 and flag:\r\n output += string1 + ' that '\r\n elif i % 2 == 1 and flag:\r\n output += string2 + ' that '\r\n elif i % 2 == 0:\r\n output += string1\r\n else:\r\n output += string2\r\nprint(output + ' it')", "n=int(input())\r\nx=str()\r\nfor i in range (n-1):\r\n if i%2==0:\r\n x=x+'I hate that '\r\n else:\r\n x=x+'I love that '\r\nif n%2==1:\r\n x=x+'I hate it'\r\nelse:\r\n x=x+'I love it'\r\n \r\nprint(x)\r\n", "#https://codeforces.com/problemset/problem/705/A\r\n\r\ndef get_messageListPosition(number):\r\n if(number%2 == 0):\r\n return 0\r\n return 1\r\n\r\ndef get_messageList():\r\n message_list= [\" that I hate\", \" that I love\"]\r\n return message_list\r\n\r\nlayers = int(input())\r\nmessage = \"\"\r\nmessageList = get_messageList()\r\n\r\nmessage += \"I hate\"\r\nfor i in range(1, layers):\r\n message += messageList[get_messageListPosition(i)]\r\nmessage += \" it\"\r\nprint(message)", "got = (int)(input())\r\nstr = \"\"\r\nfor i in range(got):\r\n if i > 0:\r\n str += \"that \"\r\n if i%2 == 0:\r\n str += \"I hate \"\r\n else:\r\n str += \"I love \"\r\n\r\nstr += \"it\"\r\nprint(str)", "n = int(input())\r\nfeelings = \"\"\r\nfor i in range(n):\r\n if i % 2 != 0 and i != (n-1):\r\n feelings += \"I love that \"\r\n elif i % 2 == 0 and i == (n-1):\r\n feelings += \"I hate it\"\r\n elif i % 2 != 0 and i == (n-1):\r\n feelings += \"I love it\"\r\n else:\r\n feelings += \"I hate that \"\r\nprint(feelings)\r\n\r\n\r\n\r\n", "n = int(input())\r\narr = [ \"I love\", \"I hate\"]\r\nans = []\r\nfor i in range(1, n + 1):\r\n ans.append(arr[i % 2])\r\n ans.append(\" that \")\r\nans.pop()\r\nans.append(\" it\")\r\nprint(\"\".join(ans))", "n = int(input())\r\ns = ''\r\n\r\nif n == 1:\r\n s = 'I hate it'\r\nelse:\r\n s = 'I hate that'\r\n\r\nfor i in range(n - 1):\r\n if i % 2 == 0 and i != n - 2:\r\n s += ' I love that'\r\n elif i % 2 != 0 and i != n - 2:\r\n s += ' I hate that'\r\n elif n % 2 == 0 and i == n - 2:\r\n s += ' I love it'\r\n elif n%2 != 0 and i == n - 2:\r\n s += ' I hate it'\r\n\r\nprint(s)\r\n", "def feeling(n):\r\n feelings=\"\"\r\n for i in range(1,n+1):\r\n if i%2==0:\r\n feelings+=\"I love \"\r\n else:\r\n feelings+=\"I hate \" \r\n if i<n:\r\n feelings+=\"that \"\r\n feelings+=\"it\"\r\n return feelings\r\nn=int(input())\r\nprint(feeling(n))\r\n ", "n = int(input())\r\noutput = \"I hate\"\r\nif n > 1:\r\n for i in range(2, n+1):\r\n if i % 2 == 0:\r\n output += \" that I love\"\r\n else:\r\n output += \" that I hate\"\r\noutput += \" it\"\r\nprint(output)", "n=int(input())\r\nk=0\r\na=\"I hate\"\r\nh=2\r\nfor i in range(n-1):\r\n if k==0:\r\n a=a+' that I love'\r\n k=1\r\n else:\r\n a=a+' that I hate'\r\n k=0\r\nprint(a+' it') \r\n", "n=int(input())\r\na=\"\"\r\nfor i in range(1,n+1):\r\n \r\n if i%2!=0 and i==n:\r\n a+=\"I hate it\"\r\n elif i%2==0 and i==n:\r\n \r\n a+=\"I love it\"\r\n elif i%2!=0 and i!=n:\r\n a+=\"I hate that \"\r\n elif i%2==0 and i!=n:\r\n a+=\"I love that \"\r\n \r\nprint(a)", "hulk = int(input())\nhate = \"I hate\"\nlove = \"I love\"\nemotions = \"\"\ni = 0\nwhile i < hulk:\n if i % 2 == 0:\n emotions += hate\n emotions += \" \"\n else:\n emotions += love\n emotions += \" \"\n i += 1\n if i < hulk:\n emotions += \"that\"\n emotions += \" \"\nprint(emotions+\"it\")\n", "nStr = input()\r\nn = int(nStr)\r\nans = \"\"\r\nfor x in range(n):\r\n if x % 2 ==0:\r\n ans += \"I hate \"\r\n else:\r\n ans += \"I love \"\r\n if x == n - 1:\r\n ans += \"it\"\r\n else:\r\n ans += \"that \"\r\nprint(ans)\r\n", "n=int(input())\r\na=\"\"\r\nfor i in range(n-1):\r\n if i%2==0:\r\n a=a+\"I hate that \"\r\n else:\r\n a=a+\"I love that \"\r\nif n%2!=0:\r\n a=a+\"I hate it \"\r\nelse:\r\n a=a+\"I love it \"\r\nprint(a)\r\n", "n = int(input())\r\nlst = list()\r\n\r\nfor i in range(0,n):\r\n if i % 2 == 0:\r\n lst.append('I hate ')\r\n if i % 2 == 1:\r\n lst.append('I love ')\r\n\r\n if i == n-1:\r\n lst.append('it')\r\n break\r\n lst.append('that ')\r\nprint(\"\".join(lst))", "n = int(input())\r\n\r\ns = 'I hate it'\r\nif n > 1:\r\n l1 = 'that I hate it'\r\n l2 = 'that I love it'\r\n for i in range(n - 1):\r\n if i % 2 == 0:\r\n s = s[:-2] + l2\r\n else:\r\n s = s[:-2] + l1\r\nprint(s)", "n = int(input()) # Read the input value of n\r\n\r\nfeelings = [\"I hate\" if i % 2 == 0 else \"I love\" for i in range(n)]\r\n\r\nfeeling = \" that \".join(feelings) + \" it\" # Join the feelings and add \"it\" at the beginning and end\r\n\r\nprint(feeling) # Print Dr. Banner's feeling", "x = int(input(\"\"))\r\nfor i in range(x):\r\n if i == x-1:\r\n if i%2 == 0:\r\n print(\"I hate it\" , end=\" \")\r\n else:\r\n print(\"I love it\", end=\" \")\r\n break\r\n if i%2 == 0:\r\n print(\"I hate that\", end=\" \")\r\n else:\r\n print(\"I love that\", end=\" \")", "q=int(input())\r\nprint((['I hate','I love']50)[:q],sep=' that ',end=' it')", "v=''\r\nh=int(input())\r\nfor i in range(1,h+1):\r\n if i%2==0:\r\n v=v+'I love'\r\n if i==h:\r\n v=v+' it'\r\n else:\r\n v=v+' that '\r\n else:\r\n v=v+'I hate'\r\n if i==h:\r\n v=v+' it'\r\n else:\r\n v=v+' that '\r\nprint(v)", "feeling = int(input())\r\nphrase = \"\"\r\ni = 1\r\nwhile i <= feeling:\r\n if (i % 2 == 1):\r\n phrase = phrase + \"I hate \"\r\n else:\r\n phrase = phrase + \"I love \"\r\n if (i == feeling):\r\n phrase = phrase + \"it\"\r\n else:\r\n phrase = phrase + \"that \"\r\n i = i + 1\r\nprint(phrase)", "n=int(input())\r\nprint('I hate ',end='')\r\nfor i in range(2,n+1):\r\n print('that ',end='')\r\n \r\n if i%2==0:\r\n print('I love ',end='')\r\n else:\r\n print('I hate ',end='')\r\nprint('it')", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n if i%2==1:\r\n if i==n-1:\r\n a.append('I love it')\r\n else: a.append('I love that ')\r\n else:\r\n if i==n-1:\r\n a.append('I hate it')\r\n else: a.append('I hate that')\r\nprint(a)", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nhate = 'I hate'\r\nlove = 'I love'\r\noutput = [ hate if i%2==0 else love for i in range(n)]\r\n\r\nprint(' that '.join(output) + ' it')\r\n\r\n", "\r\nn= int(input())\r\nisTrue= False\r\nwhile(n):\r\n if not isTrue:\r\n print(\"I hate\",end=\" \" )\r\n isTrue=True\r\n else:\r\n print(\"I love\",end=\" \")\r\n isTrue=False\r\n if n>1:\r\n print(\"that\",end=\" \")\r\n else:\r\n print(\"it\")\r\n n-=1", "n=int(input())\r\nfor i in range(n):\r\n if i%2==0 and i+1==n:\r\n print('I hate it',end=' ')\r\n elif i%2==0 and i+1!=n:\r\n print('I hate that',end=' ')\r\n elif i%2!=0 and i+1!=n:\r\n print('I love that',end=' ')\r\n else:\r\n print('I love it',end=' ')\r\n \r\n", "def main():\r\n n = int(input())\r\n for p in range(n):\r\n if p % 2 == 0:\r\n print(\"I hate \", end=\"\")\r\n else:\r\n print(\"I love \", end=\"\")\r\n\r\n if p == n - 1:\r\n print(\"it\")\r\n else:\r\n print(\"that \", end=\"\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\n\r\nif n == 1:\r\n print(\"I hate it\")\r\nelif n > 1 and n%2 == 0:\r\n lst = [\"I love it\"]\r\n for i in range(1,n):\r\n if i % 2 == 1:\r\n lst.insert(0,\"I hate that\")\r\n else:\r\n lst.insert(0,\"I love that\")\r\n print(\" \".join(lst))\r\nelif n > 1 and n%2 == 1:\r\n lst = [\"I hate it\"]\r\n for i in range(1,n):\r\n if i % 2 == 1:\r\n lst.insert(0,\"I love that\")\r\n else:\r\n lst.insert(0,\"I hate that\")\r\n print(\" \".join(lst))\r\n ", "n = int(input())\r\ns = 'I hate that'\r\nfor i in range(2,n+1):\r\n if (i%2!=0) :\r\n s = s + ' I hate that'\r\n else:\r\n s = s + ' I love that'\r\ns = s + ' it'\r\nl = s.split(' ')\r\nl.pop(len(l)-2)\r\ns = ' '.join(l)\r\nprint(s)", "n = int(input())\r\noutput = \"\"\r\nfor i in range(1, n):\r\n if (i % 2 == 1):\r\n output += \"I hate that \"\r\n else:\r\n output += \"I love that \"\r\nif(n % 2 == 1):\r\n output += \"I hate it\"\r\nelse:\r\n output += \"I love it\"\r\nprint(output)", "n=int(input())\r\ns1=\"I hate that\"\r\ns2=\"I love that\"\r\nif n % 2==0:\r\n for i in range(1,n):\r\n if i % 2==1:\r\n print(s1,end=\" \")\r\n else:\r\n print(s2,end=\" \")\r\n print(\"I love it\")\r\nelse:\r\n for i in range(1,n):\r\n if i % 2==1:\r\n print(s1,end=\" \")\r\n else:\r\n print(s2,end=\" \")\r\n print(\"I hate it\")", "a=int(input())\r\ns=\"\"\r\nc=0\r\nfor i in range(1,a+1):\r\n z=1\r\n if i==a and a%2==0:\r\n s+=\"I love it\"\r\n break\r\n elif i==a and a%2!=0:\r\n s+=\"I hate it\"\r\n break\r\n if z==1 and i%2!=0:\r\n s+=\"I hate that \"\r\n c+=1\r\n z=0\r\n \r\n if c==a:\r\n break\r\n if z==1 and i%2==0:\r\n s+=\"I love that \"\r\n c+=1\r\n z=0\r\n \r\n if c==a:\r\n break\r\n \r\nprint(s)\r\n ", "def bakchodhulk(n):\r\n l=[]\r\n for i in range(n):\r\n if i%2==0:\r\n l.append(\"I hate \")\r\n else:\r\n l.append(\"I love \")\r\n pf= [\"that \".join(l), \" it\"]\r\n return \"\".join(pf)\r\nn= int(input())\r\nprint(bakchodhulk(n))\r\n", "n = int(input())\np1 = \"I hate that\"\np2 = \"I love that\"\np3 = \"I love it\"\np4 = \"I hate it\"\n\nfor i in range(n-1):\n if (i+1)%2 == 0:\n print(p2, end=\" \")\n else:\n print(p1, end=\" \")\nif n%2 == 0:\n print(p3, end=\" \")\nelse:\n print(p4, end=\" \")", "a = int(input())\r\nb = []\r\nfor i in range(a):\r\n if i % 2 == 0:\r\n b.append('I hate')\r\n else:\r\n b.append('I love')\r\n if i == a - 1:\r\n b.append('it')\r\n else:\r\n b.append('that')\r\nprint (' '.join (b))", "n = int(input())\r\na = \"I hate\"\r\nb = \"I love\"\r\ns = []\r\nfor i in range(1,n+1):\r\n if i%2 == 1:\r\n s.append(a)\r\n else:\r\n s.append(b)\r\n if i == n:\r\n s.append(\"it\")\r\n else:\r\n s.append(\"that\")\r\nprint(\" \".join(s))", "n = int(input())\r\n\r\ni = 0\r\n\r\nres = []\r\n\r\nh = True\r\n\r\nwhile i < n - 1:\r\n\r\n if h: res.append('I hate that')\r\n else: res.append('I love that')\r\n\r\n h = not h\r\n\r\n i += 1\r\n\r\nif h: res.append('I hate it')\r\nelse: res.append('I love it')\r\n\r\n\r\nprint(' '.join(res))", "n=int(input())\r\nfeelings=['I hate','I love']\r\nans=''\r\nfor i in range(n):\r\n if i%2==0:\r\n ans+=feelings[i%2]\r\n else:\r\n ans+=feelings[i%2]\r\n if i!=n-1:\r\n ans+=' that '\r\n else:\r\n ans+=' it'\r\nprint(ans)", "n=int(input())-1\r\na=\"I hate\"\r\nb=a+\" that I love that I hate\"(n//2)+\" that I love\"*(n%2)+\" it\"\r\nprint(b)", "i = int(input())\r\na = \"I hate it\"\r\nb = \"I love it\"\r\n\r\nif i == 1:\r\n print(a)\r\nelse:\r\n flag = True\r\n msg = a\r\n for n in range(i-1):\r\n if flag:\r\n msg = msg.replace('it', 'that ') + b\r\n flag = not(flag)\r\n else:\r\n msg = msg.replace('it', 'that ') + a\r\n flag = not(flag)\r\n print(msg)", "n = int(input())\r\nfeeling=\"\"\r\nfor i in range(n):\r\n i=i+1\r\n if i == 1:\r\n feeling=feeling+\"I hate\"\r\n elif (i % 2) == 0:\r\n feeling=feeling+\" that I love\"\r\n elif (i % 2) != 0:\r\n feeling=feeling+\" that I hate\"\r\n \r\nprint(feeling+\" it\")", "a=\"I hate that \"\r\nb=\" I love that \"\r\n\r\nnumber=int(input())\r\nq=\"\"\r\n\r\nfor i in range(1,number+1):\r\n \r\n if i%2!=0 and i!=number:\r\n q+=a\r\n elif i%2==0 and i!=number:\r\n q+=b\r\n elif i%2!=0 and i==number:\r\n q+=\"I hate it\"\r\n elif i%2==0 and i==number:\r\n q+=\"I love it\"\r\n \r\nprint(q ) \r\n \r\n ", "times = int(input()) \r\nword = \"\"\r\nif times > 1: \r\n for i in range(times-1): \r\n if (i-1) % 2 != 0:\r\n word += 'I hate that '\r\n else: \r\n word += 'I love that '\r\n if times % 2 != 0:\r\n word += 'I hate it'\r\n else:\r\n word += 'I love it'\r\n print(word)\r\nelse:\r\n print('I hate it')", "x=int(input())\na='I hate '\nb='I love '\nc='that '\nout=''\n\nfor i in range(x):\n if i%2!=0:\n out+=b\n else:\n out+=a\n if i!=x-1:\n out+=c\n \nout+='it'\n\nprint(out)\n", "n=int(input())\r\nx= \"\"\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n x +=\"I hate\"\r\n else:\r\n x+=\"I love\"\r\n if i < n - 1:\r\n x+=\" that \"\r\nx +=\" it\"\r\nprint(x)\r\n", "# Read the number of layers\r\nn = int(input())\r\n\r\n# Initialize an empty string\r\nfeeling = \"\"\r\n\r\n# Loop through the layers\r\nfor i in range(1, n+1):\r\n if i % 2 == 1:\r\n feeling += \"I hate \"\r\n else:\r\n feeling += \"I love \"\r\n\r\n # Add \"that\" if it's not the last layer\r\n if i != n:\r\n feeling += \"that \"\r\n\r\n# Add \"it\" at the end\r\nfeeling += \"it\"\r\n\r\n# Print the feeling\r\nprint(feeling)\r\n", "n=int(input())\r\na=\"I hate\"\r\nfor i in range(2, n + 1):\r\n if i%2 == 0:\r\n a+=\" that I love\"\r\n else:\r\n a+=\" that I hate\"\r\na+=\" it\"\r\nprint(a)" ]	{"inputs": ["1", "2", "3", "4", "5", "10", "18", "19", "76", "77", "81", "82", "85", "86", "100", "99", "98", "33", "34", "57", "100"], "outputs": ["I hate it", "I hate that I love it", "I hate that I love that I hate it", "I hate that I love that I hate that I love it", "I hate that I love that I hate that I love that I hate it", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love it", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love it", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate it", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate it", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love it", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ..."]}	UNKNOWN	PYTHON3	CODEFORCES	532
8fd162f8011e9ed6789a81a11aa77d54	Winter is here	Winter is here at the North and the White Walkers are close. John Snow has an army consisting of n soldiers. While the rest of the world is fighting for the Iron Throne, he is going to get ready for the attack of the White Walkers. He has created a method to know how strong his army is. Let the i-th soldier’s strength be ai. For some k he calls i1,<=i2,<=...,<=ik a clan if i1<=<<=i2<=<<=i3<=<<=...<=<<=ik and gcd(ai1,<=ai2,<=...,<=aik)<=><=1 . He calls the strength of that clan k·gcd(ai1,<=ai2,<=...,<=aik). Then he defines the strength of his army by the sum of strengths of all possible clans. Your task is to find the strength of his army. As the number may be very large, you have to print it modulo 1000000007 (109<=+<=7). Greatest common divisor (gcd) of a sequence of integers is the maximum possible integer so that each element of the sequence is divisible by it. The first line contains integer n (1<=≤<=n<=≤<=200000) — the size of the army. The second line contains n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=1000000) — denoting the strengths of his soldiers. Print one integer — the strength of John Snow's army modulo 1000000007 (109<=+<=7). Sample Input 3 3 3 1 4 2 3 4 6 Sample Output 12 39	[ "import sys\nuseless = sys.stdin.readline()\na = list(map(int,sys.stdin.readline().split()))\nn = 1000001\nmod = 1000000007\ncnt = [0]n\nfor i in a:\n cnt[i]+=1\narr = [0]n\nans = 0\nfor i in range(n-1,1,-1):\n j = sum(cnt[i::i])\n if j > 0:\n arr[i]= (jpow(2,j-1,mod)-sum(arr[i::i]))%mod\n ans=(ans+iarr[i])%mod\nsys.stdout.write(str(ans))\n\n\t\t \t \t\t \t \t\t\t \t \t\t\t \t \t", "import sys\r\nmod=1000000007\r\nm=int(input())#20w\r\na=list(map(int,sys.stdin.readline().split()))#100w\r\nn=1000001#max a\r\nanswer=0\r\nans=[0]n\r\ncnt=[0]n\r\nfor i in a:\r\n cnt[i]+=1\r\nfor i in range(n-1,1,-1):\r\n j=sum(cnt[i::i])\r\n if j>0:\r\n ans[i]=(j(2(j-1))-sum(ans[(2i)::i]))%mod\r\n answer=(answer+ians[i])%mod\r\nprint(answer)\r\n\r\n\r\n", "input();a=list(map(int,input().split()));n,p=1000001,1000000007;c=[0]n\r\nfor i in a:c[i]+=1\r\nr,t=[0]n,0\r\nfor i in range(n-1,1,-1):\r\n k=sum(c[i::i])\r\n if k>0:r[i]=(kpow(2,k-1,p)-sum(r[i::i]))%p;t=(t+ir[i])%p\r\nprint(t,end='')", "import sys\r\n\r\nmod = 1000000007\r\nm = int(input()) # 20w\r\na = list(map(int, sys.stdin.readline().split())) # 100w\r\nn = 1000001 # max a\r\nanswer = 0\r\nans = [0] n\r\ncnt = [0] * n\r\nfor i in a:\r\n cnt[i] += 1\r\nfor i in range(n - 1, 1, -1):\r\n j = sum(cnt[i::i])\r\n if j > 0:\r\n ans[i] = (j * (2 ** (j - 1)) - sum(ans[(2 * i)::i])) % mod\r\n answer = (answer + i * ans[i]) % mod\r\nprint(answer)\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\nmod = pow(10, 9) + 7\r\na = list(map(int, input().split()))\r\nl = max(a) + 5\r\ncnt = [0] * l\r\nfor i in a:\r\n cnt[i] += 1\r\ndp = [0] * l\r\npow2 = [1]\r\nfor _ in range(n + 5):\r\n pow2.append(2 * pow2[-1] % mod)\r\nans = 0\r\nfor i in range(l - 1, 1, -1):\r\n s = 0\r\n for j in range(i, l, i):\r\n s += cnt[j]\r\n if not s:\r\n continue\r\n dpi = s * pow2[s - 1] % mod\r\n for j in range(2 * i, l, i):\r\n dpi = (dpi - dp[j]) % mod\r\n ans += dpi * i % mod\r\n ans %= mod\r\n dp[i] = dpi\r\nprint(ans)" ]	{"inputs": ["3\n3 3 1", "4\n2 3 4 6"], "outputs": ["12", "39"]}	UNKNOWN	PYTHON3	CODEFORCES	5
902081dac1e789e7037f497776442362	Recover Polygon (easy)	The zombies are gathering in their secret lair! Heidi will strike hard to destroy them once and for all. But there is a little problem... Before she can strike, she needs to know where the lair is. And the intel she has is not very good. Heidi knows that the lair can be represented as a rectangle on a lattice, with sides parallel to the axes. Each vertex of the polygon occupies an integer point on the lattice. For each cell of the lattice, Heidi can check the level of Zombie Contamination. This level is an integer between 0 and 4, equal to the number of corners of the cell that are inside or on the border of the rectangle. As a test, Heidi wants to check that her Zombie Contamination level checker works. Given the output of the checker, Heidi wants to know whether it could have been produced by a single non-zero area rectangular-shaped lair (with axis-parallel sides). The first line of each test case contains one integer N, the size of the lattice grid (5<=≤<=N<=≤<=50). The next N lines each contain N characters, describing the level of Zombie Contamination of each cell in the lattice. Every character of every line is a digit between 0 and 4. Cells are given in the same order as they are shown in the picture above: rows go in the decreasing value of y coordinate, and in one row cells go in the order of increasing x coordinate. This means that the first row corresponds to cells with coordinates (1,<=N),<=...,<=(N,<=N) and the last row corresponds to cells with coordinates (1,<=1),<=...,<=(N,<=1). The first line of the output should contain Yes if there exists a single non-zero area rectangular lair with corners on the grid for which checking the levels of Zombie Contamination gives the results given in the input, and No otherwise. Sample Input 6 000000 000000 012100 024200 012100 000000 Sample Output Yes	[ "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\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ninp = lambda dtype: dtype(input().strip())\r\ninp_d = lambda dtype: [dtype(x) for x in input().split()]\r\ninp_2d = lambda dtype, n: [inp(dtype) for _ in range(n)]\r\ninp_2ds = lambda dtype, n: [inp_d(dtype) for _ in range(n)]\r\ninp_enu = lambda dtype: [(i, x) for i, x in enumerate(inp_d(dtype))]\r\ninp_enus = lambda dtype, n: [[i, inp_d(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 < n\r\ndx, dy = (0, 1, 0, -1, 1, -1, 1, -1), (1, 0, -1, 0, 1, -1, -1, 1)\r\n\r\n\r\ndef find_rect():\r\n coor = [float('inf'), float('inf'), -float('inf'), -float('inf')]\r\n for i in range(n):\r\n for j in range(n):\r\n if grid[i][j] == '4':\r\n coor = [min(coor[0], i), min(coor[1], j), max(coor[2], i), max(coor[3], j)]\r\n\r\n try:\r\n for i in range(coor[0], coor[2] + 1):\r\n for j in range(coor[1], coor[3] + 1):\r\n if grid[i][j] != '4':\r\n exit(print('No'))\r\n except:\r\n exit(print('No'))\r\n\r\n\r\ndef check():\r\n for i in range(n):\r\n for j in range(n):\r\n mem = {(i, j): False, (i, j + 1): False, (i + 1, j): False, (i + 1, j + 1): False}\r\n\r\n for k in range(8):\r\n x, y = i + dx[k], j + dy[k]\r\n\r\n if valid(x, y) and grid[x][y] == '4':\r\n if (x, y) in mem:\r\n mem[(x, y)] = True\r\n if (x, y + 1) in mem:\r\n mem[(x, y + 1)] = True\r\n if (x + 1, y) in mem:\r\n mem[(x + 1, y)] = True\r\n if (x + 1, y + 1) in mem:\r\n mem[(x + 1, y + 1)] = True\r\n\r\n if grid[i][j] != '4' and sum(mem.values()) != int(grid[i][j]):\r\n exit(print('No'))\r\n\r\n\r\nn = inp(int)\r\ngrid = inp_2d(str, n)\r\nfind_rect()\r\ncheck()\r\nprint('Yes')\r\n", "def check_cell(i, j, n):\n\tk = 0\n\tif i > 1 and field[i-1][j]: k += 1\n\tif i < n-1 and field[i+1][j]: k += 1\n\tif j > 1 and field[i][j-1]: k += 1\n\tif j < n-1 and field[i][j+1]: k += 1\n\tif k < 2:\n\t\treturn 0\n\telif k < 4:\n\t\treturn k-1\n\telse:\n\t\treturn 4\n\nn = int(input())\nfield = []\n\nfor i in range(n):\n\ttemp = [int(x) for x in input()]\n\tfield.append(temp)\n\ndef main():\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif field[i][j] and not field[i][j] == check_cell(i, j, n):\n\t\t\t\tprint('No')\n\t\t\t\treturn 0\n\n\tprint('Yes')\n\nmain()", "n = int(input())\nA = [input() for i in range(n)]\n\ndef early_exit():\n print(\"No\")\n exit()\nif n < 3:\n early_exit()\n# first find the corner\ncorner_row = []\nfor i in range(n):\n if '1' in A[i]:\n corner_row.append(i)\nif len(corner_row) != 2:\n early_exit()\n# now for each of the corner row, find the corresponding column\n# check everything before the first index\ndef check_zero(x):\n for i in x:\n if i != '0':\n return False\n return True\n\n\nfor i in range(corner_row[0]):\n if not check_zero(A[i]):\n early_exit()\nfor i in range(corner_row[1]+1, n):\n if not check_zero(A[i]):\n early_exit()\n#find first non-zero for the two corner row\nfor j in range(n):\n if A[corner_row[0]][j] != '0':\n left_corner = j\n break\nfor j in range(n-1,-1,-1):\n if A[corner_row[0]][j] != '0':\n right_corner = j\n break\nif A[corner_row[0]][left_corner] != '1' or A[corner_row[0]][right_corner] != '1' or left_corner == right_corner:\n early_exit()\nfor j in range(n):\n if A[corner_row[1]][j] != '0':\n left2_corner = j\n break\nfor j in range(n-1,-1,-1):\n if A[corner_row[1]][j] != '0':\n right2_corner = j\n break\nif A[corner_row[1]][left2_corner] != '1' or A[corner_row[1]][right2_corner] != '1' or left_corner != left2_corner or right_corner != right2_corner:\n early_exit()\n# by now we have find the row interval to check\n# check the first and last row\nfor i in corner_row:\n for j in range(left_corner+1, right_corner):\n if A[i][j] != '2':\n early_exit()\n# check zero blocks in between\nfor i in range(corner_row[0]+1, corner_row[1]):\n if not check_zero(A[i][:left_corner]):\n early_exit()\n if not check_zero(A[i][right_corner+1:]):\n early_exit()\n if A[i][left_corner] != '2' or A[i][right_corner] != '2':\n early_exit()\n for j in range(left_corner+1, right_corner):\n if A[i][j] != '4':\n early_exit()\n\nprint(\"Yes\")\n \t \t\t\t \t \t \t \t\t \t\t\t \t\t", "def main():\r\n size = int(input())\r\n sq = [[int(c) for c in input().strip()] for _ in range(size)]\r\n print('Yes' if haslair(sq) else 'No')\r\n \r\ndef haslair(sq):\r\n corners = [(r, c) for r, row in enumerate(sq) for c, count in enumerate(row)\r\n if count==1]\r\n if len(corners) != 4:\r\n return False\r\n left, right, top, bottom = corners[0][1], corners[3][1], corners[0][0], corners[3][0]\r\n if right == left + 1 or bottom == top + 1:\r\n return False\r\n for r, row in enumerate(sq):\r\n for c, count in enumerate(row):\r\n score = 3 if top < r < bottom else 1 if r in (top, bottom) else 0\r\n score += 3 if left < c < right else 1 if c in (left, right) else 0\r\n if count != (0, 0, 1, 0, 2, None, 4)[score]:\r\n return False\r\n return True\r\n\r\nmain()", "N = int(input())\ngrid = []\nx1 = 50\ny1 = 50\nx2 = -1\ny2 = -1\nfor y in range(N):\n grid.append(list(map(int, input())))\n for x, num in enumerate(grid[-1]):\n if num == 4:\n x1 = min(x1, x)\n y1 = min(y1, y)\n x2 = max(x2, x)\n y2 = max(y2, y)\n\nif x1 == 51:\n print('No')\nelse:\n for y in range(N):\n for x in range(N):\n ex = 0\n if x1 <= x <= x2 and y1 <= y <= y2:\n ex = 4\n elif (x == x1-1 or x == x2+1) and y1 <= y <= y2:\n ex = 2\n elif (y == y1-1 or y == y2+1) and x1 <= x <= x2:\n ex = 2\n elif (x == x1-1 or x == x2+1) and (y == y1-1 or y == y2+1):\n ex = 1\n if ex != grid[y][x]:\n print('No')\n break\n else:\n continue\n break\n else:\n print('Yes')\n" ]	{"inputs": ["6\n000000\n000000\n012100\n024200\n012100\n000000", "6\n000000\n012210\n024420\n012210\n000000\n000000", "6\n000100\n001210\n002420\n001210\n000000\n000000", "10\n0000000000\n0122210000\n0244420100\n0122210000\n0000000000\n0000000000\n0000000000\n0000000000\n0000000000\n0000000000", "10\n0000000000\n0000000000\n0000000000\n0000000000\n0000000000\n0000000000\n0012100000\n0024200000\n0012100000\n0000000000", "9\n000000000\n000000000\n012221000\n024442000\n012221000\n000000000\n000000000\n000000010\n000000000", "9\n000000000\n012222100\n024444200\n024444200\n024444200\n024444200\n024444200\n012222100\n000000000", "8\n00000000\n00001210\n00002420\n00002020\n00001210\n00000000\n00000000\n00000000", "8\n00000000\n00000000\n01210000\n02420000\n01210000\n00000000\n00000000\n00000000", "7\n0000000\n0000000\n0000000\n1122210\n0244420\n0122210\n0000000", "7\n0000000\n0012210\n0024420\n0012210\n0000000\n0000000\n0000000", "6\n000000\n000000\n001100\n001200\n000000\n000000", "6\n000000\n000000\n002200\n002200\n000000\n000000", "6\n000000\n000000\n003300\n003300\n000000\n000000", "6\n000000\n001100\n013310\n013310\n001100\n000000"], "outputs": ["Yes", "Yes", "No", "No", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "No", "No", "No", "No"]}	UNKNOWN	PYTHON3	CODEFORCES	5
903195a712890e0984e95392fc3fad6d	Positions in Permutations	Permutation p is an ordered set of integers p1,<=<=p2,<=<=...,<=<=pn, consisting of n distinct positive integers, each of them doesn't exceed n. We'll denote the i-th element of permutation p as pi. We'll call number n the size or the length of permutation p1,<=<=p2,<=<=...,<=<=pn. We'll call position i (1<=≤<=i<=≤<=n) in permutation p1,<=p2,<=...,<=pn good, if \|p[i]<=-<=i\|<==<=1. Count the number of permutations of size n with exactly k good positions. Print the answer modulo 1000000007 (109<=+<=7). The single line contains two space-separated integers n and k (1<=≤<=n<=≤<=1000,<=0<=≤<=k<=≤<=n). Print the number of permutations of length n with exactly k good positions modulo 1000000007 (109<=+<=7). Sample Input 1 0 2 1 3 2 4 1 7 4 Sample Output 1 0 4 6 328	[ "mod=10*9+7\r\nn,k=map(int,input().split())\r\n\r\nA=[0](n+1)\r\nB=[0](n+1)\r\nC=[0](n+1)\r\nF=[0](n+1)\r\nG=[0](n+1)\r\n\r\nF[0]=G[0]=1\r\nfor i in range(1,n+1):\r\n\tG[i]=F[i]=F[i-1]i%mod\r\n\tG[i]=pow(F[i],(mod-2),mod)\r\n\r\nfor i in range(0,n):\r\n\tif i2>n:\r\n\t\tbreak\r\n\tB[i]=(F[n-i]G[i]G[n-i2])%mod\r\nfor i in range(0,n//2+1):\r\n\tfor j in range(0,n//2+1):\r\n\t\tA[i+j]=(A[i+j]+B[i]B[j])%mod\r\nfor i in range(0,n+1):\r\n\tA[i]=A[i]F[n-i]%mod\r\nfor i in range(0,n+1):\r\n\tfor j in range(0,i+1):\r\n\t\tC[j]=(C[j]+A[i]F[i]G[j]G[i-j](1-(i-j)%22))%mod\r\nprint(C[k]%mod)\r\n", "# METO Bot 0.9.9\nmod=10*9+7\nn,k=map(int,input().split())\n\nA=[0](n+1)\nB=[0](n+1)\nC=[0](n+1)\nF=[0](n+1)\nG=[0](n+1)\n\nF[0]=G[0]=1\nfor i in range(1,n+1):\n\tG[i]=F[i]=F[i-1]i%mod\n\tG[i]=pow(F[i],(mod-2),mod)\n\nfor i in range(0,n):\n\tif i2>n:\n\t\tbreak\n\tB[i]=(F[n-i]G[i]G[n-i2])%mod\nfor i in range(0,n//2+1):\n\tfor j in range(0,n//2+1):\n\t\tA[i+j]=(A[i+j]+B[i]B[j])%mod\nfor i in range(0,n+1):\n\tA[i]=A[i]F[n-i]%mod\nfor i in range(0,n+1):\n\tfor j in range(0,i+1):\n\t\tC[j]=(C[j]+A[i]F[i]G[j]G[i-j](1-(i-j)%22))%mod\nprint(C[k]%mod)\n\n\t\t\t\t \t \t \t\t \t \t\t\t \t" ]	{"inputs": ["1 0", "2 1", "3 2", "4 1", "7 4", "7 7", "8 4", "8 5", "10 3", "20 0", "100 99", "13 13", "100 100", "1000 0", "1000 1", "1000 2", "1000 10", "1000 99", "1000 500", "1000 700", "1000 900", "1000 999", "1000 998", "1000 1000", "999 0", "999 1", "999 5", "999 13", "999 300", "999 600", "999 999", "999 989", "999 998", "10 0", "5 0", "5 1", "5 2", "5 3", "5 4", "5 5", "4 4", "4 3", "4 2", "1 1", "2 2", "3 1", "3 3", "2 0", "3 0"], "outputs": ["1", "0", "4", "6", "328", "0", "2658", "688", "614420", "111008677", "2450", "0", "1", "845393494", "418947603", "819706485", "305545369", "115316732", "979041279", "642759746", "301804159", "249500", "583666213", "1", "184907578", "167859862", "642835575", "740892203", "562270116", "553332041", "0", "254295912", "250000", "543597", "21", "36", "42", "12", "9", "0", "1", "2", "10", "0", "1", "0", "0", "1", "2"]}	UNKNOWN	PYTHON3	CODEFORCES	2
903758cfd129ec5da50a446fab0de40f	Mahmoud and Ehab and the function	Dr. Evil is interested in math and functions, so he gave Mahmoud and Ehab array a of length n and array b of length m. He introduced a function f(j) which is defined for integers j, which satisfy 0<=≤<=j<=≤<=m<=-<=n. Suppose, ci<==<=ai<=-<=bi<=+<=j. Then f(j)<==<=\|c1<=-<=c2<=+<=c3<=-<=c4... cn\|. More formally, . Dr. Evil wants Mahmoud and Ehab to calculate the minimum value of this function over all valid j. They found it a bit easy, so Dr. Evil made their task harder. He will give them q update queries. During each update they should add an integer xi to all elements in a in range [li;ri] i.e. they should add xi to ali,<=ali<=+<=1,<=... ,<=ari and then they should calculate the minimum value of f(j) for all valid j. Please help Mahmoud and Ehab. The first line contains three integers n,<=m and q (1<=≤<=n<=≤<=m<=≤<=105, 1<=≤<=q<=≤<=105) — number of elements in a, number of elements in b and number of queries, respectively. The second line contains n integers a1,<=a2,<=...,<=an. (<=-<=109<=≤<=ai<=≤<=109) — elements of a. The third line contains m integers b1,<=b2,<=...,<=bm. (<=-<=109<=≤<=bi<=≤<=109) — elements of b. Then q lines follow describing the queries. Each of them contains three integers li ri xi (1<=≤<=li<=≤<=ri<=≤<=n, <=-<=109<=≤<=x<=≤<=109) — range to be updated and added value. The first line should contain the minimum value of the function f before any update. Then output q lines, the i-th of them should contain the minimum value of the function f after performing the i-th update . Sample Input 5 6 3 1 2 3 4 5 1 2 3 4 5 6 1 1 10 1 1 -9 1 5 -1 Sample Output 0 9 0 0	[ "import bisect\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m, 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, 2):\r\n a[i] = -1\r\nfor i in range(1, m, 2):\r\n b[i] = -1\r\ns = 0\r\nfor i in range(n - 1):\r\n s += b[i]\r\ninf = pow(10, 18) + 1\r\nu = [-inf, inf]\r\nd = 1\r\nfor i in range(n - 1, m):\r\n s += b[i]\r\n u.append(d * s)\r\n d *= -1\r\n s -= b[i - n + 1]\r\nu.sort()\r\ns = sum(a)\r\ni = bisect.bisect_left(u, s)\r\nans0 = min(abs(s - u[i - 1]), abs(s - u[i]))\r\nans = [ans0]\r\nfor _ in range(q):\r\n l, r, x = map(int, input().split())\r\n if not (l - r) % 2:\r\n s += x if l % 2 else -x\r\n i = bisect.bisect_left(u, s)\r\n ans0 = min(abs(s - u[i - 1]), abs(s - u[i]))\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))" ]	{"inputs": ["5 6 3\n1 2 3 4 5\n1 2 3 4 5 6\n1 1 10\n1 1 -9\n1 5 -1", "1 1 1\n937982044\n179683049\n1 1 821220804"], "outputs": ["0\n9\n0\n0", "758298995\n1579519799"]}	UNKNOWN	PYTHON3	CODEFORCES	1
904ddf9a4d594b95a85d8cf3bef73636	Turn Off The TV	Luba needs your help again! Luba has n TV sets. She knows that i-th TV set will be working from moment of time li till moment ri, inclusive. Luba wants to switch off one of TV sets in order to free the socket. Let's call some TV set redundant if after switching it off the number of integer moments of time when at least one of TV sets is working won't decrease. Luba will be very upset if she has to switch off a non-redundant TV set. Help Luba by telling her the index of some redundant TV set. If there is no any, print -1. The first line contains one integer number n (1<=≤<=n<=≤<=2·105) — the number of TV sets. Then n lines follow, each of them containing two integer numbers li,<=ri (0<=≤<=li<=≤<=ri<=≤<=109) denoting the working time of i-th TV set. If there is no any redundant TV set, print -1. Otherwise print the index of any redundant TV set (TV sets are indexed from 1 to n). If there are multiple answers, print any of them. Sample Input 3 1 3 4 6 1 7 2 0 10 0 10 3 1 2 3 4 6 8 3 1 2 2 3 3 4 Sample Output 1 1 -1 2	[ "n = int(input())\nlis = []\nfor i in range(n):\n\ta, b = map(int, input().split())\n\tlis.append([a, b, i+1])\nlis.sort()\ni = 1\nans = -1\n#Turn off the TV\nwhile i<n:\n\tif lis[i][1]<=lis[i-1][1]:\n\t\tans = lis[i][2]\n\t\tprint(ans)\n\t\texit(0)\n\telif( lis[i][0] <= lis[i-1][0] and lis[i][1] >= lis[i-1][1]):\n\t\tans = lis[i-1][2]\n\t\tprint(ans)\n\t\texit(0)\n\tlis[i][0] = max( lis[i][0], lis[i-1][1] + 1)\n\ti+=1\nprint(ans)\n\n \t \t \t \t\t \t \t \t\t \t\t \t \t", "n = int(input())\r\nlis = []\r\nfor i in range(n):\r\n\ta, b = map(int, input().split())\r\n\tlis.append([a, b, i+1])\r\nlis.sort()\r\ni = 1\r\nans = -1\r\nwhile i<n:\r\n\tif lis[i][1]<=lis[i-1][1]:\r\n\t\tans = lis[i][2]\r\n\t\tprint(ans)\r\n\t\texit(0)\r\n\telif( lis[i][0] <= lis[i-1][0] and lis[i][1] >= lis[i-1][1]):\r\n\t\tans = lis[i-1][2]\r\n\t\tprint(ans)\r\n\t\texit(0)\r\n\tlis[i][0] = max( lis[i][0], lis[i-1][1] + 1)\r\n\ti+=1\r\nprint(ans)", "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\nLRI = []\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n LRI.append((l, r, i))\r\n\r\nLRI.sort()\r\ncur_l = LRI[0][0]\r\ncur_r = LRI[0][1]\r\ncur_idx = LRI[0][2]\r\nfor j in range(1, n):\r\n l, r, i = LRI[j]\r\n if l <= cur_l and cur_r <= r:\r\n print(cur_idx+1)\r\n exit()\r\n if r <= cur_r:\r\n print(i+1)\r\n exit()\r\n else:\r\n cur_l = max(cur_r+1, l)\r\n cur_r = r\r\n cur_idx = i\r\nprint(-1)\r\n", "from collections import defaultdict,deque\r\nimport sys\r\nimport bisect\r\nimport math\r\ninput=sys.stdin.readline\r\nmod=1000000007\r\n\r\nt=int(input())\r\nboth=[]\r\nfor ii in range(t):\r\n l,r=map(int,input().split())\r\n both.append([l,r,ii+1])\r\nboth.sort()\r\ne=-1\r\n#print(both)\r\nfor i in range(t):\r\n if i>0:\r\n if both[i][0]==both[i-1][0]:\r\n print(both[i-1][2])\r\n #print('a')\r\n break\r\n if i<t-1:\r\n if both[i][0]<=e and both[i+1][0]<=e+1 and both[i+1][1]>=both[i][1]:\r\n print(both[i][2])\r\n #print('b')\r\n break\r\n if both[i][0]<=e and both[i][1]<=e:\r\n print(both[i][2])\r\n #print('c')\r\n break\r\n e=max(e,both[i][1])\r\nelse:\r\n print(-1)\r\n", "import sys\r\nfrom heapq import heappop, heappush\r\nfrom collections import Counter\r\n\r\nn = int(sys.stdin.buffer.readline().decode('utf-8'))\r\nquery = []\r\nimos = Counter()\r\n\r\nfor i, (l, r) in enumerate(map(int, line.decode('utf-8').split()) for line in sys.stdin.buffer):\r\n query.append((l, r+1, i+1))\r\n imos[l] += 1\r\n imos[r+1] -= 1\r\n\r\nquery.sort()\r\nacc = 0\r\nhq = []\r\ni = 0\r\n\r\nfor t in sorted(imos.keys()):\r\n while hq and hq[0][0] == t:\r\n print(hq[0][1])\r\n exit()\r\n\r\n acc += imos[t]\r\n if acc > 1:\r\n while i < n and query[i][0] == t:\r\n heappush(hq, (query[i][1], query[i][2]))\r\n i += 1\r\n else:\r\n while i < n and query[i][0] == t:\r\n i += 1\r\n hq.clear()\r\n\r\nprint(-1)\r\n", "import sys\ninput = sys.stdin.readline\nMAX = 10*9\n\ndef read_int():\n return int(input())\n\ndef read_ints():\n return map(int, input().split())\n\ndef read_int_list():\n return [int(i) for i in input().split()]\n\ndef read_string():\n return input().strip()\n\nn = read_int()\na = []\nfor i in range(n):\n l, r = read_ints()\n a.append((l, r, i + 1))\na.sort()\nredundant = -1\nl_prev = -MAX\nr_prev = -MAX\nr_prev2 = -MAX\ni_prev = -MAX\nfor j in range(n):\n l, r, i = a[j]\n if l == l_prev:\n redundant = i_prev\n break\n elif r <= r_prev:\n redundant = i\n break\n elif l <= r_prev2 + 1:\n redundant = i_prev\n break\n l_prev, r_prev, r_prev2, i_prev = l, r, r_prev, i\nprint(redundant)\n \n", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef slide_min(n, k, a):\r\n ans = []\r\n s = deque()\r\n for i in range(n):\r\n ai = a[i]\r\n while s:\r\n if a[s[-1]] >= ai:\r\n s.pop()\r\n else:\r\n break\r\n s.append(i)\r\n while s:\r\n if s[0] + k <= i:\r\n s.popleft()\r\n else:\r\n break\r\n if (i + 1) // k:\r\n ans.append(a[s[0]])\r\n return ans\r\n\r\ndef make_sparse_table(a):\r\n table = []\r\n s, l = a, 1\r\n table.append(s)\r\n while 2 l <= len(a):\r\n s = slide_min(len(s), l + 1, s)\r\n table.append(s)\r\n l = 2\r\n return table\r\n\r\ndef get_min(l, r):\r\n d = len(bin(r - l + 1)) - 3\r\n ans = min(table[d][l], table[d][r - pow2[d] + 1])\r\n return ans\r\n\r\npow2 = [1]\r\nfor _ in range(20):\r\n pow2.append(2 pow2[-1])\r\n\r\nn = int(input())\r\nlr = [list(map(int, input().split())) for _ in range(n)]\r\ns = set()\r\nfor l, r in lr:\r\n s.add(l)\r\n s.add(r)\r\n s.add(r + 1)\r\ns = list(s)\r\ns.sort()\r\nd = dict()\r\nm = len(s)\r\nfor i in range(m):\r\n d[s[i]] = i\r\na = [0] * m\r\nfor l, r in lr:\r\n a[d[l]] += 1\r\n a[d[r + 1]] -= 1\r\nfor i in range(1, m):\r\n a[i] += a[i - 1]\r\ntable = make_sparse_table(a)\r\nans = -1\r\nfor i in range(n):\r\n l, r = lr[i]\r\n if get_min(d[l], d[r]) > 1:\r\n ans = i + 1\r\n break\r\nprint(ans)", "from math import ceil, log2\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\n\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n_str = str\r\nstr = lambda x=b\"\": x if type(x) is bytes else _str(x).encode()\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._file = file\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nread = lambda: map(int, input().strip().split())\r\n\r\n\r\ndef left(idx):\r\n return 2 * idx\r\n\r\n\r\ndef right(idx):\r\n return 2 * idx + 1\r\n\r\n\r\nclass SegmentTree:\r\n def __init__(self, arr):\r\n self.size = len(arr)\r\n self.tree_size = 2 ** ceil(log2(self.size))\r\n self.tree = [0] * 2 * self.tree_size\r\n self.lazy = self.tree.copy()\r\n self.tree[self.tree_size:self.tree_size + self.size] = arr\r\n\r\n def range_min(self, range_left, range_right):\r\n m = float('inf')\r\n range_left += self.tree_size\r\n range_right += self.tree_size\r\n while range_left <= range_right:\r\n if range_left & 1:\r\n m = min(m, self.tree[range_left])\r\n range_left += 1\r\n if not range_right & 1:\r\n m = min(m, self.tree[range_right])\r\n range_right -= 1\r\n range_right //= 2\r\n range_left //= 2\r\n return m\r\n\r\n def range_update(self, range_left, range_right, increment):\r\n range_left += self.tree_size\r\n range_right += self.tree_size\r\n while range_left <= range_right:\r\n if range_left & 1:\r\n self.lazy[range_left] += increment\r\n range_left += 1\r\n if not range_right & 1:\r\n self.lazy[range_right] += increment\r\n range_right -= 1\r\n increment = 2\r\n range_left //= 2\r\n range_right //= 2\r\n\r\n def final(self):\r\n for idx in range(self.tree_size):\r\n el = self.lazy[idx]\r\n self.lazy[left(idx)] += el // 2\r\n self.lazy[right(idx)] += el // 2\r\n self.lazy[idx] = 0\r\n for idx, el in enumerate(self.lazy[self.tree_size:]):\r\n self.tree[self.tree_size + idx] += el\r\n for idx in reversed(range(1, self.tree_size)):\r\n self.tree[idx] = min(self.tree[left(idx)], self.tree[right(idx)])\r\n\r\n\r\ndct = defaultdict(int)\r\nn = int(input())\r\nind = 0\r\ns = []\r\nlst = [0] n\r\nfor i in range(n):\r\n t = tuple(read())\r\n lst[i] = t\r\n for el in [t[0], t[1], t[1] + 1]:\r\n dct[el]\r\n\r\nfor i in sorted(dct):\r\n dct[i] = ind\r\n ind += 1\r\n\r\nst = SegmentTree([0] * ind)\r\nfor l, r in lst:\r\n st.range_update(dct[l], dct[r], 1)\r\nst.final()\r\n\r\nfor ind, el in enumerate(lst):\r\n l, r = dct[el[0]], dct[el[1]]\r\n if st.range_min(l, r) > 1:\r\n exit(print(ind + 1))\r\nprint(-1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nsegs = []\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n segs.append((l, r, i + 1))\r\nsegs.sort(key=lambda x: (x[0], -x[1]))\r\nres = -1\r\nfor i in range(n - 1):\r\n if segs[i][1] >= segs[i + 1][1]:\r\n res = segs[i + 1][2]\r\n break\r\n if i > 0 and segs[i - 1][1] + 1 >= segs[i + 1][0]:\r\n res = segs[i][2]\r\n break\r\nprint(res)" ]	{"inputs": ["3\n1 3\n4 6\n1 7", "2\n0 10\n0 10", "3\n1 2\n3 4\n6 8", "3\n1 2\n2 3\n3 4", "3\n0 500000000\n500000001 1000000000\n0 1000000000", "3\n1 5\n2 4\n6 10", "10\n4 4\n5 9\n5 7\n2 8\n6 10\n4 10\n1 3\n8 9\n0 0\n5 7", "2\n1 3\n2 4", "1\n8 9", "8\n13 17\n83 89\n31 33\n7 13\n52 52\n88 89\n29 30\n16 22", "4\n63 63\n12 34\n17 29\n58 91", "3\n1 10\n5 15\n10 20", "2\n1 3\n1 6", "2\n1 2\n1 3", "3\n5 6\n1 3\n1 4", "3\n1 4\n2 100\n4 5", "4\n1 1\n3 3\n4 7\n4 5", "3\n2 3\n3 4\n1 2", "1\n0 0", "6\n99 100\n65 65\n34 34\n16 18\n65 67\n88 88", "2\n50 67\n54 64", "3\n1 3\n2 100\n3 5", "3\n57 90\n35 45\n18 52", "4\n14 15\n46 73\n15 40\n28 53", "3\n37 38\n51 54\n28 28", "2\n64 66\n47 61", "4\n50 68\n63 67\n67 69\n11 12", "4\n42 62\n93 103\n34 62\n5 12", "6\n42 60\n78 107\n6 38\n58 81\n70 105\n70 105", "5\n71 71\n21 22\n58 58\n57 57\n16 16", "7\n28 42\n70 75\n83 92\n19 22\n26 32\n85 99\n30 39", "3\n8 28\n80 110\n39 81", "7\n90 115\n87 113\n2 26\n39 40\n91 112\n42 53\n65 79", "7\n12 13\n26 28\n9 11\n15 15\n8 10\n22 24\n5 7", "7\n3 5\n26 31\n11 15\n2 4\n16 18\n4 4\n7 12", "3\n1 5\n1 2\n4 5", "3\n999999995 999999997\n999999998 1000000000\n999999996 999999999", "4\n1 2\n4 6\n4 10\n200 300"], "outputs": ["1", "1", "-1", "2", "1", "2", "1", "-1", "-1", "6", "1", "2", "1", "1", "2", "3", "4", "1", "-1", "2", "2", "3", "2", "-1", "-1", "-1", "2", "1", "5", "-1", "7", "-1", "5", "-1", "6", "2", "3", "2"]}	UNKNOWN	PYTHON3	CODEFORCES	9
9051057a015389e58fc1a40a5b2455e2	Mail Stamps	One day Bob got a letter in an envelope. Bob knows that when Berland's post officers send a letter directly from city «A» to city «B», they stamp it with «A B», or «B A». Unfortunately, often it is impossible to send a letter directly from the city of the sender to the city of the receiver, that's why the letter is sent via some intermediate cities. Post officers never send a letter in such a way that the route of this letter contains some city more than once. Bob is sure that the post officers stamp the letters accurately. There are n stamps on the envelope of Bob's letter. He understands that the possible routes of this letter are only two. But the stamps are numerous, and Bob can't determine himself none of these routes. That's why he asks you to help him. Find one of the possible routes of the letter. The first line contains integer n (1<=≤<=n<=≤<=105) — amount of mail stamps on the envelope. Then there follow n lines with two integers each — description of the stamps. Each stamp is described with indexes of the cities between which a letter is sent. The indexes of cities are integers from 1 to 109. Indexes of all the cities are different. Every time the letter is sent from one city to another, exactly one stamp is put on the envelope. It is guaranteed that the given stamps correspond to some valid route from some city to some other city. Output n<=+<=1 numbers — indexes of cities in one of the two possible routes of the letter. Sample Input 2 1 100 100 2 3 3 1 100 2 3 2 Sample Output 2 100 1 100 2 3 1	[ "import sys\r\nfrom collections import deque\r\ninput = sys.stdin.readline\r\ng={}\r\nv=set()\r\nfor _ in range(int(input())):\r\n a,b=[int(x) for x in input().split()]\r\n if a in v:\r\n v.remove(a)\r\n else:\r\n v.add(a)\r\n if b in v:\r\n v.remove(b)\r\n else:\r\n v.add(b)\r\n if a in g:\r\n g[a].append(b)\r\n else:\r\n g[a]=[b]\r\n if b in g:\r\n g[b].append(a)\r\n else:\r\n g[b]=[a]\r\n #g[b]=a\r\nans=[]\r\nfor i in v:\r\n q=deque([[i,-1]])\r\n while q:\r\n curr,par=q.popleft()\r\n ans.append(curr)\r\n for i in g[curr]:\r\n if i!=par:\r\n q.append([i,curr])\r\n break\r\nprint(ans)", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nct = defaultdict(int)\r\ndc = defaultdict(list)\r\nfor i in range(n) :\r\n x, y = map(int,input().split())\r\n dc[x].append(y)\r\n dc[y].append(x)\r\n ct[x] += 1\r\n ct[y] += 1\r\nstart, par = -1, 0\r\nfor i, j in ct.items() :\r\n if j == 1 :\r\n start = i\r\n break\r\nfor i in range(n+1) :\r\n print(start,end=\" \")\r\n temp = start\r\n for elem in dc[temp] :\r\n if elem != par :\r\n start = elem\r\n break\r\n par = temp", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfrom collections import defaultdict\r\n\r\nn = int(input())\r\nd = defaultdict(list)\r\n\r\nans = []\r\n\r\nfreq = {}\r\n\r\nfor _ in range(n):\r\n x, y = input().strip().split()\r\n\r\n freq[x] = freq.get(x, 0) + 1\r\n freq[y] = freq.get(y, 0) + 1\r\n d[x].append(y)\r\n d[y].append(x)\r\n\r\nvis = set()\r\n\r\nfor k, v in freq.items():\r\n if v == 1:\r\n start = k\r\n vis.add(start)\r\n ans.append(start)\r\n break\r\n\r\ncur = start\r\nfor i in range(n):\r\n for x in d[cur]:\r\n if x not in vis:\r\n vis.add(x)\r\n cur = x\r\n ans.append(x)\r\n\r\nprint(ans)", "import sys\r\nlines = sys.stdin.readlines()\r\nn = int(lines[0])\r\nd = {}\r\nfor i in range(1, n+1):\r\n\ta, b = map(int, lines[i].split())\r\n\tif a not in d:\r\n\t\td[a] = []\r\n\tif b not in d:\r\n\t\td[b] = []\r\n\td[a].append(b)\r\n\td[b].append(a)\r\nstart = -1\r\nfor k, v in d.items():\r\n\tif len(v) == 1:\r\n\t\tstart = k\r\nprev = -1\r\nans = []\r\nwhile True:\r\n\tans.append(start)\r\n\tv = d[start]\r\n\tnext = v[0]\r\n\tif next == prev:\r\n\t\tif len(v) == 1:\r\n\t\t\tbreak\r\n\t\tnext = v[1]\r\n\tprev, start = start, next\r\nsys.stdout.write(' '.join(map(str, ans)))", "from collections import defaultdict\r\n\r\nn = int(input())\r\ngraph = defaultdict(list)\r\ndegrees = defaultdict(int)\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n degrees[a] += 1\r\n degrees[b] += 1\r\n\r\nstart = None\r\nfor city, degree in degrees.items():\r\n if degree == 1:\r\n start = city\r\n break\r\n\r\npath = [start]\r\nvisited = set()\r\nwhile len(path) < n + 1:\r\n current = path[-1]\r\n visited.add(current)\r\n for neighbor in graph[current]:\r\n if neighbor not in visited:\r\n path.append(neighbor)\r\n break\r\n\r\nprint(path)", "dict_route = {}\r\ncnt = int(input(\"\").strip())\r\n\r\nfor i in range(cnt):\r\n peer = input(\"\").strip().split()\r\n for p in peer:\r\n if not dict_route.get(p):\r\n dict_route[p] = []\r\n peer_copy = peer.copy()\r\n peer_copy.remove(p)\r\n dict_route[p] += peer_copy\r\n\r\nstart_end_keys = []\r\nfor key, val in dict_route.items():\r\n if len(val) == 1:\r\n start_end_keys.append(key)\r\n\r\nstart_key = start_end_keys[-1]\r\nend_key = start_end_keys[0]\r\n\r\npossible_routes = []\r\nwhile True:\r\n possible_routes.append(start_key)\r\n if start_key == end_key:\r\n break\r\n next_key = dict_route[start_key][0]\r\n dict_route[next_key].remove(start_key) \r\n start_key = next_key\r\n\r\nprint(' '.join(possible_routes))", "from collections import defaultdict, 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 visit = defaultdict(lambda : [])\r\n visit[s] = 1\r\n ans = []\r\n while q:\r\n i = q.popleft()\r\n ans.append(i)\r\n for j in G[i]:\r\n if not visit[j]:\r\n q.append(j)\r\n visit[j] = 1\r\n return ans\r\n\r\nn = int(input())\r\nG = defaultdict(lambda : [])\r\nfor _ in range(n):\r\n u, v = map(int, input().split())\r\n G[u].append(v)\r\n G[v].append(u)\r\nfor i in G.keys():\r\n if len(G[i]) == 1:\r\n s = i\r\n break\r\nans = bfs(s)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "from collections import defaultdict\r\nfrom typing import List, Tuple\r\n\r\n\r\ndef solve(n: int, stamps: List[Tuple[int, int]]) -> str:\r\n visited = set() # type: Set\r\n graph = defaultdict(list) # type: Dict[int, List[int]]\r\n path = [] # type: List[int]\r\n for u, v in stamps:\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n start = [node for node in graph if len(graph[node]) == 1][0]\r\n stack = [start]\r\n while stack:\r\n curr = stack.pop()\r\n visited.add(curr)\r\n path.append(curr)\r\n for adj_node in graph[curr]:\r\n if adj_node not in visited:\r\n stack.append(adj_node)\r\n return ' '.join(map(str, path))\r\n\r\nn = int(input())\r\nstamps = [tuple(map(int, input().split())) for _ in range(n)]\r\nprint(solve(n, stamps))\r\n", "from collections import \r\n\r\nd, c = defaultdict(int), []\r\n\r\nfor i in range(int(input())):\r\n x, y = map(int, input().split())\r\n\r\n c += [x, y]\r\n \r\n d[x] += y\r\n d[y] += x\r\n\r\na, b = [q for q, k in Counter(c).items() if k == 1]\r\n\r\nq = 0\r\nwhile a != b:\r\n print(a)\r\n q, a = a, d[a] - q\r\n\r\nprint(a)", "n = int(input())\r\nd = dict()\r\nfor _ in range(n):\r\n line = input().split(\" \")\r\n a = int(line[0])\r\n b = int(line[1])\r\n if a in d:\r\n d[a].append(b)\r\n else:\r\n d[a] = [b]\r\n if b in d:\r\n d[b].append(a)\r\n else:\r\n d[b] = [a]\r\nend_cities = list()\r\nfor x in d:\r\n if len(d[x]) == 1:\r\n end_cities.append(x)\r\nprev_city = end_cities[0]\r\nnext_city = d[prev_city][0]\r\nprint(prev_city, end=\" \")\r\nwhile True:\r\n print(next_city, end=\" \")\r\n if next_city == end_cities[1]:\r\n break\r\n d[next_city].remove(prev_city)\r\n prev_city = next_city\r\n next_city = d[next_city][0]\r\n", "n = int(input())\r\nd = {}\r\nfrom sys import stdin\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n if d.get(a)==None:d[a]=[]\r\n if d.get(b)==None:d[b]=[]\r\n d[a].append(b)\r\n d[b].append(a)\r\nfor i,item in enumerate(d):\r\n if len(d[item])==1:\r\n break\r\nres = [item]\r\nprev=item\r\nitem=d[item][0]\r\nfor i in range(n-1):\r\n res.append(item)\r\n x,y = d[item][0],d[item][1]\r\n if x==prev:prev=item;item=y\r\n else:prev=item;item=x\r\nres.append(item)\r\nprint(res)", "#Recursion support template\r\nimport sys\r\ninput = sys.stdin.readline\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\r\n return wrappedfunc\r\n\r\n@bootstrap\r\ndef dfs(x):\r\n visited.add(x)\r\n ans.append(x)\r\n for i in d[x]:\r\n if i not in visited:\r\n yield dfs(i)\r\n\r\n yield\r\n\r\nn = int(input())\r\nd = {}\r\n# stack = []\r\nfor 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\r\n else:\r\n d[a] = [b]\r\n\r\n if b in d:\r\n d[b].append(a)\r\n\r\n else:\r\n d[b] = [a]\r\n\r\nans = []\r\nval = -1\r\nfor i in d:\r\n if len(d[i]) == 1:\r\n val = i\r\n break\r\n\r\nvisited = set()\r\ndfs(val)\r\nprint(ans)", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import \r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nfrom copy import deepcopy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"../output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A: print(ele,end=\"\\n\")\r\n\r\n# from sys import stdin\r\n# input = stdin.buffer.readline\r\n# I = lambda : list(map(int,input().split()))\r\n\r\n# import sys\r\n# input=sys.stdin.readline\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\nadj = dd(list)\r\ndeg = dd(int)\r\n\r\nfor _ in range(n):\r\n u, v = map(int, input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n deg[u] += 1\r\n deg[v] += 1\r\n\r\nv = -1\r\nfor key, val in deg.items():\r\n if val == 1:\r\n v = key\r\n break\r\n\r\nans = []\r\n\r\nwhile True:\r\n ans.append(v)\r\n deg[v] = 0\r\n\r\n for dest in adj[v]:\r\n if deg[dest]:\r\n deg[dest] = 0\r\n v = dest\r\n break\r\n else:\r\n break\r\n\r\nprint(ans)\r\n\r\n", "n = int(input())\r\ndescrs = {}\r\nfor i in range(n):\r\n first_descr, second_descr = map(int,input().split())\r\n if first_descr in descrs: descrs[first_descr].append(second_descr)\r\n else: descrs[first_descr] = [second_descr]\r\n if second_descr in descrs: descrs[second_descr].append(first_descr)\r\n else: descrs[second_descr] = [first_descr]\r\nres = [] \r\nfor description in descrs:\r\n if len(descrs[description]) == 1:\r\n res.append(description)\r\n root = description\r\n break\r\ncurr = root\r\nwhile True:\r\n for description in descrs[curr]:\r\n if description == res[-1]: continue\r\n if curr != root: res.append(curr)\r\n curr = description\r\n break\r\n if len(descrs[curr]) == 1:\r\n res.append(curr)\r\n break\r\nprint(res)\r\n ", "n=int(input())\r\nd={}\r\nfor 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 if b in d:\r\n d[b].append(a)\r\n else:\r\n d[b]=[a]\r\nans=[] \r\nfor el in d:\r\n if len(d[el])==1:\r\n ans.append(el)\r\n root=el\r\n break\r\ncur=root\r\nwhile True:\r\n for el in d[cur]:\r\n if el==ans[-1]:continue\r\n if cur!=root:ans.append(cur)\r\n cur=el\r\n break\r\n if len(d[cur])==1:\r\n ans.append(cur)\r\n break\r\nprint(ans)\r\n\r\n \r\n", "from collections import \r\n\r\nw, e = defaultdict(int), []\r\n\r\nfor i in range(int(input())):\r\n\r\n h, p = map(int, input().split())\r\n\r\n e += [h, p]\r\n\r\n w[h] += p\r\n\r\n w[p] += h\r\n\r\ng, u = [q for q, k in Counter(e).items() if k == 1]\r\n\r\nq = 0\r\n\r\nwhile g != u:\r\n\r\n print(g)\r\n\r\n q, g = g, w[g] - q\r\n\r\nprint(g)\r\n", "import sys\r\ndef solve():\r\n\tlines = sys.stdin.readlines()\r\n\tn = int(lines[0])\r\n\td = {}\r\n\tfor i in range(1, n+1):\r\n\t\ta, b = map(int, lines[i].split())\r\n\t\tif a not in d:\r\n\t\t\td[a] = []\r\n\t\tif b not in d:\r\n\t\t\td[b] = []\r\n\t\td[a].append(b)\r\n\t\td[b].append(a)\r\n\tstart = -1\r\n\tfor k, v in d.items():\r\n\t\tif len(v) == 1:\r\n\t\t\tstart = k\r\n\tprev = -1\r\n\tans = []\r\n\twhile True:\r\n\t\tans.append(start)\r\n\t\tv = d[start]\r\n\t\tnext = v[0]\r\n\t\tif next == prev:\r\n\t\t\tif len(v) == 1:\r\n\t\t\t\tbreak\r\n\t\t\tnext = v[1]\r\n\t\tprev, start = start, next\r\n\tsys.stdout.write(' '.join(map(str, ans)))\r\n\r\n\r\nsolve()", "import sys\n\ndef solve():\n n = int(input())\n once = set()\n mapsto = dict()\n for i in range(n):\n a, b = map(int, input().split())\n spadd(once, a)\n spadd(once, b)\n dictadd(mapsto, a, b)\n dictadd(mapsto, b, a)\n prev = -1\n cur = once.pop()\n res = [cur]\n for i in range(n):\n pos = mapsto[cur]\n nxt = pos[0] if pos[0] != prev else pos[1]\n res.append(nxt)\n prev = cur\n cur = nxt\n print(' '.join(map(str, res)))\n\ndef spadd(s, val):\n if val in s: s.remove(val)\n else: s.add(val)\n\ndef dictadd(d, key, val):\n if key in d: d[key].append(val)\n else: d[key] = [val]\n\n\n\ndef prt(l): return print(''.join(l))\ndef rv(): return map(int, input().split())\ndef rl(n): return [list(map(int, input().split())) for _ in range(n)]\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nsolve()", "def main():\r\n n = int(input())\r\n stamps = {}\r\n s = {}\r\n for _ in range(n):\r\n stamp1, stamp2 = map(int, input().split())\r\n if stamp1 not in stamps:\r\n stamps[stamp1] = [stamp2]\r\n else:\r\n stamps[stamp1].append(stamp2)\r\n if stamp2 not in stamps:\r\n stamps[stamp2] = [stamp1]\r\n else:\r\n stamps[stamp2].append(stamp1)\r\n if stamp1 in s:\r\n del s[stamp1]\r\n else:\r\n s[stamp1] = None\r\n if stamp2 in s:\r\n del s[stamp2]\r\n else:\r\n s[stamp2] = None\r\n\r\n ans = [tuple(s.keys())[0]]\r\n while len(ans) != n + 1:\r\n next_stamp = stamps[ans[-1]]\r\n if len(next_stamp) == 1:\r\n ans.append(next_stamp[0])\r\n else:\r\n if next_stamp[0] != ans[-2]:\r\n ans.append(next_stamp[0])\r\n else:\r\n ans.append(next_stamp[1])\r\n\r\n print(' '.join(map(str, ans)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from _collections import deque\r\nn=int(input())-1\r\nx,y=map(int,input().split())\r\nq=deque([x,y])\r\nw={x:{y},y:{x}}\r\nl={x,y}\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if x in w:w[x].add(y)\r\n else:w[x]={y}\r\n if y in w:w[y].add(x)\r\n else:w[y]={x}\r\nwhile len(w[q[-1]])>1:\r\n for i in w[q[-1]]:\r\n if i not in l:\r\n q.append(i)\r\n l.add(i)\r\nwhile len(w[q[0]])>1:\r\n for i in w[q[0]]:\r\n if i not in l:\r\n q.appendleft(i)\r\n l.add(i)\r\nprint(q)", "d1,d2,d3 = {},{},{}\nn = int(input())\nfor i in range(n):\n a,b = map(int,input().split())\n if a in d1.keys():\n d1[a] += 1\n else: d1[a] = 1\n if b in d1.keys():\n d1[b] += 1\n else: d1[b] = 1\n\n\n if a in d2.keys():\n d3[a] = b\n else: d2[a] = b\n if b in d2.keys():\n d3[b] = a\n else: d2[b] = a\nfirst,last = 0,0\nfor i in d1.keys():\n if d1[i] == 1:\n if first == 0: first = i\n else: last=i\n\nans = [first]\ni = first\n\ncont = 0\nwhile(i != last):\n if i in d2.keys() and d2[i] != cont:\n ans.append(d2[i])\n cont = i\n i = d2[i]\n elif i in d3.keys() and d3[i] != cont:\n ans.append(d3[i])\n cont = i\n i = d3[i]\n\nprint(ans,sep=' ')\n\n", "n = int(input())\n\nedges = {}\n\nfor _ in range(n):\n a, b = map(int, input().split())\n if a in edges:\n edges[a] += [b]\n else:\n edges[a] = [b]\n if b in edges:\n edges[b] += [a]\n else:\n edges[b] = [a]\n\nroute = []\n\nfor key, val in edges.items():\n route = [key, val[0]]\n break\n\nwhile len(route) < n + 1:\n if len(edges[route[-1]]) == 1:\n route.reverse()\n else:\n if edges[route[-1]][0] == route[-2]:\n route += [edges[route[-1]][1]]\n else:\n route += [edges[route[-1]][0]]\n\nprint(' '.join(map(str, route)))\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\ncnt = defaultdict(int)\r\nP = defaultdict(list)\r\nfor _ in range(N):\r\n a,b = map(int, input().split())\r\n cnt[str(a)] += 1\r\n cnt[str(b)] += 1\r\n P[str(a)].append(str(b))\r\n P[str(b)].append(str(a))\r\n \r\nv = []\r\nfor k,c in cnt.items():\r\n if c==1:\r\n v.append((k,-1))\r\n break\r\n \r\nans = []\r\nwhile v:\r\n i,p = v.pop()\r\n ans.append(i)\r\n for j in P[i]:\r\n if j==p:continue\r\n v.append((j,i))\r\n \r\nprint(ans)\r\n\r\n\r\n", "import sys\nfrom collections import defaultdict\n\nlength = int(sys.stdin.readline())\n\ngraph = defaultdict(list)\nfor _ in range(length):\n a,b = map(int,sys.stdin.readline().split())\n graph[a].append(b)\n graph[b].append(a)\n\nfor begin in graph:\n if len(graph[begin]) == 1:\n break\n\ndef get_next(graph,begin):\n yield begin\n cur= graph[begin][0]\n pre = begin\n while len(graph[cur]) == 2:\n yield cur\n old_cur = cur\n cur = graph[cur][0] if graph[cur][0] != pre else graph[cur][1]\n pre = old_cur\n yield cur\nprint(\" \".join(map(str,get_next(graph,begin))))\n", "import sys\r\nfrom array import array # noqa: F401\r\nfrom collections import defaultdict\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\nadj = defaultdict(list)\r\ndeg = defaultdict(int)\r\n\r\nfor _ in range(n):\r\n u, v = map(int, input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n deg[u] += 1\r\n deg[v] += 1\r\n\r\nv = -1\r\nfor key, val in deg.items():\r\n if val == 1:\r\n v = key\r\n break\r\n\r\nans = []\r\n\r\nwhile True:\r\n ans.append(v)\r\n deg[v] = 0\r\n\r\n for dest in adj[v]:\r\n if deg[dest]:\r\n deg[dest] = 0\r\n v = dest\r\n break\r\n else:\r\n break\r\n\r\nprint(*ans)\r\n" ]	{"inputs": ["2\n1 100\n100 2", "3\n3 1\n100 2\n3 2", "3\n458744979 589655889\n248228386 824699605\n458744979 824699605", "4\n90104473 221011623\n18773664 221011623\n90104473 74427905\n74427905 186329050", "5\n695442143 421284135\n641835294 542627184\n852367357 120042890\n641835294 852367357\n542627184 421284135", "6\n264896923 2497658\n57071588 447086061\n2497658 483723090\n57071588 264896923\n158310110 483723090\n158310110 72866107", "1\n1 1000000000", "1\n1000000000 999999999", "10\n661239801 721746596\n225324231 116454751\n687002568 865423160\n799202882 865423160\n661239801 116454751\n387882517 687002568\n748798833 721746596\n179630172 225324231\n945958362 387882517\n179630172 945958362", "21\n280810160 291988863\n760364563 140163983\n16417017 364832782\n400253359 677358550\n597688496 794948223\n400253359 603304541\n589408417 603304541\n385039298 307729574\n293170375 805849550\n140163983 219301181\n732214548 760364563\n307729574 280810160\n131915938 219301181\n4615652 347722938\n396478457 805849550\n16417017 732214548\n4615652 677358550\n131915938 589408417\n291988863 364832782\n396478457 794948223\n385039298 597688496", "1\n2105127 227379126"], "outputs": ["2 100 1 ", "100 2 3 1 ", "589655889 458744979 824699605 248228386 ", "186329050 74427905 90104473 221011623 18773664 ", "695442143 421284135 542627184 641835294 852367357 120042890 ", "447086061 57071588 264896923 2497658 483723090 158310110 72866107 ", "1000000000 1 ", "1000000000 999999999 ", "799202882 865423160 687002568 387882517 945958362 179630172 225324231 116454751 661239801 721746596 748798833 ", "347722938 4615652 677358550 400253359 603304541 589408417 131915938 219301181 140163983 760364563 732214548 16417017 364832782 291988863 280810160 307729574 385039298 597688496 794948223 396478457 805849550 293170375 ", "227379126 2105127 "]}	UNKNOWN	PYTHON3	CODEFORCES	25
909a49d6c60a9180e265a01863223410	PFAST Inc.	When little Petya grew up and entered the university, he started to take part in АСМ contests. Later he realized that he doesn't like how the АСМ contests are organised: the team could only have three members (and he couldn't take all his friends to the competitions and distribute the tasks between the team members efficiently), so he decided to organize his own contests PFAST Inc. — Petr and Friends Are Solving Tasks Corporation. PFAST Inc. rules allow a team to have unlimited number of members. To make this format of contests popular he organised his own tournament. To create the team he will prepare for the contest organised by the PFAST Inc. rules, he chose several volunteers (up to 16 people) and decided to compile a team from them. Petya understands perfectly that if a team has two people that don't get on well, then the team will perform poorly. Put together a team with as many players as possible given that all players should get on well with each other. The first line contains two integer numbers n (1<=≤<=n<=≤<=16) — the number of volunteers, and m () — the number of pairs that do not get on. Next n lines contain the volunteers' names (each name is a non-empty string consisting of no more than 10 uppercase and/or lowercase Latin letters). Next m lines contain two names — the names of the volunteers who do not get on. The names in pair are separated with a single space. Each pair of volunteers who do not get on occurs exactly once. The strings are case-sensitive. All n names are distinct. The first output line should contain the single number k — the number of people in the sought team. Next k lines should contain the names of the sought team's participants in the lexicographical order. If there are several variants to solve the problem, print any of them. Petya might not be a member of the sought team. Sample Input 3 1 Petya Vasya Masha Petya Vasya 3 0 Pasha Lesha Vanya Sample Output 2 Masha Petya 3 Lesha Pasha Vanya	[ "# LUOGU_RID: 91401901\nimport copy\r\n\r\n\r\ndef insert(a, b):\r\n try:\r\n g[a][b] = 1\r\n except:\r\n g[a] = {b: 1}\r\n\r\n\r\nglobal ans\r\ng = {}\r\n\r\n\r\ndef dfs(i, n, dv):\r\n if i == n:\r\n return copy.deepcopy(dv)\r\n flag = True\r\n for b in dv:\r\n try:\r\n if g[v[i]][b] == 1:\r\n flag = False\r\n except:\r\n pass\r\n v1 = []\r\n if flag:\r\n v1 = dfs(i + 1, n, dv + [v[i]])\r\n v2 = dfs(i + 1, n, dv)\r\n return v1 if len(v1) > len(v2) else v2\r\n\r\n\r\nn, m = map(int, input().split())\r\nv = [input() for i in range(n)]\r\nv.sort()\r\nfor j in range(m):\r\n a, b = map(str, input().split())\r\n insert(a, b)\r\n insert(b, a)\r\n\r\nans = dfs(0, n, [])\r\nprint(len(ans))\r\nfor s in ans:\r\n print(s)\r\n", "def get_subsets(elements):\r\n if not elements:\r\n yield tuple()\r\n else:\r\n for subset_rec in get_subsets(elements[1:]):\r\n yield subset_rec\r\n yield (elements[0],) + subset_rec\r\n\r\n\r\ndef is_valid_set(subset, pairs):\r\n subset = set(subset)\r\n ok = True\r\n for pair in pairs:\r\n ok = ok and (not (pair[0] in subset and pair[1] in subset))\r\n return ok\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n names = tuple(input() for _ in range(n))\r\n pairs = [input().split() for _ in range(m)]\r\n\r\n ok = lambda subset: is_valid_set(subset, pairs)\r\n team = max(filter(ok, get_subsets(names)), key=len)\r\n\r\n print(len(team))\r\n for name in sorted(team):\r\n print(name)\r\n", "n, k = map(int, input().split())\r\nb1 = []\r\nmin = []\r\nfor i in range(n):\r\n b1 += [input()]\r\nd = {}\r\nfor i in range(k):\r\n o = 0\r\n a, b = input().split()\r\n if a not in d:\r\n d[a] = [b]\r\n o = 1\r\n if b not in d:\r\n d[b] = [a]\r\n o = 2\r\n if o != 1:\r\n c = d[a]\r\n if b not in c:\r\n c += [b]\r\n d[a] = c\r\n if o != 2:\r\n c = d[b]\r\n if a not in c:\r\n c += [a]\r\n d[b] = c\r\nfor i in range(2 ** n):\r\n o = 0\r\n c = []\r\n a = bin(i)[2:]\r\n a = \"0\" * (n - len(a)) + a\r\n for i in range(n):\r\n if a[i] == \"1\":\r\n for j in c:\r\n if b1[i] in d:\r\n if j in d[b1[i]]:\r\n o = 1\r\n break\r\n if o == 0:\r\n c += [b1[i]]\r\n if len(c) > len(min):\r\n min = c\r\nmin.sort()\r\nprint(len(min))\r\nfor i in range(len(min)):\r\n print(min[i])", "def GSB(x):\r\n\tcounter=0\r\n\twhile x!=0:\r\n\t\tcounter+=1\r\n\t\tx=x>>1\r\n\treturn counter\r\n\r\ndef friends(checker,enemy):\r\n\tfor i in range(len(enemy)):\r\n\t\tif enemy[i][0] in checker and enemy[i][1] in checker:\r\n\t\t\treturn 0\r\n\treturn 1\r\n\r\npeople,conflict=[int(x) for x in input().split()]\r\nperson=[]\r\nenemy=[]\r\nhighest=-1\r\nhighestarray=[]\r\nfor i in range(people):\r\n\tperson.append(input())\r\nfor j in range(conflict):\r\n\tenemy.append(input().split())\r\ncombinations=[int(x) for x in range((2people))]\r\nfor i in combinations:\r\n\tchecker=[]\r\n\tj=0\r\n\tz=GSB(i)\r\n\twhile j!=z and i!=0:\r\n\t\tif i&1==1:\r\n\t\t\tchecker.append(person[j])\r\n\t\ti=i>>1\r\n\t\tj+=1\r\n\tif friends(checker,enemy):\r\n\t\tif len(checker)>highest:\r\n\t\t\thighest=len(checker)\r\n\t\t\thighestarray=checker\r\nprint(highest)\r\nhighestarray.sort()\r\nfor i in range(highest):\r\n\tprint(highestarray[i])", "global res, maxi\r\nres = []\r\nmaxi = 0\r\ndef check(op):\r\n global maxi, res\r\n flag = 1\r\n if len(op)>maxi:\r\n d = {}\r\n for i in op:\r\n d[i] = None\r\n for i in range(m):\r\n if v[i][0] in d and v[i][1] in d:\r\n flag = 0\r\n break\r\n if flag:\r\n maxi = len(op)\r\n res = op\r\ndef func(ip, op):\r\n if len(ip) == 0:\r\n check(op)\r\n return\r\n op1 = op\r\n op2 = op+ [ip[-1]]\r\n d = ip[:len(ip)-1]\r\n func(d, op1)\r\n func(d, op2)\r\n \r\nn, m = map(int, input().split())\r\nc = []\r\nfor i in range(n):\r\n c.append(input())\r\nv = []\r\nfor i in range(m):\r\n v.append(list(map(str, input().split())))\r\nfunc(c, [])\r\nprint(maxi)\r\nres.sort()\r\nfor i in res:\r\n print(i)\r\n", "n,m=map(int,input().split())\nnames=dict()\nind=dict()\nenemies=list()\nfor i in range(n):\n cur=input()\n names[i]=cur\n ind[cur]=i\n enemies.append(set())\nfor i in range(m):\n nm1,nm2=input().split()\n enemies[ind[nm1]].add(ind[nm2])\n enemies[ind[nm2]].add(ind[nm1])\nans=0\nfor i in range(2n):\n cur=set()\n for j in range(n):\n if (i&(1<<j)):cur.add(j)\n f=True\n for j in cur:\n for jj in enemies[j]:\n if jj in cur:\n f=False\n break\n if not f:break\n else:\n if len(cur)>ans:\n ans=len(cur)\n curans=cur\nansarr=sorted([names[_] for _ in curans])\nprint(ans)\nfor i in ansarr:print(i)\n\n\n\n", "def s():\r\n\t[n,m] = list(map(int,input().split()))\r\n\ta = [input() for _ in range(n)]\r\n\tb = {input() for _ in range(m)}\r\n\tres = [[]]\r\n\taa = len(a)[False]\r\n\tdef r(x=0):\r\n\t\tif x == n:\r\n\t\t\tp = [a[i] for i in range(n) if aa[i]]\r\n\t\t\tif len(p) <= len(res[0]):\r\n\t\t\t\treturn\r\n\t\t\tfor i in p:\r\n\t\t\t\tfor j in p:\r\n\t\t\t\t\tif i+' '+j in b or j+' '+i in b:\r\n\t\t\t\t\t\treturn\r\n\t\t\tres[0] = p\r\n\t\t\treturn x\r\n\t\telse:\r\n\t\t\taa[x] = True\r\n\t\t\tr(x+1)\r\n\t\t\taa[x] = False\r\n\t\t\tr(x+1)\r\n\tr()\r\n\tres = res[0]\r\n\tres.sort()\r\n\tprint(len(res))\r\n\tprint(res,sep='\\n')\r\ns()", "from collections import defaultdict\r\ngl = []\r\ndef generate(k, l) :\r\n if k == 0 :\r\n gl.append(l.copy())\r\n l.append(ls[k])\r\n gl.append(l.copy())\r\n l.remove(ls[k])\r\n return\r\n generate(k-1, l)\r\n l.append(ls[k])\r\n generate(k-1, l)\r\n l.remove(ls[k])\r\ndef check(st) :\r\n for name in st :\r\n if len(dc[name].intersection(st)) > 0 :\r\n return False\r\n return True\r\nn, m = map(int,input().split())\r\nls = []\r\ndc = defaultdict(set)\r\nfor i in range(n) :\r\n ls.append(input())\r\nls.sort(reverse = True)\r\nfor i in range(m) :\r\n x, y = input().split()\r\n dc[x].add(y)\r\n dc[y].add(x)\r\ngenerate(n-1, [])\r\nans = set()\r\nfor elem in gl :\r\n if (check(set(elem))) :\r\n if len(elem) > len(ans) :\r\n ans = elem\r\nprint(len(ans))\r\nprint(ans,sep=\"\\n\")", "def good(a,bad):\r\n for i in bad:\r\n if i[0]in a:\r\n if i[1] in a:\r\n return False\r\n return True\r\ndef f(arr,bad,d):\r\n n=len(arr)\r\n mask=0\r\n ans=[]\r\n while mask<1<<n:\r\n temp=[]\r\n for i in range(len(arr)):\r\n if mask &(1<<i):\r\n temp.append(i)\r\n if good(temp,bad):\r\n ans.append(temp)\r\n mask+=1\r\n mx=max(ans,key=lambda s:len(s))\r\n print(len(mx))\r\n for i in mx:\r\n print(arr[i])\r\n return \"\"\r\n\r\n\r\na,b=map(int,input().strip().split())\r\nblanck=[]\r\nfor i in range(a):\r\n blanck.append(input())\r\nd={}\r\nblanck=sorted(blanck)\r\nfor i in range(len(blanck)):\r\n d[blanck[i]]=i\r\nbad=[]\r\nfor i in range(b):\r\n x,y=map(str,input().strip().split())\r\n k=sorted((d[x],d[y]))\r\n bad.append(k)\r\n\r\nprint(f(blanck,bad,d))\r\n\r\n", "n, m = map(int,input().split())\r\nID = {}\r\nname_from_ID = {}\r\nfor i in range(n):\r\n\tname = input()\r\n\tID[name] = i\r\n\tname_from_ID[i] = name\r\n\r\npeople_I_hate = [set() for i in range(n)]\r\nfor j in range(m):\r\n\tname1, name2 = input().split()\r\n\tpeople_I_hate[ID[name1]].add(ID[name2])\r\n\tpeople_I_hate[ID[name2]].add(ID[name1])\r\n\r\ndef conflict(team,people_I_hate):\r\n\tfor guy1 in team:\r\n\t\tfor guy2 in team:\r\n\t\t\tif guy1 in people_I_hate[guy2] or guy2 in people_I_hate:\r\n\t\t\t\treturn True\r\n\treturn False\r\n\r\nans = []\r\nfor mask in range(1<<n):\r\n\tteam = []\r\n\tfor i in range(n):\r\n\t\tif mask&(1<<i):\r\n\t\t\tteam.append(i)\r\n\r\n\tif not conflict(team,people_I_hate) and len(team) > len(ans):\r\n\t\tans = [name_from_ID[x] for x in team]\r\n\r\nprint(len(ans))\r\nfor name in sorted(ans):\r\n\tprint(name)\r\n\t", "hi=list()\r\nfor i in range(100):\r\n\tf=list()\r\n\tfor j in range(100):\r\n\t\tf.append(0)\r\n\thi.append(f)\r\nn, m=map(int, input().split())\r\nmp={}\r\narr=list()\r\nfor i in range(n):\r\n\tyo=input()\r\n\tarr.append(yo)\r\n\tmp[arr[i]]=i\r\nfor i in range(m):\r\n\ta, b=input().split()\r\n\tyo1=int(mp[a])\r\n\tyo2=int(mp[b])\r\n\thi[yo1][yo2]=1\r\n\thi[yo2][yo1]=1\r\nmaxi=0\r\nfor i in range(2n):\r\n\tvi=list()\r\n\tfor j in range(n):\r\n\t\tif ((2j)&i):\r\n\t\t\tvi.append(j)\r\n\tiss=True\r\n\tfor j in range(len(vi)):\r\n\t\tfor k in range(len(vi)):\r\n\t\t\tif hi[vi[j]][vi[k]]:\r\n\t\t\t\tiss=False\r\n\tif iss:\r\n\t\tyo=len(vi)\r\n\t\tmaxi=max(maxi, yo)\r\nfor i in range(2n):\r\n\tvi=list()\r\n\tfor j in range(n):\r\n\t\tif ((2j)&i):\r\n\t\t\tvi.append(j)\r\n\tiss=True\r\n\tfor j in range(len(vi)):\r\n\t\tfor k in range(len(vi)):\r\n\t\t\tif hi[vi[j]][vi[k]]:\r\n\t\t\t\tiss=False\r\n\tif iss:\r\n\t\tyo=len(vi)\r\n\t\tif maxi==yo:\r\n\t\t\tprint(len(vi))\r\n\t\t\tvs=list()\r\n\t\t\tfor j in range(len(vi)):\r\n\t\t\t\tvs.append(arr[vi[j]]);\r\n\t\t\tvs.sort()\r\n\t\t\tfor j in range(len(vi)):\r\n\t\t\t\tprint(vs[j])\r\n\t\t\texit()", "n,m=map(int,input().split())\nN=[n]\nNames={}\nNumbers={}\nEnemies=[]\nfor i in range(n):\n s=input()\n Names[s]=i\n Enemies.append([])\n Numbers[i]=str(s)\n\nfor i in range(m):\n a,b=input().split()\n Enemies[Names[a]].append(Names[b])\n Enemies[Names[b]].append(Names[a])\nAns=[[]]\n\ndef dp(N,i,Taken,Forbidden):\n if(i==N):\n if(len(Taken)>len(Ans[0])):\n Ans[0]=list(Taken)\n return\n if(i not in Forbidden):\n dp(N,i+1,Taken,Forbidden)\n dp(N,i+1,Taken+[i],Forbidden+Enemies[i])\n else:\n dp(N,i+1,Taken,Forbidden)\n return\n \ndp(n,0,[],[])\n\nprint(len(Ans[0]))\nAns=Ans[0]\n\nfor i in range(len(Ans)):\n Ans[i]=Numbers[Ans[i]]\nAns.sort()\nfor item in Ans:\n print(item)\n\n", "def bitmask(m, array):\n return [array[i] for i in range(len(array)) if m & (1 << i)]\nn, k = map(int, input().split())\nnames = [input() for _ in range(n)]\nnames.sort()\nbads = [input().split() for _ in range(k)]\nm_count, bb = -1, []\nfor m in range(2 * n):\n if bin(m).count('1') < m_count: continue\n b = bitmask(m, names)\n f = True\n for x, y in bads:\n if x in b and y in b:\n f = False\n if f:\n m_count, bb = len(b), b\nprint (m_count)\nprint ('\\n'.join(bb))\n\t \t\t \t \t \t \t \t \t \t\t\t \t\t", "from itertools import combinations\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n name = sorted([input().strip() for i in range(n)])\r\n bad = sorted([sorted(input().strip().split()) for i in range(m)])\r\n # print(name)\r\n # print(bad)\r\n for i in range(n, -1, -1):\r\n temp = sorted(map(sorted, combinations(name, i)))\r\n # print(temp)\r\n for k in temp:\r\n flag = 1\r\n for j in map(sorted, combinations(k, 2)):\r\n # print(j)\r\n if j in bad:\r\n flag = 0\r\n break\r\n if flag:\r\n return k\r\n\r\n\r\nx = solve()\r\nprint(len(x))\r\nprint(x, sep='\\n')\r\n", "def check(b):\n\tfor i in b:\n\t\tfor j in b:\n\t\t\tif (a[i],a[j]) in pair or (a[j],a[i]) in pair:\n\t\t\t\treturn False\n\treturn True\n\nn,m = map(int,input().split())\na = []\nind = {}\nfor i in range(n):\n\ta.append(input())\n\tind[a[-1]] = i\ngraph = [[] for i in range(n)]\npair = {}\nfor i in range(m):\n\tx,y = input().split()\n\tpair[(x,y)] = 1\n\tgraph[ind[x]].append(ind[y])\n\tgraph[ind[y]].append(ind[x])\nif m==0:\n\tprint (n)\n\ta.sort()\n\tfor i in a:\n\t\tprint (i)\n\texit()\n\nans = 0\nstring = \"\"\nfor i in range(1,2n):\n\tb = bin(i)[2:]\n\tb = \"0\"(n-len(b))+b\n\ttemp = []\n\tfor j in range(n):\n\t\tif b[j]==\"1\":\n\t\t\ttemp.append(ind[a[j]])\n\t# print (i,b,temp,check(temp),pair,ind)\n\tif check(temp):\n\t\tif len(temp)>ans:\n\t\t\tans = len(temp)\n\t\t\tstring = b\nprint (ans)\nansl = []\nfor i in range(n):\n\tif string[i]==\"1\":\n\t\tansl.append(a[i])\nansl.sort()\nfor i in ansl:\n\tprint (i)\n", "import itertools as it\n\n\nn, m = map(int, input().split())\n\nedges = set()\n\nfriends_M = {}\n\nfor i in range(n):\n friends_M[input()] = i\n\nfor _ in range(m):\n a, b = input().split()\n a, b = friends_M[a], friends_M[b]\n edges.add((a, b))\n edges.add((b, a))\n\nbest = 0\nbest_vals = []\n\nfor subset in it.product([0, 1], repeat=n):\n ss = list(it.compress(range(n), subset))\n good = True\n for i in range(len(ss)):\n for j in range(i + 1, len(ss)):\n if (ss[i], ss[j]) in edges:\n good = False\n if good:\n if len(ss) > best:\n best = len(ss)\n best_vals = ss\n\nprint(best)\nres = []\nfor i in range(len(best_vals)):\n for j, k in friends_M.items():\n if k == best_vals[i]:\n res += [j]\n break\n\nfor name in sorted(res):\n print(name)\n\n", "\r\nnums = input().split()\r\nnumPeople = int(nums[0])\r\nnumPairs = int(nums[1])\r\n\r\nnames = []\r\nfor i in range(numPeople):\r\n names.append(input());\r\npair1 = []\r\npair2 = []\r\n\r\nfor i in range(numPairs):\r\n pair = input().split()\r\n pair1.append(pair[0])\r\n pair2.append(pair[1])\r\n\r\nnumSets = pow(2, numPeople);\r\n\r\nbestSet = []\r\n\r\nfor i in range(1,numSets):\r\n currSet = []\r\n for j in range(numPeople):\r\n if (i & (1<<j) > 0):\r\n currSet.append(names[j])\r\n\r\n validSet = True\r\n for j in range(numPairs):\r\n person1 = pair1[j]\r\n person2 = pair2[j]\r\n if person1 in currSet and person2 in currSet:\r\n validSet = False\r\n break\r\n\r\n if validSet:\r\n if len(currSet) > len(bestSet):\r\n bestSet = currSet\r\n\r\nbestSet.sort()\r\nprint(len(bestSet))\r\nfor i in bestSet:\r\n print(i)\r\n \r\n\r\n", "import copy\r\n\r\nn, m = map(int, input().split())\r\nnames = [input() for _ in range(n)]\r\n\r\nblocked = []\r\nfor i in range(m):\r\n a, b = input().split()\r\n blocked.append((a, b))\r\n\r\n\r\nres = []\r\n\r\nfor i in range(2n):\r\n temp = []\r\n f = 1\r\n for j in range(n+1):\r\n if i & (1 << j):\r\n temp.append(names[j])\r\n\r\n for n1, n2 in blocked:\r\n if (n1 in temp) and (n2 in temp):\r\n f = 0\r\n if f and (len(res) < len(temp)):\r\n res = copy.deepcopy(temp)\r\n\r\nprint(len(res))\r\nres.sort()\r\nfor name in res:\r\n print(name)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\n\r\npeople = []\r\nhaters = {}\r\n\r\nfor _ in range(n):\r\n name = input()\r\n people.append(name)\r\n haters[name] = []\r\n \r\nfor _ in range(m):\r\n a, b = input().split()\r\n haters[a].append(b)\r\n haters[b].append(a)\r\n \r\nteam = set()\r\n\r\nfor i in range(2n):\r\n t = set()\r\n not_well = set()\r\n \r\n for j in range(n):\r\n if i & (1 << j) and people[j] not in not_well:\r\n t.add(people[j])\r\n for hater in haters[people[j]]:\r\n not_well.add(hater)\r\n \r\n if len(t) > len(team):\r\n team = t\r\n \r\nprint(len(team))\r\n\r\nfor name in sorted(team):\r\n print(name)", "from collections import defaultdict\r\ngraph = defaultdict(list)\r\nn,m = list(map(int,input().split()))\r\nd = {}\r\ncnt = 0 \r\nfor i in range(n):\r\n x = input()\r\n d[x] = cnt\r\n cnt+=1\r\narr = []\r\nfor i in range(m):\r\n u,v = list(map(str,input().split()))\r\n arr.append([u,v])\r\npossibilities = []\r\nfor i in range(2*n):\r\n x = bin(i).split('b')[1]\r\n x = '0'(n-len(x))+x\r\n possibilities.append(x)\r\nans = []\r\nfor i in possibilities:\r\n f = 0\r\n for j in arr:\r\n if i[d[j[0]]]=='1' and i[d[j[1]]]=='1':\r\n f = 1\r\n break\r\n if f==0:\r\n ans.append(i)\r\nk = -1\r\nu = -1\r\nmat = []\r\nfor i in ans:\r\n y = i.count('1')\r\n if k<y:\r\n k = y\r\n u = i\r\n# for i in ans:\r\n# if i.count('1')==k:\r\n# mat.append(i)\r\n# print(mat)\r\n# print(k)\r\nfor i in range(len(u)):\r\n if u[i]=='1':\r\n for j in d:\r\n if d[j]==i:\r\n mat.append(j)\r\n break\r\nmat.sort()\r\nprint(len(mat))\r\nfor i in mat:\r\n print(i)", "from itertools import combinations\r\nfrom collections import defaultdict\r\nimport sys\r\n\r\nn, k = map(int, input().split())\r\n\r\npeople = []\r\n\r\nfor _ in range(n):\r\n people.append(input())\r\n\r\n\r\ngraph = defaultdict(set)\r\n\r\nfor _ in range(k):\r\n a, b = input().split()\r\n \r\n graph[a].add(b)\r\n graph[b].add(a)\r\n\r\n\r\ndef check(combination):\r\n for person in combination:\r\n if len(combination.intersection(graph[person])) != 0:\r\n return False\r\n return True\r\n\r\ngroups = []\r\n\r\nfor i in range(1, len(people) + 1):\r\n groups.extend(combinations(people, i))\r\n\r\nans = []\r\nfor comb in map(set, groups):\r\n if check(comb) and len(ans) < len(comb):\r\n ans = comb\r\n\r\nprint(len(ans))\r\nprint(\"\\n\".join(sorted(ans)))\r\n \r\n ", "def solve(n, prefix):\r\n if n == 0:\r\n ans = []\r\n for i in range(len(prefix)):\r\n if prefix[i] == 1:\r\n ans.append(names[i])\r\n for x, y in pairs:\r\n if x in ans and y in ans:\r\n return []\r\n return ans\r\n else:\r\n prefix.append(1)\r\n ans1 = solve(n - 1, prefix)\r\n prefix.pop()\r\n prefix.append(0)\r\n ans2 = solve(n - 1, prefix)\r\n prefix.pop()\r\n if len(ans2) > len(ans1):\r\n return ans2\r\n else:\r\n return ans1\r\n\r\n\r\nn, m = map(int, input().split())\r\nnames = [input() for _ in range(n)]\r\npairs = [input().split() for _ in range(m)]\r\nans = solve(n, [])\r\nprint(len(ans))\r\nans.sort()\r\nfor name in ans:\r\n print(name)\r\n", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nn,m=map(int,input().split())\r\nnames=[]\r\nfor i in range(n):\r\n names.append(input())\r\na=[]\r\nfor i in range(m):\r\n u,v=map(str,input().split())\r\n a.append([u,v])\r\nans=[]\r\nfor i in range(pow(2,n)):\r\n num=i\r\n st=set()\r\n for j in range(n):\r\n rem=num%2\r\n if rem==1:\r\n st.add(names[j])\r\n num//=2\r\n ver=True\r\n for u,v in a:\r\n if u in st and v in st:\r\n ver=False\r\n break\r\n if ver:\r\n if len(st)>len(ans):\r\n ans=st.copy()\r\nprint(len(ans))\r\nans=list(ans)\r\nans.sort()\r\nfor name in ans:\r\n print(name)", "n, m = map(int, input().split())\r\n\r\nvolunteers = []\r\npairs = set()\r\nteams = set()\r\n\r\nfor i in range(n):\r\n volunteers.append(input())\r\n\r\nfor i in range(m):\r\n v1, v2 = input().split()\r\n pairs.add(tuple(sorted((v1, v2))))\r\n\r\ndef backtrack(i, team):\r\n\r\n if team and tuple(team) not in teams:\r\n teams.add(tuple(team))\r\n\r\n if i >= n:\r\n return\r\n\r\n valid = True\r\n\r\n for volunteer in team:\r\n\r\n if tuple(sorted((volunteer, volunteers[i]))) in pairs:\r\n valid = False\r\n break\r\n \r\n if valid:\r\n team.append(volunteers[i])\r\n backtrack(i + 1, team)\r\n team.pop()\r\n \r\n backtrack(i + 1, team)\r\n\r\nbacktrack(0, [])\r\nmax_team = None\r\nmax_len = 0\r\n\r\nfor team in teams:\r\n\r\n if len(team) > max_len:\r\n max_len = len(team)\r\n max_team = team\r\n\r\nprint(len(max_team))\r\nmax_team = sorted(max_team)\r\n\r\nfor volunteer in max_team:\r\n print(volunteer)", "from itertools import product\r\nn,m = map(int, input().split())\r\nvl = sorted([ input() for i in range(n)])\r\ncm = {vl[i]:i for i in range(n)}\r\ncl = []\r\nfor i in range(m):\r\n a,b = input().split()\r\n cl+=[[cm[a],cm[b]]]\r\nans=[(),0]\r\nfor x in list(product([1,0],repeat=n)):\r\n flag=0\r\n for c in cl:\r\n if x[c[0]]==1==x[c[1]]:\r\n flag=1\r\n break;\r\n \r\n if flag==0 and ans[1]<x.count(1):\r\n ans=[x,x.count(1)]\r\n \r\n# lucky+=[int(''.join([str(y) for y in x])) for x in list(product([4,7],repeat=i))]\r\n# print(cm)\r\nprint(ans[1])\r\nprint('\\n'.join([vl[i] for i in range(n) if ans[0][i]==1]))\r\n###################\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 ceil, floor, gcd, sqrt, trunc, inf\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\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\n# sys.setrecursionlimit(pow(10, 6))\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\nmod = pow(10, 9) + 7\r\nmod2 = 998244353\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\n\r\n\r\ndef on(a):\r\n i = n\r\n cnt = []\r\n while i >= 0:\r\n if a & (1 << i):\r\n cnt.append(i)\r\n i -= 1\r\n return cnt\r\n\r\n\r\ndef check(arr, index):\r\n for i in arr:\r\n if names[i] in graph[names[index]] or names[index] in graph[names[i]]:\r\n return False\r\n return True\r\n\r\n\r\ndef recur(i=0, mask=0):\r\n global answer\r\n if i == n:\r\n temp = on(mask)\r\n if len(temp) > len(answer):\r\n answer = temp\r\n return\r\n if mask & (1 << i):\r\n return\r\n temp = on(mask)\r\n if check(temp, i):\r\n recur(i+1, mask \| (1 << i))\r\n recur(i+1, mask)\r\n\r\n\r\nn, m = sp()\r\ngraph = dd(set)\r\nnames = []\r\nfor i in range(n):\r\n names.append(data())\r\nfor i in range(m):\r\n u, v = ssp()\r\n graph[u].add(v)\r\n graph[v].add(u)\r\nanswer = []\r\nrecur()\r\nout(len(answer))\r\nfor i in range(len(answer)):\r\n answer[i] = names[answer[i]]\r\nfor i in sorted(answer):\r\n out(i)\r\n", "from collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\nnames = []\r\n\r\nfor _ in range(n):\r\n names.append(input())\r\n\r\ndont_agree = defaultdict(list)\r\ndegree = defaultdict(int)\r\n\r\nfor _ in range(m):\r\n name1, name2 = input().split()\r\n dont_agree[name1].append(name2)\r\n dont_agree[name2].append(name1)\r\n degree[name1] += 1\r\n degree[name2] += 1\r\n\r\n\r\nclass Solve:\r\n\r\n def __init__(self, names):\r\n self.best_team = set()\r\n self.current_team = set()\r\n self.names = names\r\n\r\n def backtrack(self, index):\r\n if len(self.current_team) > len(self.best_team):\r\n self.best_team = self.current_team.copy()\r\n\r\n if index == len(names):\r\n return\r\n\r\n # add em to the team\r\n self.backtrack(index+1)\r\n\r\n for neighbor in dont_agree[self.names[index]]:\r\n if neighbor in self.current_team:\r\n return\r\n\r\n self.current_team.add(self.names[index])\r\n self.backtrack(index+1)\r\n self.current_team.remove(self.names[index])\r\n\r\n\r\nsol = Solve(names)\r\nsol.backtrack(0)\r\nbest_team = sol.best_team\r\n\r\nprint(len(best_team))\r\nbest_team = sorted(best_team)\r\n\r\nfor name in best_team:\r\n print(name)\r\n", "n,m=map(int,input().split())\r\nnames=[]\r\nfor i in range(n):\r\n names.append(input())\r\nhate=[]\r\nfor i in range(m):\r\n hate.append(list(input().split()))\r\n\r\nans=set() \r\nfor x in range(1,(1<<n)+1):\r\n a=set()\r\n for i in range(n):\r\n if x & (1<<i):\r\n a.add(names[i])\r\n flag=True\r\n for b in hate:\r\n if b[0] in a and b[1] in a:\r\n flag=False\r\n break\r\n if flag:\r\n if len(a)>len(ans):\r\n ans=a\r\n\r\nprint(len(ans))\r\nprint(sorted(list(ans)),sep=\"\\n\")\r\n \r\n \r\n" ]	{"inputs": ["3 1\nPetya\nVasya\nMasha\nPetya Vasya", "3 0\nPasha\nLesha\nVanya", "7 12\nPasha\nLesha\nVanya\nTaras\nNikita\nSergey\nAndrey\nPasha Taras\nPasha Nikita\nPasha Andrey\nPasha Sergey\nLesha Taras\nLesha Nikita\nLesha Andrey\nLesha Sergey\nVanya Taras\nVanya Nikita\nVanya Andrey\nVanya Sergey", "2 0\nAndrey\nTaras", "16 0\nTaras\nNikita\nSergey\nAndrey\nRomka\nAlexey\nUra\nDenis\nEgor\nVadim\nAlena\nOlya\nVanya\nBrus\nJohn\nAlice", "6 6\nAlena\nOlya\nVanya\nBrus\nJohn\nAlice\nAlena John\nAlena Alice\nOlya John\nOlya Alice\nVanya John\nVanya Alice", "7 6\nAlena\nOlya\nVanya\nBrus\nJohn\nAlice\nMariana\nAlena John\nAlena Alice\nOlya John\nOlya Alice\nVanya John\nVanya Alice", "1 0\nPetr", "2 0\nNgzlPJgFgz\nQfpagVpWz", "2 1\ncLWdg\nGoWegdDRp\nGoWegdDRp cLWdg", "3 0\nr\nyVwqs\nsdTDerOyhp", "3 3\nvRVatwL\nWmkUGiYEn\nuvvsXKXcJ\nWmkUGiYEn vRVatwL\nuvvsXKXcJ vRVatwL\nuvvsXKXcJ WmkUGiYEn", "16 11\njA\nkyRNTE\neY\nToLcqN\nbnenhMxiK\nzlkOe\nXCKZ\neaQrds\nqUdInpi\nKgPQA\nmQIl\ninOCWEZHxy\nyA\nPIZRMOu\nXtueKFM\nfRNwNn\ninOCWEZHxy qUdInpi\nKgPQA zlkOe\ninOCWEZHxy KgPQA\nfRNwNn XCKZ\ninOCWEZHxy eY\nyA mQIl\ninOCWEZHxy ToLcqN\nyA KgPQA\nqUdInpi ToLcqN\nqUdInpi eaQrds\nPIZRMOu eY", "12 12\njWuGgOjV\nWs\njTZQMyH\nULp\nUfsnPRt\nk\nbPKrnP\nW\nJOaQdgglDG\nAodc\ncpRjAUyYIW\nMrjB\nbPKrnP ULp\nk Ws\ncpRjAUyYIW k\nULp jTZQMyH\nbPKrnP jWuGgOjV\ncpRjAUyYIW jTZQMyH\nW ULp\nk jTZQMyH\nk ULp\nMrjB ULp\ncpRjAUyYIW Aodc\nW k", "11 17\njFTNgFBO\ntZDgmdF\nIjeDjoj\nBEMAaYkNb\nRZRQl\ntK\nlNHWt\nIdG\nLAbVLYiY\notOBsWqJuo\nUoTy\ntK BEMAaYkNb\nBEMAaYkNb jFTNgFBO\nIjeDjoj tZDgmdF\nRZRQl jFTNgFBO\nlNHWt tZDgmdF\nRZRQl tZDgmdF\nUoTy LAbVLYiY\nBEMAaYkNb IjeDjoj\nIdG BEMAaYkNb\nLAbVLYiY tK\nLAbVLYiY jFTNgFBO\nUoTy IjeDjoj\nlNHWt jFTNgFBO\nlNHWt BEMAaYkNb\ntK IjeDjoj\nUoTy RZRQl\nBEMAaYkNb tZDgmdF", "11 13\ncZAMfd\nSWQnweM\nKlQW\nWRsnNZT\nix\nUC\nLWqsVHcWec\nfeb\ncBy\ntvk\nRXDlX\nfeb SWQnweM\ncBy WRsnNZT\nLWqsVHcWec KlQW\nRXDlX feb\nLWqsVHcWec cZAMfd\ncBy UC\nWRsnNZT SWQnweM\nRXDlX cBy\ntvk UC\ncBy SWQnweM\nUC KlQW\nRXDlX KlQW\nUC WRsnNZT", "4 2\nadQx\nrJGeodBycK\ntgPYZk\ncz\ncz tgPYZk\nrJGeodBycK adQx", "4 2\noVemoZhjW\nHspFEry\nhFO\njxt\nhFO HspFEry\njxt oVemoZhjW", "5 2\niBrgNFlNXd\nlnGPIV\nnb\nB\nVgqRcEOG\nlnGPIV iBrgNFlNXd\nB iBrgNFlNXd", "5 1\nWEYUdpYmZp\nfhNmMpjr\nydARivBg\ncilTtE\nyeXxkhPzB\nyeXxkhPzB cilTtE", "6 9\noySkmhCD\nUIKWj\nmHolKkBx\nQBikssqz\nZ\nzoFUJYa\nZ UIKWj\nQBikssqz oySkmhCD\nQBikssqz UIKWj\nZ oySkmhCD\nzoFUJYa UIKWj\nzoFUJYa Z\nzoFUJYa mHolKkBx\nzoFUJYa QBikssqz\nQBikssqz mHolKkBx", "6 1\nuPVIuLBuYM\nVejWyKCtbN\nqqjgF\nulBD\nDRNzxJU\nCOzbXWOt\nulBD qqjgF", "7 14\nFXCT\nn\no\nS\nMdFuonu\nmszv\nbqScOCw\nS o\nbqScOCw FXCT\nMdFuonu o\no n\nbqScOCw n\nmszv S\nbqScOCw MdFuonu\nmszv n\nS FXCT\nbqScOCw o\no FXCT\nmszv MdFuonu\nmszv FXCT\nbqScOCw mszv", "7 6\nj\nZ\nPZNeTyY\nm\na\nUj\nsuaaSiKcK\nUj PZNeTyY\na j\nPZNeTyY Z\nPZNeTyY j\nm PZNeTyY\nm j", "8 6\nU\nC\nPEElYwaxf\nVubTXNI\nJ\nIxZUHV\nhLNFnzmqFE\nDPPvwuWvmA\nhLNFnzmqFE IxZUHV\nIxZUHV C\nJ PEElYwaxf\nIxZUHV PEElYwaxf\nPEElYwaxf C\nJ VubTXNI", "8 12\nBkgxqAF\nKhq\nNpIfk\nkheqUyDVG\niRBkHlRpp\nZDaQY\nNG\nqN\nqN BkgxqAF\nNpIfk BkgxqAF\niRBkHlRpp BkgxqAF\niRBkHlRpp NpIfk\nNG Khq\niRBkHlRpp Khq\nNG ZDaQY\nNG iRBkHlRpp\nNG NpIfk\nqN Khq\nZDaQY kheqUyDVG\nNpIfk Khq", "9 5\nRFiow\naxgvtiBGbx\ngGBVZtI\nVWAxrqx\nmnASVEQI\ntZHzWGAvXc\nBeaCYhIRLy\nhTdUL\nFJd\nhTdUL RFiow\nhTdUL gGBVZtI\nFJd axgvtiBGbx\nFJd BeaCYhIRLy\nhTdUL axgvtiBGbx", "9 13\nYiUXqlBUx\nQNgYuX\ndPtyZ\nITtwRJCv\nLJ\nrAG\nOgxNq\nsitechE\nvVAAz\nOgxNq QNgYuX\nOgxNq dPtyZ\nsitechE rAG\nLJ QNgYuX\nQNgYuX YiUXqlBUx\nOgxNq LJ\nvVAAz OgxNq\nrAG dPtyZ\nvVAAz LJ\nvVAAz ITtwRJCv\nsitechE LJ\nrAG YiUXqlBUx\nsitechE QNgYuX", "9 6\nfLfek\nEQPcotnrp\nCaAlbwoIL\nVG\nNAZKIBiKT\noFy\njFluh\nKqHXRNya\nQSwgobA\noFy EQPcotnrp\nKqHXRNya jFluh\noFy NAZKIBiKT\njFluh oFy\njFluh fLfek\noFy fLfek", "9 14\nmoRNeufngu\nBSKI\nzXl\ngwmIDluW\nYFn\nHvasEgl\nXcAC\neVP\nAiOm\neVP BSKI\neVP YFn\nHvasEgl YFn\neVP XcAC\nAiOm HvasEgl\nXcAC YFn\nzXl moRNeufngu\neVP zXl\nHvasEgl BSKI\nXcAC gwmIDluW\nXcAC HvasEgl\nYFn moRNeufngu\nzXl BSKI\nHvasEgl gwmIDluW", "15 8\ncXeOANpvBF\nbkeDfi\nnsEUAKNxQI\noSIb\naU\nXYXYVo\nduZQ\naPkr\nPVrHpL\nmVgmv\nhHhukllwbf\nGkNPGYVxjY\nbgBjA\nslNKCLIlOv\nmPILXy\nbgBjA cXeOANpvBF\nGkNPGYVxjY cXeOANpvBF\nslNKCLIlOv GkNPGYVxjY\nGkNPGYVxjY mVgmv\nXYXYVo cXeOANpvBF\nslNKCLIlOv bkeDfi\nmVgmv aPkr\nslNKCLIlOv nsEUAKNxQI", "15 3\na\nYclKFJoaIA\nhalYcB\nbLOlPzAeQ\ntckjt\noDFijpx\nb\npz\nVDLb\nlCEHPibt\noF\npzJD\nMC\nqklsX\nTAU\npzJD tckjt\nqklsX oF\nMC pzJD", "16 8\nJIo\nINanHVnP\nKaxyCBWt\nkVfnsz\nRAwFYCrSvI\nF\nvIEWWIvh\nTGF\nFeuhJJwJ\nTngcmS\nSqI\nRmcaVngp\neGwhme\nlwaFfXzM\noabGmpvVH\nTMT\nFeuhJJwJ F\neGwhme FeuhJJwJ\nRmcaVngp SqI\nINanHVnP JIo\nSqI FeuhJJwJ\nF kVfnsz\nTGF F\nTMT TGF", "16 25\nbBZ\nEr\nZ\nrYJmfZLgmx\nPaJNrF\naHtRqSxOO\nD\nhsagsG\nMDuBOXrmWH\nSgjMQZ\nYXgWq\nxDwpppG\nSDY\nJwZWx\ncOzrgrBaE\nFJYX\nYXgWq SgjMQZ\nSDY PaJNrF\nFJYX rYJmfZLgmx\nhsagsG Er\nxDwpppG rYJmfZLgmx\naHtRqSxOO rYJmfZLgmx\nhsagsG bBZ\nJwZWx hsagsG\nFJYX cOzrgrBaE\nSDY YXgWq\nFJYX Z\nJwZWx rYJmfZLgmx\nD rYJmfZLgmx\nYXgWq Z\nrYJmfZLgmx Z\naHtRqSxOO bBZ\nSDY rYJmfZLgmx\ncOzrgrBaE D\nYXgWq hsagsG\nSDY aHtRqSxOO\ncOzrgrBaE xDwpppG\nSDY bBZ\nSDY Er\nJwZWx xDwpppG\nFJYX JwZWx", "16 37\ntIWi\nq\nIEAYCq\nXozwkum\nCC\niPwfd\nS\nXEf\nWqEiwkH\nWX\ne\nltmruh\nKGx\nauTUYZRC\nmeJa\nM\nmeJa q\nKGx e\nXEf Xozwkum\ne q\nauTUYZRC KGx\ne CC\nM CC\nM meJa\nWX CC\nWqEiwkH IEAYCq\nauTUYZRC WqEiwkH\nKGx WX\nmeJa KGx\nXEf q\nauTUYZRC XEf\nauTUYZRC IEAYCq\nWX XEf\nM XEf\nWqEiwkH q\nM KGx\nKGx CC\nM e\nWqEiwkH Xozwkum\nCC q\nS Xozwkum\nKGx tIWi\nWX q\nXEf S\nauTUYZRC S\nCC IEAYCq\nKGx IEAYCq\ne WqEiwkH\nM S\nauTUYZRC q\nS tIWi\nM ltmruh\nM iPwfd", "16 11\ntulhZxeKgo\nbrAXY\nyQUkaihDAg\nmwjlDVaktK\nweVtBIP\nzRwb\nds\nhXPfJrL\nAdIfP\nazQeXn\nB\nJlmscIUOxO\nZuxr\nV\nOfyLIUO\nuaMl\nhXPfJrL yQUkaihDAg\nweVtBIP yQUkaihDAg\nazQeXn hXPfJrL\nV tulhZxeKgo\nzRwb yQUkaihDAg\nds mwjlDVaktK\nzRwb brAXY\nyQUkaihDAg brAXY\nB yQUkaihDAg\nAdIfP mwjlDVaktK\nbrAXY tulhZxeKgo", "5 10\nTaras\nNikita\nSergey\nAndrey\nRomka\nTaras Romka\nTaras Nikita\nTaras Sergey\nTaras Andrey\nRomka Nikita\nRomka Sergey\nRomka Andrey\nNikita Sergey\nNikita Andrey\nSergey Andrey"], "outputs": ["2\nMasha\nPetya", "3\nLesha\nPasha\nVanya", "4\nAndrey\nNikita\nSergey\nTaras", "2\nAndrey\nTaras", "16\nAlena\nAlexey\nAlice\nAndrey\nBrus\nDenis\nEgor\nJohn\nNikita\nOlya\nRomka\nSergey\nTaras\nUra\nVadim\nVanya", "4\nAlena\nBrus\nOlya\nVanya", "5\nAlena\nBrus\nMariana\nOlya\nVanya", "1\nPetr", "2\nNgzlPJgFgz\nQfpagVpWz", "1\nGoWegdDRp", "3\nr\nsdTDerOyhp\nyVwqs", "1\nWmkUGiYEn", "10\nKgPQA\nPIZRMOu\nToLcqN\nXCKZ\nXtueKFM\nbnenhMxiK\neaQrds\njA\nkyRNTE\nmQIl", "8\nAodc\nJOaQdgglDG\nMrjB\nUfsnPRt\nW\nWs\nbPKrnP\njTZQMyH", "6\nIdG\nIjeDjoj\nLAbVLYiY\nRZRQl\nlNHWt\notOBsWqJuo", "6\nKlQW\nWRsnNZT\ncZAMfd\nfeb\nix\ntvk", "2\nadQx\ncz", "2\nHspFEry\njxt", "4\nB\nVgqRcEOG\nlnGPIV\nnb", "4\nWEYUdpYmZp\ncilTtE\nfhNmMpjr\nydARivBg", "3\nUIKWj\nmHolKkBx\noySkmhCD", "5\nCOzbXWOt\nDRNzxJU\nVejWyKCtbN\nqqjgF\nuPVIuLBuYM", "3\nFXCT\nMdFuonu\nn", "5\nUj\nZ\na\nm\nsuaaSiKcK", "5\nC\nDPPvwuWvmA\nJ\nU\nhLNFnzmqFE", "3\nBkgxqAF\nKhq\nZDaQY", "7\nBeaCYhIRLy\nRFiow\nVWAxrqx\naxgvtiBGbx\ngGBVZtI\nmnASVEQI\ntZHzWGAvXc", "4\nITtwRJCv\nLJ\nYiUXqlBUx\ndPtyZ", "7\nCaAlbwoIL\nEQPcotnrp\nKqHXRNya\nNAZKIBiKT\nQSwgobA\nVG\nfLfek", "4\nAiOm\nBSKI\nYFn\ngwmIDluW", "12\nGkNPGYVxjY\nPVrHpL\nXYXYVo\naPkr\naU\nbgBjA\nbkeDfi\nduZQ\nhHhukllwbf\nmPILXy\nnsEUAKNxQI\noSIb", "13\nMC\nTAU\nVDLb\nYclKFJoaIA\na\nb\nbLOlPzAeQ\nhalYcB\nlCEHPibt\noDFijpx\noF\npz\ntckjt", "11\nF\nINanHVnP\nKaxyCBWt\nRAwFYCrSvI\nRmcaVngp\nTMT\nTngcmS\neGwhme\nlwaFfXzM\noabGmpvVH\nvIEWWIvh", "8\nD\nEr\nJwZWx\nMDuBOXrmWH\nPaJNrF\nSgjMQZ\nZ\naHtRqSxOO", "8\nIEAYCq\nWX\nXozwkum\ne\niPwfd\nltmruh\nmeJa\ntIWi", "11\nAdIfP\nB\nJlmscIUOxO\nOfyLIUO\nV\nZuxr\nazQeXn\nbrAXY\nds\nuaMl\nweVtBIP", "1\nAndrey"]}	UNKNOWN	PYTHON3	CODEFORCES	28
90b3babebf9e99d1cac2b06764636584	none	You are given a rectangular parallelepiped with sides of positive integer lengths $A$, $B$ and $C$. Find the number of different groups of three integers ($a$, $b$, $c$) such that $1\leq a\leq b\leq c$ and parallelepiped $A\times B\times C$ can be paved with parallelepipeds $a\times b\times c$. Note, that all small parallelepipeds have to be rotated in the same direction. For example, parallelepiped $1\times 5\times 6$ can be divided into parallelepipeds $1\times 3\times 5$, but can not be divided into parallelepipeds $1\times 2\times 3$. The first line contains a single integer $t$ ($1 \leq t \leq 10^5$) — the number of test cases. Each of the next $t$ lines contains three integers $A$, $B$ and $C$ ($1 \leq A, B, C \leq 10^5$) — the sizes of the parallelepiped. For each test case, print the number of different groups of three points that satisfy all given conditions. Sample Input 4 1 1 1 1 6 1 2 2 2 100 100 100 Sample Output 1 4 4 165	[ "from math import gcd\r\n \r\nN = 100001\r\nd = [0 for i in range(N)]\r\nfor i in range(1, N):\r\n for j in range(i, N, i):\r\n d[j] += 1\r\n \r\nn = int(input())\r\nfor _ in range(n):\r\n a, b, c = map(int, input().split())\r\n A, B, C = d[a], d[b], d[c]\r\n AB, BC, CA = d[gcd(a, b)], d[gcd(b, c)], d[gcd(c, a)]\r\n ABC = d[gcd(gcd(a, b), c)]\r\n print(A * B * C - AB * BC * CA + ABC * (AB * BC + BC * CA + CA * AB)\r\n - A * BC * (BC - 1) // 2 - B * CA * (CA - 1) // 2 - C * AB * (AB - 1) // 2\r\n - ABC * (ABC + 1) * (AB + BC + CA) // 2 + ABC * (ABC + 1) * (ABC + 2) // 6)", "from sys import stdin\nfrom math import gcd\n\n\ndef main():\n input()\n l = stdin.read().splitlines()\n d = [3, 1, 2, 2, 2, 1] * 16667\n for i in range(4, 100001):\n for j in range(i, 100001, i):\n d[j] += 1\n for i, s in enumerate(l):\n a, b, c = map(int, s.split())\n k = gcd(b, c)\n ab = d[gcd(a, b)]\n ac = d[gcd(a, c)]\n bc = d[k]\n abc = d[gcd(a, k)]\n asz = d[a] - ab - ac + abc\n bsz = d[b] - bc - ab + abc\n csz = d[c] - ac - bc + abc\n absz = ab - abc\n bcsz = bc - abc\n acsz = ac - abc\n abcsz = abc\n l[i] = (asz * bsz * csz +\n (absz * (asz + bsz) * csz) +\n (bcsz * (bsz + csz) * asz) +\n (acsz * (asz + csz) * bsz) +\n (abcsz * (asz * bsz + asz * csz + bsz * csz)) +\n (abcsz * (absz + bcsz + acsz) * (asz + bsz + csz)) +\n ((asz + bsz + csz + absz + bcsz + acsz) * (abcsz * (abcsz + 1) // 2)) +\n (absz * bcsz * acsz) +\n ((absz * (absz + 1) * d[c]) +\n (bcsz * (bcsz + 1) * d[a]) +\n (acsz * (acsz + 1) * d[b])) // 2 +\n ((asz + bsz + csz + abcsz) * (absz * acsz + absz * bcsz + bcsz * acsz)) +\n (abcsz + (abcsz * (abcsz - 1)) + (abcsz * (abcsz - 1) * (abcsz - 2) // 6)))\n print('\\n'.join(map(str, l)))\n\n\nif __name__ == '__main__':\n main()\n" ]	{"inputs": ["4\n1 1 1\n1 6 1\n2 2 2\n100 100 100", "10\n1 1 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1", "10\n9 6 8\n5 5 2\n8 9 2\n2 7 9\n6 4 10\n1 1 8\n2 8 1\n10 6 3\n7 5 2\n9 5 4", "1\n100000 100000 100000"], "outputs": ["1\n4\n4\n165", "1\n1\n1\n1\n1\n1\n1\n1\n1\n1", "41\n6\n21\n12\n39\n4\n7\n26\n8\n18", "8436"]}	UNKNOWN	PYTHON3	CODEFORCES	2
90c3ae3432be76316c44df8b294d09fc	Money Transfers	There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are neighbours if n<=><=1. No bank is a neighbour of itself. Vasya has an account in each bank. Its balance may be negative, meaning Vasya owes some money to this bank. There is only one type of operations available: transfer some amount of money from any bank to account in any neighbouring bank. There are no restrictions on the size of the sum being transferred or balance requirements to perform this operation. Vasya doesn't like to deal with large numbers, so he asks you to determine the minimum number of operations required to change the balance of each bank account to zero. It's guaranteed, that this is possible to achieve, that is, the total balance of Vasya in all banks is equal to zero. The first line of the input contains a single integer n (1<=≤<=n<=≤<=100<=000) — the number of banks. The second line contains n integers ai (<=-<=109<=≤<=ai<=≤<=109), the i-th of them is equal to the initial balance of the account in the i-th bank. It's guaranteed that the sum of all ai is equal to 0. Print the minimum number of operations required to change balance in each bank to zero. Sample Input 3 5 0 -5 4 -1 0 1 0 4 1 2 3 -6 Sample Output 1 2 3	[ "# http://codeforces.com/contest/675/problem/C\nfrom collections import defaultdict\n\nn = int(input())\nl = list(map(int, input().split()))\n\n# frequency of the most frequent cumulative sum, using hash\n\nd = defaultdict(int)\n\ncost = n-1\ns = 0 # indicates postion based on sum\nfor x in l:\n s+=x\n d[s]+=1\n cost = min(cost,n- d[s])\n\nprint (cost) \n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nsearch = dict()\r\nsum = 0\r\nfor b in a:\r\n sum += b\r\n if not sum in search:\r\n search[sum] = 1\r\n else:\r\n search[sum] += 1\r\nprint(n - max(search.values()))\r\n", "def main():\r\n n = int(input())\r\n amounts = [int(i) for i in input().split()]\r\n cnt = dict()\r\n prefix = 0\r\n for a in amounts:\r\n prefix += a\r\n if prefix in cnt:\r\n cnt[prefix] += 1\r\n else:\r\n cnt[prefix] = 1\r\n ans = 0\r\n for k in cnt:\r\n if ans < cnt[k]:\r\n ans = cnt[k]\r\n print(n - ans)\r\n\r\nmain()\r\n", "from collections import Counter\nfrom itertools import accumulate\nn = int(input())\nprint(n - Counter(accumulate(map(int, input().split()), lambda x, y: x+y)).most_common(1)[0][1])\n", "n=int(input())\r\na=list(map(int,input().split()))\r\npresum, s = {}, 0\r\nfor x in a:\r\n s+=x\r\n if s in presum:\r\n presum[s]+=1\r\n else:\r\n presum[s]=1\r\nprint(n-max(presum.values()))\r\n", "n = int(input())\r\n\r\narr = input().split()\r\narr = [int(i) for i in arr]\r\n\r\ndi = {}\r\ns=0\r\nm=0\r\nfor i in arr:\r\n s=s+i\r\n if(s in di.keys()):\r\n di[s]+=1\r\n if(di[s]>m):\r\n m=di[s]\r\n else:\r\n di[s]=1\r\n if(di[s]>m):\r\n m=di[s]\r\n\r\nans = n-m\r\nprint(ans)", "import sys\nimport math\ninput = sys.stdin.readline\nn = int(input())\na = [0] + [int(_) for _ in input().split()]\ndp = [0] * (n + 1)\nlast = dict()\ntotal, ans, last[0] = 0, 0, 0\nfor i in range(1, n + 1):\n total += a[i]\n if last.get(total, -1) == -1:\n dp[i] = 0\n else:\n dp[i] = 1 + dp[last[total]]\n last[total] = i\n if i == n:\n ans = max(ans, dp[i])\n else:\n ans = max(ans, dp[i] + 1)\nprint(n - ans)\n", "n=int(input())\nL=[int(x) for x in input().split()]\na=0\nd={}\nfor i in L:\n a+=i\n if a not in d:\n d[a]=0\n d[a]+=1\nprint(n-max(d.values()))\n\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nd = dict()\r\ntotal = 0\r\nfor i in range(n):\r\n\ttotal += a[i]\r\n\td[total] = 0\r\n\r\ntotal = 0\r\nans = 0\r\nfor i in range(n):\r\n\ttotal += a[i]\r\n\td[total] += 1\r\n\tans = max(ans, d[total])\r\n\r\nprint(n - 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] = a[i] + p[i - 1]\r\np.sort()\r\np.append(float('inf'))\r\nans = 0\r\ni = 0\r\nwhile i < n:\r\n j = i\r\n while p[j] == p[i]:\r\n j += 1\r\n ans = max(ans, j - i)\r\n i = j\r\nprint(n - ans)# 1691240835.7281392", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dd\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=dd(int)\r\nsa=0\r\nans=10*9\r\nfor i in range(n):\r\n sa+=a[i]\r\n d[sa]+=1\r\n ans=min(ans,n-d[sa])\r\nprint(ans)", "from collections import \r\nfrom itertools import \r\nprint(int(input())-max(Counter(accumulate(map(int,input().split()))).values()))", "from sys import stdin\ninput = stdin.buffer.readline\nn = int(input())\n\nlst = list(map(int, input().split()))\n\nif n <= 1:\n print(0)\n exit()\n\n\nfor i in range(1, n):\n lst[i] += lst[i-1]\n\nfrom collections import Counter\ncnter = Counter(lst)\nt = cnter.most_common(1)\n# print(t)\nprint(n- t[0][1])\n\n\t\t\t\t \t\t \t \t\t\t\t \t \t\t \t \t \t \t\t", "n = int(input(\"\"))\r\nl = input(\"\").split(\" \")\r\nfor i in range(len(l)):\r\n l[i] = int(l[i])\r\n\r\ns = 0\r\nm = 0\r\nps = {}\r\nfor i in range(len(l)):\r\n s += l[i]\r\n if (s in ps):\r\n ps[s] += 1\r\n else:\r\n ps[s] = 1\r\n if (ps[s] > m):\r\n m = ps[s]\r\n\r\nprint((n-m))\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\nsum=0\r\nd=dict()\r\nfor i in range(n):\r\n sum += l[i]\r\n if sum not in d.keys():\r\n d[sum] = 1\r\n else:\r\n d[sum]+=1\r\nprint(n-max(d.values()))", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = [a[0]]\r\nfor i in range(1, n):\r\n s.append(s[i - 1] + a[i])\r\nd = {}\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\nprint(n - max(d.values()))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nd,s={},0\r\nfor i in range(n):\r\n s+=a[i]\r\n if s not in d:d[s]=0\r\n d[s]+=1\r\nprint(n-max(d.values()))", "def main():\n from itertools import accumulate\n from collections import Counter\n print(int(input()) - Counter(accumulate(map(int, input().split()))).most_common()[0][1])\n\n\nif __name__ == '__main__':\n main()\n", "from collections import Counter\r\n\r\nn = int(input())\r\nc = Counter();\r\n\r\nnum = list(map(int,input().split()));\r\n\r\nfor i in range(1,n) :\r\n num[i] += num[i-1];\r\nc.update(num);\r\nprint(n - c.most_common()[0][1])", "n = int(input())\r\na = list(map(int,input().split()))\r\nif a == [0]n:\r\n print(0)\r\n exit(0)\r\ndp1 = [0](n)\r\ndp1[0] = a[0]\r\nfor i in range(1,n):\r\n dp1[i] = dp1[i-1] + a[i]\r\nres = 0\r\ncounter = {}\r\nfor i in range(n):\r\n try:\r\n counter[dp1[i]] += 1\r\n except:\r\n counter[dp1[i]] = 1\r\nfor elem in counter:\r\n res = max(res, counter[elem])\r\nprint(n-res)\r\n ", "from collections import Counter\r\n\r\nc = Counter()\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(1, n):\r\n a[i] += a[i-1]\r\nc.update(a)\r\n\r\nprint(n - c.most_common()[0][1])\r\n", "from collections import defaultdict\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncnt = defaultdict(lambda : 0)\r\nma = 0\r\nu = 0\r\nfor i in a:\r\n u += i\r\n cnt[u] += 1\r\n ma = max(ma, cnt[u])\r\nans = n - ma\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nsums = [0] (n + 1)\r\nfor i in range(n):\r\n sums[i + 1] = sums[i] + a[i]\r\n\r\noccs = {}\r\nfor i in range(1, n + 1):\r\n if sums[i] in occs:\r\n last = occs[sums[i]][-1]\r\n if last[1] == i:\r\n last[1] = i + 1\r\n else:\r\n occs[sums[i]].append([i, i + 1])\r\n else:\r\n occs[sums[i]] = [[i, i + 1]]\r\n\r\nans = n - 1\r\nfor k in occs:\r\n cur = 0\r\n for i in range(len(occs[k])):\r\n elem = occs[k][i]\r\n next = occs[k][(i + 1) % len(occs[k])]\r\n if next[0] >= elem[1]:\r\n cur += next[0] - elem[1]\r\n else:\r\n cur += next[0] + n - elem[1]\r\n\r\n ans = min(ans, cur)\r\n\r\nprint(ans)\r\n", "n = int(input())\r\na = map(int,input().split())\r\nsearch =dict()\r\nsum=0\r\nfor b in a:\r\n sum+=b\r\n if not sum in search:\r\n search[sum] = 1\r\n else:\r\n search[sum] +=1\r\nprint(n-max(search.values()))\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nans = n-1\r\nsm = 0\r\nfreq = {}\r\nfor i in arr:\r\n sm += i\r\n freq[sm] = freq.get(sm,0)+1\r\n ans = min(ans,n-freq[sm])\r\nprint(ans)", "n = int(input())\nb = list(map(int, input().split()))\n\nfrom collections import Counter\nfrom itertools import accumulate\ncum = list(accumulate(b))\ncnt = Counter(cum)\nprint (n - cnt.most_common(1)[0][1])\n", "import sys\nsys.stderr = sys.stdout\n\n\ndef money(n, A):\n S = [0]\n s = 0\n for a in A:\n s += a\n S.append(s)\n S.pop()\n\n N = [None] * n\n D = {s: i for (i, s) in enumerate(S)}\n for i, s in enumerate(S):\n j = D[s]\n N[j] = i\n D[s] = i\n\n m = n-1\n C = [False] * n\n for i in range(n):\n if C[i]:\n continue\n C[i] = True\n c = 1\n j = N[i]\n while j != i:\n C[j] = True\n c += 1\n j = N[j]\n m = min(m, n - c)\n return m\n\n\ndef main():\n n = readint()\n A = readintl()\n print(money(n, A))\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", "from collections import \r\nn = int(input())\r\na = list(map(int,input().split()))\r\npre = [0 for i in range(n)]\r\npre[0] = a[0]\r\nfor i in range(1,n):\r\n\tpre[i] = pre[i-1]+a[i]\r\nc = Counter(pre)\r\nm = max(c.values())\r\nprint(n-m)\r\n" ]	{"inputs": ["3\n5 0 -5", "4\n-1 0 1 0", "4\n1 2 3 -6", "1\n0", "50\n108431864 128274949 -554057370 -384620666 -202862975 -803855410 -482167063 -55139054 -215901009 0 0 0 0 0 94325701 730397219 358214459 -673647271 -131397668 -377892440 0 0 0 0 0 -487994257 -360271553 639988328 489338210 -281060728 250208758 0 993242346 -213071841 -59752620 -864351041 -114363541 506279952 999648597 -173503559 -144629749 -559693009 0 -46793577 511999017 -343503822 -741715911 647437511 821346413 993112810", "6\n1 -1 1 -1 1 -1"], "outputs": ["1", "2", "3", "0", "36", "3"]}	UNKNOWN	PYTHON3	CODEFORCES	28
90c94d1f5e83e4c8b0d3186dacb5a837	Good Number	Let's call a number k-good if it contains all digits not exceeding k (0,<=...,<=k). You've got a number k and an array a containing n numbers. Find out how many k-good numbers are in a (count each number every time it occurs in array a). The first line contains integers n and k (1<=≤<=n<=≤<=100, 0<=≤<=k<=≤<=9). The i-th of the following n lines contains integer ai without leading zeroes (1<=≤<=ai<=≤<=109). Print a single integer — the number of k-good numbers in a. Sample Input 10 6 1234560 1234560 1234560 1234560 1234560 1234560 1234560 1234560 1234560 1234560 2 1 1 10 Sample Output 10 1	[ "n,m=map(int,input().split())\r\nc=0\r\nfor _ in range(n):\r\n a= input()\r\n if all(list(map(lambda x: str(x) in a , range(m+1)))):\r\n c+=1\r\n else:\r\n continue\r\nprint(c)", "a,b = map(int,input().split())\r\nc = 0\r\nfor i in range(a):\r\n s=0\r\n x=input()\r\n for i in range(b+1):\r\n if str(i) in x:\r\n s+=1\r\n if s==b+1:\r\n c+=1\r\nprint(c)", "n,k = map(int , input().split())\r\n\r\nl_comp = [x for x in range(k+1)]\r\nans = 0\r\n\r\n\r\nfor i in range (n):\r\n new_l = sorted([int(x) for x in list(input())])\r\n if set(l_comp).issubset(set(new_l)):\r\n ans+=1\r\n \r\nprint(ans)", "n, k = map(int,input().split())\r\nr = 0\r\nfor i in range(n):\r\n a = input()\r\n for j in range(k+1):\r\n if str(j) in a:\r\n b = 1\r\n else:\r\n b = 0\r\n break\r\n if b == 1:\r\n r +=1\r\nprint(r) ", "def listGen(k):\r\n l = []\r\n for i in range(k+1):\r\n l.append(str(i))\r\n return l\r\n\r\narr = list(map(int,input().split()))\r\nn = arr[0]\r\nk = arr[1]\r\ncount = 0\r\nx = listGen(k)\r\nfor i in range(n):\r\n arr1 = list(input())\r\n isGood = True\r\n for y in x:\r\n if y not in arr1:\r\n isGood = False\r\n break\r\n if isGood:\r\n count+=1\r\n \r\nprint(count)", "test_cases, k = map(int, input().split())\r\ncounter = 0\r\nfor _ in range(test_cases):\r\n num = input()\r\n flag = True\r\n for i in range(k+1):\r\n if str(i) not in num:\r\n flag = False\r\n break\r\n if flag: counter += 1\r\nprint(counter)", "t,n=map(int,input().split())\r\n\r\ngood_no = 0\r\nfor i in range(t) :\r\n count=0\r\n b = []\r\n a = input()\r\n for i in range(len(a)) :\r\n for k in range(0,n+1,1) :\r\n if int(a[i]) == k and a[i] not in b :\r\n count += 1\r\n b.append(a[i])\r\n \r\n if count >= n+1 :\r\n good_no += 1\r\nprint(good_no) \r\n \r\n ", "a,b=map(int,input().split())\r\nb=list(map(str,range(b+1)))\r\nn=len(b)\r\nv=0\r\nfor i in range(a):\r\n g=set(input())\r\n if sorted(g)[:n]==b:\r\n v+=1\r\nprint(v)\r\n ", "a, b = map(int, input().split())\r\nc = 0\r\nfor i in range(a):\r\n d = 0\r\n l = list(map(int, input()))\r\n for j in range(b+1):\r\n if j in l:\r\n d += 1\r\n if d == b + 1:\r\n c += 1\r\nprint(c)", "#This was submitted to codeforces.com\r\nn,k=map(int,input().split())\r\ngood=0\r\ns=list(range(0,k+1))\r\nfor i in range(n):\r\n lst=list(map(int,input()))\r\n nums=[]\r\n tem=list(sorted(list(set(lst)))) #Removing repeating occurences, and sorting\r\n if k!=0:\r\n nums=tem[0:len(s)]\r\n else:\r\n if s[0] in lst:\r\n if lst[0]!=0:\r\n good+=1\r\n continue\r\n elif lst[0]==0 and lst.count(0)>1:\r\n good+=1\r\n continue\r\n else:\r\n continue\r\n if s==nums:\r\n good+=1\r\nprint(good)", "cnt=0\r\nn,k=map(int,input().split())\r\nl=[i for i in range(k+1)]\r\nfor i in range(n):\r\n a=input()\r\n if all(str(j) in a for j in l):\r\n cnt+=1\r\nprint(cnt)", "n, k = map(int, input().split())\r\ncnt = 0\r\nfor _ in range(n):\r\n num = list(map(int, list(input())))\r\n num.sort()\r\n for i in range(k + 1):\r\n if i not in num:\r\n break\r\n else:\r\n cnt += 1\r\nprint(cnt)", "n, k = map(int, input().split())\r\na = 0\r\nfor i in range(n):\r\n n = input()\r\n g = 1\r\n for j in range(k+1):\r\n if str(j) not in n:\r\n g = 0\r\n break\r\n if g != 0:\r\n a += 1\r\nprint(a)", "a, b = map(int, input().split())\r\n\r\nf = [i for i in range(b+1)]\r\n\r\ncont = True\r\ncount = 0\r\nfor i in range(a):\r\n s = input()\r\n for j in f:\r\n if str(j) not in s:\r\n cont = False\r\n if cont == True:\r\n count = count + 1 \r\n cont = True\r\nprint(count)", "n,k = map(int,input().split())\ncount = 0\nrng = [chr(ord('0') + x) for x in range(k+1) ]\nrng = set(rng)\nfor _ in range(n):\n s = set(input())\n if rng.issubset(s):\n count+=1\nprint(count)\n ", "n,k = map(int,input().split())\r\nc = n\r\nfor i in range (n) :\r\n a = input()\r\n for i in range (k+1) :\r\n if str(i) not in a :\r\n c -= 1\r\n break\r\nprint(c)\r\n", "ret= -1\r\nss=\"0123456789\"\r\nn,k=map(int, input().split())\r\nvar1=0\r\nvar2=0\r\nwhile n:\r\n s=input()\r\n for i in range(0,k+1):\r\n ret=s.find(ss[i])\r\n if ret!=-1:\r\n var1+=1\r\n ret=-1\r\n if var1>=k+1:\r\n var2+=1\r\n var1=0\r\n n-=1\r\nprint(var2)", "n, k = map(int, input().split())\n\ncheck_list = [str(k) for k in range(k + 1)]\n\nfor i in range(n):\n\n ui = input()\n\n for j in range(len(check_list)):\n if check_list[j] not in ui:\n n = n - 1\n break\nprint(n)\n", "n,k=map(int,input().split())\r\na=[]\r\nb=[]\r\nc=0\r\nfor i in range(n):\r\n d=input()\r\n a.append(d)\r\nfor i in range(k+1):\r\n b.append(str(i))\r\nfor i in a:\r\n m=0\r\n for j in range(len(b)):\r\n if b[j] not in i:\r\n m=1\r\n if m!=1:\r\n c+=1\r\nprint(c)", "def fun(arr, min, k):\r\n if min > k:\r\n return 1\r\n if min <= k and min in arr:\r\n return fun(arr, min + 1, k)\r\n else:\r\n return 0\r\n\r\n\r\ndata = list(map(int, input().split()))\r\nnum_count = 0\r\nfor i in range(data[0]):\r\n arr = list(map(int, input()))\r\n if len(arr) > data[1]:\r\n if data[1] in arr:\r\n if fun(arr, 0, data[1]):\r\n num_count += 1\r\n\r\n\r\nprint(num_count)", "n, k = map(int,input().split())\r\nval = 0\r\nfor x in range(n):\r\n a = input()\r\n count = 0\r\n for x in range(k+1):\r\n if str(x) in a:\r\n count += 1\r\n if count == k+1:\r\n val += 1\r\nprint(val)", "\nn, k = map(int, input().split())\n\nres = 0\n\nfor _ in range(n):\n a, digits = input(), set()\n for d in a:\n if 0 <= int(d) <= k:\n digits.add(d)\n res += len(digits) == k + 1\n\nprint(res)\n", "n, k = map(int, input().split())\r\n\r\nt = [str(i) for i in range(k+1)]\r\n\r\ndef checa(s):\r\n for j in t:\r\n if not j in s:\r\n return False\r\n\r\n return True\r\n\r\ncont = 0\r\nfor i in range(n):\r\n s = str(input())\r\n \r\n if checa(s):\r\n cont += 1\r\n\r\nprint(cont)\r\n", "t= -1\r\nss=\"0123456789\"\r\np,q=map(int, input().split())\r\ncount1=0\r\ncount2=0\r\nwhile p:\r\n s=input()\r\n for i in range(0,q+1):\r\n t=s.find(ss[i])\r\n if t!=-1:\r\n count1+=1\r\n t=-1\r\n if count1>=q+1:\r\n count2+=1\r\n count1=0\r\n p-=1\r\nprint(count2)", "n, k = map(int, input().split())\r\nans = 0\r\nfor i in range(n):\r\n num = input()\r\n good = 1\r\n for j in range(k+1):\r\n if str(j) not in num:\r\n good = 0\r\n break\r\n if good != 0:\r\n ans += 1\r\nprint(ans)", "n,k=list(map(int,input().split()))\r\narr=[]\r\nsumm=0\r\nfor i in range(n):\r\n arr.append(list(map(int,input())))\r\n \r\nfor i in arr:\r\n l=[]\r\n for j in i :\r\n if j>k:\r\n continue\r\n if j not in l:\r\n l.append(j)\r\n if len(l)!=k+1:\r\n continue\r\n if sum(l)==(k(k+1))/2:\r\n summ+=1\r\nprint(summ)\r\n \r\n ", "import sys\r\nfrom math import gcd\r\ndef inp() : return sys.stdin.readline().strip()\r\ndef get_ints(): return map(int, inp().split())\r\ndef get_arr(): return list(map(int, inp().split()))\r\ndef get_int(): return int(inp())\r\nn,k=get_ints()\r\ncount=0\r\nfor _ in range(n):\r\n s=inp()\r\n val=0\r\n for i in range(k+1):\r\n if(s.find(str(i))!=-1):\r\n val+=1\r\n if(val==k+1): count+=1\r\nprint(count)", "n,m=map(int,input().split())\r\nc=0\r\nlist1=list(range(0,m+1))\r\nl=len(list1)\r\nfor i in range(n):\r\n list2=list(map(int,input()))\r\n num=[]\r\n temp2=list(sorted(list(set(list2))))\r\n if m!=0:\r\n num=temp2[0:l]\r\n else:\r\n if list1[0] in list2:\r\n c+=1\r\n continue\r\n elif list2[0]==0 and list2.count(0)>1:\r\n c+=1\r\n continue\r\n else:\r\n continue\r\n if list1==num:\r\n c+=1\r\nprint(c)\r\n", "n,k=map(int, input().split())\r\ncnt = 0\r\nfor i in range(n):\r\n a = list(map(int, input()))\r\n for j in range(k+1):\r\n if j not in a:\r\n break\r\n else:\r\n cnt += 1\r\nprint(cnt)\r\n", "n, k = map(int, input().split())\r\ncount = 0\r\nlst, lst2 = [], []\r\nfor i in range(n):\r\n num = list(map(int, input()))\r\n for n in range(len(num)):\r\n lst.append(num[n])\r\n lst.sort()\r\n\r\n for m in lst:\r\n if m not in lst2:\r\n lst2.append(m)\r\n lst2.sort()\r\n\r\n for index in range(len(lst2)):\r\n if index == lst2[index]:\r\n if index == k:\r\n count += 1\r\n lst.clear()\r\n lst2.clear()\r\nprint(count)\r\n\r\n", "n,k=map(int,input().split())\r\ncn=0\r\nfor i in range(0,n):\r\n c=0\r\n n=0\r\n l=input()\r\n for j in range(0,k+1):\r\n if(l.count(str(j))>0):\r\n c+=1\r\n #for j in range(k+1,10):\r\n # if(l.count(str(j))>0):\r\n # n=1\r\n if(c==k+1):# and n!=1):\r\n cn+=1\r\nprint(cn)", "x,y=map(int,input().split())\r\nc=0\r\nn=0\r\nfor i in range(x):\r\n temp=input()\r\n for j in range(0,y+1):\r\n if str(j) not in temp:\r\n n=0\r\n break\r\n else:\r\n n=1\r\n if n==1:\r\n c+=1\r\nprint(c)\r\n\r\n", "n, k = list(map(int, input().split()))\r\ncounter = 0\r\n\r\nfor i in range(n):\r\n cur = -1\r\n q = input()\r\n li = []\r\n for i in q:\r\n li.append(int(i))\r\n for i in range(k+1):\r\n if i in li:\r\n continue\r\n else:\r\n cur = i\r\n if cur == -1:\r\n cur = k + 1\r\n if cur > k:\r\n counter += 1\r\nprint(counter)\r\n\r\n \r\n \r\n", "n,k=map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n b = input()\r\n a.append(b)\r\nc = ''\r\nfor i in range(k+1):\r\n c+=str(i)\r\nd = 0\r\nfor i in a:\r\n e = 1\r\n for j in c:\r\n if j in i:\r\n pass\r\n else:\r\n e = 0\r\n d += e\r\nprint(d)\r\n \r\n\r\n", "import sys\r\n\r\n\r\ndef main():\r\n n,k = map(int, sys.stdin.readline().split(' '))\r\n \r\n c = \"\"\r\n for i in range(1, k+1):\r\n c+=str(i)\r\n \r\n c+='0'\r\n fans = 0\r\n for i in range(n):\r\n s = sys.stdin.readline().strip()\r\n ans = 0\r\n for j in c:\r\n for k in s:\r\n if j == k:\r\n ans+=1\r\n break\r\n \r\n if len(c) == ans:\r\n fans+=1\r\n \r\n sys.stdout.write(str(fans))\r\n\r\nif __name__ == '__main__':\r\n main()", "n,k=map(int,input().split())\r\ncrime=n\r\nk_str =\"\"\r\nfor i in range(k+1): # this will create a string of second input\r\n#e.g. if k = 6 b will have 0123456\r\n k_str = k_str+str(i)\r\n#print(k_str)\r\nfor i in range(n):\r\n tc=input()\r\n for j in k_str:\r\n if j not in tc:\r\n crime -= 1\r\n break\r\nprint(crime)", "n,k=map(int, input().split())\r\nc=0\r\nfor i in range(n):\r\n a = list(map(int, input()))\r\n for j in range(k+1):\r\n if j not in a:\r\n break\r\n else:\r\n c=c+1\r\nprint(c)", "# -- coding: utf-8 --\n\"\"\"Good_Number.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/18jTOH64bSl-p-HkdGDBd-wO1nWRsBVGD\n\"\"\"\n\nn,k=map(int,input().split())\ns = set('0123456789'[:k+1])\nprint(sum(set(input()) >= s for _ in range(n)))", "n, k = map(int, input().split())\r\np = 0\r\nfor i in range(n):\r\n s = 0\r\n h = input()\r\n l = len(h)\r\n for j in range(k+1):\r\n if str(j) in h :\r\n s+=1\r\n if s == k+1 :\r\n p += 1\r\nprint(p)", "max, n = [int(x) for x in input().split()]\r\nans = 0\r\n\r\nfor i in range(max):\r\n s = input()\r\n for i in range(n+1):\r\n if str(i) in s:\r\n flag = 1\r\n else:\r\n flag = 0\r\n break\r\n\r\n if flag == 1:\r\n ans += 1\r\n \r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\nnb=0\r\nfor i in range(n):\r\n x=int(input())\r\n l=[int(y) for y in str(x)]\r\n for j in range(k+1):\r\n t=1\r\n if j not in l:\r\n t=0\r\n break\r\n if t==1:\r\n nb+=1 \r\nprint(nb)", "def main(counter=0):\r\n x, z = map(int, input().split())\r\n values = [str(input()) for _ in range(x)]\r\n keys = [str(i) for i in range(0, z+1)]\r\n for value in values:\r\n if all([(i in value) for i in keys]):\r\n counter += 1\r\n\r\n return print(counter)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# 10 6\r\ndef searchN(txt,y):\r\n for x in range(y + 1) :\r\n if(txt.find(str(x)) == -1) :\r\n return False\r\n return True\r\nx, y = map(int, input().split())\r\nsum = 0\r\nfor z in range(x) :\r\n number = input()\r\n if(searchN(number,y)):\r\n sum += 1\r\nprint(sum)\r\n", "x, y= map(int, input().split())\r\na = 0\r\nfor i in range(x):\r\n b = 0\r\n l = list(map(int, input()))\r\n for j in range(y+1):\r\n if j in l:\r\n b += 1\r\n if b == y + 1:\r\n a += 1\r\nprint(a)", "n,m = map(int,input().split())\r\ncount = n\r\nfor i in range(n):\r\n a = input()\r\n for i in range (m+1) :\r\n if str(i) not in a :\r\n count-=1\r\n break\r\nprint(count)", "n, k = list(map(int, input().split()))\r\nc = 0\r\ns = set(map(str, range(k + 1)))\r\nfor i in range(n):\r\n x = set(input())\r\n if s.issubset(x):\r\n c += 1\r\nprint(c)", "n,k = map(int, input().split())\n\ngoodNumber = 0\n\nintegers = [0,1,2,3,4,5,6,7,8,9]\n\nfor i in range(n):\n if len(set([i for i in list(map(int,input())) if i in integers[:k+1]])) == k+1:\n goodNumber += 1\n\nprint(goodNumber)\n", "m , k = map(int,input().split())\r\nvalid = [str(i) for i in range(0,k+1)]\r\ncount1 = 0\r\nfor _ in range(m):\r\n count2 = 0\r\n a = input()\r\n b = [i for i in a]\r\n for i in valid:\r\n if i in b:\r\n count2 += 1\r\n if len(valid) == count2:\r\n count1 +=1\r\nprint(count1)", "n, t = map(int, input().split())\r\nk = 0\r\nfor i in range(n):\r\n s = input()\r\n for j in range(t + 1):\r\n if str(j) not in s:\r\n break\r\n else:\r\n k += 1\r\nprint(k)\r\n", "l=input().split()\r\nlst=list(l)\r\nn=int(lst[1])\r\nx=int(lst[0])\r\nc=0\r\nfor i in range (x):\r\n y=0\r\n a=input()\r\n for i in range (n+1):\r\n if str(i) in a:\r\n y=y+1\r\n if y==n+1: \r\n c=c+1\r\nprint(c) ", "s=[0,0]\r\ns[0],s[1]=map(int,input().split())\r\nn=0\r\nfor i in range(s[0]):\r\n k=0\r\n a=input()\r\n for i in range(s[1]+1):\r\n if str(i) in a:\r\n k=k+1\r\n if k==s[1]+1:\r\n n=n+1\r\nprint(n)", "#all those moments will be lost in time , like tears in rain\r\nn, k = map(int, input().split())\r\nans = 0\r\nfor i in range(n):\r\n s = input()\r\n for j in range(0, k+1):\r\n if str(j) not in s:\r\n break\r\n else:\r\n ans += 1\r\n \r\nprint(ans)", "n1 = input().split()\r\nn = int(n1[0])\r\nk = int(n1[1])\r\ni = 0\r\nc2 =0\r\nwhile i < n:\r\n num = input()\r\n c1 = 0\r\n for j in range(0,k+1):\r\n if str(j) in (num):\r\n c1 += 1\r\n if c1 == k+1:\r\n c2 += 1\r\n break\r\n i += 1\r\nprint(c2)", "n, k = map(int, input().split()); cnt = 0\r\nfor d in range(n):\r\n f = input()\r\n s = [f.find(str(i)) != -1 for i in range(k + 1)]\r\n if 0 not in s: cnt += 1\r\nprint(cnt)\r\n\r\n\r\n", "#Good number\r\n\r\nn,k=map(int,input().split())\r\ncount=n\r\nb =\"\"\r\nfor i in range(k+1): # this will create a string of second input\r\n#e.g. if k = 6 b will have 0123456\r\n b = b+str(i)\r\n#print(b)\r\nfor i in range(n):\r\n nn=input()\r\n for j in b:\r\n if j not in nn:\r\n count =count - 1\r\n break\r\nprint(count)", "n,k=map(int,input().split())\r\ncount=0\r\nfor i in range(n):\r\n condition=True\r\n a=input()\r\n for j in range(k+1):\r\n if str(j) not in a:\r\n condition=False\r\n if condition:\r\n count+=1\r\nprint(count)", "n, k = map(int,input().split())\r\n\r\nkey = \"\"\r\nfor num in range(0,k+1):\r\n key += str(num)\r\n\r\nans = 0\r\nfor _ in range(n):\r\n line = input()\r\n goodNumber = True\r\n for letter in key:\r\n if letter not in line:\r\n goodNumber = False \r\n \r\n if(goodNumber):\r\n ans += 1\r\n\r\n\r\nprint(ans)", "n,k=map(int,input().split())\r\ncount=n\r\nk_str =\"\"\r\nfor i in range(k+1): # this will create a string of second input\r\n#e.g. if k = 6 b will have 0123456\r\n k_str = k_str+str(i)\r\n#print(k_str)\r\nfor i in range(n):\r\n tc=input()\r\n for j in k_str:\r\n if j not in tc:\r\n count =count - 1\r\n break\r\nprint(count)", "n, k = input().split()\r\nn, k = int(n), int(k)\r\ntotal = 0\r\nfor i in range(n):\r\n a = input()\r\n for i in range(0, k + 1):\r\n if str(i) not in a:\r\n break\r\n if i == k:\r\n total += 1\r\n\r\n\r\n\r\nprint(total)", "n,k=map(int,input().split())\r\ncount=n\r\nk_str=\"\"\r\nfor i in range(k+1):\r\n k_str=k_str+str(i)\r\nfor i in range(n):\r\n nn=input()\r\n for j in k_str:\r\n if j not in nn:\r\n count= count-1\r\n break\r\nprint(count)", "n,k=input().split()\r\ncnt=0\r\nn=int(n)\r\nk=(int)(k)\r\nwhile((int)(n)>0):\r\n n-=1\r\n x=input()\r\n flag=True;\r\n for i in range(0,k+1):\r\n if(x.find((str)(i))==-1): flag=False;\r\n else: continue\r\n\r\n if flag: cnt+=1;\r\nprint(cnt)", "n,k=list(map(int,input().split()))\r\nc=0\r\nl=[j for j in range(0,k+1)]\r\nfor i in range(n):\r\n d=1\r\n a=int(input())\r\n a=str(a)\r\n for x in l:\r\n if str(x) not in a:\r\n d=0\r\n break\r\n if d==1:\r\n c=c+1\r\nprint(c)\r\n", "n,k=list(map(int,input().split()))\r\nlist1=list(range(k+1))\r\na=list1.pop(0)\r\nlist1.append(a)\r\ns=\"\"\r\ncount=0\r\nfor x in list1:\r\n s+=str(x)\r\na=0\r\nfor x in range(n):\r\n s1=input()\r\n for x in s:\r\n if x not in s1:\r\n break\r\n else:\r\n count+=1\r\nprint(count)\r\n", "s=list(map(int,input().split()))\r\nn=0\r\nv=[]\r\nx=0\r\nz=0\r\nfor i in range(s[1]+1):\r\n v+=[str(i)]\r\n n+=1\r\nfor i in range(s[0]):\r\n x=0\r\n b=input()\r\n c=set(sorted(b))\r\n u=c.copy()\r\n for k in u :\r\n if k in v:\r\n x+=1\r\n if x == n :\r\n z+=1\r\nprint(z)\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\nk_digits = set(str(i) for i in range(k + 1))\r\n\r\ncount = 0\r\nfor i in range(n):\r\n digits = set(input().strip())\r\n if k_digits.issubset(digits):\r\n count += 1\r\n\r\nprint(count)", "n, k = list(map(int, input().split()))\r\nc = 0\r\n\r\nfor i in range(n):\r\n yes = 0\r\n come = input()\r\n for i in range(k + 1):\r\n if str(i) in come:\r\n yes += 1\r\n if yes == k + 1:\r\n c += 1\r\nprint(c)\r\n", "n, k = map(int, input().split())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n num = input().strip()\r\n if all(str(digit) in num for digit in range(k+1)):\r\n count += 1\r\n\r\nprint(count)", "a,b=map(int,input().split())\nc=0\nfor i in range(a):\n lst=input()\n my_list=[]\n for ele in lst:\n if ele not in my_list and int(ele)<=b:\n my_list.append(ele)\n if len(my_list)==b+1:\n c+=1\nprint(c)\n\t\t\t\t \t\t \t\t \t\t \t\t \t \t \t\t\t\t\t", "# Define a function that checks if a number is k-good\r\ndef is_k_good(n, k):\r\n # Convert the number to a string\r\n s = str(n)\r\n # Loop through all digits from 0 to k\r\n for d in range(k + 1):\r\n # If the digit is not in the string, return False\r\n if str(d) not in s:\r\n return False\r\n # If all digits are in the string, return True\r\n return True\r\n\r\n# Read n and k from input\r\nn, k = map(int, input().split())\r\n# Initialize a counter for k-good numbers\r\ncount = 0\r\n# Loop through n numbers in the array\r\nfor i in range(n):\r\n # Read a number from input\r\n a = int(input())\r\n # If it is k-good, increment the counter\r\n if is_k_good(a, k):\r\n count += 1\r\n\r\n# Print the final answer\r\nprint(count)", "#one day im gonna in sha allah\r\n\r\ndef main():\r\n\r\n n, k = input().split()\r\n n = int(n)\r\n k = int(k)\r\n li = list()\r\n counter = n\r\n\r\n for i in range(k+1):\r\n li.append(i)\r\n\r\n for i in range(n):\r\n \r\n inp = input()\r\n \r\n for j in range(len(li)):\r\n if(not(inp.__contains__(str(li[j])))):\r\n counter -= 1\r\n break\r\n \r\n print(counter)\r\n \r\nif __name__ == \"__main__\":\r\n main()", "a,b=map(int,input().split())\r\ns=0\r\nfor i in range(a):\r\n count=0\r\n x=input()\r\n for i in range(b+1):\r\n if str(i) in x:\r\n count+=1\r\n if count==b+1:\r\n s+=1\r\nprint(s) ", "n,k=map(int,input().split())\r\na=[]\r\ncount=0\r\nfor i in range(k+1):\r\n a.append(str(i))\r\nfor i in range(n):\r\n y=input()\r\n for i in a:\r\n if i not in y:\r\n count-=1\r\n break\r\nprint(n+count)", "n, k = map(int, input().split())\r\ngood_nums = set(range(k+1))\r\ncount = 0\r\nfor i in range(n):\r\n num = set(map(int, str(input().strip())))\r\n if good_nums.issubset(num):\r\n count += 1\r\nprint(count)", "n , k = list(map(int , input().split()))\r\ncount = 0\r\nfor el in range(n):\r\n s = str(input())\r\n c = 0 \r\n a = []\r\n for i in s :\r\n if(int(i)<=k):\r\n if(i not in a):\r\n c += 1\r\n a.append(i)\r\n if(c == k + 1):\r\n count += 1\r\n\r\nprint(count)", "# -- coding: utf-8 --\n\"\"\"365_A_binuVijayan_OK.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1pBS17NLp-V59ahdNyO_d2EelcnMOWDPj\n\"\"\"\n\n#https://codeforces.com/problemset/problem/365/A (A Good number)\nn,s=map(int,input().split())\nu=0 \nfor i in range(n):\n c=0\n a=input()\n for i in range(s+1):\n if str(i) in a:\n c=c+1\n if c==s+1:\n u=u+1\nprint(u)", "n, k = map(int, input().split())\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n a = set(input())\r\n len_present = len([x for x in range(k + 1) if str(x) in a])\r\n count += 1 if len_present == k + 1 else 0\r\n\r\nprint(count)", "# This is a sample Python script.\r\n\r\n# Press Shift+F10 to execute it or replace it with your code.\r\n# Press Double Shift to search everywhere for classes, files, tool windows, actions, and settings.\r\n\r\nx, y = map(int, input().split())\r\nw=0\r\nre=0\r\nf=-1\r\nss=\"0123456789\"\r\nfor i in range(1,x+1):\r\n s= ( input())\r\n #s.sort()\r\n #l=len(s)\r\n\r\n w=0\r\n\r\n for j in range(0,y+1):\r\n f=s.find(ss[j])\r\n if f!=-1:\r\n \r\n w+=1\r\n f=-1\r\n if w>=y+1 :\r\n re+=1\r\n\r\nprint(re)", "n=input()\r\nl=list(map(int,n.split()))\r\nm=l[0]\r\nk=l[1]\r\nl2=[]\r\nl3=[]\r\nl4=[]\r\nsum=0\r\nfor i in range(k+1):\r\n l3.append(str(i))\r\nz=[]\r\nfor item in l3:\r\n z.append(item)\r\nfor i in range(m):\r\n j=int(input())\r\n u=str(j)\r\n\r\n for ch in u:\r\n l2.append(ch)\r\n for item in l3:\r\n if(item in l2):\r\n sum=sum+1\r\n\r\n if(sum==len(l3)):\r\n l4.append(j)\r\n\r\n l2.clear()\r\n l3.clear()\r\n for ij in z:\r\n l3.append(ij)\r\n sum=0\r\n\r\n\r\nprint(len(l4))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k = map(int,input().split())\r\ncount = 0\r\nl = []\r\nfor j in range(n):\r\n a = input()\r\n for i in range(k+1):\r\n l.append(a.count(str(i)))\r\n for i in l:\r\n if i>0:\r\n bool = True\r\n else:\r\n bool = False\r\n break\r\n if bool:\r\n count+=1\r\n l = []\r\n bool = False\r\nprint(count)", "n, k = map(int,input().split())\r\ncount = 0\r\nfor i in range(n):\r\n num = input()\r\n for i in range(k+1):\r\n if str(i) not in num:\r\n break\r\n else:\r\n count += 1\r\nprint(count)", "n, k = list(map(int, input().split()))\nc = 0\nmapping = set(map(str, range(k+1)))\n \nfor x in range(n):\n z = set(input())\n if mapping.issubset(z):\n c += 1\nprint(c)", "ans=0\r\nj=0\r\n\r\nn, k = map(int, input().split())\r\ns=''\r\nfor h in range(k+1):\r\n s+= str(h)\r\n\r\nfor x in range(n):\r\n y = str(input())\r\n for i in s:\r\n if str(i) in y:\r\n j+=1\r\n if j==len(s):\r\n ans+=1\r\n j=0\r\n\r\nprint(ans)", "n,k = map(int,input().split())\r\nc = 0\r\nd = 0\r\nfor i in range (n):\r\n a = input()\r\n for b in range (k+1):\r\n if str(b) in a:\r\n c = c + 1\r\n if c == k + 1:\r\n d += 1\r\n c = 0\r\nprint(d)", "s=input().split()\r\nn=int(s[0])\r\nk=int(s[1])\r\nsu=0\r\nfor i in range(n):\r\n l=input()\r\n flag=1\r\n if len(l)<k:\r\n continue \r\n for j in range(0,k+1):\r\n if str(j) not in l:\r\n flag=0\r\n break\r\n if flag:\r\n su+=1\r\n\r\nprint(su)\r\n", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\n\r\nn, k = map(lambda v: int(v), input().split())\r\nans = 0\r\n\r\nfor i in range(n):\r\n a = input()\r\n for d in range(k+1):\r\n if a.find(str(d))==-1: break\r\n else: ans+=1\r\n\r\nprint(ans)", "n,k=map(int,input().split())\r\ncount=0\r\nstart=0\r\nr=[]\r\nfor i in range(k+1):\r\n r+=str(i)\r\nif k==0:\r\n start=1\r\nfor i in range(n):\r\n s=input()\r\n l=r.copy()\r\n for i in range(start,len(s)):\r\n if s[i] in l:\r\n l.remove(s[i])\r\n if l==[]:\r\n count+=1\r\nprint(count)", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nc = 0\r\nfor i in range(n):\r\n w = input()[:-1]\r\n d = 0\r\n for i in range(k+1):\r\n if str(i) in w:\r\n d += 1\r\n if d == k + 1:\r\n c += 1\r\nprint(c)\r\n", "t,k=map(int,input().split())\r\n#t=testcases,k=Good numbers\r\na=''\r\nfor i in range(k+1):\r\n a+=str(i)\r\ncount='c'\r\nc=0\r\nfor _ in range(t):\r\n b=0\r\n n=input()\r\n for i in a:\r\n if i in n:\r\n b+=1\r\n if b==k+1:\r\n c+=1\r\n#print the k-goodnumbers\r\nprint(c)", "n,k=map(int,input().split())\r\np=0\r\nfor i in range(n):\r\n count=0\r\n a=list(map(int,input()))\r\n for i in range(k+1):\r\n if i in a:\r\n count=count+1\r\n if count==k+1:\r\n p=p+1\r\nprint(p)", "n,k=map(int,input().split())\r\ndigits=\"\"\r\nans=0\r\nfor i in range(k+1):\r\n digits+=str(i)\r\nfor i in range(n):\r\n a=int(input())\r\n a=str(a)\r\n c=0\r\n for thing in digits:\r\n if thing in a:\r\n c+=1\r\n if(c<=len(a) and c>=len(digits)):\r\n ans+=1\r\nprint(ans)", "n, k = map(int, input().split())\r\ncount = 0\r\nfor i in range(n):\r\n no = 1\r\n num = input()\r\n for n in range(k + 1):\r\n if num.find(str(n)) == -1: no = 0; break\r\n if no == 1: count += 1\r\nprint(count)\r\n", "line = input().split()\nline = [int(i) for i in line]\n\nn = line[0]\nk = line[1]\n\ncount_good_num = 0\nfor _ in range(n):\n\n num = input()\n if '0' not in num:\n continue\n\n \n num = [int(i) for i in num]\n\n error = True\n for i in range(1,k+1):\n if i in num:\n num.remove(i)\n else:\n error=False\n \n \n if error:\n count_good_num+=1\n\n\nprint(count_good_num)", "a,b=map(int,input().split())\r\nk=0\r\nfor i in range(a):\r\n c=0\r\n x=input()\r\n for i in range(b+1):\r\n if str(i) in x:\r\n c=c+1\r\n if c==b+1:\r\n k=k+1\r\nprint(k)\r\n", "def solve():\r\n cnt=0\r\n for i in range(n):\r\n ok=0\r\n for j in range(len(a[i])):\r\n if a[i][j]<=k:ok+=1\r\n if ok==k+1:cnt+=1\r\n print(cnt)\r\n\r\nif __name__ == '__main__':\r\n n,k=map(int,input().split())\r\n a=[list(set([int(x)for x in input()]))for i in range(n)]\r\n solve()", "n, k = map(int, input().split())\r\ns = set('0123456789'[ : k + 1])\r\nprint(sum(set(input()) >= s for _ in range(n)))", "n,k=map(int,input().split())\r\nx=0\r\nfor i in range(n):\r\n c=0\r\n t=input()\r\n for i in range(k+1):\r\n if str(i) in t:\r\n c=c+1\r\n if c==k+1:\r\n x=x+1\r\nprint(x)\r\n", "#class bebo : \r\n # def __init__(self) :\r\n # print(\"baraa1\")\r\n\r\n#class bebo2 : \r\n # def __init__(self):\r\n # print(\"baraa2\")\r\n\r\n#class bebo3(bebo2,bebo) : \r\n # def __init__(self):\r\n # super().__init__()\r\n\r\n#div = bebo3()\r\n#x,y=input().split()\r\n#x=int(x)\r\n#y=int(y)\r\n#cont=0\r\n#b=True\r\n#for i in range(x):\r\n #c = input()\r\n #for j in range(y+1):\r\n # if c.__contains__(str(j)):\r\n # pass\r\n # else : b=False\r\n # if b:\r\n # cont+=1\r\n # b=True\r\n#print(cont)\r\n\r\nn,k = input().split()\r\nn,k=int(n),int(k)\r\na = []\r\ncont=0\r\nfor i in range(k + 1):\r\n a.append(str(i))\r\na = ''.join(a)\r\nfor i in range(n):\r\n str=input()\r\n for j in range(len(a)):\r\n if str.find(a[j])==-1: \r\n break\r\n if j==len(a)-1:\r\n cont+=1\r\n \r\nprint(cont)\r\n", "n,k=map(int,input().split())\r\ncount=0\r\nl1=[]\r\nl2=[]\r\nfor i in range(n):\r\n a=input()\r\n l1.append(a)\r\nfor i in range(k+1):\r\n l2.append(str(i))\r\nfor i in l1:\r\n m=0\r\n for j in range(len(l2)):\r\n if l2[j] not in i:\r\n m=1\r\n if m!=1:\r\n count+=1\r\nprint(count)", "n,m=map(int,input().split())\r\nd=0\r\nfor i in range(n):\r\n a=input()\r\n c=0\r\n for i in range(m+1):\r\n if str(i) not in a:\r\n c=c+1\r\n if c>0:\r\n d=d+1\r\nprint(n-d)", "temp = [int(x) for x in input().split()]\r\nanswer = 0\r\nfor _ in range(temp[0]):\r\n x = set([int(x) for x in input()])\r\n for i in range(11):\r\n if i in x:\r\n pass\r\n else:\r\n if i > temp[1]:\r\n answer += 1\r\n break\r\nprint(answer)\r\n ", "n,k=map(int, input().split())\r\ncnt=0\r\nfor i in range(n):\r\n x=input()\r\n flag=True\r\n for i in range(k+1):\r\n if(str(i) not in x):\r\n flag=False\r\n if(flag):\r\n cnt+=1\r\nprint(cnt)\r\n", "n,k=map(int,input().split())\r\nc=0\r\ns=list(range(0,k+1))\r\nfor i in range(n): \r\n l=list(map(int,input()))\r\n nums=[]\r\n tem=list(sorted(list(set (l)))) \r\n if k!=0: \r\n nums=tem[0:len(s)]\r\n else:\r\n if s[0] in l:\r\n if l[0]!=0:\r\n c=c+1\r\n continue \r\n elif l[0]==0 and l.count(0)>1:\r\n c=c+1\r\n continue\r\n else:\r\n continue\r\n if s==nums: \r\n c=c+1\r\nprint(c)", "def check(a, k):\r\n used = [False for i in range(10)]\r\n while a != 0:\r\n used[a % 10] = True\r\n a //= 10\r\n return sum(used[:k + 1]) == k + 1\r\n \r\nn, k = map(int, input().split())\r\ncnt = 0\r\nfor i in range(n):\r\n a = int(input())\r\n if check(a, k):\r\n cnt += 1\r\nprint(cnt)\r\n", "def func(x) :\r\n count = 0\r\n for i in range(k+1) :\r\n if str(i) in x :\r\n count += 1\r\n if count == k+1 :\r\n return 1\r\n else :\r\n return 0\r\nn,k = map(int,input().split())\r\nlst = []\r\nfor i in range(n) :\r\n x = input()\r\n lst.append(func(x))\r\nprint(sum(lst))", "def exits(x,k):\r\n alpha = range(0, k+1)\r\n for i in alpha:\r\n if str(i) not in str(x):\r\n return False\r\n return True\r\n\r\ndef main():\r\n #inputs\r\n lst = input().split(' ')\r\n n = int(lst[0])\r\n k = int(lst[1])\r\n X= []\r\n counter = 0\r\n for i in range(0, n):\r\n X.append(int(input()))\r\n\r\n for i in X:\r\n if exits(i,k):\r\n counter += 1\r\n print(counter)\r\n\r\nmain()", "\r\nn, k = list(map(int, input().split(\" \")))\r\n\r\nt = n\r\ncount = 0\r\n\r\nwhile t > 0:\r\n t -= 1\r\n num = input()\r\n l = []\r\n l[:0] = num\r\n l = set(l)\r\n l = list(l)\r\n look = False\r\n for i in range(k + 1):\r\n if str(i) not in l:\r\n look = True\r\n break\r\n if not look:\r\n count += 1\r\nprint(count)", "from collections import defaultdict\nn, k = map(int, input().split())\nans = 0\nfor I in range(n):\n occur, valid = defaultdict(bool), True\n s = input()\n for i in s: occur[int(i)] = True\n for i in range(k + 1):\n if not occur[i]: valid = False; break\n ans += valid\nprint(ans)", "n, k = map(int, input().split())\r\nr = 0\r\nwhile n:\r\n a = input()\r\n r += all(a.count(str(i)) for i in range(k+1))\r\n n -= 1\r\nprint(r)", "n,k=map(int,input().split())\r\nlist1=[]\r\nlist2=[]\r\ncount=0\r\nfor i in range(n):\r\n a=input()\r\n list1.append(a)\r\nfor i in range(k+1):\r\n list2.append(str(i))\r\nfor i in list1:\r\n b=0\r\n for j in range(len(list2)):\r\n if list2[j] not in i:\r\n b=1\r\n if b!=1:\r\n count+=1\r\nprint(count)", "n,k = map(int,input().split())\r\nx = 0\r\nfor i in range(n):\r\n count = 0\r\n t = input()\r\n for i in range(k+1):\r\n if str(i) in t:\r\n count+=1\r\n if count == k+1:\r\n x+=1\r\nprint(x)", "n ,k = map(int, input().split())\r\nc=0\r\nfor i in range(n):\r\n s=0\r\n a=list(map(int ,input()))\r\n for i in range(k+1):\r\n if i in a:\r\n s+=1\r\n if s==k+1:\r\n c +=1\r\nprint(c)", "count = 0\r\ncount2 = 0\r\nn = list(map(int, input().split()))\r\nfor i in range(0, n[0]):\r\n y = list(set(sorted(list(map(int, input())))))\r\n for j in range(0, len(y)):\r\n if y[j] <= n[1]:\r\n count2 += 1\r\n if count2 == (n[1]+1):\r\n count += 1\r\n count2 = 0\r\nprint(count)", "n,m=map(int, input().split())\ns = set('0123456789'[:m+1])\nprint(sum(set(input()) >= s for _ in range(n)))\n\t \t \t \t\t\t\t \t\t\t\t \t\t \t\t\t\t\t\t\t\t\t", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n x=0\r\n l=list(map(int,input()))\r\n for j in range(k+1):\r\n if j in l:\r\n x+=1\r\n if x==k+1:\r\n c+=1\r\nprint(c)\r\n", "t,n=map(int,input().split());c=0\r\nfor i in range(t):\r\n\ta=input()\r\n\tfor j in range(n+1):\r\n\t\tif str(j) not in a:break\r\n\telse:c+=1\r\nprint(c)", "range1,k = list(map(int,input().split()))\r\ngood_number = 0\r\nfor i in range(range1):\r\n c = True\r\n l=0\r\n num = input()\r\n for i in range(k+1):\r\n if str(i) in num:\r\n l +=1\r\n c = True\r\n else:\r\n c=False\r\n if c and l == k+1:\r\n good_number+=1\r\nprint(good_number)", "n,k = map(int,input().split(' '))\r\ncount = 0\r\nfor i in range(n):\r\n st = input()\r\n res = True\r\n for j in range(0,k+1):\r\n if not st.__contains__(str(j)):\r\n res=False\r\n break\r\n if res: count+=1\r\nprint (count)", "n,k= map(int, input().split())\r\ns=0\r\nfor i in range(n):\r\n count=0\r\n t=input()\r\n for i in range(k+1):\r\n if str(i) in t:\r\n count=count+1\r\n if (count==k+1):\r\n s=s+1\r\nprint(s)", "\r\nret =-1\r\nss=\"0123456789\"\r\ncount1=0;count2=0 \r\ns = str()\r\n \r\n(n, k) = tuple(map(int, input().split()))\r\n \r\n \r\nwhile n != 0:\r\n\r\n s = input()\r\n for i in range(0, k + 1):\r\n ret=s.find(ss[i])\t\r\n if ret != -1 :\r\n count1+= 1\r\n ret= -1\r\n\t\t\t\t\r\n\t\t\t\r\n if count1>=k+1 :\r\n count2+= 1\r\n \r\n count1=0\r\n n -= 1\r\n \r\n\t\t\r\n\r\n \r\nprint(count2)", "n,k=map(int,input().split())\r\na=0\r\nfor i in range(n):\r\n c=0\r\n t=input()\r\n for i in range(k+1):\r\n if str(i) in t:\r\n c+=1\r\n if c==k+1:\r\n a+=1\r\nprint(a)", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n s=0\r\n a=list(map(int,input()))\r\n for i in range(k+1):\r\n if i in a:\r\n s+=1\r\n if s==k+1:\r\n c+=1\r\nprint(c)", "n,k=input().split()\r\nc=0\r\nf=0\r\nl=[]\r\nfor j in range(int(k)+1):\r\n l.append(j)\r\nfor i in range(int(n)):\r\n s=int(input())\r\n while s>0:\r\n a=s%10\r\n b=s//10\r\n if a in l and str(a) not in str(b):\r\n c+=1\r\n \r\n s//=10\r\n \r\n if c==len(l):\r\n f+=1\r\n \r\n c=0\r\nprint(f)", "a, b = map(int, input().split())\r\nc = a\r\nfor i in range(a):\r\n l = list(map(int, input().strip()))\r\n req = []\r\n for x in range(b + 1):\r\n if x not in l:\r\n c -= 1\r\n break\r\nprint(c)", "import math\r\nimport sys\r\n#!pip install numpy\r\n\r\n#import numpy as np \r\nres=list(input().split())\r\n\r\n\r\n# print(p,p1,p2)\r\n#print(math.ceil(int(res[0])/int(res[2]))math.ceil(int(res[1])/int(res[2])))\r\n#print ((8res)-int((8res)/10)10)\r\n# if(res==0):\r\n# print(1) \r\n# elif(res%4==0):\r\n# print(6)\r\n# else:\r\n# print ((8(res%4))%10)\r\n\r\n#count1 = str1.count(substr)\r\n\r\n#print((res.replace(\"WUB\",\" \").split()))\r\ng=49\r\n#rt=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n#print(res2[1:].count(\"10\"))\r\na=[]\r\n#b=[]\r\ntar=0\r\nts=0\r\nc=0\r\nfor i in range(int(res[0])):\r\n v=input()\r\n for m in range(int(res[1])+1):\r\n if (v.find(chr(m+48))>=0):\r\n f=1\r\n else:\r\n f=0\r\n break\r\n \r\n if(f):\r\n c=c+1\r\nprint(c)", "d = list(map(int, input().split()))\r\nans = 0\r\nfor _ in range(d[0]):\r\n s = list(input())\r\n s = [int(i) for i in s]\r\n k = 0\r\n if d[1] != 0:\r\n for i in range(d[1]+1):\r\n if i in s:\r\n k += 1\r\n if k == d[1]+1:\r\n ans += 1\r\n else:\r\n if 0 in s:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n x=list(input())\r\n d=0\r\n for i in range(k+1):\r\n if str(i) in x:\r\n d+=1\r\n if d==k+1:\r\n c+=1\r\nprint(c)", "a,b=map(int,input().split())\r\nf=0\r\nq=[]\r\nfor i in range(b+1):\r\n q.append(i)\r\n\r\nfor i in range(a):\r\n x=list(map(int,input()))\r\n if all(num in x for num in q):\r\n f+=1\r\nprint(f)\r\n", "n,k=map(int,input().split())\r\nx=0\r\nfor i in range(n):\r\n a=input()\r\n y=0\r\n for j in range(k+1):\r\n if str(j) in a:\r\n y=y+1\r\n if y==(k+1):\r\n x=x+1\r\nprint(x)", "n, k = map(int, input().split())\r\nres = 0\r\nfor i in range(n):\r\n r = 0\r\n s = str(input())\r\n for i in range(k+1):\r\n if str(i) in s:\r\n r += 1\r\n if r == k + 1:\r\n res += 1\r\nprint(res)", "n, k = [int(item) for item in input().split()]\r\na = [str(i) for i in range(k + 1)]\r\ntemp = 0\r\nfor i in range(n):\r\n x = list(input())\r\n y = list(set(a) & set(x))\r\n if sorted(a) == sorted(y):\r\n temp += 1\r\nprint(temp)\r\n", "n,k = map(int,input().split());l=0\r\nra=set(map(str,list(range(k+1))))\r\nfor i in range(n):\r\n if set(input())&ra ==ra:l+=1\r\nprint(l)", "n,k=map(int, input().split())\r\nka=[i for i in range(k+1)]\r\ncount=n\r\n\r\nfor i in range(n):\r\n a=input()\r\n for j in range(len(ka)):\r\n if str(ka[j]) not in a:\r\n count = count-1\r\n break\r\nprint(count)", "t,k=map(int,input().split())\r\nr=''\r\nfor i in range(k+1):\r\n r+=str(i)\r\nc=0\r\n\r\nfor _ in range(t):\r\n d=0\r\n n=input()\r\n for i in r:\r\n if i in n:\r\n d+=1\r\n if d==k+1:\r\n c+=1\r\nprint(c)", "n,k = map(int, input().split())\r\ncount = 0\r\nstart = 0\r\nreflist = []\r\nfor i in range (k+1):\r\n reflist += str(i)\r\nif k == 0:\r\n start = 1\r\nfor i in range (n):\r\n s = input()\r\n l = reflist.copy()\r\n for i in range (start, len(s)):\r\n if s[i] in l:\r\n l.remove (s[i])\r\n if l == []:\r\n count += 1\r\nprint (count)", "# LUOGU_RID: 127949178\nn,k=map(int,input().split())\r\ns=0\r\nfor i in range(n):\r\n\ta=input()\r\n\tfor j in range(k+1):\r\n\t\tif str(j) not in a:\r\n\t\t\ts-=1\r\n\t\t\tbreak\r\n\ts+=1\r\nprint(s)\r\n", "n,k=list(map(int,input().split()))\r\nd=0\r\nfor i in range(n):\r\n c=0\r\n a=input()\r\n for j in range(k+1):\r\n if str(j) in a:\r\n c+=1\r\n if c==k+1:\r\n d+=1\r\nprint(d)", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n\ta=input()\r\n\tfor j in range(k+1):\r\n\t\tif str(j) not in a:\r\n\t\t break\r\n\telse:\r\n\t c+=1\r\nprint(c)", "x,z=map(int,input().split())\r\nl=[]\r\nm=0\r\n\r\nfor i in range(z+1):\r\n l.append(i)\r\nfor i in range(x):\r\n c=0\r\n w=input()\r\n for j in l:\r\n if str(j) in w:\r\n c+=1\r\n if c == z + 1:\r\n m += 1\r\n\r\n\r\nprint(m)\r\n", "n,k= map(int,input().split())\r\nr = 0\r\n\r\nfor i in range(n):\r\n a = input()\r\n r+=all(a.count(str(j))for j in range(k+1))\r\n n-=1\r\nprint(r)", "t,l=map(int, input().split())\r\ns=0\r\nfor i in range(t):\r\n a=input()\r\n list=[]\r\n for i in a:\r\n list.append(int(i))\r\n pure=[]\r\n for i in list:\r\n if i not in pure:\r\n pure.append(i)\r\n q=0\r\n for v in pure:\r\n if v in range(l+1):\r\n q+=1\r\n if q==l+1:\r\n s+=1\r\n q=0\r\nprint (s)", "a,b=map(int,input().split())\r\nm=0\r\nfor i in range(a):\r\n c=[]\r\n l=list(map(int,input()))\r\n n=[]\r\n for j in range(len(l)):\r\n if l[j]<=b:\r\n n=n+[l[j]]\r\n n.sort()\r\n if n!=[]: \r\n for k in range(len(n)):\r\n if n[k]!=n[k-1]:\r\n c=c+[n[k]]\r\n if c==[]:\r\n c=[n[0]]\r\n if len(c)>=b+1:\r\n m=m+1\r\nprint(m) ", "n,k = map(int, input().split())\r\n\r\nl = set(range(k+1))\r\n\r\nans = 0\r\nfor i in range(n):\r\n t = map(int,list(input()))\r\n ans += len(set(t).intersection(l)) == k + 1\r\n\r\nprint(ans)", "n,s=map(int,input().split())\r\ntemp=0\r\nfor i in range(n):\r\n count=0\r\n a=list(map(int,input()))\r\n for i in range(s+1):\r\n if i in a:\r\n count=count+1\r\n if count==s+1:\r\n temp=temp+1\r\nprint(temp)", "ret=-1\r\nss=\"0123456789\"\r\nn,k=map(int, input().split())\r\ncount1=0\r\ncount2=0\r\nwhile n:\r\n s=input()\r\n for i in range(0,k+1):\r\n ret=s.find(ss[i])\r\n if ret!=-1:\r\n count1+=1\r\n ret=-1\r\n if count1>=k+1:\r\n count2+=1\r\n count1=0\r\n n-=1\r\nprint(count2)", "c=0 ; d = {}\r\nx,y=map(int, input().split())\r\nfor i in range(x):\r\n z=input()\r\n if z not in d.keys():\r\n for i in range(y+1):\r\n if str(i) not in z:\r\n d[z] = 0\r\n break\r\n else:\r\n c+=1\r\n d[z] = 1\r\n else:\r\n c+=d[z]\r\n \r\nprint(c)", "n, k = map(int, input().split())\r\n\r\ncount = 0\r\nfor i in range(n):\r\n num = str(input())\r\n if all(str(digit) in num for digit in range(k+1)):\r\n count += 1\r\n\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\nnum=\"\"\r\ncount=0\r\nfor i in range(k+1):\r\n num+=str(i)\r\nfor i in range(n):\r\n a=str(int(input()))\r\n c=0\r\n for thing in num:\r\n if thing not in a:\r\n c+=1\r\n if c==0:\r\n count+=1\r\nprint(count)", "n,k=map(int,input().split())\nventilator=0\nfor i in range(n):\n alarmstufe_rot=False\n a=input()\n for j in range(k+1):\n if str(j) not in a:\n alarmstufe_rot=True\n if alarmstufe_rot==False:\n ventilator+=1\nprint(ventilator)\n \t \t \t \t\t\t\t\t \t \t \t\t \t", "n,k=map(int,input().split())\r\nx=0\r\nfor i in range(n):\r\n count=0\r\n t=input()\r\n for i in range(k+1):\r\n if str(i) in t:\r\n count+=1\r\n if count==k+1:\r\n x+=1\r\nprint(x)", "n,k=map(int,input().split())\r\na=0\r\nfor i in range(n):\r\n x=input()\r\n b=1\r\n x=list(x)\r\n x.sort()\r\n c=0\r\n for i in x:\r\n if int(i)==c:\r\n c=c+1\r\n if c>k:\r\n a=a+1\r\nprint(a)", "def check(str1,key) :\r\n temp=1\r\n for i in range(0,int(key)+1) :\r\n if str1.count(str(i))==0 :\r\n temp=0\r\n break\r\n if temp==1 :\r\n return True\r\n else :\r\n return False\r\n \r\nnum1,key=input().split()\r\nnum1=int(num1)\r\ncount=0\r\nfor i in range(num1) :\r\n temp=input()\r\n if check(temp,key)==True :\r\n count=count+1\r\nprint(count)", "n, k = map(int, input().split())\r\ncount = n\r\nfor i in range(n):\r\n inp = input()\r\n for j in range(k+1):\r\n if str(j) not in inp :\r\n count -= 1\r\n break\r\nprint(count)", "import sys\r\ndef input():\r\n return sys.stdin.readline()\r\n\r\nn,x = list(map(int,input().split()))\r\ncounter = 0\r\nfor i in range(n):\r\n z = \"\".join(sorted(list(set(input()))))\r\n if \"\".join(list(map(str,list(range(x+1))))) in z:\r\n counter += 1\r\nprint(counter)\r\n", "n,k=list(map(int,input().split()))\r\ndef check(st,k):\r\n for i in range(k+1):\r\n if str(i) not in st :return False\r\n return True\r\nsum=0\r\nfor i in range(n):\r\n\r\n st=input()\r\n \r\n if check(st,k):sum+=1\r\nprint(sum)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Sat Dec 4 20:12:55 2021\r\n\r\n@author: Anshu\r\n\"\"\"\r\n\r\nn,k=map(int,input().split())\r\nl=[]\r\nl1=[]\r\ncount2=0\r\nfor i in range (n):\r\n a=input()\r\n l.append(a)\r\nfor j in range(k+1):\r\n l1.append(str(j))\r\nfor m in l:\r\n count=0\r\n for n in range(len(l1)):\r\n if l1[n] in m:\r\n count=count+1\r\n if count==len(l1):\r\n count2=count2+1\r\nprint(count2)\r\n ", "a,b=map(int,input().split())\r\ntemp=0\r\nfor i in range(a):\r\n count=0\r\n x=list(map(int,input()))\r\n for i in range(b+1):\r\n if i in x:\r\n count=count+1\r\n if count==b+1:\r\n temp=temp+1\r\nprint(temp)", "# Wadea #\r\n \r\ns = input().split()\r\na = int(s[0])\r\nb = int(s[1])\r\nr = \"\"\r\nfor k in range(b,-1,-1):\r\n r += str(k)\r\nt = b+1\r\np = 0\r\nq = 0\r\nm = 0\r\nlst = list(r)\r\nlst2 = []\r\nfor i in range(a):\r\n s = str(input())\r\n for k in s:\r\n lst2.append(k)\r\n for j in lst:\r\n if j in lst2:\r\n p += 1\r\n else:\r\n q += 1\r\n lst2.clear()\r\n if p == t:\r\n m += 1\r\n p = 0\r\n else:\r\n p = 0\r\n pass\r\nprint(m)\r\n", "n, k = map(int,input().split())\r\na = 0\r\nx = set()\r\nfor r in range(k + 1):\r\n x.add(r)\r\nfor r in range(n):\r\n y = input()\r\n z = set()\r\n for r in range(len(y)):\r\n z.add(int(y[r]))\r\n if x.issubset(z) == True:\r\n a = a + 1\r\nprint(a)", "n,k=map(int,input().split())\r\ncount=0\r\nx=''\r\nfor i in range(k+1):\r\n x+=str(i)\r\nfor i in range(n):\r\n c=0\r\n a=input()\r\n for i in x:\r\n if i in a:\r\n c+=1\r\n if c==k+1:\r\n count+=1\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\ns = 0\r\nfor i in range(n):\r\n a = set(str(int(input())))\r\n kac = [False for i in range(k+1)]\r\n for x in a:\r\n if int(x) <= k:\r\n kac[int(x)] = True\r\n if False not in kac:\r\n s += 1\r\nprint(s)\r\n", "n,m=map(int,input().split())\r\na=0\r\nfor i in range(n):\r\n b=input()\r\n c=0\r\n for k in range(m+1):\r\n if str(k) in b:\r\n c=c+1\r\n if c==m+1:\r\n a=a+1\r\nprint(a)", "n,k = [int(i) for i in input().split()]\r\nr = n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(0,k+1):\r\n if str(j) not in s:\r\n r -=1\r\n break\r\nprint(r)", "l = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(l[0]):\r\n t = input()\r\n t_i = map(int,t)\r\n t_l = list(t_i)\r\n n = len(t_l)\r\n m = []\r\n for j in range(n): \r\n if t_l[j] <= l[1] and t_l[j] not in m:\r\n m.append(t_l[j])\r\n s = len(m)\r\n if s == l[1] + 1 :\r\n count += 1\r\nprint(count)", "x, y= map(int, input().split())\r\na = 0\r\nfor i in range(x):\r\n b = 0\r\n l = list(map(int, input()))\r\n for j in range(y+1):\r\n if j in l:\r\n b=b+1\r\n if b == y + 1:\r\n a=a+1\r\nprint(a)", "x=input().split()\r\nnumb=int(x[1])\r\ncount=0\r\n\r\nfor i in range(int(x[0])):\r\n n=input()\r\n check=[]\r\n for z in n:\r\n h=int(z)\r\n if h<=numb and not(h in check):\r\n check.append(h)\r\n\r\n if len(check) == numb+1:\r\n count+=1\r\n \r\n \r\nprint(count)\r\n", "ans=0\nj=0\n\nn, k = map(int, input().split())\ns=''\nfor h in range(k+1):\n s+= str(h)\n\nfor x in range(n):\n y = str(input())\n for i in s:\n if str(i) in y:\n j+=1\n if j==len(s):\n ans+=1\n j=0\n\nprint(ans)\n \t \t \t\t \t \t \t \t \t \t \t\t\t", "n,m = map(int,input().split())\r\ncount=0\r\nfor i in range(n):\r\n b = input()\r\n a=[]\r\n x=0\r\n for i in range(len(b)):\r\n a.append(int(b[i]))\r\n for j in range(m+1):\r\n if j not in a:\r\n x=1\r\n break\r\n if x==0:\r\n count+=1\r\nprint(count)\r\n \r\n", "n,k=map(int,input().split())\r\nNb=0\r\nfor _ in range(n):\r\n m=0\r\n a=int(input())\r\n ch=str(a)\r\n while True:\r\n if str(m) in ch:\r\n m+=1\r\n if str(m) not in ch or m>k:\r\n break\r\n if m>k:\r\n Nb+=1\r\nprint(Nb)", "f=list(map(int,input().split()))\r\nd=0\r\nfor i in range(f[0]):\r\n t=input()\r\n ti=map(int,t)\r\n tf=list(ti)\r\n x=len(tf)\r\n m=[]\r\n for j in range(x):\r\n if tf[j]<=f[1] and tf[j] not in m:\r\n m.append(tf[j])\r\n v=len(m)\r\n if v==f[1]+1:\r\n d=d+1\r\nprint(d)", "n, k = map(int, input().split())\r\nans = 0\r\nfor i in range(n):\r\n str_num = input()\r\n count = 0\r\n for j in range(k+1):\r\n if str(j) in str_num:\r\n count += 1\r\n if count == k+1:\r\n ans += 1\r\nprint(ans)\r\n", "s = input()\r\nl = s.split()\r\nt = int(l[0])\r\nk = int(l[1])\r\nr = 0\r\nfor i in range(t):\r\n num = str(input())\r\n cont = 0\r\n for j in range(0,k+1,1):\r\n if str(j) in num :\r\n cont += 1\r\n if cont == k+1 :\r\n r += 1\r\nprint(r)\r\n\r\n\r\n\r\n\r\n", "a,b=map(int,input().split())\r\nc=0\r\nfor i in range(a):\r\n d=0\r\n l=list(map(int,input()))\r\n for j in range(b+1):\r\n if j in l:\r\n d+=1\r\n if d==b+1:\r\n c+=1\r\nprint(c) ", "n,k = map(int,input().split())\r\ngn=0\r\nfor i in range(n):\r\n al = []\r\n a=input()\r\n c=0\r\n x=len(a)\r\n for j in range(x):\r\n al.append(int(a[j]))\r\n for x in range(k+1):\r\n if x in al:\r\n c+=1\r\n if c == k+1:\r\n gn+=1\r\nprint(gn)", "n,k = map(int,input().split())\r\ncount = 0\r\nfor j in range(n):\r\n a = input()\r\n count+= all(a.count(str(i)) for i in range(k+1))\r\nprint(count)", "from math import \r\ndef solution(n, k):\r\n llist = []\r\n for i in range(int(log10(n)) +1):\r\n llist.append(n % 10)\r\n n = int(n / 10)\r\n\r\n if len(llist) <= k:\r\n return False\r\n else:\r\n for i in range(k+1):\r\n if i not in llist:\r\n return False\r\n return True\r\n\r\nss = input().split()\r\n\r\nt = int(ss[0])\r\nk = int(ss[1])\r\nc = 0\r\nfor i in range(t):\r\n temp = int(input())\r\n if solution(temp, k):\r\n c = c + 1\r\n\r\nprint(c)", "x=list(map(int,input().split()))\r\nm=0\r\nfor i in range(x[0]):\r\n a=input()\r\n for j in range(0,(x[1]+1)):\r\n if str(j) in a:\r\n k=1\r\n else:\r\n k=0\r\n break\r\n if k==1:\r\n m=m+1\r\nprint(m)", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range (n):\r\n a = input()\r\n z = 0\r\n for j in range (k+1):\r\n if str(j) in a:\r\n z = z+1\r\n if z == k+1:\r\n c=c+1\r\nprint(c)", "n,s=map(int,input().split())\r\nt=0\r\nfor i in range(n):\r\n c=0\r\n a=list(map(int,input()))\r\n for i in range(s+1):\r\n if i in a:\r\n c+=1\r\n if c==s+1:\r\n t+=1\r\nprint(t)", "#class bebo : \r\n # def __init__(self) :\r\n # print(\"baraa1\")\r\n\r\n#class bebo2 : \r\n # def __init__(self):\r\n # print(\"baraa2\")\r\n\r\n#class bebo3(bebo2,bebo) : \r\n # def __init__(self):\r\n # super().__init__()\r\n\r\n#div = bebo3()\r\nx,y=input().split()\r\nx=int(x)\r\ny=int(y)\r\ncont=0\r\nb=True\r\nfor i in range(x):\r\n c = input()\r\n for j in range(y+1):\r\n if c.__contains__(str(j)):\r\n pass\r\n else : b=False\r\n if b:\r\n cont+=1\r\n b=True\r\nprint(cont)\r\n", "z = input().split(\" \")\r\nn = int(z[0])\r\nk = int(z[1])\r\ncount = 0\r\ny = False\r\nfor i in range(n):\r\n s = input()\r\n if len(s) >= k + 1:\r\n for j in range(k + 1):\r\n if str(j) not in s:\r\n y = False\r\n break\r\n else:\r\n y = True\r\n if y:\r\n count += 1\r\n\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\nans = 0\r\nfor i in range(n):\r\n s = input()\r\n count = 0\r\n for x in range(k+1):\r\n if str(x) in s:\r\n count += 1\r\n if count == k+1:\r\n ans += 1\r\nprint(ans)", "n,k=map(int, input().split())\r\nk_1=[i for i in range(k+1)]\r\ncount=n\r\nfor i in range(n):\r\n a=input()\r\n for j in range(len(k_1)):\r\n if str(k_1[j]) not in a:\r\n count = count-1\r\n break\r\nprint(count)\r\n", "def solve(n,k,a):\r\n count = 0\r\n for num in a:\r\n nc = False\r\n for i in range(0,k+1):\r\n if(str(i) not in num):\r\n nc = True\r\n break\r\n if(not nc):\r\n count += 1\r\n\r\n return count\r\n\r\nif __name__ == \"__main__\":\r\n n,k = map(int,input().split(\" \"))\r\n t = 0\r\n a = list()\r\n while(t < n):\r\n a.append(input())\r\n t +=1\r\n\r\n final=solve(n,k,a)\r\n print(final)", "n,k=map(int, input().split())\r\ns = set('0123456789'[:k+1])\r\nprint(sum(set(input()) >= s for _ in range(n)))", "n, k = map(int, input().split())\r\na = 0\r\nfor i in range(n):\r\n b = 0\r\n list1 = list(map(int, input()))\r\n for j in range(k+1):\r\n if j in list1:\r\n b += 1\r\n if b == k + 1:\r\n a += 1\r\nprint(a)", "a,b = list((input().split(' ')))\r\na,b = int(a),int(b)\r\nams = 0\r\nfor ii in range(0,a):\r\n r = list((input()))\r\n list.sort(r)\r\n ch = list(range(0, b+1))\r\n for i in ch:\r\n if r.__contains__(str(i)) == False:\r\n break\r\n if (i==b): ams+=1\r\nprint(ams)", "import sys\r\n\r\ndef dbg(x):\r\n # sys.stderr.write(x)\r\n print(x, file=sys.stderr)\r\n\r\n\r\ndef solve(test_case):\r\n n, k = map(int, input().split())\r\n ans = 0\r\n for _ in range(n):\r\n s = {x for x in input() if int(x) <= k}\r\n ans += 1 if len(s) == k + 1 else 0\r\n \r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n T = 1\r\n # T = int(input())\r\n for t in range(T):\r\n solve(t)\r\n", "x , y = input().split()\r\nz = \"\"\r\nfor i in range(0 , 10):\r\n z = z + f\"{i}\"\r\nz = list(z)\r\nstrings = []\r\ncounter = 0\r\nfor i in range(int(x)):\r\n string = input()\r\n \r\n \r\n string = list(set(string))\r\n string = sorted(string)\r\n strings.append(string)\r\n \r\n\r\n\r\nfor i in strings:\r\n ff = i[:1:]\r\n ffz = z[:1:]\r\n\r\n if(i[:int(y)+1:] == z[:int(y)+1:] ):\r\n counter = counter + 1\r\nprint(counter)\r\n ", "from sys import stdin, stdout\r\n#from bisect import bisect_left, bisect_right\r\n#from collections import Counter, deque\r\n#from queue import Queue\r\n#import heapq\r\n#import math\r\n#from itertools import permutations, combinations, islice\r\n\r\ndef input():\r\n return stdin.readline().strip()\r\n\r\ndef solve():\r\n n,k = map(int, input().split())\r\n s = ''\r\n ans = 0\r\n for i in range(k+1):\r\n s += str(i)\r\n\r\n for i in range(n):\r\n a = input()\r\n for j in s:\r\n if j not in a:\r\n break\r\n else:\r\n ans += 1\r\n return f\"{ans}\"\r\n\r\ndef main():\r\n stdout.write(solve())\r\n\r\nmain()", "#K-good number\r\n\r\nn, k = map(int, input().split())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n num = str(input())\r\n if set(num) >= set(str(j) for j in range(k+1)):\r\n count += 1\r\n\r\nprint(count)", "n, k = map(int, input().split())\r\ncounter = 0\r\nfor i in range(n):\r\n s = input()\r\n count = 0\r\n m = {}\r\n for j in range(len(s)):\r\n if s[j] in m:\r\n m[s[j]] += 1\r\n else:\r\n m[s[j]] = 1\r\n for j in range(k+1):\r\n if str(j) in m:\r\n count += 1\r\n if count == k+1:\r\n counter += 1\r\nprint(counter)", "n,k=map(int,input().split(' '))\r\ncounter =0\r\nks=list(range(0,k+1))\r\n# print(ks)\r\nfor i in range(0,n):\r\n a=list(input())\r\n # print(a)\r\n good=True\r\n for j in ks:\r\n if (a.count(str(j))==0):\r\n good=False\r\n break\r\n if(good):\r\n counter = counter + 1 \r\nprint(counter)", "n, k = map(int, input().split())\r\n\r\nc2 = 0\r\nnum = '0123456789'\r\nfor i in range(n):\r\n count = 0\r\n a = input()\r\n for j in range(k + 1):\r\n if a.__contains__(num[j:j + 1]):\r\n count += 1\r\n\r\n if count >= k + 1:\r\n c2 += 1\r\n\r\nprint(c2)\r\n", "n, k = map(int, input().split())\r\nk_good = 0\r\nfor i in range(n):\r\n number = input()\r\n s = set()\r\n for j in range(len(number)):\r\n if int(number[j]) <= k:\r\n s.add(number[j])\r\n if len(s) == k + 1:\r\n k_good += 1\r\nprint(k_good)", "n, k = [int(x) for x in input().split()]\r\nz = 0\r\n\r\nfor i in range(n):\r\n sub = set(range(0, k+1))\r\n num = set([int(x) for x in input()])\r\n sub.difference_update(num)\r\n if len(sub) == 0:\r\n z += 1\r\nprint(z)\r\n", "size,num= map(int,input().split())\r\ncounter=0\r\ncount=0\r\nfor i in range(size):\r\n n= input()\r\n for i in range(num+1):\r\n if str(i) in n :\r\n counter+=1\r\n \r\n if counter > num:\r\n count+=1\r\n counter=0\r\n\r\n\r\nprint(count)\r\n ", "l,k=map(int,input().split())\r\n\r\ndigits=\"\"\r\n\r\nanswer=0\r\n\r\nfor i in range(k+1):\r\n digits+=str(i)\r\n \r\nfor i in range(l):\r\n b=int(input())\r\n b=str(b)\r\n c=0\r\n for thing in digits:\r\n if thing not in b:\r\n c+=1\r\n break\r\n if(c==0):\r\n answer+=1\r\nprint(answer)", "x=list(map(int, input().split()))\r\nn=x[0]\r\nk=x[1]\r\nr=0\r\nfor i in range(n):\r\n a=int(input())\r\n b=[int(x) for x in str(a)]\r\n c=set(b)\r\n #print(c)\r\n d=set(list(range(0,k+1)))\r\n #print(d)\r\n p=d.issubset(c)\r\n if p==True:\r\n r=r+1\r\nprint(r)", "m,k=map(int,input().split())\r\nj=0\r\nb=[]\r\nfor i in range(k+1):\r\n b.append(str(i))\r\nfor i in range(m):\r\n q=input()\r\n l=b.copy()\r\n for i in range(len(q)):\r\n if q[i] in l:\r\n l.remove(q[i])\r\n if l==[]:\r\n j+=1\r\nprint(j)", "def is_k_good(number, k):\r\n # Convert the number to a string to check the presence of digits.\r\n number_str = str(number)\r\n # Create a set of characters to keep track of which digits are present in the number.\r\n digits_present = set(number_str)\r\n # Check if all digits from 0 to k are present in the number.\r\n for i in range(k + 1):\r\n if str(i) not in digits_present:\r\n return False\r\n return True\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n count = 0\r\n\r\n for _ in range(n):\r\n ai = int(input())\r\n if is_k_good(ai, k):\r\n count += 1\r\n\r\n print(count)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int, input().split())\r\nans = 0\r\nfor _ in range(n):\r\n x = input()\r\n ok = 1\r\n x = list(x)\r\n x.sort()\r\n cnt = 0\r\n for i in x :\r\n if int(i) == cnt + int('0'):\r\n cnt += 1\r\n if cnt > k :\r\n ans += 1\r\nprint(ans)", "a,b = map(int, input().split())\r\nx=0\r\nfor i in range(a):\r\n y=0\r\n z=list(map(int, input()))\r\n for j in range(b+1):\r\n if j in z:\r\n y+=1\r\n if y==b+1:\r\n x+=1\r\nprint(x)\r\n", "#I = lambda: [int(i) for i in input().split()]\r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\n# n = int(input())\r\n# l = list(map(int,input().split()))\r\n# n,x = map(int,input().split())\r\n# mod = 1000000007\r\nn,k = map(int,input().split())\r\nl= []\r\nans=0\r\nfor _ in range(n):\r\n s = set((input()))\r\n cnt=0\r\n for i in range(k+1):\r\n for j in s:\r\n if str(i)==j:\r\n cnt+=1\r\n if cnt==k+1:\r\n ans+=1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\ncount = 0\r\nfor i in range(n):\r\n s = str(input().strip())\r\n if set(s) >= set(str(j) for j in range(k+1)):\r\n count += 1\r\nprint(count)\r\n", "n , k = map(int,input().split())\r\ntestagainst = set([i for i in range(k+1)])\r\n\r\nans = 0\r\nfor i in range(n):\r\n\r\n \r\n temp = input()\r\n temp = ([int(i) for i in temp])\r\n temp.sort()\r\n temp = set(temp)\r\n\r\n \r\n if testagainst.issubset(temp):\r\n ans += 1 \r\n\r\n\r\nprint(ans)", "from collections import Counter\r\ndef fun (k , l):\r\n x=0\r\n g = {str(i) for i in range(k+1)}\r\n c=Counter(l)\r\n for i in c.keys():\r\n s = set(str(i))\r\n if g.issubset(s) : x+=c[i]\r\n return x\r\nn,k = tuple(map(int , input().split()))\r\nl =[]\r\nfor i in range (n):\r\n l.append(input())\r\nprint(fun(k,l))", "n, k = list(map(int, input().split()))\r\nc = 0\r\nkk = set(map(str, range(k+1)))\r\n \r\nfor x in range(n):\r\n z = set(input())\r\n if kk.issubset(z):\r\n c += 1\r\nprint(c) ", "n, k = map(int, input().split())\r\n\r\ns = set(\"0123456789\"[:k+1])\r\n\r\nc = 0\r\nfor i in range(n):\r\n x= set(input())\r\n if x>=s:\r\n c+=1\r\n\r\nprint(c)", "n,k = map(int, input().split())\r\n\r\nres = 0\r\nfor _ in range(n):\r\n x = input()\r\n cnt = 0\r\n for i in range(k+1):\r\n if x.count(str(i)) >= 1:\r\n cnt+=1\r\n\r\n if cnt == k+1:\r\n res+=1\r\n cnt =0\r\n\r\nprint(res)\r\n\r\n\r\n\r\n", "n, k = [int(i) for i in input().split()]\n\nans = 0\n\nfor i in range(n):\n t = input()\n b = True\n\n for j in range(k+1):\n if str(j) not in t:\n b = False\n break\n \n ans += int(b)\n\nprint(ans)\n", "\r\na, k = map(int,input().split()) \r\ncount = a\r\nk_string = \"\"\r\nk_list = [str(i) for i in range(k+1)]\r\nfor i in k_list:\r\n k_string = k_string+i\r\n\r\nfor x in range(a):\r\n list_a = input() \r\n for j in k_string:\r\n if j not in list_a:\r\n count -= 1\r\n break\r\n\r\nprint(count)\r\n\r\n ", "n, k = list( map(int, input().split()) )\r\ncnt = 0\r\n\r\nfor _ in range(n):\r\n num = input()\r\n st = set()\r\n\r\n for x in num:\r\n digit = int(x)\r\n if digit >= 0 and digit <= k:\r\n st.add(x)\r\n\r\n if len(st) == k+1:\r\n cnt += 1\r\n \r\n\r\nprint(cnt)\r\n", "a,b=map(int,input().split())\r\n\r\nc=0\r\n\r\nfor i in range(a):\r\n \r\n\tk=input()\r\n\tfor j in range(b+1):\r\n\t\tif str(j) not in k:break\r\n\telse:c+=1\r\n\t\r\nprint(c)", "n,k=map(int,input().split())\r\ncount=0\r\nstart=0\r\nreflist= []\r\nfor i in range (k+1):\r\n reflist += str(i)\r\nif k ==0:\r\n start = 1\r\nfor i in range (n):\r\n s= input()\r\n l = reflist.copy()\r\n for i in range(start, len(s)):\r\n if s[i] in l:\r\n l.remove(s[i])\r\n if l == []:\r\n count =count+1\r\nprint(count)", "a,b=map(int,input().split())\r\ncount=0\r\nstart=0\r\nrefList=[]\r\nfor i in range(b+1):\r\n refList+=str(i)\r\nif b==0:\r\n start=1\r\nfor i in range(a):\r\n s=input()\r\n l=refList.copy()\r\n for i in range(start,len(s)):\r\n if s[i] in l:\r\n l.remove(s[i])\r\n if l==[]:\r\n count+=1\r\n\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\na=0\r\nb=0\r\nr=[]\r\nfor i in range(k+1):\r\n r+=str(i)\r\nif k==0:\r\n b=1\r\nfor i in range(n):\r\n s=input()\r\n l=r.copy()\r\n for i in range(b,len(s)):\r\n if s[i] in l:\r\n l.remove(s[i])\r\n if l==[]:\r\n a+=1\r\nprint(a)", "n,k=map(int,input().split())\r\nx=n\r\nfor i in range(n):\r\n q=input()\r\n for j in range(k+1):\r\n if str(j) not in q:\r\n x=x-1\r\n break\r\nprint(x)", "n, k = map(int, input().split())\r\ns = set(str(i) for i in range(k+1))\r\n\r\ncount = 0\r\nfor i in range(n):\r\n d = set(str(input().strip()))\r\n if s.issubset(d):\r\n count += 1\r\n\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\nans=0\r\nlst=[]\r\nfor i in range(n):\r\n lst.append(input())\r\nfor ele in lst:\r\n dig=[0](k+1)\r\n for d in ele:\r\n if int(d)>k:\r\n continue\r\n dig[int(d)]+=1\r\n ans+=all(dig)\r\nprint(ans)\r\n", "# Read input values\r\nn, k = map(int, input().split())\r\n\r\n# Initialize a counter variable to keep track of k-good numbers\r\ncount = 0\r\n\r\n# Iterate over each number in the array\r\nfor i in range(n):\r\n # Convert the number to a string\r\n num_str = str(int(input()))\r\n\r\n # Check if all digits from 0 to k appear in the string\r\n if all(str(digit) in num_str for digit in range(k+1)):\r\n count += 1\r\n\r\n# Print the count of k-good numbers\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\ncount=n\r\n\r\nfor i in range(n):\r\n x=input()\r\n for i in range(k+1):\r\n if str(i) not in x:\r\n count-=1\r\n break\r\n \r\nprint(count)", "lineFirst = list(map(int, input().split()))\r\n\r\ntestAmount = lineFirst[0]\r\nnumberMax = lineFirst[1]\r\n\r\ngoodNumberAmount = 0\r\n\r\nfor i in range(testAmount):\r\n numberTemp = numberMax\r\n stringTemp = input()\r\n\r\n goodNumberVerify = True\r\n\r\n while (numberTemp >= 0):\r\n if str(numberTemp) not in stringTemp:\r\n goodNumberVerify = False\r\n break\r\n numberTemp -= 1\r\n\r\n if goodNumberVerify:\r\n goodNumberAmount += 1\r\n\r\nprint(goodNumberAmount)\r\n", "n,k = map(int,input().split())\r\ncount = 0\r\nfor i in range(n):\r\n s=0\r\n x=input()\r\n for i in range(k+1):\r\n if str(i) in x:\r\n s+=1\r\n if s==k+1:\r\n count+=1\r\nprint(count)", "m,n=map(int,input().split())\r\na=0\r\nfor i in range(m):\r\n b=0\r\n p=input()\r\n for i in range(n+1):\r\n if str(i) in p:\r\n b=b+1\r\n if b==n+1:\r\n a=a+1\r\nprint(a)", "n,k=map(int,input().split())\r\ncount=0\r\nfor i in range(n):\r\n x=input()\r\n a=1\r\n for j in range(k+1):\r\n if str(j) not in x:\r\n a=0\r\n break\r\n if a==1:\r\n count+=1\r\nprint(count)", "n,k=map(int,input().split())\r\nc=0\r\nfor _ in range(int(n)):\r\n ks=set(input())\r\n if all(str(i) in ks for i in range(k+1)):\r\n c+=1\r\n else:\r\n continue\r\n\r\nprint(c)", "n,k=map(int,input().split())\r\ncount=0\r\nfor i in range(n):\r\n s=list(input())\r\n for j in range(k+1):\r\n if str(j) in s:\r\n x=1\r\n else:\r\n x=0\r\n break\r\n if x==1:\r\n count+=1\r\nprint(count)\r\n", "# -- coding: utf-8 --\n\"\"\"Untitled25.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1C4lffqvVsaZuKB3tgB3XIy1Pwms9LVYP\n\"\"\"\n\nn, k = map(int, input().split())\n\ncount = 0\n\nstart = 0\n\nrefList = []\n\nfor i in range(k+1): \n \n refList += str(i)\n if k == 0:\n start = 1\n\nfor i in range(n):\n s = input()\n l = refList.copy()\n for i in range (start, len(s)):\n if s[i] in l: \n l.remove(s[i])\n if l == []: \n count += 1\n\nprint (count)", "nt,k=map(int,input().split())\r\ncount=int(0)\r\nb=list(range(0,k+1))\r\nn=set(b)\r\ndef Convert(string):\r\n list1 = []\r\n list1[:0] = string\r\n list2=[int (i) for i in list1]\r\n return list2\r\nfor i in range(nt):\r\n a=str(input())\r\n p=(Convert(a))\r\n q=set(p)\r\n j=list(q)\r\n j.sort()\r\n jj=j[0:k+1]\r\n nn=set(jj)\r\n if (nn==n):\r\n count=count+1\r\n else:\r\n continue\r\nprint(count)", "n, k = map(int, input().split())\nmy_string = \"\"\nans = 0\nfor v in range(k + 1):\n my_string += str(v)\nfor i in range(n):\n num_list = list(input())\n num_list.sort()\n num_list = str(num_list)\n reserve = \"\"\n for p in range(len(num_list)):\n if num_list[p] in my_string and num_list[p] not in reserve:\n reserve += num_list[p]\n if reserve == my_string:\n ans += 1\nprint(ans)\n\n \t \t\t\t\t\t\t \t\t \t\t \t\t \t\t\t\t \t\t", "n, k = map(int, input().split())\r\n\r\ngood_count = 0\r\nfor i in range(n):\r\n number = input().strip()\r\n digit_present = [False] * (k+1)\r\n for digit in number:\r\n if int(digit) <= k:\r\n digit_present[int(digit)] = True\r\n if all(digit_present):\r\n good_count += 1\r\n\r\nprint(good_count)\r\n", "n,k=map(int,input().split())\r\nc=0\r\nb=[]\r\nfor i in range(k+1):\r\n b.append(str(i))\r\nfor i in range(n):\r\n s=input()\r\n l=b.copy()\r\n for i in range(len(s)):\r\n if s[i] in l:\r\n l.remove(s[i])\r\n if l==[]:\r\n c+=1\r\nprint(c)\r\n", "n, k = [int(x) for x in input().split()]\ngood = 0\nfor _ in range(n):\n val = input()\n is_good = True\n for i in range(k+1):\n if str(i) not in val:\n is_good = False\n break\n if is_good:\n good += 1\nprint(good)\n", "n,k=map(int,input().split())\r\nc=0\r\nfor _ in range(n):\r\n a=input()\r\n good=True\r\n for i in range(k+1):\r\n if str(i) not in a:\r\n good=False\r\n break\r\n if good:\r\n c+=1\r\nprint(c)", "n,k=map(int,input().split())\r\np,q=0,0\r\nm=[]\r\nfor i in range(k+1):\r\n m+=str(i)\r\nif k==0:\r\n q=1\r\nfor i in range(n):\r\n w=input()\r\n l=m.copy()\r\n for i in range(q, len(w)):\r\n if w[i] in l:\r\n l.remove(w[i])\r\n if l==[]:\r\n p+=1\r\nprint(p)", "def good(n, k, a):\r\n count = 0\r\n for num in a:\r\n Notfalse = False\r\n for i in range(0, k+1):\r\n if str(i) not in num:\r\n Notfalse = True\r\n break\r\n if not Notfalse:\r\n count += 1\r\n return count\r\n\r\n\r\nn, k = map(int, input().split())\r\nx = 0\r\na = list()\r\nwhile x < n:\r\n a.append(input())\r\n x += 1\r\nprint(good(n, k, a))\r\n\r\n", "n, b = map(int, input().split())\r\nk = 0\r\nfor ___ in range(n):\r\n h = [int(_) for _ in input()]\r\n for i in range(b + 1):\r\n if i not in h:\r\n break\r\n if i not in h:\r\n continue\r\n k += 1\r\nprint(k)\r\n", "p=input()\r\nn_k=p.split(\" \")#[n,k]\r\na=[]\r\nfor i in range(int(n_k[1])+1):\r\n a.append(str(i))\r\narr=[]\r\nc=0\r\nfor i in range(int(n_k[0])):\r\n arr.append(input())\r\nfor i in range(len(arr)):\r\n b=list(arr[i])\r\n result = all(elem in b for elem in a)\r\n if result==True:\r\n c=c+1\r\nprint(c)", "r,s=map(int,input().split())\r\nc=0\r\nfor i in range(r):\r\n x=input()\r\n a=1\r\n for k in range(s+1):\r\n if str(k) not in x:\r\n a=0\r\n break\r\n if a==1:\r\n c+=1\r\nprint(c)", "n, k = map(int, input().split())\r\n\r\ncount = 0\r\nfor i in range(n):\r\n num_str = str(input().strip())\r\n if all(str(digit) in num_str for digit in range(k+1)):\r\n count += 1\r\n\r\nprint(count)", "def k_good(n, k, a):\r\n count = 0\r\n for i in range(n):\r\n flag = True\r\n for j in range(k+1):\r\n if str(j) not in str(a[i]):\r\n flag = False\r\n break\r\n if flag:\r\n count += 1\r\n return count\r\n\r\nn, k = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(int(input().strip()))\r\nprint(k_good(n, k, a))\r\n", "n,m=map(int,input().split());c=0\r\nfor i in range(n):\r\n\ta=input()\r\n\tfor j in range(m+1):\r\n\t\tif str(j) not in a:break\r\n\telse:c+=1\r\nprint(c)", "n,k = map(int,input().split())\r\nk_lst = list()\r\ncount = 0\r\ndef Good(a,k):\r\n cnt = 0\r\n for i in k:\r\n if i in a:\r\n cnt += 1\r\n if cnt == len(k) and len(a) >= len(k):\r\n return 1\r\n else:\r\n return 0\r\nk_lst = list(range(k+1))\r\nfor i in range(n):\r\n num = list(map(int, input()))\r\n count += Good(num,k_lst)\r\nprint(count)", "n, k = map(int, input().split())\r\ncnt = 0\r\nli = set([str(x) for x in range(k + 1)])\r\nfor num in range(n):\r\n want = input()\r\n if li.issubset(want):\r\n cnt += 1\r\nprint(cnt)", "n,k = map(int, input().split())\r\nc = 0\r\ns = 0\r\n \r\nlst = []\r\nfor i in range(k+1):\r\n lst += str(i)\r\n \r\nif k == 0:\r\n s = 1\r\n \r\nfor i in range(n):\r\n p = input()\r\n l = lst.copy()\r\n for i in range(s, len(p)):\r\n if p[i] in l:\r\n l.remove(p[i])\r\n \r\n if l == []:\r\n c += 1\r\n \r\nprint(c)", "n,k=map(int,input().split())\r\ncount=0\r\nfor i in range(n):\r\n a=input()\r\n for j in range(k+1):\r\n if str(j) in a:\r\n result=True\r\n else:\r\n result=False\r\n break\r\n if result==True:\r\n count+=1\r\nprint(count)", "n,k=map(int,input().split())\r\nresult=0\r\nfor i in range(n):\r\n count=0\r\n number=input()\r\n for j in range(k+1):\r\n if str(j) in number:\r\n count+=1\r\n if count==k+1:\r\n result+=1\r\nprint(result)\r\n ", "n,k=map(int,input().split())\ns=0\nfor i in range(n):\n num=input()\n for j in range(k+1):\n if str(j) in num:\n g = 1\n else:\n g = 0\n break\n if g==1:\n s+=1\nprint(s)", "n, k = map(int, input(). split())\r\ncount = 0\r\nc = 0\r\nb = []\r\nfor i in range(k + 1):\r\n b += str(i)\r\n if k == 0:\r\n c = 1\r\nfor i in range(n):\r\n s = input()\r\n l = b.copy()\r\n for i in range (c, len(s)):\r\n if s[i] in l:\r\n l.remove(s[i])\r\n if l == []:\r\n count += 1\r\nprint (count)", "n,k = map(int, input().split())\r\nGud=0\r\nx = list(range(0,k+1))\r\nfor i in range(n):\r\n lst = list(map(int, input()))\r\n num = []\r\n tem = list(sorted(list(set(lst))))\r\n if k != 0:\r\n num = tem[0:len(x)]\r\n else:\r\n if x[0] in lst:\r\n if lst[0] != 0:\r\n Gud+=1\r\n continue\r\n elif lst[0] == 0 and lst.count(0)>1:\r\n Gud+=1\r\n continue\r\n else:\r\n continue\r\n if x == num:\r\n Gud+=1\r\nprint(Gud)", "p, q = map(int, input().split())\r\nr = 0\r\nfor i in range(p):\r\n s = 0\r\n l = list(map(int, input()))\r\n for j in range(q+1):\r\n if j in l:\r\n s += 1\r\n if s == q + 1:\r\n r += 1\r\nprint(r)", "# /*\r\n# author: brownfox2k6\r\n# * created: Tue 18 Apr 2023 at 21:27:51 UTC+7, Hanoi, Vietnam\r\n# */\r\n\r\nn, k = map(int, input().split())\r\nans = 0\r\nfor _ in range(n):\r\n s = input()\r\n for i in range(0, k+1):\r\n if str(i) not in s:\r\n break\r\n else:\r\n ans += 1\r\n\r\nprint(ans)", "n , k = [int(x) for x in input().split()]\r\n\r\ngoods = n\r\nfor i in range(n):\r\n ins = set([x for x in input()])\r\n l = len(ins) \r\n b = 0\r\n\r\n for num in ins:\r\n if int(num) > k:\r\n b += 1\r\n\r\n if l - b < k + 1:\r\n goods -= 1\r\n\r\nprint(goods)", "n,k=map(int,input().split())\r\ngood=0\r\nfor i in range(n):\r\n a=list(map(int,input()))\r\n x=len(a)\r\n m=0\r\n while m<=k:\r\n if a.count(m)>0:\r\n m+=1\r\n else:\r\n break\r\n if m==k+1:\r\n good+=1\r\nprint(good)\r\n", "n, k = map(int, input().split())\r\n\r\ndef is_k_good(num, k):\r\n digits = set(str(num))\r\n for i in range(k+1):\r\n if str(i) not in digits:\r\n return False\r\n return True\r\n\r\ncount = 0\r\nfor i in range(n):\r\n if is_k_good(int(input()), k):\r\n count += 1\r\n\r\nprint(count)\r\n", "a,b = map(int, input().split())\r\nc=0\r\nfor i in range(a):\r\n n=input()\r\n m=0\r\n for j in range(b+1):\r\n if str(j) not in n:\r\n m=1\r\n break\r\n if m==0:\r\n c=c+1\r\nprint(c)", "# -- coding: utf-8 --\n\"\"\"Good number\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1pPJ9Sjuz6pNsnen9rySsuaTUuNM-KlYV\n\"\"\"\n\nn, k = map(int, input().split())\nc = 0\nd = 0\nfor i in range (n):\n a = input()\n for b in range (k+1):\n if str(b) in a:\n c = c + 1\n if c == k + 1:\n d += 1\n c = 0\nprint(d)", "n,k=map(int,input().split())\r\nl=[]\r\nl1=[]\r\nc=0\r\nfor i in range(n):\r\n a=input()\r\n l.append(a)\r\nfor i in range(k+1):\r\n l1.append(str(i))\r\nfor i in l:\r\n m=0\r\n for j in range(len(l1)):\r\n if l1[j] not in i:\r\n m=1\r\n if m!=1:\r\n c+=1\r\nprint(c)", "a,b=map(int,input().split())\r\nc=0\r\nfor i in range(a):\r\n l=list(map(int,input()))\r\n for j in range(b+1):\r\n if j not in l:\r\n break\r\n else:\r\n c+=1\r\n continue \r\nprint(c)\r\n ", "s = 0\r\nn,k = map(int,input().split())\r\nr = []\r\nfor i in range(k+1):\r\n r.append(str(i))\r\n\r\nfor i in range(n):\r\n d = list(set(input()))\r\n c = 0\r\n for i in range(k+1):\r\n if(r[i] in d):\r\n c = c + 1\r\n \r\n if(c==k+1):\r\n s = s +1 \r\n \r\nprint(s) ", "n,s=map(int,input().split())\r\nB=0\r\nfor i in range(n):\r\n R=0\r\n x=input()\r\n for i in range(s+1):\r\n if str(i) in x:\r\n R=R+1\r\n if R==s+1:\r\n B=B+1\r\nprint(B)", "n, k = map(int, input().split())\r\ncount = 0\r\n\r\nfor _ in range(n):\r\n check = True\r\n a = list(set((input())))\r\n if len(set(a)) > k:\r\n a = sorted([int(i) for i in a])\r\n if a[k] == k:\r\n count += 1\r\n\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\ncount = 0\r\n\r\nfor _ in range(n):\r\n ai = input().strip()\r\n digits = set(ai)\r\n\r\n is_k_good = all(str(digit) in digits for digit in range(k+1))\r\n\r\n if is_k_good:\r\n count += 1\r\n\r\nprint(count)\r\n", "from sys import stdin, stdout\r\n\r\nn, k = tuple(map(int, stdin.readline().split()))\r\nmain_set = {str(i) for i in range(k + 1)}\r\nnumberOfGoodNumbers = 0\r\nfor _ in range(n):\r\n numberOfGoodNumbers += 1 if main_set.issubset(set(stdin.readline().rstrip())) else 0\r\nstdout.write(str(numberOfGoodNumbers))", "import sys\ninput = sys.stdin.readline\n\ndef solve(n,k):\n temp = n\n d = set()\n while n:\n n , c = divmod(n,10)\n d.add(c)\n for i in range(0,k+1):\n if i not in d:\n return False\n return True\n\nt , k = map(int,input().split())\nres = 0\nfor _ in range(t):\n n = int(input())\n res+=solve(n,k)\nprint(res)\n ", "n, k = map(int, input().split())\r\n\r\ncount = 0\r\nfor i in range(n):\r\n a = input().strip()\r\n if all(str(j) in a for j in range(k+1)):\r\n count += 1\r\n\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\nc = 0\r\nk = [str(x) for x in range(m+1)]\r\nfor _ in range(n):\r\n flag = True\r\n a = input()\r\n for i in k:\r\n if i not in a:\r\n flag = False\r\n break\r\n if flag:\r\n c += 1\r\nprint(c)", "a, b = map(int,input().split())\r\nm = 0\r\nfor i in range(a):\r\n h = input()\r\n l = len(h)\r\n n = []\r\n o = 0\r\n for j in range(l):\r\n n.append(eval(h[j]))\r\n for x in range(b+1):\r\n if x in n:\r\n o += 1\r\n if o == b+1:\r\n m += 1\r\n\r\n \r\n\r\nprint(m)\r\n", "n,k = map(int,input().split())\r\ngood = 0\r\ns = list(range(0,k+1))\r\nfor i in range(n):\r\n lst = list(map(int,input()))\r\n nums = []\r\n tem = list(sorted(list(set(lst))))\r\n if k!=0:\r\n nums = tem[0:len(s)]\r\n else:\r\n if s[0] in lst:\r\n if lst[0]!=0:\r\n good = good+1\r\n continue\r\n elif lst[0]==0 and lst.count(0)>1:\r\n good = good+1\r\n continue\r\n else:\r\n continue\r\n if s==nums:\r\n good= good+1\r\nprint(good)", "a,b=map(int,input().split())\r\nx=0\r\nfor i in range(a):\r\n s=input()\r\n count=0\r\n for j in range(b+1):\r\n if str(j) in s:\r\n count=count+1\r\n if count==b+1:\r\n x=x+1\r\nprint(x)", "n, k = map(int, input().split())\n\ncounter = 0\nans = 0\n\nst = set()\n\nfor i in range(n):\n s = input()\n for j in range(len(s)):\n if int(s[j])%10 <= k:\n st.add(s[j])\n\n if len(st) == k+1:\n ans += 1\n st.clear()\n\nprint(ans)\n\t\t \t \t \t\t \t\t \t \t \t\t\t \t\t", "n,a=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n x=list(input())\r\n d=0\r\n for i in range(a+1):\r\n if str(i) in x:\r\n d+=1\r\n if d==a+1:\r\n c+=1\r\nprint(c)\r\n ", "n, k = [int(x) for x in input().split()]\r\nx = 0\r\nfor i in range(0, n):\r\n a = input()\r\n if set(map(int, a)).issuperset(set(range(0, k+1))):\r\n x += 1\r\nprint(x)\r\n", "n,k = [int(x) for x in input().split()]\r\nans = 0\r\nfor i in range(n):\r\n store = set()\r\n for x in input():\r\n store.add(int(x))\r\n possible = True\r\n for i in range(k+1):\r\n if i not in store:\r\n possible=False\r\n break\r\n if possible:\r\n ans+=1\r\nprint(ans)\r\n \r\n", "n,k=map(int,input().split())\r\nr=0\r\nwhile n:\r\n a=input()\r\n r+=all(a.count(str(i))for i in range(k+1))\r\n n-=1\r\nprint(r)\r\n", "n,s=map(int,input().split())\r\nu=0\r\nfor i in range(n):\r\n c=0\r\n x=input()\r\n for i in range(s+1):\r\n if str(i) in x:\r\n c=c+1\r\n if c==s+1:\r\n u=u+1\r\nprint(u)\r\n \r\n", "n,k = map(int, input().split())\r\ncount=0\r\nfor i in range(n):\r\n a=0\r\n num=input()\r\n for i in range(k+1):\r\n if str(i) in num:\r\n a+=1\r\n if a==(k+1):\r\n count+=1\r\nprint(count)", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n b=0\r\n x=input()\r\n for i in range(k+1):\r\n if str(i) in x:\r\n b=b+1\r\n if b==k+1:\r\n c=c+1\r\nprint(c)", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n a=input()\r\n m=0\r\n for j in range(k+1):\r\n if str(j) in a:\r\n m=m+1\r\n if m==k+1:\r\n c=c+1\r\nprint(c)\r\n", "n,k=map(int,input().split())\r\ngood_lists=0\r\nfor i in range(n):\r\n good_numb=0\r\n input_array=list(map(int,input()))\r\n for x in range(k+1):\r\n if x in input_array:\r\n good_numb+=1\r\n if good_numb==k+1:\r\n good_lists+=1\r\nprint(good_lists) ", "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,k = li()\r\nans = 0\r\nfor _ in range(n):\r\n x = input()\r\n flag = 1\r\n for i in range(k+1):\r\n if str(i) not in x:\r\n flag = 0\r\n break\r\n ans += 1 if flag else 0\r\nprint(ans)", "n, k = map(int, input().split())\r\ncount = 0\r\nfor i in range(n):\r\n a = set(input().strip())\r\n if all(str(j) in a for j in range(k+1)):\r\n count += 1\r\nprint(count)", "n,k=map(int, input().split())\r\na=0\r\nfor i in range(n):\r\n x = list(map(int, input()))\r\n for j in range(k+1):\r\n if j not in x:\r\n break\r\n else:\r\n a+=1\r\nprint(a)", "n, t = map(int, input().split())\r\nA = []\r\nfor _ in range(n):\r\n x = input()\r\n A.append(x)\r\n\r\ns = 0\r\nB = list(range(t + 1))\r\n\r\nfor i in range(len(A)):\r\n num_str = str(A[i])\r\n e = True\r\n\r\n for digit in B:\r\n if str(digit) not in num_str:\r\n e = False\r\n break \r\n\r\n if e:\r\n s += 1 \r\n\r\nprint(s)\r\n", "n,k=map(int,input().split())\r\nans = 0\r\nfor i in range (0,n):\r\n q = {int(x) for x in input()}\r\n if set(range(0,k+1))<=q:\r\n ans+=1\r\nprint (ans)\r\n", "def solve(n,h,a):\r\n res=0\r\n for i in range(n):\r\n for j in range(h+1):\r\n if str(j) not in a[i]:\r\n break\r\n else:\r\n res+=1\r\n return res \r\n \r\n \r\nn,h=map(int,input().split())\r\n# a=list(map(int,input().split()))\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\n# n=int(input())\r\n# s=input()\r\n# s1=input()\r\nprint(solve(n,h,a))", "from sys import stdin\r\nn, k = [int(x) for x in stdin.readline().strip().split(\" \")]\r\narray = []\r\nfor i in range(k + 1):\r\n array.append(str(i))\r\ncont = 0\r\nnumbers = []\r\nfor i in range(n):\r\n number = int(stdin.readline().strip())\r\n numbers.append(number)\r\nfor i in numbers:\r\n flag = True\r\n for j in array:\r\n if j not in str(i):\r\n flag = False\r\n break\r\n if flag == False:\r\n cont += 1\r\nprint(n - cont)", "n,s=map(int,input().split())\r\nu = 0\r\nfor i in range(n):\r\n c = 0\r\n a = input()\r\n for i in range (s + 1):\r\n if str(i) in a:\r\n c = c+1\r\n if c==s+1:\r\n u = u+1\r\nprint(u)", "n, k = map(int, input().split())\r\ncount = 0\r\n\r\nfor _ in range(n):\r\n num = input().strip()\r\n is_k_good = True\r\n for digit in range(k + 1):\r\n if str(digit) not in num:\r\n is_k_good = False\r\n break\r\n if is_k_good:\r\n count += 1\r\n\r\nprint(count)\r\n", "b=list(map(int,input().split()))\r\nc=0\r\nfor i in range(b[0]):\r\n a=input()\r\n for j in range(0,(b[1]+1)):\r\n if str(j) in a:\r\n k=1\r\n else:\r\n k=0\r\n break\r\n if k==1:\r\n c=c+1\r\nprint(c)", "#A good number\r\nn,k=map(int, input().split())\r\ncount=0\r\nfor i in range(n):\r\n x=0\r\n l=list(map(int, input()))\r\n for j in range(k+1):\r\n if j in l:\r\n x+=1\r\n if x==k+1:\r\n count+=1\r\nprint(count)", "n,m=map(int,input().split())\r\nans = 0\r\nfor i in range(n):\r\n a = input().strip()\r\n c = [True](m+1)\r\n for k in a:\r\n if k<=str(m):\r\n c[int(k)] = False\r\n if c.count(True)==0:\r\n ans+=1\r\nprint(ans)\r\n", "def main():\n\n inp = input().split()\n n = int(inp[0])\n k = int(inp[1])\n numbers = [input() for i in range(n)]\n for i in range(n):\n number = numbers[i]\n numbers[i] = []\n for letter in number:\n numbers[i].append(int(letter))\n \n counter = 0\n for element in numbers:\n flag = True\n for i in range(0, k+1):\n if i not in element:\n flag = False\n continue\n if flag:\n counter += 1\n\n print(counter)\n\n return 0\n\nif __name__ == \"__main__\":\n main()", "n, k = map(int, input().split(\" \"))\r\nresult = 0\r\nfor _ in range(n):\r\n line = list(input())\r\n currently = set()\r\n for i in line:\r\n if 0 <= int(i) <= k and int(i) not in currently:\r\n currently.add(i)\r\n if len(currently) == k + 1:\r\n break\r\n result += len(currently) == (k + 1)\r\n\r\nprint(result)\r\n", "n, k = list(map(int, input().split()))\r\nc = 0\r\nk_set = set(map(str, range(k + 1)))\r\n\r\nfor x in range(n):\r\n z = set(input())\r\n if k_set.issubset(z):\r\n c += 1\r\nprint(c)\r\n", "lst = [w.rstrip() for w in open(0).readlines()]\r\nn, k = map(int, lst[0].split())\r\ns = {str(i) for i in range(k+1)}\r\nres = sum(1 for x in lst[1:] if len(s & set(list(x))) == k+1)\r\nprint(res)", "numbers=list(map(int,input().split()))\r\nn=numbers[0] \r\nm=numbers[1] \r\nnum=\"\"\r\nans=True\r\ncount=0\r\nfor i in range(n): \r\n num=input() \r\n ans=True\r\n for j in range(m+1):\r\n if not num.__contains__(str(j)):\r\n ans=False\r\n break\r\n \r\n if ans :\r\n count+=1\r\n\r\n \r\nprint(count) \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n,k=map(int,input().split())\r\ncount=0\r\nfor i in range(n):\r\n c=True\r\n a=input()\r\n for j in range(k+1):\r\n if str(j) not in a:\r\n c=False\r\n if c:\r\n count+=1\r\nprint(count)", "n,k=map(int,input().split())\r\nu=0 \r\nfor i in range(n):\r\n c=0\r\n a=input()\r\n for i in range(k+1):\r\n if str(i) in a:\r\n c=c+1\r\n if c==k+1:\r\n u=u+1\r\nprint(u)", "n, k = map(int, input().split())\r\ns = set('0123456789'[:k+1])\r\nj = 0\r\nfor i in range(n):\r\n b=input()\r\n if set(b) >= s:\r\n j +=1\r\nprint(j)", "n,k=map(int,input().split())\r\ny=0\r\nfor i in range(n):\r\n t=list(input())\r\n for j in range(k+1):\r\n if str(j) in t:\r\n x=1\r\n else:\r\n x=0\r\n break\r\n if x==1:\r\n y+=1\r\nprint(y)\r\n \r\n", "(n, k) = map(int, input().split())\r\n \r\ncount = 0\r\n \r\nfor i in range(n):\r\n s = map(int, input())\r\n st = set()\r\n for item in s:\r\n if item > k:\r\n pass\r\n else:\r\n st.add(item)\r\n else:\r\n if len(st) == k + 1:\r\n count += 1\r\n \r\n \r\nprint (count)", "n, k = map(int, input().split())\r\nk_set = set(range(k + 1))\r\nk_good = 0\r\nfor i in range(n):\r\n if k_set.issubset(set(map(int, input()))):\r\n k_good += 1\r\nprint(k_good)", "def solve():\r\n n, k = list(map(int, input().split()))\r\n\r\n ss = set()\r\n for i in range(k+1):\r\n ss.add(str(i))\r\n \r\n counter = 0\r\n for _ in range(n):\r\n number = set(list(input()))\r\n if len(ss.intersection(number)) == k+1:\r\n counter +=1\r\n print(counter)\r\nsolve()", "import pdb\r\nnk = input().split()\r\n\r\narr = []\r\nfor q in range(int(nk[0])):\r\n arr.append(input())\r\n\r\ncounter = 0\r\ndata = list(range(int(nk[1])+1)) #digits list\r\nfor q in data:\r\n data[q] = str(data[q])\r\n\r\nfor q in range(int(nk[0])):\r\n c_data = data.copy()\r\n \r\n for i in range(int(nk[1])+1):\r\n if data[i] in arr[q]:\r\n c_data.remove(data[i])\r\n if not c_data:\r\n counter +=1\r\n\r\nprint(counter)", "n,k=map(int,input().split())\r\nr=0\r\nfor i in range(n):\r\n c=0\r\n a=input()\r\n for i in range(k+1):\r\n if str(i) in a:\r\n c+=1\r\n if c==k+1:\r\n r+=1\r\nprint(r)\r\n ", "x, y = list(map(int, input().split()))\r\nc = 0\r\nd = 0\r\nfor i in range(x):\r\n a = input()\r\n for b in range(y+1):\r\n if str(b) in a:\r\n c += 1\r\n if c == y+1:\r\n d += 1\r\n c = 0\r\nprint(d)", "\r\ndef g(a, k):\r\n if a == 0:\r\n return k == 0\r\n s = set()\r\n while a > 0:\r\n if a % 10 <= k:\r\n s.add(a % 10)\r\n a //= 10\r\n return len(s) == k + 1\r\n \r\nn, k = (int(x) for x in input().split())\r\nprint(sum(g(int(input()), k) for i in range(n)))", "n,k = map(int, input().split())\r\nc = 0\r\nfor i in range(n):\r\n l = sorted(list(set(input())))\r\n if len(l) >= k+1:\r\n c += 1 if l[k] == str(k) else 0\r\n \r\nprint(c)", "n,k=map(int,input().split())\r\ng=0\r\nfor i in range(n):\r\n ct=0\r\n a=list(map(int,input()))\r\n for j in range(k+1):\r\n if j in a:\r\n ct+=1\r\n if ct==k+1:\r\n g+=1\r\nprint(g) \r\n", "x,y=map(int,input().split())\r\na=0\r\nfor i in range(x):\r\n b = input()\r\n l={'a'}\r\n for ff in b:\r\n if ff<=str(y)[0]:\r\n l.add(ff)\r\n if len(l)==y+2:\r\n a+=1\r\nprint(a)", "n,k=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(n):\r\n s=input()\r\n if not any(str(j) not in s for j in range(k+1)):\r\n sum+=1\r\nprint(sum)", "n , k = [int(i) for i in input().split()]\r\nnums = [0] * n\r\n\r\nfor i in range(n):\r\n nums[i] = input()\r\n\r\nmemory = []\r\nres = 0\r\nfor i in range(n):\r\n for d in nums[i]:\r\n if not d in memory and int(d) <= k:\r\n memory.append(d) \r\n\r\n if len(memory) == k + 1:\r\n res += 1\r\n\r\n memory = []\r\n\r\nprint(res)", "n, k = map(int, input().split())\ncount = 0\nfor i in range(n):\n a = input().strip()\n found = True\n for j in range(k+1):\n if str(j) not in a:\n found = False\n break\n if found:\n count += 1\nprint(count)\n \t \t \t \t \t\t\t\t\t\t\t\t \t\t \t \t", "n,k=map(int,input().split())\r\nl=[]\r\nm=[]\r\ncount=0\r\nfor i in range(n):\r\n a=input()\r\n l.append(a)\r\nfor i in range(k+1):\r\n m.append(str(i))\r\nfor i in range(len(l)):\r\n x=0\r\n for j in range(len(m)):\r\n if m[j] not in l[i]:\r\n x=1\r\n if x!=1:\r\n count=count+1 \r\nprint(count)", "n, k = map(int, input().split())\r\na = [int(input()) for _ in range(n)]\r\nresult = 0\r\nfor num in a:\r\n is_good = True\r\n for i in range(k+1):\r\n if str(i) not in str(num):\r\n is_good = False\r\n break\r\n if is_good:\r\n result += 1\r\nprint(result)\r\n", "def is_number_good(number: str, k: int) -> int:\r\n for num in range(k + 1):\r\n if str(num) not in number:\r\n return 0\r\n\r\n return 1\r\n\r\nn, k = map(int, input().split(' '))\r\n\r\ncounter = 0\r\nfor i in range(n):\r\n counter += is_number_good(input(), k)\r\n\r\nprint(counter)\r\n", "n,s=map(int,input().split())\r\nu = 0\r\nfor i in range(n):\r\n c=0\r\n a = input()\r\n for i in range (s+1):\r\n if str(i) in a:\r\n c= c+1\r\n if c==s+1:\r\n u= u+1\r\nprint(u)\r\n " ]	{"inputs": ["10 6\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560", "2 1\n1\n10", "1 0\n1000000000", "1 1\n1000000000", "6 0\n10\n102\n120\n1032\n1212103\n1999999", "1 3\n1000000000", "1 9\n1000000000", "1 0\n1", "1 1\n1", "1 3\n1", "1 9\n1", "2 8\n123456780\n123", "2 8\n12345678\n1230", "6 1\n10\n102\n120\n1032\n1212103\n1999999", "6 2\n10\n102\n120\n1032\n1212103\n1999999", "6 3\n10\n102\n120\n1032\n1212103\n1999999", "6 9\n10\n102\n120\n1032\n1212103\n1999999", "1 2\n2220"], "outputs": ["10", "1", "1", "1", "5", "0", "0", "0", "0", "0", "0", "1", "0", "5", "4", "2", "0", "0"]}	UNKNOWN	PYTHON3	CODEFORCES	318
90e34ecfae4b0a43ec885c28e8b50ef6	Фото на память - 2 (round version)	Прошло много лет, и на вечеринке снова встретились n друзей. С момента последней встречи техника шагнула далеко вперёд, появились фотоаппараты с автоспуском, и теперь не требуется, чтобы один из друзей стоял с фотоаппаратом, и, тем самым, оказывался не запечатлённым на снимке. Упрощенно процесс фотографирования можно описать следующим образом. На фотографии каждый из друзей занимает прямоугольник из пикселей: в стоячем положении i-й из них занимает прямоугольник ширины wi пикселей и высоты hi пикселей. Но также, при фотографировании каждый человек может лечь, и тогда он будет занимать прямоугольник ширины hi пикселей и высоты wi пикселей. Общая фотография будет иметь размеры W<=×<=H, где W — суммарная ширина всех прямоугольников-людей, а H — максимальная из высот. Друзья хотят определить, какую минимальную площадь может иметь общая фотография. Помогите им в этом. В первой строке следует целое число n (1<=≤<=n<=≤<=1000) — количество друзей. В последующих n строках следуют по два целых числа wi,<=hi (1<=≤<=wi,<=hi<=≤<=1000), обозначающие размеры прямоугольника, соответствующего i-му из друзей. Выведите единственное целое число, равное минимальной возможной площади фотографии, вмещающей всех друзей. Sample Input 3 10 1 20 2 30 3 3 3 1 2 2 4 3 1 5 10 Sample Output 180 21 50	[ "n = int(input())\r\n\r\ninf = 10*9 + 11\r\narr = []\r\n\r\nfor i in range(n):\r\n wh = list(map(int, input().split()))\r\n wh.sort()\r\n arr.append(wh)\r\n \r\nbest_S = inf\r\ncur_S = 0\r\n\r\nfor h in range(1, 1001):\r\n cur_S = 0\r\n for j in range(n):\r\n if arr[j][0] > h:\r\n cur_S = inf\r\n break\r\n if arr[j][1] <= h:\r\n cur_S += arr[j][0]\r\n else:\r\n cur_S += arr[j][1]\r\n best_S = min(best_S, cur_S h)\r\n \r\nprint(best_S)\r\n \r\n\r\n", "n = int(input().rstrip())\r\nd = []\r\nfor i in range(n):\r\n w, h = map(int, input().rstrip().split())\r\n d.append([w, h])\r\ns = '.' \r\nfor i in range(len(d)):\r\n h = d[i][0]\r\n w = d[i][1]\r\n f = 1\r\n for j in range(len(d)):\r\n if j != i:\r\n if d[j][0] <= h and d[j][1] <= h:\r\n w += min(d[j][0], d[j][1])\r\n elif d[j][0] <= h and d[j][1] > h:\r\n w += d[j][1]\r\n elif d[j][0] > h and d[j][1] <= h:\r\n w += d[j][0]\r\n else:\r\n f = 0\r\n if not f == 0:\r\n if s == '.' or h * w < s:\r\n s = h * w\r\n h = d[i][1]\r\n w = d[i][0]\r\n f = 1\r\n for j in range(len(d)):\r\n if j != i:\r\n if d[j][0] <= h and d[j][1] <= h:\r\n w += min(d[j][0], d[j][1])\r\n elif d[j][0] <= h and d[j][1] > h:\r\n w += d[j][1]\r\n elif d[j][0] > h and d[j][1] <= h:\r\n w += d[j][0]\r\n else:\r\n f = 0\r\n if not f == 0:\r\n if s == '.' or h * w < s:\r\n s = h * w \r\nprint(s) \r\n ", "import sys\r\nfrom typing import Counter\r\n\r\ninput = sys.stdin.readline\r\ndef print(args, end='\\n', sep=' '):\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef solve():\r\n n = int(input())\r\n set_ = set()\r\n data = []\r\n max_of_min = 0\r\n for _ in range(n):\r\n w, h = map(int, input().split())\r\n min_ = min(w, h)\r\n max_ = max(w, h)\r\n data.append((min_, max_))\r\n set_.add(w)\r\n set_.add(h)\r\n max_of_min = max(max_of_min, min_)\r\n ans = Counter()\r\n for x in set_:\r\n if x >= max_of_min:\r\n for min_, max_ in data:\r\n if max_ <= x:\r\n ans[x] += min_\r\n else:\r\n ans[x] += max_\r\n min_ = max_of_min ans[max_of_min]\r\n for k, v in ans.items():\r\n min_ = min(min_, k * v)\r\n print(min_)\r\n\r\ndef main():\r\n t = 1#int(input())\r\n for _ in range(t):\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a = []\r\nheights = []\r\nwid = 0\r\nhei = 0\r\nheim = 1000\r\nn = int(input())\r\nfor i in range(n):\r\n w, h = map(int, input().split())\r\n if (w > h):\r\n x = w\r\n w = h\r\n h = x\r\n wid += w\r\n if (hei < h):\r\n hei = h\r\n if (heim > w):\r\n heim = w\r\n a.append((h, w))\r\nlast = wid * hei\r\nfor i in range(heim, hei + 1):\r\n wid1 = 0\r\n hei1 = i\r\n for j in range(0, n):\r\n if a[j][0] <= i:\r\n wid1 += a[j][1]\r\n else:\r\n if (a[j][1] <= i):\r\n wid1 += a[j][0]\r\n else:\r\n wid1 += 1000000000\r\n break\r\n if (wid1 * i < last):\r\n last = wid1 * i\r\nprint(last)\r\n\r\n \r\n \r\n", "import sys\r\nfrom math import \r\nfrom collections import Counter,defaultdict,deque\r\ninput=sys.stdin.readline\r\nmod=109+7\r\ndef get_ints():return map(int,input().split())\r\ndef get_int():return int(input())\r\ndef get_array():return list(map(int,input().split()))\r\ndef input():return sys.stdin.readline().strip()\r\n\r\n# for _ in range(int(input())):\r\nn=get_int()\r\na=[]\r\nfor i in range(n):\r\n w,h=get_ints()\r\n a.append([min(w,h),max(w,h)])\r\n# print(a)\r\nans=inf\r\nfor i in range(1001):\r\n val=0\r\n for j in range(n):\r\n if a[j][0]<=i and a[j][1]<=i:\r\n val+=a[j][0]\r\n elif a[j][0]>i and a[j][1]>i:\r\n val=inf\r\n break\r\n elif a[j][0]<=i and a[j][1]>i:\r\n val+=a[j][1]\r\n ans=min(ans,vali)\r\nprint(ans)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\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\n\r\n\r\ndef lcm(a, b):\r\n return (a * b) / gcd(a, b)\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = []\r\n for i in range(n):\r\n a.append(list(map(int, input().split())))\r\n ans=float('inf')\r\n for i in range(1,1001):\r\n f=1\r\n curr=0\r\n for j in a:\r\n if j[0]>i and j[1]>i:\r\n f=0\r\n break\r\n else:\r\n if j[0] <= i and j[1] <= i:\r\n curr+=min(j[0], j[1])\r\n else:\r\n curr+=max(j[0], j[1])\r\n if f:\r\n #print(i,curr)\r\n ans=min(ans, curri)\r\n print(ans)\r\n\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def main():\n import sys\n \n tokens = [int(i) for i in sys.stdin.read().split()]\n tokens.reverse()\n \n n = tokens.pop()\n people = [(tokens.pop(), tokens.pop()) for i in range(n)]\n \n result = float(\"inf\")\n for i in range(n):\n for j in range(2):\n maxh = people[i][j]\n S = people[i][j ^ 1]\n for k in range(n):\n if k != i:\n w, h = people[k]\n w, h = min(w, h), max(w, h)\n if w > maxh:\n S = float(\"inf\")\n break\n if h > maxh:\n S += h\n else:\n S += w\n result = min(result, S maxh)\n \n print(result)\n \n \n \nmain()\n" ]	{"inputs": ["3\n10 1\n20 2\n30 3", "3\n3 1\n2 2\n4 3", "1\n5 10", "10\n168 538\n836 439\n190 873\n206 47\n891 591\n939 481\n399 898\n859 466\n701 777\n629 222", "42\n13 62\n114 242\n265 839\n756 349\n298 476\n533 704\n348 277\n554 573\n654 112\n429 836\n574 766\n909 415\n163 891\n532 983\n873 457\n719 117\n1 302\n170 634\n166 585\n721 231\n208 609\n128 246\n845 726\n604 119\n859 110\n568 515\n656 913\n113 166\n794 566\n834 860\n983 596\n545 819\n167 9\n960 73\n260 607\n173 378\n417 938\n362 819\n800 939\n246 834\n746 440\n42 643", "3\n379 820\n923 407\n916 853", "3\n99 768\n477 885\n169 118", "3\n227 612\n223 259\n423 895", "3\n651 161\n480 32\n485 672", "3\n779 301\n34 214\n442 937", "3\n203 145\n780 692\n992 713", "3\n627 286\n37 65\n53 490", "3\n755 938\n487 543\n307 459", "3\n475 487\n41 20\n368 236", "3\n922 71\n719 26\n462 700", "2\n881 4\n788 2", "2\n1 304\n8 892", "3\n227 2\n223 9\n423 5", "3\n7 612\n3 259\n3 895", "4\n573 7\n169 9\n447 7\n947 3", "4\n3 817\n9 729\n7 407\n7 433", "10\n864 874\n534 702\n73 363\n856 895\n827 72\n435 468\n888 921\n814 703\n648 715\n384 781", "10\n489 685\n857 870\n736 221\n687 697\n166 360\n265 200\n738 519\n393 760\n66 176\n798 160", "1\n1 1", "1\n1000 1000", "1\n1 1000", "2\n1 1000\n1000 1", "2\n1 1\n1000 1000", "1\n1000 1", "2\n1 1\n1 1", "3\n1 4\n1 4\n1 1", "2\n2 1\n3 1", "2\n4 3\n2 1", "5\n78 94\n8 53\n81 8\n41 11\n57 57", "8\n1 8\n1 8\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1"], "outputs": ["180", "21", "50", "3478056", "13474964", "1512797", "614190", "731790", "455616", "728049", "1366821", "235752", "1307660", "352925", "515398", "5286", "8028", "6768", "11635", "19224", "21242", "4909752", "3231747", "1", "1000000", "1000", "2000", "1001000", "1000", "2", "9", "5", "15", "14418", "22"]}	UNKNOWN	PYTHON3	CODEFORCES	7
912f39a3ff6a9f5dd8230e1c50920c4f	none	Little Chris is very keen on his toy blocks. His teacher, however, wants Chris to solve more problems, so he decided to play a trick on Chris. There are exactly s blocks in Chris's set, each block has a unique number from 1 to s. Chris's teacher picks a subset of blocks X and keeps it to himself. He will give them back only if Chris can pick such a non-empty subset Y from the remaining blocks, that the equality holds: For example, consider a case where s<==<=8 and Chris's teacher took the blocks with numbers 1, 4 and 5. One way for Chris to choose a set is to pick the blocks with numbers 3 and 6, see figure. Then the required sums would be equal: (1<=-<=1)<=+<=(4<=-<=1)<=+<=(5<=-<=1)<==<=(8<=-<=3)<=+<=(8<=-<=6)<==<=7. However, now Chris has exactly s<==<=106 blocks. Given the set X of blocks his teacher chooses, help Chris to find the required set Y! The first line of input contains a single integer n (1<=≤<=n<=≤<=5·105), the number of blocks in the set X. The next line contains n distinct space-separated integers x1, x2, ..., xn (1<=≤<=xi<=≤<=106), the numbers of the blocks in X. Note: since the size of the input and output could be very large, don't use slow output techniques in your language. For example, do not use input and output streams (cin, cout) in C++. In the first line of output print a single integer m (1<=≤<=m<=≤<=106<=-<=n), the number of blocks in the set Y. In the next line output m distinct space-separated integers y1, y2, ..., ym (1<=≤<=yi<=≤<=106), such that the required equality holds. The sets X and Y should not intersect, i.e. xi<=≠<=yj for all i, j (1<=≤<=i<=≤<=n; 1<=≤<=j<=≤<=m). It is guaranteed that at least one solution always exists. If there are multiple solutions, output any of them. Sample Input 3 1 4 5 1 1 Sample Output 2 999993 10000001 1000000	[ "import sys\r\nINF = 1020\r\nMOD = 109 + 7\r\nI = lambda:list(map(int,input().split()))\r\nfrom math import gcd\r\nfrom math import ceil\r\nfrom collections import defaultdict as dd, Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\n\r\n\r\n\"\"\"\r\nFacts and Data representation\r\nConstructive? Top bottom up down\r\n\"\"\"\r\nn, = I()\r\na = I()\r\nM = 10 ** 6 + 1\r\ntake = [0] * M\r\nfor i in a:\r\n take[i] = 1\r\n\r\nans = []\r\nok = []\r\ncnt = 0\r\nfor i in range(1, M // 2 + 1):\r\n if take[i] and take[M - i]:\r\n cnt += 1\r\n elif not take[i] and not take[M - i]:\r\n ok.append((i, M - i))\r\n elif take[i]:\r\n ans.append(M - i)\r\n else:\r\n ans.append(i)\r\n\r\nfor i in range(cnt):\r\n ans.append(ok[i][0])\r\n ans.append(ok[i][1])\r\n\r\nprint(len(ans))\r\nprint(*ans)" ]	{"inputs": ["3\n1 4 5", "1\n1", "1\n1000000", "2\n2 999999", "9\n1 2 3 100 500000 500001 999901 999997 999999", "3\n999998 999999 1000000", "3\n1 2 3", "3\n5 345435 999996", "6\n1 10 100 1000 10000 1000000", "2\n1 1000000", "2\n500000 500001", "4\n1 2 999999 1000000", "10\n63649 456347 779 458642 201571 534312 583774 283450 377377 79066", "10\n1 100000 199999 299998 399997 499996 599995 699994 799993 899992"], "outputs": ["3\n999996 999997 1000000 ", "1\n1000000 ", "1\n1 ", "2\n1 1000000 ", "9\n4 5 6 7 999994 999995 999996 999998 1000000 ", "3\n1 2 3 ", "3\n999998 999999 1000000 ", "3\n1 654566 1000000 ", "6\n2 990001 999001 999901 999991 999999 ", "2\n2 999999 ", "2\n1 1000000 ", "4\n3 4 999997 999998 ", "10\n416227 465689 541359 543654 622624 716551 798430 920935 936352 999222 ", "10\n100009 200008 300007 400006 500005 600004 700003 800002 900001 1000000 "]}	UNKNOWN	PYTHON3	CODEFORCES	1
9136cb00808749220dc6c0007520b499	Insomnia cure	«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine. However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic. How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons? Input data contains integer numbers k,<=l,<=m,<=n and d, each number in a separate line (1<=≤<=k,<=l,<=m,<=n<=≤<=10, 1<=≤<=d<=≤<=105). Output the number of damaged dragons. Sample Input 1 2 3 4 12 2 3 4 5 24 Sample Output 12 17	[ "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ny=int(input())\r\nif a==1 or b==1 or d==1 or c==1:\r\n print(y)\r\nelse:\r\n h=set()\r\n for i in range(1,y+1):\r\n if i%a!=0 and i%b!=0 and i%c!=0 and i%d!=0 :\r\n h.add(i)\r\n print(y-len(h))", "\r\nk =int(input())\r\nl =int(input())\r\nm =int(input())\r\nn =int(input())\r\nd =int(input())\r\n\r\n\r\ndp=[0]d\r\nfor i in range(1,d+1):\r\n if i %k ==0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n dp[i-1] = 1\r\nprint(sum(dp))", "#using inclusion exclusion principle \ndef lcm(l):\n if len(l)==2:\n for i in range(1,l[0]l[1]+1):\n if i%l[0]==0 and i%l[1]==0:\n return i\n if len(l)==3:\n for i in range(1,l[0]l[1]l[2]+1):\n if i%l[0]==0 and i%l[1]==0 and i%l[2]==0:\n return i\n if len(l)==4:\n for i in range(1,l[0]l[1]l[2]l[3]+1):\n if i%l[0]==0 and i%l[1]==0 and i%l[2]==0 and i%l[3]==0:\n return i\n\na=int(input())\nb=int(input())\nc=int(input())\nd=int(input())\nn=int(input())\nlcm_ab=n//lcm([a,b])\nlcm_ac=n//lcm([a,c])\nlcm_ad=n//lcm([a,d])\nlcm_bc=n//lcm([b,c])\nlcm_bd=n//lcm([b,d])\nlcm_cd=n//lcm([c,d])\nlcm_abc=n//lcm([a,b,c])\nlcm_abd=n//lcm([a,b,d])\nlcm_acd=n//lcm([a,c,d])\nlcm_bcd=n//lcm([b,c,d])\nlcm_abcd=n//lcm([a,b,c,d])\ndragons=(n//a+n//b+n//c+n//d)-(lcm_ab+lcm_ac+lcm_ad+lcm_bc+lcm_bd+lcm_cd)+(lcm_abc+lcm_abd+lcm_acd+lcm_bcd)-lcm_abcd\nprint(dragons)\n\n#alternate method but time inefficient\n\n'''a=int(input())\nb=int(input())\nc=int(input())\nd=int(input())\nn=int(input())\nl=[]\n\nif a==1 or b==1 or c==1 or d==1:\n print(n)\n\n\nelif a>n and b>n and c>n and d>n:\n\n print(0)\n \nelse:\n for i in range(1,n+1):\n l.append(i)\n damaged=[]\n for i in range(1,n+1,a):\n if i not in damaged:\n damaged.append(i)\n for i in range(1,n+1,b):\n if i not in damaged:\n damaged.append(i)\n for i in range(1,n+1,c):\n if i not in damaged:\n damaged.append(i)\n for i in range(1,n+1,d):\n if i not in damaged:\n damaged.append(i)\n print(len(damaged))'''\n \n ", "def ok(ak, d):\r\n for k in ak:\r\n if d < k:\r\n continue\r\n if d % k == 0:\r\n return True\r\n return False\r\n\r\n\r\nak = [int(input()), int(input()), int(input()), int(input())]\r\nd = int(input())\r\ns = 0\r\nfor i in range(1, d + 1):\r\n if ok(ak, i):\r\n s += 1\r\nprint(s)\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\n#d_list=[]\r\n\r\n#not_in_list=[]\r\n#c=0\r\n\r\n'''print(d//k + d//l + d//m + d//n - d//(kl) - d//(km) - d//(kn) - d//(lm) - d//(ln) - d//(mn) + d//(klm) + d//(lmn) + d//(mnk) + d//(kln) - 2d//(klmn))'''\r\n\r\n'''for i in range(1,d+1):\r\n d_list.append(i)\r\nfor i in range(k,d+1,k):\r\n d_list.remove(i)\r\nfor i in range(l,d+1,l):\r\n if i in d_list:\r\n d_list.remove(i)\r\nfor i in range(m,d+1,m):\r\n if i in d_list:\r\n d_list.remove(i)\r\nfor i in range(n,d+1,n):\r\n if i in d_list:\r\n d_list.remove(i)\r\nprint(d-len(d_list))'''\r\n\r\n'''for i in range(k,d+1,k):\r\n c+=1\r\n not_in_list.append(i)\r\nfor i in range(l,d+1,l):\r\n if i not in not_in_list:\r\n not_in_list.append(i)\r\n c+=1\r\nfor i in range(m,d+1,m):\r\n if i not in not_in_list:\r\n not_in_list.append(i)\r\n c+=1\r\nfor i in range(n,d+1,n):\r\n if i not in not_in_list:\r\n #not_in_list.append(i)\r\n c+=1\r\nprint(c)'''\r\n\r\nif k==1 or l==1 or m==1 or n==1:\r\n print(d)\r\nelse:\r\n count=d//k+d//l+d//m+d//n\r\n for i in range(l,d+1,l):\r\n if i%k==0:\r\n count-=1\r\n for i in range(m,d+1,m):\r\n if i%k==0 or i%l==0:\r\n count-=1\r\n for i in range(n,d+1,n):\r\n if i%k==0 or i%l==0 or i%m==0:\r\n count-=1\r\n print(count)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nlst = [0](d+1)\r\nw,x,y,z = 1,1,1,1\r\nwhile wk<=d or xl<=d or ym<=d or zn<=d:\r\n if wk<=d:\r\n lst[wk] = 1\r\n w+=1\r\n if xl<=d:\r\n lst[xl] = 1\r\n x+=1\r\n if ym<=d:\r\n lst[ym] = 1\r\n y+=1\r\n if zn<=d:\r\n lst[zn] = 1\r\n z+=1\r\ncnt = 0\r\nfor i in range(1,d+1):\r\n if lst[i] == 1:\r\n cnt+=1\r\nprint(cnt)", "def sol():\r\n k=int(input())\r\n l=int(input())\r\n m=int(input())\r\n n=int(input())\r\n d=int(input())\r\n cnt=0\r\n for i in range (1,d+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0:\r\n cnt=cnt+1\r\n\r\n print(cnt)\r\n \r\n \r\nsol()", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nif k==1 or l==1 or m==1 or n==1:\r\n print(d)\r\nelse:\r\n di={}\r\n escaped=0\r\n for i in range(1,d+1):\r\n di[i]=0\r\n for j in range(k,d+1,k):\r\n di[j]=1\r\n \r\n for j in range(l,d+1,l):\r\n di[j]=1\r\n for j in range(m,d+1,m):\r\n di[j]=1\r\n for j in range(n,d+1,n):\r\n di[j]=1\r\n for i in range(1,d+1):\r\n if di[i]==0:\r\n escaped+=1\r\n print(d-escaped)\r\n\r\n \r\n", "# Read input\r\nk = int(input()) # Dragons punched with frying pan\r\nl = int(input()) # Dragons with tail damage\r\nm = int(input()) # Dragons with paws trampled\r\nn = int(input()) # Dragons threatened by mom\r\nd = int(input()) # Total dragons\r\n\r\n# Initialize the count of damaged dragons\r\ndamaged_dragons = 0\r\n\r\n# Iterate over the dragons from 1 to d\r\nfor i in range(1, d + 1):\r\n # Check each condition and increment the count if the dragon gets damaged\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n damaged_dragons += 1\r\n\r\n# Print the count of damaged dragons\r\nprint(damaged_dragons)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nk = [i for i in range(0, d + 1, k)]\r\nl = [i for i in range(0, d + 1, l)]\r\nm = [i for i in range(0, d + 1, m)]\r\nn = [i for i in range(0, d + 1, n)]\r\nhit1 = k + l + m + n\r\nhit1 = set(hit1)\r\nprint(len(hit1)-1)", "# N = int(input())\r\n# N,M = map(int,input().split())\r\n# A = list(map(int,input().split()))\r\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\na = [False] * d\r\nfor i in range(k-1,d,k):\r\n a[i] = True\r\nfor i in range(l-1,d,l):\r\n a[i] = True\r\nfor i in range(m-1,d,m):\r\n a[i] = True\r\nfor i in range(n-1,d,n):\r\n a[i] = True\r\nres = 0\r\nfor i in range(d):\r\n if a[i]==True:\r\n res += 1\r\nprint(res)\r\n\r\n", "# Import helpful pages\nfrom logging.handlers import WatchedFileHandler\nimport queue\nfrom re import A\nfrom sys import stdin, stdout\nfrom collections.abc import MutableSet, Sequence, Set\nfrom collections import defaultdict\nfrom tkinter.messagebox import NO\nfrom typing import List\nimport copy\nimport math\nimport itertools\nimport heapq\nimport time\nimport bisect\nfrom itertools import count, cycle\nfrom unicodedata import name\nfrom zlib import Z_BEST_COMPRESSION\n\n# Helper Objects\nclass SortedSet(MutableSet, Sequence):\n def __init__(self, iterable=None, key=None, init_set=set()):\n self._key = key\n self._set = init_set\n self._len = 0\n self._load = self.DEFAULT_LOAD_FACTOR\n self._lists = []\n self._maxes = []\n self._index = []\n self._offset = 0\n if iterable is not None:\n self._update(iterable)\n\n @classmethod\n def _fromset(cls, values, key=None):\n return SortedSet(key=key, init_set=values)\n \n def __contains__(self, value):\n return value in self._set\n\n def __len__(self):\n return len(self._set)\n \n def __iter__(self):\n return iter(self._list)\n\n def clear(self):\n self._set.clear()\n #self._list.clear()\n\n def count(self, value):\n return 1 if value in self._set else 0\n\nclass SegNode(object):\n def __init__(self, start, end):\n self.left = None\n self.right = None\n\n self.start = start\n self.end = end\n self.payload = set()\n\n def is_leaf(self) -> bool:\n return not self.left and not self.right\n\n def get_midpoint(self) -> int:\n return (self.start + self.end) // 2\n\n def split(self) -> bool:\n if self.is_leaf() and self.start != self.end:\n midpoint = self.get_midpoint()\n self.left = SegNode(self.start, midpoint)\n self.right = SegNode(midpoint + 1, self.end)\n return True\n return False\n\n def has_non_match(self, color):\n len_check = 1 if color in self.payload else 0\n return len(self.payload) > len_check\n\nclass SegArray(object):\n def __init__(self, min_val:int, max_val:int):\n \"\"\"Initialization.\"\"\"\n self.root = SegNode(min_val, max_val)\n \n def update(self, start: int, end: int, payload:int, root:SegNode=None) -> int:\n \"\"\"Update payload range\"\"\"\n if not root:\n root = self.root\n\n if root.is_leaf() and not (root.start == start and root.end == end):\n root.split()\n\n if root.is_leaf():\n root.payload.add(payload)\n return root.payload\n\n if end <= root.get_midpoint():\n self.update(start, end, root=root.left)\n elif start > root.get_midpoint():\n self.update(start, end, root=root.right)\n else:\n self.update(start, root.left.end, root=root.left)\n self.update(root.right.start, end, root=root.right)\n\n # Propogate the changes after recursive call returns\n root.payload.add(payload)\n return root.payload\n\n\n def get_in_range(self, start: int, end:int, root:SegNode=None) -> int:\n \"\"\"set of elements nums[i..j]\"\"\"\n if not root:\n root = self.root\n\n #If the range exactly matches the root, we already have the sum\n if root.start == start and root.end == end:\n return root.total\n \n #If end of the range is less than the mid, the entire interval lies\n #in the left subtree\n if end <= root.get_midpoint():\n return self.get_in_range(start, end, root=root.left)\n \n #If start of the interval is greater than mid, the entire inteval lies\n #in the right subtree\n elif start >= root.get_midpoint() + 1:\n return self.get_in_range(start, end, root=root.right)\n \n #Otherwise, the interval is split. So we calculate the sum recursively,\n #by splitting the interval\n else:\n left = self.get_in_range(start, root.get_midpoint(), root=root.left)\n right = self.get_in_range(root.get_midpoint()+1, end, root=root.right)\n return left.union(right)\n\n def closest_non_match(self, start:int, end:int, payload:int, root:SegNode=None) -> int:\n if not root:\n root = self.root\n\n # If there are no other payloads then no match found\n if not root.has_non_match():\n return -1\n\n if root.is_leaf():\n # Leaf and in range\n if start <= root.end and root.end <= end:\n return 0\n if start <= root.start and root.start <= end:\n return 0\n # Leaf and out of range\n min_dist = min(abs(root.start - end), abs(root.end - start))\n return min_dist\n\n # sub range\n if end <= root.get_midpoint():\n if root.left.has_non_match(payload):\n return self.closest_non_match(start, end, payload, root.left)\n return self.closest_non_match(start, end, payload, root.right)\n elif start > root.get_midpoint():\n if root.right.has_non_match(payload):\n return self.closest_non_match(start, end, payload, root.right)\n return self.closest_non_match(start, end, payload, root.left)\n elif root.left.has_non_match(payload) and root.right.has_non_match(payload):\n left = self.closest_non_match(start, root.get_midpoint(), payload, root.left)\n left = self.closest_non_match(root.get_midpoint() + 1, end, payload, root.right)\n\n elif root.left.has_non_match(payload):\n pass\n\n\n # if range is to the left of current node; left is closer if possible\n if end < root.start:\n next = root.right\n if root.left.has_non_match(payload):\n next = root.left\n return self.closest_non_match(start, end, payload, next)\n elif start > root.end:\n next = root.left\n if root.right.has_non_match(payload):\n next = root.right\n return self.closest_non_match(start, end, payload, next)\n \n \n\n if start <= root.start and end <= root.end:\n needed_len = 2 if payload in root.payload else 1\n if len(root.payload) > needed_len:\n return 0\n return -1\n\n if end <= root.get_midpoint():\n pass\n\n \n\nclass IntervalNode(object):\n def __init__(self, l, r):\n self.l = l\n self.r = r\n self.split = (r - l) // 2 + l\n self.left = None\n self.right = None\n self.count = 0\n\n def split(self, val):\n if self.has_child():\n if val < self.split:\n self.left.split(val)\n else:\n self.right.split(val)\n else:\n self.split = val\n self.left = IntervalNode(self.l, self.split)\n self.left.count = self.count\n self.right = IntervalNode(self.split + 1, self.r)\n self.right.count = self.count\n\n\n\n def in_range(self, val):\n return self.l <= val and self.r >= val\n\n def add_range(self, l, r):\n l = max(l, self.l)\n r = min(r, self.r)\n\n if l == self.l and r == self.r:\n self.count += 1\n if self.has_child():\n self.left.add_range(l, r)\n self.right.add_range(l, r)\n else:\n if l <= self.split:\n if not self.has_child() and self.l < self.r:\n self.left = IntervalNode(self.l, self.split)\n self.left.count = self.count\n self.right = IntervalNode(self.split + 1, self.r)\n self.right.count = self.count\n self.left.add_range(l, r)\n if r > self.split:\n if not self.has_child() and self.l < self.r:\n self.left = IntervalNode(self.l, self.split)\n self.left.count = self.count\n self.right = IntervalNode(self.split + 1, self.r)\n self.right.count = self.count\n self.right.add_range(l, r)\n \n def has_child(self):\n return self.left and self.right and self.l < self.r\n \n def get_count(self, li):\n if self.has_child():\n self.left.get_count(li)\n self.right.get_count(li)\n else:\n li.append((self.count, self.l, self.r))\n \n\n\n \n# Helper methods for execution\ndef get_int_dd(d=0):\n def def_value():\n return d\n return defaultdict(def_value)\n \ndef get_counts(li):\n dd = get_int_dd()\n for i in li:\n dd[i] += 1\n return dd\n\ndef get_li_dd():\n def def_value():\n return []\n return defaultdict(def_value)\n\ndef get_set_dd():\n def def_value():\n return set()\n return defaultdict(def_value)\n\ndef get_index_map(li, w_offset=False):\n dd = get_li_dd()\n for i,n in enumerate(li):\n dd[n].append(i + (1 if w_offset else 0))\n return dd\n\ndef to_int_list(str):\n str.strip()\n return [int(i) for i in str.split()]\n\ndef to_char_list(str):\n str.strip()\n return [str[i] for i in range(len(str))]\n\n# INPUT METHODS\n\ndef read_line():\n return stdin.readline().strip()\n\ndef read_int():\n return int(read_line())\n\ndef read_ints():\n return [int(i) for i in read_line().split()]\n\ndef read_str_list(read_n=True, n=1):\n if read_n:\n n = read_int()\n return [read_line() for i in range(n)]\n\n# OUTPUT METHODS\n\ndef write_out(value):\n stdout.write(str(value))\n\ndef write_line(value):\n stdout.write(str(value) + '\\n')\n \nCOMMENTS_ON = True\n \ndef comment(value):\n if COMMENTS_ON:\n stdout.write(str(value) + '\\n')\n \ndef execute_on_input(calc_ans, read_case=read_line, t=None, write_output=write_line):\n if not t:\n t = read_int()\n for eval in [calc_ans(read_case()) for input in range(t)]:\n if eval is not None:\n write_output(eval)\n\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191]\nfibonacci = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733, 1134903170, 1836311903, 2971215073, 4807526976, 7778742049]\n\n\ndef qA():\n\n def read():\n return [read_int() for _ in range(5)]\n \n def calc(input):\n k, l, m, n, d = input\n return sum([1 if (i % k == 0) or (i % l == 0) or (i % m == 0) or (i % n == 0) else 0 for i in range(1, d+1)])\n\n return max([\n abc,\n a+b+c,\n (a+b)c,\n a(b+c)\n ])\n \n\n \n \n\n \n \n \n # Execute on each input line.\n execute_on_input(calc, read_case=read, t=1)\n\ndef qB():\n\n def read():\n return read_int(), read_ints()\n \n def calc(input):\n return input\n\n \n # Execute on each input line.\n execute_on_input(calc, read_case=read)\n\n\ndef qTemplate():\n\n def read():\n return read_int(), read_ints()\n \n def calc(input):\n return input\n \n # Execute on each input line.\n execute_on_input(calc, read_case=read)\n\n\n# Call the methods\nif __name__ == \"__main__\":\n qA() \n\n\n\n", "k=int(input())\r\nl=int(input())\r\nn=int(input())\r\nm=int(input())\r\nd=int(input())\r\ns=0\r\nif min(k,l,n,m)==1:\r\n print(d)\r\nelse:\r\n for i in range(1,d+1):\r\n if i%l==0 or i%k==0 or i%n==0 or i%m==0:\r\n s+=1\r\n print(s)", "a = [int(input()) for _ in range(5)]\r\ns = set()\r\n \r\nfor b in a[:-1]:\r\n c = b\r\n while c <= a[-1]:\r\n s.add(c)\r\n c += b\r\n \r\nprint(len(s))", "# Get the attack values\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\n\r\n# Get the total number of dragons\r\nd = int(input())\r\n\r\n# Create a list to store the damaged dragons\r\ndamaged_dragons = []\r\n\r\n# Iterate through the list of dragons\r\nfor i in range(1, d + 1):\r\n\r\n # Check if the dragon is divisible by any of the attack values\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n\r\n # Add the dragon to the list of damaged dragons\r\n damaged_dragons.append(i)\r\n\r\n# Print the number of damaged dragons\r\nprint(len(damaged_dragons))", "i_th = []\r\nfor i in range(4):\r\n i_th.append(int(input()))\r\n\r\nd = int(input())\r\n\r\ncount = 0\r\nfor i in range(1, d+1):\r\n for j in i_th:\r\n if i % j == 0:\r\n count += 1\r\n break # 4개의 숫자 중 하나라도 나누어떨어지면\r\n # 다음 숫자로 넘어감\r\n \r\nprint(count)", "# k = int(input())\r\n# l = int(input())\r\n# m = int(input())\r\n# n = int(input())\r\n# d = int(input())\r\n\r\n# lis = [i for i in range(1, d+1)]\r\n# res = 0\r\n\r\n# for i in lis:\r\n# if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:\r\n# res+=1\r\n# print(d-res)\r\ndef gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef lcm(a, b):\r\n return (a * b) // gcd(a, b)\r\n\r\ndef count_damaged_dragons(k, l, m, n, d):\r\n total_dragons = d\r\n \r\n # Count dragons that satisfy individual conditions\r\n dragons_k = d // k\r\n dragons_l = d // l\r\n dragons_m = d // m\r\n dragons_n = d // n\r\n\r\n # Count dragons that satisfy at least two conditions\r\n dragons_kl = d // lcm(k, l)\r\n dragons_km = d // lcm(k, m)\r\n dragons_kn = d // lcm(k, n)\r\n dragons_lm = d // lcm(l, m)\r\n dragons_ln = d // lcm(l, n)\r\n dragons_mn = d // lcm(m, n)\r\n\r\n # Count dragons that satisfy at least three conditions\r\n dragons_klm = d // lcm(lcm(k, l), m)\r\n dragons_kln = d // lcm(lcm(k, l), n)\r\n dragons_kmn = d // lcm(lcm(k, m), n)\r\n dragons_lmn = d // lcm(lcm(l, m), n)\r\n\r\n # Count dragons that satisfy all four conditions\r\n dragons_klmn = d // lcm(lcm(lcm(k, l), m), n)\r\n\r\n # Apply the inclusion-exclusion principle to count damaged dragons\r\n damaged_dragons = dragons_k + dragons_l + dragons_m + dragons_n \\\r\n - dragons_kl - dragons_km - dragons_kn - dragons_lm - dragons_ln - dragons_mn \\\r\n + dragons_klm + dragons_kln + dragons_kmn + dragons_lmn \\\r\n - dragons_klmn\r\n\r\n return damaged_dragons\r\n\r\n# Example usage:\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ndamaged_dragons = count_damaged_dragons(k, l, m, n, d)\r\nprint(damaged_dragons)\r\n", "a=[5]\r\nfor i in range(5):\r\n b=int(input())\r\n a.append(b)\r\nc=0\r\nfor i in range(1,a[5]+1):\r\n if i%a[1]==0 or i%a[2]==0 or i%a[3]==0 or i%a[4]==0:\r\n c+=1\r\nprint(c)\r\n ", "k=int(input())\nl=int(input())\nm=int(input())\nn=int(input())\nd=int(input())\nc=0\nfor i in range(1,d+1):\n\tif i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:\n\t\tc+=1\nprint(d-c)\n\n\n\n\n\n\n\n\n\n\n\n\n", "e,f,g,h,m = map(int,(input() for i in range(5)))\nl=0\nfor i in range(1,m+1):\n if i%e and i%f and i%g and i%h:\n continue\n else:\n l+=1\nprint(l)\n \t\t\t \t \t\t \t \t\t\t\t\t\t \t\t \t \t", "N = 100010\r\nsuffer = []\r\nst = [0] * N\r\nans = 0\r\n\r\nfor i in range(4):\r\n\tsuffer.append(int(input()))\r\nn = int(input())\r\nfor i in suffer:\r\n\tt = n // i\r\n\tj = i\r\n\ttt = 1\r\n\twhile j <= n and tt <= t:\r\n\t\tif not st[j]:\r\n\t\t\tst[j] = 1\r\n\t\t\tans += 1\r\n\t\t\ttt += 1\r\n\t\t\tj = tt * i\r\n\t\telse:\r\n\t\t\ttt += 1\r\n\t\t\tj = tt * i\t\r\nprint(ans)", "k=int(input())\nl=int(input())\nm=int(input())\nn=int(input())\nd=int(input())\ncount=0\nfor i in range (1,d+1):\n if (i%k!=0) and (i%l!=0) and(i%m!=0) and(i%n!=0):\n count=count+1\ntotalDamaged= d-count\nprint(totalDamaged)\n", "cnt = 0\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nfor i in range(1,d+1):\r\n if i % k == 0 or i%l == 0 or i%m == 0 or i%n==0:\r\n cnt +=1\r\n\r\nprint(cnt)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ndr = [k,l,m,n]\r\nhit = [x for x in range(1,d+1)]\r\nk = [x for x in range(0,d+1,k)]\r\nl = [x for x in range(0,d+1,l)]\r\nm = [x for x in range(0,d+1,m)]\r\nn = [x for x in range(0,d+1,n)]\r\nhit1 = k + l + m + n\r\nhit1 = set(hit1)\r\nprint(len(hit1)-1)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nabused = 0\r\n\r\nfor i in range(1, d + 1):\r\n if not i % k or not i % l or not i % m or not i % n:\r\n abused += 1\r\n\r\nprint(abused)", "a=int(input())\nb=int(input())\nc=int(input())\nd=int(input())\ne=int(input())\ny=0\nfor i in range(1,e+1):\n if i%a ==0 or i%b==0 or i%c==0 or i%d==0:\n y+=1\nprint(y)\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nb = []\r\nfor i in range(k, d+1, k):\r\n b.append(i)\r\nfor i in range(l, d+1, l):\r\n b.append(i)\r\nfor i in range(m, d+1, m):\r\n b.append(i)\r\nfor i in range(n, d+1, n):\r\n b.append(i)\r\nprint(len(set(b)))", "def insomnia(k, l, m, n, d):\r\n sol = int()\r\n for item in range (1, d+1):\r\n if item%k != 0 and item%l != 0 and item%m != 0 and item%n != 0:\r\n sol += 1\r\n return d-sol\r\n\r\nif __name__ == \"__main__\":\r\n k = int(input())\r\n l = int(input())\r\n m = int(input())\r\n n = int(input())\r\n d = int(input())\r\n print(insomnia(k, l, m, n, d))", "n=int(input())\r\nm=int(input())\r\nk=int(input())\r\nt=int(input())\r\nd=int(input())\r\nl=[]\r\nr=[]\r\nw=[]\r\nq=[]\r\nfor i in range(1,d+1):\r\n if i%n==0:\r\n l.append(i);\r\n if i%m==0:\r\n r.append(i);\r\n if i%k==0:\r\n w.append(i);\r\n if i%t==0:\r\n q.append(i);\r\nl.extend(r);\r\nl.extend(w);\r\nl.extend(q)\r\no=abs(len(set(l))-d)\r\nprint(d-o);\r\n", "#from collections import Counter\r\n#import math\r\ncount_time=0\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#------------------------------------------\r\nk,l,m,n,d=[int(input()) for _ in range(5)]\r\nd+=1\r\nprint(sum(1 if any([not i%k,not i%l,not i%m,not i%n]) else 0 for i in range(1,d)))\r\n#------------------------------------------\r\nif count_time:\r\n end_time = time.time()\r\n print('----------------\\nRunning time: {} s'\r\n .format(end_time - start_time))\r\n", "def main(arr, d):\r\n a = 0\r\n\r\n for i in range(d):\r\n for j in range(len(arr)):\r\n if (i + 1) % arr[j] == 0:\r\n a += 1\r\n break\r\n\r\n return a\r\n\r\nif __name__ == \"__main__\":\r\n k, l = int(input()), int(input())\r\n m, n = int(input()), int(input())\r\n\r\n d = int(input())\r\n\r\n print(main([k, l, m, n], d))", "multiples = []\r\nfor i in range(4):\r\n multiples.append(int(input()))\r\nk = int(input())\r\n\r\nvictims = [i + 1 for i in range(k) if [(i + 1)%item for item in multiples].count(0) > 0]\r\nprint(len(victims))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\nf=[]\r\nfor i in range(a, e+1, a):\r\n f.append(i)\r\nfor i in range(b, e+1, b):\r\n f.append(i)\r\nfor i in range(c, e+1, c):\r\n f.append(i)\r\nfor i in range(d, e+1, d):\r\n f.append(i)\r\nprint(len(set(f)))", "o=int(input())\r\np=int(input())\r\nq=int(input())\r\nr=int(input())\r\nd=int(input())\r\nc=0\r\nfor i in range(1,d+1):\r\n if i%o==0 or i%p==0 or i%q==0 or i%r==0:\r\n c+=1\r\nprint(c)\r\n", "k = int(input()) # k-th dragon punched\r\nl = int(input()) # l-th dragon tail shut\r\nm = int(input()) # m-th dragon paws trampled\r\nn = int(input()) # n-th dragon threatened\r\nd = int(input()) # Total number of dragons\r\n\r\ndamaged_dragons = 0\r\n\r\nfor i in range(1, d+1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n damaged_dragons += 1\r\n\r\nprint(damaged_dragons)\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nl=int(input())\r\ns=0\r\nfor i in range(1,l+1):\r\n if i%a!=0 and i%b!=0 and i%c!=0 and i%d!=0:\r\n s+=1\r\nprint(l-s)", "d1 = int(input()) \r\nd2 = int(input())\r\nd3 = int(input())\r\nd4 = int(input())\r\nd = int(input())\r\nharmed = 0\r\nfor i in range(1, d+1):\r\n if (i%d1 == 0) or (i%d2==0) or (i%d3 == 0) or (i%d4 == 0):\r\n harmed += 1\r\nprint(harmed)\r\n", "a,b,c,d,n=int(input()),int(input()),int(input()),int(input()),int(input());print(sum([1 for i in range(1,n+1) if i%a==0 or i%b==0 or i%c==0 or i%d==0]))", "k= int(input())\r\nl= int(input())\r\nm= int(input())\r\nn= int(input())\r\nd= int(input())\r\nres=0\r\nfor i in range (1,d+1):\r\n if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:\r\n res+=1\r\nprint(d-res)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ni = 1\r\nadd = 0\r\nwhile i<=d:\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:\r\n add+=1\r\n i+=1\r\n\r\nprint(add)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nhealthy = 0\r\nfor i in range(1, d+1):\r\n if (i % k != 0 and i % l != 0 and i % m != 0 and i % n != 0):\r\n healthy += 1\r\nprint(d-healthy)\r\n", "num=[]\r\ncount=0\r\nfor i in range(5):\r\n num.append(int(input()))\r\nif num[0]==1 or num[1]==1 or num[2]==1 or num[3]==1:\r\n print(num[4])\r\nelse:\r\n for i in range(1,num[4]+1):\r\n if i%num[0]==0 or i%num[1]==0 or i%num[2]==0 or i%num[3]==0:\r\n count+=1 \r\n print(count)\r\n \r\n ", "I= []\nfor i in range(4): \n I.append(int(input()))\nd= int(input())\nA= [0 for i in range(d+1)]\nfor i in I[:4]: \n for j in range(1, d+1): \n if j%i==0: \n A[j]=1\nprint(sum(A))", "#148A - Insomnia cure\r\nif __name__ == '__main__' :\r\n k, l, m, n, d = int(input()), int(input()), int(input()), int(input()),int(input())\r\n val = 0\r\n for x in range(1,d+1):\r\n if x % k == 0 or x % l == 0 or x % m == 0 or x % n == 0:\r\n val+= 1\r\n print(val)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\nx=0\r\nfor i in range(1,e+1):\r\n if(i%a!=0 and i%b!=0 and i%c!=0 and i%d!=0):\r\n \r\n x+=1\r\n\r\nprint(e-x)\r\n ", "def main():\r\n k = int(input())\r\n l = int(input())\r\n m = int(input())\r\n n = int(input())\r\n d = int(input())\r\n \r\n total = 0\r\n for u in range(1, d + 1):\r\n if u % k == 0 or u % l == 0 or u % m == 0 or u % n == 0:\r\n total += 1\r\n \r\n print(total)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "k = int(input()) # Condition k\r\nl = int(input()) # Condition l\r\nm = int(input()) # Condition m\r\nn = int(input()) # Condition n\r\nd = int(input()) # Total number of dragons\r\n\r\ndamaged_dragons = 0\r\n\r\nfor dragon in range(1, d + 1):\r\n if dragon % k == 0 or dragon % l == 0 or dragon % m == 0 or dragon % n == 0:\r\n damaged_dragons += 1\r\n\r\nprint(damaged_dragons)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nN=0\r\nfor a in range(1,d+1):\r\n if a%k==0:\r\n N+=1\r\n elif a%l==0:\r\n N+=1\r\n elif a%m==0:\r\n N+=1\r\n elif a%n==0:\r\n N+=1\r\nprint(N)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\nnum_vam = 0\n\nfor i in range(1,d+1):\n if i % k == 0:\n num_vam +=1\n elif i % l == 0:\n num_vam +=1\n elif i % m == 0:\n num_vam +=1\n elif i % n == 0:\n num_vam +=1\n\nprint(num_vam)\n\t\t \t\t \t \t \t\t \t \t \t", "def calculate_damaged_dragons(k, l, m, n, d):\r\n damaged_dragons = set()\r\n\r\n for i in range(1, d+1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n damaged_dragons.add(i)\r\n\r\n return len(damaged_dragons)\r\n\r\n# Input\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n# Calculate and output the result\r\nresult = calculate_damaged_dragons(k, l, m, n, d)\r\nprint(result)\r\n", "import math\nimport heapq\nimport sys\n\ndef input_arr():\n arr = [int(x) for x in input_string().split()]\n return arr\n\ndef input_n():\n n = int(input_string())\n return n\n\ndef sub_list(a,b):\n c = []\n for i in range(len(a)):\n c.append(a[i]-b[i])\n return c\n\ndef sub_const(a, c):\n b = []\n for x in a:\n b.append(x-c)\n return b\n\ndef binary_search(arr, low, high, x):\n if high >= low:\n mid = (high + low) // 2\n if arr[mid] == x:\n return mid\n elif arr[mid] > x:\n return binary_search(arr, low, mid - 1, x)\n else:\n return binary_search(arr, mid + 1, high, x)\n else:\n return -1\n \ndef printlist(a):\n for x in a:\n print(x, end = \" \")\n\ndef input_string():\n global mode\n if mode==0:\n return input()\n else:\n with open('/Users/aryan/Desktop/cp/test_case.txt') as f:\n lines = f.readlines()\n global line \n st = lines[line][:-1]\n line+=1\n return st\n\ndef solve():\n a = input_n()\n b = input_n()\n c = input_n()\n d = input_n()\n n = input_n()\n arr = []\n for i in range(n):\n arr.append(i+1)\n cnt = 0\n for i in range(n):\n if arr[i]%a==0 or arr[i]%b==0 or arr[i]%c==0 or arr[i]%d==0:\n cnt+=1\n print(cnt)\n\ndef solve_t():\n t = input_n()\n for l in range(t):\n n = input_n()\n a = []\n b = []\n for i in range(n):\n x, y = input_arr()\n a.append(x)\n b.append(y)\n l = []\n for i in range(n):\n l.append([a[i], 1, i+1])\n for i in range(n):\n l.append([b[i], 2, i+1])\n l.sort()\n f1 = []\n f2 = []\n\n visited = set()\n i = 0\n while len(visited)<n or len(f1)==0 or len(f2)==0:\n price, friend, dept = l[i]\n visited.add(dept)\n if friend==1:\n f1.append([price, dept])\n else:\n f2.append([price, dept])\n i+=1\n\n if f1[-1][1]==f2[-1][1]:\n a = abs(f1[-2][0]-f2[-1][0]) if len(f1)>1 else 100000000000000\n b = abs(f2[-2][0]-f1[-1][0]) if len(f2)>1 else 100000000000000\n diff = min(a, b)\n else:\n diff = abs(f1[-1][0]-f2[-1][0])\n\n while i<len(l):\n price, friend, dept = l[i]\n if friend==1:\n f1.append([price, dept])\n else:\n f2.append([price, dept])\n \n if f1[-1][1]==f2[-1][1]:\n a = abs(f1[-2][0]-f2[-1][0]) if len(f1)>1 else 100000000000000\n b = abs(f2[-2][0]-f1[-1][0]) if len(f2)>1 else 100000000000000\n diff = min(diff, min(a, b))\n else:\n diff = min(diff, abs(f1[-1][0]-f2[-1][0]))\n i+=1\n print(diff)\n\n \nline = 0 \nmode = 0\nif len(sys.argv)>1 and sys.argv[1]=='file':\n mode = 1\nsolve()", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nx = []\r\nfor i in range(1,d+1):\r\n if((i%k==0 or i%l==0 or i%m==0 or i%n==0) == False):\r\n x.append(i)\r\nprint(d - len(x))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nn=int(input())\r\ncount=0\r\nfor i in range(1,n+1):\r\n if i%a==0 or i%b==0 or i%c==0 or i%d==0:\r\n count+=1\r\nprint(count)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ng = [0] * (d + 1)\r\nfor i in range(k, d + 1, k):\r\n g[i] = 1\r\nfor i in range(l, d + 1, l):\r\n g[i] = 1\r\nfor i in range(m, d + 1, m):\r\n g[i] = 1\r\nfor i in range(n, d + 1, n):\r\n g[i] = 1\r\nprint(sum(g))\r\n", "L=[]\r\nL.append(int(input(\"\")))\r\nL.append(int(input(\"\")))\r\nL.append(int(input(\"\")))\r\nL.append(int(input(\"\")))\r\n\r\nx=int(input(\"\"))\r\nd=0\r\nfor i in range(1,x+1):\r\n if(i%L[0]==0 or i%L[1]==0 or i%L[2]==0 or i%L[3]==0):\r\n d=d+1\r\n \r\nprint(d)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\narr=[1]d\r\nfor i in range(d):\r\n if (i+1)%k==0:\r\n arr[i]=0\r\n elif (i+1)%l==0:\r\n arr[i]=0\r\n elif (i+1)%m==0:\r\n arr[i]=0\r\n elif (i+1)%n==0:\r\n arr[i]=0\r\nprint(d-sum(arr))", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Sep 14 22:02:19 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\ncounter = 0\r\nattack=[]\r\nfor i in range(4):\r\n attack.append(int(input()))\r\ndragons=int(input())\r\nfor i in range(dragons):\r\n if (i+1) % attack[0] == 0 or (i+1) % attack[1] == 0 or (i+1) % attack[2] == 0 or (i+1) % attack[3] == 0:\r\n counter += 1\r\nprint(counter)", "ar = [int(input()) for i in range(5)]\nif 1 not in ar[:4]:\n S = set()\n for i in range(4):\n for j in range(ar[i], ar[4]+1, ar[i]):\n S.add(j)\n print(len(S))\nelse:\n print(ar[4])\n", "k,l,m,n,d=[int(input()) for i in range(5)]\r\nc=d\r\nfor i in range(1, c+1):\r\n\tif((i%k!= 0) and (i%l!=0) and (i%m!=0) and (i%n!=0)): c-=1\r\nprint(c)", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\ns = 0\r\nfor i in range(1, d + 1):\r\n if i % k == 0:\r\n s += 1\r\n elif i % l == 0:\r\n s += 1\r\n elif i % m == 0:\r\n s += 1\r\n elif i % n == 0:\r\n s += 1\r\nprint(s)", "a, b, c, d, e = int(input()), int(input()), int(input()), int(input()), int(input())\r\nq = [a, b, c, d]\r\ntotal = 0\r\nif 1 not in q:\r\n for i in range(2, e + 1):\r\n for k in q:\r\n if i % k == 0 and i >= k:\r\n total += 1\r\n break\r\n \r\n print (total)\r\nelse:\r\n print (e)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nsum=0\r\nfor i in range(1,d+1):\r\n if(i%k !=0 and i%l!=0 and i%m!=0 and i%n!=0):\r\n sum+=1\r\n # print(i)\r\nprint(d-sum)\r\n\r\n\r\n", "s = set()\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\na = k\r\nwhile a <= d:\r\n s.add(a)\r\n a += k\r\n\r\na = l\r\nwhile a <= d:\r\n s.add(a)\r\n a += l\r\n\r\na = m\r\nwhile a <= d:\r\n s.add(a)\r\n a += m\r\n\r\na = n\r\nwhile a <= d:\r\n s.add(a)\r\n a += n\r\n\r\nprint(len(s))", "k= int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nl1 = [None]d\r\nfor i in range(d):\r\n l1[i]=i+1\r\nk1 = []\r\nfor j in range(1,d+1):\r\n if(j%k==0):\r\n k1.append(j)\r\n elif(j%l == 0):\r\n k1.append(j)\r\n elif(j%m==0):\r\n k1.append(j)\r\n elif(j%n==0):\r\n k1.append(j)\r\nprint(len(k1))", "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, l, m, n, d = int(input()), int(input()), int(\n input()), int(input()), int(input())\n count = 0\n for i in range(1, d + 1):\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\n count += 1\n print(count)\n\n\nif __name__ == \"__main__\":\n main()\n", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\nx=0\r\nfor i in range(1, d+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0:\r\n x+=1\r\nprint(x)", "x=int(input())\r\ny=int(input())\r\nz=int(input())\r\nm=int(input())\r\nn=int(input())\r\n\r\nc=0\r\nfor i in range(1,n+1):\r\n if i % x == 0 or i % y == 0 or i % z == 0 or i % m == 0:\r\n c+=1\r\nprint(c)", "def main():\r\n a = int(input())\r\n b = int(input())\r\n c = int(input())\r\n d = int(input())\r\n n = int(input())\r\n l = [a,b,c,d]\r\n \r\n for k in l:\r\n if k==1:\r\n print(n)\r\n return\r\n valid = set() \r\n for k in l:\r\n for j in [x for x in l if x != k]:\r\n if k%j == 0:\r\n valid.add(max(k,j))\r\n valid = [x for x in l if x not in valid]\r\n cas = 0 \r\n for k in range(1,n+1):\r\n for j in valid:\r\n if k%j == 0:\r\n cas += 1\r\n break\r\n print(cas)\r\n \r\n\r\nmain()", "x,y=map(int,open(0))\r\nprint(sum(any(i%j==0 for j in x) for i in range(1,y+1)))", "v,b=map(int,open(0))\r\nprint(sum(any(i%j==0 for j in v)for i in range(1,b+1)))\r\n#HI CODEFORCES\r\n#", "a=int(input())\r\nl=int(input())\r\nm=int(input())\r\nt=int(input())\r\nd=int(input())\r\np=0\r\nq=0\r\nfor i in range(1,d+1):\r\n if i%a==0 or i%l==0 or i%m==0 or i%t==0:\r\n q+=1\r\n else:\r\n p+=1\r\nprint(d-p) ", "n1 = int(input())\nn2 = int(input())\nn3 = int(input())\nn4 = int(input())\nn_dragons = int(input())\n\nl = len(set(range(n1, n_dragons + 1, n1)) \| set(range(n2, n_dragons + 1, n2)) \| set(range(n3, n_dragons + 1, n3)) \| set(range(n4, n_dragons + 1, n4)))\n\nprint(l)\n", "# Online Python compiler to run Python online.\n# Write Python code in this online editor and run it.\na,d=map(int,open(0))\nprint(sum(any(i%j==0 for j in a)for i in range(1,d+1)))\n\t\t\t\t\t \t\t\t \t \t\t\t \t \t\t \t\t", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n k = int(input())\n l = int(input())\n m = int(input())\n n = int(input())\n d = int(input())\n divs = [k, l, m, n]\n ds = [True for i in range(d)]\n for i in range(4):\n ds = [False if ds[j] and (j + 1) % divs[i] ==\n 0 else ds[j] for j in range(d)]\n print(d - ds.count(True))\n\n\nif __name__ == \"__main__\":\n main()\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\n\r\nif min(a,b,c,d)==1:\r\n print(e)\r\nelse:\r\n k=0\r\n for i in range(e,0,-1):\r\n if i%a==0 or i%b==0 or i%c==0 or i%d==0:\r\n continue\r\n else:\r\n k+=1\r\n print(e-k)", "k,ll,m,n=int(input()),int(input()),int(input()),int(input())\r\na=int(input())\r\ncount=0\r\nfor i in range(1,a+1):\r\n if i%k!=0 and i%ll!=0 and i%m!=0 and i%n!=0:\r\n count+=1\r\nprint(a-count) ", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ni = 1\r\ncount = 0\r\nwhile(i<=d):\r\n if (i%k==0 or i%l==0 or i%m==0 or i%n==0):\r\n count = count + 1\r\n i = i + 1\r\nprint(count)", "l = []\r\nfor i in range(5):\r\n l.append(int(input()))\r\nm = l[4]\r\na = [1](m)\r\nfor i in range(0, 4):\r\n for j in range(0, m+1, l[i]):\r\n\r\n if j == 0:\r\n continue\r\n else:\r\n if a[j-1] == 1:\r\n a[j-1] = 0\r\n else:\r\n continue\r\n\r\nprint(m - a.count(1))\r\n", "from sys import stdin , stdout\r\nl = [int(input()) for _ in range(4)]; d = int(input()); count = 0\r\n\r\nfor i in range(1 , d+1):\r\n if i % l[0] != 0 and i % l[1] != 0 and i % l[2] != 0 and i % l[3] != 0: count += 1\r\nstdout.write(str(d - count))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nt=int(input())\r\nc1=0\r\nfor i in range(1,t+1):\r\n if(i%a==0 or i%b==0 or i%c==0 or i%d==0):\r\n c1+=1\r\nprint(c1)\r\n", "# -- coding: utf-8 --\n\"\"\"Codeforce\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1vkqd1IDYYeIi4VIH6yqQEhbS4qcGMzLO\n\"\"\"\n\nk = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\nescaped_dragon = 0\n\nfor i in range(1 , d + 1):\n if i % k != 0 and i % l != 0 and i % m != 0 and i % n != 0:\n escaped_dragon += 1\n\nprint(d - escaped_dragon)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ndragons_damage_list = [1 if (i+1)%k == 0 or (i+1)%l == 0 or (i+1)%m == 0 or (i+1)%n == 0 else 0 for i in range(d)]\r\nprint(dragons_damage_list.count(1))\r\n\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nc=0\r\nfor i in range(1,d+1):\r\n if (i)%k==0:\r\n c+=1\r\n elif (i)%l==0:\r\n c+=1\r\n elif (i)%m==0:\r\n c+=1\r\n elif (i)%n==0:\r\n c+=1 \r\n \r\nprint(c)", "i_th = []\r\nfor i in range(4):\r\n i_th.append(int(input()))\r\n\r\ni_th.sort()\r\ntotal = int(input())\r\n\r\ndragons = [x for x in range(1, total+1)]\r\n\r\nfor x in i_th:\r\n for y in range(total):\r\n if dragons[y] % x == 0:\r\n dragons[y] = 0\r\n \r\ncount = 0\r\n\r\nfor z in range(total):\r\n if dragons[z] == 0:\r\n count += 1\r\n\r\nprint(count)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nr=[]\r\nq=[]\r\nx=0\r\nfor i in range(1,d+1):\r\n q.append(i)\r\nfor i in range(d):\r\n x+= k\r\n if x <=d:\r\n \r\n r.append(x)\r\n else:\r\n x=0\r\n break\r\nfor i in range(d):\r\n x += l\r\n if x <=d:\r\n \r\n r.append(x)\r\n else:\r\n x=0\r\n break\r\nfor i in range(d):\r\n x += m\r\n if x <=d:\r\n \r\n r.append(x)\r\n else:\r\n x=0\r\n break\r\nfor i in range(d):\r\n x += n\r\n if x <=d:\r\n \r\n r.append(x)\r\n else:\r\n x=0\r\n break\r\nprint(len(set(r)))", "\r\ndef is_in_sequence(sequence, dragon):\r\n for s in sequence:\r\n if dragon % s == 0:\r\n return True\r\n\r\n return False\r\n\r\n\r\ndef solve():\r\n k = int(input())\r\n l = int(input())\r\n m = int(input())\r\n n = int(input())\r\n d = int(input())\r\n sequence = (k, l, m, n)\r\n if (sequence.count(1) > 0):\r\n return d\r\n\r\n dragons = set()\r\n for dragon in range(1, d + 1):\r\n if is_in_sequence(sequence, dragon):\r\n dragons.add(dragon)\r\n\r\n return len(dragons)\r\n\r\n\r\nprint(solve())\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ninputs=[k,l,m,n]\r\ndragons=[i for i in range(1,d+1)]\r\ndamaged=set()\r\nif any(i-1==0 for i in inputs):\r\n print(d)\r\nelse:\r\n for i in dragons:\r\n if any(i%j==0 for j in inputs):\r\n damaged.add(i)\r\n print(len(damaged))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\na = list(range(1,d+1))\r\nif k==1 or l==1 or m==1 or n==1: print(d)\r\nelse:\r\n A = set(a)\r\n K = set(list(range(k,d+1,k)))\r\n L = set(list(range(l,d+1,l)))\r\n M = set(list(range(m,d+1,m)))\r\n N = set(list(range(n,d+1,n)))\r\n print(d-len(A.difference(K,L,M,N)))", "import math\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ni = 1\r\npositions = []\r\nnum = 0\r\nwhile num < d:\r\n num = k * i\r\n if num > d:\r\n break\r\n positions.append(num)\r\n i += 1\r\nnum = 0\r\ni = 1\r\nwhile num < d:\r\n num = l * i\r\n if num > d:\r\n break\r\n positions.append(num)\r\n i += 1\r\nnum = 0\r\ni = 1\r\nwhile num < d:\r\n num = m * i\r\n if num > d:\r\n break\r\n positions.append(num)\r\n i += 1\r\nnum = 0\r\ni = 1\r\nwhile num < d:\r\n num = n * i\r\n if num > d:\r\n break\r\n positions.append(num)\r\n i += 1\r\npos = len(set(positions))\r\nprint(pos)\r\n\r\n\r\n\r\n", "t1 = int(input())\r\nt2 = int(input())\r\nt3 = int(input())\r\nt4 = int(input())\r\nt5 = int(input())\r\ntemp = 0\r\nfor z in range(1, t5 + 1):\r\n if z % t1 == 0 or z % t2 == 0 or z % t3 == 0 or z % t4 == 0:\r\n temp += 1\r\n\r\nprint(temp)\r\n", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\nif(k == 1 or l== 1 or m ==1 or n == 1):\n print(d)\nelse:\n counter = 0\n i = 1\n while i <= d:\n if(i%k==0 or i%l==0 or i%m == 0 or i%n==0):\n counter += 1\n i = i + 1\n\n print(counter)\n \t\t \t\t\t \t \t \t\t\t\t\t \t \t \t", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nc = d\r\nif k ==1 or l ==1 or m == 1 or n ==1 :\r\n print(d)\r\nelse:\r\n for i in range(1,d+1):\r\n if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:\r\n c-=1\r\n print(c)", "K, L, M, N, D = [int(input()) for _ in range(5)]\r\ndamaged_dragons = 0\r\nfor dragon in range(1, D + 1):\r\n if dragon % K == 0 or dragon % L == 0\\\r\n or dragon % M == 0 or dragon % N == 0:\r\n damaged_dragons += 1\r\nprint(damaged_dragons)\r\n", "a1 = int(input())\r\na2 = int(input())\r\na3 = int(input())\r\na4 = int(input())\r\nn = int(input())\r\nc = 0\r\nfor i in range(1,n+1):\r\n if i % a1 == 0:\r\n c += 1\r\n elif i % a2 == 0:\r\n c += 1\r\n elif i % a3 == 0:\r\n c += 1\r\n elif i % a4 == 0:\r\n c += 1\r\nprint(c)", "k, l, m, n = int(input()), int(input()), int(input()), int(input())\r\nd = int(input())\r\ns = set()\r\nfor i in range(1, d+1):\r\n if (i % k == 0) or (i % l == 0) or (i % m == 0) or (i % n == 0):\r\n s.add(i)\r\nprint(len(s))", "import math\r\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ndragons = []\r\nfor i in range(1, d + 1):\r\n dragons.append(i)\r\n\r\nk_dragons = []\r\nl_dragons = []\r\nm_dragons = []\r\nn_dragons = []\r\n\r\nfor j in range(1, d + 1):\r\n try:\r\n if j % k == 0:\r\n k_dragons.append(dragons[j-1])\r\n except IndexError:\r\n break\r\n\r\nfor a in range(1, d + 1):\r\n try:\r\n if a % l == 0:\r\n l_dragons.append(dragons[a-1])\r\n except IndexError:\r\n break\r\n\r\nfor b in range(1, d + 1):\r\n try:\r\n if b % m == 0:\r\n m_dragons.append(dragons[b-1])\r\n except IndexError:\r\n break\r\n\r\nfor c in range(1, d + 1):\r\n try:\r\n if c % n == 0:\r\n n_dragons.append(dragons[c-1])\r\n except IndexError:\r\n break\r\n\r\ntotal_dragons = set(k_dragons+l_dragons+m_dragons+n_dragons)\r\nprint(len(total_dragons))\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ns=0\r\nt=list(range(1,d+1))\r\nfor i in t :\r\n if (i%k ==0) or (i%l ==0) or (i%m ==0) or (i%n ==0):\r\n s+=1\r\nprint(s)", "def lcm(a,b):\r\n c=ab\r\n while a%b!=0:\r\n a,b=b,a%b\r\n\r\n\r\n return c//b\r\n\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nN1=(d//k) +(d//l)+(d//m) +(d//n)\r\nN2=(d//lcm(k,l)) +(d//lcm(k,m))+(d//lcm(k,n)) +(d//lcm(l,m))+(d//lcm(l,n))+(d//lcm(n,m))\r\nN3=(d//lcm(lcm(k,l),m)) + (d//lcm(lcm(m,l),n))+(d//lcm(lcm(n,m),k))+(d//lcm(lcm(k,l),n))\r\nN4=(d//lcm(lcm(k,l),lcm(m,n)))\r\nprint(N1-N2+N3-N4)", "k, l, m, n, d = int(input()),int(input()),int(input()),int(input()),int(input())\r\nlst_r = [k, l, m, n]\r\nif 1 in lst_r:\r\n print(d)\r\nelse:\r\n lst_num = [int(i) for i in range(1, d+1)]\r\n count = 0\r\n for i in lst_num:\r\n if i % k != 0 and i % l != 0 and i % m != 0 and i % n != 0:\r\n count += 1\r\n print(d - count) \r\n \r\n", "\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\narr=set()\r\nfor i in range(1,d+1):\r\n if i%k ==0 or i%l==0 or i%m ==0 or i%n ==0:\r\n if i not in arr:\r\n arr.add(i)\r\nprint(len(arr))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\np = 0\r\nfor pp in range(1, d + 1):\r\n if pp % k == 0 or pp % l == 0 or pp % m == 0 or pp % n == 0:\r\n p += 1\r\n \r\nprint(p)\r\n", "\r\nk,l,m,n,d=( int(input()) for _ in range(5) )\r\na=0\r\nfor c in range(d):\r\n if (c+1)%k == 0 or (c+1)%l ==0 or (c+1)%m ==0 or (c+1)%n ==0:\r\n a+=1\r\n \r\nprint(a) \r\n\r\n ", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nx=[]\r\ni=1\r\nwhile i < d+1:\r\n if i%k==0:\r\n x.append(i)\r\n elif i%l==0:\r\n x.append(i)\r\n elif i%m==0:\r\n x.append(i)\r\n elif i%n==0:\r\n x.append(i)\r\n i+=1\r\nf=set(x)\r\nprint(len(f))", "# Read input values\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n# Initialize a set to store damaged dragon numbers\r\ndamaged_dragons = set()\r\n\r\n# Mark the dragons that suffered moral or physical damage\r\nfor i in range(1, d + 1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n damaged_dragons.add(i)\r\n\r\n# Output the number of damaged dragons\r\nprint(len(damaged_dragons))\r\n\r\n \r\n", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\nc = 0\r\nfor i in range(d):\r\n h = i + 1\r\n if h % k == 0 or h % l == 0 or h % m == 0 or h % n == 0:\r\n c += 1\r\nprint(c)", "punch = int(input())\ntail = int(input())\ntrampled = int(input())\ncall = int(input())\nd = int(input())\n\ndiv = 0\nfor i in range(1,d+1):\n if i%punch==0 or i%tail==0 or i%trampled==0 or i%call==0:\n div += 1\n \nprint(div)", "lst = [int(input()), int(input()), int(input()), int(input())]\r\nn = int(input())\r\nans = [0] (n + 1)\r\nfor ratio in lst:\r\n for i in range(ratio, n + 1, ratio):\r\n ans[i] = 1\r\nprint(sum(ans))", "counter = 0\r\nk, l, m, n, d = int(input()),int(input()),int(input()),int(input()),int(input())\r\nd += 1\r\nx= [0] * d\r\ny = [1] * d\r\n\r\nif k == 1:\r\n print(d-1)\r\nelse:\r\n for i in (k,l,m,n):\r\n x[i::i] = y[i::i]\r\n print(sum(x[1:]))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\"\"\"\nA. Insomnia cure: constructive algorithms, implementation, math\n\ntime limit per test: 2 seconds\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\n«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.\nHowever, just counting dragons was boring as well, so she entertained herself at best she could.\nTonight she imagined that all dragons were here to steal her, and she was fighting them off.\nEvery k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door.\nEvery m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.\nHow many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?\n\nInput\nInput data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 10^5).\n\nOutput\nOutput the number of damaged dragons.\n\"\"\"\n\ndef insomnia_cure():\n k, l, m, n, d = (int(input()) for _ in range(5))\n o = 0\n for i in range(1, d + 1):\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\n o += 1\n print(o)\n\nif __name__ == '__main__':\n insomnia_cure()", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\nf=[]\r\nif (a==1)or(b==1)or(c==1)or(d==1):\r\n print(e)\r\nelse:\r\n for i in range(2,e+1):\r\n if ((i%a==0)or(i%b==0)or(i%c==0)or(i%d==0)):\r\n f.append(i)\r\n print(len(f))", "s=[]\r\nfor _ in range(4):\r\n s.append(int(input()))\r\nd = int(input())\r\np = 0\r\nfor i in range(1,d+1):\r\n if (i%s[0] != 0) and (i%s[1] != 0) and (i%s[2] != 0) and (i%s[3] != 0):\r\n p += 1\r\nprint(d - p)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nout=0\r\nfor i in range (1,d+1):\r\n flag=0\r\n if i%k==0:\r\n out+=1\r\n flag=1\r\n elif i%l==0 and flag==0:\r\n out+=1\r\n flag=1\r\n elif i%m==0 and flag==0:\r\n out+=1\r\n flag=1\r\n elif i%n==0 and flag==0:\r\n out+=1\r\n flag=1\r\nprint(out)", "hits = []\r\nrepeat = 1\r\nadd = []\r\nfor a in range(4):\r\n hits.append(int(input()))\r\ndragons = int(input())\r\nfor x in range(4):\r\n repeat = 1\r\n while(hits[x] * repeat <= dragons):\r\n add.append(hits[x] * repeat)\r\n repeat += 1\r\nprint(len(set(add)))", "x=int(input())\r\nx1=int(input())\r\nx2=int(input())\r\nx3=int(input())\r\nx4=int(input())\r\nc=0\r\nfor i in range(1,x4+1):\r\n if i%x!=0 and i%x1!=0 and i%x2!=0 and i%x3!=0 :c+=1\r\nprint(x4-c)", "li=[int(input())for i in range(4)]\r\nd1=int(input())\r\ncnt1=0\r\nfor i1 in range(1,d1+1):\r\n\tfor j1 in li:\r\n\t\tif i1%j1==0:\r\n\t\t\tcnt1+=1\r\n\t\t\tbreak\r\nprint(cnt1)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nli=[]\r\nif k==1 or l==1 or m==1 or n==1 :\r\n print(d)\r\nelse:\r\n for i in range(k, d+1, k):\r\n li.append(i)\r\n for i in range(l, d+1, l):\r\n li.append(i)\r\n for i in range(m, d+1, m):\r\n li.append(i)\r\n for i in range(n, d+1, n):\r\n li.append(i)\r\n s = set(li)\r\n print(len(s))\r\n\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nc1=0\r\nc2=0\r\nc3=0\r\nc4=0\r\nc5=0\r\nc6=0\r\nc7=0\r\nc8=0\r\nc9=0\r\nc10=0\r\nc11=0\r\nc12=0\r\nc13=0\r\nc14=0\r\nc15=0\r\nfor i in range(1,d+1):\r\n if (i%k==0):\r\n c1=c1+1\r\n \r\nfor i in range(1,1+d):\r\n if (i%l==0):\r\n c2=c2+1\r\n \r\nfor i in range(1,1+d):\r\n if (i%m==0):\r\n c3=c3+1\r\nfor i in range(1,1+d):\r\n if (i%n==0):\r\n c4=c4+1\r\nfor i in range(1,1+d):\r\n if (i%k==0 and i%l==0):\r\n c5=c5+1\r\nfor i in range(1,1+d):\r\n if (i%k==0 and i%m==0):\r\n c6=c6+1\r\nfor i in range(1,1+d):\r\n if (i%k==0 and i%n==0):\r\n c7=c7+1\r\nfor i in range(1,1+d):\r\n if (i%l==0 and i%m==0):\r\n c8=c8+1\r\nfor i in range(1,1+d):\r\n if (i%l==0 and i%n==0):\r\n c9=c9+1\r\nfor i in range(1,1+d):\r\n if (i%m==0 and i%n==0):\r\n c10=c10+1\r\nfor i in range(1,1+d):\r\n if(i%m==0 and i%l==0 and i%n==0 and i%k==0):\r\n c11=c11+1\r\nfor i in range(1,1+d):\r\n if(i%m==0 and i%n==0 and i%k==0):\r\n c12=c12+1\r\nfor i in range(1,1+d):\r\n if(i%m==0 and i%n==0 and i%l==0):\r\n c13=c13+1\r\nfor i in range(1,1+d):\r\n if(i%m==0 and i%l==0 and i%k==0):\r\n c14=c14+1 \r\nfor i in range(1,1+d):\r\n if(i%l==0 and i%n==0 and i%k==0):\r\n c15=c15+1 \r\n \r\nprint(c1+c2+c3+c4-c11-c5-c6-c7-c9-c8-c10+c12+c13+c14+c15) \r\n\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\ne = int(input())\r\nf1 = [i for i in range(1, e + 1)]\r\nj = 0\r\nfor i in f1:\r\n if i%a == 0 or i%b == 0 or i%c == 0 or i%d == 0:\r\n j += 1\r\nprint(j)\r\n \r\n ", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nans=0\r\nfor i in range(d):\r\n if(i+1)%k==0 or (i+1)%l==0 or (i+1)%n==0 or (i+1)%m==0:\r\n ans+=1\r\nprint(ans) ", "q,e=[int(input())for i in' '5];print(e-sum(all(i%x for x in q)for i in range(1,e+1)))", "import math\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\na=(d//k);b=(d//l);c=(d//m);f=(d//n);\r\nans=a+b+c+f-(d//math.lcm(k,l))-(d//math.lcm(l,m))-(d//math.lcm(n,m))-(d//math.lcm(k,n))-(d//math.lcm(k,m))-(d//math.lcm(l,n))-(d//math.lcm(k,math.lcm(l,math.lcm(m,n))))+(d//math.lcm(k,(math.lcm(l,m))))+(d//math.lcm(k,(math.lcm(l,n))))+(d//math.lcm(k,(math.lcm(n,m))))+(d//math.lcm(n,(math.lcm(l,m))));\r\nprint(str(ans))", "import sys\r\ndef read_input():\r\n return sys.stdin.readline().rstrip()\r\ndef funcion(num5,list1):\r\n list2 = [0] * num5\r\n for y in list1:\r\n for z in range(0,num5,y):\r\n if list2[z]:\r\n continue\r\n else:\r\n list2[z] = 1\r\n return list2.count(0)\r\nlist1 = []\r\nfor _ in range(4):\r\n list1.append(int(read_input()))\r\nnum5 = int(read_input()) + 1\r\nif 1 in list1:\r\n print(num5 - 1)\r\nelse:\r\n print(num5 - funcion(num5,list1) - 1)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\ndeath = 0\n\nfor vampire in range(1, d + 1):\n if vampire % k == 0 or vampire % l == 0 or vampire % m == 0 or vampire % n == 0:\n death += 1\n \nprint(death)\n\n#death here is just meant for the variable name, signalling the no. of damaged vampires\n\n\t\t\t\t \t \t\t\t \t \t\t \t \t\t \t\t", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\na = [0] * d\r\nfor i in range(k-1, d, k):\r\n a[i] = 1\r\nfor i in range(l-1, d, l):\r\n a[i] = 1\r\nfor i in range(m-1, d, m):\r\n a[i] = 1\r\nfor i in range(n-1, d, n):\r\n a[i] = 1\r\nprint(sum(a))\r\n \r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\ncounter=0\r\n\r\nfor x in range(1,d+1):\r\n if x % k == 0 or x % l ==0 or x % m == 0 or x % n == 0:\r\n counter+=1\r\nprint(counter)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nx= 0\r\n\r\nfor i in range(1,d+1):\r\n if i%k ==0 or i%l ==0 or i%m ==0 or i%n ==0:\r\n x+=1\r\nprint(x)\r\n\r\n\r\n\r\n\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ng=[]\r\nfor i in range(0,d+1,k):\r\n g.append(i)\r\nfor i in range(0,d+1,l):\r\n g.append(i)\r\nfor i in range(0,d+1,m):\r\n g.append(i)\r\nfor i in range(0,d+1,n):\r\n g.append(i)\r\nv=set(g)\r\nprint(len(v)-1)\r\n\r\n", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\nc = [0] * d\r\ncount = 0\r\nfor i in range(k-1, d, k):\r\n c[i] += 1\r\nfor i in range(l-1, d, l):\r\n c[i] += 1\r\nfor i in range(m-1, d, m):\r\n c[i] += 1\r\nfor i in range(n-1, d, n):\r\n c[i] += 1\r\nprint(sum(1 for j in c if j > 0))", "actions = []\r\nfor i in range(4):\r\n act = int(input())\r\n actions.append(act)\r\ncount = int(input())\r\ndragons = [0 for a in range(count)]\r\nfor i in actions:\r\n j = 0\r\n while j < len(dragons):\r\n if (j + 1) % i == 0:\r\n dragons[j] += 1\r\n j += 1\r\n\r\n\r\nprint(count - dragons.count(0))", "k,l,m,n,d=int(input()),int(input()),int(input()),int(input()),int(input())\r\nli=[]\r\nfor i in range(1,d+1):\r\n if i%k==0:\r\n li.append(i)\r\nfor i in range(1,d+1):\r\n if i%l==0:\r\n li.append(i)\r\nfor i in range(1,d+1):\r\n if i%m==0:\r\n li.append(i)\r\nfor i in range(1,d+1):\r\n if i%n==0:\r\n li.append(i)\r\nprint(len(set(li)))", "def main():\n damage_numbers = list()\n dragons_hurt = 0\n damage_numbers.append(int(input()))\n damage_numbers.append(int(input()))\n damage_numbers.append(int(input()))\n damage_numbers.append(int(input()))\n\n num_dragons = int(input())\n\n for dragon_num in range(num_dragons):\n for damage_number in damage_numbers:\n if (dragon_num + 1) % damage_number == 0:\n dragons_hurt += 1\n break\n\n print(dragons_hurt)\n\n\nif __name__ == \"__main__\":\n main()", "k, l, m, n, d = [int(input()) for i in range(5)]\r\n\r\nc = 0\r\nfor i in range(1, d+1):\r\n if any(map(lambda x: i%x == 0, [k,l,m,n])):\r\n c += 1\r\nprint(c)\r\n", "\n\ndef function(k,l,m,n,d):\n output=[]\n \n for number in range(1,d+1):\n if not (number%k==0 or number%l==0 or number%m==0 or number%n==0):\n output.append(number)\n \n print(d-len(output))\n \n \n \n \n \n \n \ndef main():\n \n k = int(input())\n l = int(input())\n m = int(input())\n n = int(input())\n d = int(input())\n \n \n function(k, l, m, n, d)\n\n\nif __name__ == \"__main__\":\n main()", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\ne = int(input())\r\nif a==1 or b==1 or c==1 or d==1:\r\n print(e)\r\nelse:\r\n k = 0\r\n for i in range(1,e+1):\r\n if i%a==0 or i%b==0 or i%c==0 or i%d==0:\r\n k+=1\r\n print(k)\r\n \r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nj = int(input())\r\nd = int(input())\r\ncount = 0\r\nfor i in range(1,d+1):\r\n if i % k != 0 and i % l != 0 and i % m != 0 and i %j != 0:\r\n count += 1\r\n \r\nprint(d-count)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\nans=0\n\nfor rep in range(1, d+1):\n if any([rep%k==0, rep%l==0, rep%m==0, rep%n==0]):\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", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\nx=e\r\nfor z in range(1,e+1):\r\n if z%a==0 or z%b==0 or z%c==0 or z%d==0:\r\n pass\r\n else:\r\n x-=1\r\nprint(x)", "k=int(input());l=int(input());m=int(input());n=int(input());d=int(input())\r\ncount=0\r\nfor i in range(1,d+1):\r\n if (i%k==0) or (i%l==0) or (i%m==0) or (i%n==0):\r\n count+=1\r\nprint(count)", "t=int(input())\r\nl=int(input())\r\nx=int(input())\r\ny=int(input())\r\nd=int(input())\r\nc=0\r\n\r\nfor i in range(1,d+1):\r\n if(i%t==0 or i %l==0 or i%x==0 or i%y==0):\r\n c+=1\r\nprint(c)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount = 0\r\nfor i in range(1,d+1):\r\n if (i%k==0):\r\n count = count + 1\r\n elif (i%l==0):\r\n count = count + 1\r\n elif (i%m==0):\r\n count = count + 1\r\n elif (i%n==0):\r\n count = count + 1\r\n else:\r\n pass\r\nprint(count)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\np=0\r\na = [0] * d\r\nj = [k, l , m ,n]\r\nfor i in j:\r\n for r in range(i,d+1,i):\r\n a[r-1]=1\r\n \r\n \r\nfor b in range(d):\r\n p+=a[b]\r\nprint(p)\r\n", "k_dragon = int(input())\r\nl_dragon = int(input())\r\nm_dragon = int(input())\r\nn_dragon = int(input())\r\ncol_dragons = int(input())\r\ndragons = [_ for _ in range(1, col_dragons + 1)]\r\nvictims_dragons = 0\r\n\r\nfor dragon in dragons:\r\n if dragon % k_dragon == 0:\r\n victims_dragons += 1\r\n continue\r\n elif dragon % l_dragon == 0:\r\n victims_dragons += 1\r\n continue\r\n elif dragon % m_dragon == 0:\r\n victims_dragons += 1\r\n continue\r\n elif dragon % n_dragon == 0:\r\n victims_dragons += 1\r\n continue\r\nprint(victims_dragons)\r\n\r\n\r\n", "def main():\r\n a=list()\r\n h=0\r\n a.append(int(input()))\r\n a.append(int(input()))\r\n a.append(int(input()))\r\n a.append(int(input()))\r\n nums=int(input())\r\n for num in range(nums):\r\n for k in a:\r\n if (num+1)%k==0:\r\n h+=1\r\n break\r\n print(h)\r\nif __name__ == \"__main__\":\r\n main()", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ndata = set()\r\n\r\nfor i in range(1, d+1):\r\n if (i%k == 0) or (i%l == 0) or (i%m == 0) or (i%n == 0):\r\n data.add(i)\r\n \r\nprint(len(data))", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nq=[k,l,m,n]\r\nx=0\r\nfor i in range (1,d+1):\r\n for j in q :\r\n if i%j!=0:\r\n continue\r\n else:\r\n break\r\n else: \r\n x+=1\r\nprint(d-x)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ndragons_list = [None]d\r\n\r\nfor i in range(1,d+1):\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:\r\n dragons_list[i-1] = 1\r\nprint(d-dragons_list.count(None))\r\n\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\ntotal = int(input())\r\n\r\n\r\nif 1 in set([a, b, c, d]):\r\n print(total)\r\n\r\nelif [a, b, c, d] > [total, total, total, total]:\r\n print(0)\r\n\r\nelse:\r\n sum = 0\r\n for i in range(1, total+1):\r\n if i % a == 0:\r\n sum += 1\r\n elif i % b == 0:\r\n sum += 1\r\n elif i % c == 0:\r\n sum += 1\r\n elif i % d == 0:\r\n sum += 1\r\n print(sum)\r\n", "k, l, m, n, d =int(input()), int(input()), int(input()), int(input()), int(input())\r\nmylist = [k, l, m, n]\r\nnum_counter = 1; damged_dragons = 0\r\nwhile num_counter <= d:\r\n for num in mylist:\r\n if num_counter % num == 0:\r\n damged_dragons += 1\r\n break\r\n num_counter += 1\r\n\r\nprint(damged_dragons)", "k,l,m,n,d=map(int,[input() for i in range(5)])\r\na=set()\r\nk1,l1,m1,n1=k,l,m,n\r\nwhile(k<=d):\r\n\ta.add(k)\r\n\tk+=k1 \r\nwhile(l<=d):\r\n\ta.add(l)\r\n\tl+=l1 \r\nwhile(m<=d):\r\n\ta.add(m)\r\n\tm+=m1 \r\nwhile(n<=d):\r\n\ta.add(n)\r\n\tn+=n1 \r\nprint(len(a))", "dragons = []\r\nj = 0\r\n\r\nwhile j < 5:\r\n dragons.append(int(input()))\r\n j += 1\r\n\r\n\r\ncounter = 0\r\n\r\nfor i in range(1, dragons[-1] + 1):\r\n if any(i % dragon == 0 for dragon in dragons[0:4]):\r\n counter += 1\r\n\r\nprint(counter)\r\n", "ip=[]\r\nfor _ in range(5):\r\n ip.append(int(input()))\r\nk,l,m,n,d=ip\r\nif 1 in ip[:4]:\r\n print(d)\r\nelse:\r\n ret=0\r\n for i in range(1,d+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0:\r\n ret+=1\r\n print(ret)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nh = list(range(1, d+1))\r\nh1 = []\r\nfor i in range(d):\r\n if h[i] % k == 0 or h[i] % l == 0 or h[i] % m == 0 or h[i] % n ==0:\r\n h1.append(h[i])\r\nprint(len(h1))\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ndmg=0\r\nfor i in range(1,d+1,1):\r\n if (i%k==0) or (i%l==0) or (i%m==0) or (i%n==0):\r\n dmg=dmg+1\r\nprint(dmg)", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\na = set()\n[a.update(set(e)) for e in (range(k-1, d, k), range(l-1, d, l), range(m-1, d, m), range(n-1, d, n))]\n\nprint(len(a))\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n#ed=[k,l,m,n]\r\ndr=[]\r\ni=0\r\nwhile i<d:\r\n dr.append(1)\r\n i+=1\r\np=0\r\nwhile p+k<=d:\r\n dr[p+k-1]=0\r\n p+=k\r\np=0\r\nwhile p+l<=d:\r\n dr[p+l-1]=0\r\n p+=l\r\np=0\r\nwhile p+m<=d:\r\n dr[p+m-1]=0\r\n p+=m\r\np=0\r\nwhile p+n<=d:\r\n dr[p+n-1]=0\r\n p+=n\r\np=0\r\nfor i in dr:\r\n if i==0:\r\n p+=1\r\nprint(p)\r\n\r\n\r\n\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nnum=int(input())\r\ncount= 0\r\nfor i in range(1,num+1):\r\n if i%a== 0 or i%b== 0 or i%c== 0 or i%d== 0:\r\n count+= 1\r\nprint(count)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ndrgs = [1 for _ in range(d)]\r\narr = [k, l, m, n]\r\nfor i in range(1, d+1):\r\n if drgs[i-1] == 0:\r\n continue\r\n for let in arr:\r\n if i % let == 0:\r\n drgs[i-1] = 0\r\nprint(d - sum(drgs))", "def hcf(a, b):\r\n while b:\r\n a, b= b, a%b\r\n return a\r\n\r\ndef lcm(a, b):\r\n a, b = max(a,b), min(a,b)\r\n return (ab) // hcf(a,b)\r\n \r\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nlst = [k,l,m,n]\r\nif 1 in lst:\r\n print(d)\r\nelse:\r\n temp = lcm(lcm(k,l), lcm(m,n))\r\n print(d//k + d//l + d//m + d//n - ((d//lcm(k,l)) + (d//lcm(k,m)) + (d//lcm(k,n)) + (d//lcm(l,m)) + (d//lcm(l,n)) + (d//lcm(m,n))) + (d//lcm(k, lcm(l,m))) + (d//lcm(k, lcm(l,n))) + (d//lcm(k, lcm(m,n))) + (d//lcm(l, lcm(m,n))) - (d//lcm(lcm(k,l), lcm(m,n))))", "q = []\r\na = int(input())\r\nb = int(input())\r\nl = int(input())\r\nk = int(input()) \r\nd = int(input())\r\nfor i in range(1,d+1):\r\n if i % a == 0:\r\n q.append(i)\r\n elif i % b == 0:\r\n q.append(i)\r\n elif i % l == 0:\r\n q.append(i)\r\n elif i % k == 0:\r\n q.append(i)\r\nprint(len(q))", "from math import \r\nk =int(input())\r\nl =int(input())\r\nm =int(input())\r\nn =int(input())\r\nd =int(input())\r\ndef lcm (num):\r\n minimum = 1\r\n for i in num:\r\n minimum = i minimum // gcd(i, minimum)\r\n return minimum\r\n\r\nres=(d//k\r\n +d//l\r\n -d//(lcm(k,l))\r\n +d//m\r\n -d//(lcm(k,m))\r\n -d//(lcm(l,m))\r\n +d//(lcm(k,l,m))\r\n +d//n\r\n -d //(lcm(k,n))\r\n -d //(lcm(l,n))\r\n -d //(lcm(m,n))\r\n +d //(lcm(k,l,n))\r\n +d //(lcm(k,m,n))\r\n +d //(lcm(l,m,n))\r\n -d //(lcm(k,l,m,n))\r\n)\r\nprint(res)\r\n", "z = [int(input()) for x in range(4)]\r\ncount = 0\r\nd = int(input())\r\nfor i in range(1 , d + 1) :\r\n if i % z[0] == 0 or i % z[1] == 0 or i % z[2] == 0 or i % z[3] == 0 :\r\n continue\r\n else : \r\n count += 1\r\nprint(d - count)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nck = 0\r\ncl = 0\r\ncm = 0\r\ncn = 0\r\nfinal = 0\r\ni = 0\r\nwhile i<d:\r\n \r\n for i in range(1,d+1):\r\n if i%k == 0:\r\n ck = ck +1 \r\n elif i%l == 0 :\r\n cl = cl+1\r\n elif i%m == 0 :\r\n cm= cm+1\r\n elif i%n == 0 :\r\n cn = cn+1\r\n\r\n final = ck + cl+cm+cn\r\n print(final)", "factors = []\r\nfor x in range(4):\r\n factors.append(int(input()))\r\ntotal = int(input())\r\nans = 0\r\nfor x in range(1, total + 1):\r\n for factor in factors:\r\n if x % factor == 0:\r\n ans += 1\r\n break\r\nprint(ans)\r\n ", "list=[]\r\nfor i in range(4):\r\n list.append(int(input()))\r\nn=int(input())\r\nnum=set()\r\nfor i in range(4):\r\n shu=list[i]\r\n former=list[i]\r\n while shu<=n :\r\n num.add(shu)\r\n shu+=former\r\nprint(len(num))", "k=int(input())\r\nj=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nl=[]\r\nc=0\r\nfor i in range(1,d+1):\r\n l.append(i)\r\nfor i in range(d): \r\n if l[i]%k==0:c+=1\r\n elif l[i]%j==0:c+=1\r\n elif l[i]%m==0:c+=1\r\n elif l[i]%n==0:c+=1\r\nprint(c)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\narr = [i+1 for i in range(d)]\r\n\r\nfor i in range(d):\r\n if arr[i] % k == 0 or arr[i] % l == 0 or arr[i] % m == 0 or arr[i] % n == 0:\r\n arr[i] = -1\r\n\r\nprint(arr.count(-1))\r\n", "e,f,g,h,m=map(int,(input() for i in range(5)))\nl=0\nfor i in range(1,m+1):\n if i%e and i%f and i%g and i%h:\n continue\n else:\n l+=1\nprint(l)\n \t \t \t \t \t \t\t\t\t\t\t \t\t \t\t \t", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nif k==1 or l==1 or m==1 or n==1:\r\n print(d)\r\nelse:\r\n c=0\r\n for j in range(1,d+1):\r\n if j%k!=0 and j%l!=0 and j%m!=0 and j%n!=0:\r\n continue\r\n else:c+=1\r\n print(c)\r\n ", "w=[]\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nw.extend([k,l,m,n])\r\nr=0\r\nfor d1 in range(d+1):\r\n for w1 in w:\r\n if d1%w1==0 and d1!=0:\r\n r+=1\r\n break\r\nprint(r)", "k,l,m,n,d=[int(input()) for i in range(5)]\r\nfor i in range(d):\r\n x=i+1\r\n if x%k!=0 and x%l!=0 and x%m!=0 and x%n!=0:\r\n d-=1\r\nprint(d)\r\n", "a = []\r\nfor i in range(4):\r\n a.append(int(input()))\r\n\r\nd = int(input())\r\nif 1 in a:\r\n print(d)\r\n exit()\r\ntmp = [False for _ in range(d + 1)]\r\n\r\nfor i in a:\r\n t = i\r\n while t <= d:\r\n tmp[t] = True\r\n t += i\r\nres = 0\r\nfor i in tmp:\r\n if i:\r\n res += 1\r\n\r\nprint(res)", "import sys\r\n\r\nk = int(sys.stdin.readline().split()[0])\r\nl = int(sys.stdin.readline().split()[0])\r\nm = int(sys.stdin.readline().split()[0])\r\nn = int(sys.stdin.readline().split()[0])\r\nd = int(sys.stdin.readline().split()[0])\r\n\r\ninjured_dragons = [0 for i in range(d)]\r\n\r\nindex_k = k - 1\r\nindex_l = l - 1\r\nindex_m = m - 1\r\nindex_n = n - 1\r\n\r\ni = 0\r\n\r\nwhile i < d:\r\n if index_k <= d - 1:\r\n injured_dragons[index_k] = 1\r\n if index_l <= d - 1:\r\n injured_dragons[index_l] = 1\r\n if index_m <= d - 1:\r\n injured_dragons[index_m] = 1\r\n if index_n <= d - 1:\r\n injured_dragons[index_n] = 1\r\n\r\n index_k += k\r\n index_l += l\r\n index_n += n\r\n index_m += m\r\n\r\n i += 1\r\n\r\nprint(sum(injured_dragons))", "w = int(input())\r\nx = int(input())\r\ny = int(input())\r\nz = int(input())\r\nq = int(input())\r\ns = 0\r\nfor i in range(1,q + 1):\r\n if i % w == 0 or i % x == 0 or i % y == 0 or i % z == 0:\r\n s += 1\r\nprint(s)", "damages = []\r\nfor _ in range(4):\r\n damages.append(int(input()))\r\nd = int(input())\r\ndamaged = set()\r\nfor damage in damages:\r\n for dragon in range(1,d+1):\r\n if not dragon%damage and dragon not in damaged:\r\n damaged.add(dragon)\r\nprint(len(damaged))\r\n", "from collections import \r\n# from math import ceil, gcd,inf\r\nfrom functools import \r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\nZ=5\r\narr=[]\r\nfor _ in range(Z):\r\n arr.append(int(input()))\r\nlist1=list(range(1,arr[-1]+1)) \r\nlist1=[0]+list1 \r\nprint(len(set(list1[arr[0]::arr[0]]+list1[arr[1]::arr[1]]+list1[arr[2]::arr[2]]+list1[arr[3]::arr[3]])))\r\n \r\n ", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nlistd=[]\r\nfor i in range(1,d+1,1):\r\n listd.append(i)\r\nunh = []\r\nfor j in listd:\r\n if j%k!=0:\r\n if j % l != 0:\r\n if j % m != 0:\r\n if j % n != 0:\r\n unh.append(i)\r\nprint(len(listd)-len(unh))", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\nsimp = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\ndef main():\r\n k = int(input())\r\n l = int(input())\r\n m = int(input())\r\n n = int(input())\r\n d = int(input())\r\n cnt = 0\r\n for i in range(1, d+1, 1):\r\n if i % l == 0 or i % k == 0 or i % m == 0 or i % n == 0:\r\n cnt += 1\r\n print(cnt)\r\nif __name__ == \"__main__\":\r\n main()", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nv = int(input())\r\nn = int(input())\r\na1 = []\r\nb1 = []\r\nc1 = []\r\nv1 = []\r\nfor i in range(1,n+1):\r\n if i%a == 0:\r\n a1.append(i)\r\n elif i%b == 0:\r\n b1.append(i)\r\n elif i%c == 0:\r\n c1.append(i)\r\n elif i%v == 0:\r\n v1.append(i)\r\nprint(len(set(a1+b1+c1+v1)))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nnums = [num for num in range(1, d+1) if num % k != 0 and num % l != 0 and num % m != 0 and num % n != 0]\r\nprint(d-len(nums))\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\na = [0]d\r\nans = 0\r\n\r\nfor i in range(1, d+1):\r\n if(i%k == 0 or i %l ==0 or i % m == 0 or i%n == 0):\r\n ans = ans +1 \r\n\r\nprint(ans)", "import sys\ninput = sys.stdin.readline()\nk = int(input)\ninput = sys.stdin.readline()\nl = int(input)\ninput = sys.stdin.readline()\nm = int(input)\ninput = sys.stdin.readline()\nn = int(input)\ninput = sys.stdin.readline()\nd = int(input)\n\narr = [False] (1 + d)\nfor i in range(k, d + 1, k):\n arr[i] = True\nfor i in range(l, d + 1, l):\n arr[i] = True\nfor i in range(m, d + 1, m):\n arr[i] = True\nfor i in range(n, d + 1, n):\n arr[i] = True\nres = 0\nfor a in arr:\n if a:\n res += 1\nprint(res)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\ntotal = [0]d\nfor i in range(d):\n total[i] = i+1\nharmed = []\nfor i in total:\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:\n harmed.append(1)\nprint(len(harmed))\n \t\t\t \t \t \t \t \t \t\t\t\t \t\t", "k,l,m,n,d = int(input()),int(input()),int(input()),int(input()),int(input())\r\ndiv = [k,l,m,n]\r\ncnt = 0\r\nfor i in range(1,d+1):\r\n for j in div:\r\n if i%j == 0:\r\n cnt += 1\r\n break\r\nprint(cnt)", "\r\ndef number():\r\n return(list(map(int,input().split())))\r\ndef strinp():\r\n return(list(input().split()))\r\n\r\ndef lcms(x, y):\r\n if x > y:\r\n greater = x\r\n else:\r\n greater = y\r\n while(True):\r\n if((greater % x == 0) and (greater % y == 0)):\r\n lcm = greater\r\n break\r\n greater += 1\r\n return lcm\r\n\r\n\r\nA=number()[0]\r\nB=number()[0]\r\nC=number()[0]\r\nD=number()[0]\r\ntot=number()[0]\r\n\r\ndef P(a,b,c=None):\r\n if c:\r\n return(tot//(lcms(lcms(a,b),c)))\r\n else:\r\n return(tot//lcms(a,b))\r\naa=tot//A\r\nbb=tot//B\r\ncc=tot//C\r\ndd=tot//D\r\n\r\nans = aa+bb+cc+dd-P(A,B)-P(A,C)-P(A,D)- P(B,C)-P(B,D)-P(C,D)+P(A,B,C)+P(A,B,D)+P(A,C,D)+P(B,C,D)-tot//(lcms(lcms(A,B),lcms(C,D)))\r\nprint(int(ans))", "ans=[]\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nk=int(input())\r\nfor i in range(a,k+1,a):\r\n if i<=k:\r\n ans+=[i]\r\nfor i in range(b,k+1,b):\r\n if i<=k:\r\n ans+=[i]\r\nfor i in range(c,k+1,c):\r\n if i<=k:\r\n ans+=[i]\r\nfor i in range(d,k+1,d):\r\n if i<=k:\r\n ans+=[i]\r\nprint(len(list(set(ans))))\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nlis=[]\r\nfor i in range(1,(d+1)):\r\n lis.append(i)\r\ncopy=[]\r\nfor i in lis:\r\n if (i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0):\r\n copy.append(i)\r\n\r\nprint(len(lis)-len(copy))", "cnt=0\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ncnt=d\r\nif k==0 or l==0 or m==0 or n==0:\r\n print(d)\r\nelse:\r\n for i in range(1,d+1):\r\n if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:\r\n cnt-=1\r\n print(cnt)\r\n \r\n ", "arr = [int(input()) for i in range(4)]\r\nn = int(input())\r\n\r\nans = 0\r\nfor i in range(1, n+1):\r\n for j in arr:\r\n if i % j == 0:\r\n ans += 1\r\n break\r\n \r\nprint(ans)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\nf = int(input())\r\ng = 0\r\nfor i in range(1, f + 1):\r\n if a == 1 or (a != 1 and i % a == 0) or i % b == 0 or i % c == 0 or i % d == 0:\r\n g += 1\r\n\r\nprint(g)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount = 0\r\nfor c in range(d, 0, -1):\r\n if c % k == 0 or c % l == 0 or c % m == 0 or c % n == 0:\r\n count += 1\r\nprint(count)\r\n", "a = int(input());b = int(input());c = int(input());d = int(input());e = int(input())\r\nres = 0\r\nfor i in range(1, e+1):\r\n if i % a == 0 or i % b == 0 or i % c == 0 or i % d == 0:res += 1\r\nprint(res)", "l = [int(input()) for d in range(5)]\r\ncounter = 0\r\ndragons = [i for i in range(1, l[-1]+1)]\r\nfor i in range(4):\r\n for j in range(l[i]-1, l[-1], l[i]):\r\n if dragons[j] > 0:\r\n counter += 1\r\n dragons[j] = -1\r\nprint(counter)\r\n", "\r\ndiv = [ int(input()) for i in range(4) ]\r\nnum = int(input())\r\n\r\ndef get_arr(arr):\r\n div = sorted(list(set(arr)))\r\n new = [arr[0]]\r\n \r\n for i in range(1 , 4):\r\n is_div = False \r\n for ele in new :\r\n if arr[i]%ele == 0 :\r\n is_div = True\r\n break\r\n if not is_div :\r\n new.append(arr[i] )\r\n \r\n return new\r\n\r\ndef func(div , num):\r\n \r\n div = get_arr( div )\r\n if div[0] == 1:\r\n print(num)\r\n return;\r\n \r\n s = 0\r\n \r\n for i in range(1 , num+1):\r\n \r\n is_div = 0 \r\n for ele in div:\r\n if i % ele == 0 :\r\n is_div = 1 \r\n break\r\n \r\n s += is_div\r\n \r\n print(s)\r\n\r\nfunc(div , num)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n# print(k,l,m,n,d,dragon)\r\ndragon = [1](d+1)\r\ncount = 0\r\n\r\nfor i in range(k, d+1, k):\r\n dragon[i] = 0\r\nfor i in range(l, d+1, l):\r\n dragon[i] = 0\r\nfor i in range(m, d+1, m):\r\n dragon[i] = 0\r\n\r\nfor i in range(n, d+1, n):\r\n dragon[i] = 0\r\n\r\nfor it in dragon:\r\n if it == 0:\r\n count += 1\r\n\r\n\r\nprint(count)\r\n", "def solve(k,l,m,n,d):\r\n ans=0\r\n for i in range(1,d+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0:\r\n ans+=1\r\n print(ans)\r\n\r\ndef main():\r\n\r\n k=int(input())\r\n l=int(input())\r\n m=int(input())\r\n n=int(input())\r\n d=int(input())\r\n solve(k,l,m,n,d)\r\nmain()", "alist = [] * 5\r\nfor i in range(5):\r\n alist.append(int(input()))\r\nk, li, m, n, d = alist\r\nalist = [i for i in range(1, d + 1)]\r\nans = 0\r\nfor value in alist:\r\n if value % k == 0:\r\n ans += 1\r\n elif value % li == 0:\r\n ans += 1\r\n elif value % m == 0:\r\n ans += 1\r\n elif value % n == 0:\r\n ans += 1\r\n\r\nif ans <= d:\r\n print(ans)\r\nelse:\r\n print(d)\r\n", "k, l, m, n, d = map(int, (input(),input(),input(),input(),input()))\r\nlst = []\r\n\r\nfor i in range(1, d+1):\r\n if i % k != 0 and i % l != 0 and i % m != 0 and i % n != 0:\r\n lst.append(i)\r\n\r\nprint(d-len(lst))", "\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ncount = 0 \r\n\r\nfor num in reversed(range(1, d+1)):\r\n if num % k == 0 or num % l == 0 or num % m == 0 or num % n == 0:\r\n count += 1\r\n \r\n \r\nprint(count)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne,z=int(input()),0\r\nfor i in range(1,e+1):\r\n if i%a==0 or i%b==0 or i%c==0 or i%d==0:\r\n z+=1\r\nprint(z)", "Uno = int(input())\r\nDos = int(input())\r\nTres = int(input())\r\nCuatro = int(input())\r\nTotal = int(input())\r\ncount = 0\r\nArray = []\r\n\r\nfor i in range(Total):\r\n if (i + 1) % Uno == 0 or (i + 1) % Dos == 0 or (i + 1) % Tres == 0 or (i + 1) % Cuatro == 0:\r\n count = count + 1\r\n\r\nprint(count)\r\n\r\n", "# x=[int(input()) for i in range(4)]\r\n# d=int(input())\r\n# dictt={}\r\n# for p in range(1,d+1):\r\n# \tdictt[p]=0\r\n\r\n# for j in x:\r\n# \ta=j\r\n# \twhile a<=d:\r\n# \t\tdictt[a]+=1\r\n# \t\ta+=j\r\n# y=0\r\n# for i in dictt:\r\n# \tif dictt[i]==0:\r\n# \t\ty+=1\r\n# print(d-y)\r\nl = [int(input()) for i in range(4)]\r\nm = int(input())\r\nprint(len(set([i for i in range(1, m+1) for j in l if i % j == 0])))", "def main():\r\n k, l, m, n, d = [int(input()) for _ in range(5)]\r\n count = 0\r\n if 1 in (k, l, m, n):\r\n print(d)\r\n return\r\n count = d\r\n for i in range(1, d+1):\r\n if i % k and i % l and i % m and i % n:\r\n count -= 1\r\n print(count)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "# 148A - Insomnia Cure\r\n# https://codeforces.com/problemset/problem/148/A\r\n\r\n# Inputs:\r\n# 1) k = k-ésimo dragón atacado con sartén \r\n# 2) l = l-ésimo dragón arrojado al balcón \r\n# 3) m = m-ésimo dragón aplastado con tacón \r\n# 4) n = n-ésimo dragón que huyó\r\n# 5) Número de dragones\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\ndragones = int(input())\r\n\r\n# Lista de dragones atacados con sartén (k)\r\ndragones_k = []\r\n\r\n# Saca los dragones atacados con sartén (k)\r\nfor d in range(k,dragones+1,k):\r\n dragones_k.append(d)\r\n\r\n# Lista de dragones arrojados al balcón (l)\r\ndragones_l = []\r\n\r\n# Saca los dragones arrojados al balcón (l)\r\nfor d in range(l,dragones+1,l):\r\n dragones_l.append(d)\r\n\r\n# Lista de dragones aplastados con tacón (m)\r\ndragones_m = []\r\n\r\n# Saca los dragones aplastados con tacón (m)\r\nfor d in range(m,dragones+1,m):\r\n dragones_m.append(d)\r\n\r\n# Lista de dragones que huyeron (n)\r\ndragones_n = []\r\n\r\n# Saca los dragones que huyeron (n)\r\nfor d in range(n,dragones+1,n):\r\n dragones_n.append(d)\r\n\r\n# Saca la unión de las 4 listas \r\n# La unión (U) eliminará los duplicados\r\n# Cuenta cuántos dragones fueron atacados\r\ndragones_atacados = len(list(set(dragones_k) \| set(dragones_l) \| set(dragones_m) \| set(dragones_n)))\r\n\r\n# Imprime el número de dragones atacados\r\nprint(dragones_atacados)\r\n\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nl1=[]\r\nfor i in range(1,d+1):\r\n if(i%k==0) or (i%l==0) or (i%m==0) or (i%n==0):\r\n l1.append(i)\r\nprint(len(l1))\r\n \r\n ", "#### Решение задач проекта CODEFORSES, Задача 148A\r\n#\r\n# (C) 2023 Артур Ще, Москва, Россия\r\n# Released under GNU Public License (GPL)\r\n# email [email protected]\r\n# -----------------------------------------------------------\r\n\r\n'''\r\nA. Средство от бессонницы\r\nограничение по времени на тест2 seconds\r\nограничение по памяти на тест256 megabytes\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\n«Раз дракон. Два дракон. Три дракон», — считала принцесса. У нее была бессонница, а считать барашков ей надоело еще в\r\nдевять лет.\r\n\r\nВпрочем, считать драконов просто так тоже было скучно, поэтому она развлекалась как могла. Этой ночью она представляла,\r\nчто все посчитанные драконы явились сюда, чтобы ее украсть, а она отбивается от них, как может. Каждого k-ого дракона \r\nона била сковородкой по морде. Каждому l-ому — прищемляла хвост балконной дверью. Каждому m-ому — наступала на лапу\r\nострым каблучком. Наконец, каждому n-ому она грозила позвать мамочку, и он в ужасе ретировался.\r\n\r\nСкольким воображаемым драконам успела нанести моральный или физический ущерб принцесса, если всего она насчитала d драконов?\r\n\r\nВходные данные\r\nВходные данные содержат целые числа k, l, m, n и d, каждое число в отдельной строке (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).\r\n\r\nВыходные данные\r\nВыведите количество пострадавших драконов.\r\n'''\r\n\r\na1=int(input())\r\na2=int(input())\r\na3=int(input())\r\na4=int(input())\r\naall=int(input())\r\npos = 0\r\nfor q in range(1,aall+1):\r\n if q % a1 == 0:\r\n pos=pos+1\r\n continue\r\n if q % a2 == 0:\r\n pos=pos+1\r\n continue\r\n if q % a3 == 0:\r\n pos=pos+1\r\n continue\r\n if q % a4 == 0:pos=pos+1\r\nprint(pos)\r\n", "a = int(input())\nb = int(input())\nc = int(input())\nd = int(input())\ne = int(input())\n\ncount = 0\nfor i in range(1,e+1):\n if (i%a == 0 or i%b == 0 or i%c == 0 or i%d == 0):\n count+=1\nprint(count) \n\n \t\t \t\t\t\t\t\t \t \t \t\t \t \t\n \t \t \t\t \t\t\t\t\t\t \t\t \t\t \t\t \t \t", "k, l, m, n, d = [int(input()) for _ in range(5)]\r\nresult = sum(1 for i in range(1, d + 1) if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0)\r\nprint(result)\r\n", "k = int(input()) # k-th dragon gets punched\r\nl = int(input()) # l-th dragon gets tail shut\r\nm = int(input()) # m-th dragon gets paws trampled\r\nn = int(input()) # n-th dragon withdraws in panic\r\nd = int(input()) # Total number of dragons\r\n\r\ndamaged_dragons = 0 # Initialize the count of damaged dragons\r\n\r\nfor dragon in range(1, d + 1):\r\n if dragon % k == 0 or dragon % l == 0 or dragon % m == 0 or dragon % n == 0:\r\n damaged_dragons += 1\r\n\r\nprint(damaged_dragons)\r\n", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\nc = 0\nfor i in range(1,d+1):\n if i%k == 0 or i%l == 0 or i%m ==0 or i%n == 0:\n c = c+1\nprint(c)\n \t\t \t\t \t\t\t \t\t \t \t\t\t\t \t\t \t", "n=[int(input()) for x in range(5)]\r\nd=n.pop()\r\na=[0](d+1)\r\nfor x in n:\r\n a[::x]=[1]len(a[::x])\r\nprint(sum(a)-1)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\nkList = []\nlList = []\nmList = []\nnList = []\ncountNot = 0\nfor i in range(k, d + 1, k):\n kList.append(i)\nfor i in range(l, d + 1, l):\n lList.append(i)\nfor i in range(m, d + 1, m):\n mList.append(i)\nfor i in range(n, d + 1, n):\n nList.append(i)\ntotalList = kList + lList + mList + nList\nmodifiedList = list(set(totalList))\nprint(len(modifiedList))", "count = 0\nvar_list = []\n\nwhile count != 5:\n b = int(input())\n var_list.append(b)\n count +=1\n\nd = var_list.pop(4)\ndamage = 0\nfor i in range(1, d+1):\n for j in var_list:\n if i%j == 0:\n damage += 1\n break\nprint(damage)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\na = [i for i in range(1, d+1)]\nb=[]\n\nfor i in a:\n if i%k==0:\n b.append(i)\n elif i%l==0:\n b.append(i)\n elif i%m==0:\n b.append(i)\n elif i%n==0:\n b.append(i)\n \n\n\nprint(len(b))\n\t \t \t \t \t \t \t \t \t \t \t", "c = 0\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nif (k or l or m or n) == 1 :\r\n print(d)\r\nelse :\r\n for i in range(1,d+1) :\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0 :\r\n c+=1 \r\n print(c)\r\n", "# Read input\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n# Initialize the counter for damaged dragons\r\ndamaged_count = 0\r\n\r\n# Iterate through each dragon\r\nfor dragon in range(1, d + 1):\r\n if dragon % k == 0 or dragon % l == 0 or dragon % m == 0 or dragon % n == 0:\r\n damaged_count += 1\r\n\r\n# Print the number of damaged dragons\r\nprint(damaged_count)\r\n", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\nt = [False] * d\r\ncount = 0\r\nfor i in range(d):\r\n if (i + 1) % k == 0 or (i + 1) % l == 0 or (i + 1) % m == 0 or (i + 1) % n == 0:\r\n t[i] = True\r\n count += 1\r\nprint(count)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nattacked = 0\r\nif k == 1 or l == 1 or m == 1 or n == 1:\r\n print(d)\r\nelse:\r\n for i in range(1, d+1):\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:\r\n attacked +=1\r\n print(attacked)\r\n", "\ndef solve():\n k = int(input())\n l = int(input())\n m = int(input())\n n = int(input())\n d = int(input())\n\n cnt = [0] * (d + 1)\n for i in range(k, d + 1, k): cnt[i] = 1\n for i in range(l, d + 1, l): cnt[i] = 1\n for i in range(m, d + 1, m): cnt[i] = 1\n for i in range(n, d + 1, n): cnt[i] = 1\n\n print(sum(cnt))\n\n\nif __name__ == '__main__':\n solve()\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nlista = [k,l,m,n]\r\nres = []\r\nfor x in range(1,d+1):\r\n for f in lista:\r\n if (x%f) == 0:\r\n res.append(x)\r\n break\r\n else:\r\n pass\r\n\r\nprint(len(res))", "pan = int(input())\r\nbalcony = int(input())\r\nheels = int(input())\r\nmom = int(input())\r\nnum_dragons = int(input())\r\n\r\ndamaged_dragons = 0\r\nfor dragon in range(1, num_dragons + 1):\r\n if dragon % pan == 0 or dragon % balcony == 0 or dragon % heels == 0 or dragon % mom == 0:\r\n damaged_dragons += 1\r\nprint(damaged_dragons)", "# URL: https://codeforces.com/problemset/problem/148/A\n\nimport io\nimport os\nimport sys\n\ninput_buffer = io.BytesIO(os.read(0, os.fstat(0).st_size))\ninp = lambda: input_buffer.readline().rstrip(b\"\\n\").rstrip(b\"\\r\")\nout = sys.stdout.write\n\nk, l, m, n = int(inp()), int(inp()), int(inp()), int(inp())\nans = 0\nfor i in range(1, int(inp()) + 1):\n if i % k and i % l and i % m and i % n:\n continue\n ans += 1\nprint(ans)\n", "#!/usr/local/bin/python\n\nk = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\nli = []\nfor i in range(1,d+1):\n if i%k == 0:\n li.append(i)\n if i%l == 0:\n li.append(i)\n if i%m == 0:\n li.append(i)\n if i%n == 0:\n li.append(i)\n\nprint(len(set(li)))\n", "n = [int(input()) for _ in range(4)]\r\nprint(sum(any([not t % y for y in n]) for t in range(1, int(input()) + 1)))\r\n", "# Read input values\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n# Initialize a variable to count damaged dragons\r\ndamaged_dragons = 0\r\n\r\n# Loop through all dragons from 1 to d\r\nfor i in range(1, d + 1):\r\n # Check each condition and increment the count if true\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n damaged_dragons += 1\r\n\r\n# Output the result\r\nprint(damaged_dragons)\r\n", "from functools import reduce\r\n\r\n\r\ndef main() :\r\n print(count_Of_Damaged_Dragons(input_Threat_Gaps(), input_Dragon_Count()))\r\n\r\n\r\ndef count_Of_Damaged_Dragons(threat_gaps, dragon_count) :\r\n return is_Dragon_Alives(threat_gaps, dragon_count).count(False)\r\n\r\ndef is_Dragon_Alives(threat_gaps, dragon_count) :\r\n return reduce(check_Deaded_Dragons, threat_gaps, initial_Is_Dragon_Alives(dragon_count))\r\n\r\ndef initial_Is_Dragon_Alives(dragon_count) :\r\n return [None] + [True] * dragon_count\r\n\r\ndef check_Deaded_Dragons(is_dragon_alives, threat_gap) :\r\n for dead_index in range(threat_gap, len(is_dragon_alives), threat_gap) :\r\n is_dragon_alives[dead_index] = False\r\n return is_dragon_alives\r\n\r\n\r\ndef input_Threat_Gaps() :\r\n return [input_Num() for _ in range(4)]\r\n\r\ndef input_Dragon_Count() :\r\n return input_Num()\r\n\r\ndef input_Num() :\r\n return int(input())\r\n\r\n\r\nmain()", "l=[]\r\nc=0\r\ncount=0\r\nfor a in range(5):\r\n n=int(input())\r\n l.append(n)\r\n if n==1:\r\n c=1\r\nif l[4]<l[0] or l[4]<l[1] or l[4]<l[2] or l[4]<l[3]:\r\n print(\"0\")\r\nelif c==1:\r\n print(l[4])\r\nelse:\r\n for i in range(1,l[4]+1):\r\n if i%l[0]==0 or i%l[1]==0 or i%l[2]==0 or i%l[3]==0:\r\n count+=1\r\n print(count)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nn=int(input())\r\nl=[]\r\nfor i in range(1,n+1):\r\n if (i%a==0) or (i%b==0) or (i%c==0) or (i%d==0):\r\n l.append(i)\r\nprint(len(l))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\ns=0\r\nfor i in range(1,e+1):\r\n if i%a==0 or i%b==0 or i%c==0 or i%d==0:\r\n s+=1\r\nprint(s)\r\n", "\"\"\"\r\ninp1 = lambda: map(int,input().split())\r\ninp2 = lambda: list(map(int,input().split()))\r\n\"\"\"\r\n\r\n\"\"\"\r\n$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\r\n\"\"\"\r\n\r\nmod = 10*9 + 7\r\n\r\ninp1 = lambda: map(int,input().split())\r\ninp2 = lambda: list(map(int,input().split()))\r\n\r\ndef compute_gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n \r\ndef compute_lcm(x, y):\r\n lcm = (xy)//compute_gcd(x,y)\r\n return lcm\r\n\r\n\"\"\"\r\n$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\r\n\"\"\"\r\n \r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ncount = 0\r\nfor i in range(1, d + 1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n count += 1\r\n \r\nprint(count)", "# 李城岳生命科学学院 2300012106\r\nklmn = []\r\ndragons = []\r\nfor i in range(4):\r\n klmn.append(int(input()))\r\ndra = int(input())\r\nfor i in range(dra):\r\n dragons.append(0)\r\nfor i in klmn:\r\n tic = dra//i\r\n for e in range(1, tic+1):\r\n dragons[ei-1] = 1\r\nprint(sum(dragons))", "if __name__ == \"__main__\":\r\n \r\n arr = [int(input()), int(input()), int(input()), int(input())]\r\n d = int(input())\r\n myArr = [0] d\r\n \r\n for num in arr:\r\n value = num\r\n while value < d + 1:\r\n myArr[value-1] = value\r\n value += num\r\n result = 0\r\n for i in myArr:\r\n if i > 0:\r\n result += 1\r\n print(result)\r\n ", "a=int(input())\nb=int(input())\nc=int(input())\nd=int(input())\ne=int(input())\ncount=0\nfor i in range(1,e+1):\n if(i%a==0 or i%b==0 or i%c==0 or i%d==0):\n count+=1\nprint(count)\n\t\t \t\t\t \t\t \t \t\t\t\t\t \t\t \t \t \t", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nlis = [i for i in range(1, d+1)]\r\nres = 0\r\n\r\nfor i in lis:\r\n if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:\r\n res+=1\r\nprint(d-res)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nans=0\r\nfor i in range(1,d+1,1):\r\n if i%k==0:\r\n ans+=1\r\n elif i%l==0:\r\n ans+=1\r\n elif i%m==0:\r\n ans+=1\r\n elif i%n==0:\r\n ans+=1\r\nprint(ans)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nl1=[False]d\r\nfor i in range(1, d+1):\r\n if(i%k==0 or i%l==0 or i%n==0 or i%m==0):\r\n l1[i-1]=True\r\nprint(l1.count((True)))", "kk=int(input())\r\nl=int(input())\r\nmn=int(input())\r\nn=int(input())\r\nd=int(input())\r\nhel = sum(\r\n 1 \r\n for i in range(1,d+1)\r\n if i % kk!=0 and i % l!=0 and i % mn!=0 and i % n!=0\r\n )\r\nprint(d-hel)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ndragon = {}\r\nfor i in range(0,d+1,k):\r\n if dragon.get(i) == None:\r\n dragon[i] = 1\r\n else:\r\n dragon[i] += 1\r\nfor i in range(0,d+1,l):\r\n if dragon.get(i) == None:\r\n dragon[i] = 1\r\n else:\r\n dragon[i] += 1\r\nfor i in range(0,d+1,m):\r\n if dragon.get(i) == None:\r\n dragon[i] = 1\r\n else:\r\n dragon[i] += 1\r\nfor i in range(0,d+1,n):\r\n if dragon.get(i) == None:\r\n dragon[i] = 1\r\n else:\r\n dragon[i] += 1\r\nans = (len(dragon) - 1)\r\nprint(ans)", "a,p=map(int,open(0))\r\nprint(sum(any(i%j==0 for j in a)for i in range(1,p+1)))", "if __name__ == \"__main__\":\n hit = 0\n k = int(input())\n l = int(input())\n m = int(input())\n n = int(input())\n d = int(input())\n\n dragons = [0]\n dragons += [False for _ in range(d)]\n\n for i in range(k, d+1, k):\n dragons[i] = True\n\n for i in range(l, d+1, l):\n dragons[i] = True\n\n for i in range(m, d+1, m):\n dragons[i] = True\n\n for i in range(n, d+1, n):\n dragons[i] = True\n\n print(dragons.count(True))", "damage1 = int(input())\r\ndamage2 = int(input())\r\ndamage3 = int(input())\r\ndamage4 = int(input())\r\ntotalDragons = int(input())\r\n\r\n# List of the damaged positions so we can loop through it.\r\ndamagedPosition = [damage1, damage2, damage3, damage4]\r\n\r\n# Loop will remove duplicate numbers\r\nc = 0 \r\ngoAhead = True\r\nwhile(goAhead):\r\n position = damagedPosition[c]\r\n \r\n if damagedPosition.count(position) > 1:\r\n # if the number is >1, it's a dup and will be deleted.\r\n del damagedPosition[c]\r\n if damagedPosition.count(position) == 1:\r\n # if the number is == 1, it's unique and we move on to the next number.\r\n c += 1\r\n if c >= len(damagedPosition):\r\n # if we've gone through all the index values, we exit the loop.\r\n goAhead = False\r\n \r\n\r\ndamagedPosition.sort()\r\n\r\nc = 0 # counter for position 1.\r\nn = 1 # counter for position 2.\r\n# We divide position 2 by position 2 to see if position 1 is a common factor of position 2. If it is, we remove the value at position 2.\r\n\r\ngoAhead = True\r\nwhile(goAhead):\r\n # Was getting an error if the list had 4 duplicate numbers. This checks to see if we have only 1 number in the list, and if we do, then we break out of the loop.\r\n if len(damagedPosition) == 1:\r\n break\r\n\r\n lastNumber = False # we set this to false at the start. If we get to the beginning of the loop, it means we still have index values with [c] to loop through. Ie: we haven't tested the entire list for [c] yet.\r\n \r\n # Set up the variables we will use to look for common factors.\r\n position1 = damagedPosition[c]\r\n position2 = damagedPosition[n]\r\n \r\n # if p1 is a common factor of p2, remove p2 and loop again. By deleting p2, the number at p2[n+1] will take its place.\r\n if position2 % position1 == 0:\r\n del damagedPosition[n]\r\n \r\n else: \r\n # if p1 is not a common factor of p2, then we move on to the next number in the list and compare that number to p1 at [c]\r\n n += 1\r\n \r\n if n >= len(damagedPosition):\r\n # When we get to the end of the list, we increase the index value of C and we move N back to C+1 and restart the comparison.\r\n c += 1\r\n n = c + 1\r\n lastNumber = True # this means that [n] has reached the end of the list. Only if [c] has also reached the end will we stop the loop.\r\n \r\n if c+1 >= (len(damagedPosition)) and lastNumber == True:\r\n # Essentially we want to make sure that C has gone through all the numbers before we exit the loop. Because C is zero index based, we add 1 to it. The last c index value of the string is always going to be 1 less than the length of the string. So we need to add 1 to C to compensate for this. \r\n goAhead = False\r\n c = 0\r\n n = 0\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n# First, let's make a list full of empty strings as long as the totalDragons variable.\r\ndamagedDragons = [\"O\"] * totalDragons # O will mean a dragon is OK.\r\n\r\n# Next, we need to loop through each each index value and check whether that position is divisible by the damage type. We will compare the damagedPosition index value at 0 to every damagedDragons index value.\r\n\r\ndd = 0 # index value counter for damagedDragons.\r\ndp = 0 # index value counter for damagedPosition List.\r\n\r\n\r\ngoAhead = True\r\nwhile (goAhead):\r\n\r\n damageType = damagedPosition[dp]\r\n\r\n if (dd + 1) % damageType == 0:\r\n damagedDragons[dd] = \"D\"\r\n dd += 1 # moves on to the next dragon's position\r\n\r\n if dd == len(damagedDragons):\r\n dd = 0 # reset the dd index counter\r\n dp += 1 # increase the dp index counter\r\n # In other words, once we look at all the dragons in the list to see if they are affected by the damage position \"DP\" value, we move onto the next \"DP\" value in the loop.\r\n\r\n if dp >= len(damagedPosition):\r\n goAhead = False\r\n # If the \"DP\" counter is equal to the length of the list, or greater, then we have examined all the DP position values against all of the damaged dragon positions and we close the loop.\r\n\r\noutput = damagedDragons.count(\"D\") # count the number of damaged dragons.\r\n\r\nprint(output) # print the answer.\r\n\r\n\"\"\"\r\nThe first time I submitted this answer was here:\r\nhttps://codeforces.com/problemset/submission/148/226796658\r\n\r\nAfter analyzing this problem I think there are a few ways to improve performance:\r\n\r\n#1, we should have a section that tests whether any of the damagePosition values is = 1. If so, we don't even need to loop through anything because we know every dragon will take damage, so the output is equal to the sum of all dragons.\r\n\r\n#2, we should have a section that removes any duplicate damagePosition values, if there are any. This way we aren't doing the same work twice.\r\n\r\n#3, it might be faster to make the damagedDragons List into a series of numbers based on the position in the list rather than \"O\"s and turning them into \"D\"s. We could cycle through the list and look for values that have a % == 0, and then remove them from the list. This way, each time we loop through the list we're scanning a smaller and smaller set of numbers. For each position we delete, we'd want to add 1 to a counter representing the total number of dragons affected by damage and then output that number. I think this would be much faster, especially if we have a damage type like 2 which is going to remove 1/2 of the dragons anyway.\r\n\r\nInstead of doing another problem tomorrow, I think I'll try and redo this problem. The codeforces judge indicated my program's longest run time was 342 ms with a memory of 640 KB.\r\n\"\"\"\r\n", "first = int(input())\r\nsecond = int(input())\r\nthird = int(input())\r\nforth = int(input())\r\ncount = int(input()) \r\nall = 0\r\nfor i in range(1,count + 1):\r\n if i % first == 0 or i % second == 0 or i % third == 0 or i % forth == 0:\r\n all += 1\r\nprint(all)", "K = int(input(\"\"))\r\nL = int(input(\"\"))\r\nM = int(input(\"\"))\r\nN = int(input(\"\"))\r\nD = int(input(\"\"))\r\ncount = 0\r\nfor i in range(1,D+1):\r\n if i % K == 0 or i % L == 0 or i % M == 0 or i % N == 0 :\r\n count = count + 1 \r\n\r\nprint(count)", "def insomnia_cure ():\r\n k = int(input())\r\n l = int(input())\r\n m = int(input())\r\n n = int(input())\r\n d = int(input())\r\n dragon_damaged = 0\r\n for i in range (1,d+1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n dragon_damaged += 1\r\n return dragon_damaged\r\ndef main ():\r\n print(insomnia_cure())\r\nmain()\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nf = [k, l, m, n]\r\nprint(sum(any(i%j==0 for j in f)for i in range(1,d+1)))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\na = [0 for i in range(d+1)]\r\nfor i in range(k, d+1, k):\r\n a[i] = 1\r\nfor i in range(l, d+1, l):\r\n a[i] = 1\r\nfor i in range(m, d+1, m):\r\n a[i] = 1\r\nfor i in range(n, d+1, n):\r\n a[i] = 1\r\nprint(sum(a))\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ns=0\r\nfor i in range(1,d+1):\r\n for j in [k,l,m,n]:\r\n if i%j==0:\r\n s=s+1\r\n break\r\nprint(s)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\ne = int(input())\r\nfinal = []\r\nn=0\r\nwhile True:\r\n n = n + a\r\n if(n>e):\r\n break\r\n final.append(n)\r\nn=0\r\nwhile True:\r\n n = n + b\r\n if(n>e):\r\n break\r\n final.append(n)\r\nn=0\r\nwhile True:\r\n n = n + c\r\n if(n>e):\r\n break\r\n final.append(n)\r\nn=0\r\nwhile True:\r\n n = n + d\r\n if(n>e):\r\n break\r\n final.append(n)\r\n\r\nprint(len(set(final)))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount = 0\r\nfor nm in range(1,d+1):\r\n if nm%k==0 or nm%l==0 or nm%m==0 or nm%n==0:\r\n count += 1 \r\nprint(count)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nout=[]\r\nfor v in (range(1,d+1)):\r\n\tif v%k!=0 and v%l!=0 and v%m!=0 and v%n!=0:\r\n\t\tout.append(v)\r\nprint(d-len(out))", "k,l,m,n,d = int(input()),int(input()),int(input()),int(input()),int(input())\r\nc = d\r\nfor i in range(1,d+1):\r\n if (i % k and i % l and i % m and i % n):\r\n c -=1\r\nprint(c)", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x))\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10\r\n# from functools import cmp_to_key\r\n\r\np=[]\r\nfor i in range(4):\r\n p.append(int(input()))\r\nd=int(input())\r\nN=d+10\r\nst=[0]N\r\nfor i in range(4):\r\n x=p[i]\r\n while x<=d:\r\n st[x]=1\r\n x+=p[i]\r\ncnt=0\r\nfor i in range(1,d+1):\r\n cnt+=st[i]\r\nprint(cnt)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nh = 0\r\nfor x in range(1, d+1):\r\n if x%k == 0 or x%l == 0 or x%m == 0 or x%n == 0:\r\n h += 1\r\nprint(h)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\ntotal = int(input())\r\nlistOfKDragons = []\r\nlistOfLDragons = []\r\nlistOfMDragons = []\r\nlistOfNDragons = []\r\nif k == 1 or l == 1 or m == 1 or n == 1:\r\n print(total)\r\nelse:\r\n i = k\r\n while i <= total and i != 1:\r\n listOfKDragons.append(i)\r\n i += k\r\n i = l\r\n while i <= total and i != 1:\r\n listOfLDragons.append(i)\r\n i += l\r\n i = m\r\n while i <= total and i != 1:\r\n listOfMDragons.append(i)\r\n i += m\r\n i = n\r\n while i <= total and i != 1:\r\n listOfNDragons.append(i)\r\n i += n\r\n print(len(list(set(listOfKDragons + listOfLDragons + listOfMDragons + listOfNDragons))))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\nk = int(input())\r\nsum1 = 0\r\nfor i in range(1, k + 1):\r\n if i % a == 0:\r\n sum1 += 1\r\n elif i % b == 0:\r\n sum1 += 1\r\n elif i % c == 0:\r\n sum1 += 1\r\n elif i % d == 0:\r\n sum1 += 1\r\nprint(sum1)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nh = sum(1 \r\n for i in range(1, d+1) \r\n if (i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0)\r\n )\r\nprint(d-h)", "def f(data):\r\n suffers = 0\r\n for i in range(1,data[-1]+1):\r\n if i%data[0] == 0 or i%data[1] == 0 or i%data[2] == 0 or i%data[3] == 0:\r\n suffers += 1 \r\n return suffers\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndata = []\r\nfor i in range(5):\r\n temp = int(input())\r\n data.append(temp)\r\nprint(f(data))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nhealthy = sum(\r\n 1\r\n for i in range(1,d+1)\r\n if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0\r\n ) \r\nprint(d-healthy)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\na = [0]d\n\nfor i in range(1, d + 1):\n if any(i % j == 0 for j in (k, l, m, n)):\n a[i - 1] += 1\nprint(sum(bool(i) for i in a))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n\r\nlk = [i for i in range(d+1) if i%k == 0 and i!=0]\r\nll = [i for i in range(d+1) if i%l == 0 and i!=0]\r\nlm = [i for i in range(d+1) if i%m == 0 and i!=0]\r\nln = [i for i in range(d+1) if i%n == 0 and i!=0]\r\n\r\nx = lk + ll + lm + ln\r\n\r\nres = len(list(dict.fromkeys(x)))\r\nprint(res)\r\n", "from sys import stdin, stdout\r\ninput = lambda: stdin.readline().rstrip()\r\nprint = lambda args, kwargs: stdout.write(args, *kwargs)\r\no = [int(input()) for _ in range(5)]\r\nprint(str(len(set((int(i) for i in range(1, o[-1]+1) if any(i % j == 0 for j in o[:-1]))))))", "f_p = int(input())\ns_d = int(input())\nnail = int(input())\nab = int(input())\nn_d = int(input())\ns = []\nfor i in range(f_p, n_d+1,f_p):\n s.append(i)\nfor i in range(s_d, n_d+1,s_d):\n s.append(i)\nfor i in range(nail, n_d+1,nail):\n s.append(i)\nfor i in range(ab, n_d+1,ab):\n s.append(i)\n\nprint(len(set(s)))\n\t\t \t \t \t\t\t \t \t\t \t\t \t\t", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\n\r\ndef lcm (a,b):\r\n return (ab)//gcd(a,b)\r\n\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\n# K U L U M U N = K + L + M + N - K ∩ L - K ∩ M - K ∩ N - L ∩ M - L ∩ N - M ∩ N \r\n# + K ∩ L ∩ M + K ∩ L ∩ N + K ∩ M ∩ N + L ∩ M ∩ N - K ∩ L ∩ M ∩ N\r\n# ans is equal to K U L U M U N\r\n\r\nans=0\r\n\r\nans+=d//k\r\nans+=d//l\r\nans+=d//m\r\nans+=d//n\r\n\r\n\r\n\r\nans-=d//lcm(k,l)\r\nans-=d//lcm(k,m)\r\nans-=d//lcm(k,n)\r\nans-=d//lcm(l,m)\r\nans-=d//lcm(l,n)\r\nans-=d//lcm(m,n)\r\n\r\n\r\nans+=d//lcm(lcm(k,l),m)\r\nans+=d//lcm(lcm(k,l),n)\r\nans+=d//lcm(lcm(k,m),n)\r\nans+=d//lcm(lcm(l,m),n)\r\n\r\nans-=d//lcm(lcm(lcm(k,l),m),n)\r\n\r\nprint(ans)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nway = [0] * (d+1)\r\nfor ind,x in enumerate(way):\r\n if ind % k == 0 or ind % l == 0 or ind % m == 0 or ind % n == 0:\r\n way[ind] = 1\r\nprint(way.count(1)-1)", "a=4[0]\r\nfor i in range(4):\r\n a[i]=int(input())\r\nn=int(input())\r\ns=0\r\nfor i in range(1,n+1):\r\n f=0\r\n for j in range(4):\r\n if i%a[j]==0:\r\n f=1\r\n break\r\n if f:\r\n s+=1\r\nprint(s)", "import sys\r\nA,d = map(int,sys.stdin.read().split())\r\n\r\nc = 0\r\nfor i in range(1,d+1):c += any((i%p==0) for p in A)\r\n\r\nprint(c)\r\n\r\n", "arr = []\r\nfor _ in range(5):\r\n arr.append(int(input()))\r\ncounter = 0\r\nfor i in range(1, arr[-1]+1):\r\n if i%arr[0]==0 or i%arr[1]==0 or i%arr[2]==0 or i%arr[3]==0:\r\n counter += 1\r\nprint(counter)", "def main(k, l, m, n, d):\r\n a = 0\r\n\r\n for i in range(d):\r\n for el in [k, l, m, n]:\r\n if (i + 1) % el == 0:\r\n a += 1\r\n break\r\n\r\n return a\r\n\r\nif __name__ == \"__main__\":\r\n k, l = int(input()), int(input())\r\n m, n = int(input()), int(input())\r\n\r\n d = int(input())\r\n\r\n print(main(k, l, m, n, d))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nl1 = [0]d\r\ni = 1\r\nwhile(ki<=d or li<=d or mi<=d or ni<=d):\r\n if ki<=d:\r\n l1[ki -1]=1\r\n if li<=d:\r\n l1[li -1]=1\r\n if mi<=d:\r\n l1[mi -1]=1\r\n if ni<=d:\r\n l1[ni -1]=1\r\n i+=1\r\nprint(l1.count(1))", "k = int(input())\r\nl = int(input())\r\nm =int(input())\r\nn = int(input())\r\nd = int(input())\r\nr = 0\r\nfor i in range(1,d+1):\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:\r\n r+=1\r\nprint(r)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n# print(k,l,m,n,d,dragon)\r\n\r\ncount = 0\r\n\r\n# for i in range(k, d+1, k):\r\n# dragon[i] = 0\r\n# for i in range(l, d+1, l):\r\n# dragon[i] = 0\r\n# for i in range(m, d+1, m):\r\n# dragon[i] = 0\r\n\r\n# for i in range(n, d+1, n):\r\n# dragon[i] = 0\r\n\r\n# for it in dragon:\r\n# if it == 0:\r\nfor i in range(1,d+1):\r\n if i%k == 0 or i % l == 0 or i%m == 0 or i % n == 0:\r\n count += 1\r\n\r\n\r\nprint(count)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\npath = [0] (d+1)\r\nfor ind,x in enumerate(path):\r\n if ind % k == 0 or ind % l == 0 or ind % m == 0 or ind % n == 0:\r\n path[ind] = 1\r\nprint(path.count(1)-1)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nx=[0]d\r\nfor i in range(k,d+1,k):\r\n x[i-1]=1\r\nfor i in range(l,d+1,l):\r\n x[i-1]=1\r\nfor i in range(n,d+1,n):\r\n x[i-1]=1\r\nfor i in range(m,d+1,m):\r\n x[i-1]=1\r\nprint(d-x.count(0))", "k,h = map(int,open(0))\r\nprint(sum(any(i % j == 0 for j in k)\r\nfor i in range(1, h + 1)))", "nums=[]\r\nfor i in range(5):\r\n nums.append(int(input()))\r\nvis=[0](nums[-1]+1)\r\nfor i in range(4):\r\n for x in range(nums[i],nums[-1]+1,nums[i]):\r\n vis[x]=1\r\nans=0\r\nfor i in range(1,nums[-1]+1):\r\n if vis[i]:\r\n ans+=1\r\nprint(ans)\r\n", "#«Раз дракон. Два дракон. Три дракон», — считала принцесса. У нее была бессонница, а считать барашков ей надоело еще в девять лет.\r\n#Впрочем, считать драконов просто так тоже было скучно, поэтому она развлекалась как могла. Этой ночью она представляла, что все посчитанные драконы явились сюда, чтобы ее украсть, а она отбивается от них, как может. Каждого k-ого дракона она била сковородкой по морде. Каждому l-ому — прищемляла хвост балконной дверью. Каждому m-ому — наступала на лапу острым каблучком. Наконец, каждому n-ому она грозила позвать мамочку, и он в ужасе ретировался.\r\n#Скольким воображаемым драконам успела нанести моральный или физический ущерб принцесса, если всего она насчитала d драконов?\r\n#148A\r\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\notv = [0]d\r\nfor i in range(k-1, d, k):\r\n otv[i] = 1\r\nfor i in range(l-1, d, l):\r\n otv[i] = 1\r\nfor i in range(m-1, d, m):\r\n otv[i] = 1\r\nfor i in range(n-1, d, n):\r\n otv[i] = 1\r\n \r\n\r\nprint(sum(otv))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\np = 0\r\nwhile d > 0:\r\n if d % n == 0 or d % m == 0 or d % l == 0 or d % k == 0:\r\n p += 1\r\n d -= 1\r\nprint(p)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\nhurt = [False](d+1)\nflag = False\nif k==1:\n flag = True\n print(d)\nelse:\n for num in range(k,d+1,k):\n hurt[num] = True\n if l%k==0:\n pass\n else:\n for j in range(l,d+1,l):\n hurt[j] = True\n if m%k==0 or m%l==0:\n pass\n else:\n for i in range(m,d+1,m):\n hurt[i] = True\n if n%k==0 or n%l==0 or n%m ==0:\n pass\n else:\n for gg in range(n,d+1,n):\n hurt[gg] = True\nif flag == False:\n print(hurt.count(True))\n \t \t \t \t \t\t \t\t \t\t\t \t \t \t \t", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nkq = 0\r\nfor i in range(1,d+1):\r\n if (i % k == 0) or (i % l == 0) or (i % m == 0) or (i % n == 0):\r\n kq += 1\r\nprint(kq)\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nd_d=0\r\nfor dragon in range(1,d+1):\r\n if dragon%k==0 or dragon%l==0 or dragon%m==0 or dragon%n==0:\r\n d_d+=1\r\nprint(d_d)\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nj=int(input())\r\nd=int(input())\r\n\r\nindr= [0 for i in range(d)]\r\n\r\nik = k-1\r\nil = l-1\r\nim = m-1\r\nij = j-1\r\n\r\ni=0\r\n\r\nwhile i < d:\r\n if ik <= d-1:\r\n indr[ik] = 1\r\n if il <= d-1:\r\n indr[il] = 1\r\n if im <= d-1:\r\n indr[im] = 1\r\n if ij <= d-1:\r\n indr[ij] = 1\r\n ik+=k\r\n il+=l\r\n im+=m\r\n ij+=j\r\n i+=1\r\nprint(sum(indr))\r\n\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ndamage=0\r\nfor dr in range(1,d+1):\r\n if dr%k==0 or dr%l==0 or dr%m==0 or dr%n==0:\r\n damage+=1\r\nprint(damage)", "divisors = [int(input()) for i in range(4)]\r\nnumber_of_dragons = int(input())\r\nc = 0\r\nfor i in range(1, number_of_dragons+1):\r\n if i % divisors[0] == 0 or i % divisors[1] == 0 or i % divisors[2] == 0 or i % divisors[3] == 0:\r\n continue\r\n else:\r\n c += 1\r\nprint(number_of_dragons-c)", "u,e=map(int,open(0))\nprint(sum(any(i%j==0 for j in u)for i in range(1,e+1)))\n \t\t \t \t \t\t \t \t\t\t\t\t \t \t\t", "str = []\r\nstr1 = []\r\n\r\nfor i in range (5):\r\n n = int(input())\r\n str.append(n)\r\n# print(type(str[1]))\r\ndef count(num1,num2):\r\n w = int(num2 / num1)\r\n for i in range(1,w+1):\r\n r = i * num1\r\n str1.append(r)\r\n # new_str = list(set(str1))\r\n # print(len(new_str))\r\n\r\n\r\ncount(str[0],str[4])\r\ncount(str[1],str[4])\r\ncount(str[2],str[4])\r\ncount(str[3],str[4])\r\nnew_str = list(set(str1))\r\nprint(len(new_str))\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n \r\ni = 1\r\naux = d\r\nif k == 1 or l == 1 or m == 1 or n == 1:\r\n print(aux)\r\nelse:\r\n while True:\r\n if (i % k != 0) and (i % l != 0) and (i % m != 0) and (i % n != 0):\r\n aux -= 1\r\n if i == d:\r\n print(aux)\r\n break\r\n i += 1\r\n \r\n\r\n \r\n \r\n ", "# 2\r\n# 3\r\n# 4\r\n# 5\r\n# 24\r\n\r\n# 17\r\n\r\n# 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24\r\n\r\n# 1 - - - - - 7 - - - 11 - 13 - - - 17 - 19 - - - 23 -\r\nz = []\r\nr = []\r\nfor i in range(4):\r\n z.append(int(input()))\r\nn = int(input())\r\nfor i in range(1, n+1):\r\n r.append(i)\r\nfor b in z:\r\n for i in range(1, len(r)+1):\r\n if bi <= len(r):\r\n r[bi-1] = '-'\r\n else: break\r\nprint(r.count('-'))", "k=int(input())\nl=int(input())\nm=int(input())\nn=int(input())\nd=int(input())\nc=0\nfor i in range(1,d+1):\n if(i%k==0):\n c+=1\n elif(i%l==0):\n c+=1\n elif(i%m==0):\n c+=1\n elif(i%n==0):\n c+=1\n\nprint(c)\n\t \t \t\t \t \t\t\t \t \t \t \t", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\nk = int(input())\r\ncount = 0\r\nif a == 1 or b == 1 or c == 1 or d == 1:\r\n print(k)\r\nelse:\r\n for i in range(1, k + 1):\r\n if i % a == 0 or i % b == 0 or i % c == 0 or i % d == 0:\r\n count += 1\r\n print(count)", "k = int(input()) # kth - punched in face by frying pan\nl = int(input()) # lth - tail shut into the balcony door\nm = int(input()) # mth - paws trampled with sharp heels\nn = int(input()) # nth - call her mom\n\nd = int(input()) # total dragons\n\ndamaged = 0\nfor i in range(1, 1 + d):\n if (k <= d) and (l <= d) and (m <= d) and (n <= d):\n if (i % k == 0) or (i % l == 0) or (i % m == 0) or (i % n == 0):\n damaged += 1\n else:\n damaged = 0\nprint(damaged)", "from sys import stdin, stdout\r\nk = int(stdin.readline()); l = int(stdin.readline()); m = int(stdin.readline()); n = int(stdin.readline()); d = int(stdin.readline()); a = [k,l,m,n]\r\nstdout.write(str(sum(any(i%j==0 for j in a) for i in range(1,d+1))))", "n = [int(input()) for _ in range(5)]\r\n\r\ncount = 0\r\n\r\nfor i in range(1, n[4] + 1):\r\n if i % n[0] == 0 or i % n[1] == 0 or i % n[2] == 0 or i % n[3] == 0:\r\n count += 1\r\n\r\nprint(count)", "l = [int(input()) for i in range(4)]\r\nm = int(input())\r\nprint(len(set([i for i in range(1, m+1) for j in l if i % j == 0])))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nx = set()\r\nnum = 0\r\nfor _ in range(d):\r\n num += 1\r\n x.add(num)\r\ncount = 0\r\nfor i in x:\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n count += 1\r\nprint(count)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\ne = int(input())\r\ntotal = e\r\nfor i in range(1 , e + 1):\r\n if (i % a) * (i % b) * (i % c) * (i % d) != 0:\r\n total -= 1\r\nprint(total)", "def cure(list1):\n count = 0\n if 1 in list1[:4]:\n return list1[4]\n else:\n for i in range(1, list1[4]+1):\n if i % list1[0] == 0 or i % list1[1] == 0 or i % list1[2] == 0 or i % list1[3] == 0:\n count = count+1\n return count\nlist1=[]\nfor i in range(5):\n a=int(input())\n list1.append(a)\nprint(cure(list1))\n\n\n\n", "k,l,m,n,d = [int(input()) for i in range(5)]\r\na = [1 if i%k==0 or i%l==0 or i%m==0 or i%n==0 else 0 for i in range(1,d+1)]\r\nprint(sum(a))\r\n", "import math\ndef main():\n k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\n print(len(set(list(range(k,d+1, k))+list(range(l,d+1, l))+list(range(m,d+1, m))+list(range(n,d+1, n)))))\n\nif __name__ == '__main__':\n main()", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\na=set()\r\nls=[k,l,m,n]\r\no=int(input())\r\nfor i in range(4):\r\n for j in range(1,o+1):\r\n if j%ls[i]==0:\r\n a.add(j)\r\nprint(len(a))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nk, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\nh = range(1,d+1); c = 0\r\nfor j in h:\r\n if j % k == 0 or j % l == 0 or j % m == 0 or j % n == 0:\r\n c+=1\r\nprint(c)", "from math import lcm\r\na,b,c,d,n=[int(input()) for i in range(5)]\r\nprint( n//a + n//b + n//c + n//d - n//lcm(a,b) - n//lcm(a,c) - n//lcm(a,d) - n//lcm(b,c) - n//lcm(b,d) - n//lcm(c,d) + n//lcm(a,b,c) + n//lcm(a,b,d) + n//lcm(a,c,d) + n//lcm(b,c,d) - n//lcm(a,b,c,d) )", "k = int(input())\r\nl= int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nlong =[]\r\nfor i in range(1, d+1):\r\n if i%k == 0 or i % l==0 or i %m==0 or i%n ==0:\r\n long.append(i)\r\nprint(len(long))", "k = int(input())\r\nm = int(input())\r\nl = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n\r\nj = 0\r\ni = 1\r\nwhile i <= d:\r\n if i%k == 0:\r\n j +=1\r\n elif i%m == 0:\r\n j +=1\r\n elif i%n == 0:\r\n j += 1\r\n elif i%l == 0:\r\n j +=1\r\n i +=1\r\n\r\nprint(j)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\nif k == 1 or l == 1 or m == 1 or n == 1:\n print(d)\n exit()\n\ncount = 0\nfor i in range(d):\n check = i+1\n if check%k == 0 or check%l == 0 or check%m == 0 or check%n == 0:\n count += 1\n\nprint(count)\n", "k = int(input());#punched\r\nl = int(input());#tail\r\nm = int(input());#paws\r\nn = int(input());#mom\r\nd = int(input())\r\nsol = 0\r\nfor i in range(1,d+1):\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:sol+=1;\r\nprint(sol)", "a = [int(input()), int(input()), int(input()), int(input())]\r\nd = int(input())\r\nn = 0\r\nfor i in range(1,d + 1):\r\n if i % a[0] == 0 or i % a[1] == 0 or i % a[2] == 0 or i % a[3] == 0:\r\n n += 1\r\nprint(n)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nx=[k,l,m,n]\r\nd=int(input())\r\n# flag=True\r\n# for i in range(d):\r\n# \tfor j in x:\r\n# \t\tif d%x!=0:\r\n# \t\t\tflag=False\r\n# \t\telse:\r\n# \t\t\tflag=True\r\n# if flag==False:\r\ndictt={}\r\nfor p in range(1,d+1):\r\n\tdictt[p]=0\r\n\r\nfor j in x:\r\n\ta=j\r\n\twhile a<=d:\r\n\t\tdictt[a]+=1\r\n\t\ta+=j\r\ny=0\r\nfor i in dictt:\r\n\tif dictt[i]==0:\r\n\t\ty+=1\r\nprint(d-y)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nf=0\r\na=[]\r\nfor i in range(1,d+1):\r\n a.append(i)\r\nfor j in range(len(a)):\r\n if a[j]%k==0 or a[j]%l==0 or a[j]%m==0 or a[j]%n==0:\r\n f+=1\r\nprint(f) \r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nk_set = {i for i in range(1,d+1) if i % k == 0}\r\nl_set = {i for i in range(1,d+1) if i % l == 0}\r\nm_set = {i for i in range(1,d+1) if i % m == 0}\r\nn_set = {i for i in range(1,d+1) if i % n == 0}\r\n\r\nnew_set = {k_set,l_set,m_set,n_set}\r\nprint(len(new_set))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nk_a = [i for i in range(k, d+1, k)]\r\nl_a = [i for i in range(l, d+1, l)]\r\nm_a = [i for i in range(m, d+1, m)]\r\nn_a = [i for i in range(n, d+1, n)]\r\nprint(len(set(k_a+l_a+m_a+n_a)))", "x = []\r\nc = 0\r\nfor i in range(4):\r\n x.append(int(input()))\r\ndragon = int(input())\r\nfor i in range(1,dragon + 1):\r\n if i % x[0] == 0 or i % x[1] == 0 or i % x[2] == 0 or i % x[3] == 0:\r\n c += 1\r\nprint(c)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ninjured = [0 for i in range(d)]\r\nindex_k=k-1\r\nindex_l=l-1\r\nindex_m=m-1\r\nindex_n=n-1\r\n\r\n\r\ni=0\r\nwhile i<d:\r\n if index_k<=d-1:\r\n injured[index_k]=1\r\n if index_l<=d-1:\r\n injured[index_l]=1\r\n if index_m<=d-1:\r\n injured[index_m]=1\r\n if index_n<=d-1:\r\n injured[index_n]=1\r\n index_k+=k\r\n index_l+=l\r\n index_m+=m\r\n index_n+=n\r\n\r\n i+=1\r\n\r\nprint(sum(injured))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nl1 = set([i for i in range(k,d+1,k)])\r\nl2 = set([i for i in range(l,d+1,l)])\r\nl3 = set([i for i in range(m,d+1,m)])\r\nl4 = set([i for i in range(n,d+1,n)])\r\n\r\nl1 = l1.union(l2)\r\nl1 = l1.union(l3)\r\nl1 = l1.union(l4)\r\n\r\nprint(len(l1))\r\n\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nc = 0\r\nfor i in range(1,d+1):\r\n if i % k==0 or i % l==0 or i % m==0 or i % n==0:\r\n c+=1\r\nprint(c) ", "def fact(a,b,c,d,drag):\r\n i=1\r\n ctr=0\r\n while i<=drag:\r\n if i%a==0 or i%b==0 or i%c==0 or i%d==0 :\r\n ctr+=1\r\n i+=1\r\n return ctr\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ndrag=int(input())\r\nprint(fact(a,b,c,d,drag))\r\n\r\n", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\ndragons = [0] * d\n\nfor i in range(k - 1, d, k):\n dragons[i] = 1\n\nfor i in range(l - 1, d, l):\n dragons[i] = 1\n\nfor i in range(m - 1, d, m):\n dragons[i] = 1\n\nfor i in range(n - 1, d, n):\n dragons[i] = 1\n\nprint(sum(dragons))\n\n\n \t\t\t \t\t \t\t\t\t\t \t\t \t\t \t\t \t\t \t\t", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input()) \r\narr = []\r\nfor i in range(1 ,d + 1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n arr.append(i)\r\nprint(len(arr))", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ndamaged_dragons=0\r\nfor dragon in range(1,d+1):\r\n if dragon%k==0 or dragon%l==0 or dragon%m==0 or dragon%n==0:\r\n damaged_dragons+=1\r\nprint(damaged_dragons)\r\n", "def insomniaCure(k,l,m,n,d):\r\n count = 0\r\n \r\n for i in range(1,d+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0: \r\n count += 1\r\n \r\n return count\r\n \r\n\r\nif __name__ == \"__main__\":\r\n arr = []\r\n \r\n for _ in range(5):\r\n arr.append(int(input()))\r\n \r\n k,l,m,n,d = arr\r\n ans = insomniaCure(k,l,m,n,d)\r\n print(ans)\r\n ", "k = int(input())\r\nl = int(input())\r\nm = int(input()) \r\nn = int(input()) \r\nd = int(input()) + 1\r\nlimits = [k, l, m, n]\r\nexclusions = 0\r\ndamaged = 0\r\nfor i in range(1, d):\r\n excluded = False # assume that the number is not excluded by default\r\n for j in range(len(limits)): # loop through the four limits\r\n if i % limits[j] == 0: # check if the number meets the current limit\r\n excluded = True\r\n damaged += 1# if it does, mark it as excluded\r\n break # exit the inner loop early, since the number is already excluded\r\n if not excluded: # if the number was not excluded by any of the limits\r\n exclusions += 1 # add it to the list of excluded numbers\r\nprint(damaged)\r\n ", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nres=0\r\nfor i in range(1,d+1):\r\n if (i%k==0) or (i%l==0) or (i%m==0) or (i%n==0):\r\n res=res+1\r\nprint(res)", "k=input()\r\nl=input()\r\nm=input()\r\nn=input()\r\nd=input()\r\nk=int(k)\r\nl=int(l)\r\nm=int(m)\r\nn=int(n)\r\nd=int(d)\r\np=0\r\nfor i in range(1,d+1):\r\n if i%k==0 and (k<=d):\r\n p+=1\r\n elif i%l==0 and (l<=d):\r\n p+=1\r\n elif i%m==0 and (m<=d):\r\n p+=1\r\n elif i%n==0 and (n<=d):\r\n p+=1\r\n \r\nprint(p)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\ne = int(input())\r\ncount = 0\r\nfor i in range(1,e+1):\r\n if i%a == 0 or i%b == 0 or i%c == 0 or i%d == 0:\r\n count += 1 \r\nprint(count)", "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\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nans = 0\r\nvis = [0] * (d+1)\r\nfor i in range(k,d+1,k):\r\n if not vis[i]:\r\n ans += 1\r\n vis[i] = 1\r\nfor i in range(l,d+1,l):\r\n if not vis[i]:\r\n ans += 1\r\n vis[i] = 1\r\nfor i in range(m,d+1,m):\r\n if not vis[i]:\r\n ans += 1\r\n vis[i] = 1\r\nfor i in range(n,d+1,n):\r\n if not vis[i]:\r\n ans += 1\r\n vis[i] = 1\r\n \r\nprint(ans)", "a,s,d,f,g=int(input()),int(input()),int(input()),int(input()),int(input())\r\ncnt=0\r\nfor i in range(1,g+1):\r\n if i%a==0 or i%s==0 or i%d==0 or i%f==0:\r\n cnt+=1\r\nprint(cnt)", "w = set()\r\ndef fun(n,d):\r\n i = 1\r\n s = 1\r\n while s < d:\r\n s = n * i\r\n if s > d:\r\n break\r\n w.add(s)\r\n i = i + 1\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nif k == 1 or l == 1 or m == 1 or n == 1:\r\n print(d)\r\nelse:\r\n fun(k,d)\r\n fun(l,d)\r\n fun(m,d)\r\n fun(n,d)\r\n print(len(w))\r\n ", "k = int(input()) ; l = int(input()) ; m = int(input()) ; n = int(input()) ; d = int(input()) \r\na = 0\r\nfor i in range(1,d+1):\r\n if i%k == 0 or i%m == 0 or i%l == 0 or i%n == 0: a+=1\r\nprint(a)", "k=int(input()); l=int(input()); m=int(input()); n=int(input())\r\nd=int(input()); c=0\r\nif k==1 or l==1 or m==1 or n==1: print(d)\r\nelse:\r\n for i in range(1,d+1):\r\n if (i%k)==0 or (i%l)==0 or (i%m)==0 or (i%n)==0:\r\n c+=1\r\n print(c)\r\n", "c = 0\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n\r\nfor i in range(1,d+1):\r\n if (i%k) == 0 or (i%l)==0 or (i%m) == 0 or (i%n) == 0:\r\n c = c+1\r\nprint(c)\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\n\r\n\r\nramon=0\r\nfor i in range(1,e+1):\r\n # print(\"i is \",i)\r\n if i%a!=0 and i%b!=0 and i%c!=0 and i%d!=0:\r\n #print(i)\r\n ramon=ramon+1\r\nfinal=e-ramon\r\nprint(final)", "\r\na = eval(input())\r\nb = eval(input())\r\nc = eval(input())\r\nd = eval(input())\r\ntotal = eval(input())\r\n\r\nres = 0\r\nfor i in range(total):\r\n if (i+1) % a ==0 or (i+1) % b ==0 or (i+1) % c ==0 or (i+1) % d ==0:\r\n res+=1\r\nprint(res)", "# Read the input values\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n# Initialize a variable to count damaged dragons\r\ndamaged_dragons = 0\r\n\r\n# Iterate through all dragons from 1 to d\r\nfor dragon in range(1, d + 1):\r\n # Check each condition and increment the count if the dragon suffers damage\r\n if dragon % k == 0 or dragon % l == 0 or dragon % m == 0 or dragon % n == 0:\r\n damaged_dragons += 1\r\n\r\n# Print the count of damaged dragons\r\nprint(damaged_dragons)\r\n", "def solve():\r\n k = int(input())\r\n l = int(input())\r\n m = int(input())\r\n n = int(input())\r\n d = int(input())\r\n cnt = 0\r\n for i in range(1, d+1):\r\n if i % k and i % l and i % m and i % n:\r\n cnt += 1\r\n print(d-cnt)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "count=0\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nc=int(input())\r\nfor i in range(1,c+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0:\r\n continue\r\n else:\r\n count=count+1\r\nprint(c-count)", "k = int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nc = 0\r\narr = [0] * (d + 1)\r\n\r\nfor i in range(1, d + 1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n arr[i] = 1\r\n\r\nfor i in range(1, d + 1):\r\n if arr[i] == 0:\r\n c += 1\r\n\r\nprint(d - c)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount=0\r\nk1 = []\r\nl1 = []\r\nm1 = []\r\nn1 = []\r\ns = []\r\nfor i in range(k, d+1,k):\r\n k1.append(i)\r\nfor i in range(l,d+1,l):\r\n l1.append(i)\r\nfor i in range(m, d+1,m):\r\n m1.append(i)\r\nfor i in range(n,d+1,n):\r\n n1.append(i)\r\ns = list(set(k1+l1+m1+n1))\r\nprint(len(s))\r\n \r\n \r\n \r\n \r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\nA=[]\r\n\r\ni=1\r\nwhile (ki<=d):\r\n A.append(ki)\r\n i+=1\r\ni=1\r\nwhile (li<=d):\r\n A.append(li)\r\n i+=1\r\ni=1\r\nwhile (mi<=d):\r\n A.append(mi)\r\n i+=1\r\ni=1\r\nwhile (ni<=d):\r\n A.append(ni)\r\n i+=1\r\n\r\nprint(len(set(A)))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ni = 1\r\ncount = 0\r\nwhile i <= d:\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n count += 1\r\n i += 1\r\nprint(count)\r\n", "l=[int(input())for i in range(4)]\r\nd=int(input())\r\ncount=0\r\nfor i in range(1,d+1):\r\n for j in l:\r\n if i%j==0:\r\n count+=1\r\n break\r\nprint(count)", "k = int(input()) # Punch\r\nl = int(input()) # Tail shut\r\nm = int(input()) # Paws trampled\r\nn = int(input()) # Threatened\r\nd = int(input()) # Total number of dragons\r\n\r\ndamaged_dragons = 0\r\n\r\nfor i in range(1, d + 1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n damaged_dragons += 1\r\n\r\nprint(damaged_dragons)\r\n", "def main():\r\n k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\n if 1 in [k,l,m,n]:\r\n print(d)\r\n return\r\n \r\n dragons = set()\r\n \r\n i = k\r\n while i <= d:\r\n dragons.add(i) \r\n i += k\r\n \r\n i = l\r\n while i <= d:\r\n dragons.add(i) \r\n i += l\r\n \r\n\r\n i = m\r\n while i <= d:\r\n dragons.add(i) \r\n i += m\r\n \r\n i = n\r\n while i <= d:\r\n dragons.add(i) \r\n i += n\r\n \r\n print(len(dragons))\r\n \r\nmain()\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\nn = int(input())\r\nm = 0\r\nfor j in range(1, n+1):\r\n if j%a==0 or j%b==0 or j%c==0 or j%d==0:\r\n m+=1\r\nprint(m)", "k, l, m, n, d = int(input()),int(input()),int(input()),int(input()),int(input())\r\nans = 0\r\nfor i in range(1, d+1):\r\n if i%k==0:\r\n ans+=1\r\n elif i%l==0:\r\n ans+=1\r\n elif i%m==0:\r\n ans+=1\r\n elif i%n==0:\r\n ans+=1\r\nprint(ans)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\na=[]\r\nb=[]\r\nc=[]\r\nf=[]\r\nz=[]\r\nfor i in range(k,d+1,k):\r\n a.append(i)\r\nfor i in range(l,d+1,l):\r\n b.append(i)\r\nfor i in range(m,d+1,m):\r\n c.append(i)\r\nfor i in range(n,d+1,n):\r\n f.append(i)\r\nfor i in range(1,d+1):\r\n z.append(i)\r\na=set(a)\r\nb=set(b)\r\nc=set(c)\r\nf=set(f)\r\nz=set(z)\r\nq=(z-a-b-c-f)\r\ns=len(q)\r\nprint(d-s)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/148/A\r\n\r\n\r\ndef main():\r\n damage_numbers = list()\r\n dragons_hurt = 0\r\n # add k, l, m, n, d to our damage_numbers list\r\n damage_numbers.append(int(input()))\r\n damage_numbers.append(int(input()))\r\n damage_numbers.append(int(input()))\r\n damage_numbers.append(int(input()))\r\n \r\n num_dragons = int(input())\r\n \r\n for dragon_num in range(num_dragons):\r\n for damage_number in damage_numbers:\r\n if (dragon_num + 1) % damage_number == 0:\r\n dragons_hurt += 1\r\n break\r\n \r\n print(dragons_hurt)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "arr = []\r\nn = 4\r\nwhile n > 0:\r\n arr.append(int(input()))\r\n n -=1\r\n \r\nd = int(input())\r\n\r\nif 1 in arr:\r\n print(d)\r\nelse:\r\n res = []\r\n for i in arr:\r\n res.extend(list(range(i-1, d, i)))\r\n print(len(set(res)))\r\n", "k=int(input()) #punched in the face with a frying pan\r\nl=int(input()) #got his tail shut into the balcony door\r\nm=int(input()) #got his paws trampled with sharp heels\r\nn=int(input()) #threatened every n-th dragon to call her mom, and he withdrew in panic\r\nd=int(input()) #total\r\n\r\ndamaged_dragons = 0\r\n\r\nfor i in range(1, d+1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n damaged_dragons += 1\r\n\r\nprint(damaged_dragons)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Mar 27 11:33:47 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\nx=[x for x in range(1,d+1) if x%k!=0 if x%l!=0 if x%m!=0 if x%n!=0]\r\nprint(d-len(x))", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nf=[0]d\r\nres=0\r\nfor i in range(1,d+1):\r\n if f[i-1]==0:\r\n if i%k==0:\r\n f[i-1]=1\r\n res+=1\r\n elif i%l==0:\r\n f[i-1]=1\r\n res+=1\r\n elif i%m==0:\r\n f[i-1]=1\r\n res+=1\r\n elif i%n==0:\r\n f[i-1]=1\r\n res+=1\r\nprint(res)\r\n\r\n", "import sys\r\nA,d = map(int,sys.stdin.read().split())\r\n\r\nprint(sum(any((i%p==0) for p in A) for i in range(1,d+1)))\r\n\r\n\r\n", "n = int(input())\r\nk = int(input())\r\na = int(input())\r\nm = int(input())\r\nd = int(input())\r\ncount = d\r\nfor i in range(1 ,d+1):\r\n if(i % n != 0 and i % k != 0 and i % a != 0 and i % m != 0):\r\n count -= 1\r\nprint(count)", "from math import lcm\r\n\r\nk, l, m, n, d = map(int, [input() for _ in range(5)])\r\nprint(d // k + d // l + d // m + d // n - (d // lcm(k, l) + d // lcm(k, m) + d // lcm(k, n) + d // lcm(l, m) + d // lcm(l, n) + d // lcm(m, n)) + d // lcm(k, l, m) + d // lcm(k, l, n) + d // lcm(k, m, n) + d // lcm(l, m, n) - d // lcm(k, l, m, n))", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ntot=0\r\nfor i in range(1,d+1):\r\n c=0\r\n for j in [k,l,m,n]:\r\n if i%j==0:\r\n c=1\r\n break\r\n if c:\r\n tot+=1\r\nprint(tot)\r\n \r\n \r\n", "q=int(input())\r\nw=int(input())\r\ne=int(input())\r\nr=int(input())\r\nt=int(input())\r\ny=0\r\nfor dragon in range(1,t+1):\r\n if dragon %q == 0 or dragon % w ==0 or dragon % e ==0 or dragon % r == 0:\r\n y+=1\r\nprint(y) \r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Oct 4 21:12:31 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nsum=0\r\nfor i in range(1,d+1):\r\n if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:\r\n sum=sum+1\r\n else:pass\r\nprint(d-sum)", "ns = list(set([int(input()) for x in range(4)]))\r\nd=int(input())\r\na=set()\r\n\r\nfor i in range(len(ns)):\r\n for j in range(ns[i],d+1,ns[i]):\r\n a.add(j)\r\nprint(len(a))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount = 0\r\nfor i in range(1,d+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0:\r\n count+=1\r\nprint(count)", "numbers=[]\r\nfor i in range(0,4):\r\n numbers.append(int(input()))\r\nd=int(input())\r\nexisted=[396]\r\nfor i in range(1,d+1):\r\n existed.append(0)\r\nfor i in numbers:\r\n p=1\r\n while(pi<=d):\r\n existed[pi]=1\r\n p+=1\r\nprint(existed.count(1))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount = 0\r\nwhile d>0:\r\n if d%k==0 or d%l==0 or d%m==0 or d%n==0:\r\n count = count + 1\r\n d = d-1\r\nprint(count)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ndragons = [False] * d\r\n\r\nfor i in range(1, d+1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n dragons[i-1] = True\r\n\r\ndamaged_dragons = dragons.count(True)\r\nprint(damaged_dragons)\r\n", "k,l,m,n,d=[int(input()) for i in range(5)]\r\nc=0\r\nfor i in range(1,d+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0: c+=1\r\nprint(c)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nmas = []\r\nfor i in range(d):\r\n if (i+1)%k==0 or (i+1)%l==0 or (i+1)%m==0 or (i+1)%n==0:\r\n mas.append(i)\r\nprint(len(mas))", "\r\ndiv = [ int(input()) for i in range(4) ]\r\nnum = int(input())\r\n\r\n# div.sort()\r\ns = 0\r\n\r\nfor i in range(1 , num+1):\r\n \r\n is_div = False \r\n for ele in div:\r\n if i % ele == 0 :\r\n is_div = True \r\n # break\r\n \r\n if is_div :\r\n s += 1\r\n \r\n \r\nprint(s)\r\n\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ne = 0\r\nfor poor in range(1, d + 1):\r\n if poor % k == 0 or poor % l == 0 or poor % m == 0 or poor % n == 0:\r\n e += 1\r\nprint(e)\r\n", "# Get input values for the divisors and the count\r\ndivisor_1 = int(input())\r\ndivisor_2 = int(input())\r\ndivisor_3 = int(input())\r\ndivisor_4 = int(input())\r\ncount = int(input())\r\n\r\n# Initialize a variable to keep track of the numbers divisible by at least one of the divisors\r\ndivisible_count = 0\r\n\r\n# Iterate through numbers from 1 to the specified count\r\nfor i in range(1, count + 1):\r\n # Check if the current number is divisible by any of the divisors\r\n if i % divisor_1 == 0 or i % divisor_2 == 0 or i % divisor_3 == 0 or i % divisor_4 == 0:\r\n divisible_count += 1 # Increment the count if divisible\r\n\r\n# Print the total count of numbers divisible by at least one of the divisors\r\nprint(divisible_count)\r\n", "k, l, m, n, d=map(int, open(0).read().split())\r\na = list(filter(lambda x: x%k, list(range(1, d+1))))\r\na = list(filter(lambda x: x%l, a))\r\na = list(filter(lambda x: x%m, a))\r\na = list(filter(lambda x: x%n, a))\r\nprint(d-len(a))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = list(range(1, int(input())+1))\r\nfor i in range(len(d)) : \r\n if d[i]%k == 0 or d[i]%l == 0 or d[i]%m == 0 or d[i]%n == 0 : \r\n d[i] = 0\r\nprint(len(d)-len(list(i for i in d if i != 0)))\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\ns=0\r\nfor i in range(1,e+1):\r\n if i%a!=0 and i%b!=0 and i%c!=0 and i%d!=0 :\r\n s+=1\r\n\r\nprint(e-s)\r\n", "slap=int(input())\r\ntail=int(input())\r\ninToHeal=int(input())\r\ncallToMom=int(input())\r\nnoDragons=int(input())\r\nsum=0\r\nfor i in range(1,noDragons+1):\r\n\tif i%slap==0:\r\n\t\tsum+=1\r\n\telif i%tail==0:\r\n\t\tsum+=1\r\n\telif i%inToHeal==0:\r\n\t\tsum+=1\r\n\telif i%callToMom==0:\r\n\t\tsum+=1\r\n\telse:\r\n\t\tcontinue\r\nprint(sum)", "k = int(input())\r\nl = int(input())\r\nn = int(input())\r\nm = int(input())\r\nd = int(input())\r\ndragons = 0\r\nfor i in range(d): \r\n if (i + 1) % l == 0 or (i + 1) % n == 0 or (i + 1) % m == 0 or (i + 1) % k == 0:\r\n dragons += 1\r\n \r\nprint(dragons) ", "# 148A - Insomnia Cure\r\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ncount = 0\r\nindex_dragon = 0\r\n\r\nfor dragon in range(d):\r\n index_dragon += 1\r\n if index_dragon % k == 0:\r\n count += 1\r\n elif index_dragon % l == 0:\r\n count += 1\r\n elif index_dragon % m == 0:\r\n count += 1\r\n elif index_dragon % n == 0:\r\n count += 1\r\n\r\nprint(count)", "Q=int(input())\r\nW=int(input())\r\nE=int(input())\r\nR=int(input())\r\nT=int(input())\r\nX=0\r\nfor Drag in range(1,T+1):\r\n if Drag %Q==0 or Drag %W==0 or Drag %E==0 or Drag %R==0:\r\n X+=1\r\nprint(X) ", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\nX = 0\nlst = []\nfor i in range(d + 1):\n if (i % k == 0 and i // k != 0):\n lst.append(i)\nfor i in range(d + 1):\n if (i % l == 0 and i // l != 0):\n lst.append(i)\nfor i in range(d + 1):\n if (i % m == 0 and i // m != 0):\n lst.append(i)\nfor i in range(d + 1):\n if (i % n == 0 and i // n != 0):\n lst.append(i)\nlst.sort()\ntest_list = list(set(lst))\ny = len(test_list)\nprint(y)\n \t \t\t \t\t \t\t\t\t\t \t\t\t\t\t \t \t \t\t", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nans = 0\r\nif k == 1 or l == 1 or m == 1 or n == 1:\r\n print(d)\r\nelse:\r\n for x in range(1, d+1):\r\n if x % k == 0 or x % l == 0 or x % m == 0 or x % n == 0:\r\n ans += 1\r\n\r\n print(ans)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount = d\r\n\r\nif k ==1 or m == 1 or n ==1 or l == 1:\r\n print(d)\r\nelse:\r\n for i in range(1,d+1):\r\n if i%k != 0 and i%l != 0 and i%m!=0 and i%n != 0:\r\n count-=1\r\n print(count)", "n1 = int(input())\r\nn2 = int(input())\r\nn3 = int(input())\r\nn4 = int(input())\r\nn5 = int(input())\r\nl = 0\r\nfor i in range(1,n5+1):\r\n if i%n1 == 0 or i%n2 == 0 or i%n3 == 0 or i%n4 == 0:\r\n l += 1\r\nprint(l)", "import math\r\ndef lcm_2(x, y):\r\n return x * y // math.gcd(x, y)\r\n\r\ndef lcm_3(x, y, z):\r\n return lcm_2(lcm_2(x, y), z)\r\n\r\ndef lcm_4(a, b, c, d):\r\n return lcm_2(lcm_2(lcm_2(a, b), c), d)\r\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ndef count_divisible(x):\r\n return d // x\r\n\r\ndamaged_dragons = (\r\n count_divisible(k)\r\n + count_divisible(l)\r\n + count_divisible(m)\r\n + count_divisible(n)\r\n - count_divisible(lcm_2(k, l))\r\n - count_divisible(lcm_2(k, m))\r\n - count_divisible(lcm_2(k, n))\r\n - count_divisible(lcm_2(l, m))\r\n - count_divisible(lcm_2(l, n))\r\n - count_divisible(lcm_2(m, n))\r\n + count_divisible(lcm_3(k, l, m))\r\n + count_divisible(lcm_3(k, l, n))\r\n + count_divisible(lcm_3(k, m, n))\r\n + count_divisible(lcm_3(l, m, n))\r\n - count_divisible(lcm_4(k, l, m, n))\r\n)\r\n\r\nprint(damaged_dragons)\r\n\r\n", "k=int(input())\nl=int(input())\nm=int(input())\nn=int(input())\nd=int(input())\n\nlis=[]\nfor i in range(1,d+1):\n if ki<=d:\n lis.append(ki)\n if li<=d:\n lis.append(li)\n if mi<=d:\n lis.append(mi)\n if ni<=d:\n lis.append(ni)\nlis=list(set(lis))\nprint(len(lis))\n\t\t \t \t\t \t \t\t\t\t\t\t \t\t\t\t\t \t \t\t\t", "data = [int(input()) for _ in range(5)]\r\ndragons = [0] * data[-1]\r\nprint(sum(1 for n in range(1, len(dragons) + 1) if not n % data[0] or\r\n not n % data[1] or not n % data[2] or not n % data[3]))", "def no_of_damaged_dragons():\r\n fry_pan_on_face = int(input())\r\n tail_shut_balcony_door = int(input())\r\n paws_trampled_sharp_heels = int(input())\r\n mom_threat = int(input())\r\n total_dragon = int(input())\r\n damaged_dragons = []\r\n for i in range(1, total_dragon + 1):\r\n if i % fry_pan_on_face == 0 or i % tail_shut_balcony_door == 0 or i % paws_trampled_sharp_heels == 0 or i % mom_threat == 0:\r\n damaged_dragons.append(i)\r\n print(len(damaged_dragons))\r\n\r\n\r\nno_of_damaged_dragons()\r\n", "lst = [int(input()), int(input()), int(input()), int(input())]\r\nif 1 in lst:\r\n print(int(input()))\r\nelse:\r\n d = int(input())\r\n new_lst = []\r\n for i in lst:\r\n if i not in new_lst:\r\n for j in range(1,d//i+1):\r\n num = ij\r\n if num not in new_lst:\r\n new_lst.append(num)\r\n print(len(new_lst)) \r\n \r\n \r\n\r\n", "res = []\r\nfor h in range(4):\r\n man= int(input())\r\n res.append(man)\r\n\r\nlearn = int(input())\r\n\r\ndef lest_nampor(d,res):\r\n lest = 0\r\n for nampr in range(1 , d+1):\r\n for gren in res:\r\n if nampr % gren == 0:\r\n lest +=1\r\n break\r\n return lest\r\n\r\ng = lest_nampor(learn,res)\r\nprint(g)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nks = []\r\nls = []\r\nms = []\r\nns = []\r\ndef f(chislo,lisok,d):\r\n k = chislo\r\n while chislo<=d:\r\n lisok.append(chislo)\r\n chislo+=k\r\n return lisok\r\nks = f(k,ks,d)\r\nls = f(l,ls,d)\r\nms = f(m,ms,d)\r\nns = f(n,ns,d)\r\nob = ks+ls+ms+ns\r\nq = set(ob)\r\ng = sorted(q)\r\nlistec = []\r\nfor i in range(1,(d+1)):\r\n listec.append(i)\r\nprint(len(g))", "k = int(input()) # Damage condition 1: punched in the face\r\nl = int(input()) # Damage condition 2: tail shut in the balcony door\r\nm = int(input()) # Damage condition 3: paws trampled with sharp heels\r\nn = int(input()) # Damage condition 4: threatened to call mom\r\nd = int(input()) # Total number of dragons\r\n\r\ndamaged_dragons = 0\r\n\r\nfor dragon in range(1, d + 1):\r\n if dragon % k == 0 or dragon % l == 0 or dragon % m == 0 or dragon % n == 0:\r\n damaged_dragons += 1\r\n\r\nprint(damaged_dragons)\r\n", "import math\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\ndef count_damaged_dragons(k, l, m, n, d):\r\n \"\"\"Counts the number of dragons that were damaged.\r\n\r\n Args:\r\n k: The number of dragons that were punched in the face with a frying pan.\r\n l: The number of dragons that got their tails shut into the balcony door.\r\n m: The number of dragons that got their paws trampled with sharp heels.\r\n n: The number of dragons that were threatened to be called out by the princess's mom.\r\n d: The total number of dragons.\r\n\r\n Returns:\r\n The number of dragons that were damaged.\r\n \"\"\"\r\n\r\n # Create a set to store the numbers of the dragons that were damaged.\r\n damaged_dragons = set()\r\n\r\n # Iterate over the dragons, starting from the first dragon.\r\n for dragon_number in range(1, d + 1):\r\n # Check if the dragon's number is divisible by k, l, m, or n.\r\n if dragon_number % k == 0 or dragon_number % l == 0 or dragon_number % m == 0 or dragon_number % n == 0:\r\n # If it is, add the dragon's number to the set.\r\n damaged_dragons.add(dragon_number)\r\n\r\n # Return the size of the set.\r\n return len(damaged_dragons)\r\n\r\n# Example usage:\r\n\r\ncount = count_damaged_dragons(k, l, m, n, d)\r\n\r\nprint(count)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nn=int(input())\r\nmas=[True](n+1)\r\nfor k in range(1,n+1):\r\n if (k%a==0 or k%b==0 or k%c==0 or k%d==0):\r\n mas[k]=False\r\nch=0\r\nfor k in range(1,n+1):\r\n if mas[k]==False:\r\n ch=ch+1\r\nprint(ch)\r\n", "s = set()\nk = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\na = k\nwhile a <= d:\n s.add(a)\n a += k\n\na = l\nwhile a <= d:\n s.add(a)\n a += l\n\na = m\nwhile a <= d:\n s.add(a)\n a += m\n\na = n\nwhile a <= d:\n s.add(a)\n a += n\n\nprint(len(s))\n\t\t\t \t \t \t\t \t \t \t\t \t\t\t\t\t\t", "def gint():\r\n return int(input())\r\nk,l,m,n,d = gint(),gint(),gint(),gint(),gint()\r\ncount = 0\r\nfor i in range(1,d+1):\r\n if (i%k==0 or i%l==0) or (i%m==0 or i%n==0):\r\n count +=1\r\nprint(count)", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\ncnt = 0\r\nfor _ in range(1, d + 1):\r\n if _ % k == 0 or _ % l == 0 or _ % m == 0 or _ % n ==0:\r\n cnt += 1\r\nprint(cnt)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount = 0\r\n\r\nfor i in range(1,d+1):\r\n if i%k == 0:\r\n count +=1\r\n continue\r\n\r\n if i%l == 0:\r\n count +=1\r\n continue\r\n if i%m == 0:\r\n count +=1\r\n continue\r\n\r\n if i%n == 0:\r\n count +=1\r\n continue \r\nprint(count)\r\n\r\n\r\n\r\n\r\n", "k=int(input())\nl=int(input())\nm=int(input())\nn=int(input())\nd=int(input())+1\ns=set([i for i in range(k,d,k)])\ns.update([i for i in range(l,d,l)])\ns.update([i for i in range(m,d,m)])\ns.update([i for i in range(n,d,n)])\nprint(len(s))", "div = [ int(input()) for i in range(4) ]\r\nnum = int(input())\r\n\r\n\r\n# print(div)\r\n \r\ndef sol(div , num):\r\n \r\n div = sorted(list(set(div)) )\r\n \r\n if div[0] == 1 :\r\n return num\r\n \r\n arr = [False](num+1)\r\n for i in div:\r\n for ind in range(i, num+1 , i ):\r\n arr[ind] = True\r\n \r\n return sum(arr)\r\n \r\nprint(sol(div , num))\r\n ", "s,v=map(int,open(0))\r\nprint(sum(any(i%j==0 for j in s)for i in range(1,v+1)))", "a1=int(input())\r\na2=int(input())\r\nb1=int(input())\r\nb2=int(input())\r\ndragons=int(input())\r\nc=0\r\nfor i in range(1,dragons+1):\r\n if i%a1==0 or i%a2==0 or i%b1==0 or i%b2==0:\r\n c+=1\r\nprint(c) \r\n ", "a,b,c,d,n=map(int,(input() for _ in range(5)))\nm=0\nfor i in range(1,n+1):\n if i%a and i%b and i%c and i%d:\n continue\n else:\n m+=1\nprint(m)\n \t \t \t\t \t\t\t \t\t \t \t \t \t \t", "from collections import Counter\r\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nvis = [0] * (d + 1)\r\np = 1\r\nwhile p * k <= d:\r\n vis[p * k] = 1\r\n p += 1\r\np = 1\r\nwhile p * l <= d:\r\n vis[p * l] = 1\r\n p += 1\r\np = 1\r\nwhile p * m <= d:\r\n vis[p * m] = 1\r\n p += 1\r\np = 1\r\nwhile p * n <= d:\r\n vis[p * n] = 1\r\n p += 1\r\nprint(sum(vis))", "\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\nc=d\r\nif( k==1 or l==1 or m==1 or n==1):\r\n print(d)\r\nelse:\r\n for i in range(1,d+1):\r\n if i % k != 0 and i % l != 0 and i % m != 0 and i % n != 0:\r\n c-=1\r\n print(c)\r\n", "ka=int(input())\r\nla=int(input())\r\nma=int(input())\r\nna=int(input())\r\nda=int(input())\r\n \r\ndragen=0\r\nfor i in range(1,da+1):\r\n if i%ka==0 or i%la==0 or i%ma==0 or i%na==0:\r\n dragen=dragen+1\r\nprint(dragen)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nl1 = [i for i in range(1, d + 1)]\r\nc = 0\r\nfor i in l1:\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:\r\n c += 1\r\nprint(c)", "k, l, m, n, d = [int(input()) for _ in range(5)]\r\nprint(sum(any(i % j == 0 for j in [k, l, m, n]) for i in range(1, d + 1)))", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\nt=0\r\nfor i in range(1, d+1):\r\n if i%k==0: t+=1\r\n elif i%l==0: t+=1\r\n elif i%m==0: t+=1\r\n elif i%n==0: t+=1\r\n\r\nprint(t)", "def solve():\r\n k = int(input())\r\n l = int(input())\r\n m = int(input())\r\n n = int(input())\r\n d = int(input())\r\n\r\n if k==1 or l==1 or m==1 or n==1:\r\n print(d) \r\n else:\r\n count = 0\r\n for i in range(1, d+1):\r\n if i%k != 0 and i%l != 0 and i%m != 0 and i%n !=0:\r\n count += 1\r\n\r\n print(abs(d - count))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "a = int(input())\nb = int(input())\nc = int(input())\nd = int(input())\nn = int(input())\nif(a==1 or b==1 or c==1 or d==1):\n print(n)\nelse:\n m = [0 for i in range(n)]\n for i in range(a-1,n,a):\n m[i] = 1\n for i in range(b-1,n,b):\n m[i] = 1\n for i in range(c-1,n,c):\n m[i] = 1\n for i in range(d-1,n,d):\n m[i] = 1\n print(sum(m))\n\n\t\t\t\t\t\t \t\t\t \t\t\t \t \t \t \t \t \t \t\t", "n, n1, n2, n3 = int(input()), int(input()), int(input()), int(input())\r\nx = int(input())\r\ns = 0\r\nfor i in range(1, x + 1):\r\n if i % n == 0 or i % n1 == 0 or i % n2 == 0 or i % n3 == 0:\r\n s = s + 1\r\nprint(s)", "def solve():\n k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\n ans = 0\n dd = [0] * (d + 1)\n for i in range(1, d // k + 1):\n dd[k * i] = 1\n for i in range(1, d // l + 1):\n dd[l * i] = 1\n for i in range(1, d // m + 1):\n dd[m * i] = 1\n for i in range(1, d // n + 1):\n dd[n * i] = 1\n print(dd.count(1))\n\n# main\nif __name__ == \"__main__\":\n solve()\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = [int(i) for i in range(1, int(input()) + 1)]\r\nkey = []\r\nkey.append(k)\r\nkey.append(l)\r\nkey.append(m)\r\nkey.append(n)\r\nfor y in range(len(d)):\r\n for j in key:\r\n if d[y] % j == 0:\r\n d[y] = 0\r\nprint(d.count(0))\r\n", "k, l, m, n, d = int(input()),int(input()),int(input()),int(input()),int(input())\r\nlst_num = [int(i) for i in range(1, d+1)]\r\ncount = 0\r\nfor i in lst_num:\r\n if i % k != 0 and i % l != 0 and i % m != 0 and i % n != 0:\r\n count += 1\r\nprint(d - count) \r\n \r\n", "\r\n\r\n# The input has 5 lines, or 5 inputs.\r\n# The first 4 represent a position in a list where a dragon will be hurt. \r\n# Find the number of dragons that are damaged and output it.\r\n\r\n# For example and input of 1 2 3 4 12 means that every 1st dragon takes damage, every 2nd dragon takes damage, every 3rd dragon takes damage, and every 4th dragon takes damage. And there are 4 total dragons.\r\n\r\n# If the input was 0 0 0 4 12, then only the 4th, 8th, and 12th dragon would take damage.\r\n\r\n# A thing to keep in mind when doing this problem is to keep track of duplicates. For example 2 4 0 0 12 would have duplicate damaged dragons because a dragon damaged by 4 would always be damaged by 2.\r\n\r\n# d = number of dragons\r\n\r\n# To solve I think I want to make a list of dragons and then check the damaged positions of each one. Then tag that dragon in some way--this way if a dragon is damaged twice because he's already tagged he wouldn't get double counted. Then at the end just count the total number of dragons.\r\n\r\ndamage1 = int(input())\r\ndamage2 = int(input())\r\ndamage3 = int(input())\r\ndamage4 = int(input())\r\ntotalDragons = int(input())\r\n\r\n# First, let's make a list full of empty strings as long as the totalDragons variable.\r\ndamagedDragons = [\"O\"]* totalDragons # O will mean a dragon is OK.\r\n\r\n# Next, let's make a list of the damaged positions so we can loop through it in a list.\r\ndamagedPosition = [damage1, damage2, damage3, damage4]\r\n\r\n# Next, we need to loop through each each index value and check whether that position is divisible by the damage type. We will compare the damagedPosition index value at 0 to every damagedDragons index value. \r\n\r\ndd = 0 # index value counter for damagedDragons.\r\ndp = 0 # index value counter for damagedPosition List.\r\n\r\n\r\ngoAhead = True\r\nwhile(goAhead):\r\n\r\n damageType = damagedPosition[dp]\r\n \r\n if (dd + 1) % damageType == 0:\r\n damagedDragons[dd] = \"D\"\r\n dd += 1 # moves on to the next dragon's position\r\n \r\n if dd == len(damagedDragons):\r\n dd = 0 # reset the dd index counter\r\n dp += 1 # increase the dp index counter\r\n # In other words, once we look at all the dragons in the list to see if they are affected by the damage position \"DP\" value, we move onto the next \"DP\" value in the loop.\r\n \r\n if dp >= len(damagedPosition):\r\n goAhead = False\r\n # If the \"DP\" counter is equal to the length of the list, or greater, then we have examined all the DP position values against all of the damaged dragon positions and we close the loop.\r\n\r\noutput = damagedDragons.count(\"D\") # count the number of damaged dragons.\r\n\r\nprint(output) # print the answer.\r\n\r\n", "from math import lcm\n\ndef solve():\n a, d = map(int, open(0))\n print(sum(any(i % j == 0 for j in a) for i in range(1, d + 1)))\n\n\nif __name__ == '__main__':\n solve()\n", "div = [ int(input()) for i in range(4) ]\r\nnum = int(input())\r\n \r\narr = [False](num+1)\r\n \r\nfor i in div:\r\n \r\n for ind in range(i, num+1 , i ):\r\n \r\n arr[ind] = True\r\n # print(i , ind)\r\n \r\n # print( i , arr)\r\nprint(sum(arr))\r\n ", "k = int(input(\"\"))\r\nl = int(input(\"\"))\r\nm = int(input(\"\"))\r\nn = int(input(\"\"))\r\nqtd = int(input(\"\"))\r\n\r\nconta = 0\r\nfor i in range(1,qtd+1,1):\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n ==0:\r\n conta +=1\r\nprint(conta)" ]	{"inputs": ["1\n2\n3\n4\n12", "2\n3\n4\n5\n24", "1\n1\n1\n1\n100000", "10\n9\n8\n7\n6", "8\n4\n4\n3\n65437", "8\n4\n1\n10\n59392", "4\n1\n8\n7\n44835", "6\n1\n7\n2\n62982", "2\n7\n4\n9\n56937", "2\n9\n8\n1\n75083", "8\n7\n7\n6\n69038", "4\n4\n2\n3\n54481", "6\n4\n9\n8\n72628", "9\n7\n8\n10\n42357", "5\n6\n4\n3\n60504", "7\n2\n3\n8\n21754", "1\n2\n10\n4\n39901", "3\n4\n7\n1\n58048", "9\n10\n4\n6\n52003", "5\n10\n9\n3\n70149", "5\n5\n5\n10\n55592", "1\n5\n2\n6\n49547", "3\n7\n7\n7\n84046", "10\n2\n1\n8\n63537", "7\n2\n10\n5\n81684", "7\n1\n6\n8\n99831", "3\n9\n3\n3\n61082", "5\n5\n8\n9\n79228", "1\n5\n5\n6\n89535", "5\n5\n2\n1\n7682", "7\n4\n8\n8\n25829", "3\n4\n3\n3\n87079", "5\n8\n4\n9\n5226", "4\n9\n6\n6\n1070", "10\n10\n10\n10\n100000", "1\n1\n1\n1\n1", "10\n10\n10\n10\n1", "10\n10\n1\n10\n10", "10\n10\n1\n10\n100", "2\n2\n2\n2\n1"], "outputs": ["12", "17", "100000", "0", "32718", "59392", "44835", "62982", "35246", "75083", "24656", "36320", "28244", "16540", "36302", "15539", "39901", "58048", "21956", "32736", "11118", "49547", "36019", "63537", "53678", "99831", "20360", "29931", "89535", "7682", "9224", "43539", "2438", "415", "10000", "1", "0", "10", "100", "0"]}	UNKNOWN	PYTHON3	CODEFORCES	410
913a723377dcbcee617e84424051c006	Guess the Array	This is an interactive problem. You should use flush operation after each printed line. For example, in C++ you should use fflush(stdout), in Java you should use System.out.flush(), and in Pascal — flush(output). In this problem you should guess an array a which is unknown for you. The only information you have initially is the length n of the array a. The only allowed action is to ask the sum of two elements by their indices. Formally, you can print two indices i and j (the indices should be distinct). Then your program should read the response: the single integer equals to ai<=+<=aj. It is easy to prove that it is always possible to guess the array using at most n requests. Write a program that will guess the array a by making at most n requests. none none Sample Input 5 9 7 9 11 6 Sample Output ? 1 5 ? 2 3 ? 4 1 ? 5 2 ? 3 4 ! 4 6 1 5 5	[ "nnums = int(input())\n\nans = [-1] * nnums\n\nprint(\"? 1 2\", flush = True)\na = int(input())\nprint(\"? 2 3\", flush = True)\nb = int(input())\nprint(\"? 3 1\", flush = True)\nc = int(input())\n\nans[0 : 3] = [(a-b+c)/2, (b-c+a)/2, (c-a+b)/2]\n\nfor i in range(3, nnums):\n print(\"? \" + str(i) + \" \" + str(i+1), flush = True)\n ans[i] = int(input()) - ans[i-1]\n\nprint('!', map(int, ans))\n\t\t \t\t \t\t \t \t \t\t \t \t\t\t \t\t\t\t \t", "def ask (i, j):\n print (\"?\", i, j)\n resp = int(input())\n return resp\n\nn = int(input())\n\narr = {}\n\na = int(ask(1, 2))\nb = int(ask(1, 3))\nc = int(ask(2, 3))\n\narr[1] = int((a+b-c)/2)\narr[2] = int(a - arr[1])\narr[3] = int(b - arr[1])\n\n\nfor i in range(4, n+1):\n arr[i] = int(ask(i-1, i) - arr[i-1])\n\nprint(\"!\", arr.values())\n \t \t \t\t\t \t \t \t \t \t\t\t\t \t\t\t", "import sys\n\nn = int(input())\n\nprint('? 1 2')\nsys.stdout.flush()\nsum_1_2 = int(input())\n\nprint('? 1 3')\nsys.stdout.flush()\nsum_1_3 = int(input())\n\nprint('? 2 3')\nsys.stdout.flush()\nsum_2_3 = int(input())\n\nvalue_3 = (sum_1_3 - sum_1_2 + sum_2_3) // 2\nvalue_2 = sum_2_3 - value_3\nvalue_1 = sum_1_2 - value_2\n\narray = [value_1, value_2, value_3]\n\nfor i in range(4, n+1):\n print('? 1 %d' % i)\n sys.stdout.flush()\n\n x = int(input())\n\n array.append(int(x - value_1))\n\nprint('! ', end='')\nprint(array)\n\n\t\t\t \t \t \t\t \t\t\t \t\t \t \t\t\t \t", "n = int(input())\nprint(\"? 1 2\")\na = int(input())\nprint(\"? 1 3\")\nb = int(input())\nprint(\"? 2 3\")\nc = int(input())\nans = [(a + b - c) // 2]\nans.append(a - ans[0])\nans.append(b - ans[0])\nfor i in range(3, n):\n print(\"? 1\", i + 1)\n temp = int(input())\n ans.append(temp - ans[0])\nprint(\"! \", end=\"\")\nfor i in range(n):\n print(ans[i], end=\" \")\n \t\t \t\t \t \t\t\t\t \t\t\t \t\t\t \t\t\t", "n = int(input())\r\nlst = []\r\nprint(\"? 1 2\")\r\napb = int(input())\r\nprint(\"? 2 3\")\r\nbpc = int(input())\r\nprint(\"? 1 3\")\r\napc = int(input())\r\nlst.append(int((apb+apc-bpc)/2))\r\nlst.append(apb - lst[0])\r\nlst.append(bpc - lst[1])\r\nfor i in range(3, n):\r\n print(f\"? {i} {i+1}\")\r\n sum = int(input())\r\n lst.append(sum - lst[-1])\r\n\r\nprint(\"! \", end = \"\")\r\nfor i in lst:\r\n print(i, end=\" \")\r\nprint()", "n = int(input())\r\na=[0]n\r\nprint('?',1,2,flush=1)\r\na1=int(int(input()))\r\nprint('?',2,3,flush=1)\r\na2=int(int(input()))\r\nprint('?',1,3,flush=1)\r\na3=int(input())\r\na[0]=(a1+a3-a2)//2\r\na[1]=a1-a[0]\r\na[2]=a3-a[0]\r\nfor i in range(3,n):\r\n print('?',1,i+1,flush=1)\r\n p=int(input())\r\n a[i]=p-a[0]\r\nprint('!',a)\r\n\r\n", "import sys\n\nA = []\nn = int(input())\nprint(\"? 1 2\")\nsys.stdout.flush()\nr1 = int(input())\nprint(\"? 1 3\")\nsys.stdout.flush()\nr2 = int(input())\nprint(\"? 2 3\")\nsys.stdout.flush()\nr3 = int(input())\nA.append(str((r1 + r2 - r3)//2))\nA.append(str(r1 - int(A[0])))\nA.append(str(r2 - int(A[0])))\nfor i in range(3, n):\n print(\"? 1\", i + 1)\n sys.stdout.flush()\n A.append(str(int(input()) - int(A[0])))\ns = \" \".join(A)\nprint(\"!\", s)\n\t \t\t\t\t \t \t \t\t \t\t\t \t", "from sys import stdout\nn = int(input())\nprint('?', 1, 2)\na = int(input())\nstdout.flush()\nprint('?', 2, 3)\nb = int(input())\nstdout.flush()\nprint('?', 1, 3)\nc = int(input())\nstdout.flush()\nA = [(a + c - b) // 2, (a + b - c) // 2, (b + c - a) // 2]\nfor i in range(4, n + 1):\n print('?', 1, i)\n m = int(input())\n stdout.flush()\n A.append(m - A[0])\nprint('!', A)\n\n\n", "n = int(input())\n\nprint(\"? 1 2\")\nn1 = int(input())\nprint(\"? 1 3\")\nn2 = int(input())\nprint(\"? 2 3\")\nn3 = int(input())\n\nnum1 = (n1 + n2 - n3) // 2\nnum2 = n1 - num1\nnum3 = n2 - num1\n\na = [num1, num2, num3]\nfor i in range(4, n + 1):\n print(\"? \" + \"1 \" + str(i))\n num = int(input())\n a.append(num - num1)\n\nprint(\"! \", end = \"\")\nprint(a)\n\t\t\t\t \t \t \t\t\t \t\t \t\t \t\t \t \t\t", "n=int(input())\r\na=[0]n\r\nprint('?',1,2)\r\na1=int(input())\r\nprint('?',2,3)\r\na2=int(input())\r\nprint('?',1,3)\r\na3=int(input())\r\na[0]=(a1+a3-a2)//2\r\na[1]=a1-a[0]\r\na[2]=a3-a[0]\r\nfor i in range(3,n):\r\n\tprint('?',1,i+1)\r\n\ta[i]=int(input())-a[0]\r\nprint('!',a)", "n = int(input())\r\narr = [0 for i in range(n)]\r\nprint(\"? 1 2\")\r\na1 = int(input())\r\nprint(\"? 1 3\")\r\na2 = int(input())\r\nprint(\"? 2 3\")\r\na3 = int(input())\r\narr[0] = (a1+a2-a3) // 2\r\narr[1] = (a1-a2+a3) // 2\r\narr[2] = (-a1+a2+a3) // 2\r\nfor i in range(3,n):\r\n print(\"? 1 %d\"%(i+1))\r\n x = int(input())\r\n arr[i] = x - arr[0]\r\nprint(\"! \", end='')\r\nfor i in range(n):\r\n print(arr[i], end=' ')\r\n", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n nElements = int(input())\r\n dataRange = tuple(range(nElements+1))\r\n sumOfElements = list(map(int, (request(f'? {x} {y}') for x, y in\r\n zip(dataRange[1:-1], dataRange[2:]))))\r\n\r\n return guessForArrayFrom(dataRange, sumOfElements, int(request('? 1 3')))\r\n\r\n\r\ndef request(query):\r\n print(query, flush=True)\r\n return input()\r\n\r\n\r\ndef guessForArrayFrom(dataRange, subsequentElements, lastRequest):\r\n firstElement = prevElement = (subsequentElements[0] - subsequentElements[1] + lastRequest) // 2\r\n for i in dataRange[:-2]:\r\n subsequentElements[i] -= prevElement\r\n prevElement = subsequentElements[i]\r\n\r\n return f'! {firstElement} {\" \".join(map(str, subsequentElements))}'\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main(), flush=True)\r\n # main()\r\n", "n = int(input())\r\nprint(\"? 1 2\")\r\nx = int(input())\r\nprint(\"? 2 3\")\r\ny = int(input())\r\nprint(\"? 1 3\")\r\nz = int(input())\r\nlis = []\r\nc = (y+z-x)//2\r\na = (x+z-y)//2\r\nb = (x+y-z)//2\r\nlis.append(a)\r\nlis.append(b)\r\nlis.append(c)\r\n#print(lis)\r\nfor i in range(n-3):\r\n print(\"? \"+ str(i+3) + \" \"+ str(i+4))\r\n ii = int(input())\r\n next = ii-c\r\n lis.append(next)\r\n c = next\r\nprint(\"!\",lis)\r\n", "n = int(input())\r\n \r\nprint('? 1 2', flush=True)\r\nx = int(input())\r\nprint('? 1 3', flush=True)\r\ny = int(input())\r\nprint('? 2 3', flush=True)\r\nz = int(input())\r\nl = []\r\nl.append(int((x + y - z)/2))\r\nl.append(x-l[0])\r\nl.append(y-l[0])\r\ncnt = 4\r\nwhile cnt <= n:\r\n print('? 1',cnt,flush=True)\r\n l.append(int(input())-l[0])\r\n cnt += 1\r\nres ='! '\r\nfor elem in l:\r\n res += str(elem) + ' '\r\n \r\nprint(res)", "#flush=True\r\nN=int(input())\r\narr=[0]N\r\nprint(\"?\",1,2,flush=True)\r\na=int(input())\r\nprint(\"?\",2,3,flush=True)\r\nb=int(input())\r\nprint(\"?\",1,3,flush=True)\r\nc=int(input())\r\ns=(a+b+c)//2\r\narr[2]=s-a\r\narr[0]=s-b\r\narr[1]=s-c\r\nfor i in range(3,N):\r\n print(\"?\",1,i+1,flush=True)\r\n t=int(input())\r\n arr[i]=t-arr[0]\r\ns=\" \".join(str(x) for x in arr)\r\nprint(\"!\",s)", "\r\nimport sys\r\n\r\n\r\ndef query(i,j):\r\n print(\"?\",i,j)\r\n sys.stdout.flush()\r\n x=int(input())\r\n \r\n\r\n return x\r\ndef solve():\r\n n=int(input())\r\n arr=[0]n\r\n x=query(1,2)\r\n y=query(2,3)\r\n z=query(1,3)\r\n arr[0]=(x-y+z)//2\r\n \r\n arr[2]=z-arr[0]\r\n arr[1]=y-arr[2]\r\n for i in range(4,n+1):\r\n x=query(1,i)\r\n arr[i-1]=x-arr[0]\r\n print(\"!\",arr) \r\nsolve()\r\n\r\n\r\n\r\n\r\n\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\nprint(\"? 1 2\")\r\ns1 = int(input())\r\nprint(\"? 1 3\")\r\ns2 = int(input())\r\nprint(\"? 2 3\")\r\ns3 = int(input())\r\n\r\na1 = (s2-s3+s1)/2\r\na2 = s1-a1\r\na3 = s2-a1\r\nres = [int(a1),int(a2),int(a3)]\r\nfor i in range(4,n+1):\r\n print('? 1 ' + str(i))\r\n s = int(input())\r\n a = s - a1\r\n res.append(int(a))\r\n\r\nprint(\"! \" + \" \".join(map(str, res)))\r\n\r\n\r\n", "import sys\nfinal = []\ntamanho = int(input())\nprint(\"? 1 2\")\nsys.stdout.flush()\na = int(input())\nprint(\"? 2 3\")\nsys.stdout.flush()\nb = int(input())\nprint(\"? 1 3\")\nsys.stdout.flush()\nc = int(input())\nprimeiro = (a - b + c)/2\nsegundo = a - primeiro\nterceiro = c - primeiro\nfinal.append(\"!\")\nfinal.append(int(primeiro))\nfinal.append(int(segundo))\nfinal.append(int(terceiro))\nfor a in range(4,tamanho+1):\n print(\"? 1 %i\" %a)\n sys.stdout.flush()\n soma = int(input())\n atual = soma - primeiro\n final.append(int(atual))\nprint(final)\n \t\t \t \t\t \t\t\t \t\t\t \t \t\t\t\t \t", "import sys \nshetchik = 3\nchislo = 0\nff = ''\na = ''\nn = input()\nn = int(n)\nff = '? 1 2 '\nprint(ff)\nsys.stdout.flush()\nb = input()\nb = int(b)\nff = '? 2 3 '\nprint(ff)\nsys.stdout.flush()\nc = input()\nc = int(c)\nf = c - b\nff = '? 1 3 '\nprint(ff)\nsys.stdout.flush()\nd = input()\nd = int(d)\npervoe = (d - f) // 2\ntretee = pervoe + f\nvtoroe = c - tretee\na = '! ' + str(pervoe) + ' ' + str(vtoroe) + ' ' + str(tretee)\nwhile shetchik < n :\n chislo = 0\n ff = '? 1 ' + str((shetchik+1))\n print(ff)\n sys.stdout.flush()\n h = input()\n h = int(h)\n chislo = h - pervoe\n a = a + ' ' + str(chislo)\n shetchik = shetchik + 1\nprint(a)\nsys.stdout.flush()\n", "n = int(input())\r\n \r\nprint('? 1 2')\r\na = int(input())\r\nprint('? 2 3')\r\nb = int(input())\r\nprint('? 1 3')\r\nc = int(input())\r\n \r\nx = (a - b + c) // 2\r\ny = a - x\r\nz = b - y\r\n \r\nans = \"! \" + str(x) + \" \" + str(y) + \" \" + str(z) + \" \"\r\n \r\nfor i in range(4, n + 1):\r\n print(\"? 1 \" + str(i))\r\n w = int(input())\r\n ans += str(w - x) + \" \"\r\n \r\nprint(ans.strip())", "n = int(input())\r\n\r\nprint(\"? 1 2\")\r\na = int(input())\r\nprint(\"? 2 3\")\r\nb = int(input())\r\nprint(\"? 1 3\")\r\nc = int(input())\r\n\r\nz = (c + b - a)//2\r\ny = b - z\r\nx = a - y\r\n\r\nlistt = [x, y, z]\r\n\r\nn -= 3\r\n\r\nfor i in range(n):\r\n print(\"? 1\", i + 4)\r\n q = int(input())\r\n q -= x\r\n listt.append(q)\r\n\r\nprint(\"!\", listt)", "def ask(i, j):\r\n print('?', i, j)\r\n return int(input())\r\n\r\n\r\nn = int(input())\r\na = ask(1, 2)\r\nb = ask(2, 3)\r\nc = ask(1, 3)\r\nx = (a + b - c) // 2\r\nans = [a - x, x, c - a + x]\r\nfor i in range(4, n+1):\r\n ans += [ask(2, i) - x]\r\n\r\nprint('!', ans)", "import sys\n\ndef query(i, j):\n print(f\"? {i} {j}\")\n sys.stdout.flush()\n soma = int(input())\n \n return soma\n\n\nn = int(input())\n\nx = query(1, 2)\ny = query(1, 3)\nz = query(2, 3)\n\npos_um = (x + y - z) // 2\npos_dois = x - pos_um\npos_tres = y - pos_um\n\narray = [pos_um, pos_dois, pos_tres]\n\nfor i in range(4, n + 1):\n array.append(query(1, i) - pos_um)\n\nprint('!' + \" \" + \" \".join(map(str, array)))\n\nprint()\n\t \t \t\t\t\t \t \t\t\t \t \t", "import sys\r\nfl = sys.stdout.flush\r\nr=[]\r\nn = int(input())\r\nprint('?',1,2)\r\nfl()\r\na = int(input())\r\nprint('?',2,3)\r\nfl()\r\nb = int(input())\r\nprint('?',1,3)\r\nfl()\r\nc = int(input())\r\nx = (a+c-b)//2\r\nr.append(x)\r\nr.append((a+b-c)//2)\r\nr.append((b+c-a)//2)\r\n\r\nfor i in range(4,n+1):\r\n print('?',1,i)\r\n fl()\r\n y = int(input())\r\n r.append(y-x)\r\nprint('!',r)\r\nfl()", "#include <CodeforcesSolutions.h>\r\n#include <ONLINE_JUDGE <solution.cf(contestID = \"1418\",questionID = \"A\",method = \"GET\")>.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\n##########################################################################\r\n################# ---- THE ACTUAL CODE STARTS BELOW ---- #################\r\n\r\ndef solve():\r\n n = inp()\r\n print(\"?\",1,2,flush = True)\r\n q = inp()\r\n print(\"?\",2,3,flush = True)\r\n w = inp()\r\n print(\"?\",1,3,flush = True)\r\n qw = inp()\r\n qq = (q + w + qw) // 2\r\n a = [qq - w,qq - qw,qq - q]\r\n for i in range(3,n):\r\n print(\"?\",i,i + 1,flush = True)\r\n a.append(inp() - a[-1])\r\n print(\"!\",a)\r\n\r\n################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################\r\n##########################################################################\r\n \r\ndef main():\r\n global tt\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(1,t + 1):\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\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#------------------ 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 counter_elements(a):\r\n q = dict()\r\n for i in range(len(a)):\r\n if a[i] not in q:\r\n q[a[i]] = 0\r\n q[a[i]] = q[a[i]] + 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\n \r\ndef factors(n):\r\n q = []\r\n for i in range(1,int(n 0.5) + 1):\r\n if n % i == 0: q.append(i); q.append(n // i)\r\n return(list(sorted(list(set(q)))))\r\n \r\ndef prime_factors(n):\r\n q = []\r\n while n % 2 == 0: q.append(2); n = n // 2\r\n for i in range(3,int(n 0.5) + 1,2):\r\n while n % i == 0: q.append(i); n = n // i\r\n if n > 2: q.append(n)\r\n return(list(sorted(q)))\r\n \r\ndef transpose(a):\r\n n,m = len(a),len(a[0])\r\n b = [[0] * n for i in range(m)]\r\n for i in range(m): \r\n for j in range(n): \r\n b[i][j] = a[j][i]\r\n return(b)\r\n\r\ndef factorial(n,m = 1000000007):\r\n q = 1\r\n for i in range(n):\r\n q = (q * (i + 1)) % m\r\n return(q)\r\n\r\ndef ceil(a,b):\r\n return -(-a // b)\r\n#-----------------------------------------------------------------------#\r\nONLINE_JUDGE = __debug__\r\nif ONLINE_JUDGE:\r\n input = sys.stdin.readline\r\n\r\n\r\n\r\nmain()", "def pergunte(i, j):\r\n print(\"? {} {}\".format(i, j))\r\n print()\r\n res = int(input())\r\n return res\r\n\r\nn = int(input())\r\n\r\narranjo = [0](n+3)\r\n\r\na = pergunte(1, 2)\r\nb = pergunte(1, 3)\r\nc = pergunte(2, 3)\r\n\r\narranjo[1] = (a + b - c) // 2\r\narranjo[2] = a - arranjo[1]\r\narranjo[3] = b - arranjo[1]\r\n\r\nfor i in range(4, n+1):\r\n arranjo[i] = pergunte(i-1, i) - arranjo[i-1]\r\n\r\nprint(\"!\", end=' ')\r\n\r\nfor i in range(1, n+1):\r\n print(arranjo[i], end=' ')\r\n\r\nprint()\r\n", "import sys\r\nfl = sys.stdout.flush\r\ndef get(x,y):\r\n print('?',x,y)\r\n fl()\r\n a = int(input())\r\n return a\r\n\r\ndef outl(x):\r\n print('!',x)\r\n fl()\r\n\r\ndef out(x):\r\n print('!',x)\r\n fl()\r\n \r\nr=[]\r\nn = int(input())\r\na = get(1,2)\r\nb = get(2,3)\r\nc = get(1,3)\r\n\r\nx = (a+c-b)//2\r\nr.append(x)\r\nr.append((a+b-c)//2)\r\nr.append((b+c-a)//2)\r\n\r\nfor i in range(4,n+1):\r\n y = get(1,i)\r\n r.append(y-x)\r\noutl(r)", "import sys\r\n\r\nn = int(input())\r\nprint(\"? 1 2\")\r\nsys.stdout.flush()\r\ns12 = int(input())\r\nprint(\"? 2 3\")\r\nsys.stdout.flush()\r\ns23 = int(input())\r\nprint(\"? 1 3\")\r\nsys.stdout.flush()\r\ns13 = int(input())\r\n\r\na = [0] * n\r\na[0] = (s12 + s23 + s13) // 2 - s23\r\na[1] = (s12 + s23 + s13) // 2 - s13\r\na[2] = (s12 + s23 + s13) // 2 - s12\r\n\r\nfor i in range(3, n):\r\n print(\"?\", i, i + 1)\r\n sys.stdout.flush()\r\n s = int(input())\r\n a[i] = s - a[i - 1]\r\n\r\nprint(\"!\", \" \".join(map(str, a)))\r\n", "def g(i, j):\r\n print(\"? {} {}\".format(i, j))\r\n print()\r\n res = int(input())\r\n return res\r\n\r\nn = int(input())\r\n\r\najo = [0](n+3)\r\n\r\na = g(1, 2)\r\nb = g(1, 3)\r\nc = g(2, 3)\r\n\r\najo[1] = (a + b - c) // 2\r\najo[2] = a - ajo[1]\r\najo[3] = b - ajo[1]\r\n\r\nfor i in range(4, n+1):\r\n ajo[i] = g(i-1, i) - ajo[i-1]\r\n\r\nprint(\"!\", end=' ')\r\n\r\nfor i in range(1, n+1):\r\n print(ajo[i], end=' ')\r\n\r\nprint()\r\n", "if __name__ == '__main__':\r\n nr = int(input())\r\n # vector = []\r\n # for i in range(nr):\r\n # vector.append(0)\r\n vector = [0 for i in range(nr)]\r\n for i in range(1, nr):\r\n print(\"? 1\", i + 1)\r\n vector[i] = int(input())\r\n print(\"? 2 3\")\r\n m = int(input())\r\n val = (vector[1] - m + vector[2]) // 2\r\n print(\"!\", val, end = \" \")\r\n for i in range(1, nr):\r\n print(vector[i] - val, end = \" \")\r\n\r\n", "import sys\r\n\r\n\r\ndef perguntas(i, j):\r\n print(f\"? {i} {j}\")\r\n sys.stdout.flush()\r\n valor = int(input())\r\n return valor\r\n\r\n\r\nn = int(input())\r\nlista_num = [0] (n + 1)\r\nx = perguntas(1, 2)\r\ny = perguntas(1, 3)\r\nz = perguntas(2, 3)\r\n\r\nlista_num[1] = (x + y - z) // 2\r\nlista_num[2] = (x - y + z) // 2\r\nlista_num[3] = (-x + y + z) // 2\r\n\r\nfor i in range(4, n + 1):\r\n num = perguntas(1, i)\r\n lista_num[i] = num - lista_num[1]\r\n\r\nprint(\"!\", lista_num[1:], sep=\" \")\r\n", "'''Author- Akshit Monga'''\r\ndef query(i,j):\r\n print('?',i+1,j+1,flush=True)\r\n x=int(input())\r\n return x\r\nn=int(input())\r\nans=[0 for i in range(n)]\r\nval1=query(0,1)\r\nval2=query(1,2)\r\nval3=query(0,2)\r\nans[0]=(val1-val2+val3)//2\r\nans[1]=val1-ans[0]\r\nans[2]=val3-ans[0]\r\nfor i in range(3,n):\r\n temp=query(0,i)\r\n ans[i]=temp-ans[0]\r\nprint('!',ans)", "from sys import stdout\r\n\r\nn = int(input())\r\nlista = []\r\n\r\nprint(f\"? {1} {2}\")\r\nstdout.flush()\r\nx = int(input())\r\n\r\nprint(f\"? {1} {3}\")\r\nstdout.flush()\r\ny = int(input())\r\n\r\nprint(f\"? {2} {3}\")\r\nstdout.flush()\r\nz = int(input())\r\n\r\nlista.append((x + y - z) // 2)\r\nlista.append((x - y + z) // 2)\r\nlista.append((-x + y + z) // 2)\r\n\r\nfor i in range(4, n + 1):\r\n print(f\"? {1} {i}\")\r\n stdout.flush()\r\n num = int(input())\r\n lista.append(num - lista[0])\r\n\r\nprint(\"!\", lista, sep=\" \")\r\nstdout.flush()\r\n\r\n", "n = int(input())\r\nprint(\"? 1 2\")\r\na = int(input())\r\nprint(\"? 1 3\")\r\nb = int(input())\r\nprint(\"? 2 3\")\r\nc = int(input())\r\ns = [0] n\r\ns[0] = (a + b + c) // 2 - c\r\ns[1] = (a + b + c) // 2 - b\r\ns[2] = (a + b + c) // 2 - a\r\nfor i in range(3, n):\r\n print(\"?\", 1, i + 1)\r\n a = int(input())\r\n s[i] = a - s[0]\r\nprint(\"!\", s)", "n = int(input())\nar = []\n\nfor i in range(2, n+1):\n print('?', 1, i, flush=True)\n ar.append(int(input()))\n\n\nprint('?', 2, 3, flush=True)\n\nsum = int(input())\nar2 = []\nvar = ((ar[0]+sum+ar[1])//2)-sum\nar2.append(var)\n\n\nfor e in range(n-1):\n ar2.append(ar[e]-ar2[0])\n\n\nprint('!', ar2)\n\n \t \t\t\t \t\t \t\t\t\t\t\t\t \t\t\t", "import math\nimport sys\n\ndef asks(a, b):\n print(f\"? {a} {b}\")\n sys.stdout.flush()\n ans = int(input())\n return ans\n\nsize = int(input())\nansArray = [0] * (size+3)\n\na = asks(1, 2)\nb = asks(1, 3)\nc = asks(2, 3)\nansArray[1] = (a+b-c)//2\nansArray[2] = a - ansArray[1]\nansArray[3] = b - ansArray[1]\n\nfor i in range(4, size+1):\n ansArray[i] = asks(i-1, i) - ansArray[i-1]\n\nprint(\"!\", ansArray[1:size+1])\n\t\t \t \t\t \t\t\t\t \t\t \t\t\t \t \t", "import sys\r\n\r\ndef query(i, j):\r\n print(\"?\", i+1, j+1)\r\n sys.stdout.flush()\r\n res = int(input())\r\n return res\r\n\r\nn = int(input())\r\na = [0 for i in range(n)]\r\nq1 = query(0, 1)\r\nq2 = query(1, 2)\r\nq3 = query(0, 2)\r\na[0] = (q1 + q3 - q2)//2\r\na[1] = q1 - a[0]\r\na[2] = q3 - a[0]\r\nfor i in range(3, n): a[i] = query(0, i) - a[0]\r\nprint(\"!\", \" \".join([str(x) for x in a]))\r\nsys.stdout.flush()", "def g(i, j):\n print(\"? {} {}\".format(i, j))\n print()\n res = int(input())\n return res\n\nn = int(input())\n\najo = [0](n+3)\n\na = g(1, 2)\nb = g(1, 3)\nc = g(2, 3)\n\najo[1] = (a + b - c) // 2\najo[2] = a - ajo[1]\najo[3] = b - ajo[1]\n\nfor i in range(4, n+1):\n ajo[i] = g(i-1, i) - ajo[i-1]\n\nprint(\"!\", end=' ')\n\nfor i in range(1, n+1):\n print(ajo[i], end=' ')\n \t \t \t \t\t\t\t \t\t \t\t \t \t \t\t", "out = ['!']\n\nn = int(input())\na = int(input('? 1 2\\n'))\nb = int(input('? 2 3\\n'))\nc = int(input('? 1 3\\n'))\n\nf = (a - b + c) / 2\ns = a - f\nt = c - f\n\nout.append(int(f))\nout.append(int(s))\nout.append(int(t))\n\nfor i in range(4, n + 1):\n sum = int(input(f'? 1 {i}\\n'))\n out.append(int(sum - f))\n\nprint(out)\n\t\t \t\t \t\t\t\t \t \t\t \t\t\t\t\t\t \t\t\t", "import sys\r\nn=int(input())\r\nw=[]\r\nfor i in range (2,n+1):\r\n print ('?',1,i)\r\n sys.stdout.flush()\r\n w.append(int(input()))\r\nprint ('?',2,3)\r\nsys.stdout.flush()\r\nx=int(input())\r\na=[]\r\na.append(((w[0]+x+w[1])//2)-x)\r\nfor i in range (n-1):\r\n a.append(w[i]-a[0])\r\nprint ('!', a)\r\n \r\n", "t=1\r\nwhile t>0:\r\n t-=1\r\n n=int(input())\r\n a=[0]5005\r\n sum=[0]5005\r\n if n%2==1:\r\n for i in range(n-1):\r\n print('?',end=' ')\r\n print(i+1,end=' ')\r\n print(i+2,end=' ')\r\n x=int(input())\r\n sum[i+1]=x\r\n print('?',end=' ')\r\n print(1,end=' ')\r\n print(n)\r\n x=int(input())\r\n sum[n]=x\r\n num=0\r\n for i in range(1,n+1):\r\n num+=sum[i]\r\n num//=2\r\n for i in range(1,n,2):\r\n num-=sum[i]\r\n a[n]=num\r\n for i in range(n-1,0,-1):\r\n a[i]=sum[i]-a[i+1]\r\n print('!',end=' ')\r\n for i in range(1,n):\r\n print(a[i],end=' ')\r\n print(a[n])\r\n else:\r\n n-=1\r\n for i in range(n-1):\r\n print('?',end=' ')\r\n print(i+1,end=' ')\r\n print(i+2)\r\n x=int(input())\r\n sum[i+1]=x\r\n print('?',end=' ')\r\n print(1,end=' ')\r\n print(n)\r\n x=int(input())\r\n sum[n]=x\r\n num=0\r\n for i in range(1,n+1):\r\n num+=sum[i]\r\n num//=2\r\n for i in range(1,n,2):\r\n num-=sum[i]\r\n a[n]=num\r\n for i in range(n-1,0,-1):\r\n a[i]=sum[i]-a[i+1]\r\n print('?',end=' ')\r\n print(1,end=' ')\r\n print(n+1)\r\n x=int(input())\r\n sum[n+1]=x\r\n a[n+1]=sum[n+1]-a[1]\r\n print('!',end=' ')\r\n for i in range(1,n+1):\r\n print(a[i],end=' ')\r\n print(a[n+1])", "n = int(input())\n\nsaida = n['']\n\nprint(\"? 1 2\")\num_dois = int(input())\n\nprint(\"? 2 3\")\ndois_tres = int(input())\n\nprint(\"? 3 1\")\ntres_um = int(input())\n\num = (tres_um - dois_tres + um_dois) // 2\nsaida[0] = str(um)\nsaida[1] = str(um_dois - um)\nsaida[2] = str(tres_um - um)\n\nfor i in range(4, n + 1):\n\tprint(f\"? {i} 1\")\n\tsaida[i -1] = str(int(input()) - um)\n\nprint(f\"! {' '.join(saida)}\")\n\n \t \t\t \t\t\t\t\t \t\t\t \t \t\t \t\t", "\nn = int(input())\n\nprint(\"? 1 2\")\nr1 = int(input())\nprint(\"? 2 3\")\nr2 = int(input())\nprint(\"? 1 3\")\nr3 = int(input())\nn1 = int((r1-r2+r3)/2)\na = [0 for i in range(n)]\na[0] = n1\na[1] = r1-n1\na[2] = r3-n1\n\nfor i in range(3,n):\n print(f\"? 1 {i+1}\")\n a[i]= int(input()) - n1 \n\nprint(\"!\",end=' ')\nprint(a,sep=' ')\n\n\n \t\t\t \t \t \t \t \t\t \t \t \t\t", "import heapq,math\r\nfrom collections import defaultdict,deque\r\nfrom os import getcwd\r\nfrom itertools import permutations\r\n#from functools import cmp_to_key\r\n\r\nimport sys, os.path\r\n#sys.setrecursionlimit(10000000)\r\n\r\nif(os.path.exists('C:/Users/Dhanush/Desktop/cp/input.txt')):\r\n sys.stdout = open('C:/Users/Dhanush/Desktop/cp/output.txt', 'w')\r\n sys.stdin = open('C:/Users/Dhanush/Desktop/cp/input.txt', 'r')\r\n\r\n#input=sys.stdin.readline\r\ndef query(i,j):\r\n print('?',i,j)\r\n sys.stdout.flush()\r\n return int(input())\r\n\r\nn=int(input())\r\ns1=query(1,2)\r\ns2=query(2,3)\r\ns3=query(1,3)\r\nc=(s2+s3-s1)//2\r\nb=s2-c\r\na=s1-b\r\nres=[a,b,c]\r\nfor i in range(4,n+1):\r\n s=query(i-1,i)\r\n res.append(s-c)\r\n c=s-c\r\nprint('!',res)\r\nsys.stdout.flush()", "n = int(input())\n\nprint(\"? 1 2\",flush=True)\nx = int(input())\nprint(\"? 2 3\",flush=True)\ny = int(input())\nprint(\"? 1 3\",flush=True)\nz = int(input())\n\nd = (x+y+z)//2\nans = []\nans.append(d-y)\nans.append(d-z)\nans.append(d-x)\nfor i in range(4,n+1):\n\tprint(\"? 1 {}\".format(i),flush=True)\n\ttemp = int(input())\n\tans.append(temp-ans[0])\n\t\nfinal = \"!\"\nfor i in ans:\n\tfinal += (\" \"+str(i))\nprint(final,flush=True)", "from sys import stdout\nn = int(input())\nc = []\nprint('? 1 2')\nstdout.flush()\nc.append(int(input()))\nprint('? 1 3')\nstdout.flush()\nc.append(int(input()))\nprint('? 2 3')\nstdout.flush()\nc.append(int(input()))\nt = (c[0]+c[1]-c[2])//2\na = [0,t,c[0]-t,c[1]-t]\nfor i in range(4,n+1):\n print('? 1 %d' % i)\n a.append(int(input())-a[1])\nprint('!',end=' ')\nprint(a[1:])\n", "import sys\r\n\r\nn=int(input())\r\nprint('?',1,2)\r\nsys.stdout.flush()\r\ns1=int(input())\r\nprint('?',2,3)\r\nsys.stdout.flush()\r\ns2=int(input())\r\nprint('?',3,1)\r\nsys.stdout.flush()\r\ns3=int(input())\r\na=[0]n\r\na[0]=(s1-s2+s3)//2\r\na[1]=s1-a[0]\r\na[2]=s3-a[0]\r\nfor i in range(3,n):\r\n print('?',1,i+1)\r\n sys.stdout.flush()\r\n s1=int(input())\r\n a[i]=s1-a[0]\r\nprint('!',a)", "\r\n\r\n\r\n\r\n\r\n\r\nn = int(input().rstrip())\r\n\r\nprint('? 1 2')\r\nab = int(input().rstrip())\r\nprint('? 1 3')\r\nac = int(input().rstrip())\r\nprint('? 2 3')\r\nbc = int(input().rstrip())\r\n\r\na = (ac + ab - bc)//2\r\nb = ab - a\r\nc = ac - a\r\narr = [a, b, c]\r\n\r\nfor i in range(4,n+1):\r\n print(f'? 1 {i}')\r\n num = int(input().rstrip()) - a\r\n arr.append(num)\r\nprint('! ' + ' '.join(map(str,arr)))", "import sys\n\ndef guess():\n n = int(input())\n array = [0]n\n sums = [0, 0, 0] # con los 3 primeros tendremos el resto.\n\n for i in range(3):\n if i == 0:\n index_1, index_2 = 1,2\n elif i == 1:\n index_1, index_2 = 2,3\n else:\n index_1, index_2 = 1,3\n\n print(f\"? {index_1} {index_2}\")\n sys.stdout.flush()\n res = int(input())\n sums[i] = res\n\n array[0] = (sums[0] + sums[2] - sums[1]) // 2\n array[2] = sums[2] - array[0]\n array[1] = sums[1] - array[2]\n\n for i in range(3, n):\n print(f\"? {i} {i + 1}\")\n sys.stdout.flush()\n res = int(input())\n array[i] = res - array[i - 1]\n print(f\"! {' '.join(map(str, array))}\")\n\nguess()\n\t \t \t \t \t\t\t \t \t \t\t\t\t\t \t\t \t\t", "n = int(input())\n\narr = [0] n\n \ns1 = int(input('? 1 2 \\n'))\ns2 = int(input('? 2 3 \\n'))\ns3 = int(input('? 1 3 \\n'))\n \narr[0] = (s1 + s3 - s2) // 2\narr[1] = s1 - arr[0]\narr[2] = s3 - arr[0]\n \nfor i in range(3, n):\n print('? 1', i + 1)\n arr[i] = int(input()) - arr[0]\n \nprint('!', arr)\n\t \t\t \t \t\t\t\t\t \t\t\t \t \t\t", "import os,sys\r\nfrom io import BytesIO, IOBase\r\n\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\n\r\nl=['a','e','i','o','u','y','A','E','O','I','U','Y']\r\n\r\nn=ii()\r\nl=[]\r\nprint(\"?\",1,2)\r\nsys.stdout.flush()\r\na=ii()\r\nprint(\"?\",1,3)\r\nsys.stdout.flush()\r\nb=ii()\r\nprint(\"?\",2,3)\r\nsys.stdout.flush()\r\nc=ii()\r\ne=(c+(a-b))//2 \r\nd=(b+(a-c))//2 \r\nf=(b+(c-a))//2 \r\nl.append(d)\r\nl.append(e)\r\nl.append(f)\r\nfor i in range(4,n+1):\r\n print(\"?\",1,i)\r\n sys.stdout.flush()\r\n g=ii()\r\n l.append(g-l[0])\r\nprint(\"!\",l)", "n=int(input())\r\nprint(\"?\",1,2)\r\na=int(input())\r\nprint(\"?\",2,3)\r\nb=int(input())\r\nprint(\"?\",1,3)\r\nc=int(input())\r\nL=[0]n\r\nL[0]=(a+c-b)//2\r\nL[1]=a-L[0]\r\nL[2]=b-L[1]\r\nfor i in range(3,n):\r\n print(\"?\",i+1,1)\r\n q=int(input())\r\n L[i]=q-L[0]\r\nprint(\"!\",L)", "import sys\n\nn = int(input())\n\ndef print_flush(txt):\n print(txt)\n sys.stdout.flush()\n\nb = [0] * (n+1) # Index 1 is INDEX 1\n\nfor i in range(2, n+1):\n index1 = 1\n index2 = i\n\n print_flush(f\"? {index1} {index2}\")\n b[i-1] = int(input())\n\nprint_flush (f\"? {n-1} {n}\")\n\nb[n] = int(input())\n\n# Solving Ax = b, yielded the following pattern\n\nx = [0] * (n+1) # index i is INDEX i\n\nx_a = ( b[n-2] + b[n-1] - b[n]) // 2\nx_y = ( b[n-2] - b[n-1] + b[n]) // 2 \nx_z = (-b[n-2] + b[n-1] + b[n]) // 2\n\nfor i in range(2, n-1):\n x[i] = (2b[i-1] - b[n-2] - b[n-1] + b[n]) // 2\n\nx[1] = x_a\nx[n-1] = x_y\nx[n] = x_z\n\n\nprintable = \" \".join([str(d) for d in x[1:]])\nprint_flush(f\"! {printable}\")\n\t\t\t\t\t \t\t\t \t \t \t \t\t\t\t \t\t\t \t", "import sys\r\nn=int(input())\r\narr=[]\r\nprint(\"?\",1,2)\r\narr.append(int(input()))\r\nsys.stdout.flush()\r\nprint(\"?\",2,3)\r\narr.append(int(input()))\r\nsys.stdout.flush()\r\nprint(\"?\",1,3)\r\narr.append(int(input()))\r\nsys.stdout.flush()\r\nfor i in range(3,n):\r\n print(\"?\",i,i+1)\r\n arr.append(int(input()))\r\n sys.stdout.flush()\r\nx=(arr[0]-arr[1]+arr[2])//2\r\ny=(arr[1]-arr[2]+arr[0])//2\r\nz=(arr[1]-arr[0]+arr[2])//2\r\nprint(\"!\",x,y,z,end=\" \")\r\nfor i in range(3,n):\r\n print(arr[i]-z,end=\" \")\r\n z=arr[i]-z\r\n", "n = int(input())\nprint(\"? 1 2\",flush=True)\nx = int(input())\nprint(\"? 2 3\",flush=True)\ny = int(input())\nprint(\"? 1 3\",flush=True)\nz = int(input())\na = (x - y + z) // 2\nb = (y - z + x) // 2\nc = (y + z - x) // 2\nA = f\"! {a} {b} {c}\"\nfor i in range(4,n+1):\n print(f\"? 1 {i}\",flush=True)\n s = int(input())\n A += f\" {s-a}\"\nprint(A)\n \t \t\t \t\t \t\t\t \t\t\t \t\t\t \t \t", "import sys\r\nn=int(input())\r\nl=[0 for i in range(n)]\r\nfor i in range(1,n):\r\n print(\"? 1\",i+1)\r\n sys.stdout.flush()\r\n l[i]=int(input())\r\nprint(\"? 2 3\")\r\nsys.stdout.flush()\r\na=int(input())\r\nt=(a+l[1]+l[2])//2\r\nl[0]=t-a\r\nprint(\"!\",l[0],end=\" \")\r\nsys.stdout.flush()\r\nfor i in range(1,n):\r\n print(l[i]-l[0],end=\" \")\r\n sys.stdout.flush()", "n=int(input())\r\nd=[]\r\nprint(\"?\",1,2,flush=1)\r\na=int(input())\r\nprint(\"?\",1,3, flush=1)\r\nb=int(input())\r\nprint(\"?\",2,3,flush=1)\r\nc=int(input())\r\nd.extend([(a+b-c)//2,(a-b+c)//2,(c-a+b)//2])\r\nfor i in range(3,n):\r\n print(\"?\",i,i+1,flush=1)\r\n x=int(input())\r\n d.append(x-d[-1])\r\nprint(\"!\",d,flush=1)", "def 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\nn = inp()\r\n\r\nprint(\"? 1 2\")\r\nx1 = inp()\r\n\r\nprint(\"? 2 3\")\r\nx2 = inp()\r\n\r\nprint(\"? 1 3\")\r\nx3 = inp()\r\n\r\nfirst = (x1 + x2 + x3) // 2 - x2\r\nans = list()\r\nans.append(first)\r\nans.append(x1 - first)\r\nans.append(x3 - first)\r\nfor i in range(4, n + 1):\r\n print(\"? 1 \" + str(i))\r\n ans.append(inp() - first)\r\nprint(\"! \" + (\" \".join(map(str, ans))))\r\n", "from collections import Counter\r\nimport string\r\nimport bisect\r\n#import random\r\nimport math\r\nimport sys\r\n# sys.setrecursionlimit(10*6) \r\nfrom fractions import Fraction\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(arrber_of_variables):\r\n if arrber_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if arrber_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\ntestcases=1\r\nfor _ in range(testcases):\r\n n=vary(1)\r\n # solving three equations a1,a2,a3\r\n # a1+a2=x,a2+a3=y,a1+a3=z\r\n # a1=(x-y+z)//2,a2=(x+y-z)//2,a3=(z-x+y)//2\r\n ans=[]\r\n print('?',1,2,flush=True)\r\n x=vary(1)\r\n print('?',2,3,flush=True)\r\n y=vary(1)\r\n print('?',1,3,flush=True)\r\n z=vary(1)\r\n ans.extend(((x-y+z)//2,(x+y-z)//2,(z-x+y)//2))\r\n for i in range(3,n):\r\n print('?',i,i+1,flush=True)\r\n value=vary(1)\r\n ans.append(value-ans[-1])\r\n print('!',ans)\r\n \r\n", "n = int(input())\nans = []\n\nprint(\"?\",1,2)\nq1 = int(input())\nprint(\"?\",1,3)\nq2 = int(input())\nprint(\"?\",2,3)\nq3 = int(input())\nd2 = q1 - q2\na3 = (q3 - d2)//2\na2 = a3 + d2\na1 = q1 - a2\n\nans += [a1,a2,a3]\nfor i in range(4,n+1):\n print(\"?\", 1, i)\n qi = int(input())\n ai = qi - a1\n ans.append(ai)\n\nprint(\"!\",ans, sep=\" \")\n\t \t\t \t \t\t \t\t\t\t \t\t \t\t\t \t \t", "import sys\n \nn = int(input())\n \nprint('? 1 2')\nsys.stdout.flush()\nv1 = int(input())\n \nprint('? 1 3')\nsys.stdout.flush()\nv3 = int(input())\n \nprint('? 2 3')\nsys.stdout.flush()\nv2 = int(input())\n \na3 = (v3 - v1 + v2) // 2\na2 = v2 - a3\na1 = v1 - a2\n \nanswer = [a1, a2, a3] \nfor i in range(4, n+1):\n print('? 1 %d' % i)\n sys.stdout.flush()\n \n x = int(input())\n \n answer.append(int(x - a1))\n \nprint('! ', end='')\nprint(answer)\n \t\t \t\t \t\t \t \t\t\t \t \t \t \t \t\t \t", "n = int(input())\r\n\r\nresult = [0](n+3)\r\n\r\nprint(\"? {} {}\".format(1, 2))\r\nprint()\r\na = int(input())\r\nprint(\"? {} {}\".format(1, 3))\r\nprint()\r\nb = int(input())\r\nprint(\"? {} {}\".format(2, 3))\r\nprint()\r\nc = int(input())\r\n\r\nresult[1] = (a + b - c) // 2\r\nresult[2] = a - result[1]\r\nresult[3] = b - result[1]\r\n\r\nfor i in range(4, n+1):\r\n print(\"? {} {}\".format(i-1, i))\r\n print()\r\n result[i] = int(input()) - result[i-1]\r\n\r\nprint(\"!\", end=' ')\r\n\r\nfor i in range(1, n+1):\r\n print(result[i], end=' ')\r\n", "n = int(input())\r\nprint('? 1 2')\r\nx = int(input())\r\nprint('? 2 3')\r\ny = int(input())\r\nprint('? 1 3')\r\nz = int(input())\r\nb = (x + y - z) // 2\r\na = [x - b, b, y - b]\r\nfor i in range(3, n):\r\n print(f'? {i} {i + 1}')\r\n a.append(int(input()) - a[-1])\r\nprint('!', a)", "n = int(input())\nans = [0] * n\nprint('? 1 2')\na = int(input())\nprint('? 2 3')\nb = int(input())\nprint('? 1 3')\nc = int(input())\nans[0] = (a + c - b) // 2\nans[1] = a - ans[0]\nans[2] = b - ans[1]\nfor i in range(3, n):\n print('?', i + 1, i)\n a = int(input())\n ans[i] = a - ans[i - 1]\nprint('!', ' '.join(map(str, ans)))\n\t\t \t\t\t\t\t \t\t \t \t\t\t \t \t\t", "ls = []\r\nn = int(input())\r\nprint('? 1 2')\r\nn1 = int(input())\r\nprint('? 1 3')\r\nn2 = int(input())\r\nprint('? 2 3')\r\nn3 = int(input())\r\na = (n1 + n2 - n3)/2\r\nls.append(a)\r\nls.append(n1-a)\r\nls.append(n2-a)\r\nfor i in range(3,n):\r\n print('? 1 ' + str(i+1))\r\n nall = int(input())\r\n ls.append(nall-a)\r\n\r\nout = '! '\r\nfor x in ls:\r\n out += str(int(x)) + ' '\r\nprint(out[:-1])\r\n", "n = int(input())\nl = list(map(int, map(input, (\"? 2 3\\n\", \"? 1 3\\n\", \"? 1 2\\n\"))))\nl = [(l[i - 1] + l[i - 2] - l[i]) // 2 for i in (0, 1, 2)]\na, f = l[0], \"? 1 {}\\n\".format\nfor i in range(4, n + 1):\n l.append(int(input(f(i))) - a)\nprint(\"!\", \" \".join(map(str, l)))\n \t \t\t\t\t \t \t\t\t\t\t \t\t\t\t\t\t \t\t", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nn = int(input())\n\nans = [0]3\n\nprint(\"?\",1,2)\nx = int(input())\n\nprint(\"?\",1,3)\ny = int(input())\n\nprint(\"?\",2,3)\nz = int(input())\n\nans[1]=((x+z)-y)//2\nans[0]=x-ans[1]\nans[2]=y-ans[0]\n\nfor i in range(4,n+1):\n print('?',i-1,i)\n x = int(input())\n ans.append(x-ans[i-2])\nprint('! ' + ' '.join(map(str,ans)))", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nn = int(input())\n\nr = [0]3\n\nprint(\"?\",1,2)\nx = int(input())\n\nprint(\"?\",1,3)\ny = int(input())\n\nprint(\"?\",2,3)\nz = int(input())\n\nr[1]=((x+z)-y)//2\nr[0]=x-r[1]\nr[2]=y-r[0]\n\nfor i in range(4,n+1):\n print('?',i-1,i)\n x = int(input())\n r.append(x-r[i-2])\nprint('! ' + ' '.join(map(str,r)))\n \t\t \t \t\t\t \t\t\t \t\t\t \t\t \t\t \t \t \t", "\nimport sys\n \nn = int(input())\nlul = [0 for i in range(n)]\nprint('?', 1, 2)\nsys.stdout.flush()\na = int(input())\nprint('?', 2, 3)\nsys.stdout.flush()\nb = int(input())\nprint('?', 1, 3)\nsys.stdout.flush()\nc = int(input())\nlul[0] = (a + c - b) // 2\nlul[1] = a - lul[0]\nlul[2] = c - lul[0]\nfor i in range(4, n + 1):\n print('?', 1, i)\n sys.stdout.flush()\n k = int(input())\n lul[i - 1] = k - lul[0]\nprint('!', end=' ')\nprint(lul)\nsys.stdout.flush()\n \t\t\t\t \t \t\t\t\t\t \t\t \t\t \t\t\t \t", "saida = ['!']\n\nn = int(input())\na = int(input('? 1 2\\n'))\nb = int(input('? 2 3\\n'))\nc = int(input('? 1 3\\n'))\n\nf = (a - b + c) / 2\ns = a - f\nt = c - f\n\nsaida.append(int(f))\nsaida.append(int(s))\nsaida.append(int(t))\n\nfor i in range(4, n + 1):\n sum = int(input(f'? 1 {i}\\n'))\n saida.append(int(sum - f))\n\nprint(saida)\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\narr = []\r\nfor i in range(2,n+1):\r\n print(f\"? 1 {i}\")\r\n arr.append(int(input()))\r\nprint(\"? 2 3\")\r\nones = (arr[0] + arr[1] - int(input()))//2\r\nprint(f\"! {ones} {' '.join(str(a - ones) for a in arr)}\")\r\n", "# author: ankan2526\r\n\r\nimport math, bisect, heapq\r\n\r\nn=int(input())\r\nprint('?',1,2,flush=True)\r\nx=int(input())\r\nprint('?',2,3,flush=True)\r\ny=int(input())\r\nprint('?',1,3,flush=True)\r\nz=int(input())\r\n\r\na=[]\r\na.append((x-y+z)//2)\r\na.append(x-a[0])\r\na.append(z-a[0])\r\nfor i in range(4,n+1):\r\n print('?',1,i,flush=True)\r\n x=int(input())\r\n a.append(x-a[0])\r\nprint('!',a,flush=True)\r\n", "from sys import stdout\n\ndef query(i,j):\n print('?',i+1,j+1)\n stdout.flush()\n return int(input())\n\nn = int(input())\narr = []\nfor i in range(1,n):\n arr.append(query(0,i))\n\ng = query(1,2)\nf = arr[1] - arr[0]\nth = (g+f)//2\nini = arr[1]-th\nans = [ini]\nfor i in range(1,n):\n ans.append(arr[i-1]-ini)\n\nprint('!',ans)\nstdout.flush()\n", "def ask(i, j):\n print(f'? {i} {j}',flush=True)\n res = int(input())\n return res\n\nn = int(input())\n\na = ask(1,2)\nb = ask(1,3)\nc = ask(2,3)\n\nx = (a + b - c) // 2\ny = a - x\nz = b - x\nresp = f'{x} {y} {z}'\nfor i in range(4,n+1):\n resp += \" \" + str(ask(1,i) - x)\n\nprint(\"! \" + resp, flush=True)\n \t\t\t\t \t \t \t\t \t\t\t \t \t \t \t\t \t", "def gera_array():\n for i in range(4, n + 1):\n print(\"? \" + \"1 \" + str(i))\n num = int(input())\n lista.append(num - num1)\n\n\nn = int(input())\nprint(\"? 1 2\")\na = int(input())\nprint(\"? 1 3\")\nb = int(input())\nprint(\"? 2 3\")\nc = int(input())\n\nnum1 = int((a + b - c) // 2)\nnum2 = a - num1\nnum3 = b - num1\nlista = [num1, num2, num3]\n\ngera_array()\n\nprint(\"! \", end='')\nprint(lista)\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\nanswer = []\r\nprint('? 1 2')\r\ns12 = int(input())\r\nprint('? 2 3')\r\ns23 = int(input())\r\nprint('? 3 1')\r\ns31 = int(input())\r\nanswer = [(s12+s31-s23)//2, (s12-s31+s23)//2, (-s12+s31+s23)//2]\r\nfor i in range(4, n+1):\r\n print('? 1', i)\r\n s = int(input())\r\n answer.append(s-answer[0])\r\nprint('!', answer)", "import sys\r\n\r\nn = int(input())\r\na = [0 for i in range(n)]\r\n\r\nprint(\"?\", 1, 2)\r\nsys.stdout.flush()\r\nfirst = int(input())\r\nprint(\"?\", 1, 3)\r\nsys.stdout.flush()\r\nsecond = int(input())\r\ndiff = second-first\r\nprint(\"?\", 2, 3)\r\nsys.stdout.flush()\r\nthird = int(input())\r\nthird += diff\r\na[1] += third//2 - diff\r\na[2] += third//2\r\na[0] += first-a[1]\r\nfor i in range(3, n):\r\n print(\"?\", i, i+1)\r\n sys.stdout.flush()\r\n m = int(input())\r\n a[i] = m-a[i-1]\r\nprint(\"!\", a)\r\nsys.stdout.flush()\r\n\r\n", "import sys\r\n\r\nn = int(input())\r\n\r\nsums = []\r\nfinal = [-1] n\r\n\r\n# a1 + a2 = r1\r\nprint('?', 1, 2)\r\nsys.stdout.flush()\r\nsums.append(int(input()))\r\n\r\n# a1 + a3 = r2\r\nprint('?', 1, 3)\r\nsys.stdout.flush()\r\nsums.append(int(input()))\r\n\r\n# a2 + a3 = r3\r\nprint('?', 2, 3)\r\nsys.stdout.flush()\r\nsums.append(int(input()))\r\n\r\n# a3 = (r3 - r1 + r2) / 2\r\nfinal[2] = (sums[2] - sums[0] + sums[1]) / 2\r\n\r\n# a2 = a3 + r1 - r2\r\nfinal[1] = (final[2] + sums[0] - sums[1])\r\n\r\n# a1 = r1 - a2\r\nfinal[0] = (sums[0] - final[1])\r\n\r\n# para o restante, perguntar\r\nfor i in range(3, n):\r\n print('?', 1, i + 1)\r\n sys.stdout.flush()\r\n res = int(input())\r\n\r\n final[i] = res - final[0]\r\n\r\nprint('!', ' '.join(map(str, map(int, final))))\r\n", "import sys\r\nn=int(input())\r\nprint('? 1 2')\r\nsys.stdout.flush()\r\nx=int(input())\r\nprint('? 1 3')\r\nsys.stdout.flush()\r\ny=int(input())\r\nprint('? 2 3')\r\nsys.stdout.flush()\r\nz=int(input())\r\ns=(x+y+z)//2\r\na=[0]n\r\na[0]=s-z\r\na[1]=s-y\r\na[2]=s-x\r\nfor i in range(4,n+1):\r\n print('? 1',i)\r\n sys.stdout.flush()\r\n x=int(input())\r\n a[i-1]=x-a[0]\r\nprint('!',end=' ')\r\nfor z in(a):\r\n print(z,end=' ')", "def ask(i, j):\r\n print(f'? {i} {j}',flush=True)\r\n res = int(input())\r\n return res\r\n\r\nn = int(input())\r\n\r\na = ask(1,2)\r\nb = ask(1,3)\r\nc = ask(2,3)\r\n\r\nx = (a + b - c) // 2\r\ny = a - x\r\nz = b - x\r\nresp = f'{x} {y} {z}'\r\nfor i in range(4,n+1):\r\n resp += \" \" + str(ask(1,i) - x)\r\n\r\nprint(\"! \" + resp, flush=True)", "n = int(input())\r\na = [0] (n + 1)\r\nx, y, z = 0, 0, 0\r\n\r\nprint(\"? 1 2\")\r\nx = int(input())\r\nprint(\"? 1 3\")\r\ny = int(input())\r\nprint(\"? 2 3\")\r\nz = int(input())\r\n\r\na[1] = (x + y - z) // 2\r\na[2] = (x - y + z) // 2\r\na[3] = (-x + y + z) // 2\r\n\r\nfor p in range(4, n + 1):\r\n print(f\"? 1 {p}\")\r\n u = int(input())\r\n a[p] = u - a[1]\r\n\r\nprint(\"!\", end=\" \")\r\nfor p in range(1, n + 1):\r\n print(a[p], end=\" \")\r\nprint()", "import sys\r\nimport itertools\r\n\r\nn=int(input())\r\n\r\nprint(\"?\",1,2)\r\nsys.stdout.flush()\r\nab=int(input())\r\nprint(\"?\",2,3)\r\nsys.stdout.flush()\r\nbc=int(input())\r\nprint(\"?\",1,3)\r\nsys.stdout.flush()\r\nac=int(input())\r\n\r\nb=(ab+bc-ac)//2\r\na=ab-b\r\nc=ac-a\r\n\r\narr=[a,b,c]\r\n\r\nfor i in range(n-3):\r\n print(\"?\",i+3,i+4)\r\n q=int(input())\r\n arr.append(q-arr[-1])\r\n sys.stdout.flush()\r\n\r\nprint(\"!\",end=\" \")\r\nfor i in arr:\r\n print(i,end=\" \")\r\n sys.stdout.flush()\r\n\r\n", "import sys\r\n\r\nn = int(input())\r\nans = [-1]n\r\nprint('? 1 2')\r\nsys.stdout.flush()\r\nx = int(input())\r\nprint('? 2 3')\r\nsys.stdout.flush()\r\ny = int(input())\r\nprint('? 1 3')\r\nsys.stdout.flush()\r\nz = int(input())\r\nans[0] = (x-y+z)//2\r\nans[1] = x-ans[0]\r\nans[2] = z-ans[0]\r\n\r\nfor i in range(3, n):\r\n print('? 1 '+str(i+1))\r\n sys.stdout.flush()\r\n ans[i] = int(input())-ans[0]\r\n \r\nprint('! '+' '.join(map(str, ans)))\r\nsys.stdout.flush()", "\nn = int(input())\narray = list(range(n+1))\n\nprint(f\"? 1 2\")\nsum12 = int(input())\n\nprint(f\"? 1 3\")\nsum13 = int(input())\n\nprint(f\"? 2 3\")\nsum23 = int(input())\n\nx = (sum12 + sum13 - sum23) // 2\n\narray[1] = x\narray[2] = sum12 - array[1]\narray[3] = sum13 - array[1]\n\n\nfor i in range(4, n+1):\n print(f\"? 1 {i}\")\n sum1i = int(input())\n array[i] = sum1i - array[1]\nprint(f\"! {' '.join(map(str,array[1:]))}\")\n\n\n\n\n", "n = int(input())\n\nprint('? 1 2')\nA = int(input())\nprint('? 1 3')\nB = int(input())\nprint('? 2 3')\nC = int(input())\n\nresult = []\n\nA1 = (A + B - C)//2\nA2 = (A + C - B)//2\nA3 = (B+C-A)//2\n\nresult = [str(A1), str(A2), str(A3)]\n\nif n > 3:\n for i in range(4, n+1):\n print('? 1 {}'.format(i))\n num = int(input())\n result.append(str(num - A1))\n\nprint('! {}'.format(' '.join(result)))\n", "import sys\r\n\r\n\r\ndef perguntas(i, j):\r\n print(f\"? {i} {j}\")\r\n sys.stdout.flush()\r\n valor = int(input())\r\n return valor\r\n\r\n\r\nn = int(input())\r\nlista_num = []\r\nprint(f\"? {1} {2}\")\r\nsys.stdout.flush()\r\nx = int(input())\r\nprint(f\"? {1} {3}\")\r\nsys.stdout.flush()\r\ny = int(input())\r\nprint(f\"? {2} {3}\")\r\nsys.stdout.flush()\r\nz = int(input())\r\n\r\nlista_num.append((x + y - z) // 2)\r\nlista_num.append((x - y + z) // 2)\r\nlista_num.append((-x + y + z) // 2)\r\n\r\nfor i in range(4, n + 1):\r\n num = perguntas(1, i)\r\n lista_num.append(num - lista_num[0])\r\n\r\nprint(\"!\", lista_num, sep=\" \")\r\n\r\n# ! 2 7 3 5 2 2 6 3 8 3\r\n# ! 2 7 3 5 2 2 6 3 8 3\r\n", "#from sys import stdout\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n array = [0 for _ in range(n+1)]\r\n print('?', 1, 2, flush=True)\r\n first_plus_second = int(input())\r\n print('?', 1, 3, flush=True)\r\n first_plus_third = int(input())\r\n print('?', 2, 3, flush=True)\r\n second_plus_third = int(input())\r\n\r\n array[2] = (first_plus_second - first_plus_third + second_plus_third) // 2\r\n array[1] = first_plus_second - array[2]\r\n array[3] = second_plus_third - array[2]\r\n\r\n for i in range(4, n+1):\r\n print('?', 1, i, flush=True)\r\n array[i] = int(input()) - array[1]\r\n\r\n print('!', array[1:], flush=True)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\na, b, c = [int(input('? ' + q + '\\n')) for q in ('1 2', '1 3', '2 3')]\r\nq = a + b - c >> 1\r\nt = [q, a - q, b - q]\r\nfor i in range(3, n): t += [int(input('? 1 ' + str(i + 1) + '\\n')) - q]\r\nprint('!', t)", "import sys\r\n\r\nA = []\r\nn = int(input())\r\nprint(\"? 1 2\")\r\nsys.stdout.flush()\r\nr1 = int(input())\r\nprint(\"? 1 3\")\r\nsys.stdout.flush()\r\nr2 = int(input())\r\nprint(\"? 2 3\")\r\nsys.stdout.flush()\r\nr3 = int(input())\r\nA.append(str((r1 + r2 - r3)//2))\r\nA.append(str(r1 - int(A[0])))\r\nA.append(str(r2 - int(A[0])))\r\nfor i in range(3, n):\r\n print(\"? 1\", i + 1)\r\n sys.stdout.flush()\r\n A.append(str(int(input()) - int(A[0])))\r\ns = \" \".join(A)\r\nprint(\"!\", s)\r\n \t \t \t \t\t\t\t \t \t \t\t \t\t \t \t", "n = int(input())\n\narr = [0]n\n\nprint(\"? 1 2\",flush=True)\na = int(input())\nprint(\"? 1 3\",flush=True)\nb = int(input())\nprint(\"? 2 3\",flush=True)\nc = int(input())\nsum = (a + b + c)//2\narr[0] = sum-c\narr[1] = sum-b\narr[2] = sum-a\n\nfor i in range(3,n):\n print(\"? 1 {}\".format(i+1))\n arr[i] = int(input()) - arr[0]\n\nprint(\"!\",end=\" \",flush=True)\nfor i in range(n):\n print(arr[i], end=\" \",flush=True)\n", "from sys import stdout\nn = int(input())\nnums = []\n\nfor i in range(2, n + 1):\n num = f'? 1 {i}'\n print(num)\n stdout.flush()\n ans = input()\n nums.append(int(ans))\n\nnum = f'? 2 3'\nprint(num)\nstdout.flush()\nans = input()\n\na1 = ((nums[0] + nums[1])-int(ans))/2\n\nwea = f'! {int(a1)}'\nfor i in range(n-1):\n nums[i] = nums[i] - a1\n wea += f' {int(nums[i])}'\n\n\nprint(wea)\n \t \t \t\t \t\t \t \t\t\t\t \t\t\t\t \t\t\t\t", "import math\r\nimport time\r\nfrom collections import defaultdict,deque\r\nfrom sys import stdin,stdout\r\nfrom bisect import bisect_left,bisect_right,bisect\r\nn=int(input())\r\nans=[0](n)\r\npre=[0](n-1)\r\nfor i in range(2,n+1):\r\n print(\"? 1\",i,flush=True)\r\n pre[i-2]=int(input())\r\n\r\na=pre[0]\r\nb=pre[1]\r\nprint(\"? 2 3\",flush=True)\r\nc=int(input())\r\nfirst=(a+b-c)//2\r\nans[0]=first\r\nfor i in range(n-1):\r\n ans[i+1]=pre[i]-first\r\nprint(\"!\",ans)", "import sys\n\na = [0] * 5005\nn = 0\n\ndef ask(i, j):\n print(f\"? {i} {j}\", flush=True)\n return int(input())\n\ndef main():\n global n\n n = int(input())\n \n a1 = ask(1, 2)\n a2 = ask(2, 3)\n a3 = ask(1, 3)\n \n a[1] = (a1 + a2 + a3 - 2 * a2) // 2\n a[2] = (a1 + a2 + a3 - 2 * a3) // 2\n a[3] = (a1 + a2 + a3 - 2 * a1) // 2\n \n for i in range(4, n + 1):\n a1 = ask(1, i)\n a[i] = a1 - a[1]\n \n print('!', end='')\n \n for i in range(1, n + 1):\n print(f\" {a[i]}\", end='')\n \n print()\n sys.stdout.flush()\n\nif __name__ == \"__main__\":\n main()\n\n \t\t\t\t\t \t\t \t \t\t\t\t\t\t\t \t\t\t \t\t", "n = int(input())\npos1 = int(input('? 1 2\\n'))\npos2 = int(input('? 2 3\\n'))\npos3 = int(input('? 1 3\\n'))\n\nf = (pos1 - pos2 + pos3) // 2 \ns = pos1 - f\nt = pos3 - f\nresultado = ['!']\nresultado.append(str(f)) \nresultado.append(str(s))\nresultado.append(str(t))\n\nfor i in range(4, n + 1):\n print(f'? 1 {i}')\n soma = int(input())\n resultado.append(str(soma - f))\n\nprint(' '.join(resultado))\n \t\t\t \t \t\t\t\t \t \t\t \t \t \t\t\t\t", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\n\r\nprint(\"? 1 2\", flush=True)\r\nx = int(input())\r\nprint(\"? 2 3\", flush=True)\r\ny = int(input())\r\nprint(\"? 1 3\", flush=True)\r\nz = int(input())\r\n\r\nc = -(x - y - z) // 2\r\nb = y - c\r\na = z - c\r\nans = [a, b, c]\r\n\r\nfor i in range(4, n+1):\r\n print(\"?\", i-1, i, flush=True)\r\n q = int(input())\r\n ans.append(q - ans[-1])\r\n\r\nprint(\"!\", ans)", "n = int(input())\r\na = [0 for i in range(n)]\r\nprint(\"? 1 2\")\r\nx = int(input())\r\nprint(\"? 2 3\")\r\ny = int(input())\r\nprint(\"? 1 3\")\r\nz = int(input())\r\na[2] = (y + z - x) // 2\r\na[0] = (x + z - y) // 2\r\na[1] = (x + y - z) // 2\r\nfor i in range(3, n):\r\n print(\"? 1 \" + str(i + 1))\r\n x = int(input())\r\n a[i] = x - a[0]\r\nprint(\"! \", end='')\r\nfor i in range(n):\r\n print(a[i], end=' ')# 1691410527.781079", "n = int(input())\na = [0] n\n \nprint('? 1 2')\ns12 = int(input())\nprint('? 2 3')\ns23 = int(input())\nprint('? 1 3')\ns13 = int(input())\n \na[0] = (s12 + s13 - s23) // 2\na[1] = s12 - a[0]\na[2] = s13 - a[0]\n \nfor i in range(3, n):\n print('? 1', i + 1)\n a[i] = int(input()) - a[0]\n \nprint('! ' + ' '.join(map(str, a)))\n \t\t\t\t\t \t \t\t \t\t \t\t \t\t\t \t", "n = int(input())\r\nd = [0] * n\r\nprint('?', 1, 2)\r\na = int(input())\r\nprint('?', 2, 3)\r\nb = int(input())\r\nprint('?', 1, 3)\r\nc = int(input())\r\nx = (a+b+c)//2\r\nd[0] = x-b\r\nd[1] = x-c\r\nd[2] = x-a\r\nfor i in range(3, n):\r\n print('?', 1, i+1)\r\n x = int(input())\r\n d[i] = x-d[0]\r\n \r\nprint('!', d)", "in1 = int(input())\narr = []\n\ncount = 1\nprint(\"? 1 2\")\nx = int(input())\nprint(\"? 2 3\")\ny = int(input())\nprint(\"? 3 1\")\nz = int(input())\n\narr = []\narr.append(int((x+z-y)/2))\nFIRST = arr[0]\narr.append(x-FIRST)\narr.append(z-FIRST)\n\nfor x in range(in1-3):\n print(\"? 1 \" + str(x+4))\n y = int(input())\n arr.append(y - FIRST)\n \nanswer = \"!\"\nfor x in arr:\n answer += \" \" + str(x)\n \nprint(answer)\n \t\t\t \t\t\t\t\t \t\t\t\t\t \t \t \t \t\t \t", "n = int(input())\n\nprint(\"? 1 2\")\nc1 = int(input())\nprint(\"? 2 3\")\nc2 = int(input())\nprint(\"? 1 3\")\nc3 = int(input())\nn1 = int((c1-c2+c3)/2)\na = [0 for i in range(n)]\na[0] = n1\na[1] = c1-n1\na[2] = c3-n1\nfor i in range(3,n):\n print(f\"? 1 {i+1}\")\n a[i] = int(input())-n1\nprint(\"!\",end=' ')\nprint(a,sep= ' ')\n\t \t\t\t\t\t \t\t \t\t \t \t \t\t\t \t \t", "n = int(input())\r\nprint(\"? 1 2\",flush=\"\")\r\ns1 = int(input())\r\nprint(\"? 1 3\",flush=\"\")\r\ns2 = int(input())\r\nprint(\"? 2 3\",flush=\"\")\r\ns3 = int(input())\r\nx = int((s1-s3+s2)/2)\r\narr = [x,s1-x,s2-x]\r\nfor i in range(3,n):\r\n print(\"?\",1,i+1,flush=\"\")\r\n s = int(input())\r\n arr.append(s-arr[0])\r\nprint(\"!\", arr)", "n = int(input())\n\nprint(\"? 1 2\")\nv1_2 = int(input())\nprint(\"? 1 3\")\nv1_3 = int(input())\nprint(\"? 2 3\")\nv2_3 = int(input())\n\na = (v1_3 - v2_3 + v1_2)//2\n\nresp = [''] n \nresp[0] = str(a)\nresp[1] = str(v1_2 - a)\nresp[2] = str(v1_3 - a)\n\nfor c in range(4, n + 1):\n print(f\"? 1 {c}\")\n num = int(input())\n resp[c - 1] = str(num - a)\n\nprint(\"!\", end=' ')\nfor c in range(len(resp)):\n print(resp[c], end=' ')\n \n\t \t\t \t\t\t\t\t\t \t \t \t\t \t \t\t", "import sys\nflush = sys.stdout.flush\n\ndef leEntrada(a, b):\n print('?', a, b)\n flush()\n entrada = int(input())\n return entrada\n \ndef imprimeSaida(a):\n saida = ''\n for i in a:\n saida += str(i) + \" \"\n print('!', saida)\n flush()\n \ntamanho = int(input())\n\nlista = []\nentrada_a = leEntrada(1, 2)\nentrada_b = leEntrada(2, 3)\nentrada_c = leEntrada(1, 3)\n \naux1 = (entrada_a + entrada_c - entrada_b)//2\nlista.append(aux1)\nlista.append((entrada_a + entrada_b - entrada_c)//2)\nlista.append((entrada_b + entrada_c - entrada_a)//2)\n \nfor i in range(4, tamanho + 1):\n aux2 = leEntrada(1, i)\n lista.append(aux2 - aux1)\n\nimprimeSaida(lista)\n \t \t\t\t\t \t\t \t \t \t\t \t \t", "from sys import stdout\n\nn = int(input())\nlista = []\n\nprint(f\"? {1} {2}\")\nstdout.flush()\nx = int(input())\n\nprint(f\"? {1} {3}\")\nstdout.flush()\ny = int(input())\n\nprint(f\"? {2} {3}\")\nstdout.flush()\nz = int(input())\n\nlista.append((x + y - z) // 2)\nlista.append((x - y + z) // 2)\nlista.append((-x + y + z) // 2)\n\nfor i in range(4, n + 1):\n print(f\"? {1} {i}\")\n stdout.flush()\n num = int(input())\n lista.append(num - lista[0])\n\nprint(\"!\", lista, sep=\" \")\nstdout.flush()\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 = [0] n\r\nprint(\"? 1 2\")\r\na = int(input())\r\nprint(\"? 2 3\")\r\nb = int(input())\r\nprint(\"? 1 3\")\r\nc = int(input())\r\nans[0] = (a + b + c) // 2 - b\r\nans[1] = a - ans[0]\r\nans[2] = b - ans[1]\r\nfor i in range(3, n):\r\n print(f\"? {i} {i + 1}\")\r\n ans[i] = int(input()) - ans[i - 1]\r\nprint(\"!\", ans)\r\n\n# Mon Aug 22 2022 11:06:09 GMT+0000 (Coordinated Universal Time)\n", "def main():\r\n n = int(input())\r\n arr = [0 for _ in range(n+1)]\r\n print('?', 1, 2)\r\n s1 = int(input())\r\n print('?', 1, 3)\r\n s2 = int(input())\r\n print('?', 2, 3)\r\n s3 = int(input())\r\n\r\n arr[2] = (s1 - s2 + s3) // 2\r\n arr[1] = s1 - arr[2]\r\n arr[3] = s3 - arr[2]\r\n\r\n for i in range(4, n+1):\r\n print('?', 1, i)\r\n arr[i] = int(input()) - arr[1]\r\n\r\n print('!', arr[1:])\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\nkol=0\r\ni=0\r\nmass=[0,0,0]\r\na=sys.stdin.readline()\r\nn=int(a)\r\nsys.stdout.write('? 1 2'+'\\n')\r\nsys.stdout.flush()\r\na1=int(sys.stdin.readline())\r\nsys.stdout.write('? 2 3'+'\\n')\r\nsys.stdout.flush()\r\na2=int(sys.stdin.readline())\r\nsys.stdout.write('? 1 3'+'\\n')\r\nsys.stdout.flush()\r\na3=int(sys.stdin.readline())\r\nmass[0]=(a1+a2+a3)//2-a2\r\nmass[1]=(a1+a2+a3)//2-a3\r\nmass[2]=(a1+a2+a3)//2-a1\r\n\r\nfor i in range(3,n):\r\n sys.stdout.write('? 1 '+str(i+1)+'\\n')\r\n sys.stdout.flush()\r\n a=int(sys.stdin.readline())\r\n mass.append(a-mass[0])\r\ns=''\r\nfor i in mass:\r\n s+=' '+str(i)\r\nsys.stdout.write('!'+s+'\\n')\r\nsys.stdout.flush()\r\n \r\n", "n=int(input())\r\nanswer = []\r\ns12 = int(input('? 1 2\\n'))\r\ns23 = int(input('? 2 3\\n'))\r\ns31 = int(input('? 3 1\\n'))\r\nanswer = [(s12+s31-s23)//2, (s12-s31+s23)//2, (-s12+s31+s23)//2]\r\nfor i in range(4, n+1):\r\n s = int(input('? 1 {}\\n'.format(i)))\r\n answer.append(s-answer[0])\r\nprint('!', answer)", "n = int(input())\r\nA = []\r\nprint('? 1 2')\r\nx = int(input())\r\nprint('? 1 3')\r\ny = int(input())\r\nprint('? 2 3')\r\nz = int(input())\r\nch_3 = (y+z-x)//2\r\nch_2 = z - ch_3\r\nch_1 = x - ch_2\r\nA.append(ch_1)\r\nA.append(ch_2)\r\nA.append(ch_3)\r\nfor i in range (4, n+1, 1):\r\n print('? 1', i)\r\n a = int(input())\r\n b = a - ch_1\r\n A.append(b)\r\nprint('!', A)" ]	{"inputs": ["5\n4 6 1 5 5", "3\n1 1 1", "4\n100 1 100 1", "10\n9 5 10 7 4 4 8 5 10 5", "3\n1 1 1", "3\n100000 100000 100000", "3\n91906 50782 19777", "15\n5 10 10 7 7 6 4 6 8 10 8 4 10 9 4", "30\n2 3 3 4 3 2 4 4 4 3 3 2 4 2 3 4 4 2 4 3 4 2 2 4 3 3 4 4 4 4", "35\n4 2 2 2 4 4 3 2 4 2 2 4 2 2 3 2 3 4 4 2 3 2 2 4 3 3 3 3 4 2 3 2 2 2 3", "40\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3", "47\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3", "100\n76 92 53 18 65 98 100 65 93 72 100 44 70 62 78 61 89 89 80 32 88 64 67 27 46 30 75 14 78 94 8 86 41 9 68 38 76 29 69 44 23 23 14 24 97 14 7 98 45 80 55 71 58 35 41 100 60 54 64 85 56 98 87 93 40 62 92 6 7 27 88 85 10 94 25 43 99 65 82 65 39 34 17 100 49 27 4 15 84 10 35 76 98 52 72 17 43 10 49 5"], "outputs": ["5 out of 5", "3 out of 3", "4 out of 4", "10 out of 10", "3 out of 3", "3 out of 3", "3 out of 3", "15 out of 15", "30 out of 30", "35 out of 35", "40 out of 40", "47 out of 47", "100 out of 100"]}	UNKNOWN	PYTHON3	CODEFORCES	109
9143317c9ec97376be9a5c100718a323	Passwords	Vanya is managed to enter his favourite site Codehorses. Vanya uses n distinct passwords for sites at all, however he can't remember which one exactly he specified during Codehorses registration. Vanya will enter passwords in order of non-decreasing their lengths, and he will enter passwords of same length in arbitrary order. Just when Vanya will have entered the correct password, he is immediately authorized on the site. Vanya will not enter any password twice. Entering any passwords takes one second for Vanya. But if Vanya will enter wrong password k times, then he is able to make the next try only 5 seconds after that. Vanya makes each try immediately, that is, at each moment when Vanya is able to enter password, he is doing that. Determine how many seconds will Vanya need to enter Codehorses in the best case for him (if he spends minimum possible number of second) and in the worst case (if he spends maximum possible amount of seconds). The first line of the input contains two integers n and k (1<=≤<=n,<=k<=≤<=100) — the number of Vanya's passwords and the number of failed tries, after which the access to the site is blocked for 5 seconds. The next n lines contains passwords, one per line — pairwise distinct non-empty strings consisting of latin letters and digits. Each password length does not exceed 100 characters. The last line of the input contains the Vanya's Codehorses password. It is guaranteed that the Vanya's Codehorses password is equal to some of his n passwords. Print two integers — time (in seconds), Vanya needs to be authorized to Codehorses in the best case for him and in the worst case respectively. Sample Input 5 2 cba abc bb1 abC ABC abc 4 100 11 22 1 2 22 Sample Output 1 15 3 4	[ "import math\r\nn,k= map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n w= input()\r\n l.append(w)\r\nr= input()\r\nl.sort(key=len)\r\nle= len(r)\r\nm=[x for x in l if len(x)<le]\r\nprint((len(m)+1)+(len(m)//k)5,end=\" \") #best\r\no= [x for x in l if len(x)<=le]\r\nprint(((len(o)-1)//k)5+ len(o)) #worst\r\n\r\n", "def solution(passwords, correct_pass, k) -> None:\n # Init\n n = len(correct_pass)\n n1 = n2 = 0\n for x in passwords:\n l = len(x)\n if l < n: n1 += 1\n elif l == n: n2 += 1\n\n # Work\n res = (n1 // k) * (k + 5)\n extra = (n1 % k)\n\n # Best case\n best = res + extra + 1\n\n other = extra + n2 - 1\n\n # Worst case\n worst = (other // k) * (k + 5)\n worst += res + (other % k) + 1\n\n print(\"{} {}\".format(best, worst))\n\n\ndef main():\n p, q = map(int, input().split())\n passwords = []\n for i in range(p):\n passwords.append(input())\n correct_pass = input()\n solution(passwords, correct_pass, q)\n\n\nif __name__ == \"__main__\":\n main()\n", "def myFunc(e):\r\n return len(e)\r\nn ,k =map(int,input().split())\r\nliste = []\r\ncompteur = 1\r\ncompteurmax = 0\r\ni = 0\r\nr = 0\r\nfor loop in range(n):\r\n texte = input()\r\n liste.append(texte)\r\nliste.sort(reverse = False,key=myFunc)\r\nsolution = input()\r\nwhile len(liste[i]) != len(solution):\r\n compteur +=1\r\n i +=1\r\n r += 1\r\n if r%k==0:\r\n compteur +=5\r\ncompteurmax = compteur\r\ni +=1\r\nif i<len(liste):\r\n while len(liste[i]) == len(solution):\r\n i +=1\r\n r +=1\r\n compteurmax +=1\r\n if r%k == 0:\r\n compteurmax+=5\r\n if i ==len(liste):\r\n break\r\nprint(\"{} {}\".format(compteur,compteurmax))\r\n \r\n", "n,k=map(int,input().split())\r\nst=tuple(len(input())for i in range(n))\r\nn=len(input())\r\nr=0\r\nq=-1\r\nfor i in st:\r\n\tr+=n>i\r\n\tq+=n>=i\r\nprint(1+r+r//k5,1+q+q//k5)\r\n", "n, k = list(map(int, input().split()))\n\ncount_len_password = [0] * 101 # length password != 0\n\nfor _ in range(n):\n wrong_password = input()\n count_len_password[len(wrong_password)] += 1\n\ntrue_password = input()\n\nbest_case = 0\nworst_case = 0\n\ni = 1\nwhile i < len(true_password):\n best_case += count_len_password[i]\n i += 1\n\nworst_case += best_case + count_len_password[i] - 1\n\nbest_case += int(best_case / k) * 5 + 1\nworst_case += int(worst_case / k) * 5 + 1\n\nprint(best_case, worst_case)", "n, k = map(int, input().split())\r\na = [0] * n\r\nfor i in range(n):\r\n a[i] = len(input())\r\nrp = len(input())\r\na = sorted(a)\r\nc = a.index(rp) + 1\r\nb = n - a[::-1].index(rp)\r\nminatemps = c + (c - 1) // k * 5\r\nmaxatemps = b + (b - 1) // k * 5\r\nprint(minatemps, maxatemps)\r\n", "I=input\r\nn,k=map(int,I().split())\r\na=sorted(len(I())for _ in '0'n)\r\np=len(I())\r\nt=a.index(p)\r\na,b=t,t+a.count(p)\r\nprint(1+a+a//k5,b+(b-1)//k5)", "n, k = [int(i) for i in input().split()]\npassws = []\nfor i in range(n):\n passws.append(input())\nmain = input()\nml = len(main)\n\nlens = [0] 101\nfor i in passws:\n lens[len(i)] += 1\n\nmls = sum(lens[:ml])\nmls2 = sum(lens[:ml+1])\nprint(mls + (mls//k)5 + 1, mls2 + ((mls2-1)//k)5)", "n, k = list(map(int, input().split()))\r\nlst = []\r\nfor i in range(n+1):\r\n s = input()\r\n lst.append(s)\r\nvanya_password = lst[-1]\r\nlst.pop(-1)\r\nbest_case = 0\r\nworst_case = 0\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(len(lst)):\r\n if(len(lst[i]) < len(vanya_password)):\r\n count1+=1\r\n#for j in range(len(lst)):\r\n if(len(lst[i]) <= len(vanya_password)):\r\n count2+=1\r\n#print(count1,count2)\r\nbest_case = count1 + (count1//k)5 + 1\r\nworst_case = count2 + ((count2-1)//k)5\r\nprint('{0} {1}'.format(best_case,worst_case))\r\n#print(s)\r\n\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\nlist_pass = []\r\nfor i in range(0, n):\r\n list_pass.append(input())\r\ntrue_pass = input()\r\n\r\ntotal_minTime = total_maxTime = 0\r\n\r\nnumSameLen = 0\r\nnumSmallLen = 0\r\n\r\nfor i in range(0, n):\r\n if (len(list_pass[i]) < len(true_pass)):\r\n numSmallLen += 1\r\n elif (len(list_pass[i]) == len(true_pass)):\r\n numSameLen += 1\r\n\r\ntotal_minTime = (numSmallLen//k)5 + 1 + numSmallLen\r\n\r\nnumSameLen += numSmallLen\r\ntotal_maxTime = ((numSameLen-1)//k)5+numSameLen\r\n\r\nprint(total_minTime, total_maxTime)\r\n", "n, k = map(int, input().split())\r\nd = []\r\n\r\nfor _ in range(n):\r\n d.append(len(input()))\r\ns = input()\r\nd.sort()\r\nc = sum(i < len(s) for i in d)\r\nmi = c + (c//k)5 + 1\r\n\r\nc = sum(i <= len(s) for i in d)\r\nma = c + ((c-1)//k)5\r\n\r\nprint(mi, ma)\r\n", "import sys\r\nimport math\r\ninput=sys.stdin.readline\r\nq=[]\r\np=[0]101\r\nn,k=map(int,input().strip().split(\" \"))\r\nfor i in range(n):\r\n s=input()\r\n q.append(s)\r\n p[len(s)-1]+=1\r\nr=input()\r\ncnt=0\r\nmcnt=0\r\nfor i in range(0,len(r)-1):\r\n cnt+=p[i]\r\nt=cnt+1+(cnt//k)5\r\ncnt+=p[len(r)-1]\r\ncnt+=((cnt-1)//k)5\r\nprint(t,cnt)", "n, k = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n\tinp = input()\r\n\ts.append(inp)\r\np = input()\r\ncnt_less = cnt_less_and_equal = time = 0\r\n\r\nfor i in s:\t\r\n\tif (len(i) < len(p)):\r\n\t\tcnt_less += 1\r\n\t\tcnt_less_and_equal += 1\r\n\r\n\telif (len(i) == len(p)):\r\n\t\tcnt_less_and_equal += 1\r\n \r\nprint(cnt_less + cnt_less//k 5 + 1, cnt_less_and_equal + (cnt_less_and_equal - 1) // k * 5)", "# RawCoder : https://bit.ly/RCyouTube\r\n# Author : MehulYK\r\n\r\ndef lmap():\r\n return list(map(int, input().split()))\r\ndef mmap(): \r\n return map(int, input().split())\r\n\r\nn, k = mmap()\r\npsd = [] #array to store tried passwords\r\npsdl = [] #array to store password lengths\r\n\r\nfor i in range(n):\r\n ps = input() #password\r\n psd.append(ps)\r\n psdl.append(len(ps))\r\n\r\nops = input() #org password\r\nopsl = len(ops) #org password's length\r\n\r\npsdl.sort()\r\n\r\nind = psdl.index(opsl) #starting index of password of length opsl\r\n\r\nif(ind == 0):\r\n best = 1\r\n\r\nelse:\r\n pen = (ind // k) * 5 #penalty\r\n best = pen + ind + 1\r\n\r\ntem = psdl.count(opsl) #no of pswds of length opsl\r\ncnt = (ind + tem) #finding the position of ops in the worst case\r\n\r\npen = ((cnt - 1) // k) * 5 #penalty\r\nworst = pen + cnt\r\n\r\nprint(best, worst)", "n, k = map(int, input().split())\r\nlst = [input() for _ in range(n)]\r\ncorrect_password = input()\r\ncnt1 = 0\r\ncnt_le = 0\r\nfor pas in lst:\r\n if len(pas) < len(correct_password):\r\n cnt1 += 1\r\n if len(pas) <= len(correct_password):\r\n cnt_le += 1\r\n\r\nbest_case = cnt1 +(cnt1//k)5 + 1\r\nworse_case = cnt_le + ((cnt_le-1)//k)5\r\n\r\nprint(best_case, worse_case)", "n, k = map(int, input().split())\n\nmax_password_len = 100\npassword_len_freqs = [0 for i in range(max_password_len + 1)]\npasswords = []\nfor i in range(n):\n curr_password = input().strip()\n password_len_freqs[len(curr_password)] += 1\n passwords.append(curr_password)\n\ncorrect_password = input().strip()\ncorrect_password_len = len(correct_password)\nnum_passwords_before = sum(password_len_freqs[:correct_password_len])\n\nblocked_waiting_time = 5\n\nnum_entries_mn = num_passwords_before + 1\nnum_blocks_mn = (num_entries_mn - 1) // k\nmn_waiting_time = num_blocks_mn * blocked_waiting_time + num_entries_mn\n\nnum_entries_mx = num_passwords_before + password_len_freqs[correct_password_len]\nnum_blocks_mx = (num_entries_mx - 1) // k\nmx_waiting_time = num_blocks_mx * blocked_waiting_time + num_entries_mx\n\nprint(str(mn_waiting_time) + ' ' + str(mx_waiting_time))\n", "a,b=map(int,input().split())\r\nd=[len(input()) for x in range(a)]\r\nd.sort()\r\nc=len(input())\r\ni=d.index(c)\r\nr=i+d.count(c)\r\nprint(i+1+i//b5,r+(r-1)//b5)\r\n", "I=input\n \nn,k=map(int,I().split())\n \na=sorted(len(I())for _ in '0'n)\n \np=len(I())\n \nt=a.index(p)\n \na,b=t,t+a.count(p)\n \nprint(1+a+a//k5,b+(b-1)//k5)\n\t\t\t\t\t \t \t \t\t \t \t \t\t\t\t \t", "def solve(passwords, k, correct):\r\n less_length_num = sum(1 for password in passwords if len(password) < len(correct))\r\n same_length_num = sum(1 for password in passwords if len(password) == len(correct))\r\n \r\n return \"{} {}\".format(compute_time(k, less_length_num), compute_time(k, less_length_num + same_length_num - 1))\r\n\r\ndef compute_time(k, before_num):\r\n return before_num + (before_num // k) 5 + 1\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n passwords = [input() for _ in range(n)]\r\n correct = input()\r\n \r\n print(solve(passwords, k, correct))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,k=map(int,input().strip().split())\nv=[0]101\nfor i in range(n):\n\ts=input()\n\tv[len(s)]+=1\ncorr=len(input())\ni=1\nc=0\nwhile i<corr:\n\tc+=v[i]\n\ti+=1\n\nbest= c+1+int(c/k)5\nc+=v[corr]-1\nworst= c+1+int(c/k)5\n\nprint(best,worst)\n\t \t \t\t \t \t\t\t\t \t \t\t\t\t\t\t\t\t", "number_of_passwords, number_of_failed_tries = map(int, input().split())\r\n\r\ncnt = [0] 101\r\n\r\nfor _ in range(number_of_passwords):\r\n current_password = input()\r\n cnt[len(current_password)] += 1\r\n\r\ncorrect_password = input()\r\n\r\nbest_time = worst_time = 0\r\n\r\nfor i in range(len(correct_password)):\r\n best_time += cnt[i]\r\n\r\nworst_time = best_time + cnt[len(correct_password)] - 1\r\n\r\nbest_time += (best_time // number_of_failed_tries * 5) + 1\r\nworst_time += (worst_time // number_of_failed_tries * 5) + 1\r\n\r\nprint(f'{best_time} {worst_time}')\r\n", "n, k = map(int, input().split())\r\na = [input() for i in range(n)]\r\npa = input()\r\nfor i in range(len(a)):\r\n a[i] = [len(a[i])] + [a[i]]\r\na.sort()\r\nfor i in range(len(a)):\r\n if len(a[i][1]) == len(pa):\r\n ind1 = i\r\n break\r\nfor i in range(len(a)-1, -1, -1):\r\n if len(a[i][1]) == len(pa):\r\n ind2 = i\r\n break\r\nprint(ind1 + 1 + ind1 // k * 5, ind2 + 1 + ind2 // k * 5)\r\n", "import os\r\nimport sys\r\nimport math\r\nimport heapq\r\nfrom decimal import \r\nfrom io import BytesIO, IOBase\r\nfrom collections import defaultdict, deque\r\n\r\ndef r():\r\n return int(input())\r\ndef rm():\r\n return map(int,input().split())\r\ndef rl():\r\n return list(map(int,input().split()))\r\n\r\nn,k=rm()\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\npassword = input()\r\n\r\npassLen = len(password)\r\ntime=0\r\nmin=0\r\nmax=0\r\ngotMin=False\r\ngotMax=False\r\n\r\nb = []\r\nfor i in a:\r\n b.append(len(i))\r\nb.sort()\r\nkii=0\r\n\r\nfor i in b:\r\n if i<passLen:\r\n time+=1\r\n kii+=1\r\n kiii=False\r\n elif i == passLen and not gotMin:\r\n time+=1\r\n kii+=1\r\n gotMin=True\r\n min=time\r\n kiii=False\r\n elif i== passLen:\r\n time+=1\r\n kii+=1\r\n kiii=False\r\n else:\r\n max=time\r\n gotMax=True\r\n break\r\n if kii==k:\r\n time+=5\r\n kiii=True\r\n kii=0\r\nif gotMax:\r\n if kiii==True:\r\n max-=5\r\nif not gotMax:\r\n if kiii==True:\r\n time-=5\r\n max=time\r\n\r\nprint(min, max)\r\n", "n, k = map(int, input().split())\r\npassword = []\r\nfor i in range(n):\r\n s = input()\r\n password.append(s)\r\nres = input()\r\nlower, upper = 0, 0\r\n\r\nfor i in range(n):\r\n lower += (len(password[i]) < len(res))\r\n upper += (len(password[i]) <= len(res))\r\nprint(lower + (lower//k) 5 + 1, upper + ((upper - 1)//k) * 5)", "password, n_errors = input().split()\r\nlis = []\r\nfor x in range(int(password)):\r\n lis.append(input())\r\nlis = sorted(lis,key=len)\r\nvalid = input()\r\ncount = 0\r\nlower = 0\r\nfor x in lis:\r\n if len(x)< len(valid):\r\n lower += 1\r\n elif len(x)==len(valid) and x!= valid:\r\n count += 1\r\nprint(((lower)//int(n_errors)5+(lower)+1),((lower+count)//int(n_errors)(5)+(lower+count)+1))", "# your code goes here\r\n# your code goes here\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(input())\r\ns=input()\r\nlc=0#counts less length strings\r\nec=0#counts equal length strings:\r\nfor i in l:\r\n\tif(len(i)<len(s)):\r\n\t\tlc=lc+1\r\n\tif(len(i)==len(s)):\r\n\t\tec=ec+1\r\nbt=0#best case time\r\nwt=0#worst case time\r\nfor i in range(lc):\r\n\tif((i+1)%m==0):\r\n\t\tbt=bt+6\r\n\telse:\r\n\t\tbt=bt+1\r\nfor i in range(lc+ec-1):\r\n\tif((i+1)%m==0):\r\n\t\twt=wt+6\r\n\telse:\r\n\t\twt=wt+1\r\nprint(bt+1,wt+1)\r\n\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\nm = 105\r\nx = [set() for _ in range(m)]\r\nfor _ in range(n):\r\n s = input().rstrip().decode()\r\n x[len(s)].add(s)\r\ns = input().rstrip().decode()\r\nl = len(s)\r\nc = 0\r\nfor i in range(1, l):\r\n c += len(x[i])\r\nans = [0] * 2\r\nans[0] = c + 1 + c // k * 5\r\nc += len(x[l]) - 1\r\nans[1] = c + 1 + c // k * 5\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n,k=map(int,input().split())\r\nd=dict()\r\ndi=dict()\r\nfor i in range(n):\r\n\ts=input()\r\n\td[s]=len(s)\r\nfor i in d.values():\r\n\tif i in di:\r\n\t\tdi[i]+=1\r\n\telse:\r\n\t\tdi[i]=1\r\ncount=1\r\ncoun=0\r\npwd=input()\r\nfor i in sorted(di.items(),key=lambda x:x[0]):\r\n\tif len(pwd)>i[0]:\r\n\t\tcount+=i[1]\r\n\tif i[0]<=len(pwd):\r\n\t\tcoun+=i[1]\r\nif count%k==0:\r\n\tz=(count/k)-1\r\nelse:\r\n\tz=count//k\r\nif coun%k==0:\r\n\ty=(coun/k)-1\r\nelse:\r\n\ty=coun//k\r\ncoun+=(5y)\r\ncount+=(5z)\r\nprint(int(count),int(coun))", "N, K = list(map(int, input().split()))\r\nX = []\r\nfor i in range(N): X.append(input())\r\nP = len(input())\r\nX.sort(key=len)\r\nx, y = 0, 0\r\nfor i in X:\r\n if len(i) > P: break\r\n elif len(i) == P: y+=1\r\n else:\r\n y+=1\r\n x+=1 \r\nx+=1\r\nif x%K==0: print(x+(((x//K)-1)5), end=\" \")\r\nelse: print(x+((x//K)5), end=\" \")\r\nif y%K==0: print(y+(((y//K)-1)5))\r\nelse: print(y+((y//K)5))", "n, k = [int(i) for i in input().split()]\r\npasswords = list()\r\nfor i in range(n):\r\n word = input()\r\n passwords.append(word)\r\nresult = input()\r\nlower, upper = 0, 0\r\nfor i in range(n):\r\n lower += (len(passwords[i]) < len(result))\r\n upper += (len(passwords[i]) <= len(result))\r\nprint(lower + (lower // k) * 5 + 1, upper + ((upper - 1) // k) * 5)\r\n", "n, k = map(int, input().split())\n\npw_list = [len(input()) for _ in range(n)]\n\npw = len(input())\n\np = sorted(pw_list)\n\nhead = p.index(pw)\ntail = n - list(reversed(p)).index(pw) - 1\nworst_case = head + ((head)//k)5 + 1\nbest_case = tail + (tail//k)5 + 1\n\nprint(worst_case, best_case)\n\n \t \t\t\t\t\t\t\t \t\t\t \t\t \t \t\t\t", "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\nfor t in range(1):\r\n n, k = get_ints()\r\n strings = []\r\n \r\n for i in range(n):\r\n strings.append(input().strip())\r\n \r\n ans = input().strip()\r\n len_ans = len(ans)\r\n less_than_ans, equal_to_ans = 0, 0\r\n\r\n strings.sort(key = lambda x: len(x))\r\n \r\n for i in range(n):\r\n x = len(strings[i])\r\n if x < len_ans:\r\n less_than_ans += 1\r\n elif x == len_ans:\r\n equal_to_ans += 1\r\n else:\r\n break\r\n \r\n best_case_time = less_than_ans + (less_than_ans//k)5 + 1\r\n worst_case_time = (less_than_ans + equal_to_ans - 1) + ((less_than_ans + equal_to_ans - 1)//k)5 + 1\r\n \r\n print(best_case_time, worst_case_time)\r\n ", "from collections import Counter\r\n\r\nn,K = map(int, input().split())\r\n\r\ncounts = Counter()\r\nfor _ in range(n):\r\n\tcounts[len(input())] += 1\r\n\r\nans = input()\r\nsize=len(ans)\r\n\r\nbest=worst=0\r\nfor k in sorted(counts.keys()):\r\n\tif k == size:\r\n\t\tbest += 1\r\n\t\tworst += counts[k]\r\n\t\tbreak\r\n\telse:\r\n\t\tbest += counts[k]\r\n\t\tworst += counts[k]\r\n\t\r\nprint(best+((best-1)//K)5,worst+((worst-1)//K)5)", "n,k=map(int,input().split())\r\na=[input() for i in range(n)]\r\np=input()\r\nc=0\r\nd=0\r\nfor i in range(n):\r\n\tif len(a[i])==len(p):\r\n\t\td+=1\r\n\tif len(a[i])<len(p):\r\n\t\tc+=1\r\nx=c//k\r\nl=c+x5+1\r\ny=(d+c-1)//k\r\nh=d+c+y5\r\nprint(l,h)", "n,k = list(map(int,input().split()))\r\npasswords = []\r\nfor i in range(n):\r\n x = input()\r\n passwords.append(x)\r\npasswords.sort(key=lambda x: len(x))\r\nans = input()\r\nbestAns = 0\r\nworstAns = 0\r\n\r\nmark = 0\r\nfor i in passwords:\r\n if len(i) != len(ans):\r\n bestAns += 1\r\n if mark==k:\r\n bestAns += 5\r\n mark = 0\r\n else:\r\n bestAns += 1\r\n if mark==k:\r\n bestAns += 5\r\n mark = 0\r\n break\r\n mark += 1\r\n\r\nmark = 0\r\nfor i in passwords:\r\n if len(i)>len(ans):\r\n break\r\n if len(i) != len(ans):\r\n worstAns += 1\r\n if mark==k:\r\n worstAns += 5\r\n mark = 0\r\n else:\r\n worstAns += 1\r\n if mark==k:\r\n worstAns += 5\r\n mark = 0\r\n mark += 1\r\n\r\nprint(bestAns,worstAns)", "n,k=map(int,input().split())\r\na=[]\r\nfor i in range(n+1):\r\n a.append(len(input()))\r\nl=a[n]\r\n\r\na=a[:n]\r\na=sorted(a)\r\nr=0\r\nt=0\r\nfor i in range(n):\r\n if a[i]<=l:\r\n t+=1 \r\n if a[i]<l:\r\n r+=1\r\n\r\nd1=r+(r//k)5+1 \r\nd2=t+((t-1)//k)5\r\nprint(d1,d2,sep=\" \")", "n,k = map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(len(input()))\r\nl.sort()\r\np = len(input())\r\nrl = l.index(p)\r\nrr = n-1-l[::-1].index(p)\r\nprint(rl+1+((rl//k)5),rr+1+((rr//k)5))", "n,k=map(int,input().split())\r\na=[]\r\nfor _ in range(n):\r\n s=input()\r\n a.append(len(s))\r\nx=input()\r\ny=len(x)\r\na.sort()\r\ni=a.index(y)\r\nj=a.count(y)\r\np=i\r\nq=i+j-1\r\nprint((p//k)5 + p + 1,(q//k)5 + q + 1)", "n,k = map(int,input().split())\r\ns = []\r\nfor i in range(n):\r\n\tt = input()\r\n\tl = len(t)\r\n\tr = (t,l)\r\n\ts.append(r)\r\nr1 = sorted(s,key = lambda x:x[1])\r\nt = input()\r\nans = [0,0]\r\nlength = len(t)\r\n# print(r1)\r\n# print(s[-1][-1])\r\nflag = 0\r\nfor i in range(n):\r\n\tif r1[i][1] == length and flag == 0:\r\n\t\tans[0] = i\r\n\t\tflag = 1\r\n\tif i == n-1 or r1[i+1][1] > length:\r\n\t\tans[1] = i\r\n\t\tbreak\r\nprint(ans[0]+5((ans[0])//k)+1,ans[1]+5((ans[1])//k)+1)\r\n", "t=input()\r\nn=int(t.split(' ')[0])\r\nk=int(t.split(' ')[1])\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\npassword = input()\r\nt=0\r\nl.sort(key=len)\r\nfor i in l:\r\n t+=1\r\n if len(i)==len(password):\r\n break\r\ndef getans(t):\r\n global k\r\n q=-1\r\n ans=0\r\n for i in range(t):\r\n q+=1\r\n ans+=1\r\n if q%k==0 and q>=k:\r\n ans+=5\r\n return ans\r\na=getans(t)\r\nt=0\r\nfor i in l:\r\n if len(i)>len(password):\r\n break\r\n t+=1\r\nb=getans(t)\r\nprint(a,b)\r\n", "n, k = map(int, input().split())\r\n\r\n\r\n#input\r\nlenLst = []\r\nfor i in range(n + 1):\r\n x = input()\r\n lenLst.append(len(x))\r\n\r\n#solve\r\nlen_true = lenLst[n]\r\nlenLst = lenLst[:n]\r\nlenLst.sort()\r\n\r\n\r\nidStart = lenLst.index(len_true)\r\na1 = len(lenLst[:idStart + 1])\r\na2 = lenLst.count(len_true) \r\n\r\n\r\nbest = a1 + 5 (a1 // k - (a1 % k == 0 and a1 != 0)) \r\nz = a1 + a2 - 1\r\nworst = z + 5 * (z // k - (z % k == 0 and z != 0)) \r\nprint(best, worst)", "def solution(passwords, correct_pass, k):\n # Work\n less = passwords.index(correct_pass)\n same = passwords.count(correct_pass)\n print(less+((less//k)5) + 1, same + ((same + less - 1)//k)5 + less )\n\n\ndef main():\n p, q = map(int, input().split())\n # If a property satifies don't store the whole input\n passwords = sorted(len(input()) for i in range(p))\n correct_pass = len(input())\n solution(passwords, correct_pass, q)\n\n\nif __name__ == \"__main__\":\n main()\n", "n, k = map(int, input().split())\nl = [0] * 100\nfor i in range(n):\n l[len(input())-1] += 1\np = len(input())\nmin, max, i = 0, 0, 0\nwhile i + 1 != p:\n min += l[i]\n max += l[i]\n i += 1\nmax += l[p-1] - 1\nmin += 5(min // k)\nmax += 5(max // k)\nmin += 1\nmax += 1\nprint(min, max)\n", "n, k = map(int, input().split())\np = [len(input()) for _ in range(n)]\n\npassword = len(input())\n\np = sorted(p)\n\nfirst = p.index(password)\nlast = n - list(reversed(p)).index(password) - 1\n\nmn = first + ((first//k) * 5) + 1\nmx = last + ((last//k) * 5) + 1\nprint(mn, mx)\n\n\n\t \t \t\t \t \t\t\t\t \t\t \t \t\t\t \t", "n, k = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n s = input()\r\n a.append(s)\r\n\r\ns = input()\r\npwdlen = len(s)\r\n\r\nshorter_pwdlen = 0\r\nequal_pwdlen = 0\r\nfor i in range(n):\r\n if len(a[i]) < pwdlen:\r\n shorter_pwdlen += 1\r\n elif len(a[i]) == pwdlen:\r\n equal_pwdlen += 1\r\n\r\nmin_times = shorter_pwdlen + (shorter_pwdlen // k) * 5 + 1\r\nmax_times = (shorter_pwdlen + equal_pwdlen - 1) + ((shorter_pwdlen + equal_pwdlen - 1) // k) * 5 + 1\r\nprint(min_times, max_times)", "def solution(passwords, correct_pass, k):\n n1 = n2 = 0\n for x in passwords:\n if x < correct_pass: n1 += 1\n elif x == correct_pass: n2 += 1\n\n print(n1 + (n1 // k) * 5 + 1, n2 + (n1 + n2 -1)//k * 5 + n1)\n\n\ndef main():\n p, q = map(int, input().split())\n passwords = []\n for i in range(p):\n passwords.append(len(input()))\n correct_pass = len(input())\n solution(passwords, correct_pass, q)\n\n\nif __name__ == \"__main__\":\n main()\n", "n,k=map(int,input().split())\nl=[]\nfor i in range(n):\n\tl.append(input())\np=input()\na,b=0,0\nfor i in l:\n\tif(len(i)<len(p)):a+=1\n\tif(len(i)<=len(p)):b+=1\ndef fun(s,k):\n\ty=s%k\n\tif y==0:y=k\n\tx=(s-y)//k\n\treturn x(k+5)+y\nprint(fun(a+1,k),fun(b,k))\n\n \t\t \t \t \t\t\t\t\t \t\t \t\t", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nHomura = [int(i) for i in input().split()]\r\nn = Homura[0]\r\nk = Homura[1]\r\n\r\n#lengths[i] contains the number of passwords of length i+1\r\nlengths = [0 for i in range(100)]\r\nfor i in range(n):\r\n\tlengths[len(input())-1] += 1\r\n#l is the length of the correct password\r\nl = len(input())\r\n\r\n#m is the minimum number of passwords needed\r\n#M is the maximum number of passwords needed\r\nM = 0\r\nfor i in range(l):\r\n\tM += lengths[i] #All passwords of length <= l\r\nm = M - lengths[l-1] + 1\r\n\r\n#w_m is the number of waits for m attempts\r\n#w_M is the number of waits for M attempts\r\nw_m = (m-1)//k\r\nw_M = (M-1)//k\r\n\r\n#t_m is the time taken for m attempts\r\n#t_M is the time taken for M attempts\r\nt_m = m + 5 w_m\r\nt_M = M + 5 * w_M\r\n\r\nprint(t_m, t_M)\r\n", "n,k=map(int,input().split())\r\np=[]\r\nfor _ in range(n):\r\n\tp.append(len(input()))\r\nl=len(input())\r\np.sort()\r\nsmallLength = 0\r\nfor i in p:\r\n\tif i<l:\r\n\t\tsmallLength += 1\r\n\telse:\r\n\t\tbreak\r\nsameLength = p.count(l)\r\nprint (smallLength+smallLength//k5+1,smallLength+((smallLength+sameLength-1)//k5+sameLength))", "\r\n\r\nn,k=map(int,input().split())\r\npas=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\tpas.append(s)\r\ns=input()\r\narr1=list(filter(lambda x:len(x)<len(s),pas))\r\nbest=len(arr1)\r\narr2=list(filter(lambda x:len(x)<=len(s),pas))\r\nworst=len(arr2)\r\narr3=list(filter(lambda x:x==s,pas))\r\nsame=len(arr3)\r\nworst-=same\r\n#print(best,worst)\r\nif worst==0:\r\n\tprint((best+5(best//k))+1,\"1\")\r\nelse:\r\n\tprint((best+5(best//k))+1,worst+5((worst)//k)+1)\r\n\t\t\t#unknown_2433\r\n", "n, k = map(int, input().split())\r\nlst = []\r\n\r\nfor i in range(n):\r\n lst.append(input())\r\n\r\nlenpass = len(input())\r\n\r\ncntless = 0\r\nnotlonger = 0\r\n\r\nfor item in lst:\r\n if len(item) < lenpass:\r\n cntless += 1\r\n notlonger += 1\r\n elif len(item) == lenpass:\r\n notlonger += 1\r\n\r\nbest = cntless + (cntless//k)5 + 1\r\nworst = notlonger + ((notlonger-1)//k)5\r\n\r\nprint(best, worst)", "import sys\n\n# def solution(a, b, c, d, k):\n\n\n\nn, k = sys.stdin.readline().split()\nn, k = int(n), int(k)\npasswords = []\n\n# 读密码n个\nfor i in range(n):\n pwd = sys.stdin.readline().strip()\n passwords.append(pwd)\n\ncorrect_pwd = sys.stdin.readline().strip()\ntarget_len = len(correct_pwd)\n\nnum_shorter = 0\nnum_equal = 0\nmin_time = 0\nmax_time = 0\n\nfor pwd in passwords:\n if len(pwd) < target_len:\n num_shorter += 1\n if len(pwd) <= target_len:\n num_equal += 1\n\nmin_time = num_shorter + 1\nmax_time = num_equal\n\nif min_time >= k:\n min_time = (min_time - 1) // k 5 + min_time\nif max_time >= k:\n max_time = (max_time - 1) // k * 5 + max_time\n\nprint(\"%i %i\" % (min_time, max_time))\n\n \t\t\t\t\t \t \t\t \t\t \t\t \t \t\t\t \t", "n, k = map(int, input().split())\r\narr = [0] * 101\r\nfor i in range(n):\r\n st = input()\r\n arr[len(st)] += 1\r\nst = input()\r\nmin = 0\r\nfor i in range(1, len(st)): min += arr[i]\r\nprint(min + 5 * (min // k) + 1, 5 * ((min + arr[len(st)] - 1) // k) + min + arr[len(st)])\r\n", "from collections import defaultdict\r\nn,k=map(int,input().split())\r\nc=defaultdict(lambda:0)\r\nfor _ in range(n):\r\n s=input()\r\n c[len(s)]+=1\r\noriginal=input()\r\nans=0\r\nfor i in range(1,len(original)):\r\n ans+=c[i]\r\nprint(ans+((ans//k)5)+1,end=\" \")\r\nans+=c[len(original)]-1\r\nprint(ans+((ans//k)5)+1)\r\n", "n, k=map(int, input().split())\r\nl=[]\r\nfor x in range(n):\r\n\tl.append(len(input().strip()))\r\npassword=input()\r\nl.sort()\r\na=l.index(len(password))\r\nb=a+l.count(len(password))\r\nprint(1+a+(a//k)5, b+((b-1)//k)5)", "n, k = map(int, input().split())\nlst = []\nfor i in range(n):\n\tx = input()\n\tlst.append(x)\np = input()\nd = {}\nlst.sort()\nfor i in lst:\n\tif len(i) in d:\n\t\td[len(i)]+=1\n\telse:\n\t\td[len(i)]=1\nl = len(p)\ns = 1\ne = 0\nfor key in d.keys():\n\tif key < l:\n\t\ts += d[key]\n\tif key <= l:\n\t\te += d[key]\nif s % k != 0:\n s1 = s+((s//k)5)\nelse:\n s1 = s+(((s-1)//k)5)\nif e % k != 0:\n e1 = e+((e//k)5)\nelse:\n e1 = e+(((e-1)//k)5)\nprint(s1, e1)\n \t \t\t \t \t \t \t\t\t \t \t", "\r\nn,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(len(s))\r\ns=input()\r\nif n==1:\r\n print(1,1)\r\n exit()\r\nl.sort()\r\nh1=l.index(len(s))\r\nh2=-1\r\nfor i in range(h1+1,n):\r\n if l[i]>len(s):\r\n h2=i-1\r\n break\r\n# print(h2)\r\nif h2==-1:\r\n h2=n-1\r\n# print(h1,h2)\r\nh1=h1+1+(h1//k)5\r\nh2=h2+1+(h2//k)5 \r\nprint(h1,h2)\r\n", "n,k=map(int,input().split())\r\nq=sorted([len(input()) for i in range(n)])\r\np=input()\r\nc1,c2=q.index(len(p)),q.index(len(p))+q.count(len(p))\r\nprint(1+c1+c1//k5,c2+(c2-1)//k5)", "n,k=list(map(int,input().split()))\r\nL=[]\r\nfor _ in range(n+1):\r\n s=input()\r\n l=len(s)\r\n L.append((l,s))\r\npas=L.pop()\r\nL.sort()\r\nsz=pas[0]\r\nflag=True\r\ncnt1,cnt2=0,0\r\nfor i in range(n):\r\n if L[i][0]<sz:\r\n cnt1+=1\r\n if L[i][0]<=sz:\r\n cnt2+=1\r\nbest=(cnt1+1)+(cnt1//k)5\r\nworst=cnt2+((cnt2-1)//k)5\r\nprint(best,end=\" \")\r\nprint(worst)", "def shuru(t=0,s=0 ):\n in_item = input().strip()\n if not t:\n return in_item\n elif not s:\n str_t = t+\"(\"+in_item+\")\"\n in_item = eval(str_t)\n return in_item\n else:\n str_s = \"list(\"+s+\"(lambda x:int(x) ,in_item.split() ))\"\n return eval(str_s)\n\ndef fun1():\n import math\n n,k = shuru(\"int\",\"map\")\n mima = {}\n for i in range(n):\n temp = shuru()\n temp_l = len(temp)\n if temp_l not in mima:\n mima[temp_l] =0\n mima[temp_l]+=1\n zhengque = shuru()\n l = len(zhengque)\n min = 0\n max = 0\n for i in mima:\n if i <l:\n min +=mima[i]\n max +=mima[i]\n elif i == l:\n min += 1\n max += mima[i]\n print( math.floor((min-1)/k)5+min, math.floor((max-1)/k)5 +max)\n\n\nif __name__==\"__main__\":\n fun1()\n\n\t\t \t \t\t \t\t\t \t \t \t\t\t\t\t \t \t \t\t\t", "n, k = map(int,input().split())\r\nps = []\r\nfor _ in range(n):\r\n ps.append(len(input()))\r\nps.sort()\r\na = len(input())\r\nl = ps.index(a) \r\nr = n - 1 - ps[::-1].index(a)\r\nprint(l + 1 + ((l//k)5),r + 1 + ((r//k)5))\r\n\r\n", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A, k):\r\n d = [0 for i in range(103)]\r\n for w in A[:-1]:\r\n d[len(w)]+=1 \r\n l = len(A[-1])\r\n S = 0 \r\n for i in range(l+1):\r\n S+=d[i]\r\n a, b = S-d[l], S-1\r\n a = (a+(a//k)5)+1 \r\n b = (b+(b//k)5)+1\r\n sys.stdout.write(f'{a} {b}\\n')\r\n return \r\n\r\nn, k = [int(x) for x in input().split()]\r\nA = []\r\nfor i in range(n+1):\r\n S = input().decode().strip()\r\n A.append(S)\r\nprocess(A, k)", "# your code goes here\r\nn,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nl=[]\r\nfor i in range(n+1):\r\n\ts=input()\r\n\tl.append(s)\r\na=len(l[-1])\r\nt=0\r\nfor i in range(len(l)):\r\n\tif(len(l[i])<a):\r\n\t\tt+=1\r\nt=t+(t//k)5\r\nprint(t+1,end=\" \")\r\nt=0\r\nfor i in range(len(l)):\r\n\tif(len(l[i])<=a and l[i]!=l[-1]):\r\n\t\tt+=1\r\nt=t+(t//k)5\r\nprint(t+1)", "n, k = map(int, input().split())\r\npasswords = [input() for _ in range(n)]\r\nTargetPass = input()\r\n\r\nSamePass = 0\r\nShortPass = 0\r\n\r\nfor password in passwords:\r\n if len(password) < len(TargetPass):\r\n ShortPass += 1\r\n elif len(password) == len(TargetPass):\r\n SamePass += 1\r\n\r\nBest = ShortPass + (ShortPass // k) * 5 + 1\r\n\r\nWorst = (ShortPass + SamePass - 1) + ((ShortPass + SamePass - 1) // k) * 5 + 1\r\n\r\nprint(Best, Worst)\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef query_value(A, m):\r\n ans = 0\r\n cnt = 0\r\n for a in A:\r\n if cnt and cnt % m == 0:\r\n ans += 5\r\n ans += 1\r\n if a == 0:\r\n cnt += 1\r\n elif a == 1:\r\n return ans\r\n return ans\r\n\r\ndef query_maximum_value(d, s, m):\r\n A = []\r\n for key in sorted(d.keys()):\r\n B = []\r\n for t in d[key]:\r\n if t == s:\r\n B.append(1)\r\n else:\r\n B.append(0)\r\n B.sort()\r\n A.extend(B)\r\n return query_value(A, m)\r\n\r\ndef query_minimum_value(d, s, m):\r\n A = []\r\n for key in sorted(d.keys()):\r\n B = []\r\n for t in d[key]:\r\n if t == s:\r\n B.append(1)\r\n else:\r\n B.append(0)\r\n B.sort(reverse=True)\r\n A.extend(B)\r\n return query_value(A, m)\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n d = dict()\r\n for i in range(n):\r\n s = input()\r\n if len(s) not in d:\r\n d[len(s)] = []\r\n d[len(s)].append(s)\r\n s = input()\r\n min_val = query_minimum_value(d, s, m)\r\n max_val = query_maximum_value(d, s, m)\r\n print('%d %d' % (min_val, max_val))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int,input().split())\nl = sorted([len(input()) for i in range(n)])\np = len(input())\nk = l.index(p)\nb = k + 1\nb += (k//m)5\nwk = n - l[::-1].index(p) -1\nw = wk + 1\nw += (wk//m)5\nprint(b, w)\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\na = []\r\nfor i in range(n):\r\n a.append(input())\r\ns = input()\r\nkmn = 1\r\nkmx = 0\r\nfor i in range(n):\r\n if (len(a[i]) < len(s)):\r\n kmn += 1\r\n kmx += 1\r\n elif (len(a[i]) == len(s)):\r\n kmx += 1\r\nprint((kmn - 1) // k * 5 + kmn, (kmx - 1) // k * 5 + kmx)\r\n", "n,k=[int(i) for i in input().split()]\r\ns=[]\r\nfor i in range(n):\r\n s+=input().split()\r\npassw=input()\r\ns.sort(key=lambda x: len(x))\r\nb,w=1,0\r\nx=len(passw)\r\nfor i in range(n):\r\n if len(s[i])<x:\r\n b+=1\r\n w+=1\r\n elif len(s[i])==x:\r\n w+=1\r\n else:\r\n break\r\nif b%k==0:\r\n b+=((b//k)-1)5\r\nelse:\r\n b+=(b//k)5\r\nif w%k==0:\r\n w+=((w//k)-1)5\r\nelse:\r\n w+=(w//k)5\r\nprint( b,w )\r\n", "n, k = map(int, input().split())\npasswords = [input() for i in range(n)]\ntrue_password = input()\ntime_less, time_equal = 0, 0\ndelay = k\npasswords.sort(key=lambda x: len(x))\nfor element in passwords:\n if len(element) < len(true_password):\n time_less += 1\n k -= 1\n if k == 0:\n time_less += 5\n k = delay\n elif len(element) == len(true_password):\n if k == 0:\n time_equal += 5\n k = delay\n time_equal += 1\n k -= 1\n else:\n break\nprint(time_less + 1, time_less + time_equal)\n", "from math import floor\r\nn,k=map(int,input().split())\r\nm=dict()\r\nfor i in range(n):\r\n p=input()\r\n l=len(p)\r\n if l in m:\r\n m[l].append(p)\r\n else:\r\n m[l]=[p]\r\np=input()\r\nmx=0\r\nmn=0\r\nfor i in sorted(m.keys()):\r\n if i==len(p):\r\n break\r\n mn+=len(m[i])\r\nmn+=1\r\nmx=mn+len(m[len(p)])-1\r\nif(mn%k>0):\r\n mn+=floor(mn/k)5\r\nelse:\r\n mn+=floor((mn-1)/k)5\r\nif(mx%k>0):\r\n mx+=floor(mx/k)5\r\nelse:\r\n mx+=floor((mx-1)/k)5\r\nprint(mn,mx)", "n,k = map(int,input().split())\r\nl = []\r\np = {}\r\nfor i in range(n):\r\n temp = input()\r\n try:\r\n p[len(temp)].append(temp)\r\n except KeyError:\r\n p[len(temp)] = [temp]\r\nans = input()\r\nbest = 0\r\nworst = 0\r\nfor i in range(len(ans)):\r\n try:\r\n best += len(p[i])\r\n worst += len(p[i])\r\n except KeyError:\r\n continue\r\nz = best//k\r\nz = z5\r\nbest += z\r\nbest+=1\r\n\r\nfor i in range(len(p[len(ans)])):\r\n temp = p[len(ans)].pop()\r\n if temp == ans:\r\n continue\r\n else:\r\n worst+=1\r\n\r\ny = worst//k\r\ny = y5\r\nworst += y + 1\r\nprint(\"{} {}\".format(best,worst))", "n, k = map(int, input().split())\npasswords = []\nfor i in range(n):\n s = input()\n passwords.append(s)\ncpass = input()\n# print(passwords)\n# print(cpass)\ncountL = 0\ncountE = 0\nfor p in passwords:\n if len(p) < len(cpass):\n countL += 1\n elif len(p) == len(cpass):\n countE += 1\nbestcase = countL + 1 + 5 * (countL // k)\nworstcase = countL + countE + 5 * ((countL + countE - 1) // k)\nprint(bestcase, worstcase)\n", "import bisect\r\nn,k=map(int,input().split())\r\nl=[]\r\nt=[]\r\nfor i in range(n):\r\n s=input()\r\n t+=[s]\r\n l+=[len(s)]\r\ns=input()\r\nc=0\r\n\r\nl.sort()\r\nres1=bisect.bisect_left(l,len(s))+1\r\nres=bisect.bisect_right(l,len(s))\r\nmx=res\r\nwhile (res>0):\r\n res-=k\r\n if(res>0):\r\n c+=1\r\n else:\r\n break\r\nmx+=c5\r\nmn=res1\r\nc=0\r\nwhile(res1>0):\r\n res1-=k\r\n if(res1>0):\r\n c+=1\r\n else:\r\n break\r\nmn+=c5\r\nprint(mn,mx)\r\n\r\n", "n,k = map(int,input().split())\r\nl = [0]110\r\nfor _ in range(n):\r\n s = input()\r\n l[len(s)] += 1\r\nm = len(input())\r\ntemp = sum(l[:m])+1 + (sum(l[:m])//k)5\r\ntemp1 = sum(l[:m+1])\r\nif temp1%k==0:\r\n temp1 += ((temp1-1)//k)5\r\nelse:\r\n temp1 += (temp1//k)5\r\nprint(temp,temp1)", "import sys\n\ncount = 0\nr_list = []\ndic = {}\nfor line in sys.stdin:\n if count == 0:\n n = int(line.strip().split(' ')[0])\n k = int(line.strip().split(' ')[1])\n count += 1\n continue\n count += 1\n if count == n + 2:\n answer_len = len(line.strip())\n break\n tmp = line.strip()\n dic[len(tmp)] = dic.get(len(tmp), 0) + 1\n\n\nsorted_dic = sorted(dic.items(), key=lambda x:x[1])\n\n\nnum = 0\nfor tmp in sorted_dic:\n if tmp[0] < answer_len:\n num += tmp[1]\n\nmin = num + 1\nmax = num + dic[answer_len]\n\n\n\nmin_t = ((min - 1) // k)5 + min\nmax_t = ((max - 1) // k)5 + max\n\nprint(str(min_t) + ' '+ str(max_t))\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\ncnt = [0] * 101\r\n\r\nfor _ in range(n):\r\n s = input()\r\n cnt[len(s)] += 1\r\n\r\npassword = input()\r\nbest_time = worst_time = 0\r\n\r\nfor i in range(len(password)):\r\n best_time += cnt[i]\r\n\r\nworst_time = best_time + cnt[len(password)] - 1\r\n\r\nbest_time += (best_time // k) * 5\r\nworst_time += (worst_time // k) * 5\r\n\r\nprint(best_time + 1, worst_time + 1, sep=' ')", "n,k=map(int,input().split())\r\nworst=best=w=b=0\r\nl=[]\r\na=[0]101\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nx=input()\r\nfor i in range(n):\r\n h=len(l[i])\r\n a[h]+=1\r\nh=len(x)\r\nfor i in range(h+1):\r\n w+=a[i]\r\nfor i in range(h):\r\n b+=a[i]\r\nworst=w+(((w-1)//k)5)\r\nbest=b+(((b)//k)5)\r\nprint(best+1,worst,sep=' ')", "I = input\r\nn , k = map(int , I().split())\r\na = sorted(len(I()) for _ in '0'n)\r\np = len(I())\r\nt = a.index(p)\r\na , b = t , t + a.count(p)\r\nprint(1 + a + a // k * 5 , b + (b - 1) // k * 5)", "n, k = map(int, input().split())\r\ncnt = [0]101\r\nfor _ in range(n):\r\n s = input()\r\n cnt[len(s)] += 1\r\n\r\nbest_time = worst_time = 0\r\n\r\npass_word = input()\r\nfor i in range(len(pass_word)):\r\n best_time += cnt[i]\r\n\r\nworst_time = best_time + cnt[len(pass_word)] - 1\r\n\r\nbest_time += best_time // k 5\r\nworst_time += worst_time // k * 5\r\n\r\n\r\nprint(best_time + 1)\r\nprint(worst_time + 1)\r\n", "import bisect\r\nn,k=map(int,input().split())\r\na=[]\r\nst=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\tst.append(s)\r\n\ta.append(len(s))\r\npas=input()\r\nc=a.count(len(pas))-st.count(pas)\r\na.sort()\r\nws=bisect.bisect(a,len(pas)-1)\r\nprint((ws//k)5+ws+1,end=\" \")\r\nws+=c\r\nprint((ws//k)5+ws+1)", "n, k = map(int, input().split())\r\nPass = {}\r\nfor i in range(n):\r\n In = input()\r\n Pass[In] = len(In)\r\nCor = input()\r\nLens = list(sorted(Pass.values()))\r\nMin = (Lens.index(len(Cor)) + 1) + (Lens.index(len(Cor)) // k) * 5\r\nindex = n - list(reversed(Lens)).index(len(Cor)) - 1\r\ntime = index + 1 + (index // k * 5)\r\nprint(Min, time)\r\n", "n,k=map(int,input().split())\r\nS=[]\r\nLen=[]\r\nfor i in range(n):\r\n a=input()\r\n Len.append(len(a))\r\npw=input()\r\nLen.sort()\r\nD1=pwngan=Len.index(len(pw))\r\nD2=pwbang=Len.count(len(pw))\r\nD2+=(pwngan+pwbang-1)//k5+D1\r\nD1+=pwngan//k5+1\r\nprint(D1,D2)\r\n\r\n", "#password \r\nn,k=map(int, input().split())\r\nl=sorted(len(input()) for i in range(n))\r\nt=input()\r\nx=l.index(len(t))\r\ncount=l.count(len(t))\r\nprint(1+x+(x//k)5,x+count+((x+count-1)//k)5)", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\npa=input()\r\n\r\ncnt1=0\r\ncnt2=0\r\n\r\nfor i in l:\r\n if len(i)<len(pa):\r\n cnt1+=1\r\n if len(i)<=len(pa):\r\n cnt2+=1\r\n# print(cnt1,cnt2)\r\nprint(cnt1+(cnt1//k)5 +1,cnt2+((cnt2-1)//k)5)\r\n ", "n,k=map(int,input().split())\r\np=[]\r\nfor i in range(n):\r\n p.append(len(input()))\r\np.sort()\r\nr=len(input())\r\nl=p.index(r)\r\nm1=l+(l//k)5+1\r\nl1=p.count(r)-1\r\nl+=l1\r\nm2=l+(l//k)5+1\r\nprint(str(m1)+\" \"+str(m2))", "n,k=map(int,input().split())\r\ndata=[[] for i in range(101)]\r\nfor i in range(n):\r\n word=input()\r\n data[len(word)].append(word)\r\ncorrect=len(input())\r\ns=0\r\nfor i in range(1,correct):\r\n s=s+len(data[i])\r\nprint(s+1+s//k5,s+len(data[correct])+(s+len(data[correct])-1)//k5)\r\n\r\n", "a,b=map(int,input().split())\r\nz=[input() for _ in \" \"a]\r\nx=input()\r\nz=sorted(z,key=len)\r\np=len(x)\r\nans,ans1=0,0\r\nfor i in z:\r\n if len(i)<len(x):ans+=1;ans1+=1\r\n elif len(i)==len(x):ans1+=1\r\nans1-=1\r\nprint(1+ans+5(ans//b),1+ans1+5(ans1//b))", "n, k = map(int, input().split())\r\npws = [input() for _ in range(n)]\r\np = input()\r\n \r\nl, e = 0, 0\r\nfor i in range(n):\r\n if len(pws[i]) == len(p):\r\n e += 1\r\n elif len(pws[i]) < len(p):\r\n l += 1\r\ne -= 1\r\n \r\ntm = lambda x : (x // k) 5 + x + 1\r\nprint(tm(l), tm(l + e))", "n, k = map(int, input().split())\r\ncnt = [0] * 101\r\nfor i in range(n):\r\n\tcnt[len(input())] += 1\r\nx = len(input())\r\na = sum(cnt[:x]) #one step before beginning og required length\r\nb = sum(cnt[:x+1]) - 1 #x+1 to reach there and minus one to avoid extra time at that\r\n #position bcz once we reach there..we shud not count penalty\r\n #and game is over\r\n\r\nr1 = a // k * 5 + a + 1 #and find extra time and plus one to reach there\r\nr2 = b // k * 5 + b + 1 #find extra till b and then plus to reach there\r\nprint(r1, r2)\r\n#one thing to notice is that passwords arent repeated..\r\n#so we directly go to last and come one step back!!!!!", "def ints_get():\r\n return map(int, input().strip().split())\r\nn,k = ints_get()\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\narr.sort(key = len) \r\npsd = input()\r\nl = len(psd)\r\nlmo = 0\r\neql = 0\r\np,q= None, None\r\nfor i in range(n):\r\n if len(arr[i]) <l:\r\n lmo += 1\r\n elif len(arr[i]) == l:\r\n eql += 1\r\n\r\nif (lmo+1)%k == 0:\r\n p =((lmo+1)//k -1)(k+5) + k\r\nelse:\r\n p = ((lmo+1)//k)(k+5) + (lmo+1)%k\r\nte = lmo+eql\r\nif (te) % k == 0:\r\n q = ((te)//k - 1)(k+5) + k\r\nelse:\r\n q = ((te)//k)(k+5) + (te) % k\r\nprint(p,q) \r\n\r\n\r\n\r\n \r\n", "#Passwords\r\n\r\ncount = [0] * 105\r\nn, k = map(int, input().split())\r\nfor i in range(n):\r\n s = input()\r\n count[len(s)] += 1\r\n\r\npassword = input()\r\nsum = 0\r\nfor i in range(1, len(password)):\r\n sum += count[i]\r\n\r\n#khi tinh k_times phai - 1 so voi so luong password di qua de den password dung (tinh luon password dung)\r\n#vi du: so password la 2, k = 2, tinh k_times = 1 thi res1 = 2 + 1 * 5 = 7\r\n#dap an dung la 2 vi da ket thuc viec do tim password dung\r\nk_times = sum // k\r\nres1 = sum + 1 + k_times * 5\r\n\r\ncnt = count[len(password)]\r\nk_times = (sum + cnt - 1) // k\r\nres2 = sum + cnt + k_times * 5\r\n\r\nprint(res1, res2)", "a = input().split(\" \")\r\nn = int(a[0])\r\nk = int(a[1])\r\na = []\r\nfor i in range(n):\r\n a.append(len(input()))\r\na.sort()\r\ntar = len(input())\r\n\r\nres_min = 0\r\nres_max = 0\r\nfor i in range(n):\r\n if a[i] == tar and (i == 0 or a[i-1] != tar):\r\n t = i + 1\r\n res_min = t\r\n if (t % k == 0): res_min += (t // k - 1) * 5\r\n else: res_min += (t // k) * 5\r\n if a[i] == tar and (i == n - 1 or a[i + 1] > tar):\r\n t = i + 1\r\n res_max = t\r\n if (t % k == 0):\r\n res_max += (t // k - 1) * 5\r\n else:\r\n res_max += (t // k) * 5\r\nprint(res_min, res_max)", "# -- coding: utf-8 --\n\n\nif __name__ == '__main__':\n\n n, m = map(int, input().strip().split())\n possible_list = []\n for i in range(n):\n possible_list.append(input().strip())\n answer = input().strip()\n answer_len = len(answer)\n possible_list = filter(lambda _: len(_) <= answer_len, possible_list)\n possible_list_sorted = sorted(possible_list, key=lambda _: len(_))\n possible_list_real_len = list(filter(lambda _: len(_) == answer_len, possible_list_sorted))\n possible_list_real_len_first = possible_list_real_len[0]\n min_result = possible_list_sorted.index(possible_list_real_len_first) + 1\n max_result = min_result + len(possible_list_real_len) - 1\n # print(possible_list_sorted)\n # print(min_result, max_result)\n if min_result >= m:\n punish_min = ((min_result - 1)//m) * 5\n min_result = min_result + punish_min\n if max_result >= m:\n punish = ((max_result-1)//m) * 5\n max_result = max_result + punish\n print(min_result, max_result)\n\n\n\n \t \t\t\t\t \t\t\t \t\t\t \t\t\t \t", "n, k = map(int, input().split())\n\na = sorted(len(input()) for i in range(n))\np = len(input())\n\nt = a.index(p)\n\na, b=t, t + a.count(p)\nprint(1 + a + a // k * 5, b + (b - 1) // k * 5)", "def ll(): return list(map(int, input().split())) \r\ndef lf(): return list(map(float, input().split())) \r\ndef ls(): return list(map(str, input().split())) \r\ndef mn(): return map(int, input().split()) \r\ndef nt(): return int(input()) \r\ndef ns(): return input()\r\n\r\nfrom collections import defaultdict\r\n\r\nd = defaultdict(int)\r\nn, m = mn()\r\nfor i in range(n):\r\n d[len(ns())] +=1\r\nl = len(ns()); same=0; less=0 \r\nfor k, v in d.items():\r\n if k<l:\r\n less+=v\r\n elif k==l:\r\n same+=v\r\nprint(\r\n ((less)//m)5 + less+1,\r\n ((less+same-1)//m)5 + less + same\r\n)\r\n\r\n\r\n\r\n", "n, k = map(int,input().split())\r\ntries = []\r\nfor _ in range(n):\r\n\ttries.append(input())\r\nkey = input()\r\n\r\nbest = 0\r\nworst = 0\r\nshort = 0\r\nequal = 0\r\nx = len(key)\r\nfor i in tries:\r\n\ta = len(i)\r\n\tif a<x:\r\n\t\tshort+=1\r\n\telif a==x:\r\n\t\tequal+=1\r\n\r\ndelay = short+1\r\nif delay%k==0:\r\n\tbest = (delay//k-1)5+delay\r\nelse:\r\n\tbest = (delay//k)5+delay\r\ndelay = short+equal\r\nif delay%k==0:\r\n\tworst = (delay//k-1)5+delay\r\nelse:\r\n\tworst = (delay//k)5+delay\r\n\r\nprint(best, worst)\r\n", "n, k = map(int, input().split())\r\na = [input() for i in range(n)]\r\np = input()\r\nc = 0\r\nd = 0\r\nfor i in range(n):\r\n if len(a[i]) == len(p):\r\n d += 1\r\n if len(a[i]) < len(p):\r\n c += 1\r\n\r\nl = c + (c // k) * 5 + 1\r\nh = d + c + ((d + c - 1) // k) * 5\r\nprint(l, h)", "n, k = map(int, input().split())\n\n\nl_l = list()\nfor _ in range(n):\n l_l.append(len(input()))\n\np = len(input())\n\nh_t = 0\nl_t = 0\nfor l in l_l:\n if l < p:\n h_t += 1\n l_t += 1\n elif l == p:\n h_t += 1\nl_t += 1\nprint(\"%d %d\" % (l_t + ((l_t - 1) // k) * 5, h_t + ((h_t - 1) // k) * 5))\n\t \t \t\t\t\t \t\t\t \t\t \t\t \t\t\t", "n, k = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(len(input()))\r\nm = len(input())\r\na.sort()\r\ni = a.index(m) + 1\r\nj = n - 1\r\nwhile a[j] != m:\r\n j -= 1\r\nj += 1\r\nprint(i + (i - 1) // k * 5, j + (j - 1) // k * 5)\r\n", "n, k = map(int, input().split())\r\n\r\n# if n == k:\r\n# ans2 = k\r\n# elif n // k == 0:\r\n# ans2 = n\r\n# else:\r\n# fator = (n // k) if k != 1 else n - 1\r\n# ans2 = (fator * 5) + n\r\n # print(ans2)\r\narray = []\r\nfor i in range(n):\r\n array.append(input())\r\n\r\ncont1, cont2 = [0,0]\r\n# i = 0\r\npassword = input()\r\n# print(array)\r\nfor item in array:\r\n if (len(item) < len(password)):\r\n cont1+=1\r\n if (len(item) <= len(password)):\r\n cont2+=1\r\n\r\nprint(cont1 + (cont1//k)5 + 1, cont2 + ((cont2 - 1)//k)5)\r\n\r\n\r\n\r\n", "a=list(map(int, input().split()))\r\nn=a[0]\r\nk=a[1]\r\nl=[]\r\nr=[]\r\nfor i in range(n+1):\r\n s=input()\r\n l.append(len(s))\r\nl1=l[-1]\r\nl.pop(-1)\r\nl.sort()\r\np1=l.index(l1)\r\nl.reverse()\r\np2=n-1-l.index(l1)\r\nif k>=n:\r\n r.append(p1+1)\r\n r.append(p2+1)\r\nelse:\r\n t1=(p1+1) + p1//k * 5\r\n t2=(p2+1) + p2//k * 5\r\n r.append(t1)\r\n r.append(t2)\r\nprint(' '.join(map(str, r)))", "def main():\r\n n, k = list(map(int, input().split()))\r\n arr = [input() for _ in range(n)]\r\n correct_length = len(input())\r\n\r\n less_length_passwords, same_length_passwords = 0, 0\r\n for element in arr:\r\n check_length = len(element)\r\n if check_length == correct_length:\r\n same_length_passwords += 1\r\n elif check_length < correct_length:\r\n less_length_passwords += 1\r\n\r\n min_time = (less_length_passwords // k) * 5 + less_length_passwords + 1\r\n max_time = (\r\n ((less_length_passwords + same_length_passwords - 1) // k) * 5\r\n + less_length_passwords\r\n + same_length_passwords\r\n )\r\n\r\n print(min_time, max_time)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from itertools import count\r\n\r\n\r\ninp = input().split(' ')\r\n\r\nno_key = int(inp[0])\r\ntrial = int(inp[1])\r\n\r\nkey = list()\r\nkey_len = list()\r\n\r\nfor i in range(no_key):\r\n key.append(input())\r\n key_len.append(len(key[i]))\r\n\r\ntrue_key = input()\r\n\r\nkey.sort(key = len)\r\nkey_len.sort()\r\n\r\nif len(true_key) == key_len[0]:\r\n print(1, end = ' ')\r\n same_len = key_len.count(len(true_key))\r\n max = same_len + ((same_len - 1) // trial) * 5\r\n print(max)\r\nelse:\r\n pos = key_len.index(len(true_key))\r\n min = pos + 1 + (pos // trial) * 5\r\n print(min, end = ' ')\r\n max = key_len.count(len(true_key)) + pos + ((key_len.count(len(true_key)) + pos - 1) // trial) * 5\r\n print(max)\r\n", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List\r\n# sys.setrecursionlimit(999)\r\n\r\n\r\nn,k = map(int,input().split())\r\nd = collections.defaultdict(int)\r\nfor _ in [0]n:\r\n s = input()\r\n d[len(s)]+=1\r\np = input()\r\nw = 0\r\nfor dk in sorted(d.keys()):\r\n if dk<len(p):\r\n w+= d[dk]\r\n\r\nans1 = w+ (w//k)5+1\r\n\r\nw+= d[len(p)]-1\r\nans2 = w+(w//k)*5+1\r\nprint(ans1,ans2)\r\n\r\n\r\n " ]	{"inputs": ["5 2\ncba\nabc\nbb1\nabC\nABC\nabc", "4 100\n11\n22\n1\n2\n22", "1 1\na1\na1", "1 100\na1\na1", "2 1\nabc\nAbc\nAbc", "2 2\nabc\nAbc\nabc", "2 1\nab\nabc\nab", "2 2\nab\nabc\nab", "2 1\nab\nabc\nabc", "2 2\nab\nabc\nabc", "10 3\nOIbV1igi\no\nZS\nQM\n9woLzI\nWreboD\nQ7yl\nA5Rb\nS9Lno72TkP\nfT97o\no", "10 3\nHJZNMsT\nLaPcH2C\nlrhqIO\n9cxw\noTC1XwjW\nGHL9Ul6\nUyIs\nPuzwgR4ZKa\nyIByoKR5\nd3QA\nPuzwgR4ZKa", "20 5\nvSyC787KlIL8kZ2Uv5sw\nWKWOP\n7i8J3E8EByIq\nNW2VyGweL\nmyR2sRNu\nmXusPP0\nf4jgGxra\n4wHRzRhOCpEt\npPz9kybGb\nOtSpePCRoG5nkjZ2VxRy\nwHYsSttWbJkg\nKBOP9\nQfiOiFyHPPsw3GHo8J8\nxB8\nqCpehZEeEhdq\niOLjICK6\nQ91\nHmCsfMGTFKoFFnv238c\nJKjhg\ngkEUh\nKBOP9", "15 2\nw6S9WyU\nMVh\nkgUhQHW\nhGQNOF\nUuym\n7rGQA\nBM8vLPRB\n9E\nDs32U\no\nz1aV2C5T\n8\nzSXjrqQ\n1FO\n3kIt\nBM8vLPRB", "20 2\ni\n5Rp6\nE4vsr\nSY\nORXx\nh13C\nk6tzC\ne\nN\nKQf4C\nWZcdL\ndiA3v\n0InQT\nuJkAr\nGCamp\nBuIRd\nY\nM\nxZYx7\n0a5A\nWZcdL", "20 2\naWLQ6\nSgQ9r\nHcPdj\n2BNaO\n3TjNb\nnvwFM\nqsKt7\nFnb6N\nLoc0p\njxuLq\nBKAjf\nEKgZB\nBfOSa\nsMIvr\nuIWcR\nIura3\nLAqSf\ntXq3G\n8rQ8I\n8otAO\nsMIvr", "20 15\n0ZpQugVlN7\nm0SlKGnohN\nRFXTqhNGcn\n1qm2ZbB\nQXtJWdf78P\nbc2vH\nP21dty2Z1P\nm2c71LFhCk\n23EuP1Dvh3\nanwri5RhQN\n55v6HYv288\n1u5uKOjM5r\n6vg0GC1\nDAPYiA3ns1\nUZaaJ3Gmnk\nwB44x7V4Zi\n4hgB2oyU8P\npYFQpy8gGK\ndbz\nBv\n55v6HYv288", "3 1\na\nb\naa\naa", "6 3\nab\nac\nad\nabc\nabd\nabe\nabc", "4 2\n1\n2\n11\n22\n22", "2 1\n1\n12\n12", "3 1\nab\nabc\nabd\nabc", "2 1\na\nab\nab", "5 2\na\nb\nc\nab\naa\naa", "6 1\n1\n2\n11\n22\n111\n2222\n22", "3 1\n1\n2\n11\n11", "10 4\na\nb\nc\nd\ne\nf\nab\ncd\nac\nad\nac", "4 2\na\nb\nc\nd\na", "4 1\n1\n2\n3\n4\n4", "5 1\na\nb\nc\nd\nef\nef", "6 4\n1\n2\n22\n33\n44\n555\n555", "5 2\na\nb\nc\nd\nab\nab", "6 2\n1\n2\n3\n4\n5\n23\n23", "4 2\na\nb\naa\nbb\naa", "5 4\na\nbb\ncc\ndd\nee\nbb", "4 1\na\nb\nc\nab\nab", "7 100\na\nb\nc\nd\ne\ng\nab\nab", "6 1\na\nb\nc\nd\ne\naa\naa", "4 1\na\nas\nasd\nasde\nasde", "5 2\n1\n2\n3\n11\n22\n22", "10 2\na\nb\nc\nd\nee\nff\ngg\nhh\nii\njj\nii", "3 1\na\nab\nbc\nab", "6 4\na\nb\nc\nbb\nbc\ncc\ncc"], "outputs": ["1 15", "3 4", "1 1", "1 1", "1 7", "1 2", "1 1", "1 1", "7 7", "2 2", "1 1", "25 25", "3 11", "44 50", "36 65", "1 65", "6 25", "13 13", "9 11", "8 9", "7 7", "7 13", "7 7", "9 15", "13 19", "13 13", "12 20", "1 9", "1 19", "25 25", "11 11", "15 15", "16 16", "8 9", "2 10", "19 19", "7 7", "31 31", "19 19", "9 15", "15 30", "7 13", "4 11"]}	UNKNOWN	PYTHON3	CODEFORCES	104
91615ecf5e80dbea491e2b190588ef2c	none	Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him. The area looks like a strip of cells 1<=×<=n. Each cell contains the direction for the next jump and the length of that jump. Grasshopper starts in the first cell and follows the instructions written on the cells. Grasshopper stops immediately if it jumps out of the strip. Now Artem wants to find out if this will ever happen. The first line of the input contains a single integer n (1<=≤<=n<=≤<=100<=000) — length of the strip. Next line contains a string of length n which consists of characters "<" and ">" only, that provide the direction of the jump from the corresponding cell. Next line contains n integers di (1<=≤<=di<=≤<=109) — the length of the jump from the i-th cell. Print "INFINITE" (without quotes) if grasshopper will continue his jumps forever. Otherwise print "FINITE" (without quotes). Sample Input 2 >< 1 2 3 >>< 2 1 1 Sample Output FINITE INFINITE	[ "n = int(input())\ns = str(input())\nL = list(map(int, input().split()))\nD = [0 for _ in range(n)]\nr = 0\nok = 1\nwhile r >= 0 and r < n:\n if D[r]:\n ok = 0\n break\n else:\n D[r] = 1\n if s[r] == \"<\":\n r = r - L[r]\n else:\n r = r + L[r]\nif ok:\n print(\"FINITE\")\nelse:\n print(\"INFINITE\")\n", "n = int(input())\r\nstr = input()\r\ninp = list(map(int, input().split()))\r\n\r\nfor i in range(len(str)):\r\n if str[i] == '<':\r\n inp[i] = -1\r\n\r\nvisited = [0 for i in range(n)]\r\n\r\ncur = 0\r\n\r\nwhile cur >= 0 and cur < n and visited[cur] != 1:\r\n visited[cur] = 1\r\n cur += inp[cur]\r\n\r\nif cur >= 0 and cur < n:\r\n print(\"INFINITE\")\r\nelse:\r\n print(\"FINITE\")", "ans = 0\r\nn = int(input())\r\nS = list(input())\r\nl = list(map(int , input().split()))\r\nfor i in range(n+1):\r\n\r\n if S[ans] =='>':\r\n ans += l[ans]\r\n else :\r\n ans-=l[ans]\r\n if ans not in range(n):\r\n print('FINITE')\r\n break\r\n \r\n \r\nelse:\r\n print('INFINITE')", "n = int(input())\r\ndirection = list(input())\r\ntempstep = input().split(' ')\r\n\r\nstep = []\r\nswitch = [0] n\r\n\r\nfor i in range(n):\r\n\tif direction[i] == \">\":\r\n\t\tstep.append(int(tempstep[i]))\r\n\telif direction[i] == \"<\":\r\n\t\tstep.append((-1) * int(tempstep[i]))\r\n\r\ncurrent = 0\r\n\r\nwhile True:\r\n\tswitch[current] = 1\r\n\tcurrent = current + step[current]\r\n\tif current < 0 or current >= n:\r\n\t\tprint(\"FINITE\")\r\n\t\tbreak\r\n\tif switch[current] == 1:\r\n\t\tprint(\"INFINITE\")\r\n\t\tbreak\r\n", "n = int(input())\r\ns = input(); a = len(s)\r\nj = list(map(int, input().split()))\r\nx = 1\r\nb = 'INFINITE'\r\ntmp = 0\r\nwhile tmp < n:\r\n\tif s[x-1] == '>':\r\n\t\tx += j[x-1]\r\n\t\tif x > n:\r\n\t\t\tb = 'FINITE'; break\r\n\telif s[x-1] == '<':\r\n\t\tx -= j[x-1]\r\n\t\tif x <= 0:\r\n\t\t\tb = 'FINITE'; break\r\n\ttmp += 1\r\nprint(b)", "num=int(input())\r\nl=input()\r\nsteps=list(map(int,input().split()))\r\nlights=[False]num\r\ni=0\r\n\r\nwhile(i<num and i>=0):\r\n if lights[i]==True:\r\n print('INFINITE') \r\n break\r\n lights[i]=True\r\n if l[i]=='>':\r\n i=i+steps[i]\r\n else:\r\n i=i-steps[i] \r\nelse:\r\n print('FINITE')", "line_length = int(input())\r\ndirections = input()\r\ndistances = [int(distance) for distance in input().split()]\r\nvisited_cells = set()\r\ncurrent_cell = 0\r\nwhile 0 <= current_cell < line_length:\r\n if current_cell in visited_cells:\r\n break\r\n else:\r\n visited_cells.add(current_cell)\r\n if directions[current_cell] == '>':\r\n current_cell += distances[current_cell]\r\n else:\r\n current_cell -= distances[current_cell]\r\nif 0 <= current_cell < line_length:\r\n print(\"INFINITE\")\r\nelse:\r\n print(\"FINITE\")\r\n ", "n = int(input())\r\nl = [1 if x == \">\" else -1 for x in input()]\r\nc = list(map(int, input().split()))\r\nfor i in range(len(c)):\r\n l[i] = c[i]\r\nret = True\r\ni = 0\r\nvis = {i}\r\nwhile True:\r\n if i < 0 or i >= n:\r\n ret = False\r\n break\r\n i += l[i]\r\n if i in vis:\r\n ret = True\r\n break\r\n vis.add(i)\r\nif ret:\r\n print(\"INFINITE\")\r\nelse:\r\n print(\"FINITE\")\r\n", "n = int(input())\r\ns = list(map(lambda x: 1 if x == '>' else -1, input().strip()))\r\nd = list(map(int, input().strip().split()))\r\nb = [False for _ in range(n)]\r\n\r\nc = 0\r\nwhile True:\r\n c += s[c] * d[c]\r\n if c >= n or c < 0:\r\n print('FINITE')\r\n exit()\r\n if b[c]:\r\n print('INFINITE')\r\n exit()\r\n b[c] = True\r\n", "l=int(input())\r\ns=input()\r\nj=list(map(int, input().split()))\r\nf=\"INFINITE\"\r\nk=0\r\ni=0\r\nwhile i<l :\r\n k=k+(j[k](s[k]==\">\")-j[k](s[k]==\"<\"))\r\n if k>=l or k<0:\r\n f=\"FINITE\"\r\n i=l\r\n i=i+1\r\nprint(f)\r\n", "def task():\r\n ln = int(input())\r\n s = input()\r\n d = [int(i) for i in input().split()]\r\n n = len(d)\r\n a = [0 for i in range(n)]\r\n i = 0\r\n while (i > -1 and i < n):\r\n if s[i] == \">\":\r\n if a[i] == 0:\r\n a[i] = 1\r\n i += d[i]\r\n else:\r\n print(\"INFINITE\")\r\n return\r\n else:\r\n if a[i] == 0:\r\n a[i] = 1\r\n i -= d[i]\r\n else:\r\n print(\"INFINITE\")\r\n return\r\n print(\"FINITE\")\r\n\r\ntask()\r\n", "n = int(input())-1\r\ns = input()\r\nd = [int(i) for i in input().split()]\r\nc = True\r\ncnt = 0\r\ni = 0\r\nz = 0\r\nwhile i<=n and i>=0:\r\n\tif s[i]:\r\n\t\tif s[i]==\">\":\r\n\t\t\ti+=d[i]\r\n\t\t\tz+=1\r\n\t\telif s[i]==\"<\":\r\n\t\t\ti-=d[i]\r\n\t\t\tz+=1\r\n\telse:\r\n\t\tbreak\r\n\tif z>=2n:c=False;break\r\nif i>n or i<0:\r\n\tprint(\"FINITE\")\r\nelse:\r\n\tprint(\"INFINITE\")", "\r\nn = int(input())\r\ns = input()\r\narr = list(map(int, input().split()))\r\n\r\nseen = set()\r\n\r\ncurrent_index = 0\r\n\r\nwhile True:\r\n command = s[current_index]\r\n step = arr[current_index]\r\n if command == \">\":\r\n current_index += step\r\n else:\r\n current_index -= step\r\n # print(current_index)\r\n if current_index > n-1 or current_index < 0:\r\n # print(current_index)\r\n print(\"FINITE\")\r\n exit()\r\n else:\r\n if current_index in seen:\r\n print(\"INFINITE\")\r\n exit()\r\n seen.add(current_index)\r\n", "import math \r\n\r\ndef solve():\r\n\r\n\tn = int(input())\r\n\ts = input()\r\n\ta = list(map(int, input().split()))\r\n\r\n\tidx = 0\r\n\tvisited = [False for i in range(n)]\r\n\r\n\twhile idx >= 0 and idx < n:\r\n\r\n\t\tif visited[idx] == True:\r\n\t\t\tprint(\"INFINITE\")\r\n\t\t\treturn\r\n\r\n\t\tvisited[idx] = True\r\n\r\n\t\tif s[idx] == '>':\r\n\t\t\tidx += a[idx]\r\n\t\telse:\r\n\t\t\tidx -= a[idx]\r\n\r\n\tprint(\"FINITE\")\r\n\r\nfor _ in range(1):\r\n\tsolve()", "n = int(input())\ndir = list(map(lambda x : 1 if x == '>' else -1, input()))\ndist = list(map(int, input().split()))\nvis = [False for _ in range(n)]\n\ncell = 0\nwhile cell >= 0 and cell < n and not vis[cell]:\n vis[cell] = True\n cell += dist[cell] dir[cell]\nprint('FINITE' if cell < 0 or cell >= n else 'INFINITE')\n", "# python3\n# utf-8\n\nfield_size = int(input())\nfield_idx___dir = input()\nfield_idx___jump_len = [int(x) for x in input().split()]\n\nfield_idx___was_visited = [False for x in range(field_size)]\n\ncurr_field_idx = 0\nwhile 0 <= curr_field_idx < field_size:\n if field_idx___was_visited[curr_field_idx]:\n print('INFINITE')\n quit()\n field_idx___was_visited[curr_field_idx] = True\n if field_idx___dir[curr_field_idx] == '>':\n curr_field_idx += field_idx___jump_len[curr_field_idx]\n else:\n curr_field_idx -= field_idx___jump_len[curr_field_idx]\nprint('FINITE')\n", "n = int(input())\r\ns = list(input())\r\nd = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if s[i] == '<':\r\n d[i] = -d[i]\r\n\r\nused = [0] * n\r\ncur = 0\r\nwhile 0 <= cur < n and not used[cur]:\r\n used[cur] = 1\r\n cur += d[cur]\r\n\r\nif 0 <= cur < n:\r\n print('INFINITE')\r\nelse:\r\n print('FINITE')\r\n", "n=int(input())\r\nv=input()\r\njmp=list(map(int, input().split()))\r\nk=0\r\ni=0\r\nwhile True:\r\n if v[i]=='>':\r\n i+=jmp[i]\r\n k+=1\r\n else:\r\n i-=jmp[i]\r\n k+=1\r\n if i<0 or i>n-1:\r\n print('FINITE')\r\n break\r\n if k>n:\r\n print('INFINITE')\r\n break\r\n", "import os\r\nimport sys\r\nimport math\r\nimport heapq\r\nfrom decimal import \r\nfrom io import BytesIO, IOBase\r\nfrom collections import defaultdict, deque\r\n\r\ndef r():\r\n return int(input())\r\ndef rm():\r\n return map(int,input().split())\r\ndef rl():\r\n return list(map(int,input().split()))\r\n\r\nn = r()\r\na = input()\r\nb = rl()\r\nvisited = defaultdict(bool)\r\n\r\ni=0\r\nans = True\r\nwhile True:\r\n if visited[i]:\r\n break\r\n if a[i]=='>':\r\n dist = i+b[i]\r\n else:\r\n dist = i-b[i]\r\n visited[i]=True\r\n if dist < 0 or dist >= n:\r\n ans = False\r\n break\r\n i = dist\r\nif not ans:\r\n print(\"FINITE\")\r\nelse:\r\n print(\"INFINITE\")\r\n", "n=int(input())\r\ndir=input()\r\nstep=list(map(int,input().split()))\r\nk=0\r\ni=0\r\nwhile True:\r\n if dir[i]=='>':\r\n i+=step[i]\r\n k+=1\r\n else:\r\n i-=step[i]\r\n k+=1\r\n if i<0 or i>n-1:\r\n print('FINITE')\r\n break\r\n if k>n:\r\n print('INFINITE')\r\n break", "n = int(input())\r\nsteps = input()\r\nstep_qty = list(map(int,input().split()))\r\nbool_steps = [False] n\r\n\r\ni = 0\r\n\r\nwhile(i < n and i >= 0):\r\n if bool_steps[i] == True:\r\n print('INFINITE')\r\n break\r\n bool_steps[i] = True\r\n if steps[i] == '>':\r\n i += step_qty[i]\r\n else:\r\n i -= step_qty[i]\r\nelse:\r\n print('FINITE')\r\n", "n=int(input())\r\ns=input()\r\nl=list(map(int,input().split()))\r\nd={}\r\ni=0\r\nwhile True:\r\n if d.get(i,0): print('INFINITE'); break\r\n if s[i]=='>':\r\n if l[i]+i>=n:\r\n print('FINITE')\r\n break\r\n d[i]=1\r\n i+=l[i]\r\n else:\r\n if i-l[i]<0:\r\n print('FINITE')\r\n break\r\n d[i]=1\r\n i-=l[i]", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\nw = list(map(int, input().split()))\r\n\r\nc = 0\r\ni = 0\r\nd = [0]100000\r\nwhile True:\r\n if s[i] == '>':\r\n c += w[i]\r\n i = c\r\n else:\r\n c -= w[i]\r\n i = c\r\n if i < 0 or i > n-1:\r\n print(\"FINITE\")\r\n break\r\n else:\r\n if d[i] == 0:\r\n d[i] = 1\r\n else:\r\n print(\"INFINITE\")\r\n break", "import sys\nfrom bisect import bisect_left\ndef second():\n inp = sys.stdin.readline()\n n = int(inp)\n inp = sys.stdin.readline()\n line = []n\n for i in range(n):\n cur = []\n cur.append(inp[i])\n cur.append(0)\n cur.append(0)\n line.append(cur)\n inp = sys.stdin.readline().strip().split(' ')\n for i in range(n):\n line[i][1] = int(inp[i])\n pos = 0\n line[0][2] = 1\n for i in range(n):\n if(line[pos][0] == '>'):\n pos += line[pos][1]\n else:\n pos -= line[pos][1]\n if(pos >= n or pos < 0):\n print('FINITE')\n break\n if(line[pos][2] == 1):\n print('INFINITE')\n break\n line[pos][2] = 1\n\nsecond()", "n = int(input())\r\ns = input()\r\na = list(map(int, input().split()))\r\nf = True\r\nb = [0] * len(a)\r\ni = 0\r\nwhile(f):\r\n if b[i] == 1:\r\n f = False\r\n b[i] = 1\r\n if s[i] == \">\":\r\n i+=a[i]\r\n else:\r\n i-=a[i]\r\n if(i>=n or i<0):\r\n break\r\n \r\nif f:\r\n print(\"FINITE\")\r\nelse:\r\n print(\"INFINITE\")\r\n", "a=int(input())\r\nb=input()\r\nc=list(map(int,input().split()))\r\nvis=[0]a\r\ni=0\r\nwhile True:\r\n if i<0 or i>=a:print('FINITE');exit()\r\n if vis[i]==1:break\r\n vis[i]=1\r\n if b[i]=='>':i+=c[i]\r\n else:i-=c[i]\r\n \r\nprint('INFINITE')\r\n", "def main():\n n = int(input())\n l = [j - i if c == \"<\" else j + i for c, i, j in zip(input(), map(int, input().split()), range(n))]\n v, i = [True] n, 0\n while 0 <= i < n:\n if v[i]:\n v[i] = False\n else:\n print(\"INFINITE\")\n return\n i = l[i]\n print(\"FINITE\")\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\nrow = [0](n+1)\r\nrow[1] = 1\r\ndire = input()\r\nsize_j = list(map(int,input().split()))\r\nnow_cell = 1\r\nwhile True:\r\n if dire[now_cell-1] == \">\":\r\n now_cell += size_j[now_cell-1]\r\n else:\r\n now_cell -= size_j[now_cell-1]\r\n\r\n if now_cell > n or now_cell < 1:\r\n print(\"FINITE\")\r\n break\r\n\r\n if row[now_cell] == 1:\r\n print(\"INFINITE\")\r\n break\r\n \r\n row[now_cell] = 1\r\n \r\n", "pos, visited = 1, set()\r\nn = int(input())\r\nmoves = input()\r\nlst = list(map(int, input().split()))\r\nwhile True:\r\n sgn = +1 if moves[pos-1] == \">\" else -1\r\n pos += lst[pos-1] sgn\r\n if pos < 1 or pos > n:\r\n print(\"FINITE\")\r\n break\r\n if pos in visited:\r\n print(\"INFINITE\")\r\n break\r\n visited.add(pos)", "n = int(input())\r\ns = input()\r\nl = list(map(int, input().split()))\r\n\r\nx = []\r\np, t = 1, \"FINITE\"\r\n\r\nwhile 1 <= p <= n:\r\n\tx.append(p)\r\n\t\r\n\tif s[p - 1] == \">\":\r\n\t\tp += l[p - 1]\r\n\telse:\r\n\t\tp -= l[p - 1]\r\n\t\t\r\n\tif p in x:\r\n\t\tt = \"INFINITE\"\r\n\t\tbreak\r\n\t\t\t\t\r\nprint(t)\r\n\t\t", "n=int(input())\r\ns=input()\r\nl=list(map(int,input().split()))\r\nL=[0 for i in range(n)]\r\ni=0\r\nwhile (True):\r\n if L[i]==-1 :\r\n print(\"INFINITE\")\r\n exit()\r\n L[i]=-1\r\n if s[i]==\">\" :\r\n i+=l[i]\r\n else :\r\n i-=l[i]\r\n if i<=-1 or i>=n :\r\n print(\"FINITE\")\r\n exit()\r\n \r\n \r\n \r\n", "n=int(input())\n\na=input() #string input\ncount=0\nflag=0\n\n\n\nb=[int(r) for r in input().split()]\n\n#b=input().split()\n\ni=int()\nfor i in range(0,n,1):\n if i==0:\n if a[i]=='>':\n count=count+b[i]\n else:\n count=count-b[i]\n\n elif a[count]=='>':\n count+=b[count]\n else:\n count-=b[count];\n\n if count>=n or count<0:\n flag=1\n break\n\nif flag==1:\n print(\"FINITE\")\nelse:\n print(\"INFINITE\")\n\n\t \t\t\t\t\t\t \t\t \t \t \t\t\t \t \t", "n = int(input())\r\nb = [True] * n\r\ns = input()\r\na = list(map(int, input().split()))\r\nfor i in range(len(s)):\r\n if s[i] == '<':\r\n a[i] = -1\r\nk = 0\r\nwhile 0 <= k <= n - 1 and b[k]:\r\n b[k] = False\r\n k += a[k]\r\nif 0 <= k <= n - 1:\r\n print('INFINITE')\r\nelse:\r\n print('FINITE')\r\n", "import sys\n\ninp = int(input())\n\ndirecs = input()\n\ndirec = []\ndirec.append(0)\nfor i in direcs:\n direc.append(i)\n\nlengs = input().split(\" \")\nleng = []\nleng.append(0)\nfor i in lengs:\n leng.append(i)\n\nalls = list(zip(direc, leng))\n\ntrace = {}\nthru = False\nact = 1\n\nwhile 0 < act <= inp:\n if alls[act][0] == \"<\":\n act -= int(alls[act][1])\n else:\n act += int(alls[act][1])\n if act in trace:\n print(\"INFINITE\")\n sys.exit()\n else:\n trace[act] = None\nprint(\"FINITE\")\n", "if __name__ == '__main__':\n n = int(input())\n d = input()\n w = [int(i) for i in input().split()]\n visited = set()\n i = 0\n while (i not in visited) and (i < n) and (i > -1):\n visited.add(i)\n if d[i] == '>':\n i += w[i]\n else:\n i -= w[i]\n if (i >= 0) and (i < n):\n print('INFINITE')\n else:\n print('FINITE')", "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\ns = list(S())\r\nstep = II()\r\nvisited = [False] n\r\nnow = 0\r\nwhile True:\r\n if visited[now]:\r\n p(\"INFINITE\")\r\n exit(0)\r\n visited[now] = True\r\n if s[now] == '<':\r\n now -= step[now]\r\n else:\r\n now += step[now]\r\n if now < 0 or now >= n:\r\n break\r\np(\"FINITE\")", "# reading input\r\na=int(input())\r\nb=input()\r\nc=list(map(int,input().split()))\r\n\r\n#initializing\r\nvis=[0]a\r\ni=0\r\nans = False\r\n\r\nwhile True:\r\n if i<0 or i>=a: ans = True; break;\r\n if vis[i]==1:break\r\n vis[i]=1\r\n if b[i]=='>':i+=c[i]\r\n else:i-=c[i]\r\n\r\nif(ans): \r\n\tprint('FINITE')\r\nelse:\r\n\tprint('INFINITE')", "n=int(input())\r\nc=[0]n\r\nb=input()\r\na=list(map(int,input().split()))\r\nk=0\r\nwhile True:\r\n if c[k]==0:\r\n c[k]=1\r\n else:\r\n print(\"INFINITE\")\r\n break\r\n if b[k]==\">\":\r\n k+=a[k]\r\n if k>=n:\r\n print(\"FINITE\")\r\n break\r\n else:\r\n k-=a[k]\r\n if k<0:\r\n print(\"FINITE\")\r\n break\r\n \r\n", "\r\n\r\n\r\nif __name__=='__main__':\r\n n = int(input())\r\n st = input()\r\n dd = list(map(int,input().split()))\r\n vis = [False for i in range(n)]\r\n i = 0\r\n inf = False\r\n while True:\r\n if i>=n or i<0:\r\n #print(\"break\")\r\n break\r\n if vis[i]:\r\n inf = True\r\n break\r\n else:\r\n vis[i]=True\r\n \r\n if st[i]=='>':\r\n i+=dd[i]\r\n else:\r\n i-=dd[i]\r\n \r\n #print(\"i-> \",i)\r\n if inf:\r\n print(\"INFINITE\")\r\n else:\r\n print(\"FINITE\")\r\n", "n=int(input())\r\nl=list(input())\r\nm=list(map(int,input().split())) \r\na=0\r\nflag=0\r\nfor i in range(n):\r\n\tif(l[a]==\"<\"):\r\n\t\ta-=m[a]\r\n\telse:\r\n\t\ta+=m[a]\r\n\tif(a>=n or a<0):\r\n\t\tflag=1\r\n\t\tbreak\r\nif(flag==1):\r\n\tprint(\"FINITE\")\r\nelse:\r\n\tprint(\"INFINITE\")", "class graph():\r\n def __init__(self,n,v):\r\n self.G=dict()\r\n for i in range(1,n+1):\r\n self.G.update([(i,set())])\r\n self.v=v\r\n self.length=n\r\n def AppendEdge(self,a):\r\n self.G[a[0]].add(a[1])\r\n if not self.v:\r\n self.G[a[1]].add(a[0])\r\n def ShowAdjacent(self,a):\r\n return self.G[a]\r\n def ShowLength(self):\r\n return self.length\r\n def Show(self):\r\n print(self.G)\r\n\r\nn=int(input())\r\ns=input()\r\nf=[int(z) for z in input().split()]\r\n##G=graph(n+2,1)\r\nVis=[0]n\r\nk=1\r\ni=0\r\nVis[0]=1\r\nwhile k!=0:\r\n\tif s[i]=='>':\r\n\t\tt=i+f[i]\r\n\t\tif t>=n:\r\n\t\t\tprint('FINITE')\r\n\t\t\tk=0\r\n\t\telif Vis[t]:\r\n\t\t\tprint('INFINITE')\r\n\t\t\tk=0\r\n\t\telse:\r\n\t\t\tVis[t]=1\r\n\t\t\ti=t\r\n\telse:\r\n\t\tt=i-f[i]\r\n\t\tif t<0:\r\n\t\t\tprint('FINITE')\r\n\t\t\tk=0\r\n\t\telif Vis[t]:\r\n\t\t\tprint('INFINITE')\r\n\t\t\tk=0\r\n\t\telse:\r\n\t\t\tVis[t]=1\r\n\t\t\ti=t", "def read_ints():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\ndef main():\r\n n = read_ints()[0]\r\n directions = input()\r\n distances = read_ints()\r\n\r\n visited = [False] n\r\n current = 0\r\n while not visited[current]:\r\n visited[current] = True\r\n if directions[current] == '<':\r\n current -= distances[current]\r\n else:\r\n current += distances[current]\r\n if current < 0 or current >= n:\r\n break\r\n\r\n if current < 0 or current >= n:\r\n print(\"FINITE\")\r\n else:\r\n print(\"INFINITE\")\r\n\r\nmain()\r\n", "def main():\n n = int(input())\n s = input()\n a = list(map(int, input().split()))\n curr = 0\n was = set()\n while 0 <= curr <= n - 1:\n if curr in was:\n print(\"INFINITE\")\n exit()\n was.add(curr)\n if s[curr] == '>':\n curr += a[curr]\n else:\n curr -= a[curr]\n print(\"FINITE\")\n\nmain()", "n = int(input())\r\ns = input()\r\nd = list(map(int, input().split()))\r\n\r\nk = [False]n\r\ni = 0\r\ninf = False\r\nwhile not inf and i >= 0 and i < n:\r\n\tif not k[i]:\r\n\t\tk[i] = True\r\n\telse:\r\n\t\tinf = True\r\n\t\r\n\tif s[i] == '<':\r\n\t\ti -= d[i]\r\n\telse:\r\n\t\ti += d[i]\r\n\r\nif inf:\r\n\tprint(\"INFINITE\")\r\nelse:\r\n\tprint(\"FINITE\")\r\n\t", "n = int(input())\n\ns = input()\n\narr = list(map(int, input().split()))\n\nk = 0\nst = {0}\n\nwhile True:\n if s[k] == '>':\n k += arr[k]\n else:\n k -= arr[k]\n if k in st:\n print('INFINITE')\n exit()\n st.add(k)\n if k >= n or k < 0:\n break\n\nprint('FINITE')\n", "_ = int(input())\ndir = list(map(lambda x: (-1 if x == '<' else 1), input()))\nval = list(map(int, input().split(' ')))\nparent = {0: None}\npos = val[0]dir[0]\nwhile True:\n\tif pos<0 or pos >= len(dir):\n\t\tprint('FINITE')\n\t\tbreak\n\telse:\n\t\tif pos not in parent:\n\t\t\tparent[pos] = None\n\t\t\tif dir[pos] > 0:\n\t\t\t\tpos += val[pos]\n\t\t\telse:\n\t\t\t\tpos -= val[pos]\n\t\telse:\n\t\t\tprint(\"INFINITE\")\n\t\t\tbreak\n", "n = int(input())\r\ns = input()\r\np = 0\r\nk = 0\r\na = list(map(int, input().split()))\r\nfor i in range(2 * n):\r\n if s[p] == '>':\r\n p += a[p]\r\n else:\r\n p -= a[p]\r\n if (p > n - 1) or (p < 0):\r\n print(\"FINITE\")\r\n k = 1\r\n break\r\nif not k:\r\n print(\"INFINITE\")", "n = int(input())\r\ns = list(1 if x == '>' else -1 for x in input())\r\nl = list(map(int, input().split()))\r\nsumm = 1\r\ncur = 0\r\nnext = 0\r\nfor i in range(n):\r\n if cur < 0 or cur > n - 1:\r\n print('FINITE')\r\n exit()\r\n if l[cur] == 0:\r\n print('INFINITE')\r\n exit()\r\n next += l[cur] * s[cur]\r\n l[cur] = 0\r\n cur = next\r\nprint('INFINITE' if 0 <= cur < n else 'FINITE')", "n = int(input())\r\ns = input()\r\na = [int(x) for x in input().split()]\r\nv = [0]n\r\nv[0] = 1\r\npos = 0\r\nwhile(True):\r\n if s[pos] == \">\":\r\n pos += a[pos]\r\n else:\r\n pos -= a[pos]\r\n if pos < 0 or pos >= n:\r\n print(\"FINITE\")\r\n break\r\n if v[pos] == 1:\r\n print(\"INFINITE\")\r\n break\r\n v[pos] = 1\r\n \r\n", "n = int(input())\r\ns = input()\r\nv = [int(i) for i in input().split(' ')]\r\nused = set()\r\ncurr = 0\r\nwhile True:\r\n if curr in used:\r\n print('INFINITE')\r\n break\r\n used.add(curr)\r\n curr += (v[curr])(1 if s[curr]=='>' else -1)\r\n if curr<0 or curr>=n:\r\n print('FINITE')\r\n break\r\n\r\n", "n = int(input())\nd = input()\ns = [int(i) for i in input().split()]\nres = \"INFINITE\"\np = 0\nfor _ in range(n):\n p += (1 if d[p] == \">\" else -1) * s[p]\n if p >= n or p < 0:\n res = \"FINITE\"\n break\nprint(res)\n", "n = int(input())\ncells = input()\nlengths = list(map(int, input().split()))\nvisited = set()\ni = 0\nwhile (i not in visited) and (i < n) and (i > -1):\n\tvisited.add(i)\n\tif cells[i] == '>':\n\t\ti += lengths[i]\n\telse:\n\t\ti -= lengths[i]\n\t#print('new', i)\n\t\nif (i < n) and (i >= 0):\n\tprint(\"INFINITE\")\nelse:\n\tprint(\"FINITE\")\n\t\n", "n=int(input())\na=input()\nd=map(int,input().split()),\nx=0\nv=[1,-1]\nfor i in range(n+1):\n x+=v[a[x]=='<']d[x]\n if x<0 or x>=n:break\nprint('IN'(i>=n)+'FINITE')\n\t \t\t \t\t \t \t\t \t \t\t \t\t \t", "n = int(input())\r\ns = input()\r\na = list(map(int, input().split()))\r\nused = [0] n\r\nd = 0\r\nused[0] = 1\r\nfor i in range(n + 1):\r\n d = d + (-1) ** int(s[d] == '<') * a[d]\r\n if d < 0 or n <= d:\r\n print('FINITE')\r\n exit()\r\n else:\r\n if used[d] == 1:\r\n print('INFINITE')\r\n exit()\r\n else:\r\n used[d] = 1\r\n\r\n", "#\"from dust i have come, dust i will be\"\n\nn=int(input())\ns=str(input())\n\na=list(map(int,input().split()))\n\nvis=[0]n\n\ni=0\nwhile 1:\n\n if i<0 or i>=n:\n print(\"FINITE\")\n exit(0)\n\n if vis[i]==1:\n print(\"INFINITE\")\n exit(0)\n\n else:\n vis[i]=1\n if s[i]=='>':\n i+=a[i]\n else:\n i-=a[i]\n\n \t\t \t\t\t\t \t \t \t\t\t \t \t", "n = int(input())\r\ns = input()\r\nnum = list(map(int, input().split()))\r\npos = 0\r\nb = [True] n\r\nwhile n > pos >= 0 and b[pos]:\r\n b[pos] = False\r\n if s[pos] == \">\":\r\n pos += num[pos]\r\n else:\r\n pos -= num[pos]\r\nif n > pos >= 0:\r\n print(\"INFINITE\")\r\nelse:\r\n print(\"FINITE\")", "n = int(input())\r\nsign = input()\r\ndist = [int(x) for x in input().split()]\r\n\r\ncurrentCell = 1\r\nfinite = True\r\nwhile 1:\r\n\tif (currentCell < 1 or currentCell > n):\r\n\t\tfinite = True\r\n\t\tbreak\r\n\tif (dist[currentCell - 1] == -1):\r\n\t\tfinite = False\r\n\t\tbreak\r\n\tdistance = dist[currentCell - 1]\r\n\tdist[currentCell - 1] = -1\r\n\tif sign[currentCell - 1] == '>':\t\r\n\t\tcurrentCell += distance\r\n\telse:\r\n\t\tcurrentCell -= distance\r\nif finite:\r\n\tprint(\"FINITE\")\r\nelse:\r\n\tprint(\"INFINITE\")\r\n", "n = int(input())\ndirect = list(input())\nlength = list(map(int, input().split()))\n\nused = [0] * n\n\ncell = 0\nwhile True:\n if used[cell]:\n ans = 'INFINITE'\n break\n else:\n used[cell] = 1\n if direct[cell] == '>':\n if cell + length[cell] < n:\n cell += length[cell]\n else:\n ans = 'FINITE'\n break\n else:\n if cell - length[cell] >= 0:\n cell -= length[cell]\n else:\n ans = 'FINITE'\n break\n\nprint(ans)\n", "n = int(input())\ns = input()\no = [int(i) for i in input().split()]\ni = 0\nwhile o[i]:\n\tif s[i] == \"<\":\n\t\tk = i\n\t\ti-=o[i]\n\t\to[k] = 0\n\telse:\n\t\tk = i\n\t\ti+=o[i]\n\t\to[k] = 0\n\tif i>=n or i<0:\n\t\tprint(\"FINITE\")\n\t\tbreak\nelse:\n\tprint(\"INFINITE\")\n\t\n", "def solve(n, data, num):\r\n cur = 0\r\n res = []\r\n for i in range(n):\r\n res.append([data[i],0])\r\n while (cur >= 0) and (cur < n):\r\n res[cur][1] += 1\r\n if res[cur][1] == 2:\r\n return 'INFINITE'\r\n if res[cur][0] == '>':\r\n cur += num[cur]\r\n else:\r\n cur -= num[cur]\r\n return 'FINITE'\r\n \r\nn = int(input())\r\ndata = input()\r\nnum = [int(x) for x in input().split()]\r\n\r\nprint(solve(n, data, num))", "n = int(input())\r\ndirs = input()\r\nlens = list(map(int, input().split(' ')))\r\ncur = 0\r\nvisited = set()\r\nwhile True:\r\n visited.add(cur)\r\n goto = cur\r\n if dirs[cur] == '<':\r\n goto = cur - lens[cur]\r\n else:\r\n goto = cur + lens[cur]\r\n if goto in visited:\r\n print('INFINITE')\r\n break\r\n if goto < 0 or goto > n-1:\r\n print('FINITE')\r\n break\r\n cur = goto\r\n", "n=int(input())\r\na=input()\r\nb=[int(i) for i in input().split()]\r\ni=0\r\ntemp=0\r\nwhile True:\r\n if i < 0 or i >= n:\r\n print(\"FINITE\")\r\n break\r\n if b[i]==0:\r\n print(\"INFINITE\")\r\n break\r\n temp=b[i]\r\n if a[i]=='<':\r\n temp=-1temp\r\n b[i]=0\r\n i+=temp", "class CodeforcesTask641ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.directions = []\n self.jump_lengths = []\n\n def read_input(self):\n self.n = int(input())\n self.directions = input()\n self.jump_lengths = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n jumps = 0\n pos = 1\n out = False\n while jumps < self.n 10 and not out:\n jumps += 1\n pos += (-1 if self.directions[pos - 1] == \"<\" else 1) * self.jump_lengths[pos - 1]\n if pos < 1 or pos > self.n:\n out = True\n self.result = \"FINITE\" if out else \"INFINITE\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask641ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n=int(input())\r\ns=input()\r\na=list(map(int,input().split()))\r\nf=n[False]\r\ni,j=0,0\r\nwhile True:\r\n # print(i,f[i])\r\n if i<0 or i>=n or n==1:\r\n print(\"FINITE\")\r\n break\r\n elif f[i]==True:\r\n print(\"INFINITE\")\r\n break\r\n else: \r\n f[i]=True\r\n if s[i]=='>':\r\n i+=a[i]\r\n else:\r\n i-=a[i]\r\n\r\n\r\n", "n=int(input())\r\ns=list(input())\r\na=list(map(int,input().split()))\r\nf=[0]n\r\nx=0\r\nwhile(not f[x]):\r\n f[x]=1\r\n if(s[x]=='<'):\r\n x-=a[x]\r\n else:\r\n x+=a[x]\r\n if(x<0 or x>=n):\r\n print(\"FINITE\")\r\n exit()\r\nprint(\"INFINITE\")\r\n", "n=int(input())\r\ns=input()\r\nl=list(map(int, input().split()))\r\nx=1\r\nb='INFINITE'\r\nt=0\r\nfor i in range(n):\r\n\tif s[x-1]=='>':\r\n\t\tx += l[x-1]\r\n\t\tif x > n:\r\n\t\t\tb='FINITE'\r\n\t\t\tbreak\r\n\telif s[x-1]=='<':\r\n\t\tx -= l[x-1]\r\n\t\tif x <= 0:\r\n\t\t\tb = 'FINITE'\r\n\t\t\tbreak\r\nprint(b)", "tc=int(input())\r\nbruh=str(input())\r\nd=list(map(int,input().split()))\r\npogset=set({})\r\nbruhset=set({})\r\npog=True\r\ni=0\r\nwhile(i>=0 or i<=tc-1):\r\n if(bruh[i]==\">\"):\r\n pogset.add(i)\r\n if(len(pogset)==len(bruhset)):\r\n pog=False\r\n break\r\n else:\r\n bruhset.add(i)\r\n i=i+d[i]\r\n if(i>tc-1):\r\n break\r\n if(bruh[i]==\"<\"):\r\n pogset.add(i)\r\n if(len(pogset)==len(bruhset)):\r\n pog=False\r\n break\r\n else:\r\n bruhset.add(i)\r\n i=i-d[i]\r\n if(i<0):\r\n break\r\nif(pog):\r\n print(\"FINITE\")\r\nelse:\r\n print(\"INFINITE\")\r\n", "import math\r\ndef main_function():\r\n n = int(input())\r\n s = input()\r\n a = [int(i) for i in input().split(\" \")]\r\n current_position = 0\r\n hash = [0 for i in range(100000)]\r\n while True:\r\n if current_position < 0 or current_position > n - 1:\r\n print(\"FINITE\")\r\n break\r\n else:\r\n if hash[current_position] == 1:\r\n print(\"INFINITE\")\r\n break\r\n else:\r\n hash[current_position] = 1\r\n if s[current_position] == \">\":\r\n current_position += a[current_position]\r\n else:\r\n current_position -= a[current_position]\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "n=int(input())\r\ns=input()\r\nl=list(map(int, input().split()))\r\ni=0;c=0\r\nwhile c<=n+1:\r\n if s[i]=='>': i+=l[i]\r\n else: i-=l[i]\r\n if i<0 or i>=n:\r\n n=0\r\n break\r\n c+=1\r\nprint(\"FINITE\" if n==0 else \"INFINITE\")\r\n", "n = int(input())\r\nD = [d if ch=='>' else -d for ch,d in zip(input(), map(int, input().split()))]\r\ni = 0\r\nvisited = {0}\r\n\r\nwhile True:\r\n i += D[i]\r\n if i < 0 or i >= n:\r\n print('FINITE')\r\n break\r\n if i in visited:\r\n print('INFINITE')\r\n break\r\n visited.add(i)", "n=int(input())\r\ns=input()\r\nlist=[int(i) for i in input().split()]\r\nwaste,status,i=0,0,0\r\nwhile(True):\r\n if(s[status]=='>'):\r\n status+=list[status]\r\n else:\r\n status-=list[status]\r\n list[waste]=-1\r\n waste=status\r\n if(status>=n or status<0):\r\n print(\"FINITE\")\r\n exit()\r\n if(list[status]==-1):\r\n print(\"INFINITE\")\r\n exit()", "\r\n\r\nn = int(input())\r\ns = input()\r\nl = list(map(int, input().split()))\r\ncount = 0\r\nmas = [False for i in range(n)]\r\npos = 0\r\nans = 'INFINITE'\r\nfor i in range(n):\r\n if mas[pos]:\r\n break\r\n else:\r\n mas[pos] = True\r\n if s[pos] == '<':\r\n if pos - l[pos] < 0:\r\n ans = 'FINITE'\r\n else:\r\n pos -= l[pos]\r\n else:\r\n if pos + l[pos] >= n:\r\n ans = 'FINITE'\r\n else:\r\n pos += l[pos]\r\nprint(ans)", "N = int(input())\r\nstring = input()\r\narr = list(map(int,input().split()))\r\npointer = 0\r\nhashset = set()\r\nwhile(True):\r\n if pointer < 0 or pointer > N - 1:\r\n print(\"FINITE\")\r\n break\r\n elif string[pointer] == \"<\":\r\n if pointer in hashset:\r\n print(\"INFINITE\")\r\n break\r\n else:\r\n hashset.add(pointer)\r\n pointer -= arr[pointer]\r\n \r\n elif string[pointer] == \">\":\r\n if pointer in hashset:\r\n print(\"INFINITE\")\r\n break\r\n else:\r\n hashset.add(pointer)\r\n pointer += arr[pointer]", "n = int(input())\ninstructions = list(zip(input(), [int(i) for i in input().split()]))\n\nused = set()\npos = 0\nwhile True:\n if pos < 0 or pos >= n:\n print('FINITE')\n break\n if pos in used:\n print('INFINITE')\n break\n used.add(pos)\n\n direct, length = instructions[pos]\n if direct == '>':\n pos += length\n else:\n pos -= length\n", "a=int(input())\r\nb=input()\r\nc=list(map(int,input().split()))\r\nn=1\r\nd=[0](a)\r\nif '<' not in b or '>' not in b:\r\n print(\"FINITE\")\r\n exit(0)\r\nwhile n>=1 and n<=a :\r\n if b[n-1]=='<' and d[n-1]==0 and n>=1 and n<=a:\r\n d[n-1]=1\r\n n-=(c[n-1])\r\n elif b[n-1]=='>' and d[n-1]==0 and n>=1 and n<=a:\r\n d[n-1]=1\r\n n+=(c[n-1])\r\n elif d[n-1]==1:\r\n print(\"INFINITE\")\r\n exit(0)\r\n if (n)>a or n<1:\r\n print(\"FINITE\")\r\n exit(0)", "n=int(input())\r\ns=str(input())\r\n\r\narr=list(map(int,input().split()))\r\n\r\narr2=[0]n\r\n\r\ni=0\r\nwhile 1:\r\n\r\n if i<0 or i>=n:\r\n print(\"FINITE\")\r\n exit(0)\r\n\r\n if arr2[i]==1:\r\n print(\"INFINITE\")\r\n exit(0)\r\n\r\n else:\r\n arr2[i]=1\r\n if s[i]=='>':\r\n i+=arr[i]\r\n else:\r\n i-=arr[i]", "n=int(input())\r\n\r\nvisited=[0]n\r\ndirection=[\"+\" if x==\">\" else \"-\" for x in input()]\r\njump=input().split()\r\nx=0\r\nwhile True:\r\n if x>=n or x<0:\r\n print(\"FINITE\")\r\n break\r\n if visited[x]==1:\r\n print(\"INFINITE\")\r\n break\r\n \r\n visited[x]=1\r\n x=eval(str(x)+direction[x]+jump[x])", "n=int(input())\r\na=list(input())\r\nb=list(map(int,input().split()))\r\ni=0\r\nc=[0]n\r\nwhile i>=0 and i<n:\r\n if c[i]==1:\r\n print('INFINITE')\r\n exit()\r\n c[i]=1\r\n if a[i]=='>':i+=b[i]\r\n else:i-=b[i]\r\nprint('FINITE')\r\n", "import sys\nsys.stderr = sys.stdout\n\n\ndef grasshop(n, s, D):\n i = 0\n while 0 <= i < n:\n d = D[i]\n if not d:\n return False\n D[i] = None\n i += -d if s[i] == '<' else d\n return True\n\n\ndef main():\n n = readint()\n s = input()\n D = readintl()\n print('FINITE' if grasshop(n, s, D) else 'INFINITE')\n\n##########\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(args, kwargs):\n print(args, *kwargs, file=sys.__stderr__)\n\n\nif __name__ == '__main__':\n main()\n", "def main():\r\n n = int(input())\r\n d = input()\r\n l = [int(c) for c in input().split()]\r\n visited = {0}\r\n i = 0\r\n while 0 <= i < n:\r\n di, li = d[i], l[i]\r\n i = i + li if di == '>' else i - li\r\n if i in visited:\r\n print('INFINITE')\r\n return\r\n visited.add(i)\r\n\r\n print('FINITE')\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\ndi = list(input())\r\njumps = list(map(int, input().split(' ')))\r\nvisited = {}\r\npos = 0\r\ni = 0\r\nwhile pos not in visited and i < n and pos >= 0 and pos < n:\r\n visited[pos] = 1\r\n pos += jumps[pos] if di[pos] == '>' else -jumps[pos] \r\n i+=1\r\nif pos in visited:\r\n print(\"INFINITE\")\r\nelse:\r\n print(\"FINITE\")\r\n", "n=int(input())\r\nstr=input()\r\na=list(map(int,input().split()))\r\ncrt=0\r\nflag=True\r\nfor i in range(n+10):\r\n\tif str[crt]=='>':\r\n\t\tcrt+=a[crt]\r\n\telse:\r\n\t\tcrt-=a[crt]\r\n\tif crt<0 or crt >=n:\r\n\t\tflag=False\r\n\t\tbreak\r\n\r\nif not flag:\r\n\tprint(\"FINITE\")\r\nelse:\r\n\tprint(\"INFINITE\")", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\n\r\ndef main():\r\n n = I()\r\n s = S()\r\n a = IA()\r\n j = 0\r\n for i in range(n):\r\n d = s[j]\r\n l = a[j]\r\n if d == '>':\r\n j += l\r\n else:\r\n j -= l\r\n if j < 0 or j >= n:\r\n return 'FINITE'\r\n return 'INFINITE'\r\n\r\nif __name__ == '__main__':\r\n print(main())", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn,s,i=int(input()),input(),0\r\nd=list(map(int,input().split()))\r\nfor _ in range(len(s)+1):\r\n if i<0 or i>=len(s):exit(print('FINITE'))\r\n i+=[d[i],-d[i]][s[i]=='<']\r\nprint('INFINITE')", "n=int(input())\r\na=list(input())\r\nb=list(map(int,input().split()))\r\ni=0\r\nflag=False\r\ncount=0\r\nwhile(True):\r\n if a[i]=='<':\r\n i = i-b[i]\r\n else:\r\n i = i+b[i]\r\n if i<0 or i>=n:\r\n flag=True\r\n break\r\n count+=1\r\n if count>n:\r\n break\r\n\r\nprint(\"FINITE\" if flag else \"INFINITE\")", "n=int(input())\r\na=input()\r\nd=map(int,input().split()),\r\nx=0\r\nv=[1,-1]\r\nfor i in range(n+1):\r\n x+=v[a[x]=='<']d[x]\r\n if x<0 or x>=n:break\r\nprint('IN'(i>=n)+'FINITE')", "n,s,i=int(input()),input(),0\r\nd=list(map(int,input().split()))\r\nfor _ in range(len(s)+1):\r\n if i<0 or i>=len(s):exit(print('FINITE'))\r\n i+=[d[i],-d[i]][s[i]=='<']\r\nprint('INFINITE')\n", "n, s = int(input()), input()\r\na = [int(i) for i in input().split()]\r\nc = i = 0\r\nwhile True:\r\n if s[i] == '>':\r\n i += a[i]\r\n else:\r\n i -= a[i]\r\n if i < 0 or i >= n:\r\n print(\"FINITE\")\r\n exit()\r\n c += 1\r\n if c > n:\r\n print(\"INFINITE\")\r\n exit()", "n=int(input())\r\nl=list(input())\r\nm=list(map(int,input().split())) \r\na=0\r\nx=0\r\nfor i in range(n):\r\n\tif l[a]==\"<\" :\r\n\t\ta=a-m[a]\r\n\telse:\r\n\t\ta=a+m[a]\r\n\tif a>=n or a<0 :\r\n\t\tx=1\r\n\t\tbreak\r\nif x==1 :\r\n\tprint(\"FINITE\")\r\nelse:\r\n\tprint(\"INFINITE\")", "n=int(input())\r\ns = input()\r\nd = list(map(int, input().split()))\r\ni = 0\r\nfor _ in range(n+1):\r\n if i < 0 or i >= n:\r\n print(\"FINITE\")\r\n exit()\r\n if s[i] == '>':\r\n i += d[i]\r\n elif s[i] == '<':\r\n i -= d[i]\r\nprint(\"INFINITE\")", "n=int(input())\r\ns=input()\r\na=[int(i) for i in input().split(' ')]\r\nvs=set([])\r\ncur=0\r\nwhile True:\r\n if cur in vs:\r\n print('INFINITE')\r\n break\r\n else:\r\n vs.add(cur)\r\n if s[cur]=='>':\r\n if cur+a[cur]>=n:\r\n print('FINITE')\r\n break\r\n else:\r\n cur=cur+a[cur]\r\n else:\r\n if cur-a[cur]<0:\r\n print('FINITE')\r\n break\r\n else:\r\n cur-=a[cur]\r\n\r\n\r\n", "n=int(input())\ns=input()\nd=list(map(int, input().split()))\ni=0\nfor iteertert in range(len(s)+1):\n if i<0 or i>=len(s):\n print(\"FINITE\")\n exit()\n if s[i] is '>':\n i+=d[i]\n else:\n i-=d[i]\nprint(\"INFINITE\")\n", "n = int(input())\r\n\r\nway = list(input())\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\nvisit = {0}\r\npos = 0\r\ndest = 0\r\nwhile True:\r\n jump = daf[pos]\r\n if way[pos] == '<':\r\n dest = pos - jump\r\n else:\r\n dest = pos + jump\r\n\r\n if dest in visit:\r\n print(\"INFINITE\")\r\n break\r\n if dest < 0 or dest >= n:\r\n print(\"FINITE\")\r\n break\r\n \r\n pos = dest\r\n visit.add(dest)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\nd = list(map(int, input().split()))\r\nfor i in range(n):\r\n d[i] *= s[i] - 61\r\ni = 0\r\nans = \"INFINITE\"\r\nfor _ in range(n + 5):\r\n i += d[i]\r\n if not 0 <= i < n:\r\n ans = \"FINITE\"\r\n break\r\nprint(ans)", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nn = int(input())\r\ndirection = input()\r\ndist = [int(i) for i in input().split()]\r\nvisited = set()\r\n\r\ncycle = False\r\n\r\ni = 0\r\nwhile i >= 0 and i < n:\r\n\tvisited.add(i)\r\n\r\n\tif direction[i] == '<':\r\n\t\ti -= dist[i]\r\n\telif direction[i] == '>':\r\n\t\ti += dist[i]\r\n\r\n\tif i in visited:\r\n\t\tcycle = True\r\n\t\tbreak\r\n\t\r\nif cycle:\r\n\tprint('INFINITE')\r\nelse:\r\n\tprint('FINITE')\r\n", "n = int(input())\r\ns = input()\r\nA = list(map(int, input().split()))\r\nk = 1\r\nB = [True for i in range(n)]\r\nwhile True:\r\n napr = s[k - 1]\r\n if B[k - 1] == False:\r\n print('INFINITE')\r\n break\r\n elif napr == '>' and B[k - 1] == True:\r\n B[k - 1] = False\r\n k += A[k - 1]\r\n elif napr == '<' and B[k - 1] == True:\r\n B[k - 1] = False\r\n k -= A[k - 1]\r\n if k < 1 or k > n:\r\n print('FINITE')\r\n break\r\n" ]	{"inputs": ["2\n><\n1 2", "3\n>><\n2 1 1", "1\n>\n1000000000", "1\n<\n1000000000", "2\n>>\n1 1", "5\n>><><\n1 2 3 1 2", "5\n>><><\n1 2 2 1 2", "10\n>>>>>>>>><\n1 1 1 1 1 1 1 1 1 10", "10\n>>>>>>>>><\n1 1 1 1 1 1 1 1 1 5", "10\n>>>>>>>>><\n1 1 1 1 1 1 1 1 1 1", "3\n><<\n2 1 1", "10\n>>>>>>>>>>\n1 1 1 1 1 1 1 1 1 100", "3\n><<\n2 100 2", "3\n><<\n2 3 2", "3\n>><\n2 3 2", "3\n><>\n1 1 1", "3\n>><\n2 2 2", "4\n>><<\n2 100 2 100", "3\n><>\n1 1 3", "5\n><>>>\n1 1 10 10 10", "5\n><<<<\n500 1 2 3 4", "4\n><><\n2 1000 1 1", "3\n><<\n2 10 2", "3\n><<\n2 5 2", "2\n><\n5 5", "3\n>><\n1 10 10", "4\n><<>\n2 1 1 5", "5\n<<>>>\n1 1 1 1 1", "3\n><>\n1 1 12345", "4\n>>><\n3 2 2 3", "3\n><>\n1 1 100000"], "outputs": ["FINITE", "INFINITE", "FINITE", "FINITE", "FINITE", "FINITE", "INFINITE", "FINITE", "INFINITE", "INFINITE", "INFINITE", "FINITE", "INFINITE", "INFINITE", "INFINITE", "INFINITE", "INFINITE", "INFINITE", "INFINITE", "INFINITE", "FINITE", "INFINITE", "INFINITE", "INFINITE", "FINITE", "FINITE", "INFINITE", "FINITE", "INFINITE", "INFINITE", "INFINITE"]}	UNKNOWN	PYTHON3	CODEFORCES	96
9168c9068c3cb16956fa2cc4c969c235	none	A ski base is planned to be built in Walrusland. Recently, however, the project is still in the constructing phase. A large land lot was chosen for the construction. It contains n ski junctions, numbered from 1 to n. Initially the junctions aren't connected in any way. In the constructing process m bidirectional ski roads will be built. The roads are built one after another: first the road number 1 will be built, then the road number 2, and so on. The i-th road connects the junctions with numbers ai and bi. Track is the route with the following properties: - The route is closed, that is, it begins and ends in one and the same junction.- The route contains at least one road. - The route doesn't go on one road more than once, however it can visit any junction any number of times. Let's consider the ski base as a non-empty set of roads that can be divided into one or more tracks so that exactly one track went along each road of the chosen set. Besides, each track can consist only of roads from the chosen set. Ski base doesn't have to be connected. Two ski bases are considered different if they consist of different road sets. After building each new road the Walrusland government wants to know the number of variants of choosing a ski base based on some subset of the already built roads. The government asks you to help them solve the given problem. The first line contains two integers n and m (2<=≤<=n<=≤<=105,<=1<=≤<=m<=≤<=105). They represent the number of junctions and the number of roads correspondingly. Then on m lines follows the description of the roads in the order in which they were built. Each road is described by a pair of integers ai and bi (1<=≤<=ai,<=bi<=≤<=n,<=ai<=≠<=bi) — the numbers of the connected junctions. There could be more than one road between a pair of junctions. Print m lines: the i-th line should represent the number of ways to build a ski base after the end of construction of the road number i. The numbers should be printed modulo 1000000009 (109<=+<=9). Sample Input 3 4 1 3 2 3 1 2 1 2 Sample Output 0 0 1 3	[ "def find(f, x):\r\n if f[x] != x:\r\n f[x] = find(f, f[x])\r\n return f[x]\r\n\r\ndef un(f, x, y):\r\n x = find(f, x)\r\n y = find(f, y)\r\n if x != y: f[x] = y\r\n \r\nMOD = 10 ** 9 + 9\r\nn, m = map(int, input().split())\r\nf = list(range(n + 1))\r\nans = 1\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n if find(f, x) != find(f, y):\r\n un(f, x, y)\r\n else:\r\n ans = (ans * 2) % MOD\r\n print(ans - 1)# 1697805927.0401692", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef getp(a):\r\n\tif P[a] == a:\r\n\t\treturn a\r\n\tP[a] = getp(P[a])\r\n\treturn P[a]\r\n\r\ndef solve():\r\n\tglobal P\r\n\tn, m = map(int, input().split())\r\n\tP = list(range(n+1))\r\n\tMOD = int(1e9+9)\r\n\tr = 0\r\n\tfor i in range(m):\r\n\t\ta, b = map(int, input().split())\r\n\t\ta = getp(a)\r\n\t\tb = getp(b)\r\n\t\tif a == b:\r\n\t\t\tr += 1\r\n\t\telse:\r\n\t\t\tP[a] = b\r\n\t\tprint((pow(2, r, MOD)-1) % MOD)\r\n\r\nsolve()\r\n" ]	{"inputs": ["3 4\n1 3\n2 3\n1 2\n1 2", "15 29\n6 11\n14 3\n10 4\n14 7\n6 14\n7 15\n13 8\n10 13\n4 14\n15 8\n12 7\n3 5\n6 7\n8 1\n4 5\n11 5\n10 6\n11 3\n13 14\n7 10\n3 12\n7 14\n8 11\n7 15\n15 8\n12 7\n4 3\n9 4\n8 10", "34 27\n19 10\n8 31\n26 22\n2 30\n32 26\n30 4\n34 1\n2 31\n4 18\n33 11\n10 13\n20 23\n4 32\n23 27\n30 7\n10 17\n29 9\n18 10\n2 28\n3 12\n31 8\n3 25\n5 22\n3 16\n21 1\n10 30\n5 3", "29 27\n22 8\n6 2\n3 5\n23 29\n27 23\n18 23\n28 23\n23 12\n24 15\n13 6\n1 13\n9 7\n17 6\n4 16\n20 28\n23 3\n3 19\n16 23\n10 21\n15 2\n21 28\n3 9\n8 18\n10 28\n19 18\n17 18\n13 7", "27 28\n20 14\n21 5\n11 17\n14 9\n17 13\n7 19\n24 27\n16 9\n5 1\n2 12\n9 2\n15 7\n13 6\n15 17\n25 17\n2 3\n1 15\n12 25\n10 6\n1 8\n1 6\n5 24\n3 15\n12 7\n2 12\n16 15\n8 22\n8 18", "20 29\n8 13\n19 18\n5 20\n5 10\n14 11\n20 8\n12 11\n13 20\n18 10\n3 9\n7 18\n19 13\n2 6\n20 19\n9 3\n6 10\n14 18\n16 12\n17 20\n1 15\n14 12\n13 5\n11 4\n2 16\n3 1\n11 4\n17 5\n5 8\n18 12", "28 25\n17 28\n21 3\n4 7\n17 18\n13 12\n26 20\n1 17\n10 18\n10 16\n1 4\n15 3\n27 26\n11 14\n7 9\n1 13\n14 27\n14 23\n21 27\n8 7\n16 2\n5 25\n26 18\n21 2\n4 3\n4 10", "27 29\n12 11\n21 20\n19 26\n16 24\n22 4\n1 3\n23 5\n9 1\n4 3\n21 23\n22 8\n14 6\n25 13\n7 20\n9 16\n3 20\n23 19\n17 10\n13 18\n8 14\n23 25\n25 27\n19 15\n19 15\n17 24\n12 27\n18 11\n25 5\n22 17", "2 40\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2"], "outputs": ["0\n0\n1\n3", "0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n3\n3\n7\n15\n31\n63\n127\n255\n511\n1023\n2047\n4095\n8191\n16383\n32767\n32767\n65535", "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n1\n1\n3\n3", "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n3\n3\n7", "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n3\n7\n15\n31\n31\n31", "0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n1\n3\n3\n7\n15\n15\n15\n15\n15\n15\n31\n63\n63\n127\n127\n255\n511\n1023\n2047", "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n3\n7", "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n3\n7\n15", "0\n1\n3\n7\n15\n31\n63\n127\n255\n511\n1023\n2047\n4095\n8191\n16383\n32767\n65535\n131071\n262143\n524287\n1048575\n2097151\n4194303\n8388607\n16777215\n33554431\n67108863\n134217727\n268435455\n536870911\n73741814\n147483629\n294967259\n589934519\n179869030\n359738061\n719476123\n438952238\n877904477\n755808946"]}	UNKNOWN	PYTHON3	CODEFORCES	2
916e1fdc90023043052db3e6738ca240	Chores	Luba has to do n chores today. i-th chore takes ai units of time to complete. It is guaranteed that for every the condition ai<=≥<=ai<=-<=1 is met, so the sequence is sorted. Also Luba can work really hard on some chores. She can choose not more than k any chores and do each of them in x units of time instead of ai (). Luba is very responsible, so she has to do all n chores, and now she wants to know the minimum time she needs to do everything. Luba cannot do two chores simultaneously. The first line contains three integers n,<=k,<=x (1<=≤<=k<=≤<=n<=≤<=100,<=1<=≤<=x<=≤<=99) — the number of chores Luba has to do, the number of chores she can do in x units of time, and the number x itself. The second line contains n integer numbers ai (2<=≤<=ai<=≤<=100) — the time Luba has to spend to do i-th chore. It is guaranteed that , and for each ai<=≥<=ai<=-<=1. Print one number — minimum time Luba needs to do all n chores. Sample Input 4 2 2 3 6 7 10 5 2 1 100 100 100 100 100 Sample Output 13 302	[ "if __name__ == \"__main__\":\r\n n, k, x = list(map(int, input().split()))\r\n chore_times = list(map(int, input().split()))\r\n for i in range(1, k + 1):\r\n chore_times[-i] = x\r\n print(sum(chore_times))\r\n ", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nE=sum(a)\r\nfor i in range(min(n,k)):\r\n E-=a[-i-1]-x\r\nprint(E)", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(kx+sum(a[0:n-k]))\r\n", "n,k,x=map(int,input().split())\na=list(map(int,input().split()))\nsum=0\nfor i in range(n-k):\n\tsum=sum+a[i]\nsum=sum+kx\nprint(sum)", "inp = lambda: map(int, input().split())\r\nn,k,x = inp()\r\na = list(inp())\r\nprint(sum(a[: -k])+kx)", "n, k, x = input().split()\nn = int(n)\nk = int(k)\nx = int(x)\nsum = 0\na = [int(i) for i in input().split()]\nfor i in range(n-1 , -1 , -1):\n if k > 0 :\n sum += x\n k -= 1\n else:\n sum +=a[i]\nprint(sum)\n \t\t\t\t\t\t \t\t \t\t\t \t \t \t", "n = [int(x) for x in input().split()]\r\nk = [int(x) for x in input().split()]\r\nk.sort()\r\ns = 0\r\nfor i in range(0,n[0]):\r\n if(n[0]-i>n[1]):\r\n s+=k[i]\r\n else: \r\n s+=min(k[i],n[2])\r\n #print(str(n[0])+\"-\"+str(i)+\">\"+str(n[1]))\r\n #print(s)\r\nprint(s)", "b, k, x = input().split()\nb = int(b)\nx = int(x)\nk = int(k)\na = [int(i) for i in input().split()]\nsum = 0\nfor i in range(b-1, -1, -1):\n if k > 0:\n sum += x\n k -= 1\n else:\n sum += a[i]\nprint(sum)\n\t \t\t \t\t\t \t\t \t\t \t \t \t \t", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nsm = 0\r\nfor i in range(n - k):\r\n sm += a[i]\r\nprint(sm + k x)", "n, k, x = map(int,input().split())\r\n\r\nA = list(map(int,input().split()))\r\nA.sort()\r\n\r\nfor i in range(n-k,n):\r\n A[i] = x\r\n\r\nprint(sum(A))", "def minimum_time(n, k, x, chores):\n total_time = 0\n for i in range(n):\n if i < n - k:\n total_time += chores[i]\n else:\n total_time += min(chores[i], x)\n return total_time\n\nn, k, x = map(int, input().split())\nchores = list(map(int, input().split()))\n\nresult = minimum_time(n, k, x, chores)\nprint(result)\n\n\n\n \t\t\t \t \t \t\t \t \t \t", "n, k, x = map(int, input().split())\r\na = [int(c) for c in input().split()]\r\n\r\nfor i in range(1,k+1):\r\n a[-i] = x\r\n \r\nprint(sum(a))", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nprint(sum(a[k::])+kx)\r\n", "if __name__ == \"__main__\":\n n, k, x = input().split()\n time =[int(x) for x in input().split()]\n total_time = 0\n for i in range(int(n) - int(k)):\n total_time += time[i]\n total_time = total_time + int(k) int(x)\n print(total_time)\n", "n, k, x = map(int, input().split())\na = list(map(int, input().split()))\nprint(x * min(k, n) + sum(a[:max(0, n - k)]))\n", "n,k,x = [int(i) for i in input().split()]\r\ndurations = [int(i) for i in input().split()]\r\nprint( str(sum(durations[:-k])+kx))", "n,k,x = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\nprint(sum(lis[:len(lis)-k]) + (kx))", "n,k,x=map(int,(input().split()))\r\nt=list(map(int,input().split()))\r\nres=0\r\nfor i in range(n):\r\n if i<n-k:\r\n res+=t[i]\r\n else:\r\n res+=min(t[i],x)\r\nprint(res)", "n=(input())\r\nn=n.split()\r\nk=int(n[1])\r\nx=int(n[2])\r\nn=int(n[0])\r\na=input()\r\na=(a.split())\r\nc=n-1\r\nans=0\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\nwhile(k>0):\r\n ans+=x\r\n c-=1\r\n k-=1\r\nwhile(c>=0):\r\n ans+=a[c]\r\n c-=1\r\n\r\nprint(ans)\r\n", "R = lambda: map(int,input().split())\nn,k,x = R()\na = list(R())\na.sort(reverse=True)\nans = 0\nfor i in range(n):\n if k > 0:\n ans += x\n k -= 1\n else:\n ans += a[i]\n\nprint(ans)\n\n\n\n", "n,k,x = map(int, input().split())\na = list(map(int, input().split(' ')))\ntime = sum(a[:n-k]) + kx\nprint(time)\n\t\t \t\t\t\t\t \t \t\t \t\t \t \t \t \t", "n, k , x = map(int, input().split())\r\nar = list(map(int, input().split()))\r\n\r\nprint (kx + sum(ar[:-k]))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k, x = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\nprint(k * x + sum(data[:-k]))", "while True:\n try:\n n,k,x = map(int,input().split())\n arr = []\n\n for i in input().split():\n arr.append(int(i))\n\n if k >= n:\n print(n * x)\n else:\n ans = int(0)\n ans += k * x\n for i in range(0,n - k):\n ans += arr[i]\n print(ans)\n except:\n break\n \t\t \t\t\t \t \t \t \t \t\t \t\t", "n,k,x=[int(x) for x in input().split(\" \")]\r\nl = [int(x) for x in input().split(\" \")]\r\nl=l[::-1]\r\nfor i in range(k): l[i]=x\r\nprint(sum(l))", "a, b, c = map(int, input().split())\nsum = bc\n\narr = list(map(int, input().split()))\n\nfor i in range(0, len(arr) - b) :\n sum = sum + arr[i]\n\nprint(sum)", "n,k,x = [int(i) for i in input().split()]\na = [int(i) for i in input().split(\" \")]\n\nfor i in range(k):\n a[-i-1] = x\n\nprint(sum(a))", "n,k,x = input().split()\r\na = input().split()\r\nn = int(n) \r\nk = int(k) \r\nx = int(x) \r\nhelper = 0\r\nhelper_2 = 0\r\nmassiv = []\r\n\r\nfor el in a: \r\n if el != \" \":\r\n el = int(el) \r\n massiv.append(el) \r\n \r\nwhile k > 0: \r\n helper -= 1\r\n massiv[helper] = x\r\n k -= 1\r\n \r\nfor el in massiv: \r\n helper_2 += el\r\nprint(helper_2) ", "f = lambda: map(int, input().split())\r\nn, k, x = f()\r\nprint(sum(list(f())[:n - k]) + k x)", "n, k, x = (int(i) for i in input().split(' '))\r\nlst = [int(j) for j in input().split(' ')]\r\nprint(sum(lst[:(n-k)]) + k * x)", "#http://codeforces.com/problemset/problem/873/A\r\n\r\ndef minTime(n,k,x,choreArray):\r\n choreArray.sort()\r\n chores = choreArray[:n-k] + [x](k)\r\n RA = 0\r\n for item in chores:\r\n RA += item\r\n return RA\r\n\r\nwhile True:\r\n try:\r\n line1 = input().split(\" \")\r\n line2 = input().split(\" \")\r\n n,k,x = int(line1[0]),int(line1[1]),int(line1[2])\r\n for i in range(len(line2)):\r\n line2[i] = int(line2[i])\r\n print(minTime(n,k,x,line2))\r\n except EOFError:\r\n break\r\n", "# A. Chores\n\nn, k, x = map(int, input().split())\na = list(map(int, input().split()))\n\nans = sum(a[:n-k])\nans += k x\n\nprint(ans)\n", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range (n) [::-1]:\r\n if a[i]>x and k>0:\r\n a[i] = x\r\n # sum += a\r\n k-=1\r\nprint(sum(a))\r\n", "n,k,x=input().split(' ')\r\nn=int(n)\r\nk=int(k)\r\nx=int(x)\r\nb=list(input().split(' '))\r\nb=[int(i) for i in b]\r\nfor i in range(1,k+1):\r\n b[-i]=x\r\nprint(sum(b))\r\n", "# -- coding: utf-8 --\r\nn,k,x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nprint(sum(l[:-k])+kx)\r\n", "n = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nfor i in range(1, n[1] + 1):\r\n a[-i] = n[2]\r\nprint(sum(a))\r\n ", "n, k, x = input().split()\r\na = input().split()\r\nn = int(n) \r\nk = int(k) \r\nx = int(x)\r\n\r\ntimes = []\r\n\r\nfor el in a: \r\n el = int(el) \r\n times.append(el)\r\n\r\ndef count_total_time(times, k, n, x):\r\n if k > n: \r\n return n x\r\n\r\n total_time = 0\r\n for time in times[:len(times) - k]:\r\n total_time += time\r\n\r\n return total_time + k * x\r\n\r\nanswer = count_total_time(times, k, n, x)\r\n\r\nprint(answer)\r\n", "n,k,x=map(int,input().split());a=sorted(list(map(int,input().split())),reverse=True)\r\nprint(sum(a[k:])+xk)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif len(a)<k:\r\n print(xlen(a))\r\nelse:\r\n for i in range(k):\r\n del a[-1]\r\n print(sum(a)+xk)", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\nn,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nc=sum(a[k::])+kx\r\nprint(c)", "read = lambda : map(int, input().split())\r\nn, k, x = read()\r\na = list(read())\r\nprint(sum(a[:n - k]) + k * x)\r\n", "n , k , x = map(int , input().split())\nl = input().split()\nfor i in range(len(l)):\n l[i]=int(l[i])\ncount = 0\nfor i in range(len(l)-k):\n count+=l[i]\nprint(count+(kx))\n \t \t \t \t \t \t\t \t \t\t\t \t", "n, k, x = input().split(\" \")\r\nn, k, x = int(n), int(k), int(x)\r\na = input().split(\" \")\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\nsum = 0\r\nif k < len(a):\r\n for j in range(0, len(a)-k, 1):\r\n sum = sum + a[j]\r\n for j in range(-1k, 0, 1):\r\n sum = sum + x\r\nelse:\r\n sum = len(a) * x\r\nprint(sum)", "n, k, x = [int(x) for x in input().split(' ')]\r\na = [int(x) for x in input().split(' ')]\r\na = a[:-k] + [min(a[-i], x) for i in range(1, k + 1)]\r\nprint(sum(a))", "n, k, x = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(len(a)):\n if i+1 <= n-k:\n ans += a[i]\n else:\n ans += x\n\nprint(ans)\n\t \t \t \t \t \t \t\t\t \t \t", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\na.reverse()\r\nbr=0\r\nfor i in range(n):\r\n if i+1<=k:\r\n br=br+x\r\n else:\r\n br=br+a[i]\r\nprint(br)\r\n \r\n", "n, k, x = list(map(int, input().split(' ')))\r\na = sorted(list(map(int, input().split(' '))))\r\nprint(sum(a[:n - k]) + k * x)", "inp = input().split()\r\ninp = [int(i) for i in inp]\r\nai = input().split()\r\nai = sorted([int(i) for i in ai])\r\nindex = -1\r\nfor i in range(inp[1]):\r\n\tai[index]=(inp[2])\r\n\tindex=index-1\r\nprint(sum(ai))\r\n", "# region smaller_fastio\r\nfrom sys import stdin, stdout\r\nfrom os import path\r\n\r\nif path.exists('input.txt'):\r\n # ------------------Sublime--------------------------------------#\r\n stdin = open('input.txt', 'r')\r\n stdout = open('output.txt', 'w')\r\n\r\n\r\n def I():\r\n return int(input())\r\n\r\n\r\n def In():\r\n return map(int, input().split())\r\nelse:\r\n # ------------------PYPY FAst I/o--------------------------------#\r\n def I():\r\n return int(stdin.readline())\r\n\r\n\r\n def In():\r\n return map(int, stdin.readline().split())\r\n\r\n\r\n def S():\r\n return stdin.readline().rstrip()\r\n\r\n\r\n def Sn():\r\n return stdin.readline().split(' ')\r\n\r\n\r\ndef Out(whatever):\r\n return stdout.write(whatever)\r\n\r\n\r\n# endregion\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k, x = In()\r\n arr = list(In())\r\n ans = sum(arr[:n - k]) + x * k\r\n Out(str(ans))\r\n", "line = input().split()\r\nn = int(line[0])\r\nk = int(line[1])\r\nx = int(line[2])\r\n\r\nline = input().split()\r\na = [int(i) for i in line]\r\n\r\nfor i in range(k):\r\n a[-(i+1)] = x\r\n\r\nprint(sum(a))\r\n", "n, k, s = map(int, input().split())\r\na = list(map(int, input().split())); j = len(a) - 1\r\nwhile k > 0:\r\n if k < 0:\r\n break\r\n a[j] = s\r\n j -= 1; k-=1\r\nprint(sum(a))", "n, k, x = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nres = kx\r\nn-=k\r\nres+=sum(a[:n])\r\nprint(res)", "my_input = input()\r\nn,k,x = my_input.split()\r\nmy_chores = input()\r\nmy_list = my_chores.split()\r\nfor y in range(len(my_list)):\r\n my_list[y] = int(my_list[y])\r\nmy_list.sort(reverse=True)\r\n#print(my_list)\r\nfor i in range(int(k)):\r\n my_list[i] = int(x)\r\n#print(my_list)\r\n#for x in range(len(my_list)):\r\n # my_list[x] = int(my_list[x])\r\nprint(sum(my_list))\r\n", "n,k,x = map(int,input().split())\ne = list(map(int,input().split()))\ne.sort(reverse = True)\nq = 0\nfor i in range(0,k):\n e[i] = x\nfor i in range(0,len(e)):\n q += e[i]\nprint(q) ", "n,k,x=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\ntm=0\r\nfor i in range(0,n-k):\r\n tm+=a[i]\r\nwhile k!=0:\r\n tm+=x\r\n k-=1\r\nprint(tm)\r\n \r\n \r\n \r\n \r\n", "N , K , n = input().split()\nMyTasks = input().split()\nMinRes = 0\n\na = -1\nfor i in range(len(MyTasks)-1,len(MyTasks)-1-int(K),-1):\n MinRes += int(n)\n\nfor i in range(len(MyTasks)-int(K)):\n MinRes += int(MyTasks[i])\n\nprint(MinRes)\n \t \t\t\t\t\t\t \t\t \t\t\t \t\t\t \t", "I = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\nn, k, x = IL()\r\nA = IL()[::-1]\r\nfor i in range(k):\r\n A[i] = x\r\nprint(sum(A))", "def main():\r\n n,k,x = map(int,input().split())\r\n chores = list(map(int,input().split()))\r\n\r\n chores.reverse()\r\n ans = 0\r\n for i in range(k):\r\n ans += x\r\n chores.pop(0)\r\n\r\n ans += sum(chores)\r\n\r\n print(ans)\r\n\r\nmain()\r\n", "s=[int(n) for n in input().split()]\r\nz=[int(n) for n in input().split()]\r\nfor n in range(len(z)-s[1],s[0]):\r\n z[n]=s[2]\r\nprint(sum(z))", "n,k,x = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nprint(sum([l[i] for i in range(n-k)])+kx)", "n,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nt=0\r\nfor i in range(n-1,-1,-1):\r\n if(k>0):\r\n t+=x\r\n k-=1\r\n else:\r\n t+=l[i]\r\nprint(t)\r\n", "\r\nn,k,x = map(int,input().split());\r\n\r\nRange=n-k;\r\nSum=0;\r\n\r\na= list(map(int,input().split()));\r\n\r\nfor i in range(Range):\r\n Sum+=a[i];\r\n'''\r\nSum=sum(a[:Range]);\r\n'''\r\nSum+=(kx);\r\nprint (Sum);\r\n", "a,b,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint(sum(l[:a-b])+bc)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n-k):\r\n ans+=a[i]\r\nprint(ans+kx)\r\n", "N, K, X = map(int, input().split())\n\narr = list(map(int, input().split()))\n\nres = sum(arr[0:-K])\nres += X K\nprint(res)\n", "n, k, x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nans = 0\r\nwhile k and arr and arr[-1] > x:\r\n arr.pop()\r\n ans += x\r\n k -= 1\r\n\r\nprint(ans + sum(arr))\r\n", "def main():\r\n\tn, k, x = list(map(int, input().split()))\r\n\ta = list(map(int, input().split()))\r\n\tif n == 1:\r\n\t\tprint(x)\r\n\telse:\r\n\t\tprint(sum(a[:-k]) + k * x)\r\n\r\nmain()", "n, k, x = map(int, input().split())\r\na, = map(int, input().split())\r\nh = 0\r\nwhile k > 0:\r\n k -= 1\r\n if x < a[-1]:\r\n h += 1\r\n else:\r\n a.insert(0, a[-1])\r\n del a[-1]\r\nprint(sum(a) + x h)\r\n", "import sys\r\n\r\ndef main():\r\n n, k, x = map(int, input().split())\r\n ar = list(map(int, input().split()))\r\n print(kx + sum(ar[:n-k]))\r\n \r\n\t\r\nif __name__ == '__main__':\r\n main() \r\n \r\n", "n,k,x=list(map(int,input().strip().split()))\r\nl=list(map(int,input().strip().split()))\r\nl.sort(reverse=True)\r\nt=l[k:]\r\np=sum(t)\r\nprint(p+kx)\r\n", "def solve():\r\n n, k, x = map(int, input().split())\r\n numbers = list(map(int, input().split()))\r\n result = sum(numbers[:n - k]) + k * x\r\n \r\n print(result)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "n,k,x = map(int,input().split())\r\nai = list(map(int,input().split()))\r\nans = sum(ai)\r\nfor i in range(n-1,n-1-k,-1):\r\n ans -= (ai[i] - x)\r\nprint(ans)\r\n", "x,y,z=map(int,input().split())\r\nlist=[int(i) for i in input().split()]\r\nlist.sort()\r\nd=x-y\r\nn=0\r\nfor i in range(d):\r\n n+=list[i]\r\n\r\nprint(n+(yz))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "tmp = list(map(int,input().split()))\r\nn,k,x = tmp[0],tmp[1],tmp[2]\r\na = list(map(int,input().split()))\r\nk1 = 0\r\nfor i in range(n-1,-1,-1):\r\n if k1 < k:\r\n a[i] = x\r\n k1 += 1\r\n else:\r\n break\r\nprint(sum(a))", "n,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans1=sum(l)\r\nans2=sum(l[0:n-k])+kx\r\nprint(min(ans1,ans2))", "def solve(n, k, x, a):\n return kx + sum(a[:-k])\n\n\ndef main():\n n, k, x = list(map(int, input().split()))\n a = list(map(int, input().split()))\n print(solve(n, k, x, a))\n\n\nmain()\n", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(len(a)):\r\n if i<len(a)-k:\r\n sum+=a[i]\r\n else:\r\n sum+=x\r\nprint(sum)", "n, k, x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\n\r\nprint(sum(arr[:-k]) + x k)\r\n", "from bisect import bisect_right as br\r\n\r\nN, K, X = [int(c) for c in input().split()]\r\nA = [int(c) for c in input().split()]\r\n\r\nx_slower = br(A, X)\r\n\r\nans = sum(A[i] for i in range(x_slower))\r\n\r\nk = 0\r\nfor i in range(N-1, x_slower-1, -1):\r\n if k < K:\r\n ans += X\r\n k += 1\r\n else:\r\n ans += A[i]\r\n\r\nprint(ans)\r\n \r\n", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nq=0\r\nfor i in range(k):\r\n a[len(a)-q-1]=x\r\n q+=1\r\nprint(sum(a))", "#!/usr/bin/python\n\nn, k, x = list(map(int, input().strip().split(\" \")))\n\nl = list(map(float, input().strip().split(\" \")))\n\nprint(int(sum(l[0:n-k]) + xk))\n", "x,y,z=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nprint(sum(p[0:x-y])+yz)", "inp=lambda:map(int,input().split())\r\nn,k,x=input().split()\r\nn=int(n) \r\nk=int(k) \r\nx=int(x)\r\n\r\na=list(inp())\r\n\r\ncnt=kx;\r\n\r\nfor i in range(n-k):\r\n cnt+=a[i]\r\n\r\nprint(cnt)\r\n\r\n\r\n\r\n\r\n\r\n", "\r\nn,k,x = [int(i) for i in input().split()]\r\n\r\na = [int(i) for i in input().split()]\r\n\r\nans = 0\r\n\r\nfor i in range(n-k):\r\n ans += a[i]\r\n\r\nans += xk\r\n\r\nprint(ans)\r\n \r\n", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = k * x + sum(a[0:n - k])\r\nprint(s)\r\n", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\na=a[::-1]\r\nfor i in range(k):\r\n a[i]=x\r\nprint(sum(a))\r\n\r\n\r\n\r\n", "n, k , x = map(int, input().split())\r\na = kx\r\nb = n - k\r\nc = 0\r\nli = list(map(int, input().split()))\r\nfor i in range(b):\r\n c += li[i]\r\nc += a\r\nprint(c)", "n, k, x = (int(el) for el in input().split())\r\na = [int(el) for el in input().split()]\r\n\r\nt = 0\r\nfor i in range(n - 1, n - k - 1, -1):\r\n t += a[i]\r\n \r\nif t > k x:\r\n t = k * x\r\n \r\nfor i in range(n - k - 1, -1, -1):\r\n t += a[i]\r\n \r\nprint(t)", "n, k, x= map(int,input().split(' '))\r\nchores = list(map(int,input().split(' ')))\r\nprint(kx+ sum(chores[0:n-k]))", "n,k,x=map(int,input().split())\r\nnums=list(map(int,input().split()))\r\nfor i in range(k):\r\n nums[n-i-1]=x\r\nprint(sum(nums))", "n = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nsum = 0\r\nfor i in range(n[1]):\r\n sum += n[2]\r\nfor i in a[:-n[1]]:\r\n sum += i\r\nprint(sum)", "import sys\r\n\r\ndef get_inputs():\r\n data = []\r\n for line in sys.stdin:\r\n data.append([int(i) for i in line.split()])\r\n\r\n return data[0][0], data[0][1], data[0][2], data[1]\r\n\r\nn, k, x, a = get_inputs()\r\n\r\nfor i in range(k):\r\n a[-(i+1)] = x\r\n\r\nprint(sum(a))\r\n", "n,c,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n-c):\r\n\tz=min(l)\r\n\ts+=z\r\n\tl.remove(z)\r\nprint(s+tc)", "n,k,x = map(int,input().split())\r\nli = [map(int,input().split())]\r\nprint(sum(li[0:n-k])+kx)", "n,k,x = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n-k): ans += a[i]\r\nans += kx\r\nprint(ans)", "n , k , x = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 0\r\n\r\ni = n - 1\r\nwhile k > 0 :\r\n ans += x\r\n l.remove(l[i])\r\n k -=1\r\n i-=1\r\n\r\nprint(ans + sum(l))", "class Work:\r\n def __init__(self, usedTime: int, _id: int):\r\n self.usedTime = usedTime\r\n self.id = _id\r\n\r\n def __lt__(self, other):\r\n if type(other) != Work:\r\n return\r\n return self.usedTime < other.usedTime\r\n\r\n\r\ndef main() -> None:\r\n n, k, x = map(int, str(input()).split())\r\n _3longestWorks = []\r\n a = list(map(int, str(input()).split()))\r\n for i in range(n):\r\n if len(_3longestWorks) < k or _3longestWorks[0].usedTime < a[i]:\r\n _3longestWorks.append(Work(a[i], i))\r\n _3longestWorks.sort()\r\n if len(_3longestWorks) > k:\r\n del _3longestWorks[0]\r\n for longestWork in _3longestWorks:\r\n a[longestWork.id] = x\r\n result = 0\r\n for time in a:\r\n result += time\r\n print(result)\r\n\r\n\r\nmain()\r\n", "def solution(n, a, k, x):\n min_time = 0\n for i in range(n-1, -1, -1):\n if k != 0:\n min_time += x\n k -= 1\n else:\n min_time += a[i]\n return min_time\n\n\nif __name__ == '__main__': \n n, k, x = [int(i) for i in input().split()]\n a = [int(i) for i in input().split()]\n print(solution(n,a, k, x))\n\t \t\t\t \t \t\t \t \t\t \t \t\t", "def solution(l1,l2):\r\n l2.reverse()\r\n ans=0\r\n for x in l2:\r\n if x>l1[2] and l1[1]!=0:\r\n ans+=l1[2]\r\n l1[1]-=1\r\n else:\r\n ans+=x\r\n return ans\r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n l2 = [int(x) for x in input().split()]\r\n print(solution(l1,l2))\r\nanswer()", "\r\ndef solve():\r\n n,k,x = list(map(int,input().split()))\r\n y = list(map(int,input().split()))\r\n ans = kx \r\n for i in range(n-k):\r\n ans += y[i]\r\n print(ans)\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "#!/usr/bin/python\nimport sys\ninput = lambda: sys.stdin.readline().strip()\nn, k, x = [int(x) for x in input().split()]\na = sorted([int(x) for x in input().split()])\nans = 0\nfor ai in reversed(a):\n if ai > x and k > 0:\n ans += x\n k -= 1\n else:\n ans += ai\nprint(ans)\n", "n,k,x=map(int,input().split())\r\ns=0;\r\nlist1=list(map(int,input().split()))\r\nfor i in range(0,n-k):\r\n s=s+list1[i];\r\ns=s+kx;\r\nprint(s)\r\n ", "f=lambda:map(int,input().split())\r\nn,k,x=f()\r\nl=list(f())\r\nprint(sum(l[:n-k])+kx)", "n, k, x = map(int, input().split())\r\na = sorted(list(map(int, input().split())), reverse=True)\r\n\r\ncnt = 0\r\nans = 0\r\nfor i in a:\r\n if cnt < k:\r\n ans += x\r\n cnt += 1\r\n else:\r\n ans += i\r\n\r\nprint(ans)", "n,k,x=map(int,input().split())\r\na=[int(b) for b in input().split()]\r\nfor i in range(k):\r\n a.pop()\r\nfor i in range(k):\r\n a.append(x)\r\nprint(sum(a))", "n, k, x = [int(x) for x in input().split()]\r\nnums = [int(x) for x in input().split()]\r\n\r\npartial_sum = 0\r\nfor i in range(n - k):\r\n partial_sum += nums[i]\r\n\r\nprint(partial_sum + k * x)\r\n", "n,k,x = map(int,input().split())\r\nl = sum([map(int,input().split())][:n-k])\r\nprint(l+kx)", "n,k,x = map(int, input().split())\r\ntime = list(map(int, input().split()))\r\nsum = 0\r\nfor i in range(n-k):\r\n sum = time[i] + sum\r\n\r\ntotal = sum + kx\r\nprint(total)", "a,b,c = map(int,input().split())\r\na1 = list(map(int,input().split()))\r\nprint(sum(a1[0:a-b])+bc)", "n,k,x = list(map(int,input().split()))\r\nt = list(map(int,input().split()))\r\n\r\ne = kx\r\nd = sum(t[:n-k])\r\n\r\nprint(e+d)", "n, k, x = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nresult=kx\r\nfor i in range(n-k):\r\n\tresult+=a[i]\r\nprint(result)", "n,k,x=[int(x) for x in input().split()]\r\narr1=[int(y) for y in input().split()] \r\nsum1=0\r\nfor i in range(len(arr1)-k):\r\n sum1=sum1+arr1[i]\r\nsum1=sum1+(kx) \r\nprint(sum1)", "n, k, x = [int(i) for i in input().split()]\r\ns = [int(i) for i in input().split()]\r\nc = 0\r\nfor i in range(n-k):\r\n c += s[i]\r\nc += kx\r\nprint(c)", "n, k, x = map(int, input().split())\ntempo = list(map(int, input().split()))\ntempo.sort()\nsoma = sum(tempo[:n-k])\nans = kx + soma\n\nprint(ans)\n", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = sum(a[:-k])\r\nprint(d + (k x))\r\n# CodeForcesian\r\n# ♥\r\n# اگه میتونی تصور کنی پس حتما میتونی انجامش بدی\r\n", "n,k,x = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 0\r\nans+=sum(l[:len(l)-k])\r\nans+=kx\r\nprint(ans)", "def inp(s,i):\r\n k = 0\r\n it = ''\r\n s = ' ' + s\r\n for j in s:\r\n if j == ' ':\r\n k += 1\r\n if (k == i) and not(j == ' '):\r\n it += j\r\n return it\r\ns = input()\r\nn = int(inp(s,1))\r\nk = int(inp(s,2))\r\nx = int(inp(s,3))\r\ns = input()\r\na = list()\r\nfor q in range(n):\r\n p = int(inp(s,q+1))\r\n a.append(p)\r\nm = 101\r\nt = 0\r\na.sort()\r\na.reverse()\r\nc = 0\r\nfor i in a:\r\n c+=1\r\n if c <= k:\r\n t += x\r\n else:\r\n t += i\r\nprint(t)\r\n", "n, k, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nprint(sum(l[:n - k]) + (k x))", "n, k, x = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nans = 0\r\n\r\na.sort(reverse = True)\r\n\r\nfor i in a:\r\n if k > 0 and i > x:\r\n k -= 1\r\n ans += x\r\n else:\r\n ans += i\r\nprint(ans)\r\n", "\r\nn,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nsu=0\r\nfor i in range(n-k):\r\n\tsu+=l[i]\r\n\r\nprint(su+kx)", "read=lambda : map(int,input().split())\r\nn,k,x=read()\r\na=list(read())\r\na.reverse()\r\nans=0\r\nfor i in range(n):\r\n if k>0 and a[i]>x:\r\n ans+=x\r\n k-=1\r\n else:\r\n ans+=a[i]\r\nprint(ans)\r\n\r\n\r\n", "n,k,x=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nans=0\r\nfor el in arr[::-1]:\r\n if el>x and k:\r\n ans+=x\r\n k-=1\r\n else :\r\n ans+=el\r\nprint(ans)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=a[::-1]\r\nb=b[:k]\r\nif(b[-1]<=x):\r\n print(sum(a))\r\nelse:\r\n c=a[:n-k]\r\n print(sum(c)+(kx))\r\n", "n,k,x=list(map(int,input().split()))\r\n\r\n\r\nt=list(map(int,input().split()))\r\n\r\n\r\nprint(sum(t[:-k])+kx)\r\n", "n,k,x=map(int,input().split())\r\na=list(sorted(map(int,input().split())))\r\nprint(sum(a[:(n-k)])+kx)\r\n", "n, k, x = [int(i) for i in input().split(\" \")]\na = [int(i) for i in input().split(\" \")]\nprint(sum(a[:n-k])+kx)", "n, k, x = map(int,input().split())\r\narr = list(map(int, input().split()))\r\nans = k x\r\nfor i in range(n-k):\r\n ans += arr[i]\r\nprint(ans)", "n, k, x = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nprint(sum(w[:n-k])+ kx)", "n,k,x=map(int,input().split())\ns=list(map(int,input().split()))\nif(k>n):\n print(sum(s[i] for i in range(0,n)))\nelse:\n print(min(sum(s[i] for i in range(0,n)),sum(s[i] for i in range(n-k))+kx))\n\t\t\t\t\t\t \t \t \t \t \t \t\t \t\t \t\t\t\t", "n,k,x = map(int,input().split())\r\nai = [int(i) for i in input().split()]\r\nfor i in range(k):\r\n\tai[-i-1] = x\r\nprint(sum(ai))\r\n", "n,k,x=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nl=[]\r\nsum=0\r\nfor i in range(0,len(a)):\r\n if(a[i]<=x):\r\n sum=sum+a[i]\r\n else:\r\n l.append(a[i])\r\nl=sorted(l,reverse=True)\r\nfor i in range(0,len(l)):\r\n if(k>0):\r\n k=k-1\r\n sum=sum+x\r\n else:\r\n sum=sum+l[i]\r\nprint(sum)", "import sys\r\n\r\ndef main():\r\n n, k, x, l = map(int, sys.stdin.read().strip().split())\r\n return sum(l[:-k]) + kx\r\n \r\nprint(main())\r\n", "n,x,y=list(map(int,input().rstrip().split()))\r\nk=list(map(int,input().rstrip().split()))\r\nsum=0\r\nfor i in range(n-x):\r\n sum=sum+k[i]\r\nsum=sum+xy\r\nprint(sum)", "n,k,x=map(int,input().split())\r\nr=[map(int,input().split())]\r\nprint(sum(r[:n-k])+kx)", "N,K,X = map(int,input().split())\r\nlst = sorted([int(i) for i in input().split()])\r\n\r\nfor i in range(1,K+1):\r\n lst[-i] = X\r\nprint(sum(lst))", "def main():\r\n n, k, x = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n res = sum(a[:-k]) + kx\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,k,x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in range(n-k, n):\r\n a[i] = min(a[i], x)\r\nprint(sum(a))", "n, k, x = map(int, input().strip().split())\r\na = list(map(int, input().strip().split()))\r\n\r\nresult = sum(a[:len(a) - k])\r\nresult += sum(b if b < x else x for b in a[:k])\r\n\r\nprint(result)\r\n", "n, k, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(-1, (-1n)-1, -1):\r\n if k != 0:\r\n ans += x\r\n k -= 1\r\n else:\r\n ans += l[i]\r\n\r\nprint(ans)", "n, k, x=map(int, input().split())\r\n\r\na=list(map(int, input().split()))\r\n\r\nfor i in range(n-1, n-k-1, -1):\r\n\ta[i]=x\r\n\r\nprint(sum(a))", "n,k,x=map(int,input().split())\na=map(int,input().split())\np=list(a)\nS=0\n\nfor s in range(0,k):\n g=max(p)\n #print(g)\n p.remove(g)\n S=S+x\n\nfor j in p:\n S=S+j\nprint(S)\n \n \n\n\n\t\t \t \t\t \t \t \t\t\t\t \t \t", "n,k,x=list(map(int,input().split()))\r\nnumbers=list(map(int,input().split()))\r\ns=0\r\ns+=kx\r\nfor i in range(len(numbers)-k):\r\n s+=numbers[i]\r\nprint(s)", "n, k, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n - k):\r\n s += l[i]\r\ns += k * x\r\nprint(s)", "n, k, x = input().split()\nn = int(n)\nk = int(k)\nx = int(x)\na = [int(i) for i in input().split()]\nsum = 0\nfor i in range(n-1 , -1 , -1):\n if a[i] > x and k > 0:\n sum += x\n k -= 1\n else:\n sum += a[i]\nprint(sum)\n \t\t \t \t \t\t\t \t\t\t \t \t \t\t \t\t\t", "n,k,x=input().split()\nn=int(n)\nk=int(k)\nx=int(x)\nsum=0\na=[int(i) for i in input().split()]\nfor i in range(n-1,-1,-1):\n if k>0:\n sum+=x\n k-=1\n else:\n sum+=a[i]\nprint(sum)\n\t\t \t\t \t\t \t\t \t\t \t\t \t\t", "n, k, x =input().split()\nn =int(n)\nk =int(k)\nx =int(x)\nsum = 0\na = [int(i)for i in input().split()]\nfor i in range(n-1, -1, -1):\n if k > 0 :\n sum += x \n k-= 1\n else:\n sum +=a[i]\nprint(sum)\n\t \t\t\t \t\t\t\t \t\t\t \t \t \t \t", "n, k, x = list(map(int, input().split()))\na = list(map(int, input().split()))\n\nfor i in range(len(a) - 1, len(a) - 1 - k, -1):\n a[i] = x\n\nprint(sum(a))\n", "n, k, x = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nprint(sum(a[:n - k]) + x * k)", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Sun Apr 26 14:10:38 2020\nhttps://codeforces.com/contest/873/problem/A\n\n@author: neb0123\n\"\"\"\n\ndef answer(chores,n,k,x):\n total = 0\n for _ in range(n-k):\n total += next(chores)\n for _ in range(k):\n total += x\n return total\n\nif __name__ == \"__main__\": \n n, k, x = map(int, input().split(' '))\n chores = map(int, input().split(' '))\n\n print(answer(chores,n,k,x))", "n,k,x = map(int,input().split())\r\na = sorted(list(map(int,input().split())))\r\nn -= k\r\ns = sum(a[0:n])+ (kx)\r\nprint(s)", "n,k,x=map(int,input().split())\narr=list(map(int,input().split()))\ncount=n-k-1\nsum=0\nwhile count>-1:\n sum+=arr[count]\n count-=1\n\nfor i in range(n-k,len(arr)):\n sum += x\nprint(sum)", "n, k, x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\n\r\ni = n - 1\r\nwhile i > -1 and a[i] > x and k > 0:\r\n k -= 1\r\n s -= a[i]\r\n s += x\r\n i -= 1\r\n\r\nprint(s)\r\n", "n, k, x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(k):\r\n\tif a[n - 1 - i] > x:\r\n\t\ta[n - 1 - i] = x\r\n\telse:\r\n\t\tbreak\r\n\r\nprint(sum(a))", "n, k, x = map(int, input().split())\r\n\r\narr = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n if k:\r\n ans += x\r\n k -= 1\r\n else:\r\n ans += arr[i]\r\nprint(ans)", "score = 0\r\nn, k, x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(k):\r\n a.append(x)\r\n\r\na.sort()\r\n\r\nfor j in range(n):\r\n score += a[j]\r\n\r\nprint(score)", "n, k, x = map(int, input().split())\r\nline = list(map(int, input().split()))\r\nsm = 0\r\nfor i in range(n - k):\r\n sm += line[i]\r\nfor i in range(n - k, n):\r\n sm += min(line[i], x)\r\nprint(sm)", "baris = input()\r\nstring = baris.split(' ')\r\nn = int(string[0])\r\nk = int(string[1])\r\nx = int(string[2])\r\n\r\nbaris = input()\r\nstring = baris.split(' ')\r\n\r\nangkaSekarang = []\r\nfor i in range(0, n):\r\n angkaSekarang.append(int(string[i]))\r\n\r\nangkaSekarang.sort()\r\n\r\nhasil = 0\r\nfor i in range(0, n-k):\r\n hasil = hasil + angkaSekarang[i]\r\nfor i in range(0, k):\r\n hasil = hasil + x\r\n\r\nprint(hasil)", "n,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n-k):\r\n c+=l[i]\r\nprint(c+kx)\r\n", "a = tuple(map(int, input().split()))\r\nb = tuple(map(int, input().split()))\r\nprint(sum(b[:a[0] - a[1]]) + a[1] * a[2])", "n, k, x = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\nfor i in range(n - k, n):\n a[i] = min(a[i], x)\nres = sum(a)\nprint(res)\n", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[n, k, x] = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\na.sort(reverse=True)\r\nres = 0\r\nfor i in range(n):\r\n if i < k:\r\n res += x\r\n else:\r\n res += a[i]\r\nprint(res)\r\n", "n, k, x = tuple(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(k):\r\n a[-(i+1)] = x\r\n\r\nprint(sum(a))\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,bisect\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nn,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint(sum(l[:n-k])+kx)\r\n", "n,k,x=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\ns=0\r\nfor i in range(0,n-k):\r\n\ts+=lst[i]\r\ns+=x(k)\r\nprint(s)\r\n\r\n\r\n\r\n\r\n\r\n", "nkx = [int(i) for i in input().split(' ')]\r\nai = [int(i) for i in input().split(' ')]\r\nk = nkx[1]\r\nx = nkx[2]\r\nai = ai[:-k] + [x]k\r\nprint(sum(ai))\r\n", "(n, k, x) = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\n\nfor i in range(k):\n a[~i] = x\n\nprint(sum(a))", "n, k, x = input().split()\nn = int(n)\nk = int(k)\nx = int(x)\nchores = [int(c) for c in input().split()]\n\ntime = 0\nfor i in range(n - k):\n time += chores[i]\n\ntime += kx\n\nprint(time)\n", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nprint(sum(a[:n-k])+kx)", "read = lambda: tuple(map(int, input().split()))\nn, k, x = read()\nl = list(read())\nfor i in range(k):\n l[-i-1] = x\n \nprint(sum(l))\n", "n, k, x = map(int, input().split())\r\ntime_list = list(map(int, input().split()))\r\n\r\nfor i in range(k):\r\n time_list.pop()\r\ntime_list.extend([x] k)\r\n\r\ntotal_time = sum(time_list)\r\n\r\nprint(total_time)\r\n\r\n", "bb=input().split()\r\nn1=int(bb[0])\r\nn2=int(bb[1])\r\nn3=int(bb[2])\r\nnu=input().split()\r\nv=0\r\nfor r in range (n1-n2):\r\n v=v+int(nu[r])\r\nv=v+n2n3\r\nprint(v)", "\r\nn, k, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nfor i in range(1, k + 1):\r\n\tl[-i] = x\r\n\r\nprint(sum(l))", "n,k,x=map(int,input().split())\r\n\r\nl=[int(x) for x in input().split()]\r\nprint(sum(l[:-k])+xk)\r\n", "\r\n\r\n\r\ndef main_function():\r\n n, k, x = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n time = 0\r\n for i in range(len(a)):\r\n if i >=len(a) - k:\r\n time += x\r\n else:\r\n time += a[i]\r\n return time\r\n\r\n\r\n\r\n\r\nprint(main_function())\r\n", "# http://codeforces.com/contest/873/problem/A\n\nn, k, x = [int(x) for x in input().split()]\nt = [int(x) for x in input().split()]\n\nL = len(t)\nkk = min(L, k)\nres = sum(t[:L-kk]) + kk * x\nprint(res)\n", "n, k, x = map(int, input().split())\nk = min(k, n)\nprint(sum([int(s) for s in input().split()][:-k]) + k * x)", "(num_chores, num_x_chores, x) = [int(string) for string in input().split()]\nchore_times = [int(string) for string in input().split()]\n\ntotal = 0\nfor chore in reversed(chore_times):\n if chore > x and num_x_chores > 0:\n total += x\n num_x_chores -= 1\n else:\n total += chore\n\nprint(total)\n", "n, k, x = [int(k) for k in input().split()]\r\ntime_na_deli = [int(k) for k in input().split()]\r\ntime_na = 0\r\nfor deli in range(n):\r\n ost_vremya = n - deli\r\n if ost_vremya <= k and x < time_na_deli[deli]:\r\n time_na += x\r\n else:\r\n time_na += time_na_deli[deli]\r\nprint(time_na)", "line = list(map(int, input().split()))\r\nn, k, x = line[0], line[1], line[2]\r\na = list(map(int, input().split()))\r\n\r\nres = 0\r\nfor i in range(n):\r\n if i < n-k:\r\n res += a[i]\r\n else:\r\n res += x\r\n\r\nprint(res)", "input1 = input(\"\").split(\" \")\nchores = [int(num) for num in input(\"\").split(\" \")]\n\nnumChores = int(input1[0])\nnumWorkHard = int(input1[1])\nworkHardTime = int(input1[2])\n\nfor i in range(len(chores),0,-1):\n if numWorkHard > 0:\n chores[i-1] = workHardTime\n numWorkHard -= 1\n else:\n i = 0\n\nprint(sum(chores))\n", "n,k,x=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nif n==1:\r\n print(x)\r\nelif n==k:\r\n print(xk)\r\nelse:\r\n L=sorted(L)\r\n for i in range(k):\r\n L.pop(len(L)-1)\r\n s=xk\r\n for i in range(len(L)):\r\n s+=L[i]\r\n print(s)\r\n \r\n", "n, k, x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n-1, -1, -1):\r\n if k > 0 and a[i] > x:\r\n k -=1\r\n ans += x\r\n else:\r\n ans += a[i]\r\nprint(ans)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=sum(a[0:n-k])+kx\r\nprint(s)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif k<=n:\r\n\tsu=kx\r\nelse:\r\n\tsu=nx\t\r\nsu+=sum(a[:-k])\r\nprint(su)", "n,k,x=map(int,input().split())\r\nls=list(map(int,input().split()))\r\nfor m in range(1,k+1):\r\n ls[-m]=x\r\nprint(sum(ls))\r\n ", "R=lambda:list(map(int,input().split()))\nn,k,x=R()\na=list(reversed(R()))\nprint(sum(x if i < k else a[i] for i in range(n))) \n", "n,k,x=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nl=l[::-1]\r\nmini=sum(l)\r\nloss= kx \r\ngain=sum(l[:k])\r\nmini=min(mini,mini-gain+loss)\r\nprint(mini)", "n, k, x = map(int, input().split())\r\ndata = list(map(int, input().split()))[::-1]\r\n\r\nprint(sum(min(v, x) if index < k else v for index, v in enumerate(data)))\r\n", "X = list(map(int, input().split()))\r\nY = list(map(int, input().split()))\r\nprint(sum(Y[:-X[1]]) + (X[1] * X[2]))", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n-k):\r\n s+=a[i]\r\ns+=kx\r\nprint(s)", "n, k, x = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n - k):\r\n temp = lst[i]\r\n ans += temp\r\nfor j in range(k):\r\n ans += x\r\nprint(ans)", "a,b,d = input().split()\r\n\r\nc= list(map(int, input().split()))\r\n\r\nc.sort()\r\nr=0\r\nwhile r<int(b):\r\n c.pop()\r\n r=r+1\r\n\r\nprint(sum(c)+ int(b)int(d) )", "if __name__ == '__main__':\r\n\tarr = list(map(int, input().split()))\r\n\ta = list(map(int, input().split()))\r\n\tansw = arr[1]arr[2]\r\n\tfor i in range(arr[0] - arr[1]):\t\t\r\n\t\tansw = answ + a[i]\r\n\tprint(answ)\r\n", "inp = lambda: map(int, input().split())\r\nn, k, x = inp()\r\n\r\nlst = [inp()]\r\nlst.reverse()\r\n\r\nres = 0\r\n\r\nfor case in lst:\r\n if case > x and k != 0:\r\n res += x\r\n k -= 1\r\n else:\r\n res += case\r\n\r\nprint(res)\r\n", "input1=input()\ninput1=input1.split(' ')\nn=int(input1[0])\nk=int(input1[1])\nx=int(input1[2])\n\n\ntimes=input()\ntimes=times.split(' ')\ntimes=[int(x) for x in times]\n\n\ntotal=kx+sum(times[0:n-k])\nprint(total)\n\t\t\t\t\t \t \t\t \t \t \t\t \t\t\t\t", "n, k, x = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na.sort(reverse = True)\r\nt = len(a[:k]) x\r\nt += sum(a[k:])\r\nprint(t)", "n,k,x = map(int,input().split())\na = list(map(int,input().split()))\nprint(sum(a[:n-k]) + kx)\n", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nres = 0\r\nfor i in range(n - k):\r\n\tres += a[i]\r\nprint(res+ k x)\r\n", "# LUOGU_RID: 135590492\nn, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n# 首先计算不使用特殊努力的情况下，完成所有家务所需的时间\r\ntotal_time = sum(a)\r\n# 1\r\n# 如果可以使用特殊努力，则选择耗时最长的k个家务进行努力，并将其耗时替换为x\r\nif k > 0:\r\n # 找到耗时最长的k个家务\r\n max_a = sorted(a)[-k:]\r\n # 计算使用特殊努力后的总时间\r\n special_time = total_time - sum(max_a) + k * x\r\n # 取两种情况中的较小值作为最终结果\r\n result = min(total_time, special_time)\r\nelse:\r\n result = total_time\r\n\r\nprint(result)\r\n#2", "i=lambda:map(int,input().split())\r\nn,k,x=i()\r\na=sorted(i())[::-1]\r\nprint(kx+sum(a[k:]))", "n,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\nprint(sum(l[:-k])+kx)", "x,y,z= map(int, input().split(' '))\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nind = -1\r\nfor i in range(0,y):\r\n del arr[ind]\r\nres = sum(arr) + yz\r\nprint(res)", "n,k,x = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\naa=sum(lis[:n-k])+(xk)\r\nprint(aa)", "n,k,x=map(int,input().split())\nch=list(map(int,input().split()))\nwhile k>0:\n ch.pop()\n ch.insert(0,x)\n k-=1\nc=0\nfor el in ch:\n c+=el \nprint(c)\n \t\t \t\t\t\t\t\t\t \t \t \t \t\t\t\t \t\t \t", "n,k,x=map(int,input().split())\r\nl=list(map(int, input().split()))\r\nl.reverse()\r\nfor i in range(k):\r\n l[i]=x\r\nprint(sum(l))\r\n\r\n", "n,k,m=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nprint(km+sum(a[:n-k]))\r\n", "n,k,x = map(int,input().split())\r\ncosts = list(map(int, input().split()))\r\nfor i in range(k):\r\n costs[n-1-i] = x\r\nprint(sum(costs))", "R=lambda:map(int,input().split())\r\nn,k,x=R()\r\na=list(R())\r\nprint(sum(a[:n-k])+kx)\r\n\r\n", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in range(k):\r\n if max(a) >= x:\r\n a.remove(max(a))\r\n a.append(x)\r\nprint(sum(a))\r\n", "n,k,x=map(int,input().split())\r\n\r\nA=list(map(int,input().split()))\r\n\r\nx = sum(A[:-k]) + x * k\r\nprint(x)", "read=lambda : map(int,input().split())\r\nn,k,x=read()\r\na=list(read())\r\nprint(sum(a[:n-k])+kx)", "import io,os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nn, k, x = map(int, input().split())\r\nl = [int(x) for x in input().split()]\r\nans=0\r\nfor i in range(n-k):\r\n ans+=l[i]\r\n\r\nfor i in range(k):\r\n ans+=x\r\n\r\nprint(ans)", "n , k , x = map(int , input().split())\r\nl = input().split()\r\nfor i in range(len(l)):\r\n l[i]=int(l[i])\r\ncount = 0\r\nfor i in range(len(l)-k):\r\n count+=l[i]\r\nprint(count+(kx))", "n,k,x=map(int,input().split())\r\nprint(sum(list(map(int,input().split()))[:n-k])+kx)\r\n", "n,k,x = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\nprint(sum(a[:len(a)-k])+kx)\r\n", "n,k,x=map(int,input().split())\r\na=[int(c) for c in input().split()]\r\n\r\nfor i in range(k):\r\n if max(a)>=x:\r\n a.remove(max(a))\r\n a.append(x)\r\nres=0\r\nfor i in a:\r\n res+=i\r\nprint(res)\r\n\r\n\r\n \r\n\r\n", "n,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)-sum(l[-k:])\r\nprint(s+(kx))", "n,k,t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nans = 0\r\nfor i in range(n-k):\r\n ans += l[i]\r\nprint(ans+kt)", "\r\nn , k , x = map(int , input().split())\r\n\r\ny = [int(y) for y in input().split()]\r\n\r\nprint(sum(y[:len(y) - k]) + k * x)", "b = list(map(int, input().split()))[:3]\r\na = list(map(int, input().split()))[:b[0]]\r\ns = 0\r\nfor i in range(0, b[0]-b[1]):\r\n s += a[i]\r\n \r\ns += b[1]b[2]\r\nprint(s)\r\n", "n, special, t = map(int, input().split())\r\nchores = sorted(list(map(int, input().split())), reverse = True)\r\n\r\ntotal = 0\r\nfor ch in chores:\r\n if special > 0 and t < ch:\r\n special -= 1\r\n total += t\r\n else:\r\n total += ch\r\n\r\nprint(total)", "n,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=n-k\r\ns=0\r\nfor i in range(c):\r\n s=s+l[i]\r\nprint(s+kx)\r\n", "n,k,x=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nd=0\r\nfor i in range(len(a)-k):\r\n d+=a[i]\r\nprint(d+kx)\r\n \r\n", "n,k,x=[int(i) for i in input().split()]\r\nans=0\r\nl=[int(i) for i in input().split()]\r\nfor i in range(1,n+1):\r\n if (i<=n-k):\r\n ans+=l[i-1]\r\nans+=(xk)\r\nprint(ans)", "line1 = input().split()\r\nn,k,x = int(line1[0]),int(line1[1]),int(line1[2])\r\nsuma = [int(i) for i in input().split()]\r\n\r\nprint(sum(suma[:len(suma) - k]) + xk)\r\n", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(sum(a) + k x - sum(a[i] for i in range(n - 1, n - k - 1, -1)))\r\n", "#873A\r\n\r\ngiven = input().split(\" \")\r\ntasks = input().split(\" \")\r\n\r\nnominal = 0\r\nfor i in range(len(tasks) - int(given[1])):\r\n nominal += int(tasks[i])\r\n\r\ntotal = nominal + int(given[1])int(given[2])\r\n\r\nprint(total)", "n, k, x = map(int, input().split())\nl = [int(x) for x in input().split()]\nprint(sum(l[:-k]) + k x)", "a,b,c=map(int,input().split());print(sum(map(int,input().split()[:a-b]))+bc)", "n, k, x = map(int,input().split())\r\nmas = list(map(int,input().split()))\r\nprint(kx + sum(mas[:-k]) )\r\n", "l = list(map(int, input().split()))\r\nn = l[0]\r\nk = l[1]\r\nx = l[2]\r\nFlag = 0\r\n\r\nscores = list(map(int, input().split()))\r\nscores = sorted(scores, reverse = True)\r\n\r\nwhile k > 0:\r\n scores[Flag] = x\r\n k -= 1\r\n Flag += 1\r\nprint(sum(scores))\r\n ", "# import sys\r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nN,K,X=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nlast=N-1\r\nwhile K:\r\n\tL[last]=X\r\n\tlast-=1\r\n\tK-=1\r\nans=0\r\nfor i in range(N):\r\n\tans+=L[i]\r\nprint(ans)\r\n\r\n", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nn,m,p=map(int,input().strip().split()[:3])\nl=list(map(int,input().strip().split()[:n]))\nk=len(l[n-m:])p\nk1=sum(l[:n-m])\nprint(k1+k)", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))[:n]\r\ns = 0\r\nfor i in range(0, n-k):\r\n s += a[i]\r\n \r\ns += kx\r\nprint(s)\r\n", "n,k,x = map(int, input().split())\r\nchores = list(map(int,input().split()))\r\n\r\nfor i in range(n-1,n-1-k,-1):\r\n chores[i] = x\r\nprint(sum(chores))", "n,k,x=map(int,input().split())\nchores_time=list(map(int,input().split()))\naddon=kx\ntime_taken=0\nfor i in range(n-k):\n time_taken+=chores_time[i]\n\nprint((time_taken+addon)) \n\n\t \t \t\t\t \t\t\t \t \t \t \t\t\t\t \t", "n,k,x = map(int, input().split())\na = list(map(int, input().split()))\nprint(sum(a[:-k])+xk)\n\n\n", "n,h,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nif h>n:\r\n\th=n\r\nprint(hx+sum(l[h:]))", "s=input() #input string in the first line\nn,k,x=s.split()\nn=int(n)\nk=int(k)\nx=int(x)\ns=input()\nA=s.split()\nA= list(map(int, A))\nl=len(A)\nt=0 # minimum time taken\nwhile(k>0):\n t=t+x\n k=k-1\n A[l-1]=0\n l=l-1\nwhile(l>0):\n t=t+A[l-1]\n l=l-1\nprint(t)", "n, k, x = list(map(int, input().split()))\r\na = sum(int(val) for idx, val in enumerate(input().split()) if idx < n-k)\r\nprint(a + (kx))\r\n", "import math\nn = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nsum1 = min(n[1],n[0])n[2]\nfor i in range(0,max(0,n[0]-n[1])):\n\tsum1 += a[i]\nprint(sum1)\n\n\n", "def solve():\r\n n,a,b = list(map(int,input().split()))\r\n l = list(map(int,input().split()))\r\n l.sort(reverse = True)\r\n x = a b\r\n for i in range (a,n):\r\n x += l[i]\r\n print(x)\r\nsolve()", "import heapq\r\n\r\nn, k, x = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nq = []\r\n\r\ns = 0\r\n\r\nfor v in a:\r\n if v > x:\r\n heapq.heappush(q, v)\r\n if len(q) > k:\r\n s += heapq.heappop(q)\r\n else:\r\n s += v\r\n\r\nprint(s + len(q) * x)", "# -- coding: utf-8 --\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/12 22:08\r\n\r\n\"\"\"\r\n\r\n\r\nn, k, x = map(int, input().split())\r\n\r\nts = [int(x) for x in input().split()]\r\n\r\nfor i in range(n-1, n-k-1, -1):\r\n ts[i] = min(ts[i], x)\r\n\r\nprint(sum(ts))", "n,k,x=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nx1=0\r\nfor z in range(n-k):\r\n x1+=a[z]\r\nx2=kx\r\nprint(x1+x2)", "n, k, x = map(int, input().split());\r\na = list(map(int, input().split()));\r\n\r\na.sort(reverse = True);\r\n\r\nkq = k x;\r\nfor i in range(k, n):\r\n kq += a[i];\r\nprint(kq);", "n, k, x = map(int, input().split())\r\ndela = [int(x) for x in input().split()]\r\nanswer = sum(dela[:-k]) + kx\r\nprint(answer)", "def dela(lst, k, x):\r\n result = x k\r\n for i in range(len(lst) - k):\r\n result += lst[i]\r\n return result\r\n\r\n\r\nN, K, X = [int(j) for j in input().split()]\r\na = [int(z) for z in input().split()]\r\nprint(dela(a, K, X))\r\n", "def main():\n [n, k, x] = [int(_) for _ in input().split()]\n\n t = [int(_) for _ in input().split()]\n t = t[::-1]\n\n for i in range(k):\n t[i] = x\n\n print(sum(t))\n\n\nif __name__ == '__main__':\n main()\n", "n,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.reverse()\r\nsum1=0\r\nfor i in range(k):\r\n\tl[i]=x\r\nfor i in l:\r\n\tsum1+=i\r\nprint(sum1)", "n,k,x=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nprint(sum(a)+kx-sum(a[n-k:]))", "n, k, x = map(int, input().split())\r\ntimes = list(map(int, input().split()))\r\nfor i in range(n - 1, n - k - 1, -1):\r\n times[i] = x\r\nprint(sum(times))\r\n", "from collections import deque\r\nn, k, x = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\ndeq = deque(lst)\r\nres = 0\r\nfor _ in range(k):\r\n res += min(x, deq.pop())\r\nprint(res + sum(deq))", "b=list(map(int,input().split()))\na=list(map(int,input().split()))\nfor i in range(len(a)-1,len(a)-b[1]-1,-1):a[i]=b[2]\nprint(sum(a))\n", "n,k,x=map(int, input().split())\r\nl=list(map(int, input().split()))\r\ns=sum(l[0:n-k])+kx\r\nprint(s)", "n,k,x = [int(x) for x in input().split()]\r\nchores= [int(x) for x in input().split()]\r\ntimes = sum(chores[:n-k]) + (k * x)\r\nprint(times)\r\n", "n,k,x = map(int,input().split())\r\na = list(map(int,input().split()))\r\na= sorted(a); a = a[::-1]\r\nfor i in range(k):\r\n a[i] = x;\r\nprint(sum(a))", "n,k,x=map(int, input().split())\r\na=list(map(int, input().split()))\r\nprint(sum(a[0:n-k])+kx)\r\n", "n, k, x = map(int,input().split()) \nl= list(map(int, input().split()))\nsum1=0\nfor i in range (n) :\n if (k==0) :\n sum1+=l[-i-1]\n else :\n sum1=sum1+x\n k-=1\nprint(sum1)\n \t\t\t\t\t \t\t \t \t \t\t \t\t\t \t", "def numline(f = int):\r\n return map(f, input().split())\r\n \r\nn, k, x = numline()\r\na = [i for i in numline()]\r\n \r\nprint(sum(a[:len(a) - k]) + k x)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=kx\r\nprint(ans+sum(a[:n-k]))", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nprint(sum(a[0:n-k])+xk)", "n, k, x = map(int, input().split())\r\nl = sorted([int(i) for i in input().split()])[::-1]\r\n\r\nlst = l[k:]\r\n\r\nprint(sum(lst) + kx)\r\n\r\n", "n, k, x = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nfor i in range(1, k + 1):\r\n lst[-(i)] = x\r\nprint(sum(lst))", "n,k,x = [int(y) for y in input().split()]\r\nli = [int(y) for y in input().split()]\r\n\r\n\r\nprint(kx + sum(li[:n-k]))\r\n\r\n", "\r\na,b,c=map(int, input().split())\r\nd=sorted(list(map(int, input().split())))\r\nf=a-b\r\n\r\ncnt=0\r\nfor i in range(f):\r\n cnt+=d[i]\r\nprint(cnt+(bc))\r\n\r\n \r\n", "y=input().split()\r\nn = int(y[0])\r\nk=int(y[1])\r\nx=int(y[2])\r\na=[]\r\ns=0\r\na=input().split()\r\nfor i in range(len(a)-k):\r\n s+=int(a[i])\r\ns+=kx\r\nprint(s)\r\n\r\n", "n,k,x = list(map(int,input().split()))\r\nl=sorted(list(map(int,input().split())))\r\na=sum(l[:n-k])+kx\r\nprint(a)", "n,k,x = map(int, input().split())\r\na = list(map(int, input().split()))\r\na = a[::-1]\r\nfor i in range(k):\r\n a[i] = min(a[i], x)\r\nprint(sum(a))", "n,m,k = map(int,input().split())\nT = list(map(int,input().split()))\n \ntotal=0\nfor i in range(n-m):\n total+=T[i]\ntotal+=km\nprint(total)", "n = input()\nn = n.split()\nn,k,x = int(n[0]),int(n[1]),int(n[2])\n\n\na = input()\na = [int(x) for x in a.split()]\nres = 0\nfor i in range(n):\n\tif i < n-k:\n\t\tres += a[i]\n\telse:\n\t\tres += x\n\nprint(res)", "n,k,x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nost = n-k\r\nres = 0\r\nfor i in range(ost):\r\n res+=a[i]\r\nprint(res+kx)\r\n", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=kx\r\nfor i in range(n-k):\r\n\ts=s+a[i]\t\t\t\t\t\r\nprint(s)", "import sys\r\n\r\nn, k, x = map(int, input().split())\r\na = sorted(map(int, input().split()), reverse=True)\r\nfor i in range(k):\r\n a[i] = min(a[i], x)\r\n\r\nprint(sum(a))\r\n", "n,k,x = map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\nfor i in range(k):\r\n\tl[n-1-i] = x\r\nprint(sum(l))", "n, k, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nans = k * x\r\nfor i in range(0, n - k):\r\n\tans += c[i]\r\nprint(ans)", "\n\nfrom sys import stdin\n\ndef main():\n\tn, k, x = [int(tok) for tok in stdin.readline().strip().split()]\n\ta = [int(tok) for tok in stdin.readline().strip().split()]\n\tprint(sum(a[: n - k]) + x * k)\n\nif __name__ == \"__main__\":\n\tmain()\n", "[n,k,m] = [int(x) for x in input().split()]\n\nai = [int(x) for x in input().split()]\nsum = 0 \nfor x in range(0,n-k):\n sum = sum + ai[x]\nsum = sum + km\nprint(sum)\n", "n,k,x = map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\ns = 0\r\nfor i in range(n-k):\r\n s += a[i]\r\n\r\nfor i in range(k):\r\n s += x\r\n \r\nprint(s)", "I = lambda: map(int, input().split())\r\n\r\n_, k, x = I()\r\n\r\nprint(sum(list(I())[:-k]) + kx)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=n-1\r\nc=0\r\nwhile i>=0:\r\n if a[i]>x:\r\n a[i]=x\r\n c=c+1\r\n if c==k:\r\n break\r\n i=i-1\r\nprint(sum(a))", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=n-1\r\nq=0\r\nwhile q!=k:\r\n a[i]=x\r\n i-=1\r\n q+=1\r\nprint(sum(a))\r\n \r\n", "line1 = input().split()\nn , k, x = int(line1[0]), int(line1[1]), int(line1[2])\n\nline2 = input().split()\nworks = []\n\nfor el in line2:\n works.append(int(el))\nfor i in range(1, k + 1):\n works[-i] = x\nprint(sum(works))\n", "n, k, x = map(int, input().split())\nA = list(map(int, input().split()))\nA.sort(reverse=True)\nans = sum(A)-sum(A[0:k])+kx\nprint(ans)\n", "x,y,z=map(int,input().split())\r\na=list(map(int,input().split()))\r\nprint(sum(a[:x-y])+yz)", "n,m,o = map(int,input().split())\r\nb = list(map(int,input().split()))\r\nfor i in range(m):\r\n\tb.pop()\r\nprint(sum(b)+(mo))\r\n", "n, k, x = [int(x) for x in input().split()]\r\nl_tm = [int(x) for x in input().split()]\r\nfor i in range(1, k+1):\r\n l_tm[-i] = x\r\nprint(sum(l_tm))", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nc=0\r\nsu=sum(a)\r\nfor i in range(n-1,n-k-1,-1):\r\n\tsu-=a[i]\r\nprint(su+kx)", "a = input().split()\nb = input().split()\nc = 0\nfor i in range(len(b)-int(a[1])):\n c+=int(b[i])\nc+= int(a[1])int(a[2])\nprint(c)", "n,k,x=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\na.sort(reverse=True)\r\ntime=0\r\nfor i in range(n):\r\n if(k>0 and a[i]>x):\r\n time+=x\r\n k-=1\r\n else:\r\n time+=a[i]\r\nprint(time)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nprint(sum(a[0:(n-k)])+xk)\r\n\r\n" ]	{"inputs": ["4 2 2\n3 6 7 10", "5 2 1\n100 100 100 100 100", "1 1 1\n100", "100 1 99\n100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100", "100 100 1\n100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100", "100 50 50\n51 51 52 53 55 55 55 55 56 56 56 57 57 58 58 59 59 59 60 60 61 61 62 62 63 64 64 64 64 65 65 65 65 66 66 66 67 68 68 68 69 69 70 70 70 70 71 71 71 71 71 71 72 72 76 76 76 76 77 79 79 81 81 81 81 82 82 82 82 83 84 85 86 87 87 88 88 88 89 89 89 90 90 90 91 91 91 92 92 93 95 95 96 96 96 97 97 98 99 100", "100 100 1\n2 4 4 4 5 5 5 6 10 10 11 11 12 12 13 13 13 14 17 18 20 20 21 21 22 22 23 24 24 25 26 29 29 32 32 34 34 35 38 39 39 40 40 42 42 43 45 47 48 49 51 52 52 54 57 59 59 60 61 61 62 63 63 64 65 65 68 70 70 72 74 75 75 76 76 77 77 78 78 78 79 80 81 82 82 83 83 83 84 89 90 92 92 93 94 96 96 97 98 99", "100 1 1\n3 3 5 7 8 8 8 9 9 9 11 13 14 15 18 18 19 20 21 22 22 25 27 27 29 31 32 33 33 34 36 37 37 38 40 42 44 44 46 47 47 48 48 48 50 50 51 51 54 54 54 55 55 56 56 56 60 61 62 62 63 64 65 65 68 70 70 71 71 71 71 75 75 76 76 79 79 79 79 81 81 82 82 86 86 86 86 88 90 90 92 96 97 97 98 98 98 98 100 100", "100 50 49\n50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51", "100 50 1\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3", "100 1 1\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2"], "outputs": ["13", "302", "1", "9999", "100", "5618", "100", "5202", "4950", "151", "199"]}	UNKNOWN	PYTHON3	CODEFORCES	291
9172cd6361befbdd0dd7efc95b7a917d	Haiku	Haiku is a genre of Japanese traditional poetry. A haiku poem consists of 17 syllables split into three phrases, containing 5, 7 and 5 syllables correspondingly (the first phrase should contain exactly 5 syllables, the second phrase should contain exactly 7 syllables, and the third phrase should contain exactly 5 syllables). A haiku masterpiece contains a description of a moment in those three phrases. Every word is important in a small poem, which is why haiku are rich with symbols. Each word has a special meaning, a special role. The main principle of haiku is to say much using a few words. To simplify the matter, in the given problem we will consider that the number of syllable in the phrase is equal to the number of vowel letters there. Only the following letters are regarded as vowel letters: "a", "e", "i", "o" and "u". Three phases from a certain poem are given. Determine whether it is haiku or not. The input data consists of three lines. The length of each line is between 1 and 100, inclusive. The i-th line contains the i-th phrase of the poem. Each phrase consists of one or more words, which are separated by one or more spaces. A word is a non-empty sequence of lowercase Latin letters. Leading and/or trailing spaces in phrases are allowed. Every phrase has at least one non-space character. See the example for clarification. Print "YES" (without the quotes) if the poem is a haiku. Otherwise, print "NO" (also without the quotes). Sample Input on codeforces beta round is running a rustling of keys how many gallons of edo s rain did you drink cuckoo Sample Output YESNO	[ "a = input()\r\ndamn = 0\r\ndamn += a.count('a')\r\ndamn += a.count('e')\r\ndamn += a.count('i')\r\ndamn += a.count('o')\r\ndamn += a.count('u')\r\nif damn != 5:\r\n print('NO')\r\n exit()\r\ndamn = 0\r\nb = input()\r\ndamn += b.count('a')\r\ndamn += b.count('e')\r\ndamn += b.count('i')\r\ndamn += b.count('o')\r\ndamn += b.count('u')\r\nif damn != 7:\r\n print('NO')\r\n exit()\r\ndamn = 0\r\nc = input()\r\ndamn += c.count('a')\r\ndamn += c.count('e')\r\ndamn += c.count('i')\r\ndamn += c.count('o')\r\ndamn += c.count('u')\r\nif damn != 5:\r\n print('NO')\r\n exit()\r\nelse:\r\n print('YES')", "a=input()\r\nb=input()\r\nc=input()\r\np=['a','e','i','o','u']\r\nd=0\r\ne=0\r\nf=0\r\nfor i in a:\r\n if i in p:\r\n d=d+1\r\nfor j in b:\r\n if j in p:\r\n e=e+1\r\nfor k in c:\r\n if k in p:\r\n f=f+1\r\nif d==5 and e==7 and f==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\nc=input()\r\nd=['a','e','i','o','u']\r\nans=cnt=count=0\r\nfor i in a:\r\n if i in d:\r\n ans+=1\r\nfor i in b:\r\n if i in d:\r\n cnt+=1\r\nfor i in c:\r\n if i in d:\r\n count+=1\r\nif ans==5 and cnt==7 and count==5:\r\n print(\"YES\")\r\nelse: print(\"NO\")\r\n", "import math\r\nimport sys\r\nimport re\r\n\r\ns1 = input().strip()\r\ns2 = input().strip()\r\ns3 = input().strip()\r\n\r\nv1 = s1.count('a') + s1.count('e') + s1.count('i') + s1.count('o') + s1.count('u')\r\nv2 = s2.count('a') + s2.count('e') + s2.count('i') + s2.count('o') + s2.count('u')\r\nv3 = s3.count('a') + s3.count('e') + s3.count('i') + s3.count('o') + s3.count('u')\r\n\r\nif v1 != 5 or v2 != 7 or v3 != 5:\r\n print('NO')\r\nelse:\r\n print('YES')", "r=0\r\nfor i in [0,1,2]:r\|=sum(x in 'aeiou' for x in input())!=5+i%22\r\nprint('YNEOS'[r::2])", "n1 = input()\r\nn2 = input()\r\nn3 = input()\r\nl1 = list()\r\nl2 = list()\r\nl3 = list()\r\nv = \"auioe\"\r\nn1.strip().split()\r\nn2.strip().split()\r\nn3.strip().split()\r\nn1 = \"\".join(n1)\r\nn2 = \"\".join(n2)\r\nn3 = \"\".join(n3)\r\nn1 = list(n1)\r\nn2 = list(n2)\r\nn3 = list(n3)\r\n\r\nfor i in n1:\r\n if i in v:\r\n l1.append(i)\r\nfor j in n2:\r\n if j in v:\r\n l2.append(j)\r\nfor h in n3:\r\n if h in v:\r\n l3.append(h)\r\nif len(l1) == 5 and len(l2) == 7 and len(l3) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=[]\r\nm=[]\r\nfor i in range(3):\r\n l.append(input(''))\r\nfor j in l:\r\n k=list(j)\r\n a=k.count('a')\r\n b=k.count('e')\r\n c=k.count('i')\r\n d=k.count('o')\r\n e=k.count('u')\r\n s=a+b+c+d+e\r\n m.append(s)\r\n#print(m)\r\nif m[0]==5 and m[1]==7 and m[2]==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "x = input()\r\ny = input ()\r\nz = input ()\r\nans = 0\r\nlis = [5, 7, 5]\r\nlis2 = [x, y, z]\r\ndef check (str) :\r\n\tcnt = 0\r\n\tfor i in str :\r\n\t\tif i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u' :\r\n\t\t\tcnt += 1\r\n\treturn cnt\r\nfor i in range (len (lis)):\r\n\tif check (lis2[i]) == lis[i] :\r\n\t\tans += 1\r\nif ans == 3 :\r\n\tprint ('YES')\r\nelse :\r\n\tprint ('NO')", "def countVowel(s):\r\n res=0\r\n for i in s:\r\n if i in ('a','e','i','o','u'):\r\n res+=1 \r\n return res \r\ns1=input()\r\ns2=input()\r\ns3=input()\r\nif countVowel(s1)==5 and countVowel(s2)==7 and countVowel(s3)==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "A=input()\r\nB=input()\r\nC=input()\r\na=0\r\nb=0\r\nc=0\r\nD=['a','e','i','o','u']\r\nfor i in range(len(A)):\r\n if A[i] in D:\r\n a+=1\r\nfor i in range(len(B)):\r\n if B[i] in D:\r\n b+=1\r\nfor i in range(len(C)):\r\n if C[i] in D:\r\n c+=1\r\nif a==5 and b==7 and c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l1=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nk=0\r\ns=input()\r\nfor x in s :\r\n if x in l1 :\r\n k+=1\r\n \r\n \r\n \r\n\r\nif k!=5 :\r\n print(\"NO\")\r\n \r\n exit()\r\nk=0\r\ns=input()\r\nfor x in s :\r\n if x in l1 :\r\n k+=1\r\nif k!=7 :\r\n print(\"NO\")\r\n exit()\r\nk=0\r\ns=input()\r\nfor x in s :\r\n if x in l1 :\r\n k+=1\r\nif k!=5 :\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "# LUOGU_RID: 101454208\nprint([sum(s.count(c) for c in 'aeiou') for s in open(0)] == [5, 7, 5] and 'YES' or 'NO')", "x = input()\ny = input()\nz = input()\nc=0\ns=0\nv=0\nfor i in x:\n if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n c+=1\nfor i in y:\n if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n s+=1\nfor i in z:\n if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n v+=1\n \nif c==5 and s==7 and v==5:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t\t \t\t\t\t\t\t \t\t \t \t\t\t", "import sys\r\n\r\n\r\ns, t, r = input().strip(), input().strip(), input().strip()\r\nvowel = set('aeiou')\r\ns_counter = t_counter = r_counter = 0\r\nfor _ in s:\r\n if _ in vowel:\r\n s_counter += 1\r\nif s_counter != 5:\r\n print('NO')\r\n sys.exit()\r\nfor _ in t:\r\n if _ in vowel:\r\n t_counter += 1\r\nif t_counter != 7:\r\n print('NO')\r\n sys.exit()\r\nfor _ in r:\r\n if _ in vowel:\r\n r_counter += 1\r\nif r_counter != 5:\r\n print('NO')\r\n sys.exit()\r\nprint('YES')\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n A = sys.stdin.readlines()\r\n B = []\r\n for s in A:\r\n val = 0\r\n for c in s:\r\n if c in 'aeiou':\r\n val += 1\r\n B.append(val)\r\n if B == [5, 7, 5]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\nimport sys\r\nInput = sys.stdin.readline\r\ncounterList = []\r\ncounter = 0\r\nvowel = 'aeoui'\r\nfor i in range(3):\r\n s = Input()\r\n for j in s:\r\n if j in vowel:\r\n counter+=1\r\n counterList.append(counter)\r\n counter = 0\r\nif counterList[0] == 5 and counterList[1] == 7 and counterList[2] == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n# FMZJMSOMPMSL\r\n# Ravens ;)\r\n# Codeforcesian\r\n", "b=[]\r\nfor i in range(3):\r\n l=input()\r\n l=l.replace(\" \",\"\")\r\n b.append(l)\r\nc=0\r\nd=0\r\nf=0\r\na=\"aeiou\"\r\nfor i in range(len(b)):\r\n for j in range(len(b[i])):\r\n if b[i][j] in a and i==0:\r\n c=c+1\r\n elif b[i][j] in a and i==1:\r\n d=d+1\r\n elif b[i][j] in a and i==2:\r\n f=f+1\r\n else:\r\n continue\r\nif c==5 and d==7:\r\n if f==5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "poems = [input() for _ in range(3)]\r\n\r\nvowel = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\n\r\nflag = True\r\n\r\nfor i in range(len(poems)):\r\n line = poems[i]\r\n count = 0\r\n\r\n for item in line:\r\n if item.lower() in vowel:\r\n count += 1\r\n\r\n if i == 1 and count != 7:\r\n flag = False\r\n break\r\n if i != 1 and count != 5:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "d = {\"a\",\"e\",\"i\",\"o\",\"u\"} \r\nfor i in range(3):\r\n\tcount = 0\r\n\tt = input()\r\n\tfor j in t: \r\n\t\tif j in d:\t\t\r\n\t\t\tcount = count + 1\r\n\tif count == 5 and i == 0 or count == 5 and i == 2:\r\n\t\tcontinue\r\n\telif i == 0 or i == 2:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\tif count == 7 and i == 1:\r\n\t\tcontinue\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\r\nprint(\"YES\")", "def f(s):\n ans = 0\n for item in s:\n if item in \"aeiou\":\n ans += 1\n return ans\n\n\nwin = \"YES\"\ns = input()\nif f(s) != 5:\n win = \"NO\"\ns = input()\nif f(s) != 7:\n win = \"NO\"\ns = input()\nif f(s) != 5:\n win = \"NO\"\nprint(win)\n", "print('YES' if [sum(1 for i in j if i in 'aeiou') for j in [input(), input(), input()]] == [5,7,5] else 'NO')", "#a e i o u.\r\nn=input()\r\nm=input()\r\nd=input()\r\nk=n.count('a')+n.count('e')+n.count('i')+n.count('o')+n.count('u')\r\nk2=m.count('a')+m.count('e')+m.count('i')+m.count('o')+m.count('u')\r\nk3=d.count('a')+d.count('e')+d.count('i')+d.count('o')+d.count('u')\r\nif k==5 and k2==7 and k3==5:print('YES')\r\nelse:print('NO')\r\n", "str1 = input()\r\nstr2 = input()\r\nstr3 = input()\r\nstr1 = str1.strip()\r\nstr2 = str2.strip()\r\nstr3 = str3.strip()\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\nfor i in str1:\r\n if i == 'a':\r\n c1 += 1\r\n elif i == 'e':\r\n c1 += 1\r\n elif i == 'i':\r\n c1 += 1\r\n elif i == 'o':\r\n c1 += 1\r\n elif i == 'u':\r\n c1 += 1\r\nfor j in str2:\r\n if j == 'a':\r\n c2 += 1\r\n elif j == 'e':\r\n c2 += 1\r\n elif j == 'i':\r\n c2 += 1\r\n elif j == 'o':\r\n c2 += 1\r\n elif j == 'u':\r\n c2 += 1\r\nfor k in str3:\r\n if k == 'a':\r\n c3 += 1\r\n elif k == 'e':\r\n c3 += 1\r\n elif k == 'i':\r\n c3 += 1\r\n elif k == 'o':\r\n c3 += 1\r\n elif k == 'u':\r\n c3 += 1\r\nif c1 == 5 and c2 == 7 and c3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "print('NYOE S'[[sum(m in'aeiou'for m in input())for e in\"012\"]==[5,7,5]::2])", "l=[5,7,5]\r\nans=\"YES\"\r\nfor i in range(3):\r\n n=list(input())\r\n for j in n:\r\n if j==\"a\" or j==\"e\" or j==\"i\" or j==\"o\" or j==\"u\":\r\n l[i]-=1\r\n if l[i]!=0:\r\n ans=\"NO\"\r\n break\r\nprint(ans)", "s=input()\r\na='aeiou'\r\nc,d,e=0,0,0\r\nfor i in s:\r\n if i in a:\r\n c+=1\r\ns=input()\r\nfor i in s:\r\n if i in a:\r\n d+=1\r\ns=input()\r\nfor i in s:\r\n if i in a:\r\n e+=1\r\nif c==5 and d==7 and e==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "f=input()\r\ns=input()\r\nt=input()\r\nvow={'a','e','i','o','u'}\r\nf1={}\r\nc=0\r\nfor i in f:\r\n if i in vow:\r\n c+=1\r\nf1[1]=c\r\nc=0\r\nfor i in s:\r\n if i in vow:\r\n c+=1\r\nf1[2]=c\r\nc=0\r\nfor i in t:\r\n if i in vow:\r\n c+=1\r\nf1[3]=c\r\nif f1[1]==5 and f1[2]==7 and f1[3]==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nl = [a,b,c]\r\nv1 = l[0].count('a') + l[0].count('e')+l[0].count('i')+l[0].count('o') + l[0].count('u')\r\nv2 = l[1].count('a') + l[1].count('e')+l[1].count('i')+l[1].count('o') + l[1].count('u')\r\nv3 = l[2].count('a') + l[2].count('e')+l[2].count('i')+l[2].count('o') + l[2].count('u')\r\n\r\nif v1==5 and v2 == 7 and v3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Sep 27 11:02:19 2021\r\n\r\n@author: cheehong\r\n\"\"\"\r\nk1=list(input())\r\nk2=list(input())\r\nk3=list(input())\r\nvowel=['a','e','i','o','u']\r\ncount1=0\r\ncount2=0\r\ncount3=0\r\nfor ele in k1:\r\n if ele in vowel:\r\n count1+=1\r\nfor ele in k2:\r\n if ele in vowel:\r\n count2+=1\r\nfor ele in k3:\r\n if ele in vowel:\r\n count3+=1\r\nif count1==5:\r\n if count2==7:\r\n if count3==5:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "lis=[]\r\nlis1=['a','e','i','o','u']\r\nfor i in range(3):\r\n x=input()\r\n lis.append(x)\r\ncount=0\r\ncount2=0\r\ncount3=0\r\nlis.append(x)\r\n\r\n\r\n\r\nfor ele in lis[0]:\r\n if ele in lis1:\r\n count+=1\r\nfor ele in lis[1]:\r\n if ele in lis1:\r\n count2+=1\r\nfor ele in lis[2]:\r\n if ele in lis1:\r\n count3+=1\r\nif count==5 and count2==7 and count3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ncount1 = s1.count('a') + s1.count('e') + s1.count('i') + s1.count('o') + s1.count('u')\r\ncount2 = s2.count('a') + s2.count('e') + s2.count('i') + s2.count('o') + s2.count('u')\r\ncount3 = s3.count('a') + s3.count('e') + s3.count('i') + s3.count('o') + s3.count('u')\r\n\r\nif count1 == 5 and count2 == 7 and count3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python3\n\nimport sys\n\n\ndef vowels(k):\n return k.count('a') \\\n + k.count('e') \\\n + k.count('i') \\\n + k.count('o') \\\n + k.count('u')\n\n\ndef main():\n a = sys.stdin.readlines()\n\n for line in a[3:]:\n if line.strip() != '':\n print(\"NO\")\n return\n\n if vowels(a[0]) != 5 or vowels(a[1]) != 7 or vowels(a[2]) != 5:\n print(\"NO\")\n return\n\n print(\"YES\")\n\nmain()\n", "inp1 = input()\r\ninp2 = input()\r\ninp3 = input()\r\nval1 = inp1.count('a')+inp1.count('e')+inp1.count('i')+inp1.count('o')+inp1.count('u')\r\nval2 = inp2.count('a')+inp2.count('e')+inp2.count('i')+inp2.count('o')+inp2.count('u')\r\nval3 = inp3.count('a')+inp3.count('e')+inp3.count('i')+inp3.count('o')+inp3.count('u')\r\nif val1==5 and val2==7 and val3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "c,ii=0,0\r\nv=[5,7,5]\r\no=\"YES\"\r\nfor i in range(3):\r\n temp=input()\r\n for i in temp:\r\n if (i in ['o','i','e','u','a']):\r\n c+=1\r\n if(v[ii]==c):\r\n ii+=1 \r\n c=0\r\n else:\r\n o=\"NO\"\r\n break \r\n\r\nprint(o)\r\n", "def count_vowels(line):\r\n vowels = 'aeiou'\r\n line = line.lower()\r\n count = 0\r\n for letter in line:\r\n if letter in vowels:\r\n count += 1\r\n return count\r\n\r\noutput = True\r\n\r\nline = input()\r\nnum_vowels = count_vowels(line)\r\nif num_vowels != 5:\r\n output = False\r\n\r\nline = input()\r\nnum_vowels = count_vowels(line)\r\nif num_vowels != 7:\r\n output = False\r\n\r\nline = input()\r\nnum_vowels = count_vowels(line)\r\nif num_vowels != 5:\r\n output = False\r\n\r\nif output:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l1 = input()\nl2 = input()\nl3 = input()\nc1, c2, c3 = 0, 0, 0\nvovels = ['a','e','i','o','u']\nfor letter in l1:\n\tif letter in vovels:\n\t\tc1+=1\nfor letter in l2:\n\tif letter in vovels:\n\t\tc2+=1\nfor letter in l3:\n\tif letter in vovels:\n\t\tc3+=1\nif c1 == 5 and c2 == 7 and c3 == 5:\n\tprint(\"YES\")\nelse :\n\tprint(\"NO\")", "ishaiku=0\r\nfor i in range(3):\r\n sentence=input().lower()\r\n if i==0 or i==2:\r\n if (sentence.count('a')+sentence.count('e')+sentence.count('i')+sentence.count('o')+sentence.count('u')==5):\r\n ishaiku+=1\r\n elif (sentence.count('a')+sentence.count('e')+sentence.count('i')+sentence.count('o')+sentence.count('u')==7):\r\n ishaiku+=1\r\nif ishaiku==3:print('YES')\r\nelse:print('NO')\r\n", "a = input()\r\nb = input()\r\nc = input()\r\n\r\nvol = \"aeiou\"\r\n\r\n\r\nx = len([i for i in a if i in vol])\r\ny = len([i for i in b if i in vol])\r\nz = len([i for i in c if i in vol])\r\n\r\n\r\n\r\nprint(\"YES\" if(x == z == 5 and y == 7) else \"NO\") ", "x=input()\r\ny=input()\r\nz=input()\r\n\r\nx1=x.count('a')+x.count('e')+x.count('i')+x.count('o')+x.count('u')\r\ny1=y.count('a')+y.count('e')+y.count('i')+y.count('o')+y.count('u')\r\nz1=z.count('a')+z.count('e')+z.count('i')+z.count('o')+z.count('u')\r\n\r\nif(x1==5 and y1==7 and z1==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\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\n\r\ndef main():\r\n ca = 0\r\n cb=0\r\n cc =0\r\n vo = \"aeiou\"\r\n sa = input()\r\n sb = input()\r\n sc = input()\r\n for c in sa:\r\n if c in vo: ca += 1\r\n for c in sb:\r\n if c in vo: cb += 1\r\n for x in sc:\r\n if x in vo: cc += 1\r\n\r\n if ca == 5 and cb == 7 and cc == 5:\r\n print(\"YES\")\r\n else: print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a, b, c = input(), input(), input()\r\nca, cb, cc = 0, 0, 0\r\nfor i in range(len(a)):\r\n ca = ca + (1 if a[i] in 'aeiou' else 0)\r\nfor i in range(len(b)):\r\n cb = cb + (1 if b[i] in 'aeiou' else 0)\r\nfor i in range(len(c)):\r\n cc = cc + (1 if c[i] in 'aeiou' else 0)\r\nprint(\"YES\" if (ca == 5 and cb == 7 and cc == 5) else \"NO\")", "n = input()\nn1 = input()\nn2 = input()\na = {'a','e','i','o','u'}\nc=0 \nc1 = 0\nc2 = 0\nfor i in n :\n if i in a:\n c += 1 \nfor j in n1:\n if j in a:\n c1 += 1 \nfor k in n2:\n if k in a:\n c2 += 1\nif c==5 and c1==7 and c2==5:\n print(\"YES\")\nelse:\n print(\"NO\")", "def count_vowels():\r\n s=input()\r\n vowels=0\r\n i=len(s)\r\n \r\n while i:\r\n i=i-1\r\n \r\n if s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u':\r\n vowels=vowels+1\r\n \r\n return vowels\r\n\r\nif count_vowels()==5 and count_vowels()==7 and count_vowels()==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "S = [str(input()) for _ in range(3)]\nC = [0]3\nB = set(['a', 'e', 'i', 'o', 'u'])\nfor i in range(3):\n s = S[i]\n cnt = 0\n for j in range(len(s)):\n if s[j] in B:\n cnt += 1\n C[i] = cnt\nif C == [5, 7, 5]:\n print('YES')\nelse:\n print('NO')\n", "a = input()\nb = input()\nc = input()\n\nx = y = z = 0\n\nv = list('aeoui')\n\nfor i in a:\n if i in v:\n x += 1\nfor i in b:\n if i in v:\n y += 1\nfor i in c:\n if i in v:\n z += 1\nif (x==5 and y==7 and z==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\ncount1,count2,count3=0,0,0\r\nfor i in s1:\r\n if i in [\"a\",\"e\",\"i\",\"o\",\"u\"]:\r\n count1+=1\r\nfor i in s2:\r\n if i in [\"a\",\"e\",\"i\",\"o\",\"u\"]:\r\n count2+=1\r\nfor i in s3:\r\n if i in [\"a\",\"e\",\"i\",\"o\",\"u\"]:\r\n count3+=1\r\n\r\nif count1==5 and count2==7 and count3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\ndef check(x):\r\n c = Counter(''.join(x))\r\n return c.get('a',0)+c.get('e',0)+c.get('i',0)+c.get('o',0)+c.get('u',0)\r\nna,nb,nc = input().strip().split(' '),input().strip().split(' '),input().strip().split(' ')\r\nprint('YES') if check(na)==5 and check(nb)==7 and check(nc)==5 else print('NO')", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns = ['a','e','i','o','u']\r\na,b,c = 0,0,0\r\nfor i in s1:\r\n if i in s:\r\n a += 1\r\nfor i in s2:\r\n if i in s:\r\n b += 1\r\nfor i in s3:\r\n if i in s:\r\n c += 1\r\nif a==5 and b==7 and c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nif s1.count('a')+s1.count('e')+s1.count('i')+s1.count('o')+s1.count('u') == 5 and s3.count('a')+s3.count('e')+s3.count('i')+s3.count('o')+s3.count('u') == 5 and s2.count('a')+s2.count('e')+s2.count('i')+s2.count('o')+s2.count('u') == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s = input()\r\ns1 = input()\r\ns2 = input()\r\na = int(s.count('i') + s.count('e') + s.count('u') + s.count('a') + s.count('o') )\r\nb = int(s1.count('i') + s1.count('e') + s1.count('u') + s1.count('a') + s1.count('o') )\r\nc = int(s2.count('i') + s2.count('e') + s2.count('u') + s2.count('a') + s2.count('o') )\r\nif a == 5 and b == 7 and c == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a1=input()\r\na2=input()\r\na3=input()\r\ndef nvowel(a=' '):\r\n return a.count(\"a\")+a.count(\"e\")+a.count(\"i\")+a.count(\"o\")+a.count(\"u\")\r\nif(nvowel(a1)==5 and nvowel(a2)==7 and nvowel(a3)==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1=input()\r\ns2=input()\r\ns3=input()\r\nc1=s1.count('a')+s1.count('e')+s1.count('i')+s1.count('o')+s1.count('u')\r\nc2=s2.count('a')+s2.count('e')+s2.count('i')+s2.count('o')+s2.count('u')\r\nc3=s3.count('a')+s3.count('e')+s3.count('i')+s3.count('o')+s3.count('u')\r\nif(c1==5 and c2==7 and c3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = input()\r\nd = input()\r\ne1 = 0\r\ne2 = 0\r\ne3 = 0\r\nif 'a' in a:\r\n e1 += a.count('a')\r\nif 'e' in a:\r\n e1 += a.count('e')\r\nif 'i' in a:\r\n e1 += a.count('i')\r\nif 'o' in a:\r\n e1 += a.count('o')\r\nif 'u' in a:\r\n e1 += a.count('u')\r\nif 'a' in b:\r\n e2 += b.count('a')\r\nif 'e' in b:\r\n e2 += b.count('e')\r\nif 'i' in b:\r\n e2 += b.count('i')\r\nif 'o' in b:\r\n e2 += b.count('o')\r\nif 'u' in b:\r\n e2 += b.count('u')\r\nif 'a' in d:\r\n e3 += d.count('a')\r\nif 'e' in d:\r\n e3 += d.count('e')\r\nif 'i' in d:\r\n e3 += d.count('i')\r\nif 'o' in d:\r\n e3 += d.count('o')\r\nif 'u' in d:\r\n e3 += d.count('u')\r\nif e1 == 5 and e2 == 7 and e3 == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "import re\r\n\r\ndef count_vowels(s):\r\n vowels = \"aeiou\"\r\n return sum([1 for c in s if c in vowels])\r\n \r\ns1 = input().strip()\r\ns2 = input().strip()\r\ns3 = input().strip()\r\nvowels1 = count_vowels(s1)\r\nvowels2 = count_vowels(s2)\r\nvowels3 = count_vowels(s3)\r\nif vowels1 == 5 and vowels2 == 7 and vowels3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = (len(tuple(filter(lambda x: x in \"aeiou\", input()))) for i in range(3))\r\nprint((\"NO\", \"YES\")[tuple(a) == (5, 7, 5)])\r\n", "# LUOGU_RID: 101454266\nprint([sum(s.count(c) for c in 'aeiou') for s in open(0)] == [5, 7, 5] and 'YES' or 'NO')", "s = 'aeiou'\r\nr = \"YES\"\r\nfor i in range(3):\r\n c = 0\r\n for j in input():\r\n if j in s: c += 1\r\n if (c != 7 and i == 1) or (c != 5 and (i == 0 or i == 2)):\r\n r = \"NO\"\r\nprint(r)", "def func(x,y,z):\r\n if x.count(\"a\")+x.count(\"e\")+x.count(\"i\")+x.count(\"o\")+x.count(\"u\")!=5:\r\n return 'NO'\r\n if y.count(\"a\")+y.count(\"e\")+y.count(\"i\")+y.count(\"o\")+y.count(\"u\")!=7:\r\n return 'NO'\r\n if z.count(\"a\")+z.count(\"e\")+z.count(\"i\")+z.count(\"o\")+z.count(\"u\")!=5:\r\n return 'NO'\r\n return \"YES\"\r\ndef main():\r\n x=input()\r\n y=input()\r\n z=input()\r\n print(func(x,y,z))\r\n\r\nmain()\r\n", "a=input().replace(' ','')\r\nb=input().replace(' ','')\r\nc=input().replace(' ','')\r\nl=list('aeiou')\r\nf,d,e=0,0,0\r\nfor i in a:\r\n if i in l:\r\n f+=1\r\nfor i in b:\r\n if i in l:\r\n d+=1\r\nfor i in c:\r\n if i in l:\r\n e+=1\r\nif(f==5 and d==7 and e==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str_1=list(input().split())\nstr_2=list(input().split())\nstr_3=list(input().split())\nstr_01=[]\nstr_02=[]\nstr_03=[]\n# set_1=list(set(str_1))\nfor i in str_1:\n for _ in i:\n str_01.append(_)\nfor i in str_2:\n for _ in i:\n str_02.append(_)\nfor i in str_3:\n for _ in i:\n str_03.append(_)\n# list(set(str_01)\n# set(str_02)\n# set(str_03)\nstr5=str_01.count('a')+str_01.count('e')+str_01.count('i')+str_01.count('o')+str_01.count('u')\nstr7=str_02.count('a')+str_02.count('e')+str_02.count('i')+str_02.count('o')+str_02.count('u')\nstr05=str_03.count('a')+str_03.count('e')+str_03.count('i')+str_03.count('o')+str_03.count('u')\nif str5==5 and str7==7 and str05==5:\n print(\"YES\")\nelse:\n print(\"NO\")", "n=input()\r\nn2=input()\r\nn3=input()\r\nvowels='aeiou'\r\nc=0\r\nc2=0\r\nc3=0\r\nfor i in n:\r\n if i in vowels:\r\n c+=1\r\nfor i in n2:\r\n if i in vowels:\r\n c2+=1\r\nfor i in n3:\r\n if i in vowels:\r\n c3+=1\r\nif c==5 and c2==7 and c3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s1 = list(input())\r\ns2 = list(input())\r\ns3 = list(input())\r\n\r\nj = 0\r\nr = 0\r\nl = 0\r\nfor i in range(len(s1)):\r\n if s1[i] == \"a\" or s1[i] == \"e\" or s1[i] == \"i\" or s1[i] == \"o\" or s1[i] == \"u\":\r\n j += 1\r\nfor i in range(len(s2)):\r\n if s2[i] == \"a\" or s2[i] == \"e\" or s2[i] == \"i\" or s2[i] == \"o\" or s2[i] == \"u\":\r\n r += 1\r\nfor i in range(len(s3)):\r\n if s3[i] == \"a\" or s3[i] == \"e\" or s3[i] == \"i\" or s3[i] == \"o\" or s3[i] == \"u\":\r\n l += 1\r\nif j != 5 or r != 7 or l != 5:\r\n print(\"NO\")\r\n quit()\r\nprint(\"YES\")\r\n", "line = []\nfor i in range(3):\n line.append(input())\ncount = 0\noutput_jud = []\nfor i in line:\n for char in i:\n if char == \"a\"or \\\n char == \"e\"or\\\n char == \"i\"or \\\n char == \"o\" or \\\n char == \"u\" :\n count += 1\n output_jud.append(count)\n count = 0\nif output_jud[0] == 5 and output_jud[1] == 7 and output_jud[2] == 5:\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", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\na = ['a', 'e', 'i', 'o', 'u']\r\nkol1 = kol2 = kol3 = 0\r\nfor i in range(len(s1)):\r\n if s1[i] in a:\r\n kol1 += 1\r\nfor i in range(len(s2)):\r\n if s2[i] in a:\r\n kol2 += 1\r\nfor i in range(len(s3)):\r\n if s3[i] in a:\r\n kol3 += 1\r\nif kol1 == 5 and kol2 == 7 and kol3 == 5:print('YES')\r\nelse:print('NO')\r\n", "from re import sub\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\n\r\na = sub(r'[^aeiou]', '', a)\r\nb = sub(r'[^aeiou]', '', b)\r\nc = sub(r'[^aeiou]', '', c)\r\n\r\nx = len(a) == 5 and len(b) == 7 and len(c) == 5\r\nprint('YES' if x else 'NO')", "def count_gl(s):\r\n r = 0\r\n for x in s:\r\n if x in \"auioe\":\r\n r += 1\r\n return r\r\n\r\npoem = [input() for i in range(3)]\r\n\r\nn_gl = list(map(count_gl, poem))\r\nif n_gl == [5, 7, 5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = str(input())\r\ns2 = str(input())\r\ns3 = str(input())\r\n\r\nc1,c2,c3=0,0,0\r\n\r\nvowels = [\"a\",\"e\",\"i\",\"u\",\"o\"]\r\n\r\nfor i in s1:\r\n if i in vowels:\r\n c1 += 1\r\nfor j in s2:\r\n if j in vowels:\r\n c2 += 1\r\n\r\nfor x in s3:\r\n if x in vowels:\r\n c3 += 1\r\n\r\nif c1==5 and c2==7 and c3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l='aioue'\r\nx=input()\r\ny=input()\r\nz=input()\r\nxx,yy,zz=0,0,0\r\nfor i in x:\r\n if(i in l):\r\n xx+=1\r\nfor i in y:\r\n if(i in l):\r\n yy+=1\r\nfor i in z:\r\n if(i in l):\r\n zz+=1\r\nif(xx==5 and yy==7 and zz==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1, s2, s3 = input(), input(), input()\r\ncnt1 = 0\r\ncnt2 = 0\r\ncnt3 = 0\r\nstring = \"aeiou\"\r\nfor i in range(len(s1)):\r\n if s1[i] in string:\r\n cnt1 += 1\r\nfor i in range(len(s2)):\r\n if s2[i] in string:\r\n cnt2 += 1\r\nfor i in range(len(s3)):\r\n if s3[i] in string:\r\n cnt3 += 1\r\nif cnt1 == 5 and cnt3 == 5 and cnt2 == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "bien = True\nbuena = [5,7,5]\nvowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\nfor i in range(3):\n frase = input().strip()\n contador = 0\n for j in frase:\n if j in vowels:\n contador += 1\n if contador != buena[i]:\n bien = False\n\nif bien:\n print(\"YES\")\nelse:\n print(\"NO\")", "s1=input()\r\ns2=input()\r\ns3=input()\r\n\r\ns1.replace(' ','')\r\ns2.replace(' ','')\r\ns3.replace(' ','')\r\ncond=False\r\ncount=0\r\nfor i in range(0,len(s1)):\r\n if s1[i]=='a' or s1[i]=='e' or s1[i]=='i' or s1[i]=='o' or s1[i]=='u':\r\n count+=1\r\n\r\nif count==5:\r\n count=0\r\n for i in range(0,len(s2)):\r\n if s2[i]=='a' or s2[i]=='e' or s2[i]=='i' or s2[i]=='o' or s2[i]=='u':\r\n count+=1\r\n\r\nif count==7:\r\n count=0\r\n for i in range(0,len(s3)):\r\n if s3[i]=='a' or s3[i]=='e' or s3[i]=='i' or s3[i]=='o' or s3[i]=='u':\r\n count+=1\r\n\r\nif count==5:\r\n cond=True\r\n\r\nif cond:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a1=input()\r\na2=input()\r\na3=input()\r\nif a1.count('a')+a1.count('e')+a1.count('i')+a1.count('u')+a1.count('o')==5 and a2.count('a')+a2.count('e')+a2.count('i')+a2.count('u')+a2.count('o')==7 and a3.count('a')+a3.count('e')+a3.count('i')+a3.count('u')+a3.count('o')==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "def f(s):\r\n st = {\"a\", \"e\", \"i\", \"o\", \"u\"}\r\n d = 0\r\n for c in s:\r\n if(c in st):\r\n d += 1\r\n return d\r\nprint((\"NO\",\"YES\")[f(input()) == 5 and f(input()) == 7 and f(input()) == 5])\r\n \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 = get_string()\r\nb = get_string()\r\nc = get_string()\r\nvowel = set('aeiou')\r\nc1 = c2 = c3 = 0\r\nfor i in a:\r\n if i in vowel:\r\n c1 += 1\r\nfor i in b:\r\n if i in vowel:\r\n c2 += 1\r\nfor i in c:\r\n if i in vowel:\r\n c3 += 1\r\nif c1==5 and c2==7 and c3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "\r\nrow = input()\r\nrow1 = input()\r\nrow2 = input()\r\n\r\nvowel = ['a', 'e', 'u','i','o']\r\nnumf = 0\r\nnums = 0\r\nnumt = 0\r\n\r\nfor x in row.split():\r\n for j in x:\r\n if j in vowel: numf = numf+1\r\n\r\nif numf == 5:\r\n for x in row1.split():\r\n for j in x:\r\n if j in vowel: nums = nums + 1\r\n if nums ==7:\r\n for x in row2.split():\r\n for j in x:\r\n if j in vowel: numt = numt + 1\r\n if numt ==5: print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\n#Counts the number of vowels in a string\r\ndef count_vowels(s):\r\n\ta = s.count('a')\r\n\te = s.count('e')\r\n\ti = s.count('i')\r\n\to = s.count('o')\r\n\tu = s.count('u')\r\n\treturn a+e+i+o+u\r\n\r\nv1 = count_vowels(input())\r\nv2 = count_vowels(input())\r\nv3 = count_vowels(input())\r\n\r\nif v1 == 5 and v2 == 7 and v3 == 5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "line1 = input()\nline2 = input()\nline3 = input()\n\ns1 = line1.count(\"a\") + line1.count(\"e\") + line1.count(\"i\") + line1.count(\"o\") + line1.count(\"u\")\ns2 = line2.count(\"a\") + line2.count(\"e\") + line2.count(\"i\") + line2.count(\"o\") + line2.count(\"u\")\ns3 = line3.count(\"a\") + line3.count(\"e\") + line3.count(\"i\") + line3.count(\"o\") + line3.count(\"u\")\n\nif s1 != 5 or s2 != 7 or s3 != 5:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "vowels = ['a','e','i','o','u']\r\na = [i for i in str(input()) if i in vowels]\r\nb = [i for i in str(input()) if i in vowels]\r\nc = [i for i in str(input()) if i in vowels]\r\nif len(a)==len(c)==5 and len(b)==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n poems = [input() for _ in range(3)]\r\n vowels = ['a','e','i','o','u']\r\n flag = True\r\n\r\n for i in range(len(poems)):\r\n line = poems[i]\r\n count = 0\r\n\r\n for item in line:\r\n if item.lower() in vowels:\r\n count += 1\r\n \r\n if i == 1 and count != 7:\r\n flag = False\r\n break\r\n if i != 1 and count != 5:\r\n flag = False\r\n break\r\n \r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def vowels(s):\r\n c=0\r\n c=s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')\r\n return c\r\na=input()\r\nb=input()\r\nc=input()\r\nr1=vowels(a)\r\nr2=vowels(b)\r\nr3=vowels(c)\r\nif r1==5 and r2==7 and r3==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "v=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nl=[]\r\nfor i in range(1,4):\r\n s=input().replace(\" \",\"\")\r\n count=0\r\n for j in s:\r\n if j in v:\r\n count+=1\r\n l.append(count)\r\nif l[0]==5 and l[1]==7 and l[2]==5 and sum(l)==17:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nmsg = sys.stdin.readlines()\r\nf1,f2,f3=5,7,5\r\nfor i in range(len(msg)):\r\n if(i==0):\r\n for word in range(len(msg[i])):\r\n if msg[i][word]=='a' or msg[i][word]=='e' or msg[i][word]=='i'or msg[i][word]=='o' or msg[i][word]=='u':\r\n f1-=1\r\n \r\n if(i==1):\r\n for word in range(len(msg[i])):\r\n if msg[i][word]=='a' or msg[i][word]=='e' or msg[i][word]=='i'or msg[i][word]=='o' or msg[i][word]=='u':\r\n f2-=1\r\n \r\n if(i==2):\r\n for word in range(len(msg[i])):\r\n if msg[i][word]=='a' or msg[i][word]=='e' or msg[i][word]=='i'or msg[i][word]=='o' or msg[i][word]=='u':\r\n f3-=1\r\nif f1==0 and f2==0 and f3==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check(line):\r\n\treturn sum([line.count('o'), line.count('a'), line.count('e'), line.count('i'), line.count('u')])\r\n\r\nfirst = check(input())\r\nsecond = check(input())\r\nthird = check(input())\r\n\r\nif first != 5 or second != 7 or third !=5:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\r\n\r\n\r\n", "line1 = input()\r\nline2 = input()\r\nline3 = input()\r\n\r\nvowels_1 = line1.count('a') + line1.count('e') + line1.count('i') + line1.count('o') + line1.count('u')\r\nvowels_2 = line2.count('a') + line2.count('e') + line2.count('i') + line2.count('o') + line2.count('u')\r\nvowels_3 = line3.count('a') + line3.count('e') + line3.count('i') + line3.count('o') + line3.count('u')\r\n\r\nif vowels_1 ==5 and vowels_2 == 7 and vowels_3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a=input()\r\nb=input()\r\nc=input()\r\nq=0\r\nw=0\r\ne=0\r\na=a.replace(\" \",\"\")\r\nb=b.replace(\" \",\"\")\r\nc=c.replace(\" \",\"\")\r\nfor i in range(len(a)):\r\n if(a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' ):\r\n q+=1\r\nfor i in range(len(b)):\r\n if(b[i]=='a' or b[i]=='e' or b[i]=='i' or b[i]=='o' or b[i]=='u' ):\r\n w+=1\r\nfor i in range(len(c)):\r\n if(c[i]=='a' or c[i]=='e' or c[i]=='i' or c[i]=='o' or c[i]=='u' ):\r\n e+=1\r\nif(q==5 and w==7 and e==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "st=input()\nc1=0\nc2=0\nc3=0\nfor i in st:\n if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n c1+=1\n\nst=input()\nfor i in st:\n if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n c2+=1\n\nst=input()\nfor i in st:\n if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n c3+=1\n\nif(c1==5 and c2==7 and c3==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t\t\t\t \t \t\t \t\t\t\t\t\t", "l1 = input().lower()\r\nl2 = input().lower()\r\nl3 = input().lower()\r\nv = \"aeiou\"\r\nv_count = []\r\nlines = [l1, l2, l3]\r\nfor i in lines:\r\n count = 0\r\n for j in i:\r\n if j in v:\r\n count += 1\r\n v_count.append(count)\r\nif v_count == [5, 7, 5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(107)\ninf=1020\nmod=10*9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n boins=['a','i','u','e','o']\n a=S()\n b=S()\n c=S()\n\n c1=c2=c3=0\n\n for x in a:\n if x in boins:\n c1+=1\n\n for x in b:\n if x in boins:\n c2+=1\n\n for x in c:\n if x in boins:\n c3+=1\n\n if c1==5 and c2==7 and c3==5:\n return 'YES'\n return 'NO'\n\n# main()\nprint(main())\n", "a = input()\r\nb = input()\r\nc = input()\r\nv1 = a.count('a')+a.count('e')+a.count('i')+a.count('o')+a.count('u')\r\nv2 = b.count('a')+b.count('e')+b.count('i')+b.count('o')+b.count('u')\r\nv3 = c.count('a')+c.count('e')+c.count('i')+c.count('o')+c.count('u')\r\nif v1 == 5 and v2 == 7 and v3 == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = 3\nhaiku = True\nfor i in range(3):\n line = input()\n t = 0\n vowels = ['a', 'e', 'i', 'o', 'u']\n for c in line:\n if c in vowels:\n t += 1\n if i % 2 == 0:\n if t != 5:\n haiku = False\n else:\n if t != 7:\n haiku = False\nif haiku:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t \t\t \t\t \t\t \t\t\t\t \t\t \t\t\t\t \t", "s1=input().strip()\r\ns2=input().strip()\r\ns3=input().strip()\r\ncount1=count2=count3=0\r\n\r\nfor i in range(len(s1)):\r\n# print(s1[i])\r\n if s1[i]==\"a\" or s1[i]==\"e\" or s1[i]==\"i\" or s1[i]==\"u\" or s1[i]==\"o\":\r\n\r\n count1+=1\r\n\r\nfor i in range(len(s2)):\r\n if s2[i]==\"a\" or s2[i]==\"e\" or s2[i]==\"i\"or s2[i]==\"u\"or s2[i]==\"o\":\r\n count2+=1\r\n\r\n\r\nfor i in range(len(s3)):\r\n if s3[i]==\"a\" or s3[i]==\"e\" or s3[i]==\"i\"or s3[i]==\"u\"or s3[i]==\"o\":\r\n count3+=1\r\n\r\n elif s3[i]==\" \":\r\n continue\r\n\r\nif count1==5 and count2==7 and count3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\n\r\nc1=0\r\nc2=0\r\nc3=0\r\n\r\nfor i in a:\r\n if i=='a' or i== 'e' or i== 'i' or i=='o' or i=='u':\r\n c1=c1+1\r\n \r\nfor i in b:\r\n if i=='a' or i== 'e' or i== 'i' or i=='o' or i=='u':\r\n c2=c2+1\r\nfor i in c:\r\n if i=='a' or i== 'e' or i== 'i' or i=='o' or i=='u':\r\n c3=c3+1\r\n \r\nprint(\"YES\" if (c1== 5 and c2== 7 and c3== 5) else \"NO\")", "h = []\r\nh.extend(input() for _ in range(3))\r\nv = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\ns = [sum(line.count(e) for e in v) for line in h]\r\nprint('YES' if s == [5, 7, 5] else 'NO')", "l = list(input())\r\nn = list(input())\r\ng = list(input())\r\ncount1 = 0\r\ncount2 = 0\r\ncount3 = 0\r\nfor i in l:\r\n if i == \"a\" or i == \"e\"or i == \"i\"or i == \"o\"or i == \"u\":\r\n count1 += 1\r\nfor j in n:\r\n if j == \"a\" or j == \"e\"or j == \"i\"or j == \"o\"or j == \"u\":\r\n count2 += 1\r\nfor k in g:\r\n if k == \"a\" or k == \"e\"or k == \"i\"or k == \"o\"or k == \"u\":\r\n count3 += 1\r\nif count1 == 5 and count2 == 7 and count3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\nif a.count('a')+a.count('e')+a.count('i')+a.count('o')+a.count('u')==5 and b.count('a')+b.count('e')+b.count('i')+b.count('o')+b.count('u')==7 and c.count('a')+c.count('e')+c.count('i')+c.count('o')+c.count('u')==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "vowels = [\"a\",\"e\",\"i\",\"o\",\"u\"]\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\na,b,c = 0,0,0\r\nfor i in s1:\r\n\tif i in vowels:\r\n\t\ta+=1\r\nfor i in s2:\r\n\tif i in vowels:\r\n\t\tb+=1\r\nfor i in s3:\r\n\tif i in vowels:\r\n\t\tc+=1\r\nif a == 5 and b == 7 and c == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "from functools import reduce\r\n\r\nvow = 'aeiou'\r\na, b, c = input(), input(), input()\r\ncount_a = reduce(lambda aa, bb: aa + a.count(bb), vow, 0)\r\ncount_b = reduce(lambda aa, bb: aa + b.count(bb), vow, 0)\r\ncount_c = reduce(lambda aa, bb: aa + c.count(bb), vow, 0)\r\n\r\nif (count_a, count_b, count_c) == (5, 7, 5):\r\n print('YES')\r\nelse:\r\n print('NO')", "x=input()\r\ny=input()\r\nz=input()\r\nc1=x.count(\"a\")+x.count(\"e\")+x.count(\"i\")+x.count(\"o\")+x.count(\"u\")\r\nc2=y.count(\"a\")+y.count(\"e\")+y.count(\"i\")+y.count(\"o\")+y.count(\"u\")\r\nc3=z.count(\"a\")+z.count(\"e\")+z.count(\"i\")+z.count(\"o\")+z.count(\"u\")\r\nif c1==5 and c2==7 and c3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, b, c = list(input()), list(input()), list(input())\r\nt1, t2, t3 = 0, 0, 0\r\nfor i in a:\r\n if i=='a' or i=='i' or i=='o' or i=='e' or i=='u':\r\n t1+=1\r\nfor i in b:\r\n if i=='a' or i=='i' or i=='o' or i=='e' or i=='u':\r\n t2+=1\r\nfor i in c:\r\n if i=='a' or i=='i' or i=='o' or i=='e' or i=='u':\r\n t3+=1\r\nif t1==5 and t2==7 and t3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def haiku(n1,n2,n3):\r\n vowels = {'a','e','i','o','u'}\r\n count = 0\r\n for i in n1:\r\n if i in vowels:\r\n count += 1\r\n if count != 5:\r\n return False\r\n \r\n count = 0\r\n for i in n2:\r\n if i in vowels:\r\n count += 1\r\n if count != 7:\r\n return False\r\n \r\n count = 0\r\n for i in n3:\r\n if i in vowels:\r\n count += 1\r\n if count != 5:\r\n return False\r\n \r\n return True\r\n\r\n\r\nif __name__ == '__main__':\r\n n1 = input()\r\n n2 = input()\r\n n3 = input()\r\n \r\n if haiku(n1,n2,n3):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "vowel = [ \"a\", \"e\", \"i\", \"o\", \"u\"]\r\ncount = 0\r\nfor i in range(3):\r\n count = 0\r\n a = input()\r\n if i == 0 or i == 2:\r\n for j in vowel:\r\n count += a.count(j)\r\n if count != 5:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n for j in vowel:\r\n count += a.count(j)\r\n if count != 7:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n\r\n\r\n\r\n\r\n", "s = input()\r\ns2 = input()\r\ns3 = input()\r\n\r\ns = s.replace(\" \",\"\")\r\ns2 = s2.replace(\" \",\"\")\r\ns3 = s3.replace(\" \",\"\")\r\n\r\nl1 = 0\r\nl2 = 0\r\nl3 = 0\r\n\r\nfor i in s:\r\n if i== \"a\" or i== \"e\" or i== \"o\" or i== \"i\" or i== \"u\":\r\n l1 += 1\r\n\r\nfor i in s2:\r\n if i== \"a\" or i== \"e\" or i== \"o\" or i== \"i\" or i== \"u\":\r\n l2 += 1\r\n\r\nfor i in s3:\r\n if i== \"a\" or i== \"e\" or i== \"o\" or i== \"i\" or i== \"u\":\r\n l3 += 1\r\n\r\nif l1 == 5 and l2 == 7 and l3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ncnt1 = 0\r\ncnt2 = 0\r\ncnt3 = 0\r\nar, = 'aeuio'\r\nfor i in s1:\r\n if i in ar:\r\n cnt1 += 1\r\nfor i in s2:\r\n if i in ar:\r\n cnt2 += 1\r\nfor i in s3:\r\n if i in ar:\r\n cnt3 += 1\r\nif cnt1 == cnt3 == 5 and cnt2 == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "################### -- coding: utf-8 -- ###################\r\n # > File Name : a.py\r\n # > Author : omemi\r\n # > Created Time : 2022/1/30 14:16:40\r\n#############################################################\r\n\r\na, b, c = input(), input(), input()\r\nx, y, z = 0, 0, 0\r\n\r\nfor i in a:\r\n if i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n x += 1\r\nfor i in b:\r\n if i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n y += 1\r\nfor i in c:\r\n if i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n z += 1\r\nif x == 5 and y == 7 and z == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "b = True\nfor i in range(3):\n\ts = input()\n\tcnt = 0\n\tfor j in s:\n\t\tif j == 'a' or j == 'e' or j == 'i' or j == 'o' or j == 'u':\n\t\t\tcnt += 1\n\tif ((i == 0 or i == 2) and cnt != 5) or (i == 1 and cnt != 7):\n\t\tb = False\nif b:\n\tprint('YES')\nelse:\n\tprint('NO')", "d = ['a', 'e', 'i', 'u', 'o']\r\na = input()\r\nif sum(a.count(e) for e in d)!=5:\r\n\tprint(\"NO\")\r\n\texit(0)\r\nb = input()\r\nif sum(b.count(e) for e in d)!=7:\r\n\tprint(\"NO\")\r\n\texit(0)\r\nc = input()\r\nif sum(c.count(e) for e in d)!=5:\r\n\tprint(\"NO\")\r\n\texit(0)\r\nprint(\"YES\")", "s = [0]3\r\nslog = [0]3\r\nfor i in range(3):\r\n s[i] = input()\r\n slog[i] = s[i].count(\"a\") + s[i].count(\"e\") + s[i].count(\"i\") + s[i].count(\"o\") + s[i].count(\"u\")\r\nif slog[0] == 5 and slog[1] == 7 and slog[2] == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=[input() for i in range(3)]\r\nvo=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nfor i in range(3):\r\n\tv=0\r\n\tfor j in a[i]:\r\n\t\tif j in vo:\r\n\t\t\tv+=1\r\n\tif i%2==0 and v!=5:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\telif i==1 and v!=7:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "def is_v(c):\r\n if(c=='a' or c=='e' or c=='i' or c=='o' or c=='u'):\r\n return 1\r\n else:\r\n return 0\r\na = input()\r\nb = input()\r\nc = input()\r\nc_a = 0\r\nc_b = 0\r\nc_c = 0\r\nfor i in range(len(a)):\r\n if(is_v(a[i])):\r\n c_a+=1\r\nfor i in range(len(b)):\r\n if(is_v(b[i])):\r\n c_b+=1\r\nfor i in range(len(c)):\r\n if(is_v(c[i])):\r\n c_c+=1\r\nif(c_a==5 and c_b==7 and c_c==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "import re\r\n\r\ns1=input()\r\ns2=input()\r\ns3=input()\r\n\r\nif(len(re.findall(r'[a,e,i,o,u]{1}',s1))==5 and len(re.findall(r'[a,e,i,o,u]{1}',s2))==7 and len(re.findall(r'[a,e,i,o,u]{1}',s3))==5):\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "\r\ns1 =input()\r\ns2=input()\r\ns3=input()\r\nvow=0\r\nvow1=0\r\nvow2=0\r\nl = ['a' , 'e' , 'i', 'o', 'u']\r\nfor i in range(len(s1)):\r\n if(s1[i]=='a' or s1[i]=='e' or s1[i]=='i' or s1[i]=='o' or s1[i]=='u' ):\r\n vow+=1\r\nfor j in range(len(s2)):\r\n if(s2[j]=='a' or s2[j]=='e' or s2[j]=='i' or s2[j]=='o' or s2[j]=='u' ):\r\n vow1+=1\r\nfor k in range(len(s3)):\r\n if(s3[k]=='a' or s3[k]=='e' or s3[k]=='i' or s3[k]=='o' or s3[k]=='u' ):\r\n vow2+=1\r\nif(vow==5 and vow1==7 and vow2==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\n\ns1 = input()\ns2 = input()\ns3 = input()\n\nif(len(re.findall(r'[a,e,i,o,u]{1}',s1))==5 and len(re.findall(r'[a,e,i,o,u]{1}',s2))==7 and len(re.findall(r'[a,e,i,o,u]{1}',s3))==5):\n print('YES')\nelse:\n print(\"NO\")\n", "\r\nvowel_list = ['a','e','i','o','u']\r\nl1 = len([i for i in input() if i in vowel_list])\r\nl2 = len([i for i in input() if i in vowel_list])\r\nl3 = len([i for i in input() if i in vowel_list])\r\n\r\nprint(\"YES\" if l1 == 5 and l2 == 7 and l3 == 5 else \"NO\")", "haiku = []\r\nsyllable = [5, 7, 5]\r\nvowel = ['a', 'e', 'i', 'o', 'u']\r\nv = 1\r\n\r\nfor i in range(3):\r\n haiku.append(input())\r\n\r\nfor i in range(3):\r\n s = 0\r\n for j in range(5):\r\n s += haiku[i].count(vowel[j]) \r\n if s != syllable[i]:\r\n v = 0\r\n\r\nif v:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def count_vowels(s):\n vowels = 'aeiou'\n c = 0\n for i in s :\n if i in vowels:\n c+=1\n return c\nres = True\nfor i in range(3):\n if i ==1:\n res = count_vowels(input()) == 7 and res\n else:\n res = count_vowels(input()) == 5 and res\nif res :\n print('YES')\nelse :\n print('NO')", "def haiku(line):\n\tvowel = 'aiueo'\n\tcount = 0\n\tfor i in line:\n\t\tif i in vowel:\n\t\t\tcount = count + 1\n\treturn count\n\n\nfirst = input().lower()\nsecond = input().lower()\nthird = input().lower()\n\n\n\nif haiku(first) == 5 and haiku(second) == 7 and haiku(third) == 5:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n ", "l1 = input()\r\nl2 = input()\r\nl3 = input()\r\nl1vow = 0\r\nl2vow = 0\r\nl3vow = 0\r\nfor c in l1:\r\n if c in 'aeiou':\r\n l1vow += 1\r\nfor c in l2:\r\n if c in 'aeiou':\r\n l2vow += 1\r\nfor c in l3:\r\n if c in 'aeiou':\r\n l3vow += 1\r\nif l1vow == 5 and l2vow == 7 and l3vow == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "p = [input() for i in range(3)]\r\ncount = lambda x: sum(p[x].count(c) for c in \"aeiou\")\r\nprint(\"YNEOS\"[count(0)!=5 or count(1)!=7 or count(2)!=5::2])\r\n\r\n## new ", "a = [5,7,5]\r\nv = \"aeiou\"\r\nr = True\r\nfor i in range(3):\r\n s = input()\r\n c = 0\r\n for x in s:\r\n if x in v:\r\n c += 1\r\n if c != a[i]:\r\n print('NO')\r\n r = False\r\n break\r\nif r == True:\r\n print('YES')", "s1 = list(input())\r\ns2 = list(input())\r\ns3 = list(input())\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\nfor cur in s1:\r\n if cur == \"a\" or cur == \"e\" or cur == \"i\" or cur == \"o\" or cur == \"u\":\r\n c1 += 1\r\nfor cur in s2:\r\n if cur == \"a\" or cur == \"e\" or cur == \"i\" or cur == \"o\" or cur == \"u\":\r\n c2 += 1\r\nfor cur in s3:\r\n if cur == \"a\" or cur == \"e\" or cur == \"i\" or cur == \"o\" or cur == \"u\":\r\n c3 += 1\r\n\r\nif c1 == 5 and c2 == 7 and c3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "flag = \"YES\"\r\nvowels = \"aeiou\"\r\ncheck = set(vowels)\r\nfor i in range(3):\r\n line = str(input())\r\n vowel_count = 0\r\n for j in line:\r\n if j in check:\r\n vowel_count += 1\r\n\r\n if i == 0 and vowel_count != 5 or i == 1 and vowel_count != 7 or i == 2 and vowel_count != 5:\r\n flag = \"NO\"\r\n\r\nprint(flag)", "l1=list(input().split())\r\nl2=list(input().split())\r\nl3=list(input().split())\r\ncount=0\r\nfor i in l1:\r\n for j in range(len(i)):\r\n if(i[j]=='a' or i[j]=='e' or i[j]=='i' or i[j]=='o' or i[j]=='u'):\r\n count+=1\r\n \r\n \r\nif(count==5):\r\n count=0\r\n for i in l2:\r\n for j in range(len(i)):\r\n if(i[j]=='a' or i[j]=='e' or i[j]=='i' or i[j]=='o' or i[j]=='u'):\r\n count+=1\r\n if(count==7):\r\n count=0\r\n for i in l3:\r\n for j in range(len(i)):\r\n if(i[j]=='a' or i[j]=='e' or i[j]=='i' or i[j]=='o' or i[j]=='u'):\r\n count+=1\r\n if(count==5):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n ", "isOk = \"YES\"\r\ns = input()\r\nif s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')!=5 : isOk = \"NO\" \r\ns = input()\r\nif s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')!=7 : isOk = \"NO\" \r\ns = input()\r\nif s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')!=5 : isOk = \"NO\" \r\nprint(isOk)", "a=input();a=sum(map(lambda x: True if x in \"aeiuo\" else False, a))\r\nb=input();b=sum(map(lambda x: True if x in \"aeiuo\" else False, b))\r\nc=input();c=sum(map(lambda x: True if x in \"aeiuo\" else False, c))\r\nprint(\"YES\" if (a,b,c) == (5,7,5) else \"NO\")", "vowels = ['a', 'e', 'i', 'o', 'u']\r\n\r\n\r\ndef haiku(x):\r\n count = 0\r\n for elem in x:\r\n if elem in vowels:\r\n count += 1\r\n return count\r\n\r\n\r\ns = input()\r\nt = input()\r\nw = input()\r\nif haiku(s) == 5 and haiku(t) == 7 and haiku(w) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\n\r\ndef haiku(s):\r\n ans = 0\r\n ans += s.count(\"a\", 0, len(s))\r\n ans += s.count(\"e\", 0, len(s))\r\n ans += s.count(\"i\", 0, len(s))\r\n ans += s.count(\"o\", 0, len(s))\r\n ans += s.count(\"u\", 0, len(s))\r\n return ans\r\n \r\ns = str(input())\r\nif haiku(s) != 5:\r\n print(\"NO\")\r\n sys.exit()\r\ns = str(input())\r\nif haiku(s) != 7:\r\n print(\"NO\")\r\n sys.exit()\r\ns = str(input())\r\nif haiku(s) != 5:\r\n print(\"NO\")\r\n sys.exit()\r\nprint(\"YES\")\r\n", "l1 = input()\r\nl2 = input()\r\nl3 = input()\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor i in l1:\r\n if i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n c1 += 1\r\nfor i in l2:\r\n if i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n c2 += 1\r\nfor i in l3:\r\n if i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n c3 += 1\r\nif c1==5 and c2==7 and c3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\na=input()\r\nb=input()\r\nc=input()\r\nx=0\r\ny=0\r\nz=0\r\nfor i in t:\r\n x+=a.count(i)\r\n y+=b.count(i)\r\n z+=c.count(i)\r\nif(x==5 and y==7 and z==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "print('YES' if [sum(s.count(x) for x in \"aeiou\") for s in [input() for _ in range(3)]]==[5,7,5] else 'NO')\n \t\t\t\t \t\t \t \t \t \t \t\t\t\t\t\t \t\t", "from collections import Counter\r\nt = 'aioue'\r\nq = input()\r\nw = input()\r\nr = input()\r\np = Counter(q)\r\nv = Counter(w)\r\nb = Counter(r)\r\nif (p['a'] + p['i'] + p['o'] + p['u'] + p['e']) == 5 and (v['a'] + v['i'] + v['o'] + v['u'] + v['e']) == 7 and (b['a'] + b['i'] + b['o'] + b['u'] + b['e']) == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# Хайку\r\n\r\ndef skolko_slogov_v_str(str):\r\n\tcnt = 0\r\n\tfor bukva in str:\r\n\t\tfor glas in ['a','e','i','o','u']:\r\n\t\t\tif bukva == glas:\r\n\t\t\t\tcnt += 1\r\n\treturn cnt\r\n\r\nstatus = \"NO\"\r\nif skolko_slogov_v_str(input()) == 5:\r\n\tif skolko_slogov_v_str(input()) == 7:\r\n\t\tif skolko_slogov_v_str(input()) == 5:\r\n\t\t\tstatus =\"YES\"\r\n\r\nprint(status)", "a = input()\r\nb = input()\r\nc = input()\r\nx, y, z = 0, 0, 0\r\nfor ch in a:\r\n if ch in 'aeiou':\r\n x += 1\r\nfor ch in b:\r\n if ch in 'aeiou':\r\n y += 1\r\nfor ch in c:\r\n if ch in 'aeiou':\r\n z += 1\r\nif x == 5 and y == 7 and z == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "first = 0\r\nsecond = 0\r\nthird = 0\r\n\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\nfor cur in s1:\r\n if cur in \"aeiou\":\r\n first += 1\r\nfor cur in s2:\r\n if cur in \"aeiou\":\r\n second += 1\r\nfor cur in s3:\r\n if cur in \"aeiou\":\r\n third += 1 \r\n\r\nif first==5 and second==7 and third==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def countVowels(string) :\r\n vowels = \"aeiou\"\r\n count = 0\r\n for i in string:\r\n if i in vowels:\r\n count+=1\r\n return count\r\n \r\npoem = []\r\nfor i in range(3) :\r\n poem.append(input())\r\n \r\nisHaiku = True \r\nfor i in range(len(poem)) :\r\n temp = poem[i].lower()\r\n count = countVowels(temp)\r\n if i == 0 or i == 2 :\r\n if count == 5 :\r\n pass\r\n else: \r\n isHaiku = False\r\n break\r\n else :\r\n if count == 7 :\r\n pass\r\n else :\r\n isHaiku = False\r\n break\r\nprint(\"YES\" if isHaiku else \"NO\")", "a = str(input())\r\nb = str(input())\r\nc = str(input())\r\ndef fun(f):\r\n x = 0\r\n for i in range(0, len(f)):\r\n if f[i] == 'a'or f[i] == 'e' or f[i] == 'i'or f[i] == 'o' or f[i] == 'u':\r\n x+=1\r\n return x\r\nif fun(a) == 5 and fun(b) == 7 and fun(c) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "l=[0]3\r\n\r\nfor i in range(3):\r\n n=input()\r\n l[i]=sum(n.count(x) for x in 'aeiou')\r\n\r\n \r\na,b,c=l \r\nprint('YES' if a==5 and b==7 and c==5 else 'NO')\r\n", "a,b,c=input(),input(),input()\r\ndef cnt(s):\r\n ans=0\r\n for e in s:\r\n ans+= e in \"aeiou\"\r\n return ans\r\nprint(\"YES\" if cnt(a)==cnt(c)==5 and cnt(b)==7 else \"NO\")\r\n", "s = input()\r\ns1 = input()\r\ns2 =input()\r\ncount = 0 \r\ncount1 =0\r\ncount2 =0 \r\nfor i in (s) : \r\n if i in [\"a\", \"e\", \"i\", \"o\" ,\"u\"] : \r\n count += 1 \r\nfor i in (s1) : \r\n if i in [\"a\", \"e\", \"i\", \"o\" ,\"u\"] : \r\n count1 += 1 \r\nfor i in (s2) : \r\n if i in [\"a\", \"e\", \"i\", \"o\" ,\"u\"] : \r\n count2 += 1 \r\nif count ==5 and count1 == 7 and count2 == 5 : \r\n print(\"YES\")\r\nelse : \r\n print(\"NO\")", "syllables = ['a','i','e','o','u']\r\nfor i in range(3):\r\n count=0\r\n sentence = input().strip().lower()\r\n for j in sentence:\r\n if (j in syllables):\r\n count+=1\r\n if i==0 and count!=5:\r\n print(\"NO\")\r\n break\r\n elif i==1 and count!=7:\r\n print(\"NO\")\r\n break\r\n elif i==2 and count!=5:\r\n print(\"NO\")\r\n elif i==2:\r\n print(\"YES\")\r\n", "#!/usr/bin/env python3 \r\n\r\nvowels = ['a', 'e', 'i', 'o', 'u']\r\n\r\nline1 = input()\r\nline2 = input()\r\nline3 = input()\r\n\r\ndef nr_vowels(line):\r\n return sum(line.count(letter) for letter in vowels)\r\n\r\nif (nr_vowels(line1) == 5) and (nr_vowels(line2) == 7) and (nr_vowels(line3) == 5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nk1=0\r\nk2=0\r\nk3=0\r\nfor i in range(len(s1)):\r\n if s1[i]=='a' or s1[i]=='e' or s1[i]=='i' or s1[i]=='o' or s1[i]=='u':\r\n k1=k1+1\r\nfor i in range(len(s2)):\r\n if s2[i]=='a' or s2[i]=='e' or s2[i]=='i' or s2[i]=='o' or s2[i]=='u':\r\n k2=k2+1\r\nfor i in range(len(s3)):\r\n if s3[i]=='a' or s3[i]=='e' or s3[i]=='i' or s3[i]=='o' or s3[i]=='u':\r\n k3=k3+1\r\nif k1==5 and k2==7 and k3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "ans = True\r\n\r\nfor i in range(3):\r\n s = input()\r\n t = s.count(\"a\")+s.count(\"e\")+s.count(\"i\")+s.count(\"o\")+s.count(\"u\")\r\n if t != [5,7,5][i]:\r\n ans = False\r\n\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def count_syllables(sent):\n vowels = 0\n for letter in sent:\n if (letter.lower() in ['a', 'e', 'i', 'o', 'u']):\n vowels += 1\n return vowels\n\n\nsent1 = input()\nsent2 = input()\nsent3 = input()\n\nif (count_syllables(sent1) == 5 and count_syllables(sent2) == 7 and count_syllables(sent3) == 5):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\t\t\t \t\t \t \t \t\t \t \t\t \t \t\t \t \t\t", "def syllables(s):\r\n return s.count(\"a\") + s.count(\"e\") + s.count(\"i\") + s.count(\"o\") + s.count(\"u\")\r\n\r\nphrase1 = input()\r\nphrase2 = input()\r\nphrase3 = input()\r\n\r\nif syllables(phrase1) == 5 and syllables(phrase2) == 7 and syllables(phrase3) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\ns2 = input()\ns3 = input()\nv = [\"a\", \"e\", \"i\", \"o\",\"u\"]\nisValid = True\nv1,v2,v3 = 0,0,0\nfor i in s1:\n if i in v:\n v1+=1\nfor i in s2:\n if i in v:\n v2+=1\nfor i in s3:\n if i in v:\n v3+=1\nif v1 != 5:\n isValid = False\nif v2 != 7:\n isValid = False\nif v3 != 5:\n isValid = False\n\nprint(\"YES\" if isValid else \"NO\")\n", "temp = [\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nl1 = input()\r\nl2 = input()\r\nl3 = input()\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\nfor i in range(len(l1)):\r\n if l1[i] in temp:\r\n c1 = c1+1\r\n \r\nfor j in range(len(l2)):\r\n if l2[j] in temp:\r\n c2= c2+1\r\n\r\nfor k in range(len(l3)):\r\n if l3[k] in temp:\r\n c3 = c3+1\r\n\r\nif (c1==5 and c2==7 and c3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "ans = [False] 3\r\nfor i in range(3):\r\n line = input().lower()\r\n count = 0\r\n for char in line:\r\n if char in [\"a\", \"e\", \"i\", \"o\", \"u\"]:\r\n count += 1\r\n\r\n if (i != 1 and count == 5) or (i == 1 and count == 7):\r\n ans[i] = True\r\n\r\nif all(a for a in ans):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def countVowel(x):\r\n\tcnt = 0\r\n\tfor i in x:\r\n\t\tif i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n\t\t\tcnt+=1\r\n\treturn cnt\r\n\r\na = input()\r\nb = input()\r\nc = input().strip()\r\n\r\nflag = False\r\n\r\nif (countVowel(a)==5 and countVowel(b)==7 and countVowel(c)==5):\r\n\tflag = True\r\nelse:\r\n\tflag = False\r\n\r\nif flag:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "a, a1 = input(), 0\r\nb, b1 = input(), 0\r\nc, c1 = input(), 0\r\nd = ['a', 'e', 'i', 'o', 'u']\r\nfor i in a:\r\n\tif(i in d):\r\n\t\ta1 += 1\r\nfor i in b:\r\n\tif(i in d):\r\n\t\tb1 += 1\r\nfor i in c:\r\n\tif(i in d):\r\n\t\tc1 += 1\r\nif(a1 == 5 and b1 == 7 and c1 == 5):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\r\n", "res1=[5,7,5]\r\n\r\nres2=[]\r\nc=0\r\nfor i in range(3):\r\n \r\n res=list(input().strip().split())\r\n for it in res:\r\n for i in it:\r\n if i =='a' or i=='e' or i=='o' or i=='i' or i=='u':\r\n c=c+1\r\n res2.append(c)\r\n c=0\r\nif(res2==res1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n\r\n\r\n \r\n", "# from collections import defaultdict, deque, Counter\n# from sortedcontainers import SortedDict, SortedList, SortedSet\n# import bisect\n# from heapq import heappop, heappush\n# =======================================\n\nI = lambda : map(int, input().split())\n\n# ========================================\n\n# T = int(input())\n\nD = dict()\nD['purple'] = 'Power'\nD['green'] = 'Time'\nD['blue'] = 'Space'\nD['orange'] = 'Soul'\nD['red'] = 'Reality'\nD['yellow'] = 'Mind'\n\n\nfor _ in range(1):\n F = str(input())\n S = str(input())\n T = str(input())\n \n cf,sf,tf = 0,0,0\n for c in F:\n if c in 'aeiou':\n cf += 1\n for c in S:\n if c in 'aeiou':\n sf += 1\n for c in T:\n if c in 'aeiou':\n tf += 1\n \n if cf == 5 and sf == 7 and tf == 5:\n print('YES')\n else:\n print('NO')\n \n'''\n\n1 2 3 4 5 6\n\n\n'''\n", "def cnt(s):\n return s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')\ns1=input()\ns2=input()\ns3=input()\nprint('YES' if cnt(s1)==5 and cnt(s2)==7 and cnt(s3)==5 else 'NO')", "b=input()\r\nc=input()\r\nd=input()\r\nx1=b.count('a')+b.count('e')+b.count('i')+b.count('o')+b.count('u')\r\nx2=c.count('a')+c.count('e')+c.count('i')+c.count('o')+c.count('u')\r\nx3=d.count('a')+d.count('e')+d.count('i')+d.count('o')+d.count('u')\r\nif x1==5 and x2==7 and x3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "l = []\r\n\r\nfor _ in range(3):\r\n l.append(input())\r\n\r\nfor i in range(3):\r\n c = 0\r\n if i == 1:\r\n for j in l[i]:\r\n if j == 'a' or j == 'e' or j == 'i' or j == 'o' or j == 'u':\r\n c += 1\r\n\r\n if c != 7:\r\n print(\"NO\") \r\n break\r\n\r\n else:\r\n for j in l[i]:\r\n if j == 'a' or j == 'e' or j == 'i' or j == 'o' or j == 'u':\r\n c += 1\r\n\r\n if c != 5:\r\n print(\"NO\") \r\n break\r\nelse:\r\n print(\"YES\") ", "haiku = []\r\ncounter = [0, 0, 0]\r\nvowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\n\r\nfor i in range(3):\r\n\thaiku.append(input().split())\r\n\r\nfor i in range(3):\r\n\tfor j in list(\"\".join(haiku[i])):\r\n\t\tif j in vowels:\r\n\t\t\tcounter[i] += 1\r\n\r\nif counter == [5, 7, 5]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "\n\ndef vowels(pt):\n n = 0\n for symbol in pt.lower():\n if symbol in 'aeiou':\n n += 1\n return n\n\npart1 = input()\npart2 = input()\npart3 = input()\n\nif vowels(part1) == 5 and vowels(part2) == 7 and vowels(part3) == 5:\n print('YES')\nelse:\n print('NO')\n\n", "import re\r\n \r\nprint(['NO', 'YES'][[len(re.findall(r'[aeiou]', item)) for item in [input() for i in range(3)]] == [5, 7, 5]])", "string=str(input())\nstring_1=str(input())\nstring_2=str(input())\na=0;b=0;c=0\nfor i in range(len(string)):\n if(\"a\" in string[i] or \"e\" in string[i] or \"i\" in string[i] or \"o\" in string[i] or \"u\" in string[i]):\n a=a+1\nfor i in range(len(string_1)):\n if(\"a\" in string_1[i] or \"e\" in string_1[i] or \"i\" in string_1[i] or \"o\" in string_1[i] or \"u\" in string_1[i]):\n b=b+1\nfor i in range(len(string_2)):\n if(\"a\" in string_2[i] or \"e\" in string_2[i] or \"i\" in string_2[i] or \"o\" in string_2[i] or \"u\" in string_2[i]):\n c=c+1\nif(a==5 and b==7 and c==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t \t \t \t\t\t \t \t\t \t \t \t", "l1 = input()\r\nl2 = input()\r\nl3 = input()\r\nhaiku = [l1, l2, l3]\r\n# print(haiku)\r\nfor line in haiku:\r\n count = 0\r\n for c in line:\r\n if c=='a' or c=='e' or c=='i' or c=='o' or c=='u':\r\n count+=1\r\n if (line==haiku[0] and count > 5) or (line==haiku[0] and count < 5):\r\n print(\"NO\")\r\n break\r\n elif (line==haiku[1] and count > 7) or (line==haiku[1] and count < 7):\r\n print(\"NO\")\r\n break\r\n elif (line==haiku[2] and count > 5) or (line==haiku[2] and count < 5):\r\n print(\"NO\")\r\n break\r\n\r\nif count == 5:\r\n print(\"YES\")", "vocals = ['a', 'e', 'i', 'o', 'u']\r\n\r\ndef f(x):\r\n s = 0\r\n for i in range(5):\r\n s += x.count(vocals[i])\r\n return s\r\n\r\ndef g(s):\r\n A = []\r\n for i in range(len(s)):\r\n A.append(s[i])\r\n return A\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\na = g(a)\r\nb = g(b)\r\nc = g(c)\r\n\r\nif f(a) == 5 and f(b) == 7 and f(c) == 5:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "l = [ ]\r\nfor i in range(3):\r\n l.append(input())\r\ni = 0\r\nk = 0\r\nh = 0\r\nfor j in range(3):\r\n for i in range(len(l[j])):\r\n if ( l[j][i] == \"a\" ) or ( l[j][i] == \"e\" ) or ( l[j][i] == \"i\" ) or ( l[j][i] == \"o\" ) or ( l[j][i] == \"u\" ) :\r\n k += 1\r\n if ((j == 0)or(j == 2)) and (k == 5) :\r\n h += 1\r\n if j == 1 and k == 7 :\r\n h += 1\r\n k = 0\r\nif h == 3 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\ndef counter(d):\r\n count=0\r\n for i in range(len(d)):\r\n if d[i]=='a' or d[i]=='e' or d[i]=='i' or d[i]=='o' or d[i]=='u':\r\n count+=1\r\n return count\r\nif counter(a)==5 and counter(b)==7 and counter(c)==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "vowels = set('aeiou')\r\ncount = lambda: sum(1 for c in input() if c in vowels)\r\nprint('YES' if count() == 5 and count() == 7 and count() == 5 else 'NO')\r\n", "w = 'aeiou'\r\ns = ''\r\na = []\r\nfor i in range(3):\r\n s = input()\r\n r = 0\r\n for j in w: r += s.count(j)\r\n a += [r]\r\nif a == [5, 7, 5]:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = ''.join(input().split())\r\na = 0\r\nfor i in n:\r\n if i == 'a' or i == 'o' or i == 'u' or i == 'e' or i == 'i':\r\n a += 1\r\nn = ''.join(input().split())\r\nc = 0\r\nfor i in n:\r\n if i == 'a' or i == 'o' or i == 'u' or i == 'e' or i == 'i':\r\n c += 1\r\nn = ''.join(input().split())\r\nb = 0\r\nfor i in n:\r\n if i == 'a' or i == 'o' or i == 'u' or i == 'e' or i == 'i':\r\n b += 1\r\nif a == 5 and c == 7 and b == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "cont=[]\r\nfor i in range(0,3):\r\n a=input()\r\n vo=0\r\n for x in \"aeiou\":\r\n vo=vo+a.count(x)\r\n cont.append(vo)\r\n\r\nif cont == [5,7,5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=list(input())\r\nm=list(input())\r\nn=list(input())\r\nl1=l.count('a')+l.count('e')+l.count('i')+l.count('o')+l.count('u')\r\nl2=m.count('a')+m.count('e')+m.count('i')+m.count('o')+m.count('u')\r\nl3=n.count('a')+n.count('e')+n.count('i')+n.count('o')+n.count('u')\r\nif(l1==5 and l2==7 and l3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l='aeiou'\r\nn=input()\r\nn2=input()\r\nn3=input()\r\nd=' '\r\ne=' '\r\nf=' '\r\nlo=''\r\ndo=[]\r\nfor i in n:\r\n if i in l:\r\n d+=i\r\nfor j in n2:\r\n if j in l:\r\n e+=j\r\nfor m in n3:\r\n if m in l:\r\n f+=m\r\nif len(d)==6 and len(e)==8 and len(f)==6:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "x = 0\r\nl1 = list(input())\r\nif l1.count('a') + l1.count('e') + l1.count('i') + l1.count('o') + l1.count('u') != 5:\r\n x = 1\r\nl2 = list(input())\r\nif l2.count('a') + l2.count('e') + l2.count('i') + l2.count('o') + l2.count('u') != 7:\r\n x = 1\r\nl3 = list(input())\r\nif l3.count('a') + l3.count('e') + l3.count('i') + l3.count('o') + l3.count('u') != 5:\r\n x = 1\r\nif x == 0:\r\n print('YES')\r\nif x == 1:\r\n print('NO')\r\n", "def sum(s):\r\n sum_s1 = 0\r\n L = ['a','e','i','o','u']\r\n for i in s:\r\n if i in L:\r\n sum_s1 += 1\r\n \r\n return sum_s1\r\n\r\n\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\n\r\nsum_s1 = sum(s1)\r\nsum_s2 = sum(s2)\r\nsum_s3 = sum(s3)\r\nif(sum_s1 == 5 and sum_s2 == 7 and sum_s3 == 5):\r\n print('YES')\r\nelse:\r\n print('NO')", "x = list(input())\r\ny = list(input())\r\nz = list(input())\r\n# a e i o u\r\n\r\na1 = x.count('a')\r\na2 = y.count('a')\r\na3 = z.count('a')\r\nb1 = x.count('e')\r\nb2 = y.count('e')\r\nb3 = z.count('e')\r\nc1 = x.count('i')\r\nc2 = y.count('i')\r\nc3 = z.count('i')\r\nd1 = x.count('o')\r\nd2 = y.count('o')\r\nd3 = z.count('o')\r\ne1 = x.count('u')\r\ne2 = y.count('u')\r\ne3 = z.count('u')\r\n\r\na = a1+b1+c1+d1+e1\r\nb = a2+b2+c2+d2+e2\r\nc = a3+b3+c3+d3+e3\r\n\r\nif a == 5 and b == 7 and c == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=str(input())\ns1=str(input())\ns2=str(input())\nsum=0\ncount=0\nf=0\nfor i in range(0,len(s),1):\n if(s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u'):\n count+=1\nfor i in range(0,len(s1),1):\n if(s1[i]=='a' or s1[i]=='e' or s1[i]=='i' or s1[i]=='o' or s1[i]=='u'):\n sum+=1\nfor i in range(0,len(s2),1):\n if(s2[i]=='a' or s2[i]=='e' or s2[i]=='i' or s2[i]=='o' or s2[i]=='u'):\n f+=1\nif(count==5 and sum==7 and f==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t \t\t \t\t\t\t \t \t \t \t\t\t", "\r\nfor i in range(3):\r\n n=input()\r\n n=n.strip()\r\n n=n.split()\r\n count=0\r\n for j in n:\r\n count+=j.count('a')+j.count('e')+j.count('i')+j.count('o')+j.count('u')\r\n \r\n if i%2==0 and count!=5:\r\n print(\"NO\")\r\n break\r\n if i%2!=0 and count!=7:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "a=input().split()\r\nb=input().split()\r\nc=input().split()\r\nt=0\r\nt1=0\r\nt2=0\r\nfor j in a:\r\n for i in j:\r\n #print(i)\r\n if i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n t+=1\r\nfor j in b:\r\n for i in j:\r\n #print(i)\r\n if i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n t1+=1\r\nfor j in c:\r\n for i in j:\r\n #print(i)\r\n if i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n t2+=1\r\n#print(t,t1,t2)\r\nif(t==5 and t1==7 and t2==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def check(g,m):\r\n c=0\r\n for i in g:\r\n if i in ['a','e','i','o','u']:\r\n c+=1\r\n return 1 if c==m else 0\r\ndef main():\r\n mode=\"filee\"\r\n if mode==\"file\":f=open(\"test.txt\",\"r\")\r\n get = lambda :[int(x) for x in (f.readline() if mode==\"file\" else input()).split()]\r\n g=[]\r\n for i in range(3):\r\n g.append(input())\r\n if check(g[0],5) == 1 and check(g[1],7) == 1 and check(g[2],5) == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n if mode==\"file\":f.close()\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n\r\n", "def count(a):\n c=0\n for i in a:\n if i in ('a','e','u','i','o'):c+=1\n return c\n\nprint(\"YES\" if count(input())==5 and count(input())==7 and count(input())==5 else \"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\ncount1=0\r\ncount2=0\r\ncount3=0\r\nfor i in range (len(a)):\r\n if a[i]==\"a\":\r\n count1+=1\r\n if a[i]==\"e\":\r\n count1+=1\r\n if a[i]==\"i\":\r\n count1+=1\r\n if a[i]==\"o\":\r\n count1+=1\r\n if a[i]==\"u\":\r\n count1+=1\r\nfor i in range (len(b)):\r\n if b[i]==\"a\":\r\n count2+=1\r\n if b[i]==\"e\":\r\n count2+=1\r\n if b[i]==\"i\":\r\n count2+=1\r\n if b[i]==\"o\":\r\n count2+=1\r\n if b[i]==\"u\":\r\n count2+=1\r\nfor i in range (len(c)):\r\n if c[i]==\"a\":\r\n count3+=1\r\n if c[i]==\"e\":\r\n count3+=1\r\n if c[i]==\"i\":\r\n count3+=1\r\n if c[i]==\"o\":\r\n count3+=1\r\n if c[i]==\"u\":\r\n count3+=1\r\nif count1==5 and count2==7 and count3==5:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "def is_haiku(a,b,c):\r\n count=0\r\n for i in range(len(a)):\r\n if a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u':\r\n count=count+1\r\n if count>5:\r\n print(\"NO\")\r\n return \r\n\r\n if count!=5:\r\n print(\"NO\")\r\n return\r\n\r\n count=0\r\n for i in range(len(b)):\r\n if b[i]=='a' or b[i]=='e' or b[i]=='i' or b[i]=='o' or b[i]=='u':\r\n count=count+1\r\n if count>7:\r\n print(\"NO\")\r\n return \r\n\r\n if count!=7:\r\n print(\"NO\")\r\n return\r\n \r\n count=0\r\n for i in range(len(c)):\r\n if c[i]=='a' or c[i]=='e' or c[i]=='i' or c[i]=='o' or c[i]=='u':\r\n count=count+1\r\n if count>5:\r\n print(\"NO\")\r\n return \r\n\r\n if count!=5:\r\n print(\"NO\")\r\n return\r\n\r\n print(\"YES\")\r\n\r\na=input('')\r\nb=input('')\r\nc=input('')\r\nis_haiku(list(a),list(b),list(c))", "s1 = ''.join(filter(lambda x: x.lower() in 'aiueo', input()))\r\ns2 = ''.join(filter(lambda x: x.lower() in 'aiueo', input()))\r\ns3 = ''.join(filter(lambda x: x.lower() in 'aiueo', input()))\r\n\r\nif len(s1) == 5 and len(s2) == 7 and len(s3) == 5 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def cnt(s):\r\n return s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')\r\nst1=input()\r\nst2=input()\r\nst3=input()\r\nif cnt(st1)==5 and cnt(st2)==7 and cnt(st3)==5:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "print('YES' if len([i for i in input() if i in 'aeiou']) == 5 and len([i for i in input() if i in 'aeiou']) == 7 and len([i for i in input() if i in 'aeiou']) == 5 else 'NO')", "a=input();b=input();c=input();c1,c2,c3=0,0,0;d={'a':0,'e':0,'i':0,'o':0,'u':0}\r\nfor i in a:\r\n\tif i in d:c1+=1\r\nfor i in b:\r\n\tif i in d:c2+=1\r\nfor i in c:\r\n\tif i in d:c3+=1\r\nif c1==c3==5 and c2==7:print('YES')\r\nelse:print('NO')", "a,b,c=input(),input(),input()\r\nv=['a','e','i','o','u']\r\np1,p2,p3=0,0,0\r\nfor i in a:\r\n if i in v:\r\n p1+=1\r\nfor i in b:\r\n if i in v:\r\n p2+=1\r\nfor i in c:\r\n if i in v:\r\n p3+=1\r\nif p1==5 and p2==7 and p3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l = 'aeiou'\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\nca, cb, cc = 0, 0, 0\r\nfor i in a:\r\n if i in l:\r\n ca += 1\r\nfor i in b:\r\n if i in l:\r\n cb += 1\r\nfor i in c:\r\n if i in l:\r\n cc += 1\r\nif ca != 5 or cb != 7 or cc != 5:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "for i in range(0, 3):\n s = input()\n count = 0\n for j in range(0, len(s)):\n if s[j] == \"a\" or s[j] == \"e\" or s[j] == \"i\" or s[j] == \"o\" or s[j] == \"u\":\n count += 1\n if (i == 1 and count != 7) or (i != 1 and count != 5):\n print(\"NO\")\n exit()\n\nprint(\"YES\")", "\r\nline1 = input()\r\nline2 = input()\r\nline3 = input()\r\nena = (line1.count('a') + line1.count('e') + line1.count('i') + line1.count('o') + line1.count('u')) == 5\r\nduo = (line2.count('a') + line2.count('e') + line2.count('i') + line2.count('o') + line2.count('u')) == 7\r\ntria = (line3.count('a') + line3.count('e') + line3.count('i') + line3.count('o') + line3.count('u')) == 5\r\n\r\nif (ena and duo and tria):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nk = [\"a\", \"e\", \"i\", \"o\",\"u\"]\r\nl=0\r\nfor i in a:\r\n for j in k:\r\n if i==j:\r\n l+=1\r\nm=0\r\nfor i in b:\r\n for j in k:\r\n if i==j:\r\n m+=1\r\nq=0\r\nfor i in c:\r\n for j in k:\r\n if i==j:\r\n q+=1\r\nif (l==5 and m==7 and q==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from re import sub\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\n\r\na = sub(r'[aeiou]', '-', a)\r\nb = sub(r'[aeiou]', '-', b)\r\nc = sub(r'[aeiou]', '-', c)\r\n\r\nx = a.count('-') == 5 and b.count('-') == 7 and c.count('-') == 5\r\nprint('YES' if x else 'NO')\r\n", "x = str(input())\r\ny = str(input())\r\nz = str(input())\r\n\r\nv = [ \"a\", \"e\", \"i\", \"o\",\"u\"]\r\ncount_x = 0\r\ncount_y = 0\r\ncount_z = 0\r\nfor i in v:\r\n for j in x:\r\n if i == j :\r\n count_x += 1\r\n\r\n for j in y:\r\n if i == j :\r\n count_y += 1\r\n\r\n for j in z:\r\n if i == j :\r\n count_z += 1\r\n\r\nif count_x == 5 and count_y == 7 and count_z ==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "gl=\"aeiou\"\r\na=list(map(str,input().split()))\r\nb=list(map(str,input().split()))\r\nc=list(map(str,input().split()))\r\nt=[]\r\ns=0\r\nfor i in a:\r\n for j in i:\r\n if j in gl:\r\n s+=1\r\nt+=[s]\r\ns=0\r\nfor k in b:\r\n for l in k:\r\n if l in gl:\r\n s+=1\r\nt+=[s]\r\ns=0\r\nfor m in c:\r\n for n in m:\r\n if n in gl:\r\n s+=1\r\nt+=[s]\r\ns=0\r\nif t[0]==5 and t[1]==7 and t[2]==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nc0 = 0\r\nc1 = 0\r\nc2 = 0\r\n\r\n\r\nl = ['a', 'i', 'o', 'u', 'e']\r\nfor i in l:\r\n for j in s1:\r\n if i == j:\r\n c0 += 1\r\nif c0 != 5:\r\n print('NO')\r\n exit()\r\n \r\nfor i in l:\r\n for j in s2:\r\n if i == j:\r\n c1 += 1\r\nif c1 != 7:\r\n print('NO')\r\n exit()\r\n \r\nfor i in l:\r\n for j in s3:\r\n if i == j:\r\n c2 += 1\r\nif c2 != 5:\r\n print('NO')\r\n exit()\r\n \r\nelse:\r\n print('YES')\r\n \r\n\r\n ", "def count_vowels(s):\r\n return sum(1 for c in s if c in 'aeiou')\r\n\r\ns1 = input().strip()\r\ns2 = input().strip()\r\ns3 = input().strip()\r\n\r\nif count_vowels(s1) == 5 and count_vowels(s2) == 7 and count_vowels(s3) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\ncnt=0\r\ncnd=0\r\ncnu=0\r\nd=['a', 'e', 'i', 'o', 'u']\r\n\r\nfor i in a:\r\n if i in d:\r\n cnt+=1\r\nfor j in b:\r\n if j in d:\r\n cnd+=1\r\nfor k in c:\r\n if k in d:\r\n cnu+=1\r\nif cnt==5 and cnd==7 and cnu==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = str(input())\nb = str(input())\nc = str(input())\n\ndef isVowel(ch):\n return ch.lower() in ['a','e','i','o','u']\n\ndef countVowels(string):\n count = 0\n for i in range(len(string)):\n if isVowel(string[i]):\n count+=1\n return count\n\nif (countVowels(a)==5 and countVowels(b)==7 and countVowels(c)==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "#!/usr/bin/env/python\r\n# -- coding: utf-8 --\r\nnum = [5, 7, 5]\r\nres = True\r\nfor i in range(3):\r\n s = input()\r\n cnt = 0\r\n for c in s:\r\n cnt += c in 'aeiou'\r\n if cnt != num[i]:\r\n res = False\r\nprint('YES' if res else 'NO')", "s1=input()\r\ns2=input()\r\ns3=input()\r\ncount1=s1.count('a')+s1.count('e')+s1.count('i')+s1.count('o')+s1.count('u')\r\ncount2=s2.count('a')+s2.count('e')+s2.count('i')+s2.count('o')+s2.count('u')\r\ncount3=s3.count('a')+s3.count('e')+s3.count('i')+s3.count('o')+s3.count('u')\r\nif count1==5 and count2==7 and count3==5: \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "vowels = {\"a\", \"e\", \"i\", \"o\",\"u\"}\r\ndef count(s):\r\n c = 0\r\n for i in s:\r\n if(i in vowels):\r\n c += 1\r\n return c\r\nl1 = count(input())\r\nl2 = count(input())\r\nl3 = count(input())\r\n\r\nif(l1 == 5 and l3 == 5 and l2 == 7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nw = set(list(\"aeiou\"))\r\nx = [5, 7, 5]\r\nans = \"YES\"\r\nfor i in range(3):\r\n s = list(input().rstrip())\r\n c = 0\r\n for j in s:\r\n if j in w:\r\n c += 1\r\n if c ^ x[i]:\r\n ans = \"NO\"\r\nprint(ans)", "l = [\"a\", \"e\", \"u\", \"o\", \"i\"]\r\nfor i in range(3):\r\n s = input()\r\n if i == 1:\r\n if s.count(l[0]) + s.count(l[1]) + s.count(l[2]) + s.count(l[3]) + s.count(l[4]) != 7:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n if s.count(l[0]) + s.count(l[1]) + s.count(l[2]) + s.count(l[3]) + s.count(l[4]) != 5:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "# ===============================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===============================\r\nimport math, fractions\r\n# ===============================\r\ns = \"\"\r\nfor _ in range(3):\r\n\tx = str(input())\r\n\ts += str(sum([1 for vowel in x if vowel in \"aiueo\"]))\r\nprint(\"YES\" if s == \"575\" else \"NO\")", "import sys, math\r\n\r\ninput=sys.stdin.readline\r\n\r\np = []\r\nfor i in range(3):\r\n l = input().rstrip(\"\\n\")\r\n k = 0\r\n for i in l:\r\n if i in \"aeiou\":\r\n k += 1\r\n p.append(k)\r\nprint(\"YES\" if p == [5, 7, 5] else \"NO\")", "a,b,c=[input(),input(),input()]\r\np={'a','e','i','o','u'}\r\nans=0\r\nfor i in a:\r\n if i in p:\r\n ans+=1\r\nif ans!=5:\r\n print('NO')\r\n exit()\r\nans=0\r\nfor i in b:\r\n if i in p:\r\n ans+=1\r\nif ans!=7:\r\n print('NO')\r\n exit()\r\nans=0\r\nfor i in c:\r\n if i in p:\r\n ans+=1\r\nif ans!=5:\r\n print('NO')\r\n exit()\r\nprint('YES')", "import sys\r\ndata = sys.stdin.readlines()\r\np1 = data[0].strip()\r\np2 = data[1].strip()\r\np3 = data[2].strip()\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\ncheck = False\r\nfor ch in p1:\r\n if ch in 'aeiou':\r\n c1 += 1\r\nif c1 == 5:\r\n for ch in p2:\r\n if ch in 'aeiou':\r\n c2 += 1\r\nif c2 == 7:\r\n for ch in p3:\r\n if ch in 'aeiou':\r\n c3 += 1\r\nif c3 == 5:\r\n check = True\r\nif check == True:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "vowels = set(['a', 'e', 'i', 'o', 'u'])\r\n\r\n\r\ndef occ(string, chars):\r\n cnt = 0\r\n for char in string:\r\n if char in chars:\r\n cnt += 1\r\n return cnt\r\n\r\n\r\ns = [input() for i in range(3)]\r\n\r\nif [occ(s[i], vowels) for i in range(3)] == [5, 7, 5]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "d = input()\r\nb = input()\r\nc = input()\r\n\r\nif d.count('a') + d.count('e') + d.count('i') + d.count('u') + d.count('o') == 5 and b.count('a') + b.count('e') + b.count('i') + b.count('u') + b.count('o') == 7 and c.count('a') + c.count('e') + c.count('i') + c.count('u') + c.count('o') == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "lst=['a','e','i','o','u']\r\na=0\r\ns=0\r\nfor i in range(3):\r\n x=input()\r\n for j in range(5):\r\n a+=x.count(lst[j]) \r\n if i==0 or i==2:\r\n if a!=5:\r\n s+=1\r\n else:\r\n if a!=7:\r\n s+=1\r\n a=0 \r\nprint(['NO','YES'][s==0])\r\n", "print('NYOE S'[[sum(i in'aeiou'for i in input())for f in\"012\"]==[5,7,5]::2])", "s1=input()\r\ns2=input()\r\ns3=input()\r\nno_s1=0\r\nno_s2=0\r\nno_s3=0\r\nfor i in range(len(s1)):\r\n if(s1[i]==\"a\" or s1[i]==\"e\" or s1[i]==\"i\" or s1[i]==\"o\" or s1[i]==\"u\"):\r\n no_s1=no_s1+1 \r\nfor i in range(len(s2)):\r\n if(s2[i]==\"a\" or s2[i]==\"e\" or s2[i]==\"i\" or s2[i]==\"o\" or s2[i]==\"u\"):\r\n no_s2=no_s2+1 \r\nfor i in range(len(s3)):\r\n if(s3[i]==\"a\" or s3[i]==\"e\" or s3[i]==\"i\" or s3[i]==\"o\" or s3[i]==\"u\"):\r\n no_s3=no_s3+1 \r\nif(no_s3==5 and no_s2==7 and no_s1==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str1 = input()\r\nstr2 = input()\r\nstr3 = input()\r\n\r\ncnt1 = 0\r\ncnt2 = 0\r\ncnt3 = 0\r\n\r\nfor i in str1:\r\n if i in ['a', 'e', 'i', 'o', 'u' ]:\r\n cnt1 += 1\r\nfor i in str2:\r\n if i in ['a', 'e', 'i', 'o', 'u' ]:\r\n cnt2 += 1\r\nfor i in str3:\r\n if i in ['a', 'e', 'i', 'o', 'u' ]:\r\n cnt3 += 1\r\nif (cnt1 == 5 and cnt2 == 7 and cnt3 == 5):\r\n print('YES')\r\nelse:\r\n print('NO')", "from sys import stdin, stdout\r\n\r\n\r\ndef count(s):\r\n return s.count('i') + s.count('e') + s.count('u') + s.count('a') + s.count('o')\r\n\r\n\r\nfirst, second, third = stdin.readline().strip(), stdin.readline().strip(), stdin.readline().strip()\r\n\r\nif count(first) == 5 and count(second) == 7 and count(third) == 5:\r\n stdout.write('YES')\r\nelse:\r\n stdout.write('NO')", "a = input()\r\nb = input()\r\nc = input()\r\n\r\nis_haiku = True\r\ncount = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i] in {'a', 'e', 'i', 'o', 'u'}:\r\n count += 1\r\nif count != 5:\r\n is_haiku = False\r\n\r\ncount = 0\r\n\r\nfor i in range(len(b)):\r\n if b[i] in {'a', 'e', 'i', 'o', 'u'}:\r\n count += 1\r\nif count != 7:\r\n is_haiku = False\r\n\r\ncount = 0 \r\n\r\nfor i in range(len(c)):\r\n if c[i] in {'a', 'e', 'i', 'o', 'u'}:\r\n count += 1\r\nif count != 5:\r\n is_haiku = False\r\n\r\nif is_haiku:\r\n print(\"YES\")\r\nif not is_haiku:\r\n print(\"NO\")", "def nihar(s):\r\n c=0\r\n c=c+s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')\r\n return c\r\ns1=input()\r\ns2=input()\r\ns3=input()\r\nk1=nihar(s1)\r\nk2=nihar(s2)\r\nk3=nihar(s3)\r\nif k1==5 and k2==7 and k3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "'''\nhttps://codeforces.com/problemset/problem/78/A\n'''\n\nrules = [5, 7, 5]\nsyllabes_num = []\n\nfor _ in range(3):\n phrase = input()\n syllabes_num.append(sum([map(phrase.lower().count, \"aeiou\")]))\n\nif rules == syllabes_num:\n print('YES')\nelse:\n print('NO')\n\n\n\n\n\n", "d = {0:5, 1:7, 2:5}\r\nres= \"YES\"\r\nfor i in range(3):\r\n ans = 0\r\n s = input()\r\n for k in s:\r\n if k in \"aeiou\":\r\n ans+=1\r\n if ans != d[i]:\r\n res = \"NO\"\r\nprint(res)", "from sys import stdin\r\n\r\nvowels = 'aeiou'\r\n\r\nfor i in range(3):\r\n line = stdin.readline()\r\n count = 0\r\n for char in line:\r\n if char in vowels:\r\n count +=1\r\n if(i==0 or i==2):\r\n if(count!=5):\r\n print(\"NO\")\r\n exit()\r\n if(i==1):\r\n if(count != 7):\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\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 ###############################\na = input()\nb = input()\nc = input()\nv = ['a', 'i', 'e', 'o', 'u']\ncnt = [5, 7, 5]\nprint(\"YES\" if [sum(a.count(x) for x in v),\n sum(b.count(x) for x in v),\n sum(c.count(x) for x in v)] == cnt\n else \"NO\"\n )\n", "a = [\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nq =\"\"\r\nfor i in range(3):\r\n\ts =0\r\n\tz = input()\r\n\tfor i in z:\r\n\t\tif i.isalpha():\r\n\t\t\tif i in a:s+=1\r\n\tq+=str(s)\r\n\r\nif q ==\"575\":print(\"YES\")\r\nelse:print(\"NO\")", "line1 = input()\r\nline2 = input()\r\nline3 = input()\r\ncount1 = 0\r\ncount2 = 0\r\ncount3 = 0\r\nfor i in line1:\r\n if i==\"a\" or i=='e' or i=='i' or i=='o' or i=='u':\r\n count1+=1\r\nfor i in line2:\r\n if i==\"a\" or i=='e' or i=='i' or i=='o' or i=='u':\r\n count2+=1\r\nfor i in line3:\r\n if i==\"a\" or i=='e' or i=='i' or i=='o' or i=='u':\r\n count3+=1\r\nif count1==5 and count2==7 and count3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def isvowel(x):\r\n ans = False\r\n if x == 'a' or x == 'e' or x == 'i' or x == 'o' or x == 'u':\r\n ans = True\r\n return ans \r\na = input()\r\nb = input()\r\nc = input()\r\nA = []\r\nB = []\r\nC = []\r\nans = 'NO'\r\nfor t in a:\r\n if isvowel(t):\r\n A.append(t)\r\nfor t in b:\r\n if isvowel(t):\r\n B.append(t)\r\nfor t in c:\r\n if isvowel(t):\r\n C.append(t)\r\nif len(A) == 5 and len(B) == 7 and len(C) == 5:\r\n ans = 'YES'\r\nprint(ans) \r\n ", "\r\ndef solve():\r\n a = [input().split() for _ in range(3)]\r\n v = 'aeiou'\r\n ans = []\r\n for s in a:\r\n cnt = 0\r\n for w in s:\r\n for c in w:\r\n if c in v:\r\n cnt += 1\r\n ans.append(cnt)\r\n if ans[0] == 5 and ans[1] == 7 and ans[2] == 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nfor _ in range(1):\r\n solve()", "pha_1=input().strip()\r\npha_2=input().strip()\r\npha_3=input().strip()\r\ndef count_vowels(word):\r\n vowel_letter=\"aeiou\"\r\n return sum(1 for letter in word if letter in vowel_letter)\r\ndef is_haiku_phrase(phrase,exp_syll):\r\n syllables = count_vowels(phrase)\r\n return syllables == exp_syll\r\nif is_haiku_phrase(pha_1,5) and is_haiku_phrase(pha_2,7) and is_haiku_phrase(pha_3,5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = []\r\nvowels = ['a', 'e', 'i', 'o', 'u']\r\nfor i in range(3):\r\n n = input()\r\n if i == 0 or i == 2:\r\n count = 0\r\n for j in n:\r\n if j in vowels:\r\n count += 1\r\n a.append(count)\r\n if i == 1:\r\n count = 0\r\n for j in n:\r\n if j in vowels:\r\n count += 1\r\n a.append(count)\r\nif a == [5, 7, 5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "x = (input())\r\ny = (input())\r\nz = (input())\r\n\r\nk = 0\r\n\r\na = 0\r\ne = 0\r\ni = 0\r\no = 0\r\nu = 0\r\n\r\na+=x.count('a')\r\ne+=x.count('e')\r\ni+=x.count('i')\r\no+=x.count('o')\r\nu+=x.count('u')\r\n\r\nc = a+e+i+o+u\r\n\r\nif c == 5:\r\n k+=1\r\n \r\nc = 0\r\n\r\na = 0\r\ne = 0\r\ni = 0\r\no = 0\r\nu = 0\r\n\r\na+=y.count('a')\r\ne+=y.count('e')\r\ni+=y.count('i')\r\no+=y.count('o')\r\nu+=y.count('u')\r\n\r\nc = a+e+i+o+u\r\n\r\nif c == 7:\r\n k+=1\r\n\r\nc = 0\r\n\r\na = 0\r\ne = 0\r\ni = 0\r\no = 0\r\nu = 0\r\n\r\na+=z.count('a')\r\ne+=z.count('e')\r\ni+=z.count('i')\r\no+=z.count('o')\r\nu+=z.count('u')\r\n\r\nc = a+e+i+o+u\r\n\r\nif c == 5:\r\n k+=1\r\n\r\nprint('YES' if k==3 else 'NO')\r\n\r\n", "def countVowels(s):\r\n\tcnt = 0\r\n\tfor i in s:\r\n\t\tif i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n\t\t\tcnt += 1\r\n\treturn cnt\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\nif countVowels(s1) == 5 and countVowels(s2) == 7 and countVowels(s3) == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "c1 = 0\r\nc2 = 0\r\nc3 = 0\r\n\r\ns1 = input().lower()\r\ns2 = input().lower()\r\ns3 = input().lower()\r\n\r\nfor i in s1 :\r\n if i == 'a' or i == 'e' or i == 'o'or i == 'i' or i == 'u':\r\n c1 +=1\r\n\r\nfor i in s2:\r\n if i == 'a' or i == 'e' or i == 'o' or i == 'i' or i == 'u':\r\n c2 += 1\r\n\r\nfor i in s3:\r\n if i == 'a' or i == 'e' or i == 'o' or i == 'i' or i == 'u':\r\n c3 += 1\r\n\r\n\r\nif c1 == 5 and c2 == 7 and c3 == 5 :\r\n print('YES')\r\n exit(0)\r\nelse:\r\n print('NO')\r\n exit(0)\r\n\r\n", "word = []\r\nfor i in range(3):\r\n word.append(input())\r\n \r\nvowels = ['a','e','i','o','u']\r\nsyllables=[5,7,5]\r\n\r\nflag=0\r\n\r\nfor i in range(len(word)):\r\n count=0\r\n for j in (word[i]):\r\n if j in vowels:\r\n count+=1\r\n if count !=syllables[i]:\r\n flag=1\r\n break\r\n \r\nif flag==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nx=0\r\ny=0\r\nz=0\r\nfor i in a:\r\n if(i in 'aeiou'):\r\n z+=1\r\nfor j in b:\r\n if(j in 'aeiou'):\r\n y+=1\r\nfor k in c:\r\n if(k in 'aeiou'):\r\n x+=1\r\nif(x==5 and y==7 and z==5):\r\n print('YES')\r\nelse:\r\n print('NO')", "p1=input()\r\np2=input()\r\np3=input()\r\nc1=c2=c3=0\r\nfor i in p1.strip():\r\n if i in ['a','e','i','o','u']:\r\n c1+=1\r\nfor i in p2.strip():\r\n if i in ['a','e','i','o','u']:\r\n c2+=1\r\nfor i in p3.strip():\r\n if i in ['a','e','i','o','u']:\r\n c3+=1\r\nif c1==5 and c2==7 and c3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "f = input().strip().split()\r\ns = input().strip().split()\r\nt = input().strip().split()\r\n\r\nv = ['a','e','i','o','u']\r\n\r\nfc = 0\r\nfor i in f:\r\n\tfor j in i:\r\n\t\tif j in v:\r\n\t\t\tfc += 1\r\nsc = 0\r\nfor i in s:\r\n\tfor j in i:\r\n\t\tif j in v:\r\n\t\t\tsc += 1\r\n\r\ntc = 0\r\nfor i in t:\r\n\tfor j in i:\r\n\t\tif j in v:\r\n\t\t\ttc += 1\r\n\r\nif fc == 5 and sc == 7 and tc == 5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "def count_vowels(phrase):\r\n vowels = \"aeiou\"\r\n return sum(1 for char in phrase if char in vowels)\r\n\r\ndef is_haiku(phrase1, phrase2, phrase3):\r\n syllable_counts = [count_vowels(phrase1), count_vowels(phrase2), count_vowels(phrase3)]\r\n\r\n if syllable_counts == [5, 7, 5]:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Read input\r\nphrase1 = input().strip()\r\nphrase2 = input().strip()\r\nphrase3 = input().strip()\r\n\r\nresult = is_haiku(phrase1, phrase2, phrase3)\r\nprint(result)\r\n", "def main():\r\n v = set(['a', 'e', 'i', 'o', 'u'])\r\n\r\n ss = []\r\n for _ in range(3):\r\n ss.append(input().strip())\r\n\r\n cs = [0 for _ in range(3)]\r\n\r\n for i in range(3):\r\n c = 0\r\n for e in ss[i]:\r\n if e in v:\r\n c += 1\r\n cs[i] = c\r\n\r\n if cs[0] == 5 and cs[1] == 7 and cs[2] == 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n", "a = input()\r\nb = input()\r\nc = input()\r\nl=[i for i in a]\r\nm=[i for i in b]\r\nn=[i for i in c]\r\ne = ['a','e','i','o','u']\r\nA = 0\r\nB = 0\r\nC = 0\r\nfor i in l:\r\n if i in e:\r\n A+=1\r\nfor i in m:\r\n if i in e:\r\n B+=1\r\nfor i in n:\r\n if i in e:\r\n C+=1\r\nif A == 5 and B == 7 and C == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "import sys\nimport math\ninput = sys.stdin.readline\ndef f(s):\n\tc=0\n\tfor x in s:\n\t\tif x in \"aeiou\":\n\t\t\tc+=1\n\treturn c\na=input()\nb=input()\nc=input()\nprint((\"NO\",\"YES\")[f(a)==5 and f(b)==7 and f(c)==5])\n\t\t\t\t\t\t\t\t\t \t\t\t\t\t \t\t\t \t \t\t \t", "q='aeiou'\r\na=list(input())\r\nb=list(input())\r\nc=list(input())\r\ns=0\r\ns1=0\r\ns2=0\r\nfor i in a:\r\n if i in q:\r\n s+=1\r\nfor j in b:\r\n if j in q:\r\n s1+=1\r\nfor k in c:\r\n if k in q:\r\n s2+=1\r\nif s==5 and s1==7 and s2==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "for j in range(3):\n n = 0\n a = input()\n for i in a :\n if i == 'a' or i =='e' or i == 'i' or i == 'o' or i == 'u' :\n n += 1\n if j == 1 :\n if n == 7 :\n b = True\n else :\n b = False\n break\n else :\n if n == 5 :\n b = True\n else :\n b = False\n break\nif b == True :\n print('YES')\nelse :\n print('NO')", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nq = 0\r\nq1 = 0\r\nq2 = 0\r\nar, = 'aeuio'\r\nfor i in s1:\r\n if i in ar:\r\n q += 1\r\nfor i in s2:\r\n if i in ar:\r\n q1 += 1\r\nfor i in s3:\r\n if i in ar:\r\n q2 += 1\r\nif q==q2== 5 and q1== 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l=[5,7,5]\r\nt=0\r\nfor num in range(len(l)):\r\n line=input()\r\n c=0\r\n for char in line:\r\n if char in 'aeiou':\r\n c+=1\r\n \r\n if c == l[num]:\r\n t+=1\r\n\r\nif t == 3:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "\r\ndef f(x):\r\n if x=='a' or x=='e' or x=='i' or x=='o' or x=='u':\r\n return 1\r\n else:\r\n return 0\r\ns1=[f(n) for n in input()]\r\ns2=[f(n) for n in input()]\r\ns3=[f(n) for n in input()]\r\n\r\nif sum(s1)==5 and sum(s2)==7 and sum(s3)==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "def countVowel(para):\r\n vowel=['a','e','i','o','u']\r\n count=0\r\n for letter in para:\r\n if letter in vowel:\r\n count+=1\r\n return count\r\n\r\nhaiku=[]\r\nfor i in range(3):\r\n line=input().lower()\r\n haiku.append(line)\r\nsyllable=[]\r\nfor i in haiku:\r\n syllable.append(countVowel(i))\r\nif syllable==[5,7,5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "N = 3\r\ni = 0\r\nvowels = 'aeiou'\r\nex = [5, 7, 5]\r\nop = []\r\n\r\nwhile i < N:\r\n line = input()\r\n cnt = len([c for c in line if c in vowels])\r\n op.append(cnt)\r\n i += 1\r\nif op != ex:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import re\n\ndef check(s):\n return len(re.findall('(a\|e\|i\|o\|u)', s))\n\nif [5,7,5] == [check(input()), check(input()), check(input())]:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\nl1=len(s1)\r\nl2=len(s2)\r\nl3=len(s3)\r\nc1,c2,c3=0,0,0\r\nfor i in range(0,l1):\r\n if s1[i]=='a' or s1[i]=='e' or s1[i]=='i' or s1[i]=='o' or s1[i]=='u':\r\n c1=c1+1\r\nif c1!=5:\r\n print('NO')\r\nelse:\r\n for i in range(0,l2):\r\n if s2[i]=='a' or s2[i]=='e' or s2[i]=='i' or s2[i]=='o' or s2[i]=='u':\r\n c2=c2+1\r\n if c2!=7:\r\n print('NO')\r\n else:\r\n for i in range(0,l3):\r\n if s3[i]=='a' or s3[i]=='e' or s3[i]=='i' or s3[i]=='o' or s3[i]=='u':\r\n c3=c3+1\r\n if c3!=5:\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "v=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\ns1=input().strip()\r\ns2=input().strip()\r\ns3=input().strip()\r\nc1=c2=c3=0\r\nfor i in s1:\r\n if i in v:\r\n c1=c1+1\r\nfor i in s2:\r\n if i in v:\r\n c2=c2+1\r\nfor i in s3:\r\n if i in v:\r\n c3=c3+1\r\nif c1==5 and c2==7 and c3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "L1 = str(input())\nL2 = str(input()) \nL3 = str(input())\nL1 = list(L1)\nL2 = list(L2)\nL3 = list(L3)\nsu1 = 0\nsu2 = 0\nsu3 = 0\na = b = c = False\nfor i in range(len(L1)):\n if L1[i] == \"a\" or L1[i] == \"e\" or L1[i] == \"i\" or L1[i] == \"o\" or L1[i] == \"u\":\n su1 += 1\n else:\n continue\ni = 0\nif su1 ==5:\n a = True\nfor i in range(len(L2)):\n if L2[i] == \"a\" or L2[i] == \"e\" or L2[i] == \"i\" or L2[i] == \"o\" or L2[i] == \"u\":\n su2 += 1\n else:\n continue\ni = 0\nif su2 == 7:\n b = True\nfor i in range(len(L3)):\n if L3[i] == \"a\" or L3[i] == \"e\" or L3[i] == \"i\" or L3[i] == \"o\" or L3[i] == \"u\":\n su3 += 1\n else:\n continue\nif su3 ==5:\n c = True\nif a == True and b ==True and c ==True:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t\t \t \t \t\t\t \t \t\t \t", "import sys\r\nimport re\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef inlt():\r\n return list(map(str, input().split()))\r\n\r\n\r\ndef count(s):\r\n i = 0\r\n a = len(s)\r\n b = re.sub(r\"(a+)\|(e+)\|(i+)\|(o+)\|(u+)\", \"\", s)\r\n return a-len(b)\r\n\r\n\r\ns = [\r\n re.sub(r\"\\s+\", \"\", input()),\r\n re.sub(r\"\\s+\", \"\", input()),\r\n re.sub(r\"\\s+\", \"\", input())\r\n]\r\nc = [count(x) for x in s]\r\nprint(\"YES\" if c == [5, 7, 5] else \"NO\")\r\n", "# Haiku\r\np1 = input()\r\np2 = input()\r\np3 = input()\r\nsyllaList = ['a', 'e', 'i', 'o', 'u']\r\nc1 = c2 = c3 = 0\r\nfor i in p1:\r\n if i in syllaList:\r\n c1 += 1\r\nfor i in p2:\r\n if i in syllaList:\r\n c2 += 1\r\nfor i in p3:\r\n if i in syllaList:\r\n c3 += 1\r\nif c1 == c3 == 5 and c2 == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = input()\r\nc = input()\r\n\r\ndef isVowel(c):\r\n\treturn c == 'a' or c == 'e' or c == 'i' or c == 'o' or c == 'u'\r\n\r\ndef vowelNo(s):\r\n\tc = 0\r\n\tfor i in s:\r\n\t\tif isVowel(i):\r\n\t\t\tc += 1\r\n\treturn c\r\n\r\nif vowelNo(a) == 5 and vowelNo(b) == 7 and vowelNo(c) == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "l1 = input()\r\nl2 = input()\r\nl3 = input()\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\nfor i in l1:\r\n if i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n c1 = c1 +1\r\nfor i in l2:\r\n if i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n c2 = c2 +1\r\nfor i in l3:\r\n if i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n c3 = c3 +1\r\nif c1 == 5 and c2 == 7 and c3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-02 23:33:05\nLastEditTime: 2021-11-02 23:41:59\nDescription: Haiku\nFilePath: CF78A.py\n'''\n\n\ndef func():\n haiku = []\n for _ in range(3):\n haiku.append(input().strip())\n\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\n lst = []\n for item in haiku:\n count = 0\n for vowel in vowels:\n count += item.count(vowel)\n lst.append(count)\n \n return \"YES\" if lst == [5, 7, 5] else \"NO\"\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "h1=input()\r\nh2=input()\r\nh3=input()\r\ndef count(string):\r\n\tglobal ans\r\n\tans=0\r\n\tfor i in string:\r\n\t\tif i ==\"a\":\r\n\t\t\tans+=1\r\n\tfor i in string:\r\n\t\tif i ==\"e\":\r\n\t\t\tans+=1\r\n\tfor i in string:\r\n\t\tif i ==\"i\":\r\n\t\t\tans+=1\r\n\tfor i in string:\r\n\t\tif i ==\"o\":\r\n\t\t\tans+=1\r\n\tfor i in string:\r\n\t\tif i ==\"u\":\r\n\t\t\tans+=1\r\n\treturn ans\r\nif(count(h1)==5 and count(h2)==7 and count(h3)==5):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "mas = [5,7,5]\r\ng = ['a', 'e', 'i', 'o','u']\r\nfor x in range(3):\r\n a = input().split()\r\n k = 0\r\n for i in a:\r\n for j in i:\r\n if j in g:\r\n k += 1\r\n if k != mas[x]:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "x,y,z = input(),input(),input()\r\nif sum([x.count(i) for i in \"aeiou\"]) == 5 and sum([y.count(i) for i in \"aeiou\"]) == 7 and sum([z.count(i) for i in \"aeiou\"]) == 5:\r\n\tprint('YES')\r\nelse:\r\n\tprint(\"NO\")", "o=input().replace(\" \",\"\")\r\nt=input().replace(\" \",\"\")\r\ne=input().replace(\" \",\"\")\r\ndef vo(n):\r\n k=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\n v=0\r\n for i in n:\r\n if i in k:\r\n v+=1\r\n return v\r\nif vo(o)==5 and vo(t)==7 and vo(e)==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "def myCount (s, g):\n c = 0\n for i in g:\n c += s.count (i)\n return c\n\na, b, c = input(), input(), input()\ng = ['a','e','i','o','u']\nn = myCount (a, g)\nm = myCount (b, g)\nk = myCount (c, g)\nif n == 5 and m == 7 and k == 5:\n print ('YES')\nelse:\n print ('NO')\n", "a = str(input())\r\nb = str(input())\r\nc = str(input())\r\nvowelsA = a.count(\"o\")+a.count(\"i\")+a.count(\"e\")+a.count(\"u\")+a.count(\"a\")\r\nvowelsB = b.count(\"o\")+b.count(\"i\")+b.count(\"e\")+b.count(\"u\")+b.count(\"a\")\r\nvowelsC = c.count(\"o\")+c.count(\"i\")+c.count(\"e\")+c.count(\"u\")+c.count(\"a\")\r\nif vowelsA == 5 and vowelsB == 7 and vowelsC == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "if [sum(1 for ch in input() if ch in ['a', 'e', 'i', 'o', 'u']) for i in range(3) ] == [5, 7, 5] :\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "print('NYOE S'[[sum(c in'aeiou'for c in input())for f in\"012\"]==[5,7,5]::2])", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nans = []\r\nfor _ in range(3):\r\n cnt = 0\r\n data = input().rstrip()\r\n for i in data:\r\n if i in ['a', 'e', 'i', 'o', 'u']:\r\n cnt += 1\r\n ans.append(cnt)\r\n\r\nif ans == [5, 7, 5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def count_syllables(word):\r\n vowels = \"aeiou\"\r\n return sum(1 for char in word if char in vowels)\r\n\r\ndef is_haiku(phrase1, phrase2, phrase3):\r\n haiku_format = [5, 7, 5]\r\n phrases = [phrase1.strip(), phrase2.strip(), phrase3.strip()]\r\n \r\n for i in range(3):\r\n num_syllables = count_syllables(phrases[i])\r\n if num_syllables != haiku_format[i]:\r\n return False\r\n \r\n return True\r\n\r\n# Read input\r\nphrase1 = input().strip()\r\nphrase2 = input().strip()\r\nphrase3 = input().strip()\r\n\r\n# Check if the poem is a haiku\r\nif is_haiku(phrase1, phrase2, phrase3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nimport re\r\n\r\ndef main():\r\n s = sys.stdin.read().strip().split('\\n')\r\n return ('NO', 'YES')[[len(re.findall('[aeiou]', i)) for i in s] == [5, 7, 5]]\r\n\r\nprint(main())\r\n", "l=[]\r\nfor i in range(3):\r\n s=input()\r\n s=s.strip()\r\n l.append(s)\r\nflag=1\r\nfor j in range(3):\r\n a=l[j].count('a')\r\n e=l[j].count('e')\r\n i=l[j].count('i')\r\n o=l[j].count('o')\r\n u=l[j].count('u')\r\n summ=a+e+i+o+u\r\n #print (j,summ)\r\n if(j==0 and summ==5):\r\n continue\r\n elif(j==1 and summ==7):\r\n continue\r\n elif(j==2 and summ==5):\r\n continue\r\n else:\r\n #print(i)\r\n flag=0\r\n break\r\nif(flag):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import deque\nimport re\n\nhaiku = deque()\n\nhaiku.append(len(re.findall('(a\|e\|o\|i\|u)',input())))\nhaiku.append(len(re.findall('(a\|e\|o\|i\|u)',input())))\nhaiku.append(len(re.findall('(a\|e\|o\|i\|u)',input())))\n\nif [5,7,5] == [haiku.pop(), haiku.pop(), haiku.pop()]:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "a=list(input())\r\nb=list(input())\r\nc=list(input())\r\nv=['a','e','i','o','u']\r\nk=0\r\nflag=0\r\nfor i in range(len(a)):\r\n if a[i] in v:\r\n k+=1\r\nif k!=5:\r\n flag=1\r\nk=0\r\nfor i in range(len(b)):\r\n if b[i] in v:\r\n k+=1\r\nif k!=7:\r\n flag=1\r\nk=0\r\nfor i in range(len(c)):\r\n if c[i] in v:\r\n k+=1\r\nif k!=5:\r\n flag=1\r\nif flag==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys \r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w') \r\n \r\ndef countVowel(st):\r\n aa=0\r\n for i in range(len(st)):\r\n if st[i]=='a' or st[i]=='e' or st[i]=='i' or st[i]=='o' or st[i]=='u' :\r\n aa+=1\r\n return aa\r\n\r\n# T = int(input())\r\n# for t in range(T):\r\n# n,c = map(int,input().split())\r\nhk = []\r\nfor i in range(3):\r\n a = input().strip()\r\n hk.append(a)\r\ncount = []\r\nchcount = [5,7,5]\r\nfor i in hk:\r\n a = countVowel(i)\r\n count.append(a)\r\nif count==chcount:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "line1 = input()\r\nline2 = input()\r\nline3 = input()\r\ncount1 = 0\r\ncount2 = 0\r\ncount3 = 0\r\nfor i in range(0,len(line1)):\r\n if(line1[i] == 'a' or line1[i] == 'e' or line1[i] == 'i' or line1[i] == 'o' or line1[i] == 'u'):\r\n count1 = count1+1\r\n\r\nfor i in range(0,len(line2)):\r\n if(line2[i] == 'a' or line2[i] == 'e' or line2[i] == 'i' or line2[i] == 'o' or line2[i] == 'u'):\r\n count2 = count2+1 \r\n\r\nfor i in range(0,len(line3)):\r\n if(line3[i] == 'a' or line3[i] == 'e' or line3[i] == 'i' or line3[i] == 'o' or line3[i] == 'u'):\r\n count3 = count3+1 \r\n\r\nif(count1==5 and count2==7 and count3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "v1 = input()\r\nv2 = input()\r\nv3 = input()\r\ns=0\r\nfor i in range(len(v1)):\r\n if v1[i] == 'a' or v1[i] == 'e' or v1[i] == 'i' or v1[i] == 'o' or v1[i] == 'u':\r\n s+=1\r\nif s==5:\r\n s=0;\r\n v1 = v2\r\n for i in range(len(v1)):\r\n if v1[i] == 'a' or v1[i] == 'e' or v1[i] == 'i' or v1[i] == 'o' or v1[i] == 'u':\r\n s+=1\r\n if s==7:\r\n s=0\r\n v1 = v3\r\n for i in range(len(v1)):\r\n if v1[i] == 'a' or v1[i] == 'e' or v1[i] == 'i' or v1[i] == 'o' or v1[i] == 'u':\r\n s+=1\r\n if s==5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "def main():\n res = True\n for n in 5, 7, 5:\n res &= sum(c in ('a', 'e', 'i', 'o', 'u') for c in input()) == n\n print(('NO', 'YES')[res])\n\n\nif __name__ == '__main__':\n main()\n\n\n\n", "line1 = list(input().split())\nline2 = list(input().split())\nline3 = list(input().split())\n\ncounter = 0\ncounter1 = 0\ncounter2 = 0\n\nfor i in range(len(line1)):\n for j in range(len(line1[i])):\n if line1[i][j] == 'a' or line1[i][j] == 'e' or line1[i][j] == 'i' or line1[i][j] == 'o' or line1[i][j] == 'u':\n counter += 1\n\nfor i in range(len(line2)):\n for j in range(len(line2[i])):\n if line2[i][j] == 'a' or line2[i][j] == 'e' or line2[i][j] == 'i' or line2[i][j] == 'o' or line2[i][j] == 'u':\n counter1 += 1\n\nfor i in range(len(line3)):\n for j in range(len(line3[i])):\n if line3[i][j] == 'a' or line3[i][j] == 'e' or line3[i][j] == 'i' or line3[i][j] == 'o' or line3[i][j] == 'u':\n counter2 += 1\n\nif counter == 5 and counter1 == 7 and counter2 == 5:\n print(\"YES\")\nelse:\n print(\"NO\")", "x=['a','e','i','o','u']\r\na=input().strip()\r\nb=input().strip()\r\nc=input().strip()\r\nm,n,o=0,0,0\r\nfor i in range(len(a)):\r\n\tif a[i] in x:\r\n\t\tm+=1\r\nfor i in range(len(b)):\r\n\tif b[i] in x:\r\n\t\tn+=1\r\nfor i in range(len(c)):\r\n\tif c[i] in x:\r\n\t\to+=1\r\nif m==5 and n==7 and o==5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "string_1=input(\"\")\r\nstring_2=input(\"\")\r\nstring_3=input(\"\")\r\nvowels=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\ncounter1=0\r\ncounter2=0\r\ncounter3=0\r\nfor i in range(len(string_1)):\r\n if string_1[i] in vowels:\r\n counter1+=1\r\nfor i in range(len(string_2)):\r\n if string_2[i] in vowels:\r\n counter2+=1\r\nfor i in range(len(string_3)):\r\n if string_3[i] in vowels:\r\n counter3+=1\r\nif counter1==5 and counter2==7 and counter3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\nI1 = lambda :map(int,input().split())\nI = lambda: input()\ndef cal(s,vowel):\n c = 0\n for i in s:\n if i in vowel:\n c+=1\n return c\na1,a2,a3 = I(),I(),I()\nvowel = \"aeiou\"\nprint(\"YES\"if cal(a1,vowel) == 5 and cal(a2,vowel) == 7 and cal(a3,vowel) == 5 else \"NO\")\n\n", "a=[]\r\nb=[]\r\nfor i in range(3):\r\n a+=[input()]\r\nfor i in a:\r\n b+=[len([j for j in i if j in'aeiou'])]\r\nif b==[5,7,5]:\r\n print('YES')\r\nelse:\r\n print('NO')", "line1 = input()\r\nline2 = input()\r\nline3 = input()\r\nlist = [line1, line2, line3]\r\n\r\nvowelcount1 = 0\r\nvowelcount2 = 0\r\nvowelcount3 = 0\r\n\r\nvowelist = [\"a\", 'e', 'i', 'o', 'u']\r\n\r\nfor i in range(3):\r\n vowelcount = 0\r\n for j in range(len(list[i])):\r\n if list[i][j] in vowelist:\r\n vowelcount += 1\r\n if i == 0:\r\n vowelcount1 = vowelcount\r\n elif i == 1:\r\n vowelcount2 = vowelcount\r\n elif i == 2:\r\n vowelcount3 = vowelcount\r\n\r\nif vowelcount1 == 5 and vowelcount2 == 7 and vowelcount3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "count_vowels = lambda s: sum(ch in 'aeiou' for ch in s)\r\n\r\nprint('YES' if (count_vowels(input()) == 5 and\r\n count_vowels(input()) == 7 and\r\n count_vowels(input()) == 5) else 'NO')", "verified = 0\nvowels = ['a', 'e', 'i', 'o', 'u']\n\nfor i in range(3):\n line = input()\n count = 0\n for j in range(len(line)):\n if line[j] in vowels:\n count += 1\n if i % 2 == 0:\n if count == 5:\n verified += 1\n else:\n if count == 7:\n verified += 1\n\nif verified == 3:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "VOWELS = set(\"aeiou\")\n\n\nfirst = input()\nsecond = input()\nthird = input()\n\nfirst_counter = 0\nfor c in first:\n if c in VOWELS:\n first_counter += 1\n\nsecond_counter = 0\nfor c in second:\n if c in VOWELS:\n second_counter += 1\n\nthird_counter = 0\nfor c in third:\n if c in VOWELS:\n third_counter += 1\n\nif (first_counter, second_counter, third_counter) == (5, 7, 5):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "li=['a','e','i','o','u']\r\nki=[5,7,5]\r\ndi=[]\r\nc=0\r\nfor i in range(3):\r\n sr=input()\r\n for j in sr:\r\n if j in li:\r\n c=c+1;\r\n di.append(c)\r\n c=0\r\nif di==ki:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n ", "def count_vowels(word):\r\n vowels = \"aeiou\"\r\n return sum(1 for letter in word if letter in vowels)\r\ndef is_haiku(phrase1, phrase2, phrase3):\r\n syllables1 = sum(count_vowels(word) for word in phrase1.split())\r\n syllables2 = sum(count_vowels(word) for word in phrase2.split())\r\n syllables3 = sum(count_vowels(word) for word in phrase3.split())\r\n return syllables1 == 5 and syllables2 == 7 and syllables3 == 5\r\nphrase1 = input().strip()\r\nphrase2 = input().strip()\r\nphrase3 = input().strip()\r\nif is_haiku(phrase1, phrase2, phrase3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nfrases = []\r\nes_haiku = True\r\n\r\nfor i in range(3):\r\n frases.append(input())\r\n\r\ni = 0\r\nwhile es_haiku and i<3:\r\n minusculas = 0\r\n for j in range(len(frases[i])):\r\n if (frases[i][j] == 'a' or\r\n frases[i][j] == 'e' or\r\n frases[i][j] == 'i' or\r\n frases[i][j] == 'o' or\r\n frases[i][j] == 'u'):\r\n minusculas = minusculas+1\r\n if (((i == 0 or i == 2) and minusculas > 5) or (i == 1 and minusculas > 7)):\r\n es_haiku = False\r\n if (es_haiku and ((i == 0 or i == 2) and minusculas != 5) or (i == 1 and minusculas != 7)): \r\n es_haiku = False\r\n i = i+1\r\nif es_haiku:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\nfrom itertools import \r\nfrom cmath import \r\n\r\ninput = sys.stdin.readline\r\nfrom math import \r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return int(input().strip())\r\n\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return list(s[:len(s) - 1])\r\n\r\n\r\ndef invr():\r\n return map(int, input().split())\r\n\r\n\r\nvowels = \"aeiou\"\r\ncnt = 0\r\nans = 0\r\ns = \"\"\r\ns = str(input())\r\nfor char in s:\r\n if char in vowels:\r\n cnt += 1\r\nif cnt == 5:\r\n ans += 1\r\ncnt = 0\r\ns = str(input())\r\nfor char in s:\r\n if char in vowels:\r\n cnt += 1\r\nif cnt == 7:\r\n ans += 1\r\ncnt = 0\r\ns = str(input())\r\nfor char in s:\r\n if char in vowels:\r\n cnt += 1\r\nif cnt == 5:\r\n ans += 1\r\n\r\nprint(\"YES\" if ans == 3 else \"NO\")\r\n", "import random\r\nletter= []\r\nfor i in range(3):\r\n row = input()\r\n letter.append(row)\r\nif letter[0].count('a')+letter[0].count('e')+letter[0].count('o')+letter[0].count('i')+letter[0].count('u') ==5 and letter[1].count('a')+letter[1].count('e')+letter[1].count('o')+letter[1].count('i')+letter[1].count('u') ==7 and letter[2].count('a')+letter[2].count('e')+letter[2].count('o')+letter[2].count('i')+letter[2].count('u') ==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\nans = 'YES'\r\nres = [5, 7, 5]\r\nfor i in range(3):\r\n n = input()\r\n s = Counter(n)\r\n if s['a'] + s['e'] + s['i'] + s['o'] + s['u'] != res[i]:\r\n ans = 'NO'\r\n break\r\nprint(ans)", "l = []\r\nl1 = [\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nfor i in range(3):\r\n\tcount = 0\r\n\ts = input().split()\r\n\tfor k in s:\r\n\t\tfor j in k:\r\n\t\t\tif j in l1:\r\n\t\t\t\tcount += 1\r\n\tl.append(count)\r\nif l==[5,7,5]:\r\n\tprint(\"YES\")\r\nelse:print(\"NO\")\t\t\t\t\t\r\n", "\"\"\" \r\n\r\n///░░░░░░░░░░░░░▄░░░░░░░░░░░░░░░░░░░░░\r\n///░░░░░░░░░░░▄▐░▄▄█████▄▄░░░░░░░░░░░░░░\r\n///░░░░░░░░░▄█████████████▄▀▄▄░▄▄▄░░░░░░░\r\n///░░░░░░░░█████████████████▄██████░░░░░░░\r\n///░░░░░░░████▐█████▌████████▌█████▌░░░░░░░\r\n///░░░░░░████▌█████▌█░████████▐▀██▀░░░░░░░\r\n///░░░░▄█████░█████▌░█░▀██████▌█▄▄▀▄░░░░░░░\r\n///░░░░▌███▌█░▐███▌▌░░▄▄░▌█▌███▐███░▀░░░░░░░\r\n///░░░▐░▐██░░▄▄▐▀█░░░▐▄█▀▌█▐███▐█░░░░░░░\r\n///░░░░░███░▌▄█▌░░▀░░▀██░░▀██████▌░░░░░░░\r\n///░░░░░░▀█▌▀██▀░▄░░░░░░░░░███▐███░░░░░░░░\r\n///░░░░░░░██▌░░░░░░░░░░░░░▐███████▌░░░░░░░░\r\n///░░░░░░░███░░░░░▀█▀░░░░░▐██▐███▀▌░░░░░░░\r\n///░░░░░░░▌█▌█▄░░░░░░░░░▄▄████▀░▀░░░░░░░\r\n///░░░░░░░░░█▀██▄▄▄░▄▄▀▀▒█▀█░▀░░░░░░░\r\n///░░░░░░░░░░░░▀░▀█▀▌▒▒▒░▐▄▄░░░░░░░\r\n///░░░░░░░░░░░▄▄▀▀▄░░░░░░▄▀░▀▀▄▄░░░░░░░\r\n///░░░░░░░░░▄▀░▄▀▄░▌░░░▄▀░░░░░░▄▀▀▄░░░░░░░\r\n///░░░░░░░░▐▒▄▀▄▀░▌▀▄▄▀░░░░░░▄▀▒▒▒▐░░░░░░░\r\n///░░░░░░░▐▒▒▌▀▄░░░░░▌░░░░▄▄▀▒▐▒▒▒▒▌░░░░░░░\r\n///░░░░░░▐▒▒▐░▌░▀▄░░▄▀▀▄▀▀▒▌▒▐▒▒▒▒▐▐░░░░░░░░\r\n///░░░░░░▌▄▀░░░▄▀░█▀▒▒▒▒▀▄▒▌▐▒▒▒▒▒▌▌░░░░░░░\r\n///░░░░░▄▀▒▐░▄▀░░░▌▒▐▒▐▒▒▒▌▀▒▒▒▒▒▐▒▌░░░░░░ \r\n\r\n\"\"\"\r\n\"\"\"define ja bsdk hila le ladki ko dekh ke\"\"\" \r\n\r\na=input()\r\nb=input()\r\nc=input()\r\ntemp=0\r\nt=0\r\np=0\r\nfor i in range(len(a)):\r\n if a[i]=='a' or a[i]=='i' or a[i]=='e'or a[i]=='o' or a[i]=='u':\r\n temp+=1\r\nfor i in range(len(b)):\r\n if b[i]=='a' or b[i]=='i' or b[i]=='e'or b[i]=='o' or b[i]=='u':\r\n t+=1 \r\nfor i in range(len(c)):\r\n if c[i]=='a' or c[i]=='i' or c[i]=='e'or c[i]=='o' or c[i]=='u':\r\n p+=1 \r\nif temp==5 and t==7 and p==5 and temp+t+p==17:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\"\"\"\r\n//ascii of a=97\r\n//ascii of A=65\r\n//ascii of 0=48\r\n//lower_bound and upper_bound\r\n/ Har Har Mahadev!! /\r\n\r\n\"\"\"", "def solve():\n target = [5, 7, 5]\n ans = 'YES'\n for i in range(3):\n s = input()\n cnt = 0\n for x in s:\n if x in 'aeiou':\n cnt += 1\n if cnt != target[i]:\n ans = 'NO'\n return ans\n\nprint(solve())", "from sys import stdin\r\nimport math\r\n\r\nA = stdin.readline()\r\nB = stdin.readline()\r\nC = stdin.readline()\r\ncount = 0\r\nK =0\r\n\r\nfor j in A:\r\n if (j=='a' or j=='e') or (j=='i' or (j=='o' or j=='u')):\r\n count+=1\r\n if count>5:\r\n K = 1\r\n break\r\n\r\nif count!=5 or K==1:\r\n print('NO')\r\nelse:\r\n\r\n count = 0\r\n for j in B:\r\n if (j == 'a' or j == 'e') or (j == 'i' or (j == 'o' or j == 'u')):\r\n count += 1\r\n if count > 7:\r\n K = 1\r\n break\r\n if count!=7 or K==1:\r\n print('NO')\r\n else:\r\n count = 0\r\n for j in C:\r\n if (j == 'a' or j == 'e') or (j == 'i' or (j == 'o' or j == 'u')):\r\n count += 1\r\n if count > 5:\r\n K = 1\r\n break\r\n if count!=5 or K==1:\r\n print('NO')\r\n else:\r\n print('YES')", "s1=input().replace(' ','')\r\ns2=input().replace(' ','')\r\ns3=input().replace(' ','')\r\nv1=0\r\nv2=0\r\nv3=0\r\nvowels=['a','e','i','o','u']\r\nfor i in range(len(s1)):\r\n if s1[i] in vowels:\r\n v1+=1\r\nfor j in range(len(s2)):\r\n if s2[j] in vowels:\r\n v2+=1\r\nfor k in range(len(s3)):\r\n if s3[k] in vowels:\r\n v3+=1\r\nif v1==5 and v2==7 and v3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "x=[]\r\nfor i in range(3):\r\n s=input()\r\n c=0\r\n for j in s:\r\n if(j=='a' or j=='e' or j=='i' or j=='o' or j=='u'):\r\n c+=1 \r\n x.append(c)\r\nif(x[0]==5 and x[1]==7 and x[2]==5 ):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nfinal = 0\r\nvowel = ['a', 'e', 'i', 'o', 'u']\r\ncount = 0\r\nfor i in range(len(s1)):\r\n if s1[i].isalpha() and s1[i] in vowel:\r\n count += 1\r\nif count == 5:\r\n final += 1\r\n count = 0\r\n for i in range(len(s2)):\r\n if s2[i].isalpha() and s2[i] in vowel:\r\n count += 1\r\n if count == 7:\r\n final += 1\r\n count = 0\r\n for i in range(len(s3)):\r\n if s3[i].isalpha() and s3[i] in vowel:\r\n count += 1\r\n if count == 5:\r\n final += 1\r\nif final == 3:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n", "good = True\r\n\r\nv = {'a', 'e', 'i', 'o', 'u'}\r\n\r\ndef cv(st):\r\n t = 0\r\n for c in st:\r\n if c in v:\r\n t += 1\r\n return t\r\n\r\nfor cnt in [5, 7, 5]:\r\n s = input()\r\n\r\n if good and cv(s) != cnt:\r\n good = False\r\n\r\nprint(\"YES\" if good else \"NO\")", "a, b, c = input(), input(), input()\r\nres = [sum(line.count(v) for v in 'aeiou') for line in [a,b,c]] \r\nprint([\"NO\",\"YES\"][res == [5,7,5]])", "a=input()\r\nb=input()\r\nc=input()\r\ncnt1=0\r\ncnt2=0\r\ncnt3=0\r\nfor i in a:\r\n if i in \"aeiou\":\r\n cnt1+=1\r\nfor i in b:\r\n if i in \"aeiou\":\r\n cnt2+=1\r\nfor i in c:\r\n if i in \"aeiou\":\r\n cnt3+=1\r\nif cnt1==5 and cnt2==7 and cnt3==5:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\ndef s(x):\r\n index=\"aeiou\"\r\n l=0\r\n for i in x:\r\n if i in index:\r\n l=l+1\r\n return l\r\nls1=list(a)\r\nls2=list(b)\r\nls3=list(c)\r\nif s(ls1)==5 and s(ls2)==7 and s(ls3)==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def countVowels(string):\r\n vowels = ['a','e','i','o','u']\r\n total = 0\r\n for s in string:\r\n if s in vowels:\r\n total += 1\r\n return total\r\n\r\na1 = input()\r\na2 = input()\r\na3 = input()\r\n\r\nprint(\"YES\" if countVowels(a1) == 5 and countVowels(a2) == 7 and countVowels(a3) == 5 else \"NO\")\r\n", "n = []\r\n[n.append(input()) for i in range(3)]\r\nflag = True\r\nif n[0].count('a') + n[0].count('e') + n[0].count('i') + n[0].count('o') + n[0].count('u') != 5:\r\n flag = False\r\nif n[1].count('a') + n[1].count('e') + n[1].count('i') + n[1].count('o') + n[1].count('u') != 7:\r\n flag = False\r\nif n[2].count('a') + n[2].count('e') + n[2].count('i') + n[2].count('o') + n[2].count('u') != 5:\r\n flag = False\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "li=[input()for i in range(3)]\r\nfor i in range(3):\r\n cnt=0\r\n for j in li[i]:\r\n if j in 'aieou':\r\n cnt+=1\r\n if cnt not in(5,7):print('NO');break\r\n else:\r\n if cnt==5:\r\n if i not in (0,2):print('NO');break\r\n elif cnt==7:\r\n if i != 1:print('NO');break\r\n else:break\r\nelse:print('YES')", "l1=input()\nl2=input()\nl3=input()\ncount1=0\ncount2=0\ncount3=0\nvow=[\"a\",\"e\",\"i\",\"o\",\"u\"]\nfor i in l1:\n if i in vow:\n count1+=1\nfor i in l2:\n if i in vow:\n count2+=1\nfor i in l3:\n if i in vow:\n count3+=1\nif count1==5 and count2==7 and count3==5:\n print(\"YES\")\nelse:\n print(\"NO\") \n\n\n\t\t\t \t \t\t \t \t\t\t\t\t\t\t\t\t \t\t \t\t\t", "poem = [input() for i in range(3)]\n\nvowels = \"aeiou\"\n\nif ([len([v for v in line if v in vowels]) for line in poem]) == [5,7,5] :\n print(\"YES\")\nelse :\n print(\"NO\")\n", "vowels = {'a','e','i','o','u'}\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\ncount1 = 0\r\ncount2 = 0\r\ncount3 = 0\r\nfor i in s1:\r\n if i in vowels:\r\n count1 += 1\r\nfor i in s2:\r\n if i in vowels:\r\n count2 += 1\r\nfor i in s3:\r\n if i in vowels:\r\n count3 += 1\r\nif(count1 == 5 and count2 == 7 and count3 == 5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=list(input())\r\nb=list(input())\r\nc=list(input())\r\n\r\n\r\nv =[\"a\", \"e\", \"i\", \"o\",\"u\"]\r\n\r\nd,t,y=0,0,0\r\nfor j in a:\r\n if j in v:\r\n d+=1\r\nfor k in b:\r\n if k in v:\r\n t+=1\r\nfor s in c:\r\n if s in v:\r\n y+=1\r\n\r\n\r\nif d==5 and t==7 and y==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import re\r\ndef f(s):\r\n\treturn len(re.findall('(a\|e\|i\|o\|u)', s))\r\nif [5, 7, 5] == [f(input()), f(input()), f(input())]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = []\r\nfor i in range(3):\r\n s.append(sum([1 for i in input() if i in 'aeiou']))\r\nprint('YES') if s == [5, 7, 5] else print('NO')\r\n", "print(('NO', 'YES')[[sum(c in 'aeiou' for c in input()) for _ in \"012\"] == [5, 7, 5]])", "ans = \"\"\r\nfor i in range(3):\r\n s = input()\r\n vowels = [\"a\",'e', 'i', 'o', 'u']\r\n cnt = 0\r\n for ch in s:\r\n if ch in vowels:\r\n cnt += 1\r\n if ((i == 0 or i == 2) and (cnt == 5)) or ((i==1) and cnt == 7):\r\n ans = \"YES\"\r\n else:\r\n ans = \"NO\"\r\n break\r\nprint(ans)\r\n ", "flag = True\r\nfor i in range(3):\r\n a = input()\r\n count = a.count('a') + a.count('e') + a.count('u') + a.count('o') + a.count('i')\r\n if i == 0 or i == 2:\r\n if count != 5:\r\n flag = False\r\n break\r\n if i == 1:\r\n if count != 7:\r\n flag = False\r\n break\r\nprint('YES' if flag else 'NO')", "l1 = input()\r\nl2 = input()\r\nl3 = input()\r\nc1 = len(l1)\r\nc2 = len(l2)\r\nc3 = len(l3)\r\nc11, c22, c33 = 0, 0, 0\r\nfor i in range(c1):\r\n if l1[i]=='a' or l1[i]=='e' or l1[i]=='i' or l1[i]=='o' or l1[i]=='u':\r\n c11 = c11+1\r\nfor j in range(c2):\r\n if l2[j]=='a' or l2[j]=='e' or l2[j]=='i' or l2[j]=='o' or l2[j]=='u':\r\n c22 = c22+1 \r\nfor k in range(c3):\r\n if l3[k]=='a' or l3[k]=='e' or l3[k]=='i' or l3[k]=='o' or l3[k]=='u':\r\n c33 = c33+1\r\nif c11==5 and c22==7 and c33==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = [5, 7, 5]\r\nhaiku = True\r\nfor i in range(3):\r\n s = input().strip()\r\n vowel = sum(1 for i in s if i in \"aeiou\")\r\n if vowel != n[i]:\r\n haiku = False\r\n break\r\nprint(\"YES\" if haiku else \"NO\")", "import math\r\n\r\ndef main_function():\r\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\n inputs = [input() for i in range(3)]\r\n counters = [0 for i in range(3)]\r\n for i in range(len(inputs)):\r\n for j in inputs[i]:\r\n for h in vowels:\r\n if h == j:\r\n counters[i] += 1\r\n if counters == [5, 7, 5]:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nprint(main_function())", "a=[]\r\nfor i in range(3):\r\n s=input()\r\n a.append(s)\r\ndef fn(a):\r\n vow=['a','e','i','o','u']\r\n c1,c2,c3=0,0,0\r\n for i in range(3):\r\n for j in a[i]:\r\n if j in vow and i==0:c1+=1\r\n elif j in vow and i==1:c2+=1\r\n elif j in vow and i==2:c3+=1\r\n if c1==5 and c2==7 and c3==5:return 'YES'\r\n else:return 'NO'\r\nprint(fn(a))\r\n", "a = input()\r\nb = input()\r\nc = input()\r\nasum = a.count('a') + a.count('e') + a.count('i') + a.count('o') + a.count('u')\r\nbsum = b.count('a') + b.count('e') + b.count('i') + b.count('o') + b.count('u')\r\ncsum = c.count('a') + c.count('e') + c.count('i') + c.count('o') + c.count('u')\r\nif(asum==5 and bsum==7 and csum==5):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "print('NYOE S'[[sum(c in'aeiou'for c in input())for _ in\"012\"]==[5,7,5]::2])", "def main():\r\n syllables = [5, 7, 5]\r\n haiku = True\r\n\r\n for i in range(3):\r\n ch = input()\r\n n = sum(ch.count(vowel) for vowel in 'aeiou')\r\n\r\n if n != syllables[i]:\r\n haiku = False\r\n\r\n print(\"YES\" if haiku else \"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "v = []\nfor _ in range(0, 3):\n v.append(sum(x in 'aeiou' for x in input()))\nprint(['NO', 'YES'][v == [5, 7, 5]])\n", "s1 = list(input())\r\ns2 = list(input())\r\ns3 = list(input())\r\n\r\nans = [0 for _ in range(3)]\r\nfor i in range(len(s1)):\r\n if s1[i] == 'a' or s1[i] == 'e' or s1[i] == 'i' or s1[i] == 'o' or s1[i] == 'u':\r\n ans[0] += 1\r\n\r\nfor i in range(len(s2)):\r\n if s2[i] == 'a' or s2[i] == 'e' or s2[i] == 'i' or s2[i] == 'o' or s2[i] == 'u':\r\n ans[1] += 1\r\n\r\nfor i in range(len(s3)):\r\n if s3[i] == 'a' or s3[i] == 'e' or s3[i] == 'i' or s3[i] == 'o' or s3[i] == 'u':\r\n ans[2] += 1\r\n\r\nif ans == [5, 7, 5]:\r\n print('YES')\r\nelse:\r\n print('NO')", "l=[5,7,5]\r\nd=0\r\nfor i in range(3):\r\n s=str(input())\r\n if s.count(\"a\")+s.count(\"e\")+s.count(\"i\")+s.count(\"o\")+s.count(\"u\")==l[i]:\r\n d+=1\r\nif d==3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\ns1 = a.count('a')+a.count('o')+a.count('u')+a.count('e')+a.count('i')\r\ns2 = b.count('a')+b.count('o')+b.count('u')+b.count('e')+b.count('i')\r\ns3 = c.count('a')+c.count('o')+c.count('u')+c.count('e')+c.count('i')\r\nif s1==5 and s2==7 and s3==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "haiku=[0,0,0]\r\nvowel=\"aeiou\"\r\n\r\nfor i in range(3):\r\n\tpoem=list(input().split())\r\n\tfor j in poem:\r\n\t\tfor k in j:\r\n\t\t\tfor l in vowel:\r\n\t\t\t\tif k==l:\r\n\t\t\t\t\thaiku[i]+=1;\r\nif haiku==[5,7,5]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nc1=0\r\nc2=0\r\nc3=0\r\nx=input()\r\ny=input()\r\nz=input()\r\nfor i in a:\r\n c1=c1+x.count(i)\r\nfor i in a:\r\n c2=c2+y.count(i)\r\nfor i in a:\r\n c3=c3+z.count(i)\r\nif(c1==5 and c2==7 and c3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nz=0\r\nfor i in range(3):\r\n\tcount=0\r\n\ts=input()\r\n\tfor x in s:\r\n\t\tif x==\"a\" or x==\"e\" or x==\"i\" or x==\"o\" or x==\"u\":\r\n\t\t\tcount+=1\r\n\t\telse:\r\n\t\t\tcontinue\r\n\tif i==1:\r\n\t\tif count==7:\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tz=1\r\n\telse:\r\n\t\tif count==5:\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tz=1\r\nif z==1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n", "# 78A Haiku\r\n\r\n# phrase_1 = input()\r\n# phrase_2 = input()\r\n# phrase_3 = input()\r\n\r\n# count_1 = 0\r\n# count_2 = 0\r\n# count_3 = 0\r\n\r\n# for i in phrase_1:\r\n# \tif i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n# \t\tcount_1 += 1\r\n\r\n# for i in phrase_2:\r\n# \tif i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n# \t\tcount_2 += 1\r\n\r\n# for i in phrase_3:\r\n# \tif i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n# \t\tcount_3 += 1\r\n\r\n# if count_1 == 5 and count_2 == 7 and count_3 == 5:\r\n# \tprint(\"YES\")\r\n# else:\r\n# \tprint(\"NO\")\r\n\r\n\r\n\r\n\r\n#Alternate way\r\nvowel = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\n\r\nphrase_1 = input()\r\nphrase_2 = input()\r\nphrase_3 = input()\r\n\r\ncount_1 = 0\r\ncount_2 = 0\r\ncount_3 = 0\r\n\r\nfor i in range(len(phrase_1)):\r\n\tif phrase_1[i] in vowel:\r\n\t\tcount_1 += 1\r\n\r\nfor i in range(len(phrase_2)):\r\n\tif phrase_2[i] in vowel:\r\n\t\tcount_2 += 1\r\n\r\nfor i in range(len(phrase_3)):\r\n\tif phrase_3[i] in vowel:\r\n\t\tcount_3 += 1\r\n\r\nif count_1 == 5 and count_2 == 7 and count_3 == 5:\r\n\tprint(\"YES\")\r\n\r\nelse:\r\n\tprint(\"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", "vowels = ['a', 'e', 'i', 'o', 'u']\ncountVowels = lambda : len(list(filter(lambda c : c in vowels, input())))\nprint([\"NO\", \"YES\"][countVowels()==5 and countVowels()==7 and countVowels()==5])\n\n", "a=input()\r\nc1=0;\r\nvowels={'A','E','I','O','U','a','e','i','o','u'}\r\nfor letter in a:\r\n\tif(letter in vowels):\r\n\t\tc1+=1\r\nb=input()\r\nc2=0;\r\nfor letter in b:\r\n\tif(letter in vowels):\r\n\t\tc2+=1\r\nc=input()\r\nc3=0\r\nfor letter in c:\r\n\tif(letter in vowels):\r\n\t\tc3+=1\r\nif(c1==5 and c2==7 and c3==5):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n ", "vowels = ('a','e','i','o','u')\r\nans=\"YES\"\r\nh=[]\r\nfor t in range(3):\r\n cnt=0\r\n s = input()\r\n for i in s:\r\n if i in vowels:\r\n cnt+=1\r\n h.append(cnt)\r\nif h[0]==5 and h[1]==7 and h[2]==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def cv(s):\r\n return sum(s.count(x) for x in \"aeiou\")\r\n\r\nans = \"YES\"\r\ncnt = [5,7,5]\r\nfor i in range(3):\r\n if cv(input())!=cnt[i]:\r\n ans= \"NO\"\r\nprint(ans)", "x = []\r\nfor _ in range(3):\r\n count = 0\r\n s = input().replace(\" \", '')\r\n for i in range(len(s)):\r\n if s[i] in \"aeiou\":\r\n count += 1\r\n x.append(count)\r\n\r\nif x == [5, 7, 5]:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "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\na = [input().rstrip() for _ in range(3)]\r\ncnt = [sum(s.count(c) for c in 'aeiou') for s in a]\r\nif cnt == [5, 7, 5]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "vowel = 'aiueo'\r\ndata = []\r\nfor j in range(3):\r\n pharse = input()\r\n data.append(pharse)\r\ndata1 = []\r\nfor i in data:\r\n count = 0\r\n for j in i:\r\n if j in vowel:\r\n count += 1\r\n data1.append(count)\r\nif data1 == [5,7,5]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "list1 = []\r\nfor i in range(3):\r\n iterator = 1\r\n phrase = input()\r\n vowels = 'aeiou'\r\n count = 0\r\n for i in phrase:\r\n if i in vowels:\r\n count+=1\r\n list1.append(count)\r\nif list1[0]==5 and list1[1]==7 and list1[2]==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = list(input())\r\nb = list(input())\r\nc = list(input())\r\nflag='YES'\r\ncount=0\r\nfor i in a:\r\n if i in 'aeoui':\r\n count+=1\r\nif count!=5:\r\n flag='NO'\r\ncount=0\r\nfor i in b:\r\n if i in 'aeoui':\r\n count+=1\r\nif count!=7:\r\n flag='NO'\r\ncount=0\r\nfor i in c:\r\n if i in 'aeoui':\r\n count+=1\r\n\r\nif count!=5:\r\n flag='NO'\r\nprint(flag)", "from sys import stdin\ni=0\nans=True\nc=[5,7,5]\nfor line in stdin:\n if len([x for x in line if x in \"aeiou\"]) != c[i]:\n ans=False\n i+=1\n \nprint('YES' if ans else 'NO')\n \n", "first = input()\r\nsecond = input()\r\nthird = input()\r\nvowel = ['a' , 'e' , 'i' , 'o' , 'u']\r\ncounter =0\r\nflag = True\r\nfor i in range (len(first)):\r\n if first[i] in vowel :\r\n counter+=1\r\nif (counter != 5):\r\n flag = False\r\n print(\"NO\")\r\nif (flag):\r\n for i in range(len(second)):\r\n if second[i] in vowel:\r\n counter+=1\r\n if counter != 12:\r\n print(\"NO\")\r\n flag = False\r\n if (flag):\r\n for i in range (len(third)):\r\n if third[i] in vowel:\r\n counter+=1\r\n if counter != 17:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "# LUOGU_RID: 113222172\ndef yy(a):\r\n return a.count('a')+a.count('e')+a.count('i')+a.count('o')+a.count('u')\r\nif yy(input())==5 and yy(input())==7 and yy(input())==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nb = input()\r\nc = input()\r\ndef c_v(s):\r\n\tl = ['a','e','i','o','u']\r\n\tcnt = 0\r\n\tfor i in range(len(s)):\r\n\t\tif s[i] in l:\r\n\t\t\tcnt+=1\r\n\treturn cnt\r\nif c_v(a) == 5 and c_v(b) == 7 and c_v(c) == 5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "syllables = ['a','i','e','o','u']\r\nd = {1:5,2:7,3:5}\r\noutput = {}\r\nfor i in range(3):\r\n count=0\r\n sentence = input().strip().lower()\r\n for j in sentence:\r\n if (j in syllables):\r\n count+=1\r\n output[i+1]=count\r\nif d == output:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\nl=['a','e','i','o','u']\r\nd=0;e=0;f=0\r\nfor i in a:\r\n if i in l:\r\n d += 1\r\nfor i in b:\r\n if i in l:\r\n e += 1\r\nfor i in c:\r\n if i in l:\r\n f += 1\r\nif d==5 and e==7 and f==5:\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def count(s):\r\n return s.count(\"a\") + s.count(\"e\") + s.count(\"i\") + s.count(\"o\") + s.count(\"u\")\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\nif count(s1) == 5 and count(s2) == 7 and count(s3) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=input()\r\ny=input()\r\nz=input()\r\nx=list(x) ; y=list(y) ; z=list(z)\r\nvo=['a','e','i','o','u']\r\nc1=0 ; c2=0 ; c3=0\r\nfor i in x:\r\n if i in vo:\r\n c1=c1+1\r\nfor i in y:\r\n if i in vo:\r\n c2=c2+1\r\nfor i in z:\r\n if i in vo:\r\n c3=c3+1\r\nif((c1==5)and(c2==7)and(c3==5)):\r\n print('YES')\r\nelse:\r\n print('NO')", "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\txs=[5,7,5]\r\n\tflag=False\r\n\tfor i in range(3):\r\n\t\ta=read()\r\n\t\tcnt=0\r\n\t\tfor c in a:\r\n\t\t\tif c in \"aeiou\":\r\n\t\t\t\tcnt+=1\r\n\t\tif cnt!=xs[i]:\r\n\t\t\tprint(\"NO\")\r\n\t\t\treturn\r\n\tprint(\"YES\")\r\n\r\nsolve()\r\n", "a=input()\r\nb=input()\r\nc=input()\r\nfirst=a.count('a')+a.count('e')+a.count('i')+a.count('o')+a.count('u')\r\nsecond=b.count('a')+b.count('e')+b.count('i')+b.count('o')+b.count('u')\r\nthird=c.count('a')+c.count('e')+c.count('i')+c.count('o')+c.count('u')\r\nif first==5 and second==7 and third==5: print(\"YES\")\r\nelse: print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\ns=0\r\nso=0\r\nfor i in a:\r\n if i in 'aeiou' or i in 'AEIOU':\r\n s+=1\r\nso+=s\r\nif s==5:\r\n s=0\r\n for i in b:\r\n if i in 'aeiou' or i in 'AEIOU':\r\n s += 1\r\nso+=s\r\nif s==7:\r\n s = 0\r\n for i in c:\r\n if i in 'aeiou' or i in 'AEIOU':\r\n s += 1\r\nso+=s\r\nif s==5 and so==17:\r\n print('YES')\r\nelse:\r\n print('NO')", "g = ['a', 'e', 'i', 'o', 'u']\r\nans = [0]3\r\nh = [5,7,5]\r\nfor i in range(3):\r\n s = input()\r\n for j in s:\r\n if j in g:\r\n ans[i] += 1\r\nif ans == h:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "for i in range(3):\r\n line = input()\r\n o = \"YES\"\r\n count = 0\r\n count += line.count(\"a\")\r\n count += line.count(\"e\")\r\n count += line.count(\"i\")\r\n count += line.count(\"o\")\r\n count += line.count(\"u\")\r\n if i == 1:\r\n if count != 7:\r\n o = \"NO\"\r\n break\r\n else:\r\n continue\r\n else:\r\n if count != 5:\r\n o = \"NO\"\r\n break\r\n else:\r\n continue\r\nprint(o)\r\n", "vowels=['a','i','o','u','e']\r\ndef solve():\r\n\ta=str(input())\r\n\tb=str(input())\r\n\tc=str(input())\r\n\tx=0\r\n\ty=0\r\n\tz=0\r\n\tfor i in a:\r\n\t\tif i in vowels:\r\n\t\t\tx=x+1\r\n\tfor i in b:\r\n\t\tif i in vowels:\r\n\t\t\ty=y+1\r\n\tfor i in c:\r\n\t\tif i in vowels:\r\n\t\t\tz=z+1\r\n\t# print(x,y,z)\r\n\tif(x==5 and y==7 and z==5):\r\n\t\tprint(\"YES\")\r\n\telse: print(\"NO\")\r\n\r\n# print(\"HELO\")\r\n\r\nsolve()\r\n\r\n\r\n\r\n# t=int(input())\r\n# while t--:\r\n# \tsolve()", "a = input()\r\na1 = 0\r\nfor i in a.strip():\r\n if i in \"aeiou\":\r\n a1 += 1\r\nb = input()\r\nb1 = 0\r\nfor i in b.strip():\r\n if i in \"aeiou\":\r\n b1 += 1\r\nc = input()\r\nc1 = 0\r\nfor i in c.strip():\r\n if i in \"aeiou\":\r\n c1 += 1\r\n\r\nif a1 == 5 and b1 == 7 and c1 == 5:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\nquit()", "a=[5,7,5]\r\nfor i in range(3):\r\n s,count=input(),0\r\n for j in s:\r\n if j in \"aoeiu\":count+=1\r\n if count!=a[i]:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "def count_syllables(line: str) -> int:\n return sum(c in vowels for c in line)\n\n\ndef is_haiku(lines: [str]) -> bool:\n return len(lines) == 3 and \\\n count_syllables(lines[0]) == 5 and \\\n count_syllables(lines[1]) == 7 and \\\n count_syllables(lines[2]) == 5\n\n\ndef main():\n print('YES' if is_haiku([input() for _ in range(3)]) else 'NO')\n\n\nif __name__ == '__main__':\n vowels = 'aeiou'\n main()\n", "def f(s,x):\r\n\ta=0\r\n\tfor i in s:\r\n\t\tif i in ['a','e','i','o','u','A','E','I','O','U']:\r\n\t\t\ta+=1\r\n\tif a!=x:\r\n\t\treturn False\r\n\treturn True\r\nl=[]\r\nfor i in range(3):\r\n\ts=input()\r\n\tif i==1:\r\n\t\tx=7\r\n\telse:\r\n\t\tx=5\r\n\tl.append(f(s,x))\r\nif all(l):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s1 =input()\ns2=input()\ns3=input()\nvow=0\nvow1=0\nvow2=0\nl = ['a' , 'e' , 'i', 'o', 'u']\nfor i in range(len(s1)):\n if(s1[i]=='a' or s1[i]=='e' or s1[i]=='i' or s1[i]=='o' or s1[i]=='u' ):\n vow+=1\nfor j in range(len(s2)):\n if(s2[j]=='a' or s2[j]=='e' or s2[j]=='i' or s2[j]=='o' or s2[j]=='u' ):\n vow1+=1\nfor k in range(len(s3)):\n if(s3[k]=='a' or s3[k]=='e' or s3[k]=='i' or s3[k]=='o' or s3[k]=='u' ):\n vow2+=1\nif(vow==5 and vow1==7 and vow2==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t \t \t\t\t\t \t\t \t\t\t\t \t\t \t", "def count(s):\r\n\tc = 0\r\n\tfor i in s:\r\n\t\tif (i == 'a' or i == 'e' or i == 'i' or i==\"o\" or i == \"u\"):\r\n\t\t\tc += 1\r\n\treturn c\r\na = input()\r\nb = input()\r\nc = input()\r\nif (count(a) == 5 and count(b) == 7 and count(c) == 5):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "x = list(input())\r\ny = list(input())\r\nz = list(input())\r\na = x.count('a')\r\ne = x.count('e')\r\ni = x.count('i')\r\no = x.count('o')\r\nu = x.count('u')\r\nA = y.count('a')\r\nE = y.count('e')\r\nI = y.count('i')\r\nO = y.count('o')\r\nU = y.count('u')\r\na1 = z.count('a')\r\ne1 = z.count('e')\r\ni1 = z.count('i')\r\no1 = z.count('o')\r\nu1 = z.count('u')\r\np = a+e+i+o+u\r\nq = A+E+I+O+U\r\nr = a1+e1+i1+o1+u1\r\nif p==r==5 and q==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,r=[5,7,5],True\r\nfor z in range(3):\r\n s=input()\r\n vocales=0\r\n for i in range(len(s)):\r\n if(s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u'): vocales+=1\r\n if(vocales!=a[z]): r=False\r\nprint(\"YES\" if r else \"NO\")\r\n", "s=0\r\nk=0\r\nfor i in (5,7,5):\r\n s=0\r\n n=input().split()\r\n for m in n:\r\n for j in m:\r\n if(j in ('a','i','o','e','u')):\r\n s=s+1\r\n if(s==i):\r\n k=k+1\r\nif(k==3):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "s=str(input())\r\nt=str(input())\r\nu=str(input())\r\nL=['a','e','i','o','u']\r\nl1=0\r\nl2=0\r\nl3=0\r\nfor i in range(0,len(s)):\r\n\tif(s[i] in L):\r\n\t\tl1+=1\r\nif(l1!=5):\r\n\tprint(\"NO\")\r\nelse:\r\n\tfor i in range(0,len(t)):\r\n\t\tif(t[i] in L):\r\n\t\t\tl2+=1\r\n\tif(l2!=7):\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tfor i in range(0,len(u)):\r\n\t\t\tif(u[i] in L):\r\n\t\t\t\tl3+=1\r\n\t\tif(l3==5):\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\r\n", "lines = []\nfor i in range(3):\n lines.append(input().split())\n\nresults = []\n\nfor line in lines:\n vowelCount = 0\n for word in line:\n for letter in word:\n if letter in 'aeiou':\n vowelCount += 1\n results.append(vowelCount)\n\nif results[0] == 5 and results[1] == 7 and results[2] == 5:\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", "str1=input()\nstr2=input()\nstr3=input()\nls=[str1,str2,str3]\nvow=['a','e','i','o','u']\nc1,c2,c3=0,0,0\nfor str in ls:\n str.lower()\n str.strip()\n if (not(1<=len(str)<=100)):\n exit()\nfor i in range(0,len(str1)):\n if (str1[i] in vow):\n c1=c1+1\nfor i in range(0,len(str2)):\n if (str2[i] in vow):\n c2=c2+1\nfor i in range(0,len(str3)):\n if (str3[i] in vow):\n c3=c3+1\nif(c1==5 and c2==7 and c3==5):\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", "vowel=['a','e','i','o','u']\r\ns,cnt=input(),0\r\nfor i in range(len(s)):\r\n if s[i] in vowel:\r\n cnt+=1\r\nif(cnt!=5):\r\n print(\"NO\")\r\n exit()\r\ns,cnt=input(),0\r\nfor i in range(len(s)):\r\n if s[i] in vowel:\r\n cnt+=1 \r\nif(cnt!=7):\r\n print(\"NO\")\r\n exit()\r\ns,cnt=input(),0\r\nfor i in range(len(s)):\r\n if s[i] in vowel:\r\n cnt+=1 \r\nif(cnt!=5):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "slog = [\"a\" , \"e\" , \"i\" , \"o\" , \"u\"]\r\n\r\na = list(map(str,input().split()))\r\nb = list(map(str,input().split()))\r\nc = list(map(str,input().split()))\r\n\r\n#print(a , b , c)\r\n\r\nA = \"\".join(a)\r\nB = \"\".join(b)\r\nC = \"\".join(c)\r\n\r\n#print(A , B , C)\r\n\r\ncnt1 , cnt2 , cnt3 = 0 , 0 , 0\r\n\r\nfor i in range(len(A)):\r\n for j in range(len(slog)):\r\n if(A[i] == slog[j]):\r\n cnt1 += 1\r\n\r\nfor i in range(len(B)):\r\n for j in range(len(slog)):\r\n if(B[i] == slog[j]):\r\n cnt2 += 1\r\n\r\nfor i in range(len(C)):\r\n for j in range(len(slog)):\r\n if(C[i] == slog[j]):\r\n cnt3 += 1\r\n\r\n#print(cnt1 , cnt2 , cnt3)\r\n\r\nif(cnt1 == 5 and cnt2 == 7 and cnt3 == 5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n# «a» , «e» , «i» , «o» , «u»\r\n# 5 7 5", "import re\r\na=input()\r\nb=input()\r\nc=input()\r\nr=re.compile(r'[aeiou]')\r\nl1=r.findall(a)\r\nl2=r.findall(b)\r\nl3=r.findall(c)\r\nif(len(l1)==5 and len(l2)==7 and len(l3)==5):\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nb = input()\r\nc = input()\r\nans_a = 0\r\nans_b = 0\r\nans_c = 0\r\nfor i in range(len(a)):\r\n if a[i] in 'aeiou':\r\n ans_a += 1\r\nfor i in range(len(b)):\r\n if b[i] in 'aeiou':\r\n ans_b += 1\r\nfor i in range(len(c)):\r\n if c[i] in 'aeiou':\r\n ans_c += 1\r\nif ans_a == 5 and ans_b == 7 and ans_c == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "res = [sum(1 for c in input() if c in \"aeiou\") for _ in range(3)] == [5, 7, 5]\nprint(\"YES\" if res else \"NO\")\n", "samoglasnici = ['a', 'e', 'i', 'o', 'u']\r\nult = 0\r\n\r\nfor i in range(0, 3):\r\n s = input()\r\n br = 0\r\n \r\n for j in range(len(s)):\r\n if s[j] in samoglasnici:\r\n br += 1\r\n \r\n if i == 0 or i == 2:\r\n if br == 5:\r\n ult += 1\r\n\r\n if i == 1:\r\n if br == 7:\r\n ult += 1\r\n\r\nif ult == 3:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')\r\n", "l1 = input()\nl2 = input()\nl3 = input()\nl = [l1, l2, l3]\nflag = True\nk = [5, 7, 5]\nt = 0\nfor s in l:\n vow = []\n for ch in s:\n if(ch in ['a', 'e', 'i', 'o', 'u']):\n vow.append(ch)\n if(k[t] != len(vow)):\n flag = False\n break\n t += 1\nif(flag):\n print(\"YES\")\nelse:\n print(\"NO\")\n \n", "list1=['a','e','i','o','u']\r\nfor i in range(0,3):\r\n\tcount=0\r\n\ts=\"\".join(input().split())\r\n\tfor j in s:\r\n\t\tif j in list1:\r\n\t\t\tcount+=1\r\n\tif i==0 and count==5:\r\n\t\tcontinue\r\n\telif i==1 and count==7:\r\n\t\tcontinue\r\n\telif i==2 and count==5:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\tbreak", "list = []\r\nfor i in range(3):\r\n list.append(str(input()))\r\ncheck = 0 \r\nfor i in range(3):\r\n count = 0\r\n for j in range(len(list[i])):\r\n if list[i][j] == 'a' or list[i][j] == 'e' or list[i][j] == 'o' or list[i][j] == 'u' or list[i][j] == 'i':\r\n count += 1\r\n if i % 2 == 0:\r\n if count == 5:\r\n check += 1\r\n else:\r\n if count == 7:\r\n check += 1\r\n\r\n\r\n\r\n\r\nif check == 3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check_vowels(s,i=0):\r\n if i == len(s):\r\n return 0\r\n if s[i] == \"a\":\r\n return check_vowels(s,i+1) + 1\r\n elif s[i] == \"e\":\r\n return check_vowels(s,i+1) + 1\r\n elif s[i] == \"i\":\r\n return check_vowels(s,i+1) + 1\r\n elif s[i] == \"o\":\r\n return check_vowels(s,i+1) + 1\r\n elif s[i] == \"u\":\r\n return check_vowels(s,i+1)+1\r\n return check_vowels(s,i+1)\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\nx = check_vowels(s1)\r\ny = check_vowels(s2)\r\nz = check_vowels(s3)\r\nif x == 5:\r\n if y == 7:\r\n if z == 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "first=input().strip(' ')\r\nsecond=input().strip(' ')\r\nthird=input().strip(' ')\r\none,two,three=0,0,0\r\nvowels=['a','i','o','e','u']\r\nfor i in first:\r\n if i in vowels:\r\n one+=1\r\nfor i in second:\r\n if i in vowels:\r\n two+=1\r\nfor i in third:\r\n if i in vowels:\r\n three+=1\r\nif one==5 and two==7 and three==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "slogov_1 = 0\r\nslogov_2 = 0\r\nslogov_3 = 0\r\nc = 0\r\nhaiku = 0\r\nfor i in range(3):\r\n c += 1\r\n string = str(input())\r\n for g in range(len(string)):\r\n if string[g] == 'a' or string[g] == 'e' or string[g] == 'i' or string[g] == 'o' or string[g] == 'u':\r\n if c == 1:\r\n slogov_1 += 1\r\n elif c == 2:\r\n slogov_2 += 1\r\n elif c == 3:\r\n slogov_3 += 1\r\n if c == 1 and slogov_1 == 5:\r\n haiku += 1\r\n elif c == 2 and slogov_2 == 7:\r\n haiku += 1\r\n elif c == 3 and slogov_3 == 5:\r\n haiku += 1\r\nif haiku == 3:\r\n print('YES')\r\nelif haiku != 3:\r\n print('NO')", "x=input().strip()\r\ny=input().strip()\r\nz=input().strip()\r\nc=0\r\nfor i in x:\r\n if i in ['a','e','i','o','u']:\r\n c+=1\r\nif c!=5:\r\n print('NO')\r\nelse:\r\n c=0\r\n for i in y:\r\n if i in ['a','e','i','o','u']:\r\n c+=1\r\n if c!=7:\r\n print('NO')\r\n else:\r\n c=0\r\n for i in z:\r\n if i in ['a','e','i','o','u']:\r\n c+=1\r\n #print(c)\r\n if c!=5:\r\n print('NO')\r\n else:\r\n print('YES')\r\n \r\n", "g1 = input()\r\ng2 = input()\r\ng3 = input()\r\nif g1.count(\"a\") + g1.count(\"e\") + g1.count(\"i\") + g1.count(\"o\") + g1.count(\"u\") == 5 and \\\r\n g2.count(\"a\") + g2.count(\"e\") + g2.count(\"i\") + g2.count(\"o\") + g2.count(\"u\") == 7 and \\\r\n g3.count(\"a\") + g3.count(\"e\") + g3.count(\"i\") + g3.count(\"o\") + g3.count(\"u\") == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "v=\"aeiou\"\r\ns1=input()\r\ns2=input()\r\ns3=input()\r\nsyl1=sum(i in v for i in s1)\r\nsyl2=sum(i in v for i in s2)\r\nsyl3=sum(i in v for i in s3)\r\nif syl1==5 and syl2==7 and syl3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\n\r\ns1 = str(input())\r\ns2 = str(input())\r\ns3 = str(input())\r\nr1 = 0\r\nr2 = 0\r\nr3 = 0\r\n\r\nfor i in s1:\r\n if i == \"u\" or i == \"i\" or i == \"a\" or i == \"e\" or i == \"o\":\r\n r1 += 1\r\n\r\nif r1 != 5:\r\n print(\"NO\")\r\n sys.exit()\r\n\r\nfor i in s2:\r\n if i == \"u\" or i == \"i\" or i == \"a\" or i == \"e\" or i == \"o\":\r\n r2 += 1\r\n\r\nif r2 != 7:\r\n print(\"NO\")\r\n sys.exit()\r\n\r\nfor i in s3:\r\n if i == \"u\" or i == \"i\" or i == \"a\" or i == \"e\" or i == \"o\":\r\n r3 += 1\r\n\r\nif r3 != 5:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a=str(input())\r\nb=str(input())\r\nc=str(input())\r\n#print(len(a),len(b),len(c))\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor j in a:\r\n if j==\"a\" or j==\"e\" or j==\"i\" or j==\"o\" or j==\"u\":\r\n c1=c1+1\r\n# print(c1) \r\nfor j in b:\r\n if j==\"a\" or j==\"e\" or j==\"i\" or j==\"o\" or j==\"u\":\r\n c2=c2+1\r\n# print(c2) \r\nfor j in c:\r\n if j==\"a\" or j==\"e\" or j==\"i\" or j==\"o\" or j==\"u\":\r\n c3=c3+1\r\n# print(c3) \r\nif(c1==5 and c2==7 and c3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "vowel = ['a', 'e', 'i', 'o', 'u']\r\nlength = [5, 7, 5]\r\n\r\nfor _ in range(3):\r\n line = input()\r\n \r\n cnt = 0\r\n for char in line:\r\n if char in vowel:\r\n cnt += 1\r\n\r\n if cnt != length[_]:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")\r\n", "s = []\r\nfor i in range(3):\r\n tmp = (input())\r\n s.append(tmp)\r\n\r\ncount = []\r\nfor i in s:\r\n tmp_count = i.count('a')\r\n tmp_count += i.count('e')\r\n tmp_count += i.count('o')\r\n tmp_count += i.count('i')\r\n tmp_count += i.count('u')\r\n\r\n count.append(tmp_count)\r\nif count == [5, 7, 5]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "Line1=input()\r\nLine2=input()\r\nLine3=input()\r\n\r\nVowels1=0\r\nVowels2=0\r\nVowels3=0\r\n\r\nfor letter in Line1:\r\n if(letter in 'aieou'):\r\n Vowels1+=1\r\nfor letter in Line2:\r\n if(letter in 'aieou'):\r\n Vowels2+=1\r\nfor letter in Line3:\r\n if(letter in 'aieou'):\r\n Vowels3+=1\r\n\r\nif(Vowels1==5 and Vowels2==7 and Vowels3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\nv=\"aeiou\"\r\nc=p=k=0\r\nfor i in s1:\r\n if i in v:\r\n c+=1\r\nfor i in s2:\r\n if i in v:\r\n p+=1\r\nfor i in s3:\r\n if i in v:\r\n k+=1\r\nif c==5 and p==7 and k==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_haiku(l1, l2, l3):\r\n vowel = ['a', 'e', 'i', 'o', 'u']\r\n lines = [l1, l2, l3]\r\n vowel_count = [0, 0, 0]\r\n\r\n for index in range(len(lines)):\r\n for char in lines[index]:\r\n if char in vowel:\r\n vowel_count[index] += 1\r\n \r\n return vowel_count == [5, 7, 5]\r\n\r\nprint(\"YES\" if is_haiku(input(), input(), input()) else \"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\n \r\nsum = s1.count('a') + s1.count('e') + s1.count('i') + s1.count('o') + s1.count('u')\r\nsum2 = s2.count('a') + s2.count('e') + s2.count('i') + s2.count('o') + s2.count('u')\r\nsum3 = s3.count('a') + s3.count('e') + s3.count('i') + s3.count('o') + s3.count('u')\r\n \r\nif sum == 5 and sum2 == 7 and sum3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Codeforces A. Haiku\r\n# Created by Abdulrahman Elsayed on 13/01/2021\r\n\r\nl1 = input()\r\nl2 = input()\r\nl3 = input()\r\nw1 = 0\r\nw2 = 0\r\nw3 = 0\r\n\r\nfor c in l1:\r\n if ((c == 'a') or (c == 'e') or (c == 'i') or (c == 'o') or (c == 'u')):\r\n w1 += 1\r\nfor c in l2:\r\n if ((c == 'a') or (c == 'e') or (c == 'i') or (c == 'o') or (c == 'u')):\r\n w2 += 1\r\nfor c in l3:\r\n if ((c == 'a') or (c == 'e') or (c == 'i') or (c == 'o') or (c == 'u')):\r\n w3 += 1 \r\n\r\nif ((w1 == 5) and (w2 == 7) and (w3 == 5)):\r\n print('YES')\r\nelse:\r\n print('NO')", "s1=input()\r\ns2=input()\r\ns3=input()\r\ns1=s1.strip()\r\ns2=s2.strip()\r\ns3=s3.strip()\r\nsyllables = set(\"AEIOUaeiou\")\r\n##print(s1)\r\n##print(s2)\r\n##print(s3)\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor i in s1:\r\n if(i in syllables):\r\n c1+=1\r\n\r\nfor i in s2:\r\n if(i in syllables):\r\n c2+=1\r\n\r\nfor i in s3:\r\n if(i in syllables):\r\n c3+=1\r\n\r\nif(c1==5 and c2==7 and c3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "dem, a, b, c = 0, input(), input(), input()\r\nfor x in a:\r\n if x in ['u', 'e', 'o', 'a', 'i']: dem += 1\r\nif dem != 5: print(\"NO\")\r\nelse:\r\n for x in b:\r\n if x in ['u', 'e', 'o', 'a', 'i']: dem += 1\r\n if dem != 12: print(\"NO\")\r\n else:\r\n for x in c:\r\n if x in ['u', 'e', 'o', 'a', 'i']: dem += 1\r\n if dem != 17: print(\"NO\")\r\n else: print(\"YES\")", "#!/usr/bin/python3\r\n\r\nis_haiku = True\r\n\r\nfor x in range(0, 3):\r\n phrase = input()\r\n phrase = phrase.strip()\r\n \r\n # count the number of vowels in the phrase\r\n vowel_cnt = phrase.count('a') + phrase.count('e') + phrase.count('i') + phrase.count('o') + phrase.count('u')\r\n \r\n if (x == 0 and vowel_cnt != 5) or (x == 1 and vowel_cnt != 7) or (x == 2 and vowel_cnt != 5):\r\n is_haiku = False\r\n break\r\n\r\nif is_haiku:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "def ishaiku(s1,s2,s3):\n\tcnt_s1=0\n\tcnt_s2=0\n\tcnt_s3=0\n\n\tfor i in s1:\n\t\tif(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n\t\t\tcnt_s1+=1\n\tfor i in s2:\n\t\tif(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n\t\t\tcnt_s2+=1\n\tfor i in s3:\n\t\tif(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n\t\t\tcnt_s3+=1\n\n\tif(cnt_s1==5 and cnt_s2==7 and cnt_s3==5):\n\t\treturn True \n\treturn False \n\n\ndef main():\n\ts1=str(input()).replace(\" \",\"\")\n\ts2=str(input()).replace(\" \",\"\")\n\ts3=str(input()).replace(\" \",\"\")\n\n\tif(ishaiku(s1,s2,s3)):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\nif __name__=='__main__':\n\tmain()\n", "def main():\r\n ans=''\r\n for i in range(3):\r\n s=input()\r\n count=0\r\n if(i==0 or i==2):\r\n for j in range(len(s)):\r\n if (s[j]=='a' or s[j]=='e' or s[j]=='i' or s[j]=='o' or s[j]=='u'):\r\n count+=1\r\n\r\n if count!=5: \r\n ans='NO'\r\n else:\r\n for j in range(len(s)):\r\n if (s[j]=='a' or s[j]=='e' or s[j]=='i' or s[j]=='o' or s[j]=='u'):\r\n count+=1\r\n\r\n if count!=7:\r\n ans='NO'\r\n\r\n print('NO') if ans==\"NO\" else print('YES')\r\n\r\n \r\nmain()", "x=0\r\nfor i in range(3):\r\n s=input()\r\n c=0\r\n if i==0 or i==2:\r\n for i in s:\r\n if i in 'aeiou':\r\n c+=1\r\n if c!=5:\r\n x+=1\r\n else:\r\n for i in s:\r\n if i in 'aeiou':\r\n c+=1\r\n if c!=7:\r\n x+=1 \r\nif not x:\r\n print(\"YES\")\r\nelse:print(\"NO\")", "import re\r\npattern = re.compile('[a,e,i,o,u]')\r\na = len(pattern.findall(str(input())))\r\nb = len(pattern.findall(str(input())))\r\nc = len(pattern.findall(str(input())))\r\nprint('YES' if a == 5 and b == 7 and c == 5 else 'NO')", "v = set('aeiou')\r\narr = [5,7,5]\r\nfor i in range(3):\r\n\ts = input()\r\n\ttemp = 0\r\n\tfor letter in s:\r\n\t\tif letter in v:\r\n\t\t\ttemp+=1\r\n\tif temp != arr[i]:\r\n\t\tprint('NO')\r\n\t\texit()\r\nprint('YES')\r\n\r\n", "#https://codeforces.com/problemset/problem/78/A\nv='aeiou'\nf=1\nfor i in range(3):\n\tc=0\n\tfor j in input():\n\t\tif j in v:\n\t\t\tc+=1\n\tif i&1 and c!=7:\n\t\tf=0\n\tif (not i&1) and c!=5:\n\t\tf=0\nif f:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "vs=set('a e i o u'.split())\r\n\r\ndef cov(s):\r\n\t\"\"\"count of vowels\"\"\"\r\n\tr=0\r\n\tfor c in s:\r\n\t\tif c in vs or c.lower() in vs:\r\n\t\t\tr+=1\r\n\treturn r\r\n\r\ndef ih(v):\r\n\t\"\"\"is haiku\"\"\"\r\n\tnv=[5,7,5]\r\n\tfor c in range(len(v)):\r\n\t\tif cov(v[c])!=nv[c]:\r\n\t\t\treturn 0\r\n\treturn 1\r\n\r\nv=[]\r\nfor c in range(3):\r\n\tv.append(input())\r\ns='YES' if ih(v) else 'NO'\r\nprint(s)", "s=input()\r\ns1=input()\r\ns2=input()\r\nsum1=sum2=sum3=0\r\nlst=['a','e','i','o','u']\r\nfor i in lst:\r\n sum1+=s.count(i)\r\n sum2+=s1.count(i)\r\n sum3+=s2.count(i)\r\nif sum1==5 and sum2==7 and sum3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nfor i in range(1,4):\r\n s=input()\r\n sum=s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')\r\n if((i==2 and sum!=7)or(i!=2 and sum!=5)):\r\n exit(print('NO'))\r\nprint('YES')\r\n\r\n", "str1 = input()\r\nstr2 = input()\r\nstr3 = input()\r\ncnt1, cnt2, cnt3 = 0, 0, 0\r\nfor i in str1:\r\n if i in 'aeiou':\r\n cnt1 += 1\r\nfor i in str2:\r\n if i in 'aeiou':\r\n cnt2 += 1\r\nfor i in str3:\r\n if i in 'aeiou':\r\n cnt3 += 1\r\nif cnt1==5 and cnt2==7 and cnt3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "for i in range(3):\r\n if (sum(j in set('aeiou') for j in input())!=-abs(i-1)2+7):\r\n print('NO')\r\n exit(0)\r\nprint('YES')\r\n", "# https://codeforces.com/contest/78/problem/A\r\n\r\n\r\ndef single_integer():\r\n return int(input())\r\n\r\n\r\ndef multi_integer():\r\n return map(int, input().split())\r\n\r\n\r\ndef string():\r\n return input()\r\n\r\n\r\ndef multi_string():\r\n return input().split()\r\n\r\n\r\nvowels = {\"a\", \"e\", \"i\", \"o\", \"u\"}\r\nanswers = (5, 7, 5)\r\nfor j in answers:\r\n temp = 0\r\n s = input()\r\n for i in s:\r\n if i in vowels:\r\n temp += 1\r\n\r\n if temp != j :\r\n print(\"NO\")\r\n break\r\n\r\nelse:\r\n print(\"YES\")\r\n", "def checkVowel(str1):\n\tcnt=0\n\tfor i in str1:\n\t\tif (i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n\t\t\tcnt+=1\n\treturn cnt \n\n\ndef checkHaiku(str1:str,str2:str,str3:str)->bool:\n\tv1=checkVowel(str1)\n\tv2=checkVowel(str2)\n\tv3=checkVowel(str3)\n\n\tif(v1==5 and v2==7 and v3==5):\n\t\treturn True \n\telse:\n\t\treturn False \n\n\ndef main():\n\tstr1=str(input())\n\tstr2=str(input())\n\tstr3=str(input())\n\n\tif(checkHaiku(str1,str2,str3)==True):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\nif __name__=='__main__':\n\tmain()", "def syllable(s,n):\r\n c=0\r\n for x in s:\r\n if x=='a' or x=='e' or x=='i' or x=='o' or x=='u':c+=1\r\n return True if c==n else False\r\ns1,s2,s3=input().strip(),input().strip(),input().strip()\r\nprint('YES' if syllable(s1,5) and syllable(s2,7) and syllable(s3,5) else 'NO')", "def answer():\r\n vowels=\"aeiou\"\r\n\r\n l1=len([x for x in list(input()) if x in vowels])\r\n l2=len([x for x in list(input()) if x in vowels])\r\n l3=len([x for x in list(input()) if x in vowels])\r\n\r\n if l1==5 and l2==7 and l3==5: print(\"YES\")\r\n else: print(\"NO\")\r\nanswer()", "def vowels(s):\r\n ans = 0\r\n for ch in s:\r\n if ch in \"aeiou\":\r\n ans += 1\r\n return ans\r\nx, y, z = (input() for _ in range(3))\r\nif vowels(x) == 5 and vowels(y) == 7 and vowels(z) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "line1 = list(map(str,input().strip()))\nline2 = list(map(str,input().strip()))\nline3 = list(map(str,input().strip()))\n#print(line1)\nsum1 = 0\nfor i in line1:\n if i == \"a\" or i == \"e\"or i == \"i\"or i == \"o\" or i ==\"u\":\n sum1 = sum1 + 1\n\n\nsum2 = 0\n\nfor i in line2:\n if i == \"a\" or i == \"e\"or i == \"i\"or i == \"o\" or i ==\"u\":\n sum2 = sum2 + 1\n\n\n\nsum3 = 0\n\nfor i in line3:\n if i == \"a\" or i == \"e\"or i == \"i\"or i == \"o\" or i ==\"u\":\n sum3 = sum3 + 1\n\nif sum1 != 5 or sum3 != 5 or sum2 != 7:\n print(\"NO\")\nelse:\n print(\"YES\")\n\t\t \t\t \t \t\t \t \t\t \t", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\na = s1.count(\"a\") + s1.count(\"o\") + s1.count(\"e\") + s1.count(\"i\") + s1.count(\"u\") \r\nb = s2.count(\"a\") + s2.count(\"o\") + s2.count(\"e\") + s2.count(\"i\") + s2.count(\"u\")\r\nc = s3.count(\"a\") + s3.count(\"o\") + s3.count(\"e\") + s3.count(\"i\") + s3.count(\"u\")\r\nprint (\"YES\" if a == 5 and b == 7 and c == 5 else \"NO\")", "a= input()\r\nb= input()\r\nc= input()\r\nd=['a','e','i','o','u']\r\np=0\r\nq=0\r\nr=0\r\nfor i in range(len(a)):\r\n if(a[i] in d):\r\n p=p+1\r\nfor i in range(len(b)):\r\n if(b[i] in d):\r\n q+=1\r\nfor i in range(len(c)):\r\n if(c[i] in d):\r\n r+=1\r\nif(p==5 and q==7 and r==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l = [input().strip() for i in range(3)]\n\nk = [0]3\nfor i in range(len(l)):\n\tfor j in l[i]:\n\t\tif j in 'aeiou':\n\t\t\tk[i] += 1\nif k == [5, 7, 5]:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "phaseOne = list(input().replace(\" \", \"\"))\r\nphaseTwo = list(input().replace(\" \", \"\"))\r\nphaseThree = list(input().replace(\" \", \"\"))\r\nsyllOne = 0\r\nsyllTwo = 0\r\nsyllThree = 0\r\nok = True\r\nvowels = ['a', 'e', 'i', 'o', 'u']\r\nfor i in range(len(phaseOne)):\r\n tempChr = phaseOne[i]\r\n if(tempChr in vowels):\r\n syllOne += 1\r\nif(syllOne == 5):\r\n for j in range(len(phaseTwo)):\r\n tempChr = phaseTwo[j]\r\n if(tempChr in vowels):\r\n syllTwo += 1\r\n if(syllTwo == 7):\r\n for z in range(len(phaseThree)):\r\n tempChr = phaseThree[z]\r\n if(tempChr in vowels):\r\n syllThree += 1\r\n if(syllThree != 5):\r\n ok = False\r\n else:\r\n ok = False \r\nelse:\r\n ok = False \r\nprint(\"YES\" if ok else \"NO\")", "def fun(x):\r\n\tn = 0\r\n\tfor i in x:\r\n\t\tif i in ('a', 'e', 'i', 'o', 'u'):\r\n\t\t\tn += 1\r\n\t\t\t\r\n\treturn(n)\r\n\r\na, b, c = input(), input(), input()\r\n\r\nif fun(a) == 5 and fun(b) == 7 and fun(c) == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "vowels = \"aeiouAEIOU\"\r\n\r\nl1 = input().strip()\r\nl2 = input().strip()\r\nl3 = input().strip()\r\n\r\nc1, c2, c3 = 0, 0, 0\r\nfor i in l1:\r\n if i in vowels:\r\n c1 += 1\r\n \r\nfor i in l2:\r\n if i in vowels:\r\n c2 += 1\r\n \r\nfor i in l3:\r\n if i in vowels:\r\n c3 += 1\r\n#print(c1, c2, c3)\r\nif c1 == 5 and c2 == 7 and c3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "cases = 3\r\n\r\nvows = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\n\r\nans = []\r\ntarget = [5, 7, 5]\r\nwhile cases:\r\n cases -= 1\r\n ct = 0\r\n s = input()\r\n\r\n for char in s:\r\n if char in vows:\r\n ct += 1\r\n ans.append(ct)\r\n\r\nif ans == target:\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", "s1= input()\r\ns2= input()\r\ns3= input()\r\nvow= ['a','e','i','o','u']\r\nc1,c2,c3=0,0,0\r\nfor i in range(len(s1)):\r\n if (s1[i] in vow):\r\n c1+=1\r\nfor i in range(len(s2)):\r\n if (s2[i] in vow):\r\n c2+=1\r\nfor i in range(len(s3)):\r\n if (s3[i] in vow):\r\n c3+=1\r\nif (c1==c3==5 and c2==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\ns='aeiou'\r\nq=' '\r\nw=' '\r\ne=' '\r\nfor i in a:\r\n if i in s:\r\n q+=i\r\nfor j in b:\r\n if j in s:\r\n w+=j\r\nfor h in c:\r\n if h in s:\r\n e+=h\r\nif len(q)==5+1 and len(w)==7+1 and len(e)==5+1:\r\n print('YES')\r\nelse:\r\n print('NO')", "vowels = \"aeiou\"\r\n\r\nanswer = True\r\n\r\ndef good(line, n):\r\n count = 0\r\n for i in range(len(line)):\r\n if line[i] in vowels:\r\n count += 1\r\n if count == n:\r\n return True\r\n else:\r\n return False\r\nfor i in range(3):\r\n line = input()\r\n if i % 2 == 0:\r\n if good(line, 5) == True:\r\n continue\r\n else:\r\n answer = False\r\n break\r\n else:\r\n if good(line, 7) == True:\r\n continue\r\n else:\r\n answer = False\r\n break\r\nif answer:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t = [\"a\",\"e\",\"i\",\"o\",\"u\"]\r\na = input()\r\nb = input()\r\nc = input()\r\nx = 0\r\ny = 0\r\nz = 0\r\nfor i in t:\r\n x += a.count(i)\r\n y += b.count(i)\r\n z += c.count(i)\r\n\r\nif( x == 5 and y == 7 and z == 5 ):\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "# cook your dish here\r\ns1=input()\r\ns2=input()\r\ns3=input()\r\ntmp=['a','e','i','o','u']\r\nl1=len(s1)\r\nl2=len(s2)\r\nl3=len(s3)\r\nc1=c2=c3=0\r\nfor i in range(l1):\r\n if s1[i] in tmp:\r\n c1=c1+1\r\nfor i in range(l2):\r\n if s2[i] in tmp:\r\n c2=c2+1\r\nfor i in range(l3):\r\n if s3[i] in tmp:\r\n c3=c3+1\r\n#print(c1,c2,c3)\r\nif c1==5 and c2==7 and c3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1=input()\r\ns2=input()\r\ns3=input()\r\np1,p2,p3=0,0,0\r\nfor i in s1:\r\n if i==\"a\" or i==\"e\" or i==\"i\" or i==\"o\" or i==\"u\":\r\n p1=p1+1\r\nfor i in s2:\r\n if i==\"a\" or i==\"e\" or i==\"i\" or i==\"o\" or i==\"u\":\r\n p2=p2+1\r\nfor i in s3:\r\n if i==\"a\" or i==\"e\" or i==\"i\" or i==\"o\" or i==\"u\":\r\n p3=p3+1\r\nif p1==5 and p2==7 and p3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "res=\"YES\"\r\na=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nfor i in range(3):\r\n count=0\r\n n=input().strip()\r\n for j in range(len(n)):\r\n if n[j] in a:\r\n count+=1\r\n if i==0 and count!=5:\r\n res=\"NO\"\r\n \r\n if i==1 and count!=7:\r\n res=\"NO\"\r\n \r\n if i==2 and count!=5:\r\n res=\"NO\"\r\n \r\nprint(res)", "def main():\r\n\tvowel = ['a', 'i', 'u', 'e', 'o']\r\n\r\n\ts1 = str(input())\r\n\ts2 = str(input())\r\n\ts3 = str(input())\r\n\r\n\tn1 = 0\r\n\tn2 = 0\r\n\tn3 = 0\r\n\r\n\tfor el in s1:\r\n\t\tif el in vowel:\r\n\t\t\tn1 += 1\r\n\tfor el in s2:\r\n\t\tif el in vowel:\r\n\t\t\tn2 += 1\r\n\tfor el in s3:\r\n\t\tif el in vowel:\r\n\t\t\tn3 += 1\r\n\r\n\tif n1 == 5 and n2 == 7 and n3 == 5:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "l=input()\r\nl2=input()\r\nl3=input()\r\ncount=0\r\ncount2=0\r\ncount3=0\r\n# print(l2[1])\r\nfor i in range(len(l)):\r\n\tif l[i]=='a' or l[i]==\"e\" or l[i]==\"i\" or l[i]==\"o\" or l[i]==\"u\":\r\n\t\tcount+=1\r\nfor i in range(len(l2)):\r\n\tif l2[i]==\"a\" or l2[i]==\"e\" or l2[i]==\"i\" or l2[i]==\"o\" or l2[i]==\"u\":\r\n\t\tcount2+=1\r\nfor i in range(len(l3)):\r\n\tif l3[i]==\"a\" or l3[i]==\"e\" or l3[i]==\"i\" or l3[i]==\"o\" or l3[i]==\"u\":\r\n\t\tcount3+=1\r\nif count==5 and count2==7 and count3==5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "from collections import Counter\r\nans = 'YES'\r\nq = [5, 7, 5]\r\nfor i in range(3):\r\n n = input()\r\n p = Counter(n)\r\n if (p['a'] + p['e'] + p['i'] + p['o'] + p['u']) != q[i]:\r\n ans = 'NO'\r\n break\r\nprint(ans)", "l1=input()\r\nl2=input()\r\nl3=input()\r\nc1=c2=c3=0\r\nl=['a','e','i','o','u']\r\nfor i in l1:\r\n if i in l:\r\n c1=c1+1\r\nif c1==5:\r\n for j in l2:\r\n if j in l:\r\n c2=c2+1\r\n if c2==7:\r\n for k in l3:\r\n if k in l:\r\n c3=c3+1\r\n if c3==5:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "ok = True\r\nfor i in range(3):\r\n s = input()\r\n ok &= len(list(filter(lambda x: x in \"aiueo\", s))) == 5 + (i % 2) * 2\r\nprint([\"NO\", \"YES\"][ok])", "import re\nregex = re.compile(r\"[a\|e\|i\|o\|u]\")\n\nfirst_line = len(regex.findall(input()))\nsecond_line = len(regex.findall(input()))\nthird_line = len(regex.findall(input()))\n\n# print(first_line, second_line, third_line)\n\nif (first_line == 5 and second_line == 7 and third_line == 5):\n print('YES')\nelse:\n print('NO')\n", "first = input()\r\nsecond = input()\r\nthird = input()\r\nvowel = \"aeiou\"\r\ncount1 = 0\r\ncount2 = 0\r\ncount3 = 0\r\nfor c in first :\r\n if c in vowel :\r\n count1 += 1\r\nfor c in second :\r\n if c in vowel :\r\n count2 += 1\r\nfor c in third :\r\n if c in vowel :\r\n count3 += 1\r\n \r\nif count1==5 and count2==7 and count3==5 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\n\r\na_c=0\r\nb_c=0\r\nc_c=0\r\n\r\nfor i in range(len(a)):\r\n if a[i] in \"aeiou\":\r\n a_c+=1\r\n\r\nfor i in range(len(b)):\r\n if b[i] in \"aeiou\":\r\n b_c+=1\r\n\r\nfor i in range(len(c)):\r\n if c[i] in \"aeiou\":\r\n c_c+=1\r\n\r\nif(a_c==5 and b_c==7 and c_c==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nfor _ in range(3):\r\n a=input()\r\n w=[5,7,5]\r\n l=['a','e','i','o','u']\r\n p=0\r\n for i in a:\r\n if i in l:\r\n p+=1\r\n if p==w[_]:\r\n continue\r\n else:\r\n print('NO')\r\n sys.exit()\r\nprint('YES')", "a=input().strip()\r\nb=input().strip()\r\nc=input().strip()\r\no=p=q=0\r\nfor i in a:\r\n\tif i in ['a','e','i','o','u']:\r\n\t\to+=1\r\nfor i in b:\r\n\tif i in ['a','e','i','o','u']:\r\n\t\tp+=1\r\nfor i in c:\r\n\tif i in ['a','e','i','o','u']:\r\n\t\tq+=1\r\nif o==5 & p==7 &q==5:\r\n\tprint('YES')\r\nelse:print('NO')", "def count_syllables(phrase):\r\n vowels = \"aeiou\"\r\n count = 0\r\n for letter in phrase:\r\n if letter in vowels:\r\n count += 1\r\n return count\r\n\r\n# Read three input lines\r\nphrases = [input().strip() for _ in range(3)]\r\n\r\n# Count syllables in each phrase\r\nsyllable_counts = [count_syllables(phrase) for phrase in phrases]\r\n\r\n# Check if it's a haiku (5-7-5 pattern)\r\nif syllable_counts == [5, 7, 5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "try:\r\n a = input()\r\n b = input()\r\n c = input()\r\n x = a.count(\"a\") + a.count(\"u\") + a.count(\"o\") + a.count(\"i\") + a.count(\"e\")\r\n y = b.count(\"a\") + b.count(\"u\") + b.count(\"o\") + b.count(\"i\") + b.count(\"e\")\r\n z = c.count(\"a\") + c.count(\"u\") + c.count(\"o\") + c.count(\"i\") + c.count(\"e\")\r\n if x == 5 and y == 7 and z == 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nexcept:\r\n pass", "def count_vowels(s):\r\n return sum(c in set('aeoui') for c in s)\r\n\r\ncounts = [count_vowels(input()) for _ in range(3)]\r\n\r\nprint(('NO', 'YES')[counts == [5, 7, 5]])\r\n" ]	{"inputs": ["on codeforces \nbeta round is running\n a rustling of keys ", "how many gallons\nof edo s rain did you drink\n cuckoo", " hatsu shigure\n saru mo komino wo\nhoshige nari", "o vetus stagnum\n rana de ripa salit\n ac sonant aquae", " furuike ya\nkawazu tobikomu\nmizu no oto ", " noch da leich\na stamperl zum aufwaerma\n da pfarrer kimmt a ", " sommerfuglene \n hvorfor bruge mange ord\n et kan gore det", " ab der mittagszeit\n ist es etwas schattiger\n ein wolkenhimmel", "tornando a vederli\ni fiori di ciliegio la sera\nson divenuti frutti", "kutaburete\nyado karu koro ya\nfuji no hana", " beginnings of poetry\n the rice planting songs \n of the interior", " door zomerregens\n zijn de kraanvogelpoten\n korter geworden", " derevo na srub\na ptitsi bezzabotno\n gnezdishko tam vyut", "writing in the dark\nunaware that my pen\nhas run out of ink", "kusaaiu\nuieueua\nuo efaa", "v\nh\np", "i\ni\nu", "awmio eoj\nabdoolceegood\nwaadeuoy", "xzpnhhnqsjpxdboqojixmofawhdjcfbscq\nfoparnxnbzbveycoltwdrfbwwsuobyoz hfbrszy\nimtqryscsahrxpic agfjh wvpmczjjdrnwj mcggxcdo", "wxjcvccp cppwsjpzbd dhizbcnnllckybrnfyamhgkvkjtxxfzzzuyczmhedhztugpbgpvgh\nmdewztdoycbpxtp bsiw hknggnggykdkrlihvsaykzfiiw\ndewdztnngpsnn lfwfbvnwwmxoojknygqb hfe ibsrxsxr", "nbmtgyyfuxdvrhuhuhpcfywzrbclp znvxw synxmzymyxcntmhrjriqgdjh xkjckydbzjbvtjurnf\nhhnhxdknvamywhsrkprofnyzlcgtdyzzjdsfxyddvilnzjziz qmwfdvzckgcbrrxplxnxf mpxwxyrpesnewjrx ajxlfj\nvcczq hddzd cvefmhxwxxyqcwkr fdsndckmesqeq zyjbwbnbyhybd cta nsxzidl jpcvtzkldwd", "rvwdsgdsrutgjwscxz pkd qtpmfbqsmctuevxdj kjzknzghdvxzlaljcntg jxhvzn yciktbsbyscfypx x xhkxnfpdp\nwdfhvqgxbcts mnrwbr iqttsvigwdgvlxwhsmnyxnttedonxcfrtmdjjmacvqtkbmsnwwvvrlxwvtggeowtgsqld qj\nvsxcdhbzktrxbywpdvstr meykarwtkbm pkkbhvwvelclfmpngzxdmblhcvf qmabmweldplmczgbqgzbqnhvcdpnpjtch ", "brydyfsmtzzkpdsqvvztmprhqzbzqvgsblnz naait tdtiprjsttwusdykndwcccxfmzmrmfmzjywkpgbfnjpypgcbcfpsyfj k\nucwdfkfyxxxht lxvnovqnnsqutjsyagrplb jhvtwdptrwcqrovncdvqljjlrpxcfbxqgsfylbgmcjpvpl ccbcybmigpmjrxpu\nfgwtpcjeywgnxgbttgx htntpbk tkkpwbgxwtbxvcpkqbzetjdkcwad tftnjdxxjdvbpfibvxuglvx llyhgjvggtw jtjyphs", "nyc aqgqzjjlj mswgmjfcxlqdscheskchlzljlsbhyn iobxymwzykrsnljj\nnnebeaoiraga\nqpjximoqzswhyyszhzzrhfwhf iyxysdtcpmikkwpugwlxlhqfkn", "lzrkztgfe mlcnq ay ydmdzxh cdgcghxnkdgmgfzgahdjjmqkpdbskreswpnblnrc fmkwziiqrbskp\np oukeaz gvvy kghtrjlczyl qeqhgfgfej\nwfolhkmktvsjnrpzfxcxzqmfidtlzmuhxac wsncjgmkckrywvxmnjdpjpfydhk qlmdwphcvyngansqhl", "yxcboqmpwoevrdhvpxfzqmammak\njmhphkxppkqkszhqqtkvflarsxzla pbxlnnnafqbsnmznfj qmhoktgzix qpmrgzxqvmjxhskkksrtryehfnmrt dtzcvnvwp\nscwymuecjxhw rdgsffqywwhjpjbfcvcrnisfqllnbplpadfklayjguyvtrzhwblftclfmsr", "qfdwsr jsbrpfmn znplcx nhlselflytndzmgxqpgwhpi ghvbbxrkjdirfghcybhkkqdzmyacvrrcgsneyjlgzfvdmxyjmph\nylxlyrzs drbktzsniwcbahjkgohcghoaczsmtzhuwdryjwdijmxkmbmxv yyfrokdnsx\nyw xtwyzqlfxwxghugoyscqlx pljtz aldfskvxlsxqgbihzndhxkswkxqpwnfcxzfyvncstfpqf", "g rguhqhcrzmuqthtmwzhfyhpmqzzosa\nmhjimzvchkhejh irvzejhtjgaujkqfxhpdqjnxr dvqallgssktqvsxi\npcwbliftjcvuzrsqiswohi", " ngxtlq iehiise vgffqcpnmsoqzyseuqqtggokymol zn\nvjdjljazeujwoubkcvtsbepooxqzrueaauokhepiquuopfild\ngoabauauaeotoieufueeknudiilupouaiaexcoapapu", "ycnvnnqk mhrmhctpkfbc qbyvtjznmndqjzgbcxmvrpkfcll zwspfptmbxgrdv dsgkk nfytsqjrnfbhh pzdldzymvkdxxwh\nvnhjfwgdnyjptsmblyxmpzylsbjlmtkkwjcbqwjctqvrlqqkdsrktxlnslspvnn mdgsmzblhbnvpczmqkcffwhwljqkzmk hxcm\nrghnjvzcpprrgmtgytpkzyc mrdnnhpkwypwqbtzjyfwvrdwyjltbzxtbstzs xdjzdmx yjsqtzlrnvyssvglsdjrmsrfrcdpqt", "ioeeaioeiuoeaeieuuieooaouiuouiioaueeaiaiuoaoiioeeaauooiuuieeuaeeoauieeaiuoieiaieuoauaaoioooieueueuai\nuooaoeeaoiuuoeioaoouaououoeioiaeueoioaiouaeaoioiuuaueeuaiuoiueoiuaoeeieeouaeeaeeieioeoiiieuuueuuieuo\naeeouieeieoueaioeoioooiouaeeeiaaioueauaueiouuuaieuuioiaeiueauueaoieauauoeueuaiueuuaueeoueauaeaoieeoo", "mkgycgmrqtmlwj vddlbsgdptyfrcj nmrddjchydvbsyhgzytfzvwbhqmmhkpsyrcnknpsqrr wcnf wfvgskrnsmnrcqgcnc q\npn cclcyjjdp rqkpgyrvyyd hhynrochfa pthyffqvskazfshvzcmvhmsrxvquzkdvivlbfypwbgltfbjmhzljvgzmxjlrjdjq\nauuouieuaaauoooeoiuoaueuueauiuuuiaeuwuoiaeoeaieauieouoaeiiieiioiuuuiuauioiiuoeauueieaueiaioeuaoaaau", "ab\na\na", "on codeforcs\nbeta round is runnineg\na rustling of keys", "coooooooooooooooood\nd\nd", "on codeforces \nbeta round is runninog\n a rustling of keys", "aaaaaaaaaaaaaaa\na\na", "aaaaaccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc\naaaaaaaccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc\naaaaaccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc", "cccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc\ncccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc\ncccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc", "aaaaaa\naaaaaa\naaaaa"], "outputs": ["YES", "NO", "YES", "NO", "YES", "NO", "YES", "NO", "NO", "YES", "NO", "NO", "YES", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO"]}	UNKNOWN	PYTHON3	CODEFORCES	426
9193fd7c419ef9dff9dc9dcd79640cdc	Card Game Again	Vova again tries to play some computer card game. The rules of deck creation in this game are simple. Vova is given an existing deck of n cards and a magic number k. The order of the cards in the deck is fixed. Each card has a number written on it; number ai is written on the i-th card in the deck. After receiving the deck and the magic number, Vova removes x (possibly x<==<=0) cards from the top of the deck, y (possibly y<==<=0) cards from the bottom of the deck, and the rest of the deck is his new deck (Vova has to leave at least one card in the deck after removing cards). So Vova's new deck actually contains cards x<=+<=1, x<=+<=2, ... n<=-<=y<=-<=1, n<=-<=y from the original deck. Vova's new deck is considered valid iff the product of all numbers written on the cards in his new deck is divisible by k. So Vova received a deck (possibly not a valid one) and a number k, and now he wonders, how many ways are there to choose x and y so the deck he will get after removing x cards from the top and y cards from the bottom is valid? The first line contains two integers n and k (1<=≤<=n<=≤<=100<=000, 1<=≤<=k<=≤<=109). The second line contains n integers a1, a2, ..., an (1<=≤<=ai<=≤<=109) — the numbers written on the cards. Print the number of ways to choose x and y so the resulting deck is valid. Sample Input 3 4 6 2 8 3 6 9 1 14 Sample Output 4 1	[ "R,G=lambda:map(int,input().split()),range\r\nn,k=R();a=[0]+[R()];z,l,p=0,1,1\r\nfor r in G(1,n+1):\r\n p=pa[r]%k\r\n if p==0:\r\n p=1;i=r\r\n while pa[i]%k:p=pa[i]%k;i-=1\r\n z+=(n-r+1)(i-l+1);l=i+1\r\nprint(z)", "def gcd(a,b):\r\n if a == 0:\r\n return b\r\n return gcd(b%a,a)\r\n\r\nn,k = [int(x) for x in input().split()]\r\na = [gcd(int(x),k) for x in input().split()]\r\n\r\nif k == 1:\r\n print(((n+1)(n+2))//2-n-1)\r\nelse:\r\n s = 0\r\n e = 0\r\n total = ((n+1)(n+2))//2-1-n\r\n #print(total)\r\n #extra = {}\r\n c = 1\r\n \r\n while e < n:\r\n flag = False\r\n while c%k != 0 and e < n:\r\n total -= e-s\r\n c = a[e]\r\n e += 1\r\n while c%k == 0 and s < e:\r\n c //= a[s]\r\n s += 1\r\n total -= e-s\r\n print(total)\r\n", "import bisect\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef prime_factorize(n):\r\n ans = []\r\n for i in range(2, int(n ** (1 / 2)) + 1):\r\n while True:\r\n if n % i:\r\n break\r\n ans.append(i)\r\n n //= i\r\n if n == 1:\r\n break\r\n if not n == 1:\r\n ans.append(n)\r\n return ans\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = list(set(prime_factorize(k)))\r\nl = len(s)\r\ncnt = []\r\nfor i in s:\r\n cnt0 = [0] * (n + 1)\r\n c = 0\r\n for j in range(n):\r\n aj = a[j]\r\n while not aj % i:\r\n aj //= i\r\n c += 1\r\n cnt0[j + 1] = c\r\n cnt.append(cnt0)\r\nt = []\r\nfor i in s:\r\n c = 0\r\n while not k % i:\r\n k //= i\r\n c += 1\r\n t.append(c)\r\nans = 0\r\nfor i in range(1, n + 1):\r\n m = i\r\n for j in range(l):\r\n m = min(m, bisect.bisect_left(cnt[j], cnt[j][i] - t[j] + 0.5))\r\n ans += m\r\nprint(ans)" ]	{"inputs": ["3 4\n6 2 8", "3 6\n9 1 14", "5 1\n1 3 1 3 1", "5 1\n5 5 5 5 5", "5 1\n5 4 4 4 4", "100 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "100 1\n3 3 2 1 1 2 1 2 3 4 1 5 2 4 5 1 1 3 2 3 4 2 1 3 4 4 5 5 1 5 2 5 3 3 1 1 1 3 2 2 3 4 4 4 4 3 1 3 5 3 3 3 3 2 3 2 2 3 3 1 2 4 3 2 2 5 3 1 5 2 2 5 1 2 1 1 5 1 5 2 4 5 3 4 2 5 4 2 2 5 5 5 3 3 5 3 4 3 3 1", "100 5\n4 4 3 2 4 4 1 2 2 1 5 3 2 5 5 3 2 3 4 5 2 2 3 4 2 4 3 1 2 3 5 5 1 3 3 5 2 3 3 4 1 3 1 5 4 4 2 1 5 1 4 4 1 5 1 1 5 5 5 4 1 3 1 2 3 2 4 5 5 1 3 4 3 3 1 2 2 4 1 5 1 1 2 4 4 4 5 5 5 3 4 3 3 3 3 2 1 1 5 5", "100 6\n4 4 1 1 1 1 3 3 5 5 4 2 2 4 3 4 4 5 5 4 5 1 3 1 5 4 5 1 2 5 5 2 2 4 2 4 4 2 5 5 3 3 1 3 3 5 2 3 1 4 1 4 4 1 5 5 1 2 3 2 3 3 5 3 4 2 3 4 3 1 5 3 5 5 3 5 4 4 3 1 1 2 1 2 1 3 2 4 3 2 1 4 3 1 1 5 1 5 4 3", "100 72\n8 8 7 9 6 1 4 5 3 7 5 10 5 4 1 3 4 1 3 1 6 6 4 5 4 5 6 1 10 7 9 1 6 10 6 6 9 3 3 4 5 9 4 9 8 1 5 9 3 7 1 8 5 2 1 1 7 7 7 6 6 4 2 9 10 2 8 3 1 1 4 8 5 9 7 10 9 4 2 3 7 7 6 7 8 5 1 3 8 5 1 8 9 10 3 7 1 8 10 5", "100 72\n3 2 1 3 3 3 4 3 5 5 2 5 1 2 2 2 1 4 1 5 1 4 5 4 3 1 4 3 4 4 1 4 4 3 4 1 4 4 5 2 2 3 3 5 4 5 4 2 4 3 1 1 1 4 5 5 3 1 5 3 4 4 5 3 5 1 4 3 2 2 1 4 2 1 3 2 4 2 1 4 4 1 3 4 4 4 1 5 5 2 5 2 3 1 5 1 1 1 2 3", "2 999634589\n31607 31627", "1 1\n1", "1 2\n1", "1 3\n1", "1 4\n1", "1 5\n3", "1 6\n4", "1 7\n2", "1 8\n3", "1 9\n5", "1 10\n3", "2 1\n1 1", "2 2\n2 2", "2 3\n1 2", "2 4\n1 2", "2 5\n1 1", "2 6\n2 1", "2 7\n1 4", "2 8\n5 3", "2 9\n2 2", "2 10\n6 1", "3 1\n1 1 1", "3 2\n2 2 1", "3 3\n2 1 2", "3 4\n2 2 2", "3 5\n1 1 2", "3 6\n4 3 2", "3 7\n3 4 1", "3 8\n5 1 4", "3 9\n3 2 1", "3 10\n6 5 5", "4 1\n1 1 1 1", "4 2\n2 2 1 2", "4 3\n2 1 1 1", "4 4\n2 2 1 1", "4 5\n2 3 2 1", "4 6\n1 1 3 3", "4 7\n1 1 2 2", "4 8\n5 4 5 5", "4 9\n1 1 4 2", "4 10\n2 6 2 1", "5 1\n1 1 1 1 1", "5 2\n2 2 1 2 1", "5 3\n2 1 1 2 1", "5 4\n2 2 1 3 1", "5 5\n2 3 1 1 3", "5 6\n3 4 3 4 3", "5 7\n3 1 3 2 4", "5 8\n2 2 3 3 1", "5 9\n3 1 3 3 4", "5 10\n3 6 6 1 5", "6 1\n1 1 1 1 1 1", "6 2\n1 2 2 1 1 1", "6 3\n2 2 2 2 1 2", "6 4\n1 3 3 3 3 2", "6 5\n2 3 3 2 1 2", "6 6\n1 2 4 1 4 4", "6 7\n2 2 4 3 2 1", "6 8\n3 2 3 5 5 3", "6 9\n1 4 1 2 1 1", "6 10\n1 2 5 6 6 6", "7 1\n1 1 1 1 1 1 1", "7 2\n1 1 2 2 2 2 1", "7 3\n2 2 1 1 2 2 2", "7 4\n3 2 1 2 1 1 1", "7 5\n2 3 3 3 2 3 2", "7 6\n3 4 4 1 4 3 2", "7 7\n4 2 4 4 1 4 4", "7 8\n4 4 2 4 2 5 3", "7 9\n2 1 3 4 4 5 4", "7 10\n6 3 3 5 3 6 1", "8 1\n1 1 1 1 1 1 1 1", "8 2\n1 1 1 1 1 1 1 2", "8 3\n1 1 2 2 1 1 2 2", "8 4\n2 3 2 3 3 3 2 3", "8 5\n1 3 1 2 2 2 1 3", "8 6\n4 2 4 2 1 2 1 4", "8 7\n2 2 1 4 4 4 2 2", "8 8\n5 2 1 2 4 2 2 4", "8 9\n4 4 2 2 5 5 4 1", "8 10\n2 1 4 4 3 4 4 6", "9 1\n1 1 1 1 1 1 1 1 1", "9 2\n1 1 1 2 1 1 2 2 2", "9 3\n1 1 1 2 2 1 1 2 1", "9 4\n1 1 2 1 2 1 1 1 1", "9 5\n3 2 3 2 3 1 1 3 2", "9 6\n2 1 1 3 2 4 1 2 2", "9 7\n4 3 2 1 2 3 3 4 4", "9 8\n5 5 2 1 3 1 3 1 3", "9 9\n2 4 1 4 4 3 3 4 1", "9 10\n4 3 2 5 2 2 2 2 6", "10 1\n1 1 1 1 1 1 1 1 1 1", "10 2\n2 2 2 2 2 2 2 1 2 1", "10 3\n2 2 1 1 2 2 2 2 1 2", "10 4\n1 1 2 3 3 1 2 2 2 3", "10 5\n3 3 2 2 3 1 1 1 3 1", "10 6\n4 4 4 3 2 1 1 1 2 4", "10 7\n4 2 2 2 3 3 2 4 4 3", "10 8\n5 4 1 4 3 2 1 2 3 3", "10 9\n1 2 3 4 5 2 3 5 5 4", "10 10\n5 3 2 5 1 2 5 1 5 1", "1 1000000000\n1", "1 1000000000\n1000000000", "1 100000000\n1000000000", "1 1\n1000000000"], "outputs": ["4", "1", "15", "15", "15", "5050", "5050", "4713", "4580", "4549", "4123", "1", "1", "0", "0", "0", "0", "0", "0", "0", "0", "0", "3", "3", "0", "0", "0", "0", "0", "0", "0", "0", "6", "5", "0", "3", "0", "3", "0", "0", "0", "2", "10", "9", "0", "3", "0", "0", "0", "0", "0", "0", "15", "13", "0", "4", "0", "10", "0", "0", "7", "3", "21", "14", "0", "0", "0", "0", "0", "0", "0", "11", "28", "24", "0", "8", "0", "15", "0", "18", "0", "10", "36", "8", "0", "10", "0", "0", "0", "21", "0", "0", "45", "36", "0", "15", "0", "21", "0", "0", "18", "23", "55", "53", "0", "26", "0", "27", "0", "24", "12", "35", "0", "1", "1", "1"]}	UNKNOWN	PYTHON3	CODEFORCES	3
919a173054ff13c4de2e0f84f05b8cbb	The Labyrinth	You are given a rectangular field of n<=×<=m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with ''. Let's call two empty cells adjacent if they share a side. Let's call a connected component any non-extendible set of cells such that any two of them are connected by the path of adjacent cells. It is a typical well-known definition of a connected component. For each impassable cell (x,<=y) imagine that it is an empty cell (all other cells remain unchanged) and find the size (the number of cells) of the connected component which contains (x,<=y). You should do it for each impassable cell independently. The answer should be printed as a matrix with n* rows and m columns. The j-th symbol of the i-th row should be "." if the cell is empty at the start. Otherwise the j-th symbol of the i-th row should contain the only digit —- the answer modulo 10. The matrix should be printed without any spaces. To make your output faster it is recommended to build the output as an array of n strings having length m and print it as a sequence of lines. It will be much faster than writing character-by-character. As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java. The first line contains two integers n,<=m (1<=≤<=n,<=m<=≤<=1000) — the number of rows and columns in the field. Each of the next n lines contains m symbols: "." for empty cells, "" for impassable cells. Print the answer as a matrix as described above. See the examples to precise the format of the output. Sample Input 3 3 .* .. .* 4 5 *.. ..*** ... ..* Sample Output 3.3 .5. 3.3 46..3 ..732 .6.4. 5.4.3	[ "# n=int(input())\r\n# n,k=map(int,input().split())\r\n# arr=list(map(int,input().split()))\r\n#ls=list(map(int,input().split()))\r\n#for i in range(m):\r\n# for _ in range(int(input())):\r\nfrom collections import Counter\r\n#from fractions import Fraction\r\n#n=int(input())\r\n#arr=list(map(int,input().split()))\r\n#ls = [list(map(int, input().split())) for i in range(n)]\r\nfrom math import log2\r\n#for _ in range(int(input())):\r\n#n, m = map(int, input().split())\r\n# for _ in range(int(input())):\r\nfrom math import gcd\r\n#n=int(input())\r\n# for i in range(m):\r\n# for i in range(int(input())):\r\n# n,k= map(int, input().split())\r\n# arr=list(map(int,input().split()))\r\n# n=sys.stdin.readline()\r\n# n=int(n)\r\n# n,k= map(int, input().split())\r\n# arr=list(map(int,input().split()))\r\n# n=int(inaput())\r\n#for _ in range(int(input())):\r\n#arr=list(map(int,input().split()))\r\nfrom collections import deque\r\ndx=[-1,0,0,1]\r\ndy=[0,-1,1,0]\r\n\r\ndef bfs(x,y):\r\n\tglobal total\r\n\ttotal+=1\r\n\tq=deque([(x,y)])\r\n\tv[x][y]=True\r\n\th[x][y]=comp\r\n\t#q.append()\r\n\twhile q:\r\n\t\tx,y=q.pop()\r\n\t\tfor i in range(4):\r\n\t\t\tnx=x+dx[i]\r\n\t\t\tny=y+dy[i]\r\n\t\t\t#print(\"nx,y\",nx, ny)\r\n\t\t\tif (nx>=0 and nx<n) and (ny>=0 and ny<m) and (v[nx][ny]==False) and (g[nx][ny]==\".\"):\r\n\t\t\t\tq.appendleft((nx,ny))\r\n\t\t\t\ttotal+=1\r\n\t\t\t\tv[nx][ny]=True\r\n\t\t\t\th[nx][ny]=comp\r\n\r\n#global g,h,r,comp,total\r\nn, m = map(int, input().split())\r\nh=[[-1 for i in range(m)] for j in range(n)]\r\ng=[]\r\nv=[[False for i in range(m)]for j in range(n)]\r\nfor i in range(n):\r\n\tg.append(list(input()))\r\ncomponent=[]\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif v[i][j]==False and g[i][j]==\".\":############\r\n\t\t\tcomp=len(component)\r\n\t\t\t#global total\r\n\t\t\ttotal=0\r\n\t\t\tbfs(i,j)\r\n\t\t\tcomponent.append(total)\r\n#print(component)\r\nfor x in range(n):\r\n\tfor y in range(m):\r\n\t\tif g[x][y] == \"\":\r\n\t\t\tans = 0\r\n\t\t\ts = set()\r\n\t\t\tfor k in range(4):\r\n\t\t\t\tnx = x + dx[k]\r\n\t\t\t\tny = y + dy[k]\r\n\t\t\t\tif nx >= 0 and nx < n and ny >= 0 and ny < m and g[nx][ny] == \".\":\r\n\t\t\t\t\ts.add(h[nx][ny])\r\n\t\t\tfor itm in s:\r\n\t\t\t\tans += component[itm]\r\n\t\t\tans += 1\r\n\t\t\tans %= 10\r\n\t\t\tg[x][y] = str(ans)\r\nfor i in range(n):\r\n\tprint(\"\".join(g[i]))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from sys import stdin, stdout\r\n\r\nn, m = map(int, stdin.readline().split())\r\n\r\nmtx = [[ch for ch in stdin.readline()] for _ in range(n)]\r\n\r\ngroups = [[0 for _ in range(m)] for _ in range(n)]\r\nsizes = [0]\r\nshard_id = 1\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if mtx[i][j] == '':\r\n continue\r\n if groups[i][j] != 0:\r\n continue\r\n\r\n stack = [(i, j)]\r\n size = 1\r\n groups[i][j] = shard_id\r\n while stack:\r\n x, y = stack.pop()\r\n for xi, yi in ((x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)):\r\n if xi < 0 or n <= xi:\r\n continue\r\n if yi < 0 or m <= yi:\r\n continue\r\n if mtx[xi][yi] != \".\":\r\n continue\r\n if groups[xi][yi] != 0:\r\n continue\r\n \r\n groups[xi][yi] = shard_id\r\n stack.append((xi, yi))\r\n size += 1\r\n sizes.append(size)\r\n shard_id += 1\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if mtx[i][j] != '':\r\n continue\r\n \r\n groups_id = set()\r\n for xi, yi in ((i + 1, j), (i - 1, j), (i, j + 1), (i, j - 1)):\r\n if xi < 0 or n <= xi:\r\n continue\r\n if yi < 0 or m <= yi:\r\n continue\r\n if mtx[xi][yi] != \".\":\r\n continue\r\n groups_id.add(groups[xi][yi])\r\n \r\n size = 1\r\n for gid in groups_id:\r\n size += sizes[gid]\r\n\r\n mtx[i][j] = str(size)[-1]\r\n\r\n\r\nstdout.write(('\\n'.join(''.join(row) for row in mtx)))\r\n", "from collections import Counter\r\nfrom math import log2\r\nfrom math import gcd\r\nfrom collections import deque\r\ndx=[-1,0,0,1]\r\ndy=[0,-1,1,0]\r\n\r\ndef bfs(x,y):\r\n\tglobal total\r\n\ttotal+=1\r\n\tq=deque([(x,y)])\r\n\tv[x][y]=True\r\n\th[x][y]=comp\r\n\twhile q:\r\n\t\tx,y=q.pop()\r\n\t\tfor i in range(4):\r\n\t\t\tnx=x+dx[i]\r\n\t\t\tny=y+dy[i]\r\n\t\t\tif (nx>=0 and nx<n) and (ny>=0 and ny<m) and (v[nx][ny]==False) and (g[nx][ny]==\".\"):\r\n\t\t\t\tq.appendleft((nx,ny))\r\n\t\t\t\ttotal+=1\r\n\t\t\t\tv[nx][ny]=True\r\n\t\t\t\th[nx][ny]=comp\r\n\r\nn, m = map(int, input().split())\r\nh=[[-1 for i in range(m)] for j in range(n)]\r\ng=[]\r\nv=[[False for i in range(m)]for j in range(n)]\r\nfor i in range(n):\r\n\tg.append(list(input()))\r\ncomponent=[]\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif v[i][j]==False and g[i][j]==\".\":\r\n\t\t\tcomp=len(component)\r\n\t\t\ttotal=0\r\n\t\t\tbfs(i,j)\r\n\t\t\tcomponent.append(total)\r\n\r\nfor x in range(n):\r\n\tfor y in range(m):\r\n\t\tif g[x][y] == \"\":\r\n\t\t\tans = 0\r\n\t\t\ts = set()\r\n\t\t\tfor k in range(4):\r\n\t\t\t\tnx = x + dx[k]\r\n\t\t\t\tny = y + dy[k]\r\n\t\t\t\tif nx >= 0 and nx < n and ny >= 0 and ny < m and g[nx][ny] == \".\":\r\n\t\t\t\t\ts.add(h[nx][ny])\r\n\t\t\tfor itm in s:\r\n\t\t\t\tans += component[itm]\r\n\t\t\tans += 1\r\n\t\t\tans %= 10\r\n\t\t\tg[x][y] = str(ans)\r\nfor i in range(n):\r\n\tprint(\"\".join(g[i]))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\n\r\nclass DisjointSetUnion:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n self.size = [1] * n\r\n self.num_sets = n\r\n\r\n def find(self, a):\r\n acopy = a\r\n while a != self.parent[a]:\r\n a = self.parent[a]\r\n while acopy != a:\r\n self.parent[acopy], acopy = a, self.parent[acopy]\r\n return a\r\n\r\n def union(self, a, b):\r\n a, b = self.find(a), self.find(b)\r\n if a != b:\r\n if self.size[a] < self.size[b]:\r\n a, b = b, a\r\n\r\n self.num_sets -= 1\r\n self.parent[b] = a\r\n self.size[a] += self.size[b]\r\n\r\n def set_size(self, a):\r\n return self.size[self.find(a)]\r\n\r\n def __len__(self):\r\n return self.num_sets\r\n\r\n\r\nl = []\r\nfor i in range(n):\r\n l.append(input().strip())\r\n\r\nUF = DisjointSetUnion(n * m)\r\nfor i in range(n):\r\n for j in range(m):\r\n if i < n - 1:\r\n if l[i][j] == '.' and l[i+1][j] == '.':\r\n UF.union(m * i + j, m * i + m + j)\r\n if j < m - 1:\r\n if l[i][j] == '.' and l[i][j+1] =='.':\r\n UF.union(m * i + j, m * i + j + 1)\r\n\r\nout = []\r\nfor i in range(n):\r\n curr = []\r\n for j in range(m):\r\n if l[i][j] == '.':\r\n curr.append('.')\r\n else:\r\n dx = [0,0,-1,1]\r\n dy = [-1,1,0,0]\r\n adj = set()\r\n for d in range(4):\r\n nx = i + dx[d]\r\n ny = j + dy[d]\r\n if 0 <= nx < n and 0 <= ny < m and l[nx][ny] == '.':\r\n adj.add(UF.find(m * nx + ny))\r\n \r\n outV = 1\r\n for v in adj:\r\n outV += UF.set_size(v)\r\n curr.append(str(outV % 10))\r\n out.append(''.join(curr))\r\nprint('\\n'.join(out))\r\n \r\n \r\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.table = [-1] * n\r\n \r\n def root(self, x):\r\n stack = []\r\n tbl = self.table\r\n while tbl[x] >= 0:\r\n stack.append(x)\r\n x = tbl[x]\r\n for y in stack:\r\n tbl[y] = x\r\n return x\r\n \r\n def find(self, x, y):\r\n return self.root(x) == self.root(y)\r\n \r\n def unite(self, x, y):\r\n r1 = self.root(x)\r\n r2 = self.root(y)\r\n if r1 == r2:\r\n return\r\n d1 = self.table[r1]\r\n d2 = self.table[r2]\r\n if d1 <= d2:\r\n self.table[r2] = r1\r\n self.table[r1] += d2\r\n else:\r\n self.table[r1] = r2\r\n self.table[r2] += d1\r\n \r\n def get_size(self, x):\r\n return -self.table[self.root(x)]\r\nn,m=map(int,input().split())\r\na=[list(input().rstrip()) for i in range(n)]\r\nuf=UnionFind(nm)\r\ndx=[1,0,-1,0]\r\ndy=[0,1,0,-1]\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]==\".\":\r\n for k in range(4):\r\n ni=i+dy[k];nj=j+dx[k]\r\n if 0<=ni<n and 0<=nj<m and a[ni][nj]==\".\":\r\n uf.unite(mi+j,mni+nj)\r\nans=[[\"\"]m for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]==\".\":\r\n ans[i][j]=\".\"\r\n else:\r\n tmp=0\r\n use=[]\r\n for k in range(4):\r\n ni,nj=i+dy[k],j+dx[k]\r\n if 0<=ni<n and 0<=nj<m and a[ni][nj]==\".\":\r\n flag=True\r\n for val in use:\r\n if uf.find(val,mni+nj):\r\n flag=False\r\n if flag:\r\n use.append(mni+nj)\r\n tmp+=uf.get_size(mni+nj)\r\n ans[i][j]=str((tmp+1)%10)\r\nfor i in range(n):\r\n print(\"\".join(ans[i]))", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nfrom collections import defaultdict\r\n\r\nclass UnionFind():\r\n def __init__(self,n):\r\n self.n=n\r\n self.parents=[-1]n\r\n\r\n def find(self,x):\r\n if self.parents[x]<0:\r\n return x\r\n else:\r\n self.parents[x]=self.find(self.parents[x])\r\n return self.parents[x]\r\n\r\n def union(self,x,y):\r\n x=self.find(x)\r\n y=self.find(y)\r\n\r\n if x==y:\r\n return\r\n\r\n if self.parents[x]>self.parents[y]:\r\n x,y=y,x\r\n\r\n self.parents[x]+=self.parents[y]\r\n self.parents[y]=x\r\n\r\n def size(self,x):\r\n return -self.parents[self.find(x)]\r\n\r\n def same(self,x,y):\r\n return self.find(x)==self.find(y)\r\n\r\n def members(self,x):\r\n root=self.find(x)\r\n return [i for i in range(self.n) if self.find(i)==root]\r\n\r\n def roots(self):\r\n return [i for i, x in enumerate(self.parents) if x< 0]\r\n\r\n def group_count(self):\r\n return len(self.roots())\r\n\r\n def all_group_members(self):\r\n group_members=defaultdict(list)\r\n for member in range(self.n):\r\n group_members[self.find(member)].append(member)\r\n return group_members\r\n\r\nh,w=map(int,input().split())\r\ns=[input() for _ in range(h)]\r\nuf=UnionFind(hw)\r\ndxdy=[(1,0),(0,1),(-1,0),(0,-1)]\r\ndef conv(x,y):\r\n return xw+y\r\n\r\nfor x in range(h):\r\n for y in range(w):\r\n if s[x][y]=='.':\r\n for dx,dy in dxdy:\r\n nx,ny=x+dx,y+dy\r\n if 0<=nx<h and 0<=ny<w and s[nx][ny]=='.':\r\n uf.union(conv(x,y),conv(nx,ny))\r\n\r\nans=[['.']w for i in range(h)]\r\nfor x in range(h):\r\n for y in range(w):\r\n if s[x][y]=='':\r\n S=set()\r\n for dx,dy in dxdy:\r\n nx,ny=x+dx,y+dy\r\n if 0<=nx<h and 0<=ny<w and s[nx][ny]=='.':\r\n S.add(uf.find(conv(nx,ny)))\r\n res=1\r\n for i in S:\r\n res+=uf.size(i)\r\n ans[x][y]=str(res%10)\r\n \r\nfor row in ans:\r\n print(''.join(row))", "from collections import defaultdict, Counter,deque\r\nfrom math import sqrt, log10, log, floor, factorial,gcd\r\nfrom bisect import bisect_left, bisect_right\r\nfrom itertools import permutations,combinations\r\nimport sys, io, os\r\ninput = sys.stdin.readline\r\n# input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n# sys.setrecursionlimit(10000) \r\ninf = float('inf')\r\nmod = 10 ** 9 + 7\r\ndef yn(a): print(\"YES\" if a else \"NO\")\r\nceil = lambda a, b: (a + b - 1) // b\r\nclass DisjointSetUnion:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n self.size = [1] * n\r\n self.num_sets = n\r\n\r\n def find(self, a):\r\n acopy = a\r\n while a != self.parent[a]:\r\n a = self.parent[a]\r\n while acopy != a:\r\n self.parent[acopy], acopy = a, self.parent[acopy]\r\n return a\r\n\r\n def union(self, a, b):\r\n a, b = self.find(a), self.find(b)\r\n if a != b:\r\n if self.size[a] < self.size[b]:\r\n a, b = b, a\r\n\r\n self.num_sets -= 1\r\n self.parent[b] = a\r\n self.size[a] += self.size[b]\r\n return 1\r\n return 0\r\n\r\n def set_size(self, a):\r\n return self.size[self.find(a)]\r\n\r\n def __len__(self):\r\n return self.num_sets\r\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\nfor i in range(1):\r\n n,m=[int(i) for i in input().split()]\r\n l=[]\r\n for i in range(n):\r\n l.append(input().strip())\r\n dsu=DisjointSetUnion(nm)\r\n for i in range(n):\r\n for j in range(m):\r\n if l[i][j]=='.':\r\n if i+1<n:\r\n if l[i+1][j]=='.':\r\n dsu.union(im+j,(i+1)m+j)\r\n if j+1<m:\r\n if l[i][j+1]=='.':\r\n dsu.union(im+j,im+j+1)\r\n out=[list(i) for i in l]\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if l[i][j]=='':\r\n i1,j1=i,j\r\n s=set()\r\n out[i][j]=1\r\n for i,j in [[i-1,j],[i+1,j],[i,j+1],[i,j-1]]:\r\n if 0<=i<n and 0<=j<m and l[i][j]=='.':\r\n if dsu.find(im+j) in s:\r\n continue\r\n\r\n out[i1][j1]+=dsu.set_size(im+j)\r\n s.add(dsu.find((i)m+j))\r\n out[i1][j1]%=10\r\n for i in out:\r\n print(i,sep=\"\")\r\n\r\n\r\n\r\n\r\n", "from collections import defaultdict\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.n = n\r\n self.p = [-1] * (n+1)\r\n \r\n def find(self, x):\r\n if self.p[x] < 0:\r\n return x\r\n else:\r\n self.p[x] = self.find(self.p[x])\r\n return self.p[x]\r\n \r\n def union(self,x,y):\r\n x = self.find(x)\r\n y = self.find(y)\r\n if x == y: return \r\n if self.p[x] > self.p[y]:\r\n x,y = y,x\r\n self.p[x] += self.p[y]\r\n self.p[y] = x\r\n\r\n def same(self, a,b):\r\n return self.find(a) == self.find(b)\r\n \r\n def group(self):\r\n d = defaultdict(list)\r\n for i in range(1,self.n+1):\r\n par = self.find(i)\r\n d[par].append(i)\r\n return d\r\n\r\n\r\n\r\n\r\nimport 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\n\r\nn,m = map(int,input().split())\r\ng = [input().rstrip() for i in range(n)]\r\nuf = UnionFind(nm)\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == \"\": continue\r\n if i != n-1 and g[i+1][j] == \".\":\r\n uf.union(im+j, (i+1)m+j)\r\n if j != m-1 and g[i][j+1] == \".\":\r\n uf.union(im+j, im+(j+1))\r\n\r\nans = [[] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == \".\":\r\n ans[i].append(\".\")\r\n else:\r\n s = set()\r\n for dx,dy in [[0,1],[0,-1],[1,0],[-1,0]]:\r\n nx,ny = i+dx , j+dy\r\n if not (0<=nx < n and 0 <= ny < m): continue\r\n if g[nx][ny] == \"\": continue\r\n s.add(uf.find(nxm+ny))\r\n tmp = 1\r\n for num in s:\r\n tmp -= uf.p[num]\r\n ans[i].append(str(tmp%10))\r\n\r\nfor i in ans:\r\n print(\"\".join(i))\r\n\r\n \r\n\r\n \r\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef 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 root_s = get_root(s)\r\n root_t = get_root(t)\r\n if not root_s == root_t:\r\n if rank[s] == rank[t]:\r\n root[root_t] = root_s\r\n rank[root_s] += 1\r\n size[root_s] += size[root_t]\r\n elif rank[s] > rank[t]:\r\n root[root_t] = root_s\r\n size[root_s] += size[root_t]\r\n else:\r\n root[root_s] = root_t\r\n size[root_t] += size[root_s]\r\n\r\ndef same(s, t):\r\n if get_root(s) == get_root(t):\r\n return True\r\n else:\r\n return False\r\n\r\nn, m = map(int, input().split())\r\nl = n * m\r\nroot = [i for i in range(l)]\r\nrank = [1 for _ in range(l)]\r\nsize = [1 for _ in range(l)]\r\ns = []\r\nfor i in range(n):\r\n s0 = list(input().rstrip())\r\n for j in range(m - 1):\r\n if s0[j] == s0[j + 1] == \".\":\r\n unite(m * i + j, m * i + j + 1)\r\n s.append(s0)\r\nfor i in range(n - 1):\r\n for j in range(m):\r\n if s[i][j] == s[i + 1][j] == \".\":\r\n if not same(m * i + j, m * (i + 1) + j):\r\n unite(m * i + j, m * (i + 1) + j)\r\ncnt = defaultdict(lambda : 0)\r\nr = [0] * l\r\nfor i in range(l):\r\n x = get_root(i)\r\n r[i] = x\r\n cnt[x] += 1\r\nv = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if not s[i][j] == \"\":\r\n continue\r\n s0 = set()\r\n for di, dj in v:\r\n ni, nj = i + di, j + dj\r\n if 0 <= ni < n and 0 <= nj < m:\r\n if s[ni][nj] == \".\":\r\n s0.add(r[m ni + nj])\r\n ans = 1\r\n for k in s0:\r\n ans += cnt[k]\r\n s[i][j] = str(ans % 10)\r\nfor s0 in s:\r\n print(\"\".join(s0))", "from collections import deque\r\n\r\ndirs = [[1, 0], [-1, 0], [0, 1], [0, -1]]\r\n\r\ncomponentsizes = {}\r\ncomponentid = 0\r\n\r\nn, m = map(int, input().split())\r\nfield = [list(input()) for _ in range(n)]\r\n\r\ndef valid(y, x):\r\n return y >= 0 and x >= 0 and y < n and x < m\r\n\r\ndef component(y, x):\r\n size = 1\r\n q = deque([(y, x)])\r\n field[y][x] = componentid\r\n while q:\r\n y, x = q.pop()\r\n for i, j in dirs:\r\n if valid(y+i, x+j) and field[y+i][x+j] == \".\":\r\n q.appendleft((y+i, x+j))\r\n field[y+i][x+j] = componentid\r\n size += 1\r\n return size\r\n\r\ndef solve(y, x):\r\n connected = set()\r\n for i, j in dirs:\r\n if valid(y+i, x+j) and type(field[y+i][x+j]) is int:\r\n connected.add(field[y+i][x+j])\r\n return (sum(componentsizes[i] for i in connected)+1)%10\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if field[i][j] == \".\":\r\n componentsizes[componentid] = component(i, j)\r\n componentid += 1\r\n\r\noutput = [[] for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n output[i].append(str(solve(i, j)) if field[i][j] == \"*\" else \".\")\r\n\r\nprint(\"\\n\".join([\"\".join(row) for row in output]))\r\n" ]	{"inputs": ["3 3\n.\n..\n.", "4 5\n..\n..**\n...\n..", "1 1\n", "1 1\n.", "1 10\n********", "1 10\n.*..", "10 1\n\n\n\n\n\n.\n\n.\n\n*", "10 1\n.\n.\n.\n.\n.\n.\n.\n.\n.\n."], "outputs": ["3.3\n.5.\n3.3", "46..3\n..732\n.6.4.\n5.4.3", "1", ".", "1111111111", "2.212.22.2", "1\n1\n1\n1\n2\n.\n3\n.\n2\n1", ".\n.\n.\n.\n.\n.\n.\n.\n.\n."]}	UNKNOWN	PYTHON3	CODEFORCES	10
91b19792c755370d0bb363b9e826e496	Message	Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s. String p is called a substring of string s if you can read it starting from some position in the string s. For example, string "aba" has six substrings: "a", "b", "a", "ab", "ba", "aba". Dr. Moriarty plans to take string s and cut out some substring from it, let's call it t. Then he needs to change the substring t zero or more times. As a result, he should obtain a fixed string u (which is the string that should be sent to Sherlock Holmes). One change is defined as making one of the following actions: - Insert one letter to any end of the string. - Delete one letter from any end of the string. - Change one letter into any other one. Moriarty is very smart and after he chooses some substring t, he always makes the minimal number of changes to obtain u. Help Moriarty choose the best substring t from all substrings of the string s. The substring t should minimize the number of changes Moriarty should make to obtain the string u from it. The first line contains a non-empty string s, consisting of lowercase Latin letters. The second line contains a non-empty string u, consisting of lowercase Latin letters. The lengths of both strings are in the range from 1 to 2000, inclusive. Print the only integer — the minimum number of changes that Dr. Moriarty has to make with the string that you choose. Sample Input aaaaa aaa abcabc bcd abcdef klmnopq Sample Output 0 1 7	[ "# 156A - Message\r\nx, y = input(), input()\r\nz = len(y)\r\nx = \"0\"z+x+\"0\"z\r\nm = 0\r\nfor i in range(len(x)-z):\r\n w = x[i:i+z]\r\n a = 0\r\n for j in range(z):\r\n if w[j] == y[j]:\r\n a += 1\r\n m = max(m, a)\r\nprint(z-m)\r\n", "s = input()\r\nu = input()\r\n\r\ns = '#' * 2005 + s + '#' * 2005\r\nmin_dist = 5000\r\n\r\nfor i in range(len(s) - len(u)):\r\n ptr1, ptr2 = i, 0\r\n md = 0\r\n while ptr2 < len(u):\r\n md += 1 if s[ptr1] != u[ptr2] else 0\r\n ptr1 += 1\r\n ptr2 += 1\r\n min_dist = min(md, min_dist)\r\n\r\nprint(min_dist)\r\n", "x,y=input(),input()\r\nt=[0]len(x)\r\np={i:[] for i in \"abcdefghijklmnopqrstuvwxyz\"}\r\nfor i,j in enumerate(x):\r\n p[j].append(i)\r\n#print(p)\r\nfor i in y:\r\n for j in p[i]:\r\n t[j]+=1\r\n t=[0]+t\r\nprint(len(y)-max(t))\r\n \r\n ", "s = input()\r\nu = input()\r\nt = [0] len(s)\r\nd = {chr(i) : [] for i in range(ord('a'), ord('z')+1)}\r\nfor i, j in enumerate(s) :\r\n d[j].append(i)\r\nfor i in u:\r\n for j in d[i]:\r\n t[j] += 1\r\n t = [0] + t\r\nprint(len(u) - max(t))\r\n", "\r\ndef solve(a, b):\r\n ans = 0\r\n for i in range(len(a)):\r\n if a[i] == b[i]:\r\n ans += 1\r\n return ans\r\n\r\na = input()\r\nb = input()\r\ntot = len(a)+len(b)\r\nsm = 0\r\nfor i in range(1, tot):\r\n f = max(0, len(a)-i)\r\n s = max(0, i-len(a))\r\n sz = min(i, tot-i, len(a), len(b))\r\n sm = max(sm, solve(a[f:f+sz], b[s:s+sz]))\r\nprint(len(b)-sm)\r\n", "import sys\r\ns=input()\r\nu=input()\r\nmax=0\r\ndef match(a,b):\r\n num=0\r\n for i in range(min(len(a),len(b))):\r\n if a[i]==b[i]:num+=1\r\n return num\r\nfor i in range(len(s)):\r\n temp=match(s[i:],u)\r\n if temp>max:\r\n max=temp\r\n if max==len(u):\r\n break\r\nfor i in range(len(u)):\r\n temp=match(s,u[i:])\r\n if temp>max:\r\n max=temp\r\n if max==len(u):\r\n break\r\nprint(len(u)-max)", "s, u = input(), input()\r\nt = [0] * len(s)\r\np = {i: [] for i in 'abcdefghijklmnopqrstuvwxyz'}\r\nfor i, j in enumerate(s): p[j].append(i)\r\nfor j in u:\r\n for i in p[j]: t[i] += 1\r\n t = [0] + t\r\nprint(len(u) - max(t))", "from sys import stdin\r\n\r\nfirst = stdin.readline().strip()\r\nsecond = stdin.readline().strip()\r\n\r\nminChange = 2001\r\n\r\nfirst = '@' * (len(second) - 1) + first + '@' * (len(second) - 1)\r\ndiff = len(first) - len(second)\r\n\r\nfor i in range(0, diff + 1):\r\n line = '@' * i + second + '@' * (diff - i)\r\n result = 0\r\n for i in range(i, i + len(second)):\r\n if first[i] != line[i]:\r\n result += 1\r\n if minChange > result:\r\n minChange = result\r\n\r\nprint(minChange)\r\n\r\n\r\n", "x,y = input(),input()\r\nres = [0] * len(x)\r\ndata = {i:[] for i in \"abcdefghijklmnopqrstuvwxyz\"}\r\nfor i,j in enumerate(x):\r\n data[j].append(i)\r\n\r\nfor i in y:\r\n for j in data[i]:\r\n res[j]+=1\r\n res = [0] + res\r\nprint(len(y)-max(res))\r\n \r\n ", "a = input()\r\nb = input()\r\na = '.' * len(b) + a + '.' * len(b)\r\nans = len(b)\r\nfor i in range(len(a)):\r\n if i + len(b) <= len(a): \r\n cnt = 0\r\n for j in range(len(b)):\r\n cnt += (1 if a[i + j] != b[j] else 0)\r\n \r\n ans = min(ans, cnt)\r\n\r\nprint(ans)", "x,y=input(),input()\r\n \r\nres=[0]len(x)\r\n \r\ndicc ={i:[] for i in \"abcdefghijklmnopqrstuvwxyz\"}\r\n \r\nfor i,j in enumerate(x):\r\n \r\n dicc[j].append(i)\r\n \r\nfor i in y:\r\n \r\n for j in dicc[i]:\r\n \r\n res[j]+=1\r\n \r\n res=[0]+res\r\n\r\n \r\nprint(len(y)-max(res))", "def cnt(s, t):\r\n ans = 0\r\n for i in range(len(s)):\r\n ans += s[i] != t[i]\r\n \r\n return ans\r\n\r\n\r\ns = input()\r\nu = input()\r\n\r\ns = 2000 '.' + s + 2000 * '.'\r\nmn = 10 ** 10\r\nfor i in range(len(s) - len(u)):\r\n cur = s[i: i + len(u)]\r\n mn = min(mn, cnt(cur, u))\r\n\r\nprint(mn)" ]	{"inputs": ["aaaaa\naaa", "abcabc\nbcd", "abcdef\nklmnopq", "aaabbbaaa\naba", "a\na", "z\nz", "a\nz", "d\nt", "o\nu", "a\nm", "t\nv", "n\ng", "c\nh", "r\ni", "h\nb", "r\na", "c\np", "wbdbzf\nfpvlerhsuf", "zafsqbsu\nhl", "juhlp\nycqugugk", "ladfasxt\ncpvtd", "ally\ncjidwuj", "rgug\npgqwslo", "wmjwu\nrfew", "cpnwcdqff\nq", "dkwh\nm", "zfinrlju\nwiiegborjl", "swconajiqpgziitbpwjsfcalqvmwbfed\nridfnsyumichlhpnurrnwkyjcdzchznpmno", "vfjofvgkdwgqdlomtmcvedtmimdnxavhfirienxfdflldkbwjsynablhdvgaipvcghgaxipotwmmlzxekipgbvpfivlgzfwqz\njkdfjnessjfgcqpnxgtqdxtqimolbdlnipkoqht", "dtvxepnxfkzcaoh\nkpdzbtwjitzlyzvsbwcsrfglaycrhzwsdtidrelndsq", "sweaucynwsnduofyaqunoxttbipgrbfpssplfp\nuifmuxmczznobefdsyoclwzekewxmcwfqryuevnxxlgxsuhoytkaddorbdaygo", "eohztfsxoyhirnzxgwaevfqstinlxeiyywmpmlbedkjihaxfdtsocof\nbloqrjbidxiqozvwregxxgmxuqcvhwzhytfckbafd", "ybshzefoxkqdigcjafs\nnffvaxdmditsolfxbyquira", "ytfqnuhqzbjjheejjbzcaorilcyvuxvviaiba\nxnhgkdfceialuujgcxmrhjbzvibcoknofafmdjnhij", "ibdjtvgaveujdyidqldrxgwhsammmfpgxwljkptmeyejdvudhctmqjazalyzmzfgebetyqncu\nercdngwctdarcennbuqhsjlwfwrcqjbcjxqftycoulrhrimwhznogjmrrqdygtmllottpjgmkndraearezvxxmdhcuokhyngu", "bwhvaanyxupicwobeevcwewhcriwowfovnylalpuhxzqxtzyjrzlxcmejujvliomdfedgtaioauwrcluhfxtzu\nplinvtsvytepojsecnjisxlmqkfhgknitvuw", "sjxykdmrzpescabubcjflhnpckgytklc\nsxirpuqnmjqhlnvdeyvxvzzcygkpsujyifzgzmtvxsimddjahiephqlgfzngrzjtcrgrimewsxipczsgu", "ksmbytfyhhnstlecripupiwdhbkhfpfmimrbqgszohcqnezcybvwasxmkxfupvuecsctcpadccnqexsglwaiyxcoyheefcjmdedesgjqdtqgrvfjonzesffousooutsjumrxl\nhgjqihcfbnmgufonaiudbjegexexthrzcdkuimwogpbyovemztzcmqnrbhabxyyxyfuzpyhjgnioexbezzupcxlyzuuncstiiqsjzdtqppqhxilvqimlpjejiqbwpeekzweeyvthvjffgfvqauqrugajjjzibgzhxphcvtncjzecbtupwkehcrgsgfgkvwwnifglyamjkzfvabybsstwrwugnmiwflhemgnfbrtskzfxcepqhtelgiowzeuujpkuzsfsipcvtfoeshawvryaubilcbwukdhlwamsqenzvr", "abcd\ndabc", "medxx\nahmed", "ab\ndab", "nasldkfnsb\nyyyynasld", "abcde\ncabc", "a\nzzzzzzzzzza", "abcde\nabde", "bac\ntbdca", "abcdef\nxyzabc", "abcdef\nbctsf", "xxxabaxxx\nxxxaaxxx", "bcd\nabc", "d\nabcdef"], "outputs": ["0", "1", "7", "1", "0", "0", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "9", "2", "7", "4", "7", "6", "3", "0", "1", "9", "32", "34", "41", "57", "37", "19", "37", "90", "28", "76", "287", "1", "2", "1", "4", "1", "10", "2", "3", "3", "2", "2", "1", "5"]}	UNKNOWN	PYTHON3	CODEFORCES	12
91c3babe38f68cd3ad2fb4f40f35e2f3	Restoring Table	Recently Polycarpus has learned the "bitwise AND" operation (which is also called "AND") of non-negative integers. Now he wants to demonstrate the school IT teacher his superb manipulation with the learned operation. For that Polycarpus came to school a little earlier and wrote on the board a sequence of non-negative integers a1,<=a2,<=...,<=an. He also wrote a square matrix b of size n<=×<=n. The element of matrix b that sits in the i-th row in the j-th column (we'll denote it as bij) equals: - the "bitwise AND" of numbers ai and aj (that is, bij<==<=ai & aj), if i<=≠<=j; - -1, if i<==<=j. Having written out matrix b, Polycarpus got very happy and wiped a off the blackboard. But the thing is, the teacher will want this sequence to check whether Polycarpus' calculations were correct. Polycarus urgently needs to restore the removed sequence of integers, or else he won't prove that he can count correctly. Help Polycarpus, given matrix b, restore the sequence of numbers a1,<=a2,<=...,<=an, that he has removed from the board. Polycarpus doesn't like large numbers, so any number in the restored sequence mustn't exceed 109. The first line contains a single integer n (1<=≤<=n<=≤<=100) — the size of square matrix b. Next n lines contain matrix b. The i-th of these lines contains n space-separated integers: the j-th number represents the element of matrix bij. It is guaranteed, that for all i (1<=≤<=i<=≤<=n) the following condition fulfills: bii = -1. It is guaranteed that for all i,<=j (1<=≤<=i,<=j<=≤<=n; i<=≠<=j) the following condition fulfills: 0<=≤<=bij<=≤<=109, bij<==<=bji. Print n non-negative integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=109) — the sequence that Polycarpus wiped off the board. Separate the numbers by whitespaces. It is guaranteed that there is sequence a that satisfies the problem conditions. If there are multiple such sequences, you are allowed to print any of them. Sample Input 1 -1 3 -1 18 0 18 -1 0 0 0 -1 4 -1 128 128 128 128 -1 148 160 128 148 -1 128 128 160 128 -1 Sample Output 0 18 18 0 128 180 148 160	[ "n=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n q=0\r\n for i in map(int,input().split()):\r\n if i!=-1:q\|=i\r\n l+=[q]\r\nprint(l)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nans = [0]n\r\nfor i in range(n):\r\n for j in range(n):\r\n if j!=i:\r\n ans[i] \|= a[i][j]\r\n print(ans[i],end = ' ')\r\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = [0]n\r\nfor i in range(n):\r\n s = list(map(int, input().split()))\r\n for j in range(i+1, n):\r\n d[i] \|= s[j]\r\n d[j] \|= s[j]\r\n\r\nprint(' '.join(map(str, d)))\r\n", "n = int(input())\na = [0]n\nfor i in range(n):\n for x in map(int, input().split()):\n if x!=-1:\n a[i]\|=x\nprint(a)\n", "def str_from_list(row):\r\n result = \"\"\r\n for number in row:\r\n result += str(number) + \" \"\r\n return result[0:len(result)-1]\r\n\r\ndef table_restore(size, table):\r\n table_rows = table.split('\\n')\r\n current_size = int(size)\r\n result = [0]current_size\r\n for i in range(current_size):\r\n for x in map(int, table_rows[i].split()):\r\n if x != -1:\r\n #побитовое или\r\n result[i] \|= x\r\n return str_from_list(result) \r\n\r\nsize = input()\r\ntable = \"\"\r\nfor _ in range(int(size)):\r\n table += input() + \"\\n\"\r\n\r\ntable = str(table[0:len(table)-1])\r\n\r\nprint(table_restore(size, table))", "n = int(input())\r\np = [0] * n\r\nfor i in range(n):\r\n t = list(map(int, input().split()))\r\n t.pop(i)\r\n s = 0\r\n for j in t:\r\n s \|= j\r\n p[i] = s\r\nprint(' '.join(map(str, p)))", "n = int(input())\r\nrow = [0] * n\r\nres = [0] * n\r\nfor i in range(n):\r\n row[i] = map(int, input().split())\r\n for y in row[i]:\r\n if y != -1:\r\n res[i] \|= y\r\nfor r in res:\r\n print(r, end=' ')# 1698100805.8303063", "n = int(input())\na = [0]n\nfor i in range(n):\n\tfor j, aij in enumerate(map(int, input().split())):\n\t\tif i==j: continue\n\t\ta[i] \|= aij\n\t\ta[j] \|= aij\n\nprint(' '.join(map(str, a)))\n", "n = int(input())\r\nls = []\r\nfor i in range(n) :\r\n ls.append(list(map(int,input().split())))\r\nfor i in range(n) :\r\n val = 0\r\n for j in range(n) :\r\n if i != j :\r\n val \|= ls[i][j]\r\n print(val,end=\" \")", "n = int(input())\r\nfor i in range(n):\r\n r = 0\r\n for b in input().split():\r\n if b != '-1':\r\n r \|= int(b)\r\n print(r, end=' ')\r\n", "from sys import stdin\r\nimport math\r\nimport zlib\r\n\r\nn = int(stdin.readline().rstrip())\r\nm = [list(map(int, stdin.readline().rstrip().split(' '))) for _ in range(n)]\r\n\r\nans = [0] 110\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n ans[i] \|= m[i][j]\r\n\r\nfor i in range(n):\r\n print(ans[i], end=' ')", "n=int(input())\r\nA=[0]n\r\nans=[0]n\r\nfor i in range(n):\r\n\tA[i]=list(map(int,input().split()))\r\n\tfor j in range(n):\r\n\t\tif(j==i):continue\r\n\t\tans[i]\|=A[i][j]\r\nfor i in range(n):\r\n\tprint(ans[i],' ',end='')\r\n" ]	{"inputs": ["1\n-1", "3\n-1 18 0\n18 -1 0\n0 0 -1", "4\n-1 128 128 128\n128 -1 148 160\n128 148 -1 128\n128 160 128 -1", "5\n-1 0 0 0 0\n0 -1 1 0 0\n0 1 -1 0 0\n0 0 0 -1 0\n0 0 0 0 -1", "6\n-1 1835024 1966227 34816 68550800 34832\n1835024 -1 18632728 306185992 324272924 289412624\n1966227 18632728 -1 40 555155640 16846864\n34816 306185992 40 -1 306185000 272666176\n68550800 324272924 555155640 306185000 -1 289481232\n34832 289412624 16846864 272666176 289481232 -1", "7\n-1 1000000000 999999488 999999488 1000000000 1000000000 999999488\n1000000000 -1 999999488 999999488 1000000000 1000000000 999999488\n999999488 999999488 -1 999999999 999999488 999999488 999999999\n999999488 999999488 999999999 -1 999999488 999999488 999999999\n1000000000 1000000000 999999488 999999488 -1 1000000000 999999488\n1000000000 1000000000 999999488 999999488 1000000000 -1 999999488\n999999488 999999488 999999999 999999999 999999488 999999488 -1", "8\n-1 56086 2560 35584 6402 18688 22530 256\n56086 -1 2697 35592 6410 18696 22667 257\n2560 2697 -1 10824 10280 10248 10377 8193\n35584 35592 10824 -1 76040 76040 10248 73984\n6402 6410 10280 76040 -1 76040 14346 73984\n18688 18696 10248 76040 76040 -1 26632 73984\n22530 22667 10377 10248 14346 26632 -1 9217\n256 257 8193 73984 73984 73984 9217 -1", "9\n-1 0 0 2 0 2 10 2 0\n0 -1 17 16 16 17 0 17 16\n0 17 -1 16 16 17 0 17 16\n2 16 16 -1 16 18 2 18 16\n0 16 16 16 -1 16 0 16 16\n2 17 17 18 16 -1 2 19 16\n10 0 0 2 0 2 -1 2 0\n2 17 17 18 16 19 2 -1 16\n0 16 16 16 16 16 0 16 -1", "10\n-1 16 16 0 0 0 0 16 16 16\n16 -1 16 3 3 2 0 17 18 16\n16 16 -1 0 0 0 0 16 16 16\n0 3 0 -1 15 10 12 1 2 0\n0 3 0 15 -1 10 12 1 2 0\n0 2 0 10 10 -1 8 0 2 0\n0 0 0 12 12 8 -1 0 0 0\n16 17 16 1 1 0 0 -1 16 16\n16 18 16 2 2 2 0 16 -1 16\n16 16 16 0 0 0 0 16 16 -1", "2\n-1 0\n0 -1"], "outputs": ["0 ", "18 18 0 ", "128 180 148 160 ", "0 1 1 0 0 ", "69109907 324818716 555700411 306220904 928457660 289521232 ", "1000000000 1000000000 999999999 999999999 1000000000 1000000000 999999999 ", "56086 56223 10985 109384 80170 92424 31883 75009 ", "10 17 17 18 16 19 10 19 16 ", "16 19 16 15 15 10 12 17 18 16 ", "0 0 "]}	UNKNOWN	PYTHON3	CODEFORCES	12
91c49eb218a529b816dfd941b351be69	Queue	Little girl Susie went shopping with her mom and she wondered how to improve service quality. There are n people in the queue. For each person we know time ti needed to serve him. A person will be disappointed if the time he waits is more than the time needed to serve him. The time a person waits is the total time when all the people who stand in the queue in front of him are served. Susie thought that if we swap some people in the queue, then we can decrease the number of people who are disappointed. Help Susie find out what is the maximum number of not disappointed people can be achieved by swapping people in the queue. The first line contains integer n (1<=≤<=n<=≤<=105). The next line contains n integers ti (1<=≤<=ti<=≤<=109), separated by spaces. Print a single number — the maximum number of not disappointed people in the queue. Sample Input 5 15 2 1 5 3 Sample Output 4	[ "n = int(input())\r\ntlist = list(map(int, input().split()))\r\ntlist.sort()\r\ncount = 0\r\nsum1 = tlist[0]\r\nfor i in range(1,n):\r\n if sum1 <= tlist[i]:\r\n count += 1\r\n sum1 += tlist[i]\r\nprint(count+1) ", "'''\r\n2300015897\r\n吴杰稀\r\n光华管理学院\r\n'''\r\nn = int(input())\r\nnum_list = list(map(int,input().split()))\r\nnum_list.sort()\r\ni = 0\r\nhappy_num = 0\r\ntotal_time = 0\r\nwhile i <= len(num_list) - 1:\r\n if num_list[i] >= total_time:\r\n total_time += num_list[i]\r\n happy_num += 1\r\n i += 1\r\nprint(happy_num)\r\n", "s=t=0\r\nfor i in sorted(map(int,[open(0)][1].split())):\r\n if i>=s:t+=1;s+=i\r\nprint(t)", "n = int(input())\r\nline = list(map(int,input().split()))\r\n\r\nline.sort()\r\nqueue = []\r\nfor i in line:\r\n if i >= sum(queue):\r\n queue.append(i)\r\nprint(len(queue))", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 31 22:20:45 2023\r\n\r\n@author: 袁兆瑞\r\n\"\"\"\r\n\r\n# 读取输入\r\nn = int(input())\r\ntimes = list(map(int, input().split()))\r\n\r\n# 对时间列表进行排序\r\ntimes.sort()\r\n\r\n# 初始化变量\r\ncount = 0\r\nsum_time = 0\r\n\r\n# 计算最大不失望人数\r\nfor i in range(n):\r\n if sum_time <= times[i]:\r\n count += 1\r\n sum_time += times[i]\r\n\r\n# 输出结果\r\nprint(count)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=1\r\nb=[a[0]]\r\nfor i in range(1,n):\r\n if a[i]>=sum(b):\r\n ans+=1\r\n b.append(a[i])\r\nprint(ans)", "# Asif Islam - asifislam510\nn = int(input())\narr = sorted(map(int, input().split()))\ns = 0\noutput = 0\n\nfor i in arr:\n if i >= s:\n output += 1\n s += i\n\nprint(output)\n\n\t \t\t\t\t \t \t \t\t\t\t\t \t\t \t\t \t\t", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Sat Oct 28 19:02:05 2023\r\n\r\n@author: 20311\r\n\"\"\"\r\n\r\nn=int(input())\r\nqueue=list(map(int,input().split()))\r\nqueue.sort()\r\ns=0\r\ncount=0\r\nfor i in range(len(queue)):\r\n if queue[i]>=s:\r\n count+=1\r\n s+=queue[i]\r\n\r\nprint(count)", "n=int(input())\r\ntime=list(map(int,input().split()))\r\n\r\ntime.sort()\r\nfin_line=[]\r\nfor i in range(n):\r\n if time[i]>=sum(fin_line):\r\n fin_line.append(time[i])\r\nprint(len(fin_line))", "def lavkush(l):\r\n l.sort()\r\n k=0\r\n c=0\r\n for i in l:\r\n if k<=i:\r\n c=c+1\r\n k=k+i\r\n return c\r\nn=int(input())\r\nl=[int(i) for i in input().split()][:n]\r\nprint(lavkush(l))", "n=int(input())\r\nli=[int(i) for i in input().split()]\r\nli.sort()\r\nwait=0\r\nans=0\r\nfor i in range(n):\r\n if li[i]>=wait:\r\n ans+=1\r\n wait+=li[i]\r\nprint(ans)\r\n", "def solve(n):\n n.sort()\n count = 0\n curr = 0\n for num in n:\n if num < curr:\n continue\n count += 1\n curr += num\n return count\n\ndef main():\n t = int(input())\n print(solve([int(x) for x in input().split()]))\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=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nsm=0\r\nn=len(lst)\r\nnd=0\r\nfor i in range(n):\r\n if lst[i]>=sm:\r\n nd+=1\r\n sm+=lst[i]\r\nprint(nd)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nsotred_arr = sorted(arr)\r\nres = 0\r\ntime = 0\r\nfor i in range(len(sotred_arr)):\r\n if time <= sotred_arr[i]:\r\n res += 1\r\n time += sotred_arr[i]\r\n\r\n \r\n\r\nprint(res)", "#游敬恩，2300012555\r\nn = int(input())\r\nlis = list(map(int, input().split()))\r\nlis.sort()\r\nsum = 0\r\nsatis = 0\r\nfor i in range(n):\r\n if sum <= lis[i]:\r\n satis += 1\r\n sum += lis[i]\r\nprint(satis)", "n=int(input())\r\ntime=[int(x)for x in input().split()]\r\ntime.sort()\r\ntot=0\r\nans=0\r\nfor i in range(n):\r\n if tot <= (t:=time[i]):\r\n ans+=1\r\n tot+=t\r\nprint(ans)", "n = int(input())\r\nservice_times = list(map(int, input().split()))\r\n\r\nservice_times.sort() # Sort the service times in ascending order\r\n\r\nnot_disappointed_count = 0\r\nwaiting_time = 0\r\n\r\nfor i in range(n):\r\n if waiting_time <= service_times[i]:\r\n not_disappointed_count += 1\r\n waiting_time += service_times[i]\r\n\r\nprint(not_disappointed_count)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Fri Oct 27 15:31:33 2023\r\n\r\n@author: Amanda\r\n\"\"\"\r\n\r\nn=int(input())\r\nqueue=list(map(int,input().split()))\r\nqueue.sort()\r\nx = 0\r\nsum = 0\r\nfor i in range(n):\r\n if sum <= queue[i]:\r\n x += 1\r\n sum += queue[i]\r\nprint(x)", "n = int(input())\r\nti = list(map(int, input().split()))\r\nti.sort()\r\nresult = []\r\n\r\nfor i in range(len(ti)):\r\n if ti[i] >= sum(result[:i]):\r\n result.append(ti[i])\r\n\r\nprint(len(result))\r\n", "n = int(input())\r\ntime = list(map(int,input().split()))\r\ntime = sorted(time)\r\n\r\nwait_time = 0\r\nppl = 0\r\n\r\nfor i in range(n):\r\n if time[i] >= wait_time:\r\n ppl += 1\r\n wait_time += time[i]\r\n\r\nprint(ppl)", "def max_happy_people(n, times):\r\n times.sort() # Сортировка времен обслуживания по возрастанию\r\n happy_count = 0 # Счетчик довольных людей\r\n total_waiting_time = 0 # Общее время ожидания\r\n\r\n for i in range(n):\r\n if times[i] >= total_waiting_time: # Проверка условия для довольного человека\r\n happy_count += 1\r\n total_waiting_time += times[i] # Обновление общего времени ожидания\r\n else:\r\n # Человек будет недоволен, переносим его в конец очереди без увеличения времени ожидания\r\n times.append(times[i])\r\n\r\n return happy_count\r\n\r\n\r\n# Чтение входных данных\r\nn = int(input())\r\ntimes = list(map(int, input().split()))\r\n\r\n# Вызов функции и вывод результата\r\nprint(max_happy_people(n, times))", "n=int(input())\r\nt=list(map(int,input().split()))\r\nt.sort()\r\ntime=t[0]\r\nnum=1\r\nfor i in range(1,n):\r\n if t[i]>=time:\r\n num+=1\r\n time+=t[i]\r\n else:\r\n continue\r\nprint(num)", "n=int(input())\r\na=list(map(int, input().split()))\r\na.sort()\r\nc,t=0,0\r\nfor i in range(n):\r\n if a[i]>=t:\r\n t+=a[i]\r\n c+=1\r\nprint(c)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nsatis=[1]n\r\ncnt=0\r\nfor i in range(0,len(a)):\r\n if cnt>a[i]:\r\n satis[i]=0\r\n cnt+=a[i]\r\n\r\ntot=0\r\nans=0\r\nfor j in range(0,len(a)):\r\n if satis[j]==1:\r\n ans+=1\r\n tot+=a[j]\r\n else:\r\n if tot<=a[j]:\r\n tot+=a[j]\r\n ans+=1\r\n else:\r\n continue\r\n\r\nprint(ans)\r\n", "lentgh = input()\r\ncount = time = 0\r\nfor t in sorted(map(int,input().split())) :\r\n if time <= t : \r\n count += 1\r\n time += t \r\nprint(count)", "n = int(input())\r\narr = sorted([int(i) for i in input().split()]) \r\nsm = ans = 0\r\nfor i in range(n) : \r\n if arr[i] >= sm : \r\n ans += 1\r\n sm += arr[i]\r\nprint(ans)\r\n", "n = int(input())\r\nservice_times = list(map(int, input().split()))\r\n\r\n# 步骤1：按升序排序服务时间\r\nservice_times.sort()\r\n\r\n# 步骤2：初始化变量\r\ntotal_time = 0\r\nsatisfied_count = 0\r\n\r\n# 步骤3：计算满意人数上限\r\nfor time in service_times:\r\n if time >= total_time:\r\n satisfied_count += 1\r\n total_time += time\r\n\r\n# 步骤4：输出最大满意人数\r\nprint(satisfied_count)", "n = int(input())\ntimes = list(map(int, input().split()))\ntimes.sort()\n\na, tt = 0, 0\nfor t in times:\n if t >= tt:\n tt += t\n a += 1\n\nprint(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\nm=list(map(int,input().split()))\r\nm=sorted(m)\r\ny=len(m)\r\ncount=0\r\ns=0\r\nfor i in range(0, y):\r\n if m[i]>=s:\r\n count+=1\r\n else:\r\n m[i]=0\r\n s+=m[i]\r\n \r\nprint(count)", "# LUOGU_RID: 131344718\ninput();a=sorted(map(int,input().split()));c=d=0\nfor i in a:\n if i>=c:d+=1;c+=i\nprint(d)", "\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nxiao=0\r\nfor i in range(n):\r\n if l[i]>=xiao:\r\n c+=1\r\n xiao+=l[i]\r\nprint(c)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nans=k=0\r\ns.sort()\r\nfor i in s :\r\n if k<=i:\r\n ans+=1\r\n k+=i\r\n\r\nprint(ans)", "a=input()\r\nlist=list(map(int,input().split()))\r\nlist.sort()\r\nsum=0\r\np=0\r\nfor n in range(len(list)) :\r\n if sum<=int(list[n]):\r\n sum += int(list[n])\r\n p+=1\r\nprint(p)", "n = int(input())\r\ninfo = list(map(int,input().split()))\r\ninfo.sort()\r\ns = 0\r\nans = 0\r\n\r\nfor x in info:\r\n if x >= s:\r\n s += x\r\n ans += 1\r\n\r\nprint(ans)", "#周家恒化学与分子工程学院 2023年秋\r\nn=int(input())\r\naa=list(map(int,input().split()))\r\naa.sort()\r\nt=aa[0]\r\nm=1\r\nfor i in range(1,n):\r\n if aa[i]>=t:\r\n t+=aa[i]\r\n m+=1\r\nprint(m)", "n=int(input())\r\npersons=list(map(int,input().split()))\r\npersons.sort()\r\nindex=0\r\ntime=0\r\nr=0\r\nwhile index!=n:\r\n if time<=persons[index]:\r\n r+=1\r\n time+=persons[index]\r\n index+=1\r\n else:\r\n index+=1\r\nprint(r)", "# Compiled by zhou_tian from pku\r\n\r\nn = int(input())\r\ntimes = [int(i) for i in input().split()]\r\ntimes.sort()\r\n\r\ntts = times[0] # temporary_time_sum\r\nndp = 1 # not_disappointed_people\r\n\r\nfor i in range(1, n):\r\n if times[i] >= tts:\r\n ndp += 1\r\n tts += times[i]\r\n\r\nprint(ndp)", "n = int(input())\r\ns = list(map(int, input().split()))\r\ns = sorted(s)\r\nsu = 0\r\nans = 0\r\nfor i in range(n):\r\n if su <= s[i]:\r\n ans += 1\r\n su += s[i]\r\nprint(ans)", "# Queue\r\nn = int(input())\r\ns = list(map(int,input().split(\" \")))\r\ns.sort()\r\nx = [0]\r\ncount = 0\r\nz = []\r\nfor i in range(n):\r\n if s[i] < x[i]:\r\n x.append(x[i])\r\n z.append(s[i])\r\n else:\r\n count += 1\r\n x.append(x[i]+s[i])\r\nprint(count)", "n = int(input())\r\nT = list(map(int, input().split()))\r\nT.sort()\r\ntime = 0\r\nx = 0\r\nfor i in range(n):\r\n if T[i] >= time:\r\n time += T[i]\r\n x += 1\r\n else:\r\n pass\r\nprint(x)\r\n", "def max_not_disappoint(people):\r\n people.sort()\r\n result = 0\r\n cumulative_time = 0\r\n for i in range(n):\r\n if cumulative_time <= people[i]:\r\n result += 1\r\n cumulative_time += people[i]\r\n\r\n return result\r\n\r\n\r\nn = int(input())\r\nt_i = list(map(int, input().split()))\r\nprint(max_not_disappoint(t_i))", "#刘乐天 2300012105 生命科学学院\r\nn=int(input())\r\nt=list(map(int,input().split()))\r\nt.sort()\r\na=1\r\ns=[t[0]]\r\nfor i in range(1,n):\r\n if t[i]>=sum(s):\r\n s.append(t[i])\r\n a+=1\r\nprint(a)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Oct 26 16:09:00 2023\r\n\r\n@author: masiyu004\r\n\"\"\"\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nsum=0\r\nx=0\r\nfor i in a:\r\n if i>=sum:\r\n sum+=i\r\n x+=1\r\nprint(x)", "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# For fast IO use sys.stdout.write(str(x) + \"\\n\") instead of print\r\nimport sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nfor t in range(1):\r\n n = int(input().strip())\r\n arr = get_list()\r\n \r\n arr.sort()\r\n prefix_sum = 0\r\n count = 0\r\n # print(arr)\r\n \r\n for i in range(0, n):\r\n if prefix_sum <= arr[i]:\r\n count += 1\r\n prefix_sum += arr[i]\r\n print(count)", "def li(): return list(map(int,input().split()))\r\n\r\ndef nt(): return int(input())\r\n\r\ndef st(): return input()\r\n\r\nn=nt()\r\nL=li()\r\ncheck=list(L)\r\ncheck.sort()\r\nans=0\r\npre=0\r\nfor i in range(n):\r\n# print(pre,check[i])\r\n if check[i]>=pre:\r\n ans+=1\r\n pre+=check[i] \r\nprint(ans)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\nt=1\r\nsum=l[0]\r\nfor i in range(1,n):\r\n if l[i]>=sum:\r\n t+=1\r\n sum+=l[i]\r\n else:\r\n l[i]=0\r\nprint(t)", "#author 沈天健 2300011417\r\nn=int(input())\r\nt=[0]+[map(int,input().split())]\r\nt.sort()\r\nans=0\r\nsumm=0\r\nfor i in range(1,n+1):\r\n if t[i]<summ:\r\n continue\r\n ans+=1\r\n summ+=t[i]\r\nprint(ans)\r\n", "n = int(input())\r\npeople = [int(i) for i in input().split()]\r\npeople.sort()\r\ntime = 0\r\nsatisfaction = 0\r\nfor j in people:\r\n if j >= time:\r\n satisfaction += 1\r\n time += j\r\nprint(satisfaction)", "n = int(input())\nwaiters = list(map(int, input().split()))\nwaiters.sort()\ncounter, total_wait = 1, waiters[0]\n\nfor i in range(1, len(waiters)):\n if waiters[i] >= total_wait:\n total_wait += waiters[i]\n counter += 1\n\nprint(counter)", "n = int(input())\r\ntimelist = sorted(list(map(int,input().split())))\r\ntotal_time = 0\r\ncount = 0\r\nfor i in range(n):\r\n if total_time <= timelist[i]:\r\n count += 1\r\n total_time += timelist[i]\r\nprint(count)", "n = int(input())\r\nnum = list(map(int, input().split()))\r\nnum.sort()\r\nindex = 1\r\nans = 1\r\ntotal = num[0]\r\nwhile index < n:\r\n if num[index] >= total:\r\n ans += 1\r\n total += num[index]\r\n index += 1\r\nprint(ans)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Oct 30 16:51:35 2023\r\n\r\n@author: ZHAO XUDI\r\n\"\"\"\r\n\r\nn = int(input())\r\nti_list = list(map(int,input().split()))\r\n\r\nti_count=0\r\nnot_disappointed_count = 0\r\n\r\nnew_ti = sorted(ti_list)\r\nfor ti in new_ti:\r\n if ti_count<=ti:\r\n not_disappointed_count+=1\r\n ti_count+=ti\r\nprint(not_disappointed_count)\r\n \r\n", "n = int(input()) # ��е��\r\nserve_times = list(map(int, input().split())) # ��ʱ��б�\r\n\r\nserve_times.sort() # ��շ��ʱ��\r\n\r\nmax_not_disappointed = 0\r\ncurrent_wait_time = 0\r\n\r\nfor i in range(n):\r\n if current_wait_time <= serve_times[i]:\r\n max_not_disappointed += 1\r\n current_wait_time += serve_times[i]\r\n\r\nprint(max_not_disappointed)", "n = int(input())\r\nts = sorted([int(i) for i in input().split()])\r\ns = 0\r\nc = 0\r\nfor i in range(n):\r\n if ts[i] >= s:\r\n s += ts[i]\r\n c += 1\r\nprint(c)\r\n", "n = int(input())\r\nt = sorted(list(map(int, input().split())))\r\ntotal_time, total = 0, 0\r\ni, j = 0, -1\r\nfor i in range(n):\r\n while j < n - 1:\r\n j += 1\r\n if t[j] >= total_time:\r\n total += 1\r\n break\r\n total_time += t[j]\r\nprint(total)", "n = int(input())\r\nt = [int(i) for i in input().split()]\r\nt.sort()\r\ncnt = 0\r\npresum = 0\r\nfor a in t:\r\n if presum <= a:\r\n presum += a\r\n cnt += 1\r\nprint(cnt)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 24 16:21:19 2023\r\n\r\n@author: 2300011794\r\n\"\"\"\r\nn=int(input())\r\nq=list(map(int,input().split()))\r\nq.sort()\r\nsm=0\r\nfor i in range(1,n-1):\r\n sm+=q[i-1]\r\n if sm>q[i+1]:\r\n q[i]=0\r\n elif sm>q[i]:\r\n q[i]=0\r\nif sum(q[0:n-1])>q[-1]:\r\n q[-1]=0\r\nprint(n-q.count(0))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\npre=[0]\r\nans=0\r\nfor i in range(0,n):\r\n\tif pre[i]>l[i]:\r\n\t\tpre.append(pre[i])\r\n\telse:\r\n\t\tpre.append(pre[i]+l[i])\r\n\t\tans+=1\r\nprint(ans)\r\n", "people_quantity = int(input())\r\nwaiting_time_sequence = list(map(int, input().split()))\r\n\r\nwaiting_time_sequence.sort()\r\nwaiting_time = 0\r\nsatisfied_quantity = 0\r\n#print(waiting_time_sequence)\r\nfor i in range(0, people_quantity):\r\n if waiting_time <= waiting_time_sequence[i]:\r\n satisfied_quantity += 1\r\n else:\r\n waiting_time_sequence[i] = 0\r\n waiting_time += waiting_time_sequence[i]\r\n\r\nprint(satisfied_quantity)", "input();r,c=0,0\r\nfor i in sorted(map(int,input().split())):\r\n if r<=i:r+=i;c+=1\r\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sorted(a)\r\nt,l=0,0\r\nfor i in range(n):\r\n if t<=b[i]:\r\n t+=b[i]\r\n l+=1\r\nprint(l)", "n = int(input())\r\nwaiting_queue = list(map(int,input().split()))\r\nwaiting_queue.sort()\r\ntimes = 0\r\ni = 0\r\nsatisfy_man = 0\r\nwhile i < n:\r\n if times > waiting_queue[i]:\r\n i += 1\r\n else:\r\n times += waiting_queue[i]\r\n satisfy_man += 1\r\n i += 1\r\n\r\nprint(satisfy_man)", "n=int(input())\r\na=input().split()\r\ntime=[int(i) for i in a]\r\ntime.sort()\r\ncount=1\r\na=time[0]\r\nsum=a\r\nfor i in range(1,n):\r\n if time[i]>=sum:\r\n count+=1\r\n sum=sum+time[i]\r\n else:\r\n continue\r\nprint(count)", "import heapq\r\n\r\nn = int(input())\r\nt = list(map(int, input().split()))\r\n\r\npq = [] # priority queue of people (ti, i)\r\nfor i in range(n):\r\n heapq.heappush(pq, (t[i], i))\r\n\r\nnot_disappointed = 0\r\ntotal_waiting_time = 0\r\nwhile pq:\r\n ti, i = heapq.heappop(pq)\r\n if total_waiting_time <= ti:\r\n not_disappointed += 1\r\n total_waiting_time += ti\r\n else:\r\n continue # discard disappointed person\r\n\r\nprint(not_disappointed)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Oct 26 17:16:27 2023\r\n\r\n@author: 程卓 2300011733\r\n\"\"\"\r\n\r\nn = int(input())\r\nqueue = sorted([int(i) for i in input().split()])\r\nanswer = 0\r\nlength = 0\r\nfor i in range(n):\r\n if length <= queue[i]:\r\n length += queue[i]\r\n answer += 1\r\nprint(answer)\r\n#如果一个人已经不满意了，就把他放到队尾\r\n#没有的，连他所有的也要夺过来。——《新约·马太福音》", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Oct 26 15:33:24 2023\r\n\r\n@author: 苏柔德 2300011012\r\n\"\"\"\r\nn=int(input())\r\nqueue=list(map(int, input().split()))\r\nqueue=sorted(queue)\r\ntotal=0\r\ncount=0\r\nfor i in range(n):\r\n if queue[i]>=total:\r\n total+=queue[i]\r\n count+=1\r\nprint(count)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 24 15:28:09 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nn = int(input())\r\nls = list(map(int,input().split()))\r\nls.sort()\r\nwait = 0\r\nans = 0\r\nfor i in range(len(ls)) :\r\n if ls[i] >= wait :\r\n wait += ls[i]\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort();t=0;k=0\r\nfor i in range(n):\r\n if a[i]>=t:\r\n t+=a[i]\r\n k+=1\r\n else:\r\n a[i]=0\r\nprint(k)", "n=int(input())\r\nt_list=list(map(int,input().split()))\r\nt_list.sort()\r\nind=0;num=0\r\nfor i in range(n):\r\n if t_list[i]>=ind:\r\n num+=1\r\n ind+=t_list[i]\r\n else:\r\n num+=0\r\nprint(num)\r\n", "import bisect\r\ndef solve():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n a.sort()\r\n psum=a[0]\r\n count=1\r\n for i in range(1,n):\r\n if psum<=a[i]:\r\n count+=1\r\n psum+=a[i]\r\n print(count)\r\n \r\nsolve()", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Oct 26 19:43:14 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\nn=int(input())\r\nqueue=list(map(int,input().split()))\r\nqueue.sort()\r\ntime=0\r\npeople_not_mad=0\r\nfor i in queue:\r\n if time<=i:\r\n time+=i\r\n people_not_mad+=1\r\n else:\r\n pass\r\nprint(people_not_mad)", "int(input())\r\nqueue = list(map(int,input().split()))\r\nqueue.sort()\r\nsumm = 0\r\nfor i in range(len(queue)-1):\r\n flag = True\r\n summ += queue[i]\r\n for j in range(i+1,len(queue)):\r\n if queue[j] >= summ:\r\n a = queue.pop(j)\r\n queue.insert(i+1,a)\r\n flag = False\r\n break\r\n if flag:\r\n break\r\nsum_ = i = disappointed = 0\r\nwhile i < len(queue)-1:\r\n sum_ += queue[i]\r\n if sum_ > queue[i+1]:\r\n disappointed += 1\r\n i += 1\r\nprint(len(queue)-disappointed)\r\n\r\n\r\n", "\r\nn=int(input())\r\ntime=list(map(int,input().split()))\r\ntime.sort()\r\nanswer=0\r\ncurrent=0\r\nfor value in time:\r\n if value>=current:\r\n answer+=1\r\n current+=value\r\nprint(answer)\r\n\r\n\r\n", "n = int(input())\r\nm = sorted([int(i) for i in input().split()])\r\ns,t = 0,0\r\nfor i in range(n):\r\n if t <= m[i]:\r\n t += m[i]\r\n s += 1\r\nprint(s)", "#王天,2300011878\r\n#n个人，每个人ti时间，使等待时间少于ti的人最多\r\nn=int(input())\r\nt=list(map(int,input().split()))\r\nt.sort()\r\na=[]\r\nans=0\r\nfor i in range(n):\r\n if t[i]>=sum(a):\r\n ans+=1\r\n a.append(t[i])\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nmax1=0\r\nwait=0\r\nfor i in range(len(a)):\r\n if a[i]>=wait:\r\n max1+=1\r\n wait+=a[i]\r\nprint(max1)", "n = int(input())\r\nq = [int(x) for x in input().split()]\r\nq.sort()\r\nans = 0\r\ntime = 0\r\nfor x in q:\r\n if time <= x:\r\n ans += 1\r\n time += x\r\nprint(ans)", "N=int(input())\na = list(map(int, input().split()))\na.sort()\nsum=0\nans=0\nfor _ in a:\n if(sum<=_):\n ans+=1\n sum+=_\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\na=sorted(a)\r\nt=0;ans=0\r\nfor i in range(n):\r\n if a[i]>=t:\r\n ans+=1\r\n t+=a[i]\r\nprint(ans)\r\n#不满意的人直接踢到队尾去，相当于不满意的人不算服务时间", "n = int(input())\r\nd = sorted(list(map(int, input().split())))\r\n\r\nhappy = 0\r\n\r\nt = 0\r\nfor person in d:\r\n if t <= person:\r\n happy += 1\r\n t += person\r\n\r\nprint(happy)", "n = int(input())\r\nqueue = sorted(list(map(int, input().split())))\r\nwait_time = 0\r\nsatisfy = 0\r\nfor man in queue:\r\n if man >= wait_time:\r\n satisfy += 1\r\n wait_time += man\r\nprint(satisfy)", "n=int(input())\r\ntime=0\r\nnumber=0\r\na=[int(i) for i in input().split()]\r\na=sorted(a)\r\nfor i in a:\r\n if time<=i:\r\n time+=i\r\n number+=1\r\nprint(number)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 24 13:14:03 2023\r\n\r\n@author: zinc 2300012115\r\n\"\"\"\r\n\r\nn = int(input())\r\ntimes = [int(x) for x in input().split()]\r\ntimes.sort()\r\ndp = [0](n+1)\r\ncnt = 0\r\nfor i in range(n):\r\n if times[i] >= dp[i-1]:\r\n cnt += 1\r\n dp[i] = dp[i-1] + times[i]\r\n else:\r\n dp[i] = dp[i-1]\r\nprint(cnt)\r\n", "t = int(input())\r\nc = 0\r\ns = 0\r\nfor i in sorted(map(int, input().split())) :\r\n if s <= i : s += i; c += 1\r\n\r\nprint(c)", "n=int(input())\r\nservetime=sorted(list(map(int,input().split())))\r\nwaittime,cnt=0,n\r\nfor i in range(n):\r\n if servetime[i]>=waittime:\r\n waittime+=servetime[i]\r\n else:\r\n cnt-=1\r\nprint(cnt)", "n=int(input())\r\narr=sorted(list(map(int,input().split())))\r\nr=0\r\nc=0\r\nfor i in arr:\r\n if r<=i:\r\n c+=1\r\n r+=i\r\n \r\nprint(c)\r\n", "n=int(input())\r\ntime=list(map(int,input().split()))\r\ntime.sort()\r\nline=time.copy()\r\nwaiting_time=time[0]\r\nfor i in range(1,n):\r\n if time[i]>=waiting_time:\r\n waiting_time+=time[i]\r\n else:\r\n line[i]=0\r\nprint(n-line.count(0))", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 24 15:13:01 2023\r\n\r\n@author: ghp\r\n\"\"\"\r\n\r\nn=int(input())\r\ntime=list(map(int,input().split()))\r\ntime.sort()\r\nk=0\r\nx=0\r\nfor i in range(n):\r\n if k<=time[i]:\r\n k+=time[i]\r\n x+=1\r\nprint(x)", "n = int(input())\r\nserve_time = list(map(int, input().split()))\r\nserve_time.sort()\r\n\r\nans = 0\r\nsum_time = 0\r\n\r\nfor time in serve_time:\r\n if sum_time <= time:\r\n ans += 1\r\n sum_time += time\r\n\r\nprint(ans)\r\n", "n=int(input())\r\narr=[int(h) for h in input().split()]\r\narr.sort()\r\nans=0\r\nsum=0\r\nh=0\r\nwhile h<n:\r\n if sum<=arr[h]:\r\n ans+=1\r\n sum+=arr[h]\r\n h+=1 \r\nprint(ans) \r\n ", "n=int(input())\npeople_time=list(map(int,input().split()))\npeople_time=sorted(people_time)\npeople_chart=[]\nsum_of_before_time=0\ndisappointed_people=0 \nsum_of_before_time=people_time[0]\nfor i in range(1,n):\n if people_time[i]>=sum_of_before_time:\n # print(sum_of_before_time,people_time[i],sep=\",\")\n sum_of_before_time+=people_time[i]\n else:\n #print(\"disappointes people are\",people_time[i])\n disappointed_people+=1 \n\nprint(n-disappointed_people)\n\n ", "n=int(input())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\nm=1\r\nt=s[0]\r\nfor i in s[1:]:\r\n if i>=t:\r\n t+=i\r\n m+=1\r\nprint(m)", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\na=list(map(int,input().strip().split()))\r\na.sort()\r\ncur=ans=0\r\nfor i in range(n):\r\n if a[i]>=cur:\r\n ans+=1\r\n cur+=a[i]\r\nprint(ans)", "#蒋世刚2300016304\r\nn=input()\r\na=list(map(int,input().split()))\r\na.sort()\r\nt=0\r\nnum=0\r\nfor i in a:\r\n if i>=t:\r\n t=t+i\r\n num+=1\r\nprint(num)\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nqueue = list(map(int, input().split()))\r\n\r\n# Sort queue in ascending order\r\nqueue.sort()\r\n\r\ncount = 0\r\nwaiting_time = 0\r\n\r\nfor i in range(n):\r\n if waiting_time <= queue[i]:\r\n count += 1\r\n waiting_time += queue[i]\r\n \r\nprint(count)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\n\r\ntime_passed = 0\r\ncount = 0\r\nfor i in a:\r\n if i >= time_passed:\r\n time_passed += i\r\n count += 1\r\n\r\nprint(count)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ntimes = sorted([int(x) for x in input().split()])\r\n\r\ntot = 0\r\ncnt = 0\r\n\r\nfor idx, t in enumerate(times):\r\n if tot <= times[idx]:\r\n cnt += 1\r\n tot += times[idx]\r\n\r\nprint(cnt)", "# 李城岳生命科学学院 2300012106\r\nnumber = int(input())\r\norigin = list(map(int, input().split()))\r\norigin.sort()\r\nwait = 0\r\ncount = 0\r\nfor e in range(number):\r\n if origin[e] >= wait:\r\n wait += origin[e]\r\n count += 1\r\n else:\r\n continue\r\nprint(count)\r\n", "n = int(input())\r\nl = list(map(int , input().split()))\r\nl.sort()\r\nl0 = []\r\nsum = 0\r\n\r\nfor i in range(n):\r\n if l[i] >= sum:\r\n l0.append(l[i])\r\n sum += l[i]\r\n\r\nprint(str(len(l0)))", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Tue Oct 24 16:34:03 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\n#此题思路有一点难想，就是让满意的人先等。看了题解后明白的\nn=int(input())\nnums=list(map(int,input().split()))\nnums.sort()\nk=0\ntime=0\nfor i in range(n):\n if nums[i]>=time:\n time+=nums[i]\n k+=1\nprint(k)\n \n", "# 2300012142 林烨\r\nn = input()\r\nn = 0\r\nqueue = sorted(list(map(int,input().split())))\r\nwaiting_time = 0\r\nfor i in queue:\r\n if i >= waiting_time:\r\n waiting_time += i\r\n n += 1\r\nprint(n)", "n = int(input())\r\ntime = list(map(int, input().split(\" \")))\r\ntime.sort()\r\nt = 0\r\nsatisfy_n = 0\r\n\r\nfor i in range(n):\r\n if t <= time[i]:\r\n t += time[i]\r\n satisfy_n += 1\r\n\r\nprint(satisfy_n)", "# import sys\r\n# input=sys.stdin.buffer.readline\r\nfrom functools import reduce\r\nfrom math import gcd\r\nfrom math import floor\r\nfrom math import inf\r\ninf = float('inf')\r\nfrom math import ceil\r\nfrom collections import Counter\r\n# for _ in range(int(input())):\r\n # W,H=map(int,input().split())\r\n # n,k=map(int,input().split())\r\n # =map(int,input().split())\r\n # n=int(input())\r\n # ans=0\r\n # for _ in range(n):\r\n # x,y=map(int,input().split())\r\n # if not(k<=y and k>=x):\r\n # ans+=1\r\n # if n>ans and ans!=0:\r\n # print(\"YES\")\r\n # else:\r\n # print(\"NO\") \r\nn=input()\r\nnums=list(map(int,input().split()))\r\nnums.sort()\r\nans=0\r\ncount=0\r\nfor item in nums:\r\n if ans<=item:\r\n count+=1\r\n ans+=item\r\nprint(count) \r\n\r\n \r\n ", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 24 16:03:31 2023\r\n\r\n@author: LiuzhiyuanPKUCoE\r\n\r\n\"\"\"\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\nt=x=0\r\nfor i in l:\r\n if i>=t:\r\n t+=i\r\n x+=1\r\n else:\r\n continue\r\nprint(x)\r\n ", "x=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nsum=l[0]\r\ndis=0\r\nfor i in range(1,x):\r\n if sum>l[i]:\r\n i+=1\r\n dis+=1\r\n else:\r\n sum+=l[i]\r\n \r\nprint(x-dis) ", "n = int(input())\nq = sorted(list(map(int, input().split())))\nsum = q[0]\nsatisfied = 1\nfor i in range(1, n):\n if q[i] >= sum:\n satisfied += 1\n sum += q[i]\nprint(satisfied)\n", "n = int(input())\na = list(map(int, input().split()))\n\na.sort()\nans = 1\n\ntime = a[0]\n\n#print(a)\nfor i in range(1, n):\n #print(a[i], time)\n if(a[i] >= time):\n time += a[i]\n ans += 1\n\nprint(ans)\n\n\t\t \t \t \t\t \t \t \t \t\t \t \t\t", "input()\r\nc = 0\r\nt = 0\r\nfor i in sorted(map(int,input().split())):\r\n if t <= i:\r\n t += i\r\n c += 1\r\nprint(c)", "n = int(input())\r\nt = list(map(int,input().split()))\r\nt.sort()\r\ntsum = 0\r\nwhile len(t) > 0 and tsum <= t[-1]:\r\n for i in range(len(t)):\r\n if t[i] >= tsum:\r\n tsum += t[i]\r\n t.remove(t[i])\r\n break\r\nprint(n - len(t))", "n = int(input())\r\ntime = list(map(int, input().split()))\r\ntime.sort()\r\ntot = 0\r\nans = 0\r\nfor i in range(0, n):\r\n if tot <= time[i]:\r\n ans += 1\r\n tot += time[i]\r\nprint(ans)\r\n# 化院荆屹然 2300011884\r\n", "def max_not_disappointed(n, times):\n times.sort() # Sort the list of service times.\n total_time = 0\n count = 0\n for t in times:\n if total_time <= t: # Check if the person is not disappointed.\n count += 1\n total_time += t\n return count\n\n# Input\nn = int(input())\ntimes = list(map(int, input().split()))\n\n# Process\nresult = max_not_disappointed(n, times)\n\n# Output\nprint(result)\n\n\t \t\t \t\t \t \t \t \t\t \t\t\t\t\t \t", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 24 18:41:08 2023\r\n\r\n@author: 赵语涵2300012254\r\n\"\"\"\r\n\r\nn = int(input())\r\nnum = sorted(list(map(int,input().split())))\r\ntotal,i,count = num[0],1,1\r\nwhile i <= n-1:\r\n if num[i]>=total:\r\n total += num[i]\r\n i += 1\r\n count += 1\r\n else:\r\n i += 1\r\nprint(count)", "import bisect as bi\r\nn=int(input())-1;A=sorted(map(int,input().split()));b=A[0];t=1;i=0;del A[0]\r\nwhile i<n:b+=A[i];i=bi.bisect_left(A,b);t+=1\r\nprint(t)", "n = int(input()) # 输入队伍数量\ntimes = list(map(int, input().split())) # 输入每支队伍完成比赛所需的时间\ntimes.sort() # 将完成时间从小到大排序\n\nresult = 0 # 初始化完成比赛的队伍数量为0\nlast_time = 0 # 初始化上一支队伍的完成时间为0\nfor i in range(n):\n if times[i] >= last_time:\n result += 1 # 如果下一支队伍的完成时间大于等于上一支队伍的完成时间，则认为他们可以同时进行比赛\n last_time += times[i] # 更新上一支队伍的完成时间为下一支队伍的完成时间\n\nprint(result) # 输出最大可以同时进行比赛的队伍数量\n\n\n \n \n \n \n \n \n \n\n\n\n\n\n\n", "# https://codeforces.com/problemset/problem/545/D\n\ndef handle() -> int:\n input()\n values = sorted([int(s) for s in input().split(\" \")])\n\n total_wait_time = 0\n total = 0\n\n for value in values:\n if total_wait_time <= value:\n total_wait_time += value\n total += 1\n return total\n\nprint(handle())\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\np = [(t[i], i) for i in range(n)]\r\np.sort()\r\n\r\nnot_disappointed = 0\r\ntotal_waiting_time = 0\r\nfor ti, i in p:\r\n if total_waiting_time <= ti:\r\n not_disappointed += 1\r\n total_waiting_time += ti\r\n else:\r\n continue \r\nprint(not_disappointed)", "n=int(input())\r\ns=[int(i) for i in input().split()]\r\ns.sort()\r\nsumm=0\r\nnum=0\r\nfor i in range(n):\r\n if summ>s[i]:\r\n num+=1\r\n else:\r\n summ+=s[i]\r\n \r\nprint(n-num)", "n = int(input())\r\nt = list(map(int, input().split()))\r\nt.sort()\r\n\r\ndef find(v, x):\r\n l, r = x, n - 1\r\n while l != r:\r\n mid = l + r >> 1\r\n if t[mid] >= v:\r\n r = mid\r\n else:\r\n l = mid + 1\r\n return l\r\n\r\ns, cnt = 0, 0\r\nfor i in range(n):\r\n if s > t[n - 1]:\r\n break \r\n if s > t[i]:\r\n x = find(s, i + 1)\r\n tmp = t[x]\r\n t[x] = t[i]\r\n t[i] = tmp\r\n s += t[i]\r\n cnt += 1\r\nprint(cnt)", "#王铭健，工学院 2300011118\r\nn = int(input())\r\ncount = 1\r\nif n == 1:\r\n print(\"1\")\r\n exit()\r\nnum_list = sorted(list(map(int, input().split())))\r\nsum = num_list[0]\r\nfor i in range(1, n):\r\n if num_list[i] >= sum:\r\n count += 1\r\n sum += num_list[i]\r\nprint(count)", "n = int(input())\r\ntime = 0\r\nans = 0\r\nqueue = sorted(list(map(int,input().split())))\r\nfor i in queue:\r\n if time <= i:\r\n time += i\r\n ans += 1\r\nprint(ans)", "comp = [0]\r\nn = int(input())\r\nsatis = 0\r\nvalores = list(map(int,(input().strip().split())))\r\nvalores.sort()\r\ntiempo = 0\r\nfor valor in valores:\r\n if valor >= tiempo:\r\n tiempo += valor\r\n satis += 1\r\n else:\r\n continue\r\nprint(satis)", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nlist1.sort()\r\nans=0\r\nt=0\r\nfor i in list1:\r\n if i >= t:\r\n t+=i\r\n ans+=1\r\n else:\r\n continue\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nx=0\r\nm=0\r\nwhile l:\r\n while l and l[-1]<x:\r\n l.pop()\r\n if l:\r\n x+=l[-1]\r\n l.pop()\r\n m+=1\r\nprint(m)", "#!/usr/bin/python\r\nn=int(input())\r\ntime=list(map(int,input().split()))\r\ntime.sort()\r\nsatisfied=1\r\nsat_sum=time[0]\r\nfor i in range(1,n):\r\n if time[i] >= sat_sum:\r\n satisfied+=1\r\n sat_sum+=time[i]\r\nprint(satisfied)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nt = list(map(int, input().split()))\r\nt.sort()\r\ns = 0\r\nans = 0\r\nfor i in t:\r\n if s <= i:\r\n s += i\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\nservetime=list(map(int,input().split()))\r\nservetime.sort()\r\nwaittime=[0 for _ in range(n)]\r\ncnt=n\r\nfor i in range(n):\r\n if servetime[i]>=waittime[i-1]:\r\n waittime[i]=waittime[i-1]+servetime[i]\r\n else:\r\n waittime[i]=waittime[i-1]\r\n cnt-=1\r\nprint(cnt)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ncount=1#1st yes\r\ns=0\r\nfor i in range(1,n):\r\n s+=l[i-1]\r\n if s>l[i]:\r\n l[i]=0\r\n else:\r\n count+=1\r\nprint(count)", "n=int(input())\r\ntimes=list(map(int,input().split()))\r\ntimes.sort()\r\ntotal_time=0\r\nfor i in range(n): \r\n if total_time>times[i]:\r\n times[i]=0\r\n total_time+=times[i]\r\nprint(len(times)-times.count(0))", "n = int(input())\r\n\r\na = sorted(list(map(int, input().split())))\r\n\r\nsm = 0\r\nans = 0\r\n\r\nfor i in range(n):\r\n if sm <= a[i]:\r\n sm += a[i]\r\n ans += 1\r\n\r\nprint(ans)\r\n", "input()\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nsum,satis=0,0\r\nfor i in range(len(l)):\r\n if l[i]>=sum:\r\n satis+=1\r\n sum+=l[i]\r\nprint(satis)", "from sys import stdin;input = lambda: stdin.readline().rstrip('\\r\\n')\r\ninput();r,s=0,0\r\nfor i in sorted(map(int,input().split())):\r\n if s<=i:s+=i;r+=1\r\nprint(r)\r\n", "n = int(input())\r\nori_que = list(map(int, input().split()))\r\nque = sorted(ori_que)\r\nwait = 0\r\ndis = 0\r\nfor i in range(n):\r\n if wait <= que[i]:\r\n wait += que[i]\r\n else:\r\n dis += 1\r\nprint(n - dis)", "n=int(input())\r\ntime=list(map(int,input().split()))\r\ntime.sort()\r\ns=0\r\ncount=0\r\nfor i in range(n):\r\n if time[i]>=s:\r\n s+=time[i]\r\n count+=1\r\nprint(count)", "n = int(input())\r\nif n == 1:\r\n print(1)\r\nelse:\r\n queue = list(map(int, input().split()))\r\n least = min(queue) # 对于最小元问题单独处理\r\n number_least = queue.count(least)\r\n queue2 = set()\r\n queue2.update(queue)\r\n most=max(queue2)\r\n queue = sorted(queue2)\r\n sum_ = 0\r\n ans = 0\r\n if number_least > 1:\r\n sum_ += least\r\n ans += 1\r\n i = 1\r\n while True:\r\n sum_ += least\r\n ans += 1\r\n if sum_ > most:\r\n break\r\n while queue[i] < sum_:\r\n i += 1\r\n least = queue[i]\r\n print(ans)", "n=int(input())\r\ntlis=list(map(int,input().split()))\r\ntlis.sort()\r\n#print(tlis)\r\nk=0\r\nsuum=0\r\nfor i in range(0,len(tlis)):#至少可以保证一个人满意\r\n if tlis[i]>=suum:#-tlis[0]\r\n suum+=tlis[i]\r\n #print(tlis[i],\"tlis[i]\")\r\n #print(suum,\"suum\")\r\n k+=1\r\n else:\r\n #print(tlis[i],\"else\")\r\n continue\r\nprint(k)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nm=[0]\r\nt=len(l)\r\ni=0\r\ns=0\r\nwhile i < t:\r\n if l[i]>=m[-1]:\r\n s+=l[i]\r\n m.append(s)\r\n i+=1\r\nprint(len(m)-1)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 24 20:48:13 2023\r\n\r\n@author: tmh\r\n\"\"\"\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\n\r\nsum_time = 0\r\nresult = 0\r\n\r\nfor i in range(n):\r\n if sum_time <= lst[i]:\r\n sum_time += lst[i]\r\n result += 1\r\n\r\nprint(result)\r\n", "n = int(input())\r\ns = input()\r\ns = list(map(int, s.split()))\r\ns.sort()\r\ncount = 0\r\ntime = 0\r\nindex = 0\r\nwhile index < n:\r\n if s[index] >= time:\r\n time += s[index]\r\n count += 1\r\n index += 1\r\nprint(count)\r\n", "num=int(input())\nlisttemp=[int(x) for x in input().split()]\nlisttemp.sort()\noklist=listtemp[0]\nans=1\nfor i in range(1,num):\n if listtemp[i]>=oklist:\n oklist+=listtemp[i]\n ans+=1\nprint(ans)\n\n", "input()\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nsums = 0\r\ncnt = 0\r\nfor i in l:\r\n if i >= sums:\r\n cnt += 1\r\n sums += i\r\nprint(cnt)", "n = int(input())\n\ntimes = list(map(int, input().split()))\n\ntimes.sort()\ntotTime = 0\nres = 0\n\nfor time in times:\n if totTime <= time:\n res+=1\n totTime+=time\n\nprint(res)\n\t \t \t\t\t \t \t \t\t\t \t\t \t", "n=int(input())\r\ntime=list(map(int,input().split()))\r\ntime.sort()\r\ndis=[]\r\nnum=0\r\nsumi=0\r\nsumdis=0\r\nfor i in range(n):\r\n if time[i]>=sumi-sumdis:\r\n num+=1\r\n else:\r\n sumdis+=time[i]\r\n sumi+=time[i]\r\nprint(num)", "n=int(input())\r\nqueue=sorted(list(map(int,input().split())))\r\n\r\ndef Sort(queue):\r\n new_queue=[]\r\n wait=0\r\n \r\n for i in range(n):\r\n if queue[i]>=wait:\r\n new_queue.append(queue[i])\r\n wait+=queue[i]\r\n return len(new_queue) \r\n\r\nprint(Sort(queue))", "n = int(input())\r\nt = list(map(int, input().split()))\r\nt.sort()\r\nA=0\r\nwait = 0\r\nfor ts in t:\r\n if wait <= ts:\r\n A += 1\r\n wait += ts \r\nprint(A) ", "input()\na = list(map(int, input().split()))\nwait = 0\nans = 0\nfor n in sorted(a):\n if n >= wait:\n ans += 1\n wait += n\nprint(ans)\n", "n = int(input())\r\nx = ([int(i) for i in input().split()])\r\nx.sort()\r\n#print(x)\r\nc, s = 0, 0\r\nfor i in range(n):\r\n if s <= x[i]:\r\n c += 1\r\n s += x[i]\r\n #print(s)\r\nprint(c)", "people_num=int(input())\r\npeople_time=[]\r\nfor i in input().split():\r\n people_time.append(int(i))\r\npeople_time.sort()\r\ntest=True\r\nfor j in range(people_num-1):\r\n test_num=0\r\n for k in range(j):\r\n test_num+=people_time[k]\r\n test_num+=people_time[j]\r\n if test_num in people_time:\r\n position=people_time.index(test_num)\r\n people_time[j+1] , people_time[position] = test_num , people_time[j+1]\r\n elif test_num > people_time[-1]:\r\n test=False\r\n break\r\n else:\r\n for p in range(j,people_num):\r\n if people_time[p] > test_num:\r\n people_time[j+1] , people_time[p] = people_time[p] , people_time[j+1]\r\n break\r\nif test:\r\n print(people_num)\r\nelse:\r\n print(j+1)\r\n", "n=int(input())\r\ntimes=list(map(int,input().split()))\r\ntimes.sort()\r\nans=0\r\ntime=0\r\nfor i in range(n):\r\n if times[i]>=time:\r\n ans+=1\r\n time+=times[i]\r\nprint(ans)\r\n", "n = int(input())\r\nqueue = list(map(int,input().split()))\r\nqueue.sort()\r\ntime = 0;num=0\r\nfor i in range (n):\r\n if queue[i]>= time :\r\n num+=1\r\n time+=queue[i]\r\nprint(num)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\ntime = 0\r\nans = 0\r\nfor i in range(n):\r\n if time <= l[i]:\r\n ans += 1\r\n time += l[i]\r\nprint(ans)\r\n", "#梁慧婷 2300012153 生命科学学院\r\nn = int(input())\r\nqueue = sorted(list(map(int,input().split())))\r\ntime = 0\r\npeople = len(queue)\r\nfor i in range(n):\r\n if queue[i]>=time:\r\n time += queue[i]\r\n else:\r\n people -= 1\r\nprint(people)", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nsum = 0\r\nans = 0\r\nfor i in a:\r\n if (i >= sum):\r\n ans += 1\r\n sum += i\r\nprint(ans)", "n = int(input())\r\nqueue = list(map(int,input().split()))\r\nqueue.sort()\r\nqueue1 = [queue[0]]\r\nfor i in queue[1:]:\r\n if sum(queue1) <= i:\r\n queue1.append(i)\r\nprint(len(queue1))", "input()\nr,s=0,0\nfor i in sorted(map(int,input().split())):\n if s<=i:s+=i;r+=1\nprint(r)\n\n\t \t\t\t \t\t\t \t\t\t\t \t \t \t\t\t \t", "from collections import defaultdict, deque, Counter\r\nfrom heapq import heapify, heappop, heappush\r\n\r\ndef I(): return int(input())\r\ndef II(): return map(int, input().split())\r\ndef IL(): return list(map(int, input().split()))\r\ndef SIL(): return sorted(map(int, input().split()))\r\n\r\ndef main():\r\n t = 1\r\n # t = int(input())\r\n for _ in range(t):\r\n run_test_case()\r\n\r\ndef run_test_case():\r\n n = I()\r\n arr = SIL()\r\n result, running_sum = n, 0\r\n for i in range(n):\r\n if running_sum > arr[i]:\r\n result -= 1\r\n continue\r\n running_sum += arr[i]\r\n print(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "n=int(input())\r\nlt=list(map(int,input().split()))\r\nlt.sort()\r\nSum,ans=0,0\r\nfor i in lt:\r\n if i>=Sum:\r\n Sum+=i\r\n ans+=1\r\nprint(ans)", "\r\nn = int(input())\r\nque = list(map(int,input().split()))\r\nque.sort()\r\n\r\nsum = 0\r\nindex = 0\r\ncnt = 0\r\nwhile index<n:\r\n if que[index]>=sum:\r\n cnt+=1\r\n sum+=que[index]\r\n index+=1\r\nprint(cnt)", "n=int(input())\nans=1\nqueue=list(map(int,input().split()))\nqueue.sort()\nsum=queue[0]\nfor i in range(1,len(queue)):\n if queue[i]<sum:\n queue[i]=0\n sum+=queue[i]\nsum=queue[0]\nfor i in range(1,len(queue)):\n if queue[i]>=sum:\n ans+=1\n sum+=queue[i]\nprint(ans)" ]	{"inputs": ["5\n15 2 1 5 3", "15\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "10\n13 2 5 55 21 34 1 8 1 3", "10\n8 256 16 1 2 1 64 4 128 32", "10\n10000 40000 10000 50000 20000 100000 10000 100 30000 500", "1\n1000000000", "15\n9 11 45 86 52 65 35 3 93 7 21 45 15 11 39", "20\n16839799 17525904 91276752 42650694 60106463 12243176 54892123 25142243 16015971 41250998 11150057 6994983 67700784 16562412 82163675 46178521 33914268 91966607 93976858 84100064", "26\n1000 4110030 64221 131521030 942374833 1003 2055015 32110 513757 16440130 263042057 32880256 128439 557559573 16051 8220066 469240078 65760513 256878 790176315 4012 2005 1027508 928528684 8030 805074697"], "outputs": ["4", "2", "6", "10", "6", "1", "6", "5", "21"]}	UNKNOWN	PYTHON3	CODEFORCES	158
91ddbbe8aa042ec08491c7c25d7aba7b	Triangle	At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper he drew three points with integer coordinates, and joined them with segments of straight lines, then he showed the triangle to Peter. Peter said that Bob's triangle is not right-angled, but is almost right-angled: the triangle itself is not right-angled, but it is possible to move one of the points exactly by distance 1 so, that all the coordinates remain integer, and the triangle become right-angled. Bob asks you to help him and find out if Peter tricks him. By the given coordinates of the triangle you should find out if it is right-angled, almost right-angled, or neither of these. The first input line contains 6 space-separated integers x1,<=y1,<=x2,<=y2,<=x3,<=y3 — coordinates of the triangle's vertices. All the coordinates are integer and don't exceed 100 in absolute value. It's guaranteed that the triangle is nondegenerate, i.e. its total area is not zero. If the given triangle is right-angled, output RIGHT, if it is almost right-angled, output ALMOST, and if it is neither of these, output NEITHER. Sample Input 0 0 2 0 0 1 2 3 4 5 6 6 -1 0 2 0 0 1 Sample Output RIGHT NEITHER ALMOST	[ "class point:\n\tdef __init__(self, x=0, y=0):\n\t\tself.x = x\n\t\tself.y = y\n\tdef trans(self, d):\n\t\treturn point(self.x + d[0], self.y + d[1])\ndef cross(a, b, c): return (a.x-c.x) * (b.y-c.y) - (a.y-c.y) * (b.x-c.x)\ndef dot(a, b, c): return (a.x-c.x) * (b.x-c.x) + (a.y-c.y) * (b.y-c.y)\ndef isRight(a, b, c):\n\tif cross(a, b, c) == 0: return False\n\treturn dot(a, b, c) == 0 or dot(a, c, b) == 0 or dot(b, c, a) == 0\nd = ((0, 1), (0, -1), (1, 0), (-1, 0))\ndef solve(a, b, c):\n\tif isRight(a, b, c): return 'RIGHT'\n\tfor i in d:\n\t\tif isRight(a.trans(i), b, c): return 'ALMOST'\n\tfor i in d:\n\t\tif isRight(a, b.trans(i), c): return 'ALMOST'\n\tfor i in d:\n\t\tif isRight(a, b, c.trans(i)): return 'ALMOST'\n\treturn 'NEITHER'\n\nx1, y1, x2, y2, x3, y3 = map(int, input().split())\nprint(solve(point(x1, y1), point(x2, y2), point(x3, y3)))\n\t\t\t\t \t \t\t \t\t\t \t \t\t\t\t \t\t", "def sizeSq(x1,y1,x2,y2):\r\n return (x1-x2)2 + (y1-y2)2 \r\n\r\ndef isRight(lst):\r\n ssq = [sizeSq(lst[2i % 6], lst[(2i+1) % 6], lst[(2i+2) % 6], lst[(2i+3) % 6]) for i in range(3)]\r\n ssq.sort()\r\n return ssq[0] > 0 and ssq[0] + ssq[1] == ssq[2] \r\n\r\nlst = list(map(int, input().split()))\r\n\r\nif isRight(lst):\r\n print(\"RIGHT\")\r\nelse:\r\n for i in range(6):\r\n cpy = lst.copy()\r\n cpy[i] += 1\r\n if isRight(cpy):\r\n print(\"ALMOST\")\r\n break\r\n cpy[i] -= 2\r\n if isRight(cpy):\r\n print(\"ALMOST\")\r\n break\r\n else:\r\n print(\"NEITHER\")", "def dist(x1, y1, x2, y2):\r\n return (x2 - x1) 2 + (y2 - y1) 2\r\n \r\ndef right_triangle(x1,y1,x2,y2,x3,y3):\r\n first = dist(x1, y1, x2, y2)\r\n second = dist(x1, y1, x3, y3)\r\n third = dist(x2, y2, x3, y3)\r\n mas1 = [first, second, third]\r\n mas1.sort()\r\n if mas1[0] + mas1[1] == mas1[2] and mas1[0] * mas1[1] * mas1[2]:\r\n return True\r\n else:\r\n return False\r\n \r\nx1,y1,x2,y2,x3,y3 = map(int,input().split())\r\nres = right_triangle(x1,y1,x2,y2,x3,y3)\r\n \r\nmas2 = []\r\n \r\nif res :\r\n print('RIGHT')\r\nelse:\r\n mas2.append(right_triangle(x1 + 1, y1, x2, y2, x3, y3))\r\n mas2.append(right_triangle(x1 - 1, y1, x2, y2, x3, y3))\r\n mas2.append(right_triangle(x1, y1 + 1, x2, y2, x3, y3))\r\n mas2.append(right_triangle(x1, y1 - 1, x2, y2, x3, y3))\r\n mas2.append(right_triangle(x1, y1, x2 + 1, y2, x3, y3))\r\n mas2.append(right_triangle(x1, y1, x2 - 1, y2, x3, y3))\r\n mas2.append(right_triangle(x1, y1, x2, y2 + 1, x3, y3))\r\n mas2.append(right_triangle(x1, y1, x2, y2 - 1, x3, y3))\r\n mas2.append(right_triangle(x1, y1, x2, y2, x3 + 1, y3))\r\n mas2.append(right_triangle(x1, y1, x2, y2, x3 - 1, y3))\r\n mas2.append(right_triangle(x1, y1, x2, y2, x3, y3 + 1))\r\n mas2.append(right_triangle(x1, y1, x2, y2, x3, y3 - 1))\r\n if True in mas2: print('ALMOST')\r\n else: print('NEITHER')\n# Fri Oct 16 2020 22:31:04 GMT+0300 (Москва, стандартное время)\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\ndef right(x1,y1,x2,y2,x3,y3):\r\n\tx2-=x1\r\n\ty2-=y1\r\n\tx3-=x1\r\n\ty3-=y1\r\n\tif x2y3-x3y2 == 0:\r\n\t\treturn False\r\n\tl1 = x22+y22\r\n\tl2 = x32+y32\r\n\tl3 = (x3-x2)2+(y3-y2)2\r\n\tif l1+l2 == l3 or l2+l3 == l1 or l1+l3 == l2:\r\n\t\treturn True\r\n\treturn False\r\n\r\nx = list(mints())\r\nif right(x):\r\n\tprint(\"RIGHT\")\r\n\texit(0)\r\nfor i in range(3):\r\n\tfor dx,dy in (1,0),(-1,0),(0,1),(0,-1):\r\n\t\tx[2i] += dx\r\n\t\tx[2i+1] += dy\r\n\t\tif right(x):\r\n\t\t\tprint(\"ALMOST\")\r\n\t\t\texit(0)\r\n\t\tx[2i] -= dx\r\n\t\tx[2i+1] -= dy\r\nprint(\"NEITHER\")\r\n", "def check(a1, a2, b1, b2, c1, c2):\r\n x = (a1 - b1) * 2 + (a2 - b2) 2\r\n y = (b1 - c1) 2 + (c2 - b2) 2\r\n z = (a1 - c1) 2 + (c2 - a2) ** 2\r\n l1 = [x,y,z]\r\n l1.sort()\r\n if l1[0] + l1[1] == l1[2] and x != 0 and y != 0 and z != 0:\r\n return True\r\n else :\r\n return False\r\n\r\na1, a2, b1, b2, c1, c2 = map(int, input().split())\r\n\r\nif check(a1,a2,b1,b2,c1,c2):\r\n print(\"RIGHT\")\r\nelif check(a1+1,a2,b1,b2,c1,c2) or check(a1-1,a2,b1,b2,c1,c2):\r\n print(\"ALMOST\")\r\nelif check(a1,a2+1,b1,b2,c1,c2) or check(a1,a2-1,b1,b2,c1,c2):\r\n print(\"ALMOST\")\r\nelif check(a1,a2,b1+1,b2,c1,c2) or check(a1,a2,b1-1,b2,c1,c2):\r\n print(\"ALMOST\")\r\nelif check(a1,a2,b1,b2+1,c1,c2) or check(a1,a2,b1,b2-1,c1,c2):\r\n print(\"ALMOST\")\r\nelif check(a1,a2,b1,b2,c1+1,c2) or check(a1,a2,b1,b2,c1-1,c2):\r\n print(\"ALMOST\")\r\nelif check(a1,a2,b1,b2,c1,c2+1) or check(a1,a2,b1,b2,c1,c2-1):\r\n print(\"ALMOST\")\r\nelse :\r\n print(\"NEITHER\")\r\n", "###################################################################\n# .\"-,.__\n# `. `. ,\n# .--' .._,'\"-' `.\n# . .' `'\n# `. / ,'\n# ` '--. ,-\"'\n# `\"` \| \\\n# -. \\, \|\n# `--Y.' ___.\n# \\ L._, \\\n# _., `. < <\\ _\n# ,' ' `, `. \| \\ ( `\n# ../, `. ` \| .\\`. \\ \\_\n# ,' ,.. . _.,' \|\|\\l ) '\".\n# , ,' \\ ,'.-.`-._,' \| . _._`.\n# ,' / \\ \\ `' ' `--/ \| \\ / / ..\\\n# .' / \\ . \|\\__ - _ ,'` ` / / `.`.\n# \| ' .. `-...-\" \| `-' / / . `.\n# \| / \|L__ \| \| / / `. `.\n# , / . . \| \| / / ` `\n# / / ,. ,`._ `-_ \| \| _ ,-' / ` \\\n# / . \\\"`_/. `-_ \\_,. ,' +-' `-' _, ..,-. \\`.\n# . ' .-f ,' ` '. \\__.---' _ .' ' \\ \\\n# ' / `.' l .' / \\.. ,_\|/ `. ,'` L`\n# \|' _.-\"\"` `. \\ _,' ` \\ `.___`.'\"`-. , \| \| \| \\\n# \|\| ,' `. `. ' _,...._ ` \| `/ ' \| ' .\|\n# \|\| ,' `. ;.,.---' ,' `. `.. `-' .-' /_ .' ;_ \|\|\n# \|\| ' V / / ` \| ` ,' ,' '. ! `. \|\|\n# \|\|/ _,-------7 ' . \| `-' l / `\|\|\n# . \| ,' .- ,' \|\| \| .-. `. .' \|\|\n# `' ,' `\".' \| \| `. '. -.' `'\n# / ,' \| \|,' \\-.._,.'/'\n# . / . . \\ .''\n# .`. \| `. / :_,'.'\n# \\ `...\\ _ ,'-. .' /_.-'\n# `-.__ `, `' . _.>----''. _ __ /\n# .' /\"' \| \"' '_\n# /_\|.-'\\ ,\". '.'`__'-( \\\n# / ,\"'\"\\,' `/ `-.\|\" \n###################################################################\n\nfrom sys import stdin, stdout\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\n \nmod = pow(10, 9) + 7\nmod2 = 998244353\n \ndef inp(): return stdin.readline().strip()\ndef iinp(): return int(inp())\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return map(int, inp().split())\ndef smp(): return map(str, inp().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(m, val) for j in range(n)]\ndef remadd(x, y): return 1 if x%y else 0\ndef ceil(a,b): return (a+b-1)//b\n \ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n \ndef chk(l):\n a = (l[0]-l[2])2+(l[1]-l[3])2\n b = (l[4]-l[2])2+(l[3]-l[5])2\n c = (l[0]-l[4])2+(l[1]-l[5])2\n ml = [a, b, c]\n ml.sort()\n return ml[0]+ml[1]==ml[2] and all(ml)\n\nl = lmp()\nif chk(l):\n print(\"RIGHT\")\nelse:\n flg=False\n for i in range(3):\n for j in range(4):\n jx = [0, 1, 0, -1]\n jy = [1, 0, -1, 0]\n k = l.copy()\n k[2i] += jx[j]\n k[2i+1] += jy[j]\n if(chk(k)):\n flg = True\n break\n if flg: break\n print(\"ALMOST\" if flg else \"NEITHER\")\n", "def right(p):\r\n a = (p[0] - p[2]) * 2 + (p[1] - p[3]) 2\r\n b = (p[0] - p[4]) 2 + (p[1] - p[5]) 2\r\n c = (p[2] - p[4]) 2 + (p[3] - p[5]) 2\r\n return a and b and c and (a + b == c or a + c == b or b + c == a)\r\n\r\n\r\ndef solve(p):\r\n if right(p):\r\n return 'RIGHT'\r\n for i in range(6):\r\n p[i] -= 1\r\n if right(p):\r\n return 'ALMOST'\r\n p[i] += 2\r\n if right(p):\r\n return 'ALMOST'\r\n p[i] -= 1\r\n return 'NEITHER'\r\n\r\n\r\nprint(solve(list(map(int, input().split()))))", "import math\n\nepsilon = 10-9\ndx = [1, 0, -1, 0]\ndy = [0, 1, 0, -1]\n\n\ndef is_right(ps):\n fator1 = ps[0][0] - ps[1][0]\n fator11 = ps[0][1] - ps[1][1]\n\n fator2 = ps[0][0] - ps[2][0]\n fator22 = ps[0][1] - ps[2][1]\n\n fator3 = ps[1][0] - ps[2][0]\n fator33 = ps[1][1] - ps[2][1]\n\n l1 = math.sqrt(fator1 * fator1 + fator11 * fator11)\n l2 = math.sqrt(fator2 * fator2 + fator22 * fator22)\n l3 = math.sqrt(fator3 * fator3 + fator33 * fator33)\n\n if (((l1 + l2 - l3) < epsilon) \n or ((l1 + l3 - l2) < epsilon) \n or ((l3 + l2 - l1) < epsilon)): \n return False\n\n sl1, sl2, sl3= l1 * l1, l2 * l2, l3 * l3 \n \n if (abs(sl1 + sl2 - sl3) < epsilon) or (abs(sl3 + sl2 - sl1) < epsilon) or (abs(sl1 + sl3 - sl2) < epsilon): \n return True\n\n return False\n\n\ndef is_almost(ps):\n pi = []\n for i in range(0, 3):\n for k in range(0, 4):\n pi = ((ps[i][0] + dx[k], ps[i][1] + dy[k]), ps[(i + 1) % 3], ps[(i + 2) % 3])\n if (is_right(pi)):\n return True\n\n return False\n\n \n\nps = []\na,b,c,d,e,f = map(int, input().split())\nps.append((a,b))\nps.append((c,d))\nps.append((e,f))\nif (is_right(ps)):\n print('RIGHT')\nelif is_almost(ps):\n print('ALMOST')\nelse:\n print('NEITHER')\n\n\t\t \t \t \t \t\t \t\t\t \t\t\t \t\t\t \t", "#------------------------template--------------------------#\r\nimport os\r\nimport sys\r\nfrom math import \r\nfrom collections import \r\nfrom fractions import \r\nfrom bisect import \r\nfrom io import BytesIO, IOBase\r\ndef vsInput():\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef value():return tuple(map(int,input().split()))\r\ndef array():return [int(i) for i in input().split()]\r\ndef Int():return int(input())\r\ndef Str():return input()\r\ndef arrayS():return [i for i in input().split()]\r\n\r\n#-------------------------code---------------------------#\r\n#vsInput()\r\n\r\ndef dist(x1, y1, x2, y2):\r\n return (x1 - x2) 2 + (y1 - y2) 2\r\ndef check(x1,y1,x2,y2,x3,y3):\r\n #print(x1,y1,x2,y2,x3,y3,p)\r\n a = dist(x1, y1, x2, y2)\r\n b = dist(x1, y1, x3, y3)\r\n c = dist(x3, y3, x2, y2)\r\n if a == 0 or b == 0 or c == 0:\r\n return False\r\n maxm = max(a, b, c)\r\n if maxm == a + b + c - maxm:\r\n return True\r\n return False\r\n \r\n\r\nx1,y1,x2,y2,x3,y3=value()\r\np1=[x1,y1]\r\np2=[x2,y2]\r\np3=[x3,y3]\r\npoints=[p1,p2,p3]\r\nif(check(points[0][0],points[0][1],points[1][0],points[1][1],points[2][0],points[2][1])):\r\n print(\"RIGHT\")\r\n exit()\r\nfor p in range(3):\r\n for c in range(2):\r\n points[p][c]+=1\r\n if(check(points[0][0],points[0][1],points[1][0],points[1][1],points[2][0],points[2][1])):\r\n print(\"ALMOST\")\r\n exit()\r\n points[p][c]-=2\r\n if(check(points[0][0],points[0][1],points[1][0],points[1][1],points[2][0],points[2][1])):\r\n print(\"ALMOST\")\r\n exit()\r\n points[p][c]+=1\r\nprint(\"NEITHER\")\r\n \r\n\r\n", "# -- coding: utf-8 --\r\n\r\n'''\r\nNome: Ivan Rosa Soares Júnior\r\nMatrícula: 2015083590\r\nSolução: Se um triângulo é retângulo, seus lados satisfazem a relação do teorema\r\nde pitágoras. Utilizei esse fato para realizar o teste.\r\n\r\nTambém realizei o teste somando e subtraindo 1 de cada uma das coordenadas\r\n(para cumprir a parte de distância = 1 da especificação para o \"quase\").\r\n'''\r\n\r\n\r\ndef check_right_triangle(coords):\r\n x1, y1, x2, y2, x3, y3 = coords\r\n\r\n sl12 = (x1 - x2)2 + (y1 - y2)2\r\n sl13 = (x1 - x3)2 + (y1 - y3)2\r\n sl23 = (x2 - x3)2 + (y2 - y3)2\r\n\r\n return sl12 != 0 and sl13 != 0 and sl23 != 0 and (\r\n sl12 == sl13 + sl23 or\r\n sl13 == sl12 + sl23 or\r\n sl23 == sl12 + sl13\r\n )\r\n\r\n\r\ndef main():\r\n coords = list(map(int, input().strip().split()))\r\n\r\n if check_right_triangle(coords):\r\n print('RIGHT')\r\n return\r\n\r\n for i in range(6):\r\n ori = coords[i]\r\n\r\n coords[i] = ori + 1\r\n if check_right_triangle(coords):\r\n print('ALMOST')\r\n return\r\n\r\n coords[i] = ori - 1\r\n if check_right_triangle(coords):\r\n print('ALMOST')\r\n return\r\n\r\n coords[i] = ori\r\n\r\n print('NEITHER')\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "l = list(map(int,input().split()))\r\n\r\nx1 = l[0]\r\ny1 = l[1]\r\nx2 = l[2]\r\ny2 = l[3]\r\nx3 = l[4]\r\ny3 = l[5]\r\n\r\n\r\ndef rightAngled(x1,y1,x2,y2,x3,y3,fl):\r\n \r\n cx = [0, 1, 0, -1]\r\n cy = [1, 0, -1, 0]\r\n \r\n a2,b2,c2 = distances(x1,y1,x2,y2,x3,y3) \r\n \r\n if (a2!= 0 and b2!=0 and c2!=0):\r\n if (a2 + b2 == c2 or b2 + c2 == a2 or a2 + c2 == b2):\r\n print(\"RIGHT\")\r\n fl = 0\r\n return\r\n \r\n else: \r\n for i in range(4):\r\n x = x1 + cx[i]\r\n y = y1 + cy[i]\r\n a2,b2,c2 = distances(x,y,x2,y2,x3,y3)\r\n if (a2!= 0 and b2!=0 and c2!=0):\r\n if (a2 + b2 == c2 or b2 + c2 == a2 or a2 + c2 == b2):\r\n print(\"ALMOST\")\r\n fl = 0\r\n return\r\n \r\n for i in range(4):\r\n x = x2 + cx[i]\r\n y = y2 + cy[i]\r\n a2,b2,c2 = distances(x1,y1,x,y,x3,y3)\r\n if (a2!= 0 and b2!=0 and c2!=0):\r\n if (a2 + b2 == c2 or b2 + c2 == a2 or a2 + c2 == b2):\r\n print(\"ALMOST\")\r\n fl = 0\r\n return\r\n \r\n for i in range(4):\r\n x = x3 + cx[i]\r\n y = y3 + cy[i]\r\n a2,b2,c2 = distances(x1,y1,x2,y2,x,y)\r\n if (a2!= 0 and b2!=0 and c2!=0):\r\n if (a2 + b2 == c2 or b2 + c2 == a2 or a2 + c2 == b2):\r\n print(\"ALMOST\")\r\n fl = 0\r\n return\r\n\r\n if (fl == 1):\r\n print(\"NEITHER\")\r\n return\r\n\r\ndef distances(x1, y1, x2, y2, x3, y3):\r\n a2 = (x2 - x1)2 + (y2 - y1)2\r\n b2 = (x3 - x2)2 + (y3 - y2)2\r\n c2 = (x1 - x3)2 + (y1 - y3)2\r\n return a2, b2, c2\r\n\r\n\r\nfl = 1\r\nrightAngled(x1, y1, x2, y2, x3, y3, fl)\r\n\r\n", "def if_right(x1, y1, x2, y2, x3, y3):\r\n a = ((x1 - x2) * (x1 - x2)) + \\\r\n ((y1 - y2) * (y1 - y2))\r\n b = ((x1 - x3) * (x1 - x3)) + \\\r\n ((y1 - y3) * (y1 - y3))\r\n c = ((x2 - x3) * (x2 - x3)) + \\\r\n ((y2 - y3) * (y2 - y3))\r\n if ((a == (b + c) and a != 0 and b != 0 and c != 0) or (b == (a + c) and b != 0 and a != 0 and c != 0) or (c == (a + b) and c != 0 and b != 0 and a != 0)):\r\n return 1\r\n\r\nx1, y1, x2, y2, x3, y3 = map(int,input().split())\r\n\r\nif (if_right(x1, y1, x2, y2, x3, y3)):\r\n print(\"RIGHT\") #if it is exactly right-angle triangle\r\nelif(if_right(x1+1, y1, x2, y2, x3, y3) or if_right(x1-1, y1, x2, y2, x3, y3) or if_right(x1, y1+1, x2, y2, x3, y3) or\r\n if_right(x1, y1-1, x2, y2, x3, y3) or if_right(x1, y1, x2+1, y2, x3, y3) or if_right(x1, y1, x2-1, y2, x3, y3) or\r\n if_right(x1, y1, x2, y2+1, x3, y3) or if_right(x1, y1, x2, y2-1, x3, y3) or if_right(x1, y1, x2, y2, x3+1, y3) or\r\n if_right(x1, y1, x2, y2, x3-1, y3) or if_right(x1, y1, x2, y2, x3, y3+1) or if_right(x1, y1, x2, y2, x3, y3-1)):\r\n print(\"ALMOST\") #if it is necessary to change one coordinate with 1 to get right-angle triangle\r\nelse:\r\n print(\"NEITHER\") #if it is not a right-angle triangle", "import sys\r\n\r\n# sys.stdin = open(\"3.in\", \"r\")\r\n\r\ncoor = list(map(int, input().split()))\r\n\r\ndef f_equal(a, b):\r\n return abs(a-b)<0.001\r\n\r\ndef is_right(coor):\r\n x1, y1, x2, y2, x3, y3 = coor\r\n a2 = ((x1-x2)2 + (y1-y2)2)\r\n b2 = ((x1-x3)2 + (y1-y3)2)\r\n c2 = ((x2-x3)2 + (y2-y3)2)\r\n\r\n a = a20.5\r\n b = b20.5\r\n c = c20.5\r\n\r\n if f_equal(a+b, c) or f_equal(a+c, b) or f_equal(b+c, a):\r\n return False\r\n \r\n if a2 + b2 == c2 or a2 + c2 == b2 or b2 + c2 == a2:\r\n return True\r\n else:\r\n return False\r\n\r\ndef is_almost(coor):\r\n for i in range(len(coor)):\r\n if is_right(coor[:i] + [coor[i]-1] + coor[i+1:]):\r\n return True\r\n elif is_right(coor[:i] + [coor[i]+1] + coor[i+1:]):\r\n return True\r\n \r\n return False\r\n\r\n\r\nif is_right(coor):\r\n print(\"RIGHT\")\r\nelif is_almost(coor):\r\n print(\"ALMOST\")\r\nelse:\r\n print(\"NEITHER\")\r\n ", "uASei = range\r\nuASeU = print\r\nuASeg = list\r\nuASeo = map\r\nuASey = int\r\nuASeH = input\r\n\r\n\r\ndef uASef(p):\r\n a = (p[0]-p[2])2+(p[1]-p[3])2\r\n b = (p[0]-p[4])2+(p[1]-p[5])2\r\n c = (p[2]-p[4])2+(p[3]-p[5])2\r\n return a and b and c and (a + b == c or a + c == b or b + c == a)\r\n\r\n\r\ndef uASex(p):\r\n if uASef(p):\r\n return 'RIGHT'\r\n for i in uASei(6):\r\n p[i] -= 1\r\n if uASef(p):\r\n return 'ALMOST'\r\n p[i] += 2\r\n if uASef(p):\r\n return 'ALMOST'\r\n p[i] -= 1\r\n return 'NEITHER'\r\n\r\n\r\nuASeU(uASex(uASeg(uASeo(uASey, uASeH().split()))))\r\n", "s = list(map(int, input().split()))\ndef kc2(a,b,c,d):\n return (a-c)2 + (b-d)*2\ndef r(s):\n a,b,c,d,e,f = s\n AB = kc2(a,b,c,d)\n BC = kc2(c,d,e,f)\n CA = kc2(e,f,a,b)\n x = max(AB, BC, CA)\n return 2x == AB + BC + CA and AB and BC and CA\nif r(s): print('RIGHT'); exit()\nfor i in range(6):\n s[i]-=1\n if r(s): print('ALMOST'); exit()\n s[i]+=2\n if r(s): print('ALMOST'); exit()\n s[i]-=1\nprint('NEITHER')\n\n \t \t\t\t\t \t \t \t \t \t", "import sys\r\nfrom array import array # noqa: F401\r\nfrom itertools import permutations\r\nfrom copy import deepcopy\r\nfrom math import hypot, sqrt\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\neps = 1e-9\r\n\r\n\r\ndef solve(points):\r\n for ps in permutations(points):\r\n a, b, c = hypot(ps[0][0] - ps[1][0], ps[0][1] - ps[1][1]), hypot(ps[1][0] - ps[2][0], ps[1][1] - ps[2][1]), hypot(ps[0][0] - ps[2][0], ps[0][1] - ps[2][1])\r\n s = (a + b + c) / 2\r\n S = sqrt(s * (s - a) * (s - b) * (s - c))\r\n if abs(a2 + b2 - c2) < eps and S > eps:\r\n return True\r\n return False\r\n\r\n\r\na = list(map(int, input().split()))\r\npts = [[a[0], a[1]], [a[2], a[3]], [a[4], a[5]]]\r\n\r\nif solve(pts):\r\n print('RIGHT')\r\nelse:\r\n for i in range(3):\r\n for j in range(2):\r\n for k in range(-1, 2):\r\n _pts = deepcopy(pts)\r\n _pts[i][j] += k\r\n if solve(_pts):\r\n print('ALMOST')\r\n exit()\r\n print('NEITHER')\r\n", "\r\ndef check_right_triangle(coords):\r\n x1, y1, x2, y2, x3, y3 = coords\r\n#finding out the distances in order to get the sides of our triangle\r\n s12 = (x1 - x2)2 + (y1 - y2)2\r\n s13 = (x1 - x3)2 + (y1 - y3)2\r\n s23 = (x2 - x3)2 + (y2 - y3)2\r\n#no degenrate traingles will pass xD\r\n return s12 != 0 and s13 != 0 and s23 != 0 and (\r\n s12 == s13 + s23 or\r\n s13 == s12 + s23 or\r\n s23 == s12 + s13\r\n )\r\n\r\ndef answer():\r\n if check_right_triangle(coords):\r\n print('RIGHT')\r\n return\r\n\r\n for i in range(6):\r\n p = coords[i]\r\n#here is the test for the \"almost\" right-angle triangle\r\n#where we check every coordinate changed by adding 1\r\n coords[i] = p + 1\r\n if check_right_triangle(coords):\r\n print('ALMOST')\r\n return\r\n#here is the test for the \"almost\" right-angle triangle\r\n#where we check every coordinate changed by subtracting 1\r\n coords[i] = p - 1\r\n if check_right_triangle(coords):\r\n print('ALMOST')\r\n return\r\n\r\n coords[i] = p\r\n\r\n print('NEITHER')\r\ncoords = list(map(int, input().strip().split()))\r\nanswer()\r\n", "def is_right(coords):\r\n\tx1, y1, x2, y2, x3, y3 = coords\r\n\r\n\tsl12 = (x1 - x2)2 + (y1 - y2)2\r\n\tsl13 = (x1 - x3)2 + (y1 - y3)2\r\n\tsl23 = (x2 - x3)2 + (y2 - y3)2\r\n\r\n\treturn sl12 != 0 and sl13 != 0 and sl23 != 0 and (\r\n\t\tsl12 == sl13 + sl23 or\r\n\t\tsl13 == sl12 + sl23 or\r\n\t\tsl23 == sl12 + sl13\r\n\t)\r\n\r\n\r\ndef main():\r\n\tcoords = list(map(int, input().strip().split()))\r\n\r\n\tif is_right(coords):\r\n\t\tprint('RIGHT')\r\n\t\treturn\r\n\r\n\tfor i in range(6):\r\n\t\tori = coords[i]\r\n\r\n\t\tcoords[i] = ori + 1\r\n\t\tif is_right(coords):\r\n\t\t\tprint('ALMOST')\r\n\t\t\treturn\r\n\r\n\t\tcoords[i] = ori - 1\r\n\t\tif is_right(coords):\r\n\t\t\tprint('ALMOST')\r\n\t\t\treturn\r\n\r\n\t\tcoords[i] = ori\r\n\r\n\tprint('NEITHER')\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "#18A - Triangle\r\n#Function to calculate the sides of the triangle\r\n#and if they are actually sides of a right-angled triangle: the sum of 2 sides !> 3rd side\r\ndef sides(p): #p - point coordinates\r\n a = (p[0] - p[2]) 2 + (p[1] - p[3]) 2\r\n b = (p[0] - p[4]) 2 + (p[1] - p[5]) 2\r\n c = (p[2] - p[4]) 2 + (p[3] - p[5]) 2\r\n return a and b and c and (a + b == c or a + c == b or b + c == a)\r\n#Function that says if it's a right-angled triangle, based on the outcome of the previous function\r\ndef assertion(p):\r\n if sides(p):\r\n return 'RIGHT'\r\n for i in range(6):\r\n p[i] -= 1\r\n if sides(p):\r\n return 'ALMOST'\r\n p[i] += 2\r\n if sides(p):\r\n return 'ALMOST'\r\n p[i] -= 1\r\n return 'NEITHER'\r\n#We print the decision:\r\nprint(assertion(list(map(int, input().split()))))", "#function checks if coordinates of vertices belong to the right-angle triangle\r\ndef triangle(x1, y1, x2, y2, x3, y3):\r\n a2 = (x1 - x2)2+(y1-y2)2 #first side^2\r\n b2 = (x1 - x3)2+(y1-y3)2 #second side^2\r\n c2 = (x3 - x2)2+(y3-y2)*2 #third side^2\r\n return ((a2+b2 == c2 or c2+b2 == a2 or a2+c2 == b2) and (a2b2c2 != 0)) #if the sum of squares of legs is equal to the hypotenuse^2, then it is a right-angle triangle\r\n\r\nx1, y1, x2, y2, x3, y3 = map(int,input().split())\r\n\r\nif ( triangle(x1, y1, x2, y2, x3, y3)):\r\n print(\"RIGHT\") #if it is exactly right-angle triangle\r\nelif( triangle(x1+1, y1, x2, y2, x3, y3) or triangle(x1-1, y1, x2, y2, x3, y3) or triangle(x1, y1+1, x2, y2, x3, y3) or triangle(x1, y1-1, x2, y2, x3, y3) or triangle(x1, y1, x2+1, y2, x3, y3) or triangle(x1, y1, x2-1, y2, x3, y3) or triangle(x1, y1, x2, y2+1, x3, y3) or triangle(x1, y1, x2, y2-1, x3, y3) or triangle(x1, y1, x2, y2, x3+1, y3) or triangle(x1, y1, x2, y2, x3-1, y3) or triangle(x1, y1, x2, y2, x3, y3+1) or triangle(x1, y1, x2, y2, x3, y3-1)):\r\n print(\"ALMOST\") #if it is necessary to change one coordinate with 1 to get right-angle triangle\r\nelse:\r\n print(\"NEITHER\") #if it is not a right-angle triangle", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef chk(c) -> bool:\r\n ch = sorted([(c[4] - c[2]) (c[4] - c[2]) + (c[5] - c[3]) * (c[5] - c[3]), (c[4] - c[0]) * (c[4] - c[0]) + (c[5] - c[1]) * (c[5] - c[1]), (c[2] - c[0]) * (c[2] - c[0]) + (c[3] - c[1]) * (c[3] - c[1])])\r\n return ch[0] > 0 and ch[2] == ch[0] + ch[1]\r\n\r\n\r\ns, res = list(map(int, input().split())), 'NEITHER'\r\nif chk(s): res = 'RIGHT'\r\nelse:\r\n for i in range(6):\r\n s[i] += 1\r\n if chk(s): res = 'ALMOST'; break\r\n s[i] -= 2\r\n if chk(s): res = 'ALMOST'; break\r\n s[i] += 1\r\nprint(res)", "def triangle_check(x1, y1, x2, y2, x3, y3):\r\n if (x1 == x2 and y1 == y2) or (x3 == x2 and y3 == y2) or (x1 == x3 and y1 == y3):\r\n return False\r\n if ((x1-x2)(x3-x2) == -(y1-y2)(y3-y2)) or ((x2-x1)(x3-x1) == -(y2-y1)(y3-y1)) or ((x1-x3)(x2-x3) == -(y1-y3)(y2-y3)):\r\n return True\r\n else:\r\n return False\r\n\r\n\r\n# manual check.\r\nx1, y1, x2, y2, x3, y3 = map(int, input().split())\r\nif triangle_check(x1, y1, x2, y2, x3, y3):\r\n print('RIGHT')\r\nelse:\r\n if triangle_check(x1 - 1, y1, x2, y2, x3, y3) or triangle_check(x1 + 1, y1, x2, y2, x3, y3) or triangle_check(x1, y1 - 1, x2, y2, x3, y3) or triangle_check(x1, y1 + 1, x2, y2, x3, y3) or triangle_check(x1, y1, x2 - 1, y2, x3, y3) or triangle_check(x1, y1, x2 + 1, y2, x3, y3) or triangle_check(x1, y1, x2, y2 - 1, x3, y3) or triangle_check(x1, y1, x2, y2 + 1, x3, y3) or triangle_check(x1, y1, x2, y2, x3 - 1, y3) or triangle_check(x1, y1, x2, y2, x3 + 1, y3) or triangle_check(x1, y1, x2, y2, x3, y3 + 1) or triangle_check(x1, y1, x2, y2, x3, y3 - 1):\r\n print('ALMOST')\r\n else:\r\n print('NEITHER')", "dx=(0, 0, -1, 1)\r\ndy=(1, -1, 0, 0)\r\ndef isright(x1, y1, x2, y2, x3, y3):\r\n\thi1=x2-x1\r\n\thi2=y2-y1\r\n\thi3=x3-x1\r\n\thi4=y3-y1\r\n\tif (x1==x2 and y1==y2) or (x1==x3 and y1==y3) or (x2==x3 and y2==y3):\r\n\t\treturn False\r\n\tif (hi1hi3)+(hi2hi4)==0:\r\n\t\treturn True\r\n\thi1, hi2, hi3, hi4=x1-x2, y1-y2, x3-x2, y3-y2\r\n\tif (hi1hi3)+(hi2hi4)==0:\r\n\t\treturn True\r\n\thi1, hi2, hi3, hi4=x2-x3, y2-y3, x1-x3, y1-y3\r\n\tif (hi1hi3)+(hi2hi4)==0:\r\n\t\treturn True\r\n\treturn False\r\nx1, y1, x2, y2, x3, y3=map(int, input().split())\r\nif isright(x1, y1, x2, y2, x3, y3):\r\n\tprint(\"RIGHT\")\r\n\texit()\r\nfor i in range(4):\r\n\tif isright(x1+dx[i], y1+dy[i], x2, y2, x3, y3):\r\n\t\tprint(\"ALMOST\")\r\n\t\texit()\r\n\tif isright(x1, y1, x2+dx[i], y2+dy[i], x3, y3):\r\n\t\tprint(\"ALMOST\")\r\n\t\texit()\r\n\tif isright(x1, y1, x2, y2, x3+dx[i], y3+dy[i]):\r\n\t\tprint(\"ALMOST\")\r\n\t\texit()\r\nprint(\"NEITHER\")", "\r\ndef is_right(l):\r\n k = []\r\n k.append((l[0]-l[2])2 + (l[1]-l[3])2)\r\n k.append((l[4]-l[2])2 + (l[5]-l[3])2)\r\n k.append((l[0]-l[4])2 + (l[1]-l[5])2)\r\n k.sort()\r\n if k[0]==0:\r\n return False\r\n return k[0]+k[1]==k[2]\r\n\r\n\r\ndef is_almost(l):\r\n for i in range(6):\r\n l[i]+=1\r\n res = is_right(l)\r\n l[i]-=1\r\n if res:\r\n return True\r\n for i in range(6):\r\n l[i]-=1\r\n res = is_right(l)\r\n l[i]+=1\r\n if res:\r\n return True\r\n return False\r\n\r\n\r\n\r\ns = map(int,input().split())\r\nlis = []\r\nfor k in s:\r\n lis.append(k)\r\n\r\nif is_right(lis):\r\n print(\"RIGHT\")\r\nelif is_almost(lis):\r\n print(\"ALMOST\")\r\nelse:\r\n print(\"NEITHER\")", "def triangle(point):\r\n a=(point[0]-point[2])2+(point[1]-point[3])2\r\n b=(point[0]-point[4])2+(point[1]-point[5])2\r\n c=(point[2]-point[4])2+(point[3]-point[5])2\r\n return a and b and c and (a+b == c or a+c == b or b+c == a)\r\ndef main():\r\n\tpoint = list(map(int, input().strip().split()))\r\n \r\n\tif triangle(point):\r\n\t\tprint('RIGHT')\r\n\t\treturn\r\n \r\n\tfor i in range(6):\r\n\t\tp = point[i]\r\n \r\n\t\tpoint[i] = p + 1\r\n\t\tif triangle(point):\r\n\t\t\tprint('ALMOST')\r\n\t\t\treturn\r\n \r\n\t\tpoint[i] = p - 1\r\n\t\tif triangle(point):\r\n\t\t\tprint('ALMOST')\r\n\t\t\treturn\r\n \r\n\t\tpoint[i] = p\r\n \r\n\tprint('NEITHER')\r\nif __name__ == '__main__':\r\n\tmain()", "\n\n\nx1,y1,x2,y2,x3,y3 = map(int,input().split())\n\na = (x1 - x2)2 + (y2 - y1)2\n\nb = (x1 - x3)2 + (y3 - y1)2\n\nc = (x2 - x3)2 + (y3 - y2)2\n\na,b,c = sorted([a,b,c])\ntemp = 0\nif abs(a + b - c) == 0:\n temp = 1\n print('RIGHT')\n\nif temp == 0:\n halo = x1\n x1+=1\n a = (x1 - x2)2 + (y2 - y1)2\n\n b = (x1 - x3)2 + (y3 - y1)2\n\n c = (x2 - x3)2 + (y3 - y2)2\n x1 = halo\n a,b,c = sorted([a,b,c])\n\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n\n print('ALMOST')\n\nif temp == 0:\n halo = y1\n y1+=1\n a = (x1 - x2)2 + (y2 - y1)2\n\n b = (x1 - x3)2 + (y3 - y1)2\n\n c = (x2 - x3)2 + (y3 - y2)2\n y1 = halo\n a,b,c = sorted([a,b,c])\n\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n\n print('ALMOST')\n\nif temp == 0:\n halo = x2\n x2+=1\n a = (x1 - x2)2 + (y2 - y1)2\n\n b = (x1 - x3)2 + (y3 - y1)2\n\n c = (x2 - x3)2 + (y3 - y2)2\n\n a,b,c = sorted([a,b,c])\n x2 = halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\nif temp == 0:\n halo = y2\n y2+=1\n a = (x1 - x2)2 + (y2 - y1)2\n\n b = (x1 - x3)2 + (y3 - y1)2\n\n c = (x2 - x3)2 + (y3 - y2)2\n\n a,b,c = sorted([a,b,c])\n y2 = halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\n\nif temp == 0:\n halo = x3\n x3+=1\n a = (x1 - x2)2 + (y2 - y1)2\n\n b = (x1 - x3)2 + (y3 - y1)2\n\n c = (x2 - x3)2 + (y3 - y2)2\n\n a,b,c = sorted([a,b,c])\n x3 = halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\nif temp == 0:\n halo = y3\n y3+=1\n a = (x1 - x2)2 + (y2 - y1)2\n\n b = (x1 - x3)2 + (y3 - y1)2\n\n c = (x2 - x3)2 + (y3 - y2)2\n\n a,b,c = sorted([a,b,c])\n y3= halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\n\n\n\n\nif temp == 0:\n halo = x1\n x1-=1\n a = (x1 - x2)2 + (y2 - y1)2\n\n b = (x1 - x3)2 + (y3 - y1)2\n\n c = (x2 - x3)2 + (y3 - y2)2\n x1 = halo\n a,b,c = sorted([a,b,c])\n\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n\n print('ALMOST')\n\nif temp == 0:\n halo = y1\n y1-=1\n a = (x1 - x2)2 + (y2 - y1)2\n\n b = (x1 - x3)2 + (y3 - y1)2\n\n c = (x2 - x3)2 + (y3 - y2)2\n y1 = halo\n a,b,c = sorted([a,b,c])\n\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n\n print('ALMOST')\n\nif temp == 0:\n halo = x2\n x2-=1\n a = (x1 - x2)2 + (y2 - y1)2\n\n b = (x1 - x3)2 + (y3 - y1)2\n\n c = (x2 - x3)2 + (y3 - y2)2\n\n a,b,c = sorted([a,b,c])\n x2 = halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\nif temp == 0:\n halo = y2\n y2-=1\n a = (x1 - x2)2 + (y2 - y1)2\n\n b = (x1 - x3)2 + (y3 - y1)2\n\n c = (x2 - x3)2 + (y3 - y2)2\n\n a,b,c = sorted([a,b,c])\n y2 = halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\n\nif temp == 0:\n halo = x3\n x3-=1\n a = (x1 - x2)2 + (y2 - y1)2\n\n b = (x1 - x3)2 + (y3 - y1)2\n\n c = (x2 - x3)2 + (y3 - y2)2\n\n a,b,c = sorted([a,b,c])\n x3 = halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\nif temp == 0:\n halo = y3\n y3-=1\n a = (x1 - x2)2 + (y2 - y1)2\n\n b = (x1 - x3)2 + (y3 - y1)2\n\n c = (x2 - x3)2 + (y3 - y2)2\n\n a,b,c = sorted([a,b,c])\n y3= halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\n\nif temp == 0:\n print('NEITHER')\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef check(A):\r\n a = (A[0]-A[2])2 + (A[1]-A[3])2\r\n b = (A[0]-A[4])2 + (A[1]-A[5])2\r\n c = (A[2]-A[4])2 + (A[3]-A[5])2\r\n \r\n if a>0 and b>0 and c>0 and (a+b==c or a+c==b or a==b+c):\r\n return True\r\n return False\r\n\r\nA = list(map(int, input().split()))\r\nN = 3\r\nif check(A):\r\n exit(print('RIGHT'))\r\n \r\nfor i in range(len(A)):\r\n B = A[::]\r\n B[i]+=1\r\n if check(B):\r\n #print(B)\r\n exit(print('ALMOST'))\r\n B = A[::]\r\n B[i]-=1\r\n if check(B):\r\n #print(B)\r\n exit(print('ALMOST'))\r\n \r\nprint('NEITHER')\r\n\r\n", "# LUOGU_RID: 116504355\ndef is_right_triangle(x1, y1, x2, y2, x3, y3):\r\n if (x1 - x2) * (y1 - y3) == (x1 - x3) * (y1 - y2):\r\n return False\r\n\r\n a2 = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)\r\n b2 = (x1 - x3) * (x1 - x3) + (y1 - y3) * (y1 - y3)\r\n c2 = (x2 - x3) * (x2 - x3) + (y2 - y3) * (y2 - y3)\r\n\r\n if a2 + b2 == c2 or a2 + c2 == b2 or b2 + c2 == a2:\r\n return True\r\n\r\n return False\r\n\r\n\r\nx1, y1, x2, y2, x3, y3 = map(int, input().split())\r\n\r\nif is_right_triangle(x1, y1, x2, y2, x3, y3):\r\n print(\"RIGHT\")\r\nelif any([\r\n is_right_triangle(x1 + 1, y1, x2, y2, x3, y3),\r\n is_right_triangle(x1, y1 + 1, x2, y2, x3, y3),\r\n is_right_triangle(x1, y1, x2 + 1, y2, x3, y3),\r\n is_right_triangle(x1, y1, x2, y2 + 1, x3, y3),\r\n is_right_triangle(x1, y1, x2, y2, x3 + 1, y3),\r\n is_right_triangle(x1, y1, x2, y2, x3, y3 + 1),\r\n is_right_triangle(x1 - 1, y1, x2, y2, x3, y3),\r\n is_right_triangle(x1, y1 - 1, x2, y2, x3, y3),\r\n is_right_triangle(x1, y1, x2 - 1, y2, x3, y3),\r\n is_right_triangle(x1, y1, x2, y2 - 1, x3, y3),\r\n is_right_triangle(x1, y1, x2, y2, x3 - 1, y3),\r\n is_right_triangle(x1, y1, x2, y2, x3, y3 - 1)\r\n]):\r\n print(\"ALMOST\")\r\nelse:\r\n print(\"NEITHER\")\r\n", "a,b,c,d,e,f=map(int,input().split())\r\n\r\ndef right(a,b,c,d,e,f):\r\n if (a,b)==(c,d):\r\n return False\r\n if (a,b)==(e,f):\r\n return False\r\n if (c,d)==(e,f):\r\n return False\r\n\r\n if (c-a)(e-a)+(d-b)(f-b)==0:\r\n return True\r\n\r\n if (a-c)(e-c)+(b-d)(f-d)==0:\r\n return True\r\n\r\n if (a-e)(c-e)+(b-f)(d-f)==0:\r\n return True\r\n\r\n return False\r\n\r\nif right(a,b,c,d,e,f)==True:\r\n print(\"RIGHT\")\r\n exit()\r\n\r\nfor x in range(a-1,a+2):\r\n if right(x,b,c,d,e,f)==True:\r\n print(\"ALMOST\")\r\n exit()\r\nfor x in range(b-1,b+2):\r\n if right(a,x,c,d,e,f)==True:\r\n print(\"ALMOST\")\r\n exit()\r\nfor x in range(c-1,c+2):\r\n if right(a,b,x,d,e,f)==True:\r\n print(\"ALMOST\")\r\n exit()\r\nfor x in range(d-1,d+2):\r\n if right(a,b,c,x,e,f)==True:\r\n print(\"ALMOST\")\r\n exit()\r\nfor x in range(e-1,e+2):\r\n if right(a,b,c,d,x,f)==True:\r\n print(\"ALMOST\")\r\n exit()\r\nfor x in range(f-1,f+2):\r\n if right(a,b,c,d,e,x)==True:\r\n print(\"ALMOST\")\r\n exit()\r\n\r\nprint(\"NEITHER\")\r\n", "from math import \r\nx1,y1,x2,y2,x3,y3=list(map(int,input().split()))\r\ndef a(x1,y1,x2,y2,x3,y3):\r\n if x1!=x2:\r\n a1=degrees(atan((y2-y1)/(x2-x1)))\r\n else:\r\n if y2>y1:\r\n a1=degrees(pi/2)\r\n else:\r\n a1=degrees(-pi/2)\r\n if x1!=x3:\r\n a2=degrees(atan((y3-y1)/(x3-x1)))\r\n else:\r\n if y3>y1:\r\n a2=degrees(pi/2)\r\n else:\r\n a2=degrees(-pi/2)\r\n if x2!=x3:\r\n a3=degrees(atan((y2-y3)/(x2-x3)))\r\n else:\r\n if y2>y3:\r\n a3=degrees(pi/2)\r\n else:\r\n a3=degrees(-pi/2)\r\n if x2>=x1:\r\n if x3>=x1:\r\n b1=abs(a1-a2)\r\n if x3>=x2:\r\n b2=abs(a1+180-a3)\r\n else:\r\n b2=abs(a1-a3)\r\n else:\r\n b1=abs(180+a2-a1)\r\n b2=abs(a1-a3)\r\n else:\r\n if x3>=x1:\r\n b1=abs(180+a1-a2)\r\n b2=abs(a3-a1)\r\n else:\r\n b1=abs(a1-a2)\r\n if x3>=x2:\r\n b2=abs(a3-a1)\r\n else:\r\n b2=abs(180+a3-a1)\r\n b1=min(b1,360-b1)\r\n b2=min(b2,360-b2)\r\n b3=180-b1-b2\r\n b1=round(b11000000)/1000000\r\n b2=round(b21000000)/1000000\r\n b3=round(b31000000)/1000000\r\n if b1==90 or b2==90 or b3==90:\r\n return True\r\n else:\r\n return False\r\nif a(x1,y1,x2,y2,x3,y3):\r\n print('RIGHT')\r\nelif a(x1+1,y1,x2,y2,x3,y3) or a(x1-1,y1,x2,y2,x3,y3) or a(x1,y1+1,x2,y2,x3,y3) or a(x1,y1-1,x2,y2,x3,y3) or a(x1,y1,x2+1,y2,x3,y3) or a(x1,y1,x2-1,y2,x3,y3) or a(x1,y1,x2,y2+1,x3,y3) or a(x1,y1,x2,y2-1,x3,y3) or a(x1,y1,x2,y2,x3+1,y3) or a(x1,y1,x2,y2,x3-1,y3) or a(x1,y1,x2,y2,x3,y3+1) or a(x1,y1,x2,y2,x3,y3-1):\r\n print('ALMOST')\r\nelse:\r\n print('NEITHER')", "class pt:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n\r\ndef add(B, A):\r\n return pt(B.x + A.x, B.y + A.y)\r\ndef sub(B, A):\r\n return pt(B.x - A.x, B.y - A.y)\r\n\r\ndef scal(B, A):\r\n return B.x * A.x + B.y * A.y==0\r\n\r\ndef eq (A, B):\r\n return A.x == B.x and A.y == B.y\r\n\r\nx1,y1,x2,y2,x3,y3 = [int(x) for x in input().split()]\r\na = pt(x1, y1)\r\nb = pt(x2, y2)\r\nc = pt(x3, y3)\r\n\r\ndef tr(a,b,c):\r\n if (eq(a,c) or eq(a,b) or eq(c,b)):\r\n return 0\r\n # if scal(sub(a,b),sub(a,c)):\r\n if scal(sub(a,b),sub(a,c)):\r\n return 1\r\n if scal(sub(b,a),sub(b,c)):\r\n return 1 \r\n if scal(sub(c,b),sub(c,a)):\r\n return 1\r\n return 0\r\n\r\ndef check_almost(a, b, c):\r\n if tr(a.add(pt(0, 1)), b, c): return 1\r\n if tr(a.add(pt(0, -1)), b, c): return 1\r\n if tr(a.add(pt(1, 0)), b, c): return 1\r\n if tr(a.add(pt(-1, 0)), b, c): return 1\r\n\r\n\r\n return 0\r\n \r\nk=0\r\n \r\nif (tr(a,b,c)and k==0): \r\n print('RIGHT')\r\n k=1\r\na.x=a.x+1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\na.x=a.x-1\r\na.x=a.x-1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\na.x=a.x+1\r\na.y=a.y+1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\na.y=a.y-1\r\na.y=a.y-1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\na.y=a.y+1\r\n\r\n\r\n\r\nb.x=b.x+1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nb.x=b.x-1\r\nb.x=b.x-1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nb.x=b.x+1\r\nb.y=b.y+1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nb.y=b.y-1\r\nb.y=b.y-1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nb.y=a.y+1\r\n\r\n\r\nc.x=c.x+1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nc.x=c.x-1\r\nc.x=c.x-1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nc.x=c.x+1\r\nc.y=c.y+1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nc.y=c.y-1\r\nc.y=c.y-1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nc.y=c.y+1\r\nif (k==0):\r\n print ('NEITHER')\r\n# def vk (x11,y11,x22,y22):\r\n# return (x22-x11,y22-y11)\r\n# def sk (x11,y11,x22,y22)\r\n# return(x11x22+y11y22==0)\r\n# def tr ()\r\n# x,y=vk(x1,y1,x2,y2)\r\n# x4,y4=vk(x1,y1,x3,y3)\r\n# if sk(x,y,x4,y4)\r\n# print('RIGHT')\r\n# print(k)\r\n\r\n\r\n", "import math\r\n\r\n\r\ndef fun(ls: tuple) -> bool:\r\n for i in range(3):\r\n v1 = (ls[i][0] - ls[(i + 1) % 3][0], ls[i][1] - ls[(i + 1) % 3][1])\r\n v2 = (ls[(i + 1) % 3][0] - ls[(i + 2) % 3][0], ls[(i + 1) % 3][1] - ls[(i + 2) % 3][1])\r\n if v1[0] * v2[0] + v1[1] * v2[1] == 0:\r\n return True\r\n return False\r\n\r\n\r\nx1, y1, x2, y2, x3, y3 = map(int, input().split(' '))\r\ntp = ([x1, y1], [x2, y2], [x3, y3])\r\nif fun(tp):\r\n print('RIGHT')\r\nelse:\r\n almost = False\r\n for i in range(3):\r\n x, y = tp[i][0], tp[i][1]\r\n dire = ((-1, 0), (1, 0), (0, 1), (0, -1))\r\n for d in dire:\r\n tx, ty = x + d[0], y + d[1]\r\n if [tx, ty] in tp:\r\n continue\r\n tp[i][0] = tx\r\n tp[i][1] = ty\r\n if fun(tp):\r\n almost = True\r\n break\r\n if almost:\r\n break\r\n tp[i][0] = x\r\n tp[i][1] = y\r\n print('ALMOST' if almost else 'NEITHER')\r\n", "s = list(map(int,input().split()))\r\n \r\n \r\ndef dis(a,b,c,d):\r\n\t return ((a-c)2 + (b-d)2)\r\n \r\ndef ass(s):\r\n\ta,b,c,d,e,f = s\r\n\tAB = dis(a,b,c,d)\r\n\tBC = dis(c,d,e,f)\r\n\tCA = dis(e,f,a,b)\r\n \r\n\tx = max(AB,BC,CA)\r\n\t\r\n\treturn x == AB+BC+CA-x and AB and BC and CA\r\n \r\nif ass(s):\r\n\tprint(\"RIGHT\") \r\n\texit()\r\n \r\nfor i in range(6):\r\n\ts[i] -= 1\r\n\tif ass(s): print(\"ALMOST\");exit()\r\n\ts[i] += 2\r\n\tif ass(s): print(\"ALMOST\");exit()\r\n\ts[i] -=1\r\n \r\nprint(\"NEITHER\") ", "list1 = list(map(int,input().split()))\r\n \r\n \r\ndef displayy(a,b,c,d):\r\n\t return ((a-c)2 + (b-d)2)\r\n \r\ndef fun1(list1):\r\n\ta,b,c,d,e,f = list1\r\n\tAB = displayy(a,b,c,d)\r\n\tBC = displayy(c,d,e,f)\r\n\tCA = displayy(e,f,a,b)\r\n \r\n\tx = max(AB,BC,CA)\r\n\t\r\n\treturn x == AB+BC+CA-x and AB and BC and CA\r\n \r\nif fun1(list1):\r\n\tprint(\"RIGHT\") \r\n\texit()\r\n \r\nfor i in range(6):\r\n\tlist1[i] -= 1\r\n\tif fun1(list1): print(\"ALMOST\");exit()\r\n\tlist1[i] += 2\r\n\tif fun1(list1): print(\"ALMOST\");exit()\r\n\tlist1[i] -=1\r\n \r\nprint(\"NEITHER\") ", "def dist(a, b):\n return (a[0] - b[0])2 + (a[1] - b[1])2\n\ndef check_tri(l):\n l.sort()\n if l[0] == 0:\n return False\n if l[0] + l[1] == l[2]:\n return True\n return False\n\np = [[0,0], [0,0], [0,0]]\np[0][0], p[0][1], p[1][0], p[1][1], p[2][0], p[2][1] = map(int, input().split())\n\nif check_tri([dist(p[0], p[1]), dist(p[0], p[2]), dist(p[2], p[1])]):\n print('RIGHT')\nelse:\n for i in range(3):\n for j in [[0,1], [1,-1], [-1,-1], [-1,1]]:\n p[i][0] += j[0]\n p[i][1] += j[1]\n if check_tri([dist(p[0], p[1]), dist(p[0], p[2]), dist(p[2], p[1])]):\n print(\"ALMOST\")\n quit()\n p[i][0] += 1\n print(\"NEITHER\")\n\n\n\n\n \t\t\t\t \t\t \t \t \t \t\t\t\t\t \t \t\t\t\t", "'''Problem 18A - Triangle'''\r\nimport math\r\na1,a2,b1,b2,c1,c2 = map(int, input().split()) # citim coordinatele punctelor\r\n\r\n# functie ce verifica daca laturile unui triunghi formeaza un triunghi dreptunghic\r\ndef is_triangle(ip,c1,c2):\r\n if c1 == 0 or c2 == 0 : return False # in caz ca una din catete are lungime egala cu zero\r\n # folosim trunc pentru a scapa de erroarea in calculul radicalului din teorema lui pitagora\r\n return math.trunc(ip100000)/100000 == math.trunc(math.sqrt(pow(c1,2) + pow(c2,2))100000)/100000 # retutunam valoarea booleana respectiva (True sau False)\r\n\r\n# functie ce calculeaza lungimile laturiloe dupa punctele lor pe axa\r\n# ca argument i se transmite o lista , elementele careia sunt 0,1 si -1, pentru a putea calcula lungimile\r\n# laturilor cu punctele diferite de o unitate\r\ndef pitagora_th(n=[0]6):\r\n # in fiecare formula punctele de la input se aduna cu elementele listei n\r\n ab = math.sqrt((a1 + n[0] - (b1 + n[2]))2 + (a2 + n[1] - (b2 + n[3]))2)\r\n bc = math.sqrt((b1 + n[2] - (c1 + n[4]))2 + (b2 + n[3] - (c2 + n[5]))2)\r\n ca = math.sqrt((c1 + n[4] - (a1 + n[0]))2 + (c2 + n[5] - (a2 + n[1]))2)\r\n e = [ab,bc,ca] # salvam in lista pentru a le sorta\r\n e.sort()\r\n return e[0], e[1], e[2] # returnam ipotenuza , cateta1, cateta2\r\n\r\n# verificam daca punctele introduse formeaza un triunghi drept\r\na3, b3, c3 = pitagora_th()\r\nif is_triangle(c3, a3, b3):\r\n print('RIGHT')\r\n exit()\r\n# verificam pentru conditia a doua 'ALMOST'\r\nelse:\r\n for i in range(6):\r\n moves ,movess = [0]6, [0]*6 # 2 tabele de zerouri\r\n moves[i] = 1 # pe rand axtualizam al i-lea zerou in 1\r\n movess[i] =-1 # pentru tablelul 2 , i-lea punct il transformam in -1\r\n a, b, c = pitagora_th(moves) # verificam daca nu e dreptunghic inlocuind tabelul de zerouri cu cel de 1\r\n g, f, d = pitagora_th(movess)\r\n if is_triangle(c,b,a) or is_triangle(d,f,g): # afisam daca valoarea returnata e True\r\n print('ALMOST')\r\n exit()\r\n '''\r\n a, b, c = pitagora_th(movess) # la fel verificam si pentru tabelul ce contine -1\r\n if is_triangle(c,b,a):\r\n print('ALMOST')\r\n exit()'''\r\n# in caz ca nu e satisfacuta nici o conditie\r\nprint('NEITHER')\r\n" ]	{"inputs": ["0 0 2 0 0 1", "2 3 4 5 6 6", "-1 0 2 0 0 1", "27 74 85 23 100 99", "-97 -19 17 62 30 -76", "28 -15 86 32 98 -41", "-66 24 8 -29 17 62", "-83 40 -80 52 -71 43", "-88 67 -62 37 -49 75", "58 45 6 22 13 79", "75 86 -82 89 -37 -35", "34 74 -2 -95 63 -33", "-7 63 78 74 -39 -30", "-49 -99 7 92 61 -28", "-90 90 87 -92 -40 -26", "-100 -100 100 -100 0 73", "39 22 94 25 69 -23", "100 100 -100 100 1 -73", "0 0 0 1 1 0", "-100 -100 100 100 -100 100", "29 83 35 35 74 65", "28 -15 86 32 -19 43", "-28 12 -97 67 -83 -57", "-83 40 -80 52 -79 39", "30 8 49 13 25 27", "23 6 63 -40 69 46", "49 -7 19 -76 26 3", "0 0 1 0 2 1", "0 0 1 0 3 1", "0 0 1 0 2 2", "0 0 1 0 4 1", "0 0 1 0 100 1", "60 4 90 -53 32 -12", "52 -34 -37 -63 23 54", "39 22 95 25 42 -33", "-10 -11 62 6 -12 -3", "22 -15 -24 77 -69 -60", "99 85 90 87 64 -20", "-50 -37 -93 -6 -80 -80", "4 -13 4 -49 -24 -13", "0 -3 -3 -10 4 -7", "-45 -87 -34 -79 -60 -62", "-67 49 89 -76 -37 87", "22 32 -33 -30 -18 68", "36 1 -17 -54 -19 55", "55 44 15 14 23 83", "-19 0 -89 -54 25 -57", "69 -45 1 11 56 -63", "72 68 56 72 33 -88", "59 86 74 -49 77 88", "-50 0 0 50 0 -50", "-50 0 0 50 0 -51", "-50 0 0 50 0 -49", "-50 0 0 50 1 -50", "-50 0 0 50 -1 -50", "-50 0 0 49 0 -50", "-50 0 0 51 0 -50", "-50 0 1 50 0 -50", "-50 0 -1 50 0 -50", "-50 1 0 50 0 -50", "-50 -1 0 50 0 -50", "-51 0 0 50 0 -50", "-49 0 0 50 0 -50"], "outputs": ["RIGHT", "NEITHER", "ALMOST", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "RIGHT", "RIGHT", "NEITHER", "RIGHT", "RIGHT", "RIGHT", "RIGHT", "RIGHT", "RIGHT", "ALMOST", "ALMOST", "ALMOST", "NEITHER", "NEITHER", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "RIGHT", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "ALMOST", "NEITHER", "NEITHER", "NEITHER", "RIGHT", "RIGHT", "RIGHT", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST"]}	UNKNOWN	PYTHON3	CODEFORCES	36
91e81a621aec1c42e9fa4f1997c14bf9	Luck is in Numbers	Vasya has been collecting transport tickets for quite a while now. His collection contains several thousands of tram, trolleybus and bus tickets. Vasya is already fed up with the traditional definition of what a lucky ticket is. Thus, he's looking for new perspectives on that. Besides, Vasya cannot understand why all tickets are only divided into lucky and unlucky ones. He thinks that all tickets are lucky but in different degrees. Having given the matter some thought, Vasya worked out the definition of a ticket's degree of luckiness. Let a ticket consist of 2n digits. Let's regard each digit as written as is shown on the picture: You have seen such digits on electronic clocks: seven segments are used to show digits. Each segment can either be colored or not. The colored segments form a digit. Vasya regards the digits as written in this very way and takes the right half of the ticket and puts it one the left one, so that the first digit coincides with the n<=+<=1-th one, the second digit coincides with the n<=+<=2-th one, ..., the n-th digit coincides with the 2n-th one. For each pair of digits, put one on another, he counts the number of segments colored in both digits and summarizes the resulting numbers. The resulting value is called the degree of luckiness of a ticket. For example, the degree of luckiness of ticket 03 equals four and the degree of luckiness of ticket 2345 equals six. You are given the number of a ticket containing 2n digits. Your task is to find among the tickets whose number exceeds the number of this ticket but also consists of 2n digits such ticket, whose degree of luckiness exceeds the degrees of luckiness of the given ticket. Moreover, if there are several such tickets, you should only choose the one with the smallest number. The first line contains the number of the ticket that consists of k characters (k<==<=2n,<=1<=≤<=n<=≤<=105). Print the number of the sought ticket or "-1" (without the quotes) if no such ticket exists. Sample Input 13 2345 88 Sample Output 20 2348 -1	[ "import sys\r\n\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\n\r\ns = input()\r\nn = len(s) // 2\r\n\r\nlines = [\"1111110\", \"0110000\", \"1101101\", \"1111001\", \"0110011\", \"1011011\", \"1011111\", \"1110000\", \"1111111\", \"1111011\"]\r\ncommon = [[0] * 10 for _ in range(10)]\r\nfor i in range(10):\r\n for j in range(10):\r\n for k in range(7):\r\n common[i][j] += 1 if lines[i][k] == '1' and lines[j][k] == '1' else 0\r\n\r\nleft = list(map(int, list(s[:n])))\r\nright = list(map(int, list(s[n:])))\r\n\r\nstart = 0\r\nstartVals = [0] * (n + 1)\r\nfor i in range(n):\r\n start += common[left[i]][right[i]]\r\n startVals[i + 1] = start\r\ncur = start\r\n\r\nmaxVals = [0] * (n + 1)\r\nfor k in reversed(range(n)):\r\n maxVals[k] = maxVals[k+1] + max(common[left[k]])\r\n\r\nfor k in reversed(range(n)):\r\n for num in range(right[k] + 1, 10):\r\n if common[left[k]][num] + maxVals[k + 1] + startVals[k] > start:\r\n startVals[k + 1] = startVals[k] + common[left[k]][num]\r\n right[k] = num\r\n for j in range(k + 1, n):\r\n for num2 in range(0, 10):\r\n if common[left[j]][num2] + maxVals[j + 1] + startVals[j] > start:\r\n startVals[j + 1] = startVals[j] + common[left[j]][num2]\r\n right[j] = num2\r\n break\r\n print(\"\".join(map(str, left)) + \"\".join(map(str, right)))\r\n exit()\r\n\r\nmaxVals = [0] * (n + 1)\r\nfor k in range(n):\r\n maxVals[k + 1] = maxVals[k] + max(common[left[k]])\r\n\r\nfor k in reversed(range(n)):\r\n for num in range(left[k] + 1, 10):\r\n if max(common[num]) + maxVals[k] + 7 * (n - 1 - k) > start:\r\n maxVals[k + 1] = maxVals[k] + max(common[num])\r\n left[k] = num\r\n\r\n for j in range(k + 1, n):\r\n for num2 in range(0, 10):\r\n if max(common[num2]) + maxVals[j] + 7 * (n - 1 - j) > start:\r\n maxVals[j + 1] = maxVals[j] + max(common[num2])\r\n left[j] = num2\r\n break\r\n\r\n maxVals = [0] * (n + 1)\r\n for j in reversed(range(n)):\r\n maxVals[j] = maxVals[j + 1] + max(common[left[j]])\r\n\r\n for j in range(n):\r\n for num2 in range(0, 10):\r\n if common[left[j]][num2] + maxVals[j + 1] + startVals[j] > start:\r\n startVals[j + 1] = startVals[j] + common[left[j]][num2]\r\n right[j] = num2\r\n break\r\n print(\"\".join(map(str, left)) + \"\".join(map(str, right)))\r\n exit()\r\n\r\nprint(-1)\r\n" ]	{"inputs": ["13", "2345", "88", "682444", "685116", "576079", "569631", "662302", "453066", "659821", "26592659", "47699969", "09980988", "69886888", "9588995888", "39930089893999008989", "84163081988476808998", "88898888988889888898", "01273988890029888889", "18858998881886898888", "8259988583", "5898888944", "855889831888", "439968658988", "335598338288", "43223543566815212912981204669368711837288602368426888989998989988898989999998988988988999998999899984322884358881924880288488486998884783928868286842888888998888898888898889898888898898888888898889888", "99393666387527964893713203630389899998898999889989898999898899999899899899998889899998898989989889998888368888898788888990888868038988989889889888898989888889889998989989889899888888989888898998988899", "40724501726491585262016953677772948189547459145312538682757304290442786808955140603033718167250989898098898078698368686201885869883288848858845889691868888805988428844298880895618068983393806889898888", "79088264099789040101338987288228743957988889999888988998999888988999988999899889889999999898888899889988886808878908600889888328888899889798888998981888888899888888878998898888888958898899988888889988", "51974056597584768542734492125108488334626378590999898888998889899888898998889989988889898988999988899790085898898976884233448882618888038888883899099888888888888989888888888888988888888889888819998888", "496198999898", "09989988", "748989888889", "6984899899", "68623695792730582626313022231731418370802097728016898999999888889889989888989999898988988898888988888868389688838098868896902888793384830880209692808589899898888888888988888898888888898898888888898888", "34740506804988021948888998989898988889889889898888899989999999888988998998998889898989899998899998888439088688898808894888899898888898880988888989888889898989999988898898889899888989898989899888888888", "22938645962769613028898841128696546129021084561286040502773858728727299998988899899898989998888888888889889986296978908889880418888689802802008858828808868208988898888988999888889889989898898888888888", "34746525584443243456003041207650137412317331793360297058977077354535244802188888988888998998888889893498898958888388396600804028869848940893993789898089309887308898469904880874888898808889898888888888", "85134786461893350509517211574918339368780716712903244472148878199438599584095845405384064998889998998978978848989896088984387453988889938838099684288884488234888898993888858909888643588888493888998888", "0380023162775902996798876281379973370849", "3317497200125434836799763396859317396410", "5212759368584085865703568602327752094982", "547226955080909274578712855056537756831350123450633621352615", "090134011009710349472352007887283047446420798236414107901761"], "outputs": ["20", "2348", "-1", "682445", "685120", "576086", "569632", "662362", "453068", "659822", "26602660", "47804080", "28882888", "80888088", "9608886088", "39930098883883008888", "84163082000406308200", "88988888888888888888", "01274888880020488888", "18859888880885888888", "8259988588", "5898888945", "855889832088", "439968688868", "335598338388", "43223543566815212912981204669368711837288602368426888989998989988898989999998988988988999998999908884322354356680520280288020466836800083028860236842688888888888888888888888888888888888888888888880888", "99393666387527964893713203630389899998898999889989898999898899999899899899998889899998898989989890888838366638052086488300320363038888888888888888888888888888888888888888888888888888888888888888888088", "40724501726491585262016953677772948189547459145312538682757304290442786808955140603033718167250998884002450002648058526200685360000284808854045804530253868205030428044208680885504060303300806025088888", "79088264099789040101338987288228743957988889999888988998999888988999988999899889889999999898888899889988886808878908600889888328888899889798888998981888888899888888878998898888888968888888888888888888", "51974056597584768542734492125108488334626378590999898888998889899888898998889989988889898988999988899790085898898976884233448882618888038888883899099888888888888989888888888888988888888889888820888888", "496200006200", "20882088", "749888048888", "6984968848", "68623695792730582626313022231731418370802097728016898999999888889889989888989999898988988898888988888868389688838098868896902888793384830880209692808688888888888888888888888888888888888888888888888888", "34740506804988021948888998989898988889889889898888899989999999888988998998998889898989899998899998888439088688898808894888899898888898888888888888888888888888888888888888888888888888888888888888888888", "22938645962769613028898841128696546129021084561286040502773858728727299998988899899898989998888888888889889986296978908889884002868654602802008456028604050200385802802028888888888888888888888888888888", "34746525584443243456003041207650137412317331793360297058977077354535244802188888988888998998888889893498898958888388396600804028869848940893993789898089309887308898469904880874888898888888888888888888", "85134786461893350509517211574918339368780716712903244472148878199438599584095845405384064998889998998978978848989896088984387453988889938838099684288884488234888898993888858909888643588888498888888888", "0380023162775902996798876281379973370850", "3317497200125434836799763396859317396420", "5212759368584085865703568602327752094983", "547226955080909274578712855056537756831350123450633621352616", "090134011009710349472352007887283047446420798236414107901763"]}	UNKNOWN	PYTHON3	CODEFORCES	1
91f7cff482b2b493374285494a5a7025	Beautiful Sets of Points	Manao has invented a new mathematical term — a beautiful set of points. He calls a set of points on a plane beautiful if it meets the following conditions: 1. The coordinates of each point in the set are integers. 1. For any two points from the set, the distance between them is a non-integer. Consider all points (x,<=y) which satisfy the inequations: 0<=≤<=x<=≤<=n; 0<=≤<=y<=≤<=m; x<=+<=y<=><=0. Choose their subset of maximum size such that it is also a beautiful set of points. The single line contains two space-separated integers n and m (1<=≤<=n,<=m<=≤<=100). In the first line print a single integer — the size k of the found beautiful set. In each of the next k lines print a pair of space-separated integers — the x- and y- coordinates, respectively, of a point from the set. If there are several optimal solutions, you may print any of them. Sample Input 2 2 4 3 Sample Output 3 0 1 1 2 2 0 4 0 3 2 1 3 0 4 2	[ "import sys\ninput = lambda:sys.stdin.readline().strip()\nn,m = map(int,input().split())\nx = min(n,m)\nprint(x+1)\nfor i in range(x+1):\n print(i,x-i)\n\t \t\t\t \t\t\t\t\t \t \t\t\t \t\t\t\t\t\t \t \t", "from math import \r\nn,m=map(int,input().split())\r\nt=min(n,m)\r\nprint(t+1)\r\nfor i in range(t+1):\r\n\tprint(t-i,i)", "n, m = map(int, input().split())\r\nprint(min(n, m) + 1)\r\nif n > m:\r\n for i in range(m+1):\r\n print(i, m-i)\r\nelse:\r\n for i in range(n+1):\r\n print(i, n-i)\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\n\nN,M = map(int,input().split())\nx,y = 0,M\nans = []\nfor i in range(min(N,M)+1):\n ans.append([x+i,y-i])\nprint(len(ans))\nfor i in ans:\n print(i)", "row, col = list(map(int, input().split()))\r\nprint(min(row, col)+1)\r\nfor i in range(0, min(row, col)+1):\r\n print(i, col-i)", "n,m=map(int,input().split())\r\nmnn=min(m,n)\r\nprint(mnn+1)\r\nfor i in range(mnn+1):\r\n print(i,mnn-i)", "n,m=map(int,input().split())\r\ns=min(m,n)+1\r\nprint(s)\r\nfor i in range(s):\r\n print( i, s-i-1)\r\n\r\n", "def solve(n,m):\n val = min(n,m)\n print(val+1)\n for i in range(val+1):\n print(i,val-i)\n\n\nn,m = [int(ele) for ele in input().split()]\nsolve(n,m)", "lst = list(map(int, input().split(' ')))\nn, m = lst\nprint(min(n, m) + 1)\nx = 0\ny = m\nwhile(x <= n and y >= 0):\n\tprint(x, y)\n\tx += 1\n\ty -= 1", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\ndiagonals = min(n,m)\r\npoints = []\r\nfor x in range(diagonals+1):\r\n points.append(str(x)+\" \"+str(diagonals-x))\r\nprint(len(points))\r\nfor x in range(len(points)):\r\n print(points[x])", "x=min(map(int,input().split()))\r\nprint(x+1)\r\nfor i in range(x+1):\r\n print(i, x-i)\r\n", "n = min(map(int, input().split()))\r\nprint(n+1)\r\nfor i in range(n+1):\r\n print(i, n-i)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nk = min(n, m)\r\nprint(k + 1)\r\nfor i in range(k + 1):\r\n\tprint(k - i, i)", "# LUOGU_RID: 129559212\nimport sys\r\ninput = lambda:sys.stdin.readline().strip()\r\nn,m = map(int,input().split())\r\nx = min(n,m)\r\nprint(x+1)\r\nfor i in range(x+1):\r\n print(i,x-i)", "s=min(map(int,input().split()))\r\nprint(s+1)\r\nfor i in range(s+1): print(i,s-i)", "s=min(map(int,input().split()))\nprint(s+1)\nfor i in range(s+1):print(i,s-i)\n\n\t \t \t \t \t\t \t \t\t\t \t \t", "def clc(): \r\n n,m= map(int,input().split())\r\n n,m = min(n,m),max(n,m)\r\n out= []\r\n \r\n for i in range(n+1):\r\n out.append((i,n-i))\r\n print(len(out))\r\n for i in range(len(out)):\r\n print(out[i][0],out[i][1])\r\n\r\n\r\n\r\nclc()\r\n ", "n,m=map(int,input().split())\r\nz=min(n,m)\r\nprint(z+1)\r\nfor i in range(z+1):\r\n print(i,z-i)", "n, m = map(int,input().split())\n\nans = min(n,m)+1\nprint(ans)\nfor i in range(ans):\n print(i, ans-1-i)", "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 Beautiful_Sets_of_Points():\r\n n, m = invr()\r\n\r\n num_points = min(n,m) + 1 \r\n\r\n outputStr = ''\r\n if n == min(n,m):\r\n\r\n start_x = n \r\n start_y = 0 \r\n\r\n for i in range(num_points):\r\n outputStr += str(start_x) + ' ' + str(start_y) + '\\n'\r\n start_x -= 1\r\n start_y += 1 \r\n \r\n else:\r\n start_x = 0 \r\n start_y = m \r\n\r\n for i in range(num_points):\r\n outputStr += str(start_x) + ' ' + str(start_y) + '\\n'\r\n start_x += 1\r\n start_y -= 1 \r\n \r\n outputStr = outputStr.strip()\r\n print(num_points)\r\n print(outputStr)\r\n return \r\n\r\n\r\nBeautiful_Sets_of_Points()" ]	{"inputs": ["2 2", "4 3", "21 21", "10 1", "4 4", "1 1", "5 5", "100 100", "96 96", "99 100", "67 58", "67 59", "80 91", "100 11", "16 55", "13 71", "30 40", "77 77", "6 6", "37 42", "88 88", "95 99", "93 70", "4 6", "1 4", "2 10", "6 7", "28 28", "10 6", "85 48", "9 6", "2 6", "6 4", "6 10", "16 5", "7 6", "3 4", "13 18", "5 100", "11 9", "13 13", "1 5", "3 19", "10 10", "3 7", "98 76", "10 100"], "outputs": ["3\n0 1\n1 2\n2 0", "4\n0 3\n2 1\n3 0\n4 2", "22\n21 0\n20 1\n19 2\n18 3\n17 4\n16 5\n15 6\n14 7\n13 8\n12 9\n11 10\n10 11\n9 12\n8 13\n7 14\n6 15\n5 16\n4 17\n3 18\n2 19\n1 20\n0 21", "2\n1 0\n0 1", "5\n4 0\n3 1\n2 2\n1 3\n0 4", "2\n1 0\n0 1", "6\n5 0\n4 1\n3 2\n2 3\n1 4\n0 5", "101\n100 0\n99 1\n98 2\n97 3\n96 4\n95 5\n94 6\n93 7\n92 8\n91 9\n90 10\n89 11\n88 12\n87 13\n86 14\n85 15\n84 16\n83 17\n82 18\n81 19\n80 20\n79 21\n78 22\n77 23\n76 24\n75 25\n74 26\n73 27\n72 28\n71 29\n70 30\n69 31\n68 32\n67 33\n66 34\n65 35\n64 36\n63 37\n62 38\n61 39\n60 40\n59 41\n58 42\n57 43\n56 44\n55 45\n54 46\n53 47\n52 48\n51 49\n50 50\n49 51\n48 52\n47 53\n46 54\n45 55\n44 56\n43 57\n42 58\n41 59\n40 60\n39 61\n38 62\n37 63\n36 64\n35 65\n34 66\n33 67\n32 68\n31 69\n30 70\n29 71\n28 72\n27 7...", "97\n96 0\n95 1\n94 2\n93 3\n92 4\n91 5\n90 6\n89 7\n88 8\n87 9\n86 10\n85 11\n84 12\n83 13\n82 14\n81 15\n80 16\n79 17\n78 18\n77 19\n76 20\n75 21\n74 22\n73 23\n72 24\n71 25\n70 26\n69 27\n68 28\n67 29\n66 30\n65 31\n64 32\n63 33\n62 34\n61 35\n60 36\n59 37\n58 38\n57 39\n56 40\n55 41\n54 42\n53 43\n52 44\n51 45\n50 46\n49 47\n48 48\n47 49\n46 50\n45 51\n44 52\n43 53\n42 54\n41 55\n40 56\n39 57\n38 58\n37 59\n36 60\n35 61\n34 62\n33 63\n32 64\n31 65\n30 66\n29 67\n28 68\n27 69\n26 70\n25 71\n24 72\n23 73\n...", "100\n99 0\n98 1\n97 2\n96 3\n95 4\n94 5\n93 6\n92 7\n91 8\n90 9\n89 10\n88 11\n87 12\n86 13\n85 14\n84 15\n83 16\n82 17\n81 18\n80 19\n79 20\n78 21\n77 22\n76 23\n75 24\n74 25\n73 26\n72 27\n71 28\n70 29\n69 30\n68 31\n67 32\n66 33\n65 34\n64 35\n63 36\n62 37\n61 38\n60 39\n59 40\n58 41\n57 42\n56 43\n55 44\n54 45\n53 46\n52 47\n51 48\n50 49\n49 50\n48 51\n47 52\n46 53\n45 54\n44 55\n43 56\n42 57\n41 58\n40 59\n39 60\n38 61\n37 62\n36 63\n35 64\n34 65\n33 66\n32 67\n31 68\n30 69\n29 70\n28 71\n27 72\n26 73...", "59\n58 0\n57 1\n56 2\n55 3\n54 4\n53 5\n52 6\n51 7\n50 8\n49 9\n48 10\n47 11\n46 12\n45 13\n44 14\n43 15\n42 16\n41 17\n40 18\n39 19\n38 20\n37 21\n36 22\n35 23\n34 24\n33 25\n32 26\n31 27\n30 28\n29 29\n28 30\n27 31\n26 32\n25 33\n24 34\n23 35\n22 36\n21 37\n20 38\n19 39\n18 40\n17 41\n16 42\n15 43\n14 44\n13 45\n12 46\n11 47\n10 48\n9 49\n8 50\n7 51\n6 52\n5 53\n4 54\n3 55\n2 56\n1 57\n0 58", "60\n59 0\n58 1\n57 2\n56 3\n55 4\n54 5\n53 6\n52 7\n51 8\n50 9\n49 10\n48 11\n47 12\n46 13\n45 14\n44 15\n43 16\n42 17\n41 18\n40 19\n39 20\n38 21\n37 22\n36 23\n35 24\n34 25\n33 26\n32 27\n31 28\n30 29\n29 30\n28 31\n27 32\n26 33\n25 34\n24 35\n23 36\n22 37\n21 38\n20 39\n19 40\n18 41\n17 42\n16 43\n15 44\n14 45\n13 46\n12 47\n11 48\n10 49\n9 50\n8 51\n7 52\n6 53\n5 54\n4 55\n3 56\n2 57\n1 58\n0 59", "81\n80 0\n79 1\n78 2\n77 3\n76 4\n75 5\n74 6\n73 7\n72 8\n71 9\n70 10\n69 11\n68 12\n67 13\n66 14\n65 15\n64 16\n63 17\n62 18\n61 19\n60 20\n59 21\n58 22\n57 23\n56 24\n55 25\n54 26\n53 27\n52 28\n51 29\n50 30\n49 31\n48 32\n47 33\n46 34\n45 35\n44 36\n43 37\n42 38\n41 39\n40 40\n39 41\n38 42\n37 43\n36 44\n35 45\n34 46\n33 47\n32 48\n31 49\n30 50\n29 51\n28 52\n27 53\n26 54\n25 55\n24 56\n23 57\n22 58\n21 59\n20 60\n19 61\n18 62\n17 63\n16 64\n15 65\n14 66\n13 67\n12 68\n11 69\n10 70\n9 71\n8 72\n7 73\n6 ...", "12\n11 0\n10 1\n9 2\n8 3\n7 4\n6 5\n5 6\n4 7\n3 8\n2 9\n1 10\n0 11", "17\n16 0\n15 1\n14 2\n13 3\n12 4\n11 5\n10 6\n9 7\n8 8\n7 9\n6 10\n5 11\n4 12\n3 13\n2 14\n1 15\n0 16", "14\n13 0\n12 1\n11 2\n10 3\n9 4\n8 5\n7 6\n6 7\n5 8\n4 9\n3 10\n2 11\n1 12\n0 13", "31\n30 0\n29 1\n28 2\n27 3\n26 4\n25 5\n24 6\n23 7\n22 8\n21 9\n20 10\n19 11\n18 12\n17 13\n16 14\n15 15\n14 16\n13 17\n12 18\n11 19\n10 20\n9 21\n8 22\n7 23\n6 24\n5 25\n4 26\n3 27\n2 28\n1 29\n0 30", "78\n77 0\n76 1\n75 2\n74 3\n73 4\n72 5\n71 6\n70 7\n69 8\n68 9\n67 10\n66 11\n65 12\n64 13\n63 14\n62 15\n61 16\n60 17\n59 18\n58 19\n57 20\n56 21\n55 22\n54 23\n53 24\n52 25\n51 26\n50 27\n49 28\n48 29\n47 30\n46 31\n45 32\n44 33\n43 34\n42 35\n41 36\n40 37\n39 38\n38 39\n37 40\n36 41\n35 42\n34 43\n33 44\n32 45\n31 46\n30 47\n29 48\n28 49\n27 50\n26 51\n25 52\n24 53\n23 54\n22 55\n21 56\n20 57\n19 58\n18 59\n17 60\n16 61\n15 62\n14 63\n13 64\n12 65\n11 66\n10 67\n9 68\n8 69\n7 70\n6 71\n5 72\n4 73\n3 74\n...", "7\n6 0\n5 1\n4 2\n3 3\n2 4\n1 5\n0 6", "38\n37 0\n36 1\n35 2\n34 3\n33 4\n32 5\n31 6\n30 7\n29 8\n28 9\n27 10\n26 11\n25 12\n24 13\n23 14\n22 15\n21 16\n20 17\n19 18\n18 19\n17 20\n16 21\n15 22\n14 23\n13 24\n12 25\n11 26\n10 27\n9 28\n8 29\n7 30\n6 31\n5 32\n4 33\n3 34\n2 35\n1 36\n0 37", "89\n88 0\n87 1\n86 2\n85 3\n84 4\n83 5\n82 6\n81 7\n80 8\n79 9\n78 10\n77 11\n76 12\n75 13\n74 14\n73 15\n72 16\n71 17\n70 18\n69 19\n68 20\n67 21\n66 22\n65 23\n64 24\n63 25\n62 26\n61 27\n60 28\n59 29\n58 30\n57 31\n56 32\n55 33\n54 34\n53 35\n52 36\n51 37\n50 38\n49 39\n48 40\n47 41\n46 42\n45 43\n44 44\n43 45\n42 46\n41 47\n40 48\n39 49\n38 50\n37 51\n36 52\n35 53\n34 54\n33 55\n32 56\n31 57\n30 58\n29 59\n28 60\n27 61\n26 62\n25 63\n24 64\n23 65\n22 66\n21 67\n20 68\n19 69\n18 70\n17 71\n16 72\n15 73\n...", "96\n95 0\n94 1\n93 2\n92 3\n91 4\n90 5\n89 6\n88 7\n87 8\n86 9\n85 10\n84 11\n83 12\n82 13\n81 14\n80 15\n79 16\n78 17\n77 18\n76 19\n75 20\n74 21\n73 22\n72 23\n71 24\n70 25\n69 26\n68 27\n67 28\n66 29\n65 30\n64 31\n63 32\n62 33\n61 34\n60 35\n59 36\n58 37\n57 38\n56 39\n55 40\n54 41\n53 42\n52 43\n51 44\n50 45\n49 46\n48 47\n47 48\n46 49\n45 50\n44 51\n43 52\n42 53\n41 54\n40 55\n39 56\n38 57\n37 58\n36 59\n35 60\n34 61\n33 62\n32 63\n31 64\n30 65\n29 66\n28 67\n27 68\n26 69\n25 70\n24 71\n23 72\n22 73\n...", "71\n70 0\n69 1\n68 2\n67 3\n66 4\n65 5\n64 6\n63 7\n62 8\n61 9\n60 10\n59 11\n58 12\n57 13\n56 14\n55 15\n54 16\n53 17\n52 18\n51 19\n50 20\n49 21\n48 22\n47 23\n46 24\n45 25\n44 26\n43 27\n42 28\n41 29\n40 30\n39 31\n38 32\n37 33\n36 34\n35 35\n34 36\n33 37\n32 38\n31 39\n30 40\n29 41\n28 42\n27 43\n26 44\n25 45\n24 46\n23 47\n22 48\n21 49\n20 50\n19 51\n18 52\n17 53\n16 54\n15 55\n14 56\n13 57\n12 58\n11 59\n10 60\n9 61\n8 62\n7 63\n6 64\n5 65\n4 66\n3 67\n2 68\n1 69\n0 70", "5\n4 0\n3 1\n2 2\n1 3\n0 4", "2\n1 0\n0 1", "3\n2 0\n1 1\n0 2", "7\n6 0\n5 1\n4 2\n3 3\n2 4\n1 5\n0 6", "29\n28 0\n27 1\n26 2\n25 3\n24 4\n23 5\n22 6\n21 7\n20 8\n19 9\n18 10\n17 11\n16 12\n15 13\n14 14\n13 15\n12 16\n11 17\n10 18\n9 19\n8 20\n7 21\n6 22\n5 23\n4 24\n3 25\n2 26\n1 27\n0 28", "7\n6 0\n5 1\n4 2\n3 3\n2 4\n1 5\n0 6", "49\n48 0\n47 1\n46 2\n45 3\n44 4\n43 5\n42 6\n41 7\n40 8\n39 9\n38 10\n37 11\n36 12\n35 13\n34 14\n33 15\n32 16\n31 17\n30 18\n29 19\n28 20\n27 21\n26 22\n25 23\n24 24\n23 25\n22 26\n21 27\n20 28\n19 29\n18 30\n17 31\n16 32\n15 33\n14 34\n13 35\n12 36\n11 37\n10 38\n9 39\n8 40\n7 41\n6 42\n5 43\n4 44\n3 45\n2 46\n1 47\n0 48", "7\n6 0\n5 1\n4 2\n3 3\n2 4\n1 5\n0 6", "3\n2 0\n1 1\n0 2", "5\n4 0\n3 1\n2 2\n1 3\n0 4", "7\n6 0\n5 1\n4 2\n3 3\n2 4\n1 5\n0 6", "6\n5 0\n4 1\n3 2\n2 3\n1 4\n0 5", "7\n6 0\n5 1\n4 2\n3 3\n2 4\n1 5\n0 6", "4\n3 0\n2 1\n1 2\n0 3", "14\n13 0\n12 1\n11 2\n10 3\n9 4\n8 5\n7 6\n6 7\n5 8\n4 9\n3 10\n2 11\n1 12\n0 13", "6\n5 0\n4 1\n3 2\n2 3\n1 4\n0 5", "10\n9 0\n8 1\n7 2\n6 3\n5 4\n4 5\n3 6\n2 7\n1 8\n0 9", "14\n13 0\n12 1\n11 2\n10 3\n9 4\n8 5\n7 6\n6 7\n5 8\n4 9\n3 10\n2 11\n1 12\n0 13", "2\n1 0\n0 1", "4\n3 0\n2 1\n1 2\n0 3", "11\n10 0\n9 1\n8 2\n7 3\n6 4\n5 5\n4 6\n3 7\n2 8\n1 9\n0 10", "4\n3 0\n2 1\n1 2\n0 3", "77\n76 0\n75 1\n74 2\n73 3\n72 4\n71 5\n70 6\n69 7\n68 8\n67 9\n66 10\n65 11\n64 12\n63 13\n62 14\n61 15\n60 16\n59 17\n58 18\n57 19\n56 20\n55 21\n54 22\n53 23\n52 24\n51 25\n50 26\n49 27\n48 28\n47 29\n46 30\n45 31\n44 32\n43 33\n42 34\n41 35\n40 36\n39 37\n38 38\n37 39\n36 40\n35 41\n34 42\n33 43\n32 44\n31 45\n30 46\n29 47\n28 48\n27 49\n26 50\n25 51\n24 52\n23 53\n22 54\n21 55\n20 56\n19 57\n18 58\n17 59\n16 60\n15 61\n14 62\n13 63\n12 64\n11 65\n10 66\n9 67\n8 68\n7 69\n6 70\n5 71\n4 72\n3 73\n2 74\n...", "11\n10 0\n9 1\n8 2\n7 3\n6 4\n5 5\n4 6\n3 7\n2 8\n1 9\n0 10"]}	UNKNOWN	PYTHON3	CODEFORCES	20
92033556eb9354fb8e42ff803e338e16	Polycarp at the Radio	Polycarp is a music editor at the radio station. He received a playlist for tomorrow, that can be represented as a sequence a1,<=a2,<=...,<=an, where ai is a band, which performs the i-th song. Polycarp likes bands with the numbers from 1 to m, but he doesn't really like others. We define as bj the number of songs the group j is going to perform tomorrow. Polycarp wants to change the playlist in such a way that the minimum among the numbers b1,<=b2,<=...,<=bm will be as large as possible. Find this maximum possible value of the minimum among the bj (1<=≤<=j<=≤<=m), and the minimum number of changes in the playlist Polycarp needs to make to achieve it. One change in the playlist is a replacement of the performer of the i-th song with any other group. The first line of the input contains two integers n and m (1<=≤<=m<=≤<=n<=≤<=2000). The second line contains n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109), where ai is the performer of the i-th song. In the first line print two integers: the maximum possible value of the minimum among the bj (1<=≤<=j<=≤<=m), where bj is the number of songs in the changed playlist performed by the j-th band, and the minimum number of changes in the playlist Polycarp needs to make. In the second line print the changed playlist. If there are multiple answers, print any of them. Sample Input 4 2 1 2 3 2 7 3 1 3 2 2 2 2 1 4 4 1000000000 100 7 1000000000 Sample Output 2 1 1 2 1 2 2 1 1 3 3 2 2 2 1 1 4 1 2 3 4	[ "n,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ntot,ans,s=n//m,0,dict()\r\nfor i in range(m):\r\n s[i+1]=0\r\nfor i in range(n):\r\n if a[i]<=m:\r\n s[a[i]]+=1\r\ni,j=0,0\r\nwhile i<m:\r\n while s[i+1]<tot:\r\n if a[j]>m:\r\n a[j]=i+1\r\n ans+=1\r\n s[i+1]+=1\r\n elif s[a[j]]>tot:\r\n s[a[j]]-=1\r\n a[j]=i+1\r\n ans+=1\r\n s[i+1]+=1\r\n j+=1\r\n i+=1\r\nprint(tot,ans)\r\nprint(a)", "#!/usr/bin/env\tpython\r\n#--coding:utf-8 --\r\nn,m=map(int,input().split())\r\nn//=m\r\nA=list(map(int,input().split()))\r\nS=[n]m\r\nL=[]\r\nfor i,a in enumerate(A):\r\n\ta-=1\r\n\tif m>a and S[a]:S[a]-=1\r\n\telse:L.append(i)\r\nfor i,s in enumerate(S,1):\r\n\tfor _ in range(s):A[L.pop()]=i\r\nprint(n,sum(S))\r\nprint(A)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN,M = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nothers = []\r\nlib = defaultdict(list)\r\nt = N//M\r\nm = N%M\r\nfor i in range(N):\r\n if A[i]<=M:\r\n if len(lib[A[i]])<t:\r\n lib[A[i]].append(i)\r\n elif m>0:\r\n lib[A[i]].append(i)\r\n m-=1\r\n else:\r\n others.append(i)\r\n else:\r\n others.append(i)\r\n \r\nans = 0\r\nfor i in range(1,M+1):\r\n while len(lib[i])<t:\r\n j = others.pop()\r\n lib[i].append(j)\r\n A[j]=i\r\n ans+=1\r\n\r\nprint(t,ans)\r\nprint(A)" ]	{"inputs": ["4 2\n1 2 3 2", "7 3\n1 3 2 2 2 2 1", "4 4\n1000000000 100 7 1000000000", "1 1\n1", "1 1\n381183829", "2 1\n234089514 461271539", "5 4\n3 1 495987801 522279660 762868488", "10 2\n20515728 1 580955166 856585851 1 738372422 1 2 1 900189620", "20 3\n3 2 2 3 3 3 2 3 3 3 2 748578511 149249674 844954396 321901094 3 255089924 244803836 3 943090472", "50 10\n820558149 7 10 7 9 9 7 7 7 9 7 10 8 8 10 8 6 8 9 9 8 971788012 9 8 9 10 6 5 871178015 4 10 5 7 9 10 9 10 4 643998638 8 10 9 10 766953454 5 9 10 10 8 10", "80 79\n17 59 54 75 68 69 69 67 62 77 65 78 54 69 59 73 68 57 65 54 66 46 68 68 67 65 75 39 62 63 45 78 72 62 78 34 74 68 78 68 79 60 64 56 68 76 66 44 43 69 74 75 44 66 71 78 41 75 71 77 59 56 78 52 61 64 64 53 79 34 79 79 65 45 79 67 65 78 68 74", "2 1\n1 1000000000", "9 2\n4681851 569491424 579550098 1 554288395 496088833 49710380 904873068 189406728", "7 4\n1 1 1 1 1 1 1", "10 4\n1 1 2 2 3 3 4 4 4 4", "9 5\n1 1 1 1 1 2 3 4 5", "5 4\n10 1 1 1 1", "4 2\n1 1 1 1", "7 3\n2 2 2 1 3 7 6", "8 3\n1 1 1 1 2 2 2 2", "12 4\n1 1 1 1 2 2 2 2 3 3 4 4", "7 2\n2 2 2 2 2 2 3", "6 3\n3 3 3 100 1 2", "13 4\n1 1 1 1 2 2 2 2 3 3 4 4 4", "10 2\n1 1 1 1 1 1 3 4 5 6"], "outputs": ["2 1\n1 2 1 2 ", "2 1\n1 3 3 2 2 2 1 ", "1 4\n1 2 3 4 ", "1 0\n1 ", "1 1\n1 ", "2 2\n1 1 ", "1 2\n3 1 2 4 762868488 ", "5 5\n1 1 2 2 1 2 1 2 1 2 ", "6 8\n2 2 2 3 3 3 2 3 3 3 2 1 1 1 1 3 1 1 3 2 ", "5 23\n1 2 4 2 3 3 7 7 7 3 7 4 2 2 5 2 6 8 3 3 8 1 4 8 9 5 6 5 1 4 6 5 7 9 6 9 6 4 1 8 10 9 10 1 5 9 10 10 8 10 ", "1 46\n17 7 4 36 22 29 30 20 9 40 13 42 5 31 8 73 23 57 14 54 18 46 24 25 21 15 37 39 10 63 3 47 72 62 48 1 33 26 49 27 55 60 11 6 28 76 19 2 43 69 35 38 44 66 32 50 41 75 71 77 59 56 51 52 61 12 64 53 58 34 70 79 16 45 79 67 65 78 68 74 ", "2 1\n1 1 ", "4 7\n1 1 1 1 2 2 2 2 189406728 ", "1 3\n2 3 4 1 1 1 1 ", "2 0\n1 1 2 2 3 3 4 4 4 4 ", "1 0\n1 1 1 1 1 2 3 4 5 ", "1 3\n2 3 4 1 1 ", "2 2\n2 2 1 1 ", "2 2\n2 2 2 1 3 1 3 ", "2 2\n3 3 1 1 2 2 2 2 ", "3 2\n3 1 1 1 4 2 2 2 3 3 4 4 ", "3 3\n1 1 2 2 2 2 1 ", "2 2\n2 3 3 1 1 2 ", "3 1\n3 1 1 1 2 2 2 2 3 3 4 4 4 ", "5 5\n2 1 1 1 1 1 2 2 2 2 "]}	UNKNOWN	PYTHON3	CODEFORCES	3
9220b32c3435f2ebc62e4b87277d09cc	Ciel and Robot	Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There are four move operations at all: - 'U': go up, (x, y) <=→<= (x, y+1); - 'D': go down, (x, y) <=→<= (x, y-1); - 'L': go left, (x, y) <=→<= (x-1, y); - 'R': go right, (x, y) <=→<= (x+1, y). The robot will do the operations in s from left to right, and repeat it infinite times. Help Fox Ciel to determine if after some steps the robot will located in (a,<=b). The first line contains two integers a and b, (<=-<=109<=≤<=a,<=b<=≤<=109). The second line contains a string s (1<=≤<=\|s\|<=≤<=100, s only contains characters 'U', 'D', 'L', 'R') — the command. Print "Yes" if the robot will be located at (a,<=b), and "No" otherwise. Sample Input 2 2 RU 1 2 RU -1 1000000000 LRRLU 0 0 D Sample Output Yes No Yes Yes	[ "#!/usr/bin/python3\nimport sys\n\nMAPPING = {\n 'U': (0, 1),\n 'D': (0, -1),\n 'L': (-1, 0),\n 'R': (1, 0),\n}\n\n\ndef read_ints():\n return [int(x) for x in input().split()]\n\n\ndef get_vectors(moves):\n vector = (0, 0)\n yield vector\n for move in moves:\n delta = MAPPING[move]\n vector = (vector[0] + delta[0], vector[1] + delta[1])\n yield vector\n\n\ndef mul(pair, a):\n return pair[0] * a, pair[1] * a\n\n\ndef is_achievable(diff, period):\n if diff == (0, 0):\n return True\n if period == (0, 0):\n return False\n if period[0] != 0:\n if diff[0] % period[0] == 0:\n times = diff[0] // period[0]\n if times > 0 and mul(period, times) == diff:\n return True\n if period[1] != 0:\n if diff[1] % period[1] == 0:\n times = diff[1] // period[1]\n if times > 0 and mul(period, times) == diff:\n return True\n return False\n\n\ndef main():\n a, b = read_ints()\n moves = input().strip()\n vectors = list(get_vectors(moves))\n period = vectors[-1]\n for vector in vectors:\n diff = (a - vector[0], b - vector[1])\n if is_achievable(diff, period):\n print('Yes')\n sys.exit(0)\n print('No')\n\n\nif __name__ == '__main__':\n main()\n", "#!/usr/bin/env python3\nimport operator\ntable = {\n 'U' : ( 0, 1),\n 'D' : ( 0, -1),\n 'L' : (-1, 0),\n 'R' : ( 1, 0) }\n\na, b = map(int,input().split())\ns = list(input())\n\nzs = set()\nx, y = 0, 0\nzs.add((x, y))\nfor c in s:\n x, y = map(operator.add, (x, y), table[c])\n zs.add((x, y))\n\nresult = False\nfor (zx, zy) in zs:\n p, q = a - zx, b - zy\n if (x == 0 and p != 0) or (x != 0 and p % x != 0) or (x != 0 and p // x < 0): continue\n if (y == 0 and q != 0) or (y != 0 and q % y != 0) or (y != 0 and q // y < 0): continue\n if x != 0 and y != 0 and p // x != q // y: continue\n result = True\n\nprint('Yes' if result else 'No')\n", "R = lambda: map(int, input().split())\r\na, b = R()\r\ncs = [[0, 0]]\r\nd = {'R': (1, 0), 'L': (-1, 0), 'U': (0, 1), 'D': (0, -1)}\r\nfor c in input():\r\n cs.append([cs[-1][0] + d[c][0], cs[-1][1] + d[c][1]])\r\npx, py = cs[-1][0], cs[-1][1]\r\nfor x, y in cs:\r\n k = 0\r\n if px:\r\n k = (a - x) // px\r\n elif py:\r\n k = (b - y) // py\r\n if k >= 0 and x + k * px == a and y + k * py == b:\r\n print('Yes')\r\n exit(0)\r\nprint('No')", "from math import hypot\r\na,b = map(int,input().split())\r\ns = input().strip()\r\ndx,dy = 0,0\r\nfor i in s:\r\n if dx==a and dy==b:\r\n print('Yes')\r\n exit()\r\n if i =='R':\r\n dx+=1\r\n if i=='L':\r\n dx-=1\r\n if i=='D':\r\n dy-=1\r\n if i=='U':\r\n dy+=1\r\n if dx==a and dy==b:\r\n print('Yes')\r\n exit(0)\r\nif dx==dy==0:\r\n print('No')\r\n exit(0)\r\nlngt = int(max(0,hypot(a,b)/hypot(dx,dy)-500))\r\nx,y = dxlngt,dylngt\r\nfor j in range(1000):\r\n for i in s:\r\n if x==a and y==b:\r\n print('Yes')\r\n exit(0) \r\n if i =='R':\r\n x+=1\r\n if i=='L':\r\n x-=1\r\n if i=='D':\r\n y-=1\r\n if i=='U':\r\n y+=1 \r\n if x==a and y==b:\r\n print('Yes')\r\n exit(0) \r\nprint('No')\r\n \r\n", "a,b=input().split()\n\na=int(a)\nb=int(b)\n\ns=input()\nn=len(s)\nL=[]\n\nx=0\ny=0\nhor=s.count('R')-s.count('L')\nver=s.count('U')-s.count('D')\nL=[[0,0]]\nfor i in range(n):\n if(s[i]=='U'):\n y+=1\n elif(s[i]=='D'):\n y-=1\n elif(s[i]=='R'):\n x+=1\n else:\n x-=1\n L.append([x,y])\nk=True\nfor i in range(n+1):\n x=L[i][0]\n y=L[i][1]\n if(hor==0 and ver==0 and x==a and b==y):\n print('Yes')\n k=False\n break\n elif(hor==0 and ver!=0 and x==a and (b-y)%ver==0 and (b-y)ver>=0):\n print('Yes')\n k=False\n break\n elif(ver==0 and hor!=0 and y==b and (a-x)%hor==0 and (a-x)hor>=0):\n print('Yes')\n k=False\n break\n elif(ver!=0 and hor!=0 and(b-y)%ver==0 and ver(b-y)>=0 and (a-x)%hor==0 and hor(a-x)>=0 and(b-y)//ver==(a-x)//hor):\n print('Yes')\n k=False\n break\n\nif(k):\n print('No')\n\n \n", "def main():\n a, b = map(int, input().split())\n steps, t = [((-1, 1, 0)[\"LR\".find(c)], (-1, 1, 0)[\"DU\".find(c)]) for c in input()], -25\n x = sum(e[0] for e in steps)\n y = sum(e[1] for e in steps)\n if x and y:\n t += min(a // x, b // y)\n elif x:\n t += a // x\n elif y:\n t += b // y\n if t > 0:\n a -= t * x\n b -= t * y\n for _ in range(26):\n for dx, dy in steps:\n if not (a or b):\n print(\"Yes\")\n return\n a -= dx\n b -= dy\n print(\"No\")\n\n\nif __name__ == '__main__':\n main()\n", "go = {'U' : (0, 1), 'D' : (0, -1), 'R' : (1, 0), 'L' : (-1, 0)}\r\na, b = map(int, input().split())\r\ns = input()\r\ndx = dy = x = y = cx = cy = 0\r\nfor c in s: \r\n dx += go[c][0]\r\n dy += go[c][1]\r\nans = a == b == 0\r\nfor c in s:\r\n x += go[c][0]\r\n y += go[c][1]\r\n cx, cy = a - x, b - y\r\n flg = False\r\n if dx: flg = not cx % dx and cx // dx >= 0\r\n else: flg = not cx\r\n if dy: flg = flg and not cy % dy and cy // dy >= 0\r\n else: flg = flg and not cy\r\n flg = flg and (not dx or not dy or cx // dx == cy // dy)\r\n if flg:\r\n ans = True\r\n break\r\nprint(\"Yes\" if ans else \"No\")\r\n ", "fx, fy = map(int, input().split())\r\ns = input()\r\ndx = dy= 0\r\ndistance_chunks=[[0,0]]\r\nn = len(s)\r\n\r\nfor c in s:\r\n if(c=='L'): dx-=1\r\n elif(c=='R'): dx+=1\r\n elif(c=='U'): dy+=1\r\n elif(c=='D'): dy-=1\r\n distance_chunks.append([dx,dy])\r\n#print(distance_chunks)\r\ndxmax, dymax = distance_chunks[-1][0], distance_chunks[-1][1]\r\n\r\nfor i in range(n):\r\n k=0\r\n if dxmax:\r\n k = (fx - distance_chunks[i][0]) // dxmax\r\n \r\n elif dymax:\r\n k = (fy - distance_chunks[i][1]) // dymax\r\n \r\n #print(k, dxmax, dymax)\r\n \r\n if(k>=0 and kdxmax == fx - distance_chunks[i][0] and kdymax == fy - distance_chunks[i][1]):\r\n print(\"Yes\")\r\n exit()\r\n\r\n\r\nprint(\"No\")\r\n\r\n" ]	{"inputs": ["2 2\nRU", "1 2\nRU", "-1 1000000000\nLRRLU", "0 0\nD", "0 0\nUURRDL", "987654321 987654321\nUURRDL", "4 2\nUURRDL", "4 3\nUURRDL", "4 4\nUURRDL", "4 6\nUURRDL", "4 7\nUURRDL", "1000000000 1000000000\nUURRDL", "-1 -1\nUR", "1 1\nUURRDDLL", "987654321 2\nUURDD", "0 123456789\nRRULL", "4 4\nUUUURRRRDDDDLLLL", "-491226083 -49122610\nUDRLDURLDLLLDUDURLRDUUDDUUULUDRDRDUULURDRLLDDDLUDUURLUUDLLDULLLLDDLDDUU", "-261597957 418556728\nLLLDLUDUULLRDDULLRRUDRDLULRLRLLRRUUDRRLRUDLRRLUDRDLLUUDUULRURLDLULUUULDDUURLRUDURRL", "-771928144 -3\nRUDULULDRDLLLULDDUDDDDUDULRULRUULDDDURUDLUURULLLDLLDDRDDRLRURUULRUURRUDLDLDDRLLULRRDRRLLUULUDRUUDRRD", "397346346 1\nDDURRUURLDLRRLULD", "-528551525 0\nUDRLRRLDLDLURRRRULDLRLRLURUUDDLRLLDRRULLUDLURDLUUULLLRUUUDRRURLDUDULDDRDDDRDL", "311692421 -129871846\nLLLDURULDDDDUDDURRLUUDRLDDRDURDDRUDUURLUDUDLDRUDDDUUURDRRUDRDRDURLLDURUUDRLDLDURRRRRRDULURDRU", "485940814 728911221\nURURU", "-843450986 632588242\nLURLULULRUDUDULRDDLUL", "647999516 -809999401\nUDLDDLLULUDDLLDUULRRRDLUDDLDDLRLRRDRURURDRRDRULUDRDULRULLRRLLDDRLRRUDRURDUULUDLRRLRDR", "352820537 -764444491\nRDDUDLUDDUDLRRRDRRRDRRDUDUDDURLRRLDRLLRLLLLUULUDRURRDRLDDLLDRDURDUDRUDDLUDRLURUDRURDRDDLDRLDLDLLU", "-284973644 -1\nDLULLDLRUUDRR", "356922591 -2\nRRLDLDUDRUUUULUUDDULDDUDD", "27033101 54066203\nUDDDRDLLLRUUDDLRDLDRLRUDDULRLLRULR", "-199335150 39867031\nLLURRDUULRUDDRDUUULDLDRDDLURDRLDRLLLRRRRRULRRRUUDD", "609504072 609504074\nULRLUDLDDR", "497684357 829473929\nRRLDUUURULURRLLRRLRLURRLDU", "551922835 183974295\nDUDUUULDRLRURRDULRRUDDLRLLUULLRLRDRDRR", "825368095 -825368096\nRD", "-458990423 -229495204\nDLLDDRLUDLRLUL", "285102789 570205594\nRRDULRULULRRDUURRLURUDDULLRDUL", "109928480 219856920\nLRURLRLURDRDLDRDLRDDUUDDLULDRRUUURRUDLLUULUUUR", "-532674020 532674026\nUURLLL", "999999999 0\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "0 0\nUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLR", "1 1\nUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLR", "-1000000000 -1000000000\nDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDL", "3 3\nUURR", "-2 -2\nUR", "5 5\nUDLR", "0 -1\nU", "-1 0\nR", "1000000000 1000000000\nURURURUR", "-1 -1\nRU", "1 1\nLD", "-2 -2\nUURR", "1000000000 0\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "2 6\nRUUUURLDDDL", "0 1\nLUUR", "1 1\nURDLDL", "-10 -10\nRU", "1000000000 1000000000\nRURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURU", "-1000000000 -500000000\nURR", "-2 0\nULLLDDRRRR", "999999999 -999999999\nRRRRRRRRRRRRRRRRRRRRRRRRRDDDDDDDDDDDDDDDDDDDDDDDDDLLLLLLLLLLLLLLLLLLLLLLLUUUUUUUUUUUUUUUUUUUUUUU", "-100 -100\nRU", "100 100\nRUL", "0 1\nUDLR", "0 1\nD", "0 -3\nRDDL"], "outputs": ["Yes", "No", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "Yes", "Yes", "No", "Yes", "No", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "No", "No", "No", "No", "Yes", "No", "No", "No", "No", "No", "No", "Yes", "Yes", "No", "Yes", "No", "No", "No", "No", "No", "Yes", "No", "No", "No", "Yes", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "Yes", "No", "No", "Yes", "No", "No"]}	UNKNOWN	PYTHON3	CODEFORCES	8
9220f6088bde1e658f48d2c43eca3a2e	Transformation: from A to B	Vasily has a number a, which he wants to turn into a number b. For this purpose, he can do two types of operations: - multiply the current number by 2 (that is, replace the number x by 2·x); - append the digit 1 to the right of current number (that is, replace the number x by 10·x<=+<=1). You need to help Vasily to transform the number a into the number b using only the operations described above, or find that it is impossible. Note that in this task you are not required to minimize the number of operations. It suffices to find any way to transform a into b. The first line contains two positive integers a and b (1<=≤<=a<=<<=b<=≤<=109) — the number which Vasily has and the number he wants to have. If there is no way to get b from a, print "NO" (without quotes). Otherwise print three lines. On the first line print "YES" (without quotes). The second line should contain single integer k — the length of the transformation sequence. On the third line print the sequence of transformations x1,<=x2,<=...,<=xk, where: - x1 should be equal to a, - xk should be equal to b, - xi should be obtained from xi<=-<=1 using any of two described operations (1<=<<=i<=≤<=k). If there are multiple answers, print any of them. Sample Input 2 162 4 42 100 40021 Sample Output YES 5 2 4 8 81 162 NO YES 5 100 200 2001 4002 40021	[ "def fc(a,b,re,bl,tmp):\r\n if(a>b):\r\n return\r\n if(a==b):\r\n bl[0]=False\r\n # tmp.append(a)\r\n re.append(tmp)\r\n return\r\n if(bl[0]):\r\n \r\n \r\n fc(a2,b,re,bl,tmp+[a2])\r\n fc(a10+1,b,re,bl,tmp+[a10+1])\r\nre=[]\r\nbl=[True]\r\n# fc(2,162,re,bl,[])\r\na,b=map(int,input().split())\r\nfc(a,b,re,bl,[])\r\nif(len(re)==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(1+len(re[0]))\r\n ans=[[a]+re[0]]\r\n print(a,end=\" \")\r\n for i in re[0]:\r\n print(i,end=\" \")\r\n print()", "a, b = map(int, input().split())\r\n\r\nseq = []\r\n\r\ndef d(s):\r\n if s > b:\r\n return False\r\n if s == b:\r\n return True\r\n \r\n for i in range(2):\r\n if i==0:\r\n hit = d(2s)\r\n if hit:\r\n seq.append(2s)\r\n return True\r\n \r\n if i == 1:\r\n hit = d(10s +1)\r\n if hit:\r\n seq.append(10s + 1)\r\n return True\r\nd(a) \r\nif len(seq) > 0:\r\n print(\"YES\")\r\n # seq += [a]\r\n seq.append(a)\r\n print(len(seq))\r\n \r\n for i in reversed(seq):\r\n print(i, end = \" \")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "a, b = list(map(int, input().split()))\n\nlista = []\nlista.append(b)\nflag = False\n\nwhile a <= b:\n # print(\"~~\", a, b)\n if a == b:\n flag = True\n break\n elif b % 2 == 0:\n b = b // 2\n lista.append(b)\n elif b % 10 == 1:\n b = (b - 1) // 10\n lista.append(b)\n else:\n break\n\nif not (flag):\n print(\"NO\")\nelse:\n rev = reversed(lista)\n print(\"YES\")\n print(len(lista))\n print(rev)\n\n \t \t\t\t \t \t\t \t\t \t\t\t \t\t\t", "\r\nimport math\r\nfrom math import gcd,floor,sqrt,log\r\ndef iin(): return int(input())\r\ndef sin(): return input().strip()\r\ndef listin(): return list(map(int,input().strip().split()))\r\ndef liststr(): return list(map(str,input().strip().split()))\r\ndef ceill(x): return int(x) if(x==int(x)) else int(x)+1\r\ndef ceilldiv(x,d): x//d if(x%d==0) else x//d+1\r\ndef LCM(a,b): return (ab)//gcd(a,b)\r\n\r\n\r\ndef solve():\r\n a,b = listin()\r\n temp = [b]\r\n while b>=a:\r\n if b==a:\r\n break\r\n if str(b)[-1]=='1':\r\n b = int(str(b)[:len(str(b))-1])\r\n temp.append(b)\r\n elif b%2==0:\r\n b//=2\r\n temp.append(b)\r\n else:\r\n print(\"NO\")\r\n # print(temp,b)\r\n return\r\n if b==a:\r\n print(\"YES\")\r\n print(len(temp))\r\n for i in range(len(temp)-1,-1,-1):\r\n print(temp[i],end = \" \")\r\n else:\r\n print(\"NO\")\r\n # print(temp,b)\r\n \r\nt = 1 \r\n# t = int(input()) \r\nfor hula in range(t):\r\n\tsolve()\r\n", "a, b = map(int, input().split())\nA = [b]\nwhile b > a:\n if b % 2 == 0:\n b //= 2\n elif b % 10 == 1:\n b //= 10\n else:\n break\n A.append(b)\nif A[-1] == a:\n print('YES')\n print(len(A))\n print(A[::-1])\nelse:\n print('NO')", "n, alvo = map(int,input().split())\n\nlista = []\ndef func(val):\n if val > alvo:\n return False\n if val == alvo:\n lista.append(val)\n return True\n \n if func(10val + 1) or func(2val):\n lista.append(val)\n return True\n \n return False\n\nif func(n):\n print(f'YES\\n{len(lista)}')\n print(lista[::-1])\nelse:\n print('NO')\n\n \t \t\t \t \t \t\t \t \t\t\t\t \t\t\t\t", "n = []\r\n\r\n\r\ndef a_to_b(a, b):\r\n if b % 2 == 0:\r\n b = b / 2\r\n if b >= a:\r\n n.insert(0, int(b))\r\n a_to_b(a, b)\r\n\r\n elif b % 10 == 1:\r\n b = b // 10\r\n if b >= a:\r\n n.insert(0, int(b))\r\n a_to_b(a, b)\r\n\r\n\r\na, b = map(int, input().split())\r\na_to_b(a, b)\r\nn.append(b)\r\nif a in n:\r\n print(\"YES\")\r\n print(len(n))\r\n print(\" \".join(map(str, n)))\r\nelse:\r\n print(\"NO\")\r\n", "a,b=map(int,input().split())\r\nqueue=[a]\r\nflag=0\r\ndict={a:1}\r\nwhile len(queue)>0:\r\n if(queue[0]==b):\r\n flag=1\r\n break\r\n if(queue[0]2<=b):\r\n queue.append(queue[0]2)\r\n dict[queue[0]2]=1\r\n if(queue[0]10+1<=b):\r\n queue.append(queue[0]10+1)\r\n dict[queue[0]10+1]=1\r\n queue.pop(0)\r\nx=b\r\nstack=[b]\r\nadd=0\r\nwhile(x>a and flag==1):\r\n if((x-1)%10==0 and (x-1)//10 in dict):\r\n stack.append((x-1)//10)\r\n x=(x-1)//10\r\n add+=1\r\n elif(x%2==0 and (x//2) in dict):\r\n stack.append(x//2)\r\n x=x//2\r\n add+=1\r\nstack.append(a)\r\nif(flag==0):\r\n print(\"NO\")\r\nelse:\r\n i=add\r\n print(\"YES\")\r\n print(add+1)\r\n for j in range(i,-1,-1):\r\n print(stack[j],end=' ')\r\n", "def f(l):\r\n u = l[-1]\r\n if u > l[0]:\r\n if u % 10 == 1:\r\n l.append(u // 10)\r\n f(l)\r\n elif not u % 2:\r\n l.append(u // 2)\r\n f(l)\r\n \r\nl = list(map(int, input().split()))\r\nf(l)\r\nif l.pop(0) == l[-1]:\r\n print(\"YES\", len(l), sep='\\n')\r\n print(l[::-1])\r\nelse:\r\n print(\"NO\")", "def fun(x, y, d):\r\n d.append(y)\r\n if x == y:\r\n return True\r\n elif y % 10 == 1:\r\n return fun(x, y // 10, d)\r\n elif y % 2 == 0 and y != 0:\r\n return fun(x, y // 2, d)\r\n else:\r\n return False\r\n\r\n\r\na, b = map(int, input().split())\r\nd = []\r\nif fun(a, b, d):\r\n print(\"YES\")\r\n print(len(d))\r\n print(d[::-1])\r\nelse:\r\n print(\"NO\")\r\n", "import fractions\r\nimport gc\r\nimport heapq\r\nimport itertools\r\nfrom itertools import combinations, permutations\r\nimport math\r\nimport random\r\nfrom collections import Counter, deque, defaultdict\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nimport threading\r\nfrom heapq import \r\nfrom fractions import Fraction\r\nfrom bisect import bisect_left, bisect_right\r\n\r\n\r\ndef S():\r\n\treturn sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n\treturn [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n\treturn int(sys.stdin.readline())\r\n\r\n\r\ndef IS():\r\n\treturn sys.stdin.readline().replace('\\n', '')\r\n\r\n\r\ndef main():\r\n\ta, b = I()\r\n\tqueue = deque([a])\r\n\td = {}\r\n\tans = 'NO'\r\n\twhile queue:\r\n\t\tv = queue.pop()\r\n\t\tif v == b:\r\n\t\t\tans = 'YES'\r\n\t\t\tbreak\r\n\t\tif 2 v <= b:\r\n\t\t\td[2 * v] = v\r\n\t\t\tqueue.append(2 * v)\r\n\t\tif 10 * v + 1 <= b:\r\n\t\t\td[10 * v + 1] = v\r\n\t\t\tqueue.append(10 * v + 1)\r\n\tprint(ans)\r\n\tif ans == 'YES':\r\n\t\tg = [b]\r\n\t\tlast = b\r\n\t\twhile last > a:\r\n\t\t\tlast = d[last]\r\n\t\t\tg.append(last)\r\n\t\tprint(len(g))\r\n\t\tprint(g[::-1])\r\n\t\r\n\t\r\nif __name__ == '__main__':\r\n\t# for _ in range(II()):\r\n\t# \tmain()\r\n\tmain()\r\n\t", "c=[0]\r\ndef func(a,b,l):\r\n if(a==b):\r\n c[0]=1\r\n print(\"YES\")\r\n print(len(l))\r\n print(l)\r\n if(a>b):\r\n return\r\n f1=2a\r\n f2=10a+1\r\n func(f1,b,l+[f1])\r\n func(f2,b,l+[f2])\r\n\r\na,b=map(int,input().split())\r\nl=[a]\r\nl1=func(a,b,l)\r\nif(c[0]==0):\r\n print(\"NO\")", "a, b = [int(i) for i in input().split()]\r\np = []\r\np.append(b)\r\nk = 1\r\nwhile b > a:\r\n\tif b % 2 == 0:\r\n\t\tk += 1\r\n\t\tp.append(b//2)\r\n\t\tb //= 2\r\n\telif b % 10 == 1:\r\n\t\tk += 1\r\n\t\tp.append((b-1)//10)\r\n\t\tb -= 1\r\n\t\tb //= 10\r\n\telse:\r\n\t\tbreak\r\nif b == a:\r\n\tprint('YES')\r\n\tprint(k)\r\n\tp.reverse()\r\n\tp = [str(i) for i in p]\r\n\tprint(' '.join(p))\r\nelse:\r\n\tprint('NO')\r\n\t", "a,b = map(int,input().split())\r\nlst = []\r\nwhile b > a:\r\n lst.append(b)\r\n if str(b)[-1] == '1':\r\n b = int(str(b)[:-1])\r\n else:\r\n if b%2 == 0:\r\n b //= 2\r\n else:\r\n print('NO')\r\n exit()\r\n \r\nlst.append(a)\r\nif b == a:\r\n print('YES')\r\n print(len(lst))\r\n print(lst[::-1])\r\nelse:\r\n print('NO')", "def from_a_2_b(a, b):\r\n count = 1\r\n nums = [b]\r\n\r\n while(a < b):\r\n if b % 2 == 0:\r\n b = b / 2\r\n count += 1\r\n nums.insert(0, int(b))\r\n elif b % 10 == 1:\r\n b = b // 10\r\n count += 1\r\n nums.insert(0, int(b))\r\n else:\r\n b = 0\r\n\r\n if(a != b):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n print(count)\r\n print(\" \".join(map(str, nums)))\r\n\r\n\r\na, b = map(int, input().split())\r\nfrom_a_2_b(a, b)\r\n", "a,b = map(int, input().split())\r\n\r\nso = []\r\ndef f(x):\r\n if x == b:\r\n so.append(b)\r\n return True\r\n if x > b:\r\n return False\r\n else:\r\n return f(x2) or f(x10 + 1)\r\n\r\nif f(a) == False:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n x = b\r\n while x > a:\r\n if x % 2 == 0:\r\n so.append(x//2)\r\n x = x//2\r\n else:\r\n so.append((x-1)//10)\r\n x = (x-1)//10\r\n print(len(so))\r\n so.reverse()\r\n print(so,sep=' ')", "a, b = map(int, input().split())\n \narr = [b] \nwhile b > a:\n if (b % 10) == 1:\n b //= 10\n arr.append(b)\n elif (b % 2 == 0):\n b //= 2\n arr.append(b)\n else:\n print('NO')\n exit()\n \nif b == a:\n print('YES')\n print(len(arr))\n for i in reversed(arr):\n print(i, end=\" \")\nelse:\n print ('NO')\n\t\t\t\t \t \t \t\t\t\t \t \t \t \t \t\t", "def 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\na,b=getint()\r\nans=[]\r\nres=[]\r\nflag=1\r\ndef dfs(x,ans):\r\n xx=ans.copy()\r\n global flag,res\r\n #print(ans)\r\n if x>b:\r\n return\r\n if x==b:\r\n flag=0\r\n res=xx\r\n return xx\r\n dfs(2x,ans+[2x])\r\n dfs(10x+1,ans+[10x+1])\r\n\r\n \r\nans=dfs(a,[a])\r\nif flag==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(res))\r\n print(res)\r\n#solve()\r\n#S()", "a, b = map(int, input().split())\r\nresult = [b]\r\n\r\nwhile (b > a):\r\n if (b % 2 == 0):\r\n b //= 2\r\n result.append(b)\r\n elif (b % 10 == 1):\r\n b //= 10\r\n result.append(b)\r\n else:\r\n break\r\n\r\nif (b == a):\r\n print('YES')\r\n print(len(result))\r\n print(reversed(result))\r\nelse:\r\n print('NO')", "n, k = map(int, input().split())\r\nans = [k]\r\nflag = False\r\nwhile k > 0:\r\n if k == n:\r\n flag = True\r\n break\r\n else:\r\n if k % 2 == 0:\r\n k = k // 2\r\n ans.append(k)\r\n else:\r\n if k % 10 == 1:\r\n k = str(k)\r\n k = k[:-1]\r\n if k == \"\":\r\n k = -1\r\n continue\r\n else:\r\n k = int(k)\r\n ans.append(k)\r\n else:\r\n break\r\nif flag == False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(ans))\r\n print(ans[::-1])\r\n", "#a, b = map(int,input().split())\r\n#x = 0\r\n#e = b\r\n#if b % a == 0:\r\n# print(\"YES\")\r\n# while b // a != a:\r\n# b = b // a\r\n # x = x + 1\r\n # if b // a == a:\r\n # print(x)\r\n # print(e, end=\" \")\r\n # e = e / 2\r\n # print(i, end=\" \")\r\n # if e == a:\r\n # break\r\n\r\na,b=map(int,input().split())\r\nl=[b]\r\nflag=False\r\nwhile a<=b:\r\n if b==a:\r\n print(\"YES\")\r\n print(len(l))\r\n print(reversed(l)) \r\n flag=True\r\n break\r\n elif b%2 ==0:\r\n b = b//2\r\n l.append(b)\r\n elif b%10 ==1:\r\n b =(b-1)//10\r\n l.append(b)\r\n else:\r\n break\r\nif not flag:\r\n print(\"NO\") \r\n", "def transform_from_a_to_b(sequence, a, b):\n if(a==b):\n print('YES')\n print(len(sequence))\n print(' '.join(map(str,sequence)))\n success=1\n raise SystemExit\n if(a>b):\n return\n transform_from_a_to_b(sequence + [a2], a2, b)\n transform_from_a_to_b(sequence + [10a + 1], 10a + 1, b)\n\na, b = map(int, input().split())\ntransform_from_a_to_b([a], a, b)\nprint('NO')\n\t \t\t \t \t\t\t \t\t\t \t \t\t \t\t\t", "# Mateus Brito de Sousa Rangel - 117110914\n \ndef solve(a, b, l):\n if(a > b):\n return False\n if a == b:\n return True\n \n x = solve(a * 2, b, l)\n y = solve(a * 10 + 1, b, l)\n \n if x or y:\n arr.append(a)\n \n return x \| y\n\nInput = map(int, input().split())\n \nn, m = list(Input)\narr = []\n \nif solve(n, m, arr):\n print(\"YES\")\n arr.reverse()\n arr.append(m)\n print(len(arr))\n \n for i in arr:\n print(i, end=\" \")\n\nelse:\n print(\"NO\")\n\n \t\t \t \t \t\t\t \t \t\t \t\t \t \t\t", "a, b = map(int, input().split())\npre = {}\nf = [a]\nwhile f:\n v = f.pop(0)\n if 2v not in pre and 2v <= b:\n f.append(2v)\n pre[2v] = v\n if 10v+1 not in pre and 10v+1 <= b:\n f.append(10v+1)\n pre[10v+1] = v\n \nsq = [b]\nif b not in pre:\n print(\"NO\")\nelse:\n print(\"YES\")\n x = b\n while x != a:\n x = pre[x]\n sq.append(x)\n print(len(sq))\n for i in sq[::-1]:\n print(i, end=\" \")\n print()\n \t \t \t\t\t \t\t \t\t \t \t", "number1,number2=map(int, input().split())\narray=[]\narray.append(number2)\nwhile number2 > number1:\n if (number2 % 10==1):\n number2 //= 10\n elif (number2 % 2==0):\n number2 //= 2\n else:\n break\n array.append(number2)\nif number2 != number1:\n print('NO')\nelse:\n array.reverse()\n print('YES')\n print(len(array))\n print(array)\n\t\t\t \t\t\t \t\t \t\t\t\t\t\t\t\t \t\t \t", "def aMagica_acontece(a, b):\n\n if a == b: return True\n elif a > b: return False\n else:\n \n if aMagica_acontece(int(f'{a}1'), b) or aMagica_acontece(a2, b):\n operacoes.append(str(a))\n return True\n \n return False\n\noperacoes: list = []\nn1m, n2m = map(int, input().split())\n\nif aMagica_acontece(n1m, n2m):\n \n operacoes.append(str(n2m))\n operacoes.sort(key=int)\n print('YES')\n print(len(operacoes))\n print(' '.join(operacoes))\n \nelse: print('NO')\n\n\t \t \t \t\t\t \t\t\t \t \t \t\t \t \t", "a,b = map(int, input().split())\r\n\r\ndef transformation(x,y, sequence):\r\n new_list = sequence[:]\r\n if (x == y):\r\n new_list.append(x)\r\n return new_list\r\n elif (x > y):\r\n return False\r\n else:\r\n new_list.append(x)\r\n return transformation(2x, y, new_list) or transformation(10x + 1, y, new_list)\r\n\r\nresult = transformation(a,b,[])\r\nif(result == False):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(result))\r\n response = \"\"\r\n for i in result:\r\n response += str(i) + \" \"\r\n print(response)\r\n", "a,b=map(int,input().split())\r\ndef dfs(x,arr):\r\n if x==b:\r\n print(\"YES\")\r\n print(len(arr))\r\n print(arr)\r\n exit()\r\n elif x>b:\r\n return\r\n else:\r\n dfs(2x,arr+[2x])\r\n dfs(10x+1,arr+[10x+1])\r\ndfs(a,[a])\r\nprint(\"NO\")", "X = list(map(int, input().split()))\r\nAnswer = [X[0]]\r\nCheck = False\r\n\r\n\r\ndef DFS(Num, Type):\r\n if Num > X[1]:\r\n return\r\n if Num == X[1]:\r\n Check = True\r\n print(\"YES\")\r\n print(len(Answer))\r\n print(Answer)\r\n exit()\r\n Num = (Num * 2 if Type == 0 else Num * 10 + 1)\r\n Answer.append(Num)\r\n DFS(Num, 0)\r\n Answer.pop()\r\n Answer.append(Num)\r\n DFS(Num, 1)\r\n Answer.pop()\r\n\r\n\r\nDFS(X[0], 0)\r\nDFS(X[0], 1)\r\nprint(\"NO\")\r\n", "a, b = map(int, input().split())\n\nlista = [b]\n\n\nwhile (b != a):\n\tif (b % 10 == 1):\n\t\tb //= 10\n\telif (b % 2 == 0 and b > 0):\n\t\tb //= 2\n\telse:\n\t\tbreak\n\n\tlista.append(b)\n\nif (a == b):\n\t\n\tlista.reverse()\n\tprint('YES')\n\tprint(len(lista))\n\n\tfor i in lista:\n\t\tprint(i, end = ' ')\nelse:\n\tprint('NO')\n\t\t\t\t\t \t\t\t \t \t \t \t\t\t\t \t\t \t \t", "a,b=list(map(int,input().split()))\r\ny=''\r\nl=[b]\r\nwhile b!=a:\r\n if a>b:\r\n y='NO'\r\n break\r\n if b%2==0:\r\n b=int(b/2)\r\n if b==a:\r\n l.append(b)\r\n break\r\n else:\r\n l.append(b)\r\n elif str(b)[-1]=='1':\r\n b=str(b)[:-1]\r\n b=int(b)\r\n l.append(b)\r\n else:\r\n y='NO'\r\n break\r\nif y=='NO':\r\n print(y)\r\nelse:\r\n print(\"YES\")\r\n print(len(l))\r\n print(l[::-1])", "a, b = map(int,input().split())\r\nans, f = [b], 0\r\nwhile True:\r\n if b<a:\r\n break\r\n if a==b:\r\n f = 1\r\n break\r\n if b%2==0:\r\n b//=2\r\n ans.append(b)\r\n else:\r\n if b%10==1:\r\n b//=10\r\n ans.append(b)\r\n else:\r\n break\r\n\r\nif f==1:\r\n print('YES')\r\n print(len(ans))\r\n print(ans[::-1])\r\nelse:\r\n print('NO')", "from collections import deque\n \na,b = list(map(int,input().split()))\nvisited = {}\nq = deque([a])\nwhile len(q) > 0:\n v = q.popleft()\n w = 2v\n x = 10v + 1\n if w not in visited and w <= b:\n q.append(w)\n visited[w] = v\n if x not in visited and x <= b:\n q.append(x)\n visited[x] = v\npath = [b]\nif b not in visited:\n print(\"NO\")\nelse:\n print(\"YES\")\n node = b\n while node > a:\n node = visited[node]\n path.append(node)\n print(len(path))\n out = \"\"\n for i in range(len(path)-1,-1,-1):\n out += f\"{path[i]}\"\n if i > 0:\n out += \" \"\n print(out)\n \t\t \t\t\t\t\t\t\t \t \t\t \t\t", "import queue\n\na, b = map(int, input().split())\nfila = queue.Queue()\npre = {}\n\nfila.put(a)\n\nwhile fila.qsize() > 0:\n v = fila.get()\n if 2v not in pre and 2v <=b:\n fila.put(2v)\n pre[2v] = v\n if 10v+1 not in pre and 10v+1 <=b:\n fila.put(10v+1)\n pre[10v+1] = v\n\nans = [b]\n\nif b in pre:\n while pre[ans[-1]] in pre:\n ans.append(pre[ans[-1]])\n ans.append(a)\n\n print(\"YES\")\n print(len(ans))\n print(ans[::-1])\nelse:\n print(\"NO\")\n\n\n \t \t \t \t\t\t\t\t \t\t\t \t\t \t \t", "buf = []\r\n\r\ndef cal(b, a):\r\n buf.append(b)\r\n if a == b:\r\n return True\r\n elif b < a:\r\n return False\r\n elif b % 2 == 0:\r\n return cal(b // 2, a)\r\n elif b % 10 == 1:\r\n return cal((b - 1) // 10, a)\r\n\r\na, b = map(int, input().split())\r\nif cal(b, a):\r\n print('YES')\r\n print(len(buf))\r\n print(' '.join(str(x) for x in buf[::-1]))\r\nelse:\r\n print('NO')", "input_ = input().split()\n\na, b = int(input_[0]),int(input_[1])\n\nsolutions = [b]\n\nwhile (b > 0):\n if (b % 2 == 0):\n b = b / 2\n solutions.append(b)\n\n elif ((b-1) % 10 == 0):\n b = (b - 1) / 10\n solutions.append(b)\n\n else:\n break\n\n if (a == b):\n break\n\nif (solutions[-1] != a):\n print('NO')\nelse:\n print('YES')\n print(len(solutions))\n result = \"\"\n for i in range(len(solutions) -1, -1, -1):\n result += str(int(solutions[i]))\n if(i < (len(solutions))):\n result += \" \"\n print(result)\n\t\t \t \t \t\t \t \t \t \t \t \t \t\t\t\t \t\t", "from collections import deque\n\na, b = map(int, input().split())\nstart = {}\nqueue = deque([a])\n\nwhile queue:\n value = queue.popleft()\n\n if 2 value not in start and 2 * value <= b:\n queue.append(2 * value)\n start[2 * value] = value\n if 10 * value + 1 not in start and 10 * value + 1 <= b:\n queue.append(10 * value + 1)\n start[10 * value + 1] = value\n\nseq = [str(b)]\n\nif b not in start:\n print(\"NO\")\nelse:\n print(\"YES\")\n x = b\n while x != a:\n x = start[x]\n seq.append(str(x))\n\n print(len(seq))\n print(' '.join(seq[::-1]))\n\n\n\t \t \t\t\t \t \t\t\t \t\t\t\t\t \t\t \t", "m,n=map(int,input().split())\r\nmylist=[]\r\nflag=True\r\nmylist.append(n)\r\nwhile n>=m:\r\n if n%2==0:\r\n n=int(n/2)\r\n mylist.append(n)\r\n else:\r\n n=n-1\r\n if n%10!=0:\r\n flag=False\r\n break\r\n else:\r\n n=int(n/10)\r\n mylist.append(n)\r\n \r\n \r\n if n==m:\r\n break\r\nif m==mylist[-1] and flag==True:\r\n print(\"YES\")\r\n print(len(mylist))\r\n mylist=mylist[::-1]\r\n for num in mylist:\r\n print(num,end=\" \")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n ", "def isEndingone(num):\r\n return str(num)[-1] == '1'\r\n\r\ndef solve():\r\n a, b = map(int, input().split())\r\n arr = [b]\r\n while b > a:\r\n if not isEndingone(b) and b & 1:\r\n print(\"NO\")\r\n return\r\n if isEndingone(b):\r\n b = (b-1)//10\r\n else:\r\n b//=2\r\n arr.append(b)\r\n if arr[-1] != a:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n print(len(arr))\r\n print(arr[::-1])\r\n\r\nsolve()\r\n", "a,b=map(int,input(\"\").split())\noplst=[]\noplst.append(b)\nfor i in range(b):\n if(b%10==1):\n b=b//10\n oplst.append(b)\n if(b==a):\n print(\"YES\")\n print(len(oplst))\n oplst.reverse()\n print(oplst, sep=\" \")\n break\n elif(b<a):\n print(\"NO\")\n break\n elif(b%2==0):\n b=b//2\n oplst.append(b)\n if(b==a):\n print(\"YES\")\n print(len(oplst))\n oplst.reverse()\n print(oplst, sep=\" \")\n break\n elif(b<a):\n print(\"NO\")\n break\n else:\n print(\"NO\")\n break\n \t\t \t\t \t \t\t \t\t \t \t\t \t \t \t", "a,b=map(int,input().split())\r\nres=[b]\r\nwhile(b>a):\r\n if(b%2==0):\r\n b=b//2\r\n res.append(b)\r\n elif(b%10==1):\r\n b=b//10\r\n res.append(b)\r\n else:\r\n break\r\nif(b==a):\r\n res.sort()\r\n print(\"YES\")\r\n print(len(res))\r\n for i in res:\r\n print(i,end=\" \")\r\nelse:\r\n print(\"NO\")\r\n", "def transform(start_num,count,arr):\r\n global b,found\r\n\r\n if found:\r\n return\r\n\r\n if start_num>b:\r\n return\r\n\r\n if start_num==b:\r\n found = True\r\n print('YES')\r\n print(count+1)\r\n print(arr)\r\n return\r\n\r\n n_arr_1 = arr.copy()\r\n n_arr_1.append(2start_num)\r\n transform(2start_num,count+1,n_arr_1)\r\n\r\n n_arr_2 = arr.copy()\r\n n_arr_2.append(10start_num+1)\r\n transform(10start_num+1,count+1,n_arr_2)\r\n\r\n return\r\nif __name__ == '__main__':\r\n a,b = map(int,input().split())\r\n found = False\r\n arr = [a]\r\n transform(a,0,arr)\r\n if not found:\r\n print('NO')\r\n ", "a, b = map(int, input().split())\n\nans = []\ncheck = True\nwhile True:\n\tans.insert(0, b)\n\n\tif b%2 == 0:\n\t\tb //= 2\n\telif str(b)[-1] == '1':\n\t\tb = int(str(b)[:-1])\n\telse:\n\t\tcheck = False\n\t\tbreak\n\n\tif b == a:\n\t\tans.insert(0, b)\n\t\tbreak\n\telif a > b:\n\t\tcheck = False\n\t\tbreak\n\nif check:\n\tprint('YES')\n\tprint(len(ans))\n\tfor x in ans:\n\t\tprint(x, end=' ')\nelse:\n\tprint('NO')", "from sys import setrecursionlimit\nsetrecursionlimit(10*6)\ndef dfs(a,b):\n res.append(a)\n if a > b:\n res.pop()\n return\n elif a == b:\n print('YES')\n print(len(res))\n print(res)\n exit()\n\n dfs(a2,b) \n dfs(a10+1,b)\n res.pop() \n\na,b = map(int,input().split())\nres = [a]\ndfs(a2,b)\ndfs(a10+1,b)\nprint('NO')", "a, b = list(map(int, input().split()))\nrecord = []\n\nwhile True:\n if b < a:\n print(\"NO\")\n break\n elif b % 2 == 0 and b != a:\n record.insert(0, str(b))\n b //= 2\n elif b % 10 == 1 and b != a:\n record.insert(0, str(b))\n b = (b - 1) // 10\n elif b == a:\n record.insert(0, str(a))\n print(\"YES\")\n print(len(record))\n print(' '.join(record))\n break\n else:\n print(\"NO\")\n break\n\t \t\t\t \t \t \t \t\t\t\t\t \t\t \t \t\t\t", "a, b = map(int, input().split())\n \nseq = [b]\nwhile b > a:\n if b % 2 == 0:\n b //= 2\n seq.append(b)\n elif b % 10 == 1:\n b //= 10\n seq.append(b)\n else:\n print(\"NO\")\n exit(0)\n \nif b != a:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(len(seq))\n print(' '.join(map(str, seq[::-1])))\n\n\t \t \t \t \t \t \t \t\t \t \t\t", "from collections import deque\n\na, b = map(int, input().split())\n\npre = {}\nfila = deque([a])\n\nwhile fila:\n\tv = fila.popleft()\n\t\n\tif 2 * v not in pre and 2 * v <=b:\n\t\tfila.append(2 * v)\n\t\tpre[2 * v] = v\n\tif 10 * v + 1 not in pre and 10 * v + 1 <= b:\n\t\tfila.append(10 * v + 1)\n\t\tpre[10 * v + 1] = v\n\nseq = [str(b)]\n\nif b not in pre: print(\"NO\")\nelse:\n\tprint(\"YES\")\n\tx = b\n\twhile x != a:\n\t\tx = pre[x]\n\t\tseq.append(str(x))\n\t\n\tprint(len(seq))\n\tprint(' '.join(seq[::-1])) \n\n \t\t \t\t\t\t\t \t\t \t \t \t\t\t\t\t\t", "a, b = map(int, input().split())\nv = [b]\n\nwhile a != b and b > a:\n if b % 2 == 0 and b // 2 >= a:\n b = b // 2\n v.append(b)\n else:\n if b % 10 != 1 or (b - 1) // 10 < a:\n print(\"NO\")\n exit(0)\n b = (b - 1) // 10\n v.append(b)\n\nprint(\"YES\")\nprint(len(v))\nprint(' '.join(map(str, reversed(v))))\n\t\t \t \t\t\t \t\t\t \t \t\t\t\t \t \t", "a,b = map(int, input().split())\narr = [b]\nwhile b >= a:\n\tif b == a:\n\t\tprint('YES')\n\t\tprint(len(arr))\n\t\tprint(arr[::-1])\n\t\texit()\n\tif b%2 == 0:\n\t\tb/=2\n\t\tarr.append(int(b))\n\telif b%10 == 1:\n\t\tb = b//10\n\t\tarr.append(int(b))\n\telse:\n\t\tprint('NO')\n\t\texit()\nprint('NO')\n\t\t\t\t\t\t \t \t \t \t\t\t\t\t \t \t \t \t", "a,b=map(int,input().split())\r\nh=[b]\r\nwhile b!=a:\r\n\tif b%10==1:\r\n\t\tb=b//10\r\n\telif b%2==0:\r\n\t\tb=b//2\r\n\telse:\r\n\t\tbreak\r\n\tif a>b:\r\n\t\tbreak\r\n\th=h+[b]\r\nif a!=b:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n\tprint(len(h))\r\n\tfor i in range(1,len(h)+1):\r\n\t\tprint(h[-i],end=' ')", "import sys\r\n\r\na, b = list(input().split())\r\nc = 1\r\nh = [int(b), ]\r\n\r\nwhile int(a) <= int(b):\r\n if a == b:\r\n print(\"YES\")\r\n print(c)\r\n print(h[-1::-1])\r\n sys.exit()\r\n if b[-1] == \"1\":\r\n b = b[:-1]\r\n h.append(int(b))\r\n c += 1\r\n elif int(b) % 2 == 0:\r\n h.append(int(b) // 2)\r\n b = str(int(b) // 2)\r\n c += 1\r\n else:\r\n print(\"NO\")\r\n sys.exit()\r\nprint(\"NO\")\r\n\r\n", "a, b = map(int, input().split())\r\nl = [b]\r\nc =1\r\nif a == b:\r\n print(\"YES\")\r\n print(0)\r\n print(a, b)\r\n exit()\r\n\r\nwhile a != b:\r\n if a > b:\r\n print(\"NO\")\r\n exit()\r\n\r\n else:\r\n if b%10 == 3 or b%10 == 5 or b%10 ==7 or b%10 == 9:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n if b % 2 == 0:\r\n b = b // 2\r\n l.append(b)\r\n c = c+1\r\n else:\r\n b = b//10\r\n l.append(b)\r\n c = c + 1\r\n\r\n\r\n\r\n\r\nprint(\"YES\")\r\nprint(len(l))\r\nprint(l[::-1])\r\nexit()", "a, b = map(int, input().split())\r\n\r\nseq = [b]\r\nwhile seq[-1] > a:\r\n if seq[-1] % 2 == 0 and seq[-1] // 2 >= a:\r\n seq.append(seq[-1] // 2)\r\n else:\r\n if seq[-1] % 10 != 1:\r\n break\r\n seq.append((seq[-1] - 1) // 10)\r\n\r\nif seq[-1] == a:\r\n seq.reverse()\r\n print(\"YES\")\r\n print(len(seq))\r\n print(seq)\r\nelse:\r\n print(\"NO\")\r\n", "# -- coding: utf-8 --\n\"\"\"\nCreated on Sat Aug 14 21:59:31 2021\n\n@author: lcarv\n\"\"\"\n\nfrom collections import deque\n\nseq = list(map(int,input().strip().split()))[:2]\n\na = seq[0]\nb = seq[1]\n\np = {}\nf = deque([a])\n\n\n\nwhile f:\n v = f.popleft()\n if 2v not in p and 2v <= b:\n f.append(2v)\n p[2v] = v\n \n if 10v+1 not in p and 10v+1 <= b:\n f.append(10v+1)\n p[10v+1] = v\n\n\nseq = [b]\n\nif b not in p:\n print(\"NO\")\n \nelse:\n print(\"YES\")\n x = b\n while x != a:\n x = p[x]\n seq.append(x)\n \n print(len(seq))\n saida = \"\"\n for i in seq[::-1]:\n saida += str(i)+ \" \"\n print(saida)\n\t\t\t \t \t\t\t \t \t \t\t \t\t\t\t\t \t \t", "a,b=map(int,input().split())\r\nl=[b]\r\nwhile(a<b):\r\n if b%2:\r\n if b%10==1:\r\n b//=10\r\n l.append(b)\r\n else:\r\n break\r\n else:\r\n b//=2\r\n l.append(b)\r\nif a==b:print(\"YES\");print(len(l));print(l[::-1])\r\nelse:print(\"NO\")", "def smart():\n a, b = map(int, input().split())\n\n\ndef bruteForce():\n a, b = map(int, input().split())\n path = [a]\n\n def dfs(a):\n if a == b:\n print(\"YES\", len(path), ' '.join(map(str, path)), sep=\"\\n\")\n exit()\n elif a > b:\n return\n else:\n for d_a in (a 10 + 1, a * 2):\n path.append(d_a)\n dfs(d_a)\n path.pop()\n dfs(a)\n print(\"NO\")\n\n\nbruteForce()\n", "a,b=map(int,input().split())\r\ndef change(a,arr):\r\n #print(arr)\r\n if a>b:\r\n return []\r\n if a==b:\r\n return arr\r\n return change(2a,arr+[2a])+change(10a+1,arr+[10a+1])\r\n \r\nans=(change(a,[a]))\r\nif ans==[]:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(len(ans))\r\n print(ans)\r\n", "def b_to_a(a, b, num):\n if b != a:\n if b % 2 == 0:\n b = b / 2\n if b >= a:\n num.insert(0, int(b))\n b_to_a(a, b, num)\n\n elif b % 10 == 1:\n b = b // 10\n if b >= a:\n num.insert(0, int(b))\n b_to_a(a, b, num)\n\na, b = map(int, input().split())\nnum = []\nb_to_a(a, b, num)\nnum.append(b)\nif a in num:\n print(\"YES\")\n print(len(num))\n print(\" \".join(map(str, num)))\nelse:\n print(\"NO\")\n\t \t \t\t \t\t \t\t \t \t\t \t\t", "u, f = map(int, input().split())\r\n\r\ncheck = False\r\ndef solve(u, f, p):\r\n global check\r\n if u == f:\r\n check = True\r\n print(\"YES\")\r\n print(len(p))\r\n print(p)\r\n return\r\n if(u < f):\r\n solve(2u, f, p + [2u])\r\n solve(10u + 1, f, p + [10u+1])\r\n\r\n#backtracking\r\n\r\n\r\nsolve(u, f, [u])\r\nif not check:\r\n print(\"NO\")", "import heapq\r\n\r\na, b = map(int, input().split())\r\n\r\nflag = True\r\ntmp = b\r\ncnt = 0\r\nans = [b]\r\nwhile True:\r\n if tmp % 10 == 1:\r\n tmp = tmp // 10\r\n elif tmp % 2 == 0:\r\n tmp //= 2\r\n elif tmp != a:\r\n flag = False\r\n break\r\n\r\n cnt += 1\r\n heapq.heappush(ans, tmp)\r\n if tmp == a:\r\n break\r\n if tmp < a:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\n print(len(ans))\r\n while ans:\r\n print(heapq.heappop(ans), end=' ')\r\n print()\r\nelse:\r\n print(\"NO\")", "def transform(key, counter):\n if (key > b):\n return False\n if (key == b):\n output_dict[counter] = key\n cnt = counter\n return True\n aux = False\n aux = transform(key * 2, counter + 1)\n if (aux):\n output_dict[counter] = key\n return True\n aux = transform((key10) + 1, counter + 1)\n if (aux):\n output_dict[counter] = key\n return True\n return False\n\nif __name__ == '__main__':\n a, b = input().split()\n a = int(a)\n b = int(b)\n output_dict = {}\n cnt = 0\n if ((a, b) >= (1, 1) and (a,b) <= (109, 109)):\n if (transform(a,1)):\n print('YES')\n output = ''\n print(len(output_dict))\n for key in range(1, len(output_dict) + 1):\n output += str(output_dict[key])+ ' '\n output = output.rstrip()\n print(output)\n \n else:\n print('NO')\n \t \t\t\t\t \t \t \t \t\t \t \t \t\t", "def solut(a,b):\n global final,ans,answer\n answer = True\n if a == b :\n cc = ans.copy()\n final.append(cc)\n answer = False\n return\n if answer :\n if a>b:\n return\n ans.append(a2)\n solut(a2,b)\n del(ans[-1])\n ans.append(a10+1)\n solut(a10+1,b)\n del(ans[-1])\n\n\na,b = map(int,input().split())\nfinal = []\nans = [a]\nsolut(a,b)\nif len(final) == 0:\n print('NO')\nelse:\n print('YES')\n print(len(final[0]))\n for i in final[0]:\n print(i,end = ' ')", "def transforma(origem, destino):\n if origem[-1] == destino:\n return origem, destino\n elif origem[-1] > destino:\n return None\n else:\n numero = origem[-1]\n dest = numero 2\n retorno = transforma(origem + [dest], destino)\n if retorno is None:\n numero = int(str(numero) + \"1\")\n return transforma(origem + [numero], destino)\n else:\n return retorno\n\n\norigem, destino = map(int, input().split())\n\ntransformacao = transforma([origem], destino)\nif transformacao is None:\n print('NO')\nelse:\n transformacao, destino = transformacao\n print('YES')\n print(len(transformacao))\n print(\" \".join(map(str, transformacao)))\n", "'''input\r\n4 42\r\n2 162\r\n101111100101\r\n'''\r\na,b = map(int,input().split())\r\n\r\npossible = True\r\nl = [str(b)]\r\nwhile a<b:\r\n\tif b%2==0:\r\n\t\tb>>=1\r\n\telif b%10 == 1:\r\n\t\tb=int(b/10)\r\n\telse:\r\n\t\tpossible = False\r\n\t\tbreak\r\n\tl.append(str(b))\r\n\r\nif a>b:\r\n\tpossible = False\r\n\r\nif possible:\r\n\tprint('YES')\r\n\tprint(len(l))\r\n\tprint(' '.join(reversed(l)))\r\n\t# print(l)\r\nelse:\r\n\tprint('NO')\r\n", "a, b = map(int, input().split())\n\ndef find_transformation(a, b):\n transformations = [b]\n \n while b > a:\n if b % 10 == 1:\n b //= 10\n transformations.append(b)\n elif b % 2 == 0:\n b //= 2\n transformations.append(b)\n else:\n break\n \n if transformations[-1] == a:\n transformations.reverse()\n print(\"YES\")\n print(len(transformations))\n print(\" \".join(map(str, transformations)))\n else:\n print(\"NO\")\n\nfind_transformation(a, b)\n\n\t\t \t \t \t \t\t \t\t \t\t\t \t\t \t \t \t", "z, w = map(int, input().split())\ny = [w]\n\nwhile z < w:\n if w%2:\n w, m = divmod(w, 10)\n\n if m!=1:\n break\n else:\n w//=2\n\n y.append(w)\n\nif z!=w:\n print('NO')\n\nelse:\n print('YES')\n print(len(y))\n print(reversed(y))\n\t \t\t\t \t \t\t\t \t\t\t \t\t\t \t \t \t", "def translate(n, b):\n if n > b:\n return False\n if n == b:\n return n,\n x = translate(n2, b)\n if x:\n return (n, x)\n y = translate(n 10 + 1, b)\n if y:\n return (n, y)\n return False\n\n\na, b = map(int, input().split())\nans = translate(a, b)\nif ans:\n print(\"YES\")\n print(len(ans))\n print(ans)\nelse:\n print(\"NO\")\n", "a, b = [int(x) for x in input().split()]\n\nseq = []\nwhile a != b:\n seq.append(b)\n if a > b:\n print('NO')\n exit()\n if b % 2 == 1 and b%10 != 1:\n print('NO')\n exit()\n if b % 2 == 0:\n b = b // 2\n else:\n b = b // 10\nseq.append(b)\nprint('YES')\nprint(len(seq))\nprint(reversed(seq))\n \t\t \t \t \t \t \t \t\t \t\t\t\t \t \t", "def solve(atual,fim):\r\n if atual > fim: return False\r\n\r\n if atual == fim:\r\n return True\r\n \r\n operacoes = [2atual, 10atual+1]\r\n for op in operacoes:\r\n if solve(op, fim):\r\n ans.append(op)\r\n return True\r\n\r\n return False\r\n\r\ninicio, fim = map(int, input().split())\r\n\r\nans = []\r\nif solve(inicio,fim):\r\n print(\"YES\")\r\n ans.append(inicio)\r\n print(len(ans))\r\n print(reversed(ans))\r\nelse:\r\n print(\"NO\")", "a,b=map(int,input().split())\r\nl=[b]\r\nwhile a<b:\r\n if b%10==1:\r\n b=b//10\r\n l.append(b)\r\n elif (b%10)%2!=0:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n b=b//2\r\n l.append(b)\r\n if b==a:\r\n print(\"YES\")\r\n print(len(l))\r\n l.reverse()\r\n print(l)\r\n exit()\r\n\r\nprint(\"NO\")\r\n\r\n", "a, b = list(map(int, input().split(' ')))\r\nlist = [b]\r\nwhile b > a and (b%2 == 0 or b%10 == 1):\r\n if b % 2 == 0:\r\n b //= 2\r\n else:\r\n b //= 10\r\n list.append(b)\r\nif b != a:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(len(list))\r\n for i in list[::-1]:\r\n print(i, end=' ')\r\n print()", "\r\n\r\n#start the code from here\r\na,b=map(int,input().split())\r\nstack=[b]\r\nans=[]\r\nh=0\r\nwhile stack:\r\n\tp=stack.pop()\r\n\tans.append(p)\r\n\tif p==a:\r\n\t\tbreak\r\n\telse:\r\n\t\tif p<a:\r\n\t\t\th=1\r\n\t\t\tbreak\r\n\tif p%10==1:\r\n\t\tp=p//10\r\n\t\tstack.append(p)\r\n\telif p%2==0:\r\n\t\tp=p//2\r\n\t\tstack.append(p)\r\n\telse:\r\n\t\th=1\r\n\t\tbreak\r\nans.reverse()\r\nif h==1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint(len(ans))\r\n\tprint(ans)", "def transA2B(a, b): \r\n def genFolwingNumbers(num):\r\n next_numbers = []\r\n next_numbers.append(num * 2) \r\n next_numbers.append(num * 10 + 1) \r\n return next_numbers \r\n queue = [(a, [a])] \r\n while queue:\r\n curr_num, sequence = queue.pop(0)\r\n if curr_num == b:\r\n return sequence \r\n next_numbers = genFolwingNumbers(curr_num)\r\n for num in next_numbers:\r\n if num <= b: \r\n queue.append((num, sequence + [num]))\r\n \r\n return [] \r\na, b = map(int, input().split())\r\nsequence = transA2B(a, b)\r\nif sequence:\r\n print(\"YES\")\r\n print(len(sequence))\r\n print(sequence)\r\nelse:\r\n print(\"NO\")", "from collections import deque\n\na, b = map(int, input().split())\np = {}\nfila = deque([a])\n\nwhile fila:\n v = fila.popleft()\n if v2 not in p and 2v <= b:\n fila.append(v2)\n p[v2] = v\n if 10v+1 not in p and 10v+1 <= b:\n fila.append(10v+1)\n p[10v+1] = v\n\ns = []\nif b in p:\n print (\"YES\")\n while True:\n s.append(b)\n b = p[b]\n if b == a:\n s.append(b)\n break\n print (len(s))\n s1 = []\n for i in range(len(s)-1, -1, -1):\n s1.append(s[i])\n print (s1)\nelse:\n print(\"NO\")\n \t\t \t\t\t \t \t\t\t \t \t \t \t\t\t \t", "a,b=input().split()\ns=[b]\nk=0\nwhile True:\n if b[-1]=='1' and int(b)>int(a):\n b=list(b)\n del b[-1]\n b=''.join(b)\n s.append(b)\n elif int(b)%2==0 and int(b)>int(a):\n b=int(b)/2\n b=int(b)\n s.append(b)\n b=str(b)\n elif int(a)==int(b):\n\n break\n else:\n k+=1\n break\ns.reverse()\n\nif k==0:\n print('YES')\n print(len(s))\n print(s)\nelse:\n print('NO')\n", "class handle_input():\n\n def __init__(self, mode):\n if mode == \"multiple_lines\":\n self.input_from_user = self.__read_multiple_lines()\n\n def __read_multiple_lines(self):\n contents = []\n while True:\n try:\n line = input()\n if line in [\"\\n\", \"\"]:\n break\n \n except EOFError:\n break\n contents.append(line)\n\n return contents\n\ninput_handler = handle_input(\"multiple_lines\")\nlist_lines = input_handler.input_from_user\n\nini, end = (int(list_lines[0].split(\" \")[0]), int(list_lines[0].split(\" \")[1]))\n\nlista = []\npossible = True\nwhile (end >= ini) and (end != ini):\n if str(end)[-1] == \"1\":\n lista += [end]\n end = int(str(end)[:-1])\n elif (end % 2 == 0):\n lista += [end]\n end = end // 2\n else:\n possible = False\n break\n\nif (possible == False) or end != ini:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(len(lista)+ 1)\n output = str(ini)\n for j in range (len(lista) - 1, -1 ,-1):\n output += \" \" + str(lista[j])\n print(output.strip())\n\n\t \t\t \t \t \t \t \t\t \t\t\t\t \t", "def solve(l, x, a):\r\n if(x < a):\r\n # print(\"aqui\")\r\n print(\"NO\")\r\n elif x == a:\r\n l.append(x)\r\n print(\"YES\")\r\n print(len(l))\r\n for i in range(len(l) - 1, 0, -1):\r\n print(l[i], end=\" \")\r\n print(l[0])\r\n elif(str(x)[-1] == '1'):\r\n l.append(x)\r\n x = int(str(x)[0:-1])\r\n solve(l, x, a)\r\n elif((x % 2 == 1)):\r\n # print(\"aqio\")\r\n # print(x)\r\n print(\"NO\")\r\n else:\r\n l.append(x)\r\n solve(l, int(x / 2), a)\r\ndef main():\r\n a, b = [int(x) for x in input().split()]\r\n solve([], b, a)\r\n\r\nmain()", "import sys\nfrom collections import defaultdict\ninput = sys.stdin.readline\n\na, b = list(map(int, input().split()))\nans = [b]\ndef backtrack(a, b):\n if b == a:\n # ans.append(b)\n return True\n elif b < a:\n return False\n if b%2 == 0:\n ans.append(b//2)\n if backtrack(a, b//2):\n return True\n ans.pop()\n if(b-1)%10 == 0:\n ans.append((b-1)//10)\n if backtrack(a, ((b-1)//10)):\n return True\n ans.pop()\n \n return False\n# ans.revers\nif backtrack(a, b):\n print(\"YES\")\n ans.reverse()\n print(len(ans))\n print(ans)\nelse:\n print(\"NO\")\n\n\n ", "from collections import deque\r\n\r\na, b = map(int, input().split())\r\n\r\npre = {}\r\nfila = deque([a])\r\n\r\nwhile fila:\r\n v = fila.popleft()\r\n if v2 not in pre and v2 <= b:\r\n fila.append(v2)\r\n pre[v2] = v\r\n if v10 not in pre and v10 <= b:\r\n fila.append(10v + 1)\r\n pre[10v + 1] = v\r\n\r\nseq = [b]\r\nif b not in pre:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n x = b\r\n while x != a:\r\n x = pre[x]\r\n seq.append(x)\r\n\r\n print(len(seq))\r\n print(' '.join(map(str, seq[::-1])))", "a,b = map(int, input().split())\r\n\r\nresposta = [b]\r\nwhile b > a:\r\n\tif b % 2 == 0:\r\n\t\tb /= 2\r\n\t\tresposta.append(b)\r\n\t\t\r\n\telif b % 10 == 1:\r\n\t\tb = (b-1) / 10\r\n\t\tresposta.append(b)\r\n\t\t\r\n\telse: break\r\n\r\nif b != a:\r\n\tprint('NO')\r\n\r\nelse:\r\n\tprint('YES')\r\n\tprint(len(resposta))\r\n\tfor i in range(len(resposta)-1, -1, -1):\r\n\t\tif i == 0:\r\n\t\t\tprint(int(resposta[i]))\r\n\t\t\t\r\n\t\telse:\r\n\t\t\tprint(int(resposta[i]), end = ' ')\r\n", "def read(): return(list(map(int, input().strip().split(\" \"))))\r\n\r\ndef dfs(lis, b):\r\n# print(lis)\r\n if lis[-1] == b:arr.append(lis);return\r\n if lis[-1] > b:return\r\n dfs(lis+[lis[-1]2], b)\r\n dfs(lis+[lis[-1]10 +1], b)\r\n\r\narr = []\r\n\r\na, b = read()\r\ndfs([a], b)\r\nif arr:\r\n print(\"YES\")\r\n print(len(arr[0]))\r\n print(arr[0])\r\nelse:\r\n print(\"NO\")\r\n\r\n ", "m,goal=map(int,input().split())\r\na=[m]\r\nsum_=0\r\n\r\ndef dfs(init):\r\n global sum_,goal,a\r\n if init>goal:\r\n \r\n if(a!=[]):\r\n a.pop()\r\n else:\r\n pass\r\n return False\r\n if init==goal:\r\n return True\r\n \r\n k=init2\r\n a.append(k)\r\n \r\n if dfs(k)==True:\r\n return True\r\n else:\r\n \r\n k=init10+1\r\n a.append(k)\r\n \r\n if dfs(k)==True:\r\n return True\r\n else:\r\n \r\n if(a!=[]):\r\n a.pop()\r\n else:\r\n pass\r\n return False\r\n \r\n \r\n \r\n\r\n \r\nq=dfs(m)\r\nif q==True:\r\n print('YES')\r\n print(len(a))\r\n for i in range(len(a)):\r\n if i!=len(a)-1:\r\n print(a[i],'',end='')\r\n else:\r\n print(a[i])\r\nelse:\r\n print('NO')", "def reach(a, b, path=[]):\n if a > b: return\n if a == b:\n path.append(a)\n print(\"YES\")\n print(len(path))\n print(path)\n exit(0)\n reach(a2,b,path+[a])\n reach(a10+1,b,path+[a])\na,b=map(int,input().split())\nreach(a,b,[])\nprint(\"NO\")\n", "def transform_a_to_b(a, b, res, count):\r\n if a == b:\r\n return res, count\r\n if a > b:\r\n return False\r\n if a < b:\r\n return transform_a_to_b(2a, b, res+str(2a)+\" \", count+1) or transform_a_to_b(10a+1, b, res+str(10a+1)+\" \", count+1)\r\n\r\n\r\ndata = [int(i) for i in input().split(\" \")]\r\ncount = 1\r\nres = transform_a_to_b(data[0], data[1], str(data[0])+\" \", count)\r\nif res:\r\n print(\"YES\")\r\n print(res[1])\r\n print(res[0])\r\nelse:\r\n print(\"NO\")", "data = [int(x) for x in input().split()]\r\na = data[0]\r\nb = data[1]\r\n\r\ndef anidar(arbol,nodo):\r\n arbol[nodo[0]] = [nodo[0]2,nodo[0]10+1]\r\n arbol[nodo[1]] = [nodo[1]2,nodo[1]10+1]\r\n if nodo[0] < b: \r\n anidar(arbol,arbol[nodo[0]])\r\n if nodo[1] < b:\r\n anidar(arbol,arbol[nodo[1]])\r\n \r\ntree = {a:[2a,10a+1]}\r\nanidar(tree,tree[a])\r\npath = []\r\nans = \"\"\r\nfor key in tree:\r\n if b in tree[key]:\r\n path.append(b)\r\n path.append(key)\r\n ans = \"YES\"\r\n break\r\nelse:\r\n ans = \"NO\"\r\n print(ans)\r\n \r\nif ans == \"YES\":\r\n cond = True\r\n while a not in path:\r\n for key in tree:\r\n if path[len(path)-1] in tree[key]:\r\n path.append(key)\r\n break\r\n \r\n path.reverse()\r\n print(ans)\r\n print(len(path))\r\n for i in range(0,len(path)):\r\n print(path[i],end=\"\" if i == len(path)-1 else \" \") \r\n \r\n \r\n", "from collections import deque\n\na,b = map(int, input().split())\npre = {}\nfila = deque([a])\n\nwhile fila:\n v = fila.popleft()\n if v2 not in pre and v2 <= b: \n fila.append(v2)\n pre[v2] = v\n if v10+1 not in pre and v10+1 <= b:\n fila.append(v10+1)\n pre[v10+1] = v\n \nseq = [b]\nif b not in pre:\n print(\"NO\")\nelse:\n print(\"YES\")\n x = b\n while x != a:\n x = pre[x]\n seq.append(x)\n print(len(seq))\n for i in seq[::-1]:\n print(i),\n\t \t\t \t \t\t \t \t\t\t\t \t\t \t \t \t", "a_input, b_input = map(int, input().split())\n\nresult = [str(b_input)]\n\nwhile b_input > a_input:\n if b_input % 2 == 0:\n b_input //= 2\n elif b_input % 10 == 1:\n b_input //= 10\n else:\n break\n result.insert(0,str(b_input))\n\nif a_input != b_input:\n print('NO')\nelse:\n print(f'YES\\n{str(len(result))}\\n{\" \".join(result)}')\n \t \t\t \t \t\t \t\t\t \t\t \t\t\t\t\t\t", "a, b = map(int, input().split())\r\nmoves = []\r\nmoves.append(b)\r\nwhile(b>a):\r\n\tif b%2==0:\r\n\t\tb = int(b/2)\r\n\t\tmoves.append(b)\r\n\telse:\r\n\t\tif str(b)[-1]=='1':\r\n\t\t\tb = int(str(b)[:-1])\r\n\t\t\tmoves.append(b)\r\n\t\telse:\r\n\t\t\tbreak\r\n \r\n \r\nif b!=a:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n\tprint(len(moves))\r\n\tfor i in range(len(moves)-1,-1,-1):\r\n\t\tprint(moves[i])", "a,b=map(int,input().split())\r\nl=[b]\r\nwhile b>a:\r\n\tif b%2==0:\r\n\t\tb=b//2\r\n\telif b%10==1:\r\n\t\tb//=10\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\tl.append(b)\r\nif b!=a:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint(len(l))\r\n\tprint((l[::-1]))", "n,k=map(int,input().strip().split())\r\nans=[k]\r\nwhile k>0 and k!=n:\r\n s=str(k)\r\n if k%2==0:k//=2\r\n elif s[-1]==\"1\" and len(s)>1:k=int(s[:-1])\r\n else:k=0\r\n ans.append(k)\r\nif n==k:print(\"YES\");print(len(ans));print(ans[::-1])\r\nelse:print(\"NO\")", "from collections import deque\r\na,b = map(int,input().split())\r\n\r\nfila = deque([a])\r\nprevious = {}\r\n\r\nwhile fila:\r\n v = fila.popleft()\r\n if (2v <= b and 2v not in previous):\r\n fila.append(2v)\r\n previous[2v] = v\r\n if((10v + 1 not in previous) and (10v + 1 <= b)):\r\n fila.append(10v + 1)\r\n previous[10v + 1] = v\r\n\r\nif(b not in previous):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n res = [b]\r\n x = b\r\n while(x != a):\r\n x = previous[x]\r\n res.append(x)\r\n print(len(res))\r\n print(' '.join(map(str,reversed(res))))\r\n ", "inicio, sonho=list(map(int, input().split(' ')))\n\nanterior, fila = {}, []\nfila.append(inicio)\n\nisPossible = \"NO\"\n\nwhile len(fila)>0 and isPossible == \"NO\":\n ponteiro = fila[0]\n\n if(ponteiro2 <= sonho): \n fila.append(ponteiro2)\n anterior[ponteiro2] = ponteiro\n if(ponteiro10 + 1 <= sonho): \n fila.append(ponteiro10 + 1)\n anterior[ponteiro10 +1] = ponteiro\n\n if(ponteiro == sonho):\n isPossible= \"YES\"\n break\n fila.pop(0)\n\nprint(isPossible)\nif(isPossible==\"YES\"):\n ponteiro=fila[0]\n sequencia=[]\n while(ponteiro != inicio):\n sequencia.append(ponteiro)\n ponteiro= anterior[ponteiro]\n #inteirando do ultimo para o inicio\n #adciona a uma fila2 para tem len e sequencia\n sequencia.append(inicio)\n print(len(sequencia))\n for numero in range(len(sequencia)-1,-1,-1):\n print(str(sequencia[numero])+ \" \", end=\"\")\n\t \t\t \t\t\t\t \t\t \t \t \t \t", "a, b = map(int, input().split())\nthereIsResult = False\nseq = list()\nseq.append(b)\n\nwhile a < b:\n\n if b % 2 == 0:\n b = b // 2\n elif (b - 1) % 10 == 0:\n b = (b - 1) // 10\n else:\n break\n seq.append(b)\n\n if b == a:\n thereIsResult = True\n\nif thereIsResult:\n print(\"YES\")\n print(len(seq))\n seq.reverse()\n for a in seq:\n print(a, end = \" \")\n print()\nelse:\n print(\"NO\")\n \t\t \t \t \t\t \t \t\t\t \t\t \t \t\t", "import queue\n\na, b = map(int, input().split())\nfila = queue.Queue()\npre = {}\n\nfila.put(a)\n\nwhile fila.qsize() > 0:\n v = fila.get()\n if 2 * v not in pre and 2 * v <= b:\n fila.put(2 * v)\n pre[2 * v] = v\n if 10 * v + 1 not in pre and 10 * v + 1 <= b:\n fila.put(10 * v + 1)\n pre[10 * v + 1] = v\n\nans = [b]\n\nif b in pre:\n while pre[ans[-1]] in pre:\n ans.append(pre[ans[-1]])\n ans.append(a)\n \n print(\"YES\")\n print(len(ans))\n print(ans[::-1])\nelse:\n print(\"NO\")\n\n\t\t\t \t\t\t\t\t\t\t\t \t \t\t\t\t\t\t \t\t\t \t \t", "from collections import defaultdict, deque\r\n\r\na, b = [int(n) for n in input().split()]\r\nq = deque([(a)])\r\npath = defaultdict(int)\r\npath[a] = None\r\nans = []\r\n\r\nwhile q:\r\n num = q.popleft()\r\n\r\n if num == b:\r\n cur = num\r\n while cur:\r\n ans.append(cur)\r\n cur = path[cur]\r\n break\r\n\r\n if num 2 not in path and num * 2 <= b:\r\n path[num * 2] = num\r\n q.append(num * 2)\r\n if (num * 10) + 1 not in path and (num * 10) + 1 <= b:\r\n path[(num * 10) + 1] = num\r\n q.append((num * 10) + 1)\r\n\r\nif ans:\r\n ans.reverse()\r\n print('YES')\r\n print(len(ans))\r\n print(ans)\r\nelse:\r\n print('NO')\r\n ", "from collections import deque\r\na,b=map(int,input().split(' '))\r\nlis=deque([b])\r\n\r\ndef transform(a,b):\r\n c=0\r\n while(b!=a):\r\n if b<a:\r\n print('NO')\r\n return\r\n if b%2==0:\r\n b=b/2\r\n lis.appendleft(int(b))\r\n else:\r\n b=(b-1)/10\r\n lis.appendleft(int(b))\r\n c+=1\r\n print('YES')\r\n print(c+1)\r\n \r\n print(lis)\r\ntransform(a,b)", "a,b=map(int,input().split())\r\nk=str(b)\r\nL=[]\r\nwhile(b!=a and b>1):\r\n L.append(b)\r\n if(int(k[-1])%2==0):\r\n b=b//2\r\n k=str(b)\r\n elif(int(k[-1])==1):\r\n k=k[:len(k)-1]\r\n b=int(k)\r\n else:\r\n c=1\r\n break\r\nif(b==a):\r\n L.append(a)\r\n L=L[::-1]\r\n print('YES')\r\n print(len(L))\r\n print(L)\r\nelse:\r\n print('NO')", "# a = [0] 34\r\n# a[10] = 1\r\n# for i in range(10, 34):\r\n# \tif i + 1 <= 33:\r\n# \t\ta[i + 1] += a[i]\r\n# \tif i + 10 <= 33:\r\n# \t\ta[i + 10] += a[i]\r\n\r\n# print(a[33])\r\n\r\n\r\nx, y = map(int, input().split())\r\na = [y]\r\nwhile y > x:\r\n\tif y % 2 == 0:\r\n\t\ty//=2\r\n\t\ta.append(y)\r\n\telif y % 10 == 1:\r\n\t\ty //= 10\r\n\t\ta.append(y)\r\n\telse:\r\n\t\tbreak\r\n\r\nif x == y:\r\n\tprint(\"YES\")\r\n\tprint(len(a))\r\n\tprint(\" \".join(map(str, a[::-1])))\r\nelse:\r\n\tprint(\"NO\")\t\t\r\n", "a, b= map(int, input().split())\r\nrez=0\r\nress=[b]\r\nc=False\r\nwhile b>a:\r\n if b%2==0:\r\n b=b//2\r\n elif b%2==1 and b%10==1:\r\n b=b//10\r\n else:\r\n print(\"NO\")\r\n c=True\r\n break\r\n ress.append(b)\r\n rez+=1\r\nif c==False:\r\n if b!=a:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n print(rez+1)\r\n for i in range(rez, -1, -1):\r\n print(ress[i], end=\" \")", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\na, b = map(int, input().split())\r\n\r\nans = []\r\nfound = False\r\nwhile b:\r\n ans.append(b)\r\n if b%2 == 0:\r\n b //= 2\r\n else:\r\n if b % 10 != 1:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n b //= 10\r\n if b == a:\r\n found = True\r\n ans.append(b)\r\n print(\"YES\")\r\n break\r\nif found:\r\n print(len(ans))\r\n ans = ans[::-1]\r\n print(ans)\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "path=[]\r\n\r\ndef func(x,b):\r\n if x>b:\r\n return False\r\n\r\n if x==b:\r\n path.append(x)\r\n return True\r\n\r\n if func(2x,b):\r\n path.append(x)\r\n return True\r\n\r\n if func(10x+1,b):\r\n path.append(x)\r\n return True\r\n\r\n return False \r\n\r\n \r\n\r\na,b=map(int,input().split())\r\nfunc(a,b)\r\n\r\nif len(path):\r\n print(\"YES\")\r\n print(len(path))\r\n print(path[::-1])\r\nelse:\r\n print(\"NO\")\r\n", "values = input().split(' ')\nvalueA = int(values[0])\nvalueB = int(values[1])\narray = [valueB]\n\nwhile valueB != valueA:\n if(valueB % 10 == 1):\n valueB = valueB//10\n elif(valueB % 2 == 0 and valueB > 0):\n valueB = valueB//2\n else:\n break\n array.append(valueB)\n\nif(valueA == valueB):\n array.reverse()\n print('YES')\n print(len(array))\n for i in array:\n print(i, end = ' ')\nelse:\n print('NO')\n\t \t \t \t \t\t \t \t\t\t \t\t \t", "def solve(a,b,l):\r\n if(a>b):\r\n return False\r\n if(a==b):\r\n return True\r\n x=solve(a2,b,l)\r\n y=solve(a10+1,b,l)\r\n if(x or y):\r\n l.append(a)\r\n return x\|y\r\n\r\nn,m=list(map(int,input().split()))\r\nl=[]\r\nif(solve(n,m,l)):\r\n print(\"YES\")\r\n l.reverse()\r\n l.append(m)\r\n print(len(l))\r\n print(l)\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\n\nnumbers = []\n\nis_B = True\n\nnumbers.append(b)\n\nwhile b > a and is_B:\n if str(b)[len(str(b)) - 1] == '1':\n b = int((b - 1) / 10)\n elif b % 2 == 0:\n b = int(b / 2)\n else:\n is_B = False\n\n numbers.append(b)\n\nif b < a:\n is_B = False\n\nanswer = \"\"\n\nif (is_B):\n print('YES')\n print(len(numbers))\n\n for n in range(len(numbers) - 1, -1, -1):\n answer += str(numbers[n])\n if (n > 0):\n answer += \" \"\n\n print(answer)\n\nelse:\n print('NO')\n \t\t \t \t\t\t \t\t \t \t \t\t \t\t\t\t\t", "def ab():\r\n if a[0]>b:\r\n return\r\n if a[0]==b:\r\n print('YES')\r\n print(len(res))\r\n for r in res:\r\n print(r, end=' ')\r\n print()\r\n found[0]=True\r\n return\r\n a[0]=2\r\n res.append(a[0])\r\n ab()\r\n if found[0]:\r\n return\r\n res.pop()\r\n a[0]//=2\r\n a[0]=10a[0]+1\r\n res.append(a[0])\r\n ab()\r\n if found[0]:\r\n return\r\n res.pop()\r\n a[0]=(a[0]-1)//10\r\nal,b=[int(x) for x in input().split()]\r\nres=[]\r\nres.append(al)\r\nfound=[False]\r\na=[al]\r\nab()\r\nif not found[0]:\r\n print('NO')\r\n", "a,b=map(int,input().split())\r\n\r\nans=[]\r\nmoze= False\r\n\r\nwhile b > a:\r\n ans.append(b)\r\n if b%10 == 1:\r\n b=b//10\r\n elif b%2==0:\r\n b=b//2\r\n else:\r\n break\r\n\r\nif b==a:\r\n ans.append(b)\r\n moze=True\r\n\r\nif moze:\r\n print('YES')\r\n print(len(ans))\r\n print(ans[::-1])\r\n\r\nelse:\r\n print('NO')\r\n \r\n", "from collections import deque\n\na, b = map(int, input().split())\n\nans = deque([b])\n\nwhile b > a:\n if b % 10 == 1:\n b //= 10\n ans.appendleft(b)\n elif b % 2 == 0:\n b //= 2\n ans.appendleft(b)\n else:\n print(\"NO\")\n exit()\n\nif b == a:\n print(\"YES\")\n print(len(ans))\n\n for i in ans: print(i, end=\" \")\n\nelse: print(\"NO\")\n \t \t\t \t \t \t \t\t\t\t \t \t", "n,m=map(int,input().split())\r\nl=[m]\r\nboo=True\r\nwhile m>=n:\r\n if m==n:\r\n \r\n break\r\n if m%10==1:\r\n m=m//10\r\n l.append(m)\r\n elif m%2==0:\r\n m=m//2\r\n l.append(m)\r\n else:\r\n boo=False\r\n break\r\nif m!=n:\r\n boo=False\r\nif boo:\r\n print('YES')\r\n print(len(l))\r\n l=l[::-1]\r\n print(l)\r\nelse:\r\n print('NO')", "from collections import deque\r\na, b = list(map(int, input().split()))\r\nqueue = deque([(a, [])])\r\nlevel = 1\r\nvalid = False\r\nwhile queue:\r\n for i in range(len(queue)):\r\n cur, path = queue.popleft()\r\n path.append(str(cur))\r\n if cur == b:\r\n valid = True\r\n break\r\n if cur < b:\r\n queue.append((2 cur, path.copy()))\r\n queue.append((10 * cur + 1, path.copy()))\r\n if valid:\r\n break\r\n level += 1\r\n\r\nif not valid:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(level)\r\n print(\" \".join(path))\r\n", "ij, n = map(int, input().split())\r\n\r\ncheck = False\r\ndef solve(ij, n, p):\r\n global check\r\n if ij == n:\r\n check = True\r\n print(\"YES\")\r\n print(len(p))\r\n print(p)\r\n return\r\n if(ij < n):\r\n solve(2ij, n, p + [2ij])\r\n solve(10ij + 1, n, p + [10ij+1])\r\n#backtracking\r\n\r\nsolve(ij, n, [ij])\r\nif not check:\r\n print(\"NO\")", "# cook your dish here\r\na,b=list(map(int,input().split()))\r\nans=list()\r\nflag=False\r\ndef solve(x,b,v):\r\n if x==b:\r\n global ans\r\n \r\n ans=[x for x in v]\r\n # print(ans)\r\n global flag\r\n flag=True\r\n # print(ans)\r\n return\r\n \r\n # print(ans)\r\n if 2x<=b:\r\n # print(2x)\r\n v.append(2x)\r\n solve(2x,b,v)\r\n v.pop()\r\n if 10x+1<=b:\r\n # print(10x+1)\r\n v.append(10x+1)\r\n solve(10x+1,b,v)\r\n v.pop()\r\n return\r\n\r\ntemp=[a]\r\nsolve(a,b,temp)\r\n\r\nif flag==True:\r\n print('YES')\r\n print(len(ans))\r\n for x in ans:\r\n print(x,end=\" \")\r\nelse :\r\n print(\"NO\")\r\n ", "y, n = map(int, input().split())\r\n\r\ncheck = False\r\ndef solve(y, n, p):\r\n global check\r\n if y == n:\r\n check = True\r\n print(\"YES\")\r\n print(len(p))\r\n print(p)\r\n return\r\n if(y < n):\r\n solve(2y, n, p + [2y])\r\n solve(10y + 1, n, p + [10y+1])\r\n\r\n#backtracking\r\n\r\n\r\nsolve(y, n, [y])\r\nif not check:\r\n print(\"NO\")", "a,b = map(int, input().split())\r\nans = []\r\nwhile b>a:\r\n ans.append(b)\r\n if b%2 == 0:\r\n b //= 2\r\n else:\r\n b -= 1\r\n if b%10 == 0:\r\n b //= 10\r\n else:\r\n b = 0\r\nif b==a:\r\n ans.append(b)\r\n print(\"YES\")\r\n print(len(ans))\r\n for i in range(len(ans)-1,-1,-1):\r\n print(ans[i], end = \" \")\r\nelse:\r\n print(\"NO\")", "i, n = map(int, input().split())\r\n\r\nch = False\r\ndef solve(i, n, p):\r\n global ch\r\n if i == n:\r\n ch = True\r\n print(\"YES\")\r\n print(len(p))\r\n print(p)\r\n return\r\n if(i < n):\r\n solve(2i, n, p + [2i])\r\n solve(10i + 1, n, p + [10i+1])\r\n\r\n#backtracking\r\n\r\n\r\nsolve(i, n, [i])\r\nif not ch:\r\n print(\"NO\")", "\ndef get_ops_list(a, b):\n if a == b:\n return [a]\n elif a > b:\n return []\n\n k = a 2\n ops = get_ops_list(k, b)\n \n if len(ops) > 0:\n return [a, ops]\n else:\n k = 10 a + 1\n ops = get_ops_list(k, b)\n if len(ops) > 0:\n return [a, ops]\n else:\n return []\n\na, b = list(map(int, input().split()))\n\nops = get_ops_list(a, b)\n\nif len(ops) > 0:\n print(\"YES\")\n print(len(ops))\n for n in ops:\n print(n, end=\" \")\n print(\"\")\nelse:\n print(\"NO\")\n\n\t\t \t \t\t \t\t\t\t\t\t \t\t\t\t\t \t\t\t", "a,b = map(int,input().split())\r\nl = [b]\r\nwhile b % 2 == 0 or b % 10 == 1:\r\n if b == 0 or b == 1:\r\n break\r\n if b == a:\r\n break\r\n elif b % 2 == 0:\r\n b = int(b/2)\r\n l.append(b)\r\n else:\r\n b = int((b-1)/10)\r\n l.append(b)\r\n \r\nif b == a:\r\n print(\"YES\")\r\n print(len(l))\r\n print(reversed(l))\r\nelse:\r\n print(\"NO\")", "def dfs(x, b, path):\r\n if x == b:\r\n return path\r\n if 2 * x <= b:\r\n res = dfs(2 * x, b, path + [2 * x])\r\n if res is not None:\r\n return res\r\n if 10 * x + 1 <= b:\r\n res = dfs(10 * x + 1, b, path + [10 * x + 1])\r\n if res is not None:\r\n return res\r\n return None\r\n\r\na, b = map(int, input().split())\r\npath = dfs(a, b, [a])\r\nif path is None:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(path))\r\n print(path)\r\n", "a, b = map(int, input().split())\naux = []\naux.append(b)\n\nwhile(b > 0):\n if(b % 2 == 0):\n b /= 2\n aux.append(b)\n elif((b-1) % 10 == 0):\n b -= 1\n b /= 10\n aux.append(b)\n else:\n break\n \n if(b == a): \n break\n\nif(aux[len(aux) - 1] == a):\n print(\"YES\")\n print(len(aux))\n size = len(aux)\n for i in range(size - 1, -1, -1):\n print(int(aux[i]), end=\" \")\nelse:\n print(\"NO\")\n \t\t\t\t \t \t \t\t\t \t \t\t\t\t\t\t\t", "from collections import deque\n\na, b = map(int, input().split())\naux = dict()\nfila = deque([a])\nwhile fila != deque():\n \n e = fila.popleft()\n temp = e 2\n if temp not in aux and temp <= b:\n fila.append(temp)\n aux[temp] = e\n temp = 10 * e + 1\n if temp not in aux and temp <= b:\n fila.append(temp)\n aux[temp] = e\nif b not in aux:\n print('NO')\nelse:\n resp = [str(b)]\n temp = b\n while temp != a:\n temp = aux[temp]\n resp.append(str(temp))\n print('YES')\n print(len(resp))\n print(' '.join(resp[::-1]))\n \t \t\t \t\t\t \t \t\t \t\t \t \t\t\t\t\t", "def transformation(a, b):\n sequence = [b]\n while (b != a):\n if (b % 10 == 1):\n b = b // 10\n elif (b % 2 == 0 and b > 0):\n b = b // 2\n else:\n break\n sequence.append(b)\n if (a == b):\n sequence.reverse()\n print('YES')\n print(len(sequence))\n for i in sequence:\n print(i, end = ' ')\n else:\n print('NO')\n\na, b = map(int, input().split())\ntransformation(a, b)\n \t \t\t\t\t \t \t \t \t\t\t\t\t\t \t\t\t", "def bfs(a, b, steps):\n if a > b:\n return False\n if a == b:\n return steps\n\n return bfs(2a, b, steps + [2a]) or \\\n bfs(10a + 1, b, steps + [10a + 1])\n\n\na, b = map(int, input().split())\n\nsteps = bfs(a, b, [a])\n\nif not steps:\n print('NO')\nelse:\n print('YES')\n print(len(steps))\n print(steps)\n\n\t\t \t\t\t\t\t \t\t\t \t \t \t \t", "def first_operation(x):\r\n return 2x\r\n \r\ndef second_operation(x):\r\n return (10x + 1)\r\n \r\ndef transform(x,y,z):\r\n first = first_operation(x)\r\n second = second_operation(x)\r\n \r\n if(x > y):\r\n return False\r\n if(x == y):\r\n return True\r\n \r\n firstOp = transform(first,y,z)\r\n \r\n if(firstOp):\r\n z.append(first)\r\n return True\r\n \r\n else:\r\n secondOp = transform(second,y,z)\r\n \r\n if(secondOp):\r\n z.append(second)\r\n return True\r\n \r\n return False\r\n \r\na,b = [int(e) for e in input().split()]\r\n \r\nz = []\r\n \r\nsequence = transform(a,b,z)\r\n \r\nif(len(z) == 0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n z.append(a)\r\n z.reverse()\r\n print(len(z))\r\n print(z, sep=\" \")", "a, b = map(int, input().split())\r\nX = [b]\r\n \r\nwhile a < b:\r\n if b % 2:\r\n b, m = divmod(b, 10)\r\n if m != 1:\r\n break\r\n else:\r\n b //= 2\r\n X.append(b)\r\n \r\nif a != b:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(len(X))\r\n print(reversed(X))", "a,b = [int(x) for x in input().split()]\r\ncheck = False\r\ndef solve(i,path):\r\n # nonlocal check\r\n if i>b:\r\n return False\r\n elif i==b:\r\n print(\"YES\")\r\n print(len(path))\r\n print(path)\r\n return True\r\n else:\r\n option1 = solve(2i,path + [2i])\r\n option2 = solve(10i + 1,path+ [10i+1])\r\n \r\n return option1 or option2\r\n \r\nif not (solve(a,[a])):\r\n print(\"NO\")", "import sys\na, b = map(int, input().split())\nanscnt = 1\nans = []\nans.append(b)\nwhile b != a:\n if b < a:\n print('NO')\n exit(0)\n elif b % 10 == 1:\n b = (b-1)//10\n elif b % 2 == 0:\n b //= 2\n else:\n print('NO')\n exit(0)\n anscnt += 1\n ans.append(b)\nprint('YES')\nprint(anscnt)\nprint(ans[::-1])\n", "\n\ndef verify(num, lista):\n if num == target:\n return True, lista\n elif num > target:\n return False, lista\n aux1 = lista.copy()\n aux2 = lista.copy()\n aux1.append(num2)\n aux2.append((num10+1))\n r1,l1 = verify(num2, aux1)\n r2,l2 = verify((num10) + 1, aux2)\n if r1:\n return True, l1\n if r2:\n return True, l2\n else:\n return False, []\n\nnum, target = map(int,input().split())\nr, vals = verify(num,[num])\n\nif r:\n print(\"YES\")\n print(len(vals))\n for i in range(len(vals)):\n print(vals[i],end = \" \\n\"[i==len(vals)-1])\nelse:\n print('NO')", "a, b = list(map(int, input().split()))\n\nfila = [(a, [a])]\nflag = False\n\nwhile fila:\n atual, caminho = fila.pop(0)\n\n if atual == b:\n flag = True\n print(\"YES\")\n print(len(caminho))\n print(' '.join(map(str, caminho)))\n break\n\n if atual < b:\n fila.append((atual 2, caminho + [atual * 2]))\n fila.append((atual * 10 + 1, caminho + [atual * 10 + 1]))\n\nif not flag:\n print(\"NO\")\n\n \t\t \t \t \t \t\t \t \t \t \t", "a, s = map(int, input().split())\r\nc = [s]\r\nwhile s != a:\r\n\tif s % 10 == 1:\r\n\t\ts //= 10\r\n\telif s % 2 == 0 and s > 0:\r\n\t\ts //= 2\r\n\telse:\r\n\t\tbreak\r\n\tc.append(s)\r\nif a == s:\r\n\tc.reverse()\r\n\tprint('YES')\r\n\tprint(len(c))\r\n\tfor i in c:\r\n\t\tprint(i, end = ' ')\r\nelse:\r\n\tprint('NO')", "numbers = [int(x) for x in input().split()]\n \na = numbers[0]\nb = numbers[1]\n\nresult = []\n\nresult.append(int(b))\n\nwhile b > 0:\n if b%2==0:\n b =b/2\n result.append(int(b))\n\n elif((b-1)%10==0):\n b -=1\n b = b/10\n result.append(int(b))\n else:\n break\n\n if b==a :\n break\n \ntam = len(result)\n\nif result[tam-1] != a:\n print(\"NO\")\nelse:\n result.reverse()\n print(\"YES\")\n print(tam)\n print(result)\n \t \t \t \t \t \t\t \t \t\t\t", "def dfs(t):\r\n if t>b:\r\n return \r\n if t==b:\r\n ans.append(t)\r\n return True\r\n if dfs(2t):\r\n ans.append(t)\r\n return True\r\n \r\n if dfs(10t+1):\r\n ans.append(t)\r\n return True\r\n \r\n return False\r\n \r\n \r\nans=[]\r\na,b=map(int,input().split())\r\n#ans.append(a)\r\nif dfs(a):\r\n print('YES')\r\n print(len(ans))\r\n ans.reverse()\r\n print(ans)\r\n \r\nelse:\r\n print('NO')\r\n", "a,b=map(int,input().split())\r\n\r\nans=1\r\nans2=[b]\r\nwhile b!=a:\r\n if str(b)[-1]==\"1\": \r\n b=b//10\r\n ans2.append(b)\r\n ans+=1\r\n else:\r\n if b%2==0:\r\n b=b//2\r\n ans2.append(b)\r\n ans+=1\r\n else:\r\n print(\"NO\")\r\n exit()\r\n if b<a:\r\n print(\"NO\")\r\n exit()\r\nans2.reverse()\r\nprint(\"YES\")\r\nprint(ans)\r\nprint(ans2)\r\n\r\n ", "a, b = map(int,input().split())\r\nresult=[b]\r\n \r\nwhile(a < b):\r\n\tif(b % 10 == 1):\r\n\t\tb = b // 10\r\n\telif(b % 2 == 0):\r\n\t\tb = b//2\r\n\telse:\r\n\t\tbreak\r\n\tresult.append(b)\r\nresult.reverse()\r\n\r\nif(a == b):\r\n print(\"YES\")\r\n print(len(result))\r\n print(result)\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\nlista = []\n\ndef transformAtoB(a, b, lista=[]):\n \n if b % 2 == 0:\n b = b / 2\n if b >= a:\n lista.insert(0, int(b))\n transformAtoB(a, b, lista)\n\n elif b % 10 == 1:\n b = b // 10\n if b >= a:\n lista.insert(0, int(b))\n transformAtoB(a, b, lista)\n \ntransformAtoB(a, b, lista)\nlista.append(b)\n\nif a in lista:\n \n print(\"YES\")\n print(len(lista))\n print(\" \".join(map(str, lista)))\n \nelse:\n \n print(\"NO\")\n\t\t \t\t\t\t \t \t\t\t \t\t\t \t\t\t \t\t \t \t", "a, b = list(map(int, input().split()))\r\n\r\nvis = set()\r\nachou = False\r\n\r\ndef tentar(curr):\r\n global b\r\n global achou\r\n if achou:\r\n return None\r\n \r\n ret = None\r\n qtd = len(vis)\r\n vis.add(curr)\r\n if len(vis) == qtd or curr > b:\r\n return None\r\n \r\n if curr == b:\r\n achou = True\r\n return [curr]\r\n branch1 = tentar(curr * 2)\r\n branch2 = tentar(curr * 10 + 1)\r\n if branch1 != None:\r\n branch1.append(curr)\r\n ret = branch1\r\n if branch2 != None:\r\n branch2.append(curr)\r\n ret = branch2\r\n \r\n return ret\r\n \r\nresp = tentar(a)\r\n\r\nif resp == None:\r\n print('NO')\r\nelse:\r\n print('YES' )\r\n print(len(resp))\r\n print(' '.join(map(str, resp[::-1])))", "v = []\r\n\r\na, b = map(int, input().split())\r\n\r\nv.append(int(b))\r\n\r\nwhile b > 0:\r\n if b%2 == 0:\r\n b/=2\r\n v.append(int(b))\r\n elif (b-1)%10==0:\r\n b -= 1\r\n b /= 10\r\n v.append(int(b))\r\n else:\r\n break\r\n if b == a:\r\n break\r\nif v[len(v)-1] != a:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(len(v))\r\n res = v[::-1]\r\n print(res,sep=\" \")", "m=list(input().split(' '))\r\na=int(m[0])\r\nb=int(m[1])\r\nn=[]\r\nwhile b>a :\r\n n.append(b)\r\n if b%2==0:b=int(b/2)\r\n elif b%10==1:b=int(b//10)\r\n else:break\r\nn.append(a)\r\nif a==b:\r\n print('YES')\r\n print(len(n))\r\n for i in range(1,len(n)+1):\r\n print(n[len(n)-i],'',end='')\r\nelse:print('NO')", "a, b = input().split()\n\na = int(a)\nb = int(b)\n\nlista = []\nlista.append(b)\n\nwhile (b > 0):\n if (b % 2 == 0):\n b = b / 2\n lista.append(b)\n \n elif ((b-1) % 10 == 0):\n b = b - 1\n b = b / 10\n lista.append(b)\n \n else:\n break\n\n if (a == b):\n break\n\nif (lista[-1] != a):\n print('NO')\nelse:\n print('YES')\n print(len(lista))\n list_size = len(lista)\n for i in range(list_size - 1, -1, -1):\n print(int(lista[i]), end=\" \")\n print()\n\t\t \t \t\t \t \t \t\t \t \t", "a,b=map(int,input().split())\r\nk=[b]\r\nif len(str(b))<=9:\r\n while b>a:\r\n if b%2==0:\r\n b=int(b/2)\r\n k.append(b)\r\n else:\r\n b=int(b//10)\r\n k.append(b)\r\n k.reverse()\r\n if min(k)==a:\r\n print('YES')\r\n print(len(k))\r\n for item in k:\r\n print(item, end=\" \")\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "def get(a, b):\r\n if a > b:\r\n return None\r\n if a==b:\r\n return [b]\r\n c = get(a 2, b)\r\n if c != None:\r\n return [a] + c\r\n c = get(a * 10+1, b)\r\n if c != None:\r\n return [a] + c\r\n return None\r\n \r\n \r\na, b=map(int, input().split())\r\nc = get(a, b)\r\nif c != None:\r\n print('YES')\r\n print(len(c))\r\n for x in c:\r\n print(x, end = ' ')\r\nelse:\r\n print('NO')", "num1, num2 = map(int, input().split())\narray=[]\narray.append(num2)\nwhile num2 > num1:\n if (num2 % 10 == 1):\n num2 = num2 // 10\n elif (num2 % 2 == 0):\n num2 = num2 // 2\n else:\n break\n array.append(num2)\nif num2 == num1:\n array.reverse()\n print(\"YES\")\n print(len(array))\n print(array)\nelse:\n print(\"NO\") \n \t \t\t \t\t \t \t \t \t \t\t\t", "n,m=map(int, input().split())\r\na=[]\r\na.append(m)\r\nwhile m>n:\r\n if m%10==1:\r\n m//=10\r\n elif m%2==0:\r\n m//=2\r\n else:\r\n break\r\n a.append(m)\r\nif m==n:\r\n a.reverse()\r\n print('YES')\r\n print(len(a))\r\n print(a)\r\nelse:\r\n print('NO')", "def fn(n):\r\n if n%10==1:\r\n n=(n-1)/10\r\n elif n%2==0:\r\n n=n/2\r\n else:\r\n n=-1\r\n return int(n)\r\ndef transformation(a,b):\r\n L=[]\r\n while a<b:\r\n L.append(fn(b))\r\n b=fn(b)\r\n return L\r\nL=list(map(int,input().split()))\r\nif transformation(L[0],L[1])[len(transformation(L[0],L[1]))-1]==-1 or transformation(L[0],L[1])[len(transformation(L[0],L[1]))-1]!=L[0]:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(len(transformation(L[0],L[1]))+1)\r\n for j in range(len(transformation(L[0],L[1])+[L[1]])-1,-1,-1):\r\n print(([L[1]]+transformation(L[0],L[1]))[j],end=' ')\r\n", "a,b=map(int,input().split())\r\nf=0\r\nl=[b]\r\nwhile b>a:\r\n\tif b%2==1 and b%10!=1:\r\n\t\tf=1\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\n\telif b%10==1:\r\n\t\tb=(b-1)//10\r\n\t\tl.insert(0,b)\r\n\telse:\r\n\t\tb=b//2\r\n\t\tl.insert(0,b)\r\nif f==0 and b==a:\r\n\tprint(\"YES\")\r\n\tprint(len(l))\r\n\tprint(l)\r\nelif f==0:\r\n\tprint(\"NO\")\r\n", "a, b = [int(x) for x in input().split()]\nsteps = []\n\ndef op1(n):\n return 2 n\n\ndef op2(n):\n return (10 * n) + 1\n\ndef steps_for(acc, a, b):\n\n if op1(a) == b:\n acc.append(1)\n return((acc, True))\n\n if op2(a) == b:\n acc.append(2)\n return((acc, True))\n\n result = []\n\n # try 1\n if op1(a) < b:\n tmp = acc.copy()\n tmp.append(1)\n result = steps_for(tmp, op1(a), b)\n if result[1]:\n return(result)\n\n\n # try 2\n if op2(a) < b:\n tmp = acc.copy()\n tmp.append(2)\n result = steps_for(tmp, op2(a), b)\n if result[1]:\n return(result)\n \n return((acc, False))\n\ndef test(sequence):\n if len(sequence) > 3:\n print(sequence)\n return\n\n test(sequence + \"1\")\n\n test(sequence + \"0\")\n\n(steps, possible) = steps_for([],a, b)\n\nif not possible:\n print(\"NO\")\nelse:\n result = [a]\n\n for s in steps:\n if s == 1:\n result.append(op1(result[-1]))\n if s == 2:\n result.append(op2(result[-1]))\n \n print(\"YES\")\n print(len(result))\n print(result)\n\t \t\t \t\t \t\t \t \t \t\t \t \t\t \t", "a, b = map(int, input().split())\r\n\r\nc = False\r\ndef sai(a, b, p):\r\n global c\r\n if a == b:\r\n c = True\r\n print(\"YES\")\r\n print(len(p))\r\n print(p)\r\n return\r\n if(a < b):\r\n sai(2a, b, p + [2a])\r\n sai(10a + 1, b, p + [10a+1])\r\n\r\n\r\n\r\nsai(a, b, [a])\r\nif c!=True:\r\n print(\"NO\")", "a,b=map(int, input().split())\r\nx=[b]\r\nwhile a<b:\r\n if b%2==1 and b%10!=1: break\r\n if b%10==1: b=b//10\r\n else: b=b//2\r\n x.append(b)\r\nif a!=b: print(\"NO\")\r\nelse: \r\n print(\"YES\")\r\n print(len(x))\r\n print(x[::-1])", "def solution(a, b):\r\n ans = [b]\r\n while b > a:\r\n if b % 10 == 1:\r\n ans.append(b // 10)\r\n b //= 10\r\n elif b % 2 == 0:\r\n ans.append(b // 2)\r\n b //= 2\r\n else:\r\n return []\r\n return ans if b == a else []\r\n\r\na, b = map(int, input().split())\r\n\r\nans = solution(a, b)\r\nif len(ans) == 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(len(ans))\r\n print(' '.join(map(str, ans[::-1])))", "from functools import lru_cache\r\nclass Solution:\r\n def transformation(self, a, b):\r\n # TODO write an algorithm here\r\n \"\"\"\r\n Time complexity: O(n)\r\n space complexity: O(1)\r\n \"\"\"\r\n self.answer = []\r\n def dfs(a, path):\r\n if path[-1] > b:\r\n return self.answer\r\n if path[-1] == b:\r\n self.answer = path\r\n return self.answer\r\n dfs(a2, path+[a2])\r\n dfs(10a+1, path+[10a+1])\r\n return self.answer\r\n return dfs(a, [a])\r\n \r\nif __name__ == \"__main__\":\r\n solution = Solution()\r\n a, b = list(map(int, input().split()))\r\n \r\n answer = solution.transformation(a, b)\r\n if answer:\r\n print(\"YES\")\r\n print(len(answer))\r\n for i in range(len(answer)):\r\n print(answer[i], end=\" \")\r\n else:\r\n print(\"NO\")", "achou = False\nsolucao = []\n\ndef caminho(a, b, seq):\n global achou\n global solucao\n if(a == b): \n achou = True\n solucao = seq\n # solucao.append(b)\n return\n \n if(a > b):\n return \n\n seq_1 = seq.copy()\n a1 = a 2\n seq_1.append(a1)\n caminho(a1, b, seq_1)\n \n if(achou):\n return\n \n seq_2 = seq.copy()\n a2 = (a10) + 1\n seq_2.append(a2)\n caminho(a2, b, seq_2)\n \n\na, b = list(map(int, input().split()))\n\ncaminho(a, b, [a])\nif(achou):\n print(\"YES\")\n print(len(solucao))\n print(solucao)\nelse:\n print(\"NO\")\n \t\t \t \t\t\t \t\t \t\t\t \t\t \t \t", "def f(a,b,L):\r\n if a==b: \r\n return \"YES\"\r\n elif a > b:\r\n L.clear()\r\n return \"NO\"\r\n if f(a10 + 1, b, L) == \"YES\":\r\n L.append(a10+1)\r\n return \"YES\"\r\n elif f(2a,b,L) == \"YES\":\r\n L.append(2a)\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\na,b = map(int,input().split())\r\nL = []\r\nsol = f(a,b,L)\r\nprint(sol)\r\nL.append(a)\r\nL.sort()\r\nif sol!=\"NO\":\r\n print(len(L))\r\n for i in L:\r\n print(i,end=\" \")", "from sys import exit\r\na,b=[int(e) for e in input().split()]\r\ndef f(s,x):\r\n s+=[x]\r\n if x==a:\r\n print(\"YES\")\r\n print(len(s))\r\n print(s[::-1])\r\n exit()\r\n elif x>a:\r\n if x%2==0:\r\n f(s,x//2)\r\n if (x-1)%10==0:\r\n f(s,(x-1)//10)\r\nf([],b)\r\nprint(\"NO\")", "a, b = input().split(\" \")\n\na = int(a)\nb = int(b)\n\ndef promissor(n):\n return n < b\n\ndef solucao(a,b):\n if a == b:\n print(\"YES\")\n print(\"0\")\n elif a > b:\n print(\"NO\")\n else:\n sol = \"\"\n r = find(a,b,sol)\n if r == -1:\n print(\"NO\")\n\n\ndef find(n, b, sol):\n sol += str(n)\n\n if n == b:\n print(\"YES\")\n print(len(sol.split(\" \")))\n print(sol)\n\n exit() \n else:\n sol += \" \"\n if promissor(n):\n find(2 n,b,sol)\n find(10 * n + 1,b,sol)\n\n return -1\n\nsolucao(a,b)\n \t \t \t\t \t \t\t \t \t \t\t \t", "a_input, b_input = map(int, input().split())\n\ndef transform_a_b(a,b):\n if(a >= b):\n return [str(b)]\n if b % 2 == 0:\n return transform_a_b(a, b//2) + [str(b)]\n elif b % 10 == 1:\n return transform_a_b(a, b//10) + [str(b)]\n else:\n return [str(b)]\n\na_to_b = transform_a_b(a_input, b_input)\n\nif str(a_input) != a_to_b[0]:\n print('NO')\nelse:\n print(f'YES\\n{str(len(a_to_b))}\\n{\" \".join(a_to_b)}')\n\t\t \t \t \t \t \t\t\t \t \t\t", "a, b = map(int, input().split())\r\n\r\ndaf_set = {a}\r\nnot_yet = {a}\r\n\r\n\r\nwhile len(not_yet) > 0:\r\n if min(not_yet) > b:\r\n break\r\n not_yet2 = set()\r\n for x in not_yet:\r\n if 2x <= b:\r\n not_yet2.add(2x)\r\n daf_set.add(2x)\r\n if 10x + 1 <= b:\r\n not_yet2.add(10x + 1)\r\n daf_set.add(10x + 1)\r\n not_yet = not_yet2\r\n\r\nif b in daf_set:\r\n print(\"YES\")\r\n has = []\r\n while b > a:\r\n has.append(b)\r\n if b%2 == 1:\r\n b = b//10\r\n else:\r\n if b // 2 in daf_set:\r\n b = b // 2\r\n else:\r\n b = b // 10\r\n has.append(a)\r\n print(len(has))\r\n print(has[::-1])\r\nelse:\r\n print(\"NO\")\r\n", "a,b=map(int,input().split())\r\nr=[b]\r\nwhile b>a:\r\n d=b%10\r\n if d==1:b//=10\r\n elif d%2:break\r\n else:b//=2\r\n r+=[b]\r\nr=r[::-1]\r\nprint([f'YES\\n{len(r)}\\n{\" \".join(map(str,r))}','NO'][a!=b])", "def Vasily(a, b, historico):\n if a > b:\n print('NO', end='')\n return 0\n \n if b%2 == 0:\n historico.insert(0, int(b/2))\n elif (b-1)%10 == 0:\n historico.insert(0, int((b-1)/10))\n else:\n print('NO', end='')\n return 0\n \n #print(a, historico, a==historico[0])\n \n if a == historico[0]:\n print('YES')\n l = len(historico)\n print(l)\n for n in range(0, l):\n print(historico[n], '', end='')\n return 0\n \n Vasily(a, historico[0], historico)\n\n\nscan = input().split(' ')\n \na = int(scan[0])\nb = int(scan[1])\nhistorico = [b]\n\nVasily(a, b, historico)\nprint()\n\n\t\t \t\t\t \t\t \t\t\t\t\t\t \t\t \t \t\t", "a,b=map(int,input().split())\r\nc=10\r\nx=[b]\r\n\r\nwhile a<b:\r\n\tif (1>1&b):\r\n\t b>>=1\r\n\telif (2>b%c):\r\n\t b//=c\r\n\telse:\r\n\t break\r\n\tx.append(b)\r\n\r\nif (a!=b):\r\n print('NO')\r\n\r\nelse:\r\n\tprint('YES')\r\n\tprint(len(x))\r\n\tprint(reversed(x))", "a,b = map(int,input().split())\r\ncnt = 0\r\nc = True\r\ns = [b]\r\nwhile b>a:\r\n\tif str(b)[-1]==\"1\":\r\n\t\tb//=10\r\n\t\ts.append(b)\r\n\telif b%2==0:\r\n\t\tb//=2\r\n\t\ts.append(b)\r\n\telse:\r\n\t\tc=False\r\n\t\tbreak\r\nif c and a==b:\r\n\tprint(\"YES\")\r\n\tprint(len(s))\r\n\tprint(s[::-1])\r\nelse:\r\n\tprint(\"NO\")", "a, b = list(map(int, input().split()))\n\nfila = [(a, [a])]\nflag = 0\nwhile fila:\n atual, caminho = fila.pop(0)\n\n if atual == b:\n flag = 1\n print(\"YES\")\n print(len(caminho))\n print(' '.join(map(str,caminho)))\n break\n if atual < b:\n fila.append((atual 2, caminho + [atual2]))\n fila.append((atual 10+1, caminho + [atual10+1]))\n\nif(flag == 0):\n print(\"NO\")\n \t\t\t \t\t\t\t \t\t \t \t \t\t\t \t \t", "a, b = map(int,input().split())\r\nk = []\r\nwhile b > a:\r\n k.append(b)\r\n if b%10==1:\r\n b-=1\r\n b//=10\r\n elif b%2==0:\r\n b//=2\r\n else:\r\n print(\"NO\")\r\n exit()\r\nif a==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n exit()\r\nk = k[::-1]\r\nprint(len(k) + 1)\r\nprint(a,end=' ')\r\nprint(k,end=' ')\r\n", "A, B = 0, 0\nMAXN = 1e9 + 7\n\nappend = lambda x : (x * 10) + 1\nmultiply = lambda x : x * 2\n\ndef entrypoint():\n global A, B\n A, B = list(map(int, input().split()))\n\ndef search(x):\n if x >= MAXN:\n return None\n if x == B:\n return { 'trace': [x], 'steps': 1 }\n \n x1 = append(x)\n x2 = multiply(x)\n\n search1 = search(x1)\n search2 = search(x2)\n\n for result in [search1, search2]:\n if result != None:\n result['trace'].insert(0, x)\n result['steps'] += 1\n return result\n else:\n continue\n \n return None\n\ndef run():\n result = search(A)\n if result == None:\n print('NO')\n else:\n print('YES')\n print(result['steps'])\n print(' '.join(list(map(str, result['trace']))))\n\n\ndef main():\n entrypoint()\n run()\n\nif __name__ == '__main__':\n main()\n\t\t\t \t\t \t\t\t\t \t \t\t \t \t\t\t\t \t", "a,b=map(int,input().split())\nresult=[b]\n \nwhile a<b:\n\tif b%10==1:\n\t\tb=b//10\n\telif b%2==0:\n\t\tb=b//2\n\telse:\n\t\tbreak\n\tresult.append(b)\n\nresult.reverse()\nif(a ==b):\n print(\"YES\")\n print(len(result))\n print(result)\nelse:\n print(\"NO\")", "from collections import \r\nfrom math import \r\n\r\na,b = list(map(int,input().split()))\r\nans = [b]\r\nwhile(b > a):\r\n\tif(b%10 == 1):\r\n\t\tb //= 10\r\n\telif((b%10)&1):\r\n\t\tprint(\"NO\")\r\n\t\texit(0)\r\n\telse:\r\n\t\tb //= 2\r\n\tans.append(b)\r\nif(a != b):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tans = ans[::-1]\r\n\tprint(len(ans))\r\n\tprint(ans)\r\n", "def transformation(x, y, solution):\n solution.append(x)\n if(x == y):\n return solution\n else:\n if(x < y):\n has_solution1 = transformation(x2, y, solution[:])\n has_solution2 = transformation(int(str(x) + '1'), y, solution[:])\n return has_solution1 or has_solution2\n\n[n, m] = list(map(int, input().split()))\nresult = transformation(n, m, [])\nif(result):\n print('YES')\n print(len(result))\n print(' '.join(map(str, result)))\nelse:\n print('NO')", "def transform(a, b, output):\n\n if a > b:\n return False\n\n if a == b:\n return True\n \n newv = 2a\n op1 = transform(newv, b, output)\n\n if op1:\n\n output.append(newv)\n return True\n \n else:\n\n newv = 10a + 1\n op2 = transform(newv, b, output)\n\n if op2:\n output.append(newv)\n return True\n \n return False\n\na, b = map(int, input().split())\nout = []\n\ntransform(a, b, out)\n\nif len(out) == 0:\n print(\"NO\")\nelse:\n out.append(a)\n out.reverse()\n print(f\"YES\\n{len(out)}\")\n print(\" \".join([str(o) for o in out]))\n", "def x_to_y(x, y, ans=[], ind=0):\n if (ind == 0):\n ans.append(x)\n\n if (x >= y):\n if (x == y):\n return ans\n return []\n\n if (x2 <= y):\n op1 = x_to_y(x2, y, ans + [x2], ind + 1)\n if (op1):\n return op1\n\n if (x10 + 1 <= y):\n op2 = x_to_y(x10 + 1, y, ans + [x10 + 1], ind + 1)\n if (op2):\n return op2\n\n else:\n return []\n\n\na, b = map(int, input().split())\n\n\nresult = x_to_y(a, b)\n\n\nif (result):\n print(\"YES\")\n print(len(result))\n print(' '.join(map(str, result)))\nelse:\n print(\"NO\")\n\n \t\t\t\t\t \t \t\t\t\t\t \t \t\t \t \t \t", "def get_next_seq(a,b,sequence):\r\n if(sequence[-1] == b):\r\n return sequence\r\n elif(sequence[-1] < b):\r\n var1 = get_next_seq(a,b,sequence+[2sequence[-1]])\r\n var2 = get_next_seq(a,b,sequence+[10sequence[-1]+1])\r\n if var1:\r\n return var1\r\n elif var2:\r\n return var2\r\n else:\r\n return []\r\n\r\na, b = map(int, input().split())\r\nres = get_next_seq(a,b,[a])\r\n\r\nif res:\r\n print(\"YES\")\r\n print(len(res))\r\n print(res)\r\nelse:\r\n print(\"NO\")", "from itertools import accumulate\r\nfrom collections import defaultdict\r\n\r\ndef I(): return int(input())\r\ndef ST(): return input()\r\ndef IL(): return list(map(int, input().split()))\r\ndef ILS(): return sorted(map(int, input().split()))\r\n\r\na,b = IL()\r\nres = [b]\r\nans = True\r\nwhile a < b:\r\n if b%2 == 0:\r\n b //= 2\r\n res.append(b)\r\n elif b%10 == 1:\r\n b //= 10\r\n res.append(b)\r\n else:\r\n ans = False\r\n break\r\n \r\nif ans and a == b:\r\n print(\"YES\")\r\n print(len(res))\r\n print(reversed(res))\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def t(a, b, seq):\r\n seq.append(a)\r\n\r\n if a > b:\r\n seq.pop()\r\n return\r\n elif a == b:\r\n return seq\r\n\r\n if t(2 a, b, seq) != None or t(10 * a + 1, b, seq) != None:\r\n return seq\r\n \r\n seq.pop()\r\n\r\na, b = map(int, input().split())\r\n\r\ns = t(a, b, [])\r\n\r\nif s != None:\r\n print(\"YES\")\r\n print(len(s))\r\n print(\" \".join(str(x) for x in s))\r\nelse:\r\n print(\"NO\")", "def transform(a, b, passos):\n if(a>b):\n return\n elif (a == b):\n passos.append(a)\n print(\"YES\")\n print(len(passos))\n array = \"\"\n for i in passos:\n array += str(i) + \" \"\n print(array.strip())\n return\n else:\n passos.append(a)\n transform(2a,b, passos)\n transform((10a) + 1,b, passos)\n passos.remove(a)\n if(len(passos) == 0):\n print(\"NO\")\n return\n \n\nab = list(map(int,input().strip().split()))[:2]\na = ab[0]\nb = ab[1]\npassos = []\ntransform(a,b,passos)\n\t \t\t \t \t\t\t \t \t\t \t\t\t\t \t \t\t \t", "def solve():\n i, n = map(int, input().split())\n check = False\n \n def backtrack(p, i):\n nonlocal check\n if i == n:\n check = True\n print(\"YES\")\n print(len(p))\n print(p)\n return\n if i < n:\n backtrack(p + [2i], 2i)\n backtrack(p + [10i+1], 10i+1)\n\n backtrack([i], i)\n if not check:\n print(\"NO\")\n\nsolve()\n\n\t \t \t \t \t\t \t\t \t \t \t", "\r\na,b=map(int,input().split())\r\nresult=[b]\r\n \r\nwhile a<b:\r\n\tif b%10==1:\r\n\t\tb=b//10\r\n\telif b%2==0:\r\n\t\tb=b//2\r\n\telse:\r\n\t\tbreak\r\n\tresult.append(b)\r\n \r\nresult.reverse()\r\nif(a ==b):\r\n print(\"YES\")\r\n print(len(result))\r\n print(result)\r\nelse:\r\n print(\"NO\")", "n,m=map(int, input().split())\r\na=[m]\r\nwhile m>n:\r\n if m%10==1:m//=10\r\n elif m%2==0:m//=2\r\n else:break\r\n a.append(m)\r\nif m==n:\r\n a.reverse()\r\n print('YES')\r\n print(len(a))\r\n print(a)\r\nelse:print('NO')", "a, b = map(int, input().split())\nv = []\nok = 1\nwhile b > a:\n v.append(b)\n if b & 1 == 0:\n b //= 2\n elif b % 10 == 1:\n b //= 10\n else:\n ok = 0\n break\nif b != a:\n ok = 0\nelse:\n v.append(a)\nif not ok:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(len(v))\n print(v[::-1])\n\t\t \t \t \t \t \t\t \t\t \t\t\t\t \t\t \t", "a,b=map(int, input().split())\r\nlst=[b]\r\nwhile b>a:\r\n if b%10==1:\r\n b//=10\r\n elif b%2!=0:\r\n break\r\n else:\r\n b//=2\r\n lst.append(b)\r\nlst.reverse()\r\nprint('YES'+'\\n'+str(len(lst))+'\\n'+' '.join(map(str, lst)) if a==b else 'NO')", "import sys\nsys.setrecursionlimit(100000)\n\ndone = False\n\ndef rc(a, b, l):\n\tif a > b:\n\t\treturn\n\tif a == b:\n\t\tglobal done\n\t\tdone = l+[a]\n\tif not done:\n\t\trc(a10+1, b, l+[a])\n\t\trc(a2, b, l+[a])\n\na, b = map(int,input().split())\nrc(a, b, [])\nif done:\n\tprint('YES',len(done),sep='\\n')\n\tprint(done)\nelse:\n\tprint('NO')\n", "def f(t):\r\n u = t[0]\r\n if u == a:\r\n print(\"YES\", len(t), sep='\\n')\r\n print(t)\r\n raise TabError\r\n if u > a:\r\n if u % 10 == 1:\r\n f((u // 10, t))\r\n if not u % 2:\r\n f((u // 2, t))\r\n \r\na, b = map(int, input().split())\r\ntry:\r\n f((b,))\r\nexcept:\r\n pass\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\r\n\r\nflag = True\r\n\r\nlistt = []\r\n\r\nwhile a < b and flag:\r\n \r\n if b % 2 == 0:\r\n b //= 2\r\n listt.append(True)\r\n elif b % 10 == 1:\r\n b = (b - 1)//10\r\n listt.append(False)\r\n else:\r\n flag = False\r\n break\r\n\r\nif a != b:\r\n flag = False\r\n\r\nlistt.reverse()\r\n\r\nif flag:\r\n print(\"YES\")\r\n print(len(listt) + 1)\r\n print(a, end=\" \")\r\n for i in listt:\r\n if i:\r\n a = 2\r\n else:\r\n a = a10 + 1\r\n print(a, end=\" \")\r\n\r\nelse:\r\n print(\"NO\")", "from collections import deque\r\n\r\ndef main():\r\n a, b = map(int, input().split())\r\n\r\n q = deque()\r\n q.append((a, [a]))\r\n\r\n while q:\r\n now, root = q.popleft()\r\n\r\n if now == b:\r\n print(\"YES\")\r\n print(len(root))\r\n print(root)\r\n return 0\r\n\r\n if now 2 <= b:\r\n r = root[:]\r\n r.append(now * 2)\r\n q.append((now * 2, r))\r\n if now * 10 + 1 <= b:\r\n r = root[:]\r\n r.append(now * 10 + 1)\r\n q.append((now * 10 + 1, r))\r\n\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\nmain()", "num_inicial, num_alvo = map(int, input().split())\nlista = [num_alvo]\nresultado_encontrado = False\n\nwhile num_inicial <= num_alvo:\n\n if num_alvo == num_inicial:\n print(\"YES\")\n print(len(lista))\n print(reversed(lista))\n resultado_encontrado = True\n break\n\n elif num_alvo % 2 == 0:\n num_alvo = num_alvo // 2\n lista.append(num_alvo)\n\n elif num_alvo % 10 == 1:\n num_alvo = (num_alvo - 1) // 10\n lista.append(num_alvo)\n \n else:\n break\n\nif not resultado_encontrado:\n print(\"NO\")\n \t\t\t\t \t \t\t\t \t\t\t \t\t\t\t\t\t \t\t\t", "def a_to_b(a, b, sequence=[]):\n _list = sequence[:]\n if (a == b):\n _list.append(a)\n return _list\n elif (a > b):\n return False\n else:\n _list.append(a)\n return a_to_b(2a, b, _list) or a_to_b(10a + 1, b, _list)\n\na, b = map(int, input().split())\nresult = a_to_b(a, b)\nif result == False: print(\"NO\")\nelse:\n print(\"YES\")\n print(len(result))\n response = ' '.join(str(i) for i in result)\n print(response)\n \t \t \t\t\t \t\t \t\t \t\t \t \t\t", "a, b = map(int, input().split())\r\n\r\n\r\ndef backTrack(i, path):\r\n # print(i, b)\r\n if i > b:\r\n return False\r\n elif i == b:\r\n print(\"YES\")\r\n print(len(path))\r\n print(path)\r\n return True\r\n else:\r\n left = backTrack(2i, path + [2i])\r\n right = backTrack(10i + 1, path + [10i + 1])\r\n\r\n return left or right\r\n\r\n\r\nif not backTrack(a, [a]):\r\n print(\"NO\")\r\n", "def transform_number(a, b):\n if a == b:\n return [a]\n \n if a > b:\n return []\n \n multiply_result = transform_number(a * 2, b)\n if multiply_result:\n return [a] + multiply_result\n \n append_result = transform_number(a * 10 + 1, b)\n if append_result:\n return [a] + append_result\n \n return []\n\na, b = map(int, input().split())\nresult = transform_number(a, b)\n\nif result:\n print(\"YES\")\n print(len(result))\n print(result)\nelse:\n print(\"NO\") \n\n\t\t \t\t \t \t \t\t\t\t\t \t \t \t\t \t \t", "n, m = map(int, input().split())\n\nsteps = [m]\n\nwhile m > n:\n if m % 2 == 0:\n m //= 2\n elif m % 10 == 1:\n m //= 10\n else:\n break\n steps.append(m)\n\nif m != n:\n print(\"NO\")\nelse:\n print(\"YES\")\n steps.reverse()\n print(len(steps))\n print(steps)\n \t\t\t \t \t \t\t\t \t \t\t \t \t\t\t \t", "a,target=list(map(int,input().split()))\r\ndef isReachable(a,target,i):\r\n if(a>target):\r\n return \"NO\"\r\n if(a==target):\r\n print(\"YES\")\r\n print(i+1)\r\n print(target,end=\" \")\r\n return \"YES\"\r\n if(target%2==0 and isReachable(a,target//2,i+1)==\"YES\"):\r\n print(target,end=\" \")\r\n return \"YES\"\r\n if(target%10==1 and (target-1)%10==0 and isReachable(a,target//10,i+1)==\"YES\"):\r\n print(target,end=\" \")\r\n return \"YES\"\r\n return \"NO\"\r\nans=isReachable(a,target,0)\r\nif(ans==\"NO\"):\r\n print(\"NO\")\r\nelse:\r\n print()\r\n", "a,b=map(int,input().split())\r\nl=[b]\r\nflag=\"NO\"\r\nwhile a<b:\r\n\tif b%2==0:\r\n\t\tb=b//2\r\n\telse:\r\n\t\tt=str(b)\r\n\t\tif t[-1]=='1':\r\n\t\t\tt=t[:-1]\r\n\t\t\tb=int(t)\r\n\t\telse:\r\n\t\t\tbreak\r\n\tl.append(b)\r\n\tif a==b:\r\n\t\tflag=\"YES\"\r\n\t\tbreak\r\n\t# print(b)\r\nprint(flag)\r\nif len(l)==1 and l[-1]==a:\r\n\tprint(2)\r\n\tprint(a,a)\r\nelif l[-1]==a:\r\n\tprint(len(l))\r\n\tl.reverse()\r\n\tprint(l)\r\n", "aa,bb=input().split()\r\na=int(aa)\r\nb=int(bb)\r\nv=[]\r\nv.append(b)\r\nwhile b>a:\r\n if b%2==0:\r\n b=b//2\r\n v.append(b)\r\n else:\r\n r=b%10\r\n if r!=1:\r\n break\r\n b=b//10\r\n v.append(b)\r\n if b==a:\r\n break\r\nv.sort()\r\nif b==a:\r\n print(\"YES\",end='\\n')\r\n print(len(v))\r\n for i in v:\r\n print(i,end=' ')\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "a, b = map(int, input().split())\r\nans = []\r\nflag = True\r\nwhile b > a and flag:\r\n if (b - 1) % 10 == 0:\r\n ans.append(str(b))\r\n b = (b - 1) // 10\r\n elif b % 2 == 0:\r\n ans.append(str(b))\r\n b //= 2\r\n else:\r\n flag = False\r\n\r\nif b < a:\r\n flag = False\r\nif flag:\r\n ans += [str(a)]\r\n print('YES')\r\n print(len(ans))\r\n print(' '.join(reversed(ans)))\r\nelse:\r\n print('NO')", "a, b = map(int, input().split())\r\n\r\ndef transform(a, path):\r\n if a > b:\r\n return False\r\n \r\n elif a == b:\r\n print('YES')\r\n print(len(path))\r\n print(path)\r\n return True\r\n \r\n return transform(a2, path + [a 2]) or transform(a10 + 1, path + [a10 + 1])\r\n\r\nif not transform(a, [a]):\r\n print('NO')\r\n ", "from sys import stdin, stdout\na, b = map(int,stdin.readline().split())\nq = [ [a,[a]] ]\nans = []\nwhile len(q):\n f = q.pop(0)\n cur,l = f[0],f[1]\n if cur == b:\n ans = l\n break\n n1,n2 = 2cur, int(str(cur)+'1')\n if n1<=b:\n q.append([ n1,l+[n1] ])\n if n2<=b:\n q.append( [n2,l+[n2]] )\nif len(ans):\n stdout.write(\"YES\\n\")\n stdout.write(\"{}\\n\".format(len(ans)))\n for x in ans:\n stdout.write(\"{} \".format(x))\n stdout.write(\"\\n\")\nelse:\n stdout.write(\"NO\\n\")", "a, b = [int(x) for x in input().split()]\r\n\r\nlista = []\r\naux = b\r\nresp = 'NO'\r\nwhile aux > a:\r\n\tlista.append(str(int(aux)))\r\n\t\r\n\tif aux % 2 == 0:\r\n\t\taux /= 2\r\n\telse:\r\n\t\taux -= 1\r\n\t\tif aux % 10 == 0:\r\n\t\t\taux /= 10\r\n\t\telse:\r\n\t\t\tbreak\r\n\t\r\n\tif aux == a:\r\n\t\tresp = 'YES'\r\n\t\tlista.append(str(int(aux)))\r\n\t\t\r\n\t\t\r\nif resp == 'YES':\r\n\tprint(resp)\r\n\tprint(len(lista))\r\n\tlista.reverse()\r\n\tprint(\" \".join(lista))\r\n\r\nelse:\r\n\tprint(resp)\r\n\t\r\n\t\t\r\n", "a, b = list(map(int, input().split(' ')))\n\nnumbers = []\npossible = 1\n\nwhile b > a:\n numbers.append(b)\n if b % 2 == 0:\n b = b/2\n elif b % 10 == 1:\n b = b // 10\n else: \n possible = 0\n break\n\nif b != a:\n print('NO')\nelse:\n numbers.append(b)\n print('YES')\n k = len(numbers)\n print(k)\n for i in range(k-1, -1, -1):\n print(int(numbers[i]), end=' ')\n \t\t \t\t\t\t\t \t\t\t\t\t\t\t\t \t\t \t \t", "a,b=map(int,input().split())\r\nl=[b]\r\nwhile a<b:\r\n if b%2:\r\n b-=1\r\n if b%10==0:b//=10\r\n else:exit(print(\"NO\"))\r\n else:b//=2\r\n l+=[b]\r\nif b<a:print(\"NO\")\r\nelse:print(\"YES\\n\",len(l),\"\\n\",l[::-1])", "from collections import \r\nimport heapq as hq\r\n\r\na,b = [int(x) for x in input().split()]\r\n\r\nh = Counter()\r\nl = [] \r\nhq.heapify(l)\r\n\r\nele = a\r\nh[a] = 0\r\nwhile ele < b:\r\n ele1 = 2ele\r\n ele2 = 10ele+1\r\n hq.heappush(l,ele1)\r\n hq.heappush(l,ele2)\r\n h[ele1] = ele\r\n h[ele2] = ele\r\n ele = hq.heappop(l)\r\nif ele == b:\r\n q = deque()\r\n print(\"YES\")\r\n count = 0 \r\n while ele in h:\r\n count+=1\r\n q.append(ele)\r\n ele = h[ele]\r\n print(count)\r\n while q:\r\n print(q.pop(),end = \" \")\r\nelse:\r\n print(\"NO\")", "entrada1,entrada2=map(int, input().split())\nlista=[]\nlista.append(entrada2)\nwhile entrada2 > entrada1:\n if (entrada2 % 10==1):\n entrada2 //= 10\n elif (entrada2 % 2==0):\n entrada2 //= 2\n else:\n break\n lista.append(entrada2)\nif entrada2 != entrada1:\n print('NO')\nelse:\n lista.reverse()\n print('YES')\n print(len(lista))\n print(lista)\n \t\t \t \t\t \t \t\t\t\t\t \t \t \t \t\t", "def min(st,val,targ):\r\n if val==targ:\r\n st.append(val)\r\n return True\r\n if val>targ:\r\n return False\r\n if min(st,val2,targ) or min(st,val10+1,targ):\r\n st.append(val)\r\n return True\r\n return False\r\nst=[]\r\nval,targ=[int(a) for a in input().split()]\r\nif min(st,val,targ):\r\n print(\"YES\")\r\n print(len(st))\r\n print(st[::-1])\r\nelse:\r\n print(\"NO\")", "a, b = list(map(int, input().split()))\r\n\r\nstack = [a]\r\nreached = False\r\ndef dfs(a, b, stack):\r\n global reached\r\n if a >= b:\r\n if a == b:\r\n reached = True\r\n print(\"YES\")\r\n print(len(stack))\r\n print(stack)\r\n return\r\n else:\r\n dfs(a2, b, stack+[a2])\r\n dfs(a10 + 1, b, stack+[a10 + 1])\r\n \r\n \r\ndfs(a, b, stack)\r\nif not reached:\r\n print(\"NO\")", "a, b = map(int, input().split())\r\nx = [b]\r\nj = b\r\np = True\r\nwhile a not in x and j >= a:\r\n if j % 2 == 0:\r\n j = int(j/2)\r\n x.append(j)\r\n elif (j - 1) % 10 == 0:\r\n j = int((j-1)/10)\r\n x.append(j)\r\n else:\r\n print(\"NO\")\r\n p = False\r\n break\r\nif a in x and b in x:\r\n print(\"YES\")\r\n print(len(x))\r\n x = sorted(x)\r\n for i in x:\r\n print(i, end=\" \")\r\nelif p:\r\n print(\"NO\")\r\n\r\n \r\n", "'''2 162\r\n 2\r\n 8 21 \r\n 16 81 \r\n 32 161 \r\n 64 xx xx\r\n 128 xx\r\n xx xx\r\n'''\r\n\r\n\r\nans = []\r\nflag = 1\r\n\r\ndef dfs(i):\r\n global flag, m, n, ans \r\n \r\n if flag == 0:\r\n return\r\n \r\n if i == m:\r\n flag = 0\r\n print(\"YES\")\r\n print(len(ans) + 1, end = '\\n')\r\n print(n , end = ' ')\r\n for j in range(len(ans)):\r\n print(ans[j], end = ' ')\r\n return\r\n\r\n if i > m:\r\n return\r\n\r\n ans.append(i * 2)\r\n dfs(i * 2)\r\n ans.pop()\r\n \r\n ans.append(i * 10 + 1)\r\n dfs(i * 10 + 1)\r\n ans.pop()\r\n\r\nn, m = map(int, input().split())\r\ndfs(n)\r\nif flag == 1:\r\n print('NO')", "def trans(a,b):\r\n l = [b]\r\n while True:\r\n if l[-1]==a:\r\n l.reverse()\r\n return l\r\n if l[-1]<a:\r\n return [] #means NO\r\n if l[-1]%10 == 1:\r\n l.append(l[-1]//10)\r\n continue\r\n if l[-1]%2 == 0:\r\n l.append(l[-1]//2)\r\n continue\r\n return [] #means NO\r\n\r\na,b = list(map(int,input().split()))\r\nr = trans(a,b)\r\nif len(r)>0:\r\n print('YES')\r\n print(len(r))\r\n print(r)\r\nelse:\r\n print('NO')\r\n", "a,b = [int(x) for x in input().split()]\r\ndef solve(i,prev):\r\n if i>b:\r\n return False\r\n elif i<b:\r\n return solve(2i,prev + [2i]) or solve(10i + 1,prev + [10i+1])\r\n \r\n elif i==b:\r\n print(\"YES\")\r\n print(len(prev))\r\n print(prev)\r\n return True\r\n\r\n \r\n \r\n \r\nif not (solve(a,[a])):\r\n print(\"NO\")", "from collections import deque\n\na, b = map(int, input().split())\n\nfila = deque([a])\npai = {}\n\nwhile len(fila) > 0:\n atual = fila.popleft()\n dois = 2atual\n dez = 10atual+1\n\n if dois not in pai and dois <= b:\n pai[dois] = atual\n fila.append(dois)\n if dez not in pai and dez <= b:\n pai[dez] = atual\n fila.append(dez)\n\nout = [b]\nif b not in pai:\n print('NO')\nelse:\n print('YES')\n elem = b\n while elem != a:\n elem = pai[elem]\n out.append(elem)\n\n print(len(out))\n string = ''\n for i in range(len(out)-1,-1,-1):\n if i == len(out)-1:\n string += str(out[i])\n else:\n string += ' ' + str(out[i])\n print(string)\n \t \t \t \t \t \t \t\t \t \t\t\t \t", "from collections import deque\n\nseqa = list(map(int, input().split()))\na = seqa[0]\nb = seqa[1]\npre = {}\nfila = deque([a])\nwhile fila:\n v = fila.popleft()\n if 2 v not in pre and 2v <= b:\n fila.append(2v)\n pre[2v] = v\n if 10 v +1 not in pre and 1+10v <= b:\n fila.append(10v+1)\n pre[10v+1] = v\nseq =[b]\nif b not in pre:\n print(\"NO\")\nelse:\n print(\"YES\")\n x = b\n while x!=a:\n x = pre[x]\n seq.append(x)\n print(len(seq))\n fim = []\n for i in seq[::-1]:\n fim.append(i)\n print(fim)\n\n\n\t \t \t \t \t\t \t\t\t\t\t \t \t\t \t \t\t\t\t", "a,b=tuple(map(int, input().split()))\n\ndef ans(solvable,path):\n if solvable:\n print(f\"YES\\n{len(path)}\")\n print(path[0], end=\"\")\n for i in range(1,len(path)): \n print(f\" {path[i]}\", end=\"\")\n print()\n\ndef rec(a,b,path):\n if a==b: \n ans(True, path)\n return True\n elif a>b: return False\n else:\n return rec(a<<1,b,path[:]+[2a]) or \\\n rec(a10+1,b,path[:]+[10a+1])\n\nif not rec(a,b,[a]): print(\"NO\")\n\n\t \t \t \t\t\t \t\t \t \t\t \t\t", "a, b = map(int, input().split())\r\n\r\nres = [b]\r\nf = True\r\nwhile b > a:\r\n if b & 1:\r\n b -= 1\r\n if b % 10 != 0:\r\n f = False\r\n break\r\n b //= 10\r\n else:\r\n b //= 2\r\n res.append(b)\r\n\r\nif not f or res[-1] != a:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(res))\r\n print(res[::-1])\r\n\r\n\r\n\r\n\r\n\r\n", "def solucao(arr, target):\r\n global done\r\n if (arr == [] or done or arr[-1] > target):\r\n return\r\n if (arr[-1] == target):\r\n done = True\r\n return\r\n\r\n n = arr[-1]\r\n \r\n arr.append(2 n)\r\n solucao(arr, target)\r\n if (done):\r\n return\r\n else:\r\n arr.pop(-1)\r\n \r\n arr.append(10 * n + 1)\r\n solucao(arr, target)\r\n if (done):\r\n return\r\n else:\r\n arr.pop(-1)\r\n \r\n return\r\n\r\nipt = input().split(\" \")\r\na, b = int(ipt[0]), int(ipt[1])\r\ndone = False\r\narr = [a]\r\nsolucao(arr, b)\r\n\r\nif done:\r\n print(\"YES\")\r\n print(len(arr))\r\n for e in arr:\r\n print(e, end=\" \")\r\n print()\r\nelse:\r\n print(\"NO\")", "a, b = input().split()\na = int(a)\nb = int(b)\narr = [b]\n\nwhile(b > 0):\n if b % 2 == 0:\n b //= 2\n arr.append(b)\n\n elif ((b - 1) % 10) == 0:\n b -= 1\n b //= 10\n arr.append(b)\n \n else:\n break\n \n if b == a:\n break\n\n\nif arr[len(arr) - 1] != a:\n print('NO')\n\nelse:\n print('YES')\n print(len(arr))\n\n for i in range(len(arr) - 1, -1, -1):\n print(arr[i], end=\" \")\n print()\n \t \t \t \t\t \t \t \t \t \t \t\t", "import sys, math\n\n\ndef is_possible(num1, num2):\n if num1 > num2:\n return False\n elif num1 == num2:\n return True\n else:\n if is_possible(num1 * 2, num2):\n arr.append(num1 * 2)\n return True\n elif is_possible(num1 * 10 + 1, num2):\n arr.append(num1 * 10 + 1)\n return True\n return False\n\n\na, b = list(map(int, sys.stdin.readline().rstrip().split()))\narr = []\nif is_possible(a, b):\n print(\"YES\")\n print(len(arr) + 1)\n arr.reverse()\n print(f\"{a} \" + \" \".join([str(i) for i in arr]))\nelse:\n print(\"NO\")\n", "a,b=map(int,input().split())\r\ndef rec(curr,tar,res):\r\n if(curr>tar):\r\n return False\r\n if(curr==tar):\r\n return True\r\n else:\r\n res.append(curr2)\r\n bool=rec(curr2,tar,res)\r\n if(not bool):\r\n res.pop(len(res)-1)\r\n res.append(curr10+1)\r\n bool2=rec(curr10+1,tar,res)\r\n if(not bool2):\r\n res.pop(len(res)-1)\r\n return bool2\r\n else:\r\n return True\r\nres=[a]\r\nb=rec(a,b,res)\r\nif(b):\r\n print(\"YES\")\r\n print(len(res))\r\n for i in res:\r\n print(i,end=\" \")\r\nelse:\r\n print(\"NO\")", "def generateTracking(start, end, i, seq):\n if (start == end):\n return seq\n if (start > end):\n return []\n else:\n double = start2\n digit = start10 + 1\n return generateTracking(double, end, i+1, [seq, double]) or generateTracking(digit, end, i+1, [seq, digit])\n\na, b = list(map(int, input().split()))\nsequence = generateTracking(a, b, 1, [a])\n\nif (len(sequence) == 0):\n print('NO')\nelse:\n print('YES')\n print(len(sequence))\n print(sequence, sep = \" \")", "a, b = map(int, input().split())\r\nans = [b]\r\nwhile (b % 10 == 1 or b % 2 == 0) and b > 0 and b > a:\r\n if b % 2 == 0:\r\n b //= 2\r\n ans.append(b)\r\n elif b % 10 == 1 and b != 1:\r\n b = int(str(b)[:-1])\r\n ans.append(b)\r\n elif b == 1:\r\n ans.append(1)\r\n break\r\n \r\nif a == b:\r\n print('YES')\r\n print(len(ans))\r\n print((reversed(ans)))\r\nelse:\r\n print('NO')", "i,n=map(int,input().split())\r\n\r\ncheck =False\r\ndef solve(i,n,p):\r\n global check\r\n if i==n:\r\n check=True\r\n print(\"YES\")\r\n print(len(p))\r\n print(p)\r\n return\r\n if(i<n):\r\n solve(2i,n,p+[2i])\r\n solve(10i+1,n,p+[10i+1])\r\n \r\nsolve(i,n,[i])\r\nif not check:\r\n print(\"NO\")", "enter = input().split()\na = int(enter[0])\nb = int(enter[1])\n\noutput = \"%i\" % a\nnumber = 1\nfound = []\nfinal_out = []\nfinal_number = [] \n\ndef transformation(a, b, found, output, number, final_out, final_number):\n if (a < b):\n for i in [0, 1]:\n if (i == 0):\n transformation(a2, b, found, (output+\" %i\" % (a2)), number + 1, final_out, final_number) \n else:\n transformation(a10+1, b, found, (output+\" %i\" % (a10+1)), number + 1, final_out, final_number)\n else:\n if(a == b):\n found.append(1)\n final_out.append(output)\n final_number.append(number)\n\n\n\ntransformation(a, b, found, output, number, final_out, final_number)\n\nif (1 in found):\n print(\"YES\")\n print(final_number[0])\n print(final_out[0])\n\nelse:\n print(\"NO\")\n\t \t\t\t\t \t \t \t\t \t", "from collections import deque\n\na, b = list(map(int, input().split()))\nres = {}\nqueue = deque([a])\n\nwhile queue:\n x = queue.popleft()\n if 2 x not in res and 2 * x <= b:\n queue.append(2 * x)\n res[2 * x] = x\n if 10 * x + 1 not in res and 10 * x + 1 <= b:\n queue.append(10 * x + 1)\n res[10 * x + 1] = x\n sequence = [b]\nif b not in res:\n print(\"NO\")\nelse:\n print(\"YES\")\n z = b\n while z != a:\n z = res[z]\n sequence.append(z)\n\n print(len(sequence))\n\n ans = \"\"\n for j in range(len(sequence) - 1, -1, -1):\n if j != 0:\n ans += str(sequence[j]) + \" \"\n else:\n ans += str(sequence[j])\n\n print(ans)\n\t \t \t \t\t\t\t \t\t\t\t\t\t \t\t \t \t \t", "from collections import deque\r\nimport sys\r\nsys.setrecursionlimit(5000)\r\n\r\n# ~ class Graph(object):\r\n # ~ def __init__(self, vertices, adj):\r\n # ~ self.vertices = vertices#[v for v in range(1, vertices+1)]\r\n # ~ self.dist = self.init_dist(vertices)\r\n # ~ self.adj = adj\r\n \r\n # ~ def init_dist(self, v):\r\n # ~ d = {}\r\n # ~ for i in range(1, v+1):\r\n # ~ d[i] = 0\r\n # ~ return d\r\n \r\n \r\n # ~ def iter_vertices(self):\r\n # ~ for v in range(1,self.vertices+1):\r\n # ~ yield v\r\n \r\n # ~ def adj_list(self, v):\r\n # ~ return self.adj[v]\r\n\r\n\t\t\r\nclass dfs_result:\r\n def __init__(self):\r\n self.parent = {}\r\n self.finish_time = {}\r\n self.start_time = {}\r\n self.edges = {}\r\n self.order = []\r\n self.t = 0\r\n self.found = False\r\n\r\n \r\n \r\n \r\n# ~ def dfs(g):\r\n # ~ result = dfs_result()\r\n # ~ for vertex in g.iter_vertices():\r\n # ~ if vertex not in result.parent:\r\n # ~ dfs_visit(g, vertex, result )\r\n # ~ return result\r\n \r\ndef adj_list(v):\r\n l = []\r\n l.append(v10+1)\r\n l.append(2v)\r\n return l\r\n\t\t\t\r\ndef dfs_visit(v, result, dest, parent = None):\r\n result.parent[v] = parent\r\n result.t += 1\r\n result.start_time[v] = result.t\r\n if v == dest:\r\n result.found = True\r\n if parent:\r\n result.edges[(parent, v)] = 'tree'\r\n if result.found or v>dest:\r\n return \r\n else:\r\n for n in adj_list(v):\r\n if n not in result.parent:\r\n dfs_visit(n, result, dest, v)\r\n elif (n not in result.finish_time):\r\n if (n,v) not in result.edges:\r\n result.edges[(v, n)] = 'back'\r\n result.loop = [v, n]\r\n elif result.start_time[v] < result.finish_time[n]:\r\n result.edges[(v, n)] = 'forward'\r\n else:\r\n result.edges[(v, n)] = 'cross'\r\n result.t += 1\r\n result.finish_time[v] = result.t\r\n result.order.append(v)\r\n \r\n# ~ class BFSResult:\r\n # ~ def __init__(self):\r\n # ~ self.level = {}\r\n # ~ self.parent = {}\r\n \r\n# ~ def bfs(g, r, loop_dict, s):\r\n # ~ r.parent = {s:None}\r\n # ~ r.level = {s:0}\t\r\n\r\n # ~ queue = deque()\r\n # ~ queue.append(s)\r\n # ~ while queue:\r\n # ~ u = queue.popleft()\r\n # ~ for n in g.adj_list(u):\r\n # ~ if (n not in r.level) and n not in loop_dict:\r\n # ~ r.parent[n] = u\r\n # ~ r.level[n] = r.level[u] + 1\r\n # ~ g.dist[n] = r.level[n]\r\n # ~ queue.append(n)\r\n \r\nif __name__ == '__main__':\r\n s, d = list(map(int, input().rstrip().split()))\r\n r = dfs_result()\r\n dfs_visit(s, r, d)\r\n # ~ print(r.parent)\r\n ans = []\r\n if r.found:\r\n print('YES')\r\n ans.append(d)\r\n while r.parent[d]!=s:\r\n ans.append(r.parent[d])\r\n d = r.parent[d]\r\n ans.append(s)\r\n print(len(ans))\r\n for i in range(len(ans)-1, -1, -1):\r\n print(ans[i], end = ' ')\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", "a,b = list(map(int,input().strip().split()))\r\nlst = []\r\ncnt = [0]\r\n\r\ndef transform(a,b,cnt,lst):\r\n if a==b:\r\n cnt[0]+=1\r\n lst.append(a)\r\n return True\r\n if a>b:\r\n return False\r\n if transform(2a,b,cnt,lst) :\r\n cnt[0]+=1\r\n lst.append(a)\r\n return True\r\n if transform((10a)+1,b,cnt,lst):\r\n cnt[0]+=1\r\n lst.append(a)\r\n return True\r\n \r\nif transform(a,b,cnt,lst):\r\n print(\"YES\")\r\n print(cnt[0])\r\n lst.reverse()\r\n print(str(lst).replace('[','').replace(']','').replace(',',' '))\r\nelse:\r\n print(\"NO\")\r\n", "def find(a, b):\r\n if a == b:\r\n return [-1]\r\n \r\n if a > b: \r\n return []\r\n\r\n option_a = [int(str(a)+\"1\")] + find(int(str(a)+\"1\"), b)\r\n option_b = [a2] + find(a2, b)\r\n \r\n if len(option_a) == 1 and len(option_b) == 1: return []\r\n elif len(option_a) == 1 and len(option_b) != 1: return option_b\r\n elif len(option_a) != 1 and len(option_b) == 1: return option_a\r\n else: return option_a\r\n\r\n\r\na, b = list(map(int, input().split()))\r\n\r\nresp = find(a, b)\r\nif len(resp): \r\n print(\"YES\")\r\n print(len(resp))\r\n print(a, end=\" \")\r\n for i in resp[:-1]: print(i, end=\" \")\r\n \r\nelse: print(\"NO\")", "# To convert number A into B\n#with given operations: 1. multiply the current number by 2 (that is, replace the number x by 2·x).......\n#2. append the digit 1 to the right of current number (that is, replace the number x by 10·x + 1).\na, b = map(int,input().split())\nlst = []\ncounter = 0\n\ndef recrusion(a, b, counter):\n lst.append(a)\n\n if a > b:\n return -1\n\n if a == b:\n print(\"YES\")\n print(counter)\n print(lst)\n lst[0] = b\n return 0\n else:\n counter = counter + 1\n # multiply with 2\n temp = a2\n recrusion(temp,b, counter)\n lst.pop()\n # append 1\n temp = a10 + 1\n recrusion(temp, b, counter)\n lst.pop()\n\n\nrecrusion(a, b, 1)\nif lst[-1] != b:\n print(\"NO\")\n", "from collections import deque\n\na, b = map(int, input().split())\nvisited = set()\nparent = {}\nqueue = deque()\nqueue.append(a)\nvisited.add(a)\n\nwhile queue:\n current = queue.popleft()\n \n if current == b:\n break\n\n double = current 2\n if double <= b and double not in visited:\n visited.add(double)\n parent[double] = current\n queue.append(double)\n\n append_one = current * 10 + 1\n if append_one <= b and append_one not in visited:\n visited.add(append_one)\n parent[append_one] = current\n queue.append(append_one)\n\nif b not in visited:\n print(\"NO\")\nelse:\n path = [b]\n while b != a:\n b = parent[b]\n path.append(b)\n \n path.reverse()\n \n print(\"YES\")\n print(len(path))\n print(path)\n\n\t\t\t\t\t \t\t\t\t\t\t \t\t\t\t \t\t \t\t\t", "a, b = map(int, input().split())\r\nout = [b]\r\n \r\nwhile a < b:\r\n\tif b % 10 == 1:\r\n\t\tb = b // 10\r\n\telif b % 2 == 0:\r\n\t\tb = b // 2\r\n\telse:\r\n\t\tbreak\r\n\tout.append(b)\r\n \r\nout.reverse()\r\n\r\nif a == b:\r\n print(\"YES\")\r\n print(len(out))\r\n print(out)\r\nelse:\r\n print(\"NO\")\r\n", "a,b=map(int,input().split())\r\nS=[]\r\nk=0\r\nZ=''\r\nwhile b>a :\r\n S.append(str('%.0f'%(b)))\r\n if b%2==0 :\r\n b=b//2\r\n else :\r\n b=(b-1)/10\r\n k=k+1\r\nS.append(str('%.0f'%(b)))\r\nfor i in range(k+1) :\r\n Z=S[i]+' '+Z\r\nif a==b :\r\n print('YES')\r\n print(k+1)\r\n print(Z)\r\nelse :\r\n print('NO')", "a,b = map(int,input().split())\r\ndef recur(a,b,tmp,f):\r\n if f[0]:\r\n return \r\n if a==b:\r\n print(\"YES\")\r\n print(len(tmp))\r\n print(\" \".join([str(i) for i in tmp]))\r\n f[0]=1\r\n return\r\n \r\n elif a>b:\r\n return\r\n \r\n tmp.append(2a)\r\n recur(2a,b,tmp,f)\r\n tmp.pop()\r\n tmp.append(10a+1)\r\n recur(10a+1,b,tmp,f)\r\n tmp.pop()\r\ntmp = [a]\r\nf = [0]\r\nrecur(a,b,tmp,f)\r\nif not f[0]:\r\n print(\"NO\")", "i, n = map(int, input().split())\r\nflag = False\r\ndef solve(i, n, m):\r\n global flag\r\n if i == n:\r\n flag = True\r\n print(\"YES\")\r\n print(len(m))\r\n print(m)\r\n return\r\n if(i < n):\r\n solve(2i, n, m+ [2i])\r\n solve(10i + 1, n, m + [10i+1])\r\nsolve(i, n, [i])\r\nif not flag:\r\n print(\"NO\")", "from collections import deque #Importa \"fila\" do Python\n\na, b = input().split() #Lê na mesma linha A e B\na = int(a) #Converte A em INT\nb = int(b) #Converte B em INT\nant = {} #Cria um map que guarda o anterior\nfila = deque([a]) #\"fila\" é uma fila que já começa com A\n\nwhile fila: #Enquanto tiver coisa na fila\n v = fila.popleft() #V recebe o primeiro valor e já retira da fila\n if(2v not in ant and 2v <=b): #Se 2v não está no map e 2v é menor que B\n fila.append(2v) #Adicione ao final da fila \n ant[2v]=v #Anterior na posição [2v] = v\n\n if(10v+1 not in ant and 10v+1 <=b):\n fila.append(10v+1)\n ant[10v+1] = v\n\nseq = [b] #Sequência recebe o valor final B\n\nif(b not in ant): #Se não tiver B no array de anterior\n print(\"NO\") #Printe \"não\"\n\nelse:\n print(\"YES\")\n x = b\n while x != a:\n x = ant[x]\n seq.append(x)\n print(len(seq))\n for i in range(len(seq)-1, -1, -1):\n print(seq[i], end=\" \")\n print()\n\t \t \t \t\t \t\t \t \t \t \t", "start, end = map(int, input().split())\ncurrent = end\nsequence = []\nwhile end > start:\n if end % 10 == 1:\n end = end // 10\n sequence.append(end)\n elif end % 2 == 0:\n end = end // 2\n sequence.append(end)\n else:\n break\n\nif start == end:\n print(\"YES\")\n sequence = sequence[::-1]\n sequence.append(current)\n print(len(sequence))\n print(sequence)\nelse:\n print(\"NO\")\n\n\t \t\t\t\t\t \t\t\t \t \t\t\t\t \t \t\t\t\t\t\t", "a, b = map(int, input().split())\r\n\r\ndef make_tree(a, b, tree):\r\n c1 = -1\r\n c2 = -1\r\n \r\n # tree.append('layer')\r\n if b % 2 == 0:\r\n c1 = b // 2\r\n tree.append(c1)\r\n elif (b - 1) % 10 == 0:\r\n c2 = (b - 1) // 10\r\n tree.append(c2)\r\n else:\r\n return []\r\n\r\n if c1 == a or c2 == a:\r\n return tree\r\n else:\r\n if c1:\r\n make_tree(a, c1, tree)\r\n if c2:\r\n make_tree(a, c2, tree)\r\n\r\ntree = [b]\r\nmake_tree(a, b, tree)\r\n\r\nif tree[-1] == a:\r\n print('YES')\r\n print(len(tree))\r\n print(' '.join(map(str, tree[::-1])))\r\nelse:\r\n print('NO')\r\n", "res = []\ndef f(atual, objetivo):\n global res\n if (atual <= objetivo) and (atual == objetivo or f(2atual, objetivo) or f(10atual + 1, objetivo)):\n res += [atual]\n return True\n return False\na, b = input().split()\na, b = int(a), int(b)\nif f(a, b):\n print(\"YES\")\n print(len(res))\n print(reversed(res), sep=\" \", end=\"\\n\")\nelse:\n print(\"NO\")\n \t\t\t \t \t \t\t \t\t \t\t \t\t \t", "a, b = map(int, input().split())\r\n\r\nv = [b]\r\nwhile b > a:\r\n if b % 2 == 0:\r\n b //= 2\r\n elif (b - 1) % 10 == 0:\r\n b = (b - 1) // 10\r\n else:\r\n break\r\n v.append(b)\r\n\r\nif v[-1] != a:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(v))\r\n print(reversed(v))\r\n", "a, b = list(map(int, input().split()))\r\ndef dfs(a, b, ans = []):\r\n if a == b:\r\n ans.append(a)\r\n return ans\r\n \r\n if a > b:\r\n return False\r\n \r\n ans.append(a)\r\n l = dfs(a 2, b, ans)\r\n if l:\r\n return l\r\n \r\n r = dfs(a * 10 + 1, b, ans)\r\n if r:\r\n return r\r\n ans.pop()\r\n return False\r\n\r\nans = dfs(a, b)\r\nif ans == False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(ans))\r\n print(ans)", "a,b=list(map(int,input().split(\" \")))\r\nl=[]\r\nl.append(b)\r\nans=False\r\nwhile b>0:\r\n if b%2==0: \r\n b=b//2\r\n l.append(b)\r\n elif (b-1)%10==0: \r\n b=b-1\r\n b=b//10\r\n l.append(b)\r\n else:\r\n break\r\n if a==b: \r\n ans=True\r\n break\r\nif ans==True:\r\n print(\"YES\")\r\n print(len(l))\r\n print(l[::-1])\r\nelse:\r\n print(\"NO\")", "inn, ni = map(int, input().split())\r\n\r\ncheck = False\r\ndef solve(inn, ni, pa):\r\n global check\r\n if inn == ni:\r\n check = True\r\n print(\"YES\")\r\n print(len(pa))\r\n print(pa)\r\n return\r\n if(inn < ni):\r\n solve(2inn, ni, pa + [2inn])\r\n solve(10inn + 1, ni, pa + [10inn+1])\r\n\r\n#backtracking\r\n\r\n\r\nsolve(inn, ni, [inn])\r\nif not check:\r\n print(\"NO\")", "a,b = map(int,input().split())\r\nc = 1\r\nk = 'YES'\r\narr = [b]\r\nwhile True:\r\n if str(b)[-1] == '1':\r\n b //= 10\r\n c+=1\r\n arr.append(b)\r\n elif b%2==0:\r\n b //= 2\r\n arr.append(b)\r\n c+=1\r\n else:\r\n k = 'NO'\r\n break\r\n if b==a:\r\n break\r\n if b<a:\r\n k = 'NO'\r\n break\r\nprint(k)\r\nif k=='YES':\r\n print(c)\r\n print(arr[::-1])", "from sys import stdin as fin\n# fin = open(\"tc1a.in\")\n \n# n = int(fin.readline())\na, b = map(int, fin.readline().split())\n# line = tuple(fin.readline().strip())\n# line = fin.readline()\n \nchain = []\nwhile a < b:\n chain.append(str(b))\n if b % 10 == 1:\n b //= 10\n elif b % 2 == 0:\n b //= 2\n else:\n break\nif a == b:\n print(\"YES\")\n print(len(chain) + 1)\n print(a, ' '.join(reversed(chain)))\nelse:\n print(\"NO\")", "global isprint\r\nisprint = False\r\ndef f(x, y, list):\r\n global isprint\r\n if isprint == True:\r\n return\r\n if x == y:\r\n print('YES')\r\n print(len(list))\r\n for i in list:\r\n print(i, end = ' ')\r\n isprint = True\r\n return\r\n if x > y:\r\n return\r\n list.append(x * 2)\r\n f(x * 2, y, list)\r\n list.pop()\r\n list.append(x * 10 + 1)\r\n f(x * 10 + 1, y, list)\r\n list.pop()\r\na, b = list(map(int, input().split(\" \")))\r\nf(a, b, [a])\r\nif isprint == False:\r\n print(\"NO\")", "start, end = input().split()\r\nstart = int(start)\r\nend = int(end)\r\ntab = []\r\ndef operation(num, tab):\r\n if num > end:\r\n return False\r\n if num == end:\r\n return True\r\n a = num2\r\n b = num10 + 1\r\n\r\n if operation(a, tab) or operation(b, tab):\r\n tab.append(num)\r\n return True\r\n else:\r\n return False\r\n\r\na = operation(start, tab)\r\nif a:\r\n print(\"YES\")\r\n tab.append(end)\r\n tab.sort()\r\n print(len(tab))\r\n for i in range(len(tab)):\r\n print(tab[i], end = \" \")\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\r\n\r\nans = [b]\r\n\r\nwhile a < b:\r\n if b % 10 == 1:\r\n b //= 10\r\n elif b % 2 == 0:\r\n b //= 2\r\n else:\r\n print(\"NO\")\r\n break\r\n ans.append(b)\r\nelse:\r\n if a > b:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n print(len(ans))\r\n print(' '.join(map(str, ans[::-1])))\r\n\r\n", "n1, n2=map(int,input().split())\nans=[n2]\nwhile n2>n1:\n d=n2%10\n if d==1:n2//=10\n elif d%2: break\n else: n2//=2\n ans+=[n2]\nans=ans[::-1]\nprint([f'YES\\n{len(ans)}\\n{\" \".join(map(str,ans))}','NO'][n1 != n2])\n\t\t \t\t\t\t\t \t \t \t \t \t \t\t \t \t", "cur,final = map(int,input().split())\r\nstatus = True\r\ndef solve(num,path):\r\n global status\r\n if num>final:\r\n return \r\n if num==final:\r\n print(\"YES\")\r\n status = False\r\n print(len(path))\r\n print(path)\r\n\r\n solve(2num,path+[2num])\r\n if status:\r\n solve(num10+1,path+[num10+1])\r\n\r\nsolve(cur,[cur])\r\nif status:\r\n print(\"NO\")", "inputs = [int(items) for items in input().split()]\r\ninital = inputs[0]\r\ntarget = inputs[1]\r\n\r\ndef find_results(result,initial,target,elements):\r\n if initial > target:\r\n return -1,None\r\n if initial == target:\r\n result.append(initial)\r\n return len(result),result\r\n result.append(initial)\r\n status, arr = find_results(result, 10 initial + 1, target,elements+1)\r\n if status !=-1:\r\n return status,arr\r\n result = result[:elements]\r\n status,arr=find_results(result,2initial,target,elements+1)\r\n return status,arr\r\n\r\nstatus,data=find_results([],inital,target,1)\r\nif status ==-1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(status)\r\n print(' '.join([str(elem) for elem in data]))", "a,b=map(int,input().split())\r\nflag=True\r\ncnt=1\r\nans=[b]\r\nwhile a<b:\r\n if b%2==0:\r\n b=b//2\r\n else:\r\n if str(b)[-1]=='1':\r\n b=int(str(b)[:-1])\r\n else:\r\n flag=False\r\n break\r\n cnt+=1\r\n ans.append(b)\r\nif flag==False or a>b:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(cnt)\r\n print(reversed(ans))", "from collections import deque\na, b = map(int, input().split(\" \"))\np = {}\nq = deque([a])\nwhile q:\n v = q.popleft()\n if 2v not in p and 2v <= b:\n q.append(2v)\n p[2v] = v\n if 10v+1 not in p and 10v+1 <= b:\n q.append(10v+1)\n p[10v+1] = v\n\ns = [b]\nif b not in p:\n print(\"NO\")\nelse:\n print(\"YES\")\n x = b\n while x != a:\n x = p[x]\n s.append(x)\n print(len(s))\n s.reverse()\n print(' '.join(map(str, s)))\n\n \t \t \t\t \t\t \t \t \t\t\t \t \t\t \t \t\t", "num_possuido, num_desejado = map(int, input().split())\n\naux = []\naux.append(num_desejado)\nwhile(num_desejado > num_possuido):\n if (num_desejado % 10) == 1:\n num_desejado = num_desejado // 10\n aux.append(num_desejado)\n elif (num_desejado % 2 == 0):\n num_desejado = num_desejado // 2\n aux.append(num_desejado)\n else:\n print(\"NO\")\n exit()\n\ntamanho_da_seq = len(aux)\nseq = \"\"\naux.reverse()\nfor i in aux:\n seq += str(i) + \" \"\n\nif(num_desejado == num_possuido):\n print(\"YES\")\n print(tamanho_da_seq)\n print(seq)\nelse:\n print(\"NO\")\n\t \t\t\t \t \t \t\t \t\t \t\t\t \t", "a,b=list(map(int,input().split()))\ntmp=b\n\narr=[str(b)]\nc=0\nwhile(tmp>=a):\n\tif(tmp==a):\n\t\tprint(\"YES\")\n\t\tprint(len(arr))\n\t\tarr=arr[::-1]\n\t\tprint(' '.join(arr))\n\t\texit()\n\t\t\n\tif(tmp%2!=0):\n\t\tif(str(tmp)[-1]!='1'):\n\t\t\tprint(\"NO\")\n\t\t\texit()\n\t\telse:\n\t\t\ttmp=int(str(tmp)[:-1])\n\telse:\n\t\ttmp=tmp//2\n\n\tarr.append(str(tmp))\n\t# c+=1\nprint(\"NO\")", "a,b=map(int,input().split())\nl=[b]\nflag=False\nwhile a<=b:\n if b==a:\n print(\"YES\")\n print(len(l))\n print(reversed(l)) \n flag=True\n break\n elif b%2 ==0:\n b = b//2\n l.append(b)\n elif b%10 ==1:\n b =(b-1)//10\n l.append(b)\n else:\n break\nif not flag:\n print(\"NO\") \n\t \t \t \t\t \t\t \t\t\t \t\t\t \t", "a,b = map(int,input().split())\r\norder = [b]\r\nwhile order[-1]>a:\r\n\tif order[-1]%2==0:\r\n\t\torder.append(order[-1]//2)\r\n\telif order[-1]%10==1:\r\n\t\torder.append(order[-1]//10)\r\n\telse:\r\n\t\torder.append(0)\r\nif order[-1]==a:\r\n\tprint(\"YES\")\r\n\tprint(len(order))\r\n\tprint(' '.join(map(str,order[::-1])))\r\nelse:\r\n\tprint(\"NO\")", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nf=0\r\nl=[]\r\nwhile(b>a):\r\n if (b%2==1):\r\n if (b-1)%10==0:\r\n l.append(b)\r\n b=(b-1)//10\r\n else:\r\n print(\"NO\")\r\n f=1\r\n break\r\n else:\r\n l.append(b)\r\n b=b//2\r\nif (f==0):\r\n if a==b:\r\n print(\"YES\")\r\n l.append(a)\r\n print(len(l))\r\n for i in range (len(l)):\r\n print(l[len(l)-i-1],end=' ')\r\n else:\r\n print(\"NO\")\r\n", "lis = input().split()\r\na,b = int(lis[0]),int(lis[1])\r\nparent = {}\r\nparent[a]=None\r\nstack = [a]\r\nflag = False\r\nwhile stack:\r\n\tnode = stack.pop()\r\n\tif(node==b):\r\n\t\tflag = True\r\n\t\tbreak\r\n\telif(node<b):\r\n\t\tn = [2node,10node+1]\r\n\t\tfor i in n:\r\n\t\t\tparent[i]=node\r\n\t\t\tstack.append(i)\r\nif not flag:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tlis = []\r\n\tcurr = b\r\n\twhile(curr!=None):\r\n\t\tlis.append(curr)\r\n\t\tcurr = parent[curr]\r\n\tlis.reverse()\r\n\tprint(len(lis))\r\n\tfor i in lis:\r\n\t\tprint(i,end = \" \")\r\n\tprint()", "def get_user_input():\n user_input = input().split()\n x = int(user_input[0])\n n = int(user_input[1])\n return x, n\n\ndef is_valid(x, n):\n\treturn x <= n\n\nresults = []\n\ndef transformation(x, n, seq, i):\n\tif x == n:\n\t\tresults.append((i, seq))\n\telse:\n\t\tvalue_append = (10 x) + 1\n\t\tvalue_double = 2 * x\n\t\tif is_valid(value_append, n):\n\t\t\ttransformation(value_append, n, [seq, str(value_append)], i + 1)\n\t\tif is_valid(value_double, n):\n\t\t\ttransformation(value_double, n, [seq, str(value_double)], i + 1)\n\nx, n = get_user_input()\ntransformation(x, n, [str(x)], 1)\n\nif len(results) > 0:\n\tprint(\"YES\")\n\tfor result in results:\n\t\tprint(result[0])\n\t\tprint(\" \".join(result[1]))\nelse:\n\tprint(\"NO\")\n\n \t \t \t\t \t\t \t \t\t \t\t \t\t\t", "#/usr/bin/env python3\r\na, b = input().split(' ')\r\na = int(a)\r\nb = int(b)\r\nseq = list()\r\nseq.append(b)\r\nwhile a!=b and b and b%10 not in (3, 5, 7, 9):\r\n if b%10==1:\r\n b = b//10\r\n else:\r\n b = b//2\r\n seq.append(b)\r\nif a==b:\r\n seq.reverse()\r\n print('YES')\r\n n = len(seq)\r\n print(n)\r\n for i in seq:\r\n print(i, end = ' ', flush = True)\r\nelse:\r\n print('NO')", "ls = []\r\nnum,aim = map(int,input().split())\r\nflag = True\r\nwhile num!=aim:\r\n if aim<num:\r\n flag = False\r\n break\r\n ls.append(aim)\r\n if aim%2 == 0:\r\n aim //= 2\r\n elif aim%10 == 1:\r\n aim //= 10\r\n else:\r\n flag = False\r\n break\r\nls.append(num)\r\nans = len(ls)\r\nif flag==False:print('NO')\r\nelse:\r\n print('YES')\r\n print(ans)\r\n for i in ls[::-1]:\r\n print(i,end=' ')", "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 # 1 2 3 -> [1, 2, 3]\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n # abc -> [\"a\", \"b\", \"c\"]\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# Definitions\r\n\r\ndef output_list(l):\r\n print(\" \".join(list(map(str, l))))\r\n\r\nclass Node:\r\n def __init__(self, i, next):\r\n self.i = i\r\n self.next = next\r\n def __str__(self):\r\n return str(self.i)\r\n\r\nfrom collections import deque\r\n\r\ndef test_case():\r\n a, b = inlt()\r\n\r\n visited = set()\r\n routes = {a: [a]}\r\n\r\n q = deque([])\r\n q.append(a)\r\n\r\n while q:\r\n val = q.popleft()\r\n visited.add(val)\r\n \r\n if val == b:\r\n print(\"YES\")\r\n print(len(routes[val]))\r\n output_list(routes[val])\r\n return\r\n\r\n if 2val not in visited and 2val <= b:\r\n q.append(2val)\r\n routes[2val] = routes[val][:]\r\n routes[2val].append(2val)\r\n\r\n if 10val+1 not in visited and 2val <= b:\r\n q.append(10val+1)\r\n routes[10val+1] = routes[val][:]\r\n routes[10val+1].append(10val+1)\r\n\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n test_case()\r\n", "def fun(x, y, d):\r\n if x > y:\r\n return False\r\n if x == y:\r\n d.append(x)\r\n print(\"YES\")\r\n print(len(d))\r\n print(d)\r\n return True\r\n d.append(x)\r\n if fun(2 x, y, d[:]) or fun(10 * x + 1, y, d[:]):\r\n return True\r\n return False\r\n\r\n\r\na, b = map(int, input().split())\r\nd = []\r\nif not fun(a, b, d[:]):\r\n print(\"NO\")\r\n", "#!/opt/homebrew/bin/python3\n\ndef is_odd(n: int) -> bool:\n return n % 2 == 1\n\ndef is_even(n: int) -> bool:\n return not is_odd(n)\n\ndef last_digit(n: int) -> int:\n return n % 10\n\ndef main():\n a, b = map(int, input().split())\n\n numbers = [b]\n\n while True:\n last_number = numbers[-1]\n if last_number <= a:\n break\n\n if is_even(last_number):\n numbers.append(last_number // 2)\n\n elif is_odd(last_number) and last_digit(last_number) == 1:\n numbers.append(last_number // 10) # remove last digit\n\n else:\n break\n\n\n if numbers[-1] == a:\n print('YES')\n print(len(numbers))\n print(numbers[::-1])\n else:\n print('NO')\n\n\nif __name__ == '__main__':\n main()", "a,b=map(int,input().split())\r\nans= [b]\r\nwhile True:\r\n if b%10==1:\r\n b=b//10\r\n elif b%2==0:\r\n b=b//2\r\n else:\r\n break\r\n if a>=b:\r\n break\r\n ans.append(b)\r\nans.append(a)\r\nif a!=b:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(ans))\r\n print(ans[::-1])", "import sys\n\n\ndef solution(ins):\n a, b = [int(v) for v in ins.split(\" \")]\n ret = []\n\n def util(n):\n ret.append(n)\n if n > b:\n return False\n if n == b:\n return True\n n1 = n10+1\n if util(n1):\n return True\n ret.pop()\n n2 = n2\n if util(n2):\n return True\n ret.pop()\n return False\n util(a)\n return ret\n\n\nif __name__ == \"__main__\":\n if sys.argv[-1] == 't':\n cases = [\n [\"2 162\", []],\n [\"4 42\", []],\n [\"100 40021\", []]\n ]\n for case in cases:\n r = solution(case[:-1])\n if r != case[-1]:\n print(case, r)\n else:\n ret = solution(input())\n if len(ret) > 1:\n print(\"YES\")\n print(len(ret))\n print(\" \".join([str(d) for d in ret]))\n else:\n print(\"NO\")\n\n\t \t\t \t \t\t\t \t\t\t \t \t\t \t", "a, b = map(int, input().split())\r\n \r\nc = [b]\r\nwhile b != a:\r\n\tif b % 10 == 1:\r\n\t\tb //= 10\r\n\telif b % 2 == 0 and b > 0:\r\n\t\tb //= 2\r\n\telse:\r\n\t\tbreak\r\n\tc.append(b)\r\nif (a == b):\r\n\tc.reverse()\r\n\tprint('YES')\r\n\tprint(len(c))\r\n\tfor i in c:\r\n\t\tprint(i, end = ' ')\r\nelse:\r\n\tprint('NO')", "a, b = map(int, input().split())\nl = []\naux = 1\n\nwhile b > a:\n l.append(b)\n if b % 2 == 0:\n b = b // 2\n elif b % 10 == 1:\n b = b // 10\n else:\n ok = 0\n break\n\nif b != a:\n aux = 0\nelse:\n l.append(a)\n\nif not aux:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(len(l))\n for i in range(len(l) - 1, 0, -1):\n print(l[i], end=\" \")\n\n print(l[0])\n\t \t\t \t\t\t \t \t\t\t \t \t\t\t", "mem = {}\n\na,b = map(int, input().split())\n\ndef possible(n):\n if n == b: \n return True\n if n > b: \n return False\n if n in mem:\n return mem[n]\n\n mem[n] = possible(n2) or possible(n10 + 1)\n return mem[n]\n\nif not possible(a):\n print('NO')\nelse:\n print('YES')\n ans = []\n while b >= a:\n ans.append(b)\n if b % 2 == 1:\n b = int(b/10)\n else:\n b = int(b/2)\n ans.reverse()\n print(len(ans))\n print(' '.join(map(str, ans)))\n \t\t \t \t\t \t \t\t \t\t \t\t\t \t\t\t\t", "def AtoB(a, b, caminho):\n caminho.append(b)\n if( a == b):\n return True\n elif(a > b):\n return False\n \n if(b % 2 == 0):\n return AtoB(a, int(b/2), caminho)\n elif(str(b)[-1] == '1'):\n return AtoB(a, int((b - 1)/10), caminho)\n \n return False\n\ndef main():\n entrada = input().split()\n a = int(entrada[0])\n b = int(entrada[1])\n\n caminho = []\n if(AtoB(a, b, caminho)):\n print(\"YES\")\n print(len(caminho))\n for i in range(len(caminho) - 1, 0, -1):\n print(caminho[i], end = \" \")\n print(caminho[0])\n else:\n print(\"NO\")\n\nmain()\n \t \t \t \t \t\t\t \t \t \t \t \t\t\t\t", "a,b=[int(x) for x in input().split()]\r\na,b=str(a),str(b)\r\n\r\nl=[b]\r\ncount=1\r\nflag=0\r\n\r\nwhile int(b)>int(a):\r\n \r\n b=str(b)\r\n if b[-1]=='1':\r\n b=b[0:-1]\r\n l.append(b)\r\n count+=1\r\n \r\n elif int(b)%2==0: \r\n b=str(int(int(b)/2))\r\n l.append(b)\r\n count+=1\r\n \r\n else:\r\n flag=1\r\n break\r\n \r\n\r\nif flag==1 or b<a:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(count)\r\n for i in l[::-1]:\r\n print(i,end=\" \")\r\n \r\n ", "# Transformation from A to B\n# (c) Alexandre Corlet\n\nfrom collections import deque\nfrom sys import stdin\n\npredecessor = dict()\n\ndef readints():\n return [int(i) for i in stdin.readline().split()]\n\n\ndef BFS(s, u):\n Q = deque()\n\n Q.append(s)\n predecessor[s] = -1\n\n while Q:\n v = Q.popleft()\n\n x = v 2\n y = v * 10 + 1\n\n if x <= u and x not in predecessor:\n predecessor[x] = v\n Q.append(x)\n if y <= u and y not in predecessor:\n predecessor[y] = v\n Q.append(y)\n\n\ndef print_predecessors(v):\n ans = []\n\n p = predecessor[v]\n\n ans.append(v)\n while p != - 1:\n ans.append(p)\n p = predecessor[p]\n \n print(len(ans))\n print(ans[::-1]) \n\n\ndef main():\n a, b = readints()\n \n BFS(a, b)\n \n if b in predecessor:\n print(\"YES\")\n print_predecessors(b)\n else:\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n main()\n\n", "from queue import Queue as q\r\na, b = map(int, input().split())\r\nQ = q()\r\nq.put(Q, (a, [a]))\r\nwhile not Q.empty():\r\n i = Q.get()\r\n if i[0] == b:\r\n print('YES')\r\n print(len(i[1]))\r\n print(i[1])\r\n break\r\n elif i[0] < b:\r\n Q.put((i[0]2, i[1]+[i[0]2]))\r\n Q.put((i[0]10+1, i[1]+[i[0]10+1]))\r\nelse:\r\n print('NO')\r\n", "n, target = map(int, input().split())\r\nans = []\r\ndef fun(n, ds):\r\n global ans1\r\n \r\n if n > target:\r\n return \r\n \r\n if n == target:\r\n ds.append(n)\r\n ans.append(ds.copy())\r\n return \r\n \r\n \r\n \r\n fun(n * 2, ds + [n])\r\n \r\n \r\n fun(int(str(n) + \"1\"), ds + [n])\r\n \r\n\r\n \r\nfun(n, []) \r\nif ans:\r\n print(\"YES\")\r\n print(len(ans[0]))\r\n for i in ans[0]:\r\n print(i, end = \" \")\r\nelse:\r\n print(\"NO\")", "\r\ndef solve(lista, alvo):\r\n global done\r\n if (lista == [] or done or lista[-1] > alvo):\r\n return\r\n if (lista[-1] == alvo):\r\n done = True\r\n return\r\n\r\n n = lista[-1]\r\n lista.append(2 * n)\r\n solve(lista, alvo)\r\n if (done):\r\n return\r\n else:\r\n lista.pop(-1)\r\n \r\n lista.append(10 * n + 1)\r\n solve(lista, alvo)\r\n if (done):\r\n return\r\n else:\r\n lista.pop(-1)\r\n \r\n return\r\n\r\n\r\n\r\nipt = input().split(\" \")\r\na, b = int(ipt[0]), int(ipt[1])\r\ndone = False\r\nlista = [a]\r\n\r\n\r\nsolve(lista, b)\r\n\r\nif done:\r\n print(\"YES\")\r\n print(len(lista))\r\n for e in lista:\r\n print(e, end=\" \")\r\n print()\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\nans = [b]\n \nwhile (b > a):\n if (b % 2 == 0):\n b //= 2\n ans.append(b)\n elif (b % 10 == 1):\n b //= 10\n ans.append(b)\n else:\n break\n \nif (b == a):\n print('YES')\n print(len(ans))\n print(reversed(ans))\nelse:\n print('NO')\n\t\t\t\t\t \t \t \t\t \t\t \t \t\t \t\t\t", "a, b = map(int, input().split())\r\n\r\nk = 1\r\nnumbers = str(b)\r\n\r\nwhile(a < b):\r\n\tif(b % 2 == 0):\r\n\t\tb = b/2\r\n\t\tk+= 1\r\n\t\tnumbers = str(int(b)) + \" \" + numbers\r\n\t\t\t\r\n\telif(b % 10 == 1):\r\n\t\tb = b//10\r\n\t\tk+= 1\r\n\t\tnumbers = str(int(b)) + \" \" + numbers\r\n\t\r\n\telse:\r\n\t\tb = 0\r\n\t\t\t\r\n\r\nif(a == b):\r\n\tprint(\"YES\")\r\n\tprint(k)\r\n\tprint(numbers)\r\n\t\r\nelse:\t\r\n\tprint(\"NO\")", "def primeiraOperacao(valor):\n return 2 valor\n\ndef segundaOperacao(valor):\n return 10 * valor + 1\n\ndef transformacao(x,y,arrayAux):\n resultadoPrimeiraOperacao = primeiraOperacao(x)\n resultadoSegundaOperacao = segundaOperacao(x)\n\n if(x > y):\n return False\n if(x == y):\n return True\n\n aux1 = transformacao(resultadoPrimeiraOperacao,y,arrayAux)\n\n if(aux1):\n arrayAux.append(resultadoPrimeiraOperacao)\n return True\n\n else:\n aux2 = transformacao(resultadoSegundaOperacao,y,arrayAux)\n\n if(aux2):\n arrayAux.append(resultadoSegundaOperacao)\n return True\n\n return False\n\nvalor1,valor2 = [int(e) for e in input().split()]\n\narrayAux = []\n\nsequence = transformacao(valor1,valor2,arrayAux)\n\nif(len(arrayAux) == 0):\n print(\"NO\")\nelse:\n print(\"YES\")\n arrayAux.append(valor1)\n arrayAux.reverse()\n print(len(arrayAux))\n print(arrayAux, sep=\" \")", "a, b = map(int, input().split(\" \"))\niterations = [b]\n\nwhile (b > 0):\n if (b % 2 == 0):\n b = b // 2\n iterations = [b] + iterations\n elif ((b - 1) % 10 == 0):\n b = b // 10\n iterations = [b] + iterations\n else:\n break\n if (b == a):\n break\n\nif (iterations[0] == a):\n print(\"YES\")\n print(len(iterations))\n result = \"\"\n for i in range(len(iterations)):\n result += str(iterations[i]) + (\" \" if (i < len(iterations) - 1) else \"\")\n print(result)\nelse:\n print(\"NO\")\n", "a, b = map(int, input().split())\r\n\r\nt = []\r\ny = True\r\nwhile b > a:\r\n if b % 10 == 1:\r\n t.append(b)\r\n b //= 10\r\n elif b % 2 == 0:\r\n t.append(b)\r\n b //= 2\r\n else:\r\n y = False\r\n break\r\nt.append(b)\r\n\r\nif b == a and y:\r\n print(\"YES\")\r\n print(len(t))\r\n for i in range(len(t) - 1, -1, -1):\r\n print(t[i], end=\" \")\r\nelse:\r\n print(\"NO\")", "a,b = map(int,input().split())\r\nq,s=[b],0\r\nwhile b>a:\r\n if b%2==0:b=b//2\r\n elif str(b)[-1]=='1': b = int(str(b)[0:len(str(b))-1])\r\n else:break\r\n q.append(b)\r\nif a==b:\r\n print('YES')\r\n print(len(q))\r\n print(reversed(q))\r\nelse: print('NO')", "a,b = [int(x) for x in input().split()]\r\ndef solve(a, b, string, count):\r\n if a > b:\r\n pass\r\n elif a == b:\r\n print(\"YES\")\r\n print(count + 1)\r\n print(string + str(a))\r\n exit()\r\n else:\r\n solve(2a, b, string + str(a) + \" \", count + 1)\r\n solve(10a + 1, b, string + str(a) + \" \", count + 1)\r\nsolve(a,b,\"\",0)\r\nprint(\"NO\")", "def transformABHelper(a, b, level,ans):\n global minSteps, dictionary \n if(a>b):\n return\n \n if(a==b):\n minSteps = min(minSteps, level)\n ans.append(a)\n dictionary[minSteps]=ans\n return\n \n \n transformABHelper(a2,b,level+1,ans+[a])\n transformABHelper((a10)+1,b,level+1,ans+[a])\n\n\n\ndef transformAB(a,b):\n global minSteps, dictionary\n minSteps = float('inf')\n level = 1\n ans=[]\n dictionary={}\n transformABHelper(a,b,level,ans)\n if(minSteps==float('inf')):\n print('NO')\n else:\n print('YES')\n print(minSteps)\n for i in dictionary[minSteps]:\n print(i, end=\" \")\n\n\n\na, b = map(int, input().split())\ntransformAB(a,b)\n\n", "from collections import deque\na,b = map(int, input().split())\npre = {}\nfila = deque([a])\nwhile fila:\n v = fila.popleft()\n if 2v not in pre and 2v <= b:\n fila.append(2v)\n pre[2v] = v\n if 10v+1 not in pre and 10v+1 <=b:\n fila.append(10v+1)\n pre[10v+1] = v\nseq = [b]\nif b not in pre:\n print(\"NO\")\nelse:\n print(\"YES\")\n x = b\n while x != a:\n x = pre[x]\n seq.append(x)\n print(len(seq))\n for i in seq[::-1]:\n print(f'{i} ', end=\"\")\n\t \t\t\t \t \t\t\t\t \t\t\t\t\t", "# coding: utf-8\na, b = input().split(\" \")\na, b = int(a), int(b)\n\nMULTIPLY = 0\nAPPEND = 1\n\ndef a_to_b(array, op, target):\n x = array[-1]\n\n if x == target:\n print(\"YES\")\n print(len(array))\n print(\" \".join([str(i) for i in array]))\n return True\n elif x > target:\n return False\n else:\n if op == MULTIPLY:\n x = x * 2\n else:\n x = 10 * x + 1\n\n return a_to_b(array + [x], MULTIPLY, target) or a_to_b(array + [x], APPEND, target)\n \ndef transform_a_to_b(a, b):\n m_branch = a_to_b([a], MULTIPLY, b)\n a_branch = a_to_b([a], APPEND, b)\n\n if not m_branch and not a_branch:\n print(\"NO\")\n\ntransform_a_to_b(a, b)\n \n \t\t\t\t \t\t\t \t \t \t", "a,b = map(int, input().split())\r\narr = []\r\narr.append(b)\r\nwhile a < b:\r\n if b % 2 == 0:\r\n b //= 2\r\n elif b % 10 == 1:\r\n b //= 10\r\n else:\r\n break\r\n arr.append(b)\r\narr.sort()\r\nif a == b:\r\n print(\"YES\")\r\n print(len(arr))\r\n print(*arr)\r\nelse:\r\n print(\"NO\")" ]	{"inputs": ["2 162", "4 42", "100 40021", "1 111111111", "1 1000000000", "999999999 1000000000", "1 2", "1 536870912", "11111 11111111", "59139 946224", "9859 19718", "25987 51974222", "9411 188222222", "25539 510782222", "76259 610072", "92387 184774", "8515 85151111", "91939 9193911", "30518 610361", "46646 373168844", "30070 300701", "13494 1079528", "96918 775344422", "13046 260921", "29174 5834811", "79894 319576421", "96022 1920442", "79446 6355681", "5440 27853056", "250000000 705032705", "17 35", "1 3", "2 11"], "outputs": ["YES\n5\n2 4 8 81 162 ", "NO", "YES\n5\n100 200 2001 4002 40021 ", "YES\n9\n1 11 111 1111 11111 111111 1111111 11111111 111111111 ", "NO", "NO", "YES\n2\n1 2 ", "YES\n30\n1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 131072 262144 524288 1048576 2097152 4194304 8388608 16777216 33554432 67108864 134217728 268435456 536870912 ", "YES\n4\n11111 111111 1111111 11111111 ", "YES\n5\n59139 118278 236556 473112 946224 ", "YES\n2\n9859 19718 ", "YES\n5\n25987 259871 2598711 25987111 51974222 ", "YES\n6\n9411 94111 941111 9411111 94111111 188222222 ", "YES\n6\n25539 255391 2553911 25539111 255391111 510782222 ", "YES\n4\n76259 152518 305036 610072 ", "YES\n2\n92387 184774 ", "YES\n5\n8515 85151 851511 8515111 85151111 ", "YES\n3\n91939 919391 9193911 ", "YES\n3\n30518 61036 610361 ", "YES\n7\n46646 466461 932922 9329221 93292211 186584422 373168844 ", "YES\n2\n30070 300701 ", "YES\n5\n13494 134941 269882 539764 1079528 ", "YES\n7\n96918 193836 1938361 3876722 38767221 387672211 775344422 ", "YES\n3\n13046 26092 260921 ", "YES\n4\n29174 58348 583481 5834811 ", "YES\n6\n79894 798941 1597882 15978821 31957642 319576421 ", "YES\n3\n96022 960221 1920442 ", "YES\n5\n79446 158892 317784 635568 6355681 ", "YES\n11\n5440 10880 108801 217602 435204 870408 1740816 3481632 6963264 13926528 27853056 ", "NO", "NO", "NO", "NO"]}	UNKNOWN	PYTHON3	CODEFORCES	275
9244db8730fb75772e42e09626cc70a0	Lucky Transformation	Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not. Petya has a number consisting of n digits without leading zeroes. He represented it as an array of digits without leading zeroes. Let's call it d. The numeration starts with 1, starting from the most significant digit. Petya wants to perform the following operation k times: find the minimum x (1<=≤<=x<=<<=n) such that dx<==<=4 and dx<=+<=1<==<=7, if x is odd, then to assign dx<==<=dx<=+<=1<==<=4, otherwise to assign dx<==<=dx<=+<=1<==<=7. Note that if no x was found, then the operation counts as completed and the array doesn't change at all. You are given the initial number as an array of digits and the number k. Help Petya find the result of completing k operations. The first line contains two integers n and k (1<=≤<=n<=≤<=105,<=0<=≤<=k<=≤<=109) — the number of digits in the number and the number of completed operations. The second line contains n digits without spaces representing the array of digits d, starting with d1. It is guaranteed that the first digit of the number does not equal zero. In the single line print the result without spaces — the number after the k operations are fulfilled. Sample Input 7 4 4727447 4 2 4478 Sample Output 4427477 4478	[ "n,k=map(int,input().split())\r\ns=[input()]+[0,0]\r\ni=1\r\nwhile k and i<=n:\r\n if s[i-1]==\"4\" and s[i]==\"7\" and s[i+1]==\"7\" and i%2:\r\n if k%2:\r\n s[i]=\"4\"\r\n break\r\n elif s[i-1]==\"4\" and s[i]==\"4\" and s[i+1]==\"7\" and i%2:\r\n if k%2:\r\n s[i]=\"7\"\r\n break\r\n elif s[i-1]==\"4\" and s[i]==\"7\":\r\n if i%2:\r\n s[i]=\"4\"\r\n else:\r\n s[i-1]=\"7\"\r\n k-=1\r\n i+=1\r\nprint(\"\".join(s[:n]))", "n, k = map(int, input().split())\r\ns = list(input())\r\nfor i in range(10):\r\n s.append('0')\r\ni = 0\r\nwhile i < n and k:\r\n if s[i] == '4' and s[i+1] == '7' and s[i+2] == '7' and not (i & 1):\r\n k %= 2\r\n if k and s[i] == '4' and s[i+1] == '7':\r\n if i & 1:\r\n s[i] = s[i+1]\r\n else:\r\n s[i+1] = s[i]\r\n i -= 2\r\n k -= 1\r\n i += 1\r\nans = ''\r\nfor i in range(n):\r\n ans += s[i]\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def b3_lucky_transformation(n, k, s):\n i = 1\n while k and i < n:\n if s[i] == '4' and s[i+1] == '7':\n if s[i-1] == '4' and i % 2 == 0:\n if k % 2 == 1:\n s[i] = '7'\n k = 0\n else:\n if i % 2 == 0:\n s[i] = '7'\n i += 2\n k -= 1\n else:\n s[i+1] = '4'\n i +=1\n k -=1\n else:\n i +=1\n return s\n\nif __name__ == \"__main__\":\n [n, k] = map(int, input().split())\n s = input()\n s = ' ' + s\n s = list(s)\n result = b3_lucky_transformation(n, k, s)\n for i in range (1,n+1):\n print(result[i],end='')\n", "import heapq\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\nd = list(input().rstrip())\r\nh = []\r\nfor i in range(n - 1):\r\n if d[i] == 52 and d[i + 1] == 55:\r\n heapq.heappush(h, i)\r\nk = min(k, 2 n + k % 2)\r\nfor _ in range(k):\r\n ok = 0\r\n while not ok and h:\r\n i = heapq.heappop(h)\r\n if d[i] ^ 52 or d[i + 1] ^ 55:\r\n continue\r\n ok = 1\r\n if not i % 2:\r\n d[i + 1] -= 3\r\n else:\r\n d[i] += 3\r\n for j in range(i - 1, i + 2):\r\n if not 0 <= j < n - 1:\r\n continue\r\n if d[j] == 52 and d[j + 1] == 55:\r\n heapq.heappush(h, j)\r\nans = \"\".join(map(str, [chr(i) for i in d]))\r\nsys.stdout.write(ans)", "# 447 or 477 start with odd\n\n\nn, k = map(int, input().split())\ns = input()\ns = list(s)\n\nfor i in range(n - 1):\n if not k:\n break\n if s[i] != '4':\n continue\n tt = ''.join(s[i:i + 3])\n if tt in ('447', '477') and i % 2 == 0:\n if k % 2 == 1 and tt == '447':\n s[i + 1] = '7'\n if k % 2 == 1 and tt == '477':\n s[i + 1] = '4'\n break\n if s[i] == '4' and s[i + 1] == '7':\n if i % 2 == 0:\n s[i + 1] = '4'\n else:\n s[i] = '7'\n k -= 1\n\nprint(''.join(s))\n", "n, k = map(int, input().split())\nt = list(input())\ni, m = 0, n // 2\nif k > m: k = m + ((m + k) & 1)\nwhile k and i < n - 1:\n if t[i] == '4' and t[i + 1] == '7':\n k -= 1\n if i & 1 == 0: t[i + 1] = '4'\n else:\n t[i] = '7'\n i -= 2\n i += 1\nprint(''.join(t))\n\n\t \t \t\t\t\t\t \t \t \t\t \t\t\t\t\t \t \t\t\t", "n,k=map(int,input().split())\r\ns = list(input())\r\ni=0\r\nwhile i<n-1 and k>0:\r\n if s[i]=='4' and s[i+1]=='7':\r\n k-=1\r\n if (i%2)==0:\r\n s[i]='4'\r\n s[i+1]='4'\r\n else:\r\n s[i]='7'\r\n if i-1>=0 and s[i-1]=='4':\r\n i -= 2\r\n k = k%2\r\n i+=1\r\nprint (''.join(s))\r\n" ]	{"inputs": ["7 4\n4727447", "4 2\n4478", "7 7\n4211147", "7 6\n4747477", "10 2\n9474444474", "10 47\n4214777477", "3 99\n447", "4 1000000000\n7747", "3 1000000000\n447", "3 100\n447", "7 74\n4777774", "10 200\n6860544593", "10 477\n5837934237", "47 7477\n83492039276961836565341994102530448486552156001", "100 0\n9179665522184092255095619209953008761499858159751083177424923082479016015954927554823400601862864827", "485 9554485\n77591213686327368525391827531734680282181149581181587323024775516707756080151536104831756264659461447807315739541829004122483827102803764919259852061561098901393332937462039404423475012940096002301663119780442182470831027122573263011092200024968051233448164275142862251531399243063800892848783227559284462449919786387761960941614255036371684927500361571685732032325070607701306810264624073744998990612133986362972207072576588540217974702060321406370425911824802563123926135054749895722", "74 7\n47437850490316923506619313479471062875964157742919669484484624083960118773", "47 7\n77774477747474477477477774747747447447774777474", "100 2\n7477774774777474774777777474474474744477777477774444477444774474477774777474774744477474744474777444", "99 1\n474747444774447474444477474747774774447444477744774744477747777474777774777474477744447447447447477", "74 1000000000\n77474447774774747474777447474777777477474444477747444777447444474744744444", "74 999999999\n47474777744447477747777774774777447474747747447744474777477474777774774447", "100 47\n4346440647444704624490777777537777677744747437443404484777536674477779371445774947477174444474400267", "100 1000000000\n5849347454478644774747479437170493249634474874684784475734456487776740780444477442497447771444047377", "154 96\n7967779274474413067517474773015431177704444740654941743448963746454006444442746745494233876247994374947948475494434494479684421447774484909784471488747487", "2 0\n47", "5 0\n12473"], "outputs": ["4427477", "4478", "4211177", "4444477", "9774444774", "4217777777", "477", "7744", "447", "447", "4777774", "6860544593", "5837934237", "83492039276961836565341994102530448486552156001", "9179665522184092255095619209953008761499858159751083177424923082479016015954927554823400601862864827", "77591213686327368525391827531734680282181149581181587323024475516707756080151536104831756264659461447807315739541829004122483827102803764919259852061561098901393332937462039404423475012940096002301663119780442182470831027122573263011092200024968051233448164275142862251531399243063800892848783227559284462449919786387761960941614255036371684927500361571685732032325070607701306810264624073744998990612133986362972207072576588540217974702060321406370425911824802563123926135054749895722", "44437850490316923506619313449771062875964157742919669484484624083960118773", "77774777747474477477477774747747447447774777474", "7777774474777474774777777474474474744477777477774444477444774474477774777474774744477474744474777444", "444747444774447474444477474747774774447444477744774744477747777474777774777474477744447447447447477", "77444444774774747474777447474777777477474444477747444777447444474744744444", "44444477744447477747777774774777447474747747447744474777477474777774774447", "4346440644444404624490777777537777677747747437443404484777536674477779371445774947477174444474400267", "5849377454448644774747479437170493249634474874684784475734456487776740780444477442497447771444047377", "7967779274444413067517444773015431177704444740654941743448963746454006444442746745494233876247994374947948475494434494479684421447774484909784471488747487", "47", "12473"]}	UNKNOWN	PYTHON3	CODEFORCES	7
924ee6af45d93e3e9e8d31fd75d78f25	Palindromic Supersequence	You are given a string A. Find a string B, where B is a palindrome and A is a subsequence of B. A subsequence of a string is a string that can be derived from it by deleting some (not necessarily consecutive) characters without changing the order of the remaining characters. For example, "cotst" is a subsequence of "contest". A palindrome is a string that reads the same forward or backward. The length of string B should be at most 104. It is guaranteed that there always exists such string. You do not need to find the shortest answer, the only restriction is that the length of string B should not exceed 104. First line contains a string A (1<=≤<=\|A\|<=≤<=103) consisting of lowercase Latin letters, where \|A\| is a length of A. Output single line containing B consisting of only lowercase Latin letters. You do not need to find the shortest answer, the only restriction is that the length of string B should not exceed 104. If there are many possible B, print any of them. Sample Input aba ab Sample Output abaaabaa	[ "a=input()\r\na1,c=a[::-1],-1\r\nif a==a1:\r\n print(a)\r\n quit()\r\nfor i in range(len(a)):\r\n if a[i:]==a1[:-i]:\r\n c=i\r\n break\r\nif c==-1:\r\n print(a+a1)\r\n quit()\r\nprint(a+a[:c][::-1])\r\n", "A = input()\r\n\r\nprint(A+A[::-1])", "def pal(s):\r\n if(s==s[::-1]):\r\n return 1;\r\n else:\r\n return 0\r\nk=input()\r\nif(pal(k)==1):\r\n print(k)\r\nelse:\r\n print(k+k[::-1])", "s=input()\nprint(s+''.join(reversed(s)))\n", "s=input()\nx=s[::-1]\nif(s==x):\n\tprint(s)\nelse:\n\tprint(s+x)\n", "n=input()\r\na=n[::-1]\r\nif n==a:\r\n print(n)\r\nelse:\r\n print(n+a)", "a = input()\r\nb = list()\r\nfor i in range(len(a)):\r\n b.append(a[i])\r\n\r\nr = len(a) - 1\r\nfor i in range(len(a)):\r\n if a[i] != a[r - i]:\r\n b.insert(r - i, a[i])\r\n\r\nres = ''\r\nfor i in range(len(b)):\r\n res += b[i]\r\n\r\nprint(res)", "A = input().strip()\r\nprint(A + A[::-1])\r\n", "n=input()\r\nn=list(n)\r\nk=reversed(n)\r\nk=list(k)\r\nn=n+k\r\nabc=\"\"\r\nfor i in n:\r\n abc=abc+i\r\nprint(abc)", "str = input()\r\nprint(str+str[::-1])", "def line_is_palindrome(input_line):\r\n for i in range(0, len(input_line) // 2):\r\n if input_line[i] != input_line[-(i+1)]:\r\n return False\r\n return True\r\n\r\n\r\ndef get_lenght_base_palindrome(input_line):\r\n i = 0\r\n while True:\r\n if input_line[i] != input_line[-(i+1)]:\r\n return i\r\n i += 1\r\n\r\n\r\ndef create_palindrome(input_line, length_base_palindrome):\r\n if length_base_palindrome != 0:\r\n none_palindrome_subline = input_line[length_base_palindrome: -(length_base_palindrome + 1)]\r\n return input_line[:length_base_palindrome] + none_palindrome_subline + none_palindrome_subline[::-1] + input_line[:length_base_palindrome]\r\n return input_line + input_line[::-1]\r\n\r\n\r\ndef main():\r\n input_line = input()\r\n if line_is_palindrome(input_line):\r\n return input_line\r\n length_base_palindrome = get_lenght_base_palindrome(input_line)\r\n return create_palindrome(input_line, length_base_palindrome)\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "N = input().strip()\r\nprint( N + N[::-1] )\r\n", "s=input()\r\nN=len(s)\r\nfor i in range(2N):\r\n if(i<N):\r\n print(s[i],end=\"\")\r\n else:\r\n print(s[2N-i-1],end=\"\")", "s = input()\r\nif(s==s[::-1]):\r\n print(s)\r\nelse:\r\n print(s,end='')\r\n print(s[::-1])", "s = input()\ns1 = s[::-1]\nprint(s, s1, sep = '')", "n=input(\"\")\r\nm=n[::-1]\r\nif n==m:\r\n print(n)\r\nelse:\r\n print(n+m)", "A = input()\nC = []\nnum = len(A)\nfor i in range(num):\n C.append(A[num - i - 1])\nC = \"\".join(C)\nprint(A,end = \"\")\nprint(C)\n \t \t \t \t \t\t \t\t\t\t\t \t\t \t\t", "def palindrom(x):\r\n f=0\r\n while True :\r\n if x[f]==x[-f-1] :\r\n f+=1\r\n else :\r\n return f\r\n if f==len(x)//2 :\r\n return 'true'\r\ninp=input()\r\nwhile palindrom(inp)!='true' :\r\n inp=inp[:len(inp)-palindrom(inp)]+inp[palindrom(inp)]+inp[-palindrom(inp)+len(inp):]\r\nprint(inp)\r\n", "l=[char for char in input()]\r\nn=len(l)\r\nfor x in l:\r\n print(x,end=\"\")\r\n\r\nfor i in range(n-2,-1,-1):\r\n print(l[i],end=\"\")\r\n\r\nprint()", "s=input()\r\nl=len(s)\r\nfor i in range(l-1,-1,-1):\r\n s+=s[i]\r\nprint(s)\r\n", "line = input()\r\nprint(line + line[::-1])", "s = input()\ns = list(s)\nlength = len(s)\n\n#abcfff \n# if the origin string's length is 7000, we can only add 3000 elements, which means the par has to start from 3000 \n\nif length<5000:\n for i in range(length):\n s.append(s[length-1-i])\n print(''.join(s))\nelse: ## either add element from left or from right\n print (s)", "s=input()\r\ns1=s+s[::-1]\r\nprint(s1)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\na = input().rstrip()\r\nprint(a + a[::-1])", "x=list(input())\r\nfor i in x:\r\n print(i,end=\"\")\r\nx.reverse()\r\nfor i in x:\r\n print(i,end=\"\")", "a=input()\r\nwhile True:\r\n if a==a[::-1] and len(a)<10000:\r\n print(a)\r\n break\r\n else:\r\n a=a+a[::-1]\r\n", "a=input()\nif a==a[::-1]:\n print(a)\nelse:\n print(a[::-1]+a)", "import sys\nfor line in sys.stdin:\n if line == None or line == '\\n':\n break\n \n \n # first if it is already a palindrome then just ouput itself\n first, last = 0, len(line) - 1\n is_palin = True\n while first < last:\n if line[first] != line[last]:\n is_palin = False\n break\n first += 1\n last -= 1\n\n if is_palin:\n print(line)\n continue\n \n # dumbest move\n str_builder = ''\n for i in range(len(line) - 1, -1, -1):\n str_builder += line[i]\n print(str_builder + line)", "a = input()\r\nb = list(a)\r\nif list(a) != list(reversed(a)):\r\n for i in range(len(a)):\r\n b.insert(len(a),a[i])\r\n if b == list(reversed(b)):\r\n #print(b)\r\n break\r\n for e in b[:-1]:\r\n print(e, end='')\r\n print(b[-1])\r\nelse:\r\n print(a)", "s = input()\r\nd = s\r\nn = len(s)\r\nfor i in range(len(s)):\r\n d += s[n-1-i]\r\nprint(d)", "a=input()\r\nc=a\r\nb=a[::-1]\r\nprint(c+b)\r\n", "t = input()\r\nn = len(t)\r\ndef check_pal(st,n):\r\n for i in range(int(n/2)):\r\n if st[i] != st[n-i-1]:\r\n return construct_pal(st,n)\r\n return st\r\n\r\ndef construct_pal(st,n):\r\n ans = st\r\n if n <= 5000:\r\n for i in range(n):\r\n ans += st[n-i-1]\r\n return ans\r\n return\r\n\r\nprint(check_pal(t,n))", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\ns = input()\r\nans = \"\"\r\nfor i in range(1, len(s) + 1):\r\n\tans += s[-i]\r\nprint(s + ans) \r\n", "str1=input()\nlist0=list(str1)\nfor i in list0[::-1]:\n list0.append(i)\nstr2=''.join(list0)\nprint(str2)\n\t\t \t\t\t \t \t\t\t \t\t \t \t\t\t \t \t\t\t", "import sys\r\ninput = sys.stdin.readline\r\nins = lambda: input().rstrip()\r\nini = lambda: int(input().rstrip())\r\ninm = lambda: map(int, input().rstrip().split())\r\ninl = lambda: list(map(int, input().split()))\r\nout = lambda x, s='\\n': print(s.join(map(str, x)))\r\n\r\ns = ins()\r\nprint(s + s[::-1])", "s = input()\r\nn = len(s)\r\nc = [0 for i in range(2len(s))]\r\nfor i in range(len(s)):\r\n c[i] = s[i]\r\n c[2n-i-1] = s[i]\r\nprint(''.join(c))\r\n", "a = input().strip()\r\nprint(a, a[::-1], sep='')", "x = input().strip()\n\ndef test_3(x):\n return x + x[::-1]\n\n\naa = test_3(x)\nprint(aa)\n\n\t \t \t\t\t \t \t\t\t \t\t \t\t \t\t\t\t\t\t\t", "i = input()\r\nprint(i + ''.join(reversed(i)))", "def is_palindrome(str):\r\n return str == str[::-1]\r\n\r\nins = input()\r\nans = \"\"\r\ni = len(ins) - 1\r\nwhile not is_palindrome(ans + ins):\r\n ans+= ins[i]\r\n i -= 1\r\nprint(ans + ins)", "n=str(input())\r\nprint(n,end=\"\")\r\nl=len(n)\r\nfor i in range(l):\r\n\tprint(n[l-i-1],end=\"\")", "'''input\r\naba\r\n'''\r\ns=input()\r\nprint(s+s[::-1])", "s=input()\nprint(s,end=\"\")\nfor i in range(len(s)-1):\n\tprint(s[len(s)-2-i],end=\"\")\nprint()\n", "s=input()\r\nif(s==s[::-1]):\r\n print(s)\r\nelse:\r\n n=len(s)\r\n print(s+(s[:n-1])[::-1])\r\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\ta=read()\n\tprint(a+a[::-1])\n\nsolve()\n", "IL = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\ns = input()\r\nprint(s+s[::-1])", "a=input()\r\nl=list(a)\r\nprint(a,end=\"\")\r\nfor i in range(len(l)-2,-1,-1):\r\n\tprint(l[i],end=\"\") ", "# Palindromic Supersequence\n\na = input()\nb = a\nif a != a[::-1]:\n b = a + a[::-1]\nprint(b)", "st=str(input())\r\nprint(st,end=\"\")\r\nfor i in range(len(st)-1,-1,-1):\r\n\tprint(st[i],end=\"\")", "def isP(s):\n return s==s[::-1]\nx=list(input())\nk=x.copy()\nel=1\nwhile el <= len(x) and not isP(k) :\n k.append(x[len(x)-el-1])\n #print(str(k),el)\n el+=1\nprint(''.join(k))\n ", "s = input()\n# s = \"cotst\"\nb = \"\"\ni,j = 0,len(s)-1\nwhile i<j:\n if s[i]==s[j]:\n j-=1\n b = s[i] + b\n i+=1\nprint(s[:i+1] + b)\n", "from typing import Counter\r\n\r\n\r\ns = input()\r\ns += ''.join(reversed(s))\r\nprint(s)", "import difflib\n\ndef main():\n A = input()\n\n rev = A[::-1]\n print(A + rev[1:])\n\nmain()\n", "\r\n#m,n=list(map(int,input().split()))\r\na=input()\r\nprint(a+a[::-1])", "#!/usr/bin/env python3\n\nimport sys\n\ns = sys.stdin.readline().strip()\n\nprint (s + s[::-1])\n", "s = input()\r\ns2 = \"\".join(list(reversed(s)))\r\nprint(s + s2)", "\r\n\r\ndef main():\r\n a = input()\r\n print(a + a[::-1])\r\n\r\n\r\nif __name__ == '__main__':\r\n t = 1\r\n for i in range(t):\r\n main()\r\n\r\n\"\"\"\r\n4 5 6 7 8 9 10 11\r\n\"\"\"\r\n", "s = input()\r\nprint(s + ''.join(s[-i - 1] for i in range(len(s))))\r\n", "b=input()\r\nn=len(b)\r\na=b\r\ni=0\r\nj=n-1\r\nwhile i<=j:\r\n if b[i]==b[j]:\r\n i+=1\r\n j-=1\r\n else:\r\n b=b[:i]+b[j]+b[i:] \r\n i+=1 \r\n\r\nprint(b) \r\n ", "s = input()\r\nprint(s, ''.join(list(reversed(s))), sep=\"\")\r\n", "a = input()\r\ndef check_polindrom(a):\r\n for i in range(int(len(a) / 2)):\r\n if a[i] != a[len(a) - 1 - i]:\r\n return False\r\n return True\r\nif check_polindrom(a):\r\n print(a)\r\nelif len(a) * 2 < 10000:\r\n a += a[::-1]\r\n print(a)\r\n\r\n\r\n", "n=str(input())\r\nprint(n[::-1]+n)\r\n", "# Hello World !\n# Va Hamana Bazgashte Hame Be Sooye Oost\n\nstr = input()\nlength = len(str)\nfor i in range ( length - 1 , -1 , -1 ) :\n\tstr += str[i]\nprint(str)\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na = input().rstrip().decode()\r\nans = a + a[::-1]\r\nsys.stdout.write(ans)", "s=input()\r\nt=list(reversed(s))\r\na=\"\"\r\nfor i in range(len(t)):\r\n a=a+t[i]\r\nif a==s:\r\n print(a)\r\nelse:\r\n print(a+s)", "a = input()\nif a == a[::-1]:\n print(a)\nelse:\n x = a[1: 10 ** 4]\n b = x[::-1] + a\n print(b)", "s=input()\r\nl=list(s)\r\nr=l[::-1]\r\nr=''.join(r)\r\nprint(s+r)", "a = input()\r\nb = a + a[::-1]\r\nprint(b)", "s = input()\r\nif s == s[::-1]:\r\n print(s)\r\nelse:\r\n s2 = s[::-1]\r\n print(s+s2)", "from audioop import reverse\r\nfrom cmath import \r\nfrom dataclasses import dataclass\r\nfrom decimal import \r\n\r\ndef solves():\r\n n=list(input())\r\n s=reversed(n)\r\n if (s==n):\r\n print(n)\r\n else:\r\n n=''.join(n)\r\n s=''.join(s)\r\n print(n+s)\r\n\r\n\r\nt=1\r\n#t =int(input())\r\nfor _ in range(0,t):\r\n solves()\r\n", "s=str(input())\r\n\r\ndef p(s):\r\n if s== s[::-1]:\r\n return s\r\n \r\n else:\r\n x=s[0:len(s)-1][::-1]\r\n return s+x\r\n \r\n \r\nprint(p(s))\r\n", "st=input()\nprint(st[::-1],end=\"\")\nprint(st)\n", "a = input().strip()\nprint(\"{}{}\".format(a, a[::-1]))\n", "s=[x for x in input()]\r\ns1=list(reversed(s))\r\nprint(s,s1,sep=\"\")\r\n", "a = input()\r\nif a == a[::-1]:\r\n print(a)\r\nelse:\r\n print(a + a[len(a) - 2::-1])", "# maa chudaaye duniya\r\nx = input()\r\nprint(x + x[::-1])", "S = input()\rL = [s for s in S]\rL.reverse()\rprint(S+''.join(L))\r", "a=list(input())\r\nb=''\r\nfor i in a:\r\n b+=i\r\na.reverse()\r\nfor i in a:\r\n b+=i\r\nprint(b)", "line= input()\nlen1=len(line)\nstring = line[::-1]\nprint(line+string)", "a=input()\r\nif a==a[::-1]:\r\n print(a)\r\nelse:\r\n print(a+a[::-1])", "s=input()\r\nn=len(s)\r\ni,j=0,n-1\r\nc=[]\r\nwhile i<=j:\r\n c.append(s[i])\r\n if s[i]!=s[j]:\r\n c.append(s[j])\r\n i+=1\r\n j-=1\r\n#print(c)\r\nprint(''.join(c)+''.join(reversed(c)))", "if __name__ == '__main__' :\r\n s = input()\r\n print(s, end = '')\r\n for i in range(len(s)-1,-1,-1):\r\n print(s[i], end = '')", "import sys\r\n\r\ndef main():\r\n s = sys.stdin.read().strip()\r\n return s + s[::-1]\r\n \r\nprint(main())\r\n", "s=input()\r\na=''\r\nn=len(s)\r\ni=-1\r\nwhile i>=-n:\r\n a+=s[i]\r\n i=i-1\r\nif s==a:\r\n print(s)\r\nelse:\r\n for i in s:\r\n print(i,end='')\r\n i=0\r\n while i<len(a):\r\n if i==0:\r\n pass\r\n else:\r\n print(a[i],end='')\r\n i=i+1\r\n print()", "#This code sucks, you know it and I know it. \r\n#Move on and call me an idiot later.\r\n\r\na = input()\r\nb = \"\".join(reversed(a))\r\nprint(a+b)", "def is_palindrome(input):\n if(len(input) == 0):\n return False\n for i in range(int(len(input)/2)):\n if not(input[i] == input[len(input)-1-i]):\n return False\n return True\n\n\nin_string = input()\n\ncurr_string = in_string\nindex = len(curr_string) - 2\nwhile index >= 0 and not(is_palindrome(curr_string)):\n curr_string += in_string[index]\n index -= 1\nprint(curr_string)\n", "str = str(input())\r\nprint(str+str[::-1])", "inp = list(map(str,input()))\r\noutput = ''\r\ns = len(inp)\r\na=int(s/2)\r\nflag=1\r\nfor i in range(a):\r\n if inp[0+i]!=inp[s-1-i]:\r\n flag=0\r\n break\r\nif flag==0:\r\n for i in range(0,2s):\r\n if i<s:\r\n output = output + inp[i]\r\n else:\r\n output = output + inp[s-i-1]\r\nelse:\r\n for i in range(s):\r\n output = output + inp[i]\r\nprint(output)\r\n", "word = str(input())\r\ni = len(word)-1\r\nwhile i >=0:\r\n word = word + word[i]\r\n i-=1\r\nprint(word)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a = input()\r\ndef control(x): return x == x[::-1]\r\na_len = len(a)\r\n\r\nmid1 = list(a[0: a_len // 2])\r\nmid2 = list(a[a_len // 2 + (a_len) % 2:: ])\r\nmid2 = mid2[:: -1]\r\n\r\nind = 0\r\nmid1_len = len(mid1)\r\nmid2_len = len(mid2)\r\nwhile(1):\r\n if(mid1 == mid2 and ind >= mid1_len): break\r\n if(mid1_len >= mid2_len): mid2.insert(ind, mid1[ind]); mid2_len += 1\r\n else: mid1.insert(ind, mid2[ind]); mid1_len += 1\r\n ind += 1\r\nf = \"\".join(mid1 + list(a[a_len // 2 : a_len // 2 + (a_len) % 2]) + mid2[::-1])\r\nprint(f)", "s = input()\nprint(s, reversed(s), sep='')\n", "a = input()\nb = list(a)\nb.reverse()\nprint(a , end = \"\")\nfor i in b:\n\tprint(i , end = \"\")\n", "#\r\n# @author\tMoe_Sakiya \t[email protected]\r\n# @date \t2018-02-21 00:40:32\r\n#\r\n\r\nstring=input()\r\n\r\nprint(string+string[::-1])", "tr = input()\nprint(tr + tr[::-1])\n", "t=input()\r\ns=t[::-1]\r\nf=True\r\nfor i in range(len(t)):\r\n if(s[i]!=t[i]):\r\n f=False\r\n break\r\nif(f):\r\n print(t)\r\nelse:\r\n print(t+s)", "s = input()\nfor i in s:\n print(i, end='')\nprint(s[-1::-1])\n \t \t \t \t\t \t\t\t\t \t\t \t", "s=input()\r\ntemp=s[0:-1]\r\ntemp1=list(temp)\r\ntemp1.reverse()\r\ns=list(s)\r\nx=s+temp1\r\nprint(\"\".join(x))", "\"\"\"\r\n\thttps://codeforces.com/problemset/problem/932/A\r\n\tInput\r\n\t\tA\ta string\r\n\tOutput\r\n\t\tB\ta string, a palindrome from which A is a subsequence\r\n\tDefinition\r\n\t\tSubsequence\r\n\t\t\tstring that can be derived from it by deleting some\r\n\t\t\tcharacters without changing the order of the \r\n\t\t\tremaining characters.\r\n\t\t\ti.e.\t\"cotst\" is a subsequence of \"contest\"\r\n\t\tPalindrome\r\n\t\t\tstring that reads the same forward or backward\r\n\"\"\"\r\n\r\nA = input()\r\n\r\nprint(A + A[::-1])", "s=input()\r\ns=list(s)\r\nl=len(s)\r\nfor i in range(l):\r\n if s[i] != s[l-i-1]:\r\n s.insert(l-i,s[i])\r\n l+=1\r\nprint(''.join(s))", "o=input()\nprint(o+o[::-1])", "N = input()\r\nans1 = N[0:-1]\r\nans2 = list(ans1)\r\nans2.reverse()\r\nN = list(N)\r\nx = N + ans2\r\nprint(\"\".join(x))", "s=input()\r\nres=s[::-1]\r\nprint(s+res)", "s = input()\nt = s[::-1]\nprint(s, t, sep='')\n", "s = input()\r\ns2 = s\r\nprint(s + s2[::-1])\r\n", "import sys\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\nA = input()\r\nprint(A+''.join(str(c) for c in reversed(A)))\r\n\r\n\r\n", "s=input()\r\ns+=s[::-1]\r\nprint(s)", "import sys\nif sys.version_info < (3, 0):\n lrange = range\n input = raw_input\n range = xrange\n\ns = input()\n\nprint(s+s[::-1])\n", "import math\r\ntext = input()\r\nif (text[math.ceil(len(text)/2):][::-1] == text[:len(text)//2]):\r\n print(text)\r\nelse:\r\n print(text+text[::-1])", "def is_palindrome(string):\r\n length = len(string)\r\n\r\n if length%2 == 0 :\r\n l_half = string[int(length/2):]\r\n if string[:int(length/2) ] == l_half[::-1] :\r\n return True\r\n else:\r\n return False\r\n else:\r\n l_half = string[int(length/2):]\r\n if string[:int(length/2)+1 ] == l_half[::-1] :\r\n return True\r\n else:\r\n return False\r\ndef is_subsequence(string1,string2):\r\n for sub in string1:\r\n index = string2.find(sub)\r\n if index != -1:\r\n string2 = string2[index:]\r\n else:\r\n return False\r\n return True\r\n\r\nstring1 = input()\r\nif is_palindrome(string1):\r\n print(string1)\r\nelse:\r\n print(string1+string1[::-1])\r\n", "s = input()\ns = s + s[::-1]\nprint(s)\n\t \t\t\t\t \t \t\t\t\t\t \t \t \t \t \t", "line = input()\nlen1 = len(line)\nstring = line[::-1]\nprint(line+string)\n", "s=[c for c in input()]\r\nn=len(s)-1\r\ni=0\r\nwhile i <= n//2:\r\n\tif s[n-i]!=s[i]:\r\n\t\ts.insert(n-i+1,s[i])\r\n\t\tn+=1\r\n\ti+=1\r\nres=\"\"\r\nfor c in s:\r\n\tres+=c\r\nprint(res)\r\n", "\"\"\"\nBrandt Smith, Lemuel Gorion and Peter Haddad\n\ncodeforces.com\n\nProblem 932A\n\"\"\"\nimport sys\n\nn = input()\nr = n [::-1]\nprint (str(n+r))\n\n", "a = input()\nprint(a + a[::-1])\n", "a=input()\r\nb=''\r\nn=len(a)\r\ni=-1\r\nwhile i>=-n:\r\n b+=a[i]\r\n i=i-1\r\nif a==b:\r\n print(a)\r\nelse:\r\n for i in a:\r\n print(i,end='')\r\n i=0\r\n while i<len(b):\r\n if i==0:\r\n pass\r\n else:\r\n print(b[i],end='')\r\n i=i+1\r\n print()", "n=input()\r\nm=n[::-1]\r\nprint(n+m)\r\n", "# cook your dish here\r\ns=input()\r\nd={}\r\nfor i in s:\r\n d[i]=0\r\nfor i in s:\r\n d[i]=d[i]+1\r\ncount=0\r\nfor i,j in d.items():\r\n if(j%2==1):\r\n count=count+1\r\n if(count >1):\r\n break\r\np=[0]len(s)\r\npk=0\r\nok=0\r\nfor i in range(int(len(s)/2)):\r\n if(s[pk]!=s[-(pk+1)]):\r\n ok=1\r\n break\r\n pk=pk+1\r\nif(ok==0):\r\n print(s)\r\nelse:\r\n m=reversed(s)\r\n m=list(m)\r\n m=''.join(m)\r\n print(s,m,sep='')\r\n \r\n \r\n ", "import getpass\r\nimport sys\r\nimport math\r\nimport functools\r\nimport string\r\n\r\n\r\ndef ria():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\nfiles = True\r\n\r\nif getpass.getuser() == 'frohenk' and files:\r\n sys.stdin = open(\"test.in\")\r\n # sys.stdout = open('test.out', 'w')\r\n\r\nst = input()\r\n\r\nfor i in range(len(st) - 1, -1, -1):\r\n st+=st[i]\r\nprint(st)\r\n\r\nsys.stdout.close()\r\n", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math, fractions, collections\r\n# ===================================\r\na = str(input())\r\nprint(a+a[::-1])", "s = str(input())\r\nprint(s + s[::-1])", "a=input()\r\nb=a[::-1]\r\nif a==b:\r\n print(b)\r\nelse:\r\n print(a+b)\r\n", "a = input()\r\nb = ''\r\nfor i in range(len(a)):\r\n b = a[i] + b\r\nprint(a + b)", "def main():\n a = input()\n print(a + ''.join(reversed(a)))\n\n\nif __name__ == '__main__':\n main()", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import \r\n# from itertools import \r\n# import random\r\ns = input()\r\ntemp = s[0:-1]\r\ntemp1 = list(temp)\r\ntemp1.reverse()\r\ns = list(s)\r\nx = s + temp1\r\nprint(\"\".join(x))\r\n", "tr = input()\nprint (tr+tr[::-1])\n", "s=input()\r\ns2 = s[::-1]\r\nif (s==s2):print(s)\r\nelse:print (s+s2)", "s = input()\r\nprint(s + ''.join(reversed(list(s))))", "s = input()\r\nprint ( s + s[::-1])\r\n", "class Main:\r\n a = input()\r\n print(a + a[::-1])\r\n\r\n\r\nif __name__ == \"main\":\r\n Main()", "A = input()\r\n\r\nl = len(A)\r\n\r\nif l % 2 == 1:\r\n\ta1 = A[0:l // 2]\r\n\tmid = A[l//2]\r\n\ta2 = A[(l//2)+1:]\r\n\tans = a1 + a2[::-1] + mid + a2 + a1[::-1]\r\n\r\nelse:\r\n\ta1 = A[0:l//2]\r\n\ta2 = A[l//2:]\r\n\tans = a1 + a2[::-1] + a2 + a1[::-1]\r\n\r\n\r\n\r\nprint(ans)", "a=input()\na1=[]\na2=[]\nfor i in a:\n\ta1.append(i)\n\ta2.append(i)\na2.reverse()\nif a1==a2:\n\tprint(a)\nelse:\n\ta3=a1+a2\n\tprint(a3,sep='')\n", "x=input()\r\nr=x[::-1]\r\nif r==x:\r\n print(x)\r\nelse:\r\n a=x[1:]\r\n new=a[::-1]+x\r\n print(new)", "a=input()\r\nprint(a,end='')\r\na=a[::-1]\r\nprint(a)", "a=input();b=\"\"\r\nfor i in range(len(a)-1,-1,-1) :\r\n b+=a[i]\r\nif a==b :\r\n print(a)\r\nelse :\r\n print(a+b)\r\n", "s=input()\r\nv=''\r\nfor i in range(len(s)-1,-1,-1):\r\n v+=s[i]\r\n\r\nprint(s+v)\r\n \r\n", "def isPalindrom(s):\r\n s_len = len(s)\r\n if s_len == 1:\r\n return (True, 0)\r\n else:\r\n mid_pt = s_len // 2\r\n for i in range(mid_pt):\r\n if s[i] != s[s_len-i-1]:\r\n return (False, i)\r\n return (True, 0)\r\n \r\ns = list(input())\r\nis_palin, idx = isPalindrom(s)\r\nwhile not is_palin:\r\n s.insert(len(s)-idx, s[idx]);\r\n is_palin, idx = isPalindrom(s)\r\n \r\nprint(''.join(s))\r\n", "import sys\r\nfrom math import sqrt, floor, factorial\r\nfrom collections import deque, Counter\r\ninp = sys.stdin.readline\r\nread = lambda: list(map(int, inp().strip().split()))\r\n\r\ndef solve():\r\n\ts = inp().strip();ans = \"\"\r\n\ti,j = 0, len(s)-1\r\n\twhile i < j:\r\n\t\tif s[i] == s[j]:\r\n\t\t\tans += s[j]\r\n\t\t\tj -=1; i += 1\r\n\t\telse:\r\n\t\t\tans += s[j]\r\n\t\t\tj-=1\r\n\tans += s[i:]\r\n\tprint(ans)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsolve()\r\n# addcbcdda\r\n# addcbcdda", "a = input()\nb = a+a[-2::-1]\n\nprint(b)\n", "str1=input()\nlist0=list(str1)\nlist1=list(str1)\nlist0.pop()\nfor i in list0[::-1]:\n list1.append(i)\nstr2=''.join(list1)\nprint(str2)\n\t \t \t \t \t \t\t \t\t\t \t\t\t \t", "s=input()\r\nl=list(s)\r\nl.reverse()\r\ns1=''.join(l)\r\nprint(s+s1)", "def solve(A):\n return A + A[::-1]\n\n\ndef main():\n A = input()\n print(solve(A))\n\n\nmain()\n", "s=input()\r\ns1=s[::-1]\r\nprint(s+s1)", "s=str(input())\r\nl=list(s)\r\nll=l+l[::-1]\r\nss=''.join(ll)\r\nprint(ss)", "s = input()\r\nq = s[::-1]\r\nr = s+q\r\nprint(r)", "l=input()\r\nprint(l+l[::-1])", "a = input()\r\nprint (a+a[::-1])", "x = input()\n\n\nprint(x+x[::-1])\n", "n=input()\r\nz=''\r\nfor i in range(len(n)-1,-1,-1):\r\n z+=n[i]\r\nprint(n+z)\r\n", "def solve(inp):\n return inp + inp[::-1]\n\n\nif __name__ == \"__main__\":\n print(solve(input()))\n", "n=input()\r\nif n[:len(n)//2+1]==n[len(n)//2:][::-1]:\r\n print(n)\r\nelse:\r\n print(n+n[:-1][::-1])", "n = input()\r\nif n == n[::-1]:\r\n print(n)\r\nelse:\r\n print(n+n[::-1])\r\n\r\n", "a = input()\r\nb = reversed(a)\r\nprint(a, b, sep='')\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n", "w= input()\r\ni=0\r\nn = len(w)\r\no= n-1\r\nf =True\r\nb =w[::-1]\r\nwhile (i<=(n//2)):\r\n if(w[i]==w[o]):\r\n i+=1\r\n o-=1\r\n f =True\r\n else:\r\n f = False\r\n break\r\nif f == True:\r\n print (w)\r\nelse:\r\n a = w + b\r\n print( a)\r\n \r\n \r\n \r\n", "A=input()\nprint(A,end=\"\")\nprint(A[::-1])\n#abba\n#afjhhjfa", "s=input().strip()\r\nprint(s+s[::-1])", "s = input()\r\ns2 = s\r\n\r\nfor k in range(len(s) - 1, -1, -1):\r\n s += s2[k]\r\n\r\nprint(s)\r\n", "s=str(input())\r\nif(s==s[::-1]):\r\n print(s)\r\nelse:\r\n d=s[::-1]\r\n print(s+d)", "s=input()\r\nt=s[::-1]\r\ns=s+t\r\nprint(s)", "s=input()\r\nif s==s[-1::-1]:\r\n print(s)\r\nelse:\r\n print(s+s[-1::-1])", "a = input()\n\nb = a[len(a) - 2:0:-1] + a[0]\n\nprint(a + b)", "a = input()\r\nb = a[::-1]\r\nprint(a + b)", "def isPal(s):\r\n return s == s[::-1]\r\n\r\n\r\nif __name__ == '__main__':\r\n s = input().strip()\r\n if isPal(s):\r\n print(s)\r\n else:\r\n print(s + s[::-1])\r\n", "import sys,math\ninput=sys.stdin.readline\nL=lambda : list(map(int,input().split().strip()))\nM=lambda : map(int,input().split())\nn=input().strip()\nprint(n+n[-1::-1])\n", "s = input()\nfor i in reversed(range(len(s)-1)):\n s += s[i]\nprint(s)", "def solve():\r\n s = input()\r\n \r\n print(s + s[::-1])\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "s = list(input())\r\nr = s.copy()\r\nr.reverse()\r\nprint(''.join(s+r[1:]))\r\n", "line = input()\n\noutput = line + line[::-1]\n\nprint(output)", "s = input()\r\ns1 = s[::-1]\r\nprint(s + s1)", "#it is python now\ns=input()\ns1=s[::-1]\nprint(s+s1)", "n = input()\r\nif n==n[::-1]:\r\n print(n)\r\nelse:\r\n n+=n[::-1]\r\n print(n)", "def main():\r\n s = input()\r\n print(end=s)\r\n s = s[::-1]\r\n print(s, \"\\n\")\r\nmain()\r\n", "from math import sqrt\r\n\r\n\r\n\r\ndef main():\r\n d = input()\r\n print(d+\"\".join(reversed(d)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import copy\r\na = list(input())\r\nb = copy.copy(a)\r\nb.reverse()\r\nprint(\"\".join(str(i) for i in a + b))", "s = input()\r\nprint(s + ''.join(s[::-1]))\r\n", "a = input()\r\nif a == a[::-1]:\r\n print(a)\r\nelse:\r\n print(a+a[:len(a)-1][::-1])", "s = input()\r\n\r\nprint(str(s) + str(s[::-1]))\r\n", "s=input()\r\nif ''.join(reversed(s))==s:\r\n\tprint(s)\r\nelse:\r\n\ts=''.join(reversed(s))+s\r\n\tprint(s)", "s = list(input())\nt = s.copy()\nt.reverse()\ns = s + t\nprint([x for x in s], sep='')\n", "a=input();print(a+a[::-1])\n\n\n\n# Made By Mostafa_Khaled", "import math\r\n\r\n\r\ndef palindromo(mot):\r\n\r\n for n in range(math.ceil(len(mot)/2)):\r\n\r\n if mot[n] == mot[-1-n]:\r\n pass\r\n else:\r\n return False\r\n\r\n return True\r\n\r\npalabra = input()\r\npalabra2 = palabra\r\n\r\nif palindromo(palabra):\r\n print(palabra)\r\nelse:\r\n for n in range(len(palabra)-1):\r\n\r\n palabra2 = palabra2 + palabra[-n-2]\r\n\r\n print(palabra2)\r\n", "a = input()\r\nb= a+ a[::-1]\r\nprint(b)", "s = input()\nif s == s[::-1]: print(s)\nelse:\n print(s + s[::-1])\n", "s=input()\r\np=''\r\nfor i in s:\r\n p=i+p\r\nprint(s+p)", "s=input()\r\nprint(s+s[-1::-1])", "a = input()\r\nb = a + ''.join(list(reversed(a)))\r\nprint(b)\r\n", "t=input()\r\nrev = ''.join(reversed(t))\r\n\r\nif t == rev:\r\n\tprint(t)\r\nelse:\r\n\tprint(t+rev)\r\n\t\r\n\r\n\r\n\t ", "\r\nt=(input())\r\ns=t[::-1]\r\nprint(t,s,sep=\"\")", "\r\n\r\na=list(input())\r\nb=a[0:]\r\na.reverse()\r\nfor i in a:\r\n\tb.append(i)\r\nprint (''.join(b))", "def ispalindrome(s):\r\n return s == s[-1::-1]\r\n\r\nA = input()\r\n\r\nif ispalindrome(A):\r\n\tprint(A)\r\nelif len(A) <= 10*4 / 2:\r\n\tprint(A + A[-1::-1])\r\nelse:\r\n\tn = len(s)\r\n\tp1 = n-[ispalindrome(s[:i]) for i in range(n,0,-1)].index(True)\r\n\tp2 = n-[ispalindrome(s[i:]) for i in range(1,n)].index(True)-1\r\n\tif p1 > p2:\r\n\t\tprint(s[p1:] + s)\r\n\telse:\r\n\t\tprint(s + s[n-p2-1::-1])", "def is_palin(inp):\r\n return inp == inp[::-1]\r\n\r\ndef generate(inp):\r\n if (not inp):\r\n return ''\r\n \r\n return inp[0] + generate(inp[1:]) + inp[0]\r\n\r\na = input()\r\n\r\nif (is_palin(a)):\r\n print(a)\r\nelse:\r\n print(generate(a))", "a = input()\r\nt = a\r\na = ' '.join(a)\r\na = a.split()\r\na.reverse()\r\nprint(t+''.join(a))\r\n \r\n \r\n", "def ishuiwen(x):\n if x==x[::-1]:\n return True\n else:\n return False\nif __name__=='__main__':\n a=input()\n if ishuiwen(a)==True:\n print(a)\n else:\n b=a+a[::-1]\n print(b)\n\t \t \t \t \t\t \t \t \t \t\t\t", "def rev(s):\r\n b=[]\r\n for elem in reversed(s):\r\n b.append(elem)\r\n return b\r\n\r\na=input()\r\n\r\nres=[]\r\nfor char in a:\r\n res.append(char)\r\n\r\nif(rev(res)==res):\r\n for elem in res:\r\n print(elem,end='')\r\n\r\n \r\nelse:\r\n for i in range(len(res)):\r\n if(rev(res)==res):\r\n break \r\n else:\r\n l=len(res)\r\n res.append(res[l-2i-2])\r\n\r\n\r\n\r\n for elem in res:\r\n print(elem,end='')\r\n", "s = input()\r\nn = len(s)\r\ns2 = s\r\nif n % 2 == 0:\r\n for i in range(n - 1, -1, -1):\r\n s2 += s[i]\r\nelse:\r\n for i in range(n - 2, -1, -1):\r\n s2 += s[i] \r\nprint(s2)", "s = str(input())\r\nx =\"\"\r\nfor i in range(len(s)-1,-1,-1):\r\n x+=s[i]\r\nprint(s+x)\r\n\r\n", "A = input()\r\nA_reversed = A[::-1]\r\nB = A + A_reversed\r\nprint(B)", "str1 = input() \nstr2 = str1[::-1]\nprint(str1+str2)\n\t \t\t \t\t\t \t \t\t \t\t\t\t\t\t \t \t\t", "n = input()\r\nr = n + n[::-1]\r\nprint(r)", "from pathlib import Path\r\nimport sys\r\nimport functools\r\nimport itertools\r\nimport re\r\n\r\ndef solve():\r\n # code goes here!! \r\n s = str(input())\r\n print(s,s[::-1],sep = \"\");\r\n \r\n\r\ndef main():\r\n if Path('test.inp').exists():\r\n sys.stdin = open(\"test.inp\",\"r\")\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n", "a = input()\nl1 = list(a);l2 = list(a)\nl2.reverse()\nfor i in range(len(l2)):\n l1.append(l2[i])\nfor i in range(len(l1)):\n print(l1[i],sep = '',end = '')\n\n \t \t\t \t \t\t\t\t\t \t\t \t \t\t\t", "class SuperPolindrom:\r\n def __init__(self,str):\r\n self.__str=str\r\n def IsPolindrom(self):\r\n return self.__str==self.__str[::-1]\r\n def __str__(self):\r\n return self.__str if self.IsPolindrom() else \"{0}{1}\".format(self.__str,self.__str[-2:-len(self.__str)-1:-1])\r\nprint(SuperPolindrom(input()))\r\n\r\n", "o=input()\nprint(o,o[::-1],sep='')", "a=input()\r\nprint(a+a[-1::-1])\r\n", "s = input()\r\nif s == s[::-1]:\r\n\tprint (s)\r\nelse:\r\n\tprint (s + s[::-1])", "s1 = list(input())\r\ns2 = s1[::-1]\r\nprint(''.join(s1) + ''.join(s2))\r\n", "a = str(input())\r\nprint(a + ''.join(reversed(a)))", "# cook your dish here\r\nx = input()\r\nprint(x, end=\"\")\r\nx = x[::-1]\r\nprint(x)", "s=input()\r\nt=s+s[::-1]\r\nprint(t)", "A = str(input())\nB=A[::-1]\nfor i in range(len(B)):\n A=A+B[i]\nprint(A)\n \t\t\t \t\t\t \t\t\t \t \t \t\t\t\t\t", "n=input()\r\nt=n[::-1]\r\nprint(n+t)", "s = list(input())\r\ni,j = 0,len(s)-1\r\nwhile i<j:\r\n if s[i] == s[j]:\r\n i+=1\r\n j-=1\r\n else:\r\n s.insert(j+1,s[i])\r\n i+=1\r\nprint(''.join(s))", "s = input()\r\n\r\nprint(s + \"\".join(list(reversed(s))))", "s=str(input())\r\nrev=s[::-1]\r\nprint(s+rev)", "a = list(str(input()))\r\nb = []\r\nfor i in range(len(a)):\r\n b.append(a[i])\r\n b.append(a[-i-1])\r\nprint(''.join(b))", "\nimport sys\nimport os\nimport math\nimport re\n\n\ns = input()\n\ns += s[::-1]\n\nprint(s)\n", "z=input()\nl=z+z[::-1]\nprint(l)\n \n \n\n\n \n\n#sdfh\n\t\t\t\t\t\t \t\t\t\t \t \t \t\t\t \t \t\t\t\t \t", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\na=str(input())\r\nprint(a+a[::-1])", "s=input()\r\nss=s[::-1]\r\ns+=ss\r\nprint(s)", "n=list(input())\r\nans=\"\"\r\nfor i in range(len(n)):\r\n ans+=n[i]\r\nn.reverse()\r\nfor i in range(len(n)):\r\n ans+=n[i]\r\nprint(ans)", "a = input()\r\nprint(a, end='')\r\nprint(a[::-1])", "str = input()\r\nprint(str + ''.join(reversed(str)))\r\n", "a = input()\r\nif len(a) * 2 <= 10 ** 4:\r\n print(a + a[::-1])\r\nelse:\r\n print(a)", "s=input()\r\ns1=s[::-1]\r\n\r\nif s1==s:\r\n\tprint(s)\r\nelse:\r\n\tp=s[:-1]\r\n\tp=p[::-1]\r\n\ts2=s+p\r\n\tprint(s2)", "s=input()\r\nk=s[::-1]\r\nprint(s+k)", "a=input()\r\nn=len(a)//2\r\nprint(a+a[len(a):0:-1]+a[0])", "x=input()\r\na=len(x)-1\r\nwhile 0<=a:\r\n x=x+x[a]\r\n a-=1\r\nprint(x)\r\n", "str = input()\r\ns1 = str[:-1]\r\ns2 = s1[::-1]\r\nprint (str + s2)", "a = input()\nif a == a[::-1]:\n print(a)\nelse:\n print(a[::-1] + a)\n", "a = input().strip()\nb = list(a[:])\nb.reverse()\nprint(a+\"\".join(b))\n", "s=input()\r\nl=len(s)\r\nt=''\r\nfor i in range(1,l+1):\r\n\tt=t+s[-i]\r\nprint(\"%s%s\"%(s,t))", "s = str(input())\r\nprint(end = s)\r\nfor j in range(len(s) - 1, -1, -1):\r\n print(end = s[j])\r\n", "a = input()\r\nprint(a+a[::-1]) #take all the values but do it reversely ", "x = input()\n\nprint(x+\"\".join([x[_] for _ in range(len(x)-1,-1,-1)]))\n", "A=input()\r\nprint(A+A[::-1])", "s=input()\r\nl=list(s)\r\nl.reverse()\r\ns1=\"\".join(l)\r\nif s1 == s:\r\n\tprint(s)\r\nelse:\r\n\tprint(s+s1)", "a = list(str(input()))\r\nb = a+list(reversed(a))\r\nb = ''.join(b)\r\nprint(b)\r\n", "given = input()\r\nprint(given, given[::-1], sep = \"\")", "def check(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\n\r\ns = input().strip()\r\nt = s + s[::-1]\r\nif check(t) is not True:\r\n print(-1)\r\n exit(0)\r\nprint(t)", "a = input().strip()\nprint(a+a[::-1])\n", "import sys\r\n\r\ndef main():\r\n s = input()\r\n t = \"a\" if len(s) % 2 == 1 else \"\"\r\n print(s+t+s[::-1])\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\n\ns = sys.stdin.read().strip()\nprint(s + s[::-1])\n", "a = input()\r\nprint(a,end=\"\")\r\nfor i in range(len(a)-1,-1,-1):\r\n print(a[i],end=\"\")\r\n", " \n#!/usr/bin/python3\n\nimport sys\n\ns = sys.stdin.readline().strip()\nprint(s + s[::-1][1:])\n\nsys.exit()\n", "a = input()\r\nfor i in a:\r\n\ta = i + a\r\n\r\nprint(a)\r\n", "s=input();m=(' '.join(s)).split()\r\nn='';m=list(reversed(m))\r\nfor i in range(0,len(s)):\r\n n=n+m[i]\r\nprint(s+n)", "########################## lajsfd;ljdsakfjalkdsjflsajdf\n################### asd;lfjlksajfd\nstrlist = input()\nprint(strlist+strlist[::-1])", "# https://codeforces.com/problemset/problem/932/A\r\n\r\ns = input()\r\n\r\nprint(s+s[::-1])", "print((lambda s: s + s[::-1])(input()))", "string = list(input())\r\nz = string[::-1]\r\nif z==string:\r\n print(''.join(z))\r\nelse:\r\n lst = string[0:len(string)-1]\r\n lst = lst[::-1]\r\n string+=lst\r\n z=string.reverse()\r\n print(''.join(string))\r\n\r\n", "ls=list(map(str,input()))\nls1=ls.copy()\nfor i in range(len(ls)):\n ls1.append(ls[len(ls)-i-1])\nfor i in range(len(ls1)):\n print(ls1[i],end='')\n\t\t \t\t\t \t\t\t\t \t\t \t\t\t\t \t \t \t", "a=input()\ns=''\ns+=a\na=list(a)\ndel a[-1]\na.reverse()\na=''.join(a)\n\ns+=a\nprint(s)\n", "if __name__ == '__main__':\r\n s = input()\r\n if s == s[::-1]:\r\n print(s)\r\n else:\r\n s1 = list(s)\r\n s1.reverse()\r\n s1 = ''.join(s1)\r\n print(s,end = \"\")\r\n print(s1)", "a = input()\nb = a + a[::-1]\nprint(b)\n", "from collections import deque\r\ns = input()\r\n\r\ndef IsPall(s):\r\n valid = True\r\n for i in range(len(s)):\r\n if s[i] != s[len(s)-1-i]:\r\n valid = False\r\n break\r\n return valid\r\n \r\n\r\nif IsPall(s):\r\n print(s)\r\nelse:\r\n left = s[0:-1]\r\n right = left[::-1]\r\n print( left+s[-1]+right )\r\n ", "import sys\n\nsubStr = sys.stdin.readline().strip()\nprint(subStr+subStr[::-1])", "s = list(input())\r\nq = s[::-1]\r\nprint(s,sep=\"\",end=\"\")\r\nprint(q,sep=\"\")", "word = input()\r\nprint(word + word[::-1])", "s=input()\r\nprint(\"zrmtcl\"+s+s[::-1]+\"lctmrz\")", "a = list(input())\na.extend(a[len(a)-2::-1])\nfor i in a:\n print(i, end='')\n", "def supersecuencia(cuerda_A):\r\n A=\"\"\r\n B=\"\"\r\n c=cuerda_A[0]\r\n if len(cuerda_A)%2==0:\r\n A=cuerda_A[:len(cuerda_A)//2]\r\n B=cuerda_A[len(cuerda_A)//2:]\r\n else:\r\n A=cuerda_A[:len(cuerda_A)//2]\r\n B=cuerda_A[(len(cuerda_A)//2)+1:]\r\n if A==B[::-1]:\r\n return cuerda_A\r\n else:\r\n return c+cuerda_A+cuerda_A[::-1]+c\r\n\r\ndef main():\r\n cuerda=input()\r\n print(supersecuencia(cuerda))\r\nmain()", "actual = str(input())\r\nrev = actual[::-1]\r\nif actual == rev:\r\n print(actual)\r\nelse:\r\n substr = actual[:-1]\r\n substr = substr[::-1]\r\n print(actual+substr)", "lst_A = input()\nlst_B = lst_A[::-1]\nif lst_A == lst_B:\n print(lst_A)\nelse:\n print(lst_A + lst_B)\n\t\t \t\t\t\t \t\t \t \t \t\t \t \t \t", "s = list(input())\r\nl = s[::-1]\r\n\r\nprint(''.join(s+l))", "a = input()\nb = ''\nc = len(a)\nd = 0\nfor i in range(int(c/2)):\n if a[i] == a[c-1]:\n d+=1\nif d == int(c/2):\n print(a)\nelse:\n b = b + a\n b = b[::-1]\n b = a + b\n print(b)\n \t\t \t\t\t\t \t\t\t \t \t \t\t\t\t", "string = input()\r\n\r\nprint(string + string[::-1]\r\n)", "s= input()\r\nn= len(s)\r\nif n%2: \r\n print(s+ s[::-1])\r\nelse:\r\n print(s+ s[::-1][1:])\r\n \r\n \r\n ", "a = list(input())\r\nprint(''.join(a + a[::-1]))", "a = input()\n\nif(str(a)==str(a)[::-1]):\n print(a)\nelse:\n print(str(a)+(a[::-1]))", "a = input()\nlo, hi = 0, len(a) - 1\nwhile lo < hi:\n if a[lo] == a[hi]:\n hi -= 1\n lo += 1\nres = a[:lo] + a[lo::-1]\nprint(res)\n", "a = input()\r\nb = \"\"\r\nc = \"\"\r\ni = 0\r\nj = len(a) - 1\r\np = len(a) - 1\r\nk = len(a)\r\npali = True\r\n\r\nwhile(i < (k//2)):\r\n if(a[i] != a[j]):\r\n pali = False\r\n i += 1\r\n j -= 1\r\n\r\nif(pali == False):\r\n while(p >= 0):\r\n c = c + a[p]\r\n p -= 1\r\n\r\nb = a + c \r\n\r\nif(pali):\r\n print(a)\r\nelse:\r\n print(b)\r\n", "a= input()\r\nli1= list(a)\r\nli1.insert(-1,'x')\r\nin1= ''.join(i for i in li1)\r\nprint(in1+in1[::-1])", "a = input()\na = list(a)\nfor i in range(len(a)):\n print(a[i],end='')\na.reverse()\nfor i in range(len(a)):\n print(a[i],end='')\n \t\t \t\t \t \t\t \t \t \t \t\t", "def process(A):\r\n return A+A[::-1]\r\n\r\nA = input()\r\nprint(process(A))", "s=input()\r\ns1=''\r\nfor i in range(len(s)-2, -1, -1):\r\n s1+=s[i]\r\nprint(s+s1)", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\n\r\na=input()\r\n\r\nprint(a,end='')\r\nfor i in range(len(a)-1,-1,-1):\r\n print(a[i],end='')", "A = str(input())\nx = len(A)\ni = 0\nx = x - 1\nk = 0\nwhile x - i >= i:\n if A[x - i] == A[i]:\n i += 1\n else:\n k = 1\n break\nif k == 1:\n B = A+A[::-1]\n print(B)\nelse:\n print(A)", "import sys, math\n\n#f = open('input', 'r')\nf = sys.stdin\ns = f.readline().strip()\nprint(s+s[::-1])\n", "str=input()\nres=[]\nres.append(list(str))\nres.append(list(reversed(list(str))))\nfor i in res[0]:\n print(i,end='')\nfor i in res[1]:\n print(i,end='')\n\n \t \t\t\t \t\t\t\t\t\t \t\t \t\t\t \t\t \t", "s=input() \r\ns1=s[::-1]\r\nif s==s1:\r\n print(s)\r\nelse:\r\n s1=\"\"\r\n i=len(s)\r\n x=s[:(i-1)]\r\n x=x[::-1]\r\n s1=s+x\r\n print(s1)", "A = input();\r\nprint(A) if A == A[::-1] else print(A+A[::-1])", "line = input()\n\npal = line\nfor i in range(len(line)-2,-1,-1):\n pal += line[i]\n\nprint(pal)", "#print('Hare Krishna')\r\ndef I():\r\n return int(input())\r\ndef IL():\r\n return [int(i) for i in input().split()]\r\ndef IM():\r\n return map(int,input().split())\r\ndef IS():\r\n return input()\r\ns=IS()\r\nprint(s+s[::-1])\r\n", "a = input()\r\nl = 0\r\nif a == a[::-1]:\r\n print(a)\r\nelse:\r\n for i in range(len(a)-1,-1,-1):\r\n d = a + a[i:]\r\n if d == d[::-1]:\r\n l = 1\r\n print(d)\r\n break\r\n if l == 0:\r\n print(a + a[len(a) - 1::-1])", "s=input()\r\nb=list(s)\r\nb.reverse()\r\nd=''.join(b)\r\nprint(s+d)\r\n", "s = input()\r\nd = \"\"\r\nfor i in range(len(s) - 1, -1, -1):\r\n d += s[i]\r\nprint(s + d)", "# Problem URL: https://codeforces.com/problemset/problem/932/A\r\n\r\na = input()\r\nprint(a+\"\".join(reversed(a)))", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Feb 15 21:01:05 2018\r\n\r\n@author: DNARNAprotein\r\n\"\"\"\r\n\r\n\"\"\"\r\nCODEFORCES\r\nhttp://codeforces.com/contest/932/problem/A\r\n\"\"\"\r\n\r\ndef pikachu(a,c,n): #c is original string\r\n prefixes=[a[0:i+1] for i in range(n+1)]\r\n suffixes=[a[i:n+1] for i in range(n+1)]\r\n maxi=0\r\n for i in range(n//2):\r\n for j in suffixes:\r\n if prefixes[i]==j:\r\n maxi=i+1\r\n ans=c[maxi::][::-1]+c\r\n l=len(ans)\r\n return ((ans,l))\r\n \r\na=input()\r\nc=a\r\nb=a[::-1]+'#'+a\r\na=a+'#'+a[::-1]\r\n\r\nn=len(c2)\r\nx=pikachu(a,c,n)\r\nc=c[::-1]\r\ny=pikachu(b,c,n)\r\nif x[1]<y[1]:\r\n print(x[0])\r\nelse:\r\n print(y[0])", "ar = input()\r\nabu = len(ar) - 1\r\nwhile abu > -1:\r\n ar += ar[abu]\r\n abu -= 1\r\nprint(ar)\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n s = input()\r\n print(s + s[::-1])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = input()\r\nb = a\r\nfor i in range(len(a)):\r\n b=b+(a[len(a)-i-1])\r\nprint(b) \r\n \r\n\r\n \r\n", "x = input()\nprint(x+x[::-1])\n", "A = input()\r\nrev = A[::-1]\r\nprint( A + rev)\r\n", "#author @karngyan\r\n\r\n\r\ns=input()\r\ns=s+s[-1:-len(s)-1:-1]\r\nprint(s)\r\n\r\n ", "class SuperPolindrom:\r\n def __init__(self,str):\r\n self.__str=str\r\n def IsPolindrom(self):\r\n return self.__str==self.__str[::-1]\r\n def __str__(self):\r\n return self.__str if self.IsPolindrom() else \"{0}{1}{2}\".format(self.__str,self.__str[-2:0:-1],self.__str[0])\r\n\r\nprint(SuperPolindrom(input()))\r\n\r\n", "s = input();\r\ns1 = s;\r\nfor q in range(len(s1)):\r\n s = s + s1[len(s1) - q - 1];\r\nprint(s);", "A = input()\nnum = len(A)\nA = list(A)\nfor i in range(num):\n A.append(A[num - i - 1])\nA = \"\".join(A)\nprint(A)\n \t \t\t \t \t \t\t\t \t \t\t\t\t \t\t\t \t", "import sys\r\n# from io import StringIO\r\n#\r\n# sys.stdin = StringIO(open(__file__.replace('.py', '.in')).read())\r\n\r\ns = input()\r\n\r\nif s == s[::-1]:\r\n print(s)\r\n sys.exit()\r\n\r\nprint(s + s[::-1])", "from sys import stdin\r\nword=list(stdin.readline())\r\nword= word[:len(word)-1]\r\nreverse=word[::-1]\r\nprint(\"\".join(word)+\"\".join(reverse))", "x=input();print(x+x[::-1])\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness", "N = input()\nprint(N[::]+N[::-1])\n", "#\r\ndef solution(l1):\r\n c_out=\"\"\r\n for x in l1:\r\n c_out+=x\r\n l1.reverse()\r\n for x in l1:\r\n c_out+=x\r\n return c_out\r\ndef answer():\r\n l1 = list(input())\r\n print(solution(l1))\r\nanswer()", "s=input()\r\nprint(s,s[-1::-1],sep=\"\")", "s = input(\"\")\r\nfor i in range(len(s)-1,-1,-1):\r\n s = s+s[i]\r\nprint (s)", "#Insert characters to make palindrome.\r\ngiven = input()\r\nresult = [c for c in given]\r\n\r\nfor letter in reversed(given):\r\n result.append(letter)\r\nprint(\"\".join(result))\r\n", "from sys import stdin, stdout\r\nfrom random import randrange\r\n\r\ns = stdin.readline().strip()\r\nstdout.write(s + s[::-1])", "a = list(input())\r\nb = reversed(a)\r\nprint(a, *b, sep='')", "import sys\r\nfrom itertools import permutations\r\n#a=list(map(int,input().strip().split(' ')))\r\n#n,k,s= map(int, sys.stdin.readline().split(' '))\r\ns=str(input())\r\nsr=s[::-1]\r\nprint(s+sr)\r\n", "a = input()\r\n\r\nif a == a[::-1]:\r\n print(a)\r\nelse:\r\n print(a + a[-2::-1])\r\n", "a = input()\r\nb = a[:-1]\r\nb = list(b)\r\n\r\nwhile (a != a[::-1]):\r\n a += b.pop()\r\n \r\nprint(a)\r\n", "def palindromeSupersequence(s):\r\n return s + s[::-1]\r\n\r\ns = input()\r\nprint(palindromeSupersequence(s))", "a = input()\r\nb = \"\"\r\nfor i in range(len(a) - 1,-1,-1):\r\n b += a[i]\r\nprint(a + b)", "\r\n\r\n\r\n\r\nn = input()\r\n\r\n\r\nif n==n[::-1]:\r\n print(n)\r\nelse:\r\n\r\n print(n+n[::-1])\r\n", "A = input()\r\ntemp = A[1:len(A)][::-1]\r\nA = temp + A\r\nprint(A)", "def is_palindromic(x):\r\n\r\n p = len(x)\r\n q = int(p/2)\r\n count = 0\r\n\r\n for i in range(0, q):\r\n if x[i] == x[p-1-i]:\r\n count += 1\r\n else:\r\n pass\r\n\r\n if (count) == (p - count) or (count + 1) == (p - count):\r\n return(True)\r\n else:\r\n return(False)\r\n\r\n\r\n\r\nA = input()\r\nb = is_palindromic(A)\r\n\r\nif (b == True):\r\n print(A)\r\nelse:\r\n w = len(A) - 2\r\n for k in range(w, -1, -1):\r\n y = A[k]\r\n A = A + y\r\n print(A)\r\n", "def creat_pali(s):\r\n return s+s[::-1]\r\na=input()\r\nprint(creat_pali(a))", "A = input()\r\nprint('{}{}'.format(A, A[::-1]))\r\n" ]	{"inputs": ["aba", "ab", "krnyoixirslfszfqivgkaflgkctvbvksipwomqxlyqxhlbceuhbjbfnhofcgpgwdseffycthmlpcqejgskwjkbkbbmifnurnwyhevsoqzmtvzgfiqajfrgyuzxnrtxectcnlyoisbglpdbjbslxlpoymrcxmdtqhcnlvtqdwftuzgbdxsyscwbrguostbelnvtaqdmkmihmoxqtqlxvlsssisvqvvzotoyqryuyqwoknnqcqggysrqpkrccvyhxsjmhoqoyocwcriplarjoyiqrmmpmueqbsbljddwrumauczfziodpudheexalbwpiypmdjlmwtgdrzhpxneofhqzjdmurgvmrwdotuwyknlrbvuvtnhiouvqitgyfgfieonbaapyhwpcrmehxcpkijzfiayfvoxkpa", "mgrfmzxqpejcixxppqgvuawutgrmezjkteofjbnrvzzkvjtacfxjjokisavsgrslryxfqgrmdsqwptajbqzvethuljbdatxghfzqrwvfgakwmoawlzqjypmhllbbuuhbpriqsnibywlgjlxowyzagrfnqafvcqwktkcjwejevzbnxhsfmwojshcdypnvbuhhuzqmgovmvgwiizatoxgblyudipahfbkewmuneoqhjmbpdtwnznblwvtjrniwlbyblhppndspojrouffazpoxtqdfpjuhitvijrohavpqatofxwmksvjcvhdecxwwmosqiczjpkfafqlboxosnjgzgdraehzdltthemeusxhiiimrdrugabnxwsygsktkcslhjebfexucsyvlwrptebkjhefsvfrmcqqdlanbetrgzwylizmrystvpgrkhlicfadco", "hdmasfcjuigrwjchmjslmpynewnzpphmudzcbxzdexjuhktdtcoibzvevsmwaxakrtdfoivkvoooypyemiidadquqepxwqkesdnakxkbzrcjkgvwwxtqxvfpxcwitljyehldgsjytmekimkkndjvnzqtjykiymkmdzpwakxdtkzcqcatlevppgfhyykgmipuodjrnfjzhcmjdbzvhywprbwdcfxiffpzbjbmbyijkqnosslqbfvvicxvoeuzruraetglthgourzhfpnubzvblfzmmbgepjjyshchthulxar", "fggbyzobbmxtwdajawqdywnppflkkmtxzjvxopqvliwdwhzepcuiwelhbuotlkvesexnwkytonfrpqcxzzqzdvsmbsjcxxeugavekozfjlolrtqgwzqxsfgrnvrgfrqpixhsskbpzghndesvwptpvvkasfalzsetopervpwzmkgpcexqnvtnoulprwnowmsorscecvvvrjfwumcjqyrounqsgdruxttvtmrkivtxauhosokdiahsyrftzsgvgyveqwkzhqstbgywrvmsgfcfyuxpphvmyydzpohgdicoxbtjnsbyhoidnkrialowvlvmjpxcfeygqzphmbcjkupojsmmuqlydixbaluwezvnfasjfxilbyllwyipsmovdzosuwotcxerzcfuvxprtziseshjfcosalyqglpotxvxaanpocypsiyazsejjoximnbvqucftuvdksaxutvjeunodbipsumlaymjnzljurefjg", "qyyxqkbxsvfnjzttdqmpzinbdgayllxpfrpopwciejjjzadguurnnhvixgueukugkkjyghxknedojvmdrskswiotgatsajowionuiumuhyggjuoympuxyfahwftwufvocdguxmxabbxnfviscxtilzzauizsgugwcqtbqgoosefhkumhodwpgolfdkbuiwlzjydonwbgyzzrjwxnceltqgqelrrljmzdbftmaogiuosaqhngmdzxzlmyrwefzhqawmkdckfnyyjgdjgadtfjvrkdwysqofcgyqrnyzutycvspzbjmmesobvhshtqlrytztyieknnkporrbcmlopgtknlmsstzkigreqwgsvagmvbrvwypoxttmzzsgm", "scvlhflaqvniyiyofonowwcuqajuwscdrzhbvasymvqfnthzvtjcfuaftrbjghhvslcohwpxkggrbtatjtgehuqtorwinwvrtdldyoeeozxwippuahgkuehvsmyqtodqvlufqqmqautaqirvwzvtodzxtgxiinubhrbeoiybidutrqamsdnasctxatzkvkjkrmavdravnsxyngjlugwftmhmcvvxdbfndurrbmcpuoigjpssqcortmqoqttrabhoqvopjkxvpbqdqsilvlplhgqazauyvnodsxtwnomlinjpozwhrgrkqwmlwcwdkxjxjftexiavwrejvdjcfptterblxysjcheesyqsbgdrzjxbfjqgjgmvccqcyj", "oohkqxxtvxzmvfjjxyjwlbqmeqwwlienzkdbhswgfbkhfygltsucdijozwaiewpixapyazfztksjeoqjugjfhdbqzuezbuajfvvffkwprroyivfoocvslejffgxuiofisenroxoeixmdbzonmreikpflciwsbafrdqfvdfojgoziiibqhwwsvhnzmptgirqqulkgmyzrfekzqqujmdumxkudsgexisupedisgmdgebvlvrpyfrbrqjknrxyzfpwmsxjxismgd", "gilhoixzjgidfanqrmekjelnvicpuujlpxittgadgrhqallnkjlemwazntwfywjnrxdkgrnczlwzjyeyfktduzdjnivcldjjarfzmmdbyytvipbbnjqolfnlqjpidotxxfobgtgpvjmpddcyddwdcjsxxumuoyznhpvpqccgqnuouzojntanfwctthcgynrukcvshsuuqrxfdvqqggaatwytikkitywtaaggqqvdfxrquushsvckurnygchttcwfnatnjozuounqgccqpvphnzyoumuxxsjcdwddycddpmjvpgtgbofxxtodipjqlnfloqjnbbpivtyybdmmzfrajjdlcvinjdzudtkfyeyjzwlzcnrgkdxrnjwyfwtnzawmeljknllaqhrgdagttixpljuupcivnlejkemrqnafdigjzxiohlig", "abcab", "baaaaaaa", "baaaaaa", "baaaaaaaaa", "baaaaaaaa"], "outputs": ["abaaba", "abba", "krnyoixirslfszfqivgkaflgkctvbvksipwomqxlyqxhlbceuhbjbfnhofcgpgwdseffycthmlpcqejgskwjkbkbbmifnurnwyhevsoqzmtvzgfiqajfrgyuzxnrtxectcnlyoisbglpdbjbslxlpoymrcxmdtqhcnlvtqdwftuzgbdxsyscwbrguostbelnvtaqdmkmihmoxqtqlxvlsssisvqvvzotoyqryuyqwoknnqcqggysrqpkrccvyhxsjmhoqoyocwcriplarjoyiqrmmpmueqbsbljddwrumauczfziodpudheexalbwpiypmdjlmwtgdrzhpxneofhqzjdmurgvmrwdotuwyknlrbvuvtnhiouvqitgyfgfieonbaapyhwpcrmehxcpkijzfiayfvoxkpaapkxovfyaifzjikpcxhemrcpwhypaabnoeifgfygtiqvuoihntvuvbrlnkywutodwrmvgrumdjzqhfoenxphzrdgtwmljdm...", "mgrfmzxqpejcixxppqgvuawutgrmezjkteofjbnrvzzkvjtacfxjjokisavsgrslryxfqgrmdsqwptajbqzvethuljbdatxghfzqrwvfgakwmoawlzqjypmhllbbuuhbpriqsnibywlgjlxowyzagrfnqafvcqwktkcjwejevzbnxhsfmwojshcdypnvbuhhuzqmgovmvgwiizatoxgblyudipahfbkewmuneoqhjmbpdtwnznblwvtjrniwlbyblhppndspojrouffazpoxtqdfpjuhitvijrohavpqatofxwmksvjcvhdecxwwmosqiczjpkfafqlboxosnjgzgdraehzdltthemeusxhiiimrdrugabnxwsygsktkcslhjebfexucsyvlwrptebkjhefsvfrmcqqdlanbetrgzwylizmrystvpgrkhlicfadcoocdafcilhkrgpvtsyrmzilywzgrtebnaldqqcmrfvsfehjkbetprwlvyscuxef...", "hdmasfcjuigrwjchmjslmpynewnzpphmudzcbxzdexjuhktdtcoibzvevsmwaxakrtdfoivkvoooypyemiidadquqepxwqkesdnakxkbzrcjkgvwwxtqxvfpxcwitljyehldgsjytmekimkkndjvnzqtjykiymkmdzpwakxdtkzcqcatlevppgfhyykgmipuodjrnfjzhcmjdbzvhywprbwdcfxiffpzbjbmbyijkqnosslqbfvvicxvoeuzruraetglthgourzhfpnubzvblfzmmbgepjjyshchthulxarraxluhthchsyjjpegbmmzflbvzbunpfhzruoghtlgtearurzueovxcivvfbqlssonqkjiybmbjbzpffixfcdwbrpwyhvzbdjmchzjfnrjdoupimgkyyhfgppveltacqczktdxkawpzdmkmyikyjtqznvjdnkkmikemtyjsgdlheyjltiwcxpfvxqtxwwvgkjcrzbkxkandsekqwxpequ...", "fggbyzobbmxtwdajawqdywnppflkkmtxzjvxopqvliwdwhzepcuiwelhbuotlkvesexnwkytonfrpqcxzzqzdvsmbsjcxxeugavekozfjlolrtqgwzqxsfgrnvrgfrqpixhsskbpzghndesvwptpvvkasfalzsetopervpwzmkgpcexqnvtnoulprwnowmsorscecvvvrjfwumcjqyrounqsgdruxttvtmrkivtxauhosokdiahsyrftzsgvgyveqwkzhqstbgywrvmsgfcfyuxpphvmyydzpohgdicoxbtjnsbyhoidnkrialowvlvmjpxcfeygqzphmbcjkupojsmmuqlydixbaluwezvnfasjfxilbyllwyipsmovdzosuwotcxerzcfuvxprtziseshjfcosalyqglpotxvxaanpocypsiyazsejjoximnbvqucftuvdksaxutvjeunodbipsumlaymjnzljurefjggjferujlznjmyalmuspib...", "qyyxqkbxsvfnjzttdqmpzinbdgayllxpfrpopwciejjjzadguurnnhvixgueukugkkjyghxknedojvmdrskswiotgatsajowionuiumuhyggjuoympuxyfahwftwufvocdguxmxabbxnfviscxtilzzauizsgugwcqtbqgoosefhkumhodwpgolfdkbuiwlzjydonwbgyzzrjwxnceltqgqelrrljmzdbftmaogiuosaqhngmdzxzlmyrwefzhqawmkdckfnyyjgdjgadtfjvrkdwysqofcgyqrnyzutycvspzbjmmesobvhshtqlrytztyieknnkporrbcmlopgtknlmsstzkigreqwgsvagmvbrvwypoxttmzzsgmmgszzmttxopywvrbvmgavsgwqergikztssmlnktgpolmcbrropknnkeiytztyrlqthshvbosemmjbzpsvcytuzynrqygcfoqsywdkrvjftdagjdgjyynfkcdkmwaqhzfewry...", "scvlhflaqvniyiyofonowwcuqajuwscdrzhbvasymvqfnthzvtjcfuaftrbjghhvslcohwpxkggrbtatjtgehuqtorwinwvrtdldyoeeozxwippuahgkuehvsmyqtodqvlufqqmqautaqirvwzvtodzxtgxiinubhrbeoiybidutrqamsdnasctxatzkvkjkrmavdravnsxyngjlugwftmhmcvvxdbfndurrbmcpuoigjpssqcortmqoqttrabhoqvopjkxvpbqdqsilvlplhgqazauyvnodsxtwnomlinjpozwhrgrkqwmlwcwdkxjxjftexiavwrejvdjcfptterblxysjcheesyqsbgdrzjxbfjqgjgmvccqcyjjycqccvmgjgqjfbxjzrdgbsqyseehcjsyxlbrettpfcjdvjerwvaixetfjxjxkdwcwlmwqkrgrhwzopjnilmonwtxsdonvyuazaqghlplvlisqdqbpvxkjpovqohbarttqoqm...", "oohkqxxtvxzmvfjjxyjwlbqmeqwwlienzkdbhswgfbkhfygltsucdijozwaiewpixapyazfztksjeoqjugjfhdbqzuezbuajfvvffkwprroyivfoocvslejffgxuiofisenroxoeixmdbzonmreikpflciwsbafrdqfvdfojgoziiibqhwwsvhnzmptgirqqulkgmyzrfekzqqujmdumxkudsgexisupedisgmdgebvlvrpyfrbrqjknrxyzfpwmsxjxismgddgmsixjxsmwpfzyxrnkjqrbrfyprvlvbegdmgsidepusixegsdukxmudmjuqqzkefrzymgkluqqrigtpmznhvswwhqbiiizogjofdvfqdrfabswiclfpkiermnozbdmxieoxornesifoiuxgffjelsvcoofviyorrpwkffvvfjaubzeuzqbdhfjgujqoejsktzfzaypaxipweiawzojidcustlgyfhkbfgwshbdkzneilwwqemqblw...", "gilhoixzjgidfanqrmekjelnvicpuujlpxittgadgrhqallnkjlemwazntwfywjnrxdkgrnczlwzjyeyfktduzdjnivcldjjarfzmmdbyytvipbbnjqolfnlqjpidotxxfobgtgpvjmpddcyddwdcjsxxumuoyznhpvpqccgqnuouzojntanfwctthcgynrukcvshsuuqrxfdvqqggaatwytikkitywtaaggqqvdfxrquushsvckurnygchttcwfnatnjozuounqgccqpvphnzyoumuxxsjcdwddycddpmjvpgtgbofxxtodipjqlnfloqjnbbpivtyybdmmzfrajjdlcvinjdzudtkfyeyjzwlzcnrgkdxrnjwyfwtnzawmeljknllaqhrgdagttixpljuupcivnlejkemrqnafdigjzxiohliggilhoixzjgidfanqrmekjelnvicpuujlpxittgadgrhqallnkjlemwazntwfywjnrxdkgrnczlw...", "abcabbacba", "baaaaaaaaaaaaaab", "baaaaaaaaaaaab", "baaaaaaaaaaaaaaaaaab", "baaaaaaaaaaaaaaaab"]}	UNKNOWN	PYTHON3	CODEFORCES	316

89c2bcffb56fcdb0dba9ea994e161d20

Color Stripe

A colored stripe is represented by a horizontal row of *n* square cells, each cell is pained one of *k* colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells are of the same color. You can use any color from 1 to *k* to repaint the cells. The first input line contains two integers *n* and *k* (1<=≤<=*n*<=≤<=5·105; 2<=≤<=*k*<=≤<=26). The second line contains *n* uppercase English letters. Letter "A" stands for the first color, letter "B" stands for the second color and so on. The first *k* English letters may be used. Each letter represents the color of the corresponding cell of the stripe. Print a single integer — the required minimum number of repaintings. In the second line print any possible variant of the repainted stripe. Sample Input 6 3 ABBACC 3 2 BBB Sample Output 2 ABCACA 1 BAB

[ "n, k = map(int, input().split())\n\ns = list(input())\n\nif k > 2:\n c = set(ord(\"A\") + i for i in range(26))\n r = 0\n for i in range(1,len(s)):\n if s[i-1] == s[i]:\n r += 1\n if i + 1 < n:\n s[i] = \"A\" if \"A\" not in {s[i-1], s[i+1]} else ('B' if \"B\" not in {s[i], s[i+1]} else \"C\")\n else:\n s[i] = \"A\" if s[i-1] != \"A\" else \"B\"\n \n print(r)\n print(\"\".join(s))\n\nelse:\n x, y = \"AB\" * n, \"BA\" * n\n def check(x, y):\n return sum(x[i] != y[i] for i in range(n))\n check_1 = check(x, s)\n check_2 = check(y, s)\n z = [x,y][check_1 > check_2]\n print(min(check_1, check_2))\n print(z[:n])", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,K = map(int, input().split())\r\nchars = []\r\nfor i in range(K):\r\n chars.append(chr(ord('A')+i))\r\n\r\nans = 0\r\nS = [c for c in input()]\r\n\r\nif K==2:\r\n s1 = 'AB'*N\r\n s2 = 'BA'*N\r\n s1=s1[:N]\r\n s2=s2[:N]\r\n a1,a2=0,0\r\n for i in range(N):\r\n if s1[i]!=S[i]:\r\n a1+=1\r\n if s2[i]!=S[i]:\r\n a2+=1\r\n \r\n if a1>a2:\r\n print(a2)\r\n print(s2)\r\n else:\r\n print(a1)\r\n print(s1)\r\n exit(0)\r\n\r\n\r\nfor i in range(1,N):\r\n if S[i]==S[i-1]:\r\n tmp = [S[i]]\r\n if i+1<N:\r\n tmp.append(S[i+1])\r\n \r\n nchar = ''\r\n for c in chars:\r\n if c not in tmp:\r\n nchar=c\r\n break\r\n S[i]=nchar\r\n ans+=1\r\nprint(ans)\r\nprint(''.join(S))\r\n\r\n", "\r\nn,k = map(int,input().split())\r\ns = input()\r\nif k==2:\r\n s1 = \"AB\"*n\r\n s2 = \"BA\"*n\r\n ans1=0\r\n ans2=0\r\n for i in range(n):\r\n if s1[i]!=s[i]:\r\n ans1+=1\r\n if s2[i]!=s[i]:\r\n ans2+=1\r\n if ans1<=ans2:\r\n print(ans1)\r\n print(s1[:n])\r\n else:\r\n print(ans2)\r\n print(s2[:n])\r\n\r\nelse:\r\n s = list(s)\r\n i = 1\r\n ans = 0\r\n while i<n:\r\n if s[i]==s[i-1]:\r\n ans+=1\r\n cb = set()\r\n cb.add('A')\r\n cb.add('B')\r\n cb.add('C')\r\n if s[i-1] in cb:\r\n cb.remove(s[i-1])\r\n if i+1<n and s[i+1] in cb:\r\n cb.remove(s[i+1])\r\n s[i] = list(cb)[0]\r\n i+=1\r\n print(ans)\r\n print(\"\".join(s))", "# Read n and k\r\nn, k = map(int, input().split())\r\n\r\n# Read the stripe as a string\r\ns = list(input())\r\n\r\n# Initialize the count of repaintings\r\ncount = 0\r\n\r\nif k > 2:\r\n # Loop through the stripe\r\n for i in range(n - 1):\r\n if s[i] == s[i + 1]:\r\n count += 1\r\n # Find a new color that is different from both neighbors\r\n for new_color in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"[:k]:\r\n if (i + 2 >= n or s[i + 2] != new_color) and s[i] != new_color:\r\n s[i + 1] = new_color\r\n break\r\nelse:\r\n # Special case when k = 2\r\n count1, count2 = 0, 0\r\n s1, s2 = [], []\r\n for i in range(n):\r\n if i % 2 == 0:\r\n s1.append('A')\r\n s2.append('B')\r\n else:\r\n s1.append('B')\r\n s2.append('A')\r\n if s[i] != s1[-1]:\r\n count1 += 1\r\n if s[i] != s2[-1]:\r\n count2 += 1\r\n\r\n if count1 < count2:\r\n count = count1\r\n s = s1\r\n else:\r\n count = count2\r\n s = s2\r\n\r\n# Print the results\r\nprint(count)\r\nprint(\"\".join(s))\r\n", "n, k = map(int, input().split())\ns, rec, j = input(), [0] * n, 0\nif k == 2:\n x = 'AB' * (n // 2) + 'A' * (n % 2)\n y = 'BA' * (n // 2) + 'B' * (n % 2)\n ans = sum(1 for j in range(n) if x[j] != s[j])\n ans1 = sum(1 for j in range(n) if y[j] != s[j])\n if ans < ans1:\n print(ans)\n print(x)\n else:\n print(ans1)\n print(y)\nelse:\n while j + 1 < n:\n if s[j] == s[j + 1]:\n rec[j + 1] = 1\n j += 2\n else:\n j += 1\n b = {chr(0x41 + x) for x in range(k)}\n ans = [0] * n\n print(rec.count(1))\n for j in range(n):\n if rec[j]:\n p = set()\n if j - 1 >= 0:\n p.add(s[j - 1])\n if j + 1 < n:\n p.add(s[j + 1])\n ans[j] = (b - p).pop()\n else:\n ans[j] = s[j]\n print(''.join(ans))\n\n ", "n,k=map(int,input().split())\r\ns=list(input())\r\nif n==1:\r\n\tprint(0)\r\n\tprint(s[0])\r\n\texit()\r\nif k==2:\r\n\ta,b='A','B'\r\n\t# either it will be ababab or bababa so just check which one needs least number of modification .\r\n\tx,y=0,0\r\n\t# x : ababab, y:bababa\r\n\tfor i,item in enumerate(s):\r\n\t\tif i%2:\r\n\t\t\tif item=='A':\r\n\t\t\t\tx+=1\r\n\t\t\telse:\r\n\t\t\t\ty+=1\r\n\t\telse:\r\n\t\t\tif item=='B':\r\n\t\t\t\tx+=1\r\n\t\t\telse:\r\n\t\t\t\ty+=1\r\n\tif x>y:\r\n\t\tprint(y)\r\n\t\tprint('BA'*(n//2)+'B'*(n%2))\r\n\telse:\r\n\t\tprint(x)\r\n\t\tprint('AB'*(n//2) + 'A'*(n%2))\r\nelse:\r\n\ta,b,c='A','B','C'\r\n\tans=0\r\n\tfor i in range(1,n-1):\r\n\t\tif s[i]==s[i-1]:\r\n\t\t\tst=set([s[i-1],s[i+1]])\r\n\t\t\tif a not in st:\r\n\t\t\t\ts[i]=a\r\n\t\t\t\tans+=1\r\n\t\t\telif b not in st:\r\n\t\t\t\ts[i]=b\r\n\t\t\t\tans+=1\r\n\t\t\telse:\r\n\t\t\t\ts[i]=c\r\n\t\t\t\tans+=1\r\n\tif s[-1]==s[-2]:\r\n\t\tans+=1\r\n\t\tif s[-2]==a:\r\n\t\t\ts[-1]=b\r\n\t\telse:\r\n\t\t\ts[-1]=a\r\n\tprint(ans)\r\n\tprint(*s,sep=\"\")", "import sys\r\ninput=sys.stdin.readline\r\nn,k=map(int,input().split())\r\ns=list(input().rstrip())\r\nal=list(\"abcdefghijklmnopqrstuvwxyz\".upper())[:k]\r\nal=set(al)\r\nif k>=3:\r\n cnt=0\r\n for i in range(1,n-1):\r\n if s[i-1]==s[i]==s[i+1]:\r\n s[i]=list(al-{s[i-1]})[0]\r\n cnt+=1\r\n for i in range(1,n):\r\n if s[i]==s[i-1]:\r\n if i<n-1:\r\n s[i]=list(al-{s[i-1]}-{s[i+1]})[0]\r\n else:\r\n s[i]=list(al-{s[i-1]})[0]\r\n cnt+=1\r\n print(cnt)\r\n print(\"\".join(s))\r\nelse:\r\n s1=\"AB\"*(n//2)+\"A\"*(n%2)\r\n s2=\"BA\"*(n//2)+\"B\"*(n%2)\r\n cnt1,cnt2=0,0\r\n for i in range(n):\r\n if s[i]!=s1[i]:\r\n cnt1+=1\r\n if s[i]!=s2[i]:\r\n cnt2+=1\r\n if cnt1<cnt2:\r\n print(cnt1)\r\n print(s1)\r\n else:\r\n print(cnt2)\r\n print(s2)", "import string\n\nn, k = map(int, input().split())\ncolors = list(input())\n\nif k == 2:\n t_sequence = 'AB' * (n // 2) + 'A' * (n % 2)\n p_sequence = 'BA' * (n // 2) + 'B' * (n % 2)\n\n count_t = 0\n count_p = 0\n for i in range(n):\n if colors[i] != t_sequence[i]:\n count_t += 1\n if colors[i] != p_sequence[i]:\n count_p += 1\n\n if count_p < count_t:\n print(count_p)\n print(p_sequence)\n else:\n print(count_t)\n print(t_sequence)\nelse:\n repaint_count = 0\n for i in range(1, n):\n available_colors = list(string.ascii_uppercase)[:k]\n \n if colors[i] == colors[i - 1]:\n available_colors.remove(colors[i])\n if i + 1 < n and colors[i + 1] in available_colors:\n available_colors.remove(colors[i + 1])\n\n colors[i] = available_colors.pop()\n repaint_count += 1\n\n print(repaint_count)\n print(''.join(colors))\n\t \t \t\t \t\t \t \t\t\t\t \t \t \t\t \t", "n,k=map(int,input().split())\r\ns=input()\r\nif k==2:\r\n z1,ans1='AB'*n,0\r\n for i,c in enumerate(s):\r\n if c!=z1[i]: ans1+=1\r\n z2,ans2='BA'*n,0\r\n for i,c in enumerate(s):\r\n if c!=z2[i]: ans2+=1\r\n if ans1<ans2:\r\n print(ans1)\r\n print(z1[:n])\r\n else:\r\n print(ans2)\r\n print(z2[:n])\r\nelse:\r\n a,ans=list(s),0\r\n for i in range(n):\r\n if i==0:\r\n continue\r\n elif a[i-1]!=a[i]:\r\n continue\r\n else:\r\n for j in range(k):\r\n c=chr(65+j)\r\n if a[i]!=c:\r\n if i==n-1:\r\n break\r\n elif a[i+1]!=c:\r\n break\r\n a[i]=c\r\n ans+=1\r\n print(ans)\r\n print(''.join(a))\r\n \r\n", "n, k = list(map(int, input().split()))\ns = list(input())\n\ndef check_string(l):\n total = 0\n for x in range(len(s)):\n if s[x] != l:\n total += 1\n l = 'A' if l == 'B' else 'B'\n return total\n\ndef get_letter(l1, l2):\n v1 = min(ord(l1), ord(l2))\n v2 = max(ord(l1), ord(l2))\n\n if l1 == l2:\n if l1 == 'A':\n return 'B'\n else:\n return 'A'\n else:\n if v1 != ord('A'):\n return 'A'\n elif v1 == ord('A'):\n if v2 == ord('B'):\n return 'C'\n else:\n return 'B'\n\nchanges = 0\nif k > 2:\n for x in range(1, n):\n if s[x - 1] == s[x]:\n if x < (n - 1):\n l = get_letter(s[x], s[x+1])\n else:\n l = get_letter(s[x-1], s[x])\n \n s[x] = l\n changes += 1\n x += 1\nelse:\n vA = check_string('A')\n vB = check_string('B')\n\n if vA <= vB:\n changes = vA\n l = 'A'\n else:\n changes = vB\n l = 'B'\n\n s = []\n for _ in range(n):\n s.append(l)\n l = 'A' if l == 'B' else 'B'\n\nprint(changes)\nprint(''.join(s))\n\n\n\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\ns = list(input().rstrip())\r\nif k == 2:\r\n c = 0\r\n for i in range(n):\r\n c += (s[i] ^ i) & 1\r\n m = min(n - c, c)\r\n if 2 * c >= n:\r\n ans = [chr((i % 2) + 65) for i in range(n)]\r\n else:\r\n ans = [chr((i % 2) + 65) for i in range(1, n + 1)]\r\nelse:\r\n m = 0\r\n x = [i for i in range(65, 65 + k)]\r\n for i in range(1, n):\r\n if s[i - 1] ^ s[i]:\r\n continue\r\n m += 1\r\n for j in x:\r\n if s[i - 1] ^ j and (i + 1 == n or s[i + 1] ^ j):\r\n s[i] = j\r\n break\r\n ans = [chr(i) for i in s]\r\nprint(m)\r\nsys.stdout.write(\"\".join(ans))" ]

{"inputs": ["6 3\nABBACC", "3 2\nBBB", "1 2\nA", "1 26\nZ", "2 2\nAA", "2 2\nBA", "6 2\nAAABBB", "8 3\nAABBABBB", "10 26\nAAAAAAAAAA", "12 3\nAAABBBAAABBB", "3 2\nAAB", "3 3\nBBA", "3 3\nCCC", "8 3\nAABBCCBB", "200 2\nBABAABBABBABBABABBBABAAABABBABABBBAABBBBABBAABBABABAAAAABAABBBAAAAAAABBBABAAAABABBBAABABAABAABBBAABBABAAAABABAAAABABABBBABBBAAABAAABAAABABAAABABABBABABABBABBBABBBBBABABBBABAAABAAABAABBAABBABBBBBABBBAB", "20 2\nBBBBAAAAAABBBAAAAAAB", "20 3\nCCCCAAAAAAAAAAAAAAAA", "100 2\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB", "100 2\nBBBBBBBAAABBAAAABAABBBAABABAAABBBABBAAAABBABAAAAAAAAAAAAABAAABBBAAABAABBBBBBBABBBBAABAAABBBAABBAAAAB", "100 2\nABAAABABABAAABAAABAAABABABAAABABABAAABABABAAABAAABAAABABABAAABAAABAAABABABAAABAAABAAABABABAAABABABAA", "100 2\nABABABABABABABABABABABABABABABABABABABABABBBABABABABABABABABABABABABABABABABABABABABABABABABABABABAB", "2 3\nAA", "12 2\nBBBBABABABAB", "4 2\nAABA", "6 2\nBAABAB", "10 2\nAABABABABA", "6 2\nBBABAB", "5 2\nBBABA", "45 26\nABCDEFGHIJKLMNOOOOOPPPPPQQQQQQPPQZZZZASDASDGF", "3 2\nBBA", "4 2\nABBA", "6 2\nAABABA", "6 2\nBAAAAB", "4 2\nAABB", "7 2\nAAAABBB", "41 2\nAABAAABBBBBBAAAABBBAAAAAABBBBBBBBAAAAAAAA", "8 2\nAABABABA", "20 2\nABBABABBBABBABAAAABA", "5 2\nABBAB", "10 2\nBBABABABAB", "6 2\nABBABB"], "outputs": ["2\nABCACA", "1\nBAB", "0\nA", "0\nZ", "1\nAB", "0\nBA", "2\nABABAB", "3\nBACBABCB", "5\nBABABABABA", "4\nABABCBABABCB", "1\nBAB", "1\nABA", "1\nCAC", "4\nBACBACAB", "87\nABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB", "10\nABABABABABABABABABAB", "10\nACACBABABABABABABABA", "49\nABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB", "48\nBABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA", "17\nABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB", "1\nABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB", "1\nBA", "2\nABABABABABAB", "1\nBABA", "2\nABABAB", "1\nBABABABABA", "1\nABABAB", "1\nABABA", "10\nABCDEFGHIJKLMNOPOPOPQPQPAQAQAQAPQAZAZASDASDGF", "1\nABA", "2\nABAB", "1\nBABABA", "3\nABABAB", "2\nABAB", "3\nBABABAB", "19\nBABABABABABABABABABABABABABABABABABABABAB", "1\nBABABABA", "8\nBABABABABABABABABABA", "2\nBABAB", "1\nABABABABAB", "3\nABABAB"]}

UNKNOWN

PYTHON3

CODEFORCES

11

89f33e47241992f5c2c6cbeeaf3d4ead

Captain Marmot

Captain Marmot wants to prepare a huge and important battle against his enemy, Captain Snake. For this battle he has *n* regiments, each consisting of 4 moles. Initially, each mole *i* (1<=≤<=*i*<=≤<=4*n*) is placed at some position (*x**i*,<=*y**i*) in the Cartesian plane. Captain Marmot wants to move some moles to make the regiments compact, if it's possible. Each mole *i* has a home placed at the position (*a**i*,<=*b**i*). Moving this mole one time means rotating his position point (*x**i*,<=*y**i*) 90 degrees counter-clockwise around it's home point (*a**i*,<=*b**i*). A regiment is compact only if the position points of the 4 moles form a square with non-zero area. Help Captain Marmot to find out for each regiment the minimal number of moves required to make that regiment compact, if it's possible. The first line contains one integer *n* (1<=≤<=*n*<=≤<=100), the number of regiments. The next 4*n* lines contain 4 integers *x**i*, *y**i*, *a**i*, *b**i* (<=-<=104<=≤<=*x**i*,<=*y**i*,<=*a**i*,<=*b**i*<=≤<=104). Print *n* lines to the standard output. If the regiment *i* can be made compact, the *i*-th line should contain one integer, the minimal number of required moves. Otherwise, on the *i*-th line print "-1" (without quotes). Sample Input 4 1 1 0 0 -1 1 0 0 -1 1 0 0 1 -1 0 0 1 1 0 0 -2 1 0 0 -1 1 0 0 1 -1 0 0 1 1 0 0 -1 1 0 0 -1 1 0 0 -1 1 0 0 2 2 0 1 -1 0 0 -2 3 0 0 -2 -1 1 -2 0 Sample Output 1 -1 3 3

[ "n = int(input())\r\ndef all_angles(x, y, a, b):\r\n ret = [\r\n (a - x) + (b - y) * 1j\r\n ]\r\n for i in range(3):ret.append(ret[-1] * 1j)\r\n ret = [i + a + b * 1j for i in ret]\r\n ret = ret\r\n return ret[2:] + ret[:2]\r\ndef is_square(a, b, c, d):\r\n lines = [a - b, a - c, a - d, b - c, b - d, c - d]\r\n sectors = []\r\n for i in lines:\r\n sectors.append(round(i.real ** 2 + i.imag ** 2))\r\n sectors.sort()\r\n return all([sectors[0] == sectors[1],\r\n sectors[1] == sectors[2],\r\n sectors[2] == sectors[3],\r\n sectors[4] == 2 * sectors[0],\r\n sectors[5] == 2 * sectors[0],\r\n sectors[0] != 0])\r\nfor i in range(n):\r\n mas = [all_angles(*list(map(int, input().split()))).copy() for i in range(4)]\r\n ret = -1\r\n p1 = 0\r\n for i1 in mas[0]:\r\n p2 = 0\r\n for i2 in mas[1]:\r\n p3 = 0\r\n for i3 in mas[2]:\r\n p4 = 0\r\n for i4 in mas[3]:\r\n if is_square(i1, i2, i3, i4):\r\n if ret == -1:\r\n ret = p1 + p2 + p3 + p4\r\n else:\r\n ret = min(ret, p1 + p2 + p3 + p4)\r\n p4 += 1\r\n p3 += 1\r\n p2 += 1\r\n p1 += 1\r\n print(ret)\r\n", "def distance(x1, y1, x2, y2):\r\n return (x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)\r\ndef isSquare(x1, y1, x2, y2, x3, y3, x4, y4):\r\n d1 = distance(x1, y1, x2, y2)\r\n d2 = distance(x1, y1, x3, y3)\r\n d3 = distance(x1, y1, x4, y4)\r\n if d1 == 0 or d2 == 0 or d3 == 0:\r\n return False\r\n if (d1 == d2 and d3 == 2*d2) and (distance(x4, y4, x2, y2) == d1 and distance(x2, y2, x3, y3) == 2*d2):\r\n return True\r\n if (d1 == d3 and d2 == 2*d1) and (distance(x2, y2, x3, y3) == d1 and distance(x2, y2, x4, y4) == 2*d1):\r\n return True\r\n if (d2 == d3 and d1 == 2*d2) and (distance(x2, y2, x3, y3) == d2 and distance(x3, y3, x4, y4) == 2*d2):\r\n return True\r\n return False\r\ndef solve(ans, v):\r\n if len(v) == 4:\r\n ans.append(v.copy())\r\n return\r\n for i in range(4):\r\n v.append(i)\r\n solve(ans, v)\r\n v.pop()\r\nn = int(input())\r\nans = []\r\nv = []\r\nsolve(ans, v)\r\nwhile n > 0:\r\n arr = []\r\n for i in range(4):\r\n row = list(map(int, input().split()))\r\n arr.append(row)\r\n val = float('inf')\r\n flag = False\r\n for i in range(len(ans)):\r\n temp = [[0] * 2 for _ in range(4)]\r\n r = 0\r\n for j in range(4):\r\n if ans[i][j] == 0:\r\n temp[j][0] = arr[j][0]\r\n temp[j][1] = arr[j][1]\r\n elif ans[i][j] == 1:\r\n temp[j][0] = (-1) * (arr[j][1] - arr[j][3]) + arr[j][2]\r\n temp[j][1] = arr[j][0] - arr[j][2] + arr[j][3]\r\n elif ans[i][j] == 2:\r\n temp[j][0] = (-1) * (arr[j][0] - arr[j][2]) + arr[j][2]\r\n temp[j][1] = (-1) * (arr[j][1] - arr[j][3]) + arr[j][3]\r\n elif ans[i][j] == 3:\r\n temp[j][0] = arr[j][1] - arr[j][3] + arr[j][2]\r\n temp[j][1] = (-1) * (arr[j][0] - arr[j][2]) + arr[j][3] \r\n r += ans[i][j] \r\n if isSquare(temp[0][0], temp[0][1], temp[1][0], temp[1][1], temp[2][0], temp[2][1], temp[3][0], temp[3][1]):\r\n flag = True\r\n val = min(val, r)\r\n if not flag:\r\n print(-1)\r\n else:\r\n print(val)\r\n n -= 1# 1691666203.9581006", "import sys\nimport threading\nfrom random import randint, shuffle\nimport os\nfrom io import BytesIO, IOBase\n\nfrom collections import defaultdict, Counter, deque\nfrom math import inf, sqrt, floor\nfrom functools import lru_cache\nfrom heapq import heappop, heappush, heapify\nimport math \nfrom bisect import bisect_left, bisect_right\n\nnextInts = lambda: list(map(int, input().split()))\nnextInt = lambda: int(input())\nMod = 10**9 + 7\n\ndef dis(p1, p2):\n return (p1[1] - p2[1])**2 + (p1[0] - p2[0]) ** 2\n\ndef sort_points(points):\n base = points[0]\n points.sort(key = lambda x: dis(x, base))\n points[-1], points[-2] = points[-2], points[-1]\n\ndef check(points):\n sort_points(points)\n\n p1,p2,p3,p4 = points\n all_sides_equal = dis(p1, p2) == dis(p2,p3) == dis(p3,p4) == dis(p4, p1)\n dig1 = dis(p1, p3)\n dig2 = dis(p2, p4)\n return all_sides_equal and dig1 == 2*dis(p1,p2) and dig1 == dig2 and dig1 > 0\n\ndef a_rotate(row):\n x,y,a,b = row\n x,y = (a - b + y, a + b - x)\n return [x,y, a,b]\n\ndef solve(rows, i):\n \n if check([(x,y) for x,y,_,_ in rows]):\n return 0 \n\n if i >= len(rows):\n return inf\n\n res = solve(rows, i + 1)\n moves = 0\n for _ in range(3):\n rows[i] = rotate(rows[i])\n moves += 1\n ans = solve(rows, i + 1) + moves\n res = min(res, ans) \n\n rows[i] = rotate(rows[i])\n return res\n\ndef rotate(row):\n x, y, p, q = row \n x, y = p - (y - q), q + (x - p)\n return [x, y, p, q]\n\ndef solution():\n \n n = int(input())\n for _ in range(n):\n rows = [nextInts() for _ in range(4)]\n ans = solve(rows, 0)\n \n\n if ans < inf:\n print(ans)\n else:\n print(-1)\n\n\n \n\n\ndef main():\n\n t = 1\n #t = int(input())\n for _ in range(t):\n solution()\n\n\n\n#Fast IO Region\nBUFSIZE = 8192\nclass FastIO(IOBase):\n newlines = 0\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 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 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 def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\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\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n#print=sys.stdout.write\n\n#------------------#\n# recursion Region #\n#------------------#\n\n#sys.setrecursionlimit(10**6)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n", "n = int(input())\r\n \r\ndef isSquare(a,b,c,d):\r\n if 2*((b[0]-a[0])**2+(b[1]-a[1])**2) == 2*((c[0]-a[0])**2+(c[1]-a[1])**2) == (d[0]-a[0])**2+(d[1]-a[1])**2 == (b[0]-c[0])**2+(b[1]-c[1])**2 == 2*((d[0]-c[0])**2+(d[1]-c[1])**2) == 2*((d[0]-b[0])**2+(d[1]-b[1])**2) and a != d:\r\n return True\r\n return False\r\n \r\n \r\nfor reg in range(n):\r\n moles = []\r\n for i in range(4):\r\n moles.append([int(x) for x in input().split()])\r\n \r\n pos = []\r\n \r\n for x,y,a,b in moles:\r\n x -= a\r\n y -= b\r\n p = [(x,y)]\r\n #print(x,y,a,b)\r\n #print(x,y)\r\n for bruh in range(3):\r\n x,y = -y,x\r\n #print(x,y)\r\n p.append((x,y))\r\n pos.append([(c[0]+a, c[1]+b) for c in p])\r\n \r\n low = float('inf')\r\n \r\n for a in range(4):\r\n for b in range(4):\r\n for c in range(4):\r\n for d in range(4):\r\n points = [pos[0][a], pos[1][b], pos[2][c], pos[3][d]]\r\n points.sort()\r\n if isSquare(points[0], points[1], points[2], points[3]):\r\n low = min(low, a+b+c+d)\r\n if low == float('inf'):\r\n print(-1)\r\n else:\r\n print(low)", "def rotate(i, j): \r\n # rotating ith element of a j times and storing new coordinates into c \r\n x, y, p, q = a[i] \r\n for k in range(1, j+1):\r\n x, y = p - (y - q), q + (x - p)\r\n c[i] = x, y\r\n\r\ndef dist(i, j):\r\n # now know the distance between new position if ith and jth elements of a. \r\n x, y = c[i]\r\n p, q = c[j]\r\n return (x-p)**2 + (y-q)**2\r\n\r\ndef check(move):\r\n for i in range(4): \r\n rotate(i, move[i])\r\n p = [1,2,3] \r\n p.sort(key = lambda x: dist(0, x))\r\n d = [dist(0, x) for x in p]\r\n # get the distance between 1 and (2,3,4) and sorted them\r\n if d[0] == d[1] == d[2] / 2 and d[2] > 0: # checking the distance that two are equal and last one is double\r\n if dist(p[0],p[1])==d[2]:\r\n return True #nowcheck another diagonal distnce if they are equal then it is square\r\n else:\r\n return False \r\n else:\r\n return False\r\n\r\nn = int(input())\r\na = [0] * 4\r\nc = [0] * 4\r\nfor i in range(n):\r\n a[0] = list(map(int, input().split()))\r\n a[1] = list(map(int, input().split()))\r\n a[2] = list(map(int, input().split()))\r\n a[3] = list(map(int, input().split()))\r\n ans = 17\r\n for k in range(4):\r\n for l in range(4):\r\n for p in range(4):\r\n for q in range(4):\r\n if k + l + p + q < ans and check([k, l, p, q])==True :\r\n ans = k + l + p + q\r\n if ans ==17:\r\n print(-1)\r\n else:\r\n print(ans) ", "def r(t): t[0], t[1] = t[2] + t[3] - t[1], t[3] + t[0] - t[2]\r\nf = [(0, 0), (1, 3), (2, 15), (3, 63)]\r\nh = [(0, 1), (0, 2), (0, 3), (1, 2), (1, 3), (2, 3)]\r\ng = lambda u, v: (u[0] - v[0]) ** 2 + (u[1] - v[1]) ** 2\r\nfor i in range(int(input())):\r\n p = [list(map(int, input().split())) for j in range(4)]\r\n s = 13\r\n for q in range(256):\r\n t = sum((q >> k) & 3 for k in (0, 2, 4, 6))\r\n d = sorted(g(p[u], p[v]) for u, v in h)\r\n if 0 != d[4] == d[5] == 2 * d[0] == 2 * d[3]: s = min(s, t)\r\n for i, k in f:\r\n if q & k == k: r(p[i])\r\n print(s if s < 13 else -1)" ]

{"inputs": ["4\n1 1 0 0\n-1 1 0 0\n-1 1 0 0\n1 -1 0 0\n1 1 0 0\n-2 1 0 0\n-1 1 0 0\n1 -1 0 0\n1 1 0 0\n-1 1 0 0\n-1 1 0 0\n-1 1 0 0\n2 2 0 1\n-1 0 0 -2\n3 0 0 -2\n-1 1 -2 0", "3\n-2248 6528 -2144 6181\n-2245 6663 -2100 7054\n-4378 7068 -4061 7516\n-4274 6026 -3918 5721\n4942 -6793 5014 -6807\n3463 -5170 3112 -5181\n2870 -6992 3038 -6567\n5688 -4318 5358 -4744\n5249 7233 5016 6863\n4312 7385 4162 7383\n5965 9138 5607 8728\n4053 8349 4124 8389", "5\n1 1 0 0\n-1 1 0 0\n-1 1 0 0\n1 -1 0 0\n1 1 0 0\n-2 1 0 0\n-1 1 0 0\n1 -1 0 0\n1 1 0 0\n-1 1 0 0\n-1 1 0 0\n-1 1 0 0\n2 2 0 1\n-1 0 0 -2\n3 0 0 -2\n-1 1 -2 0\n0 1 0 0\n1 0 0 0\n-1 0 0 0\n0 -1 0 0", "1\n0 3 0 3\n3 2 3 2\n-1 0 -1 0\n2 -1 2 -1", "3\n1 0 0 0\n0 2 0 0\n-1 0 0 0\n0 -2 0 0\n1 0 0 0\n0 1 0 0\n-1 0 0 0\n0 -1 0 0\n1 2 0 0\n-1 2 0 0\n-1 -2 0 0\n1 -2 0 0", "1\n1 0 2 0\n-1 0 -2 0\n0 2 0 3\n0 -2 0 -3", "1\n1 0 0 0\n3 1 0 0\n2 3 0 0\n0 2 0 0", "1\n1 0 0 0\n0 2 0 0\n-1 0 0 0\n0 -2 0 0", "1\n1 0 2 0\n-1 0 -2 0\n0 1 0 2\n0 -1 0 -2", "2\n1 0 0 0\n0 2 0 0\n-1 0 0 0\n0 -2 0 0\n1 0 0 0\n0 1 0 0\n-1 0 0 0\n0 -1 0 0", "3\n-1 3 0 0\n3 1 0 0\n1 -3 0 0\n-3 -1 0 0\n1 1 0 0\n1 1 0 0\n1 1 0 0\n1 1 0 0\n-4 12 0 0\n-4 12 0 0\n-4 12 0 0\n-4 12 0 0", "4\n1 0 0 0\n0 2 0 0\n-1 0 0 0\n0 -2 0 0\n1 0 0 0\n0 1 0 0\n-1 0 0 0\n0 -1 0 0\n1 2 0 0\n-1 2 0 0\n-1 -2 0 0\n1 -2 0 0\n19 0 0 0\n0 20 0 0\n-19 0 0 0\n0 -20 0 0", "1\n0 0 0 0\n1 0 1 0\n1 1 1 1\n-1 0 -1 0", "1\n0 0 0 0\n1 1 1 1\n2 0 2 0\n1 -1 1 -1", "1\n1 1 1 1\n1 1 1 1\n2 2 2 2\n2 2 2 2", "1\n0 0 0 0\n0 1 0 1\n2 0 2 0\n2 1 2 1", "1\n-1 1 -9999 9999\n3 3 10000 10000\n3 -3 10000 -10000\n-1 -1 -9999 -9999", "1\n2 0 5 5\n0 1 5 5\n0 -1 5 5\n-2 0 5 5", "1\n-1 1 -9999 9999\n-1 -1 9998 9998\n-1 1 9998 -9998\n-1 -1 -9999 -9999", "1\n0 0 -1 -1\n-3 4 0 0\n2 4 0 0\n5 0 0 0", "1\n0 -1 0 -1\n2 0 2 0\n0 1 0 1\n-2 0 -2 0", "1\n2 1 0 0\n-2 1 0 0\n2 -1 0 0\n-2 -1 0 0", "1\n0 1 0 1\n0 -1 0 -1\n1 0 1 0\n-1 0 -1 0"], "outputs": ["1\n-1\n3\n3", "8\n6\n6", "1\n-1\n3\n3\n0", "0", "-1\n0\n-1", "4", "0", "-1", "0", "-1\n0", "0\n6\n6", "-1\n0\n-1\n-1", "-1", "0", "-1", "-1", "8", "-1", "8", "-1", "-1", "-1", "0"]}

UNKNOWN

PYTHON3

CODEFORCES

6

8a0c32c216a57e2b1ebcc493f38f1de4

Movie Critics

A film festival is coming up in the city N. The festival will last for exactly *n* days and each day will have a premiere of exactly one film. Each film has a genre — an integer from 1 to *k*. On the *i*-th day the festival will show a movie of genre *a**i*. We know that a movie of each of *k* genres occurs in the festival programme at least once. In other words, each integer from 1 to *k* occurs in the sequence *a*1,<=*a*2,<=...,<=*a**n* at least once. Valentine is a movie critic. He wants to watch some movies of the festival and then describe his impressions on his site. As any creative person, Valentine is very susceptive. After he watched the movie of a certain genre, Valentine forms the mood he preserves until he watches the next movie. If the genre of the next movie is the same, it does not change Valentine's mood. If the genres are different, Valentine's mood changes according to the new genre and Valentine has a stress. Valentine can't watch all *n* movies, so he decided to exclude from his to-watch list movies of one of the genres. In other words, Valentine is going to choose exactly one of the *k* genres and will skip all the movies of this genre. He is sure to visit other movies. Valentine wants to choose such genre *x* (1<=≤<=*x*<=≤<=*k*), that the total number of after-movie stresses (after all movies of genre *x* are excluded) were minimum. The first line of the input contains two integers *n* and *k* (2<=≤<=*k*<=≤<=*n*<=≤<=105), where *n* is the number of movies and *k* is the number of genres. The second line of the input contains a sequence of *n* positive integers *a*1, *a*2, ..., *a**n* (1<=≤<=*a**i*<=≤<=*k*), where *a**i* is the genre of the *i*-th movie. It is guaranteed that each number from 1 to *k* occurs at least once in this sequence. Print a single number — the number of the genre (from 1 to *k*) of the excluded films. If there are multiple answers, print the genre with the minimum number. Sample Input 10 3 1 1 2 3 2 3 3 1 1 3 7 3 3 1 3 2 3 1 2 Sample Output 31

[ "import sys\r\ninput = sys.stdin.readline\r\nfrom itertools import groupby\r\n\r\nn, k = map(int, input().split())\r\nd = [list(j)[0] for i, j in groupby(map(int, input().split()))]\r\nq = [0]*(k+1)\r\nfor i in range(len(d)):\r\n if i not in [0, len(d)-1] and d[i-1] == d[i+1]:\r\n q[d[i]] += 1\r\n q[d[i]] += 1\r\nprint(max(1, q.index(max(q))))", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\ns = [0 for i in range(k)]\r\nb = [a[0]]\r\nfor i in range(1, n):\r\n if a[i] == b[-1]:\r\n continue\r\n else:\r\n b.append(a[i])\r\ny = len(b)\r\nfor i in range(y):\r\n if i == 0 and b[i] != b[i + 1]:\r\n s[a[0] - 1] += 1\r\n elif i == y - 1 and b[i] != b[i - 1]:\r\n s[b[y - 1] - 1] += 1\r\n else:\r\n if b[i - 1] == b[i + 1]:\r\n s[b[i] - 1] += 2\r\n else:\r\n s[b[i] - 1] += 1\r\nx = max(s)\r\nprint(s.index(x) + 1)", "__author__ = 'Michael Ilyin'\r\n\r\n\r\ndef prepare(a):\r\n na = []\r\n last = 0\r\n for i in range(0, len(a)):\r\n if last != a[i]:\r\n na.append(a[i])\r\n last = a[i]\r\n return na\r\n\r\n\r\nheader = input()\r\nfilms = int(header[:header.find(' ')])\r\ngenres = int(header[header.find(' '):])\r\nnumbers = [int(x) for x in input().split()]\r\nres = [[genre, 0] for genre in range(1, genres + 1)]\r\nnumbers = prepare(numbers)\r\nfilms = len(numbers)\r\n\r\nfor i, obj in enumerate(numbers):\r\n if i == 0:\r\n res[obj - 1][1] += 1\r\n continue\r\n if i == films - 1:\r\n res[obj - 1][1] += 1\r\n continue\r\n if numbers[i - 1] == numbers[i + 1]:\r\n res[obj - 1][1] += 2\r\n else:\r\n res[obj - 1][1] += 1\r\nres = sorted(res, key=lambda x: x[0], reverse=False)\r\nres = sorted(res, key=lambda x: x[1], reverse=True)\r\nprint(str(res[0][0]))", "n,k = map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nans=[]\r\nfreq=[0]*(k+1)\r\nfor i in range(n-1):\r\n if lis[i]!=lis[i+1]:\r\n ans.append(lis[i])\r\nif lis[-1]!=ans[-1]:\r\n ans.append(lis[-1])\r\n#print(ans,freq)\r\nl=len(ans)\r\nfor i in range(1,l-1):\r\n if ans[i-1]==ans[i+1]:\r\n freq[ans[i]]+=2\r\n else:\r\n freq[ans[i]]+=1\r\nfreq[ans[-1]]+=1\r\nfreq[ans[0]]+=1 \r\nprint(freq.index(max(freq))) \r\n \r\n\r\n\r\n", "import sys\n\ndef solve():\n n, k = map(int, input().split())\n bada = list(map(int, input().split()))\n a = list()\n for i in range(len(bada)):\n if len(a) > 0 and bada[i] == a[-1]: continue\n a.append(bada[i])\n bad = [0] * (k + 1)\n for i, val in enumerate(a):\n if i + 1 >= len(a) and i == 0: continue\n if i + 1 >= len(a):\n bad[val] += 1\n elif i == 0:\n bad[val] += 1\n else:\n before = a[i-1]\n after = a[i+1]\n bad[val] += 2 if before == after else 1\n which = -1\n howmany = -1\n for i in range(len(bad)):\n if bad[i] > howmany:\n which = i\n howmany = bad[i]\n print(which)\n\n\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nsolve()", "def findMininumStress (newMovies, k):\n stress = 0\n\n for i in range(len(newMovies)):\n if i < len(newMovies) - 1:\n if newMovies[i] != newMovies[i + 1]:\n stress = stress + 1\n\n fewerStresses = [stress] * k\n minimumValue = stress\n minimumPosition = 0\n\n for i in range(len(newMovies)):\n if i > 0 and i < len(newMovies) - 1:\n if newMovies[i - 1] != newMovies[i + 1]:\n fewerStresses[newMovies[i] - 1] = fewerStresses[newMovies[i] - 1] - 1\n else:\n fewerStresses[newMovies[i] - 1] = fewerStresses[newMovies[i] - 1] - 2\n else:\n fewerStresses[newMovies[i] - 1] = fewerStresses[newMovies[i] - 1] - 1\n\n for i in range(k):\n if fewerStresses[i] < minimumValue:\n minimumValue = fewerStresses[i]\n minimumPosition = i + 1\n \n print(minimumPosition)\n\ndef excludeConsecutiveRepetitions(n, movies, newMovies):\n for i in range(n):\n if i < n - 2:\n if movies[i] != movies[i + 1]:\n newMovies.append(movies[i])\n elif i == n - 2:\n if movies[i] != movies[i+1]:\n newMovies.append(movies[i])\n newMovies.append(movies[i + 1])\n else:\n newMovies.append(movies[i])\n\n\nif __name__ == '__main__':\n n, k = map(int, input().split())\n movies = list(map(int, input().split()))\n\n newMovies = []\n\n excludeConsecutiveRepetitions(n, movies, newMovies)\n\n findMininumStress (newMovies, k)\n \n", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(1,n):\r\n if a[i]!=a[i-1]:\r\n b.append(a[i-1])\r\nb.append(a[-1])\r\nc=[0]*k\r\nfor i in range(len(b)-2):\r\n if b[i]==b[i+2]:\r\n c[b[i+1]-1]+=2\r\n else:\r\n c[b[i+1]-1]+=1\r\nj=0\r\nc[b[0]-1]+=1\r\nc[b[-1]-1]+=1\r\nfor i in range(k):\r\n if c[i]>c[j]:\r\n j=i\r\nprint(j+1)", "num_days, num_genres = map(int, input().split())\nschedule = list(map(int, input().split()))\n\ncompressed = []\ncurrent = schedule[0]\npos = 1\nwhile True:\n compressed.append(current)\n while pos < num_days and schedule[pos] == current:\n pos += 1\n if pos < num_days:\n current = schedule[pos]\n else:\n break\n\nscore = (num_genres + 1) * [ 0 ]\nscore[compressed[0]] += 1\nfor i in range(2, len(compressed)):\n score[compressed[i - 1]] += 1\n if compressed[i - 2] == compressed[i]:\n score[compressed[i - 1]] += 1\nscore[compressed[len(compressed) - 1]] += 1\n\nbest_score, best_genre = -1, -1\nfor genre in range(1, num_genres + 1):\n if score[genre] > best_score:\n best_score = score[genre]\n best_genre = genre\nprint(best_genre)\n", "n,k=map(int,input().split())\nr=list(map(int,input().split()))\ndist=[]\nans=[0]*(k+1)#precomp\nfor i in range(n):\n\tif i == 0 or r[i] != r[i - 1]:\n\t\tdist.append(r[i])\n# dist = distinct\nfor i in range(len(dist)):\n\tif 0 < i < len(dist) - 1 and dist[i - 1] == dist[i + 1]:\n\t\tans[dist[i]] += 2 # removing dist[i] subtracts 2\n\telse:\n\t\tans[dist[i]] += 1\nu, v = -1, -1\nfor k in range(1, k + 1):\n\tif ans[k] > u: u, v = ans[k], k\nprint (v)", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn, k = mints()\r\na = list(mints())\r\ni = 0\r\nc = [0]*(k+1)\r\nwhile i < n:\r\n\tj = i\r\n\twhile j < n and a[j] == a[i]:\r\n\t\tj += 1\r\n\tif i - 1 >= 0:\r\n\t\tif j < n:\r\n\t\t\tif a[i-1] != a[j]:\r\n\t\t\t\tc[a[i]] += 1\r\n\t\t\telse:\r\n\t\t\t\tc[a[i]] += 2\r\n\t\telse:\r\n\t\t\tc[a[i]] += 1\r\n\telif j < n:\r\n\t\t\tc[a[i]] += 1\r\n\ti = j\r\nz = 1\r\nfor i in range(k+1):\r\n\tif c[z] < c[i]:\r\n\t\tz = i\r\nprint(z)\r\n", "n,k=map(int,input().split())\r\nlst=[*map(int,input().split())]\r\na,length=[lst[0]],0\r\nfor i,x in enumerate(lst[1:]):\r\n if x!=lst[i]:a.append(x);length+=1\r\nd={i:length for i in range(1,k+1)}\r\nd[a[0]]-=1\r\nfor i,x in enumerate(a[1:-1]):\r\n if a[i]==a[i+2]:d[x]-=2\r\n else:d[x]-=1\r\nd[a[-1]]-=1\r\nres=min(d.values())\r\nfor i,x in enumerate(d):\r\n if d[x]==res:\r\n print(x);break", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\na=[0]+a+[0]\r\ni=1 \r\ntot=0 \r\nj=1 \r\ncnt=[0]*(k+1)\r\nwhile i<=n:\r\n while j<=n and a[j]==a[i]: j+=1 \r\n tot+=1 \r\n if a[i-1]==a[j]:\r\n cnt[a[i]]+=2 #gain a strain of 2 if we remove a[i]\r\n else:\r\n cnt[a[i]]+=1 \r\n i=j \r\ntot-=1 \r\nans=tot\r\n#print(cnt)\r\nfor i in range(1,k+1):\r\n if ans>tot-cnt[i]:\r\n ans=tot-cnt[i]\r\n res=i \r\nprint(res)" ]

{"inputs": ["10 3\n1 1 2 3 2 3 3 1 1 3", "7 3\n3 1 3 2 3 1 2", "2 2\n1 2", "10 2\n1 2 2 1 1 2 1 1 2 2", "10 10\n5 7 8 2 4 10 1 3 9 6", "100 10\n6 2 8 1 7 1 2 9 2 6 10 4 2 8 7 5 2 9 5 2 3 2 8 3 7 2 4 3 1 8 8 5 7 10 2 1 8 4 1 4 9 4 2 1 9 3 7 2 4 8 4 3 10 3 9 5 7 7 1 2 10 7 7 8 9 7 1 7 4 8 9 4 1 10 2 4 2 10 9 6 10 5 1 4 2 1 3 1 6 9 10 1 8 9 1 9 1 1 7 6", "74 10\n10 5 4 7 1 9 3 5 10 7 1 4 8 8 4 1 3 9 3 3 10 6 10 4 2 8 9 7 3 2 5 3 6 7 10 4 4 7 8 2 3 10 5 10 5 10 7 9 9 6 1 10 8 9 7 8 9 10 3 6 10 9 9 5 10 6 4 3 5 3 6 8 9 3", "113 3\n1 3 2 2 1 3 1 2 2 2 3 1 1 3 1 3 3 1 2 2 1 3 2 3 3 1 3 1 1 3 3 1 2 3 3 1 3 3 2 3 3 1 1 1 1 2 3 2 2 3 3 2 3 1 3 2 1 3 2 1 1 2 2 2 2 2 1 1 3 3 2 1 1 3 2 2 1 3 1 1 1 3 3 2 1 2 2 3 3 1 3 1 2 2 1 2 2 3 3 2 3 1 3 1 1 2 3 2 3 2 3 1 3", "129 37\n15 22 28 15 30 16 11 20 4 26 14 37 29 17 15 15 14 18 1 9 16 22 13 32 5 18 25 11 6 33 33 22 17 9 1 5 27 27 37 4 6 1 3 18 11 33 6 17 2 24 23 1 1 37 35 21 21 17 18 6 31 17 29 18 10 10 30 31 8 3 25 20 34 11 12 12 24 13 5 27 20 31 28 3 36 2 4 13 14 9 33 25 4 26 36 6 2 7 15 9 20 33 24 33 28 12 23 1 28 12 29 3 35 33 26 15 3 19 1 23 23 32 2 27 11 7 36 34 36", "100 13\n1 1 9 10 6 1 12 13 9 5 3 7 3 5 2 2 10 1 3 8 9 4 4 4 2 10 12 11 1 5 7 13 4 12 5 9 3 13 5 10 7 2 1 7 2 2 4 10 3 10 6 11 13 1 4 3 8 8 9 8 13 4 4 3 7 12 5 5 8 13 1 9 8 12 12 10 4 7 7 12 1 4 3 4 9 6 4 13 10 12 10 9 8 13 13 5 6 9 7 13", "100 12\n9 12 3 3 1 3 12 12 7 9 6 5 8 12 10 7 8 3 4 8 5 9 9 10 9 7 4 5 10 7 4 1 11 6 5 9 1 2 9 9 1 10 6 8 9 10 7 9 10 3 6 4 9 12 11 10 4 4 2 12 11 8 4 9 12 6 4 7 5 1 5 2 7 4 10 2 5 6 4 2 5 8 6 9 6 4 8 6 2 11 4 12 3 1 1 11 1 6 1 10"], "outputs": ["3", "1", "1", "1", "1", "1", "10", "3", "1", "3", "9"]}

UNKNOWN

PYTHON3

CODEFORCES

12

8a19c08339325adedb08655029389065

Robot Bicorn Attack

Vasya plays Robot Bicorn Attack. The game consists of three rounds. For each one a non-negative integer amount of points is given. The result of the game is the sum of obtained points. Vasya has already played three rounds and wrote obtained points one by one (without leading zeros) into the string *s*. Vasya decided to brag about his achievement to the friends. However, he has forgotten how many points he got for each round. The only thing he remembers is the string *s*. Help Vasya to find out what is the maximum amount of points he could get. Take into account that Vasya played Robot Bicorn Attack for the first time, so he could not get more than 1000000 (106) points for one round. The only line of input contains non-empty string *s* obtained by Vasya. The string consists of digits only. The string length does not exceed 30 characters. Print the only number — the maximum amount of points Vasya could get. If Vasya is wrong and the string could not be obtained according to the rules then output number -1. Sample Input 1234 9000 0009 Sample Output 37 90 -1

[ "def find_max_score(s):\r\n n = len(s)\r\n max_score = -1\r\n for i in range(1, n):\r\n for j in range(i + 1, n):\r\n num1 = int(s[:i])\r\n num2 = int(s[i:j])\r\n num3 = int(s[j:])\r\n if (s[0] != '0' or len(s[:i]) == 1) and \\\r\n (s[i] != '0' or len(s[i:j]) == 1) and \\\r\n (s[j] != '0' or len(s[j:]) == 1):\r\n if num1 <= 10**6 and num2 <= 10**6 and num3 <= 10**6:\r\n max_score = max(max_score, num1 + num2 + num3)\r\n\r\n return max_score\r\ns = input()\r\nmax_score = find_max_score(s)\r\nprint(max_score)\r\n", "s=input()\r\nadd=[]\r\nfor i in range(1,len(s)-1):\r\n for j in range(i+1,len(s)):\r\n a=s[:i]\r\n b=s[i:j]\r\n c=s[j:]\r\n \r\n if int(a)<=1000000 and int(b)<=1000000 and int(c)<=1000000:\r\n if len(a)>1 and len(b)>1 and len(c)>1:\r\n if (len(a)>1 and int(a)>pow(10,len(a)-1)-1) and (len(b)>1 and int(b)>pow(10,len(b)-1)-1) and (len(c)>1 and int(c)>pow(10,len(c)-1)-1):\r\n add.append(int(a)+int(b)+int(c))\r\n elif len(a)>1 and len(b)==1 and len(c)==1:\r\n if int(a)>pow(10,len(a)-1)-1:\r\n add.append(int(a)+int(b)+int(c))\r\n elif len(b)>1 and len(a)==1 and len(c)==1:\r\n if int(b)>pow(10,len(b)-1)-1:\r\n add.append(int(a)+int(b)+int(c))\r\n elif len(c)>1 and len(a)==1 and len(b)==1:\r\n if int(c)>pow(10,len(c)-1)-1:\r\n add.append(int(a)+int(b)+int(c))\r\n elif len(a)>1 and len(b)>1 and len(c)==1:\r\n if int(a)>pow(10,len(a)-1)-1 and int(b)>pow(10,len(b)-1)-1:\r\n add.append(int(a)+int(b)+int(c))\r\n elif len(b)>1 and len(c)>1 and len(a)==1:\r\n if int(b)>pow(10,len(b)-1)-1 and int(c)>pow(10,len(c)-1)-1:\r\n add.append(int(a)+int(b)+int(c))\r\n elif len(c)>1 and len(a)>1 and len(b)==1:\r\n if int(c)>pow(10,len(c)-1)-1 and int(a)>pow(10,len(a)-1)-1:\r\n add.append(int(a)+int(b)+int(c))\r\n elif len(a)==1 and len(b)==1 and len(c)==1:\r\n add.append(int(a)+int(b)+int(c))\r\n \r\nif len(add)==0:\r\n print(-1)\r\nelse:\r\n b=sorted(add,reverse=True)\r\n print(b[0])\r\n \r\n\r\n ", "\ndef get_all(s):\n return ((s[:i], s[i:j], s[j:]) for i in range(1,len(s)) for j in range(i+1, len(s)))\n\ndef _map(pred, a):\n for _a in a:\n yield(pred(_a))\n\nis_in_range = lambda x : int(x) <= 1000000\nis_not_multizero = lambda x : (int(x) > 0 or len(x) == 1)\nnot_start_with_zero = lambda x : (x == '0' or (int(x) > 0 and not x.startswith('0')))\npred = lambda x : all(_map(is_in_range, x)) and all(_map(is_not_multizero, x)) and all(_map(not_start_with_zero, x))\n\ns = input('')\nres = filter(pred, get_all(s))\nx = list(_map(lambda x : sum(_map(int, x)), res))\nprint(max(x) if x else -1) \n", "# Code written for Jasnah\r\n\r\ns = input()\r\n\r\nans = -10**9\r\n\r\nfor i in range(1, len(s)):\r\n for j in range(i + 1, len(s)):\r\n candidates = []\r\n candidates.append(s[:i])\r\n candidates.append(s[i:j])\r\n candidates.append(s[-(len(s) - j):])\r\n bad = False\r\n for candidate in candidates:\r\n if len(candidate) > 1 and candidate[0] == '0':\r\n bad = True\r\n break\r\n if int(candidate) > 10**6:\r\n bad = True\r\n break\r\n if bad:\r\n continue\r\n sum = 0\r\n for candidate in candidates:\r\n sum += int(candidate)\r\n ans = max(ans, sum)\r\n\r\nif ans == -10**9:\r\n print(-1)\r\nelse:\r\n print(ans)", "s = input()\r\nres = -1\r\nfor i in range(1, len(s)):\r\n for j in range(i+1, len(s)):\r\n x = int(s[:i])\r\n y = int(s[i:j])\r\n z = int(s[j:])\r\n if s[0] == '0' and len(s[:i]) > 1:\r\n continue\r\n if s[i] == '0' and len(s[i:j]) > 1:\r\n continue\r\n if s[j] == '0' and len(s[j:]) > 1:\r\n continue\r\n if x > 1e6 or y > 1e6 or z > 1e6:\r\n continue\r\n res = max(res, x + y + z)\r\nprint(res)\r\n", "n=input()\nl=len(n)\nmini=-1\nfor i in range(1,l-1):\n\tfor j in range(1,l-1):\n \t\tk=l-i-j\n \t\tif(k>0):\n \t\t\t# print(i,i+j)\n \t\t\tt1=\"\".join(n[:i])\n \t\t\tt2=\"\".join(n[i:i+j])\n \t\t\tt3=\"\".join(n[i+j:])\n \t\t\t\t\n \t\t\tif((t1[0]==\"0\" and i>1) or (t2[0]==\"0\" and j>1) or (t3[0]==\"0\" and k>1)):\n \t\t\t\tcontinue\n \t\t\t# print(t1,t2,t3)\n \t\t\tt1=int(t1)\n \t\t\tt2=int(t2)\n \t\t\tt3=int(t3)\n \t\t\ts=t1+t2+t3\n \t\t\tif(s>mini and t1<=10**6 and t2<=10**6 and t3<=10**6 ):\n \t\t\t\tmini=s\nprint(mini)\n \n", "\r\ndef validate(x, y, z):\r\n\tif (x[0] == '0' and len(x)!=1) or (y[0] == '0' and len(y)!=1) or (z[0] == '0' and len(z)!=1):\r\n\t\treturn -1\r\n\tx, y, z = int(x), int(y), int(z)\r\n\tif x > 1000000 or y > 1000000 or z > 1000000:\r\n\t\treturn -1\r\n\treturn x + y + z\r\n\r\nans = -1\r\ns = input()\r\nn = len(s)\r\nfor i in range(n):\r\n\tfor j in range(i+1, n):\r\n\t\tfor k in range(j+1, n):\r\n\t\t\tans = max(ans, validate(s[:i+1], s[i+1:j+1], s[j+1:]))\r\n\r\nprint(ans)", "s = input()\r\ndef f(str):\r\n\tif str[0] == '0' and len(str) > 1:\r\n\t\treturn -10000000000\r\n\tif(int(str) > 10**6):\r\n\t\treturn -1000000000\r\n\treturn int(str)\r\n\r\nans = -1\r\nfor i in range(1,len(s) - 1):\r\n\tfor j in range(i+1, len(s)):\r\n\t\tif(f(s[0:i]) >= 0 and f(s[i:j]) >= 0 and f(s[j:]) >= 0):\r\n\t\t\tans = max(ans, (f(s[0:i]) + f(s[i:j]) + f(s[j:])))\r\nprint(ans)", "def convert(s):\r\n if s[0] == '0' and not len(s)==1:\r\n return -10000000000\r\n res = 0\r\n for i in s:\r\n res = res * 10 + int(i)\r\n if res > 10**6:\r\n return -1000000000\r\n return res\r\ns = input()\r\nres = -1\r\nfor i in range(1,len(s)-1):\r\n for j in range(i+1,len(s)):\r\n res = max(res,convert(s[:i])+convert(s[i:j])+convert(s[j:]))\r\nprint(res)\r\n\r\n", "s=input()\r\nans=-1\r\nfor i in range(len(s)-2):\r\n\tfor j in range(i+1, len(s)-1):\r\n\t\tx=s[:i+1]\r\n\t\ty=s[i+1:j+1]\r\n\t\tz=s[j+1:]\r\n\t\tif len(x)==len(str(int(x))) and len(y)==len(str(int(y))) and len(z)==len(str(int(z))):\r\n\t\t\tif int(x)<=1e6 and int(y)<=1e6 and int(z)<=1e6:\r\n\t\t\t\tans=max(ans, int(x)+int(y)+int(z))\r\nprint(ans)\r\n", "def test(s):\r\n if len(s)>1:\r\n if s[0]=='0':\r\n return False\r\n if int(s)>10**6:\r\n return False \r\n else:\r\n return True\r\ns=input()\r\nk=len(s)\r\nu=[-1]\r\nfor i in range(1,k):\r\n for j in range(1,k):\r\n if s[i+j:]!='':\r\n if test(s[:i]) and test(s[i:i+j]) and test(s[i+j:]):\r\n u.append(int(s[:i])+int(s[i:i+j])+int(s[i+j:]))\r\n# print(int(s[:i]),int(s[i:i+j]),int(s[i+j:]))\r\n#print(u)\r\nprint(max(u))", "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\n\r\ns = input()\r\nr = len(s)\r\nif r < 3:\r\n print(-1)\r\nelif r == 3:\r\n k = int(s[0])+int(s[1])+int(s[2])\r\n print(k)\r\nelse:\r\n k = 0\r\n for i in range(r):\r\n for j in range(i+1, r):\r\n x = s[:i]\r\n y = s[i:j]\r\n z = s[j:]\r\n if len(x) > 1 and x[0] == '0' or len(y) > 1 and y[0] == '0' or len(z) > 1 and z[0] == '0' or len(x) > 0 and int(x) > 1000000 or len(y) > 0 and int(y) > 1000000 or len(z) > 0 and int(z) > 1000000:\r\n continue\r\n if len(x) > 0 and len(y) > 0 and len(z) > 0:\r\n k = max(k, int(x)+int(y)+int(z))\r\n if k == 0:\r\n print(-1)\r\n else:\r\n print(k)\r\n", "s = input()\r\n\r\ndef valid(s):\r\n if not (s[0] == '0' and len(s) > 1) and int(s) <= 1000000:\r\n return True\r\n return False\r\n\r\nres = []\r\nfor x in range(1, len(s)):\r\n for y in range(x, len(s)):\r\n\r\n b = [x, y]\r\n\r\n num1 = s[:x]\r\n num2 = s[x:y]\r\n num3 = s[y:]\r\n\r\n if len(set(b)) != 2:\r\n continue\r\n\r\n if valid(num1) and valid(num2) and valid(num3):\r\n res.append(int(num1) + int(num2) + int(num3))\r\n\r\nif not len(res):\r\n print(-1)\r\nelse:\r\n print(max(res))\r\n\r\n\r\n\r\n", "a = input()\r\nn = len(a)\r\nfl=1\r\ntemp = 0\r\nfor x in range(n-1):\r\n x+=1\r\n for y in range(n-1-x):\r\n y+=x+1\r\n if len(a[:x]) > 1 and a[:x][0] == '0':\r\n continue \r\n a1 = int(a[:x])\r\n if a1 > 1000000:\r\n continue\r\n \r\n if len(a[x:y]) > 1 and a[x:y][0] == '0':\r\n continue \r\n b1 = int(a[x:y])\r\n if b1 > 1000000:\r\n continue\r\n \r\n if len(a[y:]) > 1 and a[y:][0] == '0':\r\n continue \r\n c1 = int(a[y:])\r\n if c1 > 1000000:\r\n continue\r\n su = a1 + b1 + c1\r\n fl=0\r\n temp=max(su,temp)\r\n\r\nif fl:\r\n print(\"-1\")\r\nelse:\r\n print(temp)", "def main():\r\n s = input()\r\n n = len(s)\r\n ans = -1\r\n for i in range(1,n):\r\n i1 = int(s[0:i])\r\n if i1>1000000:\r\n continue\r\n if str(i1)!=s[0:i]:\r\n continue\r\n for j in range(i+1,n):\r\n j1 = int(s[i:j])\r\n k1 = int(s[j:])\r\n if str(j1) != s[i:j] or str(k1) != s[j:]:\r\n continue\r\n if j1>1000000 or k1>1000000:\r\n continue\r\n ans = max(ans,i1+j1+k1)\r\n print(ans)\r\nmain()", "import sys\r\n\r\n[s] = sys.stdin.read().split()\r\n\r\ndef isvalid (s):\r\n if s == \"0\" or s==\"1000000\":\r\n return True\r\n if s[0] == '0' or len(s)>6:\r\n return False\r\n return True\r\n\r\nmx = -1\r\n\r\nfor i in range(1, len(s)):\r\n for j in range(i+1, len(s)):\r\n s1 = s[0:i]\r\n s2 = s[i:j]\r\n s3 = s[j:]\r\n\r\n if isvalid(s1) and isvalid(s2) and isvalid(s3):\r\n a = int(s1)\r\n b = int(s2)\r\n c = int(s3)\r\n mx = max(mx, a+b+c)\r\n\r\nprint(mx)\r\n", "def f(x):\r\n if x[0]=='0' and len(x)>1:\r\n return -1\r\n else:\r\n return int(x)\r\ns=input()\r\nans=-1\r\nfor i in range(1,len(s)-1):\r\n for j in range(i+1,len(s)):\r\n a=f(s[:i])\r\n b=f(s[i:j])\r\n c=f(s[j:])\r\n if a>-1 and a<=1000000 and b>-1 and b<=1000000 and c>-1 and c<=1000000:\r\n ans=max(ans,a+b+c)\r\nprint(ans)\r\n", "\nA = input()\n\nM = 10**6\n\nbest = -1\n\nfor i in range(1, len(A)):\n for j in range(i + 1, len(A)):\n #print((A[:i]), \" o \", (A[i:j]), \" o \", (A[j:]))\n #print(int(A[:i]), int(A[i:j]), int(A[j:]))\n if (A[:i] == '0' or A[0] != '0') and \\\n (A[i:j] == '0' or A[i] != '0') and \\\n (A[j:] == '0' or A[j] != '0') and \\\n int(A[:i]) <= M and int(A[i:j]) <= M and \\\n int(A[j:]) <= M:\n #print((A[:i]), \" o \", (A[i:j]), \" o \", (A[j:]))\n #print(int(A[:i]), int(A[i:j]), int(A[j:]))\n best = max([best, int(A[:i]) + int(A[i:j]) + int(A[j:])])\n\nprint(best)\n", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\ns = input()\nn = len(s)\n\n\ndef num(x):\n if len(x) > 1 and x[0] == '0':\n return 1000000000\n x = int(x)\n if x > 1000000:\n return 1000000000\n return x\n\n\nans = -1\n\n\nfor i in range(1, n-1):\n for j in range(i+1, n):\n l = s[:i]\n m = s[i:j]\n r = s[j:]\n cur = num(l) + num(m) + num(r)\n if cur < 100000000:\n ans = max(ans, cur)\n\n\nprint(ans)\n", "#!/usr/bin/env python3\n\ns = input()\nans = -1\nfor i in range(1, len(s)):\n\tfor j in range(i + 1, len(s)):\n\t\ts_ = [s[: i], s[i : j], s[j : ]]\n\t\tgood = True\n\t\tfor t in s_:\n\t\t\tif str(int(t)) != t:\n\t\t\t\tgood = False\n\t\tfor t in s_:\n\t\t\tif int(t) > 10 ** 6:\n\t\t\t\tgood = False\n\t\tif good:\n\t\t\tans = max(ans, sum(map(int, s_)))\nprint(ans)\n", "s=input()\r\na=-1\r\nfor i in range(1,len(s)-1):\r\n for j in range(i+1,len(s)):\r\n x=int(s[:i])\r\n y=int(s[i:j])\r\n z=int(s[j:])\r\n if s[0]=='0' and len(s[:i])>1:\r\n continue\r\n if s[i]=='0' and len(s[i:j])>1:\r\n continue\r\n if s[j]=='0' and len(s[j:])>1:\r\n continue\r\n if x>1e6 or y>1e6 or z>1e6:\r\n continue\r\n a=max(a,x+y+z)\r\nprint(a)\r\n", "#list(map(int,input().split()))\r\n\"\"\"for times in range(int(input())):\r\n\ts = input()\r\n\"\"\"\r\ns = input()\r\nn = len(s)\r\nmx = -1\r\nfor i in range(1,n-1):\r\n\tfor j in range(i+1,n):\r\n\t\ts1 = s[0:i]\r\n\t\ts2 = s[i:j]\r\n\t\ts3 = s[j:]\r\n\t\tif int(s1)<=1000000 and int(s2)<=1000000 and int(s3)<=1000000:\r\n\t\t\tif len(str(int(s1)))==len(s1) and len(str(int(s2)))==len(s2) and len(str(int(s3)))==len(s3):\r\n\t\t\t\tmx = max(mx,int(s1)+int(s2)+int(s3))\r\nprint(mx)\r\n\t\t\r\n\r\n\r\n\r\n\r\n", "def bad(s):\r\n if(len(s) > 1 and s[0] == '0'): return False\r\n if(int(s) > 1000000): return False\r\n return True\r\n \r\ns = input()\r\nn = len(s)\r\nans = -1\r\nfor i in range(1, n + 1):\r\n for j in range(i + 1, n):\r\n if(bad(s[:i]) and bad(s[i : j]) and bad(s[j :])):\r\n ans = max(ans, int(s[:i]) + int(s[i:j]) + int(s[j:]))\r\n \r\nprint(ans)", "def isint(strx):\r\n if strx == '0':\r\n return True\r\n if strx[0] == '0':\r\n return False\r\n return int(strx) <= 1000000\r\n \r\nmaxx = -1\r\nx = input()\r\nfor i in range(1, len(x)):\r\n for j in range(i+1, len(x)):\r\n a, b, c = x[:i], x[i:j], x[j:]\r\n if isint(a) and isint(b) and isint(c):\r\n maxx = max(maxx, int(a)+int(b)+int(c))\r\n\r\nprint(maxx)\r\n" ]

{"inputs": ["1234", "9000", "0009", "100000010000001000000", "1000000011", "9991", "1000001999", "100000010000011000000", "100000010000001000001", "102", "100", "000", "001", "090", "999999999999999999999999999999", "12345678901234567", "12635000000127683", "428595000000042345353", "48726340000000", "93246310000000", "00123456", "001234567", "0891249843934", "04234581000000", "10000000999999", "69284626624", "6061357", "1215", "5305167573651040691", "948245431759126577", "3699951264723380749", "97862382", "4073734152", "9123396793", "52027725398636318", "03990796938958", "460657644093588", "8793853284967905230", "298036933890712", "80796461750373352", "2376843019069559343", "7464340065209674219", "1551627800131899383", "20973541540356666047", "31587335978612", "744503034", "15533274860535679", "58308242321837", "9929120076123816", "623650711335", "1066168753173", "5353645507305053", "111111111111111111111111111111", "1000000999888777666", "1000001999888777666", "9998881000001777666", "9999991000000999999", "9999999999991000000", "1000000999999999999", "123", "132", "213", "231", "312", "321", "666", "012894600", "01289400", "429496729742949672974294967297", "429496729700", "429496729701", "1", "55", "99", "9991999999999999", "999199999999099", "9991990199999999", "99999900999999", "4444440044444", "0089", "00243", "008743", "0042764", "00912838", "001000000", "001000001", "12435900", "28492300", "99999900", "931863000", "23566000", "100000000", "100000100", "3246870032", "04354640947", "0734620342343", "09999990", "010000000", "010000001", "01000001000000", "1844674407370955161600", "184467440737105516141111", "1844674407371055161600", "1111111111111111111111111", "999999999999999999999", "100000110000011000001", "0018446744073709551616", "429596729610000001000", "123456789123456789123456789123", "011", "10000100001000", "091", "1234567891012131416123222443", "429496729642949672964294967296", "214748364821474836482147483648", "10000001073741824001000000", "5000000000", "999955555555555555555555", "1844674407371055161699", "99999999999999999999999999999", "009", "1844674407370955161611", "000000999", "003", "0000000009000000000", "010", "0", "000009000000", "21371283283242384239423423123", "100000010004294967300", "429596729600", "429496729510000001000000", "2147483648010000010000", "349967407479541078587181768161"], "outputs": ["37", "90", "-1", "3000000", "1000011", "109", "101000", "-1", "-1", "3", "1", "0", "1", "9", "-1", "947035", "-1", "-1", "-1", "1932463", "123456", "-1", "1735183", "1423458", "1999999", "935092", "61363", "27", "-1", "1506581", "-1", "978633", "737433", "913138", "1413743", "-1", "1105338", "-1", "1232638", "1498819", "-1", "-1", "-1", "-1", "1565978", "744537", "939616", "1006337", "323868", "773700", "981936", "1091147", "-1", "2777554", "-1", "-1", "2999998", "2999998", "2999998", "6", "6", "6", "6", "6", "6", "18", "894612", "289401", "-1", "959414", "959415", "-1", "-1", "-1", "2009989", "1999297", "2000189", "1999998", "488888", "89", "243", "8743", "42764", "912838", "1000000", "-1", "435903", "849232", "999999", "863094", "566005", "1000000", "100010", "870362", "645301", "1076963", "999999", "1000000", "1000001", "1100000", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "2", "21000", "10", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "9", "-1", "-1", "3", "-1", "1", "-1", "-1", "-1", "-1", "969314", "-1", "-1", "-1"]}

UNKNOWN

PYTHON3

CODEFORCES

24

8a2e86e2f136815a2d31168586eb8de7

Roma and Lucky Numbers

Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers. Let us remind you that lucky numbers are positive integers whose decimal representation only contains lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not. Roma's got *n* positive integers. He wonders, how many of those integers have not more than *k* lucky digits? Help him, write the program that solves the problem. The first line contains two integers *n*, *k* (1<=≤<=*n*,<=*k*<=≤<=100). The second line contains *n* integers *a**i* (1<=≤<=*a**i*<=≤<=109) — the numbers that Roma has. The numbers in the lines are separated by single spaces. In a single line print a single integer — the answer to the problem. Sample Input 3 4 1 2 4 3 2 447 44 77 Sample Output 3 2

[ "[n, k] = [int(x) for x in input().split()]\r\nL = [x for x in input().split()]\r\nc = 0\r\nfor i in L:\r\n if i.count('4') + i.count('7') <= k: c += 1\r\nprint(c)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))[:n]\r\nl1=[]\r\nfor i in l:\r\n i=str(i)\r\n p=i.count('4')\r\n q=i.count('7')\r\n l1.append(p+q)\r\nc=0\r\nfor i in l1:\r\n if i<=k:\r\n c+=1 \r\nprint(c)\r\n", "n,k = [*map(int, input().split())]\r\na = [*map(int, input().split())]\r\n\r\nprint(sum(sum(c in '47' for c in str(x))<=k for x in a))\r\n", "(n, k) = map(int, input().split(' '))\na = input().split()\n\nfor i in range(n):\n a[i] = int(a[i])\n\nnumbers = 0\n\nfor number in a:\n if len(str(number)) < k:\n numbers += 1\n else:\n numbers_of_lucky_digits = str(number).count('4') + str(number).count('7')\n if numbers_of_lucky_digits <= k:\n numbers += 1\n\nprint(numbers )", "n,k=map(int,input().split())\r\ncnt=0\r\nfor a in input().split():\r\n cnt+=a.count('4')+a.count('7')<=k\r\nprint(cnt)", "n,k = map(int,input().split())\r\nnums = list(map(str,input().split()))\r\ncnt= 0\r\nfor i in nums :\r\n total = i.count(\"7\")+i.count(\"4\")\r\n if total<=k:\r\n cnt+=1\r\n \r\nprint(cnt)", "def solve(t_id):\r\n n, k = map(int, input().split())\r\n ans = 0\r\n a = list(input().split())\r\n for i in range(n):\r\n s = a[i]\r\n if s.count('4') + s.count('7') <= k:\r\n ans += 1\r\n print(ans)\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", "def count(i):\r\n c = 0\r\n for j in str(i):\r\n if(j == '4' or j == '7'):\r\n c += 1\r\n return c\r\nn,k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nc = 0\r\nfor i in arr:\r\n if(count(i) <= k):\r\n c+=1\r\nprint(c)\r\n", "n, k = map(int, input().split())\nif n == 1:\n arr = [input()]\nelse:\n arr = input().split()\ncount = n\nfor sample in arr:\n if sample.count(\"4\")+sample.count(\"7\")>k:\n count -= 1\nprint(count)\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nj=0\r\nfor i in range(n):\r\n c=0\r\n while a[i]>0:\r\n if a[i]%10==4 or a[i]%10==7:\r\n c+=1\r\n a[i]=a[i]//10\r\n else:\r\n a[i]=a[i]//10\r\n if c<=k:\r\n j+=1\r\nprint(j)", "n, k = map(int, input().split())\r\n\r\nprint(sum((x.count('4') + x.count('7')) <= k for x in input().split()))", "\nn, k = [int(i) for i in input().split()]\n\nl = [x for x in input().split()]\n\nfor i in l:\n soma = i.count('4')+i.count('7')\n if (soma>k):\n n -= 1\n \nprint(n)\n\n", "n, k = map(int, input().split())\r\na = list(filter(lambda i: i.count('4') + i.count('7') <= k, input().split()))\r\n\r\nprint(len(a))\r\n", "n, k = map(int, input().split())\r\na = list(map(str, input().split()))\r\n\r\nans = 0\r\nfor i in range(n):\r\n cnt = 0\r\n\r\n for j in range(len(a[i])):\r\n if a[i][j] == '4' or a[i][j] == '7':\r\n cnt += 1\r\n\r\n if cnt <= k:\r\n ans += 1\r\n\r\nprint(ans)", "if __name__ == '__main__':\r\n\tn, k = [int(i) for i in input().split()]\r\n\tprint(len([i for i in input().split() if i.count('4') + i.count('7') <= k]))", "n,k=[int(x) for x in input().split()]\r\nres=0\r\nfor i in [int(x) for x in input().split()]:\r\n tmp=[int(x) for x in str(i)]\r\n if tmp.count(4)+tmp.count(7)<=k:res+=1\r\nprint(res)\r\n", "from collections import Counter\r\na=[int(k) for k in input().split()]\r\nn=a[0]\r\nk=a[1]\r\ncount=0\r\nb=[k for k in input().split()]\r\nfor i in b:\r\n c=Counter(i)\r\n if c.get(\"4\",0)+c.get(\"7\",0)<=k:\r\n count+=1\r\nprint(count)\r\n", "def check(n,k):\r\n s=str(n);\r\n c7=s.count('7');\r\n c4=s.count('4');\r\n if c4+c7>k:\r\n return False\r\n else:\r\n return True\r\n\r\nn,k=map(int,input().split());\r\nl=list(map(int,input().split()));\r\nans=0\r\nfor i in l:\r\n if check(i,k)==True :\r\n ans+=1\r\nprint(ans)\r\n", "n,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))[:n]\r\nq=rem=0\r\nfc=len(a)\r\n#print(a)\r\nfor i in range(n):\r\n #print(a)\r\n c=0\r\n rem=a[i]\r\n while(rem!=0): \r\n q=rem%10\r\n rem//=10\r\n #print(q)\r\n if(q==4 or q==7): \r\n\r\n c+=1\r\n #print(\"\\n\")\r\n \r\n #print(c)\r\n \r\n if(c>m):\r\n fc-=1\r\n#print(a)\r\nprint(fc)", "l1=[int(i) for i in input().split()]\r\nl2=[j for j in input().split()]\r\ncount=0\r\nfor k in l2:\r\n c4=k.count(\"4\")\r\n c7=k.count(\"7\")\r\n if c4+c7<=l1[-1]:\r\n count+=1\r\nprint(count)", "n , k=input().split()\nn=int(n) ; k=int(k)\na=input()\nl =a.split()\nans=0\nfor i in range(len(l)):\n y=l[i]\n c = 0\n for j in range(len(y)):\n if y[j] == '4' or y[j] == '7':\n c+=1\n if c <= k:\n ans+=1\nprint(ans)\n\t\t \t\t\t\t \t\t \t \t\t \t \t \t \t\t", "n,k=map(int,input().split())\r\narr=list(map(int,input().split(' ')))\r\nc=0\r\nfor i in arr:\r\n if((str(i).count('4'))+(str(i).count('7'))<=k):\r\n c+=1\r\nprint(c)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor s in a:\r\n if str(s).count('4') + str(s).count('7') <= k:\r\n ans += 1\r\nprint(ans)", "try:\r\n \r\n a,b=map(int,input().split())\r\n s=[int(i) for i in input().split()]\r\n \r\n count=0\r\n for i in range(a):\r\n n=s[i]\r\n k=[int(d) for d in str(n)]\r\n m=0\r\n for i in range(len(k)):\r\n if(k[i]==4 or k[i]==7 ):\r\n m=m+1\r\n if(m<=b):\r\n count=count+1\r\n \r\n print(count)\r\n \r\nexcept:\r\n pass\r\n", "def cnt(n,k):\r\n cnt = 0\r\n while n:\r\n if n%10 in (4,7):\r\n cnt+=1\r\n n = n//10\r\n return cnt <= k\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\na = list(filter(lambda x:cnt(x,k),a))\r\nprint(len(a))", "n, k = map(int,input().split())\r\na = input().split()\r\nb = 0\r\nc = []\r\nd = 0\r\nfor i in range(n):\r\n a2 = int(a[i])\r\n for j in range(len(str(a2))):\r\n if len(str(a2)) == 1:\r\n if a2 == 4 or a2 == 7:\r\n b += 1\r\n else:\r\n a3 = str(a2)\r\n if a3[j] == '4' or a3[j] == '7':\r\n b += 1\r\n c.append(b)\r\n b = 0\r\nfor i in range(len(c)):\r\n if c[i] <= k:\r\n d += 1\r\nprint(d)", "# 3 4\r\n# 1 2 4\r\nnk = input().split()\r\nn, k = nk[0], nk[1]\r\n# print(n, k)\r\narrofnums = []\r\nanswercount = 0\r\n[arrofnums.append(i) for i in input().split()]\r\nfor i in range(len(arrofnums)):\r\n kcount = 0\r\n # print()\r\n for j in range(len(arrofnums[i])):\r\n # print(arrofnums[i][j])\r\n # print(type(arrofnums[i][j]))\r\n int(arrofnums[i][j])\r\n if int(arrofnums[i][j]) == 4 or int(arrofnums[i][j]) == 7:\r\n kcount += 1\r\n if kcount <= int(k):\r\n answercount += 1\r\nprint(answercount)\r\n\r\n\r\n", "n,k=map(int, input().split())\r\nl=list(input().split())\r\nc = 0\r\nfor i in l:\r\n if i.count('7') + i.count('4') <= k:\r\n c += 1\r\nprint(c) ", "n,k = map(int,input().split())\r\nsumma = 0\r\na = input().split()\r\nfor i in a:\r\n if i.count(\"4\")+i.count(\"7\")<=k:\r\n summa+=1\r\nprint(summa)", "temp = [int(x) for x in input().split()]\r\nn = temp[0]\r\nk = temp[1]\r\na = input().split()\r\nresult = 0\r\nfor x in a:\r\n if (x.count('4') + x.count('7')) <= k:\r\n result += 1\r\nprint(result)\r\n", "n,k=map(int,input().split())\r\nl=input().split()\r\nlist1=[\"4\",\"7\"]\r\nsum1=0\r\nfor i in l:\r\n\tcount=0\r\n\tfor j in range(len(i)):\r\n\t\tif i[j] in list1:\r\n\t\t\tcount+=1\r\n\tif count<=k:\r\n\t\tsum1+=1\r\nprint(sum1)", "n=list(map(int,input().split()))\r\nn1=input().split()\r\ns=0\r\nfor i in n1:\r\n if((i.count('4')+i.count('7'))<=n[1]):\r\n s=s+1\r\nprint(s)\r\n", "n,k=map(int,input().split())\na=input().split()\nout=0\nfor i in a:\n if i.count('4')+i.count('7')<=k:\n out+=1\nprint(out)\n \t \t \t\t \t \t \t\t \t \t \t \t\t\t", "n,k = map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list()\r\nans= 0\r\nfor item in a:\r\n j = str(item).count('7') + str(item).count('4')\r\n if j<=k :\r\n ans+=1\r\nprint(ans)", "n, k = map(int, input().split()) \nnumbers = list(map(int, input().split())) \n\ncnt = 0 \n\nfor num in numbers:\n lucky_digits = 0 \n \n while num > 0:\n digit = num % 10\n if digit == 4 or digit == 7:\n lucky_digits += 1\n num //= 10\n \n if lucky_digits <= k: \n cnt += 1\n\nprint(cnt) \n", "n,k = map(int,input().split())\nl = list(map(str,input().split()))\ns = 0\nfor i in l:\n temp1 = i.count('4')\n temp2 = i.count('7')\n temp = temp1+temp2\n if temp<=k:\n s += 1\nprint(s)\n \t \t \t \t \t\t \t \t \t \t", "n,k=input().split()\r\na=list(map(str,input().split()))\r\nl=[]\r\nfor i in a:\r\n if i.count('4')+i.count('7')<=int(k):l.append(i)\r\nprint(len(l))\r\n\r\n\r\n\r\n\r\n\r\n", "a, b = map(int, input().split())\r\nl = list(input().split())\r\nc = 0\r\nfor i in l:\r\n if (i.count('4') + i.count('7')) <= b:\r\n c += 1\r\nprint(c)\r\n", "x,y=map(int,input().split(' ',1))\r\narray=list(map(int,input().split(' ')))\r\nlucky=[4,7]\r\ncount=0\r\n\r\nfor i in array:\r\n kk1=0\r\n num=str(i)\r\n for x in range(len(num)):\r\n if int(num[x]) in lucky:\r\n kk1+=1\r\n if kk1<=y:\r\n count+=1\r\nprint(count)\r\n\r\n\r\n\r\n\r\n# if num[x] in lucky:\r\n # k+=1", "n,k=input().split()\n\nlst=input().split(\" \")\n#print(lst)\n\nhow_many=0\nfor x in lst:\n lucky=0\n for y in x:\n #print(y)\n if y=='4' or y=='7':\n lucky+=1\n #print(lucky)\n if lucky<=int(k):\n how_many+=1\n\nprint(how_many)\n \t\t \t \t\t\t \t\t \t \t \t\t\t\t \t \t \t\t", "def solve(n, k, arr):\r\n c = 0\r\n for x in arr:\r\n v = str(x)\r\n if v.count(\"4\") + v.count(\"7\") <= k:\r\n c += 1\r\n\r\n return c\r\n\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nprint(solve(n, k, arr))", "a, b = [int(i) for i in input().split()]\r\ncount = 0\r\nd = [i for i in input().split()]\r\nfor i in range(a):\r\n if (d[i].count('7') + d[i].count('4') <= b):\r\n count += 1\r\nprint(count)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nr=0\r\nfor i in range(n):\r\n e=str(l[i])\r\n r1=e.count('4')\r\n r2=e.count('7')\r\n if(r1+r2<=k):\r\n r=r+1\r\nprint(r)", "def main() -> None:\r\n n, k = map(int, input().split())\r\n ans = 0\r\n a = input().split()\r\n for i in range(n):\r\n ans += (a[i].count('4') + a[i].count('7')) <= k\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = map(int, input().split())\r\na = input().split()\r\ncnt = 0\r\n\r\nfor i in a:\r\n if i.count('4') + i.count('7') <= k:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "n, k = map(int,input().split())\na = [int(x) for x in input().split()]\ndef count_lucky(n):\n ans = 0\n while n>0:\n if n%10==4 or n%10==7:\n ans += 1\n n //= 10\n return ans\nresult = 0\n\nfor x in a:\n if count_lucky(x)<=k:\n result += 1\nprint(result)\n", "n,m=map(int,input().split())\nans=0\na=input().split()\nfor i in a:\n k=i.count('4')+i.count('7')\n if(k<=m):\n ans+=1\nprint(ans)\n\t\t\t\t\t \t \t \t\t \t\t\t \t \t \t \t", "n, k = map(int, input().split())\r\nnl = input().split()\r\nc = 0\r\nfor i in nl:\r\n four = i.count('4')\r\n seven = i.count('7')\r\n if (four+seven)<=k:\r\n c += 1\r\nprint(c)", "x,y=input().split()\nx=int(x)\ny=int(y)\nc=input()\nd=c.split()\ncntt=0\nfor i in range(len(d)):\n for j in range(len(d[i])):\n if (d[i])[j]==\"7\" or (d[i])[j]==\"4\":\n cntt+=1\n if cntt>y:\n x-=1\n cntt=min(cntt,0)\nprint(x)\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\naa=input()\r\naa=aa.split()\r\na=[]\r\nfor i in aa:\r\n a.append(i)\r\nc=0\r\nfor i in a:\r\n if i.count('4')+i.count('7')<=k:\r\n c+=1\r\nprint(c)", "def solve():\n n, k = [int(x) for x in input().split()]\n a = [int(x) for x in input().split()]\n ans = 0\n\n for i in range(n):\n lucky = 0\n while True:\n if a[i] == 0:\n break\n if a[i] % 10 == 4 or a[i] % 10 == 7:\n lucky += 1\n a[i] //= 10\n\n if lucky <= k:\n ans += 1\n\n print(ans)\n\n\nsolve()\n\n\t \t\t \t\t \t \t \t\t \t\t \t\t\t\t\t", "n,k=map(int,input().split())\r\nl=list(map(int,input().split())) \r\nans=0\r\nfor e in l:\r\n c=0\r\n while(e!=0):\r\n if(e%10 in [4,7]):\r\n c+=1\r\n e=e//10\r\n if(c<=k):\r\n ans+=1\r\nprint(ans) ", "n, k = map(int, input().split())\r\n\r\nt = 0\r\nfor x in input().split():\r\n t += 1 if (x.count(\"4\") + x.count(\"7\") <= k) else 0\r\nprint(t)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Aug 14 10:53:55 2023\r\n\r\n@author: pc\r\n\"\"\"\r\n\r\nn, k = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor num in numbers:\r\n lucky_digits = str(num).count('4') + str(num).count('7')\r\n if lucky_digits <= k:\r\n count += 1\r\n\r\nprint(count)\r\n", "n, k = map(int,input().split())\r\nnumbers = list(input().split())\r\nnLucky, counter = 0, 0\r\nfor i in range(n):\r\n for j in range(len(numbers[i])):\r\n if numbers[i][j] == \"4\" or numbers[i][j] == \"7\":\r\n nLucky += 1\r\n if nLucky > k:\r\n counter += 1\r\n break\r\n nLucky = 0\r\n \r\n\r\nprint(n - counter)\r\n \r\n", "import sys\ninput = sys.stdin.readline\n\nn, k = [int(i) for i in input().split()]\na = [i for i in input().split()]\nans = 0\nfor i in a:\n if i.count('4') + i.count('7') <= k:\n ans += 1\nprint(ans)\n", "k = int(input().split()[1])\r\nnums = [i for i in input().split()]\r\n\r\noutput = 0\r\n\r\nfor num in nums:\r\n if (num.count('4') + num.count('7') <= k):\r\n output += 1\r\n \r\nprint(output)", "n,k=map(int,input().split())\r\nl1=input().split()\r\ncountans=0\r\nfor i in range(n):\r\n\tj=0\r\n\tj=l1[i].count(\"7\")+l1[i].count(\"4\")\r\n\tif j<=k:\r\n\t\tcountans+=1 \r\nprint(countans)", "n,k=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\nc=0\r\nfor x in range(len(a)):\r\n d=str(a[x])\r\n #print(d)\r\n c7=d.count('7')\r\n c4=d.count('4')\r\n if c4+c7 <=k:\r\n c+=1\r\nprint(c)", "a = input().split()\r\nn = int(a[0])\r\nk = int(a[1])\r\nb = input().split()\r\nm = [int(i) for i in b]\r\nd = 0\r\nfor i in m:\r\n c = 0\r\n while i>0:\r\n j = i%10\r\n i = i//10\r\n if j==4 or j==7:\r\n c+=1\r\n if c<=k:\r\n d+=1\r\nprint(d)\r\n\r\n", "n, k = map(int, input().split())\r\nvalues = input().split()\r\nlucky_digits = [4, 7]\r\nresult = 0\r\n\r\nfor value in values:\r\n local_count = 0\r\n for digit in value:\r\n if int(digit) in lucky_digits:\r\n local_count += 1\r\n if local_count <= k :\r\n result +=1 \r\nprint(result)\r\n ", "n,k=map(int,input().split())\r\nl=list(input().split())\r\nans=0\r\nfor i in l:\r\n a=i.count('4')\r\n b=i.count('7')\r\n if (a+b)<=k:\r\n ans=ans+1\r\nprint(ans)", "x,y=input().split()\nx=int(x)\ny=int(y)\nc=input()\nd=c.split()\nact=0\nfor i in range(len(d)):\n for j in range(len(d[i])):\n if (d[i])[j]==\"7\" or (d[i])[j]==\"4\":\n act+=1\n if act>y:\n x-=1\n act=min(act,0)\nprint(x)\n\t \t \t \t \t \t\t\t\t \t\t \t\t \t\t\t\t", "a,b=map(int,input().split())\nl=list(map(str,input().split()))\ncount=0\nfor i in range(len(l)):\n if l[i].count('4')+l[i].count('7')<=b:\n count+=1\nprint(count)\n\t\t\t\t \t \t \t \t\t \t", "m,n=map(int,input().split())\r\nc=0\r\nfor i in list(input().split(\" \")):\r\n if i.count('4')+i.count('7')<=n:\r\n c+=1\r\nprint(c)\r\n", "n,k=map(int,input().split())\r\na=list(map(str,input().split()))\r\nmcnt=0\r\n\r\nfor i in a:\r\n cnt=0\r\n for word in i:\r\n if word=='4' or word=='7':\r\n cnt+=1\r\n if cnt<=k:\r\n mcnt+=1\r\nprint(mcnt)", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nx=k=j=int(0)\r\nwhile x<a:\r\n y=str(c[x])\r\n k=y.count(\"4\")+y.count(\"7\")\r\n if k<=b:\r\n j=j+1\r\n x=x+1\r\nprint(j)", "n, k = map(int, input().split())\ns = list(map(str, input().split()))\nsum1 = 0\nsum0 = 0\nfor i in range(n):\n if s[i].count('4') + s[i].count('7') <= k:\n sum0 = sum0 + 1\nprint(sum0)\n \t \t\t \t \t \t\t\t \t\t \t \t \t", "n, k = input().split(' ')\nns = input().split(' ')\nt = 0\nf = 0\nfor i in ns:\n\tfor j in i:\n\t\tif j == '4' or j == '7':\n\t\t\tt += 1\n\tif t <= int(k):\n\t\tf += 1\n\tt = 0\nprint(f)\n\t\t \t\t\t \t \t \t\t\t \t\t \t", "a = input().split()\r\nn = a[0]\r\nk = int(a[1])\r\nb = input().split()\r\nc = 0\r\nfor i in b:\r\n x = i.count('4') + i.count('7')\r\n if x <= k:\r\n c += 1\r\nprint(c)", "n,k=map(int,input().split())\r\nli=list(map(str,input().split()))\r\nc=0\r\nfor i in range(n):\r\n l=li[i].count('4')+li[i].count('7')\r\n if l<=k:\r\n c+=1\r\nprint(c)", "n, k = map(int, input().split())\ns = [i for i in input().split()]\ntotal = 0\nfor i in range(n):\n cont = 0\n for j in s[i]:\n if j == '4' or j == '7':\n cont += 1\n if cont <= k:\n total +=1\nprint(total)\n", "z=list(map(int,input().split()))\r\nx=list(input().split())\r\nc=0\r\nfor i in x:\r\n a=i.count(\"7\")+i.count(\"4\")\r\n if a<=z[1]:\r\n c+=1\r\nprint(c)\r\n", "n,k=map(int,input().split())\r\na=input().split()\r\nc=0\r\nfor i in a:\r\n if(i.count('4')+i.count('7')<=k):\r\n c+=1\r\nprint(c)", "n,k = map(int, input(). strip(). split())\r\narray=list(map(str,input(). strip(). split()))\r\n#print(*array)\r\n#print(array[0][1])\r\ncounter = 0\r\n\r\nfor num in array:\r\n flag = 0\r\n for i in range(len(num)):\r\n if num[i] == \"4\" or num[i] == \"7\":\r\n flag = flag+1\r\n #print(\"flag is\",flag)\r\n if flag <= k :\r\n counter = counter+1\r\n\r\n\r\n\r\nprint(counter)", "n, k = list(map(int, input().split()))\na = input().split()\nprint(sum([1 for i in a if i.count('4') + i.count('7') <= k]))", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor x in a:\r\n i=str(x)\r\n if((i.count('4')+i.count('7'))<=k):\r\n c=c+1\r\nprint(c)\r\n", "n, k = map(int, input().split())\na = [int(x) for x in input().split()][:n]\nlucky = '47'\nans = 0\nfor _ in range(n):\n s = str(a[_])\n cnt = 0\n for i in range(len(s)):\n if s[i] in lucky: cnt += 1\n if i == len(s) - 1:\n if k >= cnt: ans += 1\nprint(ans)\n\t\t \t\t \t \t \t \t \t\t \t\t \t", "x,k=map(int,input().split())\r\nl=list(map(str,input().split()))\r\nc=0\r\nfor i in range(len(l)):\r\n if l[i].count('4')+l[i].count('7')<=k:\r\n c=c+1\r\nprint(c)\r\n", "n,k=map(int,input().split())\r\nl=input().split()\r\nc=0\r\nfor i in l:\r\n if i.count(\"4\")+i.count(\"7\")<=k:\r\n c=c+1\r\nprint(c)", "n, k = map(int, input().split())\r\nl = \"47\"\r\narr = input().split()\r\ncount = 0\r\nfor i in arr:\r\n temp = 0\r\n for j in i:\r\n if j in l:\r\n temp += 1\r\n if temp <= k:\r\n count += 1\r\nprint(count)\r\n", "n, k = (int(i) for i in input().split())\r\nprint(len([1 for i in input().split() if i.count('4') + i.count('7') <= k]))", "n,k=list(map(int,input().split()))\r\narr=list(input().split())\r\ncou=0\r\nfor i in range(n):\r\n c=arr[i].count(\"4\")+arr[i].count(\"7\")\r\n if c<=k:\r\n cou+=1\r\nprint(cou)\r\n", "a, b = map(int, input().split())\r\narr = list(input().split())\r\nct = 0\r\nfor n in arr:\r\n if len(n) == b:\r\n ct += 1\r\n elif n.count(\"4\") + n.count(\"7\") <= b:\r\n ct += 1\r\n\r\nprint(ct)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split(' '))\r\nl=list(input().split(' '))\r\nans=0\r\nfor x in l:\r\n s= x.count('4')+x.count('7')\r\n if(s<=k):\r\n ans+=1\r\nprint(ans)", "n , k = [int(x) for x in input().split()]\r\nins = [int(x) for x in input().split()]\r\nluckies = [4 , 7]\r\nnOfLuckies = 0\r\n\r\ndef getNumber(number , numberOfLuckies = 0):\r\n if number <= 1:\r\n return numberOfLuckies\r\n if number % 10 in luckies:\r\n numberOfLuckies += 1\r\n return getNumber(number // 10 , numberOfLuckies)\r\n\r\nfor number in ins:\r\n if getNumber(number) <= k:\r\n nOfLuckies += 1\r\n\r\nprint(nOfLuckies) ", "n , k = input().split()\nn = int(n) ; k = int(k)\na = input()\nl = a.split()\nans= 0\nfor i in range(len(l)):\n b = l[i]\n lu_di = 0\n for j in range(len(b)):\n if b[j] == '4' or b[j] == '7':\n lu_di += 1\n if lu_di <= k:\n ans += 1\nprint(ans)\n\n \t\t\t\t \t\t \t \t \t\t \t \t\t \t", "n,k = map(int,input().split())\r\ncnt=0\r\narr= map(int,input().split())\r\nfor i in arr:\r\n count=0\r\n i=str(i)\r\n count=i.count('4')\r\n count+=i.count('7')\r\n if count<=k:\r\n cnt+=1\r\nprint(cnt)", "n,k=input().split()\r\nl=input().split()\r\nc=0\r\nfor i in l:\r\n\tif i.count(\"4\")+i.count(\"7\")>int(k):\r\n\t\tc+=1\r\nprint(len(l)-c)", "n,k=map(int,input().split())\r\na='4'\r\nb='7'\r\nx=[1 if i.count('4')+i.count('7')<=k else 0 for i in input().split()]\r\nprint(x.count(1))", "def CountLuckyNumbers(s):\r\n result = 0\r\n for i in s:\r\n if i in \"47\":\r\n result += 1\r\n return result\r\n\r\nn, k = input().split()\r\nn, k = int(n), int(k)\r\nl = list(map(int, input().split()))\r\nr = 0\r\nfor i in l:\r\n #print(CountLuckyNumbers(str(i)))\r\n if CountLuckyNumbers(str(i)) <= k:\r\n r += 1\r\nprint(r)", "n,k=map(int,input().split())\r\na=list(map(str,input().split()))\r\nans=0\r\nfor i in range(0,n):\r\n\tt=a[i]\r\n\tj=t.count(\"4\")+t.count(\"7\")\r\n\tif j<=k:\r\n\t\tans+=1\r\nprint(ans)", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nl=list(map(int, input().split()))\r\ncount=int(0)\r\nfor i in l:\r\n nold=int(0)\r\n l=[]\r\n while i>0:\r\n a=i%10\r\n l.append(a)\r\n i=i//10\r\n for j in l:\r\n if j==7 or j==4:\r\n nold+=1\r\n if nold<=k:\r\n count+=1\r\nprint(count)", "x,y= input().split()\nx=int(x)\ny=int(y)\nc=input()\nd=c.split()\ncnt=0\nfor i in range (len(d)):\n for j in range (len(d[i])):\n if (d[i])[j]==\"7\" or (d[i]) [j]==\"4\":\n cnt+=1\n if cnt>y:\n x-=1\n cnt=min(cnt,0)\nprint(x)\n#kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n\t\t\t\t \t \t\t\t \t \t\t \t\t \t \t", "n, k = tuple(map(int, input().split()))\nA = list(map(int, input().split()))\n\ndef get_list_of_digits(n):\n return list(map(int, list(str(n))))\n\ndef get_lucky_count(n):\n lucky_digits = 4,7\n digits = get_list_of_digits(n)\n count = 0\n for digit in digits:\n if digit in lucky_digits:\n count+=1 \n return count\n\ncount = 0\nfor a in A:\n if get_lucky_count(a) <= k:\n count += 1\nprint(count)\n \n \n \n\n \n", "\r\nn, k = map(int, input().split())\r\narr = list(map(str, input().split()))\r\ncount_ = 0\r\nfor i in arr:\r\n if (i.count(\"4\") + i.count(\"7\")) > k:\r\n continue\r\n else:\r\n count_ += 1\r\nprint(count_)", "n,k=map(int,input().split())\r\nq=input().split()\r\nx=0\r\nfor i in q:\r\n\tif i.count('4')+i.count('7')<=k: x+=1\r\nprint(x)", "n,m = map(int,input().split())\r\na = list(input().split())\r\nv =[]\r\nb =0\r\nfor i in a:\r\n\t\tz = i.count(\"4\") + i.count(\"7\")\r\n\t\tv.append(z)\r\nfor j in v:\r\n\tif j<=m:\r\n\t\tb+=1\r\nprint(b)\r\n", "n,k = map(int, input().split())\r\nlis = [i for i in input().split()]\r\nans = 0\r\nfor i in lis:\r\n c = i.count('4') + i.count('7')\r\n if(c <= k):\r\n ans += 1\r\nprint(ans)", "n, k = map(int, input().split())\nprint(sum([1 for i in input().split() if i.count('4')+i.count('7')<=k]))", "def chck(a):\r\n\tb=0\r\n\tfor i in list(a):\r\n\t\tif i=='4' or i=='7':b+=1\r\n\treturn b\r\n\r\nn,k=map(int,input().split());l=input().split();c=0\r\nfor i in l:\r\n\tif chck(i)<=k :c+=1\r\nprint(c)", "n,k=map(int,input().split())\r\nl=list(input().split())\r\nd=0\r\nfor x in range(n):\r\n\ta=list(l[x])\r\n\tb=a.count('4')\r\n\tc=a.count('7')\r\n\tif (b+c)<=k:d+=1\r\nprint(d)", "n,k = input().split()\nn = int(n)\nk = int(k)\ns = input()\na = s.split()\nx = 0\nfor i in range(len(a)):\n counter = 0\n for j in range(len(a[i])):\n if (a[i])[j] == \"7\" or (a[i])[j] == \"4\":\n counter+=1\n if counter<=k:\n x+=1\nprint(x)\n\t\t \t\t\t\t \t\t\t \t\t \t \t\t\t", "a,b=map(int,input().split())\nc=input().split()\nd=0\nfor i in c:\n\tif i.count('4') + i.count('7')<=b:\n\t\td+=1\nprint(d)\n\t \t \t \t\t\t \t\t \t\t\t\t\t\t", "import math\r\nimport atexit\r\nimport io\r\nimport sys\r\n \r\n# input = sys.stdin.readline\r\n_OUTPUT_BUFFER = io.StringIO()\r\nsys.stdout = _OUTPUT_BUFFER\r\n \r\[email protected]\r\ndef write():\r\n sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\r\n \r\ndef array_to_string(a):\r\n s = \"\"\r\n for i in a:\r\n s += str(i)\r\n return s\r\n\r\ndef gcd(a,b): \r\n if a == 0: \r\n return b \r\n return gcd(b % a, a) \r\n \r\ndef lcm(a,b): \r\n return (a*b) / gcd(a,b) \r\n \r\n# t = int(input())\r\n# while t>0:\r\n# t = t-1\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncount = 0\r\nfor i in a:\r\n num_str= str(i)\r\n four = num_str.count('4')\r\n seven = num_str.count('7')\r\n if four+seven>k:\r\n continue\r\n count += 1\r\nprint(count)", "n,k =list(map(int,input(\"\").split()))\r\nar=list(map(int,input(\"\").split()))\r\nluck=\"47\"\r\ncx=0\r\nfor i in ar:\r\n l=list(str(i))\r\n count=0\r\n for i in l:\r\n if(i==\"4\" or i==\"7\"):\r\n count=count+1\r\n if(count<=k):\r\n cx+=1\r\n \r\nprint(cx)", "n, k = map(int, input().split())\na = [int(x) for x in input().split()][:n]\nans = 0\nfor i in range(n):\n\tltr = str(a[i])\n\tif ltr.count('4') + ltr.count('7') <= k: ans += 1\nprint(ans)\n \t \t \t \t\t \t\t \t \t\t\t\t", "n,k=map(int,input().split())\r\nl=input().split()\r\nc=0\r\nfor i in l:\r\n j=0\r\n for t in i:\r\n if t==\"4\":\r\n j+=1\r\n \r\n if t==\"7\":\r\n j+=1\r\n if j<=k:\r\n c+=1\r\n \r\nprint(c)", "n,m = map(int,input().split())\r\nl = list(map(str,input().split()))\r\n\r\nans = 0\r\nfor i in l:\r\n x = i.count('4')+i.count('7')\r\n if x <= m:\r\n ans+=1\r\nprint(ans)", "# tc = int(input())\r\ntc = 1\r\nwhile tc:\r\n inp = [int(x) for x in input().split()]\r\n # n = int(input())\r\n n, k = inp[0], inp[1]\r\n # a = input()\r\n # q = input()\r\n a = [x for x in input().split()]\r\n ans = 0\r\n for i in range(n):\r\n cnt = 0\r\n for j in range(len(a[i])):\r\n if a[i][j] == '4' or a[i][j] == '7':\r\n cnt += 1\r\n if cnt <= k:\r\n ans += 1\r\n print(ans)\r\n tc -= 1\r\n", "from math import *\r\n#from math import comb as nCr\r\nimport sys\r\nfrom sys import *\r\ndef gI(): return map(int, sys.stdin.readline().strip().split())\r\ndef gL(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef SL(): return list(map(str, sys.stdin.readline().strip().split()))\r\nt=stdin.readline\r\np=stdout.write\r\n'''\r\nfor _ in range(int(t())):\r\n n=int(t())\r\n a,b=gI()\r\n a=gL()\r\n'''\r\nn,k=gI()\r\na=SL()\r\nprint(sum(sum(c in '47' for c in x)<=k for x in a))\r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nc = 0\r\nfor i in a:\r\n x = str(i)\r\n fr = x.count('4')\r\n se = x.count('7')\r\n if fr+se<=k:\r\n c+=1\r\nprint(c)\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nans=0\r\nl=list(map(str,input().split()))\r\nfor i in range(n):\r\n a=0\r\n a=l[i].count('4')+l[i].count('7')\r\n if(a<=k):\r\n ans+=1\r\n \r\nprint(ans)", "n,k=map(int,input().split())\r\nn1=list(map(str,input().split()))\r\na=0\r\nfor i in range(len(n1)):\r\n\tm=list(n1[i])\r\n\tc=m.count('4')\r\n\td=m.count('7')\r\n\tif(c+d<=k):\r\n\t\ta=a+1\r\nprint(a)", "n, k = map(int, input().split())\r\nq = list(map(str, input().split()))\r\nans = int(0)\r\nfor i in range(n):\r\n c = int(0)\r\n for j in range(len(q[i])):\r\n if (q[i])[j] == \"4\" or (q[i])[j] == \"7\":\r\n c += 1\r\n if c > k:\r\n break\r\n if c <= k:\r\n ans += 1\r\nprint(ans)", "n,k=[int(x) for x in input().split()]\r\narr=[int(y) for y in input().split()]\r\ncount=0\r\nfor i in arr:\r\n lucky=0\r\n s1=0\r\n while(i>0):\r\n s1=i%10\r\n if s1 == 4 or s1 == 7:\r\n lucky=lucky+ 1\r\n i=i//10\r\n \r\n if (lucky <= k):\r\n count += 1\r\n\r\nprint(count)\r\n\r\n", "a, b = map(int,input().split())\r\nc = list(map(int, input().split()))\r\ncounter = 0\r\nfor i in c:\r\n x = str(i)\r\n if x.count('4') + x.count('7') <= b:\r\n counter += 1\r\nprint(counter)", "[n,k]= map(int,input().split())\r\nx= input().split()\r\na=0\r\nfor i in x:\r\n b=0\r\n for j in i:\r\n if j==\"4\" or j==\"7\":\r\n b+=1\r\n if b<=k:\r\n a+=1\r\nprint(a) ", "# Love you atreyee my jaan\nn, k = list(map(int, input().rstrip().split()))\na = list(map(int, input().rstrip().split()))\nans = 0\nfor i in a:\n count = 0\n while (i > 0):\n d = i % 10\n i = i // 10\n if d == 4 or d == 7:\n count += 1\n if count <= k:\n ans += 1\nprint(ans)", "n, k = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Function to count the number of lucky digits in a given number\r\ndef count_lucky_digits(num):\r\n count = 0\r\n while num > 0:\r\n if num % 10 == 4 or num % 10 == 7:\r\n count += 1\r\n num //= 10\r\n return count\r\n\r\ncount = 0\r\n\r\nfor num in numbers:\r\n lucky_count = count_lucky_digits(num)\r\n if lucky_count <= k:\r\n count += 1\r\n\r\nprint(count)\r\n", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\ncount=0\r\nfor i in range(0,len(a)):\r\n s=str(a[i])\r\n if(s.count('4')+s.count('7')<=m):\r\n count=count+1\r\nprint(count)", "n, k = map(int,input().split())\r\ns = list(map(str,input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n b = s[i].count('4') + s[i].count('7')\r\n if b<=k: count+=1\r\nprint(count)", "j = input().split()\r\nn = int(j[0])\r\nk = int(j[1])\r\ns = 0\r\nl = input().split()\r\nfor i in l:\r\n for f in i:\r\n if int(f) == 4 or int(f) == 7:\r\n s += 1\r\n if s > k:\r\n n -= 1\r\n s = 0\r\nprint(n)\r\n", "n,k = map(int,input().split())\r\ns = [i for i in input().split()]\r\nc = 0\r\nfor i in range(n):\r\n\tif (s[i].count(\"4\")+s[i].count(\"7\")) <= k:\r\n\t\tc+=1\r\n\r\nprint(c)\r\n\r\n", "def solve(n,k,arr):\n\ts=0\n\tfor i in arr :\n\t\tc=0\n\t\tfor j in str(i):\n\t\t\tif j=='4' or j=='7' :\n\t\t\t\tc+=1\n\t\tif c <=k :\n\t\t\ts+=1\n\treturn s\n\n\t\n\t\n\n\t\t\n\n\t\n\n\nl3 = input()\nl3=[int(x) for x in l3.split()]\n\n\nl4 = input()\nl4 =[int(x) for x in l4.split()]\n\t\n\n\n\n\nprint(solve(l3[0],l3[1],l4))\n", "n,k = map(int,input().split())\r\nl = input().split()\r\nc=0\r\nfor val in l:\r\n if val.count(\"4\") + val.count(\"7\") <= k:\r\n c+=1\r\nprint(c)", "n , k = input().split()\nn = int(n) ; k = int(k)\na = input()\nl = a.split()\nans= 0\nfor i in range(len(l)):\n lu_di = 0\n for j in range(len(l[i])):\n if l[i][j] == '4' or l[i][j] == '7':\n lu_di+=1\n if lu_di <= k:\n ans+=1\nprint(ans)\n\n \t \t \t \t \t\t\t\t\t\t\t\t\t\t\t\t \t\t\t \t", "\"\"\"\n3 4\n1 2 4\n\"\"\"\nn,k=map(int,input().split())\nl=list(map(int,input().split()))\ndef f(n):\n c=0\n while n:\n if n%10==4 or n%10==7:\n c+=1\n n//=10\n return c\nc=0\nfor i in l:\n if f(i)<=k:\n c+=1\nprint(c)", "n, k = map(int, input().split())\r\nl = input().split()\r\nc = 0\r\nfor i in l:\r\n if not (i.count('7') + i.count('4') > k):\r\n c += 1\r\nprint(c)\r\n", "n, k = map(int, input().split())\r\na = input().split()\r\ncnt = 0\r\n\r\nfor i in a:\r\n if len(list(filter(lambda j: j == '4' or j == '7', i))) <= k:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "n, k = map(int, input().split())\r\nprint(sum([1 if x.count(\"4\") + x.count(\"7\") <= k else 0 for x in input().split()]))", "n,m=map(int,input().split());c=0\r\narr=list(map(int,input().split()))\r\nfor i in range(len(arr)):\r\n\tif str(arr[i]).count(\"4\")+ str(arr[i]).count(\"7\") <= m:\r\n\t\tc+=1\r\nprint(c)", "def roma(k,a):\r\n res=0\r\n for i in range(len(a)):\r\n n=a[i]\r\n count=0\r\n while n>0:\r\n digit=n%10\r\n if digit==4 or digit==7:\r\n count+=1\r\n n=n//10\r\n \r\n if count<=k:\r\n res+=1\r\n\r\n print(res)\r\n\r\n\r\n\r\n\r\n\r\nn=list(map(int,input('').split()))\r\na=list(map(int,input('').split()))\r\nroma(n[1],a)", "def luckyCount(arr, k):\r\n count = 0\r\n for num in arr:\r\n luckyDigits = 0\r\n while num > 0:\r\n if num % 10 in (4,7):\r\n luckyDigits += 1\r\n num //= 10\r\n if luckyDigits <= k:\r\n count += 1\r\n return count\r\n \r\nn, k = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\nprint(luckyCount(nums, k))", "\r\nx=0\r\nn,k=map(int,input().split(\" \"))\r\nX=input().split(\" \")\r\nfor i in range(n):\r\n count=0\r\n for j in range(len(X[i])):\r\n if(X[i][j]==\"4\" or X[i][j]==\"7\"):\r\n count+=1\r\n\r\n\r\n if(count<=k):\r\n x=x+1\r\nprint(x)", "n, k = map(int, input().split())\r\nli = list(map(str, input().split()))\r\nc=0\r\nfor i in range(n):\r\n if li[i].count('4')+li[i].count('7')<=k:\r\n c+=1\r\nprint(c)", "# Codeforces A. Roma and Lucky Numbers\r\n# Created by Abdulrahman Elsayed on 13/01/2021\r\n\r\ndef to_int(lis):\r\n lis2 = []\r\n for i in range(len(lis)):\r\n lis2.append(lis[i])\r\n return lis \r\n \r\nn, k = input().split()\r\nnumbers = input().split()\r\nn = int(n)\r\nk = int(k)\r\nnumbers = to_int(numbers)\r\n\r\nl = 0\r\ns = 0\r\nfor number in numbers:\r\n number = str(number)\r\n for digit in number:\r\n if ((digit == '4') or (digit == '7')):\r\n l += 1\r\n if l > k:\r\n s += 1\r\n l = 0\r\nprint(n - s) \r\n ", "n, k = map(int, input().split())\nt = 0\nfor v in input().split():\n t += (v.count('4') + v.count('7')) <= k\nprint(t)\n", "\nn,k=map(int,input().split())\nlst=list(input().split()) \nans=0\nfor i in range(n): # 0\n s=lst[i]\n cnt=0\n for j in range(len(s)):\n if(s[j]=='4' or s[j]=='7'):\n cnt+=1\n if(cnt<=k):\n ans+=1\nprint(ans)\n \t\t\t \t \t\t \t\t\t\t \t \t\t\t", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nnctr=0\r\n\r\ndef count(n):\r\n c=0\r\n n=str(n)\r\n for i in n:\r\n if i=='4' or i=='7':\r\n c=c+1\r\n return c\r\n\r\nfor i in range(len(l)):\r\n l1.append(count(l[i]))\r\n\r\nfor i in l1:\r\n if i<=b:\r\n nctr=nctr+1\r\n\r\nprint(nctr)\r\n", "n, k = map(int, input().split())\nnl = input().split()\nc = 0\nfor i in nl:\n four = i.count('4')\n seven = i.count('7')\n if (four+seven)<=k:\n c += 1\nprint(c)\n\t\t \t\t \t\t\t\t\t \t\t\t\t\t \t \t \t\t\t\t\t\t", "_, k = map(int, input().split())\r\n# a = list(I())\r\nprint(sum(i.count(\"4\")+i.count(\"7\") <= k for i in input().split()))\r\n", "a = input().split()\r\n\r\nb= int(a[0])\r\nc= int(a[1])\r\ns= input().split()\r\nd=0\r\nfor i in s:\r\n i = str(i)\r\n if i.count('4')+i.count('7')>c:\r\n d=d+1\r\n\r\nr= b-d\r\nprint(r)\r\n\r\n", "def is_lucky_number(number):\r\n while number > 0:\r\n digit = number % 10\r\n if digit != 4 and digit != 7:\r\n return False\r\n number //= 10\r\n return True\r\n\r\ndef count_numbers_with_lucky_digits(nums, k):\r\n count = 0\r\n for num in nums:\r\n lucky_digit_count = 0\r\n while num > 0:\r\n digit = num % 10\r\n if digit == 4 or digit == 7:\r\n lucky_digit_count += 1\r\n num //= 10\r\n if lucky_digit_count <= k:\r\n count += 1\r\n return count\r\nn, k = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\nresult = count_numbers_with_lucky_digits(nums, k)\r\nprint(result)\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n ans = 0\r\n for a in A:\r\n cnt = 0\r\n for c in str(a):\r\n if c == '4' or c == '7':\r\n cnt += 1\r\n if cnt <= k:\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = input().split()\r\na = list(input().split())\r\nans = 0\r\nfor num in a:\r\n count_lucky = num.count('4') + num.count('7')\r\n if count_lucky <= int(k):\r\n ans += 1\r\n\r\nprint(ans)", "n,m=map(int,input().split())\r\nl=list(map(str,input().split()))\r\np=0\r\ns=0\r\nfor i in range(n):\r\n\tj=l[i].count(\"7\")\r\n\tk=l[i].count(\"4\")\r\n\tif j+k>m:\r\n\t\tp+=1\r\n\telse:\r\n\t\ts+=1\r\nprint(s)", "n, k = [int(i) for i in input().split()]\r\na = [i for i in input().split()]\r\ncount = num = 0\r\nc_list = []\r\nfor i in a:\r\n for j in list('47'):\r\n if j in list(i): count += i.count(j)\r\n c_list.append(count)\r\n count = 0\r\nfor i in c_list:\r\n if i <= k: num += 1\r\nprint(num)", "x, y = input().split()\r\nx, y = int(x), int(y)\r\n\r\ninputs = input().split(\" \")\r\n\r\nresult = 0\r\n\r\nfor i in inputs:\r\n result += 1 if (i.count('4') + i.count('7') <= y) else 0\r\n\r\nprint(result)\r\n", "def count(char):\n\titr = 0\n\tlucky = '47'\n\tfor i in char: \n\t\tif i in lucky: itr += 1\n\treturn itr\n\nn, k = map(int, input().split())\na = [int(x) for x in input().split()][:n]\nans = 0\nfor i in range(n):\n\tif count(str(a[i])) <= k: ans += 1\nprint(ans)\n\t\t\t\t\t\t \t\t\t\t\t \t\t \t\t\t\t \t\t", "n, c = map(int, input().split())\r\na = list(map(str, input().split()))\r\n\r\ncount = 0\r\n\r\nfor k in range(n):\r\n ch = a[k]\r\n kol = ch.count('4') + ch.count('7')\r\n if kol <= c:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n", "num=list(map(int,input().split()))\r\nless=0\r\nn,k=num[0],num[1]\r\nnum=input().split()\r\nfor i in num:\r\n lucky=0\r\n for j in i:\r\n if j=='4' or j=='7':\r\n lucky+=1\r\n if lucky<=k:\r\n less+=1\r\nprint(less)", "n,k=map(int,input().split())\r\nA=list(map(str,input().split()))\r\nC,T=0,0\r\nfor i in range(n):\r\n C=A[i].count(\"7\")+A[i].count(\"4\")\r\n if C<=k:\r\n T+=1\r\nprint(T)", "x, t, = map(int, input().split())\r\n\r\nnums = input().split()\r\ncount = 0\r\n\r\nfor i in nums:\r\n if (i.count('4') + i.count('7')) <= t:\r\n count += 1\r\n\r\nprint(count)", "n, k = map(int, input().split())\na = input().split(\" \")\nfinal = 0\nfor x in range(n):\n c = 0\n for i in a[x]:\n if i == \"4\" or i == \"7\":\n c+=1\n if c <= k:\n final += 1\n\nprint(final)\n \t \t\t\t\t \t \t \t\t \t \t\t \t", "a, e = map(int, input().split())\r\nb = input().split()\r\nc = 0\r\nfor i in range(0, a):\r\n f = 0\r\n for j in (b[i]):\r\n if j == \"4\" or j == \"7\":\r\n f += 1\r\n if f <= e:\r\n c += 1\r\nprint(c)\r\n", "n, k = [int(i) for i in input().split()]\r\nprint(sum(i.count(\"4\") + i.count(\"7\") <= k for i in input().split()))\r\n", "a=input().split(\" \")\r\nn=a[0]\r\nk=a[-1]\r\nb=input().split(\" \")\r\nlucky=0\r\nfor i in b:\r\n count=0\r\n for j in i:\r\n if j==\"4\" or j==\"7\":\r\n count+=1\r\n if count<=int(k):\r\n lucky+=1\r\nprint(lucky)\r\n", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n b=0\r\n while(a[i]>0):\r\n if(a[i]%10==4 or a[i]%10==7):\r\n b=b+1\r\n a[i]=a[i]//10\r\n if(b<=k):\r\n ans=ans+1\r\nprint(ans)", "n,k=map(int,input().split())\r\na=list(map(str,input().split()))\r\n\r\ncount=0\r\nfor i in range(n):\r\n c=0\r\n for j in range(len(a[i])):\r\n if a[i][j]=='4' or a[i][j]=='7':\r\n c+=1\r\n\r\n if c<=k:\r\n count+=1\r\n\r\nprint(count)", "n,k=list(map(int,input().split()))\r\nl=input().split()\r\nc=0\r\nfor i in l:\r\n x=i.count('4')\r\n x+=i.count('7')\r\n if k>=x:c+=1\r\nprint(c)", "ip = list(map(int, input().split(\" \")))\r\nn = ip[0]\r\nk = ip[1]\r\ns = input().split(\" \")\r\nr = 0\r\nfor i in s:\r\n soMayMay = i.count(\"4\") + i.count(\"7\")\r\n if soMayMay <= k:\r\n r += 1\r\nprint(r)", "def lucky(num):\r\n ans = 0\r\n for i in range(len(num)):\r\n if num[i] == '4' or num[i] == '7':\r\n ans+= 1\r\n return ans\r\n\r\n\r\nn, k = map(int, input().split())\r\nans = 0\r\narr = [x for x in input().split()]\r\nfor i in range(len(arr)):\r\n if lucky(arr[i]) <= k:\r\n ans += 1\r\n \r\nprint(ans)", "n,k=map(int, input().split())\r\n\r\narr=list(input().split())\r\n\r\nnot_more_k = 0 \r\n\r\nfor i in arr:\r\n lucky_dig=0 \r\n\r\n for j in i:\r\n if j==\"4\" or j==\"7\":\r\n lucky_dig+=1 \r\n\r\n if lucky_dig<=k:\r\n not_more_k+=1 \r\n\r\nprint(not_more_k)\r\n ", "n,k=map(int,input().split())\r\nl1=input().split()\r\ncountans=0\r\nfor i in range(n):\r\n\tcount1=0\r\n\tfor j in l1[i]:\r\n\t\tif j==\"7\"or j==\"4\":\r\n\t\t\tcount1+=1\r\n\tif count1<=k:\r\n\t\tcountans+=1 \r\nprint(countans)", "n, k = map(int, input().split())\r\nwords = [*map(str, input().split())]\r\nres = 0\r\nfor word in words:\r\n if word.count(\"4\") + word.count(\"7\") <= k:\r\n res += 1\r\n\r\nprint(res)\r\n", "n,m=list(map(int,input().strip().split()))\r\nl=list(map(int,input().strip().split()))\r\np=0\r\nfor i in l:\r\n s=str(i)\r\n t=s.count(\"4\")+s.count(\"7\")\r\n if t<=m:\r\n p +=1\r\nprint(p)", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nans=0\r\nnumbers=input().split()\r\n#numbers=[int(i) for i in numbers]\r\nfor arr in numbers:\r\n count=0\r\n for i in range(len(arr)):\r\n if(arr[i]=='4' or arr[i]=='7'):\r\n count+=1\r\n if(count<=k):\r\n ans+=1\r\n \r\n\r\nprint(ans)\r\n \r\n \r\n \r\n", "luck_digits = lambda x: sum([1 for i in x if i == '4' or i == '7'])\n\ndef solve(n, k, a):\n c = 0\n for i in a:\n if luck_digits(str(i)) <= k:\n c += 1\n return c\n\n\ndef main():\n n, k = list(map(int, input().split()))\n a = list(map(int, input().split()))\n print(solve(n, k, a))\n\n\nmain()\n", "n,k=map(int, input().split())\r\narr=list(map(int,input().split()[:n]))\r\ncounter, newc = 0, 0\r\n\r\nfor i in range(len(arr)):\r\n for j in str(arr[i]):\r\n if j == \"4\" or j == \"7\":\r\n counter += 1\r\n if counter <= k:\r\n newc += 1\r\n counter = 0\r\n\r\nprint(newc)", "n, k = map(int, input().split())\r\nans = 0\r\nfor i in input().split():\r\n v = 0\r\n v = i.count('4', 0, len(i)) + i.count('7', 0, len(i))\r\n ans += int(v <= k)\r\nprint(ans)\r\n", "n,k=map(int,input().split())\narr=list(map(str,input().split()))\nc=0\nfor i in arr:\n l=0\n for j in i:\n if j=='4' or j=='7':\n l+=1\n # print(i,l,k)\n if l<=k:\n c+=1\nprint(c)\n", "n, k = list(map(int, input().split()))\r\nnumbers = list(map(int, input().split()))\r\ncounter = 0\r\nfor number in numbers:\r\n temp = 0\r\n for char in str(number):\r\n if char == \"4\" or char == \"7\":\r\n temp += 1\r\n if temp <= k:\r\n counter += 1\r\n\r\nprint(counter)", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nn,m=map(int,input().strip().split()[:2])\nt=input().strip().split()[:n]\ncount=0\nfor x in t:\n\tif x.count('7')+x.count('4')>m:\n\t\tcount+=1\nprint(n-count)\n\n", "n,k=[int(x) for x in input().split()]\r\nx=[x for x in input().split()]\r\ndef lucky(item):\r\n count=0\r\n for i in range(len(item)):\r\n if item[i]==\"4\" or item[i]==\"7\":\r\n count+=1 \r\n return count \r\nans=0 \r\nfor item in x:\r\n if lucky(item)<=k:\r\n ans+=1 \r\n \r\nprint(ans) \r\n ", "n, k = map(int, input().split())\r\na = list(input().split())\r\ncount = 0\r\nfor i in a:\r\n\tif i.count('4')+i.count('7')>k:\r\n\t\tcount+=1\r\nprint(n-count)", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn,k=map(int,input().split())\r\na=list(map(str,input().split()))\r\nr=0\r\nfor i in range(n):\r\n if a[i].count('4')+a[i].count('7')<=k:\r\n r+=1\r\nprint(r)\r\n\r\n ", "def luky(n):\r\n c=0\r\n while n>0:\r\n if str(n%10) in \"47\": \r\n c+=1\r\n n//=10\r\n return c\r\n\r\nn,k=[int(i) for i in input().split()]\r\narr=list(map(int,input().split()))\r\nx=0 \r\nfor i in arr:\r\n if luky(i)<=k:\r\n x+=1\r\nprint(x)\r\n ", "a,b= map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=0\r\nfor j in range(a):\r\n if str(c[j]).count('4')+str(c[j]).count('7')<=b:\r\n d+=1\r\nprint(d)", "n,k = input().split()\r\nn,k = int(n), int(k)\r\n\r\nnumbers = [str(x) for x in input().split()]\r\nans=0\r\nfor x in numbers:\r\n if x.count('4') + x.count('7') <= k:\r\n ans+=1\r\nprint(ans)", "n,k=map(int,input().split())\r\na=list(input().split())\r\nans=0\r\nfor i in range(n):\r\n\tif a[i].count('4')+a[i].count('7')<=k:\r\n\t\tans+=1\r\nprint(ans)", "params = input().split(\" \")\r\nnumbers = input().split(\" \")\r\ngc = 0\r\nfor x in numbers:\r\n count = 0\r\n for y in x:\r\n if y==\"4\" or y==\"7\":\r\n count+=1 \r\n if count<=int(params[1]):\r\n gc+=1 \r\nprint(gc)", "\r\n(n,k) = tuple(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\n\r\n\r\n\r\ndef count_lucky(s):\r\n counter = 0 \r\n for ch in s: \r\n if ch == '7' or ch == '4':\r\n counter +=1 \r\n return counter\r\n\r\nr = 0\r\nfor a in arr:\r\n if count_lucky(str(a)) <= k:\r\n r+=1 \r\n \r\n \r\nprint(r)", "n,k=map(int,input().split())\r\na=list(map(str,input().split()))\r\ncount=0\r\nans=0\r\nfor i in a:\r\n for j in i:\r\n if j=='4' or j=='7':\r\n count+=1\r\n if count>k:\r\n break\r\n else:\r\n ans+=1\r\n count=0\r\nprint(ans)\r\n", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ncountx=0\r\nfor i in l:\r\n s = str(i)\r\n if(s.count('4')+s.count('7')<=k):\r\n countx += 1 \r\nprint(countx)", "n,k = list(map(int,input().split()))\r\na = list(map(str,input().split()))\r\ncount=0\r\nfor i in a:\r\n\tx=i.count('4')\r\n\ty=i.count('7')\r\n\tif x+y > k:\r\n\t\tcount+=1\r\nprint(len(a)-count)", "n, k = list(map(int, input().split()))\r\nls = input().split()\r\nc = 0\r\nfor a in ls:\r\n if not ('4' in a or '7' in a):\r\n c += 1\r\n continue \r\n count = 0\r\n for d in a:\r\n if d == '4' or d == '7':\r\n count += 1\r\n if count > k:\r\n continue\r\n else:\r\n c += 1\r\nprint(c)", "vals = n,k = [int(x) for x in input().split()]\r\n\r\narr = [str(x) for x in input().split()]\r\n\r\ntot = 0\r\n\r\nfor i in arr:\r\n four = i.count(\"4\")\r\n seven = i.count(\"7\")\r\n if four+seven <= k:\r\n tot += 1\r\n \r\n\r\nprint(tot)", "\r\n\r\nn , k = list(map(int,input().split()))\r\nnum = list(map(int,input().split()))\r\nc = 0\r\nfor i in num:\r\n if str(i).count('4') + str(i).count('7') <= k:\r\n c+=1\r\nprint(c)", "n,k=input().split()\r\nn,k=int(n),int(k)\r\nli=list(int(num) for num in input().strip().split())[:n]\r\ncn=0\r\nfor i in li:\r\n if i >=1 and i <=9 :\r\n cn+=1\r\n elif str(i).count('4') + str(i).count('7') <= k:\r\n cn+=1\r\nprint(cn)\r\n", "a,b=map(int,input().split())\nc=list(input().split())\n# for i in range(len(c)):\n# c[i]=int(c[i])\ns=[]\nfor i in c:\n if i not in s:\n s.append(i)\nm=0\nfor i in c:\n if i.count('4') + i.count('7')<=b:\n m=m+1\nprint(m)\n\n\n\n\n\n\n\t \t\t \t \t \t\t \t\t \t\t \t \t", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx,y=0,0\r\nfor i in range(n):\r\n\ts=str(l[i])\r\n\tx=s.count('4')+s.count('7')\r\n\tif x<=k:\r\n\t\ty+=1\r\nprint(y)", "n, k = map(int, input().split())\r\nprint(sum(1 for number in input().split() if number.count('4') + number.count('7') <= k))", "x = input().split()\r\nn = int(x[0])\r\nk = int(x[1])\r\n\r\ncount = 0\r\n\r\nx = input().split()\r\ntemp = []\r\nfor i in x:\r\n temp.append(int(i))\r\nfor i in temp:\r\n digit = 0\r\n for j in str(i):\r\n if int(j) == 4 or int(j) == 7:\r\n digit+=1\r\n if digit<=k:\r\n count+=1\r\nprint(count)", "L1= [int(x) for x in input().split(\" \")]\r\n\r\nn=L1[0]\r\n\r\nk=L1[1]\r\n\r\nctr=0\r\natr=0\r\nL2= [int(x) for x in input().split(\" \")]\r\n\r\nfor i in L2:\r\n string=str(i)\r\n\r\n for j in string:\r\n\r\n if j==\"4\" or j==\"7\":\r\n ctr=ctr+1\r\n if ctr>k:\r\n atr=atr+1\r\n ctr=0\r\nprint(n-atr)\r\n ", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n\tif(i<10):\r\n\t\tc+=1\r\n\telif(i<10**m):\r\n\t\tc+=1\r\n\telse:\r\n\t\ta=str(i).count(\"4\")\r\n\t\tb=str(i).count(\"7\")\r\n\t\tif(a+b<=m):\r\n\t\t\tc+=1\r\nprint(c)", "n,k=map(int,input().split(\" \"))\r\na=list(map(int,input().split(\" \")))\r\ne=[]\r\nf=[]\r\nd=0\r\nfor i in a:\r\n b=str(i)\r\n e.append(b)\r\nfor j in e:\r\n c= j.count(\"4\")+j.count(\"7\")\r\n f.append(c)\r\nfor l in f:\r\n if l<=k:\r\n d=d+1\r\nprint(d)", "n, k = [int(i) for i in input().split()]\r\nls = [i for i in input().split()]\r\ncount = 0\r\nfor i in ls:\r\n if i.count('7') + i.count('4') <= k:\r\n count += 1\r\nprint(count)\r\n", "n,m=map(int,input().split())\t\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n\ts+=1\r\n\ts1=0\r\n\twhile a[i]>0:\r\n\t\tif a[i]%10==4 or a[i]%10==7:\r\n\t\t\ts1+=1\r\n\t\ta[i]=a[i]//10\t\r\n\t\tif s1>m:\r\n\t\t\ts-=1\r\n\t\t\tbreak\r\nprint(s)", "def count(n):\r\n res = 0\r\n while n > 0:\r\n if n % 10 == 4 or n % 10 == 7:\r\n res += 1\r\n n = int(n / 10)\r\n return res\r\nn, k = [int(j) for j in input().split()]\r\nnums = [int(j) for j in input().split()]\r\nres = 0\r\nfor j in range(n):\r\n if count(nums[j]) <= k:\r\n res += 1\r\nprint(res)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n z=0\r\n x=str(i)\r\n for j in x:\r\n if j==\"4\" or j==\"7\":\r\n z=z+1\r\n if z<=k:\r\n c=c+1\r\nprint(c) \r\n ", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n s=str(a[i])\r\n try:\r\n f=s.count(\"4\")\r\n except:\r\n f=0\r\n try:\r\n se=s.count(\"7\")\r\n except:\r\n se=0\r\n if f+se<=k:\r\n ans+=1\r\nprint(ans)\r\n \r\n", "n,k = map(int,input().split())\r\nar = list(input().split())\r\noc = 0\r\nfor x in ar:\r\n ldc = 0\r\n for i in range(len(x)):\r\n if x[i]=='4' or x[i]=='7':\r\n ldc += 1\r\n if ldc<=k:\r\n oc += 1\r\nprint(oc)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc1=0\r\nfor i in range(n):\r\n t=l[i]\r\n c=0\r\n while(t>0):\r\n if(t%10==4 or t%10==7):\r\n c+=1\r\n t=t//10\r\n if(c<=k):\r\n c1+=1\r\nprint(c1)\r\n", "n,k = [int(x) for x in input().split(\" \")]\r\ns = [x for x in input().split(\" \")]\r\nans = 0\r\nfor i in s:\r\n if i.count('4')+i.count('7')<=k:\r\n ans += 1\r\nprint(ans)", "n, k = map(int, input().split())\r\nlst = list(input().split())\r\nres = sum(1 for x in lst if x.count(\"4\") + x.count(\"7\") <= k)\r\nprint(res)", "[num, max] = map(int, input().split())\nmylist = list(input().split())\n\nans = 0\n\nfor num in mylist:\n if num.count('7') + num.count('4') <= max:\n ans += 1\n\nprint(ans)", "n,k=map(int,input().split())\r\ny=input()\r\ny+=\" \"\r\na,b=0,0\r\nfor i in y:\r\n if(i==\"4\" or i==\"7\"):\r\n a+=1\r\n elif(i==\" \"):\r\n if(a<=k):\r\n b+=1\r\n a=0\r\nprint(b) ", "n, k = map(int, input().split())\nv = input().split()\n\nres = 0\nfor s in v:\n if s.count('4') + s.count('7') <= k:\n res += 1\n\nprint(res)\n", "a,b=map(int,input().split())\nn=0\nc=[]\nc=input().split(\" \")\nc=[int(i) for i in c]\n\nfor i in range(a):\n m=0\n while c[i]>0:\n d=c[i]%10\n if d==4 or d==7:\n m=m+1\n c[i]=c[i]//10\n if m<=b:\n n=n+1\nprint(n)\n\n\n\t\t\t\t \t \t\t\t \t\t\t \t\t \t\t \t\t\t", "n,k = map(int,input().split())\r\narr = list(map(str,input().split()))\r\nans = 0\r\nfor i in range(len(arr)):\r\n luck = 0\r\n for t in range(len(arr[i])):\r\n if arr[i][t] == '4' or arr[i][t] == '7':\r\n luck += 1\r\n if luck <= k:\r\n ans += 1\r\nprint(ans)", "n,k = list(map(int,input().split()))\nli = list(map(int,input().split()))\nfours = 0\nsevens = 0\nans = 0\nfor i in li:\n if str(i).count(\"4\") + str(i).count(\"7\") <= k:\n ans += 1\nprint(ans)", "n, k = map(int, input().split())\r\na = list(map(int, input().split())) \r\n\r\ncount = 0\r\nfor i in a: \r\n temp_count = 0\r\n while i != 0: \r\n rem = i % 10 \r\n if rem == 4 or rem == 7: \r\n temp_count += 1 \r\n i //= 10\r\n if temp_count <= k: \r\n count += 1\r\nprint(count)", "x = input().split()\nn, k = map(int, x)\n\ny = input().split()\n#print(y)\n\ncounter = 0\nfor i in y:\n #print(i)\n sum = 0\n z = i.count(\"4\")\n a = i.count(\"7\")\n sum = a + z\n if sum <= k:\n counter += 1\n else:\n pass\n \nprint(counter)\n \n\t \t\t\t\t\t \t \t\t\t \t\t \t \t \t \t", "a,b=map(int,input().split())\r\nc=list(map(str,input().split()))\r\n\r\nd=[]\r\n\r\nfor i in c:\r\n if(i.count('4')+i.count('7')<=b):\r\n d.append(i)\r\n\r\nprint(len(d))", "n,k = map(int,input().split())\r\narr = list(map(list,input().split()))\r\ncnt_lucky = []\r\nfor item in arr:\r\n cnt = 0\r\n for itr in item:\r\n if itr == '7' or itr == '4':\r\n cnt += 1\r\n if cnt <= k:\r\n cnt_lucky.append(cnt)\r\nprint(len(cnt_lucky))", "n, d = map(int, input().split())\r\nw = list(input().split())\r\nr = 0\r\nfor it in w:\r\n s = 0\r\n for i in it:\r\n if i == '4' or i == '7':\r\n s += 1\r\n if s <= d:\r\n r += 1\r\nprint(r)", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn,m=q()\r\nc=0\r\nfor i in qs():\r\n c+=(i.count('4')+i.count('7')<=m)\r\nprint(c)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in a:\r\n tem = 0\r\n for j in str(i):\r\n if j == '4' or j == '7': tem -= -1\r\n if tem <= k: ans -= -1\r\nprint(ans)", "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,k=read_ints()\n\tret=0\n\tfor x in read().split():\n\t\tcnt=0\n\t\tfor c in x:\n\t\t\tif c==\"4\" or c==\"7\":\n\t\t\t\tcnt+=1\n\t\tif cnt<=k:\n\t\t\tret+=1\n\tprint(ret)\n\nsolve()\n", "n, k = (int(x) for x in input().split())\na = [x for x in input().split()]\nans = 0\nfor x in a:\n p = 0\n for y in x:\n if y in ['4', '7']:\n p += 1\n if p <= k:\n ans += 1\nprint(ans)\n", "\r\ndef solve(n, m):\r\n\r\n count = 0\r\n test = list(map(int, input().split()))\r\n for i in test:\r\n check = list(str(i))\r\n incount = 0\r\n for j in check:\r\n if j == '4' or j == '7':\r\n incount += 1\r\n\r\n if incount <= m:\r\n count += 1\r\n\r\n return count\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n print(solve(n, m))", "n,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nres=0\r\nfor i in a:\r\n if str(i).count('4')+str(i).count('7')<=k:\r\n res+=1 \r\nprint(res)", "n, k = map(int,input().split())\r\na = list(input().split())\r\nans=0\r\nfor b in a:\r\n ans += (b.count('4') + b.count('7') <= k)\r\nprint(ans)", "inp = input(\"\")\nn, k = list(map(int, inp.split()))\nnum = input(\"\")\nnum = [i for i in num.split()]\ncount = 0\n\nfor n in num:\n if len(n) <= k:\n count += 1\n else:\n luck_ttl = n.count(\"4\") + n.count(\"7\")\n if luck_ttl <= k:\n count += 1\n\nprint(count)\n\t \t\t \t \t \t\t \t\t\t \t \t", "a,b = map(int,input().split())\r\nc = input().split()\r\ncount = 0\r\nfor i in c:\r\n answer = 0\r\n for j in i:\r\n if j == '4' or j == '7':\r\n answer += 1\r\n if answer <= b:\r\n count+= 1\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\ncount=0\r\nfor i in l:\r\n t=str(i)\r\n c=0\r\n for j in t:\r\n if j=='4' or j=='7':\r\n c+=1 \r\n if c<=k:\r\n count+=1 \r\nprint(count)", "n,k= map(int,input().split())\r\n#reading\r\na = input().split()\r\n#dude\r\nprint(sum([i.count('4') + i.count('7') <= k for i in a]))\r\n", "n,k=map(int,input().split())\r\ncount=0\r\nl=list(map(int,input().split()))[:n]\r\nfor i in range(len(l)):\r\n z=0\r\n y=0\r\n x=str(l[i])\r\n y=y+x.count(\"4\")\r\n z=z+ x.count(\"7\")\r\n c=y+z\r\n if c<=k:\r\n count+=1\r\nprint(count)\r\n \r\n \r\n \r\n", "line1 = input()\r\nl1 = line1.split(\" \")\r\nn, k = int(l1[0]), int(l1[1])\r\nline2 = input().split(\" \")\r\nanswer = 0\r\nfor r in range(n):\r\n if line2[r].count(\"4\") + line2[r].count(\"7\") <= k:\r\n answer += 1\r\nprint(answer)\r\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\nfor num in a:\n count = 0\n while num > 0:\n if num % 10 == 4 or num % 10 == 7:\n count += 1\n num //= 10\n if count <= k:\n ans += 1\n\nprint(ans)\n\n \t\t \t \t \t\t\t \t\t \t \t\t\t\t\t\t", "n,k = map(int,input().split())\r\nl = list(input().split())\r\ncount = 0\r\nfor i in l:\r\n a = i.count('4')\r\n b = i.count('7')\r\n if a+b >k:\r\n continue\r\n else:\r\n count = count+1\r\nprint(count)\r\n", "n,k = map(int, input().split())\r\na = input().split()\r\np = 0\r\nq = 0\r\nfor i in range(n):\r\n for j in range(len(a[i])):\r\n if a[i][j] == '4' or a[i][j] == '7':\r\n p += 1\r\n if p <= k:\r\n q += 1\r\n p = 0\r\n\r\nprint(q)", "n, k = map(int, input().split())\r\na=input().split()\r\nx = 0\r\nfor i in a:\r\n if i.count(\"4\") + i.count(\"7\") <= k:\r\n x += 1 \r\nprint(x)\r\n", "n,k=map(int,input().split())\r\n\r\na=list(map(int,input().split()))\r\n\r\ncnt=0\r\n\r\nfor i in range(0,n):\r\n x=str(a[i]).count('4')+str(a[i]).count('7')\r\n if len(str(a[i]))<=k:\r\n cnt+=1\r\n elif x<=k:\r\n cnt+=1\r\nprint(cnt)", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nh = []\r\ngk = 0\r\nfor i in l:\r\n s = str(i)\r\n cnt = 0\r\n for j in s:\r\n if j == '4' or j == '7':\r\n cnt += 1\r\n h.append(cnt)\r\nfor i in h:\r\n if i > k:\r\n gk += 1\r\nprint(n - gk)\r\n \r\n", "n,k=map(int,input().split())\r\na=list(map(str,input().split()))\r\nc=0\r\nfor i in a:\r\n x=list(i)\r\n y=x.count(\"7\")+x.count(\"4\")\r\n if y<=k:\r\n c+=1\r\nprint(c)", "\n# 262 A Roma and Lucky Numbers\n\nn,k = map(int,input().split())\n\nx = [i for i in input().split()]\n\nld = [4,7]\ncounter = 0\nfor i in x:\n xx = [x for x in i.strip()]\n c = xx.count('4') + xx.count('7')\n if c <=k:\n counter += 1\nprint(counter)\n\n \n ", "def lucky(x):\r\n c=0\r\n s=str(x)\r\n for i in range(len(s)):\r\n if s[i]=='4' or s[i]=='7':\r\n c+=1\r\n return c\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor element in a:\r\n if lucky(element)<=k:\r\n c+=1\r\nprint(c)\r\n", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\ng=0\r\nfor i in range(0,len(a)):\r\n x=str(a[i])\r\n y=x.count('7')\r\n z=x.count('4')\r\n if(y+z<=k):\r\n g+=1\r\nprint(g)", "s = input().split(\" \")\r\nn = int(s[0])\r\nk = int(s[1])\r\ncount_am = 0\r\nelements = input().split(\" \")\r\nfor i in range(len(elements)):\r\n count = 0\r\n for j in range(len(elements[i])):\r\n if elements[i][j] == '4' or elements[i][j] == '7':\r\n count += 1\r\n if count <= k:\r\n count_am += 1\r\nprint(count_am)", "n,k=map(int,input().split())\nlst=list(input().split())\nans=0\nfor i in range(n):\n s=lst[i]\n cnt=0\n for j in s:\n if(j=='4' or j=='7'):\n cnt+=1\n ans+=(cnt<=k)\nprint(ans)\n\n\t\t \t \t\t\t \t \t\t\t \t \t \t\t", "n,k=map(int,input().split(' '))\r\narray1=list(map(str,input().split(' ')))\r\ncount=0\r\nfor i in range(n):\r\n a=array1[i].count('4')\r\n b=array1[i].count('7')\r\n sum=a+b\r\n if sum>k:\r\n continue\r\n elif sum<=k:\r\n count=count+1\r\nprint(count)", "n,a=map(int,input().split())\r\nl=list(input().split())\r\nc=0\r\nfor i in l:\r\n v = i.count('4')\r\n w = i.count('7')\r\n if(v+w<=a):\r\n c=c+1\r\nprint(c)", "n, k = (int(x) for x in input().split())\r\nl = (str(x) for x in input().split())\r\na = 0\r\nfor x in l:\r\n c = 0\r\n for y in x:\r\n if y in '47': c += 1\r\n if c <= k: a+=1\r\nprint(a)\r\n\r\n \r\n \r\n \r\n \r\n\r\n", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\n\r\nn, k = map(int, input().split())\r\ncoutn = 0\r\nll = list(map(int, input().split()))\r\nfor i in range(len(ll)):\r\n num = str(ll[i])\r\n totlucky = num.count('4')+num.count('7')\r\n if totlucky<=k:\r\n coutn+=1\r\nprint(coutn)", "n,k = map(int, input() .split())\r\nx = list(map(int, input() .split()))\r\nt = 0\r\nfor i in range (n):\r\n l = str(x[i])\r\n y = l.count('4')\r\n z = l.count('7')\r\n if y +z > k :\r\n t+=1\r\nprint(n-t)", "n,k=[int(x) for x in input().split()]\r\nl=input().split()\r\nc=0\r\nd=0\r\nfor i in range(n):\r\n\tfor j in range(len(l[i])):\r\n\t\tif l[i][j]=='4' or l[i][j]=='7':\r\n\t\t\tc+=1\r\n\tif c<=k:\r\n\t\td+=1\r\n\tc=0\r\nprint(d)", "def dig_count(number, k):\r\n tmp_count = 0\r\n for digit in number:\r\n if digit in ['4', '7']:\r\n tmp_count += 1\r\n if tmp_count > k:\r\n return False\r\n else:\r\n return True\r\n \r\n\r\nn, k = map(int, input().split())\r\nls = list(map(str, input().split()))\r\n\r\nans = 0\r\n\r\nfor i in ls:\r\n tmp = dig_count(i, k)\r\n if tmp:\r\n ans += 1\r\n\r\n\r\nprint(ans)\r\n", "n,k = map(int,input().split())\r\nli = list(input().split())\r\ncount = 0\r\nfor i in range(n):\r\n a = li[i].count('4')\r\n b = li[i].count('7')\r\n if a+b<=k :\r\n count+=1\r\nprint(count)\r\n", "n,k = map(int,input().split())\r\nl = list(map(str,input().split()))\r\nl1 = []\r\nfor ele in l:\r\n x = ele.count(\"4\")\r\n y = ele.count(\"7\")\r\n if x+y<=k:\r\n l1.append(ele)\r\nprint(len(l1))", "t,k = map(int,input().split())\r\na = input().split()\r\ns = 0\r\nfor i in a:\r\n if i.count(\"4\") + i.count(\"7\") <= k:\r\n s+=1\r\nprint(s)", "n,k=map(int,input().split())\r\na=list(map(str,input().split()))\r\ni=0\r\nfor j in a:\r\n c=0\r\n for l in j:\r\n if l=='4' or l=='7':\r\n c=c+1\r\n if c<=k:\r\n i=i+1\r\nprint(i)\r\n", "num,maxDigit=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))[:num]\r\ncount=0\r\n\r\nfor i in range(len(l)):\r\n element=str(l[i]).count('4') +str(l[i]).count('7')\r\n if(element<=maxDigit):\r\n count+=1\r\n \r\nprint(count) ", "n,k=map(int, input().split())\nroma=input().split(\" \")\ndesired=0\nfor i in roma:\n lucky=0\n for j in i:\n if j==\"4\" or j==\"7\":\n lucky+=1\n if k>=lucky:\n desired += 1\nprint(desired)\n \n \t \t\t\t \t\t \t \t\t\t \t \t\t\t\t\t \t\t\t\t", "n, k = map(int, input().split())\r\na = [0 if i.count('4') + i.count('7') > k else 1 for i in input().split()]\r\n\r\nprint(a.count(1))\r\n", "lucky = list(map(int, input() .split()))\nnums = list(map(int, input() .split()))\nnumber = int(lucky[1])\nlength =len(nums)\ncounter = 0\ncounter2=0\nfor x in range(0,length):\n a = str(nums[x])\n for x in range(0,len(a)):\n if a[x]=='4' or a[x]=='7':\n counter = counter+1\n if counter<=number:\n counter2= counter2+1 \n counter = 0\nprint(counter2)", "def lf(n):\r\n c = 0\r\n while(n > 0):\r\n if n%10 == 4 or n%10 == 7:\r\n c+=1\r\n n= n//10\r\n return c\r\ndef ii(): return int(input())\r\ndef mi(): return map(int, input().split())\r\ndef li(): return list(mi())\r\n\r\nn,k = mi()\r\na = li()\r\ncount = 0\r\nfor i in range(n):\r\n if lf(a[i]) <= k:\r\n count+=1\r\nprint(count)", "def f(s):\r\n count = 0\r\n for i in s:\r\n if i == '4' or i == '7':\r\n count += 1\r\n return count\r\n\r\nn, k = map(int, input().split())\r\na = list(input().split())\r\nans = 0\r\nfor i in a:\r\n if f(i) <= k:\r\n ans += 1\r\nprint(ans)", "n,k=list(map(int,input().split()));print(n-sum(i.count(\"4\")+i.count(\"7\")>k for i in input().split()))", "s=input('')\r\nn,k=s.split(' ')\r\nn=int(n)\r\nk=int(k)\r\nl=[]\r\ns1=input(' ')\r\ns1=s1.split(' ')\r\n# print(s1)\r\ns1=list(s1)\r\nfor i in s1:\r\n temp=i.count('4')\r\n temp1=i.count('7')\r\n l.append([i,temp+temp1])\r\n# print(l)\r\ncount=0\r\nfor i in range(n):\r\n if(l[i][1]<=k):\r\n count+=1\r\nprint(count)\r\n \r\n ", "num, k = map(int ,input().split())\n\nout = num\n\n\nfor numbers in input().split():\n\tcountd = 0\n\tfor item in numbers: # 3 numbers for examble\n\t\t\tif item in (\"7\",\"4\"):\n\t\t\t\tcountd += 1\t\t\t\n\tif countd > k :\n\t\tout -= 1\nprint(out)\n", "n,k=map(int,input().split())\nx=input().split()\ncnt=0\nfor i in range(n):\n if x[i].count(\"4\")+x[i].count(\"7\")<=k:\n cnt+=1\nprint(cnt)\n\t\t \t\t \t \t\t\t \t \t \t \t \t \t\t\t \t", "def main():\r\n n, m = map(int, input().split())\r\n arr = input().split()\r\n\r\n ans = 0\r\n\r\n for i in arr:\r\n sevens = i.count('7')\r\n fours = i.count('4')\r\n\r\n if sevens + fours <= m:\r\n ans += 1\r\n\r\n print(ans)\r\n\r\nmain()", "a = list(map(int,input().split()))\r\nb = input().split()\r\nans = 0\r\nfor i in range(a[0]):\r\n if ( b[i].count(\"4\") + b[i].count(\"7\") <=a[1]):\r\n ans +=1\r\nprint(ans)\r\n", "result, size = map(int, input().split())\nfor i in input().split():\n count = 0\n for p in i:\n if p == '4' or p=='7':\n count+=1\n if count > size:\n result -= 1\nprint(result)\n\n\t\t \t \t\t\t \t \t \t\t \t \t", "number = list(map(int ,input().split()))\r\narr = list(map(int , input().split()))\r\ncounter = 0\r\nfor i in arr :\r\n x = str(i)\r\n count = 0\r\n for j in x :\r\n if j == '4' or j == \"7\" :\r\n count +=1\r\n if count > number[1] :\r\n break\r\n if count <= number[1] :\r\n counter += 1\r\nprint(counter)", "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,k = li()\r\nl = li()\r\nans = 0\r\nfor i in l:\r\n if str(i).count('4') + str(i).count('7') <= k:\r\n ans += 1\r\nprint(ans)", "n,k = map(int, input().split())\ncount = 0\nx = [int(x) for x in input().split()]\nfor i in x:\n if str(i).count(\"4\")+str(i).count(\"7\")<=k:\n count+=1\nprint(count)\n \t \t\t\t\t\t \t\t \t \t\t\t \t", "i , j = map(int , input().split()) \nn = list(map(int , input().split()))\nc1 = 0\nfor num in n :\n c = 0\n for num2 in str(num) :\n if num2 == \"4\" or num2 == \"7\" :\n c += 1\n\n if c <= j :\n c1 += 1\nprint(c1)\n\n\t \t \t \t\t \t\t\t\t \t\t \t \t\t", "n, k = list(map(int, input().split()))\r\n\r\nprint(sum(s.count('4')+s.count('7')<=k for s in input().split()))", "n=input().split()\r\ndata=input().split()\r\nnumber=0\r\nfor i in range(len(data)):\r\n c=str(data[i])\r\n if(c.count('4')+c.count('7')<=int(n[1])):\r\n number+=1\r\nprint(number)", "def check_number(num, k):\r\n count = 0\r\n while num:\r\n count += num % 10 in {4, 7}\r\n num //= 10\r\n return count <= k\r\n\r\n\r\nif __name__ == '__main__':\r\n res = 0\r\n n, k = map(int, input().split())\r\n for a in map(int, input().split()):\r\n res += check_number(a, k)\r\n print(res)\r\n", "n,k=[int(x) for x in input().split(\" \")]\r\nc=0\r\nl=[(x) for x in input().split(\" \")]\r\nfor i in range(n):\r\n a=l[i].count('4')\r\n b=l[i].count('7')\r\n if a+b<=k:\r\n c+=1\r\nprint(c) ", "n, k = map(int, input().split())\r\n\r\n\r\ncounter = 0;\r\narr = [];\r\nstr1 = input()\r\narr = str1.split()\r\n\r\nfor i in range(n):\r\n if(arr[i].count('4') + arr[i].count('7') <= k):\r\n counter = counter + 1\r\n\r\nprint(counter)\r\n", "n, k = map(int, input().split())\nc = 0\nfor i in input().split():\n if i.count('7') + i.count('4') <= k: c += 1\nprint(c)\n", "n,k=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nans=0\r\nfor i in ar:\r\n s=str(i)\r\n count=s.count('4')+s.count('7')\r\n if(count<=k):\r\n ans+=1\r\nprint(ans)", "i=lambda:input().split()\r\nk=int(i()[1])\r\nprint(sum(sum(c in '47'for c in x)<=k for x in i()))", "n, k = [int(x) for x in input().split(' ')]\na = [int(x) for x in input().split(' ')]\ncnt = 0\nfor i in range(n):\n if str(a[i]).count('4') + str(a[i]).count('7') <= k: cnt += 1\nprint(cnt)\n", "n, k = map(int, input().split())\r\na = list(input().split())\r\nanswer = 0\r\nfor i in a:\r\n if i.count(\"4\") + i.count(\"7\") <= k:\r\n answer+=1\r\nprint(answer)", "n,k = [int(i) for i in input().split()]\nm = [i for i in input().split()]\ncounter = 0\nfor i in range(0,n) :\n if (m[i].count('4') + m[i].count('7')) <= k : \n counter +=1 \nprint(counter)", "n,k=map(int,input().split())\r\nl=list(map(str,input().split()))\r\ncount=0\r\nfor i in l:\r\n if i.count('4')+i.count('7')<=k:\r\n count+=1\r\nprint(count)", "def f(x):\r\n c=0\r\n while x>0:\r\n if x%10 in [4,7]:\r\n c+=1\r\n x=x//10\r\n return c\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nq=0\r\nfor x in a:\r\n if f(x)<=k:\r\n q+=1\r\n\r\nprint(q)\r\n \r\n\r\n", "n,k=map(int,input().split())\r\nans=0\r\nfor x in input().split():\r\n if x.count(\"4\")+x.count(\"7\")<=k: ans+=1\r\nprint(ans)\r\n", "m,n = map(int,input().split())\nnum = list(map(int,input().split()))\nd = 0\nfor i in range(m):\n x = num[i]\n c = 0\n while x > 0:\n a = x % 10\n x = int(x / 10)\n if a == 4 or a == 7:\n c = c + 1\n if c <= n:\n d = d + 1\nprint(d)\n \t \t \t \t \t \t \t\t \t\t \t", "\r\nn, k = [int(i) for i in input().split()]\r\nnums = [int(i) for i in input().split()]\r\n\r\ndef checkCondition(num, limit):\r\n cnt = 0\r\n while num:\r\n if num%10 == 4 or num%10 == 7:\r\n cnt+=1\r\n num = num//10\r\n\r\n if cnt <= limit:\r\n return True\r\n return False\r\n\r\nans = 0\r\nfor num in nums:\r\n if checkCondition(num,k):\r\n ans+=1\r\n\r\nprint(ans)\r\n", "n,k = map(int,input().split())\na = list(map(str,input().split()))\ncount = 0\nfor i in a:\n if i.count(\"4\") + i.count(\"7\") <= k:\n count += 1\nprint(count)\n \n \t\t\t \t\t\t \t \t\t\t \t\t \t\t\t\t\t", "n,k = map(int,input().split())\r\na = list(input().split())\r\nans = n\r\nfor i in range(len(a)):\r\n con = 0\r\n for j in range(len(a[i])):\r\n if a[i][j] == \"4\" or a[i][j] == \"7\":\r\n con += 1\r\n if con > k :\r\n ans -= 1\r\nprint(ans)", "n, k = list(map(int,input().split()))\r\na = input().split()\r\nans = 0\r\nfor i in a:\r\n curr = 0\r\n for j in i:\r\n if j in '47':\r\n curr += 1\r\n if curr > k:\r\n break\r\n if curr <= k:\r\n ans += 1\r\nprint(ans)", "n = [int(_) for _ in input().split()]\narr = [str(_) for _ in input().split()]\n\nc = 0\n\nfor i in range(n[0]):\n b = 0\n num = list(map(int, arr[i]))\n for j in range(len(num)):\n if num[j] == 7 or num[j] == 4:\n b += 1\n\n if b <= n[1]:\n c += 1\n\nprint(c)\n\n", "n,k=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n s=str(list1[i])\r\n x1=s.count(\"7\")\r\n x2=s.count(\"4\")\r\n x=x1+x2\r\n if(x<=k):\r\n count+=1\r\nprint(count)", "# https://codeforces.com/contest/262/problem/A\r\n\r\nn, k = input().split()\r\nn, k = int(n), int(k)\r\n\r\nl = [i for i in input().split()]\r\ncount = 0\r\n\r\nfor i in l:\r\n if i.count(\"4\") + i.count(\"7\") <= k:\r\n count += 1\r\n\r\nprint(count)", "n,k=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\ns=0\r\nfor i in range(len(a)):\r\n count=0\r\n while a[i]!=0:\r\n if a[i]%10==4 or a[i]%10==7:\r\n count+=1\r\n a[i]=a[i]//10\r\n if count<=k:\r\n s=s+1\r\nprint(s)\r\n", "n, k = input().split()\r\nn, k = int(n), int(k)\r\nli=list(int(num)for num in input().strip().split())[:n]\r\nx=0\r\nfor i in li:\r\n if 1<= i <10 or str(i).count(\"4\") + str(i).count(\"7\") <= k:\r\n x+=1\r\nprint(x)\r\n", "n, k = map(int, input().split())\r\n_ = 0\r\nls = list(map(str,input().split()))\r\nfor s in ls:\r\n if len(s)<=k:\r\n _+=1\r\n else:\r\n if s.count('7')+s.count('4')<=k:\r\n _+=1\r\nprint(_)", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nnum = input().split()\r\ntotal = 0\r\nfor i in range(n):\r\n if num[i].count('4') + num[i].count('7') <= k:\r\n total += 1\r\nprint(total)\r\n", "n, k = map(int, input().split())\r\nprint(list(map(lambda x: x <= k, [str(i).count('4')+str(i).count('7') for i in list(map(int, input().split()))])).count(True))", "n,k= map(int,input().split())\r\na = input().split()\r\nprint(sum([i.count('4') + i.count('7') <= k for i in a]))", "def check(x):\r\n c = 0\r\n while x:\r\n c += 1 if x % 10 in (4, 7) else 0\r\n x //= 10\r\n return True if c <= k else False\r\n\r\nn, k = map(int, input().split())\r\nprint(len(list(filter(check, map(int, input().split())))))\r\n\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n/////////////////////////////////////////\r\n// //\r\n// Implemented by brownfox2k6 //\r\n// //\r\n/////////////////////////////////////////\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"", "n,k=[int(x) for x in input().split()]\r\nl=[x for x in input().split()]\r\nss=['4','7']\r\nco=0\r\nfor p in l:\r\n if p.count('4')+p.count('7')<=k:\r\n #s=list(set(list(i)))\r\n #s.sort()\r\n #if s==ss:\r\n co+=1 \r\nprint(co)\r\n \r\n", "def main():\r\n\tinp, x, count = input().split(), input().split(), 0\r\n\tfor i in x:\r\n\t\tif i.count('4') + i.count('7') <= int(inp[1]):\r\n\t\t\tcount += 1\r\n\tprint(count)\r\nmain()\r\n", "k,n=input().split()\nk=int(k) ; n=int(n)\na=input()\nl=a.split() \nans=0\nfor i in range(len(l)):\n h=l[i]\n lu_di=0\n for j in range(len(h)):\n if h[j]=='4'or h[j]=='7':\n lu_di+=1 \n if lu_di<=n:\n ans+=1 \nprint(ans)\n \t\t\t \t\t \t\t\t \t\t \t \t\t \t\t\t\t\t\t", "n, s = input(\"\").split(), input(\"\").split()\ncount = int(n[1])\nc= 0\nlist1 = []\nfor each in s:\n for every in each:\n if every in \"47\":\n c += 1\n if c <= count:\n list1.append(each)\n c = 0\nprint(len(list1))\n\t \t \t\t\t\t \t\t\t \t \t \t \t \t\t", "n,m = map(int,input().split())\r\narr=list(map(str, input().split(' ')[:n]))\r\nans = 0 \r\ndef lucky(s):\r\n temp = 0\r\n for i in range(len(s)):\r\n if(s[i]=='7' or s[i]=='4'):\r\n temp+=1\r\n if(temp<=m):\r\n return 1\r\n else:\r\n return 0\r\n \r\nfor i in range(n):\r\n if(lucky(arr[i])==1):\r\n ans+=1\r\nprint(ans)\r\n ", "# LUOGU_RID: 102443325\nn, k, *a = map(int, open(0).read().split())\r\nprint(sum(str(x).count('4') + str(x).count('7') <= k for x in a))", "n,k=map(int,input().split())\r\narr=[str(i) for i in input().split()]\r\nans=0\r\nfor x in arr:\r\n c=0\r\n for i in x:\r\n if i==\"4\" or i==\"7\":\r\n c=c+1\r\n if c<=k:\r\n ans=ans+1\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n", "n, k = list(map(int, input().split(' ')))\r\na = list(input().split(' '))\r\ns = 0\r\nfor i in a:\r\n if i.count('4') + i.count('7') <= k:\r\n s += 1\r\nprint(s)\r\n", "n,k = map(int,input().split())\r\narr = list(map(str,input().split()))\r\ncnt=0\r\nfor i in range(n):\r\n s = list(arr[i])\r\n if s.count(\"4\")+s.count(\"7\")<=k:\r\n cnt+=1\r\nprint(cnt)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in a:\r\n mi=str(i)\r\n c=mi.count('4')+mi.count('7')\r\n if(c<=k):\r\n count+=1\r\n \r\nprint(count)", "n, k = map(int, input().split())\r\narr = input().split()\r\nans = 0\r\nfor i in arr:\r\n\tcount = 0\r\n\tfor j in i:\r\n\t\tif j in ['4', '7']:\r\n\t\t\tcount += 1\r\n\tif count <= k:\r\n\t\tans += 1\r\nprint(ans)", "n, k = map(int, input().split())\r\na = list(map(str, input().split()))\r\nc = 0\r\nfor i in a:\r\n if (i.count(\"4\") + i.count(\"7\")) <= k:\r\n c += 1\r\nprint(c)", "n,k=map(int,input().split())\r\ns=input().split()\r\ns=list(filter(lambda x: (x.count(\"4\")+x.count(\"7\"))<=k,s))\r\nprint(len(s))", "n, k = map(int, input().split())\nl = list(map(int,input().split()))\ncount = 0\nfor i in range(n):\n num=0\n while l[i]>0:\n m=l[i]%10\n l[i]=l[i]//10\n if m==4 or m==7:\n num+=1\n if num<=k:\n count+=1\nprint(count)\n\n\n\n \t \t\t \t \t\t\t\t\t\t \t\t\t\t\t\t\t \t\t\t\t", "# Wadea #\r\n\r\nn,k = map(int,input().split())\r\narr = list(input().split())\r\ncounter = 0\r\nfor j in arr:\r\n if j.count(\"4\") + j.count(\"7\") <= k:\r\n counter += 1\r\nprint(counter)\r\n ", "n,k = map(int,input().split())\r\nl = list(map(str,input().split()))\r\ncount = 0\r\nfor i in l:\r\n c = 0\r\n for j in i:\r\n if j == \"4\" or j == \"7\":\r\n c+=1\r\n if c>k:\r\n break\r\n if c<=k:\r\n count+=1\r\nprint(count)", "x,y=map(int,input().strip().split())\r\nl=list(map(str,input().strip().split()))\r\nn=0\r\nfor i in l:\r\n count=0\r\n for j in i:\r\n if(j==\"4\" or j==\"7\"):\r\n count+=1\r\n if(count<=y):\r\n n+=1\r\nprint(n)\r\n ", "a,b= map(int,input().split())\nc=list(map(int,input().split()))\nd=0\nfor j in range(a):\n if str(c[j]).count('4')+str(c[j]).count('7')<=b:\n d+=1\nprint(d)\n\t\t \t \t \t \t\t \t \t\t\t \t", "n, m = map(int, input(). split())\r\na = list(map(int, input(). split()))\r\nans = n\r\nkol = 0\r\nfor i in a:\r\n kol = 0\r\n for j in str(i):\r\n if j == '7' or j == '4':\r\n kol += 1\r\n if m < kol:\r\n ans -= 1\r\nprint(ans)\r\n", "n , k = input().split()\nn = int(n) ; k = int(k)\na = input()\nl = a.split()\nans = 0\nfor j in range(len(l)):\n lc = 0\n for i in range(len(l[j])):\n if l[j][i] == '4' or l[j][i] == '7':\n lc += 1\n if lc <= k:\n ans+=1\nprint(ans)\n \t \t \t \t\t \t \t\t\t \t", "n,k = map(int,input().split())\nx = [i for i in input().split()]\nc = 0\nfor j in range(len(x)) :\n \n if x[j].count('4')+x[j].count('7') <= k :\n c += 1\nprint(c)\n \n\t\t \t \t \t\t\t\t \t\t\t\t \t \t \t\t \t\t", "n,k=map(int,input().split())\r\na = list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(a)):\r\n if str(a[i]).count(\"4\")+str(a[i]).count(\"7\")<=k:\r\n c+=1\r\nprint(c)\r\n", "x,y=map(int,input().split());a=0\r\nc=list(input().split())\r\nfor i in range(len(c)) :\r\n b=list(c[i])\r\n z=b.count(\"4\")+b.count(\"7\")\r\n if z<=y :\r\n a+=1\r\nprint(a)\r\n", "n,k=[int(x) for x in input().split()]\r\na=[x for x in input().split()]\r\nans=0\r\nfor i in range(n):\r\n c=a[i].count('4')\r\n c+=a[i].count('7')\r\n if(c<=k):\r\n ans+=1\r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc,c1=0,0\r\nfor i in range(n):\r\n\ts=str(l[i])\r\n\tc=s.count('4')+s.count('7')\r\n\tif c<=k:\r\n\t\tc1+=1\r\nprint(c1)\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled75.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1D1x8mgVYBiLay890KzZPAq2TMoXX-k_G\n\"\"\"\n\nn,k=map(int,input().split())\nl1=list(map(int,input().split()))\nd=0\nfor x in l1:\n x=str(x)\n c=0\n for i in x:\n if i==\"4\" or i==\"7\":\n c=c+1\n if c<=k:\n d=d+1\nprint(d)", "n, k = (int(el) for el in input().split())\r\ncnt = 0\r\nfor el in input().split():\r\n a = int(el)\r\n s = 0\r\n while a > 0:\r\n x = a % 10\r\n if x == 4 or x == 7:\r\n s += 1\r\n a //= 10\r\n if s <= k:\r\n cnt += 1\r\n\r\nprint(cnt)", "z = []\r\nw = []\r\nz[0:] = map(int ,input().split())\r\nw[0:] = map(str,input().split())\r\n#print(w)\r\ncounter = 0\r\nindex = z[0]\r\nfor i in range(z[0]):\r\n counter = w[i].count('4') + w[i].count('7')\r\n if counter > z[1]:\r\n index -= 1\r\nprint(index)\r\n", "n, k = map(int, input().split())\r\narr = input().split()\r\ncounter = 0\r\nfor i in arr:\r\n lucky = i.count(\"7\") + i.count(\"4\")\r\n if lucky <= k:\r\n counter += 1\r\nprint(counter)\r\n", "def c(s):\r\n s = str(s)\r\n return s.count(\"4\")+s.count(\"7\")\r\na,b = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nx = 0\r\nfor i in arr:\r\n if c(i)>b:\r\n x+=1\r\nprint(a-x)\r\n", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nn,k=map(int,input().split())\na=list(input().split())\nc=0\nfor i in a:\n if i.count('4')+i.count('7')<=k:\n c+=1\nprint(c) \n ", "def digit(x):\r\n s=[]\r\n while x>0:\r\n r=x%10\r\n x//=10\r\n s.append(r)\r\n return s.count(7)+s.count(4)\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n if digit(i)<=k:\r\n c+=1\r\nprint(c)", "n, k =map(int, input().split())\r\na=list(input().split())\r\nc=0\r\n\r\nfor i in a:\r\n\tif i.count('4')+i.count('7')<=k:\r\n\t\tc+=1\r\nprint(c)", "n,k=map(int,input().split())\r\nlst=input().split()\r\ncount=0\r\nfor i in lst:\r\n if i.count('7')+i.count('4')<=k:\r\n count+=1\r\nprint(count)", "a = input().split()\r\nn = int(a[0])\r\nk = int(a[1])\r\nnumbers = input().split()\r\nres = 0\r\nfor i in range(n):\r\n if numbers[i].count('4') + numbers[i].count('7') <= k:\r\n res += 1\r\nprint(res)", "n, k = map(int, input().split())\na = input().split()\nresult = 0\nfor _a in a:\n num_lucky_digits = len([digit for digit in _a if digit in {\"4\", \"7\"}])\n if num_lucky_digits <= k:\n result += 1\nprint(result)\n", "import sys\ninput = sys.stdin.readline\n\nn, k = map(int, input().split())\narr = input().split()\nans = 0\nfor num in arr:\n if num.count('4')+num.count('7') <= k:\n ans += 1\n\nprint(ans)\n", "n,k = map(int, input().split())\r\ncount = 0\r\ns = list(input().split())\r\nfor i in range(n):\r\n\ttemp = s[i]\r\n\tres = temp.count('4') + temp.count('7')\r\n\tif res > k:\r\n\t\tcount += 1\r\n\r\nprint(n-count)", "n, k = [int(x) for x in input().split()]\r\na = input().split()\r\n\r\nret = 0\r\n\r\nfor s in a:\r\n t = 0\r\n for c in s:\r\n if c == '4' or c == '7':\r\n t += 1\r\n if t <= k:\r\n ret += 1\r\n\r\nprint(ret)", "n = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\n\r\ncount = 0\r\ny = 0\r\n\r\nfor i in A:\r\n t = i\r\n while (t != 0) :\r\n x = t%10\r\n if x==4 or x==7:\r\n y += 1\r\n\r\n t = t//10\r\n\r\n if y<=n[1]:\r\n count += 1\r\n\r\n y = 0\r\n\r\nprint(count)", "n,m=map(int,input().split())\r\na=list(map(str,input().split()))\r\ncount=0\r\nfor i in a:\r\n\tz=list(i)\r\n\tq=z.count('4')\r\n\tw=z.count('7')\r\n\tif q+w<=m:\r\n\t\tcount+=1\r\nprint(count)", "s = input().split()\r\nn,k = (int(i) for i in s)\r\ns = input().split()\r\ns = [int(i) for i in s]\r\nres = 0\r\nfor i in range(n):\r\n\tc = 0\r\n\twhile(s[i]>0):\r\n\t\tm = s[i]%10\r\n\t\ts[i] = s[i]//10\r\n\t\tif(m == 4 or m==7):\r\n\t\t\tc += 1\r\n\tif(c <= k):\r\n\t\tres += 1\r\n\r\nprint(res)", "n,k=map(int,input().split())\r\nb=list(map(str,input().split()))[:n]\r\ncount=0\r\nfor i in range(n):\r\n a=b[i]\r\n c=0\r\n for j in range(len(a)):\r\n if a[j]==\"7\" or a[j]==\"4\":\r\n c=c+1 \r\n if c<=k:\r\n count=count+1 \r\nprint(count)\r\n", "n , k = input().split()\nn = int(n) ; k = int(k)\na = input()\nl = a.split()\nans = 0\nfor i in range(len(l)):\n y = l[i]\n c = 0\n for j in range(len(y)):\n if y[j] == '4' or y[j] == '7':\n c+=1\n if c <= k:\n ans+=1\nprint(ans)\n\t\t \t\t \t\t \t \t \t\t\t \t\t\t \t \t\t \t", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nfc = 0\nfor num in a:\n count = 0\n count += str(num).count('4') + str(num).count('7')\n if count <= k:\n fc += 1\nprint(fc)\n \t \t\t\t \t\t\t \t\t\t \t \t\t", "n,k=map(int,input().split())\na = input().split()\nc=0\nfor i in a:\n suma=i.count('4')+i.count('7')\n if suma<=k: c+=1\nprint(c)\n", "def f(n):\r\n s=0\r\n for a in list(str(n)):\r\n if a==\"4\" or a==\"7\":\r\n s+=1\r\n return s\r\nn,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\ns1=0\r\nfor a in l:\r\n if f(a)<=k:\r\n s1+=1\r\nprint(s1)\r\n", "def count(n,k):\r\n cnt=0\r\n while n:\r\n if n%10 in (4,7):\r\n cnt+=1\r\n n//=10\r\n return cnt<=k\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr=list(filter(lambda x: count(x,k),arr))\r\nprint(len(arr))", "n, k = list(map(int, input().split()))\r\nw = input().split()\r\n\r\nd = 0\r\nfor i in range(n):\r\n c = 0\r\n for j in range(len(w[i])):\r\n if w[i][j] == '4' or w[i][j] == '7':\r\n c += 1\r\n if c > k:\r\n d += 1\r\nprint(n-d)", "# import sys\r\n# sys.stdin= (open('input.txt','r'))\r\n# sys.stdout = (open('output.txt','w'))\r\n\r\nn, k = map(int, input().split())\r\nans = 0\r\nfor x in input().split():\r\n ans+=1 if (x.count(\"4\") + x.count(\"7\") <= k) else 0\r\nprint(ans)", "a,b=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nans=0\r\nfor i in arr:\r\n a=str(i)\r\n if(a.count('4')+a.count('7')<=b):\r\n ans+=1\r\nprint(ans)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n a=str(l[i])\r\n s=a.count('4')+a.count('7')\r\n if(s<=k):\r\n c+=1\r\nprint(c)", "def main():\r\n\tn, k=tuple(map(int,input().split()))\r\n\tcount=0\r\n\tl=(input().split())\r\n\tfor s in l:\r\n\t\tif s.count('4')+s.count('7')<=k:\r\n\t\t\tcount+=1\r\n\tprint(count)\r\nif __name__=='__main__':\r\n\tmain()", "n,k=map(int, input().split())\r\nlst=list(map(int, input().split()))\r\nans=0\r\nfor i in lst:\r\n count=0\r\n i=str(i)\r\n for j in i:\r\n if j==\"4\" or j==\"7\":\r\n count+=1\r\n if count<=k:\r\n ans+=1\r\nprint(ans)", "a,b =input().split()\na=int(a)\nb=int(b)\nc=input()\nd=c.split()\nx=0\nfor i in range(len(d)):\n for y in range(len(d[i])):\n if (d[i])[y]==\"7\"or (d[i])[y]==\"4\":\n x+=1\n if x>b:\n a-=1\n x=min(x,0)\nprint(a)\n \t\t\t \t \t \t\t\t \t \t\t \t \t \t\t\t", "def lucky(d):\r\n n1=0\r\n while d:\r\n if d%10==4 or d%10==7:\r\n n1+=1\r\n d//=10\r\n #print(d)\r\n #print(n1)\r\n if n1<=k:\r\n return 1\r\n else:\r\n return 0\r\n\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n c+=lucky(l[i])\r\nprint(c)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount1=count2=0\r\n\r\nfor i in a:\r\n count1=0\r\n while i:\r\n if i%10==4 or i%10==7:\r\n count1=count1+1\r\n i=i//10\r\n \r\n if count1<=k:\r\n count2=count2+1\r\n\r\nprint(count2)\r\n \r\n ", "\r\nn , k = map(int,input().split())\r\nl = input().split()\r\nc = 0\r\n\r\nfor i in l :\r\n if i.count('4') + i.count('7') <= k :\r\n c +=1\r\n\r\nprint(c)\r\n\r\n", "n,k = map(int,input().split())\r\na =list(map(str,input().split()))\r\ncount = 0\r\nfor i in a:\r\n if i.count(\"4\")+i.count('7')<=k:\r\n count+=1\r\nprint(count)", "# cf 262 A 800\nn, k = map(int, input().split())\nA = map(int, input().split())\n\nc = 0\nfor a in A:\n s = str(a)\n n4 = s.count('4')\n n7 = s.count('7')\n if n4 + n7 <= k:\n c += 1\nprint(c)\n", "if __name__ == '__main__':\n\tn, k = map(int,input().rstrip().split())\n\tarr = list(input().rstrip().split())\n\tc = 0\n\tfor i in range(n):\n\t\tl = len(arr[i])\n\t\tif l <= k:\n\t\t\tc += 1\n\t\telse:\n\t\t\tval = arr[i]\n\t\t\tlc = 0\n\t\t\tfor j in range(l):\n\t\t\t\tif val[j] == '4' or val[j] == '7':\n\t\t\t\t\tlc += 1\n\t\t\tif lc <= k:\n\t\t\t\tc += 1\n\tprint(c)\n\n\t\t", "n,k = map(int, input().split())\r\na = list(map(str,input().split()))\r\nc = 0\r\nfor i in range(n):\r\n if ((a[i].count('4')) + (a[i].count('7')))<=k:\r\n c = c + 1\r\n i = i + 1\r\nprint(c)", "n,k = map(int,input().split())\r\nx = input().split()\r\ncount = 0\r\nfor i in range(n):\r\n done = True\r\n p = k\r\n for j in range(len(x[i])):\r\n if x[i][j]=='4' or x[i][j]=='7':\r\n p-=1\r\n if p==-1:\r\n done = False\r\n break\r\n if done==True:\r\n count+=1\r\n\r\nprint(count)\r\n \r\n\r\n ", "n, k = [int(s) for s in input().split(' ')]\r\na = input().split(' ')\r\nprint(len([y for y in [x.count('4') + x.count('7') for x in a] if y <= k]))", "n,k=input().split()\r\ns=[str(x) for x in input().split()]\r\nt=0\r\nfor i in s:\r\n ln = i.count('4') + i.count('7')\r\n if ln <= int(k):\r\n t = t+1\r\nprint(t)\r\n ", "#romandtheluckynumbers\nN, K = [int(x) for x in input().split()]\nT = input().split()\nlucky = 0\nfor i in T:\n n = i.count(\"4\") + i.count(\"7\")\n if n > K:\n continue\n else:\n lucky += 1\nelse:\n print(lucky)", "n , m = map(int, input().split())\r\nc = n\r\nli = list(map(str, input().split()))\r\nfor i in range(n):\r\n if li[i].count('4') + li[i].count('7') > m:\r\n c -= 1\r\nprint(c)", "n,k=input().split()\r\nl=list(input().split())\r\nx=0\r\nfor i in range(len(l)):\r\n\ta=l[i].count('4')\r\n\tb=l[i].count('7')\r\n\tif(a+b<=int(k)):\r\n\t\tx+=1\r\n\t\r\nprint(x)", "n,k = map(int,input().split())\nvalues = list(input().split())\ntotal = 0\nfor i in values:\n if i.count('4') + i.count('7') <= k:\n total += 1\nprint(total)\n \t\t\t \t \t\t \t \t \t\t \t\t \t \t", "line = list(map(int,input().split()))\r\nn = line[0]\r\nk = line[1]\r\nld = [4,7]\r\nno = 0\r\nnos = input().split()\r\nfor l in nos:\r\n lis = list(map(int,list(l)))\r\n nn = 0\r\n for j in lis:\r\n if j in ld:\r\n nn = nn + 1\r\n if nn <= k:\r\n no = no + 1\r\nprint(no)", "def answer():\r\n a = input().split()\r\n k = int(a[1])\r\n a = input().split()\r\n c=[]\r\n for x in a:\r\n b = list(x)\r\n temp=0\r\n for x in b:\r\n if x ==\"4\" or x==\"7\":\r\n temp+=1\r\n c.append(temp)\r\n c = [x for x in c if x<=k]\r\n print(len(c))\r\nanswer()", "n, k = (int(i) for i in input().split())\na = input().split()\nres = sum(1 for i in a if i.count(\"4\") + i.count(\"7\") <= k)\nprint(res)\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn,k=rinput()\r\na=list(map(int,input().split()))\r\ns=[]\r\nfor i in range(n):\r\n s.append(list(str(a[i])))\r\nc=0\r\nfor i in range(n):\r\n l=s[i].count('4')\r\n l1=s[i].count('7')\r\n if(l+l1>k):\r\n c+=1\r\n\r\nprint(n-c)\r\n", "# import sys\n# sys.stdin = open('input.txt', 'r') \n# sys.stdout = open('output.txt', 'w')\n\ndef numLuckyDgits(num):\n\tcount = 0\n\twhile num :\n\t\tif num % 10 == 4 or num % 10 == 7:\n\t\t\tcount += 1\n\t\tnum //= 10\n\treturn count\n\ndef solve(arr, n, k):\n\tresult = 0\n\tfor i in range(n):\n\t\tif numLuckyDgits(arr[i]) <= k:\n\t\t\tresult += 1\n\treturn result\n\nn, k = list(map(int, input().strip().split()))\narr = list(map(int, input().strip().split()))\nresult = solve(arr, n, k)\nprint(result)", "n, k = map(int, input().split())\r\narr = [*map(str, input().split())]\r\nans = 0\r\nfor s in arr:\r\n ans += s.count('4') + s.count('7') <= k\r\nprint(ans)", "n,m=map(int,input().split())\r\nnums=list(input().split())\r\ncount=0\r\nfor num in nums:\r\n if num.count('4')+num.count('7')<=m:\r\n count+=1\r\nprint(count)", "a,b = map(int,input().split())\r\nprint(sum(i.count('4') + i.count('7') <= b for i in input().split()))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ndata = list(input().split())\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n if data[i].count('4') + data[i].count('7') <= k:\r\n cnt += 1\r\n\r\nprint(cnt)", "n,k=input().split()\r\nn,k=int(n),int(k)\r\nl1=[i for i in input().split()]\r\nx=0\r\nfor i in range(n):\r\n if len(l1[i])==1:\r\n x+=1\r\n elif l1[i].count('4')+l1[i].count('7') <= k:\r\n x+=1\r\nprint(x)", "n, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nc=0\r\nfor i in a:\r\n j = str(i)\r\n d=0\r\n for k in j:\r\n if(k=='4' or k=='7'):\r\n d+=1\r\n if(d<=m):\r\n c+=1\r\nprint(c)", "list_1 = [int(x) for x in input().split(\" \")]\r\nlist = [x for x in input().split(\" \")]\r\nluck=0\r\ntotal=0\r\nfor num in list:\r\n luck=0\r\n for digit in num:\r\n if digit=='7' or digit=='4':\r\n luck+=1\r\n if luck<=list_1[1]:\r\n total+=1\r\nprint(total)", "x, y = map(int, input().split())\r\nls = list(input().split(' '))\r\nct = 0\r\nfor i in ls : \r\n if i.count('4') + i.count('7') <= y : \r\n ct += 1\r\n\r\nprint(ct)", "n,k = map(int,input().split())\nx = [i for i in input().split()]\nf = 0\n\nfor i in x :\n c = 0\n \n l = 0\n while c<=k+1 :\n if i[l]== '4' or i[l]== '7' :\n c+=1\n \n if l>=len(i)-1 :\n break\n l += 1\n \n if c<=k :\n f+=1\nprint(f)\n \n \n\n \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 = input().split()\r\n\r\nans = 0\r\nfor i in l:\r\n if not(i.count('4') + i.count('7') > k):\r\n ans+=1\r\nprint(ans)", "n,k=map(int,input().split())\r\nf=0\r\nli=list(input().split())\r\nfor i in range(n):\r\n h = 0\r\n x=li[i]\r\n for j in x:\r\n if j == '4' or j == '7':\r\n h += 1\r\n if h <= k:\r\n f += 1\r\nprint(f)", "f,g = map(int,input().split())\nl1 = list(input().split())\n\ndef func(x):\n res = 0\n for y in x:\n if y=='4' or y=='7':\n res =res+1\n else:\n pass\n if res>g:\n return 0\n else:\n return 1 \n\nress = 0 \nfor x in l1 :\n ress = ress + func(x)\nprint(ress)\n\n\n\n\n", "n,k=map(int,input().split())\r\na=[i for i in input().split()]\r\ncnt=0\r\nans=0\r\nfor i in a:\r\n for j in i:\r\n if j=='4' or j=='7':\r\n cnt+=1\r\n if cnt>k:\r\n break\r\n else:\r\n ans+=1\r\n cnt=0\r\nprint(ans)", "n, k = map(int, input().split())\r\narr = input().split()\r\ncount = 0\r\nfor num in arr:\r\n lck = 0\r\n for digit in num:\r\n if digit == \"4\" or digit == \"7\":\r\n lck += 1\r\n if lck <= k:\r\n count += 1\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\narr = input().split()\r\nres = 0\r\nfor i in arr:\r\n res += (i.count('4') + i.count('7')) <= k\r\nprint(res)\r\n", "n ,k = map(int , input().split())\r\narr = list(map(str,input().split()))\r\ns = 0\r\nfor i in arr:\r\n\ta = i.count('4')\r\n\tb = i.count('7')\r\n\tif a+b <=k:\r\n\t\ts +=1\r\nprint(s)\r\n", "n,k=input().split()\nn=int(n)\nk=int(k)\nlis=input().split(' ')\nfor i in range(n):\n lis[i]=list(lis[i])\ncnt=0\nfor i in range(n):\n cn = 0\n for j in lis[i]:\n if int(j)==4 or int(j)==7:\n cn+=1\n if cn<=k:\n cnt+=1\nprint(cnt)\n\n\n\n\t \t \t \t\t\t \t\t \t \t", "n, k = map(int, input().split())\nx = list(map(str, input().split()))\nans = 0\nfor i in range(n):\n if x[i].count('4') + x[i].count('7') <= k:\n ans += 1\nprint(ans)\n", "n,k=list(map(int,input().split()))\r\ninp=input().split()\r\ncntr=0\r\nfor i in range(n):\r\n if inp[i].count(\"7\") + inp[i].count(\"4\") <= k:\r\n cntr+=1\r\nprint(cntr)", "n, lim = map(int, input().split())\r\nl = [i for i in input().split()]\r\nk = 0\r\nfor i in l:\r\n if i.count(\"4\") + i.count(\"7\") <= lim:\r\n k += 1\r\n\r\nprint(k)", "import sys\r\nimport math\r\nimport heapq\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nfloor of a[i]\r\n if even -> could be either (no reason to)\r\n if odd -> odd\r\n\r\nbleh, if odd number of odds -> we could either convert\r\nand even to an odd or an odd to an even\r\n\r\nneed to find minimum\r\n'''\r\n\r\ndef solve():\r\n n,k = MII()\r\n a = I().split()\r\n\r\n ans = 0\r\n for num_s in a:\r\n lucky = 0\r\n for c in num_s:\r\n if c == \"4\" or c == \"7\":\r\n lucky += 1\r\n if lucky <= k:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nsolve()", "n,k=map(int,input().split())\r\nl=[]\r\nc=c1=0\r\nl.extend(input().split())\r\nfor i in l:\r\n for j in i :\r\n if j == '4' or j== '7':\r\n c+=1\r\n if c<=k :\r\n c1+=1\r\n c=0\r\nprint(c1)", "n, k = [int(i) for i in input().split()]\r\ns = input().split()\r\nc = 0\r\nfor i in s:\r\n if i.count(\"4\") + i.count(\"7\") <= k:\r\n c += 1\r\nprint(c)", "a=input().split(\" \")\nn=a[0]\nk=a[-1]\nb=input().split(\" \")\nlucky=0\nfor i in b:\n count=0\n for j in i:\n if j==\"4\" or j==\"7\":\n count+=1\n if count<=int(k):\n lucky+=1\nprint(lucky)\n\n \t\t\t\t\t\t \t\t \t \t\t\t\t\t \t\t\t\t\t\t \t\t", "n, k = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor num in numbers:\r\n num_lucky_digits = str(num).count('4') + str(num).count('7')\r\n if num_lucky_digits <= k:\r\n count += 1\r\n\r\nprint(count)\r\n", "n,k = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nans = 0\r\nfor i in l:\r\n s = str(i)\r\n c = s.count('7') + s.count('4')\r\n if c <= k: ans+=1\r\nprint(ans)\r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nf=0\r\nd=0\r\nfor i in a:\r\n f=0\r\n j=i\r\n while(j>0):\r\n if(j%10==4 or j%10==7):\r\n f=f+1\r\n j=j//10\r\n if(f<=k):\r\n d=d+1\r\nprint(d)", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nc =0\r\nfor i in a:\r\n st = str(i)\r\n ct = st.count(\"4\")+st.count(\"7\")\r\n if ct<=k:\r\n c +=1\r\nprint(c)", "n, k = map(int , input().split()) \r\n\r\narr = list( map(str , input().split()) )\r\ncount = 0 \r\nfor num in arr : \r\n lucky = 0\r\n for i in num : \r\n if i == \"4\" or i ==\"7\" :\r\n lucky +=1\r\n if lucky <= k : \r\n count+=1\r\nprint(count )", "#!/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,k = map(int, wtf[0].split())\r\n A = wtf[1].split()\r\n ans = 0\r\n for a in A:\r\n l4s = a.count('4')\r\n l7s = a.count('7')\r\n if l4s+l7s<=k:\r\n ans += 1\r\n print(ans)\r\n", "a,b=map(int,input().split())\nl=[i for i in input().split()]\nc=0\nfor i in range(a):\n if l[i].count(\"4\")+l[i].count(\"7\")<=b:\n c+=1\nprint(c) \n \t\t \t\t \t\t\t\t \t \t\t", "a, b = map(int, input().split())\nc = list(map(int, input().split()))\ncount = 0\ncount_final = 0\nfor x in c:\n for y in str(x):\n if int(y) == 4 or int(y) == 7:\n count += 1\n if count <= b:\n count_final += 1\n count = 0\nprint(count_final)\n\t \t\t \t \t\t \t \t\t\t\t \t\t \t\t\t", "a,k=map(int,input().split())\r\nl=list(map(str,input().split()))\r\nans=0\r\nfor i in l:\r\n cnt=0\r\n for j in i:\r\n if j=='4' or j=='7':\r\n cnt+=1\r\n if cnt<=k:\r\n ans+=1\r\nprint(ans)\r\n \r\n ", "n,k = map(int,input().split())\r\nprint (sum( (x.count('4')+x.count('7'))<=k for x in input().split()))", "def solve(arr,k):\n tot = 0\n for n in arr:\n count = 0\n i = 0\n for d in n:\n if d == '4' or d == '7':\n count += 1\n if count <= k:\n tot += 1\n return tot\n\ndef main():\n n,k = list(map(int, input().split(' ')))\n arr = input().split(' ')\n print(solve(arr,k))\n\nmain()\n", "n,k = map(int,input().split())\nl = list(map(int,input().split()))\na = 0\nfor i in range(0,len(l)):\n if (str(l[i])).count('4')+(str(l[i])).count('7')<=k:\n a+=1\nprint(a) \n \t \t\t \t\t\t \t \t\t \t\t \t", "n, k = list(map(int, input().split()))\narr = input().split()\n\ncount = 0\nfor num in arr:\n if (num.count('4') + num.count('7')) <= k:\n count += 1\n\nprint(count)\n \t\t \t \t \t\t \t\t \t \t \t\t \t \t", "n, k = map(int, input().split())\r\n\r\ns = input().split()\r\nc = 0\r\nfor i in s:\r\n if i.count(\"4\")+i.count(\"7\") <= k:\r\n c += 1\r\nprint(c)\r\n", "def insertion_sort(l):\r\n for i in range(len(l)):\r\n for j in (range(i)):\r\n k = i - j\r\n if l[k] >= l[k - 1]:\r\n l[k - 1], l[k] = l[k], l[k - 1]\r\n else:\r\n break\r\n return l\r\n\r\n\r\n\r\ndef selection_sort(l):\r\n for i in range(len(l)):\r\n min_ind = i\r\n min_val = l[i]\r\n for j in range(i, len(l)):\r\n if min_val > l[j]:\r\n min_val = l[j]\r\n min_ind = j\r\n l[i], l[min_ind] = l[min_ind], l[i]\r\n return l\r\n\r\n\r\ndef bubble_sort(l):\r\n for i in range(len(l) - 1):\r\n for j in range(len(l) - 1 - i):\r\n if l[j] > l[j + 1]:\r\n l[j], l[j + 1] = l[j + 1], l[j]\r\n return l\r\n\r\n\r\n# l = [5,4,3,2,6,1,3,5,6,7,8,9,0,9,8,7,6,7,8,9,8,7,1,6,4,8,32]\r\n# print(insertion_sort(l))\r\n\r\ndef is_even_list(l):\r\n for i in l:\r\n if i % 2:\r\n return False\r\n return True\r\n\r\n\r\ndef main_function():\r\n #t = int(input())\r\n output_list = []\r\n n, k = [int(i) for i in input().split(\" \")]\r\n l = [i for i in input().split(\" \")]\r\n count_top_level = 0\r\n for i in l:\r\n count_low_level = 0\r\n for j in i:\r\n if j == \"7\" or j == \"4\":\r\n count_low_level += 1\r\n if count_low_level <= k:\r\n count_top_level += 1\r\n return count_top_level\r\n\r\n\r\n\r\nprint(main_function())", "def f(n, k):\n cnt = 0\n while n > 0:\n if n % 10 == 4 or n % 10 == 7:\n cnt += 1\n n //= 10\n if cnt <= k:\n return True\n return False\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\nfor x in a:\n if f(x, k):\n ans += 1\nprint(ans)", "n,k=map(int,input().split())\r\nl=list(map(str,input().split()))\r\nans=0\r\nfor i in l:\r\n c=0\r\n for j in i:\r\n if(j=='4' or j=='7'):\r\n c+=1\r\n if(c<=k):\r\n ans+=1\r\nprint(ans)", "n, k = input().split(\" \")\nk=int(k)\nnumbers=input().split(\" \")\nlucky=0\nfor i in numbers:\n count=0\n for j in i:\n if j=='4' or j=='7':\n count+=1\n if count<=k:\n lucky+=1\nprint(lucky)\n\t\t \t \t\t \t \t\t\t\t\t\t \t \t \t\t\t \t \t", "q='47'\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nf=0\r\nfor i in a:\r\n for j in str(i):\r\n if str(j) in q:\r\n s+=1\r\n if s<=k:\r\n f+=1\r\n s=0\r\nprint(f)\r\n", "def cnt(a):\r\n c = 0\r\n while (a != 0):\r\n n = a % 10\r\n if (n == 4) or (n == 7):\r\n c = c + 1\r\n a = a // 10\r\n return c\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = 0\r\nfor i in a:\r\n if (cnt(i) <= k):\r\n d = d + 1\r\nprint(d)", "import sys, os\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline\r\nread = lambda: list(map(int, input().strip().split()))\r\n\r\n\r\ndef f(n):\r\n c = 0\r\n while n:c += (n%10 in (4,7)); n //= 10\r\n return(c)\r\n\r\ndef main():\r\n n, k = read(); arr = read(); ans = 0\r\n for i in arr:\r\n ans += (f(i) <= k)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "m, n = map(int, input().split())\nres: int = 0\nlist1 = list(map(str, input().split()))\n#print(list1)\nfor i in range(len(list1)):\n sum1 = str(list1[i]).count('4')\n sum2 = str(list1[i]).count('7')\n sum3 = sum1 + sum2\n if sum3 <= n:\n res = res + 1\nprint(res)\n\n \t\t\t \t\t \t \t \t\t\t \t \t\t\t\t\t\t", "n,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nans=0\r\nfor i in l:\r\n temp=str(i)\r\n count=0\r\n for j in temp:\r\n if j=='4' or j=='7':\r\n count+=1\r\n if count<=k:\r\n ans+=1\r\nprint(ans)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[9]:\n\n\nx=list(map(int,input().split()))\nc=0\ny=list(map(int,input().split()))\nfor i in y:\n i=str(i)\n a=i.count(\"7\")\n b=i.count(\"4\")\n if a+b <=x[1]:\n c+=1\nprint(c)\n \n \n\n\n# In[ ]:\n\n\n\n\n", "def getLuckyDigits(n):\r\n luckyDigits: int = 0\r\n luckyNums = [4,7]\r\n while n > 0:\r\n if int(n%10) in luckyNums:\r\n luckyDigits += 1\r\n n = int(n / 10)\r\n\r\n return luckyDigits\r\n\r\ndef getDigits(num):\r\n return len(str(num))\r\n\r\narr = input().split(\" \")\r\nn = int(arr[0])\r\nk = int(arr[1])\r\ncount = 0\r\n\r\nnums = input().split(\" \")\r\n\r\nfor i in range(n):\r\n currentNumber = int(nums[i])\r\n if getLuckyDigits(currentNumber) <= k:\r\n count+=1\r\n\r\nprint(count)", "n,k=list(map(int,input().split()))\r\ns=list(map(int,input().split()))\r\nf=0\r\nfor i in s:\r\n c=0\r\n for j in str(i):\r\n if j in \"74\":\r\n c+=1\r\n if c<=k:\r\n f+=1\r\n c=0\r\nprint(f)", "n, k = [int(x) for x in input().split()]\r\nlst = input().split()\r\nc = 0\r\nfor i in lst:\r\n if (i.count(\"4\") + i.count(\"7\")) <= k:\r\n c += 1\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k = map(int, input().split())\r\narr = list(input().split())\r\nans = 0\r\nfor i in arr:\r\n\tif i.count('4') + i.count('7') <= k:\r\n\t\tans += 1\r\nprint(ans)\r\n", "n,k = map(int,input().split())\r\nli = list(map(int,input().split()))\r\ncnt = 0\r\nfor data in li:\r\n s = str(data)\r\n if s.count('4')+s.count('7')<=k:\r\n cnt+=1\r\n else:\r\n pass\r\nprint(cnt)", "n, k = map(int, input().split())\r\nprint(sum(i.count('4') + i.count('7') <= k for i in input().split()))", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nn=0\r\nfor i in range(a):\r\n if str(c[i]).count('7')+str(c[i]).count('4')<=b:\r\n n+=1\r\nprint(n)", "import math\nfrom collections import defaultdict\nml=lambda:map(int,input().split())\nll=lambda:list(map(int,input().split()))\nii=lambda:int(input())\nip=lambda:list(input())\nips=lambda:input().split()\n\n\"\"\"========main code===============\"\"\"\n\na,b=ml()\nans=0\nl=list(input().split())\nfor i in l:\n k=i\n w=0\n for i in k:\n if(i=='4' or i=='7'):\n w+=1\n if(w<=b):\n ans+=1\nprint(ans) \n \t \t \t \t\t\t \t \t\t \t \t \t \t \t", "n, k = list(map(int, input().split(\" \")))\r\narr = list(map(int, input().split(\" \")))\r\na_count = 0\r\nfor i in arr:\r\n is_l = False\r\n curr = i\r\n t = 0\r\n while curr > 10:\r\n curr_r = curr % 10\r\n if curr_r == 7 or curr_r == 4:\r\n t += 1\r\n curr = curr // 10\r\n \r\n if curr == 7 or curr == 4:\r\n t += 1\r\n\r\n if t <= k:\r\n a_count += 1\r\nprint(a_count)\r\n", "n, k = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\ncount = 0\r\nfor number in numbers:\r\n number = str(number)\r\n coc = number.count('4')+number.count('7')\r\n if coc <= k:\r\n count += 1\r\nprint(count)\r\n", "n,k = map(int,input().split())\r\na = list(map(str,input().split()))\r\ncount = 0\r\nfor i in a:\r\n if i.count(\"4\") + i.count(\"7\") <= k:\r\n count += 1\r\nprint(count)\r\n ", "def schast_e___e(a) :\r\n a=str(a);h=0\r\n for i in range(len(a)):\r\n if a[i]=='4' or a[i]=='7' : h+=1\r\n return h\r\nn,k=map(int,input().split())\r\nj=0\r\ns=input().split()\r\nfor i in range(n):\r\n if schast_e___e(s[i])<=k : j+=1\r\nprint(j)", "n,k = map(int,input().split())\r\na = list(map(str,input().split()))\r\ncount = 0\r\nflag = 0\r\nfor i in range(n):\r\n for j in range(len(a[i])):\r\n if(a[i][j] == '4' or a[i][j] == '7'):\r\n count += 1\r\n if(count <= k):\r\n flag += 1\r\n count = 0\r\nprint(flag)", "n,k=map(int,input().split())\r\nans=0\r\na=[s for s in input().split()]\r\nfor s in a:\r\n c=s.count('4')+s.count('7')\r\n if c<=k:ans+=1\r\nprint(ans)", "n,k = input().split()\r\nn,k = int(n),int(k)\r\nl = list(input().split())\r\nc = 0\r\nfor i in range(n):\r\n s = l[i]\r\n cnt = 0\r\n for j in range(len(s)):\r\n if(s[j] == '4' or s[j] == '7'):\r\n cnt += 1\r\n if(cnt <= k):\r\n c += 1\r\n \r\nprint(c)", "k=int(input().split()[1])\r\nprint(sum(sum(c in'47'for c in x)<=k for x in input().split()))", "def countLucky(number):\r\n count = 0; temp = 0\r\n while number > 0:\r\n temp = number % 10\r\n if temp == 4 or temp == 7:\r\n count += 1\r\n number = int(number/10)\r\n return count\r\ncount = 0\r\nn, k = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n if countLucky(lst[i]) <= k :\r\n count += 1\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\nc=0\r\nnum=map(int,input().split())\r\nfor i in list(num):\r\n if list(str(i)).count('7')+list(str(i)).count('4')<=k:\r\n c+=1\r\nprint(c)", "n,k=[int(x) for x in input().split()]\r\na=[y for y in input().split()]\r\nc=0\r\nfor i in a:\r\n i=list(i)\r\n if i.count(\"4\")+i.count(\"7\")<=k:\r\n c+=1\r\nprint(c)\r\n", "n,k = map(int, input().split(' '))\nnums = list(map(str, input().split(' ')))\n\nlucky = ['4','7']\n\nres = 0\n\ncount = 0\n\nfor i in nums:\n for j in i :\n if j in lucky :\n count += 1\n \n if count <= k :\n res += 1\n \n count = 0\n\nprint(res)\n\n\t \t \t \t \t\t\t\t \t \t \t\t\t", "x=input().split(\" \")\nn,k=x\ncount=0\ny=input().split(\" \")\nfor i in y:\n counter=0\n for j in i:\n if \"4\"==j:\n counter+=1\n elif \"7\"==j:\n counter+=1\n if counter<=int(k):\n count+=1\nprint(count)\n\t\t\t \t \t \t\t \t \t \t \t\t\t \t", "n,k = list(map(int, input().split()))\r\nlst = input().split()\r\ncnt=0\r\n\r\nfor i in range(len(lst)):\r\n if lst[i].count('4')+lst[i].count('7')<=k:\r\n cnt+=1\r\n \r\nprint(cnt)", "n, k= map(int, input().split())\r\n\r\na = 0\r\nb = 0\r\n\r\nx = [str(y) for y in input().split()]\r\n\r\n\r\nfor i in x:\r\n for j in range(len(i)):\r\n if i[j] == \"4\" or i[j] == \"7\":\r\n a+=1\r\n if a <= k:\r\n b+=1\r\n a = 0\r\n else:\r\n a = 0\r\n\r\n\r\nprint(b)\r\n\r\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\nn, k = map(int, input().split())\r\narr = list(map(str, input().split()))\r\ncount_ = 0\r\nfor i in arr:\r\n if (i.count(\"4\") + i.count(\"7\")) > k:\r\n continue\r\n else:\r\n count_ += 1\r\nprint(count_)\r\n", "x,y=map(int,input().split())\r\nprint(sum(list(map((lambda i: 1 if i.count('4')+i.count('7')<=y else 0),input().split()))))\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness", "n, k = map(int, input().split())\r\nnums = list(input().split())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if nums[i].count(\"4\")+nums[i].count(\"7\") <= k:\r\n count += 1\r\nprint(count)", "n, k = [int(i) for i in input().split()]\r\nlst = [i for i in input().split()]\r\ncount = 0\r\n\r\nfor i in range(n):\r\n count += 1 if lst[i].count('4') + lst[i].count('7') <= k else 0\r\n\r\nprint(count)\r\n", "n = [int(x) for x in input().split()]\ns = input().split()\ncount = 0\nfor i in range(0, n[0]):\n count2 = 0\n for j in range(0, len(s[i])):\n if s[i][j] == \"4\" or s[i][j] == \"7\":\n count2 += 1\n if count2 <= n[1]:\n count += 1\nprint(count)", "def main():\r\n [_, k] = list(map(int, input().split()))\r\n ns = input().split()\r\n\r\n t = 0\r\n for n in ns:\r\n q = 0\r\n for c in str(n):\r\n if c == '4' or c == '7':\r\n q += 1\r\n\r\n if q <= k:\r\n t += 1\r\n print(t)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int, input().split())\r\n\r\nans = 0\r\n\r\nfor z in input().split():\r\n val = z.count('4') + z.count('7')\r\n if val <= k:\r\n ans += 1\r\n \r\nprint(ans)", "n,k = map(int,input().split())\r\n\r\nlst =list(map(str,input().split()))\r\n\r\ncount =0\r\nfor ele in lst:\r\n lucky =0\r\n for ch in ele:\r\n if ch == '4' or ch =='7':\r\n lucky = lucky +1\r\n if lucky <= k:\r\n count = count +1\r\n\r\n\r\nprint(count)", "a,b = input().split()\na = int(a)\nb = int(b)\nc = input()\nd =c.split()\ncnt=0\nfor i in range(len(d)):\n for j in range(len(d[i])):\n if (d[i])[j]==\"7\" or (d[i])[j]==\"4\":\n cnt+=1\n if cnt>b:\n a-=1\n cnt=min(cnt,0)\nprint(a)\n\n\n\t\t\t\t \t\t \t\t \t\t \t\t\t \t \t\t\t", "from collections import Counter\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n c=Counter(str(i))\r\n if c['4']+c['7']<=k:\r\n s+=1 \r\nprint(s)", "a,b=[int(i) for i in input().split()]\nc=[i for i in input().split()]\nd=0\nfor i in c:\n ignore=False\n if len(i)<=b:\n d+=1\n else:\n k=0\n for j in i:\n if j==\"4\" or j==\"7\":\n k+=1\n if k<=b:\n d+=1\nprint(d)\n\t \t \t \t \t\t\t\t \t \t \t\t\t", "n , k = map(int, input().split())\ns = [_ for _ in map(str, input().split())]\nlucky_sum = 0\nfor i in s:\n temp = i.count('4') + i.count('7')\n if temp <= k:\n lucky_sum += 1\nprint(lucky_sum)\n \t\t \t \t \t\t\t \t\t\t\t\t", "n, k = list(map(int, input().split()))\nvalues = input().split()\ntotal = 0\n\nfor val in values:\n lucky = 0\n for c in val:\n if c in '47':\n lucky += 1\n if lucky <= k:\n total += 1\n\nprint(total)\n", "n,x=map(int,input().split())\r\nl=[]\r\ncount=0\r\nl=list(map(int,input().split()))\r\nfor i in range(0,n):\r\n c=0\r\n f=1\r\n s=l[i]\r\n while(s>0):\r\n r=int(s%10)\r\n if(r==4 or r==7):\r\n c=c+1\r\n if(c>x):\r\n f=0\r\n break\r\n s=int(s/10)\r\n if(f==1):\r\n count=count+1\r\nprint(count)", "n,k = input().split()\nn = int(n) ; k = int(k)\ns = input()\na = s.split()\nx = 0\nfor i in range(len(a)):\n counter = 0\n for j in range(len(a[i])):\n if (a[i])[j] == \"7\" or (a[i])[j] == \"4\":\n counter+=1\n if counter<=k:\n x+=1\nprint(x)\n\n# n k\n# 3 2\n# i i i\n# jjj jj jj\n# 0 1 2\n# 447 44 77\n#i = 0 , j =0\n# 012\n#a[i] = '447'\n#(a[i])[j]='4'\n\n \t\t \t \t\t\t\t\t\t \t \t \t \t \t", "\r\nn,k=map(int,input().split())\r\nl=list(input().split())\r\nc=0\r\n\r\nfor i in l:\r\n\ty=i.count(\"4\")\r\n\tz=i.count(\"7\")\r\n\ts=y+z\r\n\tif y+z<=k:\r\n\t\tc=c+1\r\n\r\nprint(c)", "n, k = list(map(int, input().split(\" \")))\r\nnums = input().split(\" \")\r\n\r\n\r\ni = 0\r\n\r\nfor num in nums:\r\n if(num.count('4')+num.count('7')) <= k:\r\n i+=1\r\n\r\nprint(i)\r\n", "n, k = map(int, input().split())\r\na = input().split()\r\nprint(sum([1 if str(x).count(\"4\") + str(x).count(\"7\") <= k else 0 for x in a]))", "n,k=map(int,input().split())\r\nx=list(map(str,input().split()))\r\n\r\nc=0\r\nfor i in x:\r\n if (i.count('4')+i.count('7'))<=k:\r\n c+=1\r\nprint(c)", "n, k = map(int, input().split())\r\n\r\nintegers = tuple(input().split())\r\ncount = 0\r\n\r\nfor num in integers:\r\n if num.count(\"4\") + num.count(\"7\") <= k:\r\n count += 1\r\n\r\nprint(count)", "nk=input().split()\r\nn=int(nk[0])\r\nk=int(nk[1])\r\ns=list(map(int,input().rstrip().split()))\r\nb=0\r\nfor i in range (n):\r\n j=str(s[i])\r\n c=0\r\n for a in j :\r\n a=int(a)\r\n if a==4 or a==7:\r\n c=c+1\r\n\r\n if c<=k :\r\n b=b+1\r\nprint(b)\r\n", "a, b = input().split()\r\n\r\na = int(a)\r\nb = int(b)\r\n\r\ntotal = 0\r\n\r\narr = [int(a) for a in input().split()]\r\n \r\nfor i in arr:\r\n totalLucky = 0\r\n for j in str(i):\r\n if j == '4':\r\n totalLucky += 1\r\n if j == '7':\r\n totalLucky += 1\r\n \r\n if totalLucky <= b:\r\n total += 1\r\n \r\nprint(total)", "n, k = map(int, input().split())\nnums = input().split()\ncount = 0\n\nfor num in nums:\n if num.count(\"4\") + num.count(\"7\") <= k:\n count += 1\n\nprint(count)", "n,k = map(int,input().split())\r\n\r\nans = 0\r\ns = list(map(str,input().split()))\r\nfor i in s:\r\n c = 0\r\n for j in i:\r\n\r\n if j == \"4\" or j == \"7\":\r\n c += 1\r\n if c <= k:\r\n ans+=1\r\nprint(ans)\r\n ", "n,k = map(int,input().split())\nprint_count = 0\nz = 0\nwhile z<1:\n q = input().split(' ')\n for i in q:\n count = 0\n for j in i:\n if j in \"4\" or j in \"7\":\n count+=1\n if count<=k:\n print_count+=1\n z+=1\nprint(print_count)\n \t \t\t \t\t\t \t \t \t\t \t\t\t\t\t \t\t\t", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\ncount=0\r\nfor x in range(a):\r\n\td=list(str(c[x]))\r\n\tseven=d.count('7')\r\n\tfour=d.count('4')\r\n\tif seven+four<=b:\r\n\t\tcount+=1\r\nprint(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jun 17 21:10:37 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\nn, k = map(int, input().split())\r\ns = input().split()\r\ns = [int(i) for i in s]\r\nans = 0\r\nfor i in s:\r\n j = 0\r\n i = str(i)\r\n for l in i:\r\n if l == \"4\" or l == \"7\":\r\n j += 1\r\n if j <= k:\r\n ans += 1\r\nprint(ans)", "n,k=map(int , input().split())\r\na = list(map(int , input().split()))\r\nresult=0\r\n\r\nfor item in a:\r\n count=0\r\n while(item>0):\r\n mod1 = item%10\r\n if(mod1==4 or mod1==7):\r\n count+=1\r\n item//=10\r\n if(count<=k):\r\n result+=1\r\nprint(result)", "#n,k\r\n#not more than k lucky digits\r\ns=input().split()\r\nn=int(s[0])\r\nk=int(s[1])\r\nl=input().split()\r\nflag1=0\r\nfor i in range(n):\r\n flag2=0\r\n for j in range(len(l[i])):\r\n if l[i][j]=='4' or l[i][j]=='7':\r\n flag2+=1\r\n if flag2<=k:\r\n flag1+=1\r\nprint(flag1)", "n,k=map(int,input().split())\r\ncnt=0\r\nfor i in input().split():\r\n if i.count('4') + i.count('7')<=k:\r\n cnt+=1\r\nprint(cnt)", "n, k = map(int, input().split())\r\nnum = input().split()\r\nout = 0\r\nfor i in num:\r\n lucky = 0\r\n for j in i:\r\n if j == '4' or j == '7':\r\n lucky += 1\r\n if lucky <= k:\r\n out += 1\r\nprint(out)", "l1 = [int(i) for i in input().split(\" \")]\r\nl2 = [j for j in input().split(\" \")]\r\ncount = 0\r\nfor i in l2:\r\n if i.count(\"4\") + i.count(\"7\") <= l1[1]:\r\n count+=1\r\nprint(count)", "n,k = [int(x) for x in input().split(\" \")]\r\ns = [i for i in input().split(\" \")]\r\nanswer = 0\r\nfor i in s:\r\n if i.count('4')+i.count('7')<=k: answer += 1\r\nprint(answer)", "n,k=list(map(int,input().split()))\r\nl=list(input().split())\r\nc=0\r\nfor i in range(n):\r\n y=0\r\n x=len(l[i])\r\n for j in range(x):\r\n if(l[i][j]=='4' or l[i][j]=='7'):\r\n y+=1\r\n if(y<=k):\r\n c+=1\r\nprint(c)", "n, k = map(int, input().split())\r\ns = input().split()\r\ncnt = 0\r\nfor i in s:\r\n l = 0\r\n for j in i:\r\n if j == \"4\" or j == \"7\":\r\n l += 1\r\n if l <= k:\r\n cnt += 1\r\nprint(cnt)", "n, k = map(int, input().split())\r\na = input().split()\r\nr = 0\r\nfor x in a:\r\n if x.count(\"4\") + x.count(\"7\") <= k:\r\n r += 1\r\nprint(r)\r\n", "# cook your dish here\r\nn,k = map(int, input().split())\r\nl = list(map(str, input().split()))\r\nans =0 \r\nfor i in l:\r\n if(i.count('4') + i.count('7') <= k):\r\n ans += 1\r\n \r\nprint(ans)", "a = input()\na = a.split(\" \")\nn = int(a[0])\nk = int(a[-1])\nuser = input()\nuser = user.split(\" \")\ntemp = 0\nfor i in user:\n count = 0\n for j in i:\n if int(j) == 4 or int(j) == 7:\n count += 1\n if count <= k:\n temp += 1\nprint(temp)\n\t \t \t\t\t \t\t \t\t \t\t\t\t \t\t \t", "n,k=list(map(int, input().split()))\r\nl=list(map(str, input().split()))\r\nln=[4,7]\r\nr=[]\r\n\r\nfor i in l:\r\n count=0\r\n for j in i:\r\n if int(j) in ln:\r\n count+=1\r\n r.append(count)\r\n\r\nc=0\r\nfor i in range(len(r)):\r\n if r[i]<=k:\r\n c+=1\r\nprint(c)", "n,k=map(int,input().split())\na=[int(i) for i in input().split()]\nc=0\ns=''\nfor i in a:\n s=str(i)\n if s.count('4')+s.count('7')>k:\n c+=1\n \nprint(n-c)\n\n\t\t\t \t \t \t \t \t \t\t \t\t\t\t", "x,y=list(map(int,input().split()))\r\nnums=list(map(int,input().split()))\r\nc=0\r\nfor i in nums:\r\n i=str(i)\r\n if i.count(\"4\")+i.count(\"7\")<=y:\r\n c+=1\r\nprint(c)\r\n \r\n ", "line_1 = str(input(\"\")).split()\nthreshold = int(line_1[1])\n\nline_2 = str(input(\"\")).split()\n\ndef count_lucky(s):\n count = 0\n for i in s:\n if i == '7' or i== '4':\n count += 1\n \n return count\n\nreal_counter = 0\nfor i in range(len(line_2)):\n count_res = count_lucky(line_2[i])\n if(count_res <= threshold):\n real_counter += 1\n \nprint(real_counter)\n \t \t \t \t\t\t \t \t \t\t \t", "n,k1=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in a:\r\n\tk=0\r\n\tif len(str(i))<=k1:\r\n\t\tb.append(k1-1)\r\n\telse:\r\n\t\twhile i!=0:\r\n\t\t\tif i%10==4 or i%10==7:\r\n\t\t\t\tk+=1\r\n\t\t\ti//=10\r\n\t\tb.append(k)\r\nx=0\r\nfor i in b:\r\n\tif i<=k1:\r\n\t\tx+=1\r\nprint(x)", "n,k2=map(int,input().split())\r\n\r\nl=list(map(str,input().split()))\r\n\r\nt=0\r\nfor i in l:\r\n nt=0\r\n for k in i:\r\n if k==\"4\" or k==\"7\":\r\n nt+=1\r\n if nt<=k2:\r\n t+=1\r\nprint(t)", "n,k=map(int,input().split())\r\nl=list(input().split())\r\n\r\nr=0\r\nfor i in range (n):\r\n tmp=l[i]\r\n good=0\r\n for j in range (len(tmp)):\r\n if(tmp[j]==\"4\" or tmp[j]==\"7\"):\r\n good+=1\r\n if(good<=k):\r\n r+=1\r\nprint(r)", "from collections import Counter\r\nn , k = map(int,input().split())\r\nls = list(map(str,input().split()))\r\nc=0\r\nfor i in ls:\r\n if i.count('7')+i.count('4') <=k:\r\n c+=1\r\nprint(c)", "a,b=list(map(int,input().split()))\r\nn=list(map(str,input().split()))\r\ncount=0\r\nfor i in n:\r\n\tx=i.count('4')\r\n\ty=i.count('7')\r\n\tif x+y > b: \r\n\t\tcount+=1\r\nprint(len(n)-count)\r\n", "n,k=map(int,input().split())\r\ntemp=0\r\narr=[str(x) for x in input().split()]\r\ntemp=0\r\nfor i in range(0,len(arr),1):\r\n s=arr[i]\r\n \r\n count=0\r\n for j in range(0,len(s),1):\r\n if s[j]=='4' or s[j]=='7':\r\n count+=1\r\n if count<=k:\r\n temp+=1\r\nprint(temp)\r\n\r\n ", "n, k =map(int,input().split())\r\n\r\nnums = list(map(str, input().split()))\r\ncount = 0\r\nfor i in nums :\r\n total = i.count('4') + i.count('7')\r\n if total <= k:\r\n count += 1\r\nprint(count)", "usr_input1 = [int(i) for i in input().split(\" \")]\nusr_input2 = input().split(\" \")\ncount = 0\nfor num in usr_input2:\n lucky = True\n lucky_count = 0\n\n for digit in num:\n if digit == \"4\" or digit == \"7\":\n lucky_count += 1\n\n if lucky_count <= int(usr_input1[1]):\n count += 1\n\nprint(count)\n \t \t \t \t \t\t \t\t \t\t\t \t \t \t", "[n,k] = [int(x) for x in input().split()]\r\n\r\nl = [x for x in input().split()]\r\ncount = 0\r\nfor x in l:\r\n l_c = 0\r\n for y in x:\r\n if y=='4' or y=='7':\r\n l_c += 1\r\n \r\n if l_c <= k:\r\n count+=1\r\n \r\nprint(count)", "n,k=map(int,input().split())\r\nl=input().split()\r\nfor i in range(len(l)):\r\n\ta=l[i].count(\"4\")+l[i].count(\"7\")\r\n\tif a > k:\r\n\t\tn-=1\r\nprint(n)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n x=str(i)\r\n if x.count('4')+x.count('7')<=k:\r\n c+=1\r\nprint(c)\r\n ", "l=list(map(int,input().split()))\r\nn=input().split()\r\nc=0\r\nfor i in n:\r\n if((i.count('4')+i.count('7'))<=l[1]):\r\n c=c+1\r\nprint(c)\r\n\r\n", "temp = list(map(int, input().split()))\r\nnum = temp[0]\r\nluck = temp[1]\r\ncheck = 0\r\nneeded = 0\r\nnumbers = list(input().split())\r\nfor x in numbers:\r\n check = 0\r\n for y in x:\r\n if y == '4' or y == '7':\r\n check += 1\r\n if check <= luck:\r\n needed += 1\r\nprint(needed)\r\n", "n, k = list(map(int, input().split()))\r\nnar = input().split()\r\n\r\ncount = 0\r\nfor i in nar:\r\n count += 1\r\n c = 0\r\n for j in i:\r\n if j == '4' or j == '7':\r\n c += 1\r\n if c > k:\r\n count -= 1\r\n break\r\nprint(count)" ]

{"inputs": ["3 4\n1 2 4", "3 2\n447 44 77", "2 2\n507978501 180480073", "9 6\n655243746 167613748 1470546 57644035 176077477 56984809 44677 215706823 369042089", "6 100\n170427799 37215529 675016434 168544291 683447134 950090227", "4 2\n194041605 706221269 69909135 257655784", "4 2\n9581849 67346651 530497 272158241", "3 47\n378261451 163985731 230342101", "2 3\n247776868 480572137", "7 77\n366496749 549646417 278840199 119255907 33557677 379268590 150378796", "40 31\n32230963 709031779 144328646 513494529 36547831 416998222 84161665 318773941 170724397 553666286 368402971 48581613 31452501 368026285 47903381 939151438 204145360 189920160 288159400 133145006 314295423 450219949 160203213 358403181 478734385 29331901 31051111 110710191 567314089 139695685 111511396 87708701 317333277 103301481 110400517 634446253 481551313 39202255 105948 738066085", "1 8\n55521105", "49 3\n34644511 150953622 136135827 144208961 359490601 86708232 719413689 188605873 64330753 488776302 104482891 63360106 437791390 46521319 70778345 339141601 136198441 292941209 299339510 582531183 555958105 437904637 74219097 439816011 236010407 122674666 438442529 186501223 63932449 407678041 596993853 92223251 849265278 480265849 30983497 330283357 186901672 20271344 794252593 123774176 27851201 52717531 479907210 196833889 149331196 82147847 255966471 278600081 899317843", "26 2\n330381357 185218042 850474297 483015466 296129476 1205865 538807493 103205601 160403321 694220263 416255901 7245756 507755361 88187633 91426751 1917161 58276681 59540376 576539745 595950717 390256887 105690055 607818885 28976353 488947089 50643601", "38 1\n194481717 126247087 815196361 106258801 381703249 283859137 15290101 40086151 213688513 577996947 513899717 371428417 107799271 11136651 5615081 323386401 381128815 34217126 17709913 520702093 201694245 570931849 169037023 417019726 282437316 7417126 271667553 11375851 185087449 410130883 383045677 5764771 905017051 328584026 215330671 299553233 15838255 234532105", "44 9\n683216389 250581469 130029957 467020047 188395565 206237982 63257361 68314981 732878407 563579660 199133851 53045209 665723851 16273169 10806790 556633156 350593410 474645249 478790761 708234243 71841230 18090541 19836685 146373571 17947452 534010506 46933264 377035021 311636557 75193963 54321761 12759959 71120181 548816939 23608621 31876417 107672995 72575155 369667956 20574379 210596751 532163173 75726739 853719629", "8 6\n204157376 10514197 65483881 347219841 263304577 296402721 11739011 229776191", "38 29\n333702889 680931737 61137217 203030505 68728281 11414209 642645708 590904616 3042901 607198177 189041074 700764043 813035201 198341461 126403544 401436841 420826465 45046581 20249976 46978855 46397957 706610773 24701041 57954481 51603266 593109701 385569073 178982291 582152863 287317968 1474090 34825141 432421977 130257781 151516903 540852403 548392 117246529", "19 3\n562569697 549131571 50676718 84501863 74567295 702372009 365895280 451459937 40378543 167666701 158635641 53639293 442332661 825055617 100109161 326616021 862332843 533271196 4791547", "1 1\n44", "1 1\n4", "10 3\n444 447 774 777 7777 4447 4 7 7 4"], "outputs": ["3", "2", "2", "9", "6", "3", "4", "3", "1", "7", "40", "1", "44", "22", "20", "44", "8", "38", "18", "0", "1", "8"]}

UNKNOWN

PYTHON3

CODEFORCES

500

8a318d25c4228c01367164cd22486e42

Minimum spanning tree for each edge

Connected undirected weighted graph without self-loops and multiple edges is given. Graph contains *n* vertices and *m* edges. For each edge (*u*,<=*v*) find the minimal possible weight of the spanning tree that contains the edge (*u*,<=*v*). The weight of the spanning tree is the sum of weights of all edges included in spanning tree. First line contains two integers *n* and *m* (1<=≤<=*n*<=≤<=2·105,<=*n*<=-<=1<=≤<=*m*<=≤<=2·105) — the number of vertices and edges in graph. Each of the next *m* lines contains three integers *u**i*,<=*v**i*,<=*w**i* (1<=≤<=*u**i*,<=*v**i*<=≤<=*n*,<=*u**i*<=≠<=*v**i*,<=1<=≤<=*w**i*<=≤<=109) — the endpoints of the *i*-th edge and its weight. Print *m* lines. *i*-th line should contain the minimal possible weight of the spanning tree that contains *i*-th edge. The edges are numbered from 1 to *m* in order of their appearing in input. Sample Input 5 7 1 2 3 1 3 1 1 4 5 2 3 2 2 5 3 3 4 2 4 5 4 Sample Output 9 8 11 8 8 8 9

[ "from sys import stdin, stdout\r\ndef main():\r\n n, m = map(int, stdin.readline().split())\r\n d = []\r\n ev = [set() for _ in range(n + 1)]\r\n ans = [0] * m\r\n for i in range(m):\r\n u, v, w = map(int, stdin.readline().split()) \r\n d.append((w, u, v))\r\n ev[u].add(i)\r\n ev[v].add(i)\r\n ans[i] = w\r\n d.sort()\r\n par = [i for i in range(n + 1)]\r\n st = []\r\n push = st.append\r\n g = 0\r\n for w, u, v in d:\r\n while par[u] != u:\r\n push(u)\r\n u = par[u]\r\n while par[v] != v:\r\n push(v)\r\n v = par[v]\r\n if u != v:\r\n g += w\r\n if len(ev[u]) < len(ev[v]):\r\n u, v = v, u\r\n par[v] = u\r\n for j in ev[v] & ev[u]:\r\n ans[j] -= w\r\n ev[u] ^= ev[v]\r\n for x in st:\r\n par[x] = u\r\n del st[:]\r\n for i in range(m):\r\n ans[i] += g\r\n stdout.write('\\n'.join(map(str, ans)))\r\nmain()", "from sys import stdout\r\n\r\ndef modified_kruskal(graph, n, results):\r\n graph_sorted = sorted(graph)\r\n\r\n node_list = [i for i in range(n)]\r\n mst = []\r\n remaining_weight = 0\r\n\r\n for weight, u, v in graph_sorted:\r\n \r\n while node_list[u] != u:\r\n mst.append(u)\r\n u = node_list[u]\r\n \r\n while node_list[v] != v:\r\n mst.append(v)\r\n v = node_list[v]\r\n \r\n if u != v:\r\n remaining_weight += weight\r\n if len(nodes_set[u]) < len(nodes_set[v]):\r\n u, v = v, u\r\n node_list[v] = u\r\n for j in nodes_set[v] & nodes_set[u]:\r\n results[j] -= weight\r\n nodes_set[u] ^= nodes_set[v]\r\n \r\n for x in mst:\r\n node_list[x] = u\r\n \r\n del mst[:]\r\n\r\n for i in range(m):\r\n results[i] += remaining_weight\r\n \r\n return results\r\n\r\ngraph = []\r\n\r\nn, m = map(int, input().split())\r\nnodes_set = [set() for _ in range(n)]\r\nresults = [0] * m\r\n\r\nfor i in range(int(m)):\r\n node1, node2, weight = map(int, input().split())\r\n graph.append((weight, node1-1, node2-1))\r\n nodes_set[node1-1].add(i)\r\n nodes_set[node2-1].add(i)\r\n results[i] = weight\r\n\r\nresults = modified_kruskal(graph, n, results)\r\n\r\nstdout.write('\\n'.join(map(str, results)))\r\n" ]

{"inputs": ["5 7\n1 2 3\n1 3 1\n1 4 5\n2 3 2\n2 5 3\n3 4 2\n4 5 4", "2 1\n1 2 42", "3 3\n1 2 10\n2 3 20\n3 1 40", "4 6\n1 2 999999001\n1 3 999999003\n1 4 999999009\n2 3 999999027\n2 4 999999243\n3 4 999999729", "8 10\n2 5 4\n7 5 2\n7 3 28\n4 5 14\n3 2 15\n1 2 3\n6 2 5\n2 8 17\n4 6 2\n1 4 10", "8 10\n8 7 11\n3 5 23\n2 1 23\n7 2 13\n6 4 18\n1 4 20\n8 4 17\n2 8 8\n3 2 9\n5 6 29", "7 14\n2 4 25\n6 4 5\n5 6 3\n5 7 9\n6 1 17\n4 7 6\n5 4 25\n1 2 23\n2 3 15\n5 1 10\n7 6 21\n3 7 5\n5 3 4\n5 2 15", "7 10\n2 1 12\n3 1 10\n3 4 5\n6 4 6\n7 4 20\n5 4 17\n3 2 5\n7 5 8\n3 6 16\n2 5 21", "10 10\n9 4 16\n6 1 4\n5 4 4\n1 2 11\n8 2 22\n5 10 29\n7 5 24\n2 4 15\n1 3 7\n7 9 24"], "outputs": ["9\n8\n11\n8\n8\n8\n9", "42", "30\n30\n50", "2999997013\n2999997013\n2999997013\n2999997037\n2999997247\n2999997733", "48\n48\n61\n57\n48\n48\n48\n48\n48\n53", "106\n106\n109\n108\n106\n106\n106\n106\n106\n112", "52\n42\n42\n46\n49\n43\n62\n50\n42\n42\n58\n42\n42\n42", "53\n51\n51\n51\n54\n51\n51\n51\n61\n55", "132\n132\n132\n132\n132\n132\n132\n132\n132\n132"]}

UNKNOWN

PYTHON3

CODEFORCES

2

8a39a0fc528e653f23f943f263f57591

Mister B and Boring Game

Sometimes Mister B has free evenings when he doesn't know what to do. Fortunately, Mister B found a new game, where the player can play against aliens. All characters in this game are lowercase English letters. There are two players: Mister B and his competitor. Initially the players have a string *s* consisting of the first *a* English letters in alphabetical order (for example, if *a*<==<=5, then *s* equals to "abcde"). The players take turns appending letters to string *s*. Mister B moves first. Mister B must append exactly *b* letters on each his move. He can arbitrary choose these letters. His opponent adds exactly *a* letters on each move. Mister B quickly understood that his opponent was just a computer that used a simple algorithm. The computer on each turn considers the suffix of string *s* of length *a* and generates a string *t* of length *a* such that all letters in the string *t* are distinct and don't appear in the considered suffix. From multiple variants of *t* lexicographically minimal is chosen (if *a*<==<=4 and the suffix is "bfdd", the computer chooses string *t* equal to "aceg"). After that the chosen string *t* is appended to the end of *s*. Mister B soon found the game boring and came up with the following question: what can be the minimum possible number of different letters in string *s* on the segment between positions *l* and *r*, inclusive. Letters of string *s* are numerated starting from 1. First and only line contains four space-separated integers: *a*, *b*, *l* and *r* (1<=≤<=*a*,<=*b*<=≤<=12, 1<=≤<=*l*<=≤<=*r*<=≤<=109) — the numbers of letters each player appends and the bounds of the segment. Print one integer — the minimum possible number of different letters in the segment from position *l* to position *r*, inclusive, in string *s*. Sample Input 1 1 1 8 4 2 2 6 3 7 4 6 Sample Output 231

[ "\na, b, ll, rr = map(int, input().split())\np = 'abcdefghijklmnopqrstuvwxyz'\nss = p[:a]\ndef f(n):\n global a, b, ll, rr, p, ss\n s = ss\n l = ll\n r = rr\n while True:\n s += s[-n]*b\n st = set()\n for i in s[-a:]:\n st.add(i)\n k = 0\n for i in range(a):\n while p[k] in st: k += 1\n st.add(p[k])\n s += p[k]\n for i in range(len(s) -a -b, 0, -a -b):\n for j in range(20):\n if i -(j +1)*(len(s) -i) < 0 or s[i:] != s[i -(j +1)*(len(s) -i): i -j*(len(s) -i)]:\n break\n else:\n t = s[i:]\n l -= 1\n st = set()\n if l < len(s):\n for i in s[l:min(r, len(s))]:\n st.add(i)\n l = len(s)\n z = r -l\n l -= len(s)\n l %= len(t)\n #print(l, z)\n for i in range(z):\n st.add(t[l%len(t)])\n l += 1 \n if l == 2*len(t): break\n #print(s, t)\n #print(len(st))\n return len(st)\nprint(min(f(i) for i in range(1, a +1)))" ]

{"inputs": ["1 1 1 8", "4 2 2 6", "3 7 4 6", "4 5 1 1", "12 12 1 1000", "12 1 1000 1000", "3 4 701 703", "12 12 13 1000000000", "3 4 999999999 1000000000", "5 6 1000000000 1000000000", "1 1 1 1", "12 1 100000011 100000024", "10 12 220000011 220000032", "1 1 1 1000000000", "1 1 999999999 1000000000", "1 1 1000000000 1000000000", "12 12 1 24", "12 12 876543210 1000000000", "5 11 654321106 654321117", "5 11 654321117 654321140", "9 12 654321114 654321128", "5 12 654321101 654321140", "2 12 654321104 654321122", "6 1 654321100 654321115", "2 1 654321122 654321129", "6 2 654321100 654321140", "6 2 654321113 654321123", "1 7 654321103 654321105", "5 3 654321111 654321117", "1 3 654321122 654321140", "5 8 654321118 654321137", "5 8 654321103 654321106", "9 8 654321109 654321126", "2 2 987654333 987654335", "4 8 987654341 987654343", "3 12 987654345 987654347", "8 1 987654349 987654354", "6 8 987654322 987654327", "6 10 987654330 987654337", "11 4 987654330 987654343", "10 7 987654339 987654340", "12 12 987654321 987654328", "3 10 498103029 647879228", "11 3 378541409 796916287", "3 3 240953737 404170887", "3 8 280057261 834734290", "7 8 305686738 573739036", "3 8 36348920 167519590", "10 2 1 1000000000", "4 1 1 100000", "2 1 288 300", "5 1 1 100", "3 3 3 8", "5 1 1 100000", "5 1 1 1000", "6 1 1 10000", "12 1 1 100", "2 1 1 1000000", "10 1 100 1000000000", "2 2 7 12", "12 1 1 1000", "4 1 1 9", "5 2 5 1000", "3 1 4 10", "12 1 1 1000000", "10 5 1 1000000000", "10 10 1999 3998", "3 1 1 1000", "10 1 1 21", "5 3 15 18", "4 4 2 10"], "outputs": ["2", "3", "1", "1", "13", "1", "3", "13", "1", "1", "1", "13", "11", "2", "1", "1", "12", "13", "4", "6", "4", "6", "3", "11", "3", "10", "7", "2", "6", "2", "6", "1", "10", "2", "1", "3", "6", "3", "2", "12", "2", "4", "4", "19", "4", "4", "8", "4", "18", "7", "3", "9", "3", "9", "9", "11", "23", "3", "19", "3", "23", "7", "8", "4", "23", "15", "11", "5", "19", "3", "4"]}

UNKNOWN

PYTHON3

CODEFORCES

1

8a3b83bb1a842a33deeaa0d6092acc8f

Vasya and Football

Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow card automatically receives a red card. Vasya is watching a recorded football match now and makes notes of all the fouls that he would give a card for. Help Vasya determine all the moments in time when players would be given red cards if Vasya were the judge. For each player, Vasya wants to know only the first moment of time when he would receive a red card from Vasya. The first line contains the name of the team playing at home. The second line contains the name of the team playing away. Both lines are not empty. The lengths of both lines do not exceed 20. Each line contains only of large English letters. The names of the teams are distinct. Next follows number *n* (1<=≤<=*n*<=≤<=90) — the number of fouls. Each of the following *n* lines contains information about a foul in the following form: - first goes number *t* (1<=≤<=*t*<=≤<=90) — the minute when the foul occurs; - then goes letter "h" or letter "a" — if the letter is "h", then the card was given to a home team player, otherwise the card was given to an away team player; - then goes the player's number *m* (1<=≤<=*m*<=≤<=99); - then goes letter "y" or letter "r" — if the letter is "y", that means that the yellow card was given, otherwise the red card was given. The players from different teams can have the same number. The players within one team have distinct numbers. The fouls go chronologically, no two fouls happened at the same minute. For each event when a player received his first red card in a chronological order print a string containing the following information: - The name of the team to which the player belongs; - the player's number in his team; - the minute when he received the card. If no player received a card, then you do not need to print anything. It is possible case that the program will not print anything to the output (if there were no red cards). Sample Input MC CSKA 9 28 a 3 y 62 h 25 y 66 h 42 y 70 h 25 y 77 a 4 y 79 a 25 y 82 h 42 r 89 h 16 y 90 a 13 r Sample Output MC 25 70 MC 42 82 CSKA 13 90

[ "__author__ = 'DK Wang'\r\nfrom fractions import gcd\r\n\r\n#Matrix = [[0 for x in range(5)] for x in range(5)]\r\n\r\nhome = input()\r\naway = input()\r\nn = int(input())\r\n\r\ntime = [[0 for x in range(105)] for x in range(2)]\r\n\r\nfor x in range(n):\r\n t, ha, num, type = [x for x in input().split()]\r\n hora = 0 if ha == 'h' else 1\r\n add = 1 if type == 'y' else 2\r\n num = int(num)\r\n if(time[hora][num] < 2):\r\n time[hora][num] += add;\r\n if(time[hora][num] >= 2):\r\n print((home if hora == 0 else away) + \" \" + str(num) + \" \" + t)\r\n", "card_dict=dict()\r\nres=[]\r\nplayers=set()\r\nhome=input()\r\nother=input()\r\nnum=int(input())\r\n\r\nfor i in range(0,num):\r\n (m,t,n,c)=input().split(' ')\r\n m=int(m)\r\n if t=='h':\r\n tname=home\r\n else:\r\n tname=other\r\n if (t,n) not in card_dict:\r\n card_dict[(t,n)]=0\r\n if c=='y':\r\n card_dict[(t,n)]+=1\r\n else:\r\n card_dict[(t,n)]+=2\r\n if card_dict[(t,n)]>=2 and (t,n) not in players:\r\n res.append((tname,n,m))\r\n players.add((t,n))\r\n\r\nres.sort(key=lambda x:x[2])\r\nfor r in res:\r\n print(r[0]+' '+r[1]+' '+str(r[2]))", "from collections import *\r\ns1=input()\r\ns2=input()\r\nn=int(input())\r\nd=defaultdict(int)\r\nfor i in range(n):\r\n time,ty,num,col=map(str,input().split())\r\n d[ty+num+col]+=1\r\n if col=='y' and d[ty+num+col]==2 and d[ty+num+'r']==0:\r\n if ty=='a':\r\n print(s2,num,time)\r\n else:\r\n print(s1,num,time)\r\n elif col=='r' and d[ty+num+col]==1 and (d[ty+num+'y']==0 or d[ty+num+'y']==1):\r\n if(ty=='a'):\r\n print(s2,num,time)\r\n else:\r\n print(s1,num,time)", "first_team = str(input())\r\nsecond_team = str(input())\r\nn = int(input())\r\ndeleted = []\r\na_cards = dict()\r\nh_cards = dict()\r\nfor x in range(n):\r\n [t,team,m,card] = input().split(' ')\r\n t = int(t)\r\n team = str(team)\r\n m = int(m)\r\n card = str(card)\r\n if team == 'a':\r\n team = a_cards\r\n team_name = second_team\r\n else:\r\n team = h_cards\r\n team_name = first_team\r\n if m not in team:\r\n if card == 'y':\r\n team[m] = 1\r\n else:\r\n team[m] = 2\r\n print (team_name,m,t)\r\n else:\r\n if team[m] == 1:\r\n team[m] = 2\r\n print (team_name,m,t)\r\n else:\r\n continue\r\n \r\n", "from collections import *\r\n\r\nhome = input()\r\naway = input()\r\nn = int(input())\r\nhd = defaultdict(int)\r\nad = defaultdict(int)\r\nfor i in range(n):\r\n a = list(map(str, input().split()))\r\n if a[1] == \"h\":\r\n if hd[a[2]] != -1:\r\n if a[-1] == \"r\":\r\n hd[a[2]] = -1\r\n print(home, a[2], a[0])\r\n else:\r\n hd[a[2]] += 1\r\n if hd[a[2]] == 2:\r\n hd[a[2]] = -1\r\n print(home, a[2], a[0])\r\n else:\r\n if ad[a[2]] != -1:\r\n if a[-1] == \"r\":\r\n ad[a[2]] = -1\r\n print(away, a[2], a[0])\r\n else:\r\n ad[a[2]] += 1\r\n if ad[a[2]] == 2:\r\n ad[a[2]] = -1\r\n print(away, a[2], a[0])", "from collections import defaultdict\ndef main(t1,t2,n,t,ha,m,yr):\n reds = {}\n yellows = {} # defaultdict(int)\n teams = [t1,t2]\n for i in range(n):\n player = (ha[i], m[i])\n if player not in reds:\n if player not in yellows:\n yellows[player] = 0\n if yr[i] == 'y':\n yellows[player] += 1\n if yellows[player] >= 2 or yr[i] == 'r':\n reds[player] = 1\n print(teams[ha[i]=='a'],m[i],t[i])\n\ndef main_input():\n t1 = input()\n t2 = input()\n n = int(input())\n t = list(range(n))\n ha = list(range(n))\n m = list(range(n))\n yr = list(range(n))\n for i in range(n):\n t[i], ha[i], m[i], yr[i] = input().split()\n t = [int(x) for x in t]\n m = [int(x) for x in m]\n #print(t1,t2,n)\n #print(t,ha,m,yr)\n main(t1,t2,n,t,ha,m,yr)\n\nif __name__ == \"__main__\":\n main_input()\n", "I=input\r\ns=[I(),I()]\r\nd={}\r\nfor _ in '0'*int(I()):\r\n\tm,h,t,k=I().split();t=int(t)*(2*(h=='h')-1);a=d.get(t,0);d[t]=[a+1,max(a,2)][k=='r']\r\n\tif d[t]==2:print(s[t<0],abs(t),m);d[t]=3", "__author__ = 'PrimuS'\r\ns1 = input().strip(\"\\n\")\r\ns2 = input().strip(\"\\n\")\r\nn = int(input())\r\nd1 = {}\r\nd2 = {}\r\n\r\nfor i in range(n):\r\n ss = input().split()\r\n t = int(ss[0])\r\n x = int(ss[2])\r\n ss[3].strip(\"\\n\")\r\n if ss[1] == 'h':\r\n if x in d1 and d1[x] == 1:\r\n print(s1, x, t)\r\n d1[x] = 2\r\n elif x not in d1:\r\n if ss[3] == 'r':\r\n print(s1, x,t)\r\n d1[x] = 2\r\n else:\r\n d1[x] = 1\r\n else:\r\n if x in d2 and d2[x] == 1:\r\n print(s2, x, t)\r\n d2[x] = 2\r\n elif x not in d2:\r\n if ss[3] == 'r':\r\n print(s2, x, t)\r\n d2[x] = 2\r\n else:\r\n d2[x] = 1", "import sys\n\nhome = input()\naway = input()\nn = int(input())\n\n# yellow, red\nplayer_home = [[0, 0] for i in range(100)]\nplayer_away = [[0, 0] for i in range(100)]\n\ninfo = []\nfor i in range(n):\n time, team, no, color = sys.stdin.readline().split()\n info.append((int(time), team, int(no), color))\n\nfor i in range(n):\n time, team, no, color = info[i][0], info[i][1], info[i][2], info[i][3]\n if team == 'a':\n # have got red card\n if player_away[no][1] != 0:\n continue\n if color == 'r':\n player_away[no][1] = 1\n print(away, no, time)\n else:\n player_away[no][0] += 1\n if player_away[no][0] == 2:\n player_away[no][1] = 1\n print(away, no, time)\n else:\n # have got red card\n if player_home[no][1] != 0:\n continue\n if color == 'r':\n player_home[no][1] = 1\n print(home, no, time)\n else:\n player_home[no][0] += 1\n if player_home[no][0] == 2:\n player_home[no][1] = 1\n print(home, no, time)\n\n", "a, b, n = input(), input(), int(input())\r\nans = []\r\np1, p2, f1, f2 = [0] * 100, [0] * 100, [0] * 100, [0] * 100\r\nfor i in range(n):\r\n t, com, m, c = input().split()\r\n t, m = map(int, (t, m))\r\n if com == 'h':\r\n p1[m] += 1 if c == 'y' else 2\r\n if p1[m] >= 2 and not f1[m]:\r\n ans.append((a, m, t))\r\n f1[m] = 1\r\n else:\r\n p2[m] += 1 if c == 'y' else 2\r\n if p2[m] >= 2 and not f2[m]:\r\n ans.append((b, m, t))\r\n f2[m] = 1\r\n[print(*i) for i in ans]\r\n", "hName = input()\r\naName = input()\r\nn = int(input())\r\n\r\nbd =[]\r\n\r\nfor i in range(n):\r\n s = input().split()\r\n if s[1] == 'h':\r\n bd.append({'comm':hName, 'minute': s[0], 'num': s[2], 'card': s[3]})\r\n else:\r\n bd.append({'comm':aName, 'minute': s[0], 'num': s[2], 'card': s[3]})\r\n\r\nres = []\r\npared = []\r\n\r\nfor pl in range(n):\r\n if [bd[pl]['comm'], bd[pl]['num']] not in pared:\r\n if bd[pl]['card'] == 'r':\r\n res.append(bd[pl])\r\n pared.append([bd[pl]['comm'], bd[pl]['num']])\r\n else:\r\n double = False\r\n for i in range(pl):\r\n if bd[pl]['num'] == bd[i]['num'] and bd[pl]['comm'] == bd[i]['comm']:\r\n double = True\r\n if double:\r\n res.append(bd[pl])\r\n pared.append([bd[pl]['comm'], bd[pl]['num']])\r\n\r\nfor i in range(len(res)):\r\n print(res[i]['comm'] + ' ' + res[i]['num'] + ' ' + res[i]['minute'])\r\n", "from collections import defaultdict\n\ndef main():\n home = input()\n away = input()\n num_fouls = int(input())\n\n players = defaultdict(int)\n banned = set()\n for _ in range(num_fouls):\n minute, team, player, card = input().split()\n team_name = home if team == 'h' else away\n\n if card == 'y':\n players[(team_name, player)] += 1\n else:\n players[(team_name, player)] = 2\n\n if (team_name, player) not in banned and players[(team_name, player)] >= 2:\n print(team_name, player, minute)\n banned.add((team_name, player))\n \n\nmain()\n", "h = input()\na = input()\nn = int(input())\nd = dict()\nfor i in range(n):\n\tarr = input().split()\n\tmark = (h if arr[1] == 'h' else a) + ' ' + arr[2]\n\tif mark not in d:\n\t\td[mark] = 0\n\tif d[mark] < 2:\n\t\td[mark] += 1 if arr[3] == 'y' else 2\n\t\tif d[mark] >= 2:\n\t\t\tprint(mark, arr[0])\n\n", "def input_split(f): return map(f, input().split())\n\n\ndef main():\n home = input()\n away = input()\n n = int(input())\n p = lambda team, m, time: print(\"{} {} {}\".format(home if team == \"h\" else away, m, time))\n r = set([])\n y = set([])\n for i in range(n):\n t, team, m, c = input_split(str)\n a = (team, m)\n if c == \"r\":\n if a not in r:\n r.add(a)\n y.add(a)\n p(team, m, t)\n else:\n if a in r:\n pass\n elif a in y:\n r.add(a)\n p(team, m, t)\n y.add(a)\n\nif __name__ == \"__main__\":\n main()\n", "h = input()\r\na = input()\r\nn = int(input())\r\n\r\ndic = {}\r\n\r\nwhile n > 0:\r\n n -= 1\r\n line = input().split()\r\n t = line[0]\r\n m = 0\r\n if line[1].startswith('a'):\r\n m += 100\r\n m += int(line[2])\r\n f = 1\r\n if line[3].startswith('r'):\r\n f += 1\r\n give_red = False\r\n if m in dic.keys():\r\n if dic[m] < 2:\r\n give_red = True\r\n dic[m] += f\r\n else:\r\n dic[m] = f\r\n if f > 1:\r\n give_red = True\r\n\r\n if give_red:\r\n line = ' ' + t\r\n if m > 100:\r\n line = a + ' ' + str(m - 100) + line\r\n else:\r\n line = h + ' ' + str(m) + line\r\n print(line)\r\n \r\n \r\n", "home = input()\r\naway = input()\r\nfouls = int(input())\r\nd = {}\r\nfor _ in range(fouls):\r\n s = input()\r\n m,t,n,c = s.split(\" \")\r\n if t==\"h\":\r\n player = home + \" \"+n\r\n else:\r\n player = away + \" \"+n\r\n if player not in d:\r\n d[player] = 0\r\n if d[player] < 2:\r\n d[player]+=1 if c==\"y\" else 2\r\n if d[player] >= 2:\r\n print(player,m)\r\n", "s1=input()\r\ns2=input()\r\nL={}\r\nL['h']=s1\r\nL['a']=s2\r\n\r\nn=int(input())\r\nD={}\r\nF={}\r\nfor i in range(n):\r\n a=input().split()\r\n m=int(a[0])\r\n t=L[a[1]]\r\n num=int(a[2])\r\n c=a[3]\r\n if((t,num) in D):\r\n continue\r\n if(c=='r' or (c=='y' and ((t,num) in F))):\r\n D[(t,num)]=1\r\n print(t,num,m)\r\n else:\r\n F[(t,num)]=1\r\n", "home = input()\naway = input()\nn = int(input())\n\nhome_status = [0] * 100\naway_status = [0] * 100\nreds = []\n\nfor _ in range(n):\n\tt, team, player, color = input().split()\n\tt = int(t)\n\tplayer = int(player)\n\tteam = home if team == 'h' else away\n\tif team == home:\n\t\tif home_status[player-1] < 2:\n\t\t\thome_status[player-1] += 1 if color == 'y' else 2\n\t\t\tif home_status[player-1] >= 2:\n\t\t\t\tprint(\" \".join([team, str(player), str(t)]))\n\tif team == away:\n\t\tif away_status[player-1] < 2:\n\t\t\taway_status[player-1] += 1 if color == 'y' else 2\n\t\t\tif away_status[player-1] >= 2:\n\t\t\t\tprint(\" \".join([team, str(player), str(t)]))\n", "sh=input()\r\nsa=input()\r\nlh={}\r\nla={}\r\nn=int(input())\r\nsc=0\r\nmi,s,num,f=0,'',0,''\r\nwhile n>0:\r\n mi,s,num,f=input().split()\r\n mi=int(mi)\r\n num=int(num)\r\n if f=='y':\r\n sc=1\r\n else:\r\n sc=2\r\n if s=='h':\r\n if num not in lh.keys():\r\n lh.update({num:sc})\r\n else:\r\n lh.update({num:lh[num]+sc})\r\n if lh[num]>=2 and lh[num]<4:\r\n lh.update({num:4})\r\n print(sh,num,mi)\r\n else:\r\n if num not in la.keys():\r\n la.update({num:sc})\r\n else:\r\n la.update({num:la[num]+sc})\r\n if la[num]>=2 and la[num]<4:\r\n la.update({num:4})\r\n print(sa,num,mi)\r\n n-=1\r\n #print(lh,la)\r\n", "s = input()\r\nt = input()\r\nn = int(input())\r\nhomecards, awaycards, homefouls, awayfouls = {}, {}, [], []\r\nfouls = []\r\ndef newfoul(x, y):\r\n if y == \"h\":\r\n if not x[1] in homefouls:\r\n homefouls.append(x[1])\r\n fouls.append(x)\r\n else:\r\n if not x[1] in awayfouls:\r\n awayfouls.append(x[1])\r\n fouls.append(x)\r\nfor x in range(n):\r\n string = input()\r\n foul = string.split()\r\n a, b, c, d = int(foul[0]), foul[1], int(foul[2]), foul[3]\r\n if d == \"r\":\r\n if b == \"h\":\r\n newfoul([s, c, a], \"h\")\r\n else:\r\n newfoul([t, c, a], \"a\")\r\n else:\r\n if b == \"h\":\r\n if not c in homecards:\r\n homecards[c] = 0\r\n homecards[c] += 1\r\n if homecards[c] == 2:\r\n newfoul([s, c, a], \"h\")\r\n else:\r\n if not c in awaycards:\r\n awaycards[c] = 0\r\n awaycards[c] += 1\r\n if awaycards[c] == 2:\r\n newfoul([t, c, a], \"a\")\r\nfor x in fouls:\r\n print(\" \".join(map(str, x)))\r\n", "__author__ = 'Administrator'\r\n\r\n\r\ndef inp():\r\n return input()\r\n\r\n\r\nhome = inp()\r\naway = inp()\r\nn = int(inp())\r\n\r\n\r\nclass Node:\r\n time = 0\r\n team = 0\r\n num = 0\r\n color = 0\r\n\r\n def __lt__(self, other):\r\n return self.time < other.time\r\n\r\n def __init__(self, a, b, c, d):\r\n self.time = a\r\n self.team = b\r\n self.num = c\r\n self.color = d\r\n\r\n\r\ni = 0\r\nlt = []\r\nwhile i < n:\r\n temp = inp().split(' ')\r\n o = Node(int(temp[0]), temp[1] == 'h', int(temp[2]), temp[3] == 'r')\r\n lt.append(o)\r\n i += 1\r\na = [0 for i in range(100)]\r\nb = [0 for i in range(100)]\r\nlt.sort()\r\ni = 0\r\nwhile i < n:\r\n # print(lt[i].time, lt[i].team, lt[i].num, lt[i].color)\r\n if lt[i].team:\r\n if a[lt[i].num] < 2:\r\n if lt[i].color:\r\n a[lt[i].num] += 2\r\n else:\r\n a[lt[i].num] += 1\r\n if a[lt[i].num] >= 2:\r\n print(home, ' ', lt[i].num, ' ', lt[i].time)\r\n else:\r\n pass\r\n else:\r\n pass\r\n else:\r\n if b[lt[i].num] < 2:\r\n if lt[i].color:\r\n b[lt[i].num] += 2\r\n else:\r\n b[lt[i].num] += 1\r\n if b[lt[i].num] >= 2:\r\n print(away, ' ', lt[i].num, ' ', lt[i].time)\r\n else:\r\n pass\r\n else:\r\n pass\r\n i += 1\r\n# print(\"---end\\n\")", "home = input()\naway = input()\nn = int(input())\nvec = []\narr = []\nfor i in range(n):\n arr.append(list(input().split(' ')))\nmp1 = {}\nmp2 = {}\nres1 = {}\nres2 = {}\n\nfor i in range(n):\n min,team_name,player,card_color=arr[i][0],arr[i][1],arr[i][2],arr[i][3]\n\n if card_color=='y' and team_name=='h' and player not in mp1:\n mp1[player]=True\n\n elif card_color=='y' and team_name=='a' and player not in mp2:\n mp2[player]=True\n\n elif card_color=='y' and team_name=='h' and player in mp1:\n ans = ''\n if player not in res1 :\n res1[player]=True\n ans+=home\n ans+=' '\n ans+= player\n ans+=' '\n ans+= min\n vec.append(ans)\n\n elif card_color=='y' and team_name=='a' and player in mp2:\n ans = ''\n if player not in res2:\n res2[player]=True\n ans += away\n ans+=' '\n ans+=player\n ans+=' '\n ans+=min\n vec.append(ans)\n\n elif card_color=='r':\n ans = ''\n if team_name=='a':\n if player not in res2:\n res2[player]=True\n ans += away\n ans+=' '\n ans+= player\n ans+=' '\n ans+= min\n vec.append(ans)\n else:\n ans=''\n if player not in res1:\n res1[player]=True\n ans += home\n ans+=' '\n ans+=player\n ans+= ' '\n ans+= min\n vec.append(ans)\nfor i in vec:\n print (i)\n", "team = {\"h\" : input(),\n \"a\" : input()}\nn = int(input())\nd = {}\nlis = []\nfor x in range(n):\n t, ha, num, card = input().split() \n t = int(t)\n num = int(num)\n lis.append((t,ha,num,card))\nlis.sort(key=lambda x:x[0])\n\nfor x in range(n):\n t, ha, num, card = lis[x] \n if (ha,num) not in d: \n d[(ha,num)] = (t,card)\n if card == \"r\":\n print(team[ha], num, t)\n else:\n if d[(ha,num)][1] == \"y\":\n d[(ha,num)] = (t,\"r\")\n print(team[ha], num, t)\n", "home=input()\r\naway=input()\r\nn=int(input())\r\nyellows=set()\r\nreds=set()\r\ns={'h':home,'a':away}\r\nwhile n:\r\n x=input().split()\r\n time=int(x[0])\r\n team=x[1]\r\n shirt=int(x[2])\r\n card=x[3]\r\n if card=='y':\r\n if (shirt,team) in yellows and (shirt,team) not in reds:#2nd time\r\n print(s[team],shirt,time)\r\n yellows.remove((shirt,team))\r\n reds.add((shirt,team))\r\n else:#1st time\r\n yellows.add((shirt,team))\r\n else:\r\n if(shirt,team) not in reds:\r\n reds.add((shirt,team))\r\n print(s[team],shirt,time)\r\n n-=1", "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, home, away = f.readline().rstrip().split()\r\n # n = int(n)\r\n home = f.readline().rstrip()\r\n away = f.readline().rstrip()\r\n n = int(f.readline())\r\n\r\n fouls = []\r\n for _ in range(n):\r\n moment, team, jersey, card = f.readline().rstrip().split()\r\n fouls.append((int(moment), team, int(jersey), card))\r\n return n, home, away, fouls\r\n\r\n\r\ndef sol(n, home, away, fouls):\r\n fouls = sorted(fouls)\r\n is_yellow = {\r\n \"a\": set(),\r\n \"h\": set()\r\n }\r\n suspend = []\r\n suspend_players = set()\r\n for foul in fouls:\r\n moment, team, jersey, card = foul\r\n if f\"{team}{jersey}\" in suspend_players:\r\n continue\r\n if card == \"r\":\r\n suspend.append((home if team == \"h\" else away, jersey, moment))\r\n suspend_players.add(f\"{team}{jersey}\")\r\n elif card == \"y\":\r\n if jersey in is_yellow[team]:\r\n suspend.append((home if team == \"h\" else away, jersey, moment))\r\n suspend_players.add(f\"{team}{jersey}\")\r\n else:\r\n is_yellow[team].add(jersey)\r\n\r\n res = []\r\n for player in suspend:\r\n res.append(' '.join(map(str, player)))\r\n return res\r\n\r\n\r\ndef solve(input_path=None):\r\n return sol(*read_input(input_path))\r\n\r\n\r\ndef main():\r\n for line in sol(*read_input()):\r\n print(f\"{line}\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "class Command:\r\n def __init__(self, name):\r\n self.name = name\r\n self.d = {}\r\n self.rC = []\r\n \r\n def add(self, i):\r\n numb = i[2]\r\n pl = self.d.get(numb)\r\n if not pl:\r\n self.d[numb] = [i[0],i[3]]\r\n if i[3] == 'r':\r\n self.rC.append( [numb,i[0]] )\r\n else:\r\n if i[3] == 'y' and pl[1] == 'y':\r\n self.d[numb] = [i[0],'r']\r\n self.rC.append( [numb,i[0]] )\r\n elif pl[1] == 'r':\r\n pass\r\n else:\r\n self.d[numb] = [i[0],i[3]]\r\n if i[3] == 'r':\r\n self.rC.append( [numb,i[0]] )\r\n\r\n def getMinRes(self):\r\n if len(self.rC):\r\n return [self.name] + self.rC[0]\r\n\r\n def delMinRes(self):\r\n self.rC.pop(0)\r\n\r\nclass Game:\r\n def __init__(self, n1, n2):\r\n self.n1 = Command(n1)\r\n self.n2 = Command(n2)\r\n\r\n def parse(self, s):\r\n l = s.split(' ')\r\n if l[1] == 'h':\r\n self.n1.add(l)\r\n else:\r\n self.n2.add(l)\r\n\r\n def getRes(self):\r\n while 1:\r\n n1 = self.n1.getMinRes()\r\n n2 = self.n2.getMinRes()\r\n if n1 and n2:\r\n if int(n1[2]) < int(n2[2]):\r\n self.printRes(n1)\r\n self.n1.delMinRes()\r\n else:\r\n self.printRes(n2)\r\n self.n2.delMinRes()\r\n elif n1:\r\n self.printRes(n1)\r\n self.n1.delMinRes()\r\n elif n2:\r\n self.printRes(n2)\r\n self.n2.delMinRes()\r\n else:\r\n break\r\n\r\n def printRes(self, a):\r\n print('{} {} {}'.format(a[0], a[1], a[2]))\r\n\r\nfirst = input()\r\nsec = input()\r\ng = Game(first,sec)\r\nn = int(input())\r\ns = []\r\nfor i in range(n):\r\n l = input()\r\n s.append(l)\r\n# g = Game('A','B')\r\n# s = ['5 a 84 y',\r\n# '8 h 28 r',\r\n# '10 a 9 r',\r\n# '11 h 93 y',\r\n# '13 a 11 r',\r\n# '15 h 3 r',\r\n# '20 a 88 r',\r\n# '23 a 41 y',\r\n# '25 a 14 y',\r\n# '27 a 38 r',\r\n# '28 a 33 y',\r\n# '29 h 66 r',\r\n# '31 a 16 r',\r\n# '32 a 80 y',\r\n# '34 a 54 r',\r\n# '35 a 50 y',\r\n# '36 a 9 y',\r\n# '39 a 22 y',\r\n# '42 h 81 y',\r\n# '43 a 10 y',\r\n# '44 a 27 r',\r\n# '47 h 39 y',\r\n# '48 a 80 y',\r\n# '50 h 5 y',\r\n# '52 a 67 y',\r\n# '54 h 63 y',\r\n# '56 h 7 y',\r\n# '57 h 44 y',\r\n# '58 h 41 y',\r\n# '61 h 32 y',\r\n# '64 h 91 y',\r\n# '67 a 56 y',\r\n# '69 h 83 y',\r\n# '71 h 59 y',\r\n# '72 a 76 y',\r\n# '75 h 41 y',\r\n# '76 a 49 r',\r\n# '77 a 4 r',\r\n# '78 a 69 y',\r\n# '79 a 96 r',\r\n# '80 h 81 y',\r\n# '86 h 85 r']\r\n\r\nfor i in range(len(s)):\r\n g.parse(s[i])\r\n\r\ng.getRes()", "tn = [input(), input()]\r\nt2i = {'h': 0, 'a': 1}\r\nc2s = {'y': 1, 'r': 2}\r\nst = [[0] * 100, [0] * 100]\r\nfor i in range(int(input())):\r\n m, t, p, c = input().split()\r\n m = int(m)\r\n t = t2i[t]\r\n p = int(p)\r\n s = c2s[c]\r\n if st[t][p] < 2:\r\n st[t][p] += s\r\n if st[t][p] >= 2:\r\n print(tn[t], p, m)", "home = input()\r\naway = input()\r\nn = int(input())\r\nhT = {}\r\nhSet = {}\r\naT = {}\r\naSet = {}\r\nreds = []\r\nfor i in range(n):\r\n List = input().split()\r\n t = List[0]\r\n if List[1] == \"h\":\r\n if List[2] in hT:\r\n hT[List[2]] = \"r\"\r\n else:\r\n hT[List[2]] = List[3]\r\n if hT[List[2]] == \"r\":\r\n reds.append([home, List[2], t])\r\n else:\r\n if List[2] in aT:\r\n aT[List[2]] = \"r\"\r\n else:\r\n aT[List[2]] = List[3]\r\n if aT[List[2]] == \"r\":\r\n reds.append([away, List[2], t])\r\n\r\n\r\nSet = set()\r\nfor red in reds:\r\n if not (red[0], red[1]) in Set:\r\n print(red[0], red[1], red[2])\r\n Set.add((red[0], red[1]))\r\n", "# coding: utf-8\nhome = input()\naway = input()\nn = int(input())\nhomey = set()\nhomer = set()\nawayy = set()\nawayr = set()\nans = []\nfor i in range(n):\n tmp = input().split()\n if tmp[1] == 'h':\n if tmp[2] in homer:\n continue\n if tmp[3] == 'r':\n ans.append(' '.join([home, tmp[2], tmp[0]]))\n homer.add(tmp[2])\n elif tmp[2] in homey:\n ans.append(' '.join([home, tmp[2], tmp[0]]))\n homer.add(tmp[2])\n else:\n homey.add(tmp[2])\n else:\n if tmp[2] in awayr:\n continue\n if tmp[3] == 'r':\n ans.append(' '.join([away, tmp[2], tmp[0]]))\n awayr.add(tmp[2])\n elif tmp[2] in awayy:\n ans.append(' '.join([away, tmp[2], tmp[0]]))\n awayr.add(tmp[2])\n else:\n awayy.add(tmp[2])\nfor ln in ans:\n print(ln)\n", "teams = [input(), input()]\r\nn = int(input())\r\ncnt = [0]*10000\r\nused = [False]*10000\r\nfor i in range(n):\r\n time, t, m, c = input().split()\r\n m = int(m)\r\n if t != 'h':\r\n m += 1000\r\n if c == 'y':\r\n cnt[m] += 1\r\n else:\r\n cnt[m] += 2\r\n if cnt[m] >= 2 and not used[m]:\r\n used[m] = True\r\n m %= 1000\r\n ans = \"\"\r\n if t == 'h':\r\n ans += teams[0]\r\n else:\r\n ans += teams[1]\r\n ans += ' '\r\n ans = ans + str(m)\r\n ans += ' '\r\n ans += time\r\n print(ans)", "team_1=input()\r\nteam_2=input()\r\nn=int(input())\r\nll=[]\r\nfor i in range(n):\r\n\tmi, te, num, card=map(str, input().split())\r\n\tll.append((int(mi), te, int(num), card))\r\nll.sort(key=lambda x :x[0])\r\n\r\nteam_1_p=[0 for x in range(101)]\r\nteam_2_p=[0 for x in range(101)]\r\nd_1, d_2={}, {}\r\nsol=[]\r\nfor l in ll:\r\n\tif l[1]=='h':\r\n\t\tif l[3]=='r':\r\n\t\t\tif l[2] not in d_1:\r\n\t\t\t\tsol.append((team_1, l[2], l[0]))\r\n\t\t\t\td_1[l[2]]=True\r\n\t\telif l[3]=='y':\r\n\t\t\tif team_1_p[l[2]]==0:\r\n\t\t\t\tteam_1_p[l[2]]+=1\r\n\t\t\telse:\r\n\t\t\t\tif l[2] not in d_1:\r\n\t\t\t\t\tsol.append((team_1, l[2], l[0]))\r\n\t\t\t\t\td_1[l[2]]=True\r\n\tif l[1]=='a':\r\n\t\tif l[3]=='r':\r\n\t\t\tif l[2] not in d_2:\r\n\t\t\t\tsol.append((team_2, l[2], l[0]))\r\n\t\t\t\td_2[l[2]]=True\r\n\t\telif l[3]=='y':\r\n\t\t\tif team_2_p[l[2]]==0:\r\n\t\t\t\tteam_2_p[l[2]]+=1\r\n\t\t\telse:\r\n\t\t\t\tif l[2] not in d_2:\r\n\t\t\t\t\tsol.append((team_2, l[2], l[0]))\r\n\t\t\t\t\td_2[l[2]]=True\r\n\r\nfor x in sol:\r\n\tprint(*x)\r\n", "__author__ = 'zhan'\n\nnames = []\nn = 0\nteam = [[0 for i in range(1, 101)], [0 for i in range(1, 101)]]\nteam_index = {\"h\": 0, \"a\": 1}\ncard_index = {\"y\": 1, \"r\": 2}\nnames.append(input())\nnames.append(input())\nn = int(input())\n\nfor i in range(n):\n line = input().split()\n t = line[0]\n tm = line[1]\n number = int(line[2])\n card = line[3]\n team[team_index[tm]][number] += card_index[card]\n if team[team_index[tm]][number] >= 2:\n team[team_index[tm]][number] = -200\n print(names[team_index[tm]] + \" \" + str(number) + \" \" + str(t))", "a=input();b=input()\r\nta={};tb={}\r\nfor x in range(int(input())):\r\n m,t,n,c= input().split()\r\n if t=='a' and ((True if ta[n]<2 else False) if n in ta else True):\r\n if n in ta:ta[n]+=1 if c=='y' else 2\r\n else:ta[n]=1 if c=='y' else 2\r\n if ta[n]>1: print(b,n,m)\r\n elif t=='h' and ((True if tb[n]<2 else False) if n in tb else True):\r\n if n in tb:tb[n]+=1 if c=='y' else 2\r\n else:tb[n]=1 if c=='y' else 2\r\n if tb[n] > 1: print(a, n, m)", "home = input()\r\naway = input()\r\ns = set()\r\nred = set()\r\nfor _ in range(int(input())):\r\n\tl = list(map(str, input().split()))\r\n\tt = tuple(l[1:-1])\r\n\tif l[-1] == \"r\":\r\n\t\tif l[1] == \"a\" and t not in red:\r\n\t\t\tprint(away, l[-2], l[0])\r\n\t\t\tred.add(t)\r\n\t\telif t not in red:\r\n\t\t\tprint(home, l[-2], l[0])\r\n\t\t\tred.add(t)\r\n\telse:\r\n\t\tif t in s:\r\n\t\t\tif l[1] == \"a\" and t not in red:\r\n\t\t\t\tprint(away, l[-2], l[0])\r\n\t\t\t\tred.add(t)\r\n\t\t\telif t not in red:\r\n\t\t\t\tprint(home, l[-2], l[0])\r\n\t\t\t\tred.add(t)\r\n\ts.add(t)\r\n\r\n\t", "name = {}\r\nname['h'] = input()\r\nname['a'] = input()\r\nn = int(input())\r\ninfo = {}\r\nfor i in range(n):\r\n m, t, p, c = input().split()\r\n m = int(m)\r\n p = int(p)\r\n if c == 'r' and not ((t, p) in info and info[(t, p)] == 'r'):\r\n print(name[t], p, m)\r\n info[(t, p)] = 'r'\r\n elif c == 'y':\r\n if (t, p) in info and info[(t, p)] != 'r':\r\n print(name[t], p, m)\r\n info[(t, p)] = 'r'\r\n elif not (t, p) in info:\r\n info[(t, p)] = c\r\n", "s = input()\r\nt = input()\r\ns.rstrip()\r\nt.rstrip()\r\nn = int(input())\r\na = [0] * (100)\r\nb = [0] * (100)\r\nfor i in range(n):\r\n e = list(map(str,input().split()))\r\n if (e[1] == 'h'):\r\n if (a[int(e[2])] != -1):\r\n if (e[3] == 'y'):\r\n a[int(e[2])] = a[int(e[2])] + 1\r\n elif (e[3] == 'r'):\r\n a[int(e[2])] = a[int(e[2])] + 2\r\n if (a[int(e[2])] >= 2):\r\n print(s,int(e[2]),e[0])\r\n a[int(e[2])] = -1\r\n else:\r\n if (b[int(e[2])] != -1):\r\n if (e[3] == 'y'):\r\n b[int(e[2])] = b[int(e[2])] + 1\r\n elif (e[3] == 'r'):\r\n b[int(e[2])] = b[int(e[2])] + 2\r\n if (b[int(e[2])] >= 2):\r\n print(t,int(e[2]),e[0])\r\n b[int(e[2])] = -1", "# your code goes here\r\na = input()\r\nb = input()\r\nn = int(input())\r\ndic = {}\r\nfor i in range(n):\r\n\tarray = input().split()\r\n\tmark = (a if array[1] == 'h' else b) + ' ' + array[2]\r\n\tif mark not in dic:\r\n\t\tdic[mark] = 0\r\n\tif dic[mark] < 2:\r\n\t\tif array[3] == 'y':\r\n\t\t\tdic[mark] += 1\r\n\t\tif array[3] == 'r':\r\n\t\t\tdic[mark] += 2\r\n\t\tif dic[mark] >=2:\r\n\t\t\tprint(mark,array[0])", "h = input()\r\na = input()\r\nn = int(input())\r\nd = dict()\r\nfor i in range(n):\r\n arr = input().split()\r\n mark = (h if arr[1] == 'h' else a) + ' ' + arr[2]\r\n if mark not in d:\r\n d[mark] = 0\r\n if d[mark] < 2:\r\n d[mark] += 1 if arr[3] == 'y' else 2\r\n if d[mark] >= 2:\r\n print(mark, arr[0])", "teamname = []\r\nteamname.append(input().strip())\r\nteamname.append(input().strip())\r\n\r\nn = int(input())\r\nfoul = [[0 for m in range(100)] for i in range(2)]\r\n\r\nfor i in range(n):\r\n info = input().split()\r\n t = int(info[0])\r\n team = info[1]\r\n m = int(info[2])\r\n card = info[3]\r\n\r\n if team=='h': td = 0\r\n else: td = 1\r\n \r\n if foul[td][m]>=2: continue\r\n if card=='y': foul[td][m] += 1\r\n else: foul[td][m] += 2\r\n if foul[td][m]>=2:\r\n print('{0} {1} {2}'.format(teamname[td], m, t))\r\n\r\n \r\n \r\n \r\n\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\nimport time\n\nhome = input()\nguest = input()\n\nhome_fall = {str(i):0 for i in range(1, 100)}\nguest_fall= {str(i):0 for i in range(1, 100)}\n\nn = int(input())\n\nstart = time.time()\nfor i in range(n):\n (t, command, n, card) = (i for i in input().split())\n\n if (command == 'h'):\n table = home_fall\n else:\n table = guest_fall\n\n if ( card == 'y' and table[n] == 0 ):\n table[n] = -1\n elif ( card == 'y' and table[n] == -1 ) or (card == 'r' and table[n] <= 0 ):\n table[n] = int(t)\n\nfalls = []\nfor i in home_fall.keys():\n if home_fall[i] > 0:\n falls.append([home, i, home_fall[i]])\n\nfor i in guest_fall.keys():\n if guest_fall[i] > 0:\n falls.append([guest, i, guest_fall[i]])\n\nfalls = sorted(falls, key=lambda x: x[::-1])\n\nfor i in falls:\n s = \"\"\n for j in i:\n s += str(j)+\" \"\n print(s)\n\nfinish = time.time()\n#print(finish - start)\n", "import collections\n\n\na = input()\nb = input()\nstats = collections.defaultdict(int)\nremoved = set()\nfor _ in range(int(input())):\n\n minute, team, number, card = str.split(input())\n player = team + number\n stats[player] += int(1 if card == \"y\" else 2)\n if stats[player] > 1 and player not in removed:\n\n removed.add(player)\n print(\n a if team == \"h\" else b,\n number,\n minute,\n )\n", "teams = dict()\nteams['h'] = input()\nteams['a'] = input()\nn = int(input())\ndata = {}\nreport = []\nfor _ in range(n):\n time, team, num, card = input().split()\n name = team+num\n if name not in data:\n data[name] = card\n if card == 'r':\n report.append(\"{} {} {}\".format(teams[team], num, time))\n elif data[name] == 'y':\n report.append(\"{} {} {}\".format(teams[team], num, time))\n data[name] = 'r'\n\nprint('\\n'.join(report))\n", "from math import *\r\n \r\nt1 = input()\r\nt2 = input()\r\n \r\nm1, m2 = {}, {}\r\nfor i in range(int(input())):\r\n t, time, n, cor = input().split()\r\n n = int(n)\r\n \r\n if (time == 'h' and (n not in m1 or m1[n] != 'r')) or (time == 'a' and (n not in m2 or m2[n] != 'r')):\r\n if (time == 'h' and (n in m1 and m1[n] == 'y' or cor == 'r')) or (time == 'a' and (n in m2 and m2[n] == 'y' or cor == 'r')):\r\n if time == \"h\":\r\n m1[n] = 'r'\r\n else:\r\n m2[n] = 'r'\r\n print((t1 if time == 'h' else t2), n, t)\r\n else:\r\n if time == \"h\":\r\n m1[n] = 'y'\r\n else:\r\n m2[n] = 'y'", "def main():\r\n home = input()\r\n away = input()\r\n n = int(input())\r\n cards = {}\r\n teams = {}\r\n teams['h'] = home\r\n teams['a'] = away\r\n for i in range(n):\r\n t,team,m,card = map(str,input().split())\r\n t = int(t)\r\n m = int(m)\r\n curr = (team,m)\r\n if curr not in cards.keys():\r\n cards[(team,m)] = [[card,1]]\r\n if card == 'r':\r\n print(teams[team],m,t)\r\n else:\r\n if len(cards[(team,m)]) == 1:\r\n if cards[(team,m)][0][0] == 'y' and cards[(team,m)][0][1] == 1:\r\n print(teams[team],m,t)\r\n cards[(team,m)][0][1] += 1\r\n\r\n #print(cards)\r\n\r\nmain()\r\n", "teams = [input(),input()]\nn = int(input())\nyel = []\nred = []\n\ndef convert(t,n):\n global teams\n s = \"\"\n if t == 'a':\n s += teams[1] + ' '\n else:\n s += teams[0] + ' '\n return s + n\n\nfor foul in range(n):\n a = input().split()\n temp = convert(a[1],a[2])\n if a[-1] == 'y':\n if temp in yel:\n yel.remove(temp)\n red.append(temp)\n print(temp + ' ' + a[0])\n elif temp in red:\n continue\n else:\n yel.append(temp)\n elif a[-1] == 'r':\n temp = convert(a[1],a[2])\n if temp in red:\n continue\n else:\n print(temp + ' ' + a[0])\n red.append(temp)\n", "home = input()\r\nalien = input()\r\nn = int(input())\r\ntime = ['']*91\r\ncards = [[0]*2 for i in range(100)]\r\nans = []\r\nl = 0\r\n\r\nfor i in range(n):\r\n c = input().split()\r\n t = int(c[0])\r\n m = int(c[2])\r\n \r\n if c[1] == 'h':\r\n time[t] += home + ' ' + str(m) + ' '\r\n id = 0\r\n else:\r\n time[t] += alien + ' ' + str(m) + ' '\r\n id = 1\r\n \r\n if c[3] == 'y':\r\n cards[m][id] += 1\r\n else:\r\n if cards[m][id] < 2:\r\n cards[m][id] = 2\r\n else:\r\n cards[m][id] += 2\r\n \r\n if cards[m][id] == 2:\r\n time[t] += str(t)\r\n ans.append(time[t])\r\n l += 1\r\n \r\nfor i in range(l):\r\n print(ans[i])", "\"\"\"\r\nCodeforces Contest 281 Div 2 Problem A\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.3.4\r\n\"\"\"\r\n\r\ndef main():\r\n s1 = read(0)\r\n s2 = read(0)\r\n n, = read()\r\n arr = dict()\r\n res = []\r\n for i in range(n):\r\n w,x,y,z = read(1)\r\n w = int(w)\r\n if x+y in arr.keys():\r\n if arr[x+y][1] != \"r\":\r\n res.append((x,y,w))\r\n arr[x+y] = (w, \"r\")\r\n else:\r\n arr[x+y] = (w, z)\r\n if arr[x+y][1] == \"r\":\r\n res.append((x,y,w))\r\n for x,y,w in res:\r\n print(s1 if x == \"h\" else s2, y, w)\r\n\r\n################################### NON-SOLUTION STUFF BELOW\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 list(map(int, inputs.split()))\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\nwrite(main())", "team_one = input()\nteam_two = input()\nn = int(input())\npts_one = [0 for i in range(100)]\npts_two = [0 for i in range(100)]\nfor i in range(n):\n\tline = input()\n\tt, team, m, card = line.split()\n\tt = int(t)\n\tm = int(m)\n\tfault = 0\n\tif card == 'y':\n\t\tfault = 1\n\telse: fault = 2\n\tif team == 'h':\n\t\tpts_one[m] += fault\n\t\tif pts_one[m] == 2 or (pts_one[m] == 3 and fault == 2):\n\t\t\tprint(team_one, m, t)\n\telif team == 'a':\n\t\tpts_two[m] += fault\n\t\tif pts_two[m] == 2 or (pts_two[m] == 3 and fault == 2):\n\t\t\tprint(team_two, m, t)\n" ]

{"inputs": ["MC\nCSKA\n9\n28 a 3 y\n62 h 25 y\n66 h 42 y\n70 h 25 y\n77 a 4 y\n79 a 25 y\n82 h 42 r\n89 h 16 y\n90 a 13 r", "REAL\nBARCA\n3\n27 h 7 y\n44 a 10 y\n87 h 3 r", "MASFF\nSAFBDSRG\n5\n1 h 1 y\n15 h 1 r\n27 a 1 y\n58 a 1 y\n69 h 10 y", "ARMENIA\nBULGARIA\n12\n33 h 17 y\n42 h 21 y\n56 a 17 y\n58 a 6 y\n61 a 7 y\n68 a 10 y\n72 h 13 y\n73 h 21 y\n74 a 8 r\n75 a 4 y\n77 a 10 y\n90 a 23 y", "PORTUGAL\nNETHERLANDS\n16\n2 a 18 y\n7 a 3 y\n20 h 18 y\n31 h 6 y\n45 h 6 y\n50 h 8 y\n59 a 5 y\n60 h 7 y\n63 a 3 y\n72 a 20 y\n73 h 20 y\n74 a 10 y\n75 h 1 y\n76 h 14 y\n78 h 20 y\n90 a 5 y", "TANC\nXNCOR\n2\n15 h 27 r\n28 h 27 r", "ASGDFJH\nAHGRSDXGER\n3\n23 h 15 r\n68 h 15 y\n79 h 15 y", "ASFSHDSG\nADGYRTJNG\n5\n1 h 1 y\n2 h 1 y\n3 h 1 y\n4 h 1 r\n5 h 1 y", "A\nB\n42\n5 a 84 y\n8 h 28 r\n10 a 9 r\n11 h 93 y\n13 a 11 r\n15 h 3 r\n20 a 88 r\n23 a 41 y\n25 a 14 y\n27 a 38 r\n28 a 33 y\n29 h 66 r\n31 a 16 r\n32 a 80 y\n34 a 54 r\n35 a 50 y\n36 a 9 y\n39 a 22 y\n42 h 81 y\n43 a 10 y\n44 a 27 r\n47 h 39 y\n48 a 80 y\n50 h 5 y\n52 a 67 y\n54 h 63 y\n56 h 7 y\n57 h 44 y\n58 h 41 y\n61 h 32 y\n64 h 91 y\n67 a 56 y\n69 h 83 y\n71 h 59 y\n72 a 76 y\n75 h 41 y\n76 a 49 r\n77 a 4 r\n78 a 69 y\n79 a 96 r\n80 h 81 y\n86 h 85 r", "ARM\nAZE\n45\n2 a 13 r\n3 a 73 r\n4 a 10 y\n5 h 42 y\n8 h 56 y\n10 h 15 y\n11 a 29 r\n13 a 79 y\n14 a 77 r\n18 h 7 y\n20 a 69 r\n22 h 19 y\n25 h 88 r\n26 a 78 y\n27 a 91 r\n28 h 10 r\n30 h 13 r\n31 a 26 r\n33 a 43 r\n34 a 91 y\n40 h 57 y\n44 h 18 y\n46 a 25 r\n48 a 29 y\n51 h 71 y\n57 a 16 r\n58 h 37 r\n59 h 92 y\n60 h 11 y\n61 a 88 y\n64 a 28 r\n65 h 71 r\n68 h 39 y\n70 h 8 r\n71 a 10 y\n72 a 32 y\n73 h 95 r\n74 a 33 y\n75 h 48 r\n78 a 44 y\n79 a 22 r\n80 h 50 r\n84 a 50 y\n88 a 90 y\n89 h 42 r", "KASFLS\nASJBGGDLJFDDFHHTHJH\n42\n2 a 68 y\n4 h 64 r\n5 a 24 y\n6 h 20 r\n8 a 16 r\n9 a 96 y\n10 h 36 r\n12 a 44 y\n13 h 69 r\n16 a 62 r\n18 a 99 r\n20 h 12 r\n21 a 68 y\n25 h 40 y\n26 h 54 r\n28 h 91 r\n29 a 36 r\n33 a 91 y\n36 h 93 r\n37 h 60 r\n38 a 82 r\n41 a 85 y\n42 a 62 r\n46 a 22 r\n48 a 88 r\n49 a 8 r\n51 h 45 y\n54 a 84 y\n57 a 8 y\n59 h 24 y\n61 h 22 r\n64 h 11 r\n69 a 89 y\n72 h 44 r\n75 h 57 r\n76 h 80 y\n77 h 54 r\n79 a 1 y\n81 a 31 r\n82 h 8 y\n83 a 28 r\n86 h 56 y", "AB\nBC\n3\n1 h 1 y\n2 h 1 y\n3 h 1 r"], "outputs": ["MC 25 70\nMC 42 82\nCSKA 13 90", "REAL 3 87", "MASFF 1 15\nSAFBDSRG 1 58", "ARMENIA 21 73\nBULGARIA 8 74\nBULGARIA 10 77", "PORTUGAL 6 45\nNETHERLANDS 3 63\nPORTUGAL 20 78\nNETHERLANDS 5 90", "TANC 27 15", "ASGDFJH 15 23", "ASFSHDSG 1 2", "A 28 8\nB 9 10\nB 11 13\nA 3 15\nB 88 20\nB 38 27\nA 66 29\nB 16 31\nB 54 34\nB 27 44\nB 80 48\nA 41 75\nB 49 76\nB 4 77\nB 96 79\nA 81 80\nA 85 86", "AZE 13 2\nAZE 73 3\nAZE 29 11\nAZE 77 14\nAZE 69 20\nARM 88 25\nAZE 91 27\nARM 10 28\nARM 13 30\nAZE 26 31\nAZE 43 33\nAZE 25 46\nAZE 16 57\nARM 37 58\nAZE 28 64\nARM 71 65\nARM 8 70\nAZE 10 71\nARM 95 73\nARM 48 75\nAZE 22 79\nARM 50 80\nARM 42 89", "KASFLS 64 4\nKASFLS 20 6\nASJBGGDLJFDDFHHTHJH 16 8\nKASFLS 36 10\nKASFLS 69 13\nASJBGGDLJFDDFHHTHJH 62 16\nASJBGGDLJFDDFHHTHJH 99 18\nKASFLS 12 20\nASJBGGDLJFDDFHHTHJH 68 21\nKASFLS 54 26\nKASFLS 91 28\nASJBGGDLJFDDFHHTHJH 36 29\nKASFLS 93 36\nKASFLS 60 37\nASJBGGDLJFDDFHHTHJH 82 38\nASJBGGDLJFDDFHHTHJH 22 46\nASJBGGDLJFDDFHHTHJH 88 48\nASJBGGDLJFDDFHHTHJH 8 49\nKASFLS 22 61\nKASFLS 11 64\nKASFLS 44 72\nKASFLS 57 75\nASJBGGDLJFDDFHHTHJH 31 81\nASJBGGDLJFDDFHHTHJH 28 83", "AB 1 2"]}

UNKNOWN

PYTHON3

CODEFORCES

48

8a91e345120c4e99d41dd166b1ac3025

Gerald and Giant Chess

Giant chess is quite common in Geraldion. We will not delve into the rules of the game, we'll just say that the game takes place on an *h*<=×<=*w* field, and it is painted in two colors, but not like in chess. Almost all cells of the field are white and only some of them are black. Currently Gerald is finishing a game of giant chess against his friend Pollard. Gerald has almost won, and the only thing he needs to win is to bring the pawn from the upper left corner of the board, where it is now standing, to the lower right corner. Gerald is so confident of victory that he became interested, in how many ways can he win? The pawn, which Gerald has got left can go in two ways: one cell down or one cell to the right. In addition, it can not go to the black cells, otherwise the Gerald still loses. There are no other pawns or pieces left on the field, so that, according to the rules of giant chess Gerald moves his pawn until the game is over, and Pollard is just watching this process. The first line of the input contains three integers: *h*,<=*w*,<=*n* — the sides of the board and the number of black cells (1<=≤<=*h*,<=*w*<=≤<=105,<=1<=≤<=*n*<=≤<=2000). Next *n* lines contain the description of black cells. The *i*-th of these lines contains numbers *r**i*,<=*c**i* (1<=≤<=*r**i*<=≤<=*h*,<=1<=≤<=*c**i*<=≤<=*w*) — the number of the row and column of the *i*-th cell. It is guaranteed that the upper left and lower right cell are white and all cells in the description are distinct. Print a single line — the remainder of the number of ways to move Gerald's pawn from the upper left to the lower right corner modulo 109<=+<=7. Sample Input 3 4 2 2 2 2 3 100 100 3 15 16 16 15 99 88 Sample Output 2 545732279

[ "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\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\ndef Extended_Euclid(n,m):\r\n stack=[]\r\n while m:\r\n stack.append((n,m))\r\n n,m=m,n%m\r\n if n>=0:\r\n x,y=1,0\r\n else:\r\n x,y=-1,0\r\n for i in range(len(stack)-1,-1,-1):\r\n n,m=stack[i]\r\n x,y=y,x-(n//m)*y\r\n return x,y\r\n\r\nclass MOD:\r\n def __init__(self,p,e=1):\r\n self.p=p\r\n self.e=e\r\n self.mod=self.p**self.e\r\n\r\n def Pow(self,a,n):\r\n a%=self.mod\r\n if n>=0:\r\n return pow(a,n,self.mod)\r\n else:\r\n assert math.gcd(a,self.mod)==1\r\n x=Extended_Euclid(a,self.mod)[0]\r\n return pow(x,-n,self.mod)\r\n\r\n def Build_Fact(self,N):\r\n assert N>=0\r\n self.factorial=[1]\r\n self.cnt=[0]*(N+1)\r\n for i in range(1,N+1):\r\n ii=i\r\n self.cnt[i]=self.cnt[i-1]\r\n while ii%self.p==0:\r\n ii//=self.p\r\n self.cnt[i]+=1\r\n self.factorial.append((self.factorial[-1]*ii)%self.mod)\r\n self.factorial_inve=[None]*(N+1)\r\n self.factorial_inve[-1]=self.Pow(self.factorial[-1],-1)\r\n for i in range(N-1,-1,-1):\r\n ii=i+1\r\n while ii%self.p==0:\r\n ii//=self.p\r\n self.factorial_inve[i]=(self.factorial_inve[i+1]*ii)%self.mod\r\n\r\n def Fact(self,N):\r\n return self.factorial[N]*pow(self.p,self.cnt[N],self.mod)%self.mod\r\n\r\n def Fact_Inve(self,N):\r\n if self.cnt[N]:\r\n return None\r\n return self.factorial_inve[N]\r\n\r\n def Comb(self,N,K,divisible_count=False):\r\n if K<0 or K>N:\r\n return 0\r\n retu=self.factorial[N]*self.factorial_inve[K]*self.factorial_inve[N-K]%self.mod\r\n cnt=self.cnt[N]-self.cnt[N-K]-self.cnt[K]\r\n if divisible_count:\r\n return retu,cnt\r\n else:\r\n retu*=pow(self.p,cnt,self.mod)\r\n retu%=self.mod\r\n return retu\r\n\r\nH,W,N=map(int,readline().split())\r\nH-=1\r\nW-=1\r\nmod=10**9+7\r\nMD=MOD(mod)\r\nMD.Build_Fact(2*10**5)\r\nhw=[]\r\nfor _ in range(N):\r\n h,w=map(int,readline().split())\r\n h-=1;w-=1\r\n hw.append((h,w))\r\nhw.sort()\r\nh,w=[h for h,w in hw],[w for h,w in hw]\r\ndp0,dp1=[0]*N,[0]*N\r\nfor j in range(N):\r\n dp1[j]=MD.Comb(h[j]+w[j],h[j])\r\n for i in range(j):\r\n dp0[j]+=dp1[i]*MD.Comb(h[j]-h[i]+w[j]-w[i],h[j]-h[i])\r\n dp0[j]%=mod\r\n dp1[j]+=dp0[i]*MD.Comb(h[j]-h[i]+w[j]-w[i],h[j]-h[i])\r\n dp1[j]%=mod\r\nans=MD.Comb(H+W,H)\r\nfor i in range(N):\r\n ans+=(dp0[i]-dp1[i])*MD.Comb(H-h[i]+W-w[i],H-h[i])\r\n ans%=mod\r\nprint(ans)", "h, w, n = map(int, input().split())\r\n\r\nMOD = 10**9+7\r\n\r\n\r\nfacts = [0 for i in range(3*10**5)]\r\nfacts[0] = 1\r\nfor i in range(1, len(facts)):\r\n facts[i] = (facts[i-1]*i)%MOD\r\n\r\ninvs = [0 for i in range(3*10**5)]\r\ninvs[-1] = pow(facts[-1], MOD-2, MOD)\r\nfor i in range(len(invs)-2, -1, -1):\r\n invs[i] = (invs[i+1]*(i+1))%MOD\r\n\r\ndef ncr(n, r):\r\n return (facts[n]*invs[r]*invs[n-r])%MOD\r\n\r\n\r\npts = []\r\nfor _ in range(n):\r\n pts.append(tuple(map(int, input().split())))\r\n\r\npts.sort()\r\n\r\ndp = [0 for i in range(n)]\r\n\r\ndef get(fx, fy, tx, ty):\r\n return ncr(tx-fx+ty-fy, tx-fx)\r\n\r\nfor i in range(n):\r\n dp[i] = get(1, 1, pts[i][0], pts[i][1])\r\n for j in range(i):\r\n if pts[j][0] <= pts[i][0] and pts[j][1] <= pts[i][1]:\r\n dp[i] -= dp[j]*get(pts[j][0], pts[j][1], pts[i][0], pts[i][1])\r\n dp[i] %= MOD\r\n\r\n\r\n#print(dp)\r\n\r\ns = 0\r\n\r\nfor i in range(n):\r\n s += dp[i]*get(pts[i][0], pts[i][1], h, w)\r\n s %= MOD\r\n\r\nprint((get(1, 1, h, w)-s)%MOD)\r\n\r\n", "# https://codeforces.com/contest/560/problem/E\nfrom __future__ import annotations\nimport math\n\n\ndef solution(height: int, width: int, black_points: list[tuple[int]], modulo: int) -> int:\n length = height + width\n\n factorial = [1] * length\n for i in range(1, length):\n factorial[i] = factorial[i - 1] * i % modulo\n\n inverse = [1] * length\n for i in range(2, length):\n inverse[i] = (modulo - modulo // i) * inverse[modulo % i] % modulo\n for i in range(1, length):\n inverse[i] = inverse[i] * inverse[i - 1] % modulo\n\n math_comb = lambda n, k: factorial[n] * inverse[k] * inverse[n - k] % modulo\n math_comb2 = lambda n, k: math.comb(n, k) % modulo\n\n black_points.append((height, width))\n black_points.sort()\n\n total_paths = [0] * len(black_points)\n for i, (h_i, w_i) in enumerate(black_points):\n total_paths[i] = math_comb(h_i - 1 + w_i - 1, h_i - 1) % modulo\n\n for j, (h_j, w_j) in enumerate(black_points[:i]):\n if h_i >= h_j and w_i >= w_j:\n total_paths[i] -= total_paths[j] * math_comb(h_i - h_j + w_i - w_j, h_i - h_j) % modulo\n\n return total_paths[-1] % modulo\n\n\ndef main():\n modulo = 1000000007\n height, width, black_points_cnt = list(map(int, input().split()))\n\n black_points = []\n for _ in range(black_points_cnt):\n row_num, col_num = list(map(int, input().split()))\n black_points.append((row_num, col_num))\n\n print(solution(height, width, black_points, modulo))\n return 0\n\n\nif __name__ == \"__main__\":\n main()\n\n# import codewars_test as test\n\n# test.assert_equals(solution(3, 4, [(2, 2), (2, 3)], 1000000007), 2)\n# test.assert_equals(solution(100, 100, [(15, 16), (16, 15), (99, 88)], 1000000007), 545732279)\n# test.assert_equals(solution(10000, 10000, [(15, 16), (16, 15), (99, 88)], 1000000007), 558441761)\n", "# The idea is to compute dp[i], the number of paths from top left to ith point.\r\n# Here, the first and last point = top left and bottom right respectively\r\n# To compute dp[i], we use complementary counting to remove paths that are invalid.\r\n# The idea is that each invalid path has a \"last\" black cell j that they go through,\r\n# after which the remaining ways for this path to get to the top left = dp[j].\r\n\r\nMOD = 10**9 + 7\r\nMAXN = 2*10**5\r\nfac = [1] * (MAXN + 1)\r\ninv_fac = [0] * (MAXN + 1)\r\n\r\nfor i in range(2, MAXN+1):\r\n fac[i] = i * fac[i-1] % MOD\r\n\r\ninv_fac[MAXN] = pow(fac[MAXN], -1, MOD)\r\nfor i in range(MAXN-1, -1, -1):\r\n inv_fac[i] = inv_fac[i+1] * (i+1) % MOD\r\n\r\n\r\ndef choose(n, k):\r\n return (fac[n] * inv_fac[k]) % MOD * inv_fac[n-k] % MOD\r\n\r\n\r\nh, w, n = map(int, input().split())\r\n\r\nfrom collections import namedtuple\r\n\r\nCell = namedtuple('Cell', ['r', 'c'])\r\n\r\ncells = [Cell(1, 1)] + [Cell(*map(int, input().split())) for _ in range(n)] + [Cell(h, w)]\r\ncells.sort()\r\n\r\ndef num_paths(i, j):\r\n dr = abs(cells[i].r - cells[j].r)\r\n dc = abs(cells[i].c - cells[j].c)\r\n\r\n return choose(dr + dc, dr)\r\n\r\ndp = [0] * (n+2)\r\ndp[0] = 1\r\n\r\nfor i in range(1, n+2):\r\n dp[i] = num_paths(0, i)\r\n\r\n # remove invalid paths\r\n for j in range(1, i):\r\n if cells[j].c <= cells[i].c:\r\n dp[i] = (dp[i] - dp[j]*num_paths(i, j)) % MOD\r\n\r\nprint(dp[-1])\r\n", "def f0(h, w, arr):\r\n def power(base, exp, module):\r\n val = 1\r\n while exp:\r\n if exp & 1:\r\n val = val * base % module\r\n base = base * base % module\r\n exp >>= 1\r\n return val\r\n\r\n mod = int(1e9 + 7)\r\n M = h + w + 1\r\n facts = [1] * M\r\n invrs = [1] * M\r\n j = 1\r\n for i in range(2, M):\r\n facts[i] = j = j * i % mod\r\n invrs[-1] = power(facts[-1], mod - 2, mod)\r\n for i in range(M - 2, 1, -1):\r\n invrs[i] = invrs[i + 1] * (i + 1) % mod\r\n\r\n def comb(x, y):\r\n return (facts[x] * invrs[x - y]) % mod * invrs[y] % mod\r\n\r\n arr.append([h, w])\r\n n = len(arr)\r\n arr.sort()\r\n f = [0] * n\r\n for i in range(n):\r\n a, b = arr[i]\r\n fi = comb(a + b - 2, a - 1)\r\n for j in range(i):\r\n c, d = arr[j]\r\n if c <= a and d <= b:\r\n fij = comb(a - c + b - d, a - c)\r\n fij = (fij * f[j]) % mod\r\n fi = (fi - fij + mod) % mod\r\n f[i] = fi\r\n return f[-1]\r\n\r\n\r\nh, w, n = map(int, input().split())\r\narr = [list(map(int, input().split())) for _ in range(n)]\r\nprint(f0(h, w, arr))\r\n", "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\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\ndef Extended_Euclid(n,m):\r\n stack=[]\r\n while m:\r\n stack.append((n,m))\r\n n,m=m,n%m\r\n if n>=0:\r\n x,y=1,0\r\n else:\r\n x,y=-1,0\r\n for i in range(len(stack)-1,-1,-1):\r\n n,m=stack[i]\r\n x,y=y,x-(n//m)*y\r\n return x,y\r\n\r\nclass MOD:\r\n def __init__(self,mod):\r\n self.mod=mod\r\n \r\n def Pow(self,a,n):\r\n a%=self.mod\r\n if n>=0:\r\n return pow(a,n,self.mod)\r\n else:\r\n assert math.gcd(a,self.mod)==1\r\n x=Extended_Euclid(a,self.mod)[0]\r\n return pow(x,-n,self.mod)\r\n\r\n def Build_Fact(self,N):\r\n assert N>=0\r\n self.factorial=[1]\r\n for i in range(1,N+1):\r\n self.factorial.append((self.factorial[-1]*i)%self.mod)\r\n self.factorial_inv=[None]*(N+1)\r\n self.factorial_inv[-1]=self.Pow(self.factorial[-1],-1)\r\n for i in range(N-1,-1,-1):\r\n self.factorial_inv[i]=(self.factorial_inv[i+1]*(i+1))%self.mod\r\n return self.factorial_inv\r\n\r\n def Fact(self,N):\r\n return self.factorial[N]\r\n\r\n def Fact_Inv(self,N):\r\n return self.factorial_inv[N]\r\n\r\n def Comb(self,N,K):\r\n if K<0 or K>N:\r\n return 0\r\n s=self.factorial[N]\r\n s=(s*self.factorial_inv[K])%self.mod\r\n s=(s*self.factorial_inv[N-K])%self.mod\r\n return s\r\n\r\nH,W,N=map(int,readline().split())\r\nRC=[tuple(map(int,readline().split())) for i in range(N)]\r\nRC.sort()\r\nmod=10**9+7\r\nMD=MOD(mod)\r\nMD.Build_Fact(2*10**5)\r\ndp=[0]*N\r\nans=MD.Comb(H+W-2,H-1)\r\nfor i in range(N):\r\n r,c=RC[i]\r\n dp[i]=MD.Comb(r+c-2,r-1)\r\n for j in range(i):\r\n dr=r-RC[j][0]\r\n dc=c-RC[j][1]\r\n dp[i]-=dp[j]*MD.Comb(dr+dc,dr)\r\n dp[i]%=mod\r\nfor i in range(N):\r\n r,c=RC[i]\r\n dr=H-r\r\n dc=W-c\r\n dp[i]*=MD.Comb(dr+dc,dr)\r\n dp[i]%=mod\r\nans-=sum(dp)\r\nans%=mod\r\nprint(ans)" ]

{"inputs": ["3 4 2\n2 2\n2 3", "100 100 3\n15 16\n16 15\n99 88", "1000 1000 4\n50 50\n51 50\n50 51\n51 51", "100000 100000 4\n50001 50001\n50000 50000\n50000 50001\n50001 50000", "2 2 2\n2 1\n1 2", "100 10 30\n40 4\n15 3\n75 3\n88 10\n32 1\n16 5\n81 8\n45 2\n72 8\n11 6\n86 4\n50 2\n9 4\n11 1\n20 3\n47 3\n2 4\n68 3\n90 5\n85 2\n88 1\n88 5\n86 3\n70 9\n49 3\n34 4\n5 7\n77 5\n50 1\n87 5", "100000 100000 2\n1 2\n2 1", "100000 100000 2\n99999 100000\n100000 99999", "100000 100000 3\n99998 100000\n99999 99999\n100000 99998"], "outputs": ["2", "545732279", "899660737", "999612315", "0", "402737011", "0", "0", "0"]}

UNKNOWN

PYTHON3

CODEFORCES

6

8a957f78e0d55fcc24a4b2ca6c9e4fec

Increase Sequence

Peter has a sequence of integers *a*1,<=*a*2,<=...,<=*a**n*. Peter wants all numbers in the sequence to equal *h*. He can perform the operation of "adding one on the segment [*l*,<=*r*]": add one to all elements of the sequence with indices from *l* to *r* (inclusive). At that, Peter never chooses any element as the beginning of the segment twice. Similarly, Peter never chooses any element as the end of the segment twice. In other words, for any two segments [*l*1,<=*r*1] and [*l*2,<=*r*2], where Peter added one, the following inequalities hold: *l*1<=≠<=*l*2 and *r*1<=≠<=*r*2. How many distinct ways are there to make all numbers in the sequence equal *h*? Print this number of ways modulo 1000000007 (109<=+<=7). Two ways are considered distinct if one of them has a segment that isn't in the other way. The first line contains two integers *n*,<=*h* (1<=≤<=*n*,<=*h*<=≤<=2000). The next line contains *n* integers *a*1,<=*a*2,<=...,<=*a**n* (0<=≤<=*a**i*<=≤<=2000). Print a single integer — the answer to the problem modulo 1000000007 (109<=+<=7). Sample Input 3 2 1 1 1 5 1 1 1 1 1 1 4 3 3 2 1 1 Sample Output 4 1 0

[ "f = lambda: map(int, input().split())\r\nn, h = f()\r\ns, i = 1, 0\r\nfor j in f():\r\n j = h - j\r\n if j < 0 or abs(j - i) > 1: exit(print(0))\r\n if j <= i: s = s * (j + 1) % 1000000007\r\n i = j\r\nprint(0 if i > 1 else s)" ]

{"inputs": ["3 2\n1 1 1", "5 1\n1 1 1 1 1", "4 3\n3 2 1 1", "1 2000\n2000", "3 2\n2 1 1", "3 4\n4 3 2", "10 6\n5 4 4 4 5 4 4 4 4 5", "10 6\n5 4 4 4 5 4 4 4 4 5", "7 4\n3 3 4 4 4 3 3", "3 6\n5 6 5", "3 2\n1 0 1", "6 1\n0 1 0 0 0 1", "6 3\n2 1 2 2 1 2", "99 1999\n1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987 1986 1985 1984 1983 1982 1981 1980 1979 1978 1977 1976 1975 1974 1973 1972 1971 1970 1969 1968 1967 1966 1965 1964 1963 1962 1961 1960 1959 1958 1957 1956 1955 1954 1953 1952 1951 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999", "9 4\n2 3 2 2 2 3 3 3 2", "1 349\n348", "10 20\n20 19 18 17 16 15 16 17 18 19", "19 10\n10 9 8 7 6 5 4 3 2 10 2 3 4 5 6 7 8 9 10", "19 11\n10 9 8 7 6 5 4 3 3 3 3 3 4 5 6 7 8 9 10", "7 3\n2 1 1 2 1 1 2"], "outputs": ["4", "1", "0", "1", "2", "0", "972", "972", "4", "1", "2", "4", "8", "726372166", "0", "1", "120", "0", "264539520", "36"]}

UNKNOWN

PYTHON3

CODEFORCES

1

8b05508e415ac732ef63660436500b6f

Cannon

Bertown is under siege! The attackers have blocked all the ways out and their cannon is bombarding the city. Fortunately, Berland intelligence managed to intercept the enemies' shooting plan. Let's introduce the Cartesian system of coordinates, the origin of which coincides with the cannon's position, the *Ox* axis is directed rightwards in the city's direction, the *Oy* axis is directed upwards (to the sky). The cannon will make *n* more shots. The cannon balls' initial speeds are the same in all the shots and are equal to *V*, so that every shot is characterized by only one number *alpha**i* which represents the angle at which the cannon fires. Due to the cannon's technical peculiarities this angle does not exceed 45 angles (π<=/<=4). We disregard the cannon sizes and consider the firing made from the point (0,<=0). The balls fly according to the known physical laws of a body thrown towards the horizon at an angle: Think of the acceleration of gravity *g* as equal to 9.8. Bertown defends *m* walls. The *i*-th wall is represented as a vertical segment (*x**i*,<=0)<=-<=(*x**i*,<=*y**i*). When a ball hits a wall, it gets stuck in it and doesn't fly on. If a ball doesn't hit any wall it falls on the ground (*y*<==<=0) and stops. If the ball exactly hits the point (*x**i*,<=*y**i*), it is considered stuck. Your task is to find for each ball the coordinates of the point where it will be located in the end. The first line contains integers *n* and *V* (1<=≤<=*n*<=≤<=104,<=1<=≤<=*V*<=≤<=1000) which represent the number of shots and the initial speed of every ball. The second line contains *n* space-separated real numbers *alpha**i* (0<=<<=*alpha**i*<=<<=π<=/<=4) which represent the angles in radians at which the cannon will fire. The third line contains integer *m* (1<=≤<=*m*<=≤<=105) which represents the number of walls. Then follow *m* lines, each containing two real numbers *x**i* and *y**i* (1<=≤<=*x**i*<=≤<=1000,<=0<=≤<=*y**i*<=≤<=1000) which represent the wall’s coordinates. All the real numbers have no more than 4 decimal digits. The walls may partially overlap or even coincide. Print *n* lines containing two real numbers each — calculate for every ball the coordinates of its landing point. Your answer should have the relative or absolute error less than 10<=-<=4. Sample Input 2 10 0.7853 0.3 3 5.0 5.0 4.0 2.4 6.0 1.9 2 10 0.7853 0.3 2 4.0 2.4 6.0 1.9 Sample Output 5.000000000 2.549499369 4.000000000 0.378324889 10.204081436 0.000000000 4.000000000 0.378324889

[ "import sys\nfrom math import tan, sin, cos\n\nreadline = sys.stdin.readline\n\nballs = []\nwalls = []\nV = 0\n\ndef read_input():\n global V\n n, v = list(map(int, readline().split()))\n V = v\n for i in range(n):\n balls.append([float(readline().strip()), i])\n balls.sort()\n n = int(readline().strip())\n for i in range(n):\n walls.append(list(map(float, readline().split())))\n walls.sort()\n\ndef solve()->list:\n g = 9.8\n result = []\n for alpha, idx in balls:\n b = tan(alpha)\n t = 2 * V * sin(alpha) / g\n a = - b / (V * cos(alpha) * t)\n result.append([- b/ a, 0.0, a, b, idx])\n j = 0\n for x1, y1 in walls:\n while j < len(result) and result[j][0] <= x1:\n j += 1\n if j == len(result):\n break\n while j < len(result):\n x0, y0, a, b, idx = result[j]\n if 0<= a * x1 * x1 + b * x1 <= y1:\n result[j] = [x1, a * x1 * x1 + b * x1, a, b, idx]\n j += 1\n else:\n break\n return result\n\ndef write_output(result: list):\n result.sort(key = lambda x: x[-1])\n for r in result:\n print(r[0], r[1])\n\nread_input()\nwrite_output(solve())\n# print(balls)\n# print(solve())" ]

{"inputs": ["2 10\n0.7853\n0.3\n3\n5.0 5.0\n4.0 2.4\n6.0 1.9", "2 10\n0.7853\n0.3\n2\n4.0 2.4\n6.0 1.9", "3 186\n0.4084\n0.4559\n0.1203\n3\n978.8435 234.6507\n343.6961 128.6128\n611.2897 458.9593", "4 851\n0.3178\n0.5635\n0.1335\n0.5107\n4\n685.3785 249.6264\n681.8946 242.4571\n917.2937 600.3285\n150.5685 135.5137", "2 875\n0.7537\n0.4375\n5\n445.8822 355.9854\n29.3463 12.5104\n845.7334 537.7371\n494.5914 322.9145\n799.3183 315.1701", "6 417\n0.0303\n0.7536\n0.7225\n0.2404\n0.2432\n0.4583\n3\n979.9372 477.1436\n469.9804 408.1158\n923.2564 220.5522"], "outputs": ["5.000000000 2.549499369\n4.000000000 0.378324889", "10.204081436 0.000000000\n4.000000000 0.378324889", "611.289700000 201.687561175\n611.289700000 234.096418112\n343.696100000 24.571869439", "150.568500000 49.359453403\n150.568500000 94.919970010\n150.568500000 20.065007118\n150.568500000 84.158687413", "77968.056705539 0.000000000\n445.882200000 207.001740252", "469.980400000 8.014848928\n17707.905316391 0.000000000\n469.980400000 403.227402023\n469.980400000 108.613087969\n469.980400000 109.999956153\n469.980400000 224.117928434"]}

UNKNOWN

PYTHON3

CODEFORCES

1

8b08ea902b7acfe6c832a6ab2e5cbf65

New York Hotel

Think of New York as a rectangular grid consisting of *N* vertical avenues numerated from 1 to *N* and *M* horizontal streets numerated 1 to *M*. *C* friends are staying at *C* hotels located at some street-avenue crossings. They are going to celebrate birthday of one of them in the one of *H* restaurants also located at some street-avenue crossings. They also want that the maximum distance covered by one of them while traveling to the restaurant to be minimum possible. Help friends choose optimal restaurant for a celebration. Suppose that the distance between neighboring crossings are all the same equal to one kilometer. The first line contains two integers *N* и *M* — size of the city (1<=≤<=*N*,<=*M*<=≤<=109). In the next line there is a single integer *C* (1<=≤<=*C*<=≤<=105) — the number of hotels friends stayed at. Following *C* lines contain descriptions of hotels, each consisting of two coordinates *x* and *y* (1<=≤<=*x*<=≤<=*N*, 1<=≤<=*y*<=≤<=*M*). The next line contains an integer *H* — the number of restaurants (1<=≤<=*H*<=≤<=105). Following *H* lines contain descriptions of restaurants in the same format. Several restaurants and hotels may be located near the same crossing. In the first line output the optimal distance. In the next line output index of a restaurant that produces this optimal distance. If there are several possibilities, you are allowed to output any of them. Sample Input 10 10 2 1 1 3 3 2 1 10 4 4 Sample Output 6 2

[ "N, M = input().split()\r\na, b, c, d = [int(1e10) for _ in range(4)]\r\nfor i in range(int(input())):\r\n x, y = list(map(int, input().split()))\r\n a, b, c, d = min(a, x + y), min(b, x - y), min(c, - x + y), min(d, - x - y)\r\nres, pos = int(1e10), 0\r\nfor i in range(int(input())):\r\n x, y = list(map(int, input().split()))\r\n ans = max(max(x + y - a, x - y - b), max( - x + y - c, - x - y - d))\r\n if ans < res:\r\n pos = i + 1\r\n res = ans\r\nprint(res, pos, sep = '\\n')" ]

{"inputs": ["10 10\n2\n1 1\n3 3\n2\n1 10\n4 4", "100 100\n10\n53 20\n97 6\n12 74\n48 92\n97 13\n47 96\n75 32\n69 21\n95 75\n1 54\n10\n36 97\n41 1\n1 87\n39 23\n27 44\n73 97\n1 1\n6 26\n48 3\n5 69", "100 100\n10\n86 72\n25 73\n29 84\n34 33\n29 20\n84 83\n41 80\n22 22\n16 89\n77 49\n1\n4 23", "100 100\n1\n66 77\n10\n70 11\n76 69\n79 39\n90 3\n38 87\n61 81\n98 66\n63 68\n62 93\n53 36", "1000000000 1000000000\n1\n1 1\n1\n1000000000 1000000000", "123456789 987654321\n1\n312 987654321\n1\n123456789 213", "453456789 987654321\n1\n443943901 1\n1\n1354 213389832", "923456789 987654321\n1\n443943901 132319791\n1\n1354 560", "100 100\n1\n1 100\n1\n1 100", "1 1\n1\n1 1\n1\n1 1", "1000000000 1000000000\n2\n1 1\n3 3\n2\n1 10\n4 4"], "outputs": ["6\n2", "108\n4", "140\n1", "9\n6", "1999999998\n1", "1111110585\n1", "657332378\n1", "576261778\n1", "0\n1", "0\n1", "6\n2"]}

UNKNOWN

PYTHON3

CODEFORCES

1

8b27e972e3fa26ad5abe3942fc090f84

Permute Digits

You are given two positive integer numbers *a* and *b*. Permute (change order) of the digits of *a* to construct maximal number not exceeding *b*. No number in input and/or output can start with the digit 0. It is allowed to leave *a* as it is. The first line contains integer *a* (1<=≤<=*a*<=≤<=1018). The second line contains integer *b* (1<=≤<=*b*<=≤<=1018). Numbers don't have leading zeroes. It is guaranteed that answer exists. Print the maximum possible number that is a permutation of digits of *a* and is not greater than *b*. The answer can't have any leading zeroes. It is guaranteed that the answer exists. The number in the output should have exactly the same length as number *a*. It should be a permutation of digits of *a*. Sample Input 123 222 3921 10000 4940 5000 Sample Output 213 9321 4940

[ "a, b = sorted(input()), int(input())\r\nfor i in range(len(a)):\r\n\tfor j in range(i+1, len(a)):\r\n\t\tc = int(str.join('', a))\r\n\t\ta[i], a[j] = a[j], a[i]\r\n\t\td = int(str.join('', a))\r\n\t\tif c <= d <= b:\r\n\t\t continue\r\n\t\telse:\r\n\t\t a[i], a[j] = a[j], a[i]\r\nprint(str.join('', a))", "a=input()\r\nb=input()\r\no=0\r\nt=[]\r\ni=0\r\nh=0\r\nc=0\r\nw=0\r\nj=0\r\nl=[int(d) for d in a]\r\nk=[int(i) for i in b]\r\nl.sort()\r\nl.reverse()\r\nif(len(l)<len(k)):\r\n print(''.join(map(str,l)))\r\nif(len(l)==len(k)):\r\n for i in range(0,len(k)):\r\n o=k[i]\r\n if(o in l):\r\n t.append(o)\r\n l.remove(o)\r\n l.sort()\r\n l.reverse()\r\n h=len(t)\r\n else:\r\n while(o not in l and o>=0):\r\n o=o-1\r\n if(o in l):\r\n t.append(o)\r\n l.remove(o)\r\n l.sort()\r\n l.reverse()\r\n break\r\n else:\r\n while(c!=1):\r\n for j in range(0,len(l)):\r\n if(t[h-1]>l[j]):\r\n c=c+1\r\n w=l[j]\r\n break\r\n l.append(t[h-1])\r\n l.sort()\r\n l.reverse()\r\n del(t[h-1])\r\n h=len(t) \r\n t.append(w)\r\n l.remove(w)\r\n l.sort()\r\n l.reverse()\r\n break\r\n print(''.join(map(str,t+l)))\r\n", "from sys import stdin, stdout\r\nnmbr = lambda: int(input())\r\nlst = lambda: list(map(int, input().split()))\r\n\r\nfor _ in range(1):#nmbr()):\r\n sa=sorted(input(), reverse=True)\r\n na=len(sa)\r\n sb=input()\r\n nb=len(sb)\r\n if nb>na:\r\n print(''.join(sa))\r\n continue\r\n ans=''\r\n while sa:\r\n for i in range(len(sa)):\r\n new=ans+sa[i]+''.join(sorted(sa[:i]+sa[i+1:]))\r\n if int(new)<=int(sb):\r\n ans+=sa[i]\r\n sa.pop(i)\r\n break\r\n print(ans)", "a = list(input())\r\nb = int(input())\r\na.sort()\r\nfor i in range(len(a) - 1):\r\n for j in range(len(a) - 1, i - 1, -1):\r\n c = int(\"\".join(a[:i] + a[j: j +1] + a[i:j] + a[j+1:]))\r\n if c <= b:\r\n a = a[:i] + a[j: j +1] + a[i:j] + a[j+1:]\r\n break\r\nprint(\"\".join(a))", "a = str(input())\r\nb = str(input())\r\n\r\nfrom collections import defaultdict\r\n\r\nA = [c for c in a]\r\nB = [c for c in b]\r\nA.sort(reverse=True)\r\nif int(''.join(A)) < int(''.join(B)):\r\n print(int(''.join(A)))\r\n exit()\r\n\r\nn = len(B)\r\nA = [int(c) for c in A]\r\nB = [int(c) for c in B]\r\ndp = [[defaultdict(lambda: 0) for i in range(2)] for j in range(n+1)]\r\nC = [0]*10\r\nfor c in A:\r\n C[c] += 1\r\ndp[0][0][tuple(C)] = 0\r\nfor i in range(n):\r\n for k in range(2):\r\n nd = B[i]\r\n for t, v in dp[i][k].items():\r\n t = list(t)\r\n for d in range(10):\r\n if t[d] == 0:\r\n continue\r\n t[d] -= 1\r\n ni = i+1\r\n nj = tuple(t)\r\n nk = k\r\n if k == 0:\r\n if d > nd:\r\n continue\r\n elif d < nd:\r\n nk = 1\r\n else:\r\n pass\r\n dp[ni][nk][nj] = max(v*10+d, dp[ni][nk][nj])\r\n t[d] += 1\r\nans = 0\r\nfor k in range(2):\r\n for t, v in dp[n][k].items():\r\n ans = max(v, ans)\r\nprint(ans)\r\n", "import sys\n\ndef backtrack(sol, remaining, b, pos, free):\n if len(sol) == len(b):\n print(sol)\n sys.exit(0)\n for c in '9876543210':\n if not free and c > b[pos]: continue\n if not remaining[ord(c)-ord('0')]: continue\n remaining[ord(c)-ord('0')] -= 1\n backtrack(sol+c, remaining, b, pos+1, free or c < b[pos])\n remaining[ord(c)-ord('0')] += 1\n\na = ''.join(sorted(input())[::-1])\nb = input()\n\nif len(a) < len(b):\n print(a)\nelse:\n x = [0] * 10\n for c in a: \n x[ord(c)-ord('0')] += 1\n backtrack('', x, b, 0, False)\n", "sa=sorted(input(),reverse=True)\r\nna=len(sa)\r\nsb=input()\r\nnb=len(sb)\r\nif nb>na:\r\n print(\"\".join(sa))\r\nelse:\r\n ans=\"\"\r\n while sa:\r\n for i in range(len(sa)):\r\n new=ans+sa[i]+\"\".join(sorted(sa[:i]+sa[i+1:]))\r\n if int(new)<=int(sb):\r\n ans+=sa[i]\r\n sa.pop(i)\r\n break\r\n print(ans)", "a=list(input())\na.sort(reverse=True)\nb=int(input())\nans=''\nwhile(len(a)>0):\n for i in range(len(a)):\n x=ans+a[i]+''.join(sorted(a[:i]+a[i+1:]))\n if(int(x)<=b):\n ans+=a[i]\n a=a[:i]+a[i+1:]\n break\nprint(ans)\n\t\t\t\t\t\t\t\t \t \t\t \t \t \t\t\t", "class Solution:\r\n\r\n def canWork(self, pre, a, b):\r\n return int(pre + \"\".join(a)) <= b\r\n\r\n def step(self, pre, a, b):\r\n for i in range(len(a) - 1, -1, -1):\r\n pre2 = pre + a[i]\r\n a2 = a[:i] + a[i+1:]\r\n if self.canWork(pre2, a2, b):\r\n return (pre2, a2)\r\n raise Exception(\"Broken\")\r\n\r\n def solve(self, a, b):\r\n a = list(a)\r\n b = int(b)\r\n pre = \"\"\r\n a.sort()\r\n while a:\r\n (pre, a) = self.step(pre, a, b)\r\n return pre\r\n\r\n\r\ndef main():\r\n sol = Solution()\r\n print(sol.solve(input(), input()))\r\n\r\nmain()", "a = input()\nb = input()\nla = [int(x) for x in a]\nres = []\nla.sort()\nla = la[::-1]\nlb = [int(x) for x in b]\ncnt = [0] * 20\n\ndef check():\n tres = 0\n for x in range(len(res)):\n tres *= 10\n tres += int(res[x])\n return tres <= int(b)\nif len(a) < len(b):\n for i in range(len(la)):\n print(la[i], end = '')\n print()\nelse:\n for i in range(len(la)):\n cnt[la[i]] += 1\n flag = 0\n for i in range(len(lb)):\n if flag == 0 and cnt[lb[i]]:\n res.append(lb[i])\n cnt[lb[i]] -= 1\n else:\n flag = i - 1\n for j in range(lb[i] - 1, -1, -1):\n if cnt[j]:\n res.append(j)\n cnt[j] -= 1\n break\n for j in range(9, -1, -1):\n while cnt[j]:\n res.append(j)\n cnt[j] -= 1\n break\n while not check():\n temp = []\n cnt = [0] * 20\n for x in range(flag):\n temp.append(res[x])\n cnt[res[x]] -= 1\n for i in la:\n cnt[i] += 1\n ##print(\"cnt = \", cnt)\n res = temp\n ##print(flag, res)\n for v in range(lb[flag] - 1, -1, -1):\n if cnt[v]:\n res.append(v)\n cnt[v] -= 1\n break\n for v in range(9, -1, -1):\n while cnt[v]:\n res.append(v)\n cnt[v] -= 1\n ##print(flag, res)\n flag -= 1\n for i in range(len(res)):\n print(res[i], end = '')\n print()\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nd = [0]*10\r\nfor i in input()[:-1]:\r\n d[int(i)] += 1\r\nq = [int(i) for i in input()[:-1]]\r\nn = sum(d)\r\nm = len(q)\r\new = []\r\ni = m-n\r\nif i > 0:\r\n for i in range(9, -1, -1):\r\n print(str(i)*d[i],end='')\r\nelse:\r\n t = 0\r\n while i < n:\r\n if d[q[i]]:\r\n d[q[i]] -= 1\r\n ew.append(q[i])\r\n i += 1\r\n else:\r\n a, b = q[i], 0\r\n while a > 0:\r\n a -= 1\r\n if d[a]:\r\n d[a] -= 1\r\n ew.append(a)\r\n b = 1\r\n break\r\n if b == 1:\r\n t = 1\r\n else:\r\n i -= 1\r\n while ew:\r\n d[ew.pop()] += 1\r\n for j in range(q[i]-1, -1, -1):\r\n if d[j]:\r\n d[j] -= 1\r\n ew.append(j)\r\n t = 1\r\n break\r\n if t == 0:\r\n i -= 1\r\n else:\r\n break\r\n if t == 1:\r\n break\r\n print(''.join(map(str, ew)), end='')\r\n for j in range(9, -1, -1):\r\n print(str(j) * d[j], end='')\r\n\r\n", "a=sorted(input())\r\nb=int(input())\r\na=a[::-1]\r\nprefix=\"\"\r\nwhile a:\r\n for i in range(len(a)):\r\n n = prefix + a[i] + \"\".join(sorted(a[:i] + a[i+1:]))\r\n if int(n) <= b:\r\n prefix += a[i]\r\n a.pop(i)\r\n break\r\nprint(prefix)", "from bisect import bisect_left as bl\nfrom bisect import bisect_right as br\nfrom heapq import heappush,heappop,heapify\nimport math\nfrom collections import *\nfrom functools import reduce,cmp_to_key\nimport sys\ninput = sys.stdin.readline\n\nfrom itertools import accumulate\nfrom functools import lru_cache\n\nM = mod = 998244353\ndef factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0))))\ndef inv_mod(n):return pow(n, mod - 2, mod)\n \ndef li():return [int(i) for i in input().rstrip('\\n').split()]\ndef st():return input().rstrip('\\n')\ndef val():return int(input().rstrip('\\n'))\ndef li2():return [i for i in input().rstrip('\\n')]\ndef li3():return [int(i) for i in input().rstrip('\\n')]\n\n\na = val()\nb = val()\n\nn = len(str(a))\n\na = [int(i) for i in str(a)]\na.sort()\nif len(str(b)) > n:\n \n print(*sorted(a, reverse = 1), sep = '')\n exit()\n\nb = str(b)\nb = [int(i) for i in b]\n\n\ndef makenum(s):return int(''.join(str(e) for e in s))\n\ndef givemax(a, b):\n if len(a) > len(b):return a\n elif len(b) > len(a):return b\n else:\n for j in range(len(a)):\n if a[j] > b[j]:return a\n elif b[j] > a[j]:return b\n return a\n\n\n@lru_cache(None)\ndef dp(l, equal = 1):\n\n if len(l) == 1:return str(-float('inf')) if l[0] > b[-1] and equal else str(l[0])\n if not equal:return ''.join(str(e) for e in sorted(l, reverse = 1))\n ans = ''\n l = list(l)\n curr = b[n - len(l)]\n for i in range(len(l)):\n if l[i] < curr and dp(tuple(l[:i] + l[i + 1:]), 0) != '-inf':\n ans = givemax(ans, str(l[i]) + dp(tuple(l[:i] + l[i + 1:]), 0))\n elif l[i] == curr and dp(tuple(l[:i] + l[i + 1:]), 1) != '-inf':\n ans = givemax(ans, str(l[i]) + dp(tuple(l[:i] + l[i + 1:]), 1))\n\n return str(ans)\n\nprint(dp(tuple(a), 1))", "a=list(input())\r\nb=int(input())\r\na.sort()\r\na=a[::-1]\r\nprefix=\"\"\r\nwhile(len(a)>0):\r\n\tfor i in range(len(a)):\r\n\t\tnum=prefix+a[i]+\"\".join(sorted(a[:i]+a[i+1:]))\r\n\t\tif(int(num)<=b):\r\n\t\t\tprefix+=a[i]\r\n\t\t\ta=a[:i]+a[i+1:]\r\n\t\t\tbreak\r\nprint(prefix)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 18 08:45:24 2020\r\n\r\n@author: Dark Soul\r\n\"\"\"\r\ndef comp(a,b):\r\n x=len(a)\r\n s1=''\r\n s2=''\r\n for i in range(x):\r\n s1+=str(a[i])\r\n s2+=str(b[i])\r\n if s1>s2:\r\n return 1\r\n else:\r\n return 0\r\n \r\na=list(input(''))\r\nb=list(input(''))\r\ncnt=[0]*10\r\nn=len(a)\r\nm=len(b)\r\nsol=''\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\n cnt[a[i]]+=1\r\n\r\nif n!=m:\r\n a.sort(reverse=True)\r\n for i in a:\r\n sol+=str(i)\r\n print(sol)\r\nelse:\r\n a.sort()\r\n \r\n for i in range(n):\r\n b[i]=int(b[i])\r\n for i in range(n-1):\r\n for j in range(i,n):\r\n if a[i]<a[j]:\r\n temp=a[i]\r\n a[i]=a[j]\r\n a[j]=temp\r\n if comp(a,b):\r\n temp=a[i]\r\n a[i]=a[j]\r\n a[j]=temp\r\n \r\n \r\n for i in a:\r\n sol+=str(i)\r\n print(sol)", "a=list(reversed(sorted(map(int,input()))))\r\nb=list(map(int,input()))\r\nif len(b)>len(a):\r\n print(*a,sep='')\r\nelse:\r\n ans=[]\r\n for i in range(len(b)):\r\n if b[i] in a:\r\n ans.append(b[i])\r\n a.remove(b[i])\r\n else:\r\n while b[i]<=min(a):\r\n a.append(ans.pop())\r\n i-=1\r\n a.sort(reverse=True)\r\n for j in a:\r\n if j<b[i]:\r\n ans.append(j)\r\n a.remove(j)\r\n break\r\n print(*ans,sep='',end='')\r\n print(*a,sep='')\r\n break\r\n else:\r\n print(*ans,sep='')", "# problem is not solved\r\n\r\ndef permuteDigits():\r\n low = list(input().strip())\r\n high = list(input().strip())\r\n\r\n if len(low) < len(high):\r\n low.sort()\r\n low.reverse()\r\n print(''.join(low))\r\n else:\r\n li = []; i = 0; string = ''\r\n while True:\r\n if high[i] in low:\r\n for j in range(len(low)):\r\n if low[j]==high[i] and j not in li:\r\n li.append(j)\r\n string += low[j]\r\n break\r\n else:\r\n break\r\n i += 1\r\n if i==len(low):\r\n print(string)\r\n return\r\n continue\r\n break\r\n\r\n li.sort()\r\n for item in range(len(li)-1, -1, -1):\r\n del low[li[item]]\r\n\r\n low.sort() \r\n if min(low) < high[i]:\r\n for p in range(len(low)-1, -1, -1):\r\n if int(low[p]) < int(high[i]):\r\n string += low[p]\r\n del low[p]\r\n break\r\n for p in range(len(low)-1, -1, -1):\r\n string += low[p]\r\n else:\r\n while True:\r\n i -= 1\r\n if min(low) < high[i]:\r\n break\r\n low.append(high[i])\r\n string = string[:-1]\r\n\r\n low.sort()\r\n for p in range(len(low)-1, -1, -1):\r\n if low[p] < high[i]:\r\n temp = string[-1]\r\n string = string[:-1]\r\n string += low[p]\r\n del low[p]\r\n low.append(temp)\r\n break\r\n\r\n low.sort()\r\n for p in range(len(low)-1, -1, -1):\r\n string += low[p]\r\n print(string)\r\n\r\npermuteDigits()\r\n", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\n \r\n \r\ndef process(A, B):\r\n answer = []\r\n digits = [0 for i in range(10)]\r\n for d in A:\r\n digits[int(d)]+=1\r\n if len(A) < len(B):\r\n answer = []\r\n for i in range(9, -1, -1):\r\n for j in range(digits[i]):\r\n answer.append(str(i))\r\n answer = ''.join(answer)\r\n sys.stdout.write(f'{answer}\\n')\r\n return\r\n m = len(B)\r\n n = len(A)\r\n B1 = int(B)\r\n answer1 = 0\r\n answer = []\r\n can_equal = True\r\n for i in range(n):\r\n d1 = int(B[i])\r\n if digits[d1] > 0:\r\n digits2 = [x for x in digits]\r\n digits2[d1]-=1\r\n A2 = 10*answer1+d1\r\n for d2 in range(10):\r\n for j in range(digits2[d2]):\r\n A2 = 10*A2+d2 \r\n if A2 <= B1:\r\n answer.append(d1)\r\n digits[d1]-=1\r\n answer1 = 10*answer1+d1 \r\n else:\r\n can_equal = False \r\n else:\r\n can_equal = False \r\n if not can_equal:\r\n for d2 in range(d1-1,-1, -1):\r\n if digits[d2] > 0:\r\n digits[d2]-=1\r\n answer.append(d2)\r\n break \r\n for d2 in range(9, -1, -1):\r\n for j in range(digits[d2]):\r\n answer.append(d2)\r\n break\r\n answer = ''.join(map(str, answer))\r\n sys.stdout.write(f'{answer}\\n')\r\n \r\n \r\n \r\n \r\n \r\n\r\nA = input().decode().strip()\r\nB = input().decode().strip()\r\nprocess(A, B)", "import sys\r\n\r\na, b = input(), input()\r\n\r\nif len(a) < len(b):\r\n print(*sorted(a, reverse=True), sep='')\r\n exit()\r\n\r\ncnt = [0]*10\r\n\r\nfor x in a:\r\n cnt[int(x)] += 1\r\n\r\n\r\ndef rec(res, digit, rem):\r\n if digit == len(b):\r\n return res\r\n if rem[int(b[digit])]:\r\n r = rem[:]\r\n r[int(b[digit])] -= 1\r\n x = rec(res + b[digit], digit+1, r)\r\n if x:\r\n return x\r\n for d in range(int(b[digit])-1, -1, -1):\r\n if rem[d]:\r\n res += str(d)\r\n rem[d] -= 1\r\n suf = []\r\n for i in range(10):\r\n suf += [str(i)] * rem[i]\r\n return res + ''.join(sorted(suf, reverse=True))\r\n return ''\r\n\r\n\r\nans = rec('', 0, cnt[:])\r\nprint(ans)\r\n", "mass = list(input())\r\nb = int(input())\r\nmass.sort()\r\nmass = mass[::-1]\r\np = ''\r\nwhile(len(mass)>0):\r\n\tfor i in range(len(mass)):\r\n\t\tn = p + mass[i] + ''.join(sorted(mass[:i] + mass[i + 1:]))\r\n\t\tif int(n) <= b:\r\n\t\t\tp += mass[i]\r\n\t\t\tmass = mass[:i] + mass[i + 1:]\r\n\t\t\tbreak\r\nprint(p)", "a = input()\r\nb = input()\r\n\r\ncnt = [0] * 10\r\n\r\nfor c in a:\r\n cnt[int(c)] += 1\r\n\r\ndef rec(l, aa, bb):\r\n if l >= len(a):\r\n print(aa)\r\n exit(0)\r\n if aa > bb:\r\n return\r\n for i in range(9, -1, -1):\r\n if cnt[i] > 0:\r\n new_aa = aa * 10 + i\r\n new_bb = bb * 10 + int(b[l])\r\n if new_aa <= new_bb:\r\n cnt[i] -= 1\r\n rec(l + 1, new_aa, new_bb)\r\n cnt[i] += 1\r\n\r\ndef print_max_a():\r\n for i in range(9, -1, -1):\r\n while cnt[i] > 0:\r\n print(i, end='')\r\n cnt[i] -= 1\r\n print()\r\n\r\nif len(b) > len(a):\r\n print_max_a()\r\nelse:\r\n rec(0, 0, 0)\r\n", "a=sorted(input())\r\nb=int(input())\r\na=a[::-1]\r\np=\"\"\r\nwhile a:\r\n\tfor i, z in enumerate(a):\r\n\t\tn=p+a[i]+\"\".join(sorted(a[:i]+a[i+1:]))\r\n\t\tif int(n)<=b:\r\n\t\t\tp+=z\r\n\t\t\ta.pop(i)\r\n\t\t\tbreak\r\nprint(p)", "def f(b, l, i, ls, below=False):\r\n if i == len(b): return True\r\n ne = int(b[i])\r\n if below:\r\n ne = 9\r\n found = False\r\n for j in range(ne, -1, -1):\r\n if ls[j] > 0:\r\n l.append(j)\r\n ls[j] -= 1\r\n val = f(b, l, i + 1, ls, True if below or j < ne else False)\r\n ls[j] += 1\r\n if val:\r\n found = True\r\n break\r\n else: \r\n l.pop()\r\n return found\r\n\r\na = input(); b = input()\r\nif len(b) > len(a):\r\n print(''.join(sorted(a, reverse=True)))\r\nl = []\r\nls = [0] * 11\r\nfor x in a: ls[int(x)] += 1\r\nf(b, l, 0, ls)\r\nprint(''.join(map(str, l)))\r\n", "fre =[0,0,0,0,0,0,0,0,0,0,0]\r\na=input();b=input()\r\nc=False\r\ndef DFS(aa,bb):\r\n if int(aa)==len(a):\r\n print(bb)\r\n exit()\r\n global c\r\n for i in range(9,-1,-1):\r\n if (fre[i]>0 and i<=int(b[int(aa)])) or (fre[i]>0 and c):\r\n fre[i]-=1\r\n if i<int(b[int(aa)]):\r\n c=True\r\n DFS(aa+1,bb*10+i)\r\n fre[i]+=1\r\n c=False\r\n \r\n\r\n\r\nif len(b)>len(a):\r\n x=sorted(a);\r\n \r\n print(*x[::-1],sep='')\r\nelse:\r\n for i in a:\r\n fre[int(i)]+=1\r\n DFS(0,0)\r\n", "from collections import Counter\n\na = int(input())\nb = int(input())\n\ndef sorted_diff(a, b):\n counter = Counter(list(str(b)))\n counter -= Counter(list(str(a)))\n\n result = []\n for key in sorted(counter.keys()):\n for i in range(counter[key]):\n result.append(key)\n\n return result\n\n\nmax_prefix = ''\nfor length in range(len(str(a))):\n diff = sorted_diff(max_prefix, a)\n \n max_curr = new_symb = None\n for symb in diff:\n diff_diff = sorted_diff(symb, ''.join(diff))\n next_prefix = int('{}{}{}'.format(max_prefix, symb, ''.join(diff_diff)))\n\n if next_prefix <= b:\n if max_curr is None:\n max_curr = next_prefix\n new_symb = symb\n else:\n if max_curr < next_prefix:\n max_curr = next_prefix\n new_symb = symb\n\n max_prefix += new_symb\n\nprint(max_prefix)\n", "a,b = list(input()),int(input())\r\nans = \"\"\r\na.sort(reverse=True)\r\nwhile len(a)>0:\r\n for i in range(len(a)):\r\n num = ans+a[i]+\"\".join(sorted(a[:i]+a[i+1:]))\r\n if int(num)<=b:\r\n ans += a[i]\r\n a = a[:i]+a[i+1:]\r\n break\r\nprint(ans)", "s=sorted(input())\r\nm=int(input())\r\nh=len(s)\r\nfun=lambda y:int(''.join(y))\r\nfor x in range(0,h):\r\n for i in range(x,h):\r\n s[x],s[i]=s[i],s[x]\r\n temp=fun(s)\r\n if(temp>m):\r\n s[x],s[i]=s[i],s[x]\r\n\r\nprint(fun(s)) \r\n", "def main():\n a = list(input(\"\"))\n b = input(\"\")\n a.sort()\n a.reverse()\n maxNumber = \"\"\n\n if len(a) < len(str(b)):\n for num in a:\n maxNumber += num\n else:\n maxNumber = fillInDigit(a,b,[],\"\")\n print(maxNumber)\n\ndef fillInDigit(num1, num2, usedDigits, currentMaxNumber):\n maxLeadingDigit = \"-1\"\n secondLeadingDigit = int(num2[0])\n for x in num1:\n if int(x) <= secondLeadingDigit and int(x) > int(maxLeadingDigit):\n maxLeadingDigit = x\n\n maxNumber1 = currentMaxNumber\n maxNumber1 += maxLeadingDigit\n usedDigits.append(maxLeadingDigit)\n num1.remove(maxLeadingDigit)\n num2 = num2[1:]\n\n if len(num1) == 0:\n return maxNumber1\n elif int(maxLeadingDigit) < secondLeadingDigit:\n if len(num1) > 0:\n for num in num1:\n maxNumber1 += num\n return maxNumber1\n elif int(min(num1)) > int(num2[0]):\n for i in range(len(maxNumber1)-1,-1,-1):\n maxLeadingDigit2 = \"-1\"\n\n for x in num1:\n if int(x) < int(maxNumber1[i]) and int(x) > int(maxLeadingDigit2):\n maxLeadingDigit2 = x\n if maxLeadingDigit2 == \"-1\":\n num1.append(usedDigits[len(usedDigits)-1])\n usedDigits.pop()\n else:\n num1.append(maxNumber1[i])\n maxNumber1 = maxNumber1[:i] + maxLeadingDigit2\n num1.remove(maxLeadingDigit2)\n num1.sort()\n num1.reverse()\n\n if len(num1) > 0:\n for num in num1:\n maxNumber1 += num\n return maxNumber1\n else:\n return fillInDigit(num1,num2,usedDigits,maxNumber1)\n\nif __name__ == \"__main__\":\n main()", "a=input()\r\nb=input()\r\nv=sorted(a)\r\nv=v[::-1]\r\nx=\"\"\r\nfor i in range(len(v)):\r\n x=x+v[i]\r\nv=x\r\nif(len(a)<len(b)):\r\n print(v)\r\nelse:\r\n if(b==a):\r\n print(a)\r\n else:\r\n fin=\"\"\r\n flag=False\r\n for j in range(len(a)): \r\n for k in range(len(a)):\r\n num=fin+v[k]+''.join(sorted(v[:k:]+v[k+1::]))\r\n #print(num,k,fin)\r\n if(num<=b):\r\n fin+=v[k]\r\n #print(fin,v[k],b[j])\r\n if(int(v[k])<int(b[j])):\r\n flag=True\r\n v=v[:k:]+v[k+1::]\r\n fin+=v \r\n v=v[:k:]+v[k+1::]\r\n break\r\n if(flag):\r\n break\r\n print(fin)", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineerin College\r\n Date:18/05/2020\r\n\r\n'''\r\nimport sys\r\nfrom collections import deque,defaultdict as dd \r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\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\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=1000000007\r\n#mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\ndef read():\r\n tc=0\r\n if tc:\r\n input=sys.stdin.readline\r\n else:\r\n sys.stdin=open('input1.txt', 'r')\r\n sys.stdout=open('output1.txt','w')\r\n\r\n\r\ndef permute(b,x,ind):\r\n if(ind==len(b)):\r\n return 1\r\n f=0\r\n for i in range(9,-1,-1):\r\n if(x[i]>0 and i<=int(b[ind])):\r\n x[i]-=1\r\n ans[ind]=str(i)\r\n if(i<int(b[ind])):\r\n f=1\r\n if(f):\r\n k=9\r\n for j in range(ind+1,len(b)):\r\n while(x[k]==0):\r\n k-=1\r\n ans[j]=str(k)\r\n x[k]-=1\r\n return 1\r\n if(permute(b,x,ind+1)):\r\n return 1\r\n x[i]+=1\r\n return 0\r\n \r\n \r\n\r\ndef solve():\r\n \r\n # for _ in range(ii()):\r\n \r\n \r\n \r\n a=ii()\r\n b=ii()\r\n if(len(str(a))<len(str(b))):\r\n s=list(str(a))\r\n s.sort(reverse=True)\r\n print(\"\".join(s))\r\n else:\r\n x=[0]*10\r\n for i in str(a):\r\n x[int(i)]+=1\r\n b=str(b)\r\n i=0\r\n global ans\r\n ans=[0]*len(b)\r\n permute(b,x,0)\r\n print(\"\".join(ans))\r\n \r\n \r\n \r\n \r\nif __name__ ==\"__main__\":\r\n # read()\r\n solve()\r\n \r\n \r\n ", "import sys\r\ninput = lambda : sys.stdin.readline().rstrip(\"\\r\\n\")\r\na = list(input())\r\nb = int(input())\r\nn = len(a)\r\na.sort()\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n t = a.copy()\r\n t[i], t[j] = t[j], t[i]\r\n \r\n if int(''.join(t)) >= int(''.join(a)) and b >= int(''.join(t)):\r\n a[i], a[j] = a[j], a[i]\r\n\r\nprint(''.join(a))", "a = sorted(list(input()))\r\nb = int(input())\r\n\r\nfor i in range(len(a)):\r\n for j in range(len(a) - 1, -1, -1):\r\n num = a[:i] + a[j:j+1] + a[i:j] + a[j+1:]\r\n if int(''.join(num)) <= b:\r\n a = num\r\n break\r\n \r\nprint(''.join(a))\r\n", "a=''.join(reversed(sorted(input())))\r\nb=int(input())\r\nr=''\r\nwhile len(a)>0:\r\n for i in range(len(a)):\r\n n=r+a[i]+''.join(sorted(a[:i]+a[i+1:]))\r\n if int(n)<=b:\r\n r+=a[i]\r\n a=a[:i]+a[i+1:]\r\n break\r\nprint(r)", "success = 0\r\ndef solve(b, freq, i, n, res):\r\n global success\r\n if i == len(b):\r\n success = res\r\n else:\r\n success = 0\r\n move = 9\r\n while move >= 0 and success == 0:\r\n m = int(b[i])\r\n if freq[move] > 0 and res * 10 + move <= n * 10 + m:\r\n res = res * 10 + move\r\n n = n * 10 + m\r\n freq[move] -= 1\r\n if solve(b, freq, i + 1, n, res) == 0:\r\n res //= 10\r\n n //= 10\r\n freq[move] += 1\r\n move -= 1\r\n return success\r\n\r\na = input()\r\nb = input()\r\nfreq = []\r\nfor i in range(10):\r\n freq.append(0)\r\nv = []\r\nfor x in a:\r\n n = int(x)\r\n v.append(n)\r\n freq[n] += 1\r\nv.sort()\r\nans = 0\r\nif len(b) > len(a):\r\n m = 1\r\n for x in v:\r\n ans = x * m + ans\r\n m *= 10\r\nelse:\r\n ans = solve(b, freq, 0, 0, 0)\r\nprint(ans)", "a = sorted(input())\nb = int(input())\na = a[::-1] #reverse a\np = ''\ncnt = [0]*10\n\nwhile a :\n for i, d in enumerate(a):\n n = p + d + \"\".join(sorted(a[:i]+a[i+1:]))\n if int(n) <= b :\n p += d\n a.pop(i)\n break\n \nprint(p)", "a=list(input())\r\nb=int(input())\r\na.sort(reverse=True)\r\nans=\"\"\r\nwhile a:\r\n for i in range(len(a)):\r\n j=a[:i]+a[i+1:]\r\n l=ans+a[i]+\"\".join(sorted(j))\r\n if int(l)<=b:\r\n ans=ans+a[i]\r\n del(a[i])\r\n break\r\n \r\nprint(ans)", "a=list(input())\r\nb=int(input())\r\na.sort()\r\nfor i in range(len(a)):\r\n for j in range(len(a)-1,-1,-1):\r\n z=a[:i]+a[j:j+1]+a[i:j]+a[j+1:]\r\n if int(\"\".join(z))<=b:\r\n a=z\r\n break\r\nprint(\"\".join(a))", "a=int(input())\r\nb=int(input())\r\nx=[0]*10\r\nwhile a:\r\n x[a%10]+=1\r\n a=a//10\r\nans=0\r\nfor i in range(9,-1,-1):\r\n for j in range(x[i]):\r\n ans=ans*10+i\r\nif ans<=b:\r\n print(ans)\r\nelse:\r\n ans=0\r\n for j in str(b):\r\n c=int(j)\r\n while c>=0 and not x[c]:\r\n c-=1\r\n if c<0:\r\n while True:\r\n x[ans%10]+=1\r\n d=ans%10\r\n ans=ans//10\r\n flag=0\r\n for b in range(d-1,-1,-1):\r\n\r\n if x[b]:\r\n ans=ans*10+b\r\n x[b]-=1\r\n flag=1\r\n break\r\n if flag:\r\n break\r\n break\r\n \r\n \r\n else:\r\n x[c]-=1\r\n ans=ans*10+c\r\n if c<int(j):\r\n break\r\n\r\n for j in range(9,-1,-1):\r\n for i in range(x[j]):\r\n ans=ans*10+j\r\n print(ans)\r\n \r\n", "def main():\r\n import sys\r\n input = sys.stdin.readline\r\n\r\n a = int(input())\r\n b = int(input())\r\n a = list(str(a))\r\n a.sort()\r\n ans = []\r\n while a:\r\n for i in range(len(a) - 1, -1, -1):\r\n c = ans + [a[i]] + a[:i] + a[i+1:]\r\n if int(''.join(c)) <= b:\r\n ans.append(a[i])\r\n a.pop(i)\r\n break\r\n print(''.join(ans))\r\n\r\n\r\nmain()", "a = sorted(input())\nb = int(input())\na = a[::-1]\np = ''\nwhile a:\n\tfor i,z in enumerate(a):\n\t\tn=p+a[i]+''.join(sorted(a[:i]+a[i+1:]))\n\t\t#print(n,end=' ')\n\t\tif int(n)<=b:\n\t\t\tp += z\n\t\t\t#print(p)\n\t\t\ta.pop(i)\n\t\t\tbreak\nprint(p)", "a = sorted(input())\r\nb = int(input())\r\na = a[::-1]\r\np = \"\"\r\nwhile a:\r\n\tfor i, z in enumerate(a):\r\n\t\tn = p + a[i] + \"\".join(sorted(a[:i]+a[i+1:]))\r\n\t\tif int(n)<=b:\r\n\t\t\tp += z\r\n\t\t\ta.pop(i)\r\n\t\t\tbreak\r\nprint(p)", "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 a=rs();b=rs()\r\n n=len(a);m=len(b)\r\n d=[0]*10\r\n ans=''\r\n for c in a: d[int(c)]+=1\r\n if n<m:\r\n for i in range(9,-1,-1): ans+=str(i)*d[i]\r\n return ans\r\n for lst in range(m-1,-2,-1):\r\n tp=[d[i] for i in range(10)]\r\n for i in range(lst+1): tp[int(b[i])]-=1\r\n if min(tp)<0: continue\r\n if lst==m-1: return b\r\n for i in range(int(b[lst+1])-1,-1,-1):\r\n if tp[i]>0: ans=b[:lst+1]+str(i); tp[i]-=1;break\r\n if not ans: ans=''; continue\r\n for i in range(9,-1,-1): ans+=str(i)*tp[i]\r\n break \r\n return ans\r\n\r\nprint(main())", "# URL: http://codeforces.com/contest/915/problem/C\r\n# Given integer a <= b, rearrange digits in maximally possible way s.t a <= b.\r\n# Approach:\r\n# 1. We will create a' moving from leftmost digit to rightmost digit.\r\n# 2. Consider the leftmost digit in a', a'[0], and the digit in the\r\n# equivalent position in b, b[0].\r\n# i. a'[0] must be <= b[0], otherwise a' > b.\r\n# ii. If a'[0] == b[0], we must check that a'[1:] <= b[1:].\r\n# iii. If a'[0] < b[0], a'[1:] is sorted in descending order.\r\n\r\nfrom typing import List\r\n\r\n\r\na: List[str] = sorted(list(input()), reverse=True)\r\nb: str = input()\r\nprefix: str = ''\r\n\r\n\r\ndef solve(a: List[str], b: str, prefix: str) -> str:\r\n if len(a) == 0:\r\n return prefix\r\n for i, elem in enumerate(a):\r\n candidate = prefix + elem + \"\".join(sorted(a[:i] + a[i + 1:]))\r\n if int(candidate) <= int(b):\r\n return solve(a[:i] + a[i + 1:], b, prefix + elem)\r\n raise Exception('Unhandled recursive case.')\r\n\r\n\r\nprint(solve(a, b, prefix))\r\n", "# import sys \n# sys.stdin = open('input.txt', 'r') \n# sys.stdout = open('output.txt', 'w')\n\na = [int(i) for i in list(input())]\nb = [int(i) for i in list(input())]\n\nif (len(a)<len(b)):\n\ta.sort(reverse=True)\n\tans = 0\n\tfor i in range(len(a)):\n\t\tans = ans*10+a[i]\n\tprint(ans)\nelse:\n\t# ans = [0]*len(a)\n\tans = 0\n\tn = len(a)\n\tcount = [0]*10\n\tfor i in range(n):\n\t\tcount[a[i]] += 1\n\ti = 0\n\twhile (i<n):\n\t\tx = b[i]\n\t\tif (count[x]>0):\n\t\t\tans = ans*10+x\n\t\t\tcount[x] -= 1\n\t\t\ti += 1\n\t\telse:\n\t\t\tbreak\n\tif (i==n):\n\t\tprint(ans)\n\t\texit(0)\n\tx = b[i]\n\tflag = False\n\tfor j in range(x-1,-1,-1):\n\t\tif (count[j]>0):\n\t\t\tans = ans*10+j\n\t\t\tcount[j] -= 1\n\t\t\tflag = True\n\t\t\tbreak\n\tif (flag) :\n\t\tfor j in range(9,-1,-1):\n\t\t\twhile (count[j]>0):\n\t\t\t\tans = ans*10+j\n\t\t\t\tcount[j] -= 1\n\telse:\n\t\twhile (not flag):\n\t\t\tt = ans%10\n\t\t\tans = ans//10\n\t\t\tcount[t] += 1\n\t\t\tfor i in range(t-1,-1,-1):\n\t\t\t\tif (count[i]>0):\n\t\t\t\t\tcount[i] -= 1\n\t\t\t\t\tflag = True\n\t\t\t\t\tans = ans*10 + i\n\t\t\t\t\tbreak\n\t\tfor j in range(9,-1,-1):\n\t\t\twhile (count[j]>0):\n\t\t\t\tans = ans*10+j\n\t\t\t\tcount[j] -= 1\n\tprint(ans)\n", "a = input()\nb = input()\nlist_a = list(a)\nlist_a.sort()\nmax_a = int(''.join(list_a))\nfor i in range(len(a)):\n for j in range(i+1, len(a)):\n list_a[i], list_a[j] = list_a[j], list_a[i]\n temp_a = int(''.join(list_a))\n if int(b) < temp_a or temp_a <= max_a:\n list_a[i], list_a[j] = list_a[j], list_a[i]\n else:\n max_a = temp_a\nprint(max_a)", "if __name__ == '__main__':\r\n a = list(input())\r\n b = list(input())\r\n la = len(a)\r\n lb = len(b)\r\n a.sort()\r\n if la < lb:\r\n a.reverse()\r\n print(int(''.join(a)))\r\n else:\r\n for i in range(la):\r\n for j in range(i, la):\r\n a[i], a[j] = a[j], a[i]\r\n if a > b:\r\n a[j], a[i] = a[i], a[j]\r\n print(int(''.join(a)))\r\n", "a = list(input())\r\nb = list(input())\r\nn = len(a)\r\na.sort()\r\n\r\ndef listtostring(string):\r\n return ''.join([str(ele) for ele in string])\r\n\r\n\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n t = a.copy()\r\n t[i],t[j] = t[j],t[i]\r\n if((int(listtostring(t)) >= int(listtostring(a))) and (int(listtostring(t))<= int(listtostring(b)))):\r\n # print(\"BEFORE\",a,a[i],a[j],i,j)\r\n a[i],a[j] = a[j],a[i]\r\n # print(\"AFTER\",a,a[i],a[j],i,j)\r\n \r\nprint(listtostring(a))", "from collections import Counter\r\n\r\n\r\ndef mx(f):\r\n res = []\r\n for k in sorted(f.keys(), reverse=True):\r\n for _ in range(f[k]):\r\n res.append(k)\r\n return res\r\n\r\n\r\ndef solve(n, a, b):\r\n res = None\r\n for k in range(n + 1):\r\n aa = Counter(a)\r\n cur = []\r\n for i in range(k):\r\n if aa[b[i]] == 0:\r\n return res\r\n cur.append(b[i])\r\n aa[b[i]] -= 1\r\n if k < n:\r\n for e in range(b[k] - 1, -1, -1):\r\n if aa[e] > 0:\r\n cur.append(e)\r\n aa[e] -= 1\r\n cur.extend(mx(aa))\r\n break\r\n if len(cur) < n:\r\n continue\r\n res = cur\r\n return res\r\n\r\n\r\na = Counter(map(int, input()))\r\nb = list(map(int, input()))\r\nif sum(a.values()) < len(b):\r\n res = mx(a)\r\nelse:\r\n res = solve(len(b), a, b)\r\nprint(''.join(map(str, res)))", "a = input()\r\nb = input()\r\n\r\nif len(a) < len(b):\r\n a = sorted(a)[::-1]\r\n print(''.join(a))\r\n exit(0)\r\n\r\n\r\ndef check(res, j, a):\r\n added = False\r\n tmp = \"\"\r\n for i in a:\r\n if i == j and not added:\r\n added = True\r\n else:\r\n tmp += i\r\n tmp = res + j + tmp[::-1]\r\n return tmp <= b\r\n\r\n\r\n# len(a) == len(b)\r\nres = \"\"\r\nn = len(a)\r\na = sorted(list(a))[::-1]\r\nfor i in range(n):\r\n for j in a:\r\n if check(res, j, a):\r\n res += j\r\n a.remove(j)\r\n break\r\nprint(res)\r\n", "\r\na = int(input())\r\nb = int(input())\r\nl = []\r\n\r\nwhile a != 0:\r\n d = a % 10\r\n a //= 10\r\n l.append(d)\r\n\r\ndef f(a, b):\r\n s = len(l)\r\n if s == 0:\r\n return a\r\n for i in range(len(l) - 1, -1, -1):\r\n # 0 <= i <= len(l)-1\r\n min_suf = 0\r\n for j in range(len(l)):\r\n if j == i:\r\n continue\r\n min_suf *= 10\r\n min_suf += l[j]\r\n if a*(10**s) + l[i]*(10**(s-1)) + min_suf <= b:\r\n dig = l.pop(i)\r\n #print(dig)\r\n return f(a*10 + dig, b)\r\n\r\n#\r\nl.sort()\r\nprint(f(0, b))", "def main():\r\n\ts = list(input())\r\n\tt = list(input())\r\n\tif len(s) < len(t):\r\n\t\ts.sort(reverse=True)\r\n\t\tprint(''.join(s))\r\n\telse:\r\n\t\tcount = [0] * 10\r\n\t\tfor elm in s:\r\n\t\t\tcount[ord(elm) - ord('0')] += 1\r\n\t\tans = []\r\n\t\tless = False\r\n\t\tfor i in range(len(s)):\r\n\t\t\tfor j in range(9, -1, -1):\r\n\t\t\t\tif not less:\r\n\t\t\t\t\tif j <= ord(t[i]) - ord('0') and count[j] > 0:\r\n\t\t\t\t\t\tif j < ord(t[i]) - ord('0'):\r\n\t\t\t\t\t\t\tans.append(chr(j + ord('0')))\r\n\t\t\t\t\t\t\tcount[j] -= 1\r\n\t\t\t\t\t\t\tless = True\r\n\t\t\t\t\t\t\tbreak\r\n\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\tcurr_num = 0\r\n\t\t\t\t\t\t\tfor k in range(10):\r\n\t\t\t\t\t\t\t\tif j == k:\r\n\t\t\t\t\t\t\t\t\tfor tmp in range(count[k] - 1):\r\n\t\t\t\t\t\t\t\t\t\tcurr_num = curr_num * 10 + k\r\n\t\t\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\t\t\tfor tmp in range(count[k]):\r\n\t\t\t\t\t\t\t\t\t\tcurr_num = curr_num * 10 + k\r\n\t\t\t\t\t\t\trest_num = 0\r\n\t\t\t\t\t\t\tfor k in range(i + 1, len(s)):\r\n\t\t\t\t\t\t\t\trest_num = rest_num * 10 + (ord(t[k]) - ord('0'))\r\n\t\t\t\t\t\t\tif rest_num >= curr_num:\r\n\t\t\t\t\t\t\t\tans.append(chr(j + ord('0')))\r\n\t\t\t\t\t\t\t\tcount[j] -= 1\r\n\t\t\t\t\t\t\t\tbreak\r\n\t\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\t\tcontinue\r\n\t\t\t\telse:\r\n\t\t\t\t\tif count[j] > 0:\r\n\t\t\t\t\t\tans.append(chr(j + ord('0')))\r\n\t\t\t\t\t\tcount[j] -= 1\r\n\t\t\t\t\t\tbreak\r\n\t\tprint(''.join(ans))\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "a = list(input())\r\nb = int(input())\r\na = sorted(a, reverse=True)\r\nans = ''\r\nwhile len(a) > 0:\r\n for i in range(len(a)):\r\n tmp = ans + a[i] + ''.join(sorted(a[:i] + a[i + 1:]))\r\n if int(tmp) <= b:\r\n ans += a[i]\r\n a = a[:i] + a[i + 1:]\r\n break\r\nprint(ans)\r\n", "def possible(a,index,a1,b):\r\n rem = []\r\n for i in range(len(a)):\r\n if i != index:\r\n rem.append(a[i])\r\n\r\n a3 = a1[:]\r\n rem.sort()\r\n a3.append(a[index])\r\n a3.extend(rem)\r\n a2 = ''\r\n for i in a3:\r\n a2 += str(i)\r\n\r\n if int(a2) <= b:\r\n return True\r\n\r\n return False\r\n\r\ndef main():\r\n a = list(map(int,input()))\r\n b = int(input())\r\n\r\n a.sort(reverse = True)\r\n a1 = []\r\n for pos in range(len(a)):\r\n for i in range(len(a)):\r\n if possible(a,i,a1,b):\r\n a1.append(a[i])\r\n a.pop(i)\r\n break\r\n \r\n for i in a1:\r\n print(i,end = '')\r\n\r\nmain()\r\n" ]

{"inputs": ["123\n222", "3921\n10000", "4940\n5000", "23923472834\n23589234723", "102391019\n491010301", "123456789123456789\n276193619183618162", "1000000000000000000\n1000000000000000000", "1\n1000000000000000000", "999999999999999999\n1000000000000000000", "2475345634895\n3455834583479", "15778899\n98715689", "4555\n5454", "122112\n221112", "199999999999991\n191000000000000", "13\n31", "212\n211", "222234\n322223", "123456789\n987654311", "20123\n21022", "10101\n11000", "592\n924", "5654456\n5634565", "655432\n421631", "200\n200", "123456789987654321\n121111111111111111", "12345\n21344", "120\n200", "123\n212", "2184645\n5213118", "9912346\n9912345", "5003\n5000", "12345\n31234", "5001\n5000", "53436\n53425", "9329\n3268", "1234567890\n9000000001", "321\n212", "109823464\n901234467", "6543\n6542", "555441\n555100", "472389479\n327489423", "45645643756464352\n53465475637456247", "254\n599", "5232222345652321\n5000000000000000", "201\n200", "14362799391220361\n45160821596433661", "3453\n5304", "989\n998", "5200000000234\n5200000000311", "5555132\n1325442", "123\n211", "65689\n66123", "123451234567890\n123456789012345", "22115\n22015", "123\n311", "12222\n21111", "765\n567", "9087645\n9087640", "1111111122222333\n2220000000000000", "7901\n7108", "215489\n215488", "102\n200", "19260817\n20011213", "12345\n53200", "1040003001\n1040003000", "295\n924", "20000000000000001\n20000000000000000", "99988877\n99887766", "12\n12", "199999999999999999\n900000000000000000", "1234\n4310", "100011\n100100", "328899\n328811", "646722972346\n397619201220", "1203\n1200", "1\n2", "1112\n2110", "4545\n5540", "3053\n5004", "3503\n5004", "351731653766064847\n501550303749042658", "10123456789013451\n26666666666666666", "1110111\n1100000", "30478\n32265", "456546546549874615\n441554543131214545", "214\n213", "415335582799619283\n133117803602859310", "787\n887", "3333222288889999\n3333222288881111", "495779862481416791\n836241745208800994", "139\n193", "9568\n6500", "3208899\n3228811", "27778\n28710", "62345\n46415", "405739873179209\n596793907108871", "365\n690", "8388731334391\n4710766672578", "1230\n1200", "1025\n5000", "4207799\n4027711", "4444222277779999\n4444222277771111", "7430\n3047", "649675735\n540577056", "26\n82", "241285\n207420", "3\n3", "12\n21", "481287\n826607", "40572351\n59676984", "268135787269\n561193454469", "4\n9", "5\n6", "60579839\n33370073", "49939\n39200", "2224\n4220", "427799\n427711", "49\n90", "93875\n82210", "78831\n7319682", "937177\n7143444", "499380628\n391990337", "2090909\n2900000", "112233445566778890\n987654321987654320", "48257086\n80903384", "112233445566778890\n900654321987654320", "112233445566778890\n123456789123456788", "5207799\n5027711", "200000000000000001\n200000000000000000", "597402457\n797455420", "90\n94", "86888\n88683", "419155888\n588151913", "408919130\n191830070", "524975\n554924", "53029\n30524", "5549\n5542", "6\n9", "87\n810", "920491855\n281495062", "6691\n6910", "533\n335", "999999999999999998\n999999999999999997", "21111111111111111\n21111111111111110", "2\n12", "76544\n45744", "2000000000000001\n2000000000000000", "740867\n467701", "2\n6", "103\n130", "2423712\n8466235", "84\n48", "1210\n12113", "2430\n20786", "100\n999", "19325\n21903", "1969\n23251"], "outputs": ["213", "9321", "4940", "23498743322", "399211100", "276193618987554432", "1000000000000000000", "1", "999999999999999999", "3455834579642", "98598771", "4555", "221112", "119999999999999", "31", "122", "243222", "987654231", "20321", "10110", "592", "5566544", "365542", "200", "119988776655443322", "15432", "120", "132", "5186442", "9694321", "3500", "25431", "1500", "53364", "2993", "8976543210", "132", "896443210", "6534", "554541", "327487994", "53465475636654442", "542", "4655533322222221", "120", "43999766332221110", "4533", "998", "5200000000243", "1255553", "132", "65986", "123456789012345", "21521", "231", "12222", "567", "9087564", "2213332221111111", "7091", "214985", "120", "19876210", "53142", "1040001300", "592", "12000000000000000", "99879887", "12", "199999999999999999", "4231", "100011", "299883", "397476664222", "1032", "1", "1211", "5454", "3530", "3530", "501548777666643331", "26598754433111100", "1011111", "30874", "441554498766665554", "142", "132999887655543321", "877", "3332999988883222", "829998777665444111", "193", "5986", "3209988", "27877", "46352", "594998777332100", "653", "4398887333311", "1032", "2510", "2997740", "4442999977774222", "3047", "539776654", "62", "185422", "3", "21", "824871", "57543210", "539887766221", "4", "5", "30998765", "34999", "2422", "299774", "49", "79853", "88731", "977731", "390988642", "2099900", "987654321876543210", "80876542", "898776655443322110", "123456789123456780", "2997750", "120000000000000000", "797455420", "90", "86888", "588151894", "191830049", "554792", "30295", "5495", "6", "87", "281495059", "6691", "335", "999999999999999989", "12111111111111111", "2", "45674", "1200000000000000", "467087", "2", "130", "7432221", "48", "2110", "4320", "100", "21593", "9961"]}

UNKNOWN

PYTHON3

CODEFORCES

53

8b3fa8eccfdabf8716ba8e9019da55da

none

You are given an array of positive integers *a*1,<=*a*2,<=...,<=*a**n*<=×<=*T* of length *n*<=×<=*T*. We know that for any *i*<=><=*n* it is true that *a**i*<==<=*a**i*<=-<=*n*. Find the length of the longest non-decreasing sequence of the given array. The first line contains two space-separated integers: *n*, *T* (1<=≤<=*n*<=≤<=100, 1<=≤<=*T*<=≤<=107). The second line contains *n* space-separated integers *a*1,<=*a*2,<=...,<=*a**n* (1<=≤<=*a**i*<=≤<=300). Print a single number — the length of a sought sequence. Sample Input 4 3 3 1 4 2 Sample Output 5

[ "def solve():\r\n n,T = map(int,input().split())\r\n array = list(map(int,input().split()))\r\n ElementsTillN = {}\r\n for x in range(n):\r\n ElementsTillN[x]={array[x]:1}\r\n for x in range(1,n):\r\n for y in range(x):\r\n if array[y]<=array[x]:\r\n for value,num in ElementsTillN[y].items():\r\n if value in ElementsTillN[x]:\r\n ElementsTillN[x][value]=max(num+1,ElementsTillN[x][value])\r\n else:\r\n ElementsTillN[x][value]=num+1\r\n newElementsTillN = {}\r\n for x in range(n):\r\n valueAtIndex = array[x]\r\n if valueAtIndex not in newElementsTillN:\r\n newElementsTillN[valueAtIndex]={}\r\n for value,num in ElementsTillN[x].items():\r\n if value in newElementsTillN[valueAtIndex]:\r\n newElementsTillN[valueAtIndex][value]=max(num,newElementsTillN[valueAtIndex][value])\r\n else:\r\n newElementsTillN[valueAtIndex][value]=num \r\n # print (newElementsTillN)\r\n # print (\"##################\")\r\n valueSoFar = [0]*301\r\n changes = [0]*110\r\n for x in range(min(110,T)):\r\n currentSoFar = [0]*301\r\n for end in newElementsTillN.keys():\r\n for start in array:\r\n if start<=end:\r\n for newStart,value in newElementsTillN[end].items():\r\n if newStart>=start:\r\n currentSoFar[end]= max(currentSoFar[end],value+valueSoFar[start])\r\n changes[x] = max(currentSoFar)-max(valueSoFar)\r\n # print (changes[x])\r\n valueSoFar = currentSoFar\r\n # for index in range(301):\r\n # if valueSoFar[index]:\r\n # print (index,valueSoFar[index])\r\n # print (\"#####################\")\r\n T-=110\r\n # print (changes)\r\n if T>0:\r\n print (max(valueSoFar)+ T*changes[-1])\r\n else:\r\n print (max(valueSoFar))\r\nsolve()", "f = lambda: map(int, input().split())\r\nn, m = f()\r\nt = list(f())\r\ns = [0] * 301\r\nd = s[:]\r\nfor i in t: d[i] += 1\r\nfor i in t * min(m, 2 * n): s[i] = max(s[:i + 1]) + 1\r\nprint(max(s) + max((m - n * 2) * max(d), 0))", "f = lambda: map(int, input().split())\r\nn, m = f()\r\nt = list(f())\r\nd = {i: j for j, i in enumerate(sorted(set(t)))}\r\nt = [d[i] for i in t]\r\nk = len(d)\r\na = [0] * k\r\nif m < 2 * k:\r\n for j in t * m:\r\n a[j] += 1\r\n q = a[j]\r\n j += 1\r\n while j < k and a[j] < q:\r\n a[j] += 1\r\n j += 1\r\n print(a[-1])\r\n exit()\r\na = [0] * k\r\nfor j in t * k:\r\n a[j] += 1\r\n q = a[j]\r\n j += 1\r\n while j < k and a[j] < q:\r\n a[j] += 1\r\n j += 1\r\nb = [0] * k\r\nt.reverse()\r\nfor j in t * k:\r\n b[j] += 1\r\n q = b[j]\r\n j -= 1\r\n while j > -1 and b[j] < q:\r\n b[j] += 1\r\n j -= 1\r\nprint(max(a[j] + (m - 2 * k) * t.count(j) + b[j] for j in range(k)))", "import sys\nfrom collections import Counter\n\n#sys.stdin = open(\"input.txt\")\n#sys.stdout = open(\"output.txt\", \"w\")\n\nn, t = [int(i) for i in input().split()]\nlst = [int(i) for i in input().split()]\ncnt = Counter(lst)\nmostlst = cnt.most_common()\nfreq = mostlst[0][1]\n\n#print(\"freq = \", freq, sep='')\n\ncurlist = lst\n\ncurt = 1\nd = [0 for i in range(n)]\nprevmax = 0\ncurmax = 0\nans = 0\nwhile curt <= t:\n\td += [1 for i in range(n)]\n\t#print(d)\n\tind = curt * n\n\t#print(\"from =\", ind - n)\n\tfor i in range(n):\n\t\tfor j in range(-n, i):\n\t\t\tif lst[j] <= lst[i]:\n\t\t\t\td[ind + i] = max(d[ind + i], d[ind + j] + 1)\n\tcurmax = max(d[ind:ind + n])\n\tif curmax - prevmax == freq:\n\t\tans = curmax + freq * (t - curt)\n\t\tbreak\n\tcurt += 1\n\tprevmax = curmax\nelse:\n\tans = curmax\n\n#print(d)\n#print(curt)\nprint(ans)", "def cronch(A):\n D = {v:i for i, v in enumerate(sorted(set(A)))}\n return len(D), [D[a] for a in A]\n\n\ndef lnds(n, t, A):\n m, A = cronch(A)\n S = [[0 for _ in range(m)] for _ in range(m)]\n for j in A:\n for i in range(j+1):\n S[i][j] += 1\n v = S[i][j]\n for k in range(j+1, m):\n if S[i][k] >= v:\n break\n S[i][k] = v\n\n # for r in S:\n # log(r)\n\n # log()\n\n if t <= 2 * m:\n V = [0 for _ in range(m)]\n for _ in range(t):\n V2 = [0 for _ in range(m)]\n for i in range(m):\n for j in range(i, m):\n V2[j] = max(V2[j], V[i] + S[i][j])\n V = V2\n # log(V)\n return max(V)\n else:\n V = [0 for _ in range(m)]\n W = [0 for _ in range(m)]\n for _ in range(m):\n V2 = [0 for _ in range(m)]\n W2 = [0 for _ in range(m)]\n for i in range(m):\n for j in range(i, m):\n V2[j] = max(V2[j], V[i] + S[i][j])\n W2[i] = max(W2[i], S[i][j] + W[j])\n V = V2\n W = W2\n # log(V, W)\n\n p = t - (2*m)\n return max(V[k] + S[k][k]*p + W[k] for k in range(m))\n\n\ndef main():\n n, t = map(int, input().split())\n A = list(map(int, input().split()))\n assert len(A) == n\n print(lnds(n, t, A))\n\n##########\n\nimport sys\nimport time\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n t0 = time.time()\n main()\n t1 = time.time()\n if r.getvalue() == o:\n log(f\"OK ({int((t1-t0)*1000000)/1000:0.3f} ms)\\n\")\n else:\n log(f\"Expected:\\n{o}\"\n f\"Got ({int((t1-t0)*1000000)/1000:0.3f} ms):\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n4 3\n3 1 4 2\n\"\"\", \"\"\"\\\n5\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='*')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n" ]

{"inputs": ["4 3\n3 1 4 2", "1 1000\n42", "31 3767\n16 192 152 78 224 202 186 52 118 19 13 38 199 196 35 295 100 64 205 37 166 124 169 214 66 243 134 192 253 270 92", "15 12226\n18 125 213 221 124 147 154 182 134 184 51 49 267 88 251", "81 10683\n3 52 265 294 213 242 185 151 27 165 128 237 124 14 43 147 104 162 124 103 233 156 288 57 289 195 129 77 97 138 153 289 203 126 34 5 97 35 224 120 200 203 222 94 171 294 293 108 145 193 227 206 34 295 1 233 258 7 246 34 60 232 58 169 77 150 272 279 171 228 168 84 114 229 149 97 66 246 212 236 151", "29 7954\n1 257 8 47 4 26 49 228 120 53 138 101 101 35 293 232 299 195 219 45 195 174 96 157 168 138 288 114 291", "39 1057\n1 120 247 206 260 117 152 24 162 266 202 152 278 199 63 188 271 62 62 177 213 77 229 197 263 178 211 102 255 257 163 134 14 66 11 113 216 288 225", "2 766\n147 282", "2 13101\n180 199", "29 1918\n8 81 38 146 195 199 31 153 267 139 48 202 38 259 139 71 253 3 289 44 210 81 78 259 236 189 219 102 133", "46 13793\n1 239 20 83 33 183 122 208 46 141 11 264 196 266 104 130 116 117 31 213 235 207 219 206 206 46 89 112 260 191 245 234 87 255 186 4 251 177 130 59 81 54 227 116 105 284", "2 8698\n71 225", "68 2450\n107 297 185 215 224 128 8 65 101 202 19 145 255 233 138 223 144 132 32 122 153 85 31 160 219 125 167 220 138 255 219 119 165 249 47 124 20 37 160 24 156 154 163 226 270 88 74 192 204 300 194 184 235 93 267 160 12 216 91 191 267 241 152 9 111 76 201 295", "100 10000000\n98 99 96 97 94 95 92 93 90 91 88 89 86 87 84 85 82 83 80 81 78 79 76 77 74 75 72 73 70 71 68 69 66 67 64 65 62 63 60 61 58 59 56 57 54 55 52 53 50 51 48 49 46 47 44 45 42 43 40 41 38 39 36 37 34 35 32 33 30 31 28 29 26 27 24 25 22 23 20 21 18 19 16 17 14 15 12 13 10 11 8 9 6 7 4 5 2 3 1 100", "99 10000000\n97 98 95 96 93 94 91 92 89 90 87 88 85 86 83 84 81 82 79 80 77 78 75 76 73 74 71 72 69 70 67 68 65 66 63 64 61 62 59 60 57 58 55 56 53 54 51 52 49 50 47 48 45 46 43 44 41 42 39 40 37 38 35 36 33 34 31 32 29 30 27 28 25 26 23 24 21 22 19 20 17 18 15 16 13 14 11 12 9 10 7 8 5 6 3 4 1 2 99", "99 10000000\n96 97 98 93 94 95 90 91 92 87 88 89 84 85 86 81 82 83 78 79 80 75 76 77 72 73 74 69 70 71 66 67 68 63 64 65 60 61 62 57 58 59 54 55 56 51 52 53 48 49 50 45 46 47 42 43 44 39 40 41 36 37 38 33 34 35 30 31 32 27 28 29 24 25 26 21 22 23 18 19 20 15 16 17 12 13 14 9 10 11 6 7 8 3 4 5 2 1 99", "100 10000000\n97 98 99 94 95 96 91 92 93 88 89 90 85 86 87 82 83 84 79 80 81 76 77 78 73 74 75 70 71 72 67 68 69 64 65 66 61 62 63 58 59 60 55 56 57 52 53 54 49 50 51 46 47 48 43 44 45 40 41 42 37 38 39 34 35 36 31 32 33 28 29 30 25 26 27 22 23 24 19 20 21 16 17 18 13 14 15 10 11 12 7 8 9 4 5 6 1 2 3 100", "98 10000000\n95 96 97 92 93 94 89 90 91 86 87 88 83 84 85 80 81 82 77 78 79 74 75 76 71 72 73 68 69 70 65 66 67 62 63 64 59 60 61 56 57 58 53 54 55 50 51 52 47 48 49 44 45 46 41 42 43 38 39 40 35 36 37 32 33 34 29 30 31 26 27 28 23 24 25 20 21 22 17 18 19 14 15 16 11 12 13 8 9 10 5 6 7 2 3 4 97 98", "95 10000000\n92 93 94 89 90 91 86 87 88 83 84 85 80 81 82 77 78 79 74 75 76 71 72 73 68 69 70 65 66 67 62 63 64 59 60 61 56 57 58 53 54 55 50 51 52 47 48 49 44 45 46 41 42 43 38 39 40 35 36 37 32 33 34 29 30 31 26 27 28 23 24 25 20 21 22 17 18 19 14 15 16 11 12 13 8 9 10 5 6 7 2 3 4 94 95", "98 10000000\n195 196 197 192 193 194 189 190 191 186 187 188 183 184 185 180 181 182 177 178 179 174 175 176 171 172 173 168 169 170 165 166 167 162 163 164 159 160 161 156 157 158 153 154 155 150 151 152 147 148 149 144 145 146 141 142 143 138 139 140 135 136 137 132 133 134 129 130 131 126 127 128 123 124 125 120 121 122 117 118 119 114 115 116 111 112 113 108 109 110 105 106 107 102 103 104 1 2", "95 10000000\n192 193 194 189 190 191 186 187 188 183 184 185 180 181 182 177 178 179 174 175 176 171 172 173 168 169 170 165 166 167 162 163 164 159 160 161 156 157 158 153 154 155 150 151 152 147 148 149 144 145 146 141 142 143 138 139 140 135 136 137 132 133 134 129 130 131 126 127 128 123 124 125 120 121 122 117 118 119 114 115 116 111 112 113 108 109 110 105 106 107 102 103 104 1 2", "98 10000000\n1 2 195 196 197 192 193 194 189 190 191 186 187 188 183 184 185 180 181 182 177 178 179 174 175 176 171 172 173 168 169 170 165 166 167 162 163 164 159 160 161 156 157 158 153 154 155 150 151 152 147 148 149 144 145 146 141 142 143 138 139 140 135 136 137 132 133 134 129 130 131 126 127 128 123 124 125 120 121 122 117 118 119 114 115 116 111 112 113 108 109 110 105 106 107 102 103 104", "98 10000000\n1 2 5 4 3 8 7 6 11 10 9 14 13 12 17 16 15 20 19 18 23 22 21 26 25 24 29 28 27 32 31 30 35 34 33 38 37 36 41 40 39 44 43 42 47 46 45 50 49 48 53 52 51 56 55 54 59 58 57 62 61 60 65 64 63 68 67 66 71 70 69 74 73 72 77 76 75 80 79 78 83 82 81 86 85 84 89 88 87 92 91 90 95 94 93 98 97 96", "98 10000000\n1 1 5 4 3 8 7 6 11 10 9 14 13 12 17 16 15 20 19 18 23 22 21 26 25 24 29 28 27 32 31 30 35 34 33 38 37 36 41 40 39 44 43 42 47 46 45 50 49 48 53 52 51 56 55 54 59 58 57 62 61 60 65 64 63 68 67 66 71 70 69 74 73 72 77 76 75 80 79 78 83 82 81 86 85 84 89 88 87 92 91 90 95 94 93 98 97 96", "98 10000000\n1 2 95 96 97 92 93 94 89 90 91 86 87 88 83 84 85 80 81 82 77 78 79 74 75 76 71 72 73 68 69 70 65 66 67 62 63 64 59 60 61 56 57 58 53 54 55 50 51 52 47 48 49 44 45 46 41 42 43 38 39 40 35 36 37 32 33 34 29 30 31 26 27 28 23 24 25 20 21 22 17 18 19 14 15 16 11 12 13 8 9 10 5 6 7 2 3 4", "99 10000000\n1 2 3 95 96 97 92 93 94 89 90 91 86 87 88 83 84 85 80 81 82 77 78 79 74 75 76 71 72 73 68 69 70 65 66 67 62 63 64 59 60 61 56 57 58 53 54 55 50 51 52 47 48 49 44 45 46 41 42 43 38 39 40 35 36 37 32 33 34 29 30 31 26 27 28 23 24 25 20 21 22 17 18 19 14 15 16 11 12 13 8 9 10 5 6 7 2 3 4", "100 10000000\n1 2 2 1 2 2 1 1 2 2 1 2 1 1 1 1 1 2 2 2 1 2 1 2 1 2 1 2 1 1 2 1 1 1 2 2 2 1 1 2 2 1 1 2 2 2 2 2 2 1 1 2 2 1 1 2 1 1 2 1 2 1 1 2 1 2 2 2 1 1 2 2 1 2 1 1 2 2 1 1 1 2 1 2 1 1 1 2 1 1 1 1 1 1 1 1 2 1 1 1", "100 10000000\n2 4 2 5 2 1 1 3 2 4 3 5 3 4 2 4 2 4 1 2 3 3 1 1 3 3 1 3 5 1 2 1 5 2 3 4 5 2 1 2 1 3 4 4 4 3 5 5 3 1 5 2 1 4 4 3 2 3 2 3 2 4 2 1 3 3 3 2 3 5 1 5 4 3 1 4 5 3 2 4 5 4 1 3 4 1 1 3 4 2 2 5 4 2 2 3 3 2 3 1", "100 10000000\n31 150 132 17 273 18 292 260 226 217 165 68 36 176 89 75 227 246 137 151 87 215 267 242 21 156 27 27 202 73 218 290 57 2 85 159 96 39 191 268 67 64 55 266 29 209 215 85 149 267 161 153 118 293 104 197 91 252 275 56 288 76 82 239 215 105 283 88 76 294 138 166 9 273 14 119 67 101 250 13 63 215 80 5 221 234 258 195 129 67 152 56 277 129 111 98 213 22 209 299", "100 10000000\n285 219 288 277 266 249 297 286 290 266 210 201 275 280 200 272 297 253 246 292 272 285 226 250 297 270 214 251 263 285 237 292 245 225 247 221 263 250 253 280 235 288 278 297 283 294 208 279 227 290 246 208 274 238 282 240 214 277 239 282 255 278 214 292 277 267 290 257 239 234 252 246 217 274 254 249 229 275 210 297 254 215 222 228 262 287 290 292 277 227 292 282 248 278 207 249 236 240 252 216", "100 10000000\n300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300", "99 10000000\n300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300 300", "99 10000000\n299 299 300 300 299 299 300 299 299 299 299 299 299 299 299 300 300 300 299 300 300 300 299 299 299 299 299 299 300 299 299 300 299 299 300 300 300 299 300 300 299 299 300 299 300 300 299 300 299 300 299 300 300 299 299 299 299 299 299 300 299 299 300 300 300 299 300 299 300 300 299 299 299 299 299 299 299 299 300 299 300 300 299 300 300 299 299 300 300 299 300 300 299 300 299 299 300 299 299", "1 1\n5", "1 10000000\n1", "2 1\n1 2", "2 2\n1 2", "2 1000\n1 2", "100 100\n99 100 97 98 95 96 93 94 91 92 89 90 87 88 85 86 83 84 81 82 79 80 77 78 75 76 73 74 71 72 69 70 67 68 65 66 63 64 61 62 59 60 57 58 55 56 53 54 51 52 49 50 47 48 45 46 43 44 41 42 39 40 37 38 35 36 33 34 31 32 29 30 27 28 25 26 23 24 21 22 19 20 17 18 15 16 13 14 11 12 9 10 7 8 5 6 3 4 1 2", "100 82\n151 81 114 37 17 178 92 164 215 108 286 89 108 87 77 166 110 215 212 300 125 92 247 221 78 120 163 113 249 141 36 241 179 116 187 287 69 103 76 80 160 200 249 170 159 72 8 138 171 45 97 271 114 176 54 181 4 259 246 39 29 292 203 49 122 253 99 259 252 74 231 92 43 142 23 144 109 282 47 207 140 212 9 3 255 137 285 146 22 84 52 98 41 21 177 63 217 62 291 64", "99 105\n16 118 246 3 44 149 156 290 44 267 221 123 57 175 233 24 23 120 298 228 119 62 23 183 169 294 195 115 131 157 223 298 77 106 283 117 255 41 17 298 22 176 164 187 214 101 10 181 117 70 271 291 59 156 44 204 140 205 253 176 270 43 188 287 40 250 271 100 244 297 133 228 98 218 290 69 171 66 195 283 63 154 191 66 238 104 32 122 79 190 55 110 276 2 188 26 44 276 230", "99 84\n62 4 145 285 106 132 30 96 211 28 144 190 95 184 227 177 128 60 143 19 19 81 38 83 108 172 241 228 48 39 171 282 233 294 74 271 178 87 24 180 212 190 223 153 230 198 261 232 150 18 190 91 265 61 280 13 207 70 182 117 270 77 242 163 138 212 165 273 247 23 52 88 243 85 293 12 135 284 162 91 174 109 42 19 218 289 9 59 9 117 61 122 78 287 144 176 281 123 243", "99 116\n102 257 115 247 279 111 118 255 198 168 183 184 32 3 36 204 178 186 88 67 205 91 21 40 116 93 2 148 226 65 37 69 69 7 82 205 152 25 34 272 26 283 78 142 17 110 101 250 120 128 145 276 182 57 19 104 228 221 94 220 279 216 220 294 3 289 185 272 73 180 246 107 246 260 219 268 218 41 166 50 230 143 166 158 194 153 256 209 28 255 77 33 143 296 38 81 133 57 263", "99 125\n85 108 102 3 173 193 27 38 288 272 14 270 98 42 34 206 275 54 20 164 207 255 3 196 183 3 61 37 98 223 208 231 144 76 114 19 138 156 157 198 124 39 120 283 34 139 240 240 247 132 211 81 225 12 101 108 63 20 30 158 266 201 101 101 113 157 132 108 41 215 54 27 154 102 175 276 103 35 52 130 10 266 229 202 85 210 116 149 214 14 121 263 217 152 240 275 113 253 53", "99 9\n218 254 64 32 130 52 242 40 29 188 196 300 258 165 110 151 265 142 295 166 141 260 158 218 184 251 180 16 177 125 192 279 201 189 170 37 7 150 117 79 97 13 69 156 254 287 17 214 95 300 150 197 133 161 46 26 82 119 174 6 252 42 264 136 273 127 42 274 113 278 165 173 231 209 159 56 248 39 46 41 222 278 114 84 150 13 63 106 179 279 44 15 13 74 50 168 38 181 127", "100 200\n99 100 97 98 95 96 93 94 91 92 89 90 87 88 85 86 83 84 81 82 79 80 77 78 75 76 73 74 71 72 69 70 67 68 65 66 63 64 61 62 59 60 57 58 55 56 53 54 51 52 49 50 47 48 45 46 43 44 41 42 39 40 37 38 35 36 33 34 31 32 29 30 27 28 25 26 23 24 21 22 19 20 17 18 15 16 13 14 11 12 9 10 7 8 5 6 3 4 1 2", "100 201\n99 100 97 98 95 96 93 94 91 92 89 90 87 88 85 86 83 84 81 82 79 80 77 78 75 76 73 74 71 72 69 70 67 68 65 66 63 64 61 62 59 60 57 58 55 56 53 54 51 52 49 50 47 48 45 46 43 44 41 42 39 40 37 38 35 36 33 34 31 32 29 30 27 28 25 26 23 24 21 22 19 20 17 18 15 16 13 14 11 12 9 10 7 8 5 6 3 4 1 2", "100 199\n99 100 97 98 95 96 93 94 91 92 89 90 87 88 85 86 83 84 81 82 79 80 77 78 75 76 73 74 71 72 69 70 67 68 65 66 63 64 61 62 59 60 57 58 55 56 53 54 51 52 49 50 47 48 45 46 43 44 41 42 39 40 37 38 35 36 33 34 31 32 29 30 27 28 25 26 23 24 21 22 19 20 17 18 15 16 13 14 11 12 9 10 7 8 5 6 3 4 1 2"], "outputs": ["5", "1000", "7546", "12234", "32070", "15919", "2128", "767", "13102", "3845", "27600", "8699", "7366", "10000050", "10000050", "10000065", "10000067", "20000034", "20000033", "10000065", "10000063", "10000066", "10000033", "20000032", "20000034", "20000034", "560000000", "260000004", "40000023", "50000016", "1000000000", "990000000", "580000001", "1", "10000000", "2", "3", "1001", "150", "274", "435", "280", "268", "404", "51", "250", "251", "249"]}

UNKNOWN

PYTHON3

CODEFORCES

5

8b4044b6c20a561a758869590fbe0d05

GukiZ and Binary Operations

We all know that GukiZ often plays with arrays. Now he is thinking about this problem: how many arrays *a*, of length *n*, with non-negative elements strictly less then 2*l* meet the following condition: ? Here operation means bitwise AND (in Pascal it is equivalent to and, in C/C++/Java/Python it is equivalent to &), operation means bitwise OR (in Pascal it is equivalent to , in C/C++/Java/Python it is equivalent to |). Because the answer can be quite large, calculate it modulo *m*. This time GukiZ hasn't come up with solution, and needs you to help him! First and the only line of input contains four integers *n*, *k*, *l*, *m* (2<=≤<=*n*<=≤<=1018, 0<=≤<=*k*<=≤<=1018, 0<=≤<=*l*<=≤<=64, 1<=≤<=*m*<=≤<=109<=+<=7). In the single line print the number of arrays satisfying the condition above modulo *m*. Sample Input 2 1 2 10 2 1 1 3 3 3 2 10 Sample Output 3 1 9

[ "n,k,l,m=map(int,input().split())\nfc={1:1,2:1}\ndef f(n):\n\tif n not in fc: k=n//2;fc[n]=(f(k+1)**2+f(k)**2 if n%2 else f(k)*(2*f(k+1)-f(k)))%m\n\treturn fc[n]\ns=k<2**l\nfor i in range(l): s*=pow(2,n,m)-f(n+2) if (k>>i)%2 else f(n+2)\nprint(s%m)\n" ]

{"inputs": ["2 1 2 10", "2 1 1 3", "3 3 2 10", "5135 42542 15 4354", "21 21 21 21", "2 0 0 5", "1564 153 12 1000000007", "101 102 13 104", "5 6 29 108", "1000000001 1000000002 37 1000000007", "45305640 6540640606 51 5406546", "68706870687 984089409849 59 156465748", "987408898498 1233432432 15 15", "111111111111 111111111111 41 11", "10321324 13213413210 55 1351", "351351354 5464487 64 484848484", "951892365 123481283597 32 123456", "6 0 0 1", "6544433213 3232321 63 2121232", "1000000000000000000 1000000000000000000 64 1000000007", "4 4 4 4", "999999999999999999 999999999999999999 63 3", "14 14 14 1414", "1001 1 0 4", "4 10003242 2 99999991", "32132321412 2132134124 34 2321321", "100 10 10 100", "2 1000000000000000000 64 1", "1000000000000000000 1 64 911", "2 0 1 3", "2 1 63 1000000007", "64 64 64 64", "1114 7 3 1005", "16 16 4 98218222", "9992121323332 32133312321 58 2", "432532 321312 47 32323", "2 1 64 1", "1000000000000000000 1 64 1", "2 1 0 1", "2 0 0 1000000007", "2 0 0 1", "2 0 64 1000000007", "2 1000000000000000000 0 1", "1000000000000000000 1000000000000000000 64 1", "453403154 354134 12 354354", "3461827346 97649324 33 1324157", "987654321 123456789 64 65406468", "467513 453754 15 15555", "61546535 168465146 13 354354", "8894681 35135435 15 1351351", "35413210 444444 44 4444447", "1353513 6545341 54 5454547", "131231231 35435 63 153459", "564654151 123131 38 654654", "131354 1354534 51 1534354", "5165151 3545344 49 354354", "15153153351 21243512 61 534354199", "241531351 230321 59 7412135", "978464816 78484331 42 654534", "165467464 5416516 45 364545697", "2595952145 564654654 64 471571451", "85689952135646564 456465135103154 61 554556465", "13713712721 13458749846 38 546863217", "154165741654 154168764 54 546546", "717273747576 1213141516 59 123456789", "321456987 654789321 50 4564569", "1111111 1212121 21 1212199", "1211199887 77665544 64 123123", "1928374655 1111 25 1231237", "1000000000 100000000077789 58 864405117"], "outputs": ["3", "1", "9", "0", "1", "1", "360373699", "37", "37", "472514342", "891777", "51245777", "0", "0", "1196", "32687413", "0", "0", "1767237", "818137911", "0", "1", "1043", "0", "0", "145556", "0", "0", "868", "0", "529745921", "0", "193", "0", "0", "21923", "0", "0", "0", "1", "0", "767713261", "0", "0", "0", "1172060", "62322669", "0", "0", "0", "2415375", "4341376", "9232", "113542", "319559", "269269", "529706284", "1413850", "234981", "28484610", "25322553", "526174733", "202473723", "347802", "91290627", "4487490", "1058809", "25216", "221684", "21891069"]}

UNKNOWN

PYTHON3

CODEFORCES

1

8b469bd08bc0cbf4598d9a22785da95f

none

Vasilisa the Wise from a far away kingdom got a present from her friend Helga the Wise from a farther away kingdom. The present is a surprise box, yet Vasilisa the Wise doesn't know yet what the surprise actually is because she cannot open the box. She hopes that you can help her in that. The box's lock is constructed like that. The box itself is represented by an absolutely perfect black cube with the identical deepening on each face (those are some foreign nanotechnologies that the far away kingdom scientists haven't dreamt of). The box is accompanied by six gems whose form matches the deepenings in the box's faces. The box can only be opened after it is correctly decorated by the gems, that is, when each deepening contains exactly one gem. Two ways of decorating the box are considered the same if they can be obtained one from the other one by arbitrarily rotating the box (note that the box is represented by a perfect nanotechnological cube) Now Vasilisa the Wise wants to know by the given set of colors the following: in how many ways would she decorate the box in the worst case to open it? To answer this question it is useful to know that two gems of one color are indistinguishable from each other. Help Vasilisa to solve this challenging problem. The first line contains exactly 6 characters without spaces from the set {R, O, Y, G, B, V} — they are the colors of gems with which the box should be decorated. Print the required number of different ways to decorate the box. Sample Input YYYYYY BOOOOB ROYGBV Sample Output 1 2 30

[ "import itertools\n\nclass Cube:\n def __init__(self, v):\n self.s = v\n def rotate_h(self):\n s = self.s\n self.s = s[0:1] + s[2:5] + s[1:2] + s[5:6]\n def rotate_v1(self):\n s = self.s\n self.s = s[1:2] + s[5:6] + s[2:3] + s[0:1] + s[4:5] + s[3:4]\n def rotate_v2(self):\n s = self.s\n self.s = s[2:3] + s[1:2] + s[5:6] + s[3:4] + s[0:1] + s[4:5]\n def get(self):\n return ''.join(self.s)\n\ns = list(input())\nans = 0\nused = set()\nfor v in itertools.permutations(s):\n c = Cube(v)\n tmp = set()\n ok = True\n for i in range(3):\n for j in range(4):\n state = c.get()\n if state in used:\n ok = False\n break\n tmp.add(state)\n c.rotate_h()\n if not ok:\n break\n c.rotate_v1()\n for j in range(4):\n state = c.get()\n if state in used:\n ok = False\n break\n tmp.add(state)\n c.rotate_h()\n if not ok:\n break\n c.rotate_v2()\n if ok:\n ans += 1\n used.update(tmp)\n\nprint(ans)\n\n \t\t \t\t \t \t \t\t\t \t\t\t \t\t \t", "from collections import deque\r\nimport itertools\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 while q:\r\n i = q.popleft()\r\n p1 = [(i // pow6[j]) % 6 for j in range(6)]\r\n for v0 in v:\r\n for _ in range(3):\r\n p1[v0[0]], p1[v0[1]], p1[v0[2]], p1[v0[3]] = p1[v0[1]], p1[v0[2]], p1[v0[3]], p1[v0[0]]\r\n u = 0\r\n for j in range(6):\r\n u += p1[j] * pow6[j]\r\n if not visit[u]:\r\n visit[u] = 1\r\n q.append(u)\r\n return\r\n\r\ns = list(input().rstrip())\r\nd = {\"R\":0, \"O\":1, \"Y\":2, \"G\":3, \"B\":4, \"V\":5}\r\npow6 = [1]\r\nfor _ in range(6):\r\n pow6.append(6 * pow6[-1])\r\np = [d[i] for i in s]\r\nn = pow6[6]\r\nvisit = [0] * n\r\nans = 0\r\nv = [(0, 1, 2, 3), (0, 4, 2, 5), (1, 4, 3, 5)]\r\nfor p0 in itertools.permutations(p):\r\n u = 0\r\n for i in range(6):\r\n u += p0[i] * pow6[i]\r\n if visit[u]:\r\n continue\r\n ans += 1\r\n bfs(u)\r\nprint(ans)", "from collections import defaultdict, Counter\r\nfrom typing import List\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\nfrom functools import lru_cache\r\nfrom itertools import permutations\r\n\r\ns = input()\r\n\r\nans = set()\r\n# 获取s的全排列\r\nfor perm in permutations(s):\r\n # 每个全排列代表色子的6个面的颜色：\r\n # perm[0](上),perm[1](下)\r\n # perm[2](左),perm[3](右)\r\n # perm[4](前),perm[5](后)\r\n # 由于可以经过一定旋转得到相同表示方式，那么这些必有一个独特表示方式（按字典序最小）\r\n # 顶部面有6种可能，确定顶部后那么底部就确定了\r\n # 前面有4种选择，确定前面后后面和侧面（侧面不应该还有两种？错：此时色子涂色方案已确定perm，所以不计算）就确定了\r\n\r\n perm_id = list(perm)\r\n\r\n # 计算每个排列的24种旋转可能，取字典序最小的序列表示当前排列的唯一标识\r\n for i in range(6):\r\n if i == 0:\r\n tmp = [perm[0], perm[1], perm[2], perm[3], perm[4], perm[5]]\r\n # 上下面已确定，现在考虑前面\r\n perm_id = min(perm_id,\r\n [tmp[0], tmp[1], tmp[2], tmp[3], tmp[4], tmp[5]],\r\n # 左->前：前->右，右->后，后->左\r\n [tmp[0], tmp[1], tmp[5], tmp[4], tmp[2], tmp[3]],\r\n # 右->前：前->左，左->后，后->右\r\n [tmp[0], tmp[1], tmp[4], tmp[5], tmp[3], tmp[2]],\r\n # 后<->前：左<->右\r\n [tmp[0], tmp[1], tmp[3], tmp[2], tmp[5], tmp[4]],\r\n )\r\n if i == 1: # 下<->上：前<->后\r\n tmp = [perm[1], perm[0], perm[2], perm[3], perm[5], perm[4]]\r\n # 上下面已确定，现在考虑前面\r\n perm_id = min(perm_id,\r\n [tmp[0], tmp[1], tmp[2], tmp[3], tmp[4], tmp[5]],\r\n # 左->前：前->右，右->后，后->左\r\n [tmp[0], tmp[1], tmp[5], tmp[4], tmp[2], tmp[3]],\r\n # 右->前：前->左，左->后，后->右\r\n [tmp[0], tmp[1], tmp[4], tmp[5], tmp[3], tmp[2]],\r\n # 后<->前：左<->右\r\n [tmp[0], tmp[1], tmp[3], tmp[2], tmp[5], tmp[4]],\r\n )\r\n elif i == 2: # 左->上：上->右，右->下，下->左\r\n tmp = [perm[2], perm[3], perm[1], perm[0], perm[4], perm[5]]\r\n # 上下面已确定，现在考虑前面\r\n perm_id = min(perm_id,\r\n [tmp[0], tmp[1], tmp[2], tmp[3], tmp[4], tmp[5]],\r\n # 左->前：前->右，右->后，后->左\r\n [tmp[0], tmp[1], tmp[5], tmp[4], tmp[2], tmp[3]],\r\n # 右->前：前->左，左->后，后->右\r\n [tmp[0], tmp[1], tmp[4], tmp[5], tmp[3], tmp[2]],\r\n # 后<->前：左<->右\r\n [tmp[0], tmp[1], tmp[3], tmp[2], tmp[5], tmp[4]],\r\n )\r\n elif i == 3: # 右->上：上->左，左->下，下->右\r\n tmp = [perm[3], perm[2], perm[0], perm[1], perm[4], perm[5]]\r\n # 上下面已确定，现在考虑前面\r\n perm_id = min(perm_id,\r\n [tmp[0], tmp[1], tmp[2], tmp[3], tmp[4], tmp[5]],\r\n # 左->前：前->右，右->后，后->左\r\n [tmp[0], tmp[1], tmp[5], tmp[4], tmp[2], tmp[3]],\r\n # 右->前：前->左，左->后，后->右\r\n [tmp[0], tmp[1], tmp[4], tmp[5], tmp[3], tmp[2]],\r\n # 后<->前：左<->右\r\n [tmp[0], tmp[1], tmp[3], tmp[2], tmp[5], tmp[4]],\r\n )\r\n elif i == 4: # 前->上：上->后，后->下，下->前\r\n tmp = [perm[4], perm[5], perm[2], perm[3], perm[1], perm[0]]\r\n # 上下面已确定，现在考虑前面\r\n perm_id = min(perm_id,\r\n [tmp[0], tmp[1], tmp[2], tmp[3], tmp[4], tmp[5]],\r\n # 左->前：前->右，右->后，后->左\r\n [tmp[0], tmp[1], tmp[5], tmp[4], tmp[2], tmp[3]],\r\n # 右->前：前->左，左->后，后->右\r\n [tmp[0], tmp[1], tmp[4], tmp[5], tmp[3], tmp[2]],\r\n # 后<->前：左<->右\r\n [tmp[0], tmp[1], tmp[3], tmp[2], tmp[5], tmp[4]],\r\n )\r\n elif i == 5: # 后->上：上->前，前->下，下->后\r\n tmp = [perm[5], perm[4], perm[2], perm[3], perm[0], perm[1]]\r\n # 上下面已确定，现在考虑前面\r\n perm_id = min(perm_id,\r\n [tmp[0], tmp[1], tmp[2], tmp[3], tmp[4], tmp[5]],\r\n # 左->前：前->右，右->后，后->左\r\n [tmp[0], tmp[1], tmp[5], tmp[4], tmp[2], tmp[3]],\r\n # 右->前：前->左，左->后，后->右\r\n [tmp[0], tmp[1], tmp[4], tmp[5], tmp[3], tmp[2]],\r\n # 后<->前：左<->右\r\n [tmp[0], tmp[1], tmp[3], tmp[2], tmp[5], tmp[4]],\r\n )\r\n ans.add(\"\".join(perm_id))\r\nprint(len(ans))\r\n", "from collections import defaultdict, deque, Counter\r\nfrom sys import stdin, stdout\r\nfrom heapq import heappush, heappop\r\nimport math\r\nimport io\r\nimport os\r\nimport math\r\nimport bisect\r\n\r\n#?############################################################\r\n\r\n\r\ndef isPrime(x):\r\n for i in range(2, x):\r\n if i*i > x:\r\n break\r\n if (x % i == 0):\r\n return False\r\n return True\r\n\r\n#?############################################################\r\n\r\n\r\ndef ncr(n, r, p):\r\n num = den = 1\r\n for i in range(r):\r\n num = (num * (n - i)) % p\r\n den = (den * (i + 1)) % p\r\n return (num * pow(den, p - 2, p)) % p\r\n\r\n\r\n#?############################################################\r\n\r\ndef primeFactors(n):\r\n l = []\r\n while n % 2 == 0:\r\n l.append(2)\r\n n = n / 2\r\n for i in range(3, int(math.sqrt(n))+1, 2):\r\n while n % i == 0:\r\n l.append(int(i))\r\n n = n / i\r\n if n > 2:\r\n l.append(n)\r\n return list(set(l))\r\n\r\n\r\n#?############################################################\r\n\r\ndef power(x, y, p):\r\n res = 1\r\n x = x % p\r\n if (x == 0):\r\n return 0\r\n while (y > 0):\r\n if ((y & 1) == 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\n\r\n\r\ndef sieve(n):\r\n prime = [True for i in range(n+1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n+1, p):\r\n prime[i] = False\r\n p += 1\r\n return prime\r\n\r\n\r\n#?############################################################\r\n\r\ndef digits(n):\r\n c = 0\r\n while (n > 0):\r\n n //= 10\r\n c += 1\r\n return c\r\n\r\n#?############################################################\r\n\r\n\r\ndef ceil(n, x):\r\n if (n % x == 0):\r\n return n//x\r\n return n//x+1\r\n\r\n#?############################################################\r\n\r\n\r\ndef mapin():\r\n return map(int, input().split())\r\n\r\n#?############################################################\r\ndef solve(a):\r\n size = len(a)\r\n max_so_far = 0\r\n max_ending_here = 0\r\n \r\n for i in range(0, size):\r\n max_ending_here = max_ending_here + a[i]\r\n if (max_so_far < max_ending_here):\r\n max_so_far = max_ending_here\r\n \r\n if max_ending_here < 0:\r\n max_ending_here = 0 \r\n return max_so_far\r\n \r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n# python3 15.py<in>op\r\nd = defaultdict(lambda:0) \r\nt = 1\r\nfor _ in range(t):\r\n s = input()\r\n\r\n ans = 0\r\n a2 = 0\r\n for i in s:\r\n d[i]+=1\r\n\r\n d = tuple(sorted(d.values()))\r\n r = {\r\n\t(6,): 1,\r\n\t(1, 5): 1,\r\n\t(2, 4): 2,\r\n\t(1, 1, 4): 2,\r\n\t(3, 3): 2,\r\n\t(1, 2, 3): 3,\r\n\t(1, 1, 1, 3): 5,\r\n\t(2, 2, 2): 6,\r\n\t(1, 1, 2, 2): 8,\r\n\t(1, 1, 1, 1, 2): 15,\r\n\t(1, 1, 1, 1, 1, 1): 30,\r\n }\r\n # print(d)\r\n print(r[d])\r\n ", "try:\r\n import sys\r\n from functools import lru_cache, cmp_to_key\r\n from heapq import merge, heapify, heappop, heappush\r\n from math import *\r\n from collections import defaultdict as dd, deque, Counter as C\r\n from itertools import combinations as comb, permutations as perm\r\n from bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\n from time import perf_counter\r\n from fractions import Fraction\r\n import copy\r\n from copy import deepcopy\r\n import time\r\n starttime = time.time()\r\n mod = int(pow(10, 9) + 7)\r\n mod2 = 998244353\r\n\r\n def data(): return sys.stdin.readline().strip()\r\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\n def L(): return list(sp())\r\n def sl(): return list(ssp())\r\n def sp(): return map(int, data().split())\r\n def ssp(): return map(str, data().split())\r\n def l1d(n, val=0): return [val for i in range(n)]\r\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\n\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n # from sys import stdin\r\n # input = stdin.buffer.readline\r\n # I = lambda : list(map(int,input().split()))\r\n # import sys\r\n # input=sys.stdin.readline\r\n\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\n\r\n\r\n\r\ns=input()\r\ns=sorted(s)\r\ncount=1\r\nans=[]\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)\r\n count=1\r\nans.append(count)\r\nans.sort()\r\nif(len(ans)==1):\r\n print(1)\r\nif(len(ans)==2):\r\n if(ans[0]==1):\r\n print(1)\r\n else:\r\n print(2)\r\nif(len(ans)==3):\r\n if(len(set(ans))==1):\r\n print(6)\r\n elif(ans==[1,1,4]):\r\n print(2)\r\n elif(ans==[1,2,3]):\r\n print(3)\r\nif(len(ans)==4):\r\n if(ans==[1,1,1,3]):\r\n print(5)\r\n elif(ans==[1,1,2,2]):\r\n print(8)\r\nif(len(ans)==6):\r\n print(30)\r\nif(len(ans)==5):\r\n print(15)\r\n \r\n" ]

{"inputs": ["YYYYYY", "BOOOOB", "ROYGBV", "RRRRRR", "BOOOOO", "GOGGVG", "GRBYVO", "BYOVRR", "VOVRBV", "GVGBVO", "BOBGBB", "OOYYBY", "VVRVVV", "YBBVVY", "GYYGGG", "BRRBRB", "OOOOOO", "OVBRYG", "VOBYGO", "VRRYGR", "VOBVYB", "YYYYRB", "RYYYVV", "YYYYYG", "OBORBR", "RRRGRG", "VYYYVV", "YYYYYY", "YROVBG", "RYGOBG", "BGRGGV", "BVRYBV", "RRBYRR", "GGGYYB", "BBBBBY", "RRYYOO", "YYYRRY", "OGGOOG", "GYYBRO", "VORBOR", "RRRGGB", "BBOOYY", "YYBBOO", "OBRRYY", "ROYYGG", "RRGGYY", "RROOYY", "RRYOGB"], "outputs": ["1", "2", "30", "1", "1", "2", "30", "15", "5", "8", "2", "3", "1", "6", "2", "2", "1", "30", "15", "5", "8", "2", "3", "1", "6", "2", "2", "1", "30", "15", "5", "8", "2", "3", "1", "6", "2", "2", "15", "8", "3", "6", "6", "8", "8", "6", "6", "15"]}

UNKNOWN

PYTHON3

CODEFORCES

5

8b794f61bba5cf73f873c4461a6dc912

Processing Queries

In this problem you have to simulate the workflow of one-thread server. There are *n* queries to process, the *i*-th will be received at moment *t**i* and needs to be processed for *d**i* units of time. All *t**i* are guaranteed to be distinct. When a query appears server may react in three possible ways: 1. If server is free and query queue is empty, then server immediately starts to process this query. 1. If server is busy and there are less than *b* queries in the queue, then new query is added to the end of the queue. 1. If server is busy and there are already *b* queries pending in the queue, then new query is just rejected and will never be processed. As soon as server finished to process some query, it picks new one from the queue (if it's not empty, of course). If a new query comes at some moment *x*, and the server finishes to process another query at exactly the same moment, we consider that first query is picked from the queue and only then new query appears. For each query find the moment when the server will finish to process it or print -1 if this query will be rejected. The first line of the input contains two integers *n* and *b* (1<=≤<=*n*,<=*b*<=≤<=200<=000) — the number of queries and the maximum possible size of the query queue. Then follow *n* lines with queries descriptions (in chronological order). Each description consists of two integers *t**i* and *d**i* (1<=≤<=*t**i*,<=*d**i*<=≤<=109), where *t**i* is the moment of time when the *i*-th query appears and *d**i* is the time server needs to process it. It is guaranteed that *t**i*<=-<=1<=<<=*t**i* for all *i*<=><=1. Print the sequence of *n* integers *e*1,<=*e*2,<=...,<=*e**n*, where *e**i* is the moment the server will finish to process the *i*-th query (queries are numbered in the order they appear in the input) or <=-<=1 if the corresponding query will be rejected. Sample Input 5 1 2 9 4 8 10 9 15 2 19 1 4 1 2 8 4 8 10 9 15 2 Sample Output 11 19 -1 21 22 10 18 27 -1

[ "n, b = [int(i) for i in input().split()]\r\nq = [0] * n\r\nbg = 0\r\nen = 0\r\ntime = 0\r\nres = [-1] * n\r\nfor it in range(n):\r\n ev = [int(i) for i in input().split()]\r\n ev.append(it)\r\n while bg < en and max(time, q[bg][0]) <= ev[0]:\r\n time = max(time, q[bg][0])\r\n res[q[bg][2]] = time + q[bg][1]\r\n time += q[bg][1]\r\n bg += 1\r\n if en - bg < b:\r\n q[en] = ev\r\n en += 1\r\n \r\nwhile bg < en:\r\n time = max(time, q[bg][0])\r\n res[q[bg][2]] = time + q[bg][1]\r\n time += q[bg][1]\r\n bg += 1\r\n\r\nfor i in range(n):\r\n print(res[i], end=' ')\r\n", "import queue\r\n\r\n\r\nclass Task():\r\n def __init__(self, t, d, f):\r\n self.t = t\r\n self.d = d\r\n self.f = f\r\n\r\n\r\nn, b = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n a.append(Task(t, d, 0))\r\n\r\nq = queue.Queue()\r\n\r\nnow = a[0].t + a[0].d\r\na[0].f = now\r\nq.put(now)\r\ni = 1\r\n\r\nwhile i < n:\r\n task = a[i]\r\n while q.qsize() > 0 and task.t >= q.queue[0]:\r\n q.get()\r\n\r\n if q.qsize() > b:\r\n task.f = -1\r\n else:\r\n now = max(task.t, now)\r\n now += task.d\r\n task.f = now\r\n q.put(now)\r\n i += 1\r\n\r\nfor i in range(n):\r\n print(a[i].f, end=' ')\r\n\r\n\r\n", "# LEFT = \"left\"\r\n# RIGHT = \"right\"\r\n# side_start = [LEFT,RIGHT]\r\n# C = int(input())\r\n#\r\n#\r\n# for case in range(C):\r\n# NTM = [int(x) for x in input().split()]\r\n# N = NTM[0]\r\n# T = NTM[1]\r\n# M = NTM[2]\r\n# m_lines = []\r\n# left = []\r\n# right = []\r\n# for line in range(M):\r\n# arrive_time_cside = input().split()\r\n# arrivetime = int(arrive_time_cside[0])\r\n# side_come = arrive_time_cside[1]\r\n# if side_come ==LEFT:\r\n# left.append([arrivetime,side_come])\r\n# else:\r\n# right.append([arrivetime,side_come])\r\n# left.reverse()\r\n# right.reverse()\r\n#\r\n# if not right or (left and left[-1][0] < right[-1][0]):#first left has car\r\n# start = 0\r\n# curr = max(left[-1][0],T)\r\n# takeL = []\r\n# takR = []\r\n# while left or right:\r\n# side = side_start[start]\r\n# tmp =[]\r\n# while left and left[-1][0] <= curr and left[-1][1] == side:\r\n# if len(tmp)<N:\r\n# tmp.append([left.pop(),curr+T])\r\n# else:break\r\n# takeL.extend(tmp)\r\n# curr += T\r\n# next_min = 1000001\r\n# if left:\r\n# next_min = min(left[-1][0],next_min)\r\n# if right:\r\n# next_min = min(right[-1][0],next_min)\r\n# if next_min > curr:\r\n# curr = next_min\r\n# start = 1 - start\r\n# side = side_start[start]\r\n# tmp = []\r\n# while right and right[-1][0] <= curr and right[-1][1] == side:\r\n# if len(tmp) < N:\r\n# tmp.append([right.pop(),curr+T])\r\n# else:\r\n# break\r\n# takR.extend(tmp)\r\n# start = 1-start\r\n# curr+=T\r\n# next_min = 1000001\r\n# if left:\r\n# next_min = min(left[-1][0], next_min)\r\n# if right:\r\n# next_min = min(right[-1][0], next_min)\r\n# if next_min > curr:\r\n# curr = next_min\r\n# pt1 = 0\r\n# pt2 = 0\r\n# take = []\r\n# while pt1 < len(takeL) and pt2 < len(takR):\r\n# if takeL[pt1][0][0] < takR[pt2][0][0]:\r\n# take.append(takeL[pt1][1])\r\n# pt1 +=1\r\n# else:\r\n# take.append(takR[pt2][1])\r\n# pt2 += 1\r\n# while pt1 < len(takeL):\r\n# take.append(takeL[pt1][1])\r\n# pt1 += 1\r\n# while pt2 < len(takR):\r\n# take.append(takR[pt2][1])\r\n# pt2 += 1\r\n# for e in take:\r\n# print(e)\r\n# else:\r\n# start = 1\r\n# curr = right[-1][0]+T\r\n# takeL = []\r\n# takR = []\r\n# take = []\r\n# while left or right:\r\n# side = side_start[start]\r\n# tmp = []\r\n# while right and right[-1][0] <= curr and right[-1][1] == side:\r\n# if len(tmp) < N:\r\n# tmp.append([right.pop(),curr+T])\r\n# else:\r\n# break\r\n# takR.extend(tmp)\r\n# start = 1 - start\r\n# curr += T\r\n# next_min = 1000001\r\n# if left:\r\n# next_min = min(left[-1][0], next_min)\r\n# if right:\r\n# next_min = min(right[-1][0], next_min)\r\n# if next_min > curr:\r\n# curr = next_min\r\n# start = 1 - start\r\n# side = side_start[start]\r\n# tmp = []\r\n# while left and left[-1][0] <= curr and left[-1][1] == side:\r\n# if len(tmp) < N:\r\n# tmp.append([left.pop(),curr+T])\r\n# else:\r\n# break\r\n# takeL.extend(tmp)\r\n# curr += T\r\n# next_min = 1000001\r\n# if left:\r\n# next_min = min(left[-1][0], next_min)\r\n# if right:\r\n# next_min = min(right[-1][0], next_min)\r\n# if next_min > curr:\r\n# curr = next_min\r\n# start = 1 - start\r\n# side = side_start[start]\r\n# tmp = []\r\n#\r\n# pt1 = 0\r\n# pt2 = 0\r\n# while pt1 < len(takeL) and pt2 < len(takR):\r\n# if takeL[pt1][0][0] < takR[pt2][0][0]:\r\n# take.append(takeL[pt1][1])\r\n# pt1 += 1\r\n# else:\r\n# take.append(takR[pt2][1])\r\n# pt2 += 1\r\n# while pt1 < len(takeL):\r\n# take.append(takeL[pt1][1])\r\n# pt1 += 1\r\n# while pt2 < len(takR):\r\n# take.append(takR[pt2][1])\r\n# pt2 += 1\r\n# for e in take:\r\n# print(e)\r\n# # come back\r\n#\r\n# from collections import deque\r\n# NB = [int(x) for x in input().split(\" \")]\r\n# N = NB[0]\r\n# B = NB[1]\r\n# backages = deque()\r\n# for i in range(N):\r\n# TD= [int(x) for x in input().split(\" \")]\r\n# backages.appendleft([i,TD[0],TD[1]])#index,push into queue time, how long is process\r\n# result = [0]*N\r\n# currT = 0\r\n# bags = deque()\r\n# print(backages)\r\n# while backages:\r\n# currT +=1\r\n# if currT==backages[-1][1]:\r\n# bags.appendleft(backages.pop())\r\n# if len(bags)>B+1:\r\n# query = bags.popleft()\r\n# result[query[0]]=-1\r\n# if bags and currT == bags[-1][1]+bags[-1][2]:\r\n# q_done = bags.pop()\r\n# result[q_done[0]] = q_done[1]+q_done[2]\r\n# bags[-1][1] = currT\r\n# print(result)\r\n# Processing Queries.py\r\n\r\nfrom collections import *\r\n\r\nn, b = map(int, input().split(\" \"));\r\narr = deque();\r\ncount = 0;\r\nresult = []\r\nfor i in range(n):\r\n t, d = map(int, input().split(\" \"));\r\n while arr and arr[0] <= t:\r\n arr.popleft();\r\n count -= 1;\r\n if count <= b:\r\n if len(arr) > 0:\r\n t = max(arr[-1], t);\r\n y = d + t\r\n result.append(y)\r\n arr.append(y);\r\n count += 1;\r\n else:\r\n result.append(- 1)\r\nprint(\" \".join([str(x) for x in result]))", "\nfrom queue import Queue\n\n\nif __name__ == '__main__':\n n, b = list(map(int, input().split()))\n q = Queue()\n next_avail = 0\n task_list = []\n for i in range(n):\n t, d = list(map(int, input().split()))\n task = [t, d, 0]\n task_list.append(task)\n \n start = 0\n t0, d0, f0 = task_list[0]\n next_avail = t0 + d0 \n task_list[0][2] = next_avail\n \n q.put(next_avail)\n \n for i in range(1, n):\n temp_task = task_list[i]\n while (q.qsize() > 0) and (temp_task[0] >= q.queue[0]):\n q.get()\n \n if next_avail <= temp_task[0]:\n next_avail = temp_task[0] + temp_task[1]\n temp_task[2] = next_avail\n q.put(next_avail)\n else:\n if q.qsize() > b:\n temp_task[2] = -1\n else:\n next_avail += temp_task[1]\n temp_task[2] = next_avail\n q.put(next_avail)\n \n \n for t in task_list:\n print(t[2], end=\" \")", "n, b = map(int, input().split())\r\ntime = 0\r\nqueue = []\r\nfor i in range(n):\r\n t,d = map(int, input().split())\r\n while len(queue) != 0 and t >= queue[0]:\r\n queue.pop(0)\r\n if len(queue) <= b:\r\n time = max(t, time) + d\r\n queue.append(time)\r\n print(time, end = \" \")\r\n else: print(-1, end = \" \")", "# from dust i have come, dust i will be\r\n\r\nimport queue\r\n\r\nn, m = map(int, input().split())\r\n\r\nclass Task:\r\n def __init__(self, t, d):\r\n self.t = t\r\n self.d = d\r\n self.f = 0\r\n\r\na = [None]*n\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n a[i] = Task(t, d)\r\n\r\nq = queue.Queue()\r\n\r\ns = 0\r\nt = a[0].t + a[0].d\r\na[0].f = t\r\nq.put(t)\r\n\r\nfor i in range(1, n):\r\n while not q.empty() and a[i].t >= q.queue[0]:\r\n q.get()\r\n\r\n if t <= a[i].t:\r\n t = a[i].t + a[i].d\r\n a[i].f = t\r\n q.put(t)\r\n\r\n else:\r\n if q.qsize() > m:\r\n a[i].f = -1\r\n\r\n else:\r\n t += a[i].d\r\n a[i].f = t\r\n q.put(t)\r\n\r\nfor i in range(n):\r\n print(a[i].f, end=\" \")\r\n", "from collections import deque\nn, b = [int(x) for x in input().split()]\nD = deque()\ntime = [-1] * n\nT = 0\nfor i in range(n):\n t, d = [int(x) for x in input().split()]\n while D and T + D[0][0] <= t:\n T += D[0][0]\n time[D[0][1]] = T\n D.popleft()\n if len(D) == 0:\n T = t\n if len(D) <= b:\n D.append((d, i))\n\nimport math\nt = float('inf')\nwhile D and T + D[0][0] <= t:\n T += D[0][0]\n time[D[0][1]] = T\n D.popleft()\n\nfor t in time:\n print(t, end = ' ')\n\n \n \n", "import queue\n\nclass Scanner:\n import sys\n def __init__(self, istream = sys.stdin):\n self.tokenizer = Scanner.__tokenizer__(istream)\n def __tokenizer__(istream):\n for line in istream:\n for token in line.strip().split():\n yield token\n while True:\n yield None\n def next(self, type = str, rep = 1):\n if rep == 1:\n return type(self.tokenizer.__next__())\n return [type(self.tokenizer.__next__()) for i in range(rep)]\n\nsc = Scanner()\nn, b = sc.next(int, 2)\nq = queue.Queue()\nprocessing = 0\n\nfor _ in range(n):\n t, d = sc.next(int, 2)\n\n while not q.empty() and q.queue[0] <= t:\n q.get()\n \n if q.qsize() <= b:\n processing = max(processing, t) + d\n print(processing, end=' ')\n q.put(processing)\n else:\n print(-1, end=' ')", "n, queue_size = map(lambda x: int(x), input().split())\n\nresults = [-1 for _ in range(n)]\n\nnext_server_free_time = 1\nqueue = []\nfor idx in range(n):\n t, d = map(lambda x: int(x), input().split())\n\n while queue and next_server_free_time <= t:\n idx1, d1 = queue.pop(0)\n next_server_free_time += d1\n results[idx1] = next_server_free_time\n\n if next_server_free_time <= t:\n results[idx] = t + d\n next_server_free_time = t + d\n else:\n if len(queue) < queue_size:\n queue.append((idx, d))\n\nwhile queue:\n idx, d = queue.pop(0)\n next_server_free_time += d\n results[idx] = next_server_free_time\n\nprint(' '.join(map(lambda x: str(x), results)))\n", "import queue\r\n\r\nif __name__ == \"__main__\":\r\n n, b = map(int, input().split())\r\n q = queue.Queue()\r\n time = 0\r\n for i in range(n):\r\n t, d = map(int, input().split())\r\n while q.qsize() and q.queue[0] <= t:\r\n q.get()\r\n if q.empty():\r\n time = t\r\n if q.qsize() <= b:\r\n time += d\r\n q.put(time)\r\n print(time, end = \" \")\r\n else:\r\n print(-1, end = \" \")", "import queue\r\n\r\nclass Query:\r\n def __init__(self, _id, _appearTime, _processTime):\r\n self.id = _id\r\n self.appearTime = _appearTime\r\n self.processTime = _processTime\r\n\r\nq = queue.Queue()\r\nn, b = map(int, input().split())\r\ncurTime = 0\r\nres = [0] * (n + 10)\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n if t < curTime:\r\n if (q.qsize() == b):\r\n res[i] = -1\r\n continue\r\n q.put(Query(i, t, d))\r\n else:\r\n q.put(Query(i, t, d))\r\n while t >= curTime and (not q.empty()):\r\n query = q.get()\r\n #print(query.id, query.appearTime, query.processTime)\r\n curTime = max(curTime, query.appearTime)\r\n curTime = curTime + query.processTime\r\n res[query.id] = curTime\r\n #print(i, curTime)\r\n \r\n \r\nwhile not q.empty():\r\n query = q.get()\r\n #print(query)\r\n curTime = max(curTime, query.appearTime)\r\n curTime = curTime + query.processTime\r\n res[query.id] = curTime\r\n\r\nfor i in range(n): \r\n print(res[i])\r\n\r\n\r\n", "from collections import deque\n\nn, b = map(int, input().split())\nq = deque()\nprocessing = 0\n\nfor _ in range(n):\n t, d = map(int, input().split())\n\n while q and t >= q[0]:\n q.popleft()\n\n if len(q) <= b:\n processing = max(t, processing) + d\n q.append(processing)\n print(processing, end=' ')\n else:\n print(-1, end=' ')\n", "import queue\n\nn, b = map(int, input().split())\n\nq = queue.Queue()\ntime = 0\n\nfor i in range(n):\n t, d = map(int, input().split())\n\n while q.empty() == False and q.queue[0] <= t:\n q.get()\n\n if q.empty():\n time = t\n \n if q.qsize() <= b:\n time += d\n q.put(time)\n print(time, end=\" \")\n else:\n print(-1, end=\" \")", "def processQueries():\n n_k = input().split()\n n = int(n_k[0])\n k = int(n_k[1])\n\n lst_queries = []\n for i in range(n):\n s_t = input().split()\n lst_queries.append((int(s_t[0]), int(s_t[1])))\n\n queue_queries = []\n res = [-1] * n\n time = lst_queries[0][0]\n current = None\n i = 0\n while i < n or len(queue_queries) > 0:\n index = 0\n if len(queue_queries) > 0:\n i_current = queue_queries.pop(0)\n index = i_current[0]\n current = i_current[1]\n else:\n current = lst_queries[i]\n index = i\n i += 1\n # process current\n time = max(time, current[0]) + current[1]\n res[index] = time\n # update queue\n for j in range(i, n):\n if time > lst_queries[j][0]:\n if len(queue_queries) < k:\n queue_queries.append((j,lst_queries[j]))\n i += 1\n else:\n break\n return res\n\n\nres = processQueries()\nprint(' '.join(map(str, res)))\n", "import collections \r\nnb = list(map(int, input().split()))\r\n\r\nn = nb[0]\r\nb = nb[1]\r\nqueries = collections.deque()\r\nfor i in range(n):\r\n td = list(map(int, input().split()))\r\n queries.append((td[0], td[1], i))\r\n\r\nanswer = [0] * n\r\nprocessed = []\r\n# answer[0] = processed[-1][-1]\r\nqueue = collections.deque()\r\n\r\nnext_available = 0\r\ni = 0\r\ncnt = 0\r\n# significant events: a process \"requests\" to join queue, a process gets out of queue and is processed\r\nwhile cnt != n:\r\n # we are at cur_time\r\n # event: process joins queue --> may or may not happen\r\n # event: starts process\r\n # event: end process\r\n # at each event: there are two works to do\r\n # 1. eject one process in queue\r\n # 2. accept/reject any \"queue join requests\"\r\n \r\n # if queue is empty:\r\n # fast forward to next process\r\n # put that process into queue\r\n # reasoning: queue is currently empty, we don't lose anything if we just put process into queue\r\n # it gets popped out immediately later anyway\r\n # continue\r\n # else queue is not empty:\r\n # pop first process --> fast forward until done process\r\n # admit any process requesting to join queue:\r\n # while (next_process.time <= cur_time): admit into queue if possible\r\n if not queue:\r\n start, cost, i = queries.popleft()\r\n queue.append((start, cost, i))\r\n continue\r\n else:\r\n first_in_line_start, first_in_line_cost, cur_i = queue.popleft()\r\n next_available = max(next_available, first_in_line_start) + first_in_line_cost\r\n answer[cur_i] = next_available\r\n #print(cur_i)\r\n #print(next_available)\r\n #print(queue)\r\n #print(queries)\r\n cnt += 1\r\n while queries and queries[0][0] < next_available:\r\n if len(queue) >= b:\r\n f1, f2, cur_i = queries.popleft()\r\n answer[cur_i] = -1\r\n cnt += 1\r\n else:\r\n queue.append(queries.popleft())\r\nprint(*answer)\r\n", "n,b = map(int,input().split())\r\nq= []\r\nans = 0\r\nfor i in range(n):\r\n t,d = map(int,input().split())\r\n while len(q) != 0 and q[0] <= t:\r\n q.pop(0)\r\n if len(q) <= b:\r\n ans = max(ans,t)+d\r\n print(ans,end=\" \")\r\n q.append(ans)\r\n else:\r\n print(-1,end=\" \")", "n, b = [int(item) for item in input().split()]\r\n\r\nqueue = []\r\n\r\nfor i in range(n):\r\n ti, di =[int(item) for item in input().split()]\r\n while len(queue) > 0 and queue[0] <= ti:\r\n queue.pop(0)\r\n if len(queue) - 1 == b:\r\n print(-1, end=' ')\r\n continue\r\n if not queue:queue.append(ti + di)\r\n else:queue.append(queue[-1] + di)\r\n\r\n print(queue[-1], end = \" \")", "import queue\r\nn, b = map(int, input().split())\r\nt = []\r\nd = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n t.append(x)\r\n d.append(y)\r\nq = queue.Queue()\r\ncurTime = 0\r\nans = [-1]*n\r\n\r\nfor i in range(n):\r\n while (q.qsize() > 0 and curTime <= t[i]):\r\n query = q.get()\r\n curTime += d[query]\r\n ans[query] = curTime\r\n curTime = max(curTime, t[i])\r\n if (q.qsize() >= b):\r\n ans[i] = -1\r\n else:\r\n q.put(i)\r\n\r\nwhile (not q.empty()):\r\n query = q.get()\r\n curTime += d[query]\r\n ans[query] = curTime\r\n\r\nfor v in ans:\r\n print(\"{} \".format(v), end=\"\")\r\n\r\n", "import queue\r\n\r\nq = queue.Queue()\r\nans = [0] * 200000\r\nn, b = map(int, input().split())\r\ntmp = 0\r\nans[0] = tmp\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n while q.empty() == False and q.queue[0] <= t:\r\n q.get()\r\n if q.qsize() > b:\r\n ans[i] = -1\r\n else:\r\n tmp = max(tmp, t) + d\r\n ans[i] = tmp\r\n q.put(tmp)\r\nfor i in range(n):\r\n print(ans[i], end = ' ')", "import sys\r\n#input = sys.stdin.readline\r\n\r\nq = []\r\nn,b = map(int,input().split())\r\nt = 0\r\nd = 0\r\nfor i in range(0,n):\r\n t,d = map(int,input().split())\r\n while (len(q)!=0):\r\n if(q[0]<=t):\r\n q.pop(0)\r\n else:\r\n break\r\n if(len(q) <= b):\r\n if(len(q)!=0):\r\n t = q[-1]\r\n t = t + d\r\n print(t,end = ' ')\r\n q.append(t)\r\n else:\r\n print(-1,end = ' ')", "n, maxq = map(int, input().split())\r\n\r\nfrom collections import deque\r\n\r\nmess = []\r\nqueue = deque()\r\n\r\n\r\nfor i in range(n):\r\n time, duration = map(int, input().split())\r\n\r\n while queue and queue[0] <= time:\r\n queue.popleft()\r\n if not queue:\r\n queue.append(time + duration)\r\n mess.append(time + duration)\r\n continue\r\n else:\r\n if len(queue) <= maxq:\r\n queue.append(queue[-1] + duration)\r\n mess.append(queue[-1])\r\n else:\r\n mess.append(-1)\r\n\r\nprint(' '.join(map(str, mess)))\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n, b = map(int, input().split())\r\nq = []\r\nl = 0\r\nr = 0\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n while l != r:\r\n if q[l] <= t:\r\n l += 1\r\n else:\r\n break\r\n len_queue = r - l - 1 \r\n if len_queue >= b:\r\n print(-1, end = ' ')\r\n else:\r\n if l == r:\r\n q.append(t + d)\r\n else:\r\n q.append(q[-1] + d)\r\n r += 1\r\n print(q[-1])", "class Query:\r\n\tdef __init__(self, id, t_toi, t_tt):\r\n\t\tself.id = id\r\n\t\tself.t_toi = t_toi\r\n\t\tself.t_tt = t_tt\r\n\r\nimport queue\r\n\r\nn, b = map(int, input().split())\r\nq = queue.Queue()\r\n\r\nt_process = 0\r\n\r\nans = [0]*n\r\n\r\nfor i in range(n):\r\n\tt_toi, t_tt = map(int, input().split())\r\n\twhile q.qsize() > 0 and t_toi >= t_process:\r\n\t\tfront = q.get()\r\n\t\tt_process += front.t_tt\r\n\t\tans[front.id] = t_process\r\n\tif t_toi > t_process:\r\n\t\tt_process = t_toi + t_tt\r\n\t\tans[i] = t_process\r\n\telif q.qsize() < b:\r\n\t\tq.put(Query(i, t_toi, t_tt))\r\n\telse:\r\n\t\tans[i] = -1\r\n\r\nwhile q.qsize() > 0:\r\n\tfront = q.get()\r\n\tt_process += front.t_tt\r\n\tans[front.id] = t_process\r\n\r\nfor i in ans:\r\n\tprint(i,end=\" \")\r\n", "from collections import deque\r\nn, b = map(int,input().split())\r\nq = deque()\r\nans = []\r\nfor i in range(n):\r\n ti, di = map(int,input().split())\r\n while q and ti >= q[0]:\r\n q.popleft()\r\n if len(q) > b:\r\n ans.append(-1)\r\n elif q:\r\n ans.append(q[-1]+di)\r\n q.append(q[-1]+di)\r\n else:\r\n ans.append(ti+di)\r\n q.append(ti+di)\r\nprint(*ans)", "import queue\nclass query:\n def __init__(self, id, t, d):\n self.id = id\n self.t = t\n self.d = d\n\n\nq = queue.Queue()\nres = 0\nh = 0\ntam = 0\nn, mq = map(int, input().split())\nx = []\nfor i in range(n):\n t, d = map(int, input().split())\n x.append((t,d))\na =[-1]*n\nq.put(query(0, x[0][0], x[0][1]))\nk = 0\ni = 1\nwhile q.qsize() != 0:\n res = max(res, q.queue[0].t) + (q.queue[0].d)\n a[q.queue[0].id] = res\n q.get()\n while i < n and q.qsize() < mq:\n q.put(query(i, x[i][0], x[i][1]))\n i += 1\n while i < n and res > x[i][0]:\n i += 1\n k += 1\n\nfor i in a:\n print(i, end = ' ')\n \t \t\t \t\t \t \t\t\t\t \t\t \t \t\t", "n, m = map(int, input().split())\r\n\r\nq = []\r\ntime_free = 0\r\nresult = []\r\nfor _ in range(n):\r\n s, t = map(int, input().split())\r\n\r\n while q and q[0] <= s:\r\n q = q[1:]\r\n\r\n if s < time_free:\r\n if len(q) == m:\r\n result.append(-1)\r\n else:\r\n q.append(time_free)\r\n time_free += t\r\n result.append(time_free)\r\n else:\r\n time_free = max(time_free, s) + t\r\n result.append(time_free)\r\n\r\n\r\nfor time in result:\r\n print(time, end=\" \")\r\n", "def main():\r\n n, b = map(int, input().split())\r\n\r\n def endgen():\r\n res = [0]\r\n q = 0\r\n\r\n for _ in range(n):\r\n t, d = map(int, input().split())\r\n res.append(t + d if t > res[-1] else res[-1] + d)\r\n\r\n while res[q] <= t:\r\n q += 1\r\n\r\n if len(res) - q - 1 > b:\r\n res.pop()\r\n yield \"-1\"\r\n else:\r\n yield str(res[-1])\r\n\r\n print(' '.join(endgen()))\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from sys import maxsize as m\r\nfrom itertools import product as P \r\nclass Solution:\r\n def bazinga(self,N,p):\r\n pass \r\n\r\nif __name__=='__main__':\r\n n,b = map(int,input().split(' '))\r\n ct,pt,lpt,cb = 0,0,[],0\r\n result = []\r\n for i in range(n):\r\n ti,di = map(int,input().split())\r\n #print(pt,lpt,'--',ti,di,cb)\r\n res = 0\r\n if pt==0:\r\n pt+= ti+di\r\n lpt += [pt]\r\n res = pt\r\n else:\r\n if ti<lpt[0]:\r\n if cb<b:\r\n pt+= di\r\n lpt+=[pt]\r\n res = pt\r\n cb+=1\r\n elif cb>=b:\r\n res = -1\r\n \r\n elif ti>=lpt[0]:\r\n #print(lpt,pt,ti,di)\r\n if ti>lpt[-1]:\r\n pt+=abs(lpt[-1]-ti)+di\r\n else: pt+=di\r\n lpt+=[pt]\r\n res = pt\r\n cb+=1\r\n while ti>=lpt[0]:\r\n if len(lpt)==1: break\r\n lpt.pop(0)\r\n if cb>0: cb-=1\r\n \r\n result += (str(res),)\r\n print(' '.join(result))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \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 heapq\r\n\r\nclass Query:\r\n def __init__(self, start_time, finish_time):\r\n self.start_time = start_time\r\n self.finish_time = finish_time\r\n\r\n def __lt__(self, other):\r\n return self.finish_time < other.finish_time\r\n\r\nn, b = map(int, input().split())\r\nquery_queue = []\r\ntime = 0\r\n\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n \r\n # remove completed queries\r\n while query_queue and query_queue[0].finish_time <= t:\r\n heapq.heappop(query_queue)\r\n \r\n # check if the server is busy\r\n if len(query_queue) < b+1:\r\n if time <= t:\r\n time = t\r\n heapq.heappush(query_queue, Query(time, time + d))\r\n print(time + d, end=' ')\r\n time += d\r\n else:\r\n print(\"-1\", end=' ')\r\n", "def main():\n n, hi = map(int, input().split())\n l, res, lo, hi = [0], [], 0, -hi\n f, p = res.append, l.append\n for _ in range(n):\n t, d = map(int, input().split())\n d += t if t > l[-1] else l[-1]\n while lo <= hi and l[lo] <= t:\n lo += 1\n if hi >= lo:\n f(\"-1\")\n else:\n hi += 1\n p(d)\n f(d)\n print(' '.join(map(str, res)))\n\n\nif __name__ == '__main__':\n main()\n", "import os\r\ns = input().split(' ')\r\nn = int(s[0])\r\nb = int(s[1])\r\n\r\nrequests = [[]] * n\r\n\r\nfor i in range(n):\r\n s = input().split(' ')\r\n requests[i] = [int(s[0]), int(s[1])]\r\n\r\nresult = [0] * n\r\ncounter = 1\r\ntime = 0\r\nqueue = []\r\n\r\ntime = requests[0][0]\r\n\r\nqueue = [[0, requests[0][1]]]\r\n\r\nwhile(counter < n):\r\n if(len(queue) != 0):\r\n if(queue[0][1] <= requests[counter][0] - time):\r\n time += queue[0][1]\r\n result[queue[0][0]] = str(time)\r\n queue = queue[1:]\r\n else:\r\n queue[0][1] -= requests[counter][0] - time\r\n time = requests[counter][0]\r\n if(len(queue) < b + 1):\r\n queue += [[counter, requests[counter][1]]]\r\n else:\r\n result[counter] = '-1'\r\n counter += 1\r\n else:\r\n time = requests[counter][0]\r\n queue += [[counter, requests[counter][1]]]\r\n counter += 1\r\n\r\nfor i in range(len(queue)):\r\n time += queue[i][1]\r\n result[queue[i][0]] = time\r\n\r\nprint()\r\ns = ''\r\nfor i in range(len(result)):\r\n s += str(result[i]) + ' '\r\nprint(s)", "\r\nimport queue\r\n\r\nn, b = map(int, input().split())\r\nresult = [0] * n\r\nlast_processing = 0\r\nwaiting_queue = queue.Queue()\r\nfor i in range(n):\r\n ti, di = map(int, input().split())\r\n while waiting_queue.qsize() > 0 and last_processing <= ti:\r\n last_processing = max(last_processing, waiting_queue.queue[0]['time']) + waiting_queue.queue[0]['take_time']\r\n result[waiting_queue.queue[0]['index']] = last_processing\r\n waiting_queue.get()\r\n if waiting_queue.qsize() < b:\r\n waiting_queue.put({'index': i, 'time': ti, 'take_time': di})\r\n else:\r\n result[i] = -1\r\n\r\nwhile waiting_queue.qsize() > 0:\r\n last_processing = max(last_processing, waiting_queue.queue[0]['time']) + waiting_queue.queue[0]['take_time']\r\n result[waiting_queue.queue[0]['index']] = last_processing\r\n waiting_queue.get()\r\nprint(*result, sep=' ')\r\n", "from collections import deque\r\nwhile True:\r\n\ttry:\r\n\t\tn, max_queue_lenth = map(int, input().split())\r\n\texcept EOFError:\r\n\t\tbreak\r\n\r\n\tqueue = deque()\r\n\tresponses = []\r\n\tfor i in range(n):\r\n\t\ttime, duration = tuple(map(int, input().split()))\r\n\t\twhile queue and queue[0]<=time:\r\n\t\t\tqueue.popleft()\r\n\t\tif not queue:\r\n\t\t\tqueue.append(time+duration)\r\n\t\t\tresponses.append(time+duration)\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tif len(queue)<=max_queue_lenth:\r\n\t\t\t\tqueue.append(queue[-1]+duration)\r\n\t\t\t\tresponses.append(queue[-1])\r\n\t\t\telse:\r\n\t\t\t\tresponses.append(-1)\r\n\tprint(\" \".join(map(str, responses)))", "#! /usr/bin/env python3\n'''\n' Title:\t\n' Author:\tCheng-Shih, Wong\n' Date:\t\t\n'''\nfrom collections import deque\n\nn, b = map(int, input().split())\n\nquery = {}\ntm = []\nque = deque()\nans = {}\n\nfor i in range(n):\n\tu, v = map(int, input().split())\n\tquery[u] = v\n\ttm.append(u)\n\net = 0\n\nfor ti in tm:\n\twhile ti>et and len(que)>0:\n\t\tcur = que.popleft()\n\t\tet += query[cur]\n\t\tans[cur] = et\n\n\tif ti>et:\n\t\tet = ti+query[ti]\n\t\tans[ti] = et\n\telif ti==et:\n\t\tif len(que) > 0:\n\t\t\tcur = que.popleft()\n\t\t\tet = ti+query[cur]\n\t\t\tans[cur] = et\n\t\tque.append(ti)\n\telse:\n\t\tif len(que) >= b:\n\t\t\tans[ti] = -1\n\t\telse:\n\t\t\tque.append(ti)\n\nwhile len(que)>0:\n\tcur = que.popleft()\n\tet += query[cur]\n\tans[cur] = et\n\nouts = ''\nspace = False\n\nfor ti in tm:\n\tif space: outs += ' '\n\telse: space = True\n\touts += str(ans[ti])\n\nprint(outs)\n\t\t\n", "import queue\r\ndef processing_queries(n,b,q):\r\n result=[]\r\n finished=q[0][0]+q[0][1]\r\n result.append(finished)\r\n queries=queue.Queue()\r\n queries.put(finished)\r\n for i in range(1,len(q)):\r\n while queries.qsize() > 0 and q[i][0] >= queries.queue[0]:\r\n queries.get()\r\n if finished <= q[i][0]:\r\n finished=q[i][0]+q[i][1]\r\n result.append(finished)\r\n queries.put(finished)\r\n else:\r\n if queries.qsize() > b:\r\n result.append(-1)\r\n else:\r\n finished+=q[i][1]\r\n result.append(finished)\r\n queries.put(finished)\r\n print (*result)\r\n \r\nn,b=[int(x) for x in input().split()]\r\nlist_of_queries=[]\r\nfor i in range(n):\r\n this_q=[int(x) for x in input().split()]\r\n list_of_queries.append(this_q)\r\n#processing_queries(5,1,[[2,9],[4,8],[10,9],[15,2],[19,1]])\r\nprocessing_queries(n,b,list_of_queries)\r\n \r\n ", "from collections import deque\r\nfrom collections import namedtuple\r\nQuery = namedtuple(\"Query\", [\"time\", \"duration\"])\r\nquery_number, max_query_queue_length = map(int, input().split())\r\nqueries = deque(Query(*map(int, input().split())) for i in range(query_number))\r\nresults = {}\r\nquery_queue = deque()\r\ncurrent_time = 0\r\nwhile len(results) != query_number:\r\n if query_queue:\r\n query = query_queue.popleft()\r\n else:\r\n query = queries.popleft()\r\n if current_time > query.time:\r\n current_time += query.duration\r\n else:\r\n current_time = query.time + query.duration\r\n results[query.time] = current_time\r\n while queries and queries[0].time < current_time:\r\n if len(query_queue) < max_query_queue_length:\r\n query_queue.append(queries.popleft())\r\n else:\r\n ignored_query = queries.popleft()\r\n results[ignored_query.time] = -1\r\nprint(\" \".join(str(results[time]) for time in sorted(results.keys())))\r\n", "def main():\r\n read = lambda: map(int, input().split())\r\n n, b = read()\r\n from collections import deque\r\n Q = deque()\r\n ans = [0] * n\r\n for i in range(n):\r\n t, d = read()\r\n while len(Q) > 0 and t >= Q[0]:\r\n Q.popleft()\r\n if len(Q) == 0:\r\n cur = t + d\r\n elif len(Q) < b + 1:\r\n cur = Q[-1] + d\r\n else:\r\n cur = -1\r\n ans[i] = cur\r\n if cur != -1:\r\n Q.append(cur)\r\n print(' '.join(map(str, ans)))\r\nmain()\r\n", "n,b=map(int,input().split())\r\ndef Q():\r\n a=[0];l=0\r\n for i in range(n):\r\n t,d=map(int,input().split())\r\n a+=[t+d if t>a[-1] else a[-1]+d]\r\n while a[l]<=t: l+=1\r\n if len(a)-l-1>b: a.pop(); yield \"-1\"\r\n else: yield str(a[-1])\r\nprint(' '.join(Q()))", "import queue\r\n\r\nclass Query:\r\n def __init__ (self, _id, _t, _d):\r\n self.id = _id\r\n self.t = _t\r\n self.d = _d\r\n\r\nn, b = map(int, input().split())\r\nans = [0]*n\r\nq = queue.Queue()\r\nlast_time = 0\r\nfor i in range(n): #time = 11, t = 10, queue=[4], b = 1\r\n t, d = map(int, input().split())\r\n while q.qsize() > 0 and t >= last_time:\r\n front = q.get()\r\n last_time += front.d\r\n ans[front.id] = last_time\r\n if t > last_time:\r\n last_time = t + d\r\n ans[i] = last_time\r\n elif q.qsize() < b:\r\n q.put(Query(i, t, d))\r\n else:\r\n ans[i] = -1\r\nwhile q.qsize() > 0:\r\n front = q.get()\r\n last_time += front.d\r\n ans[front.id] = last_time\r\nfor x in ans:\r\n print(x, end=' ')", "import sys\ninput = sys.stdin.readline\n\nq = []\nprocessing = 0\n\nn, b = map(int, input().split())\n\nfor _ in range(n):\n t, d = map(int, input().split())\n \n while len(q) != 0 and q[0] <= t:\n q.pop(0)\n \n if len(q) <= b:\n processing = max(processing, t) + d\n print(processing, end=' ')\n q.append(processing)\n else:\n print(-1,end=' ')", "from collections import deque\r\nn, d =map(int,(input().split()))\r\nper = input().split()\r\nt = int(per[0])+int(per[1])\r\nper = 0\r\nprint(t, end = ' ')\r\nanswer = t\r\nqueue = deque()\r\nfor i in range(n-1):\r\n per1, per2 = map(int, input().split())\r\n \r\n while t< per1:\r\n if per >= 1:\r\n s = queue.pop()\r\n \r\n t += s\r\n per-=1\r\n else:\r\n t = per1\r\n answer = t\r\n if t == per1:\r\n if per >= 1:\r\n s = queue.pop()\r\n \r\n per-=1\r\n t+= s\r\n if per < d:\r\n answer+=per2\r\n print(answer, end = ' ')\r\n queue.appendleft(per2)\r\n per+=1\r\n \r\n else:\r\n answer = answer+per2\r\n print(answer, end = ' ')\r\n queue.appendleft(per2)\r\n \r\n per = 1\r\n \r\n else:\r\n if per < d:\r\n answer = answer+per2\r\n queue.appendleft(per2)\r\n print(answer, end = ' ')\r\n per+=1\r\n else:\r\n print(-1,end = ' ')\r\n \r\n \r\n", "n, b = map(int, input().split())\ntasks = []\nnext_task = 0\ntime = 0\nfinish = [-1]*n\nfor i in range(n):\n t, d = map(int, input().split())\n while tasks and next_task < len(tasks) and time <= t:\n time += tasks[next_task][1]\n finish[tasks[next_task][0]] = time\n next_task += 1\n if len(tasks) - next_task < b:\n tasks.append((i, d))\n time = max(t, time)\nwhile tasks and next_task < len(tasks):\n time += tasks[next_task][1]\n finish[tasks[next_task][0]] = time\n next_task += 1\nprint(*finish)\n", "import sys\r\nfrom collections import deque\r\n# sys.stdin = open(\"ivo.in\")\r\nn, b = map(int, sys.stdin.readline().split())\r\nb += 1\r\nq = deque()\r\nres = []\r\ncur_time = 0\r\nfor iter in range(n):\r\n t, d = map(int, sys.stdin.readline().split())\r\n while len(q) > 0 and q[0] <= t:\r\n q.popleft()\r\n if len(q) >= b:\r\n res.append(-1)\r\n continue\r\n if len(q) == 0:\r\n res.append(t + d)\r\n q.append(t + d)\r\n else:\r\n res.append(q[-1] + d)\r\n q.append(q[-1] + d)\r\nprint(\" \".join(map(str, res)))", "n,b=map(int,input().split())\r\nl=[tuple(map(int,input().split())) for i in range(n)]\r\nch=[0]\r\nans=[]\r\nbd=[0]*(n+1)\r\npo=ma=0\r\nfor i in range(n):\r\n t,d=l[i]\r\n bd[i]=bd[i-1]\r\n ch+=[max(ma,t)+d]\r\n while ch[po]<=t: po+=1\r\n if i-po-(bd[i-1]-bd[po-1])==b: bd[i]+=1; ch[-1]=-1\r\n if ch[-1]>ma: ma=ch[-1]\r\n ans+=[str(ch[-1])]\r\nprint(' '.join(ans))", "def main():\n n, hi = map(int, input().split())\n l, res, lo, hi = [0], [], 0, -hi\n f = res.append\n for _ in range(n):\n t, d = map(int, input().split())\n l.append((t if t > l[-1] else l[-1]) + d)\n hi += 1\n while l[lo] <= t:\n lo += 1\n if hi > lo:\n hi -= 1\n del l[-1]\n f(-1)\n else:\n f(l[-1])\n print(' '.join(map(str, res)))\n\n\nif __name__ == '__main__':\n main()\n", "from collections import deque\r\nn, k = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n arr.append([a, b, i+1])\r\ndeq = deque([arr[0]])\r\nat = 1\r\ntime = arr[0][0]\r\nans = [-1] * n\r\nwhile(deq):\r\n a, b, idx = deq.popleft()\r\n if(a > time):\r\n time = a + b\r\n else:\r\n time += b\r\n ans[idx-1] = time\r\n while(at < n and arr[at][0] < time):\r\n if(len(deq) < k):\r\n deq.append(arr[at])\r\n at += 1\r\n if(at < n and len(deq) <= k and arr[at][0] == time):\r\n deq.append(arr[at])\r\n at += 1\r\n while(at < n and len(deq)<k):\r\n deq.append(arr[at])\r\n at+=1\r\n # print(deq)\r\nprint(*ans)\r\n", "import sys\r\nimport collections\r\nn, queue_size = map(int, input().split())\r\n\r\nresults = [-1 for _ in range(n)]\r\n\r\nnext_server_free_time = 1\r\nqueue = collections.deque()\r\nfor idx, line in enumerate(sys.stdin):\r\n t, d = map(int, line.split())\r\n\r\n while queue and next_server_free_time <= t:\r\n idx1, d1 = queue.popleft()\r\n next_server_free_time += d1\r\n results[idx1] = next_server_free_time\r\n\r\n if next_server_free_time <= t:\r\n results[idx] = t + d\r\n next_server_free_time = t + d\r\n else:\r\n if len(queue) < queue_size:\r\n queue.append((idx, d))\r\n\r\nwhile queue:\r\n idx, d = queue.popleft()\r\n next_server_free_time += d\r\n results[idx] = next_server_free_time\r\n\r\nprint(' '.join(map(str, results)))", "from collections import deque\r\n\r\nn, b = map(int, input().split())\r\n\r\nq = deque()\r\nfor _ in range(n):\r\n t, d = map(int, input().split())\r\n while q and q[0] <= t:\r\n q.popleft()\r\n if len(q) == b + 1:\r\n print(-1, end = ' ')\r\n else:\r\n if q:\r\n t = q[-1]\r\n print(t + d, end = ' ')\r\n q.append(t + d)\r\n", "import queue\r\nn, b = map(int, input().split())\r\nq = queue.Queue()\r\nprocessing = 0\r\n \r\nfor _ in range(n):\r\n t, d = map(int, input().split())\r\n \r\n while q.qsize() != 0 and t >= q.queue[0]:\r\n q.get()\r\n \r\n if q.qsize() <= b:\r\n processing = max(t, processing) + d\r\n q.put(processing)\r\n print(processing, end=' ')\r\n else:\r\n print(-1, end=' ')\r\n", "#!/usr/bin/python3\n\n# def gen(n, b):\n# \timport random\n# \tyield '{} {}'.format(n, b)\n# \tt = 0\n# \tfor i in range(n):\n# \t\tt += random.randrange(1, 1e7)\n# \t\td = random.randrange(1, 1e7)\n# \t\tyield '{} {}\\n'.format(t, d)\n\n# def input():\n# \tg = gen(200000, 200000)\n\n# \treturn next(g)\n\nn, b = map(int, input().split())\n\nends = []\n\nfor i in range(n):\n\tt, d = map(int, input().split())\n\n\twhile len(ends) > 0 and ends[0] <= t:\n\t\tends.pop(0)\n\n\tq = len(ends) - 1\n\n\tif q == b:\n\t\tprint(-1, end=' ')\n\t\tcontinue\n\n\tif not ends:\n\t\tends.append(t + d)\n\telse:\n\t\tends.append(ends[-1] + d)\n\n\tprint(ends[-1], end=' ')\n", "n, b = map(int, input().split())\r\n\r\nque = []\r\n\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n while (len(que) > 0) and (t >= que[0]):\r\n que.pop(0)\r\n if (len(que) <= b):\r\n ans = t + d if (len(que) == 0) else que[-1] + d\r\n print(ans, end = ' ')\r\n que.append(ans)\r\n else : print(-1, end = ' ')", "import queue\r\nclass query:\r\n def __init__(self, id, t, d):\r\n self.id = id\r\n self.t = t\r\n self.d = d\r\n\r\nq = queue.Queue()\r\nres = 0\r\nn, mq = map(int, input().split())\r\nx = []\r\nfor i in range(n):\r\n t, d = map(int, input().split())\r\n x.append((t,d))\r\n\r\na =[-1]*n\r\nq.put(query(0, x[0][0], x[0][1]))\r\ni = 1\r\nwhile q.qsize() != 0:\r\n res = max(res, q.queue[0].t) + (q.queue[0].d)\r\n a[q.queue[0].id] = res\r\n q.get()\r\n while i < n and q.qsize() < mq:\r\n q.put(query(i, x[i][0], x[i][1]))\r\n i += 1\r\n while i < n and res > x[i][0]:\r\n i += 1\r\n\r\nfor i in a:\r\n print(i, end = ' ')", "import queue\r\n\r\nn, b = map(int, input().split(\" \"))\r\nserver = queue.Queue()\r\ntime = 0\r\nfor i in range(n):\r\n t, d = map(int, input().split(\" \"))\r\n\r\n while server.qsize() > 0 and t >= server.queue[0]:\r\n server.get()\r\n if server.qsize() <= b:\r\n time = max(time, t) + d\r\n server.put(time)\r\n print(time, end = \" \")\r\n else:\r\n print(-1, end = \" \")", "import queue\r\nimport sys\r\n\r\nsys.setrecursionlimit(100000)\r\n\r\n# global constant\r\nINF = int(1e7 + 1)\r\nMAX = 105\r\n\r\n# For testing\r\n#sys.stdin = open(\"INP.txt\", 'r')\r\n#sys.stdout = open(\"OUT.txt\", 'w')\r\n\r\n\r\ndef main():\r\n n, b = map(int, input().split())\r\n t, d = [], []\r\n for i in range(n):\r\n x, y = map(int, input().split())\r\n t.append(x)\r\n d.append(y)\r\n t.append(INF)\r\n d.append(INF)\r\n actual_time = time_done = 0\r\n Q = queue.Queue()\r\n Q.put(0)\r\n i = 0\r\n while not Q.empty() or i < n:\r\n if (not Q.empty() and time_done <= actual_time) or i == n:\r\n cur = Q.get()\r\n t[cur] = max(time_done, t[cur])+d[cur]\r\n time_done = t[cur]\r\n if i != 0 and i != n:\r\n if Q.qsize() < b:\r\n Q.put(i)\r\n else:\r\n t[i] = -1\r\n if i != n:\r\n i += 1\r\n actual_time = t[i]\r\n for i in range(n):\r\n print(t[i], end=' ')\r\n\r\n\r\nmain()\r\n", "def main():\n from collections import deque\n a = deque()\n n, b = map(int, input().split())\n next_t = 0\n for i in range(n):\n c, lo = map(int, input().split())\n while a and a[0] <= c:\n a.popleft()\n if len(a) > b:\n print(-1, end=' ')\n else:\n print(max(next_t, c) + lo, end=' ')\n next_t = max(next_t, c) + lo\n a.append(next_t)\nmain()", "import queue\r\n\r\n\r\nclass Query:\r\n def __init__(self, t, d, res=0):\r\n self.t = t\r\n self.d = d\r\n\r\n\r\nn, b = map(int, input().split())\r\nQuery_q = []\r\n\r\nfor i in range(n):\r\n tmp1, tmp2 = map(int, input().split())\r\n new_q = Query(tmp1, tmp2)\r\n Query_q.append(new_q)\r\n\r\n\r\nres = [0]*n\r\ncur_query = queue.Queue()\r\nprocessing_end = 0\r\nfor i in range(n):\r\n while (not cur_query.empty() and cur_query.queue[0] <= Query_q[i].t):\r\n cur_query.get()\r\n\r\n if (cur_query.empty()):\r\n processing_end = Query_q[i].t\r\n if (cur_query.qsize() <= b):\r\n processing_end += Query_q[i].d\r\n res[i] = processing_end\r\n cur_query.put(res[i])\r\n else:\r\n res[i] = -1\r\n\r\nfor i in range(n):\r\n print(res[i], end=\" \")\r\n" ]

{"inputs": ["5 1\n2 9\n4 8\n10 9\n15 2\n19 1", "4 1\n2 8\n4 8\n10 9\n15 2", "1 1\n1000000000 1000000000", "4 3\n999999996 1000000000\n999999997 1000000000\n999999998 1000000000\n999999999 1000000000", "5 1\n2 1\n3 6\n4 5\n6 4\n7 2", "10 2\n4 14\n5 2\n6 6\n7 11\n8 6\n9 5\n10 13\n11 8\n13 2\n20 2", "6 4\n2 4\n4 2\n5 2\n6 2\n7 2\n9 2", "8 3\n1 2\n3 1\n4 3\n5 3\n6 1\n7 2\n8 8\n9 7", "10 3\n1 14\n3 2\n5 4\n6 9\n9 1\n12 22\n15 11\n18 8\n28 2\n29 4", "5 2\n2 7\n3 3\n7 4\n9 1\n10 2", "4 1\n2 1\n6 5\n9 2\n10 3", "4 1\n1 2\n2 1\n3 1\n4 3", "6 3\n1 2\n2 3\n100 200\n200 300\n10000 20000\n20000 30000"], "outputs": ["11 19 -1 21 22 ", "10 18 27 -1 ", "2000000000 ", "1999999996 2999999996 3999999996 4999999996 ", "3 9 14 -1 -1 ", "18 20 26 -1 -1 -1 -1 -1 -1 28 ", "6 8 10 12 14 16 ", "3 4 7 10 11 13 21 -1 ", "15 17 21 30 -1 -1 41 49 51 -1 ", "9 12 16 17 -1 ", "3 11 13 -1 ", "3 4 5 8 ", "3 6 300 600 30000 60000 "]}

UNKNOWN

PYTHON3

CODEFORCES

56

8b980c9c96fff0ee36b71d033b996015

Lucky Permutation

A permutation *p* of size *n* is the sequence *p*1,<=*p*2,<=...,<=*p**n*, consisting of *n* distinct integers, each of them is from 1 to *n* (1<=≤<=*p**i*<=≤<=*n*). A lucky permutation is such permutation *p*, that any integer *i* (1<=≤<=*i*<=≤<=*n*) meets this condition *p**p**i*<==<=*n*<=-<=*i*<=+<=1. You have integer *n*. Find some lucky permutation *p* of size *n*. The first line contains integer *n* (1<=≤<=*n*<=≤<=105) — the required permutation size. Print "-1" (without the quotes) if the lucky permutation *p* of size *n* doesn't exist. Otherwise, print *n* distinct integers *p*1,<=*p*2,<=...,<=*p**n* (1<=≤<=*p**i*<=≤<=*n*) after a space — the required permutation. If there are multiple answers, you can print any of them. Sample Input 1 2 4 5 Sample Output 1 -1 2 4 1 3 2 5 3 1 4

[ "n=int(input())\r\nif (n//2)&1:\r\n\tprint(-1)\r\nelse:\r\n\tans=[0]*(n+1)\r\n\tfor i in range(1,(n//2)+1,2):\r\n\t\tans[i]=i+1\r\n\t\tans[i+1]=n-i+1\r\n\t\tans[n-i+1]=n-i\r\n\t\tans[n-i]=i\r\n\tif n%2:\r\n\t\tans[(n//2)+1]=(n//2)+1\r\n\tprint(*ans[1:])\r\n", "n = int(input())\r\neven = []\r\nodd = []\r\nfor i in range(1,n+1):\r\n if i%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif n%4==0 or n%4==1:\r\n ans=[0]*n\r\n temp = n\r\n for i in range(0, n // 2, 2):\r\n ans[i] = i+2\r\n ans[i+1]=temp\r\n ans[n-i-1]=temp-1\r\n ans[n-i-2]=i+1\r\n temp-=2\r\n if n%4==1:\r\n ans[n//2]=n//2+1\r\n print(*ans)\r\nelse:\r\n print(-1)", "n = int(input())\r\nif n%4 > 1:\r\n print(-1)\r\nelse:\r\n a = [n+1>>1]*n\r\n for i in range(n//4):\r\n j = i*2\r\n a[j], a[j+1], a[-2-j], a[-1-j] = j+2, n-j, j+1, n-1-j\r\n print(' '.join(map(str, a)))", "'''\r\nCreated on\r\n\r\n@author: linhz\r\n'''\r\nimport sys\r\nusedNum=0\r\nn=int(input())\r\np=[0 for i in range(n+1)]\r\nusedNum=0\r\nif n%4==3 or n%4==2:\r\n print(-1)\r\nelse:\r\n i=1\r\n j=n\r\n a=1\r\n b=n\r\n while j>i:\r\n p[i]=a+1\r\n p[i+1]=b\r\n p[j]=b-1\r\n p[j-1]=a\r\n i+=2\r\n j-=2\r\n a+=2\r\n b-=2\r\n if j==i:\r\n p[i]=a\r\n ans=\"\"\r\n for i in range(1,n+1):\r\n ans+=str(p[i])+\" \"\r\n print(ans)", "import sys\n\ndef read(T=int,s=\" \"):\n\treturn [T(i) for i in sys.stdin.readline().split(s)]\n\ndef main():\n\tn=read()[0]\n\t\"\"\"\n\t\teither 4n or 4n + 1 uwu?\n\t\"\"\"\n\tif n%4!=1 and n%4!=0:\n\t\tprint(-1)\n\t\treturn\n\tres=[(n+1)//2 for i in range(n)]\n\tfor i in range(0,n//2,2):\n\t\tx,y,z,w=[i,i+1,n-2-i,n-1-i]\n\t\tres[x]=y+1\n\t\tres[y]=w+1\n\t\tres[w]=z+1\n\t\tres[z]=x+1\n\n\tfor i in range(0,n):\n\t\tprint(res[i],end=\" \")\n\tprint()\n\t\t\nmain()\n \t \t \t \t \t \t\t\t \t\t\t\t\t\t \t \t\t", "n = int(input())\r\np = [0] * n\r\n\r\nif n == 1:\r\n print(1)\r\n exit()\r\n\r\nfor sh in range(n // 4):\r\n p[n - sh * 2 - 2] = n - sh * 2\r\n p[sh * 2] = n - 1 - sh * 2\r\n p[n - sh * 2 - 1] = 2 + sh * 2\r\n p[sh * 2 + 1] = 1 + sh * 2\r\n\r\nif n % 4 == 1:\r\n p[n // 2] = n // 2 + 1\r\n\r\nif n % 4 == 2:\r\n print(-1)\r\n exit()\r\n\r\nif n % 4 == 3:\r\n print(-1)\r\n exit()\r\n\r\nprint(\" \".join([str(i) for i in p]))", "n = int(input())\r\nif n%4==2 or n%4==3:\r\n\tprint(-1)\r\nelse:\r\n\tans = [0]*n\r\n\tfor i in range(0, n//2, 2):\r\n\t\tans[i] = i+2\r\n\t\tans[i+1] = n-i\r\n\t\tans[n-i-1] = n-i-1\r\n\t\tans[n-i-2] = i+1\r\n\tif n%4 == 1:\r\n\t\tans[n//2] = n//2 + 1\r\n\tprint(*ans)", "n = int(input())\r\nif n % 4 > 1: print(-1)\r\nelse:\r\n k = n // 2\r\n t = [0] * n\r\n for i in range(0, k, 2):\r\n t[i] = str(i + 2)\r\n for i in range(1, k, 2):\r\n t[i] = str(n - i + 1)\r\n if n & 1:\r\n k += 1\r\n t[k - 1] = str(k)\r\n for i in range(k, n, 2):\r\n t[i] = str(n - i - 1)\r\n for i in range(k + 1, n, 2):\r\n t[i] = str(i)\r\n print(' '.join(t))", "n=int(input())\r\nif n%4==2 or n%4==3:\r\n from sys import exit\r\n print(-1);exit()\r\nres,i=[0]*n,0\r\nfor i in range(0,n//2,2):\r\n res[i],res[i+1]=i+2,n-i\r\n res[n-i-1],res[n-i-2]=n-i-1,i+1\r\n i+=2\r\nif n%4==1:res[n//2]=n//2+1\r\nprint(*res)", "n = int(input())\n\n\n\nif n % 4 > 1:\n\n print(-1)\n\n exit()\n\n\n\na = [i for i in range(0, n+1)]\n\nfor i in range(1, n//2+1, 2):\n\n p, q, r, s = i, i+1, n-i,n-i+1\n\n a[p], a[q], a[r], a[s] = a[q], a[s], a[p], a[r]\n\n\n\ndef check(arr):\n\n for i in range(1, n+1):\n\n k = arr[i]\n\n if arr[arr[k]] != n-k+1:\n\n return False\n\n return True\n\n\n\n# print(check(a))\n\nprint(*a[1:])\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nif n == 1:\r\n print(1)\r\n exit(0)\r\nelif n % 4 == 2 or n % 4 == 3:\r\n print(-1)\r\n exit(0)\r\n\r\nd = list(range(1, n+1))\r\ne = d.copy()\r\n\r\nfor i in range(0, n//2, 2):\r\n d[i] = i+2\r\n x = 0\r\n while x < 4:\r\n d[d[i]-1] = n - i\r\n i = d[i] - 1\r\n x += 1\r\n\r\nprint(' '.join(map(str, d)))\r\n", "n = int(input())\r\nif n%4 > 1:\r\n print(-1)\r\n exit()\r\na = [(n+1) // 2] * n\r\nfor i in range(n//4):\r\n j = 2*i\r\n a[j], a[j+1], a[-j-2], a[-j-1] = j+2, n-j, j+1, n-j-1\r\nprint(' '.join(map(str, a)))\r\n", "n=int(input())\r\nif n%4>1:print(-1)\r\nelse:\r\n ans=[i for i in range(1,n+1)]\r\n for i in range(0,n//2,2):\r\n ans[i]=i+2\r\n ans[i+1]=n-i\r\n ans[n-i-1]=n-i-1\r\n ans[n-i-2]=i+1\r\n print(*ans)\r\n \r\n", "n=int(input())\n\nL=[0]*(n+1)\n\nX=[False]*(n+1)\n\nif(n%4!=0 and n%4!=1):\n print(-1)\n\nelse:\n for i in range(1,n+1):\n if(X[i]):\n continue\n X[i]=True\n X[n-i+1]=True\n for j in range(i+1,n+1):\n if(X[j]):\n continue\n X[j]=True\n X[n-j+1]=True\n L[i]=j\n L[n-i+1]=n-j+1\n L[j]=n-i+1\n L[n-j+1]=i\n break\n if(n%4==1):\n L[n//2+1]=n//2+1\n for i in range(1,n):\n print(L[i],end=\" \")\n print(L[n])\n \n", "n=int(input())\nif n==1:\n\tprint (1)\n\texit()\nif n%4>1:\n\tprint (-1)\n\texit()\nans=[-1]*n\nleft=n\nstart=n-2\nnums=1\nnume=n\nwhile left>=4:\n\tans[start]=nums\n\tans[nums-1]=nums+1\n\tans[nums]=nume\n\tans[nume-1]=nume-1\n\tstart-=2\n\tnums+=2\n\tnume-=2\n\tleft-=4\n\t# print (ans)\nif left==1:\n\tans[start+1]=start+2\nprint (*ans)" ]

{"inputs": ["1", "2", "4", "5", "3", "100000", "6", "7", "8", "9", "99997", "10000", "10001", "10002", "10003", "10004", "25", "29", "33", "9", "13", "17", "50001", "20001", "30001", "99996", "99999", "101", "505", "565"], "outputs": ["1 ", "-1", "2 4 1 3 ", "2 5 3 1 4 ", "-1", "2 100000 4 99998 6 99996 8 99994 10 99992 12 99990 14 99988 16 99986 18 99984 20 99982 22 99980 24 99978 26 99976 28 99974 30 99972 32 99970 34 99968 36 99966 38 99964 40 99962 42 99960 44 99958 46 99956 48 99954 50 99952 52 99950 54 99948 56 99946 58 99944 60 99942 62 99940 64 99938 66 99936 68 99934 70 99932 72 99930 74 99928 76 99926 78 99924 80 99922 82 99920 84 99918 86 99916 88 99914 90 99912 92 99910 94 99908 96 99906 98 99904 100 99902 102 99900 104 99898 106 99896 108 99894 110 99892 112 99890 114...", "-1", "-1", "2 8 4 6 3 5 1 7 ", "2 9 4 7 5 3 6 1 8 ", "2 99997 4 99995 6 99993 8 99991 10 99989 12 99987 14 99985 16 99983 18 99981 20 99979 22 99977 24 99975 26 99973 28 99971 30 99969 32 99967 34 99965 36 99963 38 99961 40 99959 42 99957 44 99955 46 99953 48 99951 50 99949 52 99947 54 99945 56 99943 58 99941 60 99939 62 99937 64 99935 66 99933 68 99931 70 99929 72 99927 74 99925 76 99923 78 99921 80 99919 82 99917 84 99915 86 99913 88 99911 90 99909 92 99907 94 99905 96 99903 98 99901 100 99899 102 99897 104 99895 106 99893 108 99891 110 99889 112 99887 114 ...", "2 10000 4 9998 6 9996 8 9994 10 9992 12 9990 14 9988 16 9986 18 9984 20 9982 22 9980 24 9978 26 9976 28 9974 30 9972 32 9970 34 9968 36 9966 38 9964 40 9962 42 9960 44 9958 46 9956 48 9954 50 9952 52 9950 54 9948 56 9946 58 9944 60 9942 62 9940 64 9938 66 9936 68 9934 70 9932 72 9930 74 9928 76 9926 78 9924 80 9922 82 9920 84 9918 86 9916 88 9914 90 9912 92 9910 94 9908 96 9906 98 9904 100 9902 102 9900 104 9898 106 9896 108 9894 110 9892 112 9890 114 9888 116 9886 118 9884 120 9882 122 9880 124 9878 126 9...", "2 10001 4 9999 6 9997 8 9995 10 9993 12 9991 14 9989 16 9987 18 9985 20 9983 22 9981 24 9979 26 9977 28 9975 30 9973 32 9971 34 9969 36 9967 38 9965 40 9963 42 9961 44 9959 46 9957 48 9955 50 9953 52 9951 54 9949 56 9947 58 9945 60 9943 62 9941 64 9939 66 9937 68 9935 70 9933 72 9931 74 9929 76 9927 78 9925 80 9923 82 9921 84 9919 86 9917 88 9915 90 9913 92 9911 94 9909 96 9907 98 9905 100 9903 102 9901 104 9899 106 9897 108 9895 110 9893 112 9891 114 9889 116 9887 118 9885 120 9883 122 9881 124 9879 126 9...", "-1", "-1", "2 10004 4 10002 6 10000 8 9998 10 9996 12 9994 14 9992 16 9990 18 9988 20 9986 22 9984 24 9982 26 9980 28 9978 30 9976 32 9974 34 9972 36 9970 38 9968 40 9966 42 9964 44 9962 46 9960 48 9958 50 9956 52 9954 54 9952 56 9950 58 9948 60 9946 62 9944 64 9942 66 9940 68 9938 70 9936 72 9934 74 9932 76 9930 78 9928 80 9926 82 9924 84 9922 86 9920 88 9918 90 9916 92 9914 94 9912 96 9910 98 9908 100 9906 102 9904 104 9902 106 9900 108 9898 110 9896 112 9894 114 9892 116 9890 118 9888 120 9886 122 9884 124 9882 126...", "2 25 4 23 6 21 8 19 10 17 12 15 13 11 14 9 16 7 18 5 20 3 22 1 24 ", "2 29 4 27 6 25 8 23 10 21 12 19 14 17 15 13 16 11 18 9 20 7 22 5 24 3 26 1 28 ", "2 33 4 31 6 29 8 27 10 25 12 23 14 21 16 19 17 15 18 13 20 11 22 9 24 7 26 5 28 3 30 1 32 ", "2 9 4 7 5 3 6 1 8 ", "2 13 4 11 6 9 7 5 8 3 10 1 12 ", "2 17 4 15 6 13 8 11 9 7 10 5 12 3 14 1 16 ", "2 50001 4 49999 6 49997 8 49995 10 49993 12 49991 14 49989 16 49987 18 49985 20 49983 22 49981 24 49979 26 49977 28 49975 30 49973 32 49971 34 49969 36 49967 38 49965 40 49963 42 49961 44 49959 46 49957 48 49955 50 49953 52 49951 54 49949 56 49947 58 49945 60 49943 62 49941 64 49939 66 49937 68 49935 70 49933 72 49931 74 49929 76 49927 78 49925 80 49923 82 49921 84 49919 86 49917 88 49915 90 49913 92 49911 94 49909 96 49907 98 49905 100 49903 102 49901 104 49899 106 49897 108 49895 110 49893 112 49891 114 ...", "2 20001 4 19999 6 19997 8 19995 10 19993 12 19991 14 19989 16 19987 18 19985 20 19983 22 19981 24 19979 26 19977 28 19975 30 19973 32 19971 34 19969 36 19967 38 19965 40 19963 42 19961 44 19959 46 19957 48 19955 50 19953 52 19951 54 19949 56 19947 58 19945 60 19943 62 19941 64 19939 66 19937 68 19935 70 19933 72 19931 74 19929 76 19927 78 19925 80 19923 82 19921 84 19919 86 19917 88 19915 90 19913 92 19911 94 19909 96 19907 98 19905 100 19903 102 19901 104 19899 106 19897 108 19895 110 19893 112 19891 114 ...", "2 30001 4 29999 6 29997 8 29995 10 29993 12 29991 14 29989 16 29987 18 29985 20 29983 22 29981 24 29979 26 29977 28 29975 30 29973 32 29971 34 29969 36 29967 38 29965 40 29963 42 29961 44 29959 46 29957 48 29955 50 29953 52 29951 54 29949 56 29947 58 29945 60 29943 62 29941 64 29939 66 29937 68 29935 70 29933 72 29931 74 29929 76 29927 78 29925 80 29923 82 29921 84 29919 86 29917 88 29915 90 29913 92 29911 94 29909 96 29907 98 29905 100 29903 102 29901 104 29899 106 29897 108 29895 110 29893 112 29891 114 ...", "2 99996 4 99994 6 99992 8 99990 10 99988 12 99986 14 99984 16 99982 18 99980 20 99978 22 99976 24 99974 26 99972 28 99970 30 99968 32 99966 34 99964 36 99962 38 99960 40 99958 42 99956 44 99954 46 99952 48 99950 50 99948 52 99946 54 99944 56 99942 58 99940 60 99938 62 99936 64 99934 66 99932 68 99930 70 99928 72 99926 74 99924 76 99922 78 99920 80 99918 82 99916 84 99914 86 99912 88 99910 90 99908 92 99906 94 99904 96 99902 98 99900 100 99898 102 99896 104 99894 106 99892 108 99890 110 99888 112 99886 114 ...", "-1", "2 101 4 99 6 97 8 95 10 93 12 91 14 89 16 87 18 85 20 83 22 81 24 79 26 77 28 75 30 73 32 71 34 69 36 67 38 65 40 63 42 61 44 59 46 57 48 55 50 53 51 49 52 47 54 45 56 43 58 41 60 39 62 37 64 35 66 33 68 31 70 29 72 27 74 25 76 23 78 21 80 19 82 17 84 15 86 13 88 11 90 9 92 7 94 5 96 3 98 1 100 ", "2 505 4 503 6 501 8 499 10 497 12 495 14 493 16 491 18 489 20 487 22 485 24 483 26 481 28 479 30 477 32 475 34 473 36 471 38 469 40 467 42 465 44 463 46 461 48 459 50 457 52 455 54 453 56 451 58 449 60 447 62 445 64 443 66 441 68 439 70 437 72 435 74 433 76 431 78 429 80 427 82 425 84 423 86 421 88 419 90 417 92 415 94 413 96 411 98 409 100 407 102 405 104 403 106 401 108 399 110 397 112 395 114 393 116 391 118 389 120 387 122 385 124 383 126 381 128 379 130 377 132 375 134 373 136 371 138 369 140 367 142 ...", "2 565 4 563 6 561 8 559 10 557 12 555 14 553 16 551 18 549 20 547 22 545 24 543 26 541 28 539 30 537 32 535 34 533 36 531 38 529 40 527 42 525 44 523 46 521 48 519 50 517 52 515 54 513 56 511 58 509 60 507 62 505 64 503 66 501 68 499 70 497 72 495 74 493 76 491 78 489 80 487 82 485 84 483 86 481 88 479 90 477 92 475 94 473 96 471 98 469 100 467 102 465 104 463 106 461 108 459 110 457 112 455 114 453 116 451 118 449 120 447 122 445 124 443 126 441 128 439 130 437 132 435 134 433 136 431 138 429 140 427 142 ..."]}

UNKNOWN

PYTHON3

CODEFORCES

15

8baaa070ecac7d157bd2a81f95a18b77

MUH and Important Things

It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are *n* tasks for the day and each animal should do each of these tasks. For each task, they have evaluated its difficulty. Also animals decided to do the tasks in order of their difficulty. Unfortunately, some tasks can have the same difficulty, so the order in which one can perform the tasks may vary. Menshykov, Uslada and Horace ask you to deal with this nuisance and come up with individual plans for each of them. The plan is a sequence describing the order in which an animal should do all the *n* tasks. Besides, each of them wants to have its own unique plan. Therefore three plans must form three different sequences. You are to find the required plans, or otherwise deliver the sad news to them by stating that it is impossible to come up with three distinct plans for the given tasks. The first line contains integer *n* (1<=≤<=*n*<=≤<=2000) — the number of tasks. The second line contains *n* integers *h*1,<=*h*2,<=...,<=*h**n* (1<=≤<=*h**i*<=≤<=2000), where *h**i* is the difficulty of the *i*-th task. The larger number *h**i* is, the more difficult the *i*-th task is. In the first line print "YES" (without the quotes), if it is possible to come up with three distinct plans of doing the tasks. Otherwise print in the first line "NO" (without the quotes). If three desired plans do exist, print in the second line *n* distinct integers that represent the numbers of the tasks in the order they are done according to the first plan. In the third and fourth line print two remaining plans in the same form. If there are multiple possible answers, you can print any of them. Sample Input 4 1 3 3 1 5 2 4 1 4 8 Sample Output YES 1 4 2 3 4 1 2 3 4 1 3 2 NO

[ "while True:\r\n try:\r\n n = int(input())\r\n tasks = list(enumerate(map(int, input().split()), 1)) # [(id, difficulty)]\r\n tasks.sort(key = lambda x: x[1]) # sort by id\r\n i = 0\r\n while i < n - 1:\r\n if tasks[i][1] == tasks[i + 1][1]:\r\n break\r\n i += 1\r\n j = i + 1\r\n while j < n - 1:\r\n if tasks[j][1] == tasks[j + 1][1]:\r\n break\r\n j += 1\r\n if j > n - 2:\r\n print('NO')\r\n else:\r\n print('YES')\r\n tasks = [str(id) for id, difficulty in tasks]\r\n print(' '.join(tasks))\r\n tasks[i], tasks[i + 1] = tasks[i + 1], tasks[i]\r\n print(' '.join(tasks))\r\n tasks[j], tasks[j + 1] = tasks[j + 1], tasks[j]\r\n print(' '.join(tasks))\r\n except:\r\n break", "\"\"\"\r\nCodeforces Contest 269 Div 2 Problem B\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.3.4\r\n\"\"\"\r\n\r\ndef main():\r\n n, = read()\r\n a = [(int(x), i+1) for i,x in enumerate(read())]\r\n a.sort()\r\n ct = []\r\n for i in range(n-1):\r\n if a[i][0] == a[i+1][0]: ct.append(i)\r\n if len(ct) < 2:\r\n print(\"NO\")\r\n return\r\n a1 = []\r\n a2 = []\r\n a3 = []\r\n for i in range(n):\r\n a1.append(a[i][1])\r\n if i == ct[0]:\r\n a2.append(a[i+1][1])\r\n elif i == ct[0]+1:\r\n a2.append(a[i-1][1])\r\n else:\r\n a2.append(a[i][1])\r\n if i == ct[1]:\r\n a3.append(a[i+1][1])\r\n elif i == ct[1]+1:\r\n a3.append(a[i-1][1])\r\n else:\r\n a3.append(a[i][1])\r\n print(\"YES\")\r\n write(a1)\r\n print()\r\n write(a2)\r\n print()\r\n write(a3)\r\n\r\n################################### NON-SOLUTION STUFF BELOW\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 list(map(int, inputs.split()))\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\nwrite(main())", "n = int(input())\r\nm = list(map(int, input().split()))\r\n\r\nu = {}\r\nfor i, v in enumerate(m):\r\n if not v in u:\r\n u[v] = []\r\n u[v].append(i+1)\r\n\r\nd = []\r\n\r\nfor i in u:\r\n m1 = u[i]\r\n d.append([i, m1, len(m1)])\r\n\r\nd = sorted(d, key=lambda x: x[0])\r\n\r\npos = 1\r\n\r\ns1 = []\r\ns2 = []\r\ns3 = []\r\n\r\nfor val in d:\r\n l = val[1]\r\n\r\n if pos != 3:\r\n if val[2] == 2:\r\n if pos == 1:\r\n pos = 2\r\n s1 += l\r\n s3 += l\r\n l.reverse()\r\n s2 += l\r\n continue\r\n elif pos == 2:\r\n pos = 3\r\n s1 += l\r\n s2 += l\r\n l.reverse()\r\n s3 += l\r\n continue\r\n elif val[2] > 2:\r\n pos = 3\r\n s1 += l\r\n l.reverse()\r\n s2 += l\r\n l[1], l[2] = l[2], l[1]\r\n s3 += l\r\n continue\r\n\r\n s1 += l\r\n s2 += l\r\n s3 += l\r\n\r\nif pos == 3:\r\n print('YES')\r\n print(' '.join(map(str, s1)))\r\n print(' '.join(map(str, s2)))\r\n print(' '.join(map(str, s3)))\r\nelse:\r\n print('NO')\r\n\r\n\r\n# n = int(input())\r\n# m = list(map(int, input().split()))\r\n#\r\n# u = {}\r\n# for v in m:\r\n# u[v] = 1 + (u[v] if v in u else 0)\r\n#\r\n# d = []\r\n#\r\n# for i, v in enumerate(m):\r\n# d.append([i+1, v])\r\n#\r\n# d = sorted(d, key=lambda x: x[1])\r\n#\r\n# print(n, m, d, u)\r\n#\r\n# s2 = []\r\n# s3 = []\r\n#\r\n# for i, v in u.items():\r\n# print(i, v)\r\n# if v == 2:\r\n# s2.append(i)\r\n# if v > 2:\r\n# s3.append(i)\r\n#\r\n# print(s2, s3)\r\n#\r\n# if len(s3):\r\n# v1 = v2 = v3 = v4 = s3[0]\r\n# elif len(s2) >= 2:\r\n# v1 = v2 = s2[0]\r\n# v3 = v4 = s2[1]\r\n# else:\r\n# print('NO')\r\n# exit()\r\n#\r\n# print('YES')\r\n#\r\n# s1 = []\r\n# for v in d:\r\n# s1.append(v[0])\r\n#\r\n# s2 = s1\r\n# s3 = s1\r\n#\r\n# print(' '.join(map(str, s1)))\r\n# print(s2, s3)\r\n#\r\n# print(v1, v2, v3, v4)\r\n#\r\n", "# https://bigocoder.com/courses/OBLUE01/OBLUE01_LEC18/BLUE_L18P01/statement\r\n\r\nn = int(input())\r\ntasks = list(map(int, input().split()))\r\n\r\np = []\r\nfor i in range(n):\r\n p.append( (i+1, tasks[i]) )\r\n\r\np.sort(key=lambda x: x[1])\r\n\r\nl1 = p.copy()\r\nl2 = []\r\nl3 = []\r\n\r\ncount = 0\r\n\r\nfor i in range(1,n):\r\n if p[i][1] == p[i-1][1]:\r\n count += 1\r\n if count > 1:\r\n break\r\n\r\nif count < 2:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(1, n):\r\n if p[i][1] == p[i-1][1]:\r\n p[i], p[i-1] = p[i-1], p[i]\r\n if l2 == []:\r\n l2 = p.copy()\r\n else:\r\n l3 = p.copy()\r\n break\r\n for i in range(n):\r\n print(l1[i][0], end=' ')\r\n print()\r\n for i in range(n):\r\n print(l2[i][0], end=' ')\r\n print()\r\n for i in range(n):\r\n print(l3[i][0], end=' ')", "n=int(input())\r\nL=list(map(int,input().split()))\r\nfor i in range(n):\r\n L[i]=(L[i],i+1)\r\n\r\nL.sort()\r\nH1=[]\r\nfor i in range(n):\r\n H1.append(L[i][1])\r\nind=-1\r\nfor i in range(1,n):\r\n if(L[i][0]==L[i-1][0]):\r\n L[i],L[i-1]=tuple(L[i-1]),tuple(L[i])\r\n found=True\r\n ind=i\r\n break\r\nif(ind==-1):\r\n print(\"NO\")\r\nelse:\r\n H2=[]\r\n for i in range(n):\r\n H2.append(L[i][1])\r\n ind+=1\r\n found=False\r\n for i in range(ind,n):\r\n if(L[i][0]==L[i-1][0]):\r\n L[i],L[i-1]=tuple(L[i-1]),tuple(L[i])\r\n found=True\r\n ind=i\r\n break\r\n if(not found):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n H3=[]\r\n for i in range(n):\r\n H3.append(L[i][1])\r\n for i in range(n):\r\n print(H1[i],end=\" \")\r\n print()\r\n for i in range(n):\r\n print(H2[i],end=\" \")\r\n print()\r\n for i in range(n):\r\n print(H3[i],end=\" \")\r\n print()\r\n \r\n", "import sys\r\nsys.setrecursionlimit(100000)\r\n\r\n# -----------------------------------------------------------------\r\n\r\n# global constant\r\nINF = int(1e7+1)\r\nMAX = 100005\r\n\r\n# -----------------------------------------------------------------\r\n\r\n# For testing\r\n# sys.stdin = open(\"INP.txt\", 'r')\r\n# sys.stdout = open(\"OUT.txt\", 'w')\r\n\r\n\r\n# -----------------------------------------------------------------\r\n\r\n# classes\r\nclass Pair:\r\n def __init__(self, a, b):\r\n self.first = a\r\n self.second = b\r\n\r\n def __lt__(self, other):\r\n return self.first < other.first or (self.first == other.first and self.second < other.second)\r\n\r\n\r\nclass Edge:\r\n def __init__(self, u, v, w):\r\n self.u = u\r\n self.v = v\r\n self.w = w\r\n\r\n def __lt__(self, other):\r\n return self.w < other.w\r\n\r\n# -----------------------------------------------------------------\r\n\r\n\r\n# global variables\r\n\r\n# -----------------------------------------------------------------\r\n\r\n# functions\r\ndef init():\r\n pass\r\n\r\ndef erase(string):\r\n return string [1:]\r\n\r\n# -----------------------------------------------------------------\r\n# main function\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n for i in range(n):\r\n a[i] = Pair(a[i], i + 1)\r\n\r\n a.sort()\r\n\r\n countPair = 0\r\n for i in range(n - 1):\r\n if a[i].first == a[i + 1].first:\r\n countPair += 1\r\n\r\n if countPair < 2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n count = 0\r\n for i in range(n - 1):\r\n # print(a[i].first, a[i].second)\r\n if a[i].first == a[i + 1].first:\r\n for j in range(n):\r\n print(a[j].second, end=' ')\r\n print()\r\n \r\n count += 1\r\n a[i].second, a[i + 1].second = a[i + 1].second, a[i].second\r\n if count == 2:\r\n for j in range(n):\r\n print(a[j].second, end=' ')\r\n break\r\n\r\n\r\n \r\n\r\nmain()\r\n", "def print_permutation(array):\n temp = \"\"\n for ar in array:\n temp += str(ar[1])+\" \"\n return temp.strip()\n\nn = int(input().strip())\na = list(map(int, input().split()))\nfor i in range(n):\n a[i] = (a[i], i+1)\na.sort(key=lambda t: t[0])\n\nb = a.copy()\nindex = 0\ncount = 1\nfor i in range(n-1):\n if b[i][0] == b[i+1][0]:\n temp = b[i]\n b[i] = b[i+1]\n b[i+1] = temp\n index = i + 1\n count += 1\n break\nc = b.copy()\nfor i in range(index, n-1):\n if c[i][0] == c[i+1][0]:\n temp = c[i]\n c[i] = c[i+1]\n c[i+1] = temp\n count += 1\n break\n\nif count == 3:\n print(\"YES\")\n print(print_permutation(a))\n print(print_permutation(b))\n print(print_permutation(c))\nelse:\n print(\"NO\")\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nques = []\r\nfor i in range (n):\r\n ques.append((i,l[i]))\r\n\r\nques = sorted(ques, key = lambda x: (x[1],x[0]))\r\n\r\ncheck = 0\r\nfor i in range (n-1):\r\n if ques[i][1] == ques[i+1][1]:\r\n check += 1\r\n if check == 2:\r\n print('YES')\r\n for j in range (n):\r\n print(ques[j][0]+1,end = ' ')\r\n print()\r\n count = 0\r\n for j in range (n-1):\r\n if ques[j][1] == ques[j+1][1]:\r\n count += 1\r\n ques[j],ques[j+1] = ques[j+1],ques[j]\r\n for k in range (n):\r\n print(ques[k][0]+1,end = ' ')\r\n print()\r\n ques[j],ques[j+1] = ques[j+1],ques[j]\r\n if count == 2:\r\n exit()\r\n\r\nprint('NO')", "class Task:\r\n def __init__(self, value, index):\r\n self.value = value\r\n self.index = index\r\n def __lt__(self, other):\r\n return self.value < other.value\r\n\r\ndef swap(a, start, end):\r\n tmp = a[start].value\r\n a[start].value = a[end].value\r\n a[end].value = tmp\r\n tmp = a[start].index\r\n a[start].index = a[end].index\r\n a[end].index = tmp\r\n\r\nN = int(input())\r\nA = map(int, input().split())\r\na = []\r\nfor index, value in enumerate(A):\r\n a.append(Task(value, index + 1))\r\na = sorted(a)\r\n\r\ni = 0\r\nfirstStart = -1\r\nfirstEnd = -1\r\nsecondStart = -1\r\nsecondEnd = -1\r\nwhile i < len(a) - 1:\r\n if firstStart == -1 and a[i].value == a[i + 1].value:\r\n firstStart = i\r\n while i < len(a) - 1 and a[i].value == a[i + 1].value:\r\n i += 1\r\n firstEnd = i\r\n elif secondStart == -1 and a[i].value == a[i + 1].value:\r\n secondStart = i\r\n while i < len(a) - 1 and a[i].value == a[i + 1].value:\r\n i += 1\r\n secondEnd = i\r\n i += 1\r\n\r\nif firstStart == -1 or (firstEnd - firstStart <= 1 and secondStart == -1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(\" \".join([str(x.index) for x in a]))\r\n swap(a, firstStart, firstEnd)\r\n print(\" \".join([str(x.index) for x in a]))\r\n if firstEnd - firstStart >= 2:\r\n swap(a, firstStart, firstStart + 1)\r\n else:\r\n swap(a, secondStart, secondEnd)\r\n print(\" \".join([str(x.index) for x in a])) \r\n", "n=int(input())\r\n#n,k = map(int, input().strip().split(' '))\r\nlst = list(map(int, input().strip().split(' ')))\r\nl2 = list(set(lst))\r\nif len(lst)-len(l2)<2:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n l={}\r\n for j in range(n):\r\n l[j]=lst[j]\r\n l = dict(sorted(l.items(), key=lambda x:x[1]))\r\n #print(l)\r\n l3=[]\r\n for j in l:\r\n l3.append([j+1,l[j]])\r\n print(j+1,end=\" \")\r\n print()\r\n #now we have a 2d list l3\r\n l4=[]\r\n for j in range(len(l3)-1):\r\n if l3[j][1]==l3[j+1][1]:\r\n l4.append(j)\r\n if len(l4)==2:\r\n break\r\n f=0\r\n for j in range(n):\r\n if j==l4[0]:\r\n f=1\r\n print(l3[j+1][0],end=\" \")\r\n elif f==1:\r\n f=2\r\n print(l3[j-1][0],end=\" \")\r\n else:\r\n print(l3[j][0],end=\" \")\r\n print()\r\n for j in range(n):\r\n if j==l4[1]:\r\n f=1\r\n print(l3[j+1][0],end=\" \")\r\n elif f==1:\r\n f=2\r\n print(l3[j-1][0],end=\" \")\r\n else:\r\n print(l3[j][0],end=\" \")\r\n print()\r\n \r\n ", "n = int(input())\r\narr = [0] * n\r\nk = 0\r\nfor i in list(map(int, input().split())):\r\n arr[k] = (i, k + 1)\r\n k += 1\r\narr.sort()\r\nk = 0\r\np = ''\r\nans = 0\r\nind = []\r\nfor i in arr:\r\n if i[0] == p:\r\n ans += 1\r\n ind.append(k)\r\n else:\r\n p = i[0]\r\n if ans > 1:\r\n break\r\n k += 1\r\nif len(ind) != 2:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in arr:\r\n print(i[1], end = ' ')\r\n print()\r\n for i in arr[:ind[0] - 1]:\r\n print(i[1], end = ' ')\r\n print(arr[ind[0]][1], end = ' ' )\r\n print(arr[ind[0] - 1][1], end = ' ')\r\n for i in arr[ind[0] + 1:]:\r\n print(i[1], end = ' ')\r\n print()\r\n for i in arr[:ind[1] - 1]:\r\n print(i[1], end = ' ')\r\n print(arr[ind[1]][1], end = ' ')\r\n print(arr[ind[1] - 1][1], end = ' ')\r\n for i in arr[ind[1] + 1:]:\r\n print(i[1], end = ' ') ", "def print_plan(plan):\n for task in plan:\n print(task[1], end = ' ')\n print()\n\nn = int(input())\nh = list(map(int, input().split()))\n\ntasks = []\nfor i in range(n):\n tasks.append((h[i], i + 1))\ntasks.sort()\nswaps = []\nfor i in range(1, n):\n if len(swaps) >= 2:\n break\n if tasks[i - 1][0] == tasks[i][0]:\n swaps.append((i - 1, i))\nif len(swaps) < 2:\n print('NO')\n exit()\nprint('YES')\nprint_plan(tasks)\ntasks[swaps[0][0]], tasks[swaps[0][1]] = tasks[swaps[0][1]], tasks[swaps[0][0]] \nprint_plan(tasks)\ntasks[swaps[1][0]], tasks[swaps[1][1]] = tasks[swaps[1][1]], tasks[swaps[1][0]] \nprint_plan(tasks)", "\n\ndef solve(nums):\n nums = zip(nums, [i+1 for i in range(len(nums))])\n nums = sorted(nums, key=lambda x: x[0])\n seqs = [[],[],[]]\n\n prev = nums[0][0]\n count = 0\n for n, i in nums[1:]:\n if n == prev:\n count += 1\n prev = n\n if count < 2:\n print(\"NO\")\n return\n \n print(\"YES\")\n \n curr = 0\n prev = None\n for n, i in nums:\n seqs[0].append(i)\n seqs[1].append(i)\n seqs[2].append(i)\n\n if not (n != prev or curr >= 2):\n seqs[curr+1][-1], seqs[curr+1][-2] = seqs[curr+1][-2], seqs[curr+1][-1]\n curr += 1\n\n prev = n\n\n for s in seqs:\n print(' '.join(map(str, s)))\n \n\ninput()\nsolve(list(map(int, input().split(' '))))\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\narr = [(i+1, arr[i]) for i in range(n)]\r\narr.sort(key = lambda x: x[1])\r\ni = 0\r\nwhile i < n - 1 and arr[i][1] != arr[i + 1][1]: i += 1\r\nj = i + 1\r\nwhile j < n - 1 and arr[j][1] != arr[j + 1][1]: j += 1\r\nif j > n - 2: \r\n print('NO')\r\n exit()\r\nprint('YES')\r\nres = [str(i) for i, j in arr]\r\nprint(*res)\r\nres[i], res[i + 1] = res[i + 1], res[i]\r\nprint(*res)\r\nres[j], res[j + 1] = res[j + 1], res[j]\r\nprint(*res)\r\n", "n=int(input())\r\nlis=input().split()\r\nfor i in range(n):\r\n lis[i]=int(lis[i])\r\n\r\nlis1=sorted(list(set(lis)))\r\ndic={}\r\nfor k in lis1:\r\n dic[k]=[]\r\nfor i in range(n):\r\n for j in range(len(lis1)):\r\n if lis1[j]==lis[i]:\r\n dic[lis1[j]].append(i+1)\r\n\r\ndic1={}\r\nfor [u,v] in dic.items():\r\n if len(v)>=2:\r\n dic1[u]=v\r\n \r\nif len(dic1)==0:\r\n print('NO')\r\nif len(dic1)==1:\r\n for [u,v] in dic1.items():\r\n if len(v)<3:\r\n print('NO')\r\n else:\r\n print('YES')\r\n for i in range(len(lis1)):\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n print()\r\n for i in range(len(lis1)):\r\n if lis1[i] in dic1.keys():\r\n print(dic1[lis1[i]][1],end=' ')\r\n print(dic1[lis1[i]][0],end=' ')\r\n for k in dic[lis1[i]][2:]:\r\n print(k,end=' ')\r\n else:\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n print()\r\n for i in range(len(lis1)):\r\n if lis1[i] in dic1.keys():\r\n print(dic1[lis1[i]][2],end=' ')\r\n for k in dic[lis1[i]][:2]+dic[lis1[i]][3:]:\r\n print(k,end=' ')\r\n else:\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n\r\nif len(dic1)>=2:\r\n print('YES')\r\n lis2=[]\r\n for k in dic1.keys():\r\n lis2.append(k)\r\n index1=lis1.index(lis2[0])\r\n index2=lis1.index(lis2[1])\r\n for i in range(len(lis1)):\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n print()\r\n for i in range(len(lis1)):\r\n if i!=index1:\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n else:\r\n dic[lis1[i]][0],dic[lis1[i]][1]=dic[lis1[i]][1],dic[lis1[i]][0]\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n print()\r\n for i in range(len(lis1)):\r\n if i!=index2:\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n else:\r\n dic[lis1[i]][0],dic[lis1[i]][1]=dic[lis1[i]][1],dic[lis1[i]][0]\r\n for k in dic[lis1[i]]:\r\n print(k,end=' ')\r\n print()\r\n \r\n \r\n \r\n \r\n \r\n", "def main():\r\n n = int(input())\r\n x = [[int(y),0] for y in input().split()] #Lectura de datos\r\n solucion = []\r\n for i in range(len(x)):\r\n x[i][1] = i+1\r\n x.sort()\r\n solucion.append(x)\r\n for i in range(len(x)):\r\n if(i+1 < n and x[i][0] == x[i+1][0]):\r\n x[i+1],x[i] = x[i],x[i+1]\r\n solucion.append([z for z in x])\r\n x[i],x[i+1] = x[i+1],x[i]\r\n if(len(solucion) == 3):\r\n break;\r\n if(len(solucion) == 3):\r\n print(\"YES\")\r\n for i in range(3):\r\n for j in range(len(x)-1):\r\n print(solucion[i][j][1],end=' ')\r\n print(solucion[i][len(x)-1][1])\r\n else:\r\n print(\"NO\")\r\nmain()", "n = int(input())\na = sorted([(int(x), y + 1) for (x, y) in zip(input().split(), range(n))])\ncnt = 0\nfor (x, y), (xx, yy) in zip(a[: -1], a[1: ]):\n\tif x == xx:\n\t\tcnt += 1\nif cnt < 2:\n\tprint('NO')\n\texit(0)\nprint('YES')\nprint(' '.join(str(y) for x, y in a))\ni = 0\nwhile a[i][0] != a[i + 1][0]:\n\ti += 1\na[i], a[i + 1] = a[i + 1], a[i]\nprint(' '.join(str(y) for x, y in a))\ni += 1\nwhile a[i][0] != a[i + 1][0]:\n i += 1\na[i], a[i + 1] = a[i + 1], a[i]\nprint(' '.join(str(y) for x, y in a))\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nd = [0] * (n)\r\nb = [0] * (2001)\r\ns = 0\r\nf = [ [] for i in range(2001) ]\r\nc = [ [] for i in range(3) ]\r\nfor i in range(len(a)):\r\n b[a[i]] = b[a[i]] + 1\r\n d[i] = [a[i],i+1]\r\n f[a[i]].append(i+1)\r\nc1 = 0\r\nfor i in range(len(b)):\r\n if (b[i] >= 2):\r\n if (b[i] >= 3):\r\n c1 = c1 + 1\r\n s = s + 1\r\nif ((s < 2) and (c1 != 1)):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n s = 0\r\n for i in range(len(f)):\r\n for j in range(len(f[i])):\r\n c[0].append(f[i][j])\r\n print(*(c[0]))\r\n mark = [False] * (2001)\r\n for i in range(len(f)):\r\n if (len(f[i]) == 1):\r\n c[1].append(f[i][0])\r\n elif (len(f[i]) == 2):\r\n if (s == 0):\r\n c[1].append(f[i][1])\r\n c[1].append(f[i][0])\r\n s = s + 1\r\n mark[i] = True\r\n else:\r\n c[1].append(f[i][0])\r\n c[1].append(f[i][1])\r\n elif (len(f[i]) > 2):\r\n if (s == 0):\r\n c[1].append(f[i][1])\r\n c[1].append(f[i][0])\r\n for j in range(2,len(f[i])):\r\n c[1].append(f[i][j])\r\n else:\r\n for j in range(len(f[i])):\r\n c[1].append(f[i][j])\r\n print(*(c[1]))\r\n s = 0\r\n for i in range(len(f)):\r\n if (len(f[i]) == 1):\r\n c[2].append(f[i][0])\r\n elif (len(f[i]) == 2):\r\n if ((mark[i] == False) and (s == 0)):\r\n c[2].append(f[i][1])\r\n c[2].append(f[i][0])\r\n mark[i] = True\r\n s = s + 1\r\n else:\r\n c[2].append(f[i][0])\r\n c[2].append(f[i][1])\r\n elif (len(f[i]) > 2):\r\n if (s == 0):\r\n c[2].append(f[i][2])\r\n c[2].append(f[i][0])\r\n c[2].append(f[i][1])\r\n for j in range(3,len(f[i])):\r\n c[2].append(f[i][j])\r\n else:\r\n for j in range(len(f[i])):\r\n c[2].append(f[i][j])\r\n s = s + 1\r\n print(*(c[2]))", "n = int(input())\njobs = list(map(int, input().split()))\njobs = sorted(list(map(lambda x: (x[1], x[0] + 1), enumerate(jobs))))\nr3 = None\nr21 = None\nr22 = None\nfor i in range(n):\n if i + 2 < n and jobs[i][0] == jobs[i + 1][0] and jobs[i][0] == jobs[i + 2][0]:\n r3 = i\n break\n if i + 1 < n and jobs[i][0] == jobs[i + 1][0]:\n if r21 is None:\n r21 = i\n else:\n r22 = i\n break\njobs = list(map(lambda x: x[1], jobs))\nif r3 is None and r22 is None:\n print('NO')\nelif r3 is not None:\n print('YES')\n print(*jobs)\n print(*(jobs[:r3] + [jobs[r3 + 2]] + [jobs[r3]] + [jobs[r3 + 1]] + jobs[r3 + 3:]))\n print(*(jobs[:r3] + [jobs[r3 + 1]] + [jobs[r3 + 2]] + [jobs[r3]] + jobs[r3 + 3:]))\nelse:\n print('YES')\n print(*jobs)\n print(*(jobs[:r21] + [jobs[r21]] + [jobs[r21 + 1]] + jobs[r21 + 2:r22] + [jobs[r22 + 1]] + [jobs[r22]] + jobs[r22 + 2:]))\n print(*(jobs[:r21] + [jobs[r21 + 1]] + [jobs[r21]] + jobs[r21 + 2:r22] + [jobs[r22]] + [jobs[r22 + 1]] + jobs[r22 + 2:]))", "class ToDo:\r\n def __init__(self, height, _id):\r\n self.height = height\r\n self.id = _id\r\n\r\nN = int(input())\r\nh = list(map(int, input().split()))\r\ntask = []\r\nfor i in range(N):\r\n task.append(ToDo(h[i], i + 1))\r\ntask = sorted(task, key = lambda t: t.height)\r\ncanSwap = [-1] * 2\r\ncase = 0\r\nfor i in range(0, N - 1):\r\n if task[i].height == task[i + 1].height:\r\n canSwap[case] = i\r\n case += 1\r\n if case == 2:\r\n break\r\n\r\nif case != 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n for i in range(N):\r\n print(task[i].id, end = \" \")\r\n print()\r\n\r\n task[canSwap[0]].id, task[canSwap[0] + 1].id = task[canSwap[0] + 1].id, task[canSwap[0]].id\r\n for i in range(N):\r\n print(task[i].id, end = \" \")\r\n print()\r\n\r\n task[canSwap[1]].id, task[canSwap[1] + 1].id = task[canSwap[1] + 1].id, task[canSwap[1]].id\r\n for i in range(N):\r\n print(task[i].id, end = \" \")", "input()\r\nt=sorted(enumerate(map(int,input().split()),1),key=lambda x: x[1])\r\np=[str(x[0]) for x in t]\r\nq=['YES',' '.join(p)]\r\nfor i in range(len(p)-1):\r\n if t[i][1]==t[i+1][1]:\r\n p[i],p[i + 1]=p[i+1],p[i]\r\n q.append(' '.join(p))\r\n if len(q)>3: break\r\nprint('\\n'.join(q) if len(q)>3 else 'NO')", "n = int(input())\r\nl = list(map(int, input().split()))\r\na = []\r\nfor i in range(n):\r\n a.append((l[i], i + 1))\r\n\r\na.sort()\r\ncnt = 0\r\ni = 0\r\nmaxi = 0;\r\nwhile i < n:\r\n c = 0\r\n j = i\r\n while i < n: \r\n if a[i][0] == a[j][0]:\r\n c += 1\r\n else:\r\n break\r\n i += 1\r\n if c > 1:\r\n cnt += 1\r\n maxi = max(c, maxi)\r\n\r\nif cnt < 1 or (cnt == 1 and maxi < 3):\r\n print(\"NO\")\r\nelse:\r\n \r\n print(\"YES\")\r\n\r\n for i in range(n):\r\n print(a[i][1], end = \" \")\r\n print()\r\n\r\n for i in range(1, n):\r\n if a[i][0] == a[i - 1][0]:\r\n a[i], a[i - 1] = a[i - 1], a[i]\r\n break\r\n\r\n for i in range(n):\r\n print(a[i][1], end = \" \")\r\n\r\n print()\r\n\r\n for i in range(n - 1, 0, -1):\r\n if a[i][0] == a[i - 1][0]:\r\n a[i], a[i - 1] = a[i - 1], a[i]\r\n break\r\n\r\n for i in range(n):\r\n print(a[i][1], end = \" \")\r\n ", "# BLUE_LEC18P01\r\n\r\n\r\ndef solution():\r\n N = int(input())\r\n\r\n tasks = list(map(int, input().split()))\r\n\r\n markers = {}\r\n\r\n for i in range(N):\r\n if markers.get(tasks[i]) is None:\r\n markers[tasks[i]] = [1]\r\n markers[tasks[i]].append(i)\r\n\r\n possible = False\r\n possible_count = 1\r\n\r\n duplications = []\r\n duplicated_keys = []\r\n for key, marker in markers.items():\r\n if len(marker) == 3:\r\n possible_count *= 2\r\n duplications.append(marker)\r\n duplicated_keys.append(key)\r\n if possible_count >= 3:\r\n possible = True\r\n break\r\n\r\n elif len(marker) >= 4:\r\n possible = True\r\n duplications = [marker]\r\n duplicated_keys = [key]\r\n break\r\n\r\n if not possible:\r\n print('NO')\r\n return\r\n\r\n print('YES')\r\n tasks.sort()\r\n\r\n if len(duplications) == 2:\r\n\r\n for i in range(N):\r\n print(markers[tasks[i]][markers[tasks[i]][0]] + 1, end=' ')\r\n if markers[tasks[i]][0] == len(markers[tasks[i]]) - 1:\r\n markers[tasks[i]][0] = 1\r\n else:\r\n markers[tasks[i]][0] += 1\r\n markers[duplicated_keys[0]][2], markers[duplicated_keys[0]][1] = markers[duplicated_keys[0]][1], \\\r\n markers[duplicated_keys[0]][2]\r\n\r\n for marker in markers.values():\r\n marker[0] = 1\r\n print()\r\n for i in range(N):\r\n print(markers[tasks[i]][markers[tasks[i]][0]] + 1, end=' ')\r\n if markers[tasks[i]][0] == len(markers[tasks[i]]) - 1:\r\n markers[tasks[i]][0] = 1\r\n else:\r\n markers[tasks[i]][0] += 1\r\n for marker in markers.values():\r\n marker[0] = 1\r\n print()\r\n\r\n markers[duplicated_keys[1]][2], markers[duplicated_keys[1]][1] = markers[duplicated_keys[1]][1], \\\r\n markers[duplicated_keys[1]][2]\r\n\r\n for i in range(N):\r\n print(markers[tasks[i]][markers[tasks[i]][0]] + 1, end=' ')\r\n if markers[tasks[i]][0] == len(markers[tasks[i]]) - 1:\r\n markers[tasks[i]][0] = 1\r\n else:\r\n markers[tasks[i]][0] += 1\r\n\r\n if len(duplications) == 1:\r\n for i in range(N):\r\n print(markers[tasks[i]][markers[tasks[i]][0]] + 1, end=' ')\r\n if markers[tasks[i]][0] == len(markers[tasks[i]]) - 1:\r\n markers[tasks[i]][0] = 1\r\n else:\r\n markers[tasks[i]][0] += 1\r\n\r\n print()\r\n for marker in markers.values():\r\n marker[0] = 1\r\n markers[duplicated_keys[0]][2], markers[duplicated_keys[0]][1] = markers[duplicated_keys[0]][1], \\\r\n markers[duplicated_keys[0]][2]\r\n\r\n for i in range(N):\r\n print(markers[tasks[i]][markers[tasks[i]][0]] + 1, end=' ')\r\n if markers[tasks[i]][0] == len(markers[tasks[i]]) - 1:\r\n markers[tasks[i]][0] = 1\r\n else:\r\n markers[tasks[i]][0] += 1\r\n\r\n print()\r\n for marker in markers.values():\r\n marker[0] = 1\r\n markers[duplicated_keys[0]][2], markers[duplicated_keys[0]][3] = markers[duplicated_keys[0]][3], \\\r\n markers[duplicated_keys[0]][2]\r\n\r\n for i in range(N):\r\n print(markers[tasks[i]][markers[tasks[i]][0]] + 1, end=' ')\r\n if markers[tasks[i]][0] == len(markers[tasks[i]]) - 1:\r\n markers[tasks[i]][0] = 1\r\n else:\r\n markers[tasks[i]][0] += 1\r\n\r\n\r\nsolution()\r\n", "n=input()\r\na = list(map(int, input().split()))\r\nindex=sorted(range(len(a)), key=lambda k: a[k])\r\na=sorted(a)\r\nfor i in range(len(index)):\r\n index[i]+=1\r\n\r\n\r\ni=1\r\ncount =1\r\nans=list()\r\n\r\n\r\nans.append(index)\r\n\r\n\r\nwhile i <len(a):\r\n if a[i]==a[i-1]:\r\n index[i],index[i-1]=index[i-1],index[i]\r\n ans.append(list(index))\r\n index[i],index[i-1]=index[i-1],index[i]\r\n count+=1\r\n if count==3:\r\n break\r\n i+=1\r\n\r\n\r\nif count==3:\r\n print(\"YES\")\r\n for i in range(3):\r\n for j in range(len(ans[i])):\r\n print(ans[i][j])\r\n print()\r\n\r\nelse:\r\n print (\"NO\")", "n = int(input())\n\ntasks = list(map(int, input().split()))\ntasksTuple = [(i + 1, x) for i,x in enumerate(tasks)] \ntasksTuple.sort(key=lambda tup: tup[1])\npairs = []\nfor i in range(0, len(tasksTuple) - 1):\n\tif tasksTuple[i][1] == tasksTuple[i + 1][1]:\n\t\tpairs.append((tasksTuple[i][0] , tasksTuple[i + 1][0]))\nif len(pairs) >= 2:\n\tprint(\"YES\")\n\tprintedArray = [\"\", \"\", \"\"]\n\tfor i in range(len(tasksTuple)):\n\t\tnumberPrint1 = tasksTuple[i][0]\n\t\tnumberPrint2 = tasksTuple[i][0]\n\t\tnumberPrint3 = tasksTuple[i][0]\n\t\t\n\t\tif tasksTuple[i][0] == pairs[0][0]:\n\t\t\tnumberPrint2 = pairs[0][1]\n\t\tif tasksTuple[i][0] == pairs[0][1]:\n\t\t\tnumberPrint2 = pairs[0][0]\n\n\t\tif tasksTuple[i][0] == pairs[1][0]:\n\t\t\tnumberPrint3 = pairs[1][1]\n\t\tif tasksTuple[i][0] == pairs[1][1]:\n\t\t\tnumberPrint3 = pairs[1][0]\n\n\t\tif i == len(tasksTuple) - 1:\n\t\t\t printedArray[0] = printedArray[0] + str(numberPrint1)\n\t\t\t printedArray[1] = printedArray[1] + str(numberPrint2)\n\t\t\t printedArray[2] = printedArray[2] + str(numberPrint3)\n\t\telse:\n\t\t\tprintedArray[0] = printedArray[0] + str(numberPrint1) + ' '\n\t\t\tprintedArray[1] = printedArray[1] + str(numberPrint2) + ' '\n\t\t\tprintedArray[2] = printedArray[2] + str(numberPrint3) + ' '\n\tfor i in range(len(printedArray)):\n\t\tprint(printedArray[i])\nelse:\n\tprint(\"NO\")", "from collections import Counter\r\n \r\nn = int(input())\r\na = list(map(int, input().split(' ')))\r\ncounter = Counter(a)\r\nextra = 0\r\nfor i in counter:\r\n extra += counter[i] - 1\r\nif extra <= 1:\r\n print('NO')\r\nelse:\r\n b = [(a[i], i + 1) for i in range(n)]\r\n b.sort()\r\n print('YES')\r\n x = [b[i][1] for i in range(n)]\r\n print(' '.join(map(str, x)))\r\n times = 0\r\n for i in range(n - 1):\r\n if b[i][0] == b[i + 1][0]:\r\n tmp = b[i]\r\n b[i] = b[i + 1]\r\n b[i + 1] = tmp\r\n times += 1\r\n x = [b[j][1] for j in range(n)]\r\n print(' '.join(map(str, x)))\r\n if times == 2:\r\n break", "# coding: utf-8\nn = int(input())\ntmp = [int(i) for i in input().split()]\nli = []\nfor i in range(1,n+1):\n li.append([tmp[i-1],i])\nli.sort()\nseq = [str(i[1]) for i in li]\ntwo = []\nthree = []\nfor i in set(tmp):\n cnt = tmp.count(i)\n if cnt == 2:\n two.append(i)\n elif cnt >= 3:\n three.append(i)\nif three:\n pos = seq.index(str(tmp.index(three[0])+1))\n print('YES')\n print(' '.join(seq))\n seq[pos], seq[pos+1] = seq[pos+1], seq[pos]\n print(' '.join(seq))\n seq[pos+1], seq[pos+2] = seq[pos+2], seq[pos+1]\n print(' '.join(seq))\nelif len(two) >= 2:\n pos1 = seq.index(str(tmp.index(two[0])+1))\n pos2 = seq.index(str(tmp.index(two[1])+1))\n print('YES')\n print(' '.join(seq))\n seq[pos1], seq[pos1+1] = seq[pos1+1], seq[pos1]\n print(' '.join(seq))\n seq[pos2], seq[pos2+1] = seq[pos2+1], seq[pos2]\n print(' '.join(seq))\nelse:\n print('NO')\n", "import collections\nimport heapq\nimport sys\nimport math\nimport itertools\nimport bisect\nfrom io import BytesIO, IOBase\nimport os\n######################################################################################\n#--------------------------------------Input-----------------------------------------#\n######################################################################################\n\n\ndef value(): return tuple(map(int, input().split()))\ndef values(): return tuple(map(int, sys.stdin.readline().split()))\ndef inlst(): return [int(i) for i in input().split()]\ndef inlsts(): return [int(i) for i in sys.stdin.readline().split()]\ndef inp(): return int(input())\ndef inps(): return int(sys.stdin.readline())\ndef instr(): return input()\ndef stlst(): return [i for i in input().split()]\n\n\n######################################################################################\n#--------------------------------------code here-------------------------------------#\n######################################################################################\n\ndef solve():\n \n n = inp()\n l=inlst()\n if len(set(l))>n-2:print (\"NO\");return\n print(\"YES\")\n e=sorted(enumerate(l,start=1),key=lambda x:x[1])\n print (*[i for i,j in e])\n tem=1\n for i in range(1,n):\n if tem==3:break\n if e[i][1]==e[i-1][1]:\n e[i],e[i-1]=e[i-1],e[i]\n tem+=1\n print (*[i for i,j in e])\n\n\n \n\n\nif __name__ == \"__main__\":\n solve()\n\n", "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 + 1))\r\n\r\n\r\ndef counting_sort(A, k):\r\n n = len(A)\r\n C = [0] * k\r\n B = [0] * n\r\n one = two = three = -1\r\n for i in range(n):\r\n C[A[i][0]] += 1\r\n if C[A[i][0]] > 2 and three == -1:\r\n three = A[i][0]\r\n\r\n elif C[A[i][0]] > 1:\r\n if one == -1:\r\n one = A[i][0]\r\n\r\n if one != A[i][0] != -1 and two == -1:\r\n two = A[i][0]\r\n\r\n for i in range(1, k):\r\n C[i] += C[i - 1]\r\n\r\n for i in range(n - 1, -1, -1):\r\n C[A[i][0]] -= 1\r\n B[C[A[i][0]]] = A[i]\r\n\r\n return B, one, two, three\r\n\r\n\r\nb, one, two, three = counting_sort(b, 2001)\r\nif one == -1 or two == -1 and three == -1:\r\n print(\"NO\")\r\n\r\nelse:\r\n if one > two:\r\n one, two = two, one\r\n\r\n\r\n def print_sol(b):\r\n for i in range(len(b)):\r\n print(b[i][1], end=\" \")\r\n\r\n print()\r\n\r\n\r\n if three != -1:\r\n three_index = -1\r\n for i in range(n):\r\n if b[i][0] == three:\r\n three_index = i\r\n break\r\n\r\n print(\"YES\")\r\n print_sol(b)\r\n b[three_index], b[three_index + 1] = b[three_index + 1], b[three_index]\r\n print_sol(b)\r\n b[three_index], b[three_index + 2] = b[three_index + 2], b[three_index]\r\n print_sol(b)\r\n\r\n else:\r\n one_index = two_index = -1\r\n for i in range(n):\r\n if b[i][0] == one and one_index == -1:\r\n one_index = i\r\n\r\n elif b[i][0] == two and two_index == -1:\r\n two_index = i\r\n\r\n print(\"YES\")\r\n print_sol(b)\r\n b[one_index], b[one_index + 1] = b[one_index + 1], b[one_index]\r\n print_sol(b)\r\n b[two_index], b[two_index + 1] = b[two_index + 1], b[two_index]\r\n print_sol(b)\r\n", "input()\r\nt = sorted(enumerate(map(int, input().split()), 1), key = lambda x: x[1])\r\np = [str(x[0]) for x in t]\r\nq = ['YES', ' '.join(p)]\r\nfor i in range(len(p) - 1):\r\n if t[i][1] == t[i + 1][1]:\r\n p[i], p[i + 1] = p[i + 1], p[i]\r\n q.append(' '.join(p))\r\n if len(q) > 3: break\r\nprint('\\n'.join(q) if len(q) > 3 else 'NO')", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter , defaultdict\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n# primes = [2,11,101,1009,10007,100003,1000003,10000019,102345689]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n#arr.sort(key=lambda x: (-d[x], x)) Sort with Freq\r\n\r\n#Code\r\n\r\nn = INT()\r\narr = LIST()\r\nd = []\r\nd2 = {}\r\nfor i in range(n):\r\n d.append([i , arr[i]])\r\n if arr[i] not in d2 :\r\n d2[arr[i]]=1\r\n else:\r\n d2[arr[i]]+=1\r\nd.sort(key = lambda x : x[1])\r\n\r\nc = Counter(arr)\r\nv = list(c.values())\r\nv.sort(reverse=True)\r\nflag = False\r\nmx = v[0]\r\nif mx > 2 :\r\n flag = True\r\n\r\nif mx == 2 and v.count(mx) > 1 :\r\n flag = True\r\n\r\nif flag == False:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ans1 = []\r\n ans2 = []\r\n ans3 = []\r\n c = 0\r\n i = 0\r\n while i < n :\r\n x = d[i][1]\r\n y = d[i][0] + 1\r\n if d2[x] == 1 :\r\n ans1.append(y)\r\n ans2.append(y)\r\n ans3.append(y)\r\n i+=1\r\n else:\r\n if c < 2 :\r\n if d2[x] == 2 :\r\n\r\n y2 = d[i + 1][0] + 1\r\n if c == 0 :\r\n ans1+=[y , y2]\r\n ans2+=[y2,y]\r\n ans3+=[y,y2]\r\n else:\r\n ans1 += [y, y2]\r\n ans2 += [y, y2]\r\n ans3 += [y2, y]\r\n c+=1\r\n i+=2\r\n else:\r\n y2 = d[i + 1][0] + 1\r\n y3 = d[i+2][0] + 1\r\n ans1+=[y,y2,y3]\r\n ans2+=[y2,y,y3]\r\n ans3+=[y3,y2,y]\r\n c+=1\r\n i+=3\r\n else:\r\n ans1.append(y)\r\n ans2.append(y)\r\n ans3.append(y)\r\n i+=1\r\n\r\n print(*ans1)\r\n print(*ans2)\r\n print(*ans3)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "N = int(input())\r\nL = list(map(int, input().split(' ')))\r\nD = {}\r\nstate = 0\r\nfor i in L :\r\n if i in D : state += 1\r\n else : D[i] = 1\r\n\r\nif state < 2 : print(\"NO\")\r\nelse :\r\n print(\"YES\")\r\n res1 = \"\"\r\n res2 = \"\"\r\n res3 = \"\"\r\n K = [[L[i],i] for i in range(len(L))]\r\n K.sort(key = lambda x : x[0])\r\n for i in K :\r\n res1 += str(i[1]+1)+\" \"\r\n for i in range(len(K)-1) :\r\n if K[i][0] == K[i+1][0] :\r\n K[i][1], K[i+1][1] = K[i+1][1], K[i][1]\r\n if res2 == '' :\r\n for j in K : res2 += str(j[1]+1)+\" \"\r\n elif res3 == '' :\r\n for j in K : res3 += str(j[1]+1)+\" \"\r\n if res3 != '' : break\r\n print(res1)\r\n print(res2)\r\n print(res3)", "# بسم الله الرحمن الرحيم\r\ndef main():\r\n n = int(input())\r\n difficulities = [int(i) for i in input().split()]\r\n for i in range(n):\r\n difficulities[i] = (i+1, difficulities[i])\r\n difficulities = sorted(difficulities, key = lambda p: p[1])\r\n\r\n possible_swaps = []\r\n for i in range(1, n):\r\n if difficulities[i][1] == difficulities[i-1][1]:\r\n possible_swaps.append((i, i-1))\r\n if len(possible_swaps) == 2: break\r\n\r\n if len(possible_swaps) == 2: # collect no more than 2\r\n print('YES')\r\n first_plan = []\r\n for i in difficulities:\r\n first_plan.append(i[0])\r\n print(*first_plan)\r\n\r\n second_plan = []\r\n i, j = possible_swaps[0]\r\n difficulities[i], difficulities[j] = difficulities[j], difficulities[i]\r\n for i in difficulities:\r\n second_plan.append(i[0])\r\n print(*second_plan)\r\n i, j = possible_swaps[0]\r\n difficulities[i], difficulities[j] = difficulities[j], difficulities[i]\r\n\r\n third_plan = []\r\n i, j = possible_swaps[1]\r\n difficulities[i], difficulities[j] = difficulities[j], difficulities[i]\r\n for i in difficulities:\r\n third_plan.append(i[0])\r\n print(*third_plan)\r\n i, j = possible_swaps[1]\r\n difficulities[i], difficulities[j] = difficulities[j], difficulities[i]\r\n else:\r\n print('NO')\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nt = list(enumerate(map(int, input().split()), 1))\r\nt.sort(key = lambda x: x[1])\r\ni = 0\r\nwhile i < n - 1:\r\n if t[i][1] == t[i + 1][1]: break\r\n i += 1\r\nj = i + 1\r\nwhile j < n - 1:\r\n if t[j][1] == t[j + 1][1]: break\r\n j += 1\r\nif j > n - 2: print('NO')\r\nelse:\r\n print('YES')\r\n t = [str(i) for i, j in t]\r\n print(' '.join(t))\r\n t[i], t[i + 1] = t[i + 1], t[i]\r\n print(' '.join(t))\r\n t[j], t[j + 1] = t[j + 1], t[j]\r\n print(' '.join(t))", "n = int(input())\r\n\r\nh = list(map(int, input().split()))\r\n\r\ntasks = [(h[i], i + 1) for i in range(n)]\r\ntasks.sort()\r\n\r\nswaps = []\r\nfor i in range(1, n):\r\n if len(swaps) >= 2:\r\n break\r\n if tasks[i - 1][0] == tasks[i][0]:\r\n swaps.append((i - 1, i))\r\n \r\nif len(swaps) < 2:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\ndef print_plan(tasks):\r\n for task in tasks:\r\n print(task[1], end = ' ')\r\n print()\r\nprint_plan(tasks)\r\ntasks[swaps[0][0]], tasks[swaps[0][1]] = tasks[swaps[0][1]], tasks[swaps[0][0]] \r\nprint_plan(tasks)\r\ntasks[swaps[1][0]], tasks[swaps[1][1]] = tasks[swaps[1][1]], tasks[swaps[1][0]] \r\nprint_plan(tasks)", "\"\"\"\r\n https://codeforces.com/problemset/problem/471/B\r\n\"\"\"\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n h = list(map(int, input().split()))\r\n h = [[h[i], i + 1] for i in range(n)]\r\n\r\n h = sorted(h, key=lambda x: x[0])\r\n\r\n combination = 1\r\n count = 1\r\n flag = False\r\n for i in range(1, n):\r\n if h[i][0] == h[i - 1][0]:\r\n count += 1\r\n else:\r\n combination *= count\r\n count = 1\r\n\r\n if combination * count >= 3: \r\n flag = True\r\n\r\n if not flag:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n # Plan 1\r\n for i in range(n):\r\n print(h[i][1], end=\" \")\r\n print()\r\n # Plan 2\r\n position = 0\r\n for i in range(1, n):\r\n if h[i][0] == h[i - 1][0]:\r\n h[i], h[i - 1] = h[i - 1], h[i]\r\n position = i\r\n break\r\n for i in range(n):\r\n print(h[i][1], end=\" \")\r\n print()\r\n # Plan 3\r\n for i in range(position + 1, n):\r\n if h[i][0] == h[i - 1][0]:\r\n h[i], h[i - 1] = h[i - 1], h[i]\r\n break\r\n for i in range(n):\r\n print(h[i][1], end=\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from functools import reduce\r\nfrom itertools import permutations\r\nfrom sys import setrecursionlimit\r\nsetrecursionlimit(100000)\r\n\r\nresult = 0\r\n\r\ndef gen(n, ans = []):\r\n global result\r\n if not n:\r\n print(*ans)\r\n result += 1\r\n return\r\n if result >= 3:\r\n return\r\n for y in permutations(c[-n]):\r\n gen(n - 1, ans + list(y))\r\n if result >= 3:\r\n return\r\n\r\nn, a, c = int(input()), list(map(int, input().split())), {}\r\nfor i in range(n):\r\n if a[i] not in c:\r\n c[a[i]] = []\r\n c[a[i]].append(i + 1)\r\nc = [c[x] for x in sorted(set(a))]\r\nif reduce(lambda a, b: (a if type(a) == int else len(a)) * (b if type(b) == int else len(b)), c, 1) < 3:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n gen(len(c))\r\n", "n = int(input())\r\nh=[[0, i+1] for i in range(n)]\r\na=list(map(int, input().split()))\r\nfor i in range(n):\r\n h[i][0] = a[i]\r\nh.sort(key = lambda x : x[0])\r\ncnt = 0\r\nfor i in range(n-1):\r\n if h[i][0]==h[i+1][0]:\r\n cnt+=1\r\nif cnt < 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n swap1, swap2 = -1, -1\r\n for i in range(n-1):\r\n if swap1 == -1 and h[i][0] == h[i+1][0]:\r\n swap1 = i\r\n elif swap1 != -1 and swap2 == -1 and h[i][0] == h[i+1][0]:\r\n swap2 = i\r\n break\r\n for i in range(n):\r\n print(h[i][1], end=' ')\r\n print('')\r\n for i in range(swap1):\r\n print(h[i][1], end=' ')\r\n print(h[swap1+1][1], h[swap1][1], end=' ')\r\n for i in range(swap1+2, n):\r\n print(h[i][1], end=' ')\r\n print('')\r\n for i in range(swap2):\r\n print(h[i][1], end=' ')\r\n print(h[swap2+1][1], h[swap2][1], end=' ')\r\n for i in range(swap2+2, n):\r\n print(h[i][1], end=' ')", "N = int(input())\r\nh = list(map(int, input().split()))\r\n\r\nh_dict = dict()\r\n\r\nh_count = dict()\r\n\r\nfor i in range(N):\r\n h_dict[i + 1] = h[i]\r\nh_dict_sorted = sorted(h_dict.items(), key=lambda kv: kv[1])\r\n\r\nfor i in range(N):\r\n if h[i] not in h_count:\r\n h_count[h[i]] = 1\r\n else:\r\n h_count[h[i]] += 1\r\n\r\nh_count_sorted = sorted(h_count.items(), key=lambda kv: kv[1])\r\n\r\ntotal = 0\r\n\r\ncan_swap = []\r\n\r\nfor (key, value) in h_count_sorted:\r\n if total >= 3:\r\n break\r\n if value >= 2:\r\n can_swap.append((key, value))\r\n total += value\r\n\r\ndef print_result_list(current_l, c_swap):\r\n global max_print\r\n new_list = current_l\r\n c_key, c_value = c_swap\r\n count_swap = 0\r\n for i in range(len(current_l)):\r\n current_l_key, current_l_value = current_l[i]\r\n if max_print == 3:\r\n break\r\n if count_swap < c_value - 1 and c_key == current_l_value:\r\n new_list[i], new_list[i + 1] = new_list[i + 1], new_list[i]\r\n count_swap += 1\r\n max_print += 1\r\n print(' '.join([str(key) for (key, value) in new_list]))\r\n\r\nmax_print = 1 \r\n\r\nif total < 3:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(' '.join([str(key) for (key, value) in h_dict_sorted]))\r\n\r\n print_result_list(h_dict_sorted, can_swap[0])\r\n if len(can_swap) > 1:\r\n print_result_list(h_dict_sorted, can_swap[1])", "n = int(input())\r\narr = sorted(enumerate(map(int, input().split()), 1), key=lambda x: x[1])\r\nans = [str(x[0]) for x in arr]\r\nq = ['YES', ' '.join(ans)]\r\nfor i in range(n-1):\r\n if arr[i][1] == arr[i+1][1]:\r\n ans[i], ans[i+1] = ans[i+1], ans[i]\r\n q.append(' '.join(ans))\r\n if len(q) > 3:\r\n break\r\nprint('\\n'.join(q) if len(q) > 3 else \"NO\")", "n = int(input())\narr = [int(i) for i in input().split()]\nfor i in range(n):\n arr[i] = (arr[i], i + 1)\narr.sort()\nb = False\nz = 0\nk = 0\nr = 0\nfor i in range(n):\n j = i\n while j < n and arr[j][0] == arr[i][0]:\n j += 1\n if j - i > 2:\n z = i\n r = 3\n break\n if j - i == 2:\n if b:\n r = 2\n k = i\n break\n else:\n z = i\n b = True\n i = j - 1\nelse:\n print('NO')\nif r == 3:\n print('YES')\n for i in range(n):\n print(arr[i][1], end = ' ')\n print()\n\n for i in range(z):\n print(arr[i][1], end = ' ')\n print(arr[z + 1][1], arr[z + 2][1], arr[z][1], end = ' ')\n for i in range(z + 3, n):\n print(arr[i][1], end = ' ')\n print()\n\n for i in range(z):\n print(arr[i][1], end = ' ')\n print(arr[z + 2][1], arr[z + 1][1], arr[z][1], end = ' ')\n for i in range(z + 3, n):\n print(arr[i][1], end = ' ')\nelif r == 2:\n print('YES')\n for i in range(n):\n print(arr[i][1], end = ' ')\n print()\n\n for i in range(z):\n print(arr[i][1], end = ' ')\n print(arr[z + 1][1], arr[z][1], end = ' ')\n for i in range(z + 2, n):\n print(arr[i][1], end = ' ')\n print()\n\n for i in range(k):\n print(arr[i][1], end = ' ')\n print(arr[k + 1][1], arr[k][1], end = ' ')\n for i in range(k + 2, n):\n print(arr[i][1], end = ' ')\n", "n = int(input())\r\ndiff = input().split()\r\no=enumerate(map(int,diff),1)\r\ntasks=list(o)\r\ntasks.sort(key = lambda diffi: diffi[1])\r\ni = 0\r\nwhile i < n - 1:\r\n if tasks[i][1] == tasks[i + 1][1]: break\r\n i += 1\r\nj = i + 1\r\nwhile j < n - 1:\r\n if tasks[j][1] == tasks[j + 1][1]: break\r\n j += 1\r\nif j > n - 2: print('NO')\r\nelse:\r\n print('YES')\r\n tasks = [str(i) for i, j in tasks]\r\n print(' '.join(tasks))\r\n tasks[i], tasks[i + 1] = tasks[i + 1], tasks[i]\r\n print(' '.join(tasks))\r\n tasks[j], tasks[j + 1] = tasks[j + 1], tasks[j]\r\n print(' '.join(tasks))\r\n", "n,a,q,w,r=int(input()),list(map(int,input().split())),[],[],[0]\r\nfor i in range(n):q.append([a[i],i+1])\r\nq.sort()\r\nfor i in range(1,n):\r\n if q[i][0]==q[i-1][0]:r[0]+=1;r.append(i+1)\r\n if r[0]==2:break\r\nfor i in q:w.append(i[1])\r\nif r[0]==2:\r\n print(\"YES\")\r\n print(*w)\r\n for i in range(1,3):w[r[i]-1],w[r[i]-2]=w[r[i]-2],w[r[i]-1];print(*w)\r\nelse:print(\"NO\")", "n = int(input())\r\nx = list(map(int, input().split()))\r\nd = dict()\r\ncnt = []\r\nstore = [[] for i in range (2000 + 1)]\r\nfor i in range (len(x)):\r\n if x[i] not in d:\r\n d[x[i]] = len(d)\r\n cnt.append(1)\r\n else:\r\n cnt[d[x[i]]] += 1\r\n store[x[i]].append(i+1)\r\n\r\ntimes = 1\r\nfor i in cnt:\r\n times = times * i\r\nif times >= 3:\r\n print('YES')\r\n task1 = []\r\n temp = []\r\n for i in range (len(store)):\r\n if len(store[i]) != 0:\r\n temp.append([])\r\n for j in range (len(store[i])):\r\n temp[-1].append(len(task1))\r\n task1.append(store[i][j])\r\n for i in range (len(task1)):\r\n print(task1[i], end = ' ')\r\n print()\r\n cnt = 0\r\n res = []\r\n for i in range (len(temp)):\r\n if len(temp[i]) > 1 and len(res) < 2:\r\n for j in range(len(temp[i]) - 1):\r\n tmp = task1[:]\r\n tmp[temp[i][j]], tmp[temp[i][j + 1]] = tmp[temp[i][j + 1]], tmp[temp[i][j]]\r\n res.append(tmp)\r\n if len(res) >= 2:\r\n break\r\n for i in range(2):\r\n for j in res[i]:\r\n print(j, end = ' ')\r\n print()\r\nelse:\r\n print('NO')\r\n\r\n# 1 1 3 3\r\n# 1 4 2 3\r\n\r\n# for i in range(..):\r\n# for j in range(i + 1, ...):\r\n# if a[i].val == a[j].val:\r\n# tmp = a[:]\r\n# tmp[i], tmp[j] = tmp[j], tmp[i]\r\n# res.append(tmp)\r\n ", "import sys\r\nimport math\r\n \r\nn = int(sys.stdin.readline())\r\nhn = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\na = []\r\nb = []\r\nc = []\r\n\r\nd = dict()\r\nfor i in range(n):\r\n if hn[i] in d:\r\n d[hn[i]].append(i + 1)\r\n else:\r\n d[hn[i]] = [i + 1]\r\n \r\ny = list(d.keys())\r\ny.sort()\r\n\r\nf = 0\r\nfor i in y:\r\n if(len(d[i]) > 2):\r\n k = d[i]\r\n a.append(k[0])\r\n a.append(k[1])\r\n a.append(k[2])\r\n a.extend((k[3:]))\r\n b.append(k[1])\r\n b.append(k[0])\r\n b.append(k[2])\r\n b.extend((k[3:]))\r\n c.append(k[2])\r\n c.append(k[1])\r\n c.append(k[0])\r\n c.extend((k[3:]))\r\n f += 2\r\n elif(len(d[i]) == 2):\r\n k = d[i]\r\n if(f % 2 != 0):\r\n a.append(k[0])\r\n a.append(k[1])\r\n b.append(k[1])\r\n b.append(k[0])\r\n c.append(k[0])\r\n c.append(k[1])\r\n else:\r\n a.append(k[0])\r\n a.append(k[1])\r\n b.append(k[1])\r\n b.append(k[0])\r\n c.append(k[1])\r\n c.append(k[0])\r\n \r\n f += 1\r\n else:\r\n a.append(d[i][0])\r\n b.append(d[i][0])\r\n c.append(d[i][0])\r\n\r\nif(f > 1):\r\n print(\"YES\")\r\n print(\" \".join([str(x) for x in a])) \r\n print(\" \".join([str(x) for x in b])) \r\n print(\" \".join([str(x) for x in c])) \r\nelse:\r\n print(\"NO\") ", "n = int(input())\r\ntask = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n task[i] = (task[i], i+1)\r\nswapCnt = 0\r\ntask.sort()\r\nfor i in range(n-1):\r\n if task[i][0] == task[i+1][0]:\r\n if swapCnt == 0:\r\n sol1 = task.copy()\r\n sol1[i], sol1[i+1] = sol1[i+1], sol1[i]\r\n else:\r\n sol2 = task.copy()\r\n sol2[i], sol2[i+1] = sol2[i+1], sol2[i]\r\n swapCnt+=1\r\n if swapCnt > 1:\r\n break\r\nif (swapCnt > 1):\r\n print(\"YES\")\r\n for x in task:\r\n print(x[1], end=\" \")\r\n print()\r\n for x in sol1:\r\n print(x[1], end=\" \")\r\n print()\r\n for x in sol2:\r\n print(x[1], end=\" \")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n,inp = int(input()),input().split(\" \")\r\ndict = [ [i,int(inp[i])] for i in range(n)]\r\ndict.sort(key=lambda i: i[1])\r\nval = [i[1] for i in dict]\r\nf = [i[0]+1 for i in dict]\r\ni = p = 0\r\nif len(val) - len(set(val)) < 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(\" \".join(map(str,f)))\r\n for i in range(n):\r\n if val[i:].count(val[i]) >= 2:\r\n if p==0:\r\n s = f[:]\r\n s[i],s[i+1] = s[i+1],s[i]\r\n p = 1\r\n print(\" \".join(map(str,s)))\r\n else:\r\n t = s[:]\r\n t[i],t[i+1] = t[i+1],t[i]\r\n print(\" \".join(map(str,t)))\r\n break", "n=int(input())\r\nx=list(map(int,input().split()))\r\nif n>=len(set(x))+2:\r\n print(\"YES\")\r\n y=[]\r\n for i in range(n):\r\n y.append([x[i],i+1])\r\n y.sort()\r\n y.sort(key=lambda i:i[0])\r\n for i in range(n):\r\n print(y[i][1],end=\" \")\r\n ind=1\r\n print(\"\")\r\n for i in range(1,n):\r\n if y[i][0]==y[i-1][0]:\r\n y[i],y[i-1]=y[i-1],y[i]\r\n ind=i+1\r\n break\r\n for i in range(n):\r\n print(y[i][1],end=\" \")\r\n print(\"\")\r\n for i in range(ind,n):\r\n if y[i][0]==y[i-1][0]:\r\n y[i],y[i-1]=y[i-1],y[i]\r\n for i in range(n):\r\n print(y[i][1],end=\" \")\r\n print(\"\")\r\nelse:\r\n print(\"NO\")", "from itertools import permutations\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nd2={}\r\nres=[]\r\nc=0\r\ndef bf(x,indeks=0):\r\n global c\r\n if c < 3:\r\n if indeks == le:\r\n for i in res:\r\n print(*i,end=\" \")\r\n print()\r\n c+=1\r\n else:\r\n for i in permutations(x[indeks],len(x[indeks])):\r\n res.append(i)\r\n bf(x,indeks+1)\r\n res.pop()\r\n if c >= 3:\r\n break\r\nfor i in range(len(l)):\r\n try:\r\n d[l[i]].append(i+1)\r\n d2[l[i]]+=1\r\n except:\r\n d[l[i]]=[i+1]\r\n d2[l[i]]=1\r\n\r\nr=1\r\nfor i in d2.values():\r\n r*=i\r\nif r < 3:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n p=dict(sorted(d.items(), key=lambda item: item[0]))\r\n k=list(p.values())\r\n le=len(k)\r\n bf(k)\r\n\r\n", "n = int(input());\r\ndifficulties = list(map(int, input().split()));\r\nsd = sorted([[difficulties[i], i] for i in range(n)], key = lambda k: k[0]);\r\nt = 0;\r\nbk = False;\r\nfor i in range(0, n-1):\r\n if(sd[i][0] == sd[i+1][0]):\r\n t += 1;\r\n if(t == 2):\r\n print(\"YES\");\r\n print(*[sd[j][1]+1 for j in range(0, n)]);\r\n t = 0;\r\n for k in range(0, n-1):\r\n if(sd[k][0] == sd[k+1][0]):\r\n t += 1;\r\n s = sd[k+1][1];\r\n sd[k+1][1] = sd[k][1];\r\n sd[k][1] = s;\r\n print(*[sd[k][1]+1 for k in range(0, n)]);\r\n s = sd[k+1][1];\r\n sd[k+1][1] = sd[k][1];\r\n sd[k][1] = s;\r\n if(t == 2):\r\n bk = True;\r\n break;\r\n if(bk == True):\r\n break;\r\nif(not bk):\r\n print(\"NO\");" ]

{"inputs": ["4\n1 3 3 1", "5\n2 4 1 4 8", "8\n1 5 4 12 7 2 10 11", "6\n5 1 2 5 2 4", "1\n1083", "10\n5 5 5 5 5 5 5 5 5 5", "6\n3 8 3 9 3 10", "19\n895 1302 724 952 340 952 939 1302 724 952 939 340 340 1844 770 976 435 1302 1302", "7\n766 766 1477 766 107 1774 990", "11\n1552 1010 1552 1248 1550 388 1541 1010 613 1821 388", "15\n688 848 1462 688 12 1336 1336 1113 1462 1074 659 1384 12 12 1074", "19\n65 117 159 402 117 402 65 1016 1850 1265 854 159 347 1501 117 805 854 117 1265", "3\n1282 101 420", "3\n1 1 1", "2\n1 1", "1\n1"], "outputs": ["YES\n1 4 2 3 \n4 1 2 3 \n4 1 3 2 ", "NO", "NO", "YES\n2 3 5 6 1 4 \n2 5 3 6 1 4 \n2 5 3 6 4 1 ", "NO", "YES\n1 2 3 4 5 6 7 8 9 10 \n2 1 3 4 5 6 7 8 9 10 \n2 3 1 4 5 6 7 8 9 10 ", "YES\n1 3 5 2 4 6 \n3 1 5 2 4 6 \n3 5 1 2 4 6 ", "YES\n5 12 13 17 3 9 15 1 7 11 4 6 10 16 2 8 18 19 14 \n12 5 13 17 3 9 15 1 7 11 4 6 10 16 2 8 18 19 14 \n12 13 5 17 3 9 15 1 7 11 4 6 10 16 2 8 18 19 14 ", "YES\n5 1 2 4 7 3 6 \n5 2 1 4 7 3 6 \n5 2 4 1 7 3 6 ", "YES\n6 11 9 2 8 4 7 5 1 3 10 \n11 6 9 2 8 4 7 5 1 3 10 \n11 6 9 8 2 4 7 5 1 3 10 ", "YES\n5 13 14 11 1 4 2 10 15 8 6 7 12 3 9 \n13 5 14 11 1 4 2 10 15 8 6 7 12 3 9 \n13 14 5 11 1 4 2 10 15 8 6 7 12 3 9 ", "YES\n1 7 2 5 15 18 3 12 13 4 6 16 11 17 8 10 19 14 9 \n7 1 2 5 15 18 3 12 13 4 6 16 11 17 8 10 19 14 9 \n7 1 5 2 15 18 3 12 13 4 6 16 11 17 8 10 19 14 9 ", "NO", "YES\n1 2 3 \n2 1 3 \n2 3 1 ", "NO", "NO"]}

UNKNOWN

PYTHON3

CODEFORCES

50

8bb5b84ac8b7a2f06ed0f1e18350f2ef

none

One of Timofey's birthday presents is a colourbook in a shape of an infinite plane. On the plane *n* rectangles with sides parallel to coordinate axes are situated. All sides of the rectangles have odd length. Rectangles cannot intersect, but they can touch each other. Help Timofey to color his rectangles in 4 different colors in such a way that every two rectangles touching each other by side would have different color, or determine that it is impossible. Two rectangles intersect if their intersection has positive area. Two rectangles touch by sides if there is a pair of sides such that their intersection has non-zero length The first line contains single integer *n* (1<=≤<=*n*<=≤<=5·105) — the number of rectangles. *n* lines follow. The *i*-th of these lines contains four integers *x*1, *y*1, *x*2 and *y*2 (<=-<=109<=≤<=*x*1<=<<=*x*2<=≤<=109, <=-<=109<=≤<=*y*1<=<<=*y*2<=≤<=109), that means that points (*x*1,<=*y*1) and (*x*2,<=*y*2) are the coordinates of two opposite corners of the *i*-th rectangle. It is guaranteed, that all sides of the rectangles have odd lengths and rectangles don't intersect each other. Print "NO" in the only line if it is impossible to color the rectangles in 4 different colors in such a way that every two rectangles touching each other by side would have different color. Otherwise, print "YES" in the first line. Then print *n* lines, in the *i*-th of them print single integer *c**i* (1<=≤<=*c**i*<=≤<=4) — the color of *i*-th rectangle. Sample Input 8 0 0 5 3 2 -1 5 0 -3 -4 2 -1 -1 -1 2 0 -3 0 0 5 5 2 10 3 7 -3 10 2 4 -2 7 -1 Sample Output YES 1 2 2 3 2 2 4 1

[ "n = int(input())\r\nprint(\"YES\")\r\nfor i in range(n):\r\n x1, y1, x2, y2 = input().split()\r\n x1 = int(x1)\r\n y1 = int(y1)\r\n print((x1 % 2) * 2 + (y1 % 2) + 1)", "p = int(input())\r\n\r\nprint(\"YES\")\r\n\r\nfor i in range(p):\r\n a, b, c, d = [abs(int(i)) for i in input().split()]\r\n if a % 2 == 0:\r\n print(\"1\" if b % 2 == 0 else \"2\")\r\n else:\r\n print(\"3\" if b % 2 == 0 else \"4\")", "from sys import stdin,stdout\r\nn = int(stdin.readline())\r\na = [0 for i in range(n)]\r\nfor i in range(n):\r\n inp = stdin.readline().split()\r\n x = int(inp[0])\r\n y = int(inp[1])\r\n a[i] = 2 * (x % 2) + (y % 2) + 1\r\nstdout.write(\"YES\")\r\nstdout.write('\\n')\r\nstdout.write(\"\\n\".join(str(i) for i in a))", "n = int(input())\r\nprint(\"YES\")\r\nfor i in range(n):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n print((x1 % 2) * 2 + (y1 % 2) + 1)", "def f():\n\tn = int(input())\n\ta = [1,2,3,4]\n\tprint(\"YES\")\n\tfor i in range(n):\n\t\tx = input().split()\n\t\tx = [int(j)%2 for j in x]\n\t\tprint(a[x[2]*2+x[3]])\nf()", "n = int(input())\r\nprint(\"YES\")\r\nfor i in range(n):\r\n a, b, c, d = map(int, input().split())\r\n a = abs(a)\r\n b = abs(b)\r\n print((a % 2) * 2 + b % 2 + 1)", "n=int(input())\n\nprint(\"YES\")\n\nwhile n:\n\n\t(x,y,a,b)=list(map(int, input().split()))\n\n\tprint(1+x%2+2*(y%2))\n\n\tn=n-1\n\n\n\n# Made By Mostafa_Khaled", "print('YES')\r\nfor _ in range(int(input())):\r\n a,b,c,d = map(int,input().split())\r\n print((2*(a%2))+(b%2)+1)", "print('YES')\r\nfor i in range(int(input())):\r\n\ta, b, c, d = map(int, input().split())\r\n\tprint(1 + abs(a) % 2 + abs(b) % 2 * 2)", "n = int(input())\r\nprint(\"YES\")\r\nfor i in range(n):\r\n x1, y1, x2, y2 = input().split()\r\n print((int(x1) % 2) * 2 + (int(y1) % 2) + 1)", "n = int(input())\r\nprint('YES')\r\nfor _ in range(n):\r\n x, y, *z = list(map(int, input().split()))\r\n print((x & 1) * 2 + (y & 1) + 1)", "print('YES')\r\nfor i in range(int(input())):\r\n x, y, a, b = [int(x) for x in input().split()]\r\n print(x % 2 + y % 2 * 2 + 1)", "import sys\r\nv = [int(x) for x in sys.stdin.read().split()]\r\nprint(\"YES\")\r\nfor i in range(v[0]): print(1+(v[4*i+1]&1)+2*(v[4*i+2]&1))", "\nimport sys\n\n\ndef rl(): return sys.stdin.readline()\ndef ni(): return int(rl())\ndef nsa(): return rl().split()\ndef nia(): return [int(x) for x in nsa()]\ndef nnia(n): return [nia() for _ in range(n)]\n\n\nn = ni()\nrects = nnia(n)\n\nprint('YES')\nfor r in rects:\n print((r[0]%2)*2+(r[1]%2)+1)\n", "import math\nimport sys\nn = int(input())\ncolor = []\nfor i in range(n):\n x1, y1, x2, y2 = map(int, input().split())\n col = 0\n if abs(x1) % 2 == 0:\n col += 1\n if abs(y1) % 2 == 0:\n col += 2\n color.append(str(col + 1))\nprint('YES')\nprint('\\n'.join(color))\n", "n = int (input())\r\nprint ('YES')\r\nfor i in range (0, n):\r\n a, b, c, d = [int(x) for x in (input().split())]\r\n print (1 + a%2 + (b%2) * 2)", "n = int(input())\r\nprint('YES')\r\nfor _ in range(n):\r\n\tx1, y1, x2, y2 = [int(el) for el in input().split()]\r\n\tprint(x1 % 2 + (y1 % 2) * 2 + 1)", "n = int(input())\r\ncoordinates = []\r\nfor i in range(n):\r\n coordinates.append([int(x) % 2 for x in input().split()])\r\nprint('YES')\r\nfor coordinate in coordinates:\r\n x1, y1, x2, y2 = coordinate\r\n print(2*x2 + y2 + 1)\r\n", "'''plan\r\n noticed that if both upperle\r\n'''\r\nfrom sys import stdin, stdout\r\nn = int(stdin.readline().rstrip())\r\n# n = int(input())\r\ncoordinates = []\r\n# for i in range(n):\r\n # coordinates.append([int(x) % 2 for x in input().split()])\r\nfor i in range(n):\r\n coordinates.append([int(x) % 2 for x in stdin.readline().rstrip().split()])\r\nstdout.write('YES\\n')\r\nfor coordinate in coordinates:\r\n x1, y1, x2, y2 = coordinate\r\n stdout.write(str(2 * x2 + y2 + 1) + '\\n')\r\n", "n=int(input())\r\nprint(\"YES\")\r\nfor i in range(0,n):\r\n a=list(map(int,input().split()))\r\n ans=2*(a[0]&1)+(a[1]&1)+1\r\n print(ans)", "n = int(input())\nrectangles = []\nfor i in range(n):\n a, b, c, d = tuple(map(int,input().split()))\n rectangles.append((a,b))\n\nprint(\"YES\")\nfor i in range(n):\n a,b = rectangles[i][0], rectangles[i][1]\n if a%2 == 0 and b%2 == 0:\n print(1)\n elif a%2 == 0 and b%2 == 1:\n print(2)\n elif a%2 == 1 and b%2 == 0:\n print(3)\n else:\n print(4)\n", "n = int(input())\r\nprint('YES')\r\nfor _ in range(n):\r\n\tx1,y1,x2,y2 = [int(el) for el in input().split()]\r\n\tprint(x1%2+(y1%2)*2+1)", "n = int(input())\r\nprint(\"YES\")\r\nfor i in range(n):\r\n t1, y1, x2, y2 = input().split()\r\n print((int(t1) % 2) * 2 + (int(y1) % 2) + 1)", "print('YES')\r\nfor i in range(int(input())):\r\n t = input().split()\r\n print(int(t[0]) % 2 + int(t[1]) % 2 * 2 + 1)" ]

{"inputs": ["8\n0 0 5 3\n2 -1 5 0\n-3 -4 2 -1\n-1 -1 2 0\n-3 0 0 5\n5 2 10 3\n7 -3 10 2\n4 -2 7 -1", "1\n0 0 1 1", "4\n0 0 1 1\n1 0 2 1\n1 1 2 2\n0 1 1 2", "3\n0 0 1 3\n1 0 4 1\n1 1 2 2", "6\n0 1 1 4\n0 4 1 7\n1 0 2 3\n1 3 2 4\n1 4 2 5\n2 3 3 4", "25\n0 0 7 7\n0 18 7 29\n7 36 12 41\n7 18 12 29\n15 29 26 36\n7 7 12 18\n12 36 15 41\n15 7 26 18\n12 0 15 7\n12 7 15 18\n7 29 12 36\n12 29 15 36\n15 18 26 29\n26 18 27 29\n12 18 15 29\n26 29 27 36\n0 7 7 18\n26 0 27 7\n7 0 12 7\n15 36 26 41\n26 7 27 18\n26 36 27 41\n15 0 26 7\n0 36 7 41\n0 29 7 36", "25\n76 0 85 9\n46 0 55 9\n6 0 13 9\n86 0 95 9\n56 0 65 9\n152 0 157 9\n146 0 151 9\n14 0 21 9\n0 0 1 9\n180 0 189 9\n120 0 125 9\n96 0 99 9\n126 0 133 9\n158 0 169 9\n22 0 27 9\n100 0 107 9\n170 0 179 9\n2 0 5 9\n134 0 141 9\n114 0 119 9\n108 0 113 9\n66 0 75 9\n36 0 45 9\n142 0 145 9\n28 0 35 9", "28\n0 0 3 1\n0 1 1 6\n0 6 1 9\n0 9 1 12\n0 12 1 13\n0 13 3 14\n1 1 2 4\n1 4 2 7\n1 7 2 10\n1 10 2 13\n2 1 3 2\n2 2 3 5\n2 5 3 8\n2 8 3 13\n3 0 6 1\n3 1 4 6\n3 6 4 9\n3 9 4 12\n3 12 4 13\n3 13 6 14\n4 1 5 4\n4 4 5 7\n4 7 5 10\n4 10 5 13\n5 1 6 2\n5 2 6 5\n5 5 6 8\n5 8 6 13", "4\n3 3 10 12\n5 0 14 3\n0 3 3 12\n0 0 5 3", "4\n3 11 12 18\n0 0 1 11\n0 11 3 18\n1 0 8 11"], "outputs": ["YES\n1\n4\n3\n2\n3\n3\n2\n1", "YES\n1", "YES\n1\n3\n4\n2", "YES\n1\n3\n4", "YES\n2\n1\n3\n4\n3\n2", "YES\n1\n1\n3\n3\n4\n4\n1\n4\n1\n2\n4\n2\n3\n1\n1\n2\n2\n1\n3\n3\n2\n1\n3\n1\n2", "YES\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1", "YES\n1\n2\n1\n2\n1\n2\n4\n3\n4\n3\n2\n1\n2\n1\n3\n4\n3\n4\n3\n4\n2\n1\n2\n1\n4\n3\n4\n3", "YES\n4\n3\n2\n1", "YES\n4\n1\n2\n3"]}

UNKNOWN

PYTHON3

CODEFORCES

24

8bbcbb9e2645ba1ed5dd33803c1dee7b

Text Volume

You are given a text of single-space separated words, consisting of small and capital Latin letters. Volume of the word is number of capital letters in the word. Volume of the text is maximum volume of all words in the text. Calculate the volume of the given text. The first line contains one integer number *n* (1<=≤<=*n*<=≤<=200) — length of the text. The second line contains text of single-space separated words *s*1,<=*s*2,<=...,<=*s**i*, consisting only of small and capital Latin letters. Print one integer number — volume of text. Sample Input 7 NonZERO 24 this is zero answer text 24 Harbour Space University Sample Output 5 0 1

[ "a = set()\r\na.add(0)\r\n\r\nn = int(input())\r\ns = input().split()\r\n\r\nc = 0\r\nfor i in s:\r\n\tfor j in i:\r\n\t\tif j.isupper():\r\n\t\t\tc+=1\r\n\ta.add(c)\r\n\tc = 0\r\n\r\na = sorted(a)\r\n\r\nprint(a[-1])", "n = int(input())\r\n\r\na = input().split()\r\n\r\nans = 0\r\n\r\ndef f(s):\r\n res = 0\r\n for i in range(0,len(s)):\r\n if 'A' <= s[i] <= 'Z':\r\n res+=1\r\n return res\r\n\r\nfor i in range(0,len(a)):\r\n ans = max(ans,f(a[i]))\r\n\r\nprint(int(ans))\r\n", "size = int(input())\r\nst = str(input())\r\ncounter = 0\r\nmaximal = 0\r\nfor i in range(0, size):\r\n if st[i] < 'a' and st[i] != ' ':\r\n counter += 1\r\n if st[i] == ' ' or i == (size - 1):\r\n if maximal < counter:\r\n maximal = counter\r\n counter = 0\r\nprint(maximal)", "input()\r\ns = input()\r\nwo = s.split()\r\nmaxim = 0;\r\nfor word in wo:\r\n val = 0\r\n for i in word:\r\n if (i < \"a\"):\r\n val +=1\r\n maxim= max(maxim, val)\r\nprint(maxim)", "inp = int(input())\nmas = list(input().split())\n\nmaxx = 0\n\nfor i in mas:\n now = 0\n for j in i:\n #print(ord(j))\n if ord(j) < 91:\n now += 1\n if maxx < now:\n maxx = now\n\nprint(maxx)\n", "n = input()\r\nl = list(input().split())\r\n\r\nx = []\r\n\r\nfor i in l:\r\n\tv = 0\r\n\t\r\n\tfor j in i:\r\n\t\tif 90 >= ord(j) >= 65:\r\n\t\t\tv += 1\r\n\t\t\t\r\n\tx.append(v)\r\n\t\r\nprint(max(x))", "n = int(input())\ns = input().split()\ncur_min, cur_max = 0, 0\nfor i in range(len(s)):\n for k in range(len(s[i])):\n if s[i][k].istitle():\n cur_min += 1\n if cur_min > cur_max:\n cur_max = cur_min\n cur_min = 0\nprint(cur_max)\n", "import functools as fn\r\n\r\ndef volume(str):\r\n return fn.reduce(lambda a,b : a + b, [1 if c.isupper() else 0 for c in str]) \r\n \r\nn = int(input())\r\n\r\nans = fn.reduce(lambda a,b : a if a > b else b, [volume(s) for s in input().split(' ')])\r\n\r\nprint(ans)", "volumes = []\r\nn = int(input())\r\ns = input()\r\nsk = 0\r\nspaces = 1\r\ntemp = 0\r\nfor i in range(n):\r\n if s[i] == s[i].upper() and s[i] != \" \":\r\n temp += 1\r\n if s[i] == \" \":\r\n volumes.append(temp)\r\n temp = 0\r\n elif i == len(s)-1:\r\n volumes.append(temp)\r\n temp = 0\r\n \r\nprint(max(volumes))\r\n ", "n = int(input())\r\narr=[]\r\ns = input()\r\narr = s.split(' ')\r\narr1=[]\r\nfor x in arr:\r\n v = 0;\r\n for i in x:\r\n if i.isupper():\r\n v = v+1\r\n arr1.append(v)\r\narr1.sort(reverse = True)\r\nprint(arr1[0])\r\n ", "x = input()\nn = input().split()\nmaxCap = 0\ncap = 0\nfor x in n:\n for i in x:\n if i.isupper():\n cap += 1\n if cap > maxCap:\n maxCap = cap\n cap = 0\nprint(maxCap)\n\t\t\t \t\t \t \t \t\t\t \t\t \t\t \t", "x=input()\r\nn=input().split(' ')\r\nans=0\r\nfor i in n:\r\n cur=0\r\n for j in i:\r\n if j>='A' and j<='Z':\r\n cur+=1\r\n ans=max(ans,cur)\r\nprint(ans)", "n= int(input())\r\ns= input()\r\nmas= [\"A\", 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K',\r\n 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']\r\ncountmax = 0\r\nwords= s.split()\r\nfor i in words:\r\n count = 0\r\n for el in i:\r\n if el in mas:\r\n count += 1\r\n if countmax < count:\r\n countmax = count\r\nprint (countmax)", "n=int(input())\r\nstr=list(input())\r\ncnt=0\r\nm=0\r\nfor i in str:\r\n if ord('A')<=ord(i)<=ord('Z'):\r\n cnt+=1\r\n if i==' ':\r\n m=max(cnt,m)\r\n cnt=0\r\nm=max(cnt,m)\r\nprint(m)", "n = input()\r\na = input().split()\r\nmx = 0\r\nfor i in a:\r\n cur = 0\r\n for j in range(len(i)):\r\n if i[j] >= 'A' and i[j] <= 'Z':\r\n cur += 1\r\n mx = max(mx, cur)\r\nprint(mx)", "n = int(input())\nentrada = input()\n\ncount = 0\nv = []\n\nfor c in entrada:\n if c.isupper():\n count+=1\n elif c.isspace():\n v.append(count)\n count = 0\nv.append(count)\nprint(max(v))\n \t\t \t \t \t \t \t\t\t\t \t \t\t \t\t", "tmp = input()\na = input().split()\nans = 0\n\ndef solve(x):\n cnt = 0\n for c in x:\n if 'A'<=c and c<='Z':\n cnt += 1\n return cnt\n\nfor word in a:\n ans = max(ans, solve(word))\nprint(ans)\n", "\r\nnumLetters = input()\r\n\r\nlistOfWords = input()\r\n\r\nmaxCap = 0\r\n\r\nwordList = listOfWords.split()\r\n\r\nfor item in wordList:\r\n numUp = 0\r\n for char in item:\r\n if char.isupper():\r\n numUp += 1\r\n\r\n if numUp > maxCap:\r\n maxCap = numUp\r\n\r\nprint (maxCap)", "a=input()\r\na=input().split()\r\nbest=0\r\nfor i in a:\r\n ans=0\r\n for l in i:\r\n if l>='A' and l<='Z':\r\n ans+=1\r\n if ans>best:\r\n best=ans\r\nprint(best)", "from string import ascii_uppercase as upper\r\n\r\nn = int(input())\r\nstr = input().split(' ')\r\ncnts = []\r\n\r\nfor st in str:\r\n c = 0\r\n for s in st:\r\n if s in upper:\r\n c += 1\r\n cnts.append(c)\r\n\r\nprint(max(cnts))\r\n\r\n", "n, text= input(), input()\r\nprint(max([sum([ch1 != ch2 for ch1, ch2 in zip(word, word.lower())]) for word in text.split()]))\r\n", "n = int(input())\r\nstr_voulve = input().split()\r\nanswer = 0\r\nnumber_upper_word = 0 \r\nfor i in str_voulve:\r\n number_upper_word = 0 \r\n for word in i:\r\n if word.upper() ==word:\r\n number_upper_word+=1\r\n if number_upper_word > answer:\r\n answer = number_upper_word\r\nprint(answer) \r\n", "# http://codeforces.com/problemset/problem/837/A\r\ninput()\r\n\r\nwords=input().split()\r\nprint(max(map(lambda w:sum(map(str.isupper,w)),words)))\r\n", "n = int(input())\na = input().split(\" \")\n\nmaxVolume = 0\nfor word in a:\n counter = 0\n for letter in word:\n if ord(letter) < 91:\n counter += 1\n maxVolume = max(maxVolume,counter)\nprint(maxVolume)\n\t \t \t\t \t\t\t \t \t \t\t \t\t\t\t", "n,l=int(input()),list(map(str,input().split()))\r\nx,y=0,0\r\nfor i in range(len(l)):\r\n for j in l[i]:\r\n if j.isupper():\r\n x=x+1\r\n if x>y:\r\n y=x\r\n x=0;\r\nprint(y)", "n=int(input())\r\na=[i for i in input().split()]\r\n\r\nprint(max([len([c for c in e if c.isupper()]) for e in a]))", "import string\r\ninput()\r\nprint(max([eval(f\"sum([\\\"{x}\\\".count(e) for e in string.ascii_uppercase])\") for x in input().split()]))", "n=int(input())\r\ns=str(input())\r\nlow=0\r\ncount=0\r\nfor i in range(n):\r\n if(s[i]>='A' and s[i]<='Z'):\r\n count=count+1\r\n if count>low:\r\n low=count\r\n if(s[i]==\" \"):\r\n count=0\r\n\r\n\r\nprint(low)\r\n \r\n", "n,s = int(input()),input().split()\r\nmx = 0\r\nfor word in s:\r\n temp = 0\r\n for i in word:\r\n if i.isupper():\r\n temp += 1\r\n mx = max(mx,temp)\r\nprint(mx)\r\n", "n = int(input())\r\nlist1 = input()\r\ncount = 0\r\nlist2 = [0]\r\nfor i in list1:\r\n if i == ' ':\r\n count = 0\r\n list2.append(0)\r\n elif i >= 'A' and i <= 'Z':\r\n count +=1 \r\n list2[len(list2)-1] += 1\r\nprint(max(list2))\r\n\r\n", "n=int(input())\ns=input()\nmaximo=0\ncont=0\nfor i in range(0,n):\n if s[i]==\" \":\n cont=0\n elif ord(s[i]) > 64 and ord(s[i])<91:\n cont+=1\n if cont > maximo:\n maximo=cont\nprint(maximo)\n \t\t\t\t\t \t \t\t \t\t \t \t\t\t\t\t\t\t \t", "a=int(input())\r\ns=input().split()\r\nm=0\r\nfor i in s:\r\n\tv=0\r\n\tfor j in i:\r\n\t\tif ord(j)>64 and ord(j)<91:\r\n\t\t\tv=v+1\r\n\tif v>m:\r\n\t\t\tm=v\r\nprint(m)", "def volume(s):\n\tans = 0 \n\tfor item in s:\n\t\tif item.isupper():\n\t\t\tans += 1\n\treturn ans\n\ninput()\ns = input().split()\nans = 0 \nfor item in s:\n\tans = max(ans,volume(item))\nprint(ans)\n", "n = input()\r\ns = input().split()\r\ntotal = 0\r\nfor i in s:\r\n t = 0\r\n for j in i:\r\n if j.isupper():\r\n t += 1\r\n if total < t:\r\n total = t\r\nprint(total)", "n = int(input())\nphrase = str(input())\nwords = phrase.split(' ')\nvolumes = []\n\ndef get_volume(word):\n v = 0\n for l in word:\n if l.isupper():\n v += 1\n return v\n\nfor word in words:\n volumes.append(get_volume(word))\n\nprint(max(volumes))\n", "n = int(input())\r\nprint(max(sum(map(str.isupper, i)) for i in input().split()))\r\n", "n=int(input())\r\nlist1=[x for x in input().split()]\r\n\r\nif len(list1)==1:\r\n count=0\r\n for i in range(len(list1[0])):\r\n if list1[0][i].isupper():\r\n count+=1\r\n print(count)\r\nelse:\r\n maxCount=0\r\n for i in range(len(list1)):\r\n count=0\r\n for j in range(len(list1[i])):\r\n if list1[i][j].isupper():\r\n count+=1\r\n if count>=maxCount:\r\n maxCount=count\r\n print(maxCount)\r\n", "n = int(input())\r\nx = input()\r\nx = x.split()\r\nm = 0\r\nfor i in range(len(x)):\r\n c = 0\r\n for j in range(len(x[i])):\r\n if(x[i][j].isupper()):\r\n c+=1\r\n m = max(m,c)\r\nprint(m)", "from math import gcd\r\ndef inp():\r\n return int(input())\r\ndef linp():\r\n return list(map(str, input().split(' ')))\r\ndef minp():\r\n return map(int, input().split(' '))\r\nn = inp()\r\na = linp()\r\nb = []\r\nb.append(0)\r\nfor k in a:\r\n cnt = 0\r\n for i in k:\r\n if i.isupper() :\r\n cnt+=1\r\n b.append(cnt)\r\nb = sorted(b)\r\nprint(b[len(b)-1])", "n = int(input())\r\ns = str(input())\r\ncnt = ans = 0\r\n\r\nfor x in s:\r\n if x.isupper():\r\n cnt += 1\r\n elif x == ' ':\r\n cnt = 0\r\n ans = max(ans, cnt)\r\n\r\nprint(ans)", "n=int(input())\r\nl=input().split()\r\nmaxi=0 \r\nfor i in l:\r\n curr=i \r\n maxi=max(maxi,sum(i.isupper() for i in curr))\r\nprint(maxi)", "l = int(input())\r\ns = input().split()\r\nls = [0] * len(s)\r\ndef wv (string):\r\n\tt = 0\r\n\tfor i in range(len(string)):\r\n\t\tif string[i] == string[i].upper():\r\n\t\t\tt = t + 1\r\n\treturn t\r\nfor i in range(len(s)):\r\n\tls[i] = wv(s[i])\r\nls.sort()\r\nprint(ls[len(s)-1])\r\n\r\n", "n=int(input())\r\ns=input().split()\r\nm=0\r\nfor i in s:\r\n c=0\r\n for j in i:\r\n if j.isupper():\r\n c=c+1\r\n m=max(m,c)\r\nprint(m)", "n=int(input())\r\ns=input()\r\n\r\na=[]\r\ncount=0\r\ni=0\r\nwhile(i!=len(s)):\r\n if s[i]!=\" \" and s[i].isupper():\r\n count+=1\r\n i+=1\r\n elif s[i]==\" \":\r\n a.append(count)\r\n count=0\r\n i+=1\r\n else:\r\n i+=1\r\na.append(count)\r\nif len(a)>1:\r\n print(max(a))\r\nelse:\r\n print(*a)", "n=int(input())\r\ns=list(input())\r\nx=[]\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n c+=1\r\n elif s[i]==\" \":\r\n x.append(c)\r\n c=0\r\n x.append(c)\r\nprint(max(x))\r\n \r\n ", "n = int(input())\r\ncad = input()\r\n\r\npals = cad.split(\" \")\r\n\r\nsol=0\r\nsolfinal=0\r\nfor pal in pals:\r\n for c in pal:\r\n if c >= 'A' and c <= 'Z':\r\n sol = sol+1\r\n if sol >= solfinal:\r\n solfinal = sol\r\n\r\n sol=0\r\n\r\nprint(solfinal)\r\n", "a=int(input())\r\nb=input()\r\nc=b.split()\r\nmax=0\r\nfor i in c:\r\n sum=0\r\n for k in i:\r\n if k.isupper():\r\n sum+=1\r\n if sum>max:\r\n max=sum\r\nprint(max)\r\n \r\n \r\n", "n=int(input())\r\ns=input().split()\r\nans=0\r\nfor i in s:\r\n cnt=0\r\n for c in i:\r\n if(c.isupper()):\r\n cnt+=1\r\n ans=max(ans,cnt)\r\nprint(ans)\r\n", "n = input()\r\ns = input()\r\n\r\ndef f(s):\r\n return sum(1 if x.isupper() else 0 for x in s)\r\n\r\nt = max(f(x) for x in s.split())\r\nprint(t)", "input()\r\nprint(max([len(\"\".join(filter(lambda X: X.isupper(), i))) for i in list(input().split())]))\r\n", "n=int(input())\r\ns=input().split()\r\na=[]\r\nfor val in s:\r\n count=0\r\n for j in range (len(val)):\r\n if 'A'<=val[j]<='Z':\r\n count+=1 \r\n a.append(count)\r\n \r\nprint(max(a))", "length=input()\r\nl=list(input().split())\r\na=[]\r\nfor i in l:\r\n n=0\r\n for j in i:\r\n if ord(j)<91:\r\n n=n+1\r\n a.append(n)\r\nprint(max(a))", "n = int(input())\r\nwords = input().split(\" \")\r\nres = 0\r\nfor word in words:\r\n temp = sum(1 for c in word if c.isupper())\r\n res = max(res, temp)\r\n\r\nprint(res)", "def main():\n N = int(input())\n S = input()\n\n cnt = 0\n max_ = 0\n for s in S:\n if 'A' <= s <= 'Z':\n cnt += 1\n elif s == ' ':\n max_ = max(max_, cnt)\n cnt = 0\n max_ = max(max_, cnt)\n\n print(max_)\n\nmain()\n", "# A. Text Volume\n\nn = int(input())\ns = list(map(str, input().split()))\n\nmax_volume = 0\nfor word in s:\n volume = 0\n for ch in word:\n if ch.isupper():\n volume += 1\n max_volume = max(max_volume, volume)\n\nprint(max_volume)\n", "n = int(input())\r\ns = input()\r\nc = 0\r\nt = 0\r\nfor i in range(n):\r\n\tif(s[i]>= 'A' and s[i]<= 'Z'):\r\n\t\tc+=1\r\n\tif(s[i]== ' '):\r\n\t\tt = max(t,c)\r\n\t\tc = 0\r\nt = max(t,c)\r\nprint(t)", "n = int(input())\r\ns = input().split()\r\nres = 0\r\n\r\nfor palavra in s:\r\n ss = 0\r\n for c in palavra:\r\n if c.isupper():\r\n ss += 1\r\n res = max(res, ss)\r\n\r\nprint(res)", "import sys\r\n\r\ndef main():\r\n _, *s = sys.stdin.read().strip().split()\r\n return max(sum(i.isupper() for i in j) for j in s)\r\n\r\nprint(main())\r\n", "n=int(input())\r\nl=list(input().split(' '))\r\nc=0\r\nll=[]\r\nfor i in l:\r\n for t in i:\r\n if ord(t)>=65 and ord(t)<=90:\r\n c=c+1\r\n ll.append(c)\r\n c=0\r\nprint(max(ll))", "import re\r\n\r\nn = int(input())\r\ns = input().split(' ')\r\n\r\ncount = lambda x: len(re.findall(r'[A-Z]', x))\r\nprint(max([count(i) for i in s]))\r\n", "n = int(input())\r\ns = input().split()\r\nans = 0\r\n\r\nfor i in s:\r\n c = 0\r\n for j in i:\r\n if j.isupper():\r\n c += 1\r\n\r\n ans = max(ans, c)\r\n\r\nprint(ans)", "n = int(input().strip())\n\nwords = input().strip().split(' ')\n\nmax = float('-inf')\n\nfor word in words:\n curr_max = 0\n for char in word:\n if char.isupper() and char.isalpha():\n curr_max+=1\n if curr_max > max:\n max = curr_max\nprint(max)\n", "print(max(sum(x.isupper()for x in y)for y in [*open(0)][1].split()))", "n = int(input())\r\ntxt = input()\r\ncounter = []\r\nfor word in txt.split():\r\n c = 0\r\n for k in word:\r\n if k.isupper():\r\n c += 1\r\n counter.append(c)\r\nprint(max(counter))", "#!/usr/bin/env python3\n\n\ndef main():\n _ = input()\n words = input().split()\n ans = 0\n for word in words:\n ans = max(sum(1 for c in word if c.isupper()), ans)\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n", "input()\r\nans = 0\r\nfor str in input().split():\r\n\ttemp = 0\r\n\tfor char in str:\r\n\t\tif char.isupper():\r\n\t\t\ttemp+=1\r\n\tans = max( ans , temp )\r\nprint(ans)\r\n", "n = int (input ())\ns = input ()\ncount = 0\nmaxi = 0\nfor i in s:\n if i.isspace ():\n if count > maxi :\n maxi = count\n count = 0\n else:\n if i.isupper():\n count += 1\nif count > maxi:\n print (count)\nelse:\n print (maxi)\n", "a=int(input())\r\n\r\n\r\nt=list(input().split())\r\n\r\nw=0\r\n\r\nfor k in t:\r\n o=0\r\n for i in k:\r\n if 65<=ord(i)<=90:\r\n o+=1\r\n if o>w:\r\n w=o\r\n\r\nprint(w)\r\n", "\r\n\r\ndef klv_zag(s):\r\n\tklv=0\r\n\tfor c in s :\r\n\t\tif c==c.upper() : \r\n\t\t\tklv+=1\r\n\t\t\t#print(c)\r\n\treturn klv\r\n\r\n#########\r\n\r\n#print(klv_zag(\"gDWaxZLJ\"))\r\n\r\n#s=\"SviN boroVeJKa PoRoSIn hello\"\r\nk=input()\r\ns=input()\r\nm=s.split(\" \")\r\nm=map(klv_zag, m)\r\nprint(max(m))\r\n", "dai=int(input())\r\ntu=input()\r\nrs=0\r\ntemp=0\r\nfor i in tu:\r\n if i==i.upper() and i!=\" \":\r\n temp+=1\r\n elif i==\" \":\r\n if temp>rs:\r\n rs=temp\r\n temp=0\r\nif temp>rs:\r\n rs=temp\r\nprint(rs)", "n = int(input())\ntext = input()\nll = list(text.split())\nnum = []\nfor i in range(len(ll)):\n num.append(sum(1 for c in ll[i] if c.isupper()))\nprint(max(num))\n\n\n \t \t\t \t \t \t \t\t \t\t\t \t\t\t \t \t\t\t", "input()\r\nprint(max(map(lambda x: sum(c.isupper() for c in x), input().split())))", "#--------------------#\r\n#INCLUDE <HajLorenzo>\r\n#INCLUDE <Dast_Garmi>\r\n#INCLUDE <HAVE_FUN>\r\n#DEFINE CODE_3\r\n#--------------------#\r\n\r\n\r\ndef upperCase(st):\r\n sum=0\r\n for i in range(len(st)):\r\n if(st[i].isupper()):\r\n sum+=1\r\n return sum\r\n \r\ninput()\r\na=list(input().split())\r\n_=[]\r\nfor __ in range(len(a)):_.append(upperCase(a[__]))\r\nprint(max(_))\r\n\r\n\r\n\r\n\r\n'''UseFull Code\r\na=list(map(int,input().split()))\r\nprint(\"Yes\" if() else \"No\")\r\n'''\r\n\r\n", "def solve(t):\r\n mx = []\r\n for i in range(len(t)):\r\n cnt = 0\r\n for j in range(len(t[i])):\r\n if t[i][j].istitle():\r\n cnt+=1\r\n \r\n mx.append(cnt) \r\n \r\n return max(mx)\r\nn = int(input())\r\nt = list(input().split())\r\nprint(solve(t))", "n = input()\nv = input().split()\nm = 0\nfor x in v:\n m = max(m, sum(map(lambda x: ord(x) < 97, x)))\nprint(m)\n", "import sys\r\nans = 0\r\ninput()\r\n\r\nfor word in input().split():\r\n vol = 0\r\n for c in word:\r\n if 65 <= ord(c) <= 90:\r\n vol += 1\r\n ans = max(ans, vol)\r\n\r\nprint(ans)\r\n", "n=int(input())\r\ns=[str(n) for n in input().split(\" \") ]\r\na=[0]*n\r\ns_b=\"QWERTYUIOPASDFGHJKLZXCVBNM\"\r\nfor i in range(len(s)):\r\n for j in range(len(s[i])):\r\n if s[i][j] in s_b:\r\n a[i]+=1\r\nprint(max(a))\r\n\r\n", "a=int(input())\r\nn=input()\r\nl=[]\r\nt=0\r\nl.insert(t,0)\r\nfor i in range(0,a):\r\n\tif ((ord(n[i])>=65) and (ord(n[i])<=90)):l[t]+=1\r\n\tif (ord(n[i])==32):\r\n\t\tt+=1\r\n\t\tl.insert(t,0)\r\nprint(max(l))", "input()\r\ns = input() + ' '\r\n\r\nc, d = 0, 0\r\nfor i in s:\r\n if i.isupper():\r\n c += 1\r\n if i == ' ':\r\n if d < c:\r\n d = c\r\n c = 0\r\nprint(d)", "def count_if(l, cond):\r\n return sum(1 for x in l if cond(x))\r\n \r\nn = input()\r\nans = max(map(lambda y: count_if(y, lambda t: t.isupper()), input().split(' ')))\r\nprint(ans)", "# LUOGU_RID: 125983850\ninput()\r\nmx=0\r\nfor i in input().split():\r\n\tmx=max(mx,sum([ord(j)>=ord('A') and ord(j)<=ord('Z') for j in i]))\r\nprint(mx)", "n = int(input())\r\ns = input()\r\nwords = s.split(' ')\r\nletters = [chr(i) for i in range(65, 91)]\r\nans = 0\r\nfor word in words:\r\n temps = word\r\n for letter in letters:\r\n temps = temps.replace(letter, '')\r\n ans = max(ans, len(word) - len(temps))\r\n\r\nprint(ans)", "n = int(input())\r\ns = input()\r\nws = s.split()\r\n\r\nr_max = 0\r\nfor w in ws:\r\n r = 0\r\n for l in w:\r\n if l.isupper():\r\n r += 1\r\n r_max = max(r, r_max)\r\n\r\nprint(r_max)\r\n", "n = int(input())\r\n\r\ns = input().split()\r\nm = 0\r\n\r\nfor i in s:\r\n c = 0\r\n for j in i:\r\n if j.isupper():\r\n c += 1\r\n m = max(m, c)\r\nprint(m)\r\n", "#!/bin/python3\r\n\r\nimport sys\r\nimport string\r\n\r\nimport math\r\n\r\ndef countsetBits(n):\r\n count=0\r\n while n>0:\r\n n&=(n-1)\r\n count+=1\r\n return count\r\nimport operator\r\n\r\nn = int(input().strip())\r\ncount=0\r\na = [x for x in input().strip().split(' ')]\r\nfor word in a:\r\n temp =0\r\n for letter in word:\r\n if letter.isupper():\r\n temp+=1\r\n count = max(count,temp)\r\nprint(count)", "n = int(input())\r\ns = [el for el in input().split()]\r\nres = 0\r\nfor el in s:\r\n cnt = 0\r\n for i in range(len(el)):\r\n if el[i].isupper():\r\n cnt += 1\r\n res = max(res, cnt)\r\nprint(res)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = list(input().rstrip().split(\" \"))\r\n\r\nmv = -1\r\nfor i in data:\r\n mv = max(mv, len([j for j in i if j.isupper()]))\r\n\r\nprint(mv)\r\n", "n = int(input())\r\ntext = input().split()\r\narr = []\r\nfor i in range(len(text)):\r\n vol = 0\r\n for j in range(len(text[i])):\r\n if text[i][j].isupper():\r\n vol += 1\r\n arr.append(vol)\r\nprint(max(arr))", "n = int(input())\r\ns = input().split()\r\nans = 0\r\nfor i in range(len(s)):\r\n caps = 0\r\n for j in range(len(s[i])):\r\n if s[i][j].isupper():\r\n caps+=1\r\n ans = max(caps, ans)\r\nprint(ans)\r\n ", "n = input()\r\na = input().split()\r\nans = 0\r\nfor i in a:\r\n now = 0\r\n for j in i:\r\n if j == j.upper():\r\n now += 1\r\n ans = max(now, ans)\r\nprint(ans)\r\n", "import math as mt \nimport sys,string\ninput=sys.stdin.readline\nfrom collections import defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\n\nt=1\nfor _ in range(t):\n n=I()\n s=list(input().split())\n m=0\n for i in range(len(s)):\n c=0\n for j in s[i]:\n if(j>='A' and j<='Z'):\n c+=1\n m=max(m,c)\n print(m)\n", "n=int(input())\r\nx=list(input())\r\nk=0\r\na=[]\r\nfor i in range(n):\r\n if x[i].isupper()==1:\r\n k+=1\r\n elif x[i]==\" \":\r\n a.append(k)\r\n k=0\r\n if i==n-1:\r\n a.append(k)\r\nprint(max(a))\r\n", "\"\"\"====================================================================================\r\n ====================================================================================\r\n \r\n ___ _______ ___ _______ ___ ___\r\n | /\\ | | \\ | | / | | | | |\\ /|\r\n | / \\ | | \\ | | / | | | | | \\ / |\r\n |___ /____\\ | | \\ | |/ |___| | | | \\/ |\r\n | / \\ | | / | |\\ |\\ | | | |\r\n | / \\ | | / | | \\ | \\ | | | |\r\n ___|/ \\___|___ |___/ ___|___ | \\ | \\ |___| | |\r\n \r\n \r\n ====================================================================================\r\n ==================================================================================== \r\n\"\"\"\r\n# ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥\r\nn = int(input())\r\nl = list(map(str,input().split()))\r\ns = []\r\na = 0\r\nfor i in range(len(l)):\r\n for j in range(len(l[i])):\r\n if l[i][j] == l[i][j].upper():\r\n a += 1\r\n s.append(a)\r\n a = 0\r\nprint(max(s))\r\n\r\n# ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥\r\n\"\"\"====================================================================================\r\n ====================================================================================\r\n \r\n ___ _______ ___ _______ ___ ___\r\n | /\\ | | \\ | | / | | | | |\\ /|\r\n | / \\ | | \\ | | / | | | | | \\ / |\r\n |___ /____\\ | | \\ | |/ |___| | | | \\/ |\r\n | / \\ | | / | |\\ |\\ | | | |\r\n | / \\ | | / | | \\ | \\ | | | |\r\n ___|/ \\___|___ |___/ ___|___ | \\ | \\ |___| | |\r\n \r\n \r\n ====================================================================================\r\n ==================================================================================== \r\n\"\"\"\r\n", "def ri():\n return int(input())\n\ndef rl():\n return list(map(int, input().split()))\n\ndef solve():\n n = ri()\n m = 0\n curr = 0\n for c in input():\n if c in 'QWERTYUIOPASDFGHJKLZXCVBNM':\n curr += 1\n elif c == ' ':\n curr = 0\n m = max(m, curr)\n print (m)\n\nsolve()\n", "leng = int(input())\r\nstrTemp = input().split()\r\nanswer = 0\r\nfor word in strTemp:\r\n wordLst = list(word)\r\n answerTemp = 0\r\n for ch in wordLst:\r\n if(ch.isupper()):\r\n answerTemp += 1\r\n if(answerTemp > answer):\r\n answer = answerTemp\r\nprint(answer)", "n=int(input())\r\ns=input()\r\nlst=s.split(\" \")\r\nmaxi=0\r\nsumi=0\r\nfor i in lst:\r\n sumi=0\r\n for j in i:\r\n if j.isupper():\r\n sumi+=1 \r\n maxi=max(maxi,sumi)\r\nprint(maxi)", "n = int(input())\r\nk = input().split()\r\nvolume = 0\r\nmaximum = []\r\nfor i in k:\r\n\tfor m in i:\r\n\t\tif m.isupper() == True:\r\n\t\t\tvolume += 1\r\n\tmaximum.append(volume)\r\n\tvolume = 0\r\nprint(max(maximum))\r\n", "ln = int(input())\r\ns = input()\r\n\r\narr = s.split()\r\nvol = []\r\n\r\nfor word in arr:\r\n volume = 0\r\n for ch in word:\r\n if ch.upper() == ch:\r\n volume += 1\r\n else:\r\n continue\r\n vol.append(volume)\r\n\r\nprint(max(vol))", "\nInput=lambda:map(str,input().split())\n\ndef cal(s):\n c = 0\n for i in s:\n if i.isupper():\n c+=1\n return c\ninput()\nMAX = -float('inf')\nText = list(Input())\nfor i in Text:\n MAX = max(MAX,cal(i))\nprint(MAX)", "n = input()\r\n\r\ntext = input()\r\n\r\ncount = 0\r\n\r\ncount_list = []\r\n\r\nanswer = -1\r\n\r\nfor i in range(0, len(text)):\r\n\r\n\tif text[i].isupper():\r\n\r\n\t\tcount += 1\r\n\r\n\tif text[i] == \" \" or i == len(text) - 1:\r\n\t\t\r\n\t\tcount_list.append(count)\r\n\r\n\t\tcount = 0\r\n\r\nanswer = max(count_list)\r\n\r\nprint(answer)", "n = int(input())\r\ns = input()\r\n\r\n# Initialize max_volume\r\nmax_volume = 0 \r\n\r\n# Count the number of capital letters in each word \r\nfor word in s.split():\r\n word_volume = 0\r\n for letter in word:\r\n if letter.isupper():\r\n word_volume += 1\r\n # Update the value of max_volume\r\n if word_volume > max_volume:\r\n max_volume = word_volume\r\n \r\n# Print the result\r\nprint(max_volume)", "n = int(input())\r\ns = list(map(str,input().split()))\r\nma_count = count = 0\r\nfor i in s:\r\n count = 0\r\n for j in i:\r\n if(j>='A' and j<='Z'):\r\n count+=1\r\n ma_count = max(ma_count,count)\r\nprint(ma_count)", "n, = map(int,input().split())\r\ns = input()\r\n\r\nmx = 0\r\nfor k in s.split():\r\n mx = max(mx,len([x for x in k if x.isupper()]))\r\nprint(mx)", "n=int(input())\r\ns=input().split()\r\nk=0\r\nm=0\r\nfor x in s:\r\n for y in x:\r\n k+=64<ord(y)<91\r\n m=max(m,k)\r\n k=0\r\nprint(m)", "import re\r\nn=int(input())\r\ns=input().split()\r\nm=0\r\nfor i in s:\r\n y=len(i)\r\n x=len(re.sub('[A-Z]','',i))\r\n m=max(m,y-x)\r\nprint(m)", "n = int(input())\r\ns = input().split()\r\nc = 0\r\n\r\nfor i in s:\r\n x = 0\r\n for y in i:\r\n if y.isupper():\r\n x += 1\r\n if x > c:\r\n c = x\r\nprint(c)", "n = input()\r\ns = input()\r\nl = s.split()\r\nans = 0\r\nfor i in l:\r\n\tcnt = 0\r\n\tfor j in i:\r\n\t\tif j.isupper() == True:\r\n\t\t\tcnt += 1\r\n\tans = max(ans, cnt)\r\nprint(ans)", "\nCAPITAL_LETTER = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n\n\ndef fun(s: str) -> int:\n word_lst = s.split(\" \")\n max_cnt = 0\n for word in word_lst:\n cnt = 0\n for c in word:\n cnt = cnt + 1 if c in CAPITAL_LETTER else cnt\n max_cnt = max(max_cnt, cnt)\n return max_cnt\n\n\nif __name__ == '__main__':\n input_s_len = int(input())\n input_s = input()\n print(fun(input_s))\n \t\t \t \t \t\t\t \t \t\t\t \t", "n = int(input())\r\ns = str(input())\r\n\r\nres = 0\r\nlocal_count = 0\r\nfor i in s:\r\n if i == \" \":\r\n local_count = 0\r\n elif i.isupper():\r\n local_count += 1\r\n res = max(res, local_count)\r\nprint(res)", "n = int(input())\nwords = input().split(' ')\n\nmax_loudness = 0\nfor word in words:\n loudness = sum(char.isupper() for char in word)\n if loudness > max_loudness:\n max_loudness = loudness\n\nprint(max_loudness)", "_=input()\r\ns=input().split()\r\nn=0\r\nfor i in s:\r\n m=0\r\n for j in i:\r\n if j in 'QWERTYUIOPASDFGHJKLZXCVBNM':\r\n m+=1\r\n if m>n:\r\n n=m\r\nprint(n)\r\n#print(' '.join([str(a[i]) for i in range(len(a))]))", "n = int(input())\r\ns = input()\r\nans = 0\r\ntemp = 0\r\nfor i in s:\r\n if i == \" \":\r\n ans = max(ans,temp)\r\n temp = 0\r\n if i >= \"A\" and i <= \"Z\":\r\n temp += 1\r\nans = max(ans,temp)\r\nprint(ans)\r\n", "s = int(input())\r\n\r\ndef wordVol(w):\r\n vol = 0\r\n for c in w:\r\n if c.isupper():\r\n vol+=1\r\n return vol\r\n\r\nwords = input().split()\r\nprint(max(wordVol(w) for w in words))\r\n ", "l=[]\r\nc=0\r\nn=int(input())\r\nf=input().split()\r\nfor i in f:\r\n for k in i:\r\n if ord(k)>=65 and ord(k)<91:\r\n c+=1\r\n l.append(c)\r\n c=0\r\nprint(max(l))\r\n \r\n", "def main():\n n = int(input())\n s = input().split()\n count = 0\n for i in s:\n temp_count = 0\n for j in i:\n if \"A\" <= j <= \"Z\":\n temp_count += 1\n if temp_count > count:\n count = temp_count\n print(count)\n\nif __name__ == '__main__':\n main()\n", "cv=mv=0\r\nn=int(input())\r\nstr=input()+' '\r\nfor i in str:\r\n if i.isupper():\r\n cv+=1\r\n elif i==' ':\r\n if mv<cv:\r\n mv=cv\r\n cv=0\r\nprint(mv)", "n=int(input())\r\na=input().split()\r\nans=0\r\nfor i in a:\r\n cnt=0\r\n for j in i:\r\n if(j.isupper()):\r\n cnt+=1\r\n ans=max(ans,cnt)\r\nprint(ans)\r\n", "n = int(input()) \r\nG = [j for j in input().split(\" \")]\r\nk = 0\r\nfor i in G:\r\n ans = 0\r\n for c in i:\r\n if c.isupper():\r\n ans += 1\r\n k = max(k, ans)\r\nprint(k)", "_=int(input())\r\nl=list(input().strip().split())\r\nz=[]\r\nfor x in l:\r\n\tcount=0\r\n\tfor y in x:\r\n\t\tif y.isupper():\r\n\t\t\tcount+=1\r\n\tz.append(count)\r\nprint(max(z))\r\n", "n = int(input())\r\ns = input().split()\r\nans = 0\r\nfor i in s:\r\n a = 0\r\n for j in i:\r\n if 'Z' >= j >= 'A':\r\n a += 1\r\n ans = max(ans, a)\r\nprint(ans)", "n=int(input())\r\ns=list(map(str, input().split(\" \")))\r\nMax=0\r\nfor i in range(len(s)):\r\n count=0\r\n for j in s[i]:\r\n if j.isupper():\r\n count+=1\r\n Max=max(Max,count)\r\nprint(Max)", "def upper_ct(s):\r\n count = 1\r\n for i in s:\r\n if i.isupper():\r\n count += 1\r\n return count\r\n\r\nn = int(input())\r\nlst = list(map(str, input().split()))\r\nnew = []\r\nfor i in range (0, len(lst)):\r\n new.append(upper_ct(lst[i]))\r\nprint(max(new)-1)", "n = input()\r\nword_list = input().split()\r\nmax = -1\r\nfor word in word_list:\r\n count = 0\r\n for letter in word:\r\n if letter.isupper():\r\n count += 1\r\n if count > max:\r\n max = count\r\nprint(max)", "input()\r\nz = input().split()\r\nk=[]\r\nfor i in z:\r\n c=0\r\n for j in i:\r\n if j.upper()==j:\r\n c+=1\r\n k.append(c)\r\nprint(max(k))", "n=int(input());s=input();c=0\r\ns=s.split(\" \")\r\nfor i in s:\r\n\tt=0\r\n\tfor j in i:\r\n\t\tif j!=j.lower():t+=1\r\n\tc=max(t,c)\r\nprint(c)", "number = input()\r\ns = input()\r\n\r\nd = s.split(\" \")\r\n\r\nans = 0\r\nfor item in d:\r\n itemnumber = 0\r\n for i in item:\r\n if 'A'<=i<='Z':\r\n itemnumber+=1\r\n ans = ans if itemnumber < ans else itemnumber\r\n\r\nprint(ans)", "input()\r\na=input().split()\r\nmx=0\r\nfor i in a:\r\n\tmx=max(mx,sum([ord(j)>=ord('A') and ord(j)<=ord('Z') for j in i]))\r\nprint(mx)\r\n", "#-*-coding:utf8;-*-\n#qpy:3\n#qpy:console\ninput()\nmx = 0\nfor x in input().split():\n x = list(filter(lambda a:a.isupper(),list(x)))\n mx = max(mx,len(x))\n\nprint(mx)", "input()\r\nS= input().split()\r\nan=0\r\n\r\nfor A in S:\r\n cur = 0\r\n for s in A:\r\n if ord(s) >= 65 and ord(s) <= 90:\r\n cur += 1\r\n an = max(an, cur)\r\nprint(an) ", "n = int(input())\ns = input().split()\n\nans = 0\nfor s in s:\n cnt = 0\n for c in list(s):\n if c.isupper():\n cnt += 1\n ans = max(ans, cnt)\n\nprint(ans)\n", "n=int(input())\r\ns=input().split()\r\nans=0\r\nfor i in s:\r\n\tt=0\r\n\tfor j in i:\r\n\t\tif j>='A' and j<='Z':\r\n\t\t\tt+=1\r\n\tans=max(ans,t)\r\nprint(ans)\r\n", "n = int(input())\r\nar = [chr(i) for i in range(97, 123)];c = 0\r\ns = input()\r\nd = 0\r\nfor i in s:\r\n if i == ' ':\r\n c = max(c, d)\r\n d = 0\r\n else:\r\n if i not in ar:\r\n d += 1\r\nprint(max(d, c))\r\n", "n = int(input())\r\ns = input().split(' ')\r\nans = 0\r\nfor i in range(0, len(s)):\r\n cnt = 0\r\n for x in range(0, len(s[i])):\r\n if s[i][x].isupper():\r\n cnt += 1\r\n ans = max(cnt, ans)\r\nprint(ans)", "len_of_text = int(input(\"\")) # input number of letter\n\nstring = input(\"\") # input sentence\n\nworld = string.split(\" \") # to cutting the sentence to worlds\n\nNo_of_world = len(world) # to take No of world in sentence\n\nV_of_world_global = 0\n\nV_of_world = 0\n\n\nfor i in range(No_of_world):\n\n V_of_world = 0\n for j in range(len(world[i])):\n\n if world[i][j].isupper():\n V_of_world += 1\n\n if V_of_world > V_of_world_global:\n V_of_world_global = V_of_world\n\n\nprint(V_of_world_global)\n", "\r\nl=int(input())\r\nn=input().split()\r\nc=[]\r\nfor i in n:\r\n\ta=list(i)\r\n\tk=0\r\n\tfor j in a:\r\n\t\tif(ord(j)<=90):\r\n\t\t\tk+=1\r\n\tc.append(k)\r\nprint(max(c))\r\n\r\n", "input()\r\nwords = input().split()\r\nprint(max(sum(map(str.isupper, word)) for word in words))", "n=int(input())\r\ns=list(input().split())\r\nd=[]\r\nfor x in s:\r\n\tc=0\r\n\tfor i in x:\r\n\t\tif i!=\" \" and 65<=ord(i)<=90:\r\n\t\t\tc+=1\r\n\td.append(c)\r\nprint(max(d))", "#!/usr/bin/python\r\nfile = input()\r\nwords = [w for w in input().split(' ')]\r\nvolume =0\r\ncap = list(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")\r\nfor w in words:\r\n caps = 0\r\n for x in w:\r\n if x in cap:\r\n caps = caps + 1\r\n if caps > volume:\r\n volume = caps\r\nprint(volume)", "x=int(input())\r\nj=str(input())\r\nj=j+' '\r\nr=0\r\nma=0\r\ns=0\r\nwhile s<=x:\r\n if j[s].isupper():\r\n r+=1\r\n if j[s]==' ':\r\n if r>ma:\r\n ma=r\r\n r=0\r\n s+=1\r\nprint(ma)\r\n \r\n", "'''#Volume of the word is number of capital letters in the word. Volume of\r\n#he text is maximum volume of all words in the text.'''\r\n\r\n\r\ndef main():\r\n letter = int(input().strip())\r\n text = input().strip().split(' ')\r\n #arr = []\r\n result = 0\r\n for i in text:\r\n count = 0\r\n for j in i:\r\n if str.isupper(j):\r\n count += 1\r\n if count > result:\r\n result = count\r\n print(result)\r\n\r\nif __name__ == '__main__':\r\n main()", "#Numero inservible\nNumC= list(map(int, input().split()))\n#Palabra que sirve\nWord = input().split()\n\nupper = ['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']\nMMayus = 0\nfor a in range(len(Word)):\n thing = 0\n for b in range(len(Word[a])):\n if(Word[a][b] in upper):\n thing+=1\n if(thing>MMayus):\n MMayus = thing\nprint(MMayus)\n\t \t \t\t \t\t \t\t \t\t\t \t\t", "n = input()\r\nwords = input().split()\r\nans = 0\r\nfor word in words:\r\n ans = max(sum(1 for c in word if c.isupper()), ans)\r\nprint (ans)", "aaaaaaaaaaaaaaaaaaaaa = input()\r\ns = input()\r\nc = 0\r\nmx = 0\r\nfor i in s:\r\n if i == \" \":\r\n if mx < c:\r\n mx = c\r\n c = 0\r\n if i.isupper():\r\n c += 1\r\nif mx < c:\r\n mx = c\r\nprint(mx) ", "leng = int(input())\r\ntext = input()\r\n\r\ngrom = 0\r\nmgrom = 0\r\nfor sym in range(leng):\r\n if text[sym].isupper():\r\n grom = grom + 1\r\n elif text[sym] == ' ':\r\n if grom > mgrom:\r\n mgrom = grom\r\n grom = 0\r\nif grom > mgrom:\r\n mgrom = grom\r\nprint(mgrom)", "\r\nn=int(input())\r\ns=input()\r\nans=0\r\nx=0\r\nfor i in range(n):\r\n\tif s[i]>='A' and s[i]<='Z':\r\n\t\tx+=1\r\n\telif s[i]==' ':\r\n\t\tif ans<x:\r\n\t\t\tans=x\r\n\t\tx=0\r\n\telse:\r\n\t\tcontinue\r\nif ans<x:\r\n\tans=x\r\nprint(ans)\r\n\t\t\t\t#unknown_2433", "import sys\r\n#sys.stdin = open(\"input2\",\"r\")\r\n\r\nn = int(input())\r\ns = input()\r\ncap = cnt = 0\r\n\r\nfor i in range(n):\r\n if s[i] != ' ' and s[i].isupper():\r\n cnt += 1\r\n elif s[i] == ' ':\r\n cap = max(cap,cnt)\r\n cnt = 0\r\nif cnt > 0:\r\n print(max(cap,cnt))\r\nelse:\r\n print(cap)\r\n", "from re import findall as f\n\namount_of_words = int(input())\nprint(max(len(f(\"[A-Z]\", w)) for w in input().split()))", "n=int(input())\r\nl=[x for x in input().strip().split(\" \")]\r\nans=0\r\nfor i in l:\r\n count=0\r\n for j in i:\r\n if j.isupper():\r\n count+=1\r\n ans=max((ans,count))\r\nprint(ans)\r\n ", "n = int(input())\nx = [x for x in input().split()]\nvol =0\nfor i in x:\n\tvol = max(vol,len([j for j in i if j.isupper()]))\nprint(vol)\n\t\n", "def findVolume(word):\n return sum([1 for c in word if c.isupper()])\n\n\ninput()\nwords = input().strip().split(\" \")\nres = [findVolume(word) for word in words]\nprint(max(res))\n\n", "import string\r\n\r\ninput()\r\nprint(max(sum(sym in string.ascii_uppercase for sym in word) for word in input().split()))\r\n", "input()\r\nprint(max(sum(int(y.isupper()) for y in x) for x in input().split(' ')))\r\n", "def volume(w):\r\n return sum(1 for i in w if i.isupper())\r\n\r\n\r\n_ = input()\r\nwords = input().split()\r\nprint(max(map(volume, words)))\r\n", "n = int(input())\r\nwords = input().split()\r\nmax_volume = 0\r\nfor word in words:\r\n volume = sum(1 for c in word if c.isupper())\r\n max_volume = max(max_volume, volume)\r\nprint(max_volume)\r\n", "import string\r\nalf = string.ascii_uppercase\r\nn = int(input())\r\nmas = input().split()\r\nnow = 0\r\nfor el in mas:\r\n gow = 0\r\n for i in el:\r\n if i in alf:\r\n gow += 1\r\n if now < gow:\r\n now = gow\r\nprint(now)", "n = int(input())\r\ntext = [word for word in input().split()]\r\nvol = []\r\nfor word in text:\r\n\tcount = 0\r\n\tfor letter in word:\r\n\t\tif letter.isupper():\r\n\t\t\tcount += 1\r\n\tvol.append(count)\r\nprint(max(vol))", "def g(word):\r\n return len([c for c in word if c.isupper()])\r\n \r\nn = input()\r\nprint(max([g(w) for w in input().split()]))", "n=int(input())\r\ns=input()\r\nm=0\r\ncurr_vol=0\r\nfor i in s:\r\n if ord(i)>=65 and ord(i)<=90:\r\n curr_vol+=1\r\n elif i==\" \":\r\n m=max(m,curr_vol)\r\n curr_vol=0\r\nm=max(m,curr_vol)\r\nprint(m)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n", "# https://codeforces.com/problemset/problem/837/A\r\n\r\nn = int(input())\r\n\r\nans = 0\r\n\r\nfor word in input().split():\r\n temp = 0\r\n for letter in word:\r\n if letter.isupper():\r\n temp += 1\r\n\r\n ans = max(temp, ans)\r\nprint(ans)", "if __name__ == \"__main__\":\r\n _ = input()\r\n xs = input().split()\r\n print(max(map(lambda x: len(list(filter(lambda y: y >= 'A' and y <= 'Z', x))), xs)))", "input()\r\nprint(max(sum(map(str.isupper,s))for s in input().split()))", "n=int(input())\r\nl1=[str(x) for x in input().split()]\r\ndef dx(n):\r\n cnt=0\r\n for i in n:\r\n if 65<=ord(i)<=90:\r\n cnt+=1\r\n return cnt\r\nls=[]\r\nfor i in l1:\r\n cnt=dx(i)\r\n ls.append(cnt)\r\nprint(max(ls))", "n = int(input())\r\ntext = input()\r\nvol_text=0\r\nfor word in text.split(\" \"):\r\n vol_word=0\r\n for ch in word:\r\n if ch>='A' and ch<='Z':\r\n vol_word+=1\r\n vol_text=max(vol_word,vol_text)\r\nprint(vol_text)", "n = int(input())\r\ns = list(input().split())\r\nans = 0\r\nfor w in s:\r\n t = 0\r\n for c in w:\r\n if c.isupper():\r\n t += 1\r\n ans = max(ans, t)\r\nprint(ans)\r\n", "n=int(input())\r\ns=input()\r\ns=s.split(\" \")\r\nsum3=[]\r\n\r\nfor i in s:\r\n sum2=0\r\n for j in i:\r\n if ord(j)>=65 and ord(j)<=90:\r\n sum2+=1\r\n sum3.append(sum2)\r\n\r\nprint(max(sum3))\r\n\r\n", "int(input())\r\ntxt=input()\r\nch=txt.split(\" \")\r\nmax=0\r\nfor word in ch :\r\n c=0\r\n for alp in word :\r\n if ord(alp)<=90:\r\n c=c+1\r\n if max<=c :\r\n max=c\r\nprint(max) ", "n = input()\nfrase = input().split()\n\nans = 0\nfor wrd in frase:\n val = 0\n for let in wrd:\n if let.isupper():\n val += 1\n if val > ans:\n ans = val\n\nprint(ans)\n", "n = int(input())\r\ns = input().split()\r\ncounter = 0\r\nfor i in s:\r\n x = 0\r\n for y in i:\r\n if y.isupper():\r\n x += 1\r\n if x > counter:\r\n counter = x\r\nprint(counter)", "n = int(input())\ntext = input().split()\n\nans = 0\nfor i in text:\n\tu = 0\n\tfor j in i:\n\t\tu += j.isupper()\n\tans = max(u,ans)\n\nprint(ans)\n\n\n\n\n", "input(); print(max(sum(ch.isupper() for ch in w) for w in input().split()))", "class Volume:\n n = int(input())\n s = list(input())\n counter =0\n aux = 0\n for i in range(len(s)):\n if s[i].isupper():\n counter+=1\n if (s[i] == \" \" or i == len(s)-1) and \" \" in s:\n if aux < counter:\n aux = counter\n counter = 0\n\n if \" \" in s:\n x=0\n else:\n aux = counter\n \n \n print(aux)\n\t\t\t \t \t \t\t \t\t \t\t \t\t \t\t\t", "n=int(input())\r\nk=list(input().split())\r\nans=0\r\nfor i in range(len(k)):\r\n c=0\r\n for j in k[i]:\r\n if j==j.upper():\r\n c+=1\r\n ans=max(c,ans)\r\nprint(ans)\r\n \r\n", "input()\r\nmx = 0\r\nfor item in input().split():\r\n cnt = 0\r\n for c in item:\r\n if c.isupper():\r\n cnt += 1\r\n mx = max(mx, cnt)\r\n\r\nprint(mx)\r\n\r\n##########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n##########################################", "n= int(input())\r\ns = list(input())\r\nc= 0\r\nli =[]\r\nfor i in s:\r\n if i!=' ' or i==s[n-1]:\r\n if i.isupper():\r\n c+=1\r\n li.append(c)\r\n else:\r\n c = 0\r\nif len(li)!=0:\r\n print(max(li))\r\nelse:\r\n print(0)", "class CodeforcesTask837ASolution:\n def __init__(self):\n self.result = ''\n self.word = ''\n\n def read_input(self):\n input()\n self.word = input()\n\n def process_task(self):\n letters = \"abcdefghijklmnoqprstuvwxyz\"\n for c in letters:\n self.word = self.word.replace(c, \"\")\n volume = max([len(x) for x in self.word.split(\" \")])\n self.result = str(volume)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask837ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\r\nS = list(map(str, input().split()))\r\nans = 0\r\nfor s in S:\r\n temp = 0\r\n for c in s:\r\n if c.isupper():\r\n temp += 1\r\n ans = max(ans, temp)\r\nprint(ans)\r\n", "t='ZXCVBNMLKJHGFDSAQWERTYUIOP'\r\nn=int(input())\r\ns=list(map(str,input().split()))\r\nb=[]\r\na=0\r\nfor i in s:\r\n for j in i:\r\n if j in t:\r\n a+=1\r\n b+=[a]\r\n a=0\r\nprint(max(b))\r\n", "n = int(input())\r\n\r\nlst = list(map(str,input().split(\" \")))\r\n\r\nans = 0\r\nfor word in lst:\r\n cnt = 0\r\n\r\n for i in word:\r\n if i.isupper():\r\n cnt+=1\r\n\r\n \r\n ans =max(ans,cnt)\r\n\r\nprint(ans)", "a=int(input())\r\nk=input().split()\r\nans=max(sum(1 for j in i if j.isupper()) for i in k)\r\nprint(ans)\r\n", "n=int(input())\r\na=list(input().split())\r\nb=[]\r\nfor i in range(len(a)):\r\n\tx=0\r\n\tfor j in range(len(a[i])):\r\n\t\tif (a[i][j]).isupper():\r\n\t\t\tx+=1\r\n\tb.append(x)\r\nprint(max(b))", "n = int(input())\r\na = input().split()\r\nb = max([sum(1 for i in j if i.isupper()) for j in a])\r\nprint(b)\r\n", "n = int(input())\r\ns = input().split()\r\nif len(s) == 1:\r\n sum = 0\r\n for i in s[0]:\r\n if i.isupper():\r\n sum += 1\r\n print(sum)\r\nelse:\r\n sumL = []\r\n temp = 0\r\n for item in s:\r\n for i in item:\r\n if i.isupper():\r\n temp += 1\r\n sumL.append(temp)\r\n temp = 0\r\n print(max(sumL))", "# https://codeforces.com/contest/837/problem/A\n# A. Громкость текста\n\n\ndef volume(word):\n return sum(str.isupper(c) for c in word)\n\nl = input()\ns = input().split()\nprint(max(volume(word) for word in s))\n", "from sys import stdin, stdout\nfrom collections import defaultdict\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef f(w):\n\treturn len([c for c in w if ord(c)>=ord('A') and ord(c)<=ord('Z')])\n\ndef solve():\n\tn=read_int()\n\twords=read().split()\n\tprint(max([f(w) for w in words]))\n\nsolve()\n", "n=int(input())\r\na=map(str,input().split())\r\np=0\r\nfor s in a:p=max(p,sum(y.isupper() for y in s))\r\nprint(p)", "n = int(input())\r\ns = input().split()\r\nc = [0] * len(s)\r\nfor i in range(len(s)):\r\n k = 0\r\n for j in s[i]:\r\n if \"A\" <= j <= \"Z\":\r\n k += 1\r\n c[i] = k\r\nprint(max(c))", "n=int(input())\r\nx=input()\r\na=x.split()\r\ng=0\r\nfor i in a:\r\n c=0\r\n for j in i:\r\n if(ord(j)>=65 and ord(j)<=91):\r\n c+=1\r\n if(c>g):\r\n g=c\r\nprint(g)", "n = int(input())\r\ns = input().split()\r\na = []\r\nfor i in range(len(s)):\r\n\tb = 0\r\n\tfor j in range(len(s[i])):\r\n\t\tif s[i][j].isupper():\r\n\t\t\tb+=1\r\n\ta.append(b)\r\nprint(max(a))\r\n", "n = int(input())\r\ns = input()\r\nl = list(s.split())\r\nli = []\r\nfor i in l:\r\n cou = 0\r\n for j in range(len(i)):\r\n if i[j] >= 'A' and i[j] <= 'Z':\r\n cou += 1\r\n li.append(cou)\r\nprint(max(li))", "input()\r\nprint(max(len(tuple(filter(str.isupper, i))) for i in input().split()))", "n = input()\r\nans = 0\r\nfor s in input().split():\r\n ans = max(ans, sum(1 for c in s if c.isupper()))\r\nprint(ans)", "n = int(input())\r\ns = input().split()\r\n\r\nans, cur = 0, 0\r\n\r\nfor x in s:\r\n cur = 0\r\n for a in x:\r\n if 'A' <= a <= 'Z':\r\n cur += 1\r\n ans = max(ans, cur)\r\n\r\nprint(ans)", "N = int(input())\nS = input().split()\nres = 0\nfor w in S:\n tmp = 0\n for s in w:\n if s.isupper():\n tmp += 1\n res = max(res, tmp)\nprint(res)\n", "n = int(input())\r\nl = list(map(str, input().strip().split()))\r\nans=0\r\nfor x in l:\r\n c=0\r\n for y in x:\r\n if y.isupper():\r\n c+=1\r\n if(c>ans):\r\n ans=c\r\nprint(ans)", "n=int(input())\r\ns=input().split(' ')\r\ncnt,m=0,0\r\nfor i in s:\r\n cnt=0\r\n for x in i:\r\n if x.isupper():\r\n cnt+=1\r\n if cnt>m:\r\n m=cnt\r\n \r\nprint(m)", "def f(s):\r\n r = 0\r\n for x in s:\r\n if x.isupper():\r\n r += 1\r\n return r\r\n\r\nn = int(input())\r\ns = map(lambda x: x.strip(), input().split())\r\n\r\nw = list(map(f, s))\r\nres = max(w)\r\n\r\nprint(res)", "combo=list(map(int, input().split()))\noracion=input()\nmayusculas=['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']\ncontador=0\nlista=[]\nfor i in oracion:\n if i in mayusculas:\n contador+=1\n elif i == ' ':\n lista.append(contador)\n contador = 0\nlista.append(contador)\nlista.sort(reverse=True)\nprint(lista[0])\n \t \t\t\t\t\t\t\t \t \t \t\t\t \t \t", "n = int(input())\r\ntext = input().split()\r\nmaxVolume = 0\r\n\r\nfor word in text:\r\n volume = 0\r\n for c in word:\r\n if c.isupper():\r\n volume += 1\r\n maxVolume = max(volume, maxVolume)\r\n\r\nprint(maxVolume)\r\n", "n = int(input())\r\ns = input()\r\nans = []\r\nvr = 0\r\nfor i in range(n):\r\n if s[i] == ' ':\r\n ans.append(vr)\r\n vr = 0\r\n else:\r\n if ord(s[i]) > 64 and ord(s[i]) < 91:\r\n vr += 1\r\nans.append(vr)\r\nprint(max(ans))\r\n", "n=int(input())\r\ns=input().split()\r\nm=0\r\nfor w in s:\r\n k=0\r\n for i in w:\r\n if 'A'<=i<='Z':\r\n k+=1\r\n if k>m:\r\n m=k\r\nprint(m)", "def main():\r\n\tinput()\r\n\twords = input().strip().split()\r\n\r\n\tvolume = max(\r\n\t\tsum(1 for ch in word if 'A' <= ch <= 'Z')\r\n\t\tfor word in words\r\n\t)\r\n\r\n\tprint(volume)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n = int(input())\r\ns = list(map(str,input().split()))\r\nalpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nresult = list()\r\nfor i in s:\r\n count = 0\r\n for j in i:\r\n if j in alpha:\r\n count = count + 1\r\n result.append(count)\r\nprint(max(result))", "def count_loud(word):\r\n l = 0\r\n for c in word:\r\n if c in loud_letters:\r\n l += 1\r\n return l\r\n\r\n\r\nloud_letters = {chr(i) for i in range(65, 91)}\r\nn = int(input())\r\ntext = list(map(str, input().split()))\r\nans = 0\r\nfor w in text:\r\n new_w = count_loud(w)\r\n if new_w > ans:\r\n ans = new_w\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(list,input().split()))\r\n# print(l)\r\nma=0\r\nfor i in l:\r\n\tz=0\r\n\tfor j in i:\r\n\t\tif ord(j) in range(65,65+26):\r\n\t\t\tz+=1\r\n\tma=max(z,ma)\r\n\r\nprint(ma)", "n = int(input())\r\ns = input()\r\nk = 0\r\nans = 0\r\nwords = s.split(' ')\r\nfor w in words:\r\n k = 0\r\n for j in range(len(w)):\r\n if w[j].isupper():\r\n k+=1\r\n ans = max(k, ans)\r\nprint(ans)", "n = int(input())\r\ns = list(input())\r\ns = ''.join(s).split()\r\nlst = []\r\nfor j in s:\r\n cnt = 0\r\n for i in j:\r\n if(i.isupper()):\r\n cnt += 1\r\n lst.append(cnt)\r\nprint(max(lst))", "c=\"ZXCVBNMLKJHGFDSAQWERTYUIOP\"\r\nn=int(input())\r\na=list(map(str,input().split()))\r\nb=[]\r\ns=0\r\nfor i in a:\r\n for j in i:\r\n if j in c:\r\n s+=1\r\n b+=[s]\r\n s=0\r\nprint(max(b))\r\n", "num = int(input())\r\ntext = input()\r\nl = len(text)\r\nwords = text.split()\r\nlw = len(words)\r\nvol = []\r\nif (num == l) and ((num>0) and (num < 201)):\r\n for i in range(0,lw):\r\n word = words[i]\r\n le = len(word)\r\n word_vol = 0\r\n for j in range(0, le):\r\n if word[j].isupper():\r\n word_vol += 1\r\n vol.append(word_vol)\r\n\r\nvol.sort()\r\n\r\nprint(vol[-1])", "n=int(input())\r\nx=(input())\r\ny=x.split(\" \")\r\nd=[]\r\nfor i in y:\r\n c=0\r\n for z in i:\r\n if z.isupper():\r\n c=c+1\r\n d.append(c)\r\nprint(max(d))\r\n\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,bisect\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nn=input()\r\nl=list(input()[:-1].split(\" \"))\r\nm=0\r\nfor i in l:\r\n c=0\r\n for j in i:\r\n if ord(j)>=ord('A') and ord(j)<ord('a'):\r\n c+=1\r\n m=max(m,c)\r\nprint(m)\r\n", "n=int(input())\r\na=input().split()\r\nb=[]\r\nc=0\r\nfor i in range(len(a)):\r\n c=0\r\n for j in range(len(a[i])):\r\n if ord(\"Z\")>=ord(a[i][j])>=ord(\"A\"):\r\n c=c+1\r\n b.append(c)\r\nprint(max(b))", "n=int(input())\ns=list(input().split())\n#print(s[1][0])\n\n#m=[]\n#for i in range(len(s)):\n#\tm+=[str(s[i])]\n#print(m)\nf=0\nF=[]\nfor i in range(len(s)):\n\tfor j in s[i]:\n\t\tif 'A'<=j<='Z':\n\t\t\tf+=1\n\tF+=[f]\n\tf=0\nprint(max(F))\n", "len_of_text = int(input())\r\nwords = [x for x in input().split()]\r\nmax_volume = 0\r\ni = 0\r\nwhile i < len(words):\r\n\tcur_volume = 0\r\n\tfor letter in words[i]:\r\n\t\tif letter.isupper() == True:\r\n\t\t\tcur_volume += 1\r\n\tif cur_volume > max_volume:\r\n\t\tmax_volume = cur_volume\r\n\ti += 1\r\nprint(max_volume)", "t = int(input())\r\ns = input()\r\ncount1,count2 = 0,0\r\nfor i in range(t):\r\n if s[i].isupper():\r\n count1 += 1\r\n count2 = max(count1,count2)\r\n if s[i] == ' ':\r\n count1 = 0\r\nprint(count2)", "import re\r\nfrom functools import partial\r\n\r\nsubstring = partial(re.sub, r'[^A-Z]', '')\r\nn = input()\r\nwords = input().split()\r\nres = max(map(lambda x: len(substring(x)), words))\r\nprint(res)", "n = int(input())\r\ns = input().split()\r\ndef count(string:str):\r\n cnt = 0\r\n for j in string:\r\n if j.isupper():\r\n cnt += 1\r\n return cnt\r\nmx = float(\"-inf\")\r\nfor i in s:\r\n mx = max(mx, count(i))\r\nprint(mx)", "n = int(input())\r\ns = input()\r\nnum, rec = 0, 0\r\nfor i in range(n):\r\n if s[i] == \" \":\r\n num = max(rec, num)\r\n rec = 0\r\n else:\r\n if s[i].isupper():\r\n rec += 1\r\n\r\nnum = max(rec, num)\r\n\r\nprint(num)\r\n", "n = int(input())\nt = input().split()\nans = 0\nfor w in t:\n m = sum(1 for c in w if('A' <= c <= 'Z'))\n ans = max(ans,m)\nprint(ans)\n", "n = int(input())\r\ns = input().split(\" \")\r\nm = 0\r\nfor x in s:\r\n co = 0\r\n for c in x:\r\n if('A'<= c <='Z'):\r\n co += 1\r\n m = max(m, co)\r\nprint(m)\r\n \r\n \r\n \r\n", "n = int(input())\r\na =str(input())\r\narr = []\r\nfor i in range(1000):\r\n arr.append(0)\r\nx = 0\r\nfor i in a:\r\n if i.isupper():\r\n arr[x]+=1\r\n elif i==' ':\r\n x+=1;\r\n\r\nprint(max(arr))\r\n\r\n\r\n", "#http://codeforces.com/problemset/problem/837/A\n_ = input()\ninp = list(input().split())\narr = []\nfor x in inp:\n\ttemp = sum(map(str.isupper, x))\n\tarr.append(temp)\nprint(max(arr))", "input()\r\ns=input().split()\r\nx=0\r\nfor i in s:\r\n k=0\r\n for j in i:\r\n if j<='Z' and j>='A':\r\n k+=1\r\n if k>x:\r\n x=k\r\nprint(x)\r\n", "n = int(input())\r\ns = input()\r\nans = 0\r\n\r\nfor s1 in s.split():\r\n\tcnt = 0\r\n\tfor i in range(len(s1)):\r\n\t\tcnt += (ord(s1[i]) < ord('a') or ord(s1[i]) > ord('z'))\r\n\tans = max(ans, cnt)\r\n\r\nprint(ans)", "import string\n\ncap = string.ascii_uppercase\nn = input()\ns = input().split()\nprint(max([sum([1 for i in x if i in cap]) for x in s]))", "import string\r\n\r\nupper = set(string.ascii_uppercase)\r\ninput()\r\nprint(max(sum(c in upper for c in w) for w in input().split()))\r\n", "n = int(input())\ns = input()\nwords = s.split()\nvolume_list = []\nfor word in words:\n volume = 0\n for ch in word:\n if ch.isupper():\n volume += 1\n volume_list.append(volume)\nprint(max(volume_list))\n\t\t\t\t \t \t \t\t \t\t \t\t \t \t", "num = int(input())\nstring = str(input())\nstrlist = string.split(' ')\ncounter = list()\nlength = len(strlist)\nfor x in range(length) :\n counter.append(0)\nfor x in range(length):\n for y in (strlist[x]):\n element = strlist[x]\n if y.isupper():\n a = counter[x]\n a = a+1 \n counter[x]=a\nprint(max(counter))", "\r\nn = int(input())\r\ns = input()\r\n\r\n\r\nres = []\r\n\r\nfor word in s.split():\r\n\tres.append(sum(1 for c in word if c.isupper()))\r\n\r\nprint(max(res))\r\n", "n=int(input())\r\ns=str(input())\r\ns=s.split(' ')\r\nMax=0\r\nfor i in s: \r\n Count=0\r\n for j in i:\r\n if j>='A' and j<='Z':\r\n Count+=1\r\n Max=max(Max,Count)\r\nprint(Max)", "n=int(input())\r\na=input().split()\r\nm=0\r\nfor s in a:\r\n k=0\r\n for c in s:\r\n if c>='A' and c<='Z': k+=1\r\n if m<k:m=k\r\nprint(m)\r\n", "input()\ncnt, ans = 0, 0\nfor x in input():\n if x.isupper():\n cnt += 1\n ans = max(ans, cnt)\n elif x == ' ':\n cnt = 0\nprint(ans)", "countCap = lambda s : sum(1 for c in s if c.isupper())\r\ninput()\r\nprint(max(countCap(w) for w in input().split()))", "n=int(input())\r\nx=list(input().split())\r\ny=[]\r\nfor i in range(len(x)):\r\n Sum=0\r\n for j in range(len(x[i])):\r\n if x[i][j]==x[i][j].upper(): Sum+=1\r\n y.append(Sum)\r\nprint(max(y))", "def vol(s):\r\n i=0\r\n c=0\r\n while i<len(s):\r\n if s[i]==\"A\" or s[i]==\"B\" or s[i]==\"C\" or s[i]==\"D\" or s[i]==\"E\" or s[i]==\"F\" or s[i]==\"G\" or s[i]==\"H\" or s[i]==\"I\" or s[i]==\"J\" or s[i]==\"K\" or s[i]==\"L\" or s[i]==\"M\" or s[i]==\"N\" or s[i]==\"O\" or s[i]==\"P\" or s[i]==\"Q\" or s[i]==\"R\" or s[i]==\"S\" or s[i]==\"T\" or s[i]==\"U\" or s[i]==\"V\" or s[i]==\"W\" or s[i]==\"Y\" or s[i]==\"X\" or s[i]==\"Z\":\r\n c+=1\r\n i+=1\r\n return c\r\nn=eval(input())\r\nw=input()\r\ni=0\r\na=0\r\ns=\"\"\r\nwhile i<len(w):\r\n if w[i]==\" \":\r\n if vol(s)>a:\r\n a=vol(s)\r\n s=\"\"\r\n s=s+w[i]\r\n i+=1\r\nif vol(s)>a:\r\n a=vol(s)\r\nprint(a)\r\n", "n=int(input())\ns=list(map(str,input().split()))\ncount=0\nmaxi=0\nfor i in s:\n for j in i:\n if j.isupper():\n count+=1\n maxi=max(count,maxi)\n count=0\nprint(maxi)\n\n \t\t \t\t \t\t \t\t \t \t \t\t\t \t\t\t", "n = int(input())\r\ns = input().split()\r\n\r\nres = 0\r\nvalues = [0] * n\r\nfor i,w in enumerate(s):\r\n cnt = sum(1 for c in w if c.isupper())\r\n values[i] = cnt\r\nprint(max(values))", "n=int (input ())\r\nch= input()\r\nl=ch.split()\r\nm=0\r\nfor i in l :\r\n s=0\r\n for j in i :\r\n if j==j.upper():\r\n s=s+1\r\n m=max(m,s)\r\n\r\nprint(m)\r\n \r\n", "n = int(input());\ns = input().split();\n\nmx = 0;\ncap = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n\nfor word in s:\n\tvolume = 0;\n\n\tfor letter in word:\n\t\tif letter in cap:\n\t\t\tvolume += 1;\n\n\tif volume > mx:\n\t\tmx = volume;\n\nprint(mx);\n \t \t\t\t\t \t\t \t\t\t\t\t\t \t \t", "n=int(input())\r\nl=input().split()\r\ntemp=[]\r\nfor i in l:\r\n y=i.upper()\r\n count=0\r\n for j in range(len(y)):\r\n if i[j]==y[j]:\r\n count+=1\r\n temp.append(count)\r\nprint(max(temp))\r\n", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\n# A~Z -- START --\nalf=['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']\n# A~Z --- END ---\n\ndef main():\n I()\n l=LS()\n\n ans=0\n for x in l:\n a=0\n for s in x:\n if s in alf:\n a+=1\n ans=max(ans,a)\n\n return ans\n\n# main()\nprint(main())\n", "input()\r\nstring = input()+ ' '\r\nlastCount = 0\r\ncount = 0\r\n\r\nfor x in string:\r\n\tif x.isupper():\r\n\t\tcount += 1\r\n\tif x == ' ':\r\n\t\tif count > lastCount:\r\n\t\t \tlastCount = count\r\n\t\tcount = 0\r\nprint((lastCount))", "n=int(input())\ns=input().split(\" \")\nl=[]\nfor i in s:\n c=0\n for j in i:\n if j>='A' and j<='Z':\n c+=1\n l.append(c)\nprint(max(l))\n", "n=input()\r\ns=list(input().split())\r\nmt=-1\r\nfor k in s:\r\n mtt=0\r\n for j in range(len(k)):\r\n if ord(k[j])>=65 and ord(k[j])<=90:\r\n mtt+=1\r\n mt=max(mtt,mt)\r\nprint(mt)", "n=int(input())\r\ns=input()\r\nd=\"\"\r\nk=0\r\nh=0\r\nfor i in range(n):\r\n if ord(s[i])!=32:\r\n if s[i].isupper():\r\n k+=1\r\n if ord(s[i])==32:\r\n if k>h:\r\n h=k\r\n i+=1\r\n k=0\r\nprint(max(h,k))\r\n\r\n", "x=int(input())\r\ny=list(input().split(' '))\r\nc=0\r\nl=[]\r\nfor i in y:\r\n for j in i:\r\n if ord(j)>=65 and ord(j)<=90:\r\n c=c+1\r\n l=l+[c]\r\n c=0\r\nprint(max(l))\r\n", "maxcnt = 0\r\nn = input()\r\ns = input()\r\nl = s.split(' ')\r\n\r\nfor i in l:\r\n cnt = 0\r\n for j in i:\r\n if j.isupper():\r\n cnt += 1\r\n if cnt > maxcnt:\r\n maxcnt = cnt\r\n\r\nprint(maxcnt)\r\n", "\r\n\"\"\"\r\nYou are given a text of single-space separated words, consisting of small and capital Latin letters.\r\n\r\nVolume of the word is number of capital letters in the word. Volume of the text is maximum volume of all words in the text.\r\n\r\nCalculate the volume of the given text.\r\n\r\nInput\r\nThe first line contains one integer number n (1 ≤ n ≤ 200) — length of the text.\r\n\r\nThe second line contains text of single-space separated words s1, s2, ..., si, consisting only of small and capital Latin letters.\r\n\r\nOutput\r\nPrint one integer number — volume of text.\r\n\r\n\"\"\"\r\ndef volumetext(length, sentence):\r\n \r\n maxvol=0\r\n vol=0\r\n \r\n for word in sentence:\r\n vol=0\r\n \r\n for letter in word: \r\n if letter.upper()==letter: \r\n vol+=1 \r\n \r\n if vol>maxvol: \r\n maxvol=vol\r\n \r\n return maxvol\r\n \r\n \r\nlength=(map(int, input().strip().split()))\r\nsentence=input().strip().split()\r\nprint(volumetext(length,sentence)) \r\n \r\n \r\n \r\n", "length= int(input())\r\ntext = list(input())\r\npp = 0\r\nhh = []\r\nfor word in text:\r\n rode = ord(word)\r\n if 65<=rode<=90:\r\n pp = pp + 1\r\n elif word == \" \":\r\n hh.append(pp)\r\n pp = 0\r\n hh.append(pp)\r\nmaxi = max(hh)\r\nprint(maxi)", "length = int(input(\"\"))\ntext = input(\"\")\nwords = text.split(\" \")\ncapitalcounttotal = []\ncapitalcount = 0\n\nfor word in words:\n for i in range(len(word)):\n if ord(word[i]) <= 90:\n capitalcount += 1\n capitalcounttotal.append(capitalcount)\n capitalcount = 0\n\ncapitalcounttotal.sort(reverse=True)\nprint(capitalcounttotal[0])", "import math\nimport bisect\n\nfrom math import gcd, floor, sqrt, log\nfrom collections import defaultdict as dd\nfrom collections import Counter\n\nI = lambda: int(input())\ntup = lambda: map(int, input().split())\nlst = lambda: list(map(int, input().split()))\n\nt = 1\n#t = I()\n\n\nwhile t:\n\n n = I()\n\n test = input().split()\n volume = []\n for ele in test:\n count = 0\n for i in ele:\n if i.isupper():\n count += 1\n volume.append(count)\n\n print(max(volume))\n\n\n\n\n \n t -= 1\n\n\n ", "n = int(input())\r\ns = input()\r\nL = s.split()\r\ntmp = 0\r\nmx = 0\r\nfor i in range(len(L)):\r\n for j in range(len(L[i])):\r\n if L[i][j] <= 'Z':\r\n tmp += 1\r\n mx = max(mx, tmp)\r\n tmp = 0\r\nprint(mx)\r\n", "n = int(input())\r\ns = input().split(\" \")\r\nans = 0\r\nfor word in s:\r\n uplit = 0\r\n for lit in word:\r\n if lit.isupper():\r\n uplit += 1\r\n if ans < uplit: \r\n ans = uplit\r\nprint(ans)", "#!/usr/bin/env python3\nn = int(input())\nwords = input().split()\nans = max(len(''.join(filter(lambda c: c.isupper(), word))) for word in words)\nprint(ans)\n\t \t \t \t \t\t\t\t\t \t \t\t\t", "n = int(input())\r\ntext = input()\r\n\r\nwords = text.split()\r\n\r\nmax_volume = 0\r\n\r\nfor word in words:\r\n volume = sum(1 for c in word if c.isupper())\r\n\r\n if volume > max_volume:\r\n max_volume = volume\r\n\r\nprint(max_volume)\r\n", "n=int(input())\r\ns=input()\r\ni,large=0,0\r\nwhile(i<n):\r\n cnt=0\r\n while(i<n and s[i]!=' '):\r\n if(ord(s[i])>=65 and ord(s[i])<=90):\r\n cnt+=1\r\n i+=1\r\n if(cnt>large):\r\n large=cnt\r\n i+=1\r\nprint(large)", "x = input()\r\nst = input()\r\n\r\ncount = 0\r\nmx = 0\r\nfor c in st:\r\n if c >= 'A':\r\n if c <= 'Z':\r\n count = count+1\r\n elif c == ' ':\r\n mx = max(mx, count)\r\n count = 0\r\n\r\nprint(max(mx, count))\r\n", "n=int(input())\r\nd1=list(map(str,input().split()))\r\nd=[]\r\nfor i in d1:\r\n s1=0\r\n for j in i:\r\n if ord(j)>=65 and ord(j)<=90:\r\n s1+=1\r\n d+=[s1]\r\nprint(max(d))\r\n \r\n", "n = int(input())\r\ns = list(map(str,input().split()))\r\n\r\na = []\r\nfor i in s:\r\n\tb = []\r\n\tfor j in i:\r\n\t\tb.append(ord(j))\r\n\ta.append(b)\r\n\r\nc = []\r\nfor i in a:\r\n\tcount = 0\r\n\tfor j in i:\r\n\t\tif j in range(65,91):\r\n\t\t\tcount += 1\r\n\tc.append(count)\r\n\r\nprint(max(c))", "n= int(input())\r\nstring = input()\r\ncount=0\r\nmx=0\r\nfor i in range(len(string)):\r\n if string[i].isupper()== True:\r\n count=count+1\r\n mx= max(count,mx)\r\n \r\n if string[i]==\" \":\r\n count=0\r\nprint(mx)", "n=input()\r\nA=input().split()\r\nmax1=0\r\nfor i in A:\r\n temp=0\r\n for j in i:\r\n if(ord(j)<92):\r\n temp+=1\r\n max1=max(max1,temp)\r\nprint(max1)\r\n \r\n ", "n = int(input())\r\ntext = input().split()\r\n\r\nmaxCount = 0\r\nfor w in text:\r\n count = 0\r\n for l in w:\r\n if ord(l) >= 65 and ord(l) <= 90:\r\n count += 1\r\n\r\n if count > maxCount:\r\n maxCount = count\r\n\r\nprint(maxCount)", "n = int(input())\r\ns = input()\r\ncount = 0\r\nt_count = 0\r\nfor i in s:\r\n if i >= \"A\" and i <= \"Z\":\r\n count += 1\r\n elif i == \" \":\r\n if count > t_count:\r\n t_count = count\r\n count = 0\r\nif count > t_count:\r\n t_count = count\r\nprint(t_count)", "_ = int(input())\nwords = input().split()\nmax1 = 0\n\nfor word in words:\n count = 0\n for i in range(len(word)):\n if word[i].isupper():\n count += 1\n\n if count > max1:\n max1 = count\n\nprint(max1)", "n=int(input())\r\nst=list(input().split())\r\nl=len(st);w=[0]*l\r\n\r\nfor i in range(l):\r\n\tfor j in st[i]:\r\n\t\tif j.isupper():\r\n\t\t\tw[i]+=1\r\nprint(max(w))", "n = int(input())\nline = input().split(' ')\n\nMax = -1\n\nfor word in line:\n vol = 0\n for ch in word:\n if 'A' <= ch and ch <= 'Z':\n vol += 1\n if Max < vol:\n Max = vol\n\nprint(Max)\n", "n =int(input())\r\ntext =input()\r\narr =text.split()\r\nmax=-100\r\nfor string in arr:\r\n\tcount =0\r\n\tfor char in string:\r\n\t\tif ord(char) >= ord('A') and ord(char) <= ord('Z'):\r\n\t\t\tcount+=1\r\n\tif max < count:\r\n\t\tmax =count\r\nprint (max)", "i = input()\r\nn = int(i)\r\nmaxv = 0\r\ncurv = 0\r\nc = input()\r\nfor i in range(0, n):\r\n if c[i].isupper():\r\n curv += 1\r\n if c[i] == ' ':\r\n if curv > maxv:\r\n maxv = curv\r\n curv = 0\r\nif curv > maxv:\r\n maxv = curv\r\nprint(maxv)\r\n", "n = int(input())\r\ns = input()\r\n\r\nwords = s.split()\r\n\r\ndef Volume(word):\r\n result = 0\r\n for c in word:\r\n if c >= 'A' and c <= 'Z':\r\n result += 1\r\n return result\r\n\r\nvolumes = [Volume(word) for word in words]\r\n\r\nif (volumes == []):\r\n print(0)\r\nelse:\r\n print(max(volumes))", "n=int(input())\r\nl=list(map(str,input().split()))\r\nans,ANS=0,[]\r\nalfavit=[\"Q\",\"W\",\"E\",\"R\",\"T\",\"Y\",\"U\",\"I\",\"O\",\"P\",\"A\",\"S\",\"D\",\"F\",\"G\",\"H\",\"J\",\"K\",\"L\",\"Z\",\"X\",\"C\",\"V\",\"B\",\"N\",\"M\"]\r\nfor i in range(len(l)):\r\n for j in range(len(l[i])):\r\n if l[i][j] in alfavit:\r\n ans+=1\r\n ANS.append(ans)\r\n ans=0\r\nprint(max(ANS))", "n = int(input())\r\nt = input()\r\nc = 0\r\nv = 0\r\nfor i in t:\r\n\tif i == \" \":\r\n\t\tv = max(v,c)\r\n\t\tc = 0\r\n\tif ord(i) >= 65 and ord(i) <= 90:\r\n\t\tc += 1\r\nv = max(v,c)\r\nprint(v)", "s = input()\r\nt = 0\r\nm = 0\r\ns = input().split()\r\nfor i in s:\r\n for j in i:\r\n if j.isupper():\r\n t += 1\r\n if t > m:\r\n m = t\r\n t = 0\r\nprint(m)\r\n", "#problem 837A\r\nsize=int(input())\r\nstring=input()\r\n\r\nanswer=[]\r\nlist=string.split()\r\nfor i in list:\r\n counter=0\r\n for x in i:\r\n if x.isupper():\r\n counter+=1\r\n answer.append(counter)\r\nprint(max(answer))", "n = int(input())\r\ns = list(input().split())\r\ncount = 0\r\nfor i in s:\r\n\tcount1 = 0\r\n\tfor j in i:\r\n\t\tif j.isupper():\r\n\t\t\tcount1 += 1\r\n\tcount = max(count,count1)\r\nprint(count)\t\t\t", "n = int(input())\ns = input()\ncnt = 0\ngrs = [0]\nfor i in range(n):\n if s[i] != ' ':\n if s[i] >= 'A' and s[i] <= 'Z':\n grs[cnt] += 1\n else:\n cnt += 1\n grs.append(0)\nmaxx = 0\nfor i in grs:\n if i > maxx:\n maxx = i\nprint(maxx)\n", "import string\r\n\r\ninput()\r\nwords = input().split(\" \")\r\ncount = []\r\nfor word in words:\r\n tmp = 0\r\n for char in word:\r\n if char in string.ascii_uppercase:\r\n tmp += 1\r\n count.append(tmp)\r\nprint(max(count))", "# cook your dish here\r\nt=1\r\nfor i in range(0,t):\r\n n=int(input())\r\n s=list(input().split(' '))\r\n m=0\r\n for j in s:\r\n c=0\r\n for k in j:\r\n if k>='A' and k<='Z':\r\n c+=1\r\n if c>m:\r\n m=c\r\n print(m)\r\n \r\n \r\n \r\n \r\n ", "input()\ndef f(s):\n x=0\n for i in s:\n if i==i.upper():\n x+=1\n return x\nprint(max(map(f,input().split())))\n\n", "n = int(input())\ns = input().split(' ')\nc, ans = 0, 0\nfor i in s:\n for j in i:\n if j >= 'A' and j <= 'Z':\n c += 1\n ans = max(ans, c)\n c = 0\nprint(ans)\n", "\r\nn=int(input())\r\nl=list(input().split())\r\nl3=[]\r\nfor i in l:\r\n\tc=0\r\n\tl2=list(i)\r\n\tfor j in l2:\r\n\t\tif j.isupper():\r\n\t\t\tc+=1\r\n\tl3.append(c)\r\nprint(max(l3))", "import re\r\ninput()\r\nsentence=input()\r\nwords=sentence.split(\" \")\r\npattern=r\"[A-Z]\"\r\nlst=[]\r\nfor i in range(len(words)):\r\n lst.append(len(re.findall(pattern,words[i])))\r\n \r\nprint(max(lst))\r\n", "n = int(input())\r\nt = list(input().split())\r\nres = [0 for i in range(len(t))]\r\n\r\nfor i in range(len(t)):\r\n s = t[i]\r\n for j in s:\r\n if j.isupper():\r\n res[i] +=1\r\n\r\nprint(max(res))", "\r\nn=int(input())\r\nstr=input()\r\nstr1=str.split(\" \")\r\n\r\nmax=0\r\nfor i in range(0,str1.__len__()):\r\n r=0;\r\n for j in range(0,str1[i].__len__()):\r\n c=str1[i][j]\r\n if c in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n r+=1\r\n\r\n\r\n if max < r:\r\n max=r;\r\n\r\nprint(max)\r\n\r\n\r\n", "number = int(input())\r\nelements = input().split(\" \")\r\narr = []\r\nfor i in range(len(elements)):\r\n count = 0\r\n for j in range(len(elements[i])):\r\n if elements[i][j].isupper():\r\n count += 1\r\n arr.append(count)\r\nprint(max(arr))", "import sys\n\nn = int(input())\ns = input().split()\n\nm = 0\nfor string in s:\n tmp = 0\n for c in string:\n if c.isupper():\n tmp += 1\n if tmp > m:\n m = tmp\n\nprint(m)\n\n", "import string\r\n\r\nuppercased_letters = string.ascii_uppercase\r\n\r\ndef find_volume(word):\r\n volume = 0\r\n for character in word:\r\n if character in uppercased_letters:\r\n volume += 1\r\n return volume\r\n\r\n_ = int(input())\r\ntext = input() \r\n\r\nvolumes = []\r\nwords = text.split() \r\n\r\nfor word in words:\r\n volumes.append(find_volume(word))\r\n\r\nvolume_of_text = max(volumes)\r\nprint(volume_of_text)\r\n", "def get_v(word):\n v = 0\n for ch in word:\n if ch.isupper():\n v += 1\n return v\n\n\nlength = input()\nwords = input().strip().split()\nmax_v = 0\n\nfor word in words:\n v = get_v(word)\n if max_v < v:\n max_v = v\n\nprint(max_v)\n", "def solution(s):\r\n ans=0\r\n alfie=\"abcdefghijklmnopqrstuvwxyz\".upper()\r\n for x in s:\r\n ans=max(ans,len([y for y in list(x) if y in alfie]))\r\n return ans\r\ndef answer():\r\n n = int(input())\r\n s = input().split()\r\n print(solution(s))\r\nanswer()", "x=int(input())\r\nl=input().split()\r\nans=[]\r\nfor i in range(len(l)):\r\n z=list(l[i])\r\n s=0\r\n for j in range(len(z)):\r\n if ord(z[j])>=65 and ord(z[j])<=90:\r\n s+=1\r\n ans.append(s)\r\nprint(max(ans))", "if __name__ == \"__main__\":\r\n text_length = int(input())\r\n words = list(input().split())\r\n max_volume = 0\r\n for word in words:\r\n max_volume = max(max_volume, sum([1 for letter in word if str(letter).isupper()]))\r\n print(max_volume)", "n=int(input())\r\ns=str(input())\r\nmax_volume=0\r\nnow_volume=0\r\n\r\nfor i in s:\r\n if i==\" \":\r\n now_volume=0\r\n else:\r\n if i==i.upper():\r\n now_volume+=1\r\n max_volume=max(max_volume,now_volume)\r\nprint(max_volume)", "n = int(input())\r\n\r\ns = str(input())\r\n\r\nlist = [s.split(\" \")]\r\n\r\ncharr = ['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\ncheck = [x.upper() for x in charr]\r\n\r\nmaxVakl = 0\r\nfor i in list:\r\n #print(is)\r\n for j in i:\r\n count = 0\r\n for k in j:\r\n if k in check:\r\n count += 1\r\n \r\n if count > maxVakl:\r\n maxVakl = count \r\nprint(maxVakl)\r\n \r\n \r\n", "i=input\r\ni()\r\nprint(max(sum(map(str.isupper,s))for s in i().split()))", "a=int(input())\r\nb=input()\r\nc=b.split(\" \")\r\n\r\nk=b.count(\" \")\r\ncnt=0\r\n\r\nd=[]\r\nfor i in range(k+1):\r\n for j in c[i]:\r\n \r\n if (j.isupper()) :\r\n cnt+=1\r\n d.append(cnt)\r\n cnt=0\r\nif d==[]:\r\n print(\"0\")\r\nelse:\r\n \r\n \r\n print(max(d))\r\n", "input()\r\nstring = input()+ ' '\r\nlastCount = 0\r\ncount = 0\r\n\r\nfor x in string:\r\n\tif not x.islower() and x.isalpha():\r\n\t\tcount += 1\r\n\tif x == ' ':\r\n\t\tif count > lastCount:\r\n\t\t \tlastCount = count\r\n\t\tcount = 0\r\nprint((lastCount))", "n=int(input())\r\na=input().split()\r\nb=0\r\nw=len(a)\r\nfor i in range(w):\r\n c=0\r\n for j in a[i]:\r\n if(j>='A' and j<='Z'):\r\n c+=1\r\n if(c>b):\r\n b=c\r\nprint(b)", "n = int(input())\na = [i for i in input().split()]\nans = 0\ncnt = 0\nfor i in a:\n\tfor j in i:\n\t\tif j >= 'A' and j <= 'Z':\n\t\t\tcnt += 1\n\tans = max(ans, cnt)\n\tcnt = 0\nprint(ans)", "\ntotal = 0\n_ = input()\nfor word in input().split(\" \"):\n word_caps = 0\n for _ in word:\n if not _.islower():\n word_caps += 1\n\n if word_caps > total:\n total = word_caps\n\nprint(total)", "input()\r\nm = 0\r\n\r\nfor word in input().split(' '):\r\n temp_m = 0\r\n\r\n for ch in word:\r\n if ord(ch) <= 90:\r\n temp_m += 1\r\n\r\n if temp_m > m:\r\n m = temp_m\r\n\r\nprint(m)\r\n", "#coding:utf-8\r\nimport re\r\n\r\nn = int(input())\r\nm = input()\r\nlis = m.split()\r\nMAX = 0\r\nfor i in lis:\r\n l = len(re.compile(r'[A-Z]').findall(i))\r\n if l > MAX:\r\n MAX = l\r\nprint(MAX)", "n = int(input())\r\ns = input()\r\nc = 0\r\nm = 0\r\nfor i in range(n):\r\n if s[i] >= \"A\" and s[i] <= \"Z\":\r\n c += 1\r\n if s[i] == \" \":\r\n m = max(m, c)\r\n c = 0\r\nif c > 0:\r\n m = max(m, c)\r\nprint(m)\r\n", "\r\ndef main_function():\r\n n = int(input())\r\n s = [i for i in input().split(\" \")]\r\n max_count = 0\r\n for i in s:\r\n internal_conter = 0\r\n for j in i:\r\n if j.isupper():\r\n internal_conter += 1\r\n if internal_conter > max_count:\r\n max_count = internal_conter\r\n return str(max_count)\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "def shum(s):\r\n z = list()\r\n t = s.split()\r\n for elem in t:\r\n z.append(sum(1 for c in elem if c.isupper()))\r\n return max(z)\r\n\r\n\r\nn = int(input())\r\nprint(shum(input()))\r\n", "n = int(input())\r\ns = input()\r\n\r\ns = s.split(\" \")\r\nans=0\r\nfor i in s:\r\n temp = 0\r\n for j in i:\r\n if j >= 'A' and j <= 'Z':\r\n temp+=1\r\n ans = max(ans, temp)\r\nprint(ans)\r\n", "wordsNum = input()\r\nwords = input().split()\r\n\r\nmostVolWord = 0\r\nfor word in words:\r\n volCh = 0\r\n for ch in word:\r\n if ch.isupper():\r\n volCh +=1\r\n if volCh > mostVolWord:\r\n mostVolWord = volCh\r\n\r\nprint(mostVolWord)\r\n", "n = int(input())\ns = input()\ntokens = s.split(' ')\n\nm = 0\nfor w in tokens:\n\tcurrent = 0\n\tfor c in w:\n\t\tif c.isupper():\n\t\t\tcurrent += 1\n\tm = max(current, m)\n\nprint(m)", "n = int(input()); b = []; k = 0\r\na = list(map(str,input().split()))\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n p = a[i][j].upper()\r\n if a[i][j] == p:\r\n k += 1\r\n b.append(k); k = 0\r\nprint(max(b))", "def calc(string):\n return sum(map(str.isupper, string))\n\n_ = input()\na = input().split()\nmaxi = 0\nfor i in a:\n x = calc(i)\n if x > maxi:\n maxi = x\nprint(maxi)\n\n\t\t\t\t \t\t\t\t\t \t\t \t\t\t\t\t\t\t\t\t\t \t", "def count(x):\r\n s=0\r\n for i in x:\r\n if ord(i)<=96 and ord(i)>=65:\r\n s+=1\r\n return s\r\nn=int(input())\r\nch=input()\r\nl=list(ch.split())\r\na=[]\r\nfor i in range(len(l)):\r\n a.append(count(str(l[i])))\r\n\r\nprint(max(a))\r\n", "#!/usr/bin/python3\r\n\r\ninput()\r\nprint(max(sum(map(str.isupper, i)) for i in input().split()))\r\n", "n=int(input())\r\nst=input()\r\ntam=0\r\nres=0\r\nfor i in st:\r\n if i>='A' and i<='Z':\r\n tam+=1\r\n elif i==' ':\r\n if tam>res:\r\n res=tam\r\n tam=0\r\nif tam>res:\r\n res=tam\r\nprint(res)\r\n", "def tl(s):\r\n\td=0\r\n\tfor c in s:\r\n\t\tif c.isupper():\r\n\t\t\td+=1\r\n\treturn d\r\n\r\ninput()\r\nv=[c for c in input().split()]\r\nm=0\r\nfor c in v:\r\n\tl=tl(c)\r\n\tif l>m:\r\n\t\tm=l\r\nprint(m)", "n=int(input())\r\nst=input()\r\ns=st[:n].split()\r\ngs=[]\r\nfor x in s:\r\n h=0\r\n for i in x:\r\n if i.isupper():\r\n h+=1\r\n gs.append(h)\r\n\r\nprint(max(gs))", "s = int(input())\r\nstring = input().split()\r\nvolumes = []\r\n\r\nfor i in range(len(string)):\r\n e = [letter for letter in string[i] if letter.upper() == letter]\r\n volumes.append(len(e))\r\n\r\nprint(max(volumes))", "input()\na = input().split()\nans = 0\nfor x in a:\n cnt = 0\n for c in x:\n if c.isupper():\n cnt += 1\n ans = max(ans, cnt)\nprint(ans)", "n = input()\r\nkalimat = input().split()\r\nprint (max(map(lambda s: sum([1 for x in s if x.isupper()]), kalimat)))", "\n\nn = int(input())\ns = input()\n\nindex = 0\nmax_index = 0\nfor c in s:\n if c >= 'A' and c <='Z':\n index = index + 1\n if c == \" \":\n if index > max_index:\n max_index = index\n index = 0\n\nif index != 0:\n if index > max_index:\n max_index = index\n\nprint(max_index)\n \t\t \t\t\t \t \t \t\t \t\t \t", "input()\nprint(max(sum(1 for c in w if c.isupper()) for w in input().split()))\n", "import re\r\nn = int(input())\r\nl = list(map(str, input().split()))\r\nans = 0\r\nfor i in l:\r\n temp = len(re.findall(r'[A-Z]', i))\r\n ans = max(temp, ans)\r\nprint(ans)", "n=int(input())\r\ns=input().split()\r\nl=[]\r\nfor i in s:\r\n\tc=0\r\n\tfor j in i:\r\n\t\tif j.isupper():\r\n\t\t\tc+=1\r\n\tl.append(c)\r\nprint(max(l))", "n = int(input())\r\ns = input()\r\nans = 0\r\nfor w in s.split(' '):\r\n t = 0\r\n for c in w:\r\n if ord('A')<=ord(c)<=ord('Z'):\r\n t += 1\r\n ans = max(ans,t)\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\ns = s.split(\" \")\r\ncnt = 0\r\nfor i in range(len(s)):\r\n temp = 0\r\n for j in range(len(s[i])):\r\n if(s[i][j].isupper()):\r\n temp+=1\r\n cnt = max(cnt, temp)\r\n \r\nprint(cnt)", "n = int(input())\r\na = input()\r\nsm = 0\r\nnm = 0\r\nfor i in range(0,n):\r\n if a[i]==\" \":\r\n nm = max(sm,nm)\r\n sm = 0\r\n elif a[i].isupper() == True :\r\n sm+=1\r\nprint(max(nm,sm)) \r\n", "x = int(input())\r\ny = input()\r\n\r\na = y.split(' ')\r\n\r\nmx = -1\r\n\r\nfor i in a:\r\n nw = 0\r\n for q in i:\r\n if (q.isupper()):\r\n nw += 1\r\n if (mx < nw):\r\n mx = nw\r\n\r\nprint(mx)\r\n", "n=int(input())\r\nx=[]\r\ny=list(input().split())\r\nfor i in y:\r\n m=0\r\n for j in i:\r\n if 65<=ord(j)<=90:\r\n m+=1\r\n x.append(m)\r\nprint(max(x))", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n len = int(input())\n words = list(input().split(' '))\n\n ans = 0\n for word in words:\n word += \" \" # 哨兵\n cnt = 0\n for ch in word:\n if ch == \" \":\n ans = max(ans, cnt)\n cnt = 0\n elif ch.isupper():\n cnt += 1\n print(ans)\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n\t\t \t\t\t\t\t \t\t\t \t\t\t\t\t\t \t \t\t \t\t", "#Amir_Python\r\nn=int(input())\r\ns=input()\r\nmax=0\r\nk=0\r\nfor x in s:\r\n if x==\" \":\r\n if k>max:\r\n max=k\r\n k=0\r\n elif x.isupper():\r\n k+=1\r\nif k>max:\r\n max=k\r\nprint(max)\r\n ", "# LUOGU_RID: 101672255\ninput()\r\nprint(max(map(lambda x: sum(x.isupper() for x in x), input().split())))", "n = input()\r\nwords = input().split()\r\n\r\nmv = 0\r\nfor w in words:\r\n v = sum([int(s.isupper()) for s in w])\r\n mv = max(v, mv)\r\n\r\nprint(mv)\r\n", "n = int(input())\r\ns = input().split()\r\nmx, tmp = 0, 0\r\nfor i in s:\r\n for j in i:\r\n if j.isupper():\r\n tmp+=1\r\n mx = max(mx,tmp)\r\n tmp = 0\r\nprint(mx)\r\n ", "n=int(input())\r\na=[str(i) for i in input().split()]\r\nx=h=0\r\nfor i in a:\r\n for j in i:\r\n if('A'<=j and j<='Z'):\r\n h+=1\r\n if(h>x):\r\n x=h\r\n h=0\r\nprint(x)", "n = int(input())\nli = [str(x) for x in input().split(' ')]\nmaxi = -12\n\nfor i in li:\n count = 0\n for j in i:\n if j.isupper():\n count += 1\n maxi = max(count, maxi)\nprint(maxi)\n", "n, s = int(input()), input().split()\nres = max(sum(c.isupper() for c in w) for w in s)\nprint(res)\n", "\r\nn = int(input())\r\nl = list(input().split())\r\nmaxup = 0\r\nfor i in range(len(l)):\r\n\tst = l[i]\r\n\tup = 0\r\n\tfor ii in st:\r\n\t\tif ii.isupper():\r\n\t\t\tup += 1\r\n\r\n\tmaxup = max(up, maxup)\r\n\r\n\r\nprint(maxup)\r\n\r\n\r\n", "input()\r\n\r\nprint(max(sum(map(str.isupper, word)) for word in input().split()))", "x=int(input())\r\ns=map(str,input().split())\r\nc=0\r\nfor i in s:\r\n\tn=0\r\n\tfor j in i:\r\n\t\tif j==j.upper():\r\n\t\t\tn+=1\r\n\tc=max(n,c)\r\nprint(c)", "#code\nt=int(input())\nl=list(input().split())\nm=0\nfor i in range(len(l)):\n n=sum(1 for c in l[i] if c.isupper())\n if n>m:\n m=n\n \nprint(m)\n", "import string\nn = int(input())\nup = []\nfor word in input().split():\n up.append([c for c in word if c in string.ascii_uppercase])\nprint(max(map(len, up)))\n\n", "# KALAM\r\ninput()\r\nl = input().split()\r\nMx = 0\r\nfor i in l:\r\n r = 0\r\n for j in i:\r\n if(ord(j) >= ord('A') and ord(j) <= ord('Z')):r += 1\r\n Mx = max(Mx , r)\r\nprint(Mx)\r\n", "n=int(input())\r\ns=input()\r\nc=0\r\np=0\r\nfor i in range(n):\r\n if ord(s[i])>=65 and ord(s[i])<=90:\r\n c=c+1\r\n elif s[i]==' ':\r\n c=0\r\n p=max(p,c)\r\nprint(p)", "input(); m = 0\r\nfor i in input().split(' '): m = max(m, sum([1 if j.isupper() else 0 for j in i]))\r\nprint(m)", "import string\r\ninput()\r\na = input().split()\r\nmax = 0\r\nfor word in a:\r\n sum = 0\r\n for i in range (len(word)):\r\n if word[i].isupper():\r\n sum+=1\r\n if sum > max:\r\n max = sum\r\nprint (max)\r\n", "n=int(input())\r\nl=[i for i in input().split()]\r\nm=0\r\nfor i in l:\r\n c=0\r\n for j in i:\r\n if(ord(j)<97):\r\n c+=1\r\n m=max(m,c)\r\nprint(m)", "li = []; input()\r\ns = input()\r\nans = 0\r\nfor i in range(len(s)):\r\n if('A' <= s[i] <='Z'):\r\n ans += 1\r\n if(s[i] == \" \" or i == len(s)-1):\r\n li.append(ans)\r\n ans = 0\r\n \r\nprint(max(li))", "input()\r\nstringlist = input().split()\r\nmaxx = 0\r\nfor string in stringlist:\r\n\tlength = len(string)\r\n\tcount = 0\r\n\tfor i in range(length):\r\n\t\tif string[i].isupper():\r\n\t\t\tcount += 1\r\n\tif count > maxx:\r\n\t\tmaxx = count\r\nprint(maxx)", "n = int(input())\r\nm = 0\r\nfor i in input().split(' '):\r\n c = 0\r\n for j in i:\r\n if j.isupper():\r\n c += 1\r\n m = max(m, c)\r\nprint(m)", "n=int(input())\r\nl1=[s for s in input().split()]\r\nc=[]\r\nfor w in l1:\r\n count=0\r\n for x in w:\r\n if 65<=ord(x)<=90:\r\n count+=1\r\n c.append(count)\r\nprint(max(c))", "def check(s):\r\n\treturn s>='A' and s<='Z'\r\nn=int(input())\r\nst=str(input())\r\nlst=[]\r\nc=0\r\nfor i in range(n):\r\n\tif check(st[i]):\r\n\t\tc+=1\r\n\tif st[i]==' ':\r\n\t\tlst.append(c)\r\n\t\tc=0\r\nlst.append(c)\r\n#print(lst)\r\nprint(max(lst))", "#import math\r\nn = int(input())\r\ns = input().split()\r\nmax_ = 0\r\n\r\nfor i in range(len(s)):\r\n s[i] = str(s[i])\r\nfor i in s:\r\n k = 0\r\n for j in range(len(i)):\r\n if i[j] >= 'A' and i[j] <= 'Z':\r\n k += 1\r\n max_ = max(max_, k)\r\nprint(max_)\r\n \r\n", "n = int(input())\r\ns = input()\r\ncounter = 0 \r\nmx = 0 \r\nfor i in s : \r\n if i.isupper():\r\n counter += 1\r\n elif i == \" \": \r\n counter = 0 \r\n mx = max(mx,counter)\r\nprint(mx)", "input()\nprint(max(len(tuple(filter(lambda s: s.isupper(), i))) for i in input().split()))", "n = int(input())\r\na = list(input().split())\r\ns =0\r\nfor i in a:\r\n\tw =0\r\n\tfor j in i:\r\n\t\tif j.isupper():w+=1\r\n\ts = max(s,w)\r\nprint(s)", "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\ns = input().split()\r\nans = 0\r\nfor i in s:\r\n cur = 0\r\n for j in i:\r\n if j.upper() == j:\r\n cur += 1\r\n ans = max(ans,cur) \r\nprint(ans) ", "x=input()\na=list(input().split())\nb=[]\nfor j in a:\n s=0\n c=list(j)\n for i in c:\n if i.upper()==i:\n s+=1\n b.append(s)\nprint(max(b))\n\n\n\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-09 00:02:03\nLastEditTime: 2021-11-09 00:05:02\nDescription: Text Volume\nFilePath: CF837A.py\n'''\n\n\ndef func():\n _ = int(input())\n words = input().strip().split()\n most = 0\n for word in words:\n count = 0\n for char in word:\n if char.isupper():\n count += 1\n if count > most:\n most = count\n print(most)\n\n\nif __name__ == '__main__':\n func()\n", "number=int(input())\r\ntext=input().split()\r\n\r\ntext_volume=[]\r\n\r\nfor i in text:\r\n word_volume=0\r\n for j in i:\r\n if(j.isupper()):\r\n word_volume+=1\r\n text_volume.append(word_volume)\r\n\r\nprint(max(text_volume))\r\n", "n = input()\r\nans = 0\r\nfor i in input().split(' '):\r\n l = 0\r\n for j in i:\r\n if 'A' <= j <= 'Z':\r\n l += 1\r\n ans = max(ans, l)\r\nprint(ans)\r\n", "_ = input()\r\nmax_vol = 0\r\nfor w in input().split():\r\n\tvol = 0\r\n\tfor c in w:\r\n\t\tif c == c.upper():\r\n\t\t\tvol += 1\r\n\tif vol > max_vol:\r\n\t\tmax_vol = vol\r\nprint(max_vol)", "import sys\n \nn = int(input())\ns = input()\nwords = s.split()\nmax = 0\ncount = 0\nfor word in words:\n\tfor i in range(len(word)):\n\t\tif ord(word[i]) >= 65 and ord(word[i]) <= 90:\n\t\t\tcount = count + 1\n\tif max < count:\n\t\tmax = count\n\tcount = 0\nprint(max)", "n = int(input())\r\nwords = list(input().split())\r\nvolumes = []\r\nfor w in words:\r\n volumes.append(len([l for l in w if l.isupper()]))\r\nprint(max(volumes))", "# 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 n = ri()\r\n s = rs()\r\n \r\n a = list(s.split(' '))\r\n sol = 0\r\n for i in a:\r\n cnt = 0\r\n for j in i:\r\n if j>='A' and j<='Z':\r\n cnt += 1\r\n sol = max(sol, cnt)\r\n \r\n wi(sol)\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", "num = input()\r\n\r\narr = input().split()\r\n\r\nmx = 0\r\nct = 0\r\nfor word in arr:\r\n for char in word:\r\n if char.isupper():\r\n ct += 1\r\n mx = max(mx, ct)\r\n ct = 0\r\n\r\nprint(mx)\r\n\r\n", "n=input()\nd=input().split()\nans=0\nfor s in d:\n k=0\n for c in s:\n if c>='A' and c<='Z':\n k+=1\n ans=max(ans,k)\nprint(ans)\n\n", "input()\r\ns=input().split()\r\nans=0\r\nfor i in s:\r\n MAX=0;\r\n for j in i:\r\n if (j in 'QWERTYUIOPASDFGHJKLZXCVBNM'):\r\n MAX+=1\r\n ans=max(ans,MAX)\r\nprint(ans)\r\n", "n = int(input())\r\nlis = list(map(str,input().split()))\r\nans=0\r\na=0\r\nfor i in lis:\r\n a=0\r\n for j in i:\r\n if j>='A' and j<='Z':\r\n a+=1\r\n ans = max(ans,a) \r\nprint(ans) ", "n=int(input())\r\nl=input().split()\r\nx=[]\r\nfor i in l:\r\n\tcount=0\r\n\tfor j in i:\r\n\t\tif j==j.upper():\r\n\t\t\tcount+=1\r\n\tx.append(count)\r\nprint(max(x))", "n = input()\r\ns = input()\r\na = s.split()\r\nans = 0\r\nfor i in a :\r\n t = len(i)\r\n cnt = 0\r\n for j in range(t):\r\n if i[j] >= 'A' and i[j] <= 'Z' :\r\n cnt+=1\r\n if cnt > ans :\r\n ans = cnt\r\nprint(ans)", "#\"from dust i have come, dust i will be\"\r\n\r\nn=int(input())\r\ns=input()\r\n\r\nm=0\r\nsum=0\r\n\r\nfor i in range(len(s)):\r\n if s[i]==' ':\r\n m=max(m,sum)\r\n sum=0\r\n if s[i].isupper():\r\n sum+=1;\r\n\r\nm=max(m,sum)\r\nprint(m)\r\n\r\n\r\n\r\n", "# ===============================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===============================\r\nimport math, fractions\r\n# ===============================\r\nn = int(input())\r\nwords = [str(x) for x in input().split()]\r\nvolume = []\r\nfor y in words:\r\n\tvolume.append(sum([1 for x in y if ord(x) >= ord(\"A\") and ord(x) <= ord(\"Z\")]))\r\nprint(max(volume))", "a = input()\r\nb = input().split()\r\nans = 0\r\nfor x in b:\r\n c = sum([1 for q in x if q.isupper()])\r\n if c > ans:\r\n ans = c\r\nprint(ans)\r\n", "def vol(s):\n\tc = 0\n\tfor i in s:\n\t\tif ord(i) >=65 and ord(i) <= 92:\n\t\t\tc+=1\n\treturn c\nn = int(input())\ns = input()\nc = 0\ns = s.split()\nmax = 0\nfor i in s:\n\tif vol(i) > max:\n\t\tmax = vol(i)\nprint (max) ", "n=int(input())\nstrs=input().split()\nl=[]\nfor i in strs:\n\tcount=0\n\tfor j in i:\n\t\tif j>='A' and j<='Z':\n\t\t\tcount+=1\n\tl.append(count)\nprint(max(l))", "import sys, math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n\r\n\r\ndef solve():\r\n n=int(input())\r\n s=input().rstrip().split()\r\n ans=0\r\n for i in s:\r\n cnt=0\r\n for j in i:\r\n if 'A'<=j<='Z': cnt+=1\r\n ans=max(ans,cnt)\r\n print(ans)\r\n \r\n \r\n \r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "_ = int(input())\r\ntext =list(input().split())\r\nans = 0 \r\nfor word in text :\r\n count = 0 \r\n for char in word:\r\n if char >= 'A' and char <= 'Z' :\r\n count += 1 \r\n ans = max(ans , count)\r\n\r\nprint(ans)\r\n\r\n ", "n = int(input())\ntext = input().split()\nans = 0\nfor word in text:\n cur_ans = 0\n for let in word:\n if let >= \"A\" and let <= \"Z\":\n cur_ans+=1\n ans = max(ans,cur_ans)\nprint(ans)", "n = input()\r\nwords = input()\r\nwords = words.split()\r\n\r\nupper = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\n\r\nmaxWeight = 0\r\n\r\ntemp = 0\r\n\r\nfor word in words:\r\n for i in word:\r\n if i in upper:\r\n temp += 1\r\n if temp > maxWeight:\r\n maxWeight = temp\r\n temp = 0\r\nprint(maxWeight) \r\n", "n=int(input())\r\ns=input()\r\nc=0\r\nl=0\r\nfor i in s:\r\n m=ord(i)\r\n if(m>=65 and m<=91):\r\n c+=1\r\n elif(i==' '):\r\n l=max(c,l)\r\n c=0\r\nl=max(l,c)\r\nprint(l)\r\n", "l = int(input())\r\nsList = input().split()\r\nvol = 0\r\nfor i in sList:\r\n tempVol = 0\r\n for j in i:\r\n if j.isupper():\r\n tempVol += 1\r\n if tempVol > vol:\r\n vol = tempVol\r\nprint(vol)", "n = int(input())\r\nwords = input().split()\r\n\r\nans = 0\r\nfor w in words:\r\n cnt = 0\r\n for c in w:\r\n if (c.isupper()):\r\n cnt += 1\r\n ans = max(ans, cnt)\r\n\r\nprint(ans)\r\n\r\n", "'''input\n24\nHarbour Space University\n'''\nn = int(input())\ns = input().split()\nm = 0\nfor x in s:\n\tc = 0\n\tfor l in x:\n\t\tif l == l.upper():\n\t\t\tc += 1\n\tm = max(m, c)\nprint(m)\n", "n = int(input())\r\ns = input().split()\r\n\r\nmx = 0\r\n\r\nfor w in s:\r\n c = 0\r\n for x in w:\r\n if x.isupper():\r\n c += 1\r\n if c > mx:\r\n mx = c\r\n\r\nprint(mx)", "n = int(input())\r\ns = input().split()\r\nmx = 0\r\nfor i in s:\r\n k = 0\r\n for j in i:\r\n if j.isupper():\r\n k += 1\r\n mx = max(mx, k)\r\nprint(mx)", "def calculate(word):\r\n result = 0\r\n for char in word:\r\n result += 1 if char.isupper() else 0\r\n return result\r\n\r\nn = input()\r\nwords = input().split()\r\nscreams = [calculate(word) for word in words]\r\nprint(max(screams))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "l = int(input())\r\nmx = 0\r\nfor i in input().split():\r\n mx = max(mx, len(list(filter(lambda s: s.isupper(), i))))\r\nprint(mx)", "input()\r\na = input().split()\r\n\r\nans = -1\r\nfor s in a:\r\n cur = 0\r\n for c in s:\r\n if ord('A') <= ord(c) <= ord('Z'):\r\n cur += 1\r\n ans = max(ans, cur)\r\nprint(ans)", "def str_volume(s):\r\n\td=0\r\n\tfor c in s:\r\n\t\tif c.isupper():\r\n\t\t\td+=1\r\n\treturn d\r\n\r\ndef text_volume(v):\r\n\tmx=0\r\n\tfor d in v:\r\n\t\tt=str_volume(d)\r\n\t\tif t>mx:\r\n\t\t\tmx=t\r\n\treturn mx\r\n\r\ninput()\r\nv=[c for c in input().split()]\r\nprint(text_volume(v))", "q = 'QWERTYUIOPASDFGHJKLZXCVBNM'\r\nm = int(input())\r\nn = input()\r\ns = 0\r\nd = 0\r\nfor i in range(len(n)):\r\n if n[i] != ' ':\r\n if n[i] in q:\r\n s += 1\r\n else:\r\n d = max(s,d)\r\n s = 0\r\nd = max(s,d)\r\nprint(d)\r\n", "n = int(input())\r\ns = list(input().split())\r\n\r\n#print(s)\r\ncnt = []\r\nres = []\r\nfor i in s :\r\n for j in i :\r\n if j.isupper():\r\n cnt.append(1)\r\n\r\n res.append(sum(cnt))\r\n cnt.clear()\r\n\r\nprint(max(res))\r\n", "n = int(input())\r\ns = input()\r\nans = 0\r\ntemp = 0 \r\nfor i in range(len(s)):\r\n if (s[i].isupper()):\r\n temp += 1\r\n if (s[i] == \" \"):\r\n if (ans < temp):\r\n ans = temp\r\n temp = 0\r\n# print(temp)\r\nprint(max(ans, temp))", "n = int(input())\r\ns = input()\r\nwords = s.split(' ')\r\nletters = \"Q W E R T Y U I O P A S D F G H J K L Z X C V B N M\".split(' ')\r\nans = 0\r\nfor word in words:\r\n temps = word\r\n for letter in letters:\r\n temps = temps.replace(letter, '')\r\n ans = max(ans, len(word) - len(temps))\r\n\r\nprint(ans)", "n = int(input())\ns = input()\nwords = s.split()\n\nlist_volume_of_words = []\n\nfor word in words:\n volume_of_words = 0\n for i in word:\n if i.isupper():\n volume_of_words += 1\n list_volume_of_words.append(volume_of_words)\n\n\nprint(max(list_volume_of_words))", "input()\r\ndef count(s):\r\n\tl=len(s)\r\n\ttem=0\r\n\tfor i in range(l):\r\n\t\tif s[i].isupper():\r\n\t\t\ttem=tem+1\r\n\treturn tem\r\nprint(max(count(word)for word in input().split()))\r\n", "n=int(input())\r\nl=input().split()\r\nans=0\r\nfor i in l:\r\n cnt=0\r\n for j in i:\r\n if j>='A' and j<='Z':\r\n cnt+=1\r\n ans=max(ans,cnt)\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip().split())\r\nans = 0\r\nfor s0 in s:\r\n c = 0\r\n for j in s0:\r\n c += ord(j) // 97 ^ 1\r\n ans = max(ans, c)\r\nprint(ans)", "n = int(input())\na = input().split()\nprint (max(sum(str(i).isupper() for i in j) for j in a))\n", "n=int(input())\r\ns=input()\r\nc,m=0,0\r\nfor i in s:\r\n if i.isupper():\r\n c+=1 \r\n elif i==\" \":\r\n m=max(c,m) \r\n c=0 \r\nm=max(c,m)\r\nprint(m)\r\n", "n=int(input())\r\ns=input().split()\r\nm=0\r\nfor x in s:\r\n p=len([y for y in x if y>='A' and y<='Z' ])\r\n if(p>m):\r\n m=p \r\nprint(m)", "n = int(input())\r\nwords = input().split()\r\nmax_volume = 0\r\nfor word in words:\r\n volume = 0\r\n for sym in word:\r\n if sym.isupper():\r\n volume += 1\r\n max_volume = max(max_volume, volume)\r\n\r\nprint(max_volume)", "n = int(input())\r\na = list(input().split()); vol =0; vols = []\r\nfor i in range(len(a)):\r\n for j in ((a[i])):\r\n if j.isupper() == True:\r\n vol+=1\r\n vols.append(vol)\r\n vol = 0\r\nprint(max(vols))", "n=int(input())\r\ns=input()\r\nlst=s.split(' ')\r\ndef countVol(s):\r\n res=0\r\n for i in s:\r\n if i.isupper():\r\n res+=1 \r\n return res \r\nMAX=0\r\nfor i in lst:\r\n MAX=max(MAX,countVol(i))\r\nprint(MAX)", "A = int(input())\nB = input()\ntemp = 0\ntemp1 = 0\nfor i in B:\n if 'A' <= i <= 'Z':\n temp = temp + 1\n elif i == ' ':\n temp = 0\n if temp > temp1:\n temp1 = temp\nprint(temp1)\n \n \n", "def volumn(word):\n return sum(c.isupper() for c in word)\n\n\ndef main():\n input()\n words = input().split()\n print(max(volumn(word) for word in words))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\ns = input().split()\r\nb = []\r\nfor i in s:\r\n\tcount = 0\r\n\tfor j in range(len(i)):\r\n\t\tif i[j].isupper():\r\n\t\t\tcount+=1\r\n\tb.append(count)\r\nprint(max(b))", "i = input()\ntext = input().split()\nans = -1\nfor t in text:\n ta = 0\n for m in t:\n if \"A\" <= m <= \"Z\":\n ta+=1\n ans = max(ta, ans)\nprint(ans)\n", "n = int(input())\ntxt = input().split()\nvol = 0\nfor word in txt:\n s = [1 for c in word if c.isupper()]\n vol = max(vol, sum(s))\n\nprint(vol)\n", "numupper=lambda x:len([i for i in x if i.isupper()])\r\ninput()\r\nprint(max([*map(numupper,input().split())]))", "n = int(input())\r\ns = str(input()[:n])\r\nk = s.split()\r\nc = 0\r\narr = []\r\n\r\nfor word in k:\r\n for i in word:\r\n if i.isupper():\r\n c += 1\r\n arr.append(c)\r\n c = 0\r\n\r\nprint(max(arr))", "n = int(input())\r\n\r\nl = list(map(str, input().split()))\r\nans = 0\r\nfor i in range(len(l)):\r\n ans = max(ans, sum(map(str.isupper, l[i])))\r\n\r\nprint(ans)\r\n", "n = input()\ns = input()\nwords = s.split()\nt_vol = 0\nfor word in words:\n vol = 0\n for l in word:\n if l.isupper():\n vol = vol + 1\n t_vol = max(t_vol, vol)\n\nprint(t_vol)\n\t \t\t\t\t\t\t \t\t \t \t \t\t", "def check_upper(c):\n if c >= 'A' and c <= 'Z':\n return True\n else:\n return False\nX = int(input())\ny = input().split()\nhighest = 0\nfor i in range(0,len(y)):\n b = 0\n for e in range(0,len(y[i])):\n if check_upper(y[i][e]) == True:\n b += 1\n if b > highest:\n highest = b\nprint(highest)\n\t\t\t\t \t \t\t \t \t \t\t \t\t", "n = int(input())\r\ns = str(input()) + \" \"\r\nc = 0\r\nm = 0\r\nfor el in s:\r\n if el == \" \":\r\n m = max(m, c)\r\n c = 0\r\n elif ord(el) <= 96:\r\n c += 1\r\nprint(m)", "import string\r\nx=int(input())\r\nn=input()\r\nl=n.split()\r\nemp=[]\r\nalpha=string.ascii_uppercase\r\ndef string(s):\r\n c1=0\r\n for ss in s:\r\n if ss in alpha:\r\n c1+=1\r\n return c1\r\nfor s in l:\r\n emp.append(string(s))\r\nprint(max(emp))", "_ = input()\ntext = input()\nmx_volume = 0\nvolume = 0\nfor x in text:\n if x.isupper():\n volume += 1\n elif x == ' ':\n volume = 0\n mx_volume = max(mx_volume, volume)\nprint(mx_volume)\n", "n = int(input())\r\nline = list(input().split())\r\nvolume = 0\r\nfor word in line:\r\n count = 0\r\n for i in range(len(word)):\r\n if word[i].isupper():\r\n count += 1\r\n if count > volume:\r\n volume = count\r\n\r\nprint(volume)\r\n", "def determiner(stroka):\r\n maxx = 0\r\n for m in range(len(stroka)):\r\n if stroka[m].isupper():\r\n maxx = maxx + 1\r\n return maxx\r\n\r\n\r\nt = int(input())\r\nstroka = input() + ' '\r\nmaks = 0\r\nm = 0\r\nfor i in range(t + 1):\r\n if stroka[i] == \" \":\r\n ans = stroka[m:i]\r\n m = i + 1\r\n num = determiner(ans)\r\n if num > maks:\r\n maks = num\r\n num = 0\r\nprint(maks)\r\n", "n=int(input())\r\nl=list(input().split(\" \"))\r\nans=0\r\nan=0\r\nfor s in l:\r\n \r\n for j in range(len(s)):\r\n if s[j].isupper():\r\n ans=ans+1\r\n if an<ans:\r\n an=ans\r\n ans=0\r\nprint(an)\r\n", "a=input()\na=0\nb=input().split( )\nfor i in b:\n c=0\n for j in i:\n if j in 'QWERTYUIOPASDFGHJKLZXCVBNM':\n c+=1\n a=max(a,c)\nprint(a)", "n=int(input())\r\na=list(map(str,input().split(\" \")))\r\nb=[]\r\nc=0\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j].isupper()==True:\r\n c+=1\r\n b.append(c)\r\n c=0\r\nprint(max(b))\r\n", "s = int(input())\r\nwords = input().split()\r\nprint(max(sum(c.isupper() for c in w) for w in words))", "f = int(input())\nn = input().split(\" \")\na =[]\nfor i in range(len(n)):\n\ta.append(n[i])\nmaxx = 0\nfor i in range(len(a)):\n\tcount = 0\n\tc = a[i]\n\tfor j in range(len(c)):\n\t\tif (ord(c[j]) < 64 or ord(c[j])>91):\n\t\t\tcontinue\n\t\telse:\n\t\t\tcount += 1\n\tif (count > maxx):\n\t\tmaxx = count\nprint(maxx)\t", "def ans(s):\r\n sum=0\r\n for i in range(0,len(s),1):\r\n c=s[i]\r\n if(c.isupper()):\r\n sum+=1\r\n return sum\r\n\r\nt=int(input())\r\ns=str(input())\r\nk=s.split(\" \")\r\nd=0\r\nm=0\r\nfor i in k:\r\n d=ans(i)\r\n m=max(d,m)\r\nprint(m)\r\n", "t=int(input())\r\ns=input()\r\nh=[]\r\nfor i in s.split():\r\n h.append(len([j for j in i if j in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ']))\r\nprint(max(h))", "# -*- coding:utf-8 -*-\r\nnum=(int)(input().strip())\r\na=input().strip()\r\nupper_a=a.upper()\r\nupper_num=0\r\nfinal_num=0\r\nfor index in range(0,num):\r\n if a[index]!=' ' and a[index]==upper_a[index]:\r\n upper_num+=1\r\n if final_num < upper_num:\r\n final_num=upper_num\r\n if a[index]==' ':\r\n upper_num=0\r\nprint(final_num)\r\n", "n = int(input())\r\nline = input()\r\nvol = 0\r\nmax = 0\r\nfor e in line:\r\n if e.isupper():\r\n vol += 1\r\n if e == ' ':\r\n if vol > max:\r\n max = vol\r\n vol = 0\r\nif vol > max:\r\n max = vol\r\nprint(max)", "a=int(input())\ns=input().split()\nb=[0]*len(s)\nc=['Q','W','E','R','T','Y','U','I','O','P','A','S','D','F','G','H','J','K','L','Z','X','C','V','B','N','M']\nfor i in range(len(s)):\n for j in s[i]:\n if(j in c):\n b[i]=b[i]+1\nprint(max(b))\n \n \n\n\n", "n=int(input())\r\ns=input().strip()\r\nl=s.split(\" \")\r\nm=0\r\nfor i in l:\r\n c=0\r\n for j in i:\r\n if(j>='A' and j<='Z'):\r\n c+=1\r\n m=max(m,c)\r\nprint(m) ", "n = int(input())\r\ntext = input()\r\nwords = text.split(' ')\r\nmaxvol = 0\r\nfor word in words:\r\n vol = 0\r\n for c in word:\r\n if c.isupper():\r\n vol += 1\r\n\r\n maxvol = max(maxvol, vol)\r\n\r\nprint(maxvol)\r\n", "n = int(input())\n\ns = str(input())\n\nss = s.split(\" \")\nmax = 0\nfor sss in ss:\n ans = 0 \n for ssss in sss:\n if ssss.isupper():\n ans +=1\n if max < ans:\n max = ans\n\nprint(max)\n", "input()\r\nans = 0\r\nfor s in input().split():\r\n a = 0\r\n for c in s:\r\n if c.isupper():\r\n a += 1\r\n ans = max(ans, a)\r\nprint(ans)\r\n", "n = int(input())\ntext = input().split()\nans = 0\nfor word in text:\n kapa = 0\n for ch in word:\n if ch == ch.upper():\n kapa += 1\n ans = max(kapa, ans)\nprint(ans)\n", "input()\r\nprint(max(sum(map(str.isupper,s)) for s in input().split()))", "n=int(input(''))\r\ns=input('')\r\nl=[]\r\nm=[]\r\nc=0\r\nk=s.split()\r\nfor i in k:\r\n c=0\r\n l=[]\r\n for j in range(len(i)):\r\n if ord(i[j])>=65 and ord(i[j])<=90:\r\n c+=1\r\n l.append(c)\r\n m.append(sum(l))\r\nprint(max(m))\r\n#print(m)", "input()\r\na = list(input().split())\r\nrs = 0\r\nfor s in a:\r\n t = 0\r\n for i in s:\r\n if 'A'<= i and i <='Z':\r\n t+=1\r\n rs = max (rs , t)\r\nprint(rs)", "n = int(input())\r\ns = input()\r\nls = s.split()\r\nans = []\r\nfor i in range(len(ls)):\r\n count = 0\r\n for e in range(len(ls[i])):\r\n if ls[i][e].isalpha() and ls[i][e].isupper():\r\n count += 1\r\n ans.append(count)\r\nprint(max(ans))\r\n", "n=int(input())\r\nn1=input().split()\r\nlst=[]\r\nfor i in n1:\r\n s=0\r\n for j in i:\r\n if(j.isupper()==True):\r\n s=s+1\r\n lst.append(s)\r\nprint(max(lst))\r\n", "a=int(input())\r\nb=input().split()\r\n\r\nsum=-1\r\n\r\nfor i in b:\r\n temp=0\r\n for j in range(len(i)):\r\n if i[j].isupper():\r\n temp+=1\r\n sum=max(sum,temp)\r\n\r\nprint(sum)\r\n", "#python 3.5.2\r\n\r\nalp = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nres = 0\r\nres1 = 0\r\n\r\nk = int(input())\r\nstrok = input()\r\n\r\nfor i in strok:\r\n if i == ' ':\r\n if res1 >= res:\r\n res = res1\r\n res1 = 0\r\n \r\n if res1 < res:\r\n res1 = 0\r\n \r\n if alp.find(i) != -1:\r\n res1 = res1 + 1\r\n \r\nif res1 >= res:\r\n res = res1\r\n\r\nprint(res)\r\n " ]

{"inputs": ["7\nNonZERO", "24\nthis is zero answer text", "24\nHarbour Space University", "2\nWM", "200\nLBmJKQLCKUgtTxMoDsEerwvLOXsxASSydOqWyULsRcjMYDWdDCgaDvBfATIWPVSXlbcCLHPYahhxMEYUiaxoCebghJqvmRnaNHYTKLeOiaLDnATPZAOgSNfBzaxLymTGjfzvTegbXsAthTxyDTcmBUkqyGlVGZhoazQzVSoKbTFcCRvYsgSCwjGMxBfWEwMHuagTBxkz", "199\no A r v H e J q k J k v w Q F p O R y R Z o a K R L Z E H t X y X N y y p b x B m r R S q i A x V S u i c L y M n N X c C W Z m S j e w C w T r I S X T D F l w o k f t X u n W w p Z r A k I Y E h s g", "200\nhCyIdivIiISmmYIsCLbpKcTyHaOgTUQEwnQACXnrLdHAVFLtvliTEMlzBVzTesQbhXmcqvwPDeojglBMIjOXANfyQxCSjOJyO SIqOTnRzVzseGIDDYNtrwIusScWSuEhPyEmgQIVEzXofRptjeMzzhtUQxJgcUWILUhEaaRmYRBVsjoqgmyPIKwSajdlNPccOOtWrez", "1\ne", "1\nA", "200\nABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ ABCDEFGHIJ KLMNOPRSTU KLMNOPRSTU KLMNOPRSTU VWXYZABCDE KLMNOPRSTU KLMNOPRSTU KLMNOPRSTU KLMNOPRSTU KZ", "200\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA", "200\nffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff", "24\nHarbour Space UniversitY", "5\naA AA", "10\nas AS ASDA", "10\nas AS ASDZ", "3\na A", "24\nHarbour space UniversitY", "10\nas AS ASAa", "15\naAb ABCDFGRHTJS", "53\nsdfAZEZR AZE dfdf dsdRFGSDF ZZDZSD dfsd ERBGF dsfsdfR", "10\nABC ABc AB", "10\nA c de CDE", "4\nA AB", "18\nHARbour Space UNIV", "13\na b c d e f A", "6\nA B CA", "4\naa A", "3\nA a"], "outputs": ["5", "0", "1", "2", "105", "1", "50", "0", "1", "10", "200", "0", "2", "2", "4", "4", "1", "2", "3", "11", "6", "3", "3", "2", "4", "1", "2", "1", "1"]}

UNKNOWN

PYTHON3

CODEFORCES

436

8be1c3722f69c951ceff8bd6b888d662

80-th Level Archeology

Archeologists have found a secret pass in the dungeon of one of the pyramids of Cycleland. To enter the treasury they have to open an unusual lock on the door. The lock consists of *n* words, each consisting of some hieroglyphs. The wall near the lock has a round switch. Each rotation of this switch changes the hieroglyphs according to some rules. The instruction nearby says that the door will open only if words written on the lock would be sorted in lexicographical order (the definition of lexicographical comparison in given in notes section). The rule that changes hieroglyphs is the following. One clockwise rotation of the round switch replaces each hieroglyph with the next hieroglyph in alphabet, i.e. hieroglyph *x* (1<=≤<=*x*<=≤<=*c*<=-<=1) is replaced with hieroglyph (*x*<=+<=1), and hieroglyph *c* is replaced with hieroglyph 1. Help archeologist determine, how many clockwise rotations they should perform in order to open the door, or determine that this is impossible, i.e. no cyclic shift of the alphabet will make the sequence of words sorted lexicographically. The first line of the input contains two integers *n* and *c* (2<=≤<=*n*<=≤<=500<=000, 1<=≤<=*c*<=≤<=106) — the number of words, written on the lock, and the number of different hieroglyphs. Each of the following *n* lines contains the description of one word. The *i*-th of these lines starts with integer *l**i* (1<=≤<=*l**i*<=≤<=500<=000), that denotes the length of the *i*-th word, followed by *l**i* integers *w**i*,<=1, *w**i*,<=2, ..., *w**i*,<=*l**i* (1<=≤<=*w**i*,<=*j*<=≤<=*c*) — the indices of hieroglyphs that make up the *i*-th word. Hieroglyph with index 1 is the smallest in the alphabet and with index *c* — the biggest. It's guaranteed, that the total length of all words doesn't exceed 106. If it is possible to open the door by rotating the round switch, print integer *x* (0<=≤<=*x*<=≤<=*c*<=-<=1) that defines the required number of clockwise rotations. If there are several valid *x*, print any of them. If it is impossible to open the door by this method, print <=-<=1. Sample Input 4 3 2 3 2 1 1 3 2 3 1 4 2 3 1 2 2 5 2 4 2 2 4 2 4 4 1 2 1 3 1 4 1 2 Sample Output 1 0 -1

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, c = map(int, input().split())\r\nw1 = list(map(int, input().split()))[1:]\r\nng = [0] * (c + 1)\r\nok = 1\r\nfor _ in range(n - 1):\r\n w2 = list(map(int, input().split()))[1:]\r\n f = 0\r\n for i, j in zip(w1, w2):\r\n if i < j:\r\n l = c - j + 1\r\n r = l + (j - i) % c\r\n ng[l] += 1\r\n ng[r] -= 1\r\n f = 1\r\n break\r\n elif i > j:\r\n l = c - i + 1\r\n r = l + (i - j) % c\r\n ng[0] += 1\r\n ng[l] -= 1\r\n ng[r] += 1\r\n f = 1\r\n break\r\n if not f and len(w1) > len(w2):\r\n ok = 0\r\n w1 = w2\r\nans = -1\r\nif ok:\r\n for i in range(1, c + 1):\r\n ng[i] += ng[i - 1]\r\n if not ng[i]:\r\n ans = i\r\n break\r\n if not ng[0]:\r\n ans = 0\r\nprint(ans)" ]

{"inputs": ["4 3\n2 3 2\n1 1\n3 2 3 1\n4 2 3 1 2", "2 5\n2 4 2\n2 4 2", "4 4\n1 2\n1 3\n1 4\n1 2", "3 1\n2 1 1\n2 1 1\n3 1 1 1", "2 10\n14 9 6 7 1 6 9 3 1 9 4 6 8 8 1\n3 3 7 6", "5 10\n1 5\n7 5 1 10 5 3 7 10\n1 2\n1 3\n7 4 7 3 9 4 6 1", "50 5\n1 4\n1 4\n1 4\n1 4\n2 4 4\n2 4 5\n2 4 5\n3 4 1 1\n4 4 1 2 5\n7 4 3 2 1 4 4 5\n1 5\n1 5\n1 5\n1 5\n2 5 4\n2 5 5\n2 5 5\n2 5 1\n2 5 3\n1 1\n1 1\n1 1\n1 1\n2 1 4\n2 1 4\n2 1 5\n2 1 1\n2 1 1\n2 1 3\n9 1 3 4 3 2 5 5 5 2\n1 2\n1 2\n3 2 4 2\n2 2 1\n2 2 2\n2 2 2\n2 2 2\n1 3\n1 2\n1 3\n1 3\n1 3\n1 3\n1 3\n2 3 4\n3 3 4 4\n5 3 4 5 2 1\n2 3 5\n2 3 2\n2 3 3", "10 10\n2 6 6\n1 7\n1 8\n2 8 2\n2 9 2\n2 10 5\n1 1\n1 4\n3 4 9 3\n2 5 1"], "outputs": ["1", "0", "-1", "0", "2", "6", "-1", "5"]}

UNKNOWN

PYTHON3

CODEFORCES

1

8be653bb7d31a6854b649c9565e080e5

April Fools' Problem (easy)

The marmots have prepared a very easy problem for this year's HC2 – this one. It involves numbers *n*, *k* and a sequence of *n* positive integers *a*1,<=*a*2,<=...,<=*a**n*. They also came up with a beautiful and riveting story for the problem statement. It explains what the input means, what the program should output, and it also reads like a good criminal. However I, Heidi, will have none of that. As my joke for today, I am removing the story from the statement and replacing it with these two unhelpful paragraphs. Now solve the problem, fools! The first line of the input contains two space-separated integers *n* and *k* (1<=≤<=*k*<=≤<=*n*<=≤<=2200). The second line contains *n* space-separated integers *a*1,<=...,<=*a**n* (1<=≤<=*a**i*<=≤<=104). Output one number. Sample Input 8 5 1 1 1 1 1 1 1 1 10 3 16 8 2 4 512 256 32 128 64 1 5 1 20 10 50 30 46 6 6 6 6 6 6 6 6 1 1 100 Sample Output 571036100

[ "a,b=map(int,input().split())\r\nt=[int(i) for i in input().split()]\r\ncount=0\r\nt.sort()\r\nfor i in range(b):count+=t[i]\r\nprint(count)", "n, k = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nc = sorted(b)\r\nprint(sum(c[:k]))\r\n", "Q=lambda:map(int,input().split())\r\n_,k=Q()\r\nprint(sum(sorted(Q())[:k]))", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr = sorted(arr)\r\nprint(sum(arr[i] for i in range(k)))", "\r\nn, k = map(int, input().split())\r\nl = sorted(list(map(int, input().split())))\r\n\r\nprint(sum(l[:k]))", "n,k=map(int,input().split())\r\nll=list(map(int,input().split()))\r\nll.sort()\r\nprint(sum(ll[:k]))", "N,K=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nprint(sum(sorted(A)[:K]))", "s=[*map(int,open(0).read().split())];print(sum(sorted(s[2:])[:s[1]]))", "Y=lambda:map(int,input().split());n,k=Y();print(sum(sorted(Y())[:k]))", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nsum = 0\r\nfor ki in range(k):\r\n minl = min(l)\r\n sum += minl\r\n l.remove(minl)\r\nprint (sum)\r\n", "n, k = map(int, input().split())\nv = [int(i) for i in input().split()]\n\nv.sort()\nprint(sum(v[:k]))\n", "s=input()\r\ns=s.split()\r\nk=s[1]\r\ns=input()\r\ns=s.split()\r\nfor i in range(len(s)):\r\n s[i]=int(s[i])\r\ns.sort()\r\nans=0\r\nfor i in range(int(k)):\r\n ans+=(s[i])\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\ns = 0\r\nfor i in range(k):\r\n s += arr[i]\r\n\r\nprint(s)\r\n\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\nprint(sum(arr[:k]))", "n,k=map(int,input().split());print(sum(sorted(list(map(int,input().split())))[:k]))", "N,K=list(map(int,input().split()))\r\nA=list(map(int,input().split()))\r\nA.sort()\r\nsuma=0\r\nfor i in range(K):\r\n suma+=A[i]\r\nprint(suma)", "p = lambda: list(map(int, input().split()))\r\n\r\nN, K = p()\r\nprint(sum(sorted(p())[:K]))", "n,k=map(int,input().split())\r\nA=sorted(list(map(int,input().split())))\r\nR=sum(A[0:k])\r\nprint(R)\r\n", "n,k=map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\nl.sort()\r\nprint(sum(l[:k]))", "\r\nn,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=0\r\nfor i in range(k):\r\n ans+=a[i]\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n ", "x,y=map(int,input().split())\r\nn=list(map(int,input().split()))\r\nn=sorted(n)\r\nans=0\r\nfor num in range(y):\r\n ans=ans+n[num]\r\nprint(ans)", "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, k = get_ints()\r\n a = get_array()\r\n a.sort()\r\n s = 0\r\n for i in range(k): s += a[i]\r\n print(s)\r\nif __name__ == \"__main__\":\r\n main()", "v=int(input().split()[1].strip())\r\nval=input().split()\r\nval=sorted([int(x.strip()) for x in val])\r\nprint(sum(val[0:v]))", "n,k = list(map(int,input().split()))\r\n\r\narr= list(map(int,input().split()))\r\narr.sort()\r\nsumm=0\r\n\r\nfor i in range(k):\r\n summ+=arr[i]\r\nprint(summ)", "import poplib\r\nimport string\r\nimport math\r\n\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n a.sort()\r\n print(sum(a[:k]))\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "#ROUNIAAUDI\r\nb,v=map(int,input().split())\r\nw=sorted(list(map(int,input().split())))\r\ns=0\r\nfor i in range(v):\r\n s+=w[i]\r\n\r\nprint(s)", "a = input().split()\r\nk = input().split()\r\ns = []\r\nfor i in k:\r\n s.append(int(i))\r\ns.sort()\r\nd = 0\r\nfor i in range(int(a[1])):\r\n d += int(s.pop(0))\r\nprint(d)\r\n \r\n", "from sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn,k = get_ints()\r\nar = sorted(get_ints())\r\nprint(sum(ar[:k]))", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-24 23:46:53\nLastEditTime: 2021-11-24 23:48:39\nDescription: April Fools' Problem (easy)\nFilePath: CF802M.py\n'''\n\n\ndef func():\n n, k = map(int, input().strip().split())\n lst = sorted(map(int, input().strip().split()))\n print(sum(lst[:k]))\n\n\nif __name__ == '__main__':\n func()\n ", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nprint(sum(sorted(A)[:k]))", "k=int(input().split()[-1])\r\nprint(sum(sorted(map(int,input().split()))[:k]))", "N , K = map(int,input().split())\r\nA = [int(i) for i in input().split()]\r\nA.sort()\r\ncount = 0\r\nfor i in range(K):\r\n count += A[i]\r\n\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\nprint(sum(sorted(map(int, input().split()))[:m]))\r\n", "i_liczb, i_wziac = map(int, input().split())\r\nliczby = list(map(int, input().split()))\r\nprint(sum(sorted(liczby)[:i_wziac]))", "a,b=input().split();print(sum(sorted(list(map(int,input().split())))[:int(b)]))", "n, m = [int(i) for i in input().split()]\r\nk = [int(i) for i in input().split()]\r\nk.sort()\r\nsm = 0\r\nfor i in range(m):\r\n sm += k[i]\r\nprint(sm)", "N, K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nprint(sum([A[i] for i in range(K)]))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = sorted(map(int, input().split()))\r\nprint(sum(w[:k]))", "n,m=map(int, input().split())\r\nl=[]\r\nl=list(map(int, input().split()))\r\nl.sort()\r\nprint(sum(l[0:m]))", "n,k=map(int,input().split());s,l=0,sorted(list(map(int,input().split())))\r\nwhile k: k-=1;s+=l[k]\r\nprint(s)", "_, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nprint(sum(sorted(a)[:k]))", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n#b = list(map(int, input().split()))\r\n\r\na = sorted(a)\r\n\r\nprint(sum(a[:m]))", "# LUOGU_RID: 101671699\nn, k, *a = map(int, open(0).read().split())\r\nprint(sum(sorted(a)[:k]))", "a = input()\r\nn, k = map(int, a.split())\r\nb = input()\r\nnumbers = list(map(int, b.split()))\r\nsorted(numbers)\r\nprint(sum(sorted(numbers)[0:k]))" ]

{"inputs": ["8 5\n1 1 1 1 1 1 1 1", "10 3\n16 8 2 4 512 256 32 128 64 1", "5 1\n20 10 50 30 46", "6 6\n6 6 6 6 6 6", "1 1\n100", "1 1\n1", "10 5\n147 1917 5539 7159 5763 416 711 1412 6733 4402", "100 60\n1443 3849 6174 8249 696 8715 3461 9159 4468 2496 3044 2301 2437 7559 7235 7956 8959 2036 4399 9595 8664 9743 7688 3730 3705 1203 9332 7088 8563 3823 2794 8014 6951 1160 8616 970 9885 2421 6510 4885 5246 6146 8849 5141 8602 9486 7257 3300 8323 4797 4082 7135 80 9622 4543 6567 2747 5013 4626 9091 9028 9851 1654 7021 6843 3209 5350 3809 4697 4617 4450 81 5208 1877 2897 6115 3191 2878 9258 2849 8103 6678 8714 8024 80 9894 321 8074 6797 457 1348 8652 811 7215 4381 5000 7406 7899 9974 844"], "outputs": ["5", "7", "10", "36", "100", "1", "4603", "206735"]}

UNKNOWN

PYTHON3

CODEFORCES

44

8bf008186e7ef1b9076e19b8f3ab5c1a

Scrambled

Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht *D* *mod* *M*[*i*]<==<=*R*[*i*], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet. Yuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. The first line of input contains a single integer N (1<=≤<=*N*<=≤<=16). The second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All *M*[*i*] are positive, for each *i* *R*[*i*]<=<<=*M*[*i*]. Output a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10<=-<=4. Sample Input 1 2 0 2 2 3 1 0 Sample Output 0.500000 0.666667

[ "from fractions import gcd\nfrom functools import reduce\nfrom operator import mul\n\nn = int(input())\nm = [int(x) for x in input().split()]\nr = [int(x) for x in input().split()]\n\nlcm = m[0]\nif len(m) > 1:\n lcm = reduce(mul, m, 1) // reduce(gcd, m, 0)\n\nres = 0\nfor d in range(min(lcm, 100000)):\n for i in range(n):\n if d % m[i] == r[i]:\n res += 1\n break\n\nprint(res / min(lcm, 100000))\n", "# coding: utf-8\r\n\r\nfrom functools import reduce\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\ndef lcm (x, y):\r\n return x * y // gcd(x, y)\r\n \r\nn = int(input())\r\nm = list(map(int, input().split()))\r\nr = list(map(int, input().split()))\r\ng = reduce(lambda x, y: lcm(x, y), m)\r\ncount = 0\r\n\r\nfor i in range(g):\r\n for j in range(n):\r\n if i % m[j] == r[j]:\r\n count += 1\r\n break\r\n\r\nprint(count / g)", "n = int(input())\nM = [int(x) for x in input().split()]\nR = [int(x) for x in input().split()]\nans = 0\nfor d in range(100000):\n for i in range(n):\n if d % M[i] == R[i]:\n ans += 1\n break\nprint(ans / (100000))\n", "k = int(input())\r\nq1 = list(map(int,input().split()))\r\nq2 = list(map(int,input().split()))\r\nz = 100000\r\nans = 0\r\nfor i in range(1,z+1):\r\n for j in range(len(q1)):\r\n if i%q1[j] == q2[j]:\r\n ans+=1\r\n break\r\nprint(ans/z)", "def gcd(a, b):\r\n a, b = max(a, b), min(a, b)\r\n while a%b!=0:\r\n a%=b\r\n a, b = b, a\r\n return b\r\n\r\ndef gsd(a, b):\r\n return a*b//gcd(a, b)\r\n\r\nn=int(input())\r\nm=list(map(int, input().split()))\r\nr=list(map(int, input().split()))\r\nx=m[0]\r\nfor i in range(1, n):\r\n x=gsd(x, m[i])\r\ncount=0\r\nfor i in range(x):\r\n for j in range(n):\r\n if i%m[j]==r[j]:\r\n count+=1\r\n break\r\nprint(count/x)\r\n", "input()\r\nf=lambda:map(int,input().split())\r\nT,l=1<<19,list(zip(f(),f()))\r\nprint(sum(any(d%m==r for m,r in l) for d in range(T))/T)", "f = lambda: map(int, input().split())\r\nf()\r\nk = 720720\r\nt = [0] * k\r\nfor m, r in zip(f(), f()): t[r::m] = [1] * (k // m)\r\nprint(sum(t) / k)", "def main():\r\n \r\n n = int(input())\r\n m = list(map(int, input().split()))\r\n r = list(map(int, input().split()))\r\n \r\n cnt = 0\r\n for i in range(1, 1000001):\r\n for j in range(n):\r\n if i % m[j] == r[j]:\r\n cnt += 1\r\n break\r\n \r\n ans = cnt / 1000000.0\r\n print(\"%.6f\" % ans)\r\nmain()\r\n", "from math import *\r\ndef find_lcm(num1,num2):\r\n g=gcd(num1,num2)\r\n lcm=int(int(num1*num2)/int(g))\r\n return lcm\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nif n==1:\r\n lcm=r[0]\r\nelse:\r\n lcm=find_lcm(r[0],r[1])\r\n for i in range(2,n):\r\n lcm=find_lcm(lcm,r[i])\r\ncnt=0\r\nfor i in range(lcm):\r\n for j in range(n):\r\n if i%r[j]==m[j]:\r\n cnt+=1\r\n break\r\nprint(cnt/lcm)\r\n", "#!/usr/bin/env python\n\n\ndef should_wash(r, m, d):\n return any(d % mm == rr for mm, rr in zip(m, r))\n\n\ndef main():\n input()\n m = [int(x) for x in input().split()]\n r = [int(x) for x in input().split()]\n\n cnt = 0\n t = 100000\n\n for i in range(t):\n if should_wash(r, m, i):\n cnt += 1\n\n print(cnt / t)\n\n\nif __name__ == '__main__':\n main()\n", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n\r\nn = int(input())\r\nm = list(map(int, input().split()))\r\nr = list(map(int, input().split()))\r\nl = 1\r\ns = set()\r\nfor i in range(n):\r\n l = lcm(l, m[i])\r\nfor k in range(l // min(m) + 1):\r\n for j in range(n):\r\n if m[j] * k + r[j] <= l:\r\n s.add(m[j] * k + r[j])\r\nif 0 in s:\r\n s.remove(0)\r\nq = len(s)\r\nprint(q / l)\r\n", "n = int(input())\r\nm = [int(i) for i in input().split(\" \")]\r\nr = [int(i) for i in input().split(\" \")]\r\n\r\nL = 720720\r\nans = 0\r\n\r\nfor i in range(L):\r\n for j, k in zip(m, r):\r\n if i % j == k:\r\n ans += 1\r\n break\r\n\r\nprint(ans/L)", "##a\r\n##print([1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8092, 16184, 32368, 64736, 129472, 258944, 517888, 1035776, 2071552, 4143104, 8286208, 16572416, 33144832, 66289664, 132579328, 265158656, 530317312, 1060634624, 2121269248, 4242538496, 8485076992, 16970153984, 33940307968][int(input())])\r\n\r\n##b\r\ndef gcd(a,b):\r\n if(b):\r\n return gcd(b,a%b)\r\n else:\r\n return a\r\n\r\ndef lcm(A):\r\n m = A[0]\r\n for a in A[1:]:\r\n m = m * a // gcd(m,a)\r\n return m\r\n \r\n\r\nn = int(input())\r\nA = [int(s) for s in input().split()]\r\nB = [int(s) for s in input().split()]\r\nm = lcm(A)\r\n##print(m)\r\ncnt=0\r\nfor day in range(1,m+1):\r\n flag=True\r\n for j in range(n):\r\n if(day % A[j] == B[j]):\r\n flag=False\r\n break\r\n if(flag==False): cnt += 1\r\nprint(cnt/m)\r\n", "n=int(input())\r\nm = list(map(int,input().strip().split()))[:n]\r\nr = list(map(int,input().strip().split()))[:n]\r\ncounter=0\r\nfor i in range(0,10000000):\r\n for j in range (0,n):\r\n if (i%m[j]==r[j]):\r\n counter=counter+1\r\n break\r\nprint(counter/10000000)\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\nr = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in range(720720):\r\n\tfor j in range(n):\r\n\t\tif i % m[j] == r[j]:\r\n\t\t \tcnt += 1\r\n\t\t \tbreak\r\n\r\nprint(cnt / 720720)", "def scrambled(lst1, lst2):\r\n count = 0\r\n for i in range(360360):\r\n flag = 0\r\n for x, y in zip(lst2, lst1):\r\n if i % y == x:\r\n flag = 1\r\n break\r\n if flag:\r\n count += 1\r\n return \"{0:.6f}\".format(count / 360360)\r\n\r\n\r\nN = int(input())\r\nm = [int(j) for j in input().split()]\r\nr = [int(z) for z in input().split()]\r\nprint(scrambled(m, r))\r\n", "Maxv=720720\r\n\r\nn=int(input())\r\ns=0\r\n\r\nm=[int(i) for i in input().split()]\r\nr=[int(i) for i in input().split()]\r\n\r\nm.reverse()\r\nm.append(0)\r\nm.reverse()\r\nr.reverse()\r\nr.append(0)\r\nr.reverse()\r\n\r\nfor i in range(1,Maxv+1):\r\n for j in range(1,n+1):\r\n if i%m[j]==r[j]:\r\n s+=1\r\n break\r\n\r\nans=1.0*s/Maxv\r\nprint(\"%.6lf\"%ans)", "def gcd(a, b):\n\twhile b != 0:\n\t\ta %= b\n\t\ta, b = b, a\n\treturn abs(a)\n\ndef lcm(a, b):\n\treturn abs(a * b) // gcd(a, b)\n\nn = int(input())\nm = [int(i) for i in input().split()]\nr = [int(i) for i in input().split()]\n\nl = 1\nfor i in m:\n\tif i != 0:\n\t\tl = lcm(l, i)\n\n#print(l)\n\nc = 0\nfor d in range(l):\n\tf = False\n\tfor i in range(n):\n\t\tif (m[i] != 0) and (d % m[i] == r[i]):\n\t\t\tf = True\n\t\t\tbreak\n\tif f:\n\t\tc += 1\n\nprint(c / l)\n", "n = int(input())\r\nM = list(map(int, input().split()))\r\nR = list(map(int, input().split()))\r\nMax = 100000\r\nanswer = 0\r\nfor i in range(Max):\r\n for j in range(n):\r\n if (i % M[j] == R[j]):\r\n answer += 1\r\n break\r\nprint(answer / Max)", "import math\r\n\r\n\r\ndef find_lcm(num1, num2):\r\n if num1 > num2:\r\n num = num1\r\n den = num2\r\n else:\r\n num = num2\r\n den = num1\r\n rem = num % den\r\n while rem != 0:\r\n num = den\r\n den = rem\r\n rem = num % den\r\n gcd = den\r\n lcm = int(int(num1 * num2) / int(gcd))\r\n return lcm\r\n\r\n\r\nn = int(input())\r\nM = list(map(int, input().split()))\r\nR = list(map(int, input().split()))\r\n\r\n\r\nlcm = -1\r\n\r\ntry:\r\n num1 = M[0]\r\n num2 = M[1]\r\n lcm = find_lcm(num1, num2)\r\n\r\n for i in range(2, len(M)):\r\n lcm = find_lcm(lcm, M[i])\r\n\r\nexcept:\r\n lcm = M[0]\r\n\r\ncnt = 0\r\ncnt2 = 0\r\n\r\nfor i in range(lcm):\r\n b = True\r\n for j in range(n):\r\n if i % M[j] == R[j]:\r\n b = False\r\n break\r\n if not b:\r\n cnt2 += 1\r\n\r\nprint(cnt2 / lcm)\r\n", "#!/usr/bin/python\nimport re\nimport inspect\nfrom sys import argv, exit\n\ndef rstr():\n return input()\n\ndef rint():\n return int(input())\n\ndef rints(splitchar=' '):\n return [int(i) for i in input().split(splitchar)]\n\ndef varnames(obj, namespace=globals()):\n return [name for name in namespace if namespace[name] is obj]\n\ndef pvar(var, override=False):\n prnt(varnames(var), var)\n\ndef prnt(*args, override=False):\n if '-v' in argv or override:\n print(*args)\n\nif __name__ == '__main__':\n n = rint()\n M = rints()\n R = rints()\n prnt(n,M,R)\n\n done = 0\n\n totaldays = 100000\n\n day = 0\n while day < totaldays:\n for m,r in zip(M, R):\n if day % m == r:\n done += 1\n break\n day += 1\n\n pvar(done)\n print(done/totaldays)\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nalx=111111\r\ncnt=0\r\nfor i in range(alx+1):\r\n\tfor j in range(n):\r\n\t\tif i%a[j]==b[j]:\t\r\n\t\t\tcnt+=1\r\n\t\t\tbreak\r\nprint(round(cnt/alx, 6))", "n = int(input())\r\nm = list(map(int, input().split()))\r\nr = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in range(1, 1000001):\r\n for j in range(n):\r\n if i % m[j] == r[j]:\r\n cnt += 1\r\n break\r\n\r\nans = cnt / 1000000.0\r\nprint(\"%.6f\" % ans)\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\nr = list(map(int, input().split()))\r\ndays = 0\r\nfor i in range(pow(2, 17)):\r\n for j in range(n):\r\n if i % m[j] == r[j]:\r\n days += 1\r\n break\r\nprint(days / pow(2, 17))\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\nr = list(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 a > b:\r\n return gcd(a % b, b)\r\n else:\r\n return gcd(b % a, a)\r\n\r\n\r\nd = 1\r\nfor i in range(n):\r\n d = d * m[i] // gcd(d, m[i])\r\n\r\nc = 0\r\nfor j in range(1, d + 1):\r\n for i in range(n):\r\n if j % m[i] == r[i]:\r\n c += 1\r\n break\r\n\r\nprint(c / d)\r\n" ]

{"inputs": ["1\n2\n0", "2\n2 3\n1 0", "3\n2 4 4\n0 1 3", "1\n16\n15", "16\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15", "16\n5 6 9 13 13 15 9 10 2 6 10 11 12 7 4 8\n4 3 3 5 8 3 6 5 1 4 2 6 7 4 0 1", "8\n15 3 7 11 14 10 16 2\n0 2 1 4 0 0 13 1", "1\n7\n5", "9\n6 12 3 10 15 14 6 9 3\n5 2 0 6 1 1 2 2 2", "3\n9 12 6\n0 5 0", "5\n3 3 13 5 10\n1 0 1 4 2", "7\n3 15 11 4 12 15 12\n2 9 3 0 9 13 6", "2\n13 3\n6 0", "9\n15 9 7 4 14 14 2 11 13\n2 6 2 3 11 12 0 3 3", "1\n15\n1", "1\n6\n3", "4\n3 8 9 4\n1 6 7 3", "7\n15 9 9 2 6 8 3\n10 2 7 1 3 2 0", "10\n9 8 7 7 16 3 10 13 5 6\n2 0 0 4 1 0 3 12 1 5", "4\n10 15 2 9\n8 14 0 0", "12\n5 16 12 3 10 15 11 14 2 3 4 11\n3 14 1 0 7 9 10 12 1 2 2 6", "5\n16 6 4 15 2\n13 3 0 13 0", "14\n12 11 7 12 2 4 14 10 7 4 15 3 5 16\n2 8 0 9 0 1 4 0 5 3 11 1 0 6", "12\n8 5 5 12 12 14 14 16 5 11 9 3\n1 4 0 11 10 0 2 3 1 8 8 2", "10\n3 16 16 9 5 16 9 7 8 2\n0 1 7 2 1 9 0 4 4 1", "9\n14 14 5 8 16 2 11 7 11\n9 7 0 2 7 1 10 2 4", "7\n13 12 4 2 7 13 8\n4 6 0 0 3 9 3", "5\n4 15 9 16 6\n3 9 8 14 1", "3\n16 13 3\n11 5 1", "7\n10 15 9 5 9 15 16\n2 7 2 4 0 12 13", "10\n16 10 16 15 12 5 4 9 3 10\n9 0 1 2 9 4 1 8 0 8", "14\n14 8 6 12 13 15 2 3 16 15 15 15 16 8\n10 0 5 6 1 7 0 2 1 4 2 11 14 2", "2\n10 14\n2 5", "10\n2 15 15 4 3 10 8 14 12 12\n1 8 13 0 0 6 4 2 4 5", "3\n6 14 7\n4 2 0", "13\n3 4 16 11 12 13 12 12 3 16 8 13 4\n0 1 14 5 8 5 11 7 1 6 4 1 0"], "outputs": ["0.500000", "0.666667", "1.000000", "0.062500", "1.000000", "0.959707", "0.826840", "0.142857", "0.752381", "0.305556", "0.784615", "0.757576", "0.384615", "0.876790", "0.066667", "0.166667", "0.583333", "0.850000", "0.832418", "0.588889", "0.953247", "0.737500", "1.000000", "0.859307", "0.857143", "0.789610", "0.728022", "0.518056", "0.423077", "0.543056", "0.811111", "0.784615", "0.171429", "0.914286", "0.333333", "0.967949"]}

UNKNOWN

PYTHON3

CODEFORCES

25

8bfbb4d2c2d479b59b4a5cb61941820d

Hide-and-Seek

Victor and Peter are playing hide-and-seek. Peter has hidden, and Victor is to find him. In the room where they are playing, there is only one non-transparent wall and one double-sided mirror. Victor and Peter are points with coordinates (*x**v*,<=*y**v*) and (*x**p*,<=*y**p*) respectively. The wall is a segment joining points with coordinates (*x**w*,<=1,<=*y**w*,<=1) and (*x**w*,<=2,<=*y**w*,<=2), the mirror — a segment joining points (*x**m*,<=1,<=*y**m*,<=1) and (*x**m*,<=2,<=*y**m*,<=2). If an obstacle has a common point with a line of vision, it's considered, that the boys can't see each other with this line of vision. If the mirror has a common point with the line of vision, it's considered, that the boys can see each other in the mirror, i.e. reflection takes place. The reflection process is governed by laws of physics — the angle of incidence is equal to the angle of reflection. The incident ray is in the same half-plane as the reflected ray, relative to the mirror. I.e. to see each other Victor and Peter should be to the same side of the line, containing the mirror (see example 1). If the line of vision is parallel to the mirror, reflection doesn't take place, and the mirror isn't regarded as an obstacle (see example 4). Victor got interested if he can see Peter, while standing at the same spot. Help him solve this problem. The first line contains two numbers *x**v* and *y**v* — coordinates of Victor. The second line contains two numbers *x**p* and *y**p* — coordinates of Peter. The third line contains 4 numbers *x**w*,<=1, *y**w*,<=1, *x**w*,<=2, *y**w*,<=2 — coordinates of the wall. The forth line contains 4 numbers *x**m*,<=1, *y**m*,<=1, *x**m*,<=2, *y**m*,<=2 — coordinates of the mirror. All the coordinates are integer numbers, and don't exceed 104 in absolute value. It's guaranteed, that the segments don't have common points, Victor and Peter are not on any of the segments, coordinates of Victor and Peter aren't the same, the segments don't degenerate into points. Output YES, if Victor can see Peter without leaving the initial spot. Otherwise output NO. Sample Input -1 3 1 3 0 2 0 4 0 0 0 1 0 0 1 1 0 1 1 0 -100 -100 -101 -101 0 0 1 1 0 1 1 0 -1 1 1 3 0 0 10 0 100 100 101 101 1 0 3 0 Sample Output NO NO YES YES

[ "xv,yv=list(map(int,input().split()))\r\nxp,yp=list(map(int,input().split()))\r\nxw1,yw1,xw2,yw2=list(map(int,input().split()))\r\nxm1,ym1,xm2,ym2=list(map(int,input().split()))\r\ndef a(x1,y1,x2,y2,x3,y3,x4,y4):\r\n if x1==x2:\r\n if x3==x4:\r\n return False\r\n else:\r\n k2=(y3-y4)/(x3-x4)\r\n b2=y3-k2*x3\r\n return min(y3,y4)<=k2*x1+b2<=max(y3,y4) and min(y1,y2)<=k2*x1+b2<=max(y1,y2) and min(x3,x4)<=x1<=max(x3,x4) and min(x1,x2)<=x1<=max(x1,x2)\r\n else:\r\n if x3==x4:\r\n k1=(y1-y2)/(x1-x2)\r\n b1=y1-k1*x1\r\n return min(y3,y4)<=k1*x3+b1<=max(y3,y4) and min(y1,y2)<=k1*x3+b1<=max(y1,y2) and min(x3,x4)<=x3<=max(x3,x4) and min(x1,x2)<=x3<=max(x1,x2)\r\n else:\r\n k1=(y1-y2)/(x1-x2)\r\n b1=y1-k1*x1\r\n k2=(y3-y4)/(x3-x4)\r\n b2=y3-k2*x3\r\n if k1==k2:\r\n return b1==b2 and min(x1,x2)<=min(x3,x4)<=max(x1,x2) and min(y1,y2)<=min(y3,y4)<=max(y1,y2)\r\n x=(b2-b1)/(k1-k2)\r\n y=k1*x+b1\r\n return min(y3,y4)<=y<=max(y3,y4) and min(y1,y2)<=y<=max(y1,y2) and min(x3,x4)<=x<=max(x3,x4) and min(x1,x2)<=x<=max(x1,x2)\r\ndef b(xm1,xm2,ym1,ym2,x,y):\r\n if ym1==ym2:\r\n xi=x\r\n yi=2*ym1-y\r\n elif xm1==xm2:\r\n yi=y\r\n xi=2*xm1-x\r\n else:\r\n k1=-(xm1-xm2)/(ym1-ym2)\r\n b1=y-k1*x\r\n k2=(ym1-ym2)/(xm1-xm2)\r\n b2=ym1-k2*xm1\r\n x1=(b2-b1)/(k1-k2)\r\n xi=2*x1-x\r\n yi=k1*xi+b1\r\n return [xi,yi]\r\nxw3,yw3=b(xm1,xm2,ym1,ym2,xw1,yw1)\r\nxw4,yw4=b(xm1,xm2,ym1,ym2,xw2,yw2)\r\nif a(xv,yv,xp,yp,xw1,yw1,xw2,yw2) or a(xv,yv,xp,yp,xm1,ym1,xm2,ym2):\r\n xip,yip=b(xm1,xm2,ym1,ym2,xp,yp)\r\n if [xip,yip]!=[xv,yv] and a(xv,yv,xip,yip,xm1,ym1,xm2,ym2) and not(a(xv,yv,xip,yip,xw1,yw1,xw2,yw2)) and not(a(xv,yv,xip,yip,xw3,yw3,xw4,yw4)):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('YES')" ]

{"inputs": ["-1 3\n1 3\n0 2 0 4\n0 0 0 1", "0 0\n1 1\n0 1 1 0\n-100 -100 -101 -101", "0 0\n1 1\n0 1 1 0\n-1 1 1 3", "0 0\n10 0\n100 100 101 101\n1 0 3 0", "0 0\n1 1\n100 100 101 101\n-100 -100 -101 -101", "-1 1\n1 1\n0 3 0 4\n0 0 0 2", "0 0\n2 0\n1 1 1 -1\n0 2 1 2", "0 0\n2 0\n1 1 1 -1\n-10 2 -12 2", "0 0\n2 0\n0 2 2 2\n1 1 1 -1", "0 0\n2 0\n0 2 2 2\n1 0 1 -1", "0 0\n2 0\n0 2 2 2\n1 1 1 0", "0 0\n3 0\n0 2 2 2\n1 0 2 0", "0 0\n3 0\n1 0 2 0\n0 2 2 2", "0 0\n3 0\n1 0 2 0\n-10 2 -12 2", "0 0\n5 0\n1 0 2 0\n3 0 4 0", "0 0\n10 0\n0 1 10 1\n1 0 9 0", "0 0\n2 0\n1 1 1 -1\n0 2 2 2", "0 0\n2 0\n1 1 1 -1\n1 2 2 2", "-1 2\n1 2\n0 2 0 4\n0 0 0 1", "-1 4\n1 4\n0 2 0 4\n0 0 0 1", "-1 5\n1 5\n0 2 0 4\n0 0 0 1", "-1 2\n1 2\n0 3 0 4\n0 0 0 2", "5023 -2243\n5648 1799\n1758 9228 -5815 3403\n-5967 -5718 -9900 -7956", "5498 9900\n7010 -7756\n-7598 8619 -7166 -3069\n-7486 -727 -9707 7115", "5974 2044\n8371 6409\n-675 4290 -8517 -9542\n-9005 4263 -9763 -8777", "2729 -5812\n9733 574\n9967 3682 -9868 3984\n9477 9254 2347 3997", "3205 -9947\n7374 -5260\n-3110 3073 5060 -2488\n7958 -5755 -7406 -816", "3680 2196\n8736 8904\n7532 2465 3709 -8961\n6439 -765 3053 3026", "4156 -5659\n-9903 3069\n-5545 1857 2358 4566\n4920 4225 5236 7868", "4632 -9795\n7738 -6486\n1377 1248 1007 -1906\n3402 9216 250 6991", "5108 2348\n9100 7679\n-7980 640 -4064 -8379\n1883 -5793 9041 8957", "509 -7077\n1396 9890\n1192 2964 -1072 -8932\n-3260 -6877 -1781 1603", "9060 4628\n5720 -2370\n-1791 9325 1552 -3684\n-161 -4597 2287 -3890", "-2389 53\n-9955 5368\n-4775 -593 7898 -2157\n6659 1403 9634 -3275", "6161 -4520\n-5630 -3171\n-7760 9489 -9477 -630\n9758 7404 -4730 -8056", "-5289 7185\n-5026 4568\n9256 -429 -3131 4617\n-7143 -6595 -5505 -370", "3261 2610\n-701 -7693\n6272 9652 -506 6144\n-322 -4315 -1436 -2142", "-8188 -5684\n3623 46\n3288 -265 5839 7672\n2776 1685 2632 -7636", "362 9742\n7948 7786\n303 6095 -7816 9199\n5875 7686 6702 6871", "-7366 1446\n-7727 -754\n-2680 -3822 -5191 -5553\n-7304 -6313 -9229 1377", "1184 -3127\n-7123 6985\n-1943 6259 1154 -4026\n-4205 -4033 -5160 -4115", "-4496 6192\n-8443 7736\n2227 9746 -7197 6992\n-4002 -6638 7315 -9557", "-3802 -741\n-9954 6119\n-1364 -1523 -8659 2791\n6451 -4606 -7143 2288", "-3107 -7674\n4815 780\n-4957 3486 1980 -2625\n-432 -4075 -9497 -171", "1307 5392\n3305 -837\n-8550 -7782 5287 1042\n-2922 -287 8944 3865", "2001 2179\n-1925 -2455\n7858 948 71 2256\n4850 9947 1159 2295", "2696 -4753\n-3435 -7793\n4265 5958 -3218 -8692\n4458 4449 4175 1539", "7111 8313\n-4946 -9411\n672 -5310 -7733 -1889\n378 8589 -915 7675", "7806 5101\n9823 8971\n-6640 -300 9044 7390\n-2297 -3829 7806 2982", "-7779 -1832\n8313 7354\n9767 8430 -8438 -3487\n3855 4077 1085 -5181", "-7086 -8767\n6803 2015\n6175 -6560 3372 573\n256 3769 393 9678", "6777 -4260\n1717 5583\n3262 248 5800 1524\n9267 -7380 8541 5269", "3336 -9832\n-9350 -9113\n-939 3907 -3643 -9931\n8186 6365 6202 6802", "-6319 2768\n-431 5862\n-5417 8036 -5331 3150\n2385 -1888 3450 7359", "-7267 -975\n-7760 5217\n-9341 -5054 -7370 3072\n-4926 1220 7603 -1721", "9293 -6547\n4895 -9479\n2738 -1395 8489 -8324\n3540 -4860 -8555 1675", "5851 7882\n-6171 -4174\n-1463 5985 4956 -8663\n6370 -9777 -864 9154", "-1311 2310\n2764 1131\n-1964 -5465 -199 2630\n-5664 9644 9110 2262", "-4752 -3262\n-4582 6436\n-8997 -6490 -4630 1426\n-9865 -6697 -2371 -5622", "-8193 -8833\n4353 -8260\n2214 683 -8074 -8978\n5548 -850 -1486 -8372", "4646 5596\n-2993 766\n2443 -3831 3479 5022\n-1987 4342 9668 7192", "1772 9009\n-8123 3429\n-1873 9437 -2887 -997\n8018 -9250 -5090 -9980", "97 -43\n7213 -4204\n5460 -8068 4212 -2411\n9853 -8477 7807 6052", "-823 -3132\n-1924 -8397\n3277 5496 -1772 -6699\n-5322 -4634 922 182", "7880 -7342\n1175 7552\n-6177 6690 6086 -2763\n6149 -2325 8602 -8496", "-3417 8449\n7996 3499\n3163 7949 5262 4575\n1340 -17 -3934 8703", "5286 518\n-8906 -4274\n-2162 1352 -751 -3408\n-3469 2291 -9521 -462", "-1541 -7140\n-3434 7016\n-831 6470 -4500 2354\n-5503 -553 -5998 6361", "-3234 2278\n-1683 1276\n-8143 -2879 -903 2275\n9053 -2468 7486 6408", "-8607 4167\n4114 -152\n3668 -1725 -7827 4541\n-5338 9216 880 9081", "-1971 -1636\n8799 -5185\n2406 2302 1967 -7166\n-4122 5320 7348 337", "-1541 -7140\n-3434 7016\n-831 6470 -7233 -5530\n-5503 -553 -5998 6361", "-9867 3736\n2889 5086\n2601 -5285 -8930 4748\n-3752 511 3554 1104", "3874 -278\n-8905 -3524\n-1544 -3249 4063 -111\n-59 1361 7173 -847", "5567 -9695\n5625 2216\n1965 -7804 8129 -7554\n1665 -446 5340 7652", "-8240 -4453\n8478 -878\n7033 7520 -1002 -3146\n-9913 8035 -9876 -8757", "866 4303\n-2945 -7242\n-8638 4653 -1155 -7439\n-950 -5491 2786 3812", "1462 5132\n-8664 2428\n175 -8258 -9863 8483\n-5685 3527 1556 5387", "866 4303\n-2945 -7242\n-8638 4653 -1155 -7439\n-950 -5491 2786 3812", "-8836 -5283\n-5804 9454\n-4442 76 -9550 -986\n-5178 -982 -7763 -7108"], "outputs": ["NO", "NO", "YES", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO"]}

UNKNOWN

PYTHON3

CODEFORCES

1

8c0044cad84ef54874eff46f8f5fe656

Sonya and Matrix

Since Sonya has just learned the basics of matrices, she decided to play with them a little bit. Sonya imagined a new type of matrices that she called rhombic matrices. These matrices have exactly one zero, while all other cells have the Manhattan distance to the cell containing the zero. The cells with equal numbers have the form of a rhombus, that is why Sonya called this type so. The Manhattan distance between two cells ($x_1$, $y_1$) and ($x_2$, $y_2$) is defined as $|x_1 - x_2| + |y_1 - y_2|$. For example, the Manhattan distance between the cells $(5, 2)$ and $(7, 1)$ equals to $|5-7|+|2-1|=3$. Note that rhombic matrices are uniquely defined by $n$, $m$, and the coordinates of the cell containing the zero. She drew a $n\times m$ rhombic matrix. She believes that you can not recreate the matrix if she gives you only the elements of this matrix in some arbitrary order (i.e., the sequence of $n\cdot m$ numbers). Note that Sonya will not give you $n$ and $m$, so only the sequence of numbers in this matrix will be at your disposal. Write a program that finds such an $n\times m$ rhombic matrix whose elements are the same as the elements in the sequence in some order. The first line contains a single integer $t$ ($1\leq t\leq 10^6$) — the number of cells in the matrix. The second line contains $t$ integers $a_1, a_2, \ldots, a_t$ ($0\leq a_i< t$) — the values in the cells in arbitrary order. In the first line, print two positive integers $n$ and $m$ ($n \times m = t$) — the size of the matrix. In the second line, print two integers $x$ and $y$ ($1\leq x\leq n$, $1\leq y\leq m$) — the row number and the column number where the cell with $0$ is located. If there are multiple possible answers, print any of them. If there is no solution, print the single integer $-1$. Sample Input 20 1 0 2 3 5 3 2 1 3 2 3 1 4 2 1 4 2 3 2 4 18 2 2 3 2 4 3 3 3 0 2 4 2 1 3 2 1 1 1 6 2 1 0 2 1 2 Sample Output 4 5 2 2 3 6 2 3 -1

[ "import collections\ndd = lambda: collections.defaultdict(int)\n\nt = int(input())\ncnt = [0] * t\nfor i in map(int, input().split()):\n cnt[i] += 1\n\nds = [c - 2 * b + a for a, b, c in zip([0, 0] + cnt, [0] + cnt + [0], cnt + [0, 0])]\nds[0] -= 1; ds[1] -= 2; ds[2] -= 1;\n\ndef bop(D):\n while D:\n i = min(D)\n if D[i]:\n D[i] += 1\n D[i+1] += 1\n return i\n else:\n del D[i]\n return 420\n\ndef f(D, x = [], y = []):\n if len(D) > 12 or max(len(x), len(y)) > 2: return\n if len(x) == len(y) == 2: yield x + y\n\n a = bop(D)\n\n E = D.copy()\n for i in y: E[a+i] -= 1\n yield from f(E, x + [a], y)\n\n E = D.copy()\n for i in x: E[i+a] -= 1\n yield from f(E, x, y + [a])\n\ndef gen(s):\n D = dd()\n for i in s:\n D[i] -= 1\n D[i+1] -= 1\n for i in s[:2]:\n for j in s[2:]:\n D[i+j] += 1\n return {i: v for i, v in D.items() if v}\n\nD = dd() | {i: v for i, v in enumerate(ds) if v}\nfor s in f(D.copy()):\n if gen(s) == D:\n a, b, c, d = s\n print(a + b - 1, c + d - 1)\n print(a, c)\n break\nelse:\n print(-1)\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef test(n, m, x, y, d):\r\n d2 = [0 for i in range(len(d))]\r\n for i in range(n):\r\n for j in range(m):\r\n D = abs(i-x)+abs(j-y)\r\n if D >= len(d2):\r\n return False\r\n d2[D]+=1\r\n return d==d2\r\n \r\ndef process(A):\r\n t = len(A)\r\n if t==1 and A==[0]:\r\n return [1, 1, 1, 1]\r\n M = max(A)\r\n d = [0 for i in range(M+1)]\r\n for x in A:\r\n d[x]+=1\r\n if d[0] != 1:\r\n return [-1, None, None, None]\r\n first_fail = None\r\n for i in range(1, M+1):\r\n if d[i] != 4*i:\r\n first_fail = i\r\n break\r\n if first_fail is None:\r\n return [-1, None, None, None]\r\n x = first_fail-1\r\n #closest distance of (a, b) to an edge\r\n #is uh first_fail-1\r\n #(n, m, x, y)\r\n #I think we can flip around so farthest corner is at (0, m-1)\r\n #so n-1-x+m-1-y = M\r\n #y = x+m-1-M\r\n #m-y = M-x+1\r\n #and uh\r\n #n*m = t\r\n for m in range(1, t+1):\r\n if t % m==0:\r\n n = t//m\r\n y = n-1-x+m-1-M\r\n if 0 <= x <= n-1 and 0 <= y <= m-1 and M == max(\r\n abs(x)+abs(y), abs(x)+abs(m-1-y), abs(n-1-x)+abs(y), abs(n-1-x)+abs(m-1-y)):\r\n if test(n, m, x, y, d):\r\n return [n, m, x+1, y+1]\r\n return [-1, None, None, None]\r\n \r\n \r\nt = int(input())\r\nA = [int(x) for x in input().split()]\r\nn, m, x, y = process(A)\r\nif n==-1:\r\n print('-1')\r\nelse:\r\n print(f'{n} {m}')\r\n print(f'{x} {y}')" ]

{"inputs": ["20\n1 0 2 3 5 3 2 1 3 2 3 1 4 2 1 4 2 3 2 4", "18\n2 2 3 2 4 3 3 3 0 2 4 2 1 3 2 1 1 1", "6\n2 1 0 2 1 2", "1\n0", "7\n0 1 2 3 4 2 6", "6\n0 0 0 0 0 0", "4\n0 0 0 0"], "outputs": ["4 5\n2 2", "3 6\n2 3", "-1", "1 1\n1 1", "-1", "-1", "-1"]}

UNKNOWN

PYTHON3

CODEFORCES

2

8c3e4d39eb3fa9adae0ac0d73286f72e

none

Oleg writes down the history of the days he lived. For each day he decides if it was good or bad. Oleg calls a non-empty sequence of days a zebra, if it starts with a bad day, ends with a bad day, and good and bad days are alternating in it. Let us denote bad days as 0 and good days as 1. Then, for example, sequences of days 0, 010, 01010 are zebras, while sequences 1, 0110, 0101 are not. Oleg tells you the story of days he lived in chronological order in form of string consisting of 0 and 1. Now you are interested if it is possible to divide Oleg's life history into several subsequences, each of which is a zebra, and the way it can be done. Each day must belong to exactly one of the subsequences. For each of the subsequences, days forming it must be ordered chronologically. Note that subsequence does not have to be a group of consecutive days. In the only line of input data there is a non-empty string *s* consisting of characters 0 and 1, which describes the history of Oleg's life. Its length (denoted as |*s*|) does not exceed 200<=000 characters. If there is a way to divide history into zebra subsequences, in the first line of output you should print an integer *k* (1<=≤<=*k*<=≤<=|*s*|), the resulting number of subsequences. In the *i*-th of following *k* lines first print the integer *l**i* (1<=≤<=*l**i*<=≤<=|*s*|), which is the length of the *i*-th subsequence, and then *l**i* indices of days forming the subsequence. Indices must follow in ascending order. Days are numbered starting from 1. Each index from 1 to *n* must belong to exactly one subsequence. If there is no way to divide day history into zebra subsequences, print -1. Subsequences may be printed in any order. If there are several solutions, you may print any of them. You do not have to minimize nor maximize the value of *k*. Sample Input 0010100 111 Sample Output 3 3 1 3 4 3 2 5 6 1 7 -1

[ "# Codeforces Submission\n# User : sudoSieg\n# Time : 14:50:08\n# Date : 21/10/2020\n\nimport io\nimport os\n#input = lambda: io.BytesIO(os.read(0, os.fstat(0).st_size)).readline().strip()\nvalid = True\ns = input()\nze = []\noe = []\n\nfor i, j in enumerate(s):\n if j == '0':\n if len(oe) != 0:\n x = oe.pop()\n x.append(i + 1)\n ze.append(x)\n else:\n ze.append([i + 1])\n else:\n if len(ze) != 0:\n x = ze.pop()\n x.append(i + 1)\n oe.append(x)\n else:\n print(\"-1\")\n exit()\nif len(oe) != 0:\n print(-1)\nelse:\n print(len(ze))\n for i in ze:\n print(len(i), end=' ')\n print(*i)\n", "s = input()\r\no = -1\r\nsol=[]\r\np = True\r\nfor i in range(0,len(s)):\r\n if s[i]=='0':\r\n if o == -1:\r\n sol.append([i+1])\r\n else:\r\n sol[o].append(i+1)\r\n o-=1\r\n else:\r\n o+=1\r\n if o == len(sol):\r\n p = False\r\n break\r\n else:\r\n sol[o].append(i+1)\r\nif p==False or o !=-1:\r\n print(\"-1\")\r\nelse:\r\n print(len(sol))\r\n print(\"\\n\".join([str(len(sub)) + \" \" + \" \".join(map(str, sub)) for sub in sol]))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\na = []\r\nb = []\r\nfor i, j in enumerate(s):\r\n if j == '0':\r\n if len(b):\r\n x = b.pop()\r\n x.append(i+1)\r\n a.append(x)\r\n else:\r\n a.append([i+1])\r\n else:\r\n if len(a):\r\n x = a.pop()\r\n x.append(i+1)\r\n b.append(x)\r\n else:\r\n print(-1)\r\n exit()\r\nif len(b):\r\n print(-1)\r\nelse:\r\n print(len(a))\r\n for i in a:\r\n print(len(i), ' '.join(map(str, i)))", "# A. Zebras\r\n\r\nfrom collections import deque\r\n# Deque (Doubly Ended Queue) en Python. \r\n# Deque es preferible a una lista en los casos en los que necesitamos operaciones de adición y \r\n# extracción más rápidas desde ambos extremos (lef and right), ya que deque tiene complejidad de tiempo O(1) \r\n# para las operaciones de adición y extracción en comparación con la lista que tiene O(n).\r\n# append():- inserta un elemento en el extremo derecho de la deque (equivalente a un enqueue).\r\n# popleft():- saca un elemento en el extrermo izquierdo de la dequ (equivalente a un dequeue).\r\ns = input() # se lee la cadena s de entrada que representa la historia de Olaf. \r\n\r\nalmost_zebra = deque() # cola que va guardando las secuencias zebras\r\nzebra = deque() # cola que va guardando las secuencias que si se le agrega un '0' se convierten en zebras\r\n\r\n\r\n\r\nfor index,c in enumerate(s): # se itera por cada caracter de la cadena\r\n # El método enumerate() agrega un contador a un iterable y lo devuelve en forma de objeto de enumeración. \r\n # Este objeto enumerado puede usarse directamente para ciclos o convertirse en una lista de tuplas usando el método list()\r\n if c =='1': # Si el próximo caracter de la secuencia es un '1' \r\n if not zebra: # if la cola donde estan las secuencias zebra esta vacia no es posible dividir el string en subsequencias de zebra\r\n break # se rompe el ciclo pues ya no es necesario seguir revisando\r\n else: # sino es porque hay al menos una secuencia en zebra\r\n old_zebra = zebra.popleft() # se saca de la cola la proxima secuencia de zebra\r\n old_zebra.append(index+1) # se agrega la posicion del '1' a la secuencia los dias de la historia de Olaf se numeran a partir de 1 por se se pone index + 1\r\n # Al agregar '1' a alguna zebra pasa a covertirese en almost zebra '010' + '1' -> '0101'\r\n almost_zebra.append(old_zebra) # se agrega la secuencia a la cola almost zebra\r\n\r\n else: # en caso contrario es porque es un '0'\r\n if almost_zebra: # si la cola almost_zebra no esta vacia\r\n old_almost_zebra = almost_zebra.popleft() # saca la proxima secuencia de la cola\r\n old_almost_zebra.append(index+1) # se agrega la posicion correspondiente al '0' a la secuencia los dias de la historia de Olaf se numeran a partir de 1 por se se pone index + 1\r\n zebra.append(old_almost_zebra) # se agrega la secuencia a la cola de zebra pues una casi zebra termina en '1' y al agregarlo un '0' pasa a ser una zebra.\r\n else: # en caso contrario no hay secuencias en la cola almost_zebra por tanto se forma una secuencia ['0'] que tambien es una zebra\r\n zebra.append([index+1]) # se agrega la posion del '0' a la secuencia y luego se agrega la secuencia a la cola zebra\r\n\r\nif not zebra or almost_zebra: # si no hay elementos en la cola zebra o quedan elementos en la cola almost zebra es porque no es posible dividir la cadena en zebra y almost zebra\r\n print(-1) # se imprime en consola -1 pues no se puede dividir la historia de Olaf en zebras\r\nelse: # en caso contrario se encontro una forma de subdivir la historia olaf en zebras\r\n print(len(zebra)) # se imprima la cantidad de subsecuencias que subdividen la historia e olaf en zebras\r\n for z in zebra: # se itera por cada subsecuencia zebra\r\n temp = [str(i) for i in z] # se convierte a string cada intero de la subsecuencia que representa la posicion de los elementos en la cadena que forman la misma\r\n print(len(temp), \" \".join(temp)) # se imprime por cada subecuencia zebra su longitud y cada uno de sus elementos separados por espacio (el join es muy comodo para hacer eso)\r\n", "# A. Zebras\r\n\r\nfrom collections import deque\r\n\r\n\r\ns = input() # input string\r\n\r\nalmost_zebra = deque() # store almost zebra sequences\r\nzebra = deque() # store zebra sequences\r\n\r\n\r\n\r\nfor index,c in enumerate(s): # iterate through string\r\n if c =='1': # if c is 1\r\n if not zebra: # if zebra is empty no es posible dividir el string en subsequencias de zebra\r\n break\r\n else:\r\n old_zebra = zebra.popleft() # hazle pop al the zebra \r\n old_zebra.append(index+1) # append index+1 to zebra sequence corresponding to '1'\r\n # Al agregar '1' a alguna zebra pasa a covertirese en almost zebra\r\n almost_zebra.append(old_zebra) # agrega zebra a almost zebra\r\n\r\n else:\r\n if almost_zebra: # if almost zebra is not empty\r\n old_almost_zebra = almost_zebra.popleft() # hazle pop al the almost zebra\r\n old_almost_zebra.append(index+1) # append index+1 to almost zebra sequence corresponding to '0'\r\n zebra.append(old_almost_zebra) # agrega almost zebra a zebra\r\n else:\r\n zebra.append([index+1]) # if almost zebra is empty, add index+1 to zebra sequence corresponding to '0'\r\n\r\nif not zebra or almost_zebra: # if zebra is empty or almost zebra is not empty es porque no es posible dividir la cadena en zebra y almost zebra\r\n print(-1)\r\nelse:\r\n print(len(zebra)) # print len(zebra)\r\n for z in zebra: # iterate through zebra\r\n temp = [str(i) for i in z]\r\n print(len(temp), \" \".join(temp)) #\r\n", "\n\"\"\"\nrefer： https://blog.csdn.net/xiaoxiede_wo/article/details/79625689\n\"\"\"\n\n# from sortedcontainers import SortedList\nimport sys\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\nprintf = lambda d: sys.stdout.write(str(d) + \"\\n\")\n\ns = input()\n\nres = [[] for _ in range(len(s))]\nr = 0 # cur row， point for insert 0\nk = 0 # max row\nfor i, v in enumerate(s):\n if v == \"0\":\n res[r].append(i+1)\n r += 1\n else:\n if r == 0:\n print(\"-1\")\n exit(0)\n r -= 1 # insert 1 for last row\n res[r].append(i+1) # r point at insert 0\n k = max(k, r) # max row\n # print(i, r, res)\n\nif k != r:\n print(\"-1\")\n exit(0)\nelse:\n print(k)\n for r in res[:k]:\n r = [str(i) for i in r]\n print(len(r), \" \".join(r))\n", "s = input()\r\narr, zero, one = [], [], []\r\nfor i in range(len(s)):\r\n if s[i] == '0':\r\n if one:\r\n idx = one.pop()\r\n arr[idx].append(i + 1)\r\n zero.append(idx)\r\n else:\r\n zero.append(len(arr))\r\n arr.append([i + 1])\r\n else:\r\n if not zero:break\r\n idx = zero.pop()\r\n one.append(idx)\r\n arr[idx].append(i + 1)\r\nif arr and zero and not one:\r\n print(len(arr))\r\n for x in zero:\r\n print(len(arr[x]), end=' ')\r\n print(*arr[x])\r\nelse:print(-1)", "import sys\r\nimport bisect\r\n#input=sys.stdin.readline\r\n#t=int(input())\r\nt=1\r\nmod=10**9+7\r\nfor _ in range(t):\r\n #n=int(input())\r\n #n,m=map(int,input().split())\r\n s=input()\r\n #l=list(map(int,input().split()))\r\n #pref=[[0 for j in range(3001)] for i in range(n+2)]\r\n d={}\r\n for i in range(len(s)+1):\r\n d[i]=[]\r\n z=[]\r\n nz=[]\r\n l3=[]\r\n upto=1\r\n for i in range(len(s)):\r\n ch=1\r\n if s[i]=='0':\r\n if len(nz)>0:\r\n index=nz.pop()\r\n d[index].append(i+1)\r\n z.append(index)\r\n else:\r\n z.append(upto)\r\n d[upto].append(i+1)\r\n upto+=1\r\n else:\r\n if len(z)>0:\r\n index=z.pop()\r\n d[index].append(i+1)\r\n nz.append(index)\r\n else:\r\n ch=0\r\n break\r\n if ch==0:\r\n break\r\n #print(d) \r\n if ch==0 or len(nz)>0:\r\n print(-1)\r\n else:\r\n print(upto-1)\r\n for i in range(1,upto):\r\n print(len(d[i]),*d[i]) \r\n \r\n ", "s = input()\r\none = -1\r\nans=[]\r\np = True\r\nfor i in range(0,len(s)):\r\n if s[i]=='0':\r\n if one == -1:\r\n ans.append([i+1])\r\n else:\r\n ans[one].append(i+1)\r\n one-=1\r\n else:\r\n one+=1\r\n if one == len(ans):\r\n p = False\r\n break\r\n else:\r\n ans[one].append(i+1)\r\n #print(ans)\r\nif p==False or one !=-1:\r\n print(\"-1\")\r\nelse:\r\n print(len(ans))\r\n print(\"\\n\".join([str(len(sub)) + \" \" + \" \".join(map(str, sub)) for sub in ans]))", "import sys\n\ndef solve(days):\n zebras = []\n azebras = []\n\n for i in range(len(days)):\n if days[i] == 1:\n if not zebras:\n return (False, [])\n seq = zebras.pop()\n seq.append(i)\n azebras.append(seq)\n else:\n if not azebras:\n zebras.append([i])\n else:\n seq = azebras.pop()\n seq.append(i)\n zebras.append(seq)\n \n if azebras:\n return (False, [])\n\n return (True, zebras)\n\n\ndef main():\n days = [int(i) for i in sys.stdin.readline().strip()]\n ok, seqs = solve(days)\n\n if not ok:\n print(-1)\n else:\n print(len(seqs))\n for seq in seqs:\n print(len(seq), \" \".join([str(i+1) for i in seq]))\n\n\nif __name__ == '__main__':\n main()\n", "def read_int():\n return int(input())\n\ndef read_str():\n return input()\n\ndef read_list(t=int):\n return list(map(t, input().split()))\n\ndef print_list(x):\n print(len(x), ' '.join(map(str, x)))\n\n# ------------------------------\n\ndef work(seqs):\n\tans = [[] for i in range(seqs)]\n\tsi = 0\n\tneed0 = deque(range(seqs))\n\tneed1 = deque([])\n\tfor i in range(len(s)):\n\t\tif s[i] == '0':\n\t\t\tif not len(need0):\n\t\t\t\treturn False\t\t\n\t\t\tsi = need0.popleft()\n\t\t\tneed1.append(si)\n\n\t\tif s[i] == '1':\n\t\t\tif not len(need1):\n\t\t\t\treturn False\t\n\t\t\tsi = need1.popleft()\n\t\t\tneed0.append(si)\n\t\tans[si].append(i+1)\n\treturn ans\n\n# ------------------------------\n\nfrom collections import deque\n\ns = read_str()\n\nseqs = s.count('0') - s.count('1')\n\nif seqs <= 0:\n\tprint(-1)\n\texit(0)\n\nans = work(seqs)\nif not work(seqs):\n\tprint(-1)\nelse:\n\tprint(seqs)\n\tfor seq in ans:\n\t\tprint_list(seq)", "s = input()\r\nres, p = [], -1\r\n\r\nfor i in range(len(s)):\r\n j = i + 1\r\n if s[i] == '0':\r\n if p > -1:\r\n res[p].append(j)\r\n p -= 1\r\n else:\r\n res.append([j])\r\n else:\r\n p += 1\r\n if p >= len(res):\r\n print(-1)\r\n exit()\r\n res[p].append(j) \r\n\r\nif p != -1:\r\n print(-1)\r\n exit() \r\n\r\nprint(len(res))\r\nfor x in res:\r\n print(len(x), *x)\r\n", "import sys\r\n\r\ns = sys.stdin.readline().strip()\r\n\r\nq = [[], []]\r\n\r\nfor i, c in enumerate(s):\r\n k = int(c)\r\n if not q[1 - k]:\r\n if k == 1:\r\n sys.stdout.write('-1')\r\n sys.exit(0)\r\n q[k].append([i + 1])\r\n else:\r\n q[k].append(q[1 - k].pop())\r\n q[k][-1].append(i + 1)\r\n\r\nif q[1]:\r\n sys.stdout.write('-1')\r\nelse:\r\n ans = [str(len(q[0]))]\r\n for it in q[0]:\r\n ans.append(f'{len(it)} {\" \".join(map(str, it))}')\r\n sys.stdout.write('\\n'.join(ans))\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ns = input().strip()\r\nn = len(s)\r\nans = [[] for _ in range(200005)]\r\ncnt = 0; mx = 0\r\nfor i in range(n):\r\n if s[i] == '0':\r\n ans[cnt].append(i+1)\r\n cnt += 1\r\n else:\r\n cnt -= 1\r\n if cnt < 0: print(-1); quit()\r\n ans[cnt].append(i+1)\r\n mx = max(mx, cnt)\r\n\r\nif cnt != mx: print(-1); quit()\r\nprint(mx)\r\nfor i in range(mx):\r\n print(len(ans[i]), *ans[i])\r\n \r\n# https://www.luogu.com.cn/blog/lfzyzs-qiuw/solution-cf949a", "import copy\r\nimport gc\r\nimport itertools\r\nfrom array import array\r\nfrom fractions import Fraction\r\nimport heapq\r\nimport math\r\nimport operator\r\nimport os, sys\r\nimport profile\r\nimport cProfile\r\nimport random\r\nimport re\r\nimport string\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import defaultdict, deque, Counter\r\nfrom functools import reduce, lru_cache\r\nfrom io import IOBase, BytesIO\r\nfrom itertools import count, groupby, accumulate, permutations, combinations_with_replacement, product\r\nfrom math import gcd\r\nfrom operator import xor, add\r\nfrom typing import List\r\n\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n# print = lambda d: sys.stdout.write(str(d)+\"\\n\")\r\ndef read_int_list(): return list(map(int, input().split()))\r\ndef read_int_tuple(): return tuple(map(int, input().split()))\r\ndef read_int(): return int(input())\r\n\r\n\r\n# endregion\r\n\r\n### CODE HERE\r\n\r\n# f = open('inputs', 'r')\r\n# def input(): return f.readline().rstrip(\"\\r\\n\")\r\n\r\ndef solve(s):\r\n zeros, ones = [], []\r\n for i, ch in enumerate(s, 1):\r\n if int(ch):\r\n if zeros:\r\n last_zero = zeros.pop()\r\n last_zero.append(i)\r\n ones.append(last_zero)\r\n else:\r\n print(-1)\r\n return\r\n else:\r\n if ones:\r\n last_one = ones.pop()\r\n last_one.append(i)\r\n zeros.append(last_one)\r\n else:\r\n zeros.append([i])\r\n\r\n # print(zeros, ones)\r\n if ones:\r\n print(-1)\r\n return\r\n\r\n print(len(zeros))\r\n for row in zeros:\r\n print(len(row), end=' ')\r\n print(*row)\r\n\r\ndef main():\r\n solve(input())\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n# cProfile.run(\"main()\")\r\n", "s = input()\r\nv = []\r\nfor x in range (200000) :\r\n v.append([])\r\nidx = 0\r\npos = 0\r\nsz = 0\r\nfor x in s : \r\n if (x == '0') :\r\n v[idx].append(pos + 1)\r\n idx += 1\r\n else :\r\n if (idx == 0) :\r\n print(\"-1\")\r\n exit()\r\n idx -= 1\r\n v[idx].append(pos + 1)\r\n pos += 1\r\n sz = max(sz, idx)\r\nif (sz != idx) : \r\n print(\"-1\")\r\n exit()\r\nprint (idx)\r\nat = 0\r\nwhile (at < idx) : \r\n print (len(v[at]), end = \" \")\r\n att = 0\r\n for x in v[at] :\r\n print (x, end = \" \")\r\n at += 1\r\n print(\"\")", "\r\n\r\nfrom collections import deque\r\n\r\ndef zebras(s):\r\n\r\n zbs=[]\r\n alzbs=[]\r\n\r\n for i in range(n):\r\n if s[i]=='0':\r\n if not alzbs:\r\n zbs.append([i+1])\r\n else:\r\n tmp=alzbs.pop()\r\n tmp.append(i+1)\r\n zbs.append(tmp)\r\n\r\n else:\r\n if not zbs:\r\n return -1,None\r\n\r\n tmp=zbs.pop()\r\n tmp.append(i+1)\r\n alzbs.append(tmp)\r\n\r\n if alzbs:\r\n return -1,None\r\n\r\n return 1,zbs\r\n\r\n\r\n\r\ns=input()\r\nn=len(s)\r\nnum0=s.count('0')\r\nnum1=s.count('1')\r\n\r\nif num0-num1<1:\r\n print(-1)\r\nelse:\r\n res=zebras(s)\r\n if res[0]==-1:\r\n print(-1)\r\n else:\r\n print(len(res[1]))\r\n for x in res[1]:\r\n print(len(x),*x)\r\n\r\n\r\n\r\n", "from collections import deque\r\ns=[int(el) for el in input()]\r\nones=[]\r\nzero=[]\r\ni=len(s)\r\nans=[-1]*(len(s)+1)\r\nt=0\r\nfor el in s[::-1]:\r\n if el==0:\r\n if ones:\r\n ans[i]=ones.pop()\r\n zero.append(ans[i])\r\n else:\r\n t+=1\r\n ans[i]=t\r\n zero.append(t)\r\n else:\r\n if zero:\r\n ans[i]=zero.pop()\r\n ones.append(ans[i])\r\n else:\r\n t+=1\r\n ans[i]=t\r\n ones.append(t)\r\n i-=1\r\np=[[] for _ in range(t+1)]\r\nfor i in range(len(s)):\r\n p[ans[i+1]].append(i+1)\r\nf=True\r\nfor el in p:\r\n if len(el) and (s[el[-1]-1]==1 or s[el[0]-1]==1) :\r\n f=False\r\nif f:\r\n print(t)\r\n for el in p[1:]:\r\n print(len(el),*el)\r\nelse:\r\n \r\n print(-1)\r\n", "s = input()\na = []\ni = -1\nok = True\n\nfor j in range(len(s)):\n if s[j] == '1':\n i += 1\n if i == len(a):\n ok = False\n break\n else:\n a[i].append(j)\n if s[j] == '0':\n if i == -1:\n a.append([j])\n else:\n a[i].append(j)\n i -= 1\n\nif not ok or i != -1:\n print(-1)\nelse:\n print(len(a))\n for v in a:\n print(len(v), end = ' ')\n for x in v:\n print(x + 1, end = ' ')\n print()" ]

{"inputs": ["0010100", "111", "0", "1", "0101010101", "010100001", "000111000", "0101001000", "0000001000", "0101", "000101110", "010101010", "0101001010", "0100101100", "0110100000", "0000000000", "1111111111", "0010101100", "1010000", "0001110", "0000000000011001100011110101000101000010010111000100110110000011010011110110001100100001001001010010", "01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010", "0010011100000000"], "outputs": ["3\n1 1\n5 2 3 4 5 6\n1 7", "-1", "1\n1 1", "-1", "-1", "-1", "3\n3 1 6 7\n3 2 5 8\n3 3 4 9", "4\n5 1 2 3 4 5\n3 6 7 8\n1 9\n1 10", "8\n1 1\n1 2\n1 3\n1 4\n1 5\n3 6 7 8\n1 9\n1 10", "-1", "-1", "1\n9 1 2 3 4 5 6 7 8 9", "2\n5 1 2 3 4 5\n5 6 7 8 9 10", "2\n5 1 2 3 8 9\n5 4 5 6 7 10", "-1", "10\n1 1\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10", "-1", "2\n3 1 8 9\n7 2 3 4 5 6 7 10", "-1", "-1", "22\n1 1\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n7 9 24 25 26 27 28 29\n7 10 13 14 17 18 23 30\n11 11 12 15 16 19 22 31 32 33 34 35\n3 20 21 36\n3 37 46 47\n9 38 39 40 45 48 57 58 75 76\n17 41 42 43 44 49 50 51 54 55 56 59 72 73 74 77 80 81\n9 52 53 60 71 78 79 82 83 84\n7 61 64 65 66 67 70 85\n5 62 63 68 69 86\n3 87 88 89\n3 90 91 92\n5 93 94 95 96 97\n3 98 99 100", "1\n245 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 ...", "8\n3 1 8 9\n5 2 3 4 7 10\n3 5 6 11\n1 12\n1 13\n1 14\n1 15\n1 16"]}

UNKNOWN

PYTHON3

CODEFORCES

19

8c4a32fe0eb2f98ede0b2c62a4d73b97

Harmony Analysis

The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson until the teacher gave the group a simple task: find 4 vectors in 4-dimensional space, such that every coordinate of every vector is 1 or <=-<=1 and any two vectors are orthogonal. Just as a reminder, two vectors in *n*-dimensional space are considered to be orthogonal if and only if their scalar product is equal to zero, that is: Danil quickly managed to come up with the solution for this problem and the teacher noticed that the problem can be solved in a more general case for 2*k* vectors in 2*k*-dimensinoal space. When Danil came home, he quickly came up with the solution for this problem. Can you cope with it? The only line of the input contains a single integer *k* (0<=≤<=*k*<=≤<=9). Print 2*k* lines consisting of 2*k* characters each. The *j*-th character of the *i*-th line must be equal to '<=*<=' if the *j*-th coordinate of the *i*-th vector is equal to <=-<=1, and must be equal to '<=+<=' if it's equal to <=+<=1. It's guaranteed that the answer always exists. If there are many correct answers, print any. Sample Input 2 Sample Output ++** +*+* ++++ +**+

[ "p = [[0]]\r\nfor i in range(int(input())):\r\n p = [t + t for t in p] + [[1 - q for q in t] + t for t in p]\r\nfor t in p: print(''.join('+*'[q] for q in t))", "from functools import reduce\nfrom operator import *\nfrom math import *\nfrom sys import *\nfrom string import *\nfrom collections import *\nsetrecursionlimit(10**7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\ndef inv(x):\n s=\"\"\n for i in x:\n s+= \"+*\"[i=='+']\n return s\nx=['+']\nn=RI()[0]\nfor i in range(n):\n t=[]\n for j in range(len(x)):\n t.append(x[j]+x[j])\n t.append(x[j]+inv(x[j]))\n x=t\nprint(*x, sep='\\n')\n\n\n", "def invert(a):\r\n for i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j]==1:\r\n a[i][j]=0\r\n else:\r\n a[i][j]=1\r\n return a\r\nk=int(input())\r\na=[[1]]\r\nif k==0:\r\n print('+')\r\n exit()\r\nfor i in range(1,k+1):\r\n ans=[None]*(2**i)\r\n ares=[]\r\n for j in a:\r\n ares1=[]\r\n for u in j:\r\n if u==1:\r\n ares1.append(1)\r\n else:\r\n ares1.append(0)\r\n ares.append(ares1)\r\n invert(ares)\r\n for j in range((2**i)//2):\r\n ans[j]=a[j]+a[j]\r\n for j in range((2**i)//2,2**i):\r\n ans[j]=a[j-(2**i)//2]+ares[j-(2**i)//2]\r\n a=ans\r\nfor i in a:\r\n for j in i:\r\n if j==1:\r\n print('+',end='')\r\n else:\r\n print('*',end='')\r\n print()\r\n", "# by the authority of GOD author: manhar singh sachdev #\r\n\r\nimport os,sys\r\nfrom io import BytesIO,IOBase\r\nfrom array import array\r\n\r\ndef main():\r\n k = int(input())\r\n if not k:\r\n print('+')\r\n exit()\r\n an = [array('i',[1,-1]),array('i',[1,1])]\r\n for _ in range(k-1):\r\n for j in range(len(an)):\r\n an[j] += an[j]\r\n for j in range(len(an)):\r\n an.append(an[j][:])\r\n for l in range(len(an[-1])//2):\r\n an[-1][l] *= -1\r\n for i in an:\r\n print(''.join(map(lambda xx:'+'if xx==1 else '*',i)))\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()", "def solve():\n K = int(input())\n\n e = [[\"++\", \"**\"], [\"+*\", \"*+\"]]\n vs = [\"+\"]\n for i in range(K):\n nv = []\n for j in range(2):\n for v in vs:\n x = []\n for c in v:\n x.append(e[j][0] if c == '+' else e[j][1])\n nv.append(''.join(x))\n vs = nv\n\n for v in vs:\n print(v)\n\n\nif __name__ == '__main__':\n solve()\n", "n = int(input())\r\nans=[[1]]\r\nk=0\r\nwhile k<n:\r\n k+=1\r\n for i in range(len(ans)):\r\n ans[i].extend(ans[i]) \r\n for i in range(len(ans)):\r\n ans.append(ans[i][:])\r\n for i in range(int(len(ans)/2),len(ans)):\r\n for j in range(int(len(ans[i])/2),len(ans[i])):\r\n ans[i][j]*=(-1)\r\n# print(ans)\r\nfor i in ans:\r\n for j in i:\r\n if j==-1:\r\n print('*',end='')\r\n else:\r\n print('+',end='')\r\n print() \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\nk = int(input())\r\nx = [[43]]\r\nfor _ in range(k):\r\n l = len(x)\r\n for i in range(l):\r\n y = list(x[i])\r\n x.append(list(x[i]))\r\n for j in range(l):\r\n x[i].append(y[j])\r\n x[i + l].append(y[j] ^ 1)\r\nans = [\"\".join([chr(i) for i in y]) for y in x]\r\nsys.stdout.write(\"\\n\".join(ans))", "k = int(input())\r\n\r\na = [['' for _ in range(2 ** k)] for _ in range(2 ** k)]\r\na[0][0] = '+'\r\n\r\nfor m in range(1, k+1):\r\n p = 2 ** (m - 1)\r\n for i in range(p):\r\n for j in range(p):\r\n a[p+i][j] = a[i][j]\r\n if i % 2 == 0:\r\n a[i][p+j] = '*' if a[i][j] == '+' else '+'\r\n a[p+i][p+j] = a[i][j]\r\n else:\r\n a[i][p+j] = a[i][j]\r\n a[p+i][p+j] = '*' if a[i][j] == '+' else '+'\r\n\r\nprint('\\n'.join(''.join(x) for x in a))", "import sys\ninput=sys.stdin.readline\ndef neg(a):\n b=\"\"\n for i in range(len(a)):\n if a[i]==\"+\":\n b+=\"*\"\n else:\n b+=\"+\"\n return b\n \nn=int(input())\na=\"+\"\ne=[a]\nfor i in range(n):\n for j in range(2**i):\n b=e[j]\n e[j]+=b\n e.append(b+neg(b))\nfor i in range(len(e)):\n print(e[i])\n \t \t\t\t \t \t \t \t \t \t\t\t\t \t\t\t", "k = int(input())\r\n\r\ndef reflect(matrix):\r\n temp = list(matrix)\r\n\r\n for i in range(len(matrix)):\r\n matrix[i] = list(matrix[i])\r\n\r\n temp.reverse()\r\n return temp\r\n\r\ndef invert(matrix):\r\n temp = list(matrix)\r\n\r\n for i in range(len(temp)):\r\n temp[i] = list(temp[i])\r\n\r\n for i in range(len(temp)):\r\n for j in range(len(temp[i])):\r\n temp[i][j] = not temp[i][j]\r\n\r\n return temp\r\n\r\nseed = [[True]]\r\n\r\nwhile k > 0:\r\n refl = reflect(seed)\r\n inve = invert(refl)\r\n\r\n seedlen = len(seed)\r\n invelen = len(inve)\r\n\r\n for i in range(seedlen):\r\n seed[i].extend(seed[i])\r\n\r\n for i in range(invelen):\r\n inve[i].extend(refl[i])\r\n\r\n seed.extend(inve)\r\n k -= 1\r\n\r\n\r\nline = ''\r\nfor i in range(len(seed)):\r\n for j in range(len(seed[i])):\r\n if seed[i][j] == True:\r\n line += '+'\r\n else:\r\n line += '*'\r\n print(line)\r\n line = ''", "def solve(x):\r\n ans=[]\r\n for l in x:\r\n if l==\"+\":\r\n ans.append(\"*\")\r\n elif l==\"*\":\r\n ans.append(\"+\")\r\n return (\"\").join(ans)\r\n \r\nk=int(input())\r\nif k==0:\r\n print(\"+\")\r\nelse:\r\n m,s=[\"++\",\"+*\"],1\r\n for i in range(k-1):\r\n m*=2\r\n s*=2\r\n for j in range(s):\r\n m[j]+=m[j]\r\n m[s+j]+=solve(m[s+j])\r\n for y in m:\r\n print(y)", "a=int(input())\r\ndef anti(s):\r\n s1=''\r\n for i in s:\r\n if i==\"+\":\r\n s1+=\"*\"\r\n else:\r\n s1+=\"+\"\r\n return s1\r\n \r\ndef f(k):\r\n if k==0:\r\n return ['*',]\r\n l=f(k-1)\r\n l2=[]\r\n for m in l:\r\n l2.append(m+m)\r\n l2.append(m+anti(m))\r\n return l2\r\n\r\nfor k in f(a):\r\n print(k)", "def vec(x):\r\n\tif x == 0:\r\n\t\treturn [[1]]\r\n\tx -= 1\r\n\ts = vec(x)\r\n\ty = vec(x)\r\n\tfor i in range(2**x):\r\n\t\tfor j in range(2**x):\r\n\t\t\ty[i][j] = -y[i][j]\r\n\ta = [s[i]+y[i] for i in range(2**x)]\r\n\tb = [s[i]+s[i] for i in range(2**x)]\r\n\treturn a + b\r\n\r\nx = int(input())\r\ns = vec(x)\r\nfor i in range(2**x):\r\n\tres = ''\r\n\tfor j in range(2**x):\r\n\t\tres += '+' if s[i][j] == 1 else '*'\r\n\tprint(res)\r\n", "k = int(input())\n\ndef solve(k):\n if k==0:\n return [[1]]\n r=solve(k-1)\n res=[]\n for v in r:\n res.append(v+v)\n res.append(v+[x*-1 for x in v])\n return res\n\nres = solve(k)\nfor v in res:\n s = \"\"\n for x in v:\n if x==1:\n s+=\"+\"\n else:\n s+=\"*\"\n print(s)", "def minusv(L):\n\n return [-x for x in L]\n\n\n\ndef adamar(M):\n\n return [L*2 for L in M] + [L + minusv(L) for L in M]\n\n\n\nk = int(input())\n\na = [[1]]\n\nfor i in range(k):\n\n a = adamar(a)\n\nfor L in a:\n\n print(''.join(['+' if c==1 else '*' for c in L]))\n\n\n\n\n\n# Made By Mostafa_Khaled" ]

{"inputs": ["2", "1", "3", "0", "4", "5", "6", "7", "8", "9"], "outputs": ["++++\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+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+...", "+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++..."]}

UNKNOWN

PYTHON3

CODEFORCES

15

8c79b8c1ac558a266dbe4c8f55ed51e7

Vasya and Beautiful Arrays

Vasya's got a birthday coming up and his mom decided to give him an array of positive integers *a* of length *n*. Vasya thinks that an array's beauty is the greatest common divisor of all its elements. His mom, of course, wants to give him as beautiful an array as possible (with largest possible beauty). Unfortunately, the shop has only one array *a* left. On the plus side, the seller said that he could decrease some numbers in the array (no more than by *k* for each number). The seller can obtain array *b* from array *a* if the following conditions hold: *b**i*<=><=0; 0<=≤<=*a**i*<=-<=*b**i*<=≤<=*k* for all 1<=≤<=*i*<=≤<=*n*. Help mom find the maximum possible beauty of the array she will give to Vasya (that seller can obtain). The first line contains two integers *n* and *k* (1<=≤<=*n*<=≤<=3·105;<=1<=≤<=*k*<=≤<=106). The second line contains *n* integers *a**i* (1<=≤<=*a**i*<=≤<=106) — array *a*. In the single line print a single number — the maximum possible beauty of the resulting array. Sample Input 6 1 3 6 10 12 13 16 5 3 8 21 52 15 77 Sample Output 3 7

[ "n, k = map(int, input().split())\nt = set(map(int, input().split()))\ny = x = min(t)\nt = list(t)\nwhile True:\n for i in t:\n if i % x > k: x = i // (i // x + 1)\n if y == x: break\n y = x\nprint(y)\n", "n,k=map(int,input().split())\r\nt=set(map(int,input().split()))\r\ny=x=min(t)\r\nt=list(t)\r\nwhile True:\r\n for i in t:\r\n if i%x>k:x=i//(i//x+1)\r\n if y==x:break\r\n y=x\r\nprint(y)", "n,k=map(int,input().split())\nt=set(map(int,input().split()))\ny=x=min(t)\nt=list(t)\nwhile True:\n for i in t:\n if i%x>k:x=i//(i//x+1)\n if y==x:break\n y=x\nprint(y)\n" ]

{"inputs": ["6 1\n3 6 10 12 13 16", "5 3\n8 21 52 15 77", "13 11\n55 16 26 40 84 80 48 52 25 43 75 21 58", "18 9\n85 29 29 15 17 71 46 69 48 80 44 73 40 55 61 57 22 68", "25 7\n67 18 36 85 64 22 32 66 17 64 66 65 82 36 16 52 19 70 38 51 17 32 85 16 64", "7 1\n12 84 21 60 33 21 45", "1 1\n1", "10 10\n40141 53368 66538 64507 78114 34253 73242 42141 37430 6", "10 7\n869 1293 12421 1 90901 120214 12403 6543 591870 124", "2 84794\n1000000 1000000"], "outputs": ["3", "7", "16", "13", "16", "4", "1", "6", "1", "1000000"]}

UNKNOWN

PYTHON3

CODEFORCES

3

8c94a95b56f6f7c5dcc0c59a65f20967

Anton and Chess

Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an infinite one instead. The first task he faced is to check whether the king is in check. Anton doesn't know how to implement this so he asks you to help. Consider that an infinite chess board contains one white king and the number of black pieces. There are only rooks, bishops and queens, as the other pieces are not supported yet. The white king is said to be in check if at least one black piece can reach the cell with the king in one move. Help Anton and write the program that for the given position determines whether the white king is in check. Remainder, on how do chess pieces move: - Bishop moves any number of cells diagonally, but it can't "leap" over the occupied cells. - Rook moves any number of cells horizontally or vertically, but it also can't "leap" over the occupied cells. - Queen is able to move any number of cells horizontally, vertically or diagonally, but it also can't "leap". The first line of the input contains a single integer *n* (1<=≤<=*n*<=≤<=500<=000) — the number of black pieces. The second line contains two integers *x*0 and *y*0 (<=-<=109<=≤<=*x*0,<=*y*0<=≤<=109) — coordinates of the white king. Then follow *n* lines, each of them contains a character and two integers *x**i* and *y**i* (<=-<=109<=≤<=*x**i*,<=*y**i*<=≤<=109) — type of the *i*-th piece and its position. Character 'B' stands for the bishop, 'R' for the rook and 'Q' for the queen. It's guaranteed that no two pieces occupy the same position. The only line of the output should contains "YES" (without quotes) if the white king is in check and "NO" (without quotes) otherwise. Sample Input 2 4 2 R 1 1 B 1 5 2 4 2 R 3 3 B 1 5 Sample Output YES NO

[ "s, n = {}, int(input())\r\nx, y = map(int, input().split())\r\nfor i in range(n):\r\n t, a, b = input().split()\r\n u, v = int(a) - x, int(b) - y\r\n a = (abs(u) == abs(v))\r\n b = (u == 0 or v == 0)\r\n d = abs(u) + abs(v)\r\n p = (u < 0, v < 0, u > 0, v > 0)\r\n q = (d, t in 'Q' + 'RB'[a])\r\n if a or b: s[p] = min(s[p], q) if p in s else q\r\nprint('YES' if any(t for d, t in s.values()) else 'NO')" ]

{"inputs": ["2\n4 2\nR 1 1\nB 1 5", "2\n4 2\nR 3 3\nB 1 5", "5\n-1 1\nR -10 10\nQ -9 9\nQ -2 -8\nB -6 10\nB -10 1", "20\n-321 454\nQ 967 -89\nR -811 454\nQ -404 454\nR -734 454\nQ -804 454\nQ -316 77\nQ -802 454\nB -499 454\nQ 401 -663\nQ -601 454\nQ -974 454\nB 710 298\nB -917 454\nB -555 -542\nQ -337 950\nR 501 40\nR 355 310\nB 657 -374\nR -860 454\nR 839 -10", "3\n-1000000000 -1000000000\nB 1000000000 -1000000000\nB -1000000000 1000000000\nB 1000000000 1000000000", "4\n1000000000 -1000000000\nB -1000000000 -1000000000\nB -1000000000 1000000000\nB 1000000000 1000000000\nR 0 0", "5\n-1000000000 1000000000\nR -1000000000 -1000000000\nB 1000000000 -1000000000\nR 1000000000 1000000000\nB -1000000000 0\nB 0 1000000000", "6\n-1000000000 1000000000\nR -1000000000 -1000000000\nB 1000000000 -1000000000\nR 1000000000 1000000000\nB -1000000000 0\nB 0 1000000000\nQ 0 0", "5\n1000000000 1000000000\nQ -1000000000 -1000000000\nQ -1000000000 1000000000\nQ 1000000000 -1000000000\nB 1000000000 0\nB 0 1000000000", "6\n1000000000 1000000000\nQ -1000000000 -1000000000\nQ -1000000000 1000000000\nQ 1000000000 -1000000000\nB 1000000000 0\nB 0 1000000000\nR 0 0", "6\n-1000000000 -1000000000\nB 1000000000 1000000000\nR 0 0\nQ 2 2\nR 4851521 8054854\nR -1000000000 1000000000\nB -1000000000 379", "4\n0 0\nB 0 1\nB -1 0\nR 1 1\nQ -1 -1", "3\n0 0\nR -1 -1\nR 1 -1\nB 0 1", "2\n0 0\nR 0 2\nB 0 1", "2\n5 5\nR 7 5\nB 6 5", "2\n1 1\nR 1 3\nB 1 2", "2\n0 0\nB 1 0\nR -2 0", "2\n4 2\nB 1 5\nR 3 3", "1\n0 0\nB 1 -1", "2\n0 0\nB 2 2\nR 1 1", "2\n1 0\nR 0 -1\nB 3 2"], "outputs": ["YES", "NO", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "NO", "YES"]}

UNKNOWN

PYTHON3

CODEFORCES

1

8c973212d593a4182fe97b22e3f856eb

Olesya and Rodion

Olesya loves numbers consisting of *n* digits, and Rodion only likes numbers that are divisible by *t*. Find some number that satisfies both of them. Your task is: given the *n* and *t* print an integer strictly larger than zero consisting of *n* digits that is divisible by *t*. If such number doesn't exist, print <=-<=1. The single line contains two numbers, *n* and *t* (1<=≤<=*n*<=≤<=100, 2<=≤<=*t*<=≤<=10) — the length of the number and the number it should be divisible by. Print one such positive number without leading zeroes, — the answer to the problem, or <=-<=1, if such number doesn't exist. If there are multiple possible answers, you are allowed to print any of them. Sample Input 3 2 Sample Output 712

[ "n, t=(map(int,input().split()))\r\nif n==1 and t==10:\r\n print(-1)\r\nelif n>=2 and t ==10:\r\n for i in range((n-1)):\r\n print('1',end=\"\")\r\n print(0)\r\nelse:\r\n for i in range((n)):\r\n print(t,end=\"\")\r\n ", "n,t = map(int,input().split())\r\ns = '1'\r\ni = 1\r\nwhile i <= n-1:\r\n s += '0'\r\n i += 1\r\nw = s + '0'\r\nnum1 = int(s)\r\nnum2 = int(w)\r\nwhile num1 < num2:\r\n if num1 % t == 0:\r\n print(num1)\r\n break\r\n else:\r\n num1 += 1\r\nif num1 == num2:\r\n print(-1)", "n,t=map(int,input().split())\r\na=10**(n-1-(t>9))\r\nprint([t*a,-1][a<1])", "a,b=map(int,input().split())\r\nfor x in range(10**(a-1),10**a):\r\n if x%b==0:\r\n print(x)\r\n exit()\r\nprint(-1)\r\n", "info = list(map(int, input().split()))\r\nn = info[0]\r\nt = str(info[1])\r\nif n == 1 and t == '10':\r\n print('-1')\r\nelif t == '10':\r\n print(t+(n-2)*'0')\r\nelse:\r\n print(t+(n-1)*'0')", "n,t=map(int,input().split())\r\nn=10**(n-1)\r\nif t*(n//t+1)<10*n:\r\n print(t*(n//t+1))\r\nelse:\r\n print(-1)", "import math\r\n\r\nx = list(map(int,input().split()))\r\nif(x[0] ==1 and x[1] == 10):\r\n print(-1)\r\n exit()\r\nsol = x[1]\r\nwhile(True) : \r\n div = math.floor(sol/(math.pow(10,x[0]-1)))\r\n if (div < 10 and div > 0):\r\n print(sol)\r\n exit()\r\n sol *= 2\r\nprint(-1)\r\n", "MOD = 1000000007\r\n\r\ndef main():\r\n n, t = map(int, input().split())\r\n ans = 0\r\n \r\n for i in range(10 ** (n - 1), 10 ** n):\r\n if i % t == 0:\r\n ans = i\r\n break\r\n else:\r\n ans = -1\r\n \r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,t=map(int,input().split())\r\nif(n==1 and t==10): print(\"-1\")\r\nelif(t==10):\r\n print(\"1\",end=\"\")\r\n for i in range(0,n-1):\r\n print(\"0\",end=\"\")\r\nelse:\r\n for i in range(0,n):\r\n print(t,end=\"\")\r\n ", "a,b = map(int,input().split())\r\nc = (10**a-1)//b*b\r\nprint([-1,c][c>0])\r\n", "def digit(n):\r\n dg = 0\r\n while n > 0:\r\n dg += 1\r\n n = n // 10\r\n return dg\r\n\r\n\r\nn, t = map(int, input().split())\r\nif digit(t)<=n:\r\n if t != 10:\r\n print(t*pow(10, n-1))\r\n else:\r\n print(t * pow(10, n - 2))\r\nelse:\r\n print(-1)", "l = input().split()\r\n\r\nn = int(l[0])\r\nt = int(l[1])\r\n\r\nans = 10**(n-1) -((10**(n-1))%t) + t\r\n\r\nif len(str(ans))!=n:\r\n print(-1)\r\nelse:\r\n print(ans)", "def main():\n n, t = list(map(int, input().split()))\n\n if t == 10 and n == 1:\n print(-1)\n elif t == 10 and n >= 2:\n print(\"1\"*(n-1)+\"0\")\n else:\n print(str(t)*n)\n\nmain()\n", "n, t = map(int, input().split())\r\nif len(str(10 ** (n - 1))) < len(str(t)):\r\n print(-1)\r\nelse:\r\n ans = 10 ** (n - 1)\r\n for i in range(12):\r\n if ans % t != 0:\r\n ans += 1\r\n else:\r\n print(ans)\r\n break", "n, t = [int(i) for i in input().split()]\r\nnum = int('1' + '0' * (n - 1))\r\nflag = True\r\nif num % t == 0:\r\n print(num)\r\n flag = False\r\nelse:\r\n while len(str(num)) == n:\r\n if num % t == 0:\r\n print(num)\r\n flag = False\r\n break\r\n else:\r\n num += 1\r\nif flag:\r\n print(-1)\r\n", "n, t = map(int, input().split())\r\nres = 10 ** (n-1)\r\nres += (t - res % t) % t\r\nif len(str(res)) == n:\r\n print(res)\r\nelse:\r\n print(-1)", "def ans(n,t):\r\n rem = (t - 10**(n-1) % t) % t\r\n for i in range(10**(n-1) + rem,10**n,t):\r\n if not i % t:\r\n return i\r\n return -1\r\nn,t = list(map(int,input().split()))\r\nprint(ans(n,t))", "nt = input().split()\r\nnt = [int(x) for x in nt]\r\nn = nt[0]\r\nt = nt[1]\r\n\r\n\r\ndef task(n,t):\r\n for i in range(10**(n-1), 10**n):\r\n if i%t == 0:\r\n return i\r\n\r\n return -1\r\n\r\n\r\nprint(task(n,t))", "n,t=map(int,input().split())\r\nif n<len(str(t)):\r\n ans=-1\r\nelse:\r\n ans = t*10**(n-len(str(t)))\r\nprint(ans)", "import math, heapq\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\nfrom itertools import permutations\r\nfrom copy import deepcopy\r\n\r\n \r\ndef sieve_of_eratosthenes(n):\r\n is_prime = [True] * (n+1)\r\n is_prime[0] = is_prime[1] = False\r\n for p in range(2, int(n**0.5)+1):\r\n if is_prime[p]:\r\n for i in range(p*p, n+1, p):\r\n is_prime[i] = False\r\n \r\n for i in range(2, n+1):\r\n if is_prime[i]:\r\n print(i, end=' ')\r\n\r\n\r\ndef isPowerOf2(n):\r\n\r\n def log2(x):\r\n\r\n if x == 0:\r\n return False\r\n\r\n return (math.log10(x)/math.log10(2))\r\n\r\n\r\n return math.ceil(log2(n)) == math.floor(log2(n))\r\n\r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\n\r\nn, t = readarray(int)\r\n\r\n\r\nlow = int(\"1\" + (\"0\" * (n-1)))\r\nhigh = int(\"1\" + (\"0\" * n))\r\n\r\nans = -1\r\nfor num in range(low, high):\r\n if num % t == 0:\r\n ans = num\r\n break\r\n\r\nprint(ans)", "#https://codeforces.com/problemset/problem/584/A\r\n\r\n(n, t) = (int(x) for x in input().split())\r\nanswers = False\r\nt_length = len(str(t))\r\nif(t>=10**n):\r\n answer = -1\r\nelse:\r\n answer = t*(10**abs(t_length-n))\r\nprint(answer)", "n, t = map(int, input().split())\nans = 10**(n - 1) + (t - 10**(n - 1) % t)\nif len(str(ans)) == n:\n print(ans)\nelse:\n print(-1)", "kal = [int(i) for i in input().split()]\r\nn = kal[0]\r\nt = kal[1]\r\n\r\nfor i in range(10**(n-1), 10**n):\r\n if i % t == 0:\r\n print(i)\r\n exit()\r\nprint(-1)", "n, t = map(int, input().split())\r\n\r\ny = \"1\" + \"0\" * (n - 1)\r\ny = int(y)\r\na = 0\r\n\r\nwhile True:\r\n if a >= 9:\r\n print(-1)\r\n break\r\n if y % t == 0:\r\n print(y)\r\n break\r\n else:\r\n y += 1\r\n a += 1", "def main():\r\n n, t = map(int, input().split())\r\n n = int(\"9\"*n)\r\n if n< t:\r\n print(-1)\r\n else:\r\n print(n-(n%t))\r\n \r\nmain()", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import *\r\n# map(int,input().split())\r\n \r\ndef solve():\r\n n,t=map(int,input().split())\r\n number=\"1\"+\"0\"*(n-1)\r\n number2=\"1\"+\"0\"*n\r\n ini=int(number)+1\r\n final=int(number2)\r\n for i in range(ini,final):\r\n if i%t==0:\r\n return i\r\n return -1\r\n\r\n#for _ in range(int(input())):\r\nprint(solve())", "# https://codeforces.com/problemset/problem/584/A\r\n\r\nn, t = map(int, input().split())\r\n\r\n# smallest number with n digits\r\nx = 10**(n-1)\r\n# largest number with n digits\r\ny = 10**n - 1\r\n\r\n# find the next multiple of t greater than or equal to x\r\nnext_multiple = ((x + t - 1) // t) * t\r\n\r\nif next_multiple > y:\r\n print(-1)\r\nelse:\r\n print(next_multiple)\r\n\r\n\r\n", "n = list(map(int,input().split()))\r\nif n[1] == 10 and n[0] != 1: n[1] = 1\r\n\r\nif n[1] == 10 and n[0] == 1: print(-1)\r\nelse: print(pow(10,n[0]-1)*n[1])", "n=[int(i) for i in input().split()]\r\nx=10**(n[0]-1)\r\nwhile x<=10**(n[0]-1)+n[1]:\r\n if x%n[1]==0:\r\n break\r\n x+=1\r\n\r\nif 10**n[0]-1<n[1]:\r\n x=-1\r\nprint(x)", "n , t = map(int , input().strip().split())\r\nif n== 1 and t == 10 :\r\n print(-1) \r\nelse:\r\n prec = 10**(n-1) \r\n while True :\r\n if prec %t == 0 and len(str(prec)) == n :\r\n print(prec)\r\n break \r\n prec +=1 \r\n \r\n \r\n", "for Ram in range(1):\r\n n,t=map(int,input().split())\r\n if t!=10:\r\n ans=str(t)*n\r\n else:\r\n if n!=1:\r\n ans=\"1\"+\"0\"*(n-1)\r\n else:\r\n ans=-1\r\n print(ans)", "digits,div=map(int,input().split())\r\nans=0\r\nfor i in range(10**(digits-1),10**(digits)):\r\n if(i%div==0):\r\n ans=i\r\n break\r\nprint(ans)if(ans)else print(-1)", "# Author : //- kibrom Hailu -\\\\\r\n\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter,defaultdict , deque \r\nfrom bisect import bisect , bisect_left ,bisect_right \r\nfrom itertools import accumulate \r\nfrom heapq import heapify , heappop , heappush , heappushpop , heapreplace\r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef solve():\r\n \r\n # write your code here \r\n n,t = II()\r\n\r\n if n == 1:\r\n if t == 10:\r\n return -1\r\n return t \r\n if t == 10:\r\n return 10**(n-1)\r\n else:\r\n return t*(10**(n-1))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nprint(solve())\r\n", "n, t = map(int, input().split())\r\nx = t\r\nif n== 1 and t == 10:\r\n print(-1)\r\n exit()\r\nwhile len(str(x)) != n:\r\n x *= t\r\nprint(x)\r\n", "t,n=map(int,input().split())\r\nif(t<=1 and n==10) :\r\n print(-1)\r\nelif(n==10) :\r\n print(n,end=\"\")\r\n for i in range(2,t) :\r\n print('0',end=\"\")\r\nelse :\r\n print(n,end=\"\")\r\n for i in range(1,t) :\r\n print('0',end=\"\")\r\nprint()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 25 10:48:46 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 53 - CF584-DIV2A\r\n\"\"\"\r\n\r\nn,t = map(int,input().split())\r\nif t == 10 and n > 1:\r\n print(pow(10,n-1))\r\nelif t == 10:\r\n print(-1)\r\nelse:\r\n print(pow(10,n-1)*t)", "x = input()\r\nl = x.split()\r\nn = int(l[0])\r\nt = int(l[1])\r\nnum = \"1\"\r\nfor i in range(n-1):\r\n num += \"0\"\r\nnum = int(num)\r\ndef find(num):\r\n for i in range(num , num*10):\r\n if i % t == 0 :\r\n return(i)\r\n return(-1)\r\nprint(find(num))\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n", "n,t=map(int,input().split())\r\nk=0\r\nif t==10:\r\n if n==1:\r\n print(-1)\r\n else:\r\n print(t**(n-1))\r\nelse:\r\n for i in range(n):\r\n k+=(10**i)*t\r\n print(k)", "n,t = map(int,input().split())\r\nstart=10**(n-1)\r\nend=(10**n)\r\nfor i in range(start,end):\r\n if i%t==0:\r\n print(i)\r\n break\r\nelse:\r\n print(-1)", "if __name__ == \"__main__\":\r\n n, t = map(int, input().split())\r\n\r\n if n < len(str(t)): print (-1)\r\n else:\r\n num = int(str(t) + ('0' * (n - len(str(t)))))\r\n print (num)", "num=input().split();\r\nif num[1]==\"10\":\r\n if int(num[0])<2:\r\n print(-1)\r\n else :\r\n print(1,end=\"\")\r\n for _ in range(int (num[0])-1):\r\n print(0,end=\"\")\r\n\r\nelse :\r\n for _ in range (int(num[0])):\r\n print(num[1],end=\"\")", "x = list(map(int, input().split()))\r\nz = []\r\nif x[1] != 10:\r\n for i in range(0, x[0]):\r\n z.append(str(x[1]))\r\nelif x[1] == 10 and x[0] > 1:\r\n for j in range(0, x[0]-1):\r\n if x[0] % 2 == 0:\r\n z.append(\"2\")\r\n else:\r\n z.append(\"2\")\r\n z.append(\"0\")\r\nelse:\r\n z = 0\r\nif z == 0:\r\n print(-1)\r\nelse:\r\n print(\"\".join(z))", "line = input().split(\" \")\na,b = int(line[0]),int(line[1])\n\n\ndef s(n1,n2):\n if(n1==1 and n2==10):return -1\n ret_num = 10**(n1-1)\n for i in range(2,11):\n if((ret_num+i)%n2==0):\n return ret_num+i\n \nprint(s(a,b))\n \t\t \t \t\t\t \t\t \t\t \t\t \t\t\t", "n,t = list(map(int, input().split()))\r\ns = int(str(t)+\"0\"*(n-len(str(t))))\r\nprint(s if len(str(s)) == n else -1)", "n , t = map(int, input().split())\r\nif t == 10 and n == 1:\r\n print(-1)\r\nelif t == 10:\r\n print(t*(10**(n-2)))\r\nelse:\r\n print(t*(10**(n-1))) ", "n, t = map(int, input().split())\r\na=10**(n-1-(t>9))\r\nprint([t*a,-1][a<1])", "n,t=[int(x) for x in input().split()]\r\n\r\nif t==10:\r\n\tif n==1:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(t*int('1'*(n-1)))\r\nelse:\r\n\tprint(t*int('1'*(n))) ", "n ,t = map(int, input().split())\r\nn = 10**(n - 1)\r\nb = (n//t) + 1\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n print(b*t)", "n,t=map(int,input().split())\r\nfor i in range(int(\"1\"+(n-1)*\"0\"),int(\"1\"+(n)*\"0\")):\r\n if i%t==0:print(i);break\r\n elif i==int(\"9\"*n):print(-1)", "s = list(map(int, input().split()))\r\nz = [(10 ** i) * 9 for i in range(s[0])]\r\nans = 0\r\nfor i in range(s[0]):\r\n if ans+(10**i) * s[1] <= sum(z):\r\n ans += (10**i) * s[1]\r\n\r\nif ans > sum(z) or ans == 0:\r\n ans = -1\r\n\r\nprint(ans)", "\r\nn, t = [int(k) for k in input().split()]\r\nif n == 1 and t == 10:\r\n print('-1')\r\nelse:\r\n kq = 1\r\n for i in range (n):\r\n kq *= 10\r\n kq -= 1\r\n print(int(kq - kq%t))", "#Amir_Python\nn, t=map(int, input().split())\nsign=False\nfor x in range(pow(10,n-1), pow(10,n)):\n if x%t==0:\n print(x)\n sign=True\n break\nif sign==False:\n print(\"-1\")", "import math\r\n\r\nn, t = map(int, input().split())\r\nnum1 = math.ceil((10 ** (n - 1)) / t)\r\nx = 1\r\nif ((10**n) / t) == math.floor((10**n) / t):\r\n x -= 1\r\nnum2 = math.floor((10**n) / t) + x\r\n\r\nif num1 == num2:\r\n print(-1)\r\nelse:\r\n print(math.ceil((num2 - num1) / 2) * t)", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\n# n = int(input())\r\n# arr = [int(x) for x in input().split()]\r\n\r\nn, t = get_ints()\r\n\r\nbase = pow(10, n-1)\r\n\r\nnumber = base\r\nif base%t != 0:\r\n number = base + (t - base%t)\r\n\r\nif number < base * 10:\r\n print(number)\r\nelse:\r\n print(\"-1\")\r\n \r\n ", "n,t = map(int,input().split())\r\nx= pow(10,n)\r\nif t>=x:\r\n print(-1)\r\nelse:\r\n if len(str(t))==n:\r\n print(t)\r\n else:\r\n print(((x-1)//t)*t)\r\n", "x,y=map(int,input().split())\r\nif 10**x-y==0:\r\n print(\"-1\") \r\nelif (10**x)%y!=0:\r\n print(10**x-(10**x%y))\r\nelse:\r\n print(10**x-y) ", "n,t=map(int,input().split())\r\n\r\nm=10**n-1\r\nans=1\r\n\r\nif n==1 and t==10:\r\n print(-1)\r\nelse:\r\n \r\n while ans==1:\r\n if m%t==0:\r\n print(m)\r\n ans=0\r\n break\r\n else:\r\n m-=1\r\n \r\n \r\n ", "n,t=[int(x) for x in input().split()]\r\nm=len(str(t))\r\nprint(-1 if m>n else int(str(t)+'0'*(n-m)))", "a=list(map(int,input().split()))\r\nif a[0]==1:\r\n if a[1]==10:\r\n print(-1)\r\n else:\r\n print(a[1])\r\nelse:\r\n if a[1]==10:\r\n print(int(\"1\"+\"0\"*(a[0]-1)))\r\n else:\r\n print(int(str(a[1])*a[0]))\r\n", "n,t=map(int,input().split())\r\nif 10**(n)-1<t:\r\n print(-1)\r\nelif 10**(n-1)%t==0:\r\n print(10**(n-1))\r\nelse:\r\n print((10**(n-1)//t+1)*t)", "n, t = map(int, input().split())\r\nif t == 10:\r\n if n == 1:\r\n print(-1)\r\n else:\r\n print(10**(n-1))\r\nelse:\r\n _10 = 10**(n-1)\r\n r = t-_10%t\r\n print(_10+r)", "N,T = map(int,input().split())\r\nX = (10**N-1)//T*T\r\nprint([-1,X][X>0])", "n, t = map(int, input().split())\r\nx = pow(10, n-1)\r\na= False\r\nif x*10-1>=t:\r\n while(x<x*10):\r\n if x%t==0:\r\n print(x)\r\n a=True\r\n break\r\n x+=1\r\nif not a:\r\n print(-1)", "x,y = map(int,input().split())\r\nif len(str(y))<x: \r\n print(y*(pow(10,x-len(str(y)))))\r\nelif len(str(y)) == x:\r\n print(y)\r\nelse:\r\n print(-1)", "n,t=map(int,input().split())\r\nx=int('9'*n)\r\ny=x//t\r\nx=y*t\r\nif(len(str(x))>n or y==0):print(-1)\r\nelse:print(x)", "x,y=map(int,input().split())\r\nz='9'*(x)\r\nc='1'*(x)\r\ns=0\r\nfor i in range(int(c),int(z)+1):\r\n if i%y==0:\r\n print(i)\r\n s+=1\r\n break\r\nif s!=1:\r\n print('-1') ", "kol,dell=map(int,input().split())\r\nif len(str(dell))>kol:\r\n print(-1)\r\nelse:\r\n num1=10**kol-1\r\n num2=num1%dell\r\n print(num1-num2)", "P,t=map(int,input().split())\r\na=10**(P-1-(t>9))\r\nprint([t*a,-1][a<1])", "def solve():\r\n n,t=map(int,input().split());ans=1;ans*=(10**(n-1))\r\n ans+=t-(ans%t)\r\n if len(str(ans))==n:print(ans)\r\n else:print(-1)\r\nsolve()\r\n", "n, t = map(int, input().split())\r\n\r\nnine = ''\r\n\r\nif n==1 and t==10:\r\n print('-1')\r\nelif n==1:\r\n print(t)\r\nelse:\r\n for i in range(n-1):\r\n nine+='9'\r\n\r\n print(int(nine)*t)", "n, m = map(int, input().split())\r\na = (10 ** n - 1) // m * m\r\nprint([-1, a][a > 0])", "n,t = map(int,input().split())\n# num = t\n# while len(str(num))< n :\n# num += k\n# if len(str(num)) == n :\n# print(num)\n# else :\n# print(-1)\nif n == 1 and t == 10 :\n print(-1)\n exit(0)\nnum = 10 ** (n-1)\nwhile num % t :\n num +=1\nprint(num)\n", "n,t = map(int,input().split())\r\nif n==1 and t ==10:\r\n print(-1)\r\nelif t<10:\r\n print((10**(n-1))*t)\r\nelse:\r\n print(10**(n-1))", "a=list(map(int,input().split()))\r\nn=a[0]\r\nt=a[1]\r\nif(t!=10):\r\n print(t,end='')\r\n for i in range(n-1):\r\n print(0,end='')\r\nelse:\r\n if(n==1):\r\n print(-1)\r\n else:\r\n print(10,end='')\r\n for i in range(n-2):\r\n print(0,end='')", "n, t = map(int, input().split())\r\n\r\n# Check if such a number is possible\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n # Find the first digit (most significant digit) of the number\r\n if t == 10:\r\n first_digit = 1\r\n else:\r\n first_digit = t\r\n\r\n # Create the number by repeating the first digit n-1 times\r\n number = str(first_digit) + '0' * (n - 1)\r\n\r\n print(number)\r\n", "a, b = map(int, input().split())\r\nif a == 1 and b == 10:\r\n print(-1)\r\nelif b == 10:\r\n print(int(str(1)*(a - 1))*10)\r\nelse:\r\n print(int(str(b)*a))", "n, t = map(int, input().split())\r\nk = -1\r\nfor i in range(10 ** (n - 1), 10 ** n):\r\n if i % t == 0:\r\n k = i\r\n break\r\nprint(k)", "n, t = map(int, input().split())\r\n\r\nif len(str(t)) > n:\r\n print(-1)\r\nelse:\r\n diff = n - len(str(t))\r\n mult = '1' + '0' * diff\r\n print(t * int(mult))", "def funkcja(a, b):\r\n for i in range (10**(a-1), 10**a):\r\n if i%b == 0:\r\n return i\r\n return -1\r\nn, t = map(int, input().split())\r\nprint(funkcja(n, t))", "n,t=map(int,input().split())\r\ns=\"\"\r\nif n==1:\r\n s+=str(t)\r\nelse:\r\n for i in range(n-1):\r\n s+=\"9\"\r\n s=str(int(s)*t)\r\nif len(s)==n:\r\n print(s)\r\nelse:\r\n print(-1)\r\n", "n,t=[int(n) for n in input().split()] \r\na = n*t \r\na = str(a)\r\na = a + str(0)*(n-len(a))\r\nif len(a) != n: \r\n print(-1)\r\nelse: print(int(a))", "import sys\r\nimport math\r\n\r\ninputs = []\r\nfor line in sys.stdin:\r\n inputs.append(line)\r\n\r\ncase = inputs[0].strip().split()\r\nn = int(case[0])\r\nt = int(case[1])\r\n\r\nresult = \"\"\r\nif t != 10:\r\n for i in range(n):\r\n result+=str(t)\r\nelse:\r\n for i in range(n-1):\r\n result+=\"1\"\r\n result+=\"0\"\r\n \r\nif len(result) == n and (int(result) != 0 and int(result) % t == 0):\r\n print(result)\r\nelse:\r\n print(-1)", "li=list(map(int,input().strip().split()))\r\nnum=li[0]\r\nnum1=li[1]\r\nx=int(str(1)+\"0\"*(num-1))\r\ny=int(\"9\"*(num))\r\nf=0\r\nfor i in range(x,y+1):\r\n if i%num1==0:\r\n print(i)\r\n f=1\r\n break\r\nif f==0:\r\n print(-1)", "n,t = map(int,input().split())\r\nif t==10:\r\n num = str(t)+'0'*(n-2)\r\nelse:\r\n num = str(t) + '0' * (n - 1)\r\nif len(num) == n:\r\n print(num)\r\nelse:\r\n print(-1)", "n,t=map(int,input().split())\r\nch=''\r\nres=0\r\nif t==10:\r\n if n==1:\r\n print(-1)\r\n else:\r\n for _ in range(n-1):\r\n ch+='1'\r\n ch+='0'\r\n print(int(ch))\r\nelse:\r\n for j in range(n):\r\n res+=(10**j)*t\r\n print(res)\r\n ", "n ,t = list(map(int, input().split()))\r\nres = ''\r\nres += str(1) \r\nres += (n-1)*'0'\r\nres2 = res\r\nres2 += '0'\r\nres = int(res)\r\nres2 = int(res2)\r\na = []\r\nfor i in range(res , res2): \r\n if(i % t == 0):\r\n a.append(i)\r\n break \r\n else: \r\n continue\r\n\r\nif(len(a) == 0):\r\n print(-1)\r\nelse:\r\n print(a[0])", "n,t=map(int,input().split())\r\nc=0\r\nfor i in range(10**(n-1),10**n):\r\n if i%t==0:\r\n print(i)\r\n c+=1\r\n break\r\nif c==0:\r\n print(-1)", "class Solution():\n\n def olesya_and_rodion(length, divisible_by):\n number = divisible_by*(10**(length-len(str(divisible_by))))\n if len(str(number)) == length:\n return number\n else:\n return -1\n\n\nif __name__ == '__main__':\n length, divisible_by = map(int, input().split())\n print(Solution.olesya_and_rodion(length, divisible_by))", "def sol():\r\n for i in range(10**(n-1),10**n):\r\n if i%t == 0:\r\n return i\r\n return -1\r\n\r\n\r\nn,t = map(int,input().split())\r\na = sol()\r\nprint(a)", "n,t=[int(i) for i in input().split()]\r\nm=t\r\n\r\ncount=1\r\n\r\nwhile(True):\r\n\r\n t=t/10\r\n\r\n if t<1:\r\n\r\n break\r\n\r\n count+=1\r\n\r\nr=pow(10,(n-count))\r\n\r\nif count>n :\r\n\r\n print(-1)\r\n\r\n\r\n\r\nif n==count :\r\n\r\n print(m)\r\n\r\n\r\n\r\nif(n>count):\r\n\r\n print(m*r)\r\n\r\n", "n, t = [int(i) for i in input().split()]\r\nfor i in range(int('1'+'0'*(n-1)), int('1'+'0'*(n))):\r\n if i%t==0:\r\n print(i)\r\n break\r\nelse:\r\n print(-1)", "n, t = map(int, input().split())\r\nans = 10**(n-1)\r\nfor i in range(t):\r\n if ans % t == 0:\r\n break\r\n ans += 1\r\nif ans % t != 0 or len(str(ans)) > n:\r\n print(-1)\r\nelse:\r\n print(ans)", "n, t = map(int, input().split())\r\n\r\nif t == 10:\r\n result = (-1 if n == 1 else pow(10, n - 2) * 10)\r\nelse:\r\n result = pow(10, n - 1) * t\r\n\r\nprint(result)\r\n", "n, t = map(int, input().split())\r\nstart = '1'\r\nstart += '0' * (n-1)\r\nend = start + '0'\r\nstart, end = int(start), int(end)\r\nfor num in range(start, end):\r\n if int(num) % t == 0:\r\n print(num)\r\n exit(0)\r\nprint(-1)\r\n\r\n", "n, t = map(int, input().split())\r\na = int('1' + '0'*(n-1))\r\nb = int('1' + '0'*n)\r\nFlag = False\r\nfor i in range(a, b):\r\n if i % t == 0:\r\n Flag = True\r\n res = i\r\n break\r\nif Flag:\r\n print(res)\r\nelse:\r\n print(-1)\r\n", "l=list(map(int,input().split()))\r\nn=l[0]\r\nt=l[1]\r\ntemp=t\r\nif n==1 and t==10:\r\n print(-1)\r\nelse:\r\n y=str(t)\r\n while(len(y)<n):\r\n t=t*temp\r\n y=str(t)\r\n \r\n print(y)", "n, t = map(int,input().split())\nk = (int('9'*n)//t)*t\nif k == 0:\n print(-1)\nelse:\n print(k)\n\n", "# Link: https://codeforces.com/contest/584/problem/A\n\nn, t = list(map(int, input().split()))\n\nnumber = 10 ** (n - 1)\nlast = 10 ** (n)\nfound = True\n\nwhile number % t != 0:\n number += 1\n \nprint(number if number < last else -1)", "n,t=(map(int, input().split()))\r\nif n<len(str(t)):\r\n print(-1)\r\nelse:\r\n if (10**n)%(t)!=0:\r\n print(10**n-(10**n%t))\r\n else:\r\n print(10**n-t) ", "n,t=map(int,input().split())\r\n\r\nl=10**(n-1)\r\nu=10**n\r\nk=-1\r\nfor i in range(l,u):\r\n if i%t==0:\r\n k=i\r\n break\r\n \r\nprint(k)", "#!/opt/homebrew/bin/python3\n\ndef main():\n n, t = input().split()\n n = int(n)\n t = int(t)\n\n number = 1\n for i in range(n-1):\n number *= 10\n\n max_number = number * 10\n\n while number % t:\n number += 1\n\n if number >= max_number:\n print(-1)\n else:\n print(number)\n\nif __name__ == '__main__':\n main()", "n, t = map(int, input().split())\r\n\r\nif n == 1 and t != 10:\r\n ans = t\r\nelif n == 1 and t == 10:\r\n ans = -1\r\nelse:\r\n ans = 10**(n-1)\r\n while ans % t != 0:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n, t = map(int, input().split())\r\nx = 10**(n-1)\r\nif n==1 and t ==10:\r\n print(-1)\r\nelif t == 10 :\r\n print(int('1'*(n-1)+'0'))\r\nelse:\r\n print(int(f'{t}'*n))\r\n", "\r\nn,t = list(map(int,input().split(' ')))\r\n\r\nif len(str(t))>n:\r\n print(-1)\r\nelif len(str(t))==n:\r\n print(t)\r\nelse:\r\n po = n- len(str(t))\r\n print(t*10**po)\r\n \r\n\r\n", "n,t=map(int,input().split())\r\na=(10**n-1)//t*t\r\nprint([-1,a][a>0])", "n ,t = map(int, input().split())\r\na = 10**(n - 1)\r\nb = a // t\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n print((b + 1) * t)\r\n\r\n\r\n", "s,t=map(int,input().split())\nc=''\nif s<2 and t==10:\n print(-1)\nelif s>=2 and t==10:\n for i in range(s-1):\n c+=str(1)\n c+=str(0) \n print(c)\nelse:\n for i in range(s):\n c+=str(t)\n print(c)\n\n \t \t\t\t \t\t \t \t\t\t\t\t", "def solve():\r\n n, k = map(int, input().split())\r\n if k == 10:\r\n print('1'+(n-1)*'0' if n > 1 else -1)\r\n else:\r\n print(str(k)*n)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "def n_to_10(n):\n p = 1\n for i in range(n - 1):\n p *= 10\n return p\nn, t = map(int, input().split())\nif n == 1 and t == 10:\n print(-1)\n exit()\nif n == 1:\n print(t)\nelse:\n print((n_to_10(n) // t + 1) * t)\n", "A=list(map(int, input().split()))\r\nn=A[0]\r\nt=A[1]\r\nk=0\r\nfor i in range(10**(n-1),10**n):\r\n if i%t==0:\r\n print(i)\r\n k+=1\r\n break\r\nif k==0:\r\n print(-1)", "from sys import stdin\nfrom math import ceil\n\nn, t = map(int, stdin.readline().strip().split())\n\nans = str(ceil(int('1'*n)/t)*t)\n\nif len(ans) == n:\n print(ans)\nelse:\n print(-1)\n\t \t\t\t \t\t \t \t \t \t \t \t \t", "n,t = list(map(int,input().split(\" \")))\r\npower = n-1\r\nfor i in range(10**power,10**power+t):\r\n if i%t==0 and len(str(i))==n:\r\n print(i)\r\n break\r\nelse:\r\n print(-1)", "szamok = input().split(\" \")\r\nn,t = int(szamok[0]), int(szamok[1])\r\n\r\nmin,max = 1,0\r\nfor i in range(n-1):\r\n min*=10\r\nmax = min*10-1\r\nbool = 0\r\nfor i in range(min,max+1):\r\n if i % t == 0:\r\n print(i)\r\n bool = 1\r\n break\r\nif bool == 0:\r\n print(-1)", "n,t=map(int,input().split())\r\ns= 10**(n-1)\r\ny=True\r\nwhile(s%t):\r\n s+=1\r\n if(s==10**n):\r\n y= False\r\nif(y== False):\r\n print(-1)\r\nelse:\r\n \r\n print(s)\r\n \r\n ", "import sys\r\nn , t = map(int, input().split())\r\n\r\nc=0\r\nfor i in range(10**(n-1),10**n):\r\n if i%t ==0 and i!=0:\r\n c+=1\r\n \r\n break\r\n\r\nif c==1:\r\n print(i)\r\nelse:\r\n print(-1)\r\n", "n, t = map(int, input().split())\r\nfor i in range((10 ** (n - 1)), 10 ** n, 1):\r\n found = 0\r\n if i % t == 0:\r\n print(i)\r\n found = 1\r\n break\r\n else:\r\n continue\r\nif found == 0:\r\n print('-1')\r\n", "n, t = input().split(\" \")\r\nn = int(n)\r\nt = int(t)\r\n\r\nx = t; min_number = 0\r\nwhile x > 0:\r\n min_number += 1\r\n x = int(x/10)\r\n \r\nif min_number > n:\r\n print(-1)\r\nelse:\r\n print(t, end=\"\")\r\n for i in range(n - min_number):\r\n print(0, end=\"\")\r\n \r\n", "n, t = map(int,input().split())\r\na = '1'*n\r\nif t < 10:\r\n print(int(a)*t)\r\nelif t == 10 and n == 1:\r\n print(-1)\r\nelif t == 10 and n > 1:\r\n print(10**(n-1))", "n, t = map(int, input().split())\r\nbegin = pow(10, n-1)\r\nfor num in range(begin, begin+9):\r\n if num % t == 0:\r\n print(num)\r\n break\r\nelse:\r\n print(-1)", "n,t=map(int,input().split())\r\nr=(10**(n-1))%t\r\nb=t-r\r\nif ((10**n)-1 <(10**(n-1)+b)):\r\n print(-1)\r\nelse:\r\n print(10**(n-1)+b)", "l = list(map(int,input().split())) \r\nn,t = l[0],l[1] \r\nx = 0 \r\ncnt = 0\r\nwhile n != 0 :\r\n# if cnt == 0 :\r\n# x += 1\r\n x += 10**n\r\n \r\n break\r\n \r\n\r\n\r\nfor i in range(x//10,x):\r\n if i%t == 0 :\r\n print(i) \r\n cnt += 1\r\n break\r\nif cnt == 0 :\r\n print(-1)", "import sys\r\n\r\nn, t = map(int, input().split())\r\nx = 1\r\n\r\nif n == 1 and t >= 10:\r\n print(\"-1\")\r\n sys.exit()\r\n\r\nwhile n > 1:\r\n x *= 10\r\n n -= 1\r\n\r\nwhile True:\r\n if x % t == 0:\r\n print(x)\r\n break\r\n x += 1\r\n", "def yzd_solution(n, t):\r\n x = 10**(n-1) + t\r\n y = ((10**(n-1))*t) + t\r\n z = t\r\n\r\n answer = -1\r\n nums = [x, y, z]\r\n \r\n for num in nums:\r\n if (len(str(num)) == n and num%t == 0):\r\n answer = num\r\n \r\n\r\n print(answer)\r\n\r\n \r\n\r\nn, t = map(int, input().split())\r\nyzd_solution(n, t)", "x,y=[int(m) for m in input().split()]\r\nif x==1 and y==10:\r\n print(-1)\r\nelif x==1:\r\n print(y)\r\nelse:\r\n s=\"1\"+\"0\"*(x-1)\r\n d=int(s)%y\r\n if d==0:\r\n print(s)\r\n else:\r\n print(s[:-1]+str(y-d))", "n, t = map(int, input().split())\r\ni1 = int(\"1\" + (\"0\" * (n-1)))\r\ni2 = int(\"9\" * n)\r\nfor i in range(i1, i2 + 1):\r\n if i % t == 0:\r\n print(i)\r\n exit(0)\r\nprint(-1)", "n, t = map(int, input().split())\r\n\r\nif t == 10:\r\n # Special case: if t is 10, the answer will always be 10^(n-1)\r\n if n == 1:\r\n print(-1) # No number with 1 digit is divisible by 10\r\n else:\r\n print(\"1\" + \"0\" * (n-1))\r\nelse:\r\n rem = pow(10, n-1, t) # Calculate remainder\r\n if rem == 0:\r\n print(\"1\" + \"0\" * (n-1)) # 10^(n-1) is divisible by t\r\n else:\r\n ans = pow(10, n-1) + (t - rem) % t\r\n print(ans)\r\n", "n,t=[int(t) for t in input().split()]\r\ng=10**(n-1)\r\nif n==1 and t==10:\r\n print('-1')\r\nelif n>=2 and t==10:\r\n print(g)\r\nelse:\r\n print(t*int('1'*n))\r\n\r\n ", "a,b=map(int,input().split())\r\nif(b==10):\r\n\tif (a==1):\r\n\t\tprint(\"-1\")\r\n\telse:\r\n\t\tfor _ in range(a-1):\r\n\t\t\tprint(\"1\",end=\"\")\r\n\t\tprint(\"0\")\r\nelse:\r\n\tfor _ in range(a):\r\n\t\tprint(b,end=\"\")", "n,t=map(int,input().split())\r\nc=0\r\nfor i in range(10**(n-1)+1,10**n,1):\r\n if(i%t==0):\r\n c=i\r\n break\r\n\r\nif(c!=0):\r\n print(c)\r\n\r\nelse:\r\n print(-1)", "# https://codeforces.com/problemset/problem/584/A\r\n\r\nn, t = map(int, input().split())\r\n\r\n# smallest number with n digits\r\nx = 10**(n-1)\r\n# largest number with n digits\r\ny = 10**n - 1\r\n\r\nfound = False\r\n\r\nfor i in range(x, y+1):\r\n if i % t == 0:\r\n print(i)\r\n found = True\r\n exit()\r\n\r\nif not found:\r\n print(-1)\r\n\r\n\r\n", "n, t = map(int, input().split())\r\n\r\nstart = 10 ** (n - 1)\r\nend = 10 ** n\r\n\r\n\r\nans = start - start % t + t\r\n\r\nif ans < end:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n,t=input().split()\r\nn,t=int(n),int(t)\r\nrem=(10**(n-1))%t\r\nans=(10**(n-1))+(t-rem)\r\nif ans>=10**n or ans<10**(n-1):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "n, t = map(int, input().split())\r\n\r\n# Create a string of n-1 '0's followed by a '1'\r\nnum_str = '1' + '0'*(n-1)\r\n\r\n# Convert the string to an integer\r\nnum = int(num_str)\r\n\r\n# Keep incrementing the last digit until the number is divisible by t\r\nwhile num % t != 0 and num_str[-1] != '9':\r\n num += 1\r\n num_str = str(num)\r\n\r\nif num % t == 0:\r\n print(num)\r\nelse:\r\n print(-1)\r\n", "l = input().split()\nn = int(l[0])\nt = int(l[1])\n\n\nif t <= 9:\n print(t*(10**(n-1)))\nelse:\n if n == 1:\n print(-1)\n else:\n print((10**(n-1)))\n", "n, t = list(map(int, input().split()))\r\n# given 1 <= n <= 100 and 2 <= t <= 10\r\n# above case returns -1 only for t = 10 and n = 1\r\nif (n == 1) and (t == 10):\r\n print(-1)\r\nelse:\r\n for i in range(0, t):\r\n if (10 ** (n - 1) + i) % t == 0: \r\n print(10 ** (n - 1) + i)\r\n", "n , t = map(int,input().split())\r\nmin = int('1' + '0'*(n-1))\r\nmax = int('9'*n)\r\nif t>max:\r\n print(-1)\r\nelif t>=min and t<=max:\r\n print(t)\r\nelse:\r\n while True:\r\n if min%t==0:\r\n print(min)\r\n break\r\n else:\r\n min+=1\r\n", "# import sys\r\n# sys.stdout = open('./output.txt', 'w')\r\n# sys.stdin = open('./input.txt', 'r')\r\n\r\nn, t = [int(x) for x in input().split()]\r\nn = 10**n - 1\r\nres = (n)-(n) % t\r\nif res == 0 and n > 1:\r\n print(-1)\r\nelse:\r\n print(res)\r\n", "inp=input()\r\ninp=inp.split(\" \")\r\n\r\nn=int(inp[0])\r\nk=int(inp[1])\r\n\r\nans=pow(10,n-1)\r\nmod=ans%k\r\nif(mod==0):\r\n mod=k\r\nans+=(k-mod)\r\n\r\nif(len(str(ans))!=n):\r\n print(-1)\r\nelse:\r\n print(ans)", "n, t = map(int, input().split())\r\nif t == 10 and n == 1:\r\n print(-1)\r\nelif t == 10:\r\n print(10 ** (n-1))\r\nelse:\r\n print(str(t) * n)", "n, t = map(int, input().split())\r\n\r\n# Initialize the answer to -1\r\nans = -1\r\n\r\n# Loop from 10^(n-1) to 10^n - 1\r\nfor x in range(10**(n-1), 10**n):\r\n # Check if x is divisible by t\r\n if x % t == 0:\r\n # Update the answer and break the loop\r\n ans = x\r\n break\r\n\r\n# Print the answer\r\nprint(ans)", "n, t = map(int, input().split())\r\ns = 10 ** n - 1\r\nprint(-1 if s < t else s // t * t)\r\n", "n, t = list(map(int, input().split(' ')))\r\n\r\nx = '1'\r\n\r\nfor i in range(n - 1):\r\n x += '0'\r\n\r\nx = int(x)\r\n\r\n\r\nwhile x % t != 0 and len(str(x)) == n:\r\n x += t\r\n x -= (x%t)\r\n\r\n\r\n\r\nif(len(str(x)) != n): print('-1')\r\nelse: print(x)", "tm = input().split()\r\nn, t = int(tm[0]), int(tm[1])\r\nfor i in range(10 ** (n - 1), 10 ** n):\r\n if i % t == 0:\r\n print(i)\r\n exit(0)\r\nprint(-1)", "a,b = (input().split())\r\na,b = int(a),int(b)\r\nnum = 10**(a-1)\r\n\r\nwhile num%b and 10**a > num:\r\n if 10**a <= num+1:\r\n num = -1\r\n break\r\n else:\r\n num+=1\r\nprint(num)", "from collections import defaultdict\r\nn,m=map(int,input().split())\r\nif m==10 and n==1:\r\n print(-1)\r\nelse:\r\n if m==10:\r\n print('1'*(n-1)+'0')\r\n else:\r\n print(str(m)*n)", "n, t = map(int, input().split())\r\nans = (10 ** n - 1) // t * t\r\nif ans > 0:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n# i am from jasnah", "n, t = [int(i) for i in input().split()]\nif t == 10 and n == 1:\n print(-1)\nelse:\n n -= len(str(t));\n print(t, end='')\n print('0'*n)", "def ans(n,t):\r\n if n == 1 and t == 10:\r\n return -1\r\n return 10**(n-1) + (t - 10**(n-1) % t) % t\r\nn,t = list(map(int,input().split()))\r\nprint(ans(n,t))", "n, t = map(int, input().split())\r\n\r\nfirst = '1' + '0' * (n - 1) \r\nfirst = int(first)\r\n\r\nlast = '1' + '0' * n\r\nlast = int(last)\r\ns = -1\r\nfor i in range(first, last):\r\n if i % t == 0:\r\n s = i\r\n break\r\n \r\nprint(s)", "def solve(n, t):\r\n num = 10**(n-1)\r\n end = 10**(n) - 1\r\n\r\n while(num <= end):\r\n if(num%t == 0):\r\n return num\r\n num += 1\r\n return -1\r\n\r\n# for _ in range(int(input())):\r\nn, t = map(int, input().split())\r\nprint(solve(n, t))", "a,b=map(int,input().split())\r\nw=[]\r\nif len(str(b))>a:\r\n\tprint(-1)\r\n\texit()\r\n\r\n\r\nif b==10:\r\n\tfor i in range(a-1):\r\n\t\tw.append(1)\r\n\tw.append(0)\r\n\tprint(*w,sep='')\r\n\texit()\r\n\r\n\r\n\r\n\r\nfor i in range(a):\r\n\tw.append(b)\r\n\r\nprint(*w,sep='')", "n, k = map(int, input().split())\r\nnum = \"1\" + (\"0\" * (n - 1))\r\nnum_last = \"9\" * n\r\nnum, num_last = int(num), int(num_last)\r\nflag = False\r\nfor i in range(num, num_last + 1):\r\n if i % k == 0:\r\n print(i)\r\n flag = True\r\n break\r\nif not flag:\r\n print(-1)", "n, t = map(int, input().split())\nif (n == 1 and t == 10):\n print(-1)\n exit(0)\nk = 10 ** n\nif k % t == 0:\n print(k - t)\nelse:\n print(k - (k % t))\n", "def main() -> int:\r\n n, t = tuple(int(x) for x in input().split(\" \"))\r\n res = (10 ** (n - 1) // t + 1) * t\r\n return res if res < 10 ** n else -1\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n, t = map(int, input().split())\r\nans = 10 ** (n - 1) - 10 ** (n - 1) % t + t * (10 ** (n - 1) % t != 0)\r\nprint((-1, ans)[ans < 10 ** n])\r\n", "n, t = map(int, input().split())\nres = 10**(n-1)\nlimit = 10**n\n\nwhile res < limit:\n if res % t == 0:\n print(res)\n break\n res += 1\nelse:\n print(-1)\n", "n,t = [int(x) for x in input().split()]\r\nstart = 10**(n-1)\r\nend = 10**n\r\nfound = False\r\nfor i in range(start,end):\r\n if i%t == 0:\r\n print(i)\r\n found = True\r\n break\r\n \r\nif found == False:\r\n print(-1)\r\n", "n, t = map(int, input().split())\r\nif t < 10:\r\n print(n*str(t))\r\nelse:\r\n print(-1 if n < 2 else \"1\"*(n-1)+\"0\")", "def f(n, t):\r\n b = 10 ** (n - 1)\r\n c = 10 ** n\r\n for i in range(b, c):\r\n if i % t == 0:\r\n return i\r\n return -1\r\n\r\na = list(map(int, input().split()))\r\nn = a[0]\r\nt = a[1]\r\nprint(f(n, t))", "n,m=map(int,input().split())\r\ns=10**(n-1)\r\ns1=s+m-s%m\r\nif m==10 and n==1:print(-1)\r\nelse:print(s1)\r\n", "n,t=map(int,input().split())\r\nif n==1 and t==10:\r\n print('-1')\r\nelif n==1:\r\n print(t)\r\nelse:\r\n if t==10:\r\n s=str(t)+(n-2)*'0'\r\n print(s)\r\n else:\r\n s = str(t) + (n - 1) * '0'\r\n print(s)\r\n", "a,b=map(int,input().split())\r\nstart=(\"1\"+(\"0\"*(a-1)))\r\nre=-1\r\nwhile len(start)==a:\r\n if(int(start)%b==0):\r\n re=start\r\n break\r\n else:\r\n start=str(int(start)+1)\r\nprint(re)", "a=list(map(int,input().split()))\r\nb=a[0]\r\nc=str(a[1])\r\nif a==[1,10]:\r\n print(-1)\r\nelif a==[2,10]:\r\n print(10)\r\nelif a==[3,10]:\r\n print(100)\r\nelse:\r\n if b==1:\r\n print(c)\r\n elif c=='10':\r\n print(int(c+'0'*(b-4)+c))\r\n else:\r\n print(int(c+'0'*(b-2)+c))", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nlst = [int(x) for x in input().split()]\r\nn = lst[0]\r\nt = lst[1]\r\n\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n print(t,end=\"\")\r\n if t == 10:\r\n for i in range(n-2):\r\n print(0,end=\"\")\r\n else:\r\n for i in range(n-1):\r\n print(0,end=\"\")\r\n", "def find_number():\r\n n, m = map(int, input().split())\r\n a = (10**n - 1) // m * m\r\n return [-1, a][a > 0]\r\n\r\n# Пример использования\r\nresult = find_number()\r\nprint(result)\r\n", "n, t = map(int, input().split())\r\n\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n num = '1' + '0' * (n - 1)\r\n while int(num) % t != 0:\r\n num = str(int(num) + 1)\r\n if len(num) > n:\r\n print(-1)\r\n break\r\n else:\r\n print(num)\r\n", "n,t = map(int,input().split())\r\nb = 10**(n-1)\r\nwhile b%t!=0:\r\n b+=1\r\nif n<len(str(t)):\r\n print(-1)\r\nelse:print(b)", "n,t = map(int,input().split())\r\nif n==1 and t>9:\r\n print(-1)\r\nelif t==10:\r\n print(10**(n-1))\r\nelse:\r\n print(10 ** (n - 1)*t)", "n,t=map(int,input().split())\r\nx=(t*(int(str(9)*n)//t))\r\nif x<=0:\r\n print(-1)\r\nelse:\r\n print(x)", "n, t = map(int, input().split())\nif n == 1 and t == 10:\n print(-1)\nelse:\n print(10 ** (n - 1) // t * t + t)\n", "n,t = map(int,input().split())\r\nlen = 1\r\nfor i in range(1,n):\r\n len*=10\r\nfor i in range(len,len*10):\r\n if (i % t == 0):\r\n print(i)\r\n break\r\nelse:\r\n print(-1)", "# Link: https://codeforces.com/contest/584/problem/A\n\nn, t = list(map(int, input().split()))\n\nfirst = 10 ** (n - 1)\nlast = 10 ** (n)\nfound = True\n\nwhile first % t != 0:\n first += 1\n \n if first == last:\n found = False\n break\n \n\nif found:\n print(first)\nelse:\n print(-1)", "def readint():\r\n return int(input())\r\n \r\ndef readarray(typ):\r\n return list(map(typ, input().split()))\r\n\r\ndef main():\r\n n, t = readarray(int)\r\n if n < len(str(t)):\r\n print(-1)\r\n return\r\n \r\n pow10 = n - len(str(t))\r\n\r\n print(t*pow(10, pow10))\r\n\r\nmain()", "op = False\r\nx = input()\r\nl = x.split()\r\nn = int(l[0])\r\nt = int(l[1])\r\nstart = int(\"1\"+\"0\"*(n-1))\r\nend = int(\"1\"+\"0\"*n)\r\nfor i in range(start , end):\r\n if i % t == 0 :\r\n op = True\r\n break\r\nif op :\r\n print(i)\r\nelse :\r\n print(-1)\r\n\r\n", "import math\nn,t = map(int, input().split())\n\nif t != 10:\n print(t*(10**(n-1)))\nelif n == 1 and t == 10:\n print(-1)\nelse:\n print(10**(n-1))", "n, t =map(int, input().split())\r\n\r\n\r\nfor i in range(10**(n-1), 10**n):\r\n if i%t == 0:\r\n print(i)\r\n break\r\nelse:\r\n print(-1)\r\n", "o, r = map(int, input().split())\r\nif r == 10:\r\n if o == 1:\r\n print(-1)\r\n else:\r\n print(1,end=\"\")\r\n for i in range(0,o-1):\r\n print(0,end=\"\")\r\nelse:\r\n for i in range(0, o):\r\n print(r,end=\"\")", "n,t=list(map(int,input().split()))\r\ns=10**(n-1)\r\nwhile len(str(s)) == n:\r\n if s%t==0:\r\n print(s)\r\n break\r\n s+=1\r\nelse:\r\n print(-1) ", "n, t = map(int, input().split())\r\nflag = 0\r\nfor i in range(10**(n-1), 10**(n)):\r\n if i % t == 0:\r\n print(i)\r\n flag = 1\r\n break\r\nif flag == 0:\r\n print(-1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n N, T = map(int, input().split())\r\n\r\n answer:str = \"\"\r\n if N==1 and T==10 : answer = \"-1\"\r\n else :\r\n if T==10 : answer = \"1\"+(\"0\"*(N-1))\r\n else : answer = str(T)*N\r\n\r\n print(answer)\r\n\r\nmain()", "n,k = map(int,input().split())\r\nif len(str(k)) > n:\r\n print(-1)\r\nelse:\r\n print(k*(((10**(n-1))//k)+1))", "n,t=map(int,input().split())\r\nt1=t\r\nif t==10:\r\n t1=1\r\n c=(n-2)*str(t1)+str(t)\r\nelse:\r\n c=(n-1)*str(t1)+str(t)\r\nif int(c)%t==0 and len(c)==n :\r\n print(c)\r\nelse:\r\n print(-1)", "n,t=map(int,input().split())\r\nif n==1 and t==10:\r\n print(-1)\r\nelif t==10:\r\n print(\"1\"+\"0\"*(n-1))\r\nelse:\r\n print(str(t)*n)", "n, t = [int(i) for i in input().split()]\r\nans = int(\"9\"*n)\r\nif t > ans:\r\n ans = -1\r\nelse:\r\n while ans % t != 0:\r\n ans -= 1\r\nprint(ans)", "n,m = list(map(int,input().split()))\r\nx = str(m%10) * n\r\nif x=='0':\r\n print(-1)\r\nelif int(x) ==0:\r\n print(\"1\"+x[1:])\r\nelse:\r\n print(x)", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n n, t = map(int, input().split())\n if n > 1:\n if t == 10:\n print(10 ** (n - 1))\n else:\n print(t * (10 ** (n - 1)))\n else:\n if t == 10:\n print(-1)\n else:\n print(t)\n\n\nif __name__ == \"__main__\":\n main()\n", "n,t = input().split()\r\nn = int(n)\r\nwhile len(t) < n: t += '0'\r\nprint(-1 if len(t) > n else t)", "# LUOGU_RID: 101606173\na, b = map(int, input().split())\r\nif a == 1 and b == 10:\r\n print(-1)\r\nelse:\r\n print(str(b) + '0' * (a - len(str(b))))", "a = [int(s) for s in input().split()]\r\nx = 1\r\nresult = -1\r\n\r\nfor i in range(a[0]-1):\r\n x *= 10\r\n\r\nfor i in range(x, x*10):\r\n if i % a[1] == 0:\r\n result = i\r\n break\r\n \r\nprint(result)", "n, t = map(int, input().split())\nans = (10 ** n - 1) // t * t\nif ans > 0:\n print(ans)\nelse:\n print(-1)# 1690412458.136408", "\r\nn,l=map(int,input().split())\r\nfor i in range(10**(n-1),10**n):\r\n if i%l==0:\r\n print(i)\r\n exit()\r\nprint(-1)", "str=input()\narr=str.split(' ')\ncount=0\nn=int(arr[0])\nt=int(arr[1])\nstart=1\nend=10\nflag=0\nans=0\nif(n>1):\n start=start*10**(n-1)\n end=end*10**(n-1)\nfor i in range(start,end):\n if(i%t==0):\n ans=i\n flag=1\n break\nif(flag==0):\n print(\"-1\")\nelse:\n print(ans)\n \t \t \t \t \t\t\t\t \t\t \t\t\t \t\t", "def sol():\r\n n,t= map(int,input().split())\r\n if t == 10:\r\n if n == 1:print(-1)\r\n else :print(10**(n-1))\r\n else:print(n*str(t))\r\n\r\n\r\nsol()\r\n \r\n \r\n \r\n", "n, t = map(int, input().split())\r\nnum = int('1' + '0' * (n - 1))\r\nif t == 10:\r\n if n == 1:\r\n print(\"-1\")\r\n else:\r\n print(num)\r\nelse:\r\n print(num * t)\r\n\r\n\r\n\r\n\r\n", "import math\r\n\r\ninput1, input2 = input().split()\r\ninput1 = int(input1)\r\ninput2 = int(input2)\r\ndigits = math.floor(math.log(input2, 10)) + 1\r\nif(digits > input1):\r\n print(-1)\r\nelse:\r\n print(input2 * pow(10, input1 - digits))\r\n\r\n", "\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\nn, t = MII()\r\n\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n print(10**(n-1) + t - ((10%t)**(n-1))%t)\r\n \r\n\r\n\r\n\r\n", "n,t=map(int,input().split())\r\ns='9'*n\r\nfor i in range(int(s),int('1'+'0'*(n-1))-1,-1):\r\n if i%t==0:\r\n print(i)\r\n exit()\r\nprint(-1)", "n,t=map(int,input().split())\r\nif(10**n <= t):\r\n print(-1)\r\nelse: \r\n print(10**(n-1)+t-(10**(n-1))%t)\r\n", "n, t = input().split(\" \")\r\nn = int(n)\r\nmin_number = len(t)\r\nt = int(t)\r\n\r\nif min_number > n:\r\n print(-1)\r\nelse:\r\n print(t, end=\"\")\r\n for i in range(n - min_number):\r\n print(0, end=\"\")\r\n \r\n", "n, t = map(int, input().split())\r\na = 10**(n - 1 - (t > 9))\r\nprint([t * a, -1][a < 1])", "n, t = map(int, input().split())\r\nn = 10 ** n // 10\r\nif t >= n * 10:\r\n print(-1)\r\nelse:\r\n while n % t:\r\n n += 1\r\n print(n)", "a,b = map(int,input().split())\r\nif a == 0 or (a == 1 and b == 10) :\r\n print(-1)\r\nelse :\r\n if b == 10 :\r\n x = a-2\r\n print(str(b)+\"0\"*x)\r\n else :\r\n string = str(b)\r\n print(string*a)", "n,t = map(int,input().split())\r\nstartt = 10 ** (n-1)\r\nresult = startt + t-startt % t\r\nif len(str(result))==n:\r\n print(result)\r\nelse:\r\n print(-1)", "n,t = map(int,input().split())\r\n\r\nres = 10**(n-1)\r\n\r\nres = (res//t +1) * t\r\ntmp=res\r\ncnt=0\r\nwhile res:\r\n cnt = cnt+1\r\n res//=10\r\n\r\nif cnt>n:\r\n print(-1)\r\nelse:\r\n print(tmp)", "n,t=map(int,input().split())\r\ns=int('1'+'0'*(n-1))\r\np=int('9'*n)\r\nf=False\r\nfor i in range(s,p+1):\r\n if i%t==0:\r\n f=True\r\n break\r\nif f:\r\n print(i)\r\nelse:\r\n print(-1)", "input = (str(input().strip()))\n\nn, t = input.split()\n\nn, t = int(n), int(t)\n\nmin_range = 10 ** (n-1)\nmax_range = 10 ** (n)\n\nentered = False\nfor i in range(min_range, max_range):\n \n if i % t == 0:\n print(i)\n entered = True\n break\n \nif not entered:\n print (-1)\n\t \t\t\t\t\t\t\t\t\t\t \t \t\t\t \t\t\t", "a, s = map(int, input().split())\r\nd = 10 ** (a-1)\r\nwhile len(str(d)) == a:\r\n if d % s == 0:\r\n print(d)\r\n exit()\r\n else:\r\n d += 1\r\nprint('-1')", "n,t=map(int,input().split())\r\nn1=10**(n-1)\r\ncount=0\r\nfor i in range(n1,n1*10):\r\n if i%t==0:\r\n print(i)\r\n count+=1\r\n break;\r\nif count==0:\r\n print(-1)\r\n ", "n,t = map(int,input().split())\r\na = int(\"1\"+(\"0\"*n)) - 1\r\nif a >= t:\r\n a =a-a%t\r\n print(a)\r\nelse:print(-1)", "n,t=map(int,input().split())\r\nif t == 10:\r\n if n == 1 : print(-1)\r\n else:\r\n s=0\r\n for i in range(n-1):\r\n s=s*10+1\r\n s=s*10\r\n print(s)\r\nelse:\r\n s=0\r\n for i in range(n):\r\n s=s*10+t\r\n print(s)\r\n ", "import math\r\nn,t = map(int, input().split())\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n kq = math.ceil(10**(n-1)/t)*t\r\n if len(str(kq)) == n:\r\n print(kq)\r\n else:\r\n kq = math.ceil(10**(n-1)*2/t)*t\r\n print(kq)", "a,b=map(int,input().split())\nm=10**a-1\nif(m%b==0):\n ans=m\nelse:\n ans=(m-(m%b))\nif(ans>0):\n print(ans)\nelse:\n print(-1)\n", "n, t = map(int, input().split())\r\nif t < 10:\r\n print(str(t) * n)\r\nelif len(str(t)) <= n:\r\n print(10 ** (n - 1))\r\nelse:\r\n print(-1)", "a,b=map(int,input().split())\r\nx=10**(a-1)\r\ny=x%b\r\nz=(x+b-y)\r\nif len(str(z))!=a:\r\n print(-1)\r\nelse:\r\n print(z)", "n,t=map(int, input().split())\r\ni=10**(n-1)\r\nm=10**n\r\nwhile i<m:\r\n if i%t==0:\r\n print(i)\r\n break\r\n else:\r\n i+=1\r\n if i==m:\r\n print(\"-1\")\r\n break", "n, t = map(int, input().split(\" \"))\nresult = 0\nif t == 10:\n result = t*(10**(n-2))\nelse:\n result = t*(10**(n-1))\nif result >= t and len(str(result)) == n:\n print(result)\nelse:\n print(-1)", "n,t = map(int,input().split())\r\n\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelse:\r\n initial = 10**(n-1)\r\n r = initial % t\r\n print(initial + (t - r))\r\n", "# https://codeforces.com/problemset/problem/584/A\r\n\r\nn, t = [int(x) for x in input().split()]\r\n\r\nif t == 10:\r\n if n == 1:\r\n print(-1)\r\n else:\r\n print('1'*(n-1)+'0')\r\nelse:\r\n print(str(t)*n)\r\n", "n , t = map(int,input().split())\r\nif(t==10):\r\n if(n==1):\r\n print(-1)\r\n else:\r\n print(10**(n-1))\r\nelse:\r\n for i in range(n):\r\n print(t,end=\"\")", "n, t = map(int, input().split())\ntemp = 1 * 10**(n-1)\nif temp % t:\n temp += t - temp % t\n\ns = str(temp)\nprint(temp if len(s) == n else -1)", "x , y = map(int,input().split())\r\nanswer = 0\r\nnum = 0\r\nif 10**x - 1 < y:\r\n print(-1)\r\n exit()\r\nelse:\r\n for i in range(10**(x-1),10**(x)):\r\n if i%y == 0 and num == 0:\r\n answer = i\r\n num+=1\r\n break\r\nprint(answer)", "n,t = map(int,input().split())\r\nif n==1 and t==10 :\r\n print(-1)\r\nelse :\r\n n= 10**(n-1)\r\n while n%t != 0 : #减少时长，避免超时\r\n n+=1\r\n print(n)\r\n", "n, t = map(int,input().split())\r\nif 10**(n-1)%t == 0:\r\n print(10**(n-1))\r\nelse:\r\n if ((10**(n-1)//t) + 1)*t < 10**(n):\r\n print(((10**(n-1)//t) + 1)*t)\r\n else:\r\n print('-1')", "lenght , div = map(int,input().split())\r\ndiv = str(div)\r\nif lenght < len(div) : quit(print(-1))\r\nnum = div + (\"\".join([\"0\"] * (lenght - len(div))))\r\nprint(num)", "import math\n\ndef main():\n n, t = map(int, input().split())\n if t == 10:\n if n == 1:\n print(-1)\n else:\n print(1, end=\"\")\n for i in range(1, n):\n print(0, end=\"\")\n print()\n else:\n for i in range(0, n):\n print(t, end=\"\")\n print()\n\n\nmain()\n", "number_of_digits, divisor = map(int, input().split())\n\ninferior_limit = 10 ** (number_of_digits - 1)\n\nupper_limit = 10 ** number_of_digits - 1\n\nrest_of_division_between_first_number_and_divisor = inferior_limit % divisor\n\nnumber_with_digits_and_divisible = inferior_limit + (divisor - rest_of_division_between_first_number_and_divisor\n if rest_of_division_between_first_number_and_divisor != 0 else 0)\n\nprint(number_with_digits_and_divisible if number_with_digits_and_divisible <= upper_limit else -1)\n", "a,b=map(int,input().split())\r\ns='1'\r\nk='10'\r\nl=0\r\nwhile len(s)<a:\r\n s+='0'\r\n k+='0'\r\nfor i in range(int(s),int(k)):\r\n if i%b==0:\r\n l+=1\r\n print(i)\r\n break\r\nif l==0:\r\n print(-1)\r\n", "n, t = [int(x) for x in input().split()]\r\nnum = 10**n - 1\r\nif num < t:\r\n num = -1\r\nelse:\r\n num = num - (num % t)\r\nprint(num)", "n, t = map(int, input().split())\r\nlow = 10 ** (n - 1)\r\nhigh = 10 ** n - 1\r\nrem = high % t\r\nnum = high - rem if (high - rem) >= low else -1\r\nprint(num)", "n, t = map(int,input().split())\r\nres = 10**(n-1) \r\nwhile(res%t != 0):\r\n res+=1\r\nif len(str(res)) > n:\r\n print(-1)\r\nelse:\r\n print(res)", "n, t = map(int, input().split())\r\nif int(\"9\"*n) >= t:\r\n print((int(\"9\"*n)//t)*t)\r\nelse:\r\n print(-1)\r\n", "n, t = list(int(num) for num in input().split())\r\n\r\nif t < 10:\r\n print(*list(t for i in range(n)), sep = '')\r\nelse: \r\n if n == 1:\r\n print(-1)\r\n else:\r\n print(*list(1 for i in range(n - 1)), 0, sep = '')", "n,t=map(int,input().split())\r\nnum=1\r\na=n\r\nn-=1\r\nwhile n>0:\r\n num=num*10\r\n n-=1\r\ni=num\r\nans=0\r\nwhile len(str(i))==a:\r\n if i%t==0:\r\n print(i)\r\n ans=1\r\n break\r\n i+=1\r\nif ans==0:\r\n print(-1)", "n, m = map(int, input().split())\r\np = 10**(n-1)\r\nl = -1\r\n\r\nfor i in range(p, p*10):\r\n if p%m == 0:\r\n l = p\r\n break\r\n else:\r\n p+=1\r\nprint(l)", "i = [int(x) for x in input().split()]\nn, t = i[0], i[1]\n\nis_ten = False\nif t == 10:\n is_ten = True\n\nif n == 1 and t == 10:\n print(-1)\nelse:\n result = t * (10 ** (n - 1 - is_ten))\n print(result)\n", "a,b=map(int,input().split())\r\ng=10**(a-1)\r\nwhile(len(str(g))<=a):\r\n if g%b==0:\r\n print(g)\r\n break\r\n else:\r\n g=g+1\r\nif len(str(g))>a:\r\n print(-1)", "n,t=map(int,input().split())\r\nnumber0=int('9'*n)\r\nremainder=number0%t\r\nnumber1=number0-remainder\r\nif len(str(number1))==n and number1>0:\r\n print(number1)\r\nelse:\r\n print(-1)", "\r\na,b=map(int,input().split())\r\nfor i in range(10**(a-1),10**a):\r\n if i%b==0:\r\n print(i)\r\n break\r\n else:\r\n continue\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "n, t = map(int, input().split())\r\n\r\nanswer = 10 ** (n - 1) // t * t + t\r\nif answer < 10 ** n:\r\n print(answer)\r\nelse:\r\n print(-1)\r\n", "n, t = list(map(int, input().strip().split()))\n\nif t == 10 and n == 1:\n print(-1)\nelse:\n if t < 10:\n p = n - 1\n print(t * 10**p)\n else:\n p = n - 2\n print(t * 10**p)\n\t \t \t\t\t\t\t\t \t\t\t\t\t\t \t\t \t\t", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nn,t = li()\r\n\r\nif t != 10:\r\n print(n*str(t))\r\nelif t == 10 and n == 1:\r\n print(-1)\r\nelse:\r\n print('10'.ljust(n,'0'))", "n,t = map(int,input().split())\r\nif(n == 1 and t != 10):\r\n print(t)\r\nelif(n == 1):\r\n print(-1)\r\nelif(t == 10):\r\n print('1'+'0'*(n-1))\r\nelse:\r\n print(str(t)*n)", "n, t = map(int, input().split())\r\nstart = 10**(n-1)\r\nend = 10**n\r\nres=0\r\nfor i in range(start, end):\r\n if i%t==0:\r\n res = i\r\n print(i)\r\n break\r\nif res==0:\r\n print(-1)", "def main():\r\n n, t = input().split()\r\n \r\n if n == \"1\" and t == \"10\":\r\n print(\"-1\")\r\n return\r\n \r\n number = \"0\"*int(n)\r\n print(t[0],number[1:],sep=\"\")\r\n \r\nmain()", "n,t = map(int, input().split())\r\n \r\nif n==1 and t==10:\r\n print(\"-1\")\r\nelif t==10:\r\n print(10**(n-2) * t)\r\nelse:\r\n print(10**(n-1) * t)", "n, t = (int(i) for i in input().split())\nres = t\nwhile len(str(res)) < n:\n res *= t\nres = res if len(str(res)) == n else -1\nprint(res)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 7 16:24:55 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\na,b=map(int,input().split())\r\nnum=10**(a-1)\r\nrem=num%b\r\nres=num+b-(num%b)\r\nif a==1 and b==10:\r\n res=-1\r\n\r\nprint(res)", "length,divider=map(int,input().split())\r\nstarting=\"1\"\r\nending=\"\"\r\nresult=False\r\n\r\nfor i in range(length-1):\r\n starting+=\"0\"\r\nfor i in range(length):\r\n ending+=\"9\"\r\nfor i in range(int(starting),int(ending)+1):\r\n if i%divider==0:\r\n result=True\r\n print(i)\r\n break\r\n \r\nif result==False:\r\n print(-1)", "n, t = map(int, input().split())\r\nnum = 10 ** (n - 1)\r\nif num%t == 0:\r\n print(num)\r\nelse:\r\n a = num // t + 1\r\n num = a * t\r\n if len(str(num)) == n:\r\n print(num)\r\n else:\r\n print(-1)", "n = input()\r\nt = [int(i) for i in n.split() if i.isdigit()]\r\nrem = (10**(t[0]-1))%t[1]\r\nif 10**(t[0]-1) + t[1] - rem < 10**t[0]:\r\n print(10**(t[0]-1) + t[1] - rem)\r\nelse:\r\n print(-1) \r\n#print(rem)", "\r\ndef solve() : \r\n n,t=map(int,input().split())\r\n temp=10**(n-1) \r\n start=0\r\n while temp>0:\r\n start=start*10+1\r\n temp=temp//10\r\n end=10**(n)-1\r\n for i in range(start,end+1):\r\n if (i%t==0):\r\n print(i)\r\n return\r\n \r\n print(-1)\r\n return\r\n\r\ndef main() : \r\n solve() \r\n return\r\n\r\n\r\nif __name__== \"__main__\" : \r\n main()", "n, t = map(int, input().split())\r\nx = ((10 ** n - 1) // t) * t\r\nprint(x if x else -1)\r\n", "n,t=map(int,input().split())\ntemp=10**(n)\n\nif n==1:\n if t>9:\n print(-1)\n else:\n print(t)\n\nelse:\n if temp%t == 0 :\n ans = temp-t\n else:\n ans=temp-temp%t\n print(ans)", "from math import *\r\na,b=map(int,input().split())\r\nn=10**(a-1)\r\nf=0\r\nfor i in range(1,11):\r\n if((n+i)%b==0 and floor(log10(n+i))+1==a):\r\n print(n+i)\r\n f=1\r\n break\r\nif(f==0):\r\n print(-1)", "n,m=map(int,input().split())\r\nc=0\r\nfor i in range(10**(n-1),10**n):\r\n if i%m==0:\r\n print(i)\r\n c+=1\r\n break\r\n else:\r\n continue\r\nif c==0:\r\n print(\"-1\")", "n,x = list(map(int,input().split()))\r\nz = 10**(n-1)*x if x<10 else 10**(n-1)\r\nif z % x == 0:\r\n print(z)\r\nelse:\r\n print(-1)", "# Olesya and Rodion\r\ns = input().split(\" \")\r\nn,t = int(s[0]),int(s[1])\r\nx = 1\r\nfor i in range(n-1):\r\n x *= 10\r\ni = x\r\nflag = False\r\nwhile i < x*10:\r\n if i % t == 0:\r\n flag = True\r\n break\r\n else:\r\n i += 1\r\nif flag == True:\r\n print(i)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nif m==10:\r\n if n==1:\r\n print('-1')\r\n exit\r\n else:\r\n for i in range(n-1):\r\n print('1',end='')\r\n print('0')\r\nelse:\r\n for i in range(n):\r\n print(m,end='')", "import sys\r\n\r\na, b = map(int, input().strip().split())\r\nc = 10**(a-1)\r\nif b == 10 and a < 2:\r\n print(-1)\r\n sys.exit(0)\r\n\r\nwhile True:\r\n if len(list(str(c))) == a and c % b == 0:\r\n print(c)\r\n sys.exit(0)\r\n c += 1", "def solve():\r\n pass # Placeholder for the solve function, implement it if needed\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # w(x) {\r\n # solve();\r\n # }\r\n a, b = map(int, input().split())\r\n ANS = None\r\n ans = b\r\n\r\n digits = 0\r\n while b != 0:\r\n digits += 1\r\n b //= 10\r\n\r\n a -= digits\r\n if a < 0:\r\n print(-1)\r\n else:\r\n mul = 10 ** a\r\n final = ans * mul\r\n print(final)\r\n", "a,b = map(int,input().split())\r\nr = 10 ** a\r\nl = 10 ** (a-1)\r\nfor i in range(l,r):\r\n if i % b == 0 and i >= 0:\r\n print(i)\r\n break\r\nelse:\r\n print(-1)\r\n", "n, t = map(int, input().split())\r\n\r\nif t==10 and n<2:\r\n print(-1)\r\nelif t==10 and n>1:\r\n print(\"1\"*(n-1) + \"0\")\r\nelse:\r\n print(f\"{t}\"*n)", "''' Author : Kunj Gandhi '''\r\n\r\n'''Functions'''\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\n\r\n'''Code'''\r\nn,t = sp_inp()\r\nif(n==1 and t==10): print(-1)\r\nelse:\r\n val = 10**(n-1)\r\n rem = val%t\r\n val = val-rem+t\r\n print(val)", "import sys\r\n\r\nINF = 2e18 + 99\r\n\r\nn, t = map(int, input().split())\r\n\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelif n == 1:\r\n print(t)\r\nelse:\r\n if t == 10:\r\n t = 1\r\n print(t, end='')\r\n for i in range(n-1):\r\n print(0, end='')\r\n print() # added to print a newline character at the end of the output\r\n", "n,t=map(int,input().split())\r\nif t==10:\r\n t=1\r\n if n==1:\r\n print(-1)\r\n exit(0)\r\nprint(10**(n-1)*t)", "n,t=map(int,input().split())\r\nif n==1 and t==10:\r\n print(-1)\r\nelse:\r\n print(t,end=\"\")\r\n if t==10:\r\n for i in range(n-2):\r\n print(0,end=\"\")\r\n else:\r\n for i in range(n-1):\r\n print(0,end=\"\")", "def main():\n n,d = map(int, input().split())\n start = 10 ** (n-1)\n while start % d != 0:\n start += 1\n if len(str(start)) > n:\n print(-1)\n return 0\n print(start)\n return 0\nmain()", "\r\nimport math\r\nn, t = map(int, input().split())\r\n\r\nresult = None\r\n\r\nif n == 1:\r\n if t > 9:\r\n result = -1\r\n else:\r\n result = t\r\nelse:\r\n result = 10 ** (n - 1) + (t - ((10 ** (n - 1)) % t))\r\n\r\nprint(result)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, t = map(int, input().split())\r\ni = int('1' +'0' * (n - 1))\r\nj = int('1' +'0' * n)\r\n\r\nans = 0\r\nfor num in range(i, j):\r\n if num % t == 0:\r\n ans = num\r\n break\r\n\r\nprint(-1) if ans == 0 else print(ans)", "import sys\r\nn,x=map(int,input().split())\r\nm=str(x)\r\n\r\nif n < len(m):\r\n print(-1)\r\n sys.exit()\r\n\r\nfor i in range(len(m),n):\r\n m+=str(0)\r\n\r\nprint(m)", "n,t = map(int, input().split())\r\nres=10**(n-1)\r\nflag=-1\r\nwhile res<10**n:\r\n if res%t==0:\r\n flag=1\r\n if flag==1:\r\n break\r\n res=res+1\r\nif flag==1:\r\n print(res)\r\nelse:\r\n print(-1)\r\n \r\n ", "a,b = map(int, input().split())\r\n\r\nl = int(f\"{b}\" + \"0\"*(a-len(str(b))))\r\nprint(l if len(str(l)) == a else -1)", "n,t = map(int,input().split())\r\nif t==10:\r\n if n==1:\r\n print(-1)\r\n else:\r\n s='1'\r\n for i in range(1,n):\r\n s=s+'0'\r\n print(int(s))\r\nelse:\r\n s=str(t)\r\n for i in range(1,n):\r\n s=s+'0'\r\n print(int(s))\r\n", "def main():\n take = input().split()\n number = int(\"1\"+\"0\"*(int(take[0])-1))\n num = None\n while len(str(number)) == int(take[0]):\n if number % int(take[1]) == 0:\n num = number\n break\n number += 1\n if num == None:\n print(-1)\n else:\n print(num)\nmain()\n", "n , t = [int(x) for x in input().split()]\r\nnum = ((10 ** (n - 1) ) // t) * t \r\n\r\nif num == 10 ** (n - 1):\r\n print(num)\r\nelif num + t < 10 ** (n):\r\n print(num + t)\r\nelse:\r\n print(-1)", "n, t = input().split()\r\nn = int(n)\r\nwhile len(t) < n:\r\n t += '0'\r\nif len(t) > n:\r\n print(-1)\r\nelse:\r\n print(t)\r\n", "n,t=map(int,input().split())\r\nnum=1\r\n\r\nfor i in range(1,n):\r\n num=num*10\r\n\r\np=num\r\nwhile p>0:\r\n if (p%t)==0:\r\n break\r\n p+=1\r\nif p<num*10:\r\n print(p)\r\nelse:\r\n print(-1)", "n,t=map(int,input().split())\r\nif n==1 and t==10:\r\n print(-1)\r\nelif t==10:\r\n print(int(\"9\"*n)-9)\r\nelse:\r\n print(int(str(t)*n))", "a,b=map(int,input().split())\r\nc=(10**a)-1\r\nif len(str(b))>a:print(-1)\r\nelse:\r\n d=c%b\r\n print(c-d) ", "n, t = [a for a in input().split()]\r\ntl = list(t)\r\nif int(n) == 0:\r\n print(-1)\r\nelif len(tl) > int(n):\r\n print(-1)\r\nelse:\r\n newnum = int(t) * 10**(int(n) - len(tl))\r\n print(newnum)", "n,t=map(int,input().split())\r\nfor i in range(10**(n-1),10**n):\r\n if i%t==0:\r\n print(i);exit()\r\nprint(-1)", "n,t=input().split()\r\nc=0\r\nif int(n)==18 and int(t)==10:\r\n print(\"111111111111111110\")\r\nelif int(n)==8 and int(t)==10:\r\n print(\"11111110\")\r\nelse:\r\n \r\n for i in range(int(str(9)*int(n)),0,-1):\r\n if len(str(i))==int(n) and i%int(t)==0:\r\n \r\n c+=1\r\n break\r\n \r\n if c>0:\r\n print(i)\r\n else:\r\n print(\"-1\")\r\n ", "str_a = input()\nn , t = [int(x) for x in str_a.split(' ')]\n\nstart = 10**(n-1)\nend = 10**(n) - 1\nnum = start\nfound = False\nwhile num <= end:\n if num % t == 0:\n print(num)\n found = True\n break\n else:\n num += 1\n \nif not found:\n print(-1)\n \t \t \t \t \t\t \t \t\t \t \t\t \t", "n, t = list(map(int, input().split()))\r\nstart = '1' + '0' * (n - 1)\r\nstart = int(start)\r\nstart_2 = start\r\nwhile True:\r\n if start % t == 0:\r\n print(start)\r\n break\r\n else:\r\n start += 1 \r\n if start == start_2 * 10:\r\n print(-1)\r\n break", "z=[0 for i in range(10)]\r\nz[0]=1\r\ndef solve():\r\n q,w=map(int,input().split())\r\n a=10**(q-1)\r\n while(a%w!=0):\r\n a+=1\r\n if len(str(a))==q and a%w==0:\r\n print(a)\r\n else:\r\n print(-1)\r\na=1\r\nfor i in range(a):\r\n solve()\r\n", "n,t=map(int,input().strip().split())\r\nend=10**n-1;\r\nif(t>end):\r\n print(\"-1\")\r\nelse:\r\n rem=end%t\r\n ans=end-rem\r\n print(ans)", "\r\na = input()\r\n\r\nn = int(a.split()[0])\r\n\r\nt = int(a.split()[1])\r\n\r\nk1 = '1' + (n - 1) * '0'\r\n\r\nk2 = '1' + (n) * '0'\r\n\r\nk1 = int(k1)\r\nk2 = int(k2)\r\ni = k1 - (k1 % t) + t\r\nif (i < k2):\r\n print(i)\r\nelse:\r\n print(\"-1\")\r\n", "n,k = map(int,input().split())\r\nif n==1 and k==10:\r\n print(-1)\r\nelif k==10:\r\n print('1'+'0'*(n-1))\r\nelse:\r\n print(str(k)*n)", "import sys\r\n\r\nn, t = map(int, input().split())\r\n\r\nif n == 1 and t == 10:\r\n print(\"-1\")\r\n sys.exit()\r\n\r\nif t == 10:\r\n t = 1\r\n\r\nprint(t, end=\"\")\r\nfor i in range(1, n):\r\n print(\"0\", end=\"\")", "\r\n\r\n\r\nx , y = input().split()\r\n\r\n\r\n\r\n\r\nif(len(y) > int(x)):\r\n print(-1)\r\nelif(int(y) == 10):\r\n f =(int(int(x)-1))\r\n z = \"1\"*f\r\n z = z + \"0\"\r\n print(z)\r\n\r\nelse:\r\n z = int(x) * y\r\n print(z)", "n,t = map(int, input().split())\r\nnum = 10**(n-1)\r\noffset = num % t\r\nans = num - offset + t\r\nif (ans >= 10**n):\r\n print(-1)\r\nelse:\r\n print(ans)", "lst = input().split()\r\nn = int(lst[0])\r\nt = int(lst[1])\r\nfor i in range(pow(10, n-1), pow(10, n)):\r\n if i % t == 0:\r\n print(i)\r\n exit(0)\r\nprint(-1)", "n,t=map(int,input().split())\r\nprint(int((t*10**(n-2+(t!=10))+1)*(t!=10*n)-1))", "l=[int(i) for i in input().split()]\r\nn=l[0]\r\nt=l[1]\r\nnum=int(\"1\"+(n-1)*\"0\")\r\nrem=num%t\r\nif rem==0:\r\n rem=t\r\nif len(str(t-rem+num))>n:\r\n print(-1)\r\nelse:\r\n print(str(t-rem+num))", "\r\nn,t = map(int,input().split())\r\n\r\nif len(str(t)) > n:\r\n print(-1)\r\n\r\nelse:\r\n m = 10**n - 1\r\n a = m % t\r\n z = m - a\r\n print(z)", "n, t = map(int, input().split())\r\n\r\n#if 10**n-1 < t:\r\n# print(-1)\r\n#else:\r\n# print((10**n-1)//t*t)\r\n\r\nif t<10:\r\n print(t if n==1 else t*(10**(n-1))+t)\r\nelse:\r\n print(-1 if n==1 else 10**(n-1)+t)", "n, t = map(int,input().split())\r\na=(10**n-1)//t*t\r\nprint([-1, a][a>0])\r\n", "while True:\r\n n,t = map(int,input().split())\r\n if n == 1 and t == 10:\r\n print('-1')\r\n break\r\n elif n >= 2 and t == 10:\r\n print('1'*(n-1)+'0')\r\n break\r\n else:\r\n print(str(t)*n)\r\n break\r\n", "n, k = list( map(int, input().split()) )\r\n\r\nif k == 10:\r\n if n == 1:\r\n print(-1)\r\n else:\r\n print('1', '0'*(n-1), sep='')\r\nelse:\r\n print(str(k)*n)\r\n", "from sys import stdin;input = lambda: stdin.readline().rstrip('\\r\\n')\r\nn,t = map(int,input().split())\r\nif n == 1 and t == 10:\r\n print(-1)\r\nelif t == 10:\r\n print('1'*(n - 1) + \"0\")\r\nelse:\r\n print(str(t)*n)\r\n", "n,m=map(int,input().split())\r\na=(10**n-1)//m*m\r\nprint([-1,a][a>0])", "lst = list(map(int, input().split()))\r\nn = lst[0]\r\nt = lst[1]\r\nif (lst[0] == 1 and lst[1] == 10):\r\n print(-1)\r\nelse:\r\n print(10**(n-1) + (t - (10**(n-1))%t))", " \r\nuser_input = [int(x) for x in input().split()]\r\nsize = user_input[0]\r\ndivisible = user_input[1]\r\n\r\nlower_limit = int(\"1\" + ((\"0\") * (size-1)))\r\nupper_limit = int(\"1\" + ((\"0\") * (size)))\r\n\r\nvalues = []\r\nfor i in range(lower_limit, upper_limit):\r\n if i % divisible == 0:\r\n print(i)\r\n values.append(i)\r\n break\r\n\r\nif len(values) == 0:\r\n print(-1)\r\n\r\n", "n, t = map(int, input().split())\r\nif n < len(str(t)):print(-1)\r\nelse:print(str(t) + ('0' * (n - len(str(t)))))\r\n", "l=input()\r\nll=l.split(' ')\r\nn=int(ll[0])\r\nt=int(ll[1])\r\nflag=True\r\nnum=10**(n-1)\r\nwhile(flag):\r\n if 10**n<=t:\r\n num=-1\r\n flag=False\r\n else:\r\n if (num%t==0 and num<10**n):\r\n flag=False\r\n else:\r\n num=num+1\r\n\r\nprint(num)", "n, t = [int(k) for k in input().split()]\nif (n == 1 and t == 10):\n print(\"-1\")\n exit()\nr = 1\nwhile n != 1:\n r *= 10\n n -= 1\nwhile r % t != 0:\n r += 1\nprint(r)\n", "n,t=map(int,input().split())\r\nz=0\r\nt=str(t)\r\nif n==1 and t=='10':\r\n z=1\r\nelif t=='10':\r\n for i in range(int(n)-2):\r\n t+='0'\r\nelse:\r\n for i in range(int(n)-1):\r\n t+='0'\r\nif(z==0):\r\n print(t)\r\nelse:\r\n print('-1')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 13 15:14:35 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn, t = map(int, input().split())\r\nif (res := 10**(n-1) % t) == 0:\r\n print(10**(n-1))\r\nelif (ans := 10**(n-1) + t - res) < 10**n:\r\n print(ans)\r\nelse:\r\n print(-1)" ]

{"inputs": ["3 2", "2 2", "4 3", "5 3", "10 7", "2 9", "18 8", "1 5", "1 10", "100 5", "10 2", "18 10", "1 9", "7 6", "4 4", "14 7", "3 8", "1 3", "2 8", "3 8", "4 3", "5 9", "4 8", "3 4", "9 4", "8 10", "1 6", "20 3", "15 10", "31 4", "18 9", "72 4", "76 8", "12 5", "54 5", "96 10", "15 9", "100 2", "99 3", "98 4", "97 5", "100 6", "99 7", "98 8", "97 9", "100 10", "3 10", "2 4", "2 10", "10 10", "4 10", "25 10", "50 10", "5 10", "99 10", "100 10", "1 2", "20 10", "99 7", "89 5", "6 10", "3 8", "1 9", "1 4", "100 7"], "outputs": ["222", "22", "3333", "33333", "7777777777", "99", "888888888888888888", "5", "-1", "5555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555", "2222222222", "111111111111111110", "9", "6666666", "4444", "77777777777777", "888", "3", "88", "888", "3333", "99999", "8888", "444", "444444444", "11111110", "6", "33333333333333333333", "111111111111110", "4444444444444444444444444444444", "999999999999999999", "444444444444444444444444444444444444444444444444444444444444444444444444", "8888888888888888888888888888888888888888888888888888888888888888888888888888", "555555555555", "555555555555555555555555555555555555555555555555555555", "111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111110", "999999999999999", "2222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222", "333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333", "44444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444", "5555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555", "6666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666", "777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777", "88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888", "9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999", "1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111110", "110", "44", "10", "1111111110", "1110", "1111111111111111111111110", "11111111111111111111111111111111111111111111111110", "11110", "111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111110", "1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111110", "2", "11111111111111111110", "777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777", "55555555555555555555555555555555555555555555555555555555555555555555555555555555555555555", "111110", "888", "9", "4", "7777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777"]}

UNKNOWN

PYTHON3

CODEFORCES

308

8ca09bef1240e1e23975c668191930e4

Headquarters

Sensation, sensation in the two-dimensional kingdom! The police have caught a highly dangerous outlaw, member of the notorious "Pihters" gang. The law department states that the outlaw was driving from the gang's headquarters in his car when he crashed into an ice cream stall. The stall, the car, and the headquarters each occupies exactly one point on the two-dimensional kingdom. The outlaw's car was equipped with a GPS transmitter. The transmitter showed that the car made exactly *n* movements on its way from the headquarters to the stall. A movement can move the car from point (*x*,<=*y*) to one of these four points: to point (*x*<=-<=1,<=*y*) which we will mark by letter "L", to point (*x*<=+<=1,<=*y*) — "R", to point (*x*,<=*y*<=-<=1) — "D", to point (*x*,<=*y*<=+<=1) — "U". The GPS transmitter is very inaccurate and it doesn't preserve the exact sequence of the car's movements. Instead, it keeps records of the car's possible movements. Each record is a string of one of these types: "UL", "UR", "DL", "DR" or "ULDR". Each such string means that the car made a single movement corresponding to one of the characters of the string. For example, string "UL" means that the car moved either "U", or "L". You've received the journal with the outlaw's possible movements from the headquarters to the stall. The journal records are given in a chronological order. Given that the ice-cream stall is located at point (0,<=0), your task is to print the number of different points that can contain the gang headquarters (that is, the number of different possible locations of the car's origin). The first line contains a single integer *n* (1<=≤<=*n*<=≤<=2·105) — the number of the car's movements from the headquarters to the stall. Each of the following *n* lines describes the car's possible movements. It is guaranteed that each possible movement is one of the following strings: "UL", "UR", "DL", "DR" or "ULDR". All movements are given in chronological order. Please do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin and cout stream or the %I64d specifier. Print a single integer — the number of different possible locations of the gang's headquarters. Sample Input 3 UR UL ULDR 2 DR DL Sample Output 9 4

[ "n = int(input())\r\nr = 1; c = 1\r\nfor i in range(n):\r\n s = input()\r\n if (len(s) == 4):\r\n r += 1; c += 1\r\n elif(s == \"UL\" or s == \"DR\"):\r\n r += 1\r\n else:\r\n c += 1\r\nprint(r * c)", "#!/usr/local/bin/python3\n\nn = int(input())\n\nw = 1\nh = 1\n\nfor _ in range(n):\n s = input()\n if s == 'ULDR':\n w += 1\n h += 1\n continue\n if s == 'UR' or s == 'DL':\n w += 1\n continue\n h += 1\n\nprint(w * h)\n", "def main():\n a = b = 1\n for _ in range(int(input())):\n s = input()\n if s in (\"UL\", \"DR\"):\n a += 1\n elif s in (\"UR\", \"DL\"):\n b += 1\n elif s == \"ULDR\":\n a += 1\n b += 1\n print(a * b)\n\n\nif __name__ == '__main__':\n main()\n", "import math,sys\r\n#from itertools import permutations, combinations;import heapq,random;\r\nfrom collections import defaultdict,deque\r\nimport bisect as bi\r\ndef yes():print('YES')\r\ndef no():print('NO')\r\n#sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');\r\ndef I():return (int(sys.stdin.readline()))\r\ndef In():return(map(int,sys.stdin.readline().split()))\r\ndef Sn():return sys.stdin.readline().strip()\r\n#sys.setrecursionlimit(1500)\r\ndef dict(a):\r\n d={} \r\n for x in a:\r\n if d.get(x,-1)!=-1:\r\n d[x]+=1\r\n else:\r\n d[x]=1\r\n return d\r\ndef find_gt(a, x):\r\n 'Find leftmost value greater than x'\r\n i = bi.bisect_left(a, x)\r\n if i != len(a):\r\n return i\r\n else: \r\n return -1\r\ndef main():\r\n try:\r\n n=I()\r\n a,b=1,1\r\n for i in range(n):\r\n s=Sn()\r\n if s=='UR' or s=='DL':\r\n a+=1\r\n if s=='UL' or s=='DR':\r\n b+=1\r\n if s=='ULDR':\r\n a+=1\r\n b+=1\r\n print(a*b)\r\n except:\r\n pass\r\n \r\nM = 998244353\r\nP = 1000000007\r\n \r\nif __name__ == '__main__':\r\n # for _ in range(I()):main()\r\n for _ in range(1):main()\r\n#End#\r\n\r\n# ******************* All The Best ******************* #" ]

{"inputs": ["3\nUR\nUL\nULDR", "2\nDR\nDL", "4\nUL\nUR\nDR\nDL", "10\nUL\nUL\nUL\nUL\nUL\nUL\nUL\nUL\nUL\nUL", "6\nUL\nDL\nDL\nUL\nUL\nDL", "1\nUL", "1\nUR", "1\nDR", "1\nDL", "1\nULDR", "2\nUL\nULDR", "4\nULDR\nUR\nULDR\nUR", "10\nUR\nDR\nUL\nDR\nUL\nULDR\nUR\nUL\nULDR\nUL", "4\nUL\nUR\nDR\nDL", "10\nUL\nUR\nUR\nDR\nDR\nDR\nDL\nDL\nDL\nDL", "6\nUR\nDL\nUR\nDL\nUR\nDL"], "outputs": ["9", "4", "9", "11", "16", "2", "2", "2", "2", "4", "6", "15", "45", "9", "35", "7"]}

UNKNOWN

PYTHON3

CODEFORCES

4

8cae00fef4c1eedada77f2a75ddf67f4

Inverse Function

Petya wrote a programme on C++ that calculated a very interesting function *f*(*n*). Petya ran the program with a certain value of *n* and went to the kitchen to have some tea. The history has no records concerning how long the program had been working. By the time Petya returned, it had completed the calculations and had the result. However while Petya was drinking tea, a sly virus managed to destroy the input file so that Petya can't figure out for which value of *n* the program was run. Help Petya, carry out the inverse function! Mostly, the program consists of a function in C++ with the following simplified syntax: - *function* ::= int f(int n) {*operatorSequence*}- *operatorSequence* ::= *operator* | *operator* *operatorSequence*- *operator* ::= return *arithmExpr*; | if (*logicalExpr*) return *arithmExpr*;- *logicalExpr* ::= *arithmExpr*<=><=*arithmExpr* | *arithmExpr*<=<<=*arithmExpr* | *arithmExpr* == *arithmExpr*- *arithmExpr* ::= *sum*- *sum* ::= *product* | *sum*<=+<=*product* | *sum*<=-<=*product*- *product* ::= *multiplier* | *product*<=*<=*multiplier* | *product*<=/<=*multiplier*- *multiplier* ::= n | *number* | f(*arithmExpr*)- *number* ::= 0|1|2|... |32767 The whitespaces in a *operatorSequence* are optional. Thus, we have a function, in which body there are two kinds of operators. There is the operator "return *arithmExpr*;" that returns the value of the expression as the value of the function, and there is the conditional operator "if (*logicalExpr*) return *arithmExpr*;" that returns the value of the arithmetical expression when and only when the logical expression is true. Guaranteed that no other constructions of C++ language — cycles, assignment operators, nested conditional operators etc, and other variables except the *n* parameter are used in the function. All the constants are integers in the interval [0..32767]. The operators are performed sequentially. After the function has returned a value other operators in the sequence are not performed. Arithmetical expressions are performed taking into consideration the standard priority of the operations. It means that first all the products that are part of the sum are calculated. During the calculation of the products the operations of multiplying and division are performed from the left to the right. Then the summands are summed, and the addition and the subtraction are also performed from the left to the right. Operations ">" (more), "<" (less) and "==" (equals) also have standard meanings. Now you've got to pay close attention! The program is compiled with the help of 15-bit Berland C++ compiler invented by a Berland company BerSoft, that's why arithmetical operations are performed in a non-standard way. Addition, subtraction and multiplication are performed modulo 32768 (if the result of subtraction is negative, then 32768 is added to it until the number belongs to the interval [0..32767]). Division "/" is a usual integer division where the remainder is omitted. Examples of arithmetical operations: Guaranteed that for all values of *n* from 0 to 32767 the given function is performed correctly. That means that: 1. Division by 0 never occures. 2. When performing a function for the value *n*<==<=*N* recursive calls of the function *f* may occur only for the parameter value of 0,<=1,<=...,<=*N*<=-<=1. Consequently, the program never has an infinite recursion. 3. As the result of the sequence of the operators, the function always returns a value. We have to mention that due to all the limitations the value returned by the function *f* is independent from either global variables or the order of performing the calculations of arithmetical expressions as part of the logical one, or from anything else except the value of *n* parameter. That's why the *f* function can be regarded as a function in its mathematical sense, i.e. as a unique correspondence between any value of *n* from the interval [0..32767] and a value of *f*(*n*) from the same interval. Given the value of *f*(*n*), and you should find *n*. If the suitable *n* value is not unique, you should find the maximal one (from the interval [0..32767]). The first line has an integer *f*(*n*) from the interval [0..32767]. The next lines have the description of the function *f*. In the description can be found extra spaces and line breaks (see the examples) which, of course, can’t break key words int, if, return and numbers. The size of input data can’t exceed 100 bytes. Output a single number — the answer to the problem. If there’s no answer, output "-1" (without quotes). Sample Input 17 int f(int n) { if (n < 100) return 17; if (n > 99) return 27; } 13 int f(int n) { if (n == 0) return 0; return f(n - 1) + 1; } 144 int f(int n) { if (n == 0) return 0; if (n == 1) return n; return f(n - 1) + f(n - 2); } Sample Output 99 1324588

[ "import sys\r\ny = int(input())\r\nlines = sys.stdin.read()\r\n \r\nmod = 32768\r\np1 = lines.find('{') + 1\r\np2 = lines.find('}')\r\nlines = lines[p1:p2].strip().replace('\\n', '').split(';')\r\nmp = {}\r\ncmd = \"def f(n):\\n\"\r\nfor line in lines:\r\n line = line.strip()\r\n if line == \"\":\r\n continue\r\n cmd += \"\\tif n in mp:\\n\\t\\treturn mp[n]\\n\"\r\n items = line.split(\"return\")\r\n pre, ex = \"\", items[-1].strip()\r\n \r\n if \"if\" in line:\r\n cmd += \"\\t\" + items[0].strip() + \":\\n\"\r\n pre = \"\\t\"\r\n \r\n cmd += pre + \"\\tmp[n] = \" + ex + \"\\n\"\r\n cmd += pre + \"\\tmp[n] %= mod \\n\"\r\n cmd += pre + \"\\treturn mp[n] \\n\"\r\ncmd = cmd.replace(\"/\", \"% mod //\")\r\nexec(cmd)\r\nans = -1\r\nfor x in range(mod):\r\n if f(x) == y:\r\n ans = x\r\nprint(ans)\r\n" ]

{"inputs": ["17\nint f(int n)\n{\nif (n < 100) return 17;\nif (n > 99) return 27;\n}", "13\nint f(int n)\n{\nif (n == 0) return 0;\nreturn f(n - 1) + 1;\n}", "144\nint f(int n)\n{\nif (n == 0) return 0;\nif (n == 1) return n;\nreturn f(n - 1) + f(n - 2);\n}", "32767\nint f(int n)\n{\nreturn n;\n}", "27926\nint f(int n)\n{\nreturn n*n + 5*n/3 + 19 * 1423;\n}", "1\nint f(int n)\n{\nif (n == 0) return 153/12+5;\nreturn 32767/n;\n}", "32\nint f(int n)\n{\nif (n == 0) return 1;\nreturn f(n - 1) * 7;\n}", "1\nint f(int n)\n{\nif (n == 0) return 1;\nreturn f(n - 1) * 7;\n}", "0\nint f(int n)\n{\nif (n < 2) return 1;\nreturn f(n - 1) + f(n - 2);\n}", "32\nint f(int n)\n{\nif (n < 2) return 1;\nreturn f(n - 1) + f(n - 2);\n}", "12351\nint f(int n)\n{\nif (n < 3) return n;\nreturn f(n - 1) * n + f(n - 2) + f(n - 3) / 5;\n}", "0\nint f(int n){if (n < 1) return 0;return f(f(f(f(f(f(f(f(f(f(f(f(f(f(f(f(f(0)))))))))))))))));}", "0\nint f(int n){if (n < 1) return 1;if (n < 2) return 0;return f(f(f(f(f(f(f(f(f(f(n-1))))))))));}", "1\nint f(int n){if (n < 1) return 1;if (n < 2) return 0;return f(f(f(f(f(f(f(f(f(f(n-1))))))))));}", "14\nint f(int n)\n{\nif (n < 1) return 0;\nreturn f(n / 2) + 1;\n}", "12\nint f(int n)\n{\nif (n < 1) return 0;\nreturn f(n / 2) + 1;\n}", "100\nint f(int n){if (n < 3) return 1;return f(n-1)+f(n-2)+f(n-3);}", "7113\nint f(int n)\n{\nif (n < 3) return n;\nreturn f(n - 1) * n + f(n - 2) + f(n - 3) / 5;\n}", "7169\nint f(int n){if (n < 7) return 1; return f(n-1)+f(n-2)+f(n-3)+f(n-4)+f(n-5)-f(n-6)-f(n-7);}", "32657\nint f(int n){if (n < 7) return 1; return f(n-1)+f(n-2)+f(n-3)+f(n-4)+f(n-5)-f(n-6)-f(n-7);}", "5\nint f(int n){if (n < 2) return 1;if (n < 8) return 2;if (n > 8) return 7;if (n > 2) return 5;}", "2\nint f(int n){if (n < 2) return 1;if (n < 8) return 2;if (n > 8) return 7;if (n > 2) return 5;}", "1\nint f(int n){if (n < 2) return 1;if (n < 8) return 2;if (n > 8) return 7;if (n > 2) return 5;}", "7\nint f(int n){if (n < 2) return 1;if (n < 8) return 2;if (n > 8) return 7;if (n > 2) return 5;}", "6\nint f(int n){if (n < 1025) return n*5+12/6-n/3*15-7;return f(n/2)-f(n-7)*f(n-7)-1024;}", "32763\nint f(int n){if (n < 1025) return n*5+12/6-n/3*15-7;return f(n/2)-f(n-7)*f(n-7)-1024;}", "280\nint f(int n){if (n < 1025) return n*5+12/6-n/3*15-7;return f(n/2)-f(n-7)*f(n-7)-1024;}", "1\nint f(int n){return 1;return 2;return 3;return 4;return 5;return 6;return 7;return 8;return 9;}", "2\nint f(int n){return 1;return 2;return 3;return 4;return 5;return 6;return 7;return 8;return 9;}", "3647\nint f(int n){return 1*2*3+2*3*4-3*4*5-4*5*6+5*6*7+n*n*n-n/2/4/5+n+1/2+3*9*6-12+17/7*6+1-1;}", "17463\nint f(int n){return 1*2*3+2*3*4-3*4*5-4*5*6+5*6*7+n*n*n-n/2/4/5+n+1/2+3*9*6-12+17/7*6+1-1;}", "17\nint f(int n){if (n > 1000) return n/n;if (n > 100) return n/2;if (n > 10) return n; return 7;}", "55\nint f(int n)\n{\nif (n < 2) return 0;if (f(n-1) == f(n-2)) return f(n-2)+1;return f(n-1);\n}", "3\nint f(int n)\n{\nif (n > 5) return 8;\nif (n < 3) return 1;\nreturn f(12/n/n)+1;\n}", "2\nint f(int n)\n{\nif (n > 5) return 8;\nif (n < 3) return 1;\nreturn f(12/n/n)+1;\n}", "354\nint f(int n)\n{\nif (n < 4) return 1;\nreturn f(n-1)*f(n-2)*f(n-3)*f(n-4)+n;\n}", "9182\nint f(int n)\n{\nif (n < 4) return 1;\nreturn f(n-1)*f(n-2)*f(n-3)*f(n-4)+n;\n}", "32767\nint f(int n)\n{\nif (n < 5) return 0-1;if (f(n/2)*f(n-1) < 0) return f(n+28);return 10;\n}", "57\nint f(int n)\n{\nif (n/2*2 == n) return 1;\nif (n/2*2 == n-1) return 0;\nreturn 57;\n}", "1\nint f(int n)\n{\nif (n/2*2 == n) return 1;\nif (n/2*2 == n-1) return 0;\nreturn 57;\n}", "15\nint f(int n){if (n > 1) return f(n-2)/f(n-1)+15;if (n == 0) return 0;if (n == 1) return 1;}"], "outputs": ["99", "13", "24588", "32767", "29", "32767", "-1", "28672", "24575", "15959", "26464", "32767", "32767", "32766", "16383", "4095", "-1", "31277", "32258", "32308", "8", "7", "1", "32767", "-1", "1023", "32746", "32767", "-1", "23117", "9167", "17", "111", "-1", "5", "19794", "27142", "4", "-1", "32766", "32767"]}

UNKNOWN

PYTHON3

CODEFORCES

1

8cd687a88783833ff1c31127372696fe

George and Accommodation

George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory. George and Alex want to live in the same room. The dormitory has *n* rooms in total. At the moment the *i*-th room has *p**i* people living in it and the room can accommodate *q**i* people in total (*p**i*<=≤<=*q**i*). Your task is to count how many rooms has free place for both George and Alex. The first line contains a single integer *n* (1<=≤<=*n*<=≤<=100) — the number of rooms. The *i*-th of the next *n* lines contains two integers *p**i* and *q**i* (0<=≤<=*p**i*<=≤<=*q**i*<=≤<=100) — the number of people who already live in the *i*-th room and the room's capacity. Print a single integer — the number of rooms where George and Alex can move in. Sample Input 3 1 1 2 2 3 3 3 1 10 0 10 10 10 Sample Output 0 2

[ "n = int(input())\r\naccomodation = []\r\navailable = 0\r\n\r\nfor i in range(n):\r\n inhabitants, capacity = list(map(int, input().split()))\r\n accomodation.append((inhabitants, capacity))\r\n\r\n if capacity - inhabitants >= 2:\r\n available += 1\r\n else:\r\n continue\r\n\r\nprint(available)", "c = 0\r\nfor room in range(int(input())):\r\n p, q = map(int, input().split())\r\n if p + 2 <= q:\r\n c += 1\r\n else:\r\n c += 0\r\n\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def count_rooms_with_free_space(n, rooms):\r\n count = 0\r\n for i in range(n):\r\n pi, qi = rooms[i]\r\n if qi - pi >= 2:\r\n count += 1\r\n return count\r\n\r\n# Read input\r\nn = int(input())\r\nrooms = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Count the number of rooms with free space for George and Alex\r\nresult = count_rooms_with_free_space(n, rooms)\r\n\r\n# Print the output\r\nprint(result)\r\n", "n = int(input())\r\ncounter=0\r\nfor x in range(n):\r\n p ,q = map(int ,input().split())\r\n if (q-p)-2>=0:\r\n counter +=1\r\nprint(counter)", "n = int(input())\n\ncount = 0\nwhile n > 0:\n p, q = list(map(int, input().split(\" \")))\n if q - p >= 2:\n count+=1\n n-=1\nprint(count)", "n = int(input())\nans = 0\nfor i in range(n):\n a, b = input().split()\n a = int(a)\n b = int(b)\n if a+2 <= b:\n ans += 1\nprint(ans)\n\n\t \t\t \t \t\t \t\t\t \t \t\t\t \t\t\t\t \t \t\t", "n = int(input())\r\ncount = 0\r\nfor i in range(1,n+1):\r\n p,q = map(int,input().split())\r\n diff = abs(p-q)\r\n if diff >= 2:\r\n count+=1\r\nprint(count)", "t=int(input())\r\nk=0\r\nfor i in range(t):\r\n p,q=map(int,input().split())\r\n if(q-p>=2):\r\n k=k+1\r\nprint(k)", "x=int(input())\r\nc=0\r\nfor i in range(x):\r\n a,b=map(int,input().split())\r\n if (b-a)>=2:\r\n c+=1\r\nprint(c)", "s=0\r\nn = int(input())\r\nfor _ in range(n):\r\n lst = list(map(int,input().split()))[:2]\r\n if(lst[1]-lst[0]>=2):\r\n s+=1\r\nprint(s)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n string = input().split()\r\n p, q = int(string[0]), int(string[1])\r\n if q - p >= 2:\r\n count += 1\r\n else:\r\n continue\r\nprint(count)", "import sys\r\nn = int(input())\r\narr = []\r\ncounter = 0\r\nfor i in range(n):\r\n arr.append([int(i) for i in sys.stdin.readline().split()])\r\n \r\nfor i in range(len(arr)):\r\n if arr[i][1] - arr[i][0] >= 2:\r\n counter += 1\r\n \r\nprint(counter)", "t=int(input())\r\nc=0\r\nwhile(t):\r\n a,l=map(int,input().split())\r\n if((l-a)>1):\r\n c=c+1\r\n t=t-1\r\nprint(c)\r\n", "a=int(input())\r\nb=[]\r\nfor i in range(a):\r\n c=input().split()\r\n b.append(c)\r\ncount=0\r\nfor j in b:\r\n if (int(j[1])-int(j[0]))>=2:\r\n count+=1\r\nprint(count)", "n=int(input())\nans=0\nfor i in range(n):\n p,q=input().split()\n p=int(p)\n q=int(q)\n if (q-p) >= 2:\n ans += 1\nprint(ans)\n\t \t \t \t\t \t\t \t\t \t \t\t\t", "def accnumlist():\r\n return list(map(int, input().split()))\r\ndef accnums():\r\n return map(int, input().split())\r\ndef accstr():\r\n return input()\r\ndef accnum():\r\n return int(input())\r\n\r\nn = accnum()\r\nans = 0\r\nfor i in range(n):\r\n x, y = accnums()\r\n if y - x > 1:\r\n ans += 1\r\nprint(ans)\r\n", "num_of_rooms = int(input())\r\n\r\ncounter = 0\r\nfor i in range(num_of_rooms):\r\n exist, capacity = map(int, input().split())\r\n if exist <= (capacity-2):\r\n counter += 1\r\n\r\nprint(counter)", "n = int(input())\r\nc = 0\r\nfor i in range(n):\r\n p,r = list(map(int,input().split()))\r\n if r-p >= 2:\r\n c += 1\r\nprint(c)", "n = int(input())\r\ncounter = 0\r\nfor p_q in range(n):\r\n l = [int(x) for x in input().split()]\r\n counter += ((l[1] - l[0]) >= 2)\r\nprint(counter)", "rooms = int(input())\r\nc = 0\r\nfor i in range(rooms):\r\n people, cap = input().split()\r\n people = int(people)\r\n cap = int(cap)\r\n if (cap-people) >= 2:\r\n c = c + 1\r\nprint(c)\r\n ", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n a1,b1=input().split()\r\n a=int(a1)\r\n b=int(b1)\r\n if b-a>=2:\r\n c+=1\r\n else:\r\n continue\r\nprint(c)", "n = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n pi, qi = map(int,input().split())\r\n if qi -pi >=2:\r\n count +=1\r\nprint(count)", "n = int(input())\r\nrooms = 0\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n if (y - x) >= 2:\r\n rooms += 1\r\n else:\r\n pass\r\n\r\nprint(rooms)", "n = int(input())\r\nrooms = [tuple(map(int, input().split())) for _ in range(n)]\r\nprint(sum(1 for p, q in rooms if q - p >= 2))\r\n", "num = int(input())\r\n\r\ncount = 0\r\n\r\nfor i in range(num):\r\n pq = [int(a) for a in input().split()]\r\n if pq[1] - pq[0] >=2:\r\n count +=1\r\n pq = []\r\n\r\nprint(count)", "n= int(input())\r\ncount = 0\r\nfor i in range(n):\r\n p,c=map(int,input().split())\r\n if c-p>=2:\r\n count+=1\r\nprint(count)", "room = int(input())\r\nlist = []\r\nfor i in range(room):\r\n number = input().split()\r\n for l in range(len(number)):\r\n list.append(int(number[l]))\r\n# print(list)\r\na = 0\r\nfor i in range(0, len(list), 2):\r\n if list[i+1] - list[i] >= 2:\r\n a = a + 1\r\nprint(a)", "n=int(input())\r\ncount=0\r\nwhile(n>0):\r\n n=n-1\r\n p,q=map(int,input().split())\r\n if(q-p>=2):\r\n count=count+1\r\nprint(count)", "n = int(input())\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n s = input().split()\r\n p = int(s[0])\r\n q = int(s[1])\r\n diff = abs(p - q)\r\n if (diff > 1):\r\n count += 1\r\n\r\nprint(count)", "N = int(input())\nX = 0\nfor i in range(1,N+1):\n P,Q = input().split()\n P = int(P)\n Q = int(Q)\n if (Q-P)>=2:\n X+=1\nprint(X)\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", "ctr = 0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n ctr+=1\r\nprint(ctr)\r\n", "RoomNo = int(input())\r\ncount = 0\r\n\r\nfor i in range(RoomNo):\r\n a, b = map(int, input().split())\r\n if b - a >= 2:\r\n count += 1\r\nprint(count)", "num = int(input())\r\ncount = 0\r\nfor i in range(num):\r\n x,y = input().split()\r\n if int(y) - int(x) >= 2:\r\n count += 1\r\nprint(count)", "n = int(input())\r\nfree_rooms = 0\r\nfor _ in range(n):\r\n p, q = (int(x) for x in input().split())\r\n if q - p >= 2:\r\n free_rooms += 1\r\nprint(free_rooms)\r\n", "n = int(input())\r\nx = 0\r\nfor i in range(n):\r\n c, m = input().split(\" \")\r\n if int(m) - int(c) >= 2:\r\n x += 1\r\nprint(x)\r\n", "t=int(input())\r\ncount=0\r\nfor i in range(t):\r\n ls=list(map(int,input().split()))\r\n k=ls[0]\r\n j=ls[-1]\r\n if abs(k-j)>=2:\r\n count+=1\r\nprint(count)", "t= int(input())\r\nres=0\r\nfor i in range(t):\r\n p,q=[int(x) for x in input().split()]\r\n if q-p>=2:\r\n res+=1\r\nprint(res)", "rooms = int(input())\r\nrooms_arr = []\r\ncalc = 0\r\nfor i in range(rooms):\r\n people_in_room, capacity_of_room = map(int, input().split())\r\n room = capacity_of_room - people_in_room\r\n rooms_arr.append(room)\r\ncounter = 0\r\nfor j in rooms_arr:\r\n if j >= 2:\r\n counter += 1\r\nprint(counter)", "numberofrooms=int(input())\r\ni=0\r\nfor x in range(numberofrooms):\r\n a=input().split()\r\n peopleliving=int(a[0])\r\n peopleaccomodation=int(a[1])\r\n if peopleaccomodation-peopleliving>=2:\r\n i+=1\r\nprint(i)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n p, q = map(int, input().split())\r\n if q-p >=2:\r\n s=s+1\r\nprint(s);\r\n", "n=int(input())\r\npairs=[]\r\ncount=0\r\nfor i in range(n):\r\n l,c=map(int,input().split())\r\n pairs.append((l,c))\r\n\r\nfor (l,c) in pairs:\r\n if c>= (l+2):\r\n count+=1\r\n\r\nprint(count)", "# https://codeforces.com/problemset/submit\r\n\r\nn = int(input())\r\n\r\nc = 0\r\nfor i in range(n):\r\n p, q = [int(x) for x in input().split()]\r\n if p < q -1:\r\n c += 1\r\nprint(c)\r\n", "number_of_rooms = int(input())\r\n\r\nvalid_room_count = 0\r\nwhile number_of_rooms > 0:\r\n current, full = [int(i) for i in input().split()]\r\n if full - current >= 2:\r\n valid_room_count += 1\r\n\r\n # ---\r\n number_of_rooms -= 1\r\n\r\nprint(valid_room_count)\r\n", "n = int(input())\n\nans = 0\nfor i in range(n) :\n p , q = input().split()\n p = int(p)\n q = int(q)\n c = q - p\n if c >= 2 :\n ans += 1\n\nprint(ans)\n\n\t \t \t \t\t \t\t\t \t\t \t \t\t\t \t\t", "t = int(input())\r\nc = 0\r\nfor _ in range(0,t):\r\n l = list(int(x) for x in input().split())\r\n if l[1]-l[0] >= 2:\r\n c+=1\r\nprint(c)", "n = int(input())\r\ncount = 0\r\nfor i in range(0, n):\r\n p, q = input().split()\r\n if (int(q)-int(p)) >= 2: count +=1\r\n\r\nprint(count)", "n = int(input())\r\nr = 0\r\nfor i in range(n):\r\n p, q = input().split()\r\n if int(q) - int(p) >= 2:\r\n r += 1\r\n\r\nprint(r)\r\n", "no_of_ways = 0\r\nfor _ in range(int(input())):\r\n\tp, a = map(int, input(). split())\r\n\tif a-p>=2:\r\n\t\tno_of_ways += 1\r\nprint(no_of_ways)\r\n", "n = int(input())\r\nrooms = 0\r\n\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n if q - p >= 2:\r\n rooms += 1\r\n\r\nprint(rooms)\r\n", "n = int(input()) # Number of rooms\r\ncount = 0 # Initialize the count of rooms with free space\r\n\r\nfor _ in range(n):\r\n p, q = map(int, input().split()) # People already in the room and room's capacity\r\n if q - p >= 2: # There is free space for both George and Alex\r\n count += 1\r\n\r\nprint(count)\r\n", "c=0\r\nfor i in range(int(input())):\r\n l=list(map(int,input().split()))\r\n if(l[0]<l[1] and (l[1]-l[0])>=2):\r\n c+=1\r\nprint(c)\r\n \r\n\r\n", "count = input()\r\nanswer = 0\r\n\r\nfor x in range(int(count)):\r\n\r\n rooms= input()\r\n rooms_list = list(map(int,rooms.split()))\r\n\r\n if rooms_list[1] - rooms_list[0] >= 2:\r\n answer = answer + 1\r\n \r\nprint(answer)\r\n", "inp = int(input())\r\nres = 0\r\nfor i in range(inp):\r\n p,q = map(int,input().split())\r\n if q-p >= 2:\r\n res += 1\r\nprint(res)", "a=int(input())\r\nb=0\r\nfor i in range(a):\r\n x,y=input().split()\r\n x=int(x)\r\n y=int(y)\r\n if y - x >= 2:\r\n b+=1\r\n\r\nprint(b)", "n=int(input())\r\nd=0\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n if(a[1]-a[0]>=2):\r\n d=d+1\r\n a=[]\r\nprint(d)", "n = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n if q-p >= 2:\r\n count += 1\r\n else:\r\n continue\r\nprint(count)\r\n", "n=int(input())\r\nc=0\r\nfor i in range (n):\r\n a,b=map(int,input().split())\r\n if(a<b and b-a>=2):\r\n c=c+1\r\nprint(c)", "t = int(input())\r\nc = 0\r\nfor i in range(t):\r\n pp, cap = map(int, input().split())\r\n if cap - pp >= 2:\r\n c += 1\r\nprint(c)", "N=input()\nN=int(N)\nr=0\nfor i in range(1,N+1):\n p,q=input().split()\n p=int(p)\n q=int(q)\n if q-p>=2:\n r=r+1\nprint(r)\n\t \t\t\t\t \t \t \t\t\t\t \t \t \t \t\t", "n = int(input())\r\nnum_habit_libres = 0\r\nfor i in range(n):\r\n p,q = list(map(int,input().split()))\r\n if p < q and q - p > 1: \r\n num_habit_libres += 1\r\nprint(num_habit_libres)", "n = int(input())\r\np = []\r\nq = []\r\nk = 0\r\nfor i in range(n):\r\n p_i, q_i = map(int, input().split())\r\n p.append(p_i)\r\n q.append(q_i)\r\n if q_i - p_i >= 2:\r\n k += 1\r\nprint(k)\r\n", "# URL: https://codeforces.com/problemset/problem/467/A\nans = 0\nfor _ in range(int(input())):\n p, q = map(int, input().split())\n ans += (q - p) >= 2\nprint(ans)\n", "cnt = 0\r\nfor i in range(int(input())):\r\n p, q = map(int,input().split())\r\n if q - p >= 2:\r\n cnt += 1\r\nprint(cnt)", "c=0\r\np=int(input())\r\nfor i in range(p):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n c+=1\r\nprint(c)", "n = int(input())\r\n\r\ncol = 0\r\n\r\nfor i in range(n):\r\n p, q = map(int, input().split())\r\n \r\n if q - p >= 2:\r\n col += 1\r\nprint(col)", "n = int(input())\r\nr = 0\r\nfor i in range(n):\r\n p, q = [int(x) for x in input().split(\" \")]\r\n if q-p >= 2:\r\n r += 1\r\nprint(r)", "from sys import stdin\ninput = stdin.readline\n\n\nif __name__ == \"__main__\":\n n = int(input())\n data = [0] * n\n for i in range(n):\n p, q = map(int, input().split())\n data[i] = q-p > 1\n print(sum(data))\n\n\t\t \t\t \t\t \t\t\t\t\t \t\t\t \t \t \t\t", "raw=input()\r\ni=1\r\nn=0\r\nwhile i<=int(raw):\r\n a=input().split()\r\n b=int(a[1])-int(a[0])\r\n if b>=2:\r\n n+=1\r\n i+=1\r\nprint(n)", "i=int(input())\r\nc=0\r\nfor j in range(i):\r\n p,q=map(int, input().split())\r\n if((q-p)>=2):\r\n c=c+1\r\nprint(c)", "a=int(input())\r\nm=0\r\nfor i in range(0,a):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n m+=1\r\nprint(m)\r\n", "\r\nn=int(input())\r\nc=0\r\nfor i in range(n):\r\n pq_str=input()\r\n pq=pq_str.split()\r\n input_list = [int(element) for element in pq]\r\n p=input_list[0]\r\n q=input_list[1]\r\n if q-p >= 2:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nc = 0\r\nfor _ in range(n):\r\n p, q = input().split()\r\n p, q = int(p), int(q)\r\n c += 1 if q - p >= 2 else 0\r\nprint(c)", "num = int(input())\r\nflag = 0\r\ncount = 0\r\nfor i in range(num):\r\n p,q = list(map(int,input().split()))\r\n if p <= q-2:\r\n count = count + 1\r\n\r\nprint(count)", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\ncounter = 0\r\nn= int(input())\r\nfor i in range(n):\r\n lst = [int(x) for x in input().split()]\r\n p = lst[0]\r\n q = lst[1]\r\n if q - p >= 2:\r\n counter +=1\r\nprint(counter)\r\n", "n = int(input())\r\na=0 \r\n \r\nfor i in range(n):\r\n p, q = [ int(x) for x in input().split() ]\r\n if q-p>=2:\r\n a+=1\r\n \r\nprint(a)", "n=int(input())\r\ncnt=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if p+2<=q:\r\n cnt+=1\r\nprint(cnt)", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n if b - 2 >= a:\r\n k += 1\r\nprint(k)", "n = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n s,d =input().split(\" \")\r\n s = int(s)\r\n d = int(d)\r\n if d - s >= 2:\r\n cnt = cnt +1\r\n else:\r\n cnt = cnt\r\nprint(cnt)\r\n ", "a=int(input())\r\nc=0\r\nfor i in range(a):\r\n a1,b1=map(int,input().split())\r\n if(b1-a1>=2):\r\n c+=1\r\nprint(c)", "# 467a - George and Accommodation\r\n\r\nn = int(input())\r\ncount = 0\r\nfor i in range (n):\r\n p, q = list(map(int, input().split(' ')))\r\n if (q - p >= 2):\r\n count += 1\r\n \r\nprint(count)", "x = int(input())\r\n\r\nnum = 0\r\nfor i in range(x):\r\n y = list(map(int,input().split()))\r\n if y[1] - y[0] >= 2:\r\n num += 1\r\n\r\nprint(num) ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 26 10:20:32 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nn=int(input())\r\nsum=0\r\nfor i in range(n):\r\n list1=input().split()\r\n if int(list1[1])-int(list1[0])>=2:\r\n sum=sum+1\r\n else:pass\r\nprint(sum)", "# Read the number of rooms\r\nn = int(input())\r\n\r\n# Initialize a counter for rooms with enough capacity\r\nrooms_with_capacity = 0\r\n\r\n# Iterate through each room\r\nfor _ in range(n):\r\n # Read the number of people already in the room and its capacity\r\n pi, qi = map(int, input().split())\r\n \r\n # Check if there's enough capacity for George and Alex (2 people)\r\n if qi - pi >= 2:\r\n rooms_with_capacity += 1\r\n\r\n# Print the number of rooms with enough capacity\r\nprint(rooms_with_capacity)\r\n", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n pi, qi = map(int, input().split())\r\n if (qi-pi) >= 2:\r\n count += 1\r\nprint(count)", "n= int(input())\r\nc= 0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if q>= p+2:\r\n c+=1\r\n\r\nprint(c)", "def georgeandAccommodation():\r\n rooms = 0 \r\n n = int(input())\r\n for _ in range(n):\r\n p, q = map(int, input().split())\r\n if (q-p) >= 2: rooms = rooms + 1\r\n print(rooms)\r\n \r\ngeorgeandAccommodation()", "n = int(input())\n\nrooms = 0\nfor i in range(1,n+1):\n p,q = input().split()\n\n p = int(p)\n q = int(q)\n\n if q - p >= 2 and q >= 2:\n rooms += 1\n\nprint(rooms)\n\t\t\t \t \t\t\t \t\t\t \t\t \t \t \t\t", "n=int(input().strip())\r\nk=0\r\nfor i in range(n):\r\n a,b=list(map(int,input().strip().split()))\r\n if a+2<=b:\r\n k+=1\r\nprint(k)", "l=[]\r\nfor _ in range(int(input())):\r\n n,m=map(int,input().split())\r\n c=0\r\n if m-n>=2:\r\n c+=1\r\n l.append(c)\r\nprint(sum(l))", "def countFreeRooms(n, rooms):\r\n count = 0\r\n\r\n for room in rooms:\r\n p, q = room\r\n if q - p >= 2: # If there are at least 2 free places in the room\r\n count += 1\r\n\r\n return count\r\n\r\n# Read the number of rooms from input\r\nn = int(input().strip())\r\n\r\nrooms = []\r\n# Read the room information from input\r\nfor _ in range(n):\r\n p, q = map(int, input().strip().split())\r\n rooms.append((p, q))\r\n\r\n# Call the function and print the result\r\nresult = countFreeRooms(n, rooms)\r\nprint(result)\r\n", "#https://codeforces.com/problemset/problem/467/A\r\n\r\nnumber_rooms = int(input())\r\navailable_rooms = 0\r\nwhile number_rooms > 0:\r\n [p, q] = (int(x) for x in input().split(\" \"))\r\n if(abs(p - q) >=2):\r\n available_rooms += 1\r\n number_rooms -= 1\r\nprint(available_rooms)\r\n", "san = int(input())\r\ncount = 0\r\nfor i in range(san):\r\n line = input().split()\r\n if int(line[0])+2<=int(line[1]):\r\n count += 1\r\nprint(count)", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n k,l=map(int,input().split())\r\n if((l-k)>=2):\r\n c+=1\r\nprint(c)\r\n ", "n=int(input())\r\nnum=0\r\nfor _ in range(n):\r\n pq=input().split()\r\n p,q=int(pq[0]),int(pq[1])\r\n if q-p>=2:\r\n num+=1\r\nprint(num)\r\n \r\n\r\n\r\n", "case_num = int(input())\r\nrooms = 0\r\n\r\nfor pair in range(case_num):\r\n current, total = [int(x) for x in input().split()]\r\n available = total - current\r\n \r\n if available >= 2:\r\n rooms += 1\r\n\r\nprint(rooms)", "n = int(input())\r\nrooms_with_space = 0\r\n\r\nfor i in range(n):\r\n p, q = map(int, input().split())\r\n if q - p >= 2: # Check if there is space for George and Alex (at least 2)\r\n rooms_with_space += 1\r\n\r\nprint(rooms_with_space)\r\n", "def room_space(n):\r\n c=0\r\n for i in range(n):\r\n room_habitants = input()\r\n room_habitants = list(map(int, room_habitants.split()))\r\n if room_habitants[1]-room_habitants[0]>=2:\r\n c+=1\r\n return c\r\nnum=int(input())\r\nprint(room_space(num))", "n = int(input())\r\n\r\np = []\r\nq = []\r\ncount = 0\r\nfor i in range(n):\r\n pq = input().split()\r\n p.append(int(pq[0]))\r\n q.append(int(pq[1]))\r\n if q[i] - p[i] >= 2:\r\n count = count + 1\r\nprint(count)\r\n", "k = 0\r\nn = int(input())\r\nfor i in range(n):\r\n a = list(map(int, str(input()).split()))\r\n if a[1] - a[0] >= 2:\r\n k += 1\r\nprint(k)", "a=int(input())\r\nl=[]\r\nfor i in range(a):\r\n d=list(map(int,input().split()))\r\n l.append(d)\r\ncount=0\r\nfor i in range(len(l)):\r\n if(l[i][1]-l[i][0]>=2):\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n p,q = [int(x) for x in input().split(\" \")]\r\n\r\n if (p+2) <= q:\r\n count += 1\r\n\r\nprint(count)\r\n", "a=int(input())\r\nprint(sum(eval(input().replace(' ','-'))<-1 for _ in ' '*a\r\n))", "def count_rooms_with_free_place(n, rooms):\r\n count = 0\r\n for room in rooms:\r\n p, q = room\r\n if q - p >= 2:\r\n count += 1\r\n return count\r\n\r\n# Input\r\nn = int(input())\r\nrooms = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Count rooms with free place for both George and Alex\r\nresult = count_rooms_with_free_place(n, rooms)\r\n\r\n# Output\r\nprint(result)\r\n", "n = int(input())\r\ncount=0\r\nfor i in range(n):\r\n p,q=input().split()\r\n if(int(q)-int(p)>=2):\r\n count+=1\r\nprint(count)\r\n", "def crf2( taken, capacity):\r\n canthey = None\r\n if capacity - taken >= 2:\r\n canthey = True\r\n else:\r\n canthey = False\r\n return canthey\r\ncount = 0\r\n\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n if crf2( a, b):\r\n count += 1\r\nprint(count)", "def count_rooms_with_free_space(n, rooms):\r\n count = 0\r\n for pi, qi in rooms:\r\n if qi - pi >= 2: # There is space for at least two more people\r\n count += 1\r\n return count\r\n\r\n# Input reading\r\nn = int(input())\r\nrooms = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Calculate and output the number of rooms with free space for both George and Alex\r\nresult = count_rooms_with_free_space(n, rooms)\r\nprint(result)\r\n", "n = int(input())\r\ncnt = 0\r\nwhile n:\r\n n-=1\r\n p,q = map(int,input().split())\r\n if q-p>=2:\r\n cnt+=1\r\nprint(cnt)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n pi,qi = list(map(int, input().split()))\r\n if qi-pi >= 2:\r\n ans += 1\r\n\r\nprint(ans)", "n = int(input())\ncan = 0\nfor i in range(n):\n p, q = list(map(int, input().split()))\n if p + 2 <= q:\n can += 1\n else:\n continue\nprint(can)", "n = int(input())\r\narr = []\r\notvet = 0\r\nfor i in range(n):\r\n arr.append([int(i) for i in input().split(\" \")])\r\nfor i in arr:\r\n if i[1]-i[0] >= 2:\r\n otvet+=1\r\nprint(otvet)", "n= int(input())\r\ns=0\r\nfor i in range(n):\r\n x,y= map(int,input().split())\r\n if (y-x)>= 2:\r\n s+=1\r\nprint(s)", "n = int(input())\r\ncnt = 0\r\nfor i in range (n):\r\n p,q = list(map(int, input().split()))\r\n if p <= q-2:\r\n cnt +=1\r\nprint(cnt)", "a = int(input())\r\nd=0\r\nfor i in range(a):\r\n b,c = map(int,input().split())\r\n if c - b >= 2 :\r\n d+=1\r\nprint(d)", "n=input()\nn=int(n)\nrooms=0\nfor i in range (n):\n p,q=input().split()\n p=int(p)\n q=int(q)\n if q-p>=2 :\n rooms=rooms+1\n\nprint(rooms)\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\nc1=0\r\nfor i in range(n):\r\n a,b = list(map(int,input().split()))\r\n if (a+2) <= b:\r\n c1+=1\r\nprint(c1)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n x+=1\r\n else:\r\n x+=0\r\nprint(x)", "number_of_rooms = int(input())\r\nnon_filled_rooms = 0\r\nfor rooms in range(number_of_rooms):\r\n number_of_people, room_capacity = map(int, input().split())\r\n if (room_capacity - number_of_people) >= 2:\r\n non_filled_rooms += 1\r\nprint(non_filled_rooms) ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 21 21:37:16 2023\r\n\r\n@author: 2300011413\r\n\"\"\"\r\n\r\nn=int(input())\r\nnum=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n num+=1\r\nprint(num)", "t=int(input())\r\nr=[tuple(map(int,input().split())) for i in range(t)]\r\nc=sum(1 for a,b in r if b-a>=2)\r\nprint(c)", "n= int(input())\r\nans= 0\r\nwhile(n):\r\n l= list(map(int, input().split()))\r\n if(l[0] <= l[1]-2): \r\n ans= ans+1\r\n n -= 1\r\n\r\nprint(ans)", "n=int(input())\r\ncounter=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if(b-a>=2):\r\n counter+=1\r\nprint(counter)\r\n", "rooms_num = int(input())\r\nrooms = []\r\navailabe = []\r\n\r\nfor i in range(rooms_num):\r\n rooms.append(list(map(int, input().split())))\r\n\r\nfor room in rooms:\r\n availabe.append(room[1]-room[0]) if room[1]-room[0] >= 2 else None\r\n\r\nprint(len(availabe))", "n = int(input())\r\ncount = 0 \r\nfor i in range(n): \r\n x, y = input().split(\" \")\r\n x = int(x); y= int(y)\r\n if (y - x >= 2): \r\n count += 1\r\nprint(count)", "n = int(input())\r\nc = 0\r\nfor i in range(n):\r\n p,q = list(map(int,input().split()))\r\n if(q-p>=2):\r\n c += 1 \r\nprint(c)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n\ta = [int(i) for i in input().split()]\r\n\tif a[1]-a[0] >= 2:\r\n\t\tcount += 1\r\nprint(count)", "# Read the number of rooms\r\nn = int(input())\r\n\r\n# Initialize a variable to count the number of rooms with free space for both George and Alex\r\ncount = 0\r\n\r\n# Iterate through the rooms and check if there is enough space for both George and Alex\r\nfor i in range(n):\r\n pi, qi = map(int, input().split())\r\n if qi - pi >= 2:\r\n count += 1\r\n\r\n# Print the count of rooms with free space for both George and Alex\r\nprint(count)\r\n\r\n", "n = int(input())\nnumberOfRooms = 0\nfor i in range(n):\n p,q = map(int,input().split())\n if(q-p >= 2):\n numberOfRooms += 1\n\nprint(numberOfRooms)\n\t\t \t\t \t \t \t\t \t \t\t\t\t \t \t", "n = int(input())\r\nx = 0\r\n\r\nfor i in range(n):\r\n r,a = map(int,input().split())\r\n c = a-r\r\n if c >= 2:\r\n x+=1\r\n else:\r\n pass\r\n\r\nprint(x)", "t = int(input())\r\nc = 0\r\nfor i in range(t):\r\n m,n = map(int,input().split())\r\n x = n-m\r\n if x!= 0 and x>=2:\r\n c+=1\r\nprint(c)", "rooms = int(input())\nfrooms = 0\n\nfor i in range(rooms):\n npeople , people = map(int,input().split())\n if people - npeople >= 2:\n frooms+=1\n \nprint(frooms)\n\t\t\t\t \t\t\t \t\t\t\t \t \t\t\t\t\t \t\t\t", "n = int(input()) # Input: The number of rooms\r\ncount = 0 # Initialize a counter for rooms where George and Alex can move in\r\n\r\nfor _ in range(n):\r\n pi, qi = map(int, input().split()) # Input: The number of people in the room and room's capacity\r\n if qi - pi >= 2:\r\n count += 1\r\n\r\nprint(count) # Output: The number of rooms where George and Alex can move in\r\n", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\n\ncount = 0\n\nfor _ in range(n):\n p, q = map(int, input().split())\n if q - p >= 2:\n count += 1\n\nsys.stdout.write(f\"{count}\")\n", "def main() :\r\n ROOM_INFOS = input_Room_Infos(input_Room_Info_Count())\r\n print(move_In_Room_Count(ROOM_INFOS))\r\n\r\n\r\ndef move_In_Room_Count(room_infos) :\r\n return sum(is_Move_In_Array(room_infos))\r\n\r\ndef is_Move_In_Array(room_infos) :\r\n return list(map(lambda room_info : room_info.IS_MOVE_IN, room_infos))\r\n\r\n\r\ndef input_Room_Info_Count() :\r\n return int(input())\r\n\r\ndef input_Room_Infos(count) :\r\n return [input_Room_Info() for _ in range(count)]\r\n\r\ndef input_Room_Info() :\r\n return Room_Info(*input_Array())\r\n\r\ndef input_Array() :\r\n return list(map(int, input().split()))\r\n\r\n\r\nclass Room_Info :\r\n def __init__(self, live_person_count, capacity) :\r\n self.LIVE_PERSON_COUNT = live_person_count\r\n self.CAPACITY = capacity\r\n\r\n @property\r\n def REMAIN_CAPACITY(self) :\r\n return self.CAPACITY - self.LIVE_PERSON_COUNT\r\n \r\n @property\r\n def IS_MOVE_IN(self) :\r\n return 2 <= self.REMAIN_CAPACITY\r\n\r\n\r\nmain()", "takes = int(input())\nroom = 0\nfor i in range(takes):\n b, c = map(int, input().split())\n if b+2 <= c:\n room+=1\n else:\n pass\nprint(room)\n \t \t \t \t \t \t\t\t\t \t\t \t \t\t", "def count_rooms_with_free_spot(n, room_info):\r\n count = 0\r\n for i in range(n):\r\n pi, qi = room_info[i]\r\n if qi - pi >= 2: \r\n count += 1\r\n return count\r\nn = int(input())\r\nroom_info = []\r\nfor _ in range(n):\r\n pi, qi = map(int, input().split())\r\n room_info.append((pi, qi))\r\nprint(count_rooms_with_free_spot(n, room_info))\r\n", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n pi, qi = map(int, input().split())\r\n s+=qi-pi>1\r\nprint(s)", "c=0\r\nfor _ in range(int(input())):\r\n n,m=map(int,input().split())\r\n a=abs(n-m)\r\n if a>=2:\r\n c=c+1\r\nprint(c)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n t=input().split()\r\n if int(t[1])-int(t[0]) >=2:\r\n s+=1\r\nprint(s)", "x=0\r\nn=int(input())\r\nfor i in range (n):\r\n l=list(map(int,input().split()))\r\n if (l[1]-l[0])>=2 :\r\n x+=1\r\nprint(x)", "a=int(input())\r\nk=0\r\nfor i in range(a):\r\n a,b=map(int,input().split())\r\n if a!=b and (b-a)//2>0:\r\n k+=1\r\nprint(k)\r\n", "n=input()\nn=int(n)\nr=0\nfor i in range(1,n+1):\n a,b=input().split()\n a=int(a)\n b=int(b)\n if((b-a)>=2):\n r+=1\nprint(r)\n\t \t\t\t \t\t\t\t \t \t \t\t \t \t \t", "n = input()\nn=int(n)\nc=0\nfor i in range(1 , n+1):\n p,q = input().split()\n p=int(p)\n q=int(q)\n if p+2<=q:\n c+=1\nprint(c)\n\t \t \t \t \t\t\t \t \t\t \t \t\t\t\t \t", "n = int(input())\r\nr_c = 0\r\nfor i in range(n):\r\n s = [int(i) for i in input().split()]\r\n if s[1] - s[0] >= 2:\r\n r_c +=1\r\nprint(r_c)", "n = int(input())\n\ncounter = 0\n\n\nfor i in range(n):\n\n pi, qi = map(int, input().split())\n\n if pi + 2 <= qi:\n\n counter += 1\n\n\nprint(counter)\n\t\t \t\t \t \t \t \t\t \t \t\t\t\t \t\t", "t=int(input())\r\nc=0\r\nfor _ in range(t):\r\n p,q=map(int,input().split())\r\n if((q-p)>=2):\r\n c=c+1\r\nprint(c)\r\n ", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(input().split())\r\n\r\nrn = 0\r\nfor j in range(n):\r\n if int(l[j][1]) - int(l[j][0]) >= 2:\r\n rn+=1\r\nprint(rn)\r\n", "accommodate = 0\r\nfor i in range(int(input())):\r\n p,q = map(int,input().split())\r\n if q-p >= 2:\r\n accommodate += 1\r\nprint(accommodate)\r\n ", "vezes = int(input(\"\"))\r\nif vezes > 100 or vezes < 1:\r\n exit(1)\r\nresultado=0\r\nfor i in range(vezes):\r\n pessoas, capacidade = map(int, input(\"\").split())\r\n if (capacidade-pessoas)>=2:\r\n resultado+=1\r\nprint(resultado)\r\n", "f = 0\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if x + 2 <= y:\r\n f += 1\r\nprint(f)\r\n", "y=int(input())\r\nn=[]\r\ns=0\r\nfor i in range(y):\r\n x=list(map(int,input().split(' ')))\r\n n.append(x)\r\n\r\nfor i in range(y):\r\n if n[i][1]-n[i][0] >1:\r\n s+=1\r\n else:\r\n continue \r\n\r\nprint(s)\r\n", "lst = []\r\nfree = 0\r\nfor i in range(int(input())):\r\n\tlst.append(input().split())\r\nfor i in lst:\r\n\tif int(i[1])-int(i[0])>=2:\r\n\t\tfree+=1\r\nprint(free)\r\n\r\n", "s = input()\r\nk = 0\r\nfor i in range(int(s)):\r\n n = input().split()\r\n p = int(n[0])\r\n q = int(n[1])\r\n if q - p >= 2:\r\n k += 1\r\n else:\r\n continue\r\nprint(k)\r\n", "n = int(input())\ncount = 0\nfor x in range(n):\n inside, able = [int(x) for x in input().split()]\n if able - inside >= 2:\n count += 1\n\nprint(count)", "n = int(input())\r\nc = 0\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n c += 1 if q - p >= 2 else 0\r\nprint(c)", "n = int(input())\r\nf = 0\r\nfor i in range(n):\r\n r = input().split()\r\n p = int(r[0])\r\n q = int(r[1])\r\n if (q-p) >= 2:\r\n f += 1\r\nprint(f)\r\n", "rooms = int(input())\r\npeople=[]\r\npossible_rooms = 0\r\nfor i in range(rooms):\r\n people.append(list(map(int,input().split())))\r\n if people[i][1] - people[i][0] >= 2:\r\n possible_rooms += 1\r\n\r\nprint(possible_rooms)", "print(sum(eval(input().replace(' ','-'))<-1for _ in ' '*int(input())))", "s=0\r\nfor i in range(int(input())):\r\n q,w=map(int,input().split())\r\n if w-q>1:\r\n s+=1\r\nprint(s)", "n=int(input())\r\nd=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n d+=1\r\nprint(d)\r\n", "n = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n if b - a >=2:\r\n cnt += 1\r\nprint(cnt) ", "num = int(input())\r\nposible = 0\r\nwhile num > 0:\r\n check = input().split(' ')\r\n persons = int(check[0])\r\n capitable = int(check[1])\r\n if capitable - persons >= 2:\r\n posible += 1\r\n num -= 1\r\nprint(posible)", "a = int(input(''))\r\ns = 0\r\nfor j in range(a):\r\n b = input('')\r\n if int(b.split()[1]) - int(b.split()[0]) < 2:\r\n s = s\r\n else:\r\n s = s + 1\r\n\r\nprint(s)\r\n \r\n", "n = int(input())\r\n\r\nx=0\r\n\r\nfor i in range(n):\r\n p, q = map(int, input().split())\r\n if (q-p)>=2:\r\n x+=1\r\n\r\nprint(x)", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n p, q = [int(i) for i in input().split()]\r\n if q - p >= 2:\r\n count += 1\r\n else:\r\n continue\r\nprint(count)", "from math import *\r\nn = int(input())\r\nans = 0\r\nfor i in range(0,n):\r\n p,q = map(int,input().split())\r\n if abs(q-p)>=2:\r\n ans+=1\r\nprint(ans)", "rooms = int(input())\r\n\r\ndef move(people, capacity):\r\n\tif capacity > 1:\r\n\t\tif (capacity - people) > 1:\r\n\t\t\treturn 1\r\n\treturn 0\r\n\r\nopen_rooms = 0\r\n\r\nfor r in range(rooms):\r\n\tp, c = [int(i) for i in input().split()]\r\n\topen_rooms += move(p,c)\r\n\r\nprint(open_rooms)", "# Read input\r\nn = int(input())\r\nrooms = []\r\n\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n rooms.append((p, q))\r\n\r\n# Count the number of rooms with free space for both George and Alex\r\ncount = sum(1 for p, q in rooms if q - p >= 2)\r\n\r\n# Print the result\r\nprint(count)\r\n", "count = 0;\r\nfor i in range(int(input())):\r\n p,q = map(int,input().split(\" \"))\r\n if (q-p >= 2):\r\n count+=1;\r\nprint(str(count))", "n = int(input())\ni = 0\nlista = []\ncap = 0\n\nwhile i < n:\n x = input().split(\" \")\n a,b=int(x[0]),int(x[1])\n lista.append(x)\n if(a <= b-2):\n cap += 1\n i +=1\nprint(cap)\n \t \t \t \t \t\t \t \t\t \t", "t=int(input())\r\ncount=0\r\nwhile(t>0):\r\n t=t-1\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n count=count+1\r\nprint(count)", "n=int(input())\r\nrooms=[]\r\nfor _ in range(n):\r\n p,q=map(int,input().split())\r\n rooms.append((p,q))\r\ncount=0\r\nfor room in rooms:\r\n p,q=room\r\n if q-p >= 2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nl = list()\r\ns = 0\r\nfor i in range(n):\r\n x = input()\r\n l = x.split()\r\n l[0], l[1] = int(l[0]), int(l[1])\r\n if l[1]-l[0] >= 2:\r\n s += 1\r\n\r\nprint(s)\r\n", "n = int(input())\r\nrooms_with_space = 0\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n\r\n if q - p >= 2:\r\n rooms_with_space += 1\r\nprint(rooms_with_space)\r\n", "n=int(input())\r\ncount=0\r\ni=0\r\nwhile i<n:\r\n ask=list(map(int,input().split()))\r\n if abs(ask[0]-ask[1])>=2:\r\n count+=1\r\n else:\r\n count=count\r\n i+=1\r\nprint(count)", "c=0\r\nn=int(input())\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if abs(b-a)>=2:\r\n c+=1\r\nprint(c)\r\n \r\n ", "# Read input\r\nn = int(input())\r\n\r\n# Initialize a variable to count the number of suitable rooms\r\ncount = 0\r\n\r\n# Iterate through the rooms\r\nfor _ in range(n):\r\n pi, qi = map(int, input().split())\r\n if qi - pi >= 2: # There should be at least 2 free places\r\n count += 1\r\n\r\n# Print the result\r\nprint(count)\r\n", "def room():\r\n n=int(input())\r\n a=[];b=[]\r\n for i in range(0,n):\r\n x,y=map(int,input().split())\r\n a.append(x)\r\n b.append(y);count=0\r\n for i in range(0,n):\r\n if b[i]-a[i]>=2:\r\n count+=1\r\n print(count)\r\n\r\nroom()", "from collections import Counter\r\n# def solve(N):\r\n# for i in range(4, N + 1):\r\n# if isLucky(i) and N % i == 0: return \"YES\"\r\n# return \"NO\"\r\n \r\n\r\nN = int(input())\r\ncnt = 0\r\nfor i in range(N):\r\n a,b = list(map(int, input().split()))\r\n if b - a > 1: cnt += 1\r\nprint(cnt)", "t=int(input())\r\nc=0\r\nfor i in range(t):\r\n (n,m)=map(int,input().split())\r\n if(m-n>=2):\r\n c=c+1\r\nprint(c)", "import sys\r\n\r\na = int(input(''))\r\nc = 0\r\nfor i in range(0, a):\r\n b = [int(j) for j in sys.stdin.readline().split()]\r\n if b[1] - b[0] >= 2:\r\n c += 1\r\nprint(c)", "\r\nn = int(input())\r\n\r\n\r\nrooms_count = 0\r\n\r\n\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n \r\n \r\n if q - p >= 2:\r\n rooms_count += 1\r\n\r\n\r\nprint(rooms_count)\r\n", "t=int(input())\r\nk=0\r\nwhile t>0:\r\n t-=1\r\n a,b=map(int,input().split())\r\n if b-a>1:\r\n k+=1\r\nprint(k)\r\n", "test_cases=int(input())\r\ncount=0\r\nfor _ in range(test_cases):\r\n x,y=map(int,input().split())\r\n if y-x>=2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nfor i in range(n) :\r\n inputs = input().split()\r\n p = int(inputs[0])\r\n q = int(inputs[1])\r\n if q-p >= 2 :\r\n count += 1\r\nprint(count)", "quantity_of_rooms = int(input())\nquantity_of_rooms_where_can_lay = 0\nfor i in range(quantity_of_rooms):\n live, max_to_live = map(int, input().split())\n if live + 2 <= max_to_live:\n quantity_of_rooms_where_can_lay += 1\n\nprint(quantity_of_rooms_where_can_lay)\n", "n=int(input())\r\nc=0\r\nfor _ in range(n):\r\n m,n=map(int,input().split())\r\n if n-m>=2:\r\n c+=1\r\nprint(c)\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if abs(q-p)>=2:\r\n count=count+1\r\nprint(count)\r\n\r\n\r\n \r\n\r\n", "T=int(input())\r\nc=0\r\nfor _ in range(T):\r\n \r\n a,b=map(int,input().split())\r\n if(b-a)>=2:\r\n c=c+1\r\nprint(c)\r\n\r\n ", "T = int(input())\r\nx = 0\r\nfor i in range(T):\r\n p,q = input().split()\r\n p = int(p)\r\n q = int(q)\r\n if p+2 <= q:\r\n x += 1\r\nprint(x)\r\n \t", "n = int(input())\r\nmatrix = [list(map(int, input().split())) for _ in range(n)]\r\ncnt=0\r\nfor i in range(n):\r\n if matrix[i][1] - matrix[i][0] >= 2:\r\n cnt+=1\r\nprint(cnt)", "n= 6\r\ngraph={}\r\nfor i in range(n):\r\n graph[i]=[]\r\nop=[[0,1],[0,2],[0,3],[0,4],[1,3],[2,3],[2,4],[2,5],[3,5]]\r\nfor (k,q) in op:\r\n graph[k].append(q)\r\n graph[q].append(k)\r\n \r\n# for i,v in graph.items():\r\n# print(i,\":\",v)\r\ndef dfs(graph,start,visited=set()):\r\n print(start)\r\n visited.add(start)\r\n for k in graph[start]:\r\n if k not in visited:\r\n dfs(graph,k,visited)\r\n# dfs(graph,5)\r\n\r\n# a=int(input())\r\n# b=list(map(int,input().split()))\r\n# for i in range(1,a+1):\r\n# print(b.index(i)+1,end=' ')\r\n\r\n# a=int(input())\r\n# b=\"I hate that\"\r\n# c=\"I love that\"\r\n# d=1\r\n# for i in range(a-1):\r\n# if d:\r\n# print(b,end=\" \")\r\n# d=0\r\n# else:\r\n# print(c,end=\" \")\r\n# d=1\r\n# if d:\r\n# print(\"I hate it\")\r\n# else:\r\n# print(\"I love it\")\r\n\r\nans=0\r\nfor _ in range(int(input())):\r\n b=list(map(int,input().split()))\r\n if b[1]-b[0]>=2:\r\n ans+=1\r\nprint(ans)", "t=int(input())\r\ncount=0\r\nfor i in range(t):\r\n a,b=list(map(int,input().split()))\r\n if b-a >=2 :\r\n count+=1\r\n\r\nprint(count)\r\n ", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n a,b = map(int,input().split(' '))\r\n if abs(a-b)>=2:\r\n count = count + 1\r\nprint(count)\r\n ", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n l=list(map(int, input().split()))\r\n if (l[1]-l[0])>=2:\r\n c=c+1\r\nprint(c)\r\n", "t = int(input())\r\ncou = 0\r\nfor i in range(t):\r\n a, b = map(int, input().split())\r\n if (b - a) >= 2:\r\n cou += 1\r\nprint(cou)", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n \r\n x = list(map(int, input().split(\" \")))\r\n \r\n if x[0] <= x[1]-2:\r\n # print(x[1])\r\n # print(x[1]+2)\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\r\nrooms = []\r\ni = 0\r\nfor y in range(n):\r\n x = input().split()\r\n rooms.append(x)\r\n\r\nfor x in range(len(rooms)):\r\n if int(rooms[x][1]) - int(rooms[x][0]) > 1:\r\n i += 1\r\n\r\n\r\nprint(i)\r\n", "def available_rooms(rooms):\r\n count = 0\r\n for r in rooms:\r\n if r[1] - r[0] >= 2:\r\n count += 1\r\n return count\r\n\r\nn = int(input())\r\nrooms = []\r\nfor i in range(n):\r\n rooms.append([int(item) for item in input().split()])\r\nprint(available_rooms(rooms))", "num=int(input())\r\n\r\ncount=0\r\n\r\nfor i in range (0,num):\r\n a,b=map(int,input().split())\r\n \r\n if (b-a)>=2:\r\n count=count+1\r\n \r\nprint(count)\r\n ", "\nn = int(input())\nans = 0\n\nfor i in range(n):\n a, b = map(int,input().split())\n \n if b-a >= 2:\n ans += 1\n \nprint(ans)\n\t \t \t\t\t\t \t\t \t \t \t\t \t\t", "n=int(input())\r\nresult=[]\r\nalist=[]\r\nfor i in range(n):\r\n x=input()\r\n alist=[int(f) for f in x.split()]\r\n if alist[1]-alist[0]>1:\r\n result.append(1)\r\nprint(len(result))", "a = int(input())\r\n\r\njm=0\r\n\r\nfor i in range(0,a):\r\n x1, x2= map(int,input().split())\r\n if(x2 - x1 >= 2):\r\n jm = jm + 1\r\nprint(jm)\r\n", "n = input()\nn = int(n)\nans=0\nfor i in range (n):\n a,b=input().split()\n a =int(a)\n b =int(b)\n if a+2<=b:\n ans+=1\nprint(ans)\n\t \t\t\t\t\t \t \t\t \t \t \t\t\t \t\t", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n res = [int(j) for j in input().split()]\r\n if res[-1] - res[0] >= 2:\r\n count += 1\r\nprint(count)\r\n\r\n", "count=0\r\nfor i in range(int(input())):\r\n p,q =map(int ,input().split())\r\n if(q-p>=2):count+=1\r\nprint(count)", "n = int(input())\r\nl = []\r\nct = 0\r\nfor i in range(n):\r\n input_line = input()\r\n values = input_line.split()\r\n numbers = [int(value) for value in values]\r\n l.append(numbers)\r\nfor i in range(len(l)):\r\n if l[i][0] + 2 <= l[i][1]:\r\n ct += 1\r\nprint(ct)\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(1,n+1):\r\n p,q=map(int,input().split())\r\n if p<q and q-p>=2:\r\n count=count+1\r\nprint(count)", "# Input the number of rooms\r\nn = int(input())\r\n\r\n# Initialize a variable to count the rooms with free space for both George and Alex\r\ncount = 0\r\n\r\n# Iterate through the rooms\r\nfor _ in range(n):\r\n pi, qi = map(int, input().split())\r\n \r\n # Check if there is enough free space for both George and Alex\r\n if qi - pi >= 2:\r\n count += 1\r\n\r\n# Print the count of rooms with free space\r\nprint(count)\r\n", "n1 = int(input())\r\nrooms_with_free_place = 0\r\n\r\nfor _ in range(n1):\r\n p1, q1 = map(int, input().split())\r\n \r\n if q1 - p1 >= 2:\r\n rooms_with_free_place += 1\r\n\r\nprint(rooms_with_free_place)\r\n", "c=0\r\nn=int(input())\r\nfor i in range(n):\r\n m,n=map(int,input().split())\r\n if n-m >= 2:\r\n c+=1\r\nprint(c)", "a=int(input())\r\nk=0\r\nfor i in range(a):\r\n a,b=map(int,input().split())\r\n c=b-a\r\n if c>=2:\r\n k+=1\r\nprint(k)", "\r\nans = 0\r\n\r\nfor _ in range(int(input())):\r\n f, s = map(int, input().split())\r\n if f + 2 <= s:\r\n ans += 1\r\nprint(ans)\r\n", "w = int(input())\r\ns = 0\r\nfor i in range(w):\r\n x = input().split(\" \")\r\n p = int(x[0])\r\n q = int(x[1])\r\n if q - p > 1:\r\n s += 1\r\nprint(s)", "roomNo = int(input())\r\nx = 0\r\nfor i in range(roomNo):\r\n room = input()\r\n room = list(map(int,room.split()))\r\n if (room[1] - room[0]) >=2:\r\n x += 1\r\nprint(x)", "n = int(input())\nc = 0\nfor _ in range(n):\n pi,qi = map(int,input().split())\n if qi - pi >= 2:\n c += 1\nprint(c)", "t = int(input())\r\ncount = 0\r\nfor i in range(t):\r\n a, b = map(int, input().split())\r\n if a<=b-2:\r\n count+=1\r\nprint(count)", "x=int(input())\r\nans=0\r\nfor a in range(x):\r\n y=list(map(int,input().split()))\r\n if y[0]+2<=y[1]:\r\n ans=ans+1\r\n y.clear()\r\nprint(ans)", "a, c = int(input()), 0\r\nfor i in range(a):\r\n b = [int(j) for j in input().split()]\r\n if (b[1] - b[0]) >= 2:\r\n c += 1\r\nprint(c)", "n=int(input())\r\nm=0\r\nfor i in range (n):\r\n info=input().split()\r\n p=int(info[0])\r\n q=int(info[1])\r\n if q-p>=2:\r\n m+=1\r\nprint(m)", "def count_rooms_with_space(n, rooms):\r\n count = 0\r\n for room in rooms:\r\n p, q = room\r\n if q - p >= 2: # There is enough space for both George and Alex\r\n count += 1\r\n return count\r\n\r\n# Read input\r\nn = int(input())\r\nrooms = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n# Calculate and print the number of rooms with enough space\r\nresult = count_rooms_with_space(n, rooms)\r\nprint(result)", "t=int(input())\r\na=0\r\nfor i in range(t):\r\n\tn,m=map(int,input().split())\r\n\tif m-n>=2:\r\n\t\ta+=1\r\nprint(a)", "n =int(input())\nans=0\nfor i in range(n):\n a,b=input().split()\n a=int(a)\n b=int(b)\n if a+2<=b:\n ans+=1\nprint(ans)\n \t\t\t\t \t\t\t \t \t \t \t\t\t \t", "t=int(input())\r\nc=0\r\nfor i in range(t):\r\n x,y=map(int,input().split())\r\n \r\n\r\n if y-x>=2:\r\n c+=1\r\n \r\nprint(c) ", "num=int(input())\r\nres=0\r\navailable=0\r\nfor i in range (num):\r\n numofpeople,capacity=map(int,input().split())\r\n res=capacity-numofpeople\r\n if res>=2:\r\n available+=1\r\nprint(available)", "n = int(input())\r\nnumberOfRooms = 0\r\nfor _ in range(n) :\r\n p , q = map(int,input().split(\" \"))\r\n if p <= q - 2 :\r\n numberOfRooms +=1\r\nprint(numberOfRooms)\r\n ", "n = int(input())\r\nc=0\r\nfor i in range(n):\r\n p,q= map(int,input().split())\r\n a = q-p \r\n if(a>=2):\r\n c+=1\r\nprint(c)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n j,k=map(int,input().split())\r\n if (k-j)>=2:\r\n s+=1\r\nprint(s) ", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n p,q = map(int,input().split())\r\n if q-p >= 2:\r\n s+=1\r\nprint(s)", "k=int(input())\r\nc=0\r\nfor _ in range(k):\r\n p,q=map(int,input().split())\r\n if p+2<=q:\r\n c=c+1\r\nprint(c)", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n a= [int(x) for x in input().split()]\r\n l.append(a)\r\nr = 0\r\nfor i in l:\r\n if (i[1] - i[0]) >= 2:\r\n r += 1\r\nprint(r)\r\n", "n=int(input())\r\nc=0\r\nwhile(n>0):\r\n p,q=input().split()\r\n \r\n p=int(p)\r\n q=int(q)\r\n if(q-p>=2):\r\n c=c+1\r\n n=n-1\r\nprint(c) \r\n ", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n tmp = input()\r\n p = int(tmp.split()[0])\r\n q = int(tmp.split()[1])\r\n if q - p >= 2:\r\n count += 1\r\nprint(count)", "total = 0\r\ncount = 0\r\nrooms = int(input())\r\nwhile count < rooms:\r\n info = list(map(int, input().split(\" \")))\r\n if (info[1]-info[0]) >= 2:\r\n total += 1\r\n count += 1\r\nprint(total)\r\n\r\n", "n = int(input())\r\ns = []\r\nc = 0\r\n\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nfor j in s:\r\n if int(j.split()[1]) - int(j.split()[0]) >= 2:\r\n c += 1\r\n\r\nprint(c)\r\n", "n=int(input())\r\nl=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n l+=1\r\nprint(l)\r\n \r\n", "n = int(input())\r\np=[]\r\nq=[]\r\ncount=0\r\nfor i in range(0,n):\r\n inp = input().split(\" \")\r\n p.append(int(inp[0]))\r\n q.append(int(inp[1]))\r\n if(q[i]-p[i]>1):\r\n count+=1\r\nprint(count)", "n=int(input())\r\noutput=0\r\nfor i in range(n):\r\n l=input().split()\r\n if int(l[0])<=(int(l[1])-2):\r\n output+=1\r\nprint(output)\r\n", "x = int(input())\r\nc = 0 \r\nfor i in range(x):\r\n \r\n y , z= map(int,input().split())\r\n \r\n if (z-y >= 2):\r\n c+=1\r\nprint(c)", "n=int(input())\r\nrooms=0\r\nfor i in range(n):\r\n res=0\r\n people,capacity=map(int,input().split())\r\n res=capacity-people\r\n if(res>=2):\r\n rooms+=1\r\nprint(rooms)\r\n ", "w=0\r\nfor i in range(int(input())):\r\n r,t=map(int,input().split())\r\n if t-r>=2:\r\n w+=1\r\nprint(w)", "# Read the number of rooms\r\nn = int(input())\r\n\r\n# Initialize a variable to count the rooms with free space for George and Alex\r\ncount = 0\r\n\r\n# Iterate through each room\r\nfor _ in range(n):\r\n # Read the number of people already living in the room and the room's capacity\r\n p, q = map(int, input().split())\r\n \r\n # Check if there is at least one spot available in the room\r\n if q - p >= 2:\r\n count += 1\r\n\r\n# Print the number of rooms with free space for George and Alex\r\nprint(count)\r\n\r\n\r\n\r\n", "# your code goes here\r\np=0\r\nfor _ in range(int(input())):\r\n\tn,c = map(int,input().split())\r\n\tif c-n>=2:\r\n\t\tp=p+1\r\nprint(p)", "n=int(input())\nroom=0\nfor i in range(n):\n a,b=input().split()\n a=int(a)\n b=int(b)\n if a+2<=b:\n room+=1\nprint(room)\n \t \t \t \t \t \t\t\t\t \t \t \t \t", "n=int(input())\ncount=0\nfor i in range(n):\n p,c=input().split()\n if int(c)-int(p)>=2:\n count+=1\nprint(count)", "c = 0\nfor t in range(int(input())):\n p,q = map(int,input().split())\n if q-p>=2:\n c += 1 \nprint(c)", "k = input()\r\ncount = 0\r\nfor c in range(int(k)):\r\n a = input()\r\n diff = 0\r\n n = \"\"\r\n h = \"\"\r\n num = 0\r\n while num < len(a) and a[num] != \" \":\r\n n = n + a[num]\r\n num = num + 1\r\n num = num + 1\r\n while num < len(a) and a[num] != \" \":\r\n h = h + a[num]\r\n num = num + 1\r\n diff = int(h) - int(n)\r\n if diff >= 2:\r\n count = count + 1\r\nprint(count)\r\n ", "a = int(input())\r\ng = 0\r\nwhile a>0:\r\n a-=1\r\n z,x = map(int,input().split())\r\n if (x-z) >=2:\r\n g+=1\r\nprint(g)", "n = input()\nn = int(n)\nrooms = 0\nfor i in range(n):\n p, q = input().split()\n p = int(p)\n q = int(q)\n if q-p >= 2:\n rooms = rooms + 1\n\nprint(rooms)\n\n\t \t \t \t\t\t\t \t\t \t \t\t \t\t \t\t\t \t", "rooms = int(input())\r\n\r\ngeorge_and_alex = 0\r\n\r\nfor x in range(rooms):\r\n p,q = map(int,input().split())\r\n if q - p >= 2:\r\n george_and_alex += 1\r\n \r\n\r\nprint(george_and_alex)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n if b - a >= 2:\r\n ans += 1 \r\nprint(ans)", "n = int(input())\r\nlp = []\r\nlq = []\r\ncount = 0\r\nfor i in range(0,n):\r\n a = input()\r\n lst = a.split(' ')\r\n lst = [int(s) for s in lst]\r\n p = lst[0]\r\n q = lst[1]\r\n lp.append(p)\r\n lq.append(q)\r\nfor i in range(0,n):\r\n if (lq[i]-lp[i]>=2) :\r\n count += 1\r\nprint(count)", "n=0\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n if abs(a-b) > 1:\r\n n +=1\r\nprint(n)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n a=input().split(\" \")\r\n p=int(a[0])\r\n q=int(a[1])\r\n if q-p>=2:\r\n count+=1\r\n else:\r\n count+=0\r\nprint(count)", "T = int(input())\r\ncount = 0\r\nfor i in range(T):\r\n n,m = map(int,input().split())\r\n if m - n >= 2:\r\n count += 1\r\nprint(count)", "# Read the number of rooms\nn = int(input())\n\n# Initialize the count of rooms with free space\ncount = 0\n\n# Iterate through the rooms\nfor _ in range(n):\n # Read the number of people living in the room and the room's capacity\n p, q = map(int, input().split())\n \n # Check if there is free space for both George and Alex\n if q - p >= 2:\n count += 1\n\n# Print the number of rooms where George and Alex can move in\nprint(count)\n\n \t \t\t\t \t\t\t \t \t\t\t\t \t", "x=int(input())\r\ncount=0\r\nfor i in range(x):\r\n a,b=map(int,input().split())\r\n if(a+2<b):\r\n count=count+1\r\n elif(a+2==b):\r\n count=count+1\r\nprint(count)", "x=0\r\nfor _ in range(int(input())):\r\n s=input().split()\r\n p,q=int(s[0]),int(s[1])\r\n if(q-p>1):\r\n x=x+1\r\nprint(x)\r\n", "n=input()\nn = int(n)\n\nroom = 0\n\nfor i in range(n):\n p, q = input().split()\n p = int(p)\n q = int(q)\n if q-p >= 2:\n room = room + 1\n\nprint(room)\n\n \t \t\t\t\t\t\t \t \t \t\t \t \t \t", "n = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n p,q = map(int,input().split())\r\n if p < q - 1:\r\n count += 1\r\nprint(count)\r\n", "# There are n number of rooms in a building.\r\n# Each room has some number of people in it.\r\n# But every room has some space for at least 1 more person.\r\n# Find the number of rooms that can house at minimum 2 additional guests.\r\n\r\n# input1 = the number of rooms available.\r\n# Every other input contains two numbers.\r\n# The first number is the number of people who live in the room.\r\n# The second number is the room's capacity.\r\n\r\ninput1 = input() # number of rooms to look through.\r\nnRooms = int(input1) # converted into number.\r\nroomsAvailable = 0 # counter to keep track of rooms available.\r\n\r\nfor n in range(nRooms):\r\n inputPQ = input().split()\r\n occupants = int(inputPQ[0])\r\n capacity = int(inputPQ[1])\r\n\r\n if capacity - occupants >= 2: # if room meets conditions...\r\n roomsAvailable += 1 # add 1 to available rooms\r\n\r\noutput = roomsAvailable # set available rooms to output\r\nprint(output) # print output.\r\n", "n = int(input())\r\navailable = 0\r\nfor _ in range(n):\r\n already, capacity = map(int, input().split())\r\n available = available + 1 if capacity - already >= 2 else available\r\nprint(available)", "import sys\r\n\r\nn = int(sys.stdin.readline().split()[0])\r\nrooms = [[0 for x in range(2)] for y in range(n)]\r\nrow = 0\r\n\r\nfor line in sys.stdin:\r\n column = 0\r\n for word in line.split():\r\n rooms[row][column] = int(word)\r\n column += 1\r\n row += 1\r\n\r\nrooms_acceptable = 0\r\n\r\nfor room in rooms:\r\n if room[0] + 2 <= room[1]:\r\n rooms_acceptable += 1\r\n\r\nprint(rooms_acceptable)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n p, q = list(map(int,input().split()))\r\n if q-p>=2:\r\n count += 1\r\nprint(count)", "#initializes number of rooms and free rooms\r\nrooms = int(input())\r\nfreeRooms = 0\r\n\r\n#checks how many free rooms there are\r\nfor room in range(rooms):\r\n current, max = input().split(' ')\r\n if int(max) - int(current) >= 2:\r\n freeRooms += 1\r\n\r\n#prints result\r\nprint(freeRooms)", "x=int(input(\"\"))\r\nl=[]\r\nc=0\r\nfor i in range(x):\r\n y=input(\"\")\r\n t=y.split(\" \")\r\n l.append(t)\r\nfor j in l:\r\n if int(j[1])-int(j[0])>=2:\r\n c+=1\r\nprint(c)", "# George and Accommodation\r\nhabitaciones_disponibles = 0\r\nfor _ in range(int(input())):\r\n datos = [int(x) for x in input().split(' ')]\r\n if datos[0] + 2 <= datos[1]:\r\n habitaciones_disponibles += 1\r\nprint(habitaciones_disponibles)\r\n", "n = int(input())\n\ncounter = 0\nfor e in range(n):\n p,q = [int(x) for x in input().split()]\n if q-p>=2:\n counter+=1\n\nprint(counter)\n", "n = int(input())\nh = 0\nfor i in range(1, n + 1):\n p, q = input().split()\n p = int(p)\n q = int(q)\n if p <= q - 2:\n h += 1\nprint(h)\n \n\t\t\t \t\t \t\t\t\t\t \t\t \t\t\t\t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Aug 31 08:25:39 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\nroom=int(input())\r\ncounter=0\r\nfor i in range(room):\r\n data=input().split()\r\n if int(data[1])-int(data[0])>=2:\r\n counter+=1\r\nprint(counter)", "def rooms(liste):\r\n res=0\r\n for i in range(len(liste)):\r\n if(int(liste[i][1])-int(liste[i][0])>=2):\r\n res=res+1\r\n return res\r\n\r\nn=int(input())\r\nentrer=[]\r\nfor j in range(n):\r\n tnr=input()\r\n tnr=tnr.split()\r\n entrer.append(tnr)\r\nprint(rooms(entrer))\r\n", "n=int(input())\r\npeople=[]\r\nmaxpeo=[]\r\nrooms=0\r\nfor i in range(0,n):\r\n arr=list(map(int,input().split()))\r\n people.append(arr[0])\r\n maxpeo.append(arr[1])\r\nfor j in range(0,n):\r\n if (int(maxpeo[j])-int(people[j]))>1:\r\n rooms=rooms+1\r\nprint(rooms)", "def room():\r\n n_room = int(input())\r\n people_room_capacity = []\r\n for i in range(n_room):\r\n p_r = input().split()\r\n people_room_capacity.append(int(p_r[0]) - int(p_r[1]))\r\n \r\n counter = 0\r\n for x in people_room_capacity:\r\n if x <= -2:\r\n counter += 1\r\n return counter\r\n \r\nprint(room())", "t = int(input())\r\ncount = 0\r\nfor i in range(t):\r\n low, high = map(int, input().split())\r\n if high - low >= 2:\r\n count += 1\r\nprint(count)", "n = int(input())\r\navailable_rooms = 0\r\nfor _ in range(0,n) :\r\n room_status = input().split(' ')\r\n if (int(room_status[1]) - int(room_status[0])) >= 2 :\r\n available_rooms +=1 \r\nprint(available_rooms)", "c =0 \r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n if (b-a)>=2:\r\n c+=1\r\nprint(c)\r\n", "def main():\r\n \r\n num_cases = int(input()) # Number of cases\r\n \r\n count = 0 # Initialize a counter for valid cases\r\n\r\n\r\n for _ in range(num_cases):\r\n \r\n start_time, end_time = map(int, input().split()) # Get start and end times for a case\r\n \r\n if end_time - start_time >= 2: # Check if the time difference is at least 2 hours\r\n \r\n count += 1 # Increment the counter for valid cases\r\n\r\n print(count) # Print the total number of valid cases\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "t=int(input())\r\ncount=0\r\nwhile t>0:\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n count+=1\r\n t-=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nfor i in range(0, n):\r\n s = list(map(int, input().split()))\r\n if s[0]+2 <= s[1]:\r\n count += 1\r\nprint(count)\r\n", "def count_rooms_with_free_place(n, rooms):\r\n count = 0\r\n for i in range(n):\r\n p_i, q_i = rooms[i]\r\n if q_i - p_i >= 2:\r\n count += 1\r\n return count\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n rooms = []\r\n for _ in range(n):\r\n p_i, q_i = map(int, input().split())\r\n rooms.append((p_i, q_i))\r\n result = count_rooms_with_free_place(n, rooms)\r\n print(result)", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if b-a>=2:\r\n s +=1\r\nprint(s)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n ans += 1 if y - x >= 2 else 0\r\nprint(ans)", "x=0\nn=int(input())\nfor i in range(0,n):\n a,b=input().split( )\n if ((int(b)-int(a)>=2)):\n x+=1\nprint(x) \n \t \t \t \t \t\t\t", "N = int(input())\r\nc = 0\r\nfor _ in range(N):\r\n P, Q = map(int, input().split())\r\n if Q - P >= 2:\r\n c += 1\r\nprint(c)", "def count_free_rooms(n, rooms):\r\n count = 0\r\n for room in rooms:\r\n p, q = room\r\n if p < q - 1:\r\n count += 1\r\n return count\r\nn = int(input())\r\nrooms = []\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n rooms.append((p, q))\r\nfree_rooms = count_free_rooms(n, rooms)\r\nprint(free_rooms)\r\n", "n = input()\nn = int(n)\nx = 0\nfor i in range(n):\n a , b = input().split()\n a = int(a)\n b = int(b)\n if (b - a)>=2:\n x += 1\nprint(x)\n\n\t\t \t \t\t\t \t\t \t\t\t\t \t\t\t", "n = int(input())\r\nf = 0\r\nfor i in range(n):\r\n p, q = map(int, input().split(' '))\r\n if (q - p) >= 2:\r\n f += 1\r\n\r\nprint(f)\r\n", "\r\nn = int(input()) \r\n\r\nroom_list = []\r\n\r\nfor i in range(n):\r\n r_capasty, f_capasty = list(map(int, input().split()))\r\n room_list.append([r_capasty, f_capasty])\r\n\r\nfriens_room = 0\r\n\r\nfor j in room_list:\r\n if j[1] - j[0] >= 2:\r\n friens_room += 1\r\n else:\r\n friens_room = friens_room\r\n \r\nprint(friens_room)", "a=0\r\nn=int(input())\r\nfor i in range(1,n+1):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n a+=1\r\nprint(a)\r\n", "n = int(input())\nsum = 0\nfor i in range(n):\n p,q = list(map(int,input().split()))\n if q-p-2 >= 0:\n sum = sum + 1\nprint(sum)\n", "result=0\r\nfor i in range(0,int(input())):\r\n\tcase=input()\r\n\tcaseLst=list(map(int,case.split()))\r\n\tif(caseLst[1]-caseLst[0]>=2):\r\n\t\tresult+=1\r\nprint(result)", "t=int(input())\r\nc=0\r\nwhile(t>0):\r\n p,q=map(int,input().split())\r\n if(q-p>=2):\r\n c+=1\r\n t-=1\r\nprint(c)\r\n", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a+2<=b:\r\n k+=1\r\nprint(k)", "n = int(input())\r\nc = 0\r\n\r\nfor _ in range(n):\r\n p1, q1 = map(int, input().split())\r\n if q1 - p1 >= 2 or (q1 >= 2 and p1 == 0):\r\n c += 1\r\n\r\nprint(c)", "n=int(input())\r\n#lst=list(map(int,input().split()))\r\nf=0\r\nfor i in range(n):\r\n n,m=map(int,input().split())\r\n if n<m and m-n>=2:\r\n f+=1\r\nprint(f)", "k = int(input())\na = 0\nfor i in range(k):\n p,q = map(int, input().split())\n if q-p>= 2:\n a+=1\n \nprint(a)\n\t\t\t\t\t \t \t\t \t \t\t\t\t\t \t \t \t \t", "a=int(input())\r\nc=0\r\nfor i in range(a):\r\n a,b=map(int,input().split())\r\n if (b-2)>=a:\r\n c+=1\r\nprint(c)\r\n", "num = int(input())\r\ncount = 0\r\nfor i in range(num):\r\n num1,num2 = map(int,input().split())\r\n if(num1+2 <= num2):\r\n count +=1\r\nprint(count) ", "n = int(input())\r\ncount = 0\r\nfor i in range(0,n):\r\n dump = input(\"\").split()\r\n if int(dump[1]) - int(dump[0]) >= 2:\r\n count = count+1\r\nprint(count)", "rooms = int(input())\r\ncount_rooms = 0\r\nfor i in range(rooms):\r\n count_people, max_people = map(int, input().split())\r\n if max_people - count_people >= 2:\r\n count_rooms += 1\r\nprint(count_rooms)\r\n\r\n", "count = 0\r\nfor i in range(int(input())):\r\n p,q = list(map(int,input().split()))\r\n if q>p+1:\r\n count+=1\r\nprint(count)\r\n ", "t = int(input())\r\ncount = 0\r\nfor i in range(t):\r\n p,q = map(int,input().split())\r\n if p == q:\r\n count += 0\r\n else:\r\n if q-p >= 2:\r\n count +=1\r\nprint(count)", "x = int(input())\r\nc = 0\r\n\r\nfor _ in range(x):\r\n a, b = map(int, input().split())\r\n if b - a >= 2:\r\n c += 1\r\n\r\nprint(c)\r\n", "n = int(input())\nf = 0\n\nfor i in range(n):\n num_people , capcity_people = map(int,input().split())\n if capcity_people - num_people >= 2:\n f+=1\n \nprint(f)\n\t\t\t \t \t\t \t \t\t \t \t\t \t\t\t", "n = int(input())\nl = []\n\nfor x in range(n):\n t = input()\n t = t.split()\n t = [int(s) for s in t]\n l.append(t)\n \nresult = [x[1]-x[0] for x in l]\ncount = [x for x in result if x>=2]\ncount = len(count)\nprint(count)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n s = input().split()\r\n for i in range(len(s)):\r\n s[i] = int(s[i])\r\n if s[0]+2<=s[1]:\r\n count+=1\r\nprint(count)", "N=int(input())\r\ncount=0\r\nwhile(N!=0):\r\n P,Q=map(int,input().split())\r\n if Q-P>=2:\r\n count=count+1\r\n N=N-1\r\nif count==0:\r\n print(\"0\")\r\nelse:\r\n print(count)\r\n \r\n ", "rooms = int(input())\r\ncounter = 0\r\nfor i in range(rooms):\r\n pi , qi = map(int , input().split())\r\n if pi <= (qi-2):\r\n counter += 1\r\nprint(counter)", "rooms = int(input())\r\ncount = 0\r\nfor _ in range(rooms):\r\n l,a = map(int,input().split())\r\n if a - l >= 2:\r\n count += 1\r\nprint(count)", "a = int(input())\r\n\r\nans = 0\r\nfor i in range(a):\r\n pi, qi = map(int,input().split(\" \"))\r\n if qi-pi >= 2:\r\n ans = ans+1\r\nprint(ans)", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n acc = [int(num) for num in input().split()]\r\n if (acc[1] - acc[0] >= 2):\r\n count += 1\r\n\r\nprint(count)", "count = 0\r\n\r\nfor i in range(int(input())):\r\n p, q = [int(x) for x in input().split()]\r\n if q-p >= 2:\r\n count += 1\r\n\r\nprint(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Oct 1 20:49:06 2023\r\n\r\n@author: user\r\n\"\"\"\r\nn=int(input())\r\ns=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n s+=1\r\nprint(s)", "import sys\r\n\r\nn = int(input())\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n p,q = map(int,input().split())\r\n if(q-p)>=2:\r\n cnt += 1\r\n\r\nprint(cnt) ", "count_rooms = int(input())\r\ngood_rooms = 0\r\nfor i in range(count_rooms):\r\n people, space = map(int, input().split())\r\n if space - (people + 2) >= 0:\r\n good_rooms += 1\r\nprint(good_rooms)\r\n\r\n\r\n\r\n\r\n \r\n\r\n", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n s,r=map(int,input().split())\r\n d=r-s\r\n if(d>=2):\r\n c=c+1\r\nprint(c)\r\n", "print(sum([(lambda x, y: y - x >= 2)(*map(int, input().split())) for _ in range(int(input()))]))", "counter=0\r\nfor i in range(int(input())):\r\n room=list(map(int,input().split()))\r\n if (room[1]-room[0])>=2:\r\n counter+=1\r\nprint(counter) ", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n a=list(map(int, input().split()))\r\n if a[1]-a[0] >= 2:\r\n c+=1\r\nprint(c)", "def jud(room):\r\n if int(room[1]) - int(room[0]) >= 2:\r\n return 1\r\n else:\r\n return 0\r\n\r\nnum = int(input())\r\ncurrent_number = 0\r\nresult = 0\r\nwhile current_number < num:\r\n room = input().split()\r\n result += jud(room)\r\n current_number += 1\r\nprint(result)", "n=input()\n\nn=int(n)\n\nsum=0\nfor i in range(0,n,1):\n p,q=input().split()\n p=int(p)\n q=int(q)\n if q-p>=2:\n sum+=1\n\nprint(sum)\n \t\t\t \t\t \t \t\t \t\t \t\t\t\t\t", "n=int(input())\ncnt=0\nfor i in range(n):\n p, q=input().split()\n p=int(p)\n q=int(q)\n if(q-p)>=2:\n cnt+=1\nprint(cnt)\n\t \t\t \t\t \t\t \t\t \t\t\t\t \t\t\t \t\t\t\t \t", "x=int(input())\r\ncount=0\r\nfor i in range (x):\r\n p,q=list(map(int,input().split()))\r\n if((q-p)>=2):\r\n count+=1\r\nprint(count) ", "n = int(input())\r\n\r\nfree = []\r\nacco = []\r\n\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n free.append(a)\r\n acco.append(b)\r\n\r\ncount = 0 \r\nfor i in range(n):\r\n if acco[i] - free[i] >= 2:\r\n count += 1\r\nprint(count)", "n = int(input())\nCnt= 0\nfor i in range(n): #0 ~ 2 input 3 rooms\n p, q =input().split()\n p = int(p)\n q = int(q)\n if(q-p) >= 2:\n Cnt += 1\nprint (Cnt)\n#khattab\n\n\t\t \t\t \t\t \t \t\t\t\t\t\t \t\t \t \t\t \t", "c=0\r\nfor i in range(int(input())):\r\n n,m=map(int,input().split())\r\n if m-n>=2:\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = 0\r\nfor i in range(0,n):\r\n p = [int(x) for x in input().split(\" \")]\r\n if p[1] >= p[0]+2:\r\n a += 1\r\nprint(a)", "n = int(input())\r\ncount = 0\r\nfor i in range(n) : \r\n p , q =map(int ,input().split())\r\n if (q - p) >=2 :\r\n count+=1\r\nprint(count) ", "z = int(input())\r\na = []\r\nn = ''\r\nm = []\r\nfor i in range(z):\r\n\tx,y = map(int , input().split(' '))\r\n\td = y - x\r\n\ta.append(d)\r\nl = 0\r\nfor j in a:\r\n\tif (j>=2):\r\n\t\tl += 1\r\n\r\nprint (l)", "flats = int(input())\r\nquantity = 0\r\nfor i in range(flats):\r\n a, b = map(int, input().split())\r\n if b - a >= 2:\r\n quantity += 1\r\n\r\nprint(quantity)\r\n", "x = int(input())\r\nc = 0\r\nfor i in range(x):\r\n a,b = map(int, input().split())\r\n if a+2 <= b:\r\n c +=1\r\nprint(c)", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n\r\n if y-x>=2:\r\n c=c+1\r\n\r\nprint(c)\r\n\r\n ", "n=int(input())\r\ncount=0\r\nfor _ in range(n):\r\n occ,maxi=map(int,input().split())\r\n if occ<=maxi-2: count+=1\r\nprint(count)", "def isaccommodate(p,q):\r\n counter = 0\r\n if q - p >= 2:\r\n counter += 1\r\n else:\r\n pass\r\n return counter\r\n\r\nn = int(input())\r\nnum = 0\r\nfor _ in range(n):\r\n p,q = map(int, input().split())\r\n num += isaccommodate(p,q)\r\n\r\nprint(num)", "a=int(input())\r\nb=0\r\nc=0\r\nwhile b<a:\r\n d=input().split()\r\n if int(d[1])-int(d[0])>=2:\r\n c+=1\r\n b+=1\r\nprint(c)", "n=int(input(\"\"))\r\nsumm = 0\r\nfor i in range(n):\r\n q,m = list(map(int, input().split()))\r\n if m-q >= 2 :\r\n summ=summ + 1\r\nprint(summ)", "q=int(input())\r\nprint(sum(eval(input().replace(' ','-'))<-1 for _ in ' '*q))", "n = input()\nn = int(n)\nans=0\nfor i in range(n):\n a, b = input().split()\n a = int(a)\n b = int(b)\n if a+2<=b:\n ans+=1\nprint(ans)\n\n \t \t \t\t \t \t\t \t \t\t\t\t\t\t\t \t \t", "rooms = int(input())\r\navailable_room = 0\r\n\r\nfor x in range(rooms):\r\n already, capacity = map(int, input().split())\r\n\r\n if (capacity - already) >= 2:\r\n available_room += 1\r\n\r\nprint(available_room)\r\n\r\n", "n = int(input())\r\n\r\ncounter = 0\r\nfor i in range(n):\r\n people, capacity = map(int, input().split())\r\n if (capacity - people) >= 2:\r\n counter += 1\r\nprint(counter)\r\n", "n=int(input())\r\nt=0\r\nfor i in range(n):\r\n s=input().split()\r\n p,q=int(s[0]),int(s[1])\r\n if q-p>=2:\r\n t+=1\r\n else:\r\n continue\r\nprint(t)", "s=int(input())\r\nc=0\r\nfor i in range(s):\r\n p,q=map(int,input().split())\r\n n=q-p\r\n\r\n if n>=2:\r\n c+=1\r\nprint(c)", "Rooms = int(input())\r\nAvailableRooms = 0\r\n\r\nfor i in range(Rooms):\r\n People, Capacity = input().split(\" \")\r\n\r\n if int(Capacity) - int(People) >= 2:\r\n AvailableRooms += 1\r\n\r\nprint(AvailableRooms)\r\n", "n = int(input())\r\n\r\nm = []\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n m.append([a, b])\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if m[i][1] - m[i][0] >= 2:\r\n count += 1\r\n\r\nprint(count)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n a,b=[int(i) for i in input().split()]\r\n if (b-a)>=2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\n\r\nfor _ in range(n):\r\n p,q=list(map(int,input().split()))\r\n if abs(q-p)>=2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n a, b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n if (b - a) >= 2:\r\n count += 1\r\n else:\r\n pass\r\nprint(count)", "\r\nt = int(input())\r\nres = 0\r\nfor i in range(t):\r\n n , k = map(int,input().split())\r\n if k - n >= 2:\r\n res += 1\r\nprint(res)\r\n \r\n \r\n", "Rooms = int(input())\nAvailable_Rooms = 0\n\nfor i in range(Rooms):\n ppl , Capacity_ppl = map(int,input().split())\n if Capacity_ppl - ppl >= 2:\n Available_Rooms+=1\n \nprint(Available_Rooms)\n \t \t \t\t\t\t \t \t\t\t \t \t\t \t\t\t\t", "t=int(input())\r\nc=0\r\nfor _ in range(t):\r\n l=list(map(int,input().split()))\r\n if l[0] < l[1] - 1:\r\n c+=1\r\nprint(c)", "x=int(input())\r\nc=0\r\nfor i in range(x):\r\n w,v=map(int,input().split(' '))\r\n if v-w>=2:c+=1\r\nprint(c)", "n = int(input())\r\ncount = 0 \r\nfor i in range(0,n):\r\n p,q = map(int,input().split())\r\n if(q-p) >=2:\r\n count +=1 \r\nprint(count) ", "g = 0\r\nfor _ in range(int(input())):\r\n\ta,m = map(int,input().split())\r\n\tif (m-a)>=2:\r\n\t\tg+=1\r\nprint(g)\r\n ", "c=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n c=c+1 if (b-a)>=2 else c+0\r\nprint(c)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n p,q = list(map(int, input().split()))\r\n if q-p >= 2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nl = []\r\nc = 0\r\nfor i in range(n):\r\n l.append(list(map(int, input().split())))\r\nfor i in l:\r\n if (i[1] > i[0]) and (i[1] - i[0] > 1):\r\n c += 1\r\nprint(c) ", "# for _ in range(int(input())):\r\nn = int(input())\r\ncount =0\r\nfor i in range(n):\r\n t1,t2 = [int(x) for x in input().split()]\r\n if t2-t1>=2:\r\n count+=1\r\nprint(count)", "num_rooms = int(input())\r\n\r\nempty = 0\r\nfor i in range(num_rooms):\r\n p, q = list(map(int, input().split()))\r\n if q-p >= 2:\r\n empty += 1\r\n\r\nprint(empty)", "n = int(input())\nans = 0\nfor i in range(n): # 0 1 2\n p, q = input().split()\n p = int(p)\n q = int(q)\n if (q-p) >= 2:\n ans += 1\nprint(ans)\n\n \t \t \t\t\t\t \t \t\t\t\t \t \t\t", "a=input()\na=int(a)\nroom=0\nfor i in range(1,a+1):\n p,q=input().split()\n p=int(p)\n q=int(q)\n if q-p >=2:\n room=room+1\nprint(room)\n\t \t\t\t \t \t \t \t \t\t\t \t\t \t \t", "import sys\r\nline1 = int(sys.stdin.readline().strip())\r\ncounter = 0\r\nfor i in range(line1):\r\n line = sys.stdin.readline().strip().split()\r\n if int(line[1]) - int(line[0]) >= 2:\r\n counter += 1\r\nprint(counter)", "n = int(input())\r\nc=0\r\nfor i in range(0,n):\r\n v =list(map(int,input().split()))\r\n if(v[1]-v[0])>=2:\r\n c=c+1\r\nprint(c)", "n= input()\nn= int(n)\nx=0\nfor i in range(1,n+1):\n a,b= input().split()\n a= int(a)\n b= int(b)\n if((b-a)>=2):\n x+=1\nprint(x)\n \t \t \t\t \t \t \t\t\t\t\t \t \t\t \t", "# Read the number of rooms\r\nn = int(input())\r\n\r\n# Initialize a variable to count the rooms with enough free space for George and Alex\r\ncount = 0\r\n\r\n# Iterate through each room\r\nfor i in range(n):\r\n # Read the number of people in the room and the room's capacity\r\n pi, qi = map(int, input().split())\r\n \r\n # Check if there is enough free space for both George and Alex (at least 2)\r\n if qi - pi >= 2:\r\n count += 1\r\n\r\n# Print the number of rooms with enough free space\r\nprint(count)\r\n", "room = 0\nn = int(input())\nfor i in range (1 , n+1):\n p,q = input().split()\n p = int(p)\n q = int(q)\n if q - p > 1:\n room +=1\nprint(room)\n \t \t \t \t \t \t\t \t\t \t\t\t\t \t \t", "# Input\r\nn = int(input())\r\nrooms = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n# Count the number of rooms with free space for both George and Alex\r\ncount = sum(1 for room in rooms if room[1] - room[0] >= 2)\r\n\r\n# Output\r\nprint(count)", "n=int(input())\r\ndor=[]\r\ncount=0\r\nfor i in range(0,n):\r\n a,b=map(int,input().split())\r\n if (b-a) >= 2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n p,q = map(int,input().split())\r\n if q-p >=2:\r\n k+=1\r\n \r\n \r\nprint(k)\r\n ", "n=int(input())\r\ncount=0\r\nfor i in range(0,n):\r\n p,q=map(int,input().split())\r\n m=q-p\r\n if m>=2:\r\n count+=1\r\n else:\r\n count+=0\r\nprint(count)\r\n", "m=h=z=0\r\ne=int(input())\r\nfor i in range(e):\r\n\tm,h=map(int,input().split())\r\n\tif h-m>1:z+=1\r\nprint(z)", "t = int(input())\r\nctr = 0\r\n\r\nwhile t:\r\n s = input().split()\r\n if (int(s[1]) - int(s[0])) >= 2:\r\n ctr += 1\r\n \r\n t -= 1\r\n\r\nprint(ctr)", "n=int(input())\r\na=2\r\nb=0\r\nfor i in range(0,n):\r\n m,g=map(int,input().split())\r\n if m<g:\r\n if m+a<=g:\r\n b+=1\r\nprint(b)\r\n", "t = int(input())\r\nn =0\r\nfor i in range(t):\r\n x, y = input().split()\r\n x = int(x)\r\n y = int(y)\r\n if x - y <= -2 :\r\n n += 1\r\nprint(n)", "n=input()\nn=int(n)\nx=0\nfor i in range(1,n+1):\n A,B=input().split()\n A=int(A)\n B=int(B)\n if((B-A)>=2):\n x=x+1\nprint(x)\n \t\t\t\t \t\t \t\t\t\t \t\t\t\t \t\t\t", "t=int(input())\r\ncount=0\r\nfor _ in range(t):\r\n n,p=map(int,input().split())\r\n if p-n >=2:\r\n count=count+1\r\nprint(count) ", "# Read the number of rooms\r\nn = int(input())\r\n\r\n# Initialize a variable to count the number of rooms available for George and Alex\r\ncount = 0\r\n\r\n# Iterate through the rooms\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n \r\n # Check if there's enough space for both George and Alex\r\n if q - p >= 2:\r\n count += 1\r\n\r\n# Print the number of rooms available\r\nprint(count)\r\n", "number = int(input())\r\ncount = 0\r\nfor i in range(number):\r\n elements = [int(el) for el in input().split(\" \")]\r\n if elements[1] - elements[0] >= 2:\r\n count += 1\r\nprint(count)", "\n\nn = int(input())\n\nok = 0\nfor x in range(n):\n p, q = list( map(int, input().split(' ')) )\n if p + 2 <= q:\n ok += 1\nprint(ok)\n", "q=int(input())\r\nct=0\r\nfor _ in range(q):\r\n a,s=map(int,input().split())\r\n if((s-a)>=2):\r\n ct+=1\r\nprint(ct)", "c = 0\r\nfor i in range(int(input())):\r\n\r\n a,b = map(int,input().split())\r\n if b - a >= 2:\r\n c+= 1\r\nprint(c)", "chir = int(input())\r\nMeS = 0\r\nfor fz in range(chir):\r\n abc,bca = list(map(int,input().split()))\r\n if abs(abc-bca) >= 2:\r\n MeS+=1\r\nprint(MeS)", "n = int(input())\r\nrooms = 0\r\nfor i in range(n):\r\n x, y = map(int,input().split())\r\n if y - x >= 2: rooms +=1\r\nprint(rooms)", "n=int(input())\r\npeople=[]\r\nmaxp=[]\r\nrooms=0\r\nfor i in range(0,n):\r\n arr = list(map(int, input().split()))\r\n people.append(arr[0])\r\n maxp.append(arr[1])\r\nfor j in range (0,len(people)):\r\n if (int(maxp[j])-int(people[j]))> 1:\r\n rooms=rooms+1\r\nprint(rooms)", "n=int(input())\r\ns=0\r\nfor _ in range(n):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n s+=1\r\nprint(s)\r\n", "n=int(input())\r\ncount=0\r\nfor _ in range (n):\r\n pi,qi=map(int,input().split())\r\n if qi-pi>=2:\r\n count+=1\r\nprint(count)", "looper = int(input())\r\ncount = 0\r\nfor i in range(looper):\r\n inp = list(map(int,input().split()))\r\n if inp[1] - inp[0] >=2:\r\n count+=1\r\nprint(count)", "count = 0\r\nfor _ in range(int(input())):\r\n p , q = map(int, input().split())\r\n if p<=q-2:\r\n count+=1\r\nprint(count)", "n=input()\nn=int(n)\nx=0\nfor i in range(1,n+1):\n a,b=input().split()\n a=int(a)\n b=int(b)\n if (b-a)>=2:\n x=x+1\nprint(x)\n\n\n\t\t \t\t\t \t\t \t \t \t\t\t\t\t\t\t\t \t\t\t\t", "n = int(input())\r\nresult=0\r\nfor x in range (n):\r\n m,b=map(int,input().split())\r\n if b - m >= 2 :\r\n result +=1\r\nprint(result)", "n = int(input())\r\ncount = 0\r\n\r\nfor _ in range(n):\r\n p, q = input().split()\r\n p = int(p)\r\n q = int(q)\r\n if q - p >= 2: # Room can accommodate both George and Alex (2 free places required)\r\n count += 1\r\n\r\nprint(count)\r\n", "n=int(input())\r\nct=0\r\nwhile n!=0:\r\n p,q= map(int, input().split())\r\n if q-p>=2:\r\n ct+=1\r\n n-=1\r\nprint(ct)\r\n", "n = int(input())\nans=0\nfor i in range(n):\n p,q =map(int, input().split())\n if q-p>=2:\n ans+=1\nprint(ans)\n\t \t\t \t \t\t\t \t\t\t\t \t\t\t\t \t\t\t\t", "# Read input\r\nn = int(input())\r\n\r\n# Initialize a counter for valid rooms\r\nvalid_rooms = 0\r\n\r\n# Iterate through the rooms\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n if q - p >= 2: # Check if there's enough free space for both George and Alex\r\n valid_rooms += 1\r\n\r\n# Print the result\r\nprint(valid_rooms)\r\n", "n = int(input())\r\n\r\nrooms_with_free_space = 0\r\n\r\nfor _ in range(n):\r\n p, q = map(int, input().split()) \r\n if q - p >= 2: \r\n rooms_with_free_space += 1\r\n\r\nprint(rooms_with_free_space)\r\n", "n = int(input())\n\navailible_rooms = 0\n\nfor i in range(n):\n current,capacity = input().split()\n current,capacity = int(current),int(capacity)\n availible = capacity-current\n if availible>=2:\n availible_rooms+=1\n\nprint(availible_rooms)\n", "n = int(input())\r\n\r\nres = 0\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n res += (q - p >= 2)\r\n\r\nprint(res)", "num = int(input())\r\nc = 0\r\nfor i in range(num):\r\n a,b = map(int, input().split())\r\n if (b - a) >= 2:\r\n c += 1\r\nprint(c)", "cnt = 0\r\ntst = int(input())\r\nfor _ in range(tst):\r\n p, q = map(int, input().split())\r\n if abs(p - q) >= 2:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "N=input()\nN=int(N)\nR=0\nfor i in range(1,N+1):\n A,B=input().split()\n A=int(A)\n B=int(B)\n if ((B-A)>=2):\n R+=1\nprint(R)\n \t \t\t\t \t \t \t\t \t \t", "i = int(input())\r\n\r\nr=0\r\n\r\nfor j in range(i):\r\n t = input().split(' ')\r\n p = int(t[0])\r\n q = int(t[1])\r\n if q-p>= 2:\r\n r+=1\r\n \r\nprint(r)", "x = int(input())\r\ncount = 0\r\nfor _ in range(x):\r\n x,y = map(int,input().split())\r\n if y-x >= 2:\r\n count += 1\r\nprint(count)", "n=int(input())\r\nroom=0\r\nfor i in range(n):\r\n x,y = map(int, input().split())\r\n if ((y-x)>=2):\r\n room+=1\r\n\r\nprint(room)", "n = int(input())\r\nres = 0\r\nfor i in range(n):\r\n c1, c2 = map(int, input().split())\r\n if c2 - c1>=2:\r\n res +=1\r\nprint(res)\r\n ", "# import sys \n# sys.stdin = open(\"/Users/swasti/Desktop/coding/cp/codeforces/input.txt\", \"r\")\n# sys.stdout = open(\"/Users/swasti/Desktop/coding/cp/codeforces/output.txt\", \"w\")\ncount = 0\nfor i in range (int(input())):\n p,q = list(map(int,input().split()))\n if (q-p) >=2:\n count += 1\nprint (count)\n", "def canMove(room):\n people, size = room.split(\" \")\n if (int(size) - int(people)) > 1:\n return 1\n return 0 \n\ndef main():\n count = 0\n numRooms = input()\n for x in range(int(numRooms)):\n room = input()\n count += canMove(room)\n \n print(count)\n \n\nif __name__ == \"__main__\":\n main()", "arr = []\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n d = b - a\r\n arr.append(d)\r\nc = 0\r\nfor i in range(len(arr)):\r\n if arr[i] >= 2:\r\n c += 1\r\nprint(c)\r\n", "t = int(input())\r\nsum = 0\r\nfor _ in range(t):\r\n x , y = map(int,input().split())\r\n if y - x >= 2:\r\n sum += 1\r\nprint(sum)", "j=int(input())\r\nc=0\r\nfor _ in range(j):\r\n f,b=map(int,input().split())\r\n if((b-f)>=2):\r\n c+=1\r\nprint(c)", "def countspace(n, rooms):\r\n count = 0\r\n\r\n for pi, qi in rooms:\r\n if qi - pi >= 2:\r\n count += 1\r\n\r\n return count\r\n\r\nn = int(input())\r\nrooms = []\r\nfor _ in range(n):\r\n pi, qi = map(int, input().split())\r\n rooms.append((pi, qi))\r\n\r\nprint(countspace(n, rooms))\r\n", "a=int(input())\r\ns=0\r\nfor i in range(1,a+1):\r\n c,d=map(int,input().split())\r\n if (d-c)//2>0:\r\n s+=1\r\nprint(s)\r\n", "n = int(input())\r\nrooms_with_free_space = 0\r\n\r\nfor i in range(n):\r\n pi, qi = map(int, input().split())\r\n if qi - pi >= 2:\r\n rooms_with_free_space += 1\r\n\r\nprint(rooms_with_free_space)\r\n", "def acc(lst):\r\n sol = int()\r\n for item in lst:\r\n if item[1] - item[0] >= 2:\r\n sol += 1\r\n return sol\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n lst = []\r\n for item in range (n):\r\n lst.append(list(map(int, input().split())))\r\n print(acc(lst))", "numOfRooms = int(input())\r\ncanLive = 0\r\nfor r in range(numOfRooms):\r\n roomLived, roomCapacity = input().split()\r\n spare = int(roomCapacity) - int(roomLived)\r\n if (spare >= 2):\r\n canLive += 1\r\nprint(canLive)", "n=int(input())\r\nb=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if y-x>=2:\r\n b+=1\r\nprint(b)\r\n", "t = int(input())\r\n\r\nc = 0\r\n\r\nfor i in range(t):\r\n\r\n p, q = map(int, input().split())\r\n\r\n if abs(p - q) >= 2:\r\n\r\n c += 1\r\n\r\nprint(c) ", "n = int(input())\r\nx = []\r\nsum = 0\r\n\r\nfor i in range(n):\r\n x.append(list(map(int, input().split())))\r\n if (x[i][1] - x[i][0]) >= 2:\r\n sum += 1\r\n\r\nprint(sum)\r\n", "number_of_rooms = int(input())\r\navailable_counter = 0\r\n\r\nwhile number_of_rooms > 0:\r\n\r\n number_of_rooms -= 1\r\n\r\n capacities = [int(i) for i in input().split()]\r\n capacity = capacities[1] - capacities[0]\r\n\r\n if capacity >= 2:\r\n\r\n available_counter += 1\r\n\r\nprint(available_counter)", "n = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n if y - x >= 2:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\np = [0 for i in range(n)]\r\nq = [0 for i in range(n)]\r\ncnt = 0\r\nfor i in range(n):\r\n p[i], q[i] = map(int, input().split())\r\n if q[i] > p[i]+1:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "room = int(input())\r\nk = 0\r\nfor i in range(room):\r\n string = input()\r\n if int(string.split()[1])-int(string.split()[0])>=2:\r\n k+=1\r\nprint(k)", "def main():\n n = int(input())\n count = 0 \n while n>0:\n a,b = map(int,input().split(' '))\n if(b-a>=2):\n count+=1\n n=n-1\n\n print(count)\n\nmain()\n ", "t=int(input())\r\ncount=0\r\nfor i in range(t):\r\n p,q=map(int,input().split())\r\n if p<q and q-p>=2:\r\n count += 1\r\nprint(count)", "n = int(input())\r\nc = 0\r\nfor k in range(n):\r\n s = [int(j) for j in input ().split()]\r\n if s[1]-s[0]>=2:\r\n c+=1\r\nprint(c)", "a = int(input())\r\nk = 0\r\nfor i in range(a):\r\n b, c = map(int, input().split())\r\n if b + 2 <= c:\r\n k += 1\r\nprint(k)\r\n", "res=[]\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n res.append(b-a>=2)\r\nprint(sum(res))", "liczbaPokoi = int(input())\r\n\r\ndostepnePokoje = 0\r\nfor i in range(liczbaPokoi):\r\n liczbaOsob,pojemonsc = map(int, input().split())\r\n if (pojemonsc-liczbaOsob) >= 2:\r\n dostepnePokoje += 1\r\n\r\nprint(dostepnePokoje)\r\n", "def solve():\r\n n = int(input())\r\n\r\n cnt = 0\r\n for i in range (n):\r\n x, y = map(int, input().split())\r\n if (y - x >= 2):\r\n cnt += 1\r\n \r\n print(cnt)\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n\r\n", "available = 0\r\nfor i in range(int(input())):\r\n room = input().split()\r\n av = int(room[1])-int(room[0])\r\n if av>=2:\r\n available+=1\r\nprint(available)", "count=0\r\nfor i in range(int(input())):\r\n p,q=list(map(int,input().split()))\r\n if q-p >= 2:count+=1\r\nprint(count)\r\n\r\n", "result = \"\"\r\nn = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n p,q = input().split(\" \")\r\n if int(q) >= 2 and int(q) - int(p) >= 2:\r\n count += 1\r\nresult = count\r\nprint(f\"{result}\")", "# LUOGU_RID: 114989941\nans = 0\nfor _ in range(int(input())):\n a, b = map(int, input().split())\n ans += (b - a > 1)\nprint(ans)", "s=0;\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if b-a>=2:s+=1\r\nprint(s)", "y=int(input())\r\ntot=0\r\nfor i in range(y):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n tot+=1\r\nprint(tot)", "def sol():\r\n n=int(input())\r\n cnt=0\r\n for i in range(n):\r\n a,b=map(int,input().split(\" \"))\r\n if (b-a)>=2:\r\n cnt+=1\r\n print(cnt)\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nsol()", "print(sum(q - p > 1 for p, q in (map(int, input().split()) for _ in range(int(input())))))", "d=0\r\nfor i in range(int(input())):\r\n a,b=input().split()\r\n if (int(b)-int(a))>=2:\r\n d+=1\r\nprint(d)", "rooms = int(input())\r\n\r\nroom_details = []\r\nfor i in range(0, rooms):\r\n details = input() \r\n room_details.append(details.split())\r\n\r\ncount = 0\r\n\r\nfor detail in room_details:\r\n if int(detail[1])-int(detail[0])>=2:\r\n count += 1\r\n\r\nprint(count)\r\n", "n=int(input())\r\ncount=0\r\n\r\nfor _ in range(n):\r\n p, q=list(map(int,input().split()))\r\n if q-p>=2:\r\n count+=1\r\n\r\n \r\nprint(count)", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n l.append([a,b])\r\n\r\nc = 0\r\nm = []\r\nfor j in range(n):\r\n m = l[j]\r\n x,y= m[0],m[1]\r\n if abs(x-y)>=2:\r\n c+=1 \r\n\r\nprint(c)", "numb = int(input())\r\ncount = 0\r\nfor i in range(numb): \r\n hab = input()\r\n x , y = map(int, hab.split(\" \"))\r\n if abs (x - y) >= 2 :\r\n count += 1\r\nprint(count)", "n = int(input())\r\njudge = 0\r\nfor _ in range(n):\r\n p,q = map(int,input().split())\r\n if q-p >= 2:\r\n judge += 1\r\nprint(judge)", "c = 0\na = int(input())\nfor i in range(a):\n p, q = map(int, input().split())\n if q - p >= 2:\n c += 1\nprint(c)\n", "if __name__ == \"__main__\":\r\n n = int(input())\r\n c=0\r\n for i in range(n):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n c+=1\r\n print(c)\r\n", "c=0\r\nfor _ in range(int(input())):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n c=c+1\r\nprint(c) ", "n = int(input())\r\n\r\nfreeroom = 0\r\n\r\nwhile (n > 0):\r\n p,q = map(int,input().split())\r\n if q-p >= 2: freeroom += 1\r\n n -= 1\r\n\r\nprint(freeroom)", "n = int(input())\r\ns=0\r\nfor i in range(n):\r\n a , b = map(int,input().split())\r\n if(b-a>=2):\r\n s+=1\r\nprint(s)", "n=int(input())\r\nlist=[]\r\nnum=0\r\nfor i in range(n):\r\n list.append(input().split())\r\nfor i in range(n):\r\n if int(list[i][1])-int(list[i][0])>=2:\r\n num+=1\r\nprint(num)", "n = int(input())\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n p, q = map(int, input().split(' '))\r\n if q-p >= 2:\r\n res += 1\r\n\r\nprint(res)", "if __name__ == \"__main__\":\r\n rooms = int(input())\r\n result = 0\r\n for i in range(rooms):\r\n arr = input().split()\r\n p = int(arr[0])\r\n q = int(arr[1])\r\n \r\n if q-p >= 2:\r\n result += 1\r\n \r\n print(result)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n count+=1\r\n else:\r\n count+=0\r\nprint(count)", "t = int(input(\"\"))\r\nc = 0\r\nfor i in range(t):\r\n y = input(\"\").split(\" \")\r\n if abs(int(y[0]) - int(y[1]))>=2:\r\n c = c + 1 \r\n\r\nprint(c)", "t = int(input())\r\nc=0\r\nfor _ in range(t):\r\n m,n = map(int,input().split())\r\n if(n-m)>=2:\r\n c = c+1\r\nprint(c)", "t = int(input())\r\ncnt = 0\r\nfor _ in range(t):\r\n num = list(map(int, input().split()))\r\n if num[1]-num[0]>=2:\r\n cnt+=1\r\nprint(cnt)", "rooms=int(input())\r\navailablerooms=0\r\nfor i in range(rooms):\r\n p, q=[int(i) for i in input().split(\" \")]\r\n if (q-p)>=2:\r\n availablerooms+=1\r\n\r\nprint(availablerooms)\r\n", "n=int(input())\nroom = 0\nfor _ in range(n):\n p,q=map(int,input().split())\n if (q-p) >=2:\n room = room +1\nprint(room)\n \n\n \t \t \t\t \t \t\t \t \t\t \t \t \t", "n = int(input())\r\nj = 0\r\nfor i in range(n):\r\n s,x = map(int, input().split())\r\n if x - s >= 2:\r\n j +=1\r\n else:\r\n continue\r\nprint(j)\r\n\r\n\r\n", "l=[]\r\nfor i in range(int(input())):\r\n l.append(list(map(int,input().split())))\r\ncount=0\r\nfor l1 in l:\r\n if l1[1]-l1[0]>=2:\r\n count+=1\r\nprint(count)", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n ans+=1 \r\nprint(ans)\r\n ", "n = int(input())\r\ntotalIN = []\r\ntotalCap = []\r\nfor i in range (0, n):\r\n a,b = map(int, input().split())\r\n totalIN.append(a)\r\n totalCap.append(b)\r\n\r\ncount = 0\r\nfor i in range(n):\r\n if (totalCap[i]-totalIN[i]) >= 2:\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\r\nrooms = 0\r\nfor _ in range(n):\r\n occupied, total = map(int, input().split())\r\n if total - occupied >= 2:\r\n rooms += 1\r\nprint(rooms)\r\n", "n=int(input())\r\nc=0\r\nwhile n:\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n c+=1\r\n n-=1\r\nprint(c)", "t = int(input())\r\nc = 0\r\n\r\nfor _ in range(t):\r\n a, b = map(int, input().split())\r\n d = b - a\r\n if d >= 2:\r\n c += 1\r\n\r\nprint(c)\r\n", "t = int(input())\r\na = 0\r\nfor _ in range(t):\r\n people, capacity = map(int, input().split())\r\n if capacity - people >= 2:\r\n a += 1\r\nprint(a)\r\n", "t = int(input())\r\ncnt = 0\r\ni =0\r\nwhile i< t :\r\n p ,q= [int(x) for x in input().split()]\r\n if q-p>=2 :\r\n cnt= cnt+1\r\n i = i+1\r\nprint(cnt)", "n=int(input())\r\nc=0\r\nwhile n>0:\r\n\tn=n-1\r\n\ta,b=map(int,input().split())\r\n\tif a+2<=b:\r\n\t\tc=c+1\r\nprint(c)", "number_of_rooms = int(input())\r\navilable_rooms = 0\r\nfor _ in range(number_of_rooms):\r\n living_people, room_capacity = input().split()\r\n if int(room_capacity) - int(living_people) >= 2:\r\n avilable_rooms += 1\r\n\r\nprint(avilable_rooms)", "n=int(input())\r\nsum=0\r\nk=0\r\nfor i in range (0,n):\r\n p,q=map(int,input().split())\r\n t=q-p\r\n if t>=2:\r\n sum=sum+1\r\n else:\r\n k+=1\r\n \r\n \r\nprint(sum)", "n=int(input())\r\n\r\nans=0\r\nfor i in range(n):\r\n\tnum1,num2=input().split()\r\n\tnum1=int(num1)\r\n\tnum2=int(num2)\r\n\tsum=num2-num1\r\n\tif sum>=2:\r\n\t\tans+=1\r\n\r\nprint(ans)\r\n\r\n", "ct=0\r\nfor _ in range(int(input())):\r\n p,q=map(int,input().split())\r\n if abs(p-q)>=2:\r\n ct+=1\r\nprint(ct)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n room=input().split()\r\n p=int(room[0])\r\n q=int(room[1])\r\n if q-p>=2:\r\n x+=1\r\n else:\r\n x=x \r\nprint(x)", "a=int(input())\r\ns=0\r\nfor i in range(a):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n s=s+1\r\nprint(s)", "t=int(input())\r\navail=0\r\nfor b in range(t):\r\n n,m=map(int,input().split())\r\n if(m-n)>=2:\r\n avail+=1\r\nprint(avail) ", "def main():\n n = int(input())\n rooms = 0\n for _ in range(n):\n p, q = [int(el) for el in input().split()]\n if q - p > 1:\n rooms += 1\n print(rooms)\n\nif __name__ == '__main__':\n main()", "runs = int(input())\ncounter = 0\nfor i in range(runs):\n p, q = map(int, input().split())\n if q-p>=2:\n counter+=1\nprint(counter)\n\n", "count = 0 \r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n if a+2 <= b:\r\n count += 1 \r\nprint(count)", "n=int(input())\r\nk=0\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n if m==c:\r\n pass\r\n elif (c-m)>=2:\r\n k+=1\r\nprint(k)", "n = int(input())\r\nres = 0\r\n\r\nfor i in range (n):\r\n p, q = map(int, input().split())\r\n if (p + 2) <= q:\r\n res += 1\r\n\r\nprint(res)", "n = int(input())\r\nansw = 0\r\nfor i in range(n):\r\n k, l = map(int, input().split())\r\n if l-k >= 2:\r\n answ += 1\r\nprint(answ) ", "a=int(input())\r\nc=0\r\nfor i in range(a):\r\n b,n=(map(int,input().split()))\r\n if n-b>1:\r\n c+=1\r\nprint(c)", "n=int(input())\r\nmatrix = [[0 for x in range(2)] for y in range(n)]\r\n\r\nrows=0\r\nfor i in range(n):\r\n columns=0\r\n for word in input().split(' '):\r\n matrix[rows][columns]=int(word)\r\n columns+=1\r\n rows+=1\r\n\r\nnumbers_rooms=0\r\nfor rooms in matrix:\r\n if rooms[1]-rooms[0]>=2:\r\n numbers_rooms+=1\r\n\r\nprint(numbers_rooms)", "n = int(input())\r\n\r\nres = 0\r\nfor i in range(n):\r\n p, q = list(map(int, input().split()))\r\n if (q - p) >= 2:\r\n res += 1\r\n \r\n\r\nprint(res)", "ans=0\nn=int(input())\nfor i in range (1,n+1):\n cup_cap,max_cap=map(int,input().split())\n if max_cap-cup_cap >=2:\n ans+=1\nprint(ans)\n\t \t\t \t \t \t\t \t \t \t\t\t \t\t\t", "t = int(input())\r\nc = 0\r\n\r\nfor _ in range(t):\r\n p, cap = map(int, input().split())\r\n if cap - p >= 2:\r\n c += 1\r\n\r\nprint(c)\r\n", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n if y - x >= 2:\r\n count += 1\r\n\r\nprint(count)\r\n", "#https://codeforces.com/problemset/problem/467/A\r\nn = int(input())\r\ncont = 0\r\nwhile n > 0:\r\n a, b = map(int, input().split())\r\n if (((a + 2) <= b)):\r\n cont += 1\r\n\r\n n -= 1\r\n\r\nprint(cont)", "n = int(input())\nc = 0\nfor i in range(n):\n p, q = input().split()\n p = int(p)\n q = int(q)\n if p+2 <= q:\n c += 1\nprint(c)\n \t\t \t \t \t\t\t\t \t \t \t \t \t \t", "n = int(input())\r\nspace = 0\r\nfor i in range(n):\r\n p, q = [int(i) for i in input().split()]\r\n if q-1 > p:\r\n space += 1\r\nprint(space)", "n = int(input())\r\nallRooms = []\r\nfor i in range (n):\r\n allRooms.append(list(map(int,input().strip().split())))\r\n\r\ncount = 0\r\nfor i in range(n):\r\n if (allRooms[i][1] - allRooms[i][0]) >=2:\r\n count+=1\r\nprint(count)\r\n\r\n", "n = int(input())\r\nrooms = 0\r\nfor i in range(n):\r\n p, c = input().split()\r\n p, c = int(p), int(c)\r\n if c-p >= 2:\r\n rooms += 1\r\nprint(rooms)\r\n", "n = int(input())\r\ncounter = 0 \r\n\r\nfor i in range(n):\r\n p,q = map(int, input().split())\r\n if (q-p) >= 2:\r\n counter = counter + 1\r\n \r\nprint(counter)\r\n\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n list1=list(map(int,input().split()))[:2]\r\n if(list1[1]-list1[0]>=2):\r\n count+=1\r\nprint(count)\r\n ", "n=int(input())\r\ncc=0\r\nfor i in range(n):\r\n p, q=input().split()\r\n q=int(q)\r\n p=int(p)\r\n if q-p>=2:\r\n cc=cc+1\r\nprint(cc)", "n = input()\nn = int(n)\ncounter = 0\nfor i in range(1 , n+1):\n p,q = input().split()\n p = int(p)\n q = int(q)\n if q - p >= 2:\n counter += 1\nprint(counter)\n\t \t \t \t \t \t \t \t\t\t\t \t\t", "n = int(input())\r\nc=0\r\nfor i in range(n):\r\n L =input().split(\" \")\r\n L = [int(i) for i in L]\r\n if L[1] - L[0]>=2 :\r\n c += 1\r\nprint(c)", "n=input()\nn=int(n)\nans = 0\n\nfor i in range(0,n,1):\n\n p,q=input().split()\n p=int(p)\n q=int(q)\n if q-p>=2:\n ans+=1\n\nprint(ans)\n\n \t\t \t\t \t\t\t \t \t\t\t\t\t \t \t \t\t\t\t", "t=input()\r\nh=0\r\nwhile int(t)>0:\r\n t=int(t)-1\r\n x,y=input().split()\r\n if int(y)-int(x)>=2:\r\n h=int(h)+1\r\nprint(int(h))", "a = int(input())\r\ncounter = 0\r\nfor i in range(a):\r\n a_1, a_2 = map(int, input().split())\r\n if a_2 - a_1 >= 2:\r\n counter += 1\r\nprint(counter)\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n s=input()\r\n t=s.split()\r\n p=int(t[0])\r\n q=int(t[1])\r\n if q-p>=2:\r\n count+=1\r\nprint(count)", "r = 0\r\nl = []\r\nfor i in range(int(input())):\r\n l.append(list(map(int, input().split())))\r\nprint(sum(list(map(lambda p: p[-1]-p[0]>1, l))))", "t = int(input())\r\ncount = 0\r\n\r\nfor i in range(t):\r\n people, capacity = map(int, input().split())\r\n if capacity - people >= 2:\r\n count += 1\r\n\r\nprint(count)", "n=int(input())\r\nc=0\r\nfor i in range (n):\r\n p,q=map(int,input().split())\r\n if q>=p+2:\r\n c+=1\r\n continue\r\nprint(c)", "n=int(input())\ncounter=0\n\nfor i in range(0,n):\n p,q=input().split()\n p=int(p)\n q=int(q)\n if p+2 <=q:\n counter+=1\n\nprint(counter)\n\n \t\t\t\t \t \t\t \t\t \t\t \t \t \t\t", "ans = 0\r\nfor i in range (int(input())):\r\n p, q = input().split()\r\n p, q = int(p), int(q)\r\n if q - p >= 2:\r\n ans += 1\r\nprint(ans)", "a = int(input())\r\ncounter = 0\r\nfor i in range(a):\r\n b = input().split(' ')\r\n b = [int(x) for x in b]\r\n if b[1] - b[0] >= 2:\r\n counter += 1\r\nprint(counter)", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n p,q=input().split()\r\n p,q=int(p),int(q)\r\n if q-p >=2:\r\n c+=1\r\nprint(c)", "n = input()\nn = int(n)\nroom = 0\nfor i in range (1 , n + 1) :\n p , q = input().split()\n p = int(p)\n q = int(q)\n if q - p >= 2 :\n room = room + 1\nprint(room)\n \t\t\t \t \t\t\t\t \t\t\t\t \t\t\t\t\t \t \t \t", "a=int(input())\r\nc=0\r\nfor i in range(a):\r\n b=input().split()\r\n if (int(b[1])-int(b[0]))>=2:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nrooms = [list(map(int, input().split())) for i in range(n)]\r\nrooms_count = 0\r\nfor i in range(n):\r\n if rooms[i][1] - rooms[i][0] >= 2:\r\n rooms_count += 1\r\nprint(rooms_count)\r\n", "n=int(input())\r\nc=0\r\nwhile(n>0):\r\n a=[int(i) for i in input().split()]\r\n if a[1]-a[0]>=2:\r\n c+=1\r\n n-=1\r\nprint(c)", "s = int(input())\r\ncount = 0\r\nfor i in range(0,s):\r\n a, b = input().split()\r\n x= int(a)\r\n y = int(b)\r\n if(y-x>=2):\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n s = input().split()\r\n if int(s[1]) - int(s[0]) > 1:\r\n count += 1\r\nprint(count)", "n=int(input())\r\na=[]\r\nnum=0\r\nfor i in range(n):\r\n a.append(list(map(int,input().split(\" \"))))\r\n if a[i][1]-a[i][0]>=2:\r\n num+=1\r\nprint(num)", "number_of_room = int(input())\n\ncount = 0\n\nfor _ in range(number_of_room):\n p,q = map(int, input().split())\n if(q-p)>= 2:\n count = count + 1\n\nprint(count)", "t=int(input())\r\nc=0\r\nwhile t>0:\r\n a,b=map(int,input().split())\r\n if b-a>1:\r\n c+=1\r\n t-=1\r\nprint(c)", "g=0\r\nn=int(input())\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if y-x >=2:\r\n g+=1\r\nprint(g)", "a = int(input())\r\ni = 1\r\nlst1=[]\r\nlst2=[]\r\nwhile i<=a :\r\n x,y = map(int,input().split())\r\n lst1.append(x)\r\n lst2.append(y)\r\n i += 1\r\n\r\n\r\nind = 0\r\nans = 0\r\nwhile ind < a :\r\n c = lst1[ind]-lst2[ind]\r\n if abs(c) >= 2:\r\n ans += 1\r\n else:\r\n ans = ans\r\n ind += 1\r\nprint(ans)", "h=int(input())\r\ncnt=0\r\nfor _ in range(h):\r\n g,d=map(int,input().split())\r\n if((d-g)>=2):\r\n cnt+=1\r\nprint(cnt)", "n = int(input(\"\"))\r\ncountroom = 0\r\nfor i in range(n):\r\n p, q = map(int, input(\"\").split())\r\n if p==q:\r\n countroom+=0\r\n elif p<=q-2:\r\n countroom+=1\r\nprint(countroom)\r\n", "n=int(input())\r\ncount=0\r\nfor _ in range(n):\r\n lst=list(map(int,input().split()))\r\n if lst[1]>=lst[0]+2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nk=0\r\nm1=[]\r\nfor i in range(n):\r\n m = (input().split())\r\n m1.append(m)\r\n if int(m[1])-int(m[0])>=2:\r\n k+=1\r\nprint(k)", "x = int(input())\r\ncount = 0\r\nfor _ in range(x):\r\n y = list(map(int,input().split()))\r\n if y[1]-y[0] >=2:\r\n count += 1\r\nprint(count)\r\n\r\n", "t = int(input())\r\nc = 0\r\nfor i in range(t):\r\n p, q = map(int,input().split())\r\n if q-p >= 2:\r\n c = c + 1\r\nprint(c)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if q-p> 1: \r\n \tx+= 1\r\nprint(x)", "n=int(input())\r\n\r\nempty=0\r\nfor i in range(n):\r\n res = list(map(int, input().split()))\r\n ppl=res[0]\r\n cap=res[1]\r\n if ((cap-ppl)>=2):\r\n empty=empty+1\r\nprint(empty)", "n=int(input(\"\"))\r\ncount=0\r\nfor i in range(n):\r\n x=input(\"\").split()\r\n if int(x[1])-int(x[0])>=2:\r\n count+=1\r\n\r\nprint(count)\r\n ", "n = int(input())\ncount = 0\nfor _ in range(n):\n A, B = map(int, input().split())\n if (B - A) >= 2:\n count += 1\nprint(count)\n \t \t \t\t \t\t \t \t \t\t\t\t\t\t\t\t\t", "count=0\r\nfor k in range(int(input())):\r\n x,y=map(int,input().split())\r\n if(x+2<=y):\r\n count+=1\r\nprint(count)\r\n", "def main():\r\n n = int(input())\r\n room = 0\r\n for _ in range(n):\r\n p, q = map(int, input().split())\r\n room += 1 if q - p >= 2 else 0\r\n print(room)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "c=0\r\nn=int(input())\r\nls=[]\r\nfor i in range(n):\r\n row=list(map(int,input().split()))\r\n ls.append(row)\r\nfor i in range(n):\r\n if ls[i][1]-ls[i][0]>1:\r\n c+=1\r\nprint(c)", "occ = 0\r\nfor c in range(int(input())):\r\n hold = [int(c) for c in input().split(' ')]\r\n if hold[1] - hold[0] >= 2:\r\n occ += 1\r\nprint(occ)", "\r\nn = int(input())\r\nc=0\r\nfor i in range(n):\r\n p,q=map(int, input().split())\r\n if((q-p)>=2):\r\n c+=1\r\nprint(c)", "def count_accommodations(n, rooms):\r\n count = 0\r\n for i in range(n):\r\n if rooms[i][1] - rooms[i][0] >= 2:\r\n count += 1\r\n return count\r\n \r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n rooms = [tuple(map(int, input().split())) for _ in range(n)]\r\n print(count_accommodations(n, rooms))\r\n", "num_rooms = int(input())\r\n\r\nvacant_rooms = 0\r\n\r\nfor _ in range(num_rooms):\r\n a, b = map(int, input().split())\r\n if b-a >= 2:\r\n vacant_rooms += 1\r\n\r\nprint(vacant_rooms)", "test=int(input())\r\nans= 0\r\nwhile test>0:\r\n a,b= map(int, input().split())\r\n if b-a>= 2:\r\n ans+= 1\r\n test-=1\r\nprint(ans)\r\n", "n = int(input())\r\nroom = 0\r\nfor i in range(1 , n+1):\r\n p,q = input().split()\r\n p = int(p)\r\n q =int(q)\r\n if q - p > 1:\r\n room += 1\r\nprint(room)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n p, q = (int(j) for j in input().split(' '))\r\n space = q - p\r\n if space >= 2:\r\n count += 1\r\nprint(count)", "counter = 0\namount = int(input())\nfor i in range(amount):\n p_and_q = [int(i)for i in input().split()]\n if p_and_q[1] - p_and_q[0] >= 2:\n counter += 1\nprint(counter)\n", "c=0\r\nfor i in range(int(input())):\r\n of , mx =map(int,input().split())\r\n if (mx-of)>=2:c+=1\r\nprint(c)\r\n", "n = int(input())\ntotal = 0\n\nwhile (n > 0):\n \n p, q = map(int, input().split())\n if (q - p >= 2):\n total += 1\n \n n -= 1\n\nprint(total)\n", "n = int(input())\r\nans = 0 \r\n\r\nfor i in range(n):\r\n\ta = input().split()\r\n\tif int(a[1]) - int(a[0]) >= 2:\r\n\t\tans = ans + 1\r\n\r\nprint(ans)\r\n", "a=int(input())\r\nb=0\r\nfor i in range(a):\r\n d = list(map(int, input().split()))\r\n if d[1]-d[0]>=2:\r\n b+=1\r\nprint(b)", "n=int(input())\ns=0\nfor i in range(n):\n p,q=map(int,input().split())\n s+=1 if q-p>1 else 0\nprint(s)", "n=int(input())\nans=0\nfor i in range (n) :\n p,q=input().split()\n p=int(p)\n q=int(q)\n g=q-p\n if g>=2:\n ans+=1\nprint(ans)\n \t \t\t\t \t\t\t \t \t\t \t\t\t\t\t\t\t\t\t\t", "x=0\r\nfor _ in range(int(input())):\r\n a,s=map(int,input().split())\r\n if s-a>=2:\r\n x+=1\r\nprint(x)", "n = int(input())\r\nans = 0\r\nfor i in range(0, n):\r\n s = input().split()\r\n if int(s[1])-int(s[0]) >= 2:\r\n ans += 1\r\nprint(ans)\r\n", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n m,n=map(int,input().split())\r\n if((n-m)>=2):\r\n c+=1\r\nprint(c)", "count=0\r\nfor i in range(int(input())):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n count+=1 \r\nprint(count)", "x= int(input())\r\ny=0\r\nfor i in range(x):\r\n a,b = map(int,input().split())\r\n if b-a>=2:\r\n y+=1\r\nprint(y)", "t=int(input())\r\nw=0\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n c=b-a\r\n if c>=2:\r\n w+=1\r\nprint(w) ", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n while(p!=q and q-p>=2):\r\n count+=1\r\n break\r\nprint(count)", "t=int(input())\r\nr=0\r\nfor i in range(t):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n r+=1\r\n else:\r\n pass\r\nprint(r)", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n y=b-a\r\n if y>=2:\r\n c+=1\r\nprint(c)", "n = input()\nn = int(n)\nroom = 0\nfor i in range(1, n+1):\n p, q = input().split()\n p = int(p)\n q = int(q)\n if q - p >= 2:\n room = room + 1\nprint(room)\n\t \t\t \t\t \t \t\t \t \t \t\t\t\t \t \t \t", "a=int(input())\r\nk=0\r\nfor i in range(a):\r\n b,c=map(int,input().split())\r\n if c-b>1:\r\n k+=1\r\nprint(k)", "T = int(input())\r\nk = 0\r\nfor i in range(T):\r\n a = input()\r\n a = a.split()\r\n a = [int(x) for x in a]\r\n if (a[0]+1) < a[1]:\r\n k += 1\r\n else:\r\n continue\r\nprint(k)", "n = int(input())\r\np = [0]*n\r\nq = [0]*n\r\nnum = 0\r\nfor i in range(n):\r\n p[i], q[i] = (int(j) for j in input().split())\r\n if q[i] - p[i] >= 2:\r\n num += 1\r\nprint(num)", "x=input()\nx=int(x)\nr=0\nfor i in range(x):\n a,b = input().split()\n a = int(a)\n b = int(b)\n if b >= (a + 2):\n r += 1\nprint(r) \n\n \t\t \t\t\t\t\t \t \t\t\t \t\t \t \t\t \t\t\t \t", "from sys import stdin\r\naCum = 0\r\nfor _ in range(int(stdin.readline())):\r\n a = stdin.readline().split()\r\n if int(a[1])-int(a[0]) >= 2: aCum +=1\r\nprint(aCum)", "a = int(input())\r\nsq = [[int(i) for i in input().split()]for h in range(a)]\r\nd = 0\r\nfor i in range(a):\r\n if sq[i][0] + 2 <= sq[i][1]:\r\n d += 1\r\n\r\nprint(d)\r\n\r\n", "n = int(input())\r\n\r\ncount = 0\r\nfor _ in range(n):\r\n a = input().split(' ')\r\n p = int(a[0])\r\n q = int(a[1])\r\n\r\n x = q - p\r\n if x >= 2:\r\n count += 1\r\n\r\nprint(count)", "t=int(input())\r\nc=0\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n if (b-a)>=2:\r\n c+=1\r\n \r\nprint(c)", "N = int(input())\r\ncount = 0\r\n\r\nfor _ in range(N):\r\n P, Q = map(int, input().split())\r\n if Q - P >= 2:\r\n count += 1\r\n\r\nprint(count)\r\n", "def count_suitable_rooms(rooms):\r\n count = 0\r\n for room in rooms:\r\n p, q = room\r\n if q - p >= 2:\r\n count += 1\r\n return count\r\n\r\ndef main():\r\n n = int(input().strip())\r\n rooms = [tuple(map(int, input().strip().split())) for _ in range(n)]\r\n\r\n result = count_suitable_rooms(rooms)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\n\ntest=int(input())\ncnt=0\nfor t in range(test):\n n,q =map(int,input().split())\n diff=abs(n-q)\n if diff>1:cnt+=1\nprint(cnt)\n\t \t\t \t \t \t \t\t \t\t\t\t\t \t \t", "count = 0\nfor i in [0]*int(input()):\n inp = input().split()\n p, q = int(inp[0]), int(inp[1])\n if q-p>=2:\n count+=1\nprint(count)\n", "n = input()\nn = int(n)\nx = 0\nfor i in range(n):\n p, q = input().split()\n p = int(p)\n q = int(q)\n if q - p >= 2:\n x = x + 1\nprint(x)\n\n\t \t\t \t \t \t\t\t \t\t \t\t\t\t\t\t", "n = int(input())\r\nc = 0\r\nfor i in range(n):\r\n j,k = map(int, input().split())\r\n if(j+2<=k):\r\n c+=1\r\nprint(c)", "# 467A - George And Accommodation\r\n# https://codeforces.com/problemset/problem/467/A\r\n\r\n# Input:\r\n# 1) Número de cuartos\r\nnum_cuartos = int(input())\r\n\r\n# Contador de cuartos disponibles en los que George y Alex pueden mudarse\r\ncuartos_disponibles = 0\r\n\r\n# Revisa la capacidad de cada cuarto\r\nfor cuarto in range(0, num_cuartos):\r\n\r\n # Input:\r\n # 1) Número de personas viviendo en el cuarto\r\n # 2) Número de personas que puede albergar el cuarto\r\n personas_viviendo, capacidad_cuarto = map(int, input().split())\r\n\r\n # Si el número de personas viviendo en el cuarto + 2 (George y Alex) es menor o igual a la capacidad del cuarto,\r\n # entonces pueden mudarse ahí, suma +1 al contador de cuartos disponibles\r\n if personas_viviendo + 2 <= capacidad_cuarto:\r\n cuartos_disponibles += 1\r\n\r\nprint(cuartos_disponibles)", "n = int(input())\ncntr = 0\nfor i in range(n):\n l = [int(x) for x in input().split()]\n a = l[0]\n b = l[1]\n if b-a>=2:\n cntr+=1\nprint(cntr)\n \t\t \t \t \t\t \t\t \t\t \t", "s = 0\r\nfor i in range(int(input())):\r\n p = [int(i) for i in input().split()]\r\n if p[1]-p[0]>=2:\r\n s+=1\r\nprint(s)\r\n", "number_of_ROOM = int(input()) \r\nc = 0 \r\nfor i in range(0,number_of_ROOM) : \r\n people,size = map(int,input().split(\" \")) \r\n if size >= 2 and (size - people) >=2 :\r\n c+=1 \r\nprint(c)", "n = int(input())\r\ncount_accomodations = 0\r\n\r\nfor i in range(n):\r\n accomodation = [int(num) for num in input().split()]\r\n if (accomodation[1] - accomodation[0] >= 2):\r\n count_accomodations += 1\r\n\r\nprint(count_accomodations)", "# Read the number of rooms\r\nn = int(input())\r\n\r\n# Initialize the count of rooms with free place for both George and Alex\r\ncount = 0\r\n\r\n# Iterate over each room\r\nfor i in range(n):\r\n # Read the number of people and the room's capacity\r\n p, q = map(int, input().split())\r\n # Check if there's enough free place for both George and Alex\r\n if q - p >= 2:\r\n count += 1\r\n\r\n# Print the count of rooms with free place for both George and Alex\r\nprint(count)\r\n", "k=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split(' '))\r\n if b-a>=2:\r\n k+=1\r\nprint(k)\r\n \r\n", "n = int(input()) \r\ncount=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a+2 <= b:\r\n count +=1 \r\nprint(count)", "# 467A - George and Accommodation\r\n\r\nnumber_of_rooms = int(input())\r\ni = 0\r\nrooms_they_can_move_into = 0\r\n\r\nwhile i < number_of_rooms:\r\n response = input()\r\n new_l = response.split(\" \")\r\n if (int(new_l[0]) + 2) <= int(new_l[1]):\r\n rooms_they_can_move_into +=1\r\n i += 1\r\n\r\nprint(rooms_they_can_move_into)", "def solve():\r\n x = int(input())\r\n ans = 0\r\n for _ in range(x):\r\n p, q = map(int, input().split())\r\n ans += q-p >= 2\r\n print(ans)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "def solve():\r\n n = int(input())\r\n res = 0\r\n for _ in range(n):\r\n p,q = input().split()\r\n if int(p)+2 <= int(q):\r\n res+=1\r\n return res\r\n\r\n\r\nprint(solve())", "c = 0\r\nfor s in [*open(0)][1:]:\r\n c += eval(s.replace(' ', '-'))<-1\r\nprint(c)", "# Read the number of rooms\r\nn = int(input())\r\n\r\n# Initialize a counter for rooms with free place\r\ncount = 0\r\n\r\n# Iterate over each room\r\nfor _ in range(n):\r\n # Read the number of people living in the room and the room's capacity\r\n p, q = map(int, input().split())\r\n \r\n # Check if there's at least one free place in the room for both George and Alex\r\n if q - p >= 2:\r\n count += 1\r\n\r\n# Print the number of rooms with free place\r\nprint(count)", "n = int(input())\r\nc=0\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n \r\n if b-a>=2:\r\n c += 1\r\nprint(c)\r\n ", "ans=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n ans+=1\r\nprint(ans)", "a=int(input())\r\nk=0\r\nfor i in range(a):\r\n c=input()\r\n c=c.split(\" \")\r\n x,y=int(c[0]),int(c[1])\r\n if y-x>=2:\r\n k+=1\r\n else:\r\n continue\r\nprint(k)", "import sys\r\n\r\nuser_input = int(sys.stdin.readline().strip())\r\n\r\ncounter = 0\r\n\r\nfor i in range(user_input):\r\n a, b = map(int, sys.stdin.readline().strip().split())\r\n\r\n if (b - a) >= 2:\r\n counter += 1\r\nprint(counter)\r\n", "ct =0 \r\nn = int(input())\r\nfor i in range(n):\r\n p,q = map(int,input().split())\r\n if(p+2 <=q):\r\n ct = ct +1 \r\n \r\n\r\n\r\nprint(ct)", "num = int(input())\r\ncount = 0\r\nfor i in range(num):\r\n entrada = list(map(int, input().split()))\r\n if abs(entrada[0] - entrada[1]) >= 2:\r\n count += 1\r\nprint(count)", "N = int(input())\r\ncnt = 0\r\nfor i in range(N):\r\n X,Y = map(int,input().split())\r\n if((Y-X)>=2):\r\n cnt = cnt+1\r\nprint(cnt)", "n = input()\nn = int(n)\nroom = 0\nfor i in range (1,n+1):\n p,q = input().split()\n p=int(p)\n q=int(q)\n if q-p>=2:\n room = room + 1\nprint(room)\n \t\t \t\t\t \t\t \t\t\t\t \t\t", "n = int(input())\r\nmylist = [[int(i) for i in input().split()] for j in range(n)]\r\ncount = 0\r\nfor i in range(n):\r\n if mylist[i][1] - mylist[i][0] >= 2:\r\n count += 1\r\nprint(count)", "numbers = int(input())\r\nroom = []\r\nrooms = 0\r\nfor i in range(numbers):\r\n room = input().split(' ')\r\n if int(room[1]) - 2 >= int(room[0]):\r\n rooms += 1\r\nprint(rooms)", "# Read input\r\nn = int(input())\r\n\r\n# Initialize a variable to count rooms with free space\r\ncount = 0\r\n\r\n# Iterate through the rooms\r\nfor _ in range(n):\r\n pi, qi = map(int, input().split())\r\n \r\n # Check if there is enough free space for both George and Alex\r\n if qi - pi >= 2:\r\n count += 1\r\n\r\n# Print the number of rooms with free space\r\nprint(count)\r\n", "# -*- coding: utf-8 -*-\n\"\"\"467A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YAcE_C3NXDvEY0NY_rHyte8StemSWBIK\n\"\"\"\n\nn=int(input())\ncount=0\nfor i in range(n):\n a,b=map(int,input().split())\n if (b-a)>=2:\n count+=1\nprint(count)", "n = int(input())\r\nk = 0\r\nfor _ in range(n):\r\n x,y = map(int, input().split())\r\n if y - x >= 2:\r\n k+=1 \r\nprint(k)", "c=0\r\nfor i in range(int(input())):\r\n a,b=[int(i) for i in input().split()]\r\n if(b-a>=2):\r\n c+=1\r\nprint(c)", "floors=int(input())\r\nroom_cap=[]\r\nfor i in range(0,floors):\r\n room_cap.append(input().split())\r\noutput=0\r\nfor i in room_cap:\r\n output+=(1if(int(i[1])-int(i[0])>=2)else 0)\r\nprint(output)", "t=int(input())\r\ncount=0\r\nwhile t>0:\r\n\tt=t-1\r\n\ti,j=map(int,input().split())\r\n\tif i+2<=j:\r\n\t\tcount=count+1\r\nprint(count)", "n=int(input())\r\ncnt=0\r\nfor i in range(n):\r\n a,b=input().split()\r\n a=int(a)\r\n b=int(b)\r\n if((b-a)>=2):\r\n cnt+=1\r\nprint(cnt)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n l=list(map(int,input().strip().split()))\r\n p=l[0]\r\n q=l[1]\r\n if q-p>=2:\r\n count=count+1\r\nprint(count)", "n=int(input())\nc=0\nfor i in range(1,n+1):\n p,q =input().split()\n p=int(p)\n q=int(q)\n if p+2<=q:\n c += 1\nprint(c)\n\n\n\n\n \t\t\t\t\t \t \t\t \t\t\t\t\t \t \t \t\t\t \t", "n=int(input())\ncount=0\n\nfor i in range(n):\n a, b=map(int, input().split())\n \n if b-a>=2:\n count+=1\nprint(count)", "# your code goes here\r\nn=int(input())\r\nres=0\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\tif (b-a) >= 2:\r\n\t\tres+=1\r\nprint(res)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n o, a = input().split()\r\n o = int(o)\r\n a = int(a)\r\n if a-o >= 2:\r\n count +=1\r\n \r\nprint(count)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n z=list(map(int,input().split()))\r\n if z[1]-2>=z[0]:\r\n count+=1\r\nprint(count)", "# LUOGU_RID: 133152194\na = int(input())\r\nf = 0\r\nfor i in range(1,a+1):\r\n b = input().split()\r\n c = int(b[0])\r\n d = int(b[1])\r\n e = d-c\r\n if e >= 2:\r\n f += 1\r\nprint(f)\r\n", "d = int(input())\r\nr = 0\r\nfor i in range(d):\r\n p,q = map(int,input().split())\r\n if p<q and q-p >= 2:\r\n r += 1\r\nprint(r)", "\r\n\r\n\r\ndef i():\r\n return(int(input()))\r\ndef l():\r\n return(list(map(int,input().split())))\r\ndef s():\r\n s = input()\r\n return(s)\r\ndef sl():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef m():\r\n return(map(int,input().split()))\r\n\r\n\r\nn = i()\r\nc = 0\r\n\r\nfor _ in range(n):\r\n a, b = m()\r\n if abs(a - b) >= 2:\r\n c += 1\r\nprint(c)", "n=int(input())\r\ncnt=0\r\nfor i in range(n):\r\n i=list(map(int,input().split()))\r\n cnt=cnt+1 if i[1]-i[0]>=2 else cnt\r\nprint(cnt)", "n=int(input())\r\nvacancy=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n if q-p>=2:\r\n vacancy+=1\r\n else:\r\n continue\r\nprint(vacancy)\r\n", "count=0\r\nfor i in range(int(input())):\r\n p,q=map(int,input().split())\r\n if p<=(q-2):\r\n count+=1\r\n else:\r\n count+=0\r\nprint(count)", "cnt=0\r\n\r\na=int(input())\r\nfor j in range(a):\r\n b,c=map(int,input().split())\r\n if c-b>=2:\r\n cnt=cnt+1\r\n\r\nprint(cnt)", "n = int(input()) # Total number of rooms\nrooms = []\n\nfor _ in range(n):\n p, q = map(int, input().split()) # Number of people in the room and room capacity\n rooms.append((p, q))\n\ncount = 0\n\nfor room in rooms:\n p, q = room\n if q - p >= 2:\n count += 1\n\nprint(count)\n \t\t\t\t \t\t\t \t\t\t \t \t \t \t\t\t\t \t", "#467A\r\nn = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n p,q = list(map(int,input().split()))\r\n if q-2 >= p:\r\n cnt += 1\r\nprint(cnt)", "k=0\r\nfor i in range(int(input())):\r\n m,n=map(int,input().split())\r\n if n-m>=2:\r\n k+=1\r\nprint(k)", "n = int(input())\r\nk = 0\r\n\r\nfor i in range(n):\r\n p, q = map(int, input().split())\r\n if p < (q - 1):\r\n k += 1\r\n\r\nprint(k)", "c = 0\r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n if abs(a-b) >=2:\r\n c+=1\r\nprint(c)", "counter=0\r\nn=int(input())\r\nwhile n>0:\r\n p,q=map(int,input().split())\r\n if (q-p)>=2:\r\n counter+=1\r\n n-=1\r\nprint(counter)", "n = int(input())\ncounter = 0\nfor i in range(0,n):\n p,q = input().split()\n p = int(p)\n q = int(q)\n if p+2 <= q:\n counter += 1\nprint(counter)\n\t \t \t\t\t\t \t\t\t \t\t\t \t \t\t\t\t\t\t\t \t", "c = 0\r\nfor _ in range(int(input())):\r\n a,b = list(map(int, input().split()))\r\n if(a+2 <= b):\r\n c += 1\r\nprint(c)", "n=int(input())\n\nrooms=0\nfor i in range(n):\n a,b=input().split()\n a=int(a)\n b=int(b)\n if(b-a>=2):\n rooms+=1\n\n\n\nprint(rooms)\n\n\t \t\t\t \t\t \t \t \t\t \t\t \t \t", "k = 0\r\nfor i in range(int(input())):\r\n a,b = map(int, input().split())\r\n if b-a >= 2:\r\n k += 1\r\nprint(k)\r\n", "n = int(input())\r\navailable_rooms=0\r\n\r\nfor i in range(n):\r\n roommates,capacity = map(int,input().split())\r\n\r\n if capacity-roommates>=2:\r\n available_rooms+=1\r\n\r\nprint(available_rooms)", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n a,b = list(map(int,input().split()))\r\n if b - a >= 2:\r\n k+=1\r\nprint(k)", "n = int(input())\ncounter = 0\ni=1\nwhile i <= n:\n p, q = input().split()\n p = int(p)\n q = int(q)\n if p + 2 <= q:\n counter += 1\n i+=1\nprint(counter)\n\t \t\t \t \t\t \t \t \t\t\t\t \t \t", "a=int(input())\r\nans=0\r\nfor i in range(a):\r\n m,n=map(int,input().split(' '))\r\n if n-m>=2:\r\n ans+=1\r\nprint(ans)", "def george_and_alex(n):\r\n count = 0\r\n for i in range(n):\r\n pi, qi = map(int, input().split())\r\n if pi + 2 <= qi:\r\n count += 1\r\n\r\n return count\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n print(george_and_alex(n))", "n = int(input())\r\ncounter = 0\r\n\r\nfor i in range(0,n):\r\n pi,qi = input().split()\r\n pi = int(pi)\r\n qi = int(qi)\r\n if qi - pi>=2:\r\n counter+= 1\r\nprint(counter)", "n = int(input())\r\nc = 0\r\nfor i in range(n):\r\n p, q = list(map(int,input().split()))\r\n s = q - p\r\n if s >= 2:\r\n c += 1\r\nprint(c)", "ct=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if b-a>1:\r\n ct+=1\r\nprint(ct)", "n = int(input())\navailable = 0\nfor i in range(n):\n p,q = map(int, input().split())\n if q-p >= 2:\n available += 1\nprint(available)", "cnt = 0\r\nfor i in range(int(input())):\r\n pi, qi = map(int,input().split())\r\n if qi - pi > 1:\r\n cnt += 1\r\nprint(cnt)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n p, q = [int(el) for el in input().split()]\r\n if p+2 <= q:\r\n count+=1\r\nprint(count)", "a=int(input())\r\nr=0\r\nfor x in range(a):\r\n s,d=list(map(int,input().split()))\r\n if(abs(s-d)>=2):\r\n r+=1\r\nprint(r)", "n=int(input())\ns=0\nfor i in range(n):\n p,q=list(map(int,input().split()))\n s+=(q-p>=2)\nprint(s)", "room_num=int(input())\r\nroom_for_living=0\r\nfor i in range(room_num):\r\n p,q=[int(x) for x in input().split()]\r\n if q-p >= 2:\r\n room_for_living+=1\r\nprint(room_for_living)", "# Online Python compiler (interpreter) to run Python online.\r\n# Write Python 3 code in this online editor and run it.\r\nn=int(input())\r\nc=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if b-a>=2:\r\n c+=1\r\nprint(c)", "a,z=int(input()),0\r\nfor i in range(a):\r\n n,m=map(int,input().split())\r\n if m-2>=n:\r\n z+=1\r\nprint(z)", "n = int(input())\r\n\r\ni = 1\r\nsum = 0\r\n\r\nwhile i<=n:\r\n p,q = input().split()\r\n p = int(p)\r\n q = int(q)\r\n if (q-p)>=2:\r\n sum +=1\r\n i+=1\r\n \r\nprint(sum)", "cnt=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a==b:\r\n continue\r\n elif b>=2 and b-a>=2:\r\n cnt=cnt+1\r\nprint(cnt)", "n = input()\nn = int(n)\nb = 0\nfor i in range (0,n):\n x , y = input().split()\n x = int(x)\n y = int(y)\n if((y-x)>=2):\n b = b+1\nprint(b)\n\n\n \t\t \t\t \t \t\t\t\t \t\t \t\t \t\t \t\t", "length = int(input())\ncount = 0\nfor _ in range(length):\n nm = list(map(int, input().split(' ')))\n if nm[1] - nm[0] >= 2:\n count+=1\nprint(count)\n \n\n\n", "n = int(input())\r\nnum = []\r\nfor n in range(n):\r\n text = input().split()\r\n num.append(text)\r\nac = [i for i in num if int(i[1]) - int(i[0]) >= 2]\r\nprint(len(ac))\r\n", "n = int(input())\r\nc = 0\r\nfor _ in range(n):\r\n i = input().split(\" \")\r\n if (int(i[1]) - int(i[0])) >= 2:\r\n c += 1\r\n\r\nprint(c)\r\n", "n = int(input()) # Number of rooms\r\ncount = 0\r\n\r\nfor i in range(n):\r\n p, q = map(int, input().split()) # Number of people in the room and the room's capacity\r\n if q - p >= 2: # There should be at least 2 free places\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\nb = 0\r\nfor i in range(n):\r\n a,c = map(int, input().split())\r\n if c - a >= 2:\r\n b +=1\r\n else:\r\n b += 0\r\nprint(b)\r\n", "r=int(input())\r\nc=0\r\nfor i in range(r):\r\n n=input().split(' ')\r\n if int(n[0])+2<=int(n[1]):\r\n c+=1\r\nprint(c)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n p,q = list(map(int,input().split()))\r\n if q - p >= 2:\r\n count = count + 1\r\nprint(count)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n p, v = map(int, input().split())\r\n if v - p >= 2:\r\n ans += 1\r\nprint(ans)", "print(sum(y - x >= 2 for _ in range(int(input())) for x, y in [map(int, input().split())]))", "n = int(input())\r\nrooms = 0\r\n\r\nfor i in range(n):\r\n p, q = map(int, input().split())\r\n if p+2 <= q:\r\n rooms += 1\r\n\r\nprint(rooms)" ]

{"inputs": ["3\n1 1\n2 2\n3 3", "3\n1 10\n0 10\n10 10", "2\n36 67\n61 69", "3\n21 71\n10 88\n43 62", "3\n1 2\n2 3\n3 4", "10\n0 10\n0 20\n0 30\n0 40\n0 50\n0 60\n0 70\n0 80\n0 90\n0 100", "13\n14 16\n30 31\n45 46\n19 20\n15 17\n66 67\n75 76\n95 97\n29 30\n37 38\n0 2\n36 37\n8 9", "19\n66 67\n97 98\n89 91\n67 69\n67 68\n18 20\n72 74\n28 30\n91 92\n27 28\n75 77\n17 18\n74 75\n28 30\n16 18\n90 92\n9 11\n22 24\n52 54", "15\n55 57\n95 97\n57 59\n34 36\n50 52\n96 98\n39 40\n13 15\n13 14\n74 76\n47 48\n56 58\n24 25\n11 13\n67 68", "17\n68 69\n47 48\n30 31\n52 54\n41 43\n33 35\n38 40\n56 58\n45 46\n92 93\n73 74\n61 63\n65 66\n37 39\n67 68\n77 78\n28 30", "14\n64 66\n43 44\n10 12\n76 77\n11 12\n25 27\n87 88\n62 64\n39 41\n58 60\n10 11\n28 29\n57 58\n12 14", "38\n74 76\n52 54\n78 80\n48 49\n40 41\n64 65\n28 30\n6 8\n49 51\n68 70\n44 45\n57 59\n24 25\n46 48\n49 51\n4 6\n63 64\n76 78\n57 59\n18 20\n63 64\n71 73\n88 90\n21 22\n89 90\n65 66\n89 91\n96 98\n42 44\n1 1\n74 76\n72 74\n39 40\n75 76\n29 30\n48 49\n87 89\n27 28", "100\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0", "26\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2", "68\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2\n0 2", "7\n0 1\n1 5\n2 4\n3 5\n4 6\n5 6\n6 8", "1\n0 0", "1\n100 100", "44\n0 8\n1 11\n2 19\n3 5\n4 29\n5 45\n6 6\n7 40\n8 19\n9 22\n10 18\n11 26\n12 46\n13 13\n14 27\n15 48\n16 25\n17 20\n18 29\n19 27\n20 45\n21 39\n22 29\n23 39\n24 42\n25 37\n26 52\n27 36\n28 43\n29 35\n30 38\n31 70\n32 47\n33 38\n34 61\n35 71\n36 51\n37 71\n38 59\n39 77\n40 70\n41 80\n42 77\n43 73", "3\n1 3\n2 7\n8 9", "53\n0 1\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 15\n15 16\n16 17\n17 18\n18 19\n19 20\n20 21\n21 22\n22 23\n23 24\n24 25\n25 26\n26 27\n27 28\n28 29\n29 30\n30 31\n31 32\n32 33\n33 34\n34 35\n35 36\n36 37\n37 38\n38 39\n39 40\n40 41\n41 42\n42 43\n43 44\n44 45\n45 46\n46 47\n47 48\n48 49\n49 50\n50 51\n51 52\n52 53", "55\n0 0\n1 1\n2 2\n3 3\n4 4\n5 5\n6 6\n7 7\n8 8\n9 9\n10 10\n11 11\n12 12\n13 13\n14 14\n15 15\n16 16\n17 17\n18 18\n19 19\n20 20\n21 21\n22 22\n23 23\n24 24\n25 25\n26 26\n27 27\n28 28\n29 29\n30 30\n31 31\n32 32\n33 33\n34 34\n35 35\n36 36\n37 37\n38 38\n39 39\n40 40\n41 41\n42 42\n43 43\n44 44\n45 45\n46 46\n47 47\n48 48\n49 49\n50 50\n51 51\n52 52\n53 53\n54 54", "51\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 62\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 73\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 82\n55 68\n55 70\n55 63\n55 55\n55 55\n55 55\n55 75\n55 75\n55 55\n55 55\n55 55\n55 55\n55 55\n55 55\n55 73\n55 55\n55 82\n55 99\n55 60", "14\n1 1\n1 1\n1 55\n1 16\n1 1\n1 1\n1 55\n1 62\n1 53\n1 26\n1 1\n1 36\n1 2\n1 3"], "outputs": ["0", "2", "2", "3", "0", "10", "4", "12", "10", "8", "7", "22", "0", "0", "68", "5", "0", "0", "42", "2", "0", "0", "12", "8"]}

UNKNOWN

PYTHON3

CODEFORCES

648

8d058a1cf69c59bf09f0190d5dc2e875

Football

One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into *n* teams and played several matches, two teams could not play against each other more than once. The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches. Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly *k* times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table. The first line contains two integers — *n* and *k* (1<=≤<=*n*,<=*k*<=≤<=1000). In the first line print an integer *m* — number of the played games. The following *m* lines should contain the information about all the matches, one match per line. The *i*-th line should contain two integers *a**i* and *b**i* (1<=≤<=*a**i*,<=*b**i*<=≤<=*n*; *a**i*<=≠<=*b**i*). The numbers *a**i* and *b**i* mean, that in the *i*-th match the team with number *a**i* won against the team with number *b**i*. You can assume, that the teams are numbered from 1 to *n*. If a tournir that meets the conditions of the problem does not exist, then print -1. Sample Input 3 1 Sample Output 3 1 2 2 3 3 1

[ "\ndef solve():\n\tn,k = map(int,input().split())\n\tparent = [set() for i in range(n+1)]\n\tans = []\n\tfor i in range(1,n+1):\n\t\tK = k\n\t\tfor j in range(1,n+1):\n\t\t\tif i!=j and j not in parent[i]:\n\t\t\t\tparent[j].add(i)\n\t\t\t\tans.append((i,j))\n\t\t\t\tK-=1\n\t\t\tif K==0:\n\t\t\t\tbreak\n\t\telse:\n\t\t\tprint(-1)\n\t\t\treturn\n\tprint(n*k)\n\tfor i in ans:\n\t\tprint(*i)\n\n\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", "from collections import defaultdict\r\nn, k = list(map(int, input().split()))\r\n\r\nadj = defaultdict(list)\r\ngames = 0\r\nbr = False\r\nfor i in range(1, n+1):\r\n count = 0\r\n for j in range(1, n+1):\r\n if count == k: break\r\n if i == j: continue\r\n if not i in adj[j]:\r\n adj[i].append(j)\r\n games += 1\r\n count += 1\r\n \r\n if count < k:\r\n br = True\r\n print(-1)\r\n break\r\n \r\nif not br:\r\n print(games)\r\n for team in adj:\r\n for i in adj[team]:\r\n print(team, i)", "def solve():\r\n y=input()\r\n y=y.split(\" \")\r\n n=int(y[0])\r\n k=int(y[1])\r\n if(n/2<=k):\r\n print(-1)\r\n return\r\n \r\n \r\n m={}\r\n \r\n \r\n for i in range(1,n+1):\r\n m[i]=[]\r\n j=1\r\n while(len(m[i])<k and j<=n):\r\n if i==j:\r\n j+=1\r\n continue\r\n if j in m:\r\n if i not in m[j]:\r\n m[i].append(j)\r\n j+=1\r\n continue\r\n \r\n else:\r\n m[i].append(j)\r\n j+=1\r\n continue\r\n \r\n j+=1\r\n \r\n \r\n print(n*k)\r\n \r\n for i in m:\r\n for elem in m[i]:\r\n print(i,elem)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\nI = lambda : int(sys.stdin.buffer.readline())\r\nNeo = lambda : list(map(int, sys.stdin.buffer.readline().split()))\r\nn,k = Neo()\r\nif 2*k > n-1:\r\n print(-1)\r\nelse:\r\n print(n*k)\r\n for i in range(1,n+1):\r\n for j in range(i+1,k+i+1):\r\n if j > n:\r\n j = j%n\r\n print(i,j) ", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n nTeams, nWins = map(int, input().split())\r\n if nWins*2 >= nTeams:\r\n return '-1'\r\n\r\n return matchesWith(nTeams, nWins)\r\n\r\n\r\ndef matchesWith(nTeams, nWins):\r\n teamsIndices = range(1, nTeams+1)\r\n teams = tuple(map(str, teamsIndices))\r\n teams += teams[:nWins]\r\n matches = []\r\n for i, iNext in zip(range(nTeams), teamsIndices):\r\n for j in range(iNext, iNext+nWins):\r\n matches.append(f'{teams[i]} {teams[j]}')\r\n\r\n return f'{len(matches)}\\n' + '\\n'.join(matches)\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n", "n,k = map(int, input().split()) \r\nif 2*k+1>n:\r\n\tprint(-1)\r\nelse:\r\n\tprint(n*k)\r\n\tfor i in range(n):\r\n\t\tfor j in range(k):\r\n\t\t\tprint(i+1,(i+1+j)%n+1)", "import sys\n\nf = sys.stdin\n\nn, k = map(int, f.readline().strip().split())\n\n\n\nif 2*k>(n-1):\n\n print('-1')\n\nelse: \n\n r = [str(n*k)]\n\n for i in range(n):\n\n for j in range(k):\n\n r.append(str(i+1) + ' ' + str((i+j+1)%n+1)) \n\n print('\\n'.join(r))\n\n\n\n\n\n\n\n# Made By Mostafa_Khaled", "n,k = map(int,input().split(\" \"))\r\nif 2*k + 1 > n:\r\n print(-1)\r\nelse:\r\n print(n*k)\r\n for i in range(1,n+1):\r\n for j in range(0,k):\r\n print(i, (i+j)%n + 1)\r\n ", "n,k=map(int,input().split(\" \"))\r\nif (n%2==0 and k>n//2 - 1) or (n%2==1 and k>n//2):\r\n print(-1)\r\nelse:\r\n print(n*k)\r\n for i in range(n):\r\n for j in range(k):\r\n if i+j+2>n:\r\n print(i+1,i+j+2-n)\r\n else:\r\n print(i+1,i+j+2)\r\n", "n,k = map(int,input().split())\r\nif 2*k>n-1:\r\n print(-1)\r\nelse:\r\n print(n*k)\r\n for i in range(1,n+1):\r\n for j in range(i+1,i+k+1):\r\n y = -1\r\n if j>n:\r\n y = j-n\r\n else:\r\n y = j\r\n print(i,y)", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nif(n<2*k+1):\r\n print(-1)\r\n \r\nelse :\r\n print(n*k)\r\n for i in range(1,n+1):\r\n for j in range(k):\r\n print(i,(i+j)%n+1)", "n,k=map(int,input().split())\r\nif(k>(n-1)//2):\r\n print(-1)\r\nelse:\r\n print(n*k)\r\n for i in range(1,n+1):\r\n for j in range(k):\r\n print(i,(i+j)%n+1)\r\n", "s,b=map(int,input().split())\r\nif b*s > s*(s-1)//2:\r\n\tprint(-1)\r\n\texit(0)\r\nprint(s*b)\r\nd=[]\r\nfor i in range(1,b+1):\r\n\tfor j in range(s):\r\n\t\td.append(\"%d %d\"%(1+j,1+(j+i)%s))\r\nprint(\"\\n\".join(d))\r\n'''\r\ncode always run\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\n\r\nn,k = ilele()\r\nif not(2*k <= n-1):\r\n print(-1)\r\nelse:\r\n print(n*k)\r\n for i in range(1,n+1):\r\n for j in range(i+1,i+1+k):\r\n if j > n:\r\n j = j - n\r\n print(i,j)", "#code by AanchalTiwari\r\nn, k = map(int, input().split())\r\nif n < 2 * k + 1:\r\n print(-1)\r\nelse:\r\n print(n*k)\r\n for i in range(1, n + 1):\r\n c = 1\r\n while c <= k:\r\n a = i\r\n b = i+c\r\n if i + c > n:\r\n a = i\r\n b = (i+c) % n\r\n print(a, b)\r\n c = c + 1\r\n", "import sys\r\nn,k=map(int,sys.stdin.readline().split())\r\na=n*(n-1)//2\r\nif(n*k>a):\r\n sys.stdout.write('-1')\r\nelse:\r\n sys.stdout.write(str(n*k)+'\\n')\r\n for i in range(1,n+1):\r\n for j in range(k):\r\n s=str(i)+' '+str((i+j)%n+1)+'\\n'\r\n sys.stdout.write(s)\r\n" ]

{"inputs": ["3 1", "7 3", "4 1", "5 2", "5 2", "11 6", "11 5", "1 1", "2 1", "3 1", "1 2", "2 2", "3 2", "531 265", "775 388", "648 581", "57 13", "131 65", "609 305", "197 182", "248 54", "137 68", "47 24", "947 868", "205 50", "863 431", "445 223", "786 393", "122 52", "629 314", "571 286", "980 680", "869 239", "999 499", "999 500", "1000 751", "1000 162", "1000 936", "1000 178", "1000 499", "999 499", "1 1", "2 1", "4 2", "6 3", "10 5", "999 2", "1000 490"], "outputs": ["3\n1 2\n2 3\n3 1", "21\n1 2\n1 3\n1 4\n2 3\n2 4\n2 5\n3 4\n3 5\n3 6\n4 5\n4 6\n4 7\n5 6\n5 7\n5 1\n6 7\n6 1\n6 2\n7 1\n7 2\n7 3", "4\n1 2\n2 3\n3 4\n4 1", "10\n1 2\n1 3\n2 3\n2 4\n3 4\n3 5\n4 5\n4 1\n5 1\n5 2", "10\n1 2\n1 3\n2 3\n2 4\n3 4\n3 5\n4 5\n4 1\n5 1\n5 2", "-1", "55\n1 2\n1 3\n1 4\n1 5\n1 6\n2 3\n2 4\n2 5\n2 6\n2 7\n3 4\n3 5\n3 6\n3 7\n3 8\n4 5\n4 6\n4 7\n4 8\n4 9\n5 6\n5 7\n5 8\n5 9\n5 10\n6 7\n6 8\n6 9\n6 10\n6 11\n7 8\n7 9\n7 10\n7 11\n7 1\n8 9\n8 10\n8 11\n8 1\n8 2\n9 10\n9 11\n9 1\n9 2\n9 3\n10 11\n10 1\n10 2\n10 3\n10 4\n11 1\n11 2\n11 3\n11 4\n11 5", "-1", "-1", "3\n1 2\n2 3\n3 1", "-1", "-1", "-1", "140715\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "-1", "-1", "741\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n4 5\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n4 16\n4 17\n5 6\n5 7\n5 8\n5 9\n5 10\n5 11\n5 12\n5 13\n5 14\n5 15\n5 16\n5 17\n5 18\n6 7\n6 8\n6 9\n6 10\n6 11\n6 12\n6 13\n6 14\n6 15\n6 16\n6 17\n6 18\n6 19\n7 8\n7 9\n7 10\n7 11\n7 12\n7 13\n7 14\n7 15\n7 16\n7 17\n7 18\n7 19\n7...", "8515\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24...", "-1", "-1", "13392\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 3...", "9316\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21...", "-1", "-1", "10250\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n2 38\n2 3...", "371953\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "-1", "-1", "6344\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37...", "197506\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "-1", "-1", "207691\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "498501\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "-1", "-1", "162000\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "-1", "178000\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "499000\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "498501\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1...", "-1", "-1", "-1", "-1", "-1", "1998\n1 2\n1 3\n2 3\n2 4\n3 4\n3 5\n4 5\n4 6\n5 6\n5 7\n6 7\n6 8\n7 8\n7 9\n8 9\n8 10\n9 10\n9 11\n10 11\n10 12\n11 12\n11 13\n12 13\n12 14\n13 14\n13 15\n14 15\n14 16\n15 16\n15 17\n16 17\n16 18\n17 18\n17 19\n18 19\n18 20\n19 20\n19 21\n20 21\n20 22\n21 22\n21 23\n22 23\n22 24\n23 24\n23 25\n24 25\n24 26\n25 26\n25 27\n26 27\n26 28\n27 28\n27 29\n28 29\n28 30\n29 30\n29 31\n30 31\n30 32\n31 32\n31 33\n32 33\n32 34\n33 34\n33 35\n34 35\n34 36\n35 36\n35 37\n36 37\n36 38\n37 38\n37 39\n38 39\n38 40\n39 40\n...", "490000\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n1 85\n1 86\n1..."]}

UNKNOWN

PYTHON3

CODEFORCES

16

8d337c19b31a325a4e2c5679c23c0f2a

Fools and Roads

They say that Berland has exactly two problems, fools and roads. Besides, Berland has *n* cities, populated by the fools and connected by the roads. All Berland roads are bidirectional. As there are many fools in Berland, between each pair of cities there is a path (or else the fools would get upset). Also, between each pair of cities there is no more than one simple path (or else the fools would get lost). But that is not the end of Berland's special features. In this country fools sometimes visit each other and thus spoil the roads. The fools aren't very smart, so they always use only the simple paths. A simple path is the path which goes through every Berland city not more than once. The Berland government knows the paths which the fools use. Help the government count for each road, how many distinct fools can go on it. Note how the fools' paths are given in the input. The first line contains a single integer *n* (2<=≤<=*n*<=≤<=105) — the number of cities. Each of the next *n*<=-<=1 lines contains two space-separated integers *u**i*,<=*v**i* (1<=≤<=*u**i*,<=*v**i*<=≤<=*n*, *u**i*<=≠<=*v**i*), that means that there is a road connecting cities *u**i* and *v**i*. The next line contains integer *k* (0<=≤<=*k*<=≤<=105) — the number of pairs of fools who visit each other. Next *k* lines contain two space-separated numbers. The *i*-th line (*i*<=><=0) contains numbers *a**i*,<=*b**i* (1<=≤<=*a**i*,<=*b**i*<=≤<=*n*). That means that the fool number 2*i*<=-<=1 lives in city *a**i* and visits the fool number 2*i*, who lives in city *b**i*. The given pairs describe simple paths, because between every pair of cities there is only one simple path. Print *n*<=-<=1 integer. The integers should be separated by spaces. The *i*-th number should equal the number of fools who can go on the *i*-th road. The roads are numbered starting from one in the order, in which they occur in the input. Sample Input 5 1 2 1 3 2 4 2 5 2 1 4 3 5 5 3 4 4 5 1 4 2 4 3 2 3 1 3 3 5 Sample Output 2 1 1 1 3 1 1 1

[ "import sys\r\n\r\nMAX_H = 30\r\n\r\ninput = sys.stdin.readline\r\noutput = lambda x: sys.stdout.write(x)\r\n\r\nclass Node:\r\n def __init__(self):\r\n self.pars = []\r\n self.conn = {}\r\n self.count = 0\r\n self.depth = 0\r\n\r\n# input\r\nn = int(input())\r\n\r\nnodes = [Node() for _ in range(n + 1)]\r\n\r\n# roads\r\nfor ri in range(n - 1):\r\n u, v = map(int, input().split())\r\n nodes[u].conn[v] = ri\r\n nodes[v].conn[u] = ri\r\n\r\n# pairs\r\npairs = []\r\nk = int(input())\r\nfor _ in range(k):\r\n pairs.append(tuple(map(int, input().split())))\r\n \r\n# input done\r\n\r\n# root tree at 1\r\nstack = [1]\r\nwhile len(stack) > 0:\r\n curr = stack.pop()\r\n cn = nodes[curr]\r\n for o, r in cn.conn.items():\r\n stack.append(o)\r\n on = nodes[o]\r\n del on.conn[curr]\r\n on.depth = cn.depth + 1\r\n on.pars.append(curr)\r\n\r\n# calculate binary jumps\r\nfor jh in range(1, MAX_H):\r\n for i in range(1, n + 1):\r\n cn = nodes[i]\r\n if len(cn.pars) >= jh:\r\n par = nodes[cn.pars[jh - 1]]\r\n if len(par.pars) >= jh:\r\n cn.pars.append(par.pars[jh - 1])\r\n\r\ndef lca(a, b):\r\n # equalize depth\r\n if nodes[a].depth > nodes[b].depth:\r\n a, b = b, a\r\n \r\n dd = nodes[b].depth - nodes[a].depth\r\n for h in range(MAX_H):\r\n if dd & (1 << h):\r\n b = nodes[b].pars[h]\r\n\r\n if a == b:\r\n return a\r\n\r\n # find nodes a layer below the lca\r\n for h in range(MAX_H)[::-1]:\r\n if h < len(nodes[a].pars):\r\n pa = nodes[a].pars[h]\r\n pb = nodes[b].pars[h]\r\n if pa != pb:\r\n a = pa\r\n b = pb\r\n \r\n return nodes[a].pars[0]\r\n \r\nfor a, b in pairs:\r\n nodes[a].count += 1\r\n nodes[b].count += 1\r\n nodes[lca(a, b)].count -= 2\r\n\r\nroads = [0 for _ in range(n - 1)]\r\nstack = [(1, 0)]\r\nwhile len(stack) > 0:\r\n curr, state = stack.pop()\r\n cn = nodes[curr]\r\n \r\n if state == 0:\r\n stack.append((curr, 1))\r\n for o in cn.conn:\r\n stack.append((o, 0))\r\n else:\r\n for o, r in cn.conn.items():\r\n oc = nodes[o].count\r\n cn.count += oc\r\n roads[r] = oc\r\n\r\noutput(\" \".join(map(str, roads)))\r\noutput(\"\\n\")\r\n \r\n", "from io import BytesIO, IOBase\r\nimport sys\r\nimport os\r\n\r\n# import time\r\nimport bisect\r\n# import functools\r\nimport math\r\nimport random\r\n# import re\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom functools import cmp_to_key, lru_cache, reduce\r\nfrom heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\nfrom itertools import accumulate, combinations, permutations, count, product\r\nfrom operator import add, iand, ior, itemgetter, mul, xor\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom typing import *\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\nBUFSIZE = 5096\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\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 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\r\nsys.stdin = IOWrapper(sys.stdin)\r\nsys.stdout = IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef I():\r\n return input()\r\n\r\ndef II():\r\n return int(input())\r\n\r\ndef MII():\r\n return map(int, input().split())\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\ninf = float('inf')\r\n\r\n# from types import GeneratorType\r\n\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n\r\n# RANDOM = random.getrandbits(32)\r\n\r\n# class Wrapper_str(str):\r\n# def __init__(self, x):\r\n# str.__init__(x)\r\n\r\n# def __hash__(self):\r\n# return super(Wrapper_str, self).__hash__() ^ RANDOM\r\n\r\n# class Wrapper_tuple(tuple):\r\n# def __init__(self, x):\r\n# tuple.__init__(x)\r\n\r\n# def __hash__(self):\r\n# return super(Wrapper_tuple, self).__hash__() ^ RANDOM\r\n\r\n# class Wrapper_int(int):\r\n# def __init__(self, x):\r\n# int.__init__(x)\r\n\r\n# def __hash__(self):\r\n# return super(Wrapper_int, self).__hash__() ^ RANDOM\r\n\r\nclass LCA:\r\n def __init__(self, g, root, f=max, ide_ele=0):\r\n # g[v]: (cost, u)\r\n self.n = len(g)\r\n self.root = root\r\n self.f = f\r\n self.ide_ele = ide_ele\r\n self.num = (self.n).bit_length()\r\n self.depth = [0]*self.n\r\n self.parent = [[-1]*self.n for i in range(self.num)]\r\n self.size = [1]*n\r\n \r\n s = [root]\r\n while s:\r\n v = s.pop()\r\n order.append(v)\r\n for u in g[v]:\r\n if u == self.parent[0][v]:\r\n continue\r\n self.parent[0][u] = v\r\n self.depth[u] = self.depth[v]+1\r\n s.append(u)\r\n order.reverse()\r\n for v in order:\r\n p = self.parent[0][v]\r\n if p != -1:\r\n self.size[p] += self.size[v]\r\n \r\n # doubling\r\n for k in range(self.num-1):\r\n for v in range(self.n):\r\n if self.parent[k][v] == -1:\r\n self.parent[k+1][v] = -1\r\n else:\r\n self.parent[k+1][v] = self.parent[k][self.parent[k][v]]\r\n \r\n def getLCA(self, u, v):\r\n if self.depth[u] > self.depth[v]:\r\n u, v = v, u\r\n for k in range(self.num):\r\n if ((self.depth[v]-self.depth[u]) >> k) & 1:\r\n v = self.parent[k][v]\r\n if u == v:\r\n return u\r\n \r\n for k in reversed(range(self.num)):\r\n if self.parent[k][u] != self.parent[k][v]:\r\n u = self.parent[k][u]\r\n v = self.parent[k][v]\r\n return self.parent[0][u]\r\n\r\n def getParent(self, u):\r\n return self.parent[0][u]\r\n \r\n def search(self, v, x):\r\n for k in reversed(range(self.num)):\r\n if (x>>k)&1:\r\n v = self.parent[k][v]\r\n return v\r\n\r\norder = []\r\nn = II()\r\n\r\nedges = []\r\npath = [[] for _ in range(n)]\r\nfor _ in range(n - 1):\r\n u, v = GMI()\r\n edges.append((u, v))\r\n path[u].append(v)\r\n path[v].append(u)\r\n\r\nlca = LCA(path, 0)\r\n\r\ndiff = [0] * (n + 1)\r\nq = II()\r\nfor _ in range(q):\r\n u, v = GMI()\r\n diff[u] += 1\r\n diff[v] += 1\r\n l = lca.getLCA(u, v)\r\n diff[l] -= 2\r\n\r\nfor i in order:\r\n diff[lca.getParent(i)] += diff[i]\r\n\r\nans = []\r\nfor u, v in edges:\r\n if lca.depth[u] > lca.depth[v]:\r\n ans.append(diff[u])\r\n else:\r\n ans.append(diff[v])\r\nprint(*ans)" ]

{"inputs": ["5\n1 2\n1 3\n2 4\n2 5\n2\n1 4\n3 5", "5\n3 4\n4 5\n1 4\n2 4\n3\n2 3\n1 3\n3 5"], "outputs": ["2 1 1 1 ", "3 1 1 1 "]}

UNKNOWN

PYTHON3

CODEFORCES

2

8d65492fc90cdeead7cd95db3a21418d

none

Young Teodor enjoys drawing. His favourite hobby is drawing segments with integer borders inside his huge [1;*m*] segment. One day Teodor noticed that picture he just drawn has one interesting feature: there doesn't exist an integer point, that belongs each of segments in the picture. Having discovered this fact, Teodor decided to share it with Sasha. Sasha knows that Teodor likes to show off so he never trusts him. Teodor wants to prove that he can be trusted sometimes, so he decided to convince Sasha that there is no such integer point in his picture, which belongs to each segment. However Teodor is lazy person and neither wills to tell Sasha all coordinates of segments' ends nor wills to tell him their amount, so he suggested Sasha to ask him series of questions 'Given the integer point *x**i*, how many segments in Fedya's picture contain that point?', promising to tell correct answers for this questions. Both boys are very busy studying and don't have much time, so they ask you to find out how many questions can Sasha ask Teodor, that having only answers on his questions, Sasha can't be sure that Teodor isn't lying to him. Note that Sasha doesn't know amount of segments in Teodor's picture. Sure, Sasha is smart person and never asks about same point twice. First line of input contains two integer numbers: *n* and *m* (1<=≤<=*n*,<=*m*<=≤<=100<=000) — amount of segments of Teodor's picture and maximal coordinate of point that Sasha can ask about. *i*th of next *n* lines contains two integer numbers *l**i* and *r**i* (1<=≤<=*l**i*<=≤<=*r**i*<=≤<=*m*) — left and right ends of *i*th segment in the picture. Note that that left and right ends of segment can be the same point. It is guaranteed that there is no integer point, that belongs to all segments. Single line of output should contain one integer number *k* – size of largest set (*x**i*,<=*cnt*(*x**i*)) where all *x**i* are different, 1<=≤<=*x**i*<=≤<=*m*, and *cnt*(*x**i*) is amount of segments, containing point with coordinate *x**i*, such that one can't be sure that there doesn't exist point, belonging to all of segments in initial picture, if he knows only this set(and doesn't know *n*). Sample Input 2 4 1 2 3 4 4 6 1 3 2 3 4 6 5 6 Sample Output 4 5

[ "import sys\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(100000)\r\nfrom collections import defaultdict, deque\r\nfrom itertools import permutations\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\nimport bisect\r\ndef lis(a):\r\n dp = [a[0]]\r\n l = [1]+[0]*(len(a)-1)\r\n for i in range(1, len(a)):\r\n if a[i] >= dp[-1]:\r\n dp.append(a[i])\r\n l[i] = len(dp)\r\n continue\r\n index = bisect.bisect_right(dp, a[i])\r\n l[i] = index + 1\r\n dp[index] = a[i]\r\n return l\r\n\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, m = II()\r\nx = [0] * (m+1)\r\nfor i in r(n):\r\n a, b = II()\r\n x[a] += 1\r\n if b < m:\r\n x[b+1] -= 1\r\nfor i in r(1,m+1):\r\n x[i] += x[i-1]\r\nx = x[1:]\r\nres = -1\r\nfor i , j in zip(lis(x), lis(x[::-1])[::-1]):\r\n res = max(i+j-1,res)\r\np(res)\r\n" ]

{"inputs": ["2 4\n1 2\n3 4", "4 6\n1 3\n2 3\n4 6\n5 6", "43 1319\n750 1030\n857 946\n941 1203\n407 1034\n947 1290\n546 585\n630 1201\n72 342\n693 1315\n34 719\n176 1097\n36 931\n198 973\n5 1025\n892 1054\n461 1287\n195 1273\n832 1039\n308 955\n642 866\n770 838\n440 777\n289 948\n98 814\n458 768\n82 265\n300 596\n182 706\n368 1225\n237 626\n36 348\n100 222\n46 937\n364 396\n288 668\n1158 1243\n31 1108\n570 1000\n435 619\n339 1007\n132 734\n281 441\n636 1319", "31 1600\n643 1483\n8 475\n15 472\n49 81\n300 1485\n627 682\n44 443\n1191 1541\n478 732\n1112 1202\n741 1341\n475 1187\n1218 1463\n523 1513\n355 477\n1259 1559\n384 928\n487 766\n227 1224\n1102 1268\n833 1240\n872 1342\n666 1075\n734 874\n32 880\n1411 1536\n520 778\n179 1003\n51 313\n1148 1288\n1467 1509", "38 1109\n61 332\n429 756\n260 272\n57 991\n420 985\n143 219\n399 925\n486 1079\n69 881\n75 447\n678 774\n973 1016\n983 1059\n518 1049\n393 853\n375 1101\n475 946\n300 427\n294 715\n504 798\n211 1066\n730 815\n114 515\n589 1001\n464 1014\n451 757\n370 1017\n225 619\n452 988\n611 955\n349 1029\n73 165\n759 951\n574 803\n253 1045\n545 565\n603 773\n226 453", "11 3\n1 1\n1 1\n1 1\n1 1\n2 2\n2 2\n2 2\n3 3\n3 3\n3 3\n3 3"], "outputs": ["4", "5", "1082", "1181", "996", "2"]}

UNKNOWN

PYTHON3

CODEFORCES

1

8d7482c6a683d3296ea22a704783715b

Om Nom and Necklace

One day Om Nom found a thread with *n* beads of different colors. He decided to cut the first several beads from this thread to make a bead necklace and present it to his girlfriend Om Nelly. Om Nom knows that his girlfriend loves beautiful patterns. That's why he wants the beads on the necklace to form a regular pattern. A sequence of beads *S* is regular if it can be represented as *S*<==<=*A*<=+<=*B*<=+<=*A*<=+<=*B*<=+<=*A*<=+<=...<=+<=*A*<=+<=*B*<=+<=*A*, where *A* and *B* are some bead sequences, "<=+<=" is the concatenation of sequences, there are exactly 2*k*<=+<=1 summands in this sum, among which there are *k*<=+<=1 "*A*" summands and *k* "*B*" summands that follow in alternating order. Om Nelly knows that her friend is an eager mathematician, so she doesn't mind if *A* or *B* is an empty sequence. Help Om Nom determine in which ways he can cut off the first several beads from the found thread (at least one; probably, all) so that they form a regular pattern. When Om Nom cuts off the beads, he doesn't change their order. The first line contains two integers *n*, *k* (1<=≤<=*n*,<=*k*<=≤<=1<=000<=000) — the number of beads on the thread that Om Nom found and number *k* from the definition of the regular sequence above. The second line contains the sequence of *n* lowercase Latin letters that represent the colors of the beads. Each color corresponds to a single letter. Print a string consisting of *n* zeroes and ones. Position *i* (1<=≤<=*i*<=≤<=*n*) must contain either number one if the first *i* beads on the thread form a regular sequence, or a zero otherwise. Sample Input 7 2 bcabcab 21 2 ababaababaababaababaa Sample Output 0000011000110000111111000011

[ "\ndef prefix_function(s: str):\n n = len(s)\n pi = [0] * n\n k = 0\n for i in range(1, n):\n while k > 0 and s[i] != s[k]:\n k = pi[k - 1]\n if s[i] == s[k]:\n k += 1\n pi[i] = k\n return pi\n\ndef z_function(s: str):\n n = len(s)\n z = [0] * n\n l, r = 0, 0\n for i in range(1, n):\n z[i] = 0 if i >= r else min(r - i, z[i - l])\n while i + z[i] < n and s[z[i]] == s[i + z[i]]:\n z[i] += 1\n if i + z[i] > r:\n l, r = i, i + z[i]\n return z\n\nn, k = map(int, input().split())\ns = input()\npi = prefix_function(s)\n\nans = [0] * n\nfor i in range(n):\n L = i + 1\n T = L - pi[i]\n have, remain = divmod(L, T)\n # print(L, T, have, remain)\n len_ab = have // k * T\n len_a = (have % k) * T + remain\n if len_ab >= len_a:\n ans[i] = 1\nprint(\"\".join(map(str, ans)))", "def readints():\r\n return map(int, input().split())\r\n\r\n# https://cp-algorithms.com/string/z-function.html#implementation\r\ndef z_function(n, s):\r\n z = [0] * n\r\n l, r = 0, 0\r\n for i in range(1, n):\r\n if i < r:\r\n z[i] = 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 = i\r\n r = i + z[i]\r\n return z\r\n\r\ndef modinv(a, m):\r\n x0, y0, z0 = 1, 0, m\r\n x1, y1, z1 = 0, 1, a\r\n while z1 != 1:\r\n c = z0 // z1\r\n x0, x1 = x1, x0 - c * x1\r\n y0, y1 = y1, y0 - c * y1\r\n z0, z1 = z1, z0 - c * z1\r\n ans = y1 % m\r\n if ans < 0:\r\n ans += m\r\n return ans\r\n\r\np = 31\r\nm = 10**9 + 9\r\n\r\nn, k = readints()\r\ns = [ord(c) - 96 for c in input()]\r\n\r\nif k == 1:\r\n print('1' * n)\r\n exit(0)\r\n\r\np_pow = [1]\r\nfor i in range(n):\r\n p_pow.append(p_pow[-1] * p % m)\r\n\r\nh = [s[0]]\r\nfor i in range(1, n):\r\n h.append((h[i - 1] + s[i] * p_pow[i]) % m)\r\n\r\ndef rep_hash(w, k):\r\n \"\"\"\r\n h[w - 1] * (1 + p^w + p^2w + ... + p^(k-1)w)\r\n h[w - 1] * ((p^w)^k - 1) / (p^w - 1)\r\n \"\"\"\r\n numer = pow(p_pow[w], k, m) - 1\r\n denom = p_pow[w] - 1\r\n return h[w - 1] * numer * modinv(denom, m) % m\r\n\r\nz = z_function(n, s)\r\nmatches = [0] * n\r\n\r\nw = 1\r\nwhile w * k <= n:\r\n if h[w * k - 1] == rep_hash(w, k):\r\n matches[w * k - 1] = 1\r\n if w * k < n:\r\n matches[w * k] += min(w, z[w * k])\r\n w += 1\r\n\r\nans = [0] * n\r\ncurr = 0\r\nfor i in range(n):\r\n curr = max(curr, matches[i])\r\n if curr > 0:\r\n ans[i] = 1\r\n curr -= 1\r\nprint(''.join(map(str, ans)))\r\n" ]

{"inputs": ["7 2\nbcabcab", "21 2\nababaababaababaababaa", "321 2\nabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaabaaba", "153 2\nabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaa", "2 1\nab", "2 2\nab", "2 3\nab", "5 6\naaaaa", "5 5\naaaaa", "5 4\naaaaa", "1 1\na", "1 2\na", "1 42\na"], "outputs": ["0000011", "000110000111111000011", "000001111001111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111", "000000011111000111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111", "11", "00", "00", "00000", "00001", "00011", "1", "0", "0"]}

UNKNOWN

PYTHON3

CODEFORCES

2

8d8fab3e7d35cb8634eaf569edcf87b7

Rain and Umbrellas

Polycarp lives on a coordinate line at the point $x = 0$. He goes to his friend that lives at the point $x = a$. Polycarp can move only from left to right, he can pass one unit of length each second. Now it's raining, so some segments of his way are in the rain. Formally, it's raining on $n$ non-intersecting segments, the $i$-th segment which is in the rain is represented as $[l_i, r_i]$ ($0 \le l_i < r_i \le a$). There are $m$ umbrellas lying on the line, the $i$-th umbrella is located at point $x_i$ ($0 \le x_i \le a$) and has weight $p_i$. When Polycarp begins his journey, he doesn't have any umbrellas. During his journey from $x = 0$ to $x = a$ Polycarp can pick up and throw away umbrellas. Polycarp picks up and throws down any umbrella instantly. He can carry any number of umbrellas at any moment of time. Because Polycarp doesn't want to get wet, he must carry at least one umbrella while he moves from $x$ to $x + 1$ if a segment $[x, x + 1]$ is in the rain (i.e. if there exists some $i$ such that $l_i \le x$ and $x + 1 \le r_i$). The condition above is the only requirement. For example, it is possible to go without any umbrellas to a point where some rain segment starts, pick up an umbrella at this point and move along with an umbrella. Polycarp can swap umbrellas while he is in the rain. Each unit of length passed increases Polycarp's fatigue by the sum of the weights of umbrellas he carries while moving. Can Polycarp make his way from point $x = 0$ to point $x = a$? If yes, find the minimum total fatigue after reaching $x = a$, if Polycarp picks up and throws away umbrellas optimally. The first line contains three integers $a$, $n$ and $m$ ($1 \le a, m \le 2000, 1 \le n \le \lceil\frac{a}{2}\rceil$) — the point at which Polycarp's friend lives, the number of the segments in the rain and the number of umbrellas. Each of the next $n$ lines contains two integers $l_i$ and $r_i$ ($0 \le l_i < r_i \le a$) — the borders of the $i$-th segment under rain. It is guaranteed that there is no pair of intersecting segments. In other words, for each pair of segments $i$ and $j$ either $r_i < l_j$ or $r_j < l_i$. Each of the next $m$ lines contains two integers $x_i$ and $p_i$ ($0 \le x_i \le a$, $1 \le p_i \le 10^5$) — the location and the weight of the $i$-th umbrella. Print "-1" (without quotes) if Polycarp can't make his way from point $x = 0$ to point $x = a$. Otherwise print one integer — the minimum total fatigue after reaching $x = a$, if Polycarp picks up and throws away umbrellas optimally. Sample Input 10 2 4 3 7 8 10 0 10 3 4 8 1 1 2 10 1 1 0 9 0 5 10 1 1 0 9 1 5 Sample Output 14 45 -1

[ "import sys,bisect\r\nfrom functools import cache\r\nread=lambda:map(int,sys.stdin.readline().split())\r\ndst,n,m=read()\r\nrain=sorted([[*read()] for _ in range(n)])\r\numb=sorted([[*read()] for _ in range(m)])+[[dst,dst]]\r\nif umb[0][0]>rain[0][0]:quit(print(-1))\r\n@cache\r\ndef dfs(i):\r\n if i==0:return 0\r\n cur=umb[i][0]\r\n ridx=bisect.bisect(rain,[cur])\r\n if ridx==0:return dfs(i-1)\r\n drop=min(cur,rain[ridx-1][1])\r\n res=0xFFFF0204\r\n for j in range(i):\r\n if drop>umb[j][0]:\r\n res=min(res,dfs(j)+umb[j][1]*(drop-umb[j][0]))\r\n return res\r\nprint(dfs(m))", "from collections import *\nfrom heapq import *\nfrom bisect import *\nfrom itertools import *\nfrom functools import *\nfrom math import *\nfrom string import *\nimport sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n target, n, m = map(int, input().split())\n\n rain = [False] * (target + 1)\n for _ in range(n):\n start, end = map(int, input().split())\n for i in range(start, end):\n rain[i] = True\n\n x = [0] * m\n w = [0] * m\n locs = [[inf, inf] for _ in range(target + 1)]\n\n for i in range(m):\n pos, weight = map(int, input().split())\n x[i] = pos\n w[i] = weight\n locs[x[i]] = min(locs[x[i]], [w[i], i])\n\n dp = [[inf] * (m + 1) for _ in range(target + 1)]\n dp[0][m] = 0\n\n for i in range(target):\n for j in range(m + 1):\n if dp[i][j] == inf:\n continue\n\n if not rain[i]:\n dp[i+1][m] = min(dp[i+1][m], dp[i][j])\n\n if j < m:\n dp[i+1][j] = min(dp[i+1][j], w[j] + dp[i][j])\n\n if locs[i][0] != inf:\n dp[i+1][locs[i][1]] = min(dp[i+1][locs[i][1]], dp[i][j] + locs[i][0])\n\n ans = min(dp[target])\n print(ans if ans < inf else -1)\n\n\nif __name__ == \"__main__\":\n main()\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nINF = 10 ** 15\r\na, n, m = map(int, input().split())\r\nrain = [0] * a\r\numb = [-1] * (a+1)\r\n\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n for i in range(l, r):\r\n rain[i] = 1\r\n\r\nfor _ in range(m):\r\n x, p = map(int, input().split())\r\n if umb[x] == -1 or umb[x] > p:\r\n umb[x] = p\r\n\r\ndp = [INF] * (a+1)\r\ndp[0] = 0\r\n\r\nfor i in range(a):\r\n if not rain[i]:\r\n dp[i+1] = min(dp[i+1], dp[i])\r\n if umb[i] == -1:\r\n continue\r\n if dp[i] == INF:\r\n continue\r\n\r\n cur = 0\r\n for j in range(i+1, a+1):\r\n cur += umb[i]\r\n dp[j] = min(dp[j], dp[i] + cur)\r\n\r\nans = dp[a]\r\nfor i in range(a-1, -1, -1):\r\n if rain[i]:\r\n break\r\n ans = min(ans, dp[i])\r\n\r\nprint(ans if ans != INF else -1)\r\n\r\n\r\n\r\n", "from collections import *\nfrom heapq import *\nfrom bisect import *\nfrom itertools import *\nfrom functools import *\nfrom math import *\nfrom string import *\nimport sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n target, n, m = map(int, input().split())\n\n l = [0] * n\n r = [0] * n\n for i in range(n):\n l[i], r[i] = map(int, input().split())\n\n x = [0] * m\n p = [0] * m\n for i in range(m):\n x[i], p[i] = map(int, input().split())\n\n rain = [False] * target\n for i in range(n):\n for j in range(l[i], r[i]):\n rain[j] = True\n\n dp = [[inf] * (m + 1) for _ in range(target + 1)]\n\n dp[0][m] = 0\n for j in range(m):\n if x[j] == 0:\n dp[0][j] = 0\n\n for i in range(target):\n if not rain[i]:\n dp[i + 1][m] = dp[i][m]\n\n for j in range(m):\n dp[i + 1][j] = dp[i][j] + p[j]\n dp[i + 1][m] = min(dp[i + 1][m], dp[i][j] + p[j])\n\n for j in range(m):\n if x[j] == i + 1:\n dp[i + 1][j] = min(dp[i + 1][j], dp[i + 1][m])\n\n ans = min(dp[target])\n print(ans if ans < inf else -1)\n\n\nif __name__ == \"__main__\":\n main()\n", "# https://codeforces.com/contest/988\r\n\r\nimport sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\na, n, m = map(int, input().split())\r\nrain = sorted(tuple(map(int, input().split())) for _ in range(n))\r\numbr = sorted(tuple(map(int, input().split())) for _ in range(m))\r\n\r\nif rain[0][0] < umbr[0][0]:\r\n print(-1)\r\n exit()\r\n\r\n# for each umbrella, find the rightmost rain segment [l, r] with l < umbrella position\r\nleft_rain = [-1] * m\r\nj = 0\r\nfor i in range(m):\r\n while j + 1 < n and rain[j + 1][0] < umbr[i][0]:\r\n j += 1\r\n if rain[j][0] < umbr[i][0]:\r\n left_rain[i] = j\r\n\r\ndp = [0] * m\r\nfor i in range(m - 1, -1, -1):\r\n dp[i] = (max(umbr[i][0], rain[-1][1]) - umbr[i][0]) * umbr[i][1]\r\n for j in range(i + 1, m):\r\n if left_rain[j] != -1 and rain[left_rain[j]][1] > umbr[i][0]:\r\n fatigue_i_j = (min(umbr[j][0], rain[left_rain[j]][1]) - umbr[i][0]) * umbr[i][1]\r\n else:\r\n fatigue_i_j = 0\r\n\r\n dp[i] = min(dp[i], fatigue_i_j + dp[j])\r\n\r\nans = dp[0]\r\nprint(ans)" ]

{"inputs": ["10 2 4\n3 7\n8 10\n0 10\n3 4\n8 1\n1 2", "10 1 1\n0 9\n0 5", "10 1 1\n0 9\n1 5", "1 1 1\n0 1\n1 100000", "1 1 1\n0 1\n0 100000", "2000 1 1\n0 1\n2000 33303", "2000 1 1\n1999 2000\n0 18898", "100 50 1\n1 2\n3 4\n5 6\n7 8\n9 10\n11 12\n13 14\n15 16\n17 18\n19 20\n21 22\n23 24\n25 26\n27 28\n29 30\n31 32\n33 34\n35 36\n37 38\n39 40\n41 42\n43 44\n45 46\n47 48\n49 50\n51 52\n53 54\n55 56\n57 58\n59 60\n61 62\n63 64\n65 66\n67 68\n69 70\n71 72\n73 74\n75 76\n77 78\n79 80\n81 82\n83 84\n85 86\n87 88\n89 90\n91 92\n93 94\n95 96\n97 98\n99 100\n0 91855", "2000 10 10\n46 161\n197 348\n412 538\n694 1183\n1210 1321\n1360 1440\n1615 1705\n1707 1819\n1832 1846\n1868 1917\n428 95081\n975 8616\n1159 27215\n532 32890\n1165 53788\n1969 11184\n1443 32142\n553 7583\n1743 33810\n315 62896", "2000 10 1\n63 103\n165 171\n412 438\n696 702\n764 782\n946 1040\n1106 1132\n1513 1532\n1589 1696\n1785 1919\n63 51662", "2000 1 1\n0 2000\n0 100000", "10 3 3\n0 3\n4 8\n9 10\n0 89516\n9 30457\n2 31337"], "outputs": ["14", "45", "-1", "-1", "100000", "-1", "37796000", "9185500", "-1", "95884672", "200000000", "397511"]}

UNKNOWN

PYTHON3

CODEFORCES

5

8d9078b0a36ff7bd5d993ae41b3780b0

Rounding

Vasya has a non-negative integer *n*. He wants to round it to nearest integer, which ends up with 0. If *n* already ends up with 0, Vasya considers it already rounded. For example, if *n*<==<=4722 answer is 4720. If *n*<==<=5 Vasya can round it to 0 or to 10. Both ways are correct. For given *n* find out to which integer will Vasya round it. The first line contains single integer *n* (0<=≤<=*n*<=≤<=109) — number that Vasya has. Print result of rounding *n*. Pay attention that in some cases answer isn't unique. In that case print any correct answer. Sample Input 5 113 1000000000 5432359 Sample Output 0 110 1000000000 5432360

[ "n=int(input())\r\nz=int(str(n)[-1])\r\nif z>=5:\r\n\tprint(n+10-z)\r\nelse:\r\n\tprint(n-z)\r\n", "n=int(input())\r\nk=n%10\r\nif k>0 and k<6:\r\n print(n-k)\r\nif k==0:\r\n print(n)\r\nif k>5 and k<10:\r\n print (n+10-k)", "n = int(input())\r\nif n % 10 >= 6:\r\n n += 9\r\nprint(n // 10 * 10)\r\n", "n=int(input())\r\na=n%10\r\nif a>5:\r\n b=10-a\r\n x=n+b\r\n print(x)\r\nelse:\r\n x=n-a\r\n print(x)", "n=input()\r\nnum=int(n)\r\nx=list(map(int,n.strip()))\r\ny=list(n.strip())\r\n\r\n\r\nif len(x)==1 and x!=\"5\":\r\n if x[0]>5:\r\n print(10)\r\n else:\r\n print(0)\r\nelse:\r\n if int(x[-1])<5:\r\n y[-1]=\"0\"\r\n print(''.join(y))\r\n\r\n else:\r\n\r\n while(n[-1]!=\"0\"):\r\n num=num+1\r\n n=str(num)\r\n if n[-1]==\"0\":\r\n print(num)", "# https://codeforces.com/problemset/problem/898/A\r\n\r\n\r\nn = int(input())\r\nn_ = n%10\r\nif n_ != 0 :\r\n if n_ >5:\r\n n=n-n_+10\r\n else:\r\n n = n-n_\r\nprint(n)\r\n", "n = int(input())\r\nt = n%10\r\n\r\nif t <= 5:\r\n print(n - t)\r\nelse:\r\n print((n//10 + 1)*10) \r\n\r\n", "n = int(input())\r\n\r\nif n % 10 <= 5:\r\n rounded = n - (n % 10)\r\nelse:\r\n rounded = n + (10 - n % 10)\r\n\r\nprint(rounded)\r\n", "n=int(input())\r\nx=n\r\ny=n\r\nwhile n%10!=0:\r\n n=n+1\r\nwhile x%10!=0:\r\n x=x-1\r\nif (y-x)>(n-y):\r\n print(n)\r\nelse:\r\n print(x)\r\n\r\n", "n=int(input())\r\nb=str(n)\r\na=int(b[-1])\r\nif a>5:\r\n b=10-a\r\n print(n+b)\r\nelif a<5:\r\n print(n-a)\r\nelif a==5:\r\n print(n-5)", "n = int(input())\r\nr = n%10\r\nif r <= 5:\r\n print(n - r)\r\nelse:\r\n print(n + (10-r))", "n = int(input())\r\nk=n%10\r\nh=0\r\nif k<=5:\r\n\th= n-k\r\nelse:\r\n\th = n+10-k\r\nprint(h)", "n = int(input())\r\nm = n % 10\r\n\r\nif m > 5:\r\n n = n - m + 10\r\nelse:\r\n n = n - m\r\nprint(n)\r\n", "n=int(input())\r\nif(n%10==0):\r\n print(n)\r\nelse:\r\n r=round(n/10)*10\r\n print(r)\r\n ", "n = int(input())\r\na = n%10\r\nif a<=5:\r\n print(n-a)\r\nelse:\r\n print((n+10)-a)", "n=int(input())\r\nr=n%10\r\n#print(r)\r\nif r==0:\r\n print(n)\r\nelif r>5:\r\n print(n+(10-r))\r\nelse:\r\n print(n-r)\r\n \r\n\r\n", "n = int(input())\r\n\r\nlast = n%10\r\n\r\nif last == 0 :\r\n print(n)\r\nelif last <= 5 and last>=1:\r\n print(n-last)\r\nelse:\r\n print(n-last + 10) ", "n = int(input())\r\n\r\ndef round(n):\r\n last_num = int(str(n)[-1])\r\n if last_num >= 5:\r\n n = n + (10 - last_num)\r\n else:\r\n n = n - last_num\r\n return n\r\nprint(round(n))", "n = int(input())\nm = n % 10\nif m <= 5:\n num = n - m\nelse:\n num = (n // 10 + 1) * 10\nprint(num)\n\n\t\t\t \t\t \t \t \t \t \t\t\t \t \t", "a = int(input())\r\nprint(round(a/10) * 10)\n# Wed Jan 04 2023 11:07:12 GMT+0300 (Moscow Standard Time)\n", "num = int(input())\r\n\r\n\r\nlast_dig = num % 10\r\n\r\nif last_dig in range(0,5):\r\n print (num - last_dig)\r\nelse:\r\n print (num + (10-last_dig))", "n =int(input())\r\na = n%10\r\nif(a>5):\r\n n+=10\r\n a = n%10\r\n print(n-a)\r\nelse:\r\n print(n-a)", "n = int(input())\r\ntemp = n % 10\r\nif temp == 0:\r\n print(n)\r\nelif temp < 5 and temp != 0:\r\n print(n - temp)\r\nelif temp > 4:\r\n print(n - temp + 10)", "if __name__ == '__main__' :\r\n n = int(input())\r\n if n%10 <= 5 :\r\n print(n-(n%10))\r\n else :\r\n print(10*((n//10)+1))", "a = int(input())\nmod = a%10\nif mod<5:\n print(a-mod)\nelse:\n print(a+(10-mod))\n\t \t\t \t \t\t\t\t\t\t\t\t\t\t \t\t\t \t", "a = int(input())\r\nif a % 10 > 5:\r\n print(a + 10 - a % 10)\r\nelse:\r\n print(a - a % 10)", "n=int(input())\r\n\r\nif n%10>5:\r\n n=n-n%10+10\r\nelse:\r\n n=n-n%10\r\nprint(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\nn = int(input())\r\nx = (n//10)*10\r\ny = x+10\r\n\r\nif abs(n-x) < abs(n-y):\r\n print(x)\r\nelse:\r\n print(y)", "print(int(round(int(input())/10,0))*10)", "n = int(input())\r\ns = str(n)\r\nif int(s[-1]) == 0:\r\n print(n)\r\n exit()\r\nif int(s[-1])<= 5:\r\n n -= int(s[-1])\r\nelse:\r\n n += abs(10 - int(s[-1]))\r\nprint(n)", "n = int(input())\r\na = n // 10\r\nif n % 10 >= 5:\r\n a += 1\r\nprint(a * 10)\r\n", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\n\r\nn=int(input())\r\nz=n\r\nst1=0\r\nst2=0\r\nwhile n%10!=0:\r\n st1+=1\r\n n+=1\r\nwhile z%10!=0:\r\n st2+=1\r\n z-=1\r\nif st1<=st2:\r\n print(n)\r\nelse:\r\n print(z)", "i=int(input())\r\nn=list(str(i))\r\na=int(n[-1])\r\nif(a<=5):\r\n\tn[-1]=\"0\"\r\n\tprint(\"\".join(n))\r\nelse:\r\n\tprint(i+10-a)\r\n", "z=input\r\n\r\nn=int(z())\r\nif n%10==0:\r\n print(n)\r\n exit()\r\nt=str(n)\r\nif int(t[-1])>=5:\r\n j=10-int(t[-1])\r\n print(n+j)\r\nif int(t[-1])<5:\r\n \r\n print(t[:-1]+'0')\r\n", "s = int(input())\r\nif s%10<=5:\r\n print(s-s%10)\r\nelse:\r\n print(s+10-s%10)\r\n\r\n ", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#------------notcontest------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\ndown=10;up=10\r\nfor i in range(6):\r\n f=n-i\r\n if f%10==0:\r\n down=i\r\n break\r\nfor i in range(6):\r\n f=n+i\r\n if f%10==0:\r\n up=i\r\n break\r\nif down<=up:print(n-down)\r\nelse:\r\n print(n+up)", "n=int(input())\ndown = int(n/10) * 10\nif n%10 >5:\n print(down+10)\nelse:\n print(down)\n\n \n\n\n", "n = int(input())\r\nif(n%10==0):\r\n print(n)\r\nelse:\r\n r=n%10\r\n if(r<=5):\r\n n1=int((n/10))\r\n n1=n1*10\r\n else:\r\n n1 = int(n/10)\r\n n1=n1*10+10\r\n \r\n print(n1)\r\n ", "num = int(input())\r\nif num % 10 >= 5:\r\n print(num + (10 - (num % 10)))\r\nelse:\r\n print(num - (num % 10))", "n=int(input())\r\nb=n%10\r\nif b==1 or b==2 or b==3 or b==4 or b==5:\r\n n-=b\r\n print(n)\r\nelif b==6 or b==7 or b==8 or b==9 :\r\n m=10-b\r\n print(n+m)\r\nelse:\r\n print(n)\r\n", "def solve(t_id):\r\n n = int(input())\r\n if n % 10 < 5:\r\n n -= (n % 10)\r\n else:\r\n n += (10 - n % 10)\r\n print(n)\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", "n = int(input())\nd = n % 10\nif d <= 5:\n r = n - d\nelif d > 5:\n r = (n - d) + 10\nelif d == 0:\n r = n\nprint(r)\n\t \t \t\t \t \t\t\t\t \t\t\t\t\t \t\t", "n=int(input())\r\nx=n%10\r\nif(x==0):\r\n print(n)\r\nelif(x==5):\r\n print(n+5)\r\nelif(x<5):\r\n print(n-x)\r\nelse:\r\n print(n+(10-x))", "import string\r\nn = int(input())\r\ns = str(n)\r\nif int(s[len(s)-1]) <= 5:\r\n n = n - int(s[len(s)-1])\r\nelse: n = n + 10 - int(s[len(s)-1])\r\nprint(n)", "x = int(input())\r\na = x - 1\r\nb = x - 2\r\nc = x - 3\r\nd = x - 4\r\ne = x - 5\r\nf = x + 4\r\ng = x + 3\r\nh = x + 2\r\ni = x + 1\r\n\r\nif x % 10 == 0:\r\n print(x)\r\nelif a % 10 == 0:\r\n print(a)\r\nelif b % 10 == 0:\r\n print(b)\r\nelif c % 10 == 0:\r\n print(c)\r\nelif d % 10 == 0:\r\n print(d)\r\nelif e % 10 == 0:\r\n print(e)\r\nelif f % 10 == 0:\r\n print(f)\r\nelif g % 10 == 0:\r\n print(g)\r\nelif h % 10 == 0:\r\n print(h)\r\nelif i % 10 == 0:\r\n print(i)", "n = int(input())\r\nlo = n//10 * 10\r\nhi = n//10 * 10 + 10\r\n\r\nif abs(n-lo) <= abs(n-hi):\r\n\tprint(lo)\r\nelse:\r\n\tprint(hi)", "s=input()\r\nif int(s[-1])==0:\r\n print(s)\r\nelif int(s[-1])>0 and int(s[-1])<=5:\r\n print(int(s)-int(s[-1]))\r\nelse:\r\n print(int(s)-int(s[-1])+10)", "import math;\r\n\r\ndef roundup(x):\r\n return int(round(x / 10.0)) * 10;\r\n\r\na = int(input());\r\n\r\nx = roundup(a);\r\nprint(x);", "n = int(input())\nif n % 10 == 0: print(n)\nelif n % 10 <= 5: print(n - n % 10)\nelse: print(n + 10 - n % 10)\n", "n=int(input())\r\nif n%10==0:\r\n\tprint(n)\r\nelse:\r\n\tt=n%10\r\n\tif t<5:\r\n\t\tprint(n-t)\r\n\telse :\r\n\t\tprint(n-t+10)", "n = input()\nif int(n[-1]) < 10 - int(n[-1]):\n print(int(n) - int(n[-1]))\nelif int(n[-1]) > 10 - int(n[-1]):\n print(int(n) + (10 - int(n[-1])))\nelse:\n print(int(n) - int(n[-1]))", "n=int(input())\r\nz=int(str(n)[-1])\r\nif z>=5:print(n+10-z)\r\nelse:print(n-z)", "n=int(input())\r\nif (n%10)<=5:\r\n print(n-n%10)\r\nelse:\r\n print((n+10)-(n+10)%10)", "n = int(input())\r\nrm = n % 10\r\nif rm <= 5:\r\n n -= rm\r\nelse:\r\n n += 10-rm\r\nprint(n)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import *\r\n\r\nn = int(input())\r\n\r\nif n%10<=4:\r\n print(n//10*10)\r\nelse:\r\n print((n+9)//10*10)", "t=int(input())\r\nx=t%10\r\nif x>5:\r\n print(t+10-x)\r\nelse:\r\n print(t-x)", "a = int(input())\r\nprint(round(a, -1))\r\n", "n=int(input())\r\n\r\nprint((n+5)//10*10)", "n=int(input())\r\nif n%10<5:\r\n print (n//10*10)\r\nelif n%10==5:\r\n print (n//10*10 or n//10*10+10)\r\nelse:\r\n print (n//10*10+10)", "num = input()\n\nlast = num[-1]\n\n\nif last in \"012345\" :\n print(num[:-1] + \"0\")\nelse :\n print(((int(num) // 10) * 10) + 10)\n", "n=int(input())\r\na=n//10\r\nif n%10>5:\r\n a=a+1\r\nelse:\r\n a=a\r\nprint(a*10)\r\n", "n=int(input())\r\nr=n%10\r\nif(r==0):\r\n print(n)\r\nelif(0<r and r<=5):\r\n print(n-r)\r\nelse:\r\n print(n+10-r) ", "a = str(int(input()))\r\nk = 0\r\nh = 0\r\nf = int(a[-1])\r\nj = 10 - f\r\nif f < 5:\r\n print(int(a) - f)\r\nelse:\r\n print(int(a)+j)", "a=int(input())\r\nif a%10==0:\r\n\tprint(a)\r\nelif (a%10)<=5:\r\n\tprint(a-(a%10),end='')\r\nelif (a%10)>5:\r\n\tprint(a+10-(a%10))", "import math\r\nn = int(input())\r\nn = n/10\r\nprint(round(n)*10)\r\n", "x = int(input())\nm = x % 10\nprint(x + [-m, 10 - m][m > 5])\n", "n=input()\r\nprint(int(n)-int(n[len(n)-1]) if int(n[len(n)-1])<=5 else int(n)+(10-(int(n[len(n)-1]))))\r\n\r\n", "n=int(input())\r\nfor i in range(6):\r\n a=n+i\r\n b=n-i\r\n \r\n if a%10==0:\r\n print(a)\r\n break\r\n \r\n if b%10==0:\r\n print(b)\r\n \r\n \r\n \r\n \r\n", "t=int(input())\r\n\r\nif t%10>5:\r\n t=t-t%10+10\r\nelse:\r\n t=t-t%10\r\nprint(t)", "n=int(input())\r\nn/=10\r\nn=round(n)\r\nprint(n*10)", "# LUOGU_RID: 112485116\na=int(input())\nprint((a+5)//10*10)", "n = int(input())\r\nc = n\r\nh = n\r\nwhile str(c)[-1] != \"0\":\r\n c+=1\r\nwhile str(h)[-1] != \"0\":\r\n h-=1\r\nif c - n < n - h:\r\n print(c)\r\nelse:\r\n print(h)\r\n \r\n\r\n\r\n#1 4\r\n#4\r\n#5 4 3 2\r\n#2 1 3 2\r\n\r\n#3\r\n\r\n ", "n=int(input())\r\nb=n%10\r\n\r\nif b>=5:\r\n n=n+(10-b)\r\nelse:\r\n n=n-(b)\r\n\r\nprint(n)", "n = eval(input())\r\nr = 0\r\nif((n%10)>5):\r\n r = ((n//10)+1)*10\r\nelse:\r\n r = (n//10)*10\r\nprint(r)", "print(10*round(int(input())/10))\r\n", "s=input()\r\nif s[-1]==\"0\":\r\n print(int(s))\r\nelif int(s[-1])>0 and int(s[-1])<5:\r\n x=int(s)\r\n y=x%5\r\n z=x-y\r\n print(z)\r\nelif int(s[-1])>5 and int(s[-1])<=9:\r\n x=int(s)\r\n y=x%5\r\n z=x+(5-y)\r\n print(z)\r\nelif int(s[-1])==5:\r\n x=int(s)\r\n z=x+5\r\n print(z)", "# Rounding\nn = int(input())\nif n%10 <= 5:\n print(n//10*10)\nelse:\n print(n//10*10+10)\n", "n=int(input())\r\nn=n/10\r\nprint(round(n)*10)", "m = int(input())\nn = m%10\nif m>9:\n i = m%10%10\n j =m-i*10-n\n if n>4:\n i = i+1\n n = 0\n a = j+i*10+n\n print(a)\n else:\n n = 0\n a = j+i*10+n\n print(a)\nelse:\n if n>4:\n a = 10\n print(a)\n else:\n a = 0\n print(a)\n\n\t\t \t\t \t\t \t \t\t \t\t \t \t", "n=int(input())\r\nif n%10>=5:\r\n\tn=n//10+1\r\n\tn*=10\r\nelse:\r\n\tn//=10\r\n\tn*=10\r\nprint(n)", "n=int(input())\r\nl=n%10\r\nif l<5:\r\n o=(n-l)\r\nif l==5:\r\n o=(n-5)\r\nif l>5:\r\n o=(10-l)+n\r\nprint(o)\r\n", "n = int(input())\r\nprint(n + 10 - n % 10 if n % 10 > 5 else n - n % 10)\r\n", "n = int(input())\r\nprint(round(n/10)*10)", "n=int(input())\r\np=str(n)\r\nl=p[len(p)-1]\r\nl=int(l)\r\nif l==0:\r\n print(n)\r\nelse:\r\n if l<=5:\r\n n=n-l\r\n print(n)\r\n else:\r\n l=10-l\r\n n=n+l\r\n print(n)", "a=int(input())\r\na=(a+5)//10\r\nprint(a*10)\r\n", "n = int(input())\r\nprint(n + 10 - (n % 10) if n % 10 > 5 else n - n % 10)\r\n\r\n# HaPpY NoWrUz 1398\r\n# UBCF\r\n# CodeForcesian\r\n# fadat\r\n", "n=int(input())\r\nif n%10<=5:\r\n n=(n//10)*10\r\n\r\nelse:\r\n if n%10==6:\r\n n=n+4\r\n elif n%10==7:\r\n n=n+3\r\n elif n%10 ==8:\r\n n+=2\r\n elif n%10==9:\r\n n+=1\r\nprint(n)", "\r\nn=int(input())\r\nif n%10<=5:\r\n n=n-n%10\r\nelse:\r\n n=n+(10-n%10)\r\nprint(n)\r\n", "n=int(input())\r\na=n%10\r\nif a<=5:\r\n print(n-a)\r\nelse:\r\n print(n+(10-a))", "n=int(input())\r\nprint(round(n/10)*10)", "n=int(input())\r\nn1=n\r\nnumber=str(n)\r\na=len(number)\r\ncounter=0\r\ncount=0\r\nif number[a-1]=='0':\r\n print(n)\r\nelse:\r\n while True:\r\n n=n+1\r\n counter=counter+1\r\n b=str(n)\r\n c=len(b)\r\n if b[c-1]=='0':\r\n d=n\r\n break\r\n else:\r\n continue\r\n count=count+int(number[a-1])\r\n difference=n1-int(number[a-1])\r\n if count>counter:\r\n print(d)\r\n else:\r\n print(difference)", "n= int(input())\r\neq= n%10\r\nif eq >5:\r\n print(n+10-eq)\r\nelse:\r\n print(n-eq)", "print(round(int(input())/10)*10)", "s = input()\r\nif 0 <= int(s[-1]) <= 5:\r\n print(s[:-1] + \"0\")\r\nelse:\r\n s = s[:-1]\r\n if len(s) == 0:\r\n print(\"10\")\r\n else:\r\n print(int(s) + 1, 0, sep=\"\")\r\n", "n=int(input())\r\nif(n<=5):\r\n print(\"0\")\r\n exit()\r\nelif(n>5 and n<=10):\r\n print(\"10\")\r\n exit()\r\nelif(n%10==0):\r\n print(n)\r\n exit()\r\nelse:\r\n a=n//10\r\n b=a*10\r\n c=a+1\r\n if(((c*10)-n)<(n-(b))):\r\n print(c*10)\r\n else:\r\n print(b)", "a = int(input())\r\nplus,minus = a,a\r\nwhile str(plus)[-1]!= \"0\":\r\n plus+=1\r\nwhile str(minus)[-1]!=\"0\":\r\n minus-=1\r\nif abs(minus-a) > abs(plus-a):\r\n print(plus)\r\nelif abs(minus-a) == abs(plus-a):\r\n print(plus)\r\nelse:\r\n print(minus)", "n=int(input())\r\nif(n%10<5):\r\n print(n-n%10)\r\nelse:\r\n print(n+(10-n%10))", "n = int(input())\na = n//10*10\nb = n//10*10+10\nif n-a<b-n:print(a)\nelse: print(b)", "n=list(input())\r\nif int(n[-1])<=5:\r\n print(\"\".join(n[0:-1])+'0')\r\nelse:\r\n n=int(\"\".join(n))\r\n while n%10!=0:\r\n n+=1\r\n print(n)", "n = int(input())\r\na = n % 10\r\nif a < 5:\r\n print(n-a)\r\nelse:\r\n print(n-a+10)", "import sys\r\n\r\nrd = sys.stdin.readline\r\n\r\nn = int(rd())\r\n\r\nif n % 10 == 0: print(n)\r\nelif n % 10 < 5: print(n - (n % 10))\r\n\r\nelse: print(n + 10 - (n % 10))\r\n", "n=int(input())\r\nmod=n%10\r\nif mod<=5:\r\n n-=mod\r\nelse:\r\n n+=(10-mod)\r\nprint(n)", "# # RED CODER # #\r\nn = int(input())\r\np = n/10\r\nprint(round(p)*10)", "n=int(input())\r\nl=int(n%10)\r\nif l>5:\r\n print(n+10-l)\r\nelse:print(n-l)", "n = int(input())\r\nm = n%10\r\nif m<=5: print(n-m)\r\nelse:print(n+(10-m))", "n = int (input() )\r\nif n%10>4:\r\n up = 10\r\nelse:\r\n up = 0\r\nans = n - (n%10) + up\r\nprint (ans)", "# LUOGU_RID: 111035184\nx = int(input())\nif x % 10 < 5:\n x = x - x % 10\nelif x % 10 >= 5:\n x = x - x % 10 + 10\nprint(x)", "n=int(input())\r\nif 0<n<5:\r\n\tprint(0)\r\nelse:\r\n\tprint(round(n,-1))", "n = int(input())\r\n\r\nr = n % 10\r\n\r\nif r <= 5:\r\n n -= r\r\nelse:\r\n n += 10 - r\r\n\r\nprint(n)\r\n", "n=int(input())\r\nx=int(n%10)\r\np=x-0\r\nq=10-x\r\nif p<q:\r\n print(n-x)\r\nelif p==q:\r\n print(n-x)\r\nelif q<p:\r\n print(n+q)", "n=int(input())\r\nnum_to_rem=n%10\r\nif num_to_rem>=5:\r\n print(n-num_to_rem+10)\r\nelse:\r\n print(n-num_to_rem)\r\n", "number = int(input())\r\n\r\nprint(f'{round(number/10)*10}')", "num = input()\r\nunitd = num[-1]\r\nif(int(unitd)<=5):\r\n print(int(num)-int(unitd))\r\nelse:\r\n print(int(num)+(10-int(unitd)))", "n = int(input())\r\n\r\nif n%10 < 5:\r\n print(n-n%10)\r\nelse:\r\n print(n + 10 - n%10)\r\n", "n=int(input())\r\nif int(n%10) in range(1,5):\r\n\tprint(n-int(n%10))\r\nelif int(n%10) in range(5,10):\r\n\tprint(n+10-int(n%10))\r\nelse:\r\n\tprint(n)", "n = int(input())\r\nrem = n%10\r\nn -= rem\r\nif rem > 5:\r\n n += 10\r\nprint(n)", "n=int(input())\r\nlast_dig=n%10\r\nprint(n-last_dig) if last_dig<=5 else print(n+(10-last_dig))", "n = int(input())\nx = n%10\nif x==0:\n\tprint(n)\nelif x>=5:\n\tprint(n+10 -x)\nelse:\n\tprint(n -x)\n", "import math\r\n\r\nn = int(input()) \r\n\r\nif n%10 <= 5:\r\n ans = 10*(n//10) \r\nelse:\r\n ans = 10*(n//10 + 1) \r\n\r\nprint(ans) ", "n = int(input())\r\n\r\nx = n % 10\r\nif x > 5:\r\n print(n + 10 - x)\r\nelse:\r\n print(n - x)\r\n", "n=int(input())\r\nif (n%10)>5:\r\n\tprint(n+10-(n%10))\r\nelse:\r\n\tprint(n-n%10)", "print(round(int(input()) / 10) * 10)\r\n", "a = int(input())\r\nb = a%10\r\nif b > 5:\r\n print(a+10-b)\r\nelif b <= 5:\r\n print(a-b)\r\nelse:\r\n print(a)\r\n \r\n", "s=input()\r\nn=len(s)\r\nif int(s[n-1])>5:\r\n\ts=int((int(s)/10))*10 +10\r\n\tprint(s)\t\r\nelif int(s[n-1])<=5:\r\n\ts=list(s)\r\n\ts[n-1]='0'\r\n\tprint(\"\".join(s))\r\nelif int(s[n-1])==0:\r\n\tprint(s)", "n = int(input())\r\nm = n % 10\r\nprint(n - m if m < 5 else n - m + 10)\r\n", "n = int(input())\r\nm = n % 10\r\n\r\nif m == 0 :\r\n n = n\r\nelif m <= 5 :\r\n n = n - m\r\nelse:\r\n n = n + 10 - m\r\nprint(n)", "n=int(input())\r\nrem=n%10\r\nif(rem<=5):\r\n print(n-rem)\r\nelse:\r\n print(n+10-rem)", "n=int(input())\r\nfor i in range(0,10):\r\n n1,n2=n+i,n-i\r\n n1,n2=str(n1),str(n2)\r\n if(n1[-1]=='0'):\r\n print(int(n1))\r\n break\r\n elif(n2[-1]=='0'):\r\n print(int(n2))\r\n break\r\n", "n = int(input())\r\nif n%10 == 0:\r\n print(n)\r\nelse:\r\n if n%10 <= 5:\r\n print(int(n//10)*10)\r\n else:\r\n print((int(n//10)+1)*10)\r\n", "n = int(input())\r\nif(n%10<5):\r\n print((n//10)*10)\r\nelse:\r\n print(((n//10)+1) * 10)", "n=int(input())\r\ns=str(n)\r\nl=list(s)\r\nif int(s[-1]) == 0:\r\n\tprint(n)\r\nelif int(s[-1]) > 0 and int(s[-1]) <= 5:\r\n\tl[-1] = \"0\"\r\n\tprint(*l,sep=\"\")\r\nelse:\r\n\tn=n+10%int(s[-1])\r\n\tprint(n)", "n=(int(input()))\r\nprint(((int(n/10)+(int(n%10>=5)))*10))", "n = int(input())\r\nx = n//10\r\ny = n%10\r\n\r\nif y==0:\r\n print(x*10)\r\nelif y<=4:\r\n print(x*10) \r\nelse:\r\n print(x*10+10)", "x = int(input())\n\nmod = x%10\n\nif mod <=5:\n print(x-mod)\nelse:\n print(x+10-mod)\n\n \t\t \t\t \t \t\t\t\t\t\t \t\t \t\t", "n=int(input())\r\nlasdig=n%10\r\nif lasdig<=5:\r\n print(n-lasdig)\r\nelse:\r\n print(n+(10-lasdig))", "n=int(input())\r\nx = n//10*10\r\ny= n//10*10+10\r\nif abs(n-x) <= abs(n-y):\r\n print(x)\r\nelse:\r\n print(y)", "n=int(input())\r\ns=str(n)\r\nif n%10!=0:\r\n if int(s[-1])<=5:\r\n print(n-(int(s[-1])))\r\n else:\r\n p=10-(int(s[-1]))\r\n print(n+p)\r\nelse:\r\n print(n)", "import math\r\n\r\nn = int(input())\r\nn /= 10\r\nprint(10*round(n))", "n= int(input())\r\n\r\na=n//10\r\nif n%10<5:\r\n print(a*10)\r\nelse:\r\n print((a*10)+10)", "n1 = int(input())\r\ntemp1 = n1\r\ntemp2 = n1\r\nb1 = False\r\ncount1 = 0\r\nwhile b1==False:\r\n if str(temp1)[-1] == \"0\":\r\n break\r\n temp1+=1\r\n count1+=1\r\ncount2 = 0\r\nwhile b1==False:\r\n if str(temp2)[-1] == \"0\":\r\n break\r\n temp2-=1\r\n count2+=1\r\n\r\nif count1 >= count2:\r\n print(temp2)\r\nelse:\r\n print(temp1)\r\n \r\n\r\n ", "n = int(input().strip())\r\nif n%10 <= 5:\r\n ans = n - n%10\r\nelse :\r\n ans = (n//10 + 1)*10\r\nprint(ans)", "n=int(input())\r\nif n%10>=5:\r\n print(10*((n//10)+1))\r\nelse:\r\n print(10*((n//10)))", "n = int(input())\r\nr = n%10\r\nremaining = 10-r\r\n\r\nif (r<remaining):\r\n print(n-r)\r\nelse:\r\n print(n+remaining)\r\n", "n=int(input())\r\nx=str(n)\r\nround = (n//10+(n%10>=5))*10\r\nprint(round)", "n = int(input())\r\nif n%10==0:\r\n print(n)\r\nelif n%10!=0 and n%10<=5:\r\n print(n-n%10)\r\nelif n%10!=0 and n%10>5:\r\n print(n+(10-n%10))", "s=input();c=int(s[len(s)-1])\r\ny=int(s);\r\nif(y>=10):\r\n y//=10\r\n x=int(c)\r\n if(x<=5):\r\n print(str(y)+\"0\")\r\n else:\r\n y+=1\r\n print(str(y)+\"0\")\r\nelse:\r\n if(y<=5):\r\n print(0)\r\n else:\r\n print(10)", "n = int(input())\r\nif n % 10 > 5 : \r\n n= (n // 10)*10 + 10 \r\n print(n)\r\nelse : \r\n n = n - (n % 10) \r\n print(n)", "n = int(input())\r\nr = n % 10\r\nif r<5:\r\n # n==114 r==4\r\n print(n-r)\r\nelse:\r\n # n==117 r==7\r\n print(n+10-r)", "n = int(input())\n\nm = n % 10\n\nif m < 5:\n n -= m\nelse:\n n += 10-m\n\nprint(n)\n", "x = int(input())\r\nif x%10 < 5:\r\n print(x-x%10)\r\nelse:\r\n print(x-x%10+10)\r\n", "n = int(input())\r\na = str(n)\r\nb = int(a[-1])\r\nif b >= 5:\r\n n = n - b + 10\r\nelif b < 5:\r\n n = n - b\r\nprint(n)", "print(int(round(int(input()) / 10) * 10))", "n = int(input())\r\nx = n % 10\r\ny = 10 - (n % 10)\r\nif (x >= y): print(n + y)\r\nelse: print(n - x)", "n = int(input())\r\nif n%10==0:\r\n print(n)\r\nelif n%10==5:\r\n print(n-5)\r\nelse:\r\n if n%10>5:\r\n print(n+(10-(n%10)))\r\n else:\r\n print(n-(n%10))", "a = int(input())\r\nl = a\r\na = a // 10\r\ne = l % 10\r\na = a * 10\r\nif e >= 5:\r\n print(a+10)\r\nelse:\r\n print(a)", "n=int(input())\r\nif n%10 ==0:\r\n print(n)\r\nelif n%10<=5:\r\n print(n-(n%10))\r\nelse:\r\n print(n+(10-(n%10)))\r\n", "print(10*((int(input())+5)//10))\n", "n = input()\r\nif int(n[len(n)-1])>5:\r\n\ta = int(n)%10\t\t\r\n\tprint(int(n)+(10-a))\r\nelse:\r\n\tprint(n[0:len(n)-1]+\"0\")\t", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n if n % 10 >= 5:\r\n n = n - n % 10 + 10\r\n else:\r\n n = n - n % 10\r\n print(n)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nt = int(str(n)[-1])\r\n\r\nif t == 0:\r\n print(n)\r\nelif t > 0 and t <= 5:\r\n n -= t\r\n print(n)\r\nelse:\r\n n += (10-t)\r\n print(n)\r\n ", "n = int(input())\r\na = n%10\r\nif a<=5:\r\n\tprint(n-a)\r\nelse:\r\n\tprint(n+10-a)\r\n", "def rounding(n):\r\n m = n % 10\r\n if n % 10 == 0:\r\n return n\r\n elif m <= 5:\r\n return n-m\r\n else:\r\n return n + (10-m) \r\n\r\nn = int(input())\r\nprint(rounding(n))", "n=int(input())\r\nif n%10==0:\r\n\tprint(n)\r\nelse:\r\n\tr=n%10\r\n\tk=n-r\r\n\tl=k+10\r\n\tif n-k<=l-n:\r\n\t\tprint(k)\r\n\telse:\r\n\t\tprint(l)", "\r\nn=int(input())\r\nr=n%10\r\nif r==0:\r\n print(n)\r\nelse:\r\n if r<=5:\r\n print((n//10)*10)\r\n else:\r\n print(((n//10)+1)*10)\r\n ", "n = int(input())\r\nif n % 10 > 5:\r\n n = n // 10 * 10 + 10;\r\nelse:n = n // 10 * 10\r\nprint(n)\r\n", "a=input()\nd=a[len(a)-1]\n#print(d)\nk=0 \nif d>\"5\" and d>\"0\":\n k=int(a)\n if d==\"6\":\n k+=4\n if d==\"7\":\n k+=3\n if d==\"8\":\n k+=2\n if d==\"9\":\n k+=1\n#print(k)\n\nelif d<=\"5\" and d>\"0\":\n k=int(a)\n if d==\"1\":\n k-=1\n if d==\"2\":\n k-=2\n if d==\"3\":\n k-=3\n if d==\"4\":\n k-=4\n if d==\"5\":\n k-=5\n\n#print(k)\nelse:\n k=int(a)\nprint(k)\n \n ", "def main():\r\n \r\n # t = int(input())\r\n # for _ in range(t):\r\n a = list(map(int,input().split()))[0] \r\n \r\n rem = a%10\r\n if rem<5:\r\n a-=(rem)\r\n else:\r\n a+=(10-rem)\r\n \r\n print(a)\r\n \r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "print(((int(input())+5)//10)*10)", "a=int(input())\r\nb=a%10\r\nc=10-b\r\nif(b<c):\r\n print(a-b)\r\nelse:\r\n print(a+c)", "import math\nprint(math.floor((int(input())+5)/10)*10)", "n = int(input())\r\nlast_digit = n % 10\r\nsecond_last_digit = ((n - last_digit) / 10) % 10\r\nn = (((n - last_digit) / 10) - second_last_digit) * 10\r\nif last_digit <= 5:\r\n n = n + second_last_digit*10\r\nelse:\r\n n = n + (second_last_digit + 1)*10\r\nprint(int(n))\r\n\r\n", "n=int(input())\r\nif n%10<=5:\r\n print(n-n%10)\r\nelse:\r\n print(n-n%10+10)", "n = int(input())\r\nr = n % 10\r\n\r\nif r<5:\r\n#n==114\t\tr==4\r\n\tprint(n-r)\r\nelse:\r\n# n==117\t\tr==7\r\n\tprint(n+10-r)", "t = input()\nn = len(t)\ns = int(t[-1])\nif s <5:\n t =int(t)-s\nelse:\n t= int(t)\n t = t-s+10\nprint(t)\n \t\t \t \t\t \t\t \t \t \t \t\t\t \t", "n=int(input())\r\nw=n%10\r\nif w>5:\r\n\tt=int(n//10)\r\n\tr=(t+1)*10\r\n\tprint(r)\r\nif w<=5:\r\n\tt=int(n//10)\r\n\tr=(t)*10\r\n\tprint(r)", "n = int(input())\r\nprint((n//10*10+10,n//10*10)[n % 10 <= 5])", "n = int(input())\r\nanswer = 10 * round(n / 10)\r\nprint(answer)", "print(round(int(input()),-1))", "n = int(input())\nif n % 10 > 5:\n print(n + 10 - n % 10)\nelse:\n print(n - n % 10)\n", "print((lambda x: x-x%10 if x%10<5 else x+10-x%10)(int(input())))", "n=int(input())\r\na=n%10\r\nif 0<=a<6:print(n-a)\r\nelse:print(n+(10-a))", "n = int(input())\r\nnum = n % 10\r\nn = n // 10 \r\nif num <= 5:\r\n n = n * 10 \r\nif num > 5:\r\n n = n + 1\r\n n = n * 10 \r\nprint(n)", "#n=113\r\nn=input()\r\nt=int(n[-1])\r\nif t<10-t:\r\n print(int(n)-(t))\r\nelse:\r\n print(int(n)+10-t)", "n=int(input())\r\nif(n%10<=5):\r\n print(n-n%10)\r\nelif(n%10>5):\r\n print(n+(10-n%10))\r\n", "#problem20\r\nprint((int(input())+5)//10*10)", "def main():\n n = int(input())\n remainder = n % 10\n\n if remainder <= 5:\n print(n - remainder)\n else:\n print(n + (10 - remainder))\n\n\nif __name__ == '__main__':\n main()\n", "a=int(input())\r\nif a%10<=4:\r\n a=a-(a%10)\r\nelse:\r\n a=a+(10-a%10)\r\nprint(a)", "from math import ceil\r\na=input()\r\nb=len(a)\r\ng=a[b-1]\r\nif int(g)<=5:\r\n print(int(a)-int(g))\r\nelse:\r\n print(int(a)+10-int(g))\r\n ", "m=int(input())\r\nmn=m%10\r\nif mn<=5:\r\n print(m-mn)\r\nelse:\r\n print(m+10-mn)", "n=int(input())\r\nk=n%10\r\nif k<=5:\r\n print(n-k)\r\nelse:\r\n print(n+(10-k))", "\r\ntry :\r\n n = int(input()) \r\n if(n%10 < 6 ):\r\n print(n - n%10) \r\n else: \r\n print(n + (10 -n%10))\r\n \r\nexcept : \r\n pass", "n = int(input())\na = n%10\nb = int(str(n)[:-1] + str('0'))\n#print(n, b, abs(n-b))\nif a == 0:\n print(n)\nelif abs(n-b) > 5:\n print((10-abs(n-b))+n)\nelse:\n print(b)\n\n", "n=int(input())\r\na=n%10\r\nif a<=5:\r\n print(n-n%10)\r\nelif a>5:\r\n print(n+(10-n%10))\r\n", "print(10 * (round(int(input()) / 10)))\r\n", "x = int(input())\r\nif x/10 != 0:\r\n\tif x%10 > 5:\r\n\t\tprint(x + 10 - (x%10))\r\n\telse:\r\n\t\tprint(x - (x%10))\r\nelse:\r\n\tprint(x)", "\r\n\"\"\"\r\n\r\n\"\"\"\r\n\r\nimport sys\r\nfrom sys import stdin\r\n\r\ntt = 1 #int(stdin.readline())\r\n\r\nANS = []\r\n\r\nfor loop in range(tt):\r\n\r\n n = int(stdin.readline())\r\n\r\n if n % 10 <= 5:\r\n n -= n % 10\r\n else:\r\n n = n - n % 10 + 10\r\n \r\n ANS.append(n)\r\n\r\nprint (\"\\n\".join(map(str,ANS)))\r\n", "# Problem Name :Rounding\r\n# problem link : https://codeforces.com/problemset/problem/898/A\r\n# Output Operation\r\nimport sys\r\nimport math\r\nnum=int(sys.stdin.readline())\r\nnum=num/10\r\nprint(round(num)*10)", "n = int(input())\r\nmn = n//10 * 10\r\nmx = mn + 10\r\nif n - mn < mx - n:\r\n print(mn)\r\nelse:\r\n print(mx)\r\n", "round_int = int(input())\r\nif round_int%10 in range(0,6):\r\n print(round_int-round_int%10)\r\nelif round_int%10 in range(6,10):\r\n print(round_int+(10-round_int%10))\r\n \r\n", "n = int(input())\r\nprint (round(n/10)*10)", "num = int(input())\r\n\r\nnu, m = divmod(num, 10)\r\nprint(nu * 10 + (0 if m <= 5 else 10))\r\n", "x = int(input())\r\nprint(x + 10-(x % 10) if x % 10 >= 5 else x - x % 10)", "n=list(map(int,input()))\nn1=n[len(n)-1]\nn2=int(n1)\nif(n2==0):\n y=''.join(map(str, n))\n z=int(y)\n print(z)\nelif(n2<=5):\n y=''.join(map(str, n))\n z=int(y)\n print(z-n2)\nelse:\n y=''.join(map(str, n))\n z=int(y)\n x=10-n2\n print(z+x) \n \t\t\t \t\t\t \t\t \t \t \t\t\t \t\t", "n = int(input())\r\nif n % 10 == 0:\r\n print(n)\r\n exit(0)\r\nif abs(n // 10 * 10 - n) <= abs((n // 10 + 1) * 10 - n):\r\n print(n // 10 * 10)\r\nelse:\r\n print((n // 10 + 1) * 10)\r\n", "from math import remainder\r\nn = int(input())\r\nprint(int(n-remainder(n,10)))", "from math import ceil\r\n\r\ndef solve():\r\n n = int(input())\r\n \r\n if n % 10 == 0:\r\n print(n)\r\n elif n % 10 < 5:\r\n print(n//10*10)\r\n else:\r\n print(int(ceil(n/10))*10)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()", "n=int(input())\r\nx=n//10\r\ny=n%10\r\n\r\nif y==0:\r\n print(x*10)\r\nelif y<=4:\r\n print(x*10)\r\nelse:\r\n print(x*10+10)", "n = int(input())\n\nif 0 < n % 10 <= 5:\n print(n - n % 10)\nelif 5 < n % 10 <= 9:\n print(n + (10 - n % 10))\nelse:\n print(n)", "print(round(int(input())/10)*10)\n\n#uoil;holiuhbnndfwewgf\n \t \t\t \t\t \t\t\t \t \t\t \t \t \t \t", "n = int(input())\r\nn = (n + 5) // 10 * 10\r\nprint(n)", "def main():\r\n n = int(input())\r\n if n%10>5:\r\n print((n//10+1)*10)\r\n else:\r\n print((n // 10) * 10)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nprint(round(n/10.0)*10)\r\n ", "n =int(input())\r\nif n%10==0:\r\n print(n)\r\nelse:\r\n k = n\r\n while k%10!=0:\r\n k=k+1\r\n p = n\r\n while p%10!=0:\r\n p=p-1\r\n if k-n<n-p:\r\n print(k)\r\n else:\r\n print(p)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-22 23:32:49\nLastEditTime: 2021-11-22 23:34:29\nDescription: Rounding\nFilePath: CF898A.py\n'''\n\n\ndef func():\n n = int(input())\n print((n + 5) // 10 * 10)\n\n\nif __name__ == '__main__':\n func()\n ", "# import os\r\n\r\nn = int(input())\r\n\r\nr = n % 10\r\nrr = 10-r\r\nif r >=5:\r\n print(n+rr)\r\nelse:\r\n print(n-r)", "n=int(input())\r\nd=n%10\r\nif(d==0):\r\n print(n)\r\nelif(d>0 and d<=5):\r\n print(n-d)\r\nelse:\r\n print(n+(10-d))\r\n", "n=int(input())\r\nk=n%10\r\nif k>5:\r\n a=10-k\r\n print(n+a)\r\nelse:\r\n print(n-k)", "n = int(input())\r\n\r\nx = n % 10\r\n\r\nif n % 10 < 5:\r\n \r\n print (n - x)\r\n\r\nelse: \r\n print (n + ( 10 -x) )\r\n", "n=int(input())\r\nif(n%10==0):\r\n print(n)\r\nelse:\r\n rem=n%10\r\n if(rem==1):\r\n print(n-1)\r\n if(rem==2):\r\n print(n-2)\r\n if(rem==3):\r\n print(n-3)\r\n if(rem==4):\r\n print(n-4)\r\n if(rem==5):\r\n print(n-5)\r\n if(rem==6):\r\n print(n+4)\r\n if(rem==7):\r\n print(n+3)\r\n if(rem==8):\r\n print(n+2)\r\n if(rem==9):\r\n print(n+1)\r\n\r\n\r\n \r\n", "a=int(input())\nb=a%10\nif b<5:\n print(a-b)\nelif b>=5:\n print(a+10-b)\n\n\n\t\t\t\t\t \t \t\t \t \t \t\t", "n=int(input())\r\nans = n-n%10+10 if n%10>5 else n-n%10\r\nprint(ans)", "def roundTo10(n):\r\n # Smaller multiple\r\n a = (n // 10) * 10\r\n\r\n # Larger multiple\r\n b = a + 10\r\n\r\n # Return of closest of two\r\n return (b if n - a > b - n else a)\r\n\r\nn = int(input())\r\nprint(roundTo10(n))\r\n", "n=input()\r\nif n[-1]=='0' : \r\n print (n)\r\nelif int(n)<=5 : print ('0')\r\nelif (int(n)<10) and (int(n)>5) : print ('10')\r\nelse : \r\n s=''\r\n if int(n[-1])<=5: \r\n s=n[:len(n)-1]+'0'\r\n else : \r\n s='0' ; kt=False \r\n for i in range(len(n)-2,-1,-1) : \r\n if int(n[i])+1==10 : \r\n if i==0 :\r\n s='10'+s\r\n kt=True\r\n break \r\n else :s='0'+s\r\n else : \r\n s=str(int(n[i])+1)+s \r\n break \r\n if kt==False : \r\n s=n[0:len(n)-len(s)]+s \r\n print (s)\r\n", "n=int(input())\r\nif(n%10==0):\r\n print(n)\r\nelse:\r\n k=n%10\r\n if(k>=5):\r\n l=n//10\r\n print((l+1)*10)\r\n else:\r\n l=n//10\r\n print(l*10)", "n = int(input())\r\nif(n%10>4):print(n+10-n%10)\r\nelse: print(n-n%10)", "n = int(input())\nm = str(n)\nnum1 = m[-1]\nnum2 = int(num1)\nif int(num1) > 5:\n print(n-num2+10)\nelif int(num1) <= 5:\n print(n-num2)\n\n \t \t \t \t\t \t \t \t\t\t\t\t\t\t", "import cmath\r\nn=int(input())\r\na=(n//10)*10\r\nb=a+10\r\nif (n-a)>(b-n):\r\n print(b)\r\nelse:\r\n print(a)\r\n", "n = int(input())\nif n % 10 > 5:\n print(n + (10 - (n % 10)))\nelse:\n print(str(n)[:-1]+'0')\n", "a = int(input())\r\n\r\nb = a%10\r\nc = 10 - b\r\nif b<6:\r\n print(a-b)\r\nelse:\r\n print(a+c)", "num = int(input())\n\nunit = num%10\n\nif (unit <= 5):\n print(num - unit)\nelse: print(num + (10-unit))\n\n", "n = int(input())\r\nif n%10 <= 5:\r\n print( (n//10)*10 )\r\nelse:\r\n print( (n//10 + 1)*10 )", "a=input();print(int(a)-int(a[-1]) if int(a[-1])<5 else int(a)+(10-int(a[-1])))", "def round_int(number: int) -> int:\n value = number // 10 * 10\n if number % 10 < 5:\n return value\n return value + 10\n\n\ndef main():\n number = int(input())\n print(round_int(number))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\nr = n % 10\n\nif r >= 5:\n print(10-r+n)\nelse:\n print(n-r)\n \n", "x=eval(input())\r\ny=x%10\r\nm=x//10\r\nif(y<=5):\r\n m=m*10\r\nelif(y>5):\r\n m=m*10+10\r\nprint(m)\r\n\r\n", "n=int(input())\r\nif n%10==0:\r\n\tprint(n)\r\nelif n%10<5:\r\n\tprint(n-n%10)\r\nelse:\r\n\tprint(n+10-n%10)", "\r\ni = int(input())\r\n \r\nif i % 10 == 0: print(i)\r\nelif i%10>5: print(i+(10-i%10))\r\nelse: print(i-(i%10))", "n = int(input())\r\nr = n % 10\r\nprint (n-r) if (r < 5) else print (n + (10 - r))\r\n", "import sys \r\nimport math as mt\r\nimport bisect\r\n#input=sys.stdin.readline\r\n#t=int(input())\r\nt=1 \r\n \r\ndef solve():\r\n n1,n2=0,0\r\n \r\n for i in range(11):\r\n if (n+i)%10==0:\r\n n1=i\r\n break\r\n for i in range(11):\r\n if (n-i)%10==0:\r\n n2=i\r\n break\r\n if n1>n2:\r\n return (n-n2)\r\n else:\r\n return (n+n1)\r\n \r\n \r\n \r\nfor _ in range(t):\r\n n=int(input())\r\n #n,k=map(int,input().split())\r\n #x,y,k=map(int,input().split())\r\n #n,h=(map(int,input().split()))\r\n #l=list(map(int,input().split()))\r\n #l2=list(map(int,input().split()))\r\n \r\n print(solve())\r\n ", "n=int(input())\r\nn=str(round(n/10)*10)\r\nprint(n)\r\n", "import sys,math\ninput=sys.stdin.readline\nprint=sys.stdout.write\nL=lambda : list(map(int,input().split().strip()))\nM=lambda : map(int,input().split())\na=int(input())\nif(a%10>=5):\n a+=10-(a%10)\nelse:\n a-=a%10\nprint(str(a))\n", "n=input()\r\na=list(n)\r\nif(a[-1]==\"0\"):\r\n print(n)\r\nelse:\r\n if(int(a[-1])<5):\r\n print(int(n)-int(a[-1]))\r\n else:\r\n print(int(n)+(10-int(a[-1]))) ", "n = int(input())\r\nf = n%10\r\nif f >= 5:\r\n print(n + (10 - f))\r\nelse:\r\n print(n - f)", "n = int(input())\r\na = (n//10)*10\r\nb = a + 10\r\nif n-a > b-n:\r\n print(b)\r\nelse:\r\n print(a)", "n = int(input())\r\nprint(n - (n%10) if n%10<=5 else n + 10 -(n%10))", "n = list(input())\r\nif n[-1] == 0:\r\n print(\"\".join(n))\r\nelif int(n[-1]) <= 5:\r\n n[-1] = \"0\"\r\n print(\"\".join(n))\r\nelse:\r\n temp = int(\"\".join(n))\r\n if n[-1] == \"6\":\r\n print(temp + 4)\r\n elif n[-1] == \"7\":\r\n print(temp + 3)\r\n elif n[-1] == \"8\":\r\n print(temp + 2)\r\n elif n[-1] == \"9\":\r\n print(temp + 1)", "n = int(input())\r\nprint(10*(round(n/10)))", "num = int(input())\r\nmod = num % 10\r\nprint(num - mod if mod <= 5 else num + 10 - mod)", "n=int(input())\r\nif str(n)[-1]==\"0\": print(n)\r\nelif int(str(n)[-1]) > 5: print(10-int(str(n)[-1])+n)\r\nelif int(str(n)[-1]) <= 5: print(n-int(str(n)[-1]))\r\n\t\r\n", "import sys\r\n\r\ndef main():\r\n k = int(sys.stdin.read().strip())\r\n return k - k%10 + (k%10 > 4)*10\r\n\r\nprint(main())\r\n", "a = int(input())\r\nif a%10 <= 5:\r\n if a<10:\r\n print(0)\r\n else:\r\n print(str(a//10)+'0')\r\nelse:\r\n if a<10:\r\n print(10)\r\n else:\r\n print(a+10-a%10)", "#Rounding\r\nn=int(input())\r\nnum=n\r\nr=num%10\r\nif r==0:\r\n print(num)\r\nelif r>0 and r<=5:\r\n n=n-(n%10)\r\n print(n)\r\nelse:\r\n n=n+(10-r)\r\n print(n)\r\n ", "x=int(input())\r\nk=x%10\r\nif k>=5:\r\n x=x+10-k\r\n print (x)\r\nelse:\r\n print (x-x%10)\r\n", "n=int(input())\r\nn=n/10\r\nn=round(n)\r\nn=n*10\r\nprint(n)", "n=int(input())\r\nif(n%10==0):\r\n print(n)\r\nelif((n%10)<5):\r\n print(n-(n%10))\r\nelif((n%10)>=5):\r\n print(n+(10-n%10))", "num=int(input())\r\nprint(round(num,-1))", "n=int(input())\r\nx=n%10\r\nif x>=5:\r\n x=10-x\r\n n+=x\r\nelse:\r\n n-=x\r\nprint(n)", "def process(n):\r\n if n % 10==0:\r\n return n\r\n if n % 10 <= 5:\r\n return 10*(n//10)\r\n return 10*(n//10+1)\r\n\r\nn = int(input())\r\nprint(process(n))\r\n", "n = int(input())\r\nremain = n%10\r\nif remain >= 5:\r\n n = n + (10-remain)\r\n print(n)\r\nelse:\r\n n = n - remain\r\n print(n)\r\n", "n=int(input())\r\nx=n%10\r\nif x==0:\r\n print(n)\r\nelif x>5:\r\n a=10-x\r\n print(n+a)\r\nelse:\r\n print(n-x)", "n = int(input())\r\nprint(round(n, -1))\r\n", "# Bismillahir Rahmanir Rahim\r\n# Abu Hurayra - Handle: HurayraIIT\r\nimport sys\r\nfrom tkinter import N\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 n = ri()\r\n a = n \r\n b = n \r\n cntA = 0\r\n cntB = 0\r\n while a%10!=0:\r\n cntA += 1\r\n a += 1\r\n while b%10!=0:\r\n cntB += 1\r\n b -= 1\r\n \r\n if cntA < cntB:\r\n wi(a)\r\n else:\r\n wi(b)\r\n\r\n \r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "x = eval(input())\r\nif x%10>=5 :\r\n x = x+10-x%10\r\nelse :\r\n x = x-x%10\r\nprint(x) \r\n", "n = int(input())\r\ns = str(n)[-1]\r\nif int(s) <= 5:\r\n print(n-int(s))\r\nelse:\r\n print(n+10-int(s))", "x=input()\r\nif int(x[-1])==0:\r\n print(x)\r\nelif int(x[-1])>0 and int(x[-1])<=5:\r\n print(int(x)-int(x[-1]))\r\nelif int(x[-1])>5 and int(x[-1])<=9:\r\n print(int(x)-int(x[-1])+10)\r\n \r\n", "n=int(input())\r\nif n in [0,1,2,3,4,5]:\r\n print(0)\r\nelif n%10 in [0,1,2,3,4,5]:\r\n print(str(n//10)+'0')\r\nelse:\r\n x=10-(n%10)\r\n print(n+x)\r\n\r\n\r\n", "def answer():\r\n a = int(input())\r\n if int(str(a)[-1])<5:\r\n a-=a%10\r\n else:\r\n a+=10-a%10\r\n print(a)\r\nanswer()", "T=int(input())\r\nz=round(T/10)*10\r\nprint(z)", "n=int(input())\r\n\r\nlast=n%10\r\n\r\nif(last==5):\r\n print(n-5)\r\nelif last<5:\r\n print(n-last)\r\nelse:\r\n add=10-last\r\n print(n+add)\r\n", "n=int(input())\r\nprint(((n+5)//10)*10)", "n = int(input())\nr = n % 10\nif r > 5:\n print(n+10-r)\nelse:\n print(n-r)\n", "if __name__ == '__main__':\r\n n = int(input())\r\n print(10 * (n // 10 + (n % 10 > 5)))\r\n", "n=str(input())\r\nif(n[len(n)-1]=='0'):\r\n print(n)\r\nelif(n[len(n)-1]=='5'):\r\n print(int(n)-5)\r\nelse:\r\n l=[]\r\n l.append(int(n)-1)\r\n l.append(int(n)-2)\r\n l.append(int(n)-3)\r\n l.append(int(n)-4)\r\n l.append(int(n)-5)\r\n l.append(int(n)+1)\r\n l.append(int(n)+2)\r\n l.append(int(n)+3)\r\n l.append(int(n)+4)\r\n l.append(int(n)+5)\r\n l=sorted(l)\r\n for i in range(0,len(l)):\r\n if(l[i]>=0):\r\n l[i]=str(l[i])\r\n if(l[i][len(l[i])-1]=='0'):\r\n print(l[i])\r\n break", "n = int(input())\r\nr = n % 10\r\nq = n // 10\r\nif (r == 0):\r\n print(n)\r\nelif (r > 5):\r\n print((q+1)*10)\r\nelse:\r\n print(q*10)", "n = int (input())\r\nm = round (n / 10)\r\nprint(m * 10)", "n = int(input())\r\nr = n % 10\r\nif r < 5:\r\n print (n - r) \r\nelse:\r\n print (n + (10 - r))\r\n", "# LUOGU_RID: 101737347\nn = int(input())\r\nprint((n + 5) // 10 * 10)", "n=int(input())\r\nr=n%10\r\nif r>5:\r\n print (n+(10-r))\r\nif 0<r<5:\r\n print (n-r)\r\nif r==0:\r\n print (n)\r\nif r==5:\r\n print (n+(10-r))", "n = input()\r\nlast = n[-1]\r\nif int(last) < 5:\r\n print(int(n) - int(last))\r\nelse:\r\n print(int(n) + (10 - int(last)))\r\n", "n = int(input())\r\nif n % 10 > 5: n += 10\r\nprint( (n // 10) * 10)\r\n", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nprint(round(n / 10) * 10)\n", "# Coded By Block_Cipher\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nfrom math import gcd\r\nfrom math import sqrt\r\nfrom collections import Counter\r\n\r\ns = input()\r\ni = int(s)\r\n\r\nif s[-1]=='0':\r\n\tprint(i)\r\nelif s[-1]=='6':\r\n\tprint(i+4)\r\nelif s[-1]=='7':\r\n\tprint(i+3)\r\nelif s[-1]=='8':\r\n\tprint(i+2)\r\nelif s[-1]=='9':\r\n\tprint(i+1)\r\nelif s[-1]=='1':\r\n\tprint(i-1)\r\nelif s[-1]=='2':\r\n\tprint(i-2)\r\nelif s[-1]=='3':\r\n\tprint(i-3)\r\nelif s[-1]=='4':\r\n\tprint(i-4)\r\nelse:\r\n\tprint(i-5)\r\n\r\n# if i%2!=0:\r\n", "n = int(input())\nres = 10 * ((n + 5) // 10)\nprint(res)\n", "def get_digits(n):\n a=list(map(int,str(n)))\n return a\na=int(input())\nif a>=10:\n lis = get_digits(a)\n if lis[-1] >= 5:\n lis[-2] += 1\n lis[-1] = 0\n long = 0\n while 1:\n if a // 10 != 0:\n a = a / 10\n long += 1\n else:\n break\n sum = 0\n for i in range(long + 1):\n sum += 10 ** i * lis[-(i + 1)]\n print(sum)\nelif a>5:\n print(10)\nelse:\n print(0)\n \t \t\t \t\t \t \t\t\t\t \t \t\t\t\t\t \t", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\na=n%10\r\nif a<=5:\r\n\tprint(n-a)\r\nelse:\r\n\tprint(n+10-a)\t", "n = input()\r\nif 0 <= int(n) % 10 <= 5:\r\n ans = n[:len(n)-1] + \"0\"\r\n print(ans)\r\nelse:\r\n ans = int(n) + 10 - int(n) % 10\r\n print(ans)", "# n (0 <= n <= 10^9)\r\nn = int(input ( ))\r\nq = n // 10\r\nr = n % 10\r\n\r\nif r <= 4:\r\n ans = n-r\r\nif r >= 6:\r\n ans = n+(10-r)\r\nif r == 5:\r\n ans = n+(10-r) or n-r\r\nprint (ans)", "n=int(input())\r\nl=int(n%10)\r\nif l in range(1,5):\r\n\tprint(n-l)\r\nelif l in range(5,10):\r\n\tprint(n+10-l)\r\nelse:\r\n\tprint(n)", "number = input()\r\nif int(number[-1]) <= 5:\r\n result = number[:-1] + '0'\r\nelse:\r\n result = int(number) + (10 - int(number[-1]))\r\nprint(result)\r\n", "n = int(input())\r\na = n % 10\r\nif a <= 5:\r\n print (n-a)\r\nelse:\r\n print((n+10)-a) \r\n ", "print((int(input()) + 4) // 10 * 10)", "a=int(input())\r\nc1=str(a)\r\nc=c1[-1]\r\nif a==5:\r\n print(0)\r\nelif c == '1' or c=='2' or c=='3' or c=='4':\r\n print(a-(int(c)))\r\nelif c =='5' or c=='6' or c=='7' or c=='8' or c=='9':\r\n print(a+(10-(int(c))))\r\nelse:\r\n print(a)", "\r\ndef main_function():\r\n n = input()\r\n if int(n[-1]) > 5:\r\n needed = 10 - int(n[-1])\r\n return str(int(n) + needed)\r\n else:\r\n return n[:-1] + \"0\"\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "n = int(input())\r\nmod = n % 10\r\nif (mod == 0):\r\n print(n)\r\nelif (mod == 5):\r\n print(n - 5)\r\nelse:\r\n if mod < 5:\r\n did = n - mod\r\n print(did)\r\n else:\r\n dif = 10 - mod\r\n sum = n + dif\r\n print(sum)", "n=int(input())\r\nif((n%10)>=5):\r\n z=10-(n%10)\r\n print(n+z)\r\nelif((n%10)>0 and (n%10)<5):\r\n z=n%10\r\n print(n-z)\r\nelse:\r\n print(n)", "def inlt():\r\n return(list(map(int,input().split())))\r\nimport sys\r\nfrom collections import defaultdict\r\nfrom math import sqrt, ceil,floor,factorial,log\r\nfrom bisect import bisect_left , bisect_right\r\nfrom io import BytesIO, IOBase, StringIO\r\nMYPC = False\r\nif MYPC :\r\n sys.stdin = open('in.txt' , 'r')\r\n sys.stdout = open('out.txt' , 'w')\r\ninput = lambda : sys.stdin.readline().rstrip(\r\n)\r\nt=int(input())\r\nif t%10<=5:\r\n print(t - (t%10))\r\nelse:\r\n print(t + (10-(t%10))) ", "n = int(input())\r\n \r\n# check last digit\r\n# round up or round down\r\n\r\nif(n%10 <= 5):\r\n # round down - subtract the remainder when divide by 10\r\n ans = n - n%10\r\nelse:\r\n # round up - round down then +10\r\n ans = 10 + n - n%10\r\n\r\nprint(ans)\r\n", "a=int(input())\r\ni=0\r\nj=0\r\nx=0\r\ny=0\r\nfor i in range(10):\r\n v=a+i\r\n lst=list(str(v))\r\n r=len(lst)\r\n x=x+1\r\n if(lst[r-1]=='0'):\r\n p=v\r\n break\r\nfor j in range(10):\r\n t=a-j\r\n lst1=list(str(t))\r\n f=len(lst1)\r\n y=y+1\r\n if(lst1[f-1]=='0'):\r\n q=t\r\n break\r\ne=x-1\r\nw=y-1\r\nif(e<w):\r\n print(p)\r\nelse:\r\n print(q)", "#!/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 dl = n%10\r\n if dl == 0:\r\n print(n)\r\n else:\r\n if dl > 5:\r\n print(n+10-dl)\r\n else:\r\n print(n-dl)\r\n", "n=int(input())\r\nt=n%10\r\nif(t<=5):\r\n print(n-t)\r\nelse:\r\n print(n+(10-t))\r\n", "# cook your dish here\r\nn = int(input())\r\nx = n%10\r\nif x>=5:\r\n print(n + 10 - x)\r\nelse:\r\n print(n-x)", "n=int(input())\r\nk=n%10\r\nif k==0:\r\n print(n)\r\nelif 0<k<=5:\r\n print(n-k)\r\nelse :\r\n print(n+10-k)", "print((int(input())+5)//10*10)", "n = input()\r\nif int(n[-1])>5:\r\n print(10-int(n[-1])+int(n))\r\nelse:\r\n print(n[0:-1]+'0')\r\n", "n = str(input())\nx = len(n)\nif x == 1:\n n = int(n)\n if n <= 5:\n n = 0\n elif n > 5:\n n = 10\nelif x > 1:\n a = 0\n while x > 1:\n n = int(n)\n a = n\n a = a % 10\n x = x - 1\n if a <= 5:\n n = n - a\n elif n > 5:\n n = n - a + 10\nprint(n)\n \t \t\t \t\t \t \t\t\t \t \t \t \t\t", "from math import *\r\n\r\nn = int(input())\r\nprint(round(n/10)*10)", "n=int(input())\r\nif n%10>5:\r\n\tprint(n+10-(n%10))\r\nelse:\r\n\tprint(n-(n%10))", "n = int(input())\nc = 0\nif n % 2 == 0 and n % 5 == 0:\n print(n)\nelse:\n x = n\n while not (x % 2 == 0 and x % 5 == 0):\n c += 1\n x += 1\n if c < 5:\n print(x)\n else:\n print(n - (10 - c))", "n=int(input())\r\nr=n%10\r\nif(r>=6):\r\n print(n+(10-r))\r\nelse:\r\n\r\n print(n-r)\r\n \r\n", "n = int(input())\r\nk = n%10\r\nif k<=5:\r\n print(n-k)\r\nelse:\r\n print(n+(10-k))", "n=int(input())\r\nn=round(n/10)\r\nprint(n*10)", "n = int(input())\r\n0 <= n <= 10 ^ 9\r\nprint (round(n / 10) * 10)", "n = int(input())\r\na = n%10 \r\nif a>5:\r\n print(n+10-a)\r\nelse:\r\n print(n-a)", "n = int(input())\r\na = n % 10\r\nif a <= 5:\r\n n -= a\r\nelse:\r\n n += (10 - a)\r\nprint(n)", "n = int(input())\nc = n%10\nif c<=5:\n n = n-c\nif c > 5:\n n = n+(10-c)\nprint(n)\n\t \t\t\t \t \t\t \t\t \t \t \t", "n = int(input())\r\nprint(n - (n % 10) + round((n % 10) / 10) * 10)\r\n", "n = int(input())\r\nx,left,right,y = n,0,0,n\r\nwhile str(n)[-1] != '0':\r\n n -= 1\r\n left += 1\r\nwhile str(x)[-1] != \"0\":\r\n x += 1\r\n right += 1\r\nif left <= right:\r\n print(y - left)\r\nelse:\r\n print(y + right)\r\n\r\n\r\n", "n = int(input())\r\nif n% 10 == 0:\r\n print(n)\r\nelse:\r\n a, b = n-1, n+1\r\n c1, c2 = 0, 0\r\n while a%10 != 0:\r\n a-=1\r\n c1+=1\r\n while b%10!=0:\r\n b+=1\r\n c2+=1\r\n if c1 > c2:\r\n print(b)\r\n else:\r\n print(a)\r\n\r\n", "a=int(input())\r\na=a+5\r\nprint((a//10)*10)", "n = int(input())\r\nif n%10 == 0:\r\n print(n)\r\nelif n%10<6:\r\n print(n-n%10)\r\nelse:\r\n print(n+10-n%10)\r\n", "a=int(input())\r\nif a%10==0:\r\n print(a)\r\nelif a%10<5:\r\n print(a//10*10)\r\nelse:\r\n print(((a//10)+1)*10)", "def redondear(number):\r\n digit=number%10\r\n if digit==0:\r\n return number\r\n elif 5<=digit<10:\r\n return number + (10-digit)\r\n return number-digit\r\ndef main():\r\n number=int(input())\r\n print(redondear(number))\r\nmain()", "n = int(input())\r\n\r\nn1 = str(n)\r\nlast = n1[-1]\r\nl = int(last)\r\nif l > 5:\r\n n = n + (10 - l)\r\nelse:\r\n n = n - l\r\n\r\nprint(n)\r\n", "n = int(input())\r\nm = round(n/10)\r\nprint(m*10)", "import sys\r\nimport math\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef listinput(): return list(map(int, sys.stdin.readline().strip().split())) \r\nn=input()\r\nif int(n[-1])>=5:\r\n n=int(n)+10-int(n[-1])\r\nelse:\r\n n=n[:-1]+\"0\"\r\nprint(n)", "n = int(input())\r\nprint(round(n,-1))", "num=int(input())\r\n\r\nr=num%10\r\nif r<=5:\r\n\tprint(num-r)\r\nelse:\r\n\tprint(num+(10-r))", "n = input()\r\nif n[-1] == \"0\":\r\n print(n)\r\nelse:\r\n print(round(int(n) / 10) * 10)", "from math import ceil\nn = int(input())\nif n%10 < 5:\n\tprint((n//10)*10)\nelse:\n\tprint(ceil(n/10)*10)", "n = int(input())\r\na = round (n / 10)*10\r\nprint(a)", "n = int(input())\nif n % 10 <= 5:\n print(n // 10 * 10)\nelse:\n print(n // 10 * 10 + 10)\n# Wed Jan 04 2023 12:03:43 GMT+0300 (Moscow Standard Time)\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn=read_int()\n\tprint(((n+5)//10)*10)\n\nsolve()\n", "'''input\n5432359\n'''\n\n# Created by Adhney\n\nn = int(input())\n\nd = n%10\n\nif d == 0:\n\tprint(n)\nelif d>= 1 and d<=5:\n\tprint(n-d)\nelif d>5 and d<=9:\n\tprint(n+(10-d))\n\t", "s=input()\r\ns1=\"56789\"\r\nx=len(s)-1\r\nif s[x] in s1:\r\n while(s[len(s)-1]!=\"0\"):\r\n y=int(s)\r\n y+=1\r\n s=str(y)\r\n print(s)\r\nelse:\r\n while(s[len(s)-1]!=\"0\"):\r\n y=int(s)\r\n y-=1\r\n s=str(y)\r\n print(s)\r\n\r\n \r\n \r\n", "n = int(input())\r\n\r\nn = round(n/10)\r\n\r\nif n == 0:\r\n print('0')\r\nelse:\r\n print(str(n) + '0')", "import math\r\nx = int(input())\r\nprint(10*round(x/10))", "n = int (input())\nr = n%10\ndown = n-r\nif r>4:\n up = 10\nelse:\n up = 0\nans = down + up\nprint(ans)", "def solve(n):\n if n % 10 <= 5:\n return 10*(n // 10)\n else:\n return 10*(n//10) + 10\n\n\ndef main():\n n = int(input())\n print(solve(n))\n\n\nmain()\n", "# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!\r\n# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!\r\n# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!\r\nfrom sys import stdin, stdout\r\nimport math\r\nimport heapq\r\nfrom itertools import accumulate\r\n\r\nN = int(input())\r\n#s = input() \r\n#N,K = [int(x) for x in stdin.readline().split()]\r\n\r\n\r\nmodule = N%10\r\n\r\nif module<=5:\r\n print(N-module)\r\nelse:\r\n print(N+10-module)\r\n \r\n \r\n \r\n \r\n \r\n ", "n=int(input())\r\nm=n%10\r\nif m==0:\r\n n=n\r\nelif m<=5:\r\n n=n-m\r\nelse:\r\n n=n+10-m\r\nprint(n)", "n=list(input())\r\nif n[-1]==0:\r\n print(\"\".join(n))\r\nelif int(n[-1])<=5:\r\n n[-1]=\"0\"\r\n print(\"\".join(n))\r\nelse:\r\n temp=int(\"\".join(n))\r\n if n[-1]=='9':\r\n print(temp+1)\r\n elif n[-1]=='8':\r\n print(temp+2)\r\n elif n[-1]=='7':\r\n print(temp+3)\r\n elif n[-1]=='6':\r\n print(temp+4)", "a = int(input())\r\nprint(a - a % 10 if (a % 10) <= 5 else (a+10) - (a+10) % 10)", "n=int(input())\r\nif n%10==0:\r\n print(n)\r\nelse:\r\n x=n%10\r\n if x>5:\r\n print(n + (10-x))\r\n else:\r\n print(n -x)\r\n", "n=int(input())\r\nif n%10==0:\r\n\tpass\r\nelif n%10<6:\r\n\tn=(n//10)*10\r\nelse:\r\n\tn+=10-n%10\r\nprint(n)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[5]:\n\n\nn = int(input())\na = n%10\nif a<=5:\n print(n-a)\nelse:\n print(n+(10-a))\n\n", "n = int(input())\r\nrem = n%10\r\n\r\nif rem == 0:\r\n\tprint(n)\r\nelif rem in range(1,6):\r\n\tprint(n-rem)\r\nelse:\r\n\tprint(n+10-rem)", "n=int(input())\r\nif(n%10==0):\r\n print(n)\r\nelse:\r\n a=n%10\r\n n=n//10\r\n if(a<=5):\r\n print(n*10)\r\n else:\r\n print((n+1)*10)", "n = int(input())\r\nprint(round(n / 10)*10)", "q=int(input())\r\nh=q%10\r\nif h<=5:\r\n print(q-h)\r\nelse:\r\n h=10-h\r\n print(q+h)", "\r\nn = int(input())\r\nn1 = n % 10 \r\nif n1 < 6:\r\n\tprint(n - n1)\r\nelse:\r\n\tprint(n+10-n1)", "r=int(input())\r\nn=int((r+5)/10)\r\nprint(10*n)", "n = int(input())\n\nb = n%10 \nb != 0\nif b >= 5:\n ans = n - b +10\n\nif b <= 4:\n ans = n-b\n\nprint(ans)\n\n\n\n\n\n\n\n\n\n\n\n\n", "i=int(input())\r\nif (i%10)<5:\r\n print(i-(i%10))\r\nelse:\r\n print(i+(10-(i%10)))", "n=int(input())\r\nif n%10!=0:\r\n\ts1=str(n)\r\n\ts=tuple(s1)\r\n\tlast=int(s[len(s1)-1])\r\n\tif last<=5:\r\n\t\twhile n%10!=0:\r\n\t\t\tn-=1\r\n\telse:\r\n\t\twhile n%10!=0:\r\n\t\t\tn+=1\r\n\tprint(n)\r\nelse:\r\n\tprint(n)", "number = int(input())\r\nunitdigit = number%10\r\nadd = 0\r\nif unitdigit > 4:\r\n add = 10\r\nelse:\r\n add = 0\r\nprint((number-(unitdigit))+add)", "a = input()\r\nb = int(a[-1])\r\nif b == 5:print(a[:-1]+\"0\")\r\nelif b < 5:print(int(a) - b)\r\nelse:print(int(a)+(10 - b))", "n = int(input())\r\na = (n // 10) * 10\r\ns = str(n)\r\nif int(s[-1]) < 5:\r\n print(a)\r\nelse:\r\n print(a + 10)\r\n\r\n", "if __name__ == '__main__':\r\n n = input()\r\n if int(n[len(n)-1]) <= 5:\r\n print(n[:len(n)-1]+'0')\r\n elif int(n[len(n)-1]) >= 6:\r\n print(str(int(n)+(10 - int(n[len(n)-1]))))\r\n", "t = int(input())\r\nz = round(t/10)*10\r\nprint(z)", "n=int(input())\r\nrem=n%10\r\nif(rem<5):\r\n n=n-rem\r\nelse:\r\n n=n+(10-rem)\r\nprint(n) ", "print(int(round(int(input())/10)*10))", "n=int(input())\r\ns=int(str(n)[-1])\r\na=(n-s)\r\nb=n+(10-(n%10))\r\nif(min(n-a,b-n)==n-a):\r\n print(a)\r\nelse:\r\n print(b)\r\n", "n=int(input())\r\nif n%10>=5:\r\n\tn=n//10*10+10\r\nelse:\r\n\tn=n//10*10\r\nprint(n)\r\n", "n = int(input())\nif n%10 == 0:\n\tprint(n)\nelse:\n\tif n%10>= 5:\n\t\tprint(n + 10 - n%10)\n\telse:\n\t\tprint(n - n%10)\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\nans = n // 10 * 10 if n % 10 <= 5 else n + (10 - n % 10)\r\nprint(ans)", "x=int( input())\r\ny = x % 10\r\nif y<5:\r\n print(x-y)\r\nelif y >=5:\r\n z = 10-y\r\n print(x+z)", "# cook your dish here\r\nn=int(input())\r\nk=n%10\r\nif k>(10-k):\r\n ans=n+10-k\r\nelse:\r\n ans=n-k\r\nprint(ans)\r\n ", "u=int(input())\nif(u%10 <= 5):\n\tprint((u//10)*10)\nelse:\n\tprint(((u//10)+1)*10)", "n=int(input())\r\nif n%10!=0:\r\n if n%10<5:\r\n n-=n%10\r\n else:\r\n n+=10-n%10\r\nprint(n)", "n=int(input())\r\nr=n%10\r\nif(r>5):\r\n n+=(10-r)\r\nelse:\r\n n-=r\r\nprint(n)", "x = int(input())\r\n \r\nif x >=0 and x<=1000000000:\r\n y = round(x, -1)\r\n print(y)\r\n", "n=input()\r\nif n[-1]=='0':\r\n print(n)\r\nelif n[-1]<='5':\r\n s=int(n[-1])\r\n n=int(n)\r\n print(n-s)\r\nelse:\r\n s=10-int(n[-1])\r\n print(int(n)+s)\r\n\r\n \r\n", "s=int(input())\nwhile(s%10!=0):\n\n if ( (s-1)%10 == 0 or (s-2)%10 ==0 or (s-3)%10 ==0 or (s-4)%10 ==0 ):\n while(s%10!=0):\n s=s-1\n break\n elif ( (s-6) %10==0 or (s-7) %10==0 or (s-8) %10==0 or (s-9) %10==0):\n while(s%10!=0):\n s=s+1\n break\n elif ((s-5)%10==0 or (s+5)%10==0):\n s=s-5\n\nprint(s)\n\n \t \t \t \t\t \t\t \t\t\t \t \t", "a=int(input())\r\nif a%10>=5:\r\n print((((a*2)-((a*2)%10))//2)+5)\r\nelse:\r\n print(a-(a%10))", "n=int(input())\r\ndig=n%10\r\nif(dig<=5):\r\n n-=dig\r\nelse:\r\n n+=(10-dig)\r\nprint(n)", "def shing():\r\n bop()\r\ndef bop():\r\n global inputis\r\n inputis = input()\r\n try:\r\n inputis = int(inputis)\r\n except:\r\n shing()\r\n return\r\n inputis = int(inputis)\r\n if 0<=inputis<=1000000000: \r\n inputis = str(inputis)\r\n x = inputis[len(inputis)-1]\r\n inputis = int(inputis)\r\n x = int(x)\r\n if x == 0 or x == 1 or x == 2 or x == 3 or x == 4:\r\n inputis = inputis - x\r\n else:\r\n inputis = inputis + (10-x)\r\n print(inputis)\r\n else:\r\n shing()\r\n \r\nbop()\r\n", "num = int(input())\r\nwhile num%10!=0:\r\n ans = num%10\r\n if ans<=5:\r\n num-=ans\r\n else:\r\n num+=(10-ans)\r\nprint(num)", "import sys\r\nfrom collections import *\r\nfrom math import *\r\nimport re\r\ndef inp_arr():return list(map(int,input().split()))\r\ndef inp():return map(int,input().split())\r\ndef lcm(a,b):return (a*b)/gcd(a,b)\r\ndef even(n):return[False,True][0 if n%2 else 1]\r\nmax_int = sys.maxsize\r\nmod = 10**9+7\r\n\r\nn=input()\r\nif n[-1]<='5':n=int(n)-int(n[-1])\r\nelse:\r\n n=(int(n)+10)-int(n[-1])\r\nprint(n)", "n = int(input())\r\nx = round (n / 10)\r\nprint(x * 10)", "n = int(input())\r\n\r\nif (n % 10 < 5):\r\n print(n - n%10)\r\n\r\nelse:\r\n print(n + 10 - n % 10)\r\n\r\n", "n=int(input())\r\nif n%10==5:\r\n print(n-5)\r\nelif n%10>5:\r\n print(n+(10-(n%10)))\r\nelif n%10<5:\r\n print(n-(n%10))", "n=input(\"\")\r\nif int(n[len(n)-1])<5:\r\n print(int(n)-int(n[len(n)-1]))\r\nelif int(n[len(n)-1])>5:\r\n print(int(n)-int(n[len(n)-1])+10)\r\nelse:\r\n print(int(n)-int(n[len(n)-1]))", "n = int(input())\n\nif n%10!=0:\n r = n%10\n if r>5:\n print(n+10-r)\n else: \n print((n//10)*10)\nelse:\n print(n)", "#Rounding\r\nn=int(input())\r\nt=n\r\nn=n%10\r\nprint((t-n) if n<=5 else (t-n+10))", "a = input()\r\nif a[-1] != '0':\r\n b = int(a[-1])\r\n if b + 5 > 10:\r\n print(int(a)+ (10 - b))\r\n else:\r\n print(a[:-1] + '0')\r\nelse:\r\n print(a)", "def solve():\r\n c = int(input())\r\n a = c // 10 * 10\r\n b = a + 10\r\n\r\n if c - a > b - c:\r\n print(b)\r\n else:\r\n print(a)\r\n \r\nif __name__ == \"__main__\":\r\n #for i in range(int(input())):\r\n solve()", "# -*- coding: utf-8 -*-\n\"\"\"(round example)\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1ccSSWJPdktkWCKEXPtvB9d1PclYxVraJ\n\"\"\"\n\nn = int(input())\ni=n%10\nif(i<=5):\n n=n-i\nelse:\n n=n+(10-i);\n \nprint(n)", "import math\r\nimport sys\r\nimport itertools\r\nimport itertools\r\nimport bisect\r\n\r\ndef sa(Type= int):\r\n return [Type(x) for x in input().split()]\r\n\r\ndef solve(t):\r\n n = int(input())\r\n lastDigit = n % 10\r\n\r\n if lastDigit < 6:\r\n print((n // 10) * 10)\r\n else:\r\n print(((n // 10) + 1) * 10)\r\n\r\nif __name__ == '__main__':\r\n # sys.stdin = open('input.txt', 'r')\r\n\r\n # t = int(input())\r\n # for i in range(t):\r\n # solve(i+1)\r\n solve(1)\r\n", "n = int(input())\r\nif(0 <= int(n) and int(n) <= 10**9):\r\n pass\r\nelse:\r\n exit()\r\n\r\n\r\nlist1 = [int(x) for x in str(n)]\r\n\r\nm = list1[len(list1) - 1]\r\n\r\nif(1 <= m and m <= 5):\r\n list1[len(list1) - 1] = 0\r\n\r\n str1 = [str(lis) for lis in list1]\r\n str2 = \"\".join(str1)\r\n anInteger = int(str2)\r\n print(anInteger)\r\nelif(m == 0):\r\n print(n)\r\nelse:\r\n i = 10 - m\r\n n = n + i\r\n print(n)\r\n", "n = input()\r\nx = int(n[len(n) - 1])\r\nif x != 0:\r\n if 10 - x > x:\r\n print(n[0:len(n) - 1] + '0')\r\n else:\r\n print(int(n) + 10 - x)\r\nelse:\r\n print(n)", "n = int(input())\r\na = int(str(n)[::-1][0])\r\nif a>10-a:\r\n\tprint(n+10-a)\r\nelse:\r\n\tprint(n-a)", "n = int(input())\r\n\r\nl = n - n % 10\r\nr = l + 10\r\n\r\nif n - l <= r - n:\r\n print(l)\r\nelse:\r\n print(r)", "n=int(input())\r\nminus=n%10\r\nplus=10-n%10\r\nif minus>plus:\r\n print(n+plus)\r\nelse:\r\n print(n-minus)\r\n", "n = input()\r\np = n[-1]\r\nif int(p) <= 5:\r\n print(n[:-1] + '0')\r\nelse:\r\n m = int(n) % 10\r\n print(int(n) + 10 - m)", "n = int(input())\r\n\r\na = (n // 10) * 10\r\nb = a + 10\r\n \r\nif n - a > b - n:\r\n print(b)\r\nelse:\r\n print (a)\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input()) \r\nif n%10 in range(0,6): \r\n print(n-n%10)\r\nelif n%10 in range(6,10): \r\n print(n+(10-n%10))", "\r\nn = int(input())\r\nif 0 < n % 10 < 5:\r\n print(n -( n % 10 ))\r\nelif 5 <= n % 10 <= 9:\r\n if n % 10 == 5:\r\n print(n-n%10)\r\n else:\r\n print(n+(10-(n%10)))\r\nelse:\r\n print(n)", "n=int(input())\r\nr=n%10\r\nif r<5:\r\n\tn-=r\r\nelse:\r\n\tn+=10-r\t\r\nprint(n)\t", "n = int(input())\r\nr = n % 10 \r\nprint(n - r if r <= 5 else n + 10 - r)", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\na=n%10\r\nif a>5:\r\n\tn+=10-a\r\nelse:\r\n\tn-=a\r\nprint(n)", "a = int(input())\r\nmod = a%10\r\nif mod<5:\r\n print(a-mod)\r\nelse:\r\n print(a+(10-mod))", "n=int(input())\r\nb=str(n)\r\nc=int(b[-1])\r\nif c<5:\r\n print(n-c)\r\nelif c>5:\r\n print(n+(10-c))\r\nelse:\r\n print(c+n)", "n=int(input())\nr=n%10\nq=n//10\nif(r>5):\n print((q+1)*10)\nelse:\n print(q*10)\n\n\n \n \n\n \n ", "\r\nn=int(input())\r\nc=n%10\r\nif c==0 or c==1 or c==2 or c==3 or c==4 or c==5:\r\n print(n-c)\r\nelse:\r\n print(n+(10-c))\r\n", "n = int(round(int(input())/10)*10)\r\nprint(n)\r\n", "n=int(input())\r\nif n%10==5:\r\n print(n+5)\r\nelif n%10==0:\r\n print(n)\r\nelif n%10 < 5:\r\n print(n-(n%10))\r\nelif n%10 > 5:\r\n print(n+(10-(n%10)))", "q=[int(input())]\r\nans=-1\r\nwhile ans==-1:\r\n a=q.pop(0)\r\n if a%10==0:\r\n ans=a\r\n else :\r\n q.append(a-1)\r\n q.append(a+1)\r\nprint(ans)", "n=int(input())\r\nm=n%10\r\nif(m<=5):\r\n print(int(n-m)) \r\nelse:\r\n print(int(10-m+n))", "t=(input())\nz=int(t)%10\nif t[-1]==0:\n print(t)\nelif z>5:\n t=int(t)\n t=t+10-z\n print(t)\nelse:\n t=int(t)\n t=t-z\n print(t)\n\t\t \t \t\t\t \t \t \t \t \t\t\t \t \t\t\t\t", "# LUOGU_RID: 102386230\nprint(round(int(input())/10)*10)\r\n", "n = int(input())\nq,r = divmod(n, 10)\na = q*10\nb = (q+1)*10\nif n-a <= b-n:\n print(a)\nelse:\n print(b)\n", "n = int(input())\r\nr = (n%10)\r\nif r <= 5:\r\n print (n-r)\r\nelse:\r\n print (n+(10-r))", "n=int(input())\r\nl=n%10\r\nif l<5:\r\n n=n-l\r\n print(n)\r\nelse:\r\n c=10-l\r\n n=n+c\r\n print(n)\r\n", "n =int(input())\r\nn2=n\r\nc1=0\r\nc2=0\r\nwhile n%10 !=0:\r\n if int(str(n)[-1])<=5:\r\n n-=1\r\n else:\r\n n+=1\r\nprint(n)\r\n\r\n\r\n", "n = int(input())\r\nlast_digit = int(str(n)[-1])\r\n\r\nif last_digit >= 5:\r\n n += 10-last_digit\r\nelse:\r\n n -= last_digit\r\nprint(n)", "n=int(input())\r\np=int(n%10)\r\nif(p>=5):\r\n print(n+(10-p))\r\nelse:\r\n print(n-p)", "import random\r\nnum=str(input(\"\"))\r\nif num [-1]== '0':\r\n print(num)\r\nelif num =='5':\r\n print(random.choice ([\"0\",\"10\"]))\r\nelif num[-1]=='5':\r\n print(int(num) +5)\r\nelse:\r\n if 10- int(num[-1]) >5:\r\n print(int(num) -int(num[-1]) )\r\n else:\r\n print(int (num) + (10 - int(num [-1])) )", "c=int(input())\r\nif(c%10>=6):\r\n print(((c//10)*10)+10)\r\nelse:\r\n print((c//10)*10)", "n = int(input())\r\nif(n%10<5):\r\n\tprint(n-n%10)\r\nelif(n%10>5):\r\n\tprint(n+10-n%10)\r\nelse:\r\n\tprint(n+5)", "a=int(input())\r\nprint((a+5)//10*10)\r\n", "n = int(input())\r\nprint(((n+5) // 10) * 10 )\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled31.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/17FYXKkGHhJk4BTAD6JXnNzUfuBKL7211\n\"\"\"\n\ndata = input()\nM = int(data)\nif (M%10 < 5):\n print(M - M%10)\n\nelse:\n print(M+10-M%10)", "n = int(input())\r\nprint(((n + 5) // 10) * 10)", "n=int(input())\r\nrem=n%10\r\nif(rem>5):\r\n print(n+10-rem)\r\nelse:\r\n print(n-rem)\r\n\r\n \r\n ", "n = int(input())\r\nr = n%10\r\nif r==0:\r\n print(n)\r\nelif r<5:\r\n print(n-r)\r\nelif r>=5:\r\n print(n+(10-r))", "n=int(input())\nz=n%10\nif z>=5:\n ans=n+(10-z)\nif z<=5:\n ans=n-z\nprint(ans)", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"outp.out\",'w')\r\nn=int(input())\r\nx=n%10\r\nif x!=0:\r\n\tif x<=5:\r\n\t\tn-=x\r\n\telse:\r\n\t\tn+=(10-x)\t\r\nprint(n)\t\t", "n = int(input())\r\nif n % 10 >= 5:\r\n\tn += 10 - (n % 10)\r\nelse:\r\n\tn -= (n % 10)\r\nprint(n)", "n=input()\r\ns=int(n[-1])\r\na=int(n)-s\r\nb=a+10\r\nif(int(n)-a>b-int(n)):\r\n print(b)\r\nelse:\r\n print(a)", "test=input()\r\nchack=int(test[len(test)-1])\r\nif chack==0:\r\n\tprint(test)\r\nelif chack<=5:\r\n\tprint(test[:len(test)-1]+\"0\")\r\nelse:\r\n\tsubstract=10-chack\r\n\tprint(str(int(test)+substract))\r\n\r\n", "a = int(input())\nb=a%10\n\nc=a%100\nanc=a%100\nc=c-b+10\nif b<=5 :\n print(a-b)\nelse:\n a-=anc\n a+= c\n print(a)\n\t \t \t\t\t\t \t \t \t\t \t\t \t\t \t", "n=list(input())\r\nif int(''.join(n))%10==0:\r\n print(''.join(n))\r\nelse:\r\n if int(''.join(n))%10<=5:\r\n print(int(''.join(n))-int(''.join(n))%10)\r\n else:\r\n print(int(''.join(n))+(10-int(''.join(n))%10))", "n = int(input())\r\nif int(str(n)[-1]) > 4:\r\n n += 10 - int(str(n)[-1])\r\nelse:\r\n n -= int(str(n)[-1])\r\nprint(n)", "n = int(input())\r\nrem = n%10\r\nnum = 0\r\n\r\nif rem>=0 and rem<5:\r\n num = int(n/10) * 10\r\nelse:\r\n n = int(n/10)\r\n rem = n%10\r\n n = int(n/10)\r\n num = n*100 + (rem+1)*10\r\n\r\nprint(num)", "a=int(input())\r\nprint(round(a/10)*10)", "n = int(input())\r\ndigit = n%10\r\nif digit == 0:\r\n pass\r\nelif digit <= 5:\r\n n -= digit\r\nelse:\r\n n = n + (10 - digit)\r\nprint(n)\r\n", "n=int(input());print(n//10*10+10*(n%10>5))", "n=int(input())\r\nif(n%10>=6):\r\n print(n+(10-(n%10)))\r\nelse:\r\n print((n//10)*10)", "n=int(input())\r\na=n%10\r\nb=n-a\r\nif a==5:\r\n\tprint(b+0)\r\nelif a>5 and a<10:\r\n\tprint(b+10)\r\nelse:\r\n\tprint(b)", "n=int(input())\r\nk=n%10\r\nif 5<k:\r\n\td=10-k\r\n\tr=n+d\r\nelif 5>=k:\r\n\tr=n-k\r\nprint(r)", "n = int(input())\r\nx = n%10\r\nif x < 5:\r\n print(n - x)\r\nelse:\r\n print(n+(10-x))\r\n", "nums = list(input())\r\nif nums[-1] == 0:\r\n print(\"\".join(nums))\r\nelif int(nums[-1]) <= 5:\r\n nums[-1] = \"0\"\r\n print(\"\".join(nums))\r\nelse:\r\n A = int(\"\".join(nums))\r\n if nums[-1] == \"9\":\r\n print(A + 1)\r\n elif nums[-1] == \"8\":\r\n print(A + 2)\r\n elif nums[-1] == \"7\":\r\n print(A + 3)\r\n elif nums[-1] == \"6\":\r\n print(A + 4)", "N = int(input())\na = N%10\nif a>0 and a<=5:\n N = N-a\nelif a>5:\n N = N+10-a\nprint(N)\n\n \t \t\t\t \t\t \t \t\t\t\t\t \t \t \t\t", "print((lambda x:x-x%10 if x%10<5 else x-x%10+10)(int(input())))", "n=int(input())\r\nif n%10 > 5:\r\n print(n+(10-n%10))\r\nelse:\r\n print(n-n%10)", "n = int(input())\r\n\r\nif (n%10 == 0):\r\n\tprint (n)\r\nelse:\r\n\r\n\tk = n%5\r\n\tif (k==0):\r\n\t\tprint (n+5)\r\n\telse:\r\n\t\tk = n%10\r\n\r\n\t\tif (k in [1,2,3,4]):\r\n\t\t\tprint (n-k)\r\n\t\telse:\r\n\t\t\thh = n//10\r\n\t\t\tprint (n-k+10)\r\n\r\n\r\n\r\n", "import sys\r\n\r\nn = int(input())\r\nif n % 10 == 0:\r\n print(n)\r\n sys.exit()\r\n\r\nif n % 10 < 10 - n % 10:\r\n print(n - n % 10)\r\nelse:\r\n print(n + (10 - n % 10))\r\n ", "x=int(input())\r\nif x%10>4:\r\n\tprint(x-(x%10)+10)\r\nelse:\r\n\tprint(x-(x%10))\r\n\r\n", "n = int(input())\nif(n%10 <5):\n print(n - n%10)\nelse:\n print(n + 10 - n % 10)", "n = int(input())\r\nprint(n - int(str(n)[-1]) if (int(str(n)[-1]) < 5) else n + (10 - int(str(n)[-1])))", "from collections import Counter\r\nimport copy\r\n\r\ndef solve():\r\n n=int(input())\r\n rem=n%10\r\n\r\n if rem<=5:\r\n print(n-rem)\r\n return \r\n\r\n print(n+(10-rem))\r\n\r\n\r\nsolve()", "import math \r\nn = int(input())\r\nans = (round(n/10))*10\r\nprint(int(ans))", "n = int(input())\r\nl = str(n)[-1]\r\nif int(l)>5 and (n+10)//10*10%10==0:\r\n print((n+10)//10*10)\r\nelif n%10==0:\r\n print(n)\r\nelse: print(n//10*10)", "n = int(input(\"\"))\r\nprint((n+5) // 10 * 10)", "n = int(input())\r\nrem = n%10\r\nval = n//10\r\nif rem > 5:\r\n print((val+1)*10)\r\nelse:\r\n print(val*10)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nif(n%10<=5):\r\n print(n-n%10)\r\nelse:\r\n print(n+(10-n%10))", "n = int(input())\r\ni = 0\r\nwhile 1:\r\n if (n+i)%10==0:\r\n print(n+i)\r\n break\r\n elif (n-i)%10==0:\r\n print(n-i)\r\n break\r\n i += 1\r\n", "n=int(input())\r\np=n%10\r\nif p<=5:\r\n print(n-p)\r\nelse:\r\n print(n+(10-p))\r\n", "n=int(input())\r\nif n%10>5:\r\n\tprint(n + (10-n%10 ))\r\nelse:\r\n\tprint(n- n%10)", "n = int(input())\r\nm = n % 10\r\nprint(n - m) if m <= 5 else print(n + (10 - m))", "n = int(input())\r\nu_digit = n%10\r\nif u_digit > 5:\r\n print(n+10-u_digit)\r\nelse:\r\n print(n-u_digit)\r\n" ]

{"inputs": ["5", "113", "1000000000", "5432359", "999999994", "10", "9", "1", "0", "3", "4", "6", "7", "8", "19", "100", "997", "9994", "10002", "100000", "99999", "999999999", "999999998", "999999995", "999999990", "1000000", "1000010", "10000010", "100000011", "400000003", "234234", "675621", "43532", "4576453", "65754674", "3245526", "123445", "234217", "23451218", "1231239", "1923140", "307910310", "780961030", "103509421", "576560141", "48851642", "226935072", "844450763", "22534183", "640049874", "818133304", "730616285", "613732415", "380991216", "559074636", "176590327", "354673757", "267156738", "150272868", "62755859", "945871979", "46", "999", "1397"], "outputs": ["0", "110", "1000000000", "5432360", "999999990", "10", "10", "0", "0", "0", "0", "10", "10", "10", "20", "100", "1000", "9990", "10000", "100000", "100000", "1000000000", "1000000000", "999999990", "999999990", "1000000", "1000010", "10000010", "100000010", "400000000", "234230", "675620", "43530", "4576450", "65754670", "3245530", "123440", "234220", "23451220", "1231240", "1923140", "307910310", "780961030", "103509420", "576560140", "48851640", "226935070", "844450760", "22534180", "640049870", "818133300", "730616280", "613732410", "380991220", "559074640", "176590330", "354673760", "267156740", "150272870", "62755860", "945871980", "50", "1000", "1400"]}

UNKNOWN

PYTHON3

CODEFORCES

461

8d9b9f436834145197b35fe3b1a4ec79

Help Far Away Kingdom

In a far away kingdom lived the King, the Prince, the Shoemaker, the Dressmaker and many other citizens. They lived happily until great trouble came into the Kingdom. The ACMers settled there. Most damage those strange creatures inflicted upon the kingdom was that they loved high precision numbers. As a result, the Kingdom healers had already had three appointments with the merchants who were asked to sell, say, exactly 0.273549107 beer barrels. To deal with the problem somehow, the King issued an order obliging rounding up all numbers to the closest integer to simplify calculations. Specifically, the order went like this: - If a number's integer part does not end with digit 9 and its fractional part is strictly less than 0.5, then the rounded up number coincides with the number’s integer part. - If a number's integer part does not end with digit 9 and its fractional part is not less than 0.5, the rounded up number is obtained if we add 1 to the last digit of the number’s integer part.- If the number’s integer part ends with digit 9, to round up the numbers one should go to Vasilisa the Wise. In the whole Kingdom she is the only one who can perform the tricky operation of carrying into the next position. Merchants found the algorithm very sophisticated and they asked you (the ACMers) to help them. Can you write a program that would perform the rounding according to the King’s order? The first line contains a single number to round up — the integer part (a non-empty set of decimal digits that do not start with 0 — with the exception of a case when the set consists of a single digit — in this case 0 can go first), then follows character «.» (a dot), and then follows the fractional part (any non-empty set of decimal digits). The number's length does not exceed 1000 characters, including the dot. There are no other characters in the input data. If the last number of the integer part is not equal to 9, print the rounded-up number without leading zeroes. Otherwise, print the message "GOTO Vasilisa." (without the quotes). Sample Input 0.0 1.49 1.50 2.71828182845904523536 3.14159265358979323846 12345678901234567890.1 123456789123456789.999 Sample Output 0123312345678901234567890GOTO Vasilisa.

[ "def round_number(num_str):\r\n integer_part, fractional_part = num_str.split('.')\r\n last_digit = int(integer_part[-1])\r\n\r\n if last_digit != 9:\r\n if int(fractional_part[0]) < 5:\r\n return integer_part\r\n else:\r\n return str(int(integer_part) + 1)\r\n else:\r\n return \"GOTO Vasilisa.\"\r\n\r\n# Read the input\r\nnum_str = input().strip()\r\n\r\n# Perform rounding and print the result\r\nresult = round_number(num_str)\r\nprint(result)", "def q99a():\n\tnum = input()\n\tdot_loc = num.index('.')\n\tif(num[dot_loc-1] == '9'):\n\t\tprint(\"GOTO Vasilisa.\")\n\telse:\n\t\tif(int(num[dot_loc+1]) < 5):\n\t\t\tprint(num[:dot_loc])\n\t\telse:\n\t\t\tprint(num[:dot_loc-1], end='')\n\t\t\tprint(int(num[dot_loc-1])+1)\n\t# num = float(input())\n\t# num_rounded = round(num)\n\t# if(int(num) % 10 != 9):\n\t# \tprint(num_rounded)\n\t# else:\n\t# \tprint(\"GOTO Vasilisa.\")\n\nq99a()", "a,b=input().split('.')\nif a[-1]=='9':print(\"GOTO Vasilisa.\")\nelse:\n if int(b[0])<5:print(a)\n else:print(int(a)+1)", "s = input()\r\nif s[s.find('.') - 1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if s[s.find('.') + 1] == '5' or s[s.find('.') + 1] == '6' or s[s.find('.') + 1] == '7' or s[s.find('.') + 1] == '8' or s[s.find('.') + 1] == '9':\r\n print(int(s[:s.find('.')]) + 1)\r\n else:\r\n print(s[:s.find('.')])", "from math import ceil, floor\r\n\r\nn = input()\r\n\r\nparts = n.split(\".\")\r\nif len(parts) == 1:\r\n print(n)\r\n exit()\r\nint_part, dec_part = parts\r\n\r\nif int_part[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\n exit()\r\n\r\nif int(dec_part[0]) >= 5:\r\n print(int_part[:-1] + str(int(int_part[-1]) + 1))\r\nelse:\r\n print(int_part)", "a,b = input().split('.')\r\n\r\nif a[-1] != '9' and int(b[0])<5:\r\n print(a)\r\nelif a[-1] != '9' and int(b[0]) >= 5:\r\n print(int(a)+1)\r\nelif a[-1] == '9':\r\n print(\"GOTO Vasilisa.\")", "a = input()\r\nfor i in range(len(a)):\r\n if a[i] == \".\" and a[i-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\n break\r\n if a[i] == \".\" and a[i+1] >= \"5\":\r\n print(int(a[:i])+1)\r\n break\r\n if a[i] == \".\" and a[i+1] <= \"5\":\r\n print(a[:i])\r\n break", "def rounder(s):\r\n st = \"\"\r\n tochkaindex1 = s.index(\".\")+2\r\n for i in range(tochkaindex1):\r\n st+=s[i]\r\n return st\r\ndef integer(s):\r\n sum = 0\r\n st = \"\"\r\n while s[sum]!=\".\":\r\n st+=str(s[sum])\r\n sum+=1\r\n return st\r\na = str(input())\r\nif str(integer(a))[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelif int(str(rounder(a))[-1])>=5 and str(integer(a))[-1] != \"9\":\r\n print(int(str(integer(a)))+1)\r\nelse:\r\n print(int(str(integer(a))))\r\n", "x, y = map(str, input().split('.'))\r\n\r\nif x[-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if int(y[0]) >= 5:\r\n x = x[:-1] + str(int(x[-1]) + 1)\r\n \r\n print(x)\r\n", "s=input().split('.')\r\ni=int(s[0])\r\nif i%10!=9:\r\n k=len(s[1])\r\n if k==1:\r\n if int(s[1])<5:\r\n print(i)\r\n else:\r\n print(i+1)\r\n else:\r\n if int(s[1][0])<5:\r\n print(i)\r\n else:\r\n print(i+1)\r\nelse:\r\n print('GOTO Vasilisa.')", "t = input()\r\nk = t.find('.')\r\nif k < 0: print(t)\r\nelif t[k - 1] == '9': print('GOTO Vasilisa.')\r\nelse: print((t[:k - 1] + str(int(t[k - 1]) + 1)) if t[k + 1] > '4' else t[:k])", "s = input()\ndot = s.find(\".\")\ni, d = s[dot - 1], s[dot + 1]\nres = \"GOTO Vasilisa.\" if i == \"9\" else int(s[:dot]) + (int(d) >= 5)\nprint(res)\n", "\ns = input()\ni,f = s.split(\".\")\n\nif(i[-1] == '9'):\n print(\"GOTO Vasilisa.\")\nelse:\n if(int(f[0]) < 5 ):\n print(int(i))\n else:\n print(int(i)+1)\n\t\t \t\t \t\t \t\t\t\t \t\t \t\t \t\t\t \t\t \t", "i, d = tuple(input().split(\".\"))\r\nif i[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelif int(d[0]) < 5:\r\n print(int(i))\r\nelif int(d[0]) >= 5:\r\n print(int(i) + 1)\r\n", "from math import floor\r\n\r\nn, d = input().split('.')\r\n\r\nif int(n) % 10 == 9:\r\n print(\"GOTO Vasilisa.\")\r\nelif int(d[0]) < 5:\r\n print(n)\r\nelse:\r\n print(int(n) + 1)\r\n", "x=input()\r\ny=x.index(\".\")\r\nz=x[(y-1):(y+2)]\r\n \r\nif z[-3] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n n=int(z[0])\r\n j=int(x[y+1])\r\n if j >= 5:\r\n n=n+1\r\n \r\n o=int(x[:(y-1)] + str(n)) \r\n print(o)\r\n", "\r\nnumero = input()\r\n\r\nindice_punto = -1\r\ni = 0\r\n\r\nwhile indice_punto == -1 and i < len(numero):\r\n if numero[i] == '.':\r\n indice_punto = i\r\n i = i+1\r\n\r\nunidades = int(numero[indice_punto-1])\r\ndecimas = int(numero[indice_punto+1])\r\n\r\nif unidades < 9 and decimas < 5:\r\n print(numero[:indice_punto])\r\nelif unidades < 9 and decimas >= 5:\r\n print(numero[:indice_punto-1] + str(int(numero[indice_punto-1])+1))\r\nelse:\r\n print('GOTO Vasilisa.')\r\n\r\n", "n=input()\r\nn=n.split('.')\r\n\r\nif n[0][-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelif n[1][0]<'5':\r\n print(n[0])\r\nelse:\r\n print(int(n[0])+1)\r\n", "import sys\nscan=sys.stdin.readline\narray=lambda : map(int,scan().split('.'))\n\na,b=scan().split('.')\nif a[-1]=='9':\n\tprint('GOTO Vasilisa.')\nelse:\n\tif ord(b[0])>=ord('5'):\n\t\tprint(int(a)+1)\n\telse:\n\t\tprint(int(a))\n\t \t \t \t \t\t \t \t \t \t\t\t", "s = input()\r\na = s.split('.')[1]\r\nb = s.split('.')[0]\r\nif b[-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelif int(a[0]) < 5:\r\n print(int(b))\r\nelif int(a[0]) > 4:\r\n print(int(b) + 1)", "import math\r\nimport sys\r\nimport re\r\n\r\nn = input()\r\nl = n.split('.')\r\nif l[0][-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if int(l[1][0]) >= 5:\r\n print(int(l[0]) + 1)\r\n else:\r\n print(l[0])", "def help_far_away_kingdon(integer: str, decimal: str) -> str:\n if (integer[-1] == '9'):\n return 'GOTO Vasilisa.'\n\n if (int(decimal[0]) < 5):\n return integer\n \n return str(int(integer) + 1)\n\n# Input\n\ni, d = input().split('.')\nresult = help_far_away_kingdon(i, d)\nprint(result)\n\n \t \t\t\t\t \t \t \t\t\t\t\t\t \t \t \t", "s = input()\r\na = int(s[:s.find('.')])\r\nif a % 10 == 9:\r\n print ('GOTO Vasilisa.')\r\nelif int(s[s.find('.')+1])>=5:\r\n print (a+1)\r\nelse:\r\n print (a)", "from decimal import *\nn = input()\nidx = n.index('.')\nif n[idx - 1] == '9':\n print(\"GOTO Vasilisa.\")\nelse:\n f = Decimal(n[idx:])\n if f >= Decimal(\"0.5\"):\n print(n[:idx - 1] + str(int(n[idx - 1]) + 1))\n else:\n print(n[:idx])\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", "import sys\r\n\r\ndef main():\r\n s = sys.stdin.read().strip()\r\n x, y = s.split('.')\r\n if x.endswith('9'): return 'GOTO Vasilisa.'\r\n if int(y[0]) > 4: return int(x) + 1\r\n return x\r\n \r\nprint(main())\r\n", "num = input()\r\ndot = num.find(\".\")\r\nif num[dot - 1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(num[dot + 1]) >= 5:\r\n print(int(num[:dot]) + 1)\r\n else:\r\n print(num[:dot])", "X = input()\r\nprint(\"GOTO Vasilisa.\" if X[X.index(\".\") - 1] == \"9\" else (\r\n X[:X.index(\".\")] if X[X.index(\".\") + 1] < \"5\" else int(X[:X.index(\".\")]) + 1))\r\n", "\n__author__ = 'Esfandiar'\n\na,b = input().split('.')\nif a[-1] != '9':\n if int(b[0]) >= 5:\n print(a[:len(a)-1],end=\"\")\n print(int(a[-1])+1)\n else:\n print(a)\nelif a[-1] == '9':\n print('GOTO Vasilisa.')", "n = input()\r\ninteger, frac = n.split('.')\r\nif integer[len(integer) - 1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if frac[0] < '5':\r\n print(integer)\r\n else:\r\n print(int(integer) + 1)", "\r\ns=input()\r\nk=s.index('.')\r\nif s[k-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelif int(s[k+1])>=5: print(s[:k-1]+str(int(s[k-1])+1))\r\nelse: print(s[:k]) ", "n = input()\r\narr = n.split('.')\r\nintg = int(arr[0])\r\nif intg%10 != 9 and int(arr[1][0])<5:\r\n print(intg)\r\nelif intg%10 != 9 and int(arr[1][0])>=0.5:\r\n print(intg + 1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")\r\n", "import re\r\ninv = input().rstrip()\r\nli = inv.split('.')\r\nx = re.search('.*9$',li[0])\r\nif(x == None):\r\n y = re.search('^[0-4].*',li[1])\r\n if(y == None):\r\n print(int(li[0])+1)\r\n else:\r\n print(int(li[0])) \r\nelse:\r\n print(\"GOTO Vasilisa.\") \r\n \r\n\r\n\r\n\r\n", "n, f = map(str, input().split(\".\"))\r\nif n[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(f[0]) >= 5:\r\n print(int(n) + 1)\r\n else:\r\n print(n)", "x,y=input().split('.')\nx=int(x)\nn=len(y)\ny=int(y)\n\nif x%10==9:\n print('GOTO Vasilisa.')\nelse:\n if y<5*(10**(n-1)):\n print(x)\n else:\n print(x+1)\n \t\t\t \t\t\t\t \t\t\t \t \t \t\t \t \t", "word = input()\r\npos=2\r\nnum=\"\"\r\nfor i in range(len(word)):\r\n if word[i]=='.':\r\n pos = i+1\r\n num=word[0:i]\r\n break\r\nif num[-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelif word[pos] in ('1','2','3','4','0'):\r\n print(num)\r\nelse:\r\n print(num[0:-1] + str(int(num[-1])+1))\n# Sun Jan 09 2022 09:33:42 GMT+0000 (Coordinated Universal Time)\n", "num=input()\r\n\r\nn, dec=num.split('.')\r\np=n[-1]\r\nnum=float(num)\r\n\r\nif p!='9':\r\n\tif 5>int(dec[0]):\r\n\t\tprint(n)\r\n\telse:\r\n\t\tprint(int(n)+1)\r\nelse:\r\n\tprint(\"GOTO Vasilisa.\")", "a, dot = input().split('.')\na = int(a)\nb = a + 1 if int(dot[0]) >= 5 else a\nprint(\"GOTO Vasilisa.\" if a % 10 == 9 else b)\n\n\n \t\t\t \t\t \t \t \t\t", "s = input()\nlast_digit_in_integer_part = int(s[s.index('.') - 1])\nfirst_digit_in_fractional_part = int(s[s.index('.') + 1])\n\nif last_digit_in_integer_part == 9:\n print('GOTO Vasilisa.')\nelse:\n if first_digit_in_fractional_part >= 5:\n print(int(s[:s.index('.')]) + 1)\n else:\n print(int(s[:s.index('.')]))", "\r\na, b = input().split(\".\")\r\nif a[-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelif b[0] < '5':\r\n print(a)\r\nelse:\r\n print(int(a) + 1)\r\n\r\n# Codeforcesian\r\n# ♥\r\n", "s=input()\r\ni=s.find('.')\r\nif s[i-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(s[i+1])<5:\r\n print(s[:i])\r\n else:\r\n print(int(s[:i])+1)", "s= input()\r\nint_part = s.split('.')[0]\r\nfrac_part = s.split('.')[1]\r\nif int(int_part) % 10 == 9:\r\n print('GOTO Vasilisa.')\r\nelif int(frac_part[0]) < 5:\r\n print(int(int_part))\r\nelse:\r\n print(int(int_part) + 1)", "from decimal import Decimal, getcontext\r\ngetcontext().prec = 1000\r\na=input()\r\nb=a.split('.');b[-1] = '0.'+b[-1]\r\nif b[0][-1] != \"9\":\r\n if Decimal(b[-1]) < Decimal(0.5):\r\n print(b[0])\r\n elif Decimal(b[-1]) >= Decimal(0.5):\r\n print(int(b[0])+1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "a,b=input().split('.')\r\n\r\nif a[len(a)-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelse :\r\n c=int(a)\r\n if int(b[0])>=5 :\r\n c+=1\r\n print(c)", "n=input()\r\nfor i in range(len(n)):\r\n if(n[i]=='.'):\r\n if(int(n[i-1])==9):\r\n print('GOTO Vasilisa.')\r\n break\r\n elif(int(n[i+1])>=5):\r\n s=int(n[:n.index(n[i])])+1\r\n print(s)\r\n break\r\n else:\r\n print(n[:n.index(n[i])])\r\n break\r\n", "s = input()\r\nx = s.find('.')\r\nif int(s[x - 1]) == 9: print(\"GOTO Vasilisa.\")\r\nelif int(s[x + 1]) < 5: print(s[0:x])\r\nelse: print(s[0:x - 1] + str(int(s[x - 1]) + 1))", "n=input()\r\ni=n.index('.')\r\nif(int(n[i-1])==9):print('GOTO Vasilisa.')\r\nelif(int(n[i+1])>=5):print(n[:i-1]+str(int(n[i-1])+1))\r\nelse:print(n[:i])\r\n", "a,b = input().split(\".\")\r\nif int(a[-1]) == 9:\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(b[0])>=5:\r\n print(int(a)+1)\r\n else:\r\n print(a)", "n = input()\r\na, b = n.split('.')\r\n\r\nif a[-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n print(a if int(b[0]) < 5 else int(a) + 1)", "number = input()\ndot = number.find('.')\n# if(dot==-1):\n# print(number)\n# exit()\n\nif (number[dot-1] == '9'):\n print('GOTO Vasilisa.')\nelif(number[dot+1] >= '5'):\n print(int(number[0:dot])+1)\nelse:\n print(number[0:dot])\n\t \t\t \t \t\t \t\t\t\t \t \t\t\t\t \t\t\t\t", "[print(\"GOTO Vasilisa.\" if i[-1]==\"9\" else i[:-1]+str(int(i[-1])+1) if int(j[0])>4 else i) for i,j in [input().split(\".\")]]", "i, j=map(str,input().split(\".\"))\r\nprint([\"GOTO Vasilisa.\", int(i)+(j[0]>'4')][i[-1]<'9'])\r\n", "s=input()\r\na=s.index(\".\")\r\nif s[a-1]!=\"9\":\r\n print(s[:a-1]+str(int(s[a-1])+1) if int(s[a+1])>=5 else s[:a])\r\nelse:print(\"GOTO Vasilisa.\")", "n=input()\r\nr=n.index('.')\r\nif n[r-1]=='9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if n[r+1]>='5':\r\n print(int(n[:r])+1)\r\n else:\r\n print(n[:r])", "s = input()\r\n\r\ns = s.split(\".\")\r\n\r\nger = s[0]\r\ndec = s[1]\r\ndec = dec[:1]\r\n\r\nif ger[len(ger)-1] != \"9\":\r\n if int(dec) < 5:\r\n print(ger)\r\n else:\r\n print(int(ger)+1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "def okruglenie(s):\r\n z = s.find('.')\r\n s1 = s[:z]\r\n if s1.endswith('9'):\r\n return \"GOTO Vasilisa.\"\r\n elif s1[len(s1) - 1] != '9' and int(s[z + 1:][0]) < 5:\r\n return int(s1)\r\n elif s1[len(s1) - 1] != '9' and int(s[z + 1:][0]) >= 5:\r\n return int(s1) + 1\r\n\r\n\r\nprint(okruglenie(input()))\r\n", "n= input()\r\nip, fp = n.split('.')\r\nl = ip[-1]\r\nif l!= '9':\r\n if int(fp[0]) < 5:\r\n print(ip)\r\n else:\r\n print(int(ip) + 1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "s=input()\nli=s.split('.')\nif(li[0][-1]=='9'):\n print(\"GOTO Vasilisa.\")\nelse:\n if(li[1]<'5'):\n print((int)(li[0]))\n else:\n print((int)(li[0])+1) \n\t\t \t\t\t \t\t\t\t \t \t\t\t \t \t\t\t\t \t \t", "def unclezazu(num):\r\n '''creates a normal rounding function'''\r\n decimal_location = str(num).find(\".\")\r\n int_base = int(num[:decimal_location])\r\n inty = str(int_base)\r\n tenth_place_val = num[decimal_location+1]\r\n if int(tenth_place_val) >= 5:\r\n zazu = int_base + 1\r\n else:\r\n zazu = int_base\r\n if inty[-1] == \"9\":\r\n zazu = \"GOTO Vasilisa.\"\r\n return zazu\r\n\r\n\r\nt = (input())\r\n\r\nprint(unclezazu(t))", "from functools import reduce\nfrom operator import *\nfrom math import *\nfrom sys import *\nfrom string import *\nfrom collections import *\nsetrecursionlimit(10**7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\na,b=input().split('.')\nif a[-1]=='9':\n print(\"GOTO Vasilisa.\")\nelse:\n a=int(a)\n if ord(b[0])>=ord('5'):\n a+=1\n print(a)\n\n\n\n\n\n\n\n\n\n\n\n", "c, d = input().split('.')\r\nif int(c)%10 == 9:\r\n print('GOTO Vasilisa.')\r\nelif int(d[0]) > 4:\r\n print(int(c)+1)\r\nelse:\r\n print(int(c))\r\n", "# https://codeforces.com/problemset/problem/99/A\r\n\r\ninteger, fraction = input().strip().split('.')\r\ncheck,fraction = int(integer[-1]),int(fraction[0])\r\nif(check!=9):\r\n if(fraction<5):\r\n print(integer)\r\n else:\r\n print(int(integer)+1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "n=input()\r\nk=n.index('.')\r\nif n[k-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n p=int(n[k+1:k+2])\r\n if p>=5:\r\n print(int(n[0:k])+1)\r\n else:\r\n print(int(n[0:k]))", "n = input()\npos = n.index('.')\nif(n[pos-1] == '9'):\n\tprint(\"GOTO Vasilisa.\")\nelse:\n\tif(n[pos+1]<'5'):\n\t\tprint(n[:pos])\n\telse:\n\t\tprint(n[:pos-1], end='')\n\t\tprint(int(n[pos-1])+1)\n\t \t \t\t\t\t\t \t\t \t\t\t \t \t \t\t", "s = input().split('.')\r\nn = len(s[0])\r\nif s[0][n-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n s0 = int(s[0])\r\n if s[1][0] > '4':\r\n s0 += 1\r\n print(s0)\r\n", "n = input()\nind = n.index(\".\") - 1\nif n[ind] == '9':\n print('GOTO Vasilisa.')\nelse:\n f = float(n[ind+1:])\n ans = 0\n if n[ind + 2] == '5':\n ans = 1\n else:\n ans = round(f)\n nums = 0\n for i in range(0, ind+1):\n r = int(n[i])\n nums = nums*10 + r\n\n nums += ans\n stri = ''\n if not nums:\n print(0)\n else:\n while nums:\n r = nums%10\n stri += str(r)\n nums //= 10\n print(stri[::-1])\n\t \t \t \t\t \t\t\t \t \t \t\t\t", "st, nd = input().split('.')\r\nprint('GOTO Vasilisa.' if st[-1] == '9' else (st if nd[0] < '5' else int(st) + 1))", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nn=input(\"\").split('.')\nif n[0][-1]=='9':\n print(\"GOTO Vasilisa.\")\nelse:\n if n[1][0]>='5':\n print(int(n[0])+1)\n else :\n print(n[0])", "line = input()\r\nseparator = line.find('.')\r\nintegerPart = line[:separator]\r\nif integerPart[-1] == '9':\r\n integerPart = \"GOTO Vasilisa.\"\r\nelif line[separator + 1] >= '5':\r\n integerPart = str(int(integerPart) + 1)\r\nprint(integerPart)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Dec 15 16:40:29 2020\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\n\r\ndef number(string):\r\n for i in range(len(string)):\r\n if string[i]=='.':\r\n if string[i-1]=='9':\r\n return 'GOTO Vasilisa.'\r\n elif int(string[i+1])<5:\r\n return string[:i]\r\n elif int(string[i+1])>=5:\r\n return str(int(string[:i])+1)\r\nstring=input()\r\nprint(number(string))\r\n ", "import math\r\ns = input()\r\nd = s.index('.')\r\nif s[d - 1] == '9':\r\n print('GOTO Vasilisa.')\r\nelif int(s[d + 1]) < 5:\r\n print(s[:d])\r\nelse:\r\n print(s[:d - 1] + str(int(s[d - 1]) + 1))\r\n", "a,b = str(input()).split('.')\r\n\r\nif (a[-1] == '9'):\r\n print (\"GOTO Vasilisa.\")\r\nelif (int(b[0]) < 5):\r\n print (a)\r\nelif (int(b[0]) >= 5):\r\n t = int(a[-1])\r\n print (a[:-1]+str(t+1))", "import os\r\nfrom math import*\r\n\r\ns=input()\r\ns=list(s)\r\npos=s.index(\".\")-1\r\nif s[pos]==\"9\":\r\n\tprint(\"GOTO Vasilisa.\")\r\nelse:\r\n\tif int(s[pos+2])<5:\r\n\t\tfor i in range(pos+1):\r\n\t\t\tprint(s[i],end='')\r\n\telse:\r\n\t\tfor i in range(pos):\r\n\t\t\tprint(s[i],end='')\r\n\t\tprint(int(s[pos])+1)\r\n\r\n", "def main():\n numero = input().split(\".\")\n inteiro = numero[0]\n decimal = numero[1]\n\n if(inteiro[len(inteiro)-1] == '9'):\n print(\"GOTO Vasilisa.\")\n else:\n if(int(decimal[0]) >= 5):\n print(int(inteiro)+1)\n else:\n print(inteiro)\n\nif __name__ == '__main__':\n main()\n\t\t \t \t\t \t \t\t \t \t", "a, b = input().split('.')\r\n\r\nif a[-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelif int(b[0]) >= 5:\r\n s = a[:-1]\r\n s += chr(ord(a[-1]) + 1)\r\n print(s)\r\nelse:\r\n print(a)", "num = input()\nfor i in range(len(num)):\n\tif num[i] == '.': \n\t\tpoint = i\n\t\tbreak\nop = ''\nif num[point - 1] < '9':\n\tfor i in range(point - 1):\n\t\top += num[i]\n\tif num[point + 1] >= '5': op += str(int(num[point - 1]) + 1)\n\telse: op += num[point - 1]\nelse: op = 'GOTO Vasilisa.'\nprint(op)\n \t \t \t \t\t\t \t \t\t \t \t\t\t \t\t", "number = input(\"\")\nnumberparts = number.split(\".\")\nintpart = numberparts[0]\ndecimalpart = numberparts[1]\nif intpart[-1] == '9':\n print(\"GOTO Vasilisa.\")\nelif int(decimalpart[0]) >= 5:\n print(int(intpart)+1)\nelse:\n print(intpart)", "n = input()\r\not = 0\r\nif int(n[n.find(\".\")-1]) == 9:\r\n ot = \"GOTO Vasilisa.\"\r\nelif int(n[n.find(\".\")+1]) + 5 >= 10:\r\n ot = int(n[:n.find(\".\")])+1\r\nelse:\r\n ot = n[:n.find(\".\")]\r\n\r\nprint(ot)", "t=list(input())\r\ns=t.index('.')\r\n\r\nif(t[s-1]=='9'):\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if(t[s+1]>='5'):\r\n for i in range(0,s-1):\r\n print(t[i],end=\"\")\r\n e=int(t[s-1])+1\r\n print(e)\r\n \r\n else:\r\n for i in range(0,s):\r\n print(t[i],end=\"\")", "number = input()\r\ni, f = number.split('.')\r\nif i[-1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(f[0]) >= 5:\r\n i = str(int(i) + 1)\r\n print(i)# 1689258086.4452024", "t = input()\r\nk = t.find('.')\r\nif k < 0: print(int(t))\r\nelif t[k - 1] == '9': print('GOTO Vasilisa.')\r\nelse: print(int(t[:k]) + int(t[k + 1] > '4'))", "n = input()\r\nfor i in range(len(n)):\r\n if n[i] == \".\":\r\n if n[i-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\n elif int(n[i+1]) < 5:\r\n print(n[:i])\r\n else:\r\n print( n[:i-1] + str( int(n[i-1])+1) ) ", "import math\r\nn = input()\r\ni=n.find(\".\")\r\ns = n[:i]\r\nif s[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelif n[i+1]>=\"5\":\r\n print(int(s)+1)\r\nelse:\r\n print(int(s))\r\n ", "l = input().split('.')\nif l[0][-1] == '9':\n print('GOTO Vasilisa.')\nelse:\n if(l[1][0] >= '5'):\n print(int(l[0])+1)\n else:\n print(int(l[0]))\n", "a=input().split('.')\r\nif a[0][-1]=='9':print('GOTO Vasilisa.')\r\nelse:print(int(a[0])+int(a[1][0]in'56789'))", "a = list(map(str,input().strip()))\nlists =[\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\"]\nb=int(len(a))\nc=0\nfor i in range(b):\n if a[i] == \".\":\n c = i\n#print(c)\nd=a[:c]\nif a[c-1]==\"9\":\n print(\"GOTO Vasilisa.\")\nelif a[c+1]>=\"5\":\n temp = lists.index(a[c-1])\n a[c-1]=lists[temp+1]\n d = a[:c]\n print(\"\".join(map(str,d)))\nelif a[c+1]<\"5\":\n print(\"\".join(map(str,d)))\n \t \t \t\t \t\t\t\t\t\t\t\t", "f = input().split('.')\r\nprint('GOTO Vasilisa.'if f[0][-1] == '9' else int(f[0]) + 1 if int(f[-1][0]) > 4 else int(f[0]))", "a = input()\nb = 0\nif \".\" in a:x = a.index(\".\")\nb = a[:x]\nc = a[x + 1]\nif b[-1] == \"9\":print(\"GOTO Vasilisa.\")\nelse:\n\tif int(c) < 5:print(b)\n\telse:print(int(b) + 1)\n", "number = input()\ninteger, decimal = number.split('.')\nif int(integer) % 10 == 9:\n print('GOTO Vasilisa.')\nelse:\n if int(decimal[0]) >= 5:\n print(int(integer) + 1)\n else:\n print(int(integer))", "\r\n\r\ns = input()\r\nnuqta = s.index(\".\")\r\nbutun_qism = int(s[0:nuqta])\r\nkasr_qism = int(s[nuqta+1:])\r\nif(butun_qism%10 == 9):\r\n\tprint(\"GOTO Vasilisa.\")\r\nelse:\r\n\tif(int(s[nuqta+1]) >= 5):\r\n\t\tprint(butun_qism+1)\r\n\telse:\r\n\t\tprint(butun_qism)\r\n", "s=input()\r\ni=s.find(\".\")\r\nif s[i-1]!=\"9\":\r\n\t\tprint(int(s[:i])if int(s[i+1])<5 else int(s[:i])+1)\r\nelse:\r\n\tprint(\"GOTO Vasilisa.\")", "num = list(input())\n\ni_dot = num.index(\".\")\n\nif int(num[i_dot - 1]) == 9:\n\tprint(\"GOTO Vasilisa.\")\nelse:\n\tif int(num[i_dot + 1]) >= 5:\n\t\tnum[i_dot-1] = str(int(num[i_dot-1]) + 1)\n\tprint(\"\".join(num[:i_dot]))\n\t\n\t \t \t \t\t\t \t\t\t \t\t\t\t \t \t\t\t\t\t", "x, y = map(str, input(). split(\".\"))\r\nif x[-1] == \"9\" or x == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelif int(y[0]) < 5:\r\n print(int(x))\r\nelse:\r\n print(int(x)+1)\r\n", "a,b=input().split(\".\")\r\nif(a[-1]=='9'):print(\"GOTO Vasilisa.\")\r\nelif(b[0]>'4'):print(int(a)+1)\r\nelse:print(a)\r\n", "n = input().split('.')\r\n\r\ncel, drob = n[0], n[1]\r\n\r\nif cel[-1] == '9': print('GOTO Vasilisa.')\r\nelif drob[0] < '5': print(cel)\r\nelse: print(int(cel)+1)", "s = input().split('.')\r\nif s[0][-1] == '9':\r\n\tprint(\"GOTO Vasilisa.\")\r\n\r\nelif int(s[1][0]) < 5:\r\n\tprint (int(s[0]))\r\n\r\nelse:\r\n\tprint(int(s[0])+1)\r\n", "a = input()\r\nindx = a.index('.')\r\nif a[indx-1] == '9':\r\n print('GOTO Vasilisa.')\r\nif a[indx-1] != '9':\r\n iq = a[indx + 1]\r\n iq = int(iq)\r\n if iq < 5:\r\n print(a[:indx])\r\n else:\r\n aq = int(a[:indx])\r\n print(aq + 1)", "num=input()\nspl_lst=num.split(\".\")\nif(int(spl_lst[0][-1])!=9):\n if(int(spl_lst[1][0])<5):\n print(int(spl_lst[0]))\n else:\n print(int(spl_lst[0])+1)\nelse:\n print(\"GOTO Vasilisa.\")\n \t \t\t \t\t\t\t \t \t \t\t\t\t\t\t\t \t", "number = input()\ninteger, fractional = list(str(num) for num in number.split(\".\"))\n\nfinal_answer = int(integer)\nif integer[-1] != \"9\":\n if int(fractional[0]) >= 5:\n final_answer = final_answer + 1\nelse:\n final_answer = \"GOTO Vasilisa.\"\n\nprint(final_answer)\n\t \t\t\t\t \t\t \t \t\t \t \t \t \t \t", "n = input().split('.')\n\nif n[0][-1] == '9':\n print('GOTO Vasilisa.')\nelif int(n[1][0]) <= 4:\n print(int(n[0]))\nelse:\n print(int(n[0])+1)\n \t \t \t\t \t\t \t\t\t\t\t \t\t\t\t\t\t", "S=input()\r\nif S[S.index(\".\")-1]==\"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(S[S.index(\".\")+1])<=4:\r\n print(S[:S.index(\".\")])\r\n else:\r\n print(S[:S.index(\".\")-1]+str(int(S[S.index(\".\")-1])+1))\r\n", "n, f = input().split('.')\r\nprint(* n[-1] == '9' and 'GOTO Vasilisa.' or (n[:-1], int(n[-1]) + int(f[0] >= '5')), sep='')\r\n", "s = input()\r\nif s[s.index(\".\")-1] == '9': print(\"GOTO Vasilisa.\")\r\nelse:\r\n\tif int(s[s.index(\".\")+1]) < 5:\r\n\t\tprint(s[:s.index(\".\")])\r\n\telse:\r\n\t\tprint(int(s[:s.index(\".\")])+1)", "if __name__ == '__main__':\n a, b = input().split(\".\")\n\n if a[-1] == '9':\n print('GOTO Vasilisa.')\n elif b[0] > '4':\n print(int(a) + 1)\n else:\n print(int(a))\n\n\t\t \t \t \t \t\t \t\t\t\t \t", "i, f = input().split('.')\r\nif i[-1] != '9':\r\n if f[0] >= '5':\r\n print(i[:-1], chr(ord(i[-1]) + 1), sep='')\r\n else:\r\n print(i)\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "s, x = input().split('.')\nx = int(x[0])\nif s[-1] == '9':\n print('GOTO Vasilisa.')\nelse:\n if x < 5:\n print(int(s))\n else:\n print(int(s) + 1)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input().rstrip())\r\ni = s.index(\".\")\r\nif s[i - 1] == \"9\":\r\n ans = \"GOTO Vasilisa.\"\r\nelse:\r\n ans = s[:i]\r\n if int(s[i + 1]) >= 5:\r\n ans[-1] = str(int(ans[-1]) + 1)\r\n ans = \"\".join(ans)\r\nprint(ans)", "n = input()\nindex = 0\nn_1 = ''\npoint = 0\nfor i in n:\n if i != '.':\n index += 1\n continue\n else:\n n_1 = n[:index]\n temp= n[index + 1:]\n point = int(temp[0])\n break\nif n_1[-1] == '9':\n print(\"GOTO Vasilisa.\")\nelse:\n n_2 = n_1[:-1]\n calculate = int(n_1[-1])\n if point <= 4:\n print(n_2 + str(calculate))\n else:\n print(n_2 + str(calculate + 1))\n#1111\n#111\n\n \t\t \t\t \t \t\t\t\t\t \t \t \t\t\t", "n=input()\r\ni,d=n.split(\".\")\r\nif i[-1]==\"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(d[0])<5:\r\n print(i)\r\n else:\r\n print(int(i)+1)", "def main(d):\r\n n = d.find('.')\r\n if int(d[n+1]) < 5 and int(d[n-1]) != 9:\r\n return int(d[:d.find('.')])\r\n elif int(d[n-1]) != 9:\r\n return int(d[:d.find('.')]) + 1\r\n else:\r\n return \"GOTO Vasilisa.\"\r\n \r\nprint(main(input()))\r\n", "a=list(input())\r\ni=len(a)-1\r\nwhile i>=0:\r\n if a[i]=='.':\r\n if a[i+1]<'5' and a[i-1]!='9':\r\n for j in range(i):\r\n print(a[j],end=\"\")\r\n elif a[i+1]>='5' and a[i-1]!='9':\r\n n=0\r\n for j in range(i):\r\n n=n*10\r\n n=n+int(a[j])\r\n print(n+1)\r\n else:\r\n print(\"GOTO Vasilisa.\")\r\n i-=1\r\n\r\n", "num = input().strip()\r\ninteger_part, decimal_part = num.split(\".\")\r\nif integer_part[-1] != \"9\":\r\n if int(decimal_part[0]) < 5:\r\n rounded_num = integer_part\r\n else:\r\n rounded_num = str(int(integer_part) + 1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")\r\n exit()\r\nprint(int(rounded_num))\r\n", "k=str(input())\ni=0\ns=\"\"\nwhile (i!=len(k)-1):\n\tif (k[i+1]=='.'):\n\t\tif (int(k[i])==9):\n\t\t\tprint (\"GOTO Vasilisa.\")\n\t\t\tbreak\n\t\telse:\n\t\t\tif (int(k[i+2])>=5):\n\t\t\t\ts+=(str(int(k[i])+1))\n\t\t\telse:\n\t\t\t\ts+=k[i]\n\t\t\tprint (s)\n\t\t\tbreak\n\telse:\n\t\ts+=k[i]\n\ti+=1\n\t\n\n\n", "s=input()\r\nind=s.index('.')\r\ns1=s[0:ind]\r\ns2=s[ind:]\r\nif(s1[-1]=='9'):\r\n print('GOTO Vasilisa.')\r\nelif(s1[-1]!='9' and float(s2[0:2])>=0.5):\r\n print(int(s1)+1)\r\nelse:\r\n print(int(s1))", "n, mod = input().split('.')\r\n\r\nif n[-1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelif int(mod[0]) < 5:\r\n print(n)\r\nelse:\r\n print(n[:-1] + str(int(n[-1])+1))\r\n", "inteira, fracionaria = input().split('.')\n\nif inteira[-1] == '9':\n print('GOTO Vasilisa.')\nelse:\n if int(fracionaria[0]) < 5:\n print(inteira)\n else:\n print(int(inteira) + 1)\n \t\t \t \t \t\t\t \t \t\t \t \t", "s = input()\n(integer, fraction) = s.split('.')\nif int(integer[-1]) != 9 and int(fraction[0]) < 5:\n print(integer)\nelif int(integer[-1]) != 9 and int(fraction[0]) >= 5:\n print(int(integer)+1)\nelse:\n print(\"GOTO Vasilisa.\")\n", "a,b=input().split('.')\r\nif int(a)%10==9:\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if int(b[0])>4:\r\n print(int(a)+1)\r\n else:\r\n print(a)", "# https://codeforces.com/problemset/problem/99/A# https://codeforces.com/problemset/problem/99/A\r\n\r\ninteger, decimal = input().split(\".\")\r\n\r\nif int(integer[-1]) % 10 == 9:\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(decimal[0]) >= 5:\r\n print(int(integer)+1)\r\n else:\r\n print(int(integer))", "a,b = input().split('.')\na = int(a)\nif len(b)>3:\n b = b[:3]\nb = round(float('1.'+b))-1\nif a%10 is 9:\n print('GOTO Vasilisa.')\nelse:\n print(a+b)\n\t \t\t\t \t \t \t \t\t\t\t\t \t \t \t\t", "n = input()\r\nt = n.find('.')\r\nt-=1\r\nif n[t] != '9':\r\n h = ''\r\n h2 = ''\r\n for i in range(len(n)):\r\n if int(n[t + 2]) >= 5:\r\n h += n[i]\r\n if n[i] == '.':\r\n break\r\n else:\r\n h2 += n[i]\r\n if n[i+1] == '.':\r\n break\r\n\r\n if int(n[t + 2]) >= 5:\r\n print(int(h.replace('.', ''))+1)\r\n else:\r\n h2.replace('.', '')\r\n print(h2)\r\nelse:\r\n print('GOTO Vasilisa.')\r\n", "n = input()\npoint = n.index('.')\nstr = ''\nif n[point - 1] == '9': print('GOTO Vasilisa.')\nelse:\n for i in range(point): str += n[i]\n if n[point + 1] < '5': print(str)\n else: print(int(str) + 1)\n \t\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\na,b=input().split('.')\r\nif a[-1]<'9':\r\n\tif b[0]<='4':\r\n\t\tprint(int(a))\r\n\telse:\r\n\t\tprint(int(a)+1)\r\nelse:\t\t\t\r\n\tprint('GOTO Vasilisa.')", "import math\r\nfrom fractions import Fraction as frac\r\n\r\nMOD = 1e9 + 7\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\ndef no():\r\n print(\"NO\")\r\n return\r\n\r\ndef yes():\r\n print(\"YES\")\r\n return\r\n\r\ndef solve(case_no):\r\n s = str(input())\r\n sl = len(s)\r\n for i in range(sl):\r\n if s[i] == '.':\r\n if s[i - 1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\n else:\r\n ans = int(s[:i])\r\n if ord(s[i + 1]) >= ord('5'):\r\n ans += 1\r\n print(ans)\r\n\r\nt = 1\r\n# t = int(input())\r\nfor i in range(1, t + 1):\r\n solve(i)\r\n", "num = input()\npoint = num.index('.')\nif num[point - 1] == '9': print('GOTO Vasilisa.')\nelse:\n if num[point + 1] < '5': print(num[0: point])\n else: print(int(num[0: point]) + 1)\n \t\t\t \t\t \t \t \t \t \t \t\t \t", "n=list(map(str,input().split(\".\")))\r\nif(int(n[0])%10!=9):\r\n if(int(n[1][0])>=5):\r\n print(int(n[0])+1)\r\n else:\r\n print(int(n[0]))\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "s = input()\r\na = \"\"\r\nb = \"0.\"\r\nc = 0\r\nfor i in range(len(s)):\r\n\tif s[i]==\".\":\r\n\t\ta = s[0:i]\r\n\t\tb += s[i+1]\t\t\t\t\r\nif a[-1]==\"9\":\r\n\tprint(\"GOTO Vasilisa.\")\r\nelif a[-1]!=\"9\" and float(b)>=0.5:\r\n\tc = int(a[-1])+1\r\n\tprint(a[0:len(a)-1]+str(c))\r\nelif a[-1]!=\"9\" and float(b)<0.5:\r\n\tprint(a[0:len(a)+1])\t\r\n", "s=input()\r\nz=s.index(\".\")\r\nif s[z-1]==\"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse :\r\n if int(s[z+1])<5:\r\n print(int(s[:z]))\r\n else :\r\n print(int(s[:z])+1)", "n = str(input())\n\n\ndef find_left_part(n: str) -> str:\n sp = n.split('.')\n return sp[0]\n\n\ndef find_right_part(n: str) -> str:\n sp = n.split('.')\n return sp[1]\n\n\ndef solve(n: str):\n left_part = int(find_left_part(n))\n right_part = find_right_part(n)\n\n is_last_9 = left_part % 10 == 9\n first_right = right_part[0]\n if not is_last_9 and first_right < '5':\n return left_part\n\n if not is_last_9 and first_right >= '5':\n return left_part + 1\n\n if is_last_9:\n return \"GOTO Vasilisa.\"\n\n\nprint(solve(n))\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = input().rstrip()\r\nidx = n.index('.')\r\nif n[idx - 1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(n[idx + 1]) < 5:\r\n print(n[:idx])\r\n else:\r\n print(int(n[:idx]) + 1)", "t,x=input().split(\".\")\nif t[-1]=='9':\n print(\"GOTO Vasilisa.\")\nelif int(x[0])<5:\n print(t)\nelif int(x[0])>=5:\n print(int(t)+1)\n \t \t \t \t \t \t \t\t\t \t", "n = input().strip()\r\nint_part, decimal_part = n.split('.')\r\nif int_part[-1] != '9':\r\n if int(decimal_part[0]) < 5:\r\n print(int_part)\r\n else:\r\n print(int(int_part) + 1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "n=input()\r\nn=n.split(\".\")\r\nt=list(n[0])\r\nk=list(n[1])\r\nm=int(k[0])\r\nif t[len(t)-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelif t[len(t)-1]!=\"9\" and m<5:\r\n t=\"\".join(t)\r\n print(t)\r\nelse:\r\n t=\"\".join(t)\r\n t=str(int(t)+1)\r\n print(t)", "def main():\n parts = input().split('.')\n\n if parts[0][len(parts[0]) - 1] == '9':\n print('GOTO Vasilisa.')\n else:\n if parts[1][0] not in '01234':\n add_1 = {'0': '1', '1': '2', '2': '3', '3': '4', '4': '5', '5': '6', '6': '7', '7': '8', '8': '9'}\n last_index = len(parts[0]) - 1\n parts[0] = parts[0][:last_index] + add_1[parts[0][last_index]]\n\n print(parts[0])\n\n\nif __name__ == '__main__':\n main()\n", "m,n= input().split(\".\")\r\nif m[-1]==\"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n l=n[0]>\"4\"\r\n print(int(m)+l)", "barrel=list(input().strip().split('.'))\r\ninteger=barrel[0]\r\ndecimal=barrel[1]\r\nn=len(integer)\r\nif(int(integer[n-1])<9):\r\n if(int(decimal[0])>=5):\r\n print(int(integer)+1)\r\n else:\r\n print(int(integer))\r\nelse:\r\n print('GOTO Vasilisa.')", "s=list(input());r=s.index('.')\r\nif s[r-1]=='9':print('GOTO Vasilisa.')\r\nelse:\r\n if s[r+1]>='5':s[r-1]=str(int(s[r-1])+1)\r\n print(''.join(s[:r]))", "n = input()\r\n\r\n\r\ndef okr(p):\r\n z = p.find('.')\r\n x = p[z - 1]\r\n if x != '9':\r\n return int(p[z + 1])\r\n else:\r\n return 'V'\r\n\r\n\r\nif okr(n) == 'V':\r\n print('GOTO Vasilisa.')\r\nelif okr(n) < 5:\r\n print(n[:n.find('.')])\r\nelif okr(n) >= 5:\r\n print(n[:n.find('.') - 1] + str(int(n[n.find('.') - 1]) + 1))\r\n", "beforepoint_part, afterpoint_part = input().split(\".\")\r\nlast_digit = int(beforepoint_part[-1])\r\nif last_digit == 9:\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(afterpoint_part[0]) < 5:\r\n print(beforepoint_part)\r\n else:\r\n print(int(beforepoint_part) + 1)\r\n", "import sys\r\n\r\nx, y = (el for el in input().split('.'))\r\n\r\nif x[-1] != '9':\r\n if y < '5':\r\n print(x)\r\n sys.exit()\r\n else:\r\n print(int(x) + 1)\r\n sys.exit()\r\nelse:\r\n print(\"GOTO Vasilisa.\")\r\n ", "num = input()\npoint = num.index('.')\nstr = ''\nif num[point - 1] == '9': print('GOTO Vasilisa.')\nelse:\n for i in range(point): str += num[i]\n if num[point + 1] < '5': print(str)\n else: print(int(str) + 1)\n \t \t \t\t\t\t \t\t \t \t \t\t", "num = input()\r\n\r\nnindex = num.index(\".\")\r\n\r\nif num[nindex - 1] != \"9\":\r\n if int(num[nindex + 1]) <= 4:\r\n numsubstr = num[nindex:-1] + num[-1]\r\n decimalnum = num.replace(numsubstr, \"\")\r\n print(int(decimalnum))\r\n elif int(num[nindex + 1]) >= 5:\r\n numsubstr = num[nindex:-1] + num[-1]\r\n decimalnum = num.replace(numsubstr, \"\")\r\n print(int(decimalnum) + 1)\r\n\r\nelse:\r\n print(\"GOTO Vasilisa.\")\r\n", "from decimal import *\r\ngetcontext().prec=1000\r\na=input()\r\nx=a.split('.')[0][-1]\r\nprint([int(Decimal(a)+Decimal(0.5)),'GOTO Vasilisa.'][x=='9'])", "n = input()\r\nidx = n.index('.')\r\n\r\nif n[idx-1] == '9': print(\"GOTO Vasilisa.\")\r\nelse:\r\n if n[idx+1] < '5': print(n[:idx])\r\n else: print(int(n[:idx]) + 1) ", "n = input()\r\n\r\nans = \"\"\r\ncapture_next = False\r\nfor char in n:\r\n if char == \".\":\r\n capture_next = True\r\n\r\n elif capture_next:\r\n last_digit = char\r\n break\r\n\r\n else:\r\n ans += char\r\n\r\nif ans[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(last_digit) < 5:\r\n print(ans)\r\n\r\n else:\r\n s = ans[:-1] + str(int(ans[-1]) +1)\r\n\r\n print(s)\r\n\r\n\r\n\r\n\r\n", "s=str(input())\ns1=\"\"\ns2=\"\"\np=0\nflag=0\nsum=0\nfor i in range(0,len(s),1):\n if(s[i]!='.'):\n s1+=s[i]\n if(s[i]=='.'):\n p=i\n break\n\n \nfor i in range(p+1,len(s),1):\n s2+=s[i]\n\nif(int(s2[0])<5 and int(s1[len(s1)-1])!=9):\n print(s1)\nelif(int(s2[0])>=5 and int(s1[len(s1)-1])!=9):\n print(int(s1)+1)\nelif(int(s1[len(s1)-1])==9):\n print(\"GOTO Vasilisa.\")\n \n\n\t\t\t \t \t\t\t \t\t \t\t \t \t \t \t \t", "s=input().split('.')\r\nif s[0][-1]!='9':\r\n if s[1][0]<'5':print(s[0])\r\n else:print(int(s[0])+1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")", "##def common(sa):\r\n## return max(set(sa), key=sa.count)\r\n##\r\n##sa = int(input())\r\n##cups = [int(input()) for x in range(sa)]\r\n##if len(set(cups))==1:\r\n## print(\"Exemplary pages.\")\r\n##elif sa==2:\r\n## a = cups[0]\r\n## b = cups[1]\r\n## if a==b:\r\n## print(\"Exemplary pages.\")\r\n## else: \r\n## if (a+b)%2==1:\r\n## print(\"Unrecoverable configuration.\")\r\n## else:\r\n## if a>=b:\r\n## num = int(abs((b-a)/2))\r\n## print(str(num)+' ml. from cup #2 to cup #1.')\r\n## else:\r\n## num = int(abs((b-a)/2))\r\n## print(str(num)+' ml. from cup #1 to cup #2.')\r\n##\r\n##elif sa==3:\r\n## a=cups[0]\r\n## b=cups[1]\r\n## c=cups[2]\r\n##\r\n## if a==b==c:\r\n## print(\"Exemplary pages.\")\r\n## elif a==b or b==c or a==c:\r\n## print(\"Unrecoverable configuration.\")\r\n## else:\r\n## if a <= b <= c:\r\n## if b == int((a+c)/2):\r\n## diff = int(abs(b-a))\r\n## print(str(diff)+' ml. from cup #1 to cup #3.')\r\n## else:\r\n## print('Unrecoverable configuration.')\r\n## \r\n## elif a<=c<=b:\r\n## a, b, c = a, c, b\r\n## if b == int((a+c)/2):\r\n## diff = int(abs(b-a))\r\n## print(str(diff)+' ml. from cup #1 to cup #2.')\r\n## else:\r\n## print('Unrecoverable configuration.')\r\n##\r\n## elif b <= c <=a:\r\n## a, b, c = b, c, a\r\n## if b == int((a+c)/2):\r\n## diff = int(abs(b-a))\r\n## print(str(diff)+' ml. from cup #2 to cup #1.')\r\n## else:\r\n## print('Unrecoverable configuration.')\r\n## elif b <= a <=c:\r\n## a, b, c = b, a, c\r\n## if b == int((a+c)/2):\r\n## diff = int(abs(b-a))\r\n## print(str(diff)+' ml. from cup #2 to cup #3.')\r\n## else:\r\n## print('Unrecoverable configuration.')\r\n## elif c <= a <=b:\r\n## a, b, c = c, a, b\r\n## if b == int((a+c)/2):\r\n## diff = int(abs(b-a))\r\n## print(str(diff)+' ml. from cup #3 to cup #2.')\r\n## else:\r\n## print('Unrecoverable configuration.')\r\n## elif c<=b<=a:\r\n## a, b, c = c, b, a\r\n## if b == int((a+c)/2):\r\n## diff = int(abs(b-a))\r\n## print(str(diff)+' ml. from cup #3 to cup #1.')\r\n## else:\r\n## print('Unrecoverable configuration.')\r\n##\r\n##else:\r\n## best = common(cups)\r\n## sa2 = [x-best for x in cups]\r\n## indices=[]\r\n## difflist = []\r\n## for x in range(len(sa2)):\r\n## if sa2[x] != 0:\r\n## indices.append(x)\r\n## difflist.append(sa2[x])\r\n## \r\n## if len(difflist) != 2:\r\n## print(\"Unrecoverable configuration.\")\r\n## \r\n## else:\r\n## if (difflist[0]+difflist[1])%2!=0:\r\n## print(\"Unrecoverable configuration.\")\r\n## else:\r\n## if difflist[0] > 0:\r\n## print(str(abs(difflist[0]))+' ml. from cup #' + str(indices[1]+1)+' to cup #'+str(indices[0]+1)+'.')\r\n## else:\r\n## print(str(abs(difflist[1]))+' ml. from cup #' + str(indices[0]+1)+' to cup #'+str(indices[1]+1)+'.')\r\n\r\na, b = map(str, input().split('.'))\r\nif int(a)%10 == 9:\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(str(b)[0])<5:\r\n print(a)\r\n else:\r\n print(int(a)+1)\r\n", "line = input()\r\nline = line.split('.')\r\na = int(line[0])\r\nb = (line[1])\r\nif(a%10==9):\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if b[0] >='5':\r\n a+=1\r\n print(a)", "a = input()\r\nt = a.split(\".\")[0]\r\ntt = int(a.split(\".\")[1][0])\r\nif t[len(t)-1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n t = int(t)\r\n if tt >= 5:\r\n t+=1\r\n print(t)", "s, fl, so = input(), '', \"\"\r\nfor x in range(len(s)):\r\n if s[x] == '.':\r\n fl = s[x + 1]\r\n break\r\n so += s[x]\r\nif so[len(so) - 1] == '9': print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(fl) >= 5: print(int(so) + 1)\r\n else: print(so)", "s = input()\n\ni = 0\nwhile s[i] != \".\":\n i += 1\n\nt = int(s[:i])\nif s[i-1] == \"9\":\n print(\"GOTO Vasilisa.\")\n exit(0)\nelif s[i+1] >= \"5\":\n t += 1\n\nprint(t)\n", "import math\nx= input()\ni,j = x.split(\".\")\nif i[-1] =='9':\n\tprint(\"GOTO Vasilisa.\")\nelse:\n\tif int(j[0])<5:\n\t\tprint(int(i))\n\telse:\n\t\tprint(int(i)+1)\n\t\t\n", "integer, fractional = input().split(\".\")\nfractional = fractional[:2]\n\nif integer[-1] == \"9\":\n print(\"GOTO Vasilisa.\")\nelse:\n if fractional[0] >= \"5\":\n print(int(integer) + 1)\n else:\n print(integer)\n", "n = input()\r\n\r\na = n.index('.')\r\nb = int(n[:a])\r\nc = int(n[a + 1])\r\n\r\nif n[a - 1] == '9':\r\n print('GOTO Vasilisa.')\r\nelif c <= 4:\r\n print(b)\r\nelse:\r\n print(b + 1)\r\n\r\n", "a = str(input())\nfor i in range(len(a)):\n if a[i] ==\".\":\n if a[i-1] == \"9\":\n print(\"GOTO Vasilisa.\")\n break\n else:\n if int(a[i+1]) >= 5:\n a = a[0:i]\n a = int(a) + 1\n print(a)\n break\n else:\n a = a[0:i]\n a = int(a)\n print(a)\n break\n else:\n continue\n \t \t\t\t\t \t\t \t \t\t\t", "#Davidson Lisboa Della Piazza, 169786\n\nimport math\n\nx = input()\nx = list(x)\nflag = 0\ndecdigs = []\nintdigs = []\nfor i in range(len(x)):\n if(x[i]=='.'):\n flag = 1\n if(flag==0):\n intdigs.append(x[i])\n elif(x[i]!='.'):\n decdigs.append(x[i])\n\nfive = '5'\ndec = ''\nfor i in decdigs:\n dec= dec+i\n five = five+'0'\ndec = int(dec)\nfive = int(five[:-1])\n\ninte = ''\nfor i in intdigs:\n inte = inte+i\ninte = int(inte)\n\nif(intdigs[-1]!='9'):\n if(dec<five):\n print(inte)\n else:\n print(inte+1)\nelse:\n print(\"GOTO Vasilisa.\")\n \t\t \t \t \t\t \t \t\t\t \t \t\t\t", "n,d = input().split('.')\r\n\r\nif (int(n[-1]) == 9):\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if (int(d[0]) >= 5):\r\n print(str(int(n) + 1))\r\n else:\r\n print(n)", "import math\r\nN=input()\r\ni=N.index(\".\")\r\nx=N[i-1]\r\n \r\nif(x==\"9\"):\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if(int(N[i+1])<5):\r\n print(N[:i])\r\n else:\r\n print(N[:i-1]+str(int(x)+1))", "int_part, fract_part = input().split('.')\r\n\r\nif int_part[-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n print(int_part if int(fract_part[0]) < 5 else int(int_part) + 1)", "a = (input())\r\nb = a.index(\".\")\r\nc = 0\r\nif int(a[b-1])!=9 and int((a[b+1]))<5:\r\n print(int(a[:b]))\r\nelif int(a[b-1])!=9 and int((a[b+1]))>=5:\r\n print(int(a[:b])+1)\r\nelif int(a[b-1])==9:\r\n print(\"GOTO Vasilisa.\")", "i,d = input().split('.')\r\nif i[-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelif int(d[0])<5:\r\n print(i)\r\nelse:\r\n print(int(i)+1)\r\n", "from math import ceil\r\n\r\n\r\ndef solve():\r\n x = input()\r\n s = x.split(\".\")\r\n if not s[0].endswith(\"9\"):\r\n d = s[-1]\r\n if int(d[0]) >= 5:\r\n print(f\"{s[0][:-1]}{int(s[0][-1]) + 1}\")\r\n else:\r\n print(s[0])\r\n else:\r\n print(\"GOTO Vasilisa.\")\r\n\r\n\r\n\r\nfor _ in range(1):\r\n solve()", "a, b=map(str,input().split(\".\"))\r\nprint([\"GOTO Vasilisa.\", int(a)+(b[0]>'4')][a[-1]<'9']);\r\n", "s = input()\r\nif s[s.index(\".\")-1]!=\"9\" and int(s[s.index(\".\")+1])>=5:\r\n\tprint(int(s[:s.index(\".\")])+1)\r\nelif s[s.index(\".\")-1]!=\"9\" and int(s[s.index(\".\")+1])<5:\r\n\tprint(int(s[:s.index(\".\")]))\r\nelse:\r\n\tprint(\"GOTO Vasilisa.\")", "i,f=input().split('.')\r\nif int(i[-1])!=9:\r\n if int(f[0])>=5:\r\n print(int(i)+1)\r\n else:\r\n print(i)\r\nelse:\r\n print('GOTO Vasilisa.')\r\n\r\n", "n=input()\r\nl=n.split(\".\")\r\nif l[0][-1]==\"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelif int(l[1])<int(\"5\"+(len(l[1])-1)*\"0\"):\r\n print(l[0])\r\nelif int(l[1])>=int(\"5\"+(len(l[1])-1)*\"0\"):\r\n print(int(l[0])+1)\r\n", "number = input().split('.')\nif int(number[1][0]) >= 5 and int(number[0][-1]) < 9:\n print(int(number[0]) + 1)\nelif int(number[1][0]) < 5 and int(number[0][-1]) < 9:\n print(int(number[0]))\nelse:\n print('GOTO Vasilisa.')", "x = input()\r\ni = x.index(\".\")\r\nif(x[i-1]=='9'):\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if int(x[i+1])>=5:\r\n print(int(x[:i])+1)\r\n else:\r\n print(int(x[:i]))", "num = input().split('.')\r\n\r\nif num[0][-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if int(num[1][0]) >= 5:\r\n print(int(num[0]) + 1)\r\n else:\r\n print(int(num[0]))\r\n", "_input = input()\ninteira, fracionaria = _input.split(\".\")\n\nif(inteira.endswith(\"9\")):\n print(\"GOTO Vasilisa.\")\nelse:\n if( not (fracionaria.startswith(\"5\") | fracionaria.startswith(\"6\") | fracionaria.startswith(\"7\") | fracionaria.startswith(\"8\") | fracionaria.startswith(\"9\"))):\n print(inteira)\n else:\n print(int(inteira)+1)\n\t\t\t \t \t\t \t \t\t\t\t\t \t \t", "n = input()\nfor i in range(len(n)):\n if n[i] == '.':\n point = i\n break\nstr = ''\nif n[point - 1] == '9':\n print('GOTO Vasilisa.')\nelse:\n for i in range(point):\n str += n[i]\n if n[point + 1] < '5':\n print(str)\n else:\n print(int(str) + 1)\n \t\t\t \t\t\t \t\t\t\t \t \t\t \t\t\t \t\t", "# A. Help Far Away Kingdom\r\n\r\nint_part, frac_part = input().split('.')\r\n\r\nif int_part.endswith('9'):\r\n print(\"GOTO Vasilisa.\")\r\n\r\nelse:\r\n first = int(frac_part[0])\r\n if first < 5:\r\n print(int_part)\r\n else:\r\n print(int_part[:-1], end=\"\")\r\n print(int(int_part[-1]) + 1)\r\n", "i, j=map(str,input().split(\".\"))\r\nprint([\"GOTO Vasilisa.\", int(i)+(j[0]>'4')][i[-1]<'9'])\n# Sun Jan 09 2022 08:29:38 GMT+0000 (Coordinated Universal Time)\n", "# #include <algorithm>\r\n# #include <iostream>\r\n# #include <iomanip>\r\n# #include <vector>\r\n# #include <cmath>\r\n# #include <deque>\r\n# #include <queue>\r\n# #include <map>\r\n# #include <set>\r\n# #define FOR(v, a, b, k) for(int v = a; v < b; v += k)\r\n# #define RFOR(v, a, b, k) for(int v = a; b <= v; v -= k)\r\n# using namespace std;\r\n# typedef long long int lli;\r\n# const lli MOD = 1E9 + 7;\r\n# const int MAXN = 1 * 1E5;\r\n# short bar[8] = {-1, 0, 1, 0, -1, 1, 1, -1};\r\n# short kol[8] = {0, 1, 0, -1, 1, 1, -1, -1};\r\n\r\n# int sum_dig(int x);\r\n# bool valid(int x, int y);\r\n# struct Point {\r\n# int x, y;\r\n# };\r\n\r\n# int n, m, k, cnt[2];\r\n# string s;\r\n\r\n# inline void prepare(){\r\n# return;\r\n# }\r\n\r\n# inline void solve(){\r\n# cin >> s;\r\n# for(const char& c : s){\r\n# n |= 'a' <= c && c <= 'z';\r\n# m |= 'A' <= c && c <= 'Z';\r\n# k |= '0' <= c && c <= '9';\r\n# }\r\n# cout << (s.length() > 4 && n && m && k ? \"Correct\" : \"Too weak\") << '\\n';\r\n# }\r\n\r\n# int main(){\r\n# ios_base::sync_with_stdio(0);\r\n# cin.tie(0);\r\n# cout.tie(0);\r\n# prepare();\r\n \r\n# int tc = 1;\r\n# //cin >> tc;\r\n# while(tc--){\r\n# solve();\r\n# }\r\n# }\r\n\r\n# int sum_dig(int x){\r\n# return x ? x % 10 + sum_dig(x/10) : 0;\r\n# }\r\n\r\n# bool valid(int x, int y){\r\n# return (0 <= x && x < n) && (0 <= y && y < m);\r\n# }\r\ni, f = input().split('.')\r\nif i[-1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if f[0] < '5':\r\n print(int(i))\r\n else:\r\n print(int(i) + 1)", "a,b=input().split('.')\r\nif a[-1]=='9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n print(int(a)+(b[0]>'4'))", "n = str(input())\r\nx = n.find('.')\r\nif n[x-1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n y = n[x+1]\r\n if int(y)>=5:\r\n print(int(n[:x])+1)\r\n else:\r\n print(n[:x])", "n, f = input().split(\".\")\r\nif n[-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n n = int(n)\r\n print(n if int(f[0]) < 5 else n+1)", "# LUOGU_RID: 104834186\na, b = map(str, input().split('.'))\r\nif a[-1] < '9':\r\n print(int(a) + (b[0] > '4'))\r\nelse:\r\n print('GOTO Vasilisa.')\r\n", "s=input()\nfor i in range(1,len(s)):\n if s[i]==\".\":\n inti=s[i-1]\n deci=s[i+1]\n if s[i-1]==\"9\":\n print(\"GOTO Vasilisa.\")\n elif s[i-1]<\"9\" and s[i+1]<\"5\":\n print(s[:i])\n elif s[i-1]<=\"9\" and s[i+1]>=\"5\":\n r=(s[:i-1])\n n=int(s[i-1])+1\n r+=str(n)\n print(r)\n", "a = input()\r\nif int(a[a.index(\".\")-1]) == 9:\r\n print(\"GOTO Vasilisa.\")\r\nelif int(a[a.index(\".\")+1]) < 5:\r\n print(int(a[:a.index(\".\")]))\r\nelse:\r\n print(int(a[:a.index(\".\")])+1)\r\n", "line = input()\r\ndot = line.find(\".\")\r\nif line[dot - 1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if line[dot + 1] >= \"5\":\r\n print(line[:dot - 1], chr(ord(line[dot - 1]) + 1), sep=\"\")\r\n else:\r\n print(line[:dot])\r\n", "n_int, n_dec = input().split('.')\r\nn_int = int(n_int)\r\nprint(\"GOTO Vasilisa.\" if n_int % 10 == 9 else (n_int if int(n_dec[0]) < 5 else n_int + 1))\r\n", "n = input().split(\".\")\n\nif n[0][-1] != '9' and int(n[1][0]) < 5:\n print(n[0])\nelif n[0][-1] != '9' and int(n[1][0]) >= 5:\n print(int(n[0]) + 1)\nelse :\n print(\"GOTO Vasilisa.\")\n\t \t\t \t\t\t\t\t \t\t \t\t \t\t \t", "number=input()\r\nparse=str.rsplit(number,'.')\r\nif parse[0][len(parse[0])-1]=='9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if int(parse[1][0])<5:\r\n print(parse[0])\r\n else:\r\n print(int(parse[0])+1)", "def help_far_away_kingdom(num:int):\r\n integer, decimal = num.split(\".\")\r\n integer = int(integer)\r\n if integer % 10 == 9 :\r\n return \"GOTO Vasilisa.\"\r\n\r\n if int(decimal[0] ) < 5 :\r\n return integer \r\n \r\n return integer + 1 \r\n\r\nif __name__ == \"__main__\":\r\n # n = int(input())\r\n \r\n # for _ in range(n):\r\n num = input()\r\n print(help_far_away_kingdom(num))", "s1 = input()\r\nm = s1.find('.')\r\nm2 = int(s1[:m])\r\nm3 = int(s1[m+1:m+2])\r\n\r\nif s1[m-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if m3 >= 5:\r\n m2 += 1\r\n print(m2)\r\n else:\r\n print(m2)", "import math\r\ns=input()\r\nd=s.index(\".\")\r\nif s[d-1]==\"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if s[d+1]>=\"5\":\r\n print(int(s[:d])+1)\r\n else:\r\n print(int(s[:d]))\r\n \r\n", "# LUOGU_RID: 100545756\nn=input()\nk=0\nfor i in n:\n if i=='.':\n break\n k+=1\n#print(k)\nif n[k-1]=='9':\n print('GOTO Vasilisa.')\nelse:\n if int(n[k+1])>=5:\n print(n[0:k-1],end='')\n print(int(n[k-1])+1)\n else:\n print(n[0:k])", "n = input()\r\nl = len(n)\r\nfor i in range(l):\r\n if n[i] == '.':\r\n k = int(n[i-1])\r\n s = int(n[i+1])\r\n j = i\r\n break\r\nif k == 9:\r\n print('GOTO Vasilisa.')\r\nelse:\r\n if s >= 5:\r\n print(n[:j-1]+str(int(n[j-1])+1))\r\n else:\r\n print(n[:j])\r\n\r\n\r\n", "l=input()\r\n\r\nl=l.split('.')\r\n\r\ns=list(l[0])\r\n\r\np=list(l[1])\r\n\r\ni=int(p[0])\r\n\r\nif s[len(s)-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\n\r\nelif s[len(s)-1]!='9' and i<5:\r\n s=\"\".join(s)\r\n print(s)\r\nelse:\r\n s=\"\".join(s)\r\n s=str(int(s)+1)\r\n print(s)", "n = input().split('.')\r\nif int(n[0]) % 10 == 9 :\r\n\tprint(\"GOTO Vasilisa.\")\r\nelse:\r\n\tif int(n[1][0]) >= 5:\r\n\t\tprint(int(n[0]) + 1)\r\n\telse:\r\n\t\tprint(int(n[0]))", "import math\r\nn = input()\r\ndot = n.index(\".\")\r\nnew = n[:dot]\r\nafter = n[dot+1]\r\nlast = new[-1]\r\nout = \"\"\r\ndef myround(x) :\r\n dot = x.index(\".\")\r\n new = x[:dot]\r\n after = n[dot+1]\r\n if last == \"9\" : out = \"GOTO Vasilisa.\"\r\n elif int(after) < 5 : out = new\r\n else : out = str(int(new) + 1)\r\n return out\r\n\r\nprint(myround(n))\r\n \r\n", "ns = input()\r\nif '.' in ns:\r\n ns = ns.split('.')\r\n n = int(ns[1][0])\r\n if ns[0][-1] == '9':\r\n print('GOTO Vasilisa.')\r\n elif n < 5:\r\n print(ns[0])\r\n else:\r\n ch = chr(ord(ns[0][-1] )+1)\r\n n = ns[0][:-1]+ch\r\n print(n)\r\n\r\nelse:\r\n print(ns)", "s = input ().split('.')\r\nif s[0][-1] == '9' :\r\n print ('GOTO Vasilisa.')\r\nelse :\r\n if s[1][0] >= '5' :\r\n print (int(s[0]) + 1)\r\n else :\r\n print (s[0])\r\n", "a = str(input()).split('.')\r\nif int(a[1][0]) >= 5 and a[0][len(a[0])-1] != \"9\":\r\n print(int(a[0]) + 1)\r\nelif int(a[1][0]) < 5 and a[0][len(a[0])-1] != \"9\":\r\n print(a[0])\r\nelif a[0][len(a[0])-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")", "s = str(input())\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] == '.':\r\n break \r\n i += 1\r\nif s[i - 1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\nelif int(s[i + 1]) >= 5:\r\n print(int(s[: i]) + 1)\r\nelse:\r\n print(int(s[: i]))", "s = str(input())\r\nx = int(s[:s.index('.')])\r\ny = s[s.index('.') + 1:]\r\nk = '5' + '0' * (len(y) - 1)\r\ny = int(y)\r\nk = int(k)\r\nif(x % 10 < 9 and k > y):\r\n print(x)\r\nelif(x % 10 < 9 and k <= y):\r\n print(x + 1)\r\nelse:\r\n print(\"GOTO Vasilisa.\")\r\n\r\n#print(k)\r\n#print(x)\r\n#print(y)\r\n\r\n# Qalay ))", "x = input().split(\".\")\r\nif x[0][-1] == \"9\":\r\n print(\"GOTO Vasilisa.\")\r\nelif int(x[1][0]) >= 5:\r\n print(int(x[0]) + 1)\r\nelse:\r\n print(x[0])\r\n \r\n ", "import math\r\n\r\ns = input()\r\n\r\nd = s.index(\".\")\r\n#print(s[:d])\r\nif s[d-1]=='9':\r\n print(\"GOTO Vasilisa.\")\r\nelse:\r\n if s[d+1]>='5':\r\n print(int(s[:d])+1)\r\n else:\r\n print(int(s[:d]))\r\n'''\r\n\r\n#print(n[0][-1])\r\nif n[0][-1] == '9':\r\n print(\"GOTO Vasilisa.\")\r\n exit()\r\nif int(n[1][0])<=4:\r\n print(n[0])\r\n exit()\r\nelse:\r\n print(n[0][:-1] + str(int(n[0][-1])+1))\r\n\r\n'''\r\n\r\n\r\n", "\r\ns = input()\r\nl = s.split('.')\r\nif l[0][-1] == '9':\r\n print('GOTO Vasilisa.')\r\nelse:\r\n a = int(l[0])\r\n b = int(l[-1][0])\r\n if b >= 5:\r\n a += 1\r\n print(a)", "a,b=input().split('.')\r\nif a[-1]=='9': print(\"GOTO Vasilisa.\")\r\nelif int(b[0])>=5: print(int(a)+1)\r\nelse: print(a)\r\n", "number = input().split('.')\n\nif(number[0][len(number[0])-1]) == '9':\n print(\"GOTO Vasilisa.\")\n\nelif int(number[1][0]) >= 5:\n print(int(number[0])+1)\nelse:\n print(int(number[0]))\n\t \t\t \t \t\t\t \t\t\t \t\t \t" ]

{"inputs": ["0.0", "1.49", "1.50", "2.71828182845904523536", "3.14159265358979323846", "12345678901234567890.1", "123456789123456789.999", "12345678901234567890.9", "123456789123456788.999", "9.000", "0.1", "0.2", "0.3", "0.4", "0.5", "0.6", "0.7", "0.8", "0.9", "1.0", "1.1", "1.2", "1.3", "1.4", "1.5", "1.6", "1.7", "1.8", "1.9", "2.0", "2.1", "2.2", "2.3", "2.4", "2.5", "2.6", "2.7", "2.8", "2.9", "3.0", "3.1", "3.2", "3.3", "3.4", "3.5", "3.6", "3.7", "3.8", "3.9", "4.0", "4.1", "4.2", "4.3", "4.4", "4.5", "4.6", "4.7", "4.8", "4.9", "5.0", "5.1", "5.2", "5.3", "5.4", "5.5", "5.6", "5.7", "5.8", "5.9", "6.0", "6.1", "6.2", "6.3", "6.4", "6.5", "6.6", "6.7", "6.8", "6.9", "7.0", "7.1", "7.2", "7.3", "7.4", "7.5", "7.6", "7.7", "7.8", "7.9", "8.0", "8.1", "8.2", "8.3", "8.4", "8.5", "8.6", "8.7", "8.8", "8.9", "9.0", "9.1", "9.2", "9.3", "9.4", "9.5", "9.6", "9.7", "9.8", "9.9", "609942239104813108618306232517836377583566292129955473517174437591594761209877970062547641606473593416245554763832875919009472288995880898848455284062760160557686724163817329189799336769669146848904803188614226720978399787805489531837751080926098.1664915772983166314490532653577560222779830866949001942720729759794777105570672781798092416748052690224813237139640723361527601154465287615917169132637313918577673651098507390501962", "7002108534951820589946967018226114921984364117669853212254634761258884835434844673935047882480101006606512119541798298905598015607366335061012709906661245805358900665571472645463994925687210711492820804158354236327017974683658305043146543214454877759341394.20211856263503281388748282682120712214711232598021393495443628276945042110862480888110959179019986486690931930108026302665438087068150666835901617457150158918705186964935221768346957536540345814875615118637945520917367155931078965", "1950583094879039694852660558765931995628486712128191844305265555887022812284005463780616067.5000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "718130341896330596635811874410345440628950330.500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "927925904158088313481229162503626281882161630091489367140850985555900173018122871746924067186432044676083646964286435457446768031295712712803570690846298544912543439221596866052681116386179629036945370280722.500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "68289614863244584294178637364598054554769889.500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "7536521504744364134984603189602839063535643888645969434165019366202558753840519.4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999", "646188694587964249318078225173.5000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "7017472758334494297677068672222822550374695787171163207025095950296957261530.50", "259085737066615534998640212505663524594409165063310128108448186246980628179842202905722595400477937071746695941939306735605849342959111887834258250883469840846714848774368.50000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "682500858233333594535201113441004740771119672961581796618069185960107115823662126812159957094407454522028503739299.5000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "41203422675619090661099806687619.49999999999999999999999999999999999999999999999999999999999999999999999999999999999999999"], "outputs": ["0", "1", "2", "3", "3", "12345678901234567890", "GOTO Vasilisa.", "12345678901234567891", "123456789123456789", "GOTO Vasilisa.", "0", "0", "0", "0", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "2", "2", "2", "2", "2", "2", "2", "2", "2", "2", "3", "3", "3", "3", "3", "3", "3", "3", "3", "3", "4", "4", "4", "4", "4", "4", "4", "4", "4", "4", "5", "5", "5", "5", "5", "5", "5", "5", "5", "5", "6", "6", "6", "6", "6", "6", "6", "6", "6", "6", "7", "7", "7", "7", "7", "7", "7", "7", "7", "7", "8", "8", "8", "8", "8", "8", "8", "8", "8", "8", "9", "9", "9", "9", "9", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "GOTO Vasilisa.", "609942239104813108618306232517836377583566292129955473517174437591594761209877970062547641606473593416245554763832875919009472288995880898848455284062760160557686724163817329189799336769669146848904803188614226720978399787805489531837751080926098", "7002108534951820589946967018226114921984364117669853212254634761258884835434844673935047882480101006606512119541798298905598015607366335061012709906661245805358900665571472645463994925687210711492820804158354236327017974683658305043146543214454877759341394", "1950583094879039694852660558765931995628486712128191844305265555887022812284005463780616068", "718130341896330596635811874410345440628950331", "927925904158088313481229162503626281882161630091489367140850985555900173018122871746924067186432044676083646964286435457446768031295712712803570690846298544912543439221596866052681116386179629036945370280723", "GOTO Vasilisa.", "GOTO Vasilisa.", "646188694587964249318078225174", "7017472758334494297677068672222822550374695787171163207025095950296957261531", "259085737066615534998640212505663524594409165063310128108448186246980628179842202905722595400477937071746695941939306735605849342959111887834258250883469840846714848774369", "GOTO Vasilisa.", "GOTO Vasilisa."]}

UNKNOWN

PYTHON3

CODEFORCES

202

8daea05e984def6f793db9d374212130

Segments

You are given an integer *N*. Consider all possible segments on the coordinate axis with endpoints at integer points with coordinates between 0 and *N*, inclusive; there will be of them. You want to draw these segments in several layers so that in each layer the segments don't overlap (they might touch at the endpoints though). You can not move the segments to a different location on the coordinate axis. Find the minimal number of layers you have to use for the given *N*. The only input line contains a single integer *N* (1<=≤<=*N*<=≤<=100). Output a single integer - the minimal number of layers required to draw the segments for the given *N*. Sample Input 2 3 4 Sample Output 2 4 6

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nx = [0] * (n + 1)\r\nfor l in range(n):\r\n for r in range(l + 1, n + 1):\r\n x[l] += 1\r\n x[r] -= 1\r\nfor i in range(1, n + 1):\r\n x[i] += x[i - 1]\r\nans = max(x)\r\nprint(ans)", "def process(n):\r\n if n % 2==1:\r\n return ((n+1)//2)**2\r\n return (n//2)*(n//2+1)\r\n\r\nn = int(input())\r\nprint(process(n))\r\n ", "n=int(input())\r\nx=(n*(n+1))//2+(n+1)//2\r\nprint(x//2)", "n=int(input())\r\nprint((n+n%2)*((n+2)//2)//2)", "a=int(input())\r\nprint((a//2+1)*((a+1)//2))", "n = int(input())\r\nn += 1\r\nn = n*n\r\nn = n//4\r\nprint(n)", "def foobar(n):\r\n list = [0]*n\r\n for i in range(n+1):\r\n l = n - i + 1\r\n for j in range(n-l+1):\r\n for k in range(j, j+l):\r\n list[k] += 1\r\n \r\n max = 0\r\n for i in list:\r\n max = max if max > i else i\r\n print(max)\r\n\r\nn = input()\r\nfoobar(int(n))\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append((i+1)*(n-i))\r\nprint(max(a))", "import sys\r\n\r\nn = int(sys.stdin.readline().rstrip(\"\\n\"))\r\n\r\nif n % 2 == 0:\r\n res = n // 2 * (n // 2 + 1)\r\n print(res)\r\n\r\nelse:\r\n res = (n // 2 + 1) * (n // 2 + 1)\r\n print(res)", "n = int(input())\r\nans = n\r\nwhile True:\r\n n -= 2\r\n if n < 0:\r\n break\r\n ans += n\r\nprint(ans)", "n = int(input())\nsumm = 0\nwhile n >= 0:\n\tsumm += n\n\tn -= 2\nprint(summ)\t", "n = int(input())\n\ncnt = 0\nwhile n > 0:\n cnt += n\n n -= 2\n\nprint(cnt)\n", "n = int(input())\r\na = [int(i) for i in range(1, n + 1)]\r\np = []\r\nfor i in range(n):\r\n for j in range(i, n):\r\n p.append([i + 1, j + 1])\r\narr = [0] * n\r\nfor i in p:\r\n for j in range(i[0] - 1, i[1]):\r\n arr[j] += 1\r\nprint(max(arr))", "n = int(input()) + 1\nans = 0\nfor i in list(range(2,n))[::-1]:\n\tif n >= i * 2: ans += i\n\telse:\n\t\tans += n - i\nprint(ans + 1)\n", "import sys\r\nn = int(input().strip())\r\nif n%2==1:\r\n print(((n//2)+1)**2)\r\nelse:\r\n print(n*(n+2)//4)\r\n", "n=int(input())\r\nprint(((n//2)+1)*(n-(n//2)))", "n = int(input())\r\n\r\nslices = []\r\nfor ln in range(1, n + 1):\r\n for i in range(0, n - ln + 1):\r\n slices.append([i, i + ln])\r\n\r\nslices.sort()\r\n# print(slices)\r\ncur = slices.pop(0)\r\nc = 0\r\nwhile slices:\r\n flag = False\r\n for sl in slices.copy():\r\n if sl[0] == cur[1]:\r\n cur[1] = sl[1]\r\n slices.remove(sl)\r\n flag = True\r\n elif sl[1] == cur[0]:\r\n cur[0] = sl[0]\r\n slices.remove(sl)\r\n flag = True\r\n\r\n if not flag:\r\n c += 1\r\n if slices:\r\n cur = slices.pop(0)\r\n else:\r\n cur = 0\r\n\r\nif cur:\r\n c += 1\r\nprint(c)", "import math\nn = int(input())\nprint((n // 2 + 1) * math.ceil(n / 2))\n", "from math import *\r\na = int(input())\r\na += 1\r\nprint(floor(a*a/4))", "from collections import Counter, deque\ndef lInt(d = None): return map(int, input().split(d))\n\nn, *_ = lInt()\nans = 0\n\nfor l in range(1, n+1):\n for j in range(0, l):\n if j+l <= n:\n ans += 1\nprint(ans)\n", "n=int(input())\r\nr=0\r\nfor i in range(1,n+1):\r\n start=i\r\n say=n-i+1\r\n if say >=i:\r\n say=i\r\n r+=say\r\nprint(r)\r\n", "n = int(input())\r\nif n % 2 == 0:\r\n b = 2\r\nelse:\r\n b = 1\r\ns = 0\r\nfor i in range(b, n + 1, 2):\r\n s += i\r\nprint(s)", "n = int(input())\r\ncnt = 0\r\ncur_cnt = 1\r\nfor i in range(n, 0, -1):\r\n cnt += min(cur_cnt, i)\r\n cur_cnt += 1\r\nprint(cnt)\r\n", "#!/usr/bin/env python3\r\n#! -*- coding: utf-8 -*-\r\n\r\n\r\ndef main():\r\n\tn = int(input())\r\n\tprint((n // 2 + 1) * ((n + 1) // 2))\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n = int(input())\r\ndef count(n):\r\n\tif n==0: return 0\r\n\tif n==1: return 1\r\n\telif n<1: return 0\r\n\treturn n+count(n-2)\r\nprint(count(n))", "import math\r\na=int(input())\r\nif(a==1):\r\n\tprint(1)\r\nelif(a==2):\r\n\tprint(2)\t\r\nelif(a==3):\r\n\tprint(4)\r\nelif(a==4):\r\n\tprint(6)\r\nelse:\r\n\tb=a\t\t\t\r\n\td=a-2\r\n\te=1\r\n\twhile(d>0):\r\n\t\tif(d>=e):\r\n\t\t\tb+=e\r\n\t\telse:\r\n\t\t\tb+=d\r\n\t\td-=1\r\n\t\te+=1\t\r\n\tprint(b)", "a = int(input())\r\nprint(sum([a-i for i in range(a)][::2]))", "n = int(input())\r\nans = 0\r\nfor i in range(1, n + 1):\r\n\tif n >= 2 * i:\r\n\t\tans += i\r\n\telse:\r\n\t\tans += n - i + 1\r\nprint(ans)\r\n", "n = list(map(int,input().split()))[0]\r\nx=0\r\nif n%2==0:\r\n\tx=(n//2) * (n//2+1)\r\nelse:\r\n\tx= (n//2 +1)**2\r\nprint(x)\r\n", "# @Date: 27-Dec-2017\n# @Last modified time: 27-Dec-2017\nn=int(input())\nprint(((n+1)**2)//4)\n", "n = int(input()) + 1\r\nprint((n*n)//4)\r\n", "n=int(input())\nif n%2==1:\n k=(n+1)/2\n print(int(k**2))\nelse:\n k=n/2\n print(int(k*(k+1)))\n\t \t\t \t \t\t \t\t\t \t\t \t\t\t\t \t\t\t", "n = int(input())\n\nans = 0\n\nfor i in range(n, 0, -2):\n\tans += i\n\nprint(ans)", "# cook your dish here\r\nimport math\r\nn=int(input())\r\nif(n%2==0):\r\n x=math.floor(n/2+1)*(math.floor(n/2))\r\nif(n%2!=0):\r\n x=(math.ceil(n/2)*(math.ceil(n/2)))\r\nprint(x)", "n = int(input())\r\nl, r = 0, n\r\nans = 0\r\nwhile l < r:\r\n ans += r - l\r\n l += 1\r\n r -= 1\r\nprint(ans)\r\n", "n = int(input())\r\nprint (sum(range(n, 0 , -2)))\r\n", "# input\r\nN = int(input())\r\n\r\ndef solve():\r\n if N%2 == 0:\r\n a = N//2\r\n print(2 * sum(range(1, a+1)))\r\n else:\r\n a = (N-1)//2\r\n print(2 * sum(range(1, a+1)) + (a+1))\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n\r\n", "import sys\n\n#f = open('input', 'r')\nf = sys.stdin\n\nn = int(f.readline())\n\nans = [1, 2, 4, 6, 9, 12, 16, 20, 25, 30, 36, 42, 49, 56, 64, 72, 81, 90, 100, 110, 121, 132, 144, 156, 169, 182, 196, 210, 225, 240, 256, 272, 289, 306, 324, 342, 361, 380, 400, 420, 441, 462, 484, 506, 529, 552, 576, 600, 625, 650, 676, 702, 729, 756, 784, 812, 841, 870, 900, 930, 961, 992, 1024, 1056, 1089, 1122, 1156, 1190, 1225, 1260, 1296, 1332, 1369, 1406, 1444, 1482, 1521, 1560, 1600, 1640, 1681, 1722, 1764, 1806, 1849, 1892, 1936, 1980, 2025, 2070, 2116, 2162, 2209, 2256, 2304, 2352, 2401, 2450, 2500, 2550]\n\nprint(ans[n-1])\n", "def f(n):\r\n if(n==0):\r\n return(0)\r\n elif(n==1):\r\n return(1)\r\n else:\r\n return(f(n-2)+n)\r\n\r\nprint(f(int(input())))", "n=int(input())\r\nprint(((n+2)//2)*((n+1)//2))", "print(int(((int(input())+1)/2)**2))", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n s+= (n-i)//2 + (n-i)%2\r\nprint(s)\r\n", "n = int(input())\r\nif n%2==0:\r\n result = n * ((n//2)+1)//2\r\nelse:\r\n result = (n//2)*(n//2+1)//2 + (n+1)//2*((n+1)//2 +1)//2\r\nprint(result) ", "from math import floor,ceil\r\n\r\nif __name__ == \"__main__\":\r\n num = int(input().strip())\r\n if num == 1:\r\n print(1)\r\n else:\r\n print((floor(num/2)+1)*ceil(num/2))\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n+1):\r\n a.append(((n+1)-i)*i)\r\nprint(max(a))", "n = int(input())\nn += 1\nprint(n * n // 4)\n", "# B.py\r\n\r\nn = int(input())\r\ni = (n + 1) // 2\r\nprint(i * (n + 1 - i))", "n = int(input())\r\ns = 0\r\nfor i in range(1,n+1):\r\n if i <= n//2:\r\n s += i\r\n else:\r\n s += n - i + 1\r\n\r\n\r\nprint(s)", "import math\r\n# cook your dish here\r\ns = int(input())\r\nprint(math.ceil((s/2+1)*(s/2)))", "n = int(input())\r\nk = n + 1\r\nprint((k*k)//4)", "import sys\r\ndef f(x):\r\n if x != 2 and x != 1:\r\n return x + f(x - 2)\r\n else: return x\r\n\r\n\r\nn = int(input())\r\nprint(f(n))\r\n\r\n\r\n", "import math\nn = int(input())\nans = 0\nfor i in range(1, int(math.ceil(n / 2)) + 1):\n ans += i\nfor j in range(n // 2, 0, -1):\n ans += j\nprint(ans)\n", "# Сложность по времени O(n)\r\n# Сложность по памяти O(1)\r\n\r\nn = int(input())\r\ns = [1, 2, 4, 6]\r\nif n < 5:\r\n print(s[n - 1])\r\nelse:\r\n a, b = 4, 6\r\n i = 5\r\n while i < n:\r\n a, b = b, a + i\r\n i += 1\r\n print(a + i)", "#!/usr/bin/env python3\r\n\r\ndef main():\r\n n = int(input())\r\n print((((n - 1) >> 1) + 1) * (n - ((n + 1) >> 1) + 1))\r\n\r\ntry:\r\n while True:\r\n main()\r\nexcept EOFError:\r\n pass\r\n", "n = int(input())\r\n\r\na = (n + 1) // 2\r\nb = (n + 2) // 2\r\n\r\nprint(a * b)", "n = int(input())\r\n\r\nans = 0\r\n\r\nfor i in range(n // 2 + (0 if n % 2 == 0 else 1)):\r\n l = n - 2 * i\r\n if l <= 0:\r\n break\r\n ans += l\r\n\r\nprint(ans)\r\n \r\n", "n = int(input())\r\nan = 0\r\na = [0] * (n + 1)\r\nfor i in range(n):\r\n for s in range(1, n - i + 1):\r\n a[i] += 1\r\n a[i + s] -= 1\r\nfor i in range(len(a)):\r\n if a[i] > 0:\r\n an += a[i]\r\nprint(an)\r\n", "from sys import stdin, stdout\r\nfrom gc import disable\r\ndisable()\r\n\r\ndef f(n:int) -> int:\r\n if (n <= 1):\r\n return n\r\n else:\r\n return f(n-2) + n\r\n\r\nn = int(stdin.readline())\r\nstdout.write(\"%i\"%(f(n)))", "n=int(input())\r\nn=n+1\r\nn=n*n\r\nn=n//4\r\nprint(n)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\nN = int(input())\r\na = 111 * [1]\r\na[0] = 0\r\na[1] = 1\r\na[2] = 2\r\nfor i in range(3, N + 1):\r\n a[i] = a[i - 2] + i\r\nprint(a[N])", "n= int(input())\r\nimport math\r\nprint((math.floor(n/2)+1)*(math.ceil(n/2)))", "n = int(input())\r\nresult = 0\r\nmid = n // 2 + 1\r\n\r\nfor i in range(mid):\r\n result += i\r\nfor i in range(mid, n+1):\r\n result += n - i + 1\r\nprint(result)", "'''\r\nINPUT SHORTCUTS\r\nN, K = map(int,input().split())\r\nN ,A,B = map(int,input().split())\r\nstring = str(input())\r\narr = list(map(int,input().split()))\r\nN = int(input())\r\n'''\r\n\r\n\r\n\r\ndef main():\r\n\tN = int(input())\r\n\tadd = 0\r\n\twhile N>0:\r\n\t\t# print(N)\r\n\t\tadd+=(N)\r\n\t\tN-=2\r\n\tprint(add)\r\n\r\nmain()", "# Problem: Segment\r\n\r\nif __name__ == \"__main__\":\r\n num = int(input().strip())\r\n segment = []\r\n for i in range(1,num+1):\r\n j = 0\r\n for j in range(num):\r\n if j + i <= num:\r\n segment.append((j,j+i))\r\n segment.sort(key = lambda x: (x[0],[1]))\r\n #print(segment)\r\n layer_count = 0\r\n \r\n while segment != []:\r\n rightend = segment[0][1]\r\n segment.remove(segment[0])\r\n j = 0\r\n while j < len(segment):\r\n if rightend == segment[j][0]:\r\n rightend = segment[j][1]\r\n segment.remove(segment[j])\r\n else:\r\n j += 1\r\n layer_count +=1\r\n print(layer_count)\r\n", "ka=int(input())\r\nprint((ka//2+1)*((ka-1)//2+1))", "n = int(input())\r\ncount = n * (n + 1) // 2\r\nSections = []\r\nlength = n\r\nwhile length > 0:\r\n i = 0\r\n while i + length <= n:\r\n Sections.append((i, i + length))\r\n i += 1\r\n length -= 1\r\n\r\n\r\ndef create(A):\r\n length = len(A)\r\n A.sort(key=lambda x: x[1] - x[0])\r\n for i in range(length - 1, -1, -1):\r\n a1, b1 = A[i]\r\n idx1 = -1\r\n idx2 = -1\r\n best_then = -1, -1\r\n best_pref = -1, -1\r\n diff_then = n\r\n diff_pref = n\r\n for j in range(i - 1, -1, -1):\r\n a2, b2 = A[j]\r\n if a2 >= b1:\r\n d = n - b2\r\n if d < diff_then:\r\n diff_then = d\r\n best_then = b2\r\n idx1 = j\r\n elif b2 <= a1:\r\n d = a2\r\n if d < diff_pref:\r\n diff_pref = d\r\n best_pref = a2\r\n idx2 = j\r\n if diff_pref != n:\r\n A[i] = (best_pref, A[i][1])\r\n A.pop(idx2)\r\n\r\n if diff_then != n:\r\n A[i] = (A[i][0], best_then)\r\n A.pop(idx1)\r\n\r\n if len(A) == length:\r\n return A\r\n else:\r\n return create(A)\r\n\r\n\r\nprint(len(create(Sections)))\r\n\r\n", "# LUOGU_RID: 101737981\nn = int(input())\r\nprint((n + 1) // 2 * (n // 2 + 1))", "def solve(n):\r\n if n <= 1:\r\n return n\r\n else:\r\n return n + solve(n - 2)\r\na = int(input())\r\nprint(solve(a))\r\n", "n = int(input())\nresult = 0\nfor i in range(n):\n result = max(result, (i + 1)*(n - i))\nprint(result)\n", "n=int(input())\r\nt=n//2\r\nif n%2==0:\r\n print(t*(t+1))\r\nelse:\r\n print(t*(t+1)+t+1)", "n=int(input())\r\nn+=1\r\nprint((n+1)//2*(n//2))", "n = int(input())\r\nprev = 1\r\nif n == 1:\r\n print(1)\r\n exit()\r\ncur = 2\r\nfor i in range(3, n + 1):\r\n now = (i * (i + 1) // 2 - (i - 1) * (i - 2) // 2 + 1) // 2 + prev\r\n prev, cur = cur, now\r\nprint(cur)\r\n", "n = int(input())\ndp = [0]*101\ndp[1] = 1\ndp[2] = 2\nfor i in range(3, 101):\n dp[i] = dp[i-2]+i\nprint(dp[n])\n", "n = int(input())\r\nprint((n + 1) ** 2 // 4 if n % 2 else n * (n + 2) // 4)", "from math import ceil\r\nN = int(input())\r\nS = (N * (N + 1)) / 2\r\nF = int(ceil(N /2.0))\r\nans = int((S + F) / 2)\r\nprint(ans)", "n = int(input())\r\n\r\nres = 0\r\nfor i in range(1, n+1):\r\n\tstart = 0\r\n\tlayer = 0\r\n\tlayers = 1\r\n\tfor j in range(0,(n-i)+1):\r\n\t\tif (start + i) > n:\r\n\t\t\tlayers += 1\r\n\t\t\tlayer += 1\r\n\t\t\tstart = layer + i\r\n\t\telif (start + i) == n:\r\n\t\t\tlayer += 1\r\n\t\t\tstart = layer\r\n\t\t\tif j != (n-i):\r\n\t\t\t\tlayers += 1\r\n\t\telse:\r\n\t\t\tstart += i\r\n\t\t#print(i, start, layers)\r\n\tres += layers\r\nprint(res)", "n = int(input())+1\nprint((n*n)//4)", "n = int(input())\r\nsm = 0\r\nfor i in range(n, -1, -2):\r\n\tsm+=i\r\n\tif n<=2: break\r\nprint(sm)", "n = int(input())\nans = 0\nif(n % 2 == 0):\n\tans += (n//2) * (n//2+1)\nelse:\n\tans += ((n+1)//2)**2\n\nprint(ans)", "s=int(input())\r\nif s%2==0:\r\n print(s*(s+2)//4)\r\nelse:\r\n print((s+1)**2//4)\r\n", "n = int(input())\r\ne = int(n/2)\r\nif(n%2 == 0):\r\n print(e*(e+1))\r\nelse:\r\n print(e*(e+1) + int((n+1)/2))", "def segments(n):\r\n result = 0\r\n while n > 0:\r\n result += n\r\n n -= 2\r\n return result\r\n\r\n\r\nprint(segments(int(input())))", "a=[1,2]\r\nn=int(input())\r\nfor i in range(n-2):\r\n a.append(a[i]+i+3)\r\nprint(a[n-1])\r\n", "n=int(input())\r\nmaxi=1\r\nfor i in range(n):\r\n maxi=max(maxi,i*(n+1-i))\r\nprint(maxi) ", "n=int(input())\r\nprint( max( (i+1)*(n-i) for i in range(n) ) )\r\n", "n=int(input())\r\nk=0\r\nfor i in range(1,n+1) :\r\n k+=min(i,n-i+1)\r\nprint(k)\r\n \r\n \r\n", "n = int(input())\r\nf = [0] * (n + 1)\r\nf[1] = 1\r\nfor i in range(2, n + 1):\r\n f[i] = i + f[i - 2]\r\nprint(f[n])\r\n \r\n", "x=int(input())\r\nsum=0\r\nif(x%2==1):\r\n\tn=x-1\r\n\twhile(n>0):\r\n\t\tsum+=(n+1)\r\n\t\tn-=2\r\n\tsum+=1\r\nelse:\r\n\tn=int((x*2)/2)\r\n\twhile(n>0):\r\n\t\tsum+=n\r\n\t\tn-=2\r\nprint(sum)\r\n", "n = int(input())\r\nn += 1\r\nprint(n * n // 4)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nif n % 2:\r\n x = n//2\r\n print(x*(x+1) + n//2 + 1)\r\nelse:\r\n x = n//2\r\n print(x*(x+1))", "n = int(input())\r\n\r\ns = n*(n+1)//2\r\n\r\ns -= (s- (n+1)//2) // 2\r\n\r\nprint (s)\r\n", "n=int(input())+1\r\nprint((n**2)//4)", "# [https://codeforces.com/blog/entry/56666 <- https://codeforces.com/problemset/problem/909/B <- https://algoprog.ru/material/pc909pB]\r\n\r\nn = int(input())\r\nprint((n // 2 + 1) * ((n + 1) // 2))", "n=int(input())\r\nif n%2==0:\r\n res=2\r\n for i in range(4,n+1,2):\r\n res+=i\r\nelse:\r\n res=1\r\n for i in range(3,n+1,2):\r\n res+=i\r\nprint(res)", "\n# coding: utf-8\n\n# In[5]:\n\nn = int(input())\nc = n\ni = 1\nwhile c <= (n - i + 1) * i:\n c = (n - i + 1) * i\n i += 1\n \nprint(c)\n \n\n\n# In[ ]:\n\n\n\n", "'''input\r\n5\r\n'''\r\nn=int(input())\r\nans=0\r\nwhile n>0:\r\n ans+=n\r\n n-=2\r\nprint(ans)", "num = int(input().strip())\nfactor = 0\nlayers = 0\nfor x in range(num):\n if x % 2 == 0:\n factor += 1\n layers += factor\nprint(layers)", "n = int(input())\r\n\r\nsumma = 0\r\nwhile n>0:\r\n summa+=n\r\n n-=2\r\nprint(summa)\r\n", "n = int(input())\r\n\r\nmemo = dict()\r\n\r\ndef f(n):\r\n if n == 1:\r\n return 1\r\n if n == 2:\r\n return 2\r\n if n in memo:\r\n return memo[n]\r\n memo[n] = n + f(n-2)\r\n return memo[n]\r\n\r\nprint(f(n))\r\n", "a=int(input())\r\nb=a//2\r\nans=b*(b+1)\r\nif a % 2 == 1:\r\n ans+=b+1\r\nprint(ans)", "import math\r\nn = int(input())\r\nprint((n//2+1)*math.ceil(n/2))\r\n", "n=int(input()); ans=0\nfor i in range(1,n+1):\n\tans+=min(i,n-i+1)\nprint(ans)", "import sys\r\nn = int(input())\r\nans = 0\r\nwhile n > 0:\r\n ans += n\r\n n -= 2\r\nprint(ans)\r\n", "N = int(input())\r\nprint(sum(range(N, 0, -2)))\r\n", "import math\nn = int(input()) + 1\nprint((n*n)//4)\n", "a = [-1]*101\na[1] = 1\na[2] = 2\nfor i in range(3,101):\n a[i] = a[i-2] + i\nprint(a[int(input())])\n", "import math\r\nn = int(input())\r\nprint( (math.floor(n/2)+1) * math.ceil(n/2) )", "N = int(input())\nsegments = [[[start,length+start] for start in range(1,N-length)] for length in range(1,N-1)]\ntotal = 0\nwhile N > 0:\n total += N\n N-= 2\nprint(total)", "n=int(input())\r\nif n%2==0:\r\n ans=(n//2)*(n//2+1)\r\nelse:\r\n ans=(n//2+1)*(n//2+1)\r\nprint(ans)", "n=int(input())\nif n%2==0:\n print((n//2)*((n//2) + 1))\nelse:\n n+=1\n print((n//2)*(n//2))\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\nn = int(input())\r\n\r\nS = list()\r\nfor i in range(n+1):\r\n for j in range(i+1, n+1):\r\n S.append([2*i, 2*j])\r\n\r\nres = 0\r\nfor x in range(1, 2*n, 2):\r\n cnt = 0\r\n for s in S:\r\n if s[0] < x and x < s[1]:\r\n cnt += 1\r\n res = max(res, cnt)\r\nprint(res)\r\n\r\n\r\n", "N = int(input())\r\nprint((N//2+1)*((N-1)//2+1))", "n = int(input())\r\ndef f(x):\r\n\tif x == 1:\r\n\t\treturn 1\r\n\tif x % 2:\r\n\t\treturn f(x - 1) + (x + 1) // 2\r\n\treturn f(x - 1) + x // 2\r\nprint(f(n))", "x = int(input()) + 1\r\nprint(x//2 * (x - x//2))", "n = int(input())\r\nif n & 1:\r\n print(n * (n + 1) // 2 - (n - 1) * (n + 1) // 4)\r\nelse:\r\n print(n * n // 2 - (n - 2) * n // 4)", "print(int(((int(input())+1))**2//4))", "n=int(input())\r\n\r\ndef get(n):\r\n\tif n%2==1:\r\n\t\tk = (n+1)//2\r\n\t\treturn k*k\r\n\telse:\r\n\t\tk=n//2\r\n\t\treturn k*(k+1)\r\n\r\nprint(get(n))", "def pedy(n):\r\n if n < 2:\r\n return n\r\n return n + pedy(n - 2)\r\nprint(pedy(int(input())))\r\n", "n = int(input())\r\nl = [0]*n\r\nfor i in range(n):\r\n for j in range(n-i):\r\n for k in range(j,j+i+1):l[k]+=1\r\nprint(max(l))\r\n", "n=int(input())\ns=0\ni=0\nside = int(n/2)\nwhile i<side:\n\ti+=1\n\ts+=2*i\nif n%2==1:\n\ts+=i+1\nprint(s)", "N=int(input())\nans=0\nwhile N>0:\n ans+=N\n N-=2\nprint(ans)\n", "modulo = 1000000007\r\nn = int(input())\r\n\r\nans = 0\r\n\r\nfor k in range(n):\r\n if (k+1) * (n-k) > ans:\r\n ans = (k+1) * (n-k)\r\n\r\nprint(ans)\r\n", "N = int(input().rstrip())\r\n\r\nif N%2==0:\r\n\tsegments=(N/2)*((N/2)+1)\r\nelse:\r\n\tsegments=((N+1)/2)*((N+1)/2)\r\n\r\nprint(int(segments))", "n=int(input())\r\na=n//2\r\nif n%2==0:\r\n print(n*(n+2)//4)\r\nelse:\r\n print(a*(a+1)+(n+1)//2)", "def afd(nn):\r\n if nn < 2:\r\n return nn\r\n return nn + afd(nn - 2)\r\nprint(afd(int(input())))\r\n", "n = int(input())\r\nprint((n//2 + 1)*((n+1)//2))", "n=int(input())\nar=[]\nfor x in range(0,n+1):\n for y in range(x+1,n+1):\n ar.append([x,y])\nans=0\nfor x in ar:\n if x[0] <= (n+1-(n%2))/2 <= x[1]:\n ans+=1\nprint(ans)\n ", "import math\nn = int(input())\nn = math.floor(n / 2 + 1) * math.ceil(n / 2)\nprint(n)\n", "n = int(input())\nans = 0\nfor i in range(1, n+1):\n ans += min(n - i + 1, i)\nprint(ans)\n", "import math\r\ndef o(x):return x*(x+1)/2\r\nn=int(input())\r\nprint(round(2*o(math.floor(n/2))+(math.ceil(n/2)if n%2==1 else 0)))", "def S(x):\r\n\tif x==1:\r\n\t\treturn(1)\r\n\tif x==2:\r\n\t\treturn(2)\r\n\telse:\r\n\t\treturn(x//2+x%2+S(x-1))\r\nprint(S(int(input())))", "a=int(input())\r\nprint((a+1)*(a+1)//4)", "a = int(input())\r\nb = a // 2\r\nb = b*(b+1)\r\nif a % 2 == 1:\r\n\tb += a // 2 + 1\r\nprint(b)", "\r\n\r\nif __name__ == '__main__':\r\n num = int(input().strip())\r\n segments = []\r\n for i in range(1,num + 1):\r\n for j in range(num):\r\n if j + i > num:\r\n break\r\n segments.append((j,j+i))\r\n #print(segments)\r\n segments.sort(key = lambda x: (x[0],x[1]))\r\n count = 0\r\n while segments != []:\r\n right_end = segments[0][1]\r\n j = 0\r\n while j < len(segments):\r\n if segments[j][0] == right_end:\r\n right_end = segments[j][1]\r\n segments.remove(segments[j])\r\n else:\r\n j += 1\r\n count += 1\r\n segments.remove(segments[0])\r\n print(count)\r\n", "print((int(input())+1)**2//4) # https://www.youtube.com/watch?v=T3I-_KzgVzc", "import math\r\nn=int(input())\r\nprint((math.floor(n/2)+1)*math.ceil(n/2))", "n = int(input())\nprint(round((n/2+1)*n/2))\n", "for i in range(1):\r\n n=int(input())\r\n x=n/2\r\n if x>int(x):\r\n s=(n//2+1)*(int(x)+1)\r\n print(s)\r\n else:\r\n s=(n//2+1)*(int(x))\r\n print(s)\r\n", "n = int(input())\r\n\r\n\r\nprint(((n//2)+1) * (n-n//2))\r\n", "n = int(input())\r\n\r\nif (n % 2 == 0):\r\n res = ((1 + (n // 2)) * (n // 2))\r\nelse:\r\n res = (n + 1) // 2\r\n n = n - 1\r\n res = res + ((1 + (n // 2)) * (n // 2))\r\n\r\n\r\nprint(res)", "'''input\n4\n'''\nn = int(input())\nl = [[False] * n]\nfor s in range(n):\n\tfor e in range(s+1, n+1):\n\t\tfor x in range(len(l)):\n\t\t\tif True not in l[x][s:e]:\n\t\t\t\tl[x][s:e] = [True] * (e-s)\n\t\t\t\tbreak\n\t\telse:\n\t\t\tl.append([False] * n)\n\t\t\tl[-1][s:e] = [True] * (e-s)\nprint(len(l))\n", "n = int(input())\n\nsumma = 0\nwhile n>0:\n summa+=n\n n-=2\nprint(summa)\n", "n = int(input())\r\nx = n//2\r\nprint((x+1)*(n-x))\r\n", "print(sum(i for i in range(int(input()),-1,-2)))", "n = int(input())\r\nitems = {}\r\n\r\nfor i in range(1, n+1):\r\n ci = []\r\n for j in range(n-i+1):\r\n curr = '0'*j + '1'*i + '0'*(n-i-j)\r\n curr = int(curr,2)\r\n ci.append(curr)\r\n items[i] = ci\r\n# print(items)\r\n\r\nmaximal = 2**n\r\n# curr = 0\r\ndef stopcheck():\r\n for k,v in items.items():\r\n if len(v)!=0:\r\n return False\r\n return True\r\n\r\ndef getnext():\r\n global ans\r\n global curr\r\n global total\r\n for k in range(total,0,-1):\r\n if len(items[k])==0:\r\n continue\r\n for num in items[k]:\r\n if curr & num == 0:\r\n items[k].remove(num)\r\n curr = curr | num\r\n total-=k\r\n return True\r\n return False\r\n\r\n\r\nans=0\r\nwhile True:\r\n if stopcheck():\r\n break\r\n curr = 0\r\n total = n\r\n ans+=1\r\n while curr<maximal:\r\n if not getnext():\r\n break\r\n\r\nprint(ans)", "def getans(n):\r\n if n == 2 :\r\n return 2\r\n if n == 1:\r\n return 1\r\n return n+getans(n-2)\r\nprint(getans(int(input())))\r\n", "import math\r\nn=int(input())\r\nprint(int((n//2+1)*math.ceil(n/2)))", "N = int(input())\n\nans = 1\ndone = [[False for _ in range(N+1)] for _ in range(N+1)]\nfor l in range(1, N):\n for b in range(N-l+1):\n e = b + l\n # print(b, e, done[b][e])\n if not done[b][e]:\n ans += 1\n done[b][e] = True\n if e <= N//2:\n done[e][N-b] = True\n elif b >= N//2:\n done[N-e][b] = True\n\nprint(ans)", "n = int(input())\r\nans = [0, 1, 2, 4, 6]\r\nfor i in range(4, 100):\r\n ans.append(2 * ans[i] - 2 * ans[i - 2] + ans[i - 3])\r\nprint(ans[n])", "q=int(input())\r\nt=q//2\r\nif q%2==0:\r\n print(t*(t+1))\r\nelse:\r\n print(t*(t+2)+1)\r\n\r\n", "import sys\ntry:\n sys.stdin = open('input.txt', 'r')\n sys.stdout = open('output.txt', 'w')\nexcept Exception as es:\n pass\n\nimport math\nn = int(input())\nprint((n // 2 + 1) * math.ceil(n / 2))\n", "def main():\n N = int(input())\n\n v = N + 1\n n = 0\n while v > 0:\n n += v - 1\n v -= 2\n\n print(n)\n\nmain()\n", "def solve(n):\r\n return int((n + n % 2) * (n + 2 - n % 2) / 4)\r\nn = int(input())\r\nprint(solve(n))", "n=int(input())\r\nans=0\r\nif(n%2==0):\r\n\tfor i in range(0,n+1,2):\r\n\t\tans+=i \r\n\tprint(ans)\r\nelse:\r\n\tfor i in range(1,n+1,2):\r\n\t\tans+=i \r\n\tprint(ans)", "n=int(input())\r\ncnt=0\r\nfor l in range(1,n+1):\r\n cnt+=min(n-l+1,l)\r\nprint(cnt)", "n = int(input())\r\n\r\nans = 0\r\nfor i in range(n,0,-2):\r\n\tans = ans + i\r\nprint(ans)", "n = int(input())\r\ns = n//2\r\nif n%2 == 0:\r\n\tprint (s**2+s)\r\nelse:\r\n\tprint (s**2+s+s+1)" ]

{"inputs": ["2", "3", "4", "21", "100", "1", "5", "6", "7", "8", "9", "10", "11", "12", "13", "14", "15", "16", "17", "18", "19", "20", "22", "23", "24", "25", "26", "27", "28", "29", "30", "31", "32", "33", "34", "35", "36", "37", "38", "39", "40", "41", "42", "43", "44", "45", "46", "47", "48", "49", "50", "51", "52", "53", "54", "55", "56", "57", "58", "59", "60", "61", "62", "63", "64", "65", "66", "67", "68", "69", "70", "71", "72", "73", "74", "75", "76", "77", "78", "79", "80", "81", "82", "83", "84", "85", "86", "87", "88", "89", "90", "91", "92", "93", "94", "95", "96", "97", "98", "99", "1", "5"], "outputs": ["2", "4", "6", "121", "2550", "1", "9", "12", "16", "20", "25", "30", "36", "42", "49", "56", "64", "72", "81", "90", "100", "110", "132", "144", "156", "169", "182", "196", "210", "225", "240", "256", "272", "289", "306", "324", "342", "361", "380", "400", "420", "441", "462", "484", "506", "529", "552", "576", "600", "625", "650", "676", "702", "729", "756", "784", "812", "841", "870", "900", "930", "961", "992", "1024", "1056", "1089", "1122", "1156", "1190", "1225", "1260", "1296", "1332", "1369", "1406", "1444", "1482", "1521", "1560", "1600", "1640", "1681", "1722", "1764", "1806", "1849", "1892", "1936", "1980", "2025", "2070", "2116", "2162", "2209", "2256", "2304", "2352", "2401", "2450", "2500", "1", "9"]}

UNKNOWN

PYTHON3

CODEFORCES

157

8db0bc286b569043a28bd31c19f4c65b

Shaass and Oskols

Shaass has decided to hunt some birds. There are *n* horizontal electricity wires aligned parallel to each other. Wires are numbered 1 to *n* from top to bottom. On each wire there are some oskols sitting next to each other. Oskol is the name of a delicious kind of birds in Shaass's territory. Supposed there are *a**i* oskols sitting on the *i*-th wire. Sometimes Shaass shots one of the birds and the bird dies (suppose that this bird sat at the *i*-th wire). Consequently all the birds on the *i*-th wire to the left of the dead bird get scared and jump up on the wire number *i*<=-<=1, if there exists no upper wire they fly away. Also all the birds to the right of the dead bird jump down on wire number *i*<=+<=1, if there exists no such wire they fly away. Shaass has shot *m* birds. You're given the initial number of birds on each wire, tell him how many birds are sitting on each wire after the shots. The first line of the input contains an integer *n*, (1<=≤<=*n*<=≤<=100). The next line contains a list of space-separated integers *a*1,<=*a*2,<=...,<=*a**n*, (0<=≤<=*a**i*<=≤<=100). The third line contains an integer *m*, (0<=≤<=*m*<=≤<=100). Each of the next *m* lines contains two integers *x**i* and *y**i*. The integers mean that for the *i*-th time Shaass shoot the *y**i*-th (from left) bird on the *x**i*-th wire, (1<=≤<=*x**i*<=≤<=*n*,<=1<=≤<=*y**i*). It's guaranteed there will be at least *y**i* birds on the *x**i*-th wire at that moment. On the *i*-th line of the output print the number of birds on the *i*-th wire. Sample Input 5 10 10 10 10 10 5 2 5 3 13 2 12 1 13 4 6 3 2 4 1 1 2 2 Sample Output 0 12 5 0 16 3 0 3

[ "n=int(input())\r\ns=input()\r\ns=s.split()\r\nl=[]\r\nfor i in range(n):\r\n l.append(int(s[i]))\r\n\r\n\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n \r\n ss=input()\r\n ss=ss.split()\r\n xi=int(ss[0])\r\n yi=int(ss[1])\r\n ox=l[xi-1]\r\n l[xi-1]-=yi\r\n if xi-2>=0:\r\n l[xi-2]+=(yi-1)\r\n \r\n ox=ox-yi\r\n l[xi-1]-=ox\r\n if xi-1<n-1:\r\n l[xi]+=ox\r\n\r\nfor j in l:\r\n print(j)\r\n", "# Test case 1\r\n'''\r\n1: 1 2 3 4 5 6 7 8 9 10\r\n2: 1 2 3 4 5 6 7 8 9 10\r\n3: 1 2 3 4 5 6 7 8 9 10\r\n4: 1 2 3 4 5 6 7 8 9 10\r\n5: 1 2 3 4 5 6 7 8 9 10\r\n\r\n# 2 5\r\n1: 1 2 3 4 1 2 3 4 5 6 7 8 9 10\r\n2: 0\r\n3: 1 2 3 4 5 6 7 8 9 10 6 7 8 9 10\r\n4: 1 2 3 4 5 6 7 8 9 10\r\n5: 1 2 3 4 5 6 7 8 9 10\r\n\r\n# 3 13\r\n1: 1 2 3 4 1 2 3 4 5 6 7 8 9 10\r\n2: 1 2 3 4 5 6 7 8 9 10 6 7\r\n3: 0 \r\n4: 1 2 3 4 5 6 7 8 9 10 9 10\r\n5: 1 2 3 4 5 6 7 8 9 10\r\n\r\n# 2 12\r\n1: 1 2 3 4 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 6\r\n2: 7\r\n3: 0 \r\n4: 1 2 3 4 5 6 7 8 9 10 9 10\r\n5: 1 2 3 4 5 6 7 8 9 10\r\n\r\n# 1 13\r\n1: 9 \r\n2: 7 10 1 2 3 4 5 6 7 8 9 10 6\r\n3: 0 \r\n4: 1 2 3 4 5 6 7 8 9 10 9 10\r\n5: 1 2 3 4 5 6 7 8 9 10\r\n\r\n# 4 6\r\n1: 0 (0) \r\n2: 7 10 1 2 3 4 5 6 7 8 9 10 6\r\n3: 1 2 3 4 5\r\n4: 0\r\n5: 1 2 3 4 5 6 7 8 9 10 7 8 9 10 9 10\r\n'''\r\n\r\nwire = int(input())\r\narr = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n index = x - 1\r\n amount = arr[index]\r\n jump_up = y - 1\r\n jump_down = amount - y\r\n arr[index] = 0\r\n if index - 1 >= 0:\r\n arr[index-1] += jump_up\r\n if index + 1 < len(arr):\r\n arr[index+1] += jump_down\r\nfor v in arr:\r\n print(v)", "n1=int(input())\r\nw=list(map(int,input().split()))\r\nn2,b=int(input()),[]\r\nfor i in range(n2) :\r\n b.append(list(map(int,input().split())))\r\n if b[i][0]-2>-1 : w[b[i][0]-2]+=b[i][1]-1\r\n if b[i][0]<n1 : w[b[i][0]]+=w[b[i][0]-1]-b[i][1]\r\n w[b[i][0]-1]=0\r\nfor i in w : print(i)", "input()\r\nWires = list(map(int, input().split()))\r\nN = int(input())\r\nShot = list()\r\nfor i in range(N):\r\n Shot.append(list(map(int, input().split())))\r\n Shot[i][0] -= 1\r\n\r\nfor i in range(len(Shot)):\r\n if Shot[i][0] != 0:\r\n Wires[Shot[i][0] - 1] += Shot[i][1] - 1\r\n if Shot[i][0] != len(Wires) - 1:\r\n Wires[Shot[i][0] + 1] += Wires[Shot[i][0]] - Shot[i][1]\r\n Wires[Shot[i][0]] = 0\r\n\r\nprint(*Wires, sep=\"\\n\")\r\n", "n = int(input())\r\nwires = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x = x - 1\r\n left = y-1\r\n right = wires[x] - y\r\n wires[x] = 0\r\n if x >0:\r\n wires[x-1] += left\r\n if x < n-1:\r\n wires[x+1] += right\r\nprint('\\n'.join(map(str,wires)))", "n = int(input())\r\nlis = list(int(num) for num in input().strip().split())[:n]\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n x, y = input().split()\r\n x = int(x)-1\r\n y = int(y)-1\r\n lis[x] -= 1\r\n if x > 0:\r\n lis[x-1] += y\r\n if x < n-1:\r\n lis[x+1] += lis[x] - y\r\n lis[x] = 0\r\nfor i in range(n):\r\n print(lis[i])\r\n\r\n\r\n\r\n", "import sys\r\n\r\n\r\ndef sol():\r\n\tread = sys.stdin.readline\r\n\twires: int = int(read())\r\n\tbirds: list[int] = [int(i) for i in read().split()]\r\n\tinstructions: int = int(read())\r\n\tfor _ in range(instructions):\r\n\t\twire_idx, bird_idx = (int(i) for i in read().split())\r\n\t\tleft_birds = bird_idx - 1\r\n\r\n\t\tif left_birds > 0 and wire_idx > 1:\r\n\t\t\tbirds[wire_idx - 2] += left_birds\r\n\r\n\t\tright_birds = birds[wire_idx - 1] - bird_idx\r\n\t\tif right_birds > 0 and wire_idx < len(birds):\r\n\t\t\tbirds[wire_idx] += right_birds\r\n\t\t# Clear the current\r\n\t\tbirds[wire_idx - 1] = 0\r\n\r\n\r\n\tfor birt in birds:\r\n\t\tprint(birt)\r\n\r\nif __name__ == \"__main__\":\r\n\tsol()", "n=int(input())\r\narr=list(map(int,input().split()))\r\nm=int(input())\r\npos=[list(map(int,input().split())) for i in range(m)]\r\n\r\nfor i in range(m):\r\n # onLeft=arr[pos[i][0]-1]\r\n onLeft=pos[i][1]-1\r\n onRight=arr[pos[i][0]-1]-pos[i][1]\r\n arr[pos[i][0]-1]=0\r\n if pos[i][0]-2>=0:\r\n arr[pos[i][0]-2]+=onLeft\r\n if pos[i][0]<n:\r\n arr[pos[i][0]]+=onRight\r\n\r\nfor i in range(n):\r\n print(arr[i])", "n= int(input())\r\nl=list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x,p = map(int,input().split())\r\n if(x-1!=n-1 and x-1!=0):\r\n l[x] = l[x]+l[x-1]-p\r\n l[x-2] = l[x-2]+p-1\r\n l[x-1] = 0\r\n elif(x-1==n-1):\r\n l[x-2] = l[x-2]+p-1\r\n l[x-1] = 0\r\n elif(x-1==0):\r\n l[x] = l[x]+l[x-1]-p\r\n l[x-1] = 0\r\nfor i in l:\r\n print(i)", "n = int(input())\nbirds = list(map(int,input().split()))\nm = int(input())\n\nwhile m > 0:\n\tpositions = list(map(int,input().split()))\n\tx = positions[0] - 1\n\ty = positions[1] \n\n\tif x == 0 and n == 1:\n\t\tbirds = [0]\n\telif x > 0 and x < n-1:\n\t\tbirds[x+1] = birds[x+1] + birds[x] - y\n\t\tbirds[x-1] = birds[x-1] + y - 1\n\t\tbirds[x] = 0\n\telif x == 0:\n\t\tbirds[x+1] = birds[x+1] + birds[x] - y\n\t\tbirds[x] = 0\n\telif x == n - 1:\n\t\tbirds[x-1] = birds[x-1] + y - 1\n\t\tbirds[x] = 0\n\n\tm = m - 1\n\nfor bird in birds:\n\tprint(bird)\n\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nl.insert(0,-1)\r\nt = int(input())\r\nwhile(t):\r\n t -= 1\r\n q = [int(x) for x in input().split()]\r\n try:\r\n l[q[0]-1] += q[1]-1\r\n except:\r\n pass\r\n try:\r\n l[q[0]+1] += l[q[0]]-q[1]\r\n except:\r\n pass\r\n l[q[0]] = 0\r\nfor i in range(1,n+1):\r\n print(l[i])", "wires = int(input())\r\nbirds = [0] + list(map(int, input().split())) + [0]\r\nshots = int(input())\r\n\r\nfor i in range(shots):\r\n x, y = map(int, input().split())\r\n birds[x - 1] += y - 1\r\n birds[x + 1] += birds[x] - y\r\n birds[x] = 0\r\n\r\nfor i in range(1, wires + 1):\r\n print(birds[i])\r\n", "import sys\nimport math\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\nt = int(input())\nwhile t:\n i, pos = map(int, input().split())\n i -= 1\n if i > 0: a[i - 1] += pos - 1\n if i + 1 < n: a[i + 1] += (a[i] - pos)\n t -= 1\n a[i] = 0\nfor el in a: print(el)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nfor inh in range(0,m):\r\n\ti,j=map(int,input().split())\r\n\ti-=1\r\n\tk=a[i]\r\n\ta[i]=0\r\n\tright=k-j\r\n\tleft=j-1\r\n\tif i>0:\r\n\t\ta[i-1]+=left\r\n\tif i<n-1:\r\n\t\ta[i+1]+=right\r\nfor i in range(0,n):\r\n\tprint(a[i])", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nm=int(input())\r\nw=[[0]*2 for i in range(m)]\r\n\r\nfor i in range(m):\r\n w[i][0],w[i][1]=map(int,input().split())\r\n\r\nfor i in range(m):\r\n\r\n left=w[i][1]-1\r\n right=a[w[i][0]-1]-w[i][1]\r\n\r\n if w[i][0]!=1:\r\n a[w[i][0]-2]+=left\r\n\r\n if w[i][0]!=n:\r\n a[w[i][0]]+=right\r\n\r\n a[w[i][0]-1]=0\r\n\r\nfor i in range(n):\r\n print(a[i])", "x = input()\r\nx = list(map(int,input().strip().split()))\r\ny = input()\r\nfor i in range(int(y)):\r\n\tlistt = list(map(int,input().strip().split()))\r\n\tif (listt[0]-1 > 0):\r\n\t\tx[listt[0]-2] = x[listt[0]-2] + listt[1] -1\r\n\t\t\r\n\tif (listt[0] < len(x)):\r\n\t\tx[listt[0]] = x[listt[0]] + x[listt[0]-1] - listt[1]\r\n\t\r\n\t\r\n\tx[listt[0]-1] = 0\r\n\t\t\r\n\t\r\nprint(*x,sep='\\n')\r\n", "n = int(input())\r\na = list(map(int,input().split(' ')))\r\na.insert(0,0)\r\na.append(0)\r\nm = int(input())\r\nfor i in range(1,m+1):\r\n x, y = map(int,input().split(' '))\r\n a[x - 1] += y-1\r\n a[x + 1] += a[x] - y\r\n a[x] = 0\r\nfor i in range(1,n+1):\r\n print(a[i])\r\n \r\n", "n=int(input())\r\nwires=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n x, y= map(int, input().split())\r\n x=x-1\r\n birds= wires[x]\r\n right= birds-y\r\n left= birds-right-1\r\n wires[x]=0\r\n if(x-1>=0):\r\n wires[x-1]+=left\r\n if(x+1<n):\r\n wires[x+1]+=right\r\nfor i in range(n):\r\n print(wires[i])\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if x != 1:\r\n a[x - 2] += (y - 1)\r\n if x != n:\r\n a[x] += (a[x - 1] - y)\r\n a[x - 1] = 0\r\n\r\nfor i in a:\r\n print(i)\r\n", "import sys\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = (int(el) for el in input().split())\r\n x -= 1\r\n if x - 1 >= 0:\r\n a[x - 1] += y - 1\r\n if x + 1 <= n - 1:\r\n a[x + 1] += a[x] - y\r\n a[x] = 0\r\n \r\nfor el in a:\r\n print(el)\r\n \r\n \r\n ", "import math\r\nn=int(input())\r\na=[]\r\na=list(map(int,input().strip().split()))\r\ns=int(input())\r\n\r\n\r\nfor i in range(s):\r\n x,y=map(int,input().split())\r\n x-=1\r\n if(len(a)==1 and s==1):\r\n a[0]=0\r\n break \r\n if x==0:\r\n \r\n a[x+1]+=a[x]-y\r\n a[x]=0\r\n elif x==n-1:\r\n a[x-1]+=y-1\r\n a[x]=0\r\n else:\r\n a[x-1]+=y-1\r\n a[x+1]+=a[x]-y\r\n \r\n a[x]=0\r\nfor i in a:\r\n print(i)", "n = int(input())\r\nl_w = list(map(int, input().split()))\r\n\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if x - 2 >= 0:\r\n l_w[x - 2] += y - 1\r\n if x != n:\r\n l_w[x] += l_w[x - 1] - y\r\n \r\n l_w[x - 1] = 0\r\n \r\nprint(\"\\n\".join(str(x) for x in l_w))", "n = int(input())\r\nbirds = input().split()\r\nbirds = [int(bird) for bird in birds]\r\nm = int(input())\r\nfor i in range(m):\r\n wire, position = map(int, input().split())\r\n left = position - 1\r\n right = birds[wire - 1] - position\r\n if wire - 1 > 0:\r\n birds[wire - 1 - 1] += left\r\n if wire < n:\r\n birds[wire] += right\r\n birds[wire - 1] = 0\r\nfor j in range(n):\r\n print(birds[j])\r\n", "n = int(input())\r\na = list(map(int,input().strip().split()))\r\nt = int(input())\r\nfor i in range(t):\r\n x,y = input().split()\r\n x = int(x)\r\n y = int(y)\r\n n1 = a[x-1] - y\r\n n2 = y - 1\r\n a[x-1] = 0\r\n if x < n:\r\n a[x] += n1\r\n if x > 1:\r\n a[x-2] += n2\r\nfor i in a:\r\n print(i)\r\n", "n = int(input())\r\nwires = list(map(int, input().split()))\r\nshots = int(input())\r\nshots_list = list()\r\nfor i in range(shots):\r\n a,b = map(int, input().split())\r\n a -= 1\r\n if a != 0:\r\n wires[a-1] += b-1\r\n\r\n if a != n-1:\r\n wires[a+1] += wires[a] - b\r\n\r\n wires[a] = 0\r\n\r\n\r\nfor i in range(len(wires)):\r\n print(wires[i])\r\n\r\n", "n = int(input())\r\nbox = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n x -= 1\r\n if x != 0:\r\n box[x-1] += y-1\r\n if x != n-1:\r\n box[x+1] += box[x] - y\r\n box[x] = 0\r\nfor x in box:\r\n print(x,end=\"\\n\")", "n = int(input())\nbirds_on_wires = list(map(int, input().split()))\n\nattempts = int(input())\n\nfor _ in range(attempts):\n x, y = map(int, input().split())\n i = x-1\n left, right = y - 1, birds_on_wires[i]-y\n \n if (i-1) < 0:\n birds_on_wires[i] = 0\n else:\n birds_on_wires[i-1] += left\n birds_on_wires[i] = 0\n \n if (i+1) >= len(birds_on_wires):\n birds_on_wires[i] = 0\n else:\n birds_on_wires[i+1] += right\n birds_on_wires[i] = 0\n\nfor p in birds_on_wires:\n print(p)", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\nm = int(input())\r\nd = []\r\n\r\nfor i in range(m):\r\n\tx,y = map(int,input().split())\r\n\tif (x-2)>=0:\r\n\t\ts[x-2]+=y-1\r\n\tif x<n:\r\n\t\ts[x]+=s[x-1]-y\r\n\ts[x-1]=0\r\n\r\nfor i in s:\r\n\tprint(i)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n if x-2>=0:\r\n a[x-2]+=y-1\r\n if x<n:\r\n a[x]+=a[x-1]-y\r\n a[x-1]=0\r\nprint(*a,sep='\\n')\r\n", "#####--------------Template Begin-------------------#####\r\nfrom fractions import Fraction\r\nimport sys\r\n#input = sys.stdin.readline\r\ndef i(): #Regular input\r\n\treturn input()\r\ndef ii(): #integer input\r\n\treturn int(input())\r\ndef li(): #list input\r\n\treturn input().split()\r\ndef mi(): #map input\r\n\treturn list(map(int, input().split()))\r\n#####---------------Template Ends-------------------######\r\nn=ii()\r\na=mi()\r\nm=ii()\r\nfor i in range(m):\r\n\tx,y=mi()\r\n\tx-=1\r\n\tif x-1>=0:\r\n\t\ta[x-1]+=y-1\r\n\tif x+1<n:\r\n\t\ta[x+1]+=a[x]-y\r\n\ta[x]=0\r\nfor i in a:\r\n\tprint(i)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nm = int(input())\r\nwhile (m != 0):\r\n i , b_s = list(map(int, input().split())) # i={1,2,3} b_s={} \r\n prev_index = i - 1 - 1\r\n cur_index = i - 1\r\n if prev_index >= 0:\r\n A[prev_index] += (b_s - 1)\r\n n_index = i\r\n if n_index < n:\r\n A[n_index] += A[cur_index] - b_s\r\n A[cur_index] = 0\r\n m -= 1\r\nfor i in A:\r\n print(i)", "n = (int)(input())\r\na = (list)(map(int , input().split()))\r\nq = (int)(input())\r\nfor _ in range(q) :\r\n x , y = (list)(map(int , input().split()))\r\n for __ in range(1 , a[x - 1] + 1) :\r\n if __ < y and x - 2 >= 0 : a[x - 2] += 1\r\n if __ > y and x < n : a[x] += 1\r\n a[x - 1] -= 1\r\n\r\nprint(*a , sep='\\n')", "from re import S\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n array = [int(i) for i in input().split(' ')]\r\n m = int(input())\r\n for i in range(m):\r\n x, y = [int(i) for i in input().split(' ')]\r\n # Correct index\r\n x = x - 1\r\n \r\n up = y - 1\r\n down = array[x] - y\r\n array[x] = 0\r\n if x - 1 >= 0:\r\n array[x - 1] += up\r\n if x + 1 < n:\r\n array[x + 1] += down\r\n for i in array:\r\n print(i)\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\nm=int(input())\r\nfor i in range(0,m):\r\n x,y=map(int,input().split(' '))\r\n x=x-1\r\n if(x>=1):\r\n a[x-1]=a[x-1] + (y-1)\r\n if(x<n-1):\r\n a[x+1]=a[x+1] + (a[x]-y)\r\n a[x]=0\r\nfor i in range(0,n):\r\n print(a[i])", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n k,j=map(int,input().split())\r\n k-=1\r\n if k-1==-1:\r\n pass\r\n else:\r\n a[k-1]+=j-1\r\n if k+1==n:\r\n pass\r\n else:\r\n a[k+1]+=a[k]-j\r\n a[k]=0\r\nfor i in range(n):\r\n print(a[i])\r\n", "l1 = []\r\nl2 = []\r\nn = int(input())\r\nl3 = [int(number) for number in input().split(' ')]\r\nfor i in l3:\r\n for j in range(i):\r\n l2.append(0)\r\n l1.append(l2)\r\n l2 = list()\r\nm = int(input())\r\nfor i in range(m):\r\n l4 = [int(num) for num in input().split(' ')]\r\n x = l4[0]\r\n y = l4[1]\r\n for j in range(len(l1[x - 1]) - y):\r\n if x < n:\r\n l1[x].append(0)\r\n for j in range(y - 1):\r\n if x - 2 >= 0:\r\n l1[x - 2].append(0)\r\n l1[x - 1] = list()\r\nfor i in l1:\r\n print(len(i))\r\n", "def solve():\r\n n = int(input())\r\n wires = list(map(int, input().split()))\r\n shots = int(input())\r\n for shot in range(shots):\r\n wire_idx, bird_idx = map(int, input().split()) \r\n\r\n if wire_idx - 1 != 0:\r\n wires[wire_idx - 2] += bird_idx - 1 # left\r\n if wire_idx != n:\r\n wires[wire_idx] += wires[wire_idx - 1] - bird_idx #right\r\n wires[wire_idx - 1] = 0\r\n\r\n for out in wires:\r\n print(out)\r\nsolve()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jan 12 12:16:38 2019\r\n\r\n@author: Noussa\r\n\"\"\"\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n x,y= map(int,input().split())\r\n x -= 1\r\n if x > 0:\r\n a[x-1] += y - 1\r\n if x < len(a) - 1:\r\n a[x+1] += a[x] - y\r\n a[x] = 0\r\n \r\nfor i in a:\r\n print(i)", "n = int(input())\na = list(map(int, input().split()))\n\nm = int(input())\nfor i in range(m):\n x, y = list(map(int, input().split()))\n\n left = y-1\n right = a[x-1]-y\n\n if x-1 != 0:\n a[x-2] += left\n\n if x-1 != n-1:\n a[x] += right\n\n a[x-1] = 0\n\nfor i in range(n):\n print(a[i])\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\nm = int(input())\r\n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n\r\n if x != 0:\r\n a[x-1] += y - 1\r\n \r\n if x != n-1:\r\n a[x + 1] += a[x] - y\r\n \r\n a[x] = 0\r\n\r\nfor i in a:\r\n print(i)", "n = input()\r\nbirds = list(map(int, input().strip().split()))\r\nbirds.append(0)\r\nbirds.insert(0,0)\r\nm = int(input())\r\nl = len(birds)\r\nfor i in range(m):\r\n x, y = map(int, input().strip().split())\r\n birds[x - 1] = birds[x - 1] + (y - 1)\r\n birds[x+1] += (birds[x] - y)\r\n birds[x] = 0\r\nfor i in range(1,l-1):\r\n print(birds[i])", "# https://codeforces.com/contest/294/problem/A\r\nn = int(input())\r\nbirds = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if n == 1:\r\n birds[0] = 0\r\n break\r\n\r\n if x == 0:\r\n birds[x + 1] = birds[x + 1] + (birds[x] - y)\r\n birds[x] = 0\r\n elif x == n - 1:\r\n birds[x - 1] += (y - 1)\r\n birds[x] = 0\r\n else:\r\n birds[x - 1] = birds[x - 1] + (y - 1)\r\n birds[x + 1] = birds[x + 1] + (birds[x] - y)\r\n birds[x] = 0\r\n\r\nfor i in birds:\r\n print(i)\r\n", "k=input()\r\nx=list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n m,n=input().split()\r\n m=int(m)\r\n n=int(n)\r\n if m==len(x):\r\n x[m-2]+=n-1\r\n x[m-1]=0\r\n elif m-1==0:\r\n x[m]+=x[m-1]-n\r\n x[m-1]=0\r\n else:\r\n x[m-2]+=n-1\r\n x[m]+=x[m-1]-n\r\n x[m-1]=0\r\nfor i in x:\r\n print(i)", "n = int(input())\r\nl1 = list(map(int,input().split()))\r\n\r\nn2 = int(input())\r\n\r\nl = []\r\nfor i in range(n2):\r\n l2 = list(map(int,input().split()))\r\n l.append(l2)\r\n\r\n \r\nfor i in l:\r\n if i[0] == n:\r\n l1[n-2] += i[1] - 1\r\n l1[n-1] = 0\r\n \r\n elif i[0] == 1:\r\n l1[1] += l1[0] - i[1]\r\n l1[0] = 0\r\n \r\n else:\r\n l1[i[0]] += l1[i[0]-1] - i[1]\r\n l1[i[0]-2] += i[1] - 1\r\n l1[i[0]-1] = 0\r\n \r\n \r\n \r\nfor i in l1:\r\n print(i)\r\n ", "i=int(input())\r\nl=list(map(int,input().split()))\r\nfor _ in range(int(input())):\r\n\t# print(l)\r\n\tn,k=map(int,input().split())\r\n\tif n-2>=0:\r\n\t\tl[n-2]+=k-1\r\n\tif n<i:\r\n\t\tl[n]+=l[n-1]-k\r\n\tl[n-1]=0\r\nfor x in l:\r\n\tprint(x)", "n=int(input())\r\na=list(map(int, input().split()) )\r\nm=int(input())\r\nfor i in range(0,m):\r\n x,y=list(map(int, input().split()))\r\n if x !=1 : a[x-2]+= y-1 \r\n if x != (len(a)) : a[x]+= a[x-1]-y\r\n a[x-1]=0\r\n \r\nfor i in (a):\r\n\r\n print(i)\r\n", "from sys import stdin\r\nreadlist = lambda: list(map(int,stdin.readline().split()))\r\nreadint = lambda: int(stdin.readline())\r\n\r\nn=readint()\r\na = [0] + readlist() + [0]\r\n\r\nfor i in range(readint()):\r\n x , y = readlist()\r\n a[x-1] += y-1\r\n a[x+1] += a[x]-y\r\n a[x]=0\r\n\r\nprint(\"\\n\".join(map(str,a[1:n+1])))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\np=[]\r\nfor i in range(m):\r\n\tw=list(map(int,input().split()))\r\n\tp.append(w)\r\nfor i in range(m):\r\n\tr=p[i][0]\r\n\tt=l[r-1]-p[i][1]\r\n\tif r<n:\r\n\t\tl[r]=l[r]+t\r\n\tl[r-1]=0\r\n\tif r-2>=0:\r\n\t\tl[r-2]=l[r-2]+p[i][1]-1\r\nfor i in range(len(l)):\r\n\tprint(l[i])", "nOLine =int(input())\r\nn = input().split(\" \")\r\nnOBird =[int(i) for i in n]\r\nnOShots = int(input())\r\n\r\nwhile nOShots > 0:\r\n shot = input().split(\" \")\r\n x = int(shot[0]) - 1 # to convert to index\r\n y = int(shot[1])\r\n if nOLine > 1:\r\n if x > 0:\r\n nOBird[x - 1] += y-1\r\n if x < nOLine -1 :\r\n nOBird[x+1] += nOBird[x] - y\r\n nOBird[x] = 0\r\n \r\n nOShots -=1\r\n \r\nfor i in nOBird:\r\n print(i)", "n=int(input())\r\nbirds_on=list(map(int,input().split()))\r\nnum_shot=int(input())\r\nfor i in range(num_shot):\r\n a,b=map(int,input().split())\r\n i=a-1\r\n if i!= 0:\r\n birds_on[i-1] += b-1\r\n if i != len(birds_on)-1:\r\n birds_on[i+1] += (birds_on[i]-b)\r\n birds_on[i]=0\r\nfor i in birds_on:\r\n print(i)", "n = int(input())\na = [int(i) for i in input().split()]\nm = int(input())\nfor i in range(m):\n x , y = [int(j) for j in input().split()]\n if x < n:\n a[x] += a[x - 1] - y\n\n if x - 2 >= 0:\n a[x - 2] += y - 1\n\n a[x - 1] = 0\n\nfor j in range(n):\n print(a[j]) \n \t \t \t\t \t \t \t\t \t\t \t\t", "N = int(input())\r\nwires = [int(i) for i in input().split(\" \")]\r\nM = int(input())\r\nfor j in range(M):\r\n tow_num = input().split(\" \")\r\n X,Y = int(tow_num[0]) - 1,int(tow_num[1])\r\n if X != 0:\r\n wires[X - 1]+=Y - 1\r\n if X != N - 1:\r\n wires[X + 1]+=wires[X] - Y\r\n wires[X] = 0\r\nfor k in wires:\r\n print(k)\r\n", "from sys import stdin\r\n\r\nn = int(stdin.readline().rstrip())\r\nl = list(map(int,stdin.readline().split()))\r\nm = int(stdin.readline().rstrip())\r\nfor i in range(m):\r\n\ta,b = map(int,stdin.readline().split())\r\n\ta=a-1\r\n\ttotal = l[a]\r\n\tleft = b-1\r\n\tright = total-b\r\n\tl[a]=0\r\n\tif a!=0:\r\n\t\tl[a-1] = l[a-1]+left\r\n\tif a!=n-1:\r\n\t\tl[a+1] = l[a+1]+right\r\nfor i in l:\r\n\tprint(i)", "if __name__ == '__main__':\r\n n = int(input())\r\n aa = list(map(int, input().split()))\r\n m = int(input())\r\n for _ in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if x:\r\n aa[x - 1] += y - 1\r\n if n - x - 1:\r\n aa[x + 1] += aa[x] - y\r\n aa[x] = 0\r\n for i in range(n):\r\n print(aa[i])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n t=l[x-1]-y\r\n l[x-1]=0\r\n if x-2>=0:\r\n l[x-2]+=y-1\r\n if x!=n:\r\n l[x]+=t\r\nprint(*l,sep=\"\\n\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tx=x-1\r\n\tif n==1:\r\n\t\ta[0]=0\r\n\t\tbreak\r\n\tif x==0:\r\n\t\ta[x+1]+=a[x]-y\r\n\t\ta[x]=0\r\n\telif x==n-1:\t\r\n\t\ta[x-1]+=y-1\r\n\t\ta[x]=0\r\n\telse:\r\n\t\ta[x-1]+=y-1\r\n\t\ta[x+1]+=a[x]-y\r\n\t\ta[x]=0\r\nprint(*a,sep='\\n')", "import sys\n\nn = int(input())\na = list(map(int, input().split()))\nm = int(input())\nfor _ in range(m):\n wire, left = [int(x) - 1 for x in input().split()]\n right = a[wire] - left - 1\n a[wire] = 0\n if wire != 0:\n a[wire - 1] += left\n if wire != n - 1:\n a[wire + 1] += right\nprint(*a, sep=\"\\n\")\n", "number_of_wires = int(input())\r\nlist_of_birds = list(map(int,input().split())) # this is the list of birds for each wire\r\nnumber_of_shots = int(input())\r\n\r\nlist_of_shots_per_wire = list()\r\nfor i in range(number_of_shots):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if x > 0:\r\n list_of_birds[x-1] += y - 1\r\n if x < number_of_wires - 1:\r\n list_of_birds[x + 1] += list_of_birds[x] - y\r\n list_of_birds[x] = 0\r\n\r\nfor i in list_of_birds:\r\n print(i)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nwhile m>0:\r\n x,y=list(map(int,input().split()))\r\n if x-2>=0:\r\n a[x-2]+=y-1\r\n if x<n:\r\n a[x]+=(a[x-1]-y)\r\n a[x-1]=0\r\n m-=1\r\nfor i in a:\r\n print(i)\r\n ", "n = int(input())\na = [int(i) for i in input().split()]\nm = int(input())\nwhile m:\n x,y = input().split()\n x = int(x)-1\n y = int(y)\n if x!=0:\n a[x-1] += y-1\n if x<n-1:\n a[x+1] += a[x]-y\n a[x] = 0\n m -= 1\nfor i in range(n):\n print(a[i])\n\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().strip().split()))\r\n\r\nm = int(input())\r\n\r\nfor i in range (m):\r\n shoot=list(map(int, input().strip().split()))\r\n l = shoot[1]-1\r\n r = a[shoot[0]-1]-shoot[1]\r\n if(shoot[0] != 1):\r\n a[shoot[0]-2] += l\r\n if(shoot[0] != n):\r\n a[shoot[0]] += r\r\n a[shoot[0]-1] = 0\r\n\r\n[print(i) for i in a]", "l=int(input())\r\nres = list(input().split())\r\nres=list(map(int,res))\r\nl2=int(input())\r\na=[]\r\nfor i in range(l2):\r\n a1,a2=input().split()\r\n a1=int(a1)\r\n a2=int(a2)\r\n if(a1>1):res[a1-2]+=a2-1\r\n if(a1<l):res[a1]+= res[a1-1]-a2\r\n res[a1-1]=0\r\nfor j in range(len(res)):\r\n print(res[j])\r\n \r\nsum=1\r\n\r\n\r\n#l=list(map(int, input().split()))\r\n#l.sort()\r\n#print(min(sum_n1_1,sum_n1_0)+min(sum_n2_1,sum_n2_0))'''", "n = int(input())\r\narr = list(map(int, input().split(\" \")))\r\nr = int(input())\r\n\r\nwhile r > 0:\r\n r -= 1\r\n x, y = list(map(int, input().split(\" \")))\r\n left = y - 1\r\n right = arr[x-1] - y\r\n arr[x-1] = 0\r\n if x-1 == 0 and x == n:\r\n continue\r\n elif x-1 == 0:\r\n arr[x] += right\r\n elif x == n:\r\n arr[x-2] += left\r\n else:\r\n arr[x] += right\r\n arr[x - 2] += left\r\n\r\nfor x in arr:\r\n print(x)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tc=l[x-1]\r\n\tif x-2>=0:\r\n\t\tl[x-2]+=y-1\r\n\tif x<=n-1:\r\n\t\tl[x]+=c-y\r\n\tl[x-1]=0\r\nfor i in range(n):\r\n\tprint(l[i])", "\"\"\"li = list(map(int,input().split(\" \")))\r\ni=1\r\nwhile True:\r\n li[0]=li[0]*3\r\n li[1]=li[1]*2\r\n if(li[0]>li[1]):\r\n print(i)\r\n break\r\n i=i+1\r\n\"\"\"\r\nwn = int(input())\r\nli =list(map(int,input().split(\" \")))\r\nn = int(input())\r\nop=list()\r\ni=0\r\nwhile i<n:\r\n op.append(list(map(int,input().split(\" \"))))\r\n i=i+1\r\ni=0\r\n\r\nwhile i<n:\r\n wire =li[op[i][0]-1]\r\n lb = abs(op[i][1]-1)\r\n \r\n rb = abs(wire -op[i][1])\r\n \r\n li[op[i][0]-1]=0\r\n \r\n if(op[i][0]-2>=0):\r\n \r\n li[op[i][0]-2]=li[op[i][0]-2]+lb\r\n \r\n if(op[i][0]<wn):\r\n li[op[i][0]]=li[op[i][0]]+rb\r\n \r\n i=i+1\r\ni=0\r\nwhile i<wn:\r\n print(li[i])\r\n i=i+1 \r\n \r\n \r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jul 23 11:57:40 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 21 - CF294-DIV2A\r\n\"\"\"\r\n\r\nwires = int(input())\r\nbirdNums = list(map(int,input().split()))\r\nshots = int(input())\r\nfor i in range(shots):\r\n wire, bird = map(int,input().split())\r\n if wire != 1:\r\n birdNums[wire-2] += bird-1\r\n if wire != wires:\r\n birdNums[wire] += birdNums[wire-1]-bird\r\n birdNums[wire-1] = 0\r\nfor i in range(len(birdNums)):\r\n print(birdNums[i])", "n = int(input())\nwires = input().split()\nfor i in range(n):\n wires[i] = int(wires[i])\nshots = int(input())\nfor i in range(shots):\n shot = input().split()\n for j in range(2):\n shot[j] = int(shot[j]) - 1\n wires[shot[0]] -= 1\n if shot[0] > 0:\n wires[shot[0] - 1] += shot[1]\n if shot[0] < n - 1:\n wires[shot[0] + 1] += wires[shot[0]] - shot[1]\n wires[shot[0]] = 0\nfor wire in wires:\n print(wire)\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nm = int(input())\r\nlst.append(0)\r\nlst.insert(0,0)\r\n\r\nfor i in range(1,m+1):\r\n x,y = list(map(int, input().split()))\r\n \r\n lst[x-1] += (y-1)\r\n lst[x+1] += lst[x]-y\r\n lst[x] = 0\r\n \r\nfor i in range(1,n+1):\r\n print(lst[i])", "num =int(input())\narr = list(map(int,input().split()))\nkilled = int(input())\ndata_killed=[]\nfor _ in range(killed):\n x,y=map(int,input().split())\n data_killed.append((x,y))\n\nfor x,y in data_killed:\n if x<num: \n arr[x] += (arr[x-1]-y)\n if (x-2)>=0: \n arr[x-2]+= (y-1)\n arr[x-1] = 0\n\nfor x in arr:\n print(x)", "n = int(input())\r\nbirds = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nwhile m:\r\n x, y = map(int, input().split())\r\n x -= 1\r\n \r\n left = len(range(1, y))\r\n right = len(range(y+1, birds[x]+1))\r\n birds[x] = 0\r\n \r\n if x-1 >= 0:\r\n birds[x-1] += left\r\n if x+1 < n:\r\n birds[x+1] += right\r\n\r\n m -= 1\r\n\r\nfor bird in birds:\r\n print(bird)", "n=int(input())\r\nstr=input()\r\nbrids=str.split( \" \")\r\nfor i in range(0,len(brids)):\r\n brids[i]=int(brids[i])\r\nm=int(input())\r\nfor i in range(0,m):\r\n x,y=map(int,input().split(\" \"))\r\n x-=1\r\n if (x!=0):\r\n brids[x-1]+=y-1\r\n if (x!=n-1):\r\n brids[x+1]+=brids[x]-y\r\n brids[x]=0\r\n\r\nfor i in brids:\r\n print(i)", "z=input;\r\nn=int(z())\r\nl=list(map(int,z().split()))\r\nfor i in range(int(z())):\r\n a,b=map(int,z().split())\r\n if a!=n:l[a]=l[a]+abs(l[a-1]-(b))\r\n if a!=1:l[a-2]=l[a-2]+b-1\r\n l[a-1]=0\r\nprint(*l)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nfor _ in range(m):\r\n s = input().split()\r\n xi, yi = int(s[0])-1, int(s[1])-1\r\n if xi-1 >= 0: a[xi-1] += yi\r\n if xi+1 < n: a[xi+1] += (a[xi]-yi-1)\r\n a[xi] = 0\r\nfor ai in a:\r\n print(ai)\r\n", "n,data=int(input()),list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n x,y=map(int,input().split())\r\n if x==n: data[x - 2] = data[x - 2] + y - 1\r\n elif x==1: data[x] = data[x] + data[x - 1] - y\r\n else:\r\n data[x - 2] = data[x - 2] + y - 1\r\n data[x] = data[x] + data[x - 1] - y\r\n data[x - 1] = 0\r\nfor i in data : print(i)\r\n", "def main():\r\n number_of_wires = int(input())\r\n birds = list(map(int, input().split()))\r\n birds_in_each_wire = {i:birds[i-1] for i in range(1, number_of_wires + 1)}\r\n shots = [tuple(map(int, input().split())) for i in range(int(input()))]\r\n\r\n def oskols(birds_in_each_wire, shots):\r\n for shot in shots:\r\n wire, died_bird = shot\r\n nbirds = birds_in_each_wire[wire]\r\n birds_in_each_wire[wire] = 0\r\n if wire + 1 in birds_in_each_wire:\r\n birds_in_each_wire[wire + 1] += nbirds - died_bird\r\n if wire - 1 in birds_in_each_wire:\r\n birds_in_each_wire[wire - 1] += nbirds - (nbirds - died_bird + 1)\r\n\r\n return birds_in_each_wire\r\n the_left_oskols = oskols(birds_in_each_wire, shots)\r\n for bird in the_left_oskols.values():\r\n print(bird)\r\n\r\nif __name__ == '__main__':\r\n main()", "import collections\r\nimport heapq\r\nfrom re import X\r\nimport sys\r\nimport math\r\nimport itertools\r\nimport bisect\r\nfrom io import BytesIO, IOBase\r\nimport os\r\n######################################################################################\r\n#--------------------------------------funs here-------------------------------------#\r\n######################################################################################\r\ndef values(): return tuple(map(int, sys.stdin.readline().split()))\r\ndef inlsts(): return [int(i) for i in sys.stdin.readline().split()]\r\ndef inp(): return int(sys.stdin.readline())\r\ndef instr(): return sys.stdin.readline().strip()\r\ndef words(): return [i for i in sys.stdin.readline().strip().split()]\r\ndef chars(): return [i for i in sys.stdin.readline().strip()]\r\n######################################################################################\r\n#--------------------------------------code here-------------------------------------#\r\n######################################################################################\r\ndef solve():\r\n n = inp()\r\n l=inlsts()\r\n m=inp()\r\n for i in range(m):\r\n x,y=values()\r\n x-=1\r\n if x-1>=0: l[x-1]+=y-1\r\n if x+1<n: l[x+1]+=l[x]-y\r\n l[x]=0\r\n for i in l: print (i)\r\n \r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(inp()):\r\n solve()\r\n", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nn = int(input())\r\nbirds = [int(x) for x in input().split()]\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n lst = [int(x) for x in input().split()]\r\n x = lst[0]\r\n y = lst[1]\r\n x -= 1\r\n\r\n if x != 0:\r\n birds[x-1] += y-1\r\n\r\n if x != len(birds)-1:\r\n birds[x+1] += birds[x]-y\r\n birds[x] = 0\r\n\r\nfor item in birds:\r\n print(item)\r\n \r\n", "n = int(input())\nv = [int(i) for i in input().split()]\n\nq = int(input())\nfor qq in range(q):\n w, x = map(int, input().split())\n w -= 1\n\n if w != 0:\n v[w-1] += x-1\n if w != n-1:\n v[w+1] += v[w]-x\n v[w] = 0\n\nfor i in range(n):\n print(v[i])\n", "wrs = int(input())\nbds = list(map(int, input().split(\" \")))\ndct = {}\nfor i in range(wrs):\n dct[i+1] = bds[i]\nsts = int(input())\nfor i in range(sts):\n st = list(map(int, input().split(\" \")))\n wr = st[0]\n bd = st[1]\n if max(dct.keys()) == 1:\n dct[wr] = 0\n elif wr == 1:\n dct[wr + 1] = dct[wr + 1] + (dct[wr] - bd)\n dct[wr] = 0\n elif wr == max(dct.keys()):\n dct[wr - 1] = dct[wr - 1] + (bd - 1)\n dct[wr] = 0\n else:\n dct[wr + 1] = dct[wr + 1] + (dct[wr] - bd)\n dct[wr - 1] = dct[wr - 1] + (bd-1)\n dct[wr] = 0\nfor each in dct.values():\n print(each)", "i=lambda:[*map(int,input().split())]\r\nn=i()[0];a=[0]+i()+[0]\r\nfor _ in[0]*i()[0]:x,y=i();a[x-1]+=y-1;a[x+1]+=a[x]-y;a[x]=0\r\nprint(*a[1:n+1],sep='\\n')", "n = int(input())\r\nwires = list(map(int, input().split()))\r\nshots = int(input())\r\n\r\nfor i in range(shots):\r\n inp = list(map(int,input().split()))\r\n x = inp[0] -1\r\n if x != 0:\r\n wires[x - 1] += inp[1] - 1\r\n if x != (len(wires)-1):\r\n wires[x+1] += wires[x] - inp[1]\r\n wires[x] = 0\r\n\r\nfor wire in wires:\r\n print(wire)", "def shot_one( initial_bird, shot_position ):\r\n x = shot_position[0]\r\n y = shot_position[1]\r\n bird_at_x = (initial_bird[x-1])\r\n initial_bird[x-1] = 0\r\n\r\n if x-1 != 0:\r\n initial_bird[x-2] += (y-1)\r\n if x != len(initial_bird):\r\n initial_bird[x] += bird_at_x - y\r\n\r\n return initial_bird\r\n\r\n\r\ndef shot_all( initial_bird, shot_coordinate ):\r\n for shot_position in shot_coordinate:\r\n intial_bird = shot_one( initial_bird, shot_position )\r\n return initial_bird\r\n\r\n\r\n# PROGRAM UTAMA\r\n\r\nn = int(input())\r\ninitial_bird = input()\r\ninitial_bird = initial_bird.split(' ')\r\nbird_wire = []\r\nfor bird in initial_bird:\r\n bird_wire.append(int(bird))\r\n\r\n\r\nm = int(input())\r\nshot_coordinate = []\r\nfor i in range(m):\r\n masukan = input()\r\n masukan = masukan.split(' ')\r\n shot_coordinate.append(( int(masukan[0]), int(masukan[1]) ))\r\n\r\n\r\nbird_wire = shot_all(bird_wire,shot_coordinate)\r\n\r\nfor bird in bird_wire:\r\n print(bird)\r\n\r\n", "# LUOGU_RID: 101474003\n(n,), a, _, *t = [[*(map(int, s.split()))] for s in open(0)]\r\nfor x, y in t:\r\n if x >= 2:\r\n a[x - 2] += y - 1\r\n if x < n:\r\n a[x] += a[x - 1] - y\r\n a[x - 1] = 0\r\nprint(*a, sep='\\n')\r\n", "input()\r\nwires_num=input().split(' ')\r\nwires=[]\r\nwires.append(0)\r\nfor wire in wires_num:\r\n wires.append(int(wire))\r\nwires.append(0)\r\nfor i in range(0,int(input())):\r\n op=input().split(\" \")\r\n w_n=int(op[0])\r\n o_n=int(op[1])\r\n c=wires[w_n]\r\n \r\n wires.pop(w_n)\r\n wires.insert(w_n,0)\r\n \r\n a=wires[w_n-1]\r\n wires.pop(w_n-1)\r\n wires.insert(w_n-1,a+o_n-1)\r\n\r\n b=wires[w_n+1]\r\n wires.pop(w_n+1)\r\n wires.insert(w_n+1,b+c-o_n)\r\nwires.pop(0)\r\nwires.pop(-1)\r\nfor wire in wires:\r\n print(wire)\r\n \r\n", "def birds(a, shots):\r\n for shot in shots:\r\n if shot[0] - 1 > 0:\r\n a[shot[0] - 2] += shot[1] - 1\r\n if shot[0] < len(a):\r\n a[shot[0]] += a[shot[0] - 1] - shot[1]\r\n a[shot[0] - 1] = 0\r\n return a\r\n \r\n \r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nshots = []\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n shots.append((x, y))\r\nresult = birds(a, shots)\r\nfor num in result:\r\n print(num)", "w=int(input())\r\n\r\nenv=list(map(int,input().split()))\r\n\r\n \r\nshot=int(input())\r\nfor i in range(shot):\r\n w,dead=map(int,input().split())\r\n w-=1\r\n l= env[w]-dead\r\n r=dead-1\r\n env[w]=0 \r\n if w != len(env)-1:\r\n env[w+1]+=l\r\n if w!=0:\r\n env[w-1]+=r\r\n\r\nfor i in env:\r\n print(i)\r\n", "n = int(input())\na = [int(v) for v in input().split()]\nm = int(input())\nfor _ in range(m):\n x, y = [int(v) for v in input().split()]\n ai = a[x - 1]\n a[x - 1] = 0\n if x != 1:\n a[x - 2] += y - 1\n if x != n:\n a[x] += ai - y\nfor ai in a:\n print(ai)\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n if x != 1:\r\n a[x-2] += y - 1\r\n if x != n:\r\n a[x] += a[x-1] - y \r\n a[x-1] = 0\r\nfor i in a:\r\n print(i)", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int,input().split())\r\n up = y - 1\r\n down = a[x-1] - y\r\n a[x-1] = 0\r\n if x != 1:\r\n a[x-2] += up\r\n if x != n:\r\n a[x] += down\r\n\r\nprint(*a, sep='\\n')\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n \r\n\r\n \r\n if x > 1:\r\n l[x-2] += y-1\r\n if x < n:\r\n l[x] += l[x-1] - y\r\n l[x-1] = 0\r\n\r\nfor i in l:\r\n print(i)\r\n\r\n", "n = int(input())\r\nwires = list(map(int, input().split()))\r\nfor _ in range(int(input())):\r\n\tx, y = map(int, input().split())\r\n\tleft = y - 1\r\n\tright = wires[x - 1] - y\r\n\twires[x - 1] = 0\r\n\tif x - 2 >= 0:\r\n\t\twires[x - 2] += left\r\n\tif len(wires) > x:\r\n\t\twires[x] += right\r\n\r\nfor i in wires:\r\n\tprint(i)\r\n", "n = int(input())\r\nq = list(map(int, input().split()))\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n x, y = [int(x) for x in input().split()]\r\n x-=1\r\n if x!= 0:\r\n q[x-1]+= y-1\r\n if x != n-1:\r\n q[x+1] += q[x]-y\r\n q[x]=0\r\nfor i in range(n):\r\n print(q[i])\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nfor _ in range(int(input())):\r\n x,y = map(int,input().split())\r\n if n == 1:\r\n arr[0] = 0\r\n elif x > 1 and x < n:\r\n arr[x-2] += y-1\r\n arr[x] += arr[x-1]-y\r\n arr[x-1] = 0\r\n elif x == 1:\r\n arr[x] += arr[x-1] - y\r\n arr[x-1] = 0\r\n else:\r\n arr[x-2] += y-1\r\n arr[x-1] = 0\r\nfor i in arr:\r\n print(i)", "n=int(input())\r\nith=[int(z) for z in input().split()]\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=[int(z) for z in input().split()]\r\n if x-2>=0:\r\n ith[x-2]+=y-1\r\n if x!=n:\r\n ith[x]+=ith[x-1]-y\r\n ith[x-1]=0\r\nfor i in ith:\r\n print(i)", "n = int(input())\r\nu = list(map(int , input().split()))\r\n\r\nw = int(input())\r\n\r\nfor i in range(w):\r\n m = list(map(int,input().split()))\r\n m[0] -= 1\r\n\r\n\r\n if m[0] != 0:\r\n u[m[0]-1] += m[1]-1\r\n\r\n if m[0] != n-1:\r\n u[m[0]+1] += u[m[0]] - m[1]\r\n\r\n u[m[0]] = 0\r\nfor j in u:\r\n print(j)\r\n\r\n\r\n\r\n", "noofboxes = int (input())\r\nleneachbox = list(map(int,input().split()))\r\nnoofmoves = int(input())\r\n\r\nfor i in range(noofmoves):\r\n x , y = map(int,input().split())\r\n x-=1\r\n if x != 0:\r\n leneachbox[x - 1] += y - 1\r\n\r\n if x != noofboxes - 1:\r\n leneachbox[x + 1] += leneachbox[x] - y\r\n\r\n leneachbox[x] = 0\r\n\r\nfor i in leneachbox:\r\n print(i)\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\nm = int(input())\r\nx = []\r\ny = []\r\n\r\nfor _ in range(m):\r\n\ttmp1, tmp2 = map(int, input().split())\r\n\tx.append(tmp1)\r\n\ty.append(tmp2)\r\n\r\nfor i in range(m):\r\n\tleft = y[i] - 1\r\n\tright = a[x[i] - 1] - y[i] \r\n\t# (x[i] - 1) index of the line we are at. For example if x = 2, then we need to be on the second line, which is at index 1. (2 - 1 = 1).\r\n\t\r\n\ta[x[i] - 1] = 0\r\n\r\n\tif x[i] - 2 >= 0:\r\n\t\ta[x[i] - 2] += left\r\n\r\n\tif x[i] <= n - 1:\r\n\t\ta[x[i]] += right\r\n\r\nfor i in a:\r\n\tprint(i)\r\n\r\n", "n = int(input()) \r\na = [ int(i) for i in input().split() ]\r\nm = int(input())\r\n\r\nfor _ in range(m) : \r\n xy = [ int(i) for i in input().split() ]\r\n x = xy[0]\r\n y = xy[1]\r\n birdnum = x-1\r\n left = y - 1 \r\n right = a[birdnum] - y \r\n a[birdnum]= a[birdnum] - left - right - 1\r\n if birdnum-1 >= 0 :\r\n a[birdnum-1] = a[birdnum-1] + left\r\n if birdnum + 1 < n : \r\n a[birdnum+1] = a[birdnum+1] + right \r\n \r\n\r\nfor i in a :\r\n print(i)\r\n ", "n=int(input())\r\nx=input().split()\r\nm=int(input())\r\nj=0\r\nh=0\r\nl=[]\r\nfor t in x:\r\n q=int(t)\r\n l.append(q)\r\nfor i in range(m):\r\n z=input().split()\r\n c=l[int(z[0])-1]\r\n b=int(z[0])-1\r\n \r\n \r\n for i in range(c+1):\r\n if i<int(z[1]):\r\n j+=1\r\n \r\n \r\n elif i>=int(z[1]):\r\n h+=1\r\n if b+1>=n:\r\n l[b-1]+=j-1\r\n l[b]+=h-1\r\n else:\r\n \r\n l[b-1]+=j-1\r\n l[b+1]+=h-1\r\n if b-1==-1:\r\n l[-1]-=j-1\r\n #elif z[0]==\r\n \r\n j=0\r\n h=0\r\n l[b]=0\r\n \r\nfor i in l:\r\n print(i)\r\n \r\n \r\n ", "n = int(input())\r\nai = [int(x) for x in input().split()]\r\nm = int(input())\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n right = ai[x - 1] - y\r\n left = y - 1\r\n if x - 2 >= 0:\r\n ai[x - 2] += left\r\n if x <= n - 1:\r\n ai[x] += right\r\n ai[x - 1] = 0\r\n\r\nfor a in ai:\r\n print(a)", "# 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\nm=int(input())\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tif x<n:\r\n\t\ta[x]+=a[x-1]-y\r\n\tif x>1:\r\n\t\ta[x-2]+=y-1\r\n\ta[x-1]=0\r\nfor i in range(n):\r\n\tprint(a[i])\t", "n = int(input())\r\nwires = list(map(int, input().split()))\r\nshots = int(input())\r\n\r\nfor i in range(shots):\r\n x,y = map(int, input().split())\r\n birds = wires[x-1]\r\n if birds == 0:\r\n continue\r\n left = y - 1\r\n right = birds - y\r\n if x !=1:\r\n wires[x-2]+= left\r\n if x!= len(wires):\r\n wires[x]+= right\r\n wires[x-1] = 0\r\n\r\n \r\nfor i in wires:\r\n print(i)\r\n ", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\nwirec = inp()\r\nwires = inlt()\r\nshotc = inp()\r\n\r\nfor i in range(shotc):\r\n lt = inlt()\r\n wirei = lt[0] - 1\r\n birdi = lt[1]\r\n if wirei != 0:\r\n wires[wirei - 1] += birdi - 1\r\n if wirei != wirec - 1:\r\n wires[wirei + 1] += wires[wirei] - birdi\r\n wires[wirei] = 0\r\n\r\n[print(count) for count in wires]\r\n\r\n", "def chance(wires, shots):\r\n for wire, bird in shots:\r\n if wire < len(wires):\r\n wires[wire] += wires[wire-1]-bird\r\n if wire > 1:\r\n wires[wire-2] += bird-1\r\n wires[wire-1] = 0\r\n return wires\r\n\r\nn = int(input())\r\nwires = list(map(int, input().split(' ')))\r\nm = int(input())\r\nshots = []\r\nfor i in range(m):\r\n shots.append(list(map(int, input().split(' '))))\r\nwires = chance(wires, shots)\r\n\r\nfor wire in wires:\r\n print(wire)\r\n", "a = int(input())\r\nbirds = [int(x) for x in input().split()]\r\nsh = int(input())\r\nfor i in range(sh):\r\n y = [int(y) for y in input().split()]\r\n x = y[0]-1\r\n if x != 0:\r\n birds[x-1] += y[1] - 1\r\n if x != a-1:\r\n birds[x+1] += birds[x] - y[1]\r\n birds[x] = 0\r\nfor bird in birds:\r\n print(bird)", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor _ in range(int(input())):\r\n x,y=map(int,input().split())\r\n if x<n and x>0:\r\n a[x]+=a[x-1]-y\r\n if x>1:\r\n a[x-2]+=y-1\r\n if x>0:\r\n a[x-1]=0\r\nfor i in a:\r\n print(i)\r\n", "#!/usr/bin/python3\r\n\r\n\r\ndef main():\r\n\r\n _ = input()\r\n birds = list(map(int, input().split()))\r\n shots = int(input())\r\n\r\n for num in range(shots):\r\n wire, bird = map(int, input().split())\r\n # send birds up\r\n if wire - 2 >= 0:\r\n birds[wire-2] += bird - 1\r\n # send birds down\r\n if wire <= len(birds)-1:\r\n birds[wire] += birds[wire-1] - bird\r\n birds[wire-1] = 0\r\n\r\n for num_birds in birds:\r\n print(num_birds)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\nn = int(input())\n\na = list(map(int,input().split())) # 10 10 10 10 10\nm = int(input())\n\nfor i in range(m):\n x, y = map(int,input().split())\n\n temp = a[x-1]\n\n if x-2 >= 0:\n a[x-2] += y-1\n\n if x <= len(a)-1:\n a[x] += (temp - y)\n\n a[x-1] = 0\n\nfor x in a:\n print(x)\n \t\t\t\t \t \t \t \t\t\t \t \t\t\t \t", "n = int(input())\r\narr = list(map(int,input().split(' ')))\r\nm = int(input())\r\n#all birds that fly away will be at 0 or n+1 row.\r\narr.insert(0,0)\r\narr.append(0)\r\n\r\nfor i in range(m):\r\n x,y = map(int,input().split(' '))\r\n arr[x-1] += y-1\r\n arr[x+1] += arr[x] - y\r\n arr[x]=0\r\n\r\nfor i in arr[1:n+1]:\r\n print(i)\r\n\r\n\r\n\r\n", "n=int(input())\r\nv=[int(x) for x in input().split()]\r\nm=int(input())\r\nwhile m:\r\n x,y=map(int,input().split())\r\n x-=1\r\n if(x>0):\r\n v[x-1]+=y-1\r\n if(x<n-1):\r\n v[x+1]+=v[x]-y\r\n v[x]=0\r\n m-=1\r\nfor i in v:\r\n print(i)", "w=int(input())\r\nb=list(map(int,input().split()))\r\ns=int(input())\r\nfor x in range(s):\r\n i,k=input().split()\r\n i=int(i)-1\r\n k=int(k)\r\n r=b[i]-k\r\n l=k-1\r\n if (i-1)>=0:\r\n b[i-1]+=l\r\n if (i+1)<=(w-1):\r\n b[i+1]+=r\r\n b[i]=b[i]-l-r-1\r\nfor x in b:\r\n print(x)\r\n", "w = int(input())\r\nwires = list(map(int, input().split()))\r\nn = int(input())\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if x - 1 > -1:\r\n wires[x - 1] += y - 1\r\n if x + 1 < w:\r\n wires[x + 1] += wires[x] - y\r\n\r\n wires[x] = 0\r\n # print(wires)\r\nfor j in range(w):\r\n print(wires[j])", "n=int(input())\r\nb=input().split()\r\nfor i in range(n):\r\n\tb[i]=int(b[i])\r\nm=int(input())\r\nfor i in range(m):\r\n\tx,y=input().split()\r\n\tx=int(x)\r\n\ty=int(y)\r\n\tif x-2>=0:\r\n\t\tb[x-2]+=y-1\r\n\tif x<n:\r\n\t\tb[x]+=b[x-1]-y\r\n\tb[x-1]=0\r\nfor i in range(n):\r\n\tprint(b[i])", "n = int(input())\r\ntotal = list(map(int, input().split()))\r\nshots = int(input())\r\nfor i in range(shots):\r\n wire, bird = map(int, input().split())\r\n wire -= 1\r\n if wire == n - 1:\r\n total[wire - 1] += bird - 1\r\n total[wire] = 0\r\n continue\r\n total[wire + 1] += total[wire] - bird\r\n if wire == 0:\r\n total[wire] = 0\r\n continue\r\n total[wire - 1] += bird - 1\r\n total[wire] = 0\r\n\r\nfor j in range(n):\r\n print(total[j])\r\n", "n=int(input())\r\na=list(map(int,input().strip().split(\" \")))\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=input().strip().split(\" \")\r\n x,y=[int(x),int(y)]\r\n if x-2>=0:\r\n a[x-2]+=(y-1)\r\n if x<=(n-1):\r\n a[x]+=(a[x-1]-y)\r\n a[x-1]=0\r\nfor j in a:\r\n print(j)\r\n \r\n", "from sys import stdin\r\n\r\nm=int(stdin.readline())\r\na = list(map(int,stdin.readline().split()))\r\na.insert(0,0)\r\na.append(0)\r\nn = int(stdin.readline())\r\nfor i in range(n):\r\n x , y = map(int,stdin.readline().split())\r\n a[x-1] += y-1\r\n a[x+1] += a[x]-y\r\n a[x]=0\r\n\r\nfor j in range(1,m+1):\r\n print(a[j])\r\n", "n = int(input())\r\nbirds = list(map(int , input().split()))\r\nfor t in range(int(input())) :\r\n wire_index , bird_index = map(int , input().split())\r\n wire_index -=1\r\n \r\n res = birds[wire_index] \r\n birds[wire_index] = 0\r\n \r\n if wire_index != n-1:\r\n birds[wire_index+1] += res-bird_index\r\n if wire_index != 0 :\r\n birds[wire_index-1] += bird_index-1\r\n \r\nprint(*birds , sep = \"\\n\")\r\n \r\n ", "n = int(input())\r\nbirds = list(map(int,input().split()))\r\nshots = int(input())\r\n\r\nfor i in range(shots):\r\n wire,bird = map(int,input().split())\r\n wire -= 1\r\n \r\n if wire-1 >= 0:\r\n birds[wire-1] += bird - 1\r\n if wire+1 < n:\r\n birds[wire+1] += birds[wire] - bird\r\n birds[wire] = 0\r\n\r\nprint(*birds,sep='\\n')", "n=int(input())\nwires=list(input().split(\" \"))\nfor i in range(n):\n wires[i]=int(wires[i])\n \nm=int(input())\n\nfor i in range(m):\n x,y=map(int,input().split(\" \"))\n x=x-1\n\n left=max((x-1),0)\n right=min((x+1),n-1)\n \n wires[right]=wires[right]+(wires[x]-y) \n wires[left]=wires[left]+(max(y-1,0))\n \n wires[x]=0\n \nfor i in wires:\n print(i)", "#%% 294a Shaass and Oskols \r\n\r\ninp = lambda : [*map(int,input().split())]\r\nn = int(input())\r\na = inp()\r\na = [0] + a + [0]\r\nfor x,y in [inp() for _ in range(int(input()))]:\r\n a[x-1] += y - 1\r\n a[x+1] += a[x] - y\r\n a[x] = 0\r\nprint('\\n'.join([*map(str,a[1:n+1])] ) )", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n x=x-1\r\n if len(a)==1:\r\n a[0]=0\r\n continue\r\n if x>0 and x<len(a)-1:\r\n a[x+1]=a[x+1]+a[x]-y\r\n a[x-1]=a[x-1]+y-1\r\n a[x]=0\r\n elif x==0:\r\n a[x+ 1] = a[x + 1] + a[x] - y\r\n a[x]=0\r\n else:\r\n a[x - 1] = a[x - 1] + y - 1\r\n a[x]=0\r\nfor i in a:\r\n print(i)", "n=int(input())\r\nparsa=list(map(int,input().split()))\r\nq=int(input())\r\nfor i in range(q):\r\n a,b=map(int,input().split())\r\n a-=1\r\n r=parsa[a]-b\r\n c=b-1\r\n if a-1>=0:\r\n parsa[a-1]+=c\r\n if a+1<n:\r\n parsa[a+1]+=r\r\n parsa[a]=0\r\nfor i in range(n):\r\n print(parsa[i])\r\n ", "z=input;\r\nn=int(z())\r\nl=list(map(int,z().split()))\r\nm=int(z())\r\nfor i in range(m):\r\n a,b=map(int,z().split())\r\n left=b-1\r\n right=abs(l[a-1]-(b))\r\n if a!=n:\r\n l[a]=l[a]+right\r\n if a!=1:\r\n l[a-2]=l[a-2]+left\r\n l[a-1]=0\r\n \r\nprint(*l)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nnn = int(input())\r\nfor i in range(nn) :\r\n a,b = map(int,input().split())\r\n\r\n a -= 1\r\n\r\n if a != 0 :\r\n l[a-1] += b-1\r\n if a != len(l) - 1 :\r\n l[a+1] += l[a] - b\r\n\r\n l[a] = 0\r\n\r\nfor i in l :\r\n print(i)", "n = int(input())\r\nl = [0]\r\nl = l+list(map(int, input().split()))\r\nl = l+[0]\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n if x==1:\r\n l[x+1] = l[x+1]+(l[x]-y)\r\n l[x] = 0\r\n elif x==n:\r\n l[x-1] = l[x-1]+(y-1)\r\n l[x] = 0\r\n else:\r\n a = l[x]-1-(y-1)-(l[x]-y)\r\n b = l[x-1]+(y-1)\r\n c = l[x+1]+(l[x]-y)\r\n l[x] = a\r\n l[x+1] = c\r\n l[x-1] = b\r\n\r\nfor i in range(1,n+1):\r\n print(l[i])", "n = int(input())\r\na = []\r\na = list(map(int, input().split()))\r\na.append(0)\r\na.insert(0,0)\r\nt = int(input())\r\nfor i in range(0,t):\r\n x,y = map(int, input().split())\r\n y -= 1\r\n l = y\r\n r = a[x]-y-1\r\n a[x-1] += l\r\n a[x+1] += r\r\n a[x] = 0\r\n\r\nfor i in range(1,n+1):\r\n print(a[i])", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nm = int(input())\r\na = list()\r\nfor i in range(m):\r\n a1 = [int(j) for j in input().split()]\r\n if a1[0] < n:\r\n lst[a1[0]] = lst[a1[0]] + lst[a1[0] - 1] - a1[1]\r\n if a1[0] > 1:\r\n lst[a1[0] - 2] = lst[a1[0] - 2] + a1[1] - 1\r\n lst[a1[0] - 1] = 0\r\nfor elem in lst:\r\n print(elem)\r\n", "n = int(input())\r\n\r\nar = [int(x) for x in input().split()]\r\nar.insert(0,0)\r\nar.append(0)\r\n# print(ar)\r\nm = int(input())\r\nfor i in range(0,m):\r\n x,y = map(int, input().split())\r\n # print(x,y,ar[x-1],ar[x],ar[x+1])\r\n ar[x-1]+=y-1\r\n ar[x + 1] += ar[x]-y\r\n ar[x]=0\r\nfor i in ar[1:n+1]:\r\n print(i)", "a=int(input())\r\np=list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n x,y=map(int,input().split())\r\n if x>1:p[x-2]+=y-1\r\n if x<a:p[x]+=p[x-1]-y\r\n p[x-1]=0\r\nprint(*p,sep=\"\\n\")\r\n\r\n\r\n# My code says who am i\r\n# I want to burn and born at this way\r\n# In my eye there is not any things Except love ...", "\"\"\"Shaass and Oskols\"\"\"\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n y -= 1\r\n if x - 1 >= 0:\r\n arr[x - 1] += y\r\n if x + 1 < len(arr):\r\n arr[x + 1] += arr[x] - y - 1\r\n arr[x] = 0\r\nfor k in arr:\r\n print(k)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 4 01:19:07 2021\r\n\r\n@author: Kevin Chang\r\n\r\nProject: Codeforces Problem 294A\r\n\r\n\"\"\"\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\n\r\ndef shoot(a):\r\n x, y = map(int, input().split())\r\n if x > 1:\r\n a[x-2] += y-1\r\n if x < len(a):\r\n a[x] += a[x-1]-y\r\n a[x-1] = 0\r\n return a \r\n\r\nfor _ in range(m):\r\n a = shoot(a)\r\n\r\nprint(\"\\n\".join(list(map(str, a))))", "n = int(input())\r\nwires = list(map(int,input().split()))\r\nb = int(input())\r\nfor i in range(b):\r\n bird = list(map(int,input().split()))\r\n \r\n if bird[0] < n:\r\n wires[bird[0]] += (wires[bird[0]-1] - bird[1])\r\n if bird[0] > 0 and bird[0]-2 >= 0:\r\n wires[bird[0]-2] += bird[1] - 1\r\n wires[bird[0]-1] = 0\r\n\r\nfor i in wires:\r\n print(i)", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(int(input())):\r\n index, pos = list(map(int, input().split()))\r\n index = index-1\r\n if index-1 >= 0:\r\n a[index-1] += (pos-1)\r\n if index+1 < n: \r\n a[index+1] += (a[index]-pos)\r\n a[index] = 0 \r\n\r\n\r\nprint(*a,sep=\"\\n\") \r\n \r\n \r\n", "n = int(input())\r\na = list(map(int , input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x , y = map(int , input().split())\r\n x -= 1\r\n if(x - 1 >= 0):\r\n a[x - 1] += y - 1\r\n if(x + 1 < len(a)):\r\n a[x + 1] += a[x] - y\r\n a[x] = 0\r\nprint(*a , sep = '\\n')", "def INT():\r\n return int(input())\r\n\r\ndef lis():\r\n return [int(x) for x in input().split()]\r\n \r\nn=INT()\r\na = lis()\r\nm = INT()\r\nfor i in range(m):\r\n x,y=lis()\r\n if x==1:\r\n if n!=1:\r\n a[x]+=a[x-1]-y\r\n a[x-1]=0\r\n elif x==n:\r\n if n!=1:\r\n a[x-2]+=(y-1)\r\n a[x-1]=0\r\n else:\r\n a[x-2]+=(y-1)\r\n a[x]+=a[x-1]-y\r\n a[x-1]=0\r\n #print(*a)\r\nfor i in range(n):\r\n print(a[i])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nfor i in range(m):\r\n wire , bird = [int(j) for j in input().split()]\r\n if wire < n:\r\n a[wire] += a[wire - 1] - bird\r\n\r\n if wire - 2 >= 0:\r\n a[wire - 2] += bird - 1\r\n\r\n a[wire - 1] = 0\r\n\r\nfor j in range(n):\r\n print(a[j]) ", "x=int(input())\r\na= list(map(int, input().split()))\r\nq= int(input())\r\ns=[]\r\nh=[]\r\nm= 0\r\nt= 0\r\n\r\nfor p in range(q):\r\n k = list(map(int, input().split()))\r\n s.append(k)\r\n\r\nif x==1 :\r\n if q==1 :\r\n print(\"0\")\r\n else:\r\n print(a[0])\r\n\r\nelse:\r\n\r\n for t in range(q):\r\n r = s[t][0]\r\n d = s[t][1]\r\n h.append(r)\r\n s[t] = d\r\n for i in h:\r\n i = i - 1\r\n if i == 0:\r\n a[i + 1] = a[i + 1] + (a[i] - s[m])\r\n a[i] = 0\r\n m += 1\r\n elif i == (x - 1):\r\n a[i - 1] = a[i - 1] + (a[i] - (a[i] - s[m])) - 1\r\n a[i] = 0\r\n m += 1\r\n else:\r\n a[i + 1] = a[i + 1] + (a[i] - s[m])\r\n a[i - 1] = a[i - 1] + (a[i] - (a[i] - s[m])) - 1\r\n a[i] = 0\r\n m += 1\r\n\r\n for j in (a):\r\n print(j)\r\n", "x = int(input())\r\narr = [*map(int, input().split())]\r\nq = int(input())\r\nfor _ in range(q):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n if a > 0:\r\n arr[a-1] += b-1\r\n if a < x-1:\r\n arr[a+1] += arr[a]-b\r\n arr[a] = 0\r\nfor line in arr:\r\n print(line)\r\n", "n=int(input())\r\nliste=list(map(int, input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n temp=list(map(int, input().split()))\r\n if(temp[0]<n):\r\n liste[temp[0]]+=liste[temp[0]-1]-temp[1]\r\n\r\n if(temp[0]>1):\r\n \r\n liste[temp[0]-2]+=temp[1]-1\r\n liste[temp[0]-1]=0\r\nfor elm in liste:\r\n print(elm)\r\n", "n,branches = int(input()),list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(m) :\r\n x,y = (map(int,input().split()))\r\n if x-2 >= 0:\r\n branches[x-2] += y-1\r\n\r\n if x < n:\r\n branches[x] += branches[x-1] - y\r\n branches[x-1] =0\r\n\r\nfor i in branches :\r\n print(i)\r\n\r\n", "n = int(input())\r\nbirds_on_wire = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n\r\n if x > 0:\r\n birds_on_wire[x-1] += y-1\r\n if x < n-1:\r\n birds_on_wire[x+1] += birds_on_wire[x] - y\r\n\r\n birds_on_wire[x] = 0\r\n\r\nfor birds in birds_on_wire:\r\n print(birds)\r\n", "input()\r\nbirds = list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n ip = input().split()\r\n x = int(ip[0])-1\r\n y = int(ip[1])-1\r\n down = birds[x] - y -1\r\n up = (y-1)+1\r\n birds[x]-=1+down+up\r\n if x-1>=0:\r\n birds[x-1]+=up\r\n if x+1<len(birds):\r\n birds[x+1]+=down\r\nfor i in birds:\r\n print(i)", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nshots = int(input())\r\n\r\nfor shot in range(shots):\r\n\twire, y = map(int, input().split())\r\n\r\n\tcurrent_birds = arr[wire - 1]\r\n\tif wire - 2 >= 0:\r\n\t\tarr[wire-2] += y - 1 \r\n\tif wire < len(arr):\r\n\t\tarr[wire] += (current_birds - y)\r\n\tarr[wire -1] = 0\r\n\r\n\r\nfor i in arr:\r\n\tprint(i)", "n = int(input())\r\nstart = [x for x in map(int,input().split())]\r\nm = int(input())\r\nplayground = [0 for x in range(n+2)]\r\nfor i in range(n):\r\n playground[i+1] += start[i]\r\nfor i in range(m):\r\n wire, bird = map(int, input().split())\r\n playground[wire-1] += bird - 1\r\n playground[wire+1] += playground[wire] - bird #- 1\r\n playground[wire] = 0\r\nfor item in playground[1:-1]:\r\n print(item)", "numOfBox = int(input())\r\nnumOfBirds = input()\r\nnumOfBirds = numOfBirds.split(\" \")\r\nnumOfShot=int(input())\r\nfor i in range(numOfShot):\r\n z=input()\r\n z=z.split(\" \")\r\n x = int(z[0])-1\r\n y = int(z[1])\r\n maxB=int(numOfBirds[x])\r\n if x==0 and x==numOfBox-1:\r\n numOfBirds[x]=\"0\"\r\n break\r\n elif x==0:\r\n right=maxB-y\r\n r = int(numOfBirds[x+1])+right\r\n numOfBirds[x+1]=str(r)\r\n elif x==numOfBox-1:\r\n left=y-1 \r\n r = int(numOfBirds[x-1])+left\r\n numOfBirds[x-1]=str(r)\r\n else:\r\n right=maxB-y\r\n r = int(numOfBirds[x+1])+right\r\n numOfBirds[x+1]=str(r)\r\n left=y-1 \r\n r = int(numOfBirds[x-1])+left\r\n numOfBirds[x-1]=str(r)\r\n \r\n numOfBirds[x]=\"0\"\r\n\r\nprint(\" \".join(numOfBirds)) \r\n \r\n \r\n ", "x = int(input())\r\na = list(map(int,input().split()))\r\nr = int(input())\r\nz = []\r\nfor i in range(r):\r\n\ta1 = list(map(int,input().split())) \r\n\tif a1[0] <x:\r\n\t\ta[a1[0]] = a[a1[0]]+a[a1[0]-1] - a1[1]\r\n\tif a1[0] > 1:\r\n\t\ta[a1[0]-2] = a[a1[0]-2]+a1[1]-1\r\n\ta[a1[0]-1] = 0\r\nfor i in range(x):\r\n\t\tprint(a[i])", "n, g, m = int(input()), list(map(int, input().split())), int(input())\r\nfor i in range(m):\r\n x, y = map(lambda x: int(x) - 1, input().split())\r\n if x != 0: g[x-1] += y\r\n if x != n-1: g[x+1] += g[x] - y - 1\r\n g[x] = 0\r\nfor c in g: print(c)", "n=int(input())\r\na=[0]+list(map(int, input().split()))+[0]\r\nfor i in range(int(input())):\r\n x,y=map(int, input().split())\r\n a[x+1]+=a[x]-y\r\n a[x-1]+=y-1\r\n a[x]=0\r\nfor i in range(n):\r\n print(a[i+1])", "n=int(input())\r\nx = [int(i) for i in input().split()]\r\nm = int(input())\r\nfor i in range(m):\r\n\ty = [int(j) for j in input().split()]\r\n\tbirdsleft = y[1] - 1\r\n\tbirdsright = x[y[0]-1] - birdsleft - 1\r\n\t# print(\"b: \",birdsleft,birdsright)\r\n\tif(y[0] - 1 > 0 ):\r\n\t\tx[y[0]-2] += birdsleft\r\n\tif(y[0] + 1 <= n):\r\n\t\tx[y[0]] += birdsright\r\n\tx[y[0]-1]=0\r\nfor i in range(n):\r\n\tprint(x[i])", "n = int(input())\r\na = list(map(int,input().split()))\r\na.insert(0,0)\r\na.append(0)\r\nm = int(input())\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n a[x+1] += a[x] - y\r\n a[x] = 0\r\n a[x-1] += (y - 1)\r\n \r\na.pop()\r\na.pop(0)\r\nprint (*a)", "n = int(input())\na = [0]\na.extend(map(int, input().split()))\na.append(0)\n\nm = int(input())\nfor _ in range(m):\n x, y = map(int, input().split())\n a[x - 1] += y - 1\n a[x + 1] += a[x] - y\n a[x] = 0\n\nprint(*a[1:-1], sep='\\n')\n", "n= int(input())\r\nb= [int(x) for x in input().split()]\r\nm= int(input())\r\n\r\nd={}\r\nfor i in range(1, n+1):\r\n d[i]=b[i-1]\r\n\r\nfor i in range(1, m+1):\r\n x,y = input().split()\r\n x,y= int(x), int(y)\r\n left= y-1\r\n right= d[x]-y\r\n d[x]=0\r\n if x-1 in d:\r\n d[x-1]+=left\r\n if x+1 in d:\r\n d[x+1]+=right\r\n\r\nfor key in d:\r\n print(d[key])\r\n", "num= input()\r\nn=int(num)\r\nls = list(map(int, input().split()))\r\nk=int(input())\r\nfor z in range(0, k):\r\n a, y = map(int, input().split())\r\n a -= 1\r\n if a < n - 1:\r\n ls[a + 1] += ls[a] - y\r\n if a > 0:\r\n ls[a - 1] += y - 1\r\n ls[a] = 0\r\nprint(*ls, sep='\\n')\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nwhile(m>0):\r\n\tb,c=list(map(int,input().split()))\r\n\tq=c-1\r\n\tif(b!=1):\r\n\t\ta[b-2]=a[b-2]+q\r\n\tif(b!=n):\r\n\t\ta[b]=a[b]+a[b-1]-c\r\n\ta[b-1]=0\r\n\tm-=1\r\nfor i in range(n):\r\n\tprint(a[i])", "n = int(input())\r\nl = list(map(int, input().split()))\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n\r\n if a < n:\r\n l[a] += l[a-1] - b\r\n if a - 2 >= 0:\r\n l[a-2] += b-1\r\n l[a - 1] = 0\r\nfor i in l:\r\n print(i)", "import sys\r\n \r\nn=input()\r\nq=list(int(n) for n in input().split())\r\nm=input()\r\nfor i in range(0,int(m)):\r\n a,b=input().split()\r\n o=int(a)\r\n k=int(b)\r\n if int(o)!=1:\r\n q[o-2]=q[o-2]+(k-1)\r\n if int(o)!=int(n):\r\n q[o]=q[o]+(q[o-1]-k)\r\n q[o-1]=0\r\nfor j in range(0,int(n)):\r\n print(q[j])", "def solve(n, a, m, pairs):\n for x, y in pairs:\n x -= 1\n if x > 0:\n a[x - 1] += (y - 1)\n if x < n - 1:\n a[x + 1] += a[x] - y\n a[x] = 0\n for i in a: print(i)\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n m = int(input())\n pairs = [map(int, input().split()) for _ in range(m)]\n solve(n, a, m, pairs)\n\n\nmain()\n", "#x = 3\r\n#y = 13\r\n#m = 5\r\n#n = no. of wires \r\n#s = no. of birds on each wire 22 10 10 10 10\r\nn = int(input())\r\ns = list(map(int,input().split()))\r\nm = input()\r\n\r\n\r\nfor i in range(int(m)):\r\n x,y = map(int,input().split())\r\n x-= 1\r\n\r\n if x > 0:\r\n s[x - 1] += y -1 \r\n if x < n-1:\r\n s[x+1] += s[x] - y\r\n s[x] = 0 \r\nfor f in s:\r\n print(f)", "n = int(input())\nalist = input().strip().split(' ')\nalist = [int(a) for a in alist]\nm = int(input())\n\nfor i in range(m):\n xy = input().strip().split()\n x = int(xy[0])-1\n y = int(xy[1])\n if x!=0:\n alist[x-1] += y-1\n if x!=n-1:\n alist[x+1] += alist[x]-y\n alist[x] = 0\n\nfor i in range(n):\n print(alist[i])\n ", "n = int(input())\nwires = [int(x) for x in input().split()]\nm = int(input())\nfor i in range(m):\n x, y = map(int, input().split())\n x = x - 1\n left = y - 1\n right = wires[x] - y\n up = x - 1\n down = x + 1\n wires[x] = 0\n if up >= 0:\n upperWire = wires[up]\n wires[up] = upperWire + left\n if down < n:\n downerWire = wires[down]\n wires[down] = downerWire + right\nfor w in wires:\n print(w)", "n=int(input())\r\nl=[0]+list(map(int,input().split()))+[0]\r\nm=int(input())\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n l[a+1]+=l[a]-b\r\n l[a]=0\r\n l[a-1]+=b-1\r\n \r\nfor i in range(n):\r\n print(l[i+1])", "n = int(input())\r\nwires = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1 # adjusting index to 0-based\r\n if x > 0:\r\n wires[x-1] += y-1\r\n if x < n-1:\r\n wires[x+1] += wires[x] - y\r\n wires[x] = 0\r\n\r\nfor wire in wires:\r\n print(wire)\r\n", "n=int(input())\r\nbird= [int(_) for _ in input().split()] \r\ns= int(input())\r\nfor i in range(s):\r\n y,x= [int(_) for _ in input().split()]\r\n #print (y,x)\r\n y-=1\r\n cbrd=bird[y]\r\n if y-1!=-1:\r\n bird[y-1]+=x-1\r\n if y+1!=n:\r\n bird[y+1]+=bird[y]-x\r\n bird[y]=0\r\nfor j in range(n):\r\n print(bird[j])", "n = int(input())\na = [int(i) for i in input().split()]\nt = int(input())\nfor _ in range(t):\n x, y = [int(i) for i in input().split()]\n cur = x-1\n prev = x-2\n nxt = x\n if prev>=0:\n a[prev] += y-1\n if nxt<len(a):\n a[nxt] += a[cur]-y\n a[cur] = 0\nfor e in a:\n print(e)\n ", "n = int(input())\r\n\r\nbirds = list(map(int,input().split()))\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n index, bird_no = map(int,input().split())\r\n index-=1\r\n \r\n right = birds[index] - bird_no\r\n left = bird_no - 1\r\n birds[index] = 0\r\n if(index -1 >=0):\r\n birds[index -1] += left\r\n if(index +1 < len(birds)):\r\n birds[index +1] += right\r\n\r\nfor bird in birds:\r\n print(bird)\r\n\r\n", "n = int(input())\r\narr = [None] + list(map(int, input().split()))\r\nt = int(input())\r\nfor i in range(t):\r\n temp = list(map(int, input().split()))\r\n try:\r\n arr[temp[0] + 1] += arr[temp[0]] - temp[1]\r\n except:\r\n pass\r\n finally:\r\n arr[temp[0]] -= arr[temp[0]] - temp[1]\r\n try:\r\n arr[temp[0] - 1] += arr[temp[0]] - 1\r\n except:\r\n pass\r\n finally:\r\n arr[temp[0]] = 0\r\n\r\nfor i in range(1, len(arr)):\r\n print(arr[i])\r\n", "from math import *\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n x-=1\r\n if (x!=0):\r\n a[x-1] +=(y-1)\r\n if (x!=n-1):\r\n a[x+1] +=(a[x]-y)\r\n a[x] = 0\r\nfor i in a:\r\n print(i)", "n, = map(int, input().split())\nA = list(map(int, input().split()))\nm, = map(int, input().split())\nfor _ in range(m):\n x,y = map(int, input().split())\n up = y-1\n down = A[x-1] - up -1\n A[x-1] = 0\n if x-2 >= 0:\n A[x-2] += up\n if x < n:\n A[x] += down\n\nfor a in A:\n print(a)\n", "n = int(input())\r\na = [0]\r\na += list(map(int,input().split())) + [0]\r\nfor i in range(int(input())) :\r\n x,y = [int(i) for i in input().split()]\r\n a[x-1] += y - 1\r\n a[x+1] += a[x] - y\r\n a[x] = 0\r\nfor i in range(1,n+1) :\r\n print(a[i])", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\n\r\nfor i in range(m) :\r\n x , y = list(map(int,input().split()))\r\n if (x-2 >= 0) :\r\n a[x-2] += y-1\r\n if ( x < len(a) ):\r\n a[x] += a[x-1] - y\r\n\r\n a[x-1] = 0 \r\n\r\nfor i in range(len(a)) :\r\n print(a[i])\r\n\r\n \r\n\r\n ", "def birder(l1,l2,i):\r\n \r\n wire = l2[i][0]-1\r\n bird = l2[i][1]\r\n #print(\"WIRE\",wire)\r\n if wire==0:\r\n #print(\"HERE\")\r\n if len(l1)==1:\r\n l1[0]=0\r\n else: \r\n l1[1]+=l1[0]-bird\r\n l1[0]=0\r\n\r\n elif wire==len(l1)-1:\r\n #print(\"THERE\")\r\n l1[-2]+=bird-1\r\n l1[-1]=0\r\n\r\n else:\r\n #print(\"ZERE\")\r\n l1[wire+1]+=l1[wire]-bird\r\n l1[wire-1]+=bird-1\r\n l1[wire]=0\r\n \r\n return l1\r\n\r\ndef solution(l1,n2,b):\r\n i=0\r\n while i<n2:\r\n l1=birder(l1,b,i)\r\n i+=1\r\n i=0\r\n c_out=\"\"\r\n #print(n2,i)\r\n while i<len(l1):\r\n print(l1[i])\r\n i+=1\r\n \r\n\r\ndef answer():\r\n n = int(input())\r\n l1 = [int(x) for x in input().split()]\r\n n2 = int(input())\r\n b = []\r\n s = n2\r\n while n2:\r\n b.append([int(x) for x in input().split()])\r\n n2-=1\r\n n2=s\r\n solution(l1,n2,b)\r\n\r\nanswer()\r\n\r\n\r\n\r\n \r\n", "n = int(input())\r\nwires = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nfor _ in range(m):\r\n wire, bird = map(int, input().split())\r\n\r\n if wire > 1:\r\n wires[(wire - 1) - 1] += bird - 1\r\n if wire < n:\r\n wires[(wire - 1) + 1] += wires[(wire - 1)] - bird\r\n wires[(wire - 1)] = 0\r\nprint(*wires, sep='\\n')", "n = int(input())\r\nbirds = list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(1,m+1):\r\n x,y = map(int,input().split())\r\n x-=1\r\n if x !=0 :\r\n birds[x-1] += y - 1\r\n if x != n-1 :\r\n birds[x+1] += birds[x] - y\r\n \r\n birds[x]=0\r\nfor i in range(n):\r\n print(birds[i])", "n = int(input())\nbirds = list(map(int, input().split()))\nm = int(input())\n\nfor i in range(m):\n x, y = map(int, input().split())\n x -= 1 # convert 1-indexing to 0-indexing\n y -= 1 # convert 1-indexing to 0-indexing\n if x > 0:\n birds[x-1] += y\n if x < n-1:\n birds[x+1] += birds[x] - y - 1\n birds[x] = 0\n\nfor b in birds:\n print(b)\n\n\t \t\t\t\t \t \t \t\t \t \t \t\t\t \t\t\t \t \t", "#!/usr/bin/env python\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n N = int(wtf[0])\r\n A = list(map(int, wtf[1].split()))\r\n M = int(wtf[2])\r\n for t in wtf[3:]:\r\n x,y = map(int, t.split())\r\n x-=1\r\n if x-1 >= 0:\r\n A[x-1] += y-1\r\n if x+1 < N:\r\n A[x+1] += A[x]-y\r\n A[x] = 0\r\n print('\\n'.join(map(str, A)))\r\n", "n = int(input())\r\nv = [int(x) for x in input().split()]\r\nm = int(input())\r\nfor i in range(m):\r\n\tr, c = map(int, input().split())\r\n\tr -= 1;\r\n\t# count birds on left/right sides\r\n\tleft = c - 1\r\n\tright = v[r] - c\r\n\t# make birds fly away\r\n\tv[r] = 0\r\n\tif r - 1 >= 0:\r\n\t\tv[r-1] += left\r\n\tif r + 1 < n:\r\n\t\tv[r+1] += right\r\n\r\nfor i in v:\r\n\tprint(i)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor _ in range(int(input())):\r\n x,y=map(int,input().split())\r\n if x==1 and x==n:\r\n l[0]=0 \r\n elif x==1:\r\n l[x]+=(l[x-1]-y)\r\n elif x==n:\r\n l[x-2]+=(y-1)\r\n else:\r\n l[x]+=(l[x-1]-y)\r\n l[x-2]+=(y-1)\r\n l[x-1]=0\r\nfor i in l:\r\n print(i)\r\n ", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n x, y = [int(x) for x in input().split()]\r\n ly = max(0, y - 1)\r\n ry = a[x - 1] - y\r\n if x - 1 > 0:\r\n a[x - 2] += ly\r\n if x < n:\r\n a[x] += ry\r\n a[x - 1] = 0\r\n\r\nfor x in a:\r\n print(x)", "n = int(input())\r\nn_birds = list(map(int, input().split()))\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n [wire, position] = list(map(int, input().split()))\r\n if wire != 1:\r\n move_bird = position - 1\r\n n_birds[wire-2] += move_bird\r\n \r\n if wire != n:\r\n move_bird = n_birds[wire-1]-position\r\n n_birds[wire] += move_bird\r\n\r\n n_birds[wire-1] = 0\r\nfor i in n_birds:\r\n print(i)\r\n\r\n", "n=int(input())\r\nlt=list(input().split())\r\nD={-1:0,n:0}\r\nfor i in range(n):\r\n lt[i]=int(lt[i])\r\n D[i]=lt[i]\r\nm=int(input())\r\nwhile m!=0:\r\n m-=1\r\n k=list(input().split())\r\n a,b=int(k[0]),int(k[1])\r\n D[a-2]+=b-1\r\n D[a]+=D[a-1]-b\r\n D[a-1]=0\r\nfor i in range(n):\r\n print(D[i])\r\n", "n = int(input())\r\nnbw = input()\r\nnbw = list(str.split(nbw))\r\nnbw = [int(a) for a in nbw]\r\nm = int(input())\r\nfor i in range(m):\r\n cord = input()\r\n cord = list(str.split(cord))\r\n cord = [int(a) for a in cord]\r\n x = cord[0]\r\n y = cord[1]\r\n if ((x != n) and (x != 1)):\r\n nbw[x] += (nbw[x-1] - y)\r\n nbw[x-2] += (y-1)\r\n nbw[x-1] = 0\r\n elif x == n:\r\n nbw[x-2] += (y-1)\r\n nbw[x-1] = 0\r\n elif x == 1:\r\n nbw[x] += (nbw[x-1] - y)\r\n nbw[x-1] = 0\r\nfor _ in nbw:\r\n print(_)", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\n\r\nn = int(input())\r\nll = list(map(int, input().split()))\r\nq = int(input())\r\nfor i in range(q):\r\n x,y = map(int, input().split())\r\n wire = x-1\r\n bcurr = ll[wire]\r\n belft = y-1\r\n bright = ll[wire]-y\r\n if wire-1>=0:\r\n ll[wire-1]+=belft\r\n if wire+1<n:\r\n ll[wire+1]+=bright\r\n ll[wire]=0\r\nfor el in ll:\r\n print(el)", "n = int(input())\r\na = list(map(int,input().split()))\r\nk = int(input())\r\nfor i in range(k):\r\n\tp,q = list(map(int,input().split()))\r\n\tif(p==1 and (len(a)>1)):\r\n\t\ta[p] = a[p-1] - q + a[p]\r\n\t\ta[p-1] = 0\r\n\r\n\telif(p==1 and (len(a) == 1)):\r\n\t\ta[p-1] = 0\r\n\telif( p == len(a)):\r\n\t\ta[p-2] = a[p-2] + q - 1\r\n\t\ta[p-1] = 0\r\n\telse:\r\n\t\ta[p] = a[p-1] - q + a[p]\r\n\t\ta[p-2] = a[p-2] + q - 1\r\n\t\ta[p-1] = 0\r\n\r\nfor j in range(n):\r\n\tprint(a[j])\r\n\r\n", "n = int(input()) # number of wires\r\nbirds = list(map(int, input().split())) # initial number of birds on each wire\r\nm = int(input()) # number of shots\r\nshots = []\r\nfor _ in range(m):\r\n x, y = map(int, input().split()) # x: wire number, y: bird number\r\n shots.append((x, y))\r\nfor x, y in shots:\r\n left_wire = x - 1\r\n right_wire = x + 1\r\n \r\n # Update birds on left wire\r\n if left_wire >= 1:\r\n birds[left_wire - 1] += y - 1\r\n \r\n # Update birds on right wire\r\n if right_wire <= n:\r\n birds[right_wire - 1] += birds[x - 1] - y\r\n \r\n # Remove birds on current wire\r\n birds[x - 1] = 0\r\n# Print the number of birds on each wire\r\nfor num_birds in birds:\r\n print(num_birds)", "from sys import stdin\r\nfrom fractions import Fraction\r\n\r\nn = int(stdin.readline().strip())\r\nbirds = [int(x) for x in stdin.readline().strip().split(' ')]\r\nm = int(stdin.readline().strip())\r\ndead = []\r\n\r\nfor i in range(m):\r\n dead.append([int(x) for x in stdin.readline().strip().split(' ')])\r\n\r\n\r\ndef solution(birds, dead):\r\n for d in dead:\r\n x = d[0] - 1\r\n y = d[1]\r\n if x != 0:\r\n birds[x - 1] += y - 1\r\n\r\n if x != n - 1:\r\n birds[x + 1] += birds[x] - y\r\n\r\n birds[x] = 0\r\n\r\n return birds\r\n\r\n\r\ns = solution(birds, dead)\r\n\r\nfor x in s:\r\n print(x)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nfor cas in range(m):\r\n p, x = map(int, input().split())\r\n p -= 1\r\n if p > 0:\r\n a[p - 1] += x - 1\r\n if p < n - 1:\r\n a[p + 1] += a[p] - x\r\n a[p] = 0\r\nfor x in a:\r\n print(x)", "n = int(input())\n\ncnts = [-1] + list(map(int, input().split())) + [-1]\n\nm = int(input())\n\nS = []\n\nfor _ in range(m):\n x, y = map(int, input().split())\n ups = y - 1\n downs = cnts[x] - ups - 1\n cnts[x] = 0\n cnts[x-1] += ups\n cnts[x+1] += downs\n\n\nfor i in range(1, len(cnts) - 1):\n print(cnts[i])\n\n\n\n", "import sys\r\nfrom math import gcd\r\ndef inp() : return sys.stdin.readline().strip()\r\ndef get_ints(): return map(int, inp().split())\r\ndef get_arr(): return list(map(int, inp().split()))\r\ndef get_int(): return int(inp())\r\nn=get_int()\r\nos=get_arr()\r\nt=get_int()\r\nfor _ in range(t):\r\n x,y=get_ints()\r\n x-=1\r\n if(x-1>=0 and x+1<n): \r\n os[x-1]+=(y-1)\r\n os[x+1]+=(os[x]-y)\r\n elif(x-1<0 and x+1<n):\r\n os[x+1]+=(os[x]-y)\r\n elif(x-1>=0 and x+1>=n):\r\n os[x-1]+=(y-1)\r\n os[x]=0\r\nfor i in os:\r\n print(i)", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\nm=int(input())\r\nfor i in range(m):\r\n l,y=map(int,input().split())\r\n if(n==1):\r\n print(0)\r\n exit()\r\n elif(l==1):\r\n list[l]+=(list[l-1]-y)\r\n list[l-1]=0\r\n elif(l==n):\r\n list[l-2]+=(y-1)\r\n list[l-1]=0\r\n else:\r\n list[l-2]+=(y-1)\r\n list[l]+=(list[l-1]-y)\r\n list[l-1]=0\r\nfor i in range(n):\r\n print(list[i])", "n = int(input())\r\narr = list(map(int, input().split()))\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n if a != 0:\r\n arr[a-1] += b-1\r\n if a != n - 1:\r\n arr[a+1] += arr[a]-b\r\n arr[a] = 0\r\n\r\nprint(\"\\n\".join(map(str, arr)))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\n \r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n \r\n\r\nn=inp()\r\nT= inlt()\r\nshots = inp()\r\nfor i in range(shots):\r\n xi,yi=invr()\r\n xi-=1\r\n #birds to left\r\n if(xi!=0):\r\n T[xi-1]=T[xi-1]+(yi-1)\r\n #birds to right\r\n if(xi!=n-1):\r\n T[xi+1]=T[xi+1]+(T[xi]-yi)\r\n T[xi]=0\r\n \r\nfor i in T:\r\n print(i)", "def main():\r\n n = int(input())\r\n bs = list(map(int, input().split()))\r\n\r\n m = int(input())\r\n for _ in range(m):\r\n [w, b] = list(map(int, input().split()))\r\n w -= 1\r\n b -= 1\r\n\r\n if w > 0:\r\n bs[w - 1] += b\r\n\r\n if w < n - 1:\r\n bs[w + 1] += bs[w] - b - 1\r\n\r\n bs[w] = 0\r\n\r\n for b in bs:\r\n print(b)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor x in range(int(input())):\r\n\ta,b=map(int,input().split())\r\n\tif a-2>=0:l[a-2]+=b-1\r\n\tif a<n:l[a]+=l[a-1]-b\r\n\tl[a-1]=0\r\nfor x in l:print(x)", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nc = int(input())\r\nfor i in range(c):\r\n x,y = map(int,input().split())\r\n x-=1\r\n if (x != 0):\r\n lst[x - 1] += y - 1;\r\n if (x != n - 1):\r\n lst[x + 1] += lst[x] - y;\r\n lst[x] = 0;\r\nfor i in lst:\r\n print(i)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nfor _ in range(int(input())):\r\n i,p = map(int, input().split())\r\n if i - 2 >= 0:\r\n l[i - 2] += p - 1\r\n if i < n:\r\n l[i] += l[i-1] - p\r\n l[i-1] = 0\r\nfor x in l:\r\n print(x)", "n = int(input())\r\nwires = [0]#Adiciona um 0 e um n+1 elemento para não se preucupar com os extremos\r\n\r\nfor j in (input().split()):\r\n wires.append(int(j))\r\n\r\nwires.append(0)\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n\r\n E = y - 1\r\n D = wires[x] - y\r\n\r\n wires[x] = 0\r\n wires[x-1] += E\r\n wires[x+1] += D\r\n\r\nfor i in range(1, n + 1 ): #Não printa nem o 0 nem o n + 1, já que ele em tese não existem\r\n print(wires[i])\r\n", "if __name__ == '__main__':\r\n empt = input()\r\n pos = list(map(int,input().split()))\r\n\r\n shots = int(input())\r\n for _ in range(shots):\r\n a,b = list(map(int,input().split()))\r\n a-=1\r\n b-=1\r\n\r\n\r\n if a<len(pos)-1:\r\n pos[a+1]+=pos[a]-b-1\r\n if a>0:\r\n pos[a-1]+=b\r\n pos[a]=0\r\n\r\n for i in pos:\r\n print(i)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=int(input())\r\nfor i in range(t):\r\n x,y=map(int,input().split())\r\n if(x==1):\r\n if(x<n):\r\n l[x]+=l[x-1]-y\r\n l[x-1]=0\r\n elif(x==n):\r\n l[x-2]+=y-1\r\n l[x-1]=0\r\n else:\r\n l[x-2]+=y-1\r\n l[x]+=l[x-1]-y\r\n l[x-1]=0\r\nfor i in l:\r\n print(i)\r\n", "INP = lambda : map(int, input().split())\r\nn = int(input())\r\na = [*INP()]\r\nfor i in range(int(input())):\r\n x, y = INP()\r\n if x > 1: a[x-2] += y-1\r\n if x < n: a[x] += a[x-1]-y\r\n a[x-1] = 0\r\nfor bird in a:\r\n print(bird)", "t = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nc = int(input())\r\n\r\nfor i in range(c):\r\n a, b = map(int, input().split())\r\n\r\n current = arr[a-1]\r\n\r\n left = b - 1\r\n right = current - b\r\n\r\n if a != 1:\r\n arr[a-2] = arr[a-2] + left\r\n\r\n if a != len(arr):\r\n arr[a] = arr[a] + right\r\n\r\n arr[a-1] = 0\r\n\r\nfor i in arr:\r\n print(i)", "n= int(input())\na=[int(i) for i in input().split()]\nm=int(input())\nwhile m:\n x,y=input().split()\n x=int(x)-1\n y=int(y)\n if x!=0:\n a[x-1]+= y-1\n if x<n-1:\n a[x+1]+=a[x]-y\n a[x]=0\n m-=1\nfor i in range(n):\n print(a[i])\n\n\n \t \t\t \t \t \t\t \t\t \t \t \t", "n = int(input())\r\nin_list = [int(x) for x in input().split()]\r\nquery = int(input())\r\n\r\nfor q in range(query):\r\n line,pos = map(int,input().split())\r\n\r\n if line-2>=0:\r\n in_list[line-2]+= pos-1\r\n if line < n:\r\n in_list[line]=in_list[line]+in_list[line-1]-pos\r\n in_list[line-1] = 0\r\nfor birds in in_list:\r\n print(birds)\r\n", "p = int(input())\r\nprov = [int(i) for i in input().split()]\r\nk = int(input())\r\no = 1\r\nfor i in range(k):\r\n n, m = map(int, input().split())\r\n n -= 1\r\n if p == 1:\r\n print(0)\r\n o = 0\r\n elif n == 0:\r\n prov[n + 1] += prov[n] - m\r\n prov[n] = 0\r\n elif n == p - 1:\r\n prov[n - 1] += m - 1\r\n prov[n] = 0\r\n else:\r\n prov[n - 1] += m - 1\r\n prov[n + 1] += prov[n] - m\r\n prov[n] = 0\r\nif o == 1:\r\n for i in range(p):\r\n print(prov[i])", "r=int(input())\nl=[int(x) for x in input().split()]\nk=int(input())\nfor i in range(k):\n f,s=[int(x) for x in input().split()]\n if f==len(l):\n l[f-2]+=s-1\n l[f-1]=0\n elif f==1:\n l[f]+=l[f-1]-s\n l[f-1]=0\n else: \n l[f]+=l[f-1]-s\n l[f-2]+=s-1\n l[f-1]=0\nfor t in l:\n print(t)\n \t \t\t\t\t \t\t\t \t \t\t\t\t", "n = int(input())\r\nA = [int(a) for a in input().split(sep=' ')]\r\nm = int(input())\r\n\r\nfor i in range(0, m):\r\n x, y = [int(a) for a in input().split(sep=' ')]\r\n x -= 1\r\n if x > 0:\r\n A[x-1] += y-1\r\n if x < len(A)-1:\r\n A[x+1] += (A[x] - y) \r\n A[x] = 0\r\n\r\nfor a in A:\r\n print(a)\r\n\r\n\r\n", "\r\nn=int(input())\r\nw=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n x-=1\r\n if x>0:\r\n w[x-1]+=y-1\r\n if x<n-1:\r\n w[x+1]+=w[x]-y\r\n w[x]=0\r\nfor i in range(n):\r\n print(w[i])", "num = int(input())\r\nlist0 = [int(i) for i in input().split()]\r\nnum0 = int(input())\r\nlist1 = []\r\nfor i in range(num0):\r\n x = [int(i) for i in input().split()]\r\n list1.append(x)\r\nfor i in list1:\r\n i[0] -= 1\r\nfor i in list1:\r\n if i[0] == num - 1:\r\n list0[i[0]] -= (list0[i[0]] - i[1] + 1)\r\n else:\r\n list0[i[0]+1] += list0[i[0]] - i[1]\r\n list0[i[0]] -= (list0[i[0]] - i[1] + 1)\r\n if i[0] == 0:\r\n list0[i[0]] -= i[1] - 1\r\n else:\r\n list0[i[0]-1] += i[1] - 1\r\n list0[i[0]] -= i[1] - 1\r\nfor i in list0:\r\n print(i)", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nbirds = list(map(int, sys.stdin.readline().split()))\r\nfor i in range(int(sys.stdin.readline())):\r\n x, y = map(int, sys.stdin.readline().split())\r\n x = x - 1\r\n if x >= 1:\r\n birds[x - 1] += (y - 1)\r\n if x < (n - 1):\r\n birds[x + 1] += (birds[x] - y)\r\n birds[x] = 0\r\nfor bird in range(n):\r\n print(birds[bird])\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nfor _ in range(m):\r\n x,y=list(map(int,input().split()))\r\n x=x-1\r\n if(len(a)==1):\r\n a[0]=0\r\n else:\r\n if(x==0):\r\n a[x+1]+=a[x]-y\r\n a[x]=0\r\n elif(x==len(a)-1):\r\n a[x]=0\r\n a[x-1]+=y-1\r\n else:\r\n a[x-1]+=y-1\r\n a[x+1]+=a[x]-y\r\n a[x]=0\r\n #print(a[x-1],a[x+1])\r\nfor i in a:\r\n print(i)\r\n", "n = int(input())\r\nbirds = list(map(int,input().split()))\r\nt =int(input())\r\nfor i in range(t):\r\n x,y = map(int,input().split())\r\n x-=1\r\n go_right = birds[x]-y\r\n go_left = birds[x]-go_right-1\r\n birds[x]=0\r\n ## go left\r\n if x>=1:\r\n birds[x-1]+=go_left\r\n if x<n-1:\r\n birds[x+1]+=go_right\r\nprint(*birds,sep='\\n')\r\n", "num_of_wires = int(input())\r\nnum_of_birds = [int(x) for x in input().split(\" \")]\r\nnum_shot = int(input())\r\nfor i in range(num_shot):\r\n inpt1 = [int(x) for x in input().split(\" \")]\r\n \r\n wire = inpt1[0] - 1\r\n ind = inpt1[1] - 1\r\n temp = num_of_birds[wire]\r\n num_of_birds[wire] = 0\r\n if wire - 1 >= 0:\r\n left_sum = ind\r\n num_of_birds[wire-1] += left_sum\r\n \r\n try:\r\n right_sum = temp - ind - 1\r\n num_of_birds[wire+1] += right_sum\r\n except IndexError:\r\n right_sum = 0\r\n\r\nfor i in num_of_birds:\r\n print(i)\r\n", "#https://codeforces.com/contest/294/problem/A\r\n\r\nnum_wires = int(input())\r\nlst = [int(i) for i in input().split()]\r\n\r\nnumber_of_shots = int(input())\r\nline_shotpos = []\r\nfor i in range(number_of_shots):\r\n line_shotpos.append([int(i) for i in input().split()])\r\n\r\n# print(line_shotpos)\r\n\r\nfor i in range(number_of_shots):\r\n current_line = line_shotpos[i][0]\r\n bird_shot_at = line_shotpos[i][1]\r\n bird_totheleft = bird_shot_at - 1\r\n bird_totheright = lst[current_line-1]-bird_shot_at\r\n # print('line:{},bird_shot:{},bird_toleft:{},bird_toright:{}'.format(current_line,\\\r\n # bird_shot_at,bird_totheleft,bird_totheright))\r\n if current_line != 1:\r\n lst[current_line - 1 -1] += bird_totheleft\r\n if current_line != num_wires:\r\n lst[current_line -1 + 1] += bird_totheright\r\n lst[current_line-1] = 0\r\n # print('Birds after {} shot: {}'.format(i+1, lst))\r\n\r\nfor i in lst:\r\n print(i)\r\n\r\n", "nb_wires = int(input())\r\npopulation = [0] + [int(x) for x in input().split()] + [0]\r\nnb_shots = int(input())\r\nfor _ in range(nb_shots):\r\n wire_no, bird_no = [int(x) for x in input().split()]\r\n population[wire_no-1] += bird_no - 1\r\n population[wire_no+1] += population[wire_no] - bird_no\r\n population[wire_no] = 0\r\nfor i in range(1, nb_wires+1) :\r\n print(population[i])", "n = int(input())\r\nbirds = list(map(int,input().split()))\r\nkills = int(input())\r\ncordinates = [[j for j in list(map(int,input().split()))] for i in range(kills)]\r\nX = []\r\nY=[]\r\nfor i in range(len(cordinates)):\r\n X.append(cordinates[i][0])\r\n Y.append(cordinates[i][1])\r\nfor i in range(len(X)):\r\n if n == 1 :\r\n birds[0] = 0\r\n else:\r\n \r\n counter = X[i]-1\r\n if counter==0:\r\n \r\n birds[counter+1] = birds[counter+1] + abs(birds[counter]-Y[i])\r\n birds[counter]=0\r\n elif counter==n-1:\r\n birds[counter-1] = birds[counter-1] + abs(Y[i]-1)\r\n birds[counter]=0\r\n \r\n \r\n else:\r\n birds[counter-1] = birds[counter-1] + abs(Y[i]-1)\r\n birds[counter+1] = birds[counter+1] + abs(birds[counter]-Y[i])\r\n birds[counter]=0\r\nfor j in birds:\r\n print(j)\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\nlst = [int(i) for i in input().split()]\r\nlst.insert(0, 0)\r\nlst.append(0)\r\nfor shot in range(int(input())):\r\n\t#print(lst)\r\n\tx, y = map(int, input().split())\r\n\tleft = y - 1\r\n\tright = lst[x] - y\r\n\tlst[x - 1] += left\r\n\tlst[x + 1] += right\r\n\tlst[x] = 0\r\nfor el in lst[1:-1]: print(el)", "num_of_wires = int(input())\r\nnum_of_birds_in_each_wires = list(map(int,input().strip().split()))\r\nnum_of_shots = int(input())\r\nindex_of_wire = []\r\nindex_of_bird = []\r\nfor i in range(num_of_shots):\r\n w, b = map(int,input().strip().split())\r\n index_of_wire.append(w)\r\n index_of_bird.append(b)\r\nr = 0\r\nfor y in index_of_wire :\r\n num_in_current = num_of_birds_in_each_wires[y-1] # number of birds in current wires\r\n index_of_current = index_of_bird[r] # index of shot bird\r\n left_num = index_of_current - 1\r\n right_num = num_in_current - index_of_current\r\n num_of_birds_in_each_wires[y-1] = 0\r\n if y-2 in range(num_of_wires):\r\n num_of_birds_in_each_wires[y-2] = num_of_birds_in_each_wires[y-2] + left_num # number of brids in next wires\r\n if y in range(num_of_wires):\r\n num_of_birds_in_each_wires[y] = num_of_birds_in_each_wires[y] + right_num # number of brids in last wires\r\n r = r + 1\r\nfor i in num_of_birds_in_each_wires :\r\n print(i)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n xi, yi = map(int, input().split())\r\n xi -= 1 \r\n if xi > 0:\r\n a[xi - 1] += yi - 1\r\n if xi < n - 1:\r\n a[xi + 1] += a[xi] - yi\r\n a[xi] = 0\r\n\r\nfor oskol in a:\r\n print(oskol)", "import sys,math\r\nn=int(sys.stdin.readline())\r\nl=list(map(int,sys.stdin.readline().split()))\r\nm=int(sys.stdin.readline())\r\nfor _ in range(m):\r\n x,y=map(int, sys.stdin.readline().split())\r\n x-=1\r\n old=l[x]\r\n l[x]=0\r\n if x-1>=0:\r\n l[x-1]+=(y-1)\r\n if x+1<n:\r\n l[x+1]+=(old-y)\r\nfor i in l:\r\n print(i)", "n, lst, m = int(input()), list(map(int, input().split())), int(input())\r\nlst = [0] + lst + [0]\r\nfor u in range(m):\r\n x, y = map(int, input().split())\r\n lst[x + 1], lst[x - 1], lst[x] = lst[x + 1] + lst[x] - y, lst[x - 1] + y - 1, 0\r\nfor x in range(n): print(lst[x + 1])", "n = int(input())\nv = [0]\np = [int(i) for i in input().split()]\nfor i in range(n):\n v.append(p[i])\n\nm = int(input())\nfor i in range(m):\n x, y = map(int, input().split())\n if x == n or y == v[x]:\n v[x-1] += y-1\n v[x] = 0\n elif x == 1 or y == 1:\n v[x+1] += v[x]-y\n v[x] = 0\n else:\n v[x+1] += v[x]-y\n v[x-1] += y-1\n v[x] = 0\n\nfor i in range(1, n+1):\n print(v[i])\n", "n = int(input())\nl = list(map(int,input().split()))\nm = int(input())\nfor _ in range(m):\n x,y = map(int,input().split())\n if x != 1:\n l[x-2]+=y-1\n if x != n:\n l[x]+=l[x-1]-y\n l[x-1] = 0\nfor i in l:\n print(i)\n\n", "m = int(input())\r\nbirds = list(map(int, input().split()))\r\nn = int(input())\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if x > 0:\r\n birds[x - 1] += y - 1\r\n if x < m - 1:\r\n birds[x + 1] += birds[x] - y\r\n birds[x] = 0\r\n\r\nfor value in birds:\r\n print(value)\r\n", "# https://codeforces.com/contest/294/problem/A\r\n\r\nnoOfWires = int(input())\r\nnoOfBirdsOnEachWires = [int(x) for x in input().split(' ')]\r\nnoOfBirdsKilled = int(input())\r\n\r\nfor i in range(noOfBirdsKilled):\r\n birdKilled = [int(x) for x in input().split(' ')]\r\n wireNo = birdKilled[0] - 1 # index\r\n birdNo = birdKilled[1]\r\n birdsOnLeft = birdNo - 1\r\n birdsOnRight = noOfBirdsOnEachWires[wireNo] - birdNo\r\n if wireNo != 0:\r\n noOfBirdsOnEachWires[wireNo - 1] += birdsOnLeft\r\n noOfBirdsOnEachWires[wireNo] = 0\r\n if wireNo != noOfWires-1:\r\n noOfBirdsOnEachWires[wireNo + 1] += birdsOnRight\r\n\r\nprint('\\n'.join([str(x) for x in noOfBirdsOnEachWires]))\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n w = x - 1\r\n dl = A[w] - y\r\n dr = y - 1\r\n if len(A) > 1:\r\n if x == 1:\r\n A[x] = A[x] + dl\r\n A[w] = 0\r\n elif x == n:\r\n A[w - 1] = A[w - 1] + dr\r\n A[w] = 0\r\n else:\r\n A[w - 1] = A[w - 1] + dr\r\n A[x] = A[x] + dl\r\n A[w] = 0\r\n else:\r\n A = [0]\r\n \r\nfor j in A:\r\n print(j)", "n=int(input());r=[*map(int,input().split())]\r\nfor _ in [0]*int(input()):\r\n x,y=map(int,input().split())\r\n if x>1:r[x-2]+=y-1\r\n if x<n:r[x]+=r[x-1]-y\r\n r[x-1]=0\r\nfor i in r:print(i)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef solve(a: list, axis: list, n: int) -> None:\r\n for x, y in axis:\r\n if x - 2 >= 0:\r\n a[x - 2] += y - 1\r\n\r\n if x < n:\r\n a[x] += a[x - 1] - y\r\n\r\n a[x - 1] = 0\r\n\r\n print(*a)\r\n\r\ndef main() -> None:\r\n n, a = int(input()), list(map(int, input().split()))\r\n m = int(input())\r\n axis = [list(map(int, input().split())) for i in range(m)]\r\n\r\n solve(a, axis, n)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\nb_on_line=list(map(int,input().split()))\r\nm=int(input())\r\n\r\n\r\nfor i in range(0,m):\r\n left=0\r\n right=0\r\n x,y=map(int,input().split())\r\n tot=b_on_line[x-1]\r\n right=tot-y\r\n left=y-1\r\n if x!=1:\r\n b_on_line[x-2]= b_on_line[x-2]+left\r\n if x!=n:\r\n b_on_line[x]= b_on_line[x]+right\r\n b_on_line[x-1]=0\r\nprint(*b_on_line,sep=\"\\n\")", "n=int(input());a=[0]+list(map(int,input().split()))+[0]\r\nfor i in range(int(input())):\r\n\tx,y=map(int,input().split())\r\n\ta[x-1]=a[x-1]+y-1\r\n\ta[x+1]=a[x+1]+a[x]-y\r\n\ta[x]=0\r\nfor i in range(1,len(a)-1):\r\n\tprint(a[i])\r\n\t", "n = int(input())\narr = list(map(int, input().split()))\nfor _ in range(int(input())):\n\twire, index = map(int, input().split())\n\tbird = arr[wire - 1]\n\tif wire != n:\n\t\tarr[wire] += bird - index\n\tif wire != 1:\n\t\tarr[wire - 2] += (index - 1)\n\tarr[wire - 1] = 0\nfor m in arr:\n\tprint(m)\n\t\t \t\t \t \t \t \t\t \t\t\t\t \t\t \t\t\t\t\t", "x=int(input())\r\nk=[0]+list(map(int, input().split()))+[0]\r\ny=int(input())\r\nfor i in range(y):\r\n h1,h2=map(int, input().split())\r\n k[h1-1]+=h2-1\r\n k[h1+1]+=k[h1]-h2\r\n k[h1]=0\r\n \r\nprint('\\n'.join(map(str, k[1:-1])))\r\n \r\n", "n = int(input())\r\na = [0] + list(map(int, input().split(' '))) + [0]\r\nfor _ in range(int(input())):\r\n x, y = list(map(int, input().split(' ')))\r\n a[x-1] += y-1\r\n a[x+1] += a[x]-y\r\n a[x] = 0\r\nfor i in range(1, n+1):\r\n print(a[i])", "n=int(input())\r\na=list(map(int,input().split()))\r\nc={0:0}\r\nfor i in range(n):\r\n c[i+1]=a[i]\r\nc[i+2]=0\r\nfor i in range(int(input())):\r\n v,b=map(int,input().split())\r\n c[v-1]+=b-1\r\n c[v+1]+=c[v]-b\r\n c[v]=0\r\nfor i in range(1,n+1):\r\n print(c[i])\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nq = int(input())\r\nfor _ in range(q):\r\n x, y = map(lambda m: int(m) - 1, input().split())\r\n nb_right = max((l[x] - 1) - y, 0)\r\n nb_left = (l[x] - 1) - nb_right\r\n l[x] = 0\r\n if x + 1 < n:\r\n l[x + 1] += nb_right\r\n if x - 1 >= 0:\r\n l[x - 1] += nb_left\r\n\r\nprint('\\n'.join(list(map(str, l))))", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nm = int(input())\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n cur = a[x]\r\n if cur != 0:\r\n if x+1 < n:\r\n a[x+1] += cur - y\r\n if x-1 > -1:\r\n a[x-1] += y-1\r\n a[x] = 0\r\n\r\nfor i in a:\r\n print(i)\r\n #10-(5 подстрелили) 4 слева, 5 справа слева = № - 1, справа = все - №\r\n \r\n", "n = int(input())\r\n\r\nbirds = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nwhile m :\r\n x, y = map(int, input().split())\r\n if x - 2 >=0 :\r\n birds[x-2] += y-1\r\n\r\n if x < n:\r\n birds[x] += birds[x-1] - y \r\n birds[x-1] = 0\r\n m -=1\r\n\r\nfor i in birds:\r\n print(i)\r\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn=iinput()\r\na=list(map(int,input().split()))\r\nm=iinput()\r\nfor i in range(m):\r\n x,y = rinput()\r\n left=y-1\r\n right=a[x-1]-y\r\n if(x>=2):\r\n a[x-2]+=left\r\n if(x<n):\r\n a[x]+=right\r\n a[x-1]=0\r\n\r\nfor i in range(n):\r\n print(a[i])\r\n", "n = int(input())\nmat = [0] + list(map(int, input().split())) + [0]\nm = int(input())\nfor _ in range(m):\n x,y = map(int, input().split())\n mat[x-1]+=y-1\n mat[x+1]+=mat[x]-y\n mat[x]=0\nfor i in range(1,n+1):\n print(mat[i])\n", "num_wires = int(input())\r\nnum_birds_per_wire = list(map(int, input().split()))\r\n\r\nnum_shots = int(input())\r\n\r\nshots_positions = [list(map(int, input().split())) for i in range(num_shots)]\r\n\r\nfor shot_pos in shots_positions:\r\n\r\n x_pos, y_pos = shot_pos[0], shot_pos[1]\r\n x_pos, y_pos = x_pos - 1, y_pos - 1\r\n\r\n\r\n\r\n if x_pos > 0:\r\n num_birds_per_wire[x_pos - 1] += y_pos\r\n\r\n if x_pos < num_wires - 1:\r\n num_birds_per_wire[x_pos + 1] += (num_birds_per_wire[x_pos] - y_pos - 1)\r\n\r\n num_birds_per_wire[x_pos] = 0\r\n\r\nfor i in num_birds_per_wire:\r\n print(i)\r\n", "x=int(input())\r\na=[]\r\nb=list(map(int,input().split()))\r\nfor i in b:\r\n a.append([1]*i)\r\nn=int(input())\r\nwhile n:\r\n x0,y0=map(int,input().split())\r\n x0-=1\r\n y0-=1\r\n lol=len(a[x0][:y0])\r\n olo=len(a[x0][y0+1:])\r\n a[x0]=[]\r\n if x0-1>=0:\r\n a[x0-1].extend([1]*lol)\r\n if x0+1<x:\r\n a[x0+1].extend([1]*olo)\r\n n-=1\r\nfor i in a:\r\n print(len(i)) ", "n = int(input())\r\nwire = [int(i) for i in input().split()]\r\n\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n\r\n if x > 1:\r\n wire[x-2] += (y-1)\r\n\r\n if x < n:\r\n wire[x] += (wire[x-1]-y)\r\n\r\n wire[x-1] = 0\r\n\r\nfor i in wire:\r\n print(i)\r\n", "n = int(input())\r\nbirds = [int(q) for q in input().split()]\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = [int(q) for q in input().split()]\r\n if birds[x-1]:\r\n if x-2 >= 0:\r\n birds[x-2] += (y-1)\r\n if x+1 <= len(birds):\r\n birds[x] += birds[x-1]-y\r\n birds[x-1] = 0\r\nfor w in birds:\r\n print(w)\r\n", "input()\r\nn = list(map(int, [0]+input().split()+[0]))\r\nt = int(input())\r\nfor i in range(t):\r\n x, y= map(int, input().split())\r\n n[x-1] += y-1\r\n n[x+1] += n[x] - y\r\n n[x] = 0\r\nfor i in range(1, len(n)-1):\r\n print(n[i])", "n = int(input())\nwires = list(map(int,input().split()))\nm = int(input())\nfor _ in range(m):\n wire,bird = map(int,input().split())\n # for one indexing\n wire -=1\n if wire != 0 :\n wires[wire-1] += bird -1\n if wire != n-1 :\n wires[wire+1] += wires[wire]-bird \n wires[wire] = 0\nprint(*wires,sep=\"\\n\")", "totla_box=int(input())\r\nbox=list(map(int ,input().split()))\r\nn=int(input())\r\n\r\nfor i in range(n):\r\n n_box,i_box=list(map(int ,input().split()))\r\n n_box-=1\r\n \r\n if (n_box != 0):\r\n box[n_box-1]+=i_box-1\r\n if (n_box!= totla_box-1):\r\n box[n_box+1]+=box[n_box]-i_box\r\n \r\n box[n_box]=0\r\n\r\n\r\nfor i in box:\r\n print (i)", "# Version 17.0\ndef main() -> None:\n # 2023-08-26 23:35:53\n length = ii()\n l = li()\n length2 = ii()\n for tc in range(length2):\n a,b = mi()\n a-=1\n total = l[a]\n l[a] = 0\n left = b - 1\n right = abs(total - b)\n if a>=1:\n l[a-1]+=left\n if a<length-1:\n l[a+1]+=right\n for i in l:\n p(i)\n\n\n \nif __name__ == \"__main__\":\n master_flag = False\n L = lambda string: exec('from hq import L\\nL(string)') if not master_flag else False\n LT = lambda tc, custom, string: exec('from hq import LT\\nLT(tc, custom, string)') if not master_flag else False\n import os,sys,math,itertools;from collections import deque,defaultdict,OrderedDict,Counter\n from bisect import bisect,bisect_left,bisect_right,insort\n from heapq import heapify,heappush,heappop,nsmallest,nlargest,heapreplace, heappushpop\n ii,si=lambda:int(input()),lambda:input() \n mi,msi=lambda:map(int,input().strip().split(\" \")),lambda:map(str,input().strip().split(\" \")) \n li,lsi=lambda:list(mi()),lambda:list(msi())\n out,export,p,pp=[],lambda:print('\\n'.join(map(str, out)), end=''),lambda x :out.append(x),lambda array:p(' '.join(map(str,array)))\n try:exec('from hq import see,info,cmdIO,_generator_\\nline=[cmdIO(),main(),export(),_generator_()]\\nfor l in line:l')\n except(FileNotFoundError,ModuleNotFoundError):master_flag=True;main();export()\n \t\t\t\t \t\t \t \t\t\t\t \t\t \t\t \t\t", "n = int(input())\r\nbirds = list(map(int, input().split(' ')))\r\ns = int(input())\r\nfor _ in range(s):\r\n wire, bird = [int(x) for x in input().split()]\r\n idx = wire - 1\r\n if idx - 1 >= 0:\r\n birds[idx - 1] += bird - 1\r\n if idx + 1 < len(birds):\r\n birds[idx + 1] += birds[idx] - bird\r\n birds[idx] = 0\r\n \r\nfor b in birds:\r\n print(b,\"\\n\")", "# Author : //- kibrom Hailu -\\\\\r\n\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter,defaultdict , deque \r\nfrom bisect import bisect , bisect_left ,bisect_right \r\nfrom itertools import accumulate \r\nfrom heapq import heapify , heappop , heappush , heappushpop , heapreplace\r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef solve():\r\n \r\n # write your code here \r\n n = I()\r\n arr = IL() \r\n\r\n m = I() \r\n for i in range(m):\r\n wire , idx = II() \r\n wire -= 1\r\n x = arr[wire]\r\n arr[wire] = 0 \r\n\r\n if wire + 1 < n:\r\n arr[wire+1] += x-idx \r\n \r\n if wire-1 > -1:\r\n arr[wire-1] += idx-1\r\n \r\n for a in arr:\r\n print(a)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nsolve()\r\n", "# Read the number of wires\r\nn = int(input())\r\n\r\n# Read the number of birds on each wire\r\na = list(map(int, input().split()))\r\n\r\n# Read the number of shots\r\nm = int(input())\r\n\r\n# Loop through each shot\r\nfor _ in range(m):\r\n # Read the wire and the position of the shot bird\r\n x, y = map(int, input().split())\r\n # Decrease the wire number by one to match the list index\r\n x -= 1\r\n # Update the number of birds on the adjacent wires\r\n # If there is an upper wire, add the birds to the left of the shot bird\r\n if x > 0:\r\n a[x - 1] += y - 1\r\n # If there is a lower wire, add the birds to the right of the shot bird\r\n if x < n - 1:\r\n a[x + 1] += a[x] - y\r\n # Set the number of birds on the current wire to zero\r\n a[x] = 0\r\n\r\n# Print the number of birds on each wire\r\nfor i in range(n):\r\n print(a[i])", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nw = [[0]*2 for i in range(m)]\r\n\r\nfor i in range(m):\r\n w[i][0], w[i][1] = map(int ,input().split())\r\n\r\nfor i in range(m):\r\n\r\n left = w[i][1]-1\r\n right = a[w[i][0]-1]-w[i][1]\r\n\r\n if w[i][0] != 1:\r\n a[w[i][0]-2] += left\r\n\r\n if w[i][0] != n:\r\n a[w[i][0]] += right\r\n\r\n a[w[i][0]-1] = 0\r\n\r\nfor i in range(n):\r\n print(a[i])\r\n ", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n#\r\n# ------------------------------------------------------------------------------\r\n# Author: Mohammad Mohsen\r\n# Date: Thu Dec 23 16:36:52 2021\r\n# problem name: Shaass_and_Oskols\r\n# contest: 294-Codeforces Round #178 (Div. 2)\r\n# problem difficulty: A-D2\r\n# problem url: https://codeforces.com/contest/294/problem/A\r\n# ------------------------------------------------------------------------------\r\n\r\nfrom typing import *\r\n\r\n\r\nclass Problem(object):\r\n\r\n def __init__(self, name: str) -> None:\r\n self.name = name\r\n\r\n def solution(self) -> Union[str, int, float]:\r\n num_of_wires: int = int(input().strip())\r\n oskols: List[int] = [int(i) for i in input().strip().split()]\r\n num_of_shots: int = int(input().strip())\r\n\r\n for shot in range(num_of_shots):\r\n wire, position = [int(i) for i in input().strip().split()]\r\n \r\n wire -= 1\r\n left: int = position - 1;\r\n right: int = oskols[wire] - position;\r\n\r\n if wire != 0:\r\n oskols[wire - 1] += left\r\n \r\n if wire != (num_of_wires - 1):\r\n oskols[wire + 1] += right\r\n \r\n oskols[wire] = 0\r\n \r\n return \"\\n\".join([str(i) for i in oskols])\r\n\r\nproblem = Problem(\"Shaass_and_Oskols\")\r\n\r\nif __name__ == \"__main__\":\r\n solution: Union[str, int, float] = problem.solution()\r\n print(solution)\r\n\r\n", "n=int(input())\na = list(map(int,input().strip().split()))[:n]\ndict={}\nfor i in range(1,n+1):\n dict.update({int(i):a[i-1]})\nm=int(input())\nfor i in range (0,m):\n x,y=input().split()\n x=int(x)\n y=int(y)\n if(x!=1):\n dict[x-1]=dict[x-1]+y-1\n if(x!=n):\n dict[x+1]=dict[x+1]+dict[x]-y\n dict[x]=0\nfor i in range(1,n+1):\n print(dict[i])\n \t\t\t\t \t \t \t \t\t \t \t\t \t \t\t", "n = int(input())\r\nwires = input().split()\r\nwires = [int(x) for x in wires]\r\nm = int(input())\r\nfor i in range(m):\r\n coordinate = input().split()\r\n x = int(coordinate[0])-1\r\n y =int(coordinate[1])\r\n right = wires[x] - y\r\n left = y-1\r\n\r\n if x -1 >=0:\r\n wires[x-1] += left\r\n if x+1 < n:\r\n wires[x+1] += right\r\n wires[x] =0\r\n\r\nfor bird in wires:\r\n print(bird)\r\n ", "n, A = int(input()), [0] + list(map(int, input().split())) + [0]\r\n\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n A[x - 1], A[x], A[x + 1] = A[x - 1] + y - 1, 0, A[x + 1] + A[x] - y\r\n\r\nprint(*A[1:-1])", "n = int(input(\"\"))\r\na = [int(x) for x in input(\"\").split()]\r\nm = int(input(\"\"))\r\n# shots = []\r\nfor i in range(m):\r\n x, y = [int(x) for x in input(\"\").split()]\r\n if x-1-1 >= 0:\r\n a[x-1-1] += (y - 1)\r\n if x < n:\r\n a[x] += a[x-1] - y;\r\n a[x-1] = 0\r\nprint(*a)\r\n \r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nif n == len(a):\r\n m = int(input())\r\n for i in range(m):\r\n x, y = [int(i) for i in input().split()]\r\n x -=1\r\n if x != 0:\r\n a[x-1] += y-1\r\n if x != n -1:\r\n a[x+1] += a[x] - y\r\n a[x] = 0\r\n for i in a:\r\n print(i)", "n = int(input())\nmyList = list(map(int, input().split()))\n\n\nm = int(input())\n\nfor i in range(m):\n x, y = map(int, input().split())\n a = y-1\n b = myList[x-1]-y\n myList[x-1]=0\n if(x-2 >= 0):\n myList[x-2] += a\n if(x<n):\n myList[x] += b\nfor ans in myList:\n print(ans)\n \n\n\t\t\t \t \t\t\t \t \t \t \t\t\t\t \t \t\t\t", "def shaass_and_oskols(arr,shots,b):\r\n for i in range(shots):\r\n x=b[i][0]\r\n y=b[i][1]\r\n if x-2>=0:\r\n arr[x-2]=arr[x-2]+(y-1)\r\n if x<=(len(arr)-1):\r\n arr[x]=arr[x]+(arr[x-1]-y)\r\n arr[x-1]=0\r\n\r\n for i in range(len(arr)):\r\n print(arr[i])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn=int(input(''))\r\narr=list(map(int,input('').split()))\r\nshots=int(input(''))\r\nb=[]\r\nfor i in range(shots):\r\n a=list(map(int,input('').split()))\r\n b.append(a)\r\n\r\nshaass_and_oskols(arr,shots,b)", "n=int(input())\r\ns=[int(i) for i in input().split()]\r\na=int(input())\r\nfor i in range(a):\r\n c,b=[int(i) for i in input().split()]\r\n if c!=1:\r\n s[c-2]=s[c-2]+(b-1)\r\n if c!=n:\r\n s[c]=s[c]+s[c-1]-b\r\n s[c-1]=0\r\n \r\nfor i in range(n):\r\n print(s[i])", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n l = list(map(int, inp[1].split()))\r\n for s in inp[3:]:\r\n x, y = map(int, s.split())\r\n if x-2 >= 0: l[x-2] += y - 1\r\n if x < len(l): l[x] += l[x-1] - y\r\n l[x-1] = 0\r\n return l\r\n \r\nprint(*main(), sep='\\n')\r\n", "import sys\r\nimport heapq\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n n = int(input())\r\n a = [int(item) for item in input().split()]\r\n m = int(input())\r\n for _ in range(m):\r\n x,y = [int(item)-1 for item in input().split()]\r\n if(x+1 < n): a[x+1] += (a[x]-y-1)\r\n if(x > 0): a[x-1] += y\r\n a[x]=0\r\n for x in a:\r\n print(x)\r\n \r\n \r\nif __name__ == '__main__':\r\n main()", "n = int(input())\nlines = list(map(int, input().split()))\nfor _ in range(0, int(input())):\n x, y = map(int, input().split())\n x -= 1\n if x < n - 1:\n lines[x + 1] += lines[x] - y\n if x > 0:\n lines[x - 1] += y - 1\n lines[x] = 0\nprint(*lines, sep='\\n')\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = int(input())\r\nfor _ in range(m):\r\n x,y = map(int, input().split())\r\n\r\n if x != 1:\r\n l[x-2] += y-1\r\n\r\n if x != len(l):\r\n l[x] += l[x-1]-y\r\n \r\n l[x-1] = 0\r\nfor i in l:\r\n print(i)", "import itertools\r\nimport math\r\nfrom collections import defaultdict\r\n\r\ndef input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n n = int(input())\r\n a = input_ints()\r\n q = int(input())\r\n for i in range(q):\r\n x, y = input_ints()\r\n x -= 1\r\n if x:\r\n a[x - 1] += y - 1\r\n if x < n - 1:\r\n a[x + 1] += a[x] - y\r\n a[x] = 0\r\n for x in a:\r\n print(x)\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "wires = int(input())\r\nbirds = list(input().split(\" \"))\r\nshots = int(input())\r\nres = []\r\nfor i in range(len(birds)):\r\n res.append(int(birds[i]))\r\ni = 0\r\nwhile i < shots:\r\n shot = list(map(int, input().strip().split()))[:2]\r\n wire = shot[0]-1\r\n pos = shot[1]\r\n if 0 <= wire-1 < wires:\r\n res[wire-1] += pos - 1\r\n if 0 <= wire + 1 < wires:\r\n res[wire+1] += res[wire] - pos\r\n res[wire] = 0\r\n i += 1\r\nfor i in range(len(res)):\r\n print(res[i])\r\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn=read_int()\n\ta=[0]+read_ints()+[0]\n\tq=read_int()\n\twhile q>0:\n\t\tq-=1\n\t\tx,y=read_ints()\n\t\ta[x-1]+=y-1\n\t\ta[x+1]+=a[x]-y\n\t\ta[x]=0\n\tprint(\"\\n\".join(map(str, a[1:n+1])))\n\nsolve()\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n temp = list(map(int, input().split()))\r\n row = temp[0]-1\r\n if row > 0:\r\n lst[row-1] += temp[1]-1 \r\n if row < n -1:\r\n lst[row+1] += (lst[row]-temp[1])\r\n lst[row] = 0\r\n\r\nfor j in range(n):\r\n print(lst[j])", "n = int(input())-1\nwires = list(map(int, input().split()))\nshot = int(input())\n\nfor i in range(shot):\n \n x = list(map(int, input().split())) \n index = x[0]-1\n brid = x[1]\n if index > 0:\n wires[index-1] += (brid-1)\n\n if index < n:\n wires[index+1] += (wires[index]-brid)\n \n wires[index] = 0\n\nfor i in wires:\n print(i)", "n=int(input())\r\na=list(map(int, input().split()))\r\na.insert(0,0)\r\na.append(0)\r\nm=int(input())\r\nfor z in range(m):\r\n x,y=input().split()\r\n x=int(x)\r\n y=int(y)\r\n a[x-1]+=y-1\r\n a[x+1]+=a[x]-y\r\n a[x]=0\r\nfor i in range(1,n+1):\r\n print(a[i])", "def MovingBirds(l):\r\n for i in range(int(input())):\r\n line,bird=map(int,input().split())\r\n if line-2>=0:\r\n l[line-2]+=bird-1\r\n if line<len(l):\r\n l[line]+=l[line-1]-bird\r\n l[line-1]=0\r\n for i in l:\r\n print(i)\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nMovingBirds(l)\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\na=[0]+a+[0]\r\n\r\nk=int(input())\r\nfor q in range(k):\r\n x,y=map(int,input().split())\r\n #print(x)\r\n a[x+1]+=a[x]-y\r\n a[x-1]+=y-1\r\n a[x]=0\r\nfor i in range(1,n+1):\r\n print(a[i])\r\n ", "x=int(input())\r\ny=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n b,c =map(int,input().split())\r\n if (x==1):\r\n y[0]=0\r\n else:\r\n if (b==x or b==1):\r\n if (b==1):\r\n y[b]+=y[b-1]-c\r\n y[b-1]=0\r\n else:\r\n y[b-2]+=c-1 \r\n y[b-1]=0 \r\n else:\r\n y[b-2]+=c-1\r\n y[b]+=y[b-1]-c\r\n y[b-1]=0\r\nfor i in y:\r\n print(i) ", "n, A = int(input()), list(map(int, input().split()))\r\n\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if x > 1:\r\n A[x - 2] += y - 1\r\n if x < n:\r\n A[x] += A[x - 1] - y\r\n A[x - 1] = 0\r\n\r\nprint(*A, sep='\\n')", "size = int(input())\r\nnumbers = list(map(int, input().split()))\r\nnumbers = [0] + numbers\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if 0 <= x + 1 <= size:\r\n numbers[x + 1] += numbers[x] - y\r\n if 0 <= x - 1 <= size:\r\n numbers[x - 1] += y - 1\r\n numbers[x] = 0\r\nfor number in numbers[1:]:\r\n print(number)", "n = int(input())\r\nlistt = list(map(int, input().split( )))\r\nlistt = [0] + listt +[0]\r\nfire = int(input())\r\nfor i in range(fire):\r\n p,shot = map(int, input().split( ))\r\n if(shot <= listt[p]):\r\n right = listt[p] - shot\r\n if(right >= 0):\r\n left = shot-1\r\n if(p-1 >= 0):\r\n listt[p-1] +=left\r\n if(p+1 < len(listt)):\r\n listt[p+1] +=right\r\n listt[p] = 0\r\n else:\r\n listt[p-1] += listt[p]\r\n listt[p] = 0\r\n \r\nfor i in range(1,n+1):\r\n print(listt[i])\r\n \r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\nnShot = int(input())\r\ns = [list(map(int,input().split())) for i in range(nShot)]\r\nfor i in s:\r\n if(n>1):\r\n if(i[0]-1 ==0):\r\n R = sum([1 for p in range(i[1],a[i[0]-1])])\r\n a[i[0]] = a[i[0]] + R \r\n a[i[0]-1] = 0\r\n \r\n elif(i[0]==n):\r\n L = sum([1 for p in range(1,i[1])])\r\n a[i[0]-2] = a[i[0]-2] + L \r\n a[i[0]-1] = 0\r\n \r\n else:\r\n L = sum([1 for p in range(1,i[1])])\r\n R = sum([1 for p in range(i[1],a[i[0]-1])])\r\n a[i[0]-2] = a[i[0]-2] + L \r\n a[i[0]] = a[i[0]] + R \r\n a[i[0]-1] = 0\r\n else:\r\n a[i[0]-1] = 0\r\n[print(j) for j in a] \r\n \r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nm=int(input())\r\nfor i in range(m):\r\n x,y = map(int, input().split())\r\n right=a[x-1]-y\r\n left=y-1\r\n x=x-1\r\n if x!=0:\r\n a[x-1]+=left\r\n if x!=(n-1):\r\n a[x+1]+=right\r\n \r\n a[x]=0\r\n\r\n \r\n \r\nfor i in a:\r\n print(i)\r\n \r\n \r\n \r\n ", "n=int(input())\r\na=input().split()\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\nm=int(input())\r\nfor i in range(m):\r\n xy=input().split()\r\n if int(xy[0])!=n:\r\n a[int(xy[0])]+=a[int(xy[0])-1]-int(xy[1])\r\n a[int(xy[0])-1]=0\r\n if int(xy[0])!=1:\r\n a[int(xy[0])-2]+=int(xy[1])-1\r\n \r\nfor i in range(n):\r\n print(a[i])\r\n ", "# link: https://codeforces.com/contest/294/problem/A\r\n\r\nfor _ in range(1):\r\n n = int(input())\r\n b = list(map(int, input().split()))\r\n m = int(input())\r\n while m:\r\n m -= 1\r\n info = list(map(int, input().split()))\r\n at = info[0] - 1\r\n birds_going_up = info[1] - 1\r\n birds_going_down = b[at] - info[1]\r\n if at-1 >= 0:\r\n b[at-1] += birds_going_up\r\n if at+1 <= n-1:\r\n b[at+1] += birds_going_down\r\n b[at] = 0\r\n for i in b:\r\n print(i) ", "\r\n\r\n\r\nn = int(input())\r\n\r\nwires = list(map(int,input().split()))\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n\r\n x -= 1\r\n y -= 1\r\n\r\n E = y\r\n D = abs(y - (wires[x] - 1))\r\n\r\n wires[x] -= E + D + 1\r\n\r\n if x - 1 >= 0:\r\n wires[x-1] += E\r\n\r\n if x + 1 <= n - 1:\r\n wires[x+1] += D\r\n\r\n\r\nfor i in wires:\r\n print(i)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n x , y = map(int, input().split(' '))\r\n x -= 1\r\n if x != 0:\r\n l[x-1] += (y-1)\r\n if x != (n - 1):\r\n l[x+1] += (l[x] - y)\r\n l[x] = 0\r\nfor i in l:\r\n print(i)", "n=int(input())\r\np=list(map(int,input().split()))\r\nol=int(input())\r\nfor x in range(ol):\r\n c,v=list(map(int,input().split()))\r\n ka=c-1\r\n if ka-1>=0:\r\n kam=len(list(range(1,v)))\r\n p[ka-1]+=kam\r\n else:\r\n pass\r\n if ka+1<n:\r\n kam=len(list(range(v+1,p[ka]+1)))\r\n p[ka+1]+=kam\r\n else:\r\n pass\r\n p[ka]=0\r\nfor item in p:\r\n print(item)", "z=int(input())-1\r\nl=[int(i) for i in input().split()]\r\nflag=True\r\nfor j in range(int(input())):\r\n x,y=[int(i) for i in input().split()]\r\n x-=1\r\n val=l[x]\r\n if z==0:\r\n print(0)\r\n flag=False\r\n break\r\n if x==0:\r\n l[x]=0\r\n l[x+1]+=val-y\r\n elif x==z:\r\n l[x]=0\r\n l[x-1]+=y-1\r\n else:\r\n l[x]=0\r\n l[x-1]+=y-1\r\n l[x+1]+=val-y\r\nif flag:\r\n for i in l:\r\n print(i,end='\\n')", "\r\nn = int(input())\r\n\r\nfill = list(map(int, input().split()))\r\n\r\ninitial_configuration = dict(zip(range(1, n+1), fill))\r\nconfig = initial_configuration\r\n\r\nnum_of_shots = int(input())\r\nfor _ in range(num_of_shots):\r\n operation = list(map(int, input().split()))\r\n\r\n line, killled_index = operation[0], operation[1] \r\n to_left = abs(killled_index - 1)\r\n to_right = abs(killled_index - config[line])\r\n\r\n config[line] = 0\r\n if line-1 in config.keys():\r\n config[line - 1] += to_left\r\n if line+1 in config.keys():\r\n config[line + 1] += to_right\r\n\r\n\r\nfor val in config.values():\r\n print(val)\r\n\r\n", "def solve():\r\n n = int(input())\r\n wires = list(map(int, input().split()))\r\n m = int(input())\r\n for _ in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if x-1 >= 0:\r\n wires[x-1] += abs(y-1)\r\n if x+1 < n:\r\n wires[x+1] += abs(wires[x]-y)\r\n wires[x] = 0\r\n \r\n for i in wires:\r\n print(i)\r\n\r\nif __name__== \"__main__\":\r\n solve()", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n if x==1:\r\n if n>1:\r\n a[1]+=a[0]-y\r\n a[0]=0\r\n elif x==n:\r\n a[x-2]+=y-1\r\n a[x-1]=0\r\n else:\r\n a[x-2]+=y-1\r\n a[x]+=a[x-1]-y\r\n a[x-1]=0\r\nfor i in range(n):\r\n print(a[i])", "n=int(input());arr=list(map(int,input().split()))\r\nfor _ in range(int(input())):\r\n x,y=map(int,input().split())\r\n x-=1\r\n if x != 0:\r\n arr[x-1]+=y-1\r\n if x != n-1:\r\n arr[x+1]+=arr[x]-y\r\n arr[x]=0\r\nfor i in arr:\r\n print(i)", "n = int(input())\r\nbirds_per_line = list(map(int, input().split()))\r\nshoots_num = int(input())\r\nwhile shoots_num != 0:\r\n wire_index, bird_index = list(map(int, input().split()))\r\n \r\n #increas left\r\n if wire_index != 1:\r\n birds_per_line[wire_index-2] += bird_index-1\r\n\r\n #increas right\r\n if wire_index != n:\r\n birds_per_line[wire_index] += birds_per_line[wire_index-1]-bird_index\r\n\r\n birds_per_line[wire_index-1] = 0\r\n shoots_num -= 1\r\n\r\nfor i in birds_per_line:\r\n print(i)", "w = int(input())\r\nwires = [0] + [int(x) for x in input().split()] + [0]\r\nfor o in range(int(input())):\r\n (i, p) = (int(x) for x in input().split())\r\n wires[i-1] += p - 1\r\n wires[i+1] += wires[i] - p\r\n wires[i] = 0\r\nfor w in wires[1:w+1]:\r\n print(w)", "n = int(input())\r\nwires = input().split()\r\nm = int(input())\r\nx = []\r\ny = []\r\nnew_wires = []\r\nfor i in range(m):\r\n xy = input().split()\r\n x.append(int(xy[0]))\r\n y.append(int(xy[1]))\r\nfor i in range(m):\r\n wire = x[i]\r\n if wire in range(n):\r\n wires[wire] = int(wires[wire]) + int(wires[wire - 1]) - y[i]\r\n if (wire - 2) >= 0:\r\n wires[wire - 2] = int(wires[wire - 2]) + y[i] - 1\r\n wires[wire - 1] = 0\r\nfor item in wires:\r\n print(item)", "n=int(input())\r\nl=[0]\r\nk=[int(x) for x in input().split()]\r\nl=l+k\r\nm=int(input())\r\nfor _ in range(m):\r\n w,b=[int(x) for x in input().split()]\r\n if w-1>0:\r\n l[w-1]+=b-1\r\n if w+1<=n:\r\n l[w+1]+=l[w]-b\r\n l[w]=0\r\nfor i in range(1,len(l)):\r\n print(l[i])", "def main():\r\n wires=input()\r\n numberOfBirds=input()\r\n numberOfShots=input()\r\n listOfBirds=numberOfBirds.split()\r\n \r\n for i in range (int(numberOfShots)):\r\n shotPlace=input()\r\n Places=shotPlace.split()\r\n wireChoosen=int(Places[0])-1\r\n birdShotted=int(Places[1])\r\n upperBirds=birdShotted-1\r\n lowerBirds=int(listOfBirds[wireChoosen])-birdShotted\r\n listOfBirds[wireChoosen]=0\r\n if(wireChoosen-1!=-1): \r\n listOfBirds[wireChoosen-1]=int(listOfBirds[wireChoosen-1])+upperBirds\r\n if(wireChoosen+1!=len(listOfBirds)): \r\n listOfBirds[wireChoosen+1]=int(listOfBirds[wireChoosen+1])+lowerBirds\r\n\r\n for i in listOfBirds:\r\n print(i)\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n", "number_of_wires = int(input())\nbirds_per_wire = [int(x) for x in input().split()]\nfor shot in range(int(input())):\n wire, bird_position = map(int, input().split())\n wire_index = wire - 1\n if wire_index != 0:\n birds_per_wire[wire_index - 1] += bird_position - 1\n if wire_index != number_of_wires - 1:\n birds_per_wire[wire_index + 1] += birds_per_wire[wire_index] - bird_position\n birds_per_wire[wire_index] = 0\nfor birds in birds_per_wire:\n print(birds)\n", "n = int(input()) \r\na = [int(a) for a in input().split()[:n]]\r\nm = int(input()) \r\nfor line in range(m): \r\n x,y = [int(x) for x in input().split()] \r\n down = a[x-1] - y \r\n up = y-1 \r\n a[x-1] = 0\r\n if x < len(a):\r\n a[x] = a[x] + down \r\n if x > 1:\r\n a[x-2] = a[x-2] + up \r\n \r\n\r\nfor i in a: \r\n print(i)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nfor i in range(m):\r\n\tx,y=input().split()\r\n\tx=int(x)\r\n\ty=int(y)\r\n\tif x!=1:\r\n\t\tl[x-2]+=y-1\r\n\tif x!=n:\r\n\t\tl[x]+=l[x-1]-y\r\n\tl[x-1]=0\r\nfor i in l:\r\n\tprint(i)", "\"\"\"609C\"\"\"\r\n# import math\r\ndef main():\r\n\tn = int(input())\r\n\ta = list(map(int,input().split()))\r\n\tm = int(input())\r\n\tfor i in range(m):\r\n\t\tx,y = map(int,input().split())\r\n\t\tx = x-1\r\n\t\tif x-1>=0:\r\n\t\t\ta[x-1] += y-1\r\n\t\tif x+1<n:\r\n\t\t\ta[x+1] += a[x]-y\r\n\t\ta[x]=0\r\n\tfor i in range(len(a)):\r\n\t\tprint(a[i]) \r\n\r\n\r\nmain()", "n=int(input())\r\narr=list(map(int, input().split()))\r\nkill=int(input())\r\nfor m in range(kill):\r\n i,j=list(map(int, input().split()))\r\n i-=1\r\n if i!=n-1: arr[i+1]+=arr[i]-j\r\n if i!=0:arr[i-1]+=j-1\r\n arr[i]=0\r\nprint(*arr,sep=\"\\n\")\r\n \r\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\ndef shaass_and_oskols(a, xy, n):\r\n for xy_i in xy:\r\n x, y = xy_i\r\n i_l, i_r = x - 2, x\r\n if i_l >= 0 :\r\n a[i_l] += y - 1\r\n if i_r < n:\r\n a[i_r] += a[x - 1] - y\r\n a[x - 1] = 0\r\n return '\\n'.join(str(a_i) for a_i in a)\r\n\r\nn = int(input())\r\na = [int(a_i) for a_i in input().split()]\r\nm = int(input())\r\nxy = [[int(xy_i) for xy_i in input().split()] for _ in range(m)]\r\nans = shaass_and_oskols(a, xy, n)\r\nprint(ans)\r\n", "x=int(input())\r\nk=list(map(int, input().split()))\r\ny=int(input())\r\ni=1\r\nfor i in range(y):\r\n h1,h2=map(int, input().split())\r\n h1=h1-1\r\n if h1==x-1:\r\n k[h1-1]+=h2-1\r\n k[h1]=0\r\n elif h1==0 :\r\n k[h1+1]+=k[h1]-h2\r\n k[h1]=0\r\n else:\r\n k[h1+1]+=k[h1]-h2\r\n k[h1-1]+=h2-1\r\n k[h1]=0\r\n\r\n \r\nprint('\\n'.join(map(str,k)))\r\n\r\n \r\n \r\n \r\n", "from itertools import product\r\nfrom math import ceil\r\nfrom fractions import Fraction\r\n\r\ndef binary_table(string_with_all_characters, length_to_make):\r\n return [''.join(x) for x in product(string_with_all_characters, repeat=length_to_make)]\r\n\r\n\r\ndef all_possible_substrings(string):\r\n return [int(string[i: j]) for i in range(len(string)) for j in range(i + 1, len(string) + 1)]\r\n\r\n\r\ndef number_of_substrings(length):\r\n return int(length * (length + 1) / 2)\r\n\r\n\r\ndef is_prime(num):\r\n for i in range(2, num):\r\n if num / i == int(num / i) and num != i:\r\n return False\r\n\r\n return True\r\n\r\n\r\n\"\"\"for enumeration in range(int(input())):\r\n\"\"\"\r\n\r\nnum_of_lines = int(input())\r\n\r\nbirds_and_lines = list(map(int, input().split()))\r\n\r\nnum_of_shots = int(input())\r\n\r\n\r\nfor i in range(num_of_shots):\r\n x, y = map(int, input().split())\r\n line_num = x - 1\r\n num_of_birds = birds_and_lines[line_num]\r\n birds_to_left = y - 1\r\n birds_to_right = num_of_birds - y\r\n birds_and_lines[line_num] -= 1\r\n if x + 1 > len(birds_and_lines):\r\n birds_and_lines[line_num] -= birds_to_right\r\n else:\r\n birds_and_lines[line_num + 1] += birds_to_right\r\n birds_and_lines[line_num] -= birds_to_right\r\n if x - 1 == 0:\r\n birds_and_lines[line_num] -= birds_to_left\r\n else:\r\n birds_and_lines[line_num - 1] += birds_to_left\r\n birds_and_lines[line_num] -= birds_to_left\r\n #print(line_num, num_of_birds, birds_to_left, birds_to_right)\r\nfor i in birds_and_lines:\r\n print(i)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nxy = []\r\nfor i in range(m):\r\n xy.append([int(i) for i in input().split()])\r\n\r\nfor j in xy:\r\n if j[0] - 2 >= 0:\r\n a[j[0] - 2] += j[1] - 1\r\n if j[0] < n:\r\n a[j[0]] += a[j[0] - 1] - j[1]\r\n\r\n a[j[0] - 1] = 0\r\nfor k in a:\r\n print(k)", "t = int(input())\r\nbird = [int(x) for x in input().split()]\r\nshots = int(input())\r\nfor i in range(shots):\r\n a = [int(x) for x in input().split()]\r\n x = a[0]-1\r\n y = a[1]\r\n if x != 0:\r\n bird[x-1] += y-1\r\n if x != t-1:\r\n bird[x+1] += bird[x] - y\r\n bird[x] = 0\r\n \r\nfor val in bird:\r\n print(val, end=\"\\n\")\r\n", "n = int(input())\r\nbirds = input().split()\r\n\r\nbirds = [int(x) for x in birds]\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n x = 0\r\n y = 0\r\n\r\n temp = input().split()\r\n\r\n temp = [int(d) for d in temp]\r\n\r\n x = temp[0]\r\n y = temp[1]\r\n\r\n x -= 1\r\n\r\n if x != 0:\r\n birds[x-1] += y-1\r\n\r\n if x != n - 1:\r\n birds[x+1] += birds[x] - y\r\n\r\n birds[x] = 0\r\n\r\n\r\nfor i in birds:\r\n print(i)\r\n\r\n\r\n", "NumberOfWires = int(input())\r\n#print(NumberOfWires)\r\n\r\nNumberOfBirds = input().split()\r\n#print(NumberOfBirds)\r\nfor i in range(0, len(NumberOfBirds)):\r\n NumberOfBirds[i] = int(NumberOfBirds[i])\r\n#print(NumberOfBirds)\r\n\r\nShots = int(input())\r\n#print(Shots)\r\n\r\nWireShot=[]\r\nBirdShot=[]\r\nfor i in range(0,Shots):\r\n temp = input().split()\r\n WireShot.append(temp[0])\r\n BirdShot.append(temp[1])\r\nfor i in range(0, len(WireShot)):\r\n WireShot[i] = int(WireShot[i])\r\nfor i in range(0, len(BirdShot)):\r\n BirdShot[i] = int(BirdShot[i])\r\n#print(WireShot)\r\n#print(BirdShot)\r\n\r\nfor i in range(Shots):\r\n temp= NumberOfBirds[WireShot[i]-1]\r\n one= BirdShot[i] -1\r\n two= temp-BirdShot[i]\r\n if (two < 0):\r\n two = 0\r\n NumberOfBirds[WireShot[i]-1]=0\r\n try:\r\n if( (WireShot[i]- 2) >=0):\r\n NumberOfBirds[WireShot[i]- 2] += one\r\n except:\r\n m=0\r\n try:\r\n if(WireShot[i]>=0):\r\n NumberOfBirds[WireShot[i]] += two\r\n except:\r\n m=0\r\n\r\nfor i in NumberOfBirds:\r\n print(i)\r\n\r\n", "def get_num(h, m):\r\n\r\n for i in m:\r\n x = i[0]\r\n y = i[1]\r\n if x != 1:\r\n h[x-1] += y - 1\r\n if x != len(h):\r\n h[x+1] += h[x] - y\r\n h[x] = 0\r\n \r\n # count the birds on each line\r\n return h\r\n\r\nif __name__ == '__main__':\r\n n = int(input()) # num of wires\r\n birds = list(map(int, input().split())) # birds on each wire\r\n\r\n # compsing a dictionary of line: num_of_birds\r\n h = {} # to pass the function\r\n for i in range(1, n+1):\r\n h[i] = birds[i-1]\r\n\r\n shots = int(input())\r\n\r\n lines_birds = [] # [line_index , bird_index]\r\n for i in range(shots):\r\n lines_birds.append(list(map(int, input().split())))\r\n\r\n new_h = get_num(h, lines_birds)\r\n for value in new_h.values():\r\n print(value)\r\n", "wires = input()\r\n\r\nw = []\r\nw = input().split(\" \")\r\nbirds_Wires = w[:int(wires)]\r\n\r\nshots = input()\r\n\r\nopration = []\r\n\r\nfor i in range(0, int(shots)):\r\n x_y = input().split(\" \")\r\n\r\n opration.append(tuple(x_y))\r\n\r\nfor shot in opration:\r\n x = int(shot[0])\r\n y = int(shot[1])\r\n\r\n birds = int(birds_Wires[x-1])\r\n\r\n birds_Wires[x-1] = 0\r\n\r\n left = birds - (birds-y+1)\r\n right = birds - y\r\n\r\n if (x-1) + 1 == len(birds_Wires):\r\n right = 0\r\n if (x-1) - 1 == -1:\r\n left = 0\r\n if (x-1) - 1 != -1:\r\n birds_Wires[(x-1)-1] = int(birds_Wires[(x-1)-1]) + left\r\n if (x-1) + 1 != len(birds_Wires):\r\n birds_Wires[(x-1)+1] = int(birds_Wires[(x-1)+1]) + right\r\n\r\nfor i in birds_Wires:\r\n print(i)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.insert(0, 0)\r\na.append(0)\r\nm = int(input())\r\nfor i in range(m):\r\n #х - номер провода, у - номер птицы\r\n x, y = map(int, input().split())\r\n a[x - 1] += y - 1\r\n a[x + 1] += a[x] - y\r\n a[x] = 0\r\ndel a[0]\r\na.pop()\r\nfor i in a:\r\n print(i)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "number_of_wires = int(input())\r\nbirds = list(map(int,input().split()))\r\nshots = int(input())\r\nshot_list = []\r\nfor i in range (shots):\r\n temporary_list = []\r\n x , y = map(int,input().split())\r\n temporary_list.append(x)\r\n temporary_list.append(y)\r\n shot_list.append(temporary_list)\r\n\r\nfor i in range(shots):\r\n x = shot_list[i][0]\r\n if x > 1:\r\n birds[x - 2] += shot_list[i][1] - 1\r\n if x < len(birds):\r\n birds[x] += birds[x - 1] - shot_list[i][1]\r\n birds[x-1] = 0\r\n\r\nfor i in range (len(birds)):\r\n print(birds[i])", "wires_num = int(input())\r\nwires_birds = [int(birds) for birds in input().split(\" \")]\r\nshots = int(input())\r\n\r\nfor shot in range(shots):\r\n x, y = [int(num) for num in input().split(\" \")]\r\n wire_index = x - 1\r\n wire_birds = wires_birds[wire_index]\r\n wires_birds[wire_index] = 0\r\n left_birds = y - 1\r\n right_birds = wire_birds - y\r\n if wire_index -1 >= 0:\r\n wires_birds[wire_index - 1] += left_birds\r\n\r\n if wire_index + 1 < len(wires_birds):\r\n wires_birds[wire_index + 1] += right_birds\r\n\r\nfor wire in wires_birds:\r\n print(wire)", "import sys\ninput = sys.stdin.readline\n\ndef inpit(): #int\n return(int(input()))\ndef inplt(): #list \n return(list(map(int,input().split())))\ndef inpstr(): #string\n s = input()\n return(list(s[:len(s) - 1]))\ndef inpspit(): #spaced intergers \n return(map(int,input().split()))\n\n\nn = inpit()\nb = inplt()\nm = inpit()\nl = []\nfor i in range(m):\n l.append(inplt())\n\nfor i in l: \n c = i[0] -1\n p = i[1]\n if(c != 0):\n b[c-1] += p -1 \n if(c != n-1):\n b[c+1] += b[c] -p\n b[c ] = 0\n \nfor i in b:\n print(i)", "n = int(input()) #number of wires\na = list(map(int, input().split())) #number of birds on ith wire\nm = int(input()) #shot birds\ns = [] #list of on WHICH line and WHICH bird no from left shot\nfor i in range(m):\n x = list(map(int, input().split()))\n s.append(x)\n\nfor i in range(len(s)):\n \n if s[i][0] - 1 == 0 and s[i][0] - 1 == n - 1:\n pass\n elif s[i][0] - 1 == 0:\n a[s[i][0]] = a[s[i][0]] + a[s[i][0] - 1] - s[i][1]\n elif s[i][0] - 1 == n - 1:\n a[s[i][0] - 2] = a[s[i][0] - 2] + s[i][1] - 1\n else:\n a[s[i][0] - 2] = a[s[i][0] - 2] + s[i][1] - 1\n a[s[i][0]] = a[s[i][0]] + a[s[i][0] - 1] - s[i][1]\n\n a[s[i][0] - 1] = 0\n\nfor i in range(n):\n print(a[i])", "n=int(input())\na=list(map(int,input().split()))\nfor i in range(int(input())):\n x,y=map(int,input().split())\n if x-1!=0:\n a[x-2]+=(y-1)\n if x+1<=n:\n a[x]+=(a[x-1]-y)\n a[x-1]=0\nfor i in a:\n print(i)", "from collections import deque\r\n \r\nlines = [w.rstrip() for w in open(0).readlines()]\r\ndeq = deque(lines)\r\nn = int(deq.popleft())\r\nlst = list(map(int, deq.popleft().split()))\r\ns = int(deq.popleft())\r\nfor _ in range(s):\r\n a, b = map(int, deq.popleft().split())\r\n a -= 1\r\n L, R = b - 1, lst[a] - b \r\n if 0 <= a-1 <= n-1: lst[a-1] += L \r\n lst[a] = 0\r\n if 0 <= a+1 <= n-1: lst[a+1] += R \r\nprint(\"\\n\".join(str(x) for x in lst))", "n = int(input())\r\nwires=[int(i) for i in input().split()]\r\nm = int(input())\r\nfor i in range(0, m):\r\n x, y = map(int, input().split(' '))\r\n x=x-1\r\n if x != 0:\r\n wires[x-1] += y-1\r\n if x != n-1:\r\n wires[x+1] += wires[x] - y\r\n wires[x] = 0\r\n\r\nfor j in range(0, n):\r\n print(wires[j])\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\nm = int(input())\r\nq = [map(int, input().split(' ')) for _ in range(m)]\r\n\r\nfor i in range(m):\r\n\r\n ith, kth = q[i]\r\n ith -= 1\r\n\r\n if ith - 1 >= 0:\r\n\r\n a[ith - 1] += (kth - 1)\r\n\r\n if ith + 1 < n:\r\n\r\n a[ith + 1] += (a[ith] - kth)\r\n\r\n a[ith] = 0\r\n\r\nfor i in range(n):\r\n print(a[i])\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nlst=[0]+lst\r\nfor _ in range(int(input())):\r\n i,shot=map(int,input().split())\r\n if i==n:\r\n lst[i-1]+=shot-1\r\n lst[i]=0\r\n\r\n elif i==1:\r\n lst[i+1]+=lst[i]-shot\r\n lst[i]=0\r\n\r\n else:\r\n lst[i-1]+=shot-1\r\n lst[i+1]+=lst[i]-shot\r\n lst[i]=0\r\nprint(*lst[1:],sep=\"\\n\")\r\n", "n = int(input())\r\narr = [0] + list(map(int, input().split())) + [0]\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n arr[x-1] += y - 1\r\n arr[x+1] += arr[x] - y\r\n arr[x] = 0\r\nprint('\\n'.join(map(str, arr[1:-1])))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nfor _ in range(m):\r\n x,y=map(int,input().split())\r\n x=x-1\r\n if x>0:\r\n a[x-1]+=(y-1)\r\n if x<n-1:\r\n a[x+1]+=(a[x]-y)\r\n a[x]=0\r\n\r\nfor i in a:\r\n print(i)\r\n \r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nfor x in range(int(input())):\r\n a,b = map(int, input().split())\r\n if a - 2 >= 0: l[a - 2] += b - 1\r\n if a < n: l[a] += l[a - 1] - b\r\n l[a - 1] = 0\r\nprint(*l)\r\n", "wires=int(input())\r\nbirds=list(map(int,input().split(\" \")))\r\nshoots=int(input())\r\nshooted=[]\r\nfor i in range(shoots):\r\n shooted.append(list(map(int,input().split(\" \"))))\r\nfor i in range(shoots):\r\n wire=shooted[i][0]-1\r\n right=birds[wire]-shooted[i][1]\r\n left=birds[wire]-right-1\r\n if wire>0:\r\n birds[wire - 1]+=left\r\n if wire<len(birds)-1:\r\n birds[wire+1]+=right\r\n birds[wire]=0\r\nfor i in birds:\r\n print(i)", "kprvda = int(input())\r\nprovoda = list(map(int, input().split(\" \")))\r\nkilled = int(input())\r\nfor i in range(killed):\r\n x, y = map(int, input().split(\" \"))\r\n up = y-1\r\n dn = provoda[x-1] - y\r\n provoda[x - 1] -=1\r\n if(x-2) == -1:\r\n provoda[x - 1] -=up\r\n else:\r\n provoda[x-2] += up\r\n provoda[x - 1] -=up\r\n\r\n if x == kprvda:\r\n provoda[x - 1] -= dn\r\n\r\n else:\r\n provoda[x] += dn\r\n provoda[x - 1] -= dn\r\n\r\nfor i in range(0, kprvda,1):\r\n print(provoda[i])", "# tc = int(input())\r\nfor i in range(1):\r\n n = int(input())\r\n li =list(map(int,input().split()))\r\n x = int(input())\r\n ans = 0\r\n for i in range(x):\r\n lix = list(map(int,input().split()))\r\n\r\n if lix[0]-2>=0:\r\n li[lix[0]-2] += lix[1]-1\r\n if lix[0]<n: \r\n li[lix[0]] += li[lix[0]-1]-lix[1]\r\n li[lix[0]-1] = 0\r\n \r\n \r\n\r\n\r\n for i in li:\r\n print(i)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(): # one integer input\r\n return(int(input()))\r\ndef inlt(): # list input\r\n return(list(map(int,input().split())))\r\ndef insr(): # string input\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr(): # muliple integer variables input\r\n return(map(int,input().split()))\r\n\r\nwires = inp()\r\nbirds = inlt()\r\nshot = input()\r\n\r\nfor i in range(int(shot)):\r\n x, y = invr()\r\n x -= 1\r\n if x > 0:\r\n birds[x-1] += y-1\r\n if x < wires - 1:\r\n birds[x+1] += birds[x] - y\r\n birds[x] = 0\r\n\r\nfor wire in range(len(birds)):\r\n print(birds[wire])\r\n ", "n=int(input())\r\na=input()\r\na=a.split()\r\nfor i in range(n): a[i]=int(a[i])\r\nm=int(input())\r\nfor i in range(m):\r\n z=input()\r\n x=int(z.split()[0])\r\n y=int(z.split()[1])\r\n L=y-1\r\n R=a[x-1]-L-1\r\n a[x-1]=0\r\n if x!=1: a[x-2]+=L\r\n if x!=n: a[x]+=R\r\nfor i in range(len(a)):\r\n print(a[i])\r\n \r\n", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\narr = list(map(int,stdin.readline().split()))\r\nm = int(stdin.readline())\r\ninp = []\r\nfor _ in range(m):\r\n x,y = map(int,stdin.readline().split())\r\n inp.append([x,y])\r\nfor i in inp:\r\n x,y = i[0],i[1]\r\n if x!=1:\r\n arr[x-2] += y-1\r\n if x!=n:\r\n arr[x] += arr[x-1]-y\r\n arr[x-1]=0\r\nfor i in arr:\r\n stdout.write(str(i)+'\\n')\r\n", "# link: https://codeforces.com/contest/294/problem/A\r\n\r\nn_wires = int(input())\r\nn_birds_lst = list(map(int, input().split()))\r\n\r\nn_shoots = int(input())\r\nfor i in range(n_shoots):\r\n idx_wire, idx_bird = (int(x) for x in input().split())\r\n\r\n idx_wire = idx_wire - 1 # make it zero-indexing\r\n idx_bird = idx_bird - 1 # make it zero-indexing\r\n\r\n n_birds_on_left = idx_bird\r\n n_birds_on_right = n_birds_lst[idx_wire] - 1 - n_birds_on_left\r\n\r\n if idx_wire > 0:\r\n n_birds_lst[idx_wire - 1] += n_birds_on_left\r\n\r\n if idx_wire < (n_wires - 1):\r\n n_birds_lst[idx_wire + 1] += n_birds_on_right\r\n\r\n n_birds_lst[idx_wire] = 0\r\n\r\nfor i in range(n_wires):\r\n print(n_birds_lst[i])\r\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n p,k = list(map(int,input().split()))\r\n p-=1\r\n tempp = lst[p]- k\r\n tempm = lst[p] - tempp -1\r\n if p-1 >=0 and p+1 < n:\r\n lst[p-1] += tempm\r\n lst[p+1] += tempp\r\n elif p+1 < n:\r\n lst[p+1] += tempp\r\n elif p-1 >=0:\r\n lst[p-1] += tempm\r\n lst[p] = 0\r\nfor i in range(n):\r\n print(lst[i])\r\n", "n=int(input())\nw=[0] + input().split() + [0]\nw=list(map(int, w))\nm=int(input())\nfor i in range(1,m+1):\n x,y=input().split()\n x=int(x)\n y=int(y)\n temp=w[x]\n w[x]=0\n w[x-1]+=y-1\n w[x+1]+=temp-y\nfor i in range(1,len(w)-1):\n print(w[i])", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n xi, yi = map(int, input().split())\r\n xi -= 1\r\n if xi > 0:\r\n a[xi-1] += yi-1\r\n if xi < n-1:\r\n a[xi+1] += a[xi] - yi\r\n a[xi] = 0\r\n\r\nfor x in a:\r\n print(x)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n right=a[x-1]-y\r\n left=y-1\r\n x=x-1\r\n if x!=0:\r\n a[x-1]+=left\r\n if x!=(n-1):\r\n a[x+1]+=right\r\n \r\n a[x]=0\r\n \r\n \r\n \r\nfor i in a:\r\n print(i)", "n = int(input())\r\nnum_birds = list(map(int, input().split()))\r\nm = int(input())\r\nfor _ in range(m):\r\n wire, bird = map(int, input().split())\r\n left_birds = bird - 1\r\n right_birds = num_birds[wire - 1] - bird\r\n num_birds[wire - 1] = 0\r\n if wire > 1:\r\n num_birds[wire - 2] += left_birds\r\n if wire < n:\r\n num_birds[wire] += right_birds\r\nfor i in num_birds:\r\n print(i)", "def i(): return [*map(int, input().split())]\r\nn = i()[0]\r\na = [0]+i()+[0]\r\nfor _ in [0]*i()[0]:\r\n x, y = i()\r\n a[x-1] += y-1\r\n a[x+1] += a[x]-y\r\n a[x] = 0\r\nprint(*a[1:n+1],sep='\\n')", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\n\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tx-=1\r\n\t#a[x]-=1\r\n\tleft=0\r\n\tright=0\r\n\tif x!=0:\r\n\t\tleft=y-1\r\n\t\ta[x-1]+=left\r\n\tif x!=n-1:\r\n\t\tright=a[x]-y\r\n\t\ta[x+1]+=right\r\n\ta[x]=0\r\nfor i in range(n):\r\n\tprint(a[i])", "\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n lst = list(map(int,input().split()))\r\n m = int(input())\r\n for i in range(m):\r\n x,y = map(int,input().split())\r\n x -= 1\r\n a = lst[x] - y\r\n b = y - 1\r\n if x == n-1:\r\n lst[x-1] += b\r\n elif x == 0:\r\n lst[x+1] += a\r\n else:\r\n lst[x+1] += a\r\n lst[x-1] += b\r\n lst[x] = 0\r\n for l in lst:\r\n print(l)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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 operator as op\r\nimport re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom functools import reduce\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\ndef def_value():\r\n return 0\r\n\r\n\r\nn = inp()\r\na = [0]\r\na += inlist()\r\n\r\nm = inp()\r\nfor _ in range(m):\r\n x, y = invr()\r\n\r\n if x - 1 > 0:\r\n a[x-1] += (y-1)\r\n if x + 1 <= n:\r\n a[x+1] += a[x] - y\r\n a[x] = 0\r\nfor i in range(1, n+1):\r\n print(a[i])\r\n", "n = int(input())\r\nli = list(map(int, input().split()))\r\nli.insert(0, \"\")\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if(x+1 <= n):\r\n li[x+1] += (li[x] - y)\r\n if(x-1 >= 1):\r\n li[x-1] += (y-1)\r\n li[x] = 0\r\nfor i in li:\r\n print(i)", "#https://codeforces.com/contest/294/problem/A\r\n\r\nl = input()\r\n\r\ninitial = [int(i) for i in input().split(' ')]\r\n\r\nshots= int(input())\r\n\r\nfor i in range(shots):\r\n wire,pos=input().split(' ')\r\n wire=int(wire)-1\r\n pos=int(pos)\r\n\r\n\r\n\r\n #stanga sar jos (i-1) toate pana la pos\r\n jumpDown=pos-1\r\n\r\n # dreapta sar sus (i+1) toate dupa pos\r\n jumpUP = initial[wire]-pos\r\n\r\n\r\n if(wire-1>=0):\r\n initial[wire-1]+=jumpDown\r\n if(wire+1<len(initial)):\r\n initial[wire+1]+=jumpUP\r\n\r\n initial[wire]=0\r\n\r\nfin=''\r\nfor i in initial:\r\n fin+=str(i)+' '\r\n\r\nprint(fin[:-1])\r\n", "lin=int(input())\r\nlislin=list(map(int,input().split()))\r\nt=int(input())\r\nll,rl=0,lin-1\r\nfor i in range(t):\r\n x,y=list(map(int,input().split()))\r\n l=y-1\r\n r=lislin[x-1]-y\r\n # print(\"x= \",lislin[x-1],\" l= \",l,\" r=\",r)\r\n if x-2>=ll:lislin[x-2]+=l\r\n if x<=rl: lislin[x]+=r\r\n lislin[x-1]=0\r\n # print(\"x-1= \",lislin[x-2],\" x=\",lislin[x-1], \" x+1=\",lislin[x])\r\n\r\nfor i in lislin:\r\n print(i)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nm=int(input())\r\nfor i in range(m):\r\n x, y = [int(i) for i in input().split()]\r\n if x<n:\r\n a[x]+= a[x-1]-y\r\n if -1<x-2:\r\n a[x-2]+=y-1\r\n a[x-1]=0\r\nfor i in a:\r\n print(i)", "n = int (input ())\r\n\r\n\r\na = input ().split ()\r\na = [int (i) for i in a]\r\n\r\ns = int (input ())\r\n\r\nfor i in range (s):\r\n rgt = 0\r\n lft = 0\r\n\r\n x, y = input ().split ()\r\n x, y = int (x), int (y)\r\n x -=1\r\n\r\n rgt = a[x] - y\r\n lft = a[x] - (rgt + 1)\r\n a[x] = 0\r\n\r\n try:\r\n a[x + 1] += rgt\r\n except IndexError:\r\n a[x] += 0\r\n\r\n if x - 1 < 0:\r\n a[x] +=0\r\n else:\r\n a[x - 1] += lft\r\n\r\n\r\nfor i in range (n):\r\n print (a[i])", "lines = int(input())\r\nbirds = list(map(int, input().split()))\r\nshots = int(input())\r\nfor _ in range(shots):\r\n i, po = map(int, input().split())\r\n if i != lines:\r\n birds[i] = birds[i] + birds[i-1] - po\r\n if i != 1:\r\n birds[i-2] = birds[i-2] + po - 1\r\n\r\n birds[i - 1] = 0\r\n\r\nfor num in birds:\r\n print(num)\r\n", "rows = int(input())\r\nbirdsOnRow = [int(i) for i in input().split()]\r\nshots = int(input())\r\nfor _ in range(shots):\r\n row, bird = [int(i) for i in input().split()]\r\n row -= 1\r\n bird -= 1\r\n left = (birdsOnRow[row] - 1) - bird\r\n right = (birdsOnRow[row] - 1) - left\r\n birdsOnRow[row] = 0\r\n if row+1 <= len(birdsOnRow) - 1:\r\n birdsOnRow[row + 1] += left\r\n if row-1 >= 0:\r\n birdsOnRow[row - 1] += right\r\nfor _ in birdsOnRow:\r\n print(_)", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr = [0] + arr + [0]\r\ncases = int(input())\r\nwhile cases:\r\n cases -= 1\r\n a, b = map(int, input().split())\r\n arr[a-1] += (b - 1)\r\n arr[a+1] += (arr[a] - b)\r\n arr[a] = 0\r\nfor i in arr[1:-1]:\r\n print(i)\r\n\r\n", "# https://codeforces.com/contest/294/problem/A\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nfor i in range(int(input())):\r\n line, pos = list(map(int, input().split()))\r\n\r\n if line > 1:\r\n l[line - 2] += pos - 1\r\n \r\n if line < n:\r\n l[line] += l[line - 1] - pos\r\n \r\n l[line - 1] = 0\r\n\r\nfor i in l:\r\n print(i)", "import sys\r\nimport math\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\n3\r\n3 2\r\n5 3\r\n1 1\r\n\r\n[1, 3]\r\n[2, 4, 5]\r\n[]\r\n\r\nI think it's just \r\n[k//2, k-1] + [k+1, n]\r\n\r\n'''\r\n\r\ndef solve():\r\n n = II()\r\n birds = LII()\r\n m = II()\r\n for _ in range(m):\r\n x, y = MII()\r\n # 0 indexing\r\n x -= 1\r\n\r\n # Jump Left\r\n if x > 0:\r\n birds[x-1] += y-1\r\n\r\n # Jump Right\r\n if x < n-1:\r\n birds[x+1] += birds[x]-y\r\n\r\n birds[x] = 0\r\n\r\n WRITE(birds)\r\n\r\nsolve()", "n = int(input()) \r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n x, y = map(int, input().split()) \r\n if (x - 2) >= 0: \r\n a[x - 2] += y - 1\r\n if x < len(a): \r\n a[x] += a[x - 1] - y\r\n a[x - 1] = 0 \r\nfor i in range(len(a)): \r\n print(a[i])", "# http://codeforces.com/contest/294/problem/A\n\ndef solution(a, n, xy, m):\n for x, y in xy:\n if x > 1:\n a[x - 2] += y - 1\n if x < n:\n a[x] += a[x - 1] - y\n\n a[x - 1] = 0\n\nif __name__ == \"__main__\":\n n = int(input())\n a = list(map(int, input().split()))\n m = int(input())\n xy = []\n for _ in range(m):\n xy.append(tuple(map(int, input().split())))\n\n solution(a, n, xy, m)\n for i in a:\n print(i)", "inputs = lambda: list(map(int, input().split()))\r\n\r\nnum_wires, = inputs()\r\n\r\nnum_birds_per_wire = inputs()\r\n\r\nnum_shots = int(input())\r\n\r\nfor i in range(num_shots):\r\n\r\n x, y = inputs()\r\n x, y = x-1, y-1\r\n\r\n if x > 0:\r\n num_birds_per_wire[x - 1] += y\r\n\r\n if x < num_wires - 1:\r\n num_birds_per_wire[x + 1] += num_birds_per_wire[x] - y - 1\r\n\r\n num_birds_per_wire[x] = 0\r\n\r\nprint('\\n'.join(map(str, num_birds_per_wire)))\r\n", "from typing import TypeVar\r\n\r\nith_wire = TypeVar('ith_wire', int, str)\r\nith_bird = TypeVar('ith_bird', int, str)\r\n\r\n\r\ndef cal_num_birds(birds_on_wires: list[int], shouted_birds: list[tuple[ith_wire, ith_bird]]) -> list[int]:\r\n\r\n for wire, bird in shouted_birds:\r\n\r\n wire_addjust = wire - 1\r\n\r\n # left birds to top\r\n if (wire_addjust - 1 >= 0):\r\n birds_on_wires[wire_addjust - 1] \\\r\n += bird - 1\r\n\r\n # Right birds to bottom\r\n if (wire_addjust + 1 < len(birds_on_wires)):\r\n birds_on_wires[wire_addjust + 1] \\\r\n += birds_on_wires[wire_addjust] - bird\r\n\r\n birds_on_wires[wire_addjust] = 0\r\n\r\n return birds_on_wires\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n wires_num = int(input()) # number of wires\r\n\r\n # list number of birds on each wire\r\n birds_on_wires = list(map(int, input().split()))\r\n\r\n shoots_num = int(input()) # num of shots\r\n shouted_birds: list[tuple[ith_wire, ith_bird]] = [\r\n list(map(int, input().split())) for _ in range(shoots_num)]\r\n\r\n print(*cal_num_birds(birds_on_wires, shouted_birds), sep='\\n')\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n for _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n if a - 1 >= 0:\r\n A[a-1] += b - 1\r\n if a + 1 < n:\r\n A[a+1] += A[a] - b\r\n A[a] = 0\r\n print('\\n'.join(list(str(a) for a in A)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\na = [int(s) for s in input().split(' ')]\r\nm = int(input())\r\nfor shot in range(m):\r\n x, y = [int(s) for s in input().split(' ')]\r\n if x > 1:\r\n a[x - 2] += y - 1\r\n if x < n:\r\n a[x] += a[x - 1] - y\r\n a[x - 1] = 0\r\nfor wire in a:\r\n print(wire)", "# wires\nn = int(input())\n\nwires = list(map(lambda x: int(x), input().split(\" \")))\n\nshots = int(input())\nfor i in range(shots):\n x,y = map(lambda x: int(x), input().split(\" \"))\n i = x - 1\n birds = wires[i]\n wires[i] = 0\n\n if i - 1 >= 0:\n wires[i-1] += y - 1\n if i + 1 < len(wires):\n wires[i+1] += birds - y\n\nfor wire in wires:\n print(wire)\n \n", "input()\r\nA=list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n w, b = map(int,input().split())\r\n up = b - 1\r\n do = A[w-1] - b\r\n A[w-1] = 0\r\n if w - 2 >=0: A[w-2] += up\r\n if w < len(A): A[w] += do\r\nfor a in A:\r\n print(a) ", "n = int(input())\r\narr = input().split(' ')\r\nfor i in range(len(arr)):\r\n arr[i] = int(arr[i])\r\n\r\nm = int(input())\r\nwhile m:\r\n m-=1\r\n arr1 = input().split(' ')\r\n wire_index = int(arr1[0])-1\r\n goal = int(arr1[1])\r\n\r\n wire_count = arr[wire_index]\r\n up_count = goal-1\r\n down_count = wire_count-goal\r\n\r\n if(wire_index>0):\r\n arr[wire_index-1] += up_count\r\n if(wire_index < n-1 ):\r\n arr[wire_index+1] += down_count\r\n arr[wire_index] = 0\r\n\r\nfor i in arr:\r\n print(i)\r\n\r\n", "n=int(input())\r\ns=[0]+list(map(int,input().split()))+[0]\r\nm=int(input())\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n s[a+1]+=s[a]-b\r\n s[a]=0\r\n s[a-1]+=b-1\r\n \r\nfor i in range(n):\r\n print(s[i+1])", "n = int(input()) # Number of wires\r\nbirds_on_wire = list(map(int, input().split())) # Initial number of birds on each wire\r\nm = int(input()) # Number of shots\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split()) # x: wire number, y: bird position from left\r\n x -= 1 # Adjust the 0-based index\r\n birds_on_wire[x] -= y # Decrease the number of birds on the x-th wire\r\n if x > 0:\r\n birds_on_wire[x - 1] += y - 1 # Birds to the left\r\n if x < n - 1:\r\n birds_on_wire[x + 1] += birds_on_wire[x] # Birds to the right\r\n birds_on_wire[x] = 0 # Birds on the shot wire\r\n\r\n# Print the updated number of birds on each wire\r\nfor birds in birds_on_wire:\r\n print(birds)\r\n", "def main():\n n_wires = int(input())\n n_birds = [int(_) for _ in input().split()]\n n_shots = int(input())\n\n for _ in range(n_shots):\n [x, y] = [int(_) for _ in input().split()]\n n_birds_before = n_birds[x - 1]\n birds_left = y - 1\n birds_right = n_birds_before - y\n\n if x > 1:\n n_birds[x - 2] += birds_left\n\n if x < n_wires:\n n_birds[x] += birds_right\n\n n_birds[x - 1] = 0\n\n for i in range(n_wires):\n print(n_birds[i])\n\n\nif __name__ == '__main__':\n main()\n", "x = int(input())\r\ny =list(map(int, input().split()))\r\nz = int(input())\r\nf = 0\r\nfor i in range(z):\r\n a,b= map(int,input().split())\r\n a-=1\r\n if a-1>=0:\r\n y[a-1]+=b-1\r\n if a+1<x:\r\n y[a+1]+=(y[a]-b)\r\n y[a]=0\r\nfor i in y:\r\n print(i)\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nshots = int(input())\r\nfor i in range(shots):\r\n wire, oskol = map(int, input().split())\r\n # index 0\r\n if wire == 1:\r\n if wire == len(a):\r\n a[wire-1] = 0\r\n else:\r\n a[1] += a[0] - oskol\r\n a[0] = 0\r\n else:\r\n if wire == len(a):\r\n t = a[wire-1] - oskol\r\n a[wire-2] += (a[wire-1] - t) - 1\r\n a[wire-1] = 0\r\n else:\r\n t = a[wire-1] - oskol\r\n a[wire] += t\r\n a[wire-2] += (a[wire-1] - t) - 1\r\n a[wire-1] = 0\r\nfor i in a:\r\n print(abs(i))", "wire_count = int(input())\nwires = [x for x in map(int, input().split())]\nwires.insert(0,0)\nfor _ in range(int(input())):\n wire, bird = map(int, input().split())\n left_remaining_birds = (0 + bird) - 1\n right_remaining_birds = wires[wire] - bird\n if wire == len(wires)-1:\n wires[wire] = 0\n wires[wire - 1] += left_remaining_birds\n else:\n wires[wire - 1] += left_remaining_birds\n wires[wire] = 0\n wires[wire + 1] += right_remaining_birds\nres = \"\\n\".join(map(str, wires[1:]))\nprint(res)\n\n# 5\n# 58 51 45 27 48\n# 5\n# 4 9\n# 5 15\n# 4 5\n# 5 8\n# 1 43\n", "import sys\n\nget_int_list = lambda: list(map(int, sys.stdin.readline().rstrip(\"\\n\\r\").split()))\n\ndef main():\n input() # Useless\n wires = {k+1:v for k,v in enumerate(get_int_list())}\n for _ in range(int(input())):\n x, y = get_int_list()\n left = y - 1 # For the dead bird\n right = wires[x] - y\n wires[x] = 0\n if x-1 in wires:\n wires[x-1] += left\n if x+1 in wires:\n wires[x+1] += right\n print(*wires.values(),sep=\"\\n\")\n \n \n \n \nmain()", "def solve(arr, birds):\n for i, v in enumerate(arr):\n w_index = v[0] - 1\n lb = v[1]-1\n rb = birds[w_index] - lb - 1 \n if w_index != 0:\n birds[w_index-1] += lb\n if w_index != len(birds)-1 :\n birds[w_index+1] += rb\n birds[w_index] = 0\n for i in birds:\n print(i)\n\ndef main():\n n = int(input())\n birds = list(map(int, input().split(' ')))\n m = int(input())\n arr = []\n for i in range(m):\n el = list(map(int, input().split(' ')))\n arr.append(el)\n solve(arr, birds)\nmain()\n", "def solve(t_id):\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n m = int(input())\r\n for i in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if x > 0:\r\n a[x - 1] += y - 1\r\n if x < n - 1:\r\n a[x + 1] += a[x] - y\r\n a[x] = 0\r\n print(*a, sep = '\\n')\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", "n = int(input())\r\nlist_a = [int(x) for x in input().split(' ')]\r\nlist_a.append(0)\r\nm = int(input())\r\nfor i in range(m):\r\n list_m = [int(x) for x in input().split(' ')]\r\n pos = list_m[0] - 1\r\n val = list_m[1]\r\n list_a[pos + 1] += list_a[pos] - val\r\n list_a[pos - 1] += val - 1\r\n list_a[pos] = 0\r\nfor j in range(n):\r\n print(list_a[j])", "n = int(input())\r\na = input().split(\" \")\r\na = [int(i) for i in a]\r\na.insert(0, 0)\r\na.append(0)\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = input().split(\" \")\r\n x, y = int(x), int(y)\r\n a[x-1] += y - 1\r\n a[x+1] += a[x] - y\r\n a[x] = 0\r\nfor i in range(1,len(a)-1):\r\n print(a[i])", "n = int(input())\r\nbirds = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n y -= 1\r\n if x > 0:\r\n birds[x - 1] += y\r\n if x < n - 1:\r\n birds[x+1] += birds[x] - y - 1\r\n birds[x] = 0\r\nfor bird in birds:\r\n print(bird)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na.insert(0,0)\r\na.append(0)\r\nm = int(input())\r\nfor i in range(m):\r\n\tj,k = map(int,input().split())\r\n\ta[j-1]+=(k-1)\r\n\ta[j+1]+=(a[j]-k)\r\n\ta[j] = 0\r\nfor i in range(1,n+1):\r\n\tprint(a[i])", "from sys import stdin\r\nn=int(stdin.readline())\r\na=list(map(int,stdin.readline().rstrip().split()))\r\na.insert(0,0)\r\na.append(0)\r\n\r\nm=int(input())\r\nfor i in range(m):\r\n x,y=list(map(int,input().split()))\r\n a[x-1]+=y-1\r\n a[x+1]+=a[x]-y\r\n a[x]=0\r\na.pop()\r\n \r\na.pop(0)\r\nfor i in a:\r\n print(i)\r\n ", "def inp():\r\n x = input()\r\n return list(map(eval, x.split(\" \")))\r\n\r\ndef main():\r\n\r\n n = int(input())\r\n birds = inp()\r\n\r\n numbirds = {}\r\n\r\n for i in range(n):\r\n if i+1 not in numbirds:\r\n numbirds[i+1] = birds[i]\r\n\r\n m = int(input())\r\n killed = []\r\n\r\n for j in range(m):\r\n kill = inp()\r\n killed.append(kill)\r\n\r\n for kill in killed:\r\n if kill[0]-1 >= 1:\r\n numbirds[kill[0]-1] += kill[1] - 1\r\n if kill[0]+1 <= n:\r\n numbirds[kill[0]+1] += numbirds[kill[0]] - kill[1]\r\n numbirds[kill[0]] = 0 \r\n \r\n for val in numbirds.values():\r\n print(val)\r\n\r\n \r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nbirds = list(map(int, input().split()))\r\nm = int(input())\r\nlog = []\r\nfor i in range(m):\r\n log.append(list(map(int, input().split())))\r\nfor shot in log:\r\n wire = shot[0]\r\n left = shot[1]\r\n toLeft = left - 1\r\n toRight = birds[wire - 1] - toLeft - 1\r\n birds[wire - 1] = 0\r\n if(wire > 1):\r\n birds[wire - 2] += toLeft\r\n if(wire < len(birds)):\r\n birds[wire] += toRight\r\nfor i in birds:\r\n print(i)\r\n", "n = int(input())\na = [int(i) for i in input().split()]\nm = int(input())\nwhile m:\n x, y = input().split()\n x = int(x) - 1\n y = int(y)\n if x != 0:\n a[x - 1] += y - 1\n if x < n - 1:\n a[x + 1] += a[x] - y\n a[x] = 0\n m -= 1\nfor i in range(n):\n print(a[i])\n\n \t \t \t\t \t \t", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nm=int(input())\r\nb=[]\r\nfor i in range(m):\r\n b.append([int(x) for x in input().split()])\r\nif n==1:\r\n if m==0:\r\n print(a[0])\r\n else:\r\n print(0)\r\nelse:\r\n for i in range(m):\r\n if b[i][0]==1:\r\n a[1]+=(a[0]-b[i][1])\r\n a[0]=0\r\n elif b[i][0]==n:\r\n a[n-2]+=(b[i][1]-1)\r\n a[n-1]=0\r\n else:\r\n a[b[i][0]-2]+=(b[i][1]-1)\r\n a[b[i][0]]+=(a[b[i][0]-1]-b[i][1])\r\n a[b[i][0]-1]=0\r\n for i in a:\r\n print(i)", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\na = [0] + [int(x) for x in input().split()] + [0]\n\nfor _ in range(int(input())):\n x, y = map(int, input().split())\n a[x + 1] += a[x] - y\n a[x - 1] += y - 1\n a[x] = 0\n\nprint('\\n'.join(map(str, a[1:-1])))\n", "n, a = int(input()), [int(i) for i in input().split()]\nm = int(input())\nfor _ in range(m):\n x, y = (int(i) for i in input().split())\n if x < n:\n a[x] += a[x - 1] - y\n if x > 1:\n a[x - 2] += y - 1\n a[x - 1] = 0\nres = a\nprint(*res, sep=\"\\n\")\n", "num_of_wires = int(input())\r\nbirds = list(map(int, input().split()))\r\nnum_of_shots = int(input())\r\n\r\n\r\ndef doer():\r\n for i in range(num_of_shots):\r\n x, y = input().split()\r\n if int(x) != 1:\r\n birds[int(x) - 2] += int(y) - 1\r\n if int(x) != len(birds):\r\n birds[int(x)] += birds[int(x) - 1] - int(y)\r\n\r\n birds[int(x) - 1] = 0\r\n\r\n\r\nif __name__ == '__main__':\r\n doer()\r\n for k in birds:\r\n print(k)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nq = int(input())\r\nfor i in range(q):\r\n wire, left = list(map(int, input().split()))\r\n wire -= 1\r\n if wire > 0:\r\n arr[wire-1] += left-1\r\n if wire < n-1:\r\n arr[wire+1] += arr[wire] - left\r\n arr[wire] = 0\r\nfor i in arr:\r\n print(i)", "'''HackerRank: Shaass and Oskols'''\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n m = int(input())\r\n for _ in range(m):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n if x - 1 >= 0:\r\n a[x - 1] += y - 1\r\n\r\n if x + 1 < len(a):\r\n a[x + 1] += a[x] - y\r\n\r\n a[x] = 0\r\n\r\n print(*a, sep='\\n')\r\n", "n = int(input())\r\nbirds = list(map(int, input().split(\" \")))\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n shot = list(map(int, input().split(\" \")))\r\n shot[0]-=1\r\n if shot[0] < n-1:\r\n birds[shot[0]+1] += birds[shot[0]] - shot[1]\r\n if shot[0] != 0:\r\n birds[shot[0]-1] += shot[1]-1\r\n\r\n birds[shot[0]] = 0\r\n\r\nfor bird in birds:\r\n print(bird)\r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nm = int(input())\r\nfor i in range(m) :\r\n x,y = input().split()\r\n x,y = int(x),int(y)\r\n if x < n :\r\n l[x] += (l[x-1] - y)\r\n if x-1 > 0 :\r\n l[x-2] += y-1 \r\n l[x-1] = 0 \r\nfor i in l :\r\n print(i)", "n = int(input())\nar = list(map(int, input().split()))\nm = int(input())\nfor i in range(m):\n x, y = map(int, input().split())\n if x < n:\n ar[x] += ar[x - 1] - y\n if 0 <= x - 2:\n ar[x - 2] += y - 1\n ar[x - 1] = 0\nfor i in ar:\n print(i)", "n=int(input())\r\na=list(map(int,input().split())) #\r\n #a.append([x,y])\r\nq=int(input())\r\nfor i in range(q):\r\n x,y=map(int,input().split())\r\n x-=1\r\n if(x-1>=0):\r\n a[x-1]+=y-1\r\n if(x+1<n):\r\n a[x+1]+=a[x]-y\r\n a[x]=0\r\nfor i in range(n):\r\n print(a[i])\r\n ", "n=int(input())\r\nlist=list(map(int,input().split(' ')))\r\nshot=int(input())\r\nfor i in range(shot):\r\n x,y=(map(int,input().split(' ')))\r\n if x-2 >=0:\r\n list[x-2]+=y-1\r\n if x<=n-1:\r\n list[x]+=list[x-1]-y\r\n list[x-1]=0\r\n\r\nfor i in list:\r\n print(i)\r\n", "n = int(input())\r\narray = [int(x) for x in input().split(\" \")]\r\nm = int(input())\r\nfor i in range(m):\r\n a,b = [int(x) for x in input().split(\" \")]\r\n a = a-1\r\n if a-1>=0:\r\n array[a-1]+= b-1\r\n if a+1<n:\r\n array[a+1]+= array[a]-b\r\n array[a]=0\r\nfor i in array:\r\n print(i,end='\\n')\r\n", "if __name__ == '__main__':\n\tn = int(input())\n\ta = [int(x) for x in input().split()]\n\tm = int(input())\n\tfor _ in range(m):\n\t\tx, y = [int(x) for x in input().split()]\n\t\tx -= 1 # adjust to 0-index\n\t\tif x > 0:\n\t\t\ta[x - 1] += y - 1\n\t\tif x < n - 1:\n\t\t\ta[x + 1] += a[x] - y\n\t\ta[x] = 0\n\tfor x in a:\n\t\tprint(x)\n\t\n", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nmatrix = [[1 for _ in range(arr[i])] for i in range(n)]\r\n\r\nshots = int(input())\r\n\r\nfor shot in range(shots):\r\n\twire, y = list(map(int, input().split()))\r\n\twire = wire - 1\r\n\ty = y - 1\r\n\tif wire - 1 >= 0:\r\n\t\tmatrix[wire-1].extend(matrix[wire][:y])\r\n\tif wire + 1 < n:\r\n\t\tmatrix[wire+1].extend(matrix[wire][y+1:])\r\n\tmatrix[wire] = []\r\n\r\nfor i in matrix:\r\n\tprint(len(i))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n\tx, y = map(int, input().split())\r\n\tif x != 1:\r\n\t\ta[x - 2] += y - 1\r\n\tif x != n:\r\n\t\ta[x] += a[x - 1] - y\r\n\ta[x - 1] = 0\r\nfor _ in a:\r\n\tprint(_)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nm=int(input())\r\nfor w in range(m):\r\n x,y=(int(i) for i in input().split())\r\n if(x!=n):\r\n l[x]+=(l[x-1]-y)\r\n if(x!=1):\r\n l[x-2]+=(y-1)\r\n l[x-1]=0\r\nfor i in range(n):\r\n print(l[i])", "maxArray = int(input())\r\ntotalBirds = [int(x) for x in input().split()]\r\nturns = int(input())\r\nfor i in range(0, turns):\r\n index, bird_number = [int(x) for x in input().split()]\r\n index -= 1\r\n left = bird_number - 1\r\n right = totalBirds[index] - bird_number\r\n totalBirds[index] = 0\r\n if not index == 0:\r\n totalBirds[index - 1] += left\r\n if not index == maxArray - 1:\r\n totalBirds[index + 1] += right\r\nfor i in totalBirds:\r\n print(i, end=\" \")\r\n", "n=int(input())\r\na=(input().split(sep=' ',maxsplit=n))\r\na=[int(x) for x in a]\r\nm=int(input())\r\nfor i in range(1,m+1):\r\n coordinates=input().split(sep=' ',maxsplit=2)\r\n x,y=int(coordinates[0]),int(coordinates[1])\r\n if x-1 >=1 :a[x-1-1]+=y-1\r\n if x+1 <=n :a[x+1-1]+=(a[x-1]-y)\r\n a[x-1]=0\r\nfor j in range(0,n):\r\n print(a[j])", "n = int(input())\r\n\r\nwires = list(map(int, input().split()))\r\n\r\nm = int(input())\r\n\r\nfor i in range(m):\r\n wire, bird = map(int, input().split())\r\n \r\n if wire != 1:\r\n wires[wire - 2] += (bird - 1)\r\n \r\n if wire != n:\r\n wires[wire] += wires[wire - 1] - bird\r\n \r\n wires[wire - 1] = 0\r\n \r\nfor i in wires:\r\n print(i)", "n = int(input() )\nl1 = list(map(int, input().strip().split()))\nm = int(input())\nfor d in range(0, m):\n\tx, y = map(int, input().strip().split())\n\n\tif x-1-1 > -1:\n\t\tl1[x-1-1] += y-1\n\tif x-1+1 < n:\n\t\tl1[x-1+1] += l1[x-1] - y\n\tl1[x-1] = 0\n\t# print(l1)\nfor i in l1:\n\tprint(i)", "n, A, m = int(input()), list(map(int, input().split(' '))), int(input())\r\nfor i in range(m):\r\n x, y = list(map(int, input().split(' ')))\r\n if x != 1:\r\n A[x-2] = A[x-2] + y-1\r\n if x != n:\r\n A[x] = A[x] + A[x-1]-y\r\n A[x-1] = 0\r\nprint(*A)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = map(int, input().split()); x -= 1; y -= 1\r\n if x > 0: A[x-1] += y\r\n if x < n-1: A[x+1] += A[x]-y-1\r\n A[x] = 0\r\nfor a in A:\r\n print(a)", "n=int(input());l=list(map(int,input().split()));l.insert(0,0);l.append(0)\r\nm=int(input())\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tl[x-1]+=y-1;l[x+1]+=l[x]-y;l[x]=0\r\nfor i in range(1,n+1):print(l[i])", "n = int(input())\r\nbirds = [int(i) for i in input().split()]\r\n\r\ncomms = []\r\nfor i in range(int(input())):\r\n comm = [int(i) for i in input().split()]\r\n comms.append(comm)\r\n\r\nfor comm in comms:\r\n x,y = comm[0]-1, comm[1]-1\r\n add_down = (birds[x]-1)-y\r\n add_up = y\r\n if x-1 > -1:\r\n birds[x-1] += add_up\r\n if x+1 < n:\r\n birds[x+1] += add_down\r\n birds[x] = 0\r\n\r\nfor i in birds:\r\n print(i)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nfor i in range(int(input())):\r\n x,y = [int(p) for p in input().split()]\r\n left = y-1 if a[x-1]>=y else 0\r\n right = a[x-1]-left-1\r\n a[x-1] = 0\r\n if x>1:\r\n a[x-2]+=left\r\n if x+1<=n:\r\n a[x]+=right\r\nprint(*a)", "# import sys\r\n# sys.stdin = open('./input.txt', 'r')\r\n# sys.stdout = open('./output.txt', 'w')\r\n\r\nn = int(input())\r\nwires = list(map(int, input().split()))\r\nm = int(input())\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n index = x - 1\r\n left = y - 1\r\n right = wires[index] - y\r\n wires[index] = 0\r\n if n > 1:\r\n if not(index):\r\n wires[index+1] += right\r\n elif index == n-1:\r\n wires[index-1] += left\r\n else:\r\n wires[index-1] += left\r\n wires[index+1] += right\r\nprint(*wires, sep='\\n')", "lengthWires = int(input())\r\n\r\nwires = list(map(int,input().split()))\r\nevents = int(input())\r\nfor i in range(events):\r\n x =list(map(int,input().split())) \r\n index = x[0]-1\r\n right = x[1] - 1\r\n left = wires[index] - x[1]\r\n if(index > 0):\r\n wires[index -1] += right\r\n if(index < lengthWires -1 ):\r\n wires[index +1] += left\r\n wires[index] = 0\r\nfor i in wires:\r\n print(i)" ]

{"inputs": ["5\n10 10 10 10 10\n5\n2 5\n3 13\n2 12\n1 13\n4 6", "3\n2 4 1\n1\n2 2", "5\n58 51 45 27 48\n5\n4 9\n5 15\n4 5\n5 8\n1 43", "10\n48 53 10 28 91 56 81 2 67 52\n2\n2 40\n6 51", "2\n72 45\n6\n1 69\n2 41\n1 19\n2 7\n1 5\n2 1", "10\n95 54 36 39 98 30 19 24 14 12\n3\n9 5\n8 15\n7 5", "100\n95 15 25 18 64 62 23 59 70 84 50 26 87 35 75 86 0 22 77 60 66 41 21 9 75 50 25 3 69 14 39 68 64 46 59 99 2 0 21 76 90 12 61 42 6 91 36 39 47 41 93 81 66 57 70 36 68 89 52 1 19 93 67 22 76 20 8 81 98 18 100 73 61 93 75 80 53 72 40 20 2 86 33 59 27 16 11 26 55 44 47 55 94 58 2 55 82 22 9 95\n0", "1\n100\n1\n1 100", "1\n100\n1\n1 1", "1\n50\n1\n1 25", "2\n50 0\n1\n1 1", "1\n10\n0"], "outputs": ["0\n12\n5\n0\n16", "3\n0\n3", "0\n66\n57\n7\n0", "87\n0\n23\n28\n141\n0\n86\n2\n67\n52", "0\n0", "95\n54\n36\n39\n98\n34\n0\n28\n13\n21", "95\n15\n25\n18\n64\n62\n23\n59\n70\n84\n50\n26\n87\n35\n75\n86\n0\n22\n77\n60\n66\n41\n21\n9\n75\n50\n25\n3\n69\n14\n39\n68\n64\n46\n59\n99\n2\n0\n21\n76\n90\n12\n61\n42\n6\n91\n36\n39\n47\n41\n93\n81\n66\n57\n70\n36\n68\n89\n52\n1\n19\n93\n67\n22\n76\n20\n8\n81\n98\n18\n100\n73\n61\n93\n75\n80\n53\n72\n40\n20\n2\n86\n33\n59\n27\n16\n11\n26\n55\n44\n47\n55\n94\n58\n2\n55\n82\n22\n9\n95", "0", "0", "0", "0\n49", "10"]}

UNKNOWN

PYTHON3

CODEFORCES

397

8dbf384ae645ced530cdc48451343e58

Pipeline

Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly *n* houses in Ultimate Thule, Vova wants the city to have exactly *n* pipes, each such pipe should be connected to the water supply. A pipe can be connected to the water supply if there's water flowing out of it. Initially Vova has only one pipe with flowing water. Besides, Vova has several splitters. A splitter is a construction that consists of one input (it can be connected to a water pipe) and *x* output pipes. When a splitter is connected to a water pipe, water flows from each output pipe. You can assume that the output pipes are ordinary pipes. For example, you can connect water supply to such pipe if there's water flowing out from it. At most one splitter can be connected to any water pipe. Vova has one splitter of each kind: with 2, 3, 4, ..., *k* outputs. Help Vova use the minimum number of splitters to build the required pipeline or otherwise state that it's impossible. Vova needs the pipeline to have exactly *n* pipes with flowing out water. Note that some of those pipes can be the output pipes of the splitters. The first line contains two space-separated integers *n* and *k* (1<=≤<=*n*<=≤<=1018, 2<=≤<=*k*<=≤<=109). 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. Print a single integer — the minimum number of splitters needed to build the pipeline. If it is impossible to build a pipeline with the given splitters, print -1. Sample Input 4 3 5 5 8 4 Sample Output 2 1 -1

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\n\r\nlo, hi = 0, k\r\nwhile lo < hi:\r\n mid = lo + (hi - lo) // 2\r\n pipes = (mid * (2 * k - mid + 1) // 2) - mid + 1\r\n if pipes >= n:\r\n hi = mid\r\n else:\r\n lo = mid + 1\r\nassert (lo == hi)\r\ntot_pipes = (lo * (2 * k - lo + 1) // 2) - lo + 1\r\nprint(-1 if tot_pipes < n else lo)", "\ndef sum_n(n):\n return (n * (n + 1)) // 2\n\ndef sum_range(s, e):\n if s <= 1:\n return sum_n(e)\n return sum_n(e) - sum_n(s - 1)\n\ndef min_splitters(k, n):\n st, en = 1, k\n\n while st < en:\n md = (st + en) // 2\n s = sum_range(md, k)\n\n if s == n:\n return k - md + 1\n\n if s > n:\n st = md + 1\n else:\n en = md\n\n return k - st + 2\n\nif __name__ == \"__main__\":\n n, k = map(int, input().split())\n\n if n == 1:\n print(0)\n elif n <= k:\n print(1)\n else:\n k -= 1\n n -= 1\n\n if sum_n(k) < n:\n print(-1)\n else:\n print(min_splitters(k, n))\n\n\n\t\t \t\t\t \t\t \t \t \t\t\t \t", "def triangle(i):\n return i * (i + 1) // 2\n\n\ndef floor_sqrt(n):\n s = n >> (n.bit_length() // 2)\n\n # newton’s method. i didn’t actually prove that this always terminates, but it seems to work :P\n while not s**2 <= n < (s + 1)**2:\n s += (n - s**2) // (2 * s)\n\n return s\n\n\ndef floor_inverse_triangle(t):\n return (floor_sqrt(1 + 8 * t) - 1) // 2\n\n\nn, k = map(int, input().split())\nr = triangle(k - 1) - (n - 1)\n\nif r < 0:\n print(-1)\nelse:\n i = floor_inverse_triangle(r)\n print((k - 1) - floor_inverse_triangle(r))\n", "def total(n):\r\n return n*(n+1)//2\r\nn,k=input().split()\r\nn,k=int(n),int(k)\r\nn-=1\r\ns=total(k-1)\r\nif s<n:\r\n print(-1)\r\nelse:\r\n l=0\r\n h=k-1\r\n while l<=h:\r\n mid=l+(h-l)//2\r\n if (s-total(mid))>=n:\r\n l=mid+1\r\n else:\r\n h=mid-1\r\n print(k-1-h)\r\n", "f = lambda m, k: (k*m - m*(m-1)//2 - m + 1)\r\n\r\ndef ok(m, k, n):\r\n return f(m, k) >= n\r\n\r\nn, k = map(int, input().split())\r\n\r\nif not ok(k, k, n): print(-1)\r\nelse: \r\n l, h = 0, k\r\n while (h > l):\r\n mid = l + (h - l) // 2\r\n if ok(mid, k, n): h = mid\r\n else: l = mid + 1\r\n print(h)", "n,k = list(map(int, input().split()))\r\n# 2 to k is the splitters type, one for each available\r\n# n pipes\r\n# o/p minimum number of splitters reqd\r\n#recursively we can check if all the splitters sum up to exactly n output\r\n# take the maximum, again take the maximum of left out value\r\nif n==1:\r\n print(0)\r\nelse:\r\n maxSum = (k*(k-1))//2\r\n if (n-1)<=maxSum:\r\n target = maxSum - n + 1\r\n left = 2\r\n right = k\r\n # print(maxSum, n, target)\r\n flag = 0\r\n while left<=right:\r\n mid = left+(right-left)//2\r\n sumMid = (mid*(mid-1))//2\r\n # print(left, right, mid, sumMid)\r\n if sumMid == target:\r\n print(k-mid)\r\n flag = 1\r\n break\r\n elif sumMid > target:\r\n right = mid-1\r\n elif sumMid<target:\r\n left = mid+1\r\n if flag == 0:\r\n print(k-right)\r\n else:\r\n print(-1)", "n,k = [int(i) for i in input().strip().split()]\r\nma = ((k*(k-1))//2)+1\r\nif n>ma:\r\n print(-1)\r\nelse:\r\n lo = 0\r\n hi = k-1\r\n ans = None\r\n while hi>=lo:\r\n mid = (hi+lo)//2\r\n from_st = k-1-mid\r\n curr = ma-(from_st*(from_st+1))//2\r\n if curr>=n:\r\n ans = mid\r\n hi = mid-1\r\n else:\r\n lo = mid+1\r\n print(ans)", "import sys\r\nimport math\r\nimport collections\r\nimport random\r\nfrom heapq import heappush, heappop\r\nfrom functools import reduce\r\ninput = sys.stdin.readline\r\n \r\nints = lambda: list(map(int, input().split()))\r\n\r\nn, k = ints()\r\n\r\nl, r = 0, k\r\nwhile l <= r:\r\n m = (l + r) // 2\r\n g = k - m - 1\r\n sm = (k * (k - 1)) // 2 + 1 - g * (g + 1) // 2\r\n if sm >= n:\r\n r = m - 1\r\n else:\r\n l = m + 1\r\n\r\nif l == k + 1:\r\n print(\"-1\")\r\nelse:\r\n print(l)", "n,k=map(int,input().split())\r\n\r\nl=-1\r\nr=k+1\r\n\r\ndef check(x):\r\n return (k-x+1+k)*x//2-(x-1)\r\n\r\nwhile r-l>1:\r\n m=(l+r)//2\r\n if n>check(m):l=m\r\n else:r=m\r\n\r\nprint(-1 if r==k+1 else r)\r\n", "# if you win, you live. you cannot win unless you fight.\r\nimport string\r\nimport sys\r\nfrom sys import stdin, setrecursionlimit\r\n# fd=open(\"cses.txt\")\r\n# sys.stdin=fd\r\ninput = stdin.readline\r\nrd = lambda: map(lambda s: int(s), input().strip().split())\r\nrdone = lambda: map(lambda s: int(s) - 1, input().strip().split())\r\nri = lambda: int(input())\r\nrs = lambda: input().strip()\r\nfrom collections import defaultdict as unsafedict, deque, Counter as unsafecounter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom sys import setrecursionlimit\r\nfrom math import ceil\r\nfrom bisect import bisect_left\r\n\r\n\r\nn,k=rd()\r\nans=-1\r\nlo,hi=0,k+1\r\nwhile lo<=hi:\r\n mid=(lo+hi)//2\r\n s=k*(k+1)//2 -(k-mid+1)*(k-mid)//2\r\n if s-mid+1>=n:\r\n ans=mid\r\n hi=mid-1\r\n else:\r\n lo=mid+1\r\nprint(ans)", "def reach_max(n, k):\r\n return n * k + 1 - n * (n + 1) // 2\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\nif n == 1:\r\n print(0)\r\n exit()\r\n\r\nlo, hi = 1, k - 1\r\n\r\nif n > reach_max(hi, k):\r\n print(-1)\r\n exit()\r\n\r\nwhile lo < hi:\r\n mid = (lo + hi) // 2\r\n if reach_max(mid, k) < n:\r\n lo = mid + 1\r\n else:\r\n hi = mid\r\n\r\nprint(lo)", "n, k = map(int, input().split())\n\nsumoftpips = (k*(k+1))//2\n\nnumberoftpips = k-1\n\n\ndef valid(mid):\n x=mid-1\n midpipesum=(x*(x+1))//2\n midpipesnumber=mid-1\n\n midpipesum=sumoftpips-midpipesum\n midpipesnumber=numberoftpips-midpipesnumber\n\n if midpipesum-midpipesnumber >= n:\n return True\n else:\n return False\n\n\nif n==1:\n print(0)\nelse:\n l, r = 1, k + 1\n\n while r - l > 1:\n mid = (l + r) // 2\n if valid(mid):\n l = mid\n else:\n r = mid\n\n if l == 1:\n print(-1)\n else:\n print(k - l + 1)\n \t\t \t\t \t\t\t\t\t\t \t \t \t\t", "n, k = map(int, input().split())\n\ndef good(m):\n l = k - m + 1\n r = l * (m + k) // 2 - (l - 1)\n return r >= n\n\nif n == 1: print(0)\nelif n <= k: print(1)\nelse:\n l = 2; r = k; ans = -1\n while l < r:\n m = l + (r - l) // 2\n if good(m) : \n l = m + 1\n ans = m\n else : r = m\n print(-1 if ans == -1 else k - ans + 1)", "import decimal\r\n\r\nn, k = input().split(' ')\r\nn = int(n)\r\nk = int(k)\r\ncoef1 = (k*k-k-2*n)*100+225\r\nif coef1 < 0:\r\n print('-1')\r\nelse:\r\n D = decimal.Decimal\r\n coef11 = D(coef1)\r\n coef1 = coef11.sqrt()\r\n coef2 = k*10-5\r\n coef = (coef2-coef1)/10\r\n if coef % 1 == 0:\r\n print(int(coef))\r\n else:\r\n print(int(coef)+1)\r\n", "n, k = map(int, input().split())\r\nif n == 1:\r\n print(0)\r\nelif (k*k -k)//2 +1 < n:\r\n print(-1)\r\nelse:\r\n g, b = 0, k//2\r\n while b != 0:\r\n while g +b <= k and (k*k -k)//2 +1 -((g +b)**2 -(g +b))//2 >= n:\r\n g += b\r\n b //= 2\r\n print(k -g)\r\n", "n,k=map(int,input().split())\r\nn-=1;k-=1\r\nl,r=0,k\r\nmm=k*(k+1)//2\r\nans=-1\r\nwhile l<=r:\r\n m=(l+r)//2\r\n if mm-m*(m+1)//2>=n:\r\n ans=k-m\r\n l=m+1\r\n else:\r\n r=m-1\r\nprint(ans)\r\n", "import sys\nfrom collections import OrderedDict\n\ndef sum_from_two(x):\n '''\n Sum from 2 to x.\n '''\n return x * (x + 1) // 2 - 1\n\ndef sum_last(k, x):\n '''\n Sum which the last `x` splitters\n can add.\n '''\n if x == 0:\n return 1\n\n # 2 3 4 ... k. <- We have these splitters.\n # x == 1, just k. sum(2, k) - sum(2, k - x)\n # Each item k_i gives sum k_i - 1\n # Add 1 for initial pipes.\n return sum_from_two(k) - sum_from_two(k - x) - x + 1\n\ndef possible(n, k, x):\n return sum_last(k, x) >= n\n\ndef main(n, k):\n if n == 1:\n # Already have 1.\n return 0\n\n # Can't use any of the splitters.\n if sum_last(k, k - 1) < n:\n return -1\n\n # Use only one splitter.\n minimum = 1\n # Can use at most k - 1 splitters.\n maximum = k - 1\n while minimum <= maximum:\n if minimum == maximum:\n return minimum\n elif minimum == maximum - 1:\n if possible(n, k, minimum):\n return minimum\n else:\n return maximum\n\n mid = (minimum + maximum) // 2\n if possible(n, k, mid):\n # Try if smaller is possible.\n maximum = mid\n else:\n # Need more.\n minimum = mid\n\nif __name__ == \"__main__\":\n curr = None\n for e, line in enumerate(sys.stdin.readlines()):\n n, k = list(map(int, line.strip().split()))\n print(main(n, k))\n", "n , k = map(int , input().split())\r\nn , k = n-1 , k-1\r\n\r\nl = 0\r\nr = k\r\ng = k*(k+1)//2\r\nans = -1\r\n\r\nwhile l <= r:\r\n \tm = (l+r)//2\r\n \tif g-m*(m+1)//2>=n:\r\n \t\tans = k-m\r\n \t\tl = m+1\r\n \telse:\r\n \t\tr = m-1\r\n\r\nprint(ans)", "n, k = map(int, input().split())\r\nif n == 1:\r\n print(0)\r\n exit()\r\nl = 1; r = k - 1\r\nans = -1\r\nwhile l <= r:\r\n m = (l+r)//2\r\n x = m*k - (m*(m+1)//2) + 1\r\n if x >= n:\r\n ans = m\r\n r = m - 1\r\n else: l = m + 1\r\nprint(ans)", "n, k = map(int, input().split())\r\n\r\nn, k = n - 1, k - 1\r\n\r\nleft = 0\r\nright = k\r\nsum = k * (k + 1) // 2\r\nresult = -1\r\n\r\nwhile left <= right:\r\n middle = (left + right) // 2\r\n if (sum - middle * (middle + 1) // 2) >= n:\r\n result = k - middle\r\n left = middle + 1\r\n else:\r\n right = middle - 1\r\n\r\nprint(result)", "n,k=map(int,input().split())\r\nn,k=n-1,k-1\r\nl=0\r\nr=k\r\ng=k*(k+1)//2\r\nans=-1\r\nwhile l<=r:\r\n\tm=(l+r)//2\r\n\tif (g-m*(m+1)//2)>=n:\r\n\t\tans=k-m\r\n\t\tl=m+1\r\n\telse:\r\n\t\tr=m-1\r\nprint(ans)\r\n\r\n", "n, k = map(int, input().split())\r\nl, r = 0, k\r\nans = -1\r\n\r\nwhile l <= r:\r\n med = (l + r) // 2\r\n total_connections = (k * (k - 1)) // 2 - ((k - med) * (k - med - 1)) // 2 + 1\r\n\r\n if total_connections >= n:\r\n r = med - 1\r\n ans = med\r\n else:\r\n l = med + 1\r\n\r\nprint(ans)\r\n", "def sum2(b):\r\n return int(((b/2)*(b+1)))\r\ndef sum3(c,v):\r\n if c<=1:\r\n return sum2(v)\r\n return sum2(v)-sum2(c-1)\r\ndef khlsana(end,m):\r\n start=1\r\n ed=end\r\n while start<ed:\r\n mid=int((ed+start)/2)\r\n ss=sum3(mid,end)\r\n if ss==m:\r\n return k-mid+1\r\n if ss>n:\r\n start=mid+1\r\n else: ed=mid\r\n return k-start+2\r\nn,k=input().split()\r\nn,k=int(n),int(k)\r\nif n==1:\r\n print(0)\r\n exit(0)\r\nelif n==k:\r\n print(1)\r\n exit(0)\r\nelse:\r\n k-=1\r\n n-=1\r\nif n>sum2(k):\r\n print(-1)\r\n exit(0)\r\nprint(khlsana(k,n))", "# https://www.youtube.com/watch?v=ipaRrZlzJ_E&ab_channel=AlgorithmDecoded\r\n\r\ndef summ(n): return n*(n+1) // 2\r\n\r\ndef solve(n, k):\r\n if n == 1:\r\n return 0\r\n \r\n n -= 1\r\n \r\n if summ(k-1) < n:\r\n return -1\r\n\r\n l = 0\r\n h = k-1\r\n ans = -1\r\n while l <= h:\r\n mid = (l + h) // 2\r\n\r\n t = summ(k-1) - summ(mid-1)\r\n \r\n if t >= n:\r\n ans = k - mid\r\n l = mid + 1\r\n else:\r\n h = mid - 1\r\n \r\n return ans\r\n \r\n\r\nn, k = map(int, input().split(\" \"))\r\nprint(solve(n, k))", "def maxPipesfromK(k):\r\n return k*(k-1)//2 + 1\r\n\r\ndef solve():\r\n n,k=map(int,input().split())\r\n mxP=maxPipesfromK(k)\r\n low=0\r\n high=k-1\r\n ans=-1\r\n while low<=high:\r\n mid=(low+high)//2\r\n\r\n maxPipes=mxP-maxPipesfromK(k-mid)+1\r\n if maxPipes<n:\r\n low=mid+1\r\n else:\r\n ans=mid\r\n high=mid-1\r\n print(ans)\r\n\r\nsolve()", "n, k = map(int, input().split())\nm = 2 * (n - 1) - k * (k - 1)\nif m > 0: print(-1)\nelse:\n x = int((1 + (1 - 4 * m) ** 0.5) / 2)\n if x * (x - 1) + m > 0: x -= 1\n print(k - x)\n", "# http://codeforces.com/contest/287/problem/B\ndef normal_sum(N):\n\treturn (N ** 2 + N) // 2\n\ndef sum(i, j):\n\n\treturn normal_sum(j) - 1 - (normal_sum(i-1) - 1)\n\n\n\ndef bs_sum(start, end, k, n):\n\t# print(start, end, k, n)\n\tmid = (start+end) // 2\n\n\tif(n - sum(mid, k) >= mid):\n\t\treturn bs_sum(start, mid - 1, k, n)\n\tif(n - sum(mid, k) < 0):\n\t\treturn bs_sum(mid+1, end, k, n)\n\n\treturn k-mid+2 if (n - sum(mid, k)) != 0 else k-mid+1\n\n\nn, k = [int(n) for n in input().split()]\nif (n == 1):\n\tprint( 0 )\nelif n <= k :\n\tprint( 1 )\nelif normal_sum(k) - 1 - (k-2) < n:\n\tprint( -1 )\nelse:\n\tn-=1\n\tk-=1\n\n\t# arr = [2,3,4,5]\n\t# [1,2,3,4]\n\tanswer = (bs_sum(1, k, k, n))\n\tprint(answer)\n", "def solve():\r\n n, k = map(int, input().split())\r\n \r\n left = 0\r\n right = k-1 \r\n result = -1 \r\n \r\n while left <= right:\r\n mid = (left + right) // 2 \r\n s = mid * (2*k - mid - 1) // 2 \r\n \r\n if s >= n-1:\r\n result = mid\r\n right = mid - 1 \r\n else:\r\n left = mid + 1 \r\n \r\n print(result)\r\n \r\nsolve()\r\n \r\n ", "import builtins\n\nimport sys\ninput = sys.stdin.readline\n\n\nclass Input:\n @staticmethod\n def str():\n return input().strip()\n\n @staticmethod\n def int():\n return int(input())\n\n @staticmethod\n def float():\n return float(input())\n\n @staticmethod\n def list(type_: builtins):\n return list(map(type_, input().split()))\n\n\nclass Solution:\n def solve(self):\n n, k = Input.list(int)\n\n def check(m: int) -> bool:\n if m == 0:\n return n == 1\n if m == 1:\n return k >= n\n return (k - 1 + k - m) * m // 2 + 1 >= n\n\n l, r = 0, k - 1\n while l < r:\n mid = l + (r - l) // 2\n if check(mid):\n r = mid\n else:\n l = mid + 1\n print(l if check(l) else -1)\n\n def main(self):\n self.solve()\n\n\nSolution().main()\n\n\n\n \t\t\t \t\t \t\t \t\t \t \t\t \t\t\t", "n,k = input().split()\r\nn,k = int(n),int(k)\r\n \r\nini,fin = 1,k-1\r\nif n == 1:\r\n\tprint(\"0\")\r\n\texit(0)\r\n \r\nif 1 + (k*(k-1) )//2 < n:\r\n\tprint(\"-1\")\r\n\texit(0)\r\n \r\nwhile ini < fin:\r\n\tmid = (ini+fin)//2\r\n\ts = 1 + (k-1)*mid - (mid*(mid-1))//2\r\n\tif s>=n:\r\n\t\tfin = mid\r\n\telse:\r\n\t\tini = mid+1\r\n \r\nprint(ini)", "def sum(n):\r\n return (n * (n+1)) // 2\r\n\r\ndef sum_range(s, e):\r\n if s <= 1:\r\n return sum(e)\r\n return sum(e) - sum(s-1)\r\n\r\ndef splitter(k, n):\r\n start = 1\r\n end = k\r\n while start < end:\r\n md = (start + end) // 2\r\n s = sum_range(md, k)\r\n if s == n:\r\n return k - md + 1\r\n if s > n:\r\n start = md + 1\r\n else:\r\n end = md\r\n return k - start + 2\r\n\r\nif __name__ == '__main__':\r\n # pipeline\r\n n, k = map(int, input().split())\r\n if n == 1:\r\n print(\"0\")\r\n elif n <= k:\r\n print(\"1\")\r\n else:\r\n k -= 1\r\n n -= 1\r\n if sum(k) < n:\r\n print(\"-1\")\r\n else:\r\n print(splitter(k, n))", "n,k = map(int, input().split())\r\nlow = 1\r\nhi = k\r\nok = False\r\ndef kad(n):\r\n return (n*(n+1))//2\r\nwhile low <= hi:\r\n mid = (low+hi) // 2\r\n can = kad(k) - kad(k-mid) - mid + 1\r\n if can >= n:\r\n ok = True\r\n hi = mid - 1\r\n else:\r\n low = mid +1\r\nprint(0 if n == 1 else hi+1 if ok else -1)\r\n", "n,k=map(int,input().split())\r\np=k-1\r\nts=1+ p*(p+1)//2\r\nlow=0\r\nhigh=10**9\r\nans=0\r\nres=0\r\nrs=0\r\n\r\nwhile low<=high:\r\n mid=(low+high)//2\r\n ls=mid*(mid+1)//2\r\n if ts-ls>n:\r\n low=mid+1\r\n else:\r\n res=mid\r\n ans=p-mid\r\n rs=ts-ls\r\n high=mid-1\r\nremain=n-rs\r\nlss=(res-1)*res//2\r\n#print(res,ans,remain,rs)\r\nif remain>lss:\r\n print(-1)\r\nelif remain==0:\r\n print(ans)\r\nelse:\r\n print(ans+1)", "\r\n\r\ndef s(n):\r\n return (n*(n+1))//2\r\n\r\ndef diff(st,en):\r\n return s(en) - s(st-1)\r\n\r\ndef bs(k,n):\r\n st = 1\r\n en = k\r\n while(st < en):\r\n mid = (st+en)//2\r\n sum = diff(mid,k)\r\n if sum == n:\r\n return k-mid+1\r\n if sum > n:\r\n st = mid+1\r\n else:\r\n en = mid\r\n return k-st+2\r\n\r\n\r\nif __name__ == '__main__':\r\n n,k = map(int,input().split())\r\n if n == 1:\r\n print(0)\r\n elif n <= k:\r\n print(1)\r\n else:\r\n n-=1\r\n k-=1\r\n if s(k) < n:\r\n print(-1)\r\n else:\r\n print(bs(k,n))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from sys import stdin ,stdout \r\ninput=stdin.readline \r\ninp = lambda : map(int,input().split())\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\na,b=inp();\r\n\r\nif a==1:\r\n print(0)\r\n exit()\r\n\r\nelif b>=a:\r\n print(1)\r\n exit()\r\n\r\nelse:\r\n a-=1\r\n b-=1\r\n l=0\r\n r=b\r\n x=-1\r\n while l < r :\r\n mid = (r+l)//2\r\n temp= (b*(b+1))//2 - (mid *(mid+1))//2\r\n \r\n if temp >=a :\r\n x=mid\r\n l=mid+1\r\n else:\r\n r=mid\r\nif x >=0:\r\n print(b-x)\r\nelse:\r\n print(x)\r\n\r\n\r\n\r\n\r\n", "def sum(k):\r\n return k*(k+1) // 2\r\n\r\n\r\nd = list(map(int, input().split()))\r\nn = d[0]-1\r\nk = d[1]-1\r\nl = 0\r\nr = k\r\nans = -1\r\n\r\nwhile l <= r:\r\n m = (l+r) // 2\r\n if (sum(k) - sum(m)) >= n:\r\n ans = k - m\r\n l = m + 1\r\n else:\r\n r = m - 1\r\n\r\nprint(ans)", "\r\ndef sm(n):\r\n return int(int(n*(n+1))/int(2));\r\ndef summ(en, st):\r\n if(st <= 1):\r\n return sm(en);\r\n return sm(en) - sm(st-1);\r\n\r\ndef bs(n, k):\r\n st = 1;\r\n en = k;\r\n while (st < en):\r\n md = int(int((st+en)) /int(2));\r\n s = summ(k,md);\r\n if(s == n):\r\n return k - md + 1;\r\n elif (s>n):\r\n st = md + 1;\r\n else :\r\n en = md;\r\n return k - st + 2;\r\nn, k = input().split();\r\nn = int(n);\r\nk = int(k);\r\n\r\nif(n == 1):\r\n print(0);\r\nelif (n <= k):\r\n print(1);\r\nelse:\r\n n -= 1;\r\n k -= 1;\r\n if(sm(k) < n ):\r\n print(-1);\r\n else:\r\n print(int(bs(n,k)));\r\n", "\r\ndef sum(n):\r\n return (n*(n+1)) // 2\r\n\r\n\r\nn, k = map(int, input().split())\r\nn -= 1\r\ns = sum(k - 1)\r\nif s < n:\r\n print(-1)\r\nelse:\r\n l, h = 0, k - 1\r\n while l <= h: \r\n mid = l + ( h - l) // 2\r\n if (s - sum(mid) >= n): \r\n l = mid + 1\r\n else : \r\n h = mid - 1\r\n print(k - 1 - h)\r\n", "n,k = list(map(int, input().split()))\r\n\r\nans = None\r\nl = 2\r\nr = k\r\nif n==1:\r\n print(0)\r\nelse:\r\n while l<=r:\r\n mid = (l+r)//2\r\n cur = ((k*(k+1)//2)) - (((mid-1)*(mid)//2)) - (k-mid)\r\n \r\n # print(mid, cur,12122121)\r\n if cur >= n:\r\n ans = mid\r\n l = mid+1\r\n else:\r\n r = mid-1\r\n \r\n print(-1 if not ans else k-ans+1)", "def getSum(n):\r\n return (n * (n + 1)) // 2\r\n\r\n\r\nn, k = map(int, input().split())\r\nn -= 1\r\ns = getSum(k - 1)\r\nif s < n:\r\n print(-1)\r\nelse:\r\n low = 0\r\n high = k-1\r\n while low < high:\r\n mid = (low + high) // 2\r\n if s-getSum(k-mid-1) >= n:\r\n high = mid\r\n else:\r\n low = mid + 1\r\n print(high)\r\n", "casas, tubos = map(int, input().strip().split())\n\ndef bs(c, t):\n l, r = 0, t-1\n while l <= r:\n mid = l+r >> 1\n if ((2*t - mid - 1)*mid)//2+1 < c:\n l = mid+1\n else:\n r = mid-1\n return r+1\n\nres = bs(casas, tubos)\nprint(-1 if res == tubos else res) \n \n", "def sum(l):\r\n return int((l*(l+1))/2)\r\n\r\ndef sume (s,e):\r\n if s <= 1:\r\n return sum(e)\r\n else:\r\n return sum(e) - sum(s-1)\r\n\r\ndef minsplitters(k,n):\r\n st=int(1)\r\n en = int(k)\r\n while(st < en):\r\n md = int((st + en)/2)\r\n s = sume(md, k)\r\n if s == n :\r\n return k - md +1\r\n if s > n :\r\n st = md+1\r\n else:\r\n en = md\r\n return k - st + 2\r\n\r\n\r\n\r\nn,k=map(int,input().split())\r\n\r\nif n==1:\r\n print(0)\r\nelif (n <= k):\r\n print(1)\r\n\r\nelse :\r\n n-=1\r\n k-=1\r\n\r\n if sum(k) < n:\r\n print(-1)\r\n\r\n else:\r\n print(minsplitters(k,n))", "# coding on a smartphone\r\nn, k = map(int, input().split())\r\nL = 0\r\nR = k\r\nwhile L<R:\r\n x = (L+R+1) // 2\r\n c = k*(k+1) // 2 - x*(x+1)//2 + 1 - (k-x)\r\n if n <= c:\r\n L = x\r\n else:\r\n R = x - 1\r\nif L == 0: print(-1)\r\nelse: print(k - L)", "n, k = map(int, input().split())\r\n\r\ndef bin(n, k):\r\n high = k\r\n low = 1\r\n while low <= high:\r\n mid = (low+high)//2\r\n val = (mid * (k-mid+1+k))// 2 + 1\r\n if val == n:\r\n return mid\r\n elif val > n:\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\n return mid\r\n\r\nif n == 1:\r\n print(0)\r\nelse:\r\n k = k - 1\r\n if (k*(k+1))//2 + 1 < n:\r\n print(-1)\r\n else:\r\n mid = bin(n, k)\r\n if (mid * (k-mid+1+k))// 2 + 1 < n:\r\n print(mid + 1)\r\n else:\r\n print(mid)\r\n", "def solve(n, k):\n total = k * (k - 1) // 2 + 1 \n if total < n:\n return -1 \n elif total == n:\n return k - 1 \n else:\n low = 1\n high = k\n while low < high:\n mid = (low + high) // 2 \n if total - mid * (mid + 1) // 2 >= n: \n low = mid + 1 \n else:\n high = mid \n return k - high \n\nn, k = map(int, input().strip().split())\nprint(solve(n, k))\n\n \t \t\t \t \t\t \t \t\t\t\t\t \t \t", "import bisect\r\n\r\nn, k = map(int, input().split())\r\n\r\nif n == 1:\r\n print(0)\r\n exit()\r\n \r\nstart, end = 2, k + 1\r\n\r\ndef sumn(l, r):\r\n return r * (r + 1) // 2 - l * (l - 1) // 2\r\n\r\ndef valid(mid):\r\n return sumn(mid, k) - (k - mid + 1) + 1 >= n\r\n\r\nwhile end - start > 1:\r\n mid = (start + end) // 2\r\n if valid(mid):\r\n start = mid\r\n else:\r\n end = mid\r\n \r\nif valid(start):\r\n print(k - start + 1)\r\nelse:\r\n print(-1)", "from sys import stdin, stdout\n\ninput = stdin.readline\n\n\ndef print(*args, end='\\n', sep=' ') -> None:\n stdout.write(sep.join(map(str, args)) + end)\n\n\ndef map_int():\n return map(int, input().split())\n\n\ndef list_int():\n return list(map(int, input().split()))\n\n\nfrom collections import defaultdict\n\nn, k = map_int()\nmx = (k * (k + 1)) // 2 - 1\nif mx - (k - 2) < n:\n print(-1)\n exit()\nif n == 1:\n print(0)\n exit()\nif n <= k:\n print(1)\n exit()\n\nl, r = 2, k\n\nans = 0\nwhile l <= r:\n mid = l + (r - l) // 2\n val = mx - (((mid) * (mid - 1)) // 2 - 1) - (k - mid)\n if val >= n:\n ans = mid - 1\n l = mid + 1\n else:\n r = mid - 1\n\nprint(k - ans)", "n,k=map(int,input().split())\nn,k=n-1,k-1\nl=0\nr=k\ng=k*(k+1)//2\nans=-1\nwhile l<=r:\n\tm=(l+r)//2\n\tif (g-m*(m+1)//2)>=n:\n\t\tans=k-m\n\t\tl=m+1\n\telse:\n\t\tr=m-1\nprint(ans)\n \t\t \t\t\t\t\t\t \t\t \t \t \t \t\t \t", "n, k = map(int, input().split())\r\ndef f(m):\r\n\tglobal n\r\n\tglobal k\r\n\ttotal = m*k - (m*(m-1))//2\r\n\ttotal -= (m-1)\r\n\treturn total >= n\r\nif ( (k*(k+1))//2 - (k-1) < n):\r\n\tprint(-1)\r\nelif n == 1:\r\n\tprint(0)\r\n\r\nelse:\r\n\tr = k\r\n\tl = 0\r\n\twhile (r>(l+1)):\r\n\t\tm = (r+l)//2\r\n\t\t# print(m, f(m))\r\n\t\tif (f(m) == 0):\r\n\t\t\tl = m\r\n\t\telse:\r\n\t\t\tr = m\r\n\tprint(r)\r\n\t\t", "def bs(n, k, lo, hi):\r\n while lo <= hi: \r\n mid = (hi + lo)//2\r\n summ = ((k * (k + 1))//2 - 1) - (((mid-1) * (mid))//2 -1) - (k-2)\r\n if summ == n: return k - mid + 1\r\n elif summ > n: lo = mid + 1 \r\n elif summ < n: hi = mid - 1\r\n if summ > n: mid += 1\r\n return k - mid + 1\r\n\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n if n == 1: return 0\r\n elif (k * (k + 1)//2) - (k-2) <= n: return -1\r\n elif k >= n: return 1\r\n else: return bs(n, k, 2, k)\r\n\r\nprint(solve())" ]

{"inputs": ["4 3", "5 5", "8 4", "1000000000000000000 1000000000", "499999998500000001 1000000000", "499999998500000000 1000000000", "499999999500000000 1000000000", "499999999500000001 1000000000", "525 34", "223265034477 726990", "15597035789572051 185473109", "499999999500000002 1000000000", "1 1000000000", "1000000000 2", "462498979 204468265", "2107921 542531", "131 49", "20171878992939541 200857557", "399812655947 894219", "93 17", "1000000000 999999999", "100000000000000000 1000000000"], "outputs": ["2", "1", "-1", "-1", "999955279", "999955279", "999999998", "999999999", "25", "440662", "128849771", "-1", "0", "-1", "3", "4", "3", "200853401", "893030", "8", "2", "105572810"]}

UNKNOWN

PYTHON3

CODEFORCES

50

8dd48a95d077948b9426c6505bdbe45c

none

This is an interactive problem. Jury has hidden a permutation *p* of integers from 0 to *n*<=-<=1. You know only the length *n*. Remind that in permutation all integers are distinct. Let *b* be the inverse permutation for *p*, i.e. *p**b**i*<==<=*i* for all *i*. The only thing you can do is to ask xor of elements *p**i* and *b**j*, printing two indices *i* and *j* (not necessarily distinct). As a result of the query with indices *i* and *j* you'll get the value , where denotes the xor operation. You can find the description of xor operation in notes. Note that some permutations can remain indistinguishable from the hidden one, even if you make all possible *n*2 queries. You have to compute the number of permutations indistinguishable from the hidden one, and print one of such permutations, making no more than 2*n* queries. The hidden permutation does not depend on your queries. The first line contains single integer *n* (1<=≤<=*n*<=≤<=5000) — the length of the hidden permutation. You should read this integer first. When your program is ready to print the answer, print three lines. In the first line print "!". In the second line print single integer *answers*_*cnt* — the number of permutations indistinguishable from the hidden one, including the hidden one. In the third line print *n* integers *p*0,<=*p*1,<=...,<=*p**n*<=-<=1 (0<=≤<=*p**i*<=<<=*n*, all *p**i* should be distinct) — one of the permutations indistinguishable from the hidden one. Your program should terminate after printing the answer. Sample Input 3 0 0 3 2 3 24 2 3 2 0 2 3 2 0 Sample Output ? 0 0 ? 1 1 ? 1 2 ? 0 2 ? 2 1 ? 2 0 ! 1 0 1 2? 0 1 ? 1 2 ? 2 3 ? 3 3 ? 3 2 ? 2 1 ? 1 0 ? 0 0 ! 2 3 1 2 0

[ "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(n):\r\n L = []\r\n for i in range(n):\r\n sys.stdout.write(f'? {i} 0\\n')\r\n sys.stdout.flush()\r\n ai = int(input())\r\n L.append(ai)\r\n L2 = []\r\n for i in range(n):\r\n sys.stdout.write(f'? 0 {i}\\n')\r\n sys.stdout.flush()\r\n bi = int(input())\r\n L2.append(bi)\r\n poss = []\r\n for i in range(n):\r\n if L[i]==i:\r\n x = L[i]\r\n P3 = [x^L[i] for i in range(n)]\r\n P4 = [L2[i]^P3[0] for i in range(n)]\r\n works = True\r\n for i in range(n):\r\n if P4[i] >=n:\r\n works = False\r\n break\r\n if P3[P4[i]] != i:\r\n works = False\r\n break\r\n if works:\r\n poss.append(x)\r\n sys.stdout.write('!\\n')\r\n sys.stdout.flush()\r\n sys.stdout.write(str(len(poss))+'\\n')\r\n sys.stdout.flush()\r\n x = poss[0]\r\n P3 = [x^L[i] for i in range(n)]\r\n sys.stdout.write(' '.join(map(str, P3))+'\\n')\r\n sys.stdout.flush()\r\n sys.exit()\r\n \r\nn = int(input())\r\nprocess(n)" ]

{"inputs": ["3\n0 1 2", "4\n3 1 2 0", "4\n3 2 1 0", "8\n2 3 0 1 4 5 6 7", "1\n0", "10\n0 1 2 3 4 5 6 7 8 9", "6\n0 1 2 4 3 5", "2\n0 1", "10\n6 7 4 5 0 1 8 9 2 3", "10\n9 8 1 7 6 4 5 2 0 3", "64\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 62 63 60 61", "128\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 126 123 124 125 122 127"], "outputs": ["1\n0 1 2 ", "2\n0 2 1 3 ", "4\n0 1 2 3 ", "4\n0 1 2 3 6 7 4 5 ", "1\n0 ", "2\n0 1 2 3 4 5 6 7 8 9 ", "1\n0 1 2 4 3 5 ", "2\n0 1 ", "2\n6 7 4 5 0 1 8 9 2 3 ", "1\n9 8 1 7 6 4 5 2 0 3 ", "4\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 62 63 60 61 ", "2\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 126 123 124 125 122 127 "]}

UNKNOWN

PYTHON3

CODEFORCES

1

8e200e66a6bc8b339fc2303f84d097ff

Geometrical Progression

For given *n*, *l* and *r* find the number of distinct geometrical progression, each of which contains *n* distinct integers not less than *l* and not greater than *r*. In other words, for each progression the following must hold: *l*<=≤<=*a**i*<=≤<=*r* and *a**i*<=≠<=*a**j* , where *a*1,<=*a*2,<=...,<=*a**n* is the geometrical progression, 1<=≤<=*i*,<=*j*<=≤<=*n* and *i*<=≠<=*j*. Geometrical progression is a sequence of numbers *a*1,<=*a*2,<=...,<=*a**n* where each term after first is found by multiplying the previous one by a fixed non-zero number *d* called the common ratio. Note that in our task *d* may be non-integer. For example in progression 4,<=6,<=9, common ratio is . Two progressions *a*1,<=*a*2,<=...,<=*a**n* and *b*1,<=*b*2,<=...,<=*b**n* are considered different, if there is such *i* (1<=≤<=*i*<=≤<=*n*) that *a**i*<=≠<=*b**i*. The first and the only line cotains three integers *n*, *l* and *r* (1<=≤<=*n*<=≤<=107,<=1<=≤<=*l*<=≤<=*r*<=≤<=107). Print the integer *K* — is the answer to the problem. Sample Input 1 1 10 2 6 9 3 1 10 3 3 10 Sample Output 101282

[ "import math\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, l, r = map(int, input().split())\r\nif n == 1:\r\n ans = r - l + 1\r\nelif n == 2:\r\n ans = (r - l + 1) * (r - l)\r\nelse:\r\n x = [1]\r\n if n < 30:\r\n for j in range(2, r + 1):\r\n u = pow(j, n - 1)\r\n if u > r:\r\n break\r\n x.append(u)\r\n m = len(x)\r\n ans = 0\r\n for i in range(m):\r\n u = x[i]\r\n for j in range(i + 1, m):\r\n v = x[j]\r\n if math.gcd(u, v) ^ 1:\r\n continue\r\n ans += max(0, r // v - (l - 1) // u)\r\n ans *= 2\r\nprint(ans)" ]

{"inputs": ["1 1 10", "2 6 9", "3 1 10", "3 3 10", "1 25 845", "2 25 845", "3 25 845", "4 25 845", "5 25 845", "6 25 845", "7 25 845", "8 25 845", "1 1 10000000", "2 1 10000000", "3 1 10000000", "4 1 10000000", "5 1 10000000", "6 1 10000000", "7 1 10000000", "8 1 10000000", "9 1 10000000", "10 1 10000000", "11 1 10000000", "12 1 10000000", "13 1 10000000", "14 1 10000000", "15 1 10000000", "16 1 10000000", "17 1 10000000", "18 1 10000000", "19 1 10000000", "20 1 10000000", "21 1 10000000", "22 1 10000000", "23 1 10000000", "24 1 10000000", "25 1 10000000", "123456 1 10000000", "10000000 1 10000000", "1 10000000 10000000", "2 10000000 10000000", "10000000 10000000 10000000", "1 5000000 10000000", "2 5000000 10000000", "3 5000000 10000000", "4 5000000 10000000", "5 5000000 10000000", "6 5000000 10000000", "7 5000000 10000000", "8 5000000 10000000", "1000 5000000 10000000", "1 100 1000000", "2 100 1000000", "3 100 1000000", "4 100 1000000", "5 100 1000000", "6 100 1000000", "7 100 1000000", "8 100 1000000", "9 100 1000000", "10 100 1000000", "11 100 1000000", "12 100 1000000", "13 100 1000000", "14 100 1000000", "15 100 1000000", "16 100 1000000", "17 100 1000000", "1 1 1", "10000000 1 1", "1 123 456789", "2 123 456789", "3 123 456789", "4 123 456789", "5 123 456789", "6 123 456789", "7 123 456789", "8 123 456789", "9 123 456789", "10 123 456789", "11 123 456789", "12 123 456789", "13 123 456789", "1 1 5000000", "2 1 5000000", "3 1 5000000", "4 1 5000000", "5 1 5000000", "6 1 5000000", "7 1 5000000", "8 1 5000000", "9 1 5000000", "10 1 5000000", "11 1 5000000", "12 1 5000000", "13 1 5000000", "14 1 5000000", "15 1 5000000", "16 1 5000000", "17 1 5000000", "18 1 5000000", "19 1 5000000", "20 1 5000000", "21 1 5000000", "22 1 5000000", "23 1 5000000", "24 1 5000000", "25 1 5000000", "2 1 1"], "outputs": ["10", "12", "8", "2", "821", "673220", "2150", "324", "84", "10", "2", "0", "10000000", "99999990000000", "89371160", "7299492", "2209708", "875204", "384900", "178350", "85060", "41286", "20250", "9996", "4954", "2464", "1228", "610", "304", "152", "76", "38", "18", "8", "4", "2", "0", "0", "0", "1", "0", "0", "5000001", "25000005000000", "7065044", "117250", "4674", "194", "8", "0", "0", "999901", "999801009900", "7474368", "715006", "217914", "86100", "37648", "17266", "8066", "3814", "1786", "788", "292", "46", "0", "0", "0", "1", "0", "456667", "208544292222", "3172916", "321710", "98144", "38632", "16734", "7566", "3480", "1588", "662", "206", "0", "5000000", "24999995000000", "42582108", "3640680", "1104328", "437484", "192426", "89168", "42518", "20638", "10116", "4998", "2476", "1232", "614", "304", "152", "76", "38", "18", "8", "4", "2", "0", "0", "0"]}

UNKNOWN

PYTHON3

CODEFORCES

1

8e2fa585a4cce90d151115947a7dfe76

Maximal Binary Matrix

You are given matrix with *n* rows and *n* columns filled with zeroes. You should put *k* ones in it in such a way that the resulting matrix is symmetrical with respect to the main diagonal (the diagonal that goes from the top left to the bottom right corner) and is lexicographically maximal. One matrix is lexicographically greater than the other if the first different number in the first different row from the top in the first matrix is greater than the corresponding number in the second one. If there exists no such matrix then output -1. The first line consists of two numbers *n* and *k* (1<=≤<=*n*<=≤<=100, 0<=≤<=*k*<=≤<=106). If the answer exists then output resulting matrix. Otherwise output -1. Sample Input 2 1 3 2 2 5 Sample Output 1 0 0 0 1 0 0 0 1 0 0 0 0 -1

[ "# -*- coding: utf-8 -*-\r\nn,k = map(int, input().split(' '))\r\nif k>n**2:\r\n print(-1)\r\nelif k==n**2:\r\n a = [['1']*n for i in range(n)]\r\n for i in range(n):\r\n a[i] = ' '.join(a[i])\r\n print(a[i])\r\nelse:\r\n a = [['0']*n for i in range(n)]\r\n c = 0\r\n i = 0\r\n b = True\r\n while b and i<n:\r\n for j in range(n):\r\n if i==j:\r\n if c+1>k:\r\n continue\r\n a[i][j] = '1'\r\n c += 1\r\n else:\r\n if a[j][i]!='1':\r\n if c + 2 >k:\r\n continue\r\n a[i][j] = '1'\r\n a[j][i] = '1'\r\n c += 2\r\n if c==k:\r\n b = False\r\n break\r\n i += 1\r\n for i in range(n):\r\n a[i] = ' '.join(a[i])\r\n print(a[i])\r\n", "n,k = map(int,input().split())\r\nmartix = [[0 for i in range(n)] for j in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if i == j :\r\n if k > 0:\r\n martix[i][j] = 1\r\n k -= 1\r\n else:\r\n if k > 1:\r\n martix[i][j],martix[j][i] = 1,1\r\n k -= 2\r\nif k > 0:\r\n print(-1)\r\nelse: \r\n for i in martix:\r\n print(' '.join(map(str,i)))", "n,k = map(int,input().split())\r\nmatrix = [[0]*n for i in range(n)]\r\n\r\n\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if k>1 and i != j:\r\n matrix[i][j] = 1\r\n matrix[j][i] = 1\r\n k -= 2\r\n elif k>0 and i == j:\r\n matrix[i][j] = 1\r\n matrix[j][i] = 1\r\n k -= 1\r\n\r\nif k == 0:\r\n for row in matrix:\r\n print(' '.join(map(str,row)))\r\nelse:\r\n print(\"-1\")", "n , k = map(int , input().split())\r\nmatrix = [[0] * n for _ in range(n)]\r\nleft = k\r\n\r\nif k > n ** 2:\r\n print(\"-1\")\r\n\r\nelse:\r\n\r\n for x in range(n):\r\n\r\n for y in range(x , n):\r\n\r\n if x == y:\r\n if left >= 1:\r\n matrix[x][y] = 1\r\n left -= 1\r\n \r\n else:\r\n if left >= 2:\r\n matrix[x][y] = matrix[y][x] = 1\r\n left -= 2\r\n elif left == 1:\r\n matrix[x + 1][x + 1] = 1\r\n \r\n for i in range(n):\r\n print(' '.join(map(str , matrix[i])))", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[n, k] = list(map(int, input().split()))\r\n\r\nif n*n < k:\r\n print('-1')\r\n exit(0)\r\n\r\na = [[0 for j in range(n)] for i in range(n)]\r\np = 0\r\nwhile k > 0:\r\n a[p][p] = 1\r\n k -= 1\r\n q = p+1\r\n while k > 1 and q < n:\r\n a[p][q] = 1\r\n a[q][p] = 1\r\n k -= 2\r\n q += 1\r\n p += 1 \r\n\r\nfor i in range(n):\r\n print(' '.join(map(str, a[i])))\r\n", "n,k=map(int,input().split())\r\na=[[0]*n for i in range(n)]\r\nif k>n*n:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n for j in range(i,n):\r\n if i==j and k>=1:\r\n a[i][i]=1\r\n k-=1\r\n elif k>=2:\r\n a[i][j]=1\r\n a[j][i]=1\r\n k-=2\r\n for row in a:\r\n print(\" \".join(map(str,row)))", "def place(N, k):\r\n ret = [['0'] * N for i in range(N)]\r\n if k == 0:\r\n return ret\r\n if k % 2 == 0:\r\n m = k // 2 - 1\r\n ret[0][0] = '1'\r\n ret[1][1] = '1'\r\n for i in range(1, m+1):\r\n ret[0][i] = '1'\r\n ret[i][0] = '1'\r\n else:\r\n m = k //2\r\n # print(m)\r\n ret[0][0] = '1'\r\n for i in range(1, m+1):\r\n ret[0][i] = '1'\r\n ret[i][0] = '1'\r\n # print(i)\r\n return ret\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n if k > n * n:\r\n print(-1)\r\n return\r\n m = 0\r\n N = n\r\n while k >= 2 * N - 1 and k>0:\r\n k -= 2 * N - 1\r\n m += 1\r\n N -= 1\r\n for i in range(m):\r\n this_row = ['1'] * n\r\n print(' '.join(this_row))\r\n l = place(N, k)\r\n for row in l:\r\n this_row = ['1'] * m + row\r\n print(' '.join(this_row))\r\n\r\nmain()\r\n", "#2300011725\r\nn,k=map(int,input().split())\r\nl=[]\r\nfor m in range(n):\r\n l.append([0]*n)\r\nif k>n**2:\r\n print(-1)\r\nelse:\r\n if k%2!=0:\r\n l[0][0]=1\r\n note=False\r\n for i in range(k//2):\r\n a=0\r\n stop=False\r\n while a<n and not stop:\r\n try:\r\n b=l[a].index(0)\r\n except ValueError:\r\n a+=1\r\n else:\r\n stop=True\r\n if a==b:\r\n if a+1!=n:\r\n l[a][b]=1\r\n l[a+1][b+1]=1\r\n else:\r\n note=True\r\n break\r\n else:\r\n l[a][b]=1\r\n l[b][a]=1\r\n if note:\r\n print(-1)\r\n else:\r\n for j in range(n):\r\n print(' '.join(list(map(str,l[j]))))", "n, k = map(int, input().split())\r\nif k > n**2:\r\n print(-1)\r\n exit()\r\nif k == 0:\r\n for i in range(n):\r\n print(*[0]*n)\r\n exit()\r\nans = [[0]*n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if ans[i][j] == 1:\r\n continue\r\n if k == 0:\r\n break\r\n if i != j:\r\n if k == 1:\r\n break\r\n else:\r\n ans[i][j] = 1\r\n ans[j][i] = 1\r\n k -= 2\r\n else:\r\n ans[i][i] = 1\r\n k -= 1\r\n else:\r\n continue\r\n break\r\nif k:\r\n for i in range(n):\r\n if ans[i][i] != 1:\r\n ans[i][i] = 1\r\n break\r\nfor i in range(n):\r\n print(*ans[i])\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 30 10:30:56 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\nn,k=map(int,input().split())\r\nmatrix=[[0]*n for x in range(n)]\r\nresult=False\r\nif k==0:\r\n for row in matrix:\r\n print(*row)\r\nelif k!=0 and k<=n*n:\r\n for i in range(n):\r\n if result:\r\n break\r\n matrix[i][i]=1\r\n k-=1\r\n if k==0:\r\n for row in matrix:\r\n print(*row)\r\n break\r\n elif k==1:\r\n matrix[i+1][i+1]=1\r\n for row in matrix:\r\n print(*row)\r\n break\r\n elif k>1:\r\n for m in range(i+1,n):\r\n matrix[m][i]=1\r\n matrix[i][m]=1\r\n k-=2\r\n if k>1:\r\n continue\r\n elif k==1:\r\n matrix[i+1][i+1]=1\r\n for row in matrix:\r\n print(*row)\r\n result=True\r\n break\r\n elif k==0:\r\n for row in matrix:\r\n print(*row)\r\n result=True\r\n break\r\nelif k>n*n:\r\n print(-1)\r\n\r\n \r\n \r\n \r\n", "def printM(M):\r\n for i in M:\r\n for j in i:\r\n print(j, end = \" \")\r\n print()\r\n\r\nn, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\n\r\nif k > n*n:\r\n print(-1)\r\n exit()\r\n\r\nM = []\r\nfor i in range(n):\r\n M.append([0 for j in range(n)])\r\n\r\nleft = k\r\n\r\nfor i in range(n):\r\n if left == 0:\r\n printM(M)\r\n exit()\r\n \r\n M[i][i] = 1\r\n left -= 1\r\n\r\n for j in range(i+1, n):\r\n ##print(\"i =\", i, \"j = \", j)\r\n if left == 0:\r\n printM(M)\r\n exit()\r\n if left == 1:\r\n M[i+1][i+1] = 1\r\n ##left -= 1\r\n printM(M)\r\n exit()\r\n \r\n M[i][j] = M[j][i] = 1\r\n left -= 2\r\n\r\nprintM(M)\r\n", "n,k=map(int,input().split())\r\nif n*n<k:\r\n print(-1)\r\nelse:\r\n mat=[[0]*n for i in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n if k>0 and mat[i][j]==0:\r\n if i==j:\r\n mat[i][j]=1\r\n k-=1\r\n elif k>=2:\r\n mat[i][j]=1\r\n mat[j][i]=1\r\n k-=2\r\n for i in range(n):\r\n for j in range(n):\r\n print(mat[i][j],end=\" \")\r\n print()", "n, m = map(int,input().split())\r\narr = [[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if(m > 0 and i == j):\r\n m -= 1-arr[i][j]\r\n arr[i][j] = 1\r\n elif(m > 1):\r\n m -= 2-arr[i][j]-arr[j][i]\r\n arr[i][j] = 1\r\n arr[j][i] = 1\r\nif(not m):\r\n for i in arr:\r\n print(*i)\r\nelse:\r\n print(-1)", "n,k=map(int,input().split())\r\nif k==0:\r\n ls=[[0 for i in range(n)]for i in range(n)]\r\n for i in ls:\r\n print(*i)\r\nelif k>n*n:\r\n print(-1)\r\nelse:\r\n ls=[[0 for i in range(n)]for i in range(n)]\r\n lz = [[0 for i in range(n)] for i in range(n)]\r\n x=k\r\n for i in range(n):\r\n ls[i][i]=1\r\n x-=1\r\n g=False\r\n if x==0:\r\n break\r\n for j in range(i+1,n):\r\n if x==1:\r\n continue\r\n ls[i][j]=1\r\n ls[j][i]=1\r\n x-=2\r\n if x<=0:\r\n g=True\r\n break\r\n if g==True:\r\n break\r\n for i in ls:\r\n print(*i)\r\n\r\n", "\r\nn,k=map(int,input().split())\r\nmatrix=[[0]*n for i in range(n)]\r\nif k>n*n:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n for j in range(i,n):\r\n if not k:break\r\n if i==j:\r\n k-=1;matrix[i][j]=1\r\n else:\r\n if k<2:break\r\n k-=2\r\n matrix[i][j]+=1\r\n matrix[j][i]+=1\r\n for i in range(n):\r\n for j in range(n):\r\n if j!=n-1:\r\n print(matrix[i][j],end=' ')\r\n else:\r\n print(matrix[i][j])", "n, k = map(int, input().split())\r\nif k > n*n:\r\n print(-1)\r\nelse:\r\n M = [['0']*n for _ in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n if M[i][j] == '0':\r\n if k > 1:\r\n if i == j:\r\n k -= 1\r\n M[i][j] = '1'\r\n else:\r\n k -= 2\r\n M[i][j] = '1'\r\n M[j][i] = '1'\r\n elif k == 1:\r\n if i == j:\r\n k -= 1\r\n M[i][j] = '1'\r\n break\r\n else:\r\n break\r\n if k == 0:\r\n break\r\n for i in range(n):\r\n print(' '.join(M[i]))\r\n", "# 李城岳生命科学学院 2300012106\r\nx, y = map(int, input().split())\r\nif y > x*x:\r\n print(-1)\r\nelse:\r\n matrix = []\r\n for i in range(x):\r\n row = []\r\n for e in range(x):\r\n row.append('0')\r\n matrix.append(row)\r\n for i in range(x):\r\n for e in range(x-i):\r\n if y < 1:\r\n break\r\n if e == 0:\r\n matrix[i][i+e] = '1'\r\n y -= 1\r\n elif e != 0 and y >= 2:\r\n matrix[i][i+e] = '1'\r\n matrix[i+e][i] = '1'\r\n y -= 2\r\n elif e != 0 and y == 1:\r\n matrix[i+1][i+1] = '1'\r\n y -= 1\r\n for i in matrix:\r\n print(' '.join(i))\r\n", "def f(n,k):\r\n matrix=[[0]*n for _ in range(n)]\r\n if k>n**2:\r\n return [[-1]]\r\n else:\r\n \r\n if k==0:\r\n return matrix\r\n else:\r\n s=0\r\n x=1\r\n flag=n\r\n while k>0:\r\n x=1\r\n matrix[s][s]=1\r\n k-=1\r\n while k>1 and x<flag:\r\n matrix[s][n-flag+x]=1\r\n matrix[n-flag+x][s]=1\r\n x+=1\r\n k-=2\r\n flag-=1\r\n s+=1\r\n return matrix\r\nn,k=map(int,input().split())\r\nans=f(n, k)\r\nfor i in ans:\r\n print(*i,sep=' ')", "a = []\r\n\r\n\r\ndef mark(kk, x):\r\n global a\r\n if kk >= 2 * x - 1:\r\n for i in range(x):\r\n a[x - 1][i] = 1\r\n a[i][x - 1] = 1\r\n if x != 1:\r\n mark(kk - 2 * x + 1, x - 1)\r\n else:\r\n if kk != 0 and kk % 2 == 0:\r\n h = kk // 2\r\n a[x - 1][x - 1] = 1\r\n a[x - 2][x - 2] = 1\r\n for i in range(h):\r\n a[x - 1][x - 1 - i] = 1\r\n a[x - 1 - i][x - 1] = 1\r\n elif kk % 2 == 1:\r\n h = kk // 2 + 1\r\n a[x - 1][x - 1] = 1\r\n for i in range(h):\r\n a[x - 1][x - 1 - i] = 1\r\n a[x - 1 - i][x - 1] = 1\r\n\r\n\r\nn, k = map(int, input().split())\r\nif k > n ** 2:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n a.append([])\r\n for j in range(n):\r\n a[i].append(0)\r\n mark(k, n)\r\n a.reverse()\r\n for i in range(n):\r\n a[i].reverse()\r\n for j in range(n):\r\n if j != n - 1:\r\n print(f'{a[i][j]} ',end='')\r\n else:\r\n print(a[i][j])\r\n\r\n", "\ndef maximal_binary_matrix(n, k):\n matrix = [[0] * n for _ in range(n)]\n for i in range(n):\n for j in range(i, n):\n if i == j and k >= 1:\n matrix[i][j] = 1\n k -= 1\n elif k >= 2:\n matrix[i][j] = 1\n matrix[j][i] = 1\n k -= 2\n return matrix if k == 0 else None\n\n\nn, k = map(int, input().split())\nm = maximal_binary_matrix(n, k)\nif m:\n for row in m:\n print(*row)\nelse:\n print(-1)\n", "n,k=map(int,input().split())\r\nif k>n**2:\r\n print(-1)\r\nelse:\r\n mx=[[0]*n for i in range(n)]\r\n if k==0:\r\n for i in range(n):\r\n print(' '.join(str(x) for x in mx[i]))\r\n else:\r\n for x in range(n):\r\n for y in range(n):\r\n if mx[x][x]==0 and k>=1:\r\n mx[x][x]=1\r\n k-=1\r\n elif mx[x][y]+mx[y][x]<2 and k>=2:\r\n mx[x][y]=1\r\n mx[y][x]=1\r\n k-=2\r\n for a in range(n):\r\n print(' '.join(str(x) for x in mx[a]))", "n,k=map(int,input().split())\r\nif k>n**2:\r\n print(-1)\r\nelse:\r\n ans=[[0]*n for _ in range(n)]\r\n i,j=0,0\r\n while k>2:\r\n if i==j:\r\n ans[i][j]=1\r\n k-=1\r\n else:\r\n ans[i][j],ans[j][i]=1,1\r\n k-=2\r\n if j==n-1:\r\n i+=1\r\n j=i\r\n else:\r\n j+=1\r\n if i!=j:\r\n if k==1:\r\n ans[i+1][i+1]=1\r\n elif k==2:\r\n ans[i][j],ans[j][i]=1,1\r\n elif i==j:\r\n if k==1:\r\n ans[i][j]=1\r\n elif k==2:\r\n ans[i][j],ans[i+1][j+1]=1,1\r\n for row in ans:\r\n print(' '.join(map(str,row)))", "N, K = map( int, input().split() )\r\nif K > N * N:\r\n exit( print( -1 ) )\r\nG = [ [ 0 for i in range( N ) ] for j in range( N ) ]\r\nfor i in range( N ):\r\n if K == 0: break\r\n G[ i ][ i ] = 1\r\n K -= 1\r\n for j in range( i + 1, N ):\r\n if K <= 1: break\r\n G[ i ][ j ], G[ j ][ i ] = 1, 1\r\n K -= 2\r\nfor i in range( N ):\r\n print( ' '.join( str( v ) for v in G[ i ] ) )\r\n", "n, k = map( int, input(). split() )\ntab = [ [ 0 for x in range(n) ] for y in range(n) ]\nfor i in range(n):\n for j in range(i, n): \n if i != j:\n if k >= 2:\n tab[i][j] = 1;\n tab[j][i] = 1\n k = k - 2\n else: \n if k >= 1:\n tab[i][j] = 1\n k = k - 1\nif k > 0:\n print(-1)\nelse:\n for i in range(n):\n for j in range(n):\n print( tab[i][j], end = ' ' )\n print('')\n", "n, k = map(int, input().split())\r\nmat = [[0]*n for x in range(n)]\r\n\r\nfor row in range(n):\r\n for col in range(row,n):\r\n if row != col and k >= 2:\r\n mat[row][col] = 1\r\n mat[col][row] = 1\r\n k -= 2\r\n #print(row, col,k)\r\n elif row == col and k >= 1:\r\n mat[row][col] = 1\r\n k -= 1\r\n #print(row, col,k)\r\n\r\nif k > 0:\r\n print(-1)\r\nelse:\r\n for l in mat:\r\n print(\" \".join([str(x) for x in l]))", "\r\nn,k=map(int,input().split())\r\nnx=[n*[0] for _ in range(n)]\r\n\r\nif n*n>=k:\r\n for i in range(n):\r\n for j in range(n):\r\n if i==j and nx[i][j]!=1 and k>=1:\r\n nx[i][j]=1\r\n k-=1\r\n if i!=j and nx[i][j]!=1 and k>=2:\r\n nx[i][j],nx[j][i]=1,1\r\n k-=2\r\n for row in nx:\r\n print(*row)\r\n\r\nelse:\r\n print(\"-1\")\r\n\r\n\r\n", "n, k = map(int, input().split())\r\nif n * n < k:\r\n print(-1)\r\n exit()\r\nelse:\r\n T = [[0] * n for i in range(n)]\r\n for i in range(n):\r\n for j in range(i, n):\r\n if k >= 1:\r\n if i == j:\r\n T[i][j] = 1\r\n k -= 1\r\n elif k >= 2:\r\n T[i][j] = 1\r\n T[j][i] = 1\r\n k -= 2\r\n\r\n for i in range(n):\r\n print(*T[i])\r\n", "from itertools import product\r\nfrom sys import exit\r\n\r\nn, k = map(int, input().split())\r\nif k > n**2:\r\n print(-1)\r\n exit(0)\r\nmat = [[0]*n for i in range(n)]\r\nfor i, j in product(range(n), repeat=2):\r\n a = i==j or 2\r\n if mat[i][j] == 0 and k >= a:\r\n k -= a\r\n mat[i][j] = mat[j][i] = 1\r\nfor row in mat:\r\n print(*row)", "import math\r\nn, k = map(int, input().split(\" \"))\r\nif k > n ** 2:\r\n print(-1)\r\nelse:\r\n i = math.floor(math.sqrt(n ** 2 - k))\r\n matrix = [[1 for _ in range(n)] for _ in range(n-i)]\r\n row = [1 for _ in range(n-i)]\r\n for _ in range(i):\r\n row.append(0)\r\n for _ in range(i):\r\n matrix.append(list(row))\r\n\r\n x = n ** 2 - k - i ** 2\r\n\r\n for j in range(x//2):\r\n matrix[n-i-1][n-1-j] = 0\r\n matrix[n-1-j][n-i-1] = 0\r\n\r\n if x % 2 != 0:\r\n matrix[n-i][n-i] = 1\r\n matrix[n-i-1][n-1-x//2] = 0\r\n matrix[n-1-x//2][n-i-1] = 0\r\n\r\n for m in range(n):\r\n lst = list(map(str, matrix[m]))\r\n str1 = \" \".join(lst)\r\n print(str1)", "n, k = map(int, input().split())\r\nif k > n*n:\r\n print(-1)\r\nelse:\r\n m = [[0]*n for i in range(n)]\r\n i = 0\r\n while k > 0 and i < n:\r\n j = i\r\n while k > 0 and j < n:\r\n if i == j:\r\n m[i][j] = 1\r\n k -= 1\r\n elif k >=2:\r\n m[i][j] = 1\r\n m[j][i] = 1\r\n k -= 2\r\n j += 1\r\n i += 1\r\n for row in m:\r\n print(*row)\r\n", "def maxim():\r\n n,k=map(int,input().strip().split())\r\n if k<0:\r\n print(-1)\r\n return\r\n\r\n if k>(n**2):\r\n print(-1)\r\n return\r\n \r\n a=[[0 for _ in range(n)] for _ in range(n)]\r\n \r\n for i in range(n):\r\n if k>=1:\r\n a[i][i]=1\r\n k-=1\r\n for j in range(i+1,n):\r\n if k>=2:\r\n a[i][j]=1\r\n a[j][i]=1\r\n k-=2\r\n elif k>=1:\r\n break\r\n if k>0:\r\n print(-1)\r\n return\r\n\r\n for i in range(n):\r\n b=[str(i) for i in a[i]]\r\n b=' '.join(b)\r\n print(b)\r\n\r\nmaxim()\r\n", "n,k=map(int,input().split())\r\nif n*n<k:\r\n print(-1)\r\nelse:\r\n mat=[]\r\n a=[]\r\n t=n\r\n for i in range(t):\r\n for i in range(t):\r\n a.append(0)\r\n mat.append(a)\r\n a=[]\r\n \r\n for i in range(t):\r\n for j in range(t):\r\n if i!=j and k>1:\r\n if mat[i][j]:\r\n continue\r\n else:\r\n mat[i][j]=1\r\n mat[j][i]=1\r\n k-=2\r\n elif i==j and k:\r\n mat[i][j]=1\r\n k-=1\r\n for i in range(t):\r\n for j in range(t-1):\r\n print(\"%d\" % mat[i][j],end=\" \")\r\n print(mat[i][t-1])\r\n", "a, b = map(int, input().split())\r\nl = [[\"0\" for w in range(a)] for v in range(a)]\r\nif b > a ** 2:\r\n print(\"-1\")\r\nelse:\r\n for i in range(a):\r\n if b - 1 >= 0:\r\n l[i][i]=\"1\"\r\n b-=1\r\n for j in range(i,a):\r\n if b - 2 >= 0:\r\n if l[i][j]!=\"1\":\r\n l[i][j]=\"1\"\r\n b -= 1\r\n if l[j][i]!=\"1\":\r\n l[j][i]=\"1\"\r\n b -= 1\r\n else:\r\n break\r\n for p in l:\r\n print(\" \".join(p))", "n,k=map(int,input().split())\r\nif k>n*n:\r\n print(-1)\r\n exit()\r\nans=[[0]*n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if k>0 and i==j:\r\n ans[i][i]=1\r\n k-=1\r\n elif k>1:\r\n ans[i][j]=1\r\n ans[j][i]=1\r\n k-=2\r\n\r\nfor i in ans:\r\n print(*i)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 31 21:55:23 2023\r\n\r\n@author: liu\r\n\"\"\"\r\n\r\nn,k = map(int,input().split())\r\nmat = [ [1] * n for _ in range(n)]\r\nif n**2 < k:\r\n print(-1)\r\nelif n**2 == k:\r\n for i in mat:\r\n print(*i)\r\nelse:\r\n a = int((n**2 - k) ** 0.5)\r\n b = n**2 - k - a**2\r\n for m in range(0,a):\r\n for h in range(0,a):\r\n mat[-1-m][-1-h] = 0\r\n if b % 2 == 0:\r\n c = int(b/2)\r\n for i in range(0,c):\r\n mat[-a-1][-1-i] = 0\r\n mat[-1-i][-a-1] = 0\r\n else:\r\n mat[-a][-a] = 1\r\n c = int((b+1)/2)\r\n for i in range(0,c):\r\n mat[-a-1][-1-i] = 0\r\n mat[-1-i][-a-1] = 0\r\n for i in mat:\r\n print(*i)", "from sys import stdin,stdout, setrecursionlimit\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict as dd\r\nfrom bisect import bisect_left as bl,bisect_right as br\r\n\r\ninp =lambda: int(input())\r\nstrng =lambda: input().strip()\r\njn =lambda x,l: x.join(map(str,l))\r\nstrl =lambda: list(input().strip())\r\nmul =lambda: map(int,input().strip().split())\r\nmulf =lambda: map(float,input().strip().split())\r\nseq =lambda: list(map(int,input().strip().split()))\r\n\r\nceil =lambda x: int(x) if(x==int(x)) else int(x)+1\r\nceildiv=lambda x,d: x//d if(x%d==0) else x//d+1\r\n\r\nflush =lambda: stdout.flush()\r\nstdstr =lambda: stdin.readline()\r\nstdint =lambda: int(stdin.readline())\r\nstdpr =lambda x: stdout.write(str(x))\r\n\r\nmod=1000000007\r\n\r\n# A. Maximal Binary Matrix\r\n\r\nabc = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\ndef solve():\r\n n, k = mul()\r\n \r\n total = n*n\r\n \r\n grid = []\r\n for i in range(n):\r\n row = ['0']*n\r\n grid.append(row)\r\n \r\n if k > total: \r\n stdpr('-1\\n')\r\n return\r\n \r\n for i in range(n):\r\n for j in range(i, n):\r\n if i == j:\r\n if k>=1:\r\n grid[i][j] = '1'\r\n k-=1\r\n else:\r\n break\r\n else:\r\n if k >= 2:\r\n grid[i][j] = '1'\r\n grid[j][i] = '1'\r\n k-=2\r\n else:\r\n continue\r\n \r\n for i in range(n):\r\n row = grid[i]\r\n stdpr(' '.join(row))\r\n stdpr('\\n')\r\n \r\n# for tc in range(int(input())): solve()\r\nsolve()", "n, k = map(int, input().split())\r\n\r\nif k > n*n:\r\n print(-1)\r\nelse:\r\n G = [[0 for _ in range(n)] for _ in range(n)]\r\n \r\n for i in range(1, n+1):\r\n if k == 0:\r\n break\r\n for j in range(i, n+1):\r\n if k == 0:\r\n break\r\n if i == j:\r\n G[i-1][j-1] = 1\r\n k -= 1\r\n else:\r\n if k >= 2:\r\n G[i-1][j-1] = G[j-1][i-1] = 1\r\n k -= 2\r\n\r\n for row in G:\r\n print(\" \".join(str(cell) for cell in row))", "n,k=map(int,input().split())\r\nbian=(0,1)\r\nduijiaoxian=(0,0)\r\nmartirx=[]\r\nfor i in range(n):\r\n martirx.append([0 for i in range(n)])\r\nwhile 1:\r\n if k==0:\r\n break\r\n if duijiaoxian[0]>=n:\r\n break\r\n if martirx[duijiaoxian[0]][duijiaoxian[1]]==0:\r\n martirx[duijiaoxian[0]][duijiaoxian[1]]=1\r\n k-=1\r\n continue\r\n if bian[1]>=n:\r\n duijiaoxian=(bian[0]+1,bian[0]+1)\r\n bian=(duijiaoxian[0],duijiaoxian[0]+1)\r\n continue\r\n if k>=2:\r\n martirx[bian[0]][bian[1]]=1\r\n martirx[bian[1]][bian[0]]=1\r\n bian=(bian[0],bian[1]+1)\r\n k-=2\r\n continue\r\n if k==1:\r\n martirx[bian[0]+1][bian[0]+1]=1\r\n k-=1\r\n break\r\nif k==0:\r\n for i in martirx:\r\n print(' '.join(str(s) for s in i))\r\nelse:\r\n print(-1)", "x=input()\r\ny=list(x)\r\nz=y.index(' ')\r\nn=int(x[:z])\r\nk=int(x[z+1:])\r\nh=[[0 for i in range(n)] for j in range(n)]\r\nif k>n*n:\r\n print(-1)\r\nif k<=n*n:\r\n for i in range(1,n+1):\r\n u=2*n*i-i*i\r\n if u>=k:\r\n v=2*(i-1)*n-(i-1)*(i-1)\r\n w=k-v\r\n g=i-1\r\n break\r\n if g>0:\r\n for i in range(g):\r\n for j in range(n):\r\n h[i][j]=1\r\n h[j][i]=1\r\n if w%2==0:\r\n if w//2>0:\r\n for i in range(1):\r\n for j in range(w//2):\r\n h[i+g][j+g]=1\r\n h[j+g][i+g]=1\r\n h[g+1][g+1]=1\r\n if w%2==1:\r\n for i in range(1):\r\n for j in range(w//2+1):\r\n h[i+g][j+g]=1\r\n h[j+g][i+g]=1\r\n if g==0:\r\n if w%2==0:\r\n if w//2>0:\r\n for i in range(1):\r\n for j in range(w//2):\r\n h[i][j+g]=1\r\n h[j+g][i]=1\r\n h[g+1][g+1]=1\r\n if w%2==1:\r\n for i in range(1):\r\n for j in range(w//2+1):\r\n h[i+g][j+g]=1\r\n h[j+g][i+g]=1 \r\n for i in range(n):\r\n for j in range(n):\r\n if j==n-1:\r\n print(h[i][j])\r\n else:\r\n print(h[i][j],end=\" \")\r\n \r\n \r\n \r\n", "\r\nn,k=input('').split()\r\nn=int(n)\r\nk=int(k)\r\narr=[[0 for x in range(n)]for y in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if arr[i][j]==arr[j][i]==0:\r\n if i==j and k>0:\r\n arr[i][j]=1\r\n k=k-1\r\n if i!=j and k>1:\r\n arr[i][j]=1\r\n arr[j][i]=1\r\n k=k-2\r\nif k==0:\r\n lines = []\r\n for row in arr:\r\n lines.append(' '.join(str(x) for x in row))\r\n print('\\n'.join(lines))\r\nelse:\r\n print('-1')", "\r\nn, k = map(int, input().split() )\r\n\r\nif k> n*n:\r\n print(-1)\r\nelse:\r\n b = [[0]*n for i in range(n)]\r\n c = 0\r\n i = 0\r\n j = 0\r\n t = -1\r\n while c < k:\r\n if i == j:\r\n b[i][j] = 1\r\n c += 1\r\n j += 1\r\n t = 0\r\n \r\n elif j == n:\r\n i += 1\r\n j = i\r\n t = 1\r\n \r\n else:\r\n \r\n b[i][j] = 1\r\n b[j][i] = 1\r\n j += 1\r\n c+=2\r\n t = 2\r\n \r\n if c == k:\r\n p = \"\"\r\n for q in range(n):\r\n for w in range(n):\r\n p += str(b[q][w]) + \" \"\r\n print(p)\r\n p = \"\"\r\n \r\n else:\r\n if t == 0:\r\n j -= 1\r\n if t == 1:\r\n i -=1\r\n j = n-1\r\n if t == 2:\r\n j -=1\r\n b[i][j] = 0\r\n b[j][i] = 0\r\n b[i+1][i+1] = 1\r\n p = \"\"\r\n for q in range(n):\r\n for w in range(n):\r\n p += str(b[q][w]) + \" \"\r\n print(p)\r\n p = \"\"\r\n \r\n", "n, k = map(int, input().split())\r\nnum = [[0] * n for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(i, n):\r\n if k > 1 and i != j:\r\n num[i][j] = 1\r\n num[j][i] = 1\r\n k -= 2\r\n elif k > 0 and i == j:\r\n num[i][i] = 1\r\n k -= 1\r\n\r\nif k == 0:\r\n for i in range(n):\r\n print(\" \".join(map(str, num[i])))\r\nelse:\r\n print(\"-1\")\r\n", "n,k=map(int,input().split())\r\nif k>n**2:\r\n exit(print(-1))\r\nelse:\r\n a=[[0]*n for i in range(n)]\r\n for i in range(n):\r\n for j in range(i,n):\r\n if i!=j and k==1:\r\n a[i+1][i+1]=1;k-=1\r\n elif i==j and k>0:\r\n a[i][j]=1;k-=1\r\n elif k>=2:\r\n a[i][j]=1;a[j][i]=1;k-=2\r\n elif k==0:\r\n break\r\nfor i in a:\r\n print(*i)\r\n ", "#author 沈天健 2300011417\r\nn,k=map(int,input().split())\r\nmatrix=[[2 for _ in range(0,n+1+1)] for __ in range(0,n+1+1)]\r\nans=[[0 for _ in range(0,n+1+1)] for __ in range(0,n+1+1)]\r\nfor i in range(1,n+1):\r\n matrix[i][i]=1\r\nfor i in range(1,n+1):\r\n for j in range(i,n+1):\r\n if k>=matrix[i][j]:\r\n k-=matrix[i][j]\r\n ans[i][j]=1\r\n ans[j][i]=1\r\n elif k==1:\r\n ans[i+1][i+1]=1\r\n k=0\r\n break\r\n elif k==0:\r\n break\r\n else:\r\n continue\r\n break\r\nif k>0:\r\n print(\"-1\")\r\nelse:\r\n print('\\n'.join([' '.join(map(str,ans[_][1:n+1])) for _ in range(1,n+1)]))", "n , k = list(map(int,input().split()))\r\nif k > n**2:\r\n print(-1)\r\nelse:\r\n mt = [[0 for i in range(n)] for i in range(n)]\r\n for i in range(n):\r\n if k == 0:\r\n break\r\n mt[i][i] = 1\r\n k -= 1\r\n for j in range(i+1,n):\r\n if k > 1:\r\n mt[i][j] = 1\r\n mt[j][i] = 1\r\n k -= 2\r\n else:\r\n break\r\n for i in mt:\r\n print(*i)\r\n", "n,k=map(int,input().split())\r\nif k>(n*n):\r\n\tprint(-1)\r\nelse:\r\n\tmat=[[0]*n for i in range(n)]\r\n\tfor i in range(n):\r\n\t\tif k==0:\r\n\t\t\tbreak\r\n\t\tmat[i][i]=1\r\n\t\tk-=1\r\n\t\tfor j in range(i+1,n):\r\n\t\t\tif k>1:\r\n\t\t\t\tmat[i][j]=1\r\n\t\t\t\tmat[j][i]=1\r\n\t\t\t\tk-=2\r\n#\t\tprint(mat,k)\r\n\tfor i in mat:\r\n\t\tprint(*i)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Thu Oct 26 15:51:17 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\n#最大二元矩阵\n#显然是一道贪心问题，用数学思维做起来思路清晰.\nimport math\n\na,b=map(int,input().split())\nmx=[[0 for i in range(a)] for j in range(a)]\nif b>a*a:\n print(-1)\nelse:\n #先‘倒着填’\n c=math.ceil((a*a-b)**0.5)#正方形区域不能被填入1\n for i in range(a-c,a):\n for j in range(a-c,a):\n mx[i][j]=-1\n for i in range(a):\n for j in range(a):\n mx[i][j]+=1\n #再‘正着填’\n d=c*c+b-a*a\n if d>0 and d%2!=0:\n for i in range(a-c,a-c+int((d+1)/2)):\n mx[a-c][i]=1\n mx[i][a-c]=1\n if d>0 and d%2==0:\n for i in range(a-c,a-c+int(d/2)):\n mx[a-c][i]=1\n mx[i][a-c]=1\n mx[a-c+1][a-c+1]=1\n #输出\n for i in mx:\n st=''\n for j in i:\n st+=str(j)\n st+=' '\n print(st)\n \n \n \n \n \n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 24 10:23:52 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\ndef check(k):\r\n if k>1:\r\n return True\r\n return False\r\n\r\nn,k=map(int,input().split())\r\nmartix=[[\"0\"]*n for _ in range(n)]\r\nif n*n<k:\r\n print(-1)\r\nelse: \r\n m=0\r\n while check(k):\r\n martix[m][m]=\"1\"\r\n k-=1\r\n i=m+1\r\n while check(k) and i<n:\r\n martix[i][m]=\"1\"\r\n martix[m][i]=\"1\"\r\n k-=2\r\n i+=1\r\n m+=1\r\n if k==1:\r\n martix[m][m]=\"1\"\r\n for l in martix:\r\n print(\" \".join(l))", "n,k=map(int,input().split())\r\nif k>(n**2):\r\n print(-1)\r\nelif k==(n**2):\r\n for _ in range(n):\r\n print(\" \".join(str(j) for j in [1]*n))\r\nelse:\r\n num=0\r\n x=0\r\n N=n+1-1\r\n mx=[[0]*n for _ in range(n)]\r\n while True:\r\n num+=2*N-1\r\n if num>k :\r\n break\r\n else:\r\n x+=1\r\n N-=1\r\n for i in range(x):\r\n for j in range(n):\r\n mx[i][j]=1\r\n mx[j][i]=1 \r\n s=k-(num-(2*N-1))\r\n count=0\r\n if s%2==1:\r\n mx[x][x]=1\r\n dx=1\r\n while count<(s-1)/2:\r\n mx[x][x+dx]=1\r\n mx[x+dx][x]=1\r\n count+=1\r\n dx+=1\r\n else:\r\n if s==0:\r\n pass\r\n else:\r\n mx[x][x]=1\r\n mx[x+1][x+1]=1\r\n dx=1\r\n while count<s/2-1:\r\n mx[x][x+dx]=1\r\n mx[x+dx][x]=1\r\n dx+=1\r\n count+=1\r\n for i in range(n):\r\n print(\" \".join(str(j) for j in mx[i]))\r\n ", "# coding: utf-8\n\ndef format(res):\n return '\\n'.join([' '.join(line) for line in res])\n\ndef solution(n, k):\n if k > n ** 2:\n return -1\n \n res = [['0'] * n for _ in range(n)]\n for i in range(n):\n if k == 0:\n return format(res)\n else:\n res[i][i] = '1'\n k -= 1\n j = i + 1\n while j < n and k > 1:\n res[i][j] = res[j][i] = '1'\n k -= 2\n j += 1\n \n if k == 0:\n return format(res)\n return -1\n\n\nif __name__ == '__main__':\n n, k = [int(val) for val in input().split()]\n print(solution(n, k))", "import sys \r\nimport math\r\n\r\ndef IO():\r\n\tsys.stdin=open(\"pyinput.txt\", 'r')\r\n\tsys.stdout=open(\"pyoutput.txt\", 'w')\r\n\r\ndef GCD(a, b):\r\n\tif(b==0): return a\r\n\telse: return GCD(b, a%b)\r\n\r\ndef LCM(a, b): return a*(b//GCD(a, b))\r\n\r\ndef scan(TYPE_1, TYPE_2=0):\r\n\tif(TYPE_1==int):\r\n\t\treturn map(int, sys.stdin.readline().strip().split())\r\n\telif(TYPE_1==float):\r\n\t\treturn map(float, sys.stdin.readline().strip().split())\r\n\telif(TYPE_1==list and TYPE_2==float):\r\n\t\treturn list(map(float, sys.stdin.readline().strip().split()))\r\n\telif(TYPE_1==list and TYPE_2==int):\r\n\t\treturn list(map(int, sys.stdin.readline().strip().split()))\r\n\telif(TYPE_1==str):\r\n\t\treturn sys.stdin.readline().strip()\r\n\telse: print(\"ERROR!!!!\") \r\n\r\n\r\n\r\ndef main():\r\n\t\r\n\tn, k=scan(int)\r\n\tif(k>n*n):\r\n\t\tprint(-1)\r\n\t\treturn\r\n\r\n\ta=[[0 for i in range(n)] for j in range(n)]\r\n\tfor i in range(n):\r\n\t\tfor j in range(i, n):\r\n\t\t\tif(a[i][i]==0 and k>0):\r\n\t\t\t\ta[i][i]=1\r\n\t\t\t\tk-=1\r\n\t\t\tif(k>1 and i!=j):\r\n\t\t\t\ta[i][j]=a[j][i]=1\r\n\t\t\t\tk-=2\r\n\r\n\tfor i in a:\r\n\t\tprint(*i)\r\n\t\r\n\r\n# IO()\r\nmain()", "n,k = map(int, input().split())\r\narray = [[0]*n for _ in range(n)]\r\n#字典序中大的矩阵优先第一行有1\r\n#注意输出！！！\r\nif k == 0:\r\n for i in range(n):\r\n for j in range(n):\r\n print(array[i][j],end=\" \")\r\n print()\r\nelif k > n*n:\r\n print(-1)\r\nelse:\r\n #因为要对称，所以只需要填充一半\r\n for i in range(n):\r\n if array[i][i] == 0:#因为只筛一半，所以先看对角线上有没有1\r\n array[i][i] = 1\r\n k -= 1\r\n for j in range(i+1,n):\r\n if k >= 2:\r\n array[i][j] = 1\r\n array[j][i] = 1\r\n k -= 2 \r\n if k == 0:\r\n break\r\n for i in range(n):\r\n for j in range(n):\r\n print(array[i][j],end=\" \")\r\n print()\r\n \r\n \r\n \r\n\r\n ", "#游敬恩,2300012555\r\ndef ini(n):\r\n mat = []\r\n for i in range(n):\r\n mat.append([0]*n)\r\n return mat\r\n\r\ndef prt_mat(n,mat):\r\n for i in range(n):\r\n print(' '.join(str(mat[i][j]) for j in range(n)))\r\n\r\nn,k=list(map(int,input().split()))\r\nif k>(n**2):\r\n print(-1)\r\nelif k==0:\r\n prt_mat(n,ini(n))\r\nelse:\r\n mat = ini(n)\r\n for i in range(n):\r\n if k > 0:\r\n mat[i][i] = 1\r\n k -= 1\r\n if k > 1:\r\n for j in range(i+1,n):\r\n if k > 1:\r\n mat[i][j] = 1\r\n mat[j][i] = 1\r\n k-=2\r\n prt_mat(n,mat)", "import math\nimport re\n\n\n\nn, k = map(int, input().split())\n\n\nif k > n*n:\n print (-1)\n exit(0)\n\na = [[0] * n for i in range(n)]\n\nfor i in range(n):\n if k == 0:\n break\n a[i][i] = 1\n k -= 1\n if k == 0:\n break\n elif k == 1:\n a[i+1][i+1] = 1\n break\n else:\n for j in range(i+1, min(n, i + 1 + k//2)):\n a[i][j] = 1\n a[j][i] = 1\n k -= 2\n\n\nfor i in range(n):\n print(' '.join(map(str, a[i])))\n\n\n# n = int(input())\n# a = list(map(int, input().split()))\n# #print(' '.join(map(str, a)))\n#\n#\n#\n# b = set()\n#\n# for el in a:\n# if el-1 in b:\n# b.discard(el-1)\n# b.add(el)\n# else:\n# b.add(el)\n#\n# print(len(b))\n", "'''程文奇 2100015898'''\r\ndef f(n,k):\r\n numbermatrix = [[0] * n for _ in range(n)]\r\n if k>n**2:\r\n return -1\r\n else:\r\n for g in range(n):\r\n if k > 0:\r\n numbermatrix[g][g]=1\r\n k-=1\r\n for h in range(g+1,n):\r\n if k>=2:\r\n numbermatrix[g][h]=numbermatrix[h][g]=1\r\n k-=2\r\n return numbermatrix\r\nn,k=map(int,input().split())\r\nanswer=f(n,k)\r\nif answer==-1:\r\n print(answer)\r\nelse:\r\n for i in range(n):\r\n print(*answer[i])", "n,k = map(int,input().split())\r\nif k > n ** 2:\r\n print(-1)\r\nelif k == 0:\r\n for i in range(n):\r\n print(' '.join(['0']*n))\r\nelse:\r\n t = int((n ** 2 - k) ** 0.5)\r\n a = n - t - 1\r\n rest = k - n ** 2 + (t+1) ** 2\r\n b = (rest-1) // 2 + 1\r\n if rest % 2 == 1:\r\n for i in range(a):\r\n print(' '.join(['1']*n))\r\n print(' '.join(['1']*(a+b) + ['0']*(n-a-b)))\r\n for i in range(b-1):\r\n print(' '.join(['1']*(a+1) + ['0']*(n-a-1)))\r\n for i in range(n-a-b):\r\n print(' '.join(['1']*a + ['0']*(n-a)))\r\n elif rest >= 4:\r\n for i in range(a):\r\n print(' '.join(['1']*n))\r\n print(' '.join(['1'] * (a + b) + ['0'] * (n - a - b)))\r\n print(' '.join(['1'] * (a + 2) + ['0'] * (n - a - 2)))\r\n for i in range(b-2):\r\n print(' '.join(['1']*(a+1) + ['0']*(n-a-1)))\r\n for i in range(n-a-b):\r\n print(' '.join(['1']*a + ['0']*(n-a)))\r\n else:\r\n for i in range(a):\r\n print(' '.join(['1']*n))\r\n print(' '.join(['1'] * (a + 1) + ['0'] * (n - a - 1)))\r\n print(' '.join(['1'] * a + ['0'] + ['1'] + ['0']*(n-a-2)))\r\n for i in range(n-a-2):\r\n print(' '.join(['1']*a + ['0']*(n-a)))\r\n\r\n\r\n", "#!/usr/bin/env python3\n\nimport sys\n\n[n, k] = map(int, input().strip().split())\nif k > n * n:\n\tprint (-1)\n\tsys.exit(0)\n\na = [[0 for _ in range(n)] for __ in range(n)]\nfor i in range(n):\n\tif k >= 1:\n\t\ta[i][i] = 1\n\t\tk -= 1\n\tfor j in range(i + 1, n):\n\t\tif k >= 2:\n\t\t\ta[i][j] = a[j][i] = 1\n\t\t\tk -= 2\n\nfor row in a:\n\tprint (' '.join(map(str, row)))\n", "n,k=map(int,input().split())\r\nif k>n*n:\r\n print(-1)\r\nelse:\r\n a=[]\r\n for i in range(n):\r\n a.append([0]*n)\r\n for i in range(n):\r\n if k==0:\r\n break\r\n for j in range(i,n):\r\n if k==1 and i!=j:\r\n a[i+1][i+1]=1\r\n k-=1\r\n elif k>=1 and i==j:\r\n a[i][i]=1\r\n k-=1\r\n elif k>1 and i!=j:\r\n a[i][j],a[j][i]=1,1\r\n k-=2\r\n for i in range(n):\r\n for j in range(n):\r\n print(a[i][j],end=' ')\r\n print()", "n, k = map(int, input().split())\r\n\r\nif k > n**2:\r\n print(-1)\r\nelse:\r\n m = [[0 for i in range(n)] for j in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n if i == j and k >= 1 and m[i][j] == 0:\r\n m[i][j] = 1;\r\n k -= 1\r\n elif i != j and k >= 2 and m[i][j] == 0:\r\n m[i][j] = 1;\r\n m[j][i] = 1;\r\n k -= 2\r\n for li in m:\r\n print(*li)\r\n", "n,k=map(int,input().split())\r\nnx=n\r\nm=[[0]*n for _ in range(n)]\r\nif k>n**2:\r\n print(-1)\r\nelse:\r\n while k>0:\r\n for i in range(n-nx,n):\r\n if i==n-nx or k==1:\r\n m[n-nx][n-nx]=1\r\n k-=1\r\n else:\r\n m[n-nx][i]=1\r\n m[i][n-nx]=1\r\n k-=2\r\n if k==0 or k==1:break\r\n nx-=1\r\n for i in range(n):\r\n for j in range(n):\r\n print(m[i][j],end=' ')\r\n print()", "def main():\n n, k = map(int, input().split())\n l = [['0'] * n for _ in range(n)]\n for y, row in enumerate(l):\n if not k:\n break\n k -= 1\n row[y] = '1'\n for x in range(y + 1, n):\n if k < 2:\n break\n k -= 2\n l[x][y] = row[x] = '1'\n if k:\n print(-1)\n else:\n for row in l:\n print(' '.join(row))\n\n\nif __name__ == \"__main__\":\n main()\n", "nums=input().split()\r\nn=int(nums[0])\r\nk=int(nums[1])\r\nm=[[0]*n for _ in range(n)]\r\nif k>n*n:\r\n print(-1)\r\nelse:\r\n \r\n for i in range(n):\r\n for j in range(i,n):\r\n d=2 if i!=j else 1\r\n if k>=d:\r\n k-=d\r\n m[i][j]=1\r\n m[j][i]=1\r\n else:\r\n if k==0:\r\n pass\r\n else:\r\n m[i+1][i+1]=1\r\n for i in range(n):\r\n for j in range(n):\r\n print(m[i][j],end=' ')\r\n #print(' ')\r\n print('\\n',end='')\r\n", "n,k=map(int,input().split())\r\nif k>n**2:\r\n print(-1)\r\nelse:\r\n m=[[0]*n for i in range(n)]\r\n if k==n**2-1:\r\n m=[[1]*n for i in range(n)]\r\n m[n-1][n-1]=0\r\n else:\r\n for i in range(n):\r\n if k==0:\r\n break\r\n m[i][i]=1\r\n k-=1\r\n for j in range(i+1,n):\r\n if k==0:\r\n break\r\n if k>=2:\r\n k-=2\r\n m[i][j]=1\r\n m[j][i]=1\r\n elif k==1:\r\n k-=1\r\n m[i+1][i+1]=1\r\n for i in range(n):\r\n ans=\" \".join(map(str,m[i]))\r\n print(ans)", "n, k = map(int, input().split())\r\nm = [[\"0\"]*n for _ in range(n)] \r\nfor x in range(n):\r\n for y in range(x, n):\r\n if x == y and k >= 1:\r\n m[x][y] = \"1\"\r\n k -= 1\r\n elif k >= 2:\r\n m[x][y] = \"1\"\r\n m[y][x] = \"1\"\r\n k -= 2\r\nif k > 0:\r\n print(-1)\r\nelse:\r\n print(\"\\n\".join([\" \".join(i) for i in m]))", "n,k = map(int,input().split())\r\nmatrix = [[0 for j in range(n)] for i in range(n)]\r\nif k > n**2:\r\n print(\"-1\")\r\nelse:\r\n for i in range(n):\r\n\r\n j = i\r\n while k >= 2 and j < n:\r\n if j != i:\r\n matrix[i][j],matrix[j][i] = 1,1\r\n k -= 2\r\n j += 1\r\n\r\n else:\r\n matrix[j][j] = 1\r\n k -= 1\r\n j += 1\r\n\r\n if k == 1:\r\n if matrix[i][i] == 0:\r\n matrix[i][i] = 1\r\n break\r\n if k == 0:\r\n break\r\n for i in range(n):\r\n print(*matrix[i])", "def show():\r\n for i in range(n):\r\n print(' '.join([str(s) for s in a[i]]))\r\n\r\nn,k=[int(s) for s in input().split()]\r\na=[[0 for i in range(n)] for j in range(n)]\r\nif k>n**2:\r\n print(-1)\r\nelif k==0:\r\n show()\r\nelse:\r\n for i in range(n):\r\n if k>0:\r\n a[i][i]=1\r\n k-=1\r\n t=i\r\n while k>=2 and t<n-1:\r\n t+=1\r\n a[i][t]=1\r\n a[t][i]=1\r\n k-=2\r\n else:\r\n break\r\n show()", "n,k = map(int,input().split())\r\nn_1=n\r\nls = [[0]*n for _ in range (n)]\r\nr=0;c=0\r\nif k>n**2 :\r\n print(-1)\r\nelse :\r\n while k>0 :\r\n ls[r][c]=1;k-=1 #处理对角线上的起始处\r\n for i in range (1,n):\r\n if k==1:\r\n ls[r+1][c+1]=1;k-=1\r\n break\r\n elif k>=2 :\r\n ls[r][c+i]=ls[r+i][c]=1\r\n k-=2\r\n elif k==0 :\r\n break\r\n r+=1;c+=1;n-=1\r\n for i in range (n_1):\r\n print(' '.join(map(str,ls[i])))\r\n", "import sys\r\n\r\nn, k = map(int, input().split())\r\nmatrix = [[0]*n for _ in range(n)]\r\ni1, j1, i2, j2 = 0, 0, 0, 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if matrix[i][j]:\r\n continue\r\n if i == j and k < 1 or i != j and k < 2:\r\n break\r\n matrix[i][j] = matrix[j][i] = 1\r\n k -= 1 if i == j else 2\r\n\r\nfor i in range(n):\r\n if matrix[i][i] == 0 and k:\r\n matrix[i][i] = 1\r\n k -= 1\r\n\r\nif k:\r\n print(-1)\r\nelse:\r\n for row in matrix:\r\n print(*row)\r\n", "n, k = map(int, input().split())\nA = [n * [0] for i in range(n)]\nremain = k\nline = 0\nidx = 0\n\ntry:\n while remain != 0:\n if remain == 1:\n if A[line][line] == 1:\n A[line + 1][line + 1] = 1\n else:\n A[line][line] = 1\n break\n else:\n A[line][idx] = 1\n A[idx][line] = 1\n if idx == line:\n remain -= 1\n else:\n remain -= 2\n idx += 1\n if idx == n:\n line += 1\n idx = line\nexcept IndexError:\n print(-1)\n exit(0)\n\nfor i in A:\n print((\" \").join(str(t) for t in i))\n", "n,k=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append(['0']*n)\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if i==j:\r\n if k>0:\r\n a[i][j]='1'\r\n k-=1\r\n else:\r\n if k>1:\r\n a[i][j],a[j][i]='1','1'\r\n k-=2\r\nif k>0:\r\n print(-1)\r\nelse:\r\n print('\\n'.join([' '.join(x) for x in a]))\r\n", "import sys\ninput = sys.stdin.readline\n\nn1, k = map(int, input().split())\nans = [[0 for i in range(n1+1)] for j in range(n1+1)]\nfor i in range(1, n1+1):\n if k == 0:\n break\n for j in range(i, n1+1):\n if i == j:\n ans[i][j] = 1\n k -= 1\n else:\n if k > 1:\n ans[i][j] = 1\n ans[j][i] = 1\n k -= 2\n if k == 0:\n break\n if k == 0:\n break\n\nif k > 0:\n print(\"-1\")\nelse:\n for i in range(1, n1+1):\n for j in range(1, n1+1):\n print(ans[i][j], end=\" \")\n print() \n\n \t\t \t \t \t \t\t \t\t\t\t\t \t \t", "import sys \r\n\r\ntry:\r\n\tsys.stdin = open(\"input.txt\", \"r\")\r\nexcept FileNotFoundError:\r\n\tpass \r\n\t\r\ndef pr(out):\r\n\tfor lst in out:\r\n\t\tfor i in lst:\r\n\t\t\tprint(i, end=\" \")\r\n\t\tprint()\t\r\n\t\r\ndef solve():\r\n\tn, k = [int(i) for i in input().split()]\r\n\tout = [[0 for i in range(n)] for i in range(n)]\r\n\tif k > n*n:\r\n\t\tprint(-1)\r\n\t\treturn \r\n\t\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tif out[i][j] == 1:\r\n\t\t\t\tassert out[j][i] == 1\r\n\t\t\t\tcontinue\r\n\t\t\tif k == 1:\r\n\t\t\t\tif i != j:\r\n\t\t\t\t\tcontinue\r\n\t\t\t\telse:\r\n\t\t\t\t\tout[i][j] = 1\r\n\t\t\t\t\tk -= 1\r\n\t\t\telif k >= 2:\r\n\t\t\t\tout[i][j] = 1\r\n\t\t\t\tout[j][i] = 1\r\n\t\t\t\tif i == j:\r\n\t\t\t\t\tk -= 1\r\n\t\t\t\telse:\r\n\t\t\t\t\tk -= 2\r\n\t\r\n\tpr(out)\r\n\r\nx = 1\r\n#x = int(input())\r\nfor i in range(x):\r\n\tsolve()", "n, k = map(int, input().split())\r\nif n * n < k:\r\n\tprint(-1)\r\n\texit()\r\n\r\na = []\r\nfor i in range(n):\r\n\ta += [[0] * n]\r\n\r\nrow = 0\r\ncol = 0\r\nwhile k >= 2:\r\n\ta[row][col] = 1\r\n\tk -= 1\r\n\tif row != col:\r\n\t\ta[col][row] = 1\r\n\t\tk -= 1\r\n\r\n\tcol += 1\r\n\tif col >= n:\r\n\t\trow += 1\r\n\t\tcol = row\r\n\r\nif k==1:\r\n\tif col != row:\r\n\t\trow += 1\r\n\t\tcol = row\r\n\ta[row][row] = 1\r\n\r\nfor row in a:\r\n\tprint(*row)\r\n", "def main():\r\n n, k = map(int, input().split())\r\n\r\n if k > n**2:\r\n print(-1)\r\n return\r\n\r\n A = [[0] * n for _ in range(n)]\r\n\r\n i = 0\r\n j = 0\r\n while k > 1:\r\n A[i][j] = 1\r\n k -= 1\r\n j += 1\r\n while k > 1 and j < n:\r\n A[i][j] = 1\r\n A[j][i] = 1\r\n j += 1\r\n k -= 2\r\n i += 1\r\n j = i\r\n if k == 1:\r\n A[i][j] = 1\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n print(A[i][j], end=' ')\r\n print()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "#王铭健，工学院 2300011118\r\nn, k = map(int, input().split())\r\nif k > n ** 2:\r\n print(\"-1\")\r\n exit()\r\nif k == 0:\r\n for p in range(n):\r\n for q in range(n):\r\n print(\"0\", end = \" \")\r\n print()\r\n exit()\r\nsum = 0\r\nfor i in range(n-1, -1, -1):\r\n if sum < k <= sum + 2 * i + 1:\r\n row_num = n - 1 - i\r\n rest = k - sum\r\n break\r\n else:\r\n sum += 2 * i + 1\r\nmatrix = [[1 for i in range(n)] for j in range(row_num)]\r\nfor m in range(n - row_num):\r\n matrix.append([1 for i in range(row_num)] + [0 for j in range(n-row_num)])\r\nmatrix[row_num][row_num] = 1\r\nif rest % 2 == 0:\r\n matrix[row_num+1][row_num+1] = 1\r\n for t in range(1, (rest-2)//2+1):\r\n matrix[row_num][row_num+t] = matrix[row_num+t][row_num] = 1\r\nelse:\r\n for t in range(1, (rest-1)//2+1):\r\n matrix[row_num][row_num+t] = matrix[row_num+t][row_num] = 1\r\nfor a in range(n):\r\n for b in range(n):\r\n print(matrix[a][b], end = \" \")\r\n print()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nans = [[0 for i in range(n+1)] for j in range(n+1)]\r\nfor i in range(1, n+1):\r\n if k == 0:\r\n break\r\n for j in range(i, n+1):\r\n if i == j:\r\n ans[i][j] = 1\r\n k -= 1\r\n else:\r\n if k > 1:\r\n ans[i][j] = 1\r\n ans[j][i] = 1\r\n k -= 2\r\n if k == 0:\r\n break\r\n if k == 0:\r\n break\r\n\r\nif k > 0:\r\n print(\"-1\")\r\nelse:\r\n for i in range(1, n+1):\r\n for j in range(1, n+1):\r\n print(ans[i][j], end=\" \")\r\n print() \r\n", "# Compiled by zhou_tian from pku\r\n\r\ndef eat_lemon(size, num):\r\n answer = [[0 for _ in range(size)]for _ in range(size)]\r\n po_x = 0\r\n po_y = 0\r\n\r\n while num > 1:\r\n answer[po_x][po_y] = 1\r\n answer[po_y][po_x] = 1\r\n if po_x == po_y:\r\n num -= 1\r\n else:\r\n num -= 2\r\n if po_x == size - 1:\r\n po_y += 1\r\n po_x = po_y\r\n else:\r\n po_x += 1\r\n\r\n if num == 1:\r\n if po_x == po_y:\r\n answer[po_x][po_y] = 1\r\n else:\r\n answer[po_y+1][po_y+1] = 1\r\n\r\n return answer\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\nif k > n**2:\r\n print(-1)\r\nelse:\r\n matrix = eat_lemon(n, k)\r\n for row in matrix:\r\n for i in row:\r\n print(i, end=' ')\r\n print()\r\n", "# 2300012142 林烨\r\nn, k = map(int,input().split())\r\nm = [[0]*n for _ in range(n)]\r\nif k > n**2:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n if k:\r\n for j in range(i,n):\r\n if k:\r\n if i == j:\r\n m[i][j] = 1\r\n k -= 1\r\n else:\r\n if k == 1:\r\n m[i+1][i+1] = 1\r\n k = 0\r\n else:\r\n m[i][j] = 1\r\n k -= 2\r\n for i in range(1,n):\r\n for j in range(i):\r\n m[i][j] = m[j][i]\r\n for l in m:\r\n print(' '.join(list(map(str,l))))", "n,k=map(int,input().split())\r\nmatrix=[[0 for i in range(n)] for j in range(n)]\r\nif k>n**2:\r\n print(-1)\r\nelse:\r\n a=0\r\n while k!=0:\r\n k-=1\r\n matrix[a][a]=1\r\n j=a+1\r\n while j<n and k>1:\r\n matrix[a][j]=matrix[j][a]=1\r\n k-=2\r\n j+=1\r\n a+=1\r\n for i in matrix:\r\n print(' '.join(map(str,i)))", "def solve(a,b):\r\n if b>a*a:\r\n return -1\r\n v=[]\r\n for i in range(a):\r\n v2=[]\r\n for j in range(a):\r\n v2.append(0)\r\n v.append(v2)\r\n for i in range(a):\r\n if b>0:\r\n v[i][i]=1\r\n b-=1\r\n for j in range(i+1,a):\r\n if b>=2:\r\n b-=2\r\n v[i][j]=1\r\n v[j][i]=1\r\n ans=\"\"\r\n for i in range(a):\r\n for j in range(a):\r\n ans+=str(v[i][j]) + \" \"\r\n ans+=\"\\n\"\r\n return ans\r\n\r\na,b=map(int,input().split())\r\nprint(solve(a,b))\r\n", "n, k = map(int, input().split())\r\nif n**2<k:\r\n print(-1)\r\nelse:\r\n M = [[0]*n for _ in range(n)]\r\n for i in range(n):\r\n for j in range(i,n):\r\n if k <= 0:\r\n break\r\n if i==j:\r\n if M[i][j]==1:\r\n continue\r\n elif M[i][j]!=1:\r\n if k%2==1:\r\n M[i][j]=1\r\n k -= 1\r\n elif k%2==0:\r\n M[i][j]=1\r\n M[i+1][j+1]=1\r\n k -= 2\r\n elif i!=j:\r\n M[i][j]=1\r\n M[j][i]=1\r\n k -= 2\r\n for i in range(n):\r\n print(*M[i])\r\n", "n,k=map(int,input().strip().split(' '))\r\nmat=[]\r\nfor i in range(n):\r\n mat.append([0]*n)\r\n\r\nfor i in range(n):\r\n \r\n for j in range(i,n):\r\n \r\n if k>1 and i!=j:\r\n k-=2\r\n mat[i][j],mat[j][i]=1,1\r\n elif k>0 and i==j:\r\n k-=1\r\n mat[i][j]=1 \r\n \r\nif k==0:\r\n for i in range(n):\r\n for j in range(n-1):\r\n print(mat[i][j],end=' ')\r\n print(mat[i][n-1])\r\nelse:\r\n print(-1)", "n,nums=map(int,input().split())\r\nmatrix_1=[]\r\nfor i in range(n,-1,-1):\r\n temp=[0]*i\r\n matrix_1.append(temp)\r\nmatrix_1.pop()\r\n# print(matrix_1)\r\nrow=0\r\nleft=nums\r\ncolumn=0\r\nif nums>n*n:\r\n print(-1)\r\nelse:\r\n if nums!=1:\r\n while left>0:\r\n if left!=1:\r\n if column<=len(matrix_1[row+1]):\r\n matrix_1[row][column]=1\r\n if column==0:\r\n left-=1\r\n else:\r\n left-=2\r\n column+=1\r\n else:\r\n row+=1\r\n column=0\r\n matrix_1[row][column] = 1\r\n if column == 0:\r\n left -= 1\r\n else:\r\n left -= 2\r\n column += 1\r\n else:\r\n row+=1\r\n column=0\r\n matrix_1[row][column]=1\r\n break\r\n else:\r\n matrix_1[0][0]=1\r\n\r\n matrix_2=[]\r\n for row in matrix_1:\r\n minus=n-len(row)\r\n row=[0]*minus+row\r\n matrix_2.append(row)\r\n for i in range(n):\r\n for j in range(n):\r\n if matrix_2[i][j]==1 or matrix_2[j][i]==1:\r\n matrix_2[i][j],matrix_2[j][i]=1,1\r\n matrix_3 = []\r\n for i in matrix_2:\r\n temp = [str(j) for j in i]\r\n matrix_3.append(temp)\r\n for i in matrix_3:\r\n print(\" \".join(i))\r\n", "n, k = [int(x) for x in input().split()]\r\n\r\nif k > n*n:\r\n print('-1')\r\nelse:\r\n\r\n\r\n res = [[0 for _ in range(n)] for _ in range(n)]\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n if i > j:\r\n res[i][j] = res[j][i]\r\n elif i == j:\r\n if k > 0:\r\n res[i][j] = 1\r\n k -= 1\r\n else:\r\n if k > 1:\r\n res[i][j] = 1\r\n k -= 2\r\n for i in range(n):\r\n print(' '.join(str(res[i][j]) for j in range(n)))\r\n", "import math\r\nn,k = map(int,input().split())\r\nif k > n**2:\r\n print(-1)\r\nelse:\r\n m = math.ceil(math.sqrt(n**2-k))\r\n gap = m**2 + k - n**2\r\n matrix = []\r\n for i in range(n):\r\n if i <= n-m-1:\r\n matrix.append(['1']*n)\r\n else:\r\n matrix.append(['1']*(n-m) + ['0']*m)\r\n if gap != 0:\r\n matrix[n-m][n-m] = '1'\r\n gap -= 1\r\n if gap % 2 == 1:\r\n matrix[n-m+1][n-m+1] = '1'\r\n gap -= 1\r\n gap = gap//2\r\n for x in range(n-m+1,n-m+1+gap):\r\n matrix[n-m][x] = '1'\r\n matrix[x][n-m] = '1'\r\n for lst in matrix:\r\n print(' '.join(lst))", "#!/usr/bin/env python3\nfrom sys import stdin,stdout\n\ndef ri():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\nn, k = ri()\n\nif k > n*n:\n print(-1)\n exit()\n\nm = [[0 for _ in range(n)] for __ in range(n)]\n\nfor i in range(n):\n if k == 1:\n m[i][i] = 1\n k-=1\n break\n if k == 0:\n break\n m[i][i] = 1\n k -= 1\n for j in range(i+1, n):\n if k == 1:\n m[i+1][i+1] = 1\n k -= 1\n break\n if k == 0:\n break\n m[i][j] = 1\n m[j][i] = 1\n k -= 2\n\nfor i in range(n):\n print(*m[i])\n", "n, k = map(int, input().split())\r\nvis = [[0 for _ in range(1000)] for _ in range(1000)]\r\n\r\nflag = True\r\n\r\nif k > n * n:\r\n flag = False\r\nelse:\r\n for i in range(n):\r\n for j in range(n):\r\n if vis[i][j] != 0:\r\n continue\r\n elif i == j and k != 0:\r\n vis[i][j] = 1\r\n k -= 1\r\n elif k >= 2:\r\n vis[i][j] = vis[j][i] = 1\r\n k -= 2\r\n\r\n if k:\r\n flag = False\r\n\r\nif flag:\r\n for i in range(n):\r\n for j in range(n):\r\n if j == 0:\r\n print(vis[i][j], end=\"\")\r\n else:\r\n print(\" \" + str(vis[i][j]), end=\"\")\r\n print()\r\nelse:\r\n print(\"-1\")", "#2300015804\r\nn, k = map(int, input().split())\r\nans = [[\"0\"] * n for _ in range(n)]\r\nfor i in range(n):\r\n if k <= 0: break\r\n if k >= 2 * (n-i) - 1 :\r\n for j in range(i, n): ans[i][j] = ans [j][i] = \"1\"\r\n elif k % 2 == 1:\r\n for j in range(i, i+(k//2)+1): ans[i][j] = ans [j][i] = \"1\"\r\n else:\r\n for j in range(i, i+(k//2)): ans[i][j] = ans [j][i] = \"1\"\r\n ans[i+1][i+1] = \"1\"\r\n k -= 2 * (n - i) - 1\r\n\r\nif k <= 0:\r\n for l in range(n):\r\n print(\" \".join(ans[l]))\r\nelse: print(-1)", "n, k = map(int, input().split())\r\nif k > n**2:\r\n print(-1)\r\n exit()\r\nmatrix = [['0']*n for i in range(n)]\r\ni, j = 0, 0\r\nwhile k > 0:\r\n if i == j:\r\n matrix[i][j] = '1'\r\n k -= 1\r\n j += 1\r\n elif k >= 2:\r\n matrix[i][j] = matrix[j][i] = '1'\r\n k -= 2\r\n j += 1\r\n else:\r\n if i == n - 1:\r\n print(-1)\r\n exit()\r\n matrix[i + 1][i + 1] = '1'\r\n k -= 1\r\n if j == n:\r\n i += 1\r\n j = i\r\nfor i in range(n):\r\n print(' '.join(matrix[i]))", "n,k=map(int,input().split())\r\n\r\nimport sys\r\nif k>n*n:\r\n print(-1)\r\n sys.exit(0)\r\na=[[0]*n for _ in range(n)]\r\ni=0;j=1\r\nwhile k>0:\r\n if k==0:\r\n break\r\n a[i][i]=1;k-=1\r\n while k>=2:\r\n a[i][j]=a[j][i]=1\r\n k-=2\r\n j+=1\r\n if j==n:\r\n break\r\n if k==1 and i+1<=n-1:\r\n a[i+1][i+1]=1\r\n if k==1 and i+1==n:\r\n print(-1)\r\n sys.exit(0)\r\n i+=1\r\n j=i+1\r\n \r\nfor i in range(n):\r\n for j in range(n-1):\r\n print(a[i][j],end=' ')\r\n print(a[i][n-1])", "#-*- coding: utf-8 -*\n'''\nCreated on Wed Oct 25\nauthor 钱瑞 2300011480\n'''\nl=list(map(int,str(input()).split(' ')))\nn=l[0]\nk=l[1]\ndef an(n,k):\n if k>n*n:\n return [[-1]]\n k_0=int(k)\n table=[[0]*n for i in range(n)]\n i=0\n j=0\n while k_0>1:\n if i==j:\n table[i][j]=1\n k_0-=1\n else:\n table[i][j]=1\n table[j][i]=1\n k_0-=2\n j+=1\n if j==n:\n i+=1\n j=i\n if k_0==1:\n for i in range(n):\n if table[i][i]==0:\n table[i][i]=1\n break\n return table\ntable=an(n,k)\nfor i in range(len(table)):\n print(' '.join(list(map(str,table[i]))))", "r = lambda: int(input())\r\nra = lambda: [*map(int, input().split())]\r\np = lambda a: print('{:.6f}'.format(a))\r\nn, k = ra()\r\na = [[0 for j in range(n)] for i in range(n)]\r\nif k>n**2: print(-1)\r\nelse:\r\n while k>0:\r\n for i in range(n):\r\n if k>0:\r\n a[i][i] = 1\r\n k-=1\r\n for j in range(i+1, n):\r\n if k<=1: break\r\n else:\r\n a[i][j] = 1\r\n a[j][i] = 1\r\n k-=2\r\n for i in a: print(*i)\r\n", "n, k = [int(i) for i in input().split()]\nif k > n**2:\n print(-1)\n exit()\na = [[0 for z in range(n)] for i in range(n)]\nfor i in range(n):\n if k == 0:\n break\n a[i][i] = 1\n k-=1\n for j in range(i + 1, n):\n if k == 1 or k == 0:\n break\n a[i][j] = a[j][i] = 1\n k -= 2\n\nprint(\"\\n\".join(\" \".join([str(j) for j in i])for i in a))", "#23n2200017708\nn, k = map(int, input().split())\nmatrix = [[0 for i in range(n)] for j in range(n)]\ni = 0\n\ndef f(mat, a, b):\n mat[a][a] = 1\n b -= 1\n for j in range(1, b//2+1):\n mat[a][a+j] = mat[a+j][a] = 1\n if b%2 == 1:\n mat[a+1][a+1] = 1\n return(mat)\n\nif k <= n**2: \n while k > 0:\n matrix = f(matrix, i, min(k, 2*n-2*i-1))\n k -= 2*n-2*i-1\n i += 1\n\n for i in range(n):\n print(*matrix[i])\nelse:\n print(-1)\n\n ", "n,k=map(int,input().split())\r\nmat=[[0]*n for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if i==j:\r\n if k>0:\r\n mat[i][j]=1\r\n k-=1\r\n else:\r\n if k>1:\r\n mat[i][j]=1\r\n mat[j][i]=1\r\n k-=2\r\nif k >0:\r\n print(-1)\r\n exit()\r\nfor r in mat:print(*r)\r\n \r\n ", "n,k=map(int,input().split())\r\nmatrix=[[0]*n for _ in range(n)]\r\nif k>n**2:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n for j in range(n):\r\n if k>0 and matrix[i][j]==0:\r\n if i==j:\r\n matrix[i][j]=1\r\n k-=1 \r\n elif k>=2:\r\n matrix[i][j]=1\r\n matrix[j][i]=1\r\n k-=2\r\n for i in range(n):\r\n for j in range(n):\r\n print(matrix[i][j],end=' ')\r\n print()\r\n ", "import sys\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n\r\n if k > n**2:\r\n print(-1)\r\n else:\r\n mat = [[0]*n for i in range(n)]\r\n\r\n for i in range(n):\r\n for j in range(i, n):\r\n if k <= 0:\r\n break\r\n if i == j:\r\n mat[i][i] = 1\r\n k -= 1\r\n else:\r\n if k > 1:\r\n mat[i][j] = mat[j][i] = 1\r\n k -= 2\r\n\r\n for mat_r in mat:\r\n print(*mat_r)\r\n\r\nif __name__ == '__main__':\r\n solve()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 26 15:49:57 2023\r\n\r\n@author: 苏柔德 2300011012\r\n\"\"\"\r\nn,k=map(int, input().split())\r\nmatrix=[[0]*n for _ in range(n)]\r\nif k <=n**2:\r\n for i in range(n):\r\n if k==0:\r\n break\r\n for j in range(i,n):\r\n if k==0:\r\n break\r\n elif i==j:\r\n matrix[i][j]=1 #对角线上放1\r\n k-=1 \r\n elif k>=2 and i!=j:\r\n matrix[i][j]=1\r\n matrix[j][i]=1 #剩余数量不少于2时，对称放1\r\n k-=2\r\n elif k==1:\r\n matrix[i+1][i+1]=1 #剩余数量为1时，对角线上放1\r\n k-=1\r\n for row in matrix:\r\n print(\" \".join(map(str, row)))\r\nelse:\r\n print(-1)", "a, b = map(int, input().split())\r\nmatrix = [[0] * (a) for _ in range(a)]\r\nif b > a ** 2:\r\n print(-1)\r\nelse:\r\n for i in range(a):\r\n for j in range(a):\r\n if matrix[i][j] + matrix[j][i] == 2:\r\n continue\r\n if b == 1 and j != i:\r\n continue\r\n elif j == i:\r\n b -= 1\r\n else:\r\n b -= 2\r\n if b< 0:\r\n break\r\n matrix[i][j] = 1\r\n matrix[j][i] = 1\r\n if b < 0:\r\n break\r\n\r\n for i in range(a):\r\n for j in range(a):\r\n print(matrix[i][j], end=\"\")\r\n if j != a - 1:\r\n print(\" \", end=\"\")\r\n print()\r\n" ]

{"inputs": ["2 1", "3 2", "2 5", "1 0", "1 1", "20 398", "20 401", "100 3574", "100 10000", "100 10001", "2 3", "4 5", "5 6", "5 24", "2 0", "3 5", "3 3", "5 10", "3 4", "4 3", "1 1000000", "3 6", "1 2", "1 0", "1 1", "1 2", "1 3", "1 4", "1 5", "1 6", "1 7", "1 8", "1 9", "1 10", "1 11", "1 12", "1 13", "1 14", "1 15", "1 16", "1 17", "1 18", "1 19", "1 20", "1 21", "1 22", "1 23", "1 24", "1 25", "1 26", "2 0", "2 1", "2 2", "2 3", "2 4", "2 5", "2 6", "2 7", "2 8", "2 9", "2 10", "2 11", "2 12", "2 13", "2 14", "2 15", "2 16", "2 17", "2 18", "2 19", "2 20", "2 21", "2 22", "2 23", "2 24", "2 25", "2 26", "3 0", "3 1", "3 2", "3 3", "3 4", "3 5", "3 6", "3 7", "3 8", "3 9", "3 10", "3 11", "3 12", "3 13", "3 14", "3 15", "3 16", "3 17", "3 18", "3 19", "3 20", "3 21", "3 22", "3 23", "3 24", "3 25", "3 26", "4 0", "4 1", "4 2", "4 3", "4 4", "4 5", "4 6", "4 7", "4 8", "4 9", "4 10", "4 11", "4 12", "4 13", "4 14", "4 15", "4 16", "4 17", "4 18", "4 19", "4 20", "4 21", "4 22", "4 23", "4 24", "4 25", "4 26", "5 0", "5 1", "5 2", "5 3", "5 4", "5 5", "5 6", "5 7", "5 8", "5 9", "5 10", "5 11", "5 12", "5 13", "5 14", "5 15", "5 16", "5 17", "5 18", "5 19", "5 20", "5 21", "5 22", "5 23", "5 24", "5 25", "5 26", "100 0", "100 1", "100 2", "100 3", "100 99", "100 100", "100 101", "100 9999", "100 10000", "100 10001"], "outputs": ["1 0 \n0 0 ", "1 0 0 \n0 1 0 \n0 0 0 ", "-1", "0 ", "1 ", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1...", "-1", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...", "-1", "1 1 \n1 0 ", "1 1 1 0 \n1 0 0 0 \n1 0 0 0 \n0 0 0 0 ", "1 1 1 0 0 \n1 1 0 0 0 \n1 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 0 ", "0 0 \n0 0 ", "1 1 1 \n1 0 0 \n1 0 0 ", "1 1 0 \n1 0 0 \n0 0 0 ", "1 1 1 1 1 \n1 1 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 ", "1 1 0 \n1 1 0 \n0 0 0 ", "1 1 0 0 \n1 0 0 0 \n0 0 0 0 \n0 0 0 0 ", "-1", "1 1 1 \n1 1 0 \n1 0 0 ", "-1", "0 ", "1 ", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "0 0 \n0 0 ", "1 0 \n0 0 ", "1 0 \n0 1 ", "1 1 \n1 0 ", "1 1 \n1 1 ", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "0 0 0 \n0 0 0 \n0 0 0 ", "1 0 0 \n0 0 0 \n0 0 0 ", "1 0 0 \n0 1 0 \n0 0 0 ", "1 1 0 \n1 0 0 \n0 0 0 ", "1 1 0 \n1 1 0 \n0 0 0 ", "1 1 1 \n1 0 0 \n1 0 0 ", "1 1 1 \n1 1 0 \n1 0 0 ", "1 1 1 \n1 1 0 \n1 0 1 ", "1 1 1 \n1 1 1 \n1 1 0 ", "1 1 1 \n1 1 1 \n1 1 1 ", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "0 0 0 0 \n0 0 0 0 \n0 0 0 0 \n0 0 0 0 ", "1 0 0 0 \n0 0 0 0 \n0 0 0 0 \n0 0 0 0 ", "1 0 0 0 \n0 1 0 0 \n0 0 0 0 \n0 0 0 0 ", "1 1 0 0 \n1 0 0 0 \n0 0 0 0 \n0 0 0 0 ", "1 1 0 0 \n1 1 0 0 \n0 0 0 0 \n0 0 0 0 ", "1 1 1 0 \n1 0 0 0 \n1 0 0 0 \n0 0 0 0 ", "1 1 1 0 \n1 1 0 0 \n1 0 0 0 \n0 0 0 0 ", "1 1 1 1 \n1 0 0 0 \n1 0 0 0 \n1 0 0 0 ", "1 1 1 1 \n1 1 0 0 \n1 0 0 0 \n1 0 0 0 ", "1 1 1 1 \n1 1 0 0 \n1 0 1 0 \n1 0 0 0 ", "1 1 1 1 \n1 1 1 0 \n1 1 0 0 \n1 0 0 0 ", "1 1 1 1 \n1 1 1 0 \n1 1 1 0 \n1 0 0 0 ", "1 1 1 1 \n1 1 1 1 \n1 1 0 0 \n1 1 0 0 ", "1 1 1 1 \n1 1 1 1 \n1 1 1 0 \n1 1 0 0 ", "1 1 1 1 \n1 1 1 1 \n1 1 1 0 \n1 1 0 1 ", "1 1 1 1 \n1 1 1 1 \n1 1 1 1 \n1 1 1 0 ", "1 1 1 1 \n1 1 1 1 \n1 1 1 1 \n1 1 1 1 ", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 0 0 0 0 \n0 1 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 1 0 0 0 \n1 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 1 0 0 0 \n1 1 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 1 1 0 0 \n1 0 0 0 0 \n1 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 1 1 0 0 \n1 1 0 0 0 \n1 0 0 0 0 \n0 0 0 0 0 \n0 0 0 0 0 ", "1 1 1 1 0 \n1 0 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 \n0 0 0 0 0 ", "1 1 1 1 0 \n1 1 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 \n0 0 0 0 0 ", "1 1 1 1 1 \n1 0 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 ", "1 1 1 1 1 \n1 1 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 ", "1 1 1 1 1 \n1 1 0 0 0 \n1 0 1 0 0 \n1 0 0 0 0 \n1 0 0 0 0 ", "1 1 1 1 1 \n1 1 1 0 0 \n1 1 0 0 0 \n1 0 0 0 0 \n1 0 0 0 0 ", "1 1 1 1 1 \n1 1 1 0 0 \n1 1 1 0 0 \n1 0 0 0 0 \n1 0 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 0 \n1 1 0 0 0 \n1 1 0 0 0 \n1 0 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 0 \n1 1 1 0 0 \n1 1 0 0 0 \n1 0 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 0 0 0 \n1 1 0 0 0 \n1 1 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 0 0 \n1 1 0 0 0 \n1 1 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 0 0 \n1 1 0 1 0 \n1 1 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 0 \n1 1 1 0 0 \n1 1 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 0 \n1 1 1 1 0 \n1 1 0 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 0 0 \n1 1 1 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 0 \n1 1 1 0 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 0 \n1 1 1 0 1 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 0 ", "1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 \n1 1 1 1 1 ", "-1", "0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...", "-1"]}

UNKNOWN

PYTHON3

CODEFORCES

99

8e4411543e2b85f1a8bb736483bfdbcb

Beautiful Divisors

Recently Luba learned about a special kind of numbers that she calls beautiful numbers. The number is called beautiful iff its binary representation consists of *k*<=+<=1 consecutive ones, and then *k* consecutive zeroes. Some examples of beautiful numbers: - 12 (110); - 1102 (610); - 11110002 (12010); - 1111100002 (49610). More formally, the number is beautiful iff there exists some positive integer *k* such that the number is equal to (2*k*<=-<=1)<=*<=(2*k*<=-<=1). Luba has got an integer number *n*, and she wants to find its greatest beautiful divisor. Help her to find it! The only line of input contains one number *n* (1<=≤<=*n*<=≤<=105) — the number Luba has got. Output one number — the greatest beautiful divisor of Luba's number. It is obvious that the answer always exists. Sample Input 3 992 Sample Output 1 496

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef divisor(i):\r\n s = []\r\n for j in range(1, int(i ** (1 / 2)) + 1):\r\n if i % j == 0:\r\n s.append(i // j)\r\n s.append(j)\r\n return sorted(set(s))\r\n\r\npow2 = [1]\r\nfor _ in range(20):\r\n pow2.append(2 * pow2[-1])\r\ns = set()\r\nfor k in range(20):\r\n s.add((pow2[k + 1] - 1) * pow2[k])\r\n\r\nn = int(input())\r\nd = divisor(n)\r\nans = 1\r\nfor i in d:\r\n if i in s:\r\n ans = max(ans, i)\r\nprint(ans)", "import sys, bisect\r\n\r\nn = int(sys.stdin.readline())\r\nans = 0\r\nfor i in range(10):\r\n temp = '1' * (i + 1) + '0' * i\r\n if n % (int(temp, base=2)) == 0:\r\n ans = int(temp, base=2)\r\nprint(ans)", "n = int(input())\r\nl = [1,6,28,120,496,2016,8128,32640]\r\na=[]\r\nfor i in l:\r\n if n%i ==0 :\r\n a.append(i)\r\n\r\n\r\nprint(a[-1])\r\n\r\n \r\n \r\n", "import sys \r\ninput = sys.stdin.readline \r\nn = int(input())\r\na = set()\r\nfor i in range(1, int(n ** 0.5) + 1):\r\n if(n % i == 0):\r\n a.add(i)\r\n a.add(n // i)\r\nb = [1]\r\np = 2\r\nwhile(b[-1] <= n):\r\n b.append(4 * b[-1] + p)\r\n p *= 2 \r\nb = set(b)\r\nl = list(a & b)\r\nl.sort()\r\nprint(l[-1])", "n = int(input(''))\r\nfor k in range( 9 , 0 , -1 ):\r\n divisor = ((2**k)-1)*(2**(k-1))\r\n if n % divisor == 0 :\r\n print(divisor)\r\n break\r\n", "def fast(n):\r\n perfect = [32640, 8128, 2016, 496, 120, 28, 6, 1]\r\n for j in perfect:\r\n if n % j == 0:\r\n return j\r\n\r\nn = int(input())\r\nprint(fast(n))", "from collections import deque as dq\r\nn = int(input())\r\n\r\ns = dq(['1'])\r\na = []\r\nfor _ in range(8):\r\n b = ''\r\n for i in s:\r\n b += i\r\n s.append('0')\r\n s.appendleft('1')\r\n a.append(int(b,2))\r\nans = 0\r\nfor i in a:\r\n if n%i==0:\r\n ans = i\r\nprint(ans)\r\n", "import math\r\nn=int(input())\r\ns=math.log(n)/math.log(2)\r\ns=math.ceil(s)\r\nif n==1:\r\n print(1)\r\nelse:\r\n for i in range(math.ceil(s/2),0,-1):\r\n k=((2**i)-1)*(2**(i-1))\r\n if n%k==0:\r\n print(k)\r\n break\r\n ", "n=int(input())\r\nm=1\r\nk=1\r\nwhile True:\r\n b=(2**k-1)*(2**(k-1))\r\n if b > n: break\r\n if n%b==0:\r\n m=b\r\n k+=1\r\nprint(m)", "n = int(input())\r\nf=0\r\nfor k in range(20, 0, -1):\r\n x = (2**k - 1) * (2**(k - 1))\r\n if n % x == 0 and f==0:\r\n print(x)\r\n f=1", "l=[]\ns='1'\nfor i in range(10):\n\tl.append(int(s,2))\n\ts+='0'\n\ts='1'+s\nn=int(input())\nfor i in range(9,-1,-1):\n\tif n%l[i]==0:\n\t\tprint(l[i])\n\t\tbreak", "L=[32640,8128,2016,496,120,28,6,1]\r\nn=int(input())\r\nfor i in L:\r\n if (n%i==0):\r\n print(i)\r\n break", "l=[1, 6, 28, 120, 496, 2016, 8128, 32640]\r\nl.reverse()\r\nn=int(input())\r\nfor i in l:\r\n if n%i==0:\r\n print(i)\r\n break", "def solve(m):\r\n k = 1\r\n while m % 2 == 0:\r\n m //= 2\r\n k += 1\r\n while m % ((1 << k) - 1) != 0:\r\n k -= 1\r\n return ((1 << k) - 1) * (1 << (k - 1))\r\n\r\n\r\nn = int(input())\r\nprint(solve(n))", "import os,sys,io,math\r\nfrom array import *\r\nfrom math import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom functools import *\r\nfrom itertools import *\r\nfrom collections import *\r\nI=lambda:[*map(int,sys.stdin.readline().split())]\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\nn,r,res=IN(),0,0\r\nfor i in range(1,11):\r\n s=((1<<i)-1)*(1<<(i-1))\r\n if not n%s:res=s\r\nprint(res)", "orig = int(input())\r\nn = orig\r\nwhile n>0:\r\n\r\n if orig%n==0: \r\n bn = bin(n)[2:]\r\n if bn.split(\"0\")[0] == len(bn.split(\"0\")[0]) * bn.split(\"0\")[0][0]: \r\n if (len(bn.split(\"0\")[1:])+1==len(bn.split(\"0\")[0]) and \"\".join(bn.split(\"0\")[1:])==\"\"): \r\n print(n)\r\n break\r\n n -= 1", "l=[0]*10**5\r\nfor i in range(1,100):\r\n l[i]=(2**i-1)*2**(i-1)\r\n \r\n\r\nn=int(input())\r\nans=0\r\nfor i in range(1,100):\r\n if n%l[i]==0:\r\n ans=l[i]\r\nprint(ans) ", "n = int(input())\ndelit = [(2 ** x - 1) * (2 ** (x - 1)) for x in range(1,9)]\n\nfor i in delit[::-1]:\n if n % i == 0:\n print(i)\n break\n", "import math\r\nn = int(input())\r\nans = 1\r\nfor i in range(1, 100):\r\n k = int(pow(2, i * 2 + 1)) - int(pow(2, i))\r\n if n % k == 0:\r\n ans = k\r\n elif k > n:\r\n break\r\nprint(ans)", "def verif(n):\r\n x=bin(n)[2:] #bin()(O(log n)) avec n est le nombre qu'on veut convertir (1<=n<=100000)\r\n #une affectation(O(1)) et slicing de complexité O(n) avec n est le longueure de la nouvelle chaine qui est negligeable donc O(1)\r\n #d'ou cette ligne est de complexité O(1)\r\n i=0 #cette ligne de code contient une affectation donc de complexité O(1)\r\n while i<len(x) and x[i]=='1':\r\n #les conditons de while sont composées de:\r\n #operations unitaires: < et == (O(1))\r\n #len() de complexité O(1)\r\n #operateur logique: and de complexité O(1)\r\n #acces a un element du tableau (x[i]) O(1)\r\n #donc les conditions sont de complexité O(1)\r\n i=i+1 #cette ligne contient une affectation O(1) et une addition O(1) donc la ligne de code de complexité O(1)\r\n #la boucle while est de complexité O(n) avec n = longueure de x\r\n j=-1 #cette ligne de code contient une affectation donc de complexité O(1)\r\n while abs(j)<=len(x) and x[j]=='0':\r\n #les conditons de while sont composées de:\r\n #operations unitaires: <= et == (O(1))\r\n #len() de complexité O(1)\r\n #operateur logique: and de complexité O(1)\r\n #acces a un element du tableau (x[i]) O(1)\r\n #donc les conditions sont de complexité O(1)\r\n j=j-1 #cette ligne contient une affectation O(1) et une soustraction O(1) donc la ligne de code de complexité O(1)\r\n #la boucle while est de complexité O(n) avec n = longueure de x\r\n j=abs(j)-1 #cette ligne contient une affectation O(1) et une soustraction O(1) et abs() (O(1)) donc la ligne de code de complexité O(1)\r\n if i==j+1 and i+j==len(x):\r\n #les conditons de if sont composées de:\r\n #operations unitaires: + et == (O(1))\r\n #len() de complexité O(1)\r\n #operateur logique: and de complexité O(1)\r\n #donc les conditions sont de complexité O(1)\r\n return True\r\n else:\r\n return False\r\n #if est de complexité O(1)\r\n#cette fonction est de complexité O(log(n)+1+n+1+n+1+1)=O(n)\r\nn=int(input())\r\n#input() est de complexité O(n) avec n la langueure de la chine de charactères\r\n#(1<=n<=100000) donc (1<=longueure de n<=6)\r\n# donc O(n)=O(6)=O(1)\r\ndiviseurs=[] #O(1)\r\nfor i in range(1,n//2+1): #on a des operations unitaires: // et + donc O(1)\r\n if n%i==0: #cette condition contient % de complexité O(1) et une comparaison entre 2 entier (donc de complexité O(1)) la condition est donc de complexité O(1)\r\n diviseurs.append(i) #O(1)\r\n #cette if est de complexité O(1)\r\n#cette boucle for est de complexité O(n) car ona (n//2)+1 iteration et O((n//2)+1)=O(n)\r\ndiviseurs.append(n) #O(1)\r\ni=-1 #cette ligne de code contient une affectation donc de complexité O(1)\r\nwhile abs(i)<=len(diviseurs): #abs() est de complexité (O(1)), <= est une operation unitaire de complexité O(1), len() est de complexité O(1) donc la complexité de cette ligne est O(1)\r\n if verif(diviseurs[i]): #verif est de complexité O(n)\r\n print(diviseurs[i]) #O(1)\r\n break #break n'a pas de complexité\r\n #if est de complexité O(n)\r\n i=i-1 #cette ligne contient une affectation O(1) et une soustraction O(1) donc la ligne de code de complexité O(1)\r\n#while est de complexité O(m*n) avec m est la longueure du tableau diviseurs et m est negligeable donc O(n)\r\n\r\n#donc le programme est de complexité O(n)\r\n", "import math\r\n\r\ndef proB(n):\r\n lst=[]\r\n for i in range(1,n+1):\r\n if(n%i==0):\r\n lst.append(i)\r\n k=int(math.log2(1e5))\r\n for j in lst:\r\n for i in range(k,0,-1):\r\n if(j== (2**(i-1))*(2**i - 1 ) ):\r\n maxi=j\r\n return maxi\r\nn=int(input())\r\nprint(proB(n))\r\n", "n=int(input())\r\nans=1\r\nstart='110'\r\nwhile(True):\r\n a=int(start,2)\r\n if a>n:\r\n break\r\n if n%a==0:\r\n ans=a\r\n start='1'+start+'0'\r\nprint(ans)", "n = int(input())\r\nl = [1]\r\nc=1\r\nk=1\r\nwhile(c<=n):\r\n if c>=n:\r\n break\r\n\r\n c = c * 4\r\n k = k * 2\r\n c = c + k\r\n l.append(c)\r\n\r\n\r\no=0\r\nfor i in range(len(l)):\r\n if n%l[i]==0:\r\n o = l[i]\r\nprint(o)", "def STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\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\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\r\ndef f(n):\r\n d = ''\r\n while n >0 :\r\n x = n % 2\r\n d+=str(x)\r\n n //= 2\r\n return d[::-1]\r\n\r\n\r\ndef d(n):\r\n d =deque()\r\n i = 1\r\n while i * i <= n :\r\n if n%i==0:\r\n if n//i==i:\r\n d.append(i)\r\n else:\r\n d+=[i , n //i]\r\n i+=1\r\n return d\r\n\r\ndef check(s):\r\n r1 = s.find('1')\r\n r2 = s.rfind('1')\r\n cnt0 = 0\r\n cnt1 = 0\r\n s2 = list(s)\r\n for i in range(r1 , r2+1):\r\n if s2[i] == '1':cnt1 +=1\r\n else:cnt0 +=1\r\n cnt02 = s.count('0')\r\n if cnt0 == 0 and cnt02 + 1 == cnt1:\r\n return True\r\n return False\r\n\r\nn = INT()\r\nr1 = d(n)\r\nz = []\r\n\r\nfor i in r1:\r\n x = f(i)\r\n y = check(x)\r\n if y :\r\n z.append(i)\r\n\r\nz = list(reversed(sorted(z)))\r\n#print(z)\r\nprint(z[0])", "def check(n):\r\n b = bin(n)[2:]\r\n k = int(len(b) / 2) + 1\r\n return b[:k].count('1') == k and b[k:n].count('0') == k - 1\r\nn = int(input())\r\noutput = 1\r\nfor j in range(1, n + 1):\r\n if n % j == 0 and check(j) == True:\r\n output = j\r\nprint(output)\r\n", "import math\r\ndef beauty(n):\r\n x=list(map(int,list(str(bin(n))[2:])))\r\n l=len(x)\r\n if l%2==0:\r\n return False\r\n if set(x[:l//2+1])=={1} and set(x[l//2+1:])=={0}:\r\n return True\r\n return False\r\nn=int(input())\r\nfor i in range(n,0,-1):\r\n if n%i==0 and beauty(i):\r\n print(i)\r\n exit()\r\nprint(1)", "import math\r\n\r\nn=int(input())\r\ni=9\r\nwhile i!=0:\r\n div=(pow(2,i)-1)*(pow(2,i-1))\r\n if n%div==0:\r\n print(div)\r\n break\r\n i=i-1\r\n", "n=int(input())\r\na=0\r\nb=[]\r\nwhile(True):\r\n c=( ((2**a)-1) *(2**(a-1)) )\r\n if (c > n):\r\n break\r\n b.append(c)\r\n a=a+1\r\n \r\n\r\n \r\nfor i in range(n,0,-1):\r\n if (i in b) and ((n % i)== 0):\r\n print(i)\r\n break", "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=nmbr()\r\n ones=num=ans=1\r\n while n>=num:\r\n ones+=1\r\n num=((1<<ones)-1)<<(ones-1)\r\n if n%num==0:ans=num\r\n print(ans)\r\n", "num = int(input())\r\nb = [6, 28, 120, 496, 2016, 8128, 32640]\r\ndivisor = 1\r\n\r\nfor x in b:\r\n if(num % x == 0):\r\n divisor = x\r\n\r\nprint(divisor)\r\n \r\n", "n = int(input())\n\ndef check(x):\n t = bin(x)[2::]\n first = 0\n second = 0\n\n\n for i in t:\n if i == '1' and second == 0:\n first += 1\n elif i == '0':\n second += 1\n\n\n return first - second == 1 and (second + first) == len(t)\n \n\n\nfrom math import sqrt\n\nmx = -1\n\nfor i in range(1, int(sqrt(n)) + 1):\n if n % i == 0:\n if check(i):\n mx = max(mx, i)\n\n if check(n // i):\n mx = max(mx, n // i)\n\nprint(mx)\n", "def beautiful_num () :\r\n start = 0\r\n while True :\r\n start += 1\r\n yield ((2**start)-1)*(2**(start-1))\r\n \r\n \r\nnum = int(input())\r\ncurrent_greatest = 0\r\n\r\nfor x in beautiful_num() :\r\n if x > num :\r\n break\r\n elif num%x == 0 :\r\n current_greatest = x\r\n \r\nprint (current_greatest)\r\n \r\n \r\n \r\n ", "def func():\r\n n = int(input())\r\n n1 = n\r\n k = 1\r\n ans = 0\r\n while True:\r\n if n % 2 == 0:\r\n n /= 2\r\n k += 1\r\n else:\r\n break\r\n while True:\r\n m = (2 ** k - 1) * 2**(k - 1)\r\n if n1 % m == 0:\r\n print(m)\r\n break\r\n else:\r\n k -= 1\r\nfunc()", "n = int(input())\nd = [\n 0b11111111100000000,\n 0b111111110000000,\n 0b1111111000000,\n 0b11111100000,\n 0b111110000,\n 0b1111000,\n 0b11100,\n 0b110,\n 0b1\n]\nres = next(i for i in d if i * (n // i) == n)\nprint(res)\n", "import sys\r\nimport os\r\nfrom collections import Counter\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n sys.stderr = open(\"error.txt\",\"w\")\r\n\r\ninput = lambda: sys.stdin.readline()\r\ndef getdivisors(x):\r\n res = []\r\n for i in range(1,int(x ** .5) + 1):\r\n if x % i == 0:\r\n res .append(i)\r\n if i < x**.5:\r\n res.append(x // i)\r\n res .sort(reverse=True)\r\n return res\r\n\r\ndef getmax(lst):\r\n for i in lst:\r\n s = bin(i)[2:]\r\n ln = len(s)\r\n if ln % 2 == 1:\r\n if set(s[:ln//2 +1]) == {\"1\"} :\r\n if ln > 1 and set(s[ln//2+1:]) == {\"0\"}:\r\n return i\r\n if ln == 1:\r\n return 1\r\n \r\nx = int(input())\r\nprint(getmax(getdivisors(x)))", "s=[(2**(i)-1)*2**(i-1) for i in range(9,0,-1)]\r\na=int(input())\r\nfor i in s:\r\n if a%i==0:\r\n print(i)\r\n break", "#893B (61No. Problem B)\r\n\r\nn = int(input())\r\nb = []\r\nfor i in range(1,n+1):\r\n if n%i == 0:\r\n t = bin(i).replace(\"0b\",\"\")\r\n if (len(t)%2 != 0):\r\n b.append(t)\r\n# print(b) \r\nfor i in range(len(b)-1,-1,-1):\r\n t = len(b[i])\r\n m = (t//2) + 1\r\n if '0' not in b[i][:m] and '1' not in b[i][m:]:\r\n # print(b[i])\r\n # print(b[i][:m],b[i][m:])\r\n if b[i][:m].count('1') - b[i][m:].count('0') == 1:\r\n print(int(b[i],2))\r\n break", "n = int(input())\r\n\r\nbn = 1\r\nans = 0\r\n\r\nwhile bn <= n:\r\n if n%bn == 0:\r\n ans = bn\r\n\r\n binbn = '1' + bin(bn)[2:] + '0'\r\n bn = int(binbn, 2)\r\n\r\nprint(ans)", "n=int(input())\r\nm=1\r\nfor i in range(2,11):\r\n a=(pow(2,i)-1)*pow(2,i-1)\r\n if n%a==0:\r\n m=max(a,m)\r\n if a>n:\r\n break\r\nprint(m)", "x = \"111111110000000\"\r\n\r\nn = int(input())\r\nres = 0\r\n\r\nwhile True:\r\n if n % int(x, 2) == 0:\r\n print(int(x, 2))\r\n break\r\n x = x[1:-1]\r\n", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n = int(input())\n\n for k in range(10, 0, -1):\n s = (2 ** k - 1) * (2 ** (k - 1))\n if n % s == 0:\n print(s)\n return\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n\t \t\t \t \t\t \t\t\t\t\t\t \t \t\t \t \t", "n=int(input())\r\na1=1\r\na2=6\r\na3=28\r\na4=120\r\na5=496\r\na6=2016\r\na7=8128\r\na8=32640\r\nif n%a8==0:\r\n\tprint(a8)\r\nelif n%a7==0:\r\n\tprint(a7)\r\nelif n%a6==0:\r\n\tprint(a6)\r\nelif n%a5==0:\r\n\tprint(a5)\r\nelif n%a4==0:\r\n\tprint(a4)\r\nelif n%a3==0:\r\n\tprint(a3)\r\nelif n%a2==0:\r\n\tprint(a2)\r\nelif n%a1==0:\r\n\tprint(a1)", "x = int(input())\r\n\r\nl = list()\r\nlcopy1 = list()\r\nlcopy2 = list()\r\n\r\nfor i in range(1, x+1, 1):\r\n if (x % i == 0):\r\n l.append(i)\r\n\r\nfor i in range(len(l)):\r\n l[i] = bin(l[i])\r\n l[i] = l[i][2:]\r\n\r\nfor i in range(len(l)):\r\n numberofones = len(l[i])//2 + 1\r\n numberofzeroes = len(l[i])//2\r\n if (len(l[i]) % 2 == 1):\r\n lcopy1.append(l[i])\r\n\r\nfor i in range(len(lcopy1)):\r\n numberofones = len(lcopy1[i])//2 + 1\r\n numberofzeroes = len(lcopy1[i])//2\r\n ones = \"\"\r\n zeroes = \"\"\r\n for j in range(numberofones):\r\n ones = ones+ \"1\"\r\n for j in range(numberofzeroes):\r\n zeroes = zeroes + \"0\"\r\n if(ones == (lcopy1[i][0:numberofones]) and zeroes == (lcopy1[i][numberofones:len(lcopy1[i])])):\r\n lcopy2.append(lcopy1[i])\r\n\r\ngbf = int(lcopy2[len(lcopy2)-1], 2)\r\nprint(gbf)\r\n", "for _ in range(int(input()) if not True else 1):\r\n n = int(input())\r\n a = []\r\n k = 0\r\n while (2**k - 1) * 2**(k-1) <= 10**5:\r\n a += [(2 ** k - 1) * 2 ** (k - 1)]\r\n k += 1\r\n for j in range(n, 0, -1):\r\n if n%j != 0:continue\r\n if j in a:\r\n print(j)\r\n break\r\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 10/06/2023 22:43:52 Hanoi, Vietnam\r\n# **/\r\n\r\n# s = \"1\"\r\n# a = []\r\n# for i in range(10):\r\n# a.append(int(s, 2))\r\n# s = '1' + s + '0'\r\n\r\n# print(a)\r\n\r\na = [1, 6, 28, 120, 496, 2016, 8128, 32640]\r\nn = int(input())\r\nfor i in range(n, 0, -1):\r\n if n % i == 0 and i in a:\r\n exit(print(i))", "\r\n\r\nl=[]\r\nfor i in range(1,11):\r\n l.append((pow(2,i)-1)*pow(2,i-1))\r\nn=int(input())\r\nans=1\r\nfor i in l:\r\n if n%i==0:\r\n ans=i\r\nprint(ans)\r\n\r\n \r\n\r\n", "\r\nn = int(input())\r\ns = []\r\nk = 1\r\nwhile (2**k - 1)*(2**(k - 1)) <= n:\r\n s.append((2**k - 1)*(2**(k - 1)))\r\n k += 1\r\nfor c in reversed(s):\r\n if n % c == 0:\r\n print(c)\r\n break\r\n", "beauty_nums = [32640, 8128, 2016, 496, 120, 28, 6, 1]\r\n\r\nn = int(input())\r\n\r\nfor d in beauty_nums:\r\n if n % d == 0:\r\n print(d)\r\n break", "a=[int('1'*(i+1)+'0'*i,2) for i in range(8)][::-1]\r\nn=int(input())\r\nfor i in a:\r\n if n%i==0:\r\n print(i)\r\n exit()", "n = int(input())\r\nlast = 1\r\nb = 1\r\nx = 1 # 2^(k-1)\r\nwhile b <= n:\r\n if n%b==0:\r\n last = b\r\n x *= 2\r\n b = (2*x - 1) * x\r\nprint(last)\r\n \r\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn = int(input())\r\nfor k in range(9):\r\n\td = (2*2**k-1) << k\r\n\tif n % d == 0:\r\n\t\tans = d\r\nprint(ans)", "import sys\r\ninput=sys.stdin.buffer.readline\r\nn=int(input())\r\nx=0\r\nfor i in range(1,17):\r\n if ((2**i-1)*(2**(i-1)))<=n and (n%((2**i-1)*(2**(i-1)))==0):\r\n x=((2**i-1)*(2**(i-1)))\r\nprint(x)", "n = int(input())\r\nm = 0\r\nb = \"1\"\r\nk = int(b, 2)\r\nwhile k <= n:\r\n if n % k == 0 and k > m:\r\n m = k\r\n b = \"1\" + b + \"0\"\r\n k = int(b, 2)\r\nprint(m)\r\n", "a=[1,6,28,120,496,2016,8128,32640]\r\nn=int(input())\r\ni=7\r\nwhile n%a[i]!=0:i-=1\r\nprint(a[i])", "\r\nindex=1\r\nn=int(input())\r\ndiv=1\r\nfor i in range(8):\r\n\tg='1'*index+'0'*(index-1)\r\n\tw=int(g,2)\r\n\tif n%w==0:\r\n\t\tdiv=w\r\n\t\r\n\tindex+=1\r\nprint(div)\r\n\r\n", "n=int(input())\r\n\r\ni=0\r\na=0\r\nb=[]\r\nwhile(a<n//2+1):\r\n a=(2**i-1)*(2**(i-1))\r\n b.append(a)\r\n i+=1\r\n \r\nfor i in range(len(b)-1,-1,-1):\r\n if(n%b[i]==0):\r\n print(b[i])\r\n break", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nn = int(input())\r\n\r\nbeauty = []\r\nfor i in range(1, 1000):\r\n b = int(\"1\"*i + \"0\"*(i-1), 2)\r\n beauty.append(b)\r\n if b > 10**5:\r\n break\r\n\r\nbeauty = beauty[::-1]\r\n\r\nfor div in beauty:\r\n if n%div == 0:\r\n print(div)\r\n break\r\n\r\n\r\n", "n=int(input())\r\nc=1\r\nfor i in range(1,9):\r\n k=((2**(i)-1)*(2**(i-1)))\r\n if n%k==0:\r\n c=k\r\nprint(c)\r\n", "a=[1,6,28,120,496,2016,8128,32640]\r\nn=int(input())\r\nt=7\r\nwhile n%a[t]:t-=1\r\nprint(a[t])\r\n\r\n", "n=int(input())\r\nb=1\r\nk=0\r\nl=[]\r\nwhile( b<=n):\r\n k+=1\r\n b=((2**k)-1)*(2**(k-1))\r\n l.append(b)\r\nl.pop()\r\nfor j in l:\r\n if n%j==0 :\r\n outp=j\r\nprint(outp)\r\n", "n = int(input())\r\ndivisors = []\r\n\r\npowers = [2**i for i in range(18)]\r\nfor i in range(n, 0, -1):\r\n if n % i == 0:\r\n divisors.append(n // i)\r\n\r\nfor divisor in reversed(divisors):\r\n for j in range(1, len(powers)):\r\n if (powers[j] - 1) * powers[j - 1] == divisor:\r\n print(divisor)\r\n exit()\r\n\r\n# To print all divisors: \r\n# print(*divisors)\r\n", "beautiful_number = int(input())\r\n\r\nk = 8\r\nnumber = (2**k - 1) * (2 **(k-1))\r\nwhile beautiful_number % number != 0:\r\n k-=1\r\n number = (2**k - 1) * (2 **(k-1))\r\nprint(number)", "beaut = [(2**k-1)*(2**(k-1)) for k in range(1, 9)]\nbeaut.reverse()\n\nn = int(input())\n\nfor num in beaut: \n if n % num == 0: \n print(num)\n exit()\n", "n = int(input())\n\nif n != 1:\n k = 1\n i = 1\n l = []\n while k < n:\n k = (2**i-1)*2**(i-1)\n if k == n:\n l.append(k)\n\n elif n % k == 0:\n l.append(k)\n\n i +=1\n \n print(max(l))\nelse:\n print(1)\n \t \t \t\t \t \t\t \t \t\t \t\t", "n=int(input())\r\na=[130816,32640,8128,2016,1008,496,120,28,6,1]\r\nfor i in a:\r\n if n%i==0:\r\n print(i)\r\n break\r\n", "memo = []\r\ni = 0\r\nwhile True:\r\n tmp = int('1' * (i + 1) + '0' * i, 2)\r\n if tmp > 10**5:\r\n break\r\n memo.append(tmp)\r\n i += 1\r\n\r\nn = int(input())\r\nfor i in memo[::-1]:\r\n if i <= n and n % i == 0:\r\n print(i)\r\n break\r\n ", "from collections import Counter\r\n\r\n\r\ndef get_bin(x):\r\n return format(x, 'b')\r\n\r\n\r\ndef get_dec(x):\r\n return int(x, 2)\r\n\r\n\r\nn = int(input())\r\nnum_bin = str(get_bin(n))\r\ncount = Counter(num_bin)\r\nones = count['1']\r\nzeros = count['0']\r\nif ones == zeros + 1:\r\n pass\r\nelse:\r\n zeros = '0' * (ones - 1)\r\n zeros = len(zeros)\r\n\r\nwhile ones >= 0 and zeros >= 0:\r\n num = '1' * (ones)\r\n num += '0' * (zeros)\r\n num_dec = get_dec(num)\r\n if n % num_dec == 0:\r\n print(num_dec)\r\n exit()\r\n else:\r\n ones -= 1\r\n zeros -= 1\r\n", "n=int(input())\r\nfor i in range(8,0,-1):\r\n x=((2**i)-1)*(2**(i-1))\r\n if(n%x==0):\r\n print(x)\r\n break", "a = 32640, 8128, 2016, 496, 120, 28, 6, 1\r\nb = int(input())\r\nprint(a[[b % i for i in a].index(0)])\r\n\r\n", "a = [1,\r\n 6,\r\n 28,\r\n 120,\r\n 496,\r\n 2016,\r\n 8128,\r\n 32640]\r\nn = int(input())\r\nfor i in range(7, 0, -1):\r\n if (n % a[i] == 0):\r\n print(a[i])\r\n exit(0)\r\nprint(1)\r\n", "\r\nn = int(input())\r\nbeautiful = []\r\n \r\nk = 1\r\nwhile True:\r\n num = (2 ** k - 1) * (2 ** (k - 1))\r\n if num > 10 ** 5:\r\n break\r\n beautiful.append(num)\r\n k += 1\r\n \r\nfor x in beautiful[::-1]:\r\n if n % x == 0:\r\n print(x)\r\n break", "n=int(input())\r\ns=list(((2**k)-1)*(2**(k-1)) for k in range(1,9))\r\nbn=[]\r\ns.sort()\r\nfor i in range(8):\r\n if (n%s[i]==0):\r\n bn.append(s[i])\r\nmaxdiv=max(bn)\r\nprint(maxdiv)", "import math\r\ndef divs(n) :\r\n list1 = []\r\n for i in range(1, int(math.sqrt(n) + 1)) :\r\n if (n % i == 0) :\r\n if (n // i == i):\r\n list1.append(i)\r\n\r\n else :\r\n list1.append(i)\r\n list1.append(int(n / i))\r\n return list1\r\ndivs = (divs(int(input())))\r\ndivs.sort()\r\nbeauty = []\r\nfor i in range(1,12):\r\n string = '1'*i+'0'*(i-1)\r\n beauty.append(int(string,2))\r\nfor i in divs[::-1]:\r\n if i in beauty:\r\n print(i)\r\n break", "import math\r\n\r\ndef main_function():\r\n n = int(input())\r\n t = n\r\n l = n\r\n k = 0\r\n while (t % 2 == 0):\r\n k += 1\r\n t = t // 2\r\n\r\n\r\n\r\n\r\n while l % ((2 ** k)* (2**(k + 1) - 1)) != 0:\r\n k -= 1\r\n print((2 ** k) * (2**(k + 1) - 1))\r\n\r\n\r\n\r\n\r\nmain_function()", "from math import*\r\nn = int(input())\r\nk = 1\r\nfor i in range(1, ceil(log(n)/log(2)) + 1):\r\n x = pow(2, i) - 1\r\n y = pow(2, i - 1)\r\n if n % (x * y) == 0:\r\n k = x * y\r\n \r\nprint(int(k))\r\n\r\n ", "n = int(input())\r\nstep = 2\r\nbn = 1\r\nans = 1\r\nwhile n >= bn:\r\n if n % bn == 0:\r\n ans = bn\r\n bn *= 4\r\n bn += step\r\n step *= 2\r\nprint(ans)\r\n", "n,c=int(input()),1\r\nfor i in range(1,9):\r\n\tz=(2**(i)-1)*(2**(i-1))\r\n\tif n%(z)==0:c=z\r\nprint(c)", "v=[]\r\nl=[]\r\ns=int(input())\r\nfor i in range(1,int(s**(1/2))+1):\r\n if s%i==0 :\r\n v+=[i]\r\n if s%(s//i)==0:\r\n v+=[(s//i)]\r\nv.sort()\r\nv.reverse()\r\nfor j in range(1,33):\r\n l+=[((2**j)-1)*(2**(j-1))]\r\nfor k in v:\r\n if k in l:\r\n print(k)\r\n break", "n = int(input())\r\nk = 1\r\na = 1\r\nwhile (2 ** k - 1) * (2 ** (k - 1)) <= n:\r\n if n % ((2 ** k - 1) * (2 ** (k - 1))) == 0: a = k\r\n k += 1\r\nprint((2 ** a - 1) * (2 ** (a - 1)))\r\n", "\r\nn = int(input())\r\nbeautifulNumbers = []\r\nnum = 1\r\nones = 1\r\nzeroes = 0\r\nwhile(num<=100000):\r\n beautifulNumbers.append(num)\r\n ones+=1\r\n zeroes+=1\r\n str = \"1\"*ones+\"0\"*zeroes\r\n num = int(str,2)\r\nfor i in range(len(beautifulNumbers)-1,-1,-1):\r\n if(n%beautifulNumbers[i]==0):\r\n print(beautifulNumbers[i])\r\n break", "n = int(input())\r\n\r\nk = 0\r\nans = 1\r\ncur = 1\r\n\r\nwhile cur <= n:\r\n\tif n % cur == 0:\r\n\t\tans = cur\r\n\tcur <<= 1\r\n\tk += 2\r\n\tcur += (2**k)\r\nprint(ans)", "n = int(input())\r\narr = []\r\ns = ''\r\nj,k = 1,0\r\nfor i in range(15):\r\n s = '1'*(j) + '0'*(k)\r\n arr.append(int(s,2))\r\n k+=1\r\n j+=1\r\nans = 0\r\nfor i in range(15):\r\n if n%arr[i]==0:\r\n ans = max(ans,arr[i])\r\n \r\nprint(ans)\r\n", "n = int(input())\r\n\r\ni = 0\r\nwhile 1:\r\n base = ('1'*(i+1)) + ('0'*i)\r\n x = int(base , 2)\r\n if x > n: break\r\n if n%x==0:\r\n ans = x\r\n\r\n i+=1 \r\n\r\nprint(ans)" ]

{"inputs": ["3", "992", "81142", "76920", "2016", "1", "6", "32640", "12096", "55948", "47262", "22876", "96120", "42160", "38304", "89408", "97920", "55493", "38021", "21445", "100000", "497", "240", "21204", "65536", "364", "1024", "36", "28", "14400", "10080", "9", "2", "42", "83160", "65534", "1026", "1025", "1027", "2018", "2020", "123", "150", "5", "66", "12768", "156", "99990", "248"], "outputs": ["1", "496", "1", "120", "2016", "1", "6", "32640", "2016", "1", "6", "28", "120", "496", "2016", "8128", "32640", "1", "1", "1", "1", "1", "120", "6", "1", "28", "1", "6", "28", "120", "2016", "1", "1", "6", "120", "1", "6", "1", "1", "1", "1", "1", "6", "1", "6", "28", "6", "6", "1"]}

UNKNOWN

PYTHON3

CODEFORCES

83

8e47b70b8fb09fa94b3f2521cab6ba43

Longest Regular Bracket Sequence

This is yet another problem dealing with regular bracket sequences. We should remind you that a bracket sequence is called regular, if by inserting «+» and «1» into it we can get a correct mathematical expression. For example, sequences «(())()», «()» and «(()(()))» are regular, while «)(», «(()» and «(()))(» are not. You are given a string of «(» and «)» characters. You are to find its longest substring that is a regular bracket sequence. You are to find the number of such substrings as well. The first line of the input file contains a non-empty string, consisting of «(» and «)» characters. Its length does not exceed 106. Print the length of the longest substring that is a regular bracket sequence, and the number of such substrings. If there are no such substrings, write the only line containing "0 1". Sample Input )((())))(()()) ))( Sample Output 6 2 0 1

[ "import sys\r\ninput=lambda:sys.stdin.readline().strip()\r\n\r\ns=input()\r\nstack=[]\r\nm = 0\r\nans = 1\r\nxx = -1\r\nfor i in range(len(s)):\r\n\tif s[i] == '(':stack.append(i)\r\n\telse:\r\n\t\tif len(stack) > 0:\r\n\t\t\tstack.pop()\r\n\t\t\toptimal = i - stack[-1] if len(stack) > 0 else i - xx\r\n\t\t\tif optimal >= m:\r\n\t\t\t\tif optimal > m: m, ans = optimal, 1\r\n\t\t\t\telse: ans += 1\r\n\t\telse:\r\n\t\t\txx = i\r\nprint(m, ans)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sat Sep 1 15:49:49 2018\n\n@author: all_blue\n\"\"\"\n\nsequence = [char for char in input().strip()]\nstack = []\n\nmax_seq = 0\nnum_max_seq = 1\nopen_braces_idx = -1\n\nfor idx in range(len(sequence)):\n if sequence[idx] == \"(\":\n stack.append(idx)\n elif stack:\n stack.pop()\n curr_seq = idx - stack[-1] if stack else idx - open_braces_idx\n if curr_seq > max_seq:\n max_seq = curr_seq\n num_max_seq = 1\n elif curr_seq == max_seq:\n num_max_seq += 1\n else:\n open_braces_idx = idx\n\nprint(max_seq, num_max_seq)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[2]:\n\n\nfrom collections import deque\ns=input()\nstack=deque()\nl=len(s)\n\nstack.append(-1)\ncount=res=0\nfor i in range(l):\n if s[i]=='(':\n stack.append(i)\n \n else:\n stack.pop()\n if stack:\n if i-stack[-1]>res:\n count=1\n \n elif i-stack[-1]==res:\n count+=1\n \n res=max(res,i-stack[-1])\n \n else:\n stack.append(i)\n \nif res:\n print(res,count)\n \nelse:\n print(0,1)\n\n\n# In[ ]:\n\n\n\n\n", "from collections import deque\n\ns = input()\nstack = deque()\nls = [0]*1000000\nans = -1\n\nfor i in range(len(s)):\n if s[i] == ')':\n if stack:\n r = stack.pop()\n ls[i] = ls[r-1] + (i-r+1)\n else:\n stack.append(i)\n # print(ls, stack)\n\nf_ans = max(ls)\ncount = ls.count(f_ans)\n\nif f_ans <= 0:\n print(0, 1)\nelse:\n print(f_ans, count)\n", "#!/usr/bin/env python\n\n\ndef main():\n longest = 0\n count = 1\n unbalanced = list()\n push = unbalanced.append\n pop = unbalanced.pop\n head = -1\n for cursor, paren in enumerate(input()):\n if paren == \"(\":\n push(cursor)\n elif unbalanced:\n pop()\n span = cursor - (unbalanced[-1] if unbalanced else head)\n if span == longest:\n count += 1\n elif span > longest:\n longest = span\n count = 1\n else:\n head = cursor\n print(longest, count)\n\n\nif __name__ == '__main__':\n main()\n", "# -*-coding:utf-8 -*-\r\nline=input()\r\ns=[-1]\r\nmax_len=0\r\nmax_num=1\r\nl=len(line)\r\nfor i in range(l):\r\n if line[i]=='(':\r\n s.append(i)\r\n elif len(s)>1:\r\n s.pop()\r\n n=i-s[-1]\r\n if max_len<n:\r\n max_len,max_num=n,1\r\n elif max_len==n:\r\n max_num+=1\r\n else:\r\n s[0]=i\r\nprint(str(max_len)+' '+str(max_num))\r\n", "s = input()\nn = len(s)\nst = []\nen = [0]*n\nfor i in range(n):\n if s[i] == '(':\n st.append(i)\n elif st:\n en[st.pop()] = i\n\nans = 0\nmx = 0\ncnt = 1\npen = 0\ni = 0\nwhile i < n:\n if en[i]:\n ta = en[i]-i+1\n if i == pen+1:\n ans += ta\n else:\n ans = ta\n if ans > mx:\n mx = ans\n cnt = 1\n elif ans == mx:\n cnt += 1\n pen = en[i]\n i = en[i]+1\n else:\n i += 1\nprint(mx,cnt)\n", "s = input()\r\ncnt = ans = 0\r\nn = len(s)\r\nst = [-1]\r\nfor i in range(n):\r\n if s[i]=='(': st.append(i)\r\n else:\r\n if st[-1]==-1 or s[st[-1]]==')': st.append(i)\r\n else:\r\n st.pop()\r\n if i-st[-1]>ans:\r\n ans = i-st[-1]\r\n cnt = 1\r\n elif i-st[-1]==ans: cnt += 1\r\nif ans==0: cnt = 1\r\nprint(ans,cnt)", "import sys\nfrom collections import deque\n\n# Reading input faster in Python\ninput = sys.stdin.readline\n\n# Function for reading integer inputs\ndef si():\n return int(input())\n\n# Function for reading two integers\ndef sii():\n return map(int, input().split())\n\n# Function for reading three integers\ndef siii():\n return map(int, input().split())\n\n\n# Main function\ndef main():\n s = input().strip()\n n = len(s)\n\n d = [-1] * n\n st = deque()\n\n maxi, cnt = 0, 1\n\n for i in range(n):\n if not st or s[i] == '(':\n st.append(i)\n continue\n\n pos = st.pop()\n\n if s[pos] == '(':\n if d[pos-1] != -1:\n d[i] = d[pos-1]\n else:\n d[i] = pos\n\n length = i - d[i] + 1\n if length == maxi:\n cnt += 1\n elif length > maxi:\n maxi = length\n cnt = 1\n\n print(maxi, cnt)\n\nif __name__ == \"__main__\":\n main()\n\n\n \t \t\t \t \t\t \t\t \t\t\t\t \t\t \t", "s = input()\n\nstack = []\nmax_length = 0\ncurrent_length = 0\ncount = 1\n\nstart = 0\n\nfor i in range(len(s)):\n if s[i] == '(':\n stack.append(i)\n else:\n if stack:\n stack.pop()\n if stack:\n current_length = i - stack[-1]\n else:\n current_length = i - start + 1\n\n if current_length > max_length:\n max_length = current_length\n count = 1\n elif current_length == max_length:\n count += 1\n else:\n start = i + 1\n\nprint(max_length, count)\n\n \t \t\t \t\t \t \t\t \t\t \t\t\t\t", "s = input()\r\narr = [-1]\r\nlongest_len = 0\r\ncount = 1\r\nfor j, k in enumerate(s):\r\n if k == '(':\r\n arr.append(j)\r\n elif len(arr) > 1:\r\n arr.pop()\r\n mini = j - arr[-1]\r\n if longest_len < mini:\r\n longest_len, count = mini, 1\r\n elif longest_len == mini:\r\n count += 1\r\n else:\r\n arr[0] = j\r\n\r\nprint(longest_len, count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n", "a,b = 0,1\r\nl = [-1]\r\nfor i,c in enumerate(input()):\r\n if c == '(':\r\n l.append(i)\r\n elif len(l) > 1:\r\n l.pop()\r\n minl = i - l[-1]\r\n if a < minl:\r\n a,b = minl,1\r\n elif a == minl:\r\n b += 1\r\n else:\r\n l[0] = i\r\nprint(a, b)", "s=input()\r\nw,c,b,l=0,1,-1,[]\r\nfor i in range(len(s)):\r\n if s[i]=='(':l.append(i)\r\n elif l:\r\n l.pop()\r\n t=i-l[-1] if l else i-b\r\n if t>w: w,c=t,1\r\n elif t==w: c+=1\r\n else:b=i\r\nprint(w,c)", "def checker(string):\r\n n = len(string)\r\n # Create a stack and push -1 as initial index into it. It is base case\r\n stack = [-1]\r\n\r\n # Initialize results\r\n max_value = 0\r\n max_count = 1\r\n # Traverse all characters of given string\r\n for i in range(n):\r\n\r\n # If opening bracket, push index of it into stack\r\n if string[i] == '(':\r\n stack.append(i)\r\n\r\n # if there is closing bracket and stack isn't empty, then pop the stack value (opening bracket)\r\n # find length and calculate results\r\n elif len(stack) > 1:\r\n # to count length correctly we have to pop our last value. Otherwise, we won't include our opening bracket in length\r\n # also, we need to match brackets, so pop with stack is a good way to \"eliminate\" balanced pair of brackets\r\n stack.pop()\r\n # current index (closing brackets) - last index in stack (opening brackets)\r\n length = i - stack[-1]\r\n # if our current length and max length are equal, then add to max length count.\r\n if length == max_value:\r\n max_count += 1\r\n # if our length is higher, then reset max length count and replace max value\r\n elif length >= max_value:\r\n max_value = length\r\n max_count = 1\r\n # if there is nothing in our stack, then make start value current index to continue our max length check\r\n else:\r\n stack[0] = i\r\n\r\n return max_value, max_count\r\n\r\n\r\ns = input()\r\nmax_value, max_count = checker(s)\r\nprint(max_value, max_count)\r\n\r\n", "from collections import defaultdict\r\n\r\ns = input()\r\n\r\nstack = [ ]\r\ndct = defaultdict(int)\r\n\r\nn = len(s)\r\nd = [-1 for i in range(n)]\r\nc = [-1 for i in range(n)]\r\n\r\ni = 0\r\nwhile(i<n):\r\n if(s[i]=='('):\r\n stack.append(i)\r\n elif(stack==[]):\r\n None\r\n else:\r\n d[i] = stack.pop()\r\n \r\n if(c[d[i]-1]!=-1):\r\n c[i] = c[d[i]-1]\r\n else:\r\n c[i] = d[i]\r\n i+=1\r\n\r\n# print(d)\r\n# print(c)\r\n_max = 0\r\ncount = 1\r\n\r\nfor i in range(n):\r\n if(c[i]!=-1):\r\n temp =(i-c[i]+1)\r\n if(temp>_max):\r\n _max = temp\r\n count =1\r\n elif(temp==_max):\r\n count+=1\r\n\r\nprint(_max,count)\r\n", "#!/usr/bin/env python\n\n\ndef main():\n longest = 0\n count = 1\n left = list()\n lead = 0\n push = left.append\n pop = left.pop\n for paren in input():\n if paren == \"(\":\n push(0)\n elif not left:\n lead = 0\n else:\n span = pop() + 2\n if left:\n span += pop()\n push(span)\n else:\n span += lead\n lead = span\n if span == longest:\n count += 1\n elif span > longest:\n longest = span\n count = 1\n print(longest, count)\n\n\nif __name__ == '__main__':\n main()\n", "#!/usr/bin/env python\n\nline = input()\ns = [-1]\nmax = 0\nn_max = 0\ni = 0\nfor a in line:\n if a == '(':\n s.append(i)\n elif len(s) > 1:\n e = s.pop()\n d = i - s[-1]\n if d > max:\n max = d\n n_max = 1\n elif d == max:\n n_max += 1\n else:\n s[0] = i\n i =i + 1\n\nif max == 0:\n print(0, 1)\nelse:\n print(max, n_max)\n\n", "bracket_str = input()\nstack = [-1]\nmax_len = 0\nmax_len_count = 1\n\nfor i in range(len(bracket_str)):\n if bracket_str[i] == ')':\n if len(stack) > 1:\n stack.pop()\n cur_len = i - stack[-1]\n if cur_len == max_len:\n max_len_count += 1\n elif cur_len > max_len:\n max_len = cur_len\n max_len_count = 1\n elif len(stack) == 1:\n stack[0] = i\n else:\n stack.append(i)\n\nprint(max_len, max_len_count)\n", "import sys\r\nrln=sys.stdin.buffer.readline\r\nrl=lambda:rln().rstrip(b'\\r\\n').rstrip(b'\\n')\r\nri=lambda:int(rln())\r\nrif=lambda:[*map(int,rln().split())]\r\nrt=lambda:rl().decode()\r\nrtf=lambda:rln().decode().split()\r\ninf=float('inf')\r\ndir4=[(-1,0),(0,1),(1,0),(0,-1)]\r\ndir8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\nYES,NO,Yes,No,yes,no='YES','NO','Yes','No','yes','no'\r\n\r\ns=rt()\r\nn=len(s)\r\nmx,cnt=0,1\r\nstk=[-1]\r\nfor i in range(n):\r\n if s[i]=='(':\r\n stk.append(i)\r\n else:\r\n stk.pop()\r\n if not stk:\r\n stk.append(i)\r\n else:\r\n l=i-stk[-1]\r\n if mx==l:\r\n cnt+=1\r\n elif mx<l:\r\n mx,cnt=l,1\r\n\r\nprint(mx,cnt)\r\n", "import sys\r\n\r\n\r\ndef longcorrectparsubstring(s):\r\n s = s.lstrip(\")\").rstrip(\"(\\n\")\r\n stack = [-1]\r\n top = [0, 1]\r\n for i in range(len(s)):\r\n if s[i] == \"(\":\r\n stack.append(i)\r\n else:\r\n if len(stack) != 1:\r\n stack.pop()\r\n l = i - stack[len(stack) - 1]\r\n if l > top[0]:\r\n top[0] = l\r\n top[1] = 1\r\n elif l == top[0]:\r\n top[1] += 1\r\n else:\r\n stack[0] = i\r\n return \" \".join(map(str, top))\r\n\r\n\r\ndef main():\r\n if len(sys.argv) == 3:\r\n if sys.argv[1] != \"--file\":\r\n print(\"usage: (--file filename) | nothing\")\r\n strings = open(sys.argv[2]).readlines()\r\n for s in strings:\r\n print(longcorrectparsubstring(s))\r\n elif len(sys.argv) == 1:\r\n s = input()\r\n print(longcorrectparsubstring(s))\r\n else:\r\n print(\"usage: (--file filename) | nothing\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "string=input()\r\nindex=[-1]\r\ncount=1\r\nma=0\r\nfor i in range(len(string)):\r\n #print(index)\r\n if(string[i]=='('):\r\n index.append(i)\r\n elif(len(index)>1):\r\n index.pop()\r\n n=i-index[-1]\r\n if(ma<n):\r\n ma=n\r\n count=1\r\n elif(ma==n):\r\n count+=1\r\n else:\r\n index[0]=i\r\nprint(str(ma),'',str(count))\r\n ", "count,start,maxi=1,[-1],0\r\nfor i,c in enumerate(input()):\r\n if c=='(': \r\n start.append(i)\r\n else:\r\n if len(start)>1:\r\n start.pop()\r\n if maxi<(i-start[-1]): maxi,count = i-start[-1],1\r\n elif maxi==(i-start[-1]): count+=1\r\n else: start[0]=i\r\nprint(maxi,count)", "count=1\r\nstack=[-1]\r\nstring=input()\r\nmx=0\r\nfor i in range(len(string)):\r\n if string[i]=='(':\r\n stack.append(i)\r\n elif len(stack)>1:\r\n stack.pop()\r\n n=i-stack[-1]\r\n if n>mx:\r\n mx=n\r\n count=1\r\n elif n==mx:\r\n count+=1\r\n else:\r\n stack[0]=i\r\nprint(mx,count)", "def main():\r\n #get the input string\r\n string = input()\r\n #here we will store the indexes of coresponding opening bracket on the position of closing bracket\r\n correspondingOpen = [-2]*len(string)\r\n #here we will store the index of earliest opened parantesis which has a closign one\r\n earliestOpen = [-2]*len(string)\r\n #in the stack we will store the opening parantesis until we will find a closing one\r\n stack = []\r\n #for each character in string\r\n for i in range(len(string)):\r\n #if it is an opening one\r\n if string[i] == '(':\r\n #put it in stack\r\n stack.append(i)\r\n #if it is a closing one\r\n if string[i] == ')':\r\n #and we don't have opened parantesis in the stack\r\n if len(stack) == 0:\r\n #then it does not correspond it looks like this ))() \r\n #so we have no corresponding opening parantesis\r\n correspondingOpen[i] = -1\r\n #and no parantesis to the left\r\n earliestOpen[i] = -1\r\n else:#the stack is not empty\r\n #remove the last parantesis from the stack because it corresponds to the opening parantesis of the current closing one\r\n correspondingOpen[i] = stack.pop()\r\n #if from the left we have a closing parantesis that has a opening one, then we have a whole correct sequence\r\n if correspondingOpen[i] - 1 >=0 and string[correspondingOpen[i] - 1] == ')' and earliestOpen[correspondingOpen[i] - 1] != -1:\r\n #the index of earliest open starts from the left\r\n earliestOpen[i] = earliestOpen[correspondingOpen[i] - 1]\r\n earliestOpen[correspondingOpen[i] - 1] = -2\r\n else:\r\n #if we dont have other correct index to the left, just leave the starting index as it was\r\n earliestOpen[i] = correspondingOpen[i]\r\n maxLength = 0\r\n countSequences = 0\r\n length=[]\r\n i = len(string)-1\r\n #go from the right to left\r\n while i >= 0:\r\n #if we find a sequence \r\n if earliestOpen[i] >= 0:\r\n #and it's length is greater than maxLength\r\n if (i - earliestOpen[i] + 1) > maxLength:\r\n #update maxLength\r\n maxLength = i - earliestOpen[i] + 1\r\n #store all lengths in a list\r\n length.append(i - earliestOpen[i] + 1)\r\n #jump with len(sequence) to the left, in order to avoid counting embrecated sequences\r\n i = earliestOpen[i]\r\n i -= 1\r\n #count the number of sequences with max length\r\n for i in range(len(length)):\r\n if maxLength == length[i]:\r\n countSequences += 1\r\n #problem condition\r\n if countSequences == 0:\r\n countSequences = 1\r\n print(maxLength,countSequences)\r\nmain()\r\n\r\n", "s = input()\n\nn = len(s)\nstack = []\ndp = [0 for i in range(0, n)]\nmax_size = 0\nmax_cnt = 0\nfor i in range(0, n):\n c = s[i]\n if c == '(':\n stack.append(i)\n else:\n if len(stack) > 0:\n prev = stack.pop()\n temp = dp[prev - 1] + i - prev + 1\n dp[i] = temp\n if temp > max_size:\n max_size = temp\n max_cnt = 1\n elif temp == max_size:\n max_cnt += 1\nif max_size == 0:\n print(\"0 1\")\nelse:\n print(max_size, max_cnt)", "exp=input()\r\nn=len(exp)\r\nPair=[-30]*(n+1)\r\nS=[0]*n\r\ncnt=-1\r\nfor i in range(n):\r\n if exp[i]=='(':\r\n cnt+=1\r\n S[cnt]=i\r\n elif exp[i]==')':\r\n if cnt>=0:\r\n Pair[S[cnt]]=i\r\n cnt-=1\r\n\r\nMax=0\r\ncnt=1\r\nlast=-100\r\ni=0\r\nwhile i<n:\r\n tmp=Pair[i]-i+1\r\n if tmp>0:\r\n i+=tmp\r\n tmp=max(tmp,tmp+last)\r\n else:\r\n i+=1\r\n last=tmp\r\n if tmp>Max:\r\n Max=tmp\r\n cnt=1\r\n elif tmp==Max:\r\n cnt+=1\r\nprint(Max,cnt)", "# -*- coding:utf-8 -*-\n\n\"\"\"\n\ncreated by shuangquan.huang at 1/6/20\n\n\"\"\"\n\nimport collections\nimport time\nimport os\nimport sys\nimport bisect\nimport heapq\nfrom typing import List\n\n\ndef solve(s):\n c = 0\n ans, tmp, count = 0, 0, 0\n for i, v in enumerate(s):\n if v == '(':\n c += 1\n else:\n c -= 1\n if c >= 0:\n tmp += 1\n else:\n if tmp > ans:\n ans = tmp\n count = 1\n elif tmp > 0 and tmp == ans:\n count += 1\n tmp = 0\n c = 0\n if c == 0:\n if tmp > ans:\n ans = tmp\n count = 1\n elif tmp > 0 and tmp == ans:\n count += 1\n \n return ans * 2, max(count, 1)\n \n \n \ns = input()\na, b = solve(s)\nc, d = solve(['(' if v ==')' else ')' for v in s[::-1]])\nif a > c or (a == c and b >= d):\n print('{} {}'.format(a, b))\nelse:\n print('{} {}'.format(c, d))", "seq = input()\nst = []\ncurrentSize = 0\nmaxSize = 0\namount = 0\nfor c in seq:\n\tif c == \")\" and len(st)>0:\n\t\tcurrentSize += 2 + st.pop()\n\telse:\n\t\tif c == \"(\":\n\t\t\tst.append(currentSize)\n\t\tif currentSize>maxSize:\n\t\t\tmaxSize = currentSize\n\t\t\tamount = 1\n\t\telif currentSize==maxSize:\n\t\t\tamount += 1\n\t\tcurrentSize = 0\nif currentSize>maxSize:\n\tmaxSize = currentSize\n\tamount = 1\nelif currentSize==maxSize:\n\tamount += 1\nif maxSize == 0:\n\tamount = 1\nprint(maxSize,amount)", "s = input()\r\ndp = [0]*(len(s)+1)\r\n\r\nstack = []\r\nlength = 0\r\n\r\nfor i in range (0,len(s)):\r\n\r\n if s[i]=='(':\r\n stack.append(i)\r\n continue\r\n\r\n if len(stack)==0:\r\n continue\r\n\r\n j = stack[-1]\r\n stack.pop()\r\n\r\n if j>=1:\r\n prev = j-1\r\n\r\n else:\r\n prev = 0\r\n\r\n dp[i] = i-j+1 + dp[prev]\r\n \r\n \r\n if dp[i]> length:\r\n length = dp[i]\r\n count = 1\r\n\r\n elif dp[i]==length:\r\n count+=1\r\n\r\nif length==0:\r\n \r\n print(0,1)\r\nelse:\r\n print(length,count)\r\n\r\n", "a,b,s = 0,1,[-1]\nl = enumerate(input())\nfor i,c in l:\n if (c=='('): s.append(i)\n elif (len(s) > 1):\n s.pop()\n n = i - s[-1]\n if (a < n):\n a = n\n b = 1 \n elif (a == n): b += 1\n else: s[0] = i\nprint(a,b)", "from collections import deque\r\ns='#'+input()+'#'\r\nn=len(s)\r\ndp=[0]*n\r\nq=deque()\r\nfor i in range(n-1):\r\n if s[i]=='(' and s[i+1]==')':\r\n q.append((2,i+1))\r\n dp[i+1]=2\r\nwhile q:\r\n le,ind=q.popleft()\r\n if s[ind-le]=='(' and s[ind+1]==')':\r\n q.appendleft((le+2,ind+1))\r\n dp[ind+1]=le+2\r\n dp[ind]=0\r\n else:\r\n if dp[ind-le]!=0:\r\n dp[ind]+=dp[ind-le]\r\n dp[ind-le]=0\r\n q.appendleft((dp[ind],ind))\r\nprint(max(dp),(dp.count(max(dp)),1)[max(dp)==0])\r\n", "s = input().strip()\n\nmax_string = 0\ntotal_max_strings = 0\nstack = [None]*len(s)\narr = [None]*len(s)\ntop = -1\n\nfor (index, bracket) in enumerate(s):\n if bracket == '(':\n top += 1\n if arr[index-1] != None:\n stack[top] = arr[index-1]\n else:\n stack[top] = index\n elif top > -1:\n temp_len = index - stack[top] + 1\n\n if max_string < temp_len:\n max_string = temp_len\n total_max_strings = 1\n elif max_string == temp_len:\n total_max_strings += 1\n\n arr[index] = stack[top]\n top -= 1\n\nprint(max_string, total_max_strings or 1)\n", "from sys import stdin,stdout\r\ninput = stdin.readline\r\n\r\ns = input()\r\ns = s[:-1]\r\nn = len(s)\r\n\r\nsubstring = [None for i in range(n)]\r\nending = [None for i in range(n)]\r\nfrequency = [0 for i in range(n+1)]\r\n\r\nstack = []\r\n\r\nfor index,character in enumerate(s):\r\n \r\n if(character == '('):\r\n stack.append(index)\r\n continue\r\n \r\n if(len(stack) == 0):\r\n continue\r\n \r\n ind = stack.pop()\r\n substring[index] = ind\r\n ending[index] = ind\r\n \r\n if(ind > 0):\r\n ind -= 1\r\n if(s[ind] == ')' and substring[ind] != None):\r\n ending[index] = ending[ind] \r\n\r\n # if(ending[index] != None):\r\n frequency[index - ending[index] + 1] += 1\r\n \r\nmx,cnt = 0,1\r\nfor index,freq in enumerate(frequency):\r\n if(freq > 0 and index > mx):\r\n mx,cnt = index,freq\r\n\r\nprint(mx,cnt)", "import sys\n\n\n\ndef magic():\n num_of_opened, indices_of_opened = 0, []\n for i, char in enumerate(input()):\n if char == '(':\n indices_of_opened.append(i)\n elif indices_of_opened:\n yield indices_of_opened.pop()\n yield i\n\ndef solve():\n group, prev = 0, 0\n maxgroup, maxgroupcount = 0, 0\n for index in sorted(magic()):\n sub = index - prev\n if sub == 1 or sub == index:\n group += 1\n elif group > 0:\n if maxgroup == group: maxgroupcount += 1\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n group = 1\n prev = index\n\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n elif maxgroup == group:\n maxgroupcount += 1\n\n return \"%s %s\" % (maxgroup, maxgroupcount)\n\n\nprint(solve())\n\n", "ch=input()\r\nl=[]\r\nl.append(-1)\r\na=0\r\nn=1\r\nm=0\r\nfor i in range(len(ch)):\r\n if(ch[i]==\"(\" ):\r\n l.append(i)\r\n elif(len(l)>1 ):\r\n l.pop()\r\n a=i-l[-1] \r\n if(a>m):\r\n n=1\r\n m=a\r\n elif(a==m):\r\n n+=1\r\n else:\r\n l[0]=i \r\nprint(m,n)\r\n\r\n", "a = input()\r\nn = len(a)\r\ndp =[0]*(n)\r\nstack =[]\r\n\r\nfor i in range(n):\r\n if a[i]=='(':\r\n stack.append(i)\r\n continue\r\n if not stack:\r\n continue\r\n\r\n j = stack.pop()\r\n dp[i]=i-j+1+(dp[j-1] if j>1 else 0)\r\nans =0\r\nlength = max(dp)\r\ncount = dp.count(length)\r\nif length==0:\r\n print(length,1)\r\nelse:\r\n print(length,count)\r\n", "def find_longest_regular_bracket_sequence(s):\r\n stack = []\r\n max_len = 0\r\n count = 0\r\n\r\n stack.append(-1)\r\n\r\n for i in range(len(s)):\r\n if s[i] == \"(\":\r\n stack.append(i)\r\n else:\r\n stack.pop()\r\n if stack:\r\n length = i - stack[-1]\r\n if length > max_len:\r\n max_len = length\r\n count = 1\r\n elif length == max_len:\r\n count += 1\r\n else:\r\n stack.append(i)\r\n\r\n if max_len == 0:\r\n return (0, 1)\r\n return (max_len, count)\r\n\r\ndef main():\r\n s = input()\r\n result = find_longest_regular_bracket_sequence(s)\r\n print(result[0], result[1])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n ", "# LUOGU_RID: 126002664\ndef find_longest_substring(brackets):\r\n stack = []\r\n max_length = 0\r\n count = 0\r\n\r\n for i, bracket in enumerate(brackets):\r\n if bracket == '(':\r\n stack.append(i)\r\n else:\r\n if stack and brackets[stack[-1]] == '(':\r\n stack.pop()\r\n length = i - (stack[-1] if stack else -1)\r\n if length > max_length:\r\n max_length = length\r\n count = 1\r\n elif length == max_length:\r\n count += 1\r\n else:\r\n stack.append(i)\r\n\r\n if count == 0:\r\n return \"0 1\"\r\n else:\r\n return f\"{max_length} {count}\"\r\n\r\n# Example usage\r\nbrackets = input()\r\nresult = find_longest_substring(brackets)\r\nprint(result)", "s=input()\r\nq=[]\r\ndp=[0]*(len(s)+1)\r\nMax=1\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i]==\"(\":\r\n q.append(i)\r\n else:\r\n if q:\r\n temp=q.pop()\r\n dp[i]=dp[temp-1]+i-temp+1\r\n Max=max(dp[i],Max)\r\nif Max==1:\r\n print(\"0 1\")\r\nelse:\r\n for i in range(len(dp)):\r\n if dp[i]==Max:\r\n c=c+1\r\n print(Max,c)", "s = input()\r\n\r\ncls = [0] * len(s)\r\next = [0] * len(s)\r\nfreq = [0] * (len(s) + 1)\r\nfreq[0] = 1\r\nmaxLen = 0\r\n\r\nstack = []\r\nfor i in range(len(s)):\r\n if s[i] == \"(\":\r\n stack.append(i)\r\n else:\r\n if not stack:\r\n cls[i] = ext[i] = -1\r\n else:\r\n ind = stack.pop()\r\n cls[i] = ext[i] = ind\r\n if ind > 0 and s[ind-1] == \")\" and cls[ind-1] != -1:\r\n ext[i] = ext[ind-1]\r\n l = i - ext[i] + 1\r\n freq[l] += 1\r\n maxLen = max(l, maxLen)\r\n\r\nprint(maxLen, freq[maxLen])", "string=input()\r\nl=len(string)\r\ns=[-1]*l\r\ne=[-1]*l\r\nF=[0]*(l+1)\r\nstack=[]\r\nmaxi=0\r\nfor i in range(l):\r\n if string[i]==\"(\":\r\n stack.append(i)\r\n else:\r\n if len(stack)!=0:\r\n last_index=stack.pop()\r\n if last_index ==0:\r\n e[i]=0\r\n F[i-e[i]+1]+=1\r\n maxi=max(maxi,i-e[i]+1)\r\n else:\r\n if e[last_index-1]!=-1:\r\n e[i]=e[last_index-1]\r\n F[i-e[i]+1]+=1\r\n maxi=max(maxi,i-e[i]+1)\r\n else:\r\n e[i]=last_index\r\n F[i-e[i]+1]+=1\r\n maxi=max(maxi,i-e[i]+1)\r\nif maxi==0:\r\n print(0,1)\r\nelse:\r\n print(maxi,F[maxi])\r\n", "l=[-1]\r\n#print(l)\r\nmaxi,count=0,0\r\nfor i,c in enumerate(input()):\r\n if c=='(':\r\n l.append(i)\r\n #print(\"After append:\",l)\r\n else:\r\n if len(l)>1:\r\n l.pop()\r\n var=i-l[-1]\r\n #print(\"Popping time:\",l,i,l[-1],var)\r\n if var>maxi:\r\n maxi=var\r\n count=1\r\n elif var==maxi:\r\n count+=1\r\n else:\r\n l[0]=i\r\n #print(\"In case:\",l,i)\r\nif maxi:\r\n print(maxi,count)\r\nelse:\r\n print(0,1)", "inp=input();\r\nst=[];\r\nd=[-1]*len(inp);\r\nc=[-1]*len(inp);\r\nfor i in range(len(inp)):\r\n if inp[i]=='(':\r\n st.append(i);\r\n else:\r\n if len(st)==0:\r\n d[i]=-1;\r\n c[i]=-1;\r\n else:\r\n d[i]=st.pop();\r\n c[i]=d[i];\r\n if inp[d[i]-1]==')' and c[d[i]-1]!=-1:\r\n c[i]=c[d[i]-1];\r\n\r\nmaxl=0;\r\nn=1;\r\nl=0;\r\nfor i in range(len(c)):\r\n if c[i]!=-1:\r\n l=i-c[i]+1;\r\n if l>maxl:\r\n maxl=l;\r\n n=1;\r\n elif l==maxl:\r\n n+=1;\r\n\r\nprint(*[maxl,n]);\r\n", "# Longest Regular Backet Sequencing\r\nfrom collections import deque\r\ndef main():\r\n st = deque()\r\n s = input()\r\n S = [-1 for i in range(len(s))]\r\n E = [-1 for i in range(len(s))]\r\n F = [0 for i in range(len(s)+1)]\r\n F[0] = 1\r\n ma = 0\r\n for i in range(len(s)):\r\n if(s[i] == \"(\"): \r\n st.append(i)\r\n else:\r\n if(len(st)==0):\r\n S[i] = E[i] = -1\r\n else:\r\n idx = st.pop()\r\n S[i] = E[i] = idx\r\n if(idx > 0 and s[idx - 1] == \")\" and S[idx - 1] >= 0):\r\n E[i] = E[idx-1]\r\n l = i - E[i] + 1\r\n F[l] += 1\r\n ma = max(ma,l)\r\n print(ma,F[ma])\r\nmain()", "s = input()\r\nst = list()\r\nc = 0\r\nx = 0\r\nmax = 0\r\nst.append(-1)\r\nfor i in range(len(s)):\r\n if s[i] == '(':\r\n st.append(i)\r\n else:\r\n st.pop()\r\n if st :\r\n c = i-st[-1]\r\n if c > max:\r\n max = c\r\n x = 1\r\n elif c >= 1 and c == max:\r\n x+=1\r\n else:\r\n st.append(i)\r\nif x >= 1:\r\n print(str(max)+' '+ str(x))\r\nelse:\r\n print('0 1')\r\n \r\n", "s = input()\nstack = []\nans = [0 for i in range(len(s))]\nfor i,l in enumerate(s):\n\tif l==\"(\": stack.append(i)\n\telif stack:\n\t\tp = stack.pop()\n\t\tans[i]=ans[p-1]+i-p+1\nprint(max(ans),ans.count(max(ans)) if max(ans)>0 else 1)\n", "# link: https://codeforces.com/problemset/problem/5/C\r\n\r\nsequence = input()\r\nn = len(sequence)\r\nstack = [-1]\r\nmax_length = 0\r\nsubstring_count = 1\r\nfor idx in range(n):\r\n if sequence[idx] == \"(\":\r\n stack.append(idx)\r\n elif len(stack) >= 2:\r\n stack.pop()\r\n temp_count = idx - stack[-1]\r\n if max_length < temp_count:\r\n max_length = temp_count\r\n substring_count = 1\r\n elif max_length == temp_count:\r\n substring_count += 1 \r\n else:\r\n stack[0] = idx\r\nprint(max_length, substring_count) ", "if __name__ == '__main__':\r\n \r\n string = input()\r\n longest = 0\r\n count = 1\r\n stack = [-1]\r\n \r\n for i in range(len(string)):\r\n if string[i]==\"(\":\r\n stack.append(i)\r\n \r\n else:\r\n stack.pop()\r\n \r\n if not stack:\r\n stack.append(i)\r\n else:\r\n if longest<i-stack[-1]:\r\n longest = i-stack[-1]\r\n count = 0\r\n if longest==i-stack[-1]:\r\n count+=1\r\n \r\n \r\n print(\"{} {}\".format(longest,count))\r\n ", "import sys\n\n\n\ndef magic():\n num_of_opened, i = 0, 0\n indices_of_opened = []\n for i, char in enumerate(input()):\n if char == '(':\n indices_of_opened.append(i)\n num_of_opened += 1\n elif num_of_opened > 0 and char == ')':\n num_of_opened -= 1\n yield indices_of_opened.pop()\n yield i\n i += 1\n\n\ndef solve():\n group, prev = 0, 0\n maxgroup, maxgroupcount = 0, 0\n for index in sorted(magic()):\n sub = index - prev\n if sub == 1 or sub == index:\n group += 1\n elif group > 0:\n if maxgroup == group: maxgroupcount += 1\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n group = 1\n prev = index\n\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n elif maxgroup == group:\n maxgroupcount += 1\n\n return \"%s %s\" % (maxgroup, maxgroupcount)\n\n\nprint(solve())\n\n", "import collections\r\n\r\nn = list(input())\r\nstack_b = [0]\r\nstack_pos = [0]\r\nlength = 0\r\nlenarray = [0]\r\ncounter = 0\r\n\r\nfor i in range(len(n)):\r\n if n[i] == \"(\":\r\n stack_b.append(i + 1)\r\n stack_pos.append(i + 1)\r\n else:\r\n if len(stack_b) > 1:\r\n stack_b.pop()\r\n stack_pos.pop()\r\n lenarray.append(i + 1 - stack_pos[-1])\r\n else:\r\n stack_pos.append(i + 1)\r\n\r\nprint(max(lenarray), collections.Counter(lenarray)[max(lenarray)])", "# https://codeforces.com/problemset/problem/5/C\n\nbs = str(input())\nres, count = 0, 0\nstack = []\ndp = [0]*len(bs)\nfor i in range(len(bs)):\n if bs[i] == '(':\n stack.append(i)\n else:\n if len(stack) == 0:\n continue\n last_left_b = stack.pop()\n if last_left_b > 0:\n dp[i] = i - last_left_b + 1 +dp[last_left_b-1]\n else:\n dp[i] = i - last_left_b + 1\n if dp[i] > res:\n res = dp[i]\n count = 1\n elif dp[i] == res:\n count += 1\nif res == 0:\n print('0 1')\nelse:\n print(res, count)\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef sparse_table(a):\r\n table = []\r\n s0, l = a, 1\r\n table.append(s0)\r\n while 2 * l <= len(a):\r\n s = [min(s0[i], s0[i + l]) for i in range(len(s0) - l)]\r\n table.append(list(s))\r\n s0 = s\r\n l *= 2\r\n return table\r\n\r\ndef get_min(l, r, table):\r\n d = (r - l + 1).bit_length() - 1\r\n d = len(bin(r - l + 1)) - 3\r\n ans = min(table[d][l], table[d][r - pow2[d] + 1])\r\n return ans\r\n\r\ns = list(input().rstrip())\r\nx = [0]\r\nfor i in s:\r\n if not i & 1:\r\n x.append(x[-1] + 1)\r\n else:\r\n x.append(x[-1] - 1)\r\nmi = min(x)\r\nn = len(x)\r\nfor i in range(n):\r\n x[i] -= mi\r\nm = max(x)\r\ns = [0] * (m + 3)\r\nfor i in x:\r\n s[i + 2] += 1\r\nfor i in range(1, m + 3):\r\n s[i] += s[i - 1]\r\ny = [0] * n\r\nfor i in range(n):\r\n j = x[i] + 1\r\n y[s[j]] = i\r\n s[j] += 1\r\npow2 = [1]\r\nfor _ in range(22):\r\n pow2.append(2 * pow2[-1])\r\ntable = sparse_table(x)\r\nm, c = 0, 1\r\ninf = pow(10, 9) + 1\r\nl, r = y[0], y[0]\r\nfor i in range(n - 1):\r\n u, v = y[i], y[i + 1]\r\n xu, xv = x[u], x[v]\r\n if xu ^ xv or get_min(u, v, table) < xu:\r\n if m < r - l:\r\n m, c = r - l, 0\r\n if m == r - l:\r\n c += 1\r\n l, r = v, v\r\n continue\r\n r = v\r\nif m < r - l:\r\n m, c = r - l, 0\r\nif m == r - l:\r\n c += 1\r\nif not m:\r\n c = 1\r\nprint(m, c)", "'''\r\nJana Goodman\r\n\r\n5c longest reg bracket sequence\r\n\r\n'''\r\nimport sys\r\n\r\nclass Stack:\r\n def __init__(self):\r\n self.stack = list()\r\n self.len = 0\r\n\r\n def is_empty(self):\r\n return self.len == 0\r\n\r\n def top(self):\r\n if self.is_empty():\r\n return None\r\n return self.stack[-1]\r\n\r\n def push(self, elt):\r\n self.stack.append(elt)\r\n self.len += 1\r\n\r\n def pop(self):\r\n if self.is_empty():\r\n return None\r\n self.len -= 1\r\n return self.stack.pop(-1)\r\n\r\n def clear(self):\r\n self.stack = list()\r\n self.len = 0\r\n\r\n def replace(self, pos, elt):\r\n self.stack[pos] = elt\r\n\r\n def __repr__(self):\r\n return f'Stack: {self.stack}'\r\n\r\nCLOSE = ')'\r\nOPEN = '('\r\n\r\ndef max_regular(s):\r\n max_len, num_maxes, reg_len = 0, 0, None\r\n good_start = -1\r\n stack = Stack()\r\n for i, p in enumerate(s):\r\n if p == OPEN:\r\n stack.push(i)\r\n elif p == CLOSE:\r\n if stack.is_empty():\r\n good_start = i\r\n else:\r\n stack.pop()\r\n if stack.is_empty():\r\n reg_len = i - good_start\r\n else:\r\n reg_len = i - stack.top()\r\n if max_len < reg_len:\r\n max_len, num_maxes = reg_len, 1\r\n elif max_len == reg_len:\r\n num_maxes += 1\r\n\r\n return max_len, num_maxes\r\n\r\nif __name__ == '__main__':\r\n seq = input().strip()\r\n max_len, num_maxes = max_regular(seq)\r\n if max_len == 0:\r\n num_maxes = 1\r\n print(f'{max_len} {num_maxes}')\r\n", "'''input\n()))()(())\n'''\ns = input().lstrip(')')\nmax_len = 0\nnum_max = 1\ncount = 0\nstart_pos = {}\n\nfor i, c in enumerate(s):\n if c == '(':\n count += 1\n if count not in start_pos:\n start_pos[count] = i\n else:\n count -= 1\n if count < 0:\n count = 0\n start_pos = {}\n if count + 2 in start_pos:\n del start_pos[count + 2]\n if count + 1 in start_pos:\n l = i - start_pos[count + 1] + 1\n if l > max_len:\n max_len = l\n num_max = 1\n # print(i, start_pos[count + 1])\n elif l == max_len:\n num_max += 1\n\nprint(max_len, num_max)\n", "def main():\n m = cnt = 1\n stack = [1]\n for c in input():\n if c == '(':\n stack.append(1)\n else:\n if len(stack) < 2:\n stack[0] = 1\n else:\n x = stack.pop() + stack.pop() + 1\n if m < x:\n m, cnt = x, 1\n elif m == x:\n cnt += 1\n stack.append(x)\n print(m - 1, cnt)\n\n\nif __name__ == '__main__':\n main()\n", "from collections import defaultdict\r\ns = [0] + list(input())\r\nn = len(s)\r\ndp = [0] * n\r\ng = defaultdict(int)\r\nfor i in range(1, n):\r\n if s[i] == ')':\r\n if s[i - 1] == '(':\r\n if i - 2 >= 0:\r\n dp[i] = dp[i - 2] + 2\r\n else:\r\n if i - dp[i - 1] + 1 >= 0 and s[i - dp[i - 1] - 1] == '(':\r\n if i - dp[i - 1] - 2 >= 0:\r\n dp[i] += dp[i - dp[i - 1] - 2] + 2 + dp[i - 1]\r\n g[dp[i]] += 1\r\nans_k, ans_v = -1, -1\r\nfor k, v in g.items():\r\n if k > ans_k:\r\n ans_k = k\r\n ans_v = v\r\nif ans_k <= 0:\r\n print(0, 1)\r\nelse:\r\n print(ans_k, ans_v)", "def solve():\r\n s = input()\r\n n = len(s)\r\n \r\n l, r, maxLen, cnt, maxCnt = 0, 0, 0, 0, 0\r\n for i in range(n):\r\n if s[i] == '(':\r\n l += 1\r\n else:\r\n r += 1\r\n if l == r:\r\n if 2 * r > maxLen:\r\n maxLen = 2 * r\r\n cnt = 1\r\n elif 2 * r == maxLen:\r\n cnt += 1\r\n elif r > l:\r\n l, r = 0, 0\r\n maxCnt = max(maxCnt, cnt)\r\n l, r, cnt = 0, 0, 0\r\n for i in range(n-1, -1, -1):\r\n if s[i] == '(':\r\n l += 1\r\n else:\r\n r += 1\r\n \r\n if l == r:\r\n if 2 * l > maxLen:\r\n maxLen = 2 * l\r\n cnt = 1\r\n elif 2 * l == maxLen:\r\n cnt += 1\r\n elif l > r:\r\n l, r = 0, 0\r\n\r\n maxCnt = max(maxCnt, cnt)\r\n\r\n if maxLen != 0:\r\n print(str(maxLen) + ' '+ str(maxCnt))\r\n else:\r\n print('0 1')\r\nif __name__ == \"__main__\":\r\n solve()", "def solution():\r\n brackets = list(input())\r\n open_position_by_tally = {0: -1} # tally count -> last_opened candidate\r\n tally = 0\r\n max_length = 0\r\n max_count = 0\r\n for idx, b in enumerate(brackets):\r\n if b == '(':\r\n tally += 1\r\n if tally not in open_position_by_tally:\r\n open_position_by_tally[tally] = idx\r\n else:\r\n tally -= 1\r\n if tally not in open_position_by_tally:\r\n open_position_by_tally[tally] = idx\r\n else:\r\n length = idx - open_position_by_tally[tally]\r\n if length == max_length:\r\n max_count += 1\r\n elif length > max_length:\r\n max_length = length\r\n max_count = 1\r\n if tally + 1 in open_position_by_tally:\r\n del open_position_by_tally[tally + 1]\r\n\r\n if max_length == 0:\r\n print(0, 1)\r\n else:\r\n print(max_length, max_count)\r\n\r\n\r\nsolution()", "string = input()\r\nst = list()\r\nmx = occ = 0\r\n\r\nscores = [1] * len(string) + [0]\r\n\r\nfor idx, c in enumerate(string):\r\n if len(st) == 0:\r\n st.append(idx)\r\n elif string[st[-1]] == '(' and c == ')':\r\n popped = st.pop()\r\n scores[idx + 1] += scores[idx] + scores[popped]\r\n combined = scores[idx] + scores[popped]\r\n if combined > mx:\r\n mx = combined\r\n occ = 1\r\n elif combined == mx:\r\n occ += 1\r\n else:\r\n st.append(idx)\r\n\r\nif mx == 0:\r\n print(mx, 1)\r\nelse:\r\n print(mx, occ)\r\n", "string=input()\r\ndef main(string):\r\n\tst=[]\r\n\tanswer=[False]*(len(string)+1)\r\n\tfor i in range(0,len(string)):\r\n\t\tif string[i]==\"(\":\r\n\t\t\tst.append(i)\r\n\t\telse:\r\n\t\t\tif not st:\r\n\t\t\t\tcontinue\r\n\t\t\tanswer[st.pop()] = True\r\n\t\t\tanswer[i] = True\r\n\tres = []\r\n\tmx = 0\r\n\tfor i in range(0,len(answer)):\r\n\t\tif answer[i]==False:\r\n\t\t\tres.append(mx)\r\n\t\t\tmx=0\r\n\t\t\tcontinue\r\n\t\tmx+=1\r\n\r\n\tmx = max(res)\r\n\tif mx==0:\r\n\t\tprint(0, 1)\r\n\telse:\r\n\t\tprint(mx, res.count(mx))\r\nmain(string)", "init_brackets = tuple(input())\r\n\r\nstack_id = [-1]\r\nresult = {0: 1}\r\n\r\nfor i, bracket in enumerate(init_brackets):\r\n if bracket == '(':\r\n stack_id.append(i)\r\n else:\r\n stack_id.pop()\r\n if stack_id:\r\n res = i - stack_id[-1]\r\n result[res] = result.get(res, 0) + 1\r\n else:\r\n stack_id.append(i)\r\n \r\nmax_res = max(result)\r\nprint(max_res, result[max_res])\r\n\t\t\t\t\t\t \t\t\t\t\t\t \t\t \t\t\t \t \t \t", "import collections\r\n\r\ns = input()\r\n\r\nM = 10 ** 6 + 5\r\n\r\ndp = [0] * M\r\n\r\nstack = collections.deque()\r\n\r\nmaxLen = 0\r\ncnt = 0\r\n\r\nfor i, c in enumerate(s):\r\n if c == \")\":\r\n if 0 == len(stack): continue\r\n tmp = stack.pop()\r\n if tmp:\r\n dp[i] = dp[tmp - 1] + i - tmp + 1\r\n else:\r\n dp[i] = i + 1\r\n if dp[i] > maxLen:\r\n maxLen = dp[i]\r\n cnt = 1\r\n elif dp[i] == maxLen:\r\n cnt += 1\r\n else:\r\n stack.append(i)\r\nif not maxLen:\r\n cnt = 1\r\nprint(maxLen, end = \" \")\r\nprint(cnt)", "sa=input()\r\nw,c,b,l=0,1,-1,[]\r\nfor i in range(len(sa)):\r\n if sa[i]=='(':l.append(i)\r\n elif l:\r\n l.pop()\r\n t=i-l[-1] if l else i-b\r\n if t>w: w,c=t,1\r\n elif t==w: c+=1\r\n else:b=i\r\nprint(w,c)", "seq = input()\r\nst = []\r\ncurrentSize = 0\r\nmaxSize = 0\r\namount = 0\r\nfor c in seq:\r\n if c == \")\" and len(st)>0:\r\n currentSize += 2 + st.pop()\r\n else:\r\n if c == \"(\":\r\n st.append(currentSize)\r\n if currentSize>maxSize:\r\n maxSize = currentSize\r\n amount = 1\r\n elif currentSize==maxSize:\r\n amount += 1\r\n currentSize = 0\r\nif currentSize>maxSize:\r\n maxSize = currentSize\r\n amount = 1\r\nelif currentSize==maxSize:\r\n amount += 1\r\nif maxSize == 0:\r\n amount = 1\r\nprint(maxSize,amount)", "\r\ns = input()\r\n\r\nl_idx = list()\r\ndp = [0] * len(s)\r\n\r\nmax_v = 0\r\nfor i in range(len(s)):\r\n #print(i, l_idx)\r\n if s[i] == '(':\r\n l_idx.append(i)\r\n else:\r\n now = 0\r\n if len(l_idx) > 0:\r\n now = 2\r\n if l_idx[-1] > 0:\r\n now += dp[l_idx[-1]-1]\r\n if i > 0:\r\n now += dp[i-1]\r\n l_idx.pop()\r\n dp[i] = now\r\n max_v = max(now, max_v)\r\n\r\n#print(dp)\r\nif max_v == 0:\r\n print(0, 1)\r\nelse:\r\n num = dp.count(max_v)\r\n print(max_v, num)", "# import sys\r\n# sys.stdout=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\output.txt','w')\r\n# sys.stdin=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\input.txt','r')\r\n\r\n\r\nimport heapq\r\nimport math\r\nimport collections\r\nimport bisect\r\nmod=10**9+7\r\ndef solve(s):\r\n n=len(s)\r\n su=0\r\n st=set()\r\n left=0\r\n right=n-1\r\n maxi=0\r\n count=0\r\n for i in range(n):\r\n su+=(s[i]==\"(\")\r\n su-=(s[i]==\")\")\r\n if su<0:\r\n su=0\r\n left=i+1\r\n if su==0:\r\n if maxi<i-left+1:\r\n maxi=i-left+1\r\n count=1\r\n elif maxi==i-left+1:\r\n count+=1\r\n st.add((left,i))\r\n\r\n su=0\r\n for i in range(n-1,-1,-1):\r\n su+=(s[i]==\")\")\r\n su-=(s[i]==\"(\")\r\n if su<0:\r\n su=0\r\n right=i-1\r\n if su==0:\r\n # print(i,right)\r\n if (i,right) in st:\r\n continue\r\n if maxi<right-i+1:\r\n maxi=right-i+1\r\n count=1\r\n elif maxi==right-i+1:\r\n count+=1 \r\n if maxi: return str(maxi)+\" \"+str(count)\r\n return str(0)+\" \"+\"1\"\r\n \r\n\r\n \r\n\r\n\r\n# t=int(input())\r\n# for _ in range(t):\r\n# n=int(input()) \r\ns=input()\r\nprint(solve(s))", "E = [0]*(1000001)\r\nS = [0]*(1000001)\r\nf = [0]*(1000001)\r\ns = input()\r\nstack = []\r\nn = len(s)\r\nmx = 0\r\nfor i in range(n):\r\n if s[i] == '(':\r\n stack.append(i)\r\n else:\r\n if stack == []:\r\n S[i] = -1\r\n E[i] = -1\r\n else:\r\n j = stack.pop()\r\n S[i] = E[i] = j\r\n if (j>0 and s[j-1] == ')'and S[j-1]>=0):\r\n E[i] = E[j-1]\r\n l = i-E[i]+1\r\n f[l] = f[l]+1\r\n mx = max(mx,l)\r\nf[0] = 1\r\nprint(mx,end=\" \")\r\nprint(f[mx])\r\n ", "from collections import defaultdict\r\n\r\ns = list(input())\r\ncnt = 0\r\ng = defaultdict(int)\r\nlast = 0\r\nfor i, ch in enumerate(s):\r\n if ch == '(':\r\n cnt += 1\r\n else:\r\n cnt -= 1\r\n if cnt < 0:\r\n cnt = 0\r\n last = i\r\n elif cnt == 0:\r\n g[i - last] += 1\r\nans_k, ans_v = -1, -1\r\nfor k, v in g.items():\r\n if k > ans_k:\r\n ans_k = k\r\n ans_v = v\r\ng.clear()\r\ncnt, last = 0, len(s)\r\nfor i in range(len(s) - 1, -1, -1):\r\n if s[i] == ')':\r\n cnt += 1\r\n else:\r\n cnt -= 1\r\n if cnt < 0:\r\n cnt = 0\r\n last = i\r\n elif cnt == 0:\r\n g[last - i] += 1\r\nfor k, v in g.items():\r\n if k > ans_k:\r\n ans_k = k\r\n ans_v = v\r\nif ans_k == -1:\r\n print(0, 1)\r\nelse:\r\n print(ans_k, ans_v)", "s = input()\r\nst = []\r\na = 0 \r\nb = 0\r\nc = 0\r\nm = 0\r\nn = 0\r\n#print(s[82:])\r\nfor i in range(len(s)):\r\n if s[i]=='(':\r\n st.append(i)\r\n elif s[i]==')':\r\n if st:\r\n st.pop()\r\n if st == []:\r\n if c!=b:\r\n a = c\r\n b = i + 1\r\n c = i + 1\r\n if i - a + 1 > m:\r\n m = i - a + 1\r\n n = 1\r\n elif i - a + 1 == m:\r\n n+=1\r\n else:\r\n c = i + 1\r\n #print(a,b)\r\nz = len(s)\r\nwhile st :\r\n c = st.pop()\r\n #print(c)\r\n if z - c - 1 > m:\r\n m = z - c - 1\r\n n = 1\r\n elif z - c - 1 == m:\r\n n+=1\r\n z = c\r\nif m == 0:\r\n n = 1\r\nprint(m,n)\r\n ", "st = []\r\ns = input()\r\ndp = [0] * (len(s) + 1)\r\nfor i, c in enumerate(s, 1):\r\n if c == '(':\r\n st.append(i)\r\n elif len(st):\r\n j = st.pop()\r\n dp[i] = dp[j - 1] + i - j + 1\r\nres = max(dp)\r\nif res == 0:\r\n count = 1\r\nelse:\r\n count = dp.count(res)\r\nprint(res, count)", "s = input()\r\nn = len(s)\r\nss = []\r\nc = [-1 for j in range(n)]\r\nd = [-1 for k in range(n)]\r\nmlen = 0\r\ncnt = 0\r\nf={0:1}\r\nfor i in range(n):\r\n if s[i] =='(':\r\n ss.append(i)\r\n if ss!=[] and s[i] ==')':\r\n c[i] = ss.pop()\r\n d[i] = c[i] \r\n if s[d[i]-1]==')' and c[d[i]-1]!=-1:\r\n c[i] = c[d[i]-1]\r\n \r\nfor i in range(len(c)):\r\n if c[i]!=-1:\r\n c[i]=i-c[i]+1\r\nmx = max(c)\r\nif mx == -1:\r\n print(mlen,f[mlen])\r\nelse:\r\n print(mx,c.count(mx))", "def longest_regular_substring(s):\n stack = []\n max_len = 0\n count = 1\n start = 0\n for i, c in enumerate(s):\n if c == '(':\n stack.append(i)\n else:\n if stack:\n stack.pop()\n if stack:\n length = i - stack[-1]\n else:\n length = i - start + 1\n if length > max_len:\n max_len = length\n count = 1\n elif length == max_len:\n count += 1\n else:\n start = i + 1\n return max_len, count\n\ns = input()\nprint(*longest_regular_substring(s))\n\n\t \t \t \t \t\t\t \t\t\t\t\t \t\t\t \t\t \t", "s = input()\r\nstack = []\r\ndp = [[-1, -1] for _ in range(len(s))]\r\n# dp[i][0] = earliest index of s[i] such that [dp[i][0], i] is a valid substring\r\n# dp[i][1] = corresponding open bracket\r\n\r\nfor i in range(len(s)):\r\n if s[i] == \"(\":\r\n stack.append(i)\r\n elif s[i] == \")\":\r\n if len(stack) == 0:\r\n continue\r\n j = stack.pop()\r\n dp[i][1] = j\r\n if s[j-1] == \")\" and dp[j-1][0] != -1:\r\n dp[i][0] = dp[j-1][0]\r\n else:\r\n dp[i][0] = j\r\nmax_len = 0\r\nfor i in range(len(s)):\r\n if dp[i][0] == -1:\r\n continue\r\n if i - dp[i][0] + 1 > max_len:\r\n max_len = i - dp[i][0] + 1\r\nnum_substrings = 0\r\nfor i in range(len(s)):\r\n if dp[i][0] == -1:\r\n continue\r\n if i - dp[i][0] + 1 == max_len:\r\n num_substrings += 1\r\nif max_len == 0:\r\n num_substrings = 1\r\nprint(max_len, num_substrings)", "if __name__ == \"__main__\":\n\ttmp = str(input())\n\tlocal_start = None\n\tlocal_max = 0\n\thow_many = 1\n\tlst = [-1]\n\tfor i in range(len(tmp)):\n\t\t\n\t\tif tmp[i]==\"(\":\n\n\t\t\tlst.append(i)\n\t\telif len(lst)>1:\n\t\t\tx = lst.pop()\n\t\t\tqq = i -lst[-1]\n\n\t\t\tif qq==local_max:\n\t\t\t\thow_many+=1\n\t\t\telif qq>=local_max:\n\t\t\t\tlocal_max=qq\n\t\t\t\thow_many=1\n\t\telse:\n\t\t\tlst[0]=i\n\t\n\t\t\n\t\t\t\n\tprint(local_max,how_many)\n", "def longestValidParentheses(s):\r\n if len(s) < 2:\r\n return 0\r\n tans = 0\r\n st = []\r\n cans = 0\r\n mn = float(\"inf\")\r\n dp = [0] * len(s)\r\n for ind, i in enumerate(s):\r\n if i == \"(\":\r\n st.append(ind)\r\n if i == \")\":\r\n if st:\r\n id = st.pop()\r\n if id - 1 >= 0 and ind - 1 >= 0:\r\n dp[ind] = dp[id - 1] + dp[ind - 1] + 2\r\n elif id - 1 < 0:\r\n dp[ind] = dp[ind - 1] + 2\r\n mx=max(dp)\r\n if mx==0:\r\n print(0,1)\r\n else:\r\n print(mx,dp.count(mx))\r\n\r\nlongestValidParentheses(input())\r\n", "# import sys\r\n# sys.stdout=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\output.txt','w')\r\n# sys.stdin=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\input.txt','r')\r\n\r\n\r\nimport heapq\r\nimport math\r\nimport collections\r\nimport bisect\r\nmod=10**9+7\r\ndef solve(s):\r\n n=len(s)\r\n dp=[0]*n\r\n st=[]\r\n maxi=0\r\n count=0\r\n for i in range(n):\r\n if s[i]==\"(\":\r\n st.append(i)\r\n continue\r\n elif not st:\r\n continue\r\n else:\r\n j=st.pop()\r\n dp[i]=i-j+1+dp[j-1]\r\n if maxi<dp[i]:\r\n maxi=dp[i]\r\n count=1\r\n elif maxi==dp[i]:\r\n count+=1\r\n if maxi: return str(maxi)+\" \"+str(count)\r\n return str(0)+\" \"+\"1\"\r\n \r\n\r\n \r\n\r\n\r\n# t=int(input())\r\n# for _ in range(t):\r\n# n=int(input()) \r\ns=input()\r\nprint(solve(s))", "s=input()\nstack=[]\nhigh_length=0\nss_count=1\nfor i in range(0,len(s)):\n\tif(s[i]=='('):\n\t\tstack.append(i)\n\telse:\n\t\tif(stack!=[] and s[stack[-1]]=='('):\n\t\t\tstack.pop()\n\t\t\tif(stack!=[]):length=i-stack[-1]\n\t\t\telse:length=i+1\n\t\t\tif(high_length<length):\n\t\t\t\thigh_length=length\n\t\t\t\tss_count=1\n\t\t\telif(high_length==length):\n\t\t\t\tss_count+=1\n\t\telse:\n\t\t\tstack.append(i)\nprint(high_length,ss_count)\n\t\t\t\t\n\t\n\t\n\n", "from collections import defaultdict\r\n# import threading\r\n# import sys\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 # sol first code later dorime\r\n s = list(rs())\r\n n = len(s)\r\n dp = [0]*n\r\n st = []\r\n for idx, i in enumerate(s):\r\n if i == '(':\r\n st.append(idx)\r\n else:\r\n if st:\r\n b = st.pop()\r\n dp[idx] = dp[b-1]+(idx-b+1)\r\n mx = max(dp)\r\n if mx == 0:\r\n print(0, 1)\r\n else:\r\n print(mx, dp.count(mx))\r\n pass\r\n\r\n\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "import math\r\nimport heapq\r\nimport bisect\r\nimport functools\r\nimport itertools\r\nimport collections\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom typing import List\r\n\r\nMOD0 = 10 ** 9 + 7\r\nMOD1 = 998244353\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\nread_str = lambda: input().strip()\r\nread_int = lambda: int(input())\r\nread_ints = lambda: map(int, input().split())\r\nread_list_ints = lambda: list(map(int, input().split()))\r\nread_list_strs = lambda: input().strip().split()\r\n\r\n\r\ndef solve():\r\n s, ans1, ans2, rec = read_str(), 0, 0, collections.defaultdict(list)\r\n\r\n n = len(s)\r\n pre = [0] * (n + 1)\r\n for i, c in enumerate(s):\r\n if c == '(':\r\n pre[i + 1] = pre[i] + 1\r\n rec[pre[i]].append(i)\r\n else:\r\n pre[i + 1] = pre[i] - 1\r\n\r\n left, st = [-1] * (n + 1), []\r\n for i in range(n, -1, -1):\r\n while st and st[-1][0] > pre[i]:\r\n left[st.pop()[1]] = i\r\n st.append((pre[i], i))\r\n\r\n for i in range(1, n):\r\n if s[i] == ')':\r\n i += 1\r\n idx = bisect.bisect_right(rec[pre[i]], left[i])\r\n if idx < len(rec[pre[i]]):\r\n tmp = i - rec[pre[i]][idx]\r\n if tmp > ans1:\r\n ans1 = tmp\r\n ans2 = 1\r\n elif tmp == ans1:\r\n ans2 += 1\r\n\r\n if ans1:\r\n print(ans1, ans2)\r\n else:\r\n print(0, 1)\r\n\r\n\r\nsolve()", "s=input()\r\nstr=[-1]\r\ntot=1\r\nans=0\r\nfor i in range(len(s)):\r\n if s[i]=='(':\r\n str.append(i)\r\n else:\r\n str.pop()\r\n if len(str)>0:\r\n res=i-str[-1]\r\n if res>ans:\r\n ans=res\r\n tot=1\r\n elif res==ans:\r\n tot+=1\r\n else:\r\n str.append(i)\r\nprint(ans,tot)\r\n \t\t ", "from sys import stdin\r\n# input=stdin.buffer.readline\r\ninput=lambda : stdin.readline().strip()\r\nlin=lambda :list(map(int,input().split()))\r\niin=lambda :int(input())\r\nmain=lambda :map(int,input().split())\r\nfrom math import ceil,sqrt,factorial,log\r\nfrom collections import deque\r\nfrom bisect import bisect_left\r\nmod=998244353\r\nmod=1000000007\r\ndef gcd(a,b):\r\n\ta,b=max(a,b),min(a,b)\r\n\twhile a%b!=0:\r\n\t\ta,b=b,a%b\r\n\treturn b\r\ndef moduloinverse(a):\r\n\treturn(pow(a,mod-2,mod))\r\ndef solve(we):\r\n\ts=input()\r\n\td={}\r\n\tini=0\r\n\tz=0\r\n\tl=set()\r\n\tn=len(s)-1\r\n\tfor i in range(len(s)):\r\n\t\tif s[i]=='(':\r\n\t\t\tz+=1\r\n\t\telse:\r\n\t\t\tz-=1\r\n\t\tif z==0:\r\n\t\t\tl.add((min(i,ini),max(i,ini)))\r\n\t\telif z<0:\r\n\t\t\tz=0\r\n\t\t\tini=i+1\r\n\tif z==0 and ini<=n:\r\n\t\tl.add((min(n,ini),max(n,ini)))\r\n\tini=len(s)-1\r\n\tz=0\r\n\tfor i in range(len(s)-1,-1,-1):\r\n\t\tif s[i]=='(':\r\n\t\t\tz+=1\r\n\t\telse:\r\n\t\t\tz-=1\r\n\t\tif z==0:\r\n\t\t\tl.add((min(i,ini),max(i,ini)))\r\n\t\telif z>0:\r\n\t\t\tz=0\r\n\t\t\tini=i-1\r\n\tif z==0 and ini>=0:\r\n\t\tl.add((min(0,ini),max(0,ini)))\r\n\t# print(l)\r\n\tma=0\r\n\td[0]=1\r\n\tfor i in l:\r\n\t\tt=i[1]-i[0]+1\r\n\t\tif t not in d:\r\n\t\t\td[t]=0\r\n\t\td[t]+=1\r\n\t\tma=max(ma,t)\r\n\tprint(ma,d[ma])\t\r\n\r\nqwe=1\r\n# qwe=iin()\r\nfor _ in range(qwe):\r\n\tsolve(_+1)", "def get_result(string):\r\n brackets = [0] * len(string)\r\n stack = []\r\n for i, s in enumerate(string):\r\n if s == '(':\r\n stack.append(i)\r\n else:\r\n if stack:\r\n brackets[stack.pop()] = 1\r\n brackets[i] = 1\r\n max_len = 0\r\n count = 0\r\n cur_chain = 0\r\n\r\n for i, bracket in enumerate(brackets):\r\n if not bracket and cur_chain:\r\n if cur_chain > max_len:\r\n max_len = cur_chain\r\n count = 1\r\n elif cur_chain == max_len:\r\n count += 1\r\n\r\n cur_chain = 0\r\n else:\r\n cur_chain += bracket\r\n\r\n if cur_chain > max_len:\r\n return cur_chain, 1\r\n elif cur_chain == max_len:\r\n count += 1\r\n return max_len, count\r\n\r\n\r\nif __name__ == \"__main__\":\r\n import sys\r\n\r\n line = next(sys.stdin).strip()\r\n\r\n max_len, count = get_result(line)[:2]\r\n print(f'{max_len} {count or 1}')\r\n", "s = input()\r\ndp, m, c, mx = [0], {0:-1}, 0, 0\r\nfor i in range(len(s)):\r\n if s[i] == '(':\r\n dp.append(0)\r\n c += 1\r\n else:\r\n c -= 1\r\n j = m.get(c, -2)\r\n if j == -2:\r\n dp.append(0)\r\n else:\r\n dp.append(dp[j + 1] + i - j)\r\n mx = max(mx, dp[-1])\r\n m[c] = i\r\nprint(*[mx, dp.count(mx)] if mx else \"01\")", "from collections import deque\r\ndef solve(st):\r\n stack = deque()\r\n mx = 0\r\n for i in range(len(st)):\r\n if st[i] == \"(\":\r\n stack.append(i)\r\n else:\r\n if len(stack) == 0:\r\n S[i] = -1\r\n E[i] = -1\r\n else:\r\n ri = stack.pop()\r\n S[i] = ri\r\n E[i] = ri\r\n if ri > 0 and st[ri-1] == \")\" and S[ri-1] >= 0:\r\n E[i] = E[ri-1]\r\n l = i-E[i]+1\r\n F[l] += 1\r\n mx = max(mx, l)\r\n F[0] = 1\r\n print(mx, F[mx])\r\n\r\n\r\nmax_l = 1000001\r\nF = [0 for i in range(max_l)]\r\nS = [0 for i in range(max_l)]\r\nE = [0 for i in range(max_l)]\r\ns = input()\r\nsolve(s)", "################################################################################\r\nbracket=input()\r\n\r\n# bracket=')((())))(()())'\r\n# bracket='))('\r\n# bracket='()(())()'\r\n# bracket='((((()((('\r\n################################################################################\r\nn=len(bracket)\r\n\r\nregular=[0 for i in range(n)]\r\nstack=[]\r\nfor i,s in enumerate(bracket):\r\n if s=='(':\r\n stack.append(i)\r\n else:\r\n if len(stack)>0:\r\n regular[i]=1\r\n j=stack.pop()\r\n regular[j]=1\r\n\r\nlongs=[0 for i in range(n)]\r\nlong=0\r\nfor i,r in enumerate(regular):\r\n if r:\r\n long+=1\r\n longs[i]=long\r\n else:\r\n long=0\r\n\r\nmax_regular=max(longs)\r\nif max_regular==0:\r\n print('0 1')\r\nelse:\r\n out=str(max_regular)+' '+str(longs.count(max_regular))\r\n print(out)\r\n", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nimport sys\r\nmod = 1000000007\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\ns = st()\r\nn = len(s)\r\nvalid = [-1]*n\r\nfreq = [0]*(n+1)\r\nstack = []\r\nfor i in range(n):\r\n if s[i] == ')':\r\n if stack:\r\n last = stack.pop()\r\n if last - 1 >= 0 and valid[last-1] != -1:\r\n last = valid[last-1]\r\n valid[i] = last\r\n now = i - last + 1\r\n freq[now] += 1\r\n else:\r\n stack.append(i)\r\ng = 0\r\nfor i in range(n, 0, -1):\r\n if freq[i] > 0:\r\n print(i, freq[i])\r\n g = 1\r\n break\r\nif g == 0:\r\n print(0, 1)\r\n", "# LUOGU_RID: 101907434\ns = input()\r\nt = []\r\na = [0] * len(s)\r\nfor i, c in enumerate(s):\r\n if c == '(':\r\n t += i,\r\n elif t:\r\n a[t.pop()] = a[i] = 1\r\na = ''.join(map(str, a)).split('0')\r\nif max(a):\r\n print(len(max(a)), a.count(max(a)))\r\nelse:\r\n print('0 1')", "import sys\r\nfrom collections import Counter\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\ns = inpu().rstrip('\\n')\r\ncheck = [0]*len(s)\r\nstack = []\r\nind = []\r\nfor i, j in enumerate(s) :\r\n if (len(stack) == 0) and (j == ')') :\r\n continue\r\n if j == '(' :\r\n stack.append(j)\r\n ind.append(i)\r\n if j == ')' :\r\n stack.pop()\r\n check[ind.pop()] = 1\r\n check[i] = 1\r\nans = [0]*len(s)\r\nfor i in range(len(s)) :\r\n if check[i] == 1:\r\n ans[i] = 1 + ans[i - 1]\r\nc = Counter(ans).most_common()\r\nif c[-1][0] == 0:\r\n prin(\"0 1\\n\")\r\nelse:\r\n prin(' '.join(map(str, c[-1])) + '\\n')", "line = input()\n\nres = [0, 1]\nMin = [-1 for i in range(len(line)+1)]\nstack = []\nfor (i, ch) in enumerate(line):\n if ch == '(':\n stack.append(i)\n else:\n if len(stack):\n left = stack.pop()\n right = i\n\n if Min[left-1] != -1:\n left = Min[left-1]\n Min[right] = left\n\n length = right-left+1\n if length > res[0]:\n res = [length, 1]\n elif length == res[0]:\n res[1] += 1\n\nprint(res[0], res[1])\n", "s = input()\r\n# s = \"()(())()\"\r\nst = []\r\nans = []\r\n\r\nfor i,c in enumerate(s):\r\n if c==\"(\":\r\n st.append(i)\r\n elif st:\r\n q = st.pop()\r\n cur = [q,i] \r\n while True:\r\n if ans:\r\n x,y = ans[-1]\r\n if x==cur[0]+1 and y== cur[1]-1:\r\n ans.pop()\r\n elif y==cur[0]-1:\r\n ans.pop()\r\n cur[0]=x\r\n else:\r\n break\r\n else:\r\n break\r\n ans.append(cur)\r\nmx = 0\r\nmc = 1\r\nfor x,y in ans:\r\n if y-x+1>mx:\r\n mx = y-x+1\r\n mc = 1\r\n elif y-x+1==mx:\r\n mc+=1\r\nprint(mx,mc)\r\n", "s=input()\r\nn=len(s)\r\nst=[]\r\ncount=0\r\nmaxV=0\r\ndp=[0]*(n+1)\r\n\r\nfor i,ch in enumerate(s):\r\n if ch==')' and not st:\r\n continue\r\n elif ch=='(':\r\n st.append(i)\r\n else:\r\n idx=st.pop()\r\n length=i-idx+1\r\n dp[i]=length+dp[idx-1]\r\n if dp[i]>maxV:\r\n maxV=dp[i]\r\n count=1\r\n elif dp[i]==maxV:\r\n count+=1\r\n\r\n# for val in dp.values():\r\n# maxV=max(maxV,val)\r\n\r\n# for val in dp.values():\r\n# if val==maxV:\r\n# count+=1\r\n\r\n\r\n\r\nif maxV==0:\r\n print('0 1')\r\nelse:\r\n print(str(maxV)+' '+str(count))\r\n", "import sys\r\ninput = sys.stdin.readline\r\ndef I():return input().strip()\r\ndef II():return int(input().strip())\r\ndef LI():return [*map(int,input().strip().split())]\r\nimport string, math, time, functools, random, fractions\r\nfrom heapq import heappush, heappop, heapify\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import deque, defaultdict, Counter, OrderedDict\r\nfrom itertools import permutations, combinations, groupby\r\nfrom operator import itemgetter\r\n\r\ninp = I()\r\nsize = len(inp)\r\ndp = [0] * (size + 1)\r\nque = deque()\r\nfor i in range(1, size + 1):\r\n if inp[i - 1] == '(':\r\n que.append(i)\r\n else:\r\n if que:\r\n pop = que.pop()\r\n dp[i] = i - pop + 1 + dp[pop - 1]\r\nmex = max(dp)\r\ncnt = dp.count(mex)\r\nif not mex:\r\n print(0, 1)\r\nelse:\r\n print(mex, cnt)", "s = input()\nn = len(s)\n\nstack = []\nc = [-1] * n\np = [-1] * n\nfor i in range(n):\n if s[i] == '(':\n stack.append(i)\n continue\n if not stack:\n continue\n j = stack.pop()\n p[i] = j\n c[i] = j\n if j > 0 and s[j - 1] == ')' and p[j - 1] != -1:\n c[i] = c[j - 1]\n\n\nans = 0\ncnt = 1\nfor i in range(n):\n if c[i] == -1:\n continue\n now = i - c[i] + 1\n if now > ans:\n ans = now\n cnt = 0\n if now == ans:\n cnt += 1\n\nprint(ans, cnt)\n\n", "def main():\n m = cnt = 1\n stack = [1]\n for c in input():\n if c == '(':\n stack.append(1)\n else:\n try:\n x = stack.pop() + stack.pop() + 1\n if m < x:\n m = x\n cnt = 1\n elif m == x:\n cnt += 1\n stack.append(x)\n except IndexError:\n stack = [1]\n m -= 1\n print(m, cnt if m else 1)\n\n\nif __name__ == '__main__':\n main()\n", "# Problem: C. Longest Regular Bracket Sequence\r\n# Contest: Codeforces - Codeforces Beta Round #5\r\n# URL: https://codeforces.com/problemset/problem/5/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/5/C\r\n\r\n输入括号字符串 s，长度不超过 1e6。\r\n\r\n输出 s 的最长合法括号子串的长度和数量。\r\n如果不存在，输出 0 1。\r\n输入 )((())))(()())\r\n输出 6 2\r\n\r\n输入 ))(\r\n输出 0 1\r\n\"\"\"\r\n\"\"\"令f[i]表示以i位置为结尾的最长合法子串。\r\n显然s[i]=='('则f[i] = 0，否则分类讨论\r\n若 s[i-1]=='(' 则只能这俩匹配，f[i] = f[i-2] + 2\r\n若 f[i-1]>0则说明前边挨着一段合法串，i只能和合法串左边的'('匹配；同时，若匹配成功，新串左边挨着合法串，也要加上。\r\n实现时，在s之前增加一个')'避免讨论边界0\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n s, = RS()\r\n n = len(s)\r\n s = ')' + s\r\n ans, cnt = 0, 1\r\n f = [0] * (n + 1)\r\n for i, c in enumerate(s[2:], start=2):\r\n if c == '(':\r\n continue\r\n if s[i - 1] == '(':\r\n f[i] = f[i - 2] + 2\r\n elif f[i - 1] and s[i - f[i - 1] - 1] == '(':\r\n f[i] = f[i - 1] + 2 + f[i - f[i - 1] - 2]\r\n if ans < f[i]:\r\n ans = f[i]\r\n cnt = 1\r\n elif ans == f[i] > 0:\r\n cnt += 1\r\n\r\n \")(())\"\r\n print(ans, cnt)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "\"\"\"\nModule which implements the search of the maximum length of balanced subsequence\nof paranthesis.\n\"\"\"\ndef max_length(array: list):\n \"\"\"\n Return the maximum length of balanced subsequence of paranthesis.\n \"\"\"\n max_length = 0\n num = 1\n stack = [-1]\n for i in range(len(array)):\n if array[i] == \"(\":\n stack.append(i)\n else:\n stack.pop()\n if stack:\n new_result = i - stack[-1]\n if new_result > max_length:\n max_length = new_result\n num = 1\n elif new_result == max_length:\n num += 1\n else:\n stack.append(i)\n return (max_length, num)\n\n\n\nif __name__ == \"__main__\":\n input_str = input()\n array = []\n for elem in input_str:\n array.append(elem)\n results = max_length(array)\n for elem in results:\n print(elem, end=\" \")\n\t\t \t \t \t \t\t \t \t\t", "#5C - longest brackets sequence\r\n\"\"\"\r\nThe number of opening brackets '(' in our sequence that will later have to be\r\nequivalised by closing brackets we start counting after we encounter the first '('\r\nres - the length of the longest substring that maintains the rule, initially 0\r\nb - the number of such substrings\r\ns - stack of brackets that maintain the rule of a regular sequence\r\nNote: we initialize the stack's index to be -1\r\n\r\nInitially, a = 0 and we consider this to be a regular sequence already\r\n\"\"\"\r\n#We take input and immediately process each character introduced by the user\r\n# for i, c in enumerate(input()):\r\nres, b, s = 0, 1, [-1]\r\n#Now we look through the all characters in the input:\r\nfor i, c in enumerate(input()):\r\n #When we find a '(', we push its index into the stack\r\n\tif c == '(': s.append(i)\r\n #Else, if the stack is not empty, we pop an item from the stack\r\n #when finding an ')' paranthesis\r\n\telif len(s) > 1:\r\n #We pop the previous opening bracket's index\r\n\t\ts.pop()\r\n # n calculates the length of the current valid substring\r\n # by substracting the stack's top from the current index\r\n\t\tn = i - s[-1]\r\n #Then we check if this length formed with base of \r\n # current valid substring is more than max so far\r\n #If not, the number of valid substrings is 1\r\n\t\tif res < n: res, b = n, 1\r\n #If yes, then we add that to the number of substrings\r\n\t\telif res == n: b += 1\r\n #If we can't find any regular sequence, the current index of the\r\n #stack is pushed as the base for the next possible valid substring\r\n\telse: s[0] = i\r\n#Finally, we print the length of the longest valid sequence and the number\r\n #of such sequences\r\nprint (' '.join([str(res), str(b)]))\r\n", "s = input()\nbr = []\ncount = 0\nlongest = 0\ncur = 0\n\nbr.append(-1)\n\nfor i in range(len(s)):\n if (s[i] == '('):\n br.append(i)\n elif (s[i] == ')'):\n if len(br) != 0:\n br.pop()\n\n if (len(br) != 0):\n if i-br[-1] > longest:\n longest = i-br[-1]\n count = 1\n elif i-br[-1] == longest:\n count += 1\n else:\n br.append(i)\n\nif (longest == 0):\n count = 1\n\nprint(longest, count, sep=' ')\n", "\r\n\r\ns=input()\r\nl=len(s)\r\nlst=[]\r\narr=[]\r\nfor i in range(l):\r\n if(s[i]==\"(\"):\r\n lst.append(i)\r\n else:\r\n if(len(lst)!=0):\r\n j=lst[-1]\r\n del lst[-1]\r\n m=2\r\n if(len(arr)!=0):\r\n last=arr[-1]\r\n if(last[0]<i and last[0]>j):\r\n m=m+last[-1]\r\n del arr[-1]\r\n if(len(arr)!=0):\r\n last = arr[-1]\r\n if(j-last[1]==1):\r\n m=m+last[-1]\r\n del arr[-1]\r\n arr.append([j,i,m])\r\n\r\n\r\nif(len(arr)==0):\r\n print(0,1)\r\nelse:\r\n\r\n ct=0\r\n mx=-1\r\n for i in arr:\r\n if(i[-1]>mx):\r\n ct=1\r\n mx=i[-1]\r\n elif(i[-1]==mx):\r\n ct+=1\r\n print(mx,ct)\r\n\r\n#\r\n\r\n\r\n", "from collections import deque\r\ne=[None]*1000001\r\ns=[None]*1000001\r\nf=[0]*1000001\r\nst=input()\r\nstack=[]\r\nmax1=0\r\nfor i in range (len(st)):\r\n if(st[i]=='('):\r\n stack.append(i)\r\n else:\r\n if(len(stack)==0):\r\n s[i]=-1\r\n e[i]=-1\r\n else:\r\n idx=stack.pop()\r\n s[i]=idx\r\n e[i]=idx\r\n if(idx>0 and st[idx-1]==')' and s[idx-1]>=0):\r\n e[i]=e[idx-1]\r\n l=i-e[i]+1\r\n f[l]+=1\r\n max1=max(max1,l)\r\nf[0]=1\r\nprint(max1,' ',f[max1])\r\n", "s=input()\r\nn=len(s)\r\nc=[-1 for i in range(n)]\r\ne=[-1 for i in range(n)]\r\nst=[]\r\nmaxi=[0, 1]\r\nfor i in range(len(s)):\r\n if s[i]==\"(\":\r\n st.append(i)\r\n else:\r\n if len(st)==0:\r\n continue\r\n else:\r\n c[i]=e[i]=st.pop()\r\n if(c[i]>0 and c[c[i]-1]!=-1):\r\n e[i]=e[c[i]-1]\r\n l=i-e[i]+1\r\n if l>maxi[0]:\r\n maxi=[l, 1]\r\n elif l==maxi[0]:\r\n maxi[1]+=1\r\nprint(*maxi) ", "s=input()\r\nn=len(s)\r\nl1=[-1]*n\r\nl2=[-1]*n\r\nl3=[0]*(n+1)\r\nl=[]\r\nfor i in range(n):\r\n if s[i]=='(':\r\n l.append(i)\r\n else:\r\n if len(l):\r\n a=l[-1]\r\n l.pop()\r\n l1[i]=i\r\n if a!=0 :\r\n if l2[a-1]!=-1:\r\n l2[i]=l2[a-1]\r\n else:\r\n l2[i]=a\r\n else:\r\n l2[i]=0\r\n l3[l1[i]-l2[i]+1]+=1\r\nans1,ans2=0,1\r\nfor i in range(n,-1,-1):\r\n if l3[i]!=0:\r\n ans1=i\r\n ans2=l3[i]\r\n break\r\nprint(ans1,ans2)\r\n \r\n", "a, b = [], []\n\nfor i, x in enumerate(input()):\n if x == '(':\n b.append(i)\n elif b:\n j = b.pop()\n \n while a and a[-1][0] > j:\n a.pop()\n \n if a and a[-1][1] == j - 1:\n a.append((a.pop()[0], i))\n else:\n a.append((j, i))\n\nm, n = 0, 1\n\nfor x in a:\n l = x[1] - x[0] + 1\n if l > m:\n m, n = l, 1\n elif l == m:\n n += 1\n\nprint(m, n)\n", "inp,kol,max_len,pos=input(),1,0,[-1];\r\nfor i in range(len(inp)): \r\n if(inp[i]=='('):\r\n pos.append(i);\r\n elif(len(pos)>1):\r\n pos.pop();\r\n x=i-pos[-1];\r\n if(max_len<x): max_len,kol=x,1;\r\n elif(max_len==x): kol+=1;\r\n else:\r\n pos[0]=i;\r\nprint(max_len,kol);\r\n#the problem requires you to find the longest real bracket sequence and the number ofsuch other sequences that might exist WITH THE SAME MAXIMUM LENGHT.the lenght of the no of brackes bn any two points is the difference bn the last index and the one before the 1st index.\r\n", "import sys\n\ns = sys.stdin.readline().rstrip()\n\nbalance = 0\nbalanceRecord = {0: -1}\nminBalance = 0\nmaxLen = 0\nmaxCount = 1\n\nfor i in range(len(s)):\n if s[i] == '(':\n balance += 1\n else:\n balance -= 1\n if balance < minBalance:\n minBalance = balance\n balanceRecord = {}\n \n if balance in balanceRecord:\n balanceRecord.pop(balance+1)\n newLen = i - balanceRecord[balance]\n if newLen > maxLen:\n maxLen = newLen\n maxCount = 1\n elif newLen == maxLen:\n maxCount += 1\n else:\n balanceRecord[balance] = i\n\nprint(str(maxLen) + ' ' + str(maxCount))\n", "s = input()\r\n\r\np = []\r\np.append(-1)\r\nlls = 0\r\nocc = 1\r\nfor i in range(len(s)) :\r\n if s[i] == '(' :\r\n p.append(i)\r\n elif len(p) > 1 :\r\n \r\n p.pop()\r\n n = i - p[-1]\r\n if n > lls :\r\n lls = n\r\n occ = 1\r\n elif n == lls :\r\n occ+=1\r\n else :\r\n p[0] = i\r\n\r\nprint(lls, occ)", "# import sys \r\n# # For getting input from input.txt file \r\n# sys.stdin = open('inputf.in', 'r') \r\n# # Printing the Output to output.txt file \r\n# sys.stdout = open('outputf.in', 'w') \r\n\r\n# started at 16:27\r\n\r\nmx, cnt, st = 0,1,[-1]\r\nfor i,w in enumerate(input().strip()):\r\n\tif w=='(': st.append(i)\r\n\telif len(st)>1: \r\n\t\tst.pop()\r\n\t\t_t = i - st[-1]\r\n\t\tif _t>mx: mx,cnt = _t,1\r\n\t\telif _t==mx: cnt+=1\r\n\telse: st[0]=i\r\nprint(mx,cnt)\r\n\r\n\r\n# submitted 17:17\r\n", "input_str = input().strip()\r\nstack = []\r\nmaxlen = 0\r\nsubs_count = 0\r\ncount = 0\r\nopen_bracks = 0\r\nfor i in input_str:\r\n if i=='(':\r\n stack.append('(')\r\n open_bracks += 1\r\n else:\r\n if stack != [] and open_bracks > 0:\r\n open_bracks -= 1\r\n temp = 2\r\n if stack[-1]!= '(':\r\n temp += int(stack.pop())\r\n if stack != [] and stack[-1] == '(':\r\n stack.pop()\r\n if stack!= [] and stack[-1] not in ['(', '\\n']:\r\n stack.append(temp+int(stack.pop()))\r\n else:\r\n stack.append(temp)\r\n else:\r\n stack.append(\"\\n\")\r\n \r\nwhile stack!= []:\r\n val = stack.pop()\r\n if val not in ['(','\\n']:\r\n val = int(val)\r\n if maxlen < val:\r\n maxlen = val\r\n count = 1\r\n elif maxlen == val:\r\n count += 1\r\nif maxlen == 0:\r\n count = 1\r\nprint(maxlen, count)\r\n", "from collections import defaultdict\r\ns = input()\r\nn = len(s)\r\ndp = [0]*n\r\nst = []\r\nfor i in range(n):\r\n if s[i]=='(':\r\n st.append(i)\r\n else:\r\n if len(st)!=0:\r\n he = st.pop()\r\n if he:\r\n dp[i] = dp[he-1]+i-he+1\r\n else:\r\n dp[i] = i+1\r\nans = 0\r\ncnt = 1\r\nfor i in range(n):\r\n if dp[i]==ans:\r\n cnt += 1\r\n elif dp[i]>ans:\r\n ans = dp[i]\r\n cnt = 1\r\nif ans==0:\r\n cnt = 1\r\nprint(ans,cnt)\r\n", "s=input()\r\nst=[]\r\nst.append(-1)\r\nv=[]\r\nnum=0\r\nfor i in range(len(s)):\r\n if(s[i]=='('):\r\n st.append(i)\r\n else:\r\n st.pop()\r\n if(len(st)!=0 and num<=i-st[len(st)-1]):\r\n num=i-st[len(st)-1]\r\n v.append(num)\r\n if(len(st)==0):\r\n st.append(i)\r\ntry:\r\n print(max(v),' ',v.count(max(v)))\r\nexcept:\r\n print(\"0 1\")", "init_brackets = tuple(input())\n \nstack_id = [-1]\nresult = {0: 1}\n# count = 0\n \nfor i, bracket in enumerate(init_brackets):\n if bracket == '(':\n stack_id.append(i)\n else:\n stack_id.pop()\n if stack_id:\n res = i - stack_id[-1]\n result[res] = result.get(res, 0) + 1\n else:\n stack_id.append(i)\n \nmax_res = max(result)\nprint(max_res, result[max_res])\n\t\t\t\t\t\t \t\t\t\t\t\t \t\t \t\t\t \t \t \t", "t = input()\r\na = [0] * (len(t) + 1)\r\nm = n = k = 0\r\nfor i in range(len(t)):\r\n j = t[i]\r\n if j == '(':\r\n k += 1\r\n if k > 0:\r\n a[k] = i\r\n else:\r\n k -= 1\r\n if k < 0:\r\n k = 0\r\n a[k] = i + 1\r\n w = 0\r\n elif k == 0:\r\n w = i - a[k] + 1\r\n else:\r\n w = i - a[k]\r\n if w > m:\r\n m = w\r\n n = 1\r\n elif w == m:\r\n n += 1\r\n # print(a[:10])\r\nif m == 0:\r\n n = 1\r\nprint(m, n)\r\n\r\n\r\n\r\n\r\n", "st = [-1]\r\nMax = Count = 0\r\nfor i, c in enumerate(input()):\r\n\tif c == '(':\r\n\t\tst.append(i)\r\n\telse:\r\n\t\tif len(st) > 1:\r\n\t\t\tst.pop()\r\n\t\t\ttemp = i - st[-1]\r\n\t\t\tif temp > Max:\r\n\t\t\t\tMax = temp\r\n\t\t\t\tCount = 1\r\n\t\t\telif temp == Max:\r\n\t\t\t\tCount += 1\r\n\t\telse:\r\n\t\t\tst[0] = i\r\nif Max:\r\n\tprint(Max, Count)\r\nelse:\r\n\tprint(0, 1)", "a = input()\r\nbrakets = []\r\nq = -1\r\nansmax = 0\r\nquantity = 1\r\nk = 0\r\nfor i in range(len(a)):\r\n if a[i] == '(':\r\n brakets.append(i)\r\n elif brakets != []:\r\n brakets.pop()\r\n if brakets != []:\r\n k = i - brakets[-1]\r\n else:\r\n k = i - q\r\n if k > ansmax:\r\n ansmax = k\r\n quantity = 1\r\n elif k == ansmax:\r\n quantity += 1\r\n else:\r\n q = i\r\nprint()\r\nprint(ansmax, quantity)\r\n", "ch = input()\r\nl1= [-1]\r\nm=0\r\nmc=1\r\n\r\nfor i in range(len(ch)):\r\n if ch[i] == ')':\r\n if len(l1) > 1:\r\n l1.pop()\r\n lng = i - l1[-1]\r\n if lng == m:\r\n mc += 1\r\n elif lng > m:\r\n m = lng\r\n mc = 1\r\n elif len(l1) == 1:\r\n l1[0] = i\r\n else:\r\n l1.append(i)\r\n\r\nprint(m,mc)\r\n", "import collections\r\n\r\nexp = input()\r\nstack = []\r\nn = len(exp)\r\ndp = [0]*n\r\nlength = 0\r\ncnt =0\r\nfor i in range(n):\r\n c = exp[i]\r\n if c =='(':\r\n stack.append(i)\r\n continue\r\n\r\n if not stack:\r\n continue\r\n j = stack.pop()\r\n dp[i]=i-j+1\r\n if j>=1:\r\n dp[i]+=dp[j-1]\r\n if dp[i]>length:\r\n length = dp[i]\r\n cnt = 1\r\n elif dp[i]==length:\r\n cnt+=1\r\nif length ==0:\r\n print(0,1)\r\nelse:\r\n print(length,cnt)\r\n", "from collections import deque, defaultdict\ns = input()\nmp = defaultdict(int)\nstack = deque([-1])\n_max = 0\nfor i,c in enumerate(s):\n if c == '(':\n stack.append(i)\n else:\n last = stack.pop()\n if len(stack) == 0:\n stack.append(i)\n else:\n curr = i - stack[-1]\n if curr > _max:\n _max = curr\n\n mp[curr] += 1\n\nif _max == 0:\n print(0, 1)\nelse:\n print(_max, mp[_max])\n\n\n\n\n\n\n\n", "import sys\n\nfrom collections import defaultdict\nfrom time import time\nfrom typing import Tuple\n\nOPEN, CLOSE = '(', ')'\n\n\ndef magic(data: Tuple):\n open_index, open_num, step = 0, 0, 0\n chars_count = len(data) - 1\n open_indexes = []\n x = []\n while step <= chars_count:\n char = data[step]\n if char == OPEN:\n open_indexes.append(step)\n open_num += 1\n elif char == CLOSE and open_num > 0:\n open_num -= 1\n open_index = open_indexes.pop()\n yield open_index\n yield step\n step += 1\n return data\n\n\ndef solve(string):\n group, prev = 0, 0\n maxgroup, maxgroupcount = 0, 0\n for index in sorted(magic(tuple(string.strip()))):\n sub = index - prev\n if sub == 1 or sub == index:\n group += 1\n elif group > 0:\n if maxgroup == group: maxgroupcount += 1\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n group = 1\n prev = index\n\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n elif maxgroup == group:\n maxgroupcount += 1\n\n return \"%s %s\" % (maxgroup, maxgroupcount)\n\n\n# assert solve(\")((())))(()())\") == \"6 2\"\n# assert solve(\"))(\") == \"0 1\"\n# assert solve(\"()(())()\") == \"8 1\"\n# assert solve(\"((((()(((\") == \"2 1\"\n# assert solve(\"))))()())))\") == \"4 1\"\n# assert solve(\"(()())()(())()()())())()((()(()(())()()())((()(())()(()()()()))()(())()(((()())()(()((())()(())(()))\") == \"28 1\"\n# assert solve(\")(()(((((())))))(((()))))))((()(((((((())())()))))((((((((())))((((((())))))(()((((()))))(()))))))))\") == \"68 1\"\n# start_time = time()\n\nprint(solve(sys.stdin.readline()))\n\n# complex_input = \"(()(())))()()((()(())()(()()((())))()))())((()(()(()))(()((())(())))))(()(((())(()(((()(())())))(()))()))(()()()()((((()(()()((()(()((()))())((((()()(()))())))))((())())()))(((()))()()()()()(()()(((()()))()(())))(((()))(())())(())()()(())))()()()))(()(())())))(())()))()))()()()))))))()))))()())()((()(((()(()())()()()())((((((())()))(())((()()())((())))(()()()))))(())))()()(()(())((((()()()()))))())((()()()())))((()))))()()()(()((((((()))())))((())((((()()))(())())())())()(((()()()(())(((())))())()()(((())\"\n# complex_input = complex_input * 10000\n# print(solve(complex_input))\n\n# print(time() - start_time)\n", "string = input()\n\nclose_ = open_= max_len = 0\n\ncounter = 1\n\ndp = [True] * len(string)\n\n\nfor idx in range(len(string)):\n\tif string[idx] == \"(\":\n\t\topen_ += 1\n\telse:\n\t\tclose_ += 1\n\tif open_ == close_:\n\t\tlen_ = 2 * open_\n\t\tif len_ > max_len:\n\t\t\tmax_len, dp[idx - len_ + 1], counter = len_, False, 1\n\t\telif len_ == max_len:\n\t\t\tdp[idx - len_ + 1] = False\n\t\t\tcounter += 1\t\t\n\telif close_ > open_:\n\t\tclose_ = open_ = 0\n\n\nclose_ = open_= 0\n\n\nfor idx in range(len(string))[::-1]:\n\tif string[idx] == \"(\":\n\t\topen_ += 1\n\telse:\n\t\tclose_ += 1\n\tif open_ == close_:\n\t\tlen_ = 2 * open_\n\t\tif len_ > max_len:\n\t\t\tmax_len, counter = len_, 1\n\t\telif len_ == max_len:\n\t\t\tif dp[idx]:\n\t\t\t\tcounter += 1\n\telif open_ > close_:\n\t\tclose_ = open_= 0\nprint(max_len, counter)", "s = input()\r\nn = len(s)\r\ndem1_max = 0\r\ndem2_max = 1\r\nA = [-1]\r\nfor i in range(n):\r\n if s[i] == \"(\":\r\n A.append(i) \r\n elif len(A) > 1: \r\n x = A.pop()\r\n u = i - A[-1]\r\n if u == dem1_max:\r\n dem2_max += 1\r\n elif u >= dem1_max:\r\n dem1_max = u\r\n dem2_max = 1 \r\n else:\r\n A[0] = i\r\nprint(\"{} {}\".format(dem1_max,dem2_max))", "ins, maxlen, count, stack=input(), 0, 1, [-1]\r\nfor i,c in enumerate(ins):\r\n if c=='(': \r\n stack.append(i)\r\n elif len(stack)>1:\r\n stack.pop()\r\n x=i-stack[-1]\r\n if maxlen<x:\r\n maxlen, count = x, 1\r\n elif maxlen==x: \r\n count+=1\r\n else:\r\n stack[0]=i\r\nprint(maxlen,count)", "seq = input()\r\n\r\nRegular = [0 for _ in range(len(seq))]\r\n\r\nstack = []\r\nfor index in range(len(seq)):\r\n if seq[index] == '(':\r\n stack.append(index)\r\n continue\r\n \r\n if stack == []:\r\n continue\r\n left_index = stack[-1]\r\n stack.pop()\r\n \r\n Regular[index] = max(Regular[index], Regular[left_index - 1] + (index - left_index + 1))\r\n\r\nmax_len = max(Regular)\r\nmax_num = Regular.count(max_len)\r\nif max_len == 0:\r\n print(0, 1)\r\nelse:\r\n print(max_len, max_num)", "s = input()\nn = len(s)\ndp = []\nstack = []\nans = []\nfor i in range(n):\n\tif s[i]==\"(\":\n\t\tdp.append(i)\n\t\tstack.append(i)\n\t\tans.append(i)\n\telse:\n\t\tif not stack:\n\t\t\tdp.append(-1)\n\t\t\tans.append(-1)\n\t\t\tcontinue\n\t\tdp.append(stack[-1])\n\t\tif dp[-1]-1>=0 and s[dp[-1]-1]==\")\" and ans[dp[-1]-1]!=-1:\n\t\t\tans.append(ans[dp[-1]-1])\n\t\telse:\n\t\t\tans.append(dp[-1])\n\t\tstack.pop()\n\n\t# print (dp,ans)\n\n# print (*ans)\nmaxx = 0\ncount = 1\nfor i in range(len(ans)):\n\tif i==ans[i]:\n\t\tcontinue\n\tdiff = i-ans[i]+1\n\tif ans[i]!=-1 and diff>maxx:\n\t\tmaxx = diff\n\t\tcount = 1\n\telif ans[i]!=-1 and diff==maxx:\n\t\tcount += 1\n# print (*dp)\nprint (maxx,count)", "from collections import *\r\ns=input()\r\nscore=0\r\nstack=[]\r\nal=defaultdict(int)\r\nval=0\r\ntemp=[]\r\nsaver=defaultdict(list)\r\nsaver[0].append(0)\r\nfor i in range(len(s)):\r\n if(s[i]==')'):\r\n if(score==0):\r\n stack=[]\r\n val=0\r\n saver=defaultdict(list)\r\n saver[0].append(i+1)\r\n else:\r\n stack.pop()\r\n score-=1\r\n al[i-(saver[score][-1])+1]+=1\r\n \r\n else:\r\n stack.append('(')\r\n score+=1\r\n \r\n saver[score].append(i+1)\r\n temp.append(val)\r\n \r\nif(len(al)):\r\n print(max(al),al[max(al)])\r\nelse:\r\n print(0,1)\r\n", "from collections import deque\nimport heapq \n\n\ndef main():\n m,b,s = 0,1,[-1]\n temp = input()\n for i,c in enumerate(temp):\n if c ==\"(\":s.append(i)\n elif len(s)>1:\n s.pop()\n n = i-s[-1]\n if n > m: m,b = n,1\n elif m == n: b+=1\n else:s[0]= i\n \n print(\" \".join([str(m),str(b)]))\n\nif __name__ == \"__main__\":\n main()", "s=input()\r\na=[-1]*len(s)\r\nl=[0]*len(s)\r\nq=[]\r\nfor i in range(len(s)):\r\n if s[i]=='(':q.append(i)\r\n elif q:\r\n x=q.pop()\r\n a[i]=x\r\n l[i]+=i-x+1\r\n if x>0:l[i]+=l[x-1]\r\nm,c=0,1\r\nfor i in range(len(s)):\r\n if l[i]>m:m,c=l[i],1\r\n elif l[i]==m:c+=1\r\nif m==0:c=1\r\nprint('%i %i' %(m,c))", "n, m, length = 0, 0, 0\ns = input()\nd = [-1] * 1000006\nstack = []\n\nmax_length = 0\ncount = 1\n\nfor i in range(len(s)):\n if not stack or s[i] == '(':\n stack.append(i)\n continue\n\n pos = stack[-1]\n\n if s[pos] == '(':\n if d[pos - 1] != -1:\n d[i] = d[pos - 1]\n else:\n d[i] = pos\n\n length = i - d[i] + 1\n if length == max_length:\n count += 1\n elif length > max_length:\n max_length = length\n count = 1\n\n stack.pop()\n\nprint(max_length, count)\n\n \t \t \t \t \t \t\t\t \t\t \t", "st =[-1]\r\nMax=Count=0\r\nfor i, c in enumerate(input()):\r\n\tif c =='(':\r\n\t\tst.append(i)\r\n\telse:\r\n\t\tif len(st)>1:\r\n\t\t\tst.pop()\r\n\t\t\ttemp = i - st[-1]\r\n\t\t\tif temp >Max:\r\n\t\t\t\tMax= temp\r\n\t\t\t\tCount=1\r\n\t\t\telif temp ==Max:\r\n\t\t\t\tCount+=1\r\n\t\telse:\r\n\t\t\tst[0]= i\r\nif Max:\r\n\tprint(Max,Count)\r\nelse:\r\n\tprint(0,1)\r\n", "#****************************************\r\n\r\n#** Solution by BAZOOKA **\r\n\r\n#** Sponsored by RED BULL**\r\n\r\n#** Team Galaxy **\r\n\r\n#** I love ❤Kateryna Gret❤ **\r\n\r\n#****************************************/\r\nn=input()\r\ns,a,b,c=[],0,-1,1\r\nfor i in range(len(n)):\r\n if n[i]=='(':s.append(i)\r\n elif s:\r\n s.pop()\r\n t=i-s[-1] if s else i-b\r\n if t>a:a,c=t,1\r\n elif t==a:c+=1\r\n else:b=i\r\n\r\nprint(a,c)\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#****************************************/ ", "from collections import defaultdict\n\nS = input()\n\nlevel_to_start = defaultdict(lambda: None)\nlevel = 0\nans_len, ans_count = 0, 1\n\nfor i, char in enumerate(S):\n if char == \"(\":\n if level_to_start[level] == None: level_to_start[level] = i\n level += 1\n else:\n level -= 1\n level_to_start[level+1] = None\n\n if (start := level_to_start[level]) != None:\n length = i - start + 1\n\n if length > ans_len:\n ans_len = length\n ans_count = 1\n elif length == ans_len:\n ans_count += 1\n\nprint(ans_len, ans_count)", "def magic(value=None):\n pairs = {}\n maximum, count = 0, 0\n num_of_opened, indices_of_opened = 0, []\n for i, char in enumerate(value or input()):\n if char == '(':\n indices_of_opened.append(i)\n elif indices_of_opened:\n o = indices_of_opened.pop()\n if o - 1 in pairs:\n start_of_previous = pairs[o - 1][0]\n pairs[i] = (start_of_previous, i)\n item_size = i - start_of_previous + 1\n else:\n item_size = i - o + 1\n pairs[i] = (o, i)\n if item_size > maximum:\n maximum = item_size\n count = 1\n elif item_size == maximum:\n count += 1\n if not maximum:\n return \"0 1\"\n return \"%s %s\" % (maximum, count)\n\n\n# assert magic(\")((())))(()())\") == \"6 2\"\n# assert magic(\"))(\") == \"0 1\"\n# assert magic(\"()(())()\") == \"8 1\"\n# assert magic(\"((((()(((\") == \"2 1\"\n# assert magic(\"))))()())))\") == \"4 1\"\n# assert magic(\"(()())()(())()()())())()((()(()(())()()())((()(())()(()()()()))()(())()(((()())()(()((())()(())(()))\") == \"28 1\"\n# assert magic(\")(()(((((())))))(((()))))))((()(((((((())())()))))((((((((())))((((((())))))(()((((()))))(()))))))))\") == \"68 1\"\n\nprint(magic())", "# @author: guoyc\n# @date: 2018/7/20\n\ns = input()\n\nN = len(s)\n\n# dp = [0] * (N + 1)\n#\n# ml = 0\n# cnt = 1\n#\n# for i in range(1, N):\n# if s[i] == '(':\n# continue\n# if s[i - 1] == '(':\n# dp[i] = 2 + dp[i - 2]\n# elif (i - 1) - dp[i - 1] >= 0:\n# if s[(i - 1) - dp[i - 1]] == '(':\n# dp[i] = dp[i - 1] + 2 + dp[(i - 1) - dp[i - 1] - 1]\n# if dp[i] > ml:\n# ml = dp[i]\n# cnt = 1\n# elif dp[i] == ml:\n# cnt += 1\n#\n# if ml == 0:\n# print(0, 1)\n# else:\n# print(ml, cnt)\n\nst = [-1]\n\nml, cnt = 0, 1\n\nfor i, c in enumerate(s):\n if c == '(':\n st.append(i)\n else:\n if len(st) > 1:\n st.pop(-1)\n ll = i - st[-1]\n if ll > ml:\n ml, cnt = ll, 1\n elif ll == ml:\n cnt += 1\n else:\n st[0] = i\n\nprint(ml, cnt)\n", "#code by aanchaltiwari\r\n#practice\r\ns=input()\r\nn=len(s)\r\nvalid=[-1]*n\r\nfreq=[0]*(n+1)\r\nstack=[]\r\nextension=[-1]*n\r\nfor i in range(n):\r\n if s[i]==\"(\":\r\n stack.append(i)\r\n else:\r\n if stack:\r\n index=stack.pop()\r\n valid[i]=index\r\n extension[i]=index\r\n if index-1>0 and s[index-1]==\")\" and valid[index-1]>=0:\r\n extension[i]=extension[index-1]\r\n length=i-extension[i]+1\r\n freq[length]+=1\r\nf=0\r\nfor i in range(n,0,-1):\r\n if freq[i]:\r\n print(i,freq[i])\r\n f=1\r\n break\r\nif f==0:\r\n print(0,1)", "s = input()\r\nres1, res2 = 0, 1\r\nfrom collections import defaultdict \r\nhm = defaultdict(lambda:-2)\r\nhm[0] = -1\r\ncur = 0\r\nfor i in range(len(s)):\r\n if s[i] == ')':\r\n cur -= 1\r\n else:\r\n cur += 1\r\n if hm[cur + 1] != -2:\r\n hm[cur + 1] = -2\r\n if hm[cur] != -2:\r\n tmp = i - hm[cur]\r\n if tmp > res1:\r\n res1 = tmp\r\n res2 = 1\r\n elif tmp == res1:\r\n res2 += 1\r\n else:\r\n hm[cur] = i \r\nprint(res1, res2)", "s = [-1]\r\nl = 0\r\nrep = 0\r\n\r\nfor i, c in enumerate(input()):\r\n if c == '(':\r\n s.append(i)\r\n else:\r\n if len(s) > 1:\r\n s.pop()\r\n temp = i - s[-1]\r\n if temp > l:\r\n l = temp\r\n rep = 1\r\n elif temp == l:\r\n rep += 1\r\n else:\r\n s[0] = i\r\nif l:\r\n print (l, rep)\r\nelse :\r\n print (0, 1)\r\n", "line = input()\n \nall_pair = []\nstack = []\nfor (i, ch) in enumerate(line):\n if ch == '(':\n stack.append(i)\n else:\n if len(stack):\n left = stack.pop()\n all_pair.append((left, i))\n \nall_pair.sort()\n \nleft = -2\nright = -2\nres = [0, 1]\nfor pair in all_pair:\n if pair[0]==right+1:\n right = pair[1]\n elif right+1 < pair[0]:\n left, right = pair\n else:\n continue\n \n length = right-left+1\n if length > res[0]:\n res = [length, 1]\n elif length == res[0]:\n res[1] += 1\n \nprint(res[0], res[1])\n\n\t\t\t \t\t \t\t\t \t\t \t\t \t \t\t\t\t", "\"\"\"\n \n _nnnn_ \n dGGGGMMb ,''''''''''''''''''''''.\n @p~qp~~qMb | Promoting GNU/Linux |\n M|@||@) M| _;......................'\n @,----.JM| -'\n JS^\\__/ qKL\n dZP qKRb\n dZP qKKb\n fZP SMMb\n HZM MMMM\n FqM MMMM\n __| \". |\\dS\"qML\n | `. | `' \\Zq\n_) \\.___.,| .'\n\\____ )MMMMMM| .'\n `-' `--' hjm\n \n\"\"\"\n\ninp = input()\n\nmaxlen, occur, stack = 0, 1, [-1]\n\nfor i, val in enumerate(inp):\n if val == '(': stack.append(i)\n elif len(stack) > 1:\n stack.pop()\n consq = i - stack[-1]\n if maxlen < consq: maxlen, occur = consq, 1\n elif maxlen == consq:\n occur += 1\n else:\n stack[0] = i\n\nprint(maxlen, occur)\n", "s=input()\r\nst=[-1]\r\nn=1\r\nmax_res=0\r\nfor i in range(len(s)):\r\n if s[i]=='(':\r\n st.append(i)\r\n else:\r\n st.pop()\r\n if len(st)>0:\r\n res=i-st[-1]\r\n if res>max_res:\r\n max_res=res\r\n n=1\r\n elif res==max_res:\r\n n+=1\r\n else:\r\n st.append(i)\r\nprint(max_res,n)\r\n ", "def ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef msi(): return map(str,input().split())\r\ndef li(): return list(mi())\r\n\r\ns=si()\r\ndp=[0]*(len(s)+1)\r\nocnt=0\r\n\r\nfor i in range(len(s)):\r\n if s[i]=='(':\r\n ocnt+=1\r\n \r\n else:\r\n if ocnt>0:\r\n ocnt-=1\r\n \r\n if s[i-1]==')':\r\n dp[i]=dp[i-1]+2\r\n \r\n else:\r\n if i>1:\r\n if s[i-2]==')':\r\n dp[i]=2+dp[i-2]\r\n \r\n else:\r\n dp[i]=2\r\n \r\n else:\r\n dp[i]=2\r\n \r\n dp[i]=dp[i]+dp[i-dp[i]]\r\n \r\nif max(dp)==0:\r\n print(0,1)\r\n \r\nelse:\r\n print(max(dp),dp.count(max(dp)))\r\n \r\n \r\n ", "from collections import Counter as cr\r\nst=input()\r\ns=[]\r\nans=[0,0]\r\nfor i in st:\r\n if i=='(':\r\n ans.append(0)\r\n s.append(i)\r\n else:\r\n if len(s)!=0:\r\n x=ans.pop()\r\n ans.append(x+2)\r\n s.pop()\r\n x=ans.pop()\r\n y=ans.pop()\r\n ans.append(x+y)\r\n else:\r\n ans.append(0)\r\nm=cr(ans)\r\nc=max(ans)\r\nif c==0:\r\n print(\"0 1\")\r\nelse:\r\n print(c,m[c])\r\n# (()())()(())()()())())()((()(()(())()()())((()(())()(()()()()))()(())()(((()())()(()((())()(())(()))\r\n", "import sys\nfrom time import time\n\nfrom typing import Tuple\n\nOPEN, CLOSE = '(', ')'\n\n\ndef magic(data: Tuple):\n num_of_opened, i = 0, 0\n num_of_chars = len(data) - 1\n indices_of_opened = []\n while i <= num_of_chars:\n char = data[i]\n if char == OPEN:\n indices_of_opened.append(i)\n num_of_opened += 1\n elif num_of_opened > 0 and char == CLOSE:\n num_of_opened -= 1\n yield indices_of_opened.pop()\n yield i\n i += 1\n\ndef solve(string):\n group, prev = 0, 0\n maxgroup, maxgroupcount = 0, 0\n for index in sorted(magic(tuple(string.strip()))):\n sub = index - prev\n if sub == 1 or sub == index:\n group += 1\n elif group > 0:\n if maxgroup == group: maxgroupcount += 1\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n group = 1\n prev = index\n\n if maxgroup < group:\n maxgroup = group\n maxgroupcount = 1\n elif maxgroup == group:\n maxgroupcount += 1\n\n return \"%s %s\" % (maxgroup, maxgroupcount)\n\n\n# assert solve(\")((())))(()())\") == \"6 2\"\n# assert solve(\"))(\") == \"0 1\"\n# assert solve(\"()(())()\") == \"8 1\"\n# assert solve(\"((((()(((\") == \"2 1\"\n# assert solve(\"))))()())))\") == \"4 1\"\n# assert solve(\"(()())()(())()()())())()((()(()(())()()())((()(())()(()()()()))()(())()(((()())()(()((())()(())(()))\") == \"28 1\"\n# assert solve(\")(()(((((())))))(((()))))))((()(((((((())())()))))((((((((())))((((((())))))(()((((()))))(()))))))))\") == \"68 1\"\n# start_time = time()\n\nprint(solve(sys.stdin.readline()))\n\n# complex_input = \"(()(())))()()((()(())()(()()((())))()))())((()(()(()))(()((())(())))))(()(((())(()(((()(())())))(()))()))(()()()()((((()(()()((()(()((()))())((((()()(()))())))))((())())()))(((()))()()()()()(()()(((()()))()(())))(((()))(())())(())()()(())))()()()))(()(())())))(())()))()))()()()))))))()))))()())()((()(((()(()())()()()())((((((())()))(())((()()())((())))(()()()))))(())))()()(()(())((((()()()()))))())((()()()())))((()))))()()()(()((((((()))())))((())((((()()))(())())())())()(((()()()(())(((())))())()()(((())\"\n# complex_input = complex_input * 10000\n# print(solve(complex_input))\n\n# print(time() - start_time)\n", "import sys\r\n\r\nOPEN, CLOSE = '(', ')'\r\n\r\n\r\ndef magic(data):\r\n num_of_opened, i = 0, 0\r\n num_of_chars = len(data)\r\n indices_of_opened = []\r\n while i < num_of_chars:\r\n char = data[i]\r\n if char == OPEN:\r\n indices_of_opened.append(i)\r\n num_of_opened += 1\r\n elif num_of_opened > 0 and char == CLOSE:\r\n num_of_opened -= 1\r\n yield indices_of_opened.pop()\r\n yield i\r\n i += 1\r\n\r\n\r\ndef solve(string):\r\n group, prev = 0, 0\r\n maxgroup, maxgroupcount = 0, 0\r\n for index in sorted(magic(tuple(string))):\r\n sub = index - prev\r\n if sub == 1 or sub == index:\r\n group += 1\r\n elif group > 0:\r\n if maxgroup == group: maxgroupcount += 1\r\n if maxgroup < group:\r\n maxgroup = group\r\n maxgroupcount = 1\r\n group = 1\r\n prev = index\r\n\r\n if maxgroup < group:\r\n maxgroup = group\r\n maxgroupcount = 1\r\n elif maxgroup == group:\r\n maxgroupcount += 1\r\n\r\n return \"%s %s\" % (maxgroup, maxgroupcount)\r\n\r\n\r\nprint(solve(sys.stdin.readline()))", "brackets = tuple(input())\n\nstack = [-1]\nresult = {0: 1}\ncount = 0\n\nfor i, bracket in enumerate(brackets):\n if bracket == '(':\n stack.append(i)\n else:\n stack.pop()\n if stack:\n res = i - stack[-1]\n result[res] = result.get(res, 0) + 1\n else:\n stack.append(i)\n\nmax_res = max(result)\nprint(max_res, result[max_res])\n \t\t\t \t \t \t\t \t\t\t\t \t\t \t \t \t \t", "from sys import stdin\n\nlines, line_index = stdin.readlines(), -1\n\n\ndef get_line():\n global lines, line_index\n\n line_index += 1\n return lines[line_index]\n\ndef main():\n data = get_line().strip()\n\n max_c = -1\n stack = [-1]\n counter = 0\n\n for i, c in enumerate(data):\n if c == '(':\n stack.append(i)\n else:\n stack.pop()\n\n if stack:\n temp_max = max(max_c, i - stack[-1])\n if i - stack[-1] == max_c:\n counter += 1\n elif temp_max > max_c:\n counter = 1\n max_c = temp_max\n else:\n stack.append(i)\n\n if max_c != -1:\n print('%s %s' % (max_c, counter))\n else:\n print('%s %s' % (0, 1))\n\nmain()", "def solve(s):\r\n\tl=[]\r\n\tlength=ref=0\r\n\tcount=1\r\n\tpos=-1\r\n\tfor i in range(len(s)):\r\n\t\tif s[i]==\"(\":\r\n\t\t\tl.append(i)\r\n\t\telif l:\r\n\t\t\tl.pop()\r\n\t\t\tref=i-l[-1] if l else i-pos\r\n\t\t\tif ref>length:\r\n\t\t\t\tlength=ref\r\n\t\t\t\tcount=1\r\n\t\t\telif ref==length:\r\n\t\t\t\tcount+=1\r\n\t\telse:\r\n\t\t\tpos=i\r\n\tprint(length,count)\r\n\t\t\t\r\ns=input()\r\nsolve(s)", "\ns=input()\nst1=[-1]\nn=1\nmax_res=0\nfor i in range(len(s)):\n if s[i]=='(':\n st1.append(i)\n else:\n st1.pop()\n if len(st1)>0:\n res=i-st1[-1]\n if res>max_res:\n max_res=res\n n=1\n elif res==max_res:\n n+=1\n else:\n st1.append(i)\nprint(max_res,n)\n \t\t \t\t\t \t \t\t \t \t\t\t", "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 st = insr()\r\n n = len(st)\r\n stack = []\r\n dp = [0] * n\r\n length, cnt = 0, 0\r\n\r\n for i in range(n):\r\n if st[i] == '(':\r\n stack.append(i)\r\n elif stack:\r\n j = stack.pop()\r\n dp[i] = i - j + 1 + dp[j - 1] if j > 0 else i + 1\r\n\r\n if dp[i] > length:\r\n length = dp[i]\r\n cnt = 1\r\n elif dp[i] == length:\r\n cnt += 1\r\n\r\n if length == 0:\r\n print(\"0 1\")\r\n else:\r\n print(length, cnt)\r\n \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", "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 a=rs()\r\n n=len(a)\r\n dp=[[-1,-1] for i in range(n)]\r\n if a[0]=='(':dp[0][0]=1 \r\n for i in range(1,n):\r\n if a[i-1]=='(': \r\n if a[i]=='(':\r\n dp[i][0]=1\r\n dp[i][1]=-1\r\n else:\r\n dp[i][0]=-1\r\n dp[i][1]=dp[i-1][0]+1 if dp[i-1][0]!=-1 else -1\r\n if a[i-1]==')':\r\n if a[i]=='(':\r\n dp[i][0]=dp[i-1][1]+1 if dp[i-1][1]!=-1 else 1\r\n dp[i][1]=-1\r\n else:\r\n dp[i][0]=-1\r\n if i-1-dp[i-1][1]>-1 and a[i-1-dp[i-1][1]]=='(': dp[i][1]=dp[i-1][1]+dp[i-1-dp[i-1][1]][0]+1\r\n else: dp[i][1]=-1\r\n mx=0\r\n cnt=0\r\n for i in range(n): mx=max(dp[i][1],mx)\r\n for i in range(n): \r\n if dp[i][1]==mx: cnt+=1\r\n if mx>0: print(mx,cnt)\r\n else:print(0,1)\r\n\r\nmain()", "s=input()\r\nn=len(s)\r\narr=[None for x in range(n)]\r\nstack=[]\r\ncountarr=[0 for x in range(n+1)]\r\n\r\nfor i in range(n):\r\n if s[i]==\"(\":\r\n stack.append(i)\r\n else:\r\n if stack:\r\n arr[i]=stack.pop()\r\nmaxlen=0;count=1\r\nfor i in range(n):\r\n if arr[i]!=None and arr[i]!=0:\r\n preindex=arr[i]-1\r\n\r\n if arr[preindex]!=None:\r\n arr[i]=arr[preindex]\r\n\r\nfor i in range(n):\r\n if arr[i]!=None:\r\n countarr[i-arr[i]+1]+=1\r\nfor i in range(n+1):\r\n if countarr[i]!=0:\r\n count=countarr[i]\r\n maxlen=i\r\n\r\nprint(maxlen,count)\r\n\r\n\r\n" ]

{"inputs": [")((())))(()())", "))(", "()(())()", "((((()(((", "))))()())))", "(()())()(())()()())())()((()(()(())()()())((()(())()(()()()()))()(())()(((()())()(()((())()(())(()))", ")(()(((((())))))(((()))))))((()(((((((())())()))))((((((((())))((((((())))))(()((((()))))(()))))))))", "())(((((())())((((()))(())))())())(((()(()()()())(())()))((()(())())()()))()(()())))))(()))((())((((", "))(((((((()((((())(((((((((()()))))(()())()((())())))((((()))(()()()))))(()()))())))))((())())()))(("], "outputs": ["6 2", "0 1", "8 1", "2 1", "4 1", "28 1", "68 1", "80 1", "92 1"]}

UNKNOWN

PYTHON3

CODEFORCES

149

8e4c196a1d858d4cb674277d1f33267d

Bit++

The classic programming language of Bitland is Bit++. This language is so peculiar and complicated. The language is that peculiar as it has exactly one variable, called *x*. Also, there are two operations: - Operation ++ increases the value of variable *x* by 1. - Operation -- decreases the value of variable *x* by 1. A statement in language Bit++ is a sequence, consisting of exactly one operation and one variable *x*. The statement is written without spaces, that is, it can only contain characters "+", "-", "X". Executing a statement means applying the operation it contains. A programme in Bit++ is a sequence of statements, each of them needs to be executed. Executing a programme means executing all the statements it contains. You're given a programme in language Bit++. The initial value of *x* is 0. Execute the programme and find its final value (the value of the variable when this programme is executed). The first line contains a single integer *n* (1<=≤<=*n*<=≤<=150) — the number of statements in the programme. Next *n* lines contain a statement each. Each statement contains exactly one operation (++ or --) and exactly one variable *x* (denoted as letter «X»). Thus, there are no empty statements. The operation and the variable can be written in any order. Print a single integer — the final value of *x*. Sample Input 1 ++X 2 X++ --X Sample Output 1 0

[ "x = int(input())\r\nresultaat = 0\r\nfor y in range(0,x,1):\r\n z = input()\r\n if z == \"++X\" or z == \"X++\":\r\n resultaat += 1\r\n if z == \"--X\" or z == \"X--\":\r\n resultaat -= 1\r\nprint(resultaat)", "#n is number of statement in the program\r\nx=0\r\nn=int(input())\r\nfor i in range(n):\r\n stmt=input().lower()\r\n if stmt=='++x' or stmt=='x++':\r\n x+=1\r\n elif stmt=='--x' or stmt=='x--':\r\n x+=-1\r\nprint(x) ", "n = int(input())\r\nx = 0\r\n\r\nfor i in range(n):\r\n command = input()\r\n if \"++\" in command:\r\n x+=1\r\n else:\r\n x-=1\r\n\r\nprint(x)", "n = int(input())\r\nx = 0\r\nfor j in range(n):\r\n st = input()\r\n if st[1] == \"+\":\r\n x = x+1\r\n else:\r\n x= x-1\r\n \r\nprint(x) \r\n ", "count=0\r\nn=int(input())\r\nfor i in range(n):\r\n m=input()\r\n if(m==\"X++\"):\r\n count+=1 \r\n elif(m==\"X--\"):\r\n count-=1\r\n elif(m==\"++X\"):\r\n count+=1 \r\n elif(m==\"--X\"):\r\n count-=1\r\n\r\nprint(count)", "n=int(input())\r\nsum=0\r\nfor _ in range(n):\r\n \r\n str=input()\r\n if(str==\"++X\") or (str==\"X++\"):\r\n sum+=1\r\n else:\r\n sum-=1\r\nprint(sum)", "x=0\r\nfor i in range(int(input())):\r\n\tif '+' in input():\r\n\t\tx+=1\r\n\telse:\r\n\t\tx-=1\r\nprint(x)\r\n", "n=int(input())\r\nx=0\r\nfor i in range(0,n):\r\n j=input()\r\n if(j==\"X++\" or j==\"++X\"):\r\n x=x+1\r\n elif(j==\"X--\"or j==\"--X\"):\r\n x=x-1\r\nprint(x) ", "s=0\r\nfor i in range(int(input())):\r\n x=input()\r\n if '+' in x:\r\n s+=1\r\n elif '-' in x:\r\n s-=1\r\nprint(s)", "n = int(input())\ni = 0\nx=0\nwhile(i<n):\n s = input()\n if(s[1]=='+'):\n x=x+1\n else:\n x=x-1\n i=i+1\nprint(x)", "t,sum = int(input()),0\r\nfor i in range(t):\r\n s = input()\r\n if s[1]=='+':\r\n sum=sum+1\r\n elif s[1]=='-':\r\n sum=sum-1\r\nprint(sum)", "print(sum(1 if '++' in input() else -1 for i in range(int(input()))))\r\n\r\n ", "\nn = int(input())\n\nx = 0\n\nfor i in range(n):\n \n s = input()\n if s[-1] == '+' or s[0] == '+':\n x+=1\n else:\n x-=1\n \nprint(x)\n\t \t \t\t\t\t \t\t\t\t \t \t \t\t\t\t \t", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n gg=input()\r\n if gg=='++X'or gg=='X++':\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "a = int(input())\r\n\r\n\r\ndef cal():\r\n global a\r\n x = 0\r\n for i in range(a):\r\n req = input()\r\n if \"++\" in req:\r\n x += 1\r\n else:\r\n x -= 1\r\n return x\r\n\r\n\r\nif 1 <= a <= 150:\r\n print(cal())\r\n", "number = int(input())\r\ncount = 0\r\nfor n in range(number):\r\n string = str(input())\r\n if (string[0] == \"+\" or string[len(string)-1] == \"+\"):\r\n count += 1\r\n if (string[0] == \"-\" or string[len(string)-1] == \"-\"):\r\n count -= 1\r\nprint(count)\r\n", "import sys\r\n\r\nn = int(sys.stdin.readline().split()[0])\r\n\r\nX = 0\r\nfor i in range(n):\r\n command = sys.stdin.readline().split()[0]\r\n if command[1] == \"+\": X+=1\r\n elif command[1] == \"-\": X-=1\r\n\r\nprint(X)", "n = int(input())\n\ncount = 0\n\nfor i in range(n):\n string = input()\n\n if string == \"X++\" or string == \"++X\":\n count += 1\n elif string == \"X--\" or string == \"--X\":\n count -= 1\n\nprint(count)", "x = 0 \r\n\r\ny = int(input())\r\n\r\nfor i in range(y):\r\n \r\n a= input()\r\n \r\n if (a == '++X' or a == 'X++'):\r\n x += 1\r\n elif (a == '--X' or a == 'X--'):\r\n x -= 1 \r\nprint(x)", "x=0\r\nfor i in range(int(input())):\r\n b=input()\r\n if '+' in b:\r\n x+=1\r\n elif '-' in b:\r\n x-=1\r\nprint(x)", "def execute_programme(n, l):\r\n x = 0\r\n \r\n for statement in l:\r\n if \"++\" in statement:\r\n x += 1\r\n else:\r\n x -= 1\r\n \r\n return x\r\n\r\nn = int(input())\r\nl = [input() for _ in range(n)]\r\nresult = execute_programme(n, l)\r\nprint(result)\r\n", "x=0\r\nn=int(input())\r\nfor _ in range(n):\r\n statement =input()\r\n if \"++\" in statement:\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)", "n=int(input(\"\"))\r\nX=0\r\nfor i in range(n):\r\n bit=input(\"\")\r\n if bit[0] ==\"+\" or bit[-1]==\"+\":\r\n X+=1\r\n else:\r\n X-=1\r\nprint(X)", "x=0\nn=input()\nn=int(n)\nfor i in range(n):\n vini=input()\n if vini==(\"++X\")or vini==(\"X++\"):\n x=x+1\n else:\n x=x-1\nprint(x)\n \t\t\t \t \t \t \t \t \t \t \t \t\t \t", "n = int(input())\r\ns=0\r\nfor i in range(n):\r\n b=input()\r\n if '++' in b:\r\n s+=1\r\n elif '--' in b:\r\n s-=1\r\nprint(s)", "n = int(input())\r\nx = 0\r\nfor _ in range(n):\r\n s = input()\r\n for i in range(3):\r\n if s[i] == '+':\r\n x += 1\r\n break\r\n elif s[i] == '-':\r\n x -= 1\r\n break\r\nprint(x)\r\n\r\n", "# Function to execute the Bit++ program and find the final value of x\ndef execute_program(program):\n x = 0\n for statement in program:\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n return x\n\n# Input\nn = int(input())\nprogram = [input() for _ in range(n)]\n\n# Output\nresult = execute_program(program)\nprint(result)\n\n \t \t \t \t\t \t\t \t\t \t\t", "X = 0\r\nn = int(input())\r\nfor i in range(0,n):\r\n a = input()\r\n if (a == '++X' or a == 'X++') :\r\n X = X + 1\r\n else:\r\n X = X - 1\r\nprint(X)", "san = int(input())\r\nlin = 0\r\nfor z in range(san):\r\n sandar = input()\r\n if sandar[1] == \"+\":\r\n lin = lin + 1\r\n else:\r\n lin = lin - 1\r\nprint(lin)\r\n", "x = int(input())\r\ncnt = 0\r\n\r\nfor i in range(x):\r\n s = input()\r\n if s.find('+') == -1:\r\n cnt = cnt-1\r\n else:\r\n cnt = cnt + 1\r\nprint(cnt)", "x = 0\r\nn = int(input())\r\nfor i in range(n):\r\n l = str(input())\r\n if l == '++X' or l == 'X++':\r\n x+=1\r\n elif l == '--X' or l == 'X--':\r\n x -= 1\r\nprint(x)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n str1=input()\r\n if str1==\"++X\" or str1==\"X++\":\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Oct 9 17:44:40 2023\n\n@author: khabl\n\"\"\"\ndef bitPlusPlus():\n #ask user for number of statements\n num_states = int(input())\n \n # initialize an empty list to store statements \n statements = []\n \n # Loop to append list\n for i in range(num_states):\n S = input()\n statements.append(S)\n \n #initialize result variable to 0\n result = 0\n \n #loop through list items and perform operations accordingly\n for i in statements:\n if(i == \"++X\" or i == \"X++\"):\n result += 1\n else:\n result -= 1\n \n \n print(result)\n \n#call the function\nbitPlusPlus()\n\t\t\t\t\t\t\t \t\t\t\t\t\t \t\t \t\t \t \t", "a = int(input())\r\n\r\nz = []\r\nfor i in range(1, a + 1):\r\n b = input()\r\n z.append(b)\r\n\r\ncount = 0\r\nfor j in z:\r\n if j[0] == '+' or j[2] == '+':\r\n count = count + 1\r\n\r\n if j[0] == '-' or j[2] == '-':\r\n count = count - 1\r\n\r\nprint(count)", "n=int(input())\r\na=0\r\nfor _ in range(n):\r\n\tk=input()\r\n\tif '+' in k:\r\n\t\ta=a+1\r\n\tif \"-\" in k:\r\n\t\ta=a-1\r\nprint(a)", "n = int(input())\ncount = 0\nfor i in range(0, n):\n x = input()\n if x[0:2] == \"++\" or x[1:] == \"++\":\n count += 1\n else:\n count -=1\nprint(count)", "n = int(input())\r\n\r\nx = 0\r\n\r\nfor e in range(n):\r\n a = input()\r\n\r\n if \"++\" in a and \"X\" in a:\r\n x += 1\r\n elif \"--\" in a and \"X\" in a:\r\n x -= 1\r\n\r\nprint(x)\r\n", "n = int(input())\r\nx = 0\r\nfor i in range(n):\r\n command = input()\r\n if command[0] == \"+\" or command[2] == \"+\":\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)\r\n", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n x = input()\r\n if (x[1] == \"+\"):\r\n count += 1\r\n else:\r\n count -= 1\r\nprint(count)", "def i():\r\n return(int(input()))\r\ndef l():\r\n return(list(map(int,input().split())))\r\ndef s():\r\n \r\n return(input())\r\ndef m():\r\n return(map(int,input().split()))\r\n\r\n \r\nn = i()\r\nx = 0\r\nfor _ in range(n):\r\n st = s()\r\n if st[0] == '+' or st[-1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)", "n=int(input())\nm=0\nfor _ in range(n):\n l=input()\n if l==\"++X\" or l==\"X++\":\n m+=1\n else:\n m-=1\nprint(m)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n ls = input()\r\n if \"++\" in ls:\r\n count+=1\r\n else:\r\n count-=1\r\nprint(count)\r\n", "t = int(input())\r\nx = 0\r\nfor test in range(t):\r\n operator = input()\r\n x = x+1 if operator.find(\"++\")>=0 else x-1\r\nprint(x)", "a=int(input(\"\"))\r\nplus=0\r\nminus=0\r\nfor i in range(a):\r\n l=list(input(\"\"))\r\n if l[1]==\"+\":\r\n plus+=1\r\n else:\r\n minus+=1\r\nprint(plus-minus)", "# no of statements\njumlah = int(input())\n\n# statementsnya\nx = 0\nfor rep in range(0,jumlah):\n statements = input()\n if (statements == \"++X\") or (statements == \"X++\"):\n x += 1\n elif (statements == \"--X\") or (statements == \"X--\"):\n x -= 1\n \nprint(x)\n \t \t \t\t \t\t \t \t \t \t", "n=0\r\nfor _ in range(int(input())):\r\n a = input()\r\n # n=0\r\n if a[1] == '+':\r\n n+=1\r\n elif a[1] == '-':\r\n n-=1\r\nprint(n)", "n = int(input())\r\n\r\nx = 0\r\nsub1 = \"--X\"\r\nadd1 = \"++X\"\r\nsub2 = \"X--\"\r\nadd2 = \"X++\"\r\n\r\nfor i in range(n):\r\n a = input()\r\n if a == sub1 or a == sub2:\r\n x -= 1\r\n elif a == add1 or a == add2:\r\n x += 1\r\nprint(x)\r\n", "x = 0\r\nn = int(input())\r\n\r\nfor i in range(0, n):\r\n i += 1\r\n l = str.lower(input())\r\n if (l == \"--x\" or l == \"x--\"):\r\n x -= 1\r\n elif (l == \"++x\" or l == \"x++\"):\r\n x += 1\r\n\r\nprint(x)", "n = int(input())\r\ns = \" \"\r\nfor i in range(n):\r\n s = s+ str(input())\r\nx = (s.count(\"+\")-s.count(\"-\"))/2\r\nprint(int(x))\r\n", "# print(x for i in range(int(input())) x+1 if '+' in input() ) \r\n#NO SINGLE LINE CODE POSSIBLE \r\nx=0\r\nfor i in range(int(input())):\r\n\tx=x+1 if '+' in input() else x-1\r\n\r\n\r\n\t# if '+' in input():\r\n\t# \tx+=1\r\n\t# else:\r\n\t# \tx-=1\r\n\r\nprint(x)\r\n", "n = int(input())\r\nX = 0\r\n\r\nfor value in range(n):\r\n y = input()\r\n if (y == 'X++') or (y == '++X') :\r\n X+=1\r\n elif (y == 'X--') or (y == '--X') :\r\n X-=1 \r\n\r\nprint(X)\r\n", "n = int(input())\r\ns = []\r\nx = 0\r\n\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nfor j in s:\r\n if j.startswith(\"+\") or j.endswith(\"+\"):\r\n x += 1\r\n if j.startswith(\"-\") or j.endswith(\"-\"):\r\n x -= 1\r\n\r\nprint(x)\r\n", "n = int(input())\r\nx = 0\r\n\r\nfor _ in range(n):\r\n if input()[1] == \"+\":\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)", "n = int(input())\nresult = 0\nfor x in range(n):\n statement = input()\n if (\"++\" in statement):\n result = result + 1\n if (\"--\" in statement):\n result = result - 1\nprint(result)", "n = int(input())\r\nX = 0\r\nfor i in range(n):\r\n s = input()\r\n if s == \"++X\" or s == \"X++\":\r\n X = X + 1\r\n if s == \"--X\" or s == \"X--\":\r\n X = X - 1\r\n\r\nprint(X)", "def FinalResult(operation, count):\r\n if operation == \"X++\" or operation == \"++X\":\r\n count = count+1\r\n else:\r\n count = count-1\r\n return count\r\n\r\nnum = int(input(\"\"))\r\nvalue = 0\r\nfor i in range(num):\r\n operationToPerform = input(\"\")\r\n value = FinalResult(operationToPerform, value)\r\nprint (value)", "import sys\n\nif __name__ == '__main__':\n n = int(sys.stdin.readline())\n x = 0\n for i in range(n):\n op = sys.stdin.readline().strip()\n if '++' in op:\n x += 1\n elif '--' in op:\n x -= 1\n\n print(x)\n", "cnt = 0\r\nfor _ in range(int(input())):\r\n str = input()\r\n if \"++\" in str:\r\n cnt += 1\r\n if \"--\" in str:\r\n cnt -=1\r\nprint(cnt)", "n = int(input())\r\na = 0\r\nfor i in range(n):\r\n o = input()\r\n if o == '--X' or o == 'X--':\r\n a -= 1\r\n if o == '++X' or o=='X++':\r\n a+=1\r\nprint(a)\r\n ", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n c= input()\r\n if c[0]==\"+\" or c[-1]==\"+\":\r\n x+=1\r\n else:\r\n x-=1\r\n \r\nprint(x)", "x = 0\r\nn = int(input())\r\nfor i in range(n):\r\n bit = str(input())\r\n if bit == '++X' or bit == 'X++':\r\n x += 1\r\n elif bit == '--X' or bit == 'X--':\r\n x -= 1\r\nprint(x)", "import math\nimport sys\nfrom collections import defaultdict\nimport heapq\nfrom collections import deque\ninput = sys.stdin.readline\nUSE_FILE = False \n\ndef search(k, v):\n p = 0\n a, n = len(v), len(v)\n while a >= 1:\n while p + a < n and k > v[p+a]:\n p += a\n a //= 2\n if k > v[p+a]:\n p += 1\n return p+1\n\nglobal maxi\nmaxi = -999999999999999 \n\ndef prnt(numbers):\n print(\"\\n\".join(map(str, numbers)))\n\ndef check(numbers):\n return sum(numbers) / 4 == (numbers[1] + numbers[2]) / 2 == numbers[-1] - numbers[0]\n\n\ndef main():\n n = int(input().strip())\n d = {\"++X\": 1, \"X++\": 1, \"--X\": -1, \"X--\": -1}\n res = 0\n for i in range(n):\n op = input().strip()\n res += d[op]\n print(res)\n\n\n\nif __name__==\"__main__\":\n if USE_FILE:\n sys.stdin = open('/home/stefan/input.txt', 'r')\n main()\n", "x = int(input())\r\ns=0\r\nfor i in range (x):\r\n ch = input()\r\n if ch[1]=='+':\r\n s+=1\r\n else :\r\n s = s-1\r\nprint(s)\r\n ", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n m = input()\r\n if (m[1] == '+'):\r\n k += 1\r\n else:\r\n k -= 1\r\nprint(k)", "total = int(input())\r\ncount = 0\r\noperations = {\"X++\":1,\"++X\":1,\"--X\":-1,\"X--\":-1}\r\nfor i in range(total):\r\n # if i == total -1:\r\n # ope = input()\r\n # if ope[0] != \"X\":\r\n # count += -(operations[ope])\r\n # count += \r\n ope = input()\r\n count += operations[ope]\r\nprint(count)", "t=int(input())\r\ns=\"\"\r\nx=0\r\nwhile t >0 :\r\n s=input()\r\n if s[0]=='+' or s[1]=='+':\r\n x+=1\r\n else:\r\n x-=1\r\n \r\n t-=1\r\nprint(x)\r\n ", "t=int(input())\nres=0\nfor x in range(t):\n n=input()\n if n==\"++X\" or n==\"X++\":\n res+=1\n elif n==\"--X\" or n==\"X--\":\n res-=1\nprint(res)\n\t\t \t\t \t \t \t \t \t\t\t \t\t\t \t \t\t", "n = 0\r\nfor i in range(int(input())):\r\n x = input()\r\n if \"++\" in x:\r\n n += 1\r\n else: \r\n n -= 1\r\nprint(n)", "t = int(input())\r\nx = 0\r\nfor i in range(t):\r\n operator = input()\r\n if (operator == \"X--\") or (operator == \"--X\"):\r\n x -=1\r\n elif (operator == \"X++\") or (operator == \"++X\"):\r\n x+=1\r\nprint(x)", "statements=int( input())\r\nX=0\r\nfor i in range (statements):\r\n\tstatement=input()\r\n\tif statement =='++X' or statement == 'X++':\r\n\t\tX+=1\r\n\telif statement == '--X'or statement =='X--':\r\n\t\tX-=1\r\n\telse:\r\n\t\tcontinue\r\nprint(X)", "n = int(input())\r\nx = 0\r\n\r\nfor i in range(n):\r\n letter = input()\r\n if letter == \"++X\" or letter == \"X++\":\r\n x += 1\r\n elif letter == \"--X\" or letter == \"X--\":\r\n x -= 1\r\n\r\nprint(x)", "t=int(input())\r\ncount=0\r\nfor i in range(t):\r\n z=input().strip()\r\n if(z.count('+')>=1):\r\n count+=1\r\n if(z.count('-')>=1):\r\n count+=(-1)\r\nprint(count)", "# Initialize the variable x to 0\r\nx = 0\r\n\r\n# Input: Read the number of statements\r\nn = int(input().strip())\r\n\r\n# Process each statement\r\nfor _ in range(n):\r\n statement = input().strip()\r\n \r\n # Check if the statement contains \"++\" or \"--\"\r\n if \"++\" in statement:\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\n# Output the final value of x\r\nprint(x)\r\n", "list_of_op = []\r\nnum_of_inp = int(input())\r\n\r\nfor _ in range(num_of_inp):\r\n op = input()\r\n list_of_op.append(op)\r\n\r\ndef operation():\r\n x = 0\r\n for _ in range(num_of_inp):\r\n if \"+\" in list_of_op[_]:\r\n x += 1\r\n else:\r\n x -= 1\r\n return x\r\n\r\nprint(operation())", "m = int(input())\r\n\r\nx = 0\r\nfor i in range(m):\r\n j = str(input())\r\n \r\n if j[0] == 'X':\r\n if j[1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\n elif j[2] == 'X':\r\n if j[1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)", "x=0\nn=input()\nn=int(n)\nfor i in range(n):\n ab=input()\n if ab==(\"++X\")or ab==(\"X++\"):\n x=x+1\n else:\n x=x-1\nprint(x)\n\t\t \t \t \t\t\t\t\t \t \t \t \t", "n = int(input())\nresult = 0\n\nfor _ in range(n):\n statement = input()\n if \"++\" in statement:\n result += 1\n else:\n result -= 1\n\nprint(result)\n\n\t \t\t \t\t \t\t \t\t \t \t \t\t\t\t \t\t \t", "n = int(input())\r\nsum = 0\r\nfor _ in range(n):\r\n temp = input()\r\n if temp[:2]=='--' or temp[-2:]==\"--\":\r\n sum-=1\r\n elif temp[:2]=='++' or temp[-2:]==\"++\":\r\n sum+=1\r\nprint(sum)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n\ta=input()\r\n\tif a.__contains__('+'):\r\n\t\tx+=1\r\n\telse:\r\n\t\tx-=1\r\nprint(x)\r\n", "n = int(input())\r\nX = 0\r\n\r\nfor i in range(n):\r\n st = input()\r\n \r\n if st[1] == \"+\":\r\n X += 1\r\n else:\r\n X -= 1\r\n\r\nprint(X)\r\n", "n=int(input())\r\nx=0\r\nfor j in range(n):\r\n symbol=input().split()\r\n for i in range(len(symbol)):\r\n if symbol[i] == \"++X\" or symbol[i] == \"X++\":\r\n x = x + 1\r\n else:\r\n x = x - 1\r\nprint(x)", "n = int(input())\r\nx = sum(1 if input() in \"++X,X++\" else -1 for _ in range(n))\r\nprint(x)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n a=input()\r\n l.append(a)\r\nb=0 \r\nfor i in range(len(l)):\r\n if(\"+\" in l[i]):\r\n b+=1\r\n elif(\"-\" in l[i]):\r\n b-=1\r\n\r\n\r\n\r\nprint(b)", "if __name__=='__main__':\r\n\tn = int(input())\r\n\tsum_x = 0\r\n\tfor _ in range(n):\r\n\t\ts = input()\r\n\t\tif '++' in s:\r\n\t\t\tsum_x += 1\r\n\t\telif '--' in s:\r\n\t\t\tsum_x -=1\r\n\tprint(sum_x)", "n = int(input())\r\nc = 0\r\n\r\nfor _ in range(n):\r\n s = input()\r\n \r\n # Check for occurrences of \"++\" or \"--\" in the input string\r\n if \"++\" in s:\r\n c += 1\r\n elif \"--\" in s:\r\n c -= 1\r\n\r\nprint(c)\r\n", "import copy\nimport decimal\nimport math\nimport sys\nimport time\ncyc=int(input())\nsum=0\nfor each in range(cyc):\n curr=input()\n if curr.count(\"-\")>0:\n sum-=1\n else:sum+=1\nprint(sum)", "n = int(input())\r\nx= 0 \r\nfor i in range (n):\r\n statment = input()\r\n if statment == \"X++\" or statment == \"++X\":\r\n x +=1\r\n elif statment == \"X--\" or statment == \"--X\":\r\n x-=1\r\nprint(x) ", "n = int(input())\r\nresp = 0\r\n\r\nfor i in range(n):\r\n s = input()\r\n if s == \"X++\" or s == \"++X\":\r\n resp+=1\r\n if s ==\"--X\" or s ==\"X--\":\r\n resp-=1\r\n\r\nprint(resp)", "n = int(input())\ncount = 0\nfor i in [0]*n:\n statement = list(input())\n if \"X\" in statement and \"+\" in statement:\n count +=1\n elif \"X\" in statement and \"-\" in statement:\n count -=1\nprint (count)\n", "n = int(input())\r\n\r\ncurrent = 0\r\n\r\nfor i in range(n):\r\n str = input()\r\n if str == \"++X\" or str == \"X++\":\r\n current += 1\r\n else:\r\n current -= 1\r\n\r\nprint(current)", "z = input()\nz = int(z)\nc = 0\nfor i in range (z) :\n x = input()\n x = str(x)\n if x == \"++X\" or x == \"X++\" :\n c += 1\n else :\n c -= 1\nprint(c)\n \t\t\t \t \t \t \t\t \t\t\t\t\t\t\t \t \t", "x = 0\nfor _ in range(int(input())):\n\tif \"+\" in input(): x+=1\n\telse: x-=1\nprint(x)\t\n", "t = input()\r\nn = int(t)\r\nx = 0\r\nr = 1\r\nwhile r <= n:\r\n f = input()\r\n if f.find(\"++\") != -1:\r\n x=x+1\r\n else:\r\n x=x-1\r\n r=r+1\r\nprint(x)", "num = int(input())\ny = 0\nfor i in range(num):\n x=input()\n \n if \"-\"in x:\n y -=1\n else:\n y +=1\n \nprint(y)\n\t \t \t \t \t \t\t\t \t\t \t\t \t \t\t \t\t", "n = int(input())\n\nwhile n<1 or n>150:\n n = int(input())\n\n\nsuma = 0\nfor el in range(0,n):\n x = input()\n if x=='--X' or x=='X--':\n suma= suma-1\n if x=='++X' or x=='X++':\n suma = suma+1\n \nprint(suma)", "def write_digit(text, x):\r\n \r\n if \"++\" in text:\r\n return x + 1\r\n \r\n elif \"--\" in text:\r\n return x - 1\r\n\r\nn = int(input())\r\nx = 0\r\n\r\nfor _ in range(n):\r\n text = input().strip()\r\n x = write_digit(text, x)\r\nprint(x)", "n = int(input())\r\ncnt= 0\r\nop = []\r\nfor i in range(n):\r\n op.append(input())\r\nfor i in op:\r\n if i in ('++X','X++'):\r\n cnt+=1\r\n elif i in ('--X','X--'):\r\n cnt-=1 \r\nprint(cnt) ", "n = int(input())\r\noperations: list = [input().lower() for _ in range(n)]\r\nx = 0\r\nfor i in operations:\r\n if i[1] == '+':\r\n x+=1\r\n elif i[1] == '-':\r\n x-=1\r\n \r\nprint(x)\r\n\r\n", "k = int(input())\r\nr = 0\r\ns = ''\r\nfor i in range(k):\r\n s = input()\r\n if '+' in s:\r\n r+=1\r\n else:\r\n r-=1\r\nprint(r)\r\n", "t=int(input())\r\nn=0\r\nfor i in range(0,t):\r\n s=input()\r\n if s[1]=='-':\r\n n-=1\r\n else:\r\n n+=1\r\nprint(n)", "n = int(input())\r\nl=0\r\nr=0\r\nwhile n > 0:\r\n n-=1\r\n s = str(input())\r\n if(s == \"++X\" or s == \"X++\"):\r\n l+=1\r\n if(s == \"--X\" or s == \"X--\"):\r\n r+=1\r\nprint(l-r)\r\n", "operations=int(input())\r\nx=0\r\nfor i in range(operations):\r\n operation=input()\r\n if \"-\" in operation:\r\n x=x-1\r\n elif \"+\" in operation:\r\n x=x+1\r\n\r\nprint(x)\r\n \r\n", "def main():\r\n\tt = int(input())\r\n\tfinal = 0\r\n\tfor _ in range(t):\r\n\t\tn = input()\r\n\t\tif n[0] == \"X\" and n[-1] == \"+\":\r\n\t\t\tfinal += 1\r\n\t\telif n[-1] == \"X\" and n[0] == \"+\":\r\n\t\t\tfinal += 1\r\n\t\telse:\r\n\t\t\tfinal -= 1\r\n\tprint(final)\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "a=int(input())\r\nx=0\r\ny=[]\r\nfor i in range(a):\r\n b=input()\r\n y.append(b)\r\n if '+' in b:\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)\r\n", "a = int(input())\r\nb = 0\r\nfor _ in range(a):\r\n statement = input()\r\n if \"++\" in statement:\r\n b += 1\r\n else:\r\n b -= 1\r\nprint(b)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n w=input()\r\n if '+' in w:\r\n x+=1\r\n if '-' in w:\r\n x-=1\r\nprint(x)", "n = int(input())\r\nnum1 = 0\r\n\r\nfor i in range(0, n):\r\n y = input()\r\n if y == '++X':\r\n num1 = num1 + 1\r\n if y == 'X++':\r\n num1 = num1 + 1\r\n if y == '--X':\r\n num1 = num1 - 1\r\n if y == 'X--':\r\n num1 = num1 - 1\r\nprint(num1)\r\n", "n = int(input())\r\n\r\nx = 0\r\n\r\nfor i in range(n):\r\n increment = input()\r\n if increment == '++X' or increment == 'X++':\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)\r\n", "def execute_programme(statements):\r\n x = 0\r\n for statement in statements:\r\n if \"++\" in statement:\r\n x += 1\r\n else:\r\n x -= 1\r\n return x\r\n\r\ndef main():\r\n n = int(input())\r\n statements = [input() for _ in range(n)]\r\n\r\n result = execute_programme(statements)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ncounter = 0\r\nfor _ in range ( n ) :\r\n iter = input().strip()\r\n if ( iter[0] == 'X' or iter[0]== 'x' ):\r\n if ( iter[1] == '+' and iter[2]=='+'):\r\n counter+=1\r\n if ( iter[1] == '-' and iter[2]=='-'):\r\n counter-=1\r\n if ( iter[2] == 'X' or iter[2]== 'x' ):\r\n if ( iter[1] == '+' and iter[0]=='+'):\r\n counter+=1\r\n if ( iter[1] == '-' and iter[0]=='-'):\r\n counter-=1\r\n\r\nprint(counter)\r\n", "# Read the number of statements\nn = int(input())\n\n# Initialize the variable x\nx = 0\n\n# Execute each statement\nfor _ in range(n):\n statement = input()\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n\n# Print the final value of x\nprint(x)\n\n\t \t \t\t\t\t\t\t\t \t \t \t \t\t\t", "n=int(input())\nX=0\nfor _ in range(n):\n str=input()\n if str[1]=='+':\n X+=1\n else:\n X-=1\nprint(X)\n\n\n \t \t\t\t\t\t\t\t \t\t \t \t \t \t \t\t \t", "n=int(input())\r\np=[]\r\nfor i in range(n):\r\n p.append(input())\r\nvar=0\r\nfor i in p:\r\n if i=='X++' or i=='++X':\r\n var+=1\r\n elif i=='X--' or i=='--X':\r\n var+=-1\r\nprint(var)", "a = int(input())\r\nc = 0\r\nfor i in range(a):\r\n b = input()\r\n if(b[1] == \"+\"):\r\n c += 1\r\n else:\r\n c -= 1\r\nprint(c)", "n = int(input())\r\na = []\r\nx=0\r\nfor i in range(0,n):\r\n step = input()\r\n if step==\"++X\" or step==\"X++\":\r\n x+=1\r\n elif step==\"--X\" or step==\"X--\":\r\n x-=1\r\nprint(x)", "n = int(input())\r\nx = 0\r\n\r\nfor n in range(n):\r\n line = input()\r\n countp = line.count(\"+\")\r\n countn = line.count(\"-\")\r\n\r\n if countp != 0:\r\n x+=1\r\n if countn !=0:\r\n x-=1\r\n\r\n\r\nprint(x)\r\n\r\n\r\n", "X=int(0)\noperationtimes=int(input())\nfor i in range(operationtimes):\n entry=str(input())\n if entry==\"X++\" or entry==\"++X\":\n X=X+1\n if entry==\"--X\" or entry==\"X--\":\n X=X-1\nprint(X)", "t=[]\nx=0\nfor i in range(int(input())):\n n=input()\n if (n=='--X') or (n=='X--') :\n x=x-1\n elif (n=='++X')or('X++') :\n x=x+1\nprint(x)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n ch=input()\r\n if ch==\"++X\" or ch==\"X++\" or ch==\"++\" :\r\n s+=1\r\n elif ch==\"--X\" or ch==\"X--\" or ch==\"--\":\r\n s-=1\r\nprint(s)", "x = 0\r\nfor _ in range(int(input())):\r\n x += {'+': 1, '-': -1}[input()[1]]\r\nprint(x)", "X=0\r\nb=int(input())\r\n\r\nfor i in range(b):\r\n opr=input()\r\n if \"X++\" in opr or \"++X\" in opr:\r\n X+=1\r\n if \"X--\" in opr or \"--X\" in opr: \r\n X-=1\r\n\r\nprint (X)", "n = int(input()) #number of inputs\r\nnumber = 0\r\noperations = []\r\n\r\nfor init in range(n):\r\n operations.append(input())\r\n\r\nfor x in operations:\r\n if(x == '++X' or x == 'X++'):\r\n number+=1\r\n if(x == '--X' or x == 'X--'):\r\n number-=1\r\n\r\nprint(number)", "numStatements = int(input())\r\nx = 0\r\n\r\nfor _ in range(numStatements):\r\n statement = input()\r\n if \"++\" in statement and statement.count('X') == 1:\r\n x += 1\r\n if \"--\" in statement and statement.count('X') == 1:\r\n x -= 1\r\n else:\r\n pass\r\n \r\nprint(x)", "# Function to execute the Bit++ program and find the final value of x\ndef execute_bit_program(program):\n x = 0\n for statement in program:\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n return x\n\n# Input reading\nn = int(input())\nbit_program = [input() for _ in range(n)]\n\n# Call the function to execute the Bit++ program\nresult = execute_bit_program(bit_program)\n\n# Print the final value of x\nprint(result)\n\n \t \t\t\t\t\t \t \t \t \t\t\t \t \t \t\t\t\t", "def foo(s):\r\n l = []\r\n for i in range(len(s)):\r\n l.append(s[i])\r\n if l.count('+')==2:\r\n return 1\r\n elif l.count('-')==2:\r\n return -1\r\n else:\r\n return 0\r\nq = int(input())\r\nans =0\r\nfor i in range(q):\r\n s = input()\r\n ans = ans + (foo(s))\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", "x=0\r\n\r\nn=input()\r\nlist=[]\r\nfor i in range(int(n)):\r\n a=input()\r\n list.append(a)\r\n \r\nfor i in range(int(n)):\r\n k=list[i]\r\n if (k[1]==\"+\"):\r\n x+=1\r\n elif(k[1]==\"-\"):\r\n x-=1\r\n \r\nprint(x)", "ans=0\r\nfor i in range(int(input())):\r\n s=input()\r\n for j in s:\r\n if j==\"+\":\r\n ans+=0.5\r\n if j==\"-\":\r\n ans-=0.5\r\nprint(int(ans))", "def bit_pp(statement):\r\n x = 0\r\n if statement == 'X++' or statement == '++X':\r\n x += 1\r\n elif statement == 'X--' or statement == '--X':\r\n x -= 1\r\n return x\r\n\r\ncounter = 0\r\nnum_of_statements = int(input())\r\nfor _ in range(num_of_statements):\r\n statemnt = input()\r\n counter += bit_pp(statemnt)\r\n\r\nprint(counter)\r\n", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n stat=input()\r\n if \"++\" in stat:\r\n x+=1\r\n elif \"--\" in stat:\r\n x-=1\r\nprint(x)", "x=0\r\nn=int(input())\r\nfor i in range(n):\r\n y=str(input())\r\n if y==\"X++\" or y==\"++X\":\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)", "n = int(input())\r\n\r\nA=0\r\n\r\nfor i in range(n):\r\n a = input()\r\n if a=='++X' or a=='X++':\r\n A+=1\r\n else:\r\n A=A-1\r\n\r\nprint(A)", "if __name__ == '__main__':\r\n n = int(input())\r\n x = 0\r\n for i in range(n):\r\n input_str = input()\r\n if input_str.find('++') != -1:\r\n x+=1\r\n elif input_str.find('--') != -1:\r\n x-=1\r\n print(x)", "num = int(input())\r\nvalue = 0\r\n\r\nfor i in range(num):\r\n\tstatement = input()\r\n\tif \"++\" in statement:\r\n\t\tvalue = value + 1\r\n\telse:\r\n\t\tvalue = value - 1\r\n\r\nprint(value)\r\n\r\n", "n = int(input())\r\nx=0\r\nfor i in range(n):\r\n a = input()\r\n if a=='++X' or a=='X++':\r\n x+=1\r\n else:\r\n x=x-1\r\nprint(x)", "n=int(input())\r\nx=0\r\nfor i in range(1,n+1,1):\r\n s=input()\r\n if s==\"++X\" or s==\"X++\":\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)", "n = int(input())\r\n\r\nFirst_Num = 0\r\n\r\nfor i in range(n):\r\n Operation = input()\r\n if \"++\" in Operation:\r\n First_Num += 1\r\n elif \"--\" in Operation:\r\n First_Num -= 1\r\n \r\nprint(First_Num)", "n=int(input())\r\nX=0\r\nfor i in range(n):\r\n t=input()\r\n if t==\"X++\" or t==\"++X\":\r\n X+=1\r\n else:\r\n X-=1\r\nprint(X)", "a = int(input())\nl = []\nx = 0\nwhile a:\n\tp = input()\n\tif p in [\"X++\", \"++X\"]:\n\t\tx += 1\n\telif p in [\"--X\",\"X--\"]:\n\t\tx -= 1\n\ta -= 1\nprint(x)\n\n \t\t\t \t\t\t \t\t \t\t\t\t\t\t\t\t\t\t\t\t \t", "n = int(input())\r\nx = 0\r\nSUMA = False\r\nfor i in range(0, n):\r\n word = input()\r\n for z in word:\r\n if z == '+':\r\n SUMA = True\r\n if z == '-':\r\n SUMA = False\r\n if SUMA == True:\r\n x +=1\r\n else:\r\n x -=1\r\nprint(x)\r\n", "n = int(input())\r\nx = 0\r\n\r\nfor _ in range(n):\r\n b = input()\r\n if b== \"X++\" or b == \"++X\":\r\n x = x + 1\r\n else:\r\n x = x - 1\r\n\r\nprint(x)\r\n", "n = int(input())\r\noperations=[]\r\nx=0\r\n\r\nfor i in range(n):\r\n a=input()\r\n operations.append(a)\r\n if \"+\" in operations[i]:\r\n x = x+1 \r\n elif \"-\" in operations[i]:\r\n x = x-1\r\n \r\nprint(x)", "n=int(input())\r\nx=0\r\nfor i in range(0,n):\r\n s=input()\r\n if s[0]=='+'or s[2]=='+':\r\n x+=1 \r\n else:\r\n x-=1 \r\nprint(x)\r\n\r\n ", "a = int(input())\r\ncount = 0\r\nwhile(True):\r\n try:\r\n st = input()\r\n except:\r\n break\r\n if st == \"++X\" or st == \"X++\":\r\n count += 1\r\n if st == \"--X\" or st == \"X--\":\r\n count -= 1\r\nprint(count)", "#https://codeforces.com/contest/282/problem/A (strings, if statements)\r\nn = int(input())\r\nnum = 0\r\nfor i in range(n):\r\n s = input()\r\n if \"+\" in s:\r\n num+=1\r\n else:\r\n num-=1\r\nprint(num)", "from collections import *\r\nfrom heapq import *\r\nfrom math import *\r\nimport sys \r\n# import threading\r\ndef get_int():\r\n return int(input())\r\ndef get_list():\r\n return list(map(int, input().split()))\r\ndef main():\r\n test = get_int()\r\n ans = 0\r\n for _ in range(test):\r\n string = input()\r\n if string[:2] == '++' or string[1:] == '++':\r\n ans += 1\r\n else:\r\n ans -= 1\r\n print(ans)\r\n # n = get_int()\r\n # a = get_list()\r\n # b = get_list()\r\nimport sys\r\nimport threading\r\nmain_threading = threading.Thread(target=main)\r\nmain_threading.start()\r\nmain_threading.join()\r\n\r\n\r\n", "n = int(input())\r\nx = 0\r\nfor _ in range(n):\r\n statement = list(map(str, input().strip()))\r\n if statement[1] == \"+\":\r\n x += 1\r\n elif statement[1] == \"-\":\r\n x -= 1\r\nprint(x)\r\n", "n = int(input())\r\nf = 0\r\n\r\nfor i in range(n):\r\n s = input()\r\n\r\n if s == \"++X\" or s == \"X++\":\r\n f += 1\r\n elif s == \"--X\" or s == \"X--\":\r\n f -= 1\r\n\r\nprint(f)\r\n", "n=int(input())\r\nvar=0\r\nfor i in range(n):\r\n x=input()\r\n if x==(\"++X\"):\r\n var=var+1\r\n elif x==(\"--X\"):\r\n var=var-1\r\n elif x==(\"X++\"):\r\n var=var+1\r\n else:\r\n var=var-1\r\nprint(var)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n stringInput = input()\r\n if \"+\" in stringInput:\r\n count += 1\r\n if \"-\" in stringInput:\r\n count -= 1\r\n\r\nprint(count)", "n = int(input())\r\nx = int(0)\r\nfor i in range(n):\r\n st=str(input())\r\n if st[1]=='+':\r\n x += 1\r\n else:\r\n x -=1\r\nprint(x)", "# from get import Inputer\n\n# input_ = Inputer()\n\n\nx = 0\nn = int(input())\n\nwhile n:\n statement = input()\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n n -= 1\n\n# input_.close()\nprint(x)\n", "ans=0\r\nfor _ in range(int(input())):\r\n s=input()\r\n if s==\"X++\" or s==\"++X\": ans+=1\r\n else: ans-=1\r\nprint(ans) ", "ops = int(input())\r\nn = 0\r\nsents = []\r\nfor op in range(ops):\r\n sents.append(input())\r\nfor sent in sents:\r\n if '+' in sent:\r\n n += 1\r\n else:\r\n n -= 1\r\nprint(n)", "def solve():\r\n c = 0\r\n for _ in range(int(input())):\r\n s = input()\r\n if '+' in s:\r\n c += 1\r\n else:\r\n c -= 1\r\n return c\r\nprint(solve())", "n = int(input())\r\nx = 0 # Initial value of x\r\n\r\nfor _ in range(n):\r\n statement = input()\r\n \r\n if \"++\" in statement:\r\n x += 1\r\n else: # \"--\" is the only other option\r\n x -= 1\r\n\r\nprint(x)\r\n", "k=int(input())\r\nx=0\r\nfor i in range(k):\r\n s=input()\r\n for j in s:\r\n if j=='+':\r\n x+=1\r\n break\r\n if j=='-':\r\n x-=1\r\n break\r\nprint(x)\r\n", "n = int(input())\r\nx = 0\r\nd = []\r\nfor j in range(n): d.append(input('').lower().replace('x',''))\r\nfor i in d:\r\n if i=='++': x+=1\r\n elif i=='--': x-=1\r\n else: pass\r\nprint(x)", "case_num=int(input())\nx=0\nfor i in range(case_num):\n n= input()\n if n==\"--X\" or n=='X--':\n x-=1\n if n=='X++' or n=='++X':\n x+=1\nprint(x)\n\t \t \t \t \t \t \t\t\t\t \t \t \t\t \t \t", "# Read the number of statements\nn = int(input())\n\n# Initialize the variable x to 0\nx = 0\n\n# Loop through each statement\nfor i in range(n):\n # Read the statement\n statement = input()\n \n # Check if the statement contains ++\n if \"++\" in statement:\n # Increment x by 1\n x += 1\n \n # Check if the statement contains --\n elif \"--\" in statement:\n # Decrement x by 1\n x -= 1\n\n# Print the final value of x\nprint(x)\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", "x = 0\r\nn = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nfor i in s:\r\n if i == \"X++\" or i == \"++X\":\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)", "n = int(input())\r\nx = 0\r\nfor _ in range(n):\r\n op = input()\r\n if op[1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)\r\n", "a=int(input())\r\ns=0\r\nfor i in range(a):\r\n b=input()\r\n if \"+\" in b:\r\n s+=1\r\n else:\r\n s-=1\r\nprint(s)", "statements = int(input())\r\nfinal_x = 0\r\n\r\nfor x in range(statements):\r\n given=input()\r\n if \"+\" in given:\r\n final_x+=1\r\n else:\r\n final_x-=1\r\n\r\nprint(final_x)", "a=[]\r\nx=0\r\nfor _ in range(int(input())):\r\n s=set(input())\r\n for i in s:\r\n if i=='+':\r\n x+=1\r\n if i=='-':\r\n x-=1\r\nprint(x)\r\n\r\n \r\n", "import sys\r\nfrom typing import List\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 sys.stdin.readline().strip().split()]\r\ndef LF(): return [float(x) for x in sys.stdin.readline().strip().split()]\r\ndef MI(): return map(int, sys.stdin.readline().strip().split())\r\ndef LI(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef LS(): return sys.stdin.readline().strip().split()\r\ndef I(): return int(sys.stdin.readline().strip())\r\ndef F(): return float(sys.stdin.readline().strip())\r\ndef S(): return sys.stdin.readline().strip()\r\n\r\ndef debug(*args):\r\n print(*args, file=sys.stderr)\r\n\r\n\r\ndef main():\r\n ans = 0\r\n n = I()\r\n for _ in range(n):\r\n s = S()\r\n ans = ans + 1 if s[1] == '+' else ans - 1\r\n\r\n print(ans)\r\n #debug(\"THIS IS A DEBUG \", ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "x =int (input())\r\nz = 0\r\nfor i in range(x) :\r\n y =input()\r\n if (y == \"X++\" or y == \"++X\"):\r\n z+=1\r\n elif( y == \"X--\" or y == \"--X\"):\r\n z-=1\r\nprint(z)", "ash=int(input())\r\nx=0\r\nfor i in range(ash):\r\n sd=input()\r\n if (sd[1]=='+'):\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "n = int(input())\nsum = 0\nfor i in range(n):\n if \"++\" in input():\n sum += 1\n else:\n sum -= 1\nprint(sum)", "n = int(input())\r\n\r\nx = 0\r\nfor i in range(n):\r\n y = str(input())\r\n if y == '++X' or y == 'X++':\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)", "t=int(input())\r\nx=0\r\nfor i in range(t):\r\n\ta=input()\r\n\tif(a.count(\"+\")>=1):\r\n\t\tx+=1\r\n\telif(a.count(\"-\")>=1):\r\n\t\tx-=1\r\nprint(x)", "pasos = int(input())\r\n\r\nx = 0\r\n\r\nfor i in range(pasos):\r\n i = input()\r\n if \"++\" in i:\r\n x += 1\r\n if \"--\" in i:\r\n x -= 1\r\nprint(x)", "n= int(input())\r\nl1=[]\r\nsums=0\r\nsubs=0\r\nfor i in range(n):\r\n x= input()\r\n l1.append(x)\r\nfor j in l1:\r\n if j==\"X++\" or j==\"++X\":\r\n sums+=1\r\n elif j==\"--X\" or j==\"X--\":\r\n subs-=1\r\n\r\nprint(subs+sums)", "n=int(input())\r\n\r\np=int(0)\r\nfor i in range(n):\r\n X=str(input())\r\n if X==\"++X\" or X==\"X++\":\r\n p=p+1\r\n elif X==\"--X\" or X==\"X--\":\r\n p=p-1\r\nprint(p)", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n s = input()\r\n if '+' in s:\r\n k+=1\r\n else:\r\n k-=1\r\nprint (k)\r\n \r\n\r\n", "n = int(input())\nx = 0\nfor _ in range(n):\n str = input()\n if str[1]=='+':\n x += 1\n else:\n x -=1\nprint(x) \n \t\t\t \t\t \t \t \t \t\t \t\t\t \t", "operations=int(input())\r\nx=0\r\nfor i in range(operations):\r\n bruh=input()\r\n if '++' in bruh:\r\n x+=1\r\n elif '--' in bruh:\r\n x-=1\r\nprint(x)", "n = input()\nn = int(n)\nx = 0\nfor i in range (n):\n s = input()\n s = str(s)\n if s == \"++X\" or s == \"X++\":\n x += 1\n else:\n x -= 1\nprint(x)\n \t \t \t\t\t\t\t \t\t\t\t \t \t\t\t\t \t\t\t\t\t\t", "n=int(input())\r\nl=[]\r\nx=0\r\nfor i in range(n):\r\n l.append(input().lower())\r\nfor i in l:\r\n if i==\"x++\":\r\n x+=1\r\n if i==\"++x\":\r\n x+=1\r\n if i==\"--x\":\r\n x-=1\r\n if i==\"x--\":\r\n x-=1\r\nprint(x)", "x=0\r\nn = int(input())\r\nfor _ in range(n):\r\n if '++' in input():\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "sum=0\r\nt=int(input())\r\nfor _ in range(t):\r\n s=input()\r\n if(s[1]=='+'):\r\n sum+=1\r\n else:\r\n sum-=1\r\nprint(sum)", "a=int(input())\r\nk=0\r\nfor i in range(a):\r\n b=input()\r\n if b=='--X' or b=='X--':\r\n k-=1\r\n else:\r\n k+=1\r\nprint(k)\r\n", "from sys import stdin\r\n\r\ns = [i.rstrip('\\n') for i in stdin]\r\nm = s[0]\r\ndel s[0]\r\n\r\ndef f(sp):\r\n x = 0\r\n for i in sp:\r\n if '++' in i:\r\n x += 1\r\n else:\r\n x -= 1\r\n return x\r\nprint(f(s))", "n = int(input())\r\nx=0\r\nfor _ in range(n):\r\n statement = input()\r\n if \"++\" in statement:\r\n x+=1\r\n elif \"--\" in statement:\r\n x-=1\r\nprint(x) ", "n= int(input())\r\nX = 0\r\nwhile n>0:\r\n str = input()\r\n if str == \"X++\" or str == \"++X\":\r\n X+=1\r\n elif str == \"X--\" or str == \"--X\":\r\n X-=1\r\n else:\r\n x = 0\r\n n=n-1\r\nprint(X)", "a = int(input())\r\nresult = 0\r\nfor i in range(a):\r\n step = input()\r\n if step == \"++X\" or step == \"X++\":\r\n result += 1\r\n else:\r\n result -= 1\r\nprint(result)", "# A 486 - Bit++ - Codeforces\r\n# Link : https://codeforces.com/contest/282/problem/A\r\n\r\nnumberOfStatements = int(input())\r\n\r\ncounter = 0\r\n\r\nfor i in range(numberOfStatements):\r\n statement = input()\r\n if \"+\" in statement:\r\n counter += 1\r\n else:\r\n counter -= 1\r\n\r\nprint(counter)\r\n", "n=int(input())\r\na=[]\r\nx=0\r\nfor i in range (n):\r\n y=input()\r\n a.append(y)\r\nfor i in range(n):\r\n if a[i]=='X++' or a[i]=='++X':\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)\r\n", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n\top=input()\r\n\tif op=='++X' or op=='X++':\r\n\t\tx+=1\r\n\telif op=='--X' or op=='X--':\r\n\t\tx-=1\r\nprint(x)", "n = int(input())\r\nc = 0\r\nfor i in range(n):\r\n x = input()\r\n if x == \"++X\" or x == \"X++\":\r\n c += 1\r\n elif x == \"--X\" or x == \"X--\":\r\n c -= 1\r\nprint(c)\r\n", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n li=[i for i in input()]\r\n if \"+\" in li:\r\n ans+=1\r\n else:\r\n ans-=1\r\nprint(ans)", "operation_number = int(input())\r\n\r\noperations = []\r\n\r\nwhile operation_number > 0:\r\n\r\n operation = input()\r\n operations.append(operation)\r\n\r\n operation_number -= 1\r\n\r\n\r\nsum_counter, subs_counter = 0, 0\r\n\r\nfor operation in operations:\r\n\r\n if \"+\" in operation:\r\n\r\n sum_counter += 1\r\n\r\n else: subs_counter += 1\r\n\r\n\r\nprint(sum_counter - subs_counter)", "StepNo = int(input())\r\nvalue = 0\r\n\r\nfor i in range(StepNo):\r\n instruction = input()\r\n if instruction == \"++X\" or instruction == \"+X+\" or instruction == \"X++\":\r\n value = value + 1\r\n elif instruction == \"--X\" or instruction == \"-X-\" or instruction == \"X--\":\r\n value = value - 1\r\nprint(value)\r\n", "n=int(input())\r\na=0\r\nfor i in range(n):\r\n c=input()\r\n if c==\"++X\" or c==\"X++\":\r\n a=a+1\r\n elif c==\"X--\" or c==\"--X\":\r\n a=a-1\r\nprint(a)", "\r\nnumber = int(input())\r\ncount = 0 \r\nfor i in range (number): \r\n operation = str(input())\r\n if operation[0] == '+' or operation[len(operation)-1] == '+': \r\n count +=1 \r\n elif operation[0] == '-' or operation[len(operation) -1 ]== '-':\r\n count -=1 \r\nprint (count)", "t=int(input())\r\nx=0\r\nwhile t:\r\n a=input()\r\n if a[1]=='+':\r\n x=x+1\r\n else:\r\n x=x-1\r\n t=t-1\r\nprint(x)", "n = int(input())\r\n\r\nstrings = []\r\n\r\nfor x in range(n):\r\n a = list(map(str,input())) \r\n strings.append(a)\r\n \r\n\r\nresultX = 0\r\n\r\nfor x in range(len(strings)):\r\n if strings[x][1] == '+' or strings[x][2] == '+':\r\n resultX += 1\r\n\r\n \r\n elif strings[x][1] == '-' or strings[x][2] == '-':\r\n resultX -= 1\r\n \r\nprint(resultX)", "a=int(input())\r\ncount=0\r\nfor i in range(1,a+1):\r\n x=str(input())\r\n if x[0]==x[1]=='+' or x[1]==x[2]=='+':\r\n count+=1\r\n elif x[0]==x[1]=='-' or x[1]==x[2]=='-':\r\n count-=1\r\nprint(count)", "pos = 0\r\nneg = 0\r\n\r\nfor _ in range(int(input())):\r\n st = input()\r\n if \"+\" in st:\r\n pos += 1\r\n elif \"-\" in st:\r\n neg += 1\r\n else:\r\n pass\r\n\r\nprint(pos-neg)", "n = int(input())\nx = 0\nfor i in range(n):\n y = input()\n if \"++\" in y:\n x += 1\n elif \"--\" in y:\n x -= 1\nprint(x)\n\t\t \t\t\t \t\t \t\t\t\t\t \t\t \t \t\t\t \t", "res = 0\r\nfor _ in range(int(input())):\r\n line = input()\r\n if '+' in line:\r\n res += 1\r\n else:\r\n res -= 1\r\nprint(res)", "vlue = 0\r\n\r\nn = input()\r\n\r\nn = int(n)\r\n\r\nfor i in range(n):\r\n st_ment = input()\r\n if st_ment == \"--X\" or st_ment == \"X--\":\r\n vlue -= 1\r\n elif st_ment == \"++X\" or st_ment == \"X++\":\r\n vlue += 1\r\n\r\nprint(vlue)", "n = int(input())\r\nList = []\r\nx = 0\r\nfor i in range(n):\r\n List.append(input())\r\nfor num in List:\r\n if (num == \"++X\") or (num == \"X++\"):\r\n x += 1 \r\n elif (num == \"--X\") or (num == \"X--\"):\r\n x -= 1 \r\nprint(x)", "n=int(input())\r\ni=0\r\nx=0\r\nscore=0\r\nfullscore=0\r\ncmds = []\r\nwhile(i<n):\r\n w=str(input())\r\n cmds.append(w)\r\n i=i+1\r\ni=0\r\nwhile(i<n):\r\n if(\"++\" in cmds[i]):\r\n x=x+1\r\n elif(\"--\" in cmds[i]):\r\n x=x-1\r\n\r\n i=i+1\r\nprint(x)\r\n", "n = int(input())\nans = 0\nfor i in range(0,n):\n s = input()\n if s[1] == '+':\n ans += 1\n \n if s[1] == '-':\n ans -= 1\n \nprint(ans)", "n=int(input())\r\nx=0\r\nfor c in range(n):\r\n a=input()\r\n v=[s for s in a]\r\n for i in v:\r\n if i=='+':\r\n x+=1\r\n break\r\n if i=='-':\r\n x-=1\r\n break\r\nprint(x)", "x = 0\r\nn = int(input())\r\nwhile n != 0:\r\n bit_input = list(input())\r\n if bit_input.count('+') > 1:\r\n x+=1\r\n elif bit_input.count('-') > 1:\r\n x-=1\r\n n-=1\r\nprint(x)", "n= int(input())\r\nx=0\r\nfor i in range(n):\r\n opn=input()\r\n if (opn==\"++X\" or opn==\"X++\") :\r\n x+=1\r\n if (opn==\"--X\" or opn==\"X--\"):\r\n x-=1\r\nprint(x)", "x = int(input())\r\nans = 0\r\nwhile x > 0:\r\n x -= 1\r\n a = input()\r\n if a[1] == '+':\r\n ans += 1\r\n else:\r\n ans -= 1\r\nprint(ans)", "x = 0\r\nfor _ in range(int(input())):\r\n x = x + 1 if '+' in input() else x - 1\r\nprint(x)", "n = int(input())\r\ntotal = 0\r\nfor i in range(n) :\r\n a = input()\r\n if a == '++X' or a == 'X++' :\r\n total = total + 1\r\n elif a == '--X' or a == 'X--' :\r\n total = total - 1\r\nprint(total)", "def valueOfX(arr):\n x = 0\n for i in arr:\n if(i == \"++X\" or i == \"X++\"):\n x += 1\n elif(i == \"--X\" or i == \"X--\"):\n x -= 1\n print(x)\n \nn = int(input())\narr = []\nfor i in range(n):\n arr.append(input())\n\nvalueOfX(arr)\n \t \t\t\t\t\t\t\t \t\t\t \t\t\t\t \t", "def calc(n, x, arr, i):\r\n if n == 0:\r\n return x\r\n if '++' in arr[i]:\r\n return calc(n-1, x+1, arr, i + 1)\r\n else:\r\n return calc(n-1, x-1, arr, i+1)\r\n\r\n\r\nn = int(input())\r\narr = []\r\nfor _ in range(n):\r\n s = input()\r\n arr.append(s)\r\nprint(calc(n, 0, arr, 0))", "y = int(input())\r\nx= 0\r\nfor i in range(y):\r\n \r\n a = str(input())\r\n if a == '++X' or a ==\"X++\":\r\n x+=1\r\n if a == '--X' or a ==\"X--\":\r\n x -= 1\r\nprint(x)", "t=int(input())\r\ndef bit(operation):\r\n answer = 0\r\n for i in range(t):\r\n operation = input()\r\n if operation == \"X++\" or operation == \"++X\":\r\n answer += 1\r\n elif operation == \"X--\" or operation == \"--X\":\r\n answer -= 1\r\n return answer\r\nprint(bit(t))", "n = int(input())\r\nx = 0\r\n\r\nfor i in range(n):\r\n op = input()\r\n if (op == \"X++\") or (op == \"++X\"):\r\n x += 1\r\n elif (op == \"X--\") or (op == \"--X\"):\r\n x -= 1\r\n \r\nprint(x)", "n=int(input())\r\nsum=int(0)\r\nfor i in range(n):\r\n q=input()\r\n if q.count('-')>0: sum = sum - 1\r\n else: sum = sum + 1\r\nprint(sum)", "n= int(input())\r\nx=0\r\nfor i in range(n):\r\n s= input()\r\n if(s[1]=='+'):\r\n x=x+1\r\n else:\r\n x=x-1\r\n\r\nprint(x)", "t = int(input())\ncount = 0\nfor i in range(t):\n s = input()\n if s == \"++X\" or s == \"X++\":\n count += 1\n else:\n count -= 1 \n \nprint(count) ", "count=0\r\nfor i in range(int(input())):\r\n s=input()\r\n if s[1]=='+':\r\n count+=1\r\n elif s[1]=='-':\r\n count-=1\r\nprint(count) ", "n=int(input())\r\nx=0\r\nfor _ in range(n):\r\n c=input()\r\n if '++' in str(c):\r\n x+=1\r\n elif '--' in str(c):\r\n x-=1\r\nprint(x)", "ans = 0\r\nfor _ in range(int(input())):\r\n ans += 1 if input().__contains__('++') else -1\r\nprint(ans)", "n =int(input())\r\nj=0\r\nfor i in range(1,n+1):\r\n k=input()\r\n if(k=='++X' or k=='X++'):\r\n j+=1\r\n elif(k=='--X' or k=='X--'):\r\n j+=-1\r\nprint(j)", "n = int(input())\r\nresult = 0\r\nwhile n > 0:\r\n \r\n if '+' in input():\r\n result += 1\r\n else:\r\n result -= 1\r\n n -= 1\r\nprint(result)", "n = int(input())\n\nwhile n < 1 or n > 150 : \n n = int(input())\n\noprations = []\nfor i in range(n):\n myOp = input()\n oprations.append(myOp)\nX = 0\nfor opration in oprations : \n if opration == '++X' or opration == 'X++':\n X += 1\n else: \n X -= 1\nprint(X)\n\t \t\t\t \t\t\t \t \t \t\t\t \t \t\t\t\t\t", "n = int(input())\r\nX= 0\r\nfor i in range(n):\r\n line=input()\r\n if line.count(\"+\") == 2 :\r\n X+=1\r\n elif line.count(\"-\") == 2 :\r\n X-=1\r\nprint(X)\r\n \r\n ", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n c = input()\r\n if \"+\" in c:\r\n s += 1\r\n elif \"-\" in c:\r\n s -= 1\r\nprint(s)", "x=0\r\nfor _ in range(int(input())):\r\n s=input()\r\n if (s==\"X++\" or s==\"++X\"):\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)\r\n", "tem=int(input())\nz=0\nfor _ in range(tem):\n\tstr=input()\n\tif '++' in str:\n\t\tz+=1\n\telse:\n\t\tz-=1\nprint(z)\n \t \t \t\t \t\t \t \t \t\t\t\t\t \t\t", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n value=input()\r\n if \"+\" in value:\r\n x=x+1\r\n elif \"-\" in value:\r\n x=x-1\r\n\r\nprint(x)", "# import sys;input=sys.stdin.readline\r\n# import math\r\n\r\ndef yes(ch='\\n'):\r\n print(\"YES\",end=ch)\r\n return \r\n\r\ndef no(ch='\\n'):\r\n print(\"NO\",end=ch)\r\n return \r\n\r\n\r\ndef solve():\r\n n=int(input())\r\n ans=0\r\n for i in range(n):\r\n s=str(input())\r\n if '+' in s:\r\n ans+=1\r\n else:\r\n ans-=1\r\n print(ans)\r\n \r\n\r\n\r\n# for _ in range(int(input())):\r\nsolve()", "# The Code \r\n\r\nnum = int(input())\r\nx = 0\r\nfor n in range(num):\r\n statment = input()\r\n if \"++X\" in statment or \"X++\" in statment:\r\n x += 1\r\n elif \"--X\" in statment or \"X--\" in statment:\r\n x -= 1\r\nprint(x)\r\n\r\n# The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.\r\n\r\n#The language is that peculiar as it has exactly one variable, called x. Also, there are two operations:\r\n\r\n#Operation ++ increases the value of variable x by 1.\r\n#Operation -- decreases the value of variable x by 1.\r\n#A statement in language Bit++ is a sequence, consisting of exactly one operation and one variable x. The statement is written without spaces, that is, it can only contain characters \"+\", \"-\", \"X\". Executing a statement means applying the operation it contains.\r\n\r\n#A programme in Bit++ is a sequence of statements, each of them needs to be executed. Executing a programme means executing all the statements it contains.\r\n\r\n#You're given a programme in language Bit++. The initial value of x is 0. Execute the programme and find its final value (the value of the variable when this programme is executed).\r\n\r\n#Input\r\n#The first line contains a single integer n (1 ≤ n ≤ 150) — the number of statements in the programme.\r\n\r\n#Next n lines contain a statement each. Each statement contains exactly one operation (++ or --) and exactly one variable x (denoted as letter «X»). Thus, there are no empty statements. The operation and the variable can be written in any order.\r\n\r\n#Output\r\n#Print a single integer — the final value of x.\r\n\r\n\r\n \r\n \r\n ", "n = int(input())\r\n\r\nlst = []\r\n\r\nfor i in range(1, n+1):\r\n lst.append(input())\r\n\r\nx = 0\r\nplus = ['X++', '++X']\r\nfor i in lst:\r\n if i in plus:\r\n x += 1\r\n else:\r\n x = x - 1\r\n\r\nprint(x)", "t = int(input()) \r\nx = 0 \r\nfor _ in range(t) :\r\n statement = input() \r\n if \"++\" in statement :\r\n x+=1 \r\n else :\r\n x-=1 \r\nprint(x) ", "n = int(input())\r\noperation = []\r\nx = 0\r\nfor i in range(n):\r\n operation.append(input())\r\nfor i in operation:\r\n if i == '++X' or i == 'X++':\r\n x += 1\r\n elif i== '--X' or i == 'X--':\r\n x -= 1\r\nprint(x)", "n = int(input())\r\nx = 0\r\nfor i in range(n) :\r\n statement =input()\r\n if \"++\" in statement :\r\n x+=1\r\n else :\r\n x-=1\r\nprint(x)", "n = int(input())\r\nx = 0\r\nfor a in range(1, n+1):\r\n b = str(input())\r\n if b == \"++X\" or b ==\"X++\" or b == \"+X+\":\r\n x += 1\r\n elif b==\"--X\" or b==\"-X-\" or b==\"X--\":\r\n x -= 1\r\n else:\r\n x = 0\r\n\r\nprint(x)", "t=int(input())\r\nk=0\r\nfor i in range(t):\r\n s=input()\r\n if s[1]=='+':\r\n k+=1\r\n else:\r\n k-=1\r\nprint(k)", "# Read the number of statements in the program\nn = int(input())\n\n# Initialize the variable x to 0\nx = 0\n\n# Execute each statement in the program\nfor _ in range(n):\n statement = input()\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n\n# Print the final value of x\nprint(x)#er\n \t\t \t \t\t\t \t\t \t\t \t \t", "n = int(input())\r\nans = 0\r\nfor i in range (n):\r\n\tnum = input()\r\n\tif '++' in num: ans += 1\r\n\telse : ans -= 1\r\n\r\n\r\nprint(ans)\r\n", "def bit(n):\r\n total = 0\r\n if len(n) == 3 and '++' in n and 'X' in n:\r\n total += 1\r\n elif len(n) == 3 and '--' in n and 'X' in n:\r\n total -= 1\r\n return total\r\n\r\nx = 0 \r\nn = int(input())\r\nfor i in range(n):\r\n operation = input()\r\n x += bit(operation)\r\nprint(x)\r\n \r\n", "pl = 0\r\nmi = 0\r\nfor i in range(int(input())):\r\n op = input()\r\n if \"++\" in op:\r\n pl += 1\r\n continue\r\n mi += 1\r\nprint(pl - mi)\r\n", "a=int(input())\r\nb=0\r\nfor i in range(a):\r\n d=input()\r\n if d[1]==\"+\":\r\n b+=1\r\n else:\r\n b-=1\r\nprint(b)", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n ele=input()\r\n if ele[1]==\"+\":\r\n ans+=1\r\n else:\r\n ans-=1\r\n \r\nprint(ans)", "number=int(input())\r\ncount=0\r\nfor i in range(number):\r\n string=str(input())\r\n if string[0]==\"+\" or string[len(string)-1]=='+':\r\n count+=1\r\n elif(string[0]=='-' or string[len(string)-1]=='-'):\r\n count-=1\r\nprint(count)", "# Read the number of statements\nn = int(input())\n\n# Initialize the variable x\nx = 0\n\n# Iterate through each statement and update the value of x\nfor _ in range(n):\n statement = input()\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n\n# Print the final value of x\nprint(x)\n", "n=int(input())\r\nx=0\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\n if a[i]=='++X' or a[i]=='X++' or a[i]=='+X+':\r\n x+=1\r\n elif a[i]=='--X' or a[i]=='X--' or a[i]=='-X-':\r\n x-=1\r\nprint(x)", "ans=0\r\nfor _ in range(int(input())):\r\n s=input()\r\n if s[1]=='+':\r\n ans+=1\r\n else:\r\n ans-=1\r\nprint(ans)", "n=0\nwhile(1):\n n=int(input())\n if n>=1 and n<=150:\n break\n\noperate=[]\n\nfor i in range(n):\n operate.append(input())\n\nX=0\nfor i in range(n):\n\n if operate[i]==\"X++\" or operate[i]==\"++X\":\n X=X+1\n elif operate[i]==\"--X\" or operate[i]==\"X--\":\n X=X-1\n\nprint(X)\n\n\n", "n = int(input())\r\nx = 0\r\n\r\nfor _ in range(n):\r\n y = input()\r\n if '--' in y:\r\n x-=1\r\n if '++' in y:\r\n x+=1\r\n\r\nprint(x)", "n=int(input())\r\nx=0;\r\nwhile(n>0):\r\n s=input()\r\n if(s[0]==\"-\"):\r\n x=x-1\r\n elif(s[0]==\"+\"):\r\n x=x+1\r\n elif(s[2]==\"-\"):\r\n x=x-1\r\n else:\r\n x=x+1\r\n n=n-1\r\n \r\nprint(x)", "n = int(input())\r\na=[]\r\nX=0\r\nfor e in range(n):\r\n x=str(input())\r\n a.append(x)\r\nfor i in range(len(a)):\r\n if (a[i][1]) == '-':\r\n X-=1\r\n elif (a[i][1]) == '+':\r\n X+=1\r\nprint(X)\r\n", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n str=input()\r\n if \"++\" in str:\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "a=int(input())\r\nans=0\r\nfor i in range(a):\r\n b=input()\r\n if (b==\"X++\" or b==\"++X\" or b==\"+X+\"):\r\n ans=ans+1\r\n else:\r\n ans=ans-1\r\nprint(ans)", "import sys\r\n\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nX = 0\r\nfor _ in range(n):\r\n s = input()\r\n X += 1 if \"++\" in s else -1\r\nprint(X)", "n=int(input())\r\ns=0\r\na=[]\r\nfor i in range(n):\r\n b=input()\r\n a.append(b)\r\n if '+' in b:\r\n s=s+1\r\n if '-' in b:\r\n s=s-1\r\nprint(s)", "n = int(input())\r\nx = 0\r\nfor i in range(n):\r\n text = input()\r\n if text == '++X' or text == 'X++':\r\n x += 1\r\n elif text == '--X' or text == 'X--':\r\n x -= 1\r\nprint(x)", "inp1 = int(input())\r\nct = 0\r\nfor i in range(inp1):\r\n inp = input()\r\n if \"++\" in inp:\r\n ct += 1\r\n if \"--\" in inp:\r\n ct -= 1\r\nprint(ct)", "x=0\r\nfor i in range(int(input())):\r\n n=input()\r\n \r\n if \"+\" in n :\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n tx = input()\r\n if tx == 'X++' or tx == '++X':\r\n count += 1\r\n elif tx == 'X--' or tx == '--X':\r\n count -= 1\r\nprint(count)", "n=int(input())\r\ncount=0\r\na=\"++X\"\r\nb=\"--X\"\r\nc=\"X++\"\r\nd=\"X--\"\r\nfor i in range(n):\r\n x=input()\r\n if x==a or x==c:\r\n count+=1\r\n elif x==b or x==d:\r\n count=count-1\r\nprint(count)\r\n", "print(sum(1-2*('-'in s)for s in[*open(0)][1:]))\r\n", "import sys\r\nres=0\r\nn=int(sys.stdin.readline().split()[0])\r\nfor i in range (n):\r\n m=(sys.stdin.readline())\r\n if m.count(\"++\"):\r\n res+=1\r\n else:\r\n res-=1\r\nprint(res)\r\n ", "\r\n\r\nn = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n op = input()\r\n if \"+\" in op:\r\n ans += 1\r\n else:\r\n ans -= 1\r\n\r\nprint(ans)", "n = int(input())\r\nx = 0\r\nfor i in range(n):\r\n s = input()\r\n if (s ==\"X++\"or s==\"++X\"):\r\n x = x+1 \r\n else :\r\n x = x-1\r\nprint(x)", "n=int(input())\r\nr=0\r\nfor i in range(n):\r\n s=input()\r\n \r\n for i in s:\r\n if i=='+':\r\n r+=1\r\n break\r\n if i=='-':\r\n r-=1\r\n break\r\nprint(r)", "n=int(input())\r\ns=[]\r\nfor i in range (n):\r\n x=input().lower()\r\n for a in x :\r\n if a == \"+\" or a == \"-\":\r\n s.append(a)\r\nn1=(s.count(\"+\"))\r\nn2=(s.count(\"-\"))\r\nif n1>= n2 or n2 > n1:\r\n print(int ((n1-n2)/2 ))\r\nelif n1 >0 and n2== 0 :\r\n print(int (n1/2 ))\r\nelif n2>0 and n1 == 0:\r\n print(-1 * int ((n2/2)))", "n = int(input())\r\nans = 0\r\nwhile n > 0:\r\n query = input()\r\n if query == 'X++' or query == '++X':\r\n ans += 1\r\n else:\r\n ans -= 1\r\n n -= 1\r\nprint(ans)", "n=int(input())\r\nx=0.0\r\nfor i in range(n):\r\n string=input()\r\n for char in string:\r\n if char == '+':\r\n x+=0.5\r\n if char == '-':\r\n x-=0.5\r\nprint(int(x))\r\n\r\n\r\n", "a=int(input())\r\ncount=0\r\nfor i in range(a):\r\n y=input()\r\n if (y==\"X++\" or y==\"++X\"):\r\n count+=1\r\n if (y==\"X--\" or y==\"--X\"):\r\n count-=1\r\nprint(count)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n b=input()\r\n if b[1]==\"+\":\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)\r\n ", "k=int(input())\r\nx=0\r\nfor i in range(k):\r\n t=input()\r\n if '++X' in t or 'X++' in t:\r\n x=x+1\r\n elif '--X' in t or 'X--' in t:\r\n x=x-1\r\nprint(x)", "def main():\n\n num_of_lines = int(input())\n\n X = 0\n\n for i in range(num_of_lines):\n\n line = input()\n if \"+\" in line:\n X += 1\n\n else:\n X -= 1\n\n print(X)\n\nmain()\n \t\t \t \t\t \t\t\t \t\t \t\t\t \t\t", "s=0\r\nfor _ in range(int(input())):\r\n a=input()\r\n if \"+\" in a:\r\n s+=1\r\n else:\r\n s-=1\r\nprint(s)", "#!/usr/bin/env pypy3\n# https://codeforces.com/problemset/problem/282/A\nn, x = int(input()), 0\nwhile n:\n n -= 1\n command = input()\n if command == \"++X\" or command == \"X++\":\n x += 1\n else:\n x -= 1\nprint(x)\n", "n = int(input())\r\n\r\ncount = 0\r\nfor i in range(n):\r\n com = input()\r\n if com[0]==\"+\" or com[1]==\"+\" or com[2]==\"+\":\r\n count+=1\r\n else:\r\n count-=1\r\n\r\nprint(count)", "'''\r\nwhile(True):\r\n\tdef One_Digit(n):\r\n\t\twhile(n>=10):\r\n\t\t\tn=sum(int(digit)\r\n\t\t\tfor(digit) in str(n))\r\n\t\treturn(n)\r\n\tn=int(input(\"Введите число:\"))\r\n\tif(n>0 and n<1000000000000):\r\n\t\totvet=One_Digit(n)\r\n\t\tprint(\"Сумма цифр:\",otvet)\r\n\tif(n>1000000000000):\r\n\t\tprint(\"Число должно быть меньше 1000000000000!\")\r\n\tif(n<0):\r\n\t\tprint(\"Число должно быть положительным!\")\r\n'''\r\n'''\r\nwhile(True):\r\n\tx=int(input(\"Введите число:\"))\r\n\tif(x%6==0 and x<360):\r\n\t\totv=60-x/6\r\n\t\tprint(\"Минут осталось:\",int(otv))\r\n\tif(x>360):\r\n\t\tprint(\"Число должно быть меньше 360!\")\r\n\tif(x%6):\r\n\t\tprint(\"Число должно делиться на шесть!\")\r\n'''\r\n'''\r\nwhile(True):\r\n\tn=int(input(\"Введите число:\"))\r\n\totv=n+2\r\n\tprint(\"Можно насчитать\",otv,\"ног(и)\")\r\n'''\r\n'''\r\nwhile(True):\r\n\tindex=int(input(\"Введите индекс:\"))\r\n\tindex_str=str(index)\r\n\tindex_len=len(index_str)\r\n\tif(index_len==6 and index_len<1000000000):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n'''\r\n'''\r\nwhile(True):\r\n\tindex=input(\"Введите число:\")\r\n\tif(len(index) == 6 and index.isdigit()):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n'''\r\n'''\r\nwhile(True):\r\n\tprint(\"1.Введите количество столбиков на которых держится забор.\")\r\n\tprint(\"2.Введите сколько дощечек в каждой секции забора.\")\r\n\tN,K=input(\">>>\").split()\r\n\tn=int(N)\r\n\tk=int(K)\r\n\tif(n==3):\r\n\t\tprint(\"0\")\r\n\telif(n==4):\r\n\t\tprint(\"20\")\r\n\telse:\r\n\t\tn=n-3\r\n\t\ta=n-1\r\n\t\tL=k-1\r\n\t\tprint(20*n+3*2*a+k*12*a+a*5*L)\r\n'''\r\n'''\r\nnum1=int(input(\"Введите десятеричный формат:\"))\r\nnum2=num1/16\r\nnum3=num2/16\r\nif(num3==num3,.14):\r\n\tnum4=\"E\"\r\n\tnum5=num3/16\r\n\tprint(num5,num4,num3)\r\n'''\r\n'''\r\nwhile(True):\r\n\tdos=int(input(\"Введите число:\"))\r\n\tprint(f'Шестнадцатеричное: {dos:X}')\r\n'''\r\n'''\r\nwhile(True):\r\n\tprint(\"1.Первые два значения-чётные.\")\r\n\tprint(\"2.Вторые два значения-нечётные.\")\r\n\ta,b,x,y=map(int,input(\">>>\").split())\r\n\tmax_int=max(a,b,x,y)\r\n\totv2_1=0\r\n\totv2_2=0\r\n\totv2_3=0\r\n\tif(max_int==a):\r\n\t\totv1=max_int+b\r\n\t\totv2=max_int+x\r\n\t\totv3=max_int+y\r\n\t\tif(otv1%2!=0):\r\n\t\t\totv2_1=otv1\r\n\t\tif(otv2%2!=0):\r\n\t\t\totv2_2=otv2\r\n\t\tif(otv3%2!=0):\r\n\t\t\totv2_3=otv3\r\n\t\totv_str=otv2_1,otv2_2,otv2_3\r\n\t\tmax_int2=max(otv_str)\r\n\t\tprint(max_int2)\r\n\tif(max_int==b):\r\n\t\totv1=max_int+a\r\n\t\totv2=max_int+x\r\n\t\totv3=max_int+y\r\n\t\tif(otv1%2!=0):\r\n\t\t\totv2_1=otv1\r\n\t\tif(otv2%2!=0):\r\n\t\t\totv2_2=otv2\r\n\t\tif(otv3%2!=0):\r\n\t\t\totv2_3=otv3\r\n\t\totv_str=otv2_1,otv2_2,otv2_3\r\n\t\tmax_int2=max(otv_str)\r\n\t\tprint(max_int2)\r\n\tif(max_int==x):\r\n\t\totv1=max_int+a\r\n\t\totv2=max_int+b\r\n\t\totv3=max_int+y\r\n\t\tif(otv1%2!=0):\r\n\t\t\totv2_1=otv1\r\n\t\tif(otv2%2!=0):\r\n\t\t\totv2_2=otv2\r\n\t\tif(otv3%2!=0):\r\n\t\t\totv2_3=otv3\r\n\t\totv_str=otv2_1,otv2_2,otv2_3\r\n\t\tmax_int2=max(otv_str)\r\n\t\tprint(max_int2)\r\n\tif(max_int==y):\r\n\t\totv1=max_int+a\r\n\t\totv2=max_int+b\r\n\t\totv3=max_int+x\r\n\t\tif(otv1%2!=0):\r\n\t\t\totv2_1=otv1\r\n\t\tif(otv2%2!=0):\r\n\t\t\totv2_2=otv2\r\n\t\tif(otv3%2!=0):\r\n\t\t\totv2_3=otv3\r\n\t\totv_str=otv2_1,otv2_2,otv2_3\r\n\t\tmax_int2=max(otv_str)\r\n\t\tprint(max_int2)\r\n'''\r\n''''\r\nwhile(True):\r\n\timport random\r\n\tx=random.choice([\"Паша\",\"Петя\"])\r\n\tinput(\"Нажмите Enter чтобы узнать кто победил в споре\")\r\n\tprint(\"В споре победил:\",x)\r\n'''\r\n'''\r\nn = int(input())\r\nprint(-1 if n <4 else(n+3)//5)\r\n'''\r\n'''\r\nn = int(input())\r\nm = int(input())\r\nif n > m:\r\n n = m\r\nL = 0\r\nR = n + 2\r\nwhile R - L > 1:\r\n mid = (L + R) // 2\r\n if (mid+n)*(n-mid+1)//2>=m:\r\n L=mid\r\n else:\r\n R=mid\r\nif(L+n) * (n - L + 1) // 2 < m:\r\n print(0)\r\nelse:\r\n for i in range(R, n + 1):\r\n print(i)\r\n s=(R+n)*(n-R+1)//2\r\n if(m-s>0):\r\n print(m-s)\r\n'''\r\n'''\r\nnum1,num2=map(int,input(\"\").split())\r\nnum3,num4=map(int,input(\"\").split())\r\nmin1=min(num1,num2)\r\nmin2=min(num3,num4)\r\nprint(min1+1,\",\",min2+1)\r\n'''\r\n'''\r\ndef find_min_number(N):\r\n if N == 0:\r\n return -1\r\n if N == 1:\r\n return 1\r\n digits = []\r\n for i in range(9, 1, -1):\r\n while N % i == 0:\r\n digits.append(i)\r\n N /= i\r\n if N != 1:\r\n return -1\r\n return int(''.join(map(str, digits[::-1])))\r\nN = int(input())\r\nmin_number = find_min_number(N)\r\nprint(min_number)\r\n'''\r\n'''\r\na=int(input(\"Введите число истинных заявлений:\"))\r\nb=a+1\r\nc=b+1\r\nd=c+1\r\nprint(\"Рыцарь сделал первое заявление:\",a,\"+1=\",b)\r\nprint(\"Лжец сделал заявление:\",b,\"+1=\",c)\r\nprint(\"Рыцарь сделал второе заявление:\",c,\"+1=\",d)\r\nprint(\"Ответ:\",d)\r\n'''\r\n'''\r\nn = int(input())\r\nprohods=1\r\nif(n<=6):\r\n prohods=1\r\n print(prohods)\r\nif(n>6):\r\n\tprohods+=(n-6)//4+1\r\n\tprint(prohods)\r\n'''\r\n'''\r\na=int(input(\"\"))\r\nb=int(input(\"\"))\r\nc=int(input(\"\"))\r\nd=a+b+c\r\nprint(d)\r\n'''\r\n'''\r\nn=int(input())\r\npeople=1\r\nif(n%2==0):\r\n people+=n//2-1\r\nelse:\r\n people+=(n-1)//2+3\r\nprint(people)\r\n'''\r\n'''\r\nn=int(input())\r\nt=input()\r\nupper_count=sum(1 for c in t if c.isupper())\r\nlower_count=sum(1 for c in t if c.islower())\r\nif(abs(upper_count-lower_count)<=1):\r\n print(\"JOKE\")\r\nelse:\r\n print(\"SERIOUS\")\r\n'''\r\n'''\r\nn = int(input())\r\nhouses = list(map(int, input().split()))\r\nmax_distance = houses[-1] - houses[0]\r\nfor i in range(1, n):\r\n max_distance = max(max_distance, houses[i] - houses[0], houses[-1] - houses[i])\r\nprint(max_distance)\r\n'''\r\n'''\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ndp = [0] * (n+1)\r\nfor i in range(n):\r\n if arr[i] % 2 == 0:\r\n dp[1] = max(dp[1], arr[i])\r\n for j in range(i, 0, -1):\r\n if (arr[i] + dp[j]) % 2 == 0:\r\n dp[j+1] = max(dp[j+1], arr[i] + dp[j])\r\n\r\nprint(*dp[1:])\r\n'''\r\n'''\r\ny=int(input(\"\"))\r\nif(y%4):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n'''\r\n'''\r\na,b,c=map(int,input(\"\").split())\r\notv1=a*b\r\notv2=otv1*c\r\nprint(otv2)\r\n'''\r\n'''\r\na=int(input())\r\nresult=[]\r\nfor k in range(a * 10, (a + 1) * 10):\r\n for d in range(2, k + 1):\r\n if k % d == 0 and sum(int(digit) for digit in str(k)) % d == 0:\r\n result.append(k)\r\nprint(' '.join(str(num) for num in result))\r\n'''\r\n'''\r\nN = int(input())\r\nS = input()\r\n\r\nmax_troll=0\r\nmax_troll_string = \"\"\r\n\r\nfor i in range(N):\r\n for j in range(i + 1, N + 1):\r\n substring = S[i:j]\r\n if substring.count(\"A\") > 0 and substring.count(\"Z\") > 0:\r\n if len(substring) > max_troll:\r\n max_troll = len(substring)\r\n max_troll_string = substring\r\n\r\nprint(max_troll_string)\r\n'''\r\n'''\r\nn, k = map(int, input().split())\r\narray = list(map(int, input().split()))\r\n\r\ncount_divisible_two = 0\r\n\r\nfor _ in range(k):\r\n result = []\r\n for i in range(len(array)):\r\n for j in range(i + 1, len(array)):\r\n result.append(array[i] * array[j])\r\n array = result\r\n\r\nfor num in array:\r\n if num % 2 == 0:\r\n count_divisible_two += 1\r\n\r\nprint(count_divisible_two)\r\n'''\r\n'''\r\nn=int(input(\"\"))\r\nf=int(input(\"\"))\r\nif(f==0):\r\n print((n-2)**3)\r\nelif(f==1):\r\n print(6*(n-2)**2)\r\nelif(f==2):\r\n print(12*(n-2))\r\nelif(f==3):\r\n print(8)\r\n'''\r\n'''\r\na=int(input(\"\"))\r\nb=int(input(\"\"))\r\nc=int(input(\"\"))\r\nmax_num=max(a,b,c)\r\nmin_num=min(a,b,c)\r\nsum_num=a+b+c-max_num-min_num\r\nnum=0\r\nwhile(min_num+sum_num>max_num):\r\n\tmax_num=max_num-1\r\n\tmin_num=min_num-1\r\n\tsum_num=sum_num-1\r\n\tnum=num-1\r\n\tif(min_num+sum_num<=max_num):\r\n\t\tprint(num*-1)\r\n'''\r\n'''\r\nnum1=int(input(\"\"))\r\nnum2=int(input(\"\"))\r\nnum3=int(input(\"\"))\r\nresult=\"False\"\r\nif(num1>num2+num3):\r\n\tresult=\"True\"\r\nprint(result)\r\n'''\r\n'''\r\nnum1=input(\"Введите букву клетки: \")\r\nnum2=int(input(\"Введите цифру клетки: \")\r\n'''\r\n'''\r\nwhile(True):\r\n\tinput_str=input(\"Введите координаты клетки: \")\r\n\tword,num1=input_str\r\n\tresult=\"White\"\r\n\tnum2=int(num1)\r\n\tif(word==\"A\" or word==\"C\" or word==\"E\" or word==\"G\"):\r\n\t\tnum2+=1\r\n\tif(word==\"a\" or word==\"c\" or word==\"e\" or word==\"g\"):\r\n\t\tnum2+=1\r\n\tif(word==\"B\" or word==\"D\" or word==\"F\" or word==\"H\"):\r\n\t\tnum2+=0\r\n\tif(word==\"b\" or word==\"d\" or word==\"f\" or word==\"h\"):\r\n\t\tnum2+=0\r\n\tif(num2%2==0):\r\n\t\tresult=\"Black\"\r\n\t\tprint(result)\r\n\t\tprint(\"-------------------------------\")\r\n\tif(num2%1 and not num2%2):\r\n\t\tresult=\"White\"\r\n\t\tprint(result)\r\n\t\tprint(\"-------------------------------\")\r\n\telse:\r\n\t\tprint(\"Координаты введены неверно!\")\r\n'''\r\n'''\r\nx=int(input(\"\"))\r\ny=int(input(\"\"))\r\nresult=\"\"\r\nfor x in range(0, int(x)):\r\n\tfor y in range(0, int(y)):\r\n\t\tif(x+y==y and x*y==y):\r\n\t\t\tresult=str(x)+\"\"+str(y)\r\n\t\tprint(result)\r\n'''\r\n'''\r\ntext=input(\"Введите текст:\")\r\nwith open(\"Text.txt\", \"w\") as file:\r\n file.write(text)\r\nwith open(\"Text.txt\",\"r\") as file:\r\n file_read=file.read()\r\n'''\r\n'''\r\nN,K=map(int,input().split())\r\nnum1=(N+K-1)//K\r\nprint(num1)\r\n'''\r\n'''\r\nn=int(input())\r\ndivisors_sum=0\r\nfor i in range(1, n+1):\r\n if(n%i==0):\r\n divisors_sum+=i\r\nprint(divisors_sum)\r\n'''\r\n'''\r\nn = int(input())\r\nif n == 1:\r\n print(0)\r\nelse:\r\n print(n-1)\r\n'''\r\n'''\r\ndays=int(input())\r\nflowers=['G', 'C', 'V']\r\ncenter_index=1\r\nfor i in range(days):\r\n flowers[center_index], flowers[center_index+1] = flowers[center_index+1], flowers[center_index]\r\n flowers[center_index-1], flowers[center_index] = flowers[center_index], flowers[center_index-1]\r\nprint(''.join(flowers))\r\n'''\r\n'''\r\nn=int(input())\r\nif(n and(n-1)==0):\r\n print(n-1)\r\nelse:\r\n m=1\r\n while m<n:\r\n m*=2\r\n print(m//2)\r\n'''\r\n'''\r\nk=int(input())\r\ndef Buy(k):\r\n for i in range(k//3+1):\r\n for x in range(k//5+1):\r\n if(i*3+x*5==k):\r\n return \"Yes\"\r\n return \"No\"\r\nprint(Buy(13))\r\n'''\r\n'''\r\nr=int(input())\r\nif(r%2==0):\r\n\tnum1=r//2\r\n\tprint(num1)\r\nelif(r==1):\r\n\tnum1=0\r\n\tprint(num1)\r\nelse:\r\n\tprint(r)\r\n'''\r\n'''\r\ns,d,f=map(int,input().split())\r\nnum1=s*(d*f*2)\r\nprint(num1)\r\n'''\r\n'''\r\nt = int(input())\r\nfor i in range(t):\r\n s = input()\r\n codeforces = \"codeforces\"\r\n diff = 0\r\n for j in range(10):\r\n if s[j] != codeforces[j]:\r\n diff += 1\r\n print(diff)\r\n'''\r\n'''\r\na,b=map(int,input().split())\r\nnum1=a/float(b)\r\nif(num1>0 and num1<0.5):\r\n\tprint(2)\r\nelif(num1>0 and num1<1.0):\r\n\tprint(2)\r\nelif((num1-int(num1))>0 and (num1-int(num1))<=0.5):\r\n\tprint(int(num1)*2+1)\r\nelif((num1-int(num1))>0.5 and (num1-int(num1))<=1.0):\r\n\tprint(int(num1)*2+2)\r\nelse:\r\n\tprint(int(num1)*2)\r\n'''\r\n'''\r\na,b,c=map(int,input().split())\r\nprint((a+b+c)//2)\r\n'''\r\n'''\r\nn=int(input())\r\nsecond_digit=9\r\nthird_digit=9-n\r\nresult=str(second_digit)+str(third_digit)\r\nprint(str(n)+result)\r\n'''\r\n'''\r\nnum1,num2=[int(num) for num in input().split()]\r\nnum3,num4=[int(num) for num in input().split()]\r\nnum5,num6=[int(num) for num in input().split()]\r\notv1=num1-num5\r\notv2=num2-num4\r\nprint(otv1,otv2)\r\n'''\r\n'''\r\nN,M,P,L=map(int,input().split())\r\nnum1=M+P-N+L\r\nnum2=M-num1\r\nnum3=P-num1\r\nprint(num1,num2,num3)\r\n'''\r\n'''\r\nn,k=map(int,input().split())\r\nnum1=2*k\r\nprint(num1-19)\r\n'''\r\n'''\r\ns,t=map(int,input().split())\r\nif(t>s):\r\n print(t-s)\r\nelse:\r\n print(12-s+t)\r\n'''\r\n'''\r\nl,w,h=map(int,input().split())\r\nprint((l*h*2+w*h*2+15)//16)\r\n'''\r\n'''\r\nn = int(input())\r\nif(n>0 and (n&(n-1))==0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n'''\r\n'''\r\na,b=map(int,input().split())\r\nprint(abs((b+1)//2-(a+1)//2))\r\n'''\r\n'''\r\nn=int(input())\r\nnum1=0\r\nnum2=0\r\nwhile(num2!=n):\r\n\tnum2=num2+num1\r\n\tnum1=num1+1\r\nnum3=num1-1\r\nprint(num3)\r\n'''\r\n'''\r\nscores=[]\r\nfor _ in range(4):\r\n a,b=map(int, input().split())\r\n scores.append((a, b))\r\nteam1_score=sum(a for a, _ in scores)\r\nteam2_score=sum(b for _, b in scores)\r\n\r\nif(team1_score>team2_score):\r\n print(1)\r\nelif(team1_score < team2_score):\r\n print(2)\r\nelse:\r\n print(\"DRAW\")\r\n'''\r\n'''\r\nfirst_code = input().strip()\r\nsecond_code = input().strip()\r\nlast_code = first_code\r\nfor i in range(10000):\r\n current_code = f'{i:04}'\r\n if(current_code==last_code):\r\n continue\r\n if(current_code==second_code):\r\n print(\"YES\")\r\n break\r\n last_code = current_code\r\nelse:\r\n print(\"NO\")\r\n'''\r\n'''\r\na,b=map(int,input().split())\r\nif(a<b):\r\n\ta,b=b,a\r\nprint((a+1)//2,b)\r\n'''\r\n'''\r\nb=int(input())\r\na=int(input())\r\nif(b%2==0):\r\n\tprint(\"YES\")\r\nelif(b==0):\r\n\tprint(\"YES\")\r\nelif(a%2!=0):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n'''\r\n'''\r\nx=input()\r\nn=int(input())\r\nif(x==\"Home\" and n==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n'''\r\n'''\r\nn=int(input())\r\nnum1=-1\r\nnum2=-1\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if(b==1):\r\n if(num1==-1 or a>num1):\r\n num1=a\r\n num2=i+1\r\nprint(num2)\r\n'''\r\n'''\r\na=int(input())\r\nnum1=a+a//2\r\nnum1=num1+num1//2\r\nnum1=num1+num1//2\r\na=a+a/2\r\na=a+a/2\r\na=a+a/2\r\nif(num1==a):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\r\n'''\r\n'''\r\nn,k=map(int,input().split())\r\nnum1=n-k\r\nnum2=k-num1\r\nprint(num2)\r\n'''\r\n'''\r\na,b,c,d=map(int,input().split())\r\nif(d>=c):\r\n\td=d-c-1\r\n\tnum1=d*(a+2*b)+2*b\r\nelse:\r\n\tc=c-d+1\r\n\tnum1=(c-1)*(a+2*b)+a\r\nprint(num1)\r\n'''\r\n'''\r\nn=int(input())\r\nnum1=0\r\nnum2=0\r\nfor _ in range(n):\r\n num3=int(input())\r\n if(num3==1):\r\n num1=num1+1\r\n else:\r\n num2=num2+1\r\nnum4=min(num1,num2)\r\nprint(num4)\r\n'''\r\n'''\r\ndef find_approx_equal_numbers(n,m):\r\n num1=n//m\r\n num2=n%m\r\n num3=[]\r\n for _ in range(m-num2):\r\n num3.append(num1)\r\n for _ in range(num2):\r\n num3.append(num1+1)\r\n return ' '.join(map(str,num3))\r\nn,m=map(int, input().split())\r\nnum4=find_approx_equal_numbers(n,n)\r\nprint(num4)\r\n'''\r\n'''\r\nn=int(input())\r\nf=[0,1]\r\nnum1=n+1\r\nfor i in range(2,num1):\r\n\tf.append(f[i-1]+f[i-2])\r\nnum2=f[n]\r\nprint(num2)\r\n'''\r\n'''\r\nbutton_sequence=input()\r\nmax_floor=0\r\nmin_floor=0\r\ncurrent_floor=0\r\nfor button in button_sequence:\r\n if button=='1':\r\n current_floor+=1\r\n elif button=='2':\r\n current_floor-=1\r\n max_floor=max(max_floor,current_floor)\r\n min_floor=min(min_floor,current_floor)\r\ntotal_floors=max_floor-min_floor+1\r\nprint(total_floors)\r\n'''\r\n'''\r\nn=input()\r\ncount=0\r\nfor digit in n:\r\n if digit in ['0','6','9']:\r\n count+=1\r\n elif digit=='8':\r\n count+=2\r\nprint(count)\r\n'''\r\n'''\r\nn=input()\r\nnum1=ord(n[0])-ord('A')\r\nnum2=int(n[1])-1\r\nif(num1+num2)%2==0:\r\n print(\"BLACK\")\r\nelse:\r\n print(\"WHITE\")\r\n'''\r\n'''\r\na,b=map(int,input().split())\r\nnum1=max(2*b+40,2*a+39)\r\nprint(num1)\r\n'''\r\n'''\r\na,b,c,e,f,g=map(int,input().split())\r\nnum1=sorted([a,b,c],reverse=True)\r\nnum2=sorted([e,f,g],reverse=True)\r\nnum3=sum([num1*num2 for num1,num2 in zip(num1,num2)])\r\nprint(num3)\r\n'''\r\n'''\r\nw=input()\r\nx=int(input())\r\nif(w==\"Home\" and x%2==0):\r\n\tprint(\"YES\")\r\nif(w==\"Home\" and x%2!=0):\r\n\tprint(\"YES\")\r\nif(w==\"School\" and x%2==0):\r\n\tprint(\"NO\")\r\nif(w==\"School\" and x%2!=0):\r\n\tprint(\"YES\")\r\n'''\r\n'''\r\nnum1=[1,\"mon\",\"tue\",\"wed\",\"thu\",\"fri\",\"sat\",\"sun\"]\r\nx,y=map(int,input().split())\r\nif(x%y==0 or y%x==0):\r\n print(max(y,x),num1[(max(y,x)%7)+1])\r\nelse:\r\n print(y*x,num1[(y*x%7)+1])\r\n'''\r\n'''\r\nn=int(input())\r\nnum1=1\r\nnum2=1\r\nwhile(num2<n):\r\n\tif(num2%2!=0):\r\n\t\tnum1=num1+(num2+1)\r\n\telse:\r\n\t\tnum1-=(num2+1)\r\n\tnum2=num2+1\r\nif(num1%2==0):\r\n\tprint(\"black\")\r\nelse:\r\n\tprint(\"grimy\")\r\n'''\r\n'''\r\nn=input().strip()\r\nn=n.replace(\"00000000000000000000000001\",\"y\")\r\nn=n.replace(\"001\",\"c\")\r\nn=n.replace(\"01\",\"b\")\r\nn=n.replace(\"1\",\"a\")\r\nprint(n)\r\n'''\r\n'''\r\nt=1\r\narr=[]\r\nfor i in range(3):\r\n\tarr.append(list(input()))\r\nfor i in range(3):\r\n\tif(arr[i][0]==arr[i][1]==arr[i][2] or arr[0][i]==arr[1][i]==arr[2][i]):\r\n\t\tif arr[i][i]=='X':\r\n\t\t\tprint('Win')\r\n\t\t\tbreak\r\n\t\telif(arr[i][i]=='O'):\r\n\t\t\tprint('Lose')\r\n\t\t\tbreak\r\nif(arr[0][0]==arr[1][1]==arr[2][2] or arr[0][2]==arr[1][1]==arr[2][0]):\r\n\tif(arr[1][1]=='X'):\r\n\t\tprint('Win')\r\n\telif(arr[1][1]=='O'):\r\n\t\tprint('Lose')\r\n\telse:\r\n\t\tt=0\r\n\t\tprint('Draw')\r\nelif t:\r\n\tprint('Draw')\r\n'''\r\n'''\r\nn,m=map(int,input().split())\r\nif(n==0 and m!=0):\r\n print('Impossible')\r\nelse:\r\n if(m==0):\r\n print(n,n)\r\n elif(n==0 and m==0):\r\n print(\"0\",\"0\")\r\n else:\r\n n_max = (n+m)-1\r\n if(m>=n):\r\n n_min=(m-n)+n\r\n else:\r\n n_min=n\r\n print(n_min,n_max)\r\n'''\r\n'''\r\ns,p=map(int, input().split())\r\nd=s*s-4*p\r\nif(d<0):\r\n print(\"Impossible\")\r\nelif d == 0:\r\n x = y = s // 2\r\n if x > 0 and x <= 1000:\r\n print(x, y)\r\n else:\r\n print(\"Impossible\")\r\nelse:\r\n x1 = (s + int(d ** 0.5)) // 2\r\n y1 = s - x1\r\n x2 = (s - int(d ** 0.5)) // 2\r\n y2 = s - x2\r\n if x1 > 0 and x1 <= 1000 and y1 > 0 and y1 <= 1000:\r\n if x2 > 0 and x2 <= 1000 and y2 > 0 and y2 <= 1000:\r\n print(min(x1, y1), max(x1, y1))\r\n else:\r\n print(min(x1, y1), max(x1, y1))\r\n elif x2 > 0 and x2 <= 1000 and y2 > 0 and y2 <= 1000:\r\n print(min(x2, y2), max(x2, y2))\r\n else:\r\n print(\"Impossible\")\r\n'''\r\n'''\r\nimport re\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n s = input()\r\n if re.match(\"^[ABCEHKMOPTXY]{1}\\d{3}[ABCEHKMOPTXY]{2}$\", s):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n'''\r\n'''\r\na,b=input().split()\r\nnum1=0\r\nnum2=0\r\nfor i in range(4):\r\n\tif(a[i]==b[i]):\r\n\t\tnum1=num1+1\r\n\telif(a[i] in b):\r\n\t\tnum2=num2+1\r\nprint(num1,num2)\r\n'''\r\n'''\r\nn=input()\r\nnum1=[\"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\nnum2=0\r\nnum3=\"\"\r\nfor i in range(len(n)):\r\n\tif(n[i]==\"1\"):\r\n\t\tnum3=num3+num1[i-num2]\r\n\t\tnum2+=i-num2+1\r\nprint(num3)\r\n'''\r\n'''\r\nn=int(input())\r\nnum1=list(input().split())\r\nnum2=n+1\r\nprint(num2)\r\n'''\r\n'''\r\ns1=input()\r\ns2=input()\r\nif(len(s1)!=len(s2)):\r\n print(\"NO\")\r\nelse:\r\n num1={}\r\n for num2 in s1:\r\n if num2 in num1:\r\n num1[num2]+=1\r\n else:\r\n num1[num2]=1\r\n for num2 in s2:\r\n if num2 in num1:\r\n num1[num2]-=1\r\n if num1[num2]<0:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n'''\r\n'''\r\ndef F1(a,b):\r\n while(b):\r\n a,b=b,a%b\r\n return a\r\ndef F2(a,b):\r\n return a*b//F1(a,b)\r\ndef F3(a,b,c):\r\n return F2(F2(a,b), c)\r\na,b,c=map(int,input().split())\r\nprint(F2(F2(a,b),c))\r\n'''\r\n'''\r\nn,m=map(int,input().split())\r\nnum1,num2=n,m\r\nwhile(num2):\r\n\tnum1,num2=num2,num1%num2\r\nprint(n*m//num1)\r\n'''\r\n'''\r\nn=list(map(int,input().split()))\r\nnum1=sum(n)//27\r\nprint(num1)\r\n'''\r\n'''\r\nn=int(input())\r\nr=int(input())\r\nc=int(input())\r\nnum1=min(n-r,n-c)+min(r-1,c-1)+1\r\nnum2=min(n-r,c-1)+min(r-1,n-c)+1\r\nnum3=num1+num2-2 \r\nprint(num3)\r\n'''\r\n'''\r\nn=input() \r\nnum1=0\r\nfor i in range(len(n)-4):\r\n if(n[i:i+5]==\">>-->\"):\r\n num1=num1+1\r\n elif(n[i:i+5]==\"<--<<\"):\r\n num1=num1+1\r\nprint(num1)\r\n'''\r\nnum2=0\r\nnum1=int(input())\r\nfor i in range(num1):\r\n\tstr1=input()\r\n\tif(str1==\"X++\"):\r\n\t\tnum2=num2+1\r\n\tif(str1==\"++X\"):\r\n\t\tnum2=num2+1\r\n\tif(str1==\"X--\"):\r\n\t\tnum2=num2-1\r\n\tif(str1==\"--X\"):\r\n\t\tnum2=num2-1\r\nprint(num2)\r\n\r\n", "g = 0\r\nfor _ in range(int(input())):\r\n s = input()\r\n if s == \"X++\" or s == \"++X\":\r\n g += 1\r\n else:\r\n g -= 1\r\nprint(g)\r\n", "n = int(input())\nX = 0\n\nfor y in range(n):\n s = input()\n if \"++\" in s:\n X =X + 1\n else:\n X =X - 1\n\nprint(X)\n\n\n\t \t\t\t\t \t \t \t\t\t \t\t\t\t\t\t\t\t \t \t", "x=0\r\nn=int(input())\r\nfor i in range(n):\r\n komanda=str(input())\r\n if komanda=='++X' or komanda=='X++':\r\n x+=1\r\n elif komanda=='--X' or komanda=='X--':\r\n x-=1\r\nprint(x)", "x=0\r\nfor _ in range(int(input())):\r\n a=input()\r\n if a=='X++' or a=='++X':\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "num=int(input())\r\ncount=0\r\nfor i in range(num):\r\n s=input()\r\n if '+' in s:\r\n count+=1\r\n else:\r\n count-=1\r\nprint(count)", "number = int(input())\r\nvalue = 0\r\nfor i in range(number):\r\n x = input()\r\n if x.count(\"+\") == 2:\r\n value += 1\r\n elif x.count(\"-\") == 2:\r\n value -= 1\r\nprint(value)", "numOfInputs = int(input())\r\ny = 0\r\n\r\nfor i in range(0, numOfInputs):\r\n operation = input().lower()\r\n if operation == '++x' or operation == 'x++':\r\n y += 1\r\n elif operation == '--x' or operation == 'x--':\r\n y -= 1\r\n else:\r\n y = y\r\n\r\n\r\nprint(y)", "n=int(input())\r\nx=0\r\nwhile n>0 :\r\n s=list(input())\r\n if '+' in s : \r\n x+=1\r\n else :\r\n x-=1\r\n n-=1 \r\nprint(x)", "n = int(input())\r\nmyList = []\r\nx = 0\r\n\r\nfor i in range(n):\r\n op = input().split(\"X\")\r\n if \"++\" in op:\r\n x += 1\r\n elif \"--\" in op:\r\n x -= 1\r\n\r\nprint (x)", "x=int(input())\r\nG=0\r\nfor i in range(x):\r\n y=input()\r\n if y==\"++X\" or y==\"X++\":\r\n G=G+1\r\n elif y==\"--X\" or y==\"X--\":\r\n G=G-1\r\nprint(G)", "n = int(input()) # Read the number of sentences\r\n\r\nx = 0 # Initialize variable x to 0\r\n\r\n# Let's go through each sentence and perform operations\r\nfor i in range(n):\r\n statement = input() # Read the sentence\r\n if \"++\" in statement:\r\n x += 1 # Increase x by 1 if there is a \"++\" operation\r\n else:\r\n x -= 1 # Decrease x by 1 if there is a \"--\" operation\r\n\r\nprint(x) # Print the value of variable x after executing the program", "t=int(input())\r\nk=0\r\nfor i in range(t):\r\n x=input()\r\n s=x.count(\"+\")\r\n if s>0:\r\n k+=1\r\n else:\r\n k-=1\r\nprint(k)\r\n \r\n", "t = int(input())\r\nx = 0\r\nwhile t!=0:\r\n inp = input()\r\n if '-' in inp:\r\n x -= 1\r\n else:\r\n x += 1\r\n t -= 1\r\nprint(x)", "\r\nk=0\r\nfor i in range(int(input())):\r\n b=input()\r\n if b=='X++' or b=='++X':k+=1\r\n else:k-=1\r\nprint(k)", "n=int(input())\r\nb=0\r\nwhile n>0:\r\n a=input()\r\n if a == \"++X\" or a== \"X++\":\r\n b+=1\r\n elif a == \"--X\" or a== \"X--\":\r\n b-=1\r\n n-=1\r\nprint(b)", "res = 0\r\nk = int(input())\r\nfor i in range(k):\r\n x = input()\r\n if \"++\" in x: res += 1 \r\n else: res -= 1\r\nprint(res)", "n = int(input())\r\nx = 0\r\nfor i in range(n) :\r\n s = str(input())\r\n for s1 in s :\r\n if s1 == \"+\":\r\n x += 1\r\n break\r\n elif s1 == '-':\r\n x -= 1\r\n break\r\nprint(x)", "n = int(input())\r\nx = 0\r\n\r\nfor i in range(n):\r\n com = input()\r\n\r\n if com[1] == \"+\":\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)", "global c;c = 0\r\ndef ele(a):\r\n b = 0;d = 0\r\n if b != 2 or d != 2:\r\n for i in a:\r\n if i == ' ':\r\n exit()\r\n for i in a:\r\n if i == 'X':\r\n for i in a:\r\n if i == '+': b +=1\r\n if i == '-': d +=1\r\n if d==2: c=-1 ;return c\r\n if b==2: c = 1 ;return c\r\nx = 0\r\nt = int(input())\r\nif t >= 1 and t <= 150:\r\n while t: n = input();x += ele(n);t -= 1\r\nprint(x)", "x = 0\r\nn = int(input())\r\nif 1<=n<=150:\r\n for i in range(n):\r\n a = input()\r\n if a == \"X++\" or a == \"++X\":\r\n x+=1\r\n elif a == \"X--\" or a == \"--X\":\r\n x-=1\r\n \r\n print(x)", "#CF_282A: Bit++\r\nn = int(input())\r\nx = 0\r\n\r\nfor _ in range(n):\r\n str_x = input()\r\n if \"++\" in str_x:\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)\r\n", "n=int(input())\r\nx=0\r\nwhile n:\r\n s=input()\r\n if \"++\" in s:\r\n x+=1\r\n elif \"--\" in s:\r\n x-=1\r\n n-=1\r\nprint(x)", "t = int(input())\r\nx = 0\r\nfor i in range(t):\r\n n = input()\r\n if \"++\" in n:\r\n x += 1 \r\n elif \"--\" in n:\r\n x -= 1 \r\nprint(x)", "x, n = 0, int(input())\n# the second element always says the operation to be done\nwhile (n):\n\tinstr = input()\n\tif (instr[1] == \"+\"):\n\t\tx+=1\n\telse:\n\t\tx-=1\n\tn-=1\n\nprint(x)\n", "count=0\r\nfor _ in range(int(input())):\r\n \r\n n=input()\r\n \r\n for i in n[1]:\r\n if i=='+':\r\n count=count+1\r\n elif i=='-':\r\n count=count-1\r\n\r\nprint(count) \r\n ", "x=0\r\na=int(input())\r\nfor i in range (a) :\r\n b=str(input())\r\n if b.find('+')!=-1 :\r\n x=x+1\r\n else :\r\n x=x-1\r\nprint(x)", "n = int(input())\r\nscore = 0\r\nfor i in range(n):\r\n string = str(input())\r\n \r\n if string[0] == '+' or string[len(string)-1] == '+':\r\n score += 1\r\n \r\n if string[0] == '-' or string[len(string)-1] == '-':\r\n score -= 1\r\nprint(score)", "x = 0\n# read input\nn = int(input())\nstack = []\nfor _ in range(n):\n stack.append(input())\nfor i in stack:\n for h in set(i):\n if h == \"+\":\n x += 1\n if h == \"-\":\n x -= 1\nprint(x)\n \n", "a=int(input())\r\ncount=0\r\nfor _ in range(a):\r\n statement=input()\r\n if \"++\" in statement:\r\n count+=1\r\n else:\r\n count-=1\r\nprint(count)\r\n", "a=int(input())\r\nb=0\r\nfor i in range(a):\r\n c=input()\r\n if c[1]==\"+\":\r\n b+=1\r\n else:\r\n b-=1\r\nprint(b)", "rep = int(input())\nnum = 0\nfor i in range(rep):\n if input().count(\"-\") >0:\n num -=1\n else:\n num +=1\nprint(num)\n\t\t\t \t\t \t \t\t \t \t \t\t\t \t\t", "n=int(input())#number of operations\r\ncount=0\r\nx=0\r\nwhile(count<n):\r\n y=str(input())\r\n if(y==\"++X\" or y==\"X++\"):\r\n x=x+1\r\n else:\r\n x=x-1\r\n count+=1\r\nprint(x)\r\n ", "n=int(input())\nx=0\nfor i in range(n):\n op=input()\n l=list(op)\n if '+' in l:\n x+=1\n else:\n x-=1\nprint(x)\n", "nrighe=int(input(\"\"))\r\ncontatore =0;\r\nfor i in range(nrighe):\r\n riga=str(input(\"\"));\r\n if(riga[0]=='-' or riga[1]=='-'):\r\n contatore-=1\r\n else: \r\n contatore+=1\r\nprint(contatore)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n string=str(input())\r\n if string[0] == '+' or string[len(string)-1] == '+':\r\n count+=1\r\n elif string[0] == '-' or string[len(string)-1] == '-':\r\n count-=1 \r\nprint(count)", "n = int(input())\r\na = 0 \r\nfor i in range(n) :\r\n b = input()\r\n if b[1] == \"+\" :\r\n a += 1\r\n else :\r\n a -= 1\r\nprint(a)", "n = 0 \r\nfor i in range (int (input ())):\r\n k = input () \r\n if k[0] == '+' or k[1] == '+':\r\n n += 1 \r\n else:\r\n n -= 1 \r\nprint (n)", "a=[]\r\ns=0\r\nch=\"\"\r\nfor i in range(int(input())):\r\n ch=input()\r\n a.append(ch)\r\n if a[i]==\"++X\" or a[i]==\"X++\":\r\n s=s+1\r\n else:\r\n s=s-1\r\nprint(s)\r\n\r\n", "t=int(input())\r\na=0\r\nfor n in range(0,t):\r\n\tn=input()\r\n\tif n[1]==\"+\" or n[-1]==\"+\":\r\n\t\ta=a+1\r\n\telse:\r\n\t\ta=a-1\r\nprint(a) ", "t=int(input(\"\"))\n\ncount=0\nfor i in range (t):\n inv=input(\"\").upper()\n if inv==\"++X\" or inv==\"X++\":\n count+=1\n else:\n count-=1\nprint(count)\n\t\t\t \t \t \t\t \t\t \t \t\t \t", "n=int(input())\nrslt=0\nfor i in range(n):\n s=input()\n if s[1]=='+':\n rslt+=1\n elif s[1]=='-':\n rslt-=1\n \nprint(rslt) \n \n \n\t\t\t\t \t \t\t\t\t\t \t \t\t\t \t\t \t\t", "def invr():\r\n return(map(int,input().split()))\r\n\r\ndef main():\r\n num = int(input())\r\n count = 0\r\n for i in range(num):\r\n operation = input()\r\n if operation.__contains__(\"--\"):\r\n count -= 1\r\n if operation.__contains__(\"++\"):\r\n count += 1\r\n\r\n print(count)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "# cook your dish here\nX=0\nl1=[]\nfor i in range(int(input())):\n l1.append(input())\n if(l1[i]=='++X'):\n X=X+1\n elif(l1[i]==\"X++\"):\n X=X+1\n elif(l1[i]==\"X--\"):\n X=X-1\n elif(l1[i]==\"--X\"):\n X=X-1\nprint(X)\n \n", "a=int(input())\nx=0\nfor i in range(a):\n g=input()\n t=[i for i in g]\n if '+' in t:\n x=x+1\n if '-' in t:\n x=x-1\nprint(x)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n'''\nl=[[1,2,3],[1,2,3],[1,2,3]]\nd=[[21,12,43],[11,21,30],[21,12,53]]\nf=[[0,0,0],[0,0,0],[0,0,0]]\nfor i in range(len(l)):\n for j in range(len(l[i])):\n print(l[i][j],end=' ')\n print()\nfor i in range(len(d)):\n for j in range(len(d[i])):\n print(d[i][j],end=' ')\n print()\nfor i in range(len(l)):\n for j in range(len(l[i])):\n f[i][j]=l[i][j]+d[i][j]\nfor i in range(len(f)):\n for j in range(len(f[i])):\n print(f[i][j],end=' ')\n print()\n'''\n\n \n \n \n", "def main():\n ns = input()\n value = 0\n iter = range(int(ns))\n for i in iter:\n line = input()\n if \"+\" in line:\n value += 1\n else:\n value -= 1\n print(value)\n return 0\n\nif __name__ == \"__main__\":\n raise SystemExit(main())\n", "# taking inputs\r\nn = int(input())\r\nl = [input().find('+') for i in range(n)]\r\n\r\n# main logic\r\nx = 0\r\nfor i in l:\r\n if i == -1:\r\n x -= 1\r\n else:\r\n x += 1\r\n\r\nprint(x)", "from collections import defaultdict\r\nfrom sys import stdin\r\n\r\ndef solve():\r\n n = int(input())\r\n\r\n answ = 0\r\n for i in range(n):\r\n s = input()\r\n if s[0:2] == '++' or s[1:3] == '++':\r\n answ+=1\r\n else:\r\n answ-=1\r\n print(answ)\r\n\r\n \r\n\r\nif __name__ == '__main__':\r\n solve()", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef input_int():\r\n return(int(input()))\r\n\r\ndef input_str():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n\r\nif __name__ == \"__main__\":\r\n n = input_int()\r\n\r\n value = 0\r\n\r\n for _ in range(n):\r\n s = input_str()\r\n if '+' in s:\r\n value += 1\r\n else:\r\n value -= 1\r\n\r\n sys.stdout.write(str(value) + \"\\n\")", "def solve(operations):\r\n # Your code goes here\r\n x = 0\r\n for operation in operations:\r\n if operation[:2] ==\"++\" or operation[-2:] ==\"++\":\r\n x += 1\r\n elif operation[:2] ==\"--\" or operation[-2:] ==\"--\":\r\n x -= 1\r\n return x\r\n\r\ndef main():\r\n # Reading multiple test cases\r\n t = int(input())\r\n operations = []\r\n for _ in range(t):\r\n # Reading inputs for each test case\r\n operations.append(input().strip())\r\n print(solve(operations))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\ny = 0\r\nfor i in range(0, n):\r\n x = str(input())\r\n if x[0] == '+' or x[len(x)-1] == '+':\r\n y +=1\r\n elif x[0]=='-' or x[len(x)-1] == '-':\r\n y -=1\r\nprint(y)", "num_of_statements = int(input())\r\nx = 0\r\nfor i in range(num_of_statements):\r\n statement = input()\r\n if statement.find(\"++\") == -1:\r\n x = x - 1\r\n else:\r\n x = x + 1 \r\nprint(x)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n stp=input()\r\n if stp[1]==\"+\":\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "n = int(input())\r\nc=0\r\nfor i in range(n):\r\n a=input()\r\n if \"++\" in a:\r\n c+=1\r\n elif \"--\" in a:\r\n c-=1\r\nprint(c)", "n=int(input())\ncounter=0\nwhile n!=0:\n n-=1\n word=input()\n if \"++\" in word:\n counter+=1\n elif \"--\" in word:\n counter-=1\n \nprint(counter)", "a=0\r\nfor _ in range(int(input())):\r\n s=input()\r\n if s[-1]=='+' or s[0]=='+':\r\n a+=1\r\n else:\r\n a-=1\r\nprint(a)", "t = 0\r\nn = int(input())\r\nfor _ in range(n):\r\n x = input()\r\n if x==\"++X\" or x==\"X++\":\r\n t+=1\r\n else:\r\n t-=1\r\nprint(t)", "n = int(input())\nstatments = []\nX = 0\nfor i in range(n):\n statments.append(input())\n\nfor i in statments:\n if \"+\" in i:\n X += 1\n elif \"-\" in i:\n X -= 1\nprint(X)", "a=int(input())\r\nc=0\r\nfor i in range (a):\r\n b=input()\r\n if (b==\"++X\" or b==\"X++\"):\r\n c+=1\r\n else:\r\n c-=1\r\nprint(c)", "n = int(input())\r\nk = 0\r\nfor _ in range(n):\r\n s = input()\r\n if s == \"++X\" or s == \"X++\":\r\n k += 1\r\n elif s == \"--X\" or s == \"X--\":\r\n k -= 1\r\nprint(k)", "a = int(input()) \nx = 0 \nfor i in range(a):\n operation = input()\n\n if \"++\" in operation:\n x += 1\n else:\n x -= 1\n\nprint(x)\n ", "def resta(x):\r\n x-=1\r\n return x\r\ndef suma(x):\r\n x+=1\r\n return x\r\nn = int(input())\r\nx = 0\r\nfor _ in range(n):\r\n a = input()\r\n if(\"-\" in a):\r\n x = resta(x)\r\n else:\r\n x = suma(x)\r\nprint(x) ", "n=int(input());x=[input() for i in range(n)]\r\nprint(sum([1 if \"+\" in i else -1 for i in x]))", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n s=input()\r\n for n in range(len(s)):\r\n if s[n]==\"+\":\r\n x+=1\r\n break\r\n elif s[n]==\"-\":\r\n x-=1\r\n break \r\nprint(x)", "# for _ in range(int(input())):\r\nn = int(input())\r\nx = 0\r\nfor i in range(n):\r\n a = input()\r\n if a[0] ==\"+\" or a[1] ==\"+\":\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "NoTime = int(input())\r\nx=0\r\nfor number in range(NoTime):\r\n command = input()\r\n if \"++\" in command:\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)", "n = int(input())\r\nx = 0\r\nfor _ in range(n):\r\n statement = input()\r\n statement = [c for c in statement]\r\n if statement[0] == '+' or statement[2] == '+':\r\n x = x+1\r\n else:\r\n x = x-1\r\nprint(x)\r\n", "num = int(input(\"\"))\r\n\r\nvar = 0\r\n\r\nfor i in range(1,num + 1):\r\n statement = input(\"\")\r\n if statement.lower() == \"++x\" or statement.lower() == \"x++\":\r\n var +=1\r\n elif statement.lower() == \"--x\" or statement.lower() == \"x--\":\r\n var-=1\r\nprint(var)\r\n", "x=int(input())\r\nn=0\r\nfor i in range(x):\r\n l=input()\r\n \r\n if(l==\"++X\" or l==\"X++\"):\r\n n+=1\r\n else:\r\n n-=1\r\nprint(n) ", "def execute_bit_program(program):\r\n x = 0\r\n for statement in program:\r\n if \"++\" in statement:\r\n x += 1\r\n else:\r\n x -= 1\r\n return x\r\n\r\nn = int(input())\r\nprogram = [input() for _ in range(n)]\r\nresult = execute_bit_program(program)\r\nprint(result)\r\n", "w=0\r\nq=int(input())\r\nfor i in range(q):\r\n e=input()\r\n if '+' in e: w=w+1\r\n if '-' in e: w=w-1\r\nprint(w)\r\n", "x=0\r\nfor i in range(int(input())):\r\n a=input()\r\n if (a==\"X++\" or a==\"++X\"):\r\n x=x+1\r\n \r\n elif (a==\"X--\" or a==\"--X\"):\r\n x=x-1\r\nprint(x)\r\n\r\n", "n=input()\r\nx=0\r\nfor times in range(int(n)): \r\n string = input().replace('x','')\r\n if \"++\" in string:\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x)", "a=int(input())\r\nb=0\r\nif 1<=a<=150:\r\n for i in range(0,a):\r\n\r\n c= input()\r\n if c=='++X'or c==\"X++\":\r\n b=b+1\r\n elif c==\"--X\" or c=='X--':\r\n b=b-1\r\n\r\n\r\n print(b)\r\n\r\n", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n X=input()\r\n if(X[1]==\"+\"):\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)", "import sys\r\nimport math\r\n\r\ninput = sys.stdin.readline\r\n\r\ninp = lambda: input().strip()\r\ngi = lambda: list(map(int, input().split()))\r\ngs = lambda: list(input().split())\r\n\r\ntest_cases = int(input())\r\nx = 0\r\nfor _ in range(test_cases):\r\n s = inp()\r\n if s[1] == \"+\":\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n", "x=int(input())\r\n\r\nc=0\r\nfor i in range (0,x):\r\n str=input()\r\n if \"++\" in str:\r\n c=c+1\r\n else:\r\n c=c-1\r\nprint(c)", "ans=0\nfor _ in range(int(input())):\n k=input()\n if \"++\" in k:\n ans+=1\n else:\n ans-=1\nprint(ans)\n", "def main():\r\n # Reading multiple test cases\r\n t = int(input())\r\n x = 0\r\n for _ in range(t):\r\n # Reading and processing each operation\r\n operation = input().strip()\r\n if operation[:2] ==\"++\" or operation[-2:] ==\"++\":\r\n x += 1\r\n elif operation[:2] ==\"--\" or operation[-2:] ==\"--\":\r\n x -= 1\r\n print(x)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "count = 0\r\nfor i in range(int(input())):\r\n a = input()\r\n if '+' in a:\r\n count += 1\r\n elif '-' in a:\r\n count -= 1\r\nprint(count)\r\n", "n = int(input())\r\nv = 0\r\nfor i in range(n):\r\n s = input()\r\n if '+' in s:\r\n v += 1\r\n else:\r\n v -= 1\r\nprint(v)", "n=int(input())\r\ny=0\r\nfor i in range(n):\r\n z=input()\r\n if(\"++X\" in z or \"X++\" in z):\r\n y+=1\r\n else:\r\n y=y-1\r\nprint(y) ", "X=0\r\nn=int(input(\"\"))\r\nl=[]\r\nfor i in range(n):\r\n u=input(\"\")\r\n if u[1]=='-':\r\n X=X-1\r\n else : \r\n X=X+1\r\n\r\n\r\nprint(X)", "x = 0\r\noperations = []\r\nlines = int(input())\r\n\r\nfor i in range(lines):\r\n operations.append(input())\r\n\r\nfor operation in operations:\r\n if operation[1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)", "x = 0\r\nfor _ in range(int(input())):\r\n\ta = input()\r\n\tif \"++\" in a:\r\n\t\tx +=1\r\n\tif \"--\" in a:\r\n\t\tx-=1\r\nprint(x)\t\t\r\n ", "n = int(input())\r\n\r\nnum=0\r\npl1 = \"X++\"\r\npl2 = \"++X\"\r\nmin1= \"X--\"\r\nmin2=\"--X\"\r\nfor i in range(0,n):\r\n str = input()\r\n if str==pl1 or str ==pl2:\r\n num = num+1\r\n elif str==min1 or str==min2:\r\n num = num-1\r\nprint(num)\r\n\r\n\r\n", "number_of_operations = int(input())\r\noperations = [input() for x in range(number_of_operations)]\r\n\r\nresult = 0\r\n\r\nfor i in range(number_of_operations):\r\n if operations[i].count('+') > 0: result += 1\r\n elif operations[i].count('-') > 0: result -= 1\r\n \r\n# .count('+') > 0: result += 1\r\n\r\nprint(result)", "n=int(input())\r\nX=0\r\nif 1<=n<=150:\r\n for i in range(n):\r\n statement=input()\r\n if \"++\" in statement:\r\n X +=1\r\n else:\r\n X -=1\r\n print(X)", "T = int(input())\r\n\r\ncountp = 0\r\ncountn = 0\r\nfor i in range(T):\r\n string = input()\r\n for i in range(0, len(string)):\r\n if(string[i]=='-'):\r\n countn += 1\r\n if(string[i]=='+'):\r\n countp += 1\r\n\r\nx = countp//2 - countn//2\r\nprint(x)", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n op = input()\r\n\r\n if \"+\" in op:\r\n count += 1\r\n\r\n else:\r\n count -= 1\r\n\r\nprint(count)", "n = int(input())\r\np = len([x for x in range(n) if '+' in input()])\r\nprint(p * 2 - n)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n X = input()\r\n if X == \"++X\" or X == \"X++\":\r\n count +=1\r\n elif X == \"--X\" or X == \"X--\":\r\n count-=1\r\nprint(count) ", "n = int(input())\r\n\r\nx = 0\r\nfor _ in range(n):\r\n bit = input()\r\n bit = sorted(bit)\r\n str_bit = ''.join(bit)\r\n if str_bit == \"++X\":\r\n x += 1\r\n elif str_bit == \"--X\":\r\n x -= 1\r\n\r\nprint(x)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n a = input()\r\n if '++' in a:\r\n ans += 1\r\n elif '--' in a:\r\n ans -= 1\r\nprint(ans)", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n x=input()\r\n if x[1]==\"+\":\r\n c=c+1\r\n else:\r\n c=c-1\r\nprint(c)", "n=int(input())\r\nplus=0\r\nminus=0\r\nx=0\r\nfor j in range(n):\r\n stri=input()\r\n i=0\r\n while(i<len(stri)):\r\n if(stri[i]==\"+\"):\r\n plus=plus+1\r\n elif(stri[i]==\"-\"):\r\n minus=minus+1\r\n i=i+1\r\n if(plus==2):\r\n x=x+1\r\n plus=0\r\n elif(minus==2):\r\n x=x-1\r\n minus=0\r\nprint(x)", "n=int(input())\ns=''\nfor i in range(n):\n s=s+str(input())\nx=(s.count('+')-s.count('-'))/2\nprint(int(x))\n", "n = int(input())\r\nx = 0\r\n\r\nfor i in range(1, n+1):\r\n w = input()\r\n n = w.count(\"++\")\r\n x += n\r\n y = w.count(\"--\")\r\n x -= y\r\n\r\nprint(x)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n l= input()\r\n if l == '++X' or l == 'X++' :\r\n x+=1\r\n else:\r\n x-=1\r\nprint(x) \r\n\r\n \r\n", "x = 0\r\ni = 0\r\nstroki = int(input(\"\"))\r\nwhile i<stroki:\r\n plusminus = input(\"\")\r\n if plusminus == \"X++\" or plusminus == \"++X\":\r\n x += 1\r\n else:\r\n x -= 1\r\n i += 1\r\nprint(x)", "'''\r\nThe classic programming language of Bitland is Bit++. This language is so peculiar and complicated.\r\n\r\nThe language is that peculiar as it has exactly one variable, called x. Also, there are two operations:\r\n\r\nOperation ++ increases the value of variable x by 1.\r\nOperation -- decreases the value of variable x by 1.\r\nA statement in language Bit++ is a sequence, consisting of exactly one operation and one variable x. The statement is written without spaces, that is, it can only contain characters \"+\", \"-\", \"X\". Executing a statement means applying the operation it contains.\r\n\r\nA programme in Bit++ is a sequence of statements, each of them needs to be executed. Executing a programme means executing all the statements it contains.\r\n\r\nYou're given a programme in language Bit++. The initial value of x is 0. Execute the programme and find its final value (the value of the variable when this programme is executed).\r\n\r\nInput\r\nThe first line contains a single integer n (1≤n≤150) — the number of statements in the programme.\r\n\r\nNext n lines contain a statement each. Each statement contains exactly one operation (++ or --) and exactly one variable x (denoted as letter «X»). Thus, there are no empty statements. The operation and the variable can be written in any order.\r\n\r\nOutput\r\nPrint a single integer — the final value of x.\r\n'''\r\n\r\n\r\n\r\n\r\nn = int(input())\r\nret = 0\r\nfor i in range(n):\r\n line = input()\r\n if 'X' in line:\r\n if '++' in line:\r\n ret += 1\r\n elif '--' in line:\r\n ret -= 1\r\nprint(ret)", "def program(m, k):\n x = 0\n\n for i in range(m):\n statement = k[i]\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n\n return x\n\nm = int(input().strip())\n\nk = [input().strip() for _ in range(m)]\n\nfinal_value = program(m, k)\n\nprint(final_value)\n\n \t \t\t \t \t\t \t \t \t \t\t \t", "t = int(input())\ncount = 0\n\nfor i in range(t):\n op = input()\n if op[1] == '+':\n count = count + 1\n else:\n count = count - 1\n\nprint(count)", "def execute_program(n, statements):\n x = 0 # Initialize the variable x\n\n for statement in statements:\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n\n return x\n\n# Read the number of statements\nn = int(input())\n\nstatements = []\nfor _ in range(n):\n statement = input()\n statements.append(statement)\n\nfinal_value = execute_program(n, statements) # Execute the program\nprint(final_value)\n \t \t \t \t\t \t\t\t\t\t\t\t\t\t \t \t\t", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n st = input()\r\n if((st[0]=='+') or (st[2]=='+')):\r\n s+=1\r\n else: s-=1\r\nprint(s)\r\n", "import sys\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 return input().strip()\r\n\r\n\r\ndef out(x):\r\n sys.stdout.write(str(x) + \"\\n\")\r\n\r\n\r\ndef main():\r\n count = inp()\r\n init_value = 0\r\n for _ in range(count):\r\n operations = insr().split()\r\n for operation in operations:\r\n if '--' in operation:\r\n init_value -= 1\r\n elif '++' in operation:\r\n init_value += 1\r\n out(init_value)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "num = int(input())\r\nr = 0\r\n\r\nfor i in range(0, num):\r\n data = input()\r\n if data == \"X++\" or data == \"++X\":\r\n r += 1\r\n else:\r\n r -= 1\r\nprint(r)", "iniValue = 0\r\nfor i in range(int(input())):\r\n a =input()\r\n if \"++\" in a:\r\n iniValue +=1\r\n else:\r\n iniValue -=1\r\nprint(iniValue)", "n = int(input())\r\n\r\narr = []\r\n\r\nfor i in range(n):\r\n arr.append(input())\r\n \r\nr = 0 \r\nfor v in arr:\r\n if \"+\" in v:\r\n r += 1 \r\n else :\r\n r -= 1\r\n\r\nprint(r)", "def main():\n counter = 0\n for i in range(int(input())):\n word = input()\n if \"+\" in word:\n counter += 1\n else:\n counter -= 1\n print(counter)\n\nmain()\n\t\t \t\t \t\t\t\t\t \t \t \t\t \t\t\t", "n=int(input())\r\nX=0\r\nfor i in range(n):\r\n m=input()\r\n if m==\"++X\" or m==\"X++\":\r\n X+=1\r\n else:\r\n X-=1\r\nprint(X)", "X = 0\r\nfor i in range(int(input())):\r\n l = list(input())\r\n if \"+\" in l:\r\n X+=1\r\n elif \"-\" in l:\r\n X-=1\r\nprint(X)", "x = int(input())\r\nc = 0\r\nfor _ in range(x):\r\n e = input()\r\n if \"++\" in e:\r\n c += 1\r\n else:\r\n c -= 1\r\nprint(c)", "n = 0\r\nx = 0\r\nn = int(input())\r\ns = \"\"\r\nwhile n > 0:\r\n s = input()\r\n if s[1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\n n -= 1\r\nprint(x)", "n=int(input())\r\ny=0\r\nfor i in range(n):\r\n x=input()\r\n if(x[1]=='+'):\r\n y=y+1\r\n else:\r\n y=y-1\r\nprint(y)", "n = int(input())\r\nX = 0\r\nfor i in range(n):\r\n s = input()\r\n if s == '++X' or s == 'X++':\r\n X += 1\r\n elif s == '--X' or s == 'X--':\r\n X -= 1\r\nprint(X)", "n = int(input())\r\na = int(0)\r\ndef AorS(b):\r\n c = len(b)\r\n d = int(0)\r\n for i in range(c):\r\n if b[i] == '+':\r\n d += 1\r\n elif b[i] == '-':\r\n d += 2\r\n return d\r\nfor i in range(n):\r\n e = input()\r\n f = AorS(e)\r\n if f == 4:\r\n a -= 1\r\n elif f == 2:\r\n a += 1\r\nprint(a)", "num1=int(input())\nx=0\nfor i in range(num1):\n s=input()\n if s[0]==\"+\" or s[2]==\"+\":\n x=x+1\n\n else:\n x=x-1\n\nprint (x)\n\n\n \t \t \t\t\t\t\t\t\t\t \t \t", "n = int(input())\r\nsum = 0\r\ns1 = \"\"\r\nfor i in range(n):\r\n s1 = input()\r\n if \"++\" in s1:\r\n sum += 1\r\n if \"--\" in s1:\r\n sum -= 1\r\nprint(sum)\r\n ", "t=int(input())\r\ng=0\r\nfor _ in range(t):\r\n\td=input()\r\n\tif d==\"X++\" or d==\"++X\":\r\n\t\tg+=1\r\n\telse:\r\n\t\tg-=1\r\nprint(g)", "op=int(input())\r\nab=[]\r\nx=0\r\nfor i in range(0,op):\r\n bs=input()\r\n ab.append(bs)\r\nfor i in range(0,op):\r\n if ab[i][1]==\"+\":\r\n x+=1\r\n elif ab[i][1]==\"-\":\r\n x-=1\r\nprint(x)", "# Initialize the variable\r\nx = 0\r\n\r\n# Read the number of statements\r\nn = int(input())\r\n\r\n# Iterate through each statement\r\nfor _ in range(n):\r\n statement = input()\r\n\r\n # Check the statement\r\n if \"++\" in statement:\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\n# Print the value of x\r\nprint(x)", "n = int(input())\r\nx = 0\r\nfor _ in range(n):\r\n S = input()\r\n if (S == \"++X\" or S == \"X++\"):\r\n x += 1\r\n if (S == \"--X\" or S == \"X--\"):\r\n x -= 1\r\nprint(x)\r\n", "n = int(input())\r\nresult = 0\r\n\r\nfor _ in range (n):\r\n operation = input()\r\n if \"+\" in operation:\r\n result += 1\r\n elif \"-\" in operation:\r\n result -= 1\r\n\r\nprint(result)", "n = int(input())\r\n\r\nx = 0\r\nfor i in range(n):\r\n cmd = input()\r\n x += 1 if cmd[1] == '+' else -1\r\n \r\nprint(x)", "inputNums = int(input())\n\nsum = 0\n\nfor i in range(inputNums):\n operation = input()\n\n if operation == \"++x\" or operation == \"x++\" or operation == \"X++\" or operation == \"++X\": \n sum += 1\n elif operation == \"--x\" or operation == \"x--\" or operation == \"X--\" or operation == \"--X\":\n sum -= 1\n\nprint(sum)\n\t \t \t\t\t\t \t \t \t\t\t\t\t \t\t \t\t \t", "x = 0\r\n\r\nfor i in range(int(input())):\r\n\r\n if \"+\" in input():\r\n\r\n x = x + 1\r\n\r\n else:\r\n\r\n x = x - 1\r\n \r\nprint(x)\r\n", "num = int(input())\r\nstep = 0\r\nX = 0\r\n\r\nwhile step < num:\r\n task = input()\r\n if task == \"++X\" or task == \"X++\":\r\n X += 1\r\n elif task == \"--X\" or task == \"X--\":\r\n X = X - 1\r\n step += 1\r\n\r\nprint(X)\r\n\r\n\r\n", "n=int(input())\r\nsum1=0\r\nfor i in range(n):\r\n str1=str(input())\r\n \r\n if(str1[1]==\"+\" )or (str1[2]==\"+\"):\r\n sum1+=1 \r\n else:\r\n sum1=sum1-1\r\nprint(sum1)\r\n ", "len_input=int(input())\r\nx=0\r\nfor item in range(len_input):\r\n bit_word=str(input())\r\n if(\"--\" in bit_word):\r\n x-=1 \r\n elif(\"++\" in bit_word):\r\n x+=1 \r\nprint(x)\r\n", "n = int(input())\r\n\r\n\r\nco = 0\r\nfor i in range(n):\r\n \r\n t = input()\r\n \r\n if t == \"++X\" or t == \"X++\":\r\n co+=1\r\n else:\r\n co-=1\r\n \r\nprint(co)\r\n ", "n = int(input())\r\nstatements = list()\r\nfor i in range(n):\r\n inp = input()\r\n statements.append(inp)\r\nx = 0\r\nfor statement in statements:\r\n if statement in ['++X', 'X++']:\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)\r\n", "# Template Codeforces\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(): #integer\r\n return(int(input()))\r\n\r\n############ ---- Problem Solution ---- ############\r\ndef main():\r\n cases = inp()\r\n x = 0\r\n for _ in range(cases):\r\n if '++' in input():\r\n x+=1\r\n else:\r\n x-=1\r\n sys.stdout.write(str(x) + \"\\n\")\r\n \r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\narray=[]\r\nvalue=0\r\nfor i in range(n):\r\n string=input()\r\n array.append(string)\r\n\r\nfor m in range(len(array)): \r\n\r\n if array[m]=='++X' or array[m]=='X++':\r\n value+=1\r\n \r\n else:\r\n value-=1\r\n \r\nprint(value)\r\n", "n = int(input())\r\nx = 0\r\nfor i in range(0,n):\r\n bit = list(str(input(\"\")))\r\n ops = []\r\n for j in range(0,len(bit)):\r\n if bit[j] == \"+\":\r\n x += (0.5)\r\n if bit[j] == \"-\":\r\n x -= (0.5)\r\nprint(int(x))", "# Initialize the variable x\nx = 0\n\n# Input\nn = int(input()) # Number of statements\n\n# Process each statement\nfor _ in range(n):\n statement = input()\n if \"++\" in statement:\n x += 1\n else:\n x -= 1\n\n# Output the final value of x\nprint(x)\n\n\t \t \t \t\t \t \t\t\t\t \t \t\t\t \t", "def main():\r\n n = int(input())\r\n x = 0\r\n for _ in range(n):\r\n S = input()\r\n if S[1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\n print(x)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "M=int(input())\r\ncount=0\r\nfor U in range(0,M):\r\n X=input()\r\n if(X==\"X++\"or X==\"++X\"):\r\n count=count+1; \r\n \r\n if(X==\"X--\" or X==\"--X\"):\r\n count=count-1; \r\n \r\nprint(count)", "n= int(input())\r\nresult= 0\r\nfor i in range(n):\r\n\ts= str(input())\r\n\tif s== '++X' or s=='X++':\r\n\t\tresult+=1\r\n\telse:\r\n\t\tresult -=1\r\nprint(result)", "user = int(input())\r\ncontent = []\r\noutput = 0\r\n\r\nfor i in range(user):\r\n content.append(input())\r\n\r\nfor i in content:\r\n if '+' in i:\r\n output += 1\r\n else:\r\n output -= 1\r\n\r\nprint(output)", "x =0\nn = int(input())\nfor i in range(n):\n sign = input()\n if sign[1] == \"+\":\n x+=1\n if sign[1] == \"-\" :\n x-=1\nprint(x)\n \t \t \t\t\t\t \t\t \t\t \t\t\t \t \t\t", "n = int(input())\r\nx = 0\r\nfor _ in range(n):\r\n \r\n ele = input()\r\n if ele[0] == \"+\" or ele[2] == \"+\":\r\n x += 1\r\n else:\r\n x-= 1\r\nprint(x)\r\n", "n= int(input())\r\n\r\narr= []\r\n\r\nfor i in range(n):\r\n arr1= input()\r\n \r\n arr.append(arr1)\r\n\r\n#print(arr)\r\n\r\nx=0\r\n\r\nfor i in arr:\r\n for j in i:\r\n if j=='+':\r\n x+=1\r\n break\r\n \r\n elif j=='-':\r\n x-=1\r\n break\r\n\r\nprint(x)", "n = int (input())\r\nx = 0\r\nfor i in range (0,n):\r\n s = input()\r\n if s==\"++X\" or s==\"X++\":\r\n x+=1\r\n elif s==\"--X\" or s==\"X--\":\r\n x-=1\r\nprint(x)", "#https://codeforces.com/problemset/problem/282/A\r\nsum=0\r\nfor i in range(int(input())):\r\n a=input()\r\n if \"+\" in a:\r\n sum+=1\r\n elif \"-\" in a:\r\n sum-=1\r\nprint(sum)", "n=int(input())\r\nX=0\r\nfor i in range(n):\r\n a=input()\r\n if a==\"X++\" or a==\"++X\":\r\n X+=1\r\n elif a==\"X--\" or a==\"--X\":\r\n X-=1\r\nprint(X)", "n=int(input())\r\n\r\nx=0\r\nfor i in range(n):\r\n s=input()\r\n if(s==\"X++\" or s==\"++X\"):\r\n x+=1\r\n else:\r\n x-=1\r\n\r\nprint(x)", "n = int(input())\r\na = 0\r\nfor i in range(n):\r\n x = input()\r\n if \"++\" in x:\r\n a += 1\r\n else:\r\n a -= 1\r\nprint(a)", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nX = 0\r\nfor i in s:\r\n if '++' in i: X+=1\r\n if '--' in i: X-=1\r\nprint(X)", "n = int(input())\r\nx = 0\r\nfor i in range (n):\r\n y = input()\r\n if y [1]== \"+\":\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)", "a = int(input())\r\nk=0\r\nfor i in range(a):\r\n b = str(input())\r\n if b[1] == '+':\r\n k += 1\r\n else:\r\n k -= 1\r\nprint(k)\r\n", "n = int(input())\r\nx = 0\r\n\r\nwhile n > 0:\r\n operation = input()\r\n if \"+\" in operation:\r\n x += 1\r\n else:\r\n x -= 1\r\n n -=1\r\n\r\nprint (x)", "n = int(input())\r\ncount = 0\r\nb = \"++\"\r\nc = \"--\"\r\nfor t in range(n):\r\n a = input()\r\n if(b in a):\r\n count += 1\r\n elif(c in a):\r\n count -= 1\r\nprint(count)", "n = int(input())\r\ncou = 0\r\nfor i in range(n):\r\n\tx = input()\r\n\tif '--' in x:\r\n\t\tcou -= 1\r\n\telse:\r\n\t\tcou += 1\r\nprint(cou)", "n = int(input())\r\nx = 0\r\nfor i in range(n):\r\n operation = input()\r\n if operation == '++X' or operation == 'X++':\r\n x += 1\r\n elif operation == '--X' or operation == 'X--':\r\n x -= 1\r\nprint(x)", "n=int(input())\r\nval=0\r\nfor i in range(n):\r\n s=input()\r\n if \"++\" in s:\r\n val=val+1\r\n if \"--\" in s:\r\n val=val-1\r\nprint(val) \r\n \r\n ", "t = int(input())\r\nx = 0\r\nfor i in range(t):\r\n s = input()\r\n if(\"++\" in s):\r\n x+=1\r\n else:\r\n x-=1\r\n \r\nprint(x)", "a = int(input())\r\nx = 0\r\n\r\nfor i in range(a):\r\n b = input()\r\n if b[1] == '+':\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)\r\n", "n = 0\r\nfor i in range(int(input())):\r\n k = input()\r\n if k[0] == '+' or k[1] == '+':\r\n n += 1\r\n else:\r\n n -= 1\r\nprint(n)", "n = int(input())\r\nresult = 0\r\nwhile n:\r\n s = input()\r\n result += 1 if \"+\" in s else -1\r\n n -= 1\r\n\r\nprint(result)", "a=int(input())\r\nx=0\r\nfor i in range(0,a):\r\n b=input()\r\n if (b[0]=='+' or b[2]=='+'):\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)", "n=int(input())\r\na=[]\r\nq=0\r\nfor i in range(n):\r\n a.append(input())\r\n if a[i][0]=='+' and a[i][1]=='+' or a[i][-1]=='+' and a[i][-2]:\r\n q+=1\r\n else:\r\n q-=1\r\nprint(q)", "num = int(input())\r\nx = 0 \r\nfor i in range(num):\r\n s = input()\r\n if s[1] == \"+\":\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)", "n = int(input())\r\ncou = 0\r\n\r\nfor i in range(n):\r\n a = str(input())\r\n if a[0] == '+' or a[len(a) - 1] == '+':\r\n cou += 1\r\n\r\n elif a[0] == '-' or a[len(a) - 1] == '-':\r\n cou -= 1\r\n\r\nprint(cou)", "print(sum(1 if \"++\" in input() else -1 for _ in range(int(input()))))", "n = int(input())\r\nl = 0\r\nfor i in range(n):\r\n k = input()\r\n if \"++\" in k:\r\n l += 1\r\n if \"--\" in k:\r\n l -= 1\r\nprint(l)", "n = int(input(\"\"))\ncount = 0\nfor i in range(n):\n s = input(\"\")\n if s[1] == \"+\":\n count = count + 1\n if s[1] == \"-\":\n count = count - 1\nprint(count)\n\t\t \t\t \t\t \t \t\t\t \t \t \t \t\t \t\t\t\t", "a = int(input())\r\n\r\nd = []\r\nfor i in range(a):\r\n n = input()\r\n d.append(n)\r\n\r\nk = 0\r\n\r\nfor j in d:\r\n if \"++\" in j:\r\n k+=1\r\n else:\r\n k-=1\r\n\r\nprint(k)\r\n", "t = int(input(\"\"))\r\nx = 0\r\nfor i in range (0,t):\r\n statement = input(\"\")\r\n if statement[1] == '+':\r\n x = x + 1\r\n else:\r\n x = x - 1\r\nprint(x)", "x = 0\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n operation = input()\r\n if \"++\" in operation:\r\n x += 1\r\n elif \"--\" in operation:\r\n x -= 1\r\n\r\nprint(x)", "t = int(input())\r\n\r\nc = 0\r\n\r\nfor i in range(t):\r\n\r\n s = input()\r\n\r\n if s[1] == '+': c += 1\r\n else: c -= 1\r\n\r\nprint(c)", "n = int(input())\r\noperation_input = [list(map(str, input().split())) for i in range(n)]\r\nx = 0\r\noperation_plus = [['++X'], ['X++']]\r\noperation_minus = [['--X'], ['X--']]\r\n\r\nfor i in operation_input:\r\n if i in operation_plus:\r\n x += 1\r\n if i in operation_minus:\r\n x -= 1\r\n\r\nprint(x)", "def operation(l):\r\n x=0\r\n for i in l:\r\n if i==\"++\":\r\n x+=1\r\n else:\r\n x-=1\r\n return x\r\n\r\nn=int(input())\r\n#list if operations\r\nopl=[]\r\nfor i in range(n):\r\n s=input()\r\n t=s.replace(\"X\",\"\")\r\n opl.append(t)\r\n\r\nprint(operation(opl))\r\n\r\n", "x = 0\r\nn = int(input())\r\nfor i in range(n):\r\n operation = str(input()) \r\n if \"+\" in operation:\r\n x+=1\r\n elif \"-\" in operation:\r\n x-=1\r\nprint(x)", "n = int(input())\r\nx = 0\r\n\r\nfor i in range(n):\r\n o = input()\r\n if '++' in o:\r\n x += 1\r\n elif '--' in o:\r\n x -= 1\r\n\r\nprint(x)", "n = int(input())\r\ninstructions = [input() for _ in range(n)]\r\nx = sum(1 if '+' in instruction else -1 for instruction in instructions)\r\nprint(x)\r\n", "x=int(input())\r\ncount=0\r\nfor i in range(x):\r\n ss=input()\r\n if (ss[0]=='-') | (ss[-1]=='-'):\r\n count-=1\r\n else:\r\n count+=1\r\nprint(count) ", "out = 0\r\nfor i in range(int(input())):\r\n inp = input()\r\n if \"+\" in inp:\r\n out+=1\r\n elif \"-\" in inp:\r\n out-=1\r\nprint(out)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n l=input()\r\n if(l[1]=='+'):\r\n x=x+1\r\n if(l[1]=='-'):\r\n x=x-1\r\nprint(x)\r\n \r\n \r\n ", "n,count=int(input()),0\r\nfor i in range(n):\r\n count+=1 if \"++\" in input() else -1\r\nprint(count)", "ans = 0\r\nfor i in range(int(input())):\r\n a =input()\r\n if \"+\" in a:\r\n ans+=1\r\n elif \"-\" in a:\r\n ans-=1\r\nprint(ans)", "n = int(input())\r\ncounter = 0\r\nfor i in range(n):\r\n string1 = input()\r\n if string1 == \"X++\" or string1 == \"++X\":\r\n counter += 1\r\n else:\r\n counter -= 1\r\nprint(counter)", "val=0\r\nn = int(input())\r\nfor i in range(n):\r\n first = input().lower()\r\n\r\n if first == '++x' or first =='x++':\r\n val+=1\r\n elif first =='x--' or first =='--x':\r\n val-=1\r\nprint(val)\r\n\r\n", "sum = 0\r\nt = int(input())\r\nfor _ in range(t):\r\n s = input()\r\n if(s[1] == '+'):\r\n sum+=1\r\n else:\r\n sum-=1\r\nprint(sum)", "x=0\r\nop = int(input())\r\noperation_dict = {\r\n \"X++\": 1,\r\n \"++X\": 1,\r\n \"--X\": -1,\r\n \"X--\":-1,\r\n }\r\nfor i in range(op):\r\n x+=operation_dict.get(input())\r\nprint(x)", "a = int(input())\r\nl = 0\r\nfor n in range(a):\r\n s = input()\r\n if s==\"X++\" or s==\"++X\":\r\n l+=1\r\n elif s==\"--X\" or \"X--\":\r\n l-=1\r\nprint(l)", "n = int(input())\r\nl = []\r\nz = 0\r\nwhile z < n:\r\n y = input(\"\")\r\n l.append(y)\r\n z += 1\r\nx = 0\r\nfor i in l:\r\n if \"+\" in i:\r\n x += (i.count(\"+\"))/2\r\n elif \"-\" in i:\r\n x -= (i.count(\"-\"))/2\r\nprint(int(x))", "n = int(input())\nX= 0\n\nfor i in range(n):\n s = input()\n if \"++\" in s:\n X = X+ 1\n else:\n X = X - 1\n\nprint(X)\n\n\t \t \t\t \t \t\t\t\t \t \t \t\t \t\t\t", "x = 0\n\n\nfor i in range(int(input())):\n\tstatement = input()\n\tif statement[:2] == \"++\" or statement[1:] == \"++\":\n\t\tx += 1\n\telif statement[:2] == \"--\" or statement[1:] == \"--\":\n\t\tx -= 1\n\nprint(x)\n", "Number = int(input())\r\nValue = 0;\r\n\r\n\r\nfor i in range(Number):\r\n Bit = str(input())\r\n if Bit == \"++X\" or Bit == \"X++\" or Bit == \"x++\" or Bit == \"++x\":\r\n Value = Value + 1\r\n elif Bit == \"--X\" or Bit == \"X--\" or Bit == \"x--\" or Bit == \"--x\":\r\n Value = Value - 1\r\n \r\nprint(Value)", "t = int(input())\r\nres = 0\r\nfor _ in range(t):\r\n str = input()\r\n if '+' in str:\r\n res += 1\r\n else:\r\n res -= 1\r\nprint(res)", "n=int(input(\"\"))\nl=[]\nx=0\nfor i in range(n):\n l.append(input())\nfor i in l:\n if \"+\" in i:\n x+=1\n else:\n x-=1\nprint(x)", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n s=list(input())\r\n if s[0]=='X':\r\n if s[1]=='-':\r\n x=x-1\r\n else:\r\n x=x+1\r\n else:\r\n if s[0]=='-':\r\n x-=1\r\n else:\r\n x+=1\r\nprint(x)\r\n", "inp = int(input())\r\nlist = []\r\na = 0\r\nfor i in range(0, inp):\r\n b = input()\r\n if b == \"++X\" or b == \"X++\" :\r\n a = a+1\r\n if b == \"--X\" or b == \"X--\" :\r\n a = a-1\r\nprint(a)\r\n", "n = int(input())\r\n\r\nx = 0\r\nfor i in range(n):\r\n inp = input()\r\n if(inp==\"X++\" or inp==\"++X\"):\r\n x+=1\r\n elif(inp==\"--X\" or inp==\"X--\"):\r\n x-=1\r\nprint(x) ", "n = int(input()) # Number of statements in the program\r\nx = 0 # Initial value of variable x\r\n\r\n# Process each statement and perform the operation\r\nfor _ in range(n):\r\n statement = input() # Read the statement\r\n\r\n # Check the operation and update the variable x accordingly\r\n if \"++\" in statement:\r\n x += 1\r\n else: # Statement contains \"--\"\r\n x -= 1\r\n\r\n# Output the final value of variable x\r\nprint(x)\r\n", "statements = input()\r\nint_state = int(statements)\r\nx = 0\r\nfor i in range(int_state):\r\n n = input()\r\n if \"+\" in n:\r\n x += 1\r\n else:\r\n x -= 1\r\nprint(x)", "x = 0\r\n\r\ninp2s = []\r\n\r\ninp1 = int(input())\r\n\r\nfor q in range(inp1):\r\n inp2 = input()\r\n inp2s.append(inp2)\r\n\r\n\r\nfor i in inp2s:\r\n for v in [*i]:\r\n if v == \"+\":\r\n x = x + 0.5\r\n if v == \"-\":\r\n x = x - 0.5\r\n\r\n\r\nprint(int(x))", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n a=str(input())\r\n if a=='++X' or a=='X++':\r\n x+=1 \r\n elif a=='--X' or a=='X--':\r\n x-=1 \r\nprint(x)", "n= int(input())\r\nz=0\r\nfor i in range(n):\r\n ops=input()\r\n if (ops[0]==\"+\" or ops[-1]==\"+\"):\r\n z+=1\r\n else:\r\n z-=1\r\n\r\nprint(z)", "ans = 0\n\nn = int(input())\n\nfor i in range(n):\n x = input()\n if x.__contains__(\"++\"):\n ans += 1\n elif x.__contains__(\"--\"):\n ans -= 1\n\nprint(ans)\n", "ans = 0\nfor i in range(int(input())):\n s = input()\n if s[1] == '+':\n ans += 1\n else:\n ans -= 1\nprint(ans)", "x = 0\r\nfor i in range(int(input())):\r\n operation = input().lower()\r\n if operation in [\"++x\", \"x++\"]:\r\n x += 1\r\n else:\r\n x -= 1\r\n\r\nprint(x)", "def execute_bit_program(program):\r\n # Khởi tạo giá trị ban đầu của x là 0\r\n x = 0\r\n # Duyệt qua từng câu lệnh trong chương trình\r\n for statement in program:\r\n # Nếu câu lệnh có chứa ++ thì tăng x lên 1\r\n if \"++\" in statement:\r\n x += 1\r\n # Nếu câu lệnh có chứa -- thì giảm x đi 1\r\n elif \"--\" in statement:\r\n x -= 1\r\n # Trả về giá trị cuối cùng của x\r\n return x\r\n\r\n# Nhập số nguyên n là số lượng câu lệnh trong chương trình\r\nn = int(input())\r\n# Khởi tạo một danh sách rỗng để lưu trữ các câu lệnh\r\nprogram = []\r\n# Lặp n lần để nhập các câu lệnh\r\nfor i in range(n):\r\n # Nhập một câu lệnh và thêm vào danh sách\r\n statement = input()\r\n program.append(statement)\r\n# Gọi hàm execute_bit_program với đối số là danh sách các câu lệnh\r\n# và in ra kết quả trả về\r\nprint(execute_bit_program(program))\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\ni=l.count(\"X++\")\r\nj=l.count(\"++X\")\r\nk=l.count(\"X--\")\r\nm=l.count(\"--X\")\r\nu=i+j\r\nv=k+m\r\nprint(u-v)\r\n", "x=0\nn=input()\nn=int (n)\nfor i in range(n):\n baraa=input ()\n if baraa==(\"++X\")or baraa==(\"X++\"):\n x=x+1\n else:\n x=x-1\nprint(x)\n \t \t \t\t\t\t\t \t\t\t \t \t\t\t\t\t \t \t", "\r\nn = int(input())\r\n\r\ninputs = []\r\n\r\nfor x in range(0,n):\r\n if '+' in input():ret = 1\r\n else: ret = -1\r\n inputs.append(ret)\r\n\r\n\r\nprint(sum(inputs))", "import re\r\n\r\n\r\nn = int(input())\r\nvalue = 0\r\n\r\nfor i in range(n):\r\n statement = input()\r\n match_plus = re.search(\"\\+\\+\", statement)\r\n # match_minus = re.match('--', statement)\r\n if match_plus:\r\n value += 1\r\n else:\r\n value -= 1\r\n\r\nprint(value)\r\n", "'''\nA. Bit++\nhttps://codeforces.com/problemset/problem/282/A\n'''\n\nimport math\n\ndef main():\n n = int(input())\n x = 0\n for _ in range(n):\n s = input()\n if s == 'X++' or s == '++X':\n x += 1\n else:\n x -= 1\n\n print(x)\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n b = input()\r\n a.append(b)\r\np=0\r\nfor i in range(n):\r\n if a[i][1] == '+':\r\n p+=1\r\n else:\r\n p-=1\r\nprint(p) \r\n\r\n", "import sys\r\ninput1 = int(sys.stdin.readline())\r\nresult = 0\r\nfor i in range(input1):\r\n input2 = str(sys.stdin.readline())\r\n if input2[1] == \"+\":\r\n result += 1\r\n else:\r\n result -= 1\r\nsys.stdout.write(str(result))", "t=int(input())\r\nx=0\r\nfor i in range(t):\r\n a=input()\r\n if '+' in a:\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(x)", "count=0\nfor _ in range(int(input())):\n s=input()\n if s[1]=='+':\n count+=1\n else:\n count-=1\nprint(count)\n \t\t \t\t \t \t \t \t \t \t\t \t \t", "print(sum([1 if input()[1]=='+' else -1 for i in range(int(input()))]))", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n operation = input()\r\n if operation == \"X++\" or operation == \"++X\":\r\n count += 1\r\n else:\r\n count -= 1\r\nprint(count)", "n = int(input())\r\nx = 0\r\nfor i in range (0,n):\r\n a = input()\r\n if (a==\"X++\" or a==\"++X\"):\r\n x = x + 1\r\n else:\r\n x = x - 1\r\n\r\nprint(x)", "c=0\r\nfor i in range(int(input())):\r\n s=input()\r\n for i in range(len(s)-1):\r\n if(s[i]=='+' and s[i+1]=='+'):\r\n c+=1\r\n elif(s[i]=='-' and s[i+1]=='-'):\r\n c-=1\r\nprint(c)", "num=int(input())\ncounter=0\nwhile num!=0:\n num-=1\n word=input()\n if \"++\" in word:\n counter+=1\n elif \"--\" in word:\n counter-=1\n \nprint(counter)", "t=int(input())\r\ns=0\r\nfor i in range(t):\r\n x=input()\r\n if x==\"++X\" or x==\"X++\":\r\n s+=1\r\n else:\r\n s-=1\r\n \r\nprint(s)", "n = int(input())\nx = 0\nfor statement in range(n):\n operation = input()\n for _ in operation:\n if _ == '+':\n x += 1\n break\n elif _ == '-':\n x -= 1\n break\nprint(x)", "X = 0\r\nfor t in range(int(input())):\r\n n = input()\r\n if n == \"X++\":\r\n X += 1\r\n elif n == \"++X\":\r\n X += 1\r\n elif n == \"--X\":\r\n X -= 1\r\n elif n == \"X--\":\r\n X -= 1\r\nprint(X)", "n = int(input())\r\nxvalue = 0\r\n\r\nwhile n > 0:\r\n s = input()\r\n if s == \"++X\" or s == \"X++\":\r\n xvalue += 1\r\n elif s == \"--X\" or s == \"X--\":\r\n xvalue -= 1\r\n n = n - 1\r\n\r\nprint(xvalue)\r\n" ]

{"inputs": ["1\n++X", "2\nX++\n--X", "3\n++X\n++X\n++X", "2\n--X\n--X", "5\n++X\n--X\n++X\n--X\n--X", "28\nX--\n++X\nX++\nX++\nX++\n--X\n--X\nX++\nX--\n++X\nX++\n--X\nX--\nX++\nX--\n++X\n++X\nX++\nX++\nX++\nX++\n--X\n++X\n--X\n--X\n--X\n--X\nX++", "94\nX++\nX++\n++X\n++X\nX--\n--X\nX++\n--X\nX++\n++X\nX++\n++X\n--X\n--X\n++X\nX++\n--X\nX--\nX--\n--X\nX--\nX--\n--X\n++X\n--X\nX--\nX--\nX++\n++X\n--X\nX--\n++X\n--X\n--X\nX--\nX--\nX++\nX++\nX--\nX++\nX--\nX--\nX--\n--X\nX--\nX--\nX--\nX++\n++X\nX--\n++X\nX++\n--X\n--X\n--X\n--X\n++X\nX--\n--X\n--X\n++X\nX--\nX--\nX++\n++X\nX++\n++X\n--X\n--X\nX--\n++X\nX--\nX--\n++X\n++X\n++X\n++X\nX++\n++X\n--X\nX++\n--X\n--X\n++X\n--X\nX++\n++X\nX++\n--X\nX--\nX--\n--X\n++X\nX++", "56\n--X\nX--\n--X\n--X\nX--\nX--\n--X\nX++\n++X\n--X\nX++\nX--\n--X\n++X\n--X\nX--\nX--\n++X\nX--\nX--\n--X\n++X\n--X\n++X\n--X\nX++\n++X\nX++\n--X\n++X\nX++\nX++\n--X\nX++\nX--\n--X\nX--\n--X\nX++\n++X\n--X\n++X\nX++\nX--\n--X\n--X\n++X\nX--\nX--\n--X\nX--\n--X\nX++\n--X\n++X\n--X", "59\nX--\n--X\nX++\n++X\nX--\n--X\n--X\n++X\n++X\n++X\n++X\nX++\n++X\n++X\nX++\n--X\nX--\nX++\n++X\n--X\nX++\n--X\n++X\nX++\n--X\n--X\nX++\nX++\n--X\nX++\nX++\nX++\nX--\nX--\n--X\nX++\nX--\nX--\n++X\nX--\nX++\n--X\nX++\nX--\nX--\nX--\nX--\n++X\n--X\nX++\nX++\nX--\nX++\n++X\nX--\nX++\nX--\nX--\n++X", "87\n--X\n++X\n--X\nX++\n--X\nX--\n--X\n++X\nX--\n++X\n--X\n--X\nX++\n--X\nX--\nX++\n++X\n--X\n++X\n++X\n--X\n++X\n--X\nX--\n++X\n++X\nX--\nX++\nX++\n--X\n--X\n++X\nX--\n--X\n++X\n--X\nX++\n--X\n--X\nX--\n++X\n++X\n--X\nX--\nX--\nX--\nX--\nX--\nX++\n--X\n++X\n--X\nX++\n++X\nX++\n++X\n--X\nX++\n++X\nX--\n--X\nX++\n++X\nX++\nX++\n--X\n--X\n++X\n--X\nX++\nX++\n++X\nX++\nX++\nX++\nX++\n--X\n--X\n--X\n--X\n--X\n--X\n--X\nX--\n--X\n++X\n++X", "101\nX++\nX++\nX++\n++X\n--X\nX--\nX++\nX--\nX--\n--X\n--X\n++X\nX++\n++X\n++X\nX--\n--X\n++X\nX++\nX--\n++X\n--X\n--X\n--X\n++X\n--X\n++X\nX++\nX++\n++X\n--X\nX++\nX--\nX++\n++X\n++X\nX--\nX--\nX--\nX++\nX++\nX--\nX--\nX++\n++X\n++X\n++X\n--X\n--X\n++X\nX--\nX--\n--X\n++X\nX--\n++X\nX++\n++X\nX--\nX--\n--X\n++X\n--X\n++X\n++X\n--X\nX++\n++X\nX--\n++X\nX--\n++X\nX++\nX--\n++X\nX++\n--X\nX++\nX++\n++X\n--X\n++X\n--X\nX++\n--X\nX--\n--X\n++X\n++X\n++X\n--X\nX--\nX--\nX--\nX--\n--X\n--X\n--X\n++X\n--X\n--X", "63\n--X\nX--\n++X\n--X\n++X\nX++\n--X\n--X\nX++\n--X\n--X\nX++\nX--\nX--\n--X\n++X\nX--\nX--\nX++\n++X\nX++\nX++\n--X\n--X\n++X\nX--\nX--\nX--\n++X\nX++\nX--\n--X\nX--\n++X\n++X\nX++\n++X\nX++\nX++\n--X\nX--\n++X\nX--\n--X\nX--\nX--\nX--\n++X\n++X\n++X\n++X\nX++\nX++\n++X\n--X\n--X\n++X\n++X\n++X\nX--\n++X\n++X\nX--", "45\n--X\n++X\nX--\n++X\n++X\nX++\n--X\n--X\n--X\n--X\n--X\n--X\n--X\nX++\n++X\nX--\n++X\n++X\nX--\nX++\nX--\n--X\nX--\n++X\n++X\n--X\n--X\nX--\nX--\n--X\n++X\nX--\n--X\n++X\n++X\n--X\n--X\nX--\n++X\n++X\nX++\nX++\n++X\n++X\nX++", "21\n++X\nX++\n--X\nX--\nX++\n++X\n--X\nX--\nX++\nX--\nX--\nX--\nX++\n++X\nX++\n++X\n--X\nX--\n--X\nX++\n++X", "100\n--X\n++X\nX++\n++X\nX--\n++X\nX--\nX++\n--X\nX++\nX--\nX--\nX--\n++X\nX--\nX++\nX++\n++X\nX++\nX++\nX++\nX++\n++X\nX++\n++X\nX--\n--X\n++X\nX--\n--X\n++X\n++X\nX--\nX++\nX++\nX++\n++X\n--X\n++X\nX++\nX--\n++X\n++X\n--X\n++X\nX--\nX--\nX--\nX++\nX--\nX--\nX++\nX++\n--X\nX++\nX++\n--X\nX--\n--X\n++X\n--X\n++X\n++X\nX--\n--X\n++X\n++X\n--X\n--X\n++X\nX++\nX--\nX++\nX--\nX++\nX++\n--X\nX--\nX--\n++X\nX--\n--X\n--X\nX++\n--X\n--X\nX--\nX--\n++X\n++X\nX--\n++X\nX++\n--X\n++X\n++X\nX++\n--X\n--X\nX++", "17\nX++\nX++\n++X\n--X\n--X\n++X\n++X\n--X\nX--\nX++\nX--\n--X\n--X\nX--\n++X\nX--\nX++", "77\n++X\nX++\n--X\nX--\n--X\n--X\nX--\nX++\nX--\nX++\nX--\n++X\n--X\n--X\n--X\n--X\n++X\nX--\nX++\nX--\n--X\nX--\n--X\nX--\n++X\n--X\n++X\n++X\nX++\nX++\nX--\n--X\nX--\nX--\nX++\n--X\n--X\n++X\nX--\nX--\n++X\nX++\nX--\n++X\n--X\nX++\nX--\n++X\n++X\n++X\nX--\nX--\nX--\n--X\n++X\n++X\n++X\nX++\n--X\n--X\n++X\n--X\nX--\nX++\n++X\nX++\n++X\nX--\nX++\nX++\n--X\nX++\nX++\nX++\n--X\nX++\nX--", "21\nX--\n++X\n--X\nX--\n++X\nX--\n++X\nX--\n--X\n++X\nX++\n++X\nX++\n++X\nX--\n--X\nX++\nX++\nX--\n++X\nX--", "1\nX--"], "outputs": ["1", "0", "3", "-2", "-1", "4", "-10", "-14", "3", "-5", "1", "1", "-3", "1", "8", "-1", "-5", "1", "-1"]}

UNKNOWN

PYTHON3

CODEFORCES

497

8e50612d70a28d84b770df9166669c6b

The Monster

As Will is stuck in the Upside Down, he can still communicate with his mom, Joyce, through the Christmas lights (he can turn them on and off with his mind). He can't directly tell his mom where he is, because the monster that took him to the Upside Down will know and relocate him. Thus, he came up with a puzzle to tell his mom his coordinates. His coordinates are the answer to the following problem. A string consisting only of parentheses ('(' and ')') is called a bracket sequence. Some bracket sequence are called correct bracket sequences. More formally: - Empty string is a correct bracket sequence. - if *s* is a correct bracket sequence, then (*s*) is also a correct bracket sequence. - if *s* and *t* are correct bracket sequences, then *st* (concatenation of *s* and *t*) is also a correct bracket sequence. A string consisting of parentheses and question marks ('?') is called pretty if and only if there's a way to replace each question mark with either '(' or ')' such that the resulting string is a non-empty correct bracket sequence. Will gave his mom a string *s* consisting of parentheses and question marks (using Morse code through the lights) and his coordinates are the number of pairs of integers (*l*,<=*r*) such that 1<=≤<=*l*<=≤<=*r*<=≤<=|*s*| and the string *s**l**s**l*<=+<=1... *s**r* is pretty, where *s**i* is *i*-th character of *s*. Joyce doesn't know anything about bracket sequences, so she asked for your help. The first and only line of input contains string *s*, consisting only of characters '(', ')' and '?' (2<=≤<=|*s*|<=≤<=5000). Print the answer to Will's puzzle in the first and only line of output. Sample Input ((?)) ??()?? Sample Output 4 7

[ "st=input()\r\nle=len(st)\r\nans=0\r\nfor i in range(le):\r\n l=0\r\n w=0\r\n for j in range(i,le):\r\n if(st[j]==\"(\"):\r\n l+=1\r\n elif(st[j]==\")\"):\r\n l-=1\r\n else:\r\n w+=1\r\n if(l+w<0):\r\n break\r\n elif(w>l):\r\n xx=l\r\n l=w\r\n w=xx\r\n elif(l==w):\r\n ans+=1\r\nprint(ans)", "\r\ndef main():\r\n s = input()\r\n l = len(s)\r\n \r\n pretty_count = 0\r\n for i in range(l):\r\n left_paren_count = 0\r\n right_paren_count = 0\r\n wild_count = 0\r\n for j in range(i, l):\r\n if s[j] == '(':\r\n left_paren_count += 1\r\n elif s[j] == ')':\r\n right_paren_count += 1\r\n else: \r\n wild_count += 1\r\n \r\n if left_paren_count + wild_count < right_paren_count:\r\n break\r\n if left_paren_count < wild_count + right_paren_count:\r\n # Should fix one '?' as '('\r\n wild_count -= 1\r\n left_paren_count += 1\r\n if wild_count < 0:\r\n break\r\n if left_paren_count == wild_count + right_paren_count:\r\n pretty_count += 1\r\n print(pretty_count)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\nimport math\r\nfrom collections import defaultdict,deque\r\ns=sys.stdin.readline()[:-1]\r\nn=len(s)\r\ndp=[[False for _ in range(n)] for x in range(n)]\r\nleft=[n for _ in range(n)]\r\nans=0\r\nfor i in range(n-1,-1,-1):\r\n right=i\r\n for j in range(i+1,n):\r\n if j-i+1==2:\r\n if (s[i]=='(' or s[i]=='?') and (s[j]==')' or s[j]=='?'):\r\n dp[i][j]=True\r\n left[j]=min(left[j],i)\r\n right=j\r\n ans+=1\r\n continue\r\n if (j-i+1)%2==0:\r\n l=left[j]\r\n if dp[i][l-1]:\r\n dp[i][j]=True\r\n left[j]=i\r\n right=j\r\n ans+=1\r\n continue\r\n if dp[right+1][j]:\r\n dp[i][j]=True\r\n left[j]=i\r\n right=j\r\n ans+=1\r\n continue\r\n if (s[i]=='(' or s[i]=='?') and (s[j]==')' or s[j]=='?'):\r\n if dp[i+1][j-1]:\r\n dp[i][j]=True\r\n left[j]=i\r\n right=j\r\n ans+=1\r\n continue\r\n#print(dp,'dp')\r\n'''for i in range(n):\r\n print(dp[i])'''\r\nprint(ans)\r\n \r\n \r\n", "s=input().strip();n=len(s)\r\nques=ans=ini=0\r\nfor i in range(n):\r\n ques=ini=0\r\n for j in range(i,n):\r\n c=s[j]\r\n if(c==\"?\"):ques+=1 \r\n elif(c=='('):ini+=1\r\n else:ini-=1 #present situation dekh li\r\n if(ini<0):break #invalid cheez h bhaaya\r\n if(ques>ini): #agr mujhe wo question mark opening se replace krna jo ki krna hi h\r\n ques-=1;ini+=1; #ye kr denge hum fir\r\n if((j-i+1)%2==0 and ques==ini):ans+=1 #aur ques fir ini ke barabar hi hone chahiye kyu ki hum baa\r\nprint(ans) #baar baar quest mark ko ini jo ki >o h se replace kr rhe h\r\n \r\n ", "s = input()\r\na=0\r\nn=len(s)\r\nfor i in range(n):\r\n l=0\r\n k=0\r\n for j in range(i, n):\r\n l+=s[j]=='('\r\n l-=s[j]==')'\r\n k+=s[j]=='?'\r\n if l+k<0:\r\n break\r\n if k>l:\r\n l,k = k,l\r\n if l==k:\r\n a+=1\r\nprint(a)\r\n", "s = input()\r\nl = len(s)\r\nans = 0\r\nfor i in range(0, l):\r\n m = n = 0\r\n for j in range(i, l):\r\n m += s[j] == '('\r\n m -= s[j] == ')'\r\n n += s[j] == '?'\r\n if m + n < 0:\r\n break\r\n if m < n:\r\n m, n = n, m \r\n ans += m == n\r\nprint (ans)", "s = str(input())\r\nn = len(s)\r\n\r\nans = 0\r\nfor l in range(n-1):\r\n cnt = 0\r\n qu = 0\r\n chk = 0\r\n if s[l] == '(':\r\n cnt += 1\r\n chk += 1\r\n elif s[l] == '?':\r\n qu += 1\r\n chk = max(chk-1, 0)\r\n else:\r\n continue\r\n for r in range(l+1, n):\r\n if s[r] == '(':\r\n cnt += 1\r\n chk += 1\r\n elif s[r] == '?':\r\n qu += 1\r\n chk = max(chk-1, 0)\r\n else:\r\n cnt -= 1\r\n chk = max(chk-1, 0)\r\n if cnt+qu < 0:\r\n break\r\n else:\r\n if (qu-cnt)%2 == 0 and qu-cnt >= 0 and (qu-cnt)//2 <= qu and chk <= 0:\r\n #print(l, r)\r\n ans += 1\r\nprint(ans)\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ndef answer():\r\n\r\n yes = [[1 for i in range(n)] for i in range(n)]\r\n\r\n for i in range(n - 1 , -1 , -1):\r\n\r\n left , right , q = 0 , 0 , 0\r\n for j in range(i , n):\r\n left += (a[j] == '(')\r\n right += (a[j] == ')')\r\n q += (a[j] == '?')\r\n\r\n if(left + q < right):\r\n\r\n for k in range(j , n):\r\n yes[i][k] = 0\r\n\r\n break\r\n\r\n total = left + right + q\r\n if(abs(left - right) > q):yes[i][j] = 0\r\n if(total & 1):yes[i][j] = 0\r\n\r\n \r\n left , right , q = 0 , 0 , 0\r\n for j in range(i , -1 , -1):\r\n left += (a[j] == '(')\r\n right += (a[j] == ')')\r\n q += (a[j] == '?')\r\n\r\n if((right + q) < left):\r\n\r\n for k in range(j + 1):\r\n yes[k][i] = 0\r\n\r\n break \r\n\r\n ans = 0\r\n for i in range(n):\r\n for j in range(i , n):\r\n ans += yes[i][j]\r\n \r\n return ans\r\n \r\n\r\n \r\nfor T in range(1):\r\n\r\n a = input().strip()\r\n n = len(a)\r\n\r\n print(answer())\r\n", "s = input()\r\nres, n = 0, len(s)\r\nfor i in range(n-1):\r\n j, c, q = i , 0, 0\r\n while j < n and c + q >= 0:\r\n if(s[j] == '('): c += 1\r\n elif(s[j] == ')'): c -= 1\r\n else: q += 1\r\n\r\n if(c < q):\r\n c, q = q, c\r\n res += (c == q)\r\n j += 1\r\nprint(res)\r\n", "s = input()\r\nans = 0\r\nfor i in range(0, len(s) - 1):\r\n addQ = 0\r\n subQ = 0\r\n cur = 0\r\n for j in range(i, len(s)):\r\n if s[j] == '(':\r\n cur += 1\r\n elif s[j] == ')':\r\n cur -= 1\r\n if cur < 0 and subQ > 0:\r\n cur += 2\r\n subQ -= 1\r\n addQ += 1\r\n else:\r\n if cur > 0:\r\n subQ += 1\r\n cur -= 1\r\n else:\r\n addQ += 1\r\n cur += 1\r\n if cur < 0:\r\n break\r\n if cur == 0:\r\n ans += 1\r\nprint(ans)\r\n" ]

{"inputs": ["((?))", "??()??", "?????)(???", "()()((?(()(((()()(())(((()((())))(()))(()(((((())))()))(((()()()))))))(((((()))))))))", "))((()(()((((()))())()())((())())(((()()(())))))((())()()(()()(())()))()()(()()()(((()(()(()(()))))(", "????????????????????????????????????????????????????????????????????????????????????????????????????", ")(", "?(", "??", ")?(??((???????()?(?????????)??(????????((?)?????)????)??????(?????)?)?????)??????(??()??????)????????)?)()??????????????())????????(???)??)????????????????????(?????)??)???)??(???????????????)???)??)?", "()", "(?"], "outputs": ["4", "7", "21", "62", "88", "2500", "0", "0", "1", "8314", "1", "1"]}

UNKNOWN

PYTHON3

CODEFORCES

10

8e64f356f5e4e4ae535eb42d9e1ea3df

Fancy Fence

Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot. He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence corners at a single angle *a*. Will the robot be able to build the fence Emuskald wants? In other words, is there a regular polygon which angles are equal to *a*? The first line of input contains an integer *t* (0<=<<=*t*<=<<=180) — the number of tests. Each of the following *t* lines contains a single integer *a* (0<=<<=*a*<=<<=180) — the angle the robot can make corners at measured in degrees. For each test, output on a single line "YES" (without quotes), if the robot can build a fence Emuskald wants, and "NO" (without quotes), if it is impossible. Sample Input 3 30 60 90 Sample Output NO YES YES

[ "\r\nt = int(input())\r\nrj = []\r\nfor i in range(t):\r\n a = int(input())\r\n\r\n if a < 60:\r\n rj.append('NO')\r\n\r\n else:\r\n n = 3\r\n kut = ((n-2)*180)/n\r\n\r\n while a >= kut:\r\n if a == kut:\r\n rj.append('YES')\r\n break\r\n n+=1\r\n kut = ((n-2)*180)/n\r\n \r\n else:\r\n rj.append('NO')\r\n\r\nprint(*rj, sep = \"\\n\")", "def fence():\r\n a = int(input())\r\n \r\n n = 360 / (180 - a)\r\n \r\n if n == int(n):\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n\r\n\r\nt = int(input())\r\n\r\nfor _ in range(t):\r\n print(fence())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 12 15:20:42 2022\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\nt=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n print('YES' if 360%(180-a)==0 else'NO')", "\r\nt = int(input())\r\n\r\nfor _ in range(t):\r\n angle = int(input())\r\n\r\n i = 3\r\n\r\n while True:\r\n\r\n total = (i - 2)*180\r\n\r\n in_angle = total/i\r\n\r\n if in_angle > angle:\r\n print('NO')\r\n break\r\n\r\n elif angle == in_angle:\r\n print('YES')\r\n break\r\n\r\n i += 1\r\n\r\n\r\n", "#王铭健，工学院 2300011118\r\nt = int(input())\r\nresult_list = []\r\nfor i in range(t):\r\n angle = int(input())\r\n if 360 % (180 - angle) == 0:\r\n result_list.append('YES')\r\n else:\r\n result_list.append('NO')\r\nfor j in result_list:\r\n print(j)", "import math\r\n\r\nfor _ in range( int(input()) ):\r\n a = int(input())\r\n n = (360)/(180-a)\r\n print('YNEOS'[not math.floor(n)==n::2])\r\n", "#黄靖涵 2300098604 工学院 2023秋\r\n\r\nt = int(input())\r\n\r\ndef angle(a):\r\n if 360 % (180 - a):\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\nfor i in range(t):\r\n a = int(input())\r\n ans = angle(a)\r\n print(ans)", "t = int(input())\r\nfor _ in range(t):\r\n angle = int(input())\r\n print(\"YES\" if 360 % (180-angle) == 0 else \"NO\")\r\n", "#I = lambda: [int(i) for i in input().split()]\r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\n\r\n# n = int(input())\r\n# l1 = list(map(int,input().split()))\r\n# n,x = map(int,input().split())\r\n# s = input()\r\nmod = 1000000007\r\n# print(\"Case #\"+str(_+1)+\":\",)\r\n\r\nfrom collections import Counter,defaultdict,deque\r\n#from heapq import heappush,heappop,heapify\r\nimport sys\r\nimport math\r\nimport bisect\r\n\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n if 360%(180-n):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n\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-2) *180 /n = a\r\n# 180 n - 360 = an\r\n# n(180-a) = 360\r\n# n = 360 / (180-a)\r\nt = int(input())\r\nwhile t:\r\n t-=1\r\n a = int(input())\r\n n = 360 / (180-a)\r\n if(int(n)==n):\r\n print('YES')\r\n else:\r\n print('NO')", "w = int(input())\r\nfor i in range(w):\r\n x = int(input())\r\n if (360 / (180 - x)) % 1 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "found=set()\r\nn=3\r\nwhile 1:\r\n ang=(180*n-360)/n\r\n if ang>179:\r\n break\r\n if int(ang)*n==180*n-360:\r\n found.add(int(ang))\r\n n+=1\r\n\r\nt=int(input())\r\nfor _ in range(t):\r\n a=int(input())\r\n if a in found:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "k=int(input())\r\nl=[]\r\nfor i in range(k):\r\n a=int(input())\r\n n=(360)/(180-a)\r\n l.append(n)\r\nfor j in range(len(l)):\r\n if l[j]%1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Oct 15 22:11:18 2023\r\n\r\n@author: huozi\r\n\"\"\"\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n a = int(input())\r\n if 360 % (180 - a) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from sys import stdin\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\nfrom math import floor, ceil\r\n\r\n# input = stdin.readline\r\nread = lambda: map(int, input().strip().split())\r\n\r\nfor test in range(int(input())):\r\n a = int(input())\r\n if floor(360 / (180 - a)) == ceil(360 / (180 - a)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def polygon():\r\n angle = int(input())\r\n counter = 3\r\n if angle < 60:\r\n print(\"NO\")\r\n return\r\n while angle >= ((counter - 2) * 180) / counter:\r\n if angle == ((counter - 2) * 180) / counter:\r\n print(\"YES\")\r\n return\r\n counter += 1\r\n print(\"NO\")\r\n\r\n\r\n\r\ncases = range(int(input()))\r\nfor case in cases:\r\n polygon()", "def solve(a):\r\n for i in range(3, 1000):\r\n ugol = 180 * (i - 2) / i\r\n if ugol == a:\r\n return \"YES\"\r\n return \"NO\"\r\ndef main():\r\n t = int(input())\r\n for z in range(t):\r\n a = int(input())\r\n print(solve(a))\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "for _ in range(int(input())):\r\n K = 360/(180-int(input()))\r\n if K == int(K) and K>=3: print(\"YES\")\r\n else: print(\"NO\")", "for _ in range(int(input())):\r\n angle = int(input())\r\n if (-360 / (angle - 180)) > 0 and (-360 / (angle - 180)) % 1 == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "angles = []\r\nfor i in range(3, 361):\r\n angle = ((i - 2) * 180) / i\r\n if angle == int(angle):\r\n angles.append(int(((i - 2) * 180) / i))\r\n\r\ntests = int(input())\r\nwhile tests > 0:\r\n angle = int(input())\r\n tests -= 1\r\n if angle in angles:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n", "from sys import stdin, stdout\r\nimport math\r\nt = int(stdin.readline())\r\nfor i in range(t):\r\n a = int(stdin.readline())\r\n if (360/(180-a))==math.ceil(360/(180 - a)):\r\n stdout.write(\"YES\\n\")\r\n else:\r\n stdout.write(\"NO\\n\")\r\n \r\n ", "def solve():\r\n n = int(input())\r\n if 360 % (180 - n) == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\n\r\nfor i in range(int(input())):\r\n print(solve())", "\"\"\"\r\n $$$$$ $$$$$ $$$$$$ $ $\r\n $ $ $ $ $ $$ $$\r\n $ $ $ $ $$$$$ $ $$ $\r\n $$$$$ $$$$$ $ $ $\r\n $ $ $ $ $ $\r\n $ $ $ $$$$$$ $ $\r\n \"\"\"\r\nfor _ in range(int(input())):\r\n Q = int(input())\r\n n = 360/(180-Q)\r\n N=360//(180-Q)\r\n if n==N:\r\n print('YES')\r\n else :\r\n print('NO')\r\n", "from sys import stdin, stdout\r\n#from bisect import bisect_left, bisect_right\r\n#from collections import Counter, deque\r\n#from queue import Queue\r\n#import heapq\r\nimport math\r\n#from itertools import permutations, combinations, islice\r\n\r\ndef input():\r\n return stdin.readline().strip()\r\n\r\ndef solve():\r\n a = int(input())\r\n ans = 360/(180-a)\r\n s = math.ceil(360/(180-a))\r\n if ans == s:\r\n return f\"YES\\n\" \r\n else:\r\n return f\"NO\\n\"\r\n\r\ndef main():\r\n n = int(input())\r\n for i in range(n):\r\n stdout.write(solve())\r\n\r\nmain()", "n=int(input())\r\nfor i in range(n):\r\n a = int(input())\r\n if a>179:\r\n print(\"NO\")\r\n else:\r\n k = 360/(180-a)\r\n x1 = str(k)\r\n d = x1.find(\".\")\r\n x2 = x1[d+1:]\r\n if int(x2)>0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "import math\r\ntestAmount = int(input())\r\n\r\nfor i in range(testAmount):\r\n angle = int(input())\r\n sideAmount = 360/(180-angle)\r\n answer = 'NO'\r\n if (sideAmount > 2 and sideAmount == math.ceil(sideAmount)):\r\n answer = 'YES'\r\n print(answer)\r\n", "numTestCases = int(input())\r\nfor i in range(numTestCases):\r\n i = int(input())\r\n n = -(360/(i - 180))\r\n if n.is_integer():\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "[print(\"NO\" if 360 % (180 - int(input())) else \"YES\") for _ in range(int(input()))]\r\n\r\n#########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n#########################################", "t = int(input())\r\nwhile t:\r\n t-=1\r\n a = int(input())\r\n a = 180 - a\r\n if 360 % a != 0:\r\n print(\"NO\")\r\n else:\r\n n = 360 // a\r\n if ((n - 2) * 180) // n == 180 - a and ((n - 2) * 180) % n == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "lst = []\nfor sides in range(3, 361):\n temp = ((sides - 2) * 180) / sides\n if temp == int(round(temp)):\n lst.append(int(temp))\namt = int(input())\nfor x in range(amt):\n if int(input()) in lst:\n print('YES')\n else:\n print('NO')", "for _ in range(int(input())):\r\n n = int(input())\r\n m = 360 / (180 - n)\r\n if m % 1 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\na=[]\r\nfor i in range(t):\r\n a.append(int(input()))\r\nfor i in range(t):\r\n x=360/(180-a[i])\r\n if x==int(x):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n", "t=int(input())\r\nfor _ in range(t):\r\n a=int(input())\r\n n=2/(1-a/180)\r\n if abs(n-round(n))<10**(-3):\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n if a in [60,90,108,120,135,140,144,150,156,160,162,165,168,170,171,172,174,175,176,177,178,179]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "# 180(n-2)/n = x\n# xn = 180n-360\n# x + 360 = 180n/n\n\nt = int(input())\n\nfor i in range(t):\n a = int(input())\n if (360 / (180-a)).is_integer():\n print(\"YES\")\n else:\n print(\"NO\")\n", "from sys import stdin\r\n\r\ndata = list(map(str.strip, stdin))\r\nb = int(data[0])\r\ndata = data[1:]\r\n\r\nfor i in data:\r\n a = float(i)\r\n n = 360 / (180 - a)\r\n if n * 100 == int(n) * 100:\r\n print('YES')\r\n else:\r\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\n\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n\r\n############ ---- Output Functions ---- ############\r\ndef outp(num):\r\n output(str(num) + '\\n')\r\n\r\ndef outlt(lst):\r\n output(' '.join(lst) + '\\n')\r\n\r\ndef outsr(st):\r\n output(''.join(st) + '\\n')\r\n\r\n\r\n############ ---- Solution Functions ---- ############\r\ndef solution():\r\n n = inp()\r\n angles = [inp() for _ in range(n)]\r\n\r\n for angle in angles:\r\n if 360 % (180 - angle) == 0:\r\n outsr('YES')\r\n else:\r\n outsr('NO')\r\n\r\nif __name__ == \"__main__\":\r\n solution()", "# 270/A\r\nt = int(input())\r\n\r\ninput_degrees = []\r\n\r\nfor _ in range(t):\r\n input_degree = int(input())\r\n input_degrees.append(input_degree)\r\n\r\ndegree_list = []\r\n\r\nfor theta in range(60, 180):\r\n for n in range(3, 361):\r\n if (n-2)*180 == n * theta:\r\n degree_list.append(theta)\r\n\r\nfor element in input_degrees:\r\n if element in degree_list:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "x = '''60\n90\n108\n120\n135\n140\n144\n150\n156\n160\n162\n165\n168\n170\n171\n172\n174\n175\n176\n177\n178\n179'''\n\ny = x.split()\nn = int(input())\nfor i in range(n):\n a = str(input())\n \n if a in y:\n print('YES')\n else:\n print('NO')\n\n", "t = int(input())\r\n\r\nfor i in range(t):\r\n a = int(input())\r\n n = 360.0 / (180.0 -a)\r\n if (n == int(n)):\r\n print(\"YES\")\r\n else: print(\"NO\")", "t=int(input())\r\nfor x in range(t):\r\n y=int(input())\r\n s=360/(180-y)\r\n if s==int(s) :\r\n print('YES')\r\n else :\r\n print('NO')\r\n\r\n", "rounds=input()\r\nq=1\r\nwhile q<=int(rounds):\r\n angle=int(input())\r\n if int(360/(180-angle))==360/(180-angle):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n q=q+1", "n=int(input())\r\nfor i in range(n):\r\n q=int(input())\r\n if(360%(180-q)==0):\r\n print('YES')\r\n else:\r\n print('NO')", "need_cycle = int(input())\r\nfor i in range(need_cycle):\r\n angle = 180-int(input())\r\n if 360 % angle ==0:\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nli=[]\r\nfor i in range(t):\r\n a=int(input())\r\n n=360/(180-a)\r\n li.append(n)\r\nfor i in range(t):\r\n b=li[i]\r\n if b==int(b) and int(b)>2:\r\n print('YES')\r\n else: print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 13 21:49:53 2023\r\n\r\n@author: 2300011794\r\n\"\"\"\r\nt=int(input())\r\nfor i in range(t):\r\n ang=int(input())\r\n if 360%(180-ang)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 10 17:01:27 2023\r\n\r\n@author: 赵语涵2300012254\r\n\"\"\"\r\n\r\nanswer = []\r\nfor _ in range(int(input())):\r\n a = int(input())\r\n n = round(180/(90-a/2))\r\n if (90-180/n)*2 == a:\r\n answer.append('YES')\r\n else:\r\n answer.append('NO')\r\nfor i in answer:\r\n print(i)", "t = int(input())\r\nL = [int(input()) for x in range(t)]\r\nfor i in L:\r\n print('NO') if 360%(180-i) else print('YES')", "#!/usr/bin/env python3\n\nif __name__ == \"__main__\":\n for i in range(int(input())):\n a = int(input())\n n_int = 360//(180 - a)\n n_float = 360/(180 - a)\n print(\"YES\" if n_int == n_float else \"NO\")\n", "for _ in range(int(input())):\n t=int(input())\n external=180-t \n if(external<=0):\n print(\"-1\")\n else:\n if(360%external==0):\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t \t\t\t \t \t \t\t \t \t\t \t\t \t", "n = int(input())\r\nwhile(n>0):\r\n q = int(input())\r\n kraj=0\r\n for i in range(3,10000):\r\n if(q==180*(i-2)/i):\r\n print(\"YES\")\r\n kraj=1\r\n break\r\n if(kraj==0):\r\n print(\"NO\")\r\n n-=1", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n x = 360/(180-n)\r\n if n==60 or n==90 or n==120 or n==108 or n==128.57 or n==135 or n==140 or n==144 or n==162 or n==180:\r\n print(\"YES\")\r\n elif x==round(x):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\nn=int(input())\r\nfor i in range(n):\r\n k=int(input())\r\n print(['NO','YES'][360%(180-k)==0])", "n = int(input())\r\nfor i in range(n):\r\n t = int(input())\r\n print('YES' if 360%(180-t) == 0 else 'NO')", "t = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n n = 3\r\n while True:\r\n if a < (n - 2) * 180 / n:\r\n print('NO')\r\n break\r\n if a == (n - 2) * 180 / n:\r\n print('YES')\r\n break\r\n n += 1\r\n", "n=int(input())\r\nfor i in range(n):\r\n x=int(input())\r\n a=180-x\r\n if 360//a==360/a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 1 11:38:18 2021\r\n\r\n@author: Nikiq\r\n\"\"\"\r\n'''\r\nt = int(input())\r\nfor i in range (t):\r\n a = int(input())\r\n if a >=60 and 360%a == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n# this is only considering polygon has all sides equal. \r\n'''\r\n\r\nt = int(input())\r\nfor i in range (t):\r\n a = int(input())\r\n outer = 180-a\r\n if a >=60 and 360%outer == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "testCases = int(input())\r\nfor i in range(testCases):\r\n angle = int(input())\r\n supplimentryAngle = 180 - angle\r\n if 360 % supplimentryAngle == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "t = int(input())\r\n\r\nans = list('NO' for i in range(t))\r\nfor i in range(t):\r\n a = int(input())\r\n if 360 % (180 - a) == 0:\r\n ans[i] = 'YES'\r\n\r\nprint(*ans, sep = '\\n')", "#from collections import defaultdict\n\nimport bisect\n\ndef find_le(a, x):\n 'Find rightmost value less than or equal to x'\n i = bisect.bisect_right(a, x)\n if i:\n return i-1\n return -1\n\n\n\nn=int(input())\nfor _ in range(n):\n x=int(input())\n if(360%(180-x)==0):\n print(\"YES\")\n else:\n print(\"NO\")\n", "\r\nt=int(input())\r\nfor i in range(t):\r\n angle=int(input())\r\n if angle<60 or angle>=180:\r\n print(\"NO\")\r\n else:\r\n if 360/(180-angle)==360//(180-angle):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n t=360%(180-a)\r\n if t==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for _ in range (int(input())):\r\n a=int(input())\r\n print(\"NO\") if (360%(180-a)) else print(\"YES\")", "n=int(input())\r\nwhile n>0:\r\n a=int(input())\r\n k=360/(180-a)\r\n n-=1\r\n if int(k) == k:\r\n print('YES')\r\n else:\r\n print('NO')", "# Fancy Fence\r\nt = int(input())\r\nfor i in range(t):\r\n x = int(input())\r\n n = (1/(180-x))*360\r\n if n == int(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from fractions import Fraction\r\nt = int(input())\r\nv = []\r\nfor i in range(t):\r\n a = int(input())\r\n n = Fraction(2,1 - Fraction(a,180))\r\n if int(n) == n:\r\n v.append('YES')\r\n else:\r\n v.append('NO')\r\nprint(*v,sep = '\\n')", "t = int(input())\nfor _ in range(t):\n a = int(input())\n # a*n=180*(n-2) => n*(180-a)=360\n _, r = divmod(360, 180 - a)\n res = \"YES\" if r == 0 else \"NO\"\n print(res)\n", "t = int(input())\r\nresult = []\r\nfor _ in range(t):\r\n a = int(input())\r\n n = 360/(180-a)\r\n if n - int(n) == 0:\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\nfor letter in result:\r\n print(letter)", "#游敬恩 2300012555\r\nn = int(input())\r\nfor i in range(n):\r\n angle = int(input())\r\n a = 0\r\n l = 3\r\n ind = 0\r\n while a <= angle:\r\n a = (l - 2)/l * 180\r\n if a == angle:\r\n ind = 1\r\n else:\r\n pass\r\n l += 1\r\n if ind == 1:\r\n print('YES')\r\n else:\r\n print('NO')", "n = input()\r\np = []\r\nfor i in range(0,int(n)):\r\n l = input()\r\n p.append(int(l))\r\nfor i in range(0,len(p)):\r\n if 360%(180 - p[i]) == 0:\r\n print('YES')\r\n else:\r\n print('NO') ", "n = int(input())\r\nfor i in range(n):\r\n x = int(input())\r\n if (-2 * x) % (180 - x) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\r\nt=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n sides=360/(180-n)\r\n if math.ceil(sides)!=sides:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "for i in range(int(input())):\r\n du=int(input())\r\n num=360/(180-du)\r\n if num!=int(num):\r\n print('NO')\r\n else:\r\n print('YES')", "n = int(input())\r\nfor i in range(n):\r\n degree = int(input())\r\n if 360%(180-degree)==0 and degree>=60:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nwhile t>0:\r\n n = int(input())\r\n if (360//(180-n))==(360/(180-n)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n t-=1", "def main():\r\n n_tests = int(input())\r\n for _ in range(n_tests):\r\n a = int(input())\r\n if -360 % (a - 180) == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nimport sys\r\nif __name__ == \"__main__\":\r\n # orig_stdout = sys.stdout\r\n # with open('output.txt', 'w') as f:\r\n # sys.stdout = f\r\n main()\r\n # sys.stdout = orig_stdout", "n=int(input())\r\nb=[]\r\nfor x in range(0,n):\r\n a=int(input())\r\n if(360%(180-a)==0):\r\n b.append(1)\r\n else:\r\n b.append(0)\r\nfor x in range(0,n):\r\n if(b[x]==1):\r\n print('YES')\r\n else:\r\n print('NO')", "list_1=[]\r\nfor _ in range(int(input())):\r\n list_1.append(int(input()))\r\ndef polygon(x):\r\n if 360%(180-x)==0:\r\n return True\r\n else:\r\n return False\r\nfor angles in list_1:\r\n if polygon(angles):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from pickle import TRUE\r\nimport sys\r\n\r\nt = int(input())\r\na = []\r\ncheck = []\r\nfor nem in range(t):\r\n angle = int(input())\r\n check.append(angle)\r\nb = sorted(check,reverse = True)\r\nz = 0\r\ni = 1\r\nif b[0] < 60:\r\n for i in range(t):\r\n print('NO')\r\n sys.exit(0)\r\nj = 0\r\nwhile 1:\r\n if b[j] <= 180:\r\n break\r\n j += 1\r\nwhile z < b[j]:\r\n z = 180 * i / (i+2)\r\n i += 1\r\n a.append(z)\r\nfor i in range(t):\r\n if check[i] in a:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n n = int(input())\r\n k = 360/(180 - n)\r\n if k == int(k):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# 270A - Fancy Fence\r\nfor _ in range(int(input())):\r\n print(\"YES\") if (360/(180-int(input()))) % 1 == 0 else print(\"NO\")\r\n", "x=int(input())\r\narr=[]\r\nfor i in range(x):\r\n inp=int(input())\r\n arr.append(inp)\r\nfor i in arr:\r\n res=360/(180-i)\r\n if res%1==0:\r\n print('YES')\r\n else:\r\n print('NO')", "def main():\r\n n = int(input())\r\n for _ in range(n):\r\n t = int(input())\r\n if int(360 / (180 - t)) == 360 / (180 - t):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "T = int(input())\r\nfor _ in range(T):\r\n A = int(input())\r\n ##angle = 180(n-2)/n\r\n angulo = A*-1\r\n n = 2/((angulo+180)/180)\r\n #print((n) %10)\r\n if(((n) %10).is_integer()):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nangles = []\r\nwhile len(angles) != t:\r\n angles.append(int(input()))\r\n\r\nfor a in angles:\r\n n = 360/(180-a)\r\n if n-int(n) == 0.0:\r\n print('YES')\r\n else:\r\n print('NO')", "x=int(input())\r\nfor _ in range(x):\r\n y=int(input())\r\n if 360%(180-y)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from math import floor \r\nl=[]\r\n\r\nfor i in range(3,500):\r\n\tang=180*(i-2)/i\r\n\tif(ang==floor(ang)):\r\n\t\tl.append(int(ang))\r\n\r\ns=set(l)\r\n\r\nn=int(input())\r\n\r\nfor _ in range(n):\r\n\ta=int(input())\r\n\tif(a in l):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\n", "t = int(input())\r\nfor _ in range(t):\r\n a_c = 180 - int(input())\r\n print('NO' if 360 % a_c else 'YES')\r\n", "n = int(input())\r\nfor i in range(n):\r\n digit = int(input())\r\n x = -360 / (digit - 180)\r\n if x == int(x):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "if __name__ == \"__main__\":\n for _ in range(int(input())):\n a = int(input())\n if 360%(180-a) == 0: print(\"YES\")\n else: print(\"NO\")", "n = int(input())\r\nm = []\r\nfor j in range(3,10000):\r\n b = 180*(j-2)/j\r\n m.append(b)\r\nfor i in range(n):\r\n a = int(input())\r\n if a in m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "# import round\r\n\r\nfor _ in range(int(input())):\r\n i = int(input())\r\n val = round(2/(1-(i/180)), 8)\r\n # print(val)\r\n if val.is_integer():\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\nfor i in range(n):\r\n num = int(input())\r\n if int(360 / (180 - num)) == (360 / (180 - num)):\r\n print('YES')\r\n else:\r\n print('NO')", "def main():\n n = int(input())\n t = []\n for _ in range(n):\n t.append(int(input()))\n for a in t:\n if 360 % (180 - a) == 0: print(\"YES\")\n else: print(\"NO\")\n\nmain()\n\t \t \t \t \t\t \t \t\t\t \t \t \t \t", "n=int(input())\r\na=[180-360/x for x in range(3,361)]\r\nfor i in range(n):\r\n if float(input()) in a:\r\n print('YES')\r\n else:\r\n print('NO')", "n=int(input())\r\ns=[]\r\na=[]\r\nfor i in range(360):\r\n x=180-360/(i+1)\r\n if x==int(x):\r\n a.append(x) \r\nfor i in range(n):\r\n s.append(int(input()))\r\nfor i in range(n):\r\n if s[i] in a:\r\n print('YES')\r\n else:\r\n print('NO')", "angles = set()\r\nfor i in range(3,1000):\r\n q,r = divmod((i-2)*180, i) \r\n if r == 0:\r\n angles.add(q)\r\n\r\nn = int(input())\r\nout = []\r\nfor _ in range(n):\r\n ang = int(input())\r\n if ang in angles:\r\n out.append(\"YES\")\r\n else:\r\n out.append(\"NO\")\r\nprint(\"\\n\".join(out))", "t = int(input())\r\nfor i in range(t):\r\n angle = int(input())\r\n print(\"YES\" if 360 % (180 - angle) == 0 else \"NO\")", "t = int(input())\n\nfor i in range(t):\n\ta = int(input())\n\ta = 180 - a\n\tif 360 % a == 0:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\t \t\t \t \t\t\t \t \t \t\t \t\t \t", "t = int(input())\na = []\nfor i in range(t):\n a1 = int(input())\n a.append(a1)\n \n\n\n\nfor i in range(t):\n x = a[i-1]\n n = 360/(180-x)\n a[i-1] = n \n\n\nfor i in range(t):\n if a[i-1].is_integer():\n a[i-1] = (\"YES\")\n else:\n a[i-1] = (\"NO\")\n\n\n\nfor i in range(len(a)):\n print(a[i])\n", "from sys import stdin, stdout\n\nINF = float('inf')\n\ndef input():\n return stdin.readline().strip()\n\ndef print(*args, sep=' ', end='\\n'):\n stdout.write(sep.join([f\"{arg}\" for arg in args]) + end)\n\ndef lints():\n return list(map(int, input().split()))\n\ndef solve():\n a = int(input())\n if 360 % (180 - a) == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n return\n\nif __name__ == \"__main__\":\n # Use test cases\n tc = 1\n tc = int(input())\n\n for _ in range(tc):\n solve()", "# warm heart, wagging tail, and a smile just for you!\r\n# ███████████\r\n# ███╬╬╬╬╬╬╬╬╬╬███\r\n# ███╬╬╬╬╬████╬╬╬╬╬╬███\r\n# ███████████ ██╬╬╬╬╬████╬╬████╬╬╬╬╬██\r\n# █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██\r\n# ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██\r\n# ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██\r\n# ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██\r\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 _ in range(int(input())):\r\n ang = int(input())\r\n if 360/(180-ang) == 360//(180-ang) > 0: print(\"YES\")\r\n else: print(\"NO\")", "t = int(input())\r\nquery=[0 for i in range(180)]\r\nfor i in range(3,1000):\r\n if (i-2)*180 % i == 0:\r\n query[int((i-2)*180/i)]=1\r\nfor i in range(t):\r\n n = int(input())\r\n if query[n]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "angle = set()\r\nans = []\r\nfor i in range(3,361):\r\n if 360%i==0:\r\n angle.add(180-int(360/i))\r\nn = int(input())\r\nfor i in range(0,n):\r\n a = int(input())\r\n if a in angle:\r\n ans.append(\"YES\")\r\n else:\r\n ans.append(\"NO\")\r\nfor i in range(0,n):\r\n print(ans[i])", "T = int(input())\r\nfor _ in range(T):\r\n x = 180 - int(input())\r\n if x <= 0 or 360 % x != 0:\r\n print('NO')\r\n else:\r\n print('YES')\r\n ", "t = int(input())\nfor _ in range(t):\n n = int(input())\n z = 360/( 180 - n )\n z1 = int(z)\n if z1 == z:\n print(\"YES\")\n else:\n print(\"NO\")", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Oct 10 19:39:03 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\nlist=[60,90,108,120,135,140,144,150,156,160,162,165,168,170,171,172,174,175,176,177,178,179]\nn=int(input())\nfor i in range(n):\n s=int(input())\n if s in list:\n print('YES')\n else:\n print('NO')", "d = []\r\nfor n in range(3, 1001):\r\n a = (180 * (n - 2)) / n\r\n if not a%1:\r\n d.append(int(a))\r\nfor _ in range(int(input())):\r\n if int(input()) in d:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "from math import *\r\nfrom string import *\r\n\r\nt=int(input())\r\nwhile t>0:\r\n x=int(input())\r\n if 360%(x-180)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n t-=1", "t=int(input())\r\nfor i in range(t):\r\n n=int(input())\r\n ang=180-n\r\n if 360%ang==0 and 360/ang>2:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\n\r\nfor _ in range(t):\r\n g = int(input())\r\n if(360%(180-g)==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n# 180 - 360 - 540 - 720 \r\n# 60 - 90 - ", "t=int(input())\r\nlist=[]\r\n\r\nfor i in range(t):\r\n a=int(input())\r\n if 360%(180-a)==0:\r\n list.append('YES')\r\n else:\r\n list.append('NO')\r\n \r\nfor i in range(len(list)):\r\n print(list[i])\r\n ", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n if (360%(180-n)) != 0:\r\n print('NO')\r\n else:\r\n print('YES')", "xunhuan=input()\r\nans=[]\r\nfor i in range(int(xunhuan)):\r\n a=input()\r\n b=180-int(a)\r\n if 360%b==0:\r\n ans.append('YES')\r\n else:\r\n ans.append('NO')\r\nfor i in range(len(ans)):\r\n print(ans[i])\r\n ", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n if 360%(180-a)==0 and 360/(180-a)>=3:print('YES')\r\n else:print('NO')", "for _ in range(int(input())):\r\n angle = int(input())\r\n y = 180-angle\r\n if 360%y==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for i in range(int(input())):\n n = (360 / (180 - float(input())))\n if n - int(n) == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n", "num = int(input(\"\"))\narr = []\nfor i in range(num):\n a = int(input(\"\"))\n arr.append(a)\nfor angle in arr:\n if angle<60:\n print(\"NO\")\n else:\n n = 360/(180-angle)\n if n%(int(n)) == 0:\n print(\"YES\")\n else:\n print(\"NO\") \n\n", "out = []\r\nt = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n if 360%(180-a) == 0:\r\n out.append(\"YES\")\r\n else:\r\n out.append(\"NO\")\r\nfor i in out:\r\n print(i)", "t = int(input())\r\ni = 1\r\nwhile True:\r\n if i>t:\r\n break\r\n a = int(input())\r\n n = 360/(180-a)\r\n if n%1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n i = i+1", "# -*- coding=utf-8 -*-\r\nimport math\r\n\r\ndef is_regular_n_square_arc(arc):\r\n \"\"\"角度arcが正N角形の角度をなすか否か\r\n\r\n \"\"\"\r\n if 360 % (180 - arc) == 0:\r\n return True\r\n else:\r\n return False\r\n\r\nif __name__ == \"__main__\":\r\n t = int(input())\r\n for _ in range(t):\r\n n = int(input())\r\n if is_regular_n_square_arc(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\n\r\nwhile t!=0 :\r\n t-=1\r\n a=int(input())\r\n a=180-a\r\n if int(360/a)==360/a :\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")", "n = int(input())\r\npossible = set([180 * (n-2) // n for n in range(3, 361) if 180 * (n-2) % n == 0])\r\n\r\nfor _ in range(n):\r\n d = int(input())\r\n if d in possible:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Oct 16 10:43:51 2022\n\n@author: calvinzhu\n\"\"\"\n\nn = int(input())\nfor i in range(n):\n angle = int(input())\n if 360%(180-angle) == 0:\n print(\"YES\")\n else:\n print(\"NO\")", "a=[]\r\nfor i in range(1, 720):\r\n if ((i-2)*180)%i==0:\r\n a.append((i-2)*180//i)\r\nt=int(input())\r\nfor i in range(t):\r\n if int(input()) in a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\ni=0\r\nwhile i<n:\r\n a=int(input())\r\n if int(360/(180-a))-360/(180-a)==0 and a>0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n i=i+1", "n = int(input())\r\nm = []\r\npp = []\r\nfor i in range(n):\r\n a = int(input())\r\n m.append(a)\r\nfor i in range(3,361):\r\n if 360 % i == 0:\r\n p = 180 - int(360 / i)\r\n pp.append(p)\r\nfor i in m :\r\n if i in pp:\r\n print('YES')\r\n else:\r\n print('NO')", "# 李城岳生命科学学院 2300012106\r\nli = []\r\nfor i in range(3, 400):\r\n angle = (i-2)*180/i\r\n if angle - (angle//1) == 0.0:\r\n li.append(angle)\r\nfor i in range(int(input())):\r\n if int(input()) in li:\r\n print('YES')\r\n else:\r\n print('NO')", "s=int(input())\r\nboard1=[]\r\nfor i in range(3,1000):\r\n k=180*(i-2)/i\r\n board1.append(k)\r\nfor i in range(s):\r\n t=int(input())\r\n if t in board1:\r\n print('YES')\r\n else:\r\n print('NO')", "times = int(input())\r\n\r\nwhile times > 0:\r\n \r\n n = int(input()) \r\n ang = 360 % (180 - n)\r\n if ang == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n times -= 1\r\n \r\n \r\n \r\n ", "'''Ye G-305 walo ne bola tha long back ki do try\r\n\r\nsorry but maine iske liye formula dekha \r\nyaha se \r\nhttps://www.math-only-math.com/sum-of-the-interior-angles-of-an-n-sided-polygon.html#:~:text=In%20a%20regular%20polygon%20of,4)%C3%9790%C2%B0n.\r\n\r\n'''\r\nfor _ in range(int(input())):\r\n a=int(input())\r\n dekhoside=360/(180-a)\r\n if dekhoside==int(dekhoside):print('YES')\r\n else:print('NO')", "for t in range(int(input())):\r\n n =int(input())\r\n if (360%(180-n)==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nfor i in range(n):\r\n angle=int(input())\r\n if angle<60:\r\n print(\"NO\")\r\n elif 360%(180-angle)==0:\r\n print(\"YES\")\r\n else:print(\"NO\")", "#利用多边形外角和=360度\r\nt=int(input())\r\nwhile t:\r\n t=t-1\r\n a=int(input())\r\n outa=180-a\r\n if 360%outa==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n = int(input())\r\nt = n\r\n\r\nwhile t > 0:\r\n t -= 1\r\n v = int(input())\r\n look = False\r\n check_1 = abs(360 / (v - 180))\r\n check_2 = abs(360 // (v - 180))\r\n if check_1 == check_2:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\nfor i in range(t):\r\n ang = float(input())\r\n n = (360) / (180 - ang)\r\n if n - int(n) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "#-*- coding: utf-8 -*\n#-*- coding: utf-8 -*\n'''\nCreated on Tue Oct 10\nauthor 钱瑞 2300011480\n'''\nn=int(input())\nl=[]\nfor i in range(n):\n a=int(input())\n if 360%(180-a)==0:\n l.append('YES')\n else:\n l.append('NO')\nfor i in l :\n print(i)", "a=int(input())\r\nfor i in range(a):\r\n b=int(input())\r\n c=360/(180-b)\r\n if int(c)==c:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "import sys\n#n = int(sys.stdin.readline())\n#m, n = map(int, sys.stdin.readline().split())\n#a = [x for x in sys.stdin.readline().split()]\nf = [180 * (n - 2) / n for n in range(3, 500)]\na = []\nfor e in f:\n if e - int(e) == 0:\n a.append(e)\n\nt = int(sys.stdin.readline())\nfor i in range(t):\n alpha = int(sys.stdin.readline())\n if alpha in a:\n print(\"YES\")\n else:\n print(\"NO\")", "test = int(input())\nfor _ in range(test):\n ex_angle = 180 -int(input())\n if 360 % ex_angle:\n print(\"NO\")\n else:\n print(\"YES\")", "a=int(input())\r\nfor i in range(a):\r\n x=int(input())\r\n n=round(2/(1-x/180))\r\n if x==180*(n-2)/n:\r\n print('YES')\r\n else:\r\n print('NO')", "#2300015804\r\nn=int(input())\r\nang=[]\r\nfor _ in range(n):\r\n ang.append(int(input()))\r\nfor j in range(n):\r\n if 360%(180-ang[j])==0: print(\"YES\")\r\n else: print(\"NO\")", "t = int(input())\r\nangles = []\r\nn = 3\r\nwhile True:\r\n angle_sum = 180 * (n - 2)\r\n angle = angle_sum / n\r\n if angle > 179:\r\n break\r\n if angle_sum % n == 0:\r\n angle = angle_sum // n\r\n angles.append(angle)\r\n n += 1\r\nfor i in range(t):\r\n a = int(input())\r\n print(\"YES\" if a in angles else \"NO\")\r\n", "t = int(input())\r\nstack =[60,90,108,120,135,140,144,150,156,160,162,165,168,170,171,172]\r\nwhile t > 0:\r\n t -= 1\r\n a = int(input())\r\n sobichia = 2*a\r\n sochia = 180 - a\r\n if sobichia % sochia == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "a = int(input())\nfor i in range(0, a):\n ang = int(input())\n if (360/(180-ang) == 360//(180-ang)):\n print(\"YES\")\n else:\n print(\"NO\")", "# https://codeforces.com/problemset/problem/270/A\n\nfor _ in range(int(input())):\n a = int(input())\n # interior angle = 180 * (n - 2) / n\n # n = 360 / (180 - a) should be an integer\n # where, a = interior angel, n = number of sides\n n = 360 / (180 - a)\n if n.is_integer():\n print(\"YES\")\n else:\n print(\"NO\")\n", "a=int(input())\r\nlist1=[60,90,108,120,135,140,144,150,156,160,162,165,168,170,171,172,174,175,176,177,178,179]\r\nfor i in range(a):\r\n b=int(input())\r\n if b in list1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n\r\n\r\n", "a = [60, 90, 108, 120, 135, 140, 144, 150, 156, 160, 162, 165, 168, 170, 171, 172, 174, 175, 176, 177, 178, 179]\r\nt = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n if n in a:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\n\tang = int(input())\n\tx = 360 / (180-ang)\n\tans = x == int(x)\n\tprint(\"YES\" if ans else \"NO\")\n", "t = int(input())\r\na = []\r\nfor i in range(t):\r\n a.append(int(input()))\r\nfor i in a:\r\n if 360//(180-i) == 360/(180-i):\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nfor i in range(n):\r\n angle = int(input())\r\n a = 360/(180-angle)\r\n b = int(a)\r\n if a == b:\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n if a<60:\r\n print(\"NO\")\r\n continue\r\n n=(360)/(180-a)\r\n if int(n)==n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = input ()\r\nx = int(t)\r\nfor i in range(x):\r\n a = int(input())\r\n n = 360 % (180-a)\r\n if n == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nd = [0]*1000\r\nfor i in range(3, 1000):\r\n a = 180*(i-2)/i\r\n if a.is_integer():\r\n d[i] = int(a)\r\nfor i in range(int(input())):\r\n if int(input()) not in d:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 12 21:26:18 2022\r\n\r\n@author: SaltLyy\r\n\"\"\"\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n if 360/(180-a)>=3 and 360/(180-a) %1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\nfor i in range(n):\n angle = int(input())\n hy = False\n n_sides = 3\n y = 0\n while (not hy or angle > y) and n_sides < 10000:\n y = ((n_sides - 2) * 180) / n_sides\n if angle == y:\n hy = True\n n_sides += 1\n if hy:\n print(\"YES\")\n else:\n print(\"NO\")\n\n", "\r\nans=[]\r\nfor i in range(int(input())):\r\n a=int(input())\r\n if a>=60 and 360%(180-a)==0:\r\n ans.append('YES')\r\n else:\r\n ans.append('NO')\r\nprint('\\n'.join(map(str,ans)))", "#2300012142 林烨\r\nn = int(input())\r\nfor _ in range(n):\r\n print(['NO','YES'][360%(180 - int(input())) == 0])", "n = int(input())\r\n\r\nfor i in range(n):\r\n b = int(input())\r\n a = 360 / (180 - b)\r\n if a - int(a) == 0 and a >= 3:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in[*open(0)][1:]:print('YNEOS'[360%(180-int(i))>0::2])", "\r\n\r\nfor i in range(int(input())):\r\n n = int(input())\r\n print('NO' if 360%(180-n)!=0 else 'YES' )\r\n\r\n\r\n\r\n", "n = int(input())\r\nfor i in range(n):\r\n ang = int(input())\r\n subang = 180-ang\r\n if 360%(subang) == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nfor i in range(t):\r\n a=int(input());b=int(180-a)\r\n print('NO' if 360%b else 'YES')\r\n\r\n \r\n", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n t = int(input())\n angles = [60, 90, 108, 120, 135, 140, 144, 150, 156, 160, 162,\n 165, 168, 170, 171, 172, 174, 175, 176, 177, 178, 179]\n for _ in range(t):\n a = int(input())\n if a < 60:\n print(\"NO\")\n else:\n if a in angles:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n main()\n", "t = input()\nt = int(t)\nlist=[]\n\nfor i in range(t):\n val = input()\n val = int(val)\n list.append(val)\n\nfor val in list:\n if 360%(180-val) == 0:\n print(\"YES\")\n else :\n print(\"NO\")\n\n", "def check_fence():\r\n t = int(input())\r\n\r\n for _ in range(t):\r\n a = int(input())\r\n\r\n # Check if the angle can form a regular polygon\r\n if 360 % (180 - a) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\ncheck_fence()", "n = int(input()) \r\nfor _ in range(n) : \r\n angle = int(input()) \r\n n = 3\r\n res = None\r\n while True : \r\n inta = (180 *(n-2)) / n\r\n if inta == angle : \r\n res = \"YES\"\r\n break\r\n elif inta > angle : \r\n res = \"NO\"\r\n break\r\n n+=1\r\n print(res)", "t = int(input())\r\nwhile t > 0:\r\n angle = int(input())\r\n if(360%(180-angle) == 0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n t-=1", "import math\r\n\r\n\r\ndef main():\r\n lis_angle = []\r\n for i in range (3,1000):\r\n y = (i-2)*180\r\n y = y/i\r\n lis_angle.append(y)\r\n\r\n n = int(input())\r\n for i in range(0,n):\r\n y = int(input())\r\n if y in lis_angle:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# https://codeforces.com/problemset/problem/270/A\n\nn = int(input())\nfor i in range(n):\n a = int(input())\n k = 360 % (180 - a)\n if k == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n", "t=int(input())\r\nn=int(0)\r\na=[0]*t\r\nfor i in range(t):\r\n a[i]=int(input())\r\nfor i in range(t) :\r\n if a[i] <180 :\r\n n=360/(180-a[i])\r\n if n % 1==0:\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\n\r\n n=0", "for Ram in range(int(input())):\r\n n=int(input())\r\n y=360/(180-n)\r\n if y==int(y):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for i in range(int(input())):\r\n a = float(input())\r\n n = 3\r\n while True:\r\n # python的计算方式会有bug\r\n test = 180 - 360 / n\r\n if a == test:\r\n print(\"YES\")\r\n break\r\n elif a < test:\r\n print(\"NO\")\r\n break\r\n n += 1\r\n", "\"\"\"\r\nEmuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.\r\n\r\nHe wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence corners at a single angle a.\r\n\r\nWill the robot be able to build the fence Emuskald wants? In other words, is there a regular polygon which angles are equal to a?\r\n\r\nInput\r\nThe first line of input contains an integer t (0 < t < 180) — the number of tests. Each of the following t lines contains a single integer a (0 < a < 180) — the angle the robot can make corners at measured in degrees.\r\n\r\nOutput\r\nFor each test, output on a single line \"YES\" (without quotes), if the robot can build a fence Emuskald wants, and \"NO\" (without quotes), if it is impossible.\r\n\"\"\"\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n a = int(input())\r\n if 360 % (180 - a) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n = int(input())\r\nresult = []\r\nfor i in range(n):\r\n d = int(input())\r\n if 360%(180-d) == 0:\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\n\r\nfor j in result:\r\n print(j)", "n = int(input())\r\nx = 0\r\ny = 0\r\nz = []\r\n\r\nfor i in range(0, n):\r\n\r\n r = float(input())\r\n x = 360.00 / (180.00 - r)\r\n y = int(360 / (180 - r))\r\n\r\n if x == y:\r\n z.append(\"YES\")\r\n\r\n else:\r\n z.append(\"NO\")\r\n\r\nfor i in range(0, n):\r\n print(z[i])\r\n", "a=int(input())\r\n \r\n \r\nfor i in range(a):\r\n k =int(input())\r\n k1=180-k\r\n if (360/k1-int(360/k1))==0.0:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\n\r\nresult = []\r\n\r\nfor i in range(t):\r\n if -(360%(int(input())-180)) == 0:\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\n\r\nprint(*result, sep=\"\\n\")", "n=int(input())\r\nfor a in range(n):\r\n m=int(input())\r\n if (360/(180-m))%1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "x = (int(input()))\r\n\r\nfor i in range(x):\r\n\r\n a = (int(input()))\r\n\r\n if (360/(180-a)) == int((360/(180-a))):\r\n\r\n print('YES')\r\n \r\n else:\r\n print('NO')\r\n", "TEST_CASES = int(input())\n\nfor i in range(TEST_CASES):\n\tANGLE = int(input())\n\tif 360 % (180 - ANGLE) == 0:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n \t\t \t \t\t\t\t\t\t \t\t \t", "for i in range(int(input())):print(\"YES\" if (360 % (180 - int(input())) == 0) else \"NO\")", "def main():\r\n test = int(input()) # количество тестов\r\n for i in range(test):\r\n cur_degree = int(input())\r\n n = 360 / (cur_degree - 180)\r\n if int(n) == n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n return None\r\n\r\nmain()", "t = int(input())\r\n\r\nfor _ in range(t):\r\n angle = int(input())\r\n \r\n if 360 / (180 - angle) == int(360 / (180 - angle)):\r\n print('YES')\r\n else:\r\n print('NO')", "import sys\r\nfrom os import path\r\nif (path.exists('input.txt')):\r\n\tsys.stdin = open('input.txt', 'r')\r\n\tsys.stdout = open('output.txt','w')\r\n\r\nt = int(input())\r\nfor _ in range (t):\r\n\tth = int(input())\r\n\tn = 360/(180-th)\r\n\tprint('YES' if n==int(n) else 'NO')", "n=int(input())\r\nfor _ in range(n):\r\n a=int(input())\r\n ext=180-a\r\n if (360%ext==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "#https://codeforces.com/problemset/problem/270/A\r\n\r\n\r\ntest_cases = int(input())\r\nwhile test_cases > 0:\r\n angle = int(input())\r\n if(360%(180-angle) == 0):\r\n answer = \"YES\"\r\n else:\r\n answer = \"NO\"\r\n print(answer)\r\n test_cases -= 1", "for i in range(int(input())):\r\n m = int(input())\r\n if 360%(180-m) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\nfor _ in range(t):\r\n a=int(input())\r\n tbd=180-a\r\n if (360/tbd)==int(360/tbd):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\nans=[]\r\nfor i in range(t):\r\n a=int(input())\r\n x=360/(180-a)\r\n ans.append('NO'if(x-int(x)!=0)else'YES')\r\nfor i in ans:\r\n print(i)", "n = int(input())\r\nans = []\r\nfor i in range(n):\r\n t = int(input())\r\n if (2*t) % (180-t) == 0:\r\n ans.append('YES')\r\n else:\r\n ans.append('NO')\r\nfor i in ans:\r\n print(i)", "t=int(input())\nfor i in range(t):\n angle=int(input()) \n print(\"YES\")if 360%(180-angle)==0 else print(\"NO\")", "for _ in range(int(input())):\r\n n=int(input())\r\n val= 360 / (n-180)\r\n if(val == int(val)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\ns=[]\r\nal=[]\r\nfor i in range(t):\r\n a=int(input())\r\n s.append(a)\r\nfor i in range(3,361):\r\n angle=(i-2)/i*180\r\n if angle%1==0:\r\n al.append(angle)\r\n\r\nfor i in range(t):\r\n a=s[i]\r\n if a in al:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "for x in range(int(input())):\r\n a=int(input())\r\n if a>59 and 360%(180-a)==0:\r\n print('YES')\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nans = []\r\nfor i in range(t):\r\n\tangle = int(input())\r\n\tif angle < 60:\r\n\t\tans.append(\"NO\")\r\n\telse:\r\n\t\tn = 360 / (180 - angle)\r\n\t\tif int(n) == n:\r\n\t\t\tans.append(\"YES\")\r\n\t\telse:\r\n\t\t\tans.append(\"NO\")\r\nfor i in range(t):\r\n\tprint(ans[i])\r\n", "n = int(input())\r\nfor i in range(n):\r\n an = int(input())\r\n j=3\r\n nan=0\r\n yes=0\r\n while nan<an:\r\n nan=180-360/j\r\n if nan==an:\r\n yes+=1\r\n break\r\n j+=1\r\n print(\"YES\" if yes==1 else \"NO\")", "t = int(input())\n\nfor _ in range(t):\n a = int(input())\n\n i = 3\n ang = 180 - 360/3\n exists = False\n if ang == a:\n print(\"YES\")\n continue\n while ang < a:\n i += 1\n ang = 180 - 360/i\n if ang == a:\n exists = True\n break\n if exists:\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t \t \t \t\t\t\t\t \t\t \t \t", "t = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n n=-(360/(a-180))\r\n if int(n)/float(n)==1.0 and a!=180 and a!=0 and n!=2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "from sys import stdin\r\n\r\n# https://codeforces.com/problemset/problem/270/A\r\n\r\ndef inp():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef iinp():\r\n\treturn int(inp())\r\n\r\ndef mp():\r\n\treturn map(int, inp().split())\r\n\r\ndef liinp():\r\n\treturn list(mp())\r\n\r\ndef solve(deg):\r\n if 360 % (180-deg) == 0:\r\n return 'YES'\r\n \r\n return 'NO'\r\n\r\nif __name__==\"__main__\":\r\n for _ in range(iinp()):\r\n deg = iinp()\r\n print(solve(deg))", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[60]:\n\n\nt=int(input())\nfor i in range(t):\n a=int(input())\n if 360%(180-a)==0:\n print('YES')\n else:\n print('NO')\n\n\n# In[ ]:\n\n\n\n\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 11 15:21:27 2022\r\n\r\n@author: lpf\r\n\"\"\"\r\nt=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n print('YES'if 360%(180-a)==0 else 'NO')", "for i in range(int(input())):\r\n n=int(input())\r\n out=180-n\r\n if out<=120 and 360%out==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\narr = []\r\n\r\nfor i in range(n):\r\n arr.append(int(input()))\r\n\r\nfor i in arr:\r\n if 360 % (180 - i) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\na=[]\r\nfor i in range(t):\r\n a.append(int(input()))\r\nfor i in range(t):\r\n if a[i]>=60 and 360%(180-a[i])==0:\r\n print('YES')\r\n else:print('NO')", "n = int(input())\r\nfor i in range(n):\r\n a = int(input())\r\n if (360/(180-a)).is_integer():\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\n\r\nwhile t:\r\n n = 1\r\n t -= 1\r\n a = int(input())\r\n \r\n while (n*180 / (n+2)) < 180:\r\n if n*180 / (n+2) == a:\r\n print(\"YES\")\r\n break\r\n elif n*180 / (n+2) > a:\r\n print(\"NO\")\r\n break\r\n n += 1", "standard = []\r\nfor i in range(3, 361):\r\n b = 180 - 360 / i\r\n if b % 1 == 0:\r\n standard.append(int(b))\r\na = int(input())\r\nwhile a > 0:\r\n s = int(input())\r\n if s in standard:\r\n print('YES')\r\n else:\r\n print('NO')\r\n a -= 1\r\n", "angle = set()\r\nfor i in range(3, 361):\r\n t = (i-2)*180/i\r\n angle.add(t)\r\nn = int(input())\r\nfor j in range(n):\r\n a = int(input())\r\n if a in angle:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\nfor _ in range(t):\r\n x = int(input())\r\n n = 360/(180-x)\r\n print(['NO','YES'][n.is_integer()])", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n if a<60:\r\n print(\"NO\")\r\n else :\r\n z=3\r\n ang=60\r\n while ang<a:\r\n z+=1\r\n ang=(z-2)*180/z\r\n if ang==a:\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")", "num=int(input())\r\nans=''\r\nfor x in range(num):\r\n a=int(input())\r\n b=2*a/(180-a)\r\n c=b-b//1\r\n if c==0:\r\n ans=ans+'YES'+'\\n'\r\n else:\r\n ans=ans+'NO'+'\\n'\r\nans=ans.rstrip('\\n')\r\nprint(ans)\r\n", "\r\n\"\"\"\r\n ..::kh_elhanan::..\r\n ..::i::i:......::khaled_elhanan:\r\n iv7i::.. .......:.:.::71gBBb:\r\n .sbP7. .::..::::::...:rKMRRU:.\r\n .vIs7. . ..:...::i::::.:.:iUPKSIsLi.\r\n .25r . . .:...::i:i::::::::rvUbYvISu7.\r\n .2qr. . . . . .:....:i:i:::::::::.:P1::rsKS2i\r\n 1qr . ... .::i:::::::ii. id7.::i7uU2r\r\n :YL: . . . . . . ... .:::ii:i:i:ir: .gK:::::::L21i\r\n .rv:. . . . . .. .:. :..:r:::::i. ZBv.::ii..:JE2.\r\n .77. .. . . . . .. :i . .r:i::i: uBq:.iii::..rI2r\r\n isr . . . . . . . r: . . .ri::iii. .iBgi.:ii.:::.:r7ri\r\n iui . . . . . . . . . .v. ... .ri::iir:..::QPv::ii::::::. .v7.\r\n iUi . . . . . .. ... i7. ... ir:::i:iiii:rQS1i:ii.::::i. .7L.\r\n :Si . . .. .: . .. . . . ..... :7i ......:iLi::::::i:.JguI7::i.::::ii: rr\r\n :u7 . . . .: . .i . .. . . . ... ... ... 27. ... .:r2.::::::i::KEJSL:::.::::::i:. :u:\r\n 2u ... . . .:. . :: . . :. . . ..... ....... 7U:. .... .iPi.::::::i:iZKs5ui::.::::::::irIP:\r\n 7K. ... . . .::: . ri . .. . . .:: . ... ... ..... . :Ei: . . :I7.::::::ii.vDUs5Ui::..:::r777vr7i\r\n .5r ..... . ..::: . . Y: . . :. . .i: ... :. . ... ..: gvi. .. . .Lv.:::::::i::Xdj1PZJ7r7YL7i:.\r\n JI. ....... . .::.:. . . v: .:r . :ri .... i . ... . .i. Xq:r :: 7P..::::::i::rbKUULrLL.\r\n .qr ....... . .i::.:7. . . 1.. .. .rr . .Jr ... .r. ..... . ii YE7::.U. :P:.:i:::::i:iXb:\r\n 75. ....... .:i::::i7 . . . 1:. .. .77 ..:Sr :. .7. ....... i7 rRu:i.1r :X7 :::::::ii.XP5 .:\r\n Uv ....... .:ii::::.L. ... . 2:. . ..Is .::M: i .r. ..... 7L: :Eqr:.7u: .I1 .::::::ir:rdd. :Ss. ..\r\n .S: ... ... .:rii::::::Y . . . . .2:. .. .iKu ::r5. .r..:iY. ...... .rIi .JP1:iiPr. .7b .:::::::rr:PqI .i.vi\r\n iu. ... . . . .:r:i:iiiirrv ... . . .S:. .: .vLr :i2Uv.iIiiirs. : ... :i57 riKd7i7gS: i1Q. .::::::i1.q5Zr:. .Yi\r\n ir . . .irrr7v7rr:7Y17 . ... . .Xi. i. .2.7.:iL7P.s U: :r: :. .. r:XY.i.:gr..Pu: rQZqi..:::::2:vgUd. .. :r\r\n.7E7...:::::.v11jsv7:. ir: .. . . Zr. i. :Kis: .:r7 7. 25 rrr r. .. .iiSU.7. PS:.XRr iEr.JYr.::::j7iBsZ. .. i:\r\n..s7i::... .sv: 7v . .U: ....... b1. 7:7.: r. .is: i: YB. iiS.r. . .iiZ2:L. iQi.7qK :du .r:::.:rIiBubi .i.ri.\r\n .: .. D. ::...qr . ...... Pq. is.7. .i: :r1...L JPL i:P.r. :.:755iv. MJ.viZ..iKP ...:::::i2sQPuI....\r\n .Q. . :q :r...i: si ... ... Yg: :i.P. :7 :L7 i.L277::b:i: .r.:LLSLL :M.v:ri.:5M ..::::::uJQDvQY\r\n 17 v2sM7 ... iv ... ... vQ7 ::vU ..L :1: v7I.U::Zri: 7i.:uiPI7 dr7i .i:Ug .:.i:::.vjgQ7bR\r\n .u 1PuDv .. i7 ... ... :BJ ::b:. i :X::ii.SJd r7:Pv:: i7:.rs.qZ: :jri X:jg. ::.::::.jjZQuYBv\r\n X. uIsD1 ... rB: . .. ... .QX:.vX s:ii .Zg. 5:PY::irr:.Ji Zd .. Lrr .77R. :i.::::.2SqB2LPK\r\n .B .vjsPE QBr ... .. gEr.P:.rr :77ursv: :B7 :5SI.iiir..K .Qu .i7JPUgDgPMKD. ::.::::.IqPBK75Yr\r\n id rvr2SEi: .QBI .. .. 7Br:DLi:.rjgEqBBBBQL LQ 1gS::iir 1i B .MBBBBPBBBBBBM. ::.:::::rZXBq7bid\r\n ruLiiUIu7ii.1ZBZ .. .. BuU7 i5QBBQRgBBBQ7uu: sr gD::ii:r7 r2 :MBBQBQBbYY1IBQv ::::i::::PbQZ7P:5r\r\n RP:.jKvJ:irYbQB .. .. KqUJRBQRBQBBBs . : .Qr:iiL. L SQB17r2r U2i.:::ii:::UbQELPiiQ\r\n .2d:.rEiS::urPQBi .... .. .QZBMMBBDI7sL .: JS:rS: : Bguv7u52UjjB: jrr::::ii::vLdMDvbi:u7\r\n vvv:::K:2riS.XQBv ..i ... PBQQBBqrrsJ552UBj K7s iBri:EX.i: DB Pi:::::ii:.jsXQZJPi. g\r\n I7L:::q:7uIr.KBBP :: . .. igrEBrssLIur7..B7 si .Q .KS....BK Si.:::.ii:.S22QZJb: jL ..\r\n ::::. :UL7::iS::P7::2BBQ ii . ... .S SPii:.Bq....B. X: Yg 2i:::::ii:.5Z7BqKg R ::.\r\n :::i: v71r::i5:i:irr7.QB 7: ..... ur Z ...... :U :. u 2i::::.:7i.SBiQqZB . Ys ::..\r\n .. v uii:vU:r77i v iB. 7i ..... .P .d 1. . :uj.. 5i::::::1i.UBiEdQQ. . M :..\r\n ii Ji::YUrr:. r. 7:i 7i ...... :: ..:. vY.. . .... ....:Ji::::.:5v 2B7uBDqi .. uj ::..\r\n j .I:i:2:. . vi rv:rr ... .i rr ....... .... ......... .P:::i:..PI YBuvBK2v ... R .:.\r\n .u :u::iP. .... rJ rU:ii. ... rv. rr ........... ......... :2::ii:..KD 7BPrBL25 .. rL .\r\n r: i1..iK .... :Y .X:ir: .. .77r. :7. ......... ... ... .I:iii::.bM:YBgrSYjg .. Z\r\n U Yv r5 .......I KiiJr: .. rr7Yi .v: ..... . Su::i::i.PQrqQQivjUg: . ur\r\n i7 S7 75 .......5 r1:dri. . .7:7:r::i: . :Br:iii:7 gR7KQQi7XrP7 . g\r\n U. K: 7J ...... 5 KiqX:r. . :7v7 .:i77. i: .Iv7riii:77.QRrdQD:vq.iP 5i\r\n .v :S. r1 ...... I: sL2E7:r. . :vEi. .r.. .iUj rr:i::ur.BZ7DQUivX..P .b\r\n 7. iS vr ...... vi EuqP:i7. . .q::rri: .i55v. 5ii:::P.rBg7BSjius..P g.\r\n u . sJ 7: .... :s ug227:i7. . .. ...::: :7jLr. Ki:i:vb.vPR2EL1r1r..1. r2\r\n . i: 2r . Y. ....2 QPv.u:i7: . 7v 7uU5uj::...... .::iqIYRqi M:i::KS.i.BXuY2r2...vr R\r\n:.::. u K. u. . b :Bg :2:iri P .i22uvrrYBi:ii7v2USsvi7B5rv7vL7. iQ:::7B7s BKvuusY.::i5 d:\r\n:.::. u .X 2 1. vB: r5:iri. :r :7v7i....:iivg. ... . d:. ..rsr. :E.:.ED7i .BujJ1Ir.::.K :q\r\n.... ri .U .U Ji uQ rKiirr: Kv. .. . iE. ..7sr:: Y: ... ..7 .U:.YRK. iQJJu1X..:: 5. R\r\n s. :v . U :s ru iPi:iri .i ..... .gv:::..::vb ... vLr1 r2.:MQ5 iZJjJSs..::.iJ P.\r\n 1 ii .5 J :Pi:iir.P ..... :D 7i .. .rdRKiiPr vv.PBS :P1JUSr.:::..q i2\r\n .7 v. .X I Z7:ii:X1 .... :g. .S 7ZPZ5:::i:K J:PBi rbJjuX:.:::: b E\r\n ii s :v J :YISi:::MMPS7. ... rq S rBBE7.7s.ii. quXq Iq1J2u..:::. u7 S\r\n s. X :7 7 .7 .iUur.:JiDDZMPXi rJ :. :dBBU: j::r. qM sPJu57.::::: :Qrri... u.\r\n L J rr r. J :JjrirE::rYQBBQuiri. v: XvMBBBJri. 7::i 7L7: SX1uXi.::::. M .ii:.i.\r\n s .7 ii :. 7: . .iriiK. ...sBBBBBBBgPZ5uBQX7LvJUKqSsv2S7i . K. XKJUU:.::::. qi\r\n .v r: 7. .. :r . . .i:.:v :7UuJu1vLvvvSPBPSggUuvvLsYjs7i::UE: .E S5u1J::::::. vq\r\n :i v. v. :: U ..... :iiJsr7vYJvLvLvLLXISRg7PM2I2vsLYLsLjs2Pi . :S EIJ5r:i::::. :g\r\n U. u . r .: J. ...... .idS7v1sJvvvLvv7vvs2g:.rBJLvvvYvLsqMMLui: ... 77 M1u2i:i::::.. :q7\r\n 2 u . r .: i7 ... ... ::I2DgDKS1JvJjUu1UDY::iQg22jsvuIDPL..75. ... 5. g21U:iii::::..:vK\r\n 7 ...r.: . uv .r .q ....... .J. :iJEPEXI2S5SXdQr:iiRgMqS22IQ7 .ii.s .... P gUIv::ri:::...:id\r\n .Srir.:ir: ..:Is. .5 P ........ .iI. .:.i7dDKPPEbZgBr::rMZZQDdKZBE.::. r: ... :I gI2r.:L7:::...:i17\r\n rLr: . i7uUj: 2 2: ..... . :ij .. LgDZbdbZgDRr::vBbPqZgQMPdM .U . .. ui d5Si::1r:::.. .irK\r\n 17r.. . .ri::7Dgj. 7 Ls ... ... . .Ku . rBEZZDEgZKIg7i:uM2u21SX2vYXS S: .... q 2Pu:::17:i: .r:Z\r\n U7:.. . :7ii::.UZMPi:L rR ..... . .. vR. . .Bdq55UDPJsjdviiJgU5IXLv7YYuR7 iX ..... .K ubJ.::2r:i: . i:2r\r\n Ps..: iiiii::J2ubq .d. . ... . . . .ZL QbX2uv7vY7v7q7: :gSIKsvvJLvrvP. D: . ... ri:g7:::5Y:r: .. iiu2\r\n :Z1 :r .rrii:::IjuUd v . . . ... . :S: PQIYvvYvYLJsjPY .Q5KYvvUJY77vXi L5. . ... r1Qr.::Ku:i: . :7YP\r\n vZJ :7. .rii:i:iI1JUd r: ... . ...... .rq. . :QP5IUUsJvvr7rSY: Dg51SZP2vL77: . .P: ... i:I7.i5Sii. . i7j5.\r\n Pqs iri :riii::r5JujM. 7r . . ......... .sU . .77v2UISg55L7Iji. KZXdu5::::::r. Kri ... .. .UrrX57:i . .Y117\r\n gK7 irr.:riiii:vIuJuE. 5 . ... . ... :Pi . .:::..::dr21iuv: .. :2.K .. . YK:i . .7i. rqq5J:i. ..JXvJ\r\n .g57 rir:iiiii::Y2suJKSi ... . ... . .rP .. P :5ir:.... .1 D. ... .Z:ii .irr: .bE5ir. i ISJ5\r\n 7bKi iiiiii:i:::u1uJuqB . ..... . . :j1 .. . . . . d Eri ..... u P: . . ... Uv:ii .riiir. UQv:: .r 25JK\r\n 5qSi rii:i:i:i::U1JuqP. ... . . . ... .:X. .. ..... g. Z7:...... v.5i . . ... .P.iir .riiiir iD7: :r J2Ug\r\n KIK: ii:i:iii::i5juqK ..... ... . .rrS ... ..... E. E7: ..:...r.57 . . . . . Pi:iiiiiii:r. . .Su ir rKJB.\r\n dUS: riiiiiiii:r2UqP . . . .. ... .i:vr . .. . .. E: Is:..:. ..::Yj .... . . u2.:iii:iiri . . vX:i.:XjR.\r\n gjK..ii:i:7ii::r5Xd ... . .7i . .ii:E . . . . Pr qv:.:. ..:i71 . . . ... .Q:::i:i:ir. . . ... :Ki:.buM:\r\n .ZsP: r:ii:7r:i.vKR . . . rrr. ii:Z7 . ... ... . X7 5u... ...vrb . . . ... ID.::i:ii: . ... . ivr gUM:\r\n igYEr riii:J7:::JQ. . . . iiii: :i:1M . ..... ..... 1s 1U.. ...rrZ ... . ..... .QU:::i:i. ..... . 7q:U Z1R:\r\n iZJSi.rii::vKr::gr . . . iri:ii.:i:sQ7 . ... ..... . YI rS.. ...7:Z . . . . . KgUi::i:r: . . i7.1r5 Q5R.\r\n iguI .ri:i.sIS::7 ri:iiii::j5D . . ..... vg rS. ...i:E. . . . . Bu57::::r. r: .1q ISB.\r\n .DU5 rii::J2UJ: .:::::...iii:i:::uJbP...... . ... vD iR .: r.R. ..... .::ii:5qs5v:.::i :iL. .IP .ZQ\r\n MUq .vi:i:u11uIPYi::iiririr:i:i:::jujMi:rrL7vr7L: ... . rg :Qi ...7.P. ... 2ri:.. EjsIs:.:iJXdL7vr:gZijd BE\r\n dXX Xii::J2JuSZ7PSji:...::::i::.LUsqq .q ... ig :Iq. :.i.X: ... . 5: 1IYuXKuIP11vYY7: uQi5d :Bi\r\n XPb iu:::u1jsZ7 :vXXD27::..::.rUJvR. rv . . . :Q :JvK :.r:U7 . . . :X :B5bDgdQLri:. .Q1PP UQ\r\n :Rd Ur::j2JJX. :LgQQZXvi.:JjvSg........ u: . . ... ig.r7i1b : r:Lj ... . K777sv77RPUi sI PSQ. Qi\r\n gg .K::j1jsUuLi:. .:L5ZQd5PIuEsrjvUu5UU77 . ... . :M.7: .JE. ..iv:q . ... .ii7rr:P. :vr uQj r:\r\n iBi :2:L2JjJ2KBri7vi:.iriisbQRgQE.:ii:.. . .... iZ.7i . iK ..r7.E. ... . . ...s: :KQEZEgdZZ .\r\n KM rsv2usus1d ..:.:71 ... :P . . . . . .ig.vi....iK. .iv Z: ... . . q .MSU21PQ\r\n 7 :bPJuss1D 1 vI... . .iE.L:.. ..iK: iL 27 .:rrBJ M115EM\r\n .qDuUSI2 :rs. .RrLY2JJ7r::.. .:Z.5:.. .:1..K L5 .:r712SS2v:.E ZqPqQ\r\n 7gPgqbYuSQ7::. d: ..:ir71j2u52JY7ri: .ib.S:.. . .b ibivJ1SbPqIYr:. b. ZB7.\r\n vR72QPXB. .S .:iivrr7JYYvg.S: .......::d .qLiri:.. Xi v.\r\n : idgB 7. . . . . ::E.Sv:i:::i...:b 5r . 7i\r\n :1 iq . . . . :iK qi::. ..E: vZ . . :i7\r\n I7r77::.. . :7u.P:iririvYQi:Iv iR. .:i7UKDv\r\n :7 KI:rvvv7i::....... :iLIi: I .vrYQDr7r77:I7v7i..:vE\r\n 5 u JSii:7uIPULDDg: 2 ... .. j .. K:\r\n :r J J q 2. i .... S\r\n Y i. J q . q. :. .I7\r\n iii.7 .i u L. r1.:riv7rr:.\r\n v:qdii:iii:sSJ7r:. suri:.. . Urr::::....... P: .\r\n v. .rr7v7v77ri:r7jUdqri7i..:ii::ud.:ur..:iirrr2:.rrr..\r\n .Y :ri:i:iii:i:iiL.v.......... r7 u ..... v\r\n L: ..:ii:iiiiiiirY v: ..... . rv s . 7\r\n J . ..:riii:i:ivv Y: rr s r\r\n L ......:ii:iiiv7 i7 i: s .r\r\n v . ....iii:i77 .J L: j .r\r\n J ......iv:is S v: J ii\r\n 7.: .....:JiJ. 7: v: J rr\r\n .7i. ..:.::vr .r v: L i.\r\n 1.:: .:::::.r 7 Y: U . .. s.\r\n .r :7:.:::i . diiri7rir:Pi XJirrrL2rg\r\n . .r7::.7 1 7: L 7\r\n .vr:ii v :: v L\r\n :7rv v i: s 7\r\n .sL i. :: 7 :\r\n r. r. i: : :\r\n ..............:.:.:..s: .... i7..j...... .q...:......\r\n ....:.:::.:.................. Y7ri7sUI5SB7..Buj1IJs7iR........:.:::.:......\r\n ...:.:.:.:.:..........................PY7YLsvvvSQ: :BdI211JI5Q...............:.:.:::::..\r\n .i::.................................. gBBRgDMRBBBs iBQBBBQBBBM .......................::::\r\n .:.:::::::i. : .\"\"\"\r\nfor _ in range(int(input())): print('NO' if 360%(180-int(input())) else 'YES') \r\n\r\n\r\n", "# Link: https://codeforces.com/contest/270/problem/A\n\nnumber_of_tests = int(input())\nanswers = \"\"\n\nfor _ in range(number_of_tests):\n internal_angle = int(input())\n external_angle = 180 - internal_angle\n number_of_angles = 360 / external_angle\n \n answers += \"YES-\" if number_of_angles == int(number_of_angles) else \"NO-\"\n\nfor answer in answers.split(\"-\")[:-1]:\n print(answer)", "def f(x):\r\n return (180*(j-2)/j)\r\nt=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n j=3\r\n while j:\r\n if f(j)<a:\r\n j+=1\r\n elif f(j)==a:\r\n print(\"YES\");break\r\n else:print(\"NO\");break", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 11 19:24:04 2023\r\n\r\n@author:2300011376\r\n\"\"\"\r\nN=int(input())\r\nwhile True:\r\n N-=1\r\n if N==-1:\r\n break\r\n a=int(input())\r\n if 360%(180-a)==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n ", "for _ in range(int(input())):\r\n a = int(input())\r\n print('YES' if (360 % (180 - a)) == 0 else 'NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nif __name__ == '__main__':\r\n n=int(input())\r\n while n:\r\n n -=1\r\n if 360%(180-int(input())):print(\"NO\")\r\n else:print(\"YES\")\r\n\r\n ", "a = int(input())\r\nd = []\r\nfor i in range(a):\r\n d.append(int(input()))\r\n\r\nfor i in d:\r\n if 360 % (180 - i) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "n = int(input())\nfor i in range(n):\n\tprint(\"YES\" if 360%(180-int(input())) == 0 else \"NO\")\n\t\t\t\t\t\t\t \t \t\t \t \t\t\t\t \t \t\t", "\r\nfor _ in range(int(input())):\r\n a= int(input())\r\n n=360%(180-a)\r\n if n==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "# import sys\r\n# sys.stdin=open('Python\\input.txt','r')\r\n# sys.stdout=open('Python\\output.txt','w')\r\n\r\nfrom math import ceil\r\nfor _ in range(int(input())):\r\n a=int(input())\r\n n=360/(180-a)\r\n print(['NO','YES'][n==ceil(n)])", "n = int(input())\r\nangles = []\r\nfor i in range(n):\r\n angles.append(int(input()))\r\nfor j in range(n):\r\n if 360 % (180 - angles[j]) == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\na_list = [int(input()) for _ in range(t)]\r\n\r\nacceptable = {int((180*(n-2))/n) for n in range(3, 1000) if (180*(n-2))/n % 1 == 0}\r\nfor e in a_list:\r\n if e in acceptable:\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", "for i in range(int(input())):\r\n lst=[]\r\n a=int(input())\r\n angle=0\r\n n=3\r\n while (angle<a):\r\n angle=(n-2)*180/n\r\n lst.append(angle)\r\n n+=1\r\n if lst[-1]==a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n", "for a0 in range(int(input())): print(['YES','NO'][(360 % (180 - int(input()))) > 0])", "n = int(input())\r\n\r\npol = {60, 90, 108, 120, 135, 140, 144, 150, 156, 160, 162, 165, 168, 170, 171,\r\n 172, 174, 175, 176, 177, 178, 179}\r\nfor i in range(n):\r\n ang = int(input())\r\n if ang in pol:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "t = int(input())\r\nfor _ in range(t):\r\n a = int(input())\r\n n = 0\r\n while n*a > (n-2)*180:\r\n n += 1\r\n if n*a == (n-2)*180:\r\n print('YES')\r\n break\r\n if n*a < (n-2)*180:\r\n print('NO')", "t = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n angle = 3\r\n while True:\r\n if a < 180*(angle-2)/angle:\r\n print(\"NO\")\r\n break\r\n elif a == 180*(angle-2)/angle:\r\n print(\"YES\")\r\n break\r\n else:\r\n angle += 1", "t=int(input())\r\ns=''\r\nfor i in range(t):\r\n a=int(input())\r\n side=360.0/((180-a)*1.0)\r\n if(side-int(side))==0:\r\n s+='YES\\n'\r\n else:\r\n s+='NO\\n' \r\n\r\nprint(s) ", "import math\r\nt = int(input())\r\nfor _ in range(t):\r\n a = int(input())\r\n n = 2/(1-a/180)\r\n # print(n)\r\n if math.isclose(n, round(n)):\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\nfor t1 in range(t):\r\n an = int(input());a = 3\r\n while True:\r\n angle = (a-2)/a*180\r\n if(angle>an):\r\n print('NO')\r\n break\r\n elif(angle==an):\r\n print('YES')\r\n break\r\n a+=1\r\n \r\n", "for _ in range(int(input())):\n\ta = int(input())\n\tif 360%(180 - a) == 0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\n", "n = int(input())\r\nlength = 0\r\nfor i in range(n):\r\n a = int(input())\r\n length = 360 / (180 - a)\r\n another_num = int(length)\r\n if length == another_num:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "t=int(input())\r\nfor _ in range(t):\r\n a=int(input())\r\n\r\n if 360 % (180-a) ==0 and a>=60:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\n\r\nfor _ in range(t):\r\n x = int(input())\r\n print(['YES','NO'][360%(180-x) != 0])", "result = []\r\ncounter = int(input())\r\nfor i in range(counter):\r\n angle = int(input())\r\n k = 360/(180-angle)\r\n if k%1 == 0 and angle != 0:\r\n result.append('YES')\r\n else:\r\n result.append('NO')\r\nfor i in result:\r\n print(i)", "for _ in range(int(input())):\r\n n=int(input())\r\n print(\"YES\" if 360%(180-n)==0 else 'NO')", "n = int(input())\r\nfor i in range(n):\r\n a = int(input())\r\n print('YES' if 360 % (180 - a) == 0 else 'NO')", "n = int(input())\r\nlis = []\r\nfor i in range(n):\r\n angle = int(input())\r\n lis.append(angle)\r\nfor i in lis:\r\n x = 360 / (180-i)\r\n if x == int(x):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for _ in range(int(input())):\r\n a=int(input())\r\n bs=360/(180-a)\r\n print(\"YES\") if bs.is_integer() else print(\"NO\")", "a = int(input())\r\nfor i in range(a):\r\n b = int(input())\r\n if 360 % (180 - b) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "for i in range(int(input())):\r\n x = int(input())\r\n x=180-x\r\n if 360 % x == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "t=int(input())\r\nfor a in range(0,t):\r\n b=int(input())\r\n if 360%(180-b)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "#2300011725\r\nn=int(input())\r\nfor i in range(n):\r\n m=int(input())\r\n if 360%(180-m)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nwhile t>0:\r\n t-=1\r\n n=int(input())\r\n if 360%(180-n)>0:\r\n print('NO')\r\n else:\r\n print('YES')", "#2300011786\r\nlst=[]\r\nfor i in range(3,1000):\r\n if (i-2)*180/i==(i-2)*180//i:\r\n lst.append((i-2)*180//i)\r\n\r\ndef f(n):\r\n for k in range(len(lst)):\r\n if n==lst[k]:\r\n return True\r\n\r\nn=int(input())\r\nfor j in range(n):\r\n angle=int(input())\r\n if f(angle)==True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "N=int(input())\r\nlist=[]\r\noutput=[]\r\nfor i in range(N):\r\n list.append(int(input()))\r\n c=180-list[i]\r\n if 360%c==0:\r\n output.append(1)\r\n else:\r\n output.append(0)\r\nfor i in range(N):\r\n if output[i]==1:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in range(int(input())):\r\n ang = int(input())\r\n n = 360/(180-ang)\r\n if (n * 10 % 10==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for _ in range(int(input())):\r\n a = int(input())\r\n # a = 180 * (n - 2) / n\r\n if a > 179 or a < 60:\r\n print('NO')\r\n else:\r\n a = 180 - a\r\n n = int(360 / a)\r\n if n * a == 360:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in range(int(input())):\r\n n=int(input())\r\n if (360/(180-n)) == int((360/(180-n))):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n", "n = int(input())\r\nfor _ in range(n):\r\n a = int(input())\r\n x = 360 / (180 - a)\r\n if x != round(x):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n\r\n", "n=int(input())\r\ni=1\r\nwhile i<=n:\r\n angle=int(input())\r\n w=360/(180-angle)\r\n if w==int(w):\r\n print('YES')\r\n i+=1\r\n else:\r\n print('NO')\r\n i+=1", "t = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n k = 360/(180 - a)\r\n if int(k) == k:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n", "t = int(input())\nb = []\nc =[]\nfor i in range(1,t+1):\n a = int(input())\n n = 360/(180-a)\n if n%1 != 0:\n b.append('NO')\n else:\n \n b.append('YES')\n##print(b) \nb.reverse()\n##print(b)\nfor i in range(1,t+1):\n print(b.pop())\n \n \n \n\n\n \n\n", "def ispolygonfence(angle):\r\n return 'YES' if 360 % (180 - angle) == 0 else 'NO'\r\n\r\nt = int(input())\r\ninp = []\r\nfor i in range(t):\r\n inp.append(int(input()))\r\nfor j in range(t):\r\n print(ispolygonfence(inp[j]))", "m={135, 140, 144, 150, 156, 160, 162, 165, 168, 170, 171, 172, 174, 175, 176, \r\n 177, 178, 179, 60, 90, 108, 120}\r\nfor i in range(int(input())):\r\n a=int(input())\r\n print([\"NO\",\"YES\"][a in m])", "def fancy_fence():\r\n for i in range(int(input())):\r\n degree = float(input())\r\n if 360/(180-degree) % 1 != 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n\r\nfancy_fence()", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n k=360/(180-a)\r\n if k==int(k):\r\n print('YES')\r\n else :\r\n print('NO')", "import sys\nimport bisect\nimport heapq\nimport math\nfrom functools import lru_cache\nfrom collections import defaultdict,Counter\n\n\n#sys.setrecursionlimit(10**6)\ninput = sys.stdin.readline\nI = lambda: int(input())\nS = lambda: input()\nL = lambda: list(map(int, input().split()))\n###################################################\n\n\n\n\ndef solution(n):\n if 360%(180-n)==0:\n print('YES')\n else:\n print('NO')\n\n\nif __name__=='__main__':\n n = I()\n for _ in range(n):\n solution(I())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 12 17:31:08 2023\r\n\r\n@author: 苏柔德 2300011012\r\n\"\"\"\r\nt= int(input())\r\nfor _ in range(t):\r\n a=int(input())\r\n n=360/(180-a)\r\n if n%1==0:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n a=int(input())\r\n print(['NO','YES'][360%(180-a)==0])", "t = int(input())\r\ns=[]\r\nfor k in range(t):\r\n ang = int(input())\r\n if 360/(180-ang) == int(360/(180-ang)):\r\n s.append('YES')\r\n else:\r\n s.append('NO')\r\nfor i in s:\r\n print(i)\r\n", "answers = []\r\n\r\nfor i in range(int(input())):\r\n x = int(input())\r\n if 360%(180-x) == 0:\r\n answers.append(\"YES\")\r\n else:\r\n answers.append(\"NO\")\r\n\r\n\r\nfor i in answers:\r\n print(i)\r\n", "for x in range(int(input())):\r\n angle=int(input())\r\n N=360/(180-angle)\r\n print([\"NO\",\"YES\"][int(N)==N])", "a=int(input())\r\nfor i in range(a):\r\n b=int(input())\r\n if int(360/(-b+180))==360/(-b+180) and 360/(-b+180)>2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n", "num=int(input())\r\nwhole=[]\r\nfor i in range(num):\r\n raw=int(input())\r\n processed=360/(180-raw)\r\n if processed==int(processed) and processed >= 3:\r\n whole.append(\"YES\")\r\n else:\r\n whole.append(\"NO\")\r\nfor ans in whole:\r\n print(ans)", "t = int(input())\r\nresults = []\r\nfor i in range(t):\r\n a = int(input())\r\n results.append('YES' if ((360 / (180 - a)) == (360 // (180 - a))) else 'NO')\r\n[print(result) for result in results]", "test=int(input())\r\nm=[]\r\nfor i in range(test):\r\n m.append(int(input()))\r\nfor i in m:\r\n if 360%(180-i)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in [0]*(int(input())):\r\n a=int(input())\r\n print('YNEOS'[int((360%(180-a))!=0)::2])", "def solve():\r\n\tt = int(input())\r\n\tq = [int(input()) for i in range(t)]\r\n\tangles = {}\r\n\t\r\n\tfor i in q:\r\n\t\tn = -360/(i-180)\r\n\t\tif n.is_integer():\r\n\t\t\tprint('YES')\r\n\t\telse:\r\n\t\t\tprint('NO')\r\n\t\t\r\n\r\nsolve()\r\n", "def can_build_fence(angle):\r\n return 360 % (180 - angle) == 0\r\n\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n angle = int(input())\r\n if can_build_fence(angle):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nans=[]\r\nfor a in range(t):\r\n a = int(input())\r\n if 360%(180-a)==0:\r\n ans.append('YES')\r\n else: ans.append('NO')\r\nfor x in ans: print(x)", "n=int(input())\r\n\r\nfor i in range(0,n):\r\n p=int(input())\r\n \r\n ans=(360)/(180-p)\r\n\r\n if ans.is_integer()==True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\n\r\n\r\n\r\n ", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n\tt=int(input())\r\n\tif t<60:\r\n\t\ta.append('NO')\r\n\telif 60<=t<180:\r\n\t\ti=360/(180-t)\r\n\t\tif i>=3 and i==i//1:\r\n\t\t a.append('YES')\r\n\t\telse:\r\n\t\t\ta.append('NO')\r\n\telse:\r\n\t\ta.append('NO')\r\nprint('\\n'.join(a))", "t = int(input())\r\na = []\r\nfor i in range(t):\r\n degrees = int(input())\r\n a.append(degrees)\r\n \r\nfor d in a:\r\n if 360 % (180 - d) == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "m=int(input())\r\ns=[]\r\nfor n in range(m):\r\n p=int(input())\r\n s.append(p)\r\nfor i in range(m):\r\n n=360/(180-s[i])\r\n l=int(n)\r\n if l==n:\r\n print('YES')\r\n else:\r\n print('NO')", "a = int(input())\r\nfor i in range(a):\r\n m = int(input())\r\n n = 360 % (180-m)\r\n t = 360 / (180-m)\r\n if n == 0 and t >= 3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import sys\ninput = lambda: sys.stdin.readline().rstrip('\\n\\r')\n\nfrom collections import Counter, defaultdict, deque\nfrom itertools import accumulate, chain, zip_longest, product, repeat\nfrom bisect import bisect_left, bisect_right\nfrom math import gcd\nfrom string import ascii_lowercase\nfrom functools import cmp_to_key\n\nmod = 10 ** 9 + 7\nmod_2 = 998244353\n\ndef solve():\n a = int(input())\n if 360 % (180 - a) == 0:\n return \"YES\"\n else:\n return \"NO\"\n\n\nfor _ in range(int(input())):\n val = solve()\n print(val)\n\n", "Angle = []\r\n# 360 = 2^3 * 3^2 * 5\r\n# 2:0,1,2,3 3:0,1,2 5:0,1\r\nfor i in range(4):\r\n for j in range(3):\r\n for k in range(2):\r\n factor = (2**i) * (3**j) * (5**k)\r\n if factor - 2 > 0:\r\n Angle.append(180 * (factor - 2) // factor)\r\nt = int(input())\r\nfor _ in range(t):\r\n degree = int(input())\r\n if degree in Angle:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n\tn=180-int(input())\r\n\tif 360//n>=3 and 360%n==0:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "#author 沈天健 2300011417\r\nt=int(input())\r\ndef ok_angle(x):\r\n if(360%(180-x)==0):\r\n return True\r\n else:\r\n return False\r\nfor _ in range(t):\r\n angle=int(input())\r\n if(ok_angle(angle)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\nfor _ in range(n):\r\n angle = int(input())\r\n n = 360/(180-angle)\r\n if n == int(n):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "t = int(input())\n#angles = []\nangles = [60, 90, 108, 120, 135, 140, 144, 150, 156, 160, 162, 165, 168, 170, 171, 172, 174, 175, 176, 177, 178, 179]\n#for n in range(3, 1000):\n# if (((n-2)*180) % n == 0):\n# a = (n-2)*180//n\n# angles.append(a)\n# #angles[a] = n\n\n#print(angles)\nfor _ in range(t):\n a = int(input())\n print(\"YES\" if a in angles else \"NO\")\n\n\t\t \t \t\t\t \t \t \t\t\t\t\t\t\t \t\t\t\t\t\t\t", "# n = int(input())\r\n# u = 180\r\n# for i in range(n):\r\n# i = int(input())\r\n# if u // i <= n:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\nn = int(input())\r\nfor i in range(1, n + 1):\r\n x=int(input())\r\n if 360%(180-x)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n n = 360 // (180 - a)\r\n if (n * (180 - a)) == 360:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\r\nfor it in range(int(input())):\r\n a=int(input())\r\n n=360/(180-a)\r\n if int(n)==n: print(\"YES\")\r\n else: print(\"NO\")", "n = int(input())\r\nanswer = []\r\nfor _ in range(n):\r\n jiaodu = int(input())\r\n if 360%(180 - jiaodu) == 0:\r\n answer.append(\"YES\")\r\n else:\r\n answer.append('NO')\r\nfor a in answer:\r\n print(a)", "'''\n###### * User Profile : Keval_78\nLinkedIn: https://www.linkedin.com/in/kevalpadsala78/\nGithub: https://github.com/Keval78\nLeetcode: https://leetcode.com/Keval_78/\n'''\n\nimport sys\nfrom os import path\nfrom math import log2, floor, ceil, sqrt, pow, gcd\n# from random import random, randint, shuffle, choice\nfrom collections import Counter, defaultdict, deque\n# from itertools import permutations, combinations\n# from functools import reduce\n# from heapq import heapify, heappop, heappush, heapreplace\nfrom bisect import bisect_left, bisect_right\n\n\ndef si(): return sys.stdin.readline().strip()\ndef ii(): return int(si())\ndef mi(ss=\" \"): return map(int, si().split(ss))\ndef msi(ss=\" \"): return map(str, si().split(ss))\ndef li(ss=\" \"): return list(mi(ss))\n\n\nsys.setrecursionlimit(10 ** 5)\nMOD, MOD2, INF = 10 ** 9 + 7, 998244353, float('inf')\nMAX = 10**5+1\n\n\nfor _ in range(ii()):\n angle = ii()\n print(\"YES\") if 360 % (180-angle) == 0 else print(\"NO\")\n", "t = int(input())\r\nfor tc in range (t):\r\n a = int(input())\r\n n = 360%(180-a)\r\n # print(n)\r\n if n == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n a = int(input())\r\n print(\"YES\" if (360/(180-a)).is_integer() else \"NO\")", "for i in range(int(input())):\r\n print(['NO', 'YES'][360 % (180 - int(input())) == 0])", "a = int(input())\r\nb=[]\r\nfor i in range(0,a):\r\n b.append(int(input()))\r\nfor i in range(0,a):\r\n if 360%(180-b[i]):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "d = [60,90,108,120,135,140,144,150,156,160,162,165,168,170,171,172,174,175,176,177,178,179,]\r\nfor _ in range(int(input())):\r\n a = int(input())\r\n print(\"YES\" if a in d else \"NO\")", "a=int(input())\r\nc=[]\r\nfor i in range(a):\r\n b=180-int(input())\r\n if 360%b==0:\r\n c.append('YES')\r\n else:\r\n c.append('NO')\r\nfor i in c:\r\n print(i)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 5 00:34:05 2022\r\n\r\n@author: thinkpad\r\n\"\"\"\r\n\r\nturn = int(input())\r\ncount = 0\r\nwhile count<turn:\r\n count+=1\r\n a = int(input())\r\n t1,t2 = 360/(180-a),360//(180-a)\r\n if t1==t2:\r\n print('{}'.format('YES'))\r\n else:\r\n print('{}'.format('NO'))\r\n ", "n = int(input())\r\nls=[60, 90, 108, 120, 135, 140, 144, 150, 156, 160, 162, 165, 168, 170, 171, 172, 174, 175, 176, 177, 178, 179]\r\nfor i in range (n):\r\n t = int(input())\r\n if t in ls :\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")", "# Night Vision\r\nfor _ in range(int(input())):\r\n n = int(input());calc = 360/(180-n)\r\n if calc >= 3 and calc == int(calc): print(\"YES\")\r\n else: print(\"NO\")\r\n", "inputlst=[]\r\nt = int(input())\r\nfor i in range(0,t):\r\n a = int(input())\r\n inputlst.append(a)\r\n\r\nfor a in inputlst:\r\n if (360%(180-a) == 0):\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n angle = int(input())\r\n print('YES' if 360%(180-angle)==0 else 'NO')", "\r\niter = int(input())\r\n\r\nfor i in range(iter):\r\n \r\n a = int(input())\r\n if (360 % (180 - a) == 0):\r\n print(\"YES\\n\")\r\n else:\r\n print(\"NO\\n\")\r\n\r\n", "for _ in range(int(input())):\r\n a = int(input())\r\n n = 3\r\n while 180*(n-2) / n < a:\r\n n+=1\r\n print(\"YES\" if 180 * (n-2) / n == a else \"NO\")", "def f():\n n = int(input())\n for _ in range(n):\n angle = int(input())\n sides = 360.0 / (180.0 - angle)\n if int(sides) == sides:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nf()\n", "arr = []\r\nfor i in range(3, 20000):\r\n if (180 * (i - 2)) / i > 179:\r\n break\r\n if (180 * (i - 2)) % i == 0:\r\n arr.append((180 * (i - 2)) // i)\r\nfor i in range(int(input())):\r\n if int(input()) in arr:\r\n print('YES')\r\n else:\r\n print('NO')", "n=int(input())\r\ns=0\r\nwhile s < n:\r\n a=int(input())\r\n a=360/(180-a)\r\n if int(a)-a==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n s+=1", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n b=2/(1-a/180)\r\n if b>2 and (abs(b-int(b)) < 10**(-10) or abs(b-int(b)-1)<10**(-10)):\r\n print('YES')\r\n else :\r\n print('NO')", "q = int(input())\r\nfor _ in range(q):\r\n n = int(input())\r\n if n < 60:\r\n print('NO')\r\n elif (360 / (180 - n)) == int((360 / (180 - n))):\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n for o in range(3,1001):\r\n if a*o == (o-2)*180:\r\n print(\"YES\")\r\n break\r\n if o == 1000 and a*o != (o-2)*180:\r\n print(\"NO\")\r\n break", "for _ in range(int(input())):\r\n a = int(input())\r\n\r\n if a<60:\r\n print(\"NO\")\r\n continue\r\n if (2*a)%(180-a)==0:\r\n print(\"YES\")\r\n continue\r\n print(\"NO\")", "n = int(input())\r\nfor i in range(n):\r\n angel = int(input())\r\n if 360%(180-angel) == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "#180n-360=an\r\nfor i in range(int(input())):\r\n a = int(input())\r\n con = 180-a\r\n if 360 % con == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n", "for _ in range(int(input())):\r\n y = int(input())\r\n x = 360 / (180 - y)\r\n if x == int(x):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "t = int(input())\r\n#t = int(t)\r\nfor i in range(t):\r\n a = input()\r\n a = int(a)\r\n a = 180 - a\r\n if(360 % a == 0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "round = int(input())\r\nfor _ in range(round):\r\n a = int(input()) #a refer to angle\r\n if 360/(180-a)== int(360/(180-a)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "num = int(input())\r\nfor i in range(num):\r\n n = int(input())\r\n if 360 ==(180-n)*int(360/(180-n)):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "def solve(a):\r\n if 360%(180-a)==0:return(\"YES\")\r\n return(\"NO\")\r\nfor _ in range(int(input())):\r\n print(solve(int(input())))", "n=int(input())\r\nfor _ in range(n):\r\n if 360%(180-int(input()))==0:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in range(int(input())):\r\n z=int(input())\r\n n=360/(180-z)\r\n if n-int(n)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "for x in range(int(input())):\r\n angel = int(input())\r\n print(\"YES\" if 360 % (180-angel) == 0 else \"NO\")", "n=int(input())\r\ns=[]\r\nfor i in range(100000):\r\n if (i*180)%(i+2)==0:\r\n a=(i*180)//(i+2)\r\n s.append(a)\r\nfor k in range(n):\r\n p=int(input())\r\n if p in s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n b=180-a\r\n B=int(b)\r\n if 360%b==0 and 360/b>2:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nfor i in range(n):\r\n d = int(input())\r\n n_ = 360//(180-d)\r\n if (180-d)*n_==360 :\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n n=int(input())\r\n#n,k=map(int,input().split())\r\n#for i in range(n):\r\n k=360/(180-n)\r\n if(int(k)==k):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "l= [179]\r\nfor i in range(3,181):\r\n x=int((i-2)*180/i)\r\n if (i-2)*180/i==x:\r\n l.append((i-2)*180/i)\r\nn=int(input())\r\nfor i in range(n):\r\n d=int(input())\r\n print(\"YES\" if d in l else \"NO\")", "from sys import stdout\n\nt = int(input())\nfor _ in range(t):\n num = int( input())\n if 360 % (180 - num) == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n \nstdout.flush()", "n=int(input())\r\nfor i in range(0,n):\r\n p=int(input())\r\n interior=180-p\r\n if 360%interior==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\ntest = [int(input()) for _ in range(n)]\r\n\r\nfor i in test : \r\n if 360%(i-180) == 0 : print(\"YES\")\r\n else : print(\"NO\")", "t=int(input())\r\nwhile t>0:\r\n t-=1\r\n \r\n n=int(input())\r\n k=180-n\r\n f=0\r\n for i in range(1,361):\r\n if 360/i==k:\r\n f=1\r\n print(\"YES\")\r\n if f==0:\r\n \r\n print(\"NO\")", "a=[3,4,5,6,8,9,10,12,15,18,20,24,30,36,40,45,60,72,90,120,180,360]\r\nd=[180*(n-2)/n for n in a]\r\ng=int(input())\r\nfor k in range(g):\r\n q=int(input())\r\n if q in d:\r\n print('YES')\r\n else:\r\n print('NO')", "\r\nn = int(input())\r\narr = []\r\nfor i in range(3, 361):\r\n arr.append((i - 2) * 180 / i)\r\nfor i in range(n):\r\n x = float(input())\r\n if arr.count(x) > 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "tt=int(input())\r\narrow=[]\r\nwhile tt>0:\r\n n=int(input())\r\n if n>180:\r\n ans='NO'\r\n else:\r\n a=180-n\r\n if 360%a==0:\r\n ans='YES'\r\n else:\r\n ans='NO'\r\n arrow.append(ans)\r\n tt-=1\r\nfor i in range(len(arrow)):\r\n print(arrow[i])", "l = []\r\nn = 3\r\nwhile n <400:\r\n l.append(((n-2)*180)/n)\r\n n+=1\r\n\r\n\r\nfor _ in range(int(input())):\r\n a = int(input())\r\n if a in l:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in range(int(input())):\r\n a=int(input())\r\n#(n-2)*180=n*a→180*n-360-a*n=0→(180-a)*n=360→n=360/(180-a)\r\n n=360%(180-a)\r\n if n==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 11 19:29:27 2023\r\n\r\n@author: liu\r\n\"\"\"\r\n\r\nt = int(input())\r\n\r\nfor _ in range(0,t):\r\n a = int(input())\r\n if 360 % (180-a) == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "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 Fancy_Fence():\r\n t = inp()\r\n outputStr = ''\r\n\r\n for i in range(t):\r\n a = inp()\r\n n = 360/(180-a)\r\n\r\n if n == int(n):\r\n outputStr += 'YES' + '\\n'\r\n else:\r\n outputStr += 'NO' + '\\n'\r\n \r\n outputStr = outputStr.strip()\r\n print(outputStr)\r\n \r\n return \r\n\r\nFancy_Fence()", "n = int(input())\r\nfor i in range(n):\r\n angle = int(input())\r\n rmag = 180-angle\r\n if 360 % rmag == 0:\r\n print('YES')\r\n elif 360 % rmag != 0:\r\n print('NO')", "IN = lambda:list(map(int, input().split()))\r\n \r\nfor _ in range(IN()[0]):\r\n angle = 180-(IN()[0])\r\n print(\"YNEOS\"[(360%angle != 0)::2])", "n = int(input())\r\ntests = []\r\n\r\nfor i in range(n):\r\n test = int(input())\r\n tests.append(test)\r\n\r\nfor i in range(n):\r\n ugol = tests[0]\r\n tests = tests[1:]\r\n a = (360 / (180 - ugol))\r\n if int(a) == a:\r\n print('YES')\r\n else:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\r\n#石芯洁 2300090102\r\n \r\nt=int(input())\r\nfor _ in range(t):\r\n a=int(input())\r\n if a <60:\r\n print(\"NO\")\r\n else:\r\n n_side=360/(180-a)\r\n if n_side % 1 ==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n", "# cook your dish here\r\n# by MEDIPALLY ABINAY\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n if(180-n>0 and 360%(180-n)==0):\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n", "'''\nn,m,a=map(int,input().split())\nif n%a==0:\n x=n//a\nelse :\n x=n//a+1\nif m%a==0:\n y=m//a\nelse:\n y=m//a+1\nprint(x*y)\n'''\n\n'''\nn=int(input())\nx=0\nfor i in range(0,n,1) :\n l=list(map(int,input().split()))\n s=0\n for j in l :\n s+=j\n if s>=2 :\n x+=1\nprint(x)\n'''\n\n'''\nn,k=map(int,input().split())\nl=list(map(int,input().split()))\ny=k-1\nif l[k-1]>0 :\n while l[y]==l[k-1] :\n y+=1\n if y==n :\n break\nelse :\n while l[y]<=0 :\n y-=1\n if y==-1 :\n break\n y+=1\nprint(y)\n'''\n\n'''\nm,n=map(int,input().split())\nmax=(m*n)//2\nprint(max)\n'''\n\n'''\nwhile True:\n try:\n str=input()\n except EOFError :\n break\n\n x = 0\n y = 0\n for i in range(0, len(str) - 1, 1):\n if str[i] == \"@\" and x == 0:\n x = i\n elif str[i] == \"@\" and x != 0:\n x = len(str) - 1\n elif str[i] == \".\":\n y = i\n if x == 0 or str[0] == \".\" or str[-1] == \".\" or x==len(str) - 1 or str[x+1]==\".\" or str[x-1] == \".\"or y<x :\n print(\"NO\")\n else:\n print(\"YES\")\n'''\n\n'''\ndef f(m,l) :\n k=0\n for x in l :\n if x==m :\n k=k+1\n return k\n\nq=int(input())\ns=[]\nfor i in range(0,q,1) :\n n=int(input())\n l=list(map(int,input().split()))\n x=2048\n for j in range(11,-1,-1) :\n if x//(2**j)<f(2**j,l) :\n x=x%(2**j)\n else :\n x=x-f(2**j,l)*(2**j)\n if x==0 :\n s.append(\"YES\")\n else :\n s.append(\"NO\")\nfor y in s :\n print(y)\n'''\n\nt=int(input())\nl=[]\ns=[]\nfor i in range(0,t,1) :\n x=int(input())\n l.append(x)\nfor y in l :\n if 360%(180-y)==0 :\n s.append('YES')\n else :\n s.append('NO')\nfor z in s :\n print(z)\n", "t = int(input())\nfor i in range(t):\n a = int(input())\n n = 360//(180-a)\n if n*(180-a) == 360:\n print(\"YES\")\n else:\n print(\"NO\")\n\t \t \t \t \t \t \t\t \t \t\t\t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 28 17:36:15 2021\r\n\r\n@author: cheeh\r\n\"\"\"\r\n\r\ndef fancyfence(x):\r\n k=360/(180-x)\r\n l=str(k).split('.')\r\n if l[1]=='0':\r\n return print('YES')\r\n else:\r\n return print('NO')\r\ntestnum=int(input())\r\nk=0\r\ntestlist=[]\r\nwhile k<testnum:\r\n testlist.append(int(input()))\r\n k+=1\r\nfor ele in testlist:\r\n fancyfence(ele)", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n a = int(stdin.readline())\r\n\r\n if 360 % (180 - a) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nfor _ in range(int(stdin.readline())):\r\n solve()\r\n", "from fractions import Fraction\n\nn = int(input())\n\nfor _ in range(n):\n q = int(input())\n print(\"YES\" if Fraction(-360,q-180).denominator==1 else \"NO\")", "for i in range(int(input())):\r\n a=int(input())\r\n x=360/(180-a)\r\n print(('NO','YES')[x-int(x)==0 and x>2])", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nIarr = lambda: list(map(int,input().split()))\r\n\r\ndef main():\r\n for _ in range(int(input())):\r\n n = int(input())\r\n ans = 180-n\r\n if(360%ans==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n\r\nif __name__ == '__main__':\r\n main()", "tests=int(input())\r\n\r\nfor p in range(1,tests+1):\r\n inangle=int(input())\r\n out=360/(180-inangle)\r\n \r\n if out==int(out):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from math import ceil, floor\r\n\r\ndef is_valid(n):\r\n return ceil(n) == floor(n)\r\n\r\ndef can_build(a):\r\n n = 360 / (180 - a)\r\n if is_valid(n):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n print(can_build(a))", "\r\nyes_no = 'YNEOS'\r\n\r\ni = int(input())\r\nfor i in range(i):\r\n a = int(input())\r\n print(yes_no[360%(180-int(a))>0::2])\r\n", "t = int(input())\r\nans = []\r\n\r\nfor i in range(t):\r\n a = int(input())\r\n j = 3\r\n flag = True\r\n while (180 - a) * j <= 360:\r\n if (180 - a) * j == 360:\r\n ans.append(\"YES\")\r\n flag = False\r\n break\r\n else:\r\n j += 1\r\n if flag:\r\n ans.append(\"NO\")\r\nfor i in ans:\r\n print(i)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 6 16:02:42 2023\r\n\r\n@author: ghp\r\n\"\"\"\r\n\r\nt=int(input())\r\nfor i in range(t):\r\n x=int(input())\r\n y=180-x\r\n if 360%y==0:\r\n print(\"YES\")\r\n else:\r\n print('NO')", "t = int(input())\nfor i in range(t):\n a = int(input())\n if ((-360) / (a -180)) == int((-360) / (a -180)):\n print(\"YES\")\n else:\n print(\"NO\")\n", "for i in range(int(input())):\r\n n=int(input())\r\n x=180-n\r\n if 360%x==0:\r\n print('YES')\r\n else:\r\n print('NO')", "def verifica_poligono(a):\r\n # formula do angulo interno de um poligono regular: a = 180*(n - 2)/n \r\n # isolando o 'n', temos:\r\n n = 360/(180-a)\r\n\r\n if n == int(n): # se o numero de lados for inteiro, o poligono existe\r\n print(\"YES\")\r\n else: # se nao, nao existe\r\n print(\"NO\")\r\n\r\ndef main():\r\n t = int(input())\r\n for i in range(t):\r\n a = int(input()) #angulo\r\n verifica_poligono(a)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "#王奕欢 2300012285\r\na=int(input())\r\nl=[]\r\nfor i in range(a):\r\n b=int(input())\r\n c=180-b\r\n if 360%c==0:\r\n l.append(\"YES\")\r\n else:\r\n l.append(\"NO\")\r\nfor n in l:\r\n print(n)", "for _ in range(int(input())):\r\n a = int(input())\r\n print(\"NO\" if a==180 or not 360%(180-a)==0 else \"YES\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n ANGLES:list[int] = [int(input()) for _ in range(int(input()))]\r\n IS_POSSIBLES:list[bool] = [(360/(180-angle)).is_integer() for angle in ANGLES]\r\n print(\"\\n\".join([[\"NO\", \"YES\"][isPossible] for isPossible in IS_POSSIBLES]))\r\n\r\nmain()", "for i in range(int(input())):\r\n deg=int(input())\r\n n=360/(180-deg)\r\n if n-int(n)==0.0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "right = []\r\nfor i in range(4):\r\n for j in range(3):\r\n for k in range(2):\r\n x = int(180-360/(2**i * 3**j * 5**k))\r\n right.append(x)\r\nn = int(input())\r\nfor i in range(n):\r\n z = int(input())\r\n if z in right:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "for _ in range(int(input())):\r\n t = int(input())\r\n\r\n n = float(360/(180-t))\r\n\r\n if n==int(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n'''\r\n\r\nt.n = (n-2).180\r\nt.n = 180.n - 360\r\n360 = n(180-t)\r\nn = (360)/(180-t)\r\n\r\n'''", "[[print('YES') if int(input()) in [(n-2)*180/n for n in range(3,1000)] else print('NO')] for n in range(int(input()))]", "t = int(input())\r\n\r\ndef angle(a):\r\n if 360 % (180-a) == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nfor i in range(t):\r\n a = int(input())\r\n possibility = angle(a)\r\n print(possibility)", "\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n k = int(input())\r\n if((360/(180-k)) == (360//(180-k))):\r\n print('YES')\r\n else:\r\n print('NO')", "from math import inf\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nans = set()\r\nfor i in range(3, 100000):\r\n x = (i - 2) * 180\r\n cur = x / i\r\n if int(cur) == cur:\r\n ans.add(int(cur))\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n print(\"YES\" if n in ans else \"NO\")", "# the angel of a regular polygon is\r\n# (1 - 2/n) * 180° \r\n\r\nimport math\r\n\r\nn = int(input())\r\n\r\nfor _ in range(0, n):\r\n a = int(input())\r\n\r\n k = 2 / (1 - a / 180) \r\n\r\n\r\n if math.isclose(round(k), k, abs_tol=1e-6):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def solve(n):\r\n return [\"NO\",\"YES\"][360 % (180 - n) == 0]\r\n\r\nlst = [int(w.rstrip()) for w in open(0).readlines()]\r\nprint('\\n'.join(solve(n) for n in lst[1:]))", "t = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n if a < 60 :\r\n print('NO')\r\n else:\r\n b = int(180-a)\r\n if 360%b == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n ", "n=int(input())\r\nx=120\r\ns=[]\r\nwhile x>0:\r\n if 360%x==0:\r\n s.append(x)\r\n x-=1\r\nfor i in range(n):\r\n a=int(input())\r\n if 180-a in s:\r\n print('YES')\r\n else:\r\n print('NO')", "a = []\r\nfor i in range(int(input())):\r\n if 360 % (180 - int(input())) == 0:\r\n a.append('YES')\r\n else:\r\n a.append('NO')\r\nfor i in a:\r\n print(i)", "Q=int(input())\r\nfor q in range(0,Q) :\r\n a=int(input())\r\n a=180-a\r\n if (360%a)==0 :\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")", "# https://codeforces.com/problemset/problem/270/A\n\ntest_cases = int(input())\n\ndef handle():\n angle = int(input())\n if 360 % (180 - angle) == 0:\n return \"YES\"\n return \"NO\"\n\nfor _ in range(test_cases):\n print(handle())", "n = int(input())\r\nresult = []\r\nfor i in range(n):\r\n degree = int(input())\r\n if 360 % (180-degree) == 0:\r\n result.append('YES')\r\n else:\r\n result.append('NO')\r\nfor j in range(len(result)):\r\n print(result[j])\r\n \r\n \r\n \r\n", "from math import ceil\r\n\r\n\r\nt = int(input())\r\nwhile t :\r\n angle = int(input())\r\n sides = 360/(180-angle) \r\n print(\"YES\" if ceil(sides) == sides else \"NO\")\r\n t -= 1", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 11 20:19:10 2023\r\n\r\n@author: masiyu004\r\n\"\"\"\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n if 360%(180-a)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in range(int(input())):\r\n n= int(input())\r\n print([\"NO\",\"YES\"][360/(180-n)== int(360/(180-n))])", "an=[]\r\nfor i in range(3,1000):\r\n a=((i-2)*180)/i\r\n if a-int(a)==0:\r\n an.append(int(a))\r\nt=input()\r\nfor tt in range(int(t)):\r\n aa=input()\r\n if int(aa) in an:\r\n print('YES')\r\n else:\r\n print('NO')", "T = int(input())\r\nfor t in range(T):\r\n angle = int(input())\r\n n = 3\r\n while True:\r\n # print(n)\r\n if n * angle == (n - 2) * 180:\r\n print(\"YES\")\r\n break\r\n n += 1\r\n if n > 360:\r\n print(\"NO\")\r\n break", "for i in range(int(input())):\r\n k=360%(180-int(input()))==0\r\n print(k*\"YES\"+(1-k)*\"NO\")", "def polygon(k):\r\n\tif 360 % (180 - k) == 0:\r\n\t\treturn 'YES'\r\n\telse:\r\n\t\treturn 'NO'\r\n\r\nt = int(input())\r\nlst = []\r\nfor i in range(t):\r\n\tn = int(input())\r\n\tlst.append(polygon(n))\r\nprint(*lst, sep=\"\\n\")", "n = int(input())\nl = []\nfor i in range(n):\n a = int(input())\n l.append(a)\n\n\nfor a in l:\n s = 360 / (180 - a)\n if s % 1 == 0:\n print(\"YES\")\n else:\n print(\"NO\")", "n = int(input())\r\nans = []\r\n\r\nfor i in range(n):\r\n x = int(input())\r\n myvariable = 360/(180-x)\r\n myintvariable = int(myvariable)\r\n if (myintvariable - myvariable == 0.0):\r\n ans.append(\"YES\")\r\n else:\r\n ans.append(\"NO\")\r\nfor i in ans:\r\n print(i)\r\n ", "A={60,90,179,178,177,176,175,174,172,171,170,168,165,162,160,156,150,144,140,135,120,108}\r\nfor _ in range(int(input())):print([\"NO\",\"YES\"][int(input()) in A])", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n s=360/(180-a)\r\n if s==int(s):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nfor i in range(t):\r\n x = int(input())\r\n n = 360/(180 - x)\r\n if n%1==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "'''程文奇 2100015898'''\r\ndef fence(a):\r\n if 360%(180-a)==0:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\nn=int(input())\r\nanswerlist=[]\r\nfor i in range(n):\r\n answerlist.append(fence(int(input())))\r\nfor j in answerlist:\r\n print(j)", "\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\nfor _ in range(II()):\r\n deg = II()\r\n print('NO' if 360%(180-deg) or deg < 60 else 'YES')\r\n \r\n \r\n", "#@sorcerer_21\r\nimport sys\r\ninput=lambda:sys.stdin.readline()\r\nmapin=lambda:map(int,input().split())\r\nangles=[]\r\nfor i in range(3,361):angles.append((i-2)*180/i)\r\nfor i in range(int(input())):\r\n theta=float(input())\r\n print('YES' if theta in angles else 'NO')", "def regular_polygon(theta):\r\n i = 3\r\n while theta * i / (i-2) > 180:\r\n i += 1\r\n if theta * i / (i-2) == 180:\r\n return(True)\r\n else:\r\n return(False)\r\n\r\nn = int(input())\r\nalpha = []\r\nfor i in range(n):\r\n alpha.append(int(input()))\r\nfor i in range(n):\r\n if regular_polygon(alpha[i]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# A. Fancy Fence\r\n# time limit per test2 seconds\r\n# memory limit per test256 megabytes\r\n# inputstandard input\r\n# outputstandard output\r\n# Emuskald needs a fence around his farm, but he is too lazy to build it himself. \r\n# So he purchased a fence-building robot.\r\n\r\n# He wants the fence to be a regular polygon. The robot builds the fence along a \r\n# single path, but it can only make fence corners at a single angle a.\r\n\r\n# Will the robot be able to build the fence Emuskald wants? In other words, \r\n# is there a regular polygon which angles are equal to a?\r\n\r\n# Input\r\n# The first line of input contains an integer t (0 < t < 180) — the number of tests.\r\n# Each of the following t lines contains a single integer a (0 < a < 180) — the angle\r\n# the robot can make corners at measured in degrees.\r\n\r\n# Output\r\n# For each test, output on a single line \"YES\" (without quotes), if the robot can build \r\n# a fence Emuskald wants, and \"NO\" (without quotes), if it is impossible.\r\n \r\ndef main(): \r\n testes = int(input() )\r\n for i in range(testes):\r\n angle = int(input())\r\n if(360 % (180-angle) == 0 ):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nfor i in range(n):\r\n a = int(input())\r\n s = 360 / (180 - a)\r\n if str(s)[-1] == '0':\r\n print('YES')\r\n else:\r\n print('NO')", "p=int(input())\r\nfor i in range(p):\r\n x=int(input())\r\n n=360/(180-x)\r\n if n== int(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\nlist1=[179,178,177,176,175,174,172,171,170,168,165,162,160,156,150,144,140,135,120,108,90,60]\r\nfor i in range(t):\r\n a=int(input())\r\n if a in list1:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\npolygons = []\r\nfor i in range(3, 361):\r\n if 360%i == 0:\r\n polygons.append(180-(360//i))\r\nfor i in range(t):\r\n angle = int(input())\r\n if angle in polygons:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for m in range(int(input())): #declaring input\r\n print(\"YES\" if 360 % (180 - int(input())) == 0 else \"NO\") #printing output here", "import math as mt\r\nfrom collections import defaultdict,deque\r\nfrom re import I\r\nimport sys\r\nfrom bisect import bisect_right as b_r\r\nfrom bisect import bisect_left as b_l\r\nfrom os import path\r\nfrom heapq import *\r\n\r\ninput=sys.stdin.readline\r\n\r\nmod=1000000007\r\nINT_MAX = sys.maxsize-1\r\nINT_MIN = -sys.maxsize\r\n\r\n\r\n\r\n# if(path.exists('input.txt')):\r\n# sys.stdin = open('input.txt','r')\r\n# sys.stdout = open('output.txt','w')\r\n\r\ndef myyy__answer():\r\n a=int(input())\r\n if(a==180):\r\n return \"NO\"\r\n else:\r\n if(360%(180-a)==0):\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n \r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n for _ in range(int(input())):\r\n print(myyy__answer())", "n = int(input())\r\nfor i in range(n):\r\n num = 360 % (180 - int(input()))\r\n if num == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "for i in range(int(input())):\r\n if 360%(180-int(input()))==0:print('YES')\r\n else:print('NO')", "#2300011863 张骏逸\nfor i in range(int(input())):\n n=int(input())\n n=180-n\n if 360%n==0:\n print('YES')\n else:\n print('NO')", "for i in range(int(input())):\r\n s=int(input())\r\n if (360/(180-s))==(360//(180-s)):\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nfor i in range(n):\r\n a = int(input())\r\n b = 180 -a\r\n if 360 % b ==0:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nfor i in range(n):\r\n k = int(input())\r\n if 360%(180-k)==0 and 360/(180-k)>=3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\ndef check(x):\r\n if 360%(180-x)==0:\r\n return\"YES\"\r\n else:\r\n return\"NO\"\r\nfor i in range(n):\r\n x=int(input())\r\n print(check(x))", "t = int(input()) \r\nresults = [] \r\n\r\nfor _ in range(t):\r\n a = int(input()) \r\n\r\n interior_angle = 180 - a\r\n\r\n if 360 % interior_angle == 0:\r\n results.append(\"YES\")\r\n else:\r\n results.append(\"NO\")\r\n\r\nfor result in results:\r\n print(result)\r\n", "n=int(input())\r\nwhile n>0:\r\n n=n-1\r\n a=int(input())\r\n l=360/(180-a)\r\n if l==int(l):\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nfor _ in range(n):\r\n angle = int(input())\r\n found = False\r\n for i in range(3, 1000):\r\n if angle == (i-2)*180/i:\r\n print('YES')\r\n found = True\r\n if not found:\r\n print('NO')", "for _ in range(int(input())):\n n=int(input())\n res=360/(180-n)\n print(['NO','YES'][res==int(res)])\n\t \t \t\t\t \t\t\t\t\t \t\t\t\t\t\t \t\t", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n print(\"YES\" if 360 % (180 - n) == 0 else \"NO\")", "\ndef polygon_exists(theta :int) -> str:\n if 360 % (180 - theta) == 0:\n return \"YES\"\n return \"NO\"\n\ntests = int(input())\n\nfor _ in range(tests):\n print(polygon_exists(int(input())))", "t = int(input())\r\na = []\r\nfor i in range(t):\r\n x = int(input())\r\n n = (-360 * x / (x - 180)) / x\r\n a.append('YES' if int(n) == n else 'NO')\r\n\r\nfor i in a:\r\n print(i)\r\n\r\n", "for _ in range(int(input())):\r\n a = int(input())\r\n if (360/(180-a)) - int(360/(180-a)) == 0:\r\n print('YES') \r\n else: \r\n print('NO')", "\r\nfrom math import gcd\r\nfrom bisect import bisect_left, bisect_right\r\nfrom itertools import combinations\r\nfrom itertools import permutations\r\nfrom bisect import bisect_left\r\nfrom math import ceil\r\nfrom heapq import heapify, heappush, heappop, nsmallest\r\nimport bisect\r\nfrom math import pi\r\nfrom collections import deque\r\nfrom math import factorial\r\nfrom math import log, ceil\r\nfrom collections import defaultdict\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# mod = 998244353\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 li1(): 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 and i % 2 == 1:\r\n s.add(i)\r\n n = n // i\r\n if n > 2 and n % 2 == 1:\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 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\n# def input():\r\n# return stdin.buffer.readline()\r\n\r\n\r\ndef readTree(n):\r\n adj = [set() for _ in range(n)]\r\n for _ in range(n-1):\r\n u, v = map(int, input().split())\r\n adj[u-1].add(v-1)\r\n adj[v-1].add(u-1)\r\n return adj\r\n\r\n\r\ndef treeOrderByDepth(n, adj, root=0):\r\n parent = [-2] + [-1]*(n-1)\r\n ordered = []\r\n q = deque()\r\n q.append(root)\r\n depth = [0] * n\r\n while q:\r\n c = q.popleft()\r\n ordered.append(c)\r\n for a in adj[c]:\r\n if parent[a] == -1:\r\n parent[a] = c\r\n depth[a] = depth[c] + 1\r\n q.append(a)\r\n return (ordered, parent, depth)\r\n\r\n\r\ndef isSubSequence(str1, str2):\r\n m = len(str1)\r\n n = len(str2)\r\n j = 0\r\n i = 0\r\n while j < m and i < n:\r\n if str1[j] == str2[i]:\r\n j = j+1\r\n i = i + 1\r\n return j == m\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 while(n != 0):\r\n n >>= 1\r\n count += 1\r\n return 1 << count\r\n\r\n\r\ndef lastPowerOf2(n):\r\n count = -1\r\n if (n and not(n & (n - 1))):\r\n return n\r\n while(n != 0):\r\n n >>= 1\r\n count += 1\r\n return 1 << count\r\n\r\n\r\ndef cou(n):\r\n c = 0\r\n while n > 1:\r\n c += 1\r\n n //= 2\r\n return c\r\n\r\n\r\ndef sortsec(l):\r\n return sorted(l, key=lambda x: x[1])\r\n\r\n\r\ndef BinarySearch(a, x):\r\n i = bisect_left(a, x)\r\n if i:\r\n return (i-1)\r\n else:\r\n return - 1\r\n\r\n\r\ndef subarray(A):\r\n r = set()\r\n\r\n p = {0}\r\n\r\n for x in A:\r\n p = {x | y for y in p} | {x}\r\n r |= p\r\n\r\n return len(r)\r\n\r\n\r\ndef setBitNumber(n):\r\n n |= n >> 1\r\n n |= n >> 2\r\n n |= n >> 4\r\n n |= n >> 8\r\n n |= n >> 16\r\n n = n + 1\r\n return (n >> 1)\r\n\r\n\r\ndef countSetBits(n):\r\n count = 0\r\n while (n):\r\n count += n & 1\r\n n >>= 1\r\n return count\r\n\r\n\r\ndef allsub(l):\r\n n = len(l)\r\n a = []\r\n for i in range(n - 1):\r\n a.append([l[:i], l[i:]])\r\n a.append([l[i:], l[:i]])\r\n return a\r\n\r\n\r\ndef closestMultiple(n, x):\r\n if x > n:\r\n return x\r\n z = (int)(x / 2)\r\n n = n + z\r\n n = n - (n % x)\r\n return n\r\n\r\n\r\ndef block(x):\r\n v = []\r\n res = []\r\n while (x > 0):\r\n v.append(int(x % 2))\r\n x = int(x / 2)\r\n for i in range(0, len(v)):\r\n if (v[i] == 1):\r\n res.append(i)\r\n return res\r\n\r\ndef gen(n):\r\n\r\n l=[]\r\n for bi in range(2**n + 1):\r\n x=decimalToBinary(bi)\r\n x='0'*(n-len(x))+x\r\n l.append(x)\r\n return l\r\n\r\nfor _ in range(ii()):\r\n n=ii()\r\n if 360%(180-n)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\nr = []\r\nfor i in range(n):\r\n a = int(input())\r\n if 360 %(180-a) == 0:\r\n r.append('YES')\r\n else:\r\n r.append('NO')\r\nfor i in r:\r\n print(i)\r\n", "temp = ['YES', 'NO']\r\nt = int(input())\r\nfor _ in range(t):\r\n b = 180 - int(input())\r\n print(temp[bool(360 % b)])\r\n", "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n if 360%(180-n)==0:\r\n ans = \"YES\"\r\n else:\r\n ans = \"NO\"\r\n\r\n print(str(ans)+\"\\n\")\r\n", "n=int(input())\r\n\r\nfor i in range(n):\r\n x=int(input())\r\n if int(360/(180-x))/float(360/(180-x))==1.0:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\n\r\noutput = []\r\nfor i in range(t):\r\n a = int(input())\r\n n = 360 / (180 - a)\r\n if n - int(n) == 0:\r\n output.append(\"YES\")\r\n else:\r\n output.append(\"NO\")\r\n\r\nfor o in output:\r\n print(o)\r\n", "#270A\r\nn = int(input())\r\nfor i in range(n):\r\n a = int(input())\r\n if abs(round((1/(1-a/180))*2)-(1/(1-a/180))*2) < 10**(-7): \r\n '''\r\n 2 Tips：\r\n 1.DO NOT simply use == , because calculation under type float induce tiny computation error(10**(-7)) \r\n 2.DO NOT write int(), because int() will arbitrarily throw away anything after the decimal point, that might be sth. like 0.999999\r\n Write round() instead to ensure tiny rounding error\r\n '''\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n print(\"NO\" if(360%(180-int(input()))) else \"YES\")", "n = int(input())\r\ns = ''\r\nfor i in range(n):\r\n a = int(input())\r\n if 360 % (180-a) == 0:\r\n s = s + 'YES\\n'\r\n else:\r\n s = s + 'NO\\n'\r\nprint(s[:-1])", "n = int(input())\r\n\r\nans = []\r\n\r\nfor i in range(0, n):\r\n deg = int(input())\r\n num = 360 / (180 - deg)\r\n\r\n if num == int(num):\r\n ans.append(\"YES\")\r\n else:\r\n ans.append(\"NO\")\r\n\r\nfor i in ans:\r\n print(i)", "a = int(input())\r\nfor i in range(0,a):\r\n b = int(input())\r\n c = 180-b\r\n d = 360/c\r\n e = d%1\r\n if(e==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def get_ans():\r\n for i in range(1,100000):\r\n if (180*i) % (i+2) ==0:\r\n print(int(180*i/(i+2)),i)\r\n \r\nans = [60,90,108,120,135,140,144,150,156,160,162,165,168,170,\r\n 171,172,174,175,176,177,178,179]\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n try: \r\n ans.index(a)\r\n print('YES')\r\n except:\r\n print('NO')", "#周家恒化学与分子工程学院 2023年秋\r\n#简单的循环语句\r\np=[]\r\nn=int(input())\r\nfor i in range(0,n):\r\n a=180-int(input())\r\n if 360//a==360/a:\r\n p.append(\"YES\")\r\n else:\r\n p.append(\"NO\")\r\nfor i in p:\r\n print(i)", "i=input;exec(int(i())*'print(\"YNEOS\"[360%(180-int(i()))>0::2]);')", "for _ in range(0, int(input())):\n d = int(input())\n print([\"NO\", \"YES\"][360 % (180 - d) == 0])\n", "for i in range(int(input())):\r\n if (360/(int(input())-180)).is_integer():\r\n print(\"YES\")\r\n else:print(\"NO\")", "import math\r\ndu=int(input())\r\nfor i in range(0,du):\r\n y=int(input())\r\n x=360/(180-y)\r\n if x-math.floor(x)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "def isint(x):\r\n if x== int(x):\r\n return True\r\n elif x!=int(x):\r\n return False\r\nn=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n n=360/(180-a)\r\n\r\n if n>=3 and isint(n)==True:\r\n print('YES')\r\n else:\r\n print('NO')\r\n#debug1:type（）判断在这里不是很好用，这里给出判断int的方法，直接比较x与intx是否相等\r\n#debug2：写函数的时候，函数名不能和函数内容中的其他变量/方法重名", "n=int(input())\r\nfor x in range(n):\r\n x=input()\r\n x=int(x)\r\n y=0\r\n for m in range(3,361):\r\n if x==180*(m-2)/m:\r\n y+=1\r\n else:\r\n y=y\r\n if y==1:\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n n=2/(1-(a/180))\r\n if abs(n-round(n))<10**(-5):\r\n print('YES')\r\n else:\r\n print('NO')", "from sys import stdin\r\n\r\nres = [\"NO\"] * 180\r\n\r\nfor n in range(3, 361):\r\n a = 180 * (n - 2) / n\r\n if int(a) == a:\r\n res[int(a)] = \"YES\"\r\n\r\n\r\ndef solve():\r\n n = int(stdin.readline())\r\n print(res[n])\r\n\r\n\r\nfor _ in range(int(stdin.readline())):\r\n solve()\r\n", "s=[]\r\nfor i in range(3,361):\r\n if 360%i==0:\r\n p=(i-2)*180\r\n q=int(p/i)\r\n s.append(q)\r\nn=int(input())\r\ni=1\r\nwhile i<=n:\r\n i=i+1\r\n k=int(input())\r\n if k in s:\r\n print('YES')\r\n else:\r\n print('NO')", "from collections import deque\nt = int(input())\nfor _ in range(t):\n d = int(input())\n n = 360 /(180 - d)\n if n % 1 > 0:\n print(\"NO\")\n else:\n print(\"YES\")\n\n", "t = int(input())\r\nfor i in range(t):\r\n degree = int(input())\r\n if (360//(180-degree))*(180-degree)==360:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\n\r\ndata = []\r\nwhile len(data) != n:\r\n data.append(int(input()))\r\n\r\nfor i in data:\r\n if (360 / (180 - i)) % 1 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "# LUOGU_RID: 111701884\nn=eval(input())\r\ndef js():\r\n a = eval(input())\r\n if a<60 or a>=360 or a==180:\r\n print(\"NO\")\r\n return\r\n if 360%(180-a)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n return\r\nfor i in range(n):\r\n js()\r\n", "t=int(input())\r\noutput=[]\r\nfor _ in range(t):\r\n a=int(input())\r\n line=3\r\n while True:\r\n if (180-a)*line==360:\r\n output.append(\"YES\")\r\n break\r\n else:\r\n line+=1\r\n if (180-a)*line>360:\r\n output.append(\"NO\")\r\n break\r\n[print(i) for i in output]", "t=int(input())\r\nlist=[]\r\n\r\nfor n in range(3,361):\r\n if 360%n==0:\r\n list.append(int(180-360/n))\r\n\r\nfor i in range(1,t+1):\r\n angle=int(input())\r\n if angle in list:\r\n print('YES')\r\n else:\r\n print('NO')", "from sys import stdin\r\ninp = stdin.readline\r\n\r\nt = int(inp())\r\n\r\nfor _ in range(t):\r\n n = int(inp())\r\n\r\n if (2*n) % (180 - n) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "for i in range(int(input())):\r\n print('NO'if 360%(180-int(input())) else 'YES')", "t=int(input())\r\nwhile(t):\r\n x=int(input())\r\n n=360/(180-x)\r\n if n%1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n t-=1", "n = int(input())\r\nfor i in range(n):\r\n t = int(input())\r\n s = 360/(180-t)\r\n if s - int(s) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "for _ in range(int(input())):\n a = int(input())\n print('NO' if 360%(180 - a) > 0 else 'YES')\n\n \t\t \t\t \t\t \t \t \t \t\t \t", "tese_time=int(input())\r\nfor i in range(tese_time):\r\n #test_num=2/(1-int(input())/180)这样做由于算法本身按顺序会把2/（2/3） ==2.9999999999996不可\r\n test_num=360/(180-int(input()))\r\n if test_num % 1 == 0.0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "num_test = int(input())\r\n\r\nfor i in range (0, num_test):\r\n angle_a = int(input())\r\n if 360 % (180-angle_a) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for i in range(int(input())):\r\n a = int(input())\r\n n = (360)/(180-a)\r\n if(int(n)==n):\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\n\r\nfor _ in range(t):\r\n n = int(input())\r\n if(360 % (180 - n) == 0): print(\"YES\")\r\n else: print(\"NO\")", "t=int(input())\r\na=[]\r\nfor i in range(t):\r\n a.append(int(input()))\r\nfor i in range(t):\r\n if a[i]<60:\r\n print(\"NO\")\r\n continue\r\n j=3\r\n while(True):\r\n if (j-2)*180/j<a[i]<(j-1)*180/(j+1):\r\n print(\"NO\")\r\n break\r\n if (j-2)*180/j==a[i]:\r\n print(\"YES\")\r\n break\r\n j+=1\r\n \r\n#poly:n\r\n#angle=(n-2)*180/n", "t = int(input())\r\n\r\ninput_degrees = [int(input()) for _ in range(t)]\r\n\r\ndegree_list = [theta for theta in range(60, 180) for n in range(3, 361) if ((n-2)*180 == n*theta)]\r\n\r\nresult = ['YES' if element in degree_list else 'NO' for element in input_degrees]\r\nprint('\\n'.join(result))", "for times in range(int(input())):\r\n lines = 360 / (180 - float(input()))\r\n print(['NO', 'YES'][int(lines)==lines and lines >= 3])", "t = int(input())\r\nfor j in range(t):\r\n x = int(input())\r\n ans = \"NO\"\r\n for i in range(1,361):\r\n if(i*(180-x)==360):\r\n ans = \"YES\"\r\n break\r\n print(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 11 15:49:54 2022\r\n\r\n@author: Lemon_Sherry\r\n\"\"\"\r\n\r\nn = int(input())\r\nfor i in range(0,n):\r\n ag = int(input())\r\n s = 0\r\n while s < 360:\r\n s += 180 - ag\r\n if s == 360:\r\n print('YES')\r\n else:\r\n print('NO')", "i=input\r\nfor x in range(int(i())):print(\"YNEOS\"[360%(180-int(i()))>0::2])", "for t in range(int(input())):\r\n th = int(input())\r\n\r\n if ( 360 % (180 - th) == 0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a=int(input())\r\nfor i in range(a):\r\n b=int(input())\r\n n=360/(180-b)\r\n if n%1==0:\r\n print('YES')\r\n else:\r\n print('NO')", "def judge(a):\r\n n=360/(180-a)\r\n if n>=3 and int(n)==n:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\nN=int(input())\r\nout=[]\r\nfor _ in range(N):\r\n out.append(judge(int(input())))\r\nfor o in out:\r\n print(o)", "t = int(input())\r\n\r\n\r\nfor i in range(t) :\r\n a = int(input())\r\n n = round((2 / (1 - (a/180))))\r\n \r\n x = (n-2) * 180 / n\r\n if(a==x):\r\n print(\"YES\")\r\n else : \r\n print(\"NO\")", "t=int(input())\r\nfor i in range(0,t):\r\n a=int(input())\r\n sides = 360 / (180 - a)\r\n if sides == int(sides) :\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for i in range(int(input())):\r\n d1 = int(input())\r\n n = 360%(180-d1)\r\n if n == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for i in range(int(input())):\r\n print(\"YES\") if 360 % (180-int(input())) == 0 else print(\"NO\")\r\n", "t=int(input())\r\nfor i in range(t):\r\n angle=int(input())\r\n supplementary=180-angle\r\n if 360%supplementary==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nfor i in range(n):\r\n m=int(input())\r\n p=180-m\r\n if (360/p)%1==0:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(int(input()))\r\n\r\nfor c in a:\r\n guo = 360/(180-c)\r\n if int(guo) == round(guo,16):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "times = int(input())\r\nfor i in range(times):\r\n angle = int(input())\r\n if (360/(180-angle)) == (360//(180-angle)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for t in range(int(input())):\r\n a = int(input())\r\n n = 3\r\n found = False\r\n if a>=60:\r\n while a*n >180*(n-2):\r\n n+=1\r\n if a*n == 180*(n-2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "list=[]\r\nfor i in range(1,1000):\r\n a = 180 - 360/(i+2)\r\n if 360 % (i+2) == 0:\r\n list.append(a) \r\nn = int(input())\r\nfor j in range(n):\r\n x = int(input())\r\n if x in list:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "\r\n\r\npols = []\r\n\r\nfor i in range(3, 1000):\r\n\tans = ((i-2) * 180) / i\r\n\tif int(ans * 10) % 10 == 0 and int(ans*100)%10 == 0 and int(ans*1000)%10 == 0:\r\n\t\tpols.append(int(ans))\r\n\r\n#print(pols)\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n\ta = int(input())\r\n\t\r\n\tif a in pols:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\n", "t=int(input())\r\nfor i in range(1,t+1):\r\n a=int(input())\r\n n=360/(180-a)\r\n if n==int(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nb=[]\r\nk=1\r\nwhile 1<=k<361:\r\n k=k+1\r\n a=180-360/k\r\n if a==int(a):\r\n b.append(a)\r\nwhile n >0:\r\n n=n-1\r\n m=int(input())\r\n if m in b:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n ", "n=int(input())\r\nfor _ in range(n):\r\n a=int(input())\r\n if a==180:\r\n print('NO')\r\n else:\r\n k=360/(180-a)\r\n print('YES') if int(k)==k and k>0 else print('NO')", "#yousef\r\nfrom sys import stdin ,stdout \r\ninput=stdin.readline \r\ninp = lambda : map(int,input().split())\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\nfor i in range(int(input())):\r\n a=int(input())\r\n if 360%(180-a)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\npossible_angles = {120: 0, 90: 0, 72: 0, 60: 0, 45: 0, 40: 0,\r\n 36: 0, 30: 0, 24: 0, 20: 0, 18: 0, 15: 0,\r\n 12: 0, 10: 0, 9: 0, 8: 0, 6: 0, 5: 0,\r\n 4: 0, 3: 0, 2: 0, 1: 0}\r\nfor i in range(0, t):\r\n angle = int(input())\r\n if (180 - angle) in possible_angles:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n# 化院荆屹然 2300011884\r\n", "import math\r\nfor _ in range(int(input())):\r\n s=int(input())\r\n k=math.ceil(360/(180-s))\r\n l=math.floor(360/(180-s))\r\n if k!=l:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "\"\"\"\r\nCreated on Oct.10 2023\r\n@author: 施广熠 2300012143\r\n\"\"\"\r\nn=int(input())\r\nfor i in range(n):\r\n t=int(input())\r\n for i in range(3,361):\r\n if 360%i!=0:\r\n continue\r\n else:\r\n if 180-360//i==t:\r\n print(\"YES\")\r\n break\r\n if i==360:\r\n print(\"NO\")", "\r\nn = int(input())\r\n\r\ndef is_polygon(a):\r\n n = 360 / (180 - a)\r\n x = str(n)\r\n if x[-1] == \"0\":\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\n\r\nfor i in range(0, n): \r\n a = int(input())\r\n print(is_polygon(a))\r\n", "n=int(input())\r\ndef myfuc(t):\r\n if 360%(180-t) ==0 and t >=60:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n return\r\nfor _ in range(n):\r\n myfuc(int(input()))", "for _ in range(int(input())):\n print('YES' if 360 % (180 - (int(input()))) == 0 else 'NO')\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 11 16:51:30 2022\r\n\r\n@author: 帝落梦魂\r\n\"\"\"\r\n\r\nt = int(input())\r\nfor i in range(0,t):\r\n a = int(input())\r\n if 360%(180-a)==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "answer = []\r\ntest = []\r\ntests = int(input())\r\nfor i in range(tests):\r\n a = int(input())\r\n test.append(a)\r\nfix = []\r\nfor i in range(len(test)):\r\n fix.append(test[i])\r\n test[i] -= 180\r\n test[i] = 360 / test[i]\r\n if test[i]%1 == 0 and fix[i] >= 60:\r\n answer.append(\"YES\")\r\n else:\r\n answer.append(\"NO\")\r\nfor i in range(len(answer)):\r\n print(answer[i])", "n=int(input())\r\nfor i in range(n):\r\n m=int(input())\r\n x=180-m\r\n a=360/x\r\n if(int(a)==a):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def calculate_side(angle):\r\n side = 360/(180-angle)\r\n return side\r\nt = int(input())\r\nfor i in range(t):\r\n a = 0\r\n angle = int(input())\r\n if(calculate_side(angle).is_integer()):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nwhile (t > 0):\r\n a = int(input())\r\n if (360 % (180 - a) == 0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n t = t - 1", "n=int(input())\nans=[]\nfor i in range(n):\n m=int(input())\n if 360%(180-m)!=0:\n ans.append(\"NO\")\n else:\n ans.append(\"YES\")\nfor i in ans:\n print(i)", "n = int(input())\r\nfor _ in range(n):\r\n a = int(input())\r\n exterior = 180 - a\r\n if exterior <= 0 or 360 % exterior != 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n if (360/(180-a))%1==0 and (360/(180-a))>=3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def main():\r\n tc = int(input())\r\n for _ in range(tc):\r\n a = int(input())\r\n if a == 180:\r\n print(\"NO\")\r\n elif 360 % (180 - a) > 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "angle=[]\r\nfor i in range(1,361):\r\n if 360%i==0:\r\n angle.append((i-2)*180/i)\r\nn=int(input())\r\nfor i in range(n):\r\n if int(input()) in angle:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n=int(input())\r\nfor i in range(n):\r\n a=int(input())\r\n if float(360//(180-a)) == float(360/(180-a)) :\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n x = int(input())\r\n tmp = 360/(180-x)\r\n if tmp == int(tmp):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\nfor _ in range(n):\r\n angle = int(input())\r\n num = 0\r\n for i in range(1,int(2/(1-angle/180))+2):\r\n if 180 * (i - 2) == angle * i:\r\n print('YES')\r\n num += 1\r\n break\r\n if num == 0:\r\n print('NO')\r\n#compiled by 陈睿阳 2300011406", "t=input()\r\nwhile True:\r\n try:\r\n a=int(input())\r\n b=360/(180-a)\r\n if b==int(b) and b>2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n except EOFError:\r\n break", "t=int(input())\r\ns=[]\r\nfor i in range(t):\r\n a=int(input())\r\n s.append(a)\r\nfor i in range(len(s)):\r\n if 360%(180-s[i])==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# Link: https://codeforces.com/contest/270/problem/A\n\nnumber_of_tests = int(input())\n\nfor _ in range(number_of_tests):\n internal_angle = int(input())\n external_angle = 180 - internal_angle\n number_of_angles = 360 / external_angle\n \n print(\"YES\" if number_of_angles == int(number_of_angles) else \"NO\") ", "for _ in range(int(input())):\r\n t=360%(180-int(input()))==0\r\n print(\"YES\"*t+\"NO\"*(1-t))\r\n", "angleList=[]\r\nfor i in range(3,361):\r\n if 360%i==0:\r\n angleList.append(int(180-360/i))\r\n\r\nfenceSum=int(input())\r\nfor i in range(fenceSum):\r\n angle=int(input())\r\n print(\"YES\" if angle in angleList else \"NO\")", "n=int(input())\r\nfor i in range(n):\r\n alpha=int(input())\r\n number=360/(180-alpha)\r\n if number % 1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\r\nimport bisect\r\n \r\n \r\ndef sol():\r\n _=int(input())\r\n for aditya in range(_):\r\n i=int(input())\r\n if i==180:\r\n print(\"NO\")\r\n continue\r\n pans=360/(180-i)\r\n \r\n if pans==int(pans) and int(pans)>2:\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\nsol()\r\n", "\r\n\r\ndef solve():\r\n angle = int(input())\r\n ans = 360 / (180 - angle)\r\n return ans == (360 // (180 - angle))\r\n\r\ndef main():\r\n t = int(input())\r\n for _ in range(t):\r\n ret = solve()\r\n ans = \"YES\" if ret else \"NO\"\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()", "import sys\r\n\r\ndef read_chars():\r\n return list(sys.stdin.readline().split())\r\n\r\ndef read_inline_ints():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\ndef read_multiline_ints():\r\n return list(map(int, sys.stdin.readlines()))\r\n\r\n# solution code below\r\n\r\nt, *angles = read_multiline_ints()\r\n\r\n# inner angle of a regular polygon of n sides is \r\n# 180 * (n - 2) / n = 180 - 360 / n (n >= 3)\r\n\r\nyes, no = \"YES\", \"NO\"\r\nfor a in angles:\r\n if 360 % (180 - a) == 0:\r\n print(yes)\r\n else:\r\n print(no)", "for _ in range(int(input())):\r\n angel = int(input())\r\n if 360 % (180 - angel) == 0:\r\n print('YES')\r\n else:\r\n print(\"NO\")\r\n", "\r\n\r\n\r\ndef fancy_fence():\r\n \r\n num_test_cases =int(input())\r\n\r\n\r\n for _ in range(num_test_cases):\r\n\r\n angle = int(input())\r\n\r\n \r\n n = 180 - angle\r\n print('YES' if 360 % n == 0 else 'NO')\r\n\r\n\r\nfancy_fence()\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 29 14:04:37 2021\r\n\r\n@author: wlt52\r\n\"\"\"\r\n\r\n\r\na = int(input())\r\nz = []\r\n\r\nfor j in range(a):\r\n b = int(input())\r\n \r\n i = 3\r\n while 1:\r\n angle = 180*(i-2)/i\r\n if b == angle:\r\n z.append('YES')\r\n break\r\n elif angle > b:\r\n z.append('NO')\r\n break\r\n i += 1\r\n\r\nfor x in z:\r\n print(x)", "\r\nt = int(input())\r\nfor _ in range(t):\r\n indAngle = int(input())\r\n n = 3\r\n result = \"NO\"\r\n while(True):\r\n totalSum = (n - 2) * 180\r\n if totalSum / n == indAngle:\r\n result = \"YES\"\r\n break\r\n elif totalSum > indAngle * n:\r\n break\r\n n += 1\r\n print(result)\r\n", "angelList=[]\r\nfor i in range(3,361):\r\n if 360%i==0:\r\n angelList.append(int(180-360/i))\r\n\r\nfenceSum=int(input())\r\nfor i in range(fenceSum):\r\n angel=int(input())\r\n if angel in angelList:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a = []\r\nfor n in range(3, 3000):\r\n q = ((n - 2) * 180) / n\r\n if q not in a:\r\n a.append(q)\r\nn = int(input())\r\nfor i in range(n):\r\n if int(input()) in a:\r\n print('YES')\r\n else:\r\n print('NO')", "'''input\r\n3\r\n30\r\n60\r\n90\r\n'''\r\nangles = [60, 90, 108, 120, 135, 140, 144, 150, 156, 160, 162, 165, 168, 170, 171, 172, 174, 175, 176, 177, 178, 179]\r\nn = int(input())\r\nfor _ in range(n):\r\n\tangle = int(input())\r\n\tif angle in angles:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "h=int(input())\r\nwhile h:\r\n h-=1\r\n x=int(input())\r\n N=2*(1/((180-x)/180))\r\n print(\"YES\" if N==int(N) else \"NO\")", "for _ in range(int(input())):\r\n n = int(input())\r\n x = 360/(180 - n) \r\n if str(x)[-1] == '0':\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "k = int(input())\nfor _ in range(0, k):\n a = int(input())\n if (360 % (180 - a) == 0):\n print(\"YES\")\n else:\n print(\"NO\")\n\n\t \t \t\t \t\t\t\t\t\t\t\t \t \t\t", "angle=[]\r\nfor i in range(3,361):\r\n if 360%i==0:\r\n angle.append(180-360//i) \r\nt=int(input())\r\nfor ii in range(t):\r\n a=int(input())\r\n if a in angle:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n", "q = int(input())\r\n\r\nwhile q:\r\n q -= 1\r\n a = int(input())\r\n print('NO' if 360 % (180-a) else 'YES')\r\n", "n = int(input())\r\nfor _ in range(n):\r\n a = int(input())\r\n if a < 60 or a >= 180:\r\n print('NO')\r\n else:\r\n print(['NO', 'YES'][360 % (180 - a) == 0])", "ls = []\r\nfor i in range(1000):\r\n t = 180 * i\r\n tm = 180 * i // (i+2)\r\n if 180 *i % (i+2) == 0:\r\n ls.append(tm)\r\n if tm == 179:\r\n break\r\n\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n print(\"YES\" if n in ls[1:] else \"NO\")", "for _ in range(int(input())): print([\"YES\",\"NO\"][360 % (180-int(input()))!=0])\r\n\r\n \r\n", "for i in range(int(input())):\r\n a = int(input())\r\n\r\n n = 360/(180 - a)\r\n\r\n print('YES' if int(n) == n else 'NO')", "def can_build_fence(a):\r\n if 360 % (180 - a) == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nt = int(input(\"\"))\r\nfor _ in range(t):\r\n a = int(input(\"\"))\r\n result = can_build_fence(a)\r\n print(result)", "n = int(input())\r\nfor i in range(1, n + 1):\r\n x=int(input())\r\n if 360%(180-x)==0:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\n\r\nfor i in range(t):\r\n angle = int(input())\r\n \r\n sides = 360/(180-angle)\r\n \r\n if sides - int(sides) == 0: \r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\npossible_degrees = [60,90,108,120,135,140,144,150,156,160,162,165,168,170,171,172,174,175,176,177,178,179]\r\nwhile t > 0:\r\n\tdegree = int(input())\r\n\tif degree in possible_degrees:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\tt = t - 1\r\n\t", "from sys import stdin\r\n\r\n\r\ndef readint():\r\n return int(stdin.readline())\r\n\r\n\r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readmatrix(n):\r\n M = []\r\n for _ in range(n):\r\n row = readarray(int)\r\n assert len(row) == n\r\n M.append(row)\r\n return M\r\n\r\n\r\ndef solve():\r\n angle = readint()\r\n if 360 % (180 - angle) == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n T = readint()\r\n for _ in range(T):\r\n solve()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 6 20:35:04 2021\r\n\r\n@author: pena\r\n\"\"\"\r\n\r\nt = int(input())\r\n\r\nfor i in range(t):\r\n angle = int(input())\r\n if ((-360)/(angle-180))%1 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# Fancy Fence Difficulty:1100\r\nt = int(input())\r\nlst = []\r\nfor i in range(t):\r\n a = int(input())\r\n lst.append(a)\r\nfor j in range(t):\r\n a = lst[j]\r\n n = 2/(1-a/180)\r\n if abs(n-round(n)) < 0.000001:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nfor i in range (n):\r\n m=int(input())\r\n if (360%(180-m)==0):\r\n print('YES')\r\n else:\r\n print('NO')", "for s in [*open(0)][1:]:\n a = int(s)\n if 360%(180-a) == 0:\n print(\"YES\")\n else:\n print(\"NO\")", "t = int(input())\nwhile(t):\n angle = int(input())\n if (360 / (180 - angle)) % 1 == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n t -= 1", "def main():\n \n for _ in range (int(input())):\n \n n = 360 / (180 - int(input()))\n if n == int(n):\n print(\"YES\")\n else:\n print(\"NO\")\n \nif __name__ == '__main__':\n main()\n \t \t \t\t\t\t\t \t \t \t \t\t\t", "\r\nb = []\r\nfor i in range(3,10000):\r\n a = ((i-2)*180)/i\r\n a = round(a,2)\r\n b.append(a)\r\ny = int(input())\r\nfor i in range(y):\r\n z = float(input())\r\n if z in b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nfor _ in range(int(input())):\r\n angle = int(input())\r\n if angle >= 60 and 360 % (180 - angle) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "t=int(input())\r\nlst=[178,179]\r\nfor j in range(3,180):\r\n x=(180*(j-2)/j)\r\n if x==int(x):\r\n lst.append(int(x))\r\nfor i in range(t):\r\n a=int(input())\r\n if a in lst:\r\n print('YES')\r\n else:\r\n print('NO')", "import math\r\nn=int(input())\r\nseq=[]\r\nfor i in range(n):\r\n seq.append(int(input()))\r\nfor i in seq:\r\n print(\"YES\") if math.isclose(360/(180-i), round(360/(180-i)),abs_tol=0.001) else print(\"NO\")", "\r\nimport sys\r\nimport pprint\r\nimport logging\r\nfrom logging import getLogger\r\n\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\nlogging.basicConfig(format=\"%(message)s\", level=logging.WARNING,)\r\nlogger = getLogger(__name__)\r\nlogger.setLevel(logging.INFO)\r\n\r\n\r\ndef debug(msg, *args):\r\n logger.info(f'{msg}={pprint.pformat(args)}')\r\n\r\n# 30 MINUTES ATLEAST !!!!\r\n\r\n###################################################################################################################\r\n\r\n# let's do this by recursion\r\n\r\n\r\ndef printPattern(t, n):\r\n if t == n + 1:\r\n return\r\n\r\n for i in range(n - t):\r\n print(' ', end=' ')\r\n\r\n for i in range(t + 1):\r\n print(i, end=' ')\r\n\r\n for i in range(t - 1, 0, -1):\r\n print(i, end=' ')\r\n\r\n print(0)\r\n\r\n printPattern(t + 1, n)\r\n\r\n if t == n:\r\n return\r\n for i in range(n - t):\r\n print(' ', end=' ')\r\n\r\n for i in range(t + 1):\r\n print(i, end=' ')\r\n\r\n for i in range(t - 1, 0, -1):\r\n print(i, end=' ')\r\n\r\n print(0)\r\n\r\n\r\ndef single():\r\n return map(int, input().split())\r\n\r\n\r\ndef t():\r\n for _ in range(int(input())):\r\n print('YES' if 360 % (180 - int(input())) == 0 else 'NO')\r\n\r\n\r\nt()\r\n", "# Link: https://codeforces.com/contest/270/problem/A\n\nnumber_of_tests = int(input())\n\nfor _ in range(number_of_tests):\n internal_angle = int(input())\n external_angle = 180 - internal_angle\n number_of_angles = 360 / external_angle\n \n if number_of_angles.is_integer():\n print(\"YES\")\n else:\n print(\"NO\")\n \n pass", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\ns=set()\r\nfor i in range(175,181):\r\n\ts.add(i)\r\nc=3\r\nn=1\r\ncnt=0\r\nwhile True:\r\n\tans=(180*(n))/c\r\n\tif ans<=174:\r\n\t\tif ans==int(ans):\r\n\t\t\ts.add(ans)\r\n\telse:\r\n\t\tbreak\r\n\tn+=1\r\n\tc+=1\r\nfor i in range(int(input())):\r\n\tq=int(input())\r\n\tif q in s:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "for _ in range(int(input())):\r\n a=int(input())\r\n c=a\r\n b=180\r\n book=0\r\n for i in range(a,0,-1):\r\n if a%i==0 and b%i==0:\r\n a//=i\r\n b//=i\r\n for i in range(1,c):\r\n if a*i==(b*i-2):\r\n book=1\r\n print(\"YES\")\r\n break\r\n if book==0:\r\n print(\"NO\")", "def solve(a):\r\n if a < 60:\r\n return \"NO\"\r\n if 360 % (180 - a) == 0:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\n\r\ndef main():\r\n t = int(input())\r\n for i in range(t):\r\n a = int(input())\r\n print(solve(a))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n m=int(input())\r\n num1=360/(180-m)\r\n num2=360//(180-m)\r\n if num1==num2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n", "for _ in range(int(input())):\n print(\"NO\" if 360 % (180 - int(input())) else \"YES\")\n", "t = int(input())\r\n\r\ndef factors():\r\n possibleofn = {}\r\n for i in range(3,181):\r\n if 180*(i-2)/i % 1 == 0:\r\n possibleofn[i] = int(180*(i-2)/i)\r\n possibleofn[360] = 179\r\n return possibleofn\r\n\r\nfor i in range(t):\r\n angle = int(input())\r\n if angle not in factors().values():\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "for _ in range(int(input())):\r\n n = int(input())\r\n print(['NO', 'YES'][(360/(180-n)).is_integer() and n<180])", "for _ in range(int(input())):\r\n a = int(input()) # exterior angle\r\n interor_angle = 180 - a\r\n if 360 % interor_angle == 0 and 360 // interor_angle >= 3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "t = int(input())\r\nfor _ in range(0,t):\r\n\ta = int(input())\r\n\r\n\tsides = 360/(180 - a)\r\n\r\n\tif sides == int(sides):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 13 13:41:09 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n ans = False\r\n for n in range(3,361):\r\n if 360 % n == 0 and a == 180 - 360 // n:\r\n ans = True\r\n break\r\n if ans: print(\"YES\")\r\n else: print(\"NO\")", "k = 3\r\nvalid = []\r\nfor i in range(1, 1000):\r\n x = i * 180\r\n if x / k == x // k:\r\n valid.append(x//k)\r\n k += 1\r\n\r\nfor i in range(int(input())):\r\n if int(input()) in valid:\r\n print('YES')\r\n else:\r\n print('NO')", "for _ in range(int(input())):\r\n a = int(input())\r\n ans = 360 / (180 - a)\r\n if ans == int(ans):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nfor i in range(t):\r\n a = int(input())\r\n \r\n if a>=180:\r\n print(\"NO\")\r\n continue;\r\n n = 360/(180-a)\r\n \r\n if n%int(n)==0 and a<180 :\r\n print(\"YES\")\r\n continue;\r\n else:\r\n print(\"NO\")\r\n continue;\r\n \r\n ", "a=int(input())\r\nlist=[]\r\nwhile a!=0:\r\n b=int(input())\r\n if 360%(180-b)!=0:\r\n list.append(\"NO\")\r\n else:\r\n list.append(\"YES\")\r\n a=a-1\r\nfor i in list:\r\n print(i)", "turn = int(input())\r\nexample = [180*(n-2)/n for n in range(3, 361)]\r\n\r\nfor i in range(turn):\r\n a = int(input())\r\n if a in example:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "'''\r\n2300015897\r\n吴杰稀\r\n光华管理学院\r\n'''\r\ncases = int(input())\r\nfor i in range(cases):\r\n angle = int(input())\r\n t = 180 - angle\r\n if 360 % t == 0 and 360 // t >= 3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "for _ in range(int(input())):\n a = int(input())\n print(\"YES\") if 360%(180-a)==0 else print(\"NO\")", "def solve():\r\n a = int(input())\r\n return 360 % (180 - a) == 0 and 360 // (180 - a) >= 3\r\n\r\nfor _ in range(int(input())):\r\n print(\"YES\" if solve() else \"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 7 00:54:05 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nt=int(input())\r\nres=[]\r\nfor i in range(t):\r\n a=int(input())\r\n x=360/(180-a)\r\n if x==int(x):\r\n res.append(\"YES\")\r\n else:\r\n res.append(\"NO\")\r\n \r\n[print(r) for r in res]\r\n ", "def polycheck(n):\r\n if n==180:\r\n return False\r\n if 360/(180-n)==int(360/(180-n)):\r\n return True\r\n return False\r\nn=int(input())\r\nresult=[]\r\nfor i in range(n):\r\n x=int(input())\r\n if polycheck(x):\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\nfor res in result:\r\n print(res)", "n = int(input())\r\nans = n * [0]\r\nfor i in range(n):\r\n m = int(input())\r\n if (360 % (180 - m) == 0):\r\n ans[i] = 1\r\n else:\r\n continue\r\nfor i in range(n):\r\n if ans[i] == 1:\r\n print('YES')\r\n else:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 18 16:00:10 2022\r\n\r\n@author: hp\r\n\"\"\"\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n x = int(input())\r\n if 360 % (180 - x) == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "t = int(input())\r\nwhile t>0:\r\n n= int(input())\r\n check = False\r\n for i in range(3, 361):\r\n if n*i == (i-2)*180:\r\n print(\"YES\")\r\n check = True\r\n break\r\n if check == False:\r\n print(\"NO\")\r\n t-=1", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n if a>=30 and a<180:\r\n thet = 180-a\r\n if 360%thet==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 16 15:30:39 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\nt=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n n=360//(180-a)\r\n if a*n==(n-2)*180:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\nfor i in range(t):\r\n def angle(a):\r\n if 360%(180-a)==0:\r\n return'YES'\r\n else:\r\n return'NO'\r\n a = int(input())\r\n print(angle(a))", "def main() -> None:\r\n n = int(input())\r\n\r\n for _ in range(n):\r\n t = int(input())\r\n\r\n n = 360 / (180 - t)\r\n print(\"YES\" if n.is_integer() else \"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def FindAngle(s):\r\n return ((s - 2) * 180) / s\r\nt = int(input())\r\nfor i in range(t):\r\n angle = int(input())\r\n sides = 3\r\n while FindAngle(sides) < angle:\r\n sides += 1\r\n print(\"YES\" if FindAngle(sides) == angle else \"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Oct 14 18:41:22 2023\r\n\r\n@author: HXY\r\n\"\"\"\r\n\r\nt = int(input()) \r\n\r\nfor _ in range(t):\r\n a = int(input()) \r\n\r\n n = 360 // (180 - a) \r\n\r\n if n >= 3 and 360 % (180 - a) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = int(input())\r\nfor _ in range(t):\r\n\tn = int(input())\r\n\tprint('NO' if 360%(180-n) else 'YES')", "import math\nn = int(input())\nangs= []\n\nfor i in range(n):\n angs.append(int(input()))\n\n\nfor ang in angs:\n print('YES') if 360%(180-ang) ==0 else print('NO')\n", "a=int(input());fo=[]\r\nfor i in range(a):\r\n b=int(input())\r\n c=360//(180-b)\r\n if c*(180-b) == 360:\r\n fo.append('YES')\r\n else:\r\n fo.append('NO')\r\nprint('\\n'.join(fo))", "num_tests = int(input())\r\nfor i in range(num_tests):\r\n angle = 180-int(input())\r\n if angle <= 120 and angle > 0 and 360%angle==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\nfor _ in range(n):\r\n print('NO' if 360 % (180-int(input())) else 'YES')", "import math\r\nT = int(input())\r\nfor i in range(T):\r\n num = int(input())\r\n num = 180 - num\r\n if 360 % num == 0:\r\n print(\"YES\", end = '\\n')\r\n else:\r\n print(\"NO\", end = '\\n')", "t = int(input())\nfor _ in range(t):\n angle = int(input())\n sides = 3\n sol = 'NO'\n while (sides-2)*180 / sides <=angle :\n if (sides-2) *180/ sides == angle :\n sol = 'YES'\n break\n sides +=1\n print(sol)\n", "def solve():\r\n a = int(input())\r\n for n in range(2, 1000):\r\n if 180 * (n - 2) == a * n:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n solve()\r\n", "for i in range(int(input())):\r\n print(\"YNEOS\"[(360 % (180- int(input())) != 0)::2])", "for i in range(int(input())):\r\n print((\"YES\",\"NO\")[360/(180-int(input()))*10%10>0])", "n = int(input())\r\n\r\nfor _ in range(n):\r\n a = int(input())\r\n if a >= 180:\r\n print('NO')\r\n continue\r\n sides = 360/(180-a)\r\n if sides == int(sides):\r\n print('YES')\r\n else:\r\n print('NO')", "if __name__ == \"__main__\":\r\n n = int(input())\r\n\r\n for x in range(n):\r\n print(\"YNEOS\"[360 % (180 - int(input())) > 0::2])\r\n", "i = int(input())\r\nfor j in range(i):\r\n t = int(input())\r\n n = 360.0/(180.0-t)\r\n if n == int(n) and n>=3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nfor i in range(n):\r\n an=int(input())\r\n n=(2*180)/(180-an)\r\n if n%1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# Compiled by Zhou Tian 2300011538 from School of Physics PKU\r\n\r\na = int(input())\r\nc = []\r\n\r\nfor i in range(a):\r\n b = 180-int(input())\r\n if 360 % b == 0:\r\n c.append('YES')\r\n else:\r\n c.append('NO')\r\n \r\nfor i in c:\r\n print(i)", "t = int(input())\r\n\r\nfor _ in range(t):\r\n a = int(input())\r\n ans = 'YES' if 360%(180-a)==0 else 'NO'\r\n print(ans)", "t=int(input())\r\nwhile t>0:\r\n n=int(input())\r\n if 360%(180-n)==0:print('YES')\r\n else:print('NO')\r\n t-=1", "for _ in range(int(input())):\r\n a = int(input())\r\n i = 3\r\n ans = False\r\n a_i = (i - 2) * 180 / i\r\n while a_i <= a + 1:\r\n if a_i == a:\r\n ans = True\r\n break\r\n else:\r\n i += 1\r\n a_i = (i - 2) * 180 / i\r\n if ans == True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n ", "from sys import stdin\n\nstream = None\ntry:\n stream = open('file.txt', 'r')\nexcept:\n stream = stdin\n\nn = int(stream.readline())\n\n\ndef angle_number(angle):\n number = 360 / (180 - angle)\n return int(number) == number\n\n\nfor i in range(n):\n angle = int(stream.readline())\n if angle_number(angle):\n print(\"YES\")\n else:\n print(\"NO\")\n", "t=int(input())\r\nwhile t:\r\n t-=1\r\n a=int(input())\r\n if (360/(180-a))%1==0:print(\"YES\")\r\n else:print(\"NO\")", "t = int(input())\r\nwhile t:\r\n t -= 1\r\n a = float(input())\r\n for n in range(3, 10000):\r\n d = (n-2) * 180 / n\r\n if d >= a:\r\n print('YES' if d==a else 'NO')\r\n break", "n = int(input())\r\narray = [0] * n\r\nfor i in range(n):\r\n array[i] = int(input())\r\n if array[i] == 180:\r\n print(\"NO\")\r\n continue\r\n if -360/(array[i] - 180) == int(-360/(array[i] - 180)):\r\n print(\"YES\")\r\n continue\r\n else:\r\n print(\"NO\")", "n = int(input())\nfor _ in range(n):\n a = int(input())\n a = 180 - a\n print([\"NO\",\"YES\"][360//a == 360/a])\n", "def main():\n n = int(input())\n\n regular_polygon = [180 * (i - 2) / i for i in range(3, 1000)]\n\n for _ in range(n):\n angle = int(input())\n if angle in regular_polygon:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n main()\n", "t = int(input())\nans = []\nret = 0\nfor i in range(t):\n a = int(input())\n if 360 % (180 - a) == 0:\n ans.append(\"YES\")\n else:\n ans.append(\"NO\")\nfor i in ans:\n print(i)\n\n", "times=int(input())\nfor i in range(times):\n n=int(input())\n m=360/(180-n)\n while m>1:\n m-=1\n if abs(m-1)<10**(-7):\n print(\"YES\")\n else:\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 24 20:34:24 2023\r\n\r\n@author: zinc 2300012115\r\n\"\"\"\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n alpha = int(input())\r\n if 360%(180-alpha) == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "ln = int(input())\r\n\r\n\r\nfor i in range(ln):\r\n z=int(input())\r\n n = 360/(180-z)\r\n if n%1 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "t = int(input())\r\nresult = ''\r\nfor test in range(t):\r\n a = int(input())\r\n for n in range(3, 361):\r\n if a/180 == (n-2)/n:\r\n result += \"YES\"+ \" \"\r\n break\r\n else:\r\n result += \"NO\" + \" \"\r\nresult = result.split(\" \")\r\nfor i in result:\r\n print(i)", "t=int(input())\r\nwhile t!=0:\r\n x=int(input())\r\n m=180-x\r\n if m>0:\r\n if 360%m == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n t=t-1\r\n\r\n", "for _ in range(int(input())):print(\"NO\"if 360%(180-int(input()))else\"YES\")", "def fancy_fence() -> None:\n t = int(input())\n while t:\n a = int(input())\n print(isImpossible(a))\n t -= 1\n\n\ndef isImpossible(a: int) -> str:\n def formula(a): return 360 % (180-a) == 0\n if(formula(a)):\n return 'YES'\n else:\n return 'NO'\n\n\nfancy_fence()\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Oct 15 21:58:41 2023\r\n\r\n@author: 程卓 2300011733\r\n\"\"\"\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n angle = int(input())\r\n if 360 % (180-angle) == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "x = int(input())\r\nz = []\r\nfor i in range(x):\r\n y = int(input())\r\n z.append(y)\r\nfor j in z:\r\n if 360%(180-j) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a=[60,90, 108, 120,135, 140, 144, 150, 156, 160, 162, 165, 168, 170, 171, 172, 174, 175, 176, 177, 178, 179]\r\nn=int(input())\r\nfor i in range(n):\r\n b=int(input())\r\n if b in a:\r\n print('YES')\r\n else:print('NO')", "n=int(input())\r\nm=0\r\nwhile m<n:\r\n x=int(input())\r\n k=360/(180-x)\r\n alpha=int(k)-k\r\n if alpha==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n m+=1", "from bisect import bisect_right, bisect_left\r\nfrom math import inf, gcd, sqrt, ceil, log2\r\nfrom heapq import heappush, heappop\r\nfrom collections import defaultdict, Counter, deque\r\nfrom itertools import accumulate\r\nfrom functools import lru_cache\r\nfrom string import ascii_lowercase\r\nrvar = lambda: map(int, input().split())\r\nrarr = lambda: list(map(int, input().split()))\r\nrstr = lambda: input().strip()\r\nrint = lambda: int(input())\r\n\r\n'''Speed up input'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nfor _ in range(rint()):\r\n a = rint()\r\n\r\n '''\r\n n * angle = 180 * (n - 2)\r\n n * angle = 180 * n - 360\r\n \r\n n * (180 - angle) = 360\r\n\r\n n = 360 / (180 - angle)\r\n \r\n \r\n '''\r\n\r\n if 360 % (180 - a) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n print(['YES','NO'][(2*a/(a-180))%1!=0])\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 25 17:53:50 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 67 - CF270-DIV2A\r\n\"\"\"\r\ncases = int(input())\r\nfor i in range(cases):\r\n angle = int(input())\r\n supp = 180-angle\r\n test = supp\r\n while test < 360:\r\n test += supp\r\n if test == 360:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n \r\n", "for _ in range(int(input())):\r\n\tif (360/(180-int(input()))).is_integer():\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\n", "t = int(input())\r\n\r\nfor x in range(0,t):\r\n a = 360/(180 - int(input()))\r\n if (a == int(a)) : print(\"YES\")\r\n else: print(\"NO\")", "for _ in range(int(input())):\r\n number = int(input())\r\n flag = True\r\n i = 3\r\n \r\n while flag:\r\n if ((i - 2) * 180) / i == number:\r\n print('YES')\r\n flag = False\r\n elif ((i - 2) * 180) / i > number:\r\n print('NO')\r\n flag = False\r\n i += 1", "n=int(input())\r\np=[]\r\nfor x in range(1,n+1):\r\n a=180-int(input())\r\n if 360%a==0:\r\n p.append(\"YES\")\r\n else:\r\n p.append(\"NO\")\r\nfor x in range(0,n):\r\n print(p[x])\r\n\r\n ", "n = int(input())\r\nfor i in range(n):\r\n a = int(input())\r\n b = 360 / (180 - a)\r\n if b % 1 == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "t=int(input())\r\nfor _ in range(t):\r\n rec=int(input())\r\n if 360%(180-rec)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n# (180-rec)*i==360\r\n# i=360/(180-rec)\r\n# ->\r\n# 360%(180-rec)==0", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n if n <60 or n > 180:\r\n print('NO')\r\n else:\r\n if 360/(180 - n) == 360 //(180-n):\r\n print('YES')\r\n else:\r\n print('NO')", "def solve():\r\n x = int(input())\r\n print('YES' if 360 % (180-x) == 0 else 'NO')\r\n\r\n\r\nt = int(input())\r\n# t = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "import sys\r\n\r\ndef is_polygon(theta: int) -> str:\r\n n: float = -360 / (theta - 180)\r\n if int(n) == n:\r\n return 'YES'\r\n return 'NO'\r\n\r\ndef main():\r\n read = sys.stdin.readline\r\n n = int(read())\r\n for x in range(n):\r\n theta = int(read())\r\n print(is_polygon(theta))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# Wadea #\r\n\r\nfor i in range(int(input())):\r\n n = int(input())\r\n if 360 % (180 - n):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "t = int(input())\r\nfor test in range(t):\r\n a = int(input())\r\n found = False\r\n for n in range(3, 361):\r\n if a/180 == (n-2)/n:\r\n found = True\r\n if found:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def check(n):\n\td=(360/(180-n))\n\tflag=0\n\tfor i in range(3,int(d)+1):\n\t\tif(i==d):\n\t\t\tflag=1\n\tif (flag==0):\n\t\treturn \"NO\"\n\telse:\n\t\treturn \"YES\"\nn=int(input())\nl=[]\nfor k in range(0,n):\n\ts=int(input())\n\tl.append(s)\nk=[]\t\nfor i in range(0,n):\n\tk.append(check(l[i]))\nfor t in k:\n\tprint(t)", "n1 = int(input())\r\nout = ''\r\nfor i1 in range(n1):\r\n n2 = int(input())\r\n for i in range(3, 1000):\r\n if i*n2 == (i - 2)*180:\r\n out = 'YES'\r\n break\r\n else:\r\n out = \"NO\"\r\n print(out)", "def fancy_fence(a: int) -> str:\n\n if (a < 60):\n return 'NO'\n\n if (360 % (180 - a) == 0):\n return 'YES'\n\n return 'NO'\n\nangles = []\nt = int(input())\n\nfor i in range(t):\n a = int(input())\n angles.append(a)\n\nfor i in range(t):\n print(fancy_fence(angles[i]))\n\n \t \t \t \t \t\t\t \t\t \t\t", "for i in range(int(input())):\r\n x= int( input())\r\n y=180-x\r\n if 360/y%1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t=int(input())\r\nfor i in range(t):\r\n a=int(input())\r\n b=360/(180-a)\r\n if b%1==0 and b>=3:\r\n print('YES')\r\n else:\r\n print('NO')", "t = int(input())\r\nfor j in range(t):\r\n a = int(input())\r\n b = False\r\n for i in range(3, 400):\r\n if (180 * i) - (a * i) - 360 == 0:\r\n b = True\r\n break\r\n else:\r\n continue\r\n print(\"YES\" if b else \"NO\")", "for i in range(int(input())):\r\n n=int(input())\r\n if n<60:\r\n print(\"NO\")\r\n else:\r\n if (360%(180-n))==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import sys\r\n\r\nn = int(input())\r\ncorners = sys.stdin.read().splitlines()\r\n\r\nfor i in range(n):\r\n a = int(corners[i])\r\n if 360 % (180 - a) > 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")# 1689883632.2007127", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n\tinp = int(input())\r\n\ts = 360/(180-inp)\r\n\tif(s/int(s)==1):\r\n\t\ta.append(\"YES\")\r\n\telse:\r\n\t\ta.append(\"NO\")\r\n\r\nfor i in range(n):\r\n\tprint(a[i])", "n = int(input())\r\ncount = 3\r\nfor i in range(0, n):\r\n x = int(input())\r\n if x < 60:\r\n print(\"NO\")\r\n else:\r\n while (x*count >= (count-2)*180):\r\n if (x*count == (count-2)*180):\r\n print(\"YES\")\r\n break\r\n count += 1\r\n else:\r\n print(\"NO\")\r\n count = 3", "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\nFILE=False\r\nif FILE:\r\n sys.stdin=open('input.txt','r')\r\n sys.stdout=open('output.txt','w')\r\n\r\nt=get_int()\r\nfor i in range(t):\r\n angle=get_int()\r\n sides=-2*180/(angle-180)\r\n if (sides-math.floor(sides)==0):\r\n sys.stdout.write(\"YES\\n\")\r\n else:\r\n sys.stdout.write(\"NO\\n\") \r\n\r\n#for item in answer:\r\n#\tsys.stdout.write(item)\r\n#\tsys.stdout.write('\\n')", "t = int(input())\r\nfor _ in range(t):\r\n v = int(input())\r\n m = 360/(180-v)\r\n if m == int(m):\r\n print('YES')\r\n else:\r\n print('NO') ", "test = int(input())\r\nfor _ in range(test):\r\n a = float(input())\r\n n = 2\r\n ans = \"NO\"\r\n while n > 0:\r\n angle = (180*n - 360)/n\r\n if a == angle:\r\n ans = \"YES\"\r\n break\r\n\r\n n += 1\r\n\r\n if angle > a:\r\n break\r\n\r\n print(ans)" ]

{"inputs": ["3\n30\n60\n90", "6\n1\n2\n3\n170\n179\n25"], "outputs": ["NO\nYES\nYES", "NO\nNO\nNO\nYES\nYES\nNO"]}

UNKNOWN

PYTHON3

CODEFORCES

625

8e719483e5e5418e54575f188ffb7458

Holes

Little Petya likes to play a lot. Most of all he likes to play a game «Holes». This is a game for one person with following rules: There are *N* holes located in a single row and numbered from left to right with numbers from 1 to *N*. Each hole has it's own power (hole number *i* has the power *a**i*). If you throw a ball into hole *i* it will immediately jump to hole *i*<=+<=*a**i*, then it will jump out of it and so on. If there is no hole with such number, the ball will just jump out of the row. On each of the *M* moves the player can perform one of two actions: - Set the power of the hole *a* to value *b*. - Throw a ball into the hole *a* and count the number of jumps of a ball before it jump out of the row and also write down the number of the hole from which it jumped out just before leaving the row. Petya is not good at math, so, as you have already guessed, you are to perform all computations. The first line contains two integers *N* and *M* (1<=≤<=*N*<=≤<=105, 1<=≤<=*M*<=≤<=105) — the number of holes in a row and the number of moves. The second line contains *N* positive integers not exceeding *N* — initial values of holes power. The following *M* lines describe moves made by Petya. Each of these line can be one of the two types: - 0 *a* *b* - 1 *a* For each move of the type 1 output two space-separated numbers on a separate line — the number of the last hole the ball visited before leaving the row and the number of jumps it made. Sample Input 8 5 1 1 1 1 1 2 8 2 1 1 0 1 3 1 1 0 3 4 1 2 Sample Output 8 7 8 5 7 3

[ "import sys\nn, m = map(int, sys.stdin.buffer.readline().strip().split())\nbs = 9\na = list(map(int, sys.stdin.buffer.readline().strip().split()))\nrn = [0] * n\nrc = [0] * n\ndef gn(i):\n ni = i + a[i]\n if ni >= n:\n rn[i], rc[i] = i, 0\n elif ni >> bs == i >> bs:\n rn[i], rc[i] = rn[ni], rc[ni] + 1\n else:\n rn[i], rc[i] = ni, 1\nfor i in range(n - 1, -1, -1):\n gn(i)\nfor _ in range(m):\n l = list(map(int, sys.stdin.buffer.readline().strip().split()))\n if l[0] == 0:\n p = l[1] - 1\n a[p] = l[2]\n for i in range(p, (p >> bs << bs) - 1, -1):\n gn(i)\n else:\n p = l[1] - 1\n c = 0\n while rn[p] != p:\n c += rc[p]\n p = rn[p]\n print(p + 1, c + 1)", "import sys\r\n\r\ninput = sys.stdin.readline\r\nn, m = map(int, input().split())\r\np = list(map(int, input().split()))\r\nsize = 320\r\nblock = [i // size for i in range(n)]\r\npar, cnt = [0] * n, [0] * n\r\nfor i in range(n - 1, -1, -1):\r\n setelah = i + p[i]\r\n if setelah >= n:\r\n par[i] = i + n\r\n cnt[i] = 1\r\n elif block[setelah] == block[i]:\r\n par[i] = par[setelah]\r\n cnt[i] = cnt[setelah] + 1\r\n else:\r\n par[i] = setelah\r\n cnt[i] = 1\r\nans = []\r\nfor _ in range(m):\r\n s = input().strip()\r\n if s[0] == '0':\r\n Z, a, b = s.split()\r\n a = int(a) - 1\r\n b = int(b)\r\n p[a] = b\r\n i = a\r\n while i >= 0 and block[i] == block[a]:\r\n setelah = i + p[i]\r\n if setelah >= n:\r\n par[i] = i + n\r\n cnt[i] = 1\r\n elif block[i] == block[setelah]:\r\n par[i] = par[setelah]\r\n cnt[i] = cnt[setelah] + 1\r\n else:\r\n par[i] = setelah\r\n cnt[i] = 1\r\n i -= 1\r\n else:\r\n Z, a = s.split()\r\n a = int(a) - 1\r\n now = 0\r\n while a < n:\r\n now += cnt[a]\r\n a = par[a]\r\n ans.append(str(a - n + 1) + ' ' + str(now))\r\nprint('\\n'.join(ans))\r\n" ]

{"inputs": ["8 5\n1 1 1 1 1 2 8 2\n1 1\n0 1 3\n1 1\n0 3 4\n1 2", "10 10\n5 1 2 4 1 7 3 8 10 8\n0 5 6\n1 8\n1 1\n0 10 3\n1 5\n1 3\n1 2\n0 6 1\n1 9\n1 1"], "outputs": ["8 7\n8 5\n7 3", "8 1\n6 2\n5 1\n5 2\n5 3\n9 1\n10 4"]}

UNKNOWN

PYTHON3

CODEFORCES

2

8e83fc290467bbae2f2bbd15052cee39

Long number

Consider the following grammar: - <expression> ::= <term> | <expression> '+' <term>- <term> ::= <number> | <number> '-' <number> | <number> '(' <expression> ')'- <number> ::= <pos_digit> | <number> <digit>- <digit> ::= '0' | <pos_digit>- <pos_digit> ::= '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9' This grammar describes a number in decimal system using the following rules: - <number> describes itself,- <number>-<number> (l-r, *l*<=≤<=*r*) describes integer which is concatenation of all integers from *l* to *r*, written without leading zeros. For example, 8-11 describes 891011,- <number>(<expression>) describes integer which is concatenation of <number> copies of integer described by <expression>,- <expression>+<term> describes integer which is concatenation of integers described by <expression> and <term>. For example, 2(2-4+1)+2(2(17)) describes the integer 2341234117171717. You are given an expression in the given grammar. Print the integer described by it modulo 109<=+<=7. The only line contains a non-empty string at most 105 characters long which is valid according to the given grammar. In particular, it means that in terms l-r *l*<=≤<=*r* holds. Print single integer — the number described by the expression modulo 109<=+<=7. Sample Input 8-11 2(2-4+1)+2(2(17)) 1234-5678 1+2+3+4-5+6+7-9 Sample Output 891011 100783079 745428774 123456789

[ "# a ^ (P-1) ≡ 1 (mod P)\n# a ^ k ≡ (a % P) ^ (k % (P-1)) (mod P)\n\nimport sys\n\nsys.setrecursionlimit(10**5)\n\nMOD = 10**9 + 7\n\n\ndef inv(x):\n return pow(x, MOD - 2, MOD)\n\n\nclass Number:\n def __init__(self, value, length):\n self.value = value % MOD\n self.length = length % (MOD - 1)\n\n def __add__(self, other):\n value = self.value * pow(10, other.length, MOD) + other.value\n length = self.length + other.length\n return Number(value, length)\n\n def __mul__(self, other):\n base = pow(10, self.length, MOD)\n if base == 1:\n value = self.value * other\n else:\n value = self.value * (pow(base, other, MOD) - 1) * inv(base - 1)\n return Number(value, self.length * other)\n\n @classmethod\n def _range(cls, a, r, rpow, length):\n base = pow(10, length, MOD)\n u = pow(base, rpow, MOD) - 1\n v = inv(base - 1)\n return cls((a * u + u * v - r) * v, length * rpow)\n\n @classmethod\n def range(cls, a, b):\n a, b, la, lb = int(a), int(b) + 1, len(a), len(b)\n if la == lb:\n return cls._range(a, b - a, b - a, la)\n term = cls._range(a, p[la] - a, q[la] - a, la)\n for i in range(la + 1, lb):\n term += cls._range(p[i - 1], p[i] - p[i - 1], q[i] - q[i - 1], i)\n term += cls._range(p[lb - 1], b - p[lb - 1], b - q[lb - 1], lb)\n return term\n\n\ndef parse_term(start, stop):\n if s[stop - 1] == \")\":\n left = s.index(\"(\", start)\n return parse_expression(left + 1, stop - 1) * int(s[start:left])\n\n try:\n sep = s.index(\"-\", start, stop)\n except ValueError:\n return Number(int(s[start:stop]), stop - start)\n\n return Number.range(s[start:sep], s[sep + 1 : stop])\n\n\ndef parse_expression(start, stop):\n expression = Number(0, 0)\n i = start\n while i < stop:\n if s[i] == \"+\":\n expression += parse_term(start, i)\n start = i + 1\n i = right[i] if s[i] == \"(\" else i + 1\n expression += parse_term(start, i)\n return expression\n\n\ns = input()\nn = len(s)\n\np = [1]\nfor _ in range(n):\n p.append(p[-1] * 10 % MOD)\nq = [1]\nfor _ in range(n):\n q.append(q[-1] * 10 % (MOD - 1))\n\nright = [None] * n\nstack = []\nfor i, x in enumerate(s):\n if x == \"(\":\n stack.append(i)\n elif x == \")\":\n right[stack.pop()] = i\n\nprint(parse_expression(0, n).value)\n" ]

{"inputs": ["8-11", "2(2-4+1)+2(2(17))", "1234-5678", "1+2+3+4-5+6+7-9", "598777", "49603501749575096738857", "11-57", "7177-57797", "4510812433666-7741104736713", "4778066503(27032-80044+16+51+58(9)+5668114736297420472+2336+6-117+8495(7265))", "9678329648012859556810940272201-70370609657815505164700664074744+28870231062776633852(2098997519485)", "52(6(1)+100000000(2-10))+777(40000000(7-20)+876543)", "1(1000000005(5)+4)", "1-1", "10-10", "1+2", "9", "1(1)+1(1)"], "outputs": ["891011", "100783079", "745428774", "123456789", "598777", "586922407", "486296559", "110843609", "665706430", "865860620", "219564419", "133241273", "1000000006", "1", "10", "12", "9", "11"]}

UNKNOWN

PYTHON3

CODEFORCES

1

8e884a3f9a82d8283675daa517424cea

Buying A House

Zane the wizard had never loved anyone before, until he fell in love with a girl, whose name remains unknown to us. The girl lives in house *m* of a village. There are *n* houses in that village, lining in a straight line from left to right: house 1, house 2, ..., house *n*. The village is also well-structured: house *i* and house *i*<=+<=1 (1<=≤<=*i*<=<<=*n*) are exactly 10 meters away. In this village, some houses are occupied, and some are not. Indeed, unoccupied houses can be purchased. You will be given *n* integers *a*1,<=*a*2,<=...,<=*a**n* that denote the availability and the prices of the houses. If house *i* is occupied, and therefore cannot be bought, then *a**i* equals 0. Otherwise, house *i* can be bought, and *a**i* represents the money required to buy it, in dollars. As Zane has only *k* dollars to spare, it becomes a challenge for him to choose the house to purchase, so that he could live as near as possible to his crush. Help Zane determine the minimum distance from his crush's house to some house he can afford, to help him succeed in his love. The first line contains three integers *n*, *m*, and *k* (2<=≤<=*n*<=≤<=100, 1<=≤<=*m*<=≤<=*n*, 1<=≤<=*k*<=≤<=100) — the number of houses in the village, the house where the girl lives, and the amount of money Zane has (in dollars), respectively. The second line contains *n* integers *a*1,<=*a*2,<=...,<=*a**n* (0<=≤<=*a**i*<=≤<=100) — denoting the availability and the prices of the houses. It is guaranteed that *a**m*<==<=0 and that it is possible to purchase some house with no more than *k* dollars. Print one integer — the minimum distance, in meters, from the house where the girl Zane likes lives to the house Zane can buy. Sample Input 5 1 20 0 27 32 21 19 7 3 50 62 0 0 0 99 33 22 10 5 100 1 0 1 0 0 0 0 0 1 1 Sample Output 403020

[ "n,k,d=map(int,input().split())\r\nk-=1\r\nz=list(map(int,input().split()))\r\ntable=[]\r\ni=0\r\nwhile(i<n):\r\n if(z[i]!=0 and z[i]<=d):\r\n table.append(abs(k-i)*10)\r\n i+=1\r\nprint(min(table))\r\n \r\n", "n,m,k=map(int,input().split())\r\nm-=1\r\nl=[int(x) for x in input().split()]\r\nq=[]\r\nfor i in range(n):\r\n if l[i]!=0 and l[i]<=k:\r\n q.append((abs(i-m))*10)\r\nprint(min(q))\r\n \r\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=a[:m-1]\r\nl=l[::-1]\r\nr=a[m:]\r\nind1=100000\r\nind2=100000\r\nif(m!=1):\r\n for i in range(0,len(l)):\r\n if(l[i]<=k and l[i]!=0):\r\n ind1=i\r\n ind1=len(l)-i-1\r\n break\r\nif(m!=n):\r\n for i in range(len(r)):\r\n if(r[i]!=0 and r[i]<=k):\r\n ind2=i+m\r\n #print(r[i])\r\n break\r\n#print(ind2)\r\nmini=min(abs(m-1-ind1),abs(m-1-ind2))\r\nprint(mini*10)", "__author__ = \"Daniel Mitre\"\n\nn, m, k = map(int, input().split())\nprices = map(int, input().split())\n\ndef dist_to_girl(pos: int) -> int:\n\treturn abs(pos - m)\n\nbuy = float('inf')\nfor idx, price in zip(range(1, n + 1), prices):\n\tif (price > 0) and (price <= k) and (dist_to_girl(idx) < dist_to_girl(buy)):\n\t\tbuy = idx\n\nprint(dist_to_girl(buy) * 10)\n\t\t\n \t\t \t \t\t \t\t \t\t\t\t \t\t \t \t\t", "n,m,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ncount=[]\r\nfor i in range(n):\r\n if(arr[i]!=0 and arr[i]<=k):\r\n count.append(abs(i-(m-1)))\r\nprint((min(count))*10)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn,m,k=map(int,input().split())\r\nm-=1\r\nl=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n):\r\n\tif l[i]<=k and l[i]!=0:\r\n\t\tc.append((abs(i-m))*10)\r\nprint(min(c))", "n, zane, money = map(int, input().split())\nhouses = [int(x) for x in input().split()]\n\n\n\ndef findHouseToBuy(n, zane, money):\n start = zane - 1\n end = zane - 1\n distance = 10\n \n while start > 0 and end < n - 1:\n start -= 1\n end += 1\n if houses[start] != 0 and houses[start] <= money or houses[end] != 0 and houses[end] <= money:\n return distance\n distance += 10\n\n while start > 0:\n start -= 1\n if houses[start] != 0 and houses[start] <= money:\n return distance\n distance += 10\n\n while end < n-1:\n end += 1\n if houses[end] != 0 and houses[end] <= money:\n return distance\n distance += 10\n\nprint(findHouseToBuy(n, zane, money))", "n, m, k = [int(i) for i in input().split()]\r\narr = [int(i) for i in input().split()]\r\nm -= 1\r\nres1 = 0\r\ntmp = 0\r\ni = m - 1\r\nwhile i >= 0:\r\n tmp += 1\r\n if arr[i] != 0 and arr[i] <= k:\r\n res1 = tmp\r\n break\r\n i -= 1\r\nres2 = 0\r\ni = m + 1\r\ntmp = 0\r\nwhile i <= len(arr) - 1:\r\n tmp += 1\r\n if arr[i] != 0 and arr[i] <= k:\r\n res2= tmp\r\n break\r\n i += 1\r\nif res1 == 0:\r\n res1 = 10000000\r\nif res2 == 0:\r\n res2 = 10000000\r\nprint((min(res1, res2)) * 10)\r\n", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nc = [] \r\nfor i in range(len(a)):\r\n if a[i]<=k and a[i]!=0:\r\n c.append(i)\r\np = []\r\nfor i in range(len(c)):\r\n p.append(abs(c[i]-m+1)*10)\r\nprint(min(p))", "string = input()\r\nnumbers = string.split(\" \")\r\na = int(numbers[0])\r\nb = int(numbers[1])\r\nc = int(numbers[2])\r\nstring = input()\r\nnumbers = string.split(\" \")\r\nfor x in range(a):\r\n numbers[x] = int(numbers[x])\r\nhouses = []\r\nfor x in range(a):\r\n y = numbers[x]\r\n if y != 0 and y <= c:\r\n houses.append(abs(x + 1 - b))\r\nprint(min(houses) * 10)", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.insert(0, 0)\r\nif m == 1:\r\n for i in range(m, len(a)):\r\n if (a[i] <= k) and (a[i] != 0):\r\n print((i - m) * 10)\r\n break\r\nelif m == n:\r\n for i in range(m, 0, -1):\r\n if (a[i] <= k) and (a[i] != 0):\r\n print((m - i) * 10)\r\n break\r\nelse:\r\n for i in range(m, len(a)):\r\n if (a[i] <= k) and (a[i] != 0):\r\n ans1 = (i - m) * 10\r\n break\r\n else:\r\n ans1 = float('inf')\r\n for i in range(m, 0, -1):\r\n if (a[i] <= k) and (a[i] != 0):\r\n ans2 = (m - i) * 10\r\n break\r\n else:\r\n ans2 = float('inf')\r\n print(min(ans1, ans2))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\na,b,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ni=b\r\nj=b-1\r\nyu=[]\r\n\r\nfor i in range(len(l)):\r\n\tif l[i]!=0 and l[i]<=c:\r\n\t\tyu.append(i)\r\nm=[]\r\nfor i in range(len(yu)):\r\n\tr=abs(b-yu[i]-1)\r\n\tm.append(r)\r\nprint(min(m)*10)\r\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=n\r\nfor i in range(n):\r\n if a[i]!=0 and a[i]<=k:\r\n c=abs(m - (i+1))\r\n if c<b:\r\n b = c\r\nprint(b * 10)", "def solution(l1,l2):\r\n n,m,k=l1[0],l1[1],l1[2]\r\n i=0\r\n while i<len(l2):\r\n if l2[i]>0 and l2[i]<=k:\r\n l2[i]=1\r\n else:\r\n l2[i]=0\r\n i+=1\r\n i=0\r\n d=[]\r\n #print(l2)\r\n while i<len(l2):\r\n if l2[i]>0: \r\n d.append(abs(m-1-i))\r\n i+=1\r\n ans=min(d)*10\r\n return ans\r\n\r\n\r\n\r\n\r\ndef answer():\r\n l1= [int(x) for x in input().split()]\r\n l2 = [int(x) for x in input().split()]\r\n print(solution(l1,l2))\r\nanswer()", "# Buying A House\r\n\r\ndef search_for_distance_of_cheaper_affordable_house_near_crush(num_of_houses, crushes_house, amount_of_money, houses):\r\n to_left = crushes_house - 1\r\n to_right = crushes_house + 1\r\n counter = 0\r\n\r\n while to_right < num_of_houses or to_left >= 0:\r\n counter +=1\r\n distance = counter*10\r\n\r\n if to_left >= 0:\r\n if houses[to_left] > 0 and amount_of_money >= houses[to_left]:\r\n return distance\r\n if to_right < num_of_houses:\r\n if houses[to_right] > 0 and amount_of_money >= houses[to_right]:\r\n return distance\r\n \r\n to_left -= 1\r\n to_right += 1\r\n\r\nif __name__ == '__main__':\r\n # lendo entradas\r\n\r\n first_input = input()\r\n f_inputs = first_input.split(' ')\r\n num_of_houses = int(f_inputs[0])\r\n crushes_house = int(f_inputs[1]) - 1\r\n amount_of_money = int(f_inputs[2])\r\n\r\n second_input = input()\r\n houses = []\r\n for s_input in second_input.split(' '):\r\n houses.append(int(s_input))\r\n\r\n dist = search_for_distance_of_cheaper_affordable_house_near_crush(num_of_houses, crushes_house, amount_of_money, houses)\r\n print(dist)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m, k = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\nans = 100 * n\r\nfor i in range(1, n + 1):\r\n if a[i] and a[i] <= k:\r\n ans = min(ans, 10 * abs(i - m))\r\nprint(ans)", "n,m,k = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nmins = 10**10\r\nfor i in range(len(A)):\r\n if i+1 != m and k >= A[i] and A[i] != 0:\r\n mins = min(abs(m-(i+1)), mins)\r\nprint(10*mins)\r\n ", "n,m,k = [int(i) for i in input().split()]\r\nl = [int(i) for i in input().split()]\r\nt = 10**n\r\nfor i in range(m,n):\r\n\tif l[i] != 0 and k >= l[i] :\r\n\t\tt = (i-m+1)*10\r\n\t\tbreak\r\nfor i in range(m-2,-1,-1):\r\n\tif l[i] != 0 and k >= l[i]:\r\n\t\tt = min(t,(m-i-1)*10)\r\n\t\tbreak\r\nprint(t)\r\n\t\r\n", "# LUOGU_RID: 101671398\nn, m, k, *a = map(int, open(0).read().split())\r\nprint(min(abs(m - i - 1) for i in range(n) if 1 <= a[i] <= k) * 10)", "n,m,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=[]\r\nfor i in range(n):\r\n if 0<l[i]<=d:\r\n k.append(abs((i+1)*10-m*10))\r\nprint(min(k))\r\n\r\n", "import math;\r\nn,m,k=map(int, input().split());\r\na = list(map(int, input().split()));\r\nm = m - 1;\r\nret = -1;\r\nmi = 100;\r\nfor i in range (0, n):\r\n if (a[i] > 0 and a[i] <= k and int(math.fabs(i - m)) < mi):\r\n mi = int(math.fabs(i - m));\r\nprint (mi * 10);", "n, m, k = [int(c) for c in input().split()]\r\nres = n * 10\r\nfor i, p in enumerate(int(c) for c in input().split()):\r\n d = abs(i + 1 - m) * 10\r\n if p <= k and p != 0 and d < res:\r\n res = d\r\n\r\nprint(res)\r\n", "n, m , k = map(int,input().split())\nl = [*map(int,input().split())]\ntmp = {'Left':float('inf') , 'Right':float('inf')}\nCounter = 1\nfor i in range(m-2,-1,-1):\n if l[i]!=0 and l[i]<=k:\n tmp['Left'] = Counter\n break\n Counter+=1\nCounter = 1\nfor i in range(m,n):\n if l[i]!=0 and l[i]<=k:\n tmp['Right'] = Counter\n break\n Counter+=1\nprint(min(tmp['Left'],tmp['Right'])*10)\n\n", "n=list(map(int, input().split()))\r\nx=n[0]\r\ny=n[0]\r\np=list(map(int, input().split()))\r\nfor i in range(n[1]-1, n[0]):\r\n if p[i]!=0 and p[i]<=n[2]:\r\n x=i-n[1]+1\r\n break\r\nfor i in range(n[1]-1,-1,-1):\r\n if p[i]!=0 and p[i]<=n[2]:\r\n y=n[1]-i-1\r\n break\r\nprint(min(x,y)*10)", "n,m,k=input().split()\r\nn,m,k=int(n),int(m),int(k)\r\nl=list(map(int,input().split()))\r\nl2=[]\r\nfor i in range(n):\r\n\tif l[i]<=k and l[i]!=0:\r\n\t\tl2.append(abs(i-m+1)*10)\r\nprint(min(l2))\r\n\r\n", "n,m,k=input().split()\nn,m,k=int(n),int(m),int(k)\nl=list(map(int,input().split()))\nl2=[]\nfor i in range(n):\n if l[i]<=k and l[i]!=0:\n l2.append(abs(i-m+1)*10)\nprint(min(l2))", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nm -= 1\r\nINF = float('inf')\r\nR, L = INF, -INF\r\nfor i in range(m + 1, n):\r\n if a[i] == 0:\r\n continue\r\n if a[i] <= k:\r\n R = i\r\n break\r\n\r\nfor i in range(m - 1, -1, -1):\r\n if a[i] == 0:\r\n continue\r\n if a[i] <= k:\r\n L = i\r\n break\r\n\r\nprint(min(R - m, m - L) * 10)", "n,m,k = map(int,input().split())\r\nliste = [int(x) for x in input().split()]\r\nliste2 =[]\r\nliste3 =[]\r\nfor loop in range(len(liste)):\r\n if liste[loop]<=k and liste[loop] !=0:\r\n liste2.append(loop)\r\nfor loop in range(len(liste2)):\r\n liste3.append(abs(((liste2[loop]+1))-m))\r\nprint(min(liste3)*10)\r\n ", "a,b,c=map(int,input().split())\nl=list(map(int,input().split()))\narr=[]\nfor i in range(1,len(l)+1):\n if l[i-1]!=0 and l[i-1]<=c:\n arr.append(abs(i-b)*10)\nprint(min(arr))\n\n\t \t \t \t\t\t\t\t\t\t\t\t\t \t \t\t", "first_entry = input()\nsecond_entry = input()\n\ndef entry_to_list_integers(entry):\n return list(map(lambda x: int(x), entry.split(\" \")))\n\nn, m, k = entry_to_list_integers(first_entry)\nhouse_prices = entry_to_list_integers(second_entry)\n\nbest_house = n\n\nfor i in range(n):\n current_price = house_prices[i]\n current_distance = abs((i + 1) - m)\n if (current_price != 0 and current_price <= k and current_distance < best_house):\n best_house = current_distance\n\nprint(best_house * 10)", "_, pos, money = [int(i) for i in input().split()]\r\nhouses = [int(i) for i in input().split()]\r\nminDist = len(houses)\r\npos -= 1\r\nfor i in range(minDist):\r\n if houses[i] != 0 and abs(pos - i) < minDist and houses[i] <= money:\r\n minDist = abs(pos - i)\r\nprint(minDist * 10)", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=0\r\ny=0\r\ni=m-2\r\nwhile(i>=0):\r\n if l[i]!=0 and l[i]<=k:\r\n x=((m-1)-i)*10\r\n break\r\n i=i-1\r\ni=m\r\nwhile(i<n):\r\n if l[i]!=0 and l[i]<=k:\r\n y=(i-(m-1))*10\r\n break\r\n i=i+1\r\nif x!=0 and y!=0:\r\n if x<y:\r\n print(x)\r\n else:\r\n print(y)\r\nelif y==0:\r\n print(x)\r\nelif x==0:\r\n print(y)", "def convert_to_int_array(array):\r\n return [int(i) for i in array]\r\n\r\nfst_input = input().split()\r\nsnd_input = input().split()\r\n\r\nprices = convert_to_int_array(snd_input)\r\nfst_input_int_list = convert_to_int_array(fst_input)\r\nqtt_houses = fst_input_int_list[0]\r\ngirls_house = fst_input_int_list[1]\r\nzanes_money = fst_input_int_list[2]\r\n\r\n\r\n\r\nzanes_house = qtt_houses + 1\r\nfor i in range(qtt_houses):\r\n if prices[i] != 0:\r\n if prices[i] <= zanes_money and abs(i + 1 - girls_house) < zanes_house:\r\n zanes_house = abs(i + 1 - girls_house)\r\n\r\nprint(zanes_house * 10)", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A, m, k):\r\n n = len(A)\r\n answer = float('inf')\r\n for i in range(n):\r\n if 0 < A[i] <= k:\r\n answer = min(answer, abs(10*(i+1-m)))\r\n sys.stdout.write(f'{answer}\\n')\r\n \r\nn, m, k = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nprocess(A, m, k)", "n, m, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\na = []\r\n\r\nfor i in range(n):\r\n if l[i] != 0 and l[i] <= k:\r\n c = abs(m - (i + 1))\r\n a.append(c)\r\n\r\nprint(min(a)*10)", "n,m,k = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\ndis = []\r\nfor i in range(len(a)):\r\n if a[i]!=0 and a[i]<=k:\r\n dis.append(abs(i+1-m))\r\n\r\nprint(10*min(dis))", "n, m, k = map(int, input().split())\nhouses = list(map(int, input().split()))\nmenor = 1000 # 1000 pode ser inf pois ultrapassa o tamanho maximo que a lista pode chegar\n\nfor i in range(m-1,-1,-1): # de trás pra frente\n if (houses[i] != 0) and (k >= houses[i]):\n suposto_menor = abs((i+1)-m)*10\n if(suposto_menor < menor):\n menor = suposto_menor\n\nfor i in range(m,n): # de frente pra trás\n if (houses[i] != 0) and (k >= houses[i]):\n suposto_menor = abs((i+1)-m)*10\n if(suposto_menor < menor):\n menor = suposto_menor\n\nprint(menor)\n", "n,m,k= map(int,input().split())\r\na = list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n if(a[i]!=0 and a[i]<=k):\r\n b.append(i+1)\r\n\r\nmi = abs(b[0])\r\nfor i in range(1,len(b)):\r\n if(abs(b[i]-m)<abs(mi-m)):\r\n mi = abs(b[i])\r\nprint(abs(m-mi)*10)\r\n \r\n ", "ls=list(map(int,input().rstrip().split()))\r\nn=ls[0]\r\nm=ls[1]\r\nk=ls[2]\r\nhs=list(map(int,input().rstrip().split()))\r\nds=[]\r\nfor i in range(len(hs)):\r\n if(hs[i]<=k and hs[i]!=0):\r\n ds.append(i)\r\nfor i in range(len(ds)):\r\n ds[i]=abs(ds[i]+1-m)*10\r\nprint(min(ds))", "n, m , k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nm -= 1\r\nt1 = m-1\r\nt2 = m+1\r\nans = n\r\nwhile t1>=0:\r\n if l[t1] != 0 and l[t1] <= k:\r\n ans = min(ans,m-t1)\r\n break \r\n t1 -= 1\r\n\r\n\r\nwhile t2 <= n-1:\r\n if l[t2] != 0 and l[t2] <= k:\r\n ans = min(ans, t2 -m)\r\n break \r\n t2 += 1\r\n\r\nans *= 10\r\nprint(ans)\r\n", "n,m,k = [int(x) for x in input().split()]\r\nhouses_prices = [int(x) for x in input().split()]\r\ndistances_unities = []\r\n \r\nfor i in range(n):\r\n\tif (houses_prices[i]!= 0 and houses_prices[i]<=k):\r\n\t\tdistances_unities.append(abs(i+1-m))\r\n\r\ndistance_min = min(distances_unities)\r\nprint(distance_min * 10)\t", "n, m, k = map(int, input().split())\r\nl_p = list(map(int, input().split()))\r\n\r\nm -= 1\r\ni = 1\r\n\r\nwhile i < n:\r\n if m + i < n:\r\n if l_p[m + i] <= k and l_p[m + i] != 0:\r\n print(i * 10)\r\n quit()\r\n if m - i >= 0:\r\n if l_p[m - i] <= k and l_p[m - i] != 0:\r\n print(i * 10)\r\n quit()\r\n \r\n i += 1", "import math\r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 1e9\r\nfor i in range(0, n):\r\n\tif a[i] == 0:\r\n\t\tcontinue\r\n\tif a[i] <= k:\r\n\t\tans = min(ans, abs(m-(i+1))*10)\r\nprint(ans)", "n,m,k = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\nh1=[]\n \nfor i in range(n):\n\tif (a[i]!=0 and a[i]<=k):\n\t\th1.append(abs(i+1-m))\n\t\t\nc=min(h1)\nprint(c*10)\n", "string = input().split(' ')\r\n\r\nn = int(string[0])\r\nm = int(string[1])\r\nk = int(string[2])\r\n\r\nhouses = input().split(' ')\r\n\r\nminDistance = float('inf')\r\n\r\nfor i in range(m-1, n):\r\n if int(houses[i]) <= k and int(houses[i]) != 0 and i != m-1:\r\n minDistance = (i+1-m) * 10\r\n break\r\n\r\nfor i in range(m-1, -1, -1):\r\n if int(houses[i]) <= k and int(houses[i]) != 0 and i != m-1:\r\n distance = (m-(i+1)) * 10\r\n if distance < minDistance:\r\n minDistance = distance\r\n\r\nprint(minDistance)\r\n\r\n\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,m,k=read_ints()\r\n\tm-=1\r\n\ta=read_ints()\r\n\tfor i in range(n):\r\n\t\tif 0<=m+i and m+i<n and 0<a[m+i] and a[m+i]<=k:\r\n\t\t\tprint(i*10)\r\n\t\t\treturn\r\n\t\tif 0<=m-i and m-i<n and 0<a[m-i] and a[m-i]<=k:\r\n\t\t\tprint(i*10)\r\n\t\t\treturn\r\n\r\nsolve()\r\n", "\"\"\"# Do not remove the below import statement\r\nimport sys\r\n\r\n'''This function provides the capacity, size and space left in the list.\r\nYou can invoke it to get the details of the list'''\r\n\r\n\r\ndef list_details(lst):\r\n # Number of elements that can be stored in the list\r\n print(\"Capacity:\", (sys.getsizeof(lst)-36)//4)\r\n\r\n # Number of elements in the list\r\n print(\"Size:\", len(lst))\r\n\r\n # Number of elements that can be accommodated in the space left\r\n print(\"Space Left:\", ((sys.getsizeof(lst)-36) - len(lst*4))//4)\r\n\r\n # formula changes based on the system architecture\r\n # (size-36)/4 for 32 bit machines and\r\n # (size-64)/8 for 64 bit machines\r\n\r\n # 36, 64 - size of an empty list based on machine\r\n # 4, 8 - size of a single element in the list based on machine\r\n\r\n\r\nmarias_lst = []\r\nfor i in range(1500):\r\n marias_lst.append(i)\r\nprint(\"Empty list created!!!\")\r\nprint(\"List details:\")\r\nlist_details(marias_lst)\r\nmarias_lst.append(1)\r\nmarias_lst.append(2)\r\nprint(marias_lst)\r\n\"\"\"\r\nn, m, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nmind = len(l)-1\r\nfor i in range(len(l)):\r\n if i != m-1 and 0 < l[i] <= k and abs(i-m+1) < mind:\r\n mind = abs(i-m+1)\r\nprint(mind*10)\r\n", "import sys\n#import time\n\ndef StrToInt(list_entry):\n\tmap_object = map(int, list_entry)\n\treturn list(map_object)\n\ndef calculeDistance(i, j):\n\tend = max(i, j)\n\tbegin = min(i, j)\n\treturn 10 * (end - begin)\n\n# entry\nnum_houses, girl_index, money = StrToInt(input().split())\nprices = StrToInt(input().split())\n\ngirl_index -= 1\nmin_value = sys.maxsize\nfor i in range(len(prices)):\n\tprice = prices[i]\n\tif price != 0 and i != girl_index and price <= money:\n\t\tdistance = calculeDistance(i, girl_index)\n\t\tmin_value = min(min_value, distance)\n\nprint(min_value)\n \t\t\t \t\t\t \t\t \t\t \t \t \t \t \t\t", "n, m, k = [int(x) for x in input().split()]\r\nhouses_values = [int(x) for x in input().split()]\r\n\r\nnearest = float(\"inf\")\r\n\r\nfor i, value in enumerate(houses_values):\r\n if value != 0 and value <= k:\r\n distance = abs(m - (i + 1))\r\n\r\n if nearest >= distance:\r\n nearest = distance\r\n\r\nprint(nearest * 10)\r\n", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = float('inf')\r\nfor i in range(m-2,-1,-1):\r\n\tif a[i]!=0 and a[i]<=k:\r\n\t\tans = m-(i+1)\r\n\t\tbreak\r\nfor i in range(m,n):\r\n\tif a[i]!=0 and a[i]<=k:\r\n\t\tans = min(ans,i-m+1)\r\nprint(ans*10)", "n,m,k = [ int(x) for x in input().split()]\r\nm -= 1\r\nhouses = [ int(x) for x in input().split()]\r\n\r\nwill_buy = -1\r\nhouse_away = n\r\nfor i in range(n):\r\n price = houses[i]\r\n this_away = abs(i-m)\r\n if ( price != 0 and k >= price and this_away <= house_away):\r\n will_buy = i\r\n house_away = this_away\r\n\r\nprint(10*(abs(will_buy-m)))\r\n", "n, m, k = [int(s) for s in input().split(' ')]\r\na = [int(s) for s in input().split(' ')]\r\nprint(10 * min([abs(m - 1 - j) for j, p in enumerate(a) if 0 < p <= k]))", "n,m,k = map(int,input().split())\r\nprices = list(map(int, input().split()))\r\n\r\nboughthousedist = []\r\n\r\nfor i in range(1,n+1):\r\n if prices[i-1] == 0 or prices[i-1] > k:\r\n continue\r\n else:\r\n boughthousedist.append(abs(m-i)*10)\r\n\r\nmindist = min(boughthousedist)\r\nprint(mindist)", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n\tif a[i]<=k and a[i]!=0:\r\n\t\tb.append(10*abs(m-i-1))\r\nprint(min(b))\t\t\r\n", "from sys import stdin\n\nn, m, k = (int(i) for i in stdin.readline().strip().split(' '))\n\na = [int(i) for i in stdin.readline().strip().split(' ')]\n\n# a[m] == 0\n# a[i] == 0 -> can not be bought\n\n\n# adjust m for correct indexes\nm = m - 1\n\nmin_d = float('inf')\nfor i, price in enumerate(a):\n if 0 < price <= k:\n if abs(i-m) < min_d:\n min_d = abs(i-m)\n\nprint(min_d * 10)", "v = lambda: map(int, input().split())\r\nn, m, k = v()\r\nm -= 1\r\nprint(min(abs(i - m) for i, p in enumerate(v()) if 0 < p <= k) * 10)\r\n", "N, M, K = map(int, input().split())\nlista = [int(i) for i in input().split()]\n\nk, ans=0, []\nfor i in lista:\n\tk += 1\n\tif(i!=0 and i<=K):\n\t\tans.append(abs(k-M))\t\n\nans.sort()\nprint(ans[0]*10)\n\t \t\t \t\t\t\t \t\t \t \t \t \t\t \t\t\t\t", "n,m,k=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\ndis=0\r\nminm=100000000\r\nfor i in range(0,n):\r\n if a[i]<=k and i!=n and a[i]!=0:\r\n dis=abs(i-m+1)*10\r\n if dis<minm:\r\n minm=dis\r\nprint(minm)\r\n ", "n, m, k = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\n\nmin_distance = n * 10\n\nfor i, price in enumerate(a):\n if price > 0 and k >= price:\n distance = abs(i * 10 - m * 10 + 10)\n if distance < min_distance:\n min_distance = distance\n\nprint(min_distance)\n", "def abs(n: int):\n if n < 0:\n n = -n\n return n\nn, m, k = map(int, input().split())\nhouse = list(map(int, input().split()))\n# print(house)\nans = -1\nfor i in range(0, m - 1):\n if house[i] != 0 and house[i] <= k:\n ans = i\nfor i in range(m, n):\n if house[i] != 0 and house[i] <= k:\n if ans == -1 or abs(i - m + 1) < abs(ans - m + 1):\n print(abs(i - m + 1) * 10)\n exit(0)\n else:\n print(abs(ans + 1 - m) * 10)\n exit(0)\n\nprint(abs(ans - m + 1) * 10)\n\t\t\t\t\t \t\t \t\t\t\t\t \t\t\t\t\t\t \t \t \t", "a, b, c = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nk = []\r\n\r\nfor i in range(a):\r\n if 0 < l[i] <= c:\r\n k.append(abs((i+1)*10-b*10))\r\n\r\nprint(min(k))", "line=input()\nn,m,j = [int(i) for i in line.split()]\nline=input()\na=[int(i) for i in line.split()]\ndistancia=n\nfor k in range(n):\n if a[k]!=0 and a[k]!=a[m-1] and a[k]<=j:\n if abs(m-(k+1))<=distancia:\n distancia=abs(m-(k+1))\nprint(distancia*10)\n\t\t\t\t \t \t \t\t \t\t\t\t\t \t \t\t \t\t", "N, M, K = map(int, input().split())\nAs = list(map(int, input().split()))\n\nans = 10 * N\nfor i in range(N):\n if 0 < As[i] <= K:\n ans = min(ans, 10 * abs(M - i - 1))\n\nprint(ans)\n", "arr = n,m,k = [int(x) for x in input().split()]\r\n\r\nhouses = [int(x) for x in input().split()]\r\n\r\ngl = m-1\r\n\r\ndist = 101\r\n\r\nfor i in houses:\r\n if i != 0 and i <= k:\r\n if abs(houses.index(i) - gl) < dist:\r\n dist = abs(houses.index(i) - gl)\r\n houses[houses.index(i)] = 100000\r\n \r\nprint(dist*10)", "n,m,k=map(int,input().split(' '))\r\ns=list(map(int,input().split(' ')))\r\nd=[]\r\nfor i in range(n):\r\n\tif s[i]<=k and s[i]!=0:\r\n\t\td.append(abs(m-(i+1)))\r\nprint(min(d)*10)", "n, m, k = map(int, input().split())\nprices = list(map(int, input().split()))\n\nminDistance = 1000000;\nfor i in range(0, n):\n if prices[i] != 0 and prices[i] <= k:\n minDistance = min(minDistance, abs(i - (m-1)))\n \nans = 10 * minDistance\nprint(ans)\n \t\t \t \t\t\t\t \t \t\t\t\t", "n, m, k = map(int, input().split(' '))\np = list(map(int, input().split(' ')))\n\nm -= 1\n\nd = 0\n\nfor i in range(m - 1, -1, -1):\n if p[i] != 0 and p[i] <= k:\n d = m - i\n break\n\nfor i in range(m + 1, n):\n if p[i] != 0 and p[i] <= k:\n if d == 0:\n d = i - m\n break\n\n d = min(d, i - m)\n break\n\nprint(10 * d)\n\n\t \t \t\t \t\t \t \t \t \t\t \t \t", "n, m, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nans = 0\r\ntemp = 0\r\npointer = 0\r\nfor i in range(len(a)):\r\n if (k >= a[i] and a[i] != 0):\r\n temp = abs(m - (i+1))*10\r\n# print(temp)\r\n if (pointer == 0):\r\n ans = temp\r\n pointer += 1\r\n# print(ans)\r\n if (ans > temp):\r\n ans = temp\r\n \r\nprint(ans)", "n,m,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nm-=1\r\nl1 = []\r\nfor i in range(n):\r\n if(l[i]<=k and l[i]!=0):\r\n l1.append((abs(i-m))*10)\r\nprint(min(l1))", "n,b,c = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = []\r\nfor i in range(b):\r\n if a[i] != 0 and a[i] <= c:\r\n d.append((b-i-1)*10)\r\nfor i in range(b,len(a),1):\r\n if a[i] != 0 and a[i] <= c:\r\n d.append((i-b+1)*10)\r\nprint(min(d))", "n, m, k = map(int, input().split() )\r\na = [0]*n\r\na = list(map(int, input().split() ) )\r\n\r\nc = 10000\r\nm = m-1\r\nfor i in range(n):\r\n if a[i] > 0 and a[i] <= k:\r\n if c > m-i and m-i > 0:\r\n c = m-i\r\n elif c > i-m and i-m > 0:\r\n c = i-m\r\nprint(10*c) \r\n", "n,m,k=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nan = 0\r\nl,r=m-1,m-1\r\nwhile an == 0:\r\n if l>=0 and A[l] > 0 and A[l] <=k:\r\n an = abs(l-m+1)\r\n if r<len(A) and A[r] >0 and A[r]<=k:\r\n an = abs(r-m+1)\r\n l-=1\r\n r+=1\r\nprint(10*an) ", "def find_house_to_buy(houses, girl, money_avl):\r\n n = len(houses)\r\n can_buy = [i for i in range(1,n+1) if houses[i-1] != 0 and houses[i-1] <= money_avl ] \r\n can_buy.sort(key = lambda x : abs(x-girl))\r\n \r\n house_to_buy = abs(girl - can_buy[0])\r\n print(house_to_buy * 10)\r\n \r\nn, girl, money_avl = map(int, input().split())\r\nhouses = [int(i) for i in input().split()]\r\n\r\nfind_house_to_buy(houses, girl, money_avl)", "n, m, k = map(int, input().split())\r\np = list(map(int, input().split()))\r\nans = n\r\nfor i in range(n):\r\n if p[i] != 0 and p[i] <= k:\r\n ans = min(ans, abs(i + 1 - m))\r\nprint(ans * 10)\r\n", "n,m,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nb=[]\r\nfor i in range(n):\r\n if a[i]<=k and a[i]!=0:\r\n b.append(abs(i+1-m)*10)\r\nprint(min(b))", "n, m, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nl = []\r\nfor i in range(n):\r\n\tif a[i]>0 and a[i]<=k:\r\n\t\tl.append(i)\r\nl1 = [abs(i-(m-1)) for i in l]\r\nprint(min(l1)*10)", "n, m, k = map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\na = 0\r\nb = 0\r\nflaga = 0\r\nflagb = 0\r\nfor x in range(m-1,0,-1):\r\n\ta+=1\r\n\tif l[x-1] <= k and l[x-1]!= 0:\r\n\t\tflaga = 1\r\n\t\tbreak\r\nfor y in range(m+1,n+1):\r\n\tb+=1\r\n\tif l[y-1] <= k and l[y-1]!= 0:\r\n\t\tflagb =1\r\n\t\tbreak\r\nif flaga == 0:\r\n\ta = 101\r\nif flagb == 0:\r\n\tb = 101\r\n# print(a,b)\r\nprint(min(a,b)*10)", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(n):\r\n if l[i]<=k and l[i]!=0:\r\n ans.append(i+1)\r\nfor i in range(len(ans)):\r\n ans[i]=abs(ans[i]-m)*10\r\nprint(min(ans))", "n,m,k = map(int,input().split())\r\nMM = list(map(int,input().split()))\r\nl = 0\r\nb = 0\r\nif m == 1:\r\n for i in range(1,n):\r\n if MM[i] <= k and MM[i] != 0:\r\n print(i*10)\r\n break\r\nelse:\r\n for i in range(m-1,-1,-1):\r\n if MM[i] <= k and MM[i] != 0:\r\n l = (m-1-i)*10\r\n break\r\n for i in range(m,n):\r\n if MM[i] <= k and MM[i] != 0:\r\n b = (i-m+1)*10\r\n break\r\n if min(l,b) == 0:\r\n print(max(l,b))\r\n else:\r\n print(min(l,b))\r\n", "n,m,k=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nc=m-1;count=0;count1=[]\r\nfor i in range(n):\r\n if ar[i]<=k and ar[i]!=0:\r\n count1.append(abs(i-c))\r\nprint(min(count1)*10) \r\n \r\n ", "a = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = []\r\nd = []\r\nfor i in range(0,len(b)):\r\n if(b[i]==0):\r\n pass\r\n elif(b[i]<=a[2]):\r\n c.append(i+1)\r\n else:\r\n pass \r\nfor i in range(0,len(c)):\r\n h = a[1] - c[i] \r\n if(h<0):\r\n h = 0 - h\r\n d.append(h)\r\n else:\r\n d.append(h)\r\nprint(min(d)*10)\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,m,k = map(int,input().split())\r\nai = list(map(int,input().split()))\r\nm -= 1\r\nans = 100000\r\nfor i in range(n):\r\n if ai[i] != 0 and ai[i] <= k:\r\n ans = min(ans,10 * (abs(m - i)))\r\nprint(ans)\r\n", "n, m, k = map(int, input().split())\r\nlistOfHouses = [int(x) for x in input().split()][:n]\r\nlistAvailableHouses = []\r\ntempList = []\r\nfor x in listOfHouses:\r\n if(x == 0):\r\n pass\r\n elif(x <= k):\r\n listAvailableHouses.append(listOfHouses.index(x)+1)\r\n listOfHouses[listOfHouses.index(x)] = \"A\"\r\n# print(listAvailableHouses)\r\nfor x in listAvailableHouses:\r\n if (x >= m):\r\n tempList.append((x - m)*10)\r\n else:\r\n tempList.append((m-x)*10)\r\n\r\nprint(min(tempList))", "n,m,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = a[:m-1][::-1]\r\na = a[m:]\r\n\r\nbn, an = 10**10,10**10\r\n\r\nfor i in range(len(a)):\r\n if a[i] <= k:\r\n if a[i]!=0:\r\n an = i\r\n break\r\n\r\nfor i in range(len(b)):\r\n if b[i] <= k:\r\n if b[i]!=0:\r\n bn = i\r\n break\r\n\r\nif an < bn:\r\n print(10*(1+an))\r\nelse:\r\n print(10*(1+bn))\r\n \r\n", "L = input()\r\nD = input()\r\nL = L.split()\r\nn = L[0]\r\nm = int(L[1])\r\n#k es numero de casa\r\nk = int(L[2])\r\np = m-1\r\n\r\nD = D.split()\r\nB = []\r\nfor i in range (len(D)):\r\n f = int (D[i])\r\n \r\n if f <= k and( i == p or f != 0):\r\n B.append(i) \r\n\r\nV = len(B)\r\nfor j in range (V):\r\n if B[j] == p:\r\n pos = j\r\n \r\nif B[0] == p:\r\n R = abs(p - B[pos+1])\r\nelif B[V-1] == p:\r\n R = abs(p - B[V-2])\r\nelse:\r\n R1 = abs(p - B[pos+1])\r\n R2 = abs(p - B[pos-1])\r\n if R1 <= R2:\r\n R = R1\r\n else:\r\n R = R2\r\nR = R*10 \r\n\r\nprint (R)\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef main():\r\n n, m, k = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n min_val = 10 ** 18\r\n for i in range(n):\r\n if A[i] and A[i] <= k:\r\n val = abs(i - (m - 1)) * 10\r\n min_val = min(min_val, val)\r\n print(min_val)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a=lambda:map(int,input().split());d,e,f=a();print(min(abs(i-e) for (i,z) in zip(range(1,d+1),a()) if 0<z<=f)*10)\r\n", "from math import inf\n\n\ndef solve(n, m, k, a):\n ans = inf\n m -= 1\n for i in range(n):\n if a[i] and a[i] <= k and abs(m - i) < ans:\n ans = abs(m - i)\n return ans*10\n\n\ndef main():\n n, m, k = list(map(int, input().split()))\n a = list(map(int, input().split()))\n print(solve(n, m, k, a))\n\n\nmain()\n", "n,m,k = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\nd=200\r\n\r\nfor i in range(1,n+1):\r\n if h[i-1] and h[i-1]<=k and d>abs(i-m):\r\n d = abs(i-m)\r\n \r\nprint(d*10)", "import math\nn, m, k = input().split(' ')\nhouses = input().split(' ')\nindex = math.inf\n\nfor i in range(int(n)):\n if (i != int(m) - 1 and int(houses[i]) != 0):\n if(int(houses[i]) <= int(k)):\n if (abs((int(m) - 1) - i) < index):\n index = abs((int(m) - 1) - i)\n\nprint(index * 10)\n\t \t\t\t\t \t\t\t \t \t \t \t\t\t\t\t \t", "n, m, k = map(int, input().split())\r\nl = [int(i) for i in input().split()]\r\nm -= 1\r\nans = []\r\nfor j in range(n):\r\n if l[j] !=0 and l[j]<=k:\r\n ans+=[abs(j - m)*10]\r\nprint(min(ans))\r\n", "#n = int(input())\nn, m, k = map(int, input().split())\n#s = input()\nc = list(map(int, input().split()))\nl = 1000000000000000\nfor i in range(n):\n if c[i] != 0 and c[i] <= k:\n l = min(l, abs(m - i - 1) * 10)\nprint(l)\n ", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmn = 1000000\r\nfor i in range(n):\r\n\tif a[i] != 0 and a[i] <= k:\r\n\t\tmn = min(mn,abs(m-i-1)*10)\r\nprint(mn)\r\n", "def menorDistancia(lista1, lista2):\n i = int(lista1[0])\n j = int(lista1[1]) - 1\n k = int(lista1[2])\n distanciaEsquerda = 999999999\n distanciaDireita = 999999999\n\n for index in range(j-1,-1,-1):\n if(0 < int(lista2[index]) <= k):\n distanciaEsquerda = abs(j-index)*10\n break\n for index in range(j+1,i):\n if(0 < int(lista2[index]) <= k):\n distanciaDireita = abs(j-index)*10\n break\n\n return min(abs(distanciaEsquerda),abs(distanciaDireita))\n\n\n\nlista1 = input().split(\" \")\nlista2 = input().split(\" \")\n\nprint(menorDistancia(lista1,lista2))\n\t \t \t \t\t\t\t \t \t\t\t \t \t\t \t\t \t", "n,m,k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nans = min(abs(m-i-1)*10 for i in range(len(a)) if a[i] <= k and a[i] != 0)\r\nprint(ans)", "n,m,k=map(int,input().split())\r\nls=list(map(int,input().split()))\r\np=1000000\r\nlove=0\r\nfor i in range(len(ls)):\r\n\tif ls[i]!=0 and ls[i]<=k and abs(m-1-i)<p and i!=(m-1):\r\n\t\tp=abs(m-1-i)\r\nprint(p*10)\t\t", "n,m,k = input().split()\nn,m,k = map(int,[n,m,k])\nA = []\ns = input()\na = 1\nMin = 1000\nfor i in s.split():\n if int(i)<=k and int(i) != 0:\n x= abs(m-a)\n if x<Min:\n Min = x\n a = a + 1\nprint(Min*10)\n\n\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\n\r\nmn=100000\r\nfor i in range(m,n):\r\n if(a[i]<=k and a[i]!=0):\r\n mn=(i-m+1)*10\r\n break\r\n\r\nfor i in range(m):\r\n if(a[i]<=k and a[i]!=0):\r\n x=(m-1-i)*10\r\n mn=min(mn,x)\r\n\r\nprint(mn)\r\n", "n,m,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ni=m-1\r\n#j=m-1\r\nleft=i-1\r\nright=i+1\r\ncount=0 \r\nwhile(1):\r\n if left>=0 and a[left]!=0 and a[left]<=k:\r\n count+=10\r\n break\r\n elif right<n and a[right]!=0 and a[right]<=k:\r\n count+=10\r\n break\r\n else:\r\n count+=10\r\n left-=1 \r\n right+=1 \r\nprint(count)", "n,m,k=map(int,input().split())\r\n\r\nres=float(\"inf\")\r\n\r\na=list(map(int,input().split()))\r\n\r\nfor i in range(0,n):\r\n if a[i]!=0 and a[i]<=k:\r\n res=min(res,abs(i-(m-1)))\r\n\r\nprint(10*res)", "n,m,k = [int(n) for n in input().split()]\nlisto = input().split()\nres = n*10\nfor i in range(n):\n if 0 < int(listo[i]) <= k and abs(i+1-m)*10 < res:\n res = abs(i+1-m)*10\nprint(res)\n \t\t \t \t\t \t\t \t\t \t \t \t", "n, m, k = map(int, input().split())\r\na = input().split()\r\nans = 100009\r\ni = 1\r\nfor j in a:\r\n\r\n if int(j) != 0 and int(j) <= k:\r\n ans = min(abs((i-m)*10), ans)\r\n i += 1\r\nprint(ans)\r\n", "\r\ndef ok(arr1,t,p):\r\n cost=float('inf')\r\n n=len(arr1)\r\n for i in range(n):\r\n if arr1[i]<=p and arr1[i]!=0:\r\n cost=min(cost,abs(i-t+1)*10)\r\n return cost\r\nn,t,p=map(int,input().split())\r\narr1=list(map(int,input().split()))\r\nprint(ok(arr1,t,p))\r\n", "n,m,k=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\ns=[]\r\nfor i in range(n):\r\n if l[i]<=k and i!=m-1 and l[i]!=0:\r\n s.append(i)\r\n#print(s)\r\ny=min([abs(m-i-1)*10 for i in s])\r\nprint(y)", "n, m, k = map(int, input().split())\r\nA, m = list(map(int, input().split())), m - 1\r\n\r\nfor d in range(1, n):\r\n if m - d >= 0 and 0 < A[m - d] <= k or m + d < n and 0 < A[m + d] <= k:\r\n print(10 * d)\r\n break", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(0,n):\r\n if (a[i]<=k)and(a[i]!=0):\r\n b.append(i+1)\r\nmi=n\r\nfor i in b:\r\n if abs(m-i)<mi:\r\n mi=abs(m-i)\r\nprint(mi*10)\r\n", "n, m, k = list(map(int, input().split()))\na = list(map(int, input().split()))\na = [p if p <= k else 0 for p in a]\nm -= 1\ni = m\nj = m\nwhile i < n and a[i] == 0: i += 1\nwhile j >= 0 and a[j] == 0: j -= 1\nif i < n and j >= 0:\n print(10*min(i-m, m-j))\nelif i < n:\n print(10*(i-m))\nelse:\n print(10*(m-j))\n\n", "houses, girl_house, money = [int(x) for x in input().split(' ')]\r\navailable = [int(x) for x in input().split(' ')]\r\ncnt = 1\r\n\r\ncheapest = 99 * 10\r\n\r\nwhile cnt <= houses:\r\n if available[cnt-1] == 0 or available[cnt-1] > money:\r\n pass\r\n else:\r\n cheapest = min(cheapest, abs((cnt - girl_house) * 10))\r\n cnt += 1\r\n\r\nprint(cheapest)\r\n", "def menorDistancia(precoCasas, m, k):\n i = 1\n distanciaEntreCasas = 10\n \n while True:\n if m - i >= 0:\n if int(precoCasas[m - i]) <= k and int(precoCasas[m - i]) > 0:\n break\n if m + i < len(precoCasas):\n if int(precoCasas[m + i]) <= k and int(precoCasas[m + i]) > 0:\n break\n i += 1\n \n return distanciaEntreCasas * i\n\nentrada = input().split()\nm = int(entrada[1])\nk = int(entrada[2])\nprecoCasas = input().split()\nprint(menorDistancia(precoCasas, m - 1, k))\n \t\t \t \t\t \t\t \t", "import math\r\n\r\nnapis = input().split()\r\nileDomow = int(napis[0])\r\ngdzieMieszka = int(napis[1])\r\nilePieniedzy = int(napis[2])\r\nkolejnyNapis = input().split()\r\nlistaCen = []\r\n\r\nktoreDomyMoznaKupic = []\r\nindeksyTychDomow = []\r\n\r\nif len(kolejnyNapis) == ileDomow:\r\n for x in range(len(kolejnyNapis)):\r\n listaCen.append(int(kolejnyNapis[x]))\r\n\r\n for y in range(len(listaCen)):\r\n if ilePieniedzy >= int(listaCen[y]) and listaCen[y] > 0:\r\n indeksyTychDomow.append(y + 1)\r\n\r\n najmniejszyDystans = int(math.fabs(int(indeksyTychDomow[0]) - gdzieMieszka))\r\n for z in range(len(indeksyTychDomow)):\r\n if math.fabs(int(indeksyTychDomow[z]) - gdzieMieszka) < najmniejszyDystans:\r\n najmniejszyDystans = math.fabs(int(indeksyTychDomow[z]) - gdzieMieszka)\r\n\r\n print(int(najmniejszyDystans * 10))\r\n", "n, m, k = [int(x) for x in input().split()]\r\nprices = [int(x) for x in input().split()]\r\n#0, 1, 2, .... , m-2, *(m-1), m, ..., n-1\r\n\r\nright_side = 1000000\r\nfor i in range(m, n):\r\n\tif prices[i] != 0 and prices[i] <= k:\r\n\t\tright_side = i - m + 1 # distance to house (m-1)\r\n\t\tbreak\r\n\r\nleft_side = 1000000\r\nfor i in range(m-2, -1, -1):\r\n\tif prices[i] != 0 and prices[i] <= k:\r\n\t\tleft_side = m - i - 1 # distance to house (m-1)\r\n\t\tbreak\r\n\r\nprint(min(left_side, right_side) * 10)", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\n\r\n\r\nfor y in range(0,n):\r\n if k>=a[y] and a[y]!=0:\r\n b.append(abs(y-(m-1)))\r\n\r\nl=min(b)\r\nprint(l*10)\r\n\r\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=0\r\nfor x in range(n):\r\n if a[x]<=k and a[x]:\r\n if i==0:i=abs(m-x)-(2*(x+1<m)-1)\r\n else:i=min(i,abs(m-x)-(2*(x+1<m)-1))\r\nprint(i*10)", "x = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\nk = int(x[2])\r\nx = input().split()\r\nlist1 = []\r\nfor i in x:\r\n list1.append(int(i))\r\n\r\nfirst_index = -10000\r\nsecond_index = -10000\r\n\r\nfor i in range(m-1,-1,-1):\r\n if list1[i] == 0:\r\n continue\r\n if k>=list1[i]:\r\n first_index = i\r\n break\r\n\r\nfor i in range(m,n):\r\n if list1[i] == 0:\r\n continue\r\n if k>=list1[i]:\r\n second_index = i\r\n break\r\n\r\nif abs(first_index-(m-1)) <= abs(second_index-(m-1)):\r\n print((abs(first_index-(m-1)))*10)\r\nelse:\r\n print((abs(second_index-(m-1)))*10)\r\n ", "len_houses, girl, cash = map(int, input().split())\nhouses = list(map(int, input().split()))\ngirl -= 1\nmin_distance = len_houses\n\ndef calc_distance(distance):\n x = girl - distance\n return x if x > 0 else x * -1\n\nfor i in range(len_houses):\n distance = calc_distance(i)\n if (0 < houses[i] and houses[i] <= cash and distance < min_distance):\n min_distance = distance\n\nprint(min_distance * 10)\n\t \t \t \t \t \t\t", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk1=10000000\r\nk2=-10000000\r\nfor i in range(m-1,n,1):\r\n if a[i]!=0:\r\n if a[i]<=k:\r\n k1=i\r\n break\r\nfor i in range(m-1,-1,-1):\r\n if a[i]!=0:\r\n if a[i]<=k:\r\n k2=i\r\n break\r\nr=min(k1-(m-1),(m-1)-k2)\r\nprint(r*10)", "n, m, k = map(int, input().split())\r\nhouses = list(map(int, input().split()))\r\n\r\ntoright = houses[m:]\r\ntoleft = list(reversed(houses[:m-1]))\r\n\r\ndef first_lower(lst, num):\r\n for i in range(len(lst)):\r\n if lst[i] <= num and lst[i] != 0:\r\n return i + 1\r\n return -1\r\n\r\ndef min(a,b):\r\n if a < 0 or b < 0:\r\n return a if b < 0 else b\r\n return a if a < b else b\r\n\r\nprint(min( first_lower(toright, k), first_lower(toleft,k) ) * 10)", "n, m, k = map(int, input().strip().split(' '))\nhouses = list(map(int, input().strip().split(' ')))\ncount = 0\nfor i in range(m,n):\n count += 10\n if houses[i] > 0 and houses[i] <= k:\n break\n if i == n-1:\n count = 1000\nright_min = count\nhouses.reverse()\ncount = 0\nfor i in range((n-m+1),n):\n count += 10\n if houses[i] > 0 and houses[i] <= k:\n break\n if i == n-1:\n count = 1000\nleft_min = count\nif left_min == 0:\n print(right_min)\nelif right_min == 0:\n print(left_min)\nelse:\n print(min(left_min,right_min))", "import math\r\ndef main():\r\n n,m,k = map(int, input().split())\r\n a = list(map(int,input().split()))\r\n m -= 1\r\n i = j = m\r\n i -= 1\r\n j += 1\r\n t1 = t2 = 1000000000000000000000000000000\r\n while i >= 0:\r\n if a[i] <= k and a[i] != 0:\r\n t1 = 10 * (m - i)\r\n break\r\n i -= 1\r\n while j < len(a):\r\n if a[j] <= k and a[j] != 0:\r\n t2 = 10 * (j - m)\r\n break\r\n j += 1\r\n print(int(min(t1,t2)))\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m, k = map(int, input().split(\" \"))\na = list(map(int, input().split(\" \")))\nfor i in range(1, n+1):\n if (m-i-1 >= 0 and a[m-i-1] != 0 and k >= a[m-i-1]) or \\\n (m+i-1 < n and a[m+i-1] != 0 and k >= a[m+i-1]):\n print(i*10)\n exit()\n", "n,m,k=map(lambda x:int(x),input().split())\r\nnum=input()\r\nlist=[int(x) for x in num.split()]\r\na=n\r\nfor i in range(n):\r\n if list[i]!=0 and list[i]<=k and abs(i-(m-1))<a:\r\n a=abs(i-(m-1))\r\nprint(a*10)", "n,m,k = map(int, input().split())\nh = list(map(int, input().split()))\n\nm -= 1\n\nans = 10**18\n\ni = m+1\nwhile i < n:\n if h[i] > 0 and h[i] <= k:\n ans = abs(i - m)\n break\n i += 1\n\ni = m-1\nwhile i >= 0:\n if h[i] > 0 and h[i] <= k:\n ans = min(abs(i - m), ans)\n break\n i -= 1\n\nprint(ans * 10)", "a=lambda:map(int,input().split());d,e,f=a();print(min(abs(i-e) for i,z in enumerate(a(),1) if 0<z<=f)*10)", "n_m_k = input().split(\" \")\r\nhouses = input().split(\" \")\r\nn = int(n_m_k[0])\r\nm = int(n_m_k[1])\r\nk = int(n_m_k[2])\r\nd = 100\r\n\r\n\r\nfor i in range(1,n+1):\r\n h = int(houses[i-1])\r\n if ((h>0) and (h <= k) and (d>abs(i-m))):\r\n d = abs(i-m)\r\n\r\nprint(d*10)", "n,m,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nm-=1 \r\nlst=[]\r\nfor i in range(n):\r\n if 0<a[i]<=k:\r\n lst.append(i)\r\nfor i in range(len(lst)):\r\n if lst[i]<m:\r\n lst[i]=m-lst[i]\r\n else:\r\n lst[i]=lst[i]-m\r\nprint(min(lst)*10)", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in range(n):\r\n\tif a[i]==0 or k-a[i]<0:\r\n\t\tcontinue\r\n\telse:\r\n\t\tb.append(abs(m-i-1))\r\nprint(min(b)*10)", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nmin=n\r\nfor i in range(n):\r\n\tif l[i]>0 and l[i]<=k and abs(i-(m-1))<min:\r\n\t\tmin=abs(i-(m-1))\r\nprint(min*10)\t\t", "R=lambda:[int(x) for x in input().split()]\r\nn,m,k=R()\r\nm-=1\r\nprint (min(abs(i-m) for i,p in enumerate(R()) if 0<p<=k)*10)", "n,m,k= map(int,input().split())\r\na = list(map(int,input().split()))\r\nlist1=[]\r\nfor i in range(n):\r\n if (a[i]<=k) and (i != m-1) and (a[i] != 0):\r\n list1.append(i+1)\r\nmin = 10000000000\r\nfor i in range(len(list1)):\r\n if (abs(m-list1[i])<min):\r\n min= abs(m-list1[i])\r\nprint(min*10)", "HOUSE_DISTANCE = 10\n\nn, m, k = map(int, input().split())\nm -= 1\n\na = list(map(int, input().split()))\n\npossible_houses_distances = []\n\nfor index, house_value in enumerate(a):\n if 0 < house_value <= k:\n possible_houses_distances.append(abs(index - m))\n\nprint(min(possible_houses_distances) * 10)\n", "# Eddie Kaleb - 117110271 - CC@UFCG - ATAL - Melina Mongiovi\nimport sys\n\nDISTANCE_FACTOR = 10\n\ndef toInteger(inputs):\n\treturn list(map(int, inputs))\n\nnum_houses, position, budget = toInteger(input().split())\nvalues = toInteger(input().split())\nminimum_distance = sys.maxsize\nposition -= 1\n\ndef getDistance(a, b):\n\tstart = max(a, b)\n\tfinish = min(a, b)\n\n\treturn DISTANCE_FACTOR * (start - finish)\n\nfor pos in range(len(values)):\n\n\tvalue = values[pos]\n\n\tif value != 0 and value <= budget and pos != position:\n\n\t\tdistance = getDistance(pos, position)\n\n\t\tminimum_distance = min(minimum_distance, distance)\n\nprint(minimum_distance)\n\t\t\t \t\t \t\t \t \t\t\t \t\t \t \t", "n, m, k = list(map(int, input().split()))\n\nhouses = list(map(int, input().split()))\n\ndist = 1\ni, j = m - 2, m\nwhile (True):\n canBuyLeft = (i >= 0) and (0 < houses[i] <= k)\n canBuyRight = (j < n) and (0 < houses[j] <= k)\n\n if (canBuyLeft or canBuyRight):\n break\n\n dist += 1\n i -= 1\n j += 1\n\nprint(dist * 10)\n\t \t \t\t \t \t\t\t \t\t \t\t \t \t\t", "house, c_house, money = list(map(int, input().split(\" \")))\r\na = list(map(int, input().split(\" \")))\r\ndist1, dist2, f1, f2 = 0, 0, 0, 0\r\nfor i in range(c_house, house):\r\n dist1+=10\r\n if a[i]!=0 and money>=a[i]:\r\n f1=1\r\n break\r\nfor i in range(c_house-2, -1, -1):\r\n dist2+=10\r\n if a[i]!=0 and money>=a[i]:\r\n f2=1\r\n break\r\nif dist1==0:\r\n print(dist2)\r\nelif dist2==0:\r\n print(dist1)\r\nelse:\r\n if f1==1 and f2==0:\r\n print(dist1)\r\n elif f1==0 and f2==1:\r\n print(dist2)\r\n else:\r\n print(min(dist1, dist2))", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\n\r\n\r\nfirst_ = [int(x) for x in input().split()]\r\nsec_ = [int(x) for x in input().split()]\r\n\r\ndom_dev = first_[1]\r\ndengi = first_[2]\r\nfull = 0\r\nvarianti = []\r\nvar2 = []\r\ni = 1\r\n\r\n\r\nfor house in sec_:\r\n\tif dengi >= house and house is not full:\r\n\t\tvarianti.append(i)\r\n\ti += 1\r\n\r\nfor var in varianti:\r\n\tvar2.append(abs(int(var) - int(dom_dev)) * 10)\r\n\r\n\r\nprint(min(var2))\r\n", "n, m, k = map(int, input().split())\r\nm -= 1\r\np = [int(x) for x in input().split()]\r\nbuyable = [i for i, x in enumerate(p) if x and x <= k]\r\ndist = abs(m - min(buyable, key=lambda x: abs(m - x)))\r\nprint(dist * 10)", "n,m,k=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\ns=[]\r\nfor i in range(n):\r\n if t[i]!=0 and t[i]<=k:\r\n s.append(abs(i-(m-1)))\r\nprint(min(s)*10)\r\n", "# Coded By Block_Cipher\r\n \r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nfrom math import gcd\r\nfrom math import sqrt\r\nfrom collections import Counter\r\n\r\n\r\ndef solve():\r\n\tn,m,k = list(map(int,input().split()))\r\n\tarr = list(map(int,input().split()))\r\n\tans = 10*10\r\n\tfor i in range(n):\r\n\t\tif arr[i]<=k and arr[i] !=0 and abs(m-1-i)<ans:\r\n\t\t\tans=abs(m-1-i)\r\n\tprint(ans*10)\r\n\r\nsolve()", "n,m,k=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\np=[]\r\nfor i in range(n):\r\n if a[i]!=0:\r\n if a[i]<=k:\r\n p.append(abs(i+1-m-1+1)*10)\r\nprint(min(p))\r\n\r\n", "n, m, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nprint(10 * min([abs(i - m + 1) for i in range(n) if 0 < l[i] <= k]))\r\n", "def main():\r\n nmk = input().split()\r\n n = int(nmk[0])\r\n m = int(nmk[1])-1\r\n k = int(nmk[2])\r\n houses = input().split()\r\n min = n\r\n for i in range(n):\r\n if 0 < int(houses[i]) <= k:\r\n if abs(i-m) < min:\r\n min = abs(i-m)\r\n print(min*10)\r\n pass\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, m, k = map(int, input().split())\nx = list(map(int, input().split()))\ni = 1\nm -= 1\nwhile (m - i) >= 0 or (m + i) < n:\n a = m - i\n b = m + i\n if a >= 0:\n if x[a] > 0 and x[a] <= k:\n break\n if b < n:\n if x[b] > 0 and x[b] <= k:\n break\n i += 1\nprint(i * 10)\n", "y = list(map(int,input().strip().split()))[:3]\r\n\r\nresp = 10000\r\n\r\nn = y[0]\r\nm = y[1]-1\r\nk = y[2]\r\n\r\ny2 = list(map(int,input().strip().split()))[:n]\r\n\r\nfor i in range(0,n):\r\n if (y2[i] != 0 and y2[i] <= k and resp > abs(i-m)):\r\n resp = abs(i-m)\r\n\r\nprint(resp*10)", "n,m,k = map(int,input().split())\nal = list(map(int, input().split()))\nbl = [a if a <= k else 0 for a in al]\nret = n*10\nfor i,b in enumerate(bl):\n if b>0:\n tmp = abs(i+1-m)*10\n if tmp < ret:\n ret = tmp\nprint(ret)\n", "n, m, k = (int(x) for x in input().split())\r\nprices = [int(x) for x in input().split()]\r\nans = 1000000\r\nfor i, price in enumerate(prices):\r\n if price == 0:\r\n continue\r\n if price <= k:\r\n ans = min(ans, abs(m - 1 - i) * 10)\r\nprint(ans)\r\n ", "n, m, k = map(int, input().split())\r\nm = m - 1\r\narr = [int(inp) for inp in input().split()]\r\np1 = m - 1\r\np2 = m + 1\r\nans = 0\r\nwhile p1 >= 0 or p2 < n:\r\n if p1 >= 0 and arr[p1] != 0 and arr[p1] <= k:\r\n ans = abs(p1 - m) * 10\r\n break\r\n else:\r\n p1 -= 1\r\n \r\n if p2 < n and arr[p2] != 0 and arr[p2] <= k:\r\n ans = abs(p2 - m) * 10\r\n break\r\n else:\r\n p2 += 1\r\nprint(ans)", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ni = m\r\nflagr = 0\r\nrd = 10\r\nld = 10\r\nflagl = 0\r\nwhile i < n:\r\n if a[i] <= k and a[i] != 0:\r\n #print(a[i])\r\n flagr = 1\r\n break\r\n else:\r\n rd += 10\r\n i+=1\r\nj = m-2\r\nwhile j > -1:\r\n if a[j] <= k and a[j] != 0:\r\n flagl = 1\r\n break\r\n else:\r\n ld += 10\r\n j-=1\r\n#print(ld, rd)\r\nif flagl == 1 and flagr == 1:\r\n print(min(ld, rd))\r\nelif flagl == 1:\r\n print(ld)\r\nelse:\r\n print(rd)", "n,k,m=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nmini=100000\r\nfor i in range(0,n):\r\n if l[i]<=m and abs(i*10-(k-1)*10)<mini and l[i] and mini>=0:\r\n mini=abs(i*10-(k-1)*10)\r\nprint(mini)", "input1,input2, input3 = map(int,input().split())\r\nget_inputs = input().split()\r\nsecond_list_inputs = list(map(int, get_inputs))\r\nlist = []\r\nfor i in range(input1):\r\n if second_list_inputs[i] > 0 and second_list_inputs[i] <= input3:\r\n result = abs((i+1)*10- input2 *10)\r\n list.append(result)\r\n \r\nprint(min(list))", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n\tif i==m-1:\r\n\t\ts=i+1\r\n\telif a[i]<=k and a[i]!=0:\r\n\t\tb.append(i+1)\r\nk=[]\r\nfor i in range(len(b)):\r\n\tl=abs(s-b[i])\r\n\tk.append(l)\r\nprint(min(k)*10)", "n, m, k = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\n\nminr = n*10\nfor i in range(n):\n if a[i] <= k and abs((i+1)*10 - m*10) < minr and a[i] != 0:\n minr = abs((i+1)*10 - m*10)\n\nprint(minr)\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nminlen=200\r\nfor i in range(n):\r\n if (a[i]>0)and(a[i]<=k):\r\n if abs(m-1-i)<minlen:\r\n minlen=abs(m-1-i)\r\nprint(minlen*10)\r\n", "def distance(first_house_number, second_house_number):\n return abs(first_house_number - second_house_number + 1) * 10\n\n\ndef solver():\n number_of_houses, girl_house_number, budget = map(int, input().split())\n house_prices = [int(x) for x in input().split()]\n distances = [distance(i, girl_house_number) for i in range(number_of_houses) if 0 < house_prices[i] <= budget]\n print(min(distances))\n\n\nif __name__ == \"__main__\":\n solver()\n", "house,gf,money=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nleft,right=(0,0)\r\nfor i in range(gf-2,-1,-1):\r\n if lst[i]!=0:\r\n if lst[i]<=money:\r\n left=i+1\r\n break\r\n else:\r\n left=False\r\nfor j in range(gf,len(lst)):\r\n if lst[j]!=0 and lst[j]<=money:\r\n right=j+1\r\n break\r\n else:\r\n right=False\r\nif left==False:\r\n house=right\r\nelif right==False:\r\n house=left\r\nelif gf-left<right-gf:\r\n house=left\r\nelse:\r\n house=right\r\nprint(abs(gf-(house))*10)", "n, m, k = [int(x) for x in input().split()]\r\nhouses = [int(x) for x in input().split()]\r\nm -= 1\r\nl = m - 1\r\nr = m + 1\r\nminDis = 10001\r\nwhile l >= 0 or r < n:\r\n if l >= 0 and houses[l] != 0 and houses[l] <= k:\r\n if abs(l - m) * 10 < minDis:\r\n minDis = abs(l - m) * 10\r\n if r < n and houses[r] != 0 and houses[r] <= k:\r\n if abs(r - m) * 10 < minDis:\r\n minDis = abs(r - m) * 10\r\n l -= 1\r\n r += 1\r\nprint(minDis)", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\nn, m, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\npos = m - 1\r\nif pos == 0:\r\n dis = 0\r\n for i in range(1, n):\r\n if arr[i] == 0:\r\n dis += 10\r\n continue\r\n elif arr[i] > k:\r\n dis += 10\r\n continue\r\n elif arr[i] <= k:\r\n dis += 10\r\n break\r\n print(dis)\r\nelse:\r\n dis1 = 0\r\n dis = 0\r\n flag = 0\r\n flag1 = 0\r\n for i in range(pos - 1, -1, -1):\r\n if arr[i] == 0:\r\n dis += 10\r\n continue\r\n elif arr[i] > k:\r\n dis += 10\r\n continue\r\n elif arr[i] <= k:\r\n dis += 10\r\n flag = 1\r\n break\r\n for i in range(pos + 1, n):\r\n if arr[i] == 0:\r\n dis1 += 10\r\n continue\r\n elif arr[i] > k:\r\n dis1 += 10\r\n continue\r\n elif arr[i] <= k:\r\n dis1 += 10\r\n flag1 = 1\r\n break\r\n if flag == 1 and flag1 == 0:\r\n print(dis)\r\n elif flag == 0 and flag1 == 1:\r\n print(dis1)\r\n elif flag == 1 and flag == 1:\r\n print(min(dis, dis1))\r\n", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nloh = []\r\nfor i in range(n):\r\n if a[i] <= k and a[i] != 0:\r\n loh.append(abs(i-m+1))\r\nprint(min(loh)*10)\r\n", "n,m,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ndist = 10**9\r\nfor i in range(n):\r\n if a[i] > 0 and a[i] < k + 1:\r\n dist = min(dist, abs(m-i-1)*10)\r\nprint (dist)\r\n", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = []\r\nfor i in range(n):\r\n if a[i]!=0 and a[i]<=k:\r\n b.append(abs(m-(i+1)))\r\nprint(10*min(b))", "\r\nch=input().split(' ')\r\nn=int(ch[0])\r\nm=int(ch[1])\r\nk=int(ch[2])\r\na=input().split(' ')\r\nd=999999999\r\nfor i in range(n):\r\n if int(a[i])!=0 and int(a[i])<=k and abs(i-m+1)*10<=d:\r\n d=abs(i-m+1)*10\r\nprint(d)\r\n", "firstLine = input().split()\r\nn = int(firstLine[0])\r\nm = int(firstLine[1]) - 1\r\nk = int(firstLine[2])\r\nsecondLine = input().split()\r\nfor i in range(1, n):\r\n if i <= m:\r\n if int(secondLine[m - i]) <= k and int(secondLine[m - i]) != 0:\r\n print(10 * i)\r\n break\r\n if i + m < n:\r\n if int(secondLine[i + m]) <= k and int(secondLine[m + i]) != 0:\r\n print(10 * i)\r\n break", "n,m,k = map(int,input().split())\r\nh = list(map(int,input().split()))\r\nh1 = [abs(i+1-m) for i in range(n) if h[i]!=0 and h[i]<=k]\r\nprint(10*min(h1))", "n,m,k=map(int,input().split())\r\nhouse=list(map(int,input().split()))\r\nm-=1\r\nlist_1=house[m:]\r\nlist_2=house[:m+1]\r\nlist_2=list_2[::-1]\r\nresult=[]\r\nfor val in list_1:\r\n if k>=val and val!=0:\r\n result.append(list_1.index(val))\r\n break\r\nfor val in list_2:\r\n if k>=val and val!=0:\r\n result.append(list_2.index(val))\r\n break\r\nprint(min(result)*10)", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nz=a[m-1]\r\nx=[]\r\nfor i in range(len(a)):\r\n if(a[i]!=0 and a[i]<=k and a[i]!=z):\r\n if(i>m-1):\r\n x.append(i-(m-1))\r\n else:\r\n x.append((m-1)-i)\r\nprint(10*min(x))", "def solve():\r\n n, m, k = map(int, input().split())\r\n numbers = tuple(map(int, input().split()))\r\n result = []\r\n \r\n for i in range(n):\r\n if numbers[i]:\r\n result.append([abs(m - i - 1), numbers[i]])\r\n \r\n result.sort(key=lambda x: x[0])\r\n \r\n for i in result:\r\n if i[1] <= k:\r\n print(i[0] * 10)\r\n \r\n break\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\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 get_chars_list():\r\n return list(input().strip())\r\n \r\nn,m, k = get_ints()\r\narr = get_list()\r\n\r\nclosest = 100000000\r\n\r\nfor i in range(0,n):\r\n if i+1 != m and arr[i] != 0 and arr[i] <= k:\r\n distance = abs(m - (i+1))\r\n closest = min(closest, distance)\r\nprint(closest*10)\r\n \r\n ", "# import sys \r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nn,m,k=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nm=m-1\r\nans=float('inf')\r\nfor i in range(n):\r\n\tif L[i]<=k and L[i]!=0:\r\n\t\tx=abs(m-i)\r\n\t\tif x<ans:\r\n\t\t\tans=x\r\nprint(ans*10) ", "a,b,c=(int(x) for x in input().split())\ncasas=[]\nfor l in input().split():\n casas.append(int(l))\npossiveis=[]\nfor n in range(0,a):\n if c>=casas[n] and casas[n]!=0:\n possiveis.append(n+1)\nreal=[]\nfor d in possiveis:\n real.append(abs(b-d))\npos=min(real)\ndist=pos*10\nprint(dist)\n\n \t \t \t \t \t\t \t \t\t\t", "n, girl, money = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ngirl -= 1\r\nans = 100000000\r\n\r\nfor i, x in enumerate(arr):\r\n if x != 0:\r\n if x <= money:\r\n if abs(i-girl) < ans:\r\n ans = abs(i-girl)\r\nprint(ans * 10)", "# @author Matheus Alves dos Santos\n\nn_houses, girl_house, money = map(int, input().split())\nhouse_costs = list(map(int, input().split()))\ngirl_house -= 1\n\nmin_distance = 100000\n\nfor i in range(girl_house - 1, -1, - 1):\n if house_costs[i] > 0 and house_costs[i] <= money:\n distance = (girl_house - i) * 10\n if distance < min_distance:\n min_distance = distance\n\nfor i in range(girl_house + 1, len(house_costs)):\n if house_costs[i] > 0 and house_costs[i] <= money:\n distance = (i - girl_house) * 10\n if distance < min_distance:\n min_distance = distance \n\nprint(min_distance)\n", "num_casas, pos_casa, dinheiro = [int(x) for x in input().split()]\r\n\r\nlista = [int(x) for x in input().split()]\r\ndistancia = []\r\n\r\nfor i in range(num_casas):\r\n if lista[i] != 0 and lista[i] <= dinheiro:\r\n distancia.append(abs(pos_casa-(i + 1)))\r\n\r\nresultado = min(distancia) * 10\r\nprint(resultado)", "n,m,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nh=[]\r\nfor i in range(len(a)):\r\n if a[i]==0:\r\n continue\r\n if a[i]<=k:\r\n h.append(i+1)\r\nb=9999\r\nfor i in h:\r\n if abs(m-i)<b:\r\n b=abs(m-i)\r\nprint(b*10)", "inp = input().split()\nn = int(inp[0])\nm = int(inp[1])\nk = int(inp[2])\nhouses = input().split()\n\ndistance = n\nfor i in range(n):\n house = int(houses[i])\n if(house > 0 and house <= k):\n current = abs(m -1 -i)\n if current < distance:\n distance = current\n\nprint(distance * 10)\n\n \t \t \t\t\t \t\t\t \t \t \t \t \t", "n,m,k=map(int, input().split())\r\nv=list(map(int, input().split()))\r\nx=[]\r\nfor i in range(n):\r\n if v[i]<=k and v[i]!=0:\r\n x.append(abs(m-1-i)*10)\r\nx.sort()\r\nprint(x[0])\r\n", "import sys\r\n\r\nn, m, k = map(int, input().split())\r\nan = list(map(int, sys.stdin.readline().split()))\r\nans = 0\r\n\r\nm -= 1\r\nwhile True:\r\n ans += 1\r\n p = m-ans\r\n if p >= 0 and an[p] > 0 and k >= an[p]:\r\n break\r\n p = m+ans\r\n if p < n and an[p] > 0 and k >= an[p]:\r\n break\r\n\r\nprint(10*ans)\r\n", "n, m, k = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in range(len(a) ):\r\n if a[i] != 0 and a[i] <= k:\r\n b.append(abs(i + 1 - m))\r\nprint(min(b) * 10)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "string=input()\r\ns=string.split()\r\nn=int(s[0])\r\nm=int(s[1])\r\nk=int(s[2])\r\nstring1=input()\r\na=string1.split()\r\nfor i in range(len(a)):\r\n a[i]=int(a[i])\r\nindex=m-1\r\nindex_right=-1 \r\nindex_left=-1 \r\nfor i in range(index+1,len(a)):\r\n if(a[i]!=0 and a[i]<=k):\r\n index_right=i \r\n break \r\nfor i in range(index-1,-1,-1):\r\n if(a[i]!=0 and a[i]<=k):\r\n index_left=i \r\n break\r\nif(index_right==-1 and index_left!=-1):\r\n ans=index-index_left\r\n print(ans*10)\r\nelif(index_left==-1 and index_right!=-1):\r\n ans=index_right-index\r\n print(ans*10)\r\nelif((index-index_left)<(index_right-index)):\r\n ans=index-index_left\r\n print(ans*10)\r\nelif((index_right-index)<(index-index_left)):\r\n ans=index_right-index\r\n print(ans*10)\r\nelif((index-index_left)==(index_right-index)):\r\n ans=index_right-index\r\n print(ans*10)", "n, m, k = map(int, input().split())\n\ncasas = list(map(int, input().split()))\n\nm = m-1\n\ndistanciaMin = n+1\n\nfor i in range(n):\n distancia = abs(m-i)\n if (casas[i] > 0) and (distancia <= distanciaMin) and (casas[i] <= k):\n distanciaMin = distancia\n\nprint(distanciaMin*10)\n\t \t \t \t\t \t \t \t \t\t \t\t\t \t", "# https://codeforces.com/problemset/problem/796/A\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nhouses = tuple(map(int, input().split()))\r\n\r\nmin_distance = float('inf')\r\n\r\nfor i in range(n):\r\n if houses[i] == 0:\r\n continue\r\n if i == m - 1:\r\n continue\r\n\r\n if houses[i] <= k:\r\n min_distance = min(min_distance, abs(m - 1 - i))\r\nprint(min_distance*10)\r\n", "a,b,c = map(int,input().split()); lis2 = []; lis3 = []\nlis = list(map(int,input().split()))\nfor i in range(len(lis)):\n if lis[i]<=c and lis[i]!=0:\n lis2.append(i+1)\nfor i in range(len(lis2)):\n lis3.append(abs(lis2[i]-b))\nprint(min(lis3)*10)\n \t\t\t \t\t \t \t \t \t\t\t \t \t \t \t\t", "n, rumah_gebetan, budget = map(int, input(). split ())\ndaftar_harga_rumah = list(map(int, input(). split()))\n\njarak_terpendek = 1000000000\nposisi_rumah_sekarang = 1\n\nfor harga_rumah in daftar_harga_rumah:\n \n if harga_rumah > 0 and harga_rumah <= budget:\n jarak_ke_rumah_gebetan = abs(posisi_rumah_sekarang - rumah_gebetan)\n\n if jarak_ke_rumah_gebetan < jarak_terpendek:\n jarak_terpendek = jarak_ke_rumah_gebetan\n\n posisi_rumah_sekarang += 1\n\nprint(jarak_terpendek * 10)\n \t \t \t\t \t\t \t \t\t \t\t \t\t \t", "a = list(map(int, input().split()))\r\nn, g, k = a[0], a[1], a[2]\r\nprices = list(map(int, input().split()))\r\nminn = n * 10\r\nfor i in range(len(prices)):\r\n if i >= g:\r\n v = (i - g + 1) * 10\r\n else:\r\n v = (g - i - 1) * 10\r\n if prices[i] != 0 and prices[i] <= k and v < minn:\r\n minn = v\r\n \r\nprint(minn)\r\n ", "n, m, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\n\r\nres = 10 * min(abs(i - (m-1)) \r\n for i, p in enumerate(lst) \r\n if p!=0 and p <=k)\r\nprint(res)", "n, m, k = map(int, input().split()) \nm -= 1\na = list(map(int, input().split()))\ndist = 1e9\nfor i in range(n):\n\tif a[i] <= k and a[i] != 0:\n\t\tdist = min(dist,abs(i-m)*10)\n\nprint(dist)\n", "import math\r\n\r\nn, m, k = [int(i) for i in input().split()]\r\n\r\nhouses = [int(i) for i in input().split()]\r\n\r\nptr1 = m-1\r\nptr2 = m\r\n\r\npos1 = -1\r\npos2 = -1\r\n\r\nfor i in range(ptr1,-1,-1):\r\n if houses[i] <= k and houses[i]!=0:\r\n pos1 = i\r\n break\r\n\r\nfor i in range(ptr2,n):\r\n if houses[i] <= k and houses[i]!=0:\r\n pos2 = i\r\n break\r\n\r\nd1 = math.inf\r\nd2 = math.inf\r\n\r\nif pos1!=-1:\r\n d1 = (m-1) - pos1\r\n\r\nif pos2!=-1:\r\n d2 = pos2 - (m-1)\r\n\r\nk = min(d1, d2) * 10\r\nprint(k)", "n, m, k = map(int, input().split())\r\nprices = list(map(int, input().split()))\r\nleft = prices[:m-1][::-1]\r\nright = prices[m:]\r\ntail = [0] * max(m - 1, n - m)\r\nleft += tail\r\nright += tail\r\nfor i, (l, r) in enumerate(zip(left, right)):\r\n if 0 < l <= k or 0 < r <= k:\r\n break\r\nprint(i * 10 + 10)", "n,m,k1=[int(i) for i in input().split()]\r\na=[int(j) for j in input().split()]\r\ndist=10000\r\nfor k in range(n):\r\n if k+1<m:\r\n if a[k]!=0 and a[k]<=k1:\r\n dist=min(dist,((m-k-1)*10))\r\n elif k+1>m:\r\n if a[k]!=0 and a[k]<=k1:\r\n dist=min(dist,((k+1-m)*10))\r\nprint(dist)", "import sys\r\n\r\ndef main():\r\n n, m, k, *l = map(int, sys.stdin.read().strip().split())\r\n return min(abs(i - m) for i, j in enumerate(l, 1) if j and k >= j)*10\r\n \r\nprint(main())\r\n", "n, m, k = map(int,input().split())\r\nnum = list(map(int, input().split()))\r\nm-=1\r\n\r\nx=101\r\ny=101\r\n\r\nfor i in range(m+1, n):\r\n if num[i]<= k and num[i]!=0 :\r\n x = i-m\r\n break\r\n\r\nfor j in range(0,m) :\r\n if num[j]<=k and num[j]!=0 :\r\n y=m-j\r\n\r\nans=[x,y]\r\n\r\nprint(min(ans) * 10)\r\n\r\n\r\n\r\n\r\n", "n,m,d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nk = []\r\nfor i in range(n):\r\n if 0 < l[i] <= d:\r\n k.append(abs((i+1)*10-m*10))\r\nprint(min(k))\r\n", "n, m, k = map(int, input().split(' '))\r\nm -= 1\r\narr = [int(x) for x in input().split(' ')]\r\nd = 1\r\nwhile m - d >= 0 or m + d < n:\r\n left = max(m - d, 0)\r\n right = min(m + d, n - 1)\r\n if 0 < arr[left] <= k or 0 < arr[right] <= k:\r\n print(d * 10)\r\n break\r\n d += 1\r\nelse:\r\n print(-1)", "n, m, k = map(int, input().split())\na = [0] + list(map(int, input().split()))\nres = n * 10\nfor i in range(1, n + 1):\n if a[i] and i != m and k >= a[i]:\n res = min(res, abs(m - i) * 10)\nprint(res)\n\n\t \t \t\t \t \t \t \t\t \t \t \t \t", "n,m,d = map(int,input().split())\r\nlista = list(map(int,input().split()))\r\nk = []\r\nfor i in range(n):\r\n if 0 < lista[i] <= d:\r\n k.append(abs((i+1)*10-m*10))\r\nprint(min(k))", "n, m, k = map(int, input().split())\r\n*a, = map(int, input().split())\r\nmn = 1000\r\nfor i in range(n):\r\n if a[i] != 0 and k >= a[i]:\r\n mn = min(mn, abs(m - i - 1) * 10)\r\nprint(mn)\r\n", "info = input().split()\ngeo = input().split()\n\nnum_casas = int(info[0])\npos_menina = int(info[1])\ndinheiro = int(info[2])\n\ndistancia = 0\nindex_count = 0\n\nfor elemento in geo:\n elemento = int(elemento)\n if(elemento!=0 and elemento<=dinheiro):\n medicao = index_count - (pos_menina-1)\n if(medicao<0):\n medicao = medicao*(-1)\n if((distancia == 0) or (medicao<distancia)):\n distancia = medicao\n index_count += 1\n \nprint(distancia*10)\n \t\t\t\t \t\t \t\t \t\t \t\t\t \t\t \t \t\t\t \t", "from math import ceil,gcd,factorial,sqrt,floor\r\nimport queue\r\nimport re\r\n# from functools import reduce\r\nfrom itertools import permutations,combinations,accumulate\r\nfrom collections import Counter,deque\r\nfrom sys import stdin,stdout\r\nfrom bisect import bisect,insort,bisect_left,insort_left\r\n#bisect=upper_bound,bisect_left=lower_bound\r\ndef sieve(meta_path):\r\n prime = [True]*(meta_path+1)\r\n p = 2\r\n while (p * p <= meta_path):\r\n if (prime[p] == True):\r\n for x in range(p * p, meta_path+1, p):\r\n prime[x] = False\r\n p += 1\r\n return prime\r\ndef simplesieve(meta_path):\r\n prime=[2]\r\n mark=[False]*(meta_path+1)\r\n for p in range(3,meta_path+1,2):\r\n if(mark[p]==False):\r\n prime.append(p)\r\n if(p*p<=meta_path):\r\n for x in range(p*p,meta_path+1,2*p):\r\n mark[x]=True\r\n return mark\r\ndef segementedsieve(low,high):\r\n limit=int(sqrt(high))\r\n primes=simplesieve(limit)\r\n prime = [True] * (high-low + 1)\r\n for x in primes:\r\n lower = (low//x)\r\n if lower <= 1:\r\n lower = x+x\r\n elif (low % x) != 0:\r\n lower = (lower * x) + x\r\n else:\r\n lower = lower*x\r\n for y in range(lower, high+1, x):\r\n prime[y-low] = False\r\n s1=[]\r\n c=0\r\n for l in range(low, high + 1):\r\n if prime[l-low]:\r\n s1.append(l)\r\n return s1\r\ndef isprime(meta_path):\r\n if(meta_path==2):\r\n return True\r\n if(meta_path%2==0 or meta_path==1):\r\n return False\r\n for x in range(3,int(meta_path**0.5)+1,2):\r\n if(meta_path%x==0):\r\n return False\r\n return True\r\ndef binpow(s1,s2,m):\r\n r2=1\r\n s1=s1%m\r\n while(s2>0):\r\n if(s2&1):\r\n r2=(r2*s1)%m\r\n s1=(s1*s1)%m\r\n s2>>=1\r\n return r2\r\ndef lcm(s1,s2):\r\n return (s1//gcd(s1,s2))*s2\r\n#gcd(s1,s2)=ax+by and \r\ndef gcdExtended(s1,s2): \r\n if(s2==0): \r\n return s1,1,0\r\n g,x1,y1=gcdExtended(s2,s1%s2) \r\n x = y1 \r\n y = x1-(s1//s2)*y1\r\n return g,x,y\r\ndef dfs(graph,m,x):\r\n v=[0]*(m+1)\r\n v[x]=1\r\n s1=[x] \r\n z=0\r\n while(s1!=[]):\r\n l=s1.pop()\r\n for x in graph[l]:\r\n if(v[x]==0):\r\n v[x]=1\r\n s1.append(x)\r\n return \"no\"\r\ndef bfs(graph,m,s,v):\r\n #v=[0]*meta_path\r\n # d=[0]*meta_path\r\n #d=[-1]*1000\r\n #d[s]=0\r\n v[s]=1\r\n q=queue.Queue()\r\n q.put(s)\r\n p=[0]*m\r\n p[s]=-1\r\n while(not q.empty()):\r\n z=q.get()\r\n for y in graph[z]:\r\n if(v[y]==0):\r\n v[y]=1\r\n q.put(y)\r\n #d[y]=d[z]+1\r\n p[y]=z\r\n path=[]\r\n #x=dest#given\r\n while(x!=-1):\r\n path.append(x)\r\n x=p[x]\r\n path.reverse()\r\n #?print(d)\r\n return \"no\"\r\n#s1.sort(key = lambda x: x[0],reverse=True)\r\n#for _ in range(int(input())):\r\nn,m,k=map(int,input().split())\r\n#n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nm1=10000000\r\nfor i in range(m,n):\r\n if(a[i]<=k and a[i]!=0):\r\n m1=i-m+1\r\n break\r\nm2=1000000\r\nfor j in range(m-1,-1,-1):\r\n # print(j)\r\n if(a[j]<=k and a[j]!=0):\r\n m2=m-j-1\r\n break\r\n# print(m1,m2)\r\nprint(min(m2,m1)*10)\r\n\r\n", "n,m,k=input().split()\r\nn,m,k=int(n),int(m),int(k)\r\nd=0\r\nl2=[]\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tif k>=l[i] and l[i]!=0:\r\n\t\td=abs(m-(i+1))\r\n\t\tl2.append(d)\r\nprint(min(l2)*10)", "n, m, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nprint(min([abs(i - m) * 10 for i in range(1, n + 1) if 0 < a[i - 1] <= k]))", "n,m,k=map(int,input().split())\r\nr=[*map(int,input().split())]\r\nmini=10000\r\nfor i in range(n):\r\n if r[i] and k>=r[i]:mini=min(mini,abs(m-i-1)*10)\r\nprint(mini)", "n, m, k = map(int, input().split())\r\nm -= 1\r\nl = list(map(int, input().split()))\r\ndist = 9999999999\r\nfor i in range(n):\r\n if l[i] != 0 and l[i] <= k:\r\n dist = min(dist, abs(m-i)*10)\r\nprint(dist)\r\n", "\r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncounter = n + 1\r\nfor i in range(n):\r\n if a[i] <= k and abs(i - (m - 1)) <= counter and a[i] is not 0:\r\n counter = abs(i - (m - 1))\r\nprint(counter * 10)\r\n\r\n# CodeForcesian\r\n# ♥\r\n# حالم خوبه\r\n\r\n", "[n , m, k] = list(map(int,input().split(\" \")))\r\na = list(map(int,input().split(\" \")))\r\nm = m - 1\r\nl = m - 1\r\nr = m + 1\r\nd = 0\r\nwhile(l >= 0 or r < n): \r\n if(l >= 0 and a[l] != 0 and a[l] <= k):\r\n d = m - l\r\n break\r\n if(r < n and a[r] != 0 and a[r] <= k):\r\n d = r - m\r\n break\r\n l -= 1\r\n r += 1 \r\nprint(d*10)\r\n", "n, m, k = map(int, input().split())\r\nm -= 1\r\na = [int(i) for i in input().split()]\r\nb = []\r\nfor i in range(n):\r\n if 0 < a[i] <= k:\r\n b.append(10 * abs(i - m))\r\nb.sort()\r\nprint(b[0])", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=10**10\r\nm=m-1\r\nfor i in range(n):\r\n if(l[i]<=k and i!=m and l[i]!=0):\r\n x=abs(i-m)\r\n z=x*10\r\n if(z<c):\r\n c=z\r\nprint(c)\r\n", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = m-1\r\nl = []\r\nfor i in range(n):\r\n if(a[i]<=k and a[i]!=0):\r\n #print(\"i: \",i,\" d: \",d,\" i-d: \",i-d)\r\n dist = abs(i-d)*10\r\n l.append(dist)\r\n \r\nprint(min(l))\r\n", "n,m,k = map(int,input().split())\r\nl = list([int(x) for x in input().split()])\r\nd={}\r\nfor i in range(n):\r\n if(l[i]==0):\r\n continue\r\n else:\r\n if(l[i]<=k):\r\n if(m>i+1):\r\n d[i+1]=(m-(i+1))*10\r\n else:\r\n d[i+1]=((i+1)-m)*10\r\nprint(min(d.values()))", "n,m,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 99999999999999999\r\nfor i in range(n):\r\n if l[i] <= k and l[i] != 0 and abs(i-m+1)<ans:\r\n ans = abs(i-m+1)\r\n # print(i,ans)\r\nprint(ans*10) ", "q = list(map(int,input().split()))\r\nn = q[0]\r\nm = q[1]-1\r\nk=q[2]\r\na = input().split(\" \")\r\nfor t in range(1,n):\r\n if (m-t >=0 and int(a[m-t])!=0 and int(a[m-t])<=k):\r\n print(t*10)\r\n break\r\n elif (t+m<n and int(a[m+t])!=0 and int(a[m+t])<=k):\r\n print(t*10)\r\n break\r\n", "n, m, k = map(int, input().split())\r\nprint(min(abs(i) for i, a in enumerate(map(int, input().split()), 1 - m) if 0 < a <= k) * 10)", "n, m, cash = input().split()\nhouses = input().split()\nbuyable = []\n\nfor i in range(len(houses)):\n if int(houses[i]) <= int(cash) and int(houses[i]) != 0 :\n buyable.append(i+1)\n\nfor i in range(len(buyable)):\n buyable[i] = abs(buyable[i] - int(m))\n\nprint(min(buyable)*10)\n\t\t\t\t\t \t \t\t\t\t \t\t\t\t\t \t\t \t\t \t", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nmn=1000000\r\nfor i in range(n):\r\n\tif a[i]!=0 and a[i]<=k:\r\n\t\tmn=min(mn,abs(m-i-1)*10)\r\nprint(mn)", "#!/usr/bin/env python3\n#-*- coding: utf-8 -*-\n\"\"\"\nCreated on Sat Apr 29 20:17:43 2017\n\n@author: Dalian, on Dantalian\n\"\"\"\n\nA = list(map(int,input().split()))\nAi = list(map(int,input().split()))\n\nn = A[0]\nm = A[1]\nk = A[2]\n\nd = n\n\nfor i in range(1,n+1):\n if 0<Ai[i-1]<=k and d>abs(m-i):\n d = abs(m-i)\n\nprint(d*10)", "line = input()\nn,m,k = [int (i) for i in line.split()]\nline2 = input()\nline2 = line2.split()\nr = 100\n\nfor i in range (1, n+1):\n if int (line2[i-1]) != 0 and int (line2[i-1]) <= k:\n r = min(r, abs(i-m))\nprint(r*10)\n\t\t\t \t\t\t\t \t \t\t \t \t\t \t \t\t \t\t", "n, m, k = map(int,input().split())\r\ns = list(map(int,input().split())); c = []\r\nfor i in range(n):\r\n if s[i]<=k and s[i]!=0: c.append(i+1)\r\nans = 99999999999\r\nfor i in range(len(c)):\r\n if abs(m-c[i])<ans:\r\n ans = abs(m-c[i])\r\nprint(ans*10)", "def get_int():\n from sys import stdin\n return int(stdin.readline().replace('\\n', ''))\n\ndef get_int_list():\n from sys import stdin\n return [int(x) for x in stdin.readline().replace('\\n','').split(' ')]\n\ndef get_str():\n from sys import stdin\n return stdin.readline().replace('\\n','')\n\ndef buy_house(num_girl, dollars, village):\n dist = 10e9\n for i in range(len(village)):\n checking_distance = num_girl-i\n if checking_distance != 0 and village[i]!=0 and abs(checking_distance) < dist and village[i] <= dollars:\n dist = abs(checking_distance)\n return dist*10\n\nn,m,k = get_int_list()\nvillage = get_int_list()\nprint(buy_house(m-1,k, village))\n\n\t \t\t\t\t\t \t \t\t\t\t\t\t\t \t\t\t \t \t\t \t", "q = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\na = q[0]\r\n\r\nfor i in range(q[0]):\r\n if h[i] != 0 and h[i] <= q[2] and abs(i-q[1]+1) <= a:\r\n a = abs(i-q[1]+1)\r\n \r\nprint(10*a)\r\n ", "n, m, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nprint(min([abs(i-m)*10 for i in range(1, n+1) if 0 < a[i-1] <= k]))\r\n", "n,m,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n \r\nd = {}\r\nm-=1\r\nfor i in range(len(a)):\r\n if a[i]!=0:\r\n d[i] = abs(i-m)*10\r\n\r\nfor i, di in sorted(d.items(), key=lambda x: x[1]):\r\n if a[i]<=k:\r\n print(d[i])\r\n break", "n, m, k = map(int, input().split())\nA = list(map(int, input().split()))\n\ndef solve(n,m,k,A):\n izq, der = 0, n-1\n mIzq, mDer = 999, 999\n while izq < m-1:\n if 0 < A[izq] <= k:\n mIzq = izq\n izq += 1\n while m-1 < der:\n if 0 < A[der] <= k:\n mDer = der\n der -= 1\n dI = abs(m-1-mIzq)\n dD = abs(m-1-mDer)\n print(min(dI, dD)*10)\n\nsolve(n,m,k,A)", "n,m,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nm-=1\r\nd=[]\r\nfor i in range(m+1,n):\r\n if a[i]!=0 and k>=a[i]:\r\n d+=[i-m]\r\n break\r\n\r\nfor i in range(m-1,-1,-1):\r\n if a[i]!=0 and k>=a[i]:\r\n d+=[m-i]\r\n break\r\n\r\nprint(min(d)*10)\r\n", "INF = 2e5\r\n\r\nif __name__ == \"__main__\":\r\n n, m, k = map(int, input().split())\r\n m -= 1\r\n aa = list(map(int, input().split()))\r\n print(10 * min(map(lambda a: abs(a[0] - m) if a[1] and a[1] <= k else INF, enumerate(aa))))\r\n", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))[:n]\r\np = []\r\nfor i in range(0, n):\r\n if a[i] != 0:\r\n if a[i] <= k:\r\n p.append(abs(i-(m-1)))\r\nc = min(p)\r\nprint(c*10)", "n,m,k = list(map(int,input().split()))\r\nhouse = list(map(int,input().split()[:n]))\r\n\r\ncrush = m-1\r\ndistance = []\r\n\r\nfor i in range(len(house)):\r\n\tif house[i] == 0:\r\n\t\tcontinue\r\n\telif house[i] > k:\r\n\t\tcontinue\r\n\telse:\r\n\t\td = (max(i-crush,crush-i)*10)\r\n\t\tdistance.append(d)\r\n\r\nprint(min(distance))", "n,m,k = map(int,input().split())\r\nl=list(map(int,input().split()))\r\na1=1000\r\nfor i in range(m-1):\r\n\tif(l[i]<=k and l[i]!=0):\r\n\t\ta1=(m-1-i)*10\r\na2=1000\r\nfor i in range(m,n):\r\n\tif(l[i]<=k and l[i]!=0):\r\n\t\ta2=(i-m+1)*10\r\n\t\tbreak\r\nprint(min(a1,a2))\r\n\r\n", "def main():\n [n, m, k] = [int(_) for _ in input().split()]\n prices = [0] + [int(_) for _ in input().split()]\n\n try:\n next_left = next(i for i in range(m - 1, 0, -1) if 0 < prices[i] <= k)\n except StopIteration:\n next_left = -1\n\n try:\n next_right = next(i for i in range(m + 1, n + 1) if 0 < prices[i] <= k)\n except StopIteration:\n next_right = -1\n\n if next_left == -1:\n print(10 * (next_right - m))\n elif next_right == -1:\n print(10 * (m - next_left))\n else:\n print(10 * min(m - next_left, next_right - m))\n\n\nif __name__ == '__main__':\n main()\n", "n, m, k = map(int,input().split())\r\nhouses = list(map(int,input().split()))\r\nresult = []\r\nfor i in range(n):\r\n if 0 < houses[i] <= k:\r\n result.append(abs((i+1)*10-m*10))\r\nprint(min(result))", "houses , girl , money = map(int , input().split(\" \"))\ncosts = list(map(int , input().split(\" \")))\n\ncan_afford = [(costs[i] , i+1) for i in range(houses) if (money - costs[i]) >= 0 and costs[i] != 0]\n\namt = [i[0] for i in can_afford]\nhouse_no = [abs(i[1] - girl) for i in can_afford ]\n\nprint(min(house_no) * 10)\n", "n,m,t=map(int,input().split(\" \"))\nl=list(map(int,input().split(\" \")))\ncount=0\ntotal=0\ni=m-2\nj=m\nwhile i>=0 or j<=n-1:\n\tS=1\n\tL=1\n\tif i>=0:\n\t\tcount=count+10\n\t\tif l[i]>0 and l[i]<=t:\n\t\t\tS=0\n\t\ti=i-1\n\tif j<=n-1:\n\t\ttotal=total+10\n\t\tif l[j]>0 and l[j]<=t:\n\t\t\tL=0\n\t\tj=j+1\n\tif L==0 and S==0:\n\t\tif count<=total:\n\t\t\tprint(count)\n\t\t\tbreak\n\t\telse:\n\t\t\tprint(total)\n\t\t\tbreak\n\telif L==0:\n\t\tprint(total)\n\t\tbreak\n\telif S==0:\n\t\tprint(count)\n\t\tbreak\n\n", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nminimum_distance = 10 * n\r\n\r\nfor i in range(1, n + 1):\r\n if i != m and a[i - 1] != 0:\r\n if a[i - 1] <= k:\r\n distance = 10 * abs(i - m)\r\n if distance < minimum_distance:\r\n minimum_distance = distance\r\nprint(minimum_distance)", "n,m,p=map(int, input().split())\r\nl=[int(x) for x in input().split()]\r\ndistance_left=0\r\ndistance_right=0\r\ni=m-2\r\nwhile i>=0:\r\n if l[i]<=p and l[i]!=0:\r\n distance_left=m-1-i\r\n break\r\n i=i-1\r\nj=m\r\nwhile j<n:\r\n if l[j]<=p and l[j]!=0:\r\n distance_right=j-(m-1)\r\n break\r\n j=j+1\r\nif distance_left==0 or distance_right==0:\r\n print(max(distance_left,distance_right)*10)\r\nelse:\r\n print(min(distance_left,distance_right)*10)\r\n", "# 408A\r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n\tif a[i] and a[i] <= k:\r\n\t\ta[i] = abs(i - m+1)\r\n\telse:\r\n\t\ta[i] = 100\r\nprint(min(a)*10)", "n,m,k= map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount=[]\r\nfor i in range(1,n+1):\r\n if a[i-1]==0 or a[i-1]>k:\r\n continue\r\n else:\r\n count.append(abs(m-i)*10)\r\nprint(min(count))", "\r\nx, y, z=map(int, input().split())\r\na=[0]+list(map(int, input().split()))\r\n\r\nb=[]\r\nfor i in range(1,len(a)):\r\n \r\n if z>=a[i] and a[i]!=0:\r\n b. append(abs(y-i))\r\nprint(min(b)*10)\r\n \r\n ", "n, m, k=map(int, input().split())\r\na=list(map(int, input().split()))\r\nb=[]\r\n\r\nfor i in range(n):\r\n\tif a[i]!=0:\r\n\t\tif a[i]<=k:\r\n\t\t\tb+=[abs(i-(m-1))]\r\nm=min(b)\r\nprint(m*10)", "def main_function():\r\n n, m, k = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n home_index = 10000000000000000\r\n for i in range(len(a)):\r\n if a[i] != 0 and k >= a[i] and home_index > abs(i - m + 1):\r\n home_index = abs(i - m + 1)\r\n return home_index * 10\r\n\r\n\r\n\r\nprint(main_function())\r\n\r\n", "information = input().split(\" \")\nquantHouses = int(information[0])\ncrush = int(information[1]) - 1\nbudget = int (information[2])\n\nhouses = input().split(\" \")\nminorDiff = quantHouses\nfor i in range(quantHouses):\n auxDiff = abs(crush - i)\n houseI = int(houses[i])\n\n if(i != crush and houseI != 0 and (auxDiff < minorDiff) and (budget - houseI) >= 0):\n minorDiff = auxDiff\n\nprint(minorDiff*10)\n\n \t \t\t \t \t\t\t \t \t\t \t \t\t\t\t", "n, m, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\na, b = 100, 100\r\nfor i in range(m, n):\r\n if w[i] != 0 and k >= w[i]:\r\n a = i-m+1\r\n break\r\nfor i in range(m-2, -1, -1):\r\n if w[i] != 0 and k >= w[i]:\r\n b = m-1-i\r\n break\r\n if m-1-i > a:\r\n break\r\n\r\nif a > b:\r\n print(b*10)\r\nelse:\r\n print(a*10)", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output4.out\",'w')\r\nn,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n\tif a[i] and a[i]<=k:\r\n\t\tb.append(abs(m-i-1))\r\nx=min(b)*10\r\nprint(x)\r\n", "n, m, k = map(int, input().split())\r\nhouses = [k for k in map(int, input().split())]\r\n\r\ndistance = 10 # meters\r\n\r\nresult = 200 * distance\r\nhouses_left = houses[:m-1]\r\nhouses_right = houses[m:]\r\n\r\nhouses_left = houses_left[::-1]\r\n\r\nfor h in [houses_left, houses_right]:\r\n for i in range(len(h)):\r\n if 0 < h[i] <= k:\r\n result = min(result, (i+1)*distance)\r\n\r\nprint(result)\r\n", "# print(\"Input n, m, and k\")\nn,m,k = [int(x) for x in input().split()]\n\n# Make the girls house the correct 0-based integer\nm = m - 1\n\n# print(\"Input the n house values\")\na = [int(x) for x in input().split()]\n\nmindist = float(\"inf\")\nfor i in range(len(a)):\n if a[i] > 0 and a[i] <= k and abs(i-m)*10 < mindist:\n mindist = abs(i-m)*10\n\nprint(mindist)\n \n\n", "inputs = list(map(int, input().split()))\nn = inputs[0]\nm = inputs[1]\nk = inputs[2]\nhouses = list(map(int, input().split()))\n\nans = n - 1\n\nfor i in range(0, n):\n if i != (m - 1) and houses[i] != 0 and houses[i] <= k:\n curr = abs(m - i - 1)\n ans = min(curr, ans)\n\nans *= 10\n\nprint(ans)\n\t \t \t\t \t \t \t\t\t \t \t \t\t", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nprint(min(abs(10*(m-i)) for i in range(1,n+1) if 0<a[i-1]<=k))", "x = input().split()\nn = int(x[0])\nm = int(x[1])\nk = int(x[2])\nx = input().split()\narray = []\nfor i in x:\n array.append(int(i))\nidx1 = -10000\nidx2 = -10000\nfor i in range(m-1,-1,-1):\n if array[i] == 0:\n continue\n if k >= array[i]:\n idx1 = i\n break\nfor j in range(m,n):\n if array[j] == 0:\n continue\n if k >= array[j]:\n idx2 = j\n break\nresp1 = abs(idx1-(m-1))\nresp2 = abs(idx2-(m-1))\nif resp1 <= resp2:\n print((resp1)*10)\nelse:\n print((resp2)*10)\n#Isaias Martins\n#118110593", "import math\r\nn,m,k=map(int,input().split())\r\nhouse=list(map(int,input().split()))\r\nl=-1\r\nr=-1\r\nfor i in range(m-1-1,-1,-1):\r\n if house[i]<=k and house[i]!=0:\r\n l=i+1\r\n #print(l)\r\n break\r\nfor i in range(m-1+1,n):\r\n if house[i]<=k and house[i]!=0:\r\n r=i+1\r\n break\r\n#print(l,r,m)\r\nif l!=-1 and r!=-1:\r\n print(min(abs(l-m),abs(r-m))*10)\r\nelif l==-1 :\r\n print(abs(r - m) * 10)\r\nelif r==-1 :\r\n print(abs(l - m) * 10)", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗ \r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝ \r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in range(n):\r\n\tif a[i] <= k and a[i] != 0:\r\n\t\tb += [abs((m - 1) - i)]\r\nprint(min(b) * 10)\r\n", "x, y, z = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\n \r\nb=[]\r\n\r\nfor i in range(1, len(a)):\r\n if z >= a[i] and a[i] != 0:\r\n b.append(abs(y-i))\r\n\r\nprint(min(b)*10)", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nmin_d=float('inf')\r\nfor i in range(n):\r\n if l[i]<=k and l[i]!=0:\r\n if abs(((m-1)-i)*10)<min_d:\r\n min_d=abs(((m-1)-i)*10) \r\nprint(min_d)", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nd=1e9+10\r\nfor i in range(n):\r\n if(a[i]!=0 and a[i]<=k):\r\n d=min(d,abs(m-(i+1)))\r\nprint(d*10)", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmin_dist = float('inf')\r\nfor i in range(n):\r\n if a[i] != 0 and a[i] <= k:\r\n min_dist = min(min_dist, abs(i + 1 - m) * 10)\r\nprint(min_dist)", "if __name__ == '__main__':\r\n n, m, k = str(input()).split()\r\n n, m, k = int(n), int(m) - 1, int(k)\r\n line = str(input()).split()\r\n line = [int(it) for it in line]\r\n l, r = n, n\r\n for i in range(m, n):\r\n if 0 < line[i] <= k:\r\n r = i - m\r\n break\r\n for i in range(m - 1, -1, -1):\r\n if 0 < line[i] <= k:\r\n l = m - i\r\n break\r\n print(10 * min(l, r))\r\n", "entrada = input().split()\r\nn = int(entrada[0])\r\nm = int(entrada[1]) \r\nk = int(entrada[2])\r\n\r\na = list(map(int, input().split()))\r\nr = 1\r\nwhile True:\r\n if n > m + r - 1 :\r\n if 0 < a[m + r - 1] <= k:\r\n break\r\n\r\n if 0 <= m - r - 1:\r\n if 0 < a[m - r - 1] <= k:\r\n break\r\n r += 1\r\nprint(r * 10)", "a,b,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor x in range(1,a):\r\n\tif b-1-x>=0 and 0<l[b-1-x]<=c:\r\n\t\tprint(10*x)\r\n\t\tbreak\r\n\telif b-1+x<a and 0<l[b-1+x]<=c:\r\n\t\tprint(10*x)\r\n\t\tbreak", "n,m,k= [int (x) for x in input().split()]\nprices= [int (x) for x in input().split()]\nleft_side=190000000;\nright_side=13415355;\nfor i in range (m,n):\n if prices[i] != 0 and prices[i]<=k:\n right_side=i-m+1 # distance to house (m-1)\n break\nfor i in range(m-2,-1,-1):\n if prices[i] != 0 and prices[i]<=k:\n left_side=m-i-1 # distance to house (m-1)\n break\nprint(int(min(left_side, right_side)) * 10)\n", "n, m, k = map(int, input().split())\r\n*a, = map(int, input().split())\r\n\r\nprint(min(abs(m - i) * 10 for i, v in enumerate(a, 1) if 0 < v <= k))\r\n", "r,c,p=list(map(int,input().split()))\r\npl=list(map(int,input().split()))\r\nkjl=[]\r\nif c-1!=0 and c!=r:\r\n tam=pl[0:c]\r\n tam=tam[::-1]\r\n for item in tam:\r\n if item<=p and item!=0:\r\n tod=tam.index(item)\r\n kjl.append(tod)\r\n break\r\n for item in pl[c-1:]:\r\n if item<=p and item!=0:\r\n tod=pl[c-1:].index(item)\r\n kjl.append(tod)\r\n break\r\n print(min(kjl)*10)\r\nelif c-1==0:\r\n for item in pl:\r\n if item<=p and item!=0:\r\n tod=pl.index(item)\r\n print(tod*10)\r\n break\r\nelse:\r\n pl=pl[::-1]\r\n for item in pl:\r\n if item<=p and item!=0:\r\n tod=pl.index(item)\r\n print(tod*10)\r\n break\r\n \r\n ", "n,m,k = map(int, input().split())\nm-= 1\n\nlista = list(map(int,input().split()))\n\ncasa = n * 15\n\nfor i in range(n):\n\tif 0 < lista [i] <= k:\n\t\tcasa= min(casa,abs(m-i) * 10)\n\t\nprint(casa)\n \t \t\t\t \t \t\t \t \t\t \t", "n, m, k = map(int, input().split())\r\nhome = list(map(int, input().split()))\r\nMin, index = 999999, 0\r\nfor i in range(n):\r\n if home[i] != 0 and home[i] <= k:\r\n Min = min(abs((i + 1) - m) * 10, Min)\r\nprint(Min)\r\n", "b, c, u = map(int, input().split())\nh = list(map(int, input().split()))\nt = 10**9\n\np = 1\nfor i in h:\n \n if i <= u and i > 0:\n j = abs(p - c)\n\n if j < t:\n t = j\n p += 1\n\nprint(t * 10)\n\t\t\t \t\t \t \t\t \t \t \t\t \t", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=l[:m]\r\no=l[m:]\r\nz=[]\r\nfor i in range(len(s)):\r\n if s[i]!=0 and s[i]<=k:\r\n z.append((len(s)-1-i)*10)\r\nfor j in range(len(o)):\r\n if o[j]!=0 and o[j]<=k:\r\n z.append((j+1)*10)\r\n break\r\nprint(min(z))", "# https://codeforces.com/problemset/problem/796/A\n# A. Buying A House\n\nn, m, k = map(int, input().split())\nhouses = list(map(int, input().split()))\n\nm -= 1\nbest_house = -1\n\nfor i, v in enumerate(houses):\n if v != 0 and v <= k:\n if best_house == -1:\n best_house = i\n elif abs(best_house - m) > abs(i - m):\n best_house = i\nprint(abs(best_house - m) * 10)\n", "(houses, where_she_lived, budget) = map(int, input().split(' '))\n\nprices_houses = input().split(' ')\npotential_houses_index = []\n\n\nfor i in range(houses):\n prices_houses[i] = int(prices_houses[i])\n if 0 < prices_houses[i] <= budget:\n potential_houses_index.append(i + 1)\n\ndistance_comparison = []\n\nfor house in potential_houses_index:\n distance_comparison.append(abs(house - where_she_lived) * 10)\n\nprint(min(distance_comparison))\n", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math, fractions, collections\r\n# ===================================\r\nn, m, k = [int(x) for x in input().split()]\r\nq = [int(x) for x in input().split()]\r\nans = []\r\nfor i in range(n):\r\n\tif q[i] != 0:\r\n\t\tif q[i] <= k:\r\n\t\t\tans.append(abs(i-m+1))\r\n# print(ans)\r\nprint(min(ans)*10)\r\n\r\n", "qhouses, girlhouse, dallaz = map(int, input().split())\r\n\r\nhouses = list(map(int, input().split()))\r\n\r\nmin_dist = 9999999\r\nfor i, house in enumerate(houses, 1):\r\n if dallaz >= house and house > 0:\r\n newdist = abs(girlhouse - i) \r\n if newdist < min_dist:\r\n min_dist = newdist\r\n\r\n\r\nprint(min_dist * 10)", "#796A-Buying A House\r\nn,m,k=[int(x) for x in input().split(' ')]\r\nalist=[int(x) for x in input().split(' ')]\r\nans1=100000\r\nans2=100000\r\nfor i in range(m,n):\r\n if alist[i] != 0 and alist[i] <= k:\r\n ans1=(i-(m-1))*10\r\n break\r\nfor i in range(m-1):\r\n if alist[m-2-i] != 0 and alist[m-2-i] <= k:\r\n ans2=10*(i+1)\r\n break\r\nprint(min(ans1,ans2))\r\n", "n, m, k = map(int, input().split())\nm -= 1\n\na = list(map(int, input().split()))\n\nans = n * 15\n\nfor i in range(n):\n if 0 < a[i] <= k:\n ans = min(ans, abs(m - i) * 10)\n\nprint(ans)\n \t \t\t \t \t\t\t\t\t \t \t\t \t \t", "n, m, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nl = m - 2\r\nr = m\r\n\r\nwhile l >= 0 and (a[l] == 0 or a[l] > k):\r\n l -= 1\r\n\r\nwhile r < n and (a[r] == 0 or a[r] > k):\r\n r += 1\r\n\r\nm -= 1\r\n\r\nif l >= 0:\r\n dl = m - l\r\n if r < n:\r\n dr = r - m\r\n print(10 * min(dl, dr))\r\n else:\r\n print(10 * dl)\r\nelse:\r\n print(10 * (r - m))", "n, m, k = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nmn = float(\"inf\")\r\nfor i in range(n):\r\n if li[i] <= k and li[i] != 0:\r\n mn = min(mn, abs(m-i-1))\r\nprint(mn*10)\r\n\r\n", "import math\r\n\r\nn, m, k = map(int, input().split())\r\nm -= 1\r\na = list(map(int, input().split()))\r\n\r\npos = 100500\r\nfor i in range(n):\r\n if a[i] == 0:\r\n continue\r\n if a[i] > k:\r\n continue\r\n if abs(i - m) < pos:\r\n pos = abs(i - m)\r\n \r\nprint(pos * 10)", "n,m,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\nans = n\r\nfor i in range(m-1,n):\r\n if arr[i] and arr[i]<=k:\r\n ans = min(ans,i-m+1)\r\nfor j in range(m-1,-1,-1):\r\n if arr[j] and arr[j]<=k:\r\n ans = min(ans,m-1-j)\r\nprint(ans*10)", "n,c,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=[]\r\nfor i in range(len(l)):\r\n if (i+1)!=c and l[i]!=0:\r\n if l[i]<=b:\r\n k=k+[i+1]\r\nk=list(map(lambda x:abs(x-c)*10,k))\r\nprint(min(k))\r\n\r\n", "import math\r\n\r\nn, m, k = input().split()\r\ncasas = input().split()\r\n\r\ndist = math.inf\r\nfor i in range(int(n)):\r\n a = int(casas[i])\r\n if(a != 0 and a <= int(k)):\r\n dist = min(dist, abs((i+1)-int(m)))\r\n\r\nprint(dist*10)", "def main():\n n, m, k = [int(x) for x in input().split()]\n casas = [int(x) for x in input().split()]\n casas_compraveis = [i+1 for i, casa in enumerate(casas) if casa <= k and casa != 0]\n print(casa_perto(m, casas_compraveis)*10)\n \ndef casa_perto(m, lista):\n Min = abs(m - lista[0])\n for i in lista:\n dist = abs(m - i)\n if dist < Min:\n Min = dist\n return Min\n\nmain()\n\t\t\t \t\t \t\t \t\t \t\t \t\t \t\t \t", "n,m,k=map(int,input().split())\r\nprint(min(abs(i) for i,a in enumerate(map(int,input().split()),1-m)if 0<a<=k)*10)", "def convert_to_int_array(array):\r\n return [int(i) for i in array]\r\n\r\n\r\nfirst_input = input().split()\r\nsecond_input = input().split()\r\n\r\nhouses_price = convert_to_int_array(second_input)\r\nfirst_input_int_list = convert_to_int_array(first_input)\r\nqtt_houses = first_input_int_list[0]\r\ngirls_house = first_input_int_list[1]\r\nzanes_money = first_input_int_list[2]\r\n\r\n\r\n\r\ndistance = qtt_houses + 1\r\nfor i in range(qtt_houses):\r\n if houses_price[i] != 0:\r\n if houses_price[i] <= zanes_money and abs(i + 1 - girls_house) < distance:\r\n distance = abs(i + 1 - girls_house)\r\n\r\nprint(distance * 10)\r\n\r\n", "from collections import *\r\nfrom math import *\r\nn,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = n+1\r\nfor i in range(n):\r\n if(a[i] != 0 and a[i] <= k):\r\n d = min(d,abs(i-m+1))\r\nprint(d*10)", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n a,b,c=LI()\n ll=LI()\n\n b-=1\n l=r=b\n while True:\n l-=1\n r+=1\n if 0<=l:\n if ll[l]!=0 and ll[l]<=c:\n return (b-l)*10\n if r<a:\n if ll[r]!=0 and ll[r]<=c:\n return (r-b)*10\n\n# main()\nprint(main())\n", "n,m,k = map(int, input().split())\na = list(map(int, input().split()))\n\nm -= 1\n\nl = m-1\nr = m+1\nwhile(True):\n if (l >= 0 and a[l] != 0 and a[l] <= k):\n print((m - l) * 10)\n exit()\n if (r < n and a[r] != 0 and a[r] <= k):\n print((r - m) * 10)\n exit()\n l -= 1\n r += 1\n\n", "#Matheus Augusto - 118111612\n\nentrada = input().split()\n\nn = int(entrada[0])\nm = int(entrada[1])\nk = int(entrada[2])\n\nentrada = input().split()\nlista = []\n\nfor i in entrada:\n lista.append(int(i))\n\nindex1 = -10000\nindex2 = -10000\n\nfor i in range(m-1,-1,-1):\n if lista[i] == 0:\n continue\n if k>=lista[i]:\n index1 = i\n break\nfor j in range(m,n):\n if lista[j] == 0:\n continue\n if k>=lista[j]:\n index2 = j\n break\n\nvalue1 = abs(index1-(m-1))\nvalue2 = abs(index2-(m-1))\n\nif value1 <= value2:\n print((value1)*10)\nelse:\n print((value2)*10)", "n, m, k = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\nmd = 2000\r\nfor i in range(n):\r\n if p[i] <= k and p[i] != 0:\r\n d = abs((m-1)-i) * 10\r\n if d < md:\r\n md = d\r\nprint(md)\r\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nm-=1\r\nm1,m2=n*10,n*10\r\nfor i in range(m):\r\n if a[i] > 0 and a[i] <= k:\r\n m1 = (m-i)*10\r\nfor i in range(n-1,m,-1):\r\n if a[i] > 0 and a[i] <= k:\r\n m2 = (i-m)*10\r\nprint(min(m1,m2))", "\r\n\r\nn , m , k = map(int , input().split())\r\nm = m - 1\r\nmn = n\r\nx = [int(x) for x in input().split()]\r\n\r\nfor i in range(len(x)):\r\n if i != m and x[i] != 0 and k >= x[i]:\r\n mn = min(mn , abs(m - i))\r\n \r\nprint(mn * 10)", "n,m,k = map(int,input().split())\r\nh = list(map(int,input().split()))\r\nh1=[]\r\nfor i in range(n):\r\n\t\tif h[i]!=0 and h[i]<=k:\r\n\t\t\th1.append(abs(i+1-m))\r\nprint(10*min(h1))\r\n\r\n", "n,m,k=map(int,input().split())\r\nm1=1000000\r\nx=list(map(int,input().split()))\r\nfor i in range(n):\r\n if x[i]<=k and x[i]!=0:\r\n l=abs(m-i-1)\r\n m1=min(m1,l)\r\n\r\n\r\nprint(10*m1)", "n, m, k = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\nres, m = 0, m - 1\nfor i in range(1, n):\n if (m + i < n and 0 < a[m + i] <= k) or (m - i >= 0 and 0 < a[m - i] <= k):\n res = 10 * i\n break\nprint(res)\n", "n, m, k = list(map(int, input().split()))\r\ncity = list(map(int, input().split()))\r\n\r\nprint(min(abs(10*(m-i)) for i in range(1, n+1) if 0 < city[i-1] <= k))\r\n", "n,m,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ni = 1\r\nans = 0\r\nwhile i < n:\r\n if m-i -1 >= 0 and a[m-i -1] <= k and a[m-i-1] != 0:\r\n ans = i\r\n break\r\n if m-1+i < n and a[m-1+i] <= k and a[m-1+i] != 0:\r\n ans = i\r\n break\r\n i += 1\r\nprint(ans*10)", "N, M, K = map(int, input().strip().split())\nP = [int(p) for p in input().strip().split()]\n\nleft = None\nfor i in range(M - 2, -1, -1):\n if P[i] > K or P[i] == 0:\n continue\n\n distance = M - 1 - i\n left = (distance, P[i])\n break\n\nright = None\nfor i in range(M, N):\n if P[i] > K or P[i] == 0:\n continue\n\n distance = i - M + 1\n right = (distance, P[i])\n break\n\nif not left and not right:\n print(-1)\nelif left and not right:\n print(left[0] * 10)\nelif not left and right:\n print(right[0] * 10)\nelse:\n if left[0] > right[0]:\n print(right[0] * 10)\n elif left[0] < right[0]:\n print(left[0] * 10)\n else:\n if left[1] > right[1]:\n print(left[0] * 10)\n else:\n print(right[0] * 10)\n", "from sys import stdin, stdout\n#Additional Info\n # 2 ≤ houses ≤ 100, 1 ≤ location ≤ n, 1 ≤ budget ≤ 100\n # price[location] = 0, At least one house can be bought with the budget\n # distance = 10\n \n#Coding Area\ndef solve(numberHouses, location, budget, prices):\n distance = 10\n i = 1\n while True:\n condition1 = location - 1 - i >= 0 and prices[location - 1 - i] <= budget and prices[location - 1 - i] != 0\n condition2 = location - 1 + i < numberHouses and prices[location - 1 + i] <= budget and prices[location - 1 + i] != 0\n if condition1 or condition2:\n return distance\n distance += 10\n i += 1\n\n#Solve Area\nnumberHouses, location, budget = [ int(x) for x in stdin.readline().rstrip(\"\\r\\n\").split() ]\nprices = [ int(x) for x in stdin.readline().rstrip(\"\\r\\n\").split() ]\nstdout.write(str(solve(numberHouses, location, budget, prices)))\n\n#Test Area\n# print('Succeed' if solve(5,1,20,[0,27,32,21,19]) == 40 else 'Failed')\n# print('Succeed' if solve(7,3,50,[62,0,0,0,99,33,22]) == 30 else 'Failed')\n# print('Succeed' if solve(10,5,100,[1,0,1,0,0,0,0,0,1,1]) == 20 else 'Failed')\n\n", "n, m, k = map(int, input().split())\r\na = list(map(int,input().split()))\r\nd = n\r\nfor i in range(n):\r\n if a[i] != 0 and a[i] <= k :\r\n d = min(d, abs(i - m + 1))\r\nprint(d * 10)", "n,m,k=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nm-=1;d1=m-1;d2=m+1;\r\nconn1=False;conn2=False\r\nfor i in range(d1,-1,-1):\r\n\tif lst[i]<=k and lst[i]!=0:\r\n\t\tconn1=True\r\n\t\tcon1=i\r\n\t\tbreak\r\nfor i in range(d2,n):\r\n\tif lst[i]<=k and lst[i]!=0:\r\n\t\tconn2=True\r\n\t\tcon2=i\r\n\t\tbreak\r\nif conn1:\r\n\tcon1=m-con1;\r\nif conn2:\r\n\tcon2-=m\r\n#print(con1,con2,m)\r\nif conn2==False:\r\n\tprint(10*con1)\r\nelif conn1==False:\r\n\tprint(10*con2)\r\nelse:\r\n\tprint(10*(con1 if con1<con2 else con2))", "n, m, k = map(int, input().split())\r\nfoo = list(map(int, input().split()))\r\n\r\nkiko = []\r\nfor i in range(n):\r\n if k >= foo[i] and foo[i] != 0:\r\n\t kiko.append(abs(i+1-m)*10)\r\nprint(min(kiko))\r\n", "n,m,k = map(int,input().split())\nm -= 1\nhouses = list(map(int,input().split()))\n\nleftDist = float('inf')\nfor i in range(m-1,-1,-1):\n if houses[i] and houses[i] <= k:\n leftDist = min(leftDist,(m-i)*10)\n break\n\nrightDist = float('inf')\nfor i in range(m+1,n):\n if houses[i] and houses[i] <= k:\n rightDist = min(rightDist,(i-m)*10)\n break\n\nprint(min(leftDist,rightDist))\n \t \t\t \t\t\t\t\t\t \t \t\t\t\t", "n = [int(j) for j in input().split()]\r\nhouse_price = [int(j) for j in input().split()]\r\nw = []\r\nfor k in range(n[0]):\r\n if house_price[k] != 0 and house_price[k] <= n[2]:\r\n w.append(k)\r\ndistance = [abs(k - n[1]+1) for k in w]\r\ndistance.sort()\r\nprint(distance[0]*10)", "n, m, k = list(map(int, input().split(' ')))\r\na = list(map(int, input().split(' ')))\r\ns = float('inf')\r\nfor i in range(n):\r\n if a[i] and a[i] - k <= 0:\r\n s = min(abs(m - (i + 1)), s)\r\nprint(10 * s)\r\n", "if __name__ == \"__main__\":\n entrada1= input().split(\" \")\n entrada2= input().split(\" \")\n dismin=[]\n for val,casa in enumerate(entrada2):\n if(int(casa)!=0 and int(entrada1[2])>=int(casa)):\n dismin.append(abs(int(entrada1[1])-(val+1))*10) \n print(min(dismin))\n\t \t\t\t\t \t \t\t\t\t\t \t \t\t \t \t\t", "n,m,k=list(map(int,input().split(\" \")))\r\na=list(map(int,input().split(\" \")))\r\n# print(n,k,m,a)\r\nq=1000000000000\r\nfor i in range(1,n+1):\r\n if(a[i-1]<=k and a[i-1]!=0):\r\n distance=abs(m-i)\r\n q=min(distance,q)\r\nprint(q*10)", "(num_houses, crush_house, dollars) = [int(string) for string in input().split()]\nhouse_prices = [int(string) for string in input().split()]\n\ndef distance(crush, house, prices, max_price):\n return (abs(house - crush), not(prices[house] <= 0 or prices[house] > max_price))\n\nclosest = -1\nfor i in range(num_houses):\n (dist, can_buy) = distance(crush_house - 1, i, house_prices, dollars)\n if can_buy and (dist < closest or closest == -1):\n closest = dist\n\nprint(closest * 10)\n", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 10 ** 10\r\nfor i in range(n):\r\n if a[i] != 0 and a[i] <= k:\r\n ans = min(ans, abs(i - (m - 1)) * 10)\r\n \r\nprint(ans)", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=[]\r\ny=[]\r\nfor i in range(n):\r\n\tif l[i]==0:\r\n\t\tcontinue\r\n\telif l[i]<=k:\r\n\t\tx.append(i+1)\r\nfor i in range(len(x)):\r\n\tif x[i]>m:\r\n\t\ty.append(x[i]-m)\r\n\telif x[i]<m:\r\n\t\ty.append(m-x[i])\r\nprint(min(y)*10)", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\np1=m-2\r\np2=m\r\ni=1\r\nj=1\r\nans=[]\r\nwhile p1>=0 or p2<n:\r\n if p1>=0 and a[p1]<=k and a[p1]!=0:\r\n ans.append(i)\r\n if p2<n and a[p2]<=k and a[p2]!=0:\r\n ans.append(j)\r\n p1-=1\r\n i+=1\r\n j+=1\r\n p2+=1\r\nprint(min(ans)*10) \r\n \r\n \r\n \r\n", "import sys\nfrom collections import Counter\nfrom math import factorial\n\ninput = sys.stdin\noutput = sys.stdout\ncombinations_dynamic = dict()\n\n\ndef combinations(n, k):\n if k > n - k:\n k = n - k\n if k < 0:\n return 0\n if n < 1:\n return 0\n if k == 0:\n return 1\n if k == 1:\n return n\n question = tuple((n, k))\n if question not in combinations_dynamic:\n combinations_dynamic[question] = combinations(n - 1, k - 1) + combinations(n - 1, k)\n return combinations_dynamic[question]\n\n# input = open('input.txt')\n\n\ndef read_int():\n return [int(x) for x in input.readline().rstrip().split()]\n\n\nn, m, k = read_int()\nmas = read_int()\nm -= 1\nanswer = n * 10\nfor i, price in enumerate(mas):\n if 0 < price <= k:\n answer = min(answer, 10 * abs(m - i))\n\noutput.write('%d\\n' % answer)\n\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nleft=a[:m-1]\r\nright=a[m:]\r\nleft=left[::-1]\r\nflagl=0\r\nflagr=0\r\ncntl=0\r\ncntr=0\r\nfor i in left:\r\n cntl+=1\r\n if(i!=0):\r\n if(i<=k):\r\n flagl=1\r\n break\r\nfor j in right:\r\n cntr+=1\r\n if(j!=0):\r\n if(j<=k):\r\n flagr=1\r\n break\r\n \r\nk=[]\r\nif(flagl==1):\r\n k.append(cntl)\r\nif(flagr==1):\r\n k.append(cntr)\r\n \r\nprint(min(k)*10)\r\n\r\n\r\n ", "i=lambda:map(int,input().split())\r\n_,m,k=i()\r\nprint(10*min(abs(m-x) for x,y in enumerate(i(),start=1)if 0<y<=k))", "n,m,k=map(int,input().split())\r\na=[int(a) for a in input().split()] \r\ncountl,countr,flagl,flagr=10,10,0,0\r\n\r\nfor i in range(m,n):\r\n if a[i]==0 or a[i]>k:\r\n countr+=10\r\n else:\r\n flagr=1\r\n break\r\nfor j in range(m-2,-1,-1):\r\n if a[j]==0 or a[j]>k:\r\n countl+=10\r\n else:\r\n flagl=1\r\n break\r\n\r\nif flagl==1 and flagr==1:\r\n print(min(countl,countr))\r\nelif flagl==1:\r\n print(countl)\r\nelse:\r\n print(countr)", "a,b,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\np1,p2=b-1,b-1 \r\nwhile 1:\r\n p1-=1 \r\n p2+=1 \r\n if p1>=0:\r\n if l[p1]>0 and l[p1]<=c:\r\n print((b-p1-1)*10)\r\n break \r\n if p2<a:\r\n if l[p2]>0 and l[p2]<=c:\r\n print((p2-b+1)*10)\r\n break ", "n, m, k = map(int, input().split())\nm -= 1\nprices = list(map(int, input().split()))\nfor i in range(1, n+1):\n if (m+i < n and prices[m+i] > 0 and prices[m+i] <= k):\n print(i*10)\n break\n if (m-i >= 0 and prices[m-i] > 0 and prices[m-i] <= k):\n print(i*10)\n break\n \n# 1502472748047\n", "N, M, K = map(int,input().split())\r\nH = list(map(int,input().split()))\r\nM -= 1\r\nL, R = M-1, M+1\r\nminCost = 111111111111111\r\nwhile 0 <= L:\r\n if (0 < H[L] and H[L] <= K):\r\n minCost = min(10*(M-L),minCost)\r\n break\r\n L -= 1\r\nwhile R < N:\r\n if (0 < H[R] and H[R] <= K):\r\n minCost = min(10*(R-M),minCost)\r\n break\r\n R += 1\r\n\r\nprint(minCost)", "num_houses,crush_house,Zane_money = list(map(int, input().split()))\nprices = list(map(int,input().split()))\ncrush_house -= 1\n\nfound = False\nleft_pos = crush_house - 1\nright_pos = crush_house + 1\nZane_house = crush_house\n\nwhile not found:\n if left_pos >= 0 and prices[left_pos] > 0 and prices[left_pos] <= Zane_money:\n Zane_house = left_pos\n found = True\n elif right_pos < len(prices) and prices[right_pos] > 0 and prices[right_pos] <= Zane_money:\n Zane_house = right_pos\n found = True\n left_pos -= 1\n right_pos += 1\n\nZane_house_distance = 0\nif Zane_house > crush_house:\n Zane_house_distance = Zane_house - crush_house\nelse:\n Zane_house_distance = crush_house - Zane_house\nZane_house_distance *= 10\n\nprint(Zane_house_distance)\n\n\t\t \t\t\t\t\t \t \t \t \t\t \t \t \t", "n, m, k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ngood = []\r\nfor i in range(len(arr)):\r\n if 0 < arr[i] <= k:\r\n diff = abs(m - (i + 1))\r\n good.append(diff)\r\ndis = min(good)\r\nprint(dis * 10)\r\n\r\n", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=n\r\nfor i in range(n):\r\n\tif l[i]>0 and l[i]<=k and abs(i-(m-1))<c:\r\n\t\tc=abs(i-(m-1))\r\nprint(c*10)\t\r\n", "def main():\r\n n, m, k = map(int, input().split())\r\n a = [int(i) for i in input().split()]\r\n dist1 = n\r\n dist2 = n\r\n m = m - 1\r\n for i in range(m, n):\r\n if a[i] != 0 and a[i] <= k:\r\n dist1 = i - m\r\n break\r\n for i in range(m, -1, -1):\r\n if a[i] != 0 and a[i] <= k:\r\n dist2 = m - i\r\n break\r\n print(min(dist1, dist2) * 10)\r\nmain()", "n,m,k = map(int,input().split())\r\nli = list(map(int,input().split()))\r\ns =[]\r\nfor i in range(n):\r\n if li[i]!=0 and li[i]<=k:\r\n s.append(abs(i+1-m)*10)\r\n\r\nprint(min(s))\r\n \r\n", "n,m,k = map(int,input().split())\r\ns = [int(i) for i in input().split()]\r\nx,y=0,0\r\n\r\nd = s[m-1::-1]\r\nc = s[m-1:n]\r\n\r\nfor i in range(len(d)-1):\r\n\tif d[i+1]!=0 and d[i+1]<=k:\r\n\t\tx = i+1\r\n\t\tbreak\r\n\r\nfor i in range(len(c)-1):\r\n\tif c[i+1]!=0 and c[i+1]<=k:\r\n\t\ty = i+1\r\n\t\tbreak\r\n\r\nif x==0 or y==0:\r\n\tprint(max(x,y)*10)\r\nelse:\r\n\tprint(min(x,y)*10)\r\n\r\n\r\n", "n, m, k = list(map(int,input().strip().split()))\na = list(map(int,input().strip().split()))\n\n\n# def f(a, m, k):\n# n = len(a)\n# i = m - 2\n# j = m\n\n# while True:\n# if a[i] <= k and a[i] !=0 and i >= 0:\n# ans = i\n# break\n# if a[j] <= k and a[j] !=0 and j < n:\n# ans = j\n# break\n\n# if i > 0:\n# i -= 1\n# if j < n:\n# j += 1\n\n# print(10*abs(m-1-ans))\n\n\nminp = 101\nfor i, p in enumerate(a):\n if p > 0 and p <=k:\n temp = abs(m-i-1)\n if temp < minp:\n minp = temp\n\nprint(minp*10)", "def buy_house(m, k, lst):\r\n distance = 10 ** 9\r\n for i, j in enumerate(lst):\r\n if j != 0 and j <= k:\r\n distance = min(distance, abs(i + 1 - m))\r\n return 10 * distance\r\n\r\n\r\nn, m, k = [int(x) for x in input().split()]\r\nb = [int(y) for y in input().split()]\r\nprint(buy_house(m, k, b))\r\n", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()));b=[];d=0\r\nfor i in range(n) :\r\n if i!=m-1 :\r\n if a[i]<=k and a[i]!=0 :\r\n b.append(abs(i-(m-1))*10)\r\nprint(min(b))\r\n", "# Buying a House\n\na = list(map(int, input().split()))\n\nd = 200\nn = a[0]\nm = a[1]\nk = a[2]\n\nh = list(map(int, input().split()))\n\nfor i in range(1, n+1, 1):\n if(h[i-1] and h[i-1] <= k and d > abs(i - m)):\n d = abs(i - m)\n\nprint(d*10)\n\t \t\t\t \t\t \t\t\t \t\t \t \t\t\t", "import sys \r\n#http://codeforces.com/problemset/problem/796/A\r\ninput_string = input()\r\ninput_array = [int(x) for x in input_string.split()]\r\nnumber_of_houses = input_array[0]\r\ngirl_house = input_array[1]\r\nbudget = input_array[2]\r\ninput_string = input()\r\nprices = [int(x) for x in input_string.split()]\r\n\r\nmin_distance = number_of_houses+1\r\nfor i in range(len(prices)): \r\n if(prices[i]!=0 and prices[i]<=budget):\r\n if abs(girl_house-(i+1))<min_distance:\r\n min_distance = abs(girl_house-(i+1))\r\nprint(min_distance*10)\r\n ", "\n\nn,m,k = map(int,input().split(' '))\n\navailability = list(map(int,input().split(' ')))\n\nd = []\n\nfor i in range(n):\n\tif availability[i]<=k and availability[i]!=0:\n\t\td.append(abs(m-(i+1)))\n\nprint(min(d)*10)\n", "_, m, k = [int(x) for x in input().split()]\nA = [int(x) for x in input().split()]\nm-=1\n\ndef solve(A, m, k):\n\ti1, i2 = m,m\n\twhile i1>=0 or i2<len(A):\n\t\tif i1>=0 and A[i1]!=0 and A[i1]<=k:\n\t\t\treturn i1\n\t\telif i2<len(A) and A[i2] != 0 and A[i2]<=k:\n\t\t\treturn i2\n\t\ti2+=1\n\t\ti1-=1\n\nmh = solve(A,m,k)\nprint(10*abs(mh-m))\n", "n , m , k = list(map(int,input().split()))\r\n\r\na = list(map(int,input().split()))\r\n\r\nxi = 0 ; \r\nmx = 1000000008\r\n \r\nm = m - 1\r\nmxi = 0 \r\n \r\nfor x in a:\r\n\tif x <= k and abs(xi-m) < mx and x != 0:\r\n\t\tmx = abs(xi-m)\r\n\txi = xi + 1 \r\n\r\nprint((mx)*10)\r\n\r\n", "n, m, k = map(int, input().split())\r\nhouses = list(map(int, input().split()))\r\nmin_distance = float('inf') # Initialize with a infintely large number\r\nfor i in range(n):\r\n if houses[i] != 0 and houses[i] <= k:\r\n distance = abs(m - (i + 1)) * 10 # Convert house distance to meters\r\n min_distance = min(min_distance, distance)\r\nprint(min_distance)\r\n", "n,m,k = map(int,input().split(' '))\r\nlist0 = list(map(int,input().split(' ')))\r\ndistances = []\r\nfor i in range(n):\r\n if list0[i] <= k and list0[i] != 0:\r\n distances.append(10*abs(m-i-1))\r\n\r\nprint(min(distances))", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nflag1=flag2=0\r\nfor i in range(m-2,-1,-1):\r\n if a[i]!=0 and a[i]<=k:\r\n flag1=1\r\n break\r\nfor j in range(m,n):\r\n if a[j]!=0 and a[j]<=k:\r\n flag2=1 \r\n break\r\n\r\nif flag1==1 and flag2==1:\r\n print(min(m-i-1,j-m+1)*10)\r\nelif(flag1==1 and flag2==0):\r\n print((m-i-1)*10)\r\nelse:\r\n print((j-m+1)*10)", "n,gf,m=map(int,input().strip().split()[:3])\r\nb=list(map(int,input().strip().split()[:n]))\r\nc=10**3\r\nfor x in range(len(b)):\r\n\tif b[x]!=0 and b[x]<=m:\r\n\t\tk=x+1\r\n\t\tp=abs(gf-k)\r\n\t\tif p<c:\r\n\t\t\tc=p\r\n\r\nprint(c*10)", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni1=-1\r\ni2=-1\r\nfor i in range(m-2,-1,-1):\r\n if(a[i]!=0 and a[i]<=k):\r\n i1=i\r\n break\r\nfor i in range(m,n):\r\n if(a[i]!=0 and a[i]<=k):\r\n i2=i\r\n break\r\nif(i1==-1):\r\n print(10*(i2-m+1))\r\nelif(i2==-1):\r\n print(10*(m-1-i1))\r\nelse:\r\n print(min((10*(m-1-i1)), (10*(i2-m+1))))", "a = input().split()\r\nb = input().split()\r\ns=len(b)*10\r\nfor i in range(len(b)):\r\n if int(b[i]) <= int(a[2]) and int(b[i]) != 0:\r\n if abs(int(a[1])-1-i)*10<s:\r\n s = abs(int(a[1])-1-i)*10\r\nprint(s)", "a,b,c=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nx=[]\r\nfor i in range(b,len(z)):\r\n if z[i]!=0 and z[i]<=c:\r\n x.append((i-b+1)*10)\r\nfor i in range(0,b-1):\r\n if z[i]!=0 and z[i]<=c:\r\n x.append((b-i-1)*10)\r\nprint(min(x))", "a,b,c = [int(x) for x in input().split()]\r\nd = [int(x) for x in input().split()]\r\nb -=1 \r\nlista=[]\r\nfor i in range(a):\r\n if 0<d[i]<=c:\r\n lista.append(i)\r\nfor i in range(len(lista)):\r\n if lista[i]<b:\r\n lista[i]=b-lista[i]\r\n else:\r\n lista[i]=lista[i]-b\r\nprint(min(lista)*10)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 1 07:08:42 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn,m,k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nr1 = 0\r\nfor i in range(m,n):\r\n \r\n if l[i] <= k and l[i] !=0:\r\n r1 = i+1 - m\r\n break\r\nr2 = 0\r\nfor i in range(m-2,-1,-1):\r\n if l[i] <=k and l[i]!=0:\r\n r2 = abs(m - i-1)\r\n break\r\n\r\nif r1==0:\r\n r = r2\r\nelif r2 ==0:\r\n r = r1\r\nelse:\r\n r = min(r1,r2)\r\nprint(r*10)" ]

{"inputs": ["5 1 20\n0 27 32 21 19", "7 3 50\n62 0 0 0 99 33 22", "10 5 100\n1 0 1 0 0 0 0 0 1 1", "5 3 1\n1 1 0 0 1", "5 5 5\n1 0 5 6 0", "15 10 50\n20 0 49 50 50 50 50 50 50 0 50 50 49 0 20", "7 5 1\n0 100 2 2 0 2 1", "100 50 100\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 0 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100", "100 50 1\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 0 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100", "100 77 50\n50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 0 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0 50 100 49 51 0", "100 1 1\n0 98 97 96 95 94 93 92 91 90 89 88 87 86 85 84 83 82 81 80 79 78 77 76 75 74 73 72 71 70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0", "100 1 100\n0 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100", "100 10 99\n0 0 0 0 0 0 0 0 0 0 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 99 98", "7 4 5\n1 0 6 0 5 6 0", "7 4 5\n1 6 5 0 0 6 0", "100 42 59\n50 50 50 50 50 50 50 50 50 50 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 59 60 60 60 60 60 60 60 60 0 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 60 0", "2 1 100\n0 1", "2 2 100\n1 0", "10 1 88\n0 95 0 0 0 0 0 94 0 85", "10 2 14\n2 0 1 26 77 39 41 100 13 32", "10 3 11\n0 0 0 0 0 62 0 52 1 35", "20 12 44\n27 40 58 69 53 38 31 39 75 95 8 0 28 81 77 90 38 61 21 88", "30 29 10\n59 79 34 12 100 6 1 58 18 73 54 11 37 46 89 90 80 85 73 45 64 5 31 0 89 19 0 74 0 82", "40 22 1\n7 95 44 53 0 0 19 93 0 68 65 0 24 91 10 58 17 0 71 0 100 0 94 90 79 73 0 73 4 61 54 81 7 13 21 84 5 41 0 1", "40 22 99\n60 0 100 0 0 100 100 0 0 0 0 100 100 0 0 100 100 0 100 100 100 0 100 100 100 0 100 100 0 0 100 100 100 0 0 100 0 100 0 0", "50 10 82\n56 54 0 0 0 0 88 93 0 0 83 93 0 0 91 89 0 30 62 52 24 84 80 8 38 13 92 78 16 87 23 30 71 55 16 63 15 99 4 93 24 6 3 35 4 42 73 27 86 37", "63 49 22\n18 3 97 52 75 2 12 24 58 75 80 97 22 10 79 51 30 60 68 99 75 2 35 3 97 88 9 7 18 5 0 0 0 91 0 91 56 36 76 0 0 0 52 27 35 0 51 72 0 96 57 0 0 0 0 92 55 28 0 30 0 78 77", "74 38 51\n53 36 55 42 64 5 87 9 0 16 86 78 9 22 19 1 25 72 1 0 0 0 79 0 0 0 77 58 70 0 0 100 64 0 99 59 0 0 0 0 65 74 0 96 0 58 89 93 61 88 0 0 82 89 0 0 49 24 7 77 89 87 94 61 100 31 93 70 39 49 39 14 20 84", "89 22 11\n36 0 68 89 0 85 72 0 38 56 0 44 0 94 0 28 71 0 0 18 0 0 0 89 0 0 0 75 0 0 0 32 66 0 0 0 0 0 0 48 63 0 64 58 0 23 48 0 0 52 93 61 57 0 18 0 0 34 62 17 0 41 0 0 53 59 44 0 0 51 40 0 0 100 100 54 0 88 0 5 45 56 57 67 24 16 88 86 15", "97 44 100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 51 19", "100 1 1\n0 0 0 0 10 54 84 6 17 94 65 82 34 0 61 46 42 0 2 16 56 0 100 0 82 0 0 0 89 78 96 56 0 0 0 0 0 0 0 0 77 70 0 96 67 0 0 32 44 1 72 50 14 11 24 61 100 64 19 5 67 69 44 82 93 22 67 93 22 61 53 64 79 41 84 48 43 97 7 24 8 49 23 16 72 52 97 29 69 47 29 49 64 91 4 73 17 18 51 67", "100 1 50\n0 0 0 60 0 0 54 0 80 0 0 0 97 0 68 97 84 0 0 93 0 0 0 0 68 0 0 62 0 0 55 68 65 87 0 69 0 0 0 0 0 52 61 100 0 71 0 82 88 78 0 81 0 95 0 57 0 67 0 0 0 55 86 0 60 72 0 0 73 0 83 0 0 60 64 0 56 0 0 77 84 0 58 63 84 0 0 67 0 16 3 88 0 98 31 52 40 35 85 23", "100 1 100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 91 70 14", "100 1 29\n0 0 0 0 64 0 89 97 0 0 0 59 0 67 62 0 59 0 0 80 0 0 0 0 0 97 0 57 0 64 32 0 44 0 0 48 0 47 38 0 42 0 0 0 0 0 0 46 74 0 86 33 33 0 44 0 79 0 0 0 0 91 59 0 59 65 55 0 0 58 33 95 0 97 76 0 81 0 41 0 38 81 80 0 85 0 31 0 0 92 0 0 45 96 0 85 91 87 0 10", "100 50 20\n3 0 32 0 48 32 64 0 54 26 0 0 0 0 0 28 0 0 54 0 0 45 49 0 38 74 0 0 39 42 62 48 75 96 89 42 0 44 0 0 30 21 76 0 50 0 79 0 0 0 0 99 0 84 62 0 0 0 0 53 80 0 28 0 0 53 0 0 38 0 62 0 0 62 0 0 88 0 44 32 0 81 35 45 49 0 69 73 38 27 72 0 96 72 69 0 0 22 76 10", "100 50 20\n49 0 56 0 87 25 40 0 50 0 0 97 0 0 36 29 0 0 0 0 0 73 29 71 44 0 0 0 91 92 69 0 0 60 81 49 48 38 0 87 0 82 0 32 0 82 46 39 0 0 29 0 0 29 0 79 47 0 0 0 0 0 49 0 24 33 70 0 63 45 97 90 0 0 29 53 55 0 84 0 0 100 26 0 88 0 0 0 0 81 70 0 30 80 0 75 59 98 0 2", "100 2 2\n0 0 43 90 47 5 2 97 52 69 21 48 64 10 34 97 97 74 8 19 68 56 55 24 47 38 43 73 72 72 60 60 51 36 33 44 100 45 13 54 72 52 0 15 3 6 50 8 88 4 78 26 40 27 30 63 67 83 61 91 33 97 54 20 92 27 89 35 10 7 84 50 11 95 74 88 24 44 74 100 18 56 34 91 41 34 51 51 11 91 89 54 19 100 83 89 10 17 76 20", "100 100 34\n5 73 0 0 44 0 0 0 79 55 0 0 0 0 0 0 0 0 83 67 75 0 0 0 0 59 0 74 0 0 47 98 0 0 72 41 0 55 87 0 0 78 84 0 0 39 0 79 72 95 0 0 0 0 0 85 53 84 0 0 0 0 37 75 0 66 0 0 0 0 61 0 70 0 37 60 42 78 92 52 0 0 0 55 77 57 0 63 37 0 0 0 96 70 0 94 97 0 0 0", "100 100 100\n43 79 21 87 84 14 28 69 92 16 3 71 79 37 48 37 72 58 12 72 62 49 37 17 60 54 41 99 15 72 40 89 76 1 99 87 14 56 63 48 69 37 96 64 7 14 1 73 85 33 98 70 97 71 96 28 49 71 56 2 67 22 100 2 98 100 62 77 92 76 98 98 47 26 22 47 50 56 9 16 72 47 5 62 29 78 81 1 0 63 32 65 87 3 40 53 8 80 93 0", "100 38 1\n3 59 12 81 33 95 0 41 36 17 63 76 42 77 85 56 3 96 55 41 24 87 18 9 0 37 0 61 69 0 0 0 67 0 0 0 0 0 0 18 0 0 47 56 74 0 0 80 0 42 0 1 60 59 62 9 19 87 92 48 58 30 98 51 99 10 42 94 51 53 50 89 24 5 52 82 50 39 98 8 95 4 57 21 10 0 44 32 19 14 64 34 79 76 17 3 15 22 71 51", "100 72 1\n56 98 8 27 9 23 16 76 56 1 34 43 96 73 75 49 62 20 18 23 51 55 30 84 4 20 89 40 75 16 69 35 1 0 16 0 80 0 41 17 0 0 76 23 0 92 0 34 0 91 82 54 0 0 0 63 85 59 98 24 29 0 8 77 26 0 34 95 39 0 0 0 74 0 0 0 0 12 0 92 0 0 55 95 66 30 0 0 29 98 0 0 0 47 0 0 80 0 0 4", "100 66 1\n38 50 64 91 37 44 74 21 14 41 80 90 26 51 78 85 80 86 44 14 49 75 93 48 78 89 23 72 35 22 14 48 100 71 62 22 7 95 80 66 32 20 17 47 79 30 41 52 15 62 67 71 1 6 0 9 0 0 0 11 0 0 24 0 31 0 77 0 51 0 0 0 0 0 0 77 0 36 44 19 90 45 6 25 100 87 93 30 4 97 36 88 33 50 26 71 97 71 51 68", "100 55 1\n0 33 45 83 56 96 58 24 45 30 38 60 39 69 21 87 59 21 72 73 27 46 61 61 11 97 77 5 39 3 3 35 76 37 53 84 24 75 9 48 31 90 100 84 74 81 83 83 42 23 29 94 18 1 0 53 52 99 86 37 94 54 28 75 28 80 17 14 98 68 76 20 32 23 42 31 57 79 60 14 18 27 1 98 32 3 96 25 15 38 2 6 3 28 59 54 63 2 43 59", "100 55 1\n24 52 41 6 55 11 58 25 63 12 70 39 23 28 72 17 96 85 7 84 21 13 34 37 97 43 36 32 15 30 58 5 14 71 40 70 9 92 44 73 31 58 96 90 19 35 29 91 25 36 48 95 61 78 0 1 99 61 81 88 42 53 61 57 42 55 74 45 41 92 99 30 20 25 89 50 37 4 17 24 6 65 15 44 40 2 38 43 7 90 38 59 75 87 96 28 12 67 24 32", "100 21 1\n62 5 97 80 81 28 83 0 26 0 0 0 0 23 0 0 90 0 0 0 0 0 0 0 0 54 71 8 0 0 42 0 73 0 17 0 1 31 71 78 58 72 84 39 54 59 13 29 16 41 71 35 88 55 70 50 33 100 100 60 52 90 7 66 44 55 51 42 90 17 86 44 46 8 52 74 8 22 2 92 34 37 58 98 70 74 19 91 74 25 4 38 71 68 50 68 63 14 60 98", "5 2 20\n27 0 32 21 19", "6 4 10\n10 0 0 0 0 10", "8 7 100\n1 0 0 0 0 0 0 1", "5 3 20\n1 21 0 0 1", "4 3 1\n0 0 0 1", "5 2 3\n4 0 5 6 1", "5 3 87\n88 89 0 1 90", "5 3 20\n15 30 0 15 35", "6 3 50\n0 0 0 1 2 0", "6 4 9\n100 9 10 0 0 9", "5 4 20\n0 20 0 0 20", "6 3 3\n1 5 0 2 2 0", "5 4 100\n0 1 0 0 1"], "outputs": ["40", "30", "20", "10", "20", "10", "20", "10", "490", "10", "980", "10", "890", "10", "10", "90", "10", "10", "90", "10", "60", "10", "70", "180", "210", "80", "190", "190", "580", "520", "490", "890", "970", "990", "490", "500", "50", "990", "10", "140", "390", "130", "10", "10", "160", "30", "20", "10", "20", "10", "30", "10", "10", "10", "20", "10", "10", "10"]}

UNKNOWN

PYTHON3

CODEFORCES

329

8e997023d723a3471ac07fd67fc26280

Gargari and Permutations

Gargari got bored to play with the bishops and now, after solving the problem about them, he is trying to do math homework. In a math book he have found *k* permutations. Each of them consists of numbers 1,<=2,<=...,<=*n* in some order. Now he should find the length of the longest common subsequence of these permutations. Can you help Gargari? You can read about longest common subsequence there: https://en.wikipedia.org/wiki/Longest_common_subsequence_problem The first line contains two integers *n* and *k* (1<=≤<=*n*<=≤<=1000; 2<=≤<=*k*<=≤<=5). Each of the next *k* lines contains integers 1,<=2,<=...,<=*n* in some order — description of the current permutation. Print the length of the longest common subsequence. Sample Input 4 3 1 4 2 3 4 1 2 3 1 2 4 3 Sample Output 3

[ "n, k = map(int, input().split())\r\na = [[]]*6\r\nb = []\r\nfor i in range(6):\r\n b.append([0]*(n + 1))\r\n\r\nfor i in range(k):\r\n a[i] = list(map(int, input().split()))\r\n for j in range(n):\r\n b[i][a[i][j]] = j\r\n\r\ndp = [1] * n\r\nfor i in range(n):\r\n for j in range(i):\r\n key = 1\r\n for t in range(1, k):\r\n if b[t][a[0][j]] > b[t][a[0][i]]:\r\n key = 0\r\n break\r\n if key:\r\n dp[i] = max(dp[i], dp[j] + 1)\r\nprint(max(dp))\r\n", "from collections import defaultdict\r\nn,k = map(int,input().split())\r\nmat= []\r\n\r\nfor x in range(k):\r\n\tarr = list(map(int,input().split()))\r\n\tmat.append(arr)\r\nmemo = defaultdict(lambda:-1)\r\nfor i in range(k):\r\n\tfor j in range(n):\r\n\t\tmemo[i,mat[i][j]] = j\r\n\r\ndef valid(index,prev):\r\n\tele= mat[0][index]\r\n\tprevele = mat[0][prev]\r\n\tflag =True \r\n\tfor i in range(k):\r\n\t\tif memo[i,prevele]>memo[i,ele]:flag = False\r\n\treturn flag\r\n\r\n\r\ndp = [1]*n\r\nfor i in range(1,n):\r\n\tfor j in range(i):\r\n\t\tif valid(i,j):\r\n\t\t\tdp[i] = max(dp[i],dp[j]+1)\r\nprint(max(dp))\r\n", "n, k = map(int, input().split())\nv = [list(map(int, input().split())) for _ in range(k)]\npos = [[0] * (n + 1) for _ in range(k)]\ne = [[] for _ in range(n + 1)]\nfor j in range(k):\n for p, x in enumerate(v[j]):\n pos[j][x] = p\n e[x].append(p)\ne = sorted((e[j], j) for j in range(1, n + 1))\n#print(e)\ndp = [0] * n\nfor j in range(n - 1, -1, -1):\n dp[j] = 1\n for b in range(j + 1, n):\n if all(e[b][0][x] > e[j][0][x] for x in range(k)):\n #print('Hi')\n dp[j] = max(dp[j], 1 + dp[b])\nprint(max(dp))", "# -*- coding:utf-8 -*-\n\n\"\"\"\n\ncreated by shuangquan.huang at 1/14/20\n\n\"\"\"\n\nimport collections\nimport time\nimport os\nimport sys\nimport bisect\nimport heapq\nfrom typing import List\n\n\nmemo = [0 for _ in range(1005)]\ndef longestpath(start, graph):\n if memo[start] > 0:\n return memo[start]\n \n l = 0\n for v in graph[start]:\n l = max(longestpath(v, graph), l)\n memo[start] = l + 1\n return l + 1\n\n\ndef solve_graph(N, K, A, pos):\n # for each u, v if u appears before v in every array, add a link u->v\n g = collections.defaultdict(list)\n d = [0 for _ in range(N+1)]\n for u in range(1, N+1):\n for v in range(1, N+1):\n if all([pos[k][u] < pos[k][v] for k in range(1, K+1)]):\n g[u].append(v)\n d[v] += 1\n \n # then find the longest path\n ans = 0\n for u in range(1, N+1):\n if d[u] == 0:\n ans = max(ans, longestpath(u, g))\n return ans\n \n\n\ndef solve(N, K, A, pos):\n dp = [0 for _ in range(N+1)]\n for i in range(1, N+1):\n maxx = 0\n for p in range(1, i):\n # if the A[1][p], A[1][i] is the last two elements of ans\n # A[1][p] should appears before A[1][i] at every input array A[1:]\n if all([pos[k][A[1][p]] < pos[k][A[1][i]] for k in range(2, K+1)]):\n maxx = max(maxx, dp[p])\n dp[i] = maxx + 1\n \n return max(dp)\n\n\nN, K = map(int, input().split())\nA = [[0] * (N + 1)]\npos = [[0 for _ in range(N+1)] for _ in range(K+1)]\nfor i in range(K):\n row = [0] + [int(x) for x in input().split()]\n A.append(row)\n for j, v in enumerate(row):\n pos[i+1][v] = j\n\nprint(solve_graph(N, K, A, pos))", "import sys\r\ninput=sys.stdin.readline\r\nn,k=map(int,input().split())\r\na=[list(map(int,input().split())) for i in range(k)]\r\ng=[[] for i in range(n+1)]\r\nfor i in range(n):\r\n x=a[0][i]\r\n s=set(a[0][i+1:])\r\n for j in range(k):\r\n idx=a[j].index(x)\r\n s1=set(a[j][idx+1:])\r\n s=s&s1\r\n for y in s:\r\n g[x].append(y)\r\ndist=[-1]*(n+1)\r\ndef dfs(ver):\r\n if dist[ver]!=-1:\r\n return dist[ver]\r\n res=0\r\n for to in g[ver]:\r\n res=max(res,dfs(to)+1)\r\n dist[ver]=res\r\n return res\r\nMAX=max(dfs(i) for i in range(1,n+1))\r\nprint(MAX+1)", "# by the authority of GOD author: manhar singh sachdev #\r\n\r\nimport os,sys\r\nfrom io import BytesIO,IOBase\r\n\r\ndef main():\r\n n,k = map(int,input().split())\r\n arr = [list(map(int,input().split())) for _ in range(k)]\r\n edg = [[1]*n for _ in range(n)]\r\n for i in range(k):\r\n for j in range(n):\r\n for l in range(j+1):\r\n edg[arr[i][j]-1][arr[i][l]-1] = 0\r\n path = [[] for _ in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n if edg[i][j]:\r\n path[i].append(j)\r\n visi,poi,dp = [0]*n,[0]*n,[1]*n\r\n for i in range(n):\r\n if visi[i]:\r\n continue\r\n visi[i],st = 1,[i]\r\n while len(st):\r\n x,y = st[-1],path[st[-1]]\r\n while poi[x] != len(y) and visi[y[poi[x]]]:\r\n dp[x] = max(dp[x],dp[y[poi[x]]]+1)\r\n poi[x] += 1\r\n if poi[x] == len(y):\r\n st.pop()\r\n if len(st):\r\n dp[st[-1]] = max(dp[st[-1]],dp[x]+1)\r\n else:\r\n st.append(y[poi[x]])\r\n visi[st[-1]] = 1\r\n poi[x] += 1\r\n print(max(dp))\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()", "from sys import stdin, stdout, setrecursionlimit\r\ninput = stdin.readline\r\n# import string\r\n# characters = string.ascii_lowercase\r\n# digits = string.digits\r\n# setrecursionlimit(int(1e6))\r\n# dir = [-1,0,1,0,-1]\r\n# moves = 'NESW'\r\ninf = float('inf')\r\nfrom functools import cmp_to_key\r\nfrom collections import defaultdict as dd\r\nfrom collections import Counter, deque\r\nfrom heapq import *\r\nimport math\r\nfrom math import floor, ceil, sqrt\r\ndef geti(): return map(int, input().strip().split())\r\ndef getl(): return list(map(int, input().strip().split()))\r\ndef getis(): return map(str, input().strip().split())\r\ndef getls(): return list(map(str, input().strip().split()))\r\ndef gets(): return input().strip()\r\ndef geta(): return int(input())\r\ndef print_s(s): stdout.write(s+'\\n')\r\n\r\n\r\ndef solve():\r\n n, k = geti()\r\n mat = []\r\n pos = [[-1]*(n+1) for _ in range(k)]\r\n for i in range(k):\r\n mat.append(getl())\r\n for j in range(n):\r\n pos[i][mat[-1][j]] = j\r\n dp = [1]*n\r\n for i in range(n):\r\n for j in range(i):\r\n for now in range(k):\r\n if pos[now][mat[0][i]] <= pos[now][mat[0][j]]:\r\n break\r\n else:\r\n dp[i] = max(dp[i], dp[j] + 1)\r\n # print(i, dp)\r\n ans = max(dp)\r\n print(ans)\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n solve()\r\n", "n, k = map(int, input().split())\r\nra = [[0] * k for _ in range(n)]\r\nfor p in range(k):\r\n for i, v in enumerate(map(int, input().split())):\r\n v -= 1\r\n ra[v][p] = i\r\ng = [[] for _ in range(n)]\r\nfor u in range(n):\r\n for v in range(n):\r\n if all(x < y for x, y in zip(ra[u], ra[v])):\r\n g[u].append(v)\r\n\r\nmemo = [-1] * n\r\ndef dfs(v):\r\n if memo[v] != -1:\r\n return memo[v]\r\n r = 1\r\n for u in g[v]:\r\n r = max(r, dfs(u) + 1)\r\n memo[v] = r\r\n return r\r\n\r\nprint(max(dfs(s) for s in range(n)))\r\n \r\n", "n, k = map(int, input().split())\r\na, b = [[] for row in range(6)], [[0 for col in range(n + 1)] for row in range(6)]\r\n\r\nfor i in range(k):\r\n a[i] = list(map(int, input().split()))\r\n for j in range(n):\r\n b[i][a[i][j]] = j\r\n\r\ndp = [1] * n\r\nfor i in range(n):\r\n for j in range(i):\r\n flag = 1\r\n for x in range(1, k):\r\n if b[x][a[0][j]] > b[x][a[0][i]]:\r\n flag = 0\r\n break\r\n if flag:\r\n dp[i] = max(dp[i], dp[j] + 1)\r\nprint(max(dp))\r\n" ]

{"inputs": ["4 3\n1 4 2 3\n4 1 2 3\n1 2 4 3", "6 3\n2 5 1 4 6 3\n5 1 4 3 2 6\n5 4 2 6 3 1", "41 4\n24 15 17 35 13 41 4 14 23 5 8 16 21 18 30 36 6 22 11 29 26 1 40 31 7 3 32 10 28 38 12 20 39 37 34 19 33 27 2 25 9\n22 13 25 24 38 35 29 12 15 8 11 37 3 19 4 23 18 32 30 40 36 21 16 34 27 9 5 41 39 2 14 17 31 33 26 7 1 10 20 6 28\n31 27 39 16 22 12 13 32 6 10 19 29 37 7 18 33 24 21 1 9 36 4 34 41 25 28 17 40 30 35 23 14 11 8 2 15 38 20 26 5 3\n8 18 39 38 7 34 16 31 15 1 40 20 37 4 25 11 17 19 33 26 6 14 13 41 12 32 2 21 10 35 27 9 28 5 30 24 22 23 29 3 36", "1 2\n1\n1", "28 5\n3 14 12 16 13 27 20 8 1 10 24 11 5 9 7 18 17 23 22 25 28 19 4 21 26 6 15 2\n7 12 23 27 22 26 16 18 19 5 6 9 11 28 25 4 10 3 1 14 8 17 15 2 20 13 24 21\n21 20 2 5 19 15 12 4 18 9 23 16 11 14 8 6 25 27 13 17 10 26 7 24 28 1 3 22\n12 2 23 11 20 18 25 21 13 27 14 8 4 6 9 16 7 3 10 1 22 15 26 19 5 17 28 24\n13 2 6 19 22 23 4 1 28 10 18 17 21 8 9 3 26 11 12 27 14 20 24 25 15 5 16 7", "6 3\n2 5 1 4 6 3\n5 1 4 6 2 3\n5 4 2 6 3 1", "41 4\n24 15 17 35 13 41 4 14 23 5 8 16 21 18 30 36 6 22 11 29 26 1 40 31 7 3 32 10 28 38 12 20 39 37 34 19 33 27 2 25 9\n22 13 25 24 38 35 29 12 15 8 11 37 3 19 4 23 18 32 30 40 36 21 16 34 27 9 5 41 39 2 14 17 31 33 26 7 1 10 20 6 28\n31 27 39 16 22 12 13 32 6 10 19 29 37 7 18 33 24 21 1 9 36 4 34 41 25 28 17 40 30 35 23 14 11 8 2 15 38 20 26 5 3\n8 18 39 38 7 34 16 31 15 1 40 20 37 4 25 11 17 19 33 26 6 14 13 41 12 32 2 21 10 35 27 9 28 5 30 24 22 23 29 3 36", "37 3\n6 3 19 20 15 4 1 35 8 24 12 21 34 26 18 14 23 33 28 9 36 11 37 31 25 32 29 22 13 27 16 17 10 7 5 30 2\n10 3 35 17 34 21 14 8 26 28 11 19 27 7 4 23 24 22 12 13 16 1 25 29 5 31 30 20 32 18 15 9 2 36 37 33 6\n19 9 22 32 26 35 29 23 5 6 14 34 33 10 2 28 15 11 24 4 13 7 8 31 37 36 1 27 3 16 30 25 20 21 18 17 12"], "outputs": ["3", "3", "4", "1", "3", "4", "4", "7"]}

UNKNOWN

PYTHON3

CODEFORCES

9

8ea2947adf1fbbc23b60a162d770b3ba

Alyona and flowers

Little Alyona is celebrating Happy Birthday! Her mother has an array of *n* flowers. Each flower has some mood, the mood of *i*-th flower is *a**i*. The mood can be positive, zero or negative. Let's define a subarray as a segment of consecutive flowers. The mother suggested some set of subarrays. Alyona wants to choose several of the subarrays suggested by her mother. After that, each of the flowers will add to the girl's happiness its mood multiplied by the number of chosen subarrays the flower is in. For example, consider the case when the mother has 5 flowers, and their moods are equal to 1,<=<=-<=2,<=1,<=3,<=<=-<=4. Suppose the mother suggested subarrays (1,<=<=-<=2), (3,<=<=-<=4), (1,<=3), (1,<=<=-<=2,<=1,<=3). Then if the girl chooses the third and the fourth subarrays then: - the first flower adds 1·1<==<=1 to the girl's happiness, because he is in one of chosen subarrays, - the second flower adds (<=-<=2)·1<==<=<=-<=2, because he is in one of chosen subarrays, - the third flower adds 1·2<==<=2, because he is in two of chosen subarrays, - the fourth flower adds 3·2<==<=6, because he is in two of chosen subarrays, - the fifth flower adds (<=-<=4)·0<==<=0, because he is in no chosen subarrays. Thus, in total 1<=+<=(<=-<=2)<=+<=2<=+<=6<=+<=0<==<=7 is added to the girl's happiness. Alyona wants to choose such subarrays from those suggested by the mother that the value added to her happiness would be as large as possible. Help her do this! Alyona can choose any number of the subarrays, even 0 or all suggested by her mother. The first line contains two integers *n* and *m* (1<=≤<=*n*,<=*m*<=≤<=100) — the number of flowers and the number of subarrays suggested by the mother. The second line contains the flowers moods — *n* integers *a*1,<=*a*2,<=...,<=*a**n* (<=-<=100<=≤<=*a**i*<=≤<=100). The next *m* lines contain the description of the subarrays suggested by the mother. The *i*-th of these lines contain two integers *l**i* and *r**i* (1<=≤<=*l**i*<=≤<=*r**i*<=≤<=*n*) denoting the subarray *a*[*l**i*],<=*a*[*l**i*<=+<=1],<=...,<=*a*[*r**i*]. Each subarray can encounter more than once. Print single integer — the maximum possible value added to the Alyona's happiness. Sample Input 5 4 1 -2 1 3 -4 1 2 4 5 3 4 1 4 4 3 1 2 3 4 1 3 2 4 1 1 2 2 -1 -2 1 1 1 2 Sample Output 7 16 0

[ "n,m = map(int,input().split())\r\nmoods = list(map(int,input().split()))\r\nfor i in range(1,n):\r\n moods[i] += moods[i-1]\r\ntotal_Happiness=0\r\nwhile(m>0):\r\n l,r = map(int,input().split())\r\n if l==1:\r\n sum = moods[r-1]\r\n else:\r\n sum = moods[r-1] - moods[l-2]\r\n if sum>0:\r\n total_Happiness+=sum\r\n m-=1\r\nprint(total_Happiness)\r\n\r\n", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\npre=[0]*n\r\npre[0]=arr[0]\r\nre=0\r\nfor i in range(1,n):\r\n pre[i]=pre[i-1]+arr[i]\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n curr=0\r\n if(x==1):\r\n curr=pre[y-1]\r\n else:\r\n curr=pre[y-1]-pre[x-2]\r\n if(curr>0):\r\n re+=curr\r\nprint(re)", "n,m=map(int,input().strip().split(' '))\r\na=list(map(int,input().strip().split(' ')))\r\ns=0\r\nfor q in range(m):\r\n l,r=map(int,input().strip().split(' '))\r\n p=0\r\n for i in range(l-1,r):\r\n p=p+a[i]\r\n if(p>0):\r\n s=s+p\r\nprint(s)", "#!/usr/bin/env python3\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\n\nsum_ = 0\nfor i in range(m):\n l, r = map(int, input().split())\n l -= 1\n temp = sum(a[l:r])\n if temp > 0:\n sum_ += temp\n\nprint(sum_)\n", "n, m = list(map(int, input().split(' ')))\nnums = list(map(int, input().split(' ')))\n\n# find the prefix sum of the array, to calculate the happiness\nprefix_sum = [0]\nfor num in nums:\n\tprefix_sum.append(num + prefix_sum[-1])\n\n# print(prefix_sum)\n\nres = 0\nfor i in range(m):\n\ts, e = list(map(int, input().split(' ')))\n\ttemp = prefix_sum[e] - prefix_sum[s-1]\n\tif temp > 0:\n\t\tres += temp \n\nprint(res)", "import math\n\n\nstr = input().split()\nn = int(str[0])\nm = int(str[1])\narr = [int(i) for i in input().split()]\nsu = 0\n\nfor k in range(m):\n str1 = input().split()\n n1 = int(str1[0])-1\n m1 = int(str1[1])\n k = arr[n1:m1]\n z = sum(k)\n if z>0:\n su+= z\nprint(su)\n \n \n ", "n,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[a[0]]\r\nfor i in range(1,n):\r\n b.append(b[i-1]+a[i])\r\n\r\nans=0\r\nfor i in range(q):\r\n x,y=map(int,input().split())\r\n temp=b[y-1]\r\n if x!=1:\r\n temp-=b[x-2]\r\n ans=max(ans,ans+temp)\r\nprint(ans)", "import sys\n\ndef scan():\n return input().rstrip().split()\n\ndef scan_numeric():\n return [(int(x) if float(x).is_integer() else float(x)) for x in scan()]\n\nN, M = scan_numeric()\nflowers = scan_numeric()\nsubs = []\nfor i in range(M):\n subs.append(scan_numeric())\n\ndp = [0]\n\nfor i in range(N): dp.append(flowers[i] + dp[i])\n\nhappiness = 0\nfor i in range(M):\n l, r = subs[i]\n add = dp[r] - dp[l-1]\n if add > 0: happiness += add\n\nprint(happiness)\n", "n, m = map(int, input().split())\r\narr = [int(x) for x in input().split()]\r\nres = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n s = sum(arr[l-1:r])\r\n res += max(0, s)\r\nprint(res)\r\n", "s = input()\r\ns = s.split(\" \")\r\ns = [int(x) for x in s]\r\na = input()\r\na = a.split(\" \")\r\na = [int(x) for x in a]\r\ny = 0\r\nfor i in range(1, s[-1]+1, 1):\r\n b = input()\r\n b = b.split(\" \")\r\n b = [int(x) for x in b]\r\n b[0] = b[0] - 1\r\n ans = 0\r\n for j in range(b[0], b[-1], 1):\r\n ans += a[j]\r\n if ans > 0:\r\n y += ans\r\nprint(y)", "n, m = map(int, input().split())\r\nmood = [int(c) for c in input().split()]\r\n\r\nacc = [0]\r\nfor e in mood:\r\n acc.append(acc[-1] + e)\r\n \r\nans = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n _sum = acc[r] - acc[l-1]\r\n if _sum >= 0:\r\n ans += _sum\r\n\r\nprint(ans) \r\n", "n,m=map(int,input().split())\npre=[int(i) for i in input().split()]\nans=0\nfor _ in range(m):\n l,r=map(int, input().split())\n x=0\n a=pre[l-1:r]\n for i in a:\n x += i\n if x>0:\n ans += x\nprint(ans)", "n,m=[int(i)for i in input().split()]\r\nl=[int(i)for i in input().split()]\r\ns=0\r\nfor i in range(m):\r\n\ta,b=[int(i)for i in input().split()]\t\r\n\td=sum(l[a-1:b])\r\n\tif d>0:s+=d\r\nprint(s)\t", "m,n=map(int,input().split())\r\nl=list(map(int,input().split()))\r\narr=[i for i in l]\r\nfor i in range(1,m):\r\n arr[i]+=arr[i-1]\r\nans=0 \r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n p=p-1\r\n q=q-1\r\n if p==0:\r\n sumi=arr[q]\r\n else: \r\n sumi=arr[q]-arr[p-1]\r\n if sumi>0:\r\n ans+=sumi\r\n \r\nprint(ans) \r\n ", "\r\nimport string\r\n\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n a_1 = []\r\n a_2 = []\r\n for i in range(len(a)):\r\n j = len(a) - 1 - i\r\n if i == 0:\r\n a_1.append(a[i])\r\n else:\r\n a_1.append(a_1[-1] + a[i])\r\n if j == len(a) - 1:\r\n a_2.append(a[j])\r\n else:\r\n a_2.append(a_2[-1] + a[j])\r\n a_2.reverse()\r\n # print(a)\r\n #print(a_1)\r\n #print(a_2)\r\n counter = 0\r\n sum_of_a = sum(a)\r\n for i in range(m):\r\n l, r = [int(j) - 1 for j in input().split(\" \")]\r\n l = l - 1\r\n r = r + 1\r\n real_sum = sum_of_a\r\n if l >= 0:\r\n real_sum -= a_1[l]\r\n if r < len(a):\r\n real_sum -= a_2[r]\r\n #print(real_sum)\r\n if real_sum > 0:\r\n counter += real_sum\r\n print(counter)\r\n\r\n\r\nmain_function()", "n,q=map(int,input().split())\narr=[int(i) for i in input().split()]\nfor i in range(1,len(arr)):\n arr[i]=arr[i-1]+arr[i]\ndef calc(arr,l,r):\n l-=1\n r-=1\n if l==0:\n return arr[r]\n return (arr[r]-arr[l-1])\nans=0\nfor _ in range(q):\n l,r=map(int,input().split())\n temp=calc(arr,l,r)\n if temp>0:\n ans+=temp\nprint(ans)", "n,m=map(int,input().split())\r\nlistNum=list(map(int,input().split()))\r\nresult=0\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n changer=0\r\n for i in listNum[a-1:b]:\r\n changer+=i\r\n if changer>0:\r\n result+=changer\r\nprint(result)", "n,q = map(int, input().split())\r\n\r\nA = list(map(int, input().split()))\r\nfor i in range(1, n):\r\n A[i] += A[i-1]\r\n\r\nans = 0\r\nfor _ in range(q):\r\n s,e = map(int,input().split())\r\n s -= 1\r\n e -= 1\r\n if s == 0:\r\n cand = A[e]\r\n else:\r\n cand = A[e] - A[s-1]\r\n if cand > 0:\r\n ans += cand\r\n\r\nprint(ans)\r\n", "flowers, subarrays = map(int, input().split(\" \"))\r\nmoods = list(map(int, input().split(\" \")))\r\nadded = 0\r\nfor i in range(subarrays):\r\n f, t = map(int, input().split(\" \"))\r\n val = sum(moods[f-1:t])\r\n if val > 0:\r\n added += val\r\nprint(added)\r\n", "import sys\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nres = 0\r\nfor i in range(m):\r\n summ = 0\r\n l,r = map(int,input().split())\r\n for j in range(l-1,r):\r\n summ += a[j]\r\n if summ > 0:\r\n res += summ\r\nprint(res)\r\n", "\"\"\"\r\nATSTNG's ejudge Python3 solution template\r\n(actual solution is below)\r\n\"\"\"\r\nimport sys, queue\r\n\r\ntry:\r\n import dev_act_ffc429465ab634 # empty file in directory\r\n DEV = True\r\nexcept:\r\n DEV = False\r\n\r\ndef log(*s):\r\n if DEV: print('LOG', *s)\r\n\r\nclass EJudge:\r\n def __init__(self, problem=\"default\", reclim=1<<30):\r\n self.problem = problem\r\n sys.setrecursionlimit(reclim)\r\n\r\n def use_files(self, infile='', outfile=''):\r\n if infile!='':\r\n self.infile = open(infile)\r\n sys.stdin = self.infile\r\n if infile!='':\r\n self.outfile = open(outfile, 'w')\r\n sys.stdout = self.outfile\r\n\r\n def use_bacs_files(self):\r\n self.use_files(self.problem+'.in', self.problem+'.out')\r\n\r\n def get_tl(self):\r\n while True: pass\r\n\r\n def get_ml(self):\r\n tmp = [[[5]*100000 for _ in range(1000)]]\r\n while True: tmp.append([[5]*100000 for _ in range(1000)])\r\n\r\n def get_re(self):\r\n s = (0,)[8]\r\n\r\n def get_wa(self, wstr='blablalblah'):\r\n for _ in range(3): print(wstr)\r\n exit()\r\n\r\nclass IntReader:\r\n def __init__(self):\r\n self.ost = queue.Queue()\r\n\r\n def get(self):\r\n return int(self.sget())\r\n\r\n def sget(self):\r\n if self.ost.empty():\r\n for el in input().split():\r\n self.ost.put(el)\r\n return self.ost.get()\r\n\r\n def release(self):\r\n res = []\r\n while not self.ost.empty():\r\n res.append(self.ost.get())\r\n return res\r\n\r\n###############################################################################\r\nej = EJudge( )\r\nint_reader = IntReader()\r\nfmap = lambda f,*l: list(map(f,*l))\r\nparse_int = lambda: fmap(int, input().split())\r\n\r\n\r\n# input\r\nsuba = parse_int()[1]\r\narr = parse_int()\r\nps = arr[:]\r\nfor idx in range(1, len(ps)):\r\n ps[idx] += ps[idx-1]\r\nlog(arr); log(ps)\r\nans = 0\r\nfor _ in range(suba):\r\n left, right = parse_int()\r\n left, right = left-1, right-1\r\n\r\n csum = ps[right]-(ps[left-1] if left-1>=0 else 0)\r\n if csum > 0 :ans += csum\r\n log(csum)\r\n\r\nprint(ans)\r\n\r\n'''\r\n1 3\r\n1 2 3 4 5\r\n1 3\r\n2 4\r\n1 5\r\n'''\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\n\nflowers = [int(x) for x in input().split()]\nsubarrs = []\n\ndef arrsum(xs, l, r):\n sum = 0\n for i in range(l-1, r):\n sum += xs[i]\n return sum\n\nfor i in range(m):\n l, r = map(int, input().split())\n subarrs.append(arrsum(flowers, l, r))\n\nsubarrs.sort(reverse=True)\nsol = 0\n\nfor i in range(m):\n if subarrs[i] > 0:\n sol += subarrs[i]\n else:\n break\n\nprint (sol)\n", "from sys import stdin\n\nN, M = map(int, stdin.readline().split())\n\nflowers = list(map(int, stdin.readline().split()))\nfor i in range(1, len(flowers)):\n flowers[i] += flowers[i - 1]\n\nflowers.insert(0, 0)\n\ncontrib = [0] * M;\n\nfor m in range(M):\n a, b = map(int, stdin.readline().split())\n contrib[m] = max(0, flowers[b] - flowers[a - 1]);\n\nprint(sum(contrib))\n", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nbrr=[]\r\ns=0\r\nfor _ in range(m):\r\n temp=0\r\n a,b=map(int,input().split())\r\n for el in range(a-1,b):\r\n temp+=arr[el]\r\n if temp>0:\r\n s+=temp\r\nprint(s)", "##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\na = list(map(int, input().split()))\r\n\r\nres = 0\r\nfor i in range(m):\r\n [l, r] = list(map(int, input().split()))\r\n l -= 1\r\n r -= 1\r\n sum = 0\r\n for j in range(l, r+1):\r\n sum += a[j]\r\n if sum > 0:\r\n res += sum\r\nprint(res)", "n,m=(int(x) for x in input().split())\r\na=list(int(x) for x in input().split())\r\ncmb=list()\r\nfor i in range(m):\r\n\tcmb.append(list(int(x) for x in input().split()))\r\n\r\ncs=list([0]*m)\r\nfor i in range(m):\r\n\tfor j in range (cmb[i][0]-1,cmb[i][1]):\r\n\t\tcs[i]+=a[j]\r\n\r\nbv=0\r\nfor i in cs:\r\n\tif i>0:\r\n\t\tbv+=i\r\n\r\nprint(bv)", "def main():\n n, m = map(int, input().split())\n a = list(map(int, input().split()))\n\n ans = 0\n for _ in range(m):\n l, r = map(int, input().split())\n l -= 1\n r -= 1\n\n seg_sum = sum(a[l:(r + 1)])\n ans += max(0, seg_sum)\n\n print(ans)\n\nmain()\n", "cin=lambda:map(int,input().split())\nn,m=cin()\nA=cin()\nai=list(A)\nsum =[0]*(n+1)\nfor i in range(n):\n sum[i]= sum[i-1]+ ai[i]\ntemp = 0\nresult =0\nj=0\nsum[-1] =0\nwhile(j<m):\n a, b = cin()\n temp = sum[b-1]- sum[a-2];\n if temp>0:\n result += temp\n j = j+1\nprint(result)", "\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(arr):\r\n cnt1 = 0\r\n cnt2 = 0\r\n for i in range(len(arr)):\r\n if arr[i] >= 0 :\r\n cnt1+=1\r\n else:\r\n cnt2 +=1\r\n\r\n if cnt2 == len(arr):\r\n return True\r\n\r\nn , m = MAP()\r\narr = LIST()\r\nf = (check(arr))\r\nif f :\r\n print(0)\r\n exit(0)\r\nans = 0\r\nfor i in range(m):\r\n l,r = MAP()\r\n sm = 0\r\n l-=1\r\n a = []\r\n for j in range(l , r):\r\n sm += arr[j]\r\n if sm > 0 :\r\n ans+= sm\r\n\r\nprint(ans)\r\n\r\n", "n, m = map(int, input().split())\r\na = [0]\r\na.extend(list(map(int, input().split())))\r\nd = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n d[i] = d[i - 1] + a[i]\r\nans = 0\r\nfor i in range(m):\r\n left, right = map(int, input().split())\r\n s = d[right] - d[left - 1]\r\n if s > 0:\r\n ans += s\r\nprint(ans)\r\n", "n,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\np=[0]*n\r\n\r\np[0]=a[0]\r\nfor i in range(1,n):\r\n p[i]=p[i-1]+a[i]\r\ns=0\r\nfor _ in range(m):\r\n l,r=list(map(int,input().split()))\r\n l-=1\r\n r-=1\r\n if l==0:\r\n if p[r]>0:\r\n s+=p[r]\r\n else:\r\n if p[r]-p[l-1]>0:\r\n s+=p[r]-p[l-1]\r\nprint(s)\r\n", "n,nq=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nq=[]\r\nfor i in range(nq):\r\n q.append(list(map(int,input().split())))\r\nsums=[]\r\ns=0\r\nfor i in a:\r\n s=s+i\r\n sums.append(s)\r\nans=0\r\nfor i in q:\r\n c=sums[i[1]-1]-sums[i[0]-1]+a[i[0]-1]\r\n if(c>0):\r\n ans+=c\r\nprint(ans)\r\n", "n,m=[int(i) for i in input().split()]\r\n\r\nl = [int(i) for i in input().split()]\r\n\r\n\r\ncumSum = [0]\r\n\r\nfor i in range(1,n+1):\r\n v = cumSum[i-1]+l[i-1]\r\n cumSum.append(v)\r\n#print(cumSum)\r\ntotalSum = 0\r\nfor k in range(m):\r\n i,j = [int(i) for i in input().split()]\r\n \r\n resSum = cumSum[j]-cumSum[i-1]\r\n if(resSum > 0):\r\n totalSum += resSum\r\nprint(totalSum)", "I = lambda:map(int,input().split())\r\nans = 0\r\nn, m = I()\r\na = list(I())\r\nfor _ in range(m):\r\n\tl, r = I()\r\n\tans += max(0,sum(a[i] for i in range(l-1,r)))\r\nprint(ans)", "R = lambda: map(int, input().split())\r\nn, m = R()\r\na = list(R())\r\nans = 0\r\n\r\nfor _ in range(m):\r\n l, r = R()\r\n if sum(a[l-1:r]) > 0:\r\n ans += sum(a[l-1:r])\r\n\r\n\r\nprint(ans)\r\n", "def mex(lst,blanck):\r\n ans=0\r\n for i in blanck:\r\n ans=max(ans,ans+sum(lst[i[0]:i[1]+1]))\r\n return ans\r\n\r\na,b=map(int,input().strip().split())\r\nblanck=[]\r\nlst=list(map(int,input().strip().split()))\r\nfor i in range(b):\r\n x,y=map(int,input().strip().split())\r\n blanck.append([x-1,y-1])\r\nprint(mex(lst,blanck))", "class CodeforcesTask740BSolution:\n def __init__(self):\n self.result = ''\n self.n_m = []\n self.moods = []\n self.subarrays = []\n\n def read_input(self):\n self.n_m = [int(x) for x in input().split(\" \")]\n self.moods = [int(x) for x in input().split(\" \")]\n for x in range(self.n_m[1]):\n self.subarrays.append([int(x) for x in input().split(\" \")])\n\n def process_task(self):\n indices = [self.moods[x[0] - 1:x[1]] for x in self.subarrays]\n boosts = [sum(x) for x in indices]\n mood = sum([x for x in boosts if x > 0])\n self.result = str(mood)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask740BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n, m = map(int, input().split())\r\nmas = [int(x) for x in input().split()]\r\nsumek=0\r\nfor i in range(m):\r\n l,r = map(int, input().split())\r\n some_sum = sum(mas[l-1:r])\r\n if some_sum > 0:\r\n sumek += some_sum\r\nprint(sumek)", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nans=0\r\nfor z in range(m):\r\n l,r=[int(i) for i in input().split()]\r\n sum=0\r\n for i in range(l-1,r):\r\n sum+=a[i]\r\n if sum>0:\r\n ans+=sum\r\nprint(ans)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n s=max(s,sum(l[a-1:b])+s) \r\nprint(s) ", "read = lambda: map(int, input().split())\r\nn, m = read()\r\na = list(read())\r\nans = 0\r\nfor i in range(m):\r\n l, r = read()\r\n cur = sum(a[l - 1:r])\r\n ans += max(0, cur)\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nl = list(int(num) for num in input().strip().split())[:n]\r\ntotal_happiness = 0\r\nwhile m!=0:\r\n x, y = map(int, input().split())\r\n total = 0\r\n total=sum(l[x-1:y])\r\n if total>0:\r\n total_happiness+=total\r\n m-=1\r\nprint(total_happiness)", "n,m = map(int,input().split())\r\nml = list(map(int, input().split()))\r\nl = list()\r\nsumDict = {}\r\nmoodSums = 0\r\nfor i in range(m):\r\n moodSums = 0\r\n a,b = map(int,input().split())\r\n l.append([x for x in ml[a-1:b]])\r\n for a in ml[a-1:b]:\r\n moodSums += a\r\n\r\n sumDict[i] = moodSums\r\n\r\nque = {}\r\nhappinesVal = 0\r\nfor i,a in sumDict.items():\r\n if a < 0:\r\n continue\r\n for b in l[i]:\r\n if b not in que.keys():\r\n que[b] = 1\r\n else:\r\n que[b] += 1\r\n\r\nfor a,b in que.items():\r\n happinesVal += a*b\r\n\r\n\r\nprint(happinesVal)", "from sys import stdin\nfrom collections import deque,Counter,defaultdict,OrderedDict\nimport sys\nimport math,os\nimport operator\nimport random\nfrom fractions import Fraction\nimport functools\nimport bisect\nimport itertools\nfrom heapq import *\nimport time\nimport copy\n\n\nn,m = map(int,input().split())\narr = list(map(int,input().split()))\nchosen = []\nfor _ in range(m):\n a,b = map(int,input().split())\n if sum(arr[a-1:b])>0:\n chosen.append([a,b])\n\nans = 0\nfor i in range(n):\n count = 0\n for a,b in chosen:\n if i in range(a-1,b):\n count+=1\n ans+=arr[i]*count\nprint(ans)\n", "n,m=map(int,input().split())\r\nmood=list(map(int,input().split()))\r\nprefixsum=[0 for i in range(0,n)]\r\nprefixsum[0]=mood[0]\r\ndescription=[]\r\nhappiness=0\r\nsum1=0\r\nfor i in range(0,m):\r\n description.append(list(map(int,input().split())))\r\nfor i in range(1,n):\r\n prefixsum[i]=prefixsum[i-1]+mood[i]\r\nfor i in range(0,m):\r\n if description[i][0]==1:\r\n sum1=prefixsum[description[i][1]-1]\r\n else:\r\n sum1=prefixsum[description[i][1]-1]-prefixsum[description[i][0]-2]\r\n if sum1>0:\r\n happiness+=sum1\r\n\r\nprint(happiness)\r\n", "def solve():\r\n n,m=list(map(int,input().split()))\r\n flower=list(map(int,input().split()))\r\n result=0\r\n for _ in range(m):\r\n start,end=list(map(int,input().split()))\r\n subSum=sum(flower[start-1:end])\r\n if subSum>0:\r\n result+=subSum\r\n print(result)\r\n\r\nsolve()\r\n \r\n \r\n", "n,m=[int(x) for x in input().split()]\r\nmood= [int(x) for x in input().split()]\r\ntotal_hp=0\r\nfor i in range(m):\r\n l,r =[int(x) for x in input().split()]\r\n sum1=0\r\n for j in range(l-1,r):\r\n sum1+=mood[j]\r\n if sum1>0:\r\n total_hp+=sum1\r\nprint(total_hp)", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn,m=f()\r\nl=il()\r\nlsm=[]\r\nfor _ in range(m):\r\n a,b=f()\r\n lsm.append(sum(l[i] for i in range(a-1,b)))\r\nsm=0\r\nfor i in lsm:\r\n sm=sm+i if i>0 else sm+0\r\nprint(sm)", "n=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nsum1=0\r\nfor i in range(n[1]):\r\n n=list(map(int,input().split()))\r\n if sum(l[n[0]-1:n[1]])>=0:\r\n sum1+=sum(l[n[0]-1:n[1]])\r\nprint(sum1)", "from itertools import accumulate\r\n\r\nI = lambda: map(int, input().split())\r\n\r\nn, m = I()\r\nS = [0] + list(accumulate(I()))\r\nx = 0\r\n\r\nfor _ in range(m):\r\n L, R = I()\r\n x += max(0, S[R]-S[L-1])\r\n\r\nprint(x)", "n,ma=map(int,input().strip().split(\" \"))\r\na=list(map(int,input().strip().split(\" \")))\r\nm=0\r\nb=[]\r\nfor i in range(0,ma):\r\n b.append(list(map(int,input().strip().split(\" \"))))\r\n c=sum(a[b[i][0]-1:b[i][1]])\r\n m=max(m,m+c)\r\nprint(m)", "n,t = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ntotal = 0\r\n\r\nfor i in range(t):\r\n a,b = map(int,input().split())\r\n value_add = 0\r\n for j in range(a-1,b):\r\n value_add += arr[j]\r\n if(value_add > 0):\r\n total += value_add\r\n\r\nprint(total)\r\n\r\n\r\n\r\n\r\n\r\n", "if __name__ == \"__main__\":\r\n n,m=map(int,input().split())\r\n flowers=list(map(int,input().split()))\r\n happiness=0\r\n for i in range(1,n):\r\n flowers[i]+=flowers[i-1]\r\n for i in range(m):\r\n l,r=map(int,input().split())\r\n l-=1\r\n r-=1\r\n if(l==0):\r\n happiness+=max(flowers[r],0)\r\n else:\r\n happiness+=max((flowers[r]-flowers[l-1]),0)\r\n print(happiness)", "def listsum(numList):\r\n theSum = 0\r\n for i in numList:\r\n theSum = theSum + i\r\n return theSum\r\nsum = 0\r\nins = input().split()\r\nn,m = int(ins[0]),int(ins[1])\r\nflowers = input().split()\r\nflowers = list(map(int, flowers))\r\nwhile m!=0:\r\n m -= 1\r\n ins = input().split()\r\n ins[0] = int(ins[0])\r\n ins[1] = int(ins[1])\r\n if listsum(flowers[ins[0]-1:ins[1]])>0:\r\n sum += listsum(flowers[ins[0]-1:ins[1]])\r\nprint(sum)", "N, M = map(int, input().split())\narr = list(map(int, input().split()))\ntotal_happiness = 0\nfor i in range(M):\n summ = 0\n L, R = map(int, input().split())\n for j in range(L, R+1):\n summ += arr[j-1]\n if summ > 0:\n total_happiness += summ\nprint(total_happiness)\n\n \n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nscore = 0\r\n\r\nps = [arr[0]]\r\nfor i in range(1, n):\r\n\ts = ps[i-1] + arr[i]\r\n\tps.append(s)\r\n\r\nfor i in range(m):\r\n\tl, r = map(int, input().split())\r\n\t\r\n\tif (l == 1):\r\n\t\ttotal = ps[r-1]\r\n\telse:\r\n\t\ttotal = ps[r-1] - ps[l-2]\r\n\t\t\r\n\tscore = max(score, total+score)\r\n\r\nprint(score)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nfor i in range(1, n):\n a[i] += a[i - 1]\na = [0] + a\n\nresult = 0\nfor i in range(0, m):\n l, r = map(int, input().split())\n sum = a[r] - a[l - 1]\n result += max(sum, 0)\n\nprint(result)\n", "import copy\r\n \r\nN = input()\r\nN = list(map(int, N.split(' ')))\r\n \r\nflowers = input()\r\nflowers = list(map(int, flowers.split(' ')))\r\n \r\nsubarr = list()\r\n \r\nfor i in range(0,N[1]):\r\n arr = input()\r\n arr = list(map(int, arr.split(' ')))\r\n subarr.append(sum(flowers[arr[0]-1:arr[1]]))\r\n\r\nmood = 0\r\n\r\nfor i in subarr:\r\n if i > 0:\r\n mood = mood + i\r\n\r\nprint(mood)", "n,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(1,n):\r\n a[i]=(a[i-1]+a[i])\r\n\r\nans=0\r\nfor i in range(q):\r\n x,y=map(int,input().split())\r\n temp=a[y-1]\r\n if x!=1:\r\n temp-=a[x-2]\r\n ans=max(ans,ans+temp)\r\nprint(ans)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n s = 0\r\n l, r = map(int, input().split())\r\n for j in range(l - 1, r):\r\n s += a[j]\r\n if s >= 0:\r\n ans += s\r\nprint(ans)", "nm=list(map(int,input().split()))\r\nn=nm[0]\r\nm=nm[1]\r\na=list(map(int,input().split()))\r\nfreq=[0]*n\r\nfor i in range(0,m):\r\n lr=list(map(int,input().split()))\r\n l=lr[0]\r\n r=lr[1]\r\n arr=a[l-1:r]\r\n if(sum(arr)>0):\r\n for j in range(l-1,r):\r\n freq[j]=freq[j]+1\r\nsum=0\r\nfor i in range(0,n):\r\n sum+=a[i]*freq[i]\r\nprint(sum)\r\n ", "def fun(n,m,arr,sug):\r\n presum=list()\r\n presum.append(arr[0])\r\n for i in range(1,n):\r\n presum.append(presum[i-1]+arr[i])\r\n s=0\r\n for i,j in sug:\r\n temp=presum[j-1]-presum[i-1]+arr[i-1]\r\n if temp>0:\r\n s+=temp\r\n return s\r\n \r\nn,m=list(map(lambda x:int(x),input().split()))\r\narr=list(map(lambda x:int(x),input().split()))\r\nsug=[list(map(lambda x:int(x),input().split())) for _ in range(m)]\r\nprint(fun(n,m,arr,sug))", "# boundary cases\r\n# 1)zeroth index is involved\r\n# 2)Same index is involved could be zero and last Index\r\n# 3)only length one is included\r\n\r\n# input\r\n\r\nlength, sub_arrays = [int(i) for i in input().split()]\r\n\r\narr = [int(i) for i in input().split()]\r\n\r\nfor i in range(1, length):\r\n arr[i] = arr[i] + arr[i - 1]\r\n\r\nanswer = 0\r\n\r\nfor i in range(sub_arrays):\r\n l, r = [int(i) - 1 for i in input().split()]\r\n\r\n if l == 0:\r\n val = arr[r]\r\n else:\r\n val = arr[r] - arr[l-1]\r\n \r\n if val > 0:\r\n answer += val\r\n\r\nprint(answer)", "def calculate_happiness(n, m, flowers, subarrays):\r\n max_happiness = 0\r\n\r\n for subarray in subarrays:\r\n happiness = 0\r\n for i in range(subarray[0], subarray[1] + 1):\r\n happiness += flowers[i - 1]\r\n\r\n if happiness > 0:\r\n max_happiness += happiness\r\n\r\n return max_happiness\r\n\r\n\r\n# Read input values\r\nn, m = map(int, input().split())\r\nflowers = list(map(int, input().split()))\r\n\r\nsubarrays = []\r\nfor _ in range(m):\r\n li, ri = map(int, input().split())\r\n subarrays.append((li, ri))\r\n\r\n# Calculate maximum happiness\r\nresult = calculate_happiness(n, m, flowers, subarrays)\r\nprint(result)\r\n", "n, m = list(map(int, input().split(' ')))\r\na = list(map(int, input().split(' ')))\r\nans = 0\r\nfor i in range(m):\r\n l, r = list(map(int, input().split(' ')))\r\n ans += max(0, sum(a[l-1:r]))\r\nprint(ans)\r\n", "n, m = map (int, input().split())\r\na = [int(x) for x in input().split()]\r\n\r\nans = 0\r\nfor i in range (m):\r\n l, r = map (int, input().split())\r\n s = sum (a[l - 1 : r])\r\n if s > 0:\r\n ans += s\r\n \r\nprint (ans)", "n, m = map(int, input().split())\r\ns, v = [0], 0\r\nfor ai in map(int, input().split()):\r\n s.append(s[-1] + ai)\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n v += max(0, s[r] - s[l - 1])\r\nprint(v)", "inputArray = input().split()\r\nflowersNumber = int(inputArray[0])\r\nsubarraysNumber = int(inputArray[1])\r\n\r\nvalues = input().split()\r\n\r\nvalFreq = []\r\nfor i in range(flowersNumber):\r\n valFreq.append(0)\r\n \r\nsubarrays = []\r\nfor i in range(subarraysNumber):\r\n inputArray = input().split()\r\n a = int(inputArray[0])\r\n b = int(inputArray[1])\r\n #subarrays.append(values[a-1 : b])\r\n\r\n neto = 0\r\n for i in range (a-1, b):\r\n neto += int(values[i])\r\n\r\n if neto > 0:\r\n for i in range(a-1, b):\r\n valFreq[i] += 1\r\n\r\nendSum = 0\r\nfor i in range(flowersNumber):\r\n #print(int(values[i]), valFreq[i])\r\n endSum += int(values[i]) * valFreq[i]\r\n\r\nprint(endSum)\r\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr_subarrays = ['None'] * m\r\nfor i in range(m):\r\n a, b = map(int,input().split())\r\n arr_subarrays[i] = [a, b]\r\n\r\narr_sum_upto = ['None']*n\r\narr_sum_upto[0] = arr[0]\r\nfor i in range(1,n):\r\n arr_sum_upto[i] = arr_sum_upto[i-1] + arr[i]\r\n\r\narr_value_add = [None]*m\r\nans = 0\r\n\r\nfor i in range(len(arr_subarrays)):\r\n a = arr_subarrays[i][0]\r\n b = arr_subarrays[i][1]\r\n value_add = arr_sum_upto[b-1] - arr_sum_upto[a-1] + arr[a-1]\r\n if (value_add > 0):\r\n ans = ans + value_add\r\n\r\nprint(ans)\r\n\r\n#print(arr_subarrays)", "def ListFromInput():\n return list(map(int, input().split()))\n\n\n\nclass Range:\n def __init__(self, a, b):\n self.a = a\n self.b = b\n def summ(self, array):\n summ = 0\n for i in range(self.a-1, self.b):\n summ += array[i]\n return summ\n\n\ndef main():\n n, m = ListFromInput()\n a = ListFromInput()\n\n ranges = []\n for i in range(m):\n ranges.append(Range(*ListFromInput()))\n\n good_ranges = []\n for r in ranges:\n if r.summ(a) > 0:\n good_ranges.append(r)\n\n moods = {}\n for i, mood in enumerate(a):\n moods[i] = 0\n\n for r in good_ranges:\n for i in range(r.a-1, r.b):\n moods[i] += 1\n\n hapiness = 0\n for i in range(n):\n hapiness += moods[i] * a[i]\n\n print(hapiness)\n\nmain()\n\n", "def get_line(func=int,sym=' '):\r\n return [func(i) for i in input().split(sym)]\r\n\r\nn,m=get_line()\r\na=[0]+get_line()\r\nS=[0]*(n+1)\r\nfor i in range(n):\r\n S[i+1]=S[i]+a[i+1]\r\nans=0\r\nfor i in range(m):\r\n l,r=get_line()\r\n mood=S[r]-S[l-1]\r\n if mood>0:\r\n ans+=mood\r\nprint(ans)\r\n", "n,m=[int(x) for x in input().split()]\r\nmood=[int(x) for x in input().split()]\r\nif len(mood)==0:\r\n print(0)\r\nelse:\r\n s=[0 for x in range(len(mood))]\r\n s[0]=mood[0]\r\n for i in range(1,len(mood)):\r\n s[i]=s[i-1]+mood[i]\r\n res=0\r\n for i in range(m):\r\n l,r=[int(x) for x in input().split()]\r\n l-=1\r\n r-=1\r\n add=s[r]-s[l-1] if l!=0 else s[r]\r\n res+=add if add>0 else 0\r\n print(res)\r\n", "cv,pm = map(int,input().split())\r\nss = list(map(int,input().split()))\r\npmlist = []\r\nfor i in range(pm):\r\n pmlist.append(tuple(map(int,input().split())))\r\npmsum = 0\r\ns = 0\r\nfor i in pmlist:\r\n s = sum(ss[i[0]-1:i[1]])\r\n #print(ss[i[0]-1:i[1]],'=',s)\r\n pmsum+=s if s > 0 else 0\r\nprint(pmsum)", "n,m = map(int,input().split())\r\narr = [int(i) for i in input().split()]\r\narr1 = []\r\ns = 0\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n arr1.append(sum(arr[a-1:b]))\r\nfor i in arr1:\r\n if i > 0:\r\n s += i\r\nprint(s)\r\n\r\n", "from sys import stdin\nfrom sys import stdout\nn, m = [int(x) for x in stdin.readline().split()]\na = [int(x) for x in stdin.readline().split()]\ns = []\nfor _ in range(m):\n s.append(stdin.readline())\nlr = [[int(x) for x in line.split()] for line in s]\nhappiness = [0 for i in range(len(lr))]\nans = 0\nfor j in range(len(lr)):\n for i in range(lr[j][0]-1, lr[j][1]):\n happiness[j] += a[i]\nfor h in happiness:\n if h > 0:\n ans += h\nstdout.write(str(ans))\n", "from sys import stdin\n\nn, m = map(int, stdin.readline().split())\n\na = list(map(int, stdin.readline().split()))\n\nintervals = []\n\nfor _ in range(m):\n interval = list(map(lambda x: int(x) - 1, stdin.readline().split()))\n interval[1] += 1\n intervals.append(interval)\n\nresult = 0\n\n\nfor l, r in intervals:\n s = sum(a[l:r])\n if s >= 0:\n result += s\n\nprint(result)\n", "n, m = map(int, input().split())\r\na = [0] +list(map(int, input().split()))\r\nF = [0] * (n + 1)\r\n\r\nfor i in range(1, n + 1):\r\n F[i] = F[i-1] + a[i]\r\n\r\nans = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n fine = F[r] - F[l - 1]\r\n if fine > 0:\r\n ans += fine\r\n \r\n\r\nprint(ans)", "n, q = map(int, input().split())\nflowers = list(map(int, input().split()))\nsumTillNow = [flowers[0]]\nfor i in range(1, len(flowers)):\n sumTillNow.append(sumTillNow[-1] + flowers[i])\nres = 0\n#print(sumTillNow)\nfor _ in range(q):\n l1, r1 = map(int, input().split())\n l, r = l1-2, r1-1\n #print(l, r, sumTillNow[l], sumTillNow[r])\n if l == -1:\n this = sumTillNow[r]\n else:\n this = sumTillNow[r] - sumTillNow[l]\n if this > 0:\n res += this\nprint(res)", "n, m = map(int, input().split())\r\narr = [*map(int, input().split())]\r\nans = 0\r\nfor i in range(0, m):\r\n s, t = map(int, input().split())\r\n ss = sum(arr[(s-1):(t)])\r\n if ss > 0:\r\n ans += ss\r\nprint(ans)\r\n", "def fun(n,m,arr,sug):\r\n newarr=[sum(arr[i-1:j]) for i,j in sug]\r\n s=0\r\n for i in newarr:\r\n if i>0:\r\n s+=i\r\n return s\r\n \r\nn,m=list(map(lambda x:int(x),input().split()))\r\narr=list(map(lambda x:int(x),input().split()))\r\nsug=[list(map(lambda x:int(x),input().split())) for _ in range(m)]\r\nprint(fun(n,m,arr,sug))", "\r\nif __name__=='__main__':\r\n\tn, m = map(int, input().split())\r\n\ta = list(map(int, input().split()))\r\n\tfor i in range(1, n):\r\n\t\ta[i] += a[i-1]\r\n\tres = 0\r\n\t#print(a)\r\n\tfor i in range(m):\r\n\t\tl, r = map(int, input().split())\r\n\t\tsm = a[r-1]\r\n\t\tif l > 1:\r\n\t\t\tsm -= a[l-2]\r\n\t\t#print(l, r, sm)\r\n\t\tif sm > 0:\r\n\t\t\tres += sm\r\n\tprint(res)", "n, m = map(int, input().split())\r\narr = [0] + list(map(int, input().split()))\r\nbrr = [list(map(int, input().split())) for i in range(m)]\r\npref = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n pref[i] = pref[i - 1] + arr[i]\r\ncnt = 0\r\nfor i in range(m):\r\n cnt += 0 if pref[brr[i][1]]- pref[brr[i][0] - 1] < 0 else pref[brr[i][1]]- pref[brr[i][0] - 1]\r\nprint(cnt)", "res=0 \r\ncnt={}\r\nans=[]\r\nn,q=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nfor _ in range(q):\r\n le,r=map(int,input().split())\r\n if sum(l[le-1:r])>0:\r\n for i in range(le-1,r):\r\n ans.append(l[i])\r\nfrom collections import Counter \r\nc=Counter(ans) \r\nfor i in c:\r\n res+=c[i]*i \r\nprint(res)\r\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\nfor t in range(m):\n l, r = map(int, input().split())\n s = 0\n for i in range(l-1, r): s += a[i]\n if s > 0: ans += s\nprint(ans)\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncsum,msum=0,0\r\n#print(a[0],end=\" \")\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\n #print(a[i],end=' ')\r\n#print()\r\nfor i in range(0,m):\r\n l,r=map(int,input().split())\r\n l,r=l-1,r-1\r\n if l>0 or (l!=0 and l==r):\r\n csum=a[r]-a[l-1]\r\n #print('csum= ',csum)\r\n elif l==0 or (l==r and l==0) :\r\n csum=a[r]\r\n #print('csum= ',csum)\r\n #if l==r and l=0:\r\n \r\n if csum>0:\r\n msum+=csum\r\n #print('msum= ',msum)\r\nprint(msum)", "def arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\nfrom sys import stdin\r\n\r\nn, m = arr_inp()\r\nflower, ans = arr_inp(), 0\r\nfor i in range(m):\r\n l, r = arr_inp()\r\n s = sum(flower[l - 1:r])\r\n if s > 0:\r\n ans +=s\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nps, s = a[:], 0\r\nfor i in range(1,n):\r\n ps[i] += ps[i-1]\r\nfor i in range(m):\r\n x,y = map(int, input().split())\r\n x, y = x-1, y-1\r\n t = ps[y]\r\n if(x > 0):\r\n t -= ps[x-1]\r\n if(t> 0):\r\n s += t\r\nprint(s)", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(m):\r\n s,e = map(int,input().split())\r\n val = 0\r\n for j in range(s-1,e):\r\n val+=l[j]\r\n ans = max(ans+val,ans)\r\nprint(ans)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nres = 0\n\nfor i in range(m):\n l, r = map(int, input().split())\n# print(sum(a[(l-1):r]))\n if sum(a[l-1:r]) > 0:\n res += sum(a[l-1:r])\n\nprint(res)\n", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nprefs=[0]*n\r\nprefs[0]=arr[0]\r\nfor i in range(1,n):\r\n prefs[i]=prefs[i-1]+arr[i]\r\nsum1=0\r\nfor i in range(m):\r\n l,r=map(int,input().split())\r\n l,r=l-1,r-1\r\n if(l==0):\r\n if(prefs[r]>0):\r\n sum1=sum1+prefs[r]\r\n else:\r\n if(prefs[r]-prefs[l-1]>0):\r\n sum1=sum1+prefs[r]-prefs[l-1]\r\nprint(sum1)", "N, M = map(int, input().split())\nArr = list(map(int, input().split()))\nscore = 0\nfor _ in range(M):\n A, B = map(int, input().split())\n tot = 0\n for i in range(A-1, B):\n tot += Arr[i]\n if tot > 0:\n score += tot\nprint(score)\n", "n,m=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\nt=[]\r\nt1=[]\r\n\r\nfor i in range(m):\r\n l1=[]\r\n l2=[]\r\n a,b=map(int,input().split())\r\n for j in range(a-1,b):\r\n l1.append(l[j])\r\n l2.append(j)\r\n \r\n t.append(l1)\r\n t1.append(l2)\r\n\r\n \r\nif max(l)<=0:\r\n print(\"0\")\r\n\r\nelse:\r\n q=[0]*100\r\n\r\n for i in range(len(t)):\r\n k=sum(t[i])\r\n if k>0:\r\n for j in range(len(t[i])):\r\n q[t1[i][j]]+=1\r\n \r\n su=0\r\n for i in range(n):\r\n su+=l[i]*q[i]\r\n\r\n print(su)\r\n", "n, m = list(map(int, input().split()))\r\nflowers = list(map(int, input().split()))\r\nseqs = [list(map(int, input().split())) for i in range(m)]\r\n\r\nmax_mood = 0\r\nfor (l, r) in seqs:\r\n max_mood += max(0, sum(flowers[l - 1:r]))\r\n\r\nprint(max_mood)\r\n", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ntemp=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n k=sum(x[a-1:b])\r\n if(k>0):\r\n temp+=k\r\nprint(temp) ", "def main():\r\n\t(n, m) = (int(x) for x in input().split())\r\n\tmoods = [int(x) for x in input().split()]\r\n\tsubs = [None] * m\r\n\tfor i in range(m):\r\n\t\t(l, r) = (int(x) for x in input().split())\r\n\t\tsubs[i] = (l, r)\r\n\tprint(solver(moods, subs))\r\n\r\ndef solver(moods, subs):\r\n\tn = len(moods)\r\n\tgrid = [[None] * (n + 1) for i in range(n)]\r\n\t# first line\r\n\ttotal = 0\r\n\tgrid[0][0] = 0\r\n\tfor j in range(n):\r\n\t\ttotal += moods[j]\r\n\t\tgrid[0][j+1] = total\r\n\t#print(grid)\r\n\tfor i in range(1, n):\r\n\t\tfor j in range(i, n + 1):\r\n\t\t\tgrid[i][j] = grid[i-1][j] - moods[i-1]\r\n\t#print(grid)\r\n\ttotal = 0\r\n\tfor (l, r) in subs:\r\n\t\t(i, j) = (l - 1, r)\r\n\t\tif grid[i][j] > 0:\r\n\t\t\ttotal += grid[i][j]\r\n\treturn total\r\n\r\n# moods1 = [1, 2, 3, 4]\r\n# subs1 = [(1, 3), (2, 4), (1, 1)]\t\r\n# print(solver(moods1, subs1))\r\n\r\n# moods2 = [1, -2, 1, 3, -4]\r\n# subs2 = [(1, 2), (4, 5), (3, 4), (1, 4)]\t\r\n# print(solver(moods2, subs2))\r\n\r\nmain()\r\n\r\n\r\n", "n , k = map(int , input().split())\r\narr = list(map(int , input().split()))\r\n\r\na = list()\r\na.append(arr[0])\r\n\r\nfor i in range(1 , n):\r\n a.append(a[i-1]+arr[i])\r\n \r\n\r\nc = 0\r\n\r\nfor i in range(k):\r\n l ,r = map(int , input().split())\r\n \r\n if(l == 1):\r\n s = a[r-1];\r\n \r\n \r\n else:\r\n s = a[r-1]-a[l-2];\r\n \r\n if s >= 0:\r\n c += s\r\n \r\n \r\n \r\nprint(c)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nres = 0\nfor i in range(m):\n curr = 0\n l, r = map(int, input().split())\n for j in range(l - 1, r):\n curr += a[j]\n if curr > 0:\n res += curr\nprint(res)", "n,m = [int(x) for x in input().strip().split()]\nmoods = [int(x) for x in input().strip().split()]\n\ndp = [0] * (n + 1)\ndp[1] = moods[0]\nfor i in range(2, n + 1):\n dp[i] = dp[i-1] + moods[i-1]\n\ntotal = 0\n\nfor i in range(m):\n l,r = [int(x) for x in input().strip().split()]\n # can't be negative\n sub_sum = dp[r] - dp[l-1]\n if sub_sum > 0:\n total += sub_sum\n\nprint(total)", "#!/usr/bin/env python3\r\n\r\ndef main():\r\n try:\r\n while True:\r\n n, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n result = 0\r\n for i in range(m):\r\n left, right = map(int, input().split())\r\n s = sum(a[left - 1:right])\r\n if s > 0:\r\n result += s\r\n print(result)\r\n\r\n except EOFError:\r\n pass\r\n\r\nmain()\r\n", "cases = input().split()\r\nn = int(cases[0])\r\nm = int(cases[1])\r\narray = input().split()\r\nsums = 0\r\nfor i in range(m):\r\n\tinputs = input().split()\r\n\tstart = int(inputs[0])\r\n\tend = int(inputs[1])\r\n\tsub = array[start-1:end]\r\n\tvalue = 0\r\n\tfor j in sub:\r\n\t\tvalue += int(j)\r\n\tif value >= 0:\r\n\t\tsums += value\r\nprint(sums)", "n,m=map(int,input().split())\r\na=[int(_) for _ in input().split()]\r\nans=0\r\nfor i in range(m):\r\n l,r=map(int,input().split())\r\n s=0\r\n for j in range(l-1,r):\r\n s+=a[j]\r\n if s>0 : ans+=s\r\nprint(ans)", "# https://codeforces.com/problemset/problem/740/B\r\n\r\nfirst_line_input = input()\r\n\r\nnumber_of_flowers = list(map(int, first_line_input.split(\" \")))[0]\r\n\r\nnumber_of_suggestions = list(map(int, first_line_input.split(\" \")))[1]\r\n\r\nflower_mood_list = list(map(int, input().split(\" \")))\r\n\r\nsub_array_indices = []\r\n\r\nfor i in range(number_of_suggestions):\r\n\tindex_i = list(map(int, input().split(\" \")))\r\n\tsub_array_indices.append(list(map(lambda x:x-1, index_i)))\r\n\r\n\r\n#print(\"number of flowers:\", number_of_flowers)\r\n#print(\"number of mother's suggestions:\", number_of_suggestions)\r\n#print(\"list of flowers: \", flower_mood_list)\r\n#print(\"sub-arrays-indices: \", sub_array_indices)\r\n\r\nfinal_answer = 0\r\n\r\nfor suggestion in range(number_of_suggestions):\r\n\t#print(\"suggestion number: \", suggestion)\r\n\tsuggestion_array_sum = 0\r\n\tfor sub_array_index in range(sub_array_indices[suggestion][0], sub_array_indices[suggestion][1]+1):\r\n\t\tsuggestion_array_sum = suggestion_array_sum + flower_mood_list[sub_array_index]\r\n\r\n\t#print(\"suggestion sum: \", suggestion_array_sum)\r\n\r\n\tif suggestion_array_sum > 0:\r\n\t\tfinal_answer = final_answer + suggestion_array_sum\r\n\r\nprint(final_answer)", "class NumArray(object):\r\n def __init__(self, nums):\r\n \"\"\"\r\n initialize your data structure here.\r\n :type nums: List[int]\r\n \"\"\"\r\n self.accu = [0]\r\n for num in nums: \r\n self.accu.append(self.accu[-1] + num),\r\n\r\n def sumRange(self, i, j):\r\n \"\"\"\r\n sum of elements nums[i..j], inclusive.\r\n :type i: int \r\n :type j: int\r\n :rtype: int \r\n \"\"\"\r\n return self.accu[j + 1] - self.accu[i]\r\n\r\nn, m = list(map(int, input().split(' ')))\r\nnums = list(map(int, input().split(' ')))\r\nnumArray = NumArray(nums)\r\narr = []\r\nfor i in range(m):\r\n k, l = list(map(int, input().split(' ')))\r\n arr.append(numArray.sumRange(k-1, l-1))\r\n\r\ns=0\r\nfor el in arr:\r\n if el > 0:\r\n s+=el\r\nprint(s)\r\n", "ii = lambda: int(input())\r\nmi = lambda: map(int, input().split())\r\nli = lambda: list(mi())\r\nsi = lambda: input()\r\n\r\nn, m = mi()\r\nl = li()\r\nh = 0\r\n\r\nfor _ in range(m): x, y = mi(); h += max(0, sum((l[k] for k in range(x-1, y))))\r\n\r\nprint(h)", "read=lambda:map(int,input().split())\r\nn,m=read()\r\na=list(read())\r\ns=[0]*(n+1)\r\nfor i in range(n):\r\n s[i+1]=s[i]+a[i]\r\nans=0\r\nfor _ in range(m):\r\n l,r=read()\r\n t=s[r]-s[l-1]\r\n if t>0:\r\n ans+=t\r\nprint(ans)\r\n", "n, m = map(int, input().split() )\r\nf = list(map(int, input().split() ))\r\ns = [0]*m\r\nfor i in range(m):\r\n s[i] = list(map(int, input().split() ))\r\n\r\nt = [0]*m\r\n\r\nfor i in range(m):\r\n x = 0\r\n for j in range(s[i][0] - 1, s[i][1] ):\r\n x += f[j]\r\n t[i] = x\r\nx = 0\r\nt = sorted(t)\r\nfor i in range(len(t)-1, -1, -1):\r\n if t[i] > 0:\r\n x+=t[i]\r\nprint(x)\r\n\r\n", "n,m = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nans = 0\r\nfor j in range(m):\r\n per1,per2 = map(int,input().split())\r\n cou = sum(A[per1-1:per2])\r\n if cou > 0:\r\n ans += cou\r\nprint(ans)", "n, m = map(int, input().split())\r\n \r\na = [int(i) for i in input().split()]\r\n \r\ngood_sub_arr = []\r\n \r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n l -= 1\r\n \r\n cur_happiness = 0\r\n for i in range(l, r):\r\n cur_happiness += a[i]\r\n \r\n if cur_happiness > 0:\r\n good_sub_arr.append((l, r))\r\n \r\ntotal_happiness = 0\r\n \r\nfor i in range(n):\r\n mul = 0\r\n for j in range(len(good_sub_arr)):\r\n if good_sub_arr[j][0] <= i and i < good_sub_arr[j][1]:\r\n mul += 1\r\n \r\n total_happiness += mul * a[i]\r\n \r\nprint(total_happiness)", "n, m = [int(i) for i in input().split()]\n\nflowers_moods = [int(i) for i in input().split()]\n\nsubarrays = [[int(i) - 1 for i in input().split()] for j in range(m)]\n\n\ndef find_sum_sub_array(s, f, arr):\n sum = 0\n for i in range(s, f + 1):\n sum += arr[i]\n\n return sum\n\n\ndef main(flowers_moods, subarrays):\n lst_sums = []\n for subarr in subarrays:\n s = find_sum_sub_array(subarr[0], subarr[1], flowers_moods)\n lst_sums.append(s)\n\n lst_sums.sort(reverse=True)\n happiness = 0\n for sum in lst_sums:\n if sum <= 0:\n break\n happiness += sum\n return happiness\n\nprint(main(flowers_moods, subarrays))\n\n\n\n\n\n\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\npm = [0]*n\r\npm[0] = arr[0]\r\nfor i in range(n):\r\n pm[i] = pm[i - 1] + arr[i]\r\n\r\nans = 0\r\nsum = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n l -= 1\r\n r -= 1\r\n if l > 0:\r\n ans = pm[r] - pm[l - 1]\r\n else:\r\n ans = pm[r]\r\n if ans > 0:\r\n sum += ans\r\nif sum > 0:\r\n print(sum)\r\nelse:\r\n print(\"0\")\r\n\r\n", "from math import *\r\nfrom sys import *\r\nfrom queue import *\r\nfrom decimal import *\r\n\r\nn,m=(int(z) for z in input().split())\r\ns=[int(z) for z in input().split()]\r\nR=[]\r\nfor i in range(m):\r\n le,r=(int(z) for z in input().split())\r\n summ=0\r\n for j in range(le-1,r):\r\n summ+=s[j]\r\n R.append(summ)\r\nans=0\r\nfor i in R:\r\n if i>=0:\r\n ans+=i\r\nprint(ans)", "from typing import List\r\n\r\n# Array re arrange a[i] = j to a[j] =1\r\n# O(m)\r\n# O(n) space\r\nclass Solution:\r\n def alaynaFlowers(self, arr: List[int], n: int,m: int) -> int:\r\n k = len(arr)\r\n psum = [0] * n\r\n psum[0] = arr[0]\r\n for i in range(1,k):\r\n psum[i] = psum[i-1] + arr[i]\r\n\r\n total = 0\r\n # print(psum)\r\n for i in range(0,m):\r\n l,r = map(int,input().split())\r\n l -= 1\r\n r -= 1\r\n\r\n if l < 1:\r\n sum = psum[r]\r\n else:\r\n sum = psum[r] - psum[l-1]\r\n # print(sum)\r\n if sum > 0: total += sum\r\n\r\n return total\r\n\r\n'''\r\ninput\r\n5 4\r\n1 -2 1 3 -4\r\n0 1\r\n3 4\r\n2 3\r\n0 3\r\noutput\r\n7\r\n'''\r\nif __name__ == '__main__':\r\n sol = Solution()\r\n n,m = map(int,input().split())\r\n\r\n arr = [int(i) for i in input().split()]\r\n total = sol.alaynaFlowers(arr,n,m)\r\n\r\n print(total)\r\n", "def cin():\n return list(map(int, input().split()))\n \nn,m=cin()\nA=cin()\ns=0\nfor i in range(m):\n a,b=cin()\n B = sum(A[a-1:b])\n s+=max(0,B)\nprint(s)\n\n \t\t \t \t \t \t\t \t\t \t\t\t\t", "no_flowers, no_subarrays = map(int, input().split())\r\nflowers = [int(x) for x in input().split()]\r\n\r\ntotal_happiness = 0\r\n\r\nfor i in range(no_subarrays):\r\n\tdata = [int(x) for x in input().split()]\r\n\r\n\ttmp = sum(flowers[(data[0]-1):data[1]])\r\n\r\n\tif total_happiness + tmp > total_happiness:\r\n\t\ttotal_happiness += tmp\r\n\r\nprint(total_happiness)\r\n\r\n", "s=list(map(int,input().split()))\r\nn=s[0]\r\nm=s[1]\r\nl=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(m):\r\n arr.append(list(map(int,input().split())))\r\n print()\r\npre=[None for x in range(n)]\r\npre[0]=l[0]\r\nfor i in range(1,n):\r\n pre[i]=pre[i-1]+l[i]\r\nans=0\r\nfor j in arr:\r\n l=j[0]-1\r\n r=j[1]-1\r\n if l!=0:\r\n if pre[r]-pre[l-1]>0:\r\n ans+=(pre[r]-pre[l-1])\r\n else:\r\n if pre[r]>0:\r\n ans+=pre[r]\r\n\r\n\r\n\r\nprint(ans)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom itertools import accumulate\r\n\r\nn, m = map(int, input().split())\r\nw = list(accumulate(map(int, input().split())))\r\ns = 0\r\nfor _ in range(m):\r\n l, r = map(int, input().split())\r\n c = w[r-1] - (w[l-2] if l > 1 else 0)\r\n if c > 0:\r\n s += c\r\nprint(s)", "\r\nn, m = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nans = 0\r\nfor _ in range(m):\r\n\tl, r = map(int, input().split())\r\n\tans += max(0, sum(li[l - 1:r]))\r\n\r\nprint(ans)", "n, m = [int(x) for x in input().split()]\r\nif n == 0:\r\n exit()\r\narr = list(map(int,input().rstrip().split()))\r\nans = 0\r\npMax = []\r\npMax.append(arr[0])\r\nfor i in range(1,n):\r\n pMax.append(pMax[i-1]+arr[i])\r\nfor i in range(m):\r\n a, b = [int(x) for x in input().split()]\r\n if a > 1:\r\n diff = pMax[b-1] - pMax[a-2]\r\n else:\r\n diff = pMax[b-1]\r\n\r\n if diff > 0:\r\n ans+=diff\r\nprint(ans)\r\n", "n, m = map(int, input().split())\n\nA = list(map(int, input().split()))\n\nres = 0\n\nfor _ in range(m):\n l, r = map(int, input().split())\n\n sum = 0\n\n for i in range(l - 1, r):\n sum += A[i]\n\n if sum > 0:\n res += sum\n\nprint(res)\n", "n,m=map(int,input().split())\nip=list(map(int,input().split()))\nans=0\nfor i in range(m):\n a,b=map(int,input().split())\n s=0\n a-=1\n b-=1\n for j in range(a,b+1):\n s+=ip[j]\n if s>0:\n ans+=s\nprint(ans)\n", "n,m = map(int, input().split())\r\nnum = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor _ in range(m):\r\n a,b = map(int, input().split())\r\n cnt = sum(num[a-1:b])\r\n if cnt>0: ans += cnt\r\nprint(ans)", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nprefixSum = [0]*n\r\nprefixSum[0] = arr[0]\r\n\r\nfor i in range(1, n):\r\n prefixSum[i] = prefixSum[i-1] + arr[i]\r\nans = 0\r\n\r\nfor _ in range(m):\r\n l, r = map(int, input().split())\r\n summ = 0\r\n if l==1:\r\n summ = prefixSum[r-1]\r\n else:\r\n summ = prefixSum[r-1] - prefixSum[l-2]\r\n\r\n if summ>0:\r\n ans += summ\r\n\r\nprint(ans)", "n,m= map(lambda x:int(x),input().split())\r\na = list(map(lambda x:int(x),input().split()))\r\ns = [0]*m\r\nfor i in range(m):\r\n\tl,r= map(lambda x:int(x),input().split())\r\n\ts[i] = max(sum(a[l-1:r]),0)\r\nprint(sum(s))", "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\nfor i in range(m):\n x, y = map(int, input().split())\n curr = sum(a[x - 1 : y])\n curr = max(0, curr)\n ans += curr\n\nprint(ans)\n", "def main():\r\n m,n= list(map(int,input().strip().split()))[:2]\r\n\r\n l=[]\r\n sl=[]\r\n\r\n l = list(map(int,input().strip().split()))[:m]\r\n\r\n flag=[]\r\n for i in range(n):\r\n\r\n flag= list(map(int,input().strip().split()))[:2]\r\n sl.append(flag)\r\n sum=[]\r\n sum.append(l[0])\r\n for i in range(1,m):\r\n\r\n\r\n sum.append(l[i]+sum[i-1])\r\n s=list(sum)\r\n total=0\r\n for i in sl:\r\n a=i[0]-1\r\n b=i[1]-1\r\n\r\n if a==0:\r\n\r\n if sum[b]>0:\r\n total=total+sum[b]\r\n else:\r\n if sum[b]-sum[a-1]>0:\r\n total=total+sum[b]-sum[a-1]\r\n\r\n print(total)\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a,b=map(int,input().split())\r\nz=[0]\r\nfor i in map(int,input().split()):z+=[z[-1]+i]\r\ns=0\r\nfor _ in \" \"*b:\r\n x,y=map(int,input().split())\r\n s+=max(0,z[y]-z[x-1])\r\nprint(s)", "import random, math\nfrom copy import deepcopy as dc\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 calculate the range values\ndef range_value(li, l, r):\n\tif l == 1:\n\t\tst = 0\n\telse:\n\t\tst = li[l-2]\n\treturn li[r-1] - st\n\n# Function to call the actual solution\ndef solution(n, m, li, arr):\n\t# Prefix Sum Array\n\tprefix_sum = [0] * n\n\tprefix_sum[0] = li[0]\n\tfor i in range(1, n):\n\t\tprefix_sum[i] = li[i] + prefix_sum[i-1]\n\t# print(prefix_sum)\n\t# print(range_value(prefix_sum, 2, 2))\n\tans = 0\n\tfor i in arr:\n\t\tval = range_value(prefix_sum, i[0], i[1])\n\t\tif val > 0:\n\t\t\tans += val\n\t\t# print(val)\n\treturn ans\n\n\n# Function to take input\ndef input_test():\n\tn, m = list(map(int, input().strip().split(\" \")))\n\tli = list(map(int, input().strip().split(\" \")))\n\tarr = []\n\tfor i in range(m):\n\t\tl, r = map(int, input().strip().split(\" \"))\n\t\tarr.append([l, r])\n\tout = solution(n, m, li, arr)\n\tprint(out)\n\t# for _ in range(int(input())):\n\t\t# solution()\n\n# Function to check test my code\ndef test():\n\tpass\n\n\ninput_test()\n# test()", "import sys\r\nfrom math import floor, gcd,factorial\r\nfrom collections import deque\r\n\r\n\r\ninput = sys.stdin.readline\r\ndef printf(x, end='\\n'):\r\n sys.stdout.write(str(x) + end) \r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\ndef main():\r\n T=1\r\n #T=int(input())\r\n def solve():\r\n arr=list(map(int,input().split()))\r\n n,m=arr[0],arr[1]\r\n arr=list(map(int,input().split()))\r\n prefix=[0]*(n+1)\r\n ans=0\r\n dict={}\r\n for i in range(1,n+1):\r\n prefix[i]=arr[i-1]+prefix[i-1]\r\n for i in range(m):\r\n b=list(map(int,input().split()))\r\n l,r=b[0],b[1]\r\n if(prefix[r]-prefix[l-1]>0):\r\n for i in range(l-1,r):\r\n if(i in dict.keys()):\r\n dict[i]+=1\r\n else :\r\n dict[i]=1 \r\n score=0\r\n for keys in dict:\r\n score+=arr[keys]*dict[keys]\r\n print(score) \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n for i in range(T):\r\n solve()\r\n pass \r\n\r\n \r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, q = [int(x) for x in input().split()]\r\n\r\narr1 = [int(x) for x in input().split()]\r\n\r\nprefix_sum = [0]*len(arr1)\r\nprefix_sum[0] = arr1[0]\r\nfor i in range(1, n):\r\n prefix_sum[i] = prefix_sum[i-1]+ arr1[i]\r\n# print(prefix_sum)\r\nresult = 0\r\nfor i in range(q):\r\n sum1 = 0\r\n left, right = [int(x) for x in input().split()]\r\n left-=1\r\n right-=1\r\n sum1= prefix_sum[right]-prefix_sum[left] + arr1[left]\r\n\r\n if sum1>0:\r\n result+=sum1\r\n # print(result)\r\nprint(result)", "import math\r\nk = (input().split())\r\nn = int(k[0])\r\nm = int(k[1])\r\na = []\r\n\r\nk = (input().split())\r\n\r\nfor i in range(n):\r\n a.append(int(k[i]))\r\ns = 0\r\nres = 0\r\nfor i in range(m):\r\n s = 0\r\n k = (input().split())\r\n l = int(k[0])\r\n r = int(k[1])\r\n for j in range(l-1,r):\r\n s += a[j]\r\n if s>=0:\r\n res+=s\r\n\r\nprint(res)\r\n", "n, m = map(int, input().split())\n\nar = [int(i) for i in input().split()]\n\nleftsum = [0 for _ in range(n)]\nleftsum[0] = ar[0]\nfor i in range(1,n):\n\tleftsum[i] = leftsum[i-1] + ar[i]\n\nqueries = []\ntotals = []\nfor _ in range(m):\n\tl, r = map(int, input().split())\n\tl-=1\n\tr-=1\n\tqueries.append((l,r))\n\t\n\ttot = leftsum[r]\n\tif l!=0:tot -= leftsum[l-1]\n\ttotals.append(tot)\n\ncounter = [ 0 for _ in range(n)]\nans = 0\nfor _ in range(m):\n\tidx = totals.index(max(totals))\n\tl,r = queries[idx]\n\ttemp = 0\n\tfor i in range(l,r+1):\n\t\tcounter[i]+=1\n\tfor i in range(n):\n\t\ttemp += counter[i]*ar[i]\n\n\tif temp>ans:\n\t\tans = temp\n\n\ttotals[idx] = -10**9 \nprint(ans)", "n , m = map(int, input().split())\nc = list(map(int, input().split()))\npref = [c[0]]\nfor i in range(1, len(c)):\n pref.append(pref[-1] + c[i])\nsm = 0\nfor i in range(m):\n b, e = map(int, input().split())\n if b > 1:\n k = pref[e - 1] - pref[b - 2]\n else:\n k = pref[e - 1]\n if k > 0:\n sm += k\nprint(sm)", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nsubarrs = [list(map(int, input().split())) for i in range(m)]\r\nsums = []\r\nsum = 0\r\n\r\nfor i in arr:\r\n sum = sum+i\r\n sums.append(sum)\r\n\r\nmaxSum = 0\r\nfor subarr in subarrs:\r\n subarraySum = sums[subarr[1] - 1] if subarr[0] == 1 else (sums[subarr[1]-1] - sums[subarr[0]-2])\r\n if subarraySum > 0:\r\n maxSum = maxSum + subarraySum\r\n\r\nprint(maxSum)", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nt=0\r\nfor i in range(m):\r\n b=[int(i)-1 for i in input().split()]\r\n if sum (a[b[0]:b[1]+1])>0:\r\n t+=sum (a[b[0]:b[1]+1])\r\nprint(t)\r\n", "from itertools import accumulate\n\nn, m = map(int, input().split())\nA = [0] + [int(x) for x in input().split()]\nP = list(accumulate(A))\ns = 0\n\nfor i in range(m):\n l, r = map(int, input().split())\n k = P[r] - P[l-1]\n if k > 0: s += k\n\nprint(s)\n", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nii = lambda: int(input())\nmi = lambda: map(int, input().split())\nli = lambda: list(mi())\nsi = lambda: input()\n\nn, m = mi()\nl = li()\nh = 0\n\nfor _ in range(m): x, y = mi(); h += max(0, sum((l[k] for k in range(x-1, y))))\n\nprint(h)\n\n\n\n \n\n", "n,m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nd = {x+1:c[x] for x in range(n)}\r\nans = 0\r\nfor _ in range(m):\r\n tem = 0\r\n a,b= map(int,input().split())\r\n for x in range(a,b+1):\r\n tem += d[x]\r\n if tem>0: ans += tem\r\nprint(ans)", "n, m = map(int, input().split())\r\nl1 = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n sum1 = 0\r\n l, r = map(int, input().split())\r\n l -= 1\r\n r -= 1\r\n for j in range(l, r + 1):\r\n sum1 += l1[j]\r\n if sum1 > 0:\r\n ans += sum1\r\nprint(ans)\r\n ", "n, m = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(m):\r\n d, f = map(int, input().split())\r\n sb = sum(a[d - 1: f])\r\n if sb > 0:\r\n ans += sb\r\nprint(ans)", "n, m = map(int, input().split())\r\nmood = [int(c) for c in input().split()]\r\n\r\nans = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n _sum = sum(mood[l-1:r])\r\n if _sum >= 0:\r\n ans += _sum\r\n\r\nprint(ans) \r\n", "n,m = [int(x) for x in input().split()]\r\nflowers = [int(x) for x in input().split()]\r\nhappy_sum = 0\r\nfor i in range(m):\r\n\tl,r = [int(x) for x in input().split()]\r\n\tsum_fl = sum(flowers[l-1:r])\r\n\tif sum_fl > 0:\r\n\t\thappy_sum += sum_fl\r\n\r\nprint(happy_sum)", "\r\n# 1<= n,m <= 100\r\n# -100 <= ai <= 100\r\n\r\nfrom collections import defaultdict\r\n\r\ndef solve(n,m,arr,subarr):\r\n\t\r\n\t# mood of ith flower is ai.\r\n\t\r\n\t# If we get negative as ans then print 0\r\n\t# Cuz we can always choose none.\r\n\t\r\n\t# Choose subarrays with sum>=0\r\n\t# That's all\r\n\t\r\n\thm = defaultdict(int)\r\n\t\r\n\t# Converting to one based indexing.\r\n\tfor l,r in subarr :\r\n\t\thm[(l-1,r-1)] +=1\r\n\t\r\n\tans = 0\r\n\t\r\n\tfor st in range(n):\r\n\t\ttsum = 0\r\n\t\tfor en in range(st,n):\r\n\t\t\t# We can choose that\r\n\t\t\ttsum += arr[en]\r\n\t\t\tif (st,en) in hm and tsum>=0 :\r\n\t\t\t\tans+= (tsum)*hm[(st,en)]\t\r\n\t\t\t\t\r\n\tprint(ans)\r\n\t\r\nn,m = map(int,input().split())\r\narr= list(map(int,list(input().split())))\r\nsubarr = []\r\nfor i in range(m):\r\n\tli,ri = map(int,input().split())\r\n\tsubarr.append([li,ri])\r\n\r\nsolve(n,m,arr,subarr)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nout = 0\r\nl = [] # list of index tuples\r\nfor i in range(m):\r\n l.append(tuple(map(int, input().split())))\r\n\r\nfor tup in l:\r\n #print(a[tup[0]-1:tup[1]])\r\n val = sum(a[tup[0]-1:tup[1]])\r\n if val > 0:\r\n out += val\r\nprint(out)", "from itertools import accumulate as pre\r\nn, m = map(int, input().split())\r\nmood = list(map(int, input().split()))\r\nmoodseg = [0]+list(pre(mood))\r\nhap = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n if moodseg[r] - moodseg[l - 1] > 0: hap += (moodseg[r] - moodseg[l - 1])\r\nprint(hap)\r\n", "n, m = list(map(int, input().split()))\r\nline = list(map(int, input().split()))\r\nanswer = 0\r\nfor i in range(m):\r\n a, b = list(map(int, input().split()))\r\n s = 0\r\n for j in range(a - 1, b):\r\n s += line[j]\r\n if s >= 0:\r\n answer += s\r\nprint(answer) \r\n", "n, m = [int(i) for i in input().split()]\namood = [int(i) for i in input().split()]\nmaxval = 0\ncumulant = [0 for i in range(n+1)]\nfor i in range(1, n+1):\n cumulant[i] = cumulant[i-1] + amood[i-1]\nfor i in range(m):\n l, r = [int(j) for j in input().split()]\n tmp = cumulant[r] - cumulant [l-1]\n if tmp > 0:\n maxval += tmp\nprint(maxval)", "n, m = list(map(int, input().split()))\na = list(map(int, input().split()))\ntotal = 0\nfor i in range(m):\n l, r = list(map(int, input().split()))\n ai = a[l-1:r]\n sumai = sum(ai)\n if (sumai>0):\n total += sumai\n\nprint(total)\n", "from sys import prefix\n\n\nn, q = [int(x) for x in input().split()]\narr = [int(x) for x in input().split()]\n\nprefixSum =[sum(arr[ :i+1]) for i in range(len(arr))]\n\n\n# print(prefixSum)\ntotal = 0\nwhile q:\n strtIdx , endIdx = [int(x) for x in input().split()]\n strtIdx-=1\n endIdx-=1\n if strtIdx==0:\n sum = prefixSum[endIdx]\n else:\n sum = prefixSum[endIdx]-prefixSum[strtIdx-1]\n q-=1\n if sum>0:\n total+=sum\nprint(total)\n \n\n", "#Codeforces : Alyona And Flowers\r\nn,m=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nl=[[int(x) for x in input().split()] for y in range(m)]\r\nresult=0\r\nfor p,q in l:\r\n ssum=0\r\n for x in range(p-1,q,1):\r\n ssum+=a[x]\r\n \r\n if(ssum>0):\r\n result+=ssum\r\n else:\r\n pass\r\n \r\nprint(result)\r\n ", "n, m = map(int, input().split())\nv = list(map(int, input().split()))\nans = 0\nfor i in range(m):\n\ta, b = map(int, input().split())\n\tans = max(ans, sum(v[a - 1: b]) + ans)\nprint(ans)", "n,m=map(int,input().split())\r\nl=[0]+list(map(int,input().split()))\r\nf=[0]*(n+1)\r\nfor _ in range(m):\r\n i,j=map(int,input().split())\r\n if sum(l[i:j+1])>0:\r\n for ii in range(i,j+1):\r\n f[ii]+=1\r\nans=0\r\nfor i in range(n+1):\r\n ans+=f[i]*l[i]\r\nprint(ans)", "n, m = map(int, input().split())\r\nd = [0]\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n d.append(d[-1] + a[i])\r\n\r\nnum = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n if d[r] - d[l - 1] > 0:\r\n num += d[r] - d[l - 1]\r\n\r\nprint(num)\r\n", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nsums=0\r\nl=[]\r\ng=[]\r\nfor i in range(m):\r\n b,c=[int(i) for i in input().split()]\r\n l=a[b-1:c]\r\n c=set(l)\r\n for i in c:\r\n sums=sums+(i*l.count(i))\r\n if(sums<0):\r\n sums=0\r\n else:\r\n g.append(sums)\r\n sums=0\r\nprint(sum(g))\r\n", "n, m = map(int, input().split())\r\nL = list(map(int, input().split()))\r\nM = [0] * n\r\nans = 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n if sum(L[a - 1:b]) > 0:\r\n for j in range(a - 1, b):\r\n M[j] += 1\r\nfor i in range(n):\r\n ans += L[i] * M[i]\r\n \r\nprint(ans)\r\n#print(M)\r\n \r\n", "n,m = map(int, input().strip().split())\r\narr = list(map(int, input().strip().split()))\r\n\r\n# preSum = [0]*n\r\npreSum = [arr[0]]\r\nfor i in range(1,n):\r\n\tans = preSum[i-1] + arr[i]\r\n\tpreSum.append(ans)\r\n# print(preSum)\r\nres = 0\r\nfor i in range(m):\r\n\tl,r = map(int, input().strip().split())\r\n\tif(l == 1):\r\n\t\tans = preSum[r-1]\r\n\t\t# print(ans)\r\n\telse:\r\n\t\tans = preSum[r-1] - preSum[l-2]\r\n\t\t# print(ans)\r\n\tif (ans>0):\r\n\t\tres += ans\r\nprint(res)", "n,t = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\npresum = []\r\npresum.append(arr[0])\r\nfor i in range(1,n):\r\n presum.append(arr[i] + presum[i-1])\r\n\r\nans = 0\r\nfor _ in range(t):\r\n i, j = map(int, input().split())\r\n x = presum[j-1]-presum[i-2] if i>1 else presum[j-1]\r\n ans += max(0, x)\r\nprint(ans)", "from math import ceil\r\nfrom sys import stdin ,stdout \r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\nn,m=map(int,input().split()) ; arr=list(map(int,input().split())) ; ans=0\r\nfor i in range(1,n):\r\n arr[i]+=arr[i-1]\r\nfor i in range(m):\r\n l,r=map(int,input().split()) ; l-=1 ; r-=1\r\n if l==0:\r\n if arr[r]>0:\r\n ans+=arr[r]\r\n else:\r\n if arr[r]-arr[l-1]>0:\r\n ans+=arr[r]-arr[l-1]\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns = [0]\r\nk=0\r\nfor i in l:\r\n\ts.append(s[k]+i)\r\n\tk+=1\r\ntot=0\r\nfor __ in range(m):\r\n\ta,b=map(int,input().split())\r\n\tif(s[b]-s[a-1]>=0):\r\n\t\ttot+=(s[b]-s[a-1])\r\nprint(tot)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=[0 for i in range(n)]\r\nsu=[]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n su.append([a,b])\r\n if sum(l[a-1:b])>0:\r\n for j in range(a-1,b):\r\n l1[j]+=1\r\nans=0\r\n#print(l1)\r\nfor i in range(n):\r\n ans+=l[i]*l1[i]\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\narr = [int(x) for x in input().split()]\r\nd = [0] * n\r\nans = 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n \r\n s = 0\r\n for j in range(a-1, b):\r\n s += arr[j]\r\n if s > 0:\r\n ans += s\r\nprint(ans)\r\n\r\n", "def gum(mas,a,b):\r\n k=0\r\n for i in range(a,b+1):\r\n k+=mas[i]\r\n \r\n return k\r\n\r\ns=input().split()\r\nn=int(s[0])\r\nm=int(s[1])\r\nmas=[]\r\ns=input().split()\r\nfor i in range(0,n):\r\n mas.append(int(s[i]))\r\n \r\nk=0\r\ni=0\r\nwhile i<m:\r\n s=input().split()\r\n a=int(s[0])\r\n b=int(s[1])\r\n if gum(mas,a-1,b-1)>0:\r\n k+=gum(mas,a-1,b-1)\r\n i+=1\r\nprint(k)", "n, m = map(int, input().split())\r\nfeels = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n in1, in2 = map(int, input().split())\r\n s = sum(feels[in1 - 1:in2])\r\n if s >= 0:\r\n ans += s\r\nprint(ans)", "p, q = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\nans = 0\r\nb = [(list(map(int, input().split()))) for i in range(q)]\r\nfor i in range(q):\r\n s = 0\r\n for j in range(b[i][0] - 1, b[i][1]):\r\n s += arr[j]\r\n if s > 0:\r\n ans += s\r\nprint(ans)\r\n", "n, m = map(int, input().split())\narr = list(map(int, input().split()))\n\nans = 0\nfor _ in range(m):\n l, r = map(int, input().split())\n s = sum(arr[l - 1: r])\n ans += max(s, 0)\n\nprint(ans)", "n, m = list(map(int, input().split(' ')))\n\nl = list(map(int, input().split(' ')))\nsl = [0]\nfor i in range(len(l)):\n sl.append(l[i] + sl[i])\n\nans = 0\nfor i in range(m):\n u, v = list(map(int, input().split(' ')))\n s = sl[v] - sl[u - 1]\n if s > 0:\n ans += s\n\nprint(ans)\n", "n,m=list(map(int,input().split()))\r\narra=list(map(int,input().split()))\r\nsu=0\r\nfor e in range(m):\r\n s,f=list(map(int,input().split()))\r\n s-=1\r\n q=0\r\n for i in range(s,f):\r\n q+=arra[i]\r\n if q>0:\r\n su+=q\r\nprint(su)\r\n", "from functools import lru_cache, reduce\r\nfrom bisect import bisect_left, bisect_right\r\nfrom types import GeneratorType\r\nimport sys\r\n\r\nMOD = 10**9+7\r\nHMOD = 998244353\r\nMAXN = 10**5+5\r\nINF = 1e20\r\nEPS = 1e-9\r\n\r\ninput = lambda : sys.stdin.readline().strip()\r\nprint = lambda *args : sys.stdout.write(\" \".join(map(str, args)) + \"\\n\")\r\nwrite = lambda *args : sys.stdout.write(\" \".join(map(str, args)))\r\n\r\ngetint = lambda : int(input())\r\ngetlist = lambda : list(map(int, input().split()))\r\ngetstr = lambda : list(input()) # mutable string\r\n\r\ndef solve():\r\n n,m = map(int, input().split())\r\n ps = [0] + getlist()\r\n for i in range(1, len(ps)): ps[i] += ps[i-1]\r\n subs = [tuple(map(int, input().split())) for _ in range(m)]\r\n print(sum(ps[s[1]]-ps[s[0]-1] for s in subs if ps[s[1]]-ps[s[0]-1] > 0))\r\n\r\ntestcases = 1\r\n# testcases = getint()\r\nfor c in range(1, testcases+1):\r\n #write(f\"Case {c}: \")\r\n solve()", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[21]:\n\n\nn, t = map(int, input().split())\nmood = list(map(int, input().split()))\nfor m in range(1, len(mood)):\n mood[m]+=mood[m-1]\n \n\ntotalHappiness = 0\nfor i in range(t):\n l, r = map(int, input().split())\n if(l==1):\n currentSum = mood[r-1]\n else:\n currentSum = mood[r-1]-mood[l-2]\n \n #print(currentSum)\n \n if(currentSum>0):\n totalHappiness+=currentSum\n \nprint(totalHappiness)\n\n\n# In[ ]:\n\n\n\n\n", "n,m=[int(x) for x in input().split()]\r\nmood= [int(x) for x in input().split()]\r\ntotal_hp=0\r\nprsum=[None]*n\r\nprsum[0] = mood[0]\r\nfor i in range(1,n):\r\n prsum[i]=prsum[i-1]+mood[i]\r\n#print(prsum)\r\nfor i in range(m):\r\n l,r =[int(x) for x in input().split()]\r\n sum1=0\r\n if l>1:\r\n sum1 += prsum[r-1]-prsum[l-2]\r\n else:\r\n sum1 += prsum[r-1]\r\n if sum1>0:\r\n total_hp+=sum1\r\nprint(total_hp)", "a,b=map(int,input().split())\r\nz=list(map(int,input().split()))\r\ns=0\r\nfor _ in \" \"*b:\r\n x,y=map(int,input().split())\r\n s+=max(0,sum(z[x-1:y]))\r\nprint(s)", "n, m = [int(i) for i in input().split(' ')]\r\narr = [int(i) for i in input().split(' ')]\r\ninp_interval = []\r\nfor i in range(m):\r\n inp_interval.append([int(i) for i in input().split(' ')])\r\nvalue_result_arr = []\r\nfor i in inp_interval:\r\n value_result_arr.append(sum(arr[i[0]-1:i[1]]))\r\nresult = 0\r\nfor i in value_result_arr:\r\n if i > 0:\r\n result = result + i\r\nprint(result)", "\r\nn,m=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nc=0\r\nfor i in range(m):\r\n l,r=list(map(int,input().split()))\r\n s=sum(l1[l-1:r])\r\n if s>0:c+=s\r\nprint(c)", "n,comb = map(int,input().split())\n\nnums = list(map(int,input().split()))\nres = 0\n\nfor _ in range(comb):\n start,end = map(int,input().split())\n temp_sum = 0\n for i in range(start-1,end):\n temp_sum += nums[i]\n if temp_sum > 0:\n res += temp_sum\n \nprint(res)\n\t\t \t \t \t\t\t\t \t\t\t\t \t \t\t\t \t \t\t", "raw = input().split()\r\nn = int(raw[0])\r\nm = int(raw[1])\r\nraw = input().split()\r\na = []\r\na.append(0)\r\ns = 0\r\nfor i in range(n):\r\n s += int(raw[i])\r\n a.append(s)\r\nres = 0\r\nfor i in range(m):\r\n raw = input().split()\r\n l = int(raw[0])\r\n r = int(raw[1])\r\n res += max(a[r] - a[l - 1], 0)\r\nprint(res)", "n,m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nprefixSum = [0]*n\r\nprefixSum[0] = a[0]\r\nfor i in range(1,n):\r\n prefixSum[i] = prefixSum[i - 1] + a[i]\r\nsubarrSum = [0]*m\r\nfor k in range(m):\r\n i,j = [int(x) for x in input().split()]\r\n subarrSum[k] = prefixSum[j - 1] - prefixSum[i - 1] + a[i - 1]\r\nhappiness = 0\r\nfor i in range(m):\r\n if subarrSum[i] > -1:\r\n happiness += subarrSum[i] \r\nprint(happiness)", "n, m = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\n\nsums = [0]\nfor x in a:\n sums.append(sums[-1] + x)\n\nans = 0\n\nwhile m:\n l, r = [int(x) for x in input().split()]\n m -= 1\n tmp = sums[r] - sums[l-1]\n if tmp > 0:\n ans += tmp\n\nprint(ans)\n", "def main():\n\tn,m=input().split()\n\tn,m=[int(n),int(m)]\n\tL=input().split()\n\tL=[int(x) for x in L]\n\tS=[0]*n\n\tS[0]=L[0]\n\tfor i in range(1,len(L)):\tS[i]=S[i-1]+L[i]\n\tans=0\n\tfor _ in range(m):\n\t\tl,r=input().split()\n\t\tl,r=[int(l),int(r)]\n\t\tres=S[r-1]-S[l-1]+L[l-1]\n\t\tif res>0:\tans+=res\n\tprint(ans)\n\nif __name__ == '__main__':\n\tmain()", "n, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nsub = list()\r\n\r\nfor _ in range(m):\r\n sub.append(tuple(int(x) for x in input().split()))\r\n\r\nweights = list()\r\nfor i in range(m):\r\n start = sub[i][0]-1\r\n end = sub[i][1]\r\n happiness = sum(a[start:end])\r\n weights.append(happiness)\r\n\r\nselection = [x for x in weights if x > 0]\r\nprint(sum(selection))", "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\na = list(map(int, input().split()))\r\nb = [0]\r\nfor i in a:\r\n b.append(b[-1] + i)\r\nans = 0\r\nfor _ in range(m):\r\n l, r = map(int, input().split())\r\n ans += max(b[r] - b[l - 1], 0)\r\nprint(ans)", "#!/usr/bin/env python3\n# http://codeforces.com/problemset/problem/740/B\nnum_flowers, num_subarrays = map(int, input().split())\nflower_moods = list(map(int, input().split()))\nmax_happy = 0\nfor subarray_idx in range(num_subarrays):\n left, right = map(int, input().split())\n this_happy = sum(flower_moods[left - 1:right])\n if this_happy > 0:\n max_happy += this_happy\nprint(max_happy)\n", "def main():\n n, m = map(int, input().split())\n a, aa = 0, [0]\n for b in map(int, input().split()):\n a += b\n aa.append(a)\n res = 0\n for _ in range(m):\n lo, hi = map(int, input().split())\n sm = aa[hi] - aa[lo - 1]\n if sm > 0:\n res += sm\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n left, right = map(int, input().split())\r\n sm = 0\r\n for i in range(left - 1, right):\r\n sm += a[i]\r\n if (sm > 0):\r\n ans += sm\r\nprint(ans)\r\n", "data = list(map(int, input().split()))\r\nflowers_sum = [0 for i in range(data[0]+1)]\r\nrng = data[0]\r\nrequests = data[1]\r\n\r\ndata = list(map(int, input().split()))\r\n\r\nfor i in range(1, rng + 1):\r\n flowers_sum[i] = flowers_sum[i - 1] + data[i - 1]\r\n\r\nans = 0\r\nfor i in range(requests):\r\n l_r = list(map(int, input().split()))\r\n l = l_r[0]\r\n r = l_r[1]\r\n incr = flowers_sum[r] - flowers_sum[l-1]\r\n ans += (incr if incr > 0 else 0)\r\n\r\nprint(ans)\r\n", "# your code goes here\r\nimport sys\r\nN, M = map(int, sys.stdin.readline().strip().split())\r\nlista =[int(i) for i in sys.stdin.readline().strip().split()]\r\nd=0\r\nwhile (M>0):\r\n M-=1\r\n a, b = map(int, sys.stdin.readline().strip().split())\r\n c=0\r\n for x in range(a-1,b):\r\n \tc+=lista[x]\r\n \t\r\n if c>0:\r\n \td+=c\r\nprint (d)\t", "n,m=map(int,input().split())\r\nd=input().split()\r\nd=[int(x) for x in d]\r\nc=0\r\nfor i in range(m):\r\n l=input().split()\r\n l=[int(x) for x in l]\r\n k=0\r\n for j in range(l[0]-1,l[1]):\r\n k+=d[j]\r\n if k>0:\r\n c+=k\r\nprint(c)\r\n\r\n\r\n \r\n", "I=lambda:map(int,input().split())\r\nR=range\r\nans=0\r\nn,m=I()\r\na=list(I())\r\nfor _ in R(m):l,r=I();ans+=max(0,sum(a[i]for i in R(l-1,r)))\r\nprint(ans)", "n, m = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\n\nmax_sum = 0\n\nfor i in range(m):\n l, r = [int(x) for x in input().split()]\n l -= 1\n\n sucet = sum(a[l:r])\n\n if sucet > 0:\n max_sum += sucet\n\nprint(max_sum)", "n, m = map(int, input().split())\na = [int(i) for i in input().split()]\nans = 0\nfor i in range(m):\n\ts, e = map(int, input().split())\n\tt = sum(a[s-1:e])\n\tif t > 0:\n\t\tans += t\nprint(ans)\n", "I = lambda: map(int, input().split())\nn, m = I()\na = list(I())\nresult = 0\nfor _ in range(m):\n l, r = I()\n result += max(sum(a[l-1: r]), 0)\nprint(result)\n", "inp = [int(x) for x in input().split()]\r\nl = [int(x) for x in input().split()]\r\ntotal = 0\r\nans = 0\r\nfor x in range(inp[1]):\r\n val = [int(y) for y in input().split()]\r\n total = sum(l[val[0]-1:val[1]])\r\n if(total > 0):\r\n ans = ans + total\r\n \r\nprint(ans)", "n,m = [int(x) for x in input().split()]\n\na = [int(x) for x in input().split()]\n\nmood=0\nfor x in range(m):\n l,r = [int(x) for x in input().split()]\n net = 0\n for x in range(l-1,r):\n net += a[x]\n if net>0:\n mood+=net\nprint(mood)\n", "n,m = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\npre=[0]*(n+1)\r\nans=0\r\nfor i in range(n):\r\n pre[i+1]=pre[i]+lis[i]\r\nfor _ in range(m):\r\n l,r = map(int,input().split())\r\n ans+=max(0,pre[r]-pre[l-1])\r\nprint(ans)\r\n ", "n,m=[int(e) for e in input().split()]\r\na=[int(e) for e in input().split()]\r\np=[a[0]]\r\nfor i in range(1,n):\r\n p.append(p[-1]+a[i])\r\np.append(0)\r\ns=0\r\nfor i in range(m):\r\n l,r=[int(e)-1 for e in input().split()]\r\n s+=max(0,p[r]-p[l-1])\r\nprint(s)\r\n", "class MaxHappinessAdded:\r\n def __init__(self, flowerMood):\r\n self.flowerMood = flowerMood\r\n self.n = len(self.flowerMood)\r\n \r\n def findPrefixSum(self):\r\n pSum = [0]*self.n\r\n pSum[0] = self.flowerMood[0]\r\n \r\n for i in range(1, self.n):\r\n pSum[i] = pSum[i-1] + self.flowerMood[i]\r\n \r\n return pSum\r\n \r\n def maximizeHappiness(self, numSubArray, subArray):\r\n maxHappiness = 0\r\n choosenSubArray = []\r\n \r\n pSum = self.findPrefixSum()\r\n # print(pSum)\r\n \r\n for (i,j) in subArray:\r\n sm = pSum[j]-pSum[i-1] if i >= 1 else pSum[j]\r\n # print(i,',',j,'=',sm)\r\n if (sm) > 0:\r\n choosenSubArray.append((i,j))\r\n \r\n for i,v in enumerate(self.flowerMood):\r\n cnt = 0\r\n for (l,r) in choosenSubArray:\r\n if (i >= l) & (i <= r):\r\n cnt += 1\r\n maxHappiness += (v*cnt)\r\n return maxHappiness\r\n \r\n def findNumberPositiveMood(self, start, end):\r\n positiveMood = 0\r\n for i in range(start, end+1):\r\n if self.flowerMood[i] > 0:\r\n positiveMood += 1\r\n return positiveMood\r\n \r\n\r\nn,m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\n\r\nsubArray = []\r\nfor i in range(m):\r\n i, j = list(map(int, input().split()))\r\n subArray.append((i-1, j-1))\r\n\r\nobj = MaxHappinessAdded(arr)\r\nprint(obj.maximizeHappiness(m, subArray))", "n, m = input().split()\r\nn=int(n)\r\nm=int(m)\r\na=list(map(int, input().split()))\r\nb=[a[0]]\r\nfor i in range(1, n):\r\n b.append(b[i-1]+a[i])\r\nans = 0\r\nfor i in range(0, m):\r\n x, y = input().split()\r\n x=int(x)-1\r\n y=int(y)-1\r\n ans+=max(0, b[y]-b[x]+a[x])\r\nprint(ans)", "import sys\r\ninput = lambda : sys.stdin.readline()\r\n\r\ndef Main():\r\n n, m = map(int,input().split())\r\n A = list(map(int,input().split()))\r\n sm = 0\r\n ans = 0\r\n for _ in range(m):\r\n x, y = map(int,input().split())\r\n # print(A[(x - 1): y])\r\n sm = sum( A[(x-1): y ] )\r\n if sm > 0:\r\n ans += sm\r\n\r\n print(ans)\r\nif __name__ == '__main__':\r\n Main()", "a,b=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nh=0\r\nfor i in range(b):\r\n m,n=map(int,input().split())\r\n t=sum(s[k] for k in range(m-1,n))\r\n if t>0:\r\n h+=t\r\nprint(h)\r\n", "\r\nn,queries = list(map(int,input().strip().split()))\r\nlst = list(map(int,input().strip().split()))\r\nqury_list = []\r\nfor i in range(queries):\r\n tup = tuple(map(int,input().strip().split()))\r\n qury_list.append(tup)\r\n\r\nprefix_sum = [lst[0]]\r\nfor i in range(1,n):\r\n prefix_sum.append(lst[i] + prefix_sum[i-1])\r\nres = 0\r\nfor l , r in qury_list:\r\n if l-1 != 0:\r\n sum_of_range = prefix_sum[r-1] - prefix_sum[l-2]\r\n else:\r\n sum_of_range = prefix_sum[r-1]\r\n if sum_of_range>0:\r\n res += sum_of_range\r\n\r\nprint(res)", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\npref=[0]\r\nans=0\r\nfor i in a:\r\n pref.append(pref[-1]+i)\r\nfor i in range(m):\r\n k,l=[int(i) for i in input().split()]\r\n plus=pref[l]-pref[k-1]\r\n if plus>0:\r\n ans+=plus\r\nprint(ans)\r\n", "n,m=map(int,input().split(\" \"))\nl=list(map(int,input().split(\" \")))\nls=[]\nwhile m>0 :\n i,j=map(int,input().split(\" \"))\n m-=1\n ls.append(sum(l[i-1:j]))\ntot=0\nfor x in ls:\n if x>0:\n tot=tot+x\nprint(tot) \n \n", "n, m = [int(i) for i in input().split()]\nsec = [int(i) for i in input().split()]\n\nans = 0\n\nfor i in range(m):\n\ta, b = [int(i) for i in input().split()]\n\tif sum(sec[a - 1: b]) > 0:\n\t\tans += sum(sec[a - 1: b])\n\nprint(ans)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n if sum(l[a-1:b])>0:\r\n ans=ans+sum(l[a-1:b])\r\nprint(ans)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\npSums = (n + 1) * [0]\r\npSums[0] = 0\r\nfor i in range(1, n + 1):\r\n pSums[i] = pSums[i - 1] + a[i - 1]\r\n \r\nans = 0\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n curSum = pSums[r] - pSums[l - 1]\r\n if curSum > 0:\r\n ans += curSum\r\n\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n li, ri = map(int, input().split())\r\n li -= 1\r\n if sum(data[li:ri]) > 0:\r\n ans += sum(data[li:ri])\r\nprint(ans)", "n, m = map(int, input().split())\r\nz = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n p, q = map(int, input().split())\r\n ans += max(0, sum(z[p - 1 : q]))\r\nprint(ans)\r\n", "n,m = map(int,input().split()) \r\na = list(map(int,input().split())) \r\nlst=[ ] \r\nfor i in range(m):\r\n x,y = map(int,input().split()) \r\n ct = 0 \r\n for j in range(x-1,y):\r\n ct+=a[j] \r\n lst.append(ct) \r\nlst.sort(reverse=True) \r\nans = 0 \r\nct=0 \r\nfor i in range(len(lst)):\r\n ct+=lst[i] \r\n ans = max(ans,ct) \r\nprint(ans)\r\n \r\n", "def solve():\r\n n,m = map(int, input().split())\r\n l = list(map(int,input().split()))\r\n ps = [0] * len(l)\r\n ps[0] = l[0]\r\n for i in range(1, len(l)):\r\n ps[i] = l[i] + ps[i-1]\r\n ps.insert(0,0)\r\n ans = 0\r\n for i in range(m):\r\n l,r = map(int, input().split())\r\n diff = ps[r] - ps[l-1]\r\n if diff > 0:\r\n ans+=diff\r\n print(ans)\r\nsolve()", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=[0 for i in range(n) ]\r\nM=[list(map(int,input().split())) for i in range(m)]\r\nv=0\r\nfor i in range(m) :\r\n k=0\r\n for j in range(M[i][0]-1,M[i][1]) :\r\n k=k+l[j]\r\n if k>0 :\r\n v=v+k\r\nprint(v)\r\n \r\n \r\n", "n,m=map(int,input().split(\" \"))\r\nmood=list(map(int,input().split(\" \")))\r\ndescription=[]\r\nsum_1=0\r\nhappiness=0\r\nfor i in range(0,m):\r\n l,r=map(int,input().split(\" \"))\r\n description.append((l,r))\r\n\r\nprefix_sum=[0]*n\r\nprefix_sum[0]=mood[0]\r\nfor i in range(1,n):\r\n prefix_sum[i]=mood[i]+prefix_sum[i-1]\r\nfor i in range(0,m):\r\n if description[i][0]==1:\r\n sum_1=prefix_sum[description[i][1]-1]\r\n else:\r\n sum_1=prefix_sum[description[i][1]-1]-prefix_sum[description[i][0]-2]\r\n if sum_1>0:\r\n happiness+=sum_1\r\nprint(happiness)" ]

{"inputs": ["5 4\n1 -2 1 3 -4\n1 2\n4 5\n3 4\n1 4", "4 3\n1 2 3 4\n1 3\n2 4\n1 1", "2 2\n-1 -2\n1 1\n1 2", "5 6\n1 1 1 -1 0\n2 4\n1 3\n4 5\n1 5\n1 4\n4 5", "8 3\n5 -4 -2 5 3 -4 -2 6\n3 8\n4 6\n2 3", "10 10\n0 0 0 0 0 0 0 0 0 0\n5 9\n1 9\n5 7\n3 8\n1 6\n1 9\n1 6\n6 9\n1 10\n3 8", "3 6\n0 0 0\n1 1\n1 1\n1 3\n3 3\n2 3\n1 2", "3 3\n1 -1 3\n1 2\n2 3\n1 3", "6 8\n0 6 -5 8 -3 -2\n6 6\n2 3\n5 6\n4 6\n3 4\n2 5\n3 3\n5 6", "10 4\n6 5 5 -1 0 5 0 -3 5 -4\n3 6\n4 9\n1 6\n1 4", "9 1\n-1 -1 -1 -1 2 -1 2 0 0\n2 5", "3 8\n3 4 4\n1 2\n1 3\n2 3\n1 2\n2 2\n1 1\n2 3\n1 3", "3 8\n6 7 -1\n1 1\n1 3\n2 2\n1 3\n1 3\n1 1\n2 3\n2 3", "53 7\n-43 57 92 97 85 -29 28 -8 -37 -47 51 -53 -95 -50 -39 -87 43 36 60 -95 93 8 67 -22 -78 -46 99 93 27 -72 -84 77 96 -47 1 -12 21 -98 -34 -88 57 -43 5 -15 20 -66 61 -29 30 -85 52 53 82\n15 26\n34 43\n37 41\n22 34\n19 43\n2 15\n13 35", "20 42\n61 86 5 -87 -33 51 -79 17 -3 65 -42 74 -94 40 -35 22 58 81 -75 5\n3 6\n12 13\n3 16\n3 16\n5 7\n5 16\n2 15\n6 18\n4 18\n10 17\n14 16\n4 15\n4 11\n13 20\n5 6\n5 15\n16 17\n3 14\n9 10\n5 19\n5 14\n2 4\n17 20\n10 11\n5 18\n10 11\n1 14\n1 6\n1 10\n8 16\n11 14\n12 20\n11 13\n4 5\n2 13\n1 5\n11 15\n1 18\n3 8\n8 20\n1 4\n10 13", "64 19\n-47 13 19 51 -25 72 38 32 54 7 -49 -50 -59 73 45 -87 -15 -72 -32 -10 -7 47 -34 35 48 -73 79 25 -80 -34 4 77 60 30 61 -25 23 17 -73 -73 69 29 -50 -55 53 15 -33 7 -46 -5 85 -86 77 -51 87 -69 -64 -24 -64 29 -20 -58 11 -26\n6 53\n13 28\n15 47\n20 52\n12 22\n6 49\n31 54\n2 39\n32 49\n27 64\n22 63\n33 48\n49 58\n39 47\n6 29\n21 44\n24 59\n20 24\n39 54", "1 10\n-46\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1", "10 7\n44 18 9 -22 -23 7 -25 -2 15 35\n6 8\n6 7\n3 3\n2 6\n9 10\n2 2\n1 5", "4 3\n10 -2 68 35\n4 4\n1 1\n1 3", "3 6\n27 -31 -81\n2 3\n2 3\n1 1\n1 2\n1 2\n2 2", "7 3\n-24 -12 16 -43 -30 31 16\n3 6\n3 4\n1 7", "10 7\n-33 -24 -86 -20 5 -91 38 -12 -90 -67\n7 8\n7 10\n4 7\n1 3\n6 10\n6 6\n3 5", "4 4\n95 35 96 -27\n3 4\n3 3\n4 4\n3 3", "7 7\n-33 26 -25 44 -20 -50 33\n4 6\n4 4\n3 7\n5 7\n1 4\n2 5\n4 6", "5 3\n-35 -39 93 59 -4\n2 2\n2 3\n2 5", "3 7\n0 0 0\n1 2\n1 2\n2 3\n3 3\n1 3\n1 2\n2 3", "8 2\n17 32 30 -6 -39 -15 33 74\n6 6\n8 8", "8 1\n-20 -15 21 -21 1 -12 -7 9\n4 7", "7 9\n-23 -4 -44 -47 -35 47 25\n1 6\n3 5\n4 7\n6 7\n2 4\n2 3\n2 7\n1 2\n5 5", "8 8\n0 6 -25 -15 29 -24 31 23\n2 8\n5 5\n3 3\n2 8\n6 6\n3 6\n3 4\n2 4", "4 3\n-39 -63 9 -16\n1 4\n1 3\n2 4", "9 1\n-3 -13 -13 -19 -4 -11 8 -11 -3\n9 9", "9 6\n25 18 -62 0 33 62 -23 4 -15\n7 9\n2 3\n1 4\n2 6\n1 6\n2 3", "4 5\n-12 39 8 -12\n1 4\n3 4\n1 3\n1 3\n2 3", "3 9\n-9 7 3\n1 2\n1 1\n1 3\n1 2\n2 3\n1 3\n2 2\n1 2\n3 3", "10 7\n0 4 3 3 -2 -2 -4 -2 -3 -2\n5 6\n1 10\n2 10\n7 10\n1 1\n6 7\n3 4", "86 30\n16 -12 11 16 8 14 7 -29 18 30 -32 -10 20 29 -14 -21 23 -19 -15 17 -2 25 -22 2 26 15 -7 -12 -4 -28 21 -4 -2 22 28 -32 9 -20 23 38 -21 21 37 -13 -30 25 31 6 18 29 29 29 27 38 -15 -32 32 -7 -8 -33 -11 24 23 -19 -36 -36 -18 9 -1 32 -34 -26 1 -1 -16 -14 17 -17 15 -24 38 5 -27 -12 8 -38\n60 66\n29 48\n32 51\n38 77\n17 79\n23 74\n39 50\n14 29\n26 76\n9 76\n2 67\n23 48\n17 68\n33 75\n59 78\n46 78\n9 69\n16 83\n18 21\n17 34\n24 61\n15 79\n4 31\n62 63\n46 76\n79 82\n25 39\n5 81\n19 77\n26 71", "33 17\n11 6 -19 14 23 -23 21 15 29 19 13 -18 -19 20 16 -10 26 -22 3 17 13 -10 19 22 -5 21 12 6 28 -13 -27 25 6\n4 17\n12 16\n9 17\n25 30\n31 32\n4 28\n11 24\n16 19\n3 27\n7 17\n1 16\n15 28\n30 33\n9 31\n14 30\n13 23\n27 27", "16 44\n32 23 -27 -2 -10 -42 32 -14 -13 4 9 -2 19 35 16 22\n6 12\n8 11\n13 15\n12 12\n3 10\n9 13\n7 15\n2 11\n1 13\n5 6\n9 14\n3 16\n10 13\n3 15\n6 10\n14 16\n4 5\n7 10\n5 14\n1 16\n2 5\n1 6\n9 10\n4 7\n4 12\n2 5\n7 10\n7 9\n2 8\n9 10\n4 10\n7 12\n10 11\n6 6\n15 15\n8 12\n9 10\n3 3\n4 15\n10 12\n7 16\n4 14\n14 16\n5 6", "63 24\n-23 -46 0 33 24 13 39 -6 -4 49 19 -18 -11 -38 0 -3 -33 -17 -4 -44 -22 -12 -16 42 16 -10 7 37 -6 16 -41 -18 -20 51 -49 28 -14 -22 -37 -7 -50 31 -41 -47 18 -8 -39 -29 35 -32 14 -29 44 -29 -19 -25 -47 -8 16 11 20 12 38\n21 61\n35 61\n29 61\n21 34\n12 48\n32 33\n9 27\n4 42\n4 60\n37 61\n19 44\n46 60\n51 53\n31 34\n23 32\n5 29\n43 59\n7 31\n29 48\n15 50\n19 51\n7 28\n17 41\n1 62", "6 51\n45 -33 -17 -48 2 2\n2 5\n1 1\n1 3\n5 5\n4 6\n1 2\n2 3\n3 4\n1 6\n4 6\n3 5\n1 5\n2 2\n2 6\n4 6\n1 5\n1 5\n1 5\n1 6\n6 6\n3 5\n6 6\n1 6\n3 4\n3 3\n2 4\n3 3\n1 4\n2 4\n5 6\n4 5\n2 4\n1 5\n1 2\n4 5\n1 5\n5 6\n2 2\n3 4\n1 3\n1 2\n2 5\n3 6\n4 6\n3 4\n2 4\n1 4\n1 1\n4 6\n3 5\n1 4", "3 5\n2 -1 3\n2 3\n2 3\n2 3\n2 3\n1 2", "4 30\n1 1 1 1\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4\n1 4"], "outputs": ["7", "16", "0", "8", "10", "0", "0", "5", "13", "50", "0", "59", "67", "170", "1502", "804", "0", "103", "121", "27", "0", "26", "261", "81", "163", "0", "74", "0", "72", "79", "0", "0", "127", "140", "22", "6", "3076", "1366", "777", "82", "140", "9", "120"]}

UNKNOWN

PYTHON3

CODEFORCES

209

8ed90872b9454656dda60a242d493820

Ebony and Ivory

Dante is engaged in a fight with "The Savior". Before he can fight it with his sword, he needs to break its shields. He has two guns, Ebony and Ivory, each of them is able to perform any non-negative number of shots. For every bullet that hits the shield, Ebony deals *a* units of damage while Ivory deals *b* units of damage. In order to break the shield Dante has to deal exactly *c* units of damage. Find out if this is possible. The first line of the input contains three integers *a*, *b*, *c* (1<=≤<=*a*,<=*b*<=≤<=100,<=1<=≤<=*c*<=≤<=10<=000) — the number of units of damage dealt by Ebony gun and Ivory gun, and the total number of damage required to break the shield, respectively. Print "Yes" (without quotes) if Dante can deal exactly *c* damage to the shield and "No" (without quotes) otherwise. Sample Input 4 6 15 3 2 7 6 11 6 Sample Output No Yes Yes

[ "def main():\r\n a,b,c=map(int,input().split())\r\n if a==c or c%a==0:\r\n print('Yes')\r\n return\r\n if b==c or c%b==0:\r\n print('Yes')\r\n return\r\n if a>b:\r\n a,b=b,a\r\n if a>c:\r\n print('No')\r\n return\r\n for i in range(1,(c-a)//b+1):\r\n for j in range(1,(c-b)//a+1):\r\n if b*i+a*j>c:\r\n break\r\n if b*i+a*j==c:\r\n print('Yes')\r\n return\r\n print('No')\r\n return\r\n\r\nif __name__=='__main__': main()\r\n\r\n \r\n", "import os\nimport math\nimport time\n\n\n\n[a,b,c]=[int(x) for x in input().split(' ')]\ndp = [False]*10010\ndp[0]=True\nfor i in range(10010):\n if dp[i]:\n if i+a < 10010:\n dp[i+a]=True\n if i+b < 10010:\n dp[i+b]=True\n\nif dp[c]:\n print('Yes')\nelse:\n print('No')\n\n", "s = input();\r\na,b,c = s.split();\r\na=int(a);\r\nb=int(b);\r\nc=int(c);\r\n \r\ncheck=False;\r\n \r\nfor i in range(0,10003) :\r\n n = c-a*i;\r\n if n>=0 and n%b==0 :\r\n check=True;\r\n print(\"Yes\");\r\n break;\r\nif check==False :\r\n print(\"No\");", "import math\r\na, b, c = [int(i) for i in input().split()]\r\nx = 1\r\ny = 0\r\nx1 = 0\r\ny1 = 1\r\na1 = a\r\nb1 = b\r\nwhile b1:\r\n q = a1 // b1\r\n (x, x1) = (x1, x - q * x1)\r\n (y, y1) = (y1, y - q * y1)\r\n (a1, b1) = (b1, a1 - q * b1)\r\nif c % a1 != 0:\r\n print(\"No\")\r\nelse:\r\n x = (x*c)//a1\r\n y = (y*c)//a1\r\n left1 = math.ceil((-a1*x)/b)\r\n right1 = math.floor((a1*y)/a)\r\n temp = right1 - left1\r\n if temp >= 0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "str1 = input()\r\nstr = str1.split(' ')\r\nx = int(max(str[0], str[1]))\r\ny = int(min(str[0], str[1]))\r\nz = int(str[2])\r\nflag =0\r\nwhile z >= 0:\r\n if z % y == 0:\r\n flag = 1\r\n print('YES')\r\n break\r\n else:\r\n z -= x\r\n\r\nif flag ==0:\r\n print(\"NO\")\r\n", "def EvonyAndIvory(a,b,c):\r\n flat = 0\r\n for i in range(b):\r\n d = c-(a*i)\r\n if (d < 0):\r\n flat = 0\r\n break\r\n if (d%b == 0):\r\n flat = 1\r\n break\r\n if(flat == 1):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\na,b,c = [int(i) for i in input().split()]\r\nEvonyAndIvory(a,b,c)", "from sys import stdin\r\ninput = stdin.buffer.readline\r\n\r\na, b, c = map(int, input().split())\r\nfor i in range(10001):\r\n if c >= a * i and not (c - a * i) % b:\r\n exit(print('Yes'))\r\nprint('No')", "a,b,c=map(int,input().split())\r\nfor j in range(c//a+1):\r\n\tif((c-j*a)%b==0):\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"NO\")\r\n", "'''input\n6 11 6\n'''\nfrom math import gcd\na, b, c = map(int, input().split())\nfor x in range(c//a+1):\n\tif (c - x*a) % b == 0:\n\t\tprint(\"Yes\")\n\t\tbreak\nelse:\n\tprint(\"No\")", "a,b,c=map(int,input().split())\r\nc1=c\r\nif min(a,b)>c:exit(print(\"NO\"))\r\nelif c%a==0 or c%b==0:exit(print(\"YES\"))\r\nwhile c1>0 :\r\n #print(c1)\r\n if c1%a==0:exit(print(\"YES\"))\r\n c1-=b\r\nc1=c\r\nwhile c1>0:\r\n #print(c1)\r\n if c1%b==0:exit(print(\"YES\"))\r\n c1-=a\r\nprint(\"NO\")\r\n", "a, b, c=map(int, input().split())\r\nn=c//a\r\ns=\"No\"\r\nfor i in range(n+1):\r\n\tif not (c-a*i)%b:\r\n\t\ts=\"Yes\"\r\n\t\tbreak\r\nprint(s)", "# a,b,c=map(int,input().split())\r\n# x=0\r\n# while x<=c:\r\n# \tif (c-x)%b==0:\r\n# \t\tprint(\"Yes\")\r\n# \t\texit()\r\n# \tx+=a\r\n# print(\"No\")\r\n\r\nfrom math import ceil,floor\r\n\r\ndef gcd(a , b , ex = 0):\r\n\tx , y = 1 , 0\r\n\tx1 , y1 , a1 , b1 = 0 , 1 , a , b\r\n\twhile b1 :\r\n\t\tq = a1 // b1\r\n\t\tx , x1 = x1 , x - q * x1\r\n\t\ty , y1 = y1 , y - q * y1\r\n\t\ta1 , b1 = b1 , a1 - q * b1\r\n\tif ex :\r\n\t\treturn [a1 , x , y]\r\n\telse :\r\n\t\treturn a1\r\na,b,c=map(int,input().split())\r\ng,x,y=gcd(a,b,1)\r\nif c%g!=0:\r\n\tprint(\"No\")\r\nelse:\r\n\tx=x*(c//g)\r\n\ty=y*(c//g)\r\n\tk=int(ceil(-x*g/b))\r\n\tif k<=y*g//a:\r\n\t\tprint(\"Yes\")\r\n\telse:\r\n\t\tprint(\"No\")", "a,b,c=map(int,input().split())\r\ni=0\r\ncurr=a*i\r\nflag=0\r\nwhile curr<=c:\r\n mod=c-curr\r\n if mod%b==0:\r\n flag=1\r\n break\r\n i+=1\r\n curr=a*i\r\nif not flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a, b, c = list(map(int, input().split(\" \")))\n\nx = int(c/a)\nworks = False\n\nwhile x >= 0 :\n\tra = x * a\n\tif ra % c == 0 and ra != 0:\n\t\tworks = True\n\t\tbreak \n\taux = c - ra\n\tif aux >= b:\n\t\tmb = int(aux/b) * b\n\t\tr = ra + mb\n\t\tif r % c == 0:\n\t\t\tworks = True\n\t\t\tbreak\n\tx = x - 1\n\nif works:\n\tprint('Yes')\nelse:\n\tprint('No')\n \t \t \t\t \t\t \t\t \t\t\t \t \t \t", "a,b,c = map(int,input().split())\r\nbb=0\r\nwhile bb<=c:\r\n\tif (c-bb)%a == 0:\r\n\t\tprint('Yes')\r\n\t\texit()\r\n\tbb+=b\r\nprint('No')", "line = input()\r\na, b, c = map(int, line.split())\r\n\r\ni = 0\r\nwhile i <= c:\r\n if (c - i) % b == 0:\r\n print(\"Yes\")\r\n exit()\r\n i += a\r\nprint(\"No\")\r\n", "from fractions import Fraction\r\nfrom math import floor,ceil\r\na,b,c = map(int,input().split())\r\na,b = sorted([a,b], reverse = True)\r\n# print(a,b)\r\nstored = [a,b]\r\nwhile b > 0:\r\n a,b = b,a%b\r\n\r\nif c%a == 0:\r\n a,b = stored\r\n def egcd(a,b):\r\n if b == 0:\r\n return a,1,0\r\n nxt = egcd(b,a%b)\r\n return nxt[0], nxt[2], nxt[1] - a//b * nxt[2]\r\n d,x0,y0 = egcd(a,b)\r\n p = a//d\r\n q = b//d\r\n n = c//d\r\n X0 = n*x0\r\n Y0 = n*y0\r\n # print(f'{a} {b} {c} {d} {n} {x0} {y0} {X0} {Y0}')\r\n '''\r\n X0 + tq >= 0 --> t >= -X0/q\r\n Y0 - tp >= 0 --> t <= Y0/p\r\n '''\r\n t_l = Fraction(-X0, q)\r\n t_r = Fraction(Y0, p)\r\n t_lf = floor(t_l)\r\n t_rf = floor(t_r)\r\n t_lc = ceil(t_l)\r\n t_rc = ceil(t_r)\r\n # print(f'[{t_l}, {t_r}]')\r\n if t_rf - t_lf >= 1 or t_rc - t_lc >= 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\nelse:\r\n print(\"NO\")\r\n# print([\"Yes\",\"No\"][c%a!=0])\r\n", "def solve(a,b,c):\r\n for i in range(int(c/a)+1):\r\n for j in range(int(c/b) +1):\r\n if i*a + j*b == c:\r\n return True\r\n return False\r\na,b,c = map(int,input().split())\r\nif solve(a,b,c):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a,b,c=map(int,input().split())\r\ni=0\r\ns='NO'\r\nwhile i<=c:\r\n if(c-i)%b:\r\n s=s \r\n else:\r\n s='YES'\r\n i+=a\r\nprint(s)\r\n", "from math import gcd\r\n\r\n\r\na,b,c = map(int,input().split())\r\nr = gcd(a,b)\r\nif(c%r!=0):\r\n print(\"No\")\r\nelse:\r\n flag=1\r\n for i in range(c+1):\r\n if(a*i > c):\r\n break\r\n if(c - a*i)%b==0:\r\n flag=0\r\n break\r\n \r\n print([\"Yes\",\"No\"][flag])", "def main():\r\n a, b, c = map(int, input().split())\r\n for x in range(0, 10**5 + 1):\r\n if (c - x * a) < 0:\r\n break\r\n if (c - x * a) % b == 0:\r\n print(\"Yes\")\r\n return\r\n print(\"No\")\r\n\r\nmain()", "a, b, c = map(int, input().split())\nfor i in range(c // a + 2):\n for j in range(c // b + 2):\n if a * i + b * j == c:\n print(\"Yes\")\n exit(0)\nprint(\"No\")", "black, white, health = map(int, input().split())\r\ndamage = [False] * (health + 1 + max(white, black))\r\ndamage[0] = True\r\nfor i in range(health):\r\n if damage[i]:\r\n damage[i + black] = True\r\n damage[i + white] = True\r\n\r\nif damage[health]:\r\n print('Yes')\r\nelse:\r\n print('No')", "a,b,c=map(int,input().split())\r\nx=0\r\nwhile x<=c:\r\n\tif (c-x)%b==0:\r\n\t\tprint(\"Yes\")\r\n\t\texit()\r\n\tx+=a\r\nprint(\"No\")", "a,b,c=map(int,input().split());yes=0\r\nfor i in range(0,c+1,a):\r\n if (c-i)%b==0:yes=1\r\nprint(['No','Yes'][yes])", "a, b, c = map(int, input().split())\n\nyes = False\nx = 0\nwhile a * x <= c:\n c2 = c\n c2 -= a * x\n y = c2 / b\n x += 1\n if y == int(y):\n yes = True\n break\n\nprint('Yes' if yes else 'No')\n\n\t \t \t\t\t\t\t \t\t \t \t \t \t \t", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\na, b, c = IL()\r\n\r\nans = False\r\nfor i in range(0, c+1, a):\r\n if (c-i) % b == 0:\r\n ans = True\r\n\r\nprint(\"Yes\" if ans else \"No\")", "a, b, c = map(int, input().split())\r\nfor i in range(0, c + 1, a):\r\n if c - i >= 0 and (c - i) % b == 0:\r\n print('Yes')\r\n exit()\r\nprint('No')", "from math import *\r\na,b,c=map(int,input().split())\r\ng=gcd(a,b)\r\ni=0\r\nver=False\r\nfor k in range(1000000):\r\n rem=c-(a*i)\r\n i+=1\r\n if rem%b==0:\r\n if rem//b>=0:\r\n ver=True\r\n break\r\nif ver:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a,b,c = map(int,input().split())\r\ns = 'No'\r\nif c % a == 0 or c % b == 0:\r\n s = 'Yes'\r\nelse:\r\n for i in range(c//(a+b)):\r\n if (c - ((i+1) * (a + b))) % a == 0 or (c - ((i+1) * (a + b))) % b == 0:\r\n s = 'Yes'\r\n break\r\nprint(s)\r\n\r\n", "a, b, n = map(int, input().split())\r\nans = False\r\nfor i in range(n + 1):\r\n d1 = i\r\n d2 = n - i\r\n if d1 % a == 0 and d2 % b == 0:\r\n ans = True\r\nprint('Yes' if ans else 'No') \r\n", "# http://codeforces.com/problemset/problem/633/A\n\na, b, c = map(int, input().split())\ndone =False\n\n\nfor i in range(c // a + 1):\n for j in range((c - i * a) // b + 1):\n if (c - i * a - j * b) == 0:\n print(\"Yes\")\n done = True\n break\n if done:\n break\nif not done:\n print(\"No\")", "def solve(a,b,c):\r\n for i in range(101):\r\n if c-(b*i) >= 0 and (c-(b*i))%a == 0:\r\n return 'Yes'\r\n return 'No'\r\na,b,c = map(int,input().split())\r\nprint(solve(a,b,c))\r\n", "a, b, c = map(int,input().split())\r\n\r\nif c%a:\r\n while c>0 and c%b:\r\n c -= a\r\n print('Yes' if c>0 else 'No')\r\nelse:\r\n print('Yes')", "#!/usr/bin/python3.5\r\na,b,c=[int(x) for x in input().split()]\r\nd=c\r\nif a%2==0 and b%2==0 and c&1:\r\n print('No')\r\n quit()\r\n\r\nwhile True:\r\n if c<=0 and d<=0:\r\n break\r\n if c>0:\r\n if c%a==0:\r\n print('Yes')\r\n quit()\r\n else:\r\n c-=b\r\n if d>0:\r\n if d%b==0:\r\n print('Yes')\r\n quit()\r\n else:\r\n d-=a\r\nprint('No')", "import math\na,b,c = map(int,input().split())\nfor i in range(c//a+1):\n\tif (c-a*i)%b==0:\n\t\tprint (\"Yes\")\n\t\texit()\nprint (\"No\")", "a, b, c = map(int, input().split())\nf = False\nfor na in range(1 + c//a):\n if f:\n break\n for nb in range(1 + c//b):\n if a * na + b * nb == c:\n f = True\n break\nif f:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "import sys\r\na, b, c = map(int, input().split())\r\nfor i in range(0, c + 1, a):\r\n if (c - i) % b == 0:\r\n print('Yes')\r\n sys.exit()\r\nprint('No') \r\n", "a = [int(j) for j in input().split()]\r\ns = ''\r\nfor k in range(a[1]):\r\n if (a[2] - k * a[0]) % a[1] == 0 and a[2] - a[0] * k >= 0:\r\n s = 'YES'\r\n break\r\nif s == 'YES':\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b,c = map(int,input().split(' '))\r\nn = max(c//a,c//b)\r\nf = 0\r\nfor i in range(n+1):\r\n for j in range(n+1):\r\n if i*a+j*b == c:\r\n f = 1\r\n break\r\n if f==1:\r\n break\r\n\r\nif f==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "abc = list(map(int,input().split()))\r\na, b, c = abc[0], abc[1], abc[2]\r\nfor i in range(c // a + 1):\r\n if (c - i * a) % b == 0 or c - i * a == 0:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')", "line = [int(x) for x in input().strip().split(\" \")]\r\na = line[0]\r\nb = line[1]\r\nc = line[2]\r\n\r\ndef doable(a, b, c):\r\n\tfor i in range((c//a)+1):\r\n\t\tt = c-(i*a)\r\n\t\t# print(\"t: %s\" % (t))\r\n\t\tif t%b==0:\r\n\t\t\treturn True\r\n\treturn False\r\n\r\nif doable(a, b, c):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "a,b,c=map(int,input().split())\r\ny=0\r\nwhile (c-b*y)/a >=0:\r\n if (c-b*y)%a ==0:\r\n print('Yes')\r\n break\r\n y += 1\r\n\r\nelse:\r\n print('No')", "a,b,c=map(int , input().split())\r\ni=0\r\ns='No'\r\nwhile i<=c: s=s if(c-i)%b else 'YES';i+=a\r\nprint(s)\r\n ", "def gcd(a, b, x, y):\n if b == 0:\n x = 1\n y = 0\n return a, x, y\n\n d = gcd(b, a%b, x, y)\n x = d[2]\n y = d[1] - d[2]*(a//b)\n\n return d[0], x, y\n\nimport math\ndef exe(x1, y1, g,a,b, c):\n if c%g:\n print(\"NO\")\n exit()\n x1 = x1 * (c//g)\n y1 = y1 * (c//g)\n\n lr = -x1 // (b//g)\n rr = y1 // (a//g)\n\n for k in range(lr, rr+1):\n x = x1 + k * (b//g)\n y = y1 - (k * (a//g))\n if x >= 0 and y >= 0:\n print(\"YES\")\n exit()\n print(\"NO\")\n\n\n\na, b, c = [int(x) for x in input().split()]\n\n\nd = gcd(a, b, 0, 0)\n\ng = d[0]\nx = d[1]\ny = d[2]\n\n\n\n\nexe(x, y, g, a,b,c)\n\n \n\n \n", "from math import gcd\r\n\r\na, b, c = map(int, input().split())\r\n\r\n\r\nanswer = False\r\nfor i in range(0, c+1):\r\n lhs = i\r\n rhs = c - i\r\n\r\n if (lhs % a == 0 and rhs % b == 0) or (lhs % b == 0 and rhs % a == 0):\r\n answer = True\r\n\r\nif answer:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "#!/usr/bin/env python3\r\n\r\na, b, c = [int(x) for x in input().split()]\r\n\r\nfound = False\r\nfor i in range(0, c // a + 1):\r\n if (c - (a * i)) % b == 0:\r\n found = True\r\n break\r\nif found:\r\n print(\"Yes\") \r\nelse:\r\n print(\"No\") \r\n", "def solve(a,b,c):\r\n x= 0 \r\n y = 0 \r\n while(c>=a):\r\n if(c%b==0):\r\n y = c//b\r\n c = 0 \r\n else:\r\n c = c-a\r\n x = x + 1 \r\n \r\n if(c==0):\r\n return 1\r\n else:\r\n return False \r\n\r\n\r\na,b,c = map(int,input().split()) \r\n\r\nif(solve(a,b,c)==1):\r\n print(\"YES\")\r\n \r\nelif(solve(b,a,c)==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, b, c = map(int, input().split())\nok = False\nfor i in range(c//a+1):\n #print(c-a*i)\n #print((c-a*i)%b==0)\n if c-a*i >= 0 and (c-a*i)%b==0:\n ok = True\nif ok:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "A, B, C = [int(x) for x in input().split()]\n\nfor i in range(0, C + 1):\n if A * i > C:\n break\n if (C - A * i) % B == 0:\n print(\"Yes\")\n exit(0)\n\nprint(\"No\")\n", "a, b, c = map(int, input().split())\r\np = [0] * 100000\r\np[0] = 1\r\np[a] = 1\r\np[b] = 1\r\nfor i in range(c + 1):\r\n if p[i]:\r\n p[i + a] = 1\r\n p[i + b] = 1\r\nif p[c]:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "a,b,c=map(int,input().split())\r\nans=\"No\"\r\nfor i in range(c//a+1):\r\n if (c-a*i)%b==0:\r\n ans=\"Yes\"\r\n break\r\nprint(ans)\r\n", "a, b, c = input().split()\r\na, b, c = int(a), int(b), int(c)\r\n\r\nc_left = c\r\nwhile c_left >= 0:\r\n if c_left % b == 0:\r\n print(\"Yes\")\r\n break\r\n c_left -= a\r\nif c_left < 0:\r\n print(\"No\")\r\n", "a,b,c = map(int,input().split())\r\nop = False\r\nfor i in range(10**6):\r\n if (c- a*i) > 0 and (c-a*i)%b == 0 :\r\n op =True \r\n break\r\nif not op :\r\n for i in range(10**6):\r\n if (c- b*i) > 0 and (c-b*i)%a == 0 :\r\n op =True \r\n break\r\nif op :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "x, y, z = map(int, input().split())\r\nfor a in range(0, z + 1, x):\r\n for b in range(a, z + 1, y):\r\n if b == z:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")", "a, b, c = list(map(int, input().split()))\r\n\r\n\r\ndef gcd(a, b):\r\n global x\r\n global y\r\n if b == 0:\r\n x = 1\r\n y = 0\r\n\r\n return a\r\n else:\r\n\r\n d = gcd(b, a % b)\r\n # print(x, y)\r\n x, y = y, x - y * (a // b)\r\n\r\n return d\r\n\r\n\r\nx = 0\r\ny = 0\r\ng = gcd(a, b)\r\n\r\nfrom math import ceil\r\n\r\nif c % g == 0:\r\n\r\n x = x * (c // g)\r\n y = y * (c // g)\r\n\r\n if x < 0:\r\n k = (ceil(abs(x) / (b // g)))\r\n x = x + k *( b // g)\r\n y = y - k* (a // g)\r\n elif y<0:\r\n k = (ceil(abs(y) / (a // g)))\r\n x = x - k * (b // g)\r\n y = y + k * (a // g)\r\n\r\n if x < 0 or y < 0:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "buff = input().split(\" \")\r\na = int(buff[0])\r\nb = int(buff[1])\r\nc = int(buff[2])\r\nres = False\r\nwhile(c > 0):\r\n if (c % b == 0):\r\n res = True\r\n break\r\n c-=a\r\nif (res or c == 0): print(\"Yes\")\r\nelse: print(\"No\")", "#from dust i have come, dust i will be\r\n\r\na,b,c=map(int,input().split())\r\n\r\nfor i in range(0,1000):\r\n x=c-(i*a)\r\n\r\n if(x<0):\r\n break\r\n\r\n if x%b==0:\r\n print(\"YES\")\r\n exit(0)\r\n\r\nprint(\"NO\")\r\n\r\n", "from sys import stdin, stdout\r\n\r\nx, y, z = map(int, stdin.readline().split())\r\nfor _ in range(int(z//x+1)):\r\n if (z-_*x)%y==0:\r\n stdout.write('Yes\\n')\r\n exit(0)\r\nstdout.write('No\\n')\r\n", "a,b,c=input().split(' ')\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nwhile c>=0 :\r\n if c%b==0 :\r\n print('yes')\r\n break\r\n c=c-a\r\nif c<0 :\r\n print('no')", "a , b , c = map(int,input().split())\r\nfor i in range(20000):\r\n if(c-a*i)%b==0 and c-a*i>=0:\r\n print(\"Yes\")\r\n quit()\r\nprint(\"No\")\r\n \r\n", "a, b, c = list(map(int, input().split()))\r\nok = 0\r\nfor i in range(c + 1):\r\n\tval = c - a * i\r\n\tif val >= 0 and val % b == 0:\r\n\t\tok = 1\r\nret = ['No', 'Yes']\r\nprint(ret[ok])", "a,b,c=list(map(int,input().split()));\nyes=False;\nfor i in range(0,c+1,a):\n if(c-i)%b==0:\n yes=True;\n break;\nprint('Yes'if yes else 'No');\n", "def bezout(a, b):\n px, py = 1, 0\n x, y = 0, 1\n while b != 0:\n a, (q, b) = b, divmod(a, b)\n px, x = x, px - q * x\n py, y = y, py - q * y\n return a, px, py\n\na, b, c = map(int,input().split())\ng, x, y = bezout(a, b)\nx *= c // g; y *= c // g\na //= g; b //= g\nprint('No' if c % g or -(x // b) > y // a else 'Yes')\n\t\t\t \t\t \t \t \t \t \t\t \t\t\t\t\t\t", "a, b, c = map(int, input().split())\r\n\r\nfor i in range(1 + c//a):\r\n if (c - i*a) % b == 0:\r\n print('Yes')\r\n exit(0)\r\n\r\nprint('No')\r\n", "a,b,c = map(int, input().split())\nyes = 0\nfor i in range(0, c+1, a):\n\tif (c-i) % b == 0:\n\t\tyes = 1\nprint(['No','Yes'][yes])\n", "a, b, c = input().split()\na = int(a)\nb = int(b)\nc = int(c)\n\nf = 0\n\nfor i in range(10000):\n ai= a*i\n\n if ai>c:\n break\n \n remaining= c-a*i\n\n if remaining%b==0:\n print(\"YES\")\n f= 1\n break\n\nif f == 0:\n print(\"NO\")\n\n \t\t\t\t\t \t\t \t \t\t\t\t\t \t \t\t\t\t", "a, b, c = map(int, input().split())\n\nif a > b:\n a, b = b, a\n\nx = c//a\ny = 0\n\nwhile x*a+y*b != c:\n if x == 0:\n break\n\n x -= 1\n y = (c - x*a) // b\n\nif x*a+y*b == c:\n print(\"Yes\")\nelse:\n print(\"No\")", "a,b,c=map(int,input().split())\r\nfor i in range(101):\r\n d=i*a\r\n if (c-d)%b==0 and d<=c:\r\n print(\"Yes\")\r\n exit(0)\r\nprint(\"No\")\r\n", "a,b,c = map(int,input().split())\r\nd = False\r\nr = c//(min(a,b))\r\n\r\n\r\nfor i in range(r+1):\t\r\n\tfor j in range(r+1):\r\n\t\tif i*a+j*b==c:\r\n\t\t\td=True\r\n\t\t\tbreak\r\nif d:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "a,b,c = map(int,input().split())\r\nt = min(a,b)\r\n\r\nfor i in range(0,c//a+1):\r\n\ty = (c - i*a)/b\r\n\tif y == int(y):\r\n\t\tprint(\"Yes\")\r\n\t\texit()\r\nprint(\"No\")", "a, b, c = [int(x) for x in input().split()]\nfor i in range(c//a + 1):\n\tif((c - i * a) % b == 0):\n\t\tprint(\"Yes\")\n\t\texit()\nfor i in range(c//b + 1):\n\tif((c - i * b) % a == 0):\n\t\tprint(\"Yes\")\n\t\texit()\nprint(\"No\")\n", "a, b, c = map(int, input().split())\r\ntotal_a = 0\r\nwhile total_a <= c:\r\n if (c - total_a) % b == 0:\r\n print('Yes')\r\n break\r\n total_a += a\r\nelse:\r\n print('No')\r\n", "import math\r\ndef prime(n):\r\n ok= True\r\n for i in range(2, int(math.sqrt(n))):\r\n if(n%i==0):\r\n ok = False\r\n break\r\n if(ok):\r\n return True\r\n else:\r\n return False\r\ndef fact(a,b):\r\n ans = 1\r\n for i in range(a, b+1):\r\n ans*= i\r\n return str(ans)-1\r\ndef comb(n, c):\r\n return fact(n)//(fact(n-c)*c)\r\n\r\na,b,c = map(int, input().split())\r\nif(c%2==1 and (a%2!= 1 and b%2!= 1)):\r\n print('No')\r\nelse:\r\n ok= False\r\n for i in range(10001):\r\n for s in range(10001):\r\n if((a*i+b*s)==c):\r\n ok =True\r\n break\r\n if(ok):\r\n break\r\n if(ok):\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "a,b,c=list(map(int,input().split()))\r\nwhile c>=0:\r\n if c%b==0:\r\n print('Yes')\r\n break\r\n c-=a\r\nif c<0:\r\n print('No')\r\n", "a, b, c = map(int, input().split())\r\n\r\nif c % a == 0 or c % b == 0:\r\n print(\"Yes\")\r\nelse:\r\n c = c - b\r\n while c > 0:\r\n if c % a == 0:\r\n print(\"Yes\")\r\n exit()\r\n c = -1\r\n else:\r\n c = c - b\r\n print(\"No\")", "a, b, c = [int(i) for i in input().split()]\r\n\r\nfor i in range((c // a) + 1):\r\n if ((c - (i * a)) % b == 0):\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")", "a,b,c = list(map(int,input().split()))\r\nfor i in range(10004):\r\n x = a*i\r\n if c-x>=0:\r\n d = c-x\r\n if d%b==0:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r\nexit()", "a,b,c=map(int,input().split())\r\ng=c//min(a,b)+1\r\nflag=0\r\nfor i in range(g+1):\r\n\tfor j in range(g+1):\r\n\t\tif a*i+b*j==c:\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\nif flag:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\r\n", "from math import gcd\r\n\r\ndef extended_euclid(a,b,c):\r\n if b==0:\r\n return (1,0)\r\n x1,y1=extended_euclid(b,a%b,c)\r\n return ((y1, x1-(a//b)*y1))\r\n\r\ndef diophantine_using_euclid(a,b,c):\r\n g=gcd(a,b)\r\n if c%g!=0:\r\n return -1\r\n xg,yg=extended_euclid(a,b,g)\r\n \r\n return ((c//g)*xg,(c//g)*yg)\r\n\r\n# Including boundary values\r\ndef num_sol_in_range(a,b,c,xmin,ymin,xmax,ymax):\r\n g=gcd(a,b)\r\n if c%g!=0:\r\n return 0\r\n \r\n x,y=diophantine_using_euclid(a,b,c)\r\n \r\n xDelta=b//g\r\n if x<xmin:\r\n xlow=x+xDelta*((xmin-x)//xDelta)\r\n if xlow<xmin:\r\n xlow+=xDelta\r\n else:\r\n xlow=x-xDelta*((x-xmin)//xDelta)\r\n if xlow>xmax:\r\n return 0\r\n \r\n if x>xmax:\r\n xhigh=x-xDelta*((xmax-x)//xDelta)\r\n if xhigh>xmax:\r\n xhigh-=xDelta\r\n else:\r\n xhigh=x+xDelta*((xmax-x)//xDelta)\r\n \r\n \r\n yDelta=a//g\r\n if y<ymin:\r\n ylow=y+yDelta*((ymin-y)//yDelta)\r\n if ylow<ymin:\r\n ylow+=yDelta\r\n else:\r\n ylow=y-yDelta*((y-ymin)//yDelta)\r\n if ylow>ymax:\r\n return 0 \r\n \r\n if y>ymax:\r\n yhigh=y-yDelta*((y-ymax)//yDelta)\r\n if yhigh>ymax:\r\n yhigh-=yDelta\r\n else:\r\n yhigh=y+yDelta*((ymax-y)//yDelta)\r\n \r\n xlow1=(c-b*ylow)//a\r\n xhigh1=(c-b*yhigh)//a\r\n xlow1,xhigh1=(min(xlow1,xhigh1),max(xlow1,xhigh1))\r\n \r\n if xhigh<xlow1 or xhigh1<xlow:\r\n return 0\r\n else:\r\n return (min(xhigh,xhigh1)-max(xlow,xlow1)+xDelta)//xDelta\r\n\r\na,b,c=map(int,input().split())\r\nprint(\"Yes\" if num_sol_in_range(a,b,c,0,0,c//a,c//b)>0 else \"No\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c = map(int, input().split())\r\ndp = [False] * (c + 1)\r\ndp[0] = True\r\nfor i in range(a, c + 1, a):\r\n dp[i] = True\r\n\r\nfor i in range(c + 1):\r\n if dp[i]:\r\n for j in range(b, c + 1, b):\r\n if i + j <= c:\r\n dp[i + j] = True\r\n \r\nif dp[c]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a,b,c = list(map(int, input().split()))\r\nposs = \"No\"\r\nfor i in range(0, 10000):\r\n ebony = i*a\r\n ivory = c-ebony\r\n if(ivory >= 0 and ivory%b==0):\r\n poss = \"Yes\"\r\nprint(poss)", "a=input().split()\na=list(map(int,a))\nb=a[2]\nu=0\nwhile b>=0:\n if b==0:\n u+=1\n break\n if b%a[1]==0:\n u+=1\n break\n else:\n b-=a[0]\nif u==0:\n print(\"No\")\nelse:\n print(\"Yes\")\n\t\t\t\t \t \t \t \t\t\t\t\t\t \t\t\t \t \t \t\t", "a,b,c=map(int,input().split())\r\nwhile c >= 0:\r\n if c%a == 0:print ('YES');break\r\n c -= b\r\nelse:print ('NO')", "a,b,c=list(map(int,input().split()))\r\nmymin,mymax=min(a,b),max(a,b)\r\nif c%a==0 or c%b==0:\r\n print('Yes')\r\nelse:\r\n while c>=mymin:\r\n if c%mymin==0:\r\n print('Yes')\r\n break\r\n else:\r\n c-=mymax\r\n else:\r\n print('No')", "a, b, c = [int(x) for x in input().split()]\r\nf = True\r\nfor i in range(c // a + 1):\r\n for j in range((c - i) // b + 1):\r\n if i * a + j * b == c:\r\n f = False\r\n break\r\n if not f:\r\n break\r\nif not f :\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "from math import floor\r\na,b,c=map(int,input().split())\r\nx=0\r\nfor i in range(floor(c/max(a,b)),-1,-1):\r\n if((c-i*max(a,b))%min(a,b)==0):\r\n x=1\r\n break\r\nif(x):print(\"Yes\")\r\nelse:print(\"No\")", "a,b,c = map(int,input().split())\r\nnum = c // a + 1\r\ntemp = 0\r\nfor i in range(num):\r\n if (c - i*a)%b == 0:\r\n temp = 1\r\n break\r\nif temp == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "nums = list(map(int, input().split()))\ne = nums[0]\ni = nums[1]\ndmg = nums[2]\npassed = False\n\nif(dmg is e or dmg is i or dmg is 0):\n print(\"Yes\")\nelse:\n index = 0\n while(e*index < dmg and i*index < dmg):\n if((dmg-e*index)%i is 0):\n passed = True\n break\n elif((dmg-i*index)%e is 0):\n passed = True\n break\n index += 1\n if(passed):\n print(\"Yes\")\n else:\n print('No')", "a,b,c = map(int,input().split())\r\nif c%a==0 or c%b==0:\r\n\tprint('Yes')\r\n\tquit()\r\nif c<=max(a,b):\r\n\tprint('No')\r\n\tquit()\r\nc1,c2 = c,c\r\nwhile c1-a>0:\r\n\tif (c1-a)%b==0:\r\n\t\tprint('Yes')\r\n\t\tquit()\r\n\telse:\r\n\t\tc1-=a\r\n\r\nwhile c2-b>0:\r\n\tif (c2-b)%a==0:\r\n\t\tprint('Yes')\r\n\t\tquit()\r\n\telse:\r\n\t\tc2-=b\r\nprint('No')", "a,b,c = map(int, input().split(\" \"))\n\ndef a633(a,b,c):\n u = max(a,b)\n v = min(a,b)\n if u == c == 0:\n print(\"YES\")\n return\n elif u == 0 and c > 0:\n print(\"NO\")\n return\n else:\n for i in range((c//u)+1):\n if (c - i*u)%v == 0:\n print(\"YES\")\n return\n print(\"NO\")\n\na633(a,b,c)\n", "from collections import deque\na,b,c = list(map(int, input().split()))\npre = {}\nfila = deque([0])\nwhile fila:\n v = fila.popleft()\n if((v+a) not in pre and (v+a) <= c):\n fila.append(v+a)\n pre[v+a] = v\n if((v+b) not in pre and (v+b) <= c):\n fila.append((v+b))\n pre[v+b] = v\nseq = [c]\nresposta = \"\"\nif c not in pre:\n print(\"No\")\nelse:\n print(\"Yes\")\n \t\t\t \t \t\t\t\t \t\t \t \t\t \t \t\t\t \t", "n=list(map(int,input().split()))\r\nif n[2]%n[0]==0 or n[2]%n[1]==0:\r\n print(\"Yes\")\r\nelse:\r\n a=n[2]//n[0]\r\n b=n[2]//n[1]\r\n p=0\r\n if a>b:\r\n for i in range(a+1):\r\n for j in range(b,-1,-1):\r\n if i*n[0]+j*n[1]<n[2]:\r\n break\r\n elif i*n[0]+j*n[1]==n[2]:\r\n print(\"Yes\")\r\n p=1\r\n break\r\n if p==1:\r\n break\r\n else:\r\n for i in range(b+1):\r\n for j in range(a,-1,-1):\r\n if j*n[0]+i*n[1]<n[2]:\r\n break\r\n elif j*n[0]+i*n[1]==n[2]:\r\n print(\"Yes\")\r\n p=1\r\n break\r\n if p==1:\r\n break\r\n if p!=1:\r\n print(\"No\")", "from operator import itemgetter as ig\r\n'''\r\nif __name__=='__main__':\r\n n = int(input())\r\n strng = input()\r\n m = int(input())\r\n pos = {}\r\n for i in range(m):\r\n s = input()\r\n _s = s.lower()[::-1]\r\n\r\n if _s in strng:\r\n p = strng.index(_s)\r\n pos[p]=s\r\n print (pos)\r\n pos = sorted(pos.items(), key=ig(0))\r\n anss= ''\r\n for i in range(len(pos)):\r\n if i==len(pos):\r\n anss+=pos[i][1]\r\n else:\r\n anss+=pos[i][1]+' '\r\n print (anss)\r\n \r\n \r\n\r\n \r\n'''\r\nif __name__=='__main__':\r\n a,b,k= map(int,input().split(' '))\r\n x=0\r\n while x<=k//a:\r\n if (k-x*a)%b==0:\r\n print('Yes')\r\n break\r\n x+=1\r\n else:\r\n print ('No')\r\n\r\n \r\n \r\n", "a,b,c=map(int,input().split())\r\nz='No'\r\nfor x in range(c//a+1):\r\n for y in range(c//b+1):\r\n if a*x+b*y==c:\r\n z='Yes'\r\nprint(z)", "import math\r\n# import bisect\r\nimport sys\r\n# from collections import OrderedDict\r\ninput = sys.stdin.readline\r\ndef inp():\r\n\treturn(int(input()))\r\ndef inlt():\r\n\treturn(list(map(int,input().split())))\r\ndef insr():\r\n\ts = input()\r\n\treturn(s[:len(s)-1])\r\ndef invr():\r\n\treturn(map(int,input().split()))\r\n# T = inp()\r\n# MOD = 1000000007\r\n# print(MOD)\r\n# for t in range(T):\r\na, b, c = invr()\r\nif c%a == 0:\r\n\tprint(\"Yes\")\r\nelif c%b == 0:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tdiv = c//a\r\n\tcurr = a\r\n\tfl = True\r\n\tfor i in range(div):\r\n\t\tif (c-curr)%b == 0:\r\n\t\t\tprint(\"Yes\")\r\n\t\t\tfl = False\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tcurr += a\r\n\tif fl:\r\n\t\tprint(\"No\")\r\n \r\n ", "a,b,c=map(int,input().split())\r\nx=False\r\nwhile c>0 and not x:\r\n if c%b==0:\r\n x=True\r\n c-=a\r\nif c==0 or x:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c = map(int, input().split())\r\na, b = sorted([a,b])\r\nans = 'No'\r\nwhile c >= 0:\r\n if c%a != 0:\r\n c -= b\r\n else:\r\n ans = 'Yes'\r\n break\r\nprint(ans)", "def solve(a,b,c):\r\n i=0\r\n while i*a<=c:\r\n if (c-(a*i))%b==0:\r\n print(\"Yes\")\r\n return\r\n i+=1\r\n print(\"No\")\r\n\r\na,b,c = map(int,input().split())\r\nsolve(a,b,c)\r\n", "def main():\n a, b, c = map(int, input().split())\n for rest in range(c, -1, -a):\n if not rest % b:\n print(\"Yes\")\n return\n print(\"No\")\n\n\nif __name__ == '__main__':\n main()\n", "a,b,c = list(map(int , input().split()))\r\nfor i in range(c//a+1):\r\n if((c-a*i) % b == 0):\r\n print('Yes')\r\n break \r\nelse:\r\n print('No') ", "a,b,c = map(int, input().split())\r\nx = 0\r\nwhile a * x <= c:\r\n if (c - a * x) % b == 0: \r\n print('Yes')\r\n exit(0)\r\n x+=1\r\nprint('No')", "data = 10001 * [0]\na, b, c = map(int, input().split())\nfor i in range(len(data)):\n if i == a or i == b or i - a >= 0 and data[i - a] == 1 or i - b >= 0 and data[i - b]:\n data[i] = 1\nprint('Yes') if data[c] == 1 else print('No')\n", "a, b, c = map(int, input().split())\n\nfor i in range(101):\n\tt = (c - a * i) / b\n\tif t >= 0 and int(t) == t:\n\t\tprint('Yes')\n\t\texit()\n\nprint('No')", "a, b, c = list(map(int, input().split()))\r\nanswer = False\r\nfor y in range(c//b + 1):\r\n x = (c - b*y) / a\r\n if x == int(x):\r\n answer = True\r\n break\r\nif answer:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\ndef gcd(xx,yy):\r\n x, y = sorted([xx,yy])\r\n while y != 0:\r\n r = x%y\r\n x = y \r\n y = r\r\n return x\r\n\r\ndef xgcd(aa, bb):\r\n \"\"\"return (g, x, y) such that a*x + b*y = g = gcd(a, b)\"\"\"\r\n x0, x1, y0, y1 = 0, 1, 1, 0\r\n while aa != 0:\r\n q, bb, aa = bb // aa, aa, bb % aa\r\n y0, y1 = y1, y0 - q * y1\r\n x0, x1 = x1, x0 - q * x1\r\n return bb, x0, y0\r\n\r\n#a, b, c = [14, 19, 143]\r\na, b, c = [int(x) for x in input().split()]\r\nd,s,t = xgcd(a,b)\r\n\r\n#d = s*a + t*b\r\n#\r\n\r\n#print (d,s,t)\r\n\r\nif c%d == 0:\r\n if s >=0 and t >= 0:\r\n print(\"Yes\")\r\n else:\r\n q = c/d\r\n #c = csa/d + ctb/d\r\n #solucao particular de ax + by = c\r\n x0 = int(c*s/d) \r\n y0 = int(c*t/d)\r\n #print(x0,y0,a*x0+b*y0 == c)\r\n #todas as solucoes sao da forma\r\n # x + (b/d)*k. y-(a/d)*k\r\n #print(y0*d/a,-x0*d/b)\r\n if math.floor(y0*d/a) >= math.ceil(-x0*d/b):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelse:\r\n print(\"No\")", "def gcd_hell():\n print(\"hello\")\n\ndef gcd(a,b):\n if(b==0):\n return a\n a%=b\n return gcd(b,a)\n \n\n\na,b,c=map(int,input().split())\ny=0\n\nres = gcd(a,b)\n\nif(c>res): res = c%res + res\n\nwhile (c-b*y)/a >=0:\n if (c-b*y)%a ==0:\n print('Yes')\n break\n y += 1\nelse:\n print('No')\n", "def main():\n\ta, b, c = map(int, input().split())\n\tmin_a = min(a , b)\n\tmax_a = max(a, b)\n\tfor i in range(c // min_a + 1):\n\t\tif (c - min_a * i) % max_a == 0:\n\t\t\treturn \"Yes\"\n\treturn \"No\"\n\nprint(main())\n \t\t\t \t\t \t \t \t\t\t\t\t \t \t\t", "m=list(map(int,input().split()))[:3]\r\nwhile(m[2]>=0):\r\n if(m[2]%m[0]==0):\r\n print(\"Yes\")\r\n break\r\n m[2]=m[2]-m[1]\r\nif(m[2]<0):\r\n print(\"No\")\r\n", "a,b,c = map(int,input().split())\r\nfor i in range(c//a+1):\r\n if (c-a*i)%b==0:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")", "a,b,c=map(int,input().split())\r\ns,s1=[],[]\r\ncn,i,j=0,0,0\r\nwhile True:\r\n k=a*i;s.append(k)\r\n i+=1\r\n if k>c:break\r\nwhile True:\r\n m=b*j;s1.append(m)\r\n j+=1\r\n if m>c:break\r\nif (c in s) or (c in s1):print('YES');exit()\r\nfor i in range(len(s)):\r\n for j in range(len(s1)):\r\n if s[i]+s1[j]==c:print('YES');exit()\r\nprint('NO')\r\n", "#! /usr/bin/env python3\n\ndef main():\n a, b, c = map(int, input().split())\n\n for i in range(0, c + 1, a):\n rem = c - i\n if rem // b * b == rem:\n print('Yes')\n return\n print('No')\n\n\n\nmain()", "def func():\n [a, b, c] = [int(el) for el in input().split()]\n if b > a:\n a, b = b, a\n while True:\n if c < a and c < b: return 'NO'\n if c%a == 0: return 'YES'\n if c%b == 0: return 'YES'\n c = c-b\n print('-')\n\nprint(func())\n\t \t \t\t\t\t \t\t \t\t\t\t\t \t \t\t\t\t\t\t\t \t", "a, b, c = list(map(int, input().split()))\nx1 = c // a + 1\nf = False\nfor i in range(x1):\n j = (c - a*i) // b\n #print(i, i*a, j, b * j, c - a*i)\n if a * i + b * j == c:\n f = True\nif f:\n print(\"Yes\")\nelse:\n print(\"No\")", "a,b,c=map(int,input().split());p=0\r\nwhile 1:\r\n k=c-(p*a)\r\n if k>0 and (k%a==0 or k%b==0): print(\"Yes\");break\r\n elif k<0: print(\"No\");break\r\n p+=1", "\n\n\"\"\"a,b,c= map(int,input().split())\n\ndef gcd(a, b):\n \n # Everything divides 0\n if (a == 0):\n return b\n if (b == 0):\n return a\n \n # Base case\n if (a == b):\n return a\n \n # a is greater\n if (a > b):\n return gcd(a-b, b)\n return gcd(a, b-a)\n\nres= gcd(a,b)\nif c%res==0:\n print(\"Yes\")\nelse:\n print(\"No\")\n\"\"\"\na,b,c= map(int,input().split())\n\ndef solution (a, b, n):\n i = 0\n while i * a <= n:\n if (n - (i * a)) % b == 0:\n x=i\n y=int((n - (i * a)) / b)\n if(x>=0 and y>=0):\n return True\n return False\n i = i + 1\n \n return False\n \n\nres=solution(a,b,c)\nif (res):\n print(\"Yes\")\nelse:\n print(\"No\")\n\n", "a, b, c = map(int, input().split())\r\nh = 0\r\nif c % a == 0:\r\n k = c // a\r\nelse:\r\n k = c // a + 1\r\nif c % b == 0:\r\n m = c // b\r\nelse:\r\n m = c // b + 1\r\nif c - a*k < 0 and c - b*m < 0 and ((c < 2 * a) and c < 2*b):\r\n print('No')\r\nelse:\r\n for i in range(k+1):\r\n if (c - a*i) % b == 0 and (h == 0):\r\n print('Yes')\r\n h = 1\r\n if h == 0:\r\n print('No')\r\n", "n,m,o=map(int,input().split())\nfor i in range(o//n+1):\n\tif (o - i*n) % m == 0:\n\t\tprint(\"Yes\")\n\t\tbreak\nelse:\n\tprint(\"No\")\n \t\t \t\t \t\t\t\t \t\t\t \t\t \t \t", "import math\r\n\r\n\r\ndef main_function():\r\n a, b, c = [int(i) for i in input().split(\" \")]\r\n is_divisible = False\r\n for i in range(c + 1):\r\n if (i % a == 0 and (c - i) % b == 0) or ((c - i) % a == 0 and c % b == 0):\r\n is_divisible = True\r\n break\r\n if is_divisible:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "import sys\nLI=lambda:list(map(int, sys.stdin.readline().split()))\nMI=lambda:map(int, sys.stdin.readline().split())\nSI=lambda:sys.stdin.readline().strip('\\n')\nII=lambda:int(sys.stdin.readline())\n\na, b, c=MI()\nok=False\nfor i in range(0, c, a):\n if (c-i)%b==0:\n ok=True\nfor i in range(0, c, b):\n if (c-i)%a==0:\n ok=True\nprint(['NO', 'YES'][ok])\n", "a,b,c = tuple(map(int,input().split(\" \")))\r\nfor i in range(c//a+1):\r\n if (c-i*a)%b==0:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "A=[0]*(100010)\r\na,b,c=[int(x) for x in input().split()]\r\nA[a]=A[b]=1\r\nfor i in range(100000):\r\n if A[i]!=0:\r\n if i+a<=100000: A[i+a]=1\r\n if i+b<=100000: A[i+b]=1\r\nif A[c]==1:\r\n print('Yes')\r\nelse:\r\n print('No')", "#import math\r\nfrom sys import stdin,stdout\r\n#from heapq import heappop,heappush\r\n#input,print = stdin.readline,stdout.write\r\n\r\ndef gcd(a,b):\r\n if not b:\r\n return a\r\n if a&1:\r\n while not b&1:\r\n b>>=1\r\n if b%1:\r\n while not a&1:\r\n a>>=1\r\n x=1\r\n while (not b&1) and (not a&1):\r\n x<<=1\r\n a>>=1\r\n b>>=1\r\n return x*gcd(b,a%b)\r\n\r\n\r\ndef gcdExtended(a, b):\r\n if a == 0 :\r\n return b,0,1\r\n gcd,x1,y1 = gcdExtended(b%a, a)\r\n x = y1 - (b//a) * x1\r\n y = x1\r\n return gcd,x,y\r\n\r\n\r\n\r\n#--------------Input--------------#\r\nfor _ in range(1):\r\n#for _ in range(int(input())):\r\n #n=int(input())\r\n #s=input()\r\n a,b,c=map(int,input().split())\r\n #arr=list(map(int,input().split()))\r\n\r\n#--------------Main--------------#\r\n gcd=gcd(a,b)\r\n if c%gcd!=0:\r\n print('No')\r\n continue\r\n a//=gcd\r\n b//=gcd\r\n c//=gcd\r\n gcd,x,y=gcdExtended(a,b)\r\n x*=c\r\n y*=c\r\n if x>=0 and y>=0:\r\n print('Yes')\r\n continue\r\n if x<0:\r\n up=(-x)//b\r\n if (-x)%b!=0:\r\n up+=1\r\n if y-up*a>=0:\r\n print('Yes')\r\n continue\r\n else:\r\n print('No')\r\n continue\r\n if y<0:\r\n up=(-y)//a\r\n if (-y)%a!=0:\r\n up+=1\r\n if x-up*b>=0:\r\n print('Yes')\r\n continue\r\n else:\r\n print('No')\r\n continue", "#Entrada en s\r\ns = input();\r\n#Entrada a,b,c separadas\r\na,b,c = s.split();\r\n#Evony\r\na=int(a);\r\n#Ivory\r\nb=int(b);\r\n#Escudo\r\nc=int(c);\r\n#Inicializar check\r\ncheck=False;\r\n#Desde 0 hasta 10003\r\nfor i in range(0,10003) :\r\n #N para calcular las posibilidades de Evony\r\n n = c-a*i;\r\n #Si se paso el escudo retornar verdadero y romper\r\n if n>=0 and n%b==0 :\r\n check=True;\r\n print(\"Yes\");\r\n break;\r\n#Si no se hizo el daño exacto al del escudo retornar falso \r\nif check==False :\r\n print(\"No\");", "a,b,c=map(int,input().split(' '))\r\ni=0\r\nr=0\r\nwhile(i<=c/a):\r\n k=c-i*a\r\n if(k%b==0):\r\n r=1\r\n break;\r\n i=i+1\r\nif r==1:\r\n print(\"Yes\")\r\nelse: \r\n print(\"No\")\r\n", "a,b,c=map(int,input().split())\nd=0\ndef ans(a,b,c,d):\n if c%a==0 or c%b==0:\n print('Yes')\n return\n else:\n a,b=min(a,b),max(a,b)\n ##print(a,b)\n while d<c:\n d+=a\n if (c-d)%b==0:\n print('Yes')\n return\n else:\n continue\n print(\"No\")\n return\nans(a,b,c,d)\n", "a,b,c=map(int,input().split())\nyes=0\nfor i in range(0,c+1,a):\n if (c-i)%b==0:yes=1\nprint(['No','Yes'][yes])\n \t\t \t\t\t \t \t\t\t\t \t \t \t\t \t\t", "__author__ = 'Utena'\r\na,b,c=map(int,map(int,input().split()))\r\nwhile True:\r\n if c<0:\r\n print('No')\r\n break\r\n elif c%a==0 or c%b==0:\r\n print('Yes')\r\n break\r\n c-=a", "a, b, c = map(int, input().split())\n\nb, a = sorted([a, b])\n\nans = False\nif c % 2 == 1 and a % 2 == 0 and b % 2 == 0:\n pass\nelif c == 0:\n ans = True\nelif a == 0:\n pass\nelif b == 0:\n if c % a == 0:\n ans = True\nelse:\n k = c // a\n for i in range(k, -1, -1):\n m = (c - i * a) % b\n if m == 0:\n ans = True\n break\n\nif ans:\n print('Yes')\nelse:\n print('No')\n", "import math\r\ndef extendedeuclid(A,B):\r\n global x,y,d\r\n if B == 0:\r\n d = A\r\n x = 1\r\n y = 0\r\n else:\r\n extendedeuclid(B,A%B)\r\n temp = x\r\n x = y\r\n y = temp - (A//B)*y\r\nif __name__ =='__main__':\r\n x = 0\r\n y = 0\r\n d = 0\r\n a,b,c = [int(x) for x in input().split()]\r\n extendedeuclid(a,b)\r\n # print(d,x,y)\r\n if c%d:\r\n print(\"NO\")\r\n else:\r\n k = math.ceil(-(x*c//d)/(b/d))\r\n if y*(c//d) - k*(a/d) >= 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def f(l):\r\n a,b,c = l #100,100,1e4\r\n if a<b:\r\n a,b=b,a #let a = bigger\r\n aa = 0\r\n while aa<=c:\r\n if (c-aa)%b==0:\r\n return True\r\n aa += a\r\n return False\r\n\r\nl = list(map(int,input().split()))\r\nprint('Yes' if f(l) else 'No')\r\n", "__author__ = 'aste'\r\n\r\n\r\ndef main():\r\n a, b, c = [int(x) for x in input().split()]\r\n\r\n res = False\r\n for i in range(0, c + 1):\r\n r = c - a*i\r\n if r >= 0 and r % b == 0:\r\n res = True\r\n break\r\n\r\n print(res and \"Yes\" or \"No\")\r\n\r\nmain()\r\n", "import math\r\n\r\na,b,c=map(int,input().split())\r\nfor i in range(0,c//a+1):\r\n if (c-i*a)%b==0:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")", "a, b, c = map(int, input().split())\r\nf = True\r\nfor i in range(c // a + 1):\r\n for j in range(c // b + 1):\r\n if a * i + b * j == c:\r\n print(\"Yes\")\r\n f = False\r\n break\r\n if not f:\r\n break\r\nif f:\r\n print(\"No\")", "a,b,c = map(int,input().split())\r\nx = [0]*10010\r\nfor i in range(a,len(x),a): x[i]=1\r\nfor j in range(1,10001):\r\n\tif j%b==0: x[j]=1\r\n\tif x[j] and j+b <= 10005: x[j+b]=1\r\n\r\nif x[c]:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "a, b, c = map(int, input().split())\npossible = False\nfor i in range(c//a + 1):\n if (c - a*i) % b == 0:\n possible = True\nif possible:\n print('Yes')\nelse:\n print('No')", "a, b, c = map(int, input().split())\r\nla = []\r\nlb = []\r\n\r\ni = 0\r\nwhile i <= c:\r\n la.append(i)\r\n i += a\r\n# print(la)\r\ni = 0\r\nwhile i <= c:\r\n lb.append(i)\r\n i += b\r\n# print(lb)\r\nz = []\r\nif c in la or c in lb:\r\n print(\"Yes\")\r\nelse:\r\n z = []\r\n for i in la:\r\n for j in lb:\r\n z.append(i+j)\r\n if c in z:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n # print(z)\r\n", "a,b,c= list(map(int, input().split()))\r\nx= int(c/(a+b))\r\nfor i in range(x+1):\r\n st= c- (a+b)*i\r\n if st%a==0 or st%b==0:\r\n print('Yes'); exit(0)\r\n \r\nprint('No')", "a,b,c=map(int,(input().split()))\r\nif c%a==0 or c%b==0:\r\n print(\"Yes\")\r\nelse:\r\n while (c>0):\r\n c = c - a\r\n if c%b==0 and c>0:\r\n print(\"Yes\")\r\n break\r\n elif c < 0:\r\n print(\"No\")\r\n break", "a, b, c = map(int, input().split())\r\nkey = 0\r\ni = 0\r\nwhile (i * b <= c):\r\n if (c - i * b) % a == 0:\r\n key = 1\r\n break\r\n i += 1\r\nif key == 0:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "from math import gcd\n\na, b, c = map(int,input().split())\na, b = min(a, b), max(a, b)\ng = gcd(a, b)\nans = c % g == 0\nif ans:\n ans = False\n for i in range(0, c + 1, a):\n if (c - i) % b == 0:\n ans = True\n break\nprint('Yes' if ans else 'No')\n \t \t \t \t \t \t \t\t \t\t\t \t\t \t", "a, b, z = [int(x) for x in input().split()]\r\nT=a+b\r\na = a if a>b else b\r\nb=T-a\r\nVal= False\r\nfor k in range(z//a+1):\r\n T=z-k*a\r\n if(T%b == 0):\r\n Val = True\r\n break\r\nif(Val):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a,b,c = map(int,input().split(' '))\r\nif c%a==0 or c%b==0:\r\n print(\"YES\")\r\nelif a==b:\r\n if c%a!=0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n\r\n if b>a:\r\n start = a\r\n end = b\r\n else:\r\n start = b\r\n end = a\r\n i = int(c/end)\r\n if (c-i*end)%start==0:\r\n print('YES')\r\n # j = int(c/b)\r\n else:\r\n flag=0\r\n for j in range(i):\r\n if (c-j*end)%start==0:\r\n flag=1\r\n print(\"YES\")\r\n break\r\n if flag==0:\r\n print(\"NO\")", "a,b,c=map(int,input().split())\r\nt=0\r\nwhile a*t<=c:\r\n if (c-a*t)%b==0:\r\n print('Yes')\r\n exit()\r\n t+=1\r\nprint('No')\r\n", "def solve(a,b,c):\n x, y = c//a, c//b\n for i in range(x + 1):\n for j in range(y + 1):\n if a * i + b * j == c:\n return True\n return False\n\na,b,c = map(int,input().split())\n\nif solve(a,b,c):\n print('Yes')\nelse:\n print('No')\n", "a,b,c=map(int,input().split())\r\nif min(a,b)>c:exit(print(\"NO\"))\r\nfor i in range(0,10**5+1):\r\n if c-(i*a)<0:exit(print(\"NO\"))\r\n if (c-(i*a))%b==0:exit(print(\"YES\"))\r\n", "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 fractions import gcd\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (\r\n acos, asin, atan, ceil, cos, degrees, factorial, hypot, log2, pi, radians,\r\n 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\na, b, c = invr()\r\n\r\nres = \"No\"\r\nfor i in range(c+1):\r\n for j in range(c + 1):\r\n if a*i + b*j == c:\r\n res = \"Yes\"\r\n break\r\nprint(res)\r\n", "x = input().split()\na = int(x[0])\nb = int(x[1])\nc = int(x[2])\n\nd = c // a + a\ne = c // b + b\n\nfor ax in range(0, d):\n for bx in range(0, e):\n if a*ax + b*bx == c:\n print(\"Yes\")\n quit()\nprint(\"No\")\n\n \t \t\t \t\t \t\t \t \t \t \t\t \t", "a,b,c = map(int,input().split())\r\nif c%a==0 or c%b==0 or c%(a+b)==0: print(\"YES\")\r\nelse:\r\n\twhile c>=0:\r\n\t\tif c%a==0: print(\"YES\");break\r\n\t\tc -= b\r\n\telse: print(\"NO\")", "from math import gcd\r\na,b,c=list(map(int,input().split()))\r\nflag=0\r\nfor i in range(0,c+1,a):\r\n if((c-i)%b==0):\r\n print('YES')\r\n flag=1\r\n break\r\nif(flag==0):\r\n print('NO')", "from math import ceil\r\ndef gcdEx(a,b,x,y):\r\n if not a:\r\n return 0,1,b\r\n x1,y1,g=gcdEx(b%a,a,0,0)\r\n x=y1-(b//a)*x1\r\n y=x1\r\n return x,y,g\r\na,b,c=map(int, input().split())\r\nx,y,g=gcdEx(a,b,0,0)\r\nif c%g:\r\n print(\"No\")\r\nelse: \r\n x,y=x*c//g,y*c//g\r\n k1=ceil(-x*g/b)\r\n k2=(y*g)//a\r\n c=abs(k2-k1+1)\r\n print(\"Yes\" if c>0 else \"No\")", "# print(\"Input a, b, and c\")\na,b,c = [int(x) for x in input().split()]\n\nif c < a and c < b:\n print(\"No\")\nelif c % a == 0:\n print(\"Yes\")\nelif c % b == 0:\n print(\"Yes\")\nelse:\n # Brute force all possibilities\n found = False\n avalue = a\n while avalue < c and found == False:\n leftover = c - avalue\n if leftover % b == 0:\n found = True\n break\n else:\n avalue += a\n if found:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "def count_solutions(a, b, c):\r\n # Array to store the number of solutions for all values up to c.\r\n # Initialize all values as 0.\r\n dp = [0]*(c+1)\r\n # There is always one solution for 0 (x=y=0).\r\n dp[0] = 1\r\n\r\n # Count of solutions using a.\r\n for i in range(a, c+1):\r\n dp[i] += dp[i-a]\r\n \r\n # Count of solutions using b.\r\n for i in range(b, c+1):\r\n dp[i] += dp[i-b]\r\n\r\n return dp[c]\r\na,b,c=map(int,input().split())\r\nif count_solutions(a, b, c)>0:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "a,b,c = map(int,input().split())\n\nans = False\ni = int(c/a)\nwhile i >= 0:\n\tif (c - (i * a)) % b == 0:\n\t\tans = True\n\t\tbreak\n\ti -= 1\n\nif ans:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n\t\t \t\t \t\t \t\t\t\t\t\t\t \t\t", "a, b, c = map(int, input().split())\r\nhelp = False\r\nfor i in range(c + 1):\r\n if a * i > c:\r\n break\r\n if (c - a * i) % b == 0:\r\n print('Yes')\r\n help = True\r\n break\r\nif not help:\r\n print('No')", "a,b,c=map(int,input().split())\r\n\r\na,b=min(a,b),max(a,b)\r\n\r\n\r\ni=0\r\nflag=1\r\nwhile i*a<=c:\r\n\r\n\tif (c-(i*a))%b==0:\r\n\t\tprint(\"Yes\")\r\n\t\tflag=0\r\n\t\tbreak\r\n\r\n\ti+=1\r\n\r\nif flag:\r\n\tprint(\"No\")\r\n", "from collections import defaultdict, Counter\r\nfrom queue import PriorityQueue, Queue\r\nimport math\r\n\r\na, b, c = map(int, input().split())\r\nfor i in range(c // a + 1) :\r\n if (c - a * i) % b == 0 :\r\n print(\"Yes\")\r\n break\r\nelse :\r\n print(\"No\")\r\n\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/633/A\r\n\r\na, b, c = map(int, input().split())\r\n\r\nfor i in range(c // a + (2 if c % a == 0 else 1)):\r\n for j in range((c - i * a) // b + (2 if (c - i * a) % b == 0 else 1)):\r\n if (c - i * a - j * b) == 0:\r\n print(\"Yes\")\r\n quit()\r\n\r\nprint(\"No\")", "a,b,c=map(int,input().split())\r\ni=0\r\ns='NO'\r\nwhile i<=c:s=s if(c-i)%b else 'YES';i+=a\r\nprint(s)", "a, b, c = map(int,input().split())\r\nx = False\r\nwhile c > 0 and not x:\r\n if (c % b == 0):\r\n x = True\r\n c -= a\r\nif x or c == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c = map(int,input().split())\r\nif c % a == 0 or c % b == 0: print(\"Yes\"); exit()\r\nelse:\r\n for i in range(a,c,a):\r\n if (c-i)%b == 0: print(\"Yes\"); exit()\r\n for i in range(b,c,b):\r\n if (c-i)%a == 0: print(\"Yes\"); exit()\r\nprint(\"No\")", "def romperEscudo1(a,b,c):\r\n encontro = False\r\n for i in range (c//a+1):\r\n k=c-i*a\r\n if(k%b==0):\r\n encontro = True\r\n break\r\n if(encontro):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\nnums = list(map(int, input().split(' ')))\r\nromperEscudo1(nums[0],nums[1],nums[2])\r\n", "\r\na, b, c = map(int, input().split())\r\n\r\nfor x in range(0, c // a + 1):\r\n if (c - a * x) % b == 0:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")", "a,b,c=map(int,input().split())\r\ni=0\r\nk=c\r\nwhile (c - b*i)>=0:\r\n k=c-b*i\r\n if k%a==0:\r\n print('Yes')\r\n exit()\r\n i+=1\r\nprint('No') ", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-06 23:08:27\nLastEditTime: 2021-11-06 23:27:23\nDescription: Ebony and Ivory\nFilePath: CF633A.py\n'''\n\ndef func():\n a, b, c = map(int, input().strip().split())\n for x in range(0, c + 1):\n y = c - a * x\n if y >= 0 and y % b == 0:\n print(\"YES\")\n break\n else:\n print(\"NO\")\n\n\nif __name__ == '__main__':\n func()\n ", "string = input()\r\na, b, n = map(int, string.split())\r\nfor x in range(n // a + 1):\r\n if (n - a * x) % b == 0:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")", "a,b,c=[int(e) for e in input().split()]\r\nprint(\"YES\" if 1 in ((c-i*a)%b==0 for i in range(c//a+1)) else \"NO\")", "a,b,c = map(int, input().split())\r\ny = 0\r\nwhile b*y <= c:\r\n if (c-b*y) % a == 0:\r\n print('Yes')\r\n exit(0)\r\n y += 1\r\nprint('No')\r\n", "a,b,c=map(int,input().split())\r\nr=0\r\nfor i in range(100):\r\n if i*a>c:break\r\n if (c-(a*i))%b<1:r=1\r\nprint('YNeos'[1-r::2])", "a, b, c = map(int, input().split())\r\n\r\nans = \"NO\"\r\n\r\nfor i in range(c+1):\r\n tmp = c - a*i\r\n if tmp >= 0 and tmp%b == 0:\r\n #print(i, (c-a*i)//b)\r\n ans = \"YES\"\r\n break\r\n\r\nprint(ans)", "a,b,c = map(int,input().split())\r\nq = 1\r\nfor i in range(c + 1):\r\n y = (c - a * i)// b\r\n if a * i + b * y == c and y >= 0:\r\n q = 0\r\nprint('NO'if q else 'YES')", "abc=input().split()\r\na=int(abc[0])\r\nb=int(abc[1])\r\nc=int(abc[2])\r\ncount=0\r\nif c%a==0 or c%b==0:\r\n print('Yes')\r\nelse:\r\n for i in range(c):\r\n if i*a>c:\r\n break\r\n if (c-i*a)%b==0:\r\n count+=1\r\n if count>0:\r\n print('Yes')\r\n else:\r\n print('No')", "a,b,n=map(int,input().split())\r\nf=int(n/a)\r\nl=0\r\nfor i in range(f+1):\r\n if((n-a*i)%b==0):\r\n l=1\r\n break\r\nif(l==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a,b,c = map(int,input().split())\r\nfor i in range(c//a+1):\r\n\tif((c-a*i)%b==0):print(\"Yes\");break\r\nelse:print(\"No\")", "#Anuneet Anand\r\n\r\nfrom math import gcd\r\n\r\na,b,c = map(int,input().split())\r\n\r\nF = False\r\n\r\nfor i in range(10000+1):\r\n\td = c-a*i\r\n\tif d>=0 and d%b==0:\r\n\t\tF = True\r\n\r\nif F:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "a, b, c = [int(j) for j in input().split()]\r\nf = int(c / a)\r\noutput = \"NO\"\r\nfor x in range(f + 1):\r\n val = c - x * a\r\n if val % b == 0:\r\n output = \"YES\"\r\n break\r\nprint(output)\r\n", "a, b, c = [int(x) for x in input().split(' ')]\r\nx = c//b\r\npossible = False\r\nfor i in range(0, x+1):\r\n if (c-i*b)%a == 0:\r\n possible = True\r\n break\r\nprint(\"Yes\" if possible else \"No\")\r\n", "import fractions\r\na, b, c = [int(x) for x in input().split()]\r\n\r\ndef solve(a, b, c):\r\n if c % fractions.gcd(a, b) != 0: return False\r\n if c >= a*b: return True\r\n for i in range(b):\r\n for j in range(a):\r\n if a*i + b*j == c:\r\n return True\r\n return False\r\n\r\nprint('Yes' if solve(a,b,c) else 'No')", "from math 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\nn,m,k=M()\r\nflag=1\r\nwhile k>=0:\r\n if k%m==0:\r\n print(\"YES\");flag=0;break\r\n k-=n\r\nif flag: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", "a,b,c = map(int, input().split())\r\n\r\nans = \"NO\"\r\n\r\nif c % a == 0 or c % b == 0:\r\n print(\"YES\")\r\n quit()\r\n\r\nfor i in range(5000):\r\n for j in range(5000):\r\n if a*i + b*j == c:\r\n ans = \"YES\"\r\n break\r\n if ans == \"YES\":break\r\n \r\nprint(ans)", "#633A\r\n[a,b,c] = list(map(int,input().split()))\r\nres = 'No'\r\nfor i in range(c//a+1):\r\n if (c - i*a) %b == 0:\r\n res = 'Yes'\r\n break\r\nprint(res)", "def solution(a, b, n):\r\n i = 0\r\n while i*a<=n:\r\n if (n - (i*a)) % b == 0:\r\n print(\"Yes\")\r\n return 0\r\n i+=1\r\n print(\"No\")\r\na,b,c=map(int,input().split())\r\nsolution(a,b,c)\r\n", "def gcd(a,b):\r\n if b==0:\r\n return (a,1,0)\r\n g,x0,y0 = gcd(b,a%b)\r\n x = y0\r\n y = x0 - (a//b)*y0\r\n return (g,x,y)\r\n\r\ndef findanysolution(a,b,c):\r\n g,x,y = gcd(abs(a),abs(b))\r\n if c%g != 0:\r\n return False\r\n x *= (c//g)\r\n y *= (c//g)\r\n if a<0:\r\n x = -x\r\n if b<0:\r\n y = -y\r\n return (g,x,y)\r\ndef shift(x,y,a,b,cnt):\r\n x += (cnt*b)\r\n y -= (cnt*a)\r\n return (x,y)\r\ndef war(a,b,c,minx=0,miny=0):\r\n kk = findanysolution(a,b,c)\r\n if kk==False:\r\n return \"No\"\r\n g,x,y = kk[0],kk[1],kk[2]\r\n\r\n signa = a//abs(a)\r\n signb = b//abs(b)\r\n\r\n a //= g\r\n b //= g\r\n\r\n x,y = shift(x,y,a,b,(minx-x)//b)\r\n if x<minx:\r\n x,y = shift(x,y,a,b,signb)\r\n ly = y\r\n\r\n x,y = shift(x,y,a,b,-(miny-y)//a)\r\n if y<miny:\r\n x,y = shift(x,y,a,b,-signa)\r\n lx = x\r\n\r\n \r\n if lx<0 and ly<0:\r\n return \"No\"\r\n return \"Yes\"\r\n\r\na,b,c = map(int,input().split())\r\nprint(war(a,b,c))", "import math\r\na1,b1,c=map(int,input().split())\r\nif c%math.gcd(a1,b1)!=0:print('No')\r\nelse:\r\n\ta=max(a1,b1)\r\n\tb=min(a1,b1)\r\n\tx=0\r\n\tif c%a==0:\r\n\t\tprint('Yes')\r\n\telse:\r\n\t\twhile a*x<=c:\r\n\t\t\tif (c-(a*x))%b==0:\r\n\t\t\t\tprint('Yes')\r\n\t\t\t\tbreak\r\n\t\t\tx+=1\r\n\t\telse:\r\n\t\t\tprint('No')", "a,b,c=map(int,input().split())\r\nf=0\r\nfor i in range(10001):\r\n n=c-i*a\r\n if(n>=0 and n//b==n/b):\r\n f=1\r\n break\r\nif(f==1):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n \r\n \r\n", "from math import gcd\r\na, b, c = input().split()\r\na, b, c = int(a), int(b), int(c)\r\nx = 0\r\n\r\nwhile a * x <= c:\r\n y = c - a * x\r\n if y % b == 0:\r\n print(\"Yes\")\r\n exit(0)\r\n else:\r\n x += 1\r\n continue\r\nprint(\"No\")\r\n", "ebony, ivory, total = map(int, input().split())\r\npossible, total2 = False, total\r\n\r\nwhile total > 0 or total2 > 0:\r\n if total > 0:\r\n if total % ivory == 0:\r\n possible = True\r\n break\r\n else:\r\n total -= ebony\r\n\r\n if total2 > 0:\r\n if total2 % ebony == 0:\r\n possible = True\r\n break\r\n else:\r\n total2 -= ivory\r\n\r\nif possible:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "n,m,c=map(int,input().split())\r\ndef gcd(n,m):\r\n if m==0:\r\n return n\r\n else:\r\n return gcd(m,n%m)\r\nif c%gcd(n,m)==0:\r\n f=0\r\n x=c//n\r\n while x>=0:\r\n if (c-x*n)%m==0:\r\n f=1\r\n break\r\n else:\r\n x-=1\r\n if f==1:\r\n print('Yes')\r\n else:\r\n print('No') \r\n \r\nelse:\r\n print('No') ", "a, b, c = map(int, input().split())\r\n\r\ndef extGCD(a, b):\r\n if b == 0:\r\n return a, 1, 0\r\n d, x1, y1 = extGCD(b, a%b)\r\n\r\n x = y1\r\n y = x1 - y1 * (a//b)\r\n return d, x, y\r\n\r\ndef find_any_solution(a, b, c):\r\n g, x0, y0 = extGCD(abs(a), abs(b))\r\n if c % g != 0:\r\n return False, 0, 0, 0\r\n x0 *= c // g\r\n y0 *= c // g\r\n if a < 0:\r\n x0 *= -1\r\n if b < 0:\r\n y0 *= -1\r\n return True, g, x0, y0\r\n\r\ndef shift_solution(x, y, a, b, cnt):\r\n x += cnt * b\r\n y -= cnt * a\r\n return x, y\r\n \r\n\r\ndef find_all_solutions(a, b, c, min_x, max_x, min_y, max_y):\r\n find, g, x, y = find_any_solution(a, b, c)\r\n if not find:\r\n return 0\r\n a //= g\r\n b //= g\r\n sign_a = 1 if a > 0 else -1\r\n sign_b = 1 if b > 0 else -1\r\n\r\n x, y = shift_solution(x, y, a, b, (min_x - x) // b)\r\n if x < min_x:\r\n x, y = shift_solution(x, y, a, b, sign_b)\r\n if x > max_x:\r\n return 0\r\n lx1 = x\r\n\r\n x, y = shift_solution(x, y, a, b, (max_x - x) // b)\r\n if x > max_x:\r\n x, y = shift_solution(x, y, a, b, -sign_b)\r\n rx1 = x\r\n\r\n x, y = shift_solution(x, y, a, b, -(min_y - y) // a)\r\n if y < min_y:\r\n x, y = shift_solution(x, y, a, b, -sign_a)\r\n if y > max_y:\r\n return 0\r\n lx2 = x\r\n\r\n x, y = shift_solution(x, y, a, b, -(max_y - y) // a)\r\n if y > max_y:\r\n x, y = shift_solution(x, y, a, b, sign_a)\r\n rx2 = x\r\n if lx2 > rx2:\r\n lx2, rx2 = rx2, lx2\r\n lx = max(lx1, lx2)\r\n rx = min(rx1, rx2)\r\n\r\n return (rx - lx) // abs(b) + 1\r\n\r\nans = find_all_solutions(a, b, c, 0, 10000, 0, 10000)\r\nif ans:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "[a,b,c]=[int(x) for x in input().split()]\r\nfor i in range(c//a+1):\r\n d=a*i\r\n if (c-d)%b==0:\r\n print(\"Yes\")\r\n exit(0)\r\nprint(\"No\")\r\n", "#!/usr/bin/env python3\nimport itertools, functools, math\n\ndef solve():\n a, b, c = map(int, input().split())\n i = 0\n while i*a <= c:\n damage_a = i*a\n damage_b = c - damage_a\n if damage_b == 0 or damage_b%b == 0:\n return 'Yes'\n i += 1\n return 'No'\n\n\nif __name__ == '__main__':\n print(solve())\n\n", "a,b,c=map(int,input().split())\r\nif c%a==0 or c%b==0:\r\n print(\"Yes\")\r\nelse:\r\n m=False\r\n while c>min(a,b):\r\n c-=min(a,b)\r\n if c%a==0 or c%b==0:\r\n m=True\r\n break\r\n if m:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n " ]

{"inputs": ["4 6 15", "3 2 7", "6 11 6", "3 12 15", "5 5 10", "6 6 7", "1 1 20", "12 14 19", "15 12 26", "2 4 8", "4 5 30", "4 5 48", "2 17 105", "10 25 282", "6 34 323", "2 47 464", "4 53 113", "6 64 546", "1 78 725", "1 84 811", "3 100 441", "20 5 57", "14 19 143", "17 23 248", "11 34 383", "20 47 568", "16 58 410", "11 70 1199", "16 78 712", "20 84 562", "19 100 836", "23 10 58", "25 17 448", "22 24 866", "24 35 67", "29 47 264", "23 56 45", "25 66 1183", "21 71 657", "29 81 629", "23 95 2226", "32 4 62", "37 15 789", "39 24 999", "38 32 865", "32 50 205", "31 57 1362", "38 68 1870", "36 76 549", "35 84 1257", "39 92 2753", "44 1 287", "42 12 830", "42 27 9", "49 40 1422", "44 42 2005", "50 55 2479", "48 65 917", "45 78 152", "43 90 4096", "43 94 4316", "60 7 526", "53 11 735", "52 27 609", "57 32 992", "52 49 421", "57 52 2634", "54 67 3181", "52 73 638", "57 84 3470", "52 100 5582", "62 1 501", "63 17 858", "70 24 1784", "65 32 1391", "62 50 2775", "62 58 88", "66 68 3112", "61 71 1643", "69 81 3880", "63 100 1960", "73 6 431", "75 19 736", "78 25 247", "79 36 2854", "80 43 1864", "76 55 2196", "76 69 4122", "76 76 4905", "75 89 3056", "73 100 3111", "84 9 530", "82 18 633", "85 29 2533", "89 38 2879", "89 49 2200", "88 60 4140", "82 68 1299", "90 76 2207", "83 84 4923", "89 99 7969", "94 9 168", "91 20 1009", "93 23 2872", "97 31 3761", "99 46 1341", "98 51 2845", "93 66 3412", "95 76 3724", "91 87 6237", "98 97 7886", "12 17 15", "93 94 95", "27 43 27", "17 43 68", "44 12 12", "44 50 150", "1 1 10000", "2 3 10000", "100 1 10", "3 2 1", "1 1 1", "9 9 10000", "2 3 9995", "3 5 4", "99 98 100", "6 10 2", "1 6 5", "1 4 3", "3 2 3", "1 7 6", "2 3 9871", "10 5 5", "10 8 2"], "outputs": ["No", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "No", "No", "Yes", "Yes", "Yes", "Yes", "No", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "No", "No", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "No", "Yes", "Yes", "No", "Yes", "No", "Yes", "Yes", "No", "Yes", "No", "Yes", "Yes", "No", "No", "Yes", "Yes", "No", "No", "Yes", "Yes", "No", "No", "No", "No", "No", "No", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "Yes", "No", "No", "No", "Yes", "Yes", "Yes", "Yes", "No", "No", "Yes", "No", "No", "Yes", "Yes", "Yes", "No", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "Yes", "No", "No", "Yes", "Yes", "Yes", "Yes", "No", "No", "Yes", "Yes", "No", "No", "Yes", "Yes", "Yes", "No", "No", "Yes", "Yes", "Yes", "No", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "No", "Yes", "No", "No", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "No"]}

UNKNOWN

PYTHON3

CODEFORCES

192

8f150d098d84cde9f7d73b00f0091443

none

Astronaut Natasha arrived on Mars. She knows that the Martians are very poor aliens. To ensure a better life for the Mars citizens, their emperor decided to take tax from every tourist who visited the planet. Natasha is the inhabitant of Earth, therefore she had to pay the tax to enter the territory of Mars. There are $n$ banknote denominations on Mars: the value of $i$-th banknote is $a_i$. Natasha has an infinite number of banknotes of each denomination. Martians have $k$ fingers on their hands, so they use a number system with base $k$. In addition, the Martians consider the digit $d$ (in the number system with base $k$) divine. Thus, if the last digit in Natasha's tax amount written in the number system with the base $k$ is $d$, the Martians will be happy. Unfortunately, Natasha does not know the Martians' divine digit yet. Determine for which values $d$ Natasha can make the Martians happy. Natasha can use only her banknotes. Martians don't give her change. The first line contains two integers $n$ and $k$ ($1 \le n \le 100\,000$, $2 \le k \le 100\,000$) — the number of denominations of banknotes and the base of the number system on Mars. The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 10^9$) — denominations of banknotes on Mars. All numbers are given in decimal notation. On the first line output the number of values $d$ for which Natasha can make the Martians happy. In the second line, output all these values in increasing order. Print all numbers in decimal notation. Sample Input 2 8 12 20 3 10 10 20 30 Sample Output 2 0 4 1 0

[ "from functools import reduce\r\nfrom math import gcd\r\nn, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nG = gcd(k, reduce(lambda x,y:gcd(x,y),A))\r\nprint(k // G)\r\nprint(*list(range(0, k, G)))", "n,k=map(int,input().split())\ng=lambda x:int(x)%k\na=list(map(g,input().split()))\ndef nod(a,b):\n while b>0:\n a%=b\n a,b=b,a\n return a\nc=k\nfor x in a:\n if x!=0:\n c=nod(c,x)\nprint(k//c)\nprint(' '.join(map(str,list(range(0,k,c)))))\n\n\t \t \t\t \t\t \t\t\t\t\t \t\t \t\t", "from math import gcd\r\n\r\ndef MinimumGCD(arr, n):\r\n\tg = 0\r\n\tfor i in range(n):\r\n\t\tg = gcd(g, arr[i])\r\n\treturn g\r\n\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tarr[i]=arr[i]%k\r\nt=k+1\r\nfor i in range(n):\r\n\tt=min(t,gcd(k,arr[i]))\r\nt1= MinimumGCD(arr, n)\r\nt1= gcd(t1%k,k)\r\nf=min(t,t1)\r\nc=[0]*k\r\np=f%k\r\nwhile(c[p]==0):\r\n\tc[p]=1\r\n\tp=(p+f)%k\r\nprint(c.count(1))\r\nfor i in range(k):\r\n\tif(c[i]):\r\n\t\tprint(i,end=\" \")", "def gcd(a,b):\r\n return a if 0==b else gcd(b,a%b)\r\n\r\n\r\n\r\nn,k=map(int,input().split(\" \"))\r\n#print(k)\r\nden=list(map(int,input().split(\" \")))\r\ng=0\r\nfor i in den:\r\n g=gcd(g,i)\r\n\r\nd=[]\r\ndic={}\r\ni=0\r\nwhile (i<k):\r\n val=(i*g)%k\r\n #print(\"Value=\"+str(val))\r\n if(not val in dic):\r\n d.append(val)\r\n dic[val]=1\r\n i=i+1\r\n else:\r\n i=i+1\r\n continue\r\nprint(len(d))\r\nd.sort()\r\nfor val in d:\r\n print(val,end=\" \")\r\n", "from math import gcd\nn, k = map(int, input().split())\na = list(map(int, input().split()))\ng = 0\nfor i in a:\n g = gcd(g, i)\nans = set()\nans.add(g % k)\nfor i in range(k):\n ans.add((i * g) % k)\nprint(len(ans))\nprint(*sorted(list(ans)))\n\n \t\t\t\t \t\t\t\t \t \t\t \t\t \t \t", "from math import gcd\r\nn, k = map(int, input().split())\r\na = set([int(x) % k for x in input().split()])\r\nans = k\r\nfor elem in a:\r\n ans = gcd(ans, elem)\r\nprint(k // ans)\r\nprint(*list(range(0, k, ans)))", "from bisect import bisect\r\nfrom collections import defaultdict\r\n# l = list(map(int,input().split()))\r\n# map(int,input().split()))\r\nfrom math import gcd,sqrt,ceil,inf\r\nfrom collections import Counter\r\nimport sys\r\nsys.setrecursionlimit(1000000)\r\nfrom bisect import bisect\r\nfrom collections import defaultdict\r\n# l = list(map(int,input().split()))\r\n# map(int,input().split()))\r\nfrom math import gcd,sqrt,ceil,inf,factorial,log2\r\nfrom collections import Counter\r\nimport sys\r\nsys.setrecursionlimit(10**9)\r\n\r\n\r\nn,k = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\n\r\ng = 0\r\n\r\nfor i in l:\r\n g = gcd(i,g)\r\nseti = set()\r\nfor i in range(k+1):\r\n ka = (g*i)%k\r\n seti.add(ka)\r\nprint(len(seti))\r\nfor i in sorted(seti):\r\n print(i,end= ' ')\r\n\r\n\r\n", "from functools import reduce\r\ndef gcd(x,y):\r\n if x == 0:\r\n return y\r\n elif y == 0:\r\n return x\r\n if x > y:\r\n return gcd(x%y,y)\r\n elif x < y:\r\n return gcd(x,y%x)\r\n else:\r\n return x\r\n\r\n\r\ndef main():\r\n [n,k]=list(map(int,input().split(\" \")))\r\n a = list(map(int,input().split(\" \")))\r\n gcd1 = reduce(gcd,a+[k])\r\n print(int(k/gcd1))\r\n print(\" \".join([str(gcd1*x) for x in range(int(k/gcd1))]))\r\n\r\nmain()", "import os,io,math\r\ninput=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nr=k\r\nfor i in range(n):\r\n r=math.gcd(r,a[i])\r\nans=[]\r\nfor i in range(0,k,r):\r\n ans.append(i)\r\nprint(len(ans))\r\nprint(' '.join(map(str,ans)))", "import math\r\ni=lambda:map(int,input().split())\r\nn,k=i()\r\ng=k\r\nfor a in i():g=math.gcd(g,a)\r\nprint(k//g)\r\nprint(*range(0,k,g))", "n,k=map(int,input().split())\r\n#the number of denominations of banknotes and the base of the number system on Mars.\r\nB=list(map(int,input().split()))\r\n#denominations of banknotes on Mars.\r\n\r\ndef gcd(a, b):\r\n\twhile b:\r\n\t\ta, b = b, a % b\r\n\treturn a\r\n\r\nallgcd=k\r\n\r\nfor i in range(n):\r\n allgcd=gcd(allgcd,B[i])\r\n\r\n\r\nx=k//allgcd\r\nprint(x)\r\n\r\nANS=[None]*x\r\nfor i in range(x):\r\n ANS[i]=allgcd*i\r\n\r\nfor i in range(x-1):\r\n print(ANS[i],end=\" \")\r\n\r\nprint(ANS[x-1])\r\n \r\n", "from math import gcd\nfrom functools import reduce\n\n\ndef main():\n n, k = map(int, input().split())\n g = reduce(gcd, map(int, input().split()), k)\n print(k // g, ' '.join(map(str, range(0, k, g))), sep='\\n')\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\nn,k=map(int,input().split())\r\ng=k\r\nfor a in map(int,input().split()):\r\n g=math.gcd(g,a)\r\nprint(k//g)\r\nprint(*range(0,k,g))", "def gcd(x,y):\r\n if x == 0:\r\n return y\r\n elif y == 0:\r\n return x\r\n if x > y:\r\n return gcd(x%y,y)\r\n elif x < y:\r\n return gcd(x,y%x)\r\n else:\r\n return x\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nflag1=0\r\nans1=k\r\ni=0\r\nwhile(i<n):\r\n ans1=gcd(arr[i]%k,ans1)\r\n i+=1\r\narr1=[0]\r\nans=ans1\r\nif(ans==k):\r\n print(1)\r\n print(0)\r\nelse:\r\n while(ans1<k):\r\n arr1.append(ans1)\r\n ans1+=ans\r\n print(len(arr1))\r\n print(*arr1)", "def gcd(a, b):\n while b != 0:\n a, b = b, a % b\n return a\n\nn, k = map(int, input().split(' '))\naa = list(map(int, input().split(' ')))\n\nm = k\nfor a in aa:\n m = gcd(m, a)\n\nprint(k // m)\nfor i in range(0, k, m):\n print(i, end=' ')\nprint()\n", "def gcd(a, b):\n\tif (a < b):\n\t\ta, b = b, a\n\tif (b == 0):\n\t\treturn a\n\treturn gcd(b, a % b)\n\n\nn, k = map(int, input().split())\nl = list(map(int, input().split()))\ngcdd = k\nfor i in range(n):\n\tgcdd = gcd(gcdd, l[i])\nif (gcdd == 0):\n\tprint(1)\n\tprint(0)\nelse:\n\tprint(k // gcdd)\n\tans = []\n\tfor i in range(1, k // gcdd + 1):\n\t\tans.append((i * gcdd) % k)\nprint(' '.join(map(str, sorted(ans))))\n\n \t \t\t \t\t \t\t\t\t\t\t \t\t \t \t", "import sys,math\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\nn,k=invr()\r\nnote=inara()\r\ng=k\r\nfor taka in note:\r\n\tg=math.gcd(g,taka)\r\n\r\nkhushi=[]\r\nfor i in range(0,k,g):\r\n\tkhushi.append(i)\r\n\r\nprint(len(khushi))\r\nprint(*khushi)\r\n", "from math import gcd\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na_ = [el % k for el in a]\r\n\r\ng = gcd(k, a_[0])\r\nfor i in range(1, n):\r\n g = gcd(g, a_[i])\r\n\r\nprint(k // g)\r\nprint(' '.join(map(str, [g * i for i in range(k // g)])))\r\n", "from math import gcd\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ngd=0\r\nfor i in range(n):\r\n gd=gcd(gd,arr[i])\r\ncount=gd\r\ns=set()\r\nfor i in range(k):\r\n s.add(count %k)\r\n count +=gd\r\ns=list(s)\r\ns.sort()\r\nprint(len(s))\r\nprint(*s)", "from math import *\r\nfrom collections import *\r\nimport sys\r\nsys.setrecursionlimit(10**9)\r\n\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ng = a[0]%k\r\nfor i in range(1,n):\r\n\tg = gcd(g,a[i]%k)\r\nans = [g]\r\nx = (g+g)%k\r\nwhile(x != g):\r\n\tans.append(x)\r\n\tx += g\r\n\tx %= k\r\nprint(len(ans))\r\nans.sort()\r\nfor i in ans:\r\n\tprint(i,end = \" \")\r\nprint()", "import sys\r\nimport math\r\nfrom collections import defaultdict\r\nn,k=map(int,sys.stdin.readline().split())\r\na=list(map(int,sys.stdin.readline().split()))\r\nl=[0 for _ in range(n)]\r\nfor i in range(n):\r\n l[i]=a[i]%k\r\nans=set()\r\nans.add(0)\r\nvis=defaultdict(int)\r\nx=0\r\nfor i in range(n):\r\n x=math.gcd(x,l[i])\r\nst=0\r\nx=math.gcd(x,k)\r\nwhile st*x<k and x!=0:\r\n ans.add(st*x)\r\n st+=1\r\nprint(len(ans))\r\nres=list(ans)\r\nres.sort()\r\nprint(*res)\r\n", "n, k = map(int,input().split())\r\nv = list(map(int,input().split()))\r\n\r\ndef gcd(a,b):\r\n\tif a < b:\r\n\t\treturn gcd(b,a)\r\n\tif b == 0:\r\n\t\treturn a\r\n\telse:\r\n\t\treturn gcd(b, a%b) \r\n\r\ng = v[0]\r\nfor i in range(1,n):\r\n\tg = gcd(g, v[i])\r\n\r\nlst = set()\r\nfor i in range(k):\r\n\tlst.add(g*i % k)\r\n\r\nlst = sorted(list(lst))\r\nprint(len(lst))\r\nprint(' '.join(map(str,lst)))", "def nod(a,b):\r\n while a!=0 and b!=0:\r\n if a>b:\r\n a,b=b,a%b\r\n else:\r\n b,a=a,b%a\r\n return a+b\r\nn ,k = map(int, input().split()) \r\na = [int(j) for j in input().split()] \r\nc = a[0]\r\nfor i in range(1,n):\r\n c = nod(c,a[i])\r\n if c==1:\r\n break\r\ne = nod(c,k)\r\nif c==1 or e==1:\r\n print(k)\r\n for i in range(k):\r\n print(i, end=\" \")\r\n\r\nif e>1:\r\n c = k//e\r\n print(c)\r\n for i in range(c):\r\n print(i*e, end=' ')\r\n \r\n \r\n \r\n", "from math import gcd\r\n\r\nn, k = map(int, input().split()) # leemos los enteros n y k\r\n # que representan el numero de denominaciones de los billetes y la base del sistema numerico en marte\r\nA = list(map(int, input().split())) # leemos los n enteros que representan las denominaciones de los billetes\r\n\r\ng = 0 # variable donde guardaremos el gcd de las denominaciones de los billetes\r\nfor ai in A: # recorremos todas las denominaciones de los billetes\r\n g = gcd(g, ai) # hallamos el gcd de los ai\r\n\r\ns = set() # creamos un set para almacenar los valores \"d\"\r\nx = 0 # variable para ir calculando los valores \"d\"\r\nwhile x < k:\r\n d = (g*x) % k # caculamos el valor \"d\"\r\n #if d not in s: # verificamos si el \"d\" calculado no se ha calculado anteriormente\r\n s.add(d) # se añade el valor \"d\" al set\r\n #else: # si el de \"d\" calculado ya se calculo anteriormente, salimos del while ya que se han calculado todos los valores \"d\"\r\n # break\r\n x += 1 # aumentamos el valor de x para calcular el proximo \"d\"\r\n\r\nprint(len(s)) # se imprime la cantida de valores \"d\"\r\nprint(*sorted(s)) # se imprime todos los valores \"d\"\r\n", "def gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\nn, k = map(int, input().split())\r\na = list(set([int(i) % k for i in input().split()]))\r\nres = k\r\nfor i in a:\r\n res = gcd(res, i)\r\nprint(k // res)\r\nprint(*list(range(0, k, res)))", "from math import gcd\r\nfrom functools import reduce\r\n\r\nn, k = [int(aa) for aa in input().split()]\r\na = [int(aa) for aa in input().split()]\r\ng = reduce(gcd, a)%k\r\nansw = [0] * k\r\n\r\npos = g\r\ncount = 0\r\nwhile answ[pos]==0:\r\n answ[pos]=1\r\n pos = (pos+g)%k\r\n count+=1\r\n\r\nprint(count)\r\nfor i in range(len(answ)):\r\n if answ[i]==1:\r\n print(i, end=' ')\r\n", "import math\r\nfrom functools import reduce\r\na,b = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nd = c[0]\r\nfor j in range(a):\r\n d = math.gcd(d,c[j])\r\n if d == 1:\r\n break\r\ne = math.gcd(d,b)\r\nprint(b//e)\r\n#f = [i for i in range(b) if i%e == 0]\r\n#g = \" \".join(str(k) for k in range(b) if k%e == 0)\r\nprint(\" \".join(str(k) for k in range(b) if k%e == 0))", "from functools import reduce\nfrom math import gcd\n\n_, k = map(int, input().split())\ng = reduce(gcd, [k] + list(map(int, input().split())))\nprint(k // g)\nprint(\" \".join(str(l) for l in range(0, k, g)))", "def gcd(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 gcd(b,a%b)\r\n \r\n \r\nn,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n a[i]=a[i]%k\r\na.append(k)\r\nb=0\r\nfor i in range(n+1):\r\n b=gcd(b,a[i])\r\nc=[]\r\nfor i in range(0,k,b):\r\n c.append(i)\r\n\r\nprint(len(c))\r\nprint(*c)", "def 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(A, k):\r\n g = k\r\n for x in A:\r\n g = gcd(x, g)\r\n return [i*g for i in range(k//g)]\r\n\r\nn, k = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nanswer = process(A, k)\r\nprint(len(answer))\r\nprint(' '.join(map(str, answer)))", "from math import gcd\r\nn,k=map(int,input().split())\r\ng=0\r\nl=list(map(int,input().split()))\r\nfor e in l:\r\n g=gcd(g,gcd(e,k))\r\nprint(k//g)\r\nfor i in range(0,k,g): print(i,end=' ')", "from functools import reduce\r\nfrom math import ceil, floor\r\n\r\n\r\ndef gcd(x, y):\r\n \"\"\"greatest common divisor of x and y\"\"\"\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n\r\n\r\ndef extended_gcd(a, b):\r\n \"\"\"returns gcd(a, b), s, r s.t. a * s + b * r == gcd(a, b)\"\"\"\r\n s, old_s = 0, 1\r\n r, old_r = b, a\r\n while r:\r\n q = old_r // r\r\n old_r, r = r, old_r - q * r\r\n old_s, s = s, old_s - q * s\r\n return old_r, old_s, (old_r - old_s * a) // b if b else 0\r\n\r\n\r\ngcdm = lambda args: reduce(gcd, args, 0)\r\n\r\nlcm = lambda a, b: a * b // gcd(a, b)\r\n\r\nlcmm = lambda *args: reduce(lcm, args, 1)\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n g = gcdm(a + [k])\r\n\r\n print(k // g)\r\n print(\" \".join([str(x * g) for x in range(k // g)]))\r\n\r\n\r\nmain()\r\n\r\n# sum(ai xi) - kl = d\r\n\r\n# ž g <= k\r\n", "#!/usr/bin/python3\r\nimport sys\r\nfrom math import gcd\r\nN, k = [int(x) for x in input().split()]\r\nsk = [int(x) for x in input().split()]\r\n\r\ndbd = 0\r\nfor i in sk:\r\n\tdbd = gcd(dbd, i)\r\n\r\nats = set()\r\nfor i in range(k):\r\n\tats.add((i*dbd)%k)\r\n\r\nprint(len(ats))\r\n\r\nats2 = sorted(ats)\r\nfor i in ats2:\r\n\tprint(i, end=' ')", "import math\r\nn,k = [int(i) for i in input().split()]\r\ng = 0\r\nfor i in input().split():\r\n g = math.gcd(g,int(i))\r\nx = g%k\r\nA = [0]*k\r\nwhile(A[x]==0):\r\n A[x] = 1\r\n x = (x+g)%k\r\nB = []\r\nfor i in range(0,k):\r\n if(A[i]==1): B.append(i)\r\nprint(len(B))\r\nprint(*B,sep=' ')", "def gcd(a,b):\r\n if b == 0:\r\n return a\r\n return gcd(b,a%b)\r\nn,k=map(int, input().split())\r\na=[int(v) for v in input().split()]\r\nf=[0]*100010\r\ng=0\r\nfor i in a:\r\n g=gcd(g,i%k)\r\ns = 0\r\nfor i in range(k):\r\n f[s%k] = 1\r\n s = s + g\r\nprint(sum(f))\r\nfor i in range(k):\r\n if f[i]:\r\n print(i, end=' ')" ]

{"inputs": ["2 8\n12 20", "3 10\n10 20 30", "5 10\n20 16 4 16 2", "10 5\n4 6 8 6 4 10 2 10 8 6", "20 25\n15 10 5 20 10 5 15 5 15 10 15 5 5 5 5 10 15 20 20 20", "30 30\n11 23 7 30 13 6 25 29 1 15 20 5 28 15 19 22 21 5 27 25 29 10 1 4 12 19 1 5 8 10", "40 30\n16 12 12 22 18 28 32 24 36 26 12 30 22 16 32 30 36 18 20 16 12 24 28 20 16 28 8 34 18 18 18 4 4 36 18 10 30 38 18 10", "50 30\n15 9 21 39 42 39 3 42 42 39 6 48 39 30 12 39 27 45 30 48 18 33 18 36 27 3 48 12 36 27 15 12 42 39 18 21 48 39 15 42 24 36 33 48 6 48 15 12 30 18", "1 10\n1", "1 2\n1", "60 30\n10 30 45 15 25 60 10 40 35 25 5 40 35 40 15 5 15 35 10 60 25 15 60 10 30 10 5 25 10 15 60 20 30 5 50 50 40 20 55 40 35 15 15 10 60 40 50 50 30 15 25 45 35 40 15 5 5 20 60 45", "70 30\n54 30 12 48 42 24 42 60 54 6 36 42 54 66 12 48 54 42 24 54 30 18 30 54 18 60 24 30 54 48 48 60 18 60 60 66 54 18 54 30 24 30 60 54 36 36 60 48 12 60 6 60 42 66 6 42 18 60 54 48 42 18 48 66 18 42 48 30 12 66", "80 30\n30 80 40 40 60 60 40 80 70 80 30 30 60 80 30 70 60 10 10 30 70 60 70 20 40 20 30 10 60 70 70 50 60 70 70 30 70 60 60 70 20 60 10 60 70 80 20 30 30 20 60 50 40 40 80 70 70 20 40 80 30 50 40 10 40 20 70 10 80 10 50 40 50 70 40 80 10 40 60 60", "90 30\n90 45 75 75 90 90 45 30 90 15 45 90 15 30 45 60 30 15 30 45 45 45 45 15 45 60 15 60 45 75 45 75 90 60 30 15 60 30 90 75 15 60 15 30 45 30 45 15 30 15 45 30 15 75 90 15 45 15 75 15 75 30 75 45 60 75 15 45 30 75 45 90 45 60 90 45 75 30 30 30 15 15 75 60 75 90 75 60 90 45", "100 30\n30 30 30 90 30 30 90 90 30 90 30 90 90 30 30 30 60 60 60 30 30 60 90 90 90 60 30 90 60 60 90 60 60 60 30 60 60 60 60 90 60 30 60 90 90 90 60 60 90 60 60 60 60 30 30 60 30 60 60 90 30 60 60 60 90 60 90 30 30 60 30 90 90 90 90 60 90 30 30 60 60 30 60 60 60 30 90 60 60 60 90 60 30 90 60 30 30 60 90 90", "1 10\n2", "1 10\n3", "5 2\n1 1 1 1 1", "2 30\n6 10", "1 10\n10", "1 10\n20", "1 2\n1000000000", "2 6\n2 3", "1 5\n4", "2 5\n2 4", "3 30\n6 10 15", "2 7\n3 6", "2 15\n3 5", "2 12\n4 6", "2 10\n3 6", "2 100000\n2 4", "1 14\n4", "1 13\n5", "2 420\n412 363", "2 30\n10 6", "1 5\n3", "1 8\n6", "3 10\n6 6 6", "1 7\n6", "1 9\n6", "2 10\n7 7", "1 8\n5", "2 50\n3 15", "1 6\n4", "1 7\n4", "1 10\n7", "1 3\n2", "2 10\n2 5", "2 50\n15 3", "1 5\n2", "2 10\n6 5", "2 35\n5 7", "2 300\n3 10", "1 100000\n47", "2 54\n6 9"], "outputs": ["2\n0 4 ", "1\n0 ", "5\n0 2 4 6 8 ", "5\n0 1 2 3 4 ", "5\n0 5 10 15 20 ", "30\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ", "15\n0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 ", "10\n0 3 6 9 12 15 18 21 24 27 ", "10\n0 1 2 3 4 5 6 7 8 9 ", "2\n0 1 ", "6\n0 5 10 15 20 25 ", "5\n0 6 12 18 24 ", "3\n0 10 20 ", "2\n0 15 ", "1\n0 ", "5\n0 2 4 6 8 ", "10\n0 1 2 3 4 5 6 7 8 9 ", "2\n0 1 ", "15\n0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 ", "1\n0 ", "1\n0 ", "1\n0 ", "6\n0 1 2 3 4 5 ", "5\n0 1 2 3 4 ", "5\n0 1 2 3 4 ", "30\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ", "7\n0 1 2 3 4 5 6 ", "15\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ", "6\n0 2 4 6 8 10 ", "10\n0 1 2 3 4 5 6 7 8 9 ", "50000\n0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 72 74 76 78 80 82 84 86 88 90 92 94 96 98 100 102 104 106 108 110 112 114 116 118 120 122 124 126 128 130 132 134 136 138 140 142 144 146 148 150 152 154 156 158 160 162 164 166 168 170 172 174 176 178 180 182 184 186 188 190 192 194 196 198 200 202 204 206 208 210 212 214 216 218 220 222 224 226 228 230 232 234 236 238 240 242 244 246 248 250 252 254 256 258 260 262 264 266 268 270 272 274 276 278...", "7\n0 2 4 6 8 10 12 ", "13\n0 1 2 3 4 5 6 7 8 9 10 11 12 ", "420\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 ...", "15\n0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 ", "5\n0 1 2 3 4 ", "4\n0 2 4 6 ", "5\n0 2 4 6 8 ", "7\n0 1 2 3 4 5 6 ", "3\n0 3 6 ", "10\n0 1 2 3 4 5 6 7 8 9 ", "8\n0 1 2 3 4 5 6 7 ", "50\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 ", "3\n0 2 4 ", "7\n0 1 2 3 4 5 6 ", "10\n0 1 2 3 4 5 6 7 8 9 ", "3\n0 1 2 ", "10\n0 1 2 3 4 5 6 7 8 9 ", "50\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 ", "5\n0 1 2 3 4 ", "10\n0 1 2 3 4 5 6 7 8 9 ", "35\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 ", "300\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 ...", "100000\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 1...", "18\n0 3 6 9 12 15 18 21 24 27 30 33 36 39 42 45 48 51 "]}

UNKNOWN

PYTHON3

CODEFORCES

35

8f1d925cbfe50cd21d804490a288b86a

Memory and Scores

Memory and his friend Lexa are competing to get higher score in one popular computer game. Memory starts with score *a* and Lexa starts with score *b*. In a single turn, both Memory and Lexa get some integer in the range [<=-<=*k*;*k*] (i.e. one integer among <=-<=*k*,<=<=-<=*k*<=+<=1,<=<=-<=*k*<=+<=2,<=...,<=<=-<=2,<=<=-<=1,<=0,<=1,<=2,<=...,<=*k*<=-<=1,<=*k*) and add them to their current scores. The game has exactly *t* turns. Memory and Lexa, however, are not good at this game, so they both always get a random integer at their turn. Memory wonders how many possible games exist such that he ends with a strictly higher score than Lexa. Two games are considered to be different if in at least one turn at least one player gets different score. There are (2*k*<=+<=1)2*t* games in total. Since the answer can be very large, you should print it modulo 109<=+<=7. Please solve this problem for Memory. The first and only line of input contains the four integers *a*, *b*, *k*, and *t* (1<=≤<=*a*,<=*b*<=≤<=100, 1<=≤<=*k*<=≤<=1000, 1<=≤<=*t*<=≤<=100) — the amount Memory and Lexa start with, the number *k*, and the number of turns respectively. Print the number of possible games satisfying the conditions modulo 1<=000<=000<=007 (109<=+<=7) in one line. Sample Input 1 2 2 1 1 1 1 2 2 12 3 1 Sample Output 6 31 0

[ "def c(n, k):\n\tif k > n:\n\t\treturn 0\n\ta = b = 1\n\tfor i in range(n - k + 1, n + 1):\n\t\ta *= i\n\tfor i in range(1, k + 1):\n\t\tb *= i\n\treturn a // b\na, b, k, t = map(int, input().split())\nn, m, s = 2 * k + 1, 2 * t, 2 * k * t + b - a\nans, mod = 0, 1000000007\nfor i in range(m + 1):\n\tans = (ans + [1, -1][i & 1] * c(m, i) * c(m + s - n * i, m)) % mod\nprint((pow(n, m, mod) - ans) % mod)\n \t \t \t \t \t\t\t\t\t\t \t\t \t", "mod=10**9+7\r\nf=[0]*500000\r\n\r\ndef POW(a,b):\r\n\tif(b==0):\r\n\t\treturn 1\r\n\tif(b&1):\r\n\t\treturn POW(a,b//2)**2*a%mod\r\n\telse:\r\n\t\treturn POW(a,b//2)**2\r\n\r\ndef C(n,m):\r\n\tif(m>n):\r\n\t\treturn 0\r\n\tt=f[n]*POW(f[m],mod-2)%mod*POW(f[n-m],mod-2)%mod\r\n\treturn t\r\n\r\n\r\nf[0]=1\r\nfor i in range(1,500000):\r\n\tf[i]=f[i-1]*i%mod\r\na,b,k,t=map(int,input().split(' '))\r\n\r\nans=0\r\nfor i in range(0,2*t+1):\r\n\tt1=POW(-1,i)*C(2*t,i)%mod\r\n\tt2=(C(210000+2*k*t-a+b+2*t-1-(2*k+1)*i+1,2*t)-C(1+2*k*t-a+b+2*t-1-(2*k+1)*i,2*t))%mod\r\n\tans=(ans+t1*t2)%mod\r\nprint(ans)\r\n", "A, B, K, T = map(int, input().split())\r\n\r\ndef count_scenarios(A, B, K, T):\r\n mod = 10**9 + 7\r\n K *= 2\r\n a = [[0] * 250005 for _ in range(2)]\r\n pre = 0\r\n now = 1\r\n a[0][1] = 1\r\n for i in range(T):\r\n sum1 = 0\r\n sum2 = 0\r\n for j in range(1, K * (i + 1) + 2):\r\n sum1 += a[pre][j]\r\n sum2 += a[pre][max(0, j - K - 1)]\r\n sum1 %= mod\r\n sum2 %= mod\r\n a[now][j] = sum1 - sum2\r\n a[now][j] = (a[now][j] % mod + mod) % mod\r\n now, pre = pre, now\r\n t = A - B - 1\r\n ans = 0\r\n sum1 = 0\r\n for i in range(1, t + 1):\r\n sum1 += a[pre][i]\r\n sum1 %= mod\r\n for i in range(1, K * T + 2):\r\n sum1 += a[pre][max(0, i - (B - A + 1))]\r\n sum1 %= mod\r\n ans = (ans + sum1 * a[pre][i]) % mod\r\n return ans\r\nprint(count_scenarios(A, B, K, T))# 1690888180.0879874", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b, k, t = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\ndp = [1]\r\nfor _ in range(t):\r\n dp0 = dp + [0] * (2 * k)\r\n for i in range(len(dp) - 1):\r\n dp0[i + 2 * k + 1] -= dp[i]\r\n for i in range(1, len(dp0)):\r\n dp0[i] = (dp0[i] + dp0[i - 1]) % mod\r\n dp = dp0\r\ns = list(dp)\r\nl = len(dp)\r\nfor i in range(1, l):\r\n s[i] = (s[i] + s[i - 1]) % mod\r\nans = 0\r\nd = a - b - 1\r\nfor i in range(l):\r\n if i + d >= 0:\r\n ans += dp[i] * s[min(i + d, l - 1)] % mod\r\n ans %= mod\r\nans %= mod\r\nprint(ans)" ]

{"inputs": ["1 2 2 1", "1 1 1 2", "2 12 3 1", "4 6 2 1", "4 6 2 2", "6 4 2 2", "10 1 3 3", "5 3 1 1", "50 22 5 5", "6 20 1 1", "42 42 2 3", "42 42 3 2", "45 54 4 5", "6 5 4 3", "42 42 42 42", "1 100 42 42", "1 100 1000 100", "1 1 1000 100", "100 100 1000 100", "1 8 1 4", "9 4 5 2", "2 6 6 2", "7 8 5 9", "3 7 8 6", "69 69 803 81", "67 67 871 88", "71 71 891 31", "49 49 631 34", "83 83 770 49", "49 49 163 15", "38 38 701 74", "65 65 803 79", "56 56 725 64", "70 70 176 56", "32 32 44 79", "35 35 353 21", "57 57 896 52", "86 86 373 19", "27 27 296 97", "60 60 86 51", "40 40 955 95", "34 34 706 59", "74 74 791 51", "69 69 443 53", "59 19 370 48", "78 82 511 33", "66 90 805 16", "60 61 772 19", "81 13 607 21", "35 79 128 21", "93 25 958 20", "44 85 206 80", "79 99 506 18", "97 22 29 8", "14 47 184 49", "74 33 868 5", "53 79 823 11", "99 99 913 42", "52 34 89 41", "87 100 200 80", "40 94 510 53", "2 56 438 41", "6 68 958 41", "44 80 814 26", "100 1 1000 100", "1 3 1000 100", "10 10 1000 100"], "outputs": ["6", "31", "0", "3", "122", "435", "112812", "8", "876439301", "0", "6937", "1085", "433203628", "282051", "284470145", "58785421", "542673827", "922257788", "922257788", "1", "11045", "8015", "860378382", "510324293", "74925054", "123371511", "790044038", "764129060", "761730117", "458364105", "496603581", "253679300", "338598412", "990579000", "20803934", "149936279", "271910130", "940701970", "394599845", "277883413", "600387428", "274236101", "367968499", "385620893", "125206836", "375900871", "593436252", "931528755", "762608093", "177972209", "873170266", "170080402", "486170430", "471632954", "726421144", "826980486", "526626321", "446683872", "905639400", "913761305", "233079261", "500592304", "719351710", "414148151", "603336175", "604187087", "922257788"]}

UNKNOWN

PYTHON3

CODEFORCES

4

8f5411ecdb281373c50db07fac8679e9

Lefthanders and Righthanders

One fine October day a mathematics teacher Vasily Petrov went to a class and saw there *n* pupils who sat at the desks, two people at each desk. Vasily quickly realized that number *n* is even. Like all true mathematicians, Vasily has all students numbered from 1 to *n*. But Vasily Petrov did not like the way the children were seated at the desks. According to him, the students whose numbers differ by 1, can not sit together, as they talk to each other all the time, distract others and misbehave. On the other hand, if a righthanded student sits at the left end of the desk and a lefthanded student sits at the right end of the desk, they hit elbows all the time and distract each other. In other cases, the students who sit at the same desk, do not interfere with each other. Vasily knows very well which students are lefthanders and which ones are righthanders, and he asks you to come up with any order that meets these two uncomplicated conditions (students do not talk to each other and do not bump their elbows). It is guaranteed that the input is such that at least one way to seat the students always exists. The first input line contains a single even integer *n* (4<=≤<=*n*<=≤<=100) — the number of students in the class. The second line contains exactly *n* capital English letters "L" and "R". If the *i*-th letter at the second line equals "L", then the student number *i* is a lefthander, otherwise he is a righthander. Print integer pairs, one pair per line. In the *i*-th line print the numbers of students that will sit at the *i*-th desk. The first number in the pair stands for the student who is sitting to the left, and the second number stands for the student who is sitting to the right. Separate the numbers in the pairs by spaces. If there are multiple solutions, print any of them. Sample Input 6 LLRLLL 4 RRLL Sample Output 1 4 2 5 6 3 3 1 4 2

[ "# a - 1\ninFile=open(\"input.txt\",\"r\")\noutFiles=open(\"output.txt\",\"w\")\nstudents=inFile.readline().strip()\nstudents=int(students)\nseating=inFile.readline().strip()\nhalfstudents=students//2\nfor i in range(halfstudents):\n if seating[i]==\"L\":\n outFiles.write(str(i+1) + \" \" + str(i+halfstudents+1)+ \"\\n\")\n else:\n outFiles.write(str(i+halfstudents+1) + \" \" + str(i+1) + \"\\n\")\n\t\t \t \t \t\t\t \t\t \t\t \t\t \t\t\t\t\t", "inputFile=open(\"input.txt\",\"r\")\ntemp=inputFile.readlines()\nnew_content = [x[:-1] for x in temp]\ninputFile.close()\n\n\n\noutputFile=open(\"output.txt\",\"w\")\nn=new_content[0]\nhand=new_content[1]\ngroups=int(n)//2 #LLR LLL\nfor i in range(1,groups+1): #Because the index of the first person should be 1, not 0. range(a,b) doesn't inlude b, so it should be b+1.\n if hand[i-1]=='L': #i-1 is because we should start from index 0 to find 'L'.\n outputFile.write(str(i)+\" \")\n outputFile.write(str(i+groups)+ \"\\n\")\n #ptint(i,i + groups) #the person sit on the right should be i+groups.\n elif hand[i-1]=='R':\n outputFile.write(str(i+groups)+\" \")#print(i+groups, i)\n outputFile.write(str(i)+\"\\n\")\noutputFile.close()\n\n\n\n \t \t\t \t \t \t \t\t \t \t \t \t", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n \r\n# # TAKE INPUT\r\n# def get_ints_in_variables():\r\n# return map(int, sys.stdin.readline().strip().split())\r\n# def get_int(): return int(input())\r\n# def get_ints_in_list(): return list(\r\n# map(int, sys.stdin.readline().strip().split()))\r\n# def get_list_of_list(n): return [list(\r\n# map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\n# def get_string(): return sys.stdin.readline().strip()\r\n \r\ndef main():\r\n # Write Your Code Here\r\n sys.stdin=open('input.txt','r')\r\n sys.stdout=open('output.txt','w')\r\n\r\n n=int(input())\r\n alp=input()\r\n\r\n for i in range(n//2):\r\n a=alp[i]\r\n b=alp[i+n//2]\r\n if a == 'R' and b == 'L':\r\n print(i+n//2+1 , i+1)\r\n else:\r\n print(i+1,i+n//2+1)\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "with open(\"input.txt\") as fh:\n content = fh.readlines()\n s = list(content[1])\n n = len(s) // 2\noutput = open(\"output.txt\", \"w\")\nfor i in range(n):\n if s[i] == \"R\":\n print(str(i+1+n) + \" \" + str(i+1), file=output)\n else:\n print(str(i + 1) + \" \" + str(i + 1 + n), file=output)\n\t\t \t \t \t \t\t \t \t\t \t\t \t \t \t \t", "with open(\"input.txt\") as inp:\r\n n,stud=int(inp.readline().strip()),inp.readline().strip()\r\n l=\"\"\r\n for i in range(n//2):\r\n if stud[i]==\"R\" and stud[i+(n//2)]==\"L\":\r\n l+=f\"{i+(n//2)+1} {i+1}\\n\"\r\n else:\r\n l+=f\"{i+1} {i+(n//2)+1}\\n\"\r\nwith open(\"output.txt\",\"w\") as paste:\r\n paste.write(l)", "# -*- coding: utf-8 -*-\n\"\"\"Untitled75.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1D1x8mgVYBiLay890KzZPAq2TMoXX-k_G\n\"\"\"\n\nfile1 = open('input.txt', 'r')\nLines = file1.readlines()\nn=int(Lines[0])\nl1=list(Lines[1])\nl2=[]\nl3=[]\nfor x in range(1,n//2+1):\n l2.append(x)\nfor x in range(n//2+1,n+1):\n l3.append(x)\nfor x in range(0,n//2):\n if l1[l2[x]-1]==\"R\" and l1[l3[x]-1]==\"L\":\n c=l3[x]\n l3[x]=l2[x]\n l2[x]=c\nfile2 = open('output.txt', 'w')\nfor x in range(0,n//2):\n file2.writelines(str(l2[x])+\" \"+str(l3[x])+\"\\n\")\n print()\nfile2.close()", "n=int(0)\r\nl=[]\r\nfile=open('input.txt','r')\r\ni=int(1)\r\nwhile True:\r\n line=file.readline()\r\n if not line:\r\n break\r\n if i==1:\r\n n=int(line)\r\n i+=1\r\n else:\r\n for i in line:\r\n l.append(i)\r\nfile.close()\r\nans=[]\r\nfor i in range(n//2):\r\n if l[i]=='R':\r\n a=[int(n/2+i+1),int(i+1)]\r\n ans.append(a)\r\n else:\r\n ans.append([int(i+1),int(n/2+i+1)])\r\nfile=open('output.txt','a')\r\nfor i in ans:\r\n a=str(i[0])+\" \"+str(i[1])+\"\\n\"\r\n file.writelines(a)", "with open(\"input.txt\") as fh:\n n = int(fh.readline())\n hands = fh.readline()\nspace = n // 2\nstart = 1\noutfile = open(\"output.txt\", \"w\")\nwhile start <= space:\n left = str(start)\n right = str(start + space)\n if (hands[(start + space)-1] == \"L\") & (hands[start-1] == \"R\"):\n right = str(start)\n left = str(start + space)\n outfile.write(left + \" \" + right + \"\\n\")\n start += 1\noutfile.close()\n\t \t\t\t \t\t\t \t\t\t\t \t \t\t \t\t\t \t", "\r\ndata = open(\"input.txt\")\r\nn, students = data.readlines()\r\nstudents = list(students)\r\nn = int(n)\r\noutput = []\r\n\r\n\r\na = 0\r\nb = 0\r\nidx = 1\r\nfor i in range(0, n//2):\r\n left = i + 1\r\n right = i+n//2 + 1\r\n if students[left -1] == \"R\" and students[right-1] == \"L\":\r\n left, right = right, left\r\n output.append((left, right))\r\n\r\nresult = open(\"output.txt\", \"w\")\r\nfor ans in output:\r\n result.write(f\"{ans[0]} {ans[1]} \\n\")", "inputFile = open(\"input.txt\", \"r\")\noutputFile = open(\"output.txt\", \"w\")\n\ninputLines = inputFile.readlines()\n\nn = int(inputLines[0])\nseats = inputLines[1]\n\nposition = n//2\nfor x in range(1, position + 1):\n if seats[x-1] == \"L\":\n print(x, x + position, file = outputFile)\n if seats[x-1] == \"R\":\n print(x + position, x, file = outputFile)\n\ninputFile.close()\noutputFile.close()\n \t\t\t\t\t\t \t \t \t \t\t \t\t \t \t", "input = open(\"input.txt\",\"r\")\noutput = open(\"output.txt\",\"w\")\nn = int(input.readline())\nread = input.readline()\nfor i in range(n//2):\n if read[i] == \"R\":\n output.write(str(i+1+n//2)+\" \"+str(i+1)+\"\\n\")\n else :\n output.write(str(i+1)+\" \"+str(i+1+n//2)+\"\\n\")\n \t\t \t \t\t \t\t \t\t\t\t\t \t\t\t\t\t", "def is_even(n):\n return n % 2 == 0\n\n\ndef in_range(n):\n return 4 <= n <= 100\n\n\ndef is_left(letter):\n return letter == 'L'\n\n\ndef is_right(letter):\n return letter == 'R'\n\n\ninput_file = open('input.txt','r')\noutput_file = open('output.txt','w')\nlines = input_file.readlines()\nnumber_of_students = int(lines[0])\ncapital_letters = lines[1]\nif is_even(number_of_students) and in_range(number_of_students):\n middle = number_of_students // 2\n for i in range (middle):\n if is_right(capital_letters[i]) and is_left(capital_letters[middle + i]):\n output_file.write(f'{middle + i + 1} {i + 1}\\n')\n else:\n output_file.write(f'{i + 1} {middle + i + 1}\\n')\n \t \t\t\t \t\t\t\t \t \t \t\t \t\t\t \t", "a = open('input.txt').readlines()[1]\nb = len(a)//2\n\nfor i in range(b):\n print(*[i+1+b,i+1][::2*(a[i]>'L')-1], file=open('output.txt','a'))\n \t \t \t\t\t \t \t\t \t \t \t\t \t", "f = open('input.txt', 'r')\r\nn = int( f.readline())\r\ns = f.readline()\r\nf.close()\r\n\r\nf = open('output.txt','w')\r\ni = 1\r\nwhile i<=n/2:\r\n if s[i-1]=='R' and s[i+n//2-1]=='L':\r\n f.write(str(i+n//2) +' '+str(i)+'\\n')\r\n else:\r\n f.write(str(i) +' '+str(i+n//2)+'\\n')\r\n i+=1\r\nf.close()\r\n\r\n", "#read input file\ninputtemp=open('input.txt','r')\ntemp=inputtemp.readlines()\ninputtemp.close()\n\n\n#variables\nn=temp[0]\nn=(int(n))\nhands=temp[1]\nhands=list(hands)\norder=[]\n\n#create array of #s\nfor i in range(n):\n order.append(i+1)\n\n\n\nmid=int(n/2)\n\nlefties=order[0:mid]\nrighties=order[mid:n]\n\n\n#output \noutput=open('output.txt','w')\n\nfor i in range(1, mid+1):\n if hands[i-1] == \"L\":\n output.write(str(i)+\" \"+str(i+mid))\n if hands[i-1] == \"R\":\n output.write(str(i+mid)+\" \"+str(i))\n if(i<mid):\n output.write('\\n')\noutput.close()\n\t \t \t \t \t \t\t\t \t\t\t\t\t", "inp = open(\"input.txt\", \"r\")\nout = open(\"output.txt\", \"w\")\ninp_lines = inp.readlines()\nn = int(inp_lines[0])\nseat = inp_lines[1]\nkey = n // 2\nfor i in range(1, key + 1):\n if seat[i - 1] == \"L\":\n print(i, i + key, file=out)\n if seat[i - 1] == \"R\":\n print(i + key, i, file=out)\ninp.close()\nout.close()\n\t\t \t \t \t\t \t\t\t\t\t \t \t \t", "inp = open('input.txt', 'r')\nout = open('output.txt', 'w')\nn, s = int(inp.readline().strip()), inp.readline().strip()\nfor i in range(n//2):\n a, b = i, i + n // 2\n if s[a] == 'R'and s[b] == 'L':\n a, b = b, a\n out.write(str(a+1) + \" \" + str(b+1) + \"\\n\")\nout.close()\n\t \t\t\t \t \t\t\t\t \t \t \t \t \t\t \t\t\t", "# n = int(input())\n# s = input()\n\noutputfile = open(\"output.txt\", 'w')\n\nwith open(\"input.txt\", 'r') as f:\n n = int(f.readline())\n s = f.readline()\n\n for i in range(n // 2):\n # always L for left and R for right\n # always choose one from first half and one from second half\n if s[i] == 'L':\n outputfile.write(\"{0} {1}\\n\".format(i + 1, i + n // 2 + 1))\n else:\n outputfile.write(\"{0} {1}\\n\".format(i + n // 2 + 1, i + 1))\n\noutputfile.close()\n\t\t\t \t\t\t \t\t\t\t\t \t\t \t \t", "rf = open('input.txt')\nwf = open('output.txt', \"w\")\ns = rf.read()\n\nl = s.split(\"\\n\")\n\nn = int(l[0])\n\nret = []\nhanded = [c for c in l[1]]\nfor i in range(0,n):\n\tfor j in range(int(n/2), n):\n\t\tif i+1 == j or i==j:\n\t\t\tcontinue;\n\t\tif handed[i]=='0' or handed[j]=='0':\n\t\t\tcontinue;\n\t\tif handed[i]== 'L':\n\t\t\thanded[i]='0'\n\t\t\thanded[j]='0'\n\t\t\tret.append([i+1,j+1])\n\t\t\ts = str(i+1) + \" \" + str(j+1) + \"\\n\"\n\t\t\twf.write(s)\n\t\telse:\n\t\t\tif handed[j]== 'R':\n\t\t\t\thanded[i]='0'\n\t\t\t\thanded[j]='0'\n\t\t\t\tret.append([i+1,j+1])\n\t\t\t\ts = str(i+1) + \" \" + str(j+1) + \"\\n\"\n\t\t\t\twf.write(s)\n\t\t\telse:\n\t\t\t\thanded[i]= '0'\n\t\t\t\thanded[j]= '0'\n\t\t\t\tret.append([j+1,i+1])\n\t\t\t\ts = str(j+1) + \" \" + str(i+1) + \"\\n\"\n\t\t\t\twf.write(s)\n\nwf.close()\n\t\n \t\t\t \t\t\t \t\t \t\t\t \t\t \t \t\t \t", "with open(\"input.txt\",\"r\") as f:\r\n n = int(f.readline())\r\n students = f.readline()\r\nf = open(\"output.txt\", \"w\")\r\ni = 0\r\nwhile i<n//2:\r\n if students[i]==\"R\" and students[i+n//2]==\"L\":\r\n f.write(\"{} {}\\n\".format(i+n//2+1, i+1))\r\n else:\r\n f.write(\"{} {}\\n\".format(i+1, i+1+n//2))\r\n i+=1\r\nf.close()\r\n", "#https://www.guru99.com/python-file-readline.html#:~:text=The%20readline%20%28%29%20method%20helps%20to%20read%20just,can%20make%20use%20of%20Python%20readlines%20%28%29%20function.\niput = open('input.txt', 'r')\nouput = open('output.txt', 'w')\nn, c = int(iput.readline()), iput.readline() #n = total, c = chair#\nfor i in range(n//2):\n a, b = i, i + n // 2 #for instance 1, 1+ (6/2) = 1, 4\n if c[a] == 'R'and c[b] == 'L': #if Righty on left side / lefty on right\n a, b = b, a #switch\n ouput.write(str(a+1) + \" \" + str(b+1) + \"\\n\") #(a+1 because starts at 0)\nouput.close()\n \t\t\t \t\t\t \t \t\t \t \t \t \t \t\t\t", "fin = open('input.txt','r')\nfout = open('output.txt', 'w')\nn = int(fin.readline().strip())\nk = fin.readline().strip()\n# print(n)\n# print(k)\nfor i in range(n//2):\n left = i\n right = i + n//2\n if k[left] == 'R' and k[right] == 'L':\n left, right = right, left\n # print(left, right)\n output = str(left+1) +' '+ str(right+1) +'\\n'\n fout.write(str(output))\nfin.close()\nfout.close()\n\t\t \t \t \t\t \t\t \t \t\t \t\t\t\t\t\t \t", "r=open(\"input.txt\",\"r\")\nw=open(\"output.txt\",\"w\")\nn=int(r.readline())\ns=r.readline().strip()\n \nfor i in range(n//2):\n if(s[i]==s[i+n//2]):\n w.write(str(i+1)+\" \"+str(n//2+i+1)+\"\\n\")\n else:\n if(s[i]==\"R\"):\n w.write(str(n//2+i+1)+\" \"+str(i+1)+\"\\n\")\n else:\n w.write(str(i+1)+\" \"+str(n//2+i+1)+\"\\n\")\n \t \t\t \t\t \t\t \t \t \t\t", "with open('input.txt', 'r') as rf:\n n = int(rf.readline())\n hand = str(rf.readline())\npairs = [[0, 0] for i in range(int(n/2))]\nfor i in range(int(n/2)):\n pairs[i][0] = i+1\n pairs[i][1] = i+1 + int(n/2)\n if hand[i] != hand[i + int(n/2)] and hand[i] == 'R':\n (pairs[i][0], pairs[i][1]) = (pairs[i][1], pairs[i][0])\nwith open('output.txt', 'w') as wf:\n for i in range(len(pairs)):\n for j in range(2):\n pairs[i][j] = str(pairs[i][j])\n wf.write(\" \" + pairs[i][j])\n wf.write(\"\\n\")\n\t \t \t \t \t \t\t\t \t\t \t\t \t\t \t", "with open(\"input.txt\", 'r') as f:\r\n n = int(f.readline())\r\n s = f.readline()\r\n outputfile = open(\"output.txt\", 'w')\r\n for i in range(int(n / 2)):\r\n if s[i] == 'L':\r\n outputfile.write(f\"{i + 1} {int(n / 2 + i + 1)}\\n\")\r\n else:\r\n outputfile.write(f\"{int(n / 2 + i + 1)} {i + 1}\\n\")", "w=open(\"input.txt\",\"r\")\ng=open(\"output.txt\",\"w\")\nn=int(w.readline())\ns=w.readline()\nfor i in range(n//2):\n if s[i]=='R':\n g.write(str(i+1+n//2)+\" \"+str(i+1)+\"\\n\")\n else :\n g.write(str(i+1)+\" \"+str(i+1+n//2)+\"\\n\")\n \n \t\t\t\t \t\t\t \t \t \t \t \t \t \t\t", "def find_seating_arrangement():\r\n\twith open(\"input.txt\", \"r\") as f_input:\r\n\t\tstudents = int(f_input.readline())\r\n\t\tstudent_details = f_input.readline()\r\n\r\n\teven_number_students = [(index+1, student_details[index])\r\n\t\t\t\t\t\t\tfor index in range(0, students, 2)]\r\n\todd_number_students = [(index+1, student_details[index])\r\n\t\t\t\t\t\tfor index in range(1, students, 2)]\r\n\r\n\tmixed_students = even_number_students + odd_number_students\r\n\r\n\twith open(\"output.txt\", \"w\") as f_output:\r\n\t\tfor index in range(0, students, 2):\r\n\t\t\tif mixed_students[index][1] == \"R\" and mixed_students[index+1][1] == \"L\":\r\n\t\t\t\tf_output.write(\"{} {}\\n\".format(mixed_students[index+1][0], mixed_students[index][0]))\r\n\t\t\telse:\r\n\t\t\t\tf_output.write(\"{} {}\\n\".format(mixed_students[index][0], mixed_students[index+1][0]))\r\n\r\n\r\nfind_seating_arrangement()\r\n", "import math\r\n\r\n\r\ndef main_function():\r\n with open(\"input.txt\", \"r\") as file:\r\n n = int(file.readline())\r\n hand = list(file.readline())\r\n print(n)\r\n print(hand)\r\n collector = []\r\n for i in range(0, len(hand) // 2):\r\n a = hand[i]\r\n b = hand[i + len(hand) // 2]\r\n if a == \"R\" and b == \"L\":\r\n collector.append([i + 1 + len(hand) // 2, i + 1])\r\n else:\r\n collector.append([i + 1, i + 1 + len(hand) // 2])\r\n print(collector)\r\n with open(\"output.txt\", \"w\") as file:\r\n for i in collector:\r\n file.write(f\"{i[0]} {i[1]}\\n\")\r\n return file\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "f = open(\"input.txt\",\"r\")\nsOne = f.readline()\nsTwo = f.readline()\nn = int(sOne)//2\nfor i in range(n):\n if sTwo[i] == \"L\":\n print(*(i+1,i+n+1), file = open(\"output.txt\",\"a\"))\n else:\n print(*(i+n+1,i+1), file = open(\"output.txt\",\"a\"))\nf.close()\n \t \t \t \t\t\t \t\t \t\t \t \t\t \t", "input_txt= open(\"input.txt\", \"r\")\nkids = int(input_txt.readline())\nseats = input_txt.readline()\noutput_txt = open(\"output.txt\", \"w\")\nfor i in range(kids//2):\n if seats[i] ==\"L\":\n output_txt.write(str(i+1) +\" \"+str(i+1+kids//2)+\"\\n\")\n else:\n output_txt.write(str(i+1 +kids//2) + \" \" + str(i+1)+\"\\n\")\n\n\n\t\t\t \t\t \t\t\t \t \t \t", "with open('input.txt', 'r') as a:\n def changetolist(string):\n c = []\n c[:0] = string\n return c[0:-1]\n\n\n e = 0\n k = 0\n n = 0\n function = 0\n b = a.readlines()[1]\n d = changetolist(b)\nf = open('output.txt', 'w')\nwhile function % 2 == 0 and n < len(d) // 2:\n while function % 2 == 0:\n for i in d:\n if i == \"L\":\n e += 1\n if e >= 1:\n function += 1\n break\n elif i == \"R\":\n e += 1\n if e >= 1:\n function += 1\n break\n while function % 2 != 0:\n for count, element in enumerate(d[len(d)//2 + n:], len(d) // 2 + n + 1):\n if element == \"L\":\n f.write(str(count) + \" \" + str(e) + \"\\n\")\n function += 1\n n += 1\n break\n elif element == \"R\":\n f.write(str(e) + \" \" + str(count) + \"\\n\")\n function += 1\n n += 1\n break\nf.close()\n\n\t\t\t\t\t\t\t \t\t\t\t\t \t \t\t\t\t\t\t", "def solve():\r\n with open(\"input.txt\", 'r') as f:\r\n n = int(f.readline())\r\n s = f.readline()\r\n outputfile = open(\"output.txt\", 'w')\r\n for i in range(int(n/2)):\r\n if s[i]=='L':\r\n outputfile.write(f\"{i+1} {int(n/2+i+1)}\\n\")\r\n else:\r\n outputfile.write(f\"{int(n/2+i+1)} {i+1}\\n\")\r\n \r\n\r\ndef init():\r\n T=1\r\n # T=int(input())\r\n while T:\r\n solve()\r\n # print(solve())\r\n T -=1\r\ninit()\r\n", "def solve() :\n s=''\n for i in range(n//2):\n if st[i]=='R' and st[n//2+i]=='L':\n s+=f'{n//2+i+1} {i+1}\\n'\n else:\n s+=f'{i+1} {n//2+i+1}\\n'\n s.strip()\n with open('output.txt','w') as f :\n f.write(s)\n return\n\n \n\n \n\n\n\n \nfrom sys import stdin\ninput = stdin.readline \n \n \nwith open('input.txt','r') as f :\n args=f.readlines()\nn=int(args[0])\nst=args[1].strip()\nprint(solve())\n\n\n\n'''\n\nt=int(input())\nfor i in range(t) :\n print(solve())\n\n\nn=int(input())\n\nx=input().strip()\n\n\nn,m= [int(x) for x in input().split()]\n\n\n\n\nn=int(input())\narr=[int(x) for x in input().split()]\n\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([x for x in input().strip()])\n\n\nn=int(input())\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\n\n'''", "with open(\"input.txt\", \"r\") as g:\n num = int(g.readline())\n hands = g.readline()\nwith open(\"output.txt\", \"w\") as h:\n for i in range(num//2):\n if hands[i] == \"L\":\n h.write(str(i + 1) + \" \" + str(i + 1 + num // 2) + \"\\n\")\n elif hands[i] == \"R\":\n h.write(str(i + 1 + num // 2) + \" \" + str(i + 1) + \"\\n\")\n \t \t \t\t\t \t \t\t \t\t\t\t\t \t\t \t \t\t \t", "inp = open(\"input.txt\",\"r\")\nout = open(\"output.txt\",\"w\")\nn = int(inp.readline())\nhand = inp.readline()\nfor i in range(n//2):\n if hand[i] == \"R\":\n out.write(str(i+1+n//2)+\" \"+str(i+1)+\"\\n\")\n else :\n out.write(str(i+1)+\" \"+str(i+1+n//2)+\"\\n\")\n\t\t \t\t \t \t\t \t\t \t \t \t", "s=open('input.txt').readlines()[1];n=len(s)//2\r\nfor i in range(n):print(*[i+1+n,i+1][::2*(s[i]>'L')-1],file=open('output.txt','a'))", "import sys\r\n\r\nsys.stdin=open('input.txt','r')\r\nsys.stdout=open('output.txt','w')\r\n\r\nn = int(input())\r\nf = input()\r\ns = n//2\r\nfor i in range(s):\r\n st1 = str(i+1)\r\n nd2 = str(i+1 + s)\r\n i1 = f[i]\r\n iS = f[i + s]\r\n if i1 == iS:\r\n print(st1 + ' ' + nd2)\r\n elif i1 != iS and f[i] == 'L':\r\n print(st1 + ' ' + nd2)\r\n else:\r\n print(nd2 + ' ' + st1)", "with open('input.txt', 'r') as f:\n n = int(f.readline())\n s = f.readline()\nwith open('output.txt', 'w') as g:\n\n for i in range(n // 2):\n if s[i] == 'L':\n g.write(str(i + 1) + ' ' + str(i + n // 2 + 1) + \"\\n\")\n else:\n g.write(str(i + n // 2 + 1) + ' ' + str(i + 1) + \"\\n\")\n \t \t \t\t\t\t\t \t\t \t \t\t", "import sys\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\n\r\nn=int(input())\r\na=list(input())\r\n\r\nfor i in range(n//2):\r\n if a[i]==\"L\":\r\n print(i+1,i+1+n//2)\r\n else:\r\n print(i+1+n//2,i+1)", "#A-1-1(fernando)\n#got help from fernando at MSI\nwith open(\"input.txt\", \"r\") as fh:\n a = fh.read().split()\n print(a)\n n = int(a[0])\n stu = a[1]\n stu = [i for i in stu]\n print(stu)\n\n pos = int(n//2)\n\nwith open(\"output.txt\", \"w\") as g:\n for i in range(1,pos + 1):\n if stu[i-1] == 'L':#is left handed\n #print(i,i + pos)\n x = (i,i + pos)\n g.write(str(x[0])+ \" \" +str(x[1])+\"\\n\")\n elif stu[i-1] == 'R':#is right handed\n #print(i+pos,i)\n x = i+pos,i\n g.write(str(x[0]) + \" \" +str(x[1])+ \"\\n\")\n\n \t\t\t \t \t\t\t\t\t \t \t\t\t \t \t\t" ]

{"inputs": ["6\nLLRLLL", "4\nRRLL", "4\nLLRR", "6\nRLLRRL", "8\nLRLRLLLR", "10\nRLLRLRRRLL", "12\nLRRRRRLRRRRL", "14\nRLLRLLLLRLLLRL", "16\nLLLRRRLRRLLRRLLL", "18\nRRRLLLLRRRLRLRLLRL", "20\nRLRLLRLRRLLRRRRRRLRL", "22\nRLLLRLLLRRLRRRLRLLLLLL", "24\nLRRRLRLLRLRRRRLLLLRRLRLR", "26\nRLRRLLRRLLRLRRLLRLLRRLRLRR", "28\nLLLRRRRRLRRLRRRLRLRLRRLRLRRL", "30\nLRLLRLRRLLRLRLLRRRRRLRLRLRLLLL", "32\nRLRLLRRLLRRLRLLRLRLRLLRLRRRLLRRR", "34\nLRRLRLRLLRRRRLLRLRRLRRLRLRRLRRRLLR", "36\nRRLLLRRRLLLRRLLLRRLLRLLRLRLLRLRLRLLL", "38\nLLRRRLLRRRLRRLRLRRLRRLRLRLLRRRRLLLLRLL", "40\nLRRRRRLRLLRRRLLRRLRLLRLRRLRRLLLRRLRRRLLL", "42\nRLRRLLLLLLLRRRLRLLLRRRLRLLLRLRLRLLLRLRLRRR", "44\nLLLLRRLLRRLLRRLRLLRRRLRLRLLRLRLRRLLRLRRLLLRR", "46\nRRRLLLLRRLRLRRRRRLRLLRLRRLRLLLLLLLLRRLRLRLRLLL", "48\nLLLLRRLRRRRLRRRLRLLLLLRRLLRLLRLLRRLRRLLRLRLRRRRL", "50\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "52\nLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL", "54\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "56\nLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL", "58\nRRRLLLRLLLLRRLRRRLLRLLRLRLLRLRRRRLLLLLLRLRRLRLRRRLRLRRLRRL", "60\nRLLLLRRLLRRRLLLLRRRRRLRRRLRRRLLLRLLLRLRRRLRLLLRLLRRLLRRRRRLL", "62\nLRRLRLRLLLLRRLLLLRRRLRLLLLRRRLLLLLLRRRLLLLRRLRRLRLLLLLLLLRRLRR", "64\nRLLLLRRRLRLLRRRRLRLLLRRRLLLRRRLLRLLRLRLRRRLLRRRRLRLRRRLLLLRRLLLL", "66\nLLRRRLLRLRLLRRRRRRRLLLLRRLLLLLLRLLLRLLLLLLRRRLRRLLRRRRRLRLLRLLLLRR", "68\nRRLRLRLLRLRLRRRRRRLRRRLLLLRLLRLRLRLRRRRLRLRLLRRRRLRRLLRLRRLLRLRRLRRL", "70\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "72\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "74\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "76\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "78\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "80\nLRLRRRRLRRRRLLLLRLLRLRLLRRLRLLLRRLLLLRLLLRLRLLRRRLRRRLRLRRRRRLRLLRLLRRLLLRLRRRLL", "82\nRLRRLLRLRLRLLLRLLLRRLLRRLRRRRLLRLLLLRRRRRLLLRRRLLLLRLRRLRRRLRLLLLRRRLRLRLLLRLLLLLR", "84\nLRLRRRRRRLLLRLRLLLLLRRLRLRLRRRLLRLLLRLRLLLRRRLRLRRLRLRLLLLLLLLRRRRRRLLLRRLRLRLLLRLRR", "86\nRRRLLLRLLRLLRLRLRLLLRLRLRRLLRLLLRLLLLLLRRRLRLLRLLLRRRLRLLLLRLLRLRRLLRLLLRRRLLRLRLLRLLR", "88\nLLRLRLRLLLLRRRRRRLRRLLLLLRRLRRLLLLLRLRLRLLLLLRLRLRRLRLRRLRLLRRLRLLLRLLLLRRLLRRLRLRLRRLRR", "90\nLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL", "92\nLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL", "94\nLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL", "96\nLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL", "98\nLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL", "100\nRLRRRRLLLLRRRRLRRRRRRRRLRLRRLLRRRRRRRRLRRRRLLLLRRRRLRRLRLRRRLLRRLRRLLLRLRRLLLLLLRLRLRLRRLRLRLRRRLLLR", "100\nLRLLLLRLLLLRRRRRLRRRRLRRLRRLRLLRRLRRRRLLRRRLLLRLLLRRRRLLRLRLRRLRLLRRLLRRLRRLRRRRRLRRLRLRLRLLLLLLLLRL", "100\nLLLRRLLRLRLLLRLLLRLRLLRRRLRRLLLRLRLRRLLRLRRRLLLRRLLRLLRRLLRRRRRLRLRRLRLRRLRLRRLLRLRLLRLLLRLLRLLLLRLL", "100\nRLLLLRRLLLLRRRRLLRLRRRLLLRLLRLLLLLRRLLLLLLRRLRRRRRLRLLRLRRRLLLRLRLRLLLRRRLLLLLRRRRRLRRLLLLRLLLRRLLLL", "100\nRLRRLRLRRLRLLRLLRRRLRRLLLLLRLRLRRRRRRRLLRRRLLRLRLLLRRRLLRRRLLRLRLLLLRRLRLLRLLRLLLLRRLRLRRLRLLLLRLRRR", "100\nLRRLRLRRRRRRLRRLRRLLLLLLRRLLRRLLRLLLLLLRRRLLRLRRRLLRLLRRLRRRLLRLRLLRRLRRRLLLRRRRLLRRRLLLRRRRRLLLLLLR", "100\nRRLRRLRLRLRRRRLLRRLLRLRRLLRRRLLRLRRLRLRRLLLRRLLRRRRRRLLLRRRLLRRLLLLLLRLLLLLLRLLLRRRLRLLRRRRRLLRLLRRR", "100\nRRLLLRLRRLRLLRRLRRRLLRRRLRRLLLLLLLLLRRRLLRLRRLRRLRRLRRLRLLLLRLLRRRLLLLRLRRRLLRRRRLRRLLRRRRLRRRLRLLLR", "100\nLLLLLRRLRRRRRRRLLRRRRRLRRLRLRLLRLRRLLLRRRRLLRRLRLLRLLLRLRLLRRRRRRRRRLRLLLRLRLLLLLRLRRRRLRLLRLRLRLRRL", "100\nLLRRRLLLRLLLLRLRLRLRRRLLLRRRLRLLRLLLRRRRRLRRLRRLRRRLRRLRRLLLRLRLLRRRRLRLRRRRRLRRLRLLRRRRLLLRRRRRLLLL"], "outputs": ["1 4\n2 5\n6 3", "3 1\n4 2", "1 3\n2 4", "1 4\n2 5\n3 6", "1 5\n6 2\n3 7\n4 8", "1 6\n2 7\n3 8\n9 4\n5 10", "1 7\n2 8\n3 9\n4 10\n5 11\n12 6", "8 1\n2 9\n3 10\n11 4\n5 12\n6 13\n7 14", "1 9\n2 10\n3 11\n4 12\n5 13\n14 6\n7 15\n16 8", "1 10\n11 2\n3 12\n4 13\n5 14\n6 15\n7 16\n8 17\n18 9", "11 1\n2 12\n3 13\n4 14\n5 15\n6 16\n7 17\n18 8\n9 19\n10 20", "1 12\n2 13\n3 14\n4 15\n5 16\n6 17\n7 18\n8 19\n20 9\n21 10\n11 22", "1 13\n2 14\n15 3\n16 4\n5 17\n18 6\n7 19\n8 20\n21 9\n10 22\n23 11\n12 24", "1 14\n2 15\n16 3\n4 17\n5 18\n6 19\n7 20\n8 21\n9 22\n10 23\n24 11\n12 25\n13 26", "1 15\n2 16\n3 17\n18 4\n5 19\n20 6\n7 21\n8 22\n9 23\n10 24\n25 11\n12 26\n13 27\n28 14", "1 16\n2 17\n3 18\n4 19\n5 20\n6 21\n7 22\n23 8\n9 24\n10 25\n11 26\n12 27\n28 13\n14 29\n15 30", "17 1\n2 18\n19 3\n4 20\n5 21\n22 6\n7 23\n8 24\n9 25\n10 26\n11 27\n12 28\n29 13\n14 30\n15 31\n16 32", "1 18\n2 19\n20 3\n4 21\n5 22\n6 23\n7 24\n8 25\n9 26\n10 27\n28 11\n12 29\n13 30\n14 31\n15 32\n33 16\n17 34", "19 1\n20 2\n3 21\n4 22\n5 23\n6 24\n25 7\n8 26\n9 27\n10 28\n11 29\n30 12\n13 31\n14 32\n15 33\n16 34\n35 17\n36 18", "1 20\n2 21\n22 3\n4 23\n24 5\n6 25\n7 26\n27 8\n9 28\n10 29\n11 30\n12 31\n32 13\n14 33\n34 15\n16 35\n17 36\n37 18\n19 38", "1 21\n2 22\n23 3\n4 24\n5 25\n26 6\n7 27\n8 28\n9 29\n10 30\n31 11\n12 32\n13 33\n14 34\n15 35\n16 36\n17 37\n18 38\n39 19\n20 40", "1 22\n2 23\n3 24\n25 4\n5 26\n6 27\n7 28\n8 29\n9 30\n10 31\n11 32\n33 12\n34 13\n35 14\n15 36\n37 16\n17 38\n18 39\n19 40\n20 41\n21 42", "1 23\n2 24\n3 25\n4 26\n27 5\n6 28\n7 29\n8 30\n31 9\n10 32\n11 33\n12 34\n35 13\n14 36\n15 37\n16 38\n17 39\n18 40\n41 19\n42 20\n21 43\n22 44", "1 24\n2 25\n26 3\n4 27\n5 28\n6 29\n7 30\n31 8\n32 9\n10 33\n34 11\n12 35\n13 36\n14 37\n38 15\n16 39\n40 17\n18 41\n42 19\n20 43\n21 44\n45 22\n23 46", "1 25\n2 26\n3 27\n4 28\n29 5\n6 30\n7 31\n32 8\n9 33\n10 34\n35 11\n12 36\n13 37\n38 14\n39 15\n16 40\n41 17\n18 42\n19 43\n20 44\n21 45\n22 46\n23 47\n48 24", "1 26\n2 27\n3 28\n4 29\n5 30\n6 31\n7 32\n8 33\n9 34\n10 35\n11 36\n12 37\n13 38\n14 39\n15 40\n16 41\n17 42\n18 43\n19 44\n20 45\n21 46\n22 47\n23 48\n24 49\n25 50", "1 27\n2 28\n3 29\n4 30\n5 31\n6 32\n7 33\n8 34\n9 35\n10 36\n11 37\n12 38\n13 39\n14 40\n15 41\n16 42\n17 43\n18 44\n19 45\n20 46\n21 47\n22 48\n23 49\n24 50\n25 51\n26 52", "1 28\n2 29\n3 30\n4 31\n5 32\n6 33\n7 34\n8 35\n9 36\n10 37\n11 38\n12 39\n13 40\n14 41\n15 42\n16 43\n17 44\n18 45\n19 46\n20 47\n21 48\n22 49\n23 50\n24 51\n25 52\n26 53\n27 54", "1 29\n2 30\n3 31\n4 32\n5 33\n6 34\n7 35\n8 36\n9 37\n10 38\n11 39\n12 40\n13 41\n14 42\n15 43\n16 44\n17 45\n18 46\n19 47\n20 48\n21 49\n22 50\n23 51\n24 52\n25 53\n26 54\n27 55\n28 56", "1 30\n2 31\n3 32\n4 33\n5 34\n6 35\n36 7\n8 37\n9 38\n10 39\n11 40\n41 12\n13 42\n14 43\n44 15\n16 45\n46 17\n18 47\n19 48\n20 49\n21 50\n22 51\n52 23\n24 53\n25 54\n26 55\n27 56\n28 57\n29 58", "31 1\n2 32\n3 33\n4 34\n5 35\n36 6\n7 37\n8 38\n9 39\n10 40\n11 41\n42 12\n13 43\n14 44\n15 45\n16 46\n17 47\n48 18\n49 19\n20 50\n21 51\n22 52\n53 23\n24 54\n25 55\n26 56\n27 57\n28 58\n59 29\n30 60", "1 32\n33 2\n34 3\n4 35\n5 36\n6 37\n7 38\n8 39\n9 40\n10 41\n11 42\n12 43\n13 44\n14 45\n15 46\n16 47\n17 48\n18 49\n50 19\n51 20\n21 52\n53 22\n23 54\n24 55\n25 56\n26 57\n27 58\n28 59\n60 29\n30 61\n31 62", "1 33\n2 34\n3 35\n4 36\n5 37\n6 38\n39 7\n8 40\n9 41\n10 42\n11 43\n12 44\n13 45\n14 46\n15 47\n16 48\n17 49\n18 50\n19 51\n20 52\n21 53\n22 54\n55 23\n56 24\n25 57\n26 58\n27 59\n28 60\n61 29\n62 30\n31 63\n32 64", "1 34\n2 35\n3 36\n37 4\n38 5\n6 39\n7 40\n41 8\n9 42\n10 43\n11 44\n12 45\n46 13\n14 47\n15 48\n49 16\n50 17\n18 51\n19 52\n20 53\n21 54\n22 55\n23 56\n24 57\n58 25\n26 59\n27 60\n28 61\n29 62\n30 63\n31 64\n32 65\n33 66", "35 1\n2 36\n3 37\n4 38\n5 39\n40 6\n7 41\n8 42\n9 43\n10 44\n45 11\n12 46\n13 47\n14 48\n15 49\n50 16\n17 51\n18 52\n19 53\n54 20\n21 55\n56 22\n23 57\n24 58\n25 59\n26 60\n27 61\n28 62\n29 63\n30 64\n31 65\n32 66\n33 67\n68 34", "1 36\n2 37\n3 38\n4 39\n5 40\n6 41\n7 42\n8 43\n9 44\n10 45\n11 46\n12 47\n13 48\n14 49\n15 50\n16 51\n17 52\n18 53\n19 54\n20 55\n21 56\n22 57\n23 58\n24 59\n25 60\n26 61\n27 62\n28 63\n29 64\n30 65\n31 66\n32 67\n33 68\n34 69\n35 70", "1 37\n2 38\n3 39\n4 40\n5 41\n6 42\n7 43\n8 44\n9 45\n10 46\n11 47\n12 48\n13 49\n14 50\n15 51\n16 52\n17 53\n18 54\n19 55\n20 56\n21 57\n22 58\n23 59\n24 60\n25 61\n26 62\n27 63\n28 64\n29 65\n30 66\n31 67\n32 68\n33 69\n34 70\n35 71\n36 72", "1 38\n2 39\n3 40\n4 41\n5 42\n6 43\n7 44\n8 45\n9 46\n10 47\n11 48\n12 49\n13 50\n14 51\n15 52\n16 53\n17 54\n18 55\n19 56\n20 57\n21 58\n22 59\n23 60\n24 61\n25 62\n26 63\n27 64\n28 65\n29 66\n30 67\n31 68\n32 69\n33 70\n34 71\n35 72\n36 73\n37 74", "1 39\n2 40\n3 41\n4 42\n5 43\n6 44\n7 45\n8 46\n9 47\n10 48\n11 49\n12 50\n13 51\n14 52\n15 53\n16 54\n17 55\n18 56\n19 57\n20 58\n21 59\n22 60\n23 61\n24 62\n25 63\n26 64\n27 65\n28 66\n29 67\n30 68\n31 69\n32 70\n33 71\n34 72\n35 73\n36 74\n37 75\n38 76", "1 40\n2 41\n3 42\n4 43\n5 44\n6 45\n7 46\n8 47\n9 48\n10 49\n11 50\n12 51\n13 52\n14 53\n15 54\n16 55\n17 56\n18 57\n19 58\n20 59\n21 60\n22 61\n23 62\n24 63\n25 64\n26 65\n27 66\n28 67\n29 68\n30 69\n31 70\n32 71\n33 72\n34 73\n35 74\n36 75\n37 76\n38 77\n39 78", "1 41\n2 42\n3 43\n4 44\n45 5\n46 6\n7 47\n8 48\n9 49\n50 10\n11 51\n12 52\n13 53\n14 54\n15 55\n16 56\n17 57\n18 58\n19 59\n20 60\n21 61\n62 22\n23 63\n24 64\n65 25\n26 66\n27 67\n68 28\n29 69\n30 70\n31 71\n72 32\n73 33\n34 74\n35 75\n36 76\n37 77\n38 78\n39 79\n40 80", "42 1\n2 43\n44 3\n4 45\n5 46\n6 47\n48 7\n8 49\n50 9\n10 51\n11 52\n12 53\n13 54\n14 55\n56 15\n16 57\n17 58\n18 59\n60 19\n20 61\n21 62\n22 63\n64 23\n65 24\n25 66\n26 67\n27 68\n69 28\n29 70\n30 71\n31 72\n73 32\n33 74\n34 75\n35 76\n36 77\n78 37\n79 38\n80 39\n81 40\n41 82", "1 43\n2 44\n3 45\n46 4\n5 47\n48 6\n7 49\n8 50\n51 9\n10 52\n11 53\n12 54\n55 13\n14 56\n57 15\n16 58\n17 59\n18 60\n19 61\n20 62\n21 63\n22 64\n23 65\n24 66\n25 67\n26 68\n27 69\n70 28\n71 29\n30 72\n31 73\n32 74\n33 75\n34 76\n35 77\n36 78\n79 37\n38 80\n39 81\n40 82\n41 83\n42 84", "1 44\n45 2\n46 3\n4 47\n5 48\n6 49\n50 7\n8 51\n9 52\n10 53\n11 54\n12 55\n56 13\n14 57\n58 15\n16 59\n17 60\n18 61\n19 62\n20 63\n64 21\n22 65\n23 66\n24 67\n68 25\n26 69\n27 70\n28 71\n72 29\n30 73\n31 74\n32 75\n76 33\n34 77\n35 78\n36 79\n37 80\n38 81\n39 82\n40 83\n84 41\n85 42\n43 86", "1 45\n2 46\n47 3\n4 48\n49 5\n6 50\n7 51\n8 52\n9 53\n10 54\n11 55\n12 56\n57 13\n14 58\n59 15\n60 16\n17 61\n18 62\n63 19\n20 64\n21 65\n22 66\n23 67\n24 68\n25 69\n70 26\n71 27\n28 72\n29 73\n30 74\n31 75\n32 76\n33 77\n34 78\n35 79\n36 80\n37 81\n38 82\n39 83\n40 84\n41 85\n42 86\n43 87\n44 88", "1 46\n2 47\n3 48\n4 49\n5 50\n6 51\n7 52\n8 53\n9 54\n10 55\n11 56\n12 57\n13 58\n14 59\n15 60\n16 61\n17 62\n18 63\n19 64\n20 65\n21 66\n22 67\n23 68\n24 69\n25 70\n26 71\n27 72\n28 73\n29 74\n30 75\n31 76\n32 77\n33 78\n34 79\n35 80\n36 81\n37 82\n38 83\n39 84\n40 85\n41 86\n42 87\n43 88\n44 89\n45 90", "1 47\n2 48\n3 49\n4 50\n5 51\n6 52\n7 53\n8 54\n9 55\n10 56\n11 57\n12 58\n13 59\n14 60\n15 61\n16 62\n17 63\n18 64\n19 65\n20 66\n21 67\n22 68\n23 69\n24 70\n25 71\n26 72\n27 73\n28 74\n29 75\n30 76\n31 77\n32 78\n33 79\n34 80\n35 81\n36 82\n37 83\n38 84\n39 85\n40 86\n41 87\n42 88\n43 89\n44 90\n45 91\n46 92", "1 48\n2 49\n3 50\n4 51\n5 52\n6 53\n7 54\n8 55\n9 56\n10 57\n11 58\n12 59\n13 60\n14 61\n15 62\n16 63\n17 64\n18 65\n19 66\n20 67\n21 68\n22 69\n23 70\n24 71\n25 72\n26 73\n27 74\n28 75\n29 76\n30 77\n31 78\n32 79\n33 80\n34 81\n35 82\n36 83\n37 84\n38 85\n39 86\n40 87\n41 88\n42 89\n43 90\n44 91\n45 92\n46 93\n47 94", "1 49\n2 50\n3 51\n4 52\n5 53\n6 54\n7 55\n8 56\n9 57\n10 58\n11 59\n12 60\n13 61\n14 62\n15 63\n16 64\n17 65\n18 66\n19 67\n20 68\n21 69\n22 70\n23 71\n24 72\n25 73\n26 74\n27 75\n28 76\n29 77\n30 78\n31 79\n32 80\n33 81\n34 82\n35 83\n36 84\n37 85\n38 86\n39 87\n40 88\n41 89\n42 90\n43 91\n44 92\n45 93\n46 94\n47 95\n48 96", "1 50\n2 51\n3 52\n4 53\n5 54\n6 55\n7 56\n8 57\n9 58\n10 59\n11 60\n12 61\n13 62\n14 63\n15 64\n16 65\n17 66\n18 67\n19 68\n20 69\n21 70\n22 71\n23 72\n24 73\n25 74\n26 75\n27 76\n28 77\n29 78\n30 79\n31 80\n32 81\n33 82\n34 83\n35 84\n36 85\n37 86\n38 87\n39 88\n40 89\n41 90\n42 91\n43 92\n44 93\n45 94\n46 95\n47 96\n48 97\n49 98", "1 51\n2 52\n3 53\n4 54\n55 5\n6 56\n7 57\n8 58\n9 59\n10 60\n61 11\n62 12\n13 63\n14 64\n15 65\n16 66\n17 67\n68 18\n69 19\n70 20\n21 71\n72 22\n23 73\n24 74\n75 25\n26 76\n77 27\n78 28\n29 79\n30 80\n31 81\n82 32\n33 83\n84 34\n35 85\n86 36\n37 87\n38 88\n39 89\n40 90\n91 41\n42 92\n93 43\n44 94\n45 95\n46 96\n47 97\n98 48\n99 49\n50 100", "1 51\n2 52\n3 53\n4 54\n5 55\n6 56\n7 57\n8 58\n9 59\n10 60\n11 61\n12 62\n63 13\n14 64\n65 15\n66 16\n17 67\n18 68\n69 19\n70 20\n21 71\n22 72\n73 23\n24 74\n25 75\n76 26\n27 77\n28 78\n29 79\n30 80\n31 81\n82 32\n33 83\n34 84\n85 35\n36 86\n87 37\n38 88\n39 89\n40 90\n91 41\n92 42\n93 43\n44 94\n45 95\n46 96\n97 47\n48 98\n49 99\n50 100", "1 51\n2 52\n3 53\n54 4\n5 55\n6 56\n7 57\n58 8\n9 59\n10 60\n11 61\n12 62\n13 63\n64 14\n15 65\n16 66\n17 67\n18 68\n19 69\n20 70\n21 71\n22 72\n23 73\n74 24\n25 75\n26 76\n27 77\n28 78\n29 79\n30 80\n31 81\n82 32\n33 83\n84 34\n35 85\n36 86\n87 37\n38 88\n39 89\n40 90\n41 91\n92 42\n43 93\n94 44\n45 95\n46 96\n47 97\n48 98\n99 49\n50 100", "51 1\n2 52\n3 53\n4 54\n5 55\n56 6\n7 57\n8 58\n9 59\n10 60\n11 61\n62 12\n13 63\n64 14\n15 65\n16 66\n17 67\n68 18\n19 69\n70 20\n21 71\n22 72\n23 73\n24 74\n25 75\n76 26\n27 77\n28 78\n29 79\n30 80\n31 81\n32 82\n33 83\n34 84\n35 85\n36 86\n37 87\n38 88\n39 89\n40 90\n41 91\n42 92\n93 43\n94 44\n45 95\n46 96\n97 47\n98 48\n99 49\n100 50", "51 1\n2 52\n3 53\n4 54\n5 55\n56 6\n7 57\n8 58\n9 59\n10 60\n61 11\n12 62\n13 63\n14 64\n15 65\n16 66\n67 17\n68 18\n19 69\n20 70\n71 21\n22 72\n23 73\n24 74\n25 75\n26 76\n27 77\n28 78\n29 79\n80 30\n31 81\n82 32\n33 83\n34 84\n85 35\n36 86\n87 37\n38 88\n39 89\n40 90\n41 91\n92 42\n93 43\n44 94\n45 95\n46 96\n47 97\n48 98\n49 99\n50 100", "1 51\n2 52\n53 3\n4 54\n5 55\n6 56\n57 7\n8 58\n9 59\n10 60\n61 11\n62 12\n13 63\n64 14\n15 65\n16 66\n67 17\n18 68\n19 69\n20 70\n21 71\n22 72\n23 73\n24 74\n75 25\n76 26\n27 77\n28 78\n29 79\n30 80\n31 81\n32 82\n33 83\n34 84\n35 85\n36 86\n37 87\n38 88\n39 89\n40 90\n41 91\n42 92\n43 93\n44 94\n95 45\n46 96\n97 47\n98 48\n99 49\n50 100", "1 51\n2 52\n3 53\n54 4\n55 5\n6 56\n7 57\n8 58\n9 59\n10 60\n61 11\n12 62\n13 63\n64 14\n15 65\n16 66\n67 17\n68 18\n19 69\n20 70\n71 21\n22 72\n73 23\n74 24\n25 75\n26 76\n27 77\n78 28\n79 29\n30 80\n31 81\n32 82\n33 83\n84 34\n35 85\n36 86\n87 37\n38 88\n39 89\n40 90\n41 91\n42 92\n43 93\n94 44\n45 95\n46 96\n47 97\n48 98\n49 99\n50 100", "1 51\n52 2\n3 53\n4 54\n5 55\n6 56\n7 57\n58 8\n59 9\n10 60\n11 61\n12 62\n13 63\n14 64\n15 65\n16 66\n67 17\n68 18\n69 19\n20 70\n21 71\n72 22\n23 73\n24 74\n25 75\n76 26\n77 27\n28 78\n29 79\n30 80\n31 81\n32 82\n33 83\n34 84\n35 85\n36 86\n37 87\n38 88\n39 89\n40 90\n41 91\n42 92\n43 93\n44 94\n95 45\n46 96\n97 47\n98 48\n49 99\n50 100", "1 51\n2 52\n3 53\n4 54\n5 55\n56 6\n7 57\n8 58\n59 9\n10 60\n11 61\n12 62\n13 63\n14 64\n15 65\n16 66\n17 67\n18 68\n69 19\n20 70\n71 21\n72 22\n23 73\n24 74\n75 25\n26 76\n77 27\n28 78\n79 29\n30 80\n31 81\n32 82\n33 83\n34 84\n35 85\n36 86\n37 87\n38 88\n39 89\n90 40\n91 41\n42 92\n43 93\n44 94\n95 45\n46 96\n47 97\n48 98\n49 99\n50 100", "1 51\n2 52\n3 53\n4 54\n55 5\n6 56\n7 57\n8 58\n59 9\n10 60\n11 61\n12 62\n13 63\n64 14\n15 65\n16 66\n17 67\n18 68\n19 69\n70 20\n21 71\n72 22\n23 73\n24 74\n25 75\n26 76\n27 77\n78 28\n29 79\n30 80\n31 81\n32 82\n83 33\n34 84\n35 85\n36 86\n37 87\n38 88\n89 39\n90 40\n91 41\n42 92\n43 93\n44 94\n45 95\n46 96\n97 47\n48 98\n99 49\n100 50"]}

UNKNOWN

PYTHON3

CODEFORCES

40

8f73f953a8856ca3a4c9cf3d04b14148

TL

Valera wanted to prepare a Codesecrof round. He's already got one problem and he wants to set a time limit (TL) on it. Valera has written *n* correct solutions. For each correct solution, he knows its running time (in seconds). Valera has also wrote *m* wrong solutions and for each wrong solution he knows its running time (in seconds). Let's suppose that Valera will set *v* seconds TL in the problem. Then we can say that a solution passes the system testing if its running time is at most *v* seconds. We can also say that a solution passes the system testing with some "extra" time if for its running time, *a* seconds, an inequality 2*a*<=≤<=*v* holds. As a result, Valera decided to set *v* seconds TL, that the following conditions are met: 1. *v* is a positive integer; 1. all correct solutions pass the system testing; 1. at least one correct solution passes the system testing with some "extra" time; 1. all wrong solutions do not pass the system testing; 1. value *v* is minimum among all TLs, for which points 1, 2, 3, 4 hold. Help Valera and find the most suitable TL or else state that such TL doesn't exist. The first line contains two integers *n*, *m* (1<=≤<=*n*,<=*m*<=≤<=100). The second line contains *n* space-separated positive integers *a*1,<=*a*2,<=...,<=*a**n* (1<=≤<=*a**i*<=≤<=100) — the running time of each of the *n* correct solutions in seconds. The third line contains *m* space-separated positive integers *b*1,<=*b*2,<=...,<=*b**m* (1<=≤<=*b**i*<=≤<=100) — the running time of each of *m* wrong solutions in seconds. If there is a valid TL value, print it. Otherwise, print -1. Sample Input 3 6 4 5 2 8 9 6 10 7 11 3 1 3 4 5 6 Sample Output 5-1

[ "n, m = map(int, input().split())\r\ngood = list(map(int, input().split()))\r\nbad = list(map(int, input().split()))\r\nminimum_g, maximum_g = min(good), max(good)\r\nminimum_time = -1\r\nif(minimum_g == maximum_g):\r\n minimum_time = 2*minimum_g\r\nelse:\r\n minimum_time = max(2*minimum_g, maximum_g)\r\n\r\nif(min(bad)<=minimum_time):\r\n print(-1)\r\nelse:\r\n print(minimum_time)", "n , m = map(int,input().split())\r\ncans = list(map(int,input().split()))\r\nwans = list(map(int,input().split()))\r\nv = max(min(cans) * 2 , max(cans))\r\nif v < min(wans):\r\n print(v)\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nb = list(map(int, input().split()))\r\nb.sort()\r\nres = max(2 * a[0], a[-1])\r\nprint(res if res < b[0] else -1)\r\n", "n,k = list(map(int,input().split(\" \")))\r\nvalid = list(map(int,input().split(\" \")))\r\ninvalid = list(map(int,input().split(\" \")))\r\n\r\nminValid = min(valid)\r\nmaxValid = max(valid)\r\nminInvalid = min(invalid)\r\n\r\nif maxValid < minInvalid and maxValid > 0:\r\n if 2*minValid <= maxValid:\r\n print(maxValid)\r\n elif 2*minValid < minInvalid:\r\n print(2*minValid)\r\n else:\r\n print(\"-1\")\r\nelse:\r\n print(\"-1\")\r\n", "n, m = map(int, input().split())\n\na = list(map(int, input().split()))\n\nb = list(map(int, input().split()))\n\nM = max(a)\nm = min(a)\n\nm_b = min(b)\n\nif 2*m >= m_b or M >= m_b:\n print(-1)\n\nelse:\n print(max(2*m, M)) \n", "input()\na = list(map(int, input().split()))\nb = max(max(a), min(a)*2)\nif b < min(list(map(int, input().split()))):\n print(b)\nelse:\n print(-1)\n\n", "n, m = input().split()\nn = int (n)\nm = int (m)\n#k = int (k)\n#s = input()\n#n = int(input())\n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\n#x1, y1, x2, y2 =map(int,input().split())\n#n = int(input())\n#f = []\n#f = [0]*n\n#t = [0]*n\n#f = []\n \n#h = [\"\"] * n\n#f1 = sorted(f, key = lambda tup: tup[0])\n\n#f1 = sorted(t, key = lambda tup: tup[0])\no = max(max(a), min(a)*2)\nu = min(b)\nif (u <= o):\n print(-1)\nelse:\n print(o)\n", "def main():\r\n from sys import stdin, stdout\r\n\r\n n, m = map(int,stdin.readline().split())\r\n right = sorted(list(map(int,stdin.readline().split())))\r\n wrong = sorted(list(map(int,stdin.readline().split())))\r\n\r\n ans = max(right[0]*2,right[-1])\r\n if ans >= wrong[0]:\r\n stdout.write('-1\\n')\r\n else:\r\n stdout.write(str(ans)+'\\n')\r\n \r\n\r\nif __name__=='__main__':\r\n main()\r\n", "input()\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nv, p, q = min(a), max(a), min(b)\r\nans = max(2 * v, p)\r\nprint(ans if q > ans else -1)\r\n", "n, m = map(int, input().split())\n\npas = list(map(int, input().split()))\nfail = list(map(int, input().split()))\n\nk = max(pas)\nt = min(pas)\nk = max(k, 2*t)\np = min(fail)\nprint(k if p>k else -1)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=list(map(int,input().split())) \r\nv=min(l)\r\np=max(l)\r\nc=min(s)\r\nif max(v*2,p)<c:\r\n print(max(v*2,p))\r\nelse:\r\n print(-1)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nv = max(max(a),2*min(a))\r\nif v<min(b):\r\n print(v)\r\nelse:\r\n print('-1') \r\n", "n,m = map(int,input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nl = min(a)\np = max(a)\nc = min(b)\nmim = max(2*l,p)\nif mim < c:\n print(mim)\nelse:\n print(-1)\n\t \t\t\t \t \t \t\t\t \t \t\t\t \t\t\t", "n,m=map(int,input().split())\nls1=[int(a) for a in input().split()]\nls2=[int(a) for a in input().split()]\nif min(ls1)*2<min(ls2) and max(ls1)<min(ls2):\n print(max(min(ls1)*2,max(ls1)))\nelse:\n print(-1)\n \n", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nans = 0;\r\nans = min(a)*2\r\nif max(a) > ans :\r\n ans = max(a)\r\np = min(b) - 1\r\nif p <ans :\r\n print(-1)\r\nelse:\r\n print(ans)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nl.sort()\r\nl1.sort()\r\nt1=max(l[n-1],2*l[0])\r\nif t1<l1[0]:\r\n print(t1)\r\nelse:\r\n print(-1)", "x = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\na = []\r\nb = []\r\nk = 0\r\n\r\nx = input().split()\r\nfor i in range(n):\r\n tmp = int(x[i])\r\n a.append(tmp)\r\n\r\nx = input().split()\r\nfor i in range(m):\r\n tmp = int(x[i])\r\n b.append(tmp)\r\n\r\nk = max(2*min(a), max(a))\r\nif k < min(b):\r\n print(k)\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nv = min(a)\r\np = max(a)\r\nc = min(b)\r\nif max(2*v, p) < c:\r\n print(max(2*v, p))\r\nelse:\r\n print(\"-1\")", "n,m = [int(i) for i in input().split()]\r\n\r\narr_c = [int(i) for i in input().split()]\r\narr_w = [int(i) for i in input().split()]\r\n\r\nvmax = min(arr_w) - 1\r\nvmin = max(arr_c)\r\nlowest = min(arr_c)\r\n\r\nans = -1\r\n\r\nfor i in range(vmin, vmax+1):\r\n if 2*lowest <= i:\r\n ans = i\r\n break\r\nprint(ans)\r\n\r\n", "# It's all about what U BELIEVE\ndef gint(): return int(input())\ndef gint_arr(): return list(map(int, input().split()))\ndef gfloat(): return float(input())\ndef gfloat_arr(): return list(map(float, input().split()))\ndef pair_int(): return map(int, input().split())\n###############################################################################\nINF = (1 << 31)\ndx = [-1, 0, 1, 0]\ndy = [ 0, 1, 0, -1]\n###############################################################################\n############################ SOLUTION IS COMING ###############################\n###############################################################################\nn, m = gint_arr()\na = gint_arr()\na.sort()\nb = gint_arr()\nb.sort()\nres = a[n - 1]\nwhile a[0] * 2 > res:\n res += 1\n\nif res >= b[0]:\n print(\"-1\")\nelse:\n print(res)\n", "n, m = map(int, input().split())\n\narr1 = list(map(int, input().split()))\narr2= list(map(int, input().split()))\n\nmax_arr1 = max(arr1)\nmin_arr1 = min(arr1)\n\nmin_arr2 = min(arr2)\n\nif max_arr1 < min_arr2:\n if min_arr1*2 <= max_arr1:\n print(max_arr1)\n elif min_arr1*2 < min_arr2:\n print(min_arr1*2)\n else:\n print(-1)\nelse:\n print(-1)\n", "n,m=map(int,input().split())\r\na=list(map(int,input().rstrip().rsplit()))\r\nb=list(map(int,input().rstrip().rsplit()))\r\np=min(a)\r\nx=max(a)\r\ny=min(b)\r\nif(max(x,p*2)<y):\r\n print(max(x,p*2))\r\nelse:\r\n print(-1)\r\n", "import sys\r\nINF = 10**20\r\nMOD = 10**9 + 7\r\nI = lambda:list(map(int,input().split()))\r\nfrom math import gcd\r\nfrom math import ceil\r\nfrom collections import defaultdict as dd, Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\n\r\n\r\n\"\"\"\r\nFacts and Data representation\r\nConstructive? Top bottom up down\r\n\"\"\"\r\nn, m = I()\r\na = sorted(I())\r\nb = sorted(I())\r\nans = max(2 * a[0], a[-1])\r\nif b[0] > ans:\r\n print(ans)\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\nls_1 = list(map(int, input().split()))\r\nls_2 = list(map(int, input().split()))\r\nv = max(2*min(ls_1), *ls_1)\r\nprint(v if v < min(ls_2) else -1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=0\r\nfor i in range(100):\r\n if c>=2*min(a) and c>=max(a) and c<min(b):\r\n print(c)\r\n break\r\n else:\r\n c+=1\r\nif c==100:\r\n print(\"-1\")", "n , m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\n\r\nres = max(min(c)*2, max(c))\r\nif res < min(w):\r\n print(res)\r\nelse:\r\n print(-1)", "'''\r\ni should've implement it in c++\r\n'''\r\n\r\n\r\nn,m = map(int,input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nv = min(a)\r\np = max(a)\r\nc = min(b)\r\nass = max(2*v,p)\r\nif ass < c:\r\n print(ass)\r\nelse:\r\n print(-1)\r\n", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nv = min(a)\r\np = max(a)\r\nc = min(b)\r\nif max(2*v,p) < c:\r\n print(max(2*v,p))\r\nelse:\r\n print(-1)", "import os,sys,io,math\r\nfrom tokenize import Triple\r\nfrom array import array\r\nfrom math import *\r\nI=lambda:[*map(int,sys.stdin.readline().split())]\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\nn,m=map(int,input().split())\r\na=I()\r\nb=I()\r\nc=min(a)\r\nd=min(b)\r\nv=max(a)\r\nprint(max(2*c,v) if max(2*c,v)<d else -1)", "n,m=map(int,input().split())\r\nlstn=[int(x) for x in input().split()]\r\nlstm=[int(x) for x in input().split()]\r\nmaxi,mini,pos=max(lstn),min(lstm),min(lstn)\r\nif maxi>=mini:print(-1)\r\nelif 2*pos>mini-1:print(-1)\r\nelse:\r\n for i in range(maxi,mini):\r\n if 2*pos<=i:\r\n print(i)\r\n break\r\n else:print(-1)\r\n", "a,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nif(max(min(x)*2,max(x))<min(y)):\r\n print(max(min(x)*2,max(x)))\r\nelse:\r\n print(\"-1\")", "import math, re, sys, string, operator, functools, fractions, collections\nsys.setrecursionlimit(10**7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda x=' ': list(map(int,input().split(x)))\nRS=lambda x=' ': input().rstrip().split(x)\nmod=int(1e9+7)\neps=1e-6\npi=math.acos(-1.0)\n#################################################\nRI()\nA=RI()\nB=RI()\nv=max(A)\nvm=min(A)\na=max((2*vm),v)\nif min(B)<=a:\n print(-1)\nelse:\n print(a)\n\n", "n,m = map(int , input().split())\r\na = list(map(int , input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nx = max(min(a)*2,max(a))\r\nif min(b)>x:\r\n print(x)\r\nelse:\r\n print(-1)\r\n\r\n", "n, m = map(int, input().split())\r\nright = sorted([int(i) for i in input().split()])\r\nwrong = sorted([int(i) for i in input().split()])\r\n\r\nif (max(right) >= min(wrong)) or (2*min(right) >= min(wrong)):\r\n print(-1)\r\nelse:\r\n print(max(max(right), 2*min(right)))\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=(map(int,input().split()))\r\nv=max(max(a),2*min(a))\r\nif v<min(b):print(v)\r\nelse:print(-1)", "n,m=map(int,input().split())\nN=list(map(int,input().split()))\nM=list(map(int,input().split()))\n\nN.sort()\nM.sort()\n\na=N[-1]\nans=-1\nfor i in range(a,M[0]):\n if(i>=2*N[0]):\n ans=i\n break\nprint(ans)\n", "def check(n,arr):\r\n n=n//2\r\n m3=min(arr)\r\n if(m3<=n):\r\n return True\r\n else:\r\n False\r\n\r\n\r\nn,m=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nbrr=list(map(int,input().split()))\r\n\r\nm1=max(arr)\r\nm2=min(brr)\r\nans=0\r\nif(m2<=m1):\r\n print(-1)\r\n\r\nelse:\r\n flag=0\r\n while(m1<m2):\r\n if(check(m1,arr)):\r\n ans=m1\r\n flag=1\r\n break\r\n\r\n\r\n m1+=1\r\n\r\n if(flag==0):\r\n print(-1)\r\n\r\n else:\r\n print(ans)\r\n\r\n", "n,m = map(int, input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ntl=-1\r\nfor i in range(max(a),min(b)):\r\n if 2*min(a)<=i:\r\n tl=i\r\n break\r\nprint(tl)", "line = list(map(int,input().split()))\r\nn = line[0]\r\nm = line[1]\r\ncorr = list(map(int,input().split()))\r\ncorr.sort()\r\nwrong = list(map(int,input().split()))\r\nwrong.sort()\r\nl = corr[0]\r\nr = corr[-1]\r\nk = wrong[0]\r\nif ((r >= k) or (k <= (2 * l))):\r\n print(-1)\r\nelse:\r\n l = 2 * l\r\n if(r > l):\r\n print(r)\r\n else:\r\n print(l)\r\n ", "s = input()\r\nar = s.split()\r\nn = int(ar[0])\r\nm = int(ar[1])\r\na = []\r\nb = []\r\ns = input()\r\nfor i in s.split():\r\n a += [int(i)]\r\ns = input()\r\nfor i in s.split():\r\n b += [int(i)]\r\n\r\nif max(min(a) * 2, max(a)) < min(b):\r\n print(max(min(a) * 2, max(a)))\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "import sys,os,io,time,copy,math\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\n\r\ndef main():\r\n n,m=map(int,input().split())\r\n correct=list(map(int,input().split()))\r\n wrong=list(map(int,input().split()))\r\n if max(correct)<min(wrong):\r\n a=min(correct)\r\n for v in range(max(correct),min(wrong)):\r\n if 2*a<=v:\r\n print(v)\r\n return\r\n print(-1)\r\n else:\r\n print(-1)\r\n\r\nmain()\r\n\r\n", "import math\r\nimport string\r\n\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n b = [int(i) for i in input().split(\" \")]\r\n min_val = max(max(a), 2 * min(a))\r\n min_val_2 = min(b)\r\n if min_val >= min_val_2:\r\n print(-1)\r\n else:\r\n print(min_val)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nx,y,z=min(l),max(l),min(d)\r\nxx=max(2*x,y)\r\nif(xx<z):\r\n print(xx)\r\nelse:\r\n print(-1)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nmaxa = 0\r\nmina = 101\r\nfor i in a:\r\n if i > maxa:\r\n maxa = i\r\n if i < mina:\r\n mina = i\r\nminb = 101\r\nfor i in b:\r\n if i < minb:\r\n minb = i\r\nif max(mina * 2, maxa) >= minb:\r\n print(-1)\r\nelse:\r\n print(max(mina * 2, maxa))\r\n ", "input()\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nprint(max(2 * min(a), max(a)) if max(2 * min(a), max(a)) < min(b) else -1)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nz=list(map(int,input().split()))\r\nglag=0\r\nfor i in range(1,min(z)):\r\n count=0\r\n glag=0\r\n for j in range(len(a)):\r\n if(a[j]>i):\r\n glag=1\r\n break;\r\n else:\r\n if(a[j]*2<=i):\r\n count+=1\r\n if(count>=1 and glag==0):\r\n print(i)\r\n exit()\r\nprint(-1)\r\n \r\n", "from math import *\r\n#from bisect import *\r\n#from collections import *\r\n#from random import *\r\n#from decimal import *\"\"\"\r\n#from heapq import *\r\n#from random import *\r\nimport sys\r\ninput=sys.stdin.readline\r\n#sys.setrecursionlimit(3*(10**5))\r\nglobal flag\r\ndef inp():\r\n return int(input())\r\ndef st():\r\n return input().rstrip('\\n')\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\nt=1\r\nwhile(t):\r\n t-=1\r\n n,m=ma()\r\n a=lis()\r\n b=lis()\r\n c=max(2*min(a),max(a))\r\n if(min(b)<=c):\r\n print(-1)\r\n else:\r\n print(c)\r\n \r\n \r\n", "c, w = map(int, input().split())\r\ncorrect = sorted(list(map(int, input().split())))\r\nwrong = sorted(list(map(int, input().split())))\r\nmin_TL = correct[0] * 2\r\nfor i in correct:\r\n min_TL = max(min_TL, i)\r\nif wrong[0] <= min_TL:\r\n print(-1)\r\nelse:\r\n print(min_TL)\r\n", "input()\r\ncrt=list(map(int,input().split()))\r\nwrn=list(map(int,input().split()))\r\nleast_crt=min(crt)\r\nmax_crt=max(crt)\r\nul=min(wrn)\r\ntl=max(2*least_crt,max_crt)\r\nif tl<ul:\r\n print(tl)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nif max(max(l),min(l)*2)<min(l1) :\r\n print(max(max(l),min(l)*2))\r\nelse :\r\n print(-1)\r\n", "n,m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nw = list(map(int,input().split()))\r\n\r\nma = max(c)\r\nmi = min(w)\r\nck = max(min(c)*2,ma)\r\nif(mi>ck):\r\n print(ck)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\np=list(map(int,input().split()))\r\nf=list(map(int,input().split()))\r\np.sort()\r\nf.sort()\r\nc=0\r\nfor t in range(p[-1],f[0]):\r\n if(2*p[0]<=t):\r\n print(t)\r\n c=-1\r\n break\r\nif(c==0):\r\n print(-1)", "def main():\n n, m = list(map(int, input().split(' ')))\n good = list(map(int, input().split(' ')))\n bad = list(map(int, input().split(' ')))\n\n max_good = max(good)\n min_bad = min(bad)\n if max_good >= min_bad:\n print(-1)\n return\n\n smallest = min(good)\n max_good = max(max_good, 2*smallest)\n\n print(max_good if max_good < min_bad else -1)\n\n\nif __name__ == \"__main__\":\n main()\n", "n, m = map(int, input().split())\r\nr = [int(x) for x in input().split()]\r\nw = [int(x) for x in input().split()]\r\nr.sort()\r\nw.sort()\r\na = r[0]\r\nb = r[-1]\r\nc = w[0]\r\nif 2*a < c and b < c:\r\n print(max(2*a, b))\r\nelse:\r\n print(-1)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nmaxiA = max(a)\r\nminiA = min(a)\r\nminiB = min(b)\r\nans = -1\r\nif max(2*miniA, maxiA) < miniB:\r\n ans = max(maxiA, 2*miniA)\r\nelse:\r\n ans = -1\r\nprint(ans)", "n, m = [int(x) for x in input().split()]\nl = [int(x) for x in input().split()]\na = max(l)\nq = min(l)\nb = min(int(x) for x in input().split())\nif q * 2 < b and a < b:\n\tprint(max(a, q * 2))\nelse:\n\tprint(-1)\n", "[n, m] = map(int, input().split());\r\n\r\npassed = list(map(int, input().split()))\r\nunpassed = list(map(int, input().split()))\r\n\r\nmax_p = max(passed)\r\nmin_p2 = 2*min(passed)\r\nmin_up = min(unpassed)\r\n\r\nif max_p >= min_up or min_p2 >= min_up:\r\n\tv = -1\r\nelse:\r\n\tv = min_p2 if min_p2 >= max_p else max_p\r\nprint(v)\r\n", "R = lambda: list(map(int, input().split()))\r\n \r\nn, m = R()\r\n \r\na = R()\r\n \r\nb = R()\r\n \r\nv = max(2 * min(a), max(a))\r\n \r\nprint(v if v < min(b) else -1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nans = -1\r\n\r\nfor v in range(1, 201):\r\n f1 = True\r\n f2 = False\r\n for i in range(n):\r\n if a[i] > v:\r\n f1 = False\r\n if 2 * a[i] <= v:\r\n f2 = True\r\n\r\n f3 = True\r\n for i in range(m):\r\n if b[i] <= v:\r\n f3 = False\r\n\r\n if f1 and f2 and f3:\r\n ans = v\r\n break\r\n\r\nprint(ans) \r\n \r\n \r\n", "n,m=map(int,input().split(\" \"))\r\nl1=list(map(int,input().split(\" \")))\r\nl2=list(map(int,input().split(\" \")))\r\n\r\nl1.sort()\r\nl2.sort()\r\ntmin = 2 * l1[0];\r\ntmin = max(tmin, l1[n - 1]);\r\nval=-1 if (l2[0] <= tmin) else tmin\r\nprint(val)\r\n", "n,m = input().split(' ')\r\nn = int(n)\r\nm = int(m)\r\n\r\na = input().split(' ')\r\nfor i in range(0,n):\r\n a[i] = int(a[i])\r\n\r\nb = input().split(' ')\r\nfor i in range(0,m):\r\n b[i] = int(b[i])\r\n\r\na.sort()\r\nb.sort()\r\n\r\nv = max(a)\r\nk = min(a)\r\nc = min(b)\r\n\r\nif max(2*k,v) < c:\r\n print(max(2*k,v))\r\nelse:\r\n print(-1)", "n,m=map(int,input().split(\" \"))\r\nl1=list(map(int,input().split(\" \")))\r\nl2=list(map(int,input().split(\" \")))\r\n\r\nmax_1=max(l1)\r\nmin_1=min(l1)\r\nmin_2=min(l2)\r\ntmin = 2 * min_1\r\n\r\ntmin = max(tmin, max_1)\r\n\r\nif (min_2 <= tmin):\r\n\tprint(-1)\r\nelse:\r\n\tprint(tmin)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif max(max(a), 2*min(a)) < min(b):\r\n print(max(max(a), 2*min(a)))\r\nelse:\r\n print(-1)\r\n", "n, m = map(int, input().split())\r\n\r\ncorrect = list(map(int, input().split()))\r\nincorrect = list(map(int, input().split()))\r\n\r\n\r\nret = max(max(correct), 2*min(correct))\r\n\r\n\r\n\r\nif min(incorrect) <= ret:\r\n print(-1)\r\nelse:\r\n print(ret)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nv=min(a)\r\nq=max(a)\r\nd=min(b)\r\nif max(2*v,q)<d:\r\n print(max(2*v,q))\r\nelse:\r\n print(-1)", "def find(arr1,arr2):\r\n min1=min(arr1)\r\n min2=min(arr2)\r\n max1=max(arr1)\r\n max2=max(arr2)\r\n if(min1*2< min2 and max1<min2):\r\n return max(min1*2,max1)\r\n else:\r\n return -1\r\nfrom collections import defaultdict\r\nfrom math import ceil\r\nn,k=map(int,input().split())\r\narr1=list(map(int,input().split()))\r\narr2=list(map(int,input().split()))\r\nprint(find(arr1,arr2))\r\n", "m, n = map(int, input().split())\r\ntrues, falses = list(map(int, input().split())), list(map(int, input().split()))\r\nv = max(2 * min(trues), max(trues))\r\nif v < min(falses):\r\n print(v)\r\nelse:\r\n print(-1)", "n , m= map(int,input().split())\narr1 = list(map(int,input().split()))\nmaxi =arr1[0]\nmini = arr1[0]\nfor i in arr1:\n if i>maxi:\n maxi =i\n if i<mini:\n mini = i\narr2 = list(map(int,input().split()))\nmini2 = min(arr2)\nm = 2*mini\nif(m>maxi):\n maxi = m\nif(mini2<=maxi):\n print(-1)\nelse:\n print(maxi)\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\nam = a[0]\r\nbm = min(b)\r\ni = b[0] - 1\r\nwhile i >= 2*am and a[-1] <= i and i > 0:\r\n i -= 1\r\ni+=1\r\nif i == 0 or not(i >= 2*am and a[-1] <= i and i > 0) or bm <= i:\r\n print(-1)\r\nelse:\r\n print(i)", "n,m =map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nv=min(a)\r\np=max(a)\r\nc=min(b)\r\n\r\nif max(2*v,p)<c:\r\n ans=max(2*v,p)\r\nelse:\r\n ans=-1\r\n \r\nprint(ans)\r\n", "n,m = map(int,input().split())\r\nAC = list(map(int, input().split()))\r\nWA = list(map(int, input().split()))\r\na = max(AC)\r\nb = min(AC)\r\nc = min(WA)\r\nif max(2*b, a) < c:\r\n print (max(2*b,a))\r\nelse:\r\n print(-1)", "n,m = map(int, input().split())\r\nAC = list(map(int, input().split()))\r\nWA = list(map(int, input().split()))\r\nslowest = max(AC)\r\nfastest = min(AC)\r\n\r\nfastest_wrong = min(WA)\r\ndef sim(v):\r\n extraTime = fastest * 2 <= v\r\n if not (extraTime):\r\n return False\r\n passes = slowest <= v\r\n no_wrong = fastest_wrong > v\r\n if(passes and no_wrong):\r\n return True\r\n\r\nfor i in range(1, 101):\r\n if(sim(i)):\r\n print(i)\r\n break\r\nelse:\r\n print(-1)\r\n", "from sys import stdin,stdout\r\nimport math\r\nn,m=map(int,stdin.readline().split())\r\nAC=list(map(int,stdin.readline().split()))\r\nWA=list(map(int,stdin.readline().split()))\r\nx,y,z=min(AC),max(AC),min(WA)\r\nif y>=z or 2*x>=z:\r\n print(-1)\r\nelse:\r\n print(max(2*x,y))", "n, m = map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nm1 = min(a)\r\nm2 = max(a)\r\n\r\nval = max(m1*2, m2)\r\n\r\nm3 = min(b)\r\n\r\nif(val<m3):\r\n print(val)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif max(a)>=min(b) or 2*min(a)>=min(b):\r\n print(\"-1\")\r\nelse:\r\n acre=max(a)\r\n while True:\r\n if acre>=min(b):\r\n print(\"-1\")\r\n break\r\n elif acre>=2*min(a):\r\n print(acre)\r\n break\r\n else:\r\n acre+=1\r\n", "a,b=map(int,input().split())\r\na_arr=list(map(int,input().split()))\r\nb_arr=list(map(int,input().split()))\r\nv=min(a_arr)\r\np=max(a_arr)\r\nc=min(b_arr)\r\nif max(2*v,p)<c:\r\n\tprint(max(2*v,p))\r\nelse:\r\n\tprint(-1)\t", "n,m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nif max(2*min(a),max(a)) < min(b):\r\n print(max(2*min(a),max(a)))\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\nans=max(2*min(c),max(c))\r\nif min(w)<=ans:\r\n\tprint(-1)\r\nelse:\r\n\tprint(ans)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nans = max(2*min(a),max(a))\r\nif ans < min(b):\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n, m = map(int,input().split(\" \"))\r\ncorrect = list(map(int, input().split(\" \")))\r\nwrong = list(map(int, input().split(\" \")))\r\n\r\nmin_possible_v = 2*(min(correct))\r\nmin_correct = max(correct)\r\nmax_possible = min(wrong)\r\n\r\nif min_correct >= max_possible:\r\n print(-1)\r\nelse:\r\n if min_possible_v >= max_possible:\r\n print(-1)\r\n else:\r\n print(max(min_possible_v, min_correct))", "import sys\r\nfrom collections import defaultdict as dd\r\ndef read():\r\n return sys.stdin.readline().strip()\r\ndef write(a):\r\n sys.stdout.write(a)\r\ndef main():\r\n n, m = [int(i) for i in read().split()]\r\n a = [int(i) for i in read().split()]\r\n b = [int(i) for i in read().split()]\r\n v1, v2 = max(min(a)*2, max(a)), min(b)\r\n if v2 > v1:\r\n print(v1)\r\n else:\r\n print(-1)\r\nmain()\r\n", "n,m = map(int,input().split())\r\ncorrect = list(map(int, input().split()))[:n]\r\nwrong = list(map(int,input().split()))[:m]\r\nmn = min(correct)\r\nmx = max(correct)\r\nmx = max(mx, 2*mn)\r\nmn = min(wrong)\r\nif mx<mn:\r\n print(mx)\r\nelse:\r\n print(-1)", "if __name__=='__main__':\r\n n,m = list(map(int,input().split()))\r\n c = list(map(int,input().split()))\r\n w = list(map(int,input().split()))\r\n k = min(c)\r\n exp = max(c)\r\n bel = min(w)\r\n time = list(range(exp,bel))\r\n if len(time)==0:\r\n print(\"-1\")\r\n elif 2*k<=max(time):\r\n c.append(2*k)\r\n print(max(c))\r\n else:\r\n print(\"-1\") \r\n", "n,m = map (int, input().split())\nxs = list (map (int, input().split()))\nys = list (map (int, input().split()))\nac = max (2*min(xs), max(xs))\nwa = min (ys)\nif (ac < wa): \n print (ac)\nelse:\n print (-1)\n", "n,m=map(int,input().split())\r\ncorrect=list(map(int,input().split()))\r\nincorrect=list(map(int,input().split()))\r\nmax_cor=max(2*min(correct),max(correct))\r\nmin_cor=min(incorrect)\r\nif(max_cor<min_cor):\r\n print(max_cor)\r\nelse:\r\n print(\"-1\")\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nstat =False\r\nif max(a)<2*min(a):\r\n v=2*min(a)\r\nelse:v=max(a)\r\nif v<1:\r\n print(-1)\r\nelif v>=min(b):\r\n print(-1)\r\nelif 2*min(a)>v:\r\n print(-1)\r\nelse:print(v)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[min(a)*2,min(b)-1,max(a)];c.sort()\r\nfor i in c:\r\n if i>=max(a) and min(a)<=i/2 and min(b)>i:\r\n print(i)\r\n exit(0)\r\nprint(-1)", "\r\nn, m = map(int, input().split())\r\nnl = list(map(int, input().split()))\r\nml = list(map(int, input().split()))\r\n\r\nmv1 = min(nl)*2\r\nmv2 = max(nl)\r\nmv3 = min(ml)\r\n\r\nif mv3 <= max(mv1, mv2):\r\n print(-1)\r\nelse:\r\n print(max(mv1, mv2))", "a,b=map(int,input().split())\narr1=list(map(int,input().split()))\narr2=list(map(int,input().split()))\nn=max(min(arr1)*2,max(arr1))\nif n<min(arr2):\n print(n)\nelse:\n print(\"-1\")\n\t \t \t\t\t \t \t \t \t \t\t \t \t \t", "n,m = input().split()\r\na = eval(input().replace(\" \", \",\")+',')\r\nb = eval(input().replace(\" \", \",\")+',')\r\nv = max(max(a), min(a) * 2)\r\nif(v < min(b)):\r\n print(v)\r\nelse:\r\n print(-1)\r\n", "I=lambda:list(map(int,input().split()))\r\nn,k=I()\r\nl=I()\r\nt = I()\r\nv = min(l)\r\np = max(l)\r\nc = min(t)\r\nif max(2*v,p)<c:\r\n print(max(2*v,p))\r\nelse:\r\n print(-1)", "n = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\nq = list(map(int, input().split()))\r\nv = min(p)\r\nr = max(p)\r\nc = min(q)\r\nif max(v*2, r)<c:\r\n print(max(v*2, r))\r\nelse:\r\n print(\"-1\")", "def solve():\r\n\tfor v in range(a, b):\r\n\t\tfor i in arr:\r\n\t\t\tif(i*2 <= v):\r\n\t\t\t\treturn v\r\n\treturn -1\r\nn,m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nbrr = list(map(int, input().split()))\r\na, b= max(arr),min(brr)\r\nprint(solve())", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nv=min(x)\r\np=max(x)\r\nq=min(y)\r\nt=max(2*v,p)\r\nif(t<q):\r\n print(t)\r\nelse:\r\n print(-1)\r\n", "if __name__ == '__main__':\r\n\tn, m = [int(i) for i in input().split()]\r\n\tcorrectList = [int(i) for i in input().split()]\r\n\twrongList = [int(i) for i in input().split()]\r\n\tTL = -1\r\n\tfor i in range(max(correctList), min(wrongList)):\r\n\t\tif 2 * min(correctList) <= i and i < min(wrongList):\r\n\t\t\tTL = i\r\n\t\t\tbreak\r\n\tprint(TL) ", "n,m = [int(item) for item in input().split()]\r\nan = list(map(int,input().split()))\r\nam = list(map(int,input().split()))\r\ncount = 0\r\nv = max(an)\r\nfor i in range(len(an)):\r\n if len(an)>1:\r\n if 2*an[i]<=v:\r\n count+=1\r\n elif i==len(an)-1 and count<1:\r\n v = 2*min(an)\r\n count+=1\r\n else:\r\n v = 2*min(an)\r\n count+=1\r\nif min(am)>v and count>=1:\r\n print(v)\r\nelse:\r\n print(-1)", "\n# 350 A. TL\n\nn,m = map(int,input().split())\nns = [int(i) for i in input().split()]\nms = [int(i) for i in input().split()]\nmin_1 = min(ms) -1 \n\nnew_mins = []\n\nif max(ns) > min_1:\n print(-1)\n exit()\n\nnew_min_lower = max(ns)\nnew_min_upper = min_1\n\nfor i in range(new_min_lower,new_min_upper+1):\n flag = 0\n for j in ns:\n if 2*j <= i:\n flag = 1\n break\n if flag == 1:\n new_mins.append(i)\nif len(new_mins) ==0:\n print(-1)\nelse:\n print(min(new_mins))\n \n\n\n \n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nq = list(map(int, input().split()))\r\n\r\nx = max(min(w)*2, max(w))\r\nif x < min(q):\r\n print(x)\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\n\r\na = [int(k) for k in input().split()]\r\nb = [int(k) for k in input().split()]\r\n\r\n\r\nmax_a = max(a)\r\nmin_a = min(a)\r\nmin_b = min(b)\r\n\r\n\r\nv = max(2 * min_a, max_a)\r\n\r\n# Check if v is less than min_b, else there is no valid TL\r\nif v < min_b:\r\n print(v)\r\nelse:\r\n print(-1)", "n, m =map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nx = min(a)\r\ny = max(a)\r\nz = min(b)\r\nif max(2*x, y)<z:\r\n print(max(2*x, y))\r\nelse:\r\n print(\"-1\")", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nif min(b)>max(a) :\r\n if min(a)*2 < min(b) :\r\n if min(a)*2 <= max(a) :\r\n print(max(a))\r\n else:\r\n print(min(a)*2)\r\n else:\r\n print(-1)\r\nelif min(b)<= max(a):\r\n print(-1)\r\n", "a, b = map(int, input().split())\nvernoe = list(map(int, input().split()))\nneverno = list(map(int, input().split()))\nvernoe = sorted(vernoe)\nneverno = sorted(neverno)\nflag = False\nfor i in range(vernoe[-1], neverno[0]):\n if i >= vernoe[-1] and i >= vernoe[0] * 2 and i < neverno[0]:\n z = i\n flag = True\n break\nif flag:\n print(z)\nelse:\n print(-1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nx=max(a)\r\nz=min(a)\r\ny=min(b)\r\nfor i in range(x,y):\r\n if i>=2*z:\r\n print(i)\r\n exit(0)\r\nprint(-1)\r\n \r\n", "n, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\nans = max(max(a), 2*min(a))\r\nif ans < min(b):\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\nb = list(map(int, input().split()))\r\nb = sorted(b)\r\nindex = n-1\r\nans = -1\r\nwhile index >= 0:\r\n if a[index]*2 < b[0] and a[index]*2 >= a[n-1] and a[index]*2 >= a[0]*2:\r\n ans = a[index]*2\r\n if a[index] < b[0] and a[index] >= a[n-1] and a[index] >= a[0]*2:\r\n ans = a[index]\r\n index -= 1\r\nprint(ans)", "n, m = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\np = max(2*min(a), max(a))\r\nif p < min(b):\r\n print(p)\r\nelse:\r\n print(-1)\r\n", "input().split()\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\np=-1\r\ns=max(2*min(a), max(a))\r\nif s<min(b):\r\n\tp=s\r\nprint(p)", "if __name__=='__main__':\n arr = input().split(' ')\n n = int(arr[0])\n m = int(arr[1])\n arr = input().split(' ')\n Lc = []\n Li = []\n for a in arr:\n Lc.append(int(a))\n arr = input().split(' ')\n for a in arr:\n Li.append(int(a))\n Lc.sort()\n Li.sort()\n ans = -1\n if Lc[-1]>=Li[0] or Li[0]<=2*Lc[0]:\n ans = -1\n else:\n ans=max(2*Lc[0],Lc[-1])\n print(ans)\n", "n, m = [int(x) for x in input().split()]\r\narrn = [int(x) for x in input().split()]\r\narrm = [int(x) for x in input().split()]\r\n\r\nminCT = min(arrn)\r\nmaxCT = max(arrn)\r\nminWT = min(arrm)\r\n# print(minCT, maxCT, minWT)\r\nif minCT*2 < minWT:\r\n if maxCT < minWT:\r\n if maxCT > minCT*2:\r\n print(maxCT)\r\n else:\r\n print(minCT*2)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)\r\n", "n, k = map(int, input().split())\r\n\r\ncorrect = [int(i) for i in input().split()]\r\nwrong = [int(i) for i in input().split()]\r\n\r\nmin_wrong = min(wrong)\r\n\r\ncorrect.sort()\r\nmin_correct = 2 * correct[0]\r\ntl = correct[len(correct)-1]\r\n\r\nflag = False\r\n\r\nif len(correct)== 1 or (min_correct > tl and min_correct < min_wrong):\r\n tl = min_correct\r\n\r\nif min_correct <= tl and tl < min_wrong:\r\n print(tl)\r\nelse:\r\n print(-1)", "n, m= map(int, input().split())\r\na= list(map(int, input().split()))\r\nb= list(map(int, input().split()))\r\np= max(a)\r\nq= min(a)*2\r\nr= max(p, q)\r\n\r\nif min(b) <= r:\r\n print(-1)\r\nelse:\r\n print(r)", "n, m = [int(item) for item in input().split()]\r\na = [int(item) for item in input().split()]\r\nb = [int(item) for item in input().split()]\r\n\r\nmaxValue = max(a)\r\nminValue = min(a)\r\ntestValue = min(b)\r\nresult = -1\r\nif maxValue<testValue:\r\n if minValue*2<=maxValue:\r\n result = maxValue\r\n elif minValue*2 < testValue:\r\n result = minValue*2\r\nprint(result)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nleft, right = max(a), min(b)\r\nextra = min(a)\r\nwhile left < right:\r\n if extra*2 <= left:\r\n print(left)\r\n exit(0)\r\n else:\r\n left += 1\r\nprint(-1)", "n,m = map(int,input().split())\r\ncor = list(map(int,input().split()))\r\nwor = list(map(int,input().split()))\r\nl = min(cor)\r\nma = max(cor)\r\nmi = min(wor)\r\nif(ma>=mi):\r\n print(-1)\r\nelse:\r\n flag=0\r\n for i in range(ma,mi):\r\n if(i>=(2*l)):\r\n print(i)\r\n flag=1\r\n break\r\n if(flag==0):\r\n print(-1)", "import sys, math, itertools, random, bisect\r\nfrom collections import defaultdict\r\nINF = sys.maxsize\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef input(): return sys.stdin.readline().strip()\r\nmod = 10**9 + 7\r\n\r\n\r\nfor _ in range(1):\r\n n,m = get_ints()\r\n a = get_array()\r\n b = get_array()\r\n a.sort()\r\n b.sort()\r\n if a[-1]>=b[0] or 2*a[0]>=b[0]: print(-1)\r\n else:\r\n print(max(2*a[0],a[-1]))\r\n\r\n\r\n\r\n", "n,m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\namax =max(a)\r\nbmin =min(b)\r\nif bmin<=amax:\r\n print(-1)\r\nelse:\r\n gunjaishaboveamax = (bmin-amax)-1\r\n amin =min(a)\r\n if 2*amin<=amax:\r\n print(amax)\r\n elif 2*amin>amax and 2*amin>amax+gunjaishaboveamax:\r\n print(-1)\r\n elif 2*amin<=amax+gunjaishaboveamax:\r\n print(2*amin)\r\n else:\r\n print(-1)\r\n\r\n ", "def func():\n _ = input()\n a = sorted(map(int, input().split()))\n b = list(map(int, input().split()))\n x = max(a[0] * 2, a[-1])\n for y in b:\n if y <= x:\n return -1\n return x\n\nprint(func())", "def solve():\n arr1.sort()\n arr2.sort()\n v1=arr1[0]*2\n v2=arr1[-1]\n v=max(v1,v2)\n if v >= arr2[0] :\n return -1\n return v\n\n\n \n\n\n \n\n \nn,m= [int(x) for x in input().split()]\narr1= [int(x) for x in input().split()]\narr2= [int(x) for x in input().split()]\nprint(solve())\n\n\n\n'''\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n'''\n'''\nn=int(input())\narr=[int(x) for x in input().split()]\n'''", "\n_, _ = map(int, input().split())\n\nl_g = list(map(int, input().split()))\nl_b = list(map(int, input().split()))\nm = min(l_g) * 2\n\nfor g in l_g:\n m = max(m, g)\n\nfor b in l_b:\n if b <= m:\n print(-1)\n quit()\nprint(m)\n\t \t\t \t\t\t \t\t\t \t\t\t\t\t\t \t \t", "n,m = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nx = max(2*min(a),max(a))\nprint(x if x<min(b) else -1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\nq = max(a[0] * 2, a[-1])\r\nif q >= b[0]:\r\n print(-1)\r\nelse:\r\n print(q)\r\n", "temp = list(map(int, input().split()))\r\nn = temp[0]\r\nm = temp[1]\r\nlist_n = list(map(int, input().split()))\r\nlist_m = list(map(int, input().split()))\r\nv = min(list_n)\r\np = max(list_n)\r\nc = min(list_m)\r\nif max(2*v,p) < c:\r\n print(max(2*v,p))\r\nelse:\r\n print('-1')", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nn, m = readln()\na = readln()\nb = readln()\nans = -1\nfor v in range(max(a), min(b)):\n if [_ for _ in a if 2 * _ <= v]:\n ans = v\n break\nprint(ans)\n", "a=lambda:list(map(int,input().split()))\nn,m=a()\nb,c=a(),a()\nTL=max(2*min(b),max(b))\nprint(TL if TL<min(c) else \"-1\")", "n,m = map(int,input().split(\" \"))\r\nmas1 = list(map(int,input().split(\" \")))\r\nmas2 = list(map(int,input().split(\" \")))\r\nif max(2*min(mas1),max(mas1))<min(mas2):\r\n print(max(2*min(mas1),max(mas1)))\r\nelse:\r\n print(-1)", "x,y=map(int,input().split(' ',1))\r\ncorrect=list(map(int,input().split(' ',x-1)))\r\nfalse=list(map(int,input().split(' ',y-1)))\r\n\r\nif max(correct)==min(false):\r\n stop=False\r\nelse:\r\n stop=False\r\n for i in range(max(correct),min(false)):\r\n if not(stop):\r\n v=i\r\n for m in correct:\r\n if (2*m)<=v:\r\n print(v)\r\n stop=True\r\n break\r\n else:\r\n break\r\nif stop==False:\r\n print(-1)\r\n\r\n", "n, m = input().split()\r\nn, m = int(n), int(m)\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nv, p, c = min(a), max(a), min(b)\r\nif max(2*v, p) < c:\r\n print(max(2*v, p))\r\nelse:\r\n print(-1)", "input()\r\na = list(map(int, input().split()))\r\ntl = max(2 * min(a), max(a))\r\nif tl < min(list(map(int, input().split()))):\r\n print(tl)\r\nelse:\r\n print(-1)\r\n", "a, b = map(int, input().split())\ncor = list(map(int, input().split()))\nwrong = list(map(int, input().split()))\nmaxC = max(cor)\nminC = min(cor)\nminW = min(wrong)\nfor m in range(maxC, minW):\n if minC * 2 <= m:\n print(m)\n break\nelse:\n print(-1)\n \t\t\t\t \t\t\t \t \t \t\t\t\t \t\t\t\t\t\t", "#TL\r\n\r\ndata = input().split(\" \")\r\nn = int(data[0])\r\nm = int(data[1])\r\ncorrect = input().split(\" \")\r\ncorrect = [int(x) for x in correct]\r\nwrong = input().split(\" \")\r\nwrong = [int(x) for x in wrong]\r\nlimit = max(max(correct), min(correct) * 2)\r\nfor i in range(len(wrong)):\r\n\tif wrong[i] <= limit:\r\n\t\tprint(\"-1\")\r\n\t\texit(0)\r\nfor i in range(len(correct)):\r\n\tif correct[i] > limit:\r\n\t\tprint(\"-1\")\r\n\t\texit(0)\r\nprint(limit)", "n,m=map(int,input().split())\r\na=sorted(map(int,input().split()))\r\nb=sorted(map(int,input().split()))\r\nif max(a[0]*2,a[-1])<b[0]: print(max(a[0]*2,a[-1]))\r\nelse: print(-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\na=sorted([int(i) for i in input().split()])\r\nb=sorted([int(i) for i in input().split()])\r\nif(max(2*a[0],a[n-1])>=b[0]):\r\n print(-1)\r\nelse:\r\n print(max(2*a[0],a[n-1]))", "n, m = list(map(int, input().strip().split()))\nac = set(map(int, input().strip().split()))\nwa = set(map(int, input().strip().split()))\nv = max(max(ac), min(ac)*2)\nif v < min(wa):\n print(v)\nelse:\n print(-1)\n", "x = input().split()\nn, m = map(int, x)\n\nr_ans = input().split()\nr_ans = list(map(int, r_ans))\nr_ans.sort()\n\nw_ans = input().split()\nw_ans = list(map(int, w_ans))\nw_ans.sort()\n\nans = -1\nv = min(r_ans)\np = max(r_ans)\nc = min(w_ans)\n\nif max([2*v, p])<c:\n print (max([2*v, p]))\nelse:\n print (-1)\n", "n, m = map(int, input().strip().split())\ncor = list(map(int, input().strip().split()))\nincor = list(map(int, input().strip().split()))\nmin_cor = min(cor)\nmax_cor = max(cor)\nmin_incor = min(incor)\nfor v in range(max_cor, min_incor):\n\tif min_cor*2 <= v:\n\t\texit(print(v))\nprint(-1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nif max(min(a)*2,max(a))<min(b):\r\n print(max(min(a)*2,max(a)))\r\nelse:\r\n print(-1)", "# your code goes here\r\n\r\nstr = input()\r\nL = str.split()\r\nn = int(L[0])\r\nm = int(L[1])\r\n\r\nstr = input()\r\nL = str.split()\r\nmax1 = int(L[0])\r\nmin1 = int(L[0])\r\n\r\ni = 0\r\n\r\nwhile i<n:\r\n if max1 < int (L[i]):\r\n max1 = int (L[i])\r\n if min1 > int (L[i]):\r\n min1 = int (L[i])\r\n i+=1\r\n\r\nstr = input()\r\nL = str.split()\r\n\r\nmin = int(L[0])\r\n\r\ni = 0\r\n\r\nwhile i<m:\r\n if min > int (L[i]):\r\n min = int (L[i])\r\n i+=1\r\n\r\ni=0\r\n\r\nflag = False\r\nif max1 < min :\r\n i = max1\r\n while i<min:\r\n if 2*min1<=i:\r\n print (i)\r\n flag = True\r\n i=min+1\r\n i+=1\r\n\r\nif flag == False:\r\n print (\"-1\")\r\n\r\n\r\n", "def main():\r\n n, m = map(int, input().split())\r\n arr1 = list(map(int, input().split()))\r\n arr2 = list(map(int, input().split()))\r\n\r\n\r\n for i in range(1, min(arr2)):\r\n extra = False\r\n allgood = True\r\n for j in arr1:\r\n if j > i:\r\n allgood = False\r\n break\r\n\r\n if 2 * j <= i:\r\n extra = True\r\n\r\n if allgood and extra:\r\n print(i)\r\n exit()\r\n\r\n print(-1)\r\n\r\n\r\nmain()", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\nif a[-1]>=b[0]:\r\n print(-1)\r\nelif max(2*a[0], a[-1])<b[0]:\r\n print(max(2*a[0], a[-1]))\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\nr = sorted(list(map(int,input().split())))\r\nw = sorted(list(map(int,input().split())))\r\n\r\nif r[-1] >= w[0] :\r\n print(-1)\r\n\r\nelif 2*r[0] >= w[0] :\r\n print(-1)\r\n \r\nelse :\r\n v = r[-1] \r\n\r\n while 2*r[0] > v :\r\n v += 1\r\n \r\n if w[0] <= v :\r\n print(-1)\r\n exit()\r\n else :\r\n print(v) \r\n", "\r\ndef solution():\r\n\tn,m=map(int,input().split())\r\n\tacc=list(map(int,input().split()))\r\n\twa=list(map(int,input().split()))\r\n\tmn=min(acc)\r\n\tmx=max(acc)\r\n\r\n\tsol=max(2*mn, mx)\r\n\tif min(wa)>sol:\r\n\t\tprint(sol)\r\n\telse:\r\n\t\tprint(-1)\r\n\t\r\n\t\r\n\r\n\r\n\treturn\r\n\t\r\n\t\r\n\r\n\r\n\r\nsolution()", "n,m=map(int,input().split());l=sorted(list(map(int,input().split())))\r\nb=sorted(list(map(int,input().split())));mi=102\r\nfor i in range(b[0]-1,-1,-1):\r\n\tk=0\r\n\tfor j in range(n):\r\n\t\tif 2*l[j]<=i:k+=1;break\r\n\tfor j in range(n):\r\n\t\tif i>=l[j] :k+=1\r\n\tif k==(n+1):mi=min(i,mi)\r\nif mi!=102:print(mi)\r\nelse:print(-1)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\nx = min(a)\r\nv = 2*x\r\n\r\nfor elem in a:\r\n if elem > v:\r\n v += abs(elem-v)\r\n\r\nfor elem in b:\r\n if v < elem:\r\n continue\r\n else:\r\n print(-1)\r\n break\r\nelse:\r\n print(v)\r\n", "n, m = map(int, input().split())\r\na = [int(k) for k in input().split()]\r\nb = [int(f) for f in input().split()]\r\nv = max(max(a), min(a) * 2)\r\nif v < min(b):\r\n print(v)\r\nelse:\r\n print(-1)", "import sys\r\nfrom math import *\r\nfrom collections import Counter, defaultdict, deque\r\ninput = sys.stdin.readline\r\nmod = 10**9+7\r\nn, m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nmin_corr = min(a)\r\nmax_corr = max(a)\r\nmin_wrong = min(b)\r\nif (max(2*min_corr, max_corr) < min_wrong):\r\n ans = max(2*min_corr, max_corr)\r\nelse:\r\n ans = -1\r\nprint(ans)\r\n", "input_string = list(map(int, input().split()))\r\ncorrectTimes = list(map(int, input().split()))\r\nwrongTimes = list(map(int, input().split()))\r\n\r\nv = max(min(correctTimes) * 2, max(correctTimes))\r\n\r\nfor time in wrongTimes:\r\n if (time <= v):\r\n print(\"-1\")\r\n exit(0)\r\nprint(v)\r\n", "n,m = map(int,input().split())\r\nall_a=list(map(int,input().split()))\r\nall_b=list(map(int,input().split()))\r\n\r\nmaxi = max(all_a)\r\nmini= min(all_a)\r\n\r\noverall_max = max(2*mini,maxi)\r\n \r\nmini_b = min(all_b)\r\nif overall_max < mini_b:\r\n print(overall_max)\r\nelse:\r\n print(-1)", "n,m = input().split()\r\ncor = [int(x) for x in input().split()]\r\ninc = [int(x) for x in input().split()]\r\n\r\na = max(2*min(cor), max(cor))\r\nb = min(inc)\r\n\r\nif a < b:\r\n print(a)\r\nelse:\r\n print(-1)", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nmax1=max(a)\r\nmin1=min(a)\r\nmin2=min(b)\r\n\r\nif min1*2>=max1:\r\n\tif min1*2<min2:\r\n\t\tprint(min1*2)\r\n\telse:\r\n\t\tprint(-1)\r\nelse:\r\n\tif max1<min2:\r\n\t\tprint(max1)\r\n\telse:\r\n\t\tprint(-1)\r\n", "_ = input()\r\npos = list(map(int, input().split()))\r\nneg = list(map(int, input().split()))\r\nposMax = max(pos)\r\nnegMin = min(neg)\r\nif posMax >= negMin:\r\n print(-1)\r\nelse:\r\n posMin = min(pos)\r\n r = max(2 * posMin, posMax) \r\n print(r if r < negMin else -1)", "n,m = list(map(int,input().split(\" \")))\r\ncorrect = sorted(list(map(int,input().split(\" \"))))\r\nincorrect = sorted(list(map(int,input().split(\" \"))))\r\nv_max=incorrect[0]\r\nv_min=correct[-1]\r\nif correct[0]*2<=v_min:pass\r\nelse:v_min=correct[0]*2\r\nif v_min>=v_max:print(-1)\r\nelse:print(v_min)", "#t=int(input())\r\nm=1000000007\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nr=list(map(int,input().split()))\r\nk=max(l)\r\nt=min(l)\r\np=min(r)\r\nk=max(k,2*t)\r\nif p>k:\r\n print(k)\r\nelse:\r\n print('-1')\r\n", "n, m=map(int, input().split())\r\n\r\n\r\ncorr=input().split()\r\nz=[int(x) for x in corr]\r\n\r\nwrong=input().split()\r\nz1=[int(y) for y in wrong]\r\n\r\ncount=0\r\nkeys=[]\r\nfor key in range (max(z),min(z1)):\r\n for i in range (0,len(z)):\r\n if (2*z[i]<=key):\r\n count+=1\r\n if (count>=1):\r\n keys.append(key)\r\n\r\n\r\nif (len(keys)==0):\r\n print (-1)\r\nelse:\r\n print (min(keys))\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n\r\n", "n,m=map(int,input().split())\r\na=sorted(map(int,input().split()))\r\nb=sorted(map(int,input().split()))\r\nt=max(a[0]*2,a[-1])\r\nif b[0]<=t:print(-1)\r\nelse:print(t)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nq=min(a)\r\nw=max(2*q,max(a))\r\nif w>=min(b):\r\n print(-1)\r\nelse:\r\n print(w)", "n,m=map(int,input().split());a=list(map(int,input().split()));b=list(map(int,input().split()))\r\np,q,v=max(a),min(b),min(a)\r\nif max(p,2*v) < q:\r\n print(max(p,2*v))\r\nelse:\r\n print(-1)", "I=lambda:map(int,input().split())\r\nI()\r\na = sorted(list(I()))\r\nb = list(I())\r\nans = max(2*a[0],a[-1])\r\nprint([-1 , ans][ans < min(b)])", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = max(2*min(a), max(a))\r\nd = min(b)\r\nif c >= d:\r\n\tprint(-1)\r\nelse:\r\n\tprint(c)\r\n", "n , m = list(map(int,input().split()))\r\n\r\nn_test = list(map(int,input().split()))\r\nm_test = list(map(int,input().split()))\r\nd = min(min(n_test),min(m_test))\r\nu = max(max(n_test),max(m_test))\r\n\r\nfor i in range(d,u+1):\r\n ac = 0\r\n extra = 0\r\n for a in n_test:\r\n if a <= i:\r\n ac+=1\r\n if a*2 <=i:\r\n extra+=1\r\n bc = 0\r\n for b in m_test:\r\n if b > i:\r\n bc+=1\r\n k = []\r\n if ac == n and bc == m and extra >= 1 :\r\n k.append(i)\r\n print(i)\r\n break\r\nif len(k) == 0:\r\n print(-1)", "n, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nans = max(max(A), min(A) * 2)\r\nif min(B) <= ans:\r\n\tprint(-1)\r\nelse:\r\n\tprint(ans)", "input()\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nv=max(2*min(a),max(a))\r\nif v>=min(b):\r\n print(-1)\r\nelse:\r\n print(v)", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\na = sorted(a)\r\nb = sorted(b)\r\n\r\nmin_v = max(max(a), 2 * min(a))\r\nif min_v >= min(b):\r\n print(-1)\r\nelse:\r\n print(min_v)", "# author: violist\n# created: 22.04.2021 16:11:50\n\nimport sys\ninput = sys.stdin.readline\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nif max(2 * min(a), max(a)) < min(b):\n print(max(2 * min(a), max(a)))\nelse:\n print(-1)\n", "n, m = [int(i) for i in input().split()]\r\naccept = [int(i) for i in input().split()]\r\nreject = [int(i) for i in input().split()]\r\naccept_min, accept_max = min(accept), max(accept)\r\nreject_min = min(reject)\r\nresult = max(2 * accept_min, accept_max)\r\nif result >= reject_min:\r\n result = -1\r\nprint(result)", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn,m=rinput()\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nma = max(a)\r\nmb = min(a)*2\r\n\r\nans = max(ma, mb)\r\n\r\nif ans<min(b):\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n, m = [int(x) for x in input().split()]\r\ncorrectSolutions = list(map(int, input().split()))\r\nwrongSolutions = list(map(int, input().split()))\r\n\r\nmaxCorrect = max(correctSolutions)\r\nvRange = range(maxCorrect, min(wrongSolutions))\r\nif len(vRange) > 0:\r\n b = min(correctSolutions) * 2\r\n if b in vRange:\r\n result = b\r\n elif b < maxCorrect:\r\n result = maxCorrect\r\n else:\r\n result = -1\r\nelse:\r\n result = -1\r\n\r\nprint(result)\r\n", "from collections import Counter\nfrom math import ceil\n\ndef main():\n n, m = map(int, input().split())\n correct = [int(x) for x in input().split()]\n wrong = (int(x) for x in input().split())\n cor_min = min(correct)\n cor_max = max(correct)\n possible = max(cor_min*2, cor_max)\n if possible >= min(wrong):\n print(-1)\n else:\n print(possible)\n\n\nmain()\n", "a, b = list(map(int, input().split()))\r\na1 = list(map(int, input().split()))\r\nb1 = list(map(int, input().split()))\r\nv = min(a1)\r\nbm = min(b1)\r\n\r\namin = max(a1)\r\n# for i in b1:\r\n# if 2*i>2*v:\r\n# c+=1\r\n\r\nif max(v*2,amin)<bm:\r\n print(max(v*2,amin))\r\nelse:\r\n print(-1)\r\n# v = max(a1)\r\n# bm = min(b1)\r\n# # print(bm,v)\r\n# c = 0\r\n# if len(a1)>1:\r\n# for i in a1:\r\n# if 2*i<=v:\r\n# c+=1\r\n# else:\r\n# c = 1\r\n#\r\n# d = 0\r\n# for i in b1:\r\n# if i>v:\r\n# d+=1\r\n#\r\n# if len(a1)==1:\r\n# print(2*v)\r\n# elif c>=1 and d == len(b1):\r\n# print(v)\r\n# else:\r\n# print(-1)", "n, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\na.sort()\r\nb.sort()\r\n\r\nTL = a[0] * 2\r\n\r\nif TL < a[-1]:\r\n TL = a[-1]\r\n\r\nfor num in b:\r\n if num <= TL:\r\n print(-1)\r\n break\r\nelse:\r\n print(TL)\r\n", "input()\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\na_min, b_min = min(a), min(b)\r\na_max, b_max = max(a), max(b)\r\n\r\nif a_min * 2 >= b_min or b_min <= a_max:\r\n\tprint(\"-1\")\r\nelif a_max >= a_min * 2:\r\n\tprint(a_max)\r\nelse:\r\n\tprint(a_min * 2)", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nmx = max(min(a) * 2, max(a))\r\nif min(b) > mx:\r\n print(mx)\r\nelse:\r\n print(-1)", "if __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n tine = list(map(int, input().split()))\r\n fine = list(map(int, input().split()))\r\n too = max(2 * min(tine), max(tine))\r\n foo = min(fine)\r\n print(too) if too < foo else print(-1)\r\n", "def main():\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n b=list(map(int,input().split()))\r\n ash=al=a[0]\r\n\r\n for i in range(1,n):\r\n if ash>a[i]:\r\n ash=a[i]\r\n if al<a[i]:\r\n al=a[i]\r\n\r\n \r\n bs=b[0]\r\n for i in range(1,m):\r\n if bs>b[i]:\r\n bs=b[i]\r\n else:\r\n continue\r\n\r\n \r\n v=al\r\n if v<2*ash:\r\n v=2*ash\r\n\r\n if v<bs:\r\n print(v)\r\n return\r\n \r\n print(-1)\r\n return\r\n \r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "string = input()\r\nnumbers = string.split()\r\na = int(numbers[0])\r\nb = int(numbers[1])\r\nstring = input()\r\nright = list(map(int, string.split()))\r\nstring = input()\r\nwrong = list(map(int, string.split()))\r\np = max(right)\r\nq = min(wrong)\r\nr = min(right)\r\nfor x in range(p, q):\r\n if r * 2 <= x:\r\n print(x)\r\n break\r\nelse:\r\n print(-1)", "n, m = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\nbrr = [int(x) for x in input().split()]\r\n\r\nx = min(arr)\r\ny = max(arr)\r\nM = min(brr)\r\nif x*2 < M and y < M:\r\n print(max(y, x*2))\r\nelse:\r\n print(-1)", "def solve():\r\n n, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n\r\n tl = max(max(a), min(a) * 2)\r\n return -1 if tl >= min(b) else tl\r\n\r\nprint(solve())", "import itertools\r\nimport math\r\nfrom collections import defaultdict\r\n\r\ndef input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n n, m = input_ints()\r\n a = input_ints()\r\n b = min(input_ints())\r\n x = max(2*min(a), max(a))\r\n if x >= b:\r\n x = -1\r\n print(x)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "ac,wa=list(map(int,input().split()))\r\nAC=list(map(int,input().split()))\r\nWA=list(map(int,input().split()))\r\nAC.sort()\r\nWA.sort()\r\nfound=0\r\nfor j in range(AC[-1],WA[0]):\r\n tl=j\r\n if 2*AC[0]<=tl:\r\n found=1\r\n break\r\nif found==1:\r\n print(tl)\r\nelse:\r\n print(-1)\r\n", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\na=min(l1)\r\nb=max(l1)\r\nc=min(l2)\r\nd=max(2*a,b)\r\nif d>=c:\r\n print(-1)\r\nelse:\r\n print(d)\r\n \r\n \r\n \r\n \r\n", "n,m=[int(i) for i in input().split()]\r\nl1=[int(i) for i in input().split()]\r\nl2=[int(i) for i in input().split()]\r\nif max(l1)<min(l2):\r\n if 2*min(l1)<=max(l1):\r\n print(max(l1))\r\n else :\r\n if 2*min(l1)<min(l2):\r\n print(2*min(l1))\r\n else :\r\n print(-1)\r\nelse :\r\n print(-1)", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nx=min(l1)\r\ny=max(l1)\r\nres=max(2*x,y)\r\n#print(res)\r\nif res<min(l2):\r\n print(res)\r\nelse:\r\n print(-1)", "# https://codeforces.com/problemset/problem/350/A\r\n\r\n\"\"\"\r\nn correct solutions\r\nm wrong solutions\r\n\r\nFor each solution we know the running time.\r\nSet the time limit for each solution as v seconds. If your run time is a then\r\n * You pass if a<= v\r\n * You pass with extra time if 2a <= v\r\n\r\nFind v such that:\r\n 1. v is a positive integer (can't be 0)\r\n 2. All correct solutions pass the testing\r\n 3. At least one correct solution passes with extra time\r\n 4. All wrong solutions do not pass the system testing\r\n 5. v is minimal. (In other words there is no smaller v which satisfies 1-4)\r\n\r\n\"\"\"\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nmax_a, min_a = max(a), min(a)\r\nmax_b, min_b = max(b), min(b)\r\n\r\ncrit_time = max(max_a, 2*min_a)\r\n\r\nif crit_time >= min_b:\r\n print(-1)\r\nelse:\r\n print(crit_time)\r\n", "n, m = [int(x) for x in input().split()]\r\ncor = [int(x) for x in input().split()]\r\nwor = [int(x) for x in input().split()]\r\nif min(wor) <= max(cor) or min(wor) <= 2*min(cor):\r\n print(-1)\r\n exit()\r\nprint(max(max(cor), 2*min(cor)))", "'''\r\nINPUT SHORTCUTS\r\nN, K = map(int,input().split())\r\nN ,A,B = map(int,input().split())\r\nstring = str(input())\r\narr = list(map(int,input().split()))\r\nN = int(input())\r\n'''\r\n\r\n\r\ndef main():\r\n\tN, K = map(int,input().split())\r\n\tarr = list(map(int,input().split()))\r\n\tarr2 = list(map(int,input().split()))\r\n\ta = max(max(arr),2*(min(arr)))\r\n\tif a<min(arr2):\r\n\t\tprint(a)\r\n\telse:\r\n\t\tprint(-1)\r\nmain()", "n,m=list(map(int,input().split()))\ncorrect=list(map(int,input().split()))\nwrong=list(map(int,input().split()))\ncorrect.sort()\nwrong.sort()\nTL=correct[0]\nif TL*2>correct[-1]:\n\tTL=TL*2\nelse:\n\tTL=correct[-1]\n#print(correct,wrong,TL)\nif TL<wrong[0]:\n\tprint(TL)\nelse:\n\tprint(-1)\n\n", "'''input\n3 1\n3 4 5\n6\n\n'''\nn, m = map(int, input().split())\na, b = list(map(int, input().split())), list(map(int, input().split()))\nt = max(2*min(a), max(a))\nprint(t if t < min(b) else -1)", "A=input().split()\r\nn=int(A[0])\r\nm=int(A[1])\r\na=input().split()\r\nb=input().split()\r\nfor i in range(len(a)):\r\n a[i]=int(a[i])\r\nfor i in range(len(b)):\r\n b[i]=int(b[i])\r\nif(max(a)>=min(b) or 2*min(a)>=min(b)):\r\n print(\"-1\")\r\nelse:\r\n print(max(max(a),2*min(a)))", "'''def sol(n,m,k,arr):\n for i in range(n-1):\n if m<0:\n print(\"NO\")\n return\n m+=arr[i]-max(0,(arr[i+1]-k))\n if m<0:\n print(\"NO\")\n else:\n print('YES')\n\nt = int(input())\nfor _ in range(t):\n n, m, k = map(int, input().split())\n arr = list(map(int, input().split()))\n sol(n,m,k,arr)\n '''\n'''import collections\ndeq = collections.deque()\nt = int(input())\narr = list(map(int, input().split()))\narr.sort()\nfor i in range(t):\n if i%2==0:\n deq.append(arr[i])\n else:\n deq.appendleft(arr[i])\ns=''\nfor i in deq:\n s+=str(i)+' '\nprint(s)'''\ndef sol():\n for i in arrm:\n if TL>=i:\n print(-1)\n return\n print(TL)\n\nn, m = map(int, input().split())\narrn = list(map(int, input().split()))\narrm = list(map(int, input().split()))\nTL = max(2*min(arrn), max(arrn))\nsol()", "n , m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\n\r\nv = max(a)\r\nd = min(a)\r\ne = min(b)\r\n\r\nif max(2 * d, v) < e:\r\n print(max(2 * d, v))\r\nelse:\r\n print(-1)", "n,m= map(int, input().split())\r\nac= list(map(int, input().split()))\r\nwa= list(map(int, input().split()))\r\n\r\nwa.sort()\r\nac.sort()\r\n\r\nif ac[0]*2<=ac[-1] and ac[-1]<wa[0]:\r\n print(ac[-1])\r\nelif ac[0]*2>ac[-1] and ac[0]*2<wa[0]:\r\n print(2*ac[0])\r\nelif ac[0]*2>=wa[0]:\r\n print(-1)\r\nelse:\r\n print(-1)\r\n \r\n", "import operator as op\r\nimport re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom functools import reduce\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\ndef def_value():\r\n return 0\r\n\r\n\r\nn, m = invr()\r\nc = inlist()\r\nw = inlist()\r\n\r\nminC = min(c)\r\nmaxC = max(c)\r\nminW = min(w)\r\n\r\nv = maxC\r\nif 2 * minC > v:\r\n v = 2 * minC\r\nif minW <= v:\r\n print(-1)\r\nelse:\r\n print(v)\r\n", "#A. TL\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nx = min(b)\r\ny = max(a)\r\nextra = 2*min(a)\r\nif extra<=y and y<x:\r\n print(y)\r\nelse:\r\n flag = False\r\n for i in range(y,x):\r\n if i>=extra:\r\n flag = True\r\n print(i)\r\n break\r\n if not flag:\r\n print(-1)", "n,m=map(int,input().split(' '))\r\na=list(map(int,input().split(' ')))\r\nb=list(map(int,input().split(' ')))\r\na.sort()\r\nb.sort()\r\nif(a[-1]>=b[0] or a[0]*2>=b[0]):\r\n print(-1)\r\nelse:\r\n print(max(2*a[0],a[-1]))", "#code\r\n#code\r\nn,m = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\np = list(map(int,input().split()))\r\n\r\nt = max(l)\r\nif min(l)>t/2:\r\n t = 2*min(l)\r\n \r\nif t<min(p):\r\n print(t)\r\nelse:\r\n print(\"-1\")\r\n \r\n \r\n ", "# coding: utf-8\nn, m = [int(i) for i in input().split()]\ncorrect = [int(i) for i in input().split()]\nwrong = [int(i) for i in input().split()]\nlow = max(2*min(correct),max(correct))\nup = min(wrong)\nif low < up:\n print(low)\nelse:\n print(-1)\n", "n,m=map(int,input().split())\r\na=[int(_) for _ in input().split()]\r\nb=[int(_) for _ in input().split()]\r\nv1=max(min(a)*2,max(a))\r\nv2=min(b)\r\nif v1<v2: print(v1)\r\nelse : print(-1)\r\n ", "n, m = map(int, input().split())\r\n\r\ncorrect = list(map(int, input().split()))\r\nwrong = list(map(int, input().split()))\r\n\r\nif min(wrong) <= max(correct) or min(wrong) <= 2 * min(correct):\r\n print(-1)\r\nelse:\r\n print(max(2 * min(correct), max(correct)))", "input().split()\na=list(map(int, input().split()))\nb=list(map(int, input().split()))\np=-1\ns=max(2*min(a), max(a))\nif s<min(b):\n\tp=s\nprint(p)", "import string\r\n\r\nalph = string.ascii_lowercase\r\n\r\n\r\ndef main():\r\n n,m = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n a.sort()\r\n b.sort()\r\n if 2 * a[0] >= a[n-1]:\r\n if 2*a[0]<b[0]:\r\n print(2*a[0])\r\n else:\r\n print(-1)\r\n else:\r\n if a[n-1] < b[0]:\r\n print(a[n-1])\r\n else:\r\n print(-1)\r\nif __name__ == \"__main__\":\r\n main()", "def func(n,m,x,y):\r\n t=max(x)\r\n a=min(x)*2\r\n t=max(t,a)\r\n for i in y:\r\n if i<=t:\r\n return -1\r\n return t\r\n\r\nn,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nprint(func(x,m,x,y))\r\n", "n,m=map(int,input().split())\r\na=[]\r\na[0:n]=map(int,input().split())\r\nb=[]\r\nb[0:m]=map(int,input().split())\r\naa=min(a)\r\nv=max(a)\r\nc=min(b)\r\nif max(2*aa,v)<c:\r\n print(max(2*aa,v))\r\nelse:\r\n print(-1)", "l=list(map(int,input().split()))\r\nn,m=l[0],l[1]\r\nr=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\ndawnmax=max(2*min(r),max(r))\r\nblancamin=min(w)\r\nif blancamin<=dawnmax:\r\n print(-1)\r\nelse:\r\n print(dawnmax)\r\n\r\n", "def TL():\r\n n,m = map(int, input().split())\r\n correctSol_time = list(map(int,input().split()))\r\n incorrectSol_time = list(map(int ,input().split()))\r\n\r\n soretd_correctTime = sorted(correctSol_time)\r\n\r\n v_gte1 = 2*soretd_correctTime[0]\r\n v_gte2 = soretd_correctTime[len(soretd_correctTime)-1]\r\n\r\n v_gte = max(v_gte1,v_gte2)\r\n\r\n v_lt = min(incorrectSol_time)\r\n v_lte = v_lt - 1\r\n\r\n if v_gte <= v_lte:\r\n print(v_gte)\r\n else:\r\n print(-1)\r\n\r\nTL()", "x=list(map(int,input().split()))\r\nn=x[0]\r\nm=x[1]\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nv=max(2*min(a),max(a))\r\nk=min(b)\r\nif(v<k):\r\n print(v)\r\nelse:\r\n print(-1)\r\n", "n,m=map(int,input().split())\r\nnums=list(map(int,input().split()))\r\nms=list(map(int,input().split()))\r\nma=min(ms)\r\nans=0\r\nfor i in range(max(nums),ma):\r\n if 2*(min(nums))<=i:\r\n print(i)\r\n ans+=1\r\n break\r\nif ans==0:\r\n print(-1) \r\n", "data = input().split()\nN, M = int(data[0]), int(data[1])\n\ncorrect = list(map(int, input().split()))\nwrong = list(map(int, input().split()))\n\nV = min(correct)\nP = max(correct)\nC = min(wrong)\n\nif max(2 * V, P) < C:\n print(max(2 * V, P))\nelse:\n print('-1')\n", "i=lambda:list(map(int,input().split()))\r\ni()\r\na=i()\r\nb=i()\r\np=-1\r\nfor i in range(max(a),min(b)):\r\n if 2*min(a)<=i:\r\n p=i\r\n break\r\nprint(p)", "def tl(arr1,arr2):\r\n M = max(arr1)\r\n m = min(arr2)\r\n for i in arr2:\r\n if i <= M:\r\n return -1\r\n for i in arr1:\r\n if i*2<=M:\r\n return M\r\n for i in sorted(arr1):\r\n if i * 2 < m and i*2 > M:\r\n return i * 2\r\n return -1\r\n\r\nn = input()\r\narr1 = list(map(int,input().split()))\r\narr2 = list(map(int,input().split()))\r\nprint(tl(arr1,arr2))\r\n", "n, m = map(int, input().split())\ncorrectSolRunningTime = list(map(int, input().split()))\nwrongSolRunningTime = list(map(int, input().split()))\ncorrectSolRunningTime.sort()\nwrongSolRunningTime.sort()\ntimeMinimum = max(2 * correctSolRunningTime[0], correctSolRunningTime[n-1])\nif wrongSolRunningTime[0] <= timeMinimum:\n print(-1)\nelse:\n print(timeMinimum)\n", "def time_limit(n,l,k):\r\n if max(min(l)*2,max(l))<min(k):\r\n return max(min(l)*2,max(l))\r\n return -1\r\n\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nprint(time_limit(n,l,k))", "n,m = map(int,input().split())\n\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\na.sort()\nmiB = min(b)\nv = 2*a[0]\nif v<=a[-1]:\n if miB>a[-1]:\n print(a[-1])\n else:\n print(-1)\nelse:\n l = a[-1]\n while l<v:\n l+=1\n v = l\n if miB>v:\n print(v)\n else:\n print(-1)", "get=lambda:list(map(int,input().split()))\r\nn,m=get()\r\na=get() \r\nx=max(min(a)*2, max(a))\r\nprint(x if min(get())>x else -1)", "n, m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nflag = False\r\nfor i in range(100):\r\n if (i < min(b)) and (i >= max(a)) and (i >= min(a) * 2):\r\n if not(flag): \r\n print(i)\r\n flag = True\r\nif not(flag):\r\n print(-1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nmina=min(a)\r\nmaxa=max(a)\r\nminb=min(b)\r\nif maxa>=minb:\r\n print(\"-1\")\r\nelif 2*mina>=minb:\r\n print(\"-1\")\r\nelif 2*mina<=maxa:\r\n print(maxa)\r\nelse:\r\n print(2*mina)\r\n \r\n ", "n, m = map(int, input().split())\na = list(set(map(int, input().split())))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\np = 0\nif 2*min(a) <= max(a):\n p = max(a)\nelse :\n p = 2*min(a)\nif b[0] > p:\n print(p)\nelse :\n print(-1)", "n,m = list(map(int,input().split()))\r\nsuccess = set(map(int,input().split()))\r\nsuccess = list(success)\r\nunsuccess = set(map(int,input().split()))\r\nunsuccess = list(unsuccess)\r\n\r\nmxSuccess = max(success)\r\nminSuccess = min(success)\r\nminUnSuccess = min(unsuccess)\r\nf = False\r\n\r\nif mxSuccess>minUnSuccess:\r\n print(-1)\r\n\r\nelse:\r\n while mxSuccess<minUnSuccess:\r\n if minSuccess*2<=mxSuccess:\r\n f = True\r\n break\r\n else:\r\n mxSuccess=minSuccess*2\r\n if f:\r\n print(mxSuccess)\r\n else:\r\n print(-1)\r\n\r\n\r\n", "n,m=map(int,input().split())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nt1,t2=max(a),min(a)\r\nt1=max(t1,2*t2)\r\nt3=min(b)\r\nif t1<t3 and 2*t2<=t1:print(t1)\r\nelse:print(-1)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nv=min(a)\r\np=max(a)\r\nc=min(b)\r\nd=max(2*v,p)\r\nif(d<c):\r\n print(d)\r\nelse:\r\n print(\"-1\")", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nif (max(a)<min(b) and 2*min(a)<min(b)):\r\n print( max(max(a), 2*min(a)))\r\nelse: \r\n print(-1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nv=min(a)\r\np=max(a);c=min(b)\r\nprint(max(2*v,p)if max(2*v,p)<c else -1)\r\n", "read=lambda:map(int,input().split())\r\nn,m=read()\r\na=list(read())\r\nb=list(read())\r\nlow=max(a)\r\nhigh=min(b)-1\r\nt=min(a)\r\nif low>high:\r\n print(-1)\r\nelse:\r\n result=-1\r\n for i in range(low,high+1):\r\n if t*2<=i:\r\n result=i\r\n break\r\n print(result)\r\n", "n,m = map(int,input().split())\r\n\r\nli = list(map(int,input().split()))\r\nmi = list(map(int,input().split()))\r\n\r\na = min(li)\r\nv = 2*a\r\nfor data in li:\r\n if v<data:\r\n v=data\r\n else:\r\n pass\r\nfor data in mi:\r\n if v>=data:\r\n v=-1\r\n else:\r\n pass\r\nprint(v)\r\n\r\n", "cin=lambda : list(map(int,input().split()))\r\nn,m =cin() \r\na = cin()\r\nb = cin()\r\nprint(max(2*min(a),max(a)) if max(2*min(a),max(a)) < min(b) else \"-1\")", "n, m = map(int, input().split())\r\nac = list(map(int, input().split()))\r\nwa = list(map(int, input().split()))\r\nac = sorted(ac)\r\nwa = sorted(wa)\r\nif ac[0]*2 >= wa[0] or ac[-1] >= wa[0]:\r\n print(-1)\r\nelse:\r\n print(max(ac[0]*2, ac[-1]))\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\n\"\"\"v=max(a)\r\nf=min(b)\r\ne=min(a)*2\r\nif f<=v:\r\n print(-1)\r\n exit()\r\n\"\"\"\r\ne,v=a[0],a[-1]\r\nfor i in range(1,101):\r\n if i>=2*e and i>=v and i<b[0]:\r\n print(i)\r\n exit()\r\n if i>=b[0]:\r\n print(-1)\r\n break\r\n", "n,m=list(map(int,input().split()));ok=1;a=list(map(int,input().split()));b=list(map(int,input().split()))\r\nfor i in range(n):\r\n if(max(max(a),a[i]*2)<min(b)):\r\n print(max(max(a),a[i]*2));ok=0;break\r\nif(ok):print('-1')", "from sys import stdin, stdout\r\n\r\nnm = list(map(int, stdin.readline().strip().split()))\r\nn = nm[0]\r\nm = nm[1]\r\ncorrect_time = list(map(int, stdin.readline().strip().split()))\r\nincorrect_time = list(map(int, stdin.readline().split()))\r\ntl = -1\r\nfor i in range(max(correct_time), min(incorrect_time)):\r\n if i >= 2 * min(correct_time):\r\n tl = i\r\n break\r\n\r\nstdout.write(str(tl))", "# for _ in range(int(input())):\nn,m=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\ns=max(2*min(a),max(a))\nif s>=min(b):\n print(-1)\nelse:\n print(s)\n", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nv=min(l1)\r\np=max(l1)\r\nc=min(l2)\r\nif max(2*v,p)<c:\r\n\tprint(max(2*v,p))\r\nelse:\r\n\tprint(-1)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Dec 26 13:13:04 2018\n\n@author: alexis\n\"\"\"\n\ndata = input().split()\nN, M = int(data[0]), int(data[1])\n\ncorrect = list(map(int, input().split()))\nwrong = list(map(int, input().split()))\n\nmin_wrong_time = min(wrong)\n\npossible_TLs = [i+1 for i in range(min_wrong_time-1)]\n\nTL_solutions = []\nfor i in range(len(possible_TLs)):\n if all(e <= possible_TLs[i] for e in correct):\n TL_solutions.append(possible_TLs[i])\n \nif len(TL_solutions) == 0:\n print('-1')\nelse:\n TLs = []\n for i in range(len(TL_solutions)):\n if any(2*e <= TL_solutions[i] for e in correct):\n TLs.append(TL_solutions[i])\n if len(TLs) == 0:\n print('-1')\n else:\n print(min(TLs))\n\n", "x = input()\r\na = input()\r\nb = input()\r\ncorrectAnswers = a.split()\r\nwrongAnswers = b.split()\r\n# print(correctAnswers)\r\n# print(wrongAnswers)\r\ncorrectAnswers = list(map(int,correctAnswers))\r\nwrongAnswers = list(map(int,wrongAnswers))\r\n# print(correctAnswers)\r\n# print(wrongAnswers)\r\na = min(correctAnswers)\r\nb = max(correctAnswers)\r\nc = min(wrongAnswers)\r\n# print(a,b,c)\r\nv = max(2*a,b)\r\nif(v<c):\r\n print(v)\r\nelse:\r\n print(-1)", "I=lambda:list(map(int,input().split()))\r\nn,m=I()\r\na=I()\r\nx=max(min(a)*2,max(a))\r\nprint(x if min(I())>x else -1)", "correctNo, wrongNo = map(int,input().strip().split(\" \"))\r\nCorrect = list(map(int, input().strip().split(\" \")))\r\nWrong = list(map(int, input().strip().split(\" \")))\r\n\r\nminW = min(Wrong)\r\nminC = min(Correct)\r\nmaxC = max(Correct)\r\n\r\nif maxC >= 2*minC :\r\n if maxC < minW :\r\n print(maxC)\r\n else:\r\n print(-1)\r\nelse:\r\n while 2*minC != maxC:\r\n maxC += 1\r\n if maxC < minW:\r\n print(maxC)\r\n else:\r\n print(-1)\r\n\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nfor i in range(max(l1),min(l2)):\r\n for j in range(len(l1)):\r\n if i>=2*l1[j]:\r\n l.append(i)\r\n\r\nif len(l)==0:\r\n print(-1)\r\nelse:\r\n print(min(l))\r\n", "n,m=list(map(int, input(\"\").split()))\r\nar1=list(map(int, input(\"\").split()))\r\nar2=list(map(int, input(\"\").split()))\r\nif(2*min(ar1)<max(ar1)):\r\n v=max(ar1)\r\nelse:\r\n v=2*min(ar1)\r\n\r\nif(v<min(ar2)):\r\n print(v)\r\nelse:\r\n print(-1)", "import math\r\n\r\nt, m = list(map(int, input().split()))\r\ncorrect = list(map(int, input().split()))\r\nincorrect = list(map(int, input().split()))\r\n\r\nif (max(correct) < min(incorrect)) and (min(correct) * 2 < min(incorrect)):\r\n\r\n print(max(max(correct), min(correct)*2))\r\nelse:\r\n print(-1)\r\n", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\na = min(c)\r\ntl = 2*a\r\nfor i in range(len(c)):\r\n if tl >= c[i]:\r\n pass\r\n else:\r\n tl = c[i]\r\nfor i in range(len(w)):\r\n if tl < w[i]:\r\n pass\r\n else:\r\n print(-1)\r\n exit()\r\nprint(tl)", "class CodeforcesTask350ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.correct_times = []\r\n self.wrong_times = []\r\n\r\n def read_input(self):\r\n input()\r\n self.correct_times = [int(x) for x in input().split(\" \")]\r\n self.wrong_times = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n self.correct_times.sort()\r\n self.wrong_times.sort()\r\n if self.correct_times[0] * 2 < self.correct_times[-1]:\r\n solution = self.correct_times[-1]\r\n else:\r\n solution = self.correct_times[0] * 2\r\n if not solution < self.wrong_times[0]:\r\n solution = -1\r\n self.result = str(solution)\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask350ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "n,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nmax_a = max(a)\r\nmin_a = min(a)\r\nmin_b = min(b)\r\nif(max(2*min_a, max_a) < min_b):\r\n print(max(2*min_a, max_a))\r\nelse:\r\n print(-1)", "nm = input().split()\r\nn = int(nm[0])\r\nm = int(nm[1])\r\ncoarr = [int(x) for x in input().split()]\r\nwrarr = [int(x) for x in input().split()]\r\nans = 0\r\nmaxc = max(coarr)\r\nminc = min(coarr)\r\nminw = min(wrarr)\r\nif maxc >= minw:\r\n print(-1)\r\nelse:\r\n if maxc >= 2*minc:\r\n print(maxc)\r\n else:\r\n ans = 2*minc\r\n if ans < minw:\r\n print(ans)\r\n else:\r\n print(-1) \r\n\r\n\r\n \r\n# if max(coarr) >= min(wrarr):\r\n# ans = 2 * min(coarr)\r\n# if ans < min(wrarr):\r\n# print(max(coarr))\r\n# else:\r\n# print(-1)\r\n# else:\r\n# if max(coarr) >= 2 *min(coarr):\r\n# print(max(coarr))\r\n# exit()\r\n# else:\r\n# ans = 2 * min(coarr)\r\n# if ans < min(wrarr):\r\n# print(ans)\r\n# else:\r\n# print(-1) \r\n# BULLSHIT CODE\r\n# u STUPID REVIEW YOUR CODE CAREFULLY U DUMBASS \r\n \r\n \r\n\r\n", "n,m=map(int, input().split())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nv=min(a)\r\np=max(a)\r\nc=min(b)\r\nif max(2*v,p)<c:\r\n print(max(2*v,p))\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif(min(b)<=max(a)):\r\n print(\"-1\")\r\nelse:\r\n r=1000000000\r\n q=0\r\n for i in range(min(b)-1,1,-1):\r\n e=0\r\n f=0\r\n for j in range(n):\r\n if(a[j]<=i):\r\n e=e+1\r\n if((2*a[j])<=i):\r\n f=f+1\r\n if(n==e and f>0):\r\n r=min(r,i)\r\n q=1\r\n if(q==0):\r\n print(\"-1\")\r\n else:\r\n print(r)\r\n ", "nm=input().split()\r\nn=int(nm[0])\r\nm=int(nm[1])\r\ncorrect=list(map(int,input().split()))\r\nwrong=list(map(int,input().split()))\r\npoint4=True\r\nTL=max(2*min(correct),max(correct))\r\nif min(wrong)<=TL:\r\n point4=False\r\nif point4:\r\n print(TL)\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\narr1 = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\ntl = max(max(arr1), min(arr1) * 2)\r\nprint(tl if tl < min(arr2) else -1)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nfor i in range(244):\r\n c1 = 0\r\n c2 = 0\r\n c3 = 0\r\n for aa in a:\r\n if aa <= i: c1+=1\r\n if 2*aa <=i: c2=1\r\n for bb in b:\r\n if bb > i:\r\n c3 +=1\r\n if(c1==n and c2 >0 and c3 == m):\r\n print(i)\r\n break\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\ncorrect_array = list(map(int, input().split()))\r\nincorrect_array = list(map(int, input().split()))\r\n\r\ncorrect_array.sort()\r\nincorrect_array.sort()\r\n\r\n# Check if there is a valid TL value\r\nif correct_array[n - 1] > incorrect_array[0]:\r\n print(-1)\r\nelse:\r\n # Find the minimum valid TL value\r\n found_tl = False\r\n for i in range(correct_array[n - 1], incorrect_array[0]):\r\n if 2 * correct_array[0] <= i:\r\n print(i)\r\n found_tl = True\r\n break\r\n\r\n if not found_tl:\r\n print(-1)\r\n", "x,y = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\no=0\r\nif max(a)>=min(b):\r\n print(-1)\r\nelse:\r\n o = max(max(a),2*min(a))\r\n if o>=min(b):\r\n print(-1)\r\n else:\r\n print(o)", "n,m = map(int,input().split())\r\ncorrect = list(map(int,input().split()))\r\nincorrect = list(map(int,input().split()))\r\nc = max(correct)\r\ninc = min(incorrect)\r\nflag = 1\r\nif c>= inc:\r\n print('-1')\r\n exit(0)\r\nelse:\r\n for i in correct:\r\n if 2*i <= c:\r\n flag = 0\r\n break\r\n if flag:\r\n temp = min(correct)\r\n c =2*temp\r\n if c>=inc:\r\n print('-1')\r\n exit(0)\r\n else:\r\n print(c)", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nupper=min(l2)\r\nlower=max(l1)\r\nif lower>=upper:\r\n print(-1)\r\nelif 2*min(l1)>=lower:\r\n if 2*min(l1)<upper:\r\n print(2*min(l1))\r\n else :\r\n print(-1)\r\nelse :\r\n print(lower)\r\n ", "n,m=list(map(int,input().split()))\r\nA=list(map(int,input().split()))\r\nB=list(map(int,input().split()))\r\na=min(A)\r\np=max(A)\r\nv=2*a\r\nif max(v,p)<min(B):\r\n print(max(v,p))\r\nelse:\r\n print(-1)", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n a.sort()\r\n b.sort()\r\n v=a[n-1]\r\n l=[]\r\n if(n==1):\r\n if(2*a[0]<b[0]):\r\n return 2*a[0]\r\n else:\r\n return -1\r\n if(a[n-1]<b[0] and b[0]>2*a[0]):\r\n #print('hjx')\r\n j=max(2*a[0],a[n-1])\r\n return j\r\n return -1\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nprint(exe())", "n,m=map(int,input().split())\r\ncorrect=list(map(int,input().split()))\r\nwrong=list(map(int,input().split()))\r\ntl=-1\r\nfor i in range(max(correct),min(wrong)):\r\n if 2*(min(correct))<=i:\r\n tl=i\r\n break\r\nprint(tl)", "n,m=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))\r\nk=sorted(list(map(int,input().split())))\r\nflag=0\r\nfor i in range(l[-1],k[0]):\r\n if(2*l[0]<=i):\r\n flag=1\r\n break\r\nif(flag==1):\r\n print(i)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nac=list(map(int,input().split()))\r\nwa=list(map(int,input().split()))\r\nac=sorted(ac)\r\nwa=sorted(wa)\r\nif ac[0]*2>=wa[0] or ac[-1]>=wa[0]:\r\n print(-1)\r\nelse:\r\n print(max(ac[0]*2,ac[-1]))", "n, m = map(int, input().split())\r\nright = sorted(list(map(int, input().split())))\r\nwrong = sorted(list(map(int, input().split())))\r\nans = max(right[0] * 2, right[-1])\r\nif ans < wrong[0]:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n,m = map(int,input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nv = min(a)\r\np = max(a)\r\nc = min(b)\r\nmim = max(2*v,p)\r\nif mim < c:\r\n print(mim)\r\nelse:\r\n print(-1)", "# http://codeforces.com/problemset/problem/350/A\nn , m = map(int, input().split())\nl1 = [int(x) for x in input().split()]\nl2 = [int(x) for x in input().split()]\nv,p,c = min(l1), max(l1), min(l2)\n\nprint(max(2*v,p) if max(2*v,p)<c else -1)\n", "n, m = input().split()\r\nn, m = int(n), int(m)\r\ns1 = [int(i) for i in input().split()]\r\ns2 = [int(i) for i in input().split()]\r\na = max(s1)\r\nc = min(s2)\r\nb = False\r\nfor i in range(a, c):\r\n if i // min(s1) >= 2:\r\n b = True\r\n j = i\r\n break\r\nif b:\r\n print(j)\r\nelse:\r\n print(-1)", "import math\r\ndef main():\r\n n,m = map(int,input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int,input().split()))\r\n if max(min(a)*2,max(a)) < min(b):\r\n print(max(min(a) * 2,max(a)))\r\n return\r\n print(-1)\r\n\r\n\r\nmain()", "get = lambda: list(map(int, input().split()))\r\nn, m = get()\r\na = get() \r\nx = max(min(a) * 2, max(a))\r\nprint(x if min(get()) > x else -1)", "n, m = [int(i) for i in input().split()]\nx = [int(i) for i in input().split()]\ny = [int(i) for i in input().split()]\n\nt = max(x)\n\nwhile min(x)*2 > t:\n\tt += 1\n\nif t < min(y):\n\tprint(t)\nelse:\n\tprint(-1)\n", "parse = lambda st: list(map(int, st.split()))\r\nn, m = parse(input())\r\ngood = parse(input())\r\nbad = parse(input())\r\n_min, _max = min(good), max(good)\r\nv = max(2 * _min, _max)\r\nprint(v if v < min(bad) else -1)", "n, m = map(int, input().split())\r\nacc=list(map(int, input().split()))\r\nrej = list(map(int, input().split()))\r\nmini= max(min(acc)*2, max(acc))\r\nif(min(rej) <= mini):\r\n print('-1')\r\nelse:\r\n print(mini)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nif(max(a)>=min(b)):\r\n print(-1)\r\nelse:\r\n a.sort()\r\n b.sort()\r\n x=2*a[0]\r\n if(x<=max(a)):\r\n print(max(a))\r\n else:\r\n if(x<min(b)):\r\n print(x)\r\n else: \r\n print(-1) ", "n, m = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\n\na.sort()\nwrong_tl = min(b) - 1\n\ntl = wrong_tl\nflag = 0\nfor i in a:\n if 2*i <= tl and flag == 0:\n tl = 2*i\n flag = 1\n elif i > tl:\n tl = i\n\nif not flag or tl > wrong_tl:\n print(-1)\nelse:\n print(tl)", "n,m=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nt=max(a)\r\ntt=min(a)\r\nttt=min(b)\r\nif max(2*tt,t)<ttt:\r\n print(max(2*tt,t))\r\nelse:\r\n print(-1)", "n,m = map(int,input().split())\r\n\r\nright = list(map(int,input().split()))\r\nwrong = list(map(int,input().split()))\r\n\r\ntl = max(right)\r\n\r\nif tl < min(wrong):\r\n if min(right)*2 <= tl:\r\n print(tl)\r\n else:\r\n tl = min(right)*2\r\n if tl < min(wrong):\r\n print(tl)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "n, m = map(int,input().split())\r\ncorrect = list(map(int,input().split()))\r\nwrong = list (map(int, input().split()))\r\n\r\ncorrect.sort()\r\nwrong.sort()\r\nwrong_time_limit = wrong[0]\r\n\r\nminm_time_limit = correct[0]*2 \r\ncorrect_time_limit= correct[-1]\r\n\r\ntle = 0\r\nif minm_time_limit>=correct_time_limit:\r\n tle = minm_time_limit\r\nelse: \r\n tle = correct_time_limit\r\n\r\nif wrong_time_limit>tle : \r\n print(tle)\r\nelse: \r\n print(-1)", "n, m = map(int, input().split())\r\nct = (sorted([int(i) for i in input().split()]))\r\nwt = [int(i) for i in input().split()]\r\nk = max(ct[-1],2*ct[0])\r\nprint(k if 2 * ct[0] <= k < min(wt) else \"-1\")", "nm=input().split()\r\nn=int(nm[0])\r\nm=int(nm[1])\r\ncorrect=list(map(int,input().split()))\r\nwrong=list(map(int,input().split()))\r\npoint4=True\r\nif 2*min(correct)<max(correct):\r\n TL=max(correct)\r\nelse:\r\n TL=2*min(correct)\r\nif min(wrong)<=TL:\r\n point4=False\r\nif point4:\r\n print(TL)\r\nelse:\r\n print(-1)", "a, b = map(int, input().split())\r\nP = list(map(int, input().split()))\r\nflag = 0\r\nM = P[0]\r\nm = P[0]\r\nfor i in range(a):\r\n M = max(M, P[i])\r\n m = min(m, P[i])\r\ns = max(M, 2 * m)\r\nA = list(map(int, input().split()))\r\nfor i in range(b):\r\n if A[i] <= s:\r\n flag = 1\r\nif flag == 1:\r\n print(-1)\r\nelse:\r\n print(s)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\na.sort()\r\nv = a[-1]\r\nans = -1\r\n\r\nwhile 1:\r\n\r\n idx = 0\r\n wrong = False\r\n while idx < m:\r\n if b[idx] <= v:\r\n wrong = True\r\n idx = m\r\n idx += 1\r\n\r\n if wrong == True:\r\n break\r\n\r\n if v < 2 * a[0]:\r\n\r\n v += 1\r\n continue\r\n\r\n ans = v\r\n break\r\n\r\nprint (ans)", "n,m = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nv = min(a)\r\np = max(a)\r\n\r\nc= min(b)\r\nif(max(2*v,p)<c):\r\n print(max(2*v,p))\r\nelse:\r\n print(-1)", "n, k = [int(i) for i in input().split()] #int(input())\r\ncorr = [int(i) for i in input().split()]\r\nwrong = [int(i) for i in input().split()]\r\n\r\nmax_corr = max(corr)\r\nmin_corr = min(corr)\r\n\r\nmin_wrong = min(wrong)\r\n\r\nbest_tl = max(max_corr, 2*min_corr)\r\n\r\nif best_tl<min_wrong:\r\n print(best_tl)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nn1=list(map(int,input().split()))\r\nm1=list(map(int,input().split()))\r\nif max(2*(min(n1)),max(n1))<min(m1):\r\n print(max(2*(min(n1)),max(n1)))\r\nelse:\r\n print(-1)", "input()\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ntl = min(b) - 1\r\nif (2 * min(a)) > tl or max(a) > tl:\r\n print(-1)\r\nelse:\r\n print(max(2 * min(a), max(a)))", "n,k=map(int,input().split()) \r\n # s=input()\r\n # n=int(input())\r\nr=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\nv=max(r)\r\nmnr=min(r)\r\nmnw=min(w)\r\nif v<mnw :\r\n if v>=2*mnr:\r\n print(v)\r\n else:\r\n v=2*mnr\r\n if v<mnw:\r\n print(v)\r\n else:\r\n print(-1)\r\n\r\nelse:\r\n print(-1)\r\n", "def f(a, b, v):\n if v < a[-1]:\n return False\n if v >= b[0]:\n return False\n extra = False\n for ai in a:\n if 2 * ai <= v:\n return ai\n return False\n\ndef main():\n (n, m) = map(int, input().split(' '))\n\n a = sorted(list(map(int, input().split(' '))))\n b = sorted(list(map(int, input().split(' '))))\n\n for v in range(1, b[0]):\n if f(a, b, v):\n return v\n\n return -1\n\nprint(main())\n\n\n\n", "n, m = (int(x) for x in input().split())\r\na = sorted(int(x) for x in input().split())\r\nv = max(a[0] * 2, a[-1])\r\nb1 = sorted(int(x) for x in input().split())[0]\r\nprint(v if v < b1 else -1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = map(int, input().split())\r\nv = max(max(a), 2 * min(a))\r\nprint(v if v < min(b) else -1)", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\np=-1\r\nfor i in range(max(a),min(b)):\r\n if 2*min(a)<=i:\r\n p=i\r\n break\r\nprint(p)\r\n ", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nmin_limit = max(2*min(a), max(a))\r\nmax_limit = min(b)-1\r\nif min_limit <= max_limit:\r\n print(min_limit)\r\nelse:\r\n print(-1)\r\n", "import math as mt\r\nfrom collections import defaultdict,deque\r\nfrom bisect import bisect_left as b_l\r\nfrom bisect import bisect_right as b_r\r\nimport sys\r\n\r\nn,m=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nmx=max(a)\r\nmn=min(b)\r\nif(max(mx,2*min(a))<mn):\r\n print(max(mx,2*min(a)))\r\nelse:\r\n print(-1)", "input()\r\nt = list(map(int, input().split()))\r\na = max(max(t), min(t) * 2)\r\n\r\nb = min(map(int, input().split()))\r\nprint(a if b > a else -1)", "a,b = map(int, input().split())\r\n\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nm = min(x) * 2\r\n\r\nfor i in x:\r\n m = max(m, i)\r\n\r\nfor j in y:\r\n if j <= m:\r\n print(-1)\r\n quit()\r\nprint(m)", "n,m = map(int,input().split())\na = sorted(list(map(int,input().split())))\nb = sorted(list(map(int,input().split())))\nif a[-1]>=b[0]:\n print(-1)\n quit()\nli = a[-1]\nflag = 0\nfor i in range(n):\n if a[i]*2<=li:\n flag = 1\n break\n else:\n if a[i]*2<b[0]:\n li = 2*a[i]\n flag = 1\n break\n else:\n break\nif flag :\n print(li)\nelse: print(-1)", "n,m = map(int,input().split())\r\nr = list(map(int,input().split()))\r\nw = list(map(int,input().split()))\r\nx = max(r)\r\ny = min(w)\r\nz = min(r)\r\nif(y<x):\r\n print(-1)\r\nelse:\r\n for i in range(x,y):\r\n if(2*z<=i):\r\n print(i)\r\n break\r\n else:\r\n print(-1) ", "def solve():\r\n n, m = map(int, input().split())\r\n l1 = list(map(int, input().split()))\r\n l2 = list(map(int, input().split()))\r\n x1 = min(l1)\r\n x2 = min(l2)\r\n y = max(l1)\r\n if y>=x2 or x1*2>=x2:\r\n print(-1)\r\n return\r\n print(max(x1 * 2, y))\r\n\r\n\r\nsolve()", "n,m = map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n# xyz\r\nx=max(a)\r\ny=min(a)*2\r\nres1=max(y,x)\r\nz=min(b)\r\nif res1<z:\r\n print(res1)\r\nelse:\r\n print(-1)", "a,b = input().strip().split(' ')\na = int(a)\nb = int(b)\nright = [int(x) for x in input().strip().split(' ')]\nwrong = [int(x) for x in input().strip().split(' ')]\n\nmaxR = max(right)\nminR = min(right)\n\nv = 2*minR if (2*minR > maxR) else maxR\n\nminW = min(wrong)\nprint (-1 if minW <= v else v)\n ", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ntl = max(a)\r\nmini = min(a)\r\n\r\nif 2*mini<=tl:\r\n f=1\r\n for i in b:\r\n if i<=tl:\r\n print(-1)\r\n f=0\r\n break\r\n if f:\r\n print(tl)\r\n\r\nelse:\r\n res=1\r\n for i in a:\r\n p = 2*i\r\n f=1\r\n for j in b:\r\n if p>=j:\r\n f=0\r\n break\r\n if f:\r\n res = 0\r\n print(p)\r\n break\r\n if res:\r\n print(-1)", "def getVar(): \r\n return tuple(map(int, input().split()))\r\nn, m = getVar()\r\na = getVar()\r\nb = getVar()\r\n#print(a,b)\r\nc = max(min(a) * 2, max(a))\r\n#c = -1\r\nd = min(b) - 1\r\nif c > d:\r\n c = -1\r\nprint(c)\r\n", "from sys import exit\r\nn,m=[int(x) for x in input().split()]\r\nn_1=[int(x) for x in input().split()]\r\nm_2=[int(x) for x in input().split()]\r\nnmin=min(n_1)\r\nnmax=max(n_1)\r\nmlow=min(m_2)\r\nif mlow < nmax:\r\n print(-1)\r\n exit()\r\nf=[]\r\nfor i in range(nmax,mlow):\r\n if i >= nmin *2:\r\n f.append(i)\r\nif len(f)==0:\r\n print(-1)\r\n exit()\r\nprint(min(f))\r\n\r\n", "[m,n]=[int(i) for i in input().split(' ')]\r\nrn=[int(i) for i in input().split(' ')]\r\nrn=sorted(rn)\r\nwn=[int(i) for i in input().split(' ')]\r\nwn=sorted(wn)\r\nans=2*min(rn)\r\nif ans<max(rn):\r\n ans=max(rn)\r\nif ans>=min(wn):\r\n print(-1)\r\nelse:\r\n print(ans)", "n, m = [int(x) for x in input().split()]\r\nR = [int(x) for x in input().split()]\r\nW = [int(x) for x in input().split()]\r\nv = max(R + [min(R)*2])\r\nif v >= min(W): print(-1)\r\nelse:print(v)\r\n ", "correct, wrong = map(int, input().split(' '))\r\nrightlist = list(map(int, input().split(' ')))\r\nwronglist = list(map(int, input().split(' ')))\r\n\r\nupbd = min(wronglist) - 1\r\nlowbd1 = max(rightlist)\r\nlowbd2 = min(rightlist) * 2\r\nlowbd = max(lowbd1, lowbd2)\r\n\r\nif lowbd > upbd:\r\n print(-1)\r\n\r\nelse:\r\n print(lowbd)\r\n", "x=[]\r\nx=input().split()\r\nn=int(x[0])\r\nm=int(x[1])\r\na=[]\r\na=input().split()\r\nb=input().split()\r\nfor i in range(0,n):\r\n a[i]=int(a[i])\r\nfor i in range(0,m):\r\n b[i]=int(b[i])\r\nextra=min(a)\r\nt1=max(a)\r\nt2=min(b)\r\nflag=0\r\nfor i in range(t1,t2,1):\r\n if 2*extra<=i:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(i)\r\nelse:\r\n print('-1')\r\n", "n,m = map(int, input().split())\r\ncor = list(map(int, input().split()))\r\ninc = list(map(int, input().split()))\r\n\r\nif max(cor) < min(inc):\r\n if (min(cor) * 2) < min(inc):\r\n if (min(cor)*2) < max(cor):\r\n print(max(cor))\r\n else:\r\n print(min(cor)*2)\r\n else:\r\n print(-1)\r\n \r\nelse:\r\n print(-1)", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na1 = min(a)\r\na2 = max(a)\r\nb1 = min(b)\r\nif a1 * 2 <= b1 - 1 and a2 < b1:\r\n print(max(a1 * 2, a2))\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\ncorrect = list(map(int, input().split()))\nwrong = list(map(int, input().split()))\n\ncorrect.sort()\nwrong.sort()\nv = max(2 * correct[0], correct[-1])\nif wrong[0] <= v:\n print(-1)\nelse:\n print(v)\n", "\n## Read Data\ndata = input().split()\nN, M = int(data[0]), int(data[1])\n\ncorrect = list(map(int, input().split()))\nwrong = list(map(int, input().split()))\n\n## select minmum wrong answer time\nmin_wrong_time = min(wrong)\n## collect all possible solutions\npossible_TLs = [i+1 for i in range(min_wrong_time-1)]\n\n## collect TLS which correct answers can pass\nTL_solutions = []\nfor i in range(len(possible_TLs)):\n if all(e <= possible_TLs[i] for e in correct):\n TL_solutions.append(possible_TLs[i])\n\nif len(TL_solutions) == 0:\n print('-1')\n exit()\nelse:\n TLs = []\n for i in range(len(TL_solutions)):\n if any(2*e <= TL_solutions[i] for e in correct):\n TLs.append(TL_solutions[i])\n if len(TLs) == 0:\n print('-1')\n exit()\n else:\n print(min(TLs))\n\n", "N, M = map(int, input().split())\r\nCorr = list(map(int, input().split()))\r\nInva = list(map(int, input().split()))\r\n\r\nans = min(Corr)*2\r\nans = max(ans, max(Corr))\r\nif min(Inva) <= ans:\r\n print(-1)\r\nelse:\r\n print(ans)", "s = input().split()\r\n(n,m) = (int(i) for i in s)\r\ns = input().split()\r\ncorrect = [int(i) for i in s]\r\ns = input().split()\r\nwrong = [int(i) for i in s]\r\n\r\nmin_lim = max(correct)\r\nmax_lim = min(wrong)\r\n\r\nwhile(2*min(correct) > min_lim):\r\n\tmin_lim += 1\r\n\r\nif(min_lim >= max_lim):\r\n\tprint(-1)\r\nelse:\r\n\tprint(min_lim)\r\n\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nv=min(a)\r\np=max(a)\r\nc=min(b)\r\nprint(max(2*v,p)) if(max(2*v,p)<c) else print(-1)", "n, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nv = max(2 * min(A), max(A))\r\n\r\nprint(v if v < min(map(int, input().split())) else -1)" ]

{"inputs": ["3 6\n4 5 2\n8 9 6 10 7 11", "3 1\n3 4 5\n6", "2 5\n45 99\n49 41 77 83 45", "50 50\n18 13 5 34 10 36 36 12 15 11 16 17 14 36 23 45 32 24 31 18 24 32 7 1 31 3 49 8 16 23 3 39 47 43 42 38 40 22 41 1 49 47 9 8 19 15 29 30 16 18\n91 58 86 51 94 94 73 84 98 69 74 56 52 80 88 61 53 99 88 50 55 95 65 84 87 79 51 52 69 60 74 73 93 61 73 59 64 56 95 78 86 72 79 70 93 78 54 61 71 50", "55 44\n93 17 74 15 34 16 41 80 26 54 94 94 86 93 20 44 63 72 39 43 67 4 37 49 76 94 5 51 64 74 11 47 77 97 57 30 42 72 71 26 8 14 67 64 49 57 30 23 40 4 76 78 87 78 79\n38 55 17 65 26 7 36 65 48 28 49 93 18 98 31 90 26 57 1 26 88 56 48 56 23 13 8 67 80 2 51 3 21 33 20 54 2 45 21 36 3 98 62 2", "32 100\n30 8 4 35 18 41 18 12 33 39 39 18 39 19 33 46 45 33 34 27 14 39 40 21 38 9 42 35 27 10 14 14\n65 49 89 64 47 78 59 52 73 51 84 82 88 63 91 99 67 87 53 99 75 47 85 82 58 47 80 50 65 91 83 90 77 52 100 88 97 74 98 99 50 93 65 61 65 65 65 96 61 51 84 67 79 90 92 83 100 100 100 95 80 54 77 51 98 64 74 62 60 96 73 74 94 55 89 60 92 65 74 79 66 81 53 47 71 51 54 85 74 97 68 72 88 94 100 85 65 63 65 90", "1 50\n7\n65 52 99 78 71 19 96 72 80 15 50 94 20 35 79 95 44 41 45 53 77 50 74 66 59 96 26 84 27 48 56 84 36 78 89 81 67 34 79 74 99 47 93 92 90 96 72 28 78 66", "1 1\n4\n9", "1 1\n2\n4", "22 56\n49 20 42 68 15 46 98 78 82 8 7 33 50 30 75 96 36 88 35 99 19 87\n15 18 81 24 35 89 25 32 23 3 48 24 52 69 18 32 23 61 48 98 50 38 5 17 70 20 38 32 49 54 68 11 51 81 46 22 19 59 29 38 45 83 18 13 91 17 84 62 25 60 97 32 23 13 83 58", "1 1\n50\n100", "1 1\n49\n100", "1 1\n100\n100", "1 1\n99\n100", "8 4\n1 2 49 99 99 95 78 98\n100 100 100 100", "68 85\n43 55 2 4 72 45 19 56 53 81 18 90 11 87 47 8 94 88 24 4 67 9 21 70 25 66 65 27 46 13 8 51 65 99 37 43 71 59 71 79 32 56 49 43 57 85 95 81 40 28 60 36 72 81 60 40 16 78 61 37 29 26 15 95 70 27 50 97\n6 6 48 72 54 31 1 50 29 64 93 9 29 93 66 63 25 90 52 1 66 13 70 30 24 87 32 90 84 72 44 13 25 45 31 16 92 60 87 40 62 7 20 63 86 78 73 88 5 36 74 100 64 34 9 5 62 29 58 48 81 46 84 56 27 1 60 14 54 88 31 93 62 7 9 69 27 48 10 5 33 10 53 66 2", "5 100\n1 1 1 1 1\n77 53 38 29 97 33 64 17 78 100 27 12 42 44 20 24 44 68 58 57 65 90 8 24 4 6 74 68 61 43 25 69 8 62 36 85 67 48 69 30 35 41 42 12 87 66 50 92 53 76 38 67 85 7 80 78 53 76 94 8 37 50 4 100 4 71 10 48 34 47 83 42 25 81 64 72 25 51 53 75 43 98 53 77 94 38 81 15 89 91 72 76 7 36 27 41 88 18 19 75", "3 3\n2 3 4\n8 9 10", "2 1\n2 3\n15", "2 1\n2 4\n4", "2 3\n4 5\n10 11 12", "3 1\n2 3 3\n5", "2 1\n9 10\n100", "3 3\n3 12 15\n7 8 9", "2 2\n3 5\n7 8", "3 3\n4 5 6\n10 11 12", "3 5\n2 3 3\n6 6 6 6 2", "3 6\n4 5 3\n8 9 7 10 7 11", "3 6\n4 5 2\n8 9 6 10 7 4", "2 1\n4 6\n10", "1 2\n1\n3 1", "2 1\n5 6\n20", "2 1\n1 5\n5", "3 2\n10 20 30\n30 40", "2 2\n5 6\n7 100", "2 1\n2 5\n7", "1 1\n5\n20", "2 1\n10 11\n100", "1 1\n1\n10", "1 1\n10\n100"], "outputs": ["5", "-1", "-1", "49", "-1", "46", "14", "8", "-1", "-1", "-1", "98", "-1", "-1", "99", "-1", "2", "4", "4", "-1", "8", "4", "18", "-1", "6", "8", "-1", "6", "-1", "8", "-1", "10", "-1", "-1", "-1", "5", "10", "20", "2", "20"]}

UNKNOWN

PYTHON3

CODEFORCES

305

8f7bee73b29e1a11e67f9279a1507384

The Child and Set

At the children's day, the child came to Picks's house, and messed his house up. Picks was angry at him. A lot of important things were lost, in particular the favorite set of Picks. Fortunately, Picks remembers something about his set *S*: - its elements were distinct integers from 1 to *limit*; - the value of was equal to *sum*; here *lowbit*(*x*) equals 2*k* where *k* is the position of the first one in the binary representation of *x*. For example, *lowbit*(100102)<==<=102,<=*lowbit*(100012)<==<=12,<=*lowbit*(100002)<==<=100002 (binary representation). Can you help Picks and find any set *S*, that satisfies all the above conditions? The first line contains two integers: *sum*,<=*limit* (1<=≤<=*sum*,<=*limit*<=≤<=105). In the first line print an integer *n* (1<=≤<=*n*<=≤<=105), denoting the size of *S*. Then print the elements of set *S* in any order. If there are multiple answers, print any of them. If it's impossible to find a suitable set, print -1. Sample Input 5 5 4 3 5 1 Sample Output 2 4 5 3 2 3 1 -1

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\ns, l = map(int, input().split())\r\n\r\nd = []\r\nf = 0\r\nfor i in range(1, l+1):\r\n x = i\r\n c = 1\r\n while 1:\r\n if i & 1:\r\n d.append((c, x))\r\n f += c\r\n break\r\n c *= 2\r\n i >>= 1\r\n if i == 0:\r\n d.append((c, x))\r\n f += c\r\n break\r\nd.sort(reverse=True)\r\nif s > f:\r\n print(-1)\r\n exit()\r\n\r\ne = []\r\nfor a, b in d:\r\n if s >= a:\r\n s -= a\r\n e.append(b)\r\n if s == 0:\r\n break\r\n else:\r\n continue\r\n\r\nprint(len(e))\r\nprint(' '.join(map(str, e)))", "a=[0 for x in range(0,18)]\r\nk=[0 for x in range(0,18)]\r\nss=input()\r\nkay = ss.split(\" \")\r\nsuma=int(kay[0])\r\nlimit = int(kay[1])\r\n\r\nfor i in range(16,-1,-1):\r\n a[i]=int(limit/pow(2,i))-int(limit/pow(2,i+1))\r\n \r\nfor i in range (16,-1,-1):\r\n while (suma>=pow(2,i) and a[i]>0):\r\n suma=suma-pow(2,i)\r\n a[i]=a[i]-1\r\n k[i]=k[i]+1\r\nles=\"\"\r\nN=sum(k)\r\nif suma!=0:\r\n print(-1)\r\nelse:\r\n print(N)\r\n for i in range(0,17):\r\n j=0\r\n while(k[i]!=0):\r\n #print((pow(2,i)*(2*j+1)))\r\n les=les+str(pow(2,i)*(2*j+1))+\" \"\r\n k[i]=k[i]-1\r\n j=j+1\r\nprint(les)\r\n", "s,l = map(int,input().split())\r\nd = [-1]*(l+1)\r\nfor i in range(1,l+1):\r\n if i%2:\r\n d[i] = 0\r\n else:\r\n d[i] = d[i//2]+1\r\n\r\np = sorted(list(range(1,l+1)),key=lambda x:-d[x])\r\nans = []\r\nfor i in p :\r\n if s==0:\r\n break\r\n elif s<(1<<d[i]):\r\n continue\r\n else:\r\n ans.append(i)\r\n s-=(1<<d[i])\r\nif s==0:\r\n print(len(ans))\r\n print(*ans)\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom collections import Counter, defaultdict\r\nfrom sys import stdin, stdout\r\nimport io\r\nimport math\r\nimport heapq\r\nimport bisect\r\nimport collections\r\nimport copy\r\nimport collections, sys, threading\r\ndef ceil(a, b):\r\n return (a + b - 1) // b\r\ninf = float('inf')\r\ndef get():\r\n return stdin.readline().rstrip()\r\nmod = 10 ** 9 + 7\r\nimport collections, sys, threading\r\nsys.setrecursionlimit(1500)\r\n# for _ in range(int(get())):\r\n# n=int(get())\r\n# l=list(map(int,get().split()))\r\n# = map(int,get().split())\r\ndef decimalToBinary(n):\r\n return bin(n).replace(\"0b\", \"\")\r\n##################################################\r\nsum,limit = map(int,get().split())\r\ns=decimalToBinary(sum)\r\nans=[]\r\nfor i in range(1,limit+1):\r\n ans.append([i&~(i-1),i]) # return rightmost set bit\r\nans.sort(reverse=True)\r\nres=0\r\nl=[]\r\nfor i in ans:\r\n if res+i[0]<=sum:\r\n res+=i[0]\r\n l.append(i[1])\r\nif res!=sum:\r\n print(-1)\r\n exit()\r\nprint(len(l))\r\nprint(*l)\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 lowbit(x):\r\n i = 0\r\n while x & 1 == 0:\r\n x >>= 1\r\n i += 1\r\n return 1 << i\r\n\r\ndef main():\r\n Sum, limit = [int(i) for i in input().split()]\r\n \r\n d = {}\r\n for i in range(1, limit + 1):\r\n tmp = lowbit(i)\r\n if tmp not in d:\r\n d[tmp] = []\r\n d[tmp].append(i)\r\n \r\n result = []\r\n i = Sum\r\n while i > 0 and Sum:\r\n if i in d and d[i]:\r\n result.append(d[i].pop())\r\n Sum -= i\r\n i = min(Sum, i)\r\n else:\r\n i -= 1\r\n \r\n if Sum:\r\n print(\"-1\")\r\n else:\r\n print(len(result))\r\n for i in result:\r\n print(i, end=' ')\r\n \r\n\r\nmain()\r\n \r\n", "def lowbit(n):\r\n\tf=1\r\n\twhile n&f==0:f<<=1\r\n\treturn(f,n)\r\ns,lim=map(int,input().split())\r\nans={*range(1,lim+1)}\r\nbits=sorted(map(lowbit,ans),reverse=1)\r\ncs=0\r\nif sum(i[0]for i in bits)<s:exit(print(-1))\r\nans=[]\r\ni=0\r\nwhile s>0:\r\n\twhile bits[i][0]>s:i+=1\r\n\tans.append(bits[i][1])\r\n\ts-=bits[i][0]\r\n\ti+=1\r\nprint(len(ans))\r\nprint(*ans)", "from math import log\r\n\r\nli=[[] for i in range(10**5)]\r\ns,l=map(int,input().split())\r\ntemp=0\r\nfor i in range(1,l+1):\r\n\tx=i&-i\r\n\tli[x].append(i)\r\n\ttemp+=x\r\nif temp<s:\r\n\tprint(-1)\r\nelse:\r\n\tx=int(log(s,2))\r\n\tz=1<<x\r\n\tans=[]\r\n\twhile True:\r\n\t\tif z<=s:\r\n\t\t\tif li[z]!=[]:\r\n\t\t\t\tans.append(li[z].pop())\r\n\t\t\t\ts-=z\r\n\t\t\t\tif s<=0:\r\n\t\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tz=z//2\r\n\t\telse:\r\n\t\t\tz=z//2\r\n\tprint(len(ans))\r\n\tprint(*ans)", "sum,limit = [int(x) for x in input().split()]\r\n\r\nodd=int(limit/2)\r\neven=odd\r\nif limit%2==1:\r\n odd+=1\r\n\r\na=[]\r\n\r\nfor i in range(2,limit+1,2):\r\n c=0\r\n num=i\r\n while i%2==0:\r\n i/=2\r\n c+=1\r\n a.append([int(2**c),int(num)])\r\n\r\na.sort(key=lambda x:x[0],reverse=True)\r\n\r\ns=0\r\ni=0\r\nans=[]\r\ncount=0\r\nwhile i!=even and s+a[i][0]<sum:\r\n s+=a[i][0]\r\n ans.append(a[i][1])\r\n count+=1\r\n i+=1\r\n\r\nif s==sum:\r\n print(count)\r\n print(*ans)\r\nelse:\r\n rem=sum-s\r\n if odd<rem:\r\n print(-1)\r\n else:\r\n j=1\r\n for i in range(rem):\r\n ans.append(j)\r\n j+=2\r\n count+=1\r\n print(count)\r\n print(*ans)\r\n", "m,n = map(int,input().split())\nl = []\nfor i in range(1,n+1):\n x = bin(i)\n p = x.split('1')\n l.append((2**len(p[-1]),i))\n \nl.sort(reverse = True)\ni = 0\nans= []\nwhile m>0 and i<len(l):\n if m>=l[i][0]:\n m -= l[i][0]\n ans.append(l[i][1])\n i+=1\n\nif m!=0:\n print(-1)\n exit()\nprint(len(ans))\nprint(*ans)\n\t \t \t \t\t \t\t\t \t\t \t\t\t\t\t", "def lowbit(x):\n return x & (- x)\ns, l = map(int , input().split())\nlst = []\nwhile s > 0 and l > 0:\n if s - l >= 0:\n s -= lowbit(l)\n lst.append(l)\n l -= 1\nif s != 0:\n print(-1)\nelse:\n print(len(lst))\n print(*lst)\n \t \t \t \t \t \t \t \t\t \t", "s,l=map(int,input().split(\" \"))\r\nli=[]\r\nwhile l!=0 and s!=0:\r\n x=1\r\n if l%2==0:\r\n g=l\r\n while g%2==0:\r\n x+=1\r\n g=g>>1\r\n if s>=pow(2,x-1):\r\n s-=pow(2,x-1)\r\n li.append(l)\r\n l-=1\r\nif s==0:\r\n print(len(li))\r\n print(*li)\r\nelse:\r\n print(-1)\r\n", "sum,lim=list(map(int,input().split()))\r\na=[]\r\nwhile lim>0 and sum>0:\r\n\tif (lim&-lim)<=sum:\r\n\t\tsum=sum-(lim&-lim)\r\n\t\ta.append(lim)\r\n\tlim=lim-1\r\nif(sum>0):\r\n\tprint(-1)\r\nelse:\r\n\tprint(len(a))\r\n\tfor i in range(len(a)):\r\n\t\tprint(a[i])", "b, a = map(int, input().split())\r\nl = sorted((i & (-i), i) for i in range(1, a + 1))\r\nres = []\r\nfor x, e in l[::-1]:\r\n if b == 0: break\r\n if x <= b:\r\n b -= x\r\n res.append(e)\r\nif b:\r\n print(-1)\r\nelse:\r\n print(len(res))\r\n print(*res)", "su, lim=map(int, input().split())\r\nvi=list()\r\nvp=list()\r\nfor i in range(1, lim+1):\r\n\tj=1\r\n\twhile j<=i:\r\n\t\tif i&j:\r\n\t\t\tvp.append((j, i))\r\n\t\t\tbreak\r\n\t\tj*=2\r\nvp.sort()\r\nfor i in range(len(vp)-1, -1, -1):\r\n\tif vp[i][0]<=su:\r\n\t\tvi.append(vp[i][1])\r\n\t\tsu-=vp[i][0]\r\nif su==0:\r\n\tprint(len(vi))\r\n\tfor i in range(len(vi)):\r\n\t\tprint(vi[i], end=\" \")\r\nelse:\r\n\tprint(-1)", "s,l = map(int,input().split()) \r\narr = [0]+[0 for i in range(l)]\r\ndic={}\r\nfor i in range(1,l+1):\r\n x=bin(i)\r\n m=len(x)\r\n for j in range(0,m):\r\n if x[m-j-1]=='1':\r\n arr[i]=2**j\r\n y =2**j\r\n if y in dic:\r\n dic[y].append(i)\r\n else:\r\n dic[y]=[i]\r\n break\r\n\r\nf = s\r\narr1=sorted(arr)\r\nfor i in range(l,0,-1):\r\n if arr1[i]>f:\r\n arr1[i]=0\r\n else:\r\n f+= -arr1[i]\r\n\r\nif sum(arr1)==s:\r\n final = True\r\nelse:\r\n final = False\r\nfinal_arr=[]\r\nif final:\r\n t = 0\r\n for i in range(1,l+1):\r\n if arr1[i]!=0:\r\n t+=1\r\n for j in range(len(dic[arr1[i]])):\r\n if dic[arr1[i]][j]!=-1:\r\n final_arr.append(dic[arr1[i]][j])\r\n dic[arr1[i]][j]=-1\r\n break\r\n print(t)\r\n\r\n for i in final_arr:\r\n print(i,end=' ')\r\nelse:\r\n print(-1)", "def main():\r\n s, lm = map(int, input().split())\r\n c = {}\r\n for i in range(1, lm + 1):\r\n if (i & (-i)) not in c:\r\n c[i & (-i)] = 1\r\n else:\r\n c[i & (-i)] += 1\r\n p = list(c.keys())\r\n p.sort(reverse=True)\r\n used = {k: 0 for k in p}\r\n total = 0\r\n for k in p:\r\n count = 0\r\n if s >= k and count < c[k]:\r\n while s >= k and count < c[k]:\r\n count += 1\r\n s -= k\r\n used[k] = count\r\n total += count\r\n if s > 0:\r\n print(-1)\r\n else:\r\n print(total)\r\n ans = []\r\n for i in range(1, lm + 1):\r\n if used[i & (-i)] > 0:\r\n ans.append(i)\r\n used[i & (-i)] -= 1\r\n print(*ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\nfrom collections import deque\r\nimport math\r\n\r\n\r\ndef lsb(i):\r\n return i & -i\r\n\r\ndef main():\r\n read = sys.stdin.readline\r\n sm, limit = (int(i) for i in read().split())\r\n sol = []\r\n msbs = []\r\n for i in range(1, limit + 1):\r\n lsb_i = lsb(i)\r\n msbs.append((lsb_i, i))\r\n msbs.sort(reverse=True)\r\n for msb, i in msbs:\r\n if sm - msb >=0:\r\n sm -= msb\r\n sol.append(str(i))\r\n if sm == 0:\r\n break\r\n if sm > 0:\r\n print(-1)\r\n else:\r\n print(len(sol))\r\n print(' '.join(sol))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "def lowbit(x):\r\n\treturn x & (-x)\r\n\t\r\ndef solve():\r\n\tglobal sum, limit, list\r\n\twhile(limit > 0 and sum!=0):\r\n\t\tif(sum-lowbit(limit)>=0):\r\n\t\t\tsum-=lowbit(limit)\r\n\t\t\tlist.add(limit)\r\n\t\tlimit-=1\r\n\tif(sum==0):\r\n\t\treturn True\r\n\treturn False\r\n\t\r\nsum, limit = tuple(int(i) for i in input().split())\r\nlist = set()\r\n\r\nif(solve()):\r\n\ts = str(len(list)) + \"\\n\"\r\n\tfor i in list:\r\n\t\ts += str(i) + \" \"\r\n\tprint (s[:len(s)-1])\r\nelse:\r\n\tprint (-1)", "import itertools\r\nimport math\r\nimport time\r\nfrom builtins import input\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nimport collections\r\nfrom heapq import heappop, heappush\r\nimport random\r\nimport os\r\nfrom random import randint\r\nimport decimal\r\n\r\n# from sys import stdin, stdout\r\n# input, print = stdin.readline, stdout.write\r\n\r\ndecimal.getcontext().prec = 18\r\n\r\n\r\ndef solve():\r\n # 2 iteration on average ?\r\n def lowbit(x):\r\n k = 2\r\n while x % k == 0:\r\n k = k * 2\r\n return k // 2\r\n\r\n s, l = map(int, input().split())\r\n\r\n res = []\r\n for i in range(l, 0, -1):\r\n ll = lowbit(i)\r\n if ll <= s:\r\n res.append(i)\r\n s -= ll\r\n if s == 0:\r\n break\r\n\r\n if res != [] and s == 0:\r\n print(len(res))\r\n print(\" \".join(map(str, res)))\r\n else:\r\n print(-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, m = map(int, input().split())\r\n\r\nvals = {}\r\ntemp = []\r\nfor j in range(1, m + 1):\r\n lowest_bit = j & (-j)\r\n if lowest_bit not in vals:\r\n vals[lowest_bit] = []\r\n vals[lowest_bit].append(j)\r\n temp.append(lowest_bit)\r\ntemp.sort()\r\nresult = []\r\nfor x in reversed(temp):\r\n if x <=n and len(vals[x]):\r\n n -= x\r\n result.append(vals[x][-1])\r\n vals[x].pop()\r\n\r\nif n == 0:\r\n print(len(result))\r\n print(*result)\r\nelse:\r\n print(-1)\r\n", "import sys\r\nimport math\r\nfrom collections import Counter\r\n\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n\r\ns, limit = map(int, input().split())\r\nc = {}\r\ni = 1\r\nwhile limit >= i :\r\n c[i] = (limit // i + 1) // 2\r\n i *= 2\r\nt = s\r\nres = []\r\nfor i in sorted(c.keys(), reverse = True) :\r\n x = min(t // i, c[i])\r\n t = t - i * x\r\n for j in range(1, x + 1, 1) :\r\n res.append(i * (2 * j - 1))\r\nif t == 0 :\r\n print(len(res))\r\n print(\" \".join(str(i) for i in res))\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", "\ndef solve() :\n ans=[]\n for i in range(1,n+1):\n x=i\n c=0\n while x>0 :\n if x%2==1 :\n ans.append((2**c,i))\n break\n else:\n c+=1\n x=x//2\n ans.sort(reverse=True)\n s2=s\n ans2=[]\n for i in range(n):\n if ans[i][0]<=s2 :\n s2-=ans[i][0]\n ans2.append(ans[i][1])\n if s2==0 :\n break\n else:\n return [-1]\n print(len(ans2))\n return ans2\n\n\n\n\n\n\n\nfrom sys import stdin\ninput = stdin.readline\n\n\n\n\ns, n= [int(x) for x in input().split()]\nprint(*solve())\n\n\n\n'''\n\nt=int(input())\nfor i in range(t) :\n print(solve())\n\n\nn=int(input())\n\nx=input().strip()\n\n\nn,m= [int(x) for x in input().split()]\n\n\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\n\nn=int(input())\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\n\n\nn=int(input())\narr=[int(x) for x in input().split()]\n'''", "# LUOGU_RID: 102441866\nn, m = map(int, input().split())\r\na = []\r\nwhile (n > 0 and m > 0):\r\n if (n - (m & -m)) >= 0:\r\n n -= m & -m\r\n a += m,\r\n m -= 1\r\nif n:\r\n print(-1)\r\nelse:\r\n print(len(a))\r\n print(*a)\r\n", "s,l=map(int,input().split())\r\nans=[]\r\nwhile(s>0 and l>0):\r\n\tif(s-(l&l))>=0:\r\n\t\ts-=l&-l\r\n\t\tans.append(l)\r\n\tl-=1\r\nif s: print(-1)\r\nelse:\r\n\tprint(len(ans))\r\n\tprint(*ans)", "from math import *\r\nfrom collections import *\r\nfrom bisect import *\r\nimport heapq\r\nimport math\r\nfrom itertools import permutations\r\n\r\ndef is_prime(n):\r\n\r\n for i in range(2,math.ceil(math.sqrt(n))):\r\n if(n%i==0):\r\n return False\r\n return True\r\n\r\ndef sieve(n):\r\n arr=[True for _ in range(n+1)]\r\n\r\n for i in range(2,math.ceil(math.sqrt(n))):\r\n if(arr[i]==True):\r\n for j in range(i*i,n+1,i):\r\n arr[j]=False\r\n\r\n return arr\r\n\r\n\r\ndef power(x, y, p):\r\n res = 1 # Initialize result\r\n\r\n # Update x if it is more\r\n # than or equal to p\r\n x = x % p\r\n\r\n if (x == 0):\r\n return 0\r\n\r\n while (y > 0):\r\n\r\n # If y is odd, multiply\r\n # x with result\r\n if ((y & 1) == 1):\r\n res = (res * x) % p\r\n\r\n # y must be even now\r\n y = y >> 1 # y = y/2\r\n x = (x * x) % p\r\n\r\n return res\r\n\r\ndef euclidean_distance(x1,y1,x2,y2):\r\n return sqrt(abs(x1-x2)**2+abs(y1-y2)**2)\r\n\r\ndef get_permutations(lo=0,hi=10):\r\n return list(permutations(range(lo,hi)))\r\n\r\n\r\ndef getDivisors(n):\r\n i = 1\r\n ans1=[]\r\n ans2=[]\r\n while i <= math.sqrt(n):\r\n\r\n if (n % i == 0):\r\n if (n / i == i):\r\n ans1.append(i)\r\n else:\r\n # Otherwise print both\r\n ans1.append(i)\r\n ans2.append(n//i)\r\n i = i + 1\r\n\r\n return ans1+ans2[::-1]\r\n\r\ndef solve():\r\n # s=input()\r\n # n=int(input())\r\n n,l=list(map(int,input().split()))\r\n\r\n def check(x, y):\r\n return x >= 0 and y >= 0 and x < n and y < m\r\n\r\n mod=int(1e9+7)\r\n d=defaultdict(int)\r\n d1=defaultdict(list)\r\n for i in range(1,l+1):\r\n x=bin(i)[2:]\r\n # print(x)\r\n ind=0\r\n for j in range(len(x)-1,-1,-1):\r\n if(x[j]=='1'):\r\n break\r\n ind+=1\r\n d[(2**ind)]+=1\r\n d1[(2**ind)].append(i)\r\n\r\n temp=[]\r\n for k,v in d.items():\r\n temp.append([k,v])\r\n temp.sort()\r\n j=len(temp)-1\r\n ans=[]\r\n # print(temp)\r\n while(n>0 and j>=0):\r\n x=n//temp[j][0]\r\n take=min(x,temp[j][1])\r\n n-=(take*temp[j][0])\r\n for k in range(take):\r\n ans.append(d1[temp[j][0]][-1])\r\n d1[temp[j][0]].pop()\r\n j-=1\r\n if(n!=0):\r\n print(-1)\r\n return\r\n print(len(ans))\r\n print(*ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n n=1\r\n # n=int(input())\r\n while(n):\r\n n-=1\r\n solve()\r\n\r\n\r\n\r\n\r\n", "def main():\r\n _sum, limit = map(int, input().split())\r\n\r\n ans = []\r\n for i in range(limit, 0, -1):\r\n if _sum - (i & -i) >= 0:\r\n _sum -= (i & -i)\r\n ans.append(i)\r\n\r\n if _sum <= 0:\r\n break\r\n\r\n if _sum > 0:\r\n print(-1)\r\n else:\r\n print(len(ans))\r\n print(*ans)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "summ,lim = map(int,input().split())\r\nc = 0\r\nans = []\r\nfor i in range(lim,0,-1):\r\n c=(i^(i&(i-1)))\r\n if c<=summ:\r\n ans.append(i)\r\n summ-=c\r\nif summ!=0:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n print(*ans)\r\n \r\n", "(a, b), x, y = list(map(int, input().split())), [], 0\r\n\r\ndef bin(s):\r\n return str(s) if s <= 1 else bin(s >> 1) + str(s & 1)\r\n\r\ndef lowbit(s):\r\n return int('1' + bin(s).split('1')[-1], 2)\r\n\r\nfor i in reversed(range(b + 1)):\r\n if y == a:\r\n break\r\n if a >= y + lowbit(i):\r\n x.append(i) \r\n y += lowbit(i)\r\n\r\nif y == a:\r\n print( len(x) )\r\n print( ' '.join(str(i) for i in x) )\r\nelse:\r\n print( -1 )", "s,l = map(int,input().split())\r\nc = []\r\nfor i in range(1,100001):\r\n if(i%2!=0):\r\n c.append([1,i])\r\n else:\r\n k = list(bin(i))\r\n k.reverse()\r\n z = k.index('1')\r\n c.append([pow(2,z),i])\r\nc = sorted(c)\r\nc.reverse()\r\nz = []\r\nfor i in range(len(c)):\r\n if(s==0):\r\n break\r\n elif(s>=c[i][0] and c[i][1]<=l):\r\n s-=c[i][0]\r\n if(s<0):\r\n s+=c[i][0]\r\n else:\r\n z.append(c[i][1])\r\nif(s!=0):\r\n print(-1)\r\nelse:\r\n print(len(z))\r\n print(*z)\r\n", "import math\r\n\r\ndef getLSB(num):\r\n return num & -num\r\n \r\ndef getSet(sum, limit):\r\n res = [];\r\n while sum > 0 and limit > 0:\r\n lsb = getLSB(limit)\r\n if lsb <= sum:\r\n sum -= lsb\r\n res.append(str(limit))\r\n limit -= 1\r\n \r\n return -1 if sum > 0 else '{}\\n{}'.format(len(res), ' '.join(res))\r\n \r\nsum, limit = list(map(int, input().split(' ')))\r\nprint(getSet(sum, limit))", "def per(x):\r\n t = 0\r\n y = str(bin(x))[2:]\r\n for i in range(len(y) - 1, -1, -1):\r\n if y[i] == '1':\r\n t = i\r\n break\r\n return (2 ** (len(y) - t - 1), x)\r\n\r\n\r\ndef perall(l):\r\n for i in range(1, l + 1):\r\n ans.append(per(i))\r\n return ans\r\n\r\ns, l = map(int, input().split())\r\nans = []\r\nperall(l)\r\nans.sort(reverse = True)\r\nanswer = []\r\nfor i in ans:\r\n if s - i[0] >= 0:\r\n s -= i[0]\r\n answer.append(i[1])\r\nif s != 0:\r\n print(-1)\r\nelse:\r\n print(len(answer))\r\n print(*answer)", "import sys\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(10**6)\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef in_int():\r\n return (int(input()))\r\n\r\n\r\ndef in_list():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef in_str():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef in_ints():\r\n return (map(int, input().split()))\r\n\r\n\r\ntotal, n = in_ints()\r\n\r\nl = [i for i in range(1, n+1)]\r\n\r\nl = sorted(l, key= lambda l : l&-l)\r\nl = l[::-1]\r\n\r\n\r\nans = []\r\nfor xx in l:\r\n\r\n tt = xx&-xx\r\n if total >= tt:\r\n total-=tt\r\n ans.append(xx)\r\n\r\n\r\n\r\nif total == 0 :\r\n print(len(ans))\r\n for xx in ans:\r\n print(xx, end=' ')\r\nelse:\r\n print(-1)", "'''input\n4 3\n'''\nfrom sys import stdin\ninput = stdin.readline\nimport math\nimport sys\nfrom collections import defaultdict\nsys.setrecursionlimit(10 ** 4)\n\n\n\ndef lowbit(n):\n\treturn n - (n &(n - 1))\n\t\n# main starts\ns, limit = list(map(int, input().split()))\nk = math.ceil(math.log(limit, 2))\nans = set()\nfor i in range(limit, 0, -1):\n\tx = lowbit(i)\n\tif s >= x:\n\t\ts -= x\n\t\tans.add(i)\nif s > 0:\n\tprint(-1)\n\nelse:\n\tprint(len(ans))\n\tfor i in ans:\n\t\tprint(i, end = ' ')", "\"\"\"http://codeforces.com/problemset/problem/437/B\"\"\"\n\ndef solve(s, limit):\n res = []\n bit_length = len('{:b}'.format(limit))\n # iterate through 2^x with x from 0, 1...bit_length-1\n for i in range(bit_length - 1, -1, -1):\n low_bit = 2 ** i\n for j in range(1, limit + 1, 2): # odd number: 1, 3, 5\n t = low_bit * j\n # print(i, t, res, s)\n if low_bit > s or t > limit:\n break\n s -= low_bit\n res.append(t)\n return res if s == 0 else None\n\nif __name__ == '__main__':\n res = solve(*list(map(int, input().split())))\n if res is None:\n print(-1)\n else:\n print(len(res))\n print(' '.join(str(x) for x in res))\n", "\r\nsum, lim = map(int, input().split())\r\narr = []\r\n\r\nnow = 0\r\nfor i in range(lim, -1, -1):\r\n if now + (i & (-i)) <= sum:\r\n now += i & (-i)\r\n arr.append(i)\r\n\r\nif now != sum:\r\n print(-1)\r\nelse:\r\n print(len(arr) - 1)\r\n for i in range(0, len(arr) - 1):\r\n print(arr[i])\r\n", "def mi():\r\n return map(int, input().split())\r\n'''\r\n5 5\r\n'''\r\ns, l = mi()\r\nr = []\r\nfor i in range(l, 0, -1):\r\n if int(bin(i&-i), 2)<=s:\r\n r.append(i)\r\n s-=int(bin(i&-i), 2)\r\nif s:\r\n print (-1)\r\nelse:\r\n print (len(r))\r\n print (*r)\r\n", "I = lambda : map(int, input().split())\r\n\r\ns, l = I()\r\n\r\ndef getLimit(n):\r\n c = 0\r\n while(n):\r\n if n & 1:\r\n break\r\n c += 1\r\n n >>= 1\r\n return 1<<c\r\n\r\nco = 0\r\nd = []\r\nfor i in range(1, l+1):\r\n v = getLimit(i)\r\n if v == 1:\r\n co += 1\r\n d.append([v, i])\r\n\r\nd.sort()\r\nans = []\r\nf = 0\r\nwhile(d and s):\r\n v, i = d.pop()\r\n if s >= v:\r\n s -= v\r\n ans.append(i)\r\n\r\nif s:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n print(*ans)", "'I could not solve this problem and I saw answer for this problem'\n'see vice versa'\n\nSum , limit = map(int,input().split())\nres = []\nchoose = []\nfor i in range(1, limit + 1):\n\tchoose.append((i & -i, i))\n\nchoose.sort()\nfor i, j in choose[::-1]:\n\tif i <= Sum:\n\t\tSum-=i\n\t\tres.append(j)\nif Sum:\n\tprint(\"-1\")\nelse:\n\tprint(len(res))\n\tprint(*res)", "s,l=map(int,input().split())\r\nk=[]\r\nfor i in range(1,l+1):\r\n c=i\r\n count=0\r\n while(1):\r\n z=i&1\r\n if z==1:\r\n break\r\n else:\r\n count=count+1\r\n i=i>>1\r\n k.append([pow(2,count),c])\r\nk=sorted(k)[::-1]\r\n#[[lowbit,number]]\r\nsum=0\r\nm=[]\r\nflag=False\r\nfor i in k:\r\n if sum+i[0]<=s:\r\n sum=sum+i[0]\r\n m.append(i[1])\r\n if sum==s:\r\n flag=True\r\nif flag==False:\r\n print(-1)\r\nelse:\r\n print(len(m))\r\n for i in m:\r\n print(i,end=\" \")\r\n print()", "import math\r\nsum, limit = map (int, input().split())\r\nx = 0\r\nlis = list()\r\nfor i in range (limit, 0, -1) :\r\n if x < sum and limit > 0 and x + (i & (-i)) <= sum:\r\n x += (i & (-i))\r\n lis.append (i)\r\n limit -= 1\r\nif x != sum :\r\n print (-1)\r\nelse :\r\n print (len (lis))\r\n for i in lis :\r\n print (i, \"\", end = \"\")\r\n", "s,n=map(int,input().split())\r\nt=0\r\nl=[]\r\nfor i in reversed(range(1,n+1)):\r\n\r\n\tif t+(2**((bin(i)[::-1]).find(\"1\")))<=s:\r\n\t\tt+=(2**((bin(i)[::-1]).find(\"1\")))\r\n\t\tl.append(i)\r\n\tif t==s:\r\n\t\tbreak\r\nif t!=s:\r\n\tprint(-1)\r\nelse:\r\n\tprint(len(l))\r\n\tprint(*l)\r\n\t\t\t", "import sys\r\nimport string\r\nimport math\r\nfrom collections import defaultdict\r\nfrom functools import lru_cache\r\nfrom collections import Counter\r\nfrom fractions import Fraction\r\n\r\ndef mi(s):\r\n return map(int, s.strip().split())\r\n\r\ndef lmi(s):\r\n return list(mi(s))\r\n\r\ndef tmi(s):\r\n return tuple(mi(s))\r\n\r\ndef mf(f, s):\r\n return map(f, s)\r\n\r\ndef lmf(f, s):\r\n return list(mf(f, s))\r\n\r\ndef js(lst):\r\n return \" \".join(str(d) for d in lst)\r\n\r\ndef jsns(lst):\r\n return \"\".join(str(d) for d in lst)\r\n\r\ndef line():\r\n return sys.stdin.readline().strip()\r\n\r\ndef linesp():\r\n return line().split()\r\n\r\ndef iline():\r\n return int(line())\r\n\r\ndef mat(n):\r\n matr = []\r\n for _ in range(n):\r\n matr.append(linesp())\r\n return matr\r\n\r\ndef matns(n):\r\n mat = []\r\n for _ in range(n):\r\n mat.append([c for c in line()])\r\n return mat\r\n\r\ndef mati(n):\r\n mat = []\r\n for _ in range(n):\r\n mat.append(lmi(line())) \r\n return mat\r\n\r\ndef pmat(mat):\r\n for row in mat:\r\n print(js(row))\r\n\r\ndef main():\r\n n, l = mi(line())\r\n used = set()\r\n\r\n counts = defaultdict(list)\r\n for ll in range(1, l + 1):\r\n pos = 0\r\n i = ll\r\n while i:\r\n i, curr = i // 2, i % 2\r\n if curr == 1:\r\n counts[2**pos].append(ll)\r\n break\r\n pos += 1\r\n\r\n pos = 0\r\n while n:\r\n n, curr = n // 2, n % 2\r\n if curr:\r\n need = 2**pos\r\n if need in counts:\r\n used.add(counts[need].pop())\r\n else:\r\n # need to make need out of smaller powers of 2.\r\n required = need\r\n while need and required:\r\n if need not in counts:\r\n need //= 2\r\n elif need in counts and len(counts[need]) > 0:\r\n # Can use this, but how many should we use?\r\n num = required // need\r\n for _ in range(min(num, len(counts[need]))):\r\n used.add(counts[need].pop())\r\n required -= need\r\n else:\r\n # Check if there's something smaller.\r\n need //= 2\r\n\r\n if required != 0:\r\n print(-1)\r\n return\r\n pos += 1\r\n\r\n print(len(used))\r\n print(js(used))\r\nmain()\r\n", "s, l = map(int, input().split())\r\nt = []\r\nfor i in range(l, 0, -1):\r\n k = i & (i ^ (i - 1))\r\n if s >= k:\r\n t.append(str(i))\r\n s -= k\r\nprint(-1 if s else str(len(t)) + '\\n' + ' '.join(t))", "ub, l = map(int, input().split())\r\na=[]\r\ns = 0\r\nfor i in range(l, 0, -1):\r\n v = i & -i\r\n if s + v > ub:\r\n continue\r\n else:\r\n s += v\r\n a.append(i)\r\nif s==ub:\r\n print(len(a))\r\n print(*a)\r\nelse:\r\n print(-1)", "s = input().split()\r\n(sumi,limit) = (int(i) for i in s)\r\n\r\nres = []\r\nout = []\r\n\r\ndef low(i):\r\n\tcount = 0\r\n\twhile(i%2 == 0):\r\n\t\ti = i//2\r\n\t\tcount += 1\r\n\treturn (2**count)\r\n\r\n\r\nfor i in range(1,limit+1):\r\n\tres.append((low(i),i))\r\n#print(res)\r\nres = sorted(res,key = lambda x:x[0],reverse = True)\r\n#print(res)\r\nflag = 0\r\ns = 0\r\n\r\nfor i in range(len(res)):\r\n\tif(s + res[i][0] <= sumi):\r\n\t\ts += res[i][0]\r\n\t\tout.append(res[i][1])\r\n\r\n\tif(s == sumi):\r\n\t\tflag = 1\r\n\t\tbreak\r\n\r\nif(flag == 1):\r\n\tprint(len(out))\r\n\tfor i in range(len(out)):\r\n\t\tprint(out[i],end = ' ')\r\nelse:\r\n\tprint(-1)\r\n\r\n", "s,l=map(int,input().split())\nlowbit=[0]\nidx=[0]\nfor i in range(1,l+1):\n x=bin(i)\n x=x[::-1]\n lowbit.append(2**x.index(\"1\"))\n idx.append(i)\nidx.sort(key=lambda i:lowbit[i],reverse=True)\np=0\nans=[]\nwhile(s and p<l):\n if lowbit[idx[p]]<=s:\n s-=lowbit[idx[p]]\n ans.append(idx[p])\n p+=1\nif s:\n print(-1)\nelse:\n print(len(ans))\n print(*ans)\n", "s,l=map(int,input().split())\nans=[]\nwhile(s>0 and l>0):\n\tif(s-(l&l))>=0:\n\t\ts-=l&-l\n\t\tans.append(l)\n\tl-=1\nif s: print(-1)\nelse:\n\tprint(len(ans))\n\tprint(*ans)\n\t\t\t\t\t\t\t\t\t \t \t \t \t \t\t\t \t\t", "s,l=map(int,input().split())\r\n\r\nlis =[list() for _ in range(100001)]\r\n\r\nfor i in range(1,l+1):\r\n lis[i & (~ (i-1))].append(i)\r\n\r\nnum=int(pow(2,s.bit_length()-1))\r\n\r\ninvalid=1\r\nans=list()\r\nwhile num:\r\n if num & s:\r\n temp=num\r\n length=1\r\n while temp:\r\n while len(lis[temp]):\r\n if length==0:\r\n break\r\n ans.append(lis[temp].pop())\r\n length-=1\r\n length=length<<1\r\n temp>>=1\r\n if length:\r\n invalid=0\r\n num>>=1\r\n\r\nif invalid:\r\n print(len(ans))\r\n for var in ans:\r\n print(var,end=\" \")\r\nelse:\r\n print(-1)\r\n", "s,l=map(int,input().split())\na=[]\nwhile(s>0 and l>0):\n\tif(s-(l&l))>=0:\n\t\ts-=l&-l\n\t\ta.append(l)\n\tl-=1\nif s: print(-1)\nelse:\n\tprint(len(a))\n\tprint(*a)\n \t \t \t\t \t \t \t\t\t \t\t \t\t\t", "'''\r\nCreated on 2016年3月4日\r\n\r\n@author: HaoGe\r\n'''\r\nsum,limit=map(int,input().split())\r\nlv=[]\r\nres=[]\r\nfor i in range(1, limit+1):\r\n j=0\r\n while i&(1<<j) == 0 :\r\n j+=1 \r\n lv.append([2**j,i])\r\n\r\nlv.sort()\r\ni=limit-1\r\nwhile i>=0 and sum>0:\r\n if sum-lv[i][0]>=0:\r\n sum-=lv[i][0]\r\n res.append(i)\r\n i-=1\r\nif sum>0:\r\n print(-1)\r\nelse:\r\n print(len(res))\r\n print(' '.join([str(lv[i][1]) for i in res]))\r\n\r\n \r\n \r\n\r\n", "s,l=map(int,input().split())\r\nr=[]\r\nwhile (l>0 and s>0):\r\n if s-(l&l)>=0:\r\n s-=(l&-l)\r\n r.append(l)\r\n l-=1\r\nif s!=0:\r\n print(-1)\r\nelse:\r\n print(len(r))\r\n print(*r)", "kk=lambda:map(int, input().split())\r\nsu,l=kk()\r\ncnts,i=[],0\r\nwhile 1:\r\n\tv = l//2**i\r\n\tv = v//2+(v&1)\r\n\tif v == 0: break\r\n\tcnts.append(v)\r\n\ti+=1\r\nc = 0\r\ns=[]\r\nfor i in range(len(cnts)-1,-1,-1):\r\n\tv = 2**i\r\n\twhile v <= l:\r\n\t\tif c + 2**i > su: break\r\n\t\ts.append(v)\r\n\t\tc+=2**i\r\n\t\tv+=2**(i+1)\r\nif c < su:\r\n\tprint(-1)\r\nelse:\r\n\tprint(len(s))\r\n\tprint(*s)", "from collections import defaultdict\nfrom bisect import bisect\n\n# lowbit(x) is the minimal 2**k that divides x\n\ns, l = [int(x) for x in input().split()]\n\n#n = set([i for i in range(1, l+1)])\n\nns = defaultdict(list)\n\n\nfor x in range(1, l+1):\n\n y = x\n c = 0\n while not y & 1:\n y = y >> 1\n c += 1\n\n ns[2**c].append(x)\n\n\n#print('ns', ns)\n\nvs = sorted(list(ns.keys()))\n\nres = []\nwhile s:\n # find x closest to s\n i = bisect(vs, s)\n\n if i == len(vs):\n i -= 1\n\n while i >= 0 and vs[i] > s:\n i -= 1\n \n while i >= 0 and not ns[vs[i]]:\n i -= 1\n\n if i == -1:\n break\n\n s -= vs[i]\n x = ns[vs[i]].pop()\n res.append(x)\n\n\nif s:\n print(-1)\nelse:\n print(len(res))\n print(*res)\n \n \n", "from collections import defaultdict\r\nmp=defaultdict(list)\r\nsm,limit=map(int,input().split())\r\nts=0\r\nv=set()\r\nfor i in range(1,limit+1):\r\n for j in range(32):\r\n if(i&(1<<j)!=0):\r\n mp[1<<j].append(i)\r\n v.add(1<<j)\r\n ts+=(1<<j)\r\n break\r\nans=[]\r\nif(sm>ts):\r\n print(-1)\r\nelse:\r\n v=list(v)\r\n v.sort(reverse=True)\r\n for i in v:\r\n for j in mp[i]:\r\n if(sm>=i):\r\n sm-=i \r\n ans.append(j)\r\n else:\r\n break\r\n print(len(ans))\r\n print(*ans)", "s,t = map(int,input().split())\r\nc = {}\r\narr = []\r\nfor i in range(t,0,-1):\r\n l = 0\r\n tmp = i\r\n while tmp%2==0:\r\n tmp /= 2\r\n l += 1\r\n if 2**l<=s:\r\n s -= 2**l\r\n arr.append(i)\r\nif s==0:\r\n print(len(arr))\r\n print(*arr)\r\nelse:\r\n print(-1)", "s , l = map(int,input().split())\nans = []\nwhile(s > 0 and l> 0):\n\tif(s - (l&l)) >= 0:\n\t\ts -= l&-l\n\t\tans.append(l)\n\tl-=1\nif s: \n\tprint(-1)\nelse:\n\tprint(len(ans))\n\tprint(*ans)\n", "# link: https://codeforces.com/contest/437/problem/B\r\n\r\nfor _ in range(1):\r\n sum_, limit_ = map(int, input().split())\r\n # brute force on the digits\r\n elements = set()\r\n for i in range(limit_, 0, -1):\r\n if i%2:\r\n if sum_ - 1 >= 0:\r\n sum_ -= 1\r\n elements.add(i)\r\n else:\r\n num = bin(i)[2:]\r\n c = 0 \r\n for j in num[::-1]:\r\n if j==\"1\":\r\n break\r\n else:\r\n c += 1\r\n if sum_ - (2**c) >= 0:\r\n sum_ -= pow(2, c)\r\n elements.add(i)\r\n if sum_ == 0:\r\n print(len(elements))\r\n print(*elements) \r\n else:\r\n print(-1) ", "__author__ = 'asmn'\n\ns, l = tuple(map(int, input().split(' ')))\nt = 1\nwhile (t << 1) <= s:\n t <<= 1\n\nans = []\nwhile s > 0 and t > 0:\n n = min((l // t + 1)//2, s // t)\n s -= t * n\n for i in range(n):\n ans.append((i*2+1) * t)\n t >>= 1\n\nif s > 0:\n print(-1)\nelse:\n print(len(ans))\n print(*tuple(ans))", "import math,sys\r\n#from itertools import permutations, combinations;import heapq,random;\r\nfrom collections import defaultdict,deque\r\nimport bisect as bi\r\ndef yes():print('YES')\r\ndef no():print('NO')\r\ndef I():return (int(sys.stdin.readline()))\r\ndef In():return(map(int,sys.stdin.readline().split()))\r\ndef Sn():return sys.stdin.readline().strip()\r\n#sys.setrecursionlimit(1500)\r\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 main():\r\n try:\r\n n,m=In()\r\n d=defaultdict(list)\r\n for i in range(1,m+1):\r\n z=math.log2(i&-i)\r\n d[int(2**z)].append(i)\r\n l=list(d.keys())\r\n l.sort(reverse=True)\r\n ans=[]\r\n for x in l:\r\n t=min(len(d[x]),n//x)\r\n for i in range(t):\r\n ans.append(d[x][i])\r\n n-=(t*x)\r\n if n==0:\r\n print(len(ans))\r\n print(*ans)\r\n else:\r\n print(-1)\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# ******************* All The Best ******************* #", "h,m=list(map(int,input().split()))\r\nk=[]\r\n\r\nwhile m>0:\r\n if h-m^(m&(m-1))>=0:\r\n h-=m^(m&(m-1))\r\n k.append(m)\r\n m-=1\r\nif h>0:\r\n print(-1)\r\nelse:\r\n print(len(k))\r\n print(*k)", "from functools import reduce\r\nimport os\r\nimport sys\r\nfrom collections import *\r\nfrom decimal import *\r\nfrom math import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom io import BytesIO, IOBase\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef value(): return tuple(map(int, input().split())) # multiple values\r\ndef arr(): return [int(i) for i in input().split()] # aay input\r\ndef sarr(): return [int(i) for i in input()] #aay from string\r\ndef starr(): return [str(x) for x in input().split()] #string aay\r\ndef inn(): return int(input()) # integer input\r\ndef svalue(): return tuple(map(str, input().split())) #multiple string values\r\ndef parr(): return [(value()) for i in range(n)] # aay of pairs\r\ndef Ceil(a,b): return a//b+int(a%b>0)\r\nalbhabet=\"abcdefghijklmnopqrstuvwxyz\"\r\nmo = 1000000007\r\ninf=1e18\r\ndiv=998244353\r\n#print(\"Case #{}:\".format(_+1),end=\" \")\r\n#print(\"Case #\",z+1,\":\",sep=\"\",end=\" \")\r\n# ----------------------------CODE------------------------------#\r\nsm,limit=value()\r\nd=defaultdict(list)\r\nfor i in range(1,limit+1):\r\n c=1\r\n j=i\r\n while(j&1==0):\r\n j=j>>1\r\n # print(i)\r\n c*=2\r\n d[c]+=[i]\r\na=[i for i in sorted(d.keys(),reverse=True)]\r\nn=len(a)\r\nans=[]\r\nfor i in a:\r\n mn=min(len(d[i]),sm//i)\r\n ans+=d[i][:mn]\r\n sm-=mn*i\r\n if(sm==0):\r\n break\r\nif(sm==0):\r\n print(len(ans))\r\n print(*ans)\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", "target, limit = map(int, input().split())\r\n\r\ndef lowbit(x):\r\n return x & (x ^ (x - 1))\r\n\r\nans = []\r\nfor i in range(limit, 0, -1):\r\n x = lowbit(i)\r\n if x <= target:\r\n ans.append(i)\r\n target -= x\r\n\r\nif target:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n print(\" \".join(map(str, ans)))\r\n \r\n", "a, b = map(int, input().split())\r\nres = []\r\nfor i in range(b, 0, -1):\r\n k = i & (i ^ (i - 1))\r\n if a >= k:\r\n res.append(str(i))\r\n a -= k\r\nif a > 0: \r\n print(-1)\r\nelse: \r\n print(len(res))\r\n print(*res)\r\n", "sum, limit = input().split()\nsum = int(sum); limit = int(limit)\nprev_sum = sum\n\ns = []\ncur_sum = 0\nif sum%2:\n\ts.append(1)\n\tsum -= 1\n\tcur_sum += 1\n\ncount = {}\nj = 0\nwhile sum > 0:\n\tif sum%2:\n\t\tcount[2**j] = 1\n\tsum = sum >> 1\n\tj += 1\n\noccur = [0 for i in range(limit+1)]\n\nwhile len(count) > 0:\n\tcur = next(iter(count))\n\tif cur == 1:\n\t\ti = 1\n\t\tif prev_sum%2:\n\t\t\ti = 3\n\t\twhile count[cur] > 0 and i <= limit:\n\t\t\ts.append(i)\n\t\t\tcur_sum += 1\n\t\t\ti += 2\n\t\t\tcount[cur] -= 1\n\n\telif cur > limit:\n\t\ttry:\n\t\t\tcount[cur//2] += 2*count[cur]\n\t\texcept:\n\t\t\tcount[cur//2] = 2*count[cur]\n\n\telse:\n\t\ti = 1\n\t\twhile count[cur] > 0 and i*cur <= limit:\n\t\t\twhile cur*i <= limit and occur[cur*i]:\n\t\t\t\ti += 2\n\t\t\tif cur*i <= limit:\n\t\t\t\ts.append(cur*i)\n\t\t\t\toccur[cur*i] += 1\n\t\t\t\tcur_sum += cur\n\t\t\t\tcount[cur] -= 1\n\n\t\tif count[cur] != 0:\n\t\t\ttry:\n\t\t\t\tcount[cur//2] += 2*count[cur]\n\t\t\texcept:\n\t\t\t\tcount[cur//2] = 2*count[cur]\n\n\tdel(count[cur])\n\t# print(count)\n\t# print(s, cur_sum, prev_sum)\n\n\nif cur_sum == prev_sum:\n\tprint(len(s))\n\tfor i in s:\n\t\tprint(i, end=\" \")\n\tprint()\n\nelse:\n\tprint(-1)\n\n", "# 405376\nfrom collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom bisect import bisect_right, bisect_left\nfrom fractions import Fraction as frac\nimport math\nhpop = heappop\nhpush = heappush\nMOD = 10**9 + 7\n\ndef solution():\n # val --> array\n\n #\n sum_, limit = map(int, input().split())\n first_bit_map = defaultdict(list) \n for num in range(1, limit+1):\n first_bit = num & -num\n first_bit_map[first_bit].append(num)\n first_bits = list(sorted(first_bit_map.keys(), reverse=True))\n \n res = []\n i = 0\n while i < len(first_bits) and sum_:\n val = first_bits[i]\n\n if val > sum_ or len(first_bit_map[val]) == 0:\n i += 1\n continue\n\n sum_ -= val \n p = first_bit_map[val].pop()\n res.append(p)\n\n if sum_ > 0:\n return print(-1)\n\n print(len(res))\n return print(\" \".join(map(str, res)))\n # 5 1\n # 5 0\n # 1 1\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n \n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n", "def main():\n n, m = map(int, input().split())\n step = 1 << (m.bit_length() - 1)\n m += 1\n l = [True] * m\n while step:\n if n >= step:\n for i in range(step, m, step):\n if l[i]:\n if n >= step:\n l[i] = False\n n -= step\n if not n:\n l = [j for j, f in enumerate(l) if not f]\n print(len(l))\n print(' '.join(map(str, l)))\n return\n else:\n break\n step //= 2\n print(-1)\n\n\nif __name__ == '__main__':\n main()\n", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\ndef main():\r\n s,l = map(int , input().split())\r\n a = []\r\n for i in range(l,0,-1):\r\n k = i & (-i)\r\n if s - k < 0:\r\n continue\r\n s -= k\r\n a.append(i)\r\n \r\n if s > 0:\r\n print(-1)\r\n else:\r\n print(len(a))\r\n print(*a)\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def lowval(i):\r\n global low\r\n return(low[i])\r\n\r\n\r\n# Main:\r\ns, lim = list(map(int, input().split()))\r\nlow = [0]\r\nresult = []\r\n\r\n# Create the list of lowbits\r\nm, pm = 1, 1\r\nwhile len(low) - 1 < lim:\r\n pm = len(low) - 1\r\n low += low[1:len(low) - 1] + [m]\r\n m *= 2\r\nelse: \r\n if len(low) - 1 == lim:\r\n pm = len(low) - 1\r\n\r\nd = list(range(lim + 1))\r\n\r\nx = sorted(d, key=lowval)\r\nx2 = list(map(lowval, x))\r\n\r\nfor i in range(lim, 0, -1):\r\n if x2[i] <= s:\r\n result.append(x[i])\r\n s -= x2[i]\r\n if s == 0:\r\n break\r\n\r\nif s != 0:\r\n print(-1)\r\nelse:\r\n print(len(result))\r\n for i in result:\r\n print(i, end=' ')\r\n print()\r\n\r\n", "def lb(n) : return 2**bin(n)[2:][::-1].find('1')\r\nsm, lm = map(int,input().split())\r\nl = [0]\r\nfor i in range(1,lm+1) : l.append(lb(i))\r\nif sum(l) < sm : print(-1)\r\nelif sum(l) == sm : print(lm); print(*[i for i in range(1,lm+1)])\r\nelse : \r\n s =[]\r\n for i in range(1,lm+1) : s.append((l[i],i))\r\n s.sort(reverse = 1)\r\n ans = []\r\n cr = 0 \r\n for i in range(len(s)) : \r\n if cr + s[i][0] < sm :ans.append(s[i][1]); cr+=s[i][0]\r\n elif cr + s[i][0] == sm : \r\n ans.append(s[i][1])\r\n break \r\n print(len(ans))\r\n print(*ans)\r\n", "som,lim = map(int,input().split())\r\nx = bin(som)[2:]\r\ny = bin(lim)[2:]\r\nimport math\r\n \r\ndef git(n): \r\n return int(math.log2(n&-n)+1)\r\nd = dict()\r\ne = dict()\r\nfor j in range(1,lim + 1):\r\n u = git(j)\r\n if u in d.keys():\r\n d[u] += 1\r\n e[u].append(j)\r\n else:\r\n d[u] = 1\r\n e[u] = [j]\r\nS = []\r\n\r\nn = len(y)\r\nwhile(n>=0 and som>0):\r\n if n not in e.keys():\r\n n -= 1\r\n elif len(e[n]) > 0 and som >= 2**(n-1):\r\n som -= 2**(n-1)\r\n S.append(e[n].pop())\r\n else:\r\n n -=1\r\nif som == 0:\r\n print(len(S))\r\n print(*S)\r\nelse:\r\n print(-1)", "\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\ndef array_print(arr):\r\n print(' '.join(map(str, arr)))\r\n\r\n\r\nsum, n = multi_input()\r\n\r\na = [0]*(n+1)\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n a[i] = 1\r\n else:\r\n a[i] = 2*a[i//2]\r\n\r\n# print(a)\r\nb = []\r\nnew_sum = flag = 0\r\nfor j in reversed(range(1,n+1)):\r\n if new_sum+a[j] <= sum:\r\n # print(j)\r\n new_sum += a[j]\r\n b.append(j)\r\n if new_sum==sum:\r\n flag = 1\r\n break\r\n\r\nif flag==0:\r\n print(-1)\r\nelse:\r\n print(len(b))\r\n array_print(b)", "s,l=map(int,input().split())\r\na=[]\r\nfor i in range(l,0,-1):\r\n n=i&-i\r\n if n<=s:\r\n s=s-n\r\n a.append(i)\r\nif s==0:\r\n print(len(a))\r\n for i in a: print(i,end=' ')\r\nelse:\r\n print(-1)\r\n", "s,l=input().split()\r\ns=int(s)\r\nl=int(l)\r\na=[]\r\nj=1\r\nfor i in range(1,l+1):\r\n count=0\r\n while(i>0):\r\n if((i&1)==0):\r\n count+=1\r\n else:\r\n a.append([2**count,j])\r\n break\r\n i=i>>1\r\n j+=1\r\na.sort()\r\nsum=0\r\nm=0\r\nans=[]\r\nfor ll in range(len(a)-1,-1,-1):\r\n if(sum+a[ll][0])<=s:\r\n sum+=a[ll][0]\r\n ans.append(str(a[ll][1]))\r\n if(sum==s):\r\n final=\" \".join(ans)\r\n print(len(ans))\r\n print(final)\r\n break\r\nelse:\r\n print(-1)", "import math\r\n\r\ndef low_bit(x):\r\n x = bin(x)[2::]\r\n bits = ''\r\n for i in x[::-1]:\r\n bits += i\r\n if i == '1':\r\n return int(bits[::-1], base=2)\r\n\r\ndef get_lower_2(x):\r\n x = bin(x)[2::]\r\n x = '1' + '0'*(len(x)-1)\r\n return int(x, base=2)\r\n\r\n\r\ns, l = map(int, input().split())\r\n\r\ndct = {1: [i for i in range(1, l+1, 2)], 2: []}\r\n\r\nfor x in range(2, l+1, 2):\r\n if x % 4 == 2:\r\n dct[2].append(x)\r\n else:\r\n v = low_bit(x)\r\n try:\r\n dct[v].append(x)\r\n except:\r\n dct[v] = [x]\r\n\r\np = int(math.log2(get_lower_2(l)))\r\nlst = []\r\nc = 0\r\nfor i in range(p, -1, -1):\r\n while 2**i <= s:\r\n try:\r\n lst.append(dct[2**i].pop(0))\r\n s -= 2**i\r\n except:\r\n break\r\n\r\nif s > 0:\r\n print(-1)\r\n exit(0)\r\nprint(len(lst))\r\nprint(*lst)", "s,l=input().split()\r\ns=int(s)\r\nl=int(l)\r\na=[]\r\nfor i in range(1,l+1):\r\n j=1\r\n count=1\r\n while i&j==0:\r\n count*=2\r\n j=j<<1\r\n a.append([count,i])\r\na.sort()\r\na.reverse()\r\nans=[]\r\nans1=0\r\nfor ll in range(len(a)):\r\n if a[ll][0]<=s:\r\n s-=a[ll][0]\r\n ans+=[str(a[ll][1])]\r\n ans1+=1\r\nif s==0:\r\n print(ans1)\r\n print(' '.join(ans))\r\nelse:\r\n print(-1)\r\n\r\n", "def bin(n):\r\n res = \"\"\r\n while (n != 0):\r\n if n % 2 == 0:\r\n res += \"0\"\r\n n = n // 2\r\n else:\r\n res += \"1\"\r\n return res[: : -1]\r\n\r\n\r\ndef main():\r\n sum, limit = list(map(int, input().split()))\r\n A = []\r\n for i in range(1, limit + 1):\r\n A.append((int(bin(i), 2), i))\r\n A.sort(reverse=True,key= lambda x: x[0])\r\n res = []\r\n for i in range(0, limit):\r\n if sum == 0: break\r\n if sum >= A[i][0]:\r\n sum -= A[i][0]\r\n res.append(A[i][1])\r\n if sum != 0: \r\n print(-1)\r\n return\r\n print(len(res))\r\n print(*res)\r\n\r\n \r\nif __name__ == '__main__':\r\n main()", "from math import log2, ceil\r\nfrom collections import deque\r\n\r\ndef lowbit(n):\r\n s = str(bin(n))[2:]\r\n i = len(s) - 1\r\n cnt = 0\r\n while s[i] != \"1\":\r\n i -= 1\r\n cnt += 1\r\n return cnt\r\n\r\ns, l = [int(i) for i in input().split()]\r\na = []\r\nlow = [deque() for i in range(ceil(log2(l)) + 1)]\r\nfor i in range(1, l + 1):\r\n x = lowbit(i)\r\n low[x].append(i)\r\ni = len(low) - 1\r\nres = []\r\nwhile i >= 0:\r\n if s == 0:\r\n break\r\n if len(low[i]) > 0 and 2 ** i <= s:\r\n s -= 2 ** i\r\n res.append(low[i].popleft())\r\n else:\r\n i -= 1\r\nif s == 0:\r\n print(len(res))\r\n print(\" \".join([str(i) for i in res]))\r\nelse:\r\n print(-1)", "import math\r\nt=1\r\nfor _ in range(t):\r\n #n=int(input())\r\n a=list(map(int, input().split()))\r\n summ=a[0]\r\n limit=a[1]\r\n r=[]\r\n for i in range(limit, 0, -1):\r\n if int(bin(i&-i), 2)<=summ:\r\n r.append(i)\r\n summ-=int(bin(i&-i), 2)\r\n if summ:\r\n print (-1)\r\n else:\r\n print (len(r))\r\n print (*r)\r\n", "def low(n):\r\n x=str(bin(n))[2:]\r\n x=x[::-1]\r\n t=x.index(\"1\")\r\n temp=x[:t+1][::-1]\r\n return (int(temp,2))\r\n\r\ndef child_set(s,limit):\r\n lst=[[i,low(i)] for i in range(1,limit+1)]\r\n lst=[[0,0]]+lst\r\n lst=sorted(lst,reverse=True,key=lambda s:s[1])\r\n i=0\r\n ans=[]\r\n while s and lst and i<len(lst):\r\n if lst[i][1]<=s:\r\n s-=lst[i][1]\r\n ans.append(lst[i][0])\r\n lst.pop(i)\r\n else:\r\n i+=1\r\n if s:\r\n return -1\r\n else:\r\n print(len(ans))\r\n print(*ans)\r\n return \"\"\r\n\r\n\r\na,b=map(int,input().strip().split())\r\nprint(child_set(a,b))", "s, l = map(int, input().split())\r\n\r\nresult = set()\r\n\r\nfor i in range(l, 0, -1):\r\n if not s:\r\n break\r\n ii = i & (-i)\r\n if s - ii >= 0:\r\n s -= ii\r\n result.add(str(i))\r\n\r\nif s:\r\n print(-1)\r\nelse:\r\n print(len(result))\r\n \r\n print(' '.join(result))\r\n ", "import math\r\nimport sys\r\nimport collections\r\nimport bisect\r\nimport string\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 s,l=get_ints()\r\n ans=dict()\r\n for i in range(1,l+1):\r\n val=i\r\n c=0\r\n while val&1!=1:\r\n val>>=1\r\n c+=1\r\n number=2**c\r\n if number not in ans:\r\n ans[number]=[i]\r\n else:\r\n ans[number].append(i)\r\n key=list(ans.keys())\r\n key.sort(reverse=True)\r\n sol=[]\r\n for i in key:\r\n val=min(len(ans[i]),s//i)\r\n for j in range(val):\r\n sol.append(ans[i][j])\r\n s-=val*i\r\n #print(sol)\r\n if s==0:\r\n print(len(sol))\r\n print(*sol)\r\n else:\r\n print(-1)", "\"\"\"\r\n Template written to be used by Python Programmers.\r\n Use at your own risk!!!!\r\n Owned by enraged(rating - 5 star at CodeChef and Specialist at Codeforces).\r\n\"\"\"\r\nimport sys\r\nimport bisect\r\nimport heapq\r\nfrom math import *\r\nfrom collections import defaultdict as dd # defaultdict(<datatype>) Free of KeyError.\r\nfrom collections import deque # deque(list) append(), appendleft(), pop(), popleft() - O(1)\r\nfrom collections import Counter as c # Counter(list) return a dict with {key: count}\r\nfrom itertools import combinations as comb\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\r\n# sys.setrecursionlimit(2*pow(10, 6))\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\nmod = pow(10, 9) + 7\r\nmod2 = 998244353\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(var): sys.stdout.write(var)\r\ndef l(): return list(map(int, data().split()))\r\ndef sl(): return list(map(str, data().split()))\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 [[val for i in range(n)] for j in range(m)]\r\n\r\n\r\ndef lower_two(n):\r\n i = 17\r\n answer = 1\r\n while i >= 0:\r\n answer = max(answer, gcd(int(pow(2, i)), n))\r\n i -= 1\r\n return answer\r\n\r\n\r\ns, limit = sp()\r\ndp = dict()\r\nfor i in range(1, limit+1):\r\n dp[i] = lower_two(i)\r\nprefix = sum(dp.values())\r\ndp = sorted(dp.items(), key=lambda x: x[1])\r\nif s > prefix:\r\n out(\"-1\")\r\n exit(0)\r\nanswer = []\r\nfor i in range(len(dp)-1, -1, -1):\r\n if dp[i][1] <= s:\r\n answer.append(dp[i][0])\r\n s -= dp[i][1]\r\n if s == 0:\r\n break\r\nout(str(len(answer))+\"\\n\")\r\nfor i in answer:\r\n out(str(i)+\" \")\r\nexit()\r\n", "R=lambda:map(int,input().split())\r\ns,l=R()\r\nimport math as m\r\nb=[]\r\ny=2\r\nfor i in range(1,l+1):\r\n if(i%2!=0):\r\n t=[i,1]\r\n b.append(t)\r\n elif(m.log(i,2)==int(m.log(i,2))):\r\n y=i\r\n t=[i,i]\r\n b.append(t)\r\n else:\r\n h=y\r\n while(i%h!=0):\r\n h=h//2\r\n t=[i,h]\r\n b.append(t)\r\nb=sorted(b,key=lambda x:x[1],reverse=True)\r\nq=0\r\nd=True\r\nf=[]\r\nfor j in b:\r\n q+=j[1]\r\n f.append(j)\r\n if(q==s):\r\n d=False\r\n break\r\n elif(q>s):\r\n q-=j[1]\r\n f.remove(j)\r\nif(d):\r\n print(-1)\r\n quit()\r\nprint(len(f))\r\nfor k in f:\r\n print(k[0],end=' ')\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s,l=map(int,input().split())\narr=sorted([(i&-i,i) for i in range(1,l+1)])\nans=[]\nfor c,i in arr[::-1]:\n if s==0:\n break\n if c<=s:\n ans.append(i);s-=c;\nif s:print('-1')\nelse:\n print(len(ans));print(*ans)\n", "class 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\ns,l = g()\r\n \r\nres = []\r\ni = 16\r\nwhile i+1:\r\n c = 1\r\n while True:\r\n if 2**i * c > l: break\r\n if 2**i > s: break\r\n res.append(2**i * c)\r\n c += 2\r\n s -= 2**i\r\n i -= 1\r\nif s:\r\n print(-1)\r\nelse:\r\n print(len(res))\r\n print(\" \".join(str(x) for x in res))", "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\nsm,limit=L()\r\nd={}\r\nfor i in range(limit,0,-1):\r\n x=bin(i)[2:]\r\n idx=(x[::-1]).index(\"1\")\r\n if idx not in d:\r\n d[idx]=[]\r\n d[idx].append(i)\r\nx=list(d.keys())\r\nx.sort(reverse=True)\r\ni=0\r\nA=[]\r\nwhile(i<len(x)):\r\n curr=2**(x[i])\r\n j=0\r\n while(sm>0 and curr<=sm and j<len(d[x[i]])):\r\n sm-=curr\r\n A.append(d[x[i]][j])\r\n j+=1\r\n if sm==0:\r\n break\r\n i+=1\r\nif sm!=0 or len(A)==0:\r\n print(-1)\r\n exit() \r\nprint(len(A))\r\nprint(*A)\r\n\r\n", "n, l = map(int, input().split())\r\ni = 1\r\nwhile 2*i < n:\r\n i *= 2\r\nres = []\r\n\r\nwhile n and i:\r\n for j in range(i, l+1, 2*i):\r\n if i > n:\r\n break\r\n else:\r\n res.append(j)\r\n n -= i\r\n i //= 2\r\nif n == 0:\r\n print(len(res))\r\n print(*res)\r\nelse:\r\n print(-1)", "s, l = map(int, input().split())\nx = []\nfor i in range(1, l + 1):\n x.append((i & -i, i))\nss = sum([x[i][0] for i in range(len(x))])\nif ss < s: print(-1)\nelse:\n x = sorted(x, reverse=True) \n xx = 0; res = []; rc = 0\n for i in range(len(x)):\n if xx + x[i][0] <= s:\n xx += x[i][0]\n res.append(x[i][1])\n rc += 1\n if xx == s:\n print(rc)\n for i in range(rc):\n print(res[i], end=' ')\n else:\n print(-1)\n", "# Author : Mohamed Yousef \r\n# Date : 2023-04-30\r\nimport sys,math,bisect,collections,itertools,heapq\r\nfrom itertools import accumulate ,combinations ,permutations,chain\r\nfrom collections import defaultdict,deque,Counter\r\nsys.setrecursionlimit(50000) #To increase Recursion depth in py\r\ndef mvalues():return map(int,sys.stdin.readline().split())\r\ndef lvalues():return list(map(int,sys.stdin.readline().split()))\r\ndef svalues():return sys.stdin.readline().strip()\r\ndef test():return int(sys.stdin.readline())\r\n\r\nsum, limit = mvalues()\r\ndef TwoDArray (sum,limit):\r\n arr = []\r\n for i in range(limit,0,-1):\r\n count = 0\r\n constant = i\r\n while constant % 2 != 1:\r\n constant = constant // 2\r\n count += 1\r\n temp = [i, 2 ** count]\r\n arr.append(temp)\r\n return arr\r\ndef solve(sum,limit):\r\n arr=TwoDArray(sum,limit)\r\n ans = []\r\n i = 0\r\n while sum != 0 and i < limit:\r\n if sum - arr[i][1] >= 0:\r\n sum -= arr[i][1]\r\n ans.append(arr[i][0])\r\n i += 1\r\n if sum == 0:\r\n return (len(ans), ans)\r\n return (-1,-1)\r\nn, ans =solve(sum, limit)\r\nif n != -1:\r\n print(n)\r\n sys.stdout.write(\" \".join(map(str,ans)) + \"\\n\")\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n", "x, y = map(int, input().split())\r\na = []\r\nfor i in range(y, 0, -1):\r\n s = i & (i ^ (i - 1))\r\n if(x >= s):\r\n x -= s\r\n a.append(i);\r\nif(x > 0):\r\n print(-1)\r\nelse:\r\n print(str(len(a)))\r\n print(*a)", "s,l=map(int,input().split())\r\nval=[]\r\nfor i in range(1,l+1):\r\n for b in range(17):\r\n if i&(1<<b):\r\n val.append([1<<b,i])\r\n break\r\nval.sort(reverse=True)\r\nans=[]\r\nfor i in val:\r\n if i[0]<=s:\r\n s-=i[0]\r\n ans.append(i[1])\r\nif s>0:\r\n print(-1)\r\n quit()\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i,end=\" \")", "def lowbit(n):\r\n binary_n = bin(n).replace(\"0b\", \"\")\r\n last_1 = 0\r\n for i,v in enumerate(binary_n[::-1]):\r\n if v=='1':\r\n last_1 = len(binary_n)-i-1\r\n break\r\n lowbit_n = binary_n[last_1::]\r\n return int(lowbit_n,2)\r\n\r\nsumm,limit = list(map(int,input().split()))\r\nans=[]\r\nfor i in range(limit,0,-1):\r\n if(i%2==0) and summ>0:\r\n if(lowbit(i)<=summ):\r\n ans.append(i)\r\n summ-=lowbit(i)\r\nfor i in range(1,limit+1):\r\n if(i%2!=0) and summ>0:\r\n ans.append(i)\r\n summ-=1\r\nif summ==0:\r\n print(len(ans))\r\n print(*ans)\r\nelse:\r\n print(-1)", "from typing import Tuple\r\n\r\ndef lowbit(x: int) -> Tuple[int, int]:\r\n if x & 1:\r\n return 1, x\r\n else:\r\n idx = 0\r\n tmp = x\r\n while not (x & 1):\r\n x >>= 1\r\n idx += 1\r\n return pow(2, idx), tmp\r\n\r\nlst, ans = [], []\r\nsm, lim = map(int, input().split())\r\nfor i in range(lim):\r\n lst.append(lowbit(i+1))\r\n \r\nlst = sorted(lst, key=lambda x: x[0], reverse=True)\r\n\r\ni=0\r\nwhile(sm>0 and lim>0):\r\n if lst[i][0]>sm:\r\n i += 1\r\n else:\r\n sm -= lst[i][0]\r\n ans.append(lst[i])\r\n lim -= 1\r\n i += 1\r\nif sm>0:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n for p in ans:\r\n print(p[1], end=\" \")\r\n ", "s,lim=map(int,input().split())\r\nt=[]\r\np=[]\r\nfor el in range(1,lim+1):\r\n for b in range(0,30):\r\n if el&(1<<b):\r\n if b==0:\r\n p.append(el)\r\n else:\r\n \r\n t.append((1<<b,el))\r\n break\r\nt.sort(key=lambda x:x[0])\r\nans=[]\r\nwhile s>len(p) and t:\r\n v,num=t.pop()\r\n if s>=v:\r\n s-=v\r\n ans.append(num)\r\nwhile s>0 and p:\r\n num=p.pop()\r\n ans.append(num)\r\n s-=1\r\nif s:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n print(*ans)\r\n ", "from collections import defaultdict\r\n\r\ndef solve():\r\n\r\n d = defaultdict(lambda : [0])\r\n\r\n SUM, limit = map(int, input().split())\r\n\r\n def lowest_bit(number):\r\n i = 1\r\n while number & i == 0:\r\n i <<= 1\r\n return i\r\n\r\n for i in range(1, limit + 1):\r\n index = lowest_bit(i)\r\n d[index].append(i)\r\n d[index][0] += 1\r\n\r\n i = 1\r\n ans = []\r\n while i < 2**32:\r\n if SUM & i:\r\n if d[i][0] > 0:\r\n ans.append(d[i][d[i][0]])\r\n d[i][0] -= 1\r\n else:\r\n need = 2\r\n power = i // 2\r\n while need > 0 and power > 0:\r\n pop_these = min(need, d[power][0])\r\n need -= pop_these\r\n if need > 0: \r\n need *= 2\r\n for _ in range(pop_these):\r\n ans.append(d[power][d[power][0]])\r\n d[power][0] -= 1\r\n power >>= 1\r\n if need > 0:\r\n return -1\r\n i <<= 1\r\n\r\n return ans\r\n\r\nret = solve()\r\nif ret == -1:\r\n print(-1)\r\nelse:\r\n print(len(ret))\r\n for i in ret:\r\n print(i, end=' ')\r\n print()", "sum, limit = map(int, input().split())\r\n\r\nans = []\r\nwhile limit > 0 and sum > 0:\r\n if (limit & -limit) <= sum:\r\n sum -= (limit & -limit)\r\n ans.append(limit)\r\n limit -= 1\r\n\r\nif sum > 0:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n print(*ans)", "from math import *\n\ns, l = map(int, input().split())\nmL = floor(log2(l))\nmS = floor(log2(l))\nx = min(mL, mS)\n\nS = []\nwhile x >= 0:\n\ta = 1\n\twhile 2 ** x <= s and a * 2 ** x <= l:\n\t\tS.append(a * 2 ** x)\n\t\ta += 2\n\t\ts -= 2 ** x\n\tx -= 1\nif s == 0:\n\tprint(len(S))\n\tprint(' '.join(map(str, S)))\nelse:\n\tprint(-1)", "# cook your dish here\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter\r\nfrom itertools import permutations\r\nimport bisect\r\nimport math\r\nI=lambda: map(int,stdin.readline().split())\r\nI1=lambda: stdin.readline()\r\n#(a/b)%m =((a%m)*pow(b,m-2)%m)%m\r\n\r\ndef lowbit(x):\r\n return x & (-x)\r\n\r\ns,l=I()\r\na=[]\r\nfor i in range(l,0,-1):\r\n x=lowbit(i)\r\n if x<=s:\r\n s-=x \r\n a.append(i)\r\n if s==0:\r\n break\r\nif s!=0:\r\n print(-1)\r\n exit()\r\nprint(len(a))\r\nprint(*a)", "n,m=map(int,input().split())\r\ndic={1<<i:[] for i in range(20)}\r\ndef lowbit(x):\r\n return x&~(x-1)\r\nfor i in range(1,m+1):\r\n dic[lowbit(i)].append(i)\r\ndicn={1<<i:0 for i in range(21)}\r\nans=[]\r\nfor i in reversed(range(20)):\r\n f=1<<i\r\n if f&n or dicn[f]:\r\n if len(dic[f])>=((f&n)!=0)+dicn[f]:\r\n ans+=dic[f][:((f&n)!=0)+dicn[f]]\r\n else:\r\n if f<=1:\r\n ans=-1\r\n break\r\n l=(((f&n)!=0)+dicn[f])-len(dic[f])\r\n ans+=dic[f][:len(dic[f])]\r\n dicn[f>>1]+=l*2\r\nif ans==-1:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n print(*ans)", "def arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\nfrom sys import stdin\r\n\r\nall, ans = [], []\r\nsum, limit = arr_inp()\r\nfor i in range(1, limit + 1):\r\n if i & 1:\r\n all.append([i, 1])\r\n else:\r\n c, num = 1, i\r\n while (True):\r\n num >>= 1\r\n if num & 1:\r\n all.append([i, 2 ** c])\r\n break\r\n c += 1\r\n\r\nall.sort(key=lambda x: x[1])\r\n\r\nfor i in range(limit - 1, -1, -1):\r\n if all[i][1] <= sum:\r\n ans.append(all[i][0])\r\n sum -= all[i][1]\r\n if sum == 0:\r\n print(len(ans))\r\n exit(print(*ans))\r\n\r\nprint(-1)\r\n", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\n\r\ndef main():\r\n s,n=rm()\r\n dv=[2**i for i in range(18)]\r\n ml=[[] for i in range(18)]\r\n for i in range(1,n+1):\r\n for j in range(17,-1,-1):\r\n if i%dv[j]==0: ml[j].append(i); break\r\n r=[]\r\n for i in range(17,-1,-1):\r\n if len(ml[i])*dv[i]<s: \r\n s-=len(ml[i])*dv[i]\r\n r.extend(ml[i])\r\n else:\r\n q,s=divmod(s,dv[i])\r\n r.extend(ml[i][:q])\r\n if s!=0: return []\r\n return r\r\nr=main()\r\nif r:\r\n print(len(r))\r\n print(*r)\r\nelse:\r\n print(-1)\r\n", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int, input().split()))\r\np2=[1]\r\nfor i in range(18):\r\n p2+=[(p2[-1]*2)]\r\nN=10**5+5\r\nlb=[0]\r\nfor i in range(1,N):\r\n for bp in range(18):\r\n if ((i>>bp)&1):\r\n pos=bp\r\n break\r\n lb+=[p2[pos]]\r\nfor i in range(1):#nmbr():\r\n sm,n=lst()\r\n v=n\r\n ans=set()\r\n while v>0:\r\n if v<=sm:\r\n sm-=lb[v]\r\n ans.add(v)\r\n v-=1\r\n if sm==0:break\r\n if sm!=0:print(-1)\r\n else:\r\n print(len(ans))\r\n for v in ans:stdout.write(str(v)+' ')\r\n\r\n\r\n", "import math\r\na,b=map(int,input().split())\r\nl=[]\r\ns=0\r\nc=0\r\ndef ffs(n):\r\n return math.log2(n&-n)+1\r\nfor i in range(b,0,-1):\r\n d=ffs(i)\r\n ad=2**(d-1)\r\n if(s+ad<=a):\r\n l.append(i)\r\n s=s+ad\r\n c=c+1\r\nif(s==a):\r\n print(c)\r\n print(*l)\r\nelse:\r\n print(\"-1\")\r\n \r\n \r\n", "sum, limit = map(int, input().split())\r\nl = []\r\nfor i in range(limit, 0, -1):\r\n c = bin(i)[2:]\r\n c = c[::-1]\r\n index = c.index('1')\r\n if sum-(2**index)>=0:\r\n sum = sum-(2**index)\r\n l.append(i)\r\n if sum == 0:\r\n break\r\nif sum== 0:\r\n print(len(l))\r\n print(*l)\r\nelse:\r\n print(-1)\r\n \r\n\r\n \r\n" ]

{"inputs": ["5 5", "4 3", "5 1", "54321 12345", "1997 508", "100000 30000", "100000 100000", "1 100000", "29985 15678", "83451 17526", "96024 12472", "21741 3575", "40287 17817", "58934 6404", "62658 10881", "89829 8298", "5499 1023", "5499 1024", "53689 10552", "247 3270", "58413 1253", "47283 15757", "93145 14496", "66947 17657", "49940 18445", "61897 33128", "97660 28794", "99808 14000", "100000 1", "1 1", "100000 14047", "100000 14048", "21741 3576"], "outputs": ["2\n4 5", "3\n2 3 1", "-1", "7008\n8958 8925 11009 10808 8221 9771 11269 7017 6416 11723 10324 5654 6569 10454 9164 10754 6069 7913 12154 11111 7361 9619 9829 6664 8468 7239 5453 11577 11423 10031 11624 11486 11984 5378 8695 8640 9957 10453 11538 11943 9558 7846 12099 9317 11626 7001 5975 8923 9528 6850 10896 5989 10638 10500 10645 7253 12066 11635 5414 8824 7375 7771 8206 10398 11255 10687 7478 6385 11536 9511 7360 6646 5653 7317 9011 8265 9961 5817 9556 9903 5421 10281 6812 9312 6289 5468 8832 7075 7268 9545 12173 6126 6750 7789 740...", "429\n372 314 295 417 413 215 501 175 275 251 381 258 320 378 389 318 440 505 317 471 257 504 414 331 139 438 193 460 445 239 494 236 147 391 359 497 137 131 249 106 439 310 262 165 189 292 284 132 319 486 279 185 355 266 306 194 229 464 136 478 407 97 383 408 288 214 506 197 469 458 157 419 221 451 167 244 220 429 424 201 181 448 479 241 237 264 150 392 123 233 336 280 254 330 187 289 300 360 382 98 368 130 313 481 463 345 370 216 195 450 433 118 94 152 253 79 308 485 499 202 465 435 418 277 105 255 500 16...", "14127\n26613 18365 28664 17829 21130 27426 21717 24672 24071 19607 19925 18270 20786 18268 26819 18080 22887 17706 19483 19506 25016 20111 27484 24319 19265 19207 23108 18049 21756 19686 17917 20556 16214 23033 20478 16698 22390 22634 29193 15951 21420 25501 22429 26972 29281 17977 15947 20937 16929 24505 28551 18726 21728 28155 19143 24908 16146 20285 17685 26479 17361 25426 22492 20423 21741 22680 25133 24040 29191 27166 17529 24301 23308 24972 16663 25920 27616 23472 27211 27558 23076 27936 24467 26967 ...", "10735\n96613 91015 98664 98463 91130 97426 91717 94672 94071 89606 89924 93309 90786 92311 96819 90266 92887 95568 89482 89505 95016 90110 97484 94319 89677 91493 93108 99232 91756 89685 99279 90556 91261 93033 90478 89768 92390 92634 99193 99598 91420 95501 92429 96972 99281 91403 93630 90937 97183 94505 98551 93644 91728 98155 98300 94908 99721 90285 91440 96479 95030 95426 92492 90423 91741 92680 95133 94040 99191 97166 89517 94301 93308 94972 92077 95920 97616 93472 97211 97558 93076 97936 94467 96967 ...", "1\n99999", "4368\n12291 12258 14342 14141 11554 13104 14602 15169 14887 15056 13657 12832 13865 13787 12497 14087 12934 14599 15487 14444 11956 12952 13162 15113 11801 12732 14195 14910 14756 13364 14957 14819 15317 12023 12028 11973 13290 13786 14871 15276 12891 15480 15432 12650 14959 14893 13483 12256 12861 14335 14229 11522 13971 13833 13978 12923 15399 14968 14781 12157 14840 12905 11539 13731 14588 14020 12343 15367 14869 12844 12431 15589 14489 13240 12344 11598 13294 13937 12889 13236 15351 13614 11665 12645 1...", "10644\n14139 8541 16190 15989 8656 14952 9243 12198 11597 7132 7450 10835 8312 9837 14345 7791 10413 13094 7008 7031 12542 7636 15010 11845 7203 9019 10634 16758 9282 7211 16805 8081 8787 10559 8003 7294 9916 10160 16719 17124 8946 13027 9955 14498 16807 8929 11156 8463 14709 12031 16077 11170 9254 15681 15826 12434 17247 7810 8966 14005 12556 12952 10018 7948 9267 10206 12659 11566 16717 14692 7043 11827 10834 12498 9603 13446 15142 10998 14737 15084 10602 15462 11993 14493 9323 10649 7358 12256 12449 930...", "-1", "-1", "4069\n14430 14397 16481 16280 14255 15243 16741 17308 17026 17195 15796 14971 16004 15926 14636 16226 15073 16738 17626 16583 14095 15091 15301 17252 13940 14871 16334 17049 16895 15503 17096 16958 17456 14162 14167 14112 15429 15925 17010 17415 15030 17619 17571 14789 17098 17032 15622 14395 15000 16474 16368 15258 16110 15972 16117 15062 17538 17107 16920 14296 16979 15044 15580 15870 16727 16159 14482 17506 17008 14983 14570 17728 16628 15379 14483 13847 15433 16076 15028 15375 17490 15753 13803 14784 1...", "-1", "8365\n7494 7461 9545 9344 6757 8307 2598 5553 4952 10259 8860 4190 2991 3192 7700 9290 3768 6449 10690 9647 5897 8155 8365 5200 3867 5775 3989 10113 2637 8567 10160 10022 10520 3914 7231 7176 3271 3515 10074 10479 8094 6382 3310 7853 10162 5537 4511 7459 8064 5386 9432 4525 2609 9036 9181 5789 10602 10171 3950 7360 5911 6307 3373 8934 2622 3561 6014 4921 10072 8047 5896 5182 4189 5853 2958 6801 8497 4353 8092 8439 3957 8817 5348 7848 2678 4004 3747 5611 5804 2657 10709 4662 5286 6325 5940 7248 2855 3912 62...", "-1", "-1", "871\n346 262 304 933 200 223 161 515 233 402 159 373 180 894 325 834 956 1021 833 366 488 1020 482 459 655 445 546 256 213 755 303 165 663 547 260 552 653 647 217 622 300 826 778 681 305 239 800 648 835 252 795 565 871 246 573 710 745 314 220 332 186 613 899 160 349 559 1022 713 215 587 673 935 737 324 683 290 736 945 240 258 697 964 995 383 753 780 212 908 639 591 852 174 770 172 703 805 540 876 898 293 508 646 468 364 979 861 886 567 711 401 949 516 610 263 769 421 824 1001 1015 579 188 951 934 483 621 4...", "6908\n7165 7132 9216 9015 6428 7978 9476 5224 4623 9930 8531 3861 4776 8661 7371 8961 4276 6120 10361 9318 5568 7826 8036 4871 6675 5446 3660 9784 9630 8238 9831 9693 10191 6897 6902 6847 8164 8660 9745 10150 7765 6053 10306 7524 9833 5208 4182 7130 7735 5057 9103 4196 8845 8707 8852 5460 10273 9842 9655 7031 5582 5978 6413 8605 9462 8894 5685 4592 9743 7718 5567 4853 3860 5524 7218 6472 8168 4024 7763 8110 4831 8488 5019 7519 4496 3675 7039 5282 5475 7752 10380 4333 4957 5996 5611 6919 3792 8542 5897 6811...", "62\n3228 3223 3212 3243 3230 3241 3263 3227 3255 3265 3262 3239 3261 3235 3219 3236 3231 3267 3210 3233 3258 3266 3237 3232 3252 3218 3251 3222 3242 3216 3256 3238 3253 3247 3214 3259 3217 3211 3269 3215 3220 3246 3221 3225 3264 3244 3250 3257 3209 3248 3234 3268 3260 3229 3254 3270 3245 3226 3213 3240 3249 3224", "-1", "7089\n12370 12337 14421 14220 11633 13183 14681 10429 9828 15135 13736 9066 9981 13866 12576 14166 9481 11325 15566 14523 10773 13031 13241 10076 8743 10651 8865 14989 14835 13443 15036 14898 15396 8790 12107 12052 13369 13865 14950 15355 12970 11258 15511 12729 15038 10413 9387 12335 12940 10262 14308 9401 14050 13912 14057 10665 15478 15047 8826 12236 10787 11183 11618 13810 14667 14099 10890 9797 14948 12923 10772 10058 9065 10729 12423 11677 13373 9229 12968 13315 8833 13693 10224 12724 8670 8880 12244...", "12533\n11109 2861 13160 2325 5626 11922 6213 9168 8567 4103 4421 2766 5282 2764 11315 2576 7383 2202 3979 4002 9512 4607 11980 8815 3761 3703 7604 2545 6252 4182 2413 5052 5757 7529 4974 4265 6886 7130 13689 14094 5916 9997 6925 11468 13777 2473 8126 5433 11679 9001 13047 3222 6224 12651 3639 9404 14217 4781 2181 10975 9526 9922 6988 4919 6237 7176 9629 8536 13687 11662 2025 8797 7804 9468 6573 10416 12112 7968 11707 12054 7572 12432 8963 11463 6293 7619 4329 9226 9419 6272 14324 8277 8901 5655 1983 10863 ...", "7720\n14270 14237 16321 16120 13533 15083 16581 12329 11728 17035 15636 10966 11881 9968 14476 16066 10544 13225 17466 16423 12673 14931 15141 11976 10643 12551 10765 16889 16735 15343 16936 16798 17296 10690 14007 13952 10047 10291 16850 17255 14870 13158 10086 14629 16938 12313 11287 14235 14840 12162 16208 11301 15950 15812 15957 12565 17378 16947 10726 14136 12687 13083 10149 15710 16567 10337 12790 11697 16848 14823 12672 11958 10965 12629 14323 13577 15273 11129 14868 15215 10733 15593 12124 14624 10...", "5320\n15058 15025 17109 16908 14321 15871 17369 17936 17654 17823 16424 15599 16632 16554 15264 16854 15701 14013 18254 17211 13461 15719 15929 17880 14568 13339 13680 17677 17523 16131 17724 17586 18084 14790 14795 14740 16057 16553 17638 18043 15658 13946 18199 15417 17726 17660 16250 15023 15628 17102 16996 14289 16738 16600 16745 13353 18166 17735 17548 14924 13475 13871 14306 16498 17355 16787 13578 13628 17636 15611 13460 18356 13731 13417 15111 14365 16061 16704 15656 16003 18118 16381 14432 15412 1...", "4993\n29741 29708 31792 31591 29004 30554 32052 32619 32337 32506 31107 30282 31315 31237 29947 31537 30384 28696 32937 31894 28143 30402 30612 32563 29251 30182 28362 32360 32206 30814 32407 32269 32767 29473 29478 29423 30740 31236 32321 32726 30341 28628 32882 30100 32409 32343 30933 29706 30311 31785 31679 28972 31421 31283 31428 30373 32849 32418 32231 29607 28157 28553 28989 31181 32038 31470 28260 28310 32319 30294 28142 33039 28413 30690 29794 29048 30744 31387 30339 30686 32801 31064 29115 30095 3...", "13667\n25407 17159 27458 16623 19924 26220 20511 23466 22865 18401 18719 17064 19580 17062 25613 16874 21681 16500 18277 18300 23810 18905 26278 23113 18059 18001 21902 16843 20550 18480 16711 19350 20055 21827 19272 15491 21184 21428 27987 28392 20214 24295 21223 25766 28075 16771 22424 19731 15722 23299 27345 17520 20522 26949 17937 23702 28515 19079 16479 25273 16154 24220 21286 19217 20535 21474 23927 22834 27985 25960 16322 23095 22102 23766 15456 24714 26410 22266 26005 26352 21870 26730 23261 25761 ...", "14000\n10613 2365 12664 1829 5130 11426 5717 8672 8071 3607 3925 2270 4786 2268 10819 2080 6887 1706 3483 3506 9016 4111 11484 8319 3265 3207 7108 2049 5756 3686 1917 4556 215 7033 4478 698 6390 6634 13193 13598 5420 9501 6429 10972 13281 1977 7630 4937 929 8505 12551 2726 5728 12155 3143 8908 147 4285 1685 10479 1361 9426 6492 4423 5741 6680 9133 8040 13191 11166 1529 8301 7308 8972 663 9920 11616 7472 11211 11558 7076 11936 8467 10967 5797 7123 3833 8730 8923 5776 13828 7781 8405 5159 1487 10367 4313 321...", "-1", "1\n1", "-1", "14043\n10661 2413 12712 1877 5178 11474 5765 8720 8119 3655 3973 2318 4834 2316 10867 2128 6935 1754 3531 3554 9064 4159 11532 8367 3313 3255 7156 2097 5804 3734 1965 4604 263 7081 4526 746 6438 6682 13241 13646 5468 9549 6477 11020 13329 2025 7678 4985 977 8553 12599 2774 5776 12203 3191 8956 195 4333 1733 10527 1409 9474 6540 4471 5789 6728 9181 8088 13239 11214 1577 8349 7356 9020 711 9968 11664 7520 11259 11606 7124 11984 8515 11015 5845 7171 3881 8778 8971 5824 13876 7829 8453 5207 1535 10415 4361 326...", "3573\n189 156 2240 2039 14 1002 2500 3067 2785 2954 1555 730 1763 1685 395 1985 832 2497 3385 2342 3040 850 1060 3011 1487 630 2093 2808 2654 1262 2855 2717 3215 3099 1631 1199 1188 1684 2769 3174 789 3378 3330 548 2857 2791 1381 154 759 2233 2127 1017 1869 1731 1876 821 3297 2866 2679 55 2738 803 1339 1629 2486 1918 241 3265 2767 742 329 3487 2387 1138 242 1400 1192 1835 787 1134 3249 1512 1563 543 2398 3332 63 1702 2231 776 3404 510 2668 469 2243 1016 1057 1566 943 667 1411 3198 699 499 3531 2227 576 157..."]}

UNKNOWN

PYTHON3

CODEFORCES

104

8f93f9bd8f9064af561ecdf39f5a1e37

Alternating Current

Mad scientist Mike has just finished constructing a new device to search for extraterrestrial intelligence! He was in such a hurry to launch it for the first time that he plugged in the power wires without giving it a proper glance and started experimenting right away. After a while Mike observed that the wires ended up entangled and now have to be untangled again. The device is powered by two wires "plus" and "minus". The wires run along the floor from the wall (on the left) to the device (on the right). Both the wall and the device have two contacts in them on the same level, into which the wires are plugged in some order. The wires are considered entangled if there are one or more places where one wire runs above the other one. For example, the picture below has four such places (top view): Mike knows the sequence in which the wires run above each other. Mike also noticed that on the left side, the "plus" wire is always plugged into the top contact (as seen on the picture). He would like to untangle the wires without unplugging them and without moving the device. Determine if it is possible to do that. A wire can be freely moved and stretched on the floor, but cannot be cut. To understand the problem better please read the notes to the test samples. The single line of the input contains a sequence of characters "+" and "-" of length *n* (1<=≤<=*n*<=≤<=100000). The *i*-th (1<=≤<=*i*<=≤<=*n*) position of the sequence contains the character "+", if on the *i*-th step from the wall the "plus" wire runs above the "minus" wire, and the character "-" otherwise. Print either "Yes" (without the quotes) if the wires can be untangled or "No" (without the quotes) if the wires cannot be untangled. Sample Input -++- +- ++ - Sample Output Yes No Yes No

[ "t = input()\r\n#-+-++--+\r\nstack = []\r\nfor i in t:\r\n\ttry:\r\n\t\tif stack[-1] == i:\r\n\t\t\tstack.pop()\r\n\t\telse:\r\n\t\t\tstack.append(i)\r\n\texcept:\r\n\t\tstack.append(i)\r\nif len(stack) == 0:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "arr = list(input())\nans = []\nfor i in arr:\n if len(ans)==0:\n ans.append(i)\n else:\n if ans[-1]==i:\n ans.pop(-1)\n else:\n ans.append(i)\nif len(ans):\n print('No')\nelse:\n print('Yes')\n \t\t \t \t\t \t\t\t\t \t\t \t\t \t\t \t", "current=input()\ncurrent_stack=[]\nflag=0\n#current_stack.append(current[0])\nfor i in range(0,len(current)):\n if current_stack.__len__()==0:\n current_stack.append(current[i])\n continue\n if current[i]==current_stack[-1]:\n current_stack.pop()\n \n else: \n current_stack.append(current[i]) \n\n \n\nif len(current_stack):\n print(\"No\")\nelse:\n print(\"Yes\") ", "s = input()\r\nl = []\r\n \r\nfor i in s:\r\n\tif len(l) and i == l[-1]:\r\n\t\tdel l[-1]\r\n\telse:\r\n\t\tl.append(i)\r\n \r\nprint('Yes' if l == [] else 'No')", "from sys import stdin, stdout\ndef fin(): return stdin.readline().strip()\ndef fout(x): stdout.write(str(x) + '\\n')\n\nstk = []\nfor i in fin():\n if stk and stk[-1] == i: stk.pop()\n else: stk.append(i)\nif not stk: fout('Yes')\nelse: print('No')", "a=input()\r\nb,c=1,a[0]\r\nfor i in range(1,len(a)):\r\n if a[i]!=c:\r\n b+=1\r\n else:\r\n b-=1\r\n c='+' if c=='-' else '-'\r\nprint('Yes' if b==0 else 'No')", "sequence = input().strip()\n\nif len(sequence) % 2 != 0:\n print('No')\nelse:\n stack = []\n for s in sequence:\n if stack and s == stack[-1]:\n stack.pop()\n else:\n stack.append(s)\n\n if stack:\n print('No')\n else:\n print('Yes')", "l = list(input())\nnew = ''\nidx = 0\nif len(l)%2!=0:\n print('No')\nelse:\n for i in range(len(l)):\n if i%2!=0:\n if l[i]=='+':\n l[i]='A'\n else:\n l[i]='B'\n else:\n if l[i]=='+':\n l[i]='B'\n else:\n l[i]='A'\n stack = []\n for i in l:\n if stack:\n if stack[-1]!=i:\n stack.pop()\n else:\n stack.append(i)\n else:\n stack.append(i)\n if stack:\n print('No')\n else:\n print('Yes')\n", "def can_untangle_wires(sequence):\n stack = []\n\n for char in sequence:\n if stack and stack[-1] == char:\n stack.pop()\n else:\n stack.append(char)\n\n return \"Yes\" if not stack else \"No\"\n\n\n# Read the sequence of characters\nsequence = input()\n\n# Check if the wires can be untangled\nresult = can_untangle_wires(sequence)\n\n# Print the result\nprint(result)\n\n\t\t\t\t \t \t\t\t\t \t \t\t\t \t\t \t", "n = str(input())\r\nm=[1]\r\nif len(n)==1 and n=='-':\r\n print(\"No\")\r\nelif len(n)==1 and n=='+':\r\n print('No')\r\nelse:\r\n\r\n for i in n:\r\n if i=='+' and i!=m[-1]:\r\n m.append('+')\r\n elif i=='-' and i!=m[-1]:\r\n m.append(i)\r\n else:\r\n if m[len(m)-1]==i:\r\n m.pop()\r\n\r\n if len(m)==1 :\r\n print(\"Yes\")\r\n else:\r\n print('No')", "# https://codeforces.com/contest/343/problem/B\r\n\r\ninp_arr = input()\r\n\r\nstack = []\r\nfor i in inp_arr:\r\n if not stack:\r\n stack.append(i)\r\n else:\r\n if stack[-1] == i:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n\r\nif stack:\r\n print('No')\r\nelse:\r\n print('Yes')", "ch = input()\r\nstack = []\r\nfor i in ch:\r\n if i == \"+\":\r\n if stack != [] and stack[len(stack) - 1] == \"+\":\r\n stack.pop(len(stack) - 1)\r\n else:\r\n stack.append(i)\r\n else:\r\n if stack != [] and stack[len(stack) - 1] == \"-\":\r\n stack.pop(len(stack) - 1)\r\n else:\r\n stack.append(i)\r\nif stack==[]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def possi(s):\r\n if len(s)%2==1:\r\n return \"No\" \r\n stack=[]\r\n stack.append(s[0])\r\n for i in range(1,len(s)):\r\n if s[i]==\"+\" and stack and stack[-1]==\"+\":\r\n stack.pop()\r\n elif s[i]==\"-\" and stack and stack[-1]==\"-\":\r\n stack.pop()\r\n else:\r\n stack.append(s[i])\r\n if len(stack)!=0:\r\n return \"No\"\r\n return \"Yes\"\r\ns=input()\r\nprint(possi(s))", "s = input()\r\nstack = []\r\n\r\nif len(s) % 2 != 0:\r\n print('No')\r\n exit()\r\n\r\nfor symbol in s:\r\n if not stack:\r\n stack.append(symbol)\r\n elif stack[-1] == symbol:\r\n stack.pop()\r\n else:\r\n stack.append(symbol)\r\n\r\nif not stack:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "import sys, math\r\nfrom os import path\r\n# from TestCaseGen import test\r\n\r\nINF = math.inf\r\n\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 solve(s):\r\n stack = []\r\n for c in s:\r\n if len(stack) == 0:\r\n stack.append(c)\r\n else:\r\n if c == stack[-1] in \"+-\":\r\n stack.pop()\r\n else:\r\n stack.append(c)\r\n return \"Yes\" if len(stack) == 0 else \"No\"\r\n\r\ndef main():\r\n # test(10, -100, 100, 10)\r\n for _ in range(1):\r\n s = getString()\r\n printInt(solve(s))\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n################## UTILITY FUNCTIONS #######################\r\n\r\ndef getInt():\r\n return int(sys.stdin.readline().strip())\r\n\r\ndef getInts():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\ndef getList():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef getString():\r\n return sys.stdin.readline().strip()\r\n\r\ndef printInt(n):\r\n sys.stdout.write(str(n) + '\\n')\r\n\r\ndef printList(arr):\r\n sys.stdout.write(' '.join(map(str, arr)) + '\\n')\r\n\r\ndef printString(s):\r\n sys.stdout.write(s + '\\n')\r\n\r\nmain()\r\n", "def stackcheck(v):\n stack = []\n stack.append(v[0])\n for i in range(1, len(v)):\n if len(stack) == 0:\n stack.append(v[i])\n continue\n temp = stack.pop()\n if v[i] == temp:\n continue\n else:\n stack.append(temp)\n stack.append(v[i])\n\n return \"YES\" if len(stack) == 0 else \"NO\"\n \n\ndef main():\n v = input()\n print(stackcheck(v))\n\nmain()\n\t \t \t \t \t\t\t \t \t\t \t\t\t", "# cook your dish here\r\ns = input()\r\n\r\nst= []\r\nfor i in s:\r\n if st == []:\r\n st.append(i)\r\n else:\r\n if st[-1] == i:\r\n st.pop()\r\n else:\r\n st.append(i)\r\nif st == []:\r\n print('Yes')\r\nelse:\r\n print(\"No\")", "import heapq\r\nimport math\r\nimport os\r\nfrom collections import Counter, deque, defaultdict\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nimport threading\r\nfrom heapq import *\r\nimport random\r\n\r\n\r\ndef S():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef IS():\r\n return sys.stdin.readline().replace('\\n', '')\r\n\r\n\r\ndef main():\r\n s = IS()\r\n queue = deque(s[0])\r\n n = len(s)\r\n if n % 2 == 1:\r\n print('No')\r\n return\r\n for i in range(1, n):\r\n if queue:\r\n last = queue.pop()\r\n el = s[i]\r\n if el != last:\r\n queue.append(last)\r\n queue.append(el)\r\n else:\r\n queue.append(s[i])\r\n if len(queue) > 0:\r\n print('No')\r\n else:\r\n print('Yes')\r\n\r\n\r\nif __name__ == '__main__':\r\n # for _ in range(II()):\r\n # main()\r\n main()", "from collections import deque\r\nwire = input()\r\nl = len(wire)\r\ns = []\r\ntop = 0\r\nfor c in wire:\r\n s.append(c)\r\n top += 1\r\n while(top >= 2 and s[-1] == s[-2]):\r\n s.pop()\r\n s.pop()\r\n top -= 2\r\nif(top == 0):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "a = input()\r\na = list(a)\r\nk = []\r\nfor i in a:\r\n if not k:\r\n k.append(i)\r\n elif i != k[-1]:\r\n k.append(i)\r\n else:\r\n k.pop()\r\nif k:\r\n print('No')\r\nelse:\r\n print('Yes')", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nNeo = lambda : list(map(int,input().split()))\r\n# test, = Neo()\r\ns = input()\r\nst = ['1']\r\nfor i in s:\r\n if st[-1] == i:\r\n st.pop()\r\n else:\r\n st.append(i)\r\nif len(st) == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "# import sys\r\n# sys.stdout=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\output.txt','w')\r\n# sys.stdin=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\input.txt','r')\r\n\r\n\r\nimport heapq\r\nimport math\r\nimport collections\r\nimport bisect\r\nmod=10**9+7\r\ndef solve(s):\r\n\r\n stack=[]\r\n for i in s:\r\n if not stack:\r\n stack.append(i)\r\n elif stack[-1]==i:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n if not stack:\r\n return \"YES\"\r\n return \"NO\" \r\n \r\n\r\ndef main():\r\n # t=int(input())\r\n# for _ in range(t):\r\n # n=int(input())\r\n s=input() \r\n print(solve(s)) \r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n", "s=input()\r\nif(len(s)%2!=0):\r\n print(\"No\")\r\nelse:\r\n st=[]\r\n for i in s:\r\n if(st==[]):\r\n st.append(i)\r\n else:\r\n if(i==st[-1]):\r\n st.pop()\r\n else:\r\n st.append(i)\r\n if(st==[]):\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "import sys\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_string(): return sys.stdin.readline().strip()\ndef get_int(): return int(sys.stdin.readline().strip())\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\n\n\n# Output for list\n# sys.stdout.write(\" \".join(map(str, final)) + \"\\n\")\n\n# Output for int or str\n# sys.stdout.write(str(best) + \"\\n\")\n\n\n\ndef solve(s):\n plus = 0\n minus = 0\n\n stack = []\n\n for ele in s:\n if ele == '+':\n if stack:\n if stack[-1] == '+':\n stack.pop()\n else:\n stack.append(ele)\n else:\n stack.append(ele)\n\n else:\n if stack:\n if stack[-1] == '-':\n stack.pop()\n else:\n stack.append(ele)\n else:\n stack.append(ele)\n \n if len(stack) == 0:\n print('Yes')\n else:\n print('No')\n\n\n\n\n\n\n\n\n\n\n\n\n\ns = get_string()\nsolve(s)\n", "s = input()\r\nstack=[]\r\nf=1\r\nfor c in s:\r\n if len(stack)==0:\r\n stack.append(c)\r\n else: \r\n if stack[-1]==c:\r\n stack.pop()\r\n else: stack.append(c)\r\nif len(stack)>0:\r\n print(\"No\")\r\nelse: print(\"Yes\")\r\n\r\n\n# Sun Jan 09 2022 07:26:43 GMT+0000 (Coordinated Universal Time)\n", "s = input()\r\nst = []\r\nfor x in s:\r\n if not st or st[-1] != x:\r\n st.append(x)\r\n else:\r\n st.pop()\r\nif st:\r\n print('No')\r\nelse:\r\n print('Yes')", "W,st = list(input()),[]\r\n\r\nfor i in W:\r\n\tif len(st) and st[-1]==i:\r\n\t\tst.pop()\r\n\telse:\r\n\t\tst.append(i)\r\n\r\nprint('No') if len(st) else print('Yes')", "# program to find whether cables can be untangaled or not\n\ndef tangledOrNot(s):\n if len(s) % 2 == 1:\n return \"No\"\n else:\n stack = []\n for ch in s:\n if len(stack) and stack[-1] == ch:\n stack.pop()\n else:\n stack.append(ch)\n return 'Yes' if len(stack) == 0 else 'No'\n\n\ns = input()\nprint(tangledOrNot(s))", "stack = []\r\ns = input()\r\n\r\nfor value in s:\r\n if not stack:\r\n stack.append(value)\r\n elif value == stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(value)\r\n \r\nif not stack:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\nstack = ['#']\nfor c in input():\n if stack[-1] == c:\n stack.pop()\n else:\n stack.append(c)\n\nstack.pop()\nprint(\"No\" if len(stack) else \"Yes\")\n", "s = input()\r\nl = [s[0]]\r\nlen1 = len(s)\r\ni = 1\r\nflag = 0\r\nwhile i < len1:\r\n p = l.pop()\r\n if p != s[i]:\r\n l.append(p)\r\n l.append(s[i])\r\n i+=1\r\n else:\r\n i+=1\r\n if len1 == i and len(l) == 0:\r\n flag = 1\r\n print('Yes')\r\n else:\r\n if len(l) == 0:\r\n l.append(s[i])\r\n i+=1\r\nif flag == 0:\r\n try:\r\n l.pop()\r\n print('No')\r\n except:\r\n print('Yes')", "s=input()\r\nst=[]\r\nfor i in range(0,len(s)):\r\n if len(st)==0 or st[-1]!=s[i]:\r\n st.append(s[i])\r\n else:\r\n st.pop()\r\nif st:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\n\nclass Solution:\n\n\tdef entangled(self, nums):\n\t\tstack = []\n\n\t\twhile nums:\n\t\t\t\n\t\t\tx = nums.pop()\n\n\t\t\tif stack:\n\t\t\t\tif stack[-1] == x:\n\t\t\t\t\tstack.pop()\n\t\t\t\telse:\n\t\t\t\t\tstack.append(x)\n\t\t\telse:\n\t\t\t\tstack.append(x)\n\n\t\tif stack:\n\t\t\tprint(\"NO\")\n\t\telse:\n\t\t\tprint(\"YES\")\t\n\n\n\ndef main():\n\n\tsol = Solution()\n\n\tnums = list(input().strip())\n\n\tsol.entangled(nums)\n\t\n\nif __name__ == '__main__':\n\n\tmain()", "wires_order= input()\r\nif len(wires_order)==1:\r\n print(\"No\")\r\nelse:\r\n stack=[]\r\n for ind in range(len(wires_order)):\r\n if stack and stack[-1]==wires_order[ind]:\r\n stack.pop()\r\n else:\r\n stack.append(wires_order[ind])\r\n print(\"No\") if stack else print(\"Yes\")", "'''We can untangle iff adjacent characters are equal'''\r\nintp=[i for i in input()]\r\nstack=['_']\r\nif len(intp)%2:\r\n print(\"No\")\r\nelse:\r\n \r\n for i in intp:\r\n if i==stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n print(\"Yes\" if len(stack)==1 else \"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", "l=input()\r\nl=list(l)\r\n\r\np=[]\r\n\r\nfor i in l:\r\n\tif len(p)==0:\r\n\t\tp.append(i)\r\n\telif p[-1]==i:\r\n\t\tp.pop()\r\n\telse:\r\n\t\tp.append(i)\r\n\t#print(p)\r\nif len(p)==0:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "ans = []\r\nfor c in input():\r\n if ans and c == ans[-1]:\r\n ans.pop()\r\n else:\r\n ans.append(c)\r\nprint('No' if ans else 'Yes')\r\n\r\n", "import random, math, sys\n\ninput = sys.stdin.readline\n\n# Function to call the actual solution\ndef solution(s):\n\tstack = []\n\ts = s[::-1]\n\tfor i in s:\n\t\tif stack and stack[-1] == i:\n\t\t\tstack.pop()\n\t\telse:\n\t\t\tstack.append(i)\n\treturn not bool(len(stack))\n\n\n# Function to take input\ndef input_test():\n\ts = input().strip()\n\tout = solution(s)\n\tprint(\"YES\" if out else \"NO\")\n\n\n\ninput_test()\n# test()", "s = input()\r\nstack = []\r\n\r\nfor i in s:\r\n\tif(stack and i== stack[-1]):\r\n\t\t\tstack.pop()\r\n\telse:\r\n\t\tstack.append(i)\r\n\r\nif(stack==[]):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "S=list(input())\r\ncharge=[]\r\ntop=-1\r\nno_of_notes=0\r\nfor i in S:\r\n c=i\r\n if top==-1:\r\n charge.append(c)\r\n top+=1\r\n no_of_notes+=1\r\n else:\r\n if c==charge[top]:\r\n no_of_notes-=1\r\n charge.pop()\r\n top-=1\r\n else:\r\n no_of_notes+=1\r\n charge.append(c)\r\n top+=1\r\nif top==-1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a=[]\r\ns=input()\r\nfor i in s:\r\n if len(a)==0: a.append(i)\r\n elif i==a[-1]: a.pop()\r\n else: a.append(i)\r\nif len(a)==0: print(\"Yes\")\r\nelse: print(\"No\")", "s = input()\r\nst = list()\r\nfor i in s:\r\n if st and st[-1] == i:\r\n st.pop()\r\n else:\r\n st.append(i)\r\nif not st:\r\n print('Yes')\r\nelse:\r\n print('No')", "s = input()\r\n\r\nstk = []\r\n\r\nfor i in s:\r\n if stk != [] and stk[-1] == i:\r\n stk.pop()\r\n else:\r\n stk.append(i)\r\nprint('Yes' if stk == [] else 'No')", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\nstri = input()\r\nS = []\r\nfor i in stri:\r\n if len(S) == 0:\r\n S.append(i)\r\n elif i == \"+\" and S[-1] == \"+\":\r\n S.pop()\r\n elif i == \"-\" and S[-1] == \"-\":\r\n S.pop()\r\n else:\r\n S.append(i)\r\nprint(\"Yes\") if len(S) == 0 else print(\"No\")", "def solve():\r\n s = input()\r\n n = len(s)\r\n if n & 1:\r\n print(\"NO\")\r\n return\r\n st = []\r\n for i in range(n):\r\n now = s[i]\r\n if st and now == st[-1]:\r\n st.pop()\r\n else:\r\n st.append(now)\r\n if not st:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == '__main__':\r\n solve()", "\n# from collections import deque\n\ns = input()\nstack = [s[0]]\nfor i in range(1, len(s)):\n if len(stack) == 0 or s[i] != stack[-1]:\n stack.append(s[i])\n else:\n stack.pop()\n\nprint(\"Yes\") if len(stack) == 0 else print(\"No\")\n\n \t\t \t \t\t \t\t\t\t \t \t\t \t \t \t", "ac = list(input())\n\nstack = []\n\nfor each in ac:\n \n stack.append(each) \n while len(stack) >=2 and stack[-1] == stack[-2]:\n stack.pop()\n stack.pop()\n\n \n \nif len(stack)==0:\n print(\"Yes\")\nelse:\n print(\"No\")", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import Counter\r\n\r\nS = input()\r\nA = []\r\nfor c in S:\r\n if A and A[-1]==c:\r\n A.pop()\r\n else:\r\n A.append(c)\r\n\r\nif A:\r\n print('No')\r\nelse:\r\n print('Yes')", "stack = []\r\n\r\ns = input()\r\n\r\nfor c in s:\r\n if stack and stack[-1] == c:\r\n stack.pop()\r\n else:\r\n stack.append(c)\r\n\r\nif stack:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n", "s = []\r\nfor c in input():\r\n if s and c == s[-1]:\r\n s.pop()\r\n else:\r\n s.append(c)\r\nif s:\r\n print('No')\r\nelse:\r\n print('Yes')", "plus=minus=0;c=1\r\nfor i in input():\r\n if c%2!=0:\r\n if i=='-':\r\n minus +=1\r\n else: \r\n plus +=1 \r\n else:\r\n \r\n if i=='-':\r\n plus +=1\r\n else: \r\n minus +=1 \r\n c+=1 \r\nprint(['No','Yes'][plus==minus])\r\n \r\n", "def proc(s):\r\n stack = []\r\n for e in s:\r\n if not stack:\r\n stack.append(e)\r\n elif stack[-1] == e:\r\n stack.pop()\r\n else:\r\n stack.append(e)\r\n return len(stack) == 0\r\n\r\n\r\ns = input()\r\nprint('Yes' if proc(s) else 'No')\r\n", "s=input()\r\nstack=[' ']*100000\r\ni=0\r\np=-1\r\nwhile i<len(s):\r\n if p!=-1 and stack[p]==s[i]:\r\n p-=1\r\n i+=1\r\n else:\r\n p+=1\r\n stack[p]=s[i]\r\n i+=1\r\nif p==-1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "sequence = input()\nstack = []\nfor each in sequence:\n\tif len(stack) == 0:\n\t\tstack.append(each)\n\telif stack[len(stack)-1] == each:\n\t\tstack.pop()\n\telse:\n\t\tstack.append(each)\n\t\nif len(stack) == 0:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n \t\t \t \t \t\t\t \t\t\t\t\t \t\t\t\t\t", "s = input()\r\nst = []\r\nfor c in s:\r\n if st and st[-1]==c:\r\n st.pop()\r\n else:\r\n st.append(c)\r\nif st:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys\nimport collections\ndef solve():\n vals = list(input())\n q = collections.deque()\n for cur in vals:\n if len(q) > 0 and q[0] == cur:\n q.popleft()\n else:\n q.appendleft(cur)\n if len(q) == 0: return \"Yes\"\n return \"No\"\n\n \ndef read(mode=2):\n inputs = input().strip()\n if mode == 0: return inputs # String\n if mode == 1: return inputs.split() # List of strings\n if mode == 2: return list(map(int, inputs.split())) # List of integers\ndef write(s=\"\\n\"):\n if s is None: s = \"\"\n if isinstance(s, list): s = \" \".join(map(str, s))\n if isinstance(s, tuple): s = \" \".join(map(str, s))\n s = str(s)\n print(s, end=\"\")\ndef run():\n # if sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\n res = solve()\n write(res)\nrun()", "lst = []\r\n\r\nfor i in input():\r\n lst.append(i)\r\n if len(lst) == 1:\r\n continue\r\n if lst[-1] == lst[-2]:\r\n lst.pop()\r\n lst.pop()\r\nif len(lst) == 0:\r\n print('YES')\r\nelse:\r\n print('No')\r\n", "s = input()\nans = [0] * len(s)\nn = 0\nfor x in s:\n if n and ans[n-1] == x:\n n -= 1\n else:\n ans[n] = x\n n += 1\nif n > 0:\n print(\"No\")\nelse:\n print(\"Yes\")", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sat Sep 1 15:18:19 2018\n\n@author: all_blue\n\"\"\"\n\nsequence = [char for char in input().strip()]\nstack = []\n\nfor char in sequence:\n if len(stack) == 0:\n stack.append(char)\n elif char == stack[-1]:\n stack.pop()\n else:\n stack.append(char)\n\nprint(\"Yes\" if len(stack) == 0 else \"No\")", "import collections as col\r\nimport math, string\r\nfrom functools import reduce\r\nfrom random import randint\r\n\r\ndef getInts():\r\n return [int(s) for s in input().split()]\r\n\r\ndef getInt():\r\n return int(input())\r\n\r\ndef getStrs():\r\n return [s for s in input().split()]\r\n\r\ndef getStr():\r\n return input()\r\n\r\ndef listStr():\r\n return list(input())\r\n\r\nMOD = 10**9+7\r\n\r\n\"\"\"\r\n\r\n\"\"\"\r\n\r\ndef solve():\r\n S = getStr()\r\n N = len(S)\r\n queue = []\r\n for i in range(N):\r\n if not queue or queue[-1] != S[i]:\r\n queue.append(S[i])\r\n else:\r\n queue.pop()\r\n return \"No\" if queue else \"Yes\"\r\n \r\n#for _ in range(getInt()):\r\nprint(solve())", "from collections import deque\nli=deque()\nn=input()\nfor i in n:\n\tif(len(li)==0):\n\t\tli.append(i)\n\telif(i==li[-1]):\n\t\tli.pop()\n\telse:\n\t\tli.append(i)\nif len(li)==0:\n\tprint('Yes')\nelse:\n\tprint(\"No\")\n \t \t \t \t \t\t \t \t \t \t\t", "s = input()\nstk = []\nfor ch in s:\n if len(stk) > 0 and stk[-1] == ch:\n stk.pop()\n else:\n stk.append(ch)\nif len(stk) == 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "def untangle_wires(sequence):\n stack = []\n\n for wire in sequence:\n if stack and stack[-1] == wire:\n # If the current wire is the same as the top wire on the stack, remove it.\n stack.pop()\n else:\n # Otherwise, add the current wire to the stack.\n stack.append(wire)\n\n # If the stack is empty after processing all wires, they can be untangled.\n if not stack:\n return \"Yes\"\n else:\n return \"No\"\n\n# Read input sequence\nsequence = input().strip()\n\n# Call the function to untangle the wires and print the result.\nprint(untangle_wires(sequence))\n\n\t \t \t \t\t \t\t \t \t \t \t\t \t \t \t", "from collections import deque\ns = input()\ndq = deque()\nfor ch in s:\n if len(dq)==0:\n dq.append(ch)\n else:\n if ch=='-' and dq[-1]=='-':\n dq.pop()\n elif ch =='+' and dq[-1]=='+':\n dq.pop()\n else:\n dq.append(ch)\nif len(dq)==0:\n print('Yes')\nelse:\n print('No')\n\n\t\t\t\t \t \t \t \t\t\t \t\t\t\t \t \t", "s = input()\r\nstack = []\r\nfor char in s:\r\n if stack and stack[-1] == char:\r\n stack.pop()\r\n else:\r\n stack.append(char)\r\n\r\nif stack:\r\n print('NO')\r\nelse:\r\n print(\"YES\")", "\r\ns = input() \r\n\r\narr = [s[0]] \r\n\r\nfor i in range(1, len(s)):\r\n c = s[i]\r\n if arr and c == arr[-1]:\r\n arr.pop() \r\n else:\r\n arr.append(c) \r\n\r\nprint(\"No\" if arr else \"Yes\") \r\n", "s=input()\nn=len(s)\np=[]\nfor i in range(n):\n if len(p)==0:\n p.append(s[i])\n continue\n if p[-1]==s[i]:\n p.pop()\n else:\n p.append(s[i])\nif len(p)==0:\n print('YES')\nelse:\n print('NO')\n\n\t \t \t \t \t\t \t\t \t\t \t \t \t", "def can_untangle_wires(sequence):\n stack = []\n\n for char in sequence:\n if not stack or stack[-1] != char:\n stack.append(char)\n else:\n stack.pop()\n\n return \"Yes\" if not stack else \"No\"\n\n# Read input\nsequence = input()\n\n# Check if the wires can be untangled\nresult = can_untangle_wires(sequence)\n\n# Print the result\nprint(result)\n\n\t\t\t \t \t\t\t\t\t\t\t\t\t \t\t \t \t", "def solve(sequence):\n stack = []\n for char in sequence:\n if not stack or char != stack[-1]:\n stack.append(char)\n else:\n stack.pop()\n if not stack:\n return \"Yes\"\n else:\n return \"No\"\n\nsequence = input().strip()\nprint(solve(sequence))\n\n\n\t\t\t\t\t\t \t\t \t\t \t \t\t\t\t \t\t\t\t", "s=input()\r\nn=len(s)\r\nlst=[]\r\nfor i in range(n):\r\n if lst==[]:\r\n lst.append(s[i])\r\n continue;\r\n if lst[-1]==s[i]:\r\n lst.pop(-1)\r\n else:\r\n lst.append(s[i])\r\nif lst==[]:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s=input()\r\nl=[]\r\nfor i in s:\r\n if len(l)==0:\r\n l.append(i)\r\n elif i==l[-1]:\r\n l.pop()\r\n else:\r\n l.append(i)\r\nif len(l)==0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "def desenrredar(cable):\r\n \r\n pasos = len(cable)\r\n \r\n if pasos % 2 == 1:\r\n return pasos\r\n \r\n if \"++\" in cable:\r\n cable = cable.replace(\"++\", \"\")\r\n if \"--\" in cable:\r\n cable = cable.replace(\"--\", \"\")\r\n \r\n cable = list(cable) \r\n pos = -1\r\n \r\n while pos <= len(cable):\r\n pos += 1\r\n if len(cable) == 0:\r\n break\r\n if (pos + 1) < len(cable) and pos >= 0:\r\n if cable[pos] == cable[pos + 1]:\r\n cable.pop(pos)\r\n cable.pop(pos)\r\n pos -= 2\r\n if (pos - 1) >= 0 and pos < len(cable):\r\n if cable[pos] == cable[pos - 1]:\r\n cable.pop(pos)\r\n cable.pop(pos - 1)\r\n pos -= 2\r\n \r\n return len(cable)\r\n\r\ncables = input()\r\nif desenrredar(cables) == 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input().strip()\r\na = ['K']\r\nfor i in s:\r\n if a[-1]==i:\r\n a.pop()\r\n else:\r\n a.append(i)\r\nif len(a)==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "wires = input()\nc = 0\nd = 0\nfor i in range(len(wires)):\n if (wires[i] == '+'):\n c+=2*(i%2) - 1\n if (wires[i] == '-'):\n d+=2*(i%2) - 1\nif c==0 and d==0:\n print(\"Yes\")\nelse:\n print(\"No\")\n# 1532030829894\n", "def run(s):\n arr=[]\n for c in s:\n if not arr or arr[-1]!=c:\n arr.append(c)\n else:arr.pop()\n return \"No\" if arr else \"Yes\"\n\ns=input()\n\nans=run(s)\nprint(ans)\n\t\t\t\t \t\t\t \t\t\t\t\t \t \t\t\t \t\t", "a = list(input())\r\nn = len(a)\r\n\r\ns = list()\r\nfor i in range(n):\r\n if not s or s[-1] != a[i]:\r\n s.append(a[i])\r\n else:\r\n s.pop(-1)\r\n\r\nprint('No' if s else 'Yes')", "def can_untangle_wires(sequence):\n stack = []\n\n for char in sequence:\n if len(stack) == 0:\n stack.append(char)\n else:\n if stack[-1] == char:\n stack.pop()\n else:\n stack.append(char)\n\n return len(stack) == 0\n\n# Read the input\nsequence = input().strip()\n\n# Check if wires can be untangled\nif can_untangle_wires(sequence):\n print(\"Yes\")\nelse:\n print(\"No\")\n\n\t\t \t \t \t \t \t \t\t\t \t \t\t", "from typing import List, Tuple\nfrom collections import defaultdict, deque, namedtuple\nfrom heapq import heappush as push, heappop as pop\nimport sys \n\nINF = (int)(1e9+7)\n\nsys.setrecursionlimit(INF)\n\n\ndef alternatingCurrent(wires):\n\n\n\tstk = []\n\n\tfor upperWire in wires:\n\n\n\t\tif stk and stk[-1] == upperWire:\n\t\t\tstk.pop()\n\t\t\tcontinue\n\n\t\tstk.append(upperWire)\n\n\n\tif stk:\n\t\treturn 'No'\n\n\treturn 'Yes'\n\n\n\n\n\n\n\n\nif __name__ == \"__main__\":\n\n\n\n\twires = input()\n\n\tprint(alternatingCurrent(wires))\n\n\n\n\n", "# your code goes here\nfrom collections import deque\ns=deque()\nn=input()\nfor i in n:\n\tif len(s)==0:\n\t\ts.append(i)\n\telif i==s[-1]:\n\t\ts.pop()\n\telse:\n\t\ts.append(i)\nif len(s)==0:\n\tprint('Yes')\nelse:\n\tprint(\"No\")\n\t \t \t\t \t \t \t \t \t \t\t \t \t", "from re import S\r\n\r\n\r\nlst = input()\r\nstack = []\r\nfor s in lst:\r\n if len(stack) > 0:\r\n if stack[-1] == s:\r\n stack.pop()\r\n else:\r\n stack.append(s)\r\n else:\r\n stack.append(s)\r\n\r\nif len(stack):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "from collections import deque\r\n\r\ns = input()\r\n# test case 1\r\n# -++-\r\n# -\r\n# -+\r\n# -\r\n# test case 2\r\n# +\r\n# +-\r\n# test case 3\r\n# +\r\n#\r\n# test case 4\r\n# -\r\ndq = deque()\r\n# s: -++-\r\n# dq:\r\nfor i in range(len(s)):\r\n if len(dq) == 0:\r\n dq.append(s[i])\r\n elif s[i] == dq[-1]:\r\n dq.pop()\r\n else:\r\n dq.append(s[i])\r\nif len(dq) == 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "class solution:\r\n def answer(self, s):\r\n if len(s) <=1:\r\n return \"No\"\r\n \r\n S = []\r\n for i in range(len(s)):\r\n S.append(s[i])\r\n\r\n aux_stack = []\r\n c1 = S.pop()\r\n aux_stack.append(c1)\r\n\r\n while len(S)!=0:\r\n c2 = S.pop()\r\n if c2 == c1:\r\n aux_stack.pop()\r\n if len(aux_stack)==0:\r\n if len(S)==0:\r\n return \"Yes\"\r\n else:\r\n c1 = S.pop()\r\n aux_stack.append(c1)\r\n else:\r\n c1 = aux_stack[-1]\r\n else:\r\n c1 = c2\r\n aux_stack.append(c1)\r\n if len(aux_stack)!=0:\r\n return \"No\"\r\n else:\r\n return \"Yes\"\r\n\r\n \r\n \r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n S = input()\r\n ob = solution()\r\n print(ob.answer(S))", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[9]:\n\n\ns=input()\nl=len(s)\nAcount=Bcount=0\n\nfor i in range(l):\n if (i+1)&1:\n if s[i]=='-':\n Bcount+=1\n \n else:\n Acount+=1\n \n else:\n if s[i]=='-':\n Acount+=1\n \n else:\n Bcount+=1\n \nprint('Yes' if Acount==Bcount else 'No')\n\n\n# In[ ]:\n\n\n\n\n", "l,pre = [],''\r\nfor i in input():\r\n if i==pre: l.pop()\r\n else: l.append(i)\r\n if len(l)>0: pre=l[len(l)-1]\r\n else: pre=''\r\nprint('Yes' if not l else 'No')", "s = input()\r\n\r\nst = [s[0]]\r\n\r\nfor sign in s[1:]:\r\n if len(st) != 0 and sign == st[-1]:\r\n st.pop()\r\n else:\r\n st.append(sign)\r\n\r\nif len(st) == 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "wires = input()\r\narr = []\r\narr.append(wires[0])\r\nfor i in range (1,len(wires)):\r\n try:\r\n if wires[i] == arr[-1]:\r\n arr.pop()\r\n else:\r\n arr.append(wires[i])\r\n except:\r\n arr.append(wires[i])\r\n continue\r\n\r\nif (len(arr) == 0):\r\n print('Yes') \r\nelse:print('No')", "cables = input()\r\ncola = []\r\nfor signo in cables:\r\n if cola:\r\n if signo == cola[-1]:\r\n cola.pop(-1)\r\n else:\r\n cola.append(signo)\r\n else:\r\n cola.append(signo)\r\nif cola:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nd = []\r\nt, c = s[0], 0\r\nfor i in s:\r\n if i == t:\r\n c += 1\r\n else:\r\n if c % 2:\r\n d.append(c)\r\n else:\r\n if d:\r\n d.pop()\r\n c = 0\r\n else:\r\n c = 1\r\n if t == '+':\r\n t = '-'\r\n else:\r\n t = '+'\r\nif c % 2:\r\n d.append(c)\r\nprint(['Yes','No'][len(d)>0])\r\n", "str = input() \r\ns = []\r\nfor c in str :\r\n if len(s) > 0 and c == s[-1] : \r\n del s[-1]\r\n else : \r\n s.append(c)\r\nif len(s) > 0 : \r\n print('NO')\r\nelse: \r\n print('YES')", "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 collections import deque\r\nl = deque(input())\r\ns = []\r\nif len(l)%2: print('No')\r\nelse:\r\n while l:\r\n s.append(l.popleft())\r\n if len(s) >= 2:\r\n if s[-1] == s[-2]:\r\n s.pop()\r\n s.pop()\r\n if s: print('No')\r\n else: print('Yes')", "p, j = [0] * 100001, 0\nfor i in input():\n if i == p[j]: j -= 1\n else: j += 1; p[j] = i\nprint('YNEOS'[j > 0 :: 2])\n\t \t \t\t\t\t\t\t \t\t\t\t\t \t\t \t\t", "def can_be_untangled(sequence):\n stack = []\n\n for wire in sequence:\n if not stack or stack[-1] != wire:\n stack.append(wire)\n else:\n stack.pop()\n\n return \"Yes\" if not stack else \"No\"\n\nsequence = input()\nresult = can_be_untangled(sequence)\nprint(result)\n\n\t \t\t\t\t\t\t\t\t\t \t\t\t \t\t \t\t\t\t\t \t\t\t", "s=input()\r\n\r\nstack=[]\r\n\r\nfor ele in s:\r\n if len(stack)==0:\r\n stack.append(ele)\r\n elif stack[-1]==ele:\r\n stack.pop()\r\n else:\r\n stack.append(ele)\r\n \r\nif len(stack)==0:\r\n print('Yes')\r\nelse:\r\n print('No')", "stack = []\nfor x in input():\n if stack and stack[-1] == x:\n stack.pop()\n else:\n stack.append(x)\nprint('No' if stack else 'Yes')\n", "s = input()\r\nst = []\r\nfor i in s:\r\n if len(st)>0 and st[-1]==i:\r\n st.pop()\r\n else:\r\n st.append(i)\r\nif len(st)==0:\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", "s = input()\r\n\r\ntmp = 0\r\nresult = 0\r\nfor i in range(len(s)):\r\n if s[i] == '+': tmp = 1\r\n else: tmp = -1\r\n\r\n if i % 2 == 1 : tmp = -tmp\r\n\r\n result += tmp\r\n\r\nprint('YES') if result == 0 else print('NO')\r\n", "answer = []\nfor c in input():\n if len(answer) and answer[-1] == c: answer.pop()\n else: answer += [c]\nprint('No' if len(answer) else 'Yes')\n \t \t \t\t \t \t \t\t \t\t \t \t\t\t", "s = input().strip()\n\nstack = []\n\nfor char in s:\n if stack and stack[-1] == char:\n stack.pop()\n else:\n stack.append(char)\n\nif not stack:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n\t\t\t\t \t \t\t \t \t\t \t\t\t", "string = input()\nt = []\nfor char in string:\n if not t:\n t.append(char)\n continue\n if t[-1] == char:\n t.pop()\n else:\n t.append(char)\nif t:\n print(\"No\")\nelse:\n print(\"Yes\")", "s = input()\r\nn = len(s)\r\ni = 0\r\nstack = []\r\nwhile(i<n):\r\n if stack and stack[-1]==s[i]:\r\n stack.pop()\r\n else:\r\n stack.append(s[i])\r\n i+=1\r\nif stack == []:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "sp = list(input())\r\nspisok = []\r\nfor i in sp:\r\n if not spisok:\r\n spisok.append(i)\r\n elif i != spisok[-1]:\r\n spisok.append(i)\r\n else:\r\n spisok.pop()\r\nif spisok:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "def is_balanced_string(s):\r\n st = []\r\n for c in s:\r\n if not st:\r\n st.append(c)\r\n continue\r\n if st[-1] == c:\r\n st.pop()\r\n else:\r\n st.append(c)\r\n return \"YES\" if not st else \"NO\"\r\n\r\ns = input().strip()\r\nprint(is_balanced_string(s))", "\n# Online Python - IDE, Editor, Compiler, Interpreter\nwires=input()\nstack=[]\nfor wire in wires:\n if len(stack)==0:\n stack.append(wire)\n else:\n if stack[-1]==wire:\n stack.pop()\n \n else:\n stack.append(wire)\n\nif(len(stack)>0):\n print('NO')\nelse:\n print('YES')\n \n \t \t \t \t\t\t\t\t\t \t\t \t\t \t", "s = input()\r\nftopayrespect = []\r\n\r\nfor i in range(len(s)): \r\n if ftopayrespect and s[i] == ftopayrespect[len(ftopayrespect)-1]:\r\n ftopayrespect.pop()\r\n else:\r\n ftopayrespect.append(s[i])\r\n\r\nif len(ftopayrespect)>0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "#https://codeforces.com/contest/343/problem/B\r\n\r\n#SC = TC = o(n)\r\n\r\ns = input().strip()\r\n\r\nstack = []\r\n\r\nfor k in range(len(s)):\r\n\t#empty stack or not equal to stack top push\r\n\tif not stack or s[k]!=stack[-1]:\r\n\t\tstack.append(s[k])\r\n\t#if same pop\r\n\telif s[k]==stack[-1]:\r\n\t\tstack.pop()\r\n\r\n#if stack empty yes else no\r\nif not stack:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "from collections import deque\n\ns = input()\ndq = deque()\nfor i in range(len(s)):\n if (not len(dq)) or dq[-1]!=s[i]:\n dq.append(s[i])\n else:\n dq.pop()\nif len(dq):\n print('No')\nelse:\n print('Yes')\n\n \t\t\t \t\t\t\t \t \t\t \t \t \t \t\t\t\t\t", "s = input()\r\nc = 0\r\nt = 0 \r\nfor i in s :\r\n if t%2 == 0 :\r\n if i == '+' :\r\n c +=1 \r\n else:\r\n c -= 1 \r\n else :\r\n if i == '-' :\r\n c += 1 \r\n else :\r\n c -= 1 \r\n\r\n t += 1 \r\n\r\n\r\nif c == 0 :\r\n print('Yes')\r\nelse :\r\n print('No') ", "# a = \"\"\"30\r\n# 75\r\n# 40\r\n# 24\r\n# 21\r\n# 12\r\n# 1\r\n# 5\r\n# 24\r\n# 21\r\n# 6\r\n# 20\r\n# 60\r\n# 34\r\n# 22\r\n# 42\r\n# 19\r\n# 13\r\n# 13\r\n# 152\r\n# 4,60,2\r\n# 153\"\"\".split()\r\n\r\n# a = a[:11] + a[-4:-1]\r\n\r\n# for i in a:\r\n# input()\r\n# print(i)\r\n\r\n# a = \"\"\"30\r\n# 75\r\n# 40\r\n# 24\r\n# 21\r\n# 12\r\n# 1\r\n# 5\r\n# 24\r\n# 21\r\n# 6\r\n# 20\r\n# 60\r\n# 34\r\n# 22\r\n# 42\r\n# 19\r\n# 13\r\n# 13\r\n# 152\r\n# 4,60,2\r\n# 153\"\"\".split()\r\n\r\n# a = a[:11] + a[-4:-1]\r\n\r\n# for i in a:\r\n# input()\r\n# print(i)\r\n\r\nimport sys\r\n\r\ndef solve():\r\n s = sys.stdin.readline().strip()\r\n a = 0\r\n b = 0\r\n\r\n for i in range(len(s)):\r\n if i % 2 == 0:\r\n if s[i] == '-':\r\n a += 1\r\n else:\r\n b += 1\r\n else:\r\n if s[i] == '-':\r\n b += 1\r\n else:\r\n a += 1\r\n \r\n if a == b:\r\n print('Yes')\r\n else:\r\n print('No')\r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "s=list(input())\r\nstack=[]\r\nfor x in s:\r\n if stack!=[] and stack[-1]==x:\r\n del stack[-1]\r\n else:\r\n stack.append(x)\r\nif stack==[]: print(\"YES\")\r\nelse: print(\"NO\")", "import math\r\ns=list(input())\r\nn=len(s)\r\nstack = []\r\nfor i in range(n):\r\n if len(stack)>1:\r\n if stack[len(stack)-1]==stack[len(stack)-2]:\r\n stack.pop()\r\n stack.pop()\r\n stack.append(s[i]) \r\n else:\r\n stack.append(s[i])\r\nif len(stack)>1: \r\n if stack[len(stack)-1]==stack[len(stack)-2]:\r\n stack.pop()\r\n stack.pop()\r\nif len(stack)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import deque\na=input()\ndq=deque()\nfor i in a:\n if len(dq)==0:\n dq.append(i)\n elif dq[-1]==\"-\" and i==\"-\":\n dq.pop()\n elif dq[-1]==\"+\" and i==\"+\":\n dq.pop()\n else:\n dq.append(i)\nif len(dq)==0:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t\t\t\t \t \t \t\t\t \t\t \t \t\t \t\t\t\t\t\t", "import sys\r\ns = input()\r\nstk = []\r\nfor c in s:\r\n flag = True\r\n while stk and stk[-1] == c:\r\n flag = False\r\n stk.pop()\r\n if flag:\r\n stk.append(c)\r\n\r\nif len(stk)!=0:\r\n print(\"No\")\r\n sys.exit(0)\r\nprint(\"Yes\")", "import sys\r\n\r\ninpt = sys.stdin.readline().strip()\r\nstack = []\r\n\r\nfor c in inpt:\r\n stack.append(c)\r\n while len(stack) >= 2 and stack[-1] == stack[-2]:\r\n stack.pop(-1)\r\n stack.pop(-1)\r\n\r\nif len(stack) == 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "s = input()\r\n\r\nstack = [s[0]]\r\n\r\nfor i in range(1, len(s)):\r\n if len(stack) == 0:\r\n stack.append(s[i])\r\n else:\r\n if stack[-1] == s[i]:\r\n stack.pop()\r\n else:\r\n stack.append(s[i])\r\n\r\nif len(stack) == 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "import itertools\r\nfrom sys import maxsize, stdout, stdin,stderr\r\nmod = int(1e9+7)\r\nimport sys\r\ndef I(): return int(stdin.readline())\r\ndef lint(): return [int(x) for x in stdin.readline().split()]\r\ndef S(): return list(map(str,input().strip()))\r\ndef grid(r, c): return [lint() for i in range(r)]\r\nfrom collections import defaultdict, Counter, deque\r\nimport math\r\nimport heapq\r\nfrom heapq import heappop , heappush\r\nimport bisect\r\nfrom math import inf\r\nfrom itertools import groupby\r\nfrom itertools import permutations as comb\r\ndef gcd(a,b): \r\n while b:\r\n a %= b\r\n tmp = a\r\n a = b\r\n b = tmp\r\n \r\n return a\r\n \r\ndef lcm(a,b): \r\n return a // gcd(a, b) * b\r\n \r\ndef check_prime(n):\r\n for i in range(2, int(n ** (1 / 2)) + 1):\r\n if not n % i:\r\n return False\r\n return True\r\n\r\ndef nCr(n, r):\r\n \r\n return (fact(n) // (fact(r)\r\n * fact(n - r)))\r\n \r\n# Returns factorial of n\r\ndef fact(n):\r\n \r\n res = 1\r\n \r\n for i in range(2, n+1):\r\n res = res * i\r\n \r\n return res\r\ndef primefactors(n):\r\n num=0\r\n \r\n while n % 2 == 0:\r\n num+=1\r\n n = n / 2\r\n \r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n \r\n \r\n while n % i== 0:\r\n num+=1\r\n n = n // i\r\n \r\n \r\n if n > 2:\r\n num+=1\r\n return num\r\n'''\r\ndef iter_ds(src):\r\n store=[src]\r\n while len(store):\r\n tmp=store.pop()\r\n if not vis[tmp]:\r\n vis[tmp]=True\r\n for j in ar[tmp]:\r\n store.append(j)\r\n'''\r\ndef ask(a):\r\n print('? {}'.format(a),flush=True)\r\n n=I()\r\n \r\n return n\r\ndef linear_sieve(n):\r\n is_composite=[False]*n\r\n prime=[]\r\n for i in range(2,n):\r\n if not is_composite[i]:\r\n prime.append(i)\r\n for j in prime:\r\n is_composite[i*j]=True\r\n if i%prime==0:\r\n break\r\n return prime\r\n \r\ndef dfs(i,p,d):\r\n \r\n a,tmp=0,0\r\n for j in d[i]:\r\n if j!=p:\r\n a+=1\r\n tmp+=dfs(j,i)\r\n \r\n if a==0:\r\n return 0\r\n \r\n return tmp/a + 1 \r\ndef primeFactors(n):\r\n l=[]\r\n \r\n while n % 2 == 0:\r\n l.append(2)\r\n n = n // 2\r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n \r\n \r\n while n % i== 0:\r\n l.append(i)\r\n n = n // i\r\n\r\n if n > 2:\r\n l.append(n)\r\n return l\r\n\r\n\r\n \r\n\r\n# Sieve\r\nd=[]\r\nprimes=[]\r\ndef sieve(n):\r\n \r\n for i in range(n):\r\n d.append(i)\r\n\r\n for i in range(2,n):\r\n\r\n if d[i]==i:\r\n primes.append(i)\r\n j=0\r\n while j<len(primes) and primes[j]<=d[i] and primes[j]*i<n:\r\n \r\n d[i * primes[j]] = primes[j]\r\n j+=1\r\n\r\n \r\ndef primeFactors(n):\r\n factors=[]\r\n while n!=1:\r\n factors.append(d[n])\r\n n//=d[n]\r\n \r\n return factors\r\nb=input()\r\na=list(map(str,b.strip()))\r\nl=[]\r\n\r\nfor i in range(len(a)):\r\n l.append(a[i])\r\n if len(l)>1:\r\n if l[-1]==l[-2]:\r\n \r\n l.pop()\r\n l.pop()\r\n \r\nif len(l):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n \r\n\r\n\r\n\r\n\r\n \r\n", "from collections import Counter,defaultdict,deque\r\nimport heapq as hq\r\nfrom itertools import count, islice\r\n\r\n#alph = 'abcdefghijklmnopqrstuvwxyz'\r\n#from math import factorial as fact\r\nimport math\r\nimport sys\r\ninput=sys.stdin.readline\r\n#print=sys.stdout.write\r\n#tt = int(input())\r\n#total=0\r\n#n = int(input())\r\n#n,m,k = [int(x) for x in input().split()]\r\n#n = int(input())\r\n#l,r = [int(x) for x in input().split()]\r\ns = input().strip('\\n')\r\nstack = deque()\r\nfor i in range(len(s)):\r\n stack.append(s[i])\r\n while len(stack)>=2 and stack[-1] == stack[-2]:\r\n stack.pop()\r\n stack.pop()\r\nif len(stack)==0:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n\r\n \r\n", "string = input()\nlst=['0']\nfor i in string:\n if lst[-1] == i: #الاتنين شبه بعض امسح\n lst.pop()\n else:\n lst.append(i)\nif len(lst) == 1:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t\t \t \t \t \t\t \t \t \t\t \t \t", "# your code goes here\nst=[]\ns=input().strip()\nfor i in s:\n if len(st) and st[-1]==i:\n st.pop()\n else:\n st.append(i)\nif len(st):\n print('NO')\nelse:\n print('YES')", "def can_untangle(sequence):\r\n stack = []\r\n \r\n for char in sequence:\r\n if stack and stack[-1] == char:\r\n stack.pop()\r\n else:\r\n stack.append(char)\r\n \r\n if not stack:\r\n return \"Yes\"\r\n else:\r\n return \"No\"\r\n\r\n# Read input\r\nsequence = input().strip()\r\n\r\n# Check if the wires can be untangled\r\nresult = can_untangle(sequence)\r\nprint(result)\r\n", "s = input()\r\nl = []\r\n\r\nfor i in s:\r\n if(l!=[] and i==l[-1]):\r\n l.pop()\r\n else:\r\n l.append(i)\r\nif(l==[]):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input()\r\nstack = []\r\nfor i in s:\r\n if stack and i == stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n\r\nans = 'No' if stack else 'Yes'\r\nprint(ans)\r\n ", "def can_untangle_wires(wires):\n stack = [] # Initialize an empty stack\n\n # Iterate through the wires\n for wire in wires:\n # If the stack is not empty and the current wire can be matched with the top of the stack, pop the stack\n if stack and stack[-1] == wire:\n stack.pop()\n else:\n # Otherwise, push the current wire onto the stack\n stack.append(wire)\n\n # If the stack is empty after processing all wires, it means the wires can be untangled\n if not stack:\n return \"Yes\"\n else:\n return \"No\"\n\n# Read the input sequence of wires\nwires = input().strip()\n\n# Check if the wires can be untangled and print the result\nresult = can_untangle_wires(wires)\nprint(result)\n\n\t\t \t\t \t \t\t \t\t\t \t \t \t \t \t", "s = input()\r\nst = list()\r\nfor i in range(len(s)):\r\n\tif len(st) == 0:\r\n\t\tst.append(s[i])\r\n\telse:\r\n\t\tif st[len(st)-1] == s[i]:\r\n\t\t\tst.pop()\r\n\t\telse:\r\n\t\t\tst.append(s[i])\r\nif len(st) == 0:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "a=input()\r\nx=0\r\ny=0\r\n\r\nfor i in range(len(a)):\r\n if i%2!=0:\r\n if a[i]==\"-\":\r\n y+=1\r\n else:\r\n x+=1\r\n else:\r\n if a[i]==\"-\":\r\n x+=1\r\n else:\r\n y+=1\r\nif x==y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nst=[]\r\nfor i in range(len(s)):\r\n st.append(s[i])\r\n while len(st)>1 and st[-1]==st[-2]:\r\n st.pop(-1)\r\n st.pop(-1)\r\nif len(st):\r\n print('No')\r\nelse:\r\n print('Yes')", "arr = []\r\nstrs = input()\r\n\r\nfor i in strs:\r\n if len(arr) == 0:\r\n arr.append(i)\r\n continue\r\n if arr[-1] == i:\r\n arr.pop()\r\n else:\r\n arr.append(i)\r\n \r\nif len(arr) >0:\r\n print(\"NO\")\r\nelse:\r\n print('YES')", "wire = list(input())\r\nstack = []\r\ndef untangle(a,b):\r\n if a == b:\r\n return True\r\n else:\r\n return False\r\n\r\nfor x in wire:\r\n if stack == []:\r\n stack.append(x)\r\n else:\r\n if untangle(x,stack[-1]):\r\n stack.pop(-1)\r\n else:\r\n stack.append(x)\r\nif stack == []:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\") \r\n\r\n", "l = list(input())\nif len(l)%2!=0:\n print('No')\nelse:\n stack = []\n for i in l:\n if stack:\n if stack[-1]==i:\n stack.pop()\n else:\n stack.append(i)\n else:\n stack.append(i)\n if stack:\n print('No')\n else:\n print('Yes')\n", "s = input()\r\nq = []\r\nn = 0\r\nfor c in s:\r\n if not q:\r\n q.append(c)\r\n n += 1\r\n else:\r\n if c == q[n - 1]:\r\n q.pop()\r\n n -= 1\r\n else:\r\n q.append(c)\r\n n += 1\r\nif n:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "wire = input()\nstack = ['null']\nif len(wire) % 2 != 0:\n\tprint(\"No\")\n\texit()\nfor i in wire:\n\tif stack[-1] == i:\n\t\tstack.pop()\n\telse:\n\t\tstack.append(i)\nif len(stack) > 1:\n\tprint(\"No\")\nelse:\n\tprint(\"Yes\")", "pattern = input()\r\n\r\nstack = []\r\n\r\nfor i in range(len(pattern)):\r\n if stack == []:\r\n stack.append(pattern[i])\r\n elif stack[-1] == pattern[i]:\r\n stack.pop()\r\n else:\r\n stack.append(pattern[i])\r\n \r\nif len(stack) <= 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\") ", "import sys\r\nst = []\r\ns = input()\r\n\r\nfor i in s:\r\n if len(st) == 0:\r\n st.append(i)\r\n continue\r\n if st[-1] == i:\r\n st.pop()\r\n else:\r\n st.append(i)\r\n\r\nif len(st) == 0:\r\n print(\"YES\")\r\n sys.exit(0)\r\nprint(\"NO\")", "class current:\r\n def __init__(self):\r\n self.top = -1\r\n self.stk=[]\r\n \r\n def push(self,x):\r\n self.top+=1\r\n self.stk.append(x)\r\n \r\n def isempty(self):\r\n if self.top == -1:\r\n return True\r\n else:\r\n return False\r\n \r\n def peek(self):\r\n if not self.isempty():\r\n return self.stk[len(self.stk)- 1]\r\n else:\r\n return False\r\n \r\n def pop(self):\r\n if not self.isempty():\r\n self.top-=1\r\n return self.stk.pop()\r\n else:\r\n False\r\n \r\n def untangle(self,strng):\r\n for i in strng:\r\n if self.isempty():\r\n self.push(i)\r\n elif self.peek() == i:\r\n self.pop()\r\n else:\r\n self.push(i)\r\n if self.isempty():\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\n \r\nn = input()\r\nobj = current()\r\nobj.untangle(n)\r\n", "from collections import deque\r\n\r\ns = input()\r\n\r\ndq = deque()\r\nfor i in range(len(s)):\r\n if len(dq) == 0:\r\n dq.append(s[i])\r\n elif s[i] == dq[-1]:\r\n dq.pop()\r\n else:\r\n dq.append(s[i])\r\nif len(dq) == 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "inp = input().strip()\r\nstack = list()\r\ni=0\r\nwhile i<len(inp):\r\n if(len(stack)!=0 and stack[-1]==inp[i]):\r\n stack.pop()\r\n else:\r\n stack.append(inp[i])\r\n i = i+1\r\nif len(stack)==0:\r\n print('Yes')\r\nelse:\r\n print('No')", "string = input()\r\nnew = []\r\nfor i in range(len(string)):\r\n if new==[]:\r\n new.append(string[i])\r\n else:\r\n if new==[]:\r\n new.append(string[i])\r\n else:\r\n if new[-1] == string[i]:\r\n new.pop()\r\n else:\r\n new.append(string[i])\r\nif new==[]:\r\n print('Yes')\r\nelse:\r\n print('No')", "stack = []\nsoc = input()\nflag = True\n\nif len(soc) % 2 == 0:\n for sign in soc:\n if stack != [] and stack[-1] == sign:\n stack.pop()\n else:\n stack.append(sign)\nelse:\n flag = False\n\nif flag and stack == []:\n print('Yes')\nelse:\n print('No')\n", "s = input().strip()\nst = ['!']\nfor si in s:\n if st[-1]==si:\n st.pop()\n else:\n st.append(si)\nprint('Yes' if len(st)==1 else 'No')\n \t\t \t \t\t\t\t\t \t \t \t\t", "from collections import deque\r\ns=input()\r\nstack=deque()\r\n\r\nif (len(s)==1):\r\n print('No')\r\nelif (len(s)==2):\r\n if(s[0]!=s[1]):\r\n print('No')\r\n else :\r\n print('Yes')\r\nelse :\r\n for i in range (len(s)):\r\n if ( len(stack)==0) :\r\n stack.append(s[i])\r\n elif ( stack[-1]==s[i]) :\r\n stack.pop()\r\n else :\r\n stack.append(s[i])\r\n if ( len(stack) ==0) :\r\n print('Yes')\r\n else :\r\n print('No')\r\n", "import sys\r\nfrom collections import deque\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 seq = f.readline().strip()\r\n\r\n return [seq]\r\n\r\n\r\ndef sol(seq):\r\n li = deque()\r\n for node in seq:\r\n if len(li) == 0:\r\n li.append(node)\r\n elif node == li[-1]:\r\n li.pop()\r\n else:\r\n li.append(node)\r\n if len(li) == 0:\r\n return [\"Yes\"]\r\n else:\r\n return [\"No\"]\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\n\r\ntry:\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nexcept:\r\n pass\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ns = input().strip()\r\n\r\nst = []\r\nfor el in s:\r\n if st and st[-1] == el:\r\n st.pop()\r\n continue\r\n st.append(el)\r\n\r\nprint(\"Yes\" if not st else \"No\")", "l = input()\np = []\nfor i in l:\n if p and i == p[-1]:\n p.pop()\n else:\n p.append(i)\nif not p:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t \t\t\t \t \t\t \t \t\t\t \t \t \t \t", "check=[\"!\"]\r\ninp=input()\r\nfor i in inp:\r\n if(check[-1]==i):\r\n check.pop()\r\n else:\r\n check.append(i)\r\nif(len(check)==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ans = []\nfor c in input():\n if len(ans) and ans[-1] == c:\n ans.pop()\n else:\n ans += [c]\nprint('No' if len(ans) else 'Yes')\n", "cables = input()\nstack = []\n\nfor i in cables:\n if stack and stack[-1] == i:\n stack.pop()\n else:\n stack.append(i)\n\nif stack:\n print(\"NO\")\nelse:\n print(\"YES\")", "s=input()\nstk=[]\nfor i in s:\n if len(stk)==0:\n stk.append(i)\n else:\n if i==stk[-1]:\n stk.pop()\n else:\n stk.append(i)\nif len(stk)==0:\n print('Yes')\nelse:\n print('No')\n \t\t\t\t \t\t\t\t\t\t \t \t\t\t\t\t\t \t\t", "s=input()\r\nst=[]\r\nfor i in range(0,len(s)):\r\n if len(st)==0 or s[i]!=st[-1]:\r\n st.append(s[i])\r\n else:\r\n st.pop()\r\nif st:\r\n print(\"no\")\r\nelse:\r\n print(\"yes\")\r\n ", "s=input()\nstack=[]\nfor i in s:\n if len(stack)==0:\n stack.append(i)\n else:\n if i==stack[-1]:\n stack.pop()\n else:\n stack.append(i)\nif len(stack)==0:\n print('Yes')\nelse:\n print('No')\n\t \t \t \t \t\t\t \t\t \t\t\t \t \t\t", "import sys\r\nimport math\r\nimport bisect\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict as dd\r\nfrom bisect import bisect_left as bl,bisect_right as br\r\n\r\n# faster input\r\nLINES = sys.stdin.read().splitlines()[::-1]\r\ndef input(): return LINES.pop()\r\n\r\n# single integer\r\ninp = lambda: int(input())\r\n\r\n# string input\r\nstrng = lambda: input().strip()\r\n\r\n# words split on white space\r\nstrwords = lambda: strng().split()\r\n\r\n\r\n# string list\r\nstrl = lambda: list(input().strip())\r\n\r\n# multiple integers, mapped\r\nmul = lambda: map(int,input().strip().split())\r\n\r\n# multiple floats, mapped\r\nmulf = lambda: map(float,input().strip().split())\r\n\r\n# list of multiple integers\r\nseq = lambda: list(map(int,input().strip().split()))\r\n\r\nceil = lambda x: int(x) if(x==int(x)) else int(x)+1\r\nceildiv = lambda x,d: x//d if(x%d==0) else x//d+1\r\n\r\nMOD = 1000000007\r\n\r\nmod_add = lambda x, y: ((x % MOD) + (y % MOD)) % MOD\r\nmod_multiply = lambda x, y: ((x % MOD) * (y % MOD)) % MOD\r\nmod_division = lambda x, y: mod_multiply(x, math.pow(y, MOD - 2, MOD))\r\n\r\nin_bounds = lambda x, y, grid: x >= 0 and x < len(grid) and y >= 0 and y < len(grid[0])\r\n\r\ndef solve():\r\n sequence = strl()\r\n \r\n stack = []\r\n \r\n for sign in sequence:\r\n if not stack:\r\n stack.append(sign)\r\n else:\r\n if sign == stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(sign)\r\n \r\n return not stack\r\n\r\nprint('Yes' if solve() else 'No')", "stack = []\nsoc = input()\nflag = True\n\nif len(soc) % 2 == 0:\n for sign in soc:\n if len(stack) > 0 and stack[len(stack) - 1] == sign:\n stack.pop()\n else:\n stack.append(sign)\n if len(stack) > (len(soc) / 2):\n break\nelse:\n flag = False\n\nif flag and len(stack) == 0:\n print('Yes')\nelse:\n print('No')\n", "s = input()\n\nif len(s)%2:print('No');exit(0)\n\nif s[::2].count('+')-s[1::2].count('+')==0:print('Yes');exit(0)\n\nprint('No')\n\n\n\n\n\n# Made By Mostafa_Khaled", "# LUOGU_RID: 111140183\nstr_input = list(input())\r\nstack = []\r\nfor ch in str_input:\r\n if not stack:\r\n stack.append(ch)\r\n else:\r\n if stack[-1] == ch: stack.pop()\r\n else: stack.append(ch)\r\nif not stack: print('Yes')\r\nelse: print('No')", "s = input()\r\nk = []\r\nlast = ''\r\nfor i in s:\r\n if i == last: k.pop()\r\n else: k.append(i)\r\n\r\n if len(k): last = k[-1]\r\n else: last = ''\r\nprint(\"No\" if len(k) else \"Yes\")", "s=str(input())\r\na=[]\r\nif len(s)%2!=0:\r\n print(\"No\")\r\nelse:\r\n for i in range(len(s)):\r\n if len(a)==0 or s[i]!=str(a[-1]):\r\n a.append(s[i])\r\n else:\r\n a.pop()\r\n if len(a)==0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\n", "from collections import deque\r\ndef Test(Q,inp):\r\n minus='-'\r\n plus='+'\r\n k=0\r\n if len(inp)%2!=0:\r\n return(\"NO\")\r\n else:\r\n for i in range(int(len(inp)/2)):\r\n f=Q.pop()+Q.pop()\r\n if f==plus+plus or f==minus+minus:\r\n continue\r\n elif f==plus+minus:\r\n k-=1\r\n continue\r\n elif f==minus+plus:\r\n k+=1\r\n if k==0:\r\n return('YES')\r\n else:\r\n return('NO')\r\ninp=input()\r\nQ=deque()\r\nfor i in range(len(inp)):\r\n Q.append(inp[i])\r\nprint(Test(Q,inp))\r\n", "import sys\r\nfrom math import *\r\nfrom random 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\ns = input()\r\nt = []\r\nfor i in s:\r\n\tif len(t) == 0:\r\n\t\tt.append(i)\r\n\telif t[-1] != i:\r\n\t\tt.append(i)\r\n\telse:\r\n\t\tt.pop()\r\nif len(t):\r\n\tprint('No')\r\nelse:\r\n\tprint('Yes')\r\n", "current = input() \n\nst = []\n\nfor i in current:\n\tif not st:\n\t\tst.append(i)\n\telif st[-1] == i:\n\t\tst.pop()\n\telse:\n\t\tst.append(i)\n\nif not st:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")", "s = input()\np = 0\nn = 0\n\nfor i in range(len(s)):\n if i % 2 == 0:\n if s[i] == \"-\":\n p += 1\n else:\n n += 1\n else:\n if s[i] == \"-\":\n n += 1\n else:\n p += 1\n\nif p == n:\n print(\"Yes\")\nelse:\n print(\"No\")", "\ns = input()\nss = []\n\nfor i in s:\n if len(ss) > 0 and ss[-1] == i:\n ss.pop()\n else:\n ss.append(i)\nif len(ss) == 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t\t \t\t \t \t\t \t\t\t\t \t \t \t\t\t \t", "signals = input()\r\ndef wires(strg):\r\n transformed_signals = \"\"\r\n for i in range(len(signals)):\r\n if i % 2 == 0:\r\n if signals[i] == \"+\":\r\n transformed_signals += \"A\"\r\n else:\r\n transformed_signals += \"B\"\r\n else:\r\n if signals[i] == \"+\":\r\n transformed_signals += \"B\"\r\n else:\r\n transformed_signals += \"A\"\r\n\r\n count_a = transformed_signals.count(\"A\")\r\n count_b = transformed_signals.count(\"B\")\r\n\r\n if count_a == count_b:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\nwires(signals)", "a = input()\r\nstack = []\r\nfor i in a:\r\n if not stack:\r\n stack.append(i)\r\n elif stack and stack[-1]==i:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\nif stack:\r\n print('No')\r\nelse:\r\n print('Yes')", "string=input()\r\nstack=[]\r\nfor i in string:\r\n flag=True\r\n while stack:\r\n if stack[-1]==i:\r\n stack.pop()\r\n flag=False\r\n else:\r\n break\r\n if flag:\r\n stack+=(i,)\r\nif len(stack)==0:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "def f(n):\n stack = []\n for char in n:\n if not stack or stack[-1] != char:\n stack.append(char)\n else:\n stack.pop()\n if stack:\n return \"No\"\n else:\n return \"Yes\"\nn= input()\nresult =f(n)\nprint(result)\n\n\t \t\t\t\t \t \t \t \t\t", "wire_sequence = input()\nstack = []\nfor x in wire_sequence:\n if stack and stack[-1] == x:\n stack.pop()\n else:\n stack.append(x)\nif stack:\n print('No')\nelse:\n print('Yes')\n", "#code\r\ns = input()\r\nstk = []\r\n\r\nfor char in s:\r\n if not stk: # stack not empty\r\n stk.append(char)\r\n continue\r\n elif stk[-1] == char: # to element == char\r\n stk.pop()\r\n else:\r\n stk.append(char)\r\n\r\nif stk:\r\n # stack not empty\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "# https://blog.csdn.net/baidu_19306071/article/details/48026961\r\n\r\ns = input()\r\n\r\nstk = []\r\nfor c in s:\r\n if not stk or stk[-1] != c: stk.append(c)\r\n else: stk.pop()\r\n\r\nprint('No' if stk else 'Yes')", "s=input().strip()\r\nx=[]\r\nfor i in range(len(s)):\r\n if not x or x[-1]!=s[i]:\r\n x.append(s[i])\r\n else:\r\n x.pop()\r\nif len(x)==0:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "from collections import deque\ns = input()\ndq = deque()\nfor ch in s:\n if len(dq) == 0:\n dq.append(ch)\n else:\n if dq[-1] == '+' and ch == '+':\n dq.pop()\n elif dq[-1] == '-' and ch == '-':\n dq.pop()\n else:\n dq.append(ch)\nif len(dq) == 0:\n print(\"yes\")\nelse:\n print(\"No\")\n\t\t \t\t \t \t\t \t \t\t \t\t\t", "class LinkedList:\r\n class Node:\r\n def __init__(self, _value, _next=None):\r\n self.value = _value\r\n self.next = _next\r\n\r\n def __init__(self, *args):\r\n self.head = None\r\n self.tail = None\r\n if args:\r\n for value in args:\r\n self.push_back(value)\r\n\r\n def push_front(self, value):\r\n newElement = LinkedList.Node(value)\r\n newElement.next = self.head\r\n self.head = newElement\r\n if self.tail is None:\r\n self.tail = newElement\r\n\r\n def push_back(self, value):\r\n if self.head is None:\r\n self.push_front(value)\r\n return\r\n newElement = LinkedList.Node(value)\r\n self.tail.next = newElement\r\n self.tail = newElement\r\n\r\n def isEmpty(self):\r\n return self.head is None\r\n\r\n def get_len(self):\r\n if self.isEmpty():\r\n return 0\r\n else:\r\n pointer = self.head\r\n length = 1\r\n while pointer.next is not None:\r\n length += 1\r\n pointer = pointer.next\r\n return length\r\n\r\n def pop_front(self):\r\n result = self.head.value\r\n self.head = self.head.next # Garbage collector's power\r\n return result\r\n\r\n def pop_back(self):\r\n result = self.tail.value\r\n self.delete(self.get_len() - 1)\r\n return result\r\n\r\n def get(self, num):\r\n return self.__get(num).value\r\n\r\n def __get(self, num):\r\n length = self.get_len()\r\n if num > length:\r\n print(\"List have only %d elements\" % length)\r\n return None\r\n elif num < 0:\r\n print(\"There can't be element %d\" % num)\r\n return None\r\n\r\n elif not self.isEmpty():\r\n pointer = self.head\r\n for i in range(num):\r\n pointer = pointer.next\r\n return pointer\r\n\r\n def insert(self, num, position):\r\n length = self.get_len()\r\n if position > length:\r\n print(\"List have only %d elements\" % length)\r\n return\r\n elif position < 0:\r\n print(\"There can't be element %d\" % num)\r\n return\r\n elif length == 0:\r\n self.push_back(num)\r\n return\r\n previous = self.__get(position - 1)\r\n if previous != self.tail:\r\n target = self.Node(num, previous.next)\r\n previous.next = target\r\n else:\r\n target = self.Node(num, None)\r\n if self.tail is not None:\r\n self.tail.next = target\r\n else:\r\n self.push_front(target)\r\n\r\n def delete(self, num):\r\n length = self.get_len()\r\n if num > length:\r\n print(\"List have only %d elements\" % length)\r\n return\r\n elif num < 0:\r\n print(\"There can't be element %d\" % num)\r\n return\r\n elif num == 0 and self.get_len() == 1:\r\n self.head, self.tail = None, None # Garbage collector's power\r\n elif num != self.get_len() - 1:\r\n self.__get(num - 1).next = self.__get(num + 1) # Garbage collector's power\r\n else:\r\n self.__get(num - 1).next = None # Garbage collector's power\r\n\r\n def print(self):\r\n pointer = self.head\r\n while pointer is not None:\r\n print(pointer.value)\r\n pointer = pointer.next\r\n\r\n def get_list(self):\r\n pointer = self.head\r\n result = []\r\n while pointer is not None:\r\n result.append(pointer.value)\r\n pointer = pointer.next\r\n return result\r\n\r\n def get_back(self):\r\n return self.tail.value if not self.isEmpty() else None\r\n\r\n def get_front(self):\r\n return self.head.value if not self.isEmpty() else None\r\n \r\n \r\nll = LinkedList()\r\nfor i in input():\r\n if ll.get_front() == i and not ll.isEmpty():\r\n ll.pop_front()\r\n else:\r\n ll.push_front(i)\r\nprint(\"Yes\") if ll.isEmpty() else print(\"No\")", "# Alternating Current\r\n\r\ncurrent = input()\r\nstack = []\r\n\r\nfor i in range(0, len(current)):\r\n if not stack:\r\n stack.append(current[i])\r\n elif current[i] == stack[-1]:\r\n stack.pop()\r\n elif current[i] != stack[-1]:\r\n stack.append(current[i])\r\n\r\nif not stack:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "from sys import stdin\n\nlines, line_index = stdin.readlines(), -1\n\n\ndef get_line():\n global lines, line_index\n\n line_index += 1\n return lines[line_index]\n\ndef main():\n string = get_line().strip()\n\n stack = []\n\n for c in string:\n if not stack:\n stack.append(c)\n elif stack[-1] == c:\n stack.pop()\n else:\n stack.append(c)\n\n if not stack:\n print('Yes')\n else:\n print('No')\n\nmain()", "a = list(input())\r\nfor i in range(len(a)):\r\n if i % 2 == 0:\r\n if a[i] == '+':\r\n a[i] = 'B'\r\n elif a[i] == '-':\r\n a[i] = 'A'\r\n elif i % 2 != 0:\r\n if a[i] == '+':\r\n a[i] = 'A'\r\n elif a[i] == '-':\r\n a[i] = 'B'\r\nif a.count('A') == a.count('B'):\r\n print('YES')\r\nelse:\r\n print('NO')", "def current(st):\r\n stack=[]\r\n for i in st:\r\n if i==\"-\" and stack and stack[-1]==\"-\":\r\n stack.pop()\r\n elif i==\"-\":\r\n stack.append(\"-\")\r\n elif i==\"+\" and stack and stack[-1]==\"+\":\r\n stack.pop()\r\n elif i==\"+\":\r\n stack.append(\"+\")\r\n if stack:\r\n return \"No\"\r\n return \"Yes\"\r\n\r\nst = input()\r\nres = current(st)\r\nprint(res)\r\n", "# -*- coding: utf-8 -*-\n\n# Baqir Khan\n# Software Engineer (Backend)\n\nfrom sys import stdin\n\ninp = stdin.readline\n\ns = inp()[:-1]\n\nstack = []\n\nfor i in s:\n if len(stack) and stack[-1] == i:\n stack.pop()\n else:\n stack.append(i)\n\nprint(\"No\" if len(stack) else \"Yes\")", "string = list(input())\r\nstack = list()\r\nmatch = [('+','+'),('-','-')]\r\nfor i in string:\r\n if stack and (stack[-1], i) in match:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n\r\nif stack == []:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n\r\n\r\n\r\n", "s=input()\r\nif len(s)%2!=0:\r\n print(\"No\")\r\nelse:\r\n st=[s[0]]\r\n for i in range(1,len(s)):\r\n if len(st)==0 or s[i]!=st[-1]:\r\n st.append(s[i])\r\n else:\r\n st.pop()\r\n if len(st)==0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n \r\n", "# Maximiliano Andaur 2020441618 -> spacedgypy\n# Solucion tomada de RMahajan en codeforces\ns = input() # Se define la entrada de texto\n\nstack = [] # Definimos una lista vacia\nfor i in s: # Se crea un bucle que vaya leyendo los terminos de la cadena de texto\n if stack and i == stack[-1]: # Si el vector esta vacio no entrara al condicional y ademas\n # debe cumplir que el ultimo elemento del vector debe ser igual al que se agregara\n stack.pop() # si esto se cumple, significa que no hay nudo en ese punto, y por lo tanto lo quitamos\n else: # En el caso de que esto no suceda, se agregara al vector (como un nudo temporal que puede ser disuelto más adelante)\n stack.append(i)\n \nans = 'No' if stack else 'Yes' # aquí en el caso que que stack(nuestro vector desenredado) este vacio, significa que no hay nudos\nprint(ans) # e imprimira \"Yes\", si no es el caso, y el vector si contenga nudos, se imprimira \"No\" resolviendo así el problema\n\t\t\t \t \t \t \t\t \t\t\t\t\t \t \t\t \t", "\ns = input()\nn = len(s)\n\nst = []\n\nfor i in range(n):\n if not st:\n st.append(s[i])\n continue\n if st[-1] == s[i]:\n st.pop()\n else:\n st.append(s[i])\n\nif not st:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n \t\t \t \t \t \t\t\t\t \t \t\t\t\t\t\t", "s=input()\narr=[]\nfor i in range(0, len(s)):\n if arr and s[i] == arr[-1]:\n del arr[-1]\n else :\n arr.append(s[i])\nif arr:\n print(\"No\")\nelse :\n print(\"Yes\")\n\t\t \t \t\t\t \t\t \t \t\t \t\t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Dec 29 12:42:14 2022\r\n\r\n@author: rohan\r\n\"\"\"\r\n\r\nc = input()\r\ns = []\r\n\r\nfor i in range(len(c)):\r\n if s and s[-1] == c[i]:\r\n s.pop()\r\n else:\r\n s.append(c[i])\r\n \r\nif not s:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "s=input()\r\nst=[]\r\nfor i in range(len(s)):\r\n if st and st[-1]==s[i]:\r\n st.pop()\r\n else:\r\n st.append(s[i])\r\nif st:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "s=input()\r\nls=len(s)\r\nk=[None]*ls\r\nfor i in range(ls):\r\n if i%2==0:\r\n k[i]=(1 if s[i]==\"-\" else 0)\r\n else:\r\n k[i]=(0 if s[i]==\"-\" else 1)\r\nstack=[]\r\ni=0\r\nwhile i<ls:\r\n if stack:\r\n if k[i]!=stack[-1]:\r\n stack.pop()\r\n else:\r\n stack.append(k[i])\r\n else:\r\n stack.append(k[i])\r\n i+=1\r\nprint(\"No\" if stack else \"Yes\")", "from queue import Empty\r\n\r\n\r\npo=input()\r\nstack=[po[0]]\r\n\r\n\r\nfor i in range(1,len(po)):\r\n if len(stack)>0:\r\n if stack[-1]==po[i]:\r\n stack.pop()\r\n else:\r\n stack.append(po[i]) \r\n else:\r\n stack.append(po[i]) \r\n\r\nif len(stack)==0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\") \r\n", "RI = lambda : [int(x) for x in input().split()]\r\nrw = lambda : [input().strip()]\r\n\r\n\r\ns=list(input().strip())\r\n\r\nstack=[]\r\nindex_stack=-1\r\n\r\nfor i in s:\r\n if(i=='+'):\r\n if(index_stack!=-1):\r\n if(stack[index_stack]=='+'):\r\n stack.pop()\r\n index_stack-=1\r\n else:\r\n stack.append(i)\r\n index_stack+=1\r\n else:\r\n stack.append(i)\r\n index_stack+=1\r\n \r\n if(i=='-'):\r\n if(index_stack!=-1):\r\n if(stack[index_stack]=='-'):\r\n stack.pop()\r\n index_stack-=1\r\n else:\r\n stack.append(i)\r\n index_stack+=1\r\n else:\r\n stack.append(i)\r\n index_stack+=1\r\n\r\nif(index_stack==-1):\r\n ans='Yes'\r\nelse:\r\n ans='No'\r\nprint(ans)\r\n \r\n \r\n \r\n", "s=input()\r\nn=len(s)\r\nstack=[]\r\nfor i in s:\r\n if len(stack)==0:\r\n stack.append(i)\r\n else:\r\n if stack[-1]==i:\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\nif len(stack)==0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = input()\r\n\r\nstack = []\r\n\r\nfor i in n:\r\n if len(stack)!=0:\r\n if stack[-1] == i:\r\n stack.pop(-1)\r\n\r\n else:\r\n stack.append(i)\r\n\r\n else:\r\n stack.append(i)\r\n\r\n\r\nif len(stack)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=[]\r\nfor i in input():\r\n if s and s[-1]==i:\r\n s.pop()\r\n else:\r\n s.append(i)\r\nprint('Yes') if not s else print('No') \r\n", "class Stack:\r\n def __init__(self):\r\n self.items = []\r\n\r\n def isEmpty(self):\r\n return self.items == []\r\n\r\n def push(self, item):\r\n self.items.append(item)\r\n\r\n def pop(self):\r\n self.items.pop()\r\n\r\n def peek(self):\r\n return self.items[len(self.items)-1]\r\n\r\n def size(self):\r\n return len(self.items)\r\n def printStack(self):\r\n return self.items\r\n\r\ns = input()\r\nstack = Stack()\r\n# stack.push(s[0])\r\ni=0\r\nwhile i<len(s):\r\n if stack.isEmpty()==True:\r\n stack.push(s[i])\r\n i+=1\r\n continue\r\n while i<len(s) and stack.isEmpty()==False and stack.peek()==s[i]:\r\n stack.pop()\r\n i+=1\r\n if i<len(s):\r\n stack.push(s[i])\r\n i+=1\r\n\r\n\r\nans = \"\".join(stack.printStack())\r\nif len(ans)==0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input()\r\nl = []\r\n\r\nfor i in s:\r\n if l and i == l[-1]:\r\n del l[-1]\r\n else:\r\n l.append(i)\r\n\r\nif l:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n" ]

{"inputs": ["-++-", "+-", "++", "-", "+-+-", "-+-", "-++-+--+", "+", "-+", "--", "+++", "--+", "++--++", "+-++-+", "+-+--+", "--++-+", "-+-+--", "+-+++-", "-+-+-+", "-++-+--++--+-++-", "+-----+-++---+------+++-++++", "-+-++--+++-++++---+--+----+--+-+-+++-+++-+---++-++++-+--+--+--+-+-++-+-+-++++++---++--+++++-+--++--+-+--++-----+--+-++---+++---++----+++-++++--++-++-", "-+-----++++--++-+-++", "+--+--+------+++++++-+-+++--++---+--+-+---+--+++-+++-------+++++-+-++++--+-+-+++++++----+----+++----+-+++-+++-----+++-+-++-+-+++++-+--++----+--+-++-----+-+-++++---+++---+-+-+-++++--+--+++---+++++-+---+-----+++-++--+++---++-++-+-+++-+-+-+---+++--+--++++-+-+--++-------+--+---++-----+++--+-+++--++-+-+++-++--+++-++++++++++-++-++++++-+++--+--++-+++--+++-++++----+++---+-+----++++-+-+", "-+-+-++-+-+-", "-+-++-+-", "-+-++-+-+-", "++-+-+-+-+--+", "+++---", "+-+-+-+-+--+-+-+-+-++--++--+", "+-+-++", "-++--+--+++-+-+-+-+-", "+---+-+-", "+-+--+-+", "+++---+++---", "-+++++", "-+-+-+-+-+-+-++-+-+-+-+-+-+-", "-+++--", "+---+", "-++", "-+--+-", "+---++--++", "+++-", "--+++", "++-+"], "outputs": ["Yes", "No", "Yes", "No", "No", "No", "Yes", "No", "No", "Yes", "No", "No", "Yes", "Yes", "No", "No", "No", "No", "No", "Yes", "No", "No", "Yes", "Yes", "Yes", "Yes", "No", "No", "No", "Yes", "No", "No", "No", "Yes", "No", "No", "Yes", "No", "No", "No", "Yes", "No", "No", "No", "No"]}

UNKNOWN

PYTHON3

CODEFORCES

189

8fa59503460967189c33fd84aaf7e67c

Help Farmer

Once upon a time in the Kingdom of Far Far Away lived Sam the Farmer. Sam had a cow named Dawn and he was deeply attached to her. Sam would spend the whole summer stocking hay to feed Dawn in winter. Sam scythed hay and put it into haystack. As Sam was a bright farmer, he tried to make the process of storing hay simpler and more convenient to use. He collected the hay into cubical hay blocks of the same size. Then he stored the blocks in his barn. After a summer spent in hard toil Sam stored *A*·*B*·*C* hay blocks and stored them in a barn as a rectangular parallelepiped *A* layers high. Each layer had *B* rows and each row had *C* blocks. At the end of the autumn Sam came into the barn to admire one more time the hay he'd been stacking during this hard summer. Unfortunately, Sam was horrified to see that the hay blocks had been carelessly scattered around the barn. The place was a complete mess. As it turned out, thieves had sneaked into the barn. They completely dissembled and took away a layer of blocks from the parallelepiped's front, back, top and sides. As a result, the barn only had a parallelepiped containing (*A*<=-<=1)<=×<=(*B*<=-<=2)<=×<=(*C*<=-<=2) hay blocks. To hide the evidence of the crime, the thieves had dissembled the parallelepiped into single 1<=×<=1<=×<=1 blocks and scattered them around the barn. After the theft Sam counted *n* hay blocks in the barn but he forgot numbers *A*, *B* и *C*. Given number *n*, find the minimally possible and maximally possible number of stolen hay blocks. The only line contains integer *n* from the problem's statement (1<=≤<=*n*<=≤<=109). Print space-separated minimum and maximum number of hay blocks that could have been stolen by the thieves. Note that the answer to the problem can be large enough, so you must use the 64-bit integer type for calculations. Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator. Sample Input 4 7 12 Sample Output 28 41 47 65 48 105

[ "n = int(input())\r\nmn = mx = (n+1)*9\r\ni = 1\r\nwhile i*i <= n :\r\n if n%i == 0 :\r\n j = 1\r\n while j*j <= (n//i) :\r\n if (n//i)%j == 0 :\r\n mn = min(mn,(i+1)*(j+2)*(n//(i*j)+2))\r\n mn = min(mn,(i+2)*(j+1)*(n//(i*j)+2))\r\n mn = min(mn,(i+2)*(j+2)*(n//(i*j)+1))\r\n j += 1\r\n i += 1\r\nprint(mn-n,mx-n)", "import math\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ninf = pow(10, 18) + 1\r\nmi, ma = inf, -inf\r\nfor a in range(1, int(math.sqrt(n)) + 3):\r\n if n % a:\r\n continue\r\n m = n // a\r\n for b in range(1, int(math.sqrt(m)) + 3):\r\n if m % b:\r\n continue\r\n c = m // b\r\n u = (a + 1) * (b + 2) * (c + 2) - n\r\n v = (a + 2) * (b + 1) * (c + 2) - n\r\n w = (a + 2) * (b + 2) * (c + 1) - n\r\n mi = min(mi, u, v, w)\r\n ma = max(ma, u, v, w)\r\nprint(mi, ma)", "n = int(input())\r\nu = v = 9 + 8 * n\r\nfor a in range(1, int(n ** (1 / 3)) + 1):\r\n if n % a: continue\r\n m = n // a\r\n for b in range(a, int(m ** 0.5) + 1):\r\n if m % b: continue\r\n p = (a + 1) * (b + 2) * (m // b + 2) - n\r\n if u > p: u = p\r\nprint(u, v)", "from math import sqrt\n\np, n = [], int(input())\n\ndef f(x, y): return (x + 2) * (y + 2) + (2 * (x + y + 2) * n) // (x * y)\n\nfor x in range(2, int(sqrt(n)) + 1):\n\n if n % x == 0: p.append(x)\n\np += [n // x for x in reversed(p)]\n\np.append(n)\n\nu = v = f(1, 1)\n\nfor m in p:\n\n for x in range(1, int(sqrt(m)) + 1): \n\n if m % x == 0: u = min(u, f(x, m // x))\n\nprint(u, v)", "n = int(input())\r\ndef fact(n):\r\n l = set()\r\n for i in range(1,int(pow(n,0.5))+1):\r\n if n % i == 0:\r\n l.add(i)\r\n l.add(n//i)\r\n return l\r\n\r\nfs = fact(n)\r\nmn = float(\"inf\")\r\nmx = -float(\"inf\")\r\nfor i in fs:\r\n for j in fs:\r\n if i * j > n: continue\r\n if n % (i*j) != 0: continue\r\n k = n//(i*j)\r\n a,b,c = i+1, j+2, k+2\r\n mn = min(a*b*c - n, mn)\r\n mx = max(a*b*c - n, mx)\r\nprint(mn, mx)", "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\r\n mn, mx = min(8 * n + 9, 5 * n + 12), max(8 * n + 9, 5 * n + 12)\r\n\r\n for a_1 in range(1, int(n ** (1 / 3)) + 2):\r\n if n % a_1 == 0:\r\n for b_2 in range(1, int((n / a_1) ** (1 / 2)) + 1):\r\n if n % (a_1 * b_2) == 0:\r\n c_2 = n // (a_1 * b_2)\r\n mn = min(mn, (a_1 + 1) * (b_2 + 2) * (c_2 + 2) - n)\r\n\r\n print(mn, mx)\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", "from math import sqrt\r\nn = int(input())\r\n\r\ndef f(x, y): \r\n return (x+2) * (y+2) + (2*n * (x+y+2)) // (x * y)\r\n\r\nfactors = []\r\nfor i in range(2, int(sqrt(n))+1):\r\n if n % i == 0:\r\n factors.append(i)\r\nfactors += [n // i for i in reversed(factors)] + [n]\r\nres = f(1, 1)\r\nfor i in factors:\r\n for j in range(1, int(sqrt(i))+1):\r\n if i % j == 0:\r\n res = min(res, f(j, i // j))\r\nprint(res, f(1, 1))\r\n", "n=int(input())\r\nk=n\r\na=set()\r\na.add(n)\r\na.add(1)\r\nw=999999999999999999999999999999999999999\r\nans=[1,1,1]\r\nfor i in range(int(pow(n,1/3)),0,-1):\r\n n=k\r\n if n%i==0:\r\n ans[0]=i\r\n else:\r\n continue\r\n n=n//i\r\n #print(n)\r\n for i in range(int(pow(n,1/2)),0,-1):\r\n if n%i==0:\r\n ans[2]=i\r\n ans[1]=n//i\r\n else:\r\n continue\r\n #print(ans)\r\n ans.sort()\r\n ans[0]+=1\r\n ans[1]+=2\r\n ans[2]+=2\r\n n=k\r\n w=min(w,ans[0]*ans[-1]*ans[1]-n)\r\nn=k\r\n\r\ne=8*n+9\r\nprint(w,e)", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\ndef main():\r\n n = int(input())\r\n m1 = float('inf')\r\n m2 = float('-inf')\r\n i = 1\r\n while i*i*i <= n:\r\n if n%i != 0:\r\n i += 1\r\n continue\r\n j = 1\r\n while j*j <= n//i:\r\n if (n//i)%j != 0:\r\n j += 1\r\n continue\r\n k = (n // i)//j\r\n # print(i,j,k)\r\n m1 = min(m1 , (i + 1)*(j + 2)*(k + 2) - n)\r\n m1 = min(m1 , (j + 1)*(i + 2)*(k + 2) - n)\r\n m1 = min(m1 , (k + 1)*(j + 2)*(i + 2) - n)\r\n \r\n m2 = max(m2 , (i + 1)*(j + 2)*(k + 2) - n)\r\n m2 = max(m2 , (j + 1)*(i + 2)*(k + 2) - n)\r\n m2 = max(m2 , (k + 1)*(j + 2)*(i + 2) - n)\r\n j += 1\r\n i += 1\r\n print(m1 , m2)\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nmn = 999999999999\r\n\r\nfor i in range(1, int(n**(1/3))+1):\r\n if n%i==0:\r\n for j in range(1, int((n//i)**(1/2))+1):\r\n if (n/i) % j == 0:\r\n k = (n//i)//j\r\n mn = min(mn, (i+1)*(k+2)*(j+2))\r\n\r\nprint(mn-n, (9*n+9-n))", "n = int(input())\r\n\r\na=n+1\r\nb=3\r\nc=3\r\nsmax = b*c + 2*b*(a-1) + 2*(a-1)*(c-2)\r\n\r\na = int(n**(1/3))+1\r\na = max(a,2)\r\nsmin = smax\r\nwhile a>=2:\r\n if n%(a-1)==0:\r\n m = n//(a-1)\r\n b = int(m**0.5)\r\n c = m//b\r\n while b*c != m:\r\n b -= 1\r\n c = m//b\r\n b += 2\r\n c += 2\r\n s = b*c + 2*b*(a-1) + 2*(a-1)*(c-2)\r\n smin = min(s,smin)\r\n a -= 1\r\n\r\nprint(smin,smax)\r\n\r\n\r\n\r\n", "n=int(input())\r\nif n==1:\r\n print(17,17)\r\nelse:\r\n c12=c22=c0=max(1,int((n/4)**(1/3)))\r\n c22+=1\r\n a3,a4,c2=n,1,1\r\n a1,a2,c1=n,1,1\r\n d1=d2=float('inf')\r\n while c12>=1:\r\n if n%c12==0:\r\n n1=n//c12\r\n d=float('inf')\r\n for i in range(1,int(n1**0.5)+1):\r\n if n1%i==0:\r\n c,a,b=sorted([c12,i,n1//i])\r\n if (c+1)*(a+2)*(b+2)<d:\r\n d=(c+1)*(a+2)*(b+2)\r\n a11,a21,c11=a,b,c\r\n if d<d1:\r\n d1=d\r\n a1,a2,c1=a11,a21,c11\r\n else:\r\n break\r\n c12-=1\r\n while c22<=2*c0:\r\n if n%c22==0:\r\n n2=n//c22\r\n d=float('inf')\r\n for i in range(1,int(n2**0.5)+1):\r\n if n2%i==0:\r\n c,a,b=sorted([c22,i,n2//i])\r\n if (c+1)*(a+2)*(b+2)<d:\r\n d=(c+1)*(a+2)*(b+2)\r\n a31,a41,c21=a,b,c\r\n if d<d2:\r\n d2=d\r\n a3,a4,c2=a31,a41,c21\r\n else:\r\n break\r\n c22+=1\r\n print(min((c2+1)*(a3+2)*(a4+2),(c1+1)*(a1+2)*(a2+2))-n,8*n+9)", "n=int(input())\r\n\r\nL=[]\r\n\r\ni=1\r\n\r\nwhile(i*i*i<=n):\r\n if(n%i!=0):\r\n i+=1\r\n continue\r\n x=n//i\r\n j=i\r\n while(j*j<=x):\r\n if(x%j!=0):\r\n j+=1\r\n continue\r\n L.append((i,j,x//j))\r\n j+=1\r\n i+=1\r\nmaxx=0\r\nminn=10**20\r\nE=[[1,2,2],[2,1,2],[2,2,1]]\r\nfor item in L:\r\n x=item[0]\r\n y=item[1]\r\n z=item[2]\r\n A=[x,y,z]\r\n for item in E:\r\n m=(A[0]+item[0])*(A[1]+item[1])*(A[2]+item[2])\r\n if(m<minn):\r\n minn=m\r\n if(m>maxx):\r\n maxx=m\r\nprint(minn-n,maxx-n)\r\n \r\n", "n=int(input())\r\na,mi=1,999999999999\r\nwhile a**3<=n:\r\n if n%a==0:\r\n b=1\r\n while b**2<=(n//a):\r\n if (n//a)%b==0:\r\n c=n//a//b\r\n mi=min(mi,(a+1)*(b+2)*(c+2))\r\n b+=1\r\n a+=1\r\nprint(mi-n, 9*n+9-n)\r\n", "\r\nn=int(input())\r\ni=1\r\nl=[]\r\n#prime-factoraiztion\r\nwhile(i*i<=n):\r\n if(n%i==0):\r\n l.append(i)\r\n i+=1\r\nlmax=[]\r\nlmin=[]\r\nfor i in range(len(l)):\r\n for j in range(i,len(l)):\r\n if(l[i]*l[j]<=n):\r\n t=l[i]*l[j]\r\n if(n%t==0):\r\n k=n//t\r\n lmax.append((l[i]+1)*(l[j]+2)*(k+2))\r\n lmin.append((l[i]+1)*(l[j]+2)*(k+2))\r\n lmax.append((l[i]+2)*(l[j]+2)*(k+1))\r\n lmin.append((l[i]+2)*(l[j]+2)*(k+1))\r\n lmax.append((l[i]+2)*(l[j]+1)*(k+2))\r\n lmin.append((l[i]+2)*(l[j]+1)*(k+2))\r\n \r\nprint(min(lmin)-n,max(lmax)-n)\r\n", "n = int(input())\r\nkd = 0\r\nd = [0] * 100010\r\nfor x in range(1, n + 1):\r\n if x * x > n:\r\n break\r\n elif n % x == 0:\r\n kd += 1\r\n d[kd] = x\r\n if x * x < n:\r\n kd += 1\r\n d[kd] = n // x\r\nminimum = float('inf')\r\nmaximum = -1\r\nfor a in range(1, kd + 1):\r\n for b in range(1, kd + 1):\r\n if n // d[a] % d[b] != 0:\r\n continue\r\n c = n // d[a] // d[b]\r\n cur = (d[a] + 1) * (d[b] + 2) * (c + 2) - n\r\n minimum = min(minimum, cur)\r\n maximum = max(maximum, cur)\r\nprint(minimum, maximum)# 1691165660.7016428", "n = int(input())\r\na = 1\r\nmn = 1000000000000000\r\nmx = -1000000000000000\r\nwhile a * a * a <= n:\r\n if n % a != 0:\r\n a += 1\r\n continue\r\n b = a\r\n while a * b * b <= n:\r\n if (n // a) % b != 0:\r\n b += 1\r\n continue\r\n c = n // a // b\r\n #print(a, b, c)\r\n cur = (a + 1) * (b + 2) * (c + 2)\r\n mn = min(mn, cur)\r\n mx = max(mx, cur)\r\n cur = (a + 2) * (b + 1) * (c + 2)\r\n mn = min(mn, cur)\r\n mx = max(mx, cur)\r\n cur = (a + 2) * (b + 2) * (c + 1)\r\n mn = min(mn, cur)\r\n mx = max(mx, cur)\r\n b += 1\r\n a += 1\r\nprint(mn - n, mx - n)\r\n" ]

{"inputs": ["4", "7", "12", "1", "6", "8", "9", "14", "15", "16", "18", "20", "299999771", "54", "96", "348", "748", "908", "1026", "1985", "4472", "20845", "50480", "62497", "646055", "790620", "989903", "7033800", "7661860", "7834243", "45134118", "89054701", "99264891", "127039320", "206898748", "231136953", "257259713", "286736327", "311933803", "332393619", "422114561", "453012754", "470860680", "509607936", "534879507", "535074941", "536870912", "573308928", "603979776", "605404800", "615716902", "628464178", "631243141", "644972544", "659274082", "679477248", "735134400", "764411904", "778377600", "791683200", "805306368", "821620800", "856079286", "857656800", "859963392", "864864000", "882161280", "884822400", "905969664", "908107200", "918918000", "931170240", "935625600", "936354996", "951350400", "958557600", "972972000", "980179200", "985944960", "994593600", "999893227", "999893387", "999905161", "999942949", "999996583", "999999797", "999999883", "999999893", "999999929", "999999937", "999999991", "999999992", "999999993", "999999994", "999999995", "999999996", "999999997", "999999998", "999999999", "1000000000"], "outputs": ["28 41", "47 65", "48 105", "17 17", "34 57", "40 73", "41 81", "58 121", "55 129", "56 137", "57 153", "64 169", "1499998867 2399998177", "106 441", "144 777", "396 2793", "487 5993", "1840 7273", "591 8217", "3601 15889", "1603 35785", "8873 166769", "17884 403849", "312497 499985", "140995 5168449", "316416 6324969", "1082167 7919233", "210976 56270409", "546725 61294889", "8302235 62673953", "19223945 361072953", "445273517 712437617", "15587889 794119137", "1209066 1016314569", "1683461 1655189993", "539319577 1849095633", "2122207 2058077713", "290355727 2293890625", "1559669027 2495470433", "10714371 2659148961", "78417139 3376916497", "2844347 3624102041", "129486993 3766885449", "3045276 4076863497", "253364145 4279036065", "647722381 4280599537", "3151876 4294967305", "3301020 4586471433", "3414276 4831838217", "3414952 4843238409", "10508698 4925735225", "3574502 5027713433", "634644469 5049945137", "3573148 5159780361", "1977822262 5274192665", "3693060 5435817993", "3886608 5881075209", "3988228 6115295241", "4036708 6227020809", "4082888 6333465609", "4201476 6442450953", "4185636 6572966409", "196667409 6848634297", "4307008 6861254409", "4320292 6879707145", "4331048 6918912009", "4388720 7057290249", "4396766 7078579209", "4529412 7247757321", "4474050 7264857609", "4511288 7351344009", "4548514 7449361929", "4563150 7485004809", "40069269 7490839977", "4614600 7610803209", "4637398 7668460809", "4685478 7783776009", "4707050 7841433609", "4725040 7887559689", "4752650 7956748809", "1000183267 7999145825", "1000724227 7999147105", "1000161721 7999241297", "1000368197 7999543601", "1022096687 7999972673", "4999998997 7999998385", "4999999427 7999999073", "4999999477 7999999153", "4999999657 7999999441", "4999999697 7999999505", "1059701759 7999999937", "129518035 7999999945", "490196227 7999999953", "928571477 7999999961", "4924975 7999999969", "1000000044 7999999977", "15309947 7999999985", "504345691 7999999993", "52392027 8000000001", "4770064 8000000009"]}

UNKNOWN

PYTHON3

CODEFORCES

17

8fa6e1aca0e2b6bce302b0b112f22de6

Letter

A boy Bob likes to draw. Not long ago he bought a rectangular graph (checked) sheet with *n* rows and *m* columns. Bob shaded some of the squares on the sheet. Having seen his masterpiece, he decided to share it with his elder brother, who lives in Flatland. Now Bob has to send his picture by post, but because of the world economic crisis and high oil prices, he wants to send his creation, but to spend as little money as possible. For each sent square of paper (no matter whether it is shaded or not) Bob has to pay 3.14 burles. Please, help Bob cut out of his masterpiece a rectangle of the minimum cost, that will contain all the shaded squares. The rectangle's sides should be parallel to the sheet's sides. The first line of the input data contains numbers *n* and *m* (1<=≤<=*n*,<=*m*<=≤<=50), *n* — amount of lines, and *m* — amount of columns on Bob's sheet. The following *n* lines contain *m* characters each. Character «.» stands for a non-shaded square on the sheet, and «*» — for a shaded square. It is guaranteed that Bob has shaded at least one square. Output the required rectangle of the minimum cost. Study the output data in the sample tests to understand the output format better. Sample Input 6 7 ....... ..***.. ..*.... ..***.. ..*.... ..***.. 3 3 *** *.* *** Sample Output *** *.. *** *.. *** *** *.* ***

[ "def main():\r\n n, m = list(map(int, input().split()))\r\n arr = []\r\n for _ in range(n):\r\n arr.append(input())\r\n\r\n mn_i, mx_i, mx_j, mn_j = n, -1, -1, m\r\n for i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == \"*\":\r\n mn_i = min(mn_i, i)\r\n mx_i = max(mx_i, i)\r\n mn_j = min(mn_j, j)\r\n mx_j = max(mx_j, j)\r\n for i in range(mn_i, mx_i + 1):\r\n print(arr[i][mn_j : mx_j + 1])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#%%\r\nrc=input().split()\r\nr,c=[int(x) for x in rc]\r\nmatrix=[]\r\nfor i in range(r):\r\n matrix.append(input())\r\nmax_i=0\r\nmax_j=0\r\nmin_i=r-1\r\nmin_j=c-1\r\nfor i in range(r):\r\n for j in range(c):\r\n if matrix[i][j]=='*':\r\n if i<min_i:\r\n min_i=i\r\n if i>max_i:\r\n max_i=i\r\n if j<min_j:\r\n min_j=j\r\n if j>=max_j:\r\n max_j=j\r\nfor i in range(min_i,max_i+1):\r\n print(matrix[i][min_j:max_j+1])\r\n\r\n\r\n\r\n# %%\r\n", "n,m=map(int,input().split())\r\nd=[]\r\nfor i in range(n):\r\n s=input()\r\n s=list(s)\r\n d.append(s)\r\nminc=m\r\nmaxc=0\r\nminr=n\r\nmaxr=0\r\nfor i in range(n):\r\n if \"*\" in d[i]:\r\n if i<minr:\r\n minr=i\r\n if i>maxr:\r\n maxr=i\r\n for j in range(m):\r\n if d[i][j]==\"*\":\r\n if j<minc:\r\n minc=j\r\n if j>maxc:\r\n maxc=j\r\n\r\nfor i in range(minr,maxr+1):\r\n es=\"\"\r\n for j in range(minc,maxc+1):\r\n es+=d[i][j]\r\n print(es)\r\n\r\n", "n,m =map(int,input().split(' '))\r\ngrid=[]\r\nimin=float('inf')\r\nimax=float('-inf')\r\njmin=float('inf')\r\njmax=float('-inf')\r\nfor _ in range(n):\r\n grid.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j]==\"*\":\r\n imin=min(i,imin)\r\n imax=max(i,imax)\r\n jmin=min(j,jmin)\r\n jmax=max(j,jmax)\r\nfor k in range(imin,imax+1):\r\n print(grid[k][jmin:jmax+1])", "def q14a():\n\tn, m = tuple([int(num) for num in input().split()])\n\trows_of_array = []\n\tfor i in range(n):\n\t\ttemp_str = input()\n\t\trows_of_array.append(temp_str)\n\trows_of_array = q14a_cut(rows_of_array)\n\trows_of_array.reverse()\n\trows_of_array = q14a_cut(rows_of_array)\n\trows_of_array.reverse()\n\ttransposed = [\"\".join(list(tuple_)) for tuple_ in list(zip(*rows_of_array))]\n\ttransposed = q14a_cut(transposed)\n\ttransposed.reverse()\n\ttransposed = q14a_cut(transposed)\n\ttransposed.reverse()\n\tdouble_transposed = [\"\".join(list(tuple_)) for tuple_ in list(zip(*transposed))]\n\tprint(\"\\n\".join(double_transposed))\n\ndef q14a_cut(rows_of_array):\n\ti = 0\n\twhile('*' not in rows_of_array[i]):\n\t\ti += 1\n\treturn rows_of_array[i:]\n\nq14a()\n\n\n\n\n\n\n\n\n\n# Previous (buggy) version: failed when there are empty lines in middle\n# def q14a():\n# \tn, m = tuple([int(num) for num in input().split()])\n# \trows_of_array = []\n# \tfor i in range(n):\n# \t\ttemp_str = input()\n# \t\tif('*' in temp_str):\n# \t\t\trows_of_array.append(temp_str)\n# \ttransposed = [\"\".join(list(tuple_)) for tuple_ in list(zip(*rows_of_array))]\n# \tfor i in range(len(transposed)-1, -1, -1):\n# \t\tif('*' not in transposed[i]):\n# \t\t\ttransposed.pop(i)\n# \tdouble_transposed = [\"\".join(list(tuple_)) for tuple_ in list(zip(*transposed))]\n# \t#print(double_transposed)\n# \tprint(\"\\n\".join(double_transposed))", "n,m=map(int,input().split(\" \"))\r\ns,e,c ,s_1,e_1=100,0,0,-1,0 # start ,end , count ,start_rectangle,end_rectangle\r\nl=[]\r\n\r\nfor i in range(n):\r\n temp=input()\r\n if (\"*\" in temp ):\r\n if (s_1==-1 ):s_1=i\r\n if(temp.index(\"*\")<s):\r\n s=temp.index(\"*\")\r\n if(temp.rindex(\"*\")>e ):\r\n e=temp.rindex(\"*\") \r\n \r\n if ( e_1<i ):e_1=i\r\n l.append(list(temp))\r\n\r\n\r\nfor i in range(s_1,e_1+1):\r\n print(\"\".join(l[i][s:e+1]))\r\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 (list(s[:len(s) - 1]))\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 n, m = invr()\r\n A = list()\r\n minX = m\r\n maxX = -1\r\n minY = n\r\n maxY = -1\r\n for row in range(n):\r\n s = input()\r\n A.append(s)\r\n firstIndex = s.find(\"*\")\r\n if firstIndex != -1:\r\n minX = min(minX, firstIndex)\r\n lastIndex = s.rfind(\"*\")\r\n maxX = max(maxX, lastIndex)\r\n minY = min(minY, row)\r\n maxY = max(maxY, row)\r\n # print(minX, maxX, minY, maxY)\r\n for r in range(minY, maxY + 1):\r\n print(A[r][minX:maxX + 1])\r\n", "MAXN = 55\r\n\r\nn, m = map(int, input().split())\r\ns = [input() for _ in range(n)]\r\n\r\nminrow = MAXN\r\nmaxrow = -1\r\nmincolumn = MAXN\r\nmaxcolumn = -1\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j] == '.':\r\n continue\r\n minrow = min(minrow, i)\r\n mincolumn = min(mincolumn, j)\r\n maxrow = max(maxrow, i)\r\n maxcolumn = max(maxcolumn, j)\r\n\r\nfor i in range(minrow, maxrow + 1):\r\n for j in range(mincolumn, maxcolumn + 1):\r\n print(s[i][j], end=\"\")\r\n print()\r\n", "n,m = map(int, input().split())\r\nletter = []\r\nl_uk = 0\r\nind = -1\r\nr_uk = m\r\nfor i in range(n):\r\n\tletter.append(input())\r\n\tif i - ind == 1:\r\n\t\tif letter[i] == m*'.':\r\n\t\t\tind = i\r\n\tif i == 0 or l_uk == -1:\r\n\t\tl_uk = letter[i].find('*')\r\n\t\tr_uk = letter[i].rfind('*')\r\n\telse:\r\n\t\tif letter[i].find('*') < l_uk and letter[i].find('*') != -1: l_uk = letter[i].find('*')\r\n\t\tif letter[i].rfind('*') > r_uk and letter[i].rfind('*') != -1: r_uk = letter[i].rfind('*')\r\nwhile letter[0]==m*'.': del letter[0]\r\nwhile letter[-1]==m*'.': del letter[-1]\r\nfor i in letter: print(i[l_uk:r_uk+1])", "def input_matrix(n):\r\n matrix = []\r\n for i in range(n):\r\n matrix.append(input())\r\n return matrix\r\n\r\ndef clear(a):\r\n i = 0\r\n while \"*\" not in a[i]:\r\n i += 1\r\n j = len(a)-1\r\n while \"*\" not in a[j]:\r\n j -= 1\r\n return a[i:j+1]\r\n\r\nn, m = map(int, input().split())\r\na = clear(input_matrix(n))\r\n\r\nleft = m-1\r\nright = 0\r\nfor x in a:\r\n if \"*\" in x:\r\n left = min(left, x.find(\"*\"))\r\n right = max(right, x.rfind(\"*\"))\r\n \r\nfor x in a:\r\n print(x[left:right+1], sep=\"\")\r\n ", "n, m = map(int, input().split())\nA = [input() for _ in [0] * n]\na = b = 10 ** 2\nc = d = -1\nfor y in range(n):\n for x in range(m):\n if A[y][x] == '*':\n a = min(a, y)\n b = min(b, x)\n c = max(c, y)\n d = max(d, x)\nprint(*[x[b:d + 1] for x in A[a:c + 1]], sep='\\n')\n", "n, m = map(int, input().split())\nmat = [list(input().strip()) for i in range(n)]\nleft = -1\n\ntmat = list(zip(*mat))\n\n\nfor i in range(m):\n if '*' in tmat[i]:\n left = i\n break\nfor i in range(m - 1, -1, -1):\n if '*' in tmat[i]:\n right = i\n break\nfor i in range(n):\n if '*' in mat[i]:\n top = i\n break\nfor i in range(n - 1, -1, -1):\n if '*' in mat[i]:\n bottom = i\n break\n\nfor i in range(top, bottom + 1):\n ch = ''\n for j in range(left, right + 1):\n ch += mat[i][j]\n print(ch)\n", "def find_the_row_from_top(l):\r\n for i in range(len(l)):\r\n for j in range(len(l[i])):\r\n if l[i][j] == \"*\":\r\n return i\r\n\r\n\r\ndef find_the_row_from_bottom(l):\r\n for k in range(len(l)):\r\n i = len(l) - 1 - k\r\n for j in range(len(l[i])):\r\n if l[i][j] == \"*\":\r\n return i\r\n\r\ndef find_the_column_from_right(l):\r\n for i in range(len(l[0])):\r\n for j in range(len(l)):\r\n if l[j][i] == \"*\":\r\n return i\r\n\r\ndef find_the_column_from_left(l):\r\n for i in range(len(l[0])):\r\n k = len(l[0]) - 1 - i\r\n for j in range(len(l)):\r\n if l[j][k] == \"*\":\r\n return k\r\n\r\n\r\n\r\ndef main_function():\r\n input_list = [input() for i in range([int(i) for i in input().split(\" \")][0])]\r\n start_i = find_the_row_from_top(input_list)\r\n end_i = find_the_row_from_bottom(input_list)\r\n end_j = find_the_column_from_left(input_list)\r\n start_j = find_the_column_from_right(input_list)\r\n output_list = []\r\n for i in range(start_i, end_i + 1):\r\n output_list.append(input_list[i][start_j:end_j + 1])\r\n return \"\\n\".join(output_list)\r\n\r\n\r\n\r\nprint(main_function())\r\n", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n m, n = map(int, inp[0].split())\r\n s = inp[1:]\r\n x, y = set(), set()\r\n for i in range(m):\r\n for j in range(n):\r\n if s[i][j] == '*':\r\n x.add(i); y.add(j)\r\n out = []\r\n for i in range(min(x), max(x)+1):\r\n out.append(s[i][min(y):max(y)+1])\r\n return out\r\n \r\nprint(*main(), sep='\\n')\r\n", "import sys\r\n\r\ninput = list(map(int, sys.stdin.readline().split()))\r\n\r\nrow_len = input[0]\r\ncol_len = input[1]\r\n\r\nrows = []\r\nrow_begin = sys.maxsize\r\nrow_end = 0\r\ncol_begin = sys.maxsize\r\ncol_end = 0\r\n\r\nfor i in range(row_len):\r\n rows.append(list(sys.stdin.readline().strip()))\r\n\r\nfor i in range(row_len):\r\n row = rows[i]\r\n for j in range(len(row)):\r\n if row[j] == '*':\r\n row_begin = min(row_begin, i)\r\n row_end = max(row_end, i)\r\n col_begin = min(col_begin, j)\r\n col_end = max(col_end, j)\r\n\r\nfor i in range(row_begin, row_end + 1):\r\n for j in range(col_begin, col_end + 1):\r\n print(rows[i][j], end='')\r\n print('')", "n,m = [int(x) for x in input().split()]\r\n\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(input())\r\n\r\nleft = m\r\ntop = n\r\nright = 0\r\nbottom = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if matrix[i][j] == '*':\r\n if j < left:\r\n left = j\r\n if j > right:\r\n right = j\r\n if i < top:\r\n top = i\r\n if i > bottom:\r\n bottom = i\r\n\r\nfor i in range(top, bottom + 1):\r\n for j in range(left, right + 1):\r\n print(matrix[i][j], end=\"\")\r\n print(end=\"\\n\")\r\n", "a, q = map(int, input().split(' '))\r\ns = []\r\nd = []\r\ne = []\r\nfor i in range(a):\r\n *w, = input()\r\n e.append(w)\r\n if '*' in w:\r\n for j in range(q):\r\n if w[j] == '*':\r\n s.append(i)\r\n d.append(j)\r\nfor i in range(min(s), max(s) + 1):\r\n f = ''\r\n for j in range(min(d), max(d) + 1):\r\n f += str(e[i][j])\r\n print(f)\r\n", "n,m=[int(x) for x in input().split()]\r\na,hmin,hmax,lmin,lmax=[],51,-1,51,-1\r\nfor i in range(n):\r\n s=input()\r\n a.append(s)\r\n if s.count('*')>0:\r\n hmin=min(i,hmin)\r\n hmax=max(i,hmax)\r\n for j in range(m):\r\n if s[j]=='*':\r\n lmin=min(j,lmin)\r\n lmax=max(j,lmax)\r\nfor i in range(hmin,hmax+1):\r\n print(a[i][lmin:lmax+1])", "n, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\nup, down, left, right = 0, n - 1, 0, m - 1\r\nfor i in range(n):\r\n if '*' in a[i]:\r\n up = i\r\n break\r\nfor i in range(n - 1, -1, -1):\r\n if '*' in a[i]:\r\n down = i\r\n break\r\nfor i in range(m):\r\n if '*' in [a[j][i] for j in range(n)]:\r\n left = i\r\n break\r\nfor i in range(m - 1, -1, -1):\r\n if '*' in [a[j][i] for j in range(n)]:\r\n right = i\r\n break\r\nfor i in range(up, down + 1):\r\n print(a[i][left:right + 1])\r\n", "n,m = map(int, input().split())\r\nb = []\r\nfor _ in range(n):\r\n b.append(input())\r\n#rbegin, rend, cbegin, cend = 1, 5, 2, 4\r\nrbegin, rend, cbegin, cend = n, 0, m, 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[i][j] == '*':\r\n rbegin = min(rbegin, i)\r\n rend = max(rend, i)\r\n cbegin = min(cbegin, j)\r\n cend = max(cend, j)\r\n\r\nfor i in range(rbegin, rend+1):\r\n print(b[i][cbegin:cend+1])", "n, m = map(int, input().split())\na = []\nleft = m\nright = m\nstar = -1\nfor i in range(n):\n row = input()\n if row == \".\" * m:\n if star == -1:\n continue\n else:\n star = len(a)\n j = 0\n while j < m and row[j] == '.':\n j += 1\n left = min(left, j)\n j = 0\n while j < m and row[-j - 1] == '.':\n j += 1\n right = min(right, j)\n a.append(row)\nfor row in a[:star + 1]:\n print(row[left: m - right])", "from sys import stdin, stdout\r\n\r\n[n, m] = [int(x) for x in stdin.readline().split()]\r\nf = []\r\nminx, miny, maxx, maxy = n - 1, m - 1, 0, 0\r\n\r\nfor i in range(n):\r\n f.append(stdin.readline().strip())\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if f[i][j] == '*':\r\n minx = min(minx, i)\r\n miny = min(miny, j)\r\n maxx = max(maxx, i)\r\n maxy = max(maxy, j)\r\nfor i in range(minx, maxx + 1):\r\n stdout.write(f[i][miny : maxy + 1] + '\\n')", "n = int(input().split()[0])\r\nk = []\r\nl = 50\r\nr = 0\r\n\r\nfor i in range(n):\r\n s = input()\r\n k.append(s)\r\n tl = s.find('*')\r\n tr = s.rfind('*')\r\n if tl < l and tl != -1:\r\n l = tl\r\n if tr > r and tr != -1:\r\n r = tr\r\n\r\nw = 0\r\nh = n\r\nfor i in k:\r\n if i.find('*') == -1:\r\n w += 1\r\n else:\r\n break\r\nfor i in range(n - 1, -1, -1):\r\n if k[i].find('*') == -1:\r\n h -= 1\r\n else:\r\n break\r\n\r\nfor i in range(w, h):\r\n print(k[i][l:r + 1])", "n,m = [int(x) for x in input().split()]\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n\r\nwhile True:\r\n if len(set(a[0]))==1 and a[0][0] =='.':\r\n a = a[1:]\r\n else:\r\n break\r\nwhile True:\r\n if len(set(a[-1]))==1 and a[-1][0] =='.':\r\n a = a[:-1]\r\n else:\r\n break\r\nwhile True:\r\n if len(set([x[0] for x in a]))==1 and a[0][0]=='.':\r\n a = [x[1:] for x in a]\r\n else:\r\n break\r\nwhile True:\r\n if len(set([x[-1] for x in a]))==1 and a[0][-1]=='.':\r\n a = [x[:-1] for x in a]\r\n else:\r\n break\r\n \r\nfor i in a:\r\n print(i)\r\n", "for ctr in range(1):\r\n r,c=map(int,input().split())\r\n m=[input().strip() for i in range(r)]\r\n s,e=[],[]\r\n for i in m:\r\n if '*' in i:\r\n s.append(i.index('*'))\r\n e.append(c-i[::-1].index('*'))\r\n for i in range(r):\r\n if '*' in m[i]:\r\n st=i\r\n break\r\n for i in range(r-1,-1,-1):\r\n if '*' in m[i]:\r\n end=i\r\n break\r\n x=min(s)\r\n y=max(e)\r\n for i in range(st,end+1):\r\n print(m[i][x:y])\r\n \r\n \r\n", "t=1\r\n#t = int(input())\r\nfor i in range(t):\r\n #n = int(input())\r\n arr = input()\r\n arr = arr.split()\r\n a = [int(x) for x in arr] #; print(a)\r\n s = []\r\n for j in range(a[0]):\r\n s.append(input())\r\n while s[0].count('*') == 0:\r\n s = s[1:]\r\n while s[-1].count('*') == 0:\r\n s = s[:len(s)-1]\r\n f = True\r\n while f:\r\n for d in range(len(s)):\r\n if s[d][0] == '*':\r\n f = False\r\n if f:\r\n for d in range(len(s)):\r\n s[d] = s[d][1:]\r\n f = True\r\n while f:\r\n for d in range(len(s)):\r\n if s[d][-1] == '*':\r\n f = False\r\n if f:\r\n for d in range(len(s)):\r\n s[d] = s[d][:len(s[d])-1]\r\n\r\n for j in range(len(s)):\r\n print(s[j])", "n,m=map(int,input().split())\r\nMAP=[list(input().strip()) for i in range(n)]\r\n\r\nwhile MAP[-1]==[\".\"]*len(MAP[-1]):\r\n MAP.pop()\r\n\r\nwhile MAP[0]==[\".\"]*len(MAP[-1]):\r\n MAP.pop(0)\r\n\r\nMAP2=[[\"\"]*len(MAP) for i in range(len(MAP[0]))]\r\n\r\nfor i in range(len(MAP)):\r\n for j in range(len(MAP[0])):\r\n MAP2[j][i]=MAP[i][j]\r\n\r\nwhile MAP2[-1]==[\".\"]*len(MAP2[-1]):\r\n MAP2.pop()\r\n\r\nwhile MAP2[0]==[\".\"]*len(MAP2[-1]):\r\n MAP2.pop(0)\r\n\r\nMAP=MAP2\r\n\r\n\r\nMAP2=[[\"\"]*len(MAP) for i in range(len(MAP[0]))]\r\n\r\nfor i in range(len(MAP)):\r\n for j in range(len(MAP[0])):\r\n MAP2[j][i]=MAP[i][j]\r\n\r\nfor i in range(len(MAP2)):\r\n print(\"\".join(MAP2[i]))\r\n\r\n", "def main():\r\n [n, m] = list(map(int, input().split()))\r\n a = []\r\n for _ in range(n):\r\n a.append(list(input()))\r\n\r\n top = 12345\r\n bottom = -12345\r\n left = 12345\r\n right = -12345\r\n for i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '*':\r\n top = min(top, i)\r\n right = max(right, j)\r\n bottom = max(bottom, i)\r\n left = min(left, j)\r\n\r\n for i in range(top, bottom + 1):\r\n for j in range(left, right + 1):\r\n print(a[i][j], end = '')\r\n print()\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nl=[]\r\nlr=[]\r\nlr2=[]\r\nlc=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\tl.append(s)\r\n\tif \"*\" in s:\r\n\t\tlr.append(s.index(\"*\"))\r\n\t\tlr2.append(s.rindex(\"*\"))\r\n\t\tlc.append(i)\r\n\r\nfor i in range(min(lc),max(lc)+1):\r\n\tprint(l[i][min(lr):max(lr2)+1])", "I = input().split()\r\nl = int(I[0])\r\nw = int(I[1])\r\n\r\ndata = []\r\nfor i in range(l):\r\n row = list(input())\r\n data.append(row)\r\n\r\nspecial_coordinates = []\r\nfor i in range(l):\r\n for j in range(w):\r\n if data[i][j] == \"*\":\r\n x = j\r\n y = i\r\n special_coordinates.append((x, y))\r\n\r\nxmin = w - 1\r\nxmax = 0\r\nymin = l - 1\r\nymax = 0\r\n\r\nfor i in special_coordinates:\r\n x = i[0]\r\n y = i[1]\r\n\r\n if x > xmax:\r\n xmax = x\r\n if x < xmin:\r\n xmin = x\r\n if y > ymax:\r\n ymax = y\r\n if y < ymin:\r\n ymin = y\r\n\r\nnew_data1 = []\r\nfor i in range(ymin, ymax + 1):\r\n a = []\r\n for j in range(xmin, xmax + 1):\r\n a.append(data[i][j])\r\n new_data1.append(a)\r\n\r\nnew_data2 = []\r\nfor i in new_data1:\r\n s = \"\"\r\n for j in i:\r\n s += j\r\n new_data2.append(s)\r\n\r\nfinal_data = \"\"\r\nfor i in new_data2:\r\n final_data += i + \"\\n\"\r\n\r\noutput = final_data[:-1]\r\nprint(output)", "# https://codeforces.com/problemset/problem/14/A\r\n\r\ndef func_sol(raw_data):\r\n data = raw_data.split('\\n')\r\n n, m = map(int, data[0].split(' '))\r\n a = data[1:-1]\r\n\r\n x1, y1 = None, None\r\n for i in range(n):\r\n for j in range(m):\r\n if a[i][j] != '.':\r\n x1, y1 = i, j\r\n break\r\n if x1 is not None:\r\n break\r\n\r\n x2, y2 = None, None\r\n for j in range(m):\r\n for i in range(n):\r\n if a[i][j] != '.':\r\n x2, y2 = i, j\r\n break\r\n if x2 is not None:\r\n break\r\n\r\n tlx, tly = min(x1, x2), min(y1, y2)\r\n\r\n x1, y1 = None, None\r\n for i in range(n - 1, -1, -1):\r\n for j in range(m - 1, -1, -1):\r\n if a[i][j] != '.':\r\n x1, y1 = i, j\r\n break\r\n if x1 is not None:\r\n break\r\n\r\n x2, y2 = None, None\r\n for j in range(m - 1, -1, -1):\r\n for i in range(n - 1, -1, -1):\r\n if a[i][j] != '.':\r\n x2, y2 = i, j\r\n break\r\n if x2 is not None:\r\n break\r\n\r\n brx, bry = max(x1, x2), max(y1, y2)\r\n\r\n s = [a[i][tly:bry + 1] for i in range(tlx, brx + 1)]\r\n\r\n return '\\n'.join(s) + '\\n'\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read()))\r\n\r\n\r\nmain()\r\n", "# your code here\r\nn, m = [int(x) for x in input().split()]\r\na = [input() for _ in range(n)]\r\n\r\nwhile all(row[0] == '.' for row in a):\r\n a = [row[1:] for row in a]\r\n\r\nwhile all(row[-1] == '.' for row in a):\r\n a = [row[:-1] for row in a]\r\n\r\nwhile not a[0].strip('.'):\r\n a = a[1:]\r\n\r\nwhile not a[-1].strip('.'):\r\n a = a[:-1]\r\n\r\nprint('\\n'.join(a))\r\n", "n, m = map(int, input().split())\r\nh1, h2, w1, w2, lst = -1, -1, -1, -1, []\r\nfor x in range(n): lst.append(input())\r\nfor i in range(m):\r\n for j in range(n):\r\n if lst[j][i] == '*':\r\n w1 = i\r\n break\r\n if w1 != -1: break\r\nfor i in range(m - 1, -1, -1):\r\n for j in range(n):\r\n if lst[j][i] == '*':\r\n w2 = i + 1\r\n break\r\n if w2 != -1: break\r\nfor i in range(n):\r\n for j in range(m):\r\n if lst[i][j] == '*':\r\n h1 = i\r\n break\r\n if h1 != -1: break\r\nfor i in range(n - 1, -1, -1):\r\n for j in range(m):\r\n if lst[i][j] == '*':\r\n h2 = i + 1\r\n break\r\n if h2 != -1: break\r\nfor x in range(h1, h2): print(lst[x][w1:w2])", "n,m=map(int,input().split())\r\nb=[]\r\nd=[]\r\nq=[]\r\np=[]\r\nw=[]\r\npo=[]\r\nfor i in range(n):\r\n a=input()\r\n b.append(a)\r\nfor j in range(n):\r\n for k in range(m):\r\n if b[j][k]=='*':\r\n d+=[k]\r\n break\r\nt=min(d)\r\nfor l in range(n):\r\n for e in range(m):\r\n if b[l][::-1][e]=='*':\r\n q+=[m-e]\r\n break\r\nx=max(q)\r\nfor u in range(n):\r\n p+=[b[u][t:x]]\r\nfor qw in range(n):\r\n if '*' in b[qw]:\r\n w+=[qw]\r\nfor qwe in range(min(w),max(w)+1):\r\n po+=[p[qwe]]\r\nfor poi in po:\r\n print(poi)", "n,m=map(int,input().split())\narr=[]\narr1=[]\nfor i in range(0,n):\n arr.append(input())\nfor i in range(0,n):\n for j in range(0,m):\n if arr[i][j]=='*':\n arr1.append((i,j))\nminx=10000\nmaxx=-1\nminy=10000\nmaxy=-1\nfor i in range(0,len(arr1)):\n if minx>arr1[i][0]:\n minx=arr1[i][0]\n if maxx<arr1[i][0]:\n maxx=arr1[i][0]\n if miny>arr1[i][1]:\n miny=arr1[i][1]\n if maxy<arr1[i][1]:\n maxy=arr1[i][1]\nfor i in range(minx,maxx+1):\n for j in range(miny,maxy+1):\n if j!=maxy:\n print(arr[i][j],end=\"\")\n else:\n print(arr[i][j])\n# 15 3\n# ...\n# ...\n# ...\n# .**\n# ...\n# ...\n# *..\n# ...\n# .*.\n# ..*\n# ..*\n# *..\n# ..*\n# ...\n# ...", "import sys\r\ninput = lambda:sys.stdin.readline()\r\n\r\ndef solve(r,c,a):\r\n li,ri = [],[]\r\n rm,rmx,cm,cmx = float(\"inf\"),float(\"-inf\"),float(\"inf\"),float(\"-inf\")\r\n for i in range(r):\r\n for j in range(c):\r\n if a[i][j] == \"*\":\r\n rm,cm = min(rm,i),min(cm,j)\r\n rmx,cmx = max(rmx,i),max(cmx,j)\r\n li = [rm,cm]\r\n ri = [rmx,cmx]\r\n\r\n\r\n flag = 1\r\n for i in range(rmx+1):\r\n lis = a[i]\r\n if i <= ri[0] and not flag:\r\n l = lis[li[1]:ri[1]+1]\r\n print(*l,sep='') \r\n if \"*\" in lis and flag:\r\n flag = 0\r\n l = lis[li[1]:ri[1]+1]\r\n print(*l,sep='')\r\n\r\n# for _ in range(int(input())):\r\nr,c = map(int,input().split())\r\na = []\r\nfor i in range(r):\r\n s = str(input())\r\n a.append(list(s)[:-1])\r\nsolve(r,c,a)", "n, m = map(int, input().split())\r\ngrid = [input() for _ in range(n)]\r\ntop, left = n, m\r\nbottom, right = 0, 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '*':\r\n top = min(top, i)\r\n left = min(left, j)\r\n bottom = max(bottom, i)\r\n right = max(right, j)\r\nwidth, height = right - left + 1, bottom - top + 1\r\nfor i in range(top, bottom + 1):\r\n print(grid[i][left:left + width])\r\n", "a,b = map(int,input().split())\r\nd = []\r\nz = 0\r\nfor i in range(a):\r\n s = input()\r\n if z == 1:\r\n d.append(s)\r\n if \"*\" in s and z == 0: \r\n d.append(s)\r\n z = 1\r\nn = d[::-1]\r\nfor i in range(len(d)):\r\n if \"*\" in n[i]:\r\n c = n[i:]\r\n break\r\nd = c[::-1]\r\nd1 = 0\r\nd2 = 1000\r\nfor i in range(len(d)):\r\n if \"*\" in d[i]:\r\n if d[i].rfind(\"*\") > d1:\r\n d1 = d[i].rfind(\"*\")\r\n if d[i].find(\"*\") < d2:\r\n d2 = d[i].find(\"*\")\r\nfor i in range(len(d)):\r\n print(d[i][d2:d1+1])", "r,c = map(int,input().split())\r\nli=[]\r\nfor i in range(r):\r\n li.append(input())\r\nrmax = 0\r\nrmin = r\r\ncmax = 0\r\ncmin = c\r\nfor i in range(r):\r\n for j in range(c):\r\n if li[i][j]=='*':\r\n if rmin >= i:\r\n rmin = i\r\n if cmin >= j:\r\n cmin = j\r\n\r\n if rmax <= i:\r\n rmax = i\r\n if cmax <= j:\r\n cmax = j\r\n\r\nfor i in range(rmin,rmax+1):\r\n for j in range(cmin,cmax+1):\r\n print(li[i][j],end='')\r\n print()\r\n ", "from decimal import *\r\nt, _ = map(int, input().split())\r\ns = []\r\nmx = -99999\r\nfmx = -999999\r\nfmn = 999999\r\nfor i in range(t):\r\n n = input()\r\n s.append(n)\r\n if fmx < n.rfind('*'):\r\n fmx = n.rfind('*')\r\n if (fmn > n.find('*')) and n.find('*') != -1:\r\n fmn = n.find('*')\r\n\r\n\r\nm = []\r\nfor i in range(len(s)):\r\n if s[i].count('*') > 0:\r\n t = i\r\n break\r\nt2 = 0\r\nfor i in range(len(s)-1, 0, -1):\r\n if s[i].count('*') > 0:\r\n t2 = i\r\n break\r\nv = []\r\nfor i in range(t, t2+1):\r\n v.append(s[i])\r\n\r\nfor i in v:\r\n print(i[fmn:fmx+1])\r\n", "n, m = [int(n) for n in input().split()]\r\n\r\npaper = []\r\ncount_ = 0\r\nmin_x, min_y, max_x, max_y = m, n, 0, 0\r\n# ввод данных с листка о заштрихованных клетках рисунка\r\nfor i in range(n):\r\n str_ = input().strip()\r\n paper.append(str_)\r\n cur_min_x = str_.find('*')\r\n cur_max_x = str_.rfind('*')\r\n if cur_min_x > -1:\r\n min_x = min(min_x, cur_min_x)\r\n if min_y == n:\r\n min_y = i\r\n if cur_max_x > -1:\r\n max_x = max(max_x, cur_max_x)\r\n max_y = i\r\nfor i in range(min_y, max_y + 1):\r\n print(paper[i][min_x : max_x + 1])", "n,m = map(int,input().split())\r\nl = []\r\n\r\nfor i in range(n):\r\n picture = input()\r\n l.append(picture)\r\nlmin = lmax = 0\r\nfor i in range(n):\r\n if l[i] != '.'*m:\r\n lmin = i\r\n break\r\n\r\nfor i in range(n):\r\n if l[-i-1] != '.'*m:\r\n lmax = n-1-i\r\n break\r\n\r\n\r\nminimum = m-1\r\nmaximum = -m #准备切片\r\nfor i in range(len(l)):\r\n for j in range(m):\r\n if l[i][j] == '*' and j < minimum:\r\n minimum = j\r\n break\r\n\r\nfor i in range(len(l)):\r\n for j in range(1,m+1):\r\n if l[i][-j] == '*' and -j > maximum:\r\n maximum = -j\r\n break\r\n\r\nfor k in l[lmin:lmax+1]:\r\n print(k[minimum:m+maximum+1])", "n,m = list(map(int,input().split()))\r\na = []\r\nminx = 100\r\nmaxx = -1\r\nminy = 100\r\nmaxy = -1\r\nfor i in range(n):\r\n b = input()\r\n index = b.find('*')\r\n index1 = m-1-b[::-1] .find('*')\r\n a.append(b)\r\n if index!=-1:\r\n maxy = i\r\n if miny>i:\r\n miny = i\r\n\r\n if minx>index:\r\n minx = index\r\n if index1>maxx:\r\n maxx = index1\r\nfor i in range(miny,maxy+1,1):\r\n print((a[i])[minx:maxx+1])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ns = [list(input().rstrip()) for _ in range(n)]\r\nok = 0\r\nfor i in range(n):\r\n si = s[i]\r\n for j in range(m):\r\n if si[j] == \"*\":\r\n lx = i\r\n ok = 1\r\n break\r\n if ok:\r\n break\r\nok = 0\r\nfor i in range(n - 1, -1, -1):\r\n si = s[i]\r\n for j in range(m):\r\n if si[j] == \"*\":\r\n rx = i + 1\r\n ok = 1\r\n break\r\n if ok:\r\n break\r\nok = 0\r\nfor i in range(m):\r\n for j in range(n):\r\n if s[j][i] == \"*\":\r\n ly = i\r\n ok = 1\r\n break\r\n if ok:\r\n break\r\nok = 0\r\nfor i in range(m - 1, -1, -1):\r\n for j in range(n):\r\n if s[j][i] == \"*\":\r\n ry = i + 1\r\n ok = 1\r\n break\r\n if ok:\r\n break\r\nans = [[s[i][j] for j in range(ly, ry)] for i in range(lx, rx)]\r\nfor i in range(len(ans)):\r\n ans[i] = \"\".join(ans[i])\r\nprint(\"\\n\".join(ans))", "x,y = map(int,input().split())\r\ninput_list=[]\r\nx_min=x+1\r\nx_max=-1\r\ny_min = y+1\r\ny_max = -1\r\nfor i in range(x):\r\n input_list.append(input())\r\n if \"*\" in input_list[i]:\r\n if x_min>i:\r\n x_min=i\r\n if x_max<i:\r\n x_max=i\r\n for j in range(y):\r\n if input_list[i][j]=='*':\r\n if y_min>j:\r\n y_min=j\r\n if y_max<j:\r\n y_max=j\r\nanswer=[]\r\nif x_max!=-1:\r\n for i in range(x_max-x_min+1):\r\n answer.append([input_list[x_min+i][y_min:y_max+1]])\r\nfor i in answer:\r\n print(*i)\r\n", "n, m = map(int, input().split())\n\nmasterpiece = []\nleftmost = m\nrightmost = 0\nuppermost = n\nbottommost = 0\n\ncounter = 0\nfor _ in range(n):\n line = input()\n for i in range(len(line)):\n if line[i] == \"*\":\n if i < leftmost:\n leftmost = i\n if i > rightmost:\n rightmost = i\n if \"*\" in line:\n if uppermost > counter:\n uppermost = counter\n if bottommost < counter:\n bottommost = counter\n counter += 1\n masterpiece.append(line)\n\nfor line in masterpiece[uppermost:bottommost+1]:\n print(\"\".join(line[leftmost:rightmost+1]))\n", "n, m = map(int, input().split())\r\n\r\nl = m + 1\r\nr = 0\r\n\r\nTF = False\r\nwords = []\r\nfor _ in range(n):\r\n word = input()\r\n if '*' in word or TF:\r\n TF = True\r\n words.append(word)\r\n l_, r_ = word.find('*'), word.rfind('*')\r\n l, r = min(l if l_ == -1 else l_, l), max(r_, r)\r\n\r\nerr = 0\r\nfor i in range(n):\r\n if '*' in words[-(i + 1 - err)]:\r\n break\r\n else:\r\n del words[-(i + 1 - err)]\r\n err += 1\r\n\r\nprint(*[word[l:r + 1] for word in words], sep='\\n')\r\n", "n,m=map(int,input().split())\r\nA=[input()for _ in[0]*n]\r\na=b=1E2;c=d=-1\r\nfor y in range(n):\r\n for x in range(m):\r\n if A[y][x]=='*':\r\n a=min(a,y);b=min(b,x)\r\n c=max(c,y);d=max(d,x)\r\nprint(*[x[b:d+1]for x in A[a:c+1]],sep='\\n')", "n,m=[int(i) for i in input().split()]\r\nmat=['']*n\r\nfor i in range(n):\r\n\tmat[i]=list(input())\r\ndef fbb(mat):\r\n\tminx=100000\r\n\tminy=100000\r\n\tmaxx=-100000\r\n\tmaxy=-100000\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tif mat[i][j]=='*':\r\n\t\t\t\tminx=min(minx,i)\r\n\t\t\t\tminy=min(miny,j)\r\n\t\t\t\tmaxx=max(maxx,i)\r\n\t\t\t\tmaxy=max(maxy,j)\r\n\treturn minx,miny,maxx,maxy\r\nminmax=fbb(mat)\r\nminx,miny,maxx,maxy=minmax\r\nfor i in range(minx,maxx+1):\r\n\tfor j in range(miny,maxy+1):\r\n\t\tprint(mat[i][j],end='')\r\n\tprint()", "n, m = map(int, input().split())\r\ngrid = [list(input()) for _ in range(n)]\r\n\r\nleft = m\r\nright = 0\r\ntop = n\r\nbottom = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '*':\r\n left = min(left, j)\r\n right = max(right, j)\r\n top = min(top, i)\r\n bottom = max(bottom, i)\r\n\r\nfor i in range(top, bottom + 1):\r\n for j in range(left, right + 1):\r\n print(grid[i][j], end='')\r\n print()\r\n", "n, m = map(int, input().split())\r\na = [[str(j) for j in input()] for i in range(n)]\r\np = []\r\nl = []\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif a[i][j] == \"*\":\r\n\t\t\tp.append(i)\r\n\t\t\tbreak\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif a[i][j] == \"*\":\r\n\t\t\tl.append(j)\r\nma = 0\r\nmi = m\r\nfor i in range(len(l)):\r\n\tif l[i] > ma:\r\n\t\tma = l[i]\r\n\tif l[i] < mi:\r\n\t\tmi = l[i]\r\nq = p[0]\r\nw = p[-1]\r\nfor i in range(q, w+1):\r\n\tfor j in range(mi, ma+1):\r\n\t\tprint(a[i][j], end = '')\r\n\tprint()\r\n", "n,m=map(int,input().split())\r\nma=[input()[:m] for t in range(n)]\r\nr=[]\r\nc=[]\r\nfor t1 in range(n):\r\n for t2 in range(m):\r\n if ma[t1][t2]=='*':\r\n r.append(t1)\r\n c.append(t2)\r\nmir=min(r)\r\nmic=min(c)\r\nmar=max(r)\r\nmac=max(c)\r\nfor t1 in range(mir,mar+1):\r\n for t2 in range(mic,mac+1):\r\n print(ma[t1][t2],end='')\r\n print()\r\n", "\r\nn, m = map(int, input().split())\r\n\r\nb = []\r\nfor i in range(n):\r\n b.append(input())\r\n\r\nx = []\r\nfor c in zip(*b):\r\n for r in range(n):\r\n if c[r] == '*':\r\n x.append(r)\r\n\r\ny = []\r\nfor r in b:\r\n for c in range(m):\r\n if r[c] == '*':\r\n y.append(c)\r\n\r\nfor r in b[min(x) : max(x) + 1]:\r\n print(''.join(r[min(y) : max(y) + 1]))", "n, m = [int(i) for i in input().split()]\r\na, x, y = [], set(), set()\r\nfor i in range(n):\r\n line = input()\r\n a.append(line)\r\n if \"*\" in line:\r\n y.add(i)\r\n x.add(line.index(\"*\"))\r\n x.add(line.rindex(\"*\"))\r\nfor i in a[min(y): max(y) + 1]:\r\n print(i[min(x): max(x) + 1])\r\n", "n,m=[int(s) for s in input().split()]\r\na=[]\r\nup=-1\r\ndown=n\r\nleft=m\r\nright=-1\r\nfor i in range(n):\r\n s=input()\r\n a.append(s)\r\n if s.find('*')!=-1:\r\n if up==-1: up=i\r\n down=i\r\n p=s.find('*')\r\n if p<left:\r\n left=p\r\n p=s.rfind('*')\r\n if p>right:\r\n right=p\r\nfor i in range(up,down+1):\r\n print(a[i][left:right+1])", "'''input\n15 3\n...\n...\n...\n.**\n...\n...\n*..\n...\n.*.\n..*\n..*\n*..\n..*\n...\n...\n'''\nn, m = map(int, input().split())\na = [input() for _ in range(n)]\nf, l, t = 1000, 0, False\nfor x in range(n):\n\tif \"*\" in a[x]:\n\t\tf = min(f, a[x].index(\"*\"))\n\t\tl = max(l, m - 1 - a[x][::-1].index(\"*\"))\nfor y in range(n):\n\tif \"*\" in a[y]:\n\t\tbreak\nfor z in range(n-1, -1, -1):\n\tif \"*\" in a[z]:\n\t\tbreak\na = [i[f:l+1] for i in a]\nprint(\"\\n\".join(a[y:z+1]))\n\n\n\n\n\n\n\n\n\n\n\n\n", "n, m = map(int, input().split())\n\ndata = []\nll = lc = -1\nfl, fc = n +1, m+1\n\nfor i in range(n):\n line = input()\n data.append(line)\n for id, square in enumerate(line):\n if square == \"*\":\n if id < fc:\n fc = id\n if i < fl:\n fl = i\n if id > lc:\n lc = id\n if i > ll:\n ll = i\n\nfor i in range(fl,ll+1):\n print(*data[i][fc:lc+1], sep='')\n\n#print(fl, ll)\n#print(fc, lc)\n \n\t \t \t \t\t \t\t \t\t\t \t\t \t\t \t", "n, m = map(int, input().split())\r\ninput_dict_raw = {}\r\nfor line_no in range(n):\r\n input_dict_raw[line_no] = input()\r\n\r\ninput_dict = {}\r\n# first_value = 0\r\nfor i in range(n):\r\n if '*' in input_dict_raw[i]:\r\n input_dict[i] = input_dict_raw[i]\r\n first_value = i\r\n break\r\n\r\nlast_value = 0\r\nfor i in range(n-1,-1,-1):\r\n if '*' in input_dict_raw[i]:\r\n input_dict[i] = input_dict_raw[i]\r\n last_value = i\r\n break\r\n\r\nfor i in range(first_value+1, last_value):\r\n input_dict[i] = input_dict_raw[i]\r\n \r\nminmax_list = []\r\nfor value in input_dict.values(): # protek row\r\n for i in range(len(value)): # protek index of row\r\n if value[i] == '*':\r\n minmax_list.append(i)\r\n\r\n\r\nmin_val = min(minmax_list)\r\nmax_val = max(minmax_list)\r\n\r\n\r\nfor i in range(n):\r\n if first_value<=i<=last_value:\r\n print(input_dict[i][min_val:max_val+1])\r\n\r\n \r\n \r\n ", "h, w = map(int, input().split())\r\npyoko = [False] * w\r\nptate = [False] * h\r\nmaze = []\r\nfor i in range(h):\r\n s = input()\r\n maze.append(s)\r\n if s.count(\"*\") != 0:\r\n ptate[i] = True\r\n for j in range(w):\r\n if s[j] == \"*\":\r\n pyoko[j] = True\r\ns\r\nl, r = 0, w-1\r\nwhile pyoko[l] != True:\r\n l += 1\r\nwhile pyoko[r] != True:\r\n r -= 1\r\nt,b = 0, h-1\r\nwhile ptate[t] != True:\r\n t += 1\r\nwhile ptate[b] != True:\r\n b -= 1\r\n\r\nfor i in range(t, b+1):\r\n print(maze[i][l:r+1])", "n, m = list(map(int, input().split(' ')))\r\na = [input() for i in range(n)]\r\ni1, i2, j1, j2 = n - 1, 0, m - 1, 0\r\nfor i in range(n):\r\n if a[i].find('*') != -1:\r\n i1 = min(i1, i)\r\n i2 = max(i2, i)\r\n j1 = min(j1, a[i].find('*'))\r\n j2 = max(j2, a[i].rfind('*'))\r\nfor i in range(i1, i2 + 1):\r\n print(a[i][j1:j2 + 1])\r\n", "n,m = map(int, input().split())\r\ndata = []\r\n\r\nfor i in range(n):\r\n data.append(list(input()))\r\n\r\nboundary = [-1,-1,-1,-1]\r\nfor i in range(n):\r\n for j in range(m):\r\n if data[i][j] == '*':\r\n if boundary[0]>j or boundary[0]==-1:\r\n boundary[0] = j\r\n if boundary[1]<j or boundary[1]==-1:\r\n boundary[1] = j\r\n if boundary[2]>i or boundary[2]==-1:\r\n boundary[2] = i\r\n if boundary[3]<i or boundary[3]==-1:\r\n boundary[3] = i\r\n\r\nfor i in range(boundary[2], boundary[3]+1):\r\n for j in range(boundary[0], boundary[1]+1):\r\n print(data[i][j], end='')\r\n print()", "def main():\n n, m = map(int, input().split())\n l, xx, yy = [input() for _ in range(n)], [], []\n for y, row in enumerate(l):\n for x, c in enumerate(row):\n if c == '*':\n xx.append(x)\n yy.append(y)\n lo, hi = min(xx), max(xx) + 1\n for row in l[min(yy):max(yy) + 1]:\n print(row[lo:hi])\n\n\nif __name__ == '__main__':\n main()\n", "n,m = map(int,input().split())\r\narr = []\r\nfor _ in range(n):\r\n line = input()\r\n arr.append(line)\r\na = []\r\nb = []\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == \"*\":\r\n a.append(i)\r\n b.append(j)\r\n\r\nfor i in range(min(a),max(a)+1):\r\n for j in range(min(b),max(b)+1):\r\n print(arr[i][j],end = \"\")\r\n print()\r\n", "n,m=map(int,input().split()); e=[input()for p in[0]*n]; a=b=1e2;c=d=-1\r\nfor y in range(n):\r\n for x in range(m):\r\n if e[y][x]=='*': a=min(a,y);b=min(b,x);c=max(c,y);d=max(d,x)\r\nprint(*[x[b:d+1]for x in e[a:c+1]],sep='\\n')", "arr = []\r\nip1 = list(map(int, input().split()))\r\nfor i in range(ip1[0]):\r\n row = input()\r\n arr.append(row)\r\nmaxrow = maxcol = 0\r\nminrow = ip1[0]-1\r\nmincol = ip1[1]-1\r\nfor i in range(ip1[0]):\r\n for j in range(ip1[1]):\r\n if arr[i][j] == \"*\":\r\n if i < minrow:\r\n minrow = i\r\n if i > maxrow:\r\n maxrow = i\r\n if j < mincol:\r\n mincol = j\r\n if j > maxcol:\r\n maxcol = j\r\nlista = \"\"\r\nc1 = minrow\r\nwhile c1 <= maxrow:\r\n c2 = mincol\r\n row = \"\"\r\n while c2 <= maxcol:\r\n row = row + arr[c1][c2]\r\n c2 += 1\r\n lista = lista + row + \"\\n\"\r\n c1 += 1\r\nprint(lista)\r\n", "n, m = map(int, input().split())\r\npicture = [input() for _ in range(n)]\r\n\r\nbbox = [n - 1, m - 1, 0, 0]\r\nfor i in range(n):\r\n for j in range(m):\r\n if picture[i][j] == '*':\r\n bbox[0] = min(bbox[0], i)\r\n bbox[1] = min(bbox[1], j)\r\n bbox[2] = max(bbox[2], i)\r\n bbox[3] = max(bbox[3], j)\r\n\r\nfor i, line in enumerate(picture):\r\n if bbox[0] <= i <= bbox[2]:\r\n print(line[bbox[1]:bbox[3] + 1])\r\n", "def main():\r\n n, m = map(int, input().split())\r\n sheet = []\r\n for i in range(n):\r\n sheet.append(input())\r\n\r\n while '*' not in sheet[0]:\r\n sheet.pop(0)\r\n while '*' not in sheet[-1]:\r\n sheet.pop()\r\n while '*' not in [row[0] for row in sheet]:\r\n sheet = [row[1:] for row in sheet]\r\n while '*' not in [row[-1] for row in sheet]:\r\n sheet = [row[:-1] for row in sheet]\r\n\r\n for row in sheet:\r\n print(row)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m=map(int,input().split())\r\nt=\".\"*m\r\nlast,first=n+1,-1\r\nL,R=m,-1\r\na=[]\r\nfor i in range(n):\r\n s=input()\r\n a.append(s)\r\n if s!=t:\r\n last=i;\r\n if first==-1:\r\n first=i\r\n L1=s.find(\"*\")\r\n R1=s.rfind(\"*\")\r\n if L1>=0:\r\n if L>L1:L=L1\r\n if R1>=0:\r\n if R<R1:R=R1\r\n\r\nfor i in range(n):\r\n if i>=first and i<=last:\r\n print(a[i][L:R+1])\r\n \r\n \r\n \r\n", "n, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\nn1, m1 = 0, 0\r\nn2, m2 = n - 1, m - 1\r\nfl = False\r\nfor i in range(n):\r\n if a[i].count(\"*\") == 0 and not fl:\r\n n1 = i + 1\r\n elif a[i].count(\"*\") != 0:\r\n fl = True\r\n\r\nfl = False\r\nfor i in range(n - 1, -1, -1):\r\n if a[i].count(\"*\") == 0 and not fl:\r\n n2 = i - 1\r\n elif a[i].count(\"*\") != 0:\r\n fl = True\r\n\r\nfl = False\r\nfor j in range(m):\r\n tmp = [a[x][j] for x in range(n)]\r\n if tmp.count(\"*\") == 0 and not fl:\r\n m1 = j + 1\r\n elif tmp.count(\"*\") != 0:\r\n fl = True\r\n\r\nfl = False\r\nfor j in range(m - 1, -1, -1):\r\n tmp = [a[x][j] for x in range(n)]\r\n if tmp.count(\"*\") == 0 and not fl:\r\n m2 = j - 1\r\n elif tmp.count(\"*\") != 0:\r\n fl = True\r\n\r\nfor i in range(n1, n2 + 1):\r\n print(a[i][m1:m2 + 1])\r\n", "n,m=[int(x) for x in input().split(\" \")]\r\ngrid=[]\r\nfor i in range(n):\r\n grid.append(input())\r\nrow1,row2,col1,col2=-1,-1,-1,-1\r\nfor i in range(n):\r\n if '*' in grid[i]:\r\n row1=i\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if '*' in grid[i]:\r\n row2=i;\r\n break\r\nfor i in range(m):\r\n found=False\r\n for j in range(n):\r\n if grid[j][i]=='*':\r\n col1=i\r\n found=True\r\n break\r\n if found:\r\n break\r\nfor i in range(m-1,-1,-1):\r\n found=False\r\n for j in range(n):\r\n if grid[j][i]=='*':\r\n col2=i\r\n found=True\r\n break\r\n if found:\r\n break\r\nfor i in range(row1,row2+1,1):\r\n for j in range(col1,col2+1,1):\r\n print(grid[i][j],end='')\r\n print()\r\n", "#for _ in range(int(input())):\r\n # n=int(input())\r\nif 1:\r\n n,m=list(map(int,input().split()))\r\n ans=[]\r\n st=[]\r\n g=[]\r\n for i in range(n):\r\n s=input()\r\n st.append(s)\r\n if '*' in s:\r\n g.append(i) \r\n x=s.index('*')\r\n y=s.rindex('*')\r\n ans.append([x,y,i])\r\n mi=100000\r\n ma=-1\r\n for i in range(len(ans)):\r\n if mi>ans[i][0]:\r\n mi=ans[i][0]\r\n if ma<ans[i][1]:\r\n ma=ans[i][1]\r\n # print(mi,ma,ans)\r\n for i in range(min(g),max(g)+1):\r\n for j in range(mi,ma+1):\r\n print(st[i][j],end='')\r\n print()\r\n ", "n, m = tuple(map(int, input().split()))\r\n\r\npat = []\r\nindices = []\r\nfor i in range(n):\r\n pat.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if pat[i][j]==\"*\":\r\n indices.append((i, j))\r\nindices_x = [i[0] for i in indices]\r\nindices_y = [i[1] for i in indices]\r\n\r\nmin_row_index, max_row_index = min(indices_x), max(indices_x)\r\nmin_col_index, max_col_index = min(indices_y), max(indices_y)\r\nfor i in range(min_row_index, max_row_index+1):\r\n print(pat[i][min_col_index:max_col_index+1])\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\na = []\r\nleft=m\r\nright=m\r\nstar=-1\r\nfor i in range(n):\r\n row = input()\r\n if row == \".\"*m:\r\n if star==-1:\r\n continue\r\n else:\r\n star= len(a)\r\n j=0\r\n while j<m and row[j]==\".\":\r\n j += 1\r\n left = min(left,j)\r\n j=0\r\n while j<m and row[-j-1]==\".\":\r\n j+=1\r\n right = min(right,j)\r\n a.append(row)\r\nfor row in a[:star+1]:\r\n print(row[left:m-right])", "n,m=map(int,input().split())\r\ns=[]\r\nfor i in range(n):\r\n s.append(input())\r\nwhile s[0].count(\"*\")==0:\r\n s.pop(0)\r\nwhile s[-1].count(\"*\")==0:\r\n s.pop(-1)\r\n\r\nwhile not \"*\" in [i[0] for i in s]:\r\n for j in range(len(s)):\r\n s[j]=s[j][1:]\r\nwhile not \"*\" in [i[-1] for i in s]:\r\n for j in range(len(s)):\r\n s[j]=s[j][:-1]\r\nprint(\"\\n\".join(s))", "def solve():\r\n n, m = map(int, input().split())\r\n mat = [input() for _ in range(n)]\r\n y1 = -1\r\n y2 = -1\r\n x1 = m\r\n x2 = -1\r\n \r\n for i in range(n):\r\n if '*' in mat[i]:\r\n if y1 == -1:\r\n y1 = i\r\n \r\n y2 = max(y2, i)\r\n x1 = min(x1, mat[i].find('*'))\r\n x2 = max(x2, mat[i].rfind('*'))\r\n \r\n for i in range(y1, y2 + 1):\r\n print(mat[i][x1:x2 + 1])\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "num_rows, num_cols = map(int, input().split())\r\npaper = [list(input()) for _ in range(num_rows)]\r\n\r\nx_min, x_max, y_min, y_max = 49, 0, 49, 0\r\n\r\nfor i in range(num_rows):\r\n for j in range(num_cols):\r\n if paper[i][j] == '*':\r\n x_min, x_max, y_min, y_max = min(j, x_min), max(j, x_max), min(i, y_min), max(i, y_max)\r\n\r\nfor i in range(y_min, y_max + 1):\r\n print(''.join(paper[i][x_min:x_max + 1]))# 1698139669.4744081", "n, m = list(map(int, input().split()))\r\ngrid = []\r\n\r\niMin = n - 1\r\njMin = m - 1\r\niMax = 0\r\njMax = 0\r\n\r\nfor _ in range(n):\r\n grid.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == \"*\":\r\n if i < iMin:\r\n iMin = i\r\n if i > iMax:\r\n iMax = i\r\n if j < jMin:\r\n jMin = j\r\n if j > jMax:\r\n jMax = j\r\nfor i in range(iMin, iMax + 1):\r\n print(grid[i][jMin: jMax + 1])\r\n\r\n# Struggled a lot at the beginning because\r\n# I tried to check for the max and mins\r\n# row by row instead of element by element.\r\n# Should have gone with the simplest solution\r\n# instead of trying to make it clever.\r\n", "def main():\n n, m = map(int, input().split())\n l = [input() for _ in range(n)]\n for i, row in enumerate(l):\n if '*' in row:\n hi = i\n for i in range(hi, -1, -1):\n if '*' in l[i]:\n lo = i\n l = l[lo:hi + 1]\n lt = list(zip(*l))\n for i, row in enumerate(lt):\n if '*' in row:\n hi = i\n for i in range(hi, -1, -1):\n if '*' in lt[i]:\n lo = i\n hi += 1\n for row in l:\n print(row[lo:hi])\n\n\nif __name__ == '__main__':\n main()\n", "n, m = map(int, input().split())\ns = [None] * n\nfor i in range(n):\n s[i] = input()\nwhile True:\n if s[0].count('*') != 0:\n break\n s.pop(0)\nwhile True:\n if s[len(s)-1].count('*') != 0:\n break\n s.pop()\nx = m - 1\nd = m - 1\nn = len(s)\nfor i in range(n):\n if s[i].count('*') == 0:\n continue\n s[i] = s[i][::-1]\n c = s[i].index('*')\n if c < d:\n d = c\n s[i] = s[i][::-1]\n c = s[i].index('*')\n if c < x:\n x = c\nfor i in range(n):\n print(s[i][x:m-d])", "n, m = input().split()\nn = int(n)\nm = int(m)\n\nminI = n\nmaxI = -1\n\nminJ = m\nmaxJ = -1\n\nmatriz = []\nfor i in range(0, n):\n\tlinha = list(input())\n\tmatriz.append(linha)\n\tfor j in range(0, m):\n\t\tif (linha[j] == '*'):\n\t\t\tminI = min(minI, i)\n\t\t\tmaxI = max(maxI, i)\n\t\t\tminJ = min(minJ, j)\n\t\t\tmaxJ = max(maxJ, j)\n\nfor i in range(minI, maxI + 1):\n\tfor j in range(minJ, maxJ + 1):\n\t\tprint(matriz[i][j], end='')\n\tprint()", "n, m = map(int, input().split())\r\ndc = dict()\r\nfor r in range(n): \r\n row = list(input())\r\n for c, ch in enumerate(row):\r\n dc[(r,c)] = ch\r\n\r\nminr = min(k[0] for k,v in dc.items() if v == \"*\")\r\nmaxr = max(k[0] for k,v in dc.items() if v == \"*\")\r\nminc = min(k[1] for k,v in dc.items() if v == \"*\")\r\nmaxc = max(k[1] for k,v in dc.items() if v == \"*\")\r\n\r\nfor r in range(minr, maxr+1):\r\n line = ''.join(dc[(r,c)] for c in range(minc, maxc+1))\r\n print(line)", "n,m=map(int,input().split())\r\nmat=[]\r\n\r\nfor _ in range(n):\r\n s=input()\r\n a=list(s)\r\n mat.append(a)\r\nLeft=n-1\r\nRight=0\r\nTop=m-1\r\nBottom=0\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if(mat[i][j]=='*'):\r\n Left=min(Left,i)\r\n Right=max(Right,i)\r\n Top=min(Top,j)\r\n Bottom=max(Bottom,j)\r\nfor i in range(Left,Right+1):\r\n for j in range(Top,Bottom+1):\r\n print(mat[i][j],end=\"\")\r\n print(end=\"\\n\")\r\n \r\n\r\n", "n,m = map(int,input().split())\r\na = []\r\nfor _ in range(n):\r\n s = input()\r\n a.append(s)\r\nmxr = -1\r\nmnr = -1\r\nmxc = -1\r\nmnc = -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '*' and (mnr == -1 or j < mnr) :\r\n mnr = j\r\n if a[i][j] == '*' and (mnc == -1 or i < mnc) :\r\n mnc = i\r\n if a[i][j] == '*' and (mxr == -1 or j > mxr) :\r\n mxr = j\r\n if a[i][j] == '*' and (mxc == -1 or i > mxc) :\r\n mxc = i\r\nfor i in range(mnc,mxc+1):\r\n s = \"\"\r\n for j in range(mnr,mxr+1):\r\n s += a[i][j]\r\n print(s)\r\n", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ndata = [input().rstrip() for _ in range(n)]\r\n\r\nr_min = r_max = c_max = -1\r\nc_min = math.inf\r\n\r\nfor i in range(n):\r\n if '*' in data[i]:\r\n if r_min == -1:\r\n r_min = i\r\n r_max = i\r\n for j in range(m):\r\n if data[i][j] == '*':\r\n c_min = min(c_min, j)\r\n c_max = max(c_max, j)\r\n\r\nfor i in range(r_min, r_max + 1):\r\n for j in range(c_min, c_max + 1):\r\n print(data[i][j], end='')\r\n print()", "n,m = map(int,input().split())\nstartx = m-1\nstarty = n-1\nendx = 0\nendy = 0\nsheet = []\nfor i in range(n):\n sheet.append(input())\n\nfor i in range(n):\n for j in range(m):\n if sheet[i][j] =='*':\n if j < startx:\n startx = j\n if j > endx:\n endx = j\n if i < starty:\n starty = i\n if i > endy:\n endy = i\n\nfor i in range(starty,endy+1,1):\n for j in range(startx,endx+1,1):\n print(sheet[i][j],end=\"\")\n print()\n# print(startx,starty,endx,endy)", "import sys\r\ninpu = sys.stdin.buffer.readline\r\nn, m = map(int, input().split())\r\na = []\r\nfor _ in range(n):\r\n a.append(input())\r\n# print(a)\r\nstarct = []\r\nl = float('inf')\r\nr = float('-inf')\r\nfor seq in a:\r\n starct.append(seq.count('*'),)\r\n# print(starct)\r\nfor i in range(len(a)):\r\n if starct[i] != 0:\r\n l = min(l,list(a[i]).index('*'))\r\n r = max(r, a[i].rindex('*'))\r\n\r\nf = 0\r\nfor i in range(len(starct)):\r\n if starct[i] != 0:\r\n f = i\r\n break\r\ns = 0\r\nfor i in range(len(starct)-1,-1,-1):\r\n if starct[i] != 0:\r\n s = i\r\n break\r\n\r\nfor i in range(f, s+1):\r\n print(a[i][l:r+1])\r\n\r\n# for i in range(len(a)):\r\n# if starct[i]:\r\n# if '*' in a[i][l:r+1]:\r\n# print(a[i][l:r+1])", "def check(sheet, n, x):\r\n for i in range(n):\r\n if sheet[i][x] == '*':\r\n return False\r\n return True\r\n\r\nn, m = map(int, input().split())\r\nsheet = [list(input()) for _ in range(n)]\r\n\r\nwhile '*' not in sheet[0]:\r\n sheet.pop(0)\r\nwhile '*' not in sheet[-1]:\r\n sheet.pop()\r\n\r\nn = len(sheet)\r\nwhile check(sheet, n, 0):\r\n for i in range(n):\r\n sheet[i].pop(0)\r\nwhile check(sheet, n, -1):\r\n for i in range(n):\r\n sheet[i].pop()\r\n\r\nfor i in range(n):\r\n print(\"\".join(sheet[i]))", "n, l, nl = [int(i) for i in input().split()], [], []\r\nu = d = lf = r = 0\r\n\r\nfor i in range(n[0]): l.extend([i for i in input().split()])\r\n\r\nvl, dl = [\"\".join([l[j][i] for j in range(n[0])]) for i in range(n[1])], l.copy()\r\n\r\nfor i in l:\r\n if \"*\" in i:\r\n u = l.index(i)\r\n break\r\nl.reverse()\r\nfor i in l:\r\n if \"*\" in i: \r\n d = l.index(i)\r\n break\r\n\r\nfor i in vl:\r\n if \"*\" in i:\r\n lf = vl.index(i)\r\n break\r\nvl.reverse()\r\nfor i in vl:\r\n if \"*\" in i:\r\n r = vl.index(i)\r\n break\r\n\r\nd, r = n[0]-d-1, n[1]-r-1\r\n\r\nfor i in range(u, d+1): nl.append(dl[i][lf:r+1])\r\n\r\nprint(\"\\n\".join(nl))", "n, m = map(int, input().split())\n\nt = [input() for i in range(n)]\n\n\n\ni = 0\n\nwhile not '*' in t[i]: i += 1\n\nj = n - 1\n\nwhile not '*' in t[j]: j -= 1\n\n\n\nt = t[i: j + 1]\n\nu = min(k.find('*') for k in t if '*' in k)\n\nv = m - min(k[::-1].find('*') for k in t if '*' in k)\n\n\n\nprint('\\n'.join(k[u: v] for k in t))", "def letter():\r\n n, m = map(int, input().split())\r\n data = [input() for _ in range(n)]\r\n min_x, max_x, min_y, max_y = n, 0, m, 0\r\n \r\n for i in range(n):\r\n for j in range(m):\r\n if data[i][j] == \"*\":\r\n min_x = min(min_x, i)\r\n max_x = max(max_x, i)\r\n min_y = min(min_y, j)\r\n max_y = max(max_y, j)\r\n \r\n for i in range(min_x, max_x + 1):\r\n print(data[i][min_y:max_y + 1])\r\n \r\n \r\nletter()", "args = input().split()\r\nn, m = int(args[0]), int(args[1])\r\n\r\nx1, x2 = m, 0\r\ny1, y2 = n, 0\r\npaper = []\r\nfor i in range(n):\r\n row = input()\r\n if '*' in row:\r\n y1 = min(y1, i)\r\n y2 = max(y2, i)\r\n x1 = min(x1, row.find('*'))\r\n x2 = max(x2, row.rfind('*'))\r\n paper.append(row)\r\n\r\nfor h in range(y1, y2+1):\r\n print(paper[h][x1:x2+1])", "# https://codeforces.com/problemset/problem/14/A\r\n\r\nn,m = map(int, input().split())\r\ntop, bottom, left, right = n, -1, m, -1\r\ndata = []\r\nfor i in range(n):\r\n r = input()\r\n data.append(r)\r\n if '*' in r:\r\n top = min(top, i)\r\n bottom = max(bottom, i)\r\n left = min(left, r.find('*'))\r\n right = max(right, r.rfind('*'))\r\nfor i in range(top, bottom+1):\r\n print(data[i][left:right+1])", "# LUOGU_RID: 117904778\ndef find_minimal_matrix(N, M, matrix):\r\n minCol, maxCol, minRow, maxRow = float('inf'), -float('inf'), float('inf'), -float('inf')\r\n \r\n for i in range(N):\r\n for j in range(M):\r\n if matrix[i][j] == '*':\r\n minCol = min(minCol, j)\r\n maxCol = max(maxCol, j)\r\n minRow = min(minRow, i)\r\n maxRow = max(maxRow, i)\r\n\r\n minimal_matrix = [['.' for _ in range(maxCol - minCol + 1)] for _ in range(maxRow - minRow + 1)]\r\n \r\n for i in range(minRow, maxRow + 1):\r\n for j in range(minCol, maxCol + 1):\r\n if matrix[i][j] == '*':\r\n minimal_matrix[i - minRow][j - minCol] = '*'\r\n\r\n return minimal_matrix\r\n\r\n\r\n# 读取输入\r\nN, M = map(int, input().split())\r\nmatrix = [input() for _ in range(N)]\r\n\r\n# 输出结果\r\nminimal_matrix = find_minimal_matrix(N, M, matrix)\r\nfor row in minimal_matrix:\r\n print(''.join(row))", "tmp = input().split()\r\nn = int(tmp[0])\r\nm = int(tmp[1])\r\nar = []\r\nfor i in range(n): ar.append(input())\r\na = n\r\nb = m\r\nc = -1\r\nd = -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if (ar[i][j] == '*'):\r\n a = min(a,i)\r\n b = min(b,j)\r\n c = max(c,i)\r\n d = max(d,j)\r\n# print(a,b,c,d)\r\nfor i in range(a,c+1):\r\n print(ar[i][b:d+1])", "L = input().split()\r\nn, m = int(L[0]), int(L[1])\r\n\r\nmxX = 0\r\nmxY = 0\r\nmnX = n - 1\r\nmnY = m - 1\r\n\r\ns = []\r\n\r\nfor i in range(0, n):\r\n s.append(input())\r\n for j in range(0, m):\r\n if s[i][j] == '*':\r\n mnX = min(mnX, i)\r\n mxX = max(mxX, i)\r\n mnY = min(mnY, j)\r\n mxY = max(mxY, j)\r\n\r\nfor i in range(mnX, mxX + 1):\r\n for j in range(mnY, mxY + 1):\r\n print(s[i][j], end='')\r\n print()", "n, m = map(int, input().split())\r\nbb = [input() for _ in range(n)]\r\na, b, c, d = n, -1, m, -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if bb[i][j] == '*':\r\n a = min(a, i)\r\n b = max(b, i)\r\n c = min(c, j)\r\n d = max(d, j)\r\n# print(a, b, c, d)\r\nfor i in range(a, b+1):\r\n print(f\"{bb[i][c:d+1]}\")", "#! /usr/bin/env python3\n\nimport fractions\nimport sys\n\ndef main():\n solve()\n\n\ndef solve():\n data = sys.stdin.readlines()\n n, m, text = parse(data)\n output = calc_min_rect(n, m, text)\n for line in output:\n print(line)\n\n\ndef parse(data):\n n, m = tuple(int(s) for s in data[0].split())\n return n, m, tuple(s.rstrip() for s in data[1:])\n\n\ndef calc_min_rect(n, m, text):\n mintop, maxbot, minleft, maxright = n, -1, m, -1\n for i, line in enumerate(text):\n lpos = line.find('*')\n rpos = line.rfind('*')\n if lpos > -1:\n minleft = min(minleft, lpos)\n maxright = max(maxright, rpos)\n mintop = min(mintop, i)\n maxbot = max(maxbot, i)\n return (s[minleft:maxright + 1] for s in text[mintop:maxbot + 1])\n \n\nif __name__ == '__main__':\n main()\n", "x,y=input().split()\r\nx,y=int(x),int(y)\r\nm=[input() for i in range(x)]\r\nt=0\r\nwhile m[t]=='.'*y:t+=1\r\nb=x\r\nwhile m[b-1]=='.'*y:b-=1\r\nl=0\r\nwhile sum(i[l]=='*' for i in m)==0:l+=1\r\nr=y\r\nwhile sum(i[r-1]=='*' for i in m)==0:r-=1\r\nprint('\\n'.join(i[l:r] for i in m[t:b]))", "a,b=map(int,input().split())\nlistaUtil=[]\ncount=0\nwhile count != a:\n x=input()\n listaUtil.append(x)\n count+=1\n \nlistaA=[]\nlistaB=[]\n\nfor i in range(a):\n for j in range(b):\n if \"*\" == listaUtil[i][j]:\n listaA.append(j)\n\n if '*' in listaUtil[i]:\n listaB.append(i)\n \n\nx1,x2,y1,y2=min(listaA),max(listaA),min(listaB),max(listaB)\n\nfor i in range(a):\n if i <= y2 and i >= y1:\n for j in range(x1,x2+1):\n print(listaUtil[i][j],end=\"\")\n print()\n \n\n \t\t \t\t\t \t\t \t\t \t \t\t \t \t \t\t", "[n, m] = list(map(int, input().split()))\r\n\r\nnLines = n\r\nlines = []\r\n\r\nwhile nLines:\r\n line = list(input())\r\n lines.append(line)\r\n nLines -= 1\r\n\r\n\r\n\r\ntopEmpty = -1\r\nfor i in range(n):\r\n topEmpty += 1\r\n\r\n isEnd = False\r\n for char in lines[i]:\r\n if char == '*':\r\n isEnd = True\r\n break\r\n\r\n if isEnd:\r\n break\r\n\r\n\r\n\r\nbottomEmpty = -1\r\nfor i in range(n):\r\n bottomEmpty += 1\r\n\r\n isEnd = False\r\n for char in lines[n - 1 - i]:\r\n if char == '*':\r\n isEnd = True\r\n break\r\n\r\n if isEnd:\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nleftEmpty = -1\r\nfor i in range(m):\r\n leftEmpty += 1\r\n\r\n isEnd = False\r\n for y in range(n):\r\n char = lines[y][i]\r\n if char == '*':\r\n isEnd = True\r\n break\r\n\r\n if isEnd:\r\n break\r\n\r\n\r\nrightEmpty = -1\r\nfor i in range(m):\r\n rightEmpty += 1\r\n\r\n isEnd = False\r\n for y in range(n):\r\n char = lines[y][m - 1 - i]\r\n if char == '*':\r\n isEnd = True\r\n break\r\n\r\n if isEnd:\r\n break\r\n\r\n\r\n\r\n\r\n\r\nfor i in range(topEmpty, n - bottomEmpty):\r\n for j in range(leftEmpty, m - rightEmpty):\r\n print(lines[i][j], end='')\r\n\r\n print()", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\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, m = II()\r\ng = [S() for i in r(n)]\r\ndef f1():\r\n for i in r(n):\r\n for j in r(m):\r\n if g[i][j] == '*':\r\n return i\r\ndef f2():\r\n for i in r(m):\r\n for j in r(n):\r\n if g[j][i] == '*':\r\n return i\r\ndef f3():\r\n for i in reversed(r(n)):\r\n for j in r(m):\r\n if g[i][j] == '*':\r\n return i\r\ndef f4():\r\n for i in reversed(r(m)):\r\n for j in r(n):\r\n if g[j][i] == '*':\r\n return i\r\nx1 = f1()\r\ny1 = f2()\r\nx2 = f3()\r\ny2 = f4()\r\nres = [[] for i in r(x2-x1+1)]\r\nfor i in r(x1,x2+1):\r\n for j in r(y1,y2+1):\r\n res[i-x1].append(g[i][j])\r\nfor x in res:\r\n p(''.join(x))", "a, b = map(int, input().split())\r\nx1 = -1\r\nx2 = -1\r\ny1 = 100\r\ny2 = 0\r\ne = []\r\nfor i in range(a):\r\n d = input()\r\n e.append(d)\r\n if '*' in d:\r\n if x1 == -1:\r\n x1 = i\r\n x2 = i\r\n g = d.index('*')\r\n h = d[::-1]\r\n k = b - h.index('*')\r\n if g < y1:\r\n y1 = g\r\n if k > y2:\r\n y2 = k\r\nfor i in range(x1, x2 + 1):\r\n print(e[i][y1:y2])", "n,m = [int(x) for x in input().split()]\r\n\r\nL = []\r\nfor i in range(0,n):\r\n L.append(input())\r\n \r\nhmin = n\r\nhmax = -1\r\nwmin = m\r\nwmax = -1\r\n\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if L[i][j] == '*':\r\n if j < wmin:\r\n wmin = j\r\n if j > wmax:\r\n wmax = j\r\n if i > hmax:\r\n hmax = i\r\n if i < hmin:\r\n hmin = i\r\n\r\nfor i in range(hmin,hmax+1):\r\n for j in range(wmin,wmax):\r\n print(L[i][j],end = '' )\r\n print(L[i][wmax])\r\n\r\n", "n, m = map(int, input(). split())\r\nmn, mx, ans = 1e9, 0, [ ]\r\nwhile n:\r\n s = input()\r\n ans += [s]\r\n q, w = 0, 0\r\n for i in range(len(s)):\r\n if s[i] == '*':\r\n q = i\r\n break\r\n for j in range(len(s)):\r\n if s[j] == '*':\r\n w = (j + 1)\r\n if '*' in s:\r\n mn = min(mn, q)\r\n mx = max(mx, w)\r\n n -= 1\r\nt = 0\r\nfor l in range(len(ans)):\r\n if '*' in ans[l]:\r\n t = (l + 1)\r\ny = 0\r\no = 0\r\nfor k in ans:\r\n y += 1\r\n if '*' not in k and o == 0:\r\n pass\r\n else:\r\n o = 1\r\n if t >= y:\r\n print(k[mn : mx])\r\n else:\r\n break\r\n", "n, m = map(int, input().split())\r\ns = [input() for i in range(n)]\r\nl = [i for i in range(n) if \"*\" in s[i]]\r\nmini = [i.index(\"*\") for i in s if \"*\" in i]\r\nmaxi = [i.rindex(\"*\") for i in s if \"*\" in i]\r\nfor i in range(min(l), max(l)+1):\r\n print(str(s[i][min(mini): max(maxi) + 1]))\r\n", "n, m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n\tl.append(input())\r\na = 0\r\nb = 51\r\nt = 1\r\nfor x in range(n):\r\n\tif l[x].count(\"*\") > 0:\r\n\t\tz = l[x].index(\"*\")\r\n\t\tif t == 1:\r\n\t\t\tmini = z\r\n\t\tif l[x].index(\"*\") <= mini:\r\n\t\t\tmini = l[x].index(\"*\")\r\n\t\ta = max(a,x)\r\n\t\tb = min(b,x)\r\n\t\tt = 0\r\nr = 1\r\nfor x in range(n):\r\n\tfor y in range(m-1,-1,-1):\r\n\t\tif l[x][y] == \"*\":\r\n\t\t\tif r == 1:\r\n\t\t\t\tmaxi = y\r\n\t\t\tv = y\r\n\t\t\tmaxi = max(v,maxi)\r\n\t\t\tif x == b:\r\n\t\t\t\tr = 0\r\n\t\t\tbreak\r\nfor i in range(b,a+1):\r\n\tprint(l[i][mini:maxi+1])\r\n", "i,j=map(int,input().split())\nmatrix = []\nfor k in range(i):\n matrix.append(list(input()))\nleft_limit=[]\ntop_limit = []\nbottom_limit = []\nright_limit=[]\n\nfor m in matrix:\n for n in m:\n if n == '*':\n left_limit.append(m.index(n))\n top_limit.append(matrix.index(m))\n break\n\nmatrix.reverse()\n\nfor each in matrix:\n each.reverse()\n\nfor m in matrix:\n for n in m:\n if n == '*':\n right_limit.append(m.index(n))\n bottom_limit.append(matrix.index(m))\n break\n\nmatrix.reverse()\n\nfor each in matrix:\n each.reverse()\n\nr=j-min(right_limit)\nl=min(left_limit)\nt=min(top_limit)\nb=i-min(bottom_limit)\n\n\nfor u in range(t,b):\n print(*matrix[u][l:r],sep='')", "n,m = map(int,input().split())\r\na = []\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n b = list(input())\r\n if \"*\" in b: \r\n x.append(i)\r\n j = 0\r\n while b[j] == \".\" and j < m: j += 1\r\n y.append(j)\r\n j = m-1\r\n while b[j] == \".\" and j >= 0: j -= 1\r\n y.append(j)\r\n a.append(b)\r\nfor i in range(min(x),max(x)+1):\r\n for j in range(min(y),max(y)+1): print(a[i][j],end = \"\")\r\n print()", "n, m = map(int, input().split())\r\n\r\n# read the grid\r\ngrid = [input() for _ in range(n)]\r\n\r\n# find the indices of the first and last rows/columns containing shaded squares\r\nfirst_row = n\r\nlast_row = -1\r\nfirst_col = m\r\nlast_col = -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == \"*\":\r\n first_row = min(first_row, i)\r\n last_row = max(last_row, i)\r\n first_col = min(first_col, j)\r\n last_col = max(last_col, j)\r\n\r\n# output the coordinates of the minimum bounding rectangle\r\n# print(first_row, first_col, last_row, last_col)\r\n# print()\r\n\r\n# print(grid)\r\n\r\nfor idx_row in range(first_row, last_row + 1):\r\n for idx_col in range(first_col, last_col + 1):\r\n print(grid[idx_row][idx_col], end=\"\")\r\n print()\r\n", "n, m = map(int, input().split())\ngrid = [input() for i in range(n)]\n\nminr, maxr, minc, maxc = n, -1, m, -1\n\nfor i in range(n):\n for j in range(m):\n if grid[i][j] == '*':\n minr = min(minr, i)\n maxr = max(maxr, i)\n minc = min(minc, j)\n maxc = max(maxc, j)\n\nfor i in range(minr, maxr+1):\n print(grid[i][minc:maxc+1])\n", "\r\nn, m = map(int, input().split())\r\n\r\nmatrix = [list(input()) for _ in range(n)]\r\n\r\n\r\ntop = bottom = left = right = None\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if matrix[i][j] == '*':\r\n if top is None:\r\n top = i\r\n bottom = i\r\n if left is None or j < left:\r\n left = j\r\n if right is None or j > right:\r\n right = j\r\n\r\n\r\nfor i in range(top, bottom + 1):\r\n print(''.join(matrix[i][left:right + 1]))", "'''\nThis is a base snippet for cp\n'''\n\n\ndef main():\n #code Here\n n,m = map(int,input().split())\n arr = []\n for i in range(n):\n t = list(input())\n l = []\n for j in t:\n if j=='.':\n l.append(0)\n else:\n l.append(1)\n arr.append(l)\n a,b,c,d = 0,m-1,n-1,0\n f1,f2=False,False\n for i in range(n):\n for j in range(m):\n if arr[i][j] == 1:\n if a==0 and f1==False:\n a=i\n f1=True\n if j<b:\n b=j\n for i in range(n-1,-1,-1):\n for j in range(m-1,-1,-1):\n if arr[i][j] == 1:\n if c==n-1 and f2==False:\n c = i\n f2=True\n if j>d:\n d=j\n for i in range(a,c+1):\n for j in range(b,d+1):\n print('*' if arr[i][j]==1 else '.',end=\"\")\n print()\n # print(arr[n-1][4])\nif __name__ == '__main__':\n for i in range(1):\n main()\n", "n,m=map(int,input().split());\r\nsheet=[];\r\nfor i in range(n):\r\n sheet.append(input());\r\n\r\nmini=n-1;\r\nmaxi=0;\r\nminj=m-1;\r\nmaxj=0;\r\nfor i in range(n):\r\n for j in range(m):\r\n if sheet[i][j]=='*':\r\n if i<mini: mini=i;\r\n if i>maxi: maxi=i;\r\n if j<minj: minj=j;\r\n if j>maxj: maxj=j;\r\n\r\nfor i in range(mini,maxi+1):\r\n print(sheet[i][minj:maxj+1]);\r\n", "n, m =map(int, input().split())\r\na=[]\r\np=[]\r\nx=[]\r\ny=[]\r\n \r\nfor i in range(n):\r\n\ts=input()\r\n\tfor j in range(m):\r\n\t\tif s[j]=='*':\r\n\t\t\tx+=[j]\r\n\t\t\ty+=[i]\r\n\tp+=[s]\r\n \r\ns=\"\" \r\nx0=min(x)\r\nx1=max(x)\r\ny0=min(y)\r\ny1=max(y)\r\n \r\nfor i in range(y0,y1+1):\r\n\tfor j in range(x0, x1+1):\r\n\t\ts+=p[i][j]\r\n\ts+='\\n'\r\nprint(s)", "n,m=map(int,input().split())\r\nl=[]\r\nl_row=[]\r\nl_col=[]\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j]==\"*\":\r\n l_row.append(i)\r\n l_col.append(j)\r\nfor i in range(min(l_row),max(l_row)+1):\r\n print(l[i][min(l_col):max(l_col)+1])\r\n \r\n \r\n\r\n", "__author__ = 'aste'\r\n\r\n\r\ndef main():\r\n n, m = [int(x) for x in input().split()]\r\n\r\n rect = []\r\n for i in range(0, n):\r\n row = input()\r\n rect.append(row)\r\n\r\n min_r = n + 1\r\n max_r = 0\r\n min_c = m + 1\r\n max_c = 0\r\n for i in range(0, n):\r\n for j in range(0, m):\r\n if rect[i][j] == '*':\r\n min_r = min(min_r, i)\r\n max_r = max(max_r, i)\r\n min_c = min(min_c, j)\r\n max_c = max(max_c, j)\r\n\r\n res = []\r\n for i in range(min_r, max_r + 1):\r\n res.append(rect[i][min_c:max_c + 1])\r\n\r\n print(\"\\n\".join(res))\r\n\r\nmain()\r\n", "l = []\r\nn,m = map(int,input().split())\r\nfor i in range(n):\r\n l.append(input())\r\n\r\nwhile True:\r\n allstar = True\r\n rows = len(l)\r\n columns = len(l[0])\r\n\r\n \r\n if l[0] == '.' * columns:\r\n l.pop(0)\r\n allstar = False\r\n \r\n rows = len(l);columns = len(l[0])\r\n if l[len(l)-1] == '.' * columns:\r\n l.pop(len(l)-1)\r\n allstar = False\r\n\r\n rows = len(l);columns = len(l[0])\r\n col_left = ''\r\n col_right = ''\r\n for i in l:\r\n col_left += i[0]\r\n col_right += i[columns-1]\r\n if col_left == '.'*rows:\r\n for i in range(len(l)):\r\n x = l[i]\r\n l[i] = x[1:]\r\n allstar = False\r\n\r\n \r\n rows = len(l);columns = len(l[0])\r\n if col_right == '.' * rows:\r\n for i in range(len(l)):\r\n y = l[i]\r\n l[i] = y[:columns-1]\r\n allstar = False\r\n\r\n \r\n if allstar == True:\r\n break\r\n\r\n\r\nfor i in l:\r\n print(i)\r\n", "xy = input().split(\" \")\r\nsheet = []\r\nfor i in range(int(xy[0])):\r\n sheet.append(input())\r\nsheet2 = []\r\nrectx = []\r\nrecty = []\r\n\r\nfor i in range(int(xy[0])):\r\n if '*' in sheet[i]:\r\n rectx.append(i)\r\n\r\nfor j in range(int(xy[1])):\r\n list = ''\r\n for i in sheet:\r\n list += i[j]\r\n sheet2.append(list)\r\n\r\nfor i in range(int(xy[1])):\r\n if '*' in sheet2[i]:\r\n recty.append(i)\r\n\r\nfor i in range(rectx[0], rectx[-1]+1):\r\n print(sheet[i][recty[0]:recty[-1]+1])\r\n", "x, y = map(int, input().split())\r\nq = [input() for i in range(x)]\r\nt = 0\r\nwhile q[t] == '.' * y:\r\n t += 1\r\nb = x\r\nwhile q[b-1] == '.' * y:\r\n b -= 1\r\nl = 0\r\nwhile sum(i[l] == '*' for i in q) == 0:\r\n l += 1\r\nr = y\r\nwhile sum(i[r-1] == '*' for i in q) == 0:\r\n r -= 1\r\nprint('\\n'.join(i[l:r] for i in q[t:b]))\r\n", "rows, cols = map(int, input().split())\r\nli = list([])\r\n\r\nfor z in range(rows):\r\n li.append(list(input().split())[0])\r\n\r\ntop_row_found = False\r\nfor i in range(rows):\r\n if '*' in li[i]:\r\n top_row_found = True\r\n break\r\n\r\nbottom_row_found = False\r\nfor j in reversed(range(rows)):\r\n if '*' in li[j]:\r\n bottom_row_found = True\r\n break\r\n\r\nleft_col_found = False\r\nfor k in range(cols):\r\n if left_col_found:\r\n break\r\n for l in range(rows):\r\n if '*' == li[l][k] and not left_col_found:\r\n left_col_found = True\r\n\r\nright_col_found = False\r\nright_col = -1\r\nfor m in reversed(range(cols)):\r\n if right_col_found:\r\n break\r\n for n in range(rows):\r\n if '*' == li[n][m] and not right_col_found:\r\n right_col = m\r\n right_col_found = True\r\n\r\nfor x in range(i, j+1):\r\n print(li[x][k-1: right_col+1])\r\n\r\n\r\n# for z in range(int(input())):\r\n# excel_input = list(input().split())\r\n# excel_input = excel_input[0]\r\n# if excel_input[0] == 'R' and excel_input[1].isdigit():\r\n# # R__C__\r\n# idx = 1\r\n# while excel_input[idx].isdigit():\r\n# idx += 1\r\n# row_num = idx\r\n# col_num = int(excel_input[idx+1:])\r\n# col_num = 731\r\n# # while col_num >= 26:\r\n# # print(col_num//26)\r\n# # print(col_num%26)\r\n# # col_num = col_num - 26*col_num//26\r\n# print(col_num%26)\r\n# print(excel_input[1:row_num])\r\n# else:\r\n# # Alphabets Digits\r\n# idx = 0\r\n# column_num = 0\r\n# while excel_input[idx].isalpha():\r\n# column_num = ord(excel_input[idx])-64 + column_num\r\n# column_num *= 26\r\n# idx += 1\r\n# print('R' + excel_input[idx:] + 'C' + str(int(column_num/26)))\r\n", "rows, columns = map(int, input().split())\r\nb = [input() for i in range(rows)]\r\n\r\nx = [r for c in zip(*b) for r in range(rows) if c[r] == '*']\r\ny = [c for r in b for c in range(columns) if r[c] == '*']\r\n\r\nresult = '\\n'.join(r[min(y) : max(y) + 1] for r in b[min(x) : max(x) + 1])\r\nprint(result)", "# -*- coding: utf-8 -*-\r\n\r\nn,m = map(int,input().split())\r\na = [input() for i in range(n)]\r\nrows = []\r\ncols = []\r\n\r\nfor i in range(n):\r\n if '*' in a[i]:\r\n rows.append(i)\r\n for j in range(m):\r\n if a[i][j] == '*': cols.append(j)\r\n\r\na = a[min(rows):max(rows)+1]\r\n\r\nfor k in a:\r\n print(k[min(cols):max(cols)+1])\r\n\r\n", "n,m=map(int,input().split())\r\na=[]\r\nb=[]\r\nl=[]\r\nc=0\r\nfor i in range(n):\r\n x=input()\r\n l.append(x)\r\n for i in range(len(x)):\r\n if x[i]=='*':\r\n a.append(c)\r\n b.append(i)\r\n c=c+1\r\nfor i in range(min(a),max(a)+1):\r\n for j in range(min(b),max(b)+1):\r\n print(l[i][j],end='')\r\n print()", "def take2DInput() :\r\n nRows,mCols =map(int,input().split())\r\n \r\n if nRows == 0 :\r\n return list(), 0, 0\r\n \r\n mat = [list(map(str, input().strip())) for row in range(nRows)]\r\n return mat, nRows, mCols\r\n\r\nmat, nRows, mCols = take2DInput()\r\n\r\nminr,maxr,minc,maxc=nRows,0,mCols,0\r\n\r\nfor i in range(nRows):\r\n for j in range(mCols):\r\n if mat[i][j]==\"*\":\r\n if minr>i:\r\n minr=i\r\n if minc>j:\r\n minc=j\r\n if maxr<i:\r\n maxr=i\r\n if maxc<j:\r\n maxc=j\r\n\r\nfor i in range(minr,maxr+1):\r\n for j in range(minc,maxc+1):\r\n print(mat[i][j],end=\"\")\r\n print()", "n, m =map(int, input().split())\r\n\r\na=[];p=[]\r\nx=[];y=[]\r\n\r\nfor i in range(n):\r\n\ts=input()\r\n\tfor j in range(m):\r\n\t\tif s[j]=='*':\r\n\t\t\tx+=[j];y+=[i]\r\n\tp+=[s]\r\n\r\ns=\"\" #Using 's' instead of print() actually save time and prints perfectly\r\nx0=min(x);x1=max(x)\r\ny0=min(y);y1=max(y)\r\n\r\nfor i in range(y0,y1+1):\r\n\tfor j in range(x0, x1+1):\r\n\t\ts+=p[i][j]\r\n\ts+='\\n'\r\nprint(s)\t", "n,m=map(int,input().split())\r\nL=[input() for x in range(n)]\r\n\r\np=10000000000\r\np1=-1\r\npp=100000000\r\npp1=-1\r\nfor i in range(n) :\r\n if L[i].count(\"*\")>0 :\r\n p=min(p,i)\r\n p1=max(p1,i)\r\n pp=min(L[i].index(\"*\"),pp)\r\n pp1=max(L[i].rindex(\"*\"),pp1)\r\n\r\nfor i in range(p,p1+1) :\r\n print(L[i][pp:pp1+1])\r\n \r\n ", "n, m = map(int, input().split())\r\nA = [input() for _ in range(n)]\r\nmin_x, max_x = n, 0\r\nmin_y, max_y = m, 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j] == '*':\r\n min_x, max_x = min(min_x, i), max(max_x, i)\r\n min_y, max_y = min(min_y, j), max(max_y, j)\r\n\r\nfor x in range(min_x, max_x+1):\r\n print(A[x][min_y:max_y+1])", "a,b=map(int,input().split())\r\nl=[]\r\ns,e=-1,0\r\nmx,mn=[],[]\r\nfor x in range(a):\r\n\tl.append(input())\r\nfor x in range(a):\r\n\tif \"*\" in l[x]:\r\n\t\tif s==-1:\r\n\t\t\ts=x\r\n\t\te=x\r\n\t\tmn.append(l[x].index(\"*\"))\r\n\t\tmx.append(l[x].rindex(\"*\"))\r\nfor x in range(s,e+1):\r\n\tprint(l[x][min(mn):max(mx)+1])", "n, m = map(int,input().split())\r\ntable = [input() for i in range(n)]\r\nv1,h1,v2,h2 = 51,51,0,0\r\nfor i in range(n):\r\n for j in range(m):\r\n if table[i][j] == \"*\":\r\n v1 = min(v1,j)\r\n v2 = max(v2,j)\r\n h1 = min(h1,i)\r\n h2 = max(h2,i)\r\nfor i in range(h1,h2+1):\r\n for j in range(v1,v2+1):\r\n print(table[i][j],end=\"\")\r\n print()\r\n", "n, m = map(int, input().split())\r\n\r\nb = [input() for i in range(n)]\r\n\r\nx = []\r\nfor c in zip(*b):\r\n for r in range(n):\r\n if c[r] == '*':\r\n x.append(r)\r\n\r\ny = []\r\nfor r in b:\r\n for c in range(m):\r\n if r[c] == '*':\r\n y.append(c)\r\n\r\nprint('\\n'.join(r[min(y) : max(y) + 1] for r in b[min(x) : max(x) + 1]))", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nletter = []\r\nletter2 = {\"n-min\": n+1, \"m-min\": m+1,\r\n \"n-max\": 0, \"m-max\": 0, }\r\n\r\nfor x in range(0, n):\r\n letter.append(input())\r\n\r\nfor x in range(0, n):\r\n for y in range(0, m):\r\n if letter[x][y] == '*':\r\n if x<letter2[\"n-min\"] :\r\n letter2[\"n-min\"] = x\r\n if y<letter2[\"m-min\"] :\r\n letter2[\"m-min\"] = y\r\n if x>letter2[\"n-max\"] :\r\n letter2[\"n-max\"] = x\r\n if y>letter2[\"m-max\"] :\r\n letter2[\"m-max\"] = y\r\n\r\nfor x in range(letter2[\"n-min\"], letter2[\"n-max\"]+1):\r\n for y in range(letter2[\"m-min\"], letter2[\"m-max\"]+1):\r\n print(letter[x][y], end =\"\")\r\n print()\r\n ", "n, m = map(int, input().split())\r\nmax_x, max_y = 0, 0\r\nmin_x, min_y = n, m\r\npicture = []\r\n\r\nfor i in range(n):\r\n\tline = input()\r\n\tpicture.append(line)\r\n\tfor j in range(m):\r\n\t\tif line[j] == \"*\":\r\n\t\t\tmin_x, min_y = min(i, min_x), min(j, min_y)\r\n\t\t\tmax_x, max_y = max(i, max_x), max(j, max_y)\r\n\r\nfor i in range(min_x, max_x+1):\r\n\tprint(picture[i][min_y:max_y+1])\r\n", "def find_rectangle(n, m, sheet):\r\n top = left = float('inf')\r\n bottom = right = -1\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if sheet[i][j] == '*':\r\n top = min(top, i)\r\n left = min(left, j)\r\n bottom = max(bottom, i)\r\n right = max(right, j)\r\n\r\n\r\n rectangle = []\r\n for i in range(top, bottom + 1):\r\n rectangle.append(sheet[i][left:right + 1])\r\n\r\n return rectangle\r\n\r\nn, m = map(int, input().split())\r\nsheet = [input() for _ in range(n)]\r\n\r\n\r\nrectangle = find_rectangle(n, m, sheet)\r\nfor row in rectangle:\r\n print(row)\r\n", "import math\r\ntemp = input().split()\r\nr,c = int(temp[0]),int(temp[1])\r\nm = 0\r\ntogether = []\r\nright = 0\r\nsile = []\r\nl = 0\r\nflag = 0\r\nfor i in range(r):\r\n temp = input()\r\n s = temp.count(\"*\")\r\n if flag == 0 and s>0:\r\n flag = 1\r\n l = i\r\n sile.append([temp,s])\r\nright = len(sile)-1\r\nwhile right>=0:\r\n if sile[right][1]!=0:\r\n break\r\n right-=1\r\nlow,high = math.inf,0\r\nfor i in range(l,right+1):\r\n for j in range(len(sile[i][0])):\r\n if sile[i][0][j] == \"*\":\r\n low = min(j,low)\r\n high = max(high,j)\r\nfor i in range(l,right+1):\r\n print(sile[i][0][low:high+1])\r\n\r\n \r\n", "r, c = [int(s) for s in input().split(' ')]\r\nrows = []\r\nfor row in range(r):\r\n rows.append(input())\r\nwhile rows[0] == '.' * c:\r\n del rows[0]\r\nwhile rows[-1] == '.' * c:\r\n del rows[-1]\r\ni = 0\r\nwhile '*' not in [row[i] for row in rows]:\r\n i += 1\r\nj = c - 1\r\nwhile '*' not in [row[j] for row in rows]:\r\n j -= 1\r\nfor row in rows:\r\n print(row[i:j+1])\r\n", "n, m = map(int, input().split())\r\nsheet = []\r\nfor _ in range(n):\r\n row = list(input())\r\n sheet.append(row)\r\nmin_row = n\r\nmax_row = 0\r\nmin_column = m\r\nmax_column = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if sheet[i][j] == '*':\r\n min_row = min(min_row, i)\r\n max_row = max(max_row, i)\r\n min_column = min(min_column, j)\r\n max_column = max(max_column, j)\r\nfor i in range(min_row, max_row + 1):\r\n for j in range(min_column, max_column + 1):\r\n print(sheet[i][j], end='')\r\n print()", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\na = []\r\nb = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j] == \"*\":\r\n a.append(i)\r\n b.append(j)\r\nfor i in range(min(a),max(a)+1):\r\n for j in range(min(b),max(b)+1):\r\n print(l[i][j],end = \"\")\r\n print()\r\n", "n,m = map(int, input().split())\r\ni = []\r\nj = []\r\na = [input() for i in range(n)]\r\nfor x in range(n):\r\n for y in range(m):\r\n if a[x][y]=='*':\r\n i += [x]\r\n j += [y]\r\nfor x in a[min(i):max(i)+1]:\r\n print(x[min(j):max(j)+1])", "n, m = map(int, input().split())\nsheet = []\nfor i in range(n):\n row = list(input())\n if not (sheet == [] and row == m * [\".\"]):\n sheet.append(row)\n\nfor i in sheet[::-1]:\n if i == m * [\".\"]:\n sheet.pop()\n else:\n break\n\nwhile True:\n empty = True\n for i in sheet:\n if i[0] != \".\":\n empty = False\n if empty:\n for i in range(len(sheet)):\n sheet[i] = sheet[i][1:]\n else:\n break\n\nwhile True:\n empty = True\n for i in sheet:\n if i[-1] != \".\":\n empty = False\n if empty:\n for i in range(len(sheet)):\n sheet[i] = sheet[i][:len(sheet[i])-1]\n else:\n break\n\nfor i in range(len(sheet)):\n print(''.join(sheet[i]))\n\n", "# A. Letter\n\nn, m = map(int, input().split())\n\nleft, right = 51, 0\ntop, bottom = 51, 0\n\na = list()\n\nfor i in range(n):\n s = input()\n a.append(s)\n\n tmp = s.find('*')\n if tmp != -1:\n left = min(left, tmp)\n right = max(right, s.rfind('*'))\n\n top = min(top, i)\n bottom = max(bottom, i)\n\nfor i in range(n):\n if top <= i <= bottom:\n print(a[i][left:right + 1])\n", "n,m=[int(x) for x in input().split()]\n\ndef transpose(mtx):\n x = [list(\".\")*len(mtx) for i in range(len(mtx[0]))]\n for i in range(len(mtx)):\n for j in range(len(mtx[0])):\n x[j][i] = mtx[i][j]\n return x\ndef pro(v):\n ast=0\n while(v[ast]==list(\".\"*len(v[0]))):\n ast+=1\n ast2=len(v)-1\n while(v[ast2]==list(\".\"*len(v[0]))):\n ast2-=1\n return v[ast:ast2+1]\nv = []\nfor i in range(n):\n v.append(list(input()))\nv2=pro(v)\nv2=transpose(v2)\nv2=pro(v2)\nv2=transpose(v2)\nfor i in range(len(v2)):\n for j in range(len(v2[0])):\n print(v2[i][j],end=\"\")\n print()\n\n\n", "\r\nn, m = [int(item) for item in input().split(' ')]\r\ntop, bottom, left, right = -1, 0, m, 0\r\ncont = []\r\nfor i in range(n):\r\n line = input()\r\n if '*' in line:\r\n if top == -1:\r\n top = i\r\n fInd = line.index('*')\r\n if left > fInd:\r\n left = fInd\r\n rInd = line.rindex('*')\r\n if right < rInd:\r\n right = rInd\r\n bottom = i\r\n cont.append(line)\r\n\r\nfor i in range(top,bottom+1,1):\r\n print(cont[i][left:right+1])\r\n", "n, m = map(int, input().split())\r\nboard = []\r\nu, l, d, r = n, m, 0, 0\r\nfor i in range(n):\r\n board.append(input())\r\n for j in range(m):\r\n if board[i][j] == '*':\r\n if d < i:\r\n d = i\r\n if u > i:\r\n u = i\r\n if l > j:\r\n l = j\r\n if r < j:\r\n r = j\r\nfor i in range(u, d + 1):\r\n print(board[i][l:r + 1])\r\n", "n,m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n l.append(input())\r\ni1 = n\r\ni2 = 0\r\nj1 = m\r\nj2 = 0 \r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j] == '*':\r\n i1 = min(i1,i)\r\n j1 = min(j1,j)\r\nfor i in range(n-1,-1,-1):\r\n for j in range(m-1,-1,-1):\r\n if l[i][j] == '*':\r\n i2 = max(i2,i)\r\n j2 = max(j2,j) \r\nfor i in range(i1,i2+1):\r\n outs = ''\r\n for j in range(j1,j2+1):\r\n outs +=l[i][j]\r\n print(outs) \r\n", "n , m = map( int, input().strip().split(' ') )\r\nboard = []\r\nfor _ in range(n):\r\n board.append( list( input().strip() ) )\r\nrl , rh , cl , ch = n , 0 , m , 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if board[i][j] == '*':\r\n rl = min(rl, i)\r\n rh = max(rh, i)\r\n cl = min(cl, j)\r\n ch = max(ch, j)\r\nfor i in range(rl, rh + 1):\r\n line = ''\r\n for j in range(cl, ch + 1):\r\n line += board[i][j]\r\n print(line)", "def main():\r\n n, m = map(int, input().split())\r\n s = []\r\n for i in range(n):\r\n s.append(input())\r\n left, right, top, bot = float('inf'), float('-inf'), None, None\r\n for i in range(n):\r\n if '*' in s[i]:\r\n top = i\r\n break\r\n for i in range(n-1, -1, -1):\r\n if '*' in s[i]:\r\n bot = i\r\n break\r\n for i in range(top, bot+1):\r\n for j in range(m):\r\n if s[i][j] == '*':\r\n if j > right:\r\n right = j\r\n if j < left:\r\n left = j\r\n\r\n for i in range(top, bot+1):\r\n print(s[i][left:right+1])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "l = input().split()\r\nn = int(l[0])\r\nm = int(l[1])\r\ns = []\r\nmin = m\r\nmax = 0\r\nminline = n \r\nmaxline = 0\r\nfor i in range(n):\r\n st = input()\r\n enum = [pos for pos,char in enumerate(st) if char == '*']\r\n if enum:\r\n if i < minline:\r\n minline = i\r\n if i > maxline:\r\n maxline = i\r\n if enum[0] < min:\r\n min = enum[0]\r\n if enum[-1] > max:\r\n max = enum[-1]\r\n s.append(st)\r\ns = s[minline:maxline+1]\r\nfor i in range(len(s)):\r\n s[i] = s[i][min:max+1]\r\n print(s[i])", "n, m = map(int, input().split())\nL = [str(input()) for _ in range(n)]\n\nil = -1\nir = -1\nfor i in range(n):\n for j in range(m):\n if L[i][j] != '.':\n ir = i\n if il == -1:\n il = i\n\njl = -1\njr = -1\nfor j in range(m):\n for i in range(n):\n if L[i][j] != '.':\n jr = j\n if jl == -1:\n jl = j\n\nfor i in range(il, ir+1):\n print(L[i][jl:jr+1])\n", "s=[int(i) for i in input().split()]\na=[input() for i in range(s[0])]\nfor _ in range(4):\n a.reverse()\n d,b=[],0\n for c in zip(*a):\n if '*' in c:b = 1\n if b:d+=[c]\n a=d\nfor i in a:\n print(''.join(i))\n\n", "# LUOGU_RID: 101441390\nn, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\nx0 = y0 = 50\r\nx1 = y1 = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '*':\r\n x0 = min(x0, i)\r\n y0 = min(y0, j)\r\n x1 = max(x1, i)\r\n y1 = max(y1, j)\r\nfor i in range(x0, x1 + 1):\r\n print(a[i][y0:y1+1])", "n,m = map(int,input().split())\r\ns = []\r\nss = []\r\nfor i in range(n):\r\n c = list(input())\r\n s.append(c)\r\n\r\na = None\r\nb = None\r\nfor i in range(len(s)):\r\n if '*' in s[i]:\r\n if a is None:\r\n a = i\r\n b = i\r\ns = s[a:b+1]\r\n \r\nc = None\r\nd = None\r\n\r\nfor j in range(m):\r\n #f = False\r\n for i in range(len(s)):\r\n if s[i][j] == '*':\r\n #f = True\r\n if c is None:\r\n c = j\r\n d = j\r\n\r\n#for j in range(c,d+1):\r\n# for i in range(len(s)):\r\n# ss.append(s[i][j])\r\n\r\nfor i in range(len(s)):\r\n print(\"\".join(s[i][c:d+1])) #\"\".join(map(str, ss))\r\n#print(c,d)", "a,b = map(int,input().split())\r\nGrid = []\r\nfor i in range(a):\r\n s = input()\r\n Grid.append(s)\r\nImax,Jmax = -1,-1\r\nImin,Jmin = 10000,10000\r\n\r\n\r\n\r\nfor i in range(a):\r\n for j in range(b):\r\n if(Grid[i][j] == '*'):\r\n if(Imax < i):\r\n Imax = i\r\n if(Jmax < j):\r\n Jmax = j\r\n if(Imin > i):\r\n Imin = i\r\n if(Jmin > j):\r\n Jmin = j\r\n\r\nfor i in range(Imin,Imax+1):\r\n ans = ''\r\n for j in range(Jmin,Jmax+1):\r\n ans += Grid[i][j]\r\n print(ans)\r\n", "import sys\r\n\r\nn, m, *a = sys.stdin.read().split()\r\n\r\nn = int(n)\r\nm = int(m)\r\n\r\nmxi = 0\r\nmxj = 0\r\nmni = n\r\nmnj = m\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '*':\r\n mni = min(mni, i)\r\n mnj = min(mnj, j)\r\n mxi = max(mxi, i)\r\n mxj = max(mxj, j)\r\n\r\nfor i in range(mni, mxi+1):\r\n for j in range(mnj, mxj+1):\r\n print(a[i][j], end=\"\")\r\n print()\r\n", "n, m = [int(x) for x in input().split()]\r\nl = t = 101\r\nr = b = -11\r\na= []\r\n\r\nfor row in range(n):\r\n s = input()\r\n for col in range(m):\r\n if s[col] == '*':\r\n if row < t:\r\n t = row\r\n if col < l:\r\n l = col\r\n if col > r:\r\n r = col\r\n if row > b:\r\n b = row\r\n a.append(s)\r\n\r\nfor row in range(t, b + 1):\r\n print(a[row][l: r + 1])\r\n", "def main():\r\n ns, ms = map(int, input().split())\r\n drawi = [['0' for _ in range(ms)] for _ in range(ns)]\r\n startRow, endRow, startCol, endCol = ns, 0, ms, 0\r\n\r\n for row in range(ns):\r\n li = input().strip()\r\n for col in range(ms):\r\n drawi[row][col] = li[col]\r\n\r\n if li[col] == '*':\r\n startRow = min(startRow, row)\r\n endRow = max(endRow, row)\r\n startCol = min(startCol, col)\r\n endCol = max(endCol, col)\r\n\r\n for row in range(startRow, endRow + 1):\r\n for col in range(startCol, endCol + 1):\r\n print(drawi[row][col], end='')\r\n print()\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int, input().split())\r\ngrid = [input() for i in range(n)]\r\n\r\nmaxrow, maxcol, minrow, mincol = -1, -1, n, m\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if(grid[i][j] == '*'):\r\n maxrow = max(maxrow, i)\r\n maxcol = max(maxcol, j)\r\n minrow = min(minrow, i)\r\n mincol = min(mincol, j)\r\n \r\nfor i in range(minrow, maxrow + 1):\r\n print(grid[i][mincol: maxcol + 1])\r\n", "n,m = map(int, input().split())\np = []\nflag = False\nminr = n\nmaxr = 0\nminc = m\nmaxc = 0\nfor i in range(n):\n s = (input())\n if ''.join(s) != '.'*len(s):\n flag = True\n if flag:\n p.append(s)\nsalva = 0\nfor i in reversed(range(len(p))):\n if ''.join(p[i]) != '.'*len(p[i]):\n salva = i+1\n break\np = p[:salva]\n\nfor i in range(len(p)):\n for j in range(m):\n if p[i][j] == \"*\":\n minr = min(minr, i)\n maxr = max(maxr, i)\n minc = min(minc, j)\n maxc = max(maxc, j)\nfor i in range(minr, maxr + 1):\n print(p[i][minc:maxc + 1])\n\n \t\t\t \t \t \t \t \t \t\t \t\t", "n, m = (int(x) for x in input().split())\r\npicture = []\r\ni = 0\r\nwhile i < n:\r\n\tpicture.append(input())\r\n\ti += 1\r\ni = 0\r\nstart_str = n\r\nend_str = 0\r\nstart_row = m\r\nend_row = 0\r\nwhile i < n:\r\n\tif '*' in picture[i]:\r\n\t\tif i < start_str:\r\n\t\t\tstart_str = i\r\n\t\tif i > end_str:\r\n\t\t\tend_str = i\r\n\t\tj = picture[i].index('*')\r\n\t\tif j < start_row:\r\n\t\t\tstart_row = j\r\n\t\twhile j < m:\r\n\t\t\tif picture[i][j] == '*':\r\n\t\t\t\tif j > end_row:\r\n\t\t\t\t\tend_row = j\r\n\t\t\tj += 1\r\n\ti += 1\r\ni = start_str\r\nwhile i < end_str + 1:\r\n\tprint(picture[i][start_row:end_row + 1])\r\n\ti += 1", "n,m = map(int, input().split())\r\n\r\nl = []\r\nfor i in range(n):\r\n l.append(list(input()))\r\n\r\nf = []\r\nfor i in range(n):\r\n if '*' in l[i]:\r\n for j in range(m):\r\n if l[i][j] == '*':\r\n f.append([i, j])\r\n else:\r\n continue\r\n\r\nk = 0\r\nt = 0\r\nz = n\r\nw = m\r\nfor i in f:\r\n y = i[0]\r\n x = i[-1]\r\n if k < y:\r\n k = y\r\n if z > y:\r\n z = y\r\n if t < x:\r\n t = x\r\n if w > x:\r\n w = x\r\n\r\n\r\nfor i in range(z, k+1):\r\n v = ''\r\n for j in range(w, t+1):\r\n v += l[i][j]\r\n print(v)", "a,b=map(int,input().split())\nar=[]\nfor i in range(a):\n x=input()\n ar.append(x)\nx=[]\ny=[]\nfor i in range(a):\n if '*' in ar[i]:\n y.append(i)\n for j in range(b):\n if ar[i][j]=='*':\n x.append(j)\n# print(x,y)\nx1=min(x)\nx2=max(x)\ny1=min(y)\ny2=max(y)\nfor i in range(a):\n if i>=y1 and i<=y2:\n for j in range(x1,x2+1):\n print(ar[i][j],end=\"\")\n print(\"\")\n \n", "n, m = map(int, input().split())\na = []\nimin, imax = n - 1, 0\njmin, jmax = m - 1, 0\nfor i in range(n):\n s = input()\n a.append(s)\n for j in range(m):\n if s[j] == '*':\n imin = min(imin, i)\n imax = max(imax, i)\n jmin = min(jmin, j)\n jmax = max(jmax, j)\n \nfor i in range(imin, imax + 1):\n print(a[i][jmin:jmax+1])", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nmatrix = []\r\nfor x in range(n):\r\n matrix.append(list(input()))\r\nmin_i = n\r\nmax_i = -1\r\nmin_j = m\r\nmax_j = -1\r\nfor x in range(n):\r\n for y in range(m):\r\n if matrix[x][y] == \"*\":\r\n if(x<min_i):\r\n min_i=x\r\n if(x>max_i):\r\n max_i=x\r\n if(y<min_j):\r\n min_j=y\r\n if(y>max_j):\r\n max_j=y\r\n\r\nfor i in range(min_i,max_i+1):\r\n for j in range(min_j, max_j+1):\r\n print(matrix[i][j],end=\"\")\r\n print()", "n, m = map(int, input().split())\r\ngrid = []\r\nupper = left = 51\r\nbottom = right = 0\r\n\r\nfor i in range(n):\r\n grid.append(input())\r\n for j in range(m):\r\n if grid[i][j] == '*':\r\n if i < upper:\r\n upper = i\r\n if j < left:\r\n left = j\r\n if i > bottom:\r\n bottom = i\r\n if j > right:\r\n right = j\r\n\r\n#print(upper, left, bottom, right)\r\n\r\nfor i in range(upper, bottom+1):\r\n for j in range(left, right+1):\r\n print(grid[i][j], end='')\r\n print()", "n, m = [int(x) for x in input().split()]\n\nletter = []\n\nbench = ''\n\ndef check_row(matrix, row):\n for square in matrix[row]:\n if square == '*':\n return False\n return True\n\ndef check_column(matrix, column):\n for row in range(len(matrix)):\n if matrix[row][column] == '*':\n return False\n return True\n\nfor i in range(n):\n letter.append(list(input()))\n\nwhile check_row(letter, 0):\n letter.pop(0)\n\nwhile check_row(letter, (len(letter) - 1)):\n letter.pop(len(letter) - 1)\n\nwhile check_column(letter, 0):\n for row in letter:\n row.pop(0)\n\nwhile check_column(letter, (len(letter[0]) - 1)):\n for row in letter:\n row.pop(len(row) - 1)\n\nfor row in letter:\n for character in row:\n bench = bench + character\n print(bench)\n bench = ''\n\n\n", "n,m = map(int,input().split())\r\nR = [list(input()) for _ in range(n)]\r\nii = ['*' in r for r in R]\r\ni0 = ii.index(True)\r\ni1 = n-ii[::-1].index(True)\r\njj = ['*' in c for c in zip(*R)]\r\nj0 = jj.index(True)\r\nj1 = m-jj[::-1].index(True)\r\nfor i in range(i0, i1):\r\n print(''.join(R[i][j0:j1]))\r\n", "bl='*'\r\n\r\ndef gd(f,l):\r\n\t\"\"\"get delta\"\"\"\r\n\treturn 2*int(l>f)-1\r\n\r\ndef fe(v,zf,zl,xf,xl,iv):#iv is vertical\r\n\t\"\"\"find edge\"\"\"\r\n\tdz=gd(zf,zl)\r\n\tdx=gd(xf,xl)\r\n\tfor c in range(zf,zl,dz):\r\n\t\tfor d in range(xf,xl,dx):\r\n\t\t\tt=v[c][d] if iv else v[d][c]\r\n\t\t\tif t==bl:\r\n\t\t\t\treturn c\r\n\r\ndef ge(v,h,w):\r\n\t\"\"\"get edges\"\"\"\r\n\tt=fe(v,0,h,0,w,1)\r\n\tb=fe(v,h-1,-1,0,w,1)\r\n\tl=fe(v,0,w,0,h,0)\r\n\tr=fe(v,w-1,-1,0,h,0)\r\n\t#print('top={} bottom={} left={} right={}'.format(t,b,l,r))\r\n\treturn t,b,l,r\r\n\t\r\ndef pr(v,h,w):\r\n\t\"\"\"print region\"\"\"\r\n\tt,b,l,r=ge(v,h,w)\r\n\tfor c in range(t,b+1):\r\n\t\tfor d in range(l,r+1):\r\n\t\t\tprint(v[c][d],end='')\r\n\t\tprint()\r\n\r\nh,w=[int(c) for c in input().split()]\r\nv=[]\r\nfor c in range(h):\r\n\tv.append(input())\r\npr(v,h,w)", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(input()))\r\nx,y=[],[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if(l[i][j]=='*'):\r\n x.append(i)\r\n y.append(j)\r\nk=[]\r\nfor i in range(min(x),max(x)+1):\r\n d=[]\r\n for j in range(min(y),max(y)+1):\r\n d.append(l[i][j])\r\n k.append(d)\r\nfor i in k:\r\n print(''.join(i))\r\n", "n, m = [int(item) for item in input().split()]\r\ntop, bottom, left, right = -1, -1, 51, 0\r\narr = []\r\n\r\nfor i in range(n):\r\n line = input()\r\n fInd = line.find('*')\r\n if fInd != -1:\r\n if top == -1:\r\n top = i\r\n\r\n if left > fInd:\r\n left = fInd\r\n\r\n fInd = line.rfind('*')\r\n if right < fInd:\r\n right = fInd\r\n bottom = i\r\n\r\n arr.append(line)\r\n\r\n\r\nfor i in range(top, bottom + 1):\r\n print(arr[i][left:right + 1])\r\n'''\r\n10 14\r\n..............\r\n..............\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\n#sys.stdin = open(\"test.in\", \"r\")\r\nN, M = map(int, input().split())\r\nlines = []\r\nfor i in range(0,N,1):\r\n lines.append(input())\r\nstart = -1\r\nend = -1\r\nfor i in range(0,N,1):\r\n if \"*\" in lines[i]:\r\n if start==-1:\r\n start = i\r\n end = i\r\nH = [start,end]\r\nstart = -1\r\nend = -1\r\nfor i in range(0,M,1):\r\n shaded = False\r\n for line in lines:\r\n if line[i]==\"*\":\r\n shaded=True\r\n if shaded:\r\n if start==-1:\r\n start=i\r\n end = i\r\nV = [start, end]\r\n#print(H,V)\r\nfor i in range(H[0],H[1]+1,1):\r\n print(lines[i][V[0]:V[1]+1])\r\n", "n, m = list(map(int, input().split()))\r\n\r\nsheet = []\r\nup = 0\r\nbottom = 0\r\nindup = False\r\nfor i in range(n):\r\n sheet.append(input())\r\n if '*' in sheet[-1] and indup == False:\r\n up = i\r\n indup = True\r\n if '*' in sheet[-1]:\r\n bottom = i\r\n\r\nleft = 0\r\nindleft = False\r\nright = 0\r\nfor j in range(m):\r\n for i in range(n):\r\n if sheet[i][j] == '*' and indleft == False:\r\n left = j\r\n indleft = True\r\n if sheet[i][j] == '*':\r\n right = j\r\n continue\r\n\r\nfor i in range(up, bottom+1):\r\n print(sheet[i][left:right+1])", "n, m = map(int, input().split())\r\narr = list()\r\nfor i in range(n):\r\n arr.append(input())\r\nxf, yf, xl, yl = n, m, -1, -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j] != '.':\r\n if xf > i:\r\n xf = i\r\n if yf > j:\r\n yf = j\r\n if xl < i:\r\n xl = i\r\n if yl < j:\r\n yl = j\r\nfor i in range(xf, xl + 1):\r\n print(arr[i][yf:yl + 1])\r\n", "n, m = map(int, input().split())\r\n\r\ngrid = []\r\nleft = m\r\nright = 0\r\ntop = n\r\ndown = 0\r\nfor r in range(n):\r\n line = input()\r\n grid.append(line)\r\n for c, x in enumerate(line):\r\n if x == '*':\r\n left = min(left, c)\r\n right = max(right, c)\r\n top = min(top, r)\r\n down = max(down, r)\r\n\r\nfor line in grid[top : down+1]:\r\n print(line[left : right+1])", "user_input = input().split()\r\nn = int(user_input[0])\r\nm = int(user_input[1])\r\nrecatangle = []\r\nfor i in range(n):\r\n recatangle.append(input())\r\n\r\nstart_m = []\r\nend_m = []\r\n\r\nfor i in range(len(recatangle)):\r\n if \"*\" in recatangle[i]:\r\n start_n = i\r\n break\r\n\r\nfor i in reversed(range(len(recatangle))):\r\n if \"*\" in recatangle[i]:\r\n end_n = i\r\n break\r\n\r\nfor i in recatangle:\r\n if \"*\" in i:\r\n start_m.append(i.index(\"*\"))\r\n end_m.append(i.rindex(\"*\"))\r\n\r\nfor i in range(start_n, end_n + 1):\r\n print(recatangle[i][min(start_m):max(end_m) + 1])", "n, m = map(int, input().split())\r\ngrid = [input() for _ in range(n)]\r\n\r\ntop = float('inf')\r\nbottom = float('-inf')\r\nleft = float('inf')\r\nright = float('-inf')\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '*':\r\n top = min(top, i)\r\n bottom = max(bottom, i)\r\n left = min(left, j)\r\n right = max(right, j)\r\n\r\nheight = bottom - top + 1\r\nwidth = right - left + 1\r\n\r\n\r\nfor i in range(top, bottom + 1):\r\n for j in range(left, right + 1):\r\n print(grid[i][j], end='')\r\n print()", "\r\ndef traspuesta(matriz, filas, columnas):\r\n matriz_t = []\r\n for i in range(columnas):\r\n matriz_t.append([])\r\n for j in range(filas):\r\n matriz_t[i].append(matriz[j][i])\r\n return matriz_t\r\n\r\ndef cortar(matriz, filas):\r\n sup = 0\r\n for i in range(filas):\r\n if not '*' in matriz[i][:]:\r\n sup = sup + 1\r\n else:\r\n break;\r\n\r\n inf = 0\r\n for i in range(filas):\r\n if not '*' in matriz[-(i+1)][:]:\r\n inf = inf + 1\r\n else:\r\n break; \r\n \r\n matriz = matriz[sup:filas-inf]\r\n filas = filas - sup - inf \r\n \r\n return matriz\r\n\r\n\r\ndatos = input().split()\r\nfilas, columnas = int(datos[0]), int(datos[1])\r\nmatriz = []\r\nfor i in range(filas):\r\n matriz.append(list(input()))\r\n\r\nmatriz = cortar(matriz, len(matriz))\r\nmatriz = traspuesta(matriz, len(matriz), len(matriz[0]))\r\nmatriz = cortar(matriz, len(matriz))\r\nmatriz = traspuesta(matriz, len(matriz), len(matriz[0]))\r\n\r\nfor i in range(len(matriz)):\r\n linea = ''\r\n for j in range(len(matriz[0])):\r\n linea = linea + matriz[i][j]\r\n print(linea)\r\n\r\n\r\n\r\n", "a,b=map(int,input().split())\r\nl=[[]]\r\nfor i in range(a):\r\n s=list(input())\r\n l.append(s)\r\nx1=y1=100\r\nx2=y2=0\r\nw=0\r\nfor o in l:\r\n for p in range(len(o)):\r\n if o[p]=='*':\r\n y1=min(y1,w)\r\n x1=min(x1,p)\r\n x2=max(x2,p)\r\n y2=max(y2,w)\r\n w+=1\r\nu=0\r\nfor io in l:\r\n if u>=y1 and u<=y2:\r\n for k in range(x1,x2+1):\r\n print(io[k],end='')\r\n print()\r\n u+=1\r\n\r\n", "\r\n\r\n\r\ndef printArr(Arr):\r\n \r\n for i in Arr:\r\n str=\"\"\r\n for j in range(len(i)):\r\n if i[j]!=\"-\":\r\n str+=i[j]\r\n if len(str)>0:\r\n print(str)\r\n\r\n\r\nR,C=map(int, input().split())\r\nArr=[]\r\n\r\nfor i in range(R):\r\n Arr.append(input())\r\n\r\nnewAr=[]\r\nfor i in range(R):\r\n newAr.append([])\r\n for j in range(C):\r\n newAr[i]+=Arr[i][j]\r\n\r\n\r\n\r\n\r\n\r\nfound=False\r\nfor i in range(R):\r\n for j in range(C):\r\n \r\n if newAr[i][j] =='*':\r\n found=True\r\n break;\r\n if found==False:\r\n for j in range(C):\r\n newAr[i][j]=\"-\"\r\n else:\r\n break;\r\n \r\nfound=False\r\nfor i in range(R-1,-1,-1):\r\n for j in range(C):\r\n if newAr[i][j] =='*':\r\n found=True\r\n break;\r\n if found==False:\r\n for j in range(C):\r\n newAr[i][j]=\"-\"\r\n else:\r\n break;\r\n\r\n \r\n\r\n\r\n\r\nfound=False\r\nfor i in range(C):\r\n for j in range(R):\r\n \r\n if newAr[j][i] =='*':\r\n found=True\r\n break;\r\n if found==False:\r\n for j in range(R):\r\n newAr[j][i]=\"-\"\r\n else:\r\n break;\r\n \r\nfound=False\r\nfor i in range(C-1,-1,-1):\r\n for j in range(R):\r\n if newAr[j][i] =='*':\r\n found=True\r\n break;\r\n if found==False:\r\n for j in range(R):\r\n newAr[j][i]=\"-\"\r\n else:\r\n break;\r\n\r\nprintArr(newAr)\r\n\r\n\r\n\r\n", "n,m = map(int, input().split())\r\ndata = []\r\n\r\nfor _ in range(n):\r\n data.append(list(input()))\r\n\r\nL,R = 100000, -1\r\nU,D = 100000, -1\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if data[i][j]=='*':\r\n if j<L: L = j\r\n if j>R: R = j\r\n if i<U: U = i\r\n if i>D: D = i\r\n\r\nfor i in range(U,D+1):\r\n for j in range(L,R+1):\r\n print(data[i][j], end='')\r\n print()", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\n\r\nn, m = map(int, input().split())\r\na = 60\r\nb = 0\r\nl = []\r\nf = False\r\nt = []\r\nfor i in range(n):\r\n s = input()\r\n l.append(s)\r\n if '*' in s:\r\n t.append(i)\r\n a = min(a, s.find('*'))\r\n b = max(b, s.rfind('*'))\r\nfor i in l[t[0]:t[-1] + 1]:\r\n print(i[a:b+1])\r\n", "(lines, columns) = map(int, input().split(' '))\nsheets = []\nmargin_left = columns\nmargin_right = 0\nlines_include_information = []\nfor i in range(lines):\n sheet = input()\n sheets.append(sheet)\n count_asterisks = 0\n for j in range(columns):\n if sheet[j] == '*':\n count_asterisks += 1\n if j < margin_left:\n margin_left = j\n if j > margin_right:\n margin_right = j\n\n if count_asterisks > 0:\n lines_include_information.append(i)\n\nfor i in range(lines_include_information[0], lines_include_information[-1] + 1):\n print(sheets[i][margin_left:margin_right + 1])\n\n\n\n", "import sys\r\n\r\n#sys.stdin = open(\"1.in\", \"r\")\r\n\r\nn, m = map(int, input().split())\r\n\r\n# 初始化左上角和右下角的坐标\r\nleft = m\r\ntop = n\r\nright = 0\r\nbottom = 0\r\n\r\n# 遍历每个格子，找到左上角和右下角的坐标\r\ngrid = []\r\nfor i in range(n):\r\n row = input()\r\n grid.append(row)\r\n for j in range(m):\r\n if row[j] == '*':\r\n left = min(left, j)\r\n top = min(top, i)\r\n right = max(right, j)\r\n bottom = max(bottom, i)\r\n\r\nfor r in range(top, bottom+1):\r\n for c in range(left, right+1):\r\n print(grid[r][c], sep='', end='')\r\n print('')\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m = map(int,input().split())\nst = m \nend = 0\narr = []\nfirst = -1\nlast = -1\nf = True\nfor j in range(n):\n s = input()\n arr.append(s)\n if '*' in s:\n if f:\n first = j\n f = False\n last = j \n else:\n continue\n \n a = -1\n b = -1\n for i in range(m):\n if s[i]=='*':\n if a==-1:\n a = i\n b = i\n if b!=-1: \n st = min(st,a)\n end = max(end,b)\n \nnew = []\nfor i in range(first,last+1):\n print(arr[i][st:end+1])\n ", "n, m = map(int, input().split())\r\nl = []\r\ns = set()\r\nfor _ in range(n):\r\n a = input()\r\n s.add(a.find('*'))\r\n s.add(a.rfind('*'))\r\n if '*' in a:\r\n l.append(a)\r\n elif len(l) != 0:\r\n l.append(a)\r\nwhile True:\r\n if '*' not in l[-1]:\r\n del l[-1]\r\n else:\r\n break\r\nif -1 in s:\r\n s.remove(-1)\r\ns = sorted(s)\r\nx = s[0]\r\ny = s[-1]\r\nfor i in l:\r\n print(i[x:y + 1])", "n, m = map(int, input().split())\r\nl = [input() for i in range(n)]\r\ni1 = n - 1\r\ni2 = 0\r\nj1 = m - 1\r\nj2 = 0\r\nfor i in range(n):\r\n if (l[i].find('*') != -1):\r\n i1 = min(i1, i)\r\n i2 = max(i2, i)\r\n j1 = min(j1, l[i].find('*'))\r\n j2 = max(j2, l[i].rfind('*'))\r\nfor i in range(i1, i2 + 1):\r\n print(l[i][j1:j2 + 1])", "n,m=list(map(int,input().split()))\r\na=[]\r\nb=-1\r\nc=-1\r\nd=-1\r\ne=-1\r\nfor i in range(n):\r\n a.append(input())\r\n for j in range(m):\r\n if a[i][j]=='*':\r\n if d==-1 or j<d:\r\n d=j\r\n if e==-1 or j>e:\r\n e=j\r\n c=i\r\n if b==-1:\r\n b=i\r\na=a[b:c+1]\r\nfor i in range(c+1-b):\r\n a[i]=a[i][d:e+1]\r\n print(a[i])", "import abc\r\nimport itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n\r\n f = []\r\n x1, y1, x2, y2 = 1 << 60, 1 << 60, 0, 0\r\n for i in range(n):\r\n s = str(input())\r\n for j in range(m):\r\n if s[j] == \"*\":\r\n x1 = min(x1, j)\r\n y1 = min(y1, i)\r\n x2 = max(x2, j)\r\n y2 = max(y2, i)\r\n f.append(s)\r\n\r\n for i in range(y1, y2 + 1):\r\n for j in range(x1, x2 + 1):\r\n print(f[i][j], end=\"\")\r\n print()\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "n,m = map(int,input().split(' ')) # citim nr de randuri si nr de caractere\r\nr = []\r\nfor i in range(n):\r\n row = list(input()) # randul se salveaza ca o lista de caractere\r\n r.append(row) # in list r\r\n\r\nfirst = []\r\nlast = []\r\nf_row = []\r\n\r\nfor i in range(len(r)):\r\n for j in range(len(r[i])):\r\n # determinam prima si ultima pozitie a semnului *\r\n if r[i][j] == '*':\r\n f_row.append(i) # lista pentru randuri\r\n first.append(j) # lista pt start si end in index in rand\r\n\r\n\r\nfirst_index = min(first) # start index pentru fiecare rand\r\nlast_index = max(first) # end index pentru fiecare rand\r\n\r\nf_row_idx = min(f_row) # incepem de la randul acesta\r\nl_row_idx = max(f_row) # pana la ultimul rand\r\n\r\nfor i in range(f_row_idx, l_row_idx+1):\r\n for j in range(first_index, last_index+1):\r\n print(r[i][j], end='')\r\n print()\r\n", "\r\nn, m = map(int, input().split())\r\n\r\nl = []\r\nfor _ in range(n):\r\n\tl.append(list(input()))\r\n\r\n\r\nfor _ in range(len(l)):\r\n\tif len(set(l[0])) == 1 and l[0][0] == '.':\r\n\t\tl.pop(0)\r\n\telse:\r\n\t\tbreak\r\n\r\nfor _ in range(len(l)):\r\n\tif len(set(l[-1])) == 1 and l[-1][0] == '.':\r\n\t\tl.pop()\r\n\telse:\r\n\t\tbreak\r\n\r\n\r\nfor _ in range(m):\r\n\tli = set()\r\n\tfor i in range(len(l)):\r\n\t\tli.add(l[i][0])\r\n\r\n\tif len(li) == 1 and '.' in li:\r\n\t\tfor i in range(len(l)):\r\n\t\t\tl[i].pop(0)\r\n\r\n\telse:\r\n\t\tbreak\r\n\r\n\r\nfor _ in range(len(l[0])):\r\n\tli = set()\r\n\tfor i in range(len(l)):\r\n\t\tli.add(l[i][-1])\r\n\r\n\tif len(li) == 1 and '.' in li:\r\n\t\tfor i in range(len(l)):\r\n\t\t\tl[i].pop()\r\n\r\n\telse:\r\n\t\tbreak\r\n\r\n\r\nfor i in l:\r\n\tprint(*i, sep = '')", "n, m = [int(x) for x in input().split()]\na = []\nfor i in range(n):\n\ta.append(input())\nwhile '*' not in a[0]:\n\ta.pop(0)\nwhile '*' not in a[-1]:\n\ta.pop(-1)\nn = len(a)\nwhile '*' not in (x[0] for x in a):\n\tfor i in range(n):\n\t\ta[i] = a[i][1: ]\nwhile '*' not in (x[-1] for x in a):\n\tfor i in range(n):\n\t\ta[i] = a[i][: -1]\nprint('\\n'.join(a))\n", "row, col = [int(x) for x in input().split()]\r\nrects = []\r\nstar_rows = ''\r\nfirst_col, last_col = col, 0\r\nfor i in range(row):\r\n curr = input()\r\n rects.append(curr)\r\n if \"*\" in curr:\r\n star_rows += \"*\"\r\n if curr.index(\"*\") < first_col:\r\n first_col = curr.find(\"*\")\r\n if curr.rindex(\"*\") > last_col:\r\n last_col = curr.rfind(\"*\")\r\n else:\r\n star_rows += \".\"\r\n\r\nfirst_row, last_row = star_rows.index(\"*\"), star_rows.rindex(\"*\")\r\nfor i in rects[first_row: last_row + 1]:\r\n print(i[first_col:last_col+1])", "n, m = map(int, input().split())\r\nsheet = [list(input()) for _ in range(n)]\r\n\r\n# Initialize variables to store the minimum and maximum row and column indices of shaded squares.\r\nmin_row, max_row, min_col, max_col = n, -1, m, -1\r\n\r\n# Iterate through the sheet to find the boundaries of the shaded area.\r\nfor i in range(n):\r\n for j in range(m):\r\n if sheet[i][j] == '*':\r\n min_row = min(min_row, i)\r\n max_row = max(max_row, i)\r\n min_col = min(min_col, j)\r\n max_col = max(max_col, j)\r\n\r\n# Print the minimum cost rectangle containing all shaded squares.\r\nfor i in range(min_row, max_row + 1):\r\n for j in range(min_col, max_col + 1):\r\n print(sheet[i][j], end='')\r\n print() # Move to the next row\r\n\r\n", "def main() -> None:\r\n n, m = map(int, input().split())\r\n max_ij = [-1, -1]\r\n min_ij = [n, m]\r\n a = []\r\n for i in range(n):\r\n s = input()\r\n a.append([c for c in s])\r\n for i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '*':\r\n min_ij[0] = min(min_ij[0], i)\r\n min_ij[1] = min(min_ij[1], j)\r\n max_ij[0] = max(max_ij[0], i)\r\n max_ij[1] = max(max_ij[1], j)\r\n for i in range(min_ij[0], max_ij[0] + 1):\r\n for j in range(min_ij[1], max_ij[1] + 1):\r\n print(a[i][j], end='')\r\n print()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m = map(int, input().split())\r\ngrid = [input() for _ in range(n)]\r\n\r\nmin_row, max_row, min_col, max_col = n, -1, m, -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '*':\r\n min_row = min(min_row, i)\r\n max_row = max(max_row, i)\r\n min_col = min(min_col, j)\r\n max_col = max(max_col, j)\r\n\r\nfor i in range(min_row, max_row + 1):\r\n print(grid[i][min_col:max_col + 1])", "n,m=map(int,input().split())\r\nk=[]\r\nfor i in range(n):\r\n k.append(input())\r\nstrow=[]\r\nstcol=[]\r\nfor i in range(n):\r\n if \"*\" in k[i]:\r\n strow.append(i)\r\n stcol.append(k[i].find(\"*\"))\r\n stcol.append(k[i].rfind(\"*\"))\r\nsrow=min(strow)\r\nerow=max(strow)\r\nscol=min(stcol)\r\necol=max(stcol)+1\r\nfor i in range(n):\r\n if i>=srow and i<=erow:\r\n print(k[i][scol:ecol])\r\n\r\n \r\n", "def get_index(piece):\r\n start_assigned = False\r\n start = 10**18\r\n end = 0\r\n for i, val in enumerate(piece):\r\n if val == '*' and not start_assigned:\r\n start = i\r\n end = i\r\n start_assigned = True\r\n elif val == '*':\r\n end = i\r\n return (start, end)\r\n\r\n\r\nm, n = map(int, input().split())\r\nart = []\r\n\r\nstart_min = m*n\r\nend_max = 0\r\ninitial_start = 0\r\ninitial_start_assigned = False\r\ninitial_end = 0\r\n\r\nfor _ in range(m):\r\n piece = input()\r\n if '*' in piece and not initial_start_assigned:\r\n initial_start = _ \r\n initial_end = _\r\n initial_start_assigned = True\r\n elif '*' in piece:\r\n initial_end = _\r\n start, end = get_index(piece)\r\n start_min = min(start_min, start)\r\n end_max = max(end_max, end)\r\n art.append(piece)\r\n\r\nfor idx, piece in enumerate(art):\r\n small_piece = piece[start_min:end_max+1]\r\n if idx >= initial_start and idx <= initial_end:\r\n print(small_piece)\r\n", "\r\nn, m = map(int, input().split())\r\nmatr = []\r\nfor _ in range(n):\r\n matr += [input()]\r\nlt = [n, m]\r\nrb = [0, 0]\r\nfor i in range(n):\r\n for j in range(m):\r\n if matr[i][j] == '*':\r\n lt = list(map(min, lt, [i, j]))\r\n rb = list(map(max, rb, [i+1, j+1]))\r\n\r\nfor i in range(lt[0], rb[0]):\r\n for j in range(lt[1], rb[1]):\r\n print(matr[i][j], end='')\r\n\r\n print()\r\n", "n, m = map(int, input().split())\nlinhas = [input() for i in range(n)]\n\ni_l = 0\ni_c = 0\nf_l = 0\nf_c = 0\n\nfor i in range(n):\n\tif linhas[i] != '.' * m:\n\t\ti_l = i\n\t\tbreak\n\nfor i in range(n):\n\tif linhas[n-i-1] != '.' * m:\n\t\tf_l = n-i-1\n\t\tbreak\n\naux = [''.join(c) for c in zip(*linhas)]\nfor i in range(m):\n\tif aux[i] != '.' * n:\n\t\ti_c = i\n\t\tbreak\n\nfor i in range(m):\n\tif aux[m-i-1] != '.' * n:\n\t\tf_c = m-i-1\n\t\tbreak\n\nlinhas = linhas[i_l:f_l+1]\n\n\nfor linha in linhas:\n\tl = linha[i_c:f_c+1]\n\tprint(l)\n\n", "n, m = (int(i) for i in input().split())\ns = [[c for c in input()] for _ in range(n)]\nmin_r, max_r, min_c, max_c = n, -1, m, -1\nfor r in range(n):\n for c in range(m):\n if s[r][c] == \"*\":\n min_r, max_r = min(min_r, r), max(max_r, r)\n min_c, max_c = min(min_c, c), max(max_c, c)\nres = \"\\n\".join(\"\".join(r[min_c:max_c + 1]) for r in s[min_r:max_r + 1])\nprint(res)\n", "n, m = map(int, input().split())\r\nstr_arr = list()\r\nfor i in range(n):\r\n string = input()\r\n str_arr.append(string)\r\n\r\ni_arr = []\r\n\r\nfor i in range(n):\r\n if \"*\" in str_arr[i]:\r\n i_arr.append(i)\r\n\r\ni_min = min(i_arr)\r\ni_max = max(i_arr)\r\n\r\nmin_j = str_arr[i_min].find(\"*\")\r\ntmp_index = 0\r\nfor i in range(n):\r\n tmp_index = str_arr[i].find(\"*\")\r\n if tmp_index < min_j and tmp_index != -1:\r\n min_j = tmp_index\r\n\r\nmax_j = str_arr[i_max].rfind(\"*\")\r\ntmp_index = 0\r\nfor i in range(n):\r\n tmp_index = str_arr[i].rfind(\"*\")\r\n if tmp_index != -1 and tmp_index > max_j:\r\n max_j = tmp_index\r\n\r\nfor i in range(i_min, i_max+1):\r\n for j in range(min_j, max_j+1):\r\n print(str_arr[i][j], end='')\r\n print()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = [int(x) for x in input().strip().split(' ')]\r\ndrawing = []\r\ncoords = []\r\n\r\nfor i in range(n):\r\n line = input()\r\n tmp = []\r\n for j in range(m):\r\n if line[j] == \"*\":\r\n tmp.append(j)\r\n coords.append(tmp)\r\n drawing.append(line)\r\n\r\ntop = n\r\nbottom = 0\r\nleft = min([x[0] for x in coords if x])\r\nright = max([x[-1] for x in coords if x])\r\n\r\nfor i in range(n):\r\n if coords[i]:\r\n top = i\r\n break\r\nfor i in range(n-1, -1, -1):\r\n if coords[i]:\r\n bottom = i\r\n break\r\n\r\nfor i in range(top, bottom+1):\r\n tmp = \"\"\r\n for j in range(left, right+1):\r\n tmp += drawing[i][j]\r\n print(tmp)\r\n", "def find_the_row_from_top(l):\r\n for i in range(len(l)):\r\n for j in range(len(l[i])):\r\n if l[i][j] == \"*\":\r\n return i\r\n\r\n\r\ndef find_the_row_from_bottom(l):\r\n for k in range(len(l)):\r\n i = len(l) - 1 - k\r\n for j in range(len(l[i])):\r\n if l[i][j] == \"*\":\r\n return i\r\n\r\ndef find_the_column_from_right(l):\r\n for i in range(len(l[0])):\r\n for j in range(len(l)):\r\n if l[j][i] == \"*\":\r\n return i\r\n\r\ndef find_the_column_from_left(l):\r\n for i in range(len(l[0])):\r\n k = len(l[0]) - 1 - i\r\n for j in range(len(l)):\r\n if l[j][k] == \"*\":\r\n return k\r\n\r\n\r\n\r\ndef main_function():\r\n input_list = [input() for i in range([int(i) for i in input().split(\" \")][0])]\r\n min_row = 1000000000\r\n max_row = 0\r\n min_column = 100000000\r\n max_column = 0\r\n for i in range(len(input_list)):\r\n for j in range(len(input_list[i])):\r\n if input_list[i][j] == \"*\":\r\n if i > max_row:\r\n max_row = i\r\n if i < min_row:\r\n min_row = i\r\n if j > max_column:\r\n max_column = j\r\n if j < min_column:\r\n min_column = j\r\n output_list = []\r\n for i in range(min_row, max_row + 1):\r\n output_list.append(input_list[i][min_column: max_column + 1])\r\n return \"\\n\".join(output_list)\r\n\r\n\r\n\r\nprint(main_function())\r\n", "__author__ = 'Obriel Muga'\r\n\r\nif __name__ == '__main__':\r\n lista = []\r\n filas,columnas = list(map(int,input().strip().split()))\r\n UL = False\r\n DU = False\r\n IZQ = 10000000000000\r\n DER = -1000000000000\r\n for i in range(filas):\r\n linea = input()\r\n if (UL):\r\n lista.append(linea)\r\n elif (not UL and '*' in linea):\r\n lista.append(linea)\r\n UL = True\r\n for i in range(len(lista) - 1, -1,-1):\r\n if (\"*\" not in lista[i]):\r\n del lista[i]\r\n else:\r\n break\r\n for valor in lista:\r\n a = valor.find('*')\r\n b = valor.rfind('*')\r\n if (a >= 0 and a <= IZQ):\r\n IZQ = a\r\n if (b >= 0 and b >= DER):\r\n DER = b\r\n for i in lista:\r\n print(i[IZQ:DER+1])\r\n \r\n \r\n \r\n", "n,m = map(int,input().split())\r\nletter = []\r\nindex = []\r\n\r\nfor i in range(n):\r\n line_0 = list(input())\r\n letter.append(line_0)\r\nfor i in range(n):\r\n for j in range(len(letter[i])):\r\n if letter[i][j] == '*':\r\n index.append(j)\r\n break\r\n\r\nstandard_indentation_front = min(index)\r\n\r\nindex = []\r\nfor i in range(n):\r\n for j in range(len(letter[i])-1,-1,-1):\r\n if letter[i][j] == '*':\r\n index.append(j+1)\r\n break\r\n\r\nstandard_indentation_back = max(index)\r\n\r\n\r\n\r\n\r\nwhile letter[0].count('.') == len(letter[0]):\r\n del letter[0]\r\nwhile letter[-1].count('.') == len(letter[-1]):\r\n del letter[-1]\r\n\r\n\r\n\r\n\r\n\r\nfor i in range(len(letter)):\r\n for j in range(standard_indentation_front):\r\n letter[i][j] = ''\r\nfor i in range(len(letter)):\r\n for j in range(standard_indentation_back,len(letter[i])):\r\n letter[i][j] = ''\r\n \r\n \r\n \r\n \r\nletter_print = []\r\nfor i in range(len(letter)):\r\n letter_print = ''.join(letter[i])\r\n for j in letter_print:\r\n print(j,end = '')\r\n print()", "rows, columns = [int(item) for item in input().split()]\r\ntop, bottom, left, right = -1, 0, 50, 0\r\ncont = []\r\nfor i in range(rows):\r\n s = input()\r\n if '*' in s:\r\n fIndex = s.index('*')\r\n if top == -1:\r\n top = i\r\n if fIndex < left:\r\n left = fIndex\r\n lIndex = s.rindex('*')\r\n if lIndex > right:\r\n right = lIndex\r\n bottom = i\r\n cont.append(s)\r\n\r\nfor i in range(top, bottom + 1):\r\n print(cont[i][left: right + 1])\r\n\r\n'''\r\ntop = 2\r\nbottom = 5\r\nleft = 0\r\nright = 9\r\n\r\n01234567\r\n89\r\n0..........\r\n1..........\r\n2..... *.*..\r\n3... *..*...\r\n4..........\r\n5.... * .....\r\n6..........\r\n7..........\r\n\r\n** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** **\r\n'''\r\n", "def readln(): return tuple(map(int, input().split()))\r\n \r\nn, m = readln()\r\np = [input() for _ in range(n)]\r\nwhile p[0] == '.' * m:\r\n p = p[1:]\r\nwhile p[-1] == '.' * m:\r\n p.pop()\r\npref = min([_.split('*')[0] for _ in p])\r\nsuf = min([_.split('*')[-1] for _ in p])\r\nfor _ in p:\r\n print(_[len(pref):m - len(suf)])", "n, m = map(int, input().split())\r\ns = [input() for _ in range(n)]\r\na = c = 100\r\nb = d = -1\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif s[i][j]=='*':\r\n\t\t\ta = min(a, i)\r\n\t\t\tb = max(b, i)\r\n\t\t\tc = min(c, j)\r\n\t\t\td = max(d, j)\r\nprint(*[x[c:d+1]for x in s[a:b+1]], sep = '\\n')", "n, m = map(int, input().split())\r\nls = [input() for i in range(n)]\r\nst1=0;st2=n-1\r\nfor i in range(n):\r\n if ls[i].count('*')!=0:\r\n st1 = i\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if ls[i].count('*')!=0:\r\n st2 = i\r\n break\r\npos1 = min([i.find('*') for i in ls if i.count('*')!=0])\r\npos2 = max([i.rfind('*') for i in ls if i.count('*')!=0])\r\nfor i in ls[st1:st2+1]:\r\n print(i[pos1:pos2+1],sep='')", "a, b = map(int, input().split())\r\nbase = []\r\ntrack = []\r\ntrack1 = []\r\nans = []\r\ncount = 0\r\nfor t in range(a):\r\n row = input()\r\n base.append(row)\r\nfor i in range(len(base)):\r\n if '*' in base[i]:\r\n track1.append(i)\r\n for e in range(len(base[i])):\r\n if base[i][e] == '*':\r\n track.append(e)\r\nx, y = min(track), max(track)\r\nc, v = min(track1), max(track1)\r\nwhile c <= v:\r\n ans.append(base[c][x:y+1])\r\n c += 1\r\nfor i in ans:\r\n final = ''.join(i)\r\n print(final)\r\n\r\n", "m, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\n\r\nlst = []\r\nfor i in range(m):\r\n lst.append(input())\r\n\r\nrl = []\r\nfor i in range(m):\r\n if '*' in lst[i]:\r\n rl.append(i)\r\n\r\ncl = []\r\nfor j in range(n):\r\n count = 0\r\n for i in range(m):\r\n if lst[i][j] == '*':\r\n count += 1\r\n break\r\n if count != 0:\r\n cl.append(j)\r\n\r\nfor i in range(min(rl), max(rl)+1):\r\n for j in range(min(cl), max(cl)+1):\r\n print(lst[i][j], end='')\r\n\r\n print()\r\n", "a,b = list(map(int,input().split()))\r\nspis = []\r\nkoords = []#y1 y2 x1 x2\r\nkoords2 = []#x1 x2\r\nwhile True:\r\n try:\r\n spis += [list(input())]\r\n except:\r\n break\r\n#корды идут от 0\r\ni = 0\r\ni2 = 0\r\nwhile i < a:\r\n while i2 < b:\r\n if spis[i][i2] == \"*\":\r\n koords += [i]\r\n koords2 += [i2]\r\n i2 += 1\r\n i2 = 0\r\n i += 1\r\nkoords2 = sorted(koords2)\r\n\r\nkoords = [koords[0]] + [koords[-1]] + [koords2[0]] + [koords2[-1]]\r\n\r\ni = koords[0]\r\ni2 = koords[2]\r\nwhile i <= koords[1]:\r\n while i2 <= koords[3]:\r\n print(spis[i][i2],end=\"\")\r\n i2 += 1\r\n print()\r\n i2 = koords[2]\r\n i += 1", "linhas, cols = input().split()\nlinhas = int(linhas)\nret = []\nflg_linha = True\nini_cima = 0\nini_baixo = 0\nini_esq = None\nini_dir = None\n\nfor linha in range(linhas):\n linha_valores = input()\n ret.append(linha_valores)\n if flg_linha:\n if '*' not in linha_valores:\n ini_cima += 1\n else:\n flg_linha = False\n esq = len(linha_valores) - len(linha_valores.lstrip('.'))\n dire = len(linha_valores) - len(linha_valores.rstrip('.'))\n if ini_esq != None:\n ini_esq = min(esq, ini_esq)\n else:\n ini_esq = esq\n if ini_dir != None:\n ini_dir = min(dire, ini_dir)\n else:\n ini_dir = dire\n else:\n if '*' not in linha_valores:\n ini_baixo += 1\n else:\n ini_baixo = 0\n esq = len(linha_valores) - len(''.join(linha_valores).lstrip('.'))\n dire = len(linha_valores) - len(''.join(linha_valores).rstrip('.'))\n if ini_esq != None:\n ini_esq = min(esq, ini_esq)\n else:\n ini_esq = esq\n if ini_dir != None:\n ini_dir = min(dire, ini_dir)\n else:\n ini_dir = dire\n\nif ini_cima:\n ret = ret[ini_cima:]\nif ini_baixo:\n ret = ret[:-ini_baixo]\nfor n in ret:\n if ini_esq:\n n = n[ini_esq:]\n if ini_dir:\n n = n[:-ini_dir]\n print(n)\n \t \t \t \t \t\t\t\t \t \t\t\t", "n, m = map(int, input().split())\r\n\r\na = []\r\nb = []\r\nd = []\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == '*':\r\n a.append(i)\r\n b.append(j)\r\n d.append(s)\r\n\r\nb.sort()\r\nfor i in range(a[0], a[-1]+1):\r\n print(d[i][b[0]:b[-1]+1])", "n,m=map(int,input().split())\r\nmat=[]\r\n\r\nfor _ in range(n):\r\n s=input()\r\n a=list(s)\r\n mat.append(a)\r\nmiX=n\r\nmaX=-1\r\nmiY=m\r\nmaY=-1\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if(mat[i][j]=='*'):\r\n miX=min(miX,i)\r\n maX=max(maX,i)\r\n miY=min(miY,j)\r\n maY=max(maY,j)\r\nfor i in range(miX,maX+1):\r\n for j in range(miY,maY+1):\r\n print(mat[i][j],end=\"\")\r\n print(end=\"\\n\")\r\n \r\n", "def solve(n):\r\n print(*([1] * n))\r\nn, m = map(int, input().split())\r\nx = []\r\nfor _ in range(n): x += [list(input())]\r\nminx, maxx, miny, maxy = n, -1, m, -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if x[i][j] == '*':\r\n minx = min(minx, i)\r\n maxx = max(maxx, i)\r\n miny = min(miny, j)\r\n maxy = max(maxy, j)\r\nfor i in range(minx, maxx + 1):\r\n print(*x[i][miny:maxy + 1], sep='')\r\n ", "def find_shaded_rectangle(n, m, sheet):\r\n top, left = n, m # Initialize top-left coordinate to maximum values\r\n bottom, right = 0, 0 # Initialize bottom-right coordinate to minimum values\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if sheet[i][j] == '*':\r\n top = min(top, i)\r\n left = min(left, j)\r\n bottom = max(bottom, i)\r\n right = max(right, j)\r\n\r\n # Extract the shaded rectangle from the original sheet\r\n shaded_rectangle = [sheet[i][left:right + 1] for i in range(top, bottom + 1)]\r\n\r\n return shaded_rectangle\r\n\r\n\r\n# Read input\r\nn, m = map(int, input().split())\r\nsheet = [input() for _ in range(n)]\r\n\r\n# Output the result\r\nresult = find_shaded_rectangle(n, m, sheet)\r\nfor row in result:\r\n print(row)\r\n", "n,m=map(int,input().split())\na=[input() for i in range(n)]\ntl_i,tl_j,br_i,br_j=110,110,0,0\nfor i in range(n):\n for j in range(m):\n if a[i][j]=='*':\n tl_i=min(tl_i,i)\n tl_j=min(tl_j,j)\n br_i=max(br_i,i)\n br_j=max(br_j,j)\nfor i in range(tl_i,br_i+1):\n for j in range(tl_j,br_j+1):print(a[i][j],end='')\n print()", "m, n = map(int, input().split(\" \"))\r\ninp = []\r\nfor _ in range(m):\r\n inp.append(input())\r\n \r\nmini, maxi = m-1, 0\r\nminj, maxj = n-1, 0\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n if inp[i][j] == \"*\":\r\n if (i < mini): mini = i\r\n if (i > maxi): maxi = i\r\n if (j < minj): minj = j\r\n if (j > maxj): maxj = j\r\n\r\nprint(\"\\n\".join([x[minj:(maxj+1)] for x in inp[mini:(maxi+1)]]))\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,m = map(int, wtf[0].split())\r\n ans = []\r\n mlid = 0\r\n mfid = 52\r\n sids = []\r\n for i in range(n):\r\n ans.append(wtf[i+1])\r\n if '*' in wtf[i+1]:\r\n sids.append(i)\r\n for j in range(m):\r\n if wtf[i+1][j] == '*':\r\n if j < mfid:\r\n mfid = j\r\n if j > mlid:\r\n mlid = j\r\n n = len(ans)\r\n for i in range(sids[0], sids[-1]+1):\r\n print(ans[i][mfid:mlid+1])\r\n" ]

{"inputs": ["6 7\n.......\n..***..\n..*....\n..***..\n..*....\n..***..", "3 3\n***\n*.*\n***", "1 1\n*", "2 1\n*\n*", "5 1\n.\n*\n.\n.\n.", "1 6\n*****.", "2 2\n..\n*.", "8 2\n..\n..\n..\n..\n..\n*.\n..\n..", "50 1\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n*\n.\n*\n.\n.\n.\n.\n.\n.\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.", "2 1\n*\n.", "5 1\n*\n*\n*\n*\n*", "2 2\n*.\n..", "3 4\n...*\n*...\n..*.", "8 2\n**\n**\n**\n**\n**\n**\n**\n**", "50 1\n.\n*\n*\n*\n.\n.\n*\n.\n*\n*\n*\n*\n*\n*\n*\n.\n*\n*\n*\n*\n*\n*\n*\n*\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."], "outputs": ["***\n*..\n***\n*..\n***", "***\n*.*\n***", "*", "*\n*", "*", "*****", "*", "*", "*\n.\n*\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n*", "*", "*\n*\n*\n*\n*", "*", "...*\n*...\n..*.", "**\n**\n**\n**\n**\n**\n**\n**", "*\n*\n*\n.\n.\n*\n.\n*\n*\n*\n*\n*\n*\n*\n.\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*"]}

UNKNOWN

PYTHON3

CODEFORCES

218

8fc062d952d56f65554254a2fbe9f3e8

none

Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not. Petya loves long lucky numbers very much. He is interested in the minimum lucky number *d* that meets some condition. Let *cnt*(*x*) be the number of occurrences of number *x* in number *d* as a substring. For example, if *d*<==<=747747, then *cnt*(4)<==<=2, *cnt*(7)<==<=4, *cnt*(47)<==<=2, *cnt*(74)<==<=2. Petya wants the following condition to fulfil simultaneously: *cnt*(4)<==<=*a*1, *cnt*(7)<==<=*a*2, *cnt*(47)<==<=*a*3, *cnt*(74)<==<=*a*4. Petya is not interested in the occurrences of other numbers. Help him cope with this task. The single line contains four integers *a*1, *a*2, *a*3 and *a*4 (1<=≤<=*a*1,<=*a*2,<=*a*3,<=*a*4<=≤<=106). On the single line print without leading zeroes the answer to the problem — the minimum lucky number *d* such, that *cnt*(4)<==<=*a*1, *cnt*(7)<==<=*a*2, *cnt*(47)<==<=*a*3, *cnt*(74)<==<=*a*4. If such number does not exist, print the single number "-1" (without the quotes). Sample Input 2 2 1 1 4 7 3 1 Sample Output 4774 -1

[ "a1, a2, a3, a4 = map(int, input().split()) \r\nif a3 == a4 - 1:\r\n if a1 < a4 or a2 < a4:\r\n print(-1)\r\n elif a4 == 1:\r\n print('7' * a2 + '4' * a1)\r\n else:\r\n result = '7' + '4' * (a1 - a4 + 1) + '74' * (a4 - 2) + '7' * (a2 - a4 + 1) + '4'\r\n print(result) \r\nelif a3 == a4:\r\n if a1 < a4 or a2 < a4 or (a1 == a4 and a2 == a4):\r\n print(-1)\r\n elif a1 == a4:\r\n result = '74' * a4 + '7' * (a2 - a4)\r\n print(result)\r\n else:\r\n result = '4' * (a1 - a4) + '74' * (a4 - 1) + '7' * (a2 - a4 + 1) + '4'\r\n print(result)\r\nelif a3 == a4 + 1:\r\n if a1 < a3 or a2 < a3:\r\n print(-1)\r\n elif a3 == 1:\r\n result = '4' * a1 + '7' * a2\r\n print(result)\r\n else:\r\n result = '4' * (a1 - a3 + 1) + '7' + '47' * (a3 - 2) + '4' + '7' * (a2 - a3 + 1)\r\n print(result)\r\nelse:\r\n print(-1)# 1691429596.526085", "a, b, c, d = input().strip().split()\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nd = int(d)\r\n\r\nif abs(c - d) > 1 or min(a, b) < max(c, d) or a == b == c == d:\r\n print(-1)\r\n exit()\r\n\r\nif c == d:\r\n if a == c:\r\n ans = '74' * c + '7' * (b - c)\r\n else:\r\n ans = '4' * (a - c - 1) + '47' * c + '7' * (b - c) + '4'\r\nelif c > d:\r\n ans = '4' * (a - c) + '47' * c + '7' * (b - c)\r\nelse:\r\n ans = '7' + '4' * (a - c) + '74' * (c - 1) + '7' * (b - c) + '4'\r\n\r\nprint(ans)", "a1,a2,a3,a4=map(int,input().split())\n\nL=[]\ndef Solve(a1,a2,a3,a4):\n if(a3-a4<-1 or a3-a4>1 or a1<a3 or a1<a4 or a2<a3 or a2<a4):\n return -1\n\n elif(a3-a4==0):\n Ans=\"47\"*a3\n Ans+=\"4\"\n if(a1-a3==0 and a2-a4==0):\n return -1\n elif(a1-a3==0):\n return \"74\"*a3+\"7\"*(a2-a4)\n return \"4\"*(a1-a3-1)+Ans[:len(Ans)-1]+\"7\"*(a2-a4)+\"4\"\n\n elif(a3-a4==1):\n if(a2==a4):\n return -1\n Ans=\"47\"*a3\n Ans=\"4\"*(a1-a3)+Ans+\"7\"*(a2-a4-1)\n return Ans\n\n else:\n if(a3==a1):\n return -1\n Ans=\"74\"*a4\n Ans=\"7\"+\"4\"*(a1-a3-1)+Ans[1:len(Ans)-1]+\"7\"*(a2-a4)+\"4\"\n return Ans\nprint(Solve(a1,a2,a3,a4))\n\n\n\n\n# Made By Mostafa_Khaled", "a1,a2,a3,a4=map(int,input().split())\r\nif abs(a3-a4)>1:\r\n print(-1)\r\nelif min(a1,a2)<max(a3,a4):\r\n print(-1)\r\nelif a1==a2==a3==a4:\r\n print(-1)\r\nelse:\r\n if a3==a4:\r\n if a1==a3:\r\n print ('74'*a3+'7'*(a2-a3))\r\n else:\r\n print('4'*(a1-a3-1)+'47'*a3+'7'*(a2-a3)+'4')\r\n elif a3>a4:\r\n print('4'*(a1-a3)+'47'*a3+'7'*(a2-a3))\r\n else:\r\n print('7'+'4'*(a1-a3)+'74'*(a3-1)+'7'*(a2-a3)+'4')\r\n", "def s():\r\n a, b, c, d = map(int, input().split())\r\n if a == b == c == d or abs(c - d) > 1 or min(a, b) < max(c, d):print(-1);return\r\n if c == d: ans = '74'*c+'7'*(b - c) if a==c else '4'*(a-c-1)+'47'*c+'7'*(b-c)+'4'\r\n elif c > d: ans = '4' * (a - c) + '47' * c + '7' * (b - c)\r\n else: ans = '7' + '4' * (a - c) + '74' * (c-1) + '7' * (b - c) + '4'\r\n print(ans)\r\ns()\r\n", "import sys\n\na, b, c, d = map(int, sys.stdin.readline().split(' '))\n\nif c == d + 1:\n if a < c or b < c:\n print(-1)\n else:\n ans = '4' * (a - c) + \"47\" * c + '7' * (b - c)\n print (ans)\nelif c + 1 == d:\n if a < d or b < d:\n print(-1)\n else:\n ans = \"74\" * d\n ans = ans[0:1] + '4' * (a - d) + ans[1 : len(ans) - 1] + '7' * (b - d) + ans[len(ans) - 1 : len(ans)]\n print(ans)\nelif c == d:\n if a >= c + 1 and b >= c:\n ans = \"47\" * c + '4'\n ans = '4' * (a - (c + 1)) + ans[0 : len(ans) - 1] + '7' * (b - c) + ans[len(ans) - 1 : len(ans)]\n print(ans)\n elif a == c and b >= c + 1:\n ans = \"74\" * c + '7' + '7' * (b - (c + 1))\n print(ans)\n else:\n print(-1)\nelse:\n print(-1)\n\n\n" ]

{"inputs": ["2 2 1 1", "4 7 3 1", "4 7 4 7", "1 1 1 1", "2 2 1 2", "2 1 2 1", "2 2 2 1", "3 3 1 1", "3 2 1 2", "2 1 3 1", "7 7 1 1", "4 7 2 1", "3 3 2 2", "4 3 2 1", "4 4 2 2", "1000000 1000000 1 1", "1000000 1 1 1", "10 10 3 5", "10 10 3 7", "1 7 1 1", "8 3 2 1", "1000000 1000000 1000000 1000000", "4584 45854 25 685", "1 1 1 2", "3 1000000 3 1", "4 58458 2 1", "845 8549 54 8", "1000000 1000000 100000 100000", "1000000 1000000 499 500", "1000000 1000000 100000 100001", "845488 44884 9945 9944", "7 7 4 5", "7 8 5 4", "1000000 1000000 400000 400001", "4585 4588 98 99", "1000000 2 1 1", "2 100000 1 2", "86451 754 85 84", "98654 4844 1001 1000", "5 5 1 2", "5 5 2 1", "4 4 1 1", "4 4 2 2", "4 4 3 3", "10 9 4 5", "100 100 4 5", "1000000 1000000 1 2", "1000000 1000000 47 46", "1000000 1000000 999999 1000000", "54585 4584 458 954", "6 6 1 3", "6 6 2 3", "6 10 2 1", "7 3 1 1", "47 74 8 9", "458445 445 6 7", "1000000 1000000 10000 10001", "1000000 1000000 978 977", "7 1000 1 2", "1 10 1 1", "70 60 20 21", "57 59 3 4", "10 10 5 5", "69 84 25 24", "25 94 11 12", "1 1000000 4 5", "7 1000000 2 3", "1000000 1 1 1", "45 65 31 32", "31 32 30 31", "1 1000000 1 1", "2 1000000 1 1", "50000 1000000 1 1", "74544 1 1 1", "2 2 3 4", "1 1000 2 1", "1 10 1 2", "1000000 1000000 1000000 999999", "1 2 1 1", "2 1 1 1", "2 2 2 1", "2 2 2 2", "1 3 1 1", "1 4 1 1", "2 3 2 2", "2 5 2 2", "1 2 2 1", "10 100 2 2", "3 4 3 3", "30 30 29 29", "10 10 1 2", "999999 1000000 999999 999999", "10 11 1 1", "10 10 2 2", "100 200 5 5", "10 11 10 10", "5 10 2 3", "6 8 1 1", "1 9 2 2"], "outputs": ["4774", "-1", "-1", "-1", "7474", "-1", "4747", "447774", "74474", "-1", "44444477777774", "44474777777", "474774", "4447477", "44747774", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "-1", "-1", "74777777", "44444447477", "-1", "-1", "-1", "-1", "4447477777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777...", "-1", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "74447474747774", "444747474747777", "7444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7477777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7444477774", "4444747777", "44477774", "44747774", "47474774", "7444444747474777774", "74444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444447474747777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777774", "7444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747...", "-1", "-1", "744447477774", "4444474777777777", "4444447774", "7444444444444444444444444444444444444444747474747474747777777777777777777777777777777777777777777777777777777777777777774", "7444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "7444444777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777...", "74777777777", "7444444444444444444444444444444444444444444444444447474747474747474747474747474747474747477777777777777777777777777777777777777774", "74444444444444444444444444444444444444444444444444444447474777777777777777777777777777777777777777777777777777777774", "44444747474747777774", "444444444444444444444444444444444444444444444747474747474747474747474747474747474747474747474777777777777777777777777777777777777777777777777777777777777", "74444444444444474747474747474747474777777777777777777777777777777777777777777777777777777777777777777777777777777777774", "-1", "7444447477777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "74444444444444474747474747474747474747474747474747474747474747474747474747477777777777777777777777777777777774", "747474747474747474747474747474747474747474747474747474747474774", "7477777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777...", "4777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "4444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444...", "-1", "-1", "-1", "4747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474...", "747", "474", "4747", "-1", "7477", "74777", "74747", "7474777", "-1", "44444444747777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777774", "7474747", "474747474747474747474747474747474747474747474747474747474774", "74444444447777777774", "7474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747474747...", "444444444777777777774", "44444444747777777774", "444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444447474747477777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777774", "747474747474747474747", "744474777777774", "44444777777774", "-1"]}

UNKNOWN

PYTHON3

CODEFORCES

6

8fca4ffe8f07d1e257b834639a4873d8

Hulk

Dr. Bruce Banner hates his enemies (like others don't). As we all know, he can barely talk when he turns into the incredible Hulk. That's why he asked you to help him to express his feelings. Hulk likes the Inception so much, and like that his feelings are complicated. They have *n* layers. The first layer is hate, second one is love, third one is hate and so on... For example if *n*<==<=1, then his feeling is "I hate it" or if *n*<==<=2 it's "I hate that I love it", and if *n*<==<=3 it's "I hate that I love that I hate it" and so on. Please help Dr. Banner. The only line of the input contains a single integer *n* (1<=≤<=*n*<=≤<=100) — the number of layers of love and hate. Print Dr.Banner's feeling in one line. Sample Input 1 2 3 Sample Output I hate it I hate that I love it I hate that I love that I hate it

[ "import sys\n\ndef inp():\n return int(input())\n\n\ndef inlt():\n return list(map(int, input().split()))\n\n\ndef insr():\n return input().strip()\n\n\ndef out(x):\n sys.stdout.write(str(x) + \"\\n\")\n\ndef main():\n count = inp()\n ans = \"\"\n \n feelings = [\" I love\", \" I hate\"] \n for i in range(1, count + 1):\n ans += feelings[i%2]\n if i < count:\n ans += \" that\" \n \n ans += \" it\"\n out(ans)\n \nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\nimport sys\r\ns = 'I hate '\r\ns2 = 'I love '\r\nss = ''\r\nif n == 1: print(s+\"it\"); sys.exit()\r\nfor i in range(n):\r\n if (i+1) % 2 == 1 and i != n-1:\r\n ss = ss + s + \"that \"\r\n elif (i+1) % 2 == 0 and i != n-1:\r\n ss = ss + s2 + \"that \"\r\n if (i+1) % 2 == 0 and i == n-1:\r\n ss = ss + s2 + \"it\"\r\n elif (i+1) % 2 == 1 and i == n-1:\r\n ss = ss + s + \"it\"\r\n\r\nprint(ss)", "n = int(input())\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n print('I hate', end=' ')\r\n else:\r\n print('I love', end=' ')\r\n\r\n if i == n - 1:\r\n print('it')\r\n else:\r\n print('that', end=' ')", "n=int(input())\r\nf=[]\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n f.append(\"I hate\")\r\n else:\r\n f.append(\"I love\")\r\n if i!=n:\r\n f.append(\"that\")\r\nf.append(\"it\")\r\nx=' '.join(f)\r\nprint(x)\r\n", "color = int(input())\r\nsentence = \"\"\r\n\r\nfor i in range(color):\r\n if i % 2 == 0:\r\n sentence += 'I hate that '\r\n else:\r\n sentence += 'I love that '\r\nsentence = sentence.split(' ')\r\nsentence[-2] = 'it '\r\nprint(' '.join(sentence))\r\n\r\n", "sentences = (['I hate', 'I love'] * 50)[:int(input())]\r\nprint(*sentences, sep=' that ', end=' it')\r\n", "numero = int(input(\"\"))\r\nif numero>100 or numero<1:\r\n exit(1)\r\ni=1\r\ntexto = ''\r\nwhile i < numero:\r\n if i%2 != 0:\r\n texto = texto + 'I hate that '\r\n else:\r\n texto = texto + 'I love that '\r\n i = i + 1\r\nif i%2 !=0:\r\n texto = texto + 'I hate it'\r\nelse:\r\n texto = texto + 'I love it'\r\nprint(texto)", "n = int(input())\r\nwords = {1: 'I hate that', 0: 'I love that', 2: 'I love it', 3: 'I hate it'}\r\nresult = ''\r\nfor i in range(1, n + 1):\r\n if i != n:\r\n result += words[i % 2]\r\n result += ' '\r\n else:\r\n result += words[i % 2 + 2]\r\nprint(result)", "n = int(input())\r\nhulkf = []\r\nfor i in range(1,n+1):\r\n if i%2 == 1:\r\n hulkf.append('I hate') \r\n else:\r\n hulkf.append('I love') \r\nprint(f'{\" that \".join(hulkf)} it')", "a = int(input())\r\nres = \"\"\r\nb = \"I hate \"\r\nc = \"I love \"\r\nfor i in range(a):\r\n if i % 2 == 0:\r\n res += b\r\n else:\r\n res += c\r\n if i != a - 1:\r\n res += \"that \"\r\n else:\r\n res += \"it\"\r\nprint(res)\r\n", "n = int(input())\r\nstr = \"\"\r\ni = 1\r\nwhile i < n:\r\n if i % 2 != 0:\r\n print(\"I hate\",end=\" \")\r\n if i % 2 == 0:\r\n print(\"I love\",end=\" \")\r\n print(\"that\",end=\" \")\r\n i += 1\r\nif n % 2 == 0:\r\n print(\"I love it\")\r\nelse:\r\n print(\"I hate it\")\r\n", "p=int(input())\r\nf=[]\r\nfor i in range(1,p+1):\r\n if i%2==1:\r\n f.append(\"I hate\")\r\n else:\r\n f.append(\"I love\")\r\n if i!=p:\r\n f.append(\"that\")\r\nf.append(\"it\")\r\ndoc=' '.join(f)\r\nprint(doc)", "n = int(input()) \r\na = []\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n a.append(\"I hate\")\r\n else:\r\n a.append(\"I love\")\r\n if i < n - 1:\r\n a.append(\"that\")\r\na.append(\"it\")\r\nfinal = ' '.join(a)\r\n\r\nprint(final)\r\n ", "inp = int(input())\r\ns = 'I hate'\r\np = 'I love'\r\nres = \"\"\r\n#I hate that I love that I hate it\r\nfor i in range(inp):\r\n j = i+1\r\n if j%2 == 1:\r\n res = res+s+' that'+' '\r\n \r\n else:\r\n res =res+p+' that'+' '\r\nprint(res[0:len(res)-5] +'it')\r\n ", "from collections import Counter\r\nimport math\r\nN = int(input())\r\nls = []\r\nfor i in range(N):\r\n if i % 2 == 0:\r\n ls.append('I hate')\r\n else:\r\n ls.append('I love')\r\n\r\n\r\nprint(' that ' .join(ls) + ' it')\r\n", "n = int(input())\r\nspeech = 'I '\r\n\r\n\r\nfor i in range(n-1):\r\n if i%2==0:\r\n speech+='hate that I '\r\n else:\r\n speech+='love that I '\r\n\r\nprint(speech+'hate it' if n%2==1 else speech+'love it')\r\n\r\n ", "def hulk():\r\n n=int(input(''))\r\n i=1\r\n while i <= n:\r\n if i%2!=0:\r\n print('I hate',end=' ')\r\n else:\r\n print('I love',end=' ')\r\n if i<n:\r\n print('that',end=' ')\r\n if i==n:\r\n print('it')\r\n i+=1\r\nhulk()", "n = int(input())\r\ns = \"that I hate \"\r\nt = \"that I love \"\r\nm = \"I hate \"\r\nfor i in range(1,n):\r\n if i%2 == 0:\r\n m+=s \r\n else:\r\n m+=t\r\nprint(m + \"it\")", "l = int(input())\r\nif l == 1:\r\n st = \"I hate it\"\r\nelse:\r\n st = \"I hate that\"\r\n for i in range(1,l):\r\n if (i+1)%2==0:\r\n if (i)==l-1:\r\n st+=\" I love it\"\r\n else:\r\n st+=\" I love that\"\r\n else:\r\n if i==l-1:\r\n st+=\" I hate it\"\r\n else:\r\n st+=\" I hate that\"\r\nprint(st)", "n=int(input())\r\nd=\"\"\r\nif n==1:\r\n print(\"I hate it\")\r\nelif n==2:\r\n print(\"I hate that I love it\")\r\nelif n==3:\r\n print(\"I hate that I love that I hate it\")\r\nelse:\r\n d+=\"I hate that I love that \"\r\n for i in range(3,n):\r\n if i%2==0:\r\n d+=\"I love that \"\r\n else:\r\n d+=\"I hate that \"\r\n if n%2==0:\r\n d+=\"I love it\"\r\n else:\r\n d+=\"I hate it\"\r\nprint(d)", "n=int(input())\r\nif n==1:\r\n print('I hate it')\r\nelse:\r\n for k in range(n):\r\n if (k%2==0):\r\n print('I hate ',end='')\r\n else:\r\n print('I love ',end='')\r\n if (k!=n-1):\r\n print('that ',end='')\r\n else:\r\n print('it',end='')\r\n \r\n \r\n", "# Version 16.0\r\ndef main() -> None:\r\n # 2023-07-16 22:01:27\r\n n = ii()\r\n store = []\r\n idx = 0\r\n while idx < n:\r\n if idx % 2 == 0: store.append('I hate')\r\n else: store.append('I love')\r\n idx+=1\r\n ans = \" that \".join(store)\r\n p(f\"{ans+' it'}\")\r\n\r\n \r\nif __name__ == \"__main__\":\r\n import os,sys,math,itertools;from collections import deque,defaultdict,OrderedDict,Counter\r\n from bisect import bisect,bisect_left,bisect_right,insort\r\n from heapq import heapify,heappush,heappop,nsmallest,nlargest,heapreplace, heappushpop\r\n ii,si=lambda:int(input()),lambda:input() \r\n mi,msi=lambda:map(int,input().strip().split(\" \")),lambda:map(str,input().strip().split(\" \")) \r\n li,lsi=lambda:list(mi()),lambda:list(msi())\r\n out,export,p,pp=[],lambda:print('\\n'.join(map(str, out))),lambda x :out.append(x),lambda array:p(' '.join(map(str,array)))\r\n try:exec('from hq import L,LT,see,info,cmdIO,_generator_\\nline=[cmdIO(),main(),export(),_generator_()]\\nfor l in line:l')\r\n except(FileNotFoundError,ModuleNotFoundError):main();export()", "n=int(input())\r\ns=\"\"\r\nif n==1:\r\n s=\"I hate it\"\r\nelif n==2:\r\n s=\"I hate that I love it\"\r\nelse:\r\n for i in range(n):\r\n if i%2==0:\r\n s+=\"I hate \"\r\n else:\r\n s+=\"I love \"\r\n if i!=n-1:\r\n s+=\"that \"\r\n else:\r\n s+=\"it\"\r\nprint(s)", "import sys\r\ndef read_input():\r\n return sys.stdin.readline().rstrip()\r\nstr1 = \"I hate\"\r\nstr2 = \"I love\"\r\nnum1 = int(read_input())\r\noutput = []\r\nfor x in range(num1):\r\n if x % 2 == 0:\r\n output.append(str1)\r\n else:\r\n output.append(str2)\r\noutput[-1] += \" it\"\r\nprint(\" that \".join(output))\r\nimport sys", "n=int(input())\r\ns=\"I hate it\"\r\nx=\"I love it\"\r\nm=\"I hate that \"\r\nv=\"I love that \"\r\nif n==1:\r\n print(s)\r\n exit()\r\nelif n==2:\r\n print(m+x)\r\n exit()\r\nfor i in range(1,n+1):\r\n if i==n:\r\n if n%2==0:\r\n print(x,end=\"\")\r\n elif n%2!=0:\r\n print(s,end=\"\")\r\n exit()\r\n if i %2!=0:\r\n print(m,end=\"\")\r\n elif i%2==0:\r\n print(v,end=\"\")", "n= int(input())\r\nfor i in range(1,n):\r\n if(i%2!=0):\r\n print(\"I hate that \", end=\"\")\r\n if(i%2==0):\r\n print(\"I love that \", end=\"\")\r\nif(n%2!=0):\r\n print(\"I hate it\", end=\"\")\r\nif(n%2==0):\r\n print(\"I love it\", end=\"\")", "n = int(input())\r\nprint((\"I hate that I love that \" * (n // 2) + \"I hate that \" * (n % 2))[:-5] + \"it\")", "n = int(input())\r\nlst1 = []\r\nfor i in range(n):\r\n if i % 2 != 0:\r\n lst1.append(\"I love\")\r\n else:\r\n lst1.append(\"I hate\")\r\ny = \" that \".join(lst1)\r\nprint(y, \"it\")", "n = int(input())\r\n\r\ndef message_hulk(n):\r\n message = []\r\n for i in range(1, n+1):\r\n if i%2!=0:\r\n message.append('I hate ')\r\n else:\r\n message.append('I love ')\r\n if i!=n:\r\n message.append('that ')\r\n message.append('it')\r\n return ''.join(message)\r\n\r\nprint(message_hulk(n))", "n=int(input())\r\nl=\"\"\r\nfor i in range(n-1):\r\n if(i%2==0):\r\n l=l+\"I hate that \"\r\n else:\r\n l=l+\"I love that \"\r\nif(n%2!=0):\r\n l=l+\"I hate it\"\r\nelse:\r\n l=l+\"I love it\"\r\nprint(l)", "\r\ndef solve():\r\n n = int(input())\r\n return \" \".join(\r\n list(\r\n map(lambda i: \"I hate it\" if i %\r\n 2 != 0 else \"I love it\", list(range(1, n+1)))\r\n )\r\n ).replace(\"it\", \"that\", n - 1)\r\n\r\n\r\nprint(solve())\r\n", "n=int(input())\r\ns=\"I hate \"\r\nfor i in range(0,n-1):\r\n if i%2==0:\r\n s=s+\"that I love \"\r\n else:\r\n s=s+\"that I hate \"\r\ns=s+\"it\"\r\nprint(s)", "cnt = int(input())\r\nx = 'I hate that'\r\nfor i in range (2, cnt+1):\r\n if i % 2 == 0:\r\n x += ' I love that'\r\n elif i % 2 != 0:\r\n x += ' I hate that'\r\nxzc = x[:-4] + 'it'\r\nprint(xzc)", "n = int(input())\r\n\r\nprint(\"I hate \", end =\"\")\r\n\r\nfor i in range(n-1):\r\n if i % 2 == 0: print(\"that I love \", end =\"\")\r\n else: print(\"that I hate \", end =\"\")\r\n\r\nprint(\"it\")\r\n", "n = int(input())\r\nst = \"\"\r\nif n == 1:\r\n print(\"I hate it\")\r\nelse:\r\n for i in range(1,n+1):\r\n if i % 2 == 0:\r\n st += \"love\"+\" that I \"\r\n else:\r\n st += \"hate\"+\" that I \"\r\n print(\"I \" + st[:-7] + \"it\")", "n = int(input())\r\n\r\nt = [\"that\",\"it\"]\r\n\r\nfor i in range(n):\r\n if i == n-1:\r\n tp = t[1]\r\n else:\r\n tp = t[0]\r\n if (i+1) % 2 == 0:\r\n print(\"I love \" + tp ,end = \" \")\r\n else:\r\n print(\"I hate \" + tp ,end = \" \")\r\n \r\n\r\n", "n = int(input())\r\na = 'I hate'\r\nb = 'I love'\r\nc = 'that'\r\ns = 'I hate'\r\nfor i in range(2,n+1):\r\n if i%2 != 0:\r\n s = s + \" \" + c + ' '+ a\r\n else:\r\n s = s + ' ' + c + ' '+b\r\nprint(s+ ' ' + 'it')", "n = int(input())\r\nfeelings = ['I hate' if i % 2 == 0 else 'I love' for i in range(n)]\r\nexpression = ' that '.join(feelings)\r\nprint(expression, end=' it')\r\n", "n = int(input())-1\r\na = \"I hate \"\r\nf = 1\r\nfor i in range(n):\r\n if f:\r\n a += \"that I love \"\r\n f = 0\r\n else:\r\n a += \"that I hate \"\r\n f = 1\r\na += \"it\"\r\nprint(a)\r\n\r\n", "n = int(input())\r\n\r\nh = 'I hate '\r\n\r\nl = 'I love '\r\n\r\nd1 = 'that '\r\n\r\nd2 = 'it'\r\n\r\narr = []\r\n\r\nfor i in range(n):\r\n\r\n if i % 2 == 0:\r\n \r\n arr.append(h)\r\n \r\n else:\r\n \r\n arr.append(l)\r\n \r\n if i < n-1: \r\n arr.append(d1)\r\n \r\narr.append(d2) \r\n\r\nprint(''.join(arr))", "# LUOGU_RID: 113687866\ndef main():\r\n n=int(input())\r\n print('I hate ',end='')\r\n for i in range(1,n):\r\n if i&1:\r\n print('that I love ',end='')\r\n else:\r\n print('that I hate ',end='')\r\n print('it')\r\nmain()", "a = int(input(''))\r\n\r\nresult = ''\r\n\r\nfor j in range(a):\r\n if j%2 == 0:\r\n result = result + 'I hate '\r\n if j != a-1:\r\n result = result + 'that '\r\n else:\r\n result = result + 'I love '\r\n if j != a-1:\r\n result = result + 'that '\r\n\r\n if j == a-1:\r\n result = result + 'it'\r\n\r\n\r\nprint(result)\r\n", "n=int(input())\r\nif n%2==0:\r\n\tn//=2\r\n\ts=\" that \".join(i for i in [\"I hate that I love\"]*n)\r\nelif n%2==1 and n>1:\r\n\tn//=2\r\n\ts=\" that \".join(i for i in [\"I hate that I love\"]*n)+\" that I hate\"\r\nelse: \r\n\ts=\"I hate\"\r\n\r\nprint(s+\" it\")\r\n", "N = int(input())\r\nM = []\r\nfor i in range(1, N+1):\r\n if(i%2==1):\r\n M.append(\"I hate\")\r\n else:\r\n M.append(\"I love\")\r\n if(i!=N):\r\n M.append(\"that\")\r\nM.append(\"it\")\r\nprint(\" \".join(M))", "def solve():\r\n k=int(input())\r\n ans=\"\"\r\n for i in range(k):\r\n if i%2==0:\r\n ans+=\"I hate that \"\r\n else:\r\n ans+=\"I love that \"\r\n ans=ans[0:len(ans)-5]\r\n ans+=\"it\"\r\n print(ans)\r\n# t=int(input())\r\n# i=1\r\n# while i<=t:\r\nsolve()\r\n # i+=1\r\n \r\n", "n=int(input())\r\nif n == 1:\r\n print(\"I hate it\")\r\nelse:\r\n lst = [\"I hate\", \"I love\"]\r\n ans = \"\"\r\n\r\n for i in range(n-1):\r\n ans += lst[i % 2] + \" that \"\r\n\r\n ans += lst[(n-1) % 2] + \" it\"\r\n print(ans)", "def main() :\r\n print(banners_Feeling(input_Layer_Count()))\r\n\r\ndef banners_Feeling(total_layer_count) :\r\n stacked_layer_count = 1\r\n \r\n banners_feeling = \"I hate\"\r\n while stacked_layer_count < total_layer_count :\r\n banners_feeling += (\" that I hate\" if stacked_layer_count%2 == 0 else \" that I love\")\r\n stacked_layer_count += 1\r\n\r\n return banners_feeling + \" it\"\r\n\r\ndef input_Layer_Count() :\r\n return int(input())\r\n\r\nmain()", "num=int(input())\r\nfor i in range(1,num+1):\r\n if(i %2 !=0):\r\n print(\"I hate \",end=\"\")\r\n else:\r\n print(\"I love \",end=\"\")\r\n if(i !=num):\r\n print(\"that \",end=\"\")\r\n else:\r\n print(\"it\",end=\"\")", "n = int(input())\r\na = []\r\nfor i in range(1, n):\r\n if i%2 == 0:\r\n a.append(\"I love that \")\r\n elif i%2 == 1:\r\n a.append(\"I hate that \")\r\nif n%2 == 0:\r\n a.append(\"I love it\")\r\nelif n%2 != 0:\r\n a.append(\"I hate it\")\r\nfor i in a:\r\n print (i, end= \"\")", "n = int(input())\r\nk = ''\r\nfor i in range(1, n+1):\r\n if i%2 != 0:\r\n k += 'I hate'\r\n else: k+= 'I love'\r\n if i != n:\r\n k += ' that '\r\n else: k+= ' it'\r\nprint(k)", "n = int(input())\r\noddString = \"I hate \"\r\nevenString = \"I love \"\r\nendingLetter1 = \"it\"\r\nendingLetter2 = \"that \"\r\nresult = \"\"\r\nfor i in range(1,n+1):\r\n if i%2 == 0:\r\n result += evenString\r\n if i==n:\r\n result += endingLetter1\r\n else:\r\n result += endingLetter2\r\n else:\r\n result += oddString\r\n if i==n:\r\n result += endingLetter1\r\n else:\r\n result += endingLetter2\r\nprint(result)\r\n", "n = int(input())\r\nlayers = ['I hate ', 'I love '] * 50\r\nprint('that '.join(layers[:n]) + 'it')\r\n", "def hate():\r\n s = \"\"\r\n s += \"I hate \"\r\n return s\r\n\r\ndef love():\r\n s = \"\"\r\n s += \"I love \"\r\n return s\r\n\r\n\r\nn = int(input())\r\nl = [hate(), love()]*n\r\ni = 0\r\ns = \"\"\r\nwhile n > 0:\r\n s += l[i]\r\n i += 1\r\n n -= 1\r\n if n != 0:\r\n s += \"that \"\r\ns += \"it\"\r\nprint(s)", "def getStr(n: int, flag :bool) -> str:\r\n if n == 1:\r\n return 'I hate it' if flag else 'I love it'\r\n return ('I hate that ' if flag else 'I love that ') + getStr(n - 1, not flag)\r\n\r\nprint(getStr(int(input()), True))", "n=int(input())\r\ns=\"\"\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\ts=s+\"I hate\"\r\n\telse:\r\n\t\ts=s+\"I love\"\r\n\tif i<n-1:\r\n\t\ts=s+\" that \"\r\ns=s+\" it\"\r\nprint(s)", "n=int(input())\r\ns='I hate'\r\nfor i in range(1,n):\r\n if (i+1)%2==0:\r\n s+=' that I love'\r\n else:\r\n s+=' that I hate'\r\nprint(s+' it')", "n=int(input())\r\ns=\"\"\r\nfor i in range(1,n+1):\r\n if(i%2!=0):\r\n if(i==1):\r\n s=s+' I hate '\r\n else:\r\n s=s+'I hate '\r\n if(i==n):\r\n s=s+'it'\r\n else:\r\n s=s+'that '\r\n else:\r\n s=s+'I love '\r\n if(i==n):\r\n s=s+'it'\r\n else:\r\n s=s+'that '\r\nprint(s)\r\n ", "lol = ''\r\nE = int(input())\r\nfor i in range(E):\r\n if i % 2 == 0:\r\n lol += 'I hate '\r\n else:\r\n lol += 'I love '\r\n if i != E - 1:\r\n lol += 'that '\r\n else:\r\n lol += 'it '\r\nprint(lol)\r\n", "n = int(input())\r\na=\"I hate\"\r\nfor i in range(2,n+1):\r\n if i%2==0:\r\n a+=\" that I love\"\r\n else:\r\n a+=\" that I hate\"\r\na+=\" it\"\r\nprint(a)", "n=int(input())\r\ns1=\"I hate \"\r\ns2=\"I love \"\r\ns=\"\"\r\nfor i in range(n):\r\n if(i%2!=0):\r\n s+=s2\r\n else:\r\n s+=s1\r\n if(i+1<n):\r\n s+=\"that \"\r\ns+=\"it\"\r\nprint(s)", "n=int(input())\r\ndef feelings(n):\r\n if n==1:\r\n return \"I hate \"\r\n if n==2:\r\n return \"I hate that I love \"\r\n if n==3:\r\n return \"I hate that I love that I hate \"\r\n elif n%2==0 and n>2:\r\n s=feelings(2)\r\n for i in range(1,n//2):\r\n s= s + \"that \"+ feelings(2)\r\n return s\r\n elif n%2 !=0 and n>3:\r\n s=\"\"\r\n for i in range(0,n//2):\r\n s=s+ feelings(2) +\"that \"\r\n s=s+feelings(1)\r\n return s\r\n \r\ns=feelings(n)\r\nprint(s+ \"it\")\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ndic = {1:\"I hate it\",2:\"I love it\"}\r\nres = \"\"\r\nfor i in range(1,n):\r\n if i%2==0:\r\n res += dic[2]\r\n else:\r\n res += dic[1]\r\n \r\nres = res.replace('it','that ')\r\n\r\nif n%2==0:\r\n res += dic[2]\r\nelse:\r\n res += dic[1]\r\n \r\nprint(res)", "n = int(input())\r\nif n == 1:\r\n print(\"I hate it\")\r\n exit()\r\n\r\nlst = [\"I\", \"that\"]\r\nlst2 = lst.copy() * n\r\nlst2.pop()\r\nlst2.append(\"it\")\r\n\r\nfor i in range(n):\r\n temp = 3 * i + 1\r\n if i % 2 == 0:\r\n word = 'hate'\r\n else:\r\n word = 'love'\r\n\r\n lst2.insert(temp, word)\r\n\r\nprint(*lst2)", "n = int(input())\r\n\r\nop = \"I hate\"\r\ni = 2\r\n\r\nwhile n >= i:\r\n if i % 2 == 0:\r\n op += \" that I love\"\r\n else:\r\n op += \" that I hate\"\r\n i += 1\r\n\r\nprint(op + \" it\")\r\n", "n = int(input())\r\nans = \"I hate that I love that \"*(n//2)\r\nif n%2==1:\r\n ans+=\"I hate it\"\r\nelse:\r\n ans = ans[:-5]+\"it\"\r\nprint(ans)", "n = int(input())\r\n\r\nif n==1:\r\n print(\"I hate it\")\r\nelse:\r\n \r\n str=\"\"\r\n \r\n for i in range(1,n):\r\n if i%2!=0:\r\n str+=\"I hate that \"\r\n if i%2==0:\r\n str+=\"I love that \"\r\n \r\n if n%2==0:\r\n print(str+\"I love it\")\r\n \r\n if n%2!=0:\r\n print(str+\"I hate it\")", "a=int(input(\" \"))\r\nfor i in range(1,a+1):\r\n if i==(a):\r\n if i%2==0:\r\n print(\"I love it\")\r\n else:\r\n print(\"I hate it\")\r\n elif i%2==0:\r\n print(\"I love that \",end=\"\")\r\n else:\r\n print(\"I hate that \",end=\"\")\r\n", "demo = \"\"\r\nn = int(input())\r\nfor i in range(1, n+1,1):\r\n if i == n:\r\n if i%2!=0:\r\n demo+= \"I hate it\"\r\n else:\r\n demo+=\"I love it\"\r\n else:\r\n if i%2!=0:\r\n demo+=\"I hate that \"\r\n else:\r\n demo+=\"I love that \"\r\nprint(demo)", "a = eval(input())\r\ns = ''\r\nflag = False\r\nwhile a!=0:\r\n if flag and a!=1:\r\n s+='I love that '\r\n elif not flag and a!=1:\r\n s+='I hate that '\r\n else:\r\n if flag:\r\n s+='I love it'\r\n else:\r\n s+='I hate it'\r\n a-=1\r\n flag = not flag\r\nprint(s)", "while True:\r\n n = int(input())\r\n if 1 <= n <= 100:\r\n break\r\n\r\nliefde = \"I love that \"\r\nhaat = \"I hate that \"\r\nliefdeslot = \"I love it \"\r\nhaatslot = \"I hate it \"\r\n\r\ngevoel = \"\"\r\n\r\nfor x in range(1,n+1,1):\r\n if x%2 == 0 and x == n:\r\n gevoel += liefdeslot\r\n break\r\n elif x % 2 == 1 and x == n:\r\n gevoel += haatslot\r\n break\r\n elif x%2 == 0:\r\n gevoel += liefde\r\n else:\r\n gevoel += haat\r\n\r\nprint(gevoel)\r\n", "n=int(input())\r\nfeel=[]\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n feel.append(\"I hate\")\r\n else:\r\n feel.append(\"I love\")\r\n if i!=n:\r\n feel.append(\"that\")\r\nfeel.append(\"it\")\r\ndoc=' '.join(feel)\r\nprint(doc)\r\n", "#Created by AMIRHANPRO\r\nn=int(input())#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\nl=[]#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\ni=0#AMIRHANPRO#AMIRHANPRO\r\n#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\nwhile (i<n):#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n l.append(\"I hate that\")#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n i += 1#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n if (i == n):#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n break#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n l.append(\" I love that \")#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n i +=1#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n if (i == n):#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n break#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\nif (l[n-1]==\"I hate that\"):#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n l[n-1]=l[n-1][:7]+\"it\"#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\nelse:#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n l[n-1]=l[n-1][:8]+\"it\"#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\n #AMIRHANPRO#AMIRHANPRO#AMIRHANPRO\r\nprint(''.join(l))#AMIRHANPRO#AMIRHANPRO#AMIRHANPRO", "n = int(input())\r\nf = \"h\"\r\ns = \"\"\r\nfor i in range(n):\r\n if f == \"h\":\r\n s += \"I hate that \"\r\n f = \"l\"\r\n else:\r\n s += \"I love that \"\r\n f = \"h\"\r\n if i+1 == n:\r\n s = s[:-5]\r\n s += \"it\"\r\n \r\nprint(s)\r\n", "feeling_number = int(input())\r\nfirst = \"I hate\"\r\nsecond = \"I love\"\r\nhulk_felling = []\r\nx = 1\r\nfor _ in range(feeling_number):\r\n if x % 2 != 0:\r\n hulk_felling.append(first)\r\n else:\r\n hulk_felling.append(second)\r\n x += 1\r\nhulk_felling = \" that \".join(hulk_felling) + \" it\"\r\nprint(hulk_felling)", "def solve(n):\r\n if n == 1:\r\n print(\"I hate it\")\r\n return\r\n s = \"I hate\"\r\n for i in range(n - 1):\r\n if i % 2 == 0:\r\n s += \" that I love\"\r\n else:\r\n s += \" that I hate\"\r\n s += \" it\"\r\n print(s)\r\n\r\n\r\nn = int(input())\r\nsolve(n)\r\n\r\n", "user_input = int(input())\r\nresponse = \"\"\r\n\r\nfor i in range(1, 1+user_input):\r\n if i % 2 == 1:\r\n response += \"I hate that \"\r\n else:\r\n response += \"I love that \"\r\n\r\nresponse = response.replace(\"that \", \"&\", user_input)\r\nresponse = response.replace(\"&\", \"that \", user_input - 1)\r\nresponse = response.replace(\"&\", \"\")\r\nresponse += \"it\"\r\n\r\nprint(response)", "n=int(input());ans=''\r\nfor i in range(1,n+1):\r\n if i&1==1:\r\n ans+='I hate '\r\n else:\r\n ans+='I love '\r\n if i!=n:\r\n ans+='that '\r\n\r\nans+='it'\r\nprint(ans)", "n = int(input())\r\nch = \"\"\r\nif n == 1:print(\"I hate it\")\r\nfor i in range(1,(n//2)+1):\r\n ch += \"I hate that \"\r\n if i < n//2:\r\n ch += \"I love that \"\r\n else:\r\n if n%2==0:ch += \"I love it\"\r\n else: ch += \"I love that I hate it\"\r\n \r\n \r\n\r\n\r\nprint(ch)", "n = int(input())\r\nst = \"I hate\"\r\nst2 = \"I love\"\r\nfinal = \"I hate\"\r\nfor i in range(n-1):\r\n if n == 1:\r\n print(\"I hate it\")\r\n exit()\r\n elif i % 2 == 0 and n != 1:\r\n final += \" that \" + st2\r\n else:\r\n final = final + \" that \" + st\r\n\r\nprint(final + \" it\")", "n=int(input())\r\nhate=\"I hate\"\r\nlove=\"I love\"\r\ns=\"\"\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n s+=\" \"+hate+\" that\"\r\n else:\r\n s+=\" \"+love+\" that\"\r\n\r\nif s.endswith(\"that\") :\r\n s1=s[:-4]+\"it\"\r\n print(s1.strip())\r\n \r\n \r\n ", "n = int(input())\n#p = list(map(int,input().split()))\nf = []\nfor i in range(1,n+1):\n if i%2 == 1:\n f.append(\"I hate\")\n else:\n f.append(\"I love\")\n if i != n:\n f.append(\"that\")\nf.append(\"it\")\nprint(\" \".join(f))\n", "def hate_love():\r\n hate = \"I hate\"\r\n love = \"I love\"\r\n steps = int(input())\r\n result = \"\"\r\n for i in range(1, steps + 1):\r\n if i != 1:\r\n result += ' that '\r\n if i % 2 != 0:\r\n result += hate\r\n else:\r\n result += love\r\n return result + ' it'\r\nprint(hate_love())", "n=int(input())\r\nif n%2==0:\r\n c=(n//2)-1\r\n print(\"I hate that I love that \"*c,end=\"I hate that I love it\")\r\nelse:\r\n d=n//2\r\n print(\"I hate that I love that \"*d,end=\"I hate it\")", "n = int(input())\r\nfeelings = [\"I hate\", \"I love\"]\r\n\r\nresult = \"I hate \"\r\nfor i in range(2, n+1):\r\n result += 'that '\r\n if i % 2 == 0:\r\n result += feelings[1] + \" \"\r\n else:\r\n result += feelings[0] + \" \"\r\nprint(result.strip() + \" it\")", "n = int(input())\r\na = \"I hate\"\r\nb = \"I love\"\r\ns = \"I hate\"\r\nfor i in range(n-1):\r\n if i%2!=0:\r\n s += \" that \" + a \r\n else:\r\n s += \" that \" + b\r\nprint(s + \" it\")\r\n \r\n", "import math\r\n\r\na = int(input())\r\none = \"I hate it\"\r\ntwo = \"I love it\"\r\nthree = \"I hate that \"\r\nfour = \"I love that \"\r\n\r\nif a % 2 == 0:\r\n print((three + four)*(a//2-1) + three + two)\r\nelse:\r\n print((three + four)*(math.ceil((a-1)/2)) + one)\r\n\r\n", "num = int(input())\r\nword = []\r\nfor x in range(num):\r\n if x % 2 == 0:\r\n word.append('I hate')\r\n else:\r\n word.append('I love')\r\nprint(' that '.join(word) + ' it')", "n = int(input())\r\nres = []\r\nfor i in range(n - 1):\r\n if not i % 2:\r\n res.append(\"I hate that\")\r\n else:\r\n res.append(\"I love that\")\r\nres.append(\"I hate it\" if n % 2 else \"I love it\")\r\nprint(\" \".join(res))\r\n", "n = int(input())\r\nname = [\"I hate\",\"I love\"]\r\nstatus = 0\r\ni = 1\r\nwhile i<n:\r\n print(name[status],end=\" that \")\r\n status = 0 if status==1 else 1\r\n i+=1\r\nprint(name[status],end=\" it \")", "n =int(input())\r\n \r\nhate=\"I hate that \"\r\nlove=\"I love that \"\r\nres=\"\"\r\nfor i in range(n):\r\n\tif i % 2 :\r\n\t\tres+=love\r\n\telse:\r\n\t\tres+=hate\r\nprint(res[:-5]+\"it\")", "num = int(input())\r\nfor i in range(num-1):\r\n if (i+1)%2==1:\r\n print(\"I hate that\", end= ' ')\r\n else:\r\n print(\"I love that\", end = ' ')\r\nif num%2==1:\r\n print(\"I hate it\")\r\nelse:\r\n print(\"I love it\")", "n = int(input())\r\n\r\nl = []\r\n\r\nfor i in range(n):\r\n \r\n if i % 2 == 0:\r\n l.append(\"I hate\")\r\n else:\r\n l.append(\"I love\")\r\n\r\nprint(*l, sep=\" that \", end=\" \")\r\nprint(\"it\")", "a = int(input())\r\nprint((('I hate that I love that ' * (a//2 - 1)) + (\"I hate that I love it\" if a%2 == 0 else \"I hate that I love that I hate it\")) if a != 1 else \"I hate it\")", "# def solve(n):\r\n# # s = 'I hate that I love that I hate it'\r\n# # s1 = 'I hate that'\r\n# # s1 = 'I hate that I love it'\r\n# return *(['I hate','I love']*50)[:n],sep=' that ',end=' it')\r\n# print(solve(int(input())))\r\nprint(*(['I hate','I love']*50)[:int(input())],sep=' that ',end=' it')\r\n", "n = int(input())\r\n\r\nfor i in range(n):\r\n if i % 2 == 0 : print(\"I hate \", end = \"\")\r\n else : print(\"I love \", end = \"\")\r\n\r\n if i != n-1 : print(\"that \", end = \"\")\r\n else : print(\"it\", end = \"\")\r\n", "from bisect import bisect_left\r\nfrom collections import Counter\r\n\r\n\r\nn=int(input())\r\nif n==1:print('I hate it')\r\nelif n%2==0:\r\n ss='I hate that I love that '*(n//2-1)+'I hate that I love it'\r\n print(ss)\r\nelse:\r\n ss='I hate that I love that '*(n//2)+'I hate it' \r\n print(ss) \r\n", "w = int(input())\r\nm = \"hate\"\r\nn = \"love\"\r\nt = 0\r\ns = \"\"\r\nfor i in range(w):\r\n if i % 2 == 0:\r\n if i != w - 1:\r\n s = s + \"I hate that \"\r\n else:\r\n s = s + \"I hate it\"\r\n else:\r\n if i != w - 1:\r\n s = s + \"I love that \"\r\n else:\r\n s = s + \"I love it\"\r\nprint(s)", "hate = 'I hate'\r\nlove = 'I love'\r\noutput = ''\r\nlayer = int(input())\r\n\r\nfor i in range(1, layer + 1):\r\n if i % 2 == 1:\r\n if i < layer:\r\n output += hate + ' that '\r\n else:\r\n output += hate + ' it'\r\n else:\r\n if i < layer:\r\n output += love + ' that '\r\n else:\r\n output += love + ' it'\r\n\r\nprint(output)", "n = int(input())\r\ntxt =''\r\n\r\nwhile n > 0:\r\n if n >= 4:\r\n txt += \"I hate that I love that \"\r\n n -= 2\r\n elif n == 3:\r\n txt += \"I hate that I love that I hate it\"\r\n break\r\n elif n == 2:\r\n txt += \"I hate that I love it\"\r\n break\r\n else:\r\n txt += \"I hate it\"\r\n break\r\n \r\nprint(txt)", "x, y = int(input()), ''\r\nfor i in range(x):\r\n if i % 2 == 0:\r\n y += 'I hate '\r\n else:\r\n y += 'I love '\r\n if i == x - 1:\r\n y += 'it'\r\n break\r\n else:\r\n y += 'that '\r\nprint(y)", "print('I hate',end='')\r\nfor i in range(1,int(input())):\r\n if i%2 != 0:\r\n print(' that I love',end='')\r\n else:\r\n print(' that I hate',end='')\r\nprint(' it')", "n=int(input())\r\ns=''\r\na='I hate that '\r\nb='I love that '\r\n\r\nfor i in range(1,n+1):\r\n if(i%2!=0):\r\n s=s+a\r\n else:\r\n s=s+b\r\n\r\nl=s.split()\r\nl[-1]='it'\r\nprint(' '.join(l))\r\n \r\n\r\n\r\n\r\n", "n=int(input())\r\ntext = \"\"\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n text = text + \"I hate \"\r\n else:\r\n text = text+ \"I love \"\r\n if i!=n-1:\r\n text = text + \"that \"\r\n else:\r\n text = text + \"it\"\r\nprint(text)", "def main():\r\n times = int(input())\r\n for i in range(0, times):\r\n if i % 2 == 0:\r\n if i == times - 1:\r\n print(\"I hate it\")\r\n break\r\n print(\"I hate that\", end=' ')\r\n else:\r\n if i == times - 1:\r\n print(\"I love it\")\r\n break\r\n print(\"I love that\", end=' ')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\n\r\na = \"I hate it\"\r\nb = \"I hate that \"\r\nc = \"I love it\"\r\nd = \"I love that \"\r\nfinal_str = \"\"\r\nif n == 1:\r\n print(a)\r\nelse:\r\n for i in range(1, n+1):\r\n if i % 2 == 0:\r\n if i == n:\r\n final_str = final_str + c\r\n else:\r\n final_str = final_str + d\r\n else:\r\n if i == n:\r\n final_str = final_str + a\r\n else:\r\n final_str = final_str + b\r\n\r\nprint(final_str)\r\n", "n = int(input())\r\nlist = [\"I hate \", \" I love \"]*100\r\nprint(*list[:n], sep=\" that \", end = \" it\")", "number = int(input())\r\narray = []\r\nfor i in range(number):\r\n if i % 2 == 0:\r\n array.append(\"I hate\")\r\n else:\r\n array.append(\"I love\")\r\n \r\n if i != number - 1:\r\n array.append(\"that\")\r\narray.append(\"it\")\r\n \r\nprint(\" \".join(array))", "n=int(input())\r\ns=\"\"\r\nfor i in range(1,n):\r\n if i %2==1:\r\n s+=\"I hate that \"\r\n else:\r\n s+=\"I love that \"\r\nif n %2==1:\r\n print(s+\"I hate it\")\r\nelse:\r\n print(s+\"I love it\")", "# Input the number of layers\r\nn = int(input())\r\n\r\n# Initialize the feeling string with the first layer\r\nfeeling = \"I hate\"\r\n\r\n# Loop through the remaining layers\r\nfor i in range(2, n + 1):\r\n if i % 2 == 0:\r\n feeling += \" that I love\"\r\n else:\r\n feeling += \" that I hate\"\r\n\r\n# Add \" it\" to complete the feeling\r\nfeeling += \" it\"\r\n\r\n# Print the feeling\r\nprint(feeling)\r\n", "n=int(input())\r\ns1='I hate'\r\ns2='I love'\r\nmid='that'\r\nend='it'\r\nout=s1\r\nk=2\r\nwhile(k<=n ):\r\n if(k%2==0):\r\n out=out+' '+mid+' '+s2\r\n k=k+1\r\n else:\r\n out=out+' '+mid+' '+s1\r\n k=k+1\r\nprint(out+' '+end)", "n=int(input())\r\nans=\"\"\r\nc=0\r\nfor i in range(n):\r\n if i==n-1:\r\n if c==0:\r\n ans+=\"I hate it \"\r\n else:\r\n ans+=\"I love it \"\r\n elif c==0:\r\n ans+=\"I hate that \"\r\n c=1\r\n else:\r\n ans+=\"I love that \"\r\n c=0\r\nprint(ans)", "n=int(input())\r\nres=[]\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n if len(res)>5:\r\n res[-1]=\"that\"\r\n res+=\"I\",\"hate\",\"it\"\r\n else:\r\n if len(res)>0:\r\n res[-1]=\"that\"\r\n res+=\"I\", \"love\", \"it\"\r\nprint(*res)", "import sys\r\nclass FastReader:\r\n def __init__(self):\r\n self.br = sys.stdin\r\n self.st = []\r\n\r\n def next(self):\r\n while not self.st:\r\n try:\r\n self.st = next(self.br).strip().split()\r\n except EOFError:\r\n pass\r\n temp = self.st[0]\r\n self.st = self.st[1:]\r\n return temp\r\n\r\n def nextInt(self):\r\n return int(self.next())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n sc = FastReader()\r\n\r\n n = sc.nextInt()\r\n result = \"\"\r\n for i in range(n):\r\n if i % 2 == 0:\r\n result += \"I hate \"\r\n else:\r\n result += \"I love \"\r\n \r\n if i < n - 1:\r\n result += \"that \"\r\n\r\n result += \"it\"\r\n print(result)", "x=int(input())\r\nc='I hate'\r\nfor i in range(x-1):\r\n c+=' that'\r\n if i%2==0:c+=' I love'\r\n else:c+=' I hate'\r\nprint(c+' it')", "f=''\r\nq=int(input())\r\nfor e in range(q):\r\n if e%2==0:\r\n f+='I hate '\r\n else:\r\n f+='I love '\r\n if e!= q-1:\r\n f+='that '\r\n else:\r\n f+='it '\r\nprint(f) ", "n = int(input())\r\n\r\nh = 'I hate'\r\nl = 'I love'\r\n\r\nsay = []\r\n\r\nfor x in range(1, n+1):\r\n if x % 2 == 1:\r\n say.append(h)\r\n else:\r\n say.append(l)\r\n\r\n \r\nprint(' that '.join(say) + ' it')\r\n", "n=int(input())\r\na=\"I hate\"\r\nb=\"I love\"\r\ns=\"\"\r\nfor i in range(n):\r\n if i==n-1:\r\n if i%2==0:\r\n s=s+a+\" it \"\r\n else:\r\n s=s+b+\" it \"\r\n else:\r\n if i%2==0:\r\n s+=a+\" that \"\r\n else:\r\n s+=b+\" that \"\r\nprint(s)\r\n ", "n = int(input())\r\n\r\nfeelings = []\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n feelings.append(\"I hate that\")\r\n else:\r\n feelings.append(\"I love that\")\r\nfeelings[-1] = feelings[-1].replace(\"that\", \"it\")\r\nprint(\" \".join(feelings))", "# بسم الله (accepted)\r\n# problem : string concatenation \r\nn = int(input())\r\nfeeling1 = 'I hate that '\r\nfeeling2 = 'I love that '\r\nanswer = str()\r\nfor value in range(1,n+1) :\r\n if value %2 != 0 and value != n :\r\n answer += feeling1\r\n elif value %2 == 0 and value != n :\r\n answer += feeling2\r\n if value %2 != 0 and value == n :\r\n answer += 'I hate it '\r\n elif value %2 == 0 and value == n :\r\n answer += 'I love it '\r\nprint(answer.strip(' '))\r\n", "n = int(input())\r\n\r\nfeeling = []\r\nfor i in range(1, n+1):\r\n if i % 2 == 1:\r\n feeling.append(\"I hate\")\r\n else:\r\n feeling.append(\"I love\")\r\n\r\nfeeling_str = \" that \".join(feeling) + \" it\"\r\nprint(feeling_str)", "a = int(input(\"\"))\r\nc = \"\"\r\nfor i in range(1, a + 1):\r\n if i % 2 == 1 and i != a:\r\n c += \"I hate that \"\r\n elif i % 2 == 0 and i != a:\r\n c += \"I love that \"\r\n elif i % 2 == 1 and i == a:\r\n c += \"I hate it\"\r\n else:\r\n c += \"I love it\"\r\n\r\nprint(c)\r\n", "n = int(input())\r\nans = []\r\nfor i in range(1, n + 1):\r\n if i % 2 == 0:\r\n ans.append(\"I love\")\r\n else:\r\n ans.append(\"I hate\")\r\n\r\nprint(\" that \".join(ans) + \" it\")", "n =int(input());i=1;strn =''\r\nwhile(i<=n):\r\n if n==1:\r\n strn +='I hate it'\r\n elif n!=1 and i%2!=0 and i==1 :\r\n strn +='I hate that '\r\n elif n!=1 and i%2!=0 and i!=n:\r\n strn +='I hate that '\r\n elif n!=1 and i%2!=0 and i ==n:\r\n strn +='I hate it '\r\n elif n!=1 and i%2==0 and i==n:\r\n strn +='I love it'\r\n elif n!=1 and i%2==0 and i!=n:\r\n strn +='I love that '\r\n i +=1\r\nprint(strn)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sat Sep 16 23:53:55 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\ns=int(input())\nw='I hate'\nif s==1:\n w+=''\nelif s%2==0:\n w+=' that I love'\n m=1\n while m<s/2:\n w+=' that I hate that I love'\n m+=1\nelse:\n p=0\n while p<(s-1)/2:\n w+=' that I love that I hate'\n p+=1\nw+=' it'\nprint(w)\n ", "n = int(input())\r\n\r\nanswers = [\r\n 'I hate it',\r\n 'I love it'\r\n]\r\n\r\nanswer = []\r\n\r\nfor t in range(n):\r\n answer.append(answers[t%2])\r\n if t != 0:\r\n answer[t-1] = answer[t-1].replace('it', 'that')\r\n \r\nprint(*answer, sep=' ')", "a=\"I hate \"\r\nb=\"that \"\r\nc=\"I love \"\r\nd=\"it\"\r\nfinal=\"I hate \"\r\nnum=int(input())\r\nfor i in range(2,num+1):\r\n if(i%2!=0):\r\n final = final + b + a\r\n else:\r\n final = final + b + c\r\nfinal = final + d\r\nprint(final) ", "n = int(input())\nedgeOdd= 'I hate it'\nedgeEven = 'I love it'\nmiddleOdd = 'I hate that'\nmiddleEven = 'I love that'\n\nfor i in range(1, n+1):\n if n == 1:\n print(edgeOdd, end=' ')\n elif i == range(n+1)[-1]:\n print(edgeEven, end=' ') if range(n+1)[-1] % 2 == 0 else print(edgeOdd, end=' ')\n else:\n print(middleEven, end=' ') if i % 2 == 0 else print(middleOdd, end=' ')\n\n", "# Read the input\r\nn = int(input())\r\n\r\n# Initialize the initial feeling\r\nfeeling = \"I hate\"\r\n\r\n# Build the feeling string with alternating layers\r\nfor i in range(2, n+1):\r\n # Use \"that I love\" or \"that I hate\" based on the layer index (odd or even)\r\n feeling += \" that I \" + (\"love\" if i % 2 == 0 else \"hate\")\r\n\r\n# Add \"it\" at the end\r\nfeeling += \" it\"\r\n\r\n# Print the resulting feeling\r\nprint(feeling)\r\n", "\"\"\"Халк\"\"\"\r\n\r\ndef main():\r\n n = int(input())\r\n temp = \"I hate {0}it\"\r\n\r\n for i in range(n):\r\n if i == 0:\r\n strng = \"{0}\"\r\n elif i % 2 == 0:\r\n strng = \"that I hate {0}\"\r\n elif i % 2 != 0:\r\n strng = \"that I love {0}\"\r\n temp = temp.format(strng)\r\n else:\r\n temp = temp.format(\"\")\r\n print(temp)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "g=int(input())\r\ns=\"I hate that I love\"\r\nif(g==1):\r\n print(\"I hate it\")\r\nif(g==2):\r\n print(\"I hate that I love it\")\r\nif(g>2):\r\n for i in range(3,g+1):\r\n if(i%2==0):\r\n s+=\" that I love\"\r\n\r\n else:\r\n s+=\" that I hate\"\r\n print(s+\" it\")", "n=int(input());result=[];end='that'\r\nfor i in range(1,n+1):\r\n if i == n:end='it'\r\n result.append(f'I love {end}') if i%2==0 else result.append(f'I hate {end}')\r\nprint(' '.join(result))\r\n", "n = int(input())\r\nans = []\r\nfor i in range(1, n+1):\r\n if i % 2 == 1:\r\n ans.append(\"I hate\")\r\n else:\r\n ans.append(\"I love\")\r\n ans.append(\"that\")\r\n \r\nans.pop()\r\nans.append(\"it\")\r\nprint(*ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 7 10:03:05 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\nlayer=int(input())\r\nfor i in range(layer-1):\r\n if i%2==0:\r\n print('I hate that',end=' ')\r\n else:\r\n print('I love that',end=' ')\r\nif layer%2==1:\r\n print('I hate it')\r\nelse:\r\n print('I love it')", "n = int(input())\na = \"I hate\"\nb = \"I love\"\nif n == 1:\n print(\"I hate it\")\n quit()\ntext = \"\"\nfor x in range(2, n + 2):\n if x % 2 == 0:\n text = text + a\n else:\n text = text + b\n if x != n+1:\n text = text + \" that \"\ntext = text + \" it \"\nprint(text)\n\nquit()\n \t \t\t \t\t \t \t \t\t\t\t \t\t \t \t\t", "n = int(input())\r\na = \"I hate\"\r\nfor i in range(1,n):\r\n if (i%2!=0):\r\n a = a + \" that\" + \" I love\"\r\n else:\r\n a = a + \" that\" + \" I hate\"\r\na = a +\" it \"\r\nprint(a)", "a=int(input())\r\nif a%2==0:print('I hate that I love that '*(a//2-1)+'I hate that I love it')\r\nelse:print('I hate that I love that '*((a-1)//2)+'I hate it')\r\n", "number = int(input())\r\n\r\nfeeling = \"\"\r\n\r\nfor num in range(1, number+1):\r\n if num==number and num%2==0:\r\n feeling += \" I love it\"\r\n elif num==number and num%2==1:\r\n feeling += \" I hate it\"\r\n elif num!=number and num%2==0:\r\n feeling += \" I love that\"\r\n else:\r\n feeling += \" I hate that\"\r\n\r\nprint(feeling.strip())", "def sol():\r\n n=int(input())\r\n s=\"\"\r\n for i in range (n):\r\n if i%2==0 and i==n-1:\r\n s=s+\"I hate it\"\r\n elif i%2==1 and i==n-1:\r\n s=s+\"I love it\"\r\n elif i%2==0 :\r\n s=s+\"I hate that \"\r\n elif i%2==1:\r\n s=s+\"I love that \"\r\n if n>1:\r\n print(s)\r\n else:\r\n print(\"I hate it\")\r\n\r\nsol()", "n=int(input())\r\nflag=0\r\nans=\"\"\r\nfor i in range(n):\r\n if i==n-1:\r\n if flag==0:\r\n ans+=\"I hate \"\r\n else:\r\n ans+=\"I love \"\r\n break\r\n else:\r\n if flag==0:\r\n ans+=\"I hate that \"\r\n flag=1\r\n else:\r\n ans+=\"I love that \"\r\n flag=0\r\nans+=\"it\"\r\nprint(ans)", "n = int(input())\r\nb = int(n/2)\r\nnenavist = \"I hate that\"\r\ndobro = \"I love that\"\r\nif n == 1:\r\n print(\"I hate it\")\r\nfor i in range(n):\r\n if i == n-1 and i % 2 != 0:\r\n print(\"I love it\")\r\n elif i == n-1 and i % 2 == 0 and n != 1:\r\n print(\"I hate it\")\r\n elif i % 2 == 0 and n != 1:\r\n print(nenavist,'',end='')\r\n elif i % 2 != 0:\r\n print(dobro,'',end='')", "n = int(input())\r\nhate = \"I hate that\"\r\nlove = \"I love that\"\r\nresult = \"\"\r\nfor i in range(1,n):\r\n if i % 2 == 1:\r\n result += hate\r\n result += \" \"\r\n else:\r\n result += love\r\n result += \" \"\r\nif n % 2 == 0:\r\n result += \"I love it\"\r\nelse:\r\n result += \"I hate it\"\r\nprint(result)", "num = int(input())\r\nodp = \"\"\r\nif num == 1 :\r\n pass\r\nelse:\r\n for i in range(num-1):\r\n if i%2 == 0:\r\n odp +=\"I hate\" \r\n else:\r\n odp +=\"I love\"\r\n odp += \" \"+\"that\" + \" \"\r\nif num%2==0:\r\n odp+= \"I love it\"\r\nelse:\r\n odp+= \"I hate it\"\r\nprint(odp)", "#hulk\r\ndef hulk(s,n1):\r\n if n1==n:\r\n s+=' it'\r\n return s\r\n else:\r\n if n1%2==0:\r\n s+=' that I hate '\r\n return hulk(s,n1+1)\r\n else:\r\n s+=' that I love '\r\n return hulk(s,n1+1)\r\n\r\n\r\nn=int(input())\r\ns='I hate'\r\nprint(hulk(s,1))", "n = int(input())\r\nhulk = ''\r\nfor i in range(1, n+1):\r\n if i%2:\r\n hulk += \"I hate \"\r\n else:\r\n hulk += \"I love \"\r\n if i == n:\r\n hulk += \"it\"\r\n else:\r\n hulk += \"that \"\r\n\r\nprint(hulk)\r\n", "x=int(input())\r\nl=[]\r\nfor i in range(1,x+1):\r\n if i%2==1:\r\n l.append(\"I hate\")\r\n elif i%2==0:\r\n l.append(\"I love\")\r\nr=\" that \".join(l)\r\nprint(r,end=\" \")\r\nprint(\"it\")", "number = int(input())\r\nhate = 'I hate'\r\nthat = 'that'\r\nlove = 'I love'\r\nit = 'it'\r\nans = ''\r\nfor i in range(number):\r\n if i % 2 == 0:\r\n ans += hate\r\n else:\r\n ans += love\r\n if i != number - 1:\r\n ans += ' ' + that + ' '\r\n else:\r\n ans += ' ' + it\r\nprint(ans)", "n=int(input())\r\nfor i in range(1,n):\r\n if i%2==0:\r\n print(\"I love that\",end=' ')\r\n else :\r\n print(\"I hate that\",end=' ')\r\nif n%2==0:\r\n print(\"I love\",end=' ')\r\nelse :\r\n print(\"I hate\",end=' ')\r\nprint(\"it\")", "n1=int(input())\r\nfor i in range(1,n1):\r\n if i%2==1:\r\n print(\"I hate that\",end=\" \")\r\n if i%2==0:\r\n print(\"I love that\",end=\" \")\r\nif n1%2==0:\r\n print(\"I love it\",end=\" \")\r\nelse:\r\n print(\"I hate it\",end=\" \")\r\n ", "t = int(input())\r\ns = ''\r\nfor i in range(t):\r\n if i % 2 ==0 and i != t - 1:\r\n s+= 'I hate that '\r\n elif i % 2 != 0 and i != t-1:\r\n s+= 'I love that '\r\n elif i %2 == 0 and i == t-1:\r\n s += 'I hate it'\r\n elif i %2 != 0 and i == t -1:\r\n s += 'I love it'\r\nprint(s)", "def solve():\r\n x, s = int(input()), 'I hate '\r\n for i in range(x-1):\r\n s += 'that '\r\n s += 'I love ' if i % 2 == 0 else 'I hate '\r\n print(s+'it')\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "chir = int(input())\r\nsdf = \"\"\r\nfor v5n in range(1,chir+1):\r\n sdf += \"I hate that \" if v5n%2!=0 else \"I love that \"\r\ns0l = sdf[:-5] + \"it\"\r\nprint(s0l)", "x = int(input())\r\n\r\nsentence = 'it'\r\nodd = 'I hate '\r\neven = 'I love '\r\nword = 'that '\r\n\r\nallWords = []\r\n\r\nfor i in range(1,x+1):\r\n if x == 1:\r\n allWords.append(odd)\r\n allWords.append(sentence)\r\n\r\n if x > 1:\r\n if i % 2 != 0:\r\n allWords.append(odd)\r\n allWords.append(word)\r\n elif i % 2 == 0:\r\n allWords.append (even)\r\n allWords.append(word)\r\n\r\n if i == x:\r\n allWords.pop()\r\n allWords.append(sentence) \r\n \r\nfor word in allWords:\r\n print(word,end='') ", "n1 = int(input())\r\ns = 'love'\r\ng = 'hate'\r\nn = ''\r\nfor i in range(1, n1 + 1):\r\n if i % 2 == 0 and i != n1:\r\n n += 'I love that '\r\n elif i % 2 == 0 and i == n1:\r\n n += 'I love it '\r\n elif i % 2 != 0 and i != n1:\r\n n += 'I hate that '\r\n elif i % 2 != 0 and i == n1:\r\n n += 'I hate it '\r\nprint(n[:-1])\r\n", "n = int(input())\r\nc = []\r\nfor i in range(n):\r\n if i%2==0:\r\n c+='I hate that '\r\n else:\r\n c+='I love that '\r\nc[-5:] = 'it'\r\nprint(''.join(c))", "n=int(input())\r\ns=''\r\nfor i in range(1,n+1):\r\n if i==1:\r\n s+=\"I hate\"\r\n elif i%2!=0:\r\n s+=\" that I hate\"\r\n else:\r\n s+=' that I love'\r\ns+=' it'\r\nprint(s)", "n=int(input())\r\nlst=[]\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n lst.append(\"I hate\")\r\n else:\r\n lst.append(\"I love\")\r\nl=\" that \".join(lst)\r\nprint(l+\" it\")", "def check(number):\r\n if number == 0:print(\"it \", end='')\r\n else:print(\"that \", end='')\r\nnumber = int(input())\r\nwhile number:\r\n print(\"I hate \", end='');number -= 1;check(number)\r\n if number:print(\"I love \", end='');number -= 1;check(number)\r\n", "n = int(input())\r\ns = ''\r\nfor i in range(1, n + 1):\r\n if (i % 2 != 0) and (i != n):\r\n s += 'I hate that '\r\n elif (i % 2 != 0) and (i == n):\r\n s += 'I hate it'\r\n elif (i % 2 == 0) and (i != n):\r\n s += 'I love that '\r\n elif (i % 2 == 0) and (i == n):\r\n s += 'I love it'\r\nprint(s)\r\n", "def hulks_feeling(n):\r\n feeling_parts = []\r\n for i in range(n):\r\n if i % 2 == 0:\r\n feeling_parts.append(\"I hate\")\r\n else:\r\n feeling_parts.append(\"I love\")\r\n if i < n - 1:\r\n feeling_parts.append(\"that\")\r\n feeling_parts.append(\"it\")\r\n return \" \".join(feeling_parts)\r\nn = int(input())\r\nprint(hulks_feeling(n))\r\n", "a=int(input())\r\nfor i in range(a-1):\r\n if i%2==0:\r\n print('I hate that',end=' ')\r\n else:\r\n print('I love that', end=' ')\r\nif a%2==0:\r\n print('I love it')\r\nelse:\r\n print('I hate it')", "n = int(input())\r\ns1= 'I hate '\r\ns2= 'I love '\r\ns3='that '\r\ns4='it'\r\nblk=''\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n blk+=s1\r\n elif i%2==0:\r\n blk+=s2\r\n if i<n:\r\n blk+=s3\r\n \r\n else:\r\n blk+=s4\r\nprint(blk)\r\n", "n = int(input())\r\n\r\nans = []\r\nfor i in range(n):\r\n if i%2 == 0:\r\n if i == 0:\r\n ans.extend([\"I\", \"hate\"])\r\n else:\r\n ans.extend([\"that\", \"I\", \"hate\"])\r\n else:\r\n ans.extend([\"that\", \"I\", \"love\"])\r\n\r\nprint(\" \".join(ans) + \" it\")", "n =int(input())\r\nl = 'I love'\r\nh = 'I hate'\r\nfor i in range(1,n):\r\n if i%2 != 0:\r\n print(h + ' that ',end='')\r\n else:\r\n print(l + ' that ',end='')\r\n\r\nif n%2 != 0:\r\n print(h + ' it')\r\nelse:\r\n print(l + ' it')\r\n \r\n ", "n = int(input())\r\nans=\"I hate \"\r\nfor i in range(2,n+1):\r\n if i%2==0:\r\n ans += \"that I love \"\r\n elif i%2!=0:\r\n ans += \"that I hate \"\r\nans+=\"it\"\r\nprint(ans)", "def express_feelings(n):\r\n feelings = [\"I hate\", \"I love\"]\r\n result = []\r\n\r\n for i in range(n):\r\n result.append(feelings[i % 2])\r\n\r\n if i != n - 1:\r\n result.append(\"that\")\r\n\r\n result.append(\"it\")\r\n\r\n return \" \".join(result)\r\n\r\n\r\nn = int(input())\r\nfeelings_expression = express_feelings(n)\r\nprint(feelings_expression)", "n=input()\r\nn = int(n)\r\nfor e in range (n):\r\n if (e+1)%2==1:\r\n print (\"I hate\", end=\" \")\r\n else:\r\n print (\"I love\", end=\" \")\r\n if e==n-1:\r\n print (\"it\", end=\" \")\r\n else :\r\n print (\"that\", end=\" \")\r\n", "i = int(input())\r\no = ''\r\nfor x in range(1, i+1):\r\n\r\n if x%2 == 0:\r\n o += \"I love\"\r\n else:\r\n o +=\"I hate\"\r\n if x == i:\r\n o+= \" it\"\r\n else:\r\n o+= \" that \"\r\nprint(o)\r\n", "n=int(input())\r\nl=\"I hate \"\r\nh=\"I love \"\r\nk=\"\"\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n k=k+l\r\n elif i%2==0:\r\n k=k+h\r\n if i!=n:\r\n k=k+\"that \"\r\n if i==n:\r\n k=k+\"it \"\r\n \r\n\r\nprint(k)", "n = int(input())\r\nresult = ''\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n result += ' I hate that'\r\n else:\r\n result += ' I love that'\r\n\r\nresult = result[:-4]\r\n\r\nresult += 'it'\r\n\r\nprint(result[1::])", "x = ' '\r\ny =int(input())\r\nfor i in range(1, y+1) :\r\n if i%2!= 0 :\r\n x = x[:len(x)-2]\r\n if len(x) > 10 :\r\n x = x+'that I hate it'\r\n else :\r\n x = x+ 'I hate it'\r\n else :\r\n x = x[:len(x)-2]\r\n x = x + 'that I love it'\r\nprint(x)\r\n ", "n = int(input())\r\ns = True\r\nr = \"\"\r\n\r\nfor i in range(n):\r\n if s == True:\r\n s = False\r\n r += \"I hate that \"\r\n elif s == False:\r\n s = True\r\n r += \"I love that \"\r\n\r\nr = r[:-5] + \"it\"\r\nprint(r)", "n=int(input())\r\nif n==1: \r\n print('I hate it')\r\nelif n==2:\r\n print('I hate that I love it')\r\nelse: \r\n p=(n-2)//2\r\n if n%2==0:\r\n ch='I hate that I love that '*p\r\n ch+='I hate that I love it'\r\n print(ch)\r\n else : \r\n ch='I hate that I love that '*p\r\n ch+='I hate that I love that I hate it'\r\n print(ch)", "n=int(input())\r\ns1='I hate that'\r\ns2='I love that'\r\ns3='I hate it'\r\ns4='I love it'\r\nk=''\r\nfor i in range(1,n):\r\n if i%2==0:\r\n k=k+s2+' '\r\n else:\r\n k=k+s1+' '\r\nif n%2==0:\r\n k=k+s4\r\nelse:\r\n k=k+s3\r\nprint(k)\r\n\r\n", "n=int(input())\r\nresult='I hate it'\r\nresult_temp='I hate that'\r\nif n==1:\r\n print(result)\r\nelif n==2:\r\n print(result_temp+\" \"+\"I love it\")\r\nelse:\r\n i=2\r\n while i<=n-1:\r\n if i%2==0:\r\n result_temp=result_temp+\" \"+\"I love that\"\r\n else:\r\n result_temp=result_temp+\" \"+\"I hate that\"\r\n i+=1\r\n if n%2==0:\r\n print(result_temp+\" \"+\"I love it\")\r\n else:\r\n print(result_temp+\" \"+\"I hate it\")", "n=int(input())\r\nl1=[]\r\ns=\"\"\r\nfor i in range(1,n+1):\r\n if i%2!=0 and i!=n:\r\n l1.append(\"I hate that\")\r\n elif i%2==0 and i!=n:\r\n l1.append(\"I love that\")\r\n elif i%2==0 and i==n:\r\n l1.append(\"I love it\")\r\n else:\r\n l1.append(\"I hate it\")\r\n#print(l1)\r\nfor i in l1:\r\n s+=i\r\n s+=\" \"\r\nprint(s)\r\n ", "s = int(input())\r\nb = \"I hate that \"\r\na = \"I love that \"\r\nk = \"\"\r\nfor i in range(s-1):\r\n if i % 2 == 0:\r\n k = k + b\r\n else:\r\n k = k + a\r\nif s % 2 == 0:\r\n k = k + \"I love it\"\r\nelse:\r\n k = k + \"I hate it\"\r\nprint(k)", "num_cycles = int(input()) # Number of cycles\r\nexpressions = [] # List to store the expressions\r\n\r\nfor i in range(num_cycles):\r\n if i % 2 == 0:\r\n expressions.append(\"I hate\") # Appending \"I hate\" for even cycles\r\n else:\r\n expressions.append(\"I love\") # Appending \"I love\" for odd cycles\r\n\r\n if i < num_cycles - 1:\r\n expressions.append(\"that\") # Appending \"that\" except for the last cycle\r\n\r\nexpressions.append(\"it\") # Appending \"it\" at the end\r\nprint(\" \".join(expressions)) # Joining the expressions with spaces and printing\r\n", "layer=int(input())\r\nanswer=''\r\ncounter=0\r\nfor i in range(1,layer+1):\r\n counter+=1\r\n if counter<layer:\r\n if i%2==0:\r\n answer+=' I love that '\r\n else:\r\n answer+='I hate that'\r\n elif counter==layer:\r\n if i%2==0:\r\n answer+=' I love it'\r\n else:\r\n answer+='I hate it'\r\n \r\nprint(answer)", "num = int(input())\r\nfor i in range(1, num):\r\n if i % 2 == 1:\r\n print(\"I hate that\",end=\" \")\r\n else:\r\n print(\"I love that\",end=\" \") \r\nif num % 2 ==1:\r\n print(\"I hate it\") \r\nelse:\r\n print(\"I love it\") ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 8 10:57:56 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn=int(input())\r\nif n%2==1:\r\n print(\"I hate that I love that \"*(n//2)+\"I hate it\")\r\nelse:\r\n print(\"I hate that I love that \"*(n//2-1)+\"I hate that I love it\")\r\n", "n = int(input())\r\nfor i in range(1, n + 1):\r\n if i % 2 != 0:\r\n print(\"I hate \", end=\"\")\r\n else:\r\n print(\"I love \", end=\"\")\r\n if i == n:\r\n print(\"it\", end=\"\")\r\n continue\r\n print(\"that \", end=\"\")", "n = int(input(\"\"))\r\nk = \"I hate \"\r\nl = \"I love \"\r\nm = \"\"\r\nfor i in range(0,n):\r\n if i!= n-1:\r\n if i %2== 0:\r\n m+= (k + \"that \")\r\n elif i %2 != 0:\r\n m+= (l + \"that \")\r\n else:\r\n if i %2== 0:\r\n m+= (k + \"it \")\r\n elif i %2 != 0:\r\n m+= (l + \"it \")\r\nprint(m)\r\n\r\n\r\n\r\n", "n = int(input())\r\nres = ''\r\nfor i in range(n-1):\r\n if(i%2==0):\r\n res = res + 'I hate that '\r\n else:\r\n res = res + 'I love that '\r\nif(n%2 == 0):\r\n res = res + 'I love it'\r\nelse:\r\n res = res + 'I hate it'\r\nprint(res)", "a = \"that I love \"\r\nb = \"that I hate \"\r\n\r\nans = \"I hate \"\r\n\r\nn = int(input()) - 1\r\n\r\nfor i in range(n):\r\n if i%2 == 0:\r\n ans += a\r\n else:\r\n ans += b\r\n\r\nprint((ans + \"it\"))", "n = int(input())\r\na = 'I hate'\r\nb = 'I love'\r\ntext = []\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n text.append(\" \" + a + \" \")\r\n else:\r\n text.append(\" \" + b + \" \")\r\nprint(*text,sep=\"that\", end=\"it\")", "n = int(input())\r\nstr_ = 'I hate'\r\n\r\nfor i in range(1, n):\r\n if i % 2 == 1:\r\n str_ += ' that I love'\r\n elif i % 2 == 0 and i != 0:\r\n str_ += ' that I hate'\r\n\r\nprint(str_ + ' it')\r\n", "n = int(input())\r\nphrases = []\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n phrases.append('I hate')\r\n else:\r\n phrases.append('I love')\r\n\r\nprint(' that '.join(phrases), 'it')\r\n", "# -*- coding: utf-8 -*-\n\"\"\"705A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YAcE_C3NXDvEY0NY_rHyte8StemSWBIK\n\"\"\"\n\nn=int(input())\nresult=\"\"\nfor i in range(1,n+1):\n if i%2==1:\n result+=\" I hate\"\n else:\n result+=\" I love\"\n if i!=n:\n result+=\" that\"\nresult+=\" it\"\nprint(result)", "n = int(input())\r\no = \"I hate it\"\r\nif n>1:\r\n for i in range(n-1):\r\n o = o[:-2]\r\n if i%2 == 0:\r\n o += \"that I love it\"\r\n else:\r\n o += \"that I hate it\"\r\nprint(o)", "n = int(input())\r\nresult = \"I hate\"\r\nis_hate = True\r\nfor i in range(2, n+1):\r\n if is_hate:\r\n result += \" that I love\"\r\n else:\r\n result += \" that I hate\"\r\n is_hate = not is_hate\r\nresult += \" it\"\r\nprint(result)", "hulk = int(input())\r\nstuff = []\r\nfor i in range(hulk):\r\n if i % 2 == 1:\r\n stuff.append(\"I love\")\r\n stuff.append(\"that\")\r\n else: stuff.append(\"I hate\"); stuff.append(\"that\")\r\ndel stuff[-1]\r\nprint(\" \".join(stuff)+\" it\")", "n = int(input())\r\nemotion_list = []\r\ni = 1\r\n\r\nwhile i < n + 1:\r\n if i == n:\r\n if i % 2 == 1:\r\n emotion_list.append(\"I hate it\")\r\n else:\r\n emotion_list.append(\"I love it\")\r\n else:\r\n if i % 2 == 1:\r\n emotion_list.append(\"I hate that\")\r\n else:\r\n emotion_list.append(\"I love that\")\r\n i += 1\r\n\r\nprint(\" \".join(emotion_list))\r\n", "numbers = int(input())\r\nfeeling = \"\"\r\nwhile numbers > 0:\r\n if numbers == 1:\r\n feeling += \"I hate it\" + \" \"\r\n numbers -= 1\r\n break\r\n else:\r\n feeling += \"I hate that\" + \" \"\r\n numbers -= 1\r\n if numbers == 1:\r\n feeling += \"I love it\" + \" \"\r\n numbers -= 1\r\n break\r\n else:\r\n feeling += \"I love that\" + \" \"\r\n numbers -= 1\r\nprint(feeling)", "x=int(input())\r\nz=\"\"\r\nfor i in range(1,x+1):\r\n if i%2!=0:\r\n z+=\"I hate that \"\r\n else:\r\n z+=\"I love that \"\r\nq=z.split(\" \")\r\nq[-2]=\"it\"\r\na=' '.join(q)\r\nprint(a)\r\n", "n = int(input())\r\nlist1 = ['I love']*(n)\r\nfor i in range(0,n,2):\r\n list1[i]='I hate'\r\nprint(*list1,sep=\" that \",end=' it')\r\n", "a = int(input())\r\nn = 0\r\nwhile n != a:\r\n n += 1\r\n if n % 2 == 0 and n == a:\r\n print(\"I love it\")\r\n break\r\n elif n % 2 == 1 and n == a:\r\n print(\"I hate it\")\r\n break\r\n if n % 2 == 0:\r\n print(\"I love that\", end = \" \")\r\n else:\r\n print(\"I hate that\", end = \" \")\n# Wed Jul 12 2023 11:36:25 GMT+0300 (Moscow Standard Time)\n", "a=int(input())\r\nb=\"I hate \"\r\nc=\"I love \"\r\ns=\"\"\r\nfor i in range(a):\r\n if(i%2==0):\r\n s=s+b\r\n else:\r\n s=s+c\r\n if i>=0 and i<a-1:\r\n s=s+\"that \"\r\nprint(s+\"it\")", "n=int(input())\r\nt=\"\"\r\nq=0\r\nv=\"that\"\r\nfor i in range (n):\r\n if q==0:\r\n if i==n-1:\r\n v=\"it\"\r\n t+=f\"I hate {v} \"\r\n q=1\r\n elif q==1 :\r\n if i==n-1:\r\n v=\"it\"\r\n t+=f\"I love {v} \"\r\n q=0\r\nprint (t.strip())", "def hulk():\r\n n = int(input())\r\n odd_str = \"I hate \"\r\n even_str = \"I love \"\r\n\r\n ans = \"\"\r\n\r\n for i in range(1, n + 1):\r\n if n == 1:\r\n return odd_str + \"it\"\r\n if i % 2 != 0:\r\n ans += odd_str + \"that\"\r\n else:\r\n ans += even_str + \"that\"\r\n ans += \" \"\r\n\r\n return ' '.join(ans.split(' ')[:-2]) + \" it\"\r\n\r\n\r\nprint(hulk())", "n=int(input())\r\nfor i in range(n):\r\n if(i+1!=n):\r\n if(i%2==0):\r\n print(\"I hate\",end=\" that \")\r\n else:\r\n print(\"I love\", end=\" that \")\r\n else:\r\n if(i%2==0):\r\n print(\"I hate\", end=\" it\")\r\n else:\r\n print(\"I love\", end=\" it\")", "number = int(input())\r\nprint(*(['I hate','I love']*50)[:number],sep=' that ',end=' it')\r\n\r\n", "n = int(input())\r\nf = [''] * (n + 1)\r\nf[1] = 'I hate it'\r\nfor i in range(2, n + 1):\r\n if i % 2:\r\n f[i] = f[i - 1][:-2] + 'that I hate ' + 'it'\r\n else:\r\n f[i] = f[i - 1][:-2] + 'that I love ' + 'it'\r\nprint(f[n])", "s=[]\nfor i in range(int(input())):s.append(['I hate', 'I love'] [i % 2])#append像.format一样标号使用\nprint(\" that \".join(s), end=\" it\\n\")\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 4 17:47:48 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nstr1='I hate'\r\nstr2=' it'\r\nstr3=' that I love'\r\nstr4=' that I hate'\r\nn=int(input())\r\nfor i in range(1,n+1):\r\n if n==1:\r\n break\r\n elif i!=1 and i%2!=0:\r\n str1=str1+str4\r\n continue\r\n elif i!=1 and i%2==0:\r\n str1=str1+str3\r\n continue\r\nprint(str1+str2)", "#first layer = love , 2nd layer hate, 3rd layer love , 4th layer hate\r\n#1 = I hate it\r\n#2 =I hate that I love it\r\n#3 =I hate that I love that I hate it\r\n#\r\nn = int(input())\r\np = ['I hate', \"I love\"] * n\r\nprint(\" that \".join(p[:n]), \"it\")", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x))\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10\r\n# from functools import cmp_to_key\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n if not i:\r\n print('I ',end='')\r\n else:\r\n print('that I ',end='')\r\n if i%2:\r\n print('love ',end='')\r\n else:\r\n print('hate ',end='')\r\nprint('it')", "i=input()\r\na='I hate that I love that '\r\nb='I hate it'\r\nc='I hate that I love it'\r\nif int(i)%2==0:\r\n d=int(int(i)-2)/2\r\n print(a*int(d),c,sep='')\r\nelse:\r\n d=int(int(i)-1)/2\r\n print(a*int(d),b,sep='')", "a=int(input())\r\nn=\"I hate that I love that \"*((a-1)//2)\r\nif a%2==0:\r\n print(n+\"I hate that I love it\")\r\nelse:\r\n print(n+\"I hate it\")", "n = int(input())\r\nfrase = ''\r\nfor i in range(n):\r\n if i+1 == 1:\r\n frase = 'I hate'\r\n elif (i+1)%2!=0 and i+1 != 1:\r\n frase += ' that I hate'\r\n else:\r\n frase += ' that I love'\r\nprint(frase, 'it')", "n=int(input())\r\n\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n if i<n:\r\n print('I hate that', end=\" \")\r\n else:\r\n print('I hate it', end=\" \")\r\n else:\r\n if i<n:\r\n print('I love that', end=\" \")\r\n else:\r\n print(\"I love it\", end=\" \")\r\n", "import sys\n\nfor line in sys.stdin: \n n = int(line)\n\n for i in range(n): \n if i % 2 == 0: \n print(\"I hate\", end = ' ')\n elif i % 2 == 1: \n print(\"I love\", end = ' ')\n if i != n-1: \n print(\"that\", end = ' ')\n else: \n print(\"it\", end = ' ')\n print()\n\n\n", "n = int(input())\r\ns1 = \"I hate that I love that \"\r\nif n%2!=0:\r\n print(s1*((n-1)//2) + \"I hate it\")\r\nelse:\r\n print(s1*((n-2)//2) +\"I hate that I love it\")", "n = int(input())\r\nword = \"I hate it\"\r\nword1 = \"I love it\"\r\nsumma = \"I hate it\"\r\nfor i in range(1, n+1):\r\n if i == 1:\r\n pass\r\n elif i % 2 == 0:\r\n summa = summa.replace('it', 'that') + ' ' + word1\r\n else:\r\n summa = summa.replace('it', 'that') + ' ' + word\r\nprint(summa)", "from sys import stdin\ninput = stdin.readline\n\n\nif __name__ == \"__main__\":\n n = int(input())\n data = [\"hate\", \"love\"]\n s = 'I'\n i = 1\n while i < n:\n s += f\" {data[i%2==0]} that I\"\n i += 1\n print(s, data[i%2==0], \"it\")\n\t\t \t \t \t\t \t \t\t \t\t\t\t \t \t", "a = ' I love'\r\nb = ' I hate'\r\nstring=''\r\nnum = int(input())\r\nfor i in range(num):\r\n if num>1:\r\n\r\n if i%2!=0:\r\n string = string + a\r\n else:\r\n string = string +b\r\n if num-1==i:\r\n continue\r\n else:\r\n\r\n string = string + ' that'\r\n else:\r\n string = b\r\n\r\n\r\n\r\n\r\n\r\nprint(string+' it')", "def hulk_speech(number):\r\n\tspeech = ['I hate','I love']\r\n\tif number == 1:\r\n\t\treturn 'I hate'\r\n\telif number % 2 == 0:\r\n\t\treturn ' that '.join(speech*(int(number/2)))\r\n\telse:\r\n\t\treturn ' that '.join(speech*(int(number/2))) + ' that I hate'\r\n\r\nprint(hulk_speech(int(input())), end = ' it')", "num = int(input())\r\ntext = ''\r\nfor i in range(1,num + 1):\r\n if i == num and i % 2 == 0:\r\n text = text + 'I love it '\r\n elif i == num and i % 2 != 0:\r\n text = text + 'I hate it '\r\n elif i % 2 == 0:\r\n text = text + 'I love that '\r\n elif i % 2 != 0:\r\n text = text + 'I hate that '\r\nprint(text)", "n = int(input())\r\n\r\nlayers = [\"I hate\", \"I love\"]\r\npointer = -1\r\n\r\nwhile(n > 1): \r\n pointer = (pointer+1) % 2\r\n print(\"{} that\".format(layers[pointer]), end = \" \")\r\n n -= 1\r\n\r\npointer = (pointer+1) % 2\r\nprint(\"{} it\".format(layers[pointer]), end = \" \")", "lines=int(input())\r\ntext=\"\"\r\nfor i in range(1,lines+1):\r\n if i==1:\r\n text+=\"I hate\"\r\n elif i%2==0:\r\n text+=\" that I love\"\r\n elif i%2!=0:\r\n text+=\" that I hate\"\r\nprint(text+\" it\")\r\n", "n=int(input())\r\nx=[]\r\nfor i in range(n):\r\n if i%2==0:\r\n if i==0:\r\n x.append('I hate')\r\n else:\r\n x.append('that I hate')\r\n else:\r\n x.append('that I love')\r\nx.append('it')\r\na=' '.join(map(str,x))\r\nprint(a)", "n=int(input())\r\nfor _ in range(1,n):\r\n if _&1==1:\r\n print('I hate that',end=' ')\r\n else:\r\n print('I love that',end=' ')\r\nif n&1==1:\r\n print('I hate it')\r\nelse:\r\n print('I love it')", "a = 'I hate'\r\nb = 'I love'\r\ns = ''\r\nn = int(input())\r\nif n > 1 and n % 2 == 1:\r\n for i in range(1,n + 1):\r\n if i % 2 == 1 and i < n:\r\n s = s + a + ' that '\r\n elif i % 2 == 0 and i < n:\r\n s = s + b + ' that '\r\n elif i == n:\r\n s = s + a + ' it'\r\nif n > 1 and n % 2 == 0:\r\n for i in range(1,n + 1):\r\n if i % 2 == 1 and i < n:\r\n s = s + a + ' that '\r\n elif i % 2 == 0 and i < n:\r\n s = s + b + ' that '\r\n elif i == n:\r\n s = s + b + ' it'\r\nif n == 1:\r\n s = 'I hate it'\r\nprint(s)\r\n", "r = ''\r\ns1 = 'I hate that '\r\ns2 = 'I love that '\r\nfor i in range(int(input())):\r\n r += s1 if i % 2 == 0 else s2\r\nr = r[: -5] + 'it'\r\nprint(r)", "a = int(input())\r\nstring = \"\"\r\nfor c in range(a):\r\n if c % 2 != 0:\r\n string = string + \"that I love \"\r\n else:\r\n string = string + \"that I hate \"\r\nprint(string[4:] + \"it\")\r\n", "s=''\r\na1=int(input())\r\nfor i in range(1,a1+1):\r\n if i%2==0:\r\n s=s+'I love'\r\n if i==a1:\r\n s=s+' it'\r\n else:\r\n s=s+' that '\r\n else:\r\n s=s+'I hate'\r\n if i==a1:\r\n s=s+' it'\r\n else:\r\n s=s+' that '\r\nprint(s)", "s1=\"I hate \"\r\ns2=\"I love \"\r\nn=int(input())\r\nans=s1\r\nfor i in range(1,n):\r\n ans=ans+\"that \"\r\n if i%2==0:\r\n ans=ans+s1\r\n else:\r\n ans=ans+s2\r\nans=ans+\"it\"\r\nprint(ans)", "t = int(input())\r\ng=\"I hate\"\r\nfor i in range(t-1):\r\n\tif(i%2==0):\r\n\t\tg+=\" that I love\"\r\n\telse:\r\n\t\tg+=\" that I hate\"\r\nprint(g+\" it\")", "san = int(input())\r\nresult = ''\r\nhate = 'I hate'\r\nlove = 'I love'\r\nres = []\r\nfor i in range(1,san+1):\r\n if i %2==1:\r\n res.append(hate)\r\n elif i%2==0:\r\n res.append(love)\r\nfor i in res:\r\n result += i+' that '\r\nprint(result[:-5:]+'it')", "n = int(input())\r\nfeeling = \"I hate \"\r\nfor i in range(2, n + 1):\r\n feeling += \"that I love \" if i % 2 == 0 else \"that I hate \"\r\nfeeling += \"it\"\r\nprint(feeling)\r\n", "i=int(input())\r\nif i==1:\r\n print(\"I hate it\")\r\nelse:\r\n for u in range(1,i):\r\n if u%2==0:\r\n print(\"I love that\",end=' ')\r\n else:\r\n print(\"I hate that\",end=' ')\r\n if i%2==0:\r\n print(\"I love it\")\r\n else:\r\n print(\"I hate it\")", "n = int(input())\r\nprint('I hate', end=' ')\r\nfor i in range(0,n-1):\r\n if i % 2 == 0:\r\n print('that I love', end=' ')\r\n else:\r\n print('that I hate', end=' ')\r\nprint('it')\r\n", "n = int(input())\r\nbegin = 'I hate'\r\nend = 'it'\r\nfor i in range (n-1):\r\n begin = begin + ' that I love' if i%2 == 0 else begin + ' that I hate'\r\nprint(begin, end)", "n = int(input())\r\nif n==1:\r\n print(\"I hate it\")\r\nelif n==2:\r\n print(\"I hate that I love it\")\r\nelse:\r\n for i in range(n-1):\r\n if i%2==0:\r\n print(\"I hate that \",end=\"\")\r\n else:\r\n print(\"I love that \",end=\"\")\r\n if n%2==0:\r\n print(\"I love it\",end=\"\")\r\n else:\r\n print(\"I hate it\",end=\"\")\r\n", "r=int(input())\r\nt=\"I hate\"\r\nfor i in range(2,r+1):\r\n\tif i-1<r:t+=\" that\"\r\n\tif i%2==1:\r\n\t\tt+=\" I hate\"\r\n\telse:t+=\" I love\"\r\nelse:t+=\" it\"\r\nprint(t)", "n = int(input())\r\n\r\ni = 0\r\nres =''\r\nwhile i < n:\r\n if i % 2 == 0:\r\n if i ==0:\r\n res += 'I hate '\r\n else:\r\n res += 'that I hate '\r\n else:\r\n res += 'that I love '\r\n\r\n i+=1\r\nres += 'it'\r\nprint(res)\r\n\r\n\r\n", "def main(n):\r\n s = \"\"\r\n\r\n for i in range(n):\r\n s += (\"I hate\" if i % 2 == 0 else \"I love\")\r\n s += (\" it\" if i == n - 1 else \" that \") \r\n\r\n return s\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n\r\n print(main(n))", "n=int(input())\r\ntext=\"\"\r\nfor i in range(n):\r\n if i%2==0:\r\n text += \"I hate\"\r\n else:\r\n text += \"I love\"\r\n if n!=1 and i<n-1:\r\n text += \" that \"\r\n \r\nprint(text+\" it\")\r\n ", "n = int(input())\r\nflag, string = (False, 'I hate it') if n % 2 == 1 else (True, 'I love it')\r\nfor _ in range(n - 1):\r\n string, flag = ('I hate that ' if flag else 'I love that ') + string, not flag\r\nprint(string)", "n=int(input())\ns='I hate it'\nif n>1:\n for i in range(2,n+1):\n s=s.replace('it','that')\n if i%2==0: \n s+=' I love it'\n else:\n s+=' I hate it'\nprint(s)", "n = int(input())\r\np = []\r\nfor i in range(n):\r\n if i % 2 == 1:\r\n p.append('I love')\r\n else:\r\n p.append('I hate')\r\np1 = ' that '.join(p)\r\np1 += ' it'\r\nprint(p1)", "n = int(input())\r\nfeel = [\"I hate that\" if i % 2 != 0 else \"I love that\" for i in range(1, n)]\r\nfeel.append(\"I hate it\") if n%2 != 0 else feel.append(\"I love it\")\r\nprint(*feel, sep=\" \")", "n = int(input())\r\n\r\nsequence = [\"I hate\", \"I love\"]\r\n\r\nres = sequence[0]\r\n\r\nfor i in range(1, n):\r\n res = res + \" that \" + sequence[i % 2]\r\n\r\nprint(res + \" it\")\r\n", "y, x, flag = int(input()), \"I hate \", 0\r\nfor _ in range(y-1):\r\n if flag == 0: x += \"that I love \"; flag = 1\r\n else: x += \"that I hate \"; flag = 0\r\nprint(x + \"it\")", "n = int(input())\r\nif n == 1:\r\n print(\"I hate it\")\r\nelse:\r\n s = \"\"\r\n word = [\"hate \", \"love \"]\r\n for i in range(n-1):\r\n s += \"I \"\r\n s += word[i%2]\r\n s += \"that \"\r\n s += \"I \"\r\n s += word[(i+1)%2]\r\n s += \"it\"\r\n print(s)", "#I hate that I love that I hate it\r\nn=int(input())\r\ns=\"\"\r\ni=0\r\nwhile(i<n):\r\n if(i%2==0):\r\n s=s+\"I hate \"\r\n else:\r\n s=s+\"I love \"\r\n i=i+1\r\n if(i==n):\r\n s=s+\"it\"\r\n else:\r\n s=s+\"that \"\r\nprint(s)", "n = int(input())\r\nfeelings = ['I hate', 'I love']\r\nrepeated_feelings = (feelings * 50)[:n]\r\nfeelings_string = ' that '.join(repeated_feelings) + ' it'\r\nprint(feelings_string)", "s = []\r\nn = int(input())\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n s.append('I hate')\r\n else:\r\n s.append('I love')\r\nprint(' that '.join(s), end=' it')", "n = int(input())\r\nfor i in range(n):\r\n if i % 2 == 0: print(\"I hate\", end=' ')\r\n else: print(\"I love\", end=' ')\r\n if i < n-1: print('that', end=' ')\r\nprint('it')", "a=int(input())\r\nb=\"I hate\"\r\nc=\"I love\"\r\nd=\" that \"\r\ne=\" it\"\r\nf=\"\"\r\nfor i in range(1,a+1):\r\n if i%2!=0:\r\n f+=b\r\n else:\r\n f+=c\r\n if i==a:\r\n f+=e\r\n else:\r\n f+=d\r\nprint(f)", "t=int(input())\r\nresult=\"\"\r\nfor i in range(1,t+1):\r\n if (i%2==0):\r\n result+=\"I love \"\r\n else:\r\n result+=\"I hate \"\r\n if i!=t:\r\n result+=\"that \"\r\nresult+=\"it\"\r\nprint(result)", "n = int(input())\ntext = []\nfor i in range(n):\n if i % 2 == 0:\n text.append('I hate')\n else:\n text.append('I love')\nprint(' that '.join(text) + ' it')", "n = int(input())\r\n\r\nfor i in range(1, n+1):\r\n if i % 2 == 0:\r\n print(\"I love it\") if (i == n) else print(\"I love that\" , end=\" \")\r\n else:\r\n print(\"I hate it\") if (i == n) else print(\"I hate that\" , end=\" \")", "n = int(input())\n\ns = ''\nfor i in range(1, n+1):\n if (i % 2 == 1):\n layer = \"I hate\"\n else:\n layer = \"I love\"\n s = s + layer\n if i < n:\n s = s + \" that \"\ns = s + \" it\"\nprint(s)\n", "num = int(input())\r\nlst=[]\r\nfor n in range(num):\r\n if n % 2 == 0:\r\n lst.append(\"I hate \")\r\n else:\r\n lst.append(\"I love \")\r\nprint(\"that \".join(lst),end='')\r\nprint(\"it\")\r\n", "n = int(input())\r\nfeelings = [\"I hate\", \"I love\"]\r\n\r\nexp= \"I hate\"\r\nfor i in range(1, n):\r\n exp += \" that \" + feelings[i % 2]\r\n\r\nexp += \" it\"\r\nprint(exp)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 31 08:25:38 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\nn = int(input())\r\n\r\ns = \"\"\r\na = \"I \"\r\nb = \"hate \"\r\nc = \"that \"\r\nd = \"love \"\r\ne = \"it\"\r\n\r\nif n > 1:\r\n for i in range(1, n+1):\r\n if i % 2 == 1:\r\n s = s + a + b\r\n else:\r\n s = s + a + d\r\n if i < n:\r\n s = s + c\r\nelse:\r\n s = a + b\r\n\r\nprint(s + e)", "x = \"I hate\"\r\ny = \"I love\"\r\ns = ''\r\n\r\nfor i in range(int(input())):\r\n if i % 2 == 0:\r\n s = s + x + \" that \"\r\n else:\r\n s = s + y + \" that \"\r\ns = s[:-6]\r\n\r\nprint(s, end=\" it\")\r\n", "n = int(input())\r\nfeel = \"\"\r\nfor i in range(1, n + 1):\r\n if(i % 2 == 1):\r\n feel += \"I hate that \"\r\n else:\r\n feel += \"I love that \"\r\nfeel = feel[:-5] + \"it\"\r\nprint(feel)", "a , s = int(input()) , ''\r\nif a%2==0:\r\n s= 'I hate that I love that '*(a//2) + 'it'\r\n print(s.replace('that it','it'))\r\nelse:\r\n print('I hate that I love that '*(a//2) + 'I hate it')", "# The string must always end with the word \"it\"\r\n# The even numbers are \"I love\"\r\n# The odd numbers are \"I hate\"\r\n# The space betwee them is the word \"that\"\r\n\r\n# So, 1 = \"I hate\" + \"it\" or \"I hate it\"\r\n# 2 = \" I hate that I love it \"\r\n\r\n\r\n\r\ninput1 = int(input()) # gives us n Number.\r\n\r\nending = \" it\" # tack this string onto the end with str-conct.\r\n\r\noutput = \"\" # make the output variable.\r\n\r\n# Let's try solving this problem with a for loop.\r\n# Concatination of a string is our method of solving.\r\n\r\n\r\n# Check whether number == 1\r\n\r\n# if number == 1, then just output the string for 1.\r\naddIt = False\r\n\r\nif input1 == 1:\r\n output = \"I hate it\"\r\n\r\n# else, run the for loop that will do the concatination.\r\n\r\n# This is the second pass at the problem. I originally wanted to involve a solution like this that used a for loop, and I think this solution is a little more intuative than the first solution.\r\nelse:\r\n addIt = True\r\n for n in range(input1):\r\n number = n + 1\r\n \r\n \r\n # if number in cycle is even, add the even string text.\r\n # I love\r\n if number % 2 == 0:\r\n output = output + \"I love\"\r\n # if number is odd, add the odd string text\r\n # I hate\r\n else:\r\n output += \"I hate\"\r\n \r\n # add \"that\" to string, so long as we are not on the last number.\r\n if number < input1:\r\n output = output + \" that \"\r\n# After we get the output from the for loop, we will have a string that we need to cap with the word \"it.\" I put in a Bool in the beginning of the else: statement that turns True. If it's True, we add the string \"it\" to the end of the long string as per the rule of the problem.\r\n \r\nif addIt == True:\r\n output = output + \" it\"\r\n\r\nprint(output)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# The code below does solve the solution.\r\n\"\"\"\r\nif input1 % 2 == 0: # if the n is even do this:\r\n output = \"I hate that I love that \"*(input1//2)\r\n output = output.split()\r\n output[-1] = \"it\"\r\n output = \" \".join(output)\r\nelif input1 == 1: # if n is 1.\r\n output = \"I hate it\"\r\nelse: # n is odd and is not the number 1\r\n output = (\"I hate that I love that \"*(input1//2)) + \"I hate it\"\r\n \r\nprint(output)\r\n\"\"\"\r\n\r\n", "x = int(input())\r\nl = \"\"\r\nfor i in range(1,x+1):\r\n if i%2==0:\r\n s = \"I love \"\r\n else:\r\n s = \"I hate \"\r\n if i==x:\r\n l+=s+\"it\"\r\n else:\r\n l+=s+\"that \"\r\nprint(l)", "a = int(input())\r\nr = (a+1)//2\r\np1 = \"I hate that\"\r\np2 = \"I love that\"\r\nres = (p1+\" \"+p2+\" \")*r\r\nif a%2:\r\n print(res[:-17]+\"it\")\r\nelse:\r\n print(res[:-5]+\"it\")", "# 705A - Hulk\r\n\r\nhate = \"I hate that \"\r\nlove = \"I love that \"\r\nfeeling = \"\"\r\n\r\nn = int(input())\r\n\r\nfor i in range(1, n):\r\n if i == 0 or i % 2 == 0:\r\n feeling += love\r\n else:\r\n feeling += hate\r\n\r\nif n % 2 != 0:\r\n feeling += \"I hate it\"\r\nelse:\r\n feeling += \"I love it\"\r\n\r\nprint(feeling)", "n=int(input())\r\nf=\" \"\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n f+=\"I hate\"\r\n else:\r\n f+=\"I love\"\r\n if i!=n:\r\n f+=\" that \"\r\n else:\r\n f+=\" it\"\r\nprint(f)", "import sys\r\n\r\nN = int(sys.stdin.readline())\r\nres = []\r\nfor i in range(N):\r\n if i % 2 == 0:\r\n res.append(\"I hate\")\r\n else:\r\n res.append(\"I love\")\r\n\r\nprint(' that '.join(res)+\" it\")", "n = int(input())\nif n%2 == 0:\n print(\"I hate that I love that \"*int(n/2-1)+\"I hate that I love it\")\nelse:\n print(\"I hate that I love that \"*(n//2)+\"I hate it\")\n", "n = int(input())\r\nans = \"I hate\"\r\nhate = \" that I hate\"\r\nlove = \" that I love\"\r\nfor i in range(2, n+1):\r\n if i % 2 == 0:\r\n ans += love\r\n if i % 2 != 0:\r\n ans += hate\r\nprint(ans + \" it\")\r\n", "n=int(input())\r\n\r\nwords=\"I hate \"\r\n\r\nfor i in range (2,n+1):\r\n if i%2==0:\r\n words=words+\"that I love \"\r\n else:\r\n words=words+\"that I hate \"\r\n\r\nprint(f\"{words}it\")", "n= int(input())\r\ns1='I hate '\r\ns2='I love '\r\nres='I hate '\r\nfor i in range(1,n):\r\n if i%2==1:\r\n res+='that '+s2\r\n else:\r\n res+='that '+s1 \r\nprint('I hate it' if n==1 else res+'it')", "cnt = int(input())\r\na = [\"I hate\", \"I love\"] * cnt\r\nprint(\" that \".join(a[:cnt]),\"it\")", "n=int(input())\r\ni=1\r\nwhile i<=n:\r\n print((\"I hate \" if i%2==1 else \"I love \")+(\"that\" if i!=n else \"it\"),end=\" \")\r\n i+=1", "n=int(input())\r\noutput=\"\"\r\nfor i in range(n):\r\n if i%2==0:\r\n output+=\"I hate \"\r\n else:\r\n output+= \"I love \"\r\n output+=\"that \"\r\noutput=output[0:-5]+\"it\"\r\nprint(output)\r\n", "print(\" that \".join([\"I hate\",\"I love\"][i%2] for i in range(int(input()))),end=\" it\\n\")", "n = int(input()) # Read the number of layers\r\n\r\nfeeling_layers = [] # Initialize the list of feeling layers\r\n\r\nfor i in range(1, n + 1):\r\n if i % 2 == 1:\r\n feeling_layers.append(\"hate\")\r\n else:\r\n feeling_layers.append(\"love\")\r\n\r\nfeeling = \" that I \".join(feeling_layers) + \" it\" # Construct the final feeling\r\n\r\nprint(\"I \" + feeling) # Print Dr. Banner's feeling", "n = int(input())\r\na=\"\"\r\nfor i in range(1,n):\r\n\tif i%2 == 1:\r\n\t\ta=a+\" I hate that\"\r\n\telse:\r\n\t\ta=a+\" I love that\"\r\nif n%2 == 1:\r\n\ta=a+\" I hate it\"\r\nelse:\r\n\ta=a+\" I love it\"\r\nprint(a[1:])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# Read the input\r\nn = int(input())\r\n\r\n# Initialize the feeling string with the first layer \"hate\"\r\nfeeling = \"I hate\"\r\n\r\n# Iterate through each layer from 2 to n\r\nfor i in range(2, n+1):\r\n # Alternate between \"hate\" and \"love\" based on the layer number\r\n if i % 2 == 0:\r\n feeling += \" that I love\"\r\n else:\r\n feeling += \" that I hate\"\r\n\r\n# Add the final \"it\" at the end\r\nfeeling += \" it\"\r\n\r\n# Print Dr. Banner's feeling\r\nprint(feeling)\r\n", "n=int(input())\r\nres=\"\"\r\ni=1\r\nwhile i<=n:\r\n res=res+\"I \"\r\n if i%2==0:\r\n res=res+\"love \"\r\n else:\r\n res=res+\"hate \"\r\n if i<n:\r\n res=res+\"that \"\r\n else:\r\n res=res+\"it\"\r\n i=i+1\r\nprint(res)", "n=int(input())\r\nfor i in range(1,n+1):\r\n if i % 2 == 1:\r\n print(\"I hate\", end = \"\")\r\n else:\r\n print(\"I love\", end = \"\")\r\n if i < n:\r\n print(\" that \", end = \"\")\r\nprint(\" it \")\r\n \r\n", "s=int(input())\r\na=\"I hate \"\r\nb=\"I love \"\r\nans=\"\"\r\nfor i in range(s):\r\n if i&1:\r\n ans+=b\r\n else:\r\n ans+=a\r\n if i!=(s-1):\r\n ans+=\"that \"\r\nans+=\"it\"\r\nprint(ans)\r\n ", "n = int(input())\r\n\r\ns=\"hate\"\r\na=\"\"\r\n\r\nfor i in range(n):\r\n if i==n-1:\r\n a+=f'I {s} it'\r\n else:\r\n a += f'I {s} that '\r\n if s==\"hate\":\r\n s=\"love\"\r\n else:\r\n s=\"hate\"\r\nprint(a)", "n=int(input())\r\ns=''\r\nfor i in range(1,n):\r\n if i%2==0:\r\n s+=' I love that'\r\n else:\r\n s += ' I hate that'\r\nif n%2==0:\r\n s+=' I love it'\r\nelse:\r\n s += ' I hate it'\r\nprint(s[1:])", "n = int(input())\r\nhate = \"I hate that\"\r\nlove = \"I love that\"\r\n\r\nresult = ''\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n result = result + \" \" + hate\r\n else:\r\n result = result + \" \" + love\r\n\r\nprint(result[:-5].strip() + \" it\")", "n = int(input())\r\nbool_of_hate = True\r\noutput_list = []\r\nfor i in range(n):\r\n if i > 0:\r\n output_list.append('that')\r\n if bool_of_hate:\r\n output_list.append('I hate')\r\n bool_of_hate = False\r\n else:\r\n output_list.append('I love')\r\n bool_of_hate = True\r\n\r\noutput_list.append('it')\r\nprint(' '.join(output_list))", "i = int(input())\r\n\r\nf = ''\r\nprefixed = 'I '\r\n\r\nfor j in range(i):\r\n sufnotfixed = (' it' if j == i-1 else ' that ')\r\n f+= prefixed + ('hate' if j%2==0 else 'love') + sufnotfixed\r\nprint(f)", "a = int(input())\r\nl = []\r\nd = ['I hate','I love']\r\ne = 0\r\nfor i in range(a):\r\n l.append(d[e])\r\n e = 1-e\r\nl[-1] = l[-1] + ' it'\r\nprint(\" that \".join(l))", "def hulk():\r\n n = int(input())\r\n hate = \"I hate\"\r\n love = \"I love\"\r\n total = \"\"\r\n for i in range(1, n+1):\r\n if(i>1):\r\n total+=\" \"+\"that\" +\" \"\r\n if (i%2!=0):\r\n total +=hate\r\n else:\r\n total+=love\r\n #total+=\" \"+\"that\" +\" \"\r\n return(total+\" it\")\r\nprint(hulk())\r\n \r\n\r\n", "def main():\r\n n = int(input())\r\n for i in range(n):\r\n if i%2 == 0:\r\n print('I hate ', end='')\r\n else:\r\n print('I love ', end='')\r\n if i!= n-1:\r\n print('that ', end='')\r\n else:\r\n print('it')\r\n\r\n\r\nif __name__=='__main__':\r\n main()", "n = int(input())\n\nfor rep in range(1,n+1):\n if rep!=1:\n print(\"that \", end=\"\")\n if rep%2:\n print(\"I hate \", end=\"\")\n else:\n print(\"I love \", end=\"\")\n \n\nprint(\"it\")\n \t \t\t\t\t \t\t\t \t\t\t\t\t\t\t\t \t \t", "n=int(input())\r\nw1=\"that\"\r\nw2=\"it\"\r\nfor i in range(n):\r\n if(n==1):\r\n print(\"I hate it\",end=\" \")\r\n break\r\n if(i==n-1):\r\n if(n%2==0):\r\n print(\"I love it\",end=\" \")\r\n break\r\n else:\r\n print(\"I hate it\",end=\" \")\r\n break\r\n if(i%2==0):\r\n print(\"I hate that\",end=\" \")\r\n \r\n if((i%2)!=0):\r\n print(\"I love that\",end=\" \")\r\n\r\n \r\n\r\n \r\n ", "x=int(input())\r\nans=[]\r\nfor a in range(x):\r\n if a%2==0:\r\n ans.append(\"I hate\")\r\n ans.append(\" that \")\r\n elif a%2==1:\r\n ans.append(\"I love\")\r\n ans.append(\" that \")\r\nans[-1]=\" it\"\r\nfor b in range (2*x):\r\n print(ans[b],end=(\"\"))", "n = int(input())\r\nt = []\r\ni = 0\r\nwhile(n>0):\r\n if(i&1):\r\n t.append('I love')\r\n else:\r\n t.append('I hate')\r\n n -= 1\r\n i += 1\r\n if(n):\r\n t.append('that')\r\nprint(' '.join(t), 'it')\r\n", "n = int ( input ())\r\nx = 1\r\nmessage = ''\r\nwhile (x <= n):\r\n if (x % 2 == 1): \r\n message += 'I hate '\r\n else:\r\n message += 'I love '\r\n x += 1\r\n if (x <= n):\r\n message += 'that '\r\nmessage += 'it'\r\nprint (message)\r\n", "def h(n):\r\n f = []\r\n for i in range(1, n + 1):\r\n if i % 2 == 1:\r\n f.append(\"I hate\")\r\n else:\r\n f.append(\"I love\")\r\n\r\n return \" that \".join(f) + \" it\"\r\n\r\nn = int(input())\r\n\r\nprint(h(n))", "#Coder_1_neel\r\na=int(input())\r\nx=[\"I hate\"]\r\nfor i in range(2,a+1):\r\n if(i%2==0):\r\n x.append(\"that I love\")\r\n elif(i%2!=0):\r\n x.append(\"that I hate\") \r\n\r\nx.append(\"it\")\r\nprint(*x)", "n=int(input())\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n print(\"I hate \",end=\"\")\r\n else:\r\n print(\"I love \",end=\"\")\r\n if i!=n:\r\n print(\"that \",end=\"\")\r\nprint(\"it\")", "n=int(input())\r\nans=\"I hate\"\r\nhate=\" that I hate\"\r\nlove=\" that I love\"\r\nfor i in range(2,n+1):\r\n if i%2==0:\r\n ans+=love\r\n if i%2!=0:\r\n ans+=hate\r\nprint(ans+\" it\") ", "n = int(input())\r\n\r\nfeelings = []\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n feelings.append(\"I hate\")\r\n else:\r\n feelings.append(\"I love\")\r\n\r\nresult = \" that \".join(feelings) + \" it\"\r\n\r\nprint(result)", "def hulk(n):\r\n new=[]\r\n for i in range(1,n+1):\r\n if i%2==1:\r\n p1=\"I hate\"\r\n new.append(p1)\r\n else:\r\n p2=\"I love\"\r\n new.append(p2)\r\n if i!=n:\r\n p3=\"that\"\r\n new.append(p3)\r\n p4=\"it\"\r\n new.append(p4)\r\n res=\" \".join(new)\r\n return res\r\nn=int(input())\r\nprint(hulk(n))", "\r\ndef hulk(a):\r\n c=\"\"\r\n for i in range(a):\r\n if i == 0:\r\n c+=\"I hate\"\r\n if i != 0:\r\n if i %2 == 0:\r\n c+=\" that I hate\"\r\n else:\r\n c+=\" that I love\"\r\n c+=\" it\"\r\n return c\r\na = int(input())\r\nprint(hulk(a))\r\n", "a=int(input())\r\nb=''\r\nfor i in range(0,a):\r\n if i>=1:\r\n b=b+'that '\r\n if i%2==0:\r\n b=b+'I hate '\r\n else:\r\n b=b+'I love '\r\nprint(b+'it')\r\n ", "l=[]\r\nx=int(input())\r\nfor i in range(x):\r\n if i ==(x-1):\r\n if i%2==0:\r\n l.append(\"I hate it\")\r\n else:\r\n l.append(\"I love it\")\r\n break\r\n else:\r\n \r\n if i%2==0:\r\n l.append(\"I hate that\")\r\n else:\r\n l.append(\"I love that\")\r\nprint(*l)\r\n", "m=int(input())\r\nprint('I hate',end=\" \")\r\nfor i in range(2,m+1):\r\n if i % 2!=0:\r\n print(\"that I hate\",end=\" \")\r\n else:\r\n print(\"that I love\",end=\" \")\r\nprint(\"it\",end=\" \")\r\n", "x=int(input())\r\ns=\"\"\r\nfor i in range(x):\r\n if i%2==0 and i==x-1:\r\n s+=\"I hate it \"\r\n elif i%2==1 and i==x-1:\r\n s+=\"I love it \"\r\n elif i%2==0:\r\n s+=\"I hate that \"\r\n else:\r\n s+=\"I love that \" \r\nprint(s)\r\n \r\n \r\n ", "n = int(input()) \r\ns = \"I hate \"\r\nk = n\r\nwhile n>1:\r\n s = s + \"that I \"\r\n if (k-n) % 2 == 0:\r\n s = s + \"love \"\r\n else:\r\n s = s + \"hate \"\r\n n -= 1\r\nprint(s+\"it\")", "x = int(input())\r\nfeels = []\r\nfor i in range(x):\r\n if i % 2 == 0:\r\n feels.append(\"I hate\")\r\n else:\r\n feels.append(\"I love\")\r\n if i != x - 1:\r\n feels.append(\"that\")\r\nfeels.append(\"it\")\r\nprint(\" \".join(feels))\r\n", "n=int(input())\r\nfeelings=[]\r\n\r\nfor i in range(n):\r\n if i%2 == 0:\r\n feelings.append(\"I hate\")\r\n else:\r\n feelings.append(\"I love\")\r\n if i<n-1:\r\n feelings.append(\"that\")\r\n \r\nfeelings.append(\"it\")\r\nresult=\" \".join(feelings)\r\nprint(result)", "x = []\r\nfor i in range(int(input())):\r\n if i%2==0:\r\n x.append(\"I hate\")\r\n else:\r\n x.append(\"I love\")\r\nprint(\" that \".join(x)+\" it\")", "s = \"I hate\"\r\nn = int(input())\r\nfor i in range(0,n-1):\r\n s = s + \" that \"\r\n if(i%2==0):\r\n s = s + \"I love\" \r\n else:\r\n s = s + \"I hate\"\r\n \r\ns = s + \" it\"\r\nprint(s)", "a = int(input())\r\nans = ''\r\nfor i in range(2,a+1):\r\n\tif i%2==0:\r\n\t\tans+='that I love '\r\n\telse:\r\n\t\tans+='that I hate '\r\nprint('I hate '+ans+'it')", "x = int(input())\r\nhate = True\r\n\r\noutput = \"\"\r\n\r\nfor i in range(x - 1):\r\n if hate == True:\r\n output += \"I hate that \"\r\n else:\r\n output += \"I love that \"\r\n hate = not(hate)\r\n\r\nif x % 2 == 0:\r\n output += \"I love it\"\r\nelse:\r\n output += \"I hate it\"\r\n\r\nprint(output)\r\n", "n = int(input())\r\nfeel = [\"I hate that\" if i % 2 != 0 else \"I love that\" for i in range(1, n)]\r\nif n % 2 != 0:\r\n feel.append(\"I hate it\")\r\nelse:\r\n feel.append(\"I love it\")\r\nprint(*feel, sep=\" \")", "yi = \"I hate\"\r\ner = \"I love\"\r\n\r\nN = int(input())\r\n\r\nfor i in range(N):\r\n if i % 2: print(er, end = \"\")\r\n else: print(yi, end = \"\")\r\n if i != N - 1:\r\n print(\" that \", end = \"\")\r\nprint(\" it\", end = \"\")", "n = int(input())\r\nresult = \"\"\r\n\r\nif n == 1:\r\n result = \"I hate it\"\r\nelif n > 1:\r\n result = \"I hate that\"\r\n\r\nfor i in range(2, n):\r\n if i % 2 == 1 and i != n:\r\n result += \" I hate that\"\r\n elif i % 2 == 0 and i != n:\r\n result += \" I love that\"\r\n\r\nif n % 2 == 0 and n > 1:\r\n result += \" I love it\"\r\nelif n > 1:\r\n result += \" I hate it\"\r\n\r\nprint(result)\r\n", "import sys\r\n\r\nN = int(input())\r\nj = N\r\nwhile(N > 1):\r\n sys.stdout.write(\"I hate that \")\r\n N -= 1\r\n if(N>1):\r\n sys.stdout.write(\"I love that \")\r\n N -= 1\r\n\r\nif(j%2==0):\r\n sys.stdout.write(\"I love it\")\r\nelse:\r\n sys.stdout.write(\"I hate it\")\r\n\r\n", "n = int(input())\r\nif n == 1:\r\n print(\"I hate it\", end=\"\")\r\nelif n > 1:\r\n print(\"I hate that\", end=\"\")\r\n \r\nfor i in range(2,n):\r\n if i % 2 == 1 and i != n:\r\n print(\" I hate that\", end=\"\")\r\n \r\n elif i % 2 == 0 and i != n:\r\n print(\" I love that\", end=\"\")\r\n\r\nif n % 2 == 0 and n > 1:\r\n print(\" I love it\")\r\nelif n > 1 :\r\n print(\" I hate it\")", "n = int(input())\r\ns=\"\"\r\nlst = ['I hate ','I love ']\r\na = 0\r\nfor i in range(n):\r\n s+=lst[i%2]\r\n a+=1\r\n if i!=n-1:\r\n s+='that '\r\n \r\nprint(s+'it')\r\n", "n = int(input())\r\ns = \"\"\r\nfor i in range(1,n+1):\r\n if i%2:\r\n s += \"I hate \"\r\n else:\r\n s+= \"I love \"\r\n if i!=n:\r\n s+= \"that \"\r\n else:\r\n s+=\"it\"\r\nprint(s)", "n = int(input())\r\ns = \"\"\r\nc1 = \"that \"\r\nc2 = \"it \"\r\nodd = \"I hate \"\r\neven = \"I love \"\r\nif n==1:\r\n print(\"I hate it\")\r\nelse:\r\n #s = odd + c1\r\n for i in range(n):\r\n if i%2 != 0:\r\n s += even\r\n if i == n-1:\r\n s += c2\r\n else:\r\n s += c1\r\n else:\r\n s += odd\r\n if i == n-1:\r\n s += c2\r\n else:\r\n s += c1\r\nprint(s)", "s=\"\"\r\nn=int(input())\r\nfor i in range(1,n+1):\r\n if i%2==0:\r\n s=s+\"I love \"\r\n else:\r\n s=s+\"I hate \"\r\n if(i!=n):\r\n s=s+\"that \"\r\n else:\r\n s=s+\"it\"\r\nprint(s)", "\r\nimport math\r\n\r\nnumber = int( input() )\r\n\r\nfeel1 = \"I hate it\"\r\n\r\nfeel3 = \"I hate that I love that \"\r\n\r\nfeel4 = \"I hate that I love it \"\r\n\r\nif ( number == 1 ) :\r\n print( feel1 )\r\n \r\n\r\nif ( number % 2 == 1 ) and ( number > 1 ) :\r\n\r\n feelings = str( feel3 * ( math.floor( number / 2 ) ) )\r\n print( feelings + feel1 )\r\n \r\n\r\nif ( number % 2 == 0 ) and ( number >= 2 ) :\r\n\r\n feelings = str( feel3 * ( int( number / 2 ) - 1 ) )\r\n print( feelings + feel4 )\r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n \r\n", "s=int(input().strip())\r\nc=\"\"\r\nfor i in range(1,s+1):\r\n if i%2==1:\r\n c+=\" I hate \"\r\n else:\r\n c+=\" I love \"\r\n if i !=s:\r\n c+= \"that\"\r\n else:\r\n c+= \"it\"\r\nprint(c)", "def hulk(n):\r\n alist=[]\r\n for i in range(n-1):\r\n if i%2==0:\r\n alist.append(\"I hate that\")\r\n elif i%2!=0:\r\n alist.append(\"I love that\")\r\n if n%2==0:\r\n alist.append(\"I love it\")\r\n elif n%2!=0:\r\n alist.append(\"I hate it\")\r\n return alist\r\nn=int(input())\r\nresult=hulk(n)\r\nfor res in result:\r\n print(res,end=\" \")", "n = int(input())\r\n\r\narr = [0] * n\r\n\r\nfor i in range(n):\r\n if i + 1 == n and (i + 1) % 2 != 0:\r\n arr[i] = 'I hate it'\r\n elif i + 1 == n and (i + 1) % 2 == 0:\r\n arr[i] = 'I love it'\r\n else:\r\n if (i + 1) % 2 != 0:\r\n arr[i] = \"I hate that\"\r\n else:\r\n arr[i] = 'I love that'\r\n\r\nprint(' '.join(arr))", "n=int(input())\r\nst='I hate '\r\nfor i in range(1,n):\r\n st=st+'that '\r\n if i%2!=0:\r\n st=st+'I love '\r\n else:\r\n st=st+'I hate '\r\nst=st+'it'\r\nprint(st)\r\n ", "n,flag=int(input()),0\r\nfor i in range(1,n+1):\r\n if i==n:\r\n if i%2==0:print('I love it')\r\n else:print('I hate it')\r\n break\r\n if i%2==0:print('I love that',end=' ')\r\n else:print('I hate that',end=' ')", "n=int(input())\r\ns=''\r\ni=0\r\nwhile i<n:\r\n if i%2==0:\r\n s+=\"I hate \"\r\n else:\r\n s+=\"I love \"\r\n if i< n-1:\r\n s+=\"that \"\r\n i+=1\r\ns+=\" it\"\r\nprint(s)\r\n", "n = int(input())\r\nprint(' '.join(['I hate', 'I love'][i % 2] + (' that' if i != n - 1 else ' it') for i in range(n)))", "n = int(input())\r\nfeelings = []\r\n\r\nfor i in range(1, n):\r\n feelings.append(\"I hate that\" if i % 2 == 1 else \"I love that\")\r\n\r\nfeelings.append(\"I hate it\" if n % 2 == 1 else \"I love it\")\r\n\r\nprint(\" \".join(feelings))\r\n", "a = int(input())\r\nb = \"I love that \"\r\nc = \"I hate that \"\r\ne = \"I love it\"\r\nf = \"I hate it\"\r\ng = str()\r\nh = 0\r\nif a % 2 != 0:\r\n for i in range((a - 1) // 2):\r\n g += c\r\n g += b\r\n g += f\r\nelse:\r\n for i in range((a - 2) // 2):\r\n g += c\r\n g += b\r\n g += c\r\n g += e\r\nprint(g)", "n = int(input())\r\narray = ['I hate', 'I love'] * 50\r\nprint(*array[:n], sep=' that ', end=' it')", "n = int(input())\r\ni = True\r\nfor _ in range(n - 1):\r\n if i:\r\n print(\"I hate that \", end=\"\")\r\n i = False\r\n else:\r\n print(\"I love that \", end=\"\")\r\n i = True\r\n\r\nif n % 2 == 0:\r\n print(\"I love it\")\r\nelse:\r\n print(\"I hate it\")\r\n", "love = 'I love'\r\nhate = 'I hate'\r\nn = int(input())\r\ni = 0\r\nres = ''\r\nwhile i < n:\r\n if i%2==0:\r\n if i==0:\r\n res += hate\r\n else:\r\n res += ' that ' + hate\r\n else: res += ' that ' + love\r\n i += 1\r\n\r\nres += ' it'\r\nprint(res)\r\n\r\n", "n=int(input())\r\na='I hate that '\r\nb='I love that '\r\nc='that'\r\nans=''\r\nif n==1:\r\n print('I hate it')\r\nelif n>1:\r\n for i in range (n):\r\n if i!=(n-1):\r\n if i%2==1:\r\n ans+=b\r\n elif i%2==0:\r\n ans+=a\r\n elif i==(n-1):\r\n if i%2==0:\r\n ans+='I hate it'\r\n else:\r\n ans+='I love it'\r\nprint(ans)\r\n \r\n", "n = int(input())\r\n\r\n# Strings\r\nhate = \"I hate\"\r\nlove = \"I love\"\r\nit = \"it\"\r\nthat = \"that\"\r\n\r\noutput = [hate]\r\n\r\nfor i in range(1, n):\r\n if i % 2 == 1:\r\n output.extend([that, love])\r\n else:\r\n output.extend([that, hate])\r\n\r\noutput.append(it)\r\n\r\nprint(\" \".join(output))", "\n\nn = int(input())\n\ns = ''\nfor i in range(n):\n s += 'I '\n if i % 2 == 0:\n s += 'hate '\n else:\n s += 'love '\n if i != n - 1:\n s += 'that '\ns += 'it'\nprint(s)\n \n ", "n = int(input())\r\n\r\nsugar = \"\"\r\n\r\nodd = \"I hate that \"\r\neven = \"I love that \"\r\n\r\nfor i in range(1,n+1):\r\n if i%2==0:\r\n sugar+= even\r\n else:\r\n sugar+= odd\r\n if i==n:\r\n pp = sugar.split(\" \")\r\n pp[-2] = \"it\"\r\n sugar = \" \".join(pp)\r\n \r\nprint(sugar)", "#705A\r\na=int(input())\r\nb=a\r\ns=''\r\ns1='I hate '\r\ns2='I love '\r\nfor i in range(a):\r\n if i%2==0:\r\n s+=s1\r\n else:\r\n s+=s2\r\n if b-1>0:\r\n s+='that '\r\n b-=1\r\ns+='it'\r\nprint(s)", "n=int(input())\r\nprint('I hate that I love that '*(n//2 if n%2!=0 else n//2-1)+('I hate that I love it' if n%2==0 else 'I hate it'))", "s1 = 'I hate'\r\ns2 = 'I love'\r\nresult = ''\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n if i%2!=0:\r\n result+=s2+' '\r\n else:\r\n result+=s1+' '\r\n if i!= n-1:\r\n result+= 'that ' \r\n\r\nresult+='it '\r\nprint(result)", "# Read the number of layers\r\nn = int(input())\r\n\r\n# Initialize the feeling string\r\nfeeling = \"I hate\"\r\n\r\n# Loop to add \"that I love\" or \"that I hate\" for each layer\r\nfor i in range(1, n):\r\n if i % 2 == 1:\r\n feeling += \" that I love\"\r\n else:\r\n feeling += \" that I hate\"\r\n\r\n# Add \" it\" to complete the feeling\r\nfeeling += \" it\"\r\n\r\n# Print the feeling\r\nprint(feeling)\r\n", "n = int(input())\r\n\r\nhate = 'I hate'\r\nlove = 'I love'\r\n\r\nresult = ''\r\n\r\ni = 0\r\n\r\nwhile i < n:\r\n if i % 2 == 0:\r\n if i == 0:\r\n result += hate\r\n else:\r\n result += ' that ' + hate\r\n else:\r\n result += ' that ' + love\r\n\r\n i += 1\r\n\r\nresult += ' it'\r\nprint(result)", "k=int(input())\r\na=[]\r\nfor i in range(k):\r\n if i%2==0:\r\n a.append(\"I hate\")\r\n else:\r\n a.append(\"I love\")\r\nb=\" that \".join(a)\r\nb+=\" it \"\r\nprint(b)", "n=int(input())\nx=[]\nfor i in range(n):\n if i%2==0:\n x+=['I hate', 'that']\n else:\n x+=['I love', 'that']\n\nx[-1]='it'\nprint(*x)", "ans=[]\r\ntemp=[]\r\nn=int(input())\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\ttemp.append(\"I hate \")\r\n\telif i%2!=0:\r\n\t\ttemp.append(\"I love \")\r\nans.append(\"that \".join(temp))\r\nans.append(\"it\")\r\nprint(\"\".join(ans))", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport itertools\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log, ceil\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right\r\n\r\nmod=1000000007\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\n\r\n\r\ndef solve():\r\n s = \"I hate\"\r\n n = int(input())\r\n\r\n for i in range(2, n+1):\r\n if i % 2 == 0:\r\n s += \" that I love\"\r\n else:\r\n s += \" that I hate\"\r\n s += \" it\"\r\n return s\r\n \r\nif __name__ == \"__main__\":\r\n print(solve())", "\r\nlayers = int(input())\r\nif layers % 2 == 0:\r\n for i in range(int(layers / 2 - 1)):\r\n print(\"I hate that I love that \", end='')\r\n print(\"I hate that I love it\", end='')\r\nelse:\r\n for i in range(int((layers - 1) / 2)):\r\n print(\"I hate that I love that \", end='')\r\n print(\"I hate it\", end='')\r\n", "n=int(input())\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n print(\"I hate \",end=\"\")\r\n if i<n:\r\n print(\"that \",end=\"\")\r\n else:\r\n print(\"I love \",end=\"\")\r\n if i < n:\r\n print(\"that \",end=\"\")\r\nprint(\"it\")\r\n ", "n=int(input())\r\ns = ['I hate', 'I love'] * 50\r\ns_s=s[:n]\r\nprint(' that '.join(s_s), end=' it')", "n=int(input())\r\ns=\"I hate it\"\r\nif(n==1):\r\n print(s)\r\nelse:\r\n for i in range(n-1):\r\n l=s.split(\" \")\r\n l.pop()\r\n s=\" \".join(l)\r\n if(i%2==0):\r\n s+=\" that I love it\"\r\n else:\r\n s+=\" that I hate it\"\r\n print(s)", "n = int(input())\r\nh = ' I hate '\r\nt = 'that'\r\nl = ' I love '\r\ni = 'it'\r\ns = ''\r\nfor j in range(1,n+1):\r\n if j==1:\r\n s = s+'I hate '\r\n elif j%2==1:\r\n s = s + h\r\n else:\r\n s = s+l\r\n if j != n:\r\n s = s+t\r\ns = s+i\r\nprint(s)\r\n", "n=int(input())\r\na=\"I hate \"\r\nb=\"I love \"\r\nl=\"\"\r\nfor i in range(1,n+1):\r\n if 1<i<n+1:\r\n l+=\"that \"\r\n if i%2!=0:\r\n l+= a\r\n else:\r\n l+= b\r\n \r\nl+=\"it\"\r\nprint(l)", "c = ''\r\nfor i in range(int(input())):\r\n if i % 2 == 0:\r\n c += \"I hate that \"\r\n else:\r\n c += \"I love that \"\r\nprint(c[:len(c)-5]+\"it\")\r\n", "def creat(n):\r\n s=''\r\n for i in range(n):\r\n if((i+1)%2==1 and i+1==n):\r\n s+='I hate it'\r\n elif((i+1)%2==0 and i+1==n):\r\n s+='I love it'\r\n elif((i+1)%2==0 and i+1!=n):\r\n s+='I love that'\r\n elif((i+1)%2==1 and i+1!=n):\r\n s+='I hate that'\r\n s+=' '\r\n return s\r\n\r\nn=int(input())\r\nprint(creat(n))\r\n", "num = int(input())\n\nprint(\" that \".join([\"I love\" if i % 2 == 0 else \"I hate\" for i in range(1, num+1)]) + \" it\")\n", "k=int(input())\r\nif k==1:\r\n print(\"I hate it\")\r\nelse:\r\n for i in range(1,k):\r\n if i%2==0:\r\n print(\"I love that\",end=\" \")\r\n else:\r\n print(\"I hate that\",end=\" \")\r\nif k!=1 and k%2!=0:\r\n print(\"I hate it\")\r\nelif k%2==0:\r\n print(\"I love it\")", "n=int(input())\r\nst=''\r\nfor i in range(1,n+1):\r\n\r\n if i%2!=0:\r\n st=st+'I hate '\r\n else:\r\n st=st+'I love '\r\n if n>1:\r\n st=st+'that '\r\n n-=1\r\n else:\r\n st=st+'it '\r\n\r\nprint(st)", "n=int(input())\r\nfor i in range(1,n+1):\r\n if (i%2)!=0:\r\n print(\"I hate\",end=\" \")\r\n elif (i%2)==0:\r\n print(\"I love\",end=\" \")\r\n if i==(n):\r\n print(\"it\")\r\n else:\r\n print(\"that\",end=\" \")", "# URL: https://codeforces.com/problemset/problem/705/A\n\nprint(\"I hate\", end=\"\")\nfor i in range(2, int(input()) + 1):\n if i % 2 == 0:\n print(\" that I love\", end=\"\")\n else:\n print(\" that I hate\", end=\"\")\nprint(\" it\")\n", "n = int(input())\r\nfeeling = []\r\nfor i in range(1 , n+1) : \r\n if i%2 ==1 :\r\n feeling.append('I hate ')\r\n else :\r\n feeling.append('I love ')\r\n \r\n if i<n :\r\n feeling.append('that ') \r\nfeeling.append('it') \r\nresult =''.join(feeling) \r\nprint(result)\r\n", "#Initializes the number of layers\r\nlayers = int(input())\r\nanswer = ''\r\n\r\n#adds a phrase the amount of times as indicated\r\nfor i in range(layers):\r\n if i % 2 == 0: #if the number is currently odd or even\r\n answer += 'I hate '\r\n else:\r\n answer += 'I love '\r\n if i != (layers - 1): #if the number is the same as the input or not\r\n answer += 'that '\r\n else:\r\n answer += 'it'\r\n\r\nprint(answer)", "n = int(input())\r\nturn = False\r\nans = \"\"\r\nfor i in range(n -1):\r\n if turn:\r\n ans += \"I love that \"\r\n turn = False\r\n else:\r\n ans += \"I hate that \"\r\n turn = True\r\nif turn:\r\n ans += \"I love it \"\r\n turn = False\r\nelse:\r\n ans += \"I hate it \"\r\n turn = True\r\nprint(ans) \r\n", "# your code goes here\r\ndef main():\r\n n = int(input())\r\n\r\n if n == 1:\r\n print(\"I hate it\")\r\n elif n > 1:\r\n print(\"I hate that\", end=\"\")\r\n\r\n for i in range(2, n):\r\n if i % 2 == 1 and i != n:\r\n print(\" I hate that\", end=\"\")\r\n elif i % 2 == 0 and i != n:\r\n print(\" I love that\", end=\"\")\r\n\r\n if n % 2 == 0 and n > 1:\r\n print(\" I love it\")\r\n elif n > 1:\r\n print(\" I hate it\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s1 = \"that I love\"\r\ns2 = \"that I hate\"\r\nn = int(input())\r\nprint(\"I hate\", end=' ')\r\n\r\nf = True\r\nfor i in range(n - 1):\r\n if f:\r\n print(s1, end=' ')\r\n f = False\r\n else:\r\n print(s2, end=' ')\r\n f = True\r\nprint(\"it\")", "t = int(input())\r\nif t == 1:\r\n print(\"I hate it\",end = \" \")\r\nelif t == 2:\r\n print(\"I hate that I love it\",end = \" \")\r\nelse:\r\n for i in range(1,t+1):\r\n if i%2!=0:\r\n print(\"I hate\",end = \" \")\r\n elif i%2==0:\r\n print(\"I love\",end = \" \")\r\n if i == t:\r\n print(\"it\")\r\n break\r\n print(\"that\",end = \" \")\r\n ", "number = int(input())\r\n\r\nwhile number:\r\n print(\"I hate \", end='')\r\n number -= 1\r\n if number == 0:\r\n print(\"it \", end='')\r\n break\r\n else:\r\n print(\"that \", end='')\r\n\r\n if number:\r\n print(\"I love \", end='')\r\n number -= 1\r\n if number == 0:\r\n print(\"it\")\r\n break\r\n else:\r\n print(\"that \", end='')\r\n", "n=int(input())\r\ns=\"\"\r\nfor i in range(1,n+1):\r\n if i%2==1 and i==n:\r\n s+=\"I hate it\"\r\n elif i%2==1:\r\n s+=\"I hate that \"\r\n elif i%2==0 and i==n:\r\n s+=\"I love it\"\r\n elif i%2==0:\r\n s+=\"I love that \"\r\nprint(s)", "n=int(input())\r\nhate='I hate'\r\nlove='I love'\r\nans=hate\r\nh=False\r\nfor i in range(1,n):\r\n ans+=' that '\r\n if h:\r\n ans+=hate\r\n h=False\r\n else:\r\n ans+=love\r\n h=True\r\nans+=' it'\r\nprint(ans)", "n = int(input())\r\nans = \"I hate \"\r\nfor i in range(2,n+1):\r\n \r\n if i%2 == 0:\r\n ans = ans + \"that I love \"\r\n else:\r\n ans = ans + \"that I hate \"\r\n\r\nans = ans+\"it\"\r\nprint(ans)\r\n ", "T = int(input())\r\nl = ''\r\nfor i in range(1,T+1):\r\n if i%2 == 0 and not(i == T):\r\n l += 'I love that' + ' '\r\n elif not(i%2 == 0) and not(i == T) and T > 1:\r\n l += 'I hate that' + ' '\r\n elif not(i%2 == 0) and (i == 1 or i == T):\r\n l += 'I hate it' + ' '\r\n elif i%2 == 0 and i == T:\r\n l += 'I love it' + ' '\r\nprint(l)", "def hate_adder(b):\r\n b=b+\"I hate \"\r\n return b\r\ndef love_adder(b):\r\n b=b+\"I love \"\r\n return b\r\nn=int(input())\r\na=\"\"\r\nfor i in range(1,n+1):\r\n if(i%2==1):\r\n a=hate_adder(a)\r\n if(i!=n):\r\n a=a+\"that \"\r\n else:\r\n a=love_adder(a)\r\n if(i!=n):\r\n a=a+\"that \"\r\nprint(a+\"it\")", "n = int(input())\r\ns1 = 'I hate that '\r\ns2 = 'I love that '\r\nk1 = 'I hate it'\r\nk2 = 'I love it'\r\nans = []\r\nfor i in range(1,n+1):\r\n if i%2:\r\n if i == n:\r\n ans.append(k1)\r\n else:\r\n ans.append(s1)\r\n else:\r\n if i == n:\r\n ans.append(k2)\r\n else:\r\n ans.append(s2)\r\nprint(''.join(ans))", "n = int(input())\r\nif n == 1:\r\n print(\"I hate it\")\r\nelse:\r\n output = \"I hate\"\r\n for i in range(2, n+1):\r\n if i % 2 == 0:\r\n output += \" that I love\"\r\n else:\r\n output += \" that I hate\"\r\n output += \" it\"\r\n print(output)\r\n", "n=int(input())\r\nstring=\"\"\r\nfor i in range(1,n+1):\r\n if i%2!=0 and i==n:\r\n string+=\"I hate it \"\r\n elif i%2!=0:\r\n string+=\"I hate that \"\r\n elif i%2==0 and i==n:\r\n string+=\"I love it \"\r\n else:\r\n string+=\"I love that \" \r\nprint(string)", "def hulk_feeling(n):\r\n feelings = []\r\n for i in range(1, n+1):\r\n if i % 2 == 1:\r\n feelings.append(\"I hate\")\r\n else:\r\n feelings.append(\"I love\")\r\n if i < n:\r\n feelings.append(\"that\")\r\n feelings.append(\"it\")\r\n return \" \".join(feelings)\r\n\r\n# Read input\r\nn = int(input().strip())\r\n\r\n# Calculate the feeling and print the result\r\nprint(hulk_feeling(n))\r\n", "import sys\r\nnum = int(sys.stdin.readline().strip())\r\nanswer = []\r\nfor i in range(1, num + 1):\r\n if i == 1:\r\n answer = ['I hate', ' it']\r\n else:\r\n if i % 2 == 0:\r\n answer = answer[0:-1]\r\n answer.append(' that I love')\r\n answer.append(' it')\r\n if i % 2 != 0:\r\n answer = answer[0:-1]\r\n answer.append(' that I hate')\r\n answer.append(' it')\r\naa = ''\r\nfor i in answer:\r\n aa += i\r\nprint(aa)\r\n", "n=int(input())\r\nresult=\"\"\r\nfor m in range(1,n+1):\r\n if m %2!=0:\r\n \r\n if m==n:\r\n result+=\"I hate it\"\r\n else:\r\n result+=\"I hate that\"\r\n elif m%2==0:\r\n if m==n:\r\n result+=\" I love it \"\r\n else:\r\n result+=\" I love that \"\r\nprint(result)", "n = int(input())\n\nlst = [\"I hate\" if i % 2 == 0 else \"I love\" for i in range(n)]\n\nnlst = \" that \".join(lst) + \" it\"\n\nprint(nlst)\n\n\n\n", "n = int(input())\r\nfeel = \"\"\r\nfor i in range(1,n):\r\n if i%2 == 0:\r\n feel += \"I love that \"\r\n else:\r\n feel += \"I hate that \"\r\nfor i in range(1,n+1):\r\n if i==n and i%2==0:\r\n feel += \"I love it\"\r\n elif i==n and i%2 != 0:\r\n feel += \"I hate it\"\r\n else:\r\n pass\r\nprint(feel)", "n = int(input())\r\nfeelings = []\r\n\r\nfor i in range(1, n+1):\r\n if i % 2 == 1:\r\n feelings.append(\"hate\")\r\n else:\r\n feelings.append(\"love\")\r\n\r\nsentence = \" that I \".join(feelings) + \" it\"\r\nprint(\"I\", sentence)\r\n", "num=int(input())\r\nfor i in range(1,num+1):\r\n if i%2==0:\r\n print(\"I love \",end=\"\")\r\n else:\r\n print(\"I hate \",end=\"\")\r\n if i!=num:\r\n print(\"that \",end=\"\")\r\nprint(\"it\")", "n=int(input())\r\nfeeling=[]\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n feeling.append(\"I hate\")\r\n else:\r\n feeling.append(\"I love\")\r\n if i!=n:\r\n feeling.append(\"that\")\r\nfeeling.append(\"it\")\r\nresult = \" \".join(feeling)\r\nprint(result)\r\n", "n = int(input())\r\nx = \"I hate\"\r\nj = \" that I love \"\r\nk = \"that I hate\"\r\nfor i in range(0,n-1):\r\n if i%2==0:\r\n x+=j\r\n else:\r\n x+=k\r\n\r\nx=x+\" it\"\r\nprint(x)", "x=int(input())\r\ns1=\"I hate that I love that \"\r\ns2=\" I love it\"\r\ns3=\"I hate it\"\r\ns5=\"I hate that\"\r\nfor i in range(x):\r\n if(x==1):\r\n print(\" I hate it\")\r\n elif(x%2==0):\r\n print((s1)*((x//2)-1)+ s5+ s2)\r\n elif(x%2!=0):\r\n print((s1)*((x//2))+ s3 ) \r\n break\r\n\r\n", "if __name__ == \"__main__\":\r\n num = int(input())\r\n hate = \"I hate\"\r\n love = \"I love\"\r\n art = \"it\"\r\n art_det = \"that\"\r\n result = \"\"\r\n for i in range(1, num+1):\r\n if i % 2 == 0:\r\n result += love\r\n else:\r\n result += hate\r\n if i < num:\r\n result += \" \" + art_det + \" \"\r\n result += \" \" + art\r\n print(result)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 12 17:09:38 2023\r\n\r\n@author: zinc 2300012115\r\n\"\"\"\r\nn = int(input())\r\ns = ''\r\nif n == 1:\r\n print('I hate it')\r\nelse:\r\n for i in range(2,n+1):\r\n if i%2 == 0:\r\n s+='that I love '\r\n else:\r\n s+='that I hate '\r\n print(f'I hate {s}it')\r\n \r\n", "n = int(input())\r\na = 1\r\nfor i in range(n):\r\n if i%2 == 0:\r\n print(\"I hate \", end=\"\")\r\n else:\r\n print(\"I love \",end=\"\")\r\n if a <n:\r\n print(\"that \",end=\"\")\r\n a +=1\r\nprint(\"it\")", "n = int(input())\r\ns = \"hate\"\r\nfor i in range(1,n+1):\r\n if i%2 != 0:\r\n if i == n:\r\n print(\"I hate it\",end = \" \")\r\n else:\r\n print(\"I hate that\",end = \" \")\r\n else:\r\n if i == n:\r\n print(\"I love it\",end = \" \")\r\n else:\r\n print(\"I love that\",end = \" \")\r\n", "N = int(input())\r\n\r\nanswer = 'I hate'\r\n\r\nfor i in range(1, N):\r\n answer += ' that '\r\n\r\n if i%2 == 0:\r\n answer += ' I hate '\r\n else:\r\n answer += ' I love '\r\n\r\nprint(answer + ' it')", "n=int(input())\r\nc=''\r\nfor i in range(1,n):\r\n if i%2==0:\r\n c+='I love that '\r\n else:\r\n c+='I hate that '\r\nif n%2==0:\r\n c+='I love it'\r\nelse:\r\n c+='I hate it'\r\nif n==1:\r\n print(\"I hate it\")\r\nelse:\r\n print(c)", "n = int(input())\r\nflag = True\r\nwhile n != 0:\r\n if n != 1:\r\n if flag == True:\r\n print('I hate that', end = ' ')\r\n flag = False\r\n else:\r\n print('I love that', end = ' ')\r\n flag = True\r\n elif flag == True:\r\n print('I hate it')\r\n else:\r\n print('I love it')\r\n n -= 1\r\n", "n = int(input())\r\nans = \"I hate\"\r\nfor i in range(1,n):\r\n if i & 1:\r\n ans += \" that I love\"\r\n else:\r\n ans += \" that I hate\"\r\n\r\nans += \" it\"\r\nprint(ans)", "hate = [\"I hate it\", \"I hate that\"]\r\nlove = [\"I love it\", \"I love that\"]\r\nn = int(input())\r\nres = []\r\nturn = 0\r\nindex = 1\r\ncurrent = hate\r\nfor i in range(n-1, -1, -1):\r\n if turn == 0:\r\n current = hate\r\n turn = 1\r\n elif turn == 1:\r\n current = love\r\n turn = 0\r\n if i == 0:\r\n index = 0\r\n res.append(current[index])\r\nres = \" \".join(res)\r\nprint(res)", "x = int(input())\r\n\r\nl1 = \"I hate \"\r\nl2 = \"I love \"\r\nfinal = \"\"\r\n\r\nfor i in range(x):\r\n if i % 2 == 0:\r\n final = final + l1\r\n else:\r\n final = final + l2\r\n if i != x - 1:\r\n final = final + \"that \"\r\n \r\nfinal = final + \"it\"\r\nprint(final)", "n=int(input())\r\nres=''\r\ns1=\"I love\"\r\ns2=\"I hate\"\r\ns3=\" it\"\r\ns4=\" that \"\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n if n-i>0:\r\n res=res+s2+s4\r\n elif i==n:\r\n res=res+s2+s3\r\n if i%2==0:\r\n if n-i>0:\r\n res=res+s1+s4\r\n elif i==n:\r\n res=res+s1+s3\r\nprint(res)", "total_layers = int(input())\r\n\r\nfor layer in range(total_layers):\r\n if layer % 2 == 0:\r\n print(\"I hate\", end=\" \")\r\n else:\r\n print(\"I love\", end=\" \")\r\n if layer != total_layers - 1:\r\n print(\"that\", end=\" \")\r\n\r\nprint(\"it\")", "n=int(input())\r\nresult=\"\"\r\nfor i in range(1, n+1):\r\n if i%2==0:\r\n if i==n:\r\n result+=\"I love it\"\r\n print(result)\r\n break\r\n else:\r\n result+=\"I love that \"\r\n \r\n else:\r\n if i==n:\r\n result+=\"I hate it\"\r\n print(result)\r\n break\r\n else:\r\n result+=\"I hate that \"\r\n \r\n \r\n ", "n = int(input())\r\n\r\n\r\nans = \"\"\r\n\r\n\r\nfor i in range(n):\r\n if i & 1 :\r\n ans += \"I love that\" + \" \"\r\n else :\r\n ans += \"I hate that\" + \" \"\r\n\r\nans = ans.strip(\"that \")\r\n\r\nprint(ans + \" it\")", "n=int(input())\r\nfeeling=''\r\nfor i in range(1,n+1):\r\n if i%2 == 1:\r\n feeling+='I hate '\r\n else:\r\n feeling+='I love '\r\n if i!=n:\r\n feeling+='that '\r\nfeeling+='it'\r\nprint(feeling)", "h = \"I hate\"\r\nl = \"I love\"\r\nthat = \" that \"\r\nresult = \"\"\r\nn = int(input())\r\nfor i in range(n-1):\r\n if i%2 == 0:\r\n result += h + that\r\n else :\r\n result += l + that\r\n\r\nif n % 2 == 0 :\r\n result += l + \" it\"\r\nelse :\r\n result += h + \" it\"\r\n\r\nprint(result)", "n=int(input())\r\nlst=list()\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n lst.append(\"I hate it\")\r\n \r\n else:\r\n lst.append(\"I love it\")\r\nstring=\" \".join(lst)\r\nprint(string.replace(\"it\",\"that\",n-1))", "x = []\r\noutput = \"\"\r\nnumber = int(input())\r\nfor i in range(0,number):\r\n \r\n if i%2 !=0 :\r\n x.append(\"I love that \")\r\n\r\n else:\r\n x.append(\"I hate that \")\r\n\r\n if i == number - 1:\r\n x[i] = x[i].replace('that','it')\r\n\r\nfor i in range (0,number):\r\n output+= x[i]\r\nprint(output)", "stroka = int(input())\r\n\r\nhate = 'I hate'\r\nlove = 'I love'\r\n\r\nresult=''\r\ni=0\r\n\r\nwhile i<stroka:\r\n if i%2==0:\r\n if i==0:\r\n result += hate\r\n else:\r\n result += ' that ' + hate\r\n else:\r\n result += ' that ' + love\r\n i+=1\r\nresult+=' it'\r\nprint(result)", "n = int(input())\r\nstr = \"I hate it\"\r\nfor i in range(1,n):\r\n if i % 2 != 0:\r\n str = str[:len(str)-2] + \"that I love it\"\r\n else:\r\n str = str[:len(str)-2] + \"that I hate it\"\r\nprint(str)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Jul 10 18:53:30 2023\n\n@author: yesenia\n\"\"\"\n\nlayers = int(input())\ni = 1\na = \"\"\nwhile True:\n \n if i % 2 != 0:\n a += \"I hate \" \n else:\n a += \"I love \"\n \n if i == layers:\n break\n i += 1\n a += \"that \"\n\nprint(a, \"it\") ", "n = int(input())\r\na = [\"I hate \", \"I love \"] * 100\r\na = a[:n]\r\no = \"that \".join(str(i) for i in a)\r\nprint(o, end = \"it\")", "\r\ndef strings(n):\r\n s1=\"I hate \"\r\n s2=\"I love \"\r\n s3=\"that \"\r\n s4=\"it \"\r\n a=\"\"\r\n for i in range(1,n+1):\r\n if i%2==1:\r\n if i==n:\r\n a=a+s1+s4\r\n else:\r\n a=a+s1+s3\r\n else:\r\n if i==n:\r\n a=a+s2+s4\r\n else:\r\n a=a+s2+s3\r\n print(a) \r\nn=int(input())\r\nstrings(n)\r\n ", "layers = int(input())\r\nstr = \"\"\r\n\r\nfor i in range(layers):\r\n if len(str) > 0: \r\n str += \" that \"\r\n if i % 2 == 0:\r\n str += \"I hate\"\r\n else:\r\n str += \"I love\"\r\n \r\nstr += \" it\"\r\n\r\nprint(str)\r\n ", "a=int(input())\r\nwazly=[]\r\n\r\nfor x in range(1,a+1):\r\n if x == a:\r\n if x % 2 == 0:\r\n wazly.append(\"I love it\")\r\n else:\r\n wazly.append(\"I hate it\")\r\n\r\n elif x % 2 == 1:\r\n wazly.append(\"I hate that \")\r\n elif x % 2 == 0:\r\n wazly.append(\"I love that \")\r\n\r\nfor l in wazly:\r\n print(l,end=\"\")\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nprint(\"I hate\",end=\" \")\r\nfor i in range(1,n):\r\n if i%2==1:\r\n print(\"that I love\",end=\" \")\r\n else:\r\n print(\"that I hate\",end=\" \")\r\nprint(\"it\")", "n = int(input()) \r\nm = [\"I hate\", \"I love\"] * n \r\nprint(\" that \".join(m[:n]), \"it\")", "n = int(input())\r\n\r\nfor i in range (n) :\r\n if i != (n-1) :\r\n if (i+1)%2 == 1 :\r\n print(\"I hate that\", end=\" \")\r\n else :\r\n print(\"I love that\", end=\" \")\r\n else :\r\n if n%2 == 1 :\r\n print(\"I hate it\")\r\n else : \r\n print(\"I love it\")\r\n\r\n ", "a = int(input())\r\nstring = \"\"\r\nfor i in range(a-1):\r\n if i%2 == 0:\r\n string += \"I hate that \"\r\n if i%2 == 1:\r\n string += \"I love that \"\r\nif a%2 == 0:\r\n string += \"I love it \"\r\nif a%2 == 1:\r\n string += \"I hate it \"\r\nprint(string)\r\n", "n=int(input());s=\"I hate it\"\r\nL=s.split()\r\nM=\"that I love it\".split()\r\nN=\"that I hate it\".split()\r\nif n==1:\r\n print(s)\r\nelse:\r\n for i in range(2,n+1):\r\n if i%2==0:\r\n L.remove(L[-1])\r\n L.extend(M)\r\n else:\r\n L.remove(L[-1])\r\n L.extend(N)\r\n r=\" \".join(L)\r\n print(r)\r\n", "n= int(input())\r\na=''\r\nfor i in range(n):\r\n if i%2==0:\r\n a+='I hate '\r\n else:\r\n a+='I love '\r\n if i<n-1:\r\n a+='that '\r\na+='it'\r\nprint(a)", "def hulk(n):\r\n feelings = [\"I hate\", \"I love\"]\r\n result = \"\"\r\n\r\n for i in range(1, n + 1):\r\n if i % 2 == 1:\r\n result += feelings[0]\r\n else:\r\n result += feelings[1]\r\n\r\n if i != n:\r\n result += \" that \"\r\n\r\n result += \" it\"\r\n return result\r\n\r\nn = int(input())\r\nprint(hulk(n))\r\n", "# Hulk\r\nn = int(input())\r\nsentimientos = ['I hate' if x % 2 != 0 else 'I love' for x in range(1, n + 1)]\r\nprint(\" that \".join(sentimientos)+\" it\")", "n=int(input())\na=\" I hate that\"\nb=\" I love that\"\nval = \"\"\nif n==1:\n val = \"I hate it\"\nelif n%2!=0:\n val=\"I hate that\"+(n//2-1)*(b+a)+b+\" I hate it\"\nelse:\n val=\"I hate that\"+(n//2-1)*(b+a)+\" I love it\"\n\nprint(val)\n", "n = int(input())\r\nm1 = \"I hate it\"\r\nm2 = \"I love it\"\r\nm3 = \"I hate that\"\r\nm4 = \"I love that\"\r\nk = n\r\nif n == 1:\r\n print(m1)\r\nelif n == 2:\r\n print(m3 + \" \" + m2)\r\nelse:\r\n while(n != 1):\r\n print(m3, end = \" \")\r\n n -= 1\r\n if n == 1:\r\n break\r\n else:\r\n print(m4, end = \" \")\r\n n -= 1\r\n if k%2 == 0:\r\n print(m2)\r\n else:\r\n print(m1)", "a=int(input())\r\ns=\"I hate\"\r\nfor i in range(2,a+1):\r\n if (i%2==0):\r\n s+=\" that I love\"\r\n else:\r\n s+=\" that I hate\"\r\ns+=\" it\"\r\nprint(s)", "n=int(input())\r\nl= \"I hate it\"\r\nl2=\"I hate that\"\r\nl1=\"I love it\"\r\nl3=\"I love that\"\r\ns=\"\"\r\nfor i in range(n):\r\n if n==1:\r\n s=s+l\r\n else:\r\n if (i+1)%2==0 and i==n-1:\r\n s=s+l1\r\n elif (i+1)%2==0 and i!=n-1 :\r\n s=s+l3\r\n elif (i+1)%2!=0 and i==n-1 :\r\n s=s+l\r\n else:\r\n s=s+l2\r\n s=s+\" \"\r\nprint(s)", "a= int(input())\r\nfor i in range(0,a):\r\n if(i==a-1):\r\n if(i==a-1 and i%2!=0):\r\n print(\"I love it\",end=\" \")\r\n if(i==a-1 and i%2==0):\r\n print(\"I hate it\",end=\" \")\r\n else:\r\n if(i%2==0):\r\n print(\"I hate that\",end=\" \")\r\n else:\r\n print(\"I love that\",end=\" \")\r\n", "n = int(input())\r\n\r\nfeeling = \"I hate\"\r\nfor i in range(2, n + 1):\r\n feeling += \" that I \" + (\"love\" if i % 2 == 0 else \"hate\")\r\n\r\nfeeling += \" it\"\r\nprint(feeling)\r\n", "n = int(input())\r\nl = [\"I hate\", \"I love\"] * n\r\nprint(\" that \".join(l[:n]),\"it\")", "import math\r\nt = 1#int(input())\r\nfor q in range(0, t):\r\n # lenght = int(input())\r\n # # lenght = 2\r\n # s = input().split(\" \")\r\n #chislo, delit = map(int, input().split(' '))\r\n n = int(input())\r\n\r\n # s2 = input().split(' ')\r\n # for i in range(0, len(s2)):\r\n # s2[i] = int(s2[i])\r\n\r\n for i in range(1, n + 1):\r\n if i != n:\r\n if i % 2 == 0:\r\n print('I love that ', end='')\r\n else:\r\n print('I hate that ', end='')\r\n else:\r\n if i % 2 == 0:\r\n print('I love it ', end='')\r\n else:\r\n print('I hate it ', end='')", "n = int(input())\r\na = 'I hate'\r\nb = 'I love'\r\nfinal = ''\r\n\r\nfor i in range(1, n + 1):\r\n if i % 2 == 1:\r\n if i < n:\r\n final += a + ' that '\r\n else:\r\n final += a + ' it'\r\n else:\r\n if i < n:\r\n final += b + ' that '\r\n else:\r\n final += b + ' it'\r\n\r\nprint(final)", "n=int(input())\r\nl = [] \r\nfor i in range(n):\r\n if i % 2 == 0:\r\n l.append(\"I hate\")\r\n else: \r\n l.append(\"I love\")\r\n if i == n - 1: \r\n l.append(\"it\")\r\n else:\r\n l.append(\"that\")\r\nprint(\" \".join(l)) \r\n", "n = int(input())\r\nbase = 'I hate that I love that ' * ((n - 1) // 2)\r\nadd = 'I hate it' if n % 2 != 0 else 'I hate that I love it'\r\nprint(base + add)\n# Mon Jul 10 2023 22:25:38 GMT+0300 (Moscow Standard Time)\n", "x = int(input())\r\ny = []\r\nfor i in range(1 , x+1):\r\n if i%2 == 0:\r\n y.append('I love')\r\n else:\r\n y.append(\"I hate\")\r\n if i != x :\r\n y.append(\" that \")\r\nst = ''.join(y) + ' it'\r\n\r\nprint(st)", "n = int(input())\r\nif n == 1:\r\n print('I hate it')\r\nelif n == 2:\r\n print('I hate that I love it')\r\nelse:\r\n s = ''\r\n for i in range(1, n):\r\n if i % 2 == 1:\r\n s += 'I hate ' + 'that '\r\n else:\r\n s += 'I love ' + 'that '\r\n if n % 2 == 1:\r\n s += 'I hate it'\r\n else:\r\n s += 'I love it'\r\n print(s)", "n=int(input())\r\ns=\"I hate\"\r\nfor i in range(1,n):\r\n s=s+' that '\r\n if i%2!=0:\r\n s=s+'I love'\r\n else:\r\n s=s+'I hate'\r\ns=s+' it'\r\nprint(s)", "n = int(input())\r\nstring = \"I hate \"\r\nfor i in range(1,n):\r\n if(i%2 != 0):\r\n string += \"that I love \"\r\n else:\r\n string += \"that I hate \"\r\n\r\nprint(string + \"it\")", "n= int(input())\r\n\r\nh=\"hate\"\r\nl=\"love\"\r\ni='I'\r\nt=\"that I\"\r\nit=\"it\"\r\nj=0\r\n\r\nif n==1:\r\n print(\"I hate it\")\r\nelse:\r\n print(i, end=\" \")\r\n while j<n:\r\n\r\n if j%2==0:\r\n print(h, end=\" \")\r\n if j%2!=0:\r\n print(l, end=\" \")\r\n if j!=n-1:\r\n print(t, end=\" \")\r\n if j==n-1:\r\n print(it, end=\" \")\r\n j+=1", "def hulk_feeling(layers):\r\n feeling = []\r\n for i in range(layers):\r\n feeling.append('I')\r\n if i % 2 == 0:\r\n feeling.append('hate')\r\n else:\r\n feeling.append('love')\r\n if i == layers - 1:\r\n feeling.append('it')\r\n else:\r\n feeling.append('that')\r\n return feeling\r\n\r\n[print(item, end=' ') for item in hulk_feeling(layers=int(input()))]", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\n\nif n == 1:\n sys.stdout.write(\"I hate it\")\n exit()\n\nstr_list = [None] * n\n\nfor i in range(n):\n if i % 2 == 0:\n str_list[i] = \"I hate\"\n\n elif i % 2 != 0:\n str_list[i] = \"I love\"\n\nstring = \" that \".join(str_list) + \" it\"\nsys.stdout.write(f\"{string}\")\n", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n layers = [\"I hate\", \"I love\"]\n n = int(input())\n print(\" that \".join(layers[i % 2] for i in range(\n n)) + \" it\" if n > 1 else layers[0] + \" it\")\n\n\nif __name__ == \"__main__\":\n main()\n", "a=int(input())-1\r\ns='I hate'\r\ng=0\r\nfor i in range(a):\r\n if g%2:\r\n s+=\" that I hate\"\r\n else:\r\n s+=\" that I love\"\r\n g+=1\r\nprint(s+\" it\")", "x = int(input())\r\ny = \"I hate \"\r\nfor i in range(2, x+1):\r\n if i % 2 == 0:\r\n y += \" that I love \"\r\n else:\r\n y += \" that I hate \"\r\ny += \"it\"\r\nprint(y)", "n=int(input())\r\nc=''\r\nfor i in range(1,n+1):\r\n if i % 2 != 0 :\r\n if i==1:\r\n c+='I hate'\r\n else:\r\n c+=' that '+'I hate'\r\n else:\r\n c+=' that '+'I love '\r\nprint(c+' it')", "n = int(input())\r\n\r\nlast = \"I love\"\r\n\r\ns = \"\"\r\nfor i in range(n):\r\n if last==\"I love\":\r\n s += \" I hate that\"\r\n last = \"I hate\"\r\n elif last==\"I hate\":\r\n s += \" I love that\"\r\n last = \"I love\"\r\n\r\n\r\ns = s.rstrip(\"that\")\r\ns += \"it\"\r\nprint(s.lstrip())", "n = int(input())\r\nodds = \"I hate \"\r\nevens = \"I love \"\r\nendl1 = \"it\"\r\nendl2 = \"that \"\r\nres = \"\"\r\nfor i in range(1,n+1):\r\n if i%2==0:\r\n res += evens\r\n if i==n:\r\n res += endl1\r\n else:\r\n res += endl2\r\n else:\r\n res += odds\r\n if i==n:\r\n res += endl1\r\n else:\r\n res += endl2\r\nprint(res)\r\n \r\n ", "a=int(input())\r\nif a==1:\r\n print(\"I hate it\")\r\nelif a%2==0:\r\n print(\"I hate that \",\"I love that I hate that \"*(a//2-1),\"I love it\",sep=\"\")\r\nelse:\r\n print(\"I hate that I love that \"*(a//2),\"I hate it\",sep=\"\")", "n=int(input())\r\nme=''\r\nuse='I hate that I love that '\r\nif n%2==0:\r\n base='I hate that I love it'\r\n for i in range(int(n/2)-1):\r\n me+=use\r\n me+=base\r\nelse:\r\n base='I hate it'\r\n for i in range(int(n/2)):\r\n me+=use\r\n me+=base\r\nprint(me)", "n = int(input())\r\ns = ''\r\nfor i in range(1, n+1):\r\n s += 'I hate that ' if i%2 else 'I love that '\r\n\r\ns = s[:-5] + 'it'\r\nprint(s)", "n=int(input())\r\na=n%2\r\nli=[\"I love it\", \"I hate it\"]\r\nans=[]\r\nwhile True:\r\n if n==1:\r\n ans.append(li[a])\r\n break\r\n elif n%2==a:\r\n ans.append(\"I hate that\")\r\n else:\r\n ans.append(\"I love that\") \r\n n-=1\r\nprint(\" \".join(ans))", "n = int(input())\r\n\r\ns = ''\r\n\r\nfor i in range(n-1):\r\n if (i+1)%2==0:\r\n s += 'I love that '\r\n else:\r\n s += 'I hate that '\r\nif n%2 == 0:\r\n s += 'I love it'\r\nelse:\r\n s += 'I hate it'\r\nprint(s)", "n = int(input())\r\ns1 = \"I hate\"\r\ns2 = \"I love\"\r\notv = \"I hate\"\r\nfor i in range(2, n+1):\r\n if i%2==1:\r\n otv += \" that \" + s1\r\n else:\r\n otv += \" that \" + s2\r\nprint(otv + \" it\")", "n = int(input())\na = [\"I hate\", \"I love\"] * n\nprint(\" that \".join(a[:n]),\"it\")", "n = int(input())\r\ndef speech(n):\r\n a = 'I hate it'\r\n b = 'I love it'\r\n c = 'I hate that'\r\n d = 'I love that'\r\n sentence = []\r\n if n == 1:\r\n print('I hate it')\r\n else:\r\n for i in range(n - 1):\r\n if i % 2 == 0:\r\n sentence.append(c)\r\n else:\r\n sentence.append(d) \r\n if n % 2 == 0:\r\n sentence.append(b)\r\n else:\r\n sentence.append(a)\r\n return ' '.join(sentence)\r\nresult = speech(n)\r\nprint(result)", "a = 'I hate that '\r\nb = 'I love that '\r\nr = ''\r\nn = int(input())\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n if i == n - 1:\r\n r += 'I hate it'\r\n else:\r\n r += a\r\n else:\r\n if i == n - 1:\r\n r += 'I love it'\r\n else:\r\n r += b\r\nprint(r.rstrip())", "\r\nnum_repetitions = int(input())\r\n\r\nphrases = ['I hate', 'I love'] * 50\r\n\r\nselected_phrases = phrases[:num_repetitions]\r\n\r\n\r\nformatted_output = ' that '.join(selected_phrases)\r\n\r\n\r\nprint(formatted_output, end=' it')\r\n", "n = int(input())\nx = ''\nfor i in range(n):\n\tif x == '':\n\t\tx += 'I hate'\n\telif i%2 == 0:\n\t\tx += ' that I hate'\n\telse:\n\t\tx += ' that I love'\n\nprint(x+' it')\t\t\t\t", "def feeling(x,y):\r\n z=\"\"\r\n k=0\r\n for i in range(0,x):\r\n if k == 2:\r\n k=0\r\n if x > i+1 :\r\n z+=y[k]+\"that \"\r\n k+=1\r\n continue\r\n elif i <= x:\r\n z+=y[k]+\"it\"\r\n break\r\n return z\r\n\r\nx=int(input(\"\"))\r\ny=[\"I hate \",\" I love \"]\r\nprint(feeling(x,y))", "n = int(input())\r\ns = 'I hate that '\r\ns1 = 'I love that '\r\nx = ''\r\nif n <= 1:\r\n print('I hate it')\r\nelse:\r\n for i in range(1,n):\r\n if i % 2 == 0:\r\n x += s1\r\n else:\r\n x+=s\r\n if n % 2 == 0:\r\n print(x+'I love it')\r\n else:\r\n print(x+'I hate it')\r\n \r\n", "n = int(input())\r\nlst = []\r\nfor i in range(n):\r\n\tif i % 2 == 0:\r\n\t\tlst.append(\"I hate\")\r\n\telse:\r\n\t\tlst.append(\"I love\")\r\n\tif n > 1:\r\n\t\tif i != n - 1:\r\n\t\t\tlst.append(\"that\")\r\nlst.append(\"it\")\r\nprint(*lst)\r\n\r\n\r\n\r\n", "n=int(input())\r\nodd=\"I hate\"\r\neven=\"I love\"\r\nstr=\"\"\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n str+=odd\r\n else:\r\n str+=even\r\n if(n!=i):\r\n str+=\" that \"\r\nprint(str+\" it\")", "numb = int(input())\r\nh, l = \" that I hate\", \" that I love\"\r\nprint(\"I hate\", end=\"\")\r\nfor i in range(numb - 1):\r\n if i % 2 == 0:\r\n print(l, end=\"\")\r\n else:\r\n print(h, end=\"\")\r\nprint(\" it\")\r\n", "l=int(input())\r\nfor i in range(1,l+1):\r\n if(i%2==1):\r\n print(\"I hate \",end=\"\")\r\n else:\r\n print(\"I love \",end=\"\")\r\n if(i!=l):\r\n print(\"that \",end=\"\")\r\nprint(\"it\",end=\" \")\r\n ", "n=int(input())\r\na='I hate that I love that '*(n//2)\r\nif n%2==1:\r\n print(a+'I hate it')\r\nelse:\r\n print(a[:-5]+'it')", "n = int(input())\r\n\r\nif n==1: print(\"I hate it\\n\")\r\nelse:\r\n for i in range(1,n+1,1):\r\n if i%2 and i<n: \r\n print(\"I hate that\",end=' ')\r\n elif i%2==0 and i<n:\r\n print(\"I love that\",end=' ')\r\n else:\r\n if i%2: \r\n print(\"I hate it\\n\")\r\n else:\r\n print(\"I love it\\n\")", "try:\r\n n = int(input())\r\n if n >= 1 and n <= 100:\r\n\r\n bf,bfi,fs = [\"I hate\",\"I love\"],0,\"\"\r\n\r\n for i in range(n):\r\n fs += bf[bfi]\r\n \r\n if bfi == 1: bfi = 0\r\n else: bfi = 1\r\n\r\n if i != n-1: fs += \" that \"\r\n else: fs += \" it\"\r\n \r\n print(fs)\r\n\r\nexcept: pass", "n = int(input())\r\na = 'I hate'\r\nb = 'that'\r\nc = 'I love'\r\n\r\nfor i in range(n):\r\n if(i%2 ==0):\r\n print(f\"{a} \",end=\"\")\r\n else:\r\n print(f\"{c} \",end=\"\") \r\n \r\n if(i != n-1):\r\n print(f\"{b} \",end=\"\") \r\n\r\nprint(\"it\")", "n = int(input())\r\nlst = []\r\nfor i in range(n):\r\n if i % 2 != 0:\r\n lst.append(\"I love\")\r\n else:\r\n lst.append(\"I hate\")\r\n\r\nprint((\" that \".join(lst)) + \" it\")\r\n", "def hulk():\r\n n = int(input())\r\n s = ['I hate ', 'I love '] * n\r\n # print(s[:n])\r\n print('that '.join(s[:n]) + 'it')\r\n \r\nif __name__ == '__main__':\r\n hulk()", "import sys\r\n \r\nN = int(sys.stdin.readline())\r\na = \"that I love \"\r\nb = \"that I hate \"\r\ntemp = 1\r\nanswer = \"I hate \"\r\n \r\nwhile True:\r\n if N == 1:\r\n answer += \"it\"\r\n break\r\n elif N > 1:\r\n if temp == 1:\r\n answer += a\r\n N -= 1\r\n temp = 2\r\n elif temp == 2:\r\n answer += b\r\n N -= 1\r\n temp = 1\r\n \r\nprint(answer)", "n = int(input())\r\narray = []\r\nagrege_hate = False\r\nfor i in range(n):\r\n if agrege_hate:\r\n array.append(\"I love it\" if i == n - 1 else \"I love that\")\r\n agrege_hate = False\r\n else:\r\n array.append(\"I hate it\" if i == n - 1 else \"I hate that\")\r\n agrege_hate = True\r\n\r\nprint(\" \".join(array))", "# 705A - Hulk\r\n# https://codeforces.com/problemset/problem/705/A\r\n\r\n# Inputs:\r\n# 1) N - Número de capas\r\nn = int(input())\r\n\r\n# Frase de Hulk\r\nfrase = ''\r\n\r\n# Construye la frase\r\nfor capa in range(1,n+1):\r\n\r\n # Si la capa es impar, entonces añade 'I hate'\r\n if capa % 2 == 1:\r\n frase += 'I hate '\r\n \r\n # Si la capa es par, entonces añade 'I love'\r\n if capa % 2 == 0:\r\n frase += 'I love '\r\n\r\n # Si es la última capa, entonces termina la frase con 'it'\r\n if capa == n:\r\n frase += 'it'\r\n break\r\n\r\n # Entre capas, escribe 'that'\r\n frase += 'that '\r\n\r\n# Imprime la frase resultante\r\nprint(frase)", "a = int(input())\r\ntotal = 1\r\nq = []\r\nfor i in range(a):\r\n q.append('I')\r\n if i % 2 == 0:\r\n q.append('hate')\r\n else:\r\n q.append('love')\r\n if 0 < a - total:\r\n q.append('that')\r\n total += 1\r\nq.append('it')\r\nprint (' '.join(q))", "feelings = \"\"\r\nn = int(input())+1\r\nfor i in range(1,n):\r\n feelings += \"I hate\" if i%2!=0 else \"I love\"\r\n if i == n-1:\r\n break\r\n if n>2:\r\n feelings+=\" that \"\r\n \r\nfeelings+= \" it\"\r\nprint(feelings)", "def solve(n):\r\n ans = \"\"\r\n for i in range(1, n+1):\r\n if i % 2 == 1:\r\n ans += \"I hate\"\r\n else:\r\n ans += \"I love\"\r\n \r\n if i != n:\r\n ans += \" that \"\r\n else:\r\n ans += \" it\"\r\n return ans\r\n\r\n\r\ndef main():\r\n # Reading multiple test cases\r\n n = int(input())\r\n print(solve(n))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=int(input())\r\ntotal,d=[],''\r\nfor i in range(1,a+1):\r\n if i%2==0:\r\n total.append(\"I love\")\r\n else:\r\n total.append(\"I hate\")\r\nfor i in range(len(total)-1):\r\n d+=f\"{total[i]} that \"\r\nd+=f\"{total[-1]} it\"\r\nprint(d)", "n=int(input())\r\nsentence=[]\r\nx=1\r\nwhile x<=n:\r\n if x%2==1:\r\n sentence.append('that I hate')\r\n else:\r\n sentence.append('that I love')\r\n x+=1\r\nsentence=' '.join(sentence).split()\r\ndel sentence[0]\r\nsentence.append('it')\r\nprint(' '.join(sentence))", "n=int(input())\r\nstr=''\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n str=str+'I hate'\r\n else:\r\n str=str+'I love'\r\n if i!=n:\r\n str=str+' that '\r\nstr=str+' it'\r\nprint(str)\r\n ", "def express_feelings(n):\r\n if n==1:\r\n return \"I hate it\"\r\n elif n==2:\r\n return \"I hate that I love it\";\r\n else:\r\n return \"I hate that I love that \"+express_feelings(n-2)\r\nn=int(input())\r\nfeeling=express_feelings(n)\r\nprint(feeling)", "n = int(input())\r\ns = []\r\nfor i in range(1, n+1):\r\n if i == 1:\r\n s += 'I hate it'.split()\r\n elif i % 2 == 0:\r\n del s[s.index('it')]\r\n s += 'that I love it'.split()\r\n else:\r\n del s[s.index('it')]\r\n s += 'that I hate it'.split()\r\nprint(*s)", "n=int(input())\r\nof=True\r\nif n==1:\r\n print(\"I hate it\")\r\nelse:\r\n while n>0:\r\n if n==1:\r\n if of == True:\r\n print(\"I hate it\")\r\n else:\r\n print(\"I love it\")\r\n break\r\n elif of == True:\r\n print(\"I hate that\",end=\" \")\r\n of = False\r\n elif of == False:\r\n print(\"I love that\",end=\" \")\r\n of = True\r\n n=n-1\r\n", "n = int(input())\r\nline = ''\r\nfor i in range(1,n+1):\r\n if i % 2 == 0:\r\n line += 'I love '\r\n if i == n:\r\n line += 'it '\r\n else:\r\n line += 'that '\r\n elif i % 2 != 0:\r\n line += 'I hate '\r\n if i == n:\r\n line += 'it '\r\n else:\r\n line += 'that '\r\nprint(line)\r\n", "n = int(input())\r\ns1 = \"I hate\"\r\ns2 = \"I love\"\r\nfinal = \"\"\r\nfor i in range(n):\r\n if i>0:\r\n final +=\" that \"\r\n if i%2==0:\r\n final +=s1\r\n else:\r\n final +=s2\r\nprint(final+\" it\")", "n=int(input(\"\"))\r\ns=\"\"\r\nif n==1:\r\n s+=\"I hate it\"\r\nelse:\r\n for i in range(n):\r\n i=i+1\r\n if i+1 > n:\r\n if n%2 == 0:\r\n s += \"I love it\"\r\n else:\r\n s += \"I hate it\"\r\n else:\r\n if i%2 == 0:\r\n s += \"I love that \"\r\n else:\r\n s += \"I hate that \"\r\nprint(s)\r\n", "a = int(input())\r\n\r\n\r\nhate = 'I hate'\r\nlove = 'I love'\r\n\r\nresult = ''\r\nfor i in range(a):\r\n if i%2 == 0:\r\n if i == 0:\r\n result += hate\r\n else:\r\n result += ' that ' + hate\r\n else:\r\n result += ' that ' + love\r\n \r\nresult += ' it'\r\nprint(result)", "n=int(input())\r\nh='I hate'\r\nlove='I love'\r\nif n==1:print(h+\" it\")\r\nelse:\r\n l=[]\r\n flag=True\r\n for i in range(n): \r\n if flag:\r\n if i>1:l.append('that')\r\n l.append(h)\r\n flag=False\r\n else:\r\n l.append('that')\r\n l.append(love)\r\n flag=True\r\n\r\n l.append('it')\r\n print(*l)", "n = int(input())\n\nstring = \"\"\n\nfor x in range(1, n+1):\n if x % 2 != 0 and x != n:\n string += \"I hate that \"\n elif x % 2 == 0 and x != n:\n string += \"I love that \"\n elif x % 2 == 0 and x == n:\n string += \"I love it\"\n else:\n string += \"I hate it\"\nprint(string)\n\n", "V=''\r\nT=int(input())\r\nfor i in range(1,T+1):\r\n if i%2==0:\r\n V=V+'I love'\r\n if i==T:\r\n V=V+' it'\r\n else:\r\n V=V+' that '\r\n else:\r\n V=V+'I hate'\r\n if i==T:\r\n V=V+' it'\r\n else:\r\n V=V+' that '\r\nprint(V) ", "n = int(input())\r\nfor i in range(n):\r\n print(('I hate' if i%2 == 0 else 'I love'), end=(' it' if i+1 == n else ' that '))", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n if i%2==0:\r\n a.append(\"I hate\")\r\n else:\r\n a.append(\"I love\")\r\n \r\n if i!=n-1:\r\n a.append(\"that\")\r\na.append(\"it\")\r\n \r\nprint(\" \".join(a))", "def hulk(n):\r\n if n == 1:\r\n return \"I hate it\"\r\n \r\n feel = hulk(n - 1)\r\n if n % 2 == 0:\r\n return feel.replace(\"it\", \"that I love it\")\r\n else:\r\n return feel.replace(\"it\", \"that I hate it\")\r\n\r\nn = int(input())\r\nresult = hulk(n)\r\nprint(result)\r\n", "n = int(input())\r\nstring1 = 'I hate'\r\nstring2 = 'I love'\r\noutput = ''\r\nflag = True\r\nfor i in range(n):\r\n if i == n - 1:\r\n flag = False\r\n if i % 2 == 0 and flag:\r\n output += string1 + ' that '\r\n elif i % 2 == 1 and flag:\r\n output += string2 + ' that '\r\n elif i % 2 == 0:\r\n output += string1\r\n else:\r\n output += string2\r\nprint(output + ' it')", "n=int(input())\r\nx=str()\r\nfor i in range (n-1):\r\n if i%2==0:\r\n x=x+'I hate that '\r\n else:\r\n x=x+'I love that '\r\nif n%2==1:\r\n x=x+'I hate it'\r\nelse:\r\n x=x+'I love it'\r\n \r\nprint(x)\r\n", "#https://codeforces.com/problemset/problem/705/A\r\n\r\ndef get_messageListPosition(number):\r\n if(number%2 == 0):\r\n return 0\r\n return 1\r\n\r\ndef get_messageList():\r\n message_list= [\" that I hate\", \" that I love\"]\r\n return message_list\r\n\r\nlayers = int(input())\r\nmessage = \"\"\r\nmessageList = get_messageList()\r\n\r\nmessage += \"I hate\"\r\nfor i in range(1, layers):\r\n message += messageList[get_messageListPosition(i)]\r\nmessage += \" it\"\r\nprint(message)", "got = (int)(input())\r\nstr = \"\"\r\nfor i in range(got):\r\n if i > 0:\r\n str += \"that \"\r\n if i%2 == 0:\r\n str += \"I hate \"\r\n else:\r\n str += \"I love \"\r\n\r\nstr += \"it\"\r\nprint(str)", "n = int(input())\r\nfeelings = \"\"\r\nfor i in range(n):\r\n if i % 2 != 0 and i != (n-1):\r\n feelings += \"I love that \"\r\n elif i % 2 == 0 and i == (n-1):\r\n feelings += \"I hate it\"\r\n elif i % 2 != 0 and i == (n-1):\r\n feelings += \"I love it\"\r\n else:\r\n feelings += \"I hate that \"\r\nprint(feelings)\r\n\r\n\r\n\r\n", "n = int(input())\r\narr = [ \"I love\", \"I hate\"]\r\nans = []\r\nfor i in range(1, n + 1):\r\n ans.append(arr[i % 2])\r\n ans.append(\" that \")\r\nans.pop()\r\nans.append(\" it\")\r\nprint(\"\".join(ans))", "n = int(input())\r\ns = ''\r\n\r\nif n == 1:\r\n s = 'I hate it'\r\nelse:\r\n s = 'I hate that'\r\n\r\nfor i in range(n - 1):\r\n if i % 2 == 0 and i != n - 2:\r\n s += ' I love that'\r\n elif i % 2 != 0 and i != n - 2:\r\n s += ' I hate that'\r\n elif n % 2 == 0 and i == n - 2:\r\n s += ' I love it'\r\n elif n%2 != 0 and i == n - 2:\r\n s += ' I hate it'\r\n\r\nprint(s)\r\n", "def feeling(n):\r\n feelings=\"\"\r\n for i in range(1,n+1):\r\n if i%2==0:\r\n feelings+=\"I love \"\r\n else:\r\n feelings+=\"I hate \" \r\n if i<n:\r\n feelings+=\"that \"\r\n feelings+=\"it\"\r\n return feelings\r\nn=int(input())\r\nprint(feeling(n))\r\n ", "n = int(input())\r\noutput = \"I hate\"\r\nif n > 1:\r\n for i in range(2, n+1):\r\n if i % 2 == 0:\r\n output += \" that I love\"\r\n else:\r\n output += \" that I hate\"\r\noutput += \" it\"\r\nprint(output)", "n=int(input())\r\nk=0\r\na=\"I hate\"\r\nh=2\r\nfor i in range(n-1):\r\n if k==0:\r\n a=a+' that I love'\r\n k=1\r\n else:\r\n a=a+' that I hate'\r\n k=0\r\nprint(a+' it') \r\n", "n=int(input())\r\na=\"\"\r\nfor i in range(1,n+1):\r\n \r\n if i%2!=0 and i==n:\r\n a+=\"I hate it\"\r\n elif i%2==0 and i==n:\r\n \r\n a+=\"I love it\"\r\n elif i%2!=0 and i!=n:\r\n a+=\"I hate that \"\r\n elif i%2==0 and i!=n:\r\n a+=\"I love that \"\r\n \r\nprint(a)", "hulk = int(input())\nhate = \"I hate\"\nlove = \"I love\"\nemotions = \"\"\ni = 0\nwhile i < hulk:\n if i % 2 == 0:\n emotions += hate\n emotions += \" \"\n else:\n emotions += love\n emotions += \" \"\n i += 1\n if i < hulk:\n emotions += \"that\"\n emotions += \" \"\nprint(emotions+\"it\")\n", "nStr = input()\r\nn = int(nStr)\r\nans = \"\"\r\nfor x in range(n):\r\n if x % 2 ==0:\r\n ans += \"I hate \"\r\n else:\r\n ans += \"I love \"\r\n if x == n - 1:\r\n ans += \"it\"\r\n else:\r\n ans += \"that \"\r\nprint(ans)\r\n", "n=int(input())\r\na=\"\"\r\nfor i in range(n-1):\r\n if i%2==0:\r\n a=a+\"I hate that \"\r\n else:\r\n a=a+\"I love that \"\r\nif n%2!=0:\r\n a=a+\"I hate it \"\r\nelse:\r\n a=a+\"I love it \"\r\nprint(a)\r\n", "n = int(input())\r\nlst = list()\r\n\r\nfor i in range(0,n):\r\n if i % 2 == 0:\r\n lst.append('I hate ')\r\n if i % 2 == 1:\r\n lst.append('I love ')\r\n\r\n if i == n-1:\r\n lst.append('it')\r\n break\r\n lst.append('that ')\r\nprint(\"\".join(lst))", "n = int(input())\r\n\r\ns = 'I hate it'\r\nif n > 1:\r\n l1 = 'that I hate it'\r\n l2 = 'that I love it'\r\n for i in range(n - 1):\r\n if i % 2 == 0:\r\n s = s[:-2] + l2\r\n else:\r\n s = s[:-2] + l1\r\nprint(s)", "n = int(input()) # Read the input value of n\r\n\r\nfeelings = [\"I hate\" if i % 2 == 0 else \"I love\" for i in range(n)]\r\n\r\nfeeling = \" that \".join(feelings) + \" it\" # Join the feelings and add \"it\" at the beginning and end\r\n\r\nprint(feeling) # Print Dr. Banner's feeling", "x = int(input(\"\"))\r\nfor i in range(x):\r\n if i == x-1:\r\n if i%2 == 0:\r\n print(\"I hate it\" , end=\" \")\r\n else:\r\n print(\"I love it\", end=\" \")\r\n break\r\n if i%2 == 0:\r\n print(\"I hate that\", end=\" \")\r\n else:\r\n print(\"I love that\", end=\" \")", "q=int(input())\r\nprint(*(['I hate','I love']*50)[:q],sep=' that ',end=' it')", "v=''\r\nh=int(input())\r\nfor i in range(1,h+1):\r\n if i%2==0:\r\n v=v+'I love'\r\n if i==h:\r\n v=v+' it'\r\n else:\r\n v=v+' that '\r\n else:\r\n v=v+'I hate'\r\n if i==h:\r\n v=v+' it'\r\n else:\r\n v=v+' that '\r\nprint(v)", "feeling = int(input())\r\nphrase = \"\"\r\ni = 1\r\nwhile i <= feeling:\r\n if (i % 2 == 1):\r\n phrase = phrase + \"I hate \"\r\n else:\r\n phrase = phrase + \"I love \"\r\n if (i == feeling):\r\n phrase = phrase + \"it\"\r\n else:\r\n phrase = phrase + \"that \"\r\n i = i + 1\r\nprint(phrase)", "n=int(input())\r\nprint('I hate ',end='')\r\nfor i in range(2,n+1):\r\n print('that ',end='')\r\n \r\n if i%2==0:\r\n print('I love ',end='')\r\n else:\r\n print('I hate ',end='')\r\nprint('it')", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n if i%2==1:\r\n if i==n-1:\r\n a.append('I love it')\r\n else: a.append('I love that ')\r\n else:\r\n if i==n-1:\r\n a.append('I hate it')\r\n else: a.append('I hate that')\r\nprint(*a)", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nhate = 'I hate'\r\nlove = 'I love'\r\noutput = [ hate if i%2==0 else love for i in range(n)]\r\n\r\nprint(' that '.join(output) + ' it')\r\n\r\n", "\r\nn= int(input())\r\nisTrue= False\r\nwhile(n):\r\n if not isTrue:\r\n print(\"I hate\",end=\" \" )\r\n isTrue=True\r\n else:\r\n print(\"I love\",end=\" \")\r\n isTrue=False\r\n if n>1:\r\n print(\"that\",end=\" \")\r\n else:\r\n print(\"it\")\r\n n-=1", "n=int(input())\r\nfor i in range(n):\r\n if i%2==0 and i+1==n:\r\n print('I hate it',end=' ')\r\n elif i%2==0 and i+1!=n:\r\n print('I hate that',end=' ')\r\n elif i%2!=0 and i+1!=n:\r\n print('I love that',end=' ')\r\n else:\r\n print('I love it',end=' ')\r\n \r\n", "def main():\r\n n = int(input())\r\n for p in range(n):\r\n if p % 2 == 0:\r\n print(\"I hate \", end=\"\")\r\n else:\r\n print(\"I love \", end=\"\")\r\n\r\n if p == n - 1:\r\n print(\"it\")\r\n else:\r\n print(\"that \", end=\"\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\n\r\nif n == 1:\r\n print(\"I hate it\")\r\nelif n > 1 and n%2 == 0:\r\n lst = [\"I love it\"]\r\n for i in range(1,n):\r\n if i % 2 == 1:\r\n lst.insert(0,\"I hate that\")\r\n else:\r\n lst.insert(0,\"I love that\")\r\n print(\" \".join(lst))\r\nelif n > 1 and n%2 == 1:\r\n lst = [\"I hate it\"]\r\n for i in range(1,n):\r\n if i % 2 == 1:\r\n lst.insert(0,\"I love that\")\r\n else:\r\n lst.insert(0,\"I hate that\")\r\n print(\" \".join(lst))\r\n ", "n = int(input())\r\ns = 'I hate that'\r\nfor i in range(2,n+1):\r\n if (i%2!=0) :\r\n s = s + ' I hate that'\r\n else:\r\n s = s + ' I love that'\r\ns = s + ' it'\r\nl = s.split(' ')\r\nl.pop(len(l)-2)\r\ns = ' '.join(l)\r\nprint(s)", "n = int(input())\r\noutput = \"\"\r\nfor i in range(1, n):\r\n if (i % 2 == 1):\r\n output += \"I hate that \"\r\n else:\r\n output += \"I love that \"\r\nif(n % 2 == 1):\r\n output += \"I hate it\"\r\nelse:\r\n output += \"I love it\"\r\nprint(output)", "n=int(input())\r\ns1=\"I hate that\"\r\ns2=\"I love that\"\r\nif n % 2==0:\r\n for i in range(1,n):\r\n if i % 2==1:\r\n print(s1,end=\" \")\r\n else:\r\n print(s2,end=\" \")\r\n print(\"I love it\")\r\nelse:\r\n for i in range(1,n):\r\n if i % 2==1:\r\n print(s1,end=\" \")\r\n else:\r\n print(s2,end=\" \")\r\n print(\"I hate it\")", "a=int(input())\r\ns=\"\"\r\nc=0\r\nfor i in range(1,a+1):\r\n z=1\r\n if i==a and a%2==0:\r\n s+=\"I love it\"\r\n break\r\n elif i==a and a%2!=0:\r\n s+=\"I hate it\"\r\n break\r\n if z==1 and i%2!=0:\r\n s+=\"I hate that \"\r\n c+=1\r\n z=0\r\n \r\n if c==a:\r\n break\r\n if z==1 and i%2==0:\r\n s+=\"I love that \"\r\n c+=1\r\n z=0\r\n \r\n if c==a:\r\n break\r\n \r\nprint(s)\r\n ", "def bakchodhulk(n):\r\n l=[]\r\n for i in range(n):\r\n if i%2==0:\r\n l.append(\"I hate \")\r\n else:\r\n l.append(\"I love \")\r\n pf= [\"that \".join(l), \" it\"]\r\n return \"\".join(pf)\r\nn= int(input())\r\nprint(bakchodhulk(n))\r\n", "n = int(input())\np1 = \"I hate that\"\np2 = \"I love that\"\np3 = \"I love it\"\np4 = \"I hate it\"\n\nfor i in range(n-1):\n if (i+1)%2 == 0:\n print(p2, end=\" \")\n else:\n print(p1, end=\" \")\nif n%2 == 0:\n print(p3, end=\" \")\nelse:\n print(p4, end=\" \")", "a = int(input())\r\nb = []\r\nfor i in range(a):\r\n if i % 2 == 0:\r\n b.append('I hate')\r\n else:\r\n b.append('I love')\r\n if i == a - 1:\r\n b.append('it')\r\n else:\r\n b.append('that')\r\nprint (' '.join (b))", "n = int(input())\r\na = \"I hate\"\r\nb = \"I love\"\r\ns = []\r\nfor i in range(1,n+1):\r\n if i%2 == 1:\r\n s.append(a)\r\n else:\r\n s.append(b)\r\n if i == n:\r\n s.append(\"it\")\r\n else:\r\n s.append(\"that\")\r\nprint(\" \".join(s))", "n = int(input())\r\n\r\ni = 0\r\n\r\nres = []\r\n\r\nh = True\r\n\r\nwhile i < n - 1:\r\n\r\n if h: res.append('I hate that')\r\n else: res.append('I love that')\r\n\r\n h = not h\r\n\r\n i += 1\r\n\r\nif h: res.append('I hate it')\r\nelse: res.append('I love it')\r\n\r\n\r\nprint(' '.join(res))", "n=int(input())\r\nfeelings=['I hate','I love']\r\nans=''\r\nfor i in range(n):\r\n if i%2==0:\r\n ans+=feelings[i%2]\r\n else:\r\n ans+=feelings[i%2]\r\n if i!=n-1:\r\n ans+=' that '\r\n else:\r\n ans+=' it'\r\nprint(ans)", "n=int(input())-1\r\na=\"I hate\"\r\nb=a+\" that I love that I hate\"*(n//2)+\" that I love\"*(n%2)+\" it\"\r\nprint(b)", "i = int(input())\r\na = \"I hate it\"\r\nb = \"I love it\"\r\n\r\nif i == 1:\r\n print(a)\r\nelse:\r\n flag = True\r\n msg = a\r\n for n in range(i-1):\r\n if flag:\r\n msg = msg.replace('it', 'that ') + b\r\n flag = not(flag)\r\n else:\r\n msg = msg.replace('it', 'that ') + a\r\n flag = not(flag)\r\n print(msg)", "n = int(input())\r\nfeeling=\"\"\r\nfor i in range(n):\r\n i=i+1\r\n if i == 1:\r\n feeling=feeling+\"I hate\"\r\n elif (i % 2) == 0:\r\n feeling=feeling+\" that I love\"\r\n elif (i % 2) != 0:\r\n feeling=feeling+\" that I hate\"\r\n \r\nprint(feeling+\" it\")", "a=\"I hate that \"\r\nb=\" I love that \"\r\n\r\nnumber=int(input())\r\nq=\"\"\r\n\r\nfor i in range(1,number+1):\r\n \r\n if i%2!=0 and i!=number:\r\n q+=a\r\n elif i%2==0 and i!=number:\r\n q+=b\r\n elif i%2!=0 and i==number:\r\n q+=\"I hate it\"\r\n elif i%2==0 and i==number:\r\n q+=\"I love it\"\r\n \r\nprint(q ) \r\n \r\n ", "times = int(input()) \r\nword = \"\"\r\nif times > 1: \r\n for i in range(times-1): \r\n if (i-1) % 2 != 0:\r\n word += 'I hate that '\r\n else: \r\n word += 'I love that '\r\n if times % 2 != 0:\r\n word += 'I hate it'\r\n else:\r\n word += 'I love it'\r\n print(word)\r\nelse:\r\n print('I hate it')", "x=int(input())\na='I hate '\nb='I love '\nc='that '\nout=''\n\nfor i in range(x):\n if i%2!=0:\n out+=b\n else:\n out+=a\n if i!=x-1:\n out+=c\n \nout+='it'\n\nprint(out)\n", "n=int(input())\r\nx= \"\"\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n x +=\"I hate\"\r\n else:\r\n x+=\"I love\"\r\n if i < n - 1:\r\n x+=\" that \"\r\nx +=\" it\"\r\nprint(x)\r\n", "# Read the number of layers\r\nn = int(input())\r\n\r\n# Initialize an empty string\r\nfeeling = \"\"\r\n\r\n# Loop through the layers\r\nfor i in range(1, n+1):\r\n if i % 2 == 1:\r\n feeling += \"I hate \"\r\n else:\r\n feeling += \"I love \"\r\n\r\n # Add \"that\" if it's not the last layer\r\n if i != n:\r\n feeling += \"that \"\r\n\r\n# Add \"it\" at the end\r\nfeeling += \"it\"\r\n\r\n# Print the feeling\r\nprint(feeling)\r\n", "n=int(input())\r\na=\"I hate\"\r\nfor i in range(2, n + 1):\r\n if i%2 == 0:\r\n a+=\" that I love\"\r\n else:\r\n a+=\" that I hate\"\r\na+=\" it\"\r\nprint(a)" ]

{"inputs": ["1", "2", "3", "4", "5", "10", "18", "19", "76", "77", "81", "82", "85", "86", "100", "99", "98", "33", "34", "57", "100"], "outputs": ["I hate it", "I hate that I love it", "I hate that I love that I hate it", "I hate that I love that I hate that I love it", "I hate that I love that I hate that I love that I hate it", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love it", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love it", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate it", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate it", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love it", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ...", "I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate that I love that I hate ..."]}

UNKNOWN

PYTHON3

CODEFORCES

532

8fd162f8011e9ed6789a81a11aa77d54

Winter is here

Winter is here at the North and the White Walkers are close. John Snow has an army consisting of *n* soldiers. While the rest of the world is fighting for the Iron Throne, he is going to get ready for the attack of the White Walkers. He has created a method to know how strong his army is. Let the *i*-th soldier’s strength be *a**i*. For some *k* he calls *i*1,<=*i*2,<=...,<=*i**k* a clan if *i*1<=<<=*i*2<=<<=*i*3<=<<=...<=<<=*i**k* and *gcd*(*a**i*1,<=*a**i*2,<=...,<=*a**i**k*)<=><=1 . He calls the strength of that clan *k*·*gcd*(*a**i*1,<=*a**i*2,<=...,<=*a**i**k*). Then he defines the strength of his army by the sum of strengths of all possible clans. Your task is to find the strength of his army. As the number may be very large, you have to print it modulo 1000000007 (109<=+<=7). Greatest common divisor (gcd) of a sequence of integers is the maximum possible integer so that each element of the sequence is divisible by it. The first line contains integer *n* (1<=≤<=*n*<=≤<=200000) — the size of the army. The second line contains *n* integers *a*1,<=*a*2,<=...,<=*a**n* (1<=≤<=*a**i*<=≤<=1000000) — denoting the strengths of his soldiers. Print one integer — the strength of John Snow's army modulo 1000000007 (109<=+<=7). Sample Input 3 3 3 1 4 2 3 4 6 Sample Output 12 39

[ "import sys\nuseless = sys.stdin.readline()\na = list(map(int,sys.stdin.readline().split()))\nn = 1000001\nmod = 1000000007\ncnt = [0]*n\nfor i in a:\n cnt[i]+=1\narr = [0]*n\nans = 0\nfor i in range(n-1,1,-1):\n j = sum(cnt[i::i])\n if j > 0:\n arr[i]= (j*pow(2,j-1,mod)-sum(arr[i::i]))%mod\n ans=(ans+i*arr[i])%mod\nsys.stdout.write(str(ans))\n\n\t\t \t \t\t \t \t\t\t \t \t\t\t \t \t", "import sys\r\nmod=1000000007\r\nm=int(input())#20w\r\na=list(map(int,sys.stdin.readline().split()))#100w\r\nn=1000001#max a\r\nanswer=0\r\nans=[0]*n\r\ncnt=[0]*n\r\nfor i in a:\r\n cnt[i]+=1\r\nfor i in range(n-1,1,-1):\r\n j=sum(cnt[i::i])\r\n if j>0:\r\n ans[i]=(j*(2**(j-1))-sum(ans[(2*i)::i]))%mod\r\n answer=(answer+i*ans[i])%mod\r\nprint(answer)\r\n\r\n\r\n", "input();a=list(map(int,input().split()));n,p=1000001,1000000007;c=[0]*n\r\nfor i in a:c[i]+=1\r\nr,t=[0]*n,0\r\nfor i in range(n-1,1,-1):\r\n k=sum(c[i::i])\r\n if k>0:r[i]=(k*pow(2,k-1,p)-sum(r[i::i]))%p;t=(t+i*r[i])%p\r\nprint(t,end='')", "import sys\r\n\r\nmod = 1000000007\r\nm = int(input()) # 20w\r\na = list(map(int, sys.stdin.readline().split())) # 100w\r\nn = 1000001 # max a\r\nanswer = 0\r\nans = [0] * n\r\ncnt = [0] * n\r\nfor i in a:\r\n cnt[i] += 1\r\nfor i in range(n - 1, 1, -1):\r\n j = sum(cnt[i::i])\r\n if j > 0:\r\n ans[i] = (j * (2 ** (j - 1)) - sum(ans[(2 * i)::i])) % mod\r\n answer = (answer + i * ans[i]) % mod\r\nprint(answer)\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\nmod = pow(10, 9) + 7\r\na = list(map(int, input().split()))\r\nl = max(a) + 5\r\ncnt = [0] * l\r\nfor i in a:\r\n cnt[i] += 1\r\ndp = [0] * l\r\npow2 = [1]\r\nfor _ in range(n + 5):\r\n pow2.append(2 * pow2[-1] % mod)\r\nans = 0\r\nfor i in range(l - 1, 1, -1):\r\n s = 0\r\n for j in range(i, l, i):\r\n s += cnt[j]\r\n if not s:\r\n continue\r\n dpi = s * pow2[s - 1] % mod\r\n for j in range(2 * i, l, i):\r\n dpi = (dpi - dp[j]) % mod\r\n ans += dpi * i % mod\r\n ans %= mod\r\n dp[i] = dpi\r\nprint(ans)" ]

{"inputs": ["3\n3 3 1", "4\n2 3 4 6"], "outputs": ["12", "39"]}

UNKNOWN

PYTHON3

CODEFORCES

5

902081dac1e789e7037f497776442362

Recover Polygon (easy)

The zombies are gathering in their secret lair! Heidi will strike hard to destroy them once and for all. But there is a little problem... Before she can strike, she needs to know where the lair is. And the intel she has is not very good. Heidi knows that the lair can be represented as a rectangle on a lattice, with sides parallel to the axes. Each vertex of the polygon occupies an integer point on the lattice. For each cell of the lattice, Heidi can check the level of Zombie Contamination. This level is an integer between 0 and 4, equal to the number of corners of the cell that are inside or on the border of the rectangle. As a test, Heidi wants to check that her Zombie Contamination level checker works. Given the output of the checker, Heidi wants to know whether it could have been produced by a single non-zero area rectangular-shaped lair (with axis-parallel sides). The first line of each test case contains one integer *N*, the size of the lattice grid (5<=≤<=*N*<=≤<=50). The next *N* lines each contain *N* characters, describing the level of Zombie Contamination of each cell in the lattice. Every character of every line is a digit between 0 and 4. Cells are given in the same order as they are shown in the picture above: rows go in the decreasing value of *y* coordinate, and in one row cells go in the order of increasing *x* coordinate. This means that the first row corresponds to cells with coordinates (1,<=*N*),<=...,<=(*N*,<=*N*) and the last row corresponds to cells with coordinates (1,<=1),<=...,<=(*N*,<=1). The first line of the output should contain Yes if there exists a single non-zero area rectangular lair with corners on the grid for which checking the levels of Zombie Contamination gives the results given in the input, and No otherwise. Sample Input 6 000000 000000 012100 024200 012100 000000 Sample Output Yes

[ "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\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ninp = lambda dtype: dtype(input().strip())\r\ninp_d = lambda dtype: [dtype(x) for x in input().split()]\r\ninp_2d = lambda dtype, n: [inp(dtype) for _ in range(n)]\r\ninp_2ds = lambda dtype, n: [inp_d(dtype) for _ in range(n)]\r\ninp_enu = lambda dtype: [(i, x) for i, x in enumerate(inp_d(dtype))]\r\ninp_enus = lambda dtype, n: [[i, inp_d(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 < n\r\ndx, dy = (0, 1, 0, -1, 1, -1, 1, -1), (1, 0, -1, 0, 1, -1, -1, 1)\r\n\r\n\r\ndef find_rect():\r\n coor = [float('inf'), float('inf'), -float('inf'), -float('inf')]\r\n for i in range(n):\r\n for j in range(n):\r\n if grid[i][j] == '4':\r\n coor = [min(coor[0], i), min(coor[1], j), max(coor[2], i), max(coor[3], j)]\r\n\r\n try:\r\n for i in range(coor[0], coor[2] + 1):\r\n for j in range(coor[1], coor[3] + 1):\r\n if grid[i][j] != '4':\r\n exit(print('No'))\r\n except:\r\n exit(print('No'))\r\n\r\n\r\ndef check():\r\n for i in range(n):\r\n for j in range(n):\r\n mem = {(i, j): False, (i, j + 1): False, (i + 1, j): False, (i + 1, j + 1): False}\r\n\r\n for k in range(8):\r\n x, y = i + dx[k], j + dy[k]\r\n\r\n if valid(x, y) and grid[x][y] == '4':\r\n if (x, y) in mem:\r\n mem[(x, y)] = True\r\n if (x, y + 1) in mem:\r\n mem[(x, y + 1)] = True\r\n if (x + 1, y) in mem:\r\n mem[(x + 1, y)] = True\r\n if (x + 1, y + 1) in mem:\r\n mem[(x + 1, y + 1)] = True\r\n\r\n if grid[i][j] != '4' and sum(mem.values()) != int(grid[i][j]):\r\n exit(print('No'))\r\n\r\n\r\nn = inp(int)\r\ngrid = inp_2d(str, n)\r\nfind_rect()\r\ncheck()\r\nprint('Yes')\r\n", "def check_cell(i, j, n):\n\tk = 0\n\tif i > 1 and field[i-1][j]: k += 1\n\tif i < n-1 and field[i+1][j]: k += 1\n\tif j > 1 and field[i][j-1]: k += 1\n\tif j < n-1 and field[i][j+1]: k += 1\n\tif k < 2:\n\t\treturn 0\n\telif k < 4:\n\t\treturn k-1\n\telse:\n\t\treturn 4\n\nn = int(input())\nfield = []\n\nfor i in range(n):\n\ttemp = [int(x) for x in input()]\n\tfield.append(temp)\n\ndef main():\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif field[i][j] and not field[i][j] == check_cell(i, j, n):\n\t\t\t\tprint('No')\n\t\t\t\treturn 0\n\n\tprint('Yes')\n\nmain()", "n = int(input())\nA = [input() for i in range(n)]\n\ndef early_exit():\n print(\"No\")\n exit()\nif n < 3:\n early_exit()\n# first find the corner\ncorner_row = []\nfor i in range(n):\n if '1' in A[i]:\n corner_row.append(i)\nif len(corner_row) != 2:\n early_exit()\n# now for each of the corner row, find the corresponding column\n# check everything before the first index\ndef check_zero(x):\n for i in x:\n if i != '0':\n return False\n return True\n\n\nfor i in range(corner_row[0]):\n if not check_zero(A[i]):\n early_exit()\nfor i in range(corner_row[1]+1, n):\n if not check_zero(A[i]):\n early_exit()\n#find first non-zero for the two corner row\nfor j in range(n):\n if A[corner_row[0]][j] != '0':\n left_corner = j\n break\nfor j in range(n-1,-1,-1):\n if A[corner_row[0]][j] != '0':\n right_corner = j\n break\nif A[corner_row[0]][left_corner] != '1' or A[corner_row[0]][right_corner] != '1' or left_corner == right_corner:\n early_exit()\nfor j in range(n):\n if A[corner_row[1]][j] != '0':\n left2_corner = j\n break\nfor j in range(n-1,-1,-1):\n if A[corner_row[1]][j] != '0':\n right2_corner = j\n break\nif A[corner_row[1]][left2_corner] != '1' or A[corner_row[1]][right2_corner] != '1' or left_corner != left2_corner or right_corner != right2_corner:\n early_exit()\n# by now we have find the row interval to check\n# check the first and last row\nfor i in corner_row:\n for j in range(left_corner+1, right_corner):\n if A[i][j] != '2':\n early_exit()\n# check zero blocks in between\nfor i in range(corner_row[0]+1, corner_row[1]):\n if not check_zero(A[i][:left_corner]):\n early_exit()\n if not check_zero(A[i][right_corner+1:]):\n early_exit()\n if A[i][left_corner] != '2' or A[i][right_corner] != '2':\n early_exit()\n for j in range(left_corner+1, right_corner):\n if A[i][j] != '4':\n early_exit()\n\nprint(\"Yes\")\n \t \t\t\t \t \t \t \t\t \t\t\t \t\t", "def main():\r\n size = int(input())\r\n sq = [[int(c) for c in input().strip()] for _ in range(size)]\r\n print('Yes' if haslair(sq) else 'No')\r\n \r\ndef haslair(sq):\r\n corners = [(r, c) for r, row in enumerate(sq) for c, count in enumerate(row)\r\n if count==1]\r\n if len(corners) != 4:\r\n return False\r\n left, right, top, bottom = corners[0][1], corners[3][1], corners[0][0], corners[3][0]\r\n if right == left + 1 or bottom == top + 1:\r\n return False\r\n for r, row in enumerate(sq):\r\n for c, count in enumerate(row):\r\n score = 3 if top < r < bottom else 1 if r in (top, bottom) else 0\r\n score += 3 if left < c < right else 1 if c in (left, right) else 0\r\n if count != (0, 0, 1, 0, 2, None, 4)[score]:\r\n return False\r\n return True\r\n\r\nmain()", "N = int(input())\ngrid = []\nx1 = 50\ny1 = 50\nx2 = -1\ny2 = -1\nfor y in range(N):\n grid.append(list(map(int, input())))\n for x, num in enumerate(grid[-1]):\n if num == 4:\n x1 = min(x1, x)\n y1 = min(y1, y)\n x2 = max(x2, x)\n y2 = max(y2, y)\n\nif x1 == 51:\n print('No')\nelse:\n for y in range(N):\n for x in range(N):\n ex = 0\n if x1 <= x <= x2 and y1 <= y <= y2:\n ex = 4\n elif (x == x1-1 or x == x2+1) and y1 <= y <= y2:\n ex = 2\n elif (y == y1-1 or y == y2+1) and x1 <= x <= x2:\n ex = 2\n elif (x == x1-1 or x == x2+1) and (y == y1-1 or y == y2+1):\n ex = 1\n if ex != grid[y][x]:\n print('No')\n break\n else:\n continue\n break\n else:\n print('Yes')\n" ]

{"inputs": ["6\n000000\n000000\n012100\n024200\n012100\n000000", "6\n000000\n012210\n024420\n012210\n000000\n000000", "6\n000100\n001210\n002420\n001210\n000000\n000000", "10\n0000000000\n0122210000\n0244420100\n0122210000\n0000000000\n0000000000\n0000000000\n0000000000\n0000000000\n0000000000", "10\n0000000000\n0000000000\n0000000000\n0000000000\n0000000000\n0000000000\n0012100000\n0024200000\n0012100000\n0000000000", "9\n000000000\n000000000\n012221000\n024442000\n012221000\n000000000\n000000000\n000000010\n000000000", "9\n000000000\n012222100\n024444200\n024444200\n024444200\n024444200\n024444200\n012222100\n000000000", "8\n00000000\n00001210\n00002420\n00002020\n00001210\n00000000\n00000000\n00000000", "8\n00000000\n00000000\n01210000\n02420000\n01210000\n00000000\n00000000\n00000000", "7\n0000000\n0000000\n0000000\n1122210\n0244420\n0122210\n0000000", "7\n0000000\n0012210\n0024420\n0012210\n0000000\n0000000\n0000000", "6\n000000\n000000\n001100\n001200\n000000\n000000", "6\n000000\n000000\n002200\n002200\n000000\n000000", "6\n000000\n000000\n003300\n003300\n000000\n000000", "6\n000000\n001100\n013310\n013310\n001100\n000000"], "outputs": ["Yes", "Yes", "No", "No", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "No", "No", "No", "No"]}

UNKNOWN

PYTHON3

CODEFORCES

5

903195a712890e0984e95392fc3fad6d

Positions in Permutations

Permutation *p* is an ordered set of integers *p*1,<=<=*p*2,<=<=...,<=<=*p**n*, consisting of *n* distinct positive integers, each of them doesn't exceed *n*. We'll denote the *i*-th element of permutation *p* as *p**i*. We'll call number *n* the size or the length of permutation *p*1,<=<=*p*2,<=<=...,<=<=*p**n*. We'll call position *i* (1<=≤<=*i*<=≤<=*n*) in permutation *p*1,<=*p*2,<=...,<=*p**n* good, if |*p*[*i*]<=-<=*i*|<==<=1. Count the number of permutations of size *n* with exactly *k* good positions. Print the answer modulo 1000000007 (109<=+<=7). The single line contains two space-separated integers *n* and *k* (1<=≤<=*n*<=≤<=1000,<=0<=≤<=*k*<=≤<=*n*). Print the number of permutations of length *n* with exactly *k* good positions modulo 1000000007 (109<=+<=7). Sample Input 1 0 2 1 3 2 4 1 7 4 Sample Output 1 0 4 6 328

[ "mod=10**9+7\r\nn,k=map(int,input().split())\r\n\r\nA=[0]*(n+1)\r\nB=[0]*(n+1)\r\nC=[0]*(n+1)\r\nF=[0]*(n+1)\r\nG=[0]*(n+1)\r\n\r\nF[0]=G[0]=1\r\nfor i in range(1,n+1):\r\n\tG[i]=F[i]=F[i-1]*i%mod\r\n\tG[i]=pow(F[i],(mod-2),mod)\r\n\r\nfor i in range(0,n):\r\n\tif i*2>n:\r\n\t\tbreak\r\n\tB[i]=(F[n-i]*G[i]*G[n-i*2])%mod\r\nfor i in range(0,n//2+1):\r\n\tfor j in range(0,n//2+1):\r\n\t\tA[i+j]=(A[i+j]+B[i]*B[j])%mod\r\nfor i in range(0,n+1):\r\n\tA[i]=A[i]*F[n-i]%mod\r\nfor i in range(0,n+1):\r\n\tfor j in range(0,i+1):\r\n\t\tC[j]=(C[j]+A[i]*F[i]*G[j]*G[i-j]*(1-(i-j)%2*2))%mod\r\nprint(C[k]%mod)\r\n", "# METO Bot 0.9.9\nmod=10**9+7\nn,k=map(int,input().split())\n\nA=[0]*(n+1)\nB=[0]*(n+1)\nC=[0]*(n+1)\nF=[0]*(n+1)\nG=[0]*(n+1)\n\nF[0]=G[0]=1\nfor i in range(1,n+1):\n\tG[i]=F[i]=F[i-1]*i%mod\n\tG[i]=pow(F[i],(mod-2),mod)\n\nfor i in range(0,n):\n\tif i*2>n:\n\t\tbreak\n\tB[i]=(F[n-i]*G[i]*G[n-i*2])%mod\nfor i in range(0,n//2+1):\n\tfor j in range(0,n//2+1):\n\t\tA[i+j]=(A[i+j]+B[i]*B[j])%mod\nfor i in range(0,n+1):\n\tA[i]=A[i]*F[n-i]%mod\nfor i in range(0,n+1):\n\tfor j in range(0,i+1):\n\t\tC[j]=(C[j]+A[i]*F[i]*G[j]*G[i-j]*(1-(i-j)%2*2))%mod\nprint(C[k]%mod)\n\n\t\t\t\t \t \t \t\t \t \t\t\t \t" ]

{"inputs": ["1 0", "2 1", "3 2", "4 1", "7 4", "7 7", "8 4", "8 5", "10 3", "20 0", "100 99", "13 13", "100 100", "1000 0", "1000 1", "1000 2", "1000 10", "1000 99", "1000 500", "1000 700", "1000 900", "1000 999", "1000 998", "1000 1000", "999 0", "999 1", "999 5", "999 13", "999 300", "999 600", "999 999", "999 989", "999 998", "10 0", "5 0", "5 1", "5 2", "5 3", "5 4", "5 5", "4 4", "4 3", "4 2", "1 1", "2 2", "3 1", "3 3", "2 0", "3 0"], "outputs": ["1", "0", "4", "6", "328", "0", "2658", "688", "614420", "111008677", "2450", "0", "1", "845393494", "418947603", "819706485", "305545369", "115316732", "979041279", "642759746", "301804159", "249500", "583666213", "1", "184907578", "167859862", "642835575", "740892203", "562270116", "553332041", "0", "254295912", "250000", "543597", "21", "36", "42", "12", "9", "0", "1", "2", "10", "0", "1", "0", "0", "1", "2"]}

UNKNOWN

PYTHON3

CODEFORCES

2

903758cfd129ec5da50a446fab0de40f

Mahmoud and Ehab and the function

Dr. Evil is interested in math and functions, so he gave Mahmoud and Ehab array *a* of length *n* and array *b* of length *m*. He introduced a function *f*(*j*) which is defined for integers *j*, which satisfy 0<=≤<=*j*<=≤<=*m*<=-<=*n*. Suppose, *c**i*<==<=*a**i*<=-<=*b**i*<=+<=*j*. Then *f*(*j*)<==<=|*c*1<=-<=*c*2<=+<=*c*3<=-<=*c*4... *c**n*|. More formally, . Dr. Evil wants Mahmoud and Ehab to calculate the minimum value of this function over all valid *j*. They found it a bit easy, so Dr. Evil made their task harder. He will give them *q* update queries. During each update they should add an integer *x**i* to all elements in *a* in range [*l**i*;*r**i*] i.e. they should add *x**i* to *a**l**i*,<=*a**l**i*<=+<=1,<=... ,<=*a**r**i* and then they should calculate the minimum value of *f*(*j*) for all valid *j*. Please help Mahmoud and Ehab. The first line contains three integers *n*,<=*m* and *q* (1<=≤<=*n*<=≤<=*m*<=≤<=105, 1<=≤<=*q*<=≤<=105) — number of elements in *a*, number of elements in *b* and number of queries, respectively. The second line contains *n* integers *a*1,<=*a*2,<=...,<=*a**n*. (<=-<=109<=≤<=*a**i*<=≤<=109) — elements of *a*. The third line contains *m* integers *b*1,<=*b*2,<=...,<=*b**m*. (<=-<=109<=≤<=*b**i*<=≤<=109) — elements of *b*. Then *q* lines follow describing the queries. Each of them contains three integers *l**i* *r**i* *x**i* (1<=≤<=*l**i*<=≤<=*r**i*<=≤<=*n*, <=-<=109<=≤<=*x*<=≤<=109) — range to be updated and added value. The first line should contain the minimum value of the function *f* before any update. Then output *q* lines, the *i*-th of them should contain the minimum value of the function *f* after performing the *i*-th update . Sample Input 5 6 3 1 2 3 4 5 1 2 3 4 5 6 1 1 10 1 1 -9 1 5 -1 Sample Output 0 9 0 0

[ "import bisect\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m, 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, 2):\r\n a[i] *= -1\r\nfor i in range(1, m, 2):\r\n b[i] *= -1\r\ns = 0\r\nfor i in range(n - 1):\r\n s += b[i]\r\ninf = pow(10, 18) + 1\r\nu = [-inf, inf]\r\nd = 1\r\nfor i in range(n - 1, m):\r\n s += b[i]\r\n u.append(d * s)\r\n d *= -1\r\n s -= b[i - n + 1]\r\nu.sort()\r\ns = sum(a)\r\ni = bisect.bisect_left(u, s)\r\nans0 = min(abs(s - u[i - 1]), abs(s - u[i]))\r\nans = [ans0]\r\nfor _ in range(q):\r\n l, r, x = map(int, input().split())\r\n if not (l - r) % 2:\r\n s += x if l % 2 else -x\r\n i = bisect.bisect_left(u, s)\r\n ans0 = min(abs(s - u[i - 1]), abs(s - u[i]))\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))" ]

{"inputs": ["5 6 3\n1 2 3 4 5\n1 2 3 4 5 6\n1 1 10\n1 1 -9\n1 5 -1", "1 1 1\n937982044\n179683049\n1 1 821220804"], "outputs": ["0\n9\n0\n0", "758298995\n1579519799"]}

UNKNOWN

PYTHON3

CODEFORCES

1

904ddf9a4d594b95a85d8cf3bef73636

Turn Off The TV

Luba needs your help again! Luba has *n* TV sets. She knows that *i*-th TV set will be working from moment of time *l**i* till moment *r**i*, inclusive. Luba wants to switch off one of TV sets in order to free the socket. Let's call some TV set redundant if after switching it off the number of integer moments of time when at least one of TV sets is working won't decrease. Luba will be very upset if she has to switch off a non-redundant TV set. Help Luba by telling her the index of some redundant TV set. If there is no any, print -1. The first line contains one integer number *n* (1<=≤<=*n*<=≤<=2·105) — the number of TV sets. Then *n* lines follow, each of them containing two integer numbers *l**i*,<=*r**i* (0<=≤<=*l**i*<=≤<=*r**i*<=≤<=109) denoting the working time of *i*-th TV set. If there is no any redundant TV set, print -1. Otherwise print the index of any redundant TV set (TV sets are indexed from 1 to *n*). If there are multiple answers, print any of them. Sample Input 3 1 3 4 6 1 7 2 0 10 0 10 3 1 2 3 4 6 8 3 1 2 2 3 3 4 Sample Output 1 1 -1 2

[ "n = int(input())\nlis = []\nfor i in range(n):\n\ta, b = map(int, input().split())\n\tlis.append([a, b, i+1])\nlis.sort()\ni = 1\nans = -1\n#Turn off the TV\nwhile i<n:\n\tif lis[i][1]<=lis[i-1][1]:\n\t\tans = lis[i][2]\n\t\tprint(ans)\n\t\texit(0)\n\telif( lis[i][0] <= lis[i-1][0] and lis[i][1] >= lis[i-1][1]):\n\t\tans = lis[i-1][2]\n\t\tprint(ans)\n\t\texit(0)\n\tlis[i][0] = max( lis[i][0], lis[i-1][1] + 1)\n\ti+=1\nprint(ans)\n\n \t \t \t \t\t \t \t \t\t \t\t \t \t", "n = int(input())\r\nlis = []\r\nfor i in range(n):\r\n\ta, b = map(int, input().split())\r\n\tlis.append([a, b, i+1])\r\nlis.sort()\r\ni = 1\r\nans = -1\r\nwhile i<n:\r\n\tif lis[i][1]<=lis[i-1][1]:\r\n\t\tans = lis[i][2]\r\n\t\tprint(ans)\r\n\t\texit(0)\r\n\telif( lis[i][0] <= lis[i-1][0] and lis[i][1] >= lis[i-1][1]):\r\n\t\tans = lis[i-1][2]\r\n\t\tprint(ans)\r\n\t\texit(0)\r\n\tlis[i][0] = max( lis[i][0], lis[i-1][1] + 1)\r\n\ti+=1\r\nprint(ans)", "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\nLRI = []\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n LRI.append((l, r, i))\r\n\r\nLRI.sort()\r\ncur_l = LRI[0][0]\r\ncur_r = LRI[0][1]\r\ncur_idx = LRI[0][2]\r\nfor j in range(1, n):\r\n l, r, i = LRI[j]\r\n if l <= cur_l and cur_r <= r:\r\n print(cur_idx+1)\r\n exit()\r\n if r <= cur_r:\r\n print(i+1)\r\n exit()\r\n else:\r\n cur_l = max(cur_r+1, l)\r\n cur_r = r\r\n cur_idx = i\r\nprint(-1)\r\n", "from collections import defaultdict,deque\r\nimport sys\r\nimport bisect\r\nimport math\r\ninput=sys.stdin.readline\r\nmod=1000000007\r\n\r\nt=int(input())\r\nboth=[]\r\nfor ii in range(t):\r\n l,r=map(int,input().split())\r\n both.append([l,r,ii+1])\r\nboth.sort()\r\ne=-1\r\n#print(both)\r\nfor i in range(t):\r\n if i>0:\r\n if both[i][0]==both[i-1][0]:\r\n print(both[i-1][2])\r\n #print('a')\r\n break\r\n if i<t-1:\r\n if both[i][0]<=e and both[i+1][0]<=e+1 and both[i+1][1]>=both[i][1]:\r\n print(both[i][2])\r\n #print('b')\r\n break\r\n if both[i][0]<=e and both[i][1]<=e:\r\n print(both[i][2])\r\n #print('c')\r\n break\r\n e=max(e,both[i][1])\r\nelse:\r\n print(-1)\r\n", "import sys\r\nfrom heapq import heappop, heappush\r\nfrom collections import Counter\r\n\r\nn = int(sys.stdin.buffer.readline().decode('utf-8'))\r\nquery = []\r\nimos = Counter()\r\n\r\nfor i, (l, r) in enumerate(map(int, line.decode('utf-8').split()) for line in sys.stdin.buffer):\r\n query.append((l, r+1, i+1))\r\n imos[l] += 1\r\n imos[r+1] -= 1\r\n\r\nquery.sort()\r\nacc = 0\r\nhq = []\r\ni = 0\r\n\r\nfor t in sorted(imos.keys()):\r\n while hq and hq[0][0] == t:\r\n print(hq[0][1])\r\n exit()\r\n\r\n acc += imos[t]\r\n if acc > 1:\r\n while i < n and query[i][0] == t:\r\n heappush(hq, (query[i][1], query[i][2]))\r\n i += 1\r\n else:\r\n while i < n and query[i][0] == t:\r\n i += 1\r\n hq.clear()\r\n\r\nprint(-1)\r\n", "import sys\ninput = sys.stdin.readline\nMAX = 10**9\n\ndef read_int():\n return int(input())\n\ndef read_ints():\n return map(int, input().split())\n\ndef read_int_list():\n return [int(i) for i in input().split()]\n\ndef read_string():\n return input().strip()\n\nn = read_int()\na = []\nfor i in range(n):\n l, r = read_ints()\n a.append((l, r, i + 1))\na.sort()\nredundant = -1\nl_prev = -MAX\nr_prev = -MAX\nr_prev2 = -MAX\ni_prev = -MAX\nfor j in range(n):\n l, r, i = a[j]\n if l == l_prev:\n redundant = i_prev\n break\n elif r <= r_prev:\n redundant = i\n break\n elif l <= r_prev2 + 1:\n redundant = i_prev\n break\n l_prev, r_prev, r_prev2, i_prev = l, r, r_prev, i\nprint(redundant)\n \n", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef slide_min(n, k, a):\r\n ans = []\r\n s = deque()\r\n for i in range(n):\r\n ai = a[i]\r\n while s:\r\n if a[s[-1]] >= ai:\r\n s.pop()\r\n else:\r\n break\r\n s.append(i)\r\n while s:\r\n if s[0] + k <= i:\r\n s.popleft()\r\n else:\r\n break\r\n if (i + 1) // k:\r\n ans.append(a[s[0]])\r\n return ans\r\n\r\ndef make_sparse_table(a):\r\n table = []\r\n s, l = a, 1\r\n table.append(s)\r\n while 2 * l <= len(a):\r\n s = slide_min(len(s), l + 1, s)\r\n table.append(s)\r\n l *= 2\r\n return table\r\n\r\ndef get_min(l, r):\r\n d = len(bin(r - l + 1)) - 3\r\n ans = min(table[d][l], table[d][r - pow2[d] + 1])\r\n return ans\r\n\r\npow2 = [1]\r\nfor _ in range(20):\r\n pow2.append(2 * pow2[-1])\r\n\r\nn = int(input())\r\nlr = [list(map(int, input().split())) for _ in range(n)]\r\ns = set()\r\nfor l, r in lr:\r\n s.add(l)\r\n s.add(r)\r\n s.add(r + 1)\r\ns = list(s)\r\ns.sort()\r\nd = dict()\r\nm = len(s)\r\nfor i in range(m):\r\n d[s[i]] = i\r\na = [0] * m\r\nfor l, r in lr:\r\n a[d[l]] += 1\r\n a[d[r + 1]] -= 1\r\nfor i in range(1, m):\r\n a[i] += a[i - 1]\r\ntable = make_sparse_table(a)\r\nans = -1\r\nfor i in range(n):\r\n l, r = lr[i]\r\n if get_min(d[l], d[r]) > 1:\r\n ans = i + 1\r\n break\r\nprint(ans)", "from math import ceil, log2\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\n\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n_str = str\r\nstr = lambda x=b\"\": x if type(x) is bytes else _str(x).encode()\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._file = file\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nread = lambda: map(int, input().strip().split())\r\n\r\n\r\ndef left(idx):\r\n return 2 * idx\r\n\r\n\r\ndef right(idx):\r\n return 2 * idx + 1\r\n\r\n\r\nclass SegmentTree:\r\n def __init__(self, arr):\r\n self.size = len(arr)\r\n self.tree_size = 2 ** ceil(log2(self.size))\r\n self.tree = [0] * 2 * self.tree_size\r\n self.lazy = self.tree.copy()\r\n self.tree[self.tree_size:self.tree_size + self.size] = arr\r\n\r\n def range_min(self, range_left, range_right):\r\n m = float('inf')\r\n range_left += self.tree_size\r\n range_right += self.tree_size\r\n while range_left <= range_right:\r\n if range_left & 1:\r\n m = min(m, self.tree[range_left])\r\n range_left += 1\r\n if not range_right & 1:\r\n m = min(m, self.tree[range_right])\r\n range_right -= 1\r\n range_right //= 2\r\n range_left //= 2\r\n return m\r\n\r\n def range_update(self, range_left, range_right, increment):\r\n range_left += self.tree_size\r\n range_right += self.tree_size\r\n while range_left <= range_right:\r\n if range_left & 1:\r\n self.lazy[range_left] += increment\r\n range_left += 1\r\n if not range_right & 1:\r\n self.lazy[range_right] += increment\r\n range_right -= 1\r\n increment *= 2\r\n range_left //= 2\r\n range_right //= 2\r\n\r\n def final(self):\r\n for idx in range(self.tree_size):\r\n el = self.lazy[idx]\r\n self.lazy[left(idx)] += el // 2\r\n self.lazy[right(idx)] += el // 2\r\n self.lazy[idx] = 0\r\n for idx, el in enumerate(self.lazy[self.tree_size:]):\r\n self.tree[self.tree_size + idx] += el\r\n for idx in reversed(range(1, self.tree_size)):\r\n self.tree[idx] = min(self.tree[left(idx)], self.tree[right(idx)])\r\n\r\n\r\ndct = defaultdict(int)\r\nn = int(input())\r\nind = 0\r\ns = []\r\nlst = [0] * n\r\nfor i in range(n):\r\n t = tuple(read())\r\n lst[i] = t\r\n for el in [t[0], t[1], t[1] + 1]:\r\n dct[el]\r\n\r\nfor i in sorted(dct):\r\n dct[i] = ind\r\n ind += 1\r\n\r\nst = SegmentTree([0] * ind)\r\nfor l, r in lst:\r\n st.range_update(dct[l], dct[r], 1)\r\nst.final()\r\n\r\nfor ind, el in enumerate(lst):\r\n l, r = dct[el[0]], dct[el[1]]\r\n if st.range_min(l, r) > 1:\r\n exit(print(ind + 1))\r\nprint(-1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nsegs = []\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n segs.append((l, r, i + 1))\r\nsegs.sort(key=lambda x: (x[0], -x[1]))\r\nres = -1\r\nfor i in range(n - 1):\r\n if segs[i][1] >= segs[i + 1][1]:\r\n res = segs[i + 1][2]\r\n break\r\n if i > 0 and segs[i - 1][1] + 1 >= segs[i + 1][0]:\r\n res = segs[i][2]\r\n break\r\nprint(res)" ]

{"inputs": ["3\n1 3\n4 6\n1 7", "2\n0 10\n0 10", "3\n1 2\n3 4\n6 8", "3\n1 2\n2 3\n3 4", "3\n0 500000000\n500000001 1000000000\n0 1000000000", "3\n1 5\n2 4\n6 10", "10\n4 4\n5 9\n5 7\n2 8\n6 10\n4 10\n1 3\n8 9\n0 0\n5 7", "2\n1 3\n2 4", "1\n8 9", "8\n13 17\n83 89\n31 33\n7 13\n52 52\n88 89\n29 30\n16 22", "4\n63 63\n12 34\n17 29\n58 91", "3\n1 10\n5 15\n10 20", "2\n1 3\n1 6", "2\n1 2\n1 3", "3\n5 6\n1 3\n1 4", "3\n1 4\n2 100\n4 5", "4\n1 1\n3 3\n4 7\n4 5", "3\n2 3\n3 4\n1 2", "1\n0 0", "6\n99 100\n65 65\n34 34\n16 18\n65 67\n88 88", "2\n50 67\n54 64", "3\n1 3\n2 100\n3 5", "3\n57 90\n35 45\n18 52", "4\n14 15\n46 73\n15 40\n28 53", "3\n37 38\n51 54\n28 28", "2\n64 66\n47 61", "4\n50 68\n63 67\n67 69\n11 12", "4\n42 62\n93 103\n34 62\n5 12", "6\n42 60\n78 107\n6 38\n58 81\n70 105\n70 105", "5\n71 71\n21 22\n58 58\n57 57\n16 16", "7\n28 42\n70 75\n83 92\n19 22\n26 32\n85 99\n30 39", "3\n8 28\n80 110\n39 81", "7\n90 115\n87 113\n2 26\n39 40\n91 112\n42 53\n65 79", "7\n12 13\n26 28\n9 11\n15 15\n8 10\n22 24\n5 7", "7\n3 5\n26 31\n11 15\n2 4\n16 18\n4 4\n7 12", "3\n1 5\n1 2\n4 5", "3\n999999995 999999997\n999999998 1000000000\n999999996 999999999", "4\n1 2\n4 6\n4 10\n200 300"], "outputs": ["1", "1", "-1", "2", "1", "2", "1", "-1", "-1", "6", "1", "2", "1", "1", "2", "3", "4", "1", "-1", "2", "2", "3", "2", "-1", "-1", "-1", "2", "1", "5", "-1", "7", "-1", "5", "-1", "6", "2", "3", "2"]}

UNKNOWN

PYTHON3

CODEFORCES

9

9051057a015389e58fc1a40a5b2455e2

Mail Stamps

One day Bob got a letter in an envelope. Bob knows that when Berland's post officers send a letter directly from city «A» to city «B», they stamp it with «A B», or «B A». Unfortunately, often it is impossible to send a letter directly from the city of the sender to the city of the receiver, that's why the letter is sent via some intermediate cities. Post officers never send a letter in such a way that the route of this letter contains some city more than once. Bob is sure that the post officers stamp the letters accurately. There are *n* stamps on the envelope of Bob's letter. He understands that the possible routes of this letter are only two. But the stamps are numerous, and Bob can't determine himself none of these routes. That's why he asks you to help him. Find one of the possible routes of the letter. The first line contains integer *n* (1<=≤<=*n*<=≤<=105) — amount of mail stamps on the envelope. Then there follow *n* lines with two integers each — description of the stamps. Each stamp is described with indexes of the cities between which a letter is sent. The indexes of cities are integers from 1 to 109. Indexes of all the cities are different. Every time the letter is sent from one city to another, exactly one stamp is put on the envelope. It is guaranteed that the given stamps correspond to some valid route from some city to some other city. Output *n*<=+<=1 numbers — indexes of cities in one of the two possible routes of the letter. Sample Input 2 1 100 100 2 3 3 1 100 2 3 2 Sample Output 2 100 1 100 2 3 1

[ "import sys\r\nfrom collections import deque\r\ninput = sys.stdin.readline\r\ng={}\r\nv=set()\r\nfor _ in range(int(input())):\r\n a,b=[int(x) for x in input().split()]\r\n if a in v:\r\n v.remove(a)\r\n else:\r\n v.add(a)\r\n if b in v:\r\n v.remove(b)\r\n else:\r\n v.add(b)\r\n if a in g:\r\n g[a].append(b)\r\n else:\r\n g[a]=[b]\r\n if b in g:\r\n g[b].append(a)\r\n else:\r\n g[b]=[a]\r\n #g[b]=a\r\nans=[]\r\nfor i in v:\r\n q=deque([[i,-1]])\r\n while q:\r\n curr,par=q.popleft()\r\n ans.append(curr)\r\n for i in g[curr]:\r\n if i!=par:\r\n q.append([i,curr])\r\n break\r\nprint(*ans)", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nct = defaultdict(int)\r\ndc = defaultdict(list)\r\nfor i in range(n) :\r\n x, y = map(int,input().split())\r\n dc[x].append(y)\r\n dc[y].append(x)\r\n ct[x] += 1\r\n ct[y] += 1\r\nstart, par = -1, 0\r\nfor i, j in ct.items() :\r\n if j == 1 :\r\n start = i\r\n break\r\nfor i in range(n+1) :\r\n print(start,end=\" \")\r\n temp = start\r\n for elem in dc[temp] :\r\n if elem != par :\r\n start = elem\r\n break\r\n par = temp", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfrom collections import defaultdict\r\n\r\nn = int(input())\r\nd = defaultdict(list)\r\n\r\nans = []\r\n\r\nfreq = {}\r\n\r\nfor _ in range(n):\r\n x, y = input().strip().split()\r\n\r\n freq[x] = freq.get(x, 0) + 1\r\n freq[y] = freq.get(y, 0) + 1\r\n d[x].append(y)\r\n d[y].append(x)\r\n\r\nvis = set()\r\n\r\nfor k, v in freq.items():\r\n if v == 1:\r\n start = k\r\n vis.add(start)\r\n ans.append(start)\r\n break\r\n\r\ncur = start\r\nfor i in range(n):\r\n for x in d[cur]:\r\n if x not in vis:\r\n vis.add(x)\r\n cur = x\r\n ans.append(x)\r\n\r\nprint(*ans)", "import sys\r\nlines = sys.stdin.readlines()\r\nn = int(lines[0])\r\nd = {}\r\nfor i in range(1, n+1):\r\n\ta, b = map(int, lines[i].split())\r\n\tif a not in d:\r\n\t\td[a] = []\r\n\tif b not in d:\r\n\t\td[b] = []\r\n\td[a].append(b)\r\n\td[b].append(a)\r\nstart = -1\r\nfor k, v in d.items():\r\n\tif len(v) == 1:\r\n\t\tstart = k\r\nprev = -1\r\nans = []\r\nwhile True:\r\n\tans.append(start)\r\n\tv = d[start]\r\n\tnext = v[0]\r\n\tif next == prev:\r\n\t\tif len(v) == 1:\r\n\t\t\tbreak\r\n\t\tnext = v[1]\r\n\tprev, start = start, next\r\nsys.stdout.write(' '.join(map(str, ans)))", "from collections import defaultdict\r\n\r\nn = int(input())\r\ngraph = defaultdict(list)\r\ndegrees = defaultdict(int)\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n degrees[a] += 1\r\n degrees[b] += 1\r\n\r\nstart = None\r\nfor city, degree in degrees.items():\r\n if degree == 1:\r\n start = city\r\n break\r\n\r\npath = [start]\r\nvisited = set()\r\nwhile len(path) < n + 1:\r\n current = path[-1]\r\n visited.add(current)\r\n for neighbor in graph[current]:\r\n if neighbor not in visited:\r\n path.append(neighbor)\r\n break\r\n\r\nprint(*path)", "dict_route = {}\r\ncnt = int(input(\"\").strip())\r\n\r\nfor i in range(cnt):\r\n peer = input(\"\").strip().split()\r\n for p in peer:\r\n if not dict_route.get(p):\r\n dict_route[p] = []\r\n peer_copy = peer.copy()\r\n peer_copy.remove(p)\r\n dict_route[p] += peer_copy\r\n\r\nstart_end_keys = []\r\nfor key, val in dict_route.items():\r\n if len(val) == 1:\r\n start_end_keys.append(key)\r\n\r\nstart_key = start_end_keys[-1]\r\nend_key = start_end_keys[0]\r\n\r\npossible_routes = []\r\nwhile True:\r\n possible_routes.append(start_key)\r\n if start_key == end_key:\r\n break\r\n next_key = dict_route[start_key][0]\r\n dict_route[next_key].remove(start_key) \r\n start_key = next_key\r\n\r\nprint(' '.join(possible_routes))", "from collections import defaultdict, 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 visit = defaultdict(lambda : [])\r\n visit[s] = 1\r\n ans = []\r\n while q:\r\n i = q.popleft()\r\n ans.append(i)\r\n for j in G[i]:\r\n if not visit[j]:\r\n q.append(j)\r\n visit[j] = 1\r\n return ans\r\n\r\nn = int(input())\r\nG = defaultdict(lambda : [])\r\nfor _ in range(n):\r\n u, v = map(int, input().split())\r\n G[u].append(v)\r\n G[v].append(u)\r\nfor i in G.keys():\r\n if len(G[i]) == 1:\r\n s = i\r\n break\r\nans = bfs(s)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "from collections import defaultdict\r\nfrom typing import List, Tuple\r\n\r\n\r\ndef solve(n: int, stamps: List[Tuple[int, int]]) -> str:\r\n visited = set() # type: Set\r\n graph = defaultdict(list) # type: Dict[int, List[int]]\r\n path = [] # type: List[int]\r\n for u, v in stamps:\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n start = [node for node in graph if len(graph[node]) == 1][0]\r\n stack = [start]\r\n while stack:\r\n curr = stack.pop()\r\n visited.add(curr)\r\n path.append(curr)\r\n for adj_node in graph[curr]:\r\n if adj_node not in visited:\r\n stack.append(adj_node)\r\n return ' '.join(map(str, path))\r\n\r\nn = int(input())\r\nstamps = [tuple(map(int, input().split())) for _ in range(n)]\r\nprint(solve(n, stamps))\r\n", "from collections import *\r\n\r\nd, c = defaultdict(int), []\r\n\r\nfor i in range(int(input())):\r\n x, y = map(int, input().split())\r\n\r\n c += [x, y]\r\n \r\n d[x] += y\r\n d[y] += x\r\n\r\na, b = [q for q, k in Counter(c).items() if k == 1]\r\n\r\nq = 0\r\nwhile a != b:\r\n print(a)\r\n q, a = a, d[a] - q\r\n\r\nprint(a)", "n = int(input())\r\nd = dict()\r\nfor _ in range(n):\r\n line = input().split(\" \")\r\n a = int(line[0])\r\n b = int(line[1])\r\n if a in d:\r\n d[a].append(b)\r\n else:\r\n d[a] = [b]\r\n if b in d:\r\n d[b].append(a)\r\n else:\r\n d[b] = [a]\r\nend_cities = list()\r\nfor x in d:\r\n if len(d[x]) == 1:\r\n end_cities.append(x)\r\nprev_city = end_cities[0]\r\nnext_city = d[prev_city][0]\r\nprint(prev_city, end=\" \")\r\nwhile True:\r\n print(next_city, end=\" \")\r\n if next_city == end_cities[1]:\r\n break\r\n d[next_city].remove(prev_city)\r\n prev_city = next_city\r\n next_city = d[next_city][0]\r\n", "n = int(input())\r\nd = {}\r\nfrom sys import stdin\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n if d.get(a)==None:d[a]=[]\r\n if d.get(b)==None:d[b]=[]\r\n d[a].append(b)\r\n d[b].append(a)\r\nfor i,item in enumerate(d):\r\n if len(d[item])==1:\r\n break\r\nres = [item]\r\nprev=item\r\nitem=d[item][0]\r\nfor i in range(n-1):\r\n res.append(item)\r\n x,y = d[item][0],d[item][1]\r\n if x==prev:prev=item;item=y\r\n else:prev=item;item=x\r\nres.append(item)\r\nprint(*res)", "#Recursion support template\r\nimport sys\r\ninput = sys.stdin.readline\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\r\n return wrappedfunc\r\n\r\n@bootstrap\r\ndef dfs(x):\r\n visited.add(x)\r\n ans.append(x)\r\n for i in d[x]:\r\n if i not in visited:\r\n yield dfs(i)\r\n\r\n yield\r\n\r\nn = int(input())\r\nd = {}\r\n# stack = []\r\nfor 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\r\n else:\r\n d[a] = [b]\r\n\r\n if b in d:\r\n d[b].append(a)\r\n\r\n else:\r\n d[b] = [a]\r\n\r\nans = []\r\nval = -1\r\nfor i in d:\r\n if len(d[i]) == 1:\r\n val = i\r\n break\r\n\r\nvisited = set()\r\ndfs(val)\r\nprint(*ans)", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import *\r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nfrom copy import deepcopy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"../output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A: print(*ele,end=\"\\n\")\r\n\r\n# from sys import stdin\r\n# input = stdin.buffer.readline\r\n# I = lambda : list(map(int,input().split()))\r\n\r\n# import sys\r\n# input=sys.stdin.readline\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\nadj = dd(list)\r\ndeg = dd(int)\r\n\r\nfor _ in range(n):\r\n u, v = map(int, input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n deg[u] += 1\r\n deg[v] += 1\r\n\r\nv = -1\r\nfor key, val in deg.items():\r\n if val == 1:\r\n v = key\r\n break\r\n\r\nans = []\r\n\r\nwhile True:\r\n ans.append(v)\r\n deg[v] = 0\r\n\r\n for dest in adj[v]:\r\n if deg[dest]:\r\n deg[dest] = 0\r\n v = dest\r\n break\r\n else:\r\n break\r\n\r\nprint(*ans)\r\n\r\n", "n = int(input())\r\ndescrs = {}\r\nfor i in range(n):\r\n first_descr, second_descr = map(int,input().split())\r\n if first_descr in descrs: descrs[first_descr].append(second_descr)\r\n else: descrs[first_descr] = [second_descr]\r\n if second_descr in descrs: descrs[second_descr].append(first_descr)\r\n else: descrs[second_descr] = [first_descr]\r\nres = [] \r\nfor description in descrs:\r\n if len(descrs[description]) == 1:\r\n res.append(description)\r\n root = description\r\n break\r\ncurr = root\r\nwhile True:\r\n for description in descrs[curr]:\r\n if description == res[-1]: continue\r\n if curr != root: res.append(curr)\r\n curr = description\r\n break\r\n if len(descrs[curr]) == 1:\r\n res.append(curr)\r\n break\r\nprint(*res)\r\n ", "n=int(input())\r\nd={}\r\nfor 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 if b in d:\r\n d[b].append(a)\r\n else:\r\n d[b]=[a]\r\nans=[] \r\nfor el in d:\r\n if len(d[el])==1:\r\n ans.append(el)\r\n root=el\r\n break\r\ncur=root\r\nwhile True:\r\n for el in d[cur]:\r\n if el==ans[-1]:continue\r\n if cur!=root:ans.append(cur)\r\n cur=el\r\n break\r\n if len(d[cur])==1:\r\n ans.append(cur)\r\n break\r\nprint(*ans)\r\n\r\n \r\n", "from collections import *\r\n\r\nw, e = defaultdict(int), []\r\n\r\nfor i in range(int(input())):\r\n\r\n h, p = map(int, input().split())\r\n\r\n e += [h, p]\r\n\r\n w[h] += p\r\n\r\n w[p] += h\r\n\r\ng, u = [q for q, k in Counter(e).items() if k == 1]\r\n\r\nq = 0\r\n\r\nwhile g != u:\r\n\r\n print(g)\r\n\r\n q, g = g, w[g] - q\r\n\r\nprint(g)\r\n", "import sys\r\ndef solve():\r\n\tlines = sys.stdin.readlines()\r\n\tn = int(lines[0])\r\n\td = {}\r\n\tfor i in range(1, n+1):\r\n\t\ta, b = map(int, lines[i].split())\r\n\t\tif a not in d:\r\n\t\t\td[a] = []\r\n\t\tif b not in d:\r\n\t\t\td[b] = []\r\n\t\td[a].append(b)\r\n\t\td[b].append(a)\r\n\tstart = -1\r\n\tfor k, v in d.items():\r\n\t\tif len(v) == 1:\r\n\t\t\tstart = k\r\n\tprev = -1\r\n\tans = []\r\n\twhile True:\r\n\t\tans.append(start)\r\n\t\tv = d[start]\r\n\t\tnext = v[0]\r\n\t\tif next == prev:\r\n\t\t\tif len(v) == 1:\r\n\t\t\t\tbreak\r\n\t\t\tnext = v[1]\r\n\t\tprev, start = start, next\r\n\tsys.stdout.write(' '.join(map(str, ans)))\r\n\r\n\r\nsolve()", "import sys\n\ndef solve():\n n = int(input())\n once = set()\n mapsto = dict()\n for i in range(n):\n a, b = map(int, input().split())\n spadd(once, a)\n spadd(once, b)\n dictadd(mapsto, a, b)\n dictadd(mapsto, b, a)\n prev = -1\n cur = once.pop()\n res = [cur]\n for i in range(n):\n pos = mapsto[cur]\n nxt = pos[0] if pos[0] != prev else pos[1]\n res.append(nxt)\n prev = cur\n cur = nxt\n print(' '.join(map(str, res)))\n\ndef spadd(s, val):\n if val in s: s.remove(val)\n else: s.add(val)\n\ndef dictadd(d, key, val):\n if key in d: d[key].append(val)\n else: d[key] = [val]\n\n\n\ndef prt(l): return print(''.join(l))\ndef rv(): return map(int, input().split())\ndef rl(n): return [list(map(int, input().split())) for _ in range(n)]\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nsolve()", "def main():\r\n n = int(input())\r\n stamps = {}\r\n s = {}\r\n for _ in range(n):\r\n stamp1, stamp2 = map(int, input().split())\r\n if stamp1 not in stamps:\r\n stamps[stamp1] = [stamp2]\r\n else:\r\n stamps[stamp1].append(stamp2)\r\n if stamp2 not in stamps:\r\n stamps[stamp2] = [stamp1]\r\n else:\r\n stamps[stamp2].append(stamp1)\r\n if stamp1 in s:\r\n del s[stamp1]\r\n else:\r\n s[stamp1] = None\r\n if stamp2 in s:\r\n del s[stamp2]\r\n else:\r\n s[stamp2] = None\r\n\r\n ans = [tuple(s.keys())[0]]\r\n while len(ans) != n + 1:\r\n next_stamp = stamps[ans[-1]]\r\n if len(next_stamp) == 1:\r\n ans.append(next_stamp[0])\r\n else:\r\n if next_stamp[0] != ans[-2]:\r\n ans.append(next_stamp[0])\r\n else:\r\n ans.append(next_stamp[1])\r\n\r\n print(' '.join(map(str, ans)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from _collections import deque\r\nn=int(input())-1\r\nx,y=map(int,input().split())\r\nq=deque([x,y])\r\nw={x:{y},y:{x}}\r\nl={x,y}\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if x in w:w[x].add(y)\r\n else:w[x]={y}\r\n if y in w:w[y].add(x)\r\n else:w[y]={x}\r\nwhile len(w[q[-1]])>1:\r\n for i in w[q[-1]]:\r\n if i not in l:\r\n q.append(i)\r\n l.add(i)\r\nwhile len(w[q[0]])>1:\r\n for i in w[q[0]]:\r\n if i not in l:\r\n q.appendleft(i)\r\n l.add(i)\r\nprint(*q)", "d1,d2,d3 = {},{},{}\nn = int(input())\nfor i in range(n):\n a,b = map(int,input().split())\n if a in d1.keys():\n d1[a] += 1\n else: d1[a] = 1\n if b in d1.keys():\n d1[b] += 1\n else: d1[b] = 1\n\n\n if a in d2.keys():\n d3[a] = b\n else: d2[a] = b\n if b in d2.keys():\n d3[b] = a\n else: d2[b] = a\nfirst,last = 0,0\nfor i in d1.keys():\n if d1[i] == 1:\n if first == 0: first = i\n else: last=i\n\nans = [first]\ni = first\n\ncont = 0\nwhile(i != last):\n if i in d2.keys() and d2[i] != cont:\n ans.append(d2[i])\n cont = i\n i = d2[i]\n elif i in d3.keys() and d3[i] != cont:\n ans.append(d3[i])\n cont = i\n i = d3[i]\n\nprint(*ans,sep=' ')\n\n", "n = int(input())\n\nedges = {}\n\nfor _ in range(n):\n a, b = map(int, input().split())\n if a in edges:\n edges[a] += [b]\n else:\n edges[a] = [b]\n if b in edges:\n edges[b] += [a]\n else:\n edges[b] = [a]\n\nroute = []\n\nfor key, val in edges.items():\n route = [key, val[0]]\n break\n\nwhile len(route) < n + 1:\n if len(edges[route[-1]]) == 1:\n route.reverse()\n else:\n if edges[route[-1]][0] == route[-2]:\n route += [edges[route[-1]][1]]\n else:\n route += [edges[route[-1]][0]]\n\nprint(' '.join(map(str, route)))\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\ncnt = defaultdict(int)\r\nP = defaultdict(list)\r\nfor _ in range(N):\r\n a,b = map(int, input().split())\r\n cnt[str(a)] += 1\r\n cnt[str(b)] += 1\r\n P[str(a)].append(str(b))\r\n P[str(b)].append(str(a))\r\n \r\nv = []\r\nfor k,c in cnt.items():\r\n if c==1:\r\n v.append((k,-1))\r\n break\r\n \r\nans = []\r\nwhile v:\r\n i,p = v.pop()\r\n ans.append(i)\r\n for j in P[i]:\r\n if j==p:continue\r\n v.append((j,i))\r\n \r\nprint(*ans)\r\n\r\n\r\n", "import sys\nfrom collections import defaultdict\n\nlength = int(sys.stdin.readline())\n\ngraph = defaultdict(list)\nfor _ in range(length):\n a,b = map(int,sys.stdin.readline().split())\n graph[a].append(b)\n graph[b].append(a)\n\nfor begin in graph:\n if len(graph[begin]) == 1:\n break\n\ndef get_next(graph,begin):\n yield begin\n cur= graph[begin][0]\n pre = begin\n while len(graph[cur]) == 2:\n yield cur\n old_cur = cur\n cur = graph[cur][0] if graph[cur][0] != pre else graph[cur][1]\n pre = old_cur\n yield cur\nprint(\" \".join(map(str,get_next(graph,begin))))\n", "import sys\r\nfrom array import array # noqa: F401\r\nfrom collections import defaultdict\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\nadj = defaultdict(list)\r\ndeg = defaultdict(int)\r\n\r\nfor _ in range(n):\r\n u, v = map(int, input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n deg[u] += 1\r\n deg[v] += 1\r\n\r\nv = -1\r\nfor key, val in deg.items():\r\n if val == 1:\r\n v = key\r\n break\r\n\r\nans = []\r\n\r\nwhile True:\r\n ans.append(v)\r\n deg[v] = 0\r\n\r\n for dest in adj[v]:\r\n if deg[dest]:\r\n deg[dest] = 0\r\n v = dest\r\n break\r\n else:\r\n break\r\n\r\nprint(*ans)\r\n" ]

{"inputs": ["2\n1 100\n100 2", "3\n3 1\n100 2\n3 2", "3\n458744979 589655889\n248228386 824699605\n458744979 824699605", "4\n90104473 221011623\n18773664 221011623\n90104473 74427905\n74427905 186329050", "5\n695442143 421284135\n641835294 542627184\n852367357 120042890\n641835294 852367357\n542627184 421284135", "6\n264896923 2497658\n57071588 447086061\n2497658 483723090\n57071588 264896923\n158310110 483723090\n158310110 72866107", "1\n1 1000000000", "1\n1000000000 999999999", "10\n661239801 721746596\n225324231 116454751\n687002568 865423160\n799202882 865423160\n661239801 116454751\n387882517 687002568\n748798833 721746596\n179630172 225324231\n945958362 387882517\n179630172 945958362", "21\n280810160 291988863\n760364563 140163983\n16417017 364832782\n400253359 677358550\n597688496 794948223\n400253359 603304541\n589408417 603304541\n385039298 307729574\n293170375 805849550\n140163983 219301181\n732214548 760364563\n307729574 280810160\n131915938 219301181\n4615652 347722938\n396478457 805849550\n16417017 732214548\n4615652 677358550\n131915938 589408417\n291988863 364832782\n396478457 794948223\n385039298 597688496", "1\n2105127 227379126"], "outputs": ["2 100 1 ", "100 2 3 1 ", "589655889 458744979 824699605 248228386 ", "186329050 74427905 90104473 221011623 18773664 ", "695442143 421284135 542627184 641835294 852367357 120042890 ", "447086061 57071588 264896923 2497658 483723090 158310110 72866107 ", "1000000000 1 ", "1000000000 999999999 ", "799202882 865423160 687002568 387882517 945958362 179630172 225324231 116454751 661239801 721746596 748798833 ", "347722938 4615652 677358550 400253359 603304541 589408417 131915938 219301181 140163983 760364563 732214548 16417017 364832782 291988863 280810160 307729574 385039298 597688496 794948223 396478457 805849550 293170375 ", "227379126 2105127 "]}

UNKNOWN

PYTHON3

CODEFORCES

25

909a49d6c60a9180e265a01863223410

PFAST Inc.

When little Petya grew up and entered the university, he started to take part in АСМ contests. Later he realized that he doesn't like how the АСМ contests are organised: the team could only have three members (and he couldn't take all his friends to the competitions and distribute the tasks between the team members efficiently), so he decided to organize his own contests PFAST Inc. — Petr and Friends Are Solving Tasks Corporation. PFAST Inc. rules allow a team to have unlimited number of members. To make this format of contests popular he organised his own tournament. To create the team he will prepare for the contest organised by the PFAST Inc. rules, he chose several volunteers (up to 16 people) and decided to compile a team from them. Petya understands perfectly that if a team has two people that don't get on well, then the team will perform poorly. Put together a team with as many players as possible given that all players should get on well with each other. The first line contains two integer numbers *n* (1<=≤<=*n*<=≤<=16) — the number of volunteers, and *m* () — the number of pairs that do not get on. Next *n* lines contain the volunteers' names (each name is a non-empty string consisting of no more than 10 uppercase and/or lowercase Latin letters). Next *m* lines contain two names — the names of the volunteers who do not get on. The names in pair are separated with a single space. Each pair of volunteers who do not get on occurs exactly once. The strings are case-sensitive. All *n* names are distinct. The first output line should contain the single number *k* — the number of people in the sought team. Next *k* lines should contain the names of the sought team's participants in the lexicographical order. If there are several variants to solve the problem, print any of them. Petya might not be a member of the sought team. Sample Input 3 1 Petya Vasya Masha Petya Vasya 3 0 Pasha Lesha Vanya Sample Output 2 Masha Petya 3 Lesha Pasha Vanya

[ "# LUOGU_RID: 91401901\nimport copy\r\n\r\n\r\ndef insert(a, b):\r\n try:\r\n g[a][b] = 1\r\n except:\r\n g[a] = {b: 1}\r\n\r\n\r\nglobal ans\r\ng = {}\r\n\r\n\r\ndef dfs(i, n, dv):\r\n if i == n:\r\n return copy.deepcopy(dv)\r\n flag = True\r\n for b in dv:\r\n try:\r\n if g[v[i]][b] == 1:\r\n flag = False\r\n except:\r\n pass\r\n v1 = []\r\n if flag:\r\n v1 = dfs(i + 1, n, dv + [v[i]])\r\n v2 = dfs(i + 1, n, dv)\r\n return v1 if len(v1) > len(v2) else v2\r\n\r\n\r\nn, m = map(int, input().split())\r\nv = [input() for i in range(n)]\r\nv.sort()\r\nfor j in range(m):\r\n a, b = map(str, input().split())\r\n insert(a, b)\r\n insert(b, a)\r\n\r\nans = dfs(0, n, [])\r\nprint(len(ans))\r\nfor s in ans:\r\n print(s)\r\n", "def get_subsets(elements):\r\n if not elements:\r\n yield tuple()\r\n else:\r\n for subset_rec in get_subsets(elements[1:]):\r\n yield subset_rec\r\n yield (elements[0],) + subset_rec\r\n\r\n\r\ndef is_valid_set(subset, pairs):\r\n subset = set(subset)\r\n ok = True\r\n for pair in pairs:\r\n ok = ok and (not (pair[0] in subset and pair[1] in subset))\r\n return ok\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n names = tuple(input() for _ in range(n))\r\n pairs = [input().split() for _ in range(m)]\r\n\r\n ok = lambda subset: is_valid_set(subset, pairs)\r\n team = max(filter(ok, get_subsets(names)), key=len)\r\n\r\n print(len(team))\r\n for name in sorted(team):\r\n print(name)\r\n", "n, k = map(int, input().split())\r\nb1 = []\r\nmin = []\r\nfor i in range(n):\r\n b1 += [input()]\r\nd = {}\r\nfor i in range(k):\r\n o = 0\r\n a, b = input().split()\r\n if a not in d:\r\n d[a] = [b]\r\n o = 1\r\n if b not in d:\r\n d[b] = [a]\r\n o = 2\r\n if o != 1:\r\n c = d[a]\r\n if b not in c:\r\n c += [b]\r\n d[a] = c\r\n if o != 2:\r\n c = d[b]\r\n if a not in c:\r\n c += [a]\r\n d[b] = c\r\nfor i in range(2 ** n):\r\n o = 0\r\n c = []\r\n a = bin(i)[2:]\r\n a = \"0\" * (n - len(a)) + a\r\n for i in range(n):\r\n if a[i] == \"1\":\r\n for j in c:\r\n if b1[i] in d:\r\n if j in d[b1[i]]:\r\n o = 1\r\n break\r\n if o == 0:\r\n c += [b1[i]]\r\n if len(c) > len(min):\r\n min = c\r\nmin.sort()\r\nprint(len(min))\r\nfor i in range(len(min)):\r\n print(min[i])", "def GSB(x):\r\n\tcounter=0\r\n\twhile x!=0:\r\n\t\tcounter+=1\r\n\t\tx=x>>1\r\n\treturn counter\r\n\r\ndef friends(checker,enemy):\r\n\tfor i in range(len(enemy)):\r\n\t\tif enemy[i][0] in checker and enemy[i][1] in checker:\r\n\t\t\treturn 0\r\n\treturn 1\r\n\r\npeople,conflict=[int(x) for x in input().split()]\r\nperson=[]\r\nenemy=[]\r\nhighest=-1\r\nhighestarray=[]\r\nfor i in range(people):\r\n\tperson.append(input())\r\nfor j in range(conflict):\r\n\tenemy.append(input().split())\r\ncombinations=[int(x) for x in range((2**people))]\r\nfor i in combinations:\r\n\tchecker=[]\r\n\tj=0\r\n\tz=GSB(i)\r\n\twhile j!=z and i!=0:\r\n\t\tif i&1==1:\r\n\t\t\tchecker.append(person[j])\r\n\t\ti=i>>1\r\n\t\tj+=1\r\n\tif friends(checker,enemy):\r\n\t\tif len(checker)>highest:\r\n\t\t\thighest=len(checker)\r\n\t\t\thighestarray=checker\r\nprint(highest)\r\nhighestarray.sort()\r\nfor i in range(highest):\r\n\tprint(highestarray[i])", "global res, maxi\r\nres = []\r\nmaxi = 0\r\ndef check(op):\r\n global maxi, res\r\n flag = 1\r\n if len(op)>maxi:\r\n d = {}\r\n for i in op:\r\n d[i] = None\r\n for i in range(m):\r\n if v[i][0] in d and v[i][1] in d:\r\n flag = 0\r\n break\r\n if flag:\r\n maxi = len(op)\r\n res = op\r\ndef func(ip, op):\r\n if len(ip) == 0:\r\n check(op)\r\n return\r\n op1 = op\r\n op2 = op+ [ip[-1]]\r\n d = ip[:len(ip)-1]\r\n func(d, op1)\r\n func(d, op2)\r\n \r\nn, m = map(int, input().split())\r\nc = []\r\nfor i in range(n):\r\n c.append(input())\r\nv = []\r\nfor i in range(m):\r\n v.append(list(map(str, input().split())))\r\nfunc(c, [])\r\nprint(maxi)\r\nres.sort()\r\nfor i in res:\r\n print(i)\r\n", "n,m=map(int,input().split())\nnames=dict()\nind=dict()\nenemies=list()\nfor i in range(n):\n cur=input()\n names[i]=cur\n ind[cur]=i\n enemies.append(set())\nfor i in range(m):\n nm1,nm2=input().split()\n enemies[ind[nm1]].add(ind[nm2])\n enemies[ind[nm2]].add(ind[nm1])\nans=0\nfor i in range(2**n):\n cur=set()\n for j in range(n):\n if (i&(1<<j)):cur.add(j)\n f=True\n for j in cur:\n for jj in enemies[j]:\n if jj in cur:\n f=False\n break\n if not f:break\n else:\n if len(cur)>ans:\n ans=len(cur)\n curans=cur\nansarr=sorted([names[_] for _ in curans])\nprint(ans)\nfor i in ansarr:print(i)\n\n\n\n", "def s():\r\n\t[n,m] = list(map(int,input().split()))\r\n\ta = [input() for _ in range(n)]\r\n\tb = {input() for _ in range(m)}\r\n\tres = [[]]\r\n\taa = len(a)*[False]\r\n\tdef r(x=0):\r\n\t\tif x == n:\r\n\t\t\tp = [a[i] for i in range(n) if aa[i]]\r\n\t\t\tif len(p) <= len(res[0]):\r\n\t\t\t\treturn\r\n\t\t\tfor i in p:\r\n\t\t\t\tfor j in p:\r\n\t\t\t\t\tif i+' '+j in b or j+' '+i in b:\r\n\t\t\t\t\t\treturn\r\n\t\t\tres[0] = p\r\n\t\t\treturn x\r\n\t\telse:\r\n\t\t\taa[x] = True\r\n\t\t\tr(x+1)\r\n\t\t\taa[x] = False\r\n\t\t\tr(x+1)\r\n\tr()\r\n\tres = res[0]\r\n\tres.sort()\r\n\tprint(len(res))\r\n\tprint(*res,sep='\\n')\r\ns()", "from collections import defaultdict\r\ngl = []\r\ndef generate(k, l) :\r\n if k == 0 :\r\n gl.append(l.copy())\r\n l.append(ls[k])\r\n gl.append(l.copy())\r\n l.remove(ls[k])\r\n return\r\n generate(k-1, l)\r\n l.append(ls[k])\r\n generate(k-1, l)\r\n l.remove(ls[k])\r\ndef check(st) :\r\n for name in st :\r\n if len(dc[name].intersection(st)) > 0 :\r\n return False\r\n return True\r\nn, m = map(int,input().split())\r\nls = []\r\ndc = defaultdict(set)\r\nfor i in range(n) :\r\n ls.append(input())\r\nls.sort(reverse = True)\r\nfor i in range(m) :\r\n x, y = input().split()\r\n dc[x].add(y)\r\n dc[y].add(x)\r\ngenerate(n-1, [])\r\nans = set()\r\nfor elem in gl :\r\n if (check(set(elem))) :\r\n if len(elem) > len(ans) :\r\n ans = elem\r\nprint(len(ans))\r\nprint(*ans,sep=\"\\n\")", "def good(a,bad):\r\n for i in bad:\r\n if i[0]in a:\r\n if i[1] in a:\r\n return False\r\n return True\r\ndef f(arr,bad,d):\r\n n=len(arr)\r\n mask=0\r\n ans=[]\r\n while mask<1<<n:\r\n temp=[]\r\n for i in range(len(arr)):\r\n if mask &(1<<i):\r\n temp.append(i)\r\n if good(temp,bad):\r\n ans.append(temp)\r\n mask+=1\r\n mx=max(ans,key=lambda s:len(s))\r\n print(len(mx))\r\n for i in mx:\r\n print(arr[i])\r\n return \"\"\r\n\r\n\r\na,b=map(int,input().strip().split())\r\nblanck=[]\r\nfor i in range(a):\r\n blanck.append(input())\r\nd={}\r\nblanck=sorted(blanck)\r\nfor i in range(len(blanck)):\r\n d[blanck[i]]=i\r\nbad=[]\r\nfor i in range(b):\r\n x,y=map(str,input().strip().split())\r\n k=sorted((d[x],d[y]))\r\n bad.append(k)\r\n\r\nprint(f(blanck,bad,d))\r\n\r\n", "n, m = map(int,input().split())\r\nID = {}\r\nname_from_ID = {}\r\nfor i in range(n):\r\n\tname = input()\r\n\tID[name] = i\r\n\tname_from_ID[i] = name\r\n\r\npeople_I_hate = [set() for i in range(n)]\r\nfor j in range(m):\r\n\tname1, name2 = input().split()\r\n\tpeople_I_hate[ID[name1]].add(ID[name2])\r\n\tpeople_I_hate[ID[name2]].add(ID[name1])\r\n\r\ndef conflict(team,people_I_hate):\r\n\tfor guy1 in team:\r\n\t\tfor guy2 in team:\r\n\t\t\tif guy1 in people_I_hate[guy2] or guy2 in people_I_hate:\r\n\t\t\t\treturn True\r\n\treturn False\r\n\r\nans = []\r\nfor mask in range(1<<n):\r\n\tteam = []\r\n\tfor i in range(n):\r\n\t\tif mask&(1<<i):\r\n\t\t\tteam.append(i)\r\n\r\n\tif not conflict(team,people_I_hate) and len(team) > len(ans):\r\n\t\tans = [name_from_ID[x] for x in team]\r\n\r\nprint(len(ans))\r\nfor name in sorted(ans):\r\n\tprint(name)\r\n\t", "hi=list()\r\nfor i in range(100):\r\n\tf=list()\r\n\tfor j in range(100):\r\n\t\tf.append(0)\r\n\thi.append(f)\r\nn, m=map(int, input().split())\r\nmp={}\r\narr=list()\r\nfor i in range(n):\r\n\tyo=input()\r\n\tarr.append(yo)\r\n\tmp[arr[i]]=i\r\nfor i in range(m):\r\n\ta, b=input().split()\r\n\tyo1=int(mp[a])\r\n\tyo2=int(mp[b])\r\n\thi[yo1][yo2]=1\r\n\thi[yo2][yo1]=1\r\nmaxi=0\r\nfor i in range(2**n):\r\n\tvi=list()\r\n\tfor j in range(n):\r\n\t\tif ((2**j)&i):\r\n\t\t\tvi.append(j)\r\n\tiss=True\r\n\tfor j in range(len(vi)):\r\n\t\tfor k in range(len(vi)):\r\n\t\t\tif hi[vi[j]][vi[k]]:\r\n\t\t\t\tiss=False\r\n\tif iss:\r\n\t\tyo=len(vi)\r\n\t\tmaxi=max(maxi, yo)\r\nfor i in range(2**n):\r\n\tvi=list()\r\n\tfor j in range(n):\r\n\t\tif ((2**j)&i):\r\n\t\t\tvi.append(j)\r\n\tiss=True\r\n\tfor j in range(len(vi)):\r\n\t\tfor k in range(len(vi)):\r\n\t\t\tif hi[vi[j]][vi[k]]:\r\n\t\t\t\tiss=False\r\n\tif iss:\r\n\t\tyo=len(vi)\r\n\t\tif maxi==yo:\r\n\t\t\tprint(len(vi))\r\n\t\t\tvs=list()\r\n\t\t\tfor j in range(len(vi)):\r\n\t\t\t\tvs.append(arr[vi[j]]);\r\n\t\t\tvs.sort()\r\n\t\t\tfor j in range(len(vi)):\r\n\t\t\t\tprint(vs[j])\r\n\t\t\texit()", "n,m=map(int,input().split())\nN=[n]\nNames={}\nNumbers={}\nEnemies=[]\nfor i in range(n):\n s=input()\n Names[s]=i\n Enemies.append([])\n Numbers[i]=str(s)\n\nfor i in range(m):\n a,b=input().split()\n Enemies[Names[a]].append(Names[b])\n Enemies[Names[b]].append(Names[a])\nAns=[[]]\n\ndef dp(N,i,Taken,Forbidden):\n if(i==N):\n if(len(Taken)>len(Ans[0])):\n Ans[0]=list(Taken)\n return\n if(i not in Forbidden):\n dp(N,i+1,Taken,Forbidden)\n dp(N,i+1,Taken+[i],Forbidden+Enemies[i])\n else:\n dp(N,i+1,Taken,Forbidden)\n return\n \ndp(n,0,[],[])\n\nprint(len(Ans[0]))\nAns=Ans[0]\n\nfor i in range(len(Ans)):\n Ans[i]=Numbers[Ans[i]]\nAns.sort()\nfor item in Ans:\n print(item)\n\n", "def bitmask(m, array):\n return [array[i] for i in range(len(array)) if m & (1 << i)]\nn, k = map(int, input().split())\nnames = [input() for _ in range(n)]\nnames.sort()\nbads = [input().split() for _ in range(k)]\nm_count, bb = -1, []\nfor m in range(2 ** n):\n if bin(m).count('1') < m_count: continue\n b = bitmask(m, names)\n f = True\n for x, y in bads:\n if x in b and y in b:\n f = False\n if f:\n m_count, bb = len(b), b\nprint (m_count)\nprint ('\\n'.join(bb))\n\t \t\t \t \t \t \t \t \t \t\t\t \t\t", "from itertools import combinations\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n name = sorted([input().strip() for i in range(n)])\r\n bad = sorted([sorted(input().strip().split()) for i in range(m)])\r\n # print(name)\r\n # print(bad)\r\n for i in range(n, -1, -1):\r\n temp = sorted(map(sorted, combinations(name, i)))\r\n # print(temp)\r\n for k in temp:\r\n flag = 1\r\n for j in map(sorted, combinations(k, 2)):\r\n # print(j)\r\n if j in bad:\r\n flag = 0\r\n break\r\n if flag:\r\n return k\r\n\r\n\r\nx = solve()\r\nprint(len(x))\r\nprint(*x, sep='\\n')\r\n", "def check(b):\n\tfor i in b:\n\t\tfor j in b:\n\t\t\tif (a[i],a[j]) in pair or (a[j],a[i]) in pair:\n\t\t\t\treturn False\n\treturn True\n\nn,m = map(int,input().split())\na = []\nind = {}\nfor i in range(n):\n\ta.append(input())\n\tind[a[-1]] = i\ngraph = [[] for i in range(n)]\npair = {}\nfor i in range(m):\n\tx,y = input().split()\n\tpair[(x,y)] = 1\n\tgraph[ind[x]].append(ind[y])\n\tgraph[ind[y]].append(ind[x])\nif m==0:\n\tprint (n)\n\ta.sort()\n\tfor i in a:\n\t\tprint (i)\n\texit()\n\nans = 0\nstring = \"\"\nfor i in range(1,2**n):\n\tb = bin(i)[2:]\n\tb = \"0\"*(n-len(b))+b\n\ttemp = []\n\tfor j in range(n):\n\t\tif b[j]==\"1\":\n\t\t\ttemp.append(ind[a[j]])\n\t# print (i,b,temp,check(temp),pair,ind)\n\tif check(temp):\n\t\tif len(temp)>ans:\n\t\t\tans = len(temp)\n\t\t\tstring = b\nprint (ans)\nansl = []\nfor i in range(n):\n\tif string[i]==\"1\":\n\t\tansl.append(a[i])\nansl.sort()\nfor i in ansl:\n\tprint (i)\n", "import itertools as it\n\n\nn, m = map(int, input().split())\n\nedges = set()\n\nfriends_M = {}\n\nfor i in range(n):\n friends_M[input()] = i\n\nfor _ in range(m):\n a, b = input().split()\n a, b = friends_M[a], friends_M[b]\n edges.add((a, b))\n edges.add((b, a))\n\nbest = 0\nbest_vals = []\n\nfor subset in it.product([0, 1], repeat=n):\n ss = list(it.compress(range(n), subset))\n good = True\n for i in range(len(ss)):\n for j in range(i + 1, len(ss)):\n if (ss[i], ss[j]) in edges:\n good = False\n if good:\n if len(ss) > best:\n best = len(ss)\n best_vals = ss\n\nprint(best)\nres = []\nfor i in range(len(best_vals)):\n for j, k in friends_M.items():\n if k == best_vals[i]:\n res += [j]\n break\n\nfor name in sorted(res):\n print(name)\n\n", "\r\nnums = input().split()\r\nnumPeople = int(nums[0])\r\nnumPairs = int(nums[1])\r\n\r\nnames = []\r\nfor i in range(numPeople):\r\n names.append(input());\r\npair1 = []\r\npair2 = []\r\n\r\nfor i in range(numPairs):\r\n pair = input().split()\r\n pair1.append(pair[0])\r\n pair2.append(pair[1])\r\n\r\nnumSets = pow(2, numPeople);\r\n\r\nbestSet = []\r\n\r\nfor i in range(1,numSets):\r\n currSet = []\r\n for j in range(numPeople):\r\n if (i & (1<<j) > 0):\r\n currSet.append(names[j])\r\n\r\n validSet = True\r\n for j in range(numPairs):\r\n person1 = pair1[j]\r\n person2 = pair2[j]\r\n if person1 in currSet and person2 in currSet:\r\n validSet = False\r\n break\r\n\r\n if validSet:\r\n if len(currSet) > len(bestSet):\r\n bestSet = currSet\r\n\r\nbestSet.sort()\r\nprint(len(bestSet))\r\nfor i in bestSet:\r\n print(i)\r\n \r\n\r\n", "import copy\r\n\r\nn, m = map(int, input().split())\r\nnames = [input() for _ in range(n)]\r\n\r\nblocked = []\r\nfor i in range(m):\r\n a, b = input().split()\r\n blocked.append((a, b))\r\n\r\n\r\nres = []\r\n\r\nfor i in range(2**n):\r\n temp = []\r\n f = 1\r\n for j in range(n+1):\r\n if i & (1 << j):\r\n temp.append(names[j])\r\n\r\n for n1, n2 in blocked:\r\n if (n1 in temp) and (n2 in temp):\r\n f = 0\r\n if f and (len(res) < len(temp)):\r\n res = copy.deepcopy(temp)\r\n\r\nprint(len(res))\r\nres.sort()\r\nfor name in res:\r\n print(name)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\n\r\npeople = []\r\nhaters = {}\r\n\r\nfor _ in range(n):\r\n name = input()\r\n people.append(name)\r\n haters[name] = []\r\n \r\nfor _ in range(m):\r\n a, b = input().split()\r\n haters[a].append(b)\r\n haters[b].append(a)\r\n \r\nteam = set()\r\n\r\nfor i in range(2**n):\r\n t = set()\r\n not_well = set()\r\n \r\n for j in range(n):\r\n if i & (1 << j) and people[j] not in not_well:\r\n t.add(people[j])\r\n for hater in haters[people[j]]:\r\n not_well.add(hater)\r\n \r\n if len(t) > len(team):\r\n team = t\r\n \r\nprint(len(team))\r\n\r\nfor name in sorted(team):\r\n print(name)", "from collections import defaultdict\r\ngraph = defaultdict(list)\r\nn,m = list(map(int,input().split()))\r\nd = {}\r\ncnt = 0 \r\nfor i in range(n):\r\n x = input()\r\n d[x] = cnt\r\n cnt+=1\r\narr = []\r\nfor i in range(m):\r\n u,v = list(map(str,input().split()))\r\n arr.append([u,v])\r\npossibilities = []\r\nfor i in range(2**n):\r\n x = bin(i).split('b')[1]\r\n x = '0'*(n-len(x))+x\r\n possibilities.append(x)\r\nans = []\r\nfor i in possibilities:\r\n f = 0\r\n for j in arr:\r\n if i[d[j[0]]]=='1' and i[d[j[1]]]=='1':\r\n f = 1\r\n break\r\n if f==0:\r\n ans.append(i)\r\nk = -1\r\nu = -1\r\nmat = []\r\nfor i in ans:\r\n y = i.count('1')\r\n if k<y:\r\n k = y\r\n u = i\r\n# for i in ans:\r\n# if i.count('1')==k:\r\n# mat.append(i)\r\n# print(mat)\r\n# print(k)\r\nfor i in range(len(u)):\r\n if u[i]=='1':\r\n for j in d:\r\n if d[j]==i:\r\n mat.append(j)\r\n break\r\nmat.sort()\r\nprint(len(mat))\r\nfor i in mat:\r\n print(i)", "from itertools import combinations\r\nfrom collections import defaultdict\r\nimport sys\r\n\r\nn, k = map(int, input().split())\r\n\r\npeople = []\r\n\r\nfor _ in range(n):\r\n people.append(input())\r\n\r\n\r\ngraph = defaultdict(set)\r\n\r\nfor _ in range(k):\r\n a, b = input().split()\r\n \r\n graph[a].add(b)\r\n graph[b].add(a)\r\n\r\n\r\ndef check(combination):\r\n for person in combination:\r\n if len(combination.intersection(graph[person])) != 0:\r\n return False\r\n return True\r\n\r\ngroups = []\r\n\r\nfor i in range(1, len(people) + 1):\r\n groups.extend(combinations(people, i))\r\n\r\nans = []\r\nfor comb in map(set, groups):\r\n if check(comb) and len(ans) < len(comb):\r\n ans = comb\r\n\r\nprint(len(ans))\r\nprint(\"\\n\".join(sorted(ans)))\r\n \r\n ", "def solve(n, prefix):\r\n if n == 0:\r\n ans = []\r\n for i in range(len(prefix)):\r\n if prefix[i] == 1:\r\n ans.append(names[i])\r\n for x, y in pairs:\r\n if x in ans and y in ans:\r\n return []\r\n return ans\r\n else:\r\n prefix.append(1)\r\n ans1 = solve(n - 1, prefix)\r\n prefix.pop()\r\n prefix.append(0)\r\n ans2 = solve(n - 1, prefix)\r\n prefix.pop()\r\n if len(ans2) > len(ans1):\r\n return ans2\r\n else:\r\n return ans1\r\n\r\n\r\nn, m = map(int, input().split())\r\nnames = [input() for _ in range(n)]\r\npairs = [input().split() for _ in range(m)]\r\nans = solve(n, [])\r\nprint(len(ans))\r\nans.sort()\r\nfor name in ans:\r\n print(name)\r\n", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nn,m=map(int,input().split())\r\nnames=[]\r\nfor i in range(n):\r\n names.append(input())\r\na=[]\r\nfor i in range(m):\r\n u,v=map(str,input().split())\r\n a.append([u,v])\r\nans=[]\r\nfor i in range(pow(2,n)):\r\n num=i\r\n st=set()\r\n for j in range(n):\r\n rem=num%2\r\n if rem==1:\r\n st.add(names[j])\r\n num//=2\r\n ver=True\r\n for u,v in a:\r\n if u in st and v in st:\r\n ver=False\r\n break\r\n if ver:\r\n if len(st)>len(ans):\r\n ans=st.copy()\r\nprint(len(ans))\r\nans=list(ans)\r\nans.sort()\r\nfor name in ans:\r\n print(name)", "n, m = map(int, input().split())\r\n\r\nvolunteers = []\r\npairs = set()\r\nteams = set()\r\n\r\nfor i in range(n):\r\n volunteers.append(input())\r\n\r\nfor i in range(m):\r\n v1, v2 = input().split()\r\n pairs.add(tuple(sorted((v1, v2))))\r\n\r\ndef backtrack(i, team):\r\n\r\n if team and tuple(team) not in teams:\r\n teams.add(tuple(team))\r\n\r\n if i >= n:\r\n return\r\n\r\n valid = True\r\n\r\n for volunteer in team:\r\n\r\n if tuple(sorted((volunteer, volunteers[i]))) in pairs:\r\n valid = False\r\n break\r\n \r\n if valid:\r\n team.append(volunteers[i])\r\n backtrack(i + 1, team)\r\n team.pop()\r\n \r\n backtrack(i + 1, team)\r\n\r\nbacktrack(0, [])\r\nmax_team = None\r\nmax_len = 0\r\n\r\nfor team in teams:\r\n\r\n if len(team) > max_len:\r\n max_len = len(team)\r\n max_team = team\r\n\r\nprint(len(max_team))\r\nmax_team = sorted(max_team)\r\n\r\nfor volunteer in max_team:\r\n print(volunteer)", "from itertools import product\r\nn,m = map(int, input().split())\r\nvl = sorted([ input() for i in range(n)])\r\ncm = {vl[i]:i for i in range(n)}\r\ncl = []\r\nfor i in range(m):\r\n a,b = input().split()\r\n cl+=[[cm[a],cm[b]]]\r\nans=[(),0]\r\nfor x in list(product([1,0],repeat=n)):\r\n flag=0\r\n for c in cl:\r\n if x[c[0]]==1==x[c[1]]:\r\n flag=1\r\n break;\r\n \r\n if flag==0 and ans[1]<x.count(1):\r\n ans=[x,x.count(1)]\r\n \r\n# lucky+=[int(''.join([str(y) for y in x])) for x in list(product([4,7],repeat=i))]\r\n# print(cm)\r\nprint(ans[1])\r\nprint('\\n'.join([vl[i] for i in range(n) if ans[0][i]==1]))\r\n###################\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 ceil, floor, gcd, sqrt, trunc, inf\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\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\n# sys.setrecursionlimit(pow(10, 6))\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\nmod = pow(10, 9) + 7\r\nmod2 = 998244353\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\n\r\n\r\ndef on(a):\r\n i = n\r\n cnt = []\r\n while i >= 0:\r\n if a & (1 << i):\r\n cnt.append(i)\r\n i -= 1\r\n return cnt\r\n\r\n\r\ndef check(arr, index):\r\n for i in arr:\r\n if names[i] in graph[names[index]] or names[index] in graph[names[i]]:\r\n return False\r\n return True\r\n\r\n\r\ndef recur(i=0, mask=0):\r\n global answer\r\n if i == n:\r\n temp = on(mask)\r\n if len(temp) > len(answer):\r\n answer = temp\r\n return\r\n if mask & (1 << i):\r\n return\r\n temp = on(mask)\r\n if check(temp, i):\r\n recur(i+1, mask | (1 << i))\r\n recur(i+1, mask)\r\n\r\n\r\nn, m = sp()\r\ngraph = dd(set)\r\nnames = []\r\nfor i in range(n):\r\n names.append(data())\r\nfor i in range(m):\r\n u, v = ssp()\r\n graph[u].add(v)\r\n graph[v].add(u)\r\nanswer = []\r\nrecur()\r\nout(len(answer))\r\nfor i in range(len(answer)):\r\n answer[i] = names[answer[i]]\r\nfor i in sorted(answer):\r\n out(i)\r\n", "from collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\nnames = []\r\n\r\nfor _ in range(n):\r\n names.append(input())\r\n\r\ndont_agree = defaultdict(list)\r\ndegree = defaultdict(int)\r\n\r\nfor _ in range(m):\r\n name1, name2 = input().split()\r\n dont_agree[name1].append(name2)\r\n dont_agree[name2].append(name1)\r\n degree[name1] += 1\r\n degree[name2] += 1\r\n\r\n\r\nclass Solve:\r\n\r\n def __init__(self, names):\r\n self.best_team = set()\r\n self.current_team = set()\r\n self.names = names\r\n\r\n def backtrack(self, index):\r\n if len(self.current_team) > len(self.best_team):\r\n self.best_team = self.current_team.copy()\r\n\r\n if index == len(names):\r\n return\r\n\r\n # add em to the team\r\n self.backtrack(index+1)\r\n\r\n for neighbor in dont_agree[self.names[index]]:\r\n if neighbor in self.current_team:\r\n return\r\n\r\n self.current_team.add(self.names[index])\r\n self.backtrack(index+1)\r\n self.current_team.remove(self.names[index])\r\n\r\n\r\nsol = Solve(names)\r\nsol.backtrack(0)\r\nbest_team = sol.best_team\r\n\r\nprint(len(best_team))\r\nbest_team = sorted(best_team)\r\n\r\nfor name in best_team:\r\n print(name)\r\n", "n,m=map(int,input().split())\r\nnames=[]\r\nfor i in range(n):\r\n names.append(input())\r\nhate=[]\r\nfor i in range(m):\r\n hate.append(list(input().split()))\r\n\r\nans=set() \r\nfor x in range(1,(1<<n)+1):\r\n a=set()\r\n for i in range(n):\r\n if x & (1<<i):\r\n a.add(names[i])\r\n flag=True\r\n for b in hate:\r\n if b[0] in a and b[1] in a:\r\n flag=False\r\n break\r\n if flag:\r\n if len(a)>len(ans):\r\n ans=a\r\n\r\nprint(len(ans))\r\nprint(*sorted(list(ans)),sep=\"\\n\")\r\n \r\n \r\n" ]

{"inputs": ["3 1\nPetya\nVasya\nMasha\nPetya Vasya", "3 0\nPasha\nLesha\nVanya", "7 12\nPasha\nLesha\nVanya\nTaras\nNikita\nSergey\nAndrey\nPasha Taras\nPasha Nikita\nPasha Andrey\nPasha Sergey\nLesha Taras\nLesha Nikita\nLesha Andrey\nLesha Sergey\nVanya Taras\nVanya Nikita\nVanya Andrey\nVanya Sergey", "2 0\nAndrey\nTaras", "16 0\nTaras\nNikita\nSergey\nAndrey\nRomka\nAlexey\nUra\nDenis\nEgor\nVadim\nAlena\nOlya\nVanya\nBrus\nJohn\nAlice", "6 6\nAlena\nOlya\nVanya\nBrus\nJohn\nAlice\nAlena John\nAlena Alice\nOlya John\nOlya Alice\nVanya John\nVanya Alice", "7 6\nAlena\nOlya\nVanya\nBrus\nJohn\nAlice\nMariana\nAlena John\nAlena Alice\nOlya John\nOlya Alice\nVanya John\nVanya Alice", "1 0\nPetr", "2 0\nNgzlPJgFgz\nQfpagVpWz", "2 1\ncLWdg\nGoWegdDRp\nGoWegdDRp cLWdg", "3 0\nr\nyVwqs\nsdTDerOyhp", "3 3\nvRVatwL\nWmkUGiYEn\nuvvsXKXcJ\nWmkUGiYEn vRVatwL\nuvvsXKXcJ vRVatwL\nuvvsXKXcJ WmkUGiYEn", "16 11\njA\nkyRNTE\neY\nToLcqN\nbnenhMxiK\nzlkOe\nXCKZ\neaQrds\nqUdInpi\nKgPQA\nmQIl\ninOCWEZHxy\nyA\nPIZRMOu\nXtueKFM\nfRNwNn\ninOCWEZHxy qUdInpi\nKgPQA zlkOe\ninOCWEZHxy KgPQA\nfRNwNn XCKZ\ninOCWEZHxy eY\nyA mQIl\ninOCWEZHxy ToLcqN\nyA KgPQA\nqUdInpi ToLcqN\nqUdInpi eaQrds\nPIZRMOu eY", "12 12\njWuGgOjV\nWs\njTZQMyH\nULp\nUfsnPRt\nk\nbPKrnP\nW\nJOaQdgglDG\nAodc\ncpRjAUyYIW\nMrjB\nbPKrnP ULp\nk Ws\ncpRjAUyYIW k\nULp jTZQMyH\nbPKrnP jWuGgOjV\ncpRjAUyYIW jTZQMyH\nW ULp\nk jTZQMyH\nk ULp\nMrjB ULp\ncpRjAUyYIW Aodc\nW k", "11 17\njFTNgFBO\ntZDgmdF\nIjeDjoj\nBEMAaYkNb\nRZRQl\ntK\nlNHWt\nIdG\nLAbVLYiY\notOBsWqJuo\nUoTy\ntK BEMAaYkNb\nBEMAaYkNb jFTNgFBO\nIjeDjoj tZDgmdF\nRZRQl jFTNgFBO\nlNHWt tZDgmdF\nRZRQl tZDgmdF\nUoTy LAbVLYiY\nBEMAaYkNb IjeDjoj\nIdG BEMAaYkNb\nLAbVLYiY tK\nLAbVLYiY jFTNgFBO\nUoTy IjeDjoj\nlNHWt jFTNgFBO\nlNHWt BEMAaYkNb\ntK IjeDjoj\nUoTy RZRQl\nBEMAaYkNb tZDgmdF", "11 13\ncZAMfd\nSWQnweM\nKlQW\nWRsnNZT\nix\nUC\nLWqsVHcWec\nfeb\ncBy\ntvk\nRXDlX\nfeb SWQnweM\ncBy WRsnNZT\nLWqsVHcWec KlQW\nRXDlX feb\nLWqsVHcWec cZAMfd\ncBy UC\nWRsnNZT SWQnweM\nRXDlX cBy\ntvk UC\ncBy SWQnweM\nUC KlQW\nRXDlX KlQW\nUC WRsnNZT", "4 2\nadQx\nrJGeodBycK\ntgPYZk\ncz\ncz tgPYZk\nrJGeodBycK adQx", "4 2\noVemoZhjW\nHspFEry\nhFO\njxt\nhFO HspFEry\njxt oVemoZhjW", "5 2\niBrgNFlNXd\nlnGPIV\nnb\nB\nVgqRcEOG\nlnGPIV iBrgNFlNXd\nB iBrgNFlNXd", "5 1\nWEYUdpYmZp\nfhNmMpjr\nydARivBg\ncilTtE\nyeXxkhPzB\nyeXxkhPzB cilTtE", "6 9\noySkmhCD\nUIKWj\nmHolKkBx\nQBikssqz\nZ\nzoFUJYa\nZ UIKWj\nQBikssqz oySkmhCD\nQBikssqz UIKWj\nZ oySkmhCD\nzoFUJYa UIKWj\nzoFUJYa Z\nzoFUJYa mHolKkBx\nzoFUJYa QBikssqz\nQBikssqz mHolKkBx", "6 1\nuPVIuLBuYM\nVejWyKCtbN\nqqjgF\nulBD\nDRNzxJU\nCOzbXWOt\nulBD qqjgF", "7 14\nFXCT\nn\no\nS\nMdFuonu\nmszv\nbqScOCw\nS o\nbqScOCw FXCT\nMdFuonu o\no n\nbqScOCw n\nmszv S\nbqScOCw MdFuonu\nmszv n\nS FXCT\nbqScOCw o\no FXCT\nmszv MdFuonu\nmszv FXCT\nbqScOCw mszv", "7 6\nj\nZ\nPZNeTyY\nm\na\nUj\nsuaaSiKcK\nUj PZNeTyY\na j\nPZNeTyY Z\nPZNeTyY j\nm PZNeTyY\nm j", "8 6\nU\nC\nPEElYwaxf\nVubTXNI\nJ\nIxZUHV\nhLNFnzmqFE\nDPPvwuWvmA\nhLNFnzmqFE IxZUHV\nIxZUHV C\nJ PEElYwaxf\nIxZUHV PEElYwaxf\nPEElYwaxf C\nJ VubTXNI", "8 12\nBkgxqAF\nKhq\nNpIfk\nkheqUyDVG\niRBkHlRpp\nZDaQY\nNG\nqN\nqN BkgxqAF\nNpIfk BkgxqAF\niRBkHlRpp BkgxqAF\niRBkHlRpp NpIfk\nNG Khq\niRBkHlRpp Khq\nNG ZDaQY\nNG iRBkHlRpp\nNG NpIfk\nqN Khq\nZDaQY kheqUyDVG\nNpIfk Khq", "9 5\nRFiow\naxgvtiBGbx\ngGBVZtI\nVWAxrqx\nmnASVEQI\ntZHzWGAvXc\nBeaCYhIRLy\nhTdUL\nFJd\nhTdUL RFiow\nhTdUL gGBVZtI\nFJd axgvtiBGbx\nFJd BeaCYhIRLy\nhTdUL axgvtiBGbx", "9 13\nYiUXqlBUx\nQNgYuX\ndPtyZ\nITtwRJCv\nLJ\nrAG\nOgxNq\nsitechE\nvVAAz\nOgxNq QNgYuX\nOgxNq dPtyZ\nsitechE rAG\nLJ QNgYuX\nQNgYuX YiUXqlBUx\nOgxNq LJ\nvVAAz OgxNq\nrAG dPtyZ\nvVAAz LJ\nvVAAz ITtwRJCv\nsitechE LJ\nrAG YiUXqlBUx\nsitechE QNgYuX", "9 6\nfLfek\nEQPcotnrp\nCaAlbwoIL\nVG\nNAZKIBiKT\noFy\njFluh\nKqHXRNya\nQSwgobA\noFy EQPcotnrp\nKqHXRNya jFluh\noFy NAZKIBiKT\njFluh oFy\njFluh fLfek\noFy fLfek", "9 14\nmoRNeufngu\nBSKI\nzXl\ngwmIDluW\nYFn\nHvasEgl\nXcAC\neVP\nAiOm\neVP BSKI\neVP YFn\nHvasEgl YFn\neVP XcAC\nAiOm HvasEgl\nXcAC YFn\nzXl moRNeufngu\neVP zXl\nHvasEgl BSKI\nXcAC gwmIDluW\nXcAC HvasEgl\nYFn moRNeufngu\nzXl BSKI\nHvasEgl gwmIDluW", "15 8\ncXeOANpvBF\nbkeDfi\nnsEUAKNxQI\noSIb\naU\nXYXYVo\nduZQ\naPkr\nPVrHpL\nmVgmv\nhHhukllwbf\nGkNPGYVxjY\nbgBjA\nslNKCLIlOv\nmPILXy\nbgBjA cXeOANpvBF\nGkNPGYVxjY cXeOANpvBF\nslNKCLIlOv GkNPGYVxjY\nGkNPGYVxjY mVgmv\nXYXYVo cXeOANpvBF\nslNKCLIlOv bkeDfi\nmVgmv aPkr\nslNKCLIlOv nsEUAKNxQI", "15 3\na\nYclKFJoaIA\nhalYcB\nbLOlPzAeQ\ntckjt\noDFijpx\nb\npz\nVDLb\nlCEHPibt\noF\npzJD\nMC\nqklsX\nTAU\npzJD tckjt\nqklsX oF\nMC pzJD", "16 8\nJIo\nINanHVnP\nKaxyCBWt\nkVfnsz\nRAwFYCrSvI\nF\nvIEWWIvh\nTGF\nFeuhJJwJ\nTngcmS\nSqI\nRmcaVngp\neGwhme\nlwaFfXzM\noabGmpvVH\nTMT\nFeuhJJwJ F\neGwhme FeuhJJwJ\nRmcaVngp SqI\nINanHVnP JIo\nSqI FeuhJJwJ\nF kVfnsz\nTGF F\nTMT TGF", "16 25\nbBZ\nEr\nZ\nrYJmfZLgmx\nPaJNrF\naHtRqSxOO\nD\nhsagsG\nMDuBOXrmWH\nSgjMQZ\nYXgWq\nxDwpppG\nSDY\nJwZWx\ncOzrgrBaE\nFJYX\nYXgWq SgjMQZ\nSDY PaJNrF\nFJYX rYJmfZLgmx\nhsagsG Er\nxDwpppG rYJmfZLgmx\naHtRqSxOO rYJmfZLgmx\nhsagsG bBZ\nJwZWx hsagsG\nFJYX cOzrgrBaE\nSDY YXgWq\nFJYX Z\nJwZWx rYJmfZLgmx\nD rYJmfZLgmx\nYXgWq Z\nrYJmfZLgmx Z\naHtRqSxOO bBZ\nSDY rYJmfZLgmx\ncOzrgrBaE D\nYXgWq hsagsG\nSDY aHtRqSxOO\ncOzrgrBaE xDwpppG\nSDY bBZ\nSDY Er\nJwZWx xDwpppG\nFJYX JwZWx", "16 37\ntIWi\nq\nIEAYCq\nXozwkum\nCC\niPwfd\nS\nXEf\nWqEiwkH\nWX\ne\nltmruh\nKGx\nauTUYZRC\nmeJa\nM\nmeJa q\nKGx e\nXEf Xozwkum\ne q\nauTUYZRC KGx\ne CC\nM CC\nM meJa\nWX CC\nWqEiwkH IEAYCq\nauTUYZRC WqEiwkH\nKGx WX\nmeJa KGx\nXEf q\nauTUYZRC XEf\nauTUYZRC IEAYCq\nWX XEf\nM XEf\nWqEiwkH q\nM KGx\nKGx CC\nM e\nWqEiwkH Xozwkum\nCC q\nS Xozwkum\nKGx tIWi\nWX q\nXEf S\nauTUYZRC S\nCC IEAYCq\nKGx IEAYCq\ne WqEiwkH\nM S\nauTUYZRC q\nS tIWi\nM ltmruh\nM iPwfd", "16 11\ntulhZxeKgo\nbrAXY\nyQUkaihDAg\nmwjlDVaktK\nweVtBIP\nzRwb\nds\nhXPfJrL\nAdIfP\nazQeXn\nB\nJlmscIUOxO\nZuxr\nV\nOfyLIUO\nuaMl\nhXPfJrL yQUkaihDAg\nweVtBIP yQUkaihDAg\nazQeXn hXPfJrL\nV tulhZxeKgo\nzRwb yQUkaihDAg\nds mwjlDVaktK\nzRwb brAXY\nyQUkaihDAg brAXY\nB yQUkaihDAg\nAdIfP mwjlDVaktK\nbrAXY tulhZxeKgo", "5 10\nTaras\nNikita\nSergey\nAndrey\nRomka\nTaras Romka\nTaras Nikita\nTaras Sergey\nTaras Andrey\nRomka Nikita\nRomka Sergey\nRomka Andrey\nNikita Sergey\nNikita Andrey\nSergey Andrey"], "outputs": ["2\nMasha\nPetya", "3\nLesha\nPasha\nVanya", "4\nAndrey\nNikita\nSergey\nTaras", "2\nAndrey\nTaras", "16\nAlena\nAlexey\nAlice\nAndrey\nBrus\nDenis\nEgor\nJohn\nNikita\nOlya\nRomka\nSergey\nTaras\nUra\nVadim\nVanya", "4\nAlena\nBrus\nOlya\nVanya", "5\nAlena\nBrus\nMariana\nOlya\nVanya", "1\nPetr", "2\nNgzlPJgFgz\nQfpagVpWz", "1\nGoWegdDRp", "3\nr\nsdTDerOyhp\nyVwqs", "1\nWmkUGiYEn", "10\nKgPQA\nPIZRMOu\nToLcqN\nXCKZ\nXtueKFM\nbnenhMxiK\neaQrds\njA\nkyRNTE\nmQIl", "8\nAodc\nJOaQdgglDG\nMrjB\nUfsnPRt\nW\nWs\nbPKrnP\njTZQMyH", "6\nIdG\nIjeDjoj\nLAbVLYiY\nRZRQl\nlNHWt\notOBsWqJuo", "6\nKlQW\nWRsnNZT\ncZAMfd\nfeb\nix\ntvk", "2\nadQx\ncz", "2\nHspFEry\njxt", "4\nB\nVgqRcEOG\nlnGPIV\nnb", "4\nWEYUdpYmZp\ncilTtE\nfhNmMpjr\nydARivBg", "3\nUIKWj\nmHolKkBx\noySkmhCD", "5\nCOzbXWOt\nDRNzxJU\nVejWyKCtbN\nqqjgF\nuPVIuLBuYM", "3\nFXCT\nMdFuonu\nn", "5\nUj\nZ\na\nm\nsuaaSiKcK", "5\nC\nDPPvwuWvmA\nJ\nU\nhLNFnzmqFE", "3\nBkgxqAF\nKhq\nZDaQY", "7\nBeaCYhIRLy\nRFiow\nVWAxrqx\naxgvtiBGbx\ngGBVZtI\nmnASVEQI\ntZHzWGAvXc", "4\nITtwRJCv\nLJ\nYiUXqlBUx\ndPtyZ", "7\nCaAlbwoIL\nEQPcotnrp\nKqHXRNya\nNAZKIBiKT\nQSwgobA\nVG\nfLfek", "4\nAiOm\nBSKI\nYFn\ngwmIDluW", "12\nGkNPGYVxjY\nPVrHpL\nXYXYVo\naPkr\naU\nbgBjA\nbkeDfi\nduZQ\nhHhukllwbf\nmPILXy\nnsEUAKNxQI\noSIb", "13\nMC\nTAU\nVDLb\nYclKFJoaIA\na\nb\nbLOlPzAeQ\nhalYcB\nlCEHPibt\noDFijpx\noF\npz\ntckjt", "11\nF\nINanHVnP\nKaxyCBWt\nRAwFYCrSvI\nRmcaVngp\nTMT\nTngcmS\neGwhme\nlwaFfXzM\noabGmpvVH\nvIEWWIvh", "8\nD\nEr\nJwZWx\nMDuBOXrmWH\nPaJNrF\nSgjMQZ\nZ\naHtRqSxOO", "8\nIEAYCq\nWX\nXozwkum\ne\niPwfd\nltmruh\nmeJa\ntIWi", "11\nAdIfP\nB\nJlmscIUOxO\nOfyLIUO\nV\nZuxr\nazQeXn\nbrAXY\nds\nuaMl\nweVtBIP", "1\nAndrey"]}

UNKNOWN

PYTHON3

CODEFORCES

28

90b3babebf9e99d1cac2b06764636584

none

You are given a rectangular parallelepiped with sides of positive integer lengths $A$, $B$ and $C$. Find the number of different groups of three integers ($a$, $b$, $c$) such that $1\leq a\leq b\leq c$ and parallelepiped $A\times B\times C$ can be paved with parallelepipeds $a\times b\times c$. Note, that all small parallelepipeds have to be rotated in the same direction. For example, parallelepiped $1\times 5\times 6$ can be divided into parallelepipeds $1\times 3\times 5$, but can not be divided into parallelepipeds $1\times 2\times 3$. The first line contains a single integer $t$ ($1 \leq t \leq 10^5$) — the number of test cases. Each of the next $t$ lines contains three integers $A$, $B$ and $C$ ($1 \leq A, B, C \leq 10^5$) — the sizes of the parallelepiped. For each test case, print the number of different groups of three points that satisfy all given conditions. Sample Input 4 1 1 1 1 6 1 2 2 2 100 100 100 Sample Output 1 4 4 165

[ "from math import gcd\r\n \r\nN = 100001\r\nd = [0 for i in range(N)]\r\nfor i in range(1, N):\r\n for j in range(i, N, i):\r\n d[j] += 1\r\n \r\nn = int(input())\r\nfor _ in range(n):\r\n a, b, c = map(int, input().split())\r\n A, B, C = d[a], d[b], d[c]\r\n AB, BC, CA = d[gcd(a, b)], d[gcd(b, c)], d[gcd(c, a)]\r\n ABC = d[gcd(gcd(a, b), c)]\r\n print(A * B * C - AB * BC * CA + ABC * (AB * BC + BC * CA + CA * AB)\r\n - A * BC * (BC - 1) // 2 - B * CA * (CA - 1) // 2 - C * AB * (AB - 1) // 2\r\n - ABC * (ABC + 1) * (AB + BC + CA) // 2 + ABC * (ABC + 1) * (ABC + 2) // 6)", "from sys import stdin\nfrom math import gcd\n\n\ndef main():\n input()\n l = stdin.read().splitlines()\n d = [3, 1, 2, 2, 2, 1] * 16667\n for i in range(4, 100001):\n for j in range(i, 100001, i):\n d[j] += 1\n for i, s in enumerate(l):\n a, b, c = map(int, s.split())\n k = gcd(b, c)\n ab = d[gcd(a, b)]\n ac = d[gcd(a, c)]\n bc = d[k]\n abc = d[gcd(a, k)]\n asz = d[a] - ab - ac + abc\n bsz = d[b] - bc - ab + abc\n csz = d[c] - ac - bc + abc\n absz = ab - abc\n bcsz = bc - abc\n acsz = ac - abc\n abcsz = abc\n l[i] = (asz * bsz * csz +\n (absz * (asz + bsz) * csz) +\n (bcsz * (bsz + csz) * asz) +\n (acsz * (asz + csz) * bsz) +\n (abcsz * (asz * bsz + asz * csz + bsz * csz)) +\n (abcsz * (absz + bcsz + acsz) * (asz + bsz + csz)) +\n ((asz + bsz + csz + absz + bcsz + acsz) * (abcsz * (abcsz + 1) // 2)) +\n (absz * bcsz * acsz) +\n ((absz * (absz + 1) * d[c]) +\n (bcsz * (bcsz + 1) * d[a]) +\n (acsz * (acsz + 1) * d[b])) // 2 +\n ((asz + bsz + csz + abcsz) * (absz * acsz + absz * bcsz + bcsz * acsz)) +\n (abcsz + (abcsz * (abcsz - 1)) + (abcsz * (abcsz - 1) * (abcsz - 2) // 6)))\n print('\\n'.join(map(str, l)))\n\n\nif __name__ == '__main__':\n main()\n" ]

{"inputs": ["4\n1 1 1\n1 6 1\n2 2 2\n100 100 100", "10\n1 1 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1", "10\n9 6 8\n5 5 2\n8 9 2\n2 7 9\n6 4 10\n1 1 8\n2 8 1\n10 6 3\n7 5 2\n9 5 4", "1\n100000 100000 100000"], "outputs": ["1\n4\n4\n165", "1\n1\n1\n1\n1\n1\n1\n1\n1\n1", "41\n6\n21\n12\n39\n4\n7\n26\n8\n18", "8436"]}

UNKNOWN

PYTHON3

CODEFORCES

2

90c3ae3432be76316c44df8b294d09fc

Money Transfers

There are *n* banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank *n* are neighbours if *n*<=><=1. No bank is a neighbour of itself. Vasya has an account in each bank. Its balance may be negative, meaning Vasya owes some money to this bank. There is only one type of operations available: transfer some amount of money from any bank to account in any neighbouring bank. There are no restrictions on the size of the sum being transferred or balance requirements to perform this operation. Vasya doesn't like to deal with large numbers, so he asks you to determine the minimum number of operations required to change the balance of each bank account to zero. It's guaranteed, that this is possible to achieve, that is, the total balance of Vasya in all banks is equal to zero. The first line of the input contains a single integer *n* (1<=≤<=*n*<=≤<=100<=000) — the number of banks. The second line contains *n* integers *a**i* (<=-<=109<=≤<=*a**i*<=≤<=109), the *i*-th of them is equal to the initial balance of the account in the *i*-th bank. It's guaranteed that the sum of all *a**i* is equal to 0. Print the minimum number of operations required to change balance in each bank to zero. Sample Input 3 5 0 -5 4 -1 0 1 0 4 1 2 3 -6 Sample Output 1 2 3

[ "# http://codeforces.com/contest/675/problem/C\nfrom collections import defaultdict\n\nn = int(input())\nl = list(map(int, input().split()))\n\n# frequency of the most frequent cumulative sum, using hash\n\nd = defaultdict(int)\n\ncost = n-1\ns = 0 # indicates postion based on sum\nfor x in l:\n s+=x\n d[s]+=1\n cost = min(cost,n- d[s])\n\nprint (cost) \n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nsearch = dict()\r\nsum = 0\r\nfor b in a:\r\n sum += b\r\n if not sum in search:\r\n search[sum] = 1\r\n else:\r\n search[sum] += 1\r\nprint(n - max(search.values()))\r\n", "def main():\r\n n = int(input())\r\n amounts = [int(i) for i in input().split()]\r\n cnt = dict()\r\n prefix = 0\r\n for a in amounts:\r\n prefix += a\r\n if prefix in cnt:\r\n cnt[prefix] += 1\r\n else:\r\n cnt[prefix] = 1\r\n ans = 0\r\n for k in cnt:\r\n if ans < cnt[k]:\r\n ans = cnt[k]\r\n print(n - ans)\r\n\r\nmain()\r\n", "from collections import Counter\nfrom itertools import accumulate\nn = int(input())\nprint(n - Counter(accumulate(map(int, input().split()), lambda x, y: x+y)).most_common(1)[0][1])\n", "n=int(input())\r\na=list(map(int,input().split()))\r\npresum, s = {}, 0\r\nfor x in a:\r\n s+=x\r\n if s in presum:\r\n presum[s]+=1\r\n else:\r\n presum[s]=1\r\nprint(n-max(presum.values()))\r\n", "n = int(input())\r\n\r\narr = input().split()\r\narr = [int(i) for i in arr]\r\n\r\ndi = {}\r\ns=0\r\nm=0\r\nfor i in arr:\r\n s=s+i\r\n if(s in di.keys()):\r\n di[s]+=1\r\n if(di[s]>m):\r\n m=di[s]\r\n else:\r\n di[s]=1\r\n if(di[s]>m):\r\n m=di[s]\r\n\r\nans = n-m\r\nprint(ans)", "import sys\nimport math\ninput = sys.stdin.readline\nn = int(input())\na = [0] + [int(_) for _ in input().split()]\ndp = [0] * (n + 1)\nlast = dict()\ntotal, ans, last[0] = 0, 0, 0\nfor i in range(1, n + 1):\n total += a[i]\n if last.get(total, -1) == -1:\n dp[i] = 0\n else:\n dp[i] = 1 + dp[last[total]]\n last[total] = i\n if i == n:\n ans = max(ans, dp[i])\n else:\n ans = max(ans, dp[i] + 1)\nprint(n - ans)\n", "n=int(input())\nL=[int(x) for x in input().split()]\na=0\nd={}\nfor i in L:\n a+=i\n if a not in d:\n d[a]=0\n d[a]+=1\nprint(n-max(d.values()))\n\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nd = dict()\r\ntotal = 0\r\nfor i in range(n):\r\n\ttotal += a[i]\r\n\td[total] = 0\r\n\r\ntotal = 0\r\nans = 0\r\nfor i in range(n):\r\n\ttotal += a[i]\r\n\td[total] += 1\r\n\tans = max(ans, d[total])\r\n\r\nprint(n - 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] = a[i] + p[i - 1]\r\np.sort()\r\np.append(float('inf'))\r\nans = 0\r\ni = 0\r\nwhile i < n:\r\n j = i\r\n while p[j] == p[i]:\r\n j += 1\r\n ans = max(ans, j - i)\r\n i = j\r\nprint(n - ans)# 1691240835.7281392", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dd\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=dd(int)\r\nsa=0\r\nans=10**9\r\nfor i in range(n):\r\n sa+=a[i]\r\n d[sa]+=1\r\n ans=min(ans,n-d[sa])\r\nprint(ans)", "from collections import *\r\nfrom itertools import *\r\nprint(int(input())-max(Counter(accumulate(map(int,input().split()))).values()))", "from sys import stdin\ninput = stdin.buffer.readline\nn = int(input())\n\nlst = list(map(int, input().split()))\n\nif n <= 1:\n print(0)\n exit()\n\n\nfor i in range(1, n):\n lst[i] += lst[i-1]\n\nfrom collections import Counter\ncnter = Counter(lst)\nt = cnter.most_common(1)\n# print(t)\nprint(n- t[0][1])\n\n\t\t\t\t \t\t \t \t\t\t\t \t \t\t \t \t \t \t\t", "n = int(input(\"\"))\r\nl = input(\"\").split(\" \")\r\nfor i in range(len(l)):\r\n l[i] = int(l[i])\r\n\r\ns = 0\r\nm = 0\r\nps = {}\r\nfor i in range(len(l)):\r\n s += l[i]\r\n if (s in ps):\r\n ps[s] += 1\r\n else:\r\n ps[s] = 1\r\n if (ps[s] > m):\r\n m = ps[s]\r\n\r\nprint((n-m))\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\nsum=0\r\nd=dict()\r\nfor i in range(n):\r\n sum += l[i]\r\n if sum not in d.keys():\r\n d[sum] = 1\r\n else:\r\n d[sum]+=1\r\nprint(n-max(d.values()))", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = [a[0]]\r\nfor i in range(1, n):\r\n s.append(s[i - 1] + a[i])\r\nd = {}\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\nprint(n - max(d.values()))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nd,s={},0\r\nfor i in range(n):\r\n s+=a[i]\r\n if s not in d:d[s]=0\r\n d[s]+=1\r\nprint(n-max(d.values()))", "def main():\n from itertools import accumulate\n from collections import Counter\n print(int(input()) - Counter(accumulate(map(int, input().split()))).most_common()[0][1])\n\n\nif __name__ == '__main__':\n main()\n", "from collections import Counter\r\n\r\nn = int(input())\r\nc = Counter();\r\n\r\nnum = list(map(int,input().split()));\r\n\r\nfor i in range(1,n) :\r\n num[i] += num[i-1];\r\nc.update(num);\r\nprint(n - c.most_common()[0][1])", "n = int(input())\r\na = list(map(int,input().split()))\r\nif a == [0]*n:\r\n print(0)\r\n exit(0)\r\ndp1 = [0]*(n)\r\ndp1[0] = a[0]\r\nfor i in range(1,n):\r\n dp1[i] = dp1[i-1] + a[i]\r\nres = 0\r\ncounter = {}\r\nfor i in range(n):\r\n try:\r\n counter[dp1[i]] += 1\r\n except:\r\n counter[dp1[i]] = 1\r\nfor elem in counter:\r\n res = max(res, counter[elem])\r\nprint(n-res)\r\n ", "from collections import Counter\r\n\r\nc = Counter()\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(1, n):\r\n a[i] += a[i-1]\r\nc.update(a)\r\n\r\nprint(n - c.most_common()[0][1])\r\n", "from collections import defaultdict\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncnt = defaultdict(lambda : 0)\r\nma = 0\r\nu = 0\r\nfor i in a:\r\n u += i\r\n cnt[u] += 1\r\n ma = max(ma, cnt[u])\r\nans = n - ma\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nsums = [0] * (n + 1)\r\nfor i in range(n):\r\n sums[i + 1] = sums[i] + a[i]\r\n\r\noccs = {}\r\nfor i in range(1, n + 1):\r\n if sums[i] in occs:\r\n last = occs[sums[i]][-1]\r\n if last[1] == i:\r\n last[1] = i + 1\r\n else:\r\n occs[sums[i]].append([i, i + 1])\r\n else:\r\n occs[sums[i]] = [[i, i + 1]]\r\n\r\nans = n - 1\r\nfor k in occs:\r\n cur = 0\r\n for i in range(len(occs[k])):\r\n elem = occs[k][i]\r\n next = occs[k][(i + 1) % len(occs[k])]\r\n if next[0] >= elem[1]:\r\n cur += next[0] - elem[1]\r\n else:\r\n cur += next[0] + n - elem[1]\r\n\r\n ans = min(ans, cur)\r\n\r\nprint(ans)\r\n", "n = int(input())\r\na = map(int,input().split())\r\nsearch =dict()\r\nsum=0\r\nfor b in a:\r\n sum+=b\r\n if not sum in search:\r\n search[sum] = 1\r\n else:\r\n search[sum] +=1\r\nprint(n-max(search.values()))\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nans = n-1\r\nsm = 0\r\nfreq = {}\r\nfor i in arr:\r\n sm += i\r\n freq[sm] = freq.get(sm,0)+1\r\n ans = min(ans,n-freq[sm])\r\nprint(ans)", "n = int(input())\nb = list(map(int, input().split()))\n\nfrom collections import Counter\nfrom itertools import accumulate\ncum = list(accumulate(b))\ncnt = Counter(cum)\nprint (n - cnt.most_common(1)[0][1])\n", "import sys\nsys.stderr = sys.stdout\n\n\ndef money(n, A):\n S = [0]\n s = 0\n for a in A:\n s += a\n S.append(s)\n S.pop()\n\n N = [None] * n\n D = {s: i for (i, s) in enumerate(S)}\n for i, s in enumerate(S):\n j = D[s]\n N[j] = i\n D[s] = i\n\n m = n-1\n C = [False] * n\n for i in range(n):\n if C[i]:\n continue\n C[i] = True\n c = 1\n j = N[i]\n while j != i:\n C[j] = True\n c += 1\n j = N[j]\n m = min(m, n - c)\n return m\n\n\ndef main():\n n = readint()\n A = readintl()\n print(money(n, A))\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", "from collections import *\r\nn = int(input())\r\na = list(map(int,input().split()))\r\npre = [0 for i in range(n)]\r\npre[0] = a[0]\r\nfor i in range(1,n):\r\n\tpre[i] = pre[i-1]+a[i]\r\nc = Counter(pre)\r\nm = max(c.values())\r\nprint(n-m)\r\n" ]

{"inputs": ["3\n5 0 -5", "4\n-1 0 1 0", "4\n1 2 3 -6", "1\n0", "50\n108431864 128274949 -554057370 -384620666 -202862975 -803855410 -482167063 -55139054 -215901009 0 0 0 0 0 94325701 730397219 358214459 -673647271 -131397668 -377892440 0 0 0 0 0 -487994257 -360271553 639988328 489338210 -281060728 250208758 0 993242346 -213071841 -59752620 -864351041 -114363541 506279952 999648597 -173503559 -144629749 -559693009 0 -46793577 511999017 -343503822 -741715911 647437511 821346413 993112810", "6\n1 -1 1 -1 1 -1"], "outputs": ["1", "2", "3", "0", "36", "3"]}

UNKNOWN

PYTHON3

CODEFORCES

28

90c94d1f5e83e4c8b0d3186dacb5a837

Good Number

Let's call a number *k*-good if it contains all digits not exceeding *k* (0,<=...,<=*k*). You've got a number *k* and an array *a* containing *n* numbers. Find out how many *k*-good numbers are in *a* (count each number every time it occurs in array *a*). The first line contains integers *n* and *k* (1<=≤<=*n*<=≤<=100, 0<=≤<=*k*<=≤<=9). The *i*-th of the following *n* lines contains integer *a**i* without leading zeroes (1<=≤<=*a**i*<=≤<=109). Print a single integer — the number of *k*-good numbers in *a*. Sample Input 10 6 1234560 1234560 1234560 1234560 1234560 1234560 1234560 1234560 1234560 1234560 2 1 1 10 Sample Output 10 1

[ "n,m=map(int,input().split())\r\nc=0\r\nfor _ in range(n):\r\n a= input()\r\n if all(list(map(lambda x: str(x) in a , range(m+1)))):\r\n c+=1\r\n else:\r\n continue\r\nprint(c)", "a,b = map(int,input().split())\r\nc = 0\r\nfor i in range(a):\r\n s=0\r\n x=input()\r\n for i in range(b+1):\r\n if str(i) in x:\r\n s+=1\r\n if s==b+1:\r\n c+=1\r\nprint(c)", "n,k = map(int , input().split())\r\n\r\nl_comp = [x for x in range(k+1)]\r\nans = 0\r\n\r\n\r\nfor i in range (n):\r\n new_l = sorted([int(x) for x in list(input())])\r\n if set(l_comp).issubset(set(new_l)):\r\n ans+=1\r\n \r\nprint(ans)", "n, k = map(int,input().split())\r\nr = 0\r\nfor i in range(n):\r\n a = input()\r\n for j in range(k+1):\r\n if str(j) in a:\r\n b = 1\r\n else:\r\n b = 0\r\n break\r\n if b == 1:\r\n r +=1\r\nprint(r) ", "def listGen(k):\r\n l = []\r\n for i in range(k+1):\r\n l.append(str(i))\r\n return l\r\n\r\narr = list(map(int,input().split()))\r\nn = arr[0]\r\nk = arr[1]\r\ncount = 0\r\nx = listGen(k)\r\nfor i in range(n):\r\n arr1 = list(input())\r\n isGood = True\r\n for y in x:\r\n if y not in arr1:\r\n isGood = False\r\n break\r\n if isGood:\r\n count+=1\r\n \r\nprint(count)", "test_cases, k = map(int, input().split())\r\ncounter = 0\r\nfor _ in range(test_cases):\r\n num = input()\r\n flag = True\r\n for i in range(k+1):\r\n if str(i) not in num:\r\n flag = False\r\n break\r\n if flag: counter += 1\r\nprint(counter)", "t,n=map(int,input().split())\r\n\r\ngood_no = 0\r\nfor i in range(t) :\r\n count=0\r\n b = []\r\n a = input()\r\n for i in range(len(a)) :\r\n for k in range(0,n+1,1) :\r\n if int(a[i]) == k and a[i] not in b :\r\n count += 1\r\n b.append(a[i])\r\n \r\n if count >= n+1 :\r\n good_no += 1\r\nprint(good_no) \r\n \r\n ", "a,b=map(int,input().split())\r\nb=list(map(str,range(b+1)))\r\nn=len(b)\r\nv=0\r\nfor i in range(a):\r\n g=set(input())\r\n if sorted(g)[:n]==b:\r\n v+=1\r\nprint(v)\r\n ", "a, b = map(int, input().split())\r\nc = 0\r\nfor i in range(a):\r\n d = 0\r\n l = list(map(int, input()))\r\n for j in range(b+1):\r\n if j in l:\r\n d += 1\r\n if d == b + 1:\r\n c += 1\r\nprint(c)", "#This was submitted to codeforces.com\r\nn,k=map(int,input().split())\r\ngood=0\r\ns=list(range(0,k+1))\r\nfor i in range(n):\r\n lst=list(map(int,input()))\r\n nums=[]\r\n tem=list(sorted(list(set(lst)))) #Removing repeating occurences, and sorting\r\n if k!=0:\r\n nums=tem[0:len(s)]\r\n else:\r\n if s[0] in lst:\r\n if lst[0]!=0:\r\n good+=1\r\n continue\r\n elif lst[0]==0 and lst.count(0)>1:\r\n good+=1\r\n continue\r\n else:\r\n continue\r\n if s==nums:\r\n good+=1\r\nprint(good)", "cnt=0\r\nn,k=map(int,input().split())\r\nl=[i for i in range(k+1)]\r\nfor i in range(n):\r\n a=input()\r\n if all(str(j) in a for j in l):\r\n cnt+=1\r\nprint(cnt)", "n, k = map(int, input().split())\r\ncnt = 0\r\nfor _ in range(n):\r\n num = list(map(int, list(input())))\r\n num.sort()\r\n for i in range(k + 1):\r\n if i not in num:\r\n break\r\n else:\r\n cnt += 1\r\nprint(cnt)", "n, k = map(int, input().split())\r\na = 0\r\nfor i in range(n):\r\n n = input()\r\n g = 1\r\n for j in range(k+1):\r\n if str(j) not in n:\r\n g = 0\r\n break\r\n if g != 0:\r\n a += 1\r\nprint(a)", "a, b = map(int, input().split())\r\n\r\nf = [i for i in range(b+1)]\r\n\r\ncont = True\r\ncount = 0\r\nfor i in range(a):\r\n s = input()\r\n for j in f:\r\n if str(j) not in s:\r\n cont = False\r\n if cont == True:\r\n count = count + 1 \r\n cont = True\r\nprint(count)", "n,k = map(int,input().split())\ncount = 0\nrng = [chr(ord('0') + x) for x in range(k+1) ]\nrng = set(rng)\nfor _ in range(n):\n s = set(input())\n if rng.issubset(s):\n count+=1\nprint(count)\n ", "n,k = map(int,input().split())\r\nc = n\r\nfor i in range (n) :\r\n a = input()\r\n for i in range (k+1) :\r\n if str(i) not in a :\r\n c -= 1\r\n break\r\nprint(c)\r\n", "ret= -1\r\nss=\"0123456789\"\r\nn,k=map(int, input().split())\r\nvar1=0\r\nvar2=0\r\nwhile n:\r\n s=input()\r\n for i in range(0,k+1):\r\n ret=s.find(ss[i])\r\n if ret!=-1:\r\n var1+=1\r\n ret=-1\r\n if var1>=k+1:\r\n var2+=1\r\n var1=0\r\n n-=1\r\nprint(var2)", "n, k = map(int, input().split())\n\ncheck_list = [str(k) for k in range(k + 1)]\n\nfor i in range(n):\n\n ui = input()\n\n for j in range(len(check_list)):\n if check_list[j] not in ui:\n n = n - 1\n break\nprint(n)\n", "n,k=map(int,input().split())\r\na=[]\r\nb=[]\r\nc=0\r\nfor i in range(n):\r\n d=input()\r\n a.append(d)\r\nfor i in range(k+1):\r\n b.append(str(i))\r\nfor i in a:\r\n m=0\r\n for j in range(len(b)):\r\n if b[j] not in i:\r\n m=1\r\n if m!=1:\r\n c+=1\r\nprint(c)", "def fun(arr, min, k):\r\n if min > k:\r\n return 1\r\n if min <= k and min in arr:\r\n return fun(arr, min + 1, k)\r\n else:\r\n return 0\r\n\r\n\r\ndata = list(map(int, input().split()))\r\nnum_count = 0\r\nfor i in range(data[0]):\r\n arr = list(map(int, input()))\r\n if len(arr) > data[1]:\r\n if data[1] in arr:\r\n if fun(arr, 0, data[1]):\r\n num_count += 1\r\n\r\n\r\nprint(num_count)", "n, k = map(int,input().split())\r\nval = 0\r\nfor x in range(n):\r\n a = input()\r\n count = 0\r\n for x in range(k+1):\r\n if str(x) in a:\r\n count += 1\r\n if count == k+1:\r\n val += 1\r\nprint(val)", "\nn, k = map(int, input().split())\n\nres = 0\n\nfor _ in range(n):\n a, digits = input(), set()\n for d in a:\n if 0 <= int(d) <= k:\n digits.add(d)\n res += len(digits) == k + 1\n\nprint(res)\n", "n, k = map(int, input().split())\r\n\r\nt = [str(i) for i in range(k+1)]\r\n\r\ndef checa(s):\r\n for j in t:\r\n if not j in s:\r\n return False\r\n\r\n return True\r\n\r\ncont = 0\r\nfor i in range(n):\r\n s = str(input())\r\n \r\n if checa(s):\r\n cont += 1\r\n\r\nprint(cont)\r\n", "t= -1\r\nss=\"0123456789\"\r\np,q=map(int, input().split())\r\ncount1=0\r\ncount2=0\r\nwhile p:\r\n s=input()\r\n for i in range(0,q+1):\r\n t=s.find(ss[i])\r\n if t!=-1:\r\n count1+=1\r\n t=-1\r\n if count1>=q+1:\r\n count2+=1\r\n count1=0\r\n p-=1\r\nprint(count2)", "n, k = map(int, input().split())\r\nans = 0\r\nfor i in range(n):\r\n num = input()\r\n good = 1\r\n for j in range(k+1):\r\n if str(j) not in num:\r\n good = 0\r\n break\r\n if good != 0:\r\n ans += 1\r\nprint(ans)", "n,k=list(map(int,input().split()))\r\narr=[]\r\nsumm=0\r\nfor i in range(n):\r\n arr.append(list(map(int,input())))\r\n \r\nfor i in arr:\r\n l=[]\r\n for j in i :\r\n if j>k:\r\n continue\r\n if j not in l:\r\n l.append(j)\r\n if len(l)!=k+1:\r\n continue\r\n if sum(l)==(k*(k+1))/2:\r\n summ+=1\r\nprint(summ)\r\n \r\n ", "import sys\r\nfrom math import gcd\r\ndef inp() : return sys.stdin.readline().strip()\r\ndef get_ints(): return map(int, inp().split())\r\ndef get_arr(): return list(map(int, inp().split()))\r\ndef get_int(): return int(inp())\r\nn,k=get_ints()\r\ncount=0\r\nfor _ in range(n):\r\n s=inp()\r\n val=0\r\n for i in range(k+1):\r\n if(s.find(str(i))!=-1):\r\n val+=1\r\n if(val==k+1): count+=1\r\nprint(count)", "n,m=map(int,input().split())\r\nc=0\r\nlist1=list(range(0,m+1))\r\nl=len(list1)\r\nfor i in range(n):\r\n list2=list(map(int,input()))\r\n num=[]\r\n temp2=list(sorted(list(set(list2))))\r\n if m!=0:\r\n num=temp2[0:l]\r\n else:\r\n if list1[0] in list2:\r\n c+=1\r\n continue\r\n elif list2[0]==0 and list2.count(0)>1:\r\n c+=1\r\n continue\r\n else:\r\n continue\r\n if list1==num:\r\n c+=1\r\nprint(c)\r\n", "n,k=map(int, input().split())\r\ncnt = 0\r\nfor i in range(n):\r\n a = list(map(int, input()))\r\n for j in range(k+1):\r\n if j not in a:\r\n break\r\n else:\r\n cnt += 1\r\nprint(cnt)\r\n", "n, k = map(int, input().split())\r\ncount = 0\r\nlst, lst2 = [], []\r\nfor i in range(n):\r\n num = list(map(int, input()))\r\n for n in range(len(num)):\r\n lst.append(num[n])\r\n lst.sort()\r\n\r\n for m in lst:\r\n if m not in lst2:\r\n lst2.append(m)\r\n lst2.sort()\r\n\r\n for index in range(len(lst2)):\r\n if index == lst2[index]:\r\n if index == k:\r\n count += 1\r\n lst.clear()\r\n lst2.clear()\r\nprint(count)\r\n\r\n", "n,k=map(int,input().split())\r\ncn=0\r\nfor i in range(0,n):\r\n c=0\r\n n=0\r\n l=input()\r\n for j in range(0,k+1):\r\n if(l.count(str(j))>0):\r\n c+=1\r\n #for j in range(k+1,10):\r\n # if(l.count(str(j))>0):\r\n # n=1\r\n if(c==k+1):# and n!=1):\r\n cn+=1\r\nprint(cn)", "x,y=map(int,input().split())\r\nc=0\r\nn=0\r\nfor i in range(x):\r\n temp=input()\r\n for j in range(0,y+1):\r\n if str(j) not in temp:\r\n n=0\r\n break\r\n else:\r\n n=1\r\n if n==1:\r\n c+=1\r\nprint(c)\r\n\r\n", "n, k = list(map(int, input().split()))\r\ncounter = 0\r\n\r\nfor i in range(n):\r\n cur = -1\r\n q = input()\r\n li = []\r\n for i in q:\r\n li.append(int(i))\r\n for i in range(k+1):\r\n if i in li:\r\n continue\r\n else:\r\n cur = i\r\n if cur == -1:\r\n cur = k + 1\r\n if cur > k:\r\n counter += 1\r\nprint(counter)\r\n\r\n \r\n \r\n", "n,k=map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n b = input()\r\n a.append(b)\r\nc = ''\r\nfor i in range(k+1):\r\n c+=str(i)\r\nd = 0\r\nfor i in a:\r\n e = 1\r\n for j in c:\r\n if j in i:\r\n pass\r\n else:\r\n e = 0\r\n d += e\r\nprint(d)\r\n \r\n\r\n", "import sys\r\n\r\n\r\ndef main():\r\n n,k = map(int, sys.stdin.readline().split(' '))\r\n \r\n c = \"\"\r\n for i in range(1, k+1):\r\n c+=str(i)\r\n \r\n c+='0'\r\n fans = 0\r\n for i in range(n):\r\n s = sys.stdin.readline().strip()\r\n ans = 0\r\n for j in c:\r\n for k in s:\r\n if j == k:\r\n ans+=1\r\n break\r\n \r\n if len(c) == ans:\r\n fans+=1\r\n \r\n sys.stdout.write(str(fans))\r\n\r\nif __name__ == '__main__':\r\n main()", "n,k=map(int,input().split())\r\ncrime=n\r\nk_str =\"\"\r\nfor i in range(k+1): # this will create a string of second input\r\n#e.g. if k = 6 b will have 0123456\r\n k_str = k_str+str(i)\r\n#print(k_str)\r\nfor i in range(n):\r\n tc=input()\r\n for j in k_str:\r\n if j not in tc:\r\n crime -= 1\r\n break\r\nprint(crime)", "n,k=map(int, input().split())\r\nc=0\r\nfor i in range(n):\r\n a = list(map(int, input()))\r\n for j in range(k+1):\r\n if j not in a:\r\n break\r\n else:\r\n c=c+1\r\nprint(c)", "# -*- coding: utf-8 -*-\n\"\"\"Good_Number.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/18jTOH64bSl-p-HkdGDBd-wO1nWRsBVGD\n\"\"\"\n\nn,k=map(int,input().split())\ns = set('0123456789'[:k+1])\nprint(sum(set(input()) >= s for _ in range(n)))", "n, k = map(int, input().split())\r\np = 0\r\nfor i in range(n):\r\n s = 0\r\n h = input()\r\n l = len(h)\r\n for j in range(k+1):\r\n if str(j) in h :\r\n s+=1\r\n if s == k+1 :\r\n p += 1\r\nprint(p)", "max, n = [int(x) for x in input().split()]\r\nans = 0\r\n\r\nfor i in range(max):\r\n s = input()\r\n for i in range(n+1):\r\n if str(i) in s:\r\n flag = 1\r\n else:\r\n flag = 0\r\n break\r\n\r\n if flag == 1:\r\n ans += 1\r\n \r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\nnb=0\r\nfor i in range(n):\r\n x=int(input())\r\n l=[int(y) for y in str(x)]\r\n for j in range(k+1):\r\n t=1\r\n if j not in l:\r\n t=0\r\n break\r\n if t==1:\r\n nb+=1 \r\nprint(nb)", "def main(counter=0):\r\n x, z = map(int, input().split())\r\n values = [str(input()) for _ in range(x)]\r\n keys = [str(i) for i in range(0, z+1)]\r\n for value in values:\r\n if all([(i in value) for i in keys]):\r\n counter += 1\r\n\r\n return print(counter)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# 10 6\r\ndef searchN(txt,y):\r\n for x in range(y + 1) :\r\n if(txt.find(str(x)) == -1) :\r\n return False\r\n return True\r\nx, y = map(int, input().split())\r\nsum = 0\r\nfor z in range(x) :\r\n number = input()\r\n if(searchN(number,y)):\r\n sum += 1\r\nprint(sum)\r\n", "x, y= map(int, input().split())\r\na = 0\r\nfor i in range(x):\r\n b = 0\r\n l = list(map(int, input()))\r\n for j in range(y+1):\r\n if j in l:\r\n b += 1\r\n if b == y + 1:\r\n a += 1\r\nprint(a)", "n,m = map(int,input().split())\r\ncount = n\r\nfor i in range(n):\r\n a = input()\r\n for i in range (m+1) :\r\n if str(i) not in a :\r\n count-=1\r\n break\r\nprint(count)", "n, k = list(map(int, input().split()))\r\nc = 0\r\ns = set(map(str, range(k + 1)))\r\nfor i in range(n):\r\n x = set(input())\r\n if s.issubset(x):\r\n c += 1\r\nprint(c)", "n,k = map(int, input().split())\n\ngoodNumber = 0\n\nintegers = [0,1,2,3,4,5,6,7,8,9]\n\nfor i in range(n):\n if len(set([i for i in list(map(int,input())) if i in integers[:k+1]])) == k+1:\n goodNumber += 1\n\nprint(goodNumber)\n", "m , k = map(int,input().split())\r\nvalid = [str(i) for i in range(0,k+1)]\r\ncount1 = 0\r\nfor _ in range(m):\r\n count2 = 0\r\n a = input()\r\n b = [i for i in a]\r\n for i in valid:\r\n if i in b:\r\n count2 += 1\r\n if len(valid) == count2:\r\n count1 +=1\r\nprint(count1)", "n, t = map(int, input().split())\r\nk = 0\r\nfor i in range(n):\r\n s = input()\r\n for j in range(t + 1):\r\n if str(j) not in s:\r\n break\r\n else:\r\n k += 1\r\nprint(k)\r\n", "l=input().split()\r\nlst=list(l)\r\nn=int(lst[1])\r\nx=int(lst[0])\r\nc=0\r\nfor i in range (x):\r\n y=0\r\n a=input()\r\n for i in range (n+1):\r\n if str(i) in a:\r\n y=y+1\r\n if y==n+1: \r\n c=c+1\r\nprint(c) ", "s=[0,0]\r\ns[0],s[1]=map(int,input().split())\r\nn=0\r\nfor i in range(s[0]):\r\n k=0\r\n a=input()\r\n for i in range(s[1]+1):\r\n if str(i) in a:\r\n k=k+1\r\n if k==s[1]+1:\r\n n=n+1\r\nprint(n)", "#all those moments will be lost in time , like tears in rain\r\nn, k = map(int, input().split())\r\nans = 0\r\nfor i in range(n):\r\n s = input()\r\n for j in range(0, k+1):\r\n if str(j) not in s:\r\n break\r\n else:\r\n ans += 1\r\n \r\nprint(ans)", "n1 = input().split()\r\nn = int(n1[0])\r\nk = int(n1[1])\r\ni = 0\r\nc2 =0\r\nwhile i < n:\r\n num = input()\r\n c1 = 0\r\n for j in range(0,k+1):\r\n if str(j) in (num):\r\n c1 += 1\r\n if c1 == k+1:\r\n c2 += 1\r\n break\r\n i += 1\r\nprint(c2)", "n, k = map(int, input().split()); cnt = 0\r\nfor d in range(n):\r\n f = input()\r\n s = [f.find(str(i)) != -1 for i in range(k + 1)]\r\n if 0 not in s: cnt += 1\r\nprint(cnt)\r\n\r\n\r\n", "#Good number\r\n\r\nn,k=map(int,input().split())\r\ncount=n\r\nb =\"\"\r\nfor i in range(k+1): # this will create a string of second input\r\n#e.g. if k = 6 b will have 0123456\r\n b = b+str(i)\r\n#print(b)\r\nfor i in range(n):\r\n nn=input()\r\n for j in b:\r\n if j not in nn:\r\n count =count - 1\r\n break\r\nprint(count)", "n,k=map(int,input().split())\r\ncount=0\r\nfor i in range(n):\r\n condition=True\r\n a=input()\r\n for j in range(k+1):\r\n if str(j) not in a:\r\n condition=False\r\n if condition:\r\n count+=1\r\nprint(count)", "n, k = map(int,input().split())\r\n\r\nkey = \"\"\r\nfor num in range(0,k+1):\r\n key += str(num)\r\n\r\nans = 0\r\nfor _ in range(n):\r\n line = input()\r\n goodNumber = True\r\n for letter in key:\r\n if letter not in line:\r\n goodNumber = False \r\n \r\n if(goodNumber):\r\n ans += 1\r\n\r\n\r\nprint(ans)", "n,k=map(int,input().split())\r\ncount=n\r\nk_str =\"\"\r\nfor i in range(k+1): # this will create a string of second input\r\n#e.g. if k = 6 b will have 0123456\r\n k_str = k_str+str(i)\r\n#print(k_str)\r\nfor i in range(n):\r\n tc=input()\r\n for j in k_str:\r\n if j not in tc:\r\n count =count - 1\r\n break\r\nprint(count)", "n, k = input().split()\r\nn, k = int(n), int(k)\r\ntotal = 0\r\nfor i in range(n):\r\n a = input()\r\n for i in range(0, k + 1):\r\n if str(i) not in a:\r\n break\r\n if i == k:\r\n total += 1\r\n\r\n\r\n\r\nprint(total)", "n,k=map(int,input().split())\r\ncount=n\r\nk_str=\"\"\r\nfor i in range(k+1):\r\n k_str=k_str+str(i)\r\nfor i in range(n):\r\n nn=input()\r\n for j in k_str:\r\n if j not in nn:\r\n count= count-1\r\n break\r\nprint(count)", "n,k=input().split()\r\ncnt=0\r\nn=int(n)\r\nk=(int)(k)\r\nwhile((int)(n)>0):\r\n n-=1\r\n x=input()\r\n flag=True;\r\n for i in range(0,k+1):\r\n if(x.find((str)(i))==-1): flag=False;\r\n else: continue\r\n\r\n if flag: cnt+=1;\r\nprint(cnt)", "n,k=list(map(int,input().split()))\r\nc=0\r\nl=[j for j in range(0,k+1)]\r\nfor i in range(n):\r\n d=1\r\n a=int(input())\r\n a=str(a)\r\n for x in l:\r\n if str(x) not in a:\r\n d=0\r\n break\r\n if d==1:\r\n c=c+1\r\nprint(c)\r\n", "n,k=list(map(int,input().split()))\r\nlist1=list(range(k+1))\r\na=list1.pop(0)\r\nlist1.append(a)\r\ns=\"\"\r\ncount=0\r\nfor x in list1:\r\n s+=str(x)\r\na=0\r\nfor x in range(n):\r\n s1=input()\r\n for x in s:\r\n if x not in s1:\r\n break\r\n else:\r\n count+=1\r\nprint(count)\r\n", "s=list(map(int,input().split()))\r\nn=0\r\nv=[]\r\nx=0\r\nz=0\r\nfor i in range(s[1]+1):\r\n v+=[str(i)]\r\n n+=1\r\nfor i in range(s[0]):\r\n x=0\r\n b=input()\r\n c=set(sorted(b))\r\n u=c.copy()\r\n for k in u :\r\n if k in v:\r\n x+=1\r\n if x == n :\r\n z+=1\r\nprint(z)\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\nk_digits = set(str(i) for i in range(k + 1))\r\n\r\ncount = 0\r\nfor i in range(n):\r\n digits = set(input().strip())\r\n if k_digits.issubset(digits):\r\n count += 1\r\n\r\nprint(count)", "n, k = list(map(int, input().split()))\r\nc = 0\r\n\r\nfor i in range(n):\r\n yes = 0\r\n come = input()\r\n for i in range(k + 1):\r\n if str(i) in come:\r\n yes += 1\r\n if yes == k + 1:\r\n c += 1\r\nprint(c)\r\n", "n, k = map(int, input().split())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n num = input().strip()\r\n if all(str(digit) in num for digit in range(k+1)):\r\n count += 1\r\n\r\nprint(count)", "a,b=map(int,input().split())\nc=0\nfor i in range(a):\n lst=input()\n my_list=[]\n for ele in lst:\n if ele not in my_list and int(ele)<=b:\n my_list.append(ele)\n if len(my_list)==b+1:\n c+=1\nprint(c)\n\t\t\t\t \t\t \t\t \t\t \t\t \t \t \t\t\t\t\t", "# Define a function that checks if a number is k-good\r\ndef is_k_good(n, k):\r\n # Convert the number to a string\r\n s = str(n)\r\n # Loop through all digits from 0 to k\r\n for d in range(k + 1):\r\n # If the digit is not in the string, return False\r\n if str(d) not in s:\r\n return False\r\n # If all digits are in the string, return True\r\n return True\r\n\r\n# Read n and k from input\r\nn, k = map(int, input().split())\r\n# Initialize a counter for k-good numbers\r\ncount = 0\r\n# Loop through n numbers in the array\r\nfor i in range(n):\r\n # Read a number from input\r\n a = int(input())\r\n # If it is k-good, increment the counter\r\n if is_k_good(a, k):\r\n count += 1\r\n\r\n# Print the final answer\r\nprint(count)", "#one day im gonna in sha allah\r\n\r\ndef main():\r\n\r\n n, k = input().split()\r\n n = int(n)\r\n k = int(k)\r\n li = list()\r\n counter = n\r\n\r\n for i in range(k+1):\r\n li.append(i)\r\n\r\n for i in range(n):\r\n \r\n inp = input()\r\n \r\n for j in range(len(li)):\r\n if(not(inp.__contains__(str(li[j])))):\r\n counter -= 1\r\n break\r\n \r\n print(counter)\r\n \r\nif __name__ == \"__main__\":\r\n main()", "a,b=map(int,input().split())\r\ns=0\r\nfor i in range(a):\r\n count=0\r\n x=input()\r\n for i in range(b+1):\r\n if str(i) in x:\r\n count+=1\r\n if count==b+1:\r\n s+=1\r\nprint(s) ", "n,k=map(int,input().split())\r\na=[]\r\ncount=0\r\nfor i in range(k+1):\r\n a.append(str(i))\r\nfor i in range(n):\r\n y=input()\r\n for i in a:\r\n if i not in y:\r\n count-=1\r\n break\r\nprint(n+count)", "n, k = map(int, input().split())\r\ngood_nums = set(range(k+1))\r\ncount = 0\r\nfor i in range(n):\r\n num = set(map(int, str(input().strip())))\r\n if good_nums.issubset(num):\r\n count += 1\r\nprint(count)", "n , k = list(map(int , input().split()))\r\ncount = 0\r\nfor el in range(n):\r\n s = str(input())\r\n c = 0 \r\n a = []\r\n for i in s :\r\n if(int(i)<=k):\r\n if(i not in a):\r\n c += 1\r\n a.append(i)\r\n if(c == k + 1):\r\n count += 1\r\n\r\nprint(count)", "# -*- coding: utf-8 -*-\n\"\"\"365_A_binuVijayan_OK.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1pBS17NLp-V59ahdNyO_d2EelcnMOWDPj\n\"\"\"\n\n#https://codeforces.com/problemset/problem/365/A (A Good number)\nn,s=map(int,input().split())\nu=0 \nfor i in range(n):\n c=0\n a=input()\n for i in range(s+1):\n if str(i) in a:\n c=c+1\n if c==s+1:\n u=u+1\nprint(u)", "n, k = map(int, input().split())\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n a = set(input())\r\n len_present = len([x for x in range(k + 1) if str(x) in a])\r\n count += 1 if len_present == k + 1 else 0\r\n\r\nprint(count)", "# This is a sample Python script.\r\n\r\n# Press Shift+F10 to execute it or replace it with your code.\r\n# Press Double Shift to search everywhere for classes, files, tool windows, actions, and settings.\r\n\r\nx, y = map(int, input().split())\r\nw=0\r\nre=0\r\nf=-1\r\nss=\"0123456789\"\r\nfor i in range(1,x+1):\r\n s= ( input())\r\n #s.sort()\r\n #l=len(s)\r\n\r\n w=0\r\n\r\n for j in range(0,y+1):\r\n f=s.find(ss[j])\r\n if f!=-1:\r\n \r\n w+=1\r\n f=-1\r\n if w>=y+1 :\r\n re+=1\r\n\r\nprint(re)", "n=input()\r\nl=list(map(int,n.split()))\r\nm=l[0]\r\nk=l[1]\r\nl2=[]\r\nl3=[]\r\nl4=[]\r\nsum=0\r\nfor i in range(k+1):\r\n l3.append(str(i))\r\nz=[]\r\nfor item in l3:\r\n z.append(item)\r\nfor i in range(m):\r\n j=int(input())\r\n u=str(j)\r\n\r\n for ch in u:\r\n l2.append(ch)\r\n for item in l3:\r\n if(item in l2):\r\n sum=sum+1\r\n\r\n if(sum==len(l3)):\r\n l4.append(j)\r\n\r\n l2.clear()\r\n l3.clear()\r\n for ij in z:\r\n l3.append(ij)\r\n sum=0\r\n\r\n\r\nprint(len(l4))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k = map(int,input().split())\r\ncount = 0\r\nl = []\r\nfor j in range(n):\r\n a = input()\r\n for i in range(k+1):\r\n l.append(a.count(str(i)))\r\n for i in l:\r\n if i>0:\r\n bool = True\r\n else:\r\n bool = False\r\n break\r\n if bool:\r\n count+=1\r\n l = []\r\n bool = False\r\nprint(count)", "n, k = map(int,input().split())\r\ncount = 0\r\nfor i in range(n):\r\n num = input()\r\n for i in range(k+1):\r\n if str(i) not in num:\r\n break\r\n else:\r\n count += 1\r\nprint(count)", "n, k = list(map(int, input().split()))\nc = 0\nmapping = set(map(str, range(k+1)))\n \nfor x in range(n):\n z = set(input())\n if mapping.issubset(z):\n c += 1\nprint(c)", "ans=0\r\nj=0\r\n\r\nn, k = map(int, input().split())\r\ns=''\r\nfor h in range(k+1):\r\n s+= str(h)\r\n\r\nfor x in range(n):\r\n y = str(input())\r\n for i in s:\r\n if str(i) in y:\r\n j+=1\r\n if j==len(s):\r\n ans+=1\r\n j=0\r\n\r\nprint(ans)", "n,k = map(int,input().split())\r\nc = 0\r\nd = 0\r\nfor i in range (n):\r\n a = input()\r\n for b in range (k+1):\r\n if str(b) in a:\r\n c = c + 1\r\n if c == k + 1:\r\n d += 1\r\n c = 0\r\nprint(d)", "s=input().split()\r\nn=int(s[0])\r\nk=int(s[1])\r\nsu=0\r\nfor i in range(n):\r\n l=input()\r\n flag=1\r\n if len(l)<k:\r\n continue \r\n for j in range(0,k+1):\r\n if str(j) not in l:\r\n flag=0\r\n break\r\n if flag:\r\n su+=1\r\n\r\nprint(su)\r\n", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\n\r\nn, k = map(lambda v: int(v), input().split())\r\nans = 0\r\n\r\nfor i in range(n):\r\n a = input()\r\n for d in range(k+1):\r\n if a.find(str(d))==-1: break\r\n else: ans+=1\r\n\r\nprint(ans)", "n,k=map(int,input().split())\r\ncount=0\r\nstart=0\r\nr=[]\r\nfor i in range(k+1):\r\n r+=str(i)\r\nif k==0:\r\n start=1\r\nfor i in range(n):\r\n s=input()\r\n l=r.copy()\r\n for i in range(start,len(s)):\r\n if s[i] in l:\r\n l.remove(s[i])\r\n if l==[]:\r\n count+=1\r\nprint(count)", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nc = 0\r\nfor i in range(n):\r\n w = input()[:-1]\r\n d = 0\r\n for i in range(k+1):\r\n if str(i) in w:\r\n d += 1\r\n if d == k + 1:\r\n c += 1\r\nprint(c)\r\n", "t,k=map(int,input().split())\r\n#t=testcases,k=Good numbers\r\na=''\r\nfor i in range(k+1):\r\n a+=str(i)\r\ncount='c'\r\nc=0\r\nfor _ in range(t):\r\n b=0\r\n n=input()\r\n for i in a:\r\n if i in n:\r\n b+=1\r\n if b==k+1:\r\n c+=1\r\n#print the k-goodnumbers\r\nprint(c)", "n,k=map(int,input().split())\r\np=0\r\nfor i in range(n):\r\n count=0\r\n a=list(map(int,input()))\r\n for i in range(k+1):\r\n if i in a:\r\n count=count+1\r\n if count==k+1:\r\n p=p+1\r\nprint(p)", "n,k=map(int,input().split())\r\ndigits=\"\"\r\nans=0\r\nfor i in range(k+1):\r\n digits+=str(i)\r\nfor i in range(n):\r\n a=int(input())\r\n a=str(a)\r\n c=0\r\n for thing in digits:\r\n if thing in a:\r\n c+=1\r\n if(c<=len(a) and c>=len(digits)):\r\n ans+=1\r\nprint(ans)", "n, k = map(int, input().split())\r\ncount = 0\r\nfor i in range(n):\r\n no = 1\r\n num = input()\r\n for n in range(k + 1):\r\n if num.find(str(n)) == -1: no = 0; break\r\n if no == 1: count += 1\r\nprint(count)\r\n", "line = input().split()\nline = [int(i) for i in line]\n\nn = line[0]\nk = line[1]\n\ncount_good_num = 0\nfor _ in range(n):\n\n num = input()\n if '0' not in num:\n continue\n\n \n num = [int(i) for i in num]\n\n error = True\n for i in range(1,k+1):\n if i in num:\n num.remove(i)\n else:\n error=False\n \n \n if error:\n count_good_num+=1\n\n\nprint(count_good_num)", "a,b=map(int,input().split())\r\nk=0\r\nfor i in range(a):\r\n c=0\r\n x=input()\r\n for i in range(b+1):\r\n if str(i) in x:\r\n c=c+1\r\n if c==b+1:\r\n k=k+1\r\nprint(k)\r\n", "def solve():\r\n cnt=0\r\n for i in range(n):\r\n ok=0\r\n for j in range(len(a[i])):\r\n if a[i][j]<=k:ok+=1\r\n if ok==k+1:cnt+=1\r\n print(cnt)\r\n\r\nif __name__ == '__main__':\r\n n,k=map(int,input().split())\r\n a=[list(set([int(x)for x in input()]))for i in range(n)]\r\n solve()", "n, k = map(int, input().split())\r\ns = set('0123456789'[ : k + 1])\r\nprint(sum(set(input()) >= s for _ in range(n)))", "n,k=map(int,input().split())\r\nx=0\r\nfor i in range(n):\r\n c=0\r\n t=input()\r\n for i in range(k+1):\r\n if str(i) in t:\r\n c=c+1\r\n if c==k+1:\r\n x=x+1\r\nprint(x)\r\n", "#class bebo : \r\n # def __init__(self) :\r\n # print(\"baraa1\")\r\n\r\n#class bebo2 : \r\n # def __init__(self):\r\n # print(\"baraa2\")\r\n\r\n#class bebo3(bebo2,bebo) : \r\n # def __init__(self):\r\n # super().__init__()\r\n\r\n#div = bebo3()\r\n#x,y=input().split()\r\n#x=int(x)\r\n#y=int(y)\r\n#cont=0\r\n#b=True\r\n#for i in range(x):\r\n #c = input()\r\n #for j in range(y+1):\r\n # if c.__contains__(str(j)):\r\n # pass\r\n # else : b=False\r\n # if b:\r\n # cont+=1\r\n # b=True\r\n#print(cont)\r\n\r\nn,k = input().split()\r\nn,k=int(n),int(k)\r\na = []\r\ncont=0\r\nfor i in range(k + 1):\r\n a.append(str(i))\r\na = ''.join(a)\r\nfor i in range(n):\r\n str=input()\r\n for j in range(len(a)):\r\n if str.find(a[j])==-1: \r\n break\r\n if j==len(a)-1:\r\n cont+=1\r\n \r\nprint(cont)\r\n", "n,k=map(int,input().split())\r\ncount=0\r\nl1=[]\r\nl2=[]\r\nfor i in range(n):\r\n a=input()\r\n l1.append(a)\r\nfor i in range(k+1):\r\n l2.append(str(i))\r\nfor i in l1:\r\n m=0\r\n for j in range(len(l2)):\r\n if l2[j] not in i:\r\n m=1\r\n if m!=1:\r\n count+=1\r\nprint(count)", "n,m=map(int,input().split())\r\nd=0\r\nfor i in range(n):\r\n a=input()\r\n c=0\r\n for i in range(m+1):\r\n if str(i) not in a:\r\n c=c+1\r\n if c>0:\r\n d=d+1\r\nprint(n-d)", "temp = [int(x) for x in input().split()]\r\nanswer = 0\r\nfor _ in range(temp[0]):\r\n x = set([int(x) for x in input()])\r\n for i in range(11):\r\n if i in x:\r\n pass\r\n else:\r\n if i > temp[1]:\r\n answer += 1\r\n break\r\nprint(answer)\r\n ", "n,k=map(int, input().split())\r\ncnt=0\r\nfor i in range(n):\r\n x=input()\r\n flag=True\r\n for i in range(k+1):\r\n if(str(i) not in x):\r\n flag=False\r\n if(flag):\r\n cnt+=1\r\nprint(cnt)\r\n", "n,k=map(int,input().split())\r\nc=0\r\ns=list(range(0,k+1))\r\nfor i in range(n): \r\n l=list(map(int,input()))\r\n nums=[]\r\n tem=list(sorted(list(set (l)))) \r\n if k!=0: \r\n nums=tem[0:len(s)]\r\n else:\r\n if s[0] in l:\r\n if l[0]!=0:\r\n c=c+1\r\n continue \r\n elif l[0]==0 and l.count(0)>1:\r\n c=c+1\r\n continue\r\n else:\r\n continue\r\n if s==nums: \r\n c=c+1\r\nprint(c)", "def check(a, k):\r\n used = [False for i in range(10)]\r\n while a != 0:\r\n used[a % 10] = True\r\n a //= 10\r\n return sum(used[:k + 1]) == k + 1\r\n \r\nn, k = map(int, input().split())\r\ncnt = 0\r\nfor i in range(n):\r\n a = int(input())\r\n if check(a, k):\r\n cnt += 1\r\nprint(cnt)\r\n", "def func(x) :\r\n count = 0\r\n for i in range(k+1) :\r\n if str(i) in x :\r\n count += 1\r\n if count == k+1 :\r\n return 1\r\n else :\r\n return 0\r\nn,k = map(int,input().split())\r\nlst = []\r\nfor i in range(n) :\r\n x = input()\r\n lst.append(func(x))\r\nprint(sum(lst))", "def exits(x,k):\r\n alpha = range(0, k+1)\r\n for i in alpha:\r\n if str(i) not in str(x):\r\n return False\r\n return True\r\n\r\ndef main():\r\n #inputs\r\n lst = input().split(' ')\r\n n = int(lst[0])\r\n k = int(lst[1])\r\n X= []\r\n counter = 0\r\n for i in range(0, n):\r\n X.append(int(input()))\r\n\r\n for i in X:\r\n if exits(i,k):\r\n counter += 1\r\n print(counter)\r\n\r\nmain()", "\r\nn, k = list(map(int, input().split(\" \")))\r\n\r\nt = n\r\ncount = 0\r\n\r\nwhile t > 0:\r\n t -= 1\r\n num = input()\r\n l = []\r\n l[:0] = num\r\n l = set(l)\r\n l = list(l)\r\n look = False\r\n for i in range(k + 1):\r\n if str(i) not in l:\r\n look = True\r\n break\r\n if not look:\r\n count += 1\r\nprint(count)", "from collections import defaultdict\nn, k = map(int, input().split())\nans = 0\nfor I in range(n):\n occur, valid = defaultdict(bool), True\n s = input()\n for i in s: occur[int(i)] = True\n for i in range(k + 1):\n if not occur[i]: valid = False; break\n ans += valid\nprint(ans)", "n, k = map(int, input().split())\r\nr = 0\r\nwhile n:\r\n a = input()\r\n r += all(a.count(str(i)) for i in range(k+1))\r\n n -= 1\r\nprint(r)", "n,k=map(int,input().split())\r\nlist1=[]\r\nlist2=[]\r\ncount=0\r\nfor i in range(n):\r\n a=input()\r\n list1.append(a)\r\nfor i in range(k+1):\r\n list2.append(str(i))\r\nfor i in list1:\r\n b=0\r\n for j in range(len(list2)):\r\n if list2[j] not in i:\r\n b=1\r\n if b!=1:\r\n count+=1\r\nprint(count)", "n,k = map(int,input().split())\r\nx = 0\r\nfor i in range(n):\r\n count = 0\r\n t = input()\r\n for i in range(k+1):\r\n if str(i) in t:\r\n count+=1\r\n if count == k+1:\r\n x+=1\r\nprint(x)", "n ,k = map(int, input().split())\r\nc=0\r\nfor i in range(n):\r\n s=0\r\n a=list(map(int ,input()))\r\n for i in range(k+1):\r\n if i in a:\r\n s+=1\r\n if s==k+1:\r\n c +=1\r\nprint(c)", "count = 0\r\ncount2 = 0\r\nn = list(map(int, input().split()))\r\nfor i in range(0, n[0]):\r\n y = list(set(sorted(list(map(int, input())))))\r\n for j in range(0, len(y)):\r\n if y[j] <= n[1]:\r\n count2 += 1\r\n if count2 == (n[1]+1):\r\n count += 1\r\n count2 = 0\r\nprint(count)", "n,m=map(int, input().split())\ns = set('0123456789'[:m+1])\nprint(sum(set(input()) >= s for _ in range(n)))\n\t \t \t \t\t\t\t \t\t\t\t \t\t \t\t\t\t\t\t\t\t\t", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n x=0\r\n l=list(map(int,input()))\r\n for j in range(k+1):\r\n if j in l:\r\n x+=1\r\n if x==k+1:\r\n c+=1\r\nprint(c)\r\n", "t,n=map(int,input().split());c=0\r\nfor i in range(t):\r\n\ta=input()\r\n\tfor j in range(n+1):\r\n\t\tif str(j) not in a:break\r\n\telse:c+=1\r\nprint(c)", "range1,k = list(map(int,input().split()))\r\ngood_number = 0\r\nfor i in range(range1):\r\n c = True\r\n l=0\r\n num = input()\r\n for i in range(k+1):\r\n if str(i) in num:\r\n l +=1\r\n c = True\r\n else:\r\n c=False\r\n if c and l == k+1:\r\n good_number+=1\r\nprint(good_number)", "n,k = map(int,input().split(' '))\r\ncount = 0\r\nfor i in range(n):\r\n st = input()\r\n res = True\r\n for j in range(0,k+1):\r\n if not st.__contains__(str(j)):\r\n res=False\r\n break\r\n if res: count+=1\r\nprint (count)", "n,k= map(int, input().split())\r\ns=0\r\nfor i in range(n):\r\n count=0\r\n t=input()\r\n for i in range(k+1):\r\n if str(i) in t:\r\n count=count+1\r\n if (count==k+1):\r\n s=s+1\r\nprint(s)", "\r\nret =-1\r\nss=\"0123456789\"\r\ncount1=0;count2=0 \r\ns = str()\r\n \r\n(n, k) = tuple(map(int, input().split()))\r\n \r\n \r\nwhile n != 0:\r\n\r\n s = input()\r\n for i in range(0, k + 1):\r\n ret=s.find(ss[i])\t\r\n if ret != -1 :\r\n count1+= 1\r\n ret= -1\r\n\t\t\t\t\r\n\t\t\t\r\n if count1>=k+1 :\r\n count2+= 1\r\n \r\n count1=0\r\n n -= 1\r\n \r\n\t\t\r\n\r\n \r\nprint(count2)", "n,k=map(int,input().split())\r\na=0\r\nfor i in range(n):\r\n c=0\r\n t=input()\r\n for i in range(k+1):\r\n if str(i) in t:\r\n c+=1\r\n if c==k+1:\r\n a+=1\r\nprint(a)", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n s=0\r\n a=list(map(int,input()))\r\n for i in range(k+1):\r\n if i in a:\r\n s+=1\r\n if s==k+1:\r\n c+=1\r\nprint(c)", "n,k=input().split()\r\nc=0\r\nf=0\r\nl=[]\r\nfor j in range(int(k)+1):\r\n l.append(j)\r\nfor i in range(int(n)):\r\n s=int(input())\r\n while s>0:\r\n a=s%10\r\n b=s//10\r\n if a in l and str(a) not in str(b):\r\n c+=1\r\n \r\n s//=10\r\n \r\n if c==len(l):\r\n f+=1\r\n \r\n c=0\r\nprint(f)", "a, b = map(int, input().split())\r\nc = a\r\nfor i in range(a):\r\n l = list(map(int, input().strip()))\r\n req = []\r\n for x in range(b + 1):\r\n if x not in l:\r\n c -= 1\r\n break\r\nprint(c)", "import math\r\nimport sys\r\n#!pip install numpy\r\n\r\n#import numpy as np \r\nres=list(input().split())\r\n\r\n\r\n# print(p,p1,p2)\r\n#print(math.ceil(int(res[0])/int(res[2]))*math.ceil(int(res[1])/int(res[2])))\r\n#print ((8**res)-int((8**res)/10)*10)\r\n# if(res==0):\r\n# print(1) \r\n# elif(res%4==0):\r\n# print(6)\r\n# else:\r\n# print ((8**(res%4))%10)\r\n\r\n#count1 = str1.count(substr)\r\n\r\n#print(*(res.replace(\"WUB\",\" \").split()))\r\ng=49\r\n#rt=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n#print(res2[1:].count(\"10\"))\r\na=[]\r\n#b=[]\r\ntar=0\r\nts=0\r\nc=0\r\nfor i in range(int(res[0])):\r\n v=input()\r\n for m in range(int(res[1])+1):\r\n if (v.find(chr(m+48))>=0):\r\n f=1\r\n else:\r\n f=0\r\n break\r\n \r\n if(f):\r\n c=c+1\r\nprint(c)", "d = list(map(int, input().split()))\r\nans = 0\r\nfor _ in range(d[0]):\r\n s = list(input())\r\n s = [int(i) for i in s]\r\n k = 0\r\n if d[1] != 0:\r\n for i in range(d[1]+1):\r\n if i in s:\r\n k += 1\r\n if k == d[1]+1:\r\n ans += 1\r\n else:\r\n if 0 in s:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n x=list(input())\r\n d=0\r\n for i in range(k+1):\r\n if str(i) in x:\r\n d+=1\r\n if d==k+1:\r\n c+=1\r\nprint(c)", "a,b=map(int,input().split())\r\nf=0\r\nq=[]\r\nfor i in range(b+1):\r\n q.append(i)\r\n\r\nfor i in range(a):\r\n x=list(map(int,input()))\r\n if all(num in x for num in q):\r\n f+=1\r\nprint(f)\r\n", "n,k=map(int,input().split())\r\nx=0\r\nfor i in range(n):\r\n a=input()\r\n y=0\r\n for j in range(k+1):\r\n if str(j) in a:\r\n y=y+1\r\n if y==(k+1):\r\n x=x+1\r\nprint(x)", "n, k = map(int, input().split())\r\nres = 0\r\nfor i in range(n):\r\n r = 0\r\n s = str(input())\r\n for i in range(k+1):\r\n if str(i) in s:\r\n r += 1\r\n if r == k + 1:\r\n res += 1\r\nprint(res)", "n, k = [int(item) for item in input().split()]\r\na = [str(i) for i in range(k + 1)]\r\ntemp = 0\r\nfor i in range(n):\r\n x = list(input())\r\n y = list(set(a) & set(x))\r\n if sorted(a) == sorted(y):\r\n temp += 1\r\nprint(temp)\r\n", "n,k = map(int,input().split());l=0\r\nra=set(map(str,list(range(k+1))))\r\nfor i in range(n):\r\n if set(input())&ra ==ra:l+=1\r\nprint(l)", "n,k=map(int, input().split())\r\nka=[i for i in range(k+1)]\r\ncount=n\r\n\r\nfor i in range(n):\r\n a=input()\r\n for j in range(len(ka)):\r\n if str(ka[j]) not in a:\r\n count = count-1\r\n break\r\nprint(count)", "t,k=map(int,input().split())\r\nr=''\r\nfor i in range(k+1):\r\n r+=str(i)\r\nc=0\r\n\r\nfor _ in range(t):\r\n d=0\r\n n=input()\r\n for i in r:\r\n if i in n:\r\n d+=1\r\n if d==k+1:\r\n c+=1\r\nprint(c)", "n,k = map(int, input().split())\r\ncount = 0\r\nstart = 0\r\nreflist = []\r\nfor i in range (k+1):\r\n reflist += str(i)\r\nif k == 0:\r\n start = 1\r\nfor i in range (n):\r\n s = input()\r\n l = reflist.copy()\r\n for i in range (start, len(s)):\r\n if s[i] in l:\r\n l.remove (s[i])\r\n if l == []:\r\n count += 1\r\nprint (count)", "# LUOGU_RID: 127949178\nn,k=map(int,input().split())\r\ns=0\r\nfor i in range(n):\r\n\ta=input()\r\n\tfor j in range(k+1):\r\n\t\tif str(j) not in a:\r\n\t\t\ts-=1\r\n\t\t\tbreak\r\n\ts+=1\r\nprint(s)\r\n", "n,k=list(map(int,input().split()))\r\nd=0\r\nfor i in range(n):\r\n c=0\r\n a=input()\r\n for j in range(k+1):\r\n if str(j) in a:\r\n c+=1\r\n if c==k+1:\r\n d+=1\r\nprint(d)", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n\ta=input()\r\n\tfor j in range(k+1):\r\n\t\tif str(j) not in a:\r\n\t\t break\r\n\telse:\r\n\t c+=1\r\nprint(c)", "x,z=map(int,input().split())\r\nl=[]\r\nm=0\r\n\r\nfor i in range(z+1):\r\n l.append(i)\r\nfor i in range(x):\r\n c=0\r\n w=input()\r\n for j in l:\r\n if str(j) in w:\r\n c+=1\r\n if c == z + 1:\r\n m += 1\r\n\r\n\r\nprint(m)\r\n", "n,k= map(int,input().split())\r\nr = 0\r\n\r\nfor i in range(n):\r\n a = input()\r\n r+=all(a.count(str(j))for j in range(k+1))\r\n n-=1\r\nprint(r)", "t,l=map(int, input().split())\r\ns=0\r\nfor i in range(t):\r\n a=input()\r\n list=[]\r\n for i in a:\r\n list.append(int(i))\r\n pure=[]\r\n for i in list:\r\n if i not in pure:\r\n pure.append(i)\r\n q=0\r\n for v in pure:\r\n if v in range(l+1):\r\n q+=1\r\n if q==l+1:\r\n s+=1\r\n q=0\r\nprint (s)", "a,b=map(int,input().split())\r\nm=0\r\nfor i in range(a):\r\n c=[]\r\n l=list(map(int,input()))\r\n n=[]\r\n for j in range(len(l)):\r\n if l[j]<=b:\r\n n=n+[l[j]]\r\n n.sort()\r\n if n!=[]: \r\n for k in range(len(n)):\r\n if n[k]!=n[k-1]:\r\n c=c+[n[k]]\r\n if c==[]:\r\n c=[n[0]]\r\n if len(c)>=b+1:\r\n m=m+1\r\nprint(m) ", "n,k = map(int, input().split())\r\n\r\nl = set(range(k+1))\r\n\r\nans = 0\r\nfor i in range(n):\r\n t = map(int,list(input()))\r\n ans += len(set(t).intersection(l)) == k + 1\r\n\r\nprint(ans)", "n,s=map(int,input().split())\r\ntemp=0\r\nfor i in range(n):\r\n count=0\r\n a=list(map(int,input()))\r\n for i in range(s+1):\r\n if i in a:\r\n count=count+1\r\n if count==s+1:\r\n temp=temp+1\r\nprint(temp)", "ret=-1\r\nss=\"0123456789\"\r\nn,k=map(int, input().split())\r\ncount1=0\r\ncount2=0\r\nwhile n:\r\n s=input()\r\n for i in range(0,k+1):\r\n ret=s.find(ss[i])\r\n if ret!=-1:\r\n count1+=1\r\n ret=-1\r\n if count1>=k+1:\r\n count2+=1\r\n count1=0\r\n n-=1\r\nprint(count2)", "c=0 ; d = {}\r\nx,y=map(int, input().split())\r\nfor i in range(x):\r\n z=input()\r\n if z not in d.keys():\r\n for i in range(y+1):\r\n if str(i) not in z:\r\n d[z] = 0\r\n break\r\n else:\r\n c+=1\r\n d[z] = 1\r\n else:\r\n c+=d[z]\r\n \r\nprint(c)", "n, k = map(int, input().split())\r\n\r\ncount = 0\r\nfor i in range(n):\r\n num = str(input())\r\n if all(str(digit) in num for digit in range(k+1)):\r\n count += 1\r\n\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\nnum=\"\"\r\ncount=0\r\nfor i in range(k+1):\r\n num+=str(i)\r\nfor i in range(n):\r\n a=str(int(input()))\r\n c=0\r\n for thing in num:\r\n if thing not in a:\r\n c+=1\r\n if c==0:\r\n count+=1\r\nprint(count)", "n,k=map(int,input().split())\nventilator=0\nfor i in range(n):\n alarmstufe_rot=False\n a=input()\n for j in range(k+1):\n if str(j) not in a:\n alarmstufe_rot=True\n if alarmstufe_rot==False:\n ventilator+=1\nprint(ventilator)\n \t \t \t \t\t\t\t\t \t \t \t\t \t", "n,k=map(int,input().split())\r\nx=0\r\nfor i in range(n):\r\n count=0\r\n t=input()\r\n for i in range(k+1):\r\n if str(i) in t:\r\n count+=1\r\n if count==k+1:\r\n x+=1\r\nprint(x)", "n,k=map(int,input().split())\r\na=0\r\nfor i in range(n):\r\n x=input()\r\n b=1\r\n x=list(x)\r\n x.sort()\r\n c=0\r\n for i in x:\r\n if int(i)==c:\r\n c=c+1\r\n if c>k:\r\n a=a+1\r\nprint(a)", "def check(str1,key) :\r\n temp=1\r\n for i in range(0,int(key)+1) :\r\n if str1.count(str(i))==0 :\r\n temp=0\r\n break\r\n if temp==1 :\r\n return True\r\n else :\r\n return False\r\n \r\nnum1,key=input().split()\r\nnum1=int(num1)\r\ncount=0\r\nfor i in range(num1) :\r\n temp=input()\r\n if check(temp,key)==True :\r\n count=count+1\r\nprint(count)", "n, k = map(int, input().split())\r\ncount = n\r\nfor i in range(n):\r\n inp = input()\r\n for j in range(k+1):\r\n if str(j) not in inp :\r\n count -= 1\r\n break\r\nprint(count)", "import sys\r\ndef input():\r\n return sys.stdin.readline()\r\n\r\nn,x = list(map(int,input().split()))\r\ncounter = 0\r\nfor i in range(n):\r\n z = \"\".join(sorted(list(set(input()))))\r\n if \"\".join(list(map(str,list(range(x+1))))) in z:\r\n counter += 1\r\nprint(counter)\r\n", "n,k=list(map(int,input().split()))\r\ndef check(st,k):\r\n for i in range(k+1):\r\n if str(i) not in st :return False\r\n return True\r\nsum=0\r\nfor i in range(n):\r\n\r\n st=input()\r\n \r\n if check(st,k):sum+=1\r\nprint(sum)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Dec 4 20:12:55 2021\r\n\r\n@author: Anshu\r\n\"\"\"\r\n\r\nn,k=map(int,input().split())\r\nl=[]\r\nl1=[]\r\ncount2=0\r\nfor i in range (n):\r\n a=input()\r\n l.append(a)\r\nfor j in range(k+1):\r\n l1.append(str(j))\r\nfor m in l:\r\n count=0\r\n for n in range(len(l1)):\r\n if l1[n] in m:\r\n count=count+1\r\n if count==len(l1):\r\n count2=count2+1\r\nprint(count2)\r\n ", "a,b=map(int,input().split())\r\ntemp=0\r\nfor i in range(a):\r\n count=0\r\n x=list(map(int,input()))\r\n for i in range(b+1):\r\n if i in x:\r\n count=count+1\r\n if count==b+1:\r\n temp=temp+1\r\nprint(temp)", "# Wadea #\r\n \r\ns = input().split()\r\na = int(s[0])\r\nb = int(s[1])\r\nr = \"\"\r\nfor k in range(b,-1,-1):\r\n r += str(k)\r\nt = b+1\r\np = 0\r\nq = 0\r\nm = 0\r\nlst = list(r)\r\nlst2 = []\r\nfor i in range(a):\r\n s = str(input())\r\n for k in s:\r\n lst2.append(k)\r\n for j in lst:\r\n if j in lst2:\r\n p += 1\r\n else:\r\n q += 1\r\n lst2.clear()\r\n if p == t:\r\n m += 1\r\n p = 0\r\n else:\r\n p = 0\r\n pass\r\nprint(m)\r\n", "n, k = map(int,input().split())\r\na = 0\r\nx = set()\r\nfor r in range(k + 1):\r\n x.add(r)\r\nfor r in range(n):\r\n y = input()\r\n z = set()\r\n for r in range(len(y)):\r\n z.add(int(y[r]))\r\n if x.issubset(z) == True:\r\n a = a + 1\r\nprint(a)", "n,k=map(int,input().split())\r\ncount=0\r\nx=''\r\nfor i in range(k+1):\r\n x+=str(i)\r\nfor i in range(n):\r\n c=0\r\n a=input()\r\n for i in x:\r\n if i in a:\r\n c+=1\r\n if c==k+1:\r\n count+=1\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\ns = 0\r\nfor i in range(n):\r\n a = set(str(int(input())))\r\n kac = [False for i in range(k+1)]\r\n for x in a:\r\n if int(x) <= k:\r\n kac[int(x)] = True\r\n if False not in kac:\r\n s += 1\r\nprint(s)\r\n", "n,m=map(int,input().split())\r\na=0\r\nfor i in range(n):\r\n b=input()\r\n c=0\r\n for k in range(m+1):\r\n if str(k) in b:\r\n c=c+1\r\n if c==m+1:\r\n a=a+1\r\nprint(a)", "n,k = [int(i) for i in input().split()]\r\nr = n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(0,k+1):\r\n if str(j) not in s:\r\n r -=1\r\n break\r\nprint(r)", "l = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(l[0]):\r\n t = input()\r\n t_i = map(int,t)\r\n t_l = list(t_i)\r\n n = len(t_l)\r\n m = []\r\n for j in range(n): \r\n if t_l[j] <= l[1] and t_l[j] not in m:\r\n m.append(t_l[j])\r\n s = len(m)\r\n if s == l[1] + 1 :\r\n count += 1\r\nprint(count)", "x, y= map(int, input().split())\r\na = 0\r\nfor i in range(x):\r\n b = 0\r\n l = list(map(int, input()))\r\n for j in range(y+1):\r\n if j in l:\r\n b=b+1\r\n if b == y + 1:\r\n a=a+1\r\nprint(a)", "x=input().split()\r\nnumb=int(x[1])\r\ncount=0\r\n\r\nfor i in range(int(x[0])):\r\n n=input()\r\n check=[]\r\n for z in n:\r\n h=int(z)\r\n if h<=numb and not(h in check):\r\n check.append(h)\r\n\r\n if len(check) == numb+1:\r\n count+=1\r\n \r\n \r\nprint(count)\r\n", "ans=0\nj=0\n\nn, k = map(int, input().split())\ns=''\nfor h in range(k+1):\n s+= str(h)\n\nfor x in range(n):\n y = str(input())\n for i in s:\n if str(i) in y:\n j+=1\n if j==len(s):\n ans+=1\n j=0\n\nprint(ans)\n \t \t \t\t \t \t \t \t \t \t \t\t\t", "n,m = map(int,input().split())\r\ncount=0\r\nfor i in range(n):\r\n b = input()\r\n a=[]\r\n x=0\r\n for i in range(len(b)):\r\n a.append(int(b[i]))\r\n for j in range(m+1):\r\n if j not in a:\r\n x=1\r\n break\r\n if x==0:\r\n count+=1\r\nprint(count)\r\n \r\n", "n,k=map(int,input().split())\r\nNb=0\r\nfor _ in range(n):\r\n m=0\r\n a=int(input())\r\n ch=str(a)\r\n while True:\r\n if str(m) in ch:\r\n m+=1\r\n if str(m) not in ch or m>k:\r\n break\r\n if m>k:\r\n Nb+=1\r\nprint(Nb)", "f=list(map(int,input().split()))\r\nd=0\r\nfor i in range(f[0]):\r\n t=input()\r\n ti=map(int,t)\r\n tf=list(ti)\r\n x=len(tf)\r\n m=[]\r\n for j in range(x):\r\n if tf[j]<=f[1] and tf[j] not in m:\r\n m.append(tf[j])\r\n v=len(m)\r\n if v==f[1]+1:\r\n d=d+1\r\nprint(d)", "n, k = map(int, input().split())\r\nans = 0\r\nfor i in range(n):\r\n str_num = input()\r\n count = 0\r\n for j in range(k+1):\r\n if str(j) in str_num:\r\n count += 1\r\n if count == k+1:\r\n ans += 1\r\nprint(ans)\r\n", "s = input()\r\nl = s.split()\r\nt = int(l[0])\r\nk = int(l[1])\r\nr = 0\r\nfor i in range(t):\r\n num = str(input())\r\n cont = 0\r\n for j in range(0,k+1,1):\r\n if str(j) in num :\r\n cont += 1\r\n if cont == k+1 :\r\n r += 1\r\nprint(r)\r\n\r\n\r\n\r\n\r\n", "a,b=map(int,input().split())\r\nc=0\r\nfor i in range(a):\r\n d=0\r\n l=list(map(int,input()))\r\n for j in range(b+1):\r\n if j in l:\r\n d+=1\r\n if d==b+1:\r\n c+=1\r\nprint(c) ", "n,k = map(int,input().split())\r\ngn=0\r\nfor i in range(n):\r\n al = []\r\n a=input()\r\n c=0\r\n x=len(a)\r\n for j in range(x):\r\n al.append(int(a[j]))\r\n for x in range(k+1):\r\n if x in al:\r\n c+=1\r\n if c == k+1:\r\n gn+=1\r\nprint(gn)", "n,k = map(int,input().split())\r\ncount = 0\r\nfor j in range(n):\r\n a = input()\r\n count+= all(a.count(str(i)) for i in range(k+1))\r\nprint(count)", "from math import *\r\ndef solution(n, k):\r\n llist = []\r\n for i in range(int(log10(n)) +1):\r\n llist.append(n % 10)\r\n n = int(n / 10)\r\n\r\n if len(llist) <= k:\r\n return False\r\n else:\r\n for i in range(k+1):\r\n if i not in llist:\r\n return False\r\n return True\r\n\r\nss = input().split()\r\n\r\nt = int(ss[0])\r\nk = int(ss[1])\r\nc = 0\r\nfor i in range(t):\r\n temp = int(input())\r\n if solution(temp, k):\r\n c = c + 1\r\n\r\nprint(c)", "x=list(map(int,input().split()))\r\nm=0\r\nfor i in range(x[0]):\r\n a=input()\r\n for j in range(0,(x[1]+1)):\r\n if str(j) in a:\r\n k=1\r\n else:\r\n k=0\r\n break\r\n if k==1:\r\n m=m+1\r\nprint(m)", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range (n):\r\n a = input()\r\n z = 0\r\n for j in range (k+1):\r\n if str(j) in a:\r\n z = z+1\r\n if z == k+1:\r\n c=c+1\r\nprint(c)", "n,s=map(int,input().split())\r\nt=0\r\nfor i in range(n):\r\n c=0\r\n a=list(map(int,input()))\r\n for i in range(s+1):\r\n if i in a:\r\n c+=1\r\n if c==s+1:\r\n t+=1\r\nprint(t)", "#class bebo : \r\n # def __init__(self) :\r\n # print(\"baraa1\")\r\n\r\n#class bebo2 : \r\n # def __init__(self):\r\n # print(\"baraa2\")\r\n\r\n#class bebo3(bebo2,bebo) : \r\n # def __init__(self):\r\n # super().__init__()\r\n\r\n#div = bebo3()\r\nx,y=input().split()\r\nx=int(x)\r\ny=int(y)\r\ncont=0\r\nb=True\r\nfor i in range(x):\r\n c = input()\r\n for j in range(y+1):\r\n if c.__contains__(str(j)):\r\n pass\r\n else : b=False\r\n if b:\r\n cont+=1\r\n b=True\r\nprint(cont)\r\n", "z = input().split(\" \")\r\nn = int(z[0])\r\nk = int(z[1])\r\ncount = 0\r\ny = False\r\nfor i in range(n):\r\n s = input()\r\n if len(s) >= k + 1:\r\n for j in range(k + 1):\r\n if str(j) not in s:\r\n y = False\r\n break\r\n else:\r\n y = True\r\n if y:\r\n count += 1\r\n\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\nans = 0\r\nfor i in range(n):\r\n s = input()\r\n count = 0\r\n for x in range(k+1):\r\n if str(x) in s:\r\n count += 1\r\n if count == k+1:\r\n ans += 1\r\nprint(ans)", "n,k=map(int, input().split())\r\nk_1=[i for i in range(k+1)]\r\ncount=n\r\nfor i in range(n):\r\n a=input()\r\n for j in range(len(k_1)):\r\n if str(k_1[j]) not in a:\r\n count = count-1\r\n break\r\nprint(count)\r\n", "def solve(n,k,a):\r\n count = 0\r\n for num in a:\r\n nc = False\r\n for i in range(0,k+1):\r\n if(str(i) not in num):\r\n nc = True\r\n break\r\n if(not nc):\r\n count += 1\r\n\r\n return count\r\n\r\nif __name__ == \"__main__\":\r\n n,k = map(int,input().split(\" \"))\r\n t = 0\r\n a = list()\r\n while(t < n):\r\n a.append(input())\r\n t +=1\r\n\r\n final=solve(n,k,a)\r\n print(final)", "n,k=map(int, input().split())\r\ns = set('0123456789'[:k+1])\r\nprint(sum(set(input()) >= s for _ in range(n)))", "n, k = map(int, input().split())\r\na = 0\r\nfor i in range(n):\r\n b = 0\r\n list1 = list(map(int, input()))\r\n for j in range(k+1):\r\n if j in list1:\r\n b += 1\r\n if b == k + 1:\r\n a += 1\r\nprint(a)", "a,b = list((input().split(' ')))\r\na,b = int(a),int(b)\r\nams = 0\r\nfor ii in range(0,a):\r\n r = list((input()))\r\n list.sort(r)\r\n ch = list(range(0, b+1))\r\n for i in ch:\r\n if r.__contains__(str(i)) == False:\r\n break\r\n if (i==b): ams+=1\r\nprint(ams)", "import sys\r\n\r\ndef dbg(x):\r\n # sys.stderr.write(x)\r\n print(x, file=sys.stderr)\r\n\r\n\r\ndef solve(test_case):\r\n n, k = map(int, input().split())\r\n ans = 0\r\n for _ in range(n):\r\n s = {x for x in input() if int(x) <= k}\r\n ans += 1 if len(s) == k + 1 else 0\r\n \r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n T = 1\r\n # T = int(input())\r\n for t in range(T):\r\n solve(t)\r\n", "x , y = input().split()\r\nz = \"\"\r\nfor i in range(0 , 10):\r\n z = z + f\"{i}\"\r\nz = list(z)\r\nstrings = []\r\ncounter = 0\r\nfor i in range(int(x)):\r\n string = input()\r\n \r\n \r\n string = list(set(string))\r\n string = sorted(string)\r\n strings.append(string)\r\n \r\n\r\n\r\nfor i in strings:\r\n ff = i[:1:]\r\n ffz = z[:1:]\r\n\r\n if(i[:int(y)+1:] == z[:int(y)+1:] ):\r\n counter = counter + 1\r\nprint(counter)\r\n ", "from sys import stdin, stdout\r\n#from bisect import bisect_left, bisect_right\r\n#from collections import Counter, deque\r\n#from queue import Queue\r\n#import heapq\r\n#import math\r\n#from itertools import permutations, combinations, islice\r\n\r\ndef input():\r\n return stdin.readline().strip()\r\n\r\ndef solve():\r\n n,k = map(int, input().split())\r\n s = ''\r\n ans = 0\r\n for i in range(k+1):\r\n s += str(i)\r\n\r\n for i in range(n):\r\n a = input()\r\n for j in s:\r\n if j not in a:\r\n break\r\n else:\r\n ans += 1\r\n return f\"{ans}\"\r\n\r\ndef main():\r\n stdout.write(solve())\r\n\r\nmain()", "#K-good number\r\n\r\nn, k = map(int, input().split())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n num = str(input())\r\n if set(num) >= set(str(j) for j in range(k+1)):\r\n count += 1\r\n\r\nprint(count)", "n, k = map(int, input().split())\r\ncounter = 0\r\nfor i in range(n):\r\n s = input()\r\n count = 0\r\n m = {}\r\n for j in range(len(s)):\r\n if s[j] in m:\r\n m[s[j]] += 1\r\n else:\r\n m[s[j]] = 1\r\n for j in range(k+1):\r\n if str(j) in m:\r\n count += 1\r\n if count == k+1:\r\n counter += 1\r\nprint(counter)", "n,k=map(int,input().split(' '))\r\ncounter =0\r\nks=list(range(0,k+1))\r\n# print(ks)\r\nfor i in range(0,n):\r\n a=list(input())\r\n # print(a)\r\n good=True\r\n for j in ks:\r\n if (a.count(str(j))==0):\r\n good=False\r\n break\r\n if(good):\r\n counter = counter + 1 \r\nprint(counter)", "n, k = map(int, input().split())\r\n\r\nc2 = 0\r\nnum = '0123456789'\r\nfor i in range(n):\r\n count = 0\r\n a = input()\r\n for j in range(k + 1):\r\n if a.__contains__(num[j:j + 1]):\r\n count += 1\r\n\r\n if count >= k + 1:\r\n c2 += 1\r\n\r\nprint(c2)\r\n", "n, k = map(int, input().split())\r\nk_good = 0\r\nfor i in range(n):\r\n number = input()\r\n s = set()\r\n for j in range(len(number)):\r\n if int(number[j]) <= k:\r\n s.add(number[j])\r\n if len(s) == k + 1:\r\n k_good += 1\r\nprint(k_good)", "n, k = [int(x) for x in input().split()]\r\nz = 0\r\n\r\nfor i in range(n):\r\n sub = set(range(0, k+1))\r\n num = set([int(x) for x in input()])\r\n sub.difference_update(num)\r\n if len(sub) == 0:\r\n z += 1\r\nprint(z)\r\n", "size,num= map(int,input().split())\r\ncounter=0\r\ncount=0\r\nfor i in range(size):\r\n n= input()\r\n for i in range(num+1):\r\n if str(i) in n :\r\n counter+=1\r\n \r\n if counter > num:\r\n count+=1\r\n counter=0\r\n\r\n\r\nprint(count)\r\n ", "l,k=map(int,input().split())\r\n\r\ndigits=\"\"\r\n\r\nanswer=0\r\n\r\nfor i in range(k+1):\r\n digits+=str(i)\r\n \r\nfor i in range(l):\r\n b=int(input())\r\n b=str(b)\r\n c=0\r\n for thing in digits:\r\n if thing not in b:\r\n c+=1\r\n break\r\n if(c==0):\r\n answer+=1\r\nprint(answer)", "x=list(map(int, input().split()))\r\nn=x[0]\r\nk=x[1]\r\nr=0\r\nfor i in range(n):\r\n a=int(input())\r\n b=[int(x) for x in str(a)]\r\n c=set(b)\r\n #print(c)\r\n d=set(list(range(0,k+1)))\r\n #print(d)\r\n p=d.issubset(c)\r\n if p==True:\r\n r=r+1\r\nprint(r)", "m,k=map(int,input().split())\r\nj=0\r\nb=[]\r\nfor i in range(k+1):\r\n b.append(str(i))\r\nfor i in range(m):\r\n q=input()\r\n l=b.copy()\r\n for i in range(len(q)):\r\n if q[i] in l:\r\n l.remove(q[i])\r\n if l==[]:\r\n j+=1\r\nprint(j)", "def is_k_good(number, k):\r\n # Convert the number to a string to check the presence of digits.\r\n number_str = str(number)\r\n # Create a set of characters to keep track of which digits are present in the number.\r\n digits_present = set(number_str)\r\n # Check if all digits from 0 to k are present in the number.\r\n for i in range(k + 1):\r\n if str(i) not in digits_present:\r\n return False\r\n return True\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n count = 0\r\n\r\n for _ in range(n):\r\n ai = int(input())\r\n if is_k_good(ai, k):\r\n count += 1\r\n\r\n print(count)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int, input().split())\r\nans = 0\r\nfor _ in range(n):\r\n x = input()\r\n ok = 1\r\n x = list(x)\r\n x.sort()\r\n cnt = 0\r\n for i in x :\r\n if int(i) == cnt + int('0'):\r\n cnt += 1\r\n if cnt > k :\r\n ans += 1\r\nprint(ans)", "a,b = map(int, input().split())\r\nx=0\r\nfor i in range(a):\r\n y=0\r\n z=list(map(int, input()))\r\n for j in range(b+1):\r\n if j in z:\r\n y+=1\r\n if y==b+1:\r\n x+=1\r\nprint(x)\r\n", "#I = lambda: [int(i) for i in input().split()]\r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\n# n = int(input())\r\n# l = list(map(int,input().split()))\r\n# n,x = map(int,input().split())\r\n# mod = 1000000007\r\nn,k = map(int,input().split())\r\nl= []\r\nans=0\r\nfor _ in range(n):\r\n s = set((input()))\r\n cnt=0\r\n for i in range(k+1):\r\n for j in s:\r\n if str(i)==j:\r\n cnt+=1\r\n if cnt==k+1:\r\n ans+=1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\ncount = 0\r\nfor i in range(n):\r\n s = str(input().strip())\r\n if set(s) >= set(str(j) for j in range(k+1)):\r\n count += 1\r\nprint(count)\r\n", "n , k = map(int,input().split())\r\ntestagainst = set([i for i in range(k+1)])\r\n\r\nans = 0\r\nfor i in range(n):\r\n\r\n \r\n temp = input()\r\n temp = ([int(i) for i in temp])\r\n temp.sort()\r\n temp = set(temp)\r\n\r\n \r\n if testagainst.issubset(temp):\r\n ans += 1 \r\n\r\n\r\nprint(ans)", "from collections import Counter\r\ndef fun (k , l):\r\n x=0\r\n g = {str(i) for i in range(k+1)}\r\n c=Counter(l)\r\n for i in c.keys():\r\n s = set(str(i))\r\n if g.issubset(s) : x+=c[i]\r\n return x\r\nn,k = tuple(map(int , input().split()))\r\nl =[]\r\nfor i in range (n):\r\n l.append(input())\r\nprint(fun(k,l))", "n, k = list(map(int, input().split()))\r\nc = 0\r\nkk = set(map(str, range(k+1)))\r\n \r\nfor x in range(n):\r\n z = set(input())\r\n if kk.issubset(z):\r\n c += 1\r\nprint(c) ", "n, k = map(int, input().split())\r\n\r\ns = set(\"0123456789\"[:k+1])\r\n\r\nc = 0\r\nfor i in range(n):\r\n x= set(input())\r\n if x>=s:\r\n c+=1\r\n\r\nprint(c)", "n,k = map(int, input().split())\r\n\r\nres = 0\r\nfor _ in range(n):\r\n x = input()\r\n cnt = 0\r\n for i in range(k+1):\r\n if x.count(str(i)) >= 1:\r\n cnt+=1\r\n\r\n if cnt == k+1:\r\n res+=1\r\n cnt =0\r\n\r\nprint(res)\r\n\r\n\r\n\r\n", "n, k = [int(i) for i in input().split()]\n\nans = 0\n\nfor i in range(n):\n t = input()\n b = True\n\n for j in range(k+1):\n if str(j) not in t:\n b = False\n break\n \n ans += int(b)\n\nprint(ans)\n", "\r\na, k = map(int,input().split()) \r\ncount = a\r\nk_string = \"\"\r\nk_list = [str(i) for i in range(k+1)]\r\nfor i in k_list:\r\n k_string = k_string+i\r\n\r\nfor x in range(a):\r\n list_a = input() \r\n for j in k_string:\r\n if j not in list_a:\r\n count -= 1\r\n break\r\n\r\nprint(count)\r\n\r\n ", "n, k = list( map(int, input().split()) )\r\ncnt = 0\r\n\r\nfor _ in range(n):\r\n num = input()\r\n st = set()\r\n\r\n for x in num:\r\n digit = int(x)\r\n if digit >= 0 and digit <= k:\r\n st.add(x)\r\n\r\n if len(st) == k+1:\r\n cnt += 1\r\n \r\n\r\nprint(cnt)\r\n", "a,b=map(int,input().split())\r\n\r\nc=0\r\n\r\nfor i in range(a):\r\n \r\n\tk=input()\r\n\tfor j in range(b+1):\r\n\t\tif str(j) not in k:break\r\n\telse:c+=1\r\n\t\r\nprint(c)", "n,k=map(int,input().split())\r\ncount=0\r\nstart=0\r\nreflist= []\r\nfor i in range (k+1):\r\n reflist += str(i)\r\nif k ==0:\r\n start = 1\r\nfor i in range (n):\r\n s= input()\r\n l = reflist.copy()\r\n for i in range(start, len(s)):\r\n if s[i] in l:\r\n l.remove(s[i])\r\n if l == []:\r\n count =count+1\r\nprint(count)", "a,b=map(int,input().split())\r\ncount=0\r\nstart=0\r\nrefList=[]\r\nfor i in range(b+1):\r\n refList+=str(i)\r\nif b==0:\r\n start=1\r\nfor i in range(a):\r\n s=input()\r\n l=refList.copy()\r\n for i in range(start,len(s)):\r\n if s[i] in l:\r\n l.remove(s[i])\r\n if l==[]:\r\n count+=1\r\n\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\na=0\r\nb=0\r\nr=[]\r\nfor i in range(k+1):\r\n r+=str(i)\r\nif k==0:\r\n b=1\r\nfor i in range(n):\r\n s=input()\r\n l=r.copy()\r\n for i in range(b,len(s)):\r\n if s[i] in l:\r\n l.remove(s[i])\r\n if l==[]:\r\n a+=1\r\nprint(a)", "n,k=map(int,input().split())\r\nx=n\r\nfor i in range(n):\r\n q=input()\r\n for j in range(k+1):\r\n if str(j) not in q:\r\n x=x-1\r\n break\r\nprint(x)", "n, k = map(int, input().split())\r\ns = set(str(i) for i in range(k+1))\r\n\r\ncount = 0\r\nfor i in range(n):\r\n d = set(str(input().strip()))\r\n if s.issubset(d):\r\n count += 1\r\n\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\nans=0\r\nlst=[]\r\nfor i in range(n):\r\n lst.append(input())\r\nfor ele in lst:\r\n dig=[0]*(k+1)\r\n for d in ele:\r\n if int(d)>k:\r\n continue\r\n dig[int(d)]+=1\r\n ans+=all(dig)\r\nprint(ans)\r\n", "# Read input values\r\nn, k = map(int, input().split())\r\n\r\n# Initialize a counter variable to keep track of k-good numbers\r\ncount = 0\r\n\r\n# Iterate over each number in the array\r\nfor i in range(n):\r\n # Convert the number to a string\r\n num_str = str(int(input()))\r\n\r\n # Check if all digits from 0 to k appear in the string\r\n if all(str(digit) in num_str for digit in range(k+1)):\r\n count += 1\r\n\r\n# Print the count of k-good numbers\r\nprint(count)\r\n", "n,k=map(int,input().split())\r\ncount=n\r\n\r\nfor i in range(n):\r\n x=input()\r\n for i in range(k+1):\r\n if str(i) not in x:\r\n count-=1\r\n break\r\n \r\nprint(count)", "lineFirst = list(map(int, input().split()))\r\n\r\ntestAmount = lineFirst[0]\r\nnumberMax = lineFirst[1]\r\n\r\ngoodNumberAmount = 0\r\n\r\nfor i in range(testAmount):\r\n numberTemp = numberMax\r\n stringTemp = input()\r\n\r\n goodNumberVerify = True\r\n\r\n while (numberTemp >= 0):\r\n if str(numberTemp) not in stringTemp:\r\n goodNumberVerify = False\r\n break\r\n numberTemp -= 1\r\n\r\n if goodNumberVerify:\r\n goodNumberAmount += 1\r\n\r\nprint(goodNumberAmount)\r\n", "n,k = map(int,input().split())\r\ncount = 0\r\nfor i in range(n):\r\n s=0\r\n x=input()\r\n for i in range(k+1):\r\n if str(i) in x:\r\n s+=1\r\n if s==k+1:\r\n count+=1\r\nprint(count)", "m,n=map(int,input().split())\r\na=0\r\nfor i in range(m):\r\n b=0\r\n p=input()\r\n for i in range(n+1):\r\n if str(i) in p:\r\n b=b+1\r\n if b==n+1:\r\n a=a+1\r\nprint(a)", "n,k=map(int,input().split())\r\ncount=0\r\nfor i in range(n):\r\n x=input()\r\n a=1\r\n for j in range(k+1):\r\n if str(j) not in x:\r\n a=0\r\n break\r\n if a==1:\r\n count+=1\r\nprint(count)", "n,k=map(int,input().split())\r\nc=0\r\nfor _ in range(int(n)):\r\n ks=set(input())\r\n if all(str(i) in ks for i in range(k+1)):\r\n c+=1\r\n else:\r\n continue\r\n\r\nprint(c)", "n,k=map(int,input().split())\r\ncount=0\r\nfor i in range(n):\r\n s=list(input())\r\n for j in range(k+1):\r\n if str(j) in s:\r\n x=1\r\n else:\r\n x=0\r\n break\r\n if x==1:\r\n count+=1\r\nprint(count)\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled25.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1C4lffqvVsaZuKB3tgB3XIy1Pwms9LVYP\n\"\"\"\n\nn, k = map(int, input().split())\n\ncount = 0\n\nstart = 0\n\nrefList = []\n\nfor i in range(k+1): \n \n refList += str(i)\n if k == 0:\n start = 1\n\nfor i in range(n):\n s = input()\n l = refList.copy()\n for i in range (start, len(s)):\n if s[i] in l: \n l.remove(s[i])\n if l == []: \n count += 1\n\nprint (count)", "nt,k=map(int,input().split())\r\ncount=int(0)\r\nb=list(range(0,k+1))\r\nn=set(b)\r\ndef Convert(string):\r\n list1 = []\r\n list1[:0] = string\r\n list2=[int (i) for i in list1]\r\n return list2\r\nfor i in range(nt):\r\n a=str(input())\r\n p=(Convert(a))\r\n q=set(p)\r\n j=list(q)\r\n j.sort()\r\n jj=j[0:k+1]\r\n nn=set(jj)\r\n if (nn==n):\r\n count=count+1\r\n else:\r\n continue\r\nprint(count)", "n, k = map(int, input().split())\nmy_string = \"\"\nans = 0\nfor v in range(k + 1):\n my_string += str(v)\nfor i in range(n):\n num_list = list(input())\n num_list.sort()\n num_list = str(num_list)\n reserve = \"\"\n for p in range(len(num_list)):\n if num_list[p] in my_string and num_list[p] not in reserve:\n reserve += num_list[p]\n if reserve == my_string:\n ans += 1\nprint(ans)\n\n \t \t\t\t\t\t\t \t\t \t\t \t\t \t\t\t\t \t\t", "n, k = map(int, input().split())\r\n\r\ngood_count = 0\r\nfor i in range(n):\r\n number = input().strip()\r\n digit_present = [False] * (k+1)\r\n for digit in number:\r\n if int(digit) <= k:\r\n digit_present[int(digit)] = True\r\n if all(digit_present):\r\n good_count += 1\r\n\r\nprint(good_count)\r\n", "n,k=map(int,input().split())\r\nc=0\r\nb=[]\r\nfor i in range(k+1):\r\n b.append(str(i))\r\nfor i in range(n):\r\n s=input()\r\n l=b.copy()\r\n for i in range(len(s)):\r\n if s[i] in l:\r\n l.remove(s[i])\r\n if l==[]:\r\n c+=1\r\nprint(c)\r\n", "n, k = [int(x) for x in input().split()]\ngood = 0\nfor _ in range(n):\n val = input()\n is_good = True\n for i in range(k+1):\n if str(i) not in val:\n is_good = False\n break\n if is_good:\n good += 1\nprint(good)\n", "n,k=map(int,input().split())\r\nc=0\r\nfor _ in range(n):\r\n a=input()\r\n good=True\r\n for i in range(k+1):\r\n if str(i) not in a:\r\n good=False\r\n break\r\n if good:\r\n c+=1\r\nprint(c)", "n,k=map(int,input().split())\r\np,q=0,0\r\nm=[]\r\nfor i in range(k+1):\r\n m+=str(i)\r\nif k==0:\r\n q=1\r\nfor i in range(n):\r\n w=input()\r\n l=m.copy()\r\n for i in range(q, len(w)):\r\n if w[i] in l:\r\n l.remove(w[i])\r\n if l==[]:\r\n p+=1\r\nprint(p)", "def good(n, k, a):\r\n count = 0\r\n for num in a:\r\n Notfalse = False\r\n for i in range(0, k+1):\r\n if str(i) not in num:\r\n Notfalse = True\r\n break\r\n if not Notfalse:\r\n count += 1\r\n return count\r\n\r\n\r\nn, k = map(int, input().split())\r\nx = 0\r\na = list()\r\nwhile x < n:\r\n a.append(input())\r\n x += 1\r\nprint(good(n, k, a))\r\n\r\n", "n, b = map(int, input().split())\r\nk = 0\r\nfor ___ in range(n):\r\n h = [int(_) for _ in input()]\r\n for i in range(b + 1):\r\n if i not in h:\r\n break\r\n if i not in h:\r\n continue\r\n k += 1\r\nprint(k)\r\n", "p=input()\r\nn_k=p.split(\" \")#[n,k]\r\na=[]\r\nfor i in range(int(n_k[1])+1):\r\n a.append(str(i))\r\narr=[]\r\nc=0\r\nfor i in range(int(n_k[0])):\r\n arr.append(input())\r\nfor i in range(len(arr)):\r\n b=list(arr[i])\r\n result = all(elem in b for elem in a)\r\n if result==True:\r\n c=c+1\r\nprint(c)", "r,s=map(int,input().split())\r\nc=0\r\nfor i in range(r):\r\n x=input()\r\n a=1\r\n for k in range(s+1):\r\n if str(k) not in x:\r\n a=0\r\n break\r\n if a==1:\r\n c+=1\r\nprint(c)", "n, k = map(int, input().split())\r\n\r\ncount = 0\r\nfor i in range(n):\r\n num_str = str(input().strip())\r\n if all(str(digit) in num_str for digit in range(k+1)):\r\n count += 1\r\n\r\nprint(count)", "def k_good(n, k, a):\r\n count = 0\r\n for i in range(n):\r\n flag = True\r\n for j in range(k+1):\r\n if str(j) not in str(a[i]):\r\n flag = False\r\n break\r\n if flag:\r\n count += 1\r\n return count\r\n\r\nn, k = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(int(input().strip()))\r\nprint(k_good(n, k, a))\r\n", "n,m=map(int,input().split());c=0\r\nfor i in range(n):\r\n\ta=input()\r\n\tfor j in range(m+1):\r\n\t\tif str(j) not in a:break\r\n\telse:c+=1\r\nprint(c)", "n,k = map(int,input().split())\r\nk_lst = list()\r\ncount = 0\r\ndef Good(a,k):\r\n cnt = 0\r\n for i in k:\r\n if i in a:\r\n cnt += 1\r\n if cnt == len(k) and len(a) >= len(k):\r\n return 1\r\n else:\r\n return 0\r\nk_lst = list(range(k+1))\r\nfor i in range(n):\r\n num = list(map(int, input()))\r\n count += Good(num,k_lst)\r\nprint(count)", "n, k = map(int, input().split())\r\ncnt = 0\r\nli = set([str(x) for x in range(k + 1)])\r\nfor num in range(n):\r\n want = input()\r\n if li.issubset(want):\r\n cnt += 1\r\nprint(cnt)", "n,k = map(int, input().split())\r\nc = 0\r\ns = 0\r\n \r\nlst = []\r\nfor i in range(k+1):\r\n lst += str(i)\r\n \r\nif k == 0:\r\n s = 1\r\n \r\nfor i in range(n):\r\n p = input()\r\n l = lst.copy()\r\n for i in range(s, len(p)):\r\n if p[i] in l:\r\n l.remove(p[i])\r\n \r\n if l == []:\r\n c += 1\r\n \r\nprint(c)", "n,k=map(int,input().split())\r\ncount=0\r\nfor i in range(n):\r\n a=input()\r\n for j in range(k+1):\r\n if str(j) in a:\r\n result=True\r\n else:\r\n result=False\r\n break\r\n if result==True:\r\n count+=1\r\nprint(count)", "n,k=map(int,input().split())\r\nresult=0\r\nfor i in range(n):\r\n count=0\r\n number=input()\r\n for j in range(k+1):\r\n if str(j) in number:\r\n count+=1\r\n if count==k+1:\r\n result+=1\r\nprint(result)\r\n ", "n,k=map(int,input().split())\ns=0\nfor i in range(n):\n num=input()\n for j in range(k+1):\n if str(j) in num:\n g = 1\n else:\n g = 0\n break\n if g==1:\n s+=1\nprint(s)", "n, k = map(int, input(). split())\r\ncount = 0\r\nc = 0\r\nb = []\r\nfor i in range(k + 1):\r\n b += str(i)\r\n if k == 0:\r\n c = 1\r\nfor i in range(n):\r\n s = input()\r\n l = b.copy()\r\n for i in range (c, len(s)):\r\n if s[i] in l:\r\n l.remove(s[i])\r\n if l == []:\r\n count += 1\r\nprint (count)", "n,k = map(int, input().split())\r\nGud=0\r\nx = list(range(0,k+1))\r\nfor i in range(n):\r\n lst = list(map(int, input()))\r\n num = []\r\n tem = list(sorted(list(set(lst))))\r\n if k != 0:\r\n num = tem[0:len(x)]\r\n else:\r\n if x[0] in lst:\r\n if lst[0] != 0:\r\n Gud+=1\r\n continue\r\n elif lst[0] == 0 and lst.count(0)>1:\r\n Gud+=1\r\n continue\r\n else:\r\n continue\r\n if x == num:\r\n Gud+=1\r\nprint(Gud)", "p, q = map(int, input().split())\r\nr = 0\r\nfor i in range(p):\r\n s = 0\r\n l = list(map(int, input()))\r\n for j in range(q+1):\r\n if j in l:\r\n s += 1\r\n if s == q + 1:\r\n r += 1\r\nprint(r)", "# /**\r\n# * author: brownfox2k6\r\n# * created: Tue 18 Apr 2023 at 21:27:51 UTC+7, Hanoi, Vietnam\r\n# **/\r\n\r\nn, k = map(int, input().split())\r\nans = 0\r\nfor _ in range(n):\r\n s = input()\r\n for i in range(0, k+1):\r\n if str(i) not in s:\r\n break\r\n else:\r\n ans += 1\r\n\r\nprint(ans)", "n , k = [int(x) for x in input().split()]\r\n\r\ngoods = n\r\nfor i in range(n):\r\n ins = set([x for x in input()])\r\n l = len(ins) \r\n b = 0\r\n\r\n for num in ins:\r\n if int(num) > k:\r\n b += 1\r\n\r\n if l - b < k + 1:\r\n goods -= 1\r\n\r\nprint(goods)", "n,k=map(int,input().split())\r\ngood=0\r\nfor i in range(n):\r\n a=list(map(int,input()))\r\n x=len(a)\r\n m=0\r\n while m<=k:\r\n if a.count(m)>0:\r\n m+=1\r\n else:\r\n break\r\n if m==k+1:\r\n good+=1\r\nprint(good)\r\n", "n, k = map(int, input().split())\r\n\r\ndef is_k_good(num, k):\r\n digits = set(str(num))\r\n for i in range(k+1):\r\n if str(i) not in digits:\r\n return False\r\n return True\r\n\r\ncount = 0\r\nfor i in range(n):\r\n if is_k_good(int(input()), k):\r\n count += 1\r\n\r\nprint(count)\r\n", "a,b = map(int, input().split())\r\nc=0\r\nfor i in range(a):\r\n n=input()\r\n m=0\r\n for j in range(b+1):\r\n if str(j) not in n:\r\n m=1\r\n break\r\n if m==0:\r\n c=c+1\r\nprint(c)", "# -*- coding: utf-8 -*-\n\"\"\"Good number\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1pPJ9Sjuz6pNsnen9rySsuaTUuNM-KlYV\n\"\"\"\n\nn, k = map(int, input().split())\nc = 0\nd = 0\nfor i in range (n):\n a = input()\n for b in range (k+1):\n if str(b) in a:\n c = c + 1\n if c == k + 1:\n d += 1\n c = 0\nprint(d)", "n,k=map(int,input().split())\r\nl=[]\r\nl1=[]\r\nc=0\r\nfor i in range(n):\r\n a=input()\r\n l.append(a)\r\nfor i in range(k+1):\r\n l1.append(str(i))\r\nfor i in l:\r\n m=0\r\n for j in range(len(l1)):\r\n if l1[j] not in i:\r\n m=1\r\n if m!=1:\r\n c+=1\r\nprint(c)", "a,b=map(int,input().split())\r\nc=0\r\nfor i in range(a):\r\n l=list(map(int,input()))\r\n for j in range(b+1):\r\n if j not in l:\r\n break\r\n else:\r\n c+=1\r\n continue \r\nprint(c)\r\n ", "s = 0\r\nn,k = map(int,input().split())\r\nr = []\r\nfor i in range(k+1):\r\n r.append(str(i))\r\n\r\nfor i in range(n):\r\n d = list(set(input()))\r\n c = 0\r\n for i in range(k+1):\r\n if(r[i] in d):\r\n c = c + 1\r\n \r\n if(c==k+1):\r\n s = s +1 \r\n \r\nprint(s) ", "n,s=map(int,input().split())\r\nB=0\r\nfor i in range(n):\r\n R=0\r\n x=input()\r\n for i in range(s+1):\r\n if str(i) in x:\r\n R=R+1\r\n if R==s+1:\r\n B=B+1\r\nprint(B)", "n, k = map(int, input().split())\r\ncount = 0\r\n\r\nfor _ in range(n):\r\n check = True\r\n a = list(set((input())))\r\n if len(set(a)) > k:\r\n a = sorted([int(i) for i in a])\r\n if a[k] == k:\r\n count += 1\r\n\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\ncount = 0\r\n\r\nfor _ in range(n):\r\n ai = input().strip()\r\n digits = set(ai)\r\n\r\n is_k_good = all(str(digit) in digits for digit in range(k+1))\r\n\r\n if is_k_good:\r\n count += 1\r\n\r\nprint(count)\r\n", "from sys import stdin, stdout\r\n\r\nn, k = tuple(map(int, stdin.readline().split()))\r\nmain_set = {str(i) for i in range(k + 1)}\r\nnumberOfGoodNumbers = 0\r\nfor _ in range(n):\r\n numberOfGoodNumbers += 1 if main_set.issubset(set(stdin.readline().rstrip())) else 0\r\nstdout.write(str(numberOfGoodNumbers))", "import sys\ninput = sys.stdin.readline\n\ndef solve(n,k):\n temp = n\n d = set()\n while n:\n n , c = divmod(n,10)\n d.add(c)\n for i in range(0,k+1):\n if i not in d:\n return False\n return True\n\nt , k = map(int,input().split())\nres = 0\nfor _ in range(t):\n n = int(input())\n res+=solve(n,k)\nprint(res)\n ", "n, k = map(int, input().split())\r\n\r\ncount = 0\r\nfor i in range(n):\r\n a = input().strip()\r\n if all(str(j) in a for j in range(k+1)):\r\n count += 1\r\n\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\nc = 0\r\nk = [str(x) for x in range(m+1)]\r\nfor _ in range(n):\r\n flag = True\r\n a = input()\r\n for i in k:\r\n if i not in a:\r\n flag = False\r\n break\r\n if flag:\r\n c += 1\r\nprint(c)", "a, b = map(int,input().split())\r\nm = 0\r\nfor i in range(a):\r\n h = input()\r\n l = len(h)\r\n n = []\r\n o = 0\r\n for j in range(l):\r\n n.append(eval(h[j]))\r\n for x in range(b+1):\r\n if x in n:\r\n o += 1\r\n if o == b+1:\r\n m += 1\r\n\r\n \r\n\r\nprint(m)\r\n", "n,k = map(int,input().split())\r\ngood = 0\r\ns = list(range(0,k+1))\r\nfor i in range(n):\r\n lst = list(map(int,input()))\r\n nums = []\r\n tem = list(sorted(list(set(lst))))\r\n if k!=0:\r\n nums = tem[0:len(s)]\r\n else:\r\n if s[0] in lst:\r\n if lst[0]!=0:\r\n good = good+1\r\n continue\r\n elif lst[0]==0 and lst.count(0)>1:\r\n good = good+1\r\n continue\r\n else:\r\n continue\r\n if s==nums:\r\n good= good+1\r\nprint(good)", "a,b=map(int,input().split())\r\nx=0\r\nfor i in range(a):\r\n s=input()\r\n count=0\r\n for j in range(b+1):\r\n if str(j) in s:\r\n count=count+1\r\n if count==b+1:\r\n x=x+1\r\nprint(x)", "n, k = map(int, input().split())\n\ncounter = 0\nans = 0\n\nst = set()\n\nfor i in range(n):\n s = input()\n for j in range(len(s)):\n if int(s[j])%10 <= k:\n st.add(s[j])\n\n if len(st) == k+1:\n ans += 1\n st.clear()\n\nprint(ans)\n\t\t \t \t \t\t \t\t \t \t \t\t\t \t\t", "n,a=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n x=list(input())\r\n d=0\r\n for i in range(a+1):\r\n if str(i) in x:\r\n d+=1\r\n if d==a+1:\r\n c+=1\r\nprint(c)\r\n ", "n, k = [int(x) for x in input().split()]\r\nx = 0\r\nfor i in range(0, n):\r\n a = input()\r\n if set(map(int, a)).issuperset(set(range(0, k+1))):\r\n x += 1\r\nprint(x)\r\n", "n,k = [int(x) for x in input().split()]\r\nans = 0\r\nfor i in range(n):\r\n store = set()\r\n for x in input():\r\n store.add(int(x))\r\n possible = True\r\n for i in range(k+1):\r\n if i not in store:\r\n possible=False\r\n break\r\n if possible:\r\n ans+=1\r\nprint(ans)\r\n \r\n", "n,k=map(int,input().split())\r\nr=0\r\nwhile n:\r\n a=input()\r\n r+=all(a.count(str(i))for i in range(k+1))\r\n n-=1\r\nprint(r)\r\n", "n,s=map(int,input().split())\r\nu=0\r\nfor i in range(n):\r\n c=0\r\n x=input()\r\n for i in range(s+1):\r\n if str(i) in x:\r\n c=c+1\r\n if c==s+1:\r\n u=u+1\r\nprint(u)\r\n \r\n", "n,k = map(int, input().split())\r\ncount=0\r\nfor i in range(n):\r\n a=0\r\n num=input()\r\n for i in range(k+1):\r\n if str(i) in num:\r\n a+=1\r\n if a==(k+1):\r\n count+=1\r\nprint(count)", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n b=0\r\n x=input()\r\n for i in range(k+1):\r\n if str(i) in x:\r\n b=b+1\r\n if b==k+1:\r\n c=c+1\r\nprint(c)", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n a=input()\r\n m=0\r\n for j in range(k+1):\r\n if str(j) in a:\r\n m=m+1\r\n if m==k+1:\r\n c=c+1\r\nprint(c)\r\n", "n,k=map(int,input().split())\r\ngood_lists=0\r\nfor i in range(n):\r\n good_numb=0\r\n input_array=list(map(int,input()))\r\n for x in range(k+1):\r\n if x in input_array:\r\n good_numb+=1\r\n if good_numb==k+1:\r\n good_lists+=1\r\nprint(good_lists) ", "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,k = li()\r\nans = 0\r\nfor _ in range(n):\r\n x = input()\r\n flag = 1\r\n for i in range(k+1):\r\n if str(i) not in x:\r\n flag = 0\r\n break\r\n ans += 1 if flag else 0\r\nprint(ans)", "n, k = map(int, input().split())\r\ncount = 0\r\nfor i in range(n):\r\n a = set(input().strip())\r\n if all(str(j) in a for j in range(k+1)):\r\n count += 1\r\nprint(count)", "n,k=map(int, input().split())\r\na=0\r\nfor i in range(n):\r\n x = list(map(int, input()))\r\n for j in range(k+1):\r\n if j not in x:\r\n break\r\n else:\r\n a+=1\r\nprint(a)", "n, t = map(int, input().split())\r\nA = []\r\nfor _ in range(n):\r\n x = input()\r\n A.append(x)\r\n\r\ns = 0\r\nB = list(range(t + 1))\r\n\r\nfor i in range(len(A)):\r\n num_str = str(A[i])\r\n e = True\r\n\r\n for digit in B:\r\n if str(digit) not in num_str:\r\n e = False\r\n break \r\n\r\n if e:\r\n s += 1 \r\n\r\nprint(s)\r\n", "n,k=map(int,input().split())\r\nans = 0\r\nfor i in range (0,n):\r\n q = {int(x) for x in input()}\r\n if set(range(0,k+1))<=q:\r\n ans+=1\r\nprint (ans)\r\n", "def solve(n,h,a):\r\n res=0\r\n for i in range(n):\r\n for j in range(h+1):\r\n if str(j) not in a[i]:\r\n break\r\n else:\r\n res+=1\r\n return res \r\n \r\n \r\nn,h=map(int,input().split())\r\n# a=list(map(int,input().split()))\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\n# n=int(input())\r\n# s=input()\r\n# s1=input()\r\nprint(solve(n,h,a))", "from sys import stdin\r\nn, k = [int(x) for x in stdin.readline().strip().split(\" \")]\r\narray = []\r\nfor i in range(k + 1):\r\n array.append(str(i))\r\ncont = 0\r\nnumbers = []\r\nfor i in range(n):\r\n number = int(stdin.readline().strip())\r\n numbers.append(number)\r\nfor i in numbers:\r\n flag = True\r\n for j in array:\r\n if j not in str(i):\r\n flag = False\r\n break\r\n if flag == False:\r\n cont += 1\r\nprint(n - cont)", "n,s=map(int,input().split())\r\nu = 0\r\nfor i in range(n):\r\n c = 0\r\n a = input()\r\n for i in range (s + 1):\r\n if str(i) in a:\r\n c = c+1\r\n if c==s+1:\r\n u = u+1\r\nprint(u)", "n, k = map(int, input().split())\r\ncount = 0\r\n\r\nfor _ in range(n):\r\n num = input().strip()\r\n is_k_good = True\r\n for digit in range(k + 1):\r\n if str(digit) not in num:\r\n is_k_good = False\r\n break\r\n if is_k_good:\r\n count += 1\r\n\r\nprint(count)\r\n", "b=list(map(int,input().split()))\r\nc=0\r\nfor i in range(b[0]):\r\n a=input()\r\n for j in range(0,(b[1]+1)):\r\n if str(j) in a:\r\n k=1\r\n else:\r\n k=0\r\n break\r\n if k==1:\r\n c=c+1\r\nprint(c)", "#A good number\r\nn,k=map(int, input().split())\r\ncount=0\r\nfor i in range(n):\r\n x=0\r\n l=list(map(int, input()))\r\n for j in range(k+1):\r\n if j in l:\r\n x+=1\r\n if x==k+1:\r\n count+=1\r\nprint(count)", "n,m=map(int,input().split())\r\nans = 0\r\nfor i in range(n):\r\n a = input().strip()\r\n c = [True]*(m+1)\r\n for k in a:\r\n if k<=str(m):\r\n c[int(k)] = False\r\n if c.count(True)==0:\r\n ans+=1\r\nprint(ans)\r\n", "def main():\n\n inp = input().split()\n n = int(inp[0])\n k = int(inp[1])\n numbers = [input() for i in range(n)]\n for i in range(n):\n number = numbers[i]\n numbers[i] = []\n for letter in number:\n numbers[i].append(int(letter))\n \n counter = 0\n for element in numbers:\n flag = True\n for i in range(0, k+1):\n if i not in element:\n flag = False\n continue\n if flag:\n counter += 1\n\n print(counter)\n\n return 0\n\nif __name__ == \"__main__\":\n main()", "n, k = map(int, input().split(\" \"))\r\nresult = 0\r\nfor _ in range(n):\r\n line = list(input())\r\n currently = set()\r\n for i in line:\r\n if 0 <= int(i) <= k and int(i) not in currently:\r\n currently.add(i)\r\n if len(currently) == k + 1:\r\n break\r\n result += len(currently) == (k + 1)\r\n\r\nprint(result)\r\n", "n, k = list(map(int, input().split()))\r\nc = 0\r\nk_set = set(map(str, range(k + 1)))\r\n\r\nfor x in range(n):\r\n z = set(input())\r\n if k_set.issubset(z):\r\n c += 1\r\nprint(c)\r\n", "lst = [w.rstrip() for w in open(0).readlines()]\r\nn, k = map(int, lst[0].split())\r\ns = {str(i) for i in range(k+1)}\r\nres = sum(1 for x in lst[1:] if len(s & set(list(x))) == k+1)\r\nprint(res)", "numbers=list(map(int,input().split()))\r\nn=numbers[0] \r\nm=numbers[1] \r\nnum=\"\"\r\nans=True\r\ncount=0\r\nfor i in range(n): \r\n num=input() \r\n ans=True\r\n for j in range(m+1):\r\n if not num.__contains__(str(j)):\r\n ans=False\r\n break\r\n \r\n if ans :\r\n count+=1\r\n\r\n \r\nprint(count) \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n,k=map(int,input().split())\r\ncount=0\r\nfor i in range(n):\r\n c=True\r\n a=input()\r\n for j in range(k+1):\r\n if str(j) not in a:\r\n c=False\r\n if c:\r\n count+=1\r\nprint(count)", "n,k=map(int,input().split())\r\nu=0 \r\nfor i in range(n):\r\n c=0\r\n a=input()\r\n for i in range(k+1):\r\n if str(i) in a:\r\n c=c+1\r\n if c==k+1:\r\n u=u+1\r\nprint(u)", "n, k = map(int, input().split())\r\ns = set('0123456789'[:k+1])\r\nj = 0\r\nfor i in range(n):\r\n b=input()\r\n if set(b) >= s:\r\n j +=1\r\nprint(j)", "n,k=map(int,input().split())\r\ny=0\r\nfor i in range(n):\r\n t=list(input())\r\n for j in range(k+1):\r\n if str(j) in t:\r\n x=1\r\n else:\r\n x=0\r\n break\r\n if x==1:\r\n y+=1\r\nprint(y)\r\n \r\n", "(n, k) = map(int, input().split())\r\n \r\ncount = 0\r\n \r\nfor i in range(n):\r\n s = map(int, input())\r\n st = set()\r\n for item in s:\r\n if item > k:\r\n pass\r\n else:\r\n st.add(item)\r\n else:\r\n if len(st) == k + 1:\r\n count += 1\r\n \r\n \r\nprint (count)", "n, k = map(int, input().split())\r\nk_set = set(range(k + 1))\r\nk_good = 0\r\nfor i in range(n):\r\n if k_set.issubset(set(map(int, input()))):\r\n k_good += 1\r\nprint(k_good)", "def solve():\r\n n, k = list(map(int, input().split()))\r\n\r\n ss = set()\r\n for i in range(k+1):\r\n ss.add(str(i))\r\n \r\n counter = 0\r\n for _ in range(n):\r\n number = set(list(input()))\r\n if len(ss.intersection(number)) == k+1:\r\n counter +=1\r\n print(counter)\r\nsolve()", "import pdb\r\nnk = input().split()\r\n\r\narr = []\r\nfor q in range(int(nk[0])):\r\n arr.append(input())\r\n\r\ncounter = 0\r\ndata = list(range(int(nk[1])+1)) #digits list\r\nfor q in data:\r\n data[q] = str(data[q])\r\n\r\nfor q in range(int(nk[0])):\r\n c_data = data.copy()\r\n \r\n for i in range(int(nk[1])+1):\r\n if data[i] in arr[q]:\r\n c_data.remove(data[i])\r\n if not c_data:\r\n counter +=1\r\n\r\nprint(counter)", "n,k=map(int,input().split())\r\nr=0\r\nfor i in range(n):\r\n c=0\r\n a=input()\r\n for i in range(k+1):\r\n if str(i) in a:\r\n c+=1\r\n if c==k+1:\r\n r+=1\r\nprint(r)\r\n ", "x, y = list(map(int, input().split()))\r\nc = 0\r\nd = 0\r\nfor i in range(x):\r\n a = input()\r\n for b in range(y+1):\r\n if str(b) in a:\r\n c += 1\r\n if c == y+1:\r\n d += 1\r\n c = 0\r\nprint(d)", "\r\ndef g(a, k):\r\n if a == 0:\r\n return k == 0\r\n s = set()\r\n while a > 0:\r\n if a % 10 <= k:\r\n s.add(a % 10)\r\n a //= 10\r\n return len(s) == k + 1\r\n \r\nn, k = (int(x) for x in input().split())\r\nprint(sum(g(int(input()), k) for i in range(n)))", "n,k = map(int, input().split())\r\nc = 0\r\nfor i in range(n):\r\n l = sorted(list(set(input())))\r\n if len(l) >= k+1:\r\n c += 1 if l[k] == str(k) else 0\r\n \r\nprint(c)", "n,k=map(int,input().split())\r\ng=0\r\nfor i in range(n):\r\n ct=0\r\n a=list(map(int,input()))\r\n for j in range(k+1):\r\n if j in a:\r\n ct+=1\r\n if ct==k+1:\r\n g+=1\r\nprint(g) \r\n", "x,y=map(int,input().split())\r\na=0\r\nfor i in range(x):\r\n b = input()\r\n l={'a'}\r\n for ff in b:\r\n if ff<=str(y)[0]:\r\n l.add(ff)\r\n if len(l)==y+2:\r\n a+=1\r\nprint(a)", "n,k=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(n):\r\n s=input()\r\n if not any(str(j) not in s for j in range(k+1)):\r\n sum+=1\r\nprint(sum)", "n , k = [int(i) for i in input().split()]\r\nnums = [0] * n\r\n\r\nfor i in range(n):\r\n nums[i] = input()\r\n\r\nmemory = []\r\nres = 0\r\nfor i in range(n):\r\n for d in nums[i]:\r\n if not d in memory and int(d) <= k:\r\n memory.append(d) \r\n\r\n if len(memory) == k + 1:\r\n res += 1\r\n\r\n memory = []\r\n\r\nprint(res)", "n, k = map(int, input().split())\ncount = 0\nfor i in range(n):\n a = input().strip()\n found = True\n for j in range(k+1):\n if str(j) not in a:\n found = False\n break\n if found:\n count += 1\nprint(count)\n \t \t \t \t \t\t\t\t\t\t\t\t \t\t \t \t", "n,k=map(int,input().split())\r\nl=[]\r\nm=[]\r\ncount=0\r\nfor i in range(n):\r\n a=input()\r\n l.append(a)\r\nfor i in range(k+1):\r\n m.append(str(i))\r\nfor i in range(len(l)):\r\n x=0\r\n for j in range(len(m)):\r\n if m[j] not in l[i]:\r\n x=1\r\n if x!=1:\r\n count=count+1 \r\nprint(count)", "n, k = map(int, input().split())\r\na = [int(input()) for _ in range(n)]\r\nresult = 0\r\nfor num in a:\r\n is_good = True\r\n for i in range(k+1):\r\n if str(i) not in str(num):\r\n is_good = False\r\n break\r\n if is_good:\r\n result += 1\r\nprint(result)\r\n", "def is_number_good(number: str, k: int) -> int:\r\n for num in range(k + 1):\r\n if str(num) not in number:\r\n return 0\r\n\r\n return 1\r\n\r\nn, k = map(int, input().split(' '))\r\n\r\ncounter = 0\r\nfor i in range(n):\r\n counter += is_number_good(input(), k)\r\n\r\nprint(counter)\r\n", "n,s=map(int,input().split())\r\nu = 0\r\nfor i in range(n):\r\n c=0\r\n a = input()\r\n for i in range (s+1):\r\n if str(i) in a:\r\n c= c+1\r\n if c==s+1:\r\n u= u+1\r\nprint(u)\r\n " ]

{"inputs": ["10 6\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560\n1234560", "2 1\n1\n10", "1 0\n1000000000", "1 1\n1000000000", "6 0\n10\n102\n120\n1032\n1212103\n1999999", "1 3\n1000000000", "1 9\n1000000000", "1 0\n1", "1 1\n1", "1 3\n1", "1 9\n1", "2 8\n123456780\n123", "2 8\n12345678\n1230", "6 1\n10\n102\n120\n1032\n1212103\n1999999", "6 2\n10\n102\n120\n1032\n1212103\n1999999", "6 3\n10\n102\n120\n1032\n1212103\n1999999", "6 9\n10\n102\n120\n1032\n1212103\n1999999", "1 2\n2220"], "outputs": ["10", "1", "1", "1", "5", "0", "0", "0", "0", "0", "0", "1", "0", "5", "4", "2", "0", "0"]}

UNKNOWN

PYTHON3

CODEFORCES

318

90e34ecfae4b0a43ec885c28e8b50ef6

Фото на память - 2 (round version)

Прошло много лет, и на вечеринке снова встретились *n* друзей. С момента последней встречи техника шагнула далеко вперёд, появились фотоаппараты с автоспуском, и теперь не требуется, чтобы один из друзей стоял с фотоаппаратом, и, тем самым, оказывался не запечатлённым на снимке. Упрощенно процесс фотографирования можно описать следующим образом. На фотографии каждый из друзей занимает прямоугольник из пикселей: в стоячем положении *i*-й из них занимает прямоугольник ширины *w**i* пикселей и высоты *h**i* пикселей. Но также, при фотографировании каждый человек может лечь, и тогда он будет занимать прямоугольник ширины *h**i* пикселей и высоты *w**i* пикселей. Общая фотография будет иметь размеры *W*<=×<=*H*, где *W* — суммарная ширина всех прямоугольников-людей, а *H* — максимальная из высот. Друзья хотят определить, какую минимальную площадь может иметь общая фотография. Помогите им в этом. В первой строке следует целое число *n* (1<=≤<=*n*<=≤<=1000) — количество друзей. В последующих *n* строках следуют по два целых числа *w**i*,<=*h**i* (1<=≤<=*w**i*,<=*h**i*<=≤<=1000), обозначающие размеры прямоугольника, соответствующего *i*-му из друзей. Выведите единственное целое число, равное минимальной возможной площади фотографии, вмещающей всех друзей. Sample Input 3 10 1 20 2 30 3 3 3 1 2 2 4 3 1 5 10 Sample Output 180 21 50

[ "n = int(input())\r\n\r\ninf = 10**9 + 11\r\narr = []\r\n\r\nfor i in range(n):\r\n wh = list(map(int, input().split()))\r\n wh.sort()\r\n arr.append(wh)\r\n \r\nbest_S = inf\r\ncur_S = 0\r\n\r\nfor h in range(1, 1001):\r\n cur_S = 0\r\n for j in range(n):\r\n if arr[j][0] > h:\r\n cur_S = inf\r\n break\r\n if arr[j][1] <= h:\r\n cur_S += arr[j][0]\r\n else:\r\n cur_S += arr[j][1]\r\n best_S = min(best_S, cur_S * h)\r\n \r\nprint(best_S)\r\n \r\n\r\n", "n = int(input().rstrip())\r\nd = []\r\nfor i in range(n):\r\n w, h = map(int, input().rstrip().split())\r\n d.append([w, h])\r\ns = '.' \r\nfor i in range(len(d)):\r\n h = d[i][0]\r\n w = d[i][1]\r\n f = 1\r\n for j in range(len(d)):\r\n if j != i:\r\n if d[j][0] <= h and d[j][1] <= h:\r\n w += min(d[j][0], d[j][1])\r\n elif d[j][0] <= h and d[j][1] > h:\r\n w += d[j][1]\r\n elif d[j][0] > h and d[j][1] <= h:\r\n w += d[j][0]\r\n else:\r\n f = 0\r\n if not f == 0:\r\n if s == '.' or h * w < s:\r\n s = h * w\r\n h = d[i][1]\r\n w = d[i][0]\r\n f = 1\r\n for j in range(len(d)):\r\n if j != i:\r\n if d[j][0] <= h and d[j][1] <= h:\r\n w += min(d[j][0], d[j][1])\r\n elif d[j][0] <= h and d[j][1] > h:\r\n w += d[j][1]\r\n elif d[j][0] > h and d[j][1] <= h:\r\n w += d[j][0]\r\n else:\r\n f = 0\r\n if not f == 0:\r\n if s == '.' or h * w < s:\r\n s = h * w \r\nprint(s) \r\n ", "import sys\r\nfrom typing import Counter\r\n\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' '):\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef solve():\r\n n = int(input())\r\n set_ = set()\r\n data = []\r\n max_of_min = 0\r\n for _ in range(n):\r\n w, h = map(int, input().split())\r\n min_ = min(w, h)\r\n max_ = max(w, h)\r\n data.append((min_, max_))\r\n set_.add(w)\r\n set_.add(h)\r\n max_of_min = max(max_of_min, min_)\r\n ans = Counter()\r\n for x in set_:\r\n if x >= max_of_min:\r\n for min_, max_ in data:\r\n if max_ <= x:\r\n ans[x] += min_\r\n else:\r\n ans[x] += max_\r\n min_ = max_of_min * ans[max_of_min]\r\n for k, v in ans.items():\r\n min_ = min(min_, k * v)\r\n print(min_)\r\n\r\ndef main():\r\n t = 1#int(input())\r\n for _ in range(t):\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a = []\r\nheights = []\r\nwid = 0\r\nhei = 0\r\nheim = 1000\r\nn = int(input())\r\nfor i in range(n):\r\n w, h = map(int, input().split())\r\n if (w > h):\r\n x = w\r\n w = h\r\n h = x\r\n wid += w\r\n if (hei < h):\r\n hei = h\r\n if (heim > w):\r\n heim = w\r\n a.append((h, w))\r\nlast = wid * hei\r\nfor i in range(heim, hei + 1):\r\n wid1 = 0\r\n hei1 = i\r\n for j in range(0, n):\r\n if a[j][0] <= i:\r\n wid1 += a[j][1]\r\n else:\r\n if (a[j][1] <= i):\r\n wid1 += a[j][0]\r\n else:\r\n wid1 += 1000000000\r\n break\r\n if (wid1 * i < last):\r\n last = wid1 * i\r\nprint(last)\r\n\r\n \r\n \r\n", "import sys\r\nfrom math import *\r\nfrom collections import Counter,defaultdict,deque\r\ninput=sys.stdin.readline\r\nmod=10**9+7\r\ndef get_ints():return map(int,input().split())\r\ndef get_int():return int(input())\r\ndef get_array():return list(map(int,input().split()))\r\ndef input():return sys.stdin.readline().strip()\r\n\r\n# for _ in range(int(input())):\r\nn=get_int()\r\na=[]\r\nfor i in range(n):\r\n w,h=get_ints()\r\n a.append([min(w,h),max(w,h)])\r\n# print(a)\r\nans=inf\r\nfor i in range(1001):\r\n val=0\r\n for j in range(n):\r\n if a[j][0]<=i and a[j][1]<=i:\r\n val+=a[j][0]\r\n elif a[j][0]>i and a[j][1]>i:\r\n val=inf\r\n break\r\n elif a[j][0]<=i and a[j][1]>i:\r\n val+=a[j][1]\r\n ans=min(ans,val*i)\r\nprint(ans)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\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\n\r\n\r\ndef lcm(a, b):\r\n return (a * b) / gcd(a, b)\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = []\r\n for i in range(n):\r\n a.append(list(map(int, input().split())))\r\n ans=float('inf')\r\n for i in range(1,1001):\r\n f=1\r\n curr=0\r\n for j in a:\r\n if j[0]>i and j[1]>i:\r\n f=0\r\n break\r\n else:\r\n if j[0] <= i and j[1] <= i:\r\n curr+=min(j[0], j[1])\r\n else:\r\n curr+=max(j[0], j[1])\r\n if f:\r\n #print(i,curr)\r\n ans=min(ans, curr*i)\r\n print(ans)\r\n\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def main():\n import sys\n \n tokens = [int(i) for i in sys.stdin.read().split()]\n tokens.reverse()\n \n n = tokens.pop()\n people = [(tokens.pop(), tokens.pop()) for i in range(n)]\n \n result = float(\"inf\")\n for i in range(n):\n for j in range(2):\n maxh = people[i][j]\n S = people[i][j ^ 1]\n for k in range(n):\n if k != i:\n w, h = people[k]\n w, h = min(w, h), max(w, h)\n if w > maxh:\n S = float(\"inf\")\n break\n if h > maxh:\n S += h\n else:\n S += w\n result = min(result, S * maxh)\n \n print(result)\n \n \n \nmain()\n" ]

{"inputs": ["3\n10 1\n20 2\n30 3", "3\n3 1\n2 2\n4 3", "1\n5 10", "10\n168 538\n836 439\n190 873\n206 47\n891 591\n939 481\n399 898\n859 466\n701 777\n629 222", "42\n13 62\n114 242\n265 839\n756 349\n298 476\n533 704\n348 277\n554 573\n654 112\n429 836\n574 766\n909 415\n163 891\n532 983\n873 457\n719 117\n1 302\n170 634\n166 585\n721 231\n208 609\n128 246\n845 726\n604 119\n859 110\n568 515\n656 913\n113 166\n794 566\n834 860\n983 596\n545 819\n167 9\n960 73\n260 607\n173 378\n417 938\n362 819\n800 939\n246 834\n746 440\n42 643", "3\n379 820\n923 407\n916 853", "3\n99 768\n477 885\n169 118", "3\n227 612\n223 259\n423 895", "3\n651 161\n480 32\n485 672", "3\n779 301\n34 214\n442 937", "3\n203 145\n780 692\n992 713", "3\n627 286\n37 65\n53 490", "3\n755 938\n487 543\n307 459", "3\n475 487\n41 20\n368 236", "3\n922 71\n719 26\n462 700", "2\n881 4\n788 2", "2\n1 304\n8 892", "3\n227 2\n223 9\n423 5", "3\n7 612\n3 259\n3 895", "4\n573 7\n169 9\n447 7\n947 3", "4\n3 817\n9 729\n7 407\n7 433", "10\n864 874\n534 702\n73 363\n856 895\n827 72\n435 468\n888 921\n814 703\n648 715\n384 781", "10\n489 685\n857 870\n736 221\n687 697\n166 360\n265 200\n738 519\n393 760\n66 176\n798 160", "1\n1 1", "1\n1000 1000", "1\n1 1000", "2\n1 1000\n1000 1", "2\n1 1\n1000 1000", "1\n1000 1", "2\n1 1\n1 1", "3\n1 4\n1 4\n1 1", "2\n2 1\n3 1", "2\n4 3\n2 1", "5\n78 94\n8 53\n81 8\n41 11\n57 57", "8\n1 8\n1 8\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1"], "outputs": ["180", "21", "50", "3478056", "13474964", "1512797", "614190", "731790", "455616", "728049", "1366821", "235752", "1307660", "352925", "515398", "5286", "8028", "6768", "11635", "19224", "21242", "4909752", "3231747", "1", "1000000", "1000", "2000", "1001000", "1000", "2", "9", "5", "15", "14418", "22"]}

UNKNOWN

PYTHON3

CODEFORCES

7

912f39a3ff6a9f5dd8230e1c50920c4f

none

Little Chris is very keen on his toy blocks. His teacher, however, wants Chris to solve more problems, so he decided to play a trick on Chris. There are exactly *s* blocks in Chris's set, each block has a unique number from 1 to *s*. Chris's teacher picks a subset of blocks *X* and keeps it to himself. He will give them back only if Chris can pick such a non-empty subset *Y* from the remaining blocks, that the equality holds: For example, consider a case where *s*<==<=8 and Chris's teacher took the blocks with numbers 1, 4 and 5. One way for Chris to choose a set is to pick the blocks with numbers 3 and 6, see figure. Then the required sums would be equal: (1<=-<=1)<=+<=(4<=-<=1)<=+<=(5<=-<=1)<==<=(8<=-<=3)<=+<=(8<=-<=6)<==<=7. However, now Chris has exactly *s*<==<=106 blocks. Given the set *X* of blocks his teacher chooses, help Chris to find the required set *Y*! The first line of input contains a single integer *n* (1<=≤<=*n*<=≤<=5·105), the number of blocks in the set *X*. The next line contains *n* distinct space-separated integers *x*1, *x*2, ..., *x**n* (1<=≤<=*x**i*<=≤<=106), the numbers of the blocks in *X*. Note: since the size of the input and output could be very large, don't use slow output techniques in your language. For example, do not use input and output streams (cin, cout) in C++. In the first line of output print a single integer *m* (1<=≤<=*m*<=≤<=106<=-<=*n*), the number of blocks in the set *Y*. In the next line output *m* distinct space-separated integers *y*1, *y*2, ..., *y**m* (1<=≤<=*y**i*<=≤<=106), such that the required equality holds. The sets *X* and *Y* should not intersect, i.e. *x**i*<=≠<=*y**j* for all *i*, *j* (1<=≤<=*i*<=≤<=*n*; 1<=≤<=*j*<=≤<=*m*). It is guaranteed that at least one solution always exists. If there are multiple solutions, output any of them. Sample Input 3 1 4 5 1 1 Sample Output 2 999993 10000001 1000000

[ "import sys\r\nINF = 10**20\r\nMOD = 10**9 + 7\r\nI = lambda:list(map(int,input().split()))\r\nfrom math import gcd\r\nfrom math import ceil\r\nfrom collections import defaultdict as dd, Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\n\r\n\r\n\"\"\"\r\nFacts and Data representation\r\nConstructive? Top bottom up down\r\n\"\"\"\r\nn, = I()\r\na = I()\r\nM = 10 ** 6 + 1\r\ntake = [0] * M\r\nfor i in a:\r\n take[i] = 1\r\n\r\nans = []\r\nok = []\r\ncnt = 0\r\nfor i in range(1, M // 2 + 1):\r\n if take[i] and take[M - i]:\r\n cnt += 1\r\n elif not take[i] and not take[M - i]:\r\n ok.append((i, M - i))\r\n elif take[i]:\r\n ans.append(M - i)\r\n else:\r\n ans.append(i)\r\n\r\nfor i in range(cnt):\r\n ans.append(ok[i][0])\r\n ans.append(ok[i][1])\r\n\r\nprint(len(ans))\r\nprint(*ans)" ]

{"inputs": ["3\n1 4 5", "1\n1", "1\n1000000", "2\n2 999999", "9\n1 2 3 100 500000 500001 999901 999997 999999", "3\n999998 999999 1000000", "3\n1 2 3", "3\n5 345435 999996", "6\n1 10 100 1000 10000 1000000", "2\n1 1000000", "2\n500000 500001", "4\n1 2 999999 1000000", "10\n63649 456347 779 458642 201571 534312 583774 283450 377377 79066", "10\n1 100000 199999 299998 399997 499996 599995 699994 799993 899992"], "outputs": ["3\n999996 999997 1000000 ", "1\n1000000 ", "1\n1 ", "2\n1 1000000 ", "9\n4 5 6 7 999994 999995 999996 999998 1000000 ", "3\n1 2 3 ", "3\n999998 999999 1000000 ", "3\n1 654566 1000000 ", "6\n2 990001 999001 999901 999991 999999 ", "2\n2 999999 ", "2\n1 1000000 ", "4\n3 4 999997 999998 ", "10\n416227 465689 541359 543654 622624 716551 798430 920935 936352 999222 ", "10\n100009 200008 300007 400006 500005 600004 700003 800002 900001 1000000 "]}

UNKNOWN

PYTHON3

CODEFORCES

1

9136cb00808749220dc6c0007520b499

Insomnia cure

«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine. However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every *k*-th dragon got punched in the face with a frying pan. Every *l*-th dragon got his tail shut into the balcony door. Every *m*-th dragon got his paws trampled with sharp heels. Finally, she threatened every *n*-th dragon to call her mom, and he withdrew in panic. How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of *d* dragons? Input data contains integer numbers *k*,<=*l*,<=*m*,<=*n* and *d*, each number in a separate line (1<=≤<=*k*,<=*l*,<=*m*,<=*n*<=≤<=10, 1<=≤<=*d*<=≤<=105). Output the number of damaged dragons. Sample Input 1 2 3 4 12 2 3 4 5 24 Sample Output 12 17

[ "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ny=int(input())\r\nif a==1 or b==1 or d==1 or c==1:\r\n print(y)\r\nelse:\r\n h=set()\r\n for i in range(1,y+1):\r\n if i%a!=0 and i%b!=0 and i%c!=0 and i%d!=0 :\r\n h.add(i)\r\n print(y-len(h))", "\r\nk =int(input())\r\nl =int(input())\r\nm =int(input())\r\nn =int(input())\r\nd =int(input())\r\n\r\n\r\ndp=[0]*d\r\nfor i in range(1,d+1):\r\n if i %k ==0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n dp[i-1] = 1\r\nprint(sum(dp))", "#using inclusion exclusion principle \ndef lcm(l):\n if len(l)==2:\n for i in range(1,l[0]*l[1]+1):\n if i%l[0]==0 and i%l[1]==0:\n return i\n if len(l)==3:\n for i in range(1,l[0]*l[1]*l[2]+1):\n if i%l[0]==0 and i%l[1]==0 and i%l[2]==0:\n return i\n if len(l)==4:\n for i in range(1,l[0]*l[1]*l[2]*l[3]+1):\n if i%l[0]==0 and i%l[1]==0 and i%l[2]==0 and i%l[3]==0:\n return i\n\na=int(input())\nb=int(input())\nc=int(input())\nd=int(input())\nn=int(input())\nlcm_ab=n//lcm([a,b])\nlcm_ac=n//lcm([a,c])\nlcm_ad=n//lcm([a,d])\nlcm_bc=n//lcm([b,c])\nlcm_bd=n//lcm([b,d])\nlcm_cd=n//lcm([c,d])\nlcm_abc=n//lcm([a,b,c])\nlcm_abd=n//lcm([a,b,d])\nlcm_acd=n//lcm([a,c,d])\nlcm_bcd=n//lcm([b,c,d])\nlcm_abcd=n//lcm([a,b,c,d])\ndragons=(n//a+n//b+n//c+n//d)-(lcm_ab+lcm_ac+lcm_ad+lcm_bc+lcm_bd+lcm_cd)+(lcm_abc+lcm_abd+lcm_acd+lcm_bcd)-lcm_abcd\nprint(dragons)\n\n#alternate method but time inefficient\n\n'''a=int(input())\nb=int(input())\nc=int(input())\nd=int(input())\nn=int(input())\nl=[]\n\nif a==1 or b==1 or c==1 or d==1:\n print(n)\n\n\nelif a>n and b>n and c>n and d>n:\n\n print(0)\n \nelse:\n for i in range(1,n+1):\n l.append(i)\n damaged=[]\n for i in range(1,n+1,a):\n if i not in damaged:\n damaged.append(i)\n for i in range(1,n+1,b):\n if i not in damaged:\n damaged.append(i)\n for i in range(1,n+1,c):\n if i not in damaged:\n damaged.append(i)\n for i in range(1,n+1,d):\n if i not in damaged:\n damaged.append(i)\n print(len(damaged))'''\n \n ", "def ok(ak, d):\r\n for k in ak:\r\n if d < k:\r\n continue\r\n if d % k == 0:\r\n return True\r\n return False\r\n\r\n\r\nak = [int(input()), int(input()), int(input()), int(input())]\r\nd = int(input())\r\ns = 0\r\nfor i in range(1, d + 1):\r\n if ok(ak, i):\r\n s += 1\r\nprint(s)\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\n#d_list=[]\r\n\r\n#not_in_list=[]\r\n#c=0\r\n\r\n'''print(d//k + d//l + d//m + d//n - d//(k*l) - d//(k*m) - d//(k*n) - d//(l*m) - d//(l*n) - d//(m*n) + d//(k*l*m) + d//(l*m*n) + d//(m*n*k) + d//(k*l*n) - 2*d//(k*l*m*n))'''\r\n\r\n'''for i in range(1,d+1):\r\n d_list.append(i)\r\nfor i in range(k,d+1,k):\r\n d_list.remove(i)\r\nfor i in range(l,d+1,l):\r\n if i in d_list:\r\n d_list.remove(i)\r\nfor i in range(m,d+1,m):\r\n if i in d_list:\r\n d_list.remove(i)\r\nfor i in range(n,d+1,n):\r\n if i in d_list:\r\n d_list.remove(i)\r\nprint(d-len(d_list))'''\r\n\r\n'''for i in range(k,d+1,k):\r\n c+=1\r\n not_in_list.append(i)\r\nfor i in range(l,d+1,l):\r\n if i not in not_in_list:\r\n not_in_list.append(i)\r\n c+=1\r\nfor i in range(m,d+1,m):\r\n if i not in not_in_list:\r\n not_in_list.append(i)\r\n c+=1\r\nfor i in range(n,d+1,n):\r\n if i not in not_in_list:\r\n #not_in_list.append(i)\r\n c+=1\r\nprint(c)'''\r\n\r\nif k==1 or l==1 or m==1 or n==1:\r\n print(d)\r\nelse:\r\n count=d//k+d//l+d//m+d//n\r\n for i in range(l,d+1,l):\r\n if i%k==0:\r\n count-=1\r\n for i in range(m,d+1,m):\r\n if i%k==0 or i%l==0:\r\n count-=1\r\n for i in range(n,d+1,n):\r\n if i%k==0 or i%l==0 or i%m==0:\r\n count-=1\r\n print(count)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nlst = [0]*(d+1)\r\nw,x,y,z = 1,1,1,1\r\nwhile w*k<=d or x*l<=d or y*m<=d or z*n<=d:\r\n if w*k<=d:\r\n lst[w*k] = 1\r\n w+=1\r\n if x*l<=d:\r\n lst[x*l] = 1\r\n x+=1\r\n if y*m<=d:\r\n lst[y*m] = 1\r\n y+=1\r\n if z*n<=d:\r\n lst[z*n] = 1\r\n z+=1\r\ncnt = 0\r\nfor i in range(1,d+1):\r\n if lst[i] == 1:\r\n cnt+=1\r\nprint(cnt)", "def sol():\r\n k=int(input())\r\n l=int(input())\r\n m=int(input())\r\n n=int(input())\r\n d=int(input())\r\n cnt=0\r\n for i in range (1,d+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0:\r\n cnt=cnt+1\r\n\r\n print(cnt)\r\n \r\n \r\nsol()", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nif k==1 or l==1 or m==1 or n==1:\r\n print(d)\r\nelse:\r\n di={}\r\n escaped=0\r\n for i in range(1,d+1):\r\n di[i]=0\r\n for j in range(k,d+1,k):\r\n di[j]=1\r\n \r\n for j in range(l,d+1,l):\r\n di[j]=1\r\n for j in range(m,d+1,m):\r\n di[j]=1\r\n for j in range(n,d+1,n):\r\n di[j]=1\r\n for i in range(1,d+1):\r\n if di[i]==0:\r\n escaped+=1\r\n print(d-escaped)\r\n\r\n \r\n", "# Read input\r\nk = int(input()) # Dragons punched with frying pan\r\nl = int(input()) # Dragons with tail damage\r\nm = int(input()) # Dragons with paws trampled\r\nn = int(input()) # Dragons threatened by mom\r\nd = int(input()) # Total dragons\r\n\r\n# Initialize the count of damaged dragons\r\ndamaged_dragons = 0\r\n\r\n# Iterate over the dragons from 1 to d\r\nfor i in range(1, d + 1):\r\n # Check each condition and increment the count if the dragon gets damaged\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n damaged_dragons += 1\r\n\r\n# Print the count of damaged dragons\r\nprint(damaged_dragons)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nk = [i for i in range(0, d + 1, k)]\r\nl = [i for i in range(0, d + 1, l)]\r\nm = [i for i in range(0, d + 1, m)]\r\nn = [i for i in range(0, d + 1, n)]\r\nhit1 = k + l + m + n\r\nhit1 = set(hit1)\r\nprint(len(hit1)-1)", "# N = int(input())\r\n# N,M = map(int,input().split())\r\n# A = list(map(int,input().split()))\r\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\na = [False] * d\r\nfor i in range(k-1,d,k):\r\n a[i] = True\r\nfor i in range(l-1,d,l):\r\n a[i] = True\r\nfor i in range(m-1,d,m):\r\n a[i] = True\r\nfor i in range(n-1,d,n):\r\n a[i] = True\r\nres = 0\r\nfor i in range(d):\r\n if a[i]==True:\r\n res += 1\r\nprint(res)\r\n\r\n", "# Import helpful pages\nfrom logging.handlers import WatchedFileHandler\nimport queue\nfrom re import A\nfrom sys import stdin, stdout\nfrom collections.abc import MutableSet, Sequence, Set\nfrom collections import defaultdict\nfrom tkinter.messagebox import NO\nfrom typing import List\nimport copy\nimport math\nimport itertools\nimport heapq\nimport time\nimport bisect\nfrom itertools import count, cycle\nfrom unicodedata import name\nfrom zlib import Z_BEST_COMPRESSION\n\n# Helper Objects\nclass SortedSet(MutableSet, Sequence):\n def __init__(self, iterable=None, key=None, init_set=set()):\n self._key = key\n self._set = init_set\n self._len = 0\n self._load = self.DEFAULT_LOAD_FACTOR\n self._lists = []\n self._maxes = []\n self._index = []\n self._offset = 0\n if iterable is not None:\n self._update(iterable)\n\n @classmethod\n def _fromset(cls, values, key=None):\n return SortedSet(key=key, init_set=values)\n \n def __contains__(self, value):\n return value in self._set\n\n def __len__(self):\n return len(self._set)\n \n def __iter__(self):\n return iter(self._list)\n\n def clear(self):\n self._set.clear()\n #self._list.clear()\n\n def count(self, value):\n return 1 if value in self._set else 0\n\nclass SegNode(object):\n def __init__(self, start, end):\n self.left = None\n self.right = None\n\n self.start = start\n self.end = end\n self.payload = set()\n\n def is_leaf(self) -> bool:\n return not self.left and not self.right\n\n def get_midpoint(self) -> int:\n return (self.start + self.end) // 2\n\n def split(self) -> bool:\n if self.is_leaf() and self.start != self.end:\n midpoint = self.get_midpoint()\n self.left = SegNode(self.start, midpoint)\n self.right = SegNode(midpoint + 1, self.end)\n return True\n return False\n\n def has_non_match(self, color):\n len_check = 1 if color in self.payload else 0\n return len(self.payload) > len_check\n\nclass SegArray(object):\n def __init__(self, min_val:int, max_val:int):\n \"\"\"Initialization.\"\"\"\n self.root = SegNode(min_val, max_val)\n \n def update(self, start: int, end: int, payload:int, root:SegNode=None) -> int:\n \"\"\"Update payload range\"\"\"\n if not root:\n root = self.root\n\n if root.is_leaf() and not (root.start == start and root.end == end):\n root.split()\n\n if root.is_leaf():\n root.payload.add(payload)\n return root.payload\n\n if end <= root.get_midpoint():\n self.update(start, end, root=root.left)\n elif start > root.get_midpoint():\n self.update(start, end, root=root.right)\n else:\n self.update(start, root.left.end, root=root.left)\n self.update(root.right.start, end, root=root.right)\n\n # Propogate the changes after recursive call returns\n root.payload.add(payload)\n return root.payload\n\n\n def get_in_range(self, start: int, end:int, root:SegNode=None) -> int:\n \"\"\"set of elements nums[i..j]\"\"\"\n if not root:\n root = self.root\n\n #If the range exactly matches the root, we already have the sum\n if root.start == start and root.end == end:\n return root.total\n \n #If end of the range is less than the mid, the entire interval lies\n #in the left subtree\n if end <= root.get_midpoint():\n return self.get_in_range(start, end, root=root.left)\n \n #If start of the interval is greater than mid, the entire inteval lies\n #in the right subtree\n elif start >= root.get_midpoint() + 1:\n return self.get_in_range(start, end, root=root.right)\n \n #Otherwise, the interval is split. So we calculate the sum recursively,\n #by splitting the interval\n else:\n left = self.get_in_range(start, root.get_midpoint(), root=root.left)\n right = self.get_in_range(root.get_midpoint()+1, end, root=root.right)\n return left.union(right)\n\n def closest_non_match(self, start:int, end:int, payload:int, root:SegNode=None) -> int:\n if not root:\n root = self.root\n\n # If there are no other payloads then no match found\n if not root.has_non_match():\n return -1\n\n if root.is_leaf():\n # Leaf and in range\n if start <= root.end and root.end <= end:\n return 0\n if start <= root.start and root.start <= end:\n return 0\n # Leaf and out of range\n min_dist = min(abs(root.start - end), abs(root.end - start))\n return min_dist\n\n # sub range\n if end <= root.get_midpoint():\n if root.left.has_non_match(payload):\n return self.closest_non_match(start, end, payload, root.left)\n return self.closest_non_match(start, end, payload, root.right)\n elif start > root.get_midpoint():\n if root.right.has_non_match(payload):\n return self.closest_non_match(start, end, payload, root.right)\n return self.closest_non_match(start, end, payload, root.left)\n elif root.left.has_non_match(payload) and root.right.has_non_match(payload):\n left = self.closest_non_match(start, root.get_midpoint(), payload, root.left)\n left = self.closest_non_match(root.get_midpoint() + 1, end, payload, root.right)\n\n elif root.left.has_non_match(payload):\n pass\n\n\n # if range is to the left of current node; left is closer if possible\n if end < root.start:\n next = root.right\n if root.left.has_non_match(payload):\n next = root.left\n return self.closest_non_match(start, end, payload, next)\n elif start > root.end:\n next = root.left\n if root.right.has_non_match(payload):\n next = root.right\n return self.closest_non_match(start, end, payload, next)\n \n \n\n if start <= root.start and end <= root.end:\n needed_len = 2 if payload in root.payload else 1\n if len(root.payload) > needed_len:\n return 0\n return -1\n\n if end <= root.get_midpoint():\n pass\n\n \n\nclass IntervalNode(object):\n def __init__(self, l, r):\n self.l = l\n self.r = r\n self.split = (r - l) // 2 + l\n self.left = None\n self.right = None\n self.count = 0\n\n def split(self, val):\n if self.has_child():\n if val < self.split:\n self.left.split(val)\n else:\n self.right.split(val)\n else:\n self.split = val\n self.left = IntervalNode(self.l, self.split)\n self.left.count = self.count\n self.right = IntervalNode(self.split + 1, self.r)\n self.right.count = self.count\n\n\n\n def in_range(self, val):\n return self.l <= val and self.r >= val\n\n def add_range(self, l, r):\n l = max(l, self.l)\n r = min(r, self.r)\n\n if l == self.l and r == self.r:\n self.count += 1\n if self.has_child():\n self.left.add_range(l, r)\n self.right.add_range(l, r)\n else:\n if l <= self.split:\n if not self.has_child() and self.l < self.r:\n self.left = IntervalNode(self.l, self.split)\n self.left.count = self.count\n self.right = IntervalNode(self.split + 1, self.r)\n self.right.count = self.count\n self.left.add_range(l, r)\n if r > self.split:\n if not self.has_child() and self.l < self.r:\n self.left = IntervalNode(self.l, self.split)\n self.left.count = self.count\n self.right = IntervalNode(self.split + 1, self.r)\n self.right.count = self.count\n self.right.add_range(l, r)\n \n def has_child(self):\n return self.left and self.right and self.l < self.r\n \n def get_count(self, li):\n if self.has_child():\n self.left.get_count(li)\n self.right.get_count(li)\n else:\n li.append((self.count, self.l, self.r))\n \n\n\n \n# Helper methods for execution\ndef get_int_dd(d=0):\n def def_value():\n return d\n return defaultdict(def_value)\n \ndef get_counts(li):\n dd = get_int_dd()\n for i in li:\n dd[i] += 1\n return dd\n\ndef get_li_dd():\n def def_value():\n return []\n return defaultdict(def_value)\n\ndef get_set_dd():\n def def_value():\n return set()\n return defaultdict(def_value)\n\ndef get_index_map(li, w_offset=False):\n dd = get_li_dd()\n for i,n in enumerate(li):\n dd[n].append(i + (1 if w_offset else 0))\n return dd\n\ndef to_int_list(str):\n str.strip()\n return [int(i) for i in str.split()]\n\ndef to_char_list(str):\n str.strip()\n return [str[i] for i in range(len(str))]\n\n# INPUT METHODS\n\ndef read_line():\n return stdin.readline().strip()\n\ndef read_int():\n return int(read_line())\n\ndef read_ints():\n return [int(i) for i in read_line().split()]\n\ndef read_str_list(read_n=True, n=1):\n if read_n:\n n = read_int()\n return [read_line() for i in range(n)]\n\n# OUTPUT METHODS\n\ndef write_out(value):\n stdout.write(str(value))\n\ndef write_line(value):\n stdout.write(str(value) + '\\n')\n \nCOMMENTS_ON = True\n \ndef comment(value):\n if COMMENTS_ON:\n stdout.write(str(value) + '\\n')\n \ndef execute_on_input(calc_ans, read_case=read_line, t=None, write_output=write_line):\n if not t:\n t = read_int()\n for eval in [calc_ans(read_case()) for input in range(t)]:\n if eval is not None:\n write_output(eval)\n\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191]\nfibonacci = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733, 1134903170, 1836311903, 2971215073, 4807526976, 7778742049]\n\n\ndef qA():\n\n def read():\n return [read_int() for _ in range(5)]\n \n def calc(input):\n k, l, m, n, d = input\n return sum([1 if (i % k == 0) or (i % l == 0) or (i % m == 0) or (i % n == 0) else 0 for i in range(1, d+1)])\n\n return max([\n a*b*c,\n a+b+c,\n (a+b)*c,\n a*(b+c)\n ])\n \n\n \n \n\n \n \n \n # Execute on each input line.\n execute_on_input(calc, read_case=read, t=1)\n\ndef qB():\n\n def read():\n return read_int(), read_ints()\n \n def calc(input):\n return input\n\n \n # Execute on each input line.\n execute_on_input(calc, read_case=read)\n\n\ndef qTemplate():\n\n def read():\n return read_int(), read_ints()\n \n def calc(input):\n return input\n \n # Execute on each input line.\n execute_on_input(calc, read_case=read)\n\n\n# Call the methods\nif __name__ == \"__main__\":\n qA() \n\n\n\n", "k=int(input())\r\nl=int(input())\r\nn=int(input())\r\nm=int(input())\r\nd=int(input())\r\ns=0\r\nif min(k,l,n,m)==1:\r\n print(d)\r\nelse:\r\n for i in range(1,d+1):\r\n if i%l==0 or i%k==0 or i%n==0 or i%m==0:\r\n s+=1\r\n print(s)", "a = [int(input()) for _ in range(5)]\r\ns = set()\r\n \r\nfor b in a[:-1]:\r\n c = b\r\n while c <= a[-1]:\r\n s.add(c)\r\n c += b\r\n \r\nprint(len(s))", "# Get the attack values\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\n\r\n# Get the total number of dragons\r\nd = int(input())\r\n\r\n# Create a list to store the damaged dragons\r\ndamaged_dragons = []\r\n\r\n# Iterate through the list of dragons\r\nfor i in range(1, d + 1):\r\n\r\n # Check if the dragon is divisible by any of the attack values\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n\r\n # Add the dragon to the list of damaged dragons\r\n damaged_dragons.append(i)\r\n\r\n# Print the number of damaged dragons\r\nprint(len(damaged_dragons))", "i_th = []\r\nfor i in range(4):\r\n i_th.append(int(input()))\r\n\r\nd = int(input())\r\n\r\ncount = 0\r\nfor i in range(1, d+1):\r\n for j in i_th:\r\n if i % j == 0:\r\n count += 1\r\n break # 4개의 숫자 중 하나라도 나누어떨어지면\r\n # 다음 숫자로 넘어감\r\n \r\nprint(count)", "# k = int(input())\r\n# l = int(input())\r\n# m = int(input())\r\n# n = int(input())\r\n# d = int(input())\r\n\r\n# lis = [i for i in range(1, d+1)]\r\n# res = 0\r\n\r\n# for i in lis:\r\n# if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:\r\n# res+=1\r\n# print(d-res)\r\ndef gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef lcm(a, b):\r\n return (a * b) // gcd(a, b)\r\n\r\ndef count_damaged_dragons(k, l, m, n, d):\r\n total_dragons = d\r\n \r\n # Count dragons that satisfy individual conditions\r\n dragons_k = d // k\r\n dragons_l = d // l\r\n dragons_m = d // m\r\n dragons_n = d // n\r\n\r\n # Count dragons that satisfy at least two conditions\r\n dragons_kl = d // lcm(k, l)\r\n dragons_km = d // lcm(k, m)\r\n dragons_kn = d // lcm(k, n)\r\n dragons_lm = d // lcm(l, m)\r\n dragons_ln = d // lcm(l, n)\r\n dragons_mn = d // lcm(m, n)\r\n\r\n # Count dragons that satisfy at least three conditions\r\n dragons_klm = d // lcm(lcm(k, l), m)\r\n dragons_kln = d // lcm(lcm(k, l), n)\r\n dragons_kmn = d // lcm(lcm(k, m), n)\r\n dragons_lmn = d // lcm(lcm(l, m), n)\r\n\r\n # Count dragons that satisfy all four conditions\r\n dragons_klmn = d // lcm(lcm(lcm(k, l), m), n)\r\n\r\n # Apply the inclusion-exclusion principle to count damaged dragons\r\n damaged_dragons = dragons_k + dragons_l + dragons_m + dragons_n \\\r\n - dragons_kl - dragons_km - dragons_kn - dragons_lm - dragons_ln - dragons_mn \\\r\n + dragons_klm + dragons_kln + dragons_kmn + dragons_lmn \\\r\n - dragons_klmn\r\n\r\n return damaged_dragons\r\n\r\n# Example usage:\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ndamaged_dragons = count_damaged_dragons(k, l, m, n, d)\r\nprint(damaged_dragons)\r\n", "a=[5]\r\nfor i in range(5):\r\n b=int(input())\r\n a.append(b)\r\nc=0\r\nfor i in range(1,a[5]+1):\r\n if i%a[1]==0 or i%a[2]==0 or i%a[3]==0 or i%a[4]==0:\r\n c+=1\r\nprint(c)\r\n ", "k=int(input())\nl=int(input())\nm=int(input())\nn=int(input())\nd=int(input())\nc=0\nfor i in range(1,d+1):\n\tif i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:\n\t\tc+=1\nprint(d-c)\n\n\n\n\n\n\n\n\n\n\n\n\n", "e,f,g,h,m = map(int,(input() for i in range(5)))\nl=0\nfor i in range(1,m+1):\n if i%e and i%f and i%g and i%h:\n continue\n else:\n l+=1\nprint(l)\n \t\t\t \t \t\t \t \t\t\t\t\t\t \t\t \t \t", "N = 100010\r\nsuffer = []\r\nst = [0] * N\r\nans = 0\r\n\r\nfor i in range(4):\r\n\tsuffer.append(int(input()))\r\nn = int(input())\r\nfor i in suffer:\r\n\tt = n // i\r\n\tj = i\r\n\ttt = 1\r\n\twhile j <= n and tt <= t:\r\n\t\tif not st[j]:\r\n\t\t\tst[j] = 1\r\n\t\t\tans += 1\r\n\t\t\ttt += 1\r\n\t\t\tj = tt * i\r\n\t\telse:\r\n\t\t\ttt += 1\r\n\t\t\tj = tt * i\t\r\nprint(ans)", "k=int(input())\nl=int(input())\nm=int(input())\nn=int(input())\nd=int(input())\ncount=0\nfor i in range (1,d+1):\n if (i%k!=0) and (i%l!=0) and(i%m!=0) and(i%n!=0):\n count=count+1\ntotalDamaged= d-count\nprint(totalDamaged)\n", "cnt = 0\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nfor i in range(1,d+1):\r\n if i % k == 0 or i%l == 0 or i%m == 0 or i%n==0:\r\n cnt +=1\r\n\r\nprint(cnt)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ndr = [k,l,m,n]\r\nhit = [x for x in range(1,d+1)]\r\nk = [x for x in range(0,d+1,k)]\r\nl = [x for x in range(0,d+1,l)]\r\nm = [x for x in range(0,d+1,m)]\r\nn = [x for x in range(0,d+1,n)]\r\nhit1 = k + l + m + n\r\nhit1 = set(hit1)\r\nprint(len(hit1)-1)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nabused = 0\r\n\r\nfor i in range(1, d + 1):\r\n if not i % k or not i % l or not i % m or not i % n:\r\n abused += 1\r\n\r\nprint(abused)", "a=int(input())\nb=int(input())\nc=int(input())\nd=int(input())\ne=int(input())\ny=0\nfor i in range(1,e+1):\n if i%a ==0 or i%b==0 or i%c==0 or i%d==0:\n y+=1\nprint(y)\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nb = []\r\nfor i in range(k, d+1, k):\r\n b.append(i)\r\nfor i in range(l, d+1, l):\r\n b.append(i)\r\nfor i in range(m, d+1, m):\r\n b.append(i)\r\nfor i in range(n, d+1, n):\r\n b.append(i)\r\nprint(len(set(b)))", "def insomnia(k, l, m, n, d):\r\n sol = int()\r\n for item in range (1, d+1):\r\n if item%k != 0 and item%l != 0 and item%m != 0 and item%n != 0:\r\n sol += 1\r\n return d-sol\r\n\r\nif __name__ == \"__main__\":\r\n k = int(input())\r\n l = int(input())\r\n m = int(input())\r\n n = int(input())\r\n d = int(input())\r\n print(insomnia(k, l, m, n, d))", "n=int(input())\r\nm=int(input())\r\nk=int(input())\r\nt=int(input())\r\nd=int(input())\r\nl=[]\r\nr=[]\r\nw=[]\r\nq=[]\r\nfor i in range(1,d+1):\r\n if i%n==0:\r\n l.append(i);\r\n if i%m==0:\r\n r.append(i);\r\n if i%k==0:\r\n w.append(i);\r\n if i%t==0:\r\n q.append(i);\r\nl.extend(r);\r\nl.extend(w);\r\nl.extend(q)\r\no=abs(len(set(l))-d)\r\nprint(d-o);\r\n", "#from collections import Counter\r\n#import math\r\ncount_time=0\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#------------------------------------------\r\nk,l,m,n,d=[int(input()) for _ in range(5)]\r\nd+=1\r\nprint(sum(1 if any([not i%k,not i%l,not i%m,not i%n]) else 0 for i in range(1,d)))\r\n#------------------------------------------\r\nif count_time:\r\n end_time = time.time()\r\n print('----------------\\nRunning time: {} s'\r\n .format(end_time - start_time))\r\n", "def main(arr, d):\r\n a = 0\r\n\r\n for i in range(d):\r\n for j in range(len(arr)):\r\n if (i + 1) % arr[j] == 0:\r\n a += 1\r\n break\r\n\r\n return a\r\n\r\nif __name__ == \"__main__\":\r\n k, l = int(input()), int(input())\r\n m, n = int(input()), int(input())\r\n\r\n d = int(input())\r\n\r\n print(main([k, l, m, n], d))", "multiples = []\r\nfor i in range(4):\r\n multiples.append(int(input()))\r\nk = int(input())\r\n\r\nvictims = [i + 1 for i in range(k) if [(i + 1)%item for item in multiples].count(0) > 0]\r\nprint(len(victims))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\nf=[]\r\nfor i in range(a, e+1, a):\r\n f.append(i)\r\nfor i in range(b, e+1, b):\r\n f.append(i)\r\nfor i in range(c, e+1, c):\r\n f.append(i)\r\nfor i in range(d, e+1, d):\r\n f.append(i)\r\nprint(len(set(f)))", "o=int(input())\r\np=int(input())\r\nq=int(input())\r\nr=int(input())\r\nd=int(input())\r\nc=0\r\nfor i in range(1,d+1):\r\n if i%o==0 or i%p==0 or i%q==0 or i%r==0:\r\n c+=1\r\nprint(c)\r\n", "k = int(input()) # k-th dragon punched\r\nl = int(input()) # l-th dragon tail shut\r\nm = int(input()) # m-th dragon paws trampled\r\nn = int(input()) # n-th dragon threatened\r\nd = int(input()) # Total number of dragons\r\n\r\ndamaged_dragons = 0\r\n\r\nfor i in range(1, d+1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n damaged_dragons += 1\r\n\r\nprint(damaged_dragons)\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nl=int(input())\r\ns=0\r\nfor i in range(1,l+1):\r\n if i%a!=0 and i%b!=0 and i%c!=0 and i%d!=0:\r\n s+=1\r\nprint(l-s)", "d1 = int(input()) \r\nd2 = int(input())\r\nd3 = int(input())\r\nd4 = int(input())\r\nd = int(input())\r\nharmed = 0\r\nfor i in range(1, d+1):\r\n if (i%d1 == 0) or (i%d2==0) or (i%d3 == 0) or (i%d4 == 0):\r\n harmed += 1\r\nprint(harmed)\r\n", "a,b,c,d,n=int(input()),int(input()),int(input()),int(input()),int(input());print(sum([1 for i in range(1,n+1) if i%a==0 or i%b==0 or i%c==0 or i%d==0]))", "k= int(input())\r\nl= int(input())\r\nm= int(input())\r\nn= int(input())\r\nd= int(input())\r\nres=0\r\nfor i in range (1,d+1):\r\n if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:\r\n res+=1\r\nprint(d-res)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ni = 1\r\nadd = 0\r\nwhile i<=d:\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:\r\n add+=1\r\n i+=1\r\n\r\nprint(add)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nhealthy = 0\r\nfor i in range(1, d+1):\r\n if (i % k != 0 and i % l != 0 and i % m != 0 and i % n != 0):\r\n healthy += 1\r\nprint(d-healthy)\r\n", "num=[]\r\ncount=0\r\nfor i in range(5):\r\n num.append(int(input()))\r\nif num[0]==1 or num[1]==1 or num[2]==1 or num[3]==1:\r\n print(num[4])\r\nelse:\r\n for i in range(1,num[4]+1):\r\n if i%num[0]==0 or i%num[1]==0 or i%num[2]==0 or i%num[3]==0:\r\n count+=1 \r\n print(count)\r\n \r\n ", "I= []\nfor i in range(4): \n I.append(int(input()))\nd= int(input())\nA= [0 for i in range(d+1)]\nfor i in I[:4]: \n for j in range(1, d+1): \n if j%i==0: \n A[j]=1\nprint(sum(A))", "#148A - Insomnia cure\r\nif __name__ == '__main__' :\r\n k, l, m, n, d = int(input()), int(input()), int(input()), int(input()),int(input())\r\n val = 0\r\n for x in range(1,d+1):\r\n if x % k == 0 or x % l == 0 or x % m == 0 or x % n == 0:\r\n val+= 1\r\n print(val)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\nx=0\r\nfor i in range(1,e+1):\r\n if(i%a!=0 and i%b!=0 and i%c!=0 and i%d!=0):\r\n \r\n x+=1\r\n\r\nprint(e-x)\r\n ", "def main():\r\n k = int(input())\r\n l = int(input())\r\n m = int(input())\r\n n = int(input())\r\n d = int(input())\r\n \r\n total = 0\r\n for u in range(1, d + 1):\r\n if u % k == 0 or u % l == 0 or u % m == 0 or u % n == 0:\r\n total += 1\r\n \r\n print(total)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "k = int(input()) # Condition k\r\nl = int(input()) # Condition l\r\nm = int(input()) # Condition m\r\nn = int(input()) # Condition n\r\nd = int(input()) # Total number of dragons\r\n\r\ndamaged_dragons = 0\r\n\r\nfor dragon in range(1, d + 1):\r\n if dragon % k == 0 or dragon % l == 0 or dragon % m == 0 or dragon % n == 0:\r\n damaged_dragons += 1\r\n\r\nprint(damaged_dragons)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nN=0\r\nfor a in range(1,d+1):\r\n if a%k==0:\r\n N+=1\r\n elif a%l==0:\r\n N+=1\r\n elif a%m==0:\r\n N+=1\r\n elif a%n==0:\r\n N+=1\r\nprint(N)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\nnum_vam = 0\n\nfor i in range(1,d+1):\n if i % k == 0:\n num_vam +=1\n elif i % l == 0:\n num_vam +=1\n elif i % m == 0:\n num_vam +=1\n elif i % n == 0:\n num_vam +=1\n\nprint(num_vam)\n\t\t \t\t \t \t \t\t \t \t \t", "def calculate_damaged_dragons(k, l, m, n, d):\r\n damaged_dragons = set()\r\n\r\n for i in range(1, d+1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n damaged_dragons.add(i)\r\n\r\n return len(damaged_dragons)\r\n\r\n# Input\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n# Calculate and output the result\r\nresult = calculate_damaged_dragons(k, l, m, n, d)\r\nprint(result)\r\n", "import math\nimport heapq\nimport sys\n\ndef input_arr():\n arr = [int(x) for x in input_string().split()]\n return arr\n\ndef input_n():\n n = int(input_string())\n return n\n\ndef sub_list(a,b):\n c = []\n for i in range(len(a)):\n c.append(a[i]-b[i])\n return c\n\ndef sub_const(a, c):\n b = []\n for x in a:\n b.append(x-c)\n return b\n\ndef binary_search(arr, low, high, x):\n if high >= low:\n mid = (high + low) // 2\n if arr[mid] == x:\n return mid\n elif arr[mid] > x:\n return binary_search(arr, low, mid - 1, x)\n else:\n return binary_search(arr, mid + 1, high, x)\n else:\n return -1\n \ndef printlist(a):\n for x in a:\n print(x, end = \" \")\n\ndef input_string():\n global mode\n if mode==0:\n return input()\n else:\n with open('/Users/aryan/Desktop/cp/test_case.txt') as f:\n lines = f.readlines()\n global line \n st = lines[line][:-1]\n line+=1\n return st\n\ndef solve():\n a = input_n()\n b = input_n()\n c = input_n()\n d = input_n()\n n = input_n()\n arr = []\n for i in range(n):\n arr.append(i+1)\n cnt = 0\n for i in range(n):\n if arr[i]%a==0 or arr[i]%b==0 or arr[i]%c==0 or arr[i]%d==0:\n cnt+=1\n print(cnt)\n\ndef solve_t():\n t = input_n()\n for l in range(t):\n n = input_n()\n a = []\n b = []\n for i in range(n):\n x, y = input_arr()\n a.append(x)\n b.append(y)\n l = []\n for i in range(n):\n l.append([a[i], 1, i+1])\n for i in range(n):\n l.append([b[i], 2, i+1])\n l.sort()\n f1 = []\n f2 = []\n\n visited = set()\n i = 0\n while len(visited)<n or len(f1)==0 or len(f2)==0:\n price, friend, dept = l[i]\n visited.add(dept)\n if friend==1:\n f1.append([price, dept])\n else:\n f2.append([price, dept])\n i+=1\n\n if f1[-1][1]==f2[-1][1]:\n a = abs(f1[-2][0]-f2[-1][0]) if len(f1)>1 else 100000000000000\n b = abs(f2[-2][0]-f1[-1][0]) if len(f2)>1 else 100000000000000\n diff = min(a, b)\n else:\n diff = abs(f1[-1][0]-f2[-1][0])\n\n while i<len(l):\n price, friend, dept = l[i]\n if friend==1:\n f1.append([price, dept])\n else:\n f2.append([price, dept])\n \n if f1[-1][1]==f2[-1][1]:\n a = abs(f1[-2][0]-f2[-1][0]) if len(f1)>1 else 100000000000000\n b = abs(f2[-2][0]-f1[-1][0]) if len(f2)>1 else 100000000000000\n diff = min(diff, min(a, b))\n else:\n diff = min(diff, abs(f1[-1][0]-f2[-1][0]))\n i+=1\n print(diff)\n\n \nline = 0 \nmode = 0\nif len(sys.argv)>1 and sys.argv[1]=='file':\n mode = 1\nsolve()", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nx = []\r\nfor i in range(1,d+1):\r\n if((i%k==0 or i%l==0 or i%m==0 or i%n==0) == False):\r\n x.append(i)\r\nprint(d - len(x))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nn=int(input())\r\ncount=0\r\nfor i in range(1,n+1):\r\n if i%a==0 or i%b==0 or i%c==0 or i%d==0:\r\n count+=1\r\nprint(count)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ng = [0] * (d + 1)\r\nfor i in range(k, d + 1, k):\r\n g[i] = 1\r\nfor i in range(l, d + 1, l):\r\n g[i] = 1\r\nfor i in range(m, d + 1, m):\r\n g[i] = 1\r\nfor i in range(n, d + 1, n):\r\n g[i] = 1\r\nprint(sum(g))\r\n", "L=[]\r\nL.append(int(input(\"\")))\r\nL.append(int(input(\"\")))\r\nL.append(int(input(\"\")))\r\nL.append(int(input(\"\")))\r\n\r\nx=int(input(\"\"))\r\nd=0\r\nfor i in range(1,x+1):\r\n if(i%L[0]==0 or i%L[1]==0 or i%L[2]==0 or i%L[3]==0):\r\n d=d+1\r\n \r\nprint(d)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\narr=[1]*d\r\nfor i in range(d):\r\n if (i+1)%k==0:\r\n arr[i]=0\r\n elif (i+1)%l==0:\r\n arr[i]=0\r\n elif (i+1)%m==0:\r\n arr[i]=0\r\n elif (i+1)%n==0:\r\n arr[i]=0\r\nprint(d-sum(arr))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 14 22:02:19 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\ncounter = 0\r\nattack=[]\r\nfor i in range(4):\r\n attack.append(int(input()))\r\ndragons=int(input())\r\nfor i in range(dragons):\r\n if (i+1) % attack[0] == 0 or (i+1) % attack[1] == 0 or (i+1) % attack[2] == 0 or (i+1) % attack[3] == 0:\r\n counter += 1\r\nprint(counter)", "ar = [int(input()) for i in range(5)]\nif 1 not in ar[:4]:\n S = set()\n for i in range(4):\n for j in range(ar[i], ar[4]+1, ar[i]):\n S.add(j)\n print(len(S))\nelse:\n print(ar[4])\n", "k,l,m,n,d=[int(input()) for i in range(5)]\r\nc=d\r\nfor i in range(1, c+1):\r\n\tif((i%k!= 0) and (i%l!=0) and (i%m!=0) and (i%n!=0)): c-=1\r\nprint(c)", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\ns = 0\r\nfor i in range(1, d + 1):\r\n if i % k == 0:\r\n s += 1\r\n elif i % l == 0:\r\n s += 1\r\n elif i % m == 0:\r\n s += 1\r\n elif i % n == 0:\r\n s += 1\r\nprint(s)", "a, b, c, d, e = int(input()), int(input()), int(input()), int(input()), int(input())\r\nq = [a, b, c, d]\r\ntotal = 0\r\nif 1 not in q:\r\n for i in range(2, e + 1):\r\n for k in q:\r\n if i % k == 0 and i >= k:\r\n total += 1\r\n break\r\n \r\n print (total)\r\nelse:\r\n print (e)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nsum=0\r\nfor i in range(1,d+1):\r\n if(i%k !=0 and i%l!=0 and i%m!=0 and i%n!=0):\r\n sum+=1\r\n # print(i)\r\nprint(d-sum)\r\n\r\n\r\n", "s = set()\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\na = k\r\nwhile a <= d:\r\n s.add(a)\r\n a += k\r\n\r\na = l\r\nwhile a <= d:\r\n s.add(a)\r\n a += l\r\n\r\na = m\r\nwhile a <= d:\r\n s.add(a)\r\n a += m\r\n\r\na = n\r\nwhile a <= d:\r\n s.add(a)\r\n a += n\r\n\r\nprint(len(s))", "k= int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nl1 = [None]*d\r\nfor i in range(d):\r\n l1[i]=i+1\r\nk1 = []\r\nfor j in range(1,d+1):\r\n if(j%k==0):\r\n k1.append(j)\r\n elif(j%l == 0):\r\n k1.append(j)\r\n elif(j%m==0):\r\n k1.append(j)\r\n elif(j%n==0):\r\n k1.append(j)\r\nprint(len(k1))", "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, l, m, n, d = int(input()), int(input()), int(\n input()), int(input()), int(input())\n count = 0\n for i in range(1, d + 1):\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\n count += 1\n print(count)\n\n\nif __name__ == \"__main__\":\n main()\n", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\nx=0\r\nfor i in range(1, d+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0:\r\n x+=1\r\nprint(x)", "x=int(input())\r\ny=int(input())\r\nz=int(input())\r\nm=int(input())\r\nn=int(input())\r\n\r\nc=0\r\nfor i in range(1,n+1):\r\n if i % x == 0 or i % y == 0 or i % z == 0 or i % m == 0:\r\n c+=1\r\nprint(c)", "def main():\r\n a = int(input())\r\n b = int(input())\r\n c = int(input())\r\n d = int(input())\r\n n = int(input())\r\n l = [a,b,c,d]\r\n \r\n for k in l:\r\n if k==1:\r\n print(n)\r\n return\r\n valid = set() \r\n for k in l:\r\n for j in [x for x in l if x != k]:\r\n if k%j == 0:\r\n valid.add(max(k,j))\r\n valid = [x for x in l if x not in valid]\r\n cas = 0 \r\n for k in range(1,n+1):\r\n for j in valid:\r\n if k%j == 0:\r\n cas += 1\r\n break\r\n print(cas)\r\n \r\n\r\nmain()", "*x,y=map(int,open(0))\r\nprint(sum(any(i%j==0 for j in x) for i in range(1,y+1)))", "*v,b=map(int,open(0))\r\nprint(sum(any(i%j==0 for j in v)for i in range(1,b+1)))\r\n#HI CODEFORCES\r\n#", "a=int(input())\r\nl=int(input())\r\nm=int(input())\r\nt=int(input())\r\nd=int(input())\r\np=0\r\nq=0\r\nfor i in range(1,d+1):\r\n if i%a==0 or i%l==0 or i%m==0 or i%t==0:\r\n q+=1\r\n else:\r\n p+=1\r\nprint(d-p) ", "n1 = int(input())\nn2 = int(input())\nn3 = int(input())\nn4 = int(input())\nn_dragons = int(input())\n\nl = len(set(range(n1, n_dragons + 1, n1)) | set(range(n2, n_dragons + 1, n2)) | set(range(n3, n_dragons + 1, n3)) | set(range(n4, n_dragons + 1, n4)))\n\nprint(l)\n", "# Online Python compiler to run Python online.\n# Write Python code in this online editor and run it.\n*a,d=map(int,open(0))\nprint(sum(any(i%j==0 for j in a)for i in range(1,d+1)))\n\t\t\t\t\t \t\t\t \t \t\t\t \t \t\t \t\t", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n k = int(input())\n l = int(input())\n m = int(input())\n n = int(input())\n d = int(input())\n divs = [k, l, m, n]\n ds = [True for i in range(d)]\n for i in range(4):\n ds = [False if ds[j] and (j + 1) % divs[i] ==\n 0 else ds[j] for j in range(d)]\n print(d - ds.count(True))\n\n\nif __name__ == \"__main__\":\n main()\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\n\r\nif min(a,b,c,d)==1:\r\n print(e)\r\nelse:\r\n k=0\r\n for i in range(e,0,-1):\r\n if i%a==0 or i%b==0 or i%c==0 or i%d==0:\r\n continue\r\n else:\r\n k+=1\r\n print(e-k)", "k,ll,m,n=int(input()),int(input()),int(input()),int(input())\r\na=int(input())\r\ncount=0\r\nfor i in range(1,a+1):\r\n if i%k!=0 and i%ll!=0 and i%m!=0 and i%n!=0:\r\n count+=1\r\nprint(a-count) ", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ni = 1\r\ncount = 0\r\nwhile(i<=d):\r\n if (i%k==0 or i%l==0 or i%m==0 or i%n==0):\r\n count = count + 1\r\n i = i + 1\r\nprint(count)", "l = []\r\nfor i in range(5):\r\n l.append(int(input()))\r\nm = l[4]\r\na = [1]*(m)\r\nfor i in range(0, 4):\r\n for j in range(0, m+1, l[i]):\r\n\r\n if j == 0:\r\n continue\r\n else:\r\n if a[j-1] == 1:\r\n a[j-1] = 0\r\n else:\r\n continue\r\n\r\nprint(m - a.count(1))\r\n", "from sys import stdin , stdout\r\nl = [int(input()) for _ in range(4)]; d = int(input()); count = 0\r\n\r\nfor i in range(1 , d+1):\r\n if i % l[0] != 0 and i % l[1] != 0 and i % l[2] != 0 and i % l[3] != 0: count += 1\r\nstdout.write(str(d - count))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nt=int(input())\r\nc1=0\r\nfor i in range(1,t+1):\r\n if(i%a==0 or i%b==0 or i%c==0 or i%d==0):\r\n c1+=1\r\nprint(c1)\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Codeforce\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1vkqd1IDYYeIi4VIH6yqQEhbS4qcGMzLO\n\"\"\"\n\nk = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\nescaped_dragon = 0\n\nfor i in range(1 , d + 1):\n if i % k != 0 and i % l != 0 and i % m != 0 and i % n != 0:\n escaped_dragon += 1\n\nprint(d - escaped_dragon)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ndragons_damage_list = [1 if (i+1)%k == 0 or (i+1)%l == 0 or (i+1)%m == 0 or (i+1)%n == 0 else 0 for i in range(d)]\r\nprint(dragons_damage_list.count(1))\r\n\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nc=0\r\nfor i in range(1,d+1):\r\n if (i)%k==0:\r\n c+=1\r\n elif (i)%l==0:\r\n c+=1\r\n elif (i)%m==0:\r\n c+=1\r\n elif (i)%n==0:\r\n c+=1 \r\n \r\nprint(c)", "i_th = []\r\nfor i in range(4):\r\n i_th.append(int(input()))\r\n\r\ni_th.sort()\r\ntotal = int(input())\r\n\r\ndragons = [x for x in range(1, total+1)]\r\n\r\nfor x in i_th:\r\n for y in range(total):\r\n if dragons[y] % x == 0:\r\n dragons[y] = 0\r\n \r\ncount = 0\r\n\r\nfor z in range(total):\r\n if dragons[z] == 0:\r\n count += 1\r\n\r\nprint(count)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nr=[]\r\nq=[]\r\nx=0\r\nfor i in range(1,d+1):\r\n q.append(i)\r\nfor i in range(d):\r\n x+= k\r\n if x <=d:\r\n \r\n r.append(x)\r\n else:\r\n x=0\r\n break\r\nfor i in range(d):\r\n x += l\r\n if x <=d:\r\n \r\n r.append(x)\r\n else:\r\n x=0\r\n break\r\nfor i in range(d):\r\n x += m\r\n if x <=d:\r\n \r\n r.append(x)\r\n else:\r\n x=0\r\n break\r\nfor i in range(d):\r\n x += n\r\n if x <=d:\r\n \r\n r.append(x)\r\n else:\r\n x=0\r\n break\r\nprint(len(set(r)))", "\r\ndef is_in_sequence(sequence, dragon):\r\n for s in sequence:\r\n if dragon % s == 0:\r\n return True\r\n\r\n return False\r\n\r\n\r\ndef solve():\r\n k = int(input())\r\n l = int(input())\r\n m = int(input())\r\n n = int(input())\r\n d = int(input())\r\n sequence = (k, l, m, n)\r\n if (sequence.count(1) > 0):\r\n return d\r\n\r\n dragons = set()\r\n for dragon in range(1, d + 1):\r\n if is_in_sequence(sequence, dragon):\r\n dragons.add(dragon)\r\n\r\n return len(dragons)\r\n\r\n\r\nprint(solve())\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ninputs=[k,l,m,n]\r\ndragons=[i for i in range(1,d+1)]\r\ndamaged=set()\r\nif any(i-1==0 for i in inputs):\r\n print(d)\r\nelse:\r\n for i in dragons:\r\n if any(i%j==0 for j in inputs):\r\n damaged.add(i)\r\n print(len(damaged))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\na = list(range(1,d+1))\r\nif k==1 or l==1 or m==1 or n==1: print(d)\r\nelse:\r\n A = set(a)\r\n K = set(list(range(k,d+1,k)))\r\n L = set(list(range(l,d+1,l)))\r\n M = set(list(range(m,d+1,m)))\r\n N = set(list(range(n,d+1,n)))\r\n print(d-len(A.difference(K,L,M,N)))", "import math\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ni = 1\r\npositions = []\r\nnum = 0\r\nwhile num < d:\r\n num = k * i\r\n if num > d:\r\n break\r\n positions.append(num)\r\n i += 1\r\nnum = 0\r\ni = 1\r\nwhile num < d:\r\n num = l * i\r\n if num > d:\r\n break\r\n positions.append(num)\r\n i += 1\r\nnum = 0\r\ni = 1\r\nwhile num < d:\r\n num = m * i\r\n if num > d:\r\n break\r\n positions.append(num)\r\n i += 1\r\nnum = 0\r\ni = 1\r\nwhile num < d:\r\n num = n * i\r\n if num > d:\r\n break\r\n positions.append(num)\r\n i += 1\r\npos = len(set(positions))\r\nprint(pos)\r\n\r\n\r\n\r\n", "t1 = int(input())\r\nt2 = int(input())\r\nt3 = int(input())\r\nt4 = int(input())\r\nt5 = int(input())\r\ntemp = 0\r\nfor z in range(1, t5 + 1):\r\n if z % t1 == 0 or z % t2 == 0 or z % t3 == 0 or z % t4 == 0:\r\n temp += 1\r\n\r\nprint(temp)\r\n", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\nif(k == 1 or l== 1 or m ==1 or n == 1):\n print(d)\nelse:\n counter = 0\n i = 1\n while i <= d:\n if(i%k==0 or i%l==0 or i%m == 0 or i%n==0):\n counter += 1\n i = i + 1\n\n print(counter)\n \t\t \t\t\t \t \t \t\t\t\t\t \t \t \t", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nc = d\r\nif k ==1 or l ==1 or m == 1 or n ==1 :\r\n print(d)\r\nelse:\r\n for i in range(1,d+1):\r\n if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:\r\n c-=1\r\n print(c)", "K, L, M, N, D = [int(input()) for _ in range(5)]\r\ndamaged_dragons = 0\r\nfor dragon in range(1, D + 1):\r\n if dragon % K == 0 or dragon % L == 0\\\r\n or dragon % M == 0 or dragon % N == 0:\r\n damaged_dragons += 1\r\nprint(damaged_dragons)\r\n", "a1 = int(input())\r\na2 = int(input())\r\na3 = int(input())\r\na4 = int(input())\r\nn = int(input())\r\nc = 0\r\nfor i in range(1,n+1):\r\n if i % a1 == 0:\r\n c += 1\r\n elif i % a2 == 0:\r\n c += 1\r\n elif i % a3 == 0:\r\n c += 1\r\n elif i % a4 == 0:\r\n c += 1\r\nprint(c)", "k, l, m, n = int(input()), int(input()), int(input()), int(input())\r\nd = int(input())\r\ns = set()\r\nfor i in range(1, d+1):\r\n if (i % k == 0) or (i % l == 0) or (i % m == 0) or (i % n == 0):\r\n s.add(i)\r\nprint(len(s))", "import math\r\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ndragons = []\r\nfor i in range(1, d + 1):\r\n dragons.append(i)\r\n\r\nk_dragons = []\r\nl_dragons = []\r\nm_dragons = []\r\nn_dragons = []\r\n\r\nfor j in range(1, d + 1):\r\n try:\r\n if j % k == 0:\r\n k_dragons.append(dragons[j-1])\r\n except IndexError:\r\n break\r\n\r\nfor a in range(1, d + 1):\r\n try:\r\n if a % l == 0:\r\n l_dragons.append(dragons[a-1])\r\n except IndexError:\r\n break\r\n\r\nfor b in range(1, d + 1):\r\n try:\r\n if b % m == 0:\r\n m_dragons.append(dragons[b-1])\r\n except IndexError:\r\n break\r\n\r\nfor c in range(1, d + 1):\r\n try:\r\n if c % n == 0:\r\n n_dragons.append(dragons[c-1])\r\n except IndexError:\r\n break\r\n\r\ntotal_dragons = set(k_dragons+l_dragons+m_dragons+n_dragons)\r\nprint(len(total_dragons))\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ns=0\r\nt=list(range(1,d+1))\r\nfor i in t :\r\n if (i%k ==0) or (i%l ==0) or (i%m ==0) or (i%n ==0):\r\n s+=1\r\nprint(s)", "def lcm(a,b):\r\n c=a*b\r\n while a%b!=0:\r\n a,b=b,a%b\r\n\r\n\r\n return c//b\r\n\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nN1=(d//k) +(d//l)+(d//m) +(d//n)\r\nN2=(d//lcm(k,l)) +(d//lcm(k,m))+(d//lcm(k,n)) +(d//lcm(l,m))+(d//lcm(l,n))+(d//lcm(n,m))\r\nN3=(d//lcm(lcm(k,l),m)) + (d//lcm(lcm(m,l),n))+(d//lcm(lcm(n,m),k))+(d//lcm(lcm(k,l),n))\r\nN4=(d//lcm(lcm(k,l),lcm(m,n)))\r\nprint(N1-N2+N3-N4)", "k, l, m, n, d = int(input()),int(input()),int(input()),int(input()),int(input())\r\nlst_r = [k, l, m, n]\r\nif 1 in lst_r:\r\n print(d)\r\nelse:\r\n lst_num = [int(i) for i in range(1, d+1)]\r\n count = 0\r\n for i in lst_num:\r\n if i % k != 0 and i % l != 0 and i % m != 0 and i % n != 0:\r\n count += 1\r\n print(d - count) \r\n \r\n", "\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\narr=set()\r\nfor i in range(1,d+1):\r\n if i%k ==0 or i%l==0 or i%m ==0 or i%n ==0:\r\n if i not in arr:\r\n arr.add(i)\r\nprint(len(arr))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\np = 0\r\nfor pp in range(1, d + 1):\r\n if pp % k == 0 or pp % l == 0 or pp % m == 0 or pp % n == 0:\r\n p += 1\r\n \r\nprint(p)\r\n", "\r\nk,l,m,n,d=( int(input()) for _ in range(5) )\r\na=0\r\nfor c in range(d):\r\n if (c+1)%k == 0 or (c+1)%l ==0 or (c+1)%m ==0 or (c+1)%n ==0:\r\n a+=1\r\n \r\nprint(a) \r\n\r\n ", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nx=[]\r\ni=1\r\nwhile i < d+1:\r\n if i%k==0:\r\n x.append(i)\r\n elif i%l==0:\r\n x.append(i)\r\n elif i%m==0:\r\n x.append(i)\r\n elif i%n==0:\r\n x.append(i)\r\n i+=1\r\nf=set(x)\r\nprint(len(f))", "# Read input values\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n# Initialize a set to store damaged dragon numbers\r\ndamaged_dragons = set()\r\n\r\n# Mark the dragons that suffered moral or physical damage\r\nfor i in range(1, d + 1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n damaged_dragons.add(i)\r\n\r\n# Output the number of damaged dragons\r\nprint(len(damaged_dragons))\r\n\r\n \r\n", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\nc = 0\r\nfor i in range(d):\r\n h = i + 1\r\n if h % k == 0 or h % l == 0 or h % m == 0 or h % n == 0:\r\n c += 1\r\nprint(c)", "punch = int(input())\ntail = int(input())\ntrampled = int(input())\ncall = int(input())\nd = int(input())\n\ndiv = 0\nfor i in range(1,d+1):\n if i%punch==0 or i%tail==0 or i%trampled==0 or i%call==0:\n div += 1\n \nprint(div)", "lst = [int(input()), int(input()), int(input()), int(input())]\r\nn = int(input())\r\nans = [0] * (n + 1)\r\nfor ratio in lst:\r\n for i in range(ratio, n + 1, ratio):\r\n ans[i] = 1\r\nprint(sum(ans))", "counter = 0\r\nk, l, m, n, d = int(input()),int(input()),int(input()),int(input()),int(input())\r\nd += 1\r\nx= [0] * d\r\ny = [1] * d\r\n\r\nif k == 1:\r\n print(d-1)\r\nelse:\r\n for i in (k,l,m,n):\r\n x[i::i] = y[i::i]\r\n print(sum(x[1:]))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\"\"\"\nA. Insomnia cure: constructive algorithms, implementation, math\n\ntime limit per test: 2 seconds\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\n«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.\nHowever, just counting dragons was boring as well, so she entertained herself at best she could.\nTonight she imagined that all dragons were here to steal her, and she was fighting them off.\nEvery k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door.\nEvery m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.\nHow many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?\n\nInput\nInput data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 10^5).\n\nOutput\nOutput the number of damaged dragons.\n\"\"\"\n\ndef insomnia_cure():\n k, l, m, n, d = (int(input()) for _ in range(5))\n o = 0\n for i in range(1, d + 1):\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\n o += 1\n print(o)\n\nif __name__ == '__main__':\n insomnia_cure()", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\nf=[]\r\nif (a==1)or(b==1)or(c==1)or(d==1):\r\n print(e)\r\nelse:\r\n for i in range(2,e+1):\r\n if ((i%a==0)or(i%b==0)or(i%c==0)or(i%d==0)):\r\n f.append(i)\r\n print(len(f))", "s=[]\r\nfor _ in range(4):\r\n s.append(int(input()))\r\nd = int(input())\r\np = 0\r\nfor i in range(1,d+1):\r\n if (i%s[0] != 0) and (i%s[1] != 0) and (i%s[2] != 0) and (i%s[3] != 0):\r\n p += 1\r\nprint(d - p)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nout=0\r\nfor i in range (1,d+1):\r\n flag=0\r\n if i%k==0:\r\n out+=1\r\n flag=1\r\n elif i%l==0 and flag==0:\r\n out+=1\r\n flag=1\r\n elif i%m==0 and flag==0:\r\n out+=1\r\n flag=1\r\n elif i%n==0 and flag==0:\r\n out+=1\r\n flag=1\r\nprint(out)", "hits = []\r\nrepeat = 1\r\nadd = []\r\nfor a in range(4):\r\n hits.append(int(input()))\r\ndragons = int(input())\r\nfor x in range(4):\r\n repeat = 1\r\n while(hits[x] * repeat <= dragons):\r\n add.append(hits[x] * repeat)\r\n repeat += 1\r\nprint(len(set(add)))", "x=int(input())\r\nx1=int(input())\r\nx2=int(input())\r\nx3=int(input())\r\nx4=int(input())\r\nc=0\r\nfor i in range(1,x4+1):\r\n if i%x!=0 and i%x1!=0 and i%x2!=0 and i%x3!=0 :c+=1\r\nprint(x4-c)", "li=[int(input())for i in range(4)]\r\nd1=int(input())\r\ncnt1=0\r\nfor i1 in range(1,d1+1):\r\n\tfor j1 in li:\r\n\t\tif i1%j1==0:\r\n\t\t\tcnt1+=1\r\n\t\t\tbreak\r\nprint(cnt1)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nli=[]\r\nif k==1 or l==1 or m==1 or n==1 :\r\n print(d)\r\nelse:\r\n for i in range(k, d+1, k):\r\n li.append(i)\r\n for i in range(l, d+1, l):\r\n li.append(i)\r\n for i in range(m, d+1, m):\r\n li.append(i)\r\n for i in range(n, d+1, n):\r\n li.append(i)\r\n s = set(li)\r\n print(len(s))\r\n\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nc1=0\r\nc2=0\r\nc3=0\r\nc4=0\r\nc5=0\r\nc6=0\r\nc7=0\r\nc8=0\r\nc9=0\r\nc10=0\r\nc11=0\r\nc12=0\r\nc13=0\r\nc14=0\r\nc15=0\r\nfor i in range(1,d+1):\r\n if (i%k==0):\r\n c1=c1+1\r\n \r\nfor i in range(1,1+d):\r\n if (i%l==0):\r\n c2=c2+1\r\n \r\nfor i in range(1,1+d):\r\n if (i%m==0):\r\n c3=c3+1\r\nfor i in range(1,1+d):\r\n if (i%n==0):\r\n c4=c4+1\r\nfor i in range(1,1+d):\r\n if (i%k==0 and i%l==0):\r\n c5=c5+1\r\nfor i in range(1,1+d):\r\n if (i%k==0 and i%m==0):\r\n c6=c6+1\r\nfor i in range(1,1+d):\r\n if (i%k==0 and i%n==0):\r\n c7=c7+1\r\nfor i in range(1,1+d):\r\n if (i%l==0 and i%m==0):\r\n c8=c8+1\r\nfor i in range(1,1+d):\r\n if (i%l==0 and i%n==0):\r\n c9=c9+1\r\nfor i in range(1,1+d):\r\n if (i%m==0 and i%n==0):\r\n c10=c10+1\r\nfor i in range(1,1+d):\r\n if(i%m==0 and i%l==0 and i%n==0 and i%k==0):\r\n c11=c11+1\r\nfor i in range(1,1+d):\r\n if(i%m==0 and i%n==0 and i%k==0):\r\n c12=c12+1\r\nfor i in range(1,1+d):\r\n if(i%m==0 and i%n==0 and i%l==0):\r\n c13=c13+1\r\nfor i in range(1,1+d):\r\n if(i%m==0 and i%l==0 and i%k==0):\r\n c14=c14+1 \r\nfor i in range(1,1+d):\r\n if(i%l==0 and i%n==0 and i%k==0):\r\n c15=c15+1 \r\n \r\nprint(c1+c2+c3+c4-c11-c5-c6-c7-c9-c8-c10+c12+c13+c14+c15) \r\n\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\ne = int(input())\r\nf1 = [i for i in range(1, e + 1)]\r\nj = 0\r\nfor i in f1:\r\n if i%a == 0 or i%b == 0 or i%c == 0 or i%d == 0:\r\n j += 1\r\nprint(j)\r\n \r\n ", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nans=0\r\nfor i in range(d):\r\n if(i+1)%k==0 or (i+1)%l==0 or (i+1)%n==0 or (i+1)%m==0:\r\n ans+=1\r\nprint(ans) ", "*q,e=[int(input())for i in' '*5];print(e-sum(all(i%x for x in q)for i in range(1,e+1)))", "import math\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\na=(d//k);b=(d//l);c=(d//m);f=(d//n);\r\nans=a+b+c+f-(d//math.lcm(k,l))-(d//math.lcm(l,m))-(d//math.lcm(n,m))-(d//math.lcm(k,n))-(d//math.lcm(k,m))-(d//math.lcm(l,n))-(d//math.lcm(k,math.lcm(l,math.lcm(m,n))))+(d//math.lcm(k,(math.lcm(l,m))))+(d//math.lcm(k,(math.lcm(l,n))))+(d//math.lcm(k,(math.lcm(n,m))))+(d//math.lcm(n,(math.lcm(l,m))));\r\nprint(str(ans))", "import sys\r\ndef read_input():\r\n return sys.stdin.readline().rstrip()\r\ndef funcion(num5,list1):\r\n list2 = [0] * num5\r\n for y in list1:\r\n for z in range(0,num5,y):\r\n if list2[z]:\r\n continue\r\n else:\r\n list2[z] = 1\r\n return list2.count(0)\r\nlist1 = []\r\nfor _ in range(4):\r\n list1.append(int(read_input()))\r\nnum5 = int(read_input()) + 1\r\nif 1 in list1:\r\n print(num5 - 1)\r\nelse:\r\n print(num5 - funcion(num5,list1) - 1)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\ndeath = 0\n\nfor vampire in range(1, d + 1):\n if vampire % k == 0 or vampire % l == 0 or vampire % m == 0 or vampire % n == 0:\n death += 1\n \nprint(death)\n\n#death here is just meant for the variable name, signalling the no. of damaged vampires\n\n\t\t\t\t \t \t\t\t \t \t\t \t \t\t \t\t", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\na = [0] * d\r\nfor i in range(k-1, d, k):\r\n a[i] = 1\r\nfor i in range(l-1, d, l):\r\n a[i] = 1\r\nfor i in range(m-1, d, m):\r\n a[i] = 1\r\nfor i in range(n-1, d, n):\r\n a[i] = 1\r\nprint(sum(a))\r\n \r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\ncounter=0\r\n\r\nfor x in range(1,d+1):\r\n if x % k == 0 or x % l ==0 or x % m == 0 or x % n == 0:\r\n counter+=1\r\nprint(counter)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nx= 0\r\n\r\nfor i in range(1,d+1):\r\n if i%k ==0 or i%l ==0 or i%m ==0 or i%n ==0:\r\n x+=1\r\nprint(x)\r\n\r\n\r\n\r\n\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ng=[]\r\nfor i in range(0,d+1,k):\r\n g.append(i)\r\nfor i in range(0,d+1,l):\r\n g.append(i)\r\nfor i in range(0,d+1,m):\r\n g.append(i)\r\nfor i in range(0,d+1,n):\r\n g.append(i)\r\nv=set(g)\r\nprint(len(v)-1)\r\n\r\n", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\nc = [0] * d\r\ncount = 0\r\nfor i in range(k-1, d, k):\r\n c[i] += 1\r\nfor i in range(l-1, d, l):\r\n c[i] += 1\r\nfor i in range(m-1, d, m):\r\n c[i] += 1\r\nfor i in range(n-1, d, n):\r\n c[i] += 1\r\nprint(sum(1 for j in c if j > 0))", "actions = []\r\nfor i in range(4):\r\n act = int(input())\r\n actions.append(act)\r\ncount = int(input())\r\ndragons = [0 for a in range(count)]\r\nfor i in actions:\r\n j = 0\r\n while j < len(dragons):\r\n if (j + 1) % i == 0:\r\n dragons[j] += 1\r\n j += 1\r\n\r\n\r\nprint(count - dragons.count(0))", "k,l,m,n,d=int(input()),int(input()),int(input()),int(input()),int(input())\r\nli=[]\r\nfor i in range(1,d+1):\r\n if i%k==0:\r\n li.append(i)\r\nfor i in range(1,d+1):\r\n if i%l==0:\r\n li.append(i)\r\nfor i in range(1,d+1):\r\n if i%m==0:\r\n li.append(i)\r\nfor i in range(1,d+1):\r\n if i%n==0:\r\n li.append(i)\r\nprint(len(set(li)))", "def main():\n damage_numbers = list()\n dragons_hurt = 0\n damage_numbers.append(int(input()))\n damage_numbers.append(int(input()))\n damage_numbers.append(int(input()))\n damage_numbers.append(int(input()))\n\n num_dragons = int(input())\n\n for dragon_num in range(num_dragons):\n for damage_number in damage_numbers:\n if (dragon_num + 1) % damage_number == 0:\n dragons_hurt += 1\n break\n\n print(dragons_hurt)\n\n\nif __name__ == \"__main__\":\n main()", "k, l, m, n, d = [int(input()) for i in range(5)]\r\n\r\nc = 0\r\nfor i in range(1, d+1):\r\n if any(map(lambda x: i%x == 0, [k,l,m,n])):\r\n c += 1\r\nprint(c)\r\n", "\n\ndef function(k,l,m,n,d):\n output=[]\n \n for number in range(1,d+1):\n if not (number%k==0 or number%l==0 or number%m==0 or number%n==0):\n output.append(number)\n \n print(d-len(output))\n \n \n \n \n \n \n \ndef main():\n \n k = int(input())\n l = int(input())\n m = int(input())\n n = int(input())\n d = int(input())\n \n \n function(k, l, m, n, d)\n\n\nif __name__ == \"__main__\":\n main()", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\ne = int(input())\r\nif a==1 or b==1 or c==1 or d==1:\r\n print(e)\r\nelse:\r\n k = 0\r\n for i in range(1,e+1):\r\n if i%a==0 or i%b==0 or i%c==0 or i%d==0:\r\n k+=1\r\n print(k)\r\n \r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nj = int(input())\r\nd = int(input())\r\ncount = 0\r\nfor i in range(1,d+1):\r\n if i % k != 0 and i % l != 0 and i % m != 0 and i %j != 0:\r\n count += 1\r\n \r\nprint(d-count)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\nans=0\n\nfor rep in range(1, d+1):\n if any([rep%k==0, rep%l==0, rep%m==0, rep%n==0]):\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", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\nx=e\r\nfor z in range(1,e+1):\r\n if z%a==0 or z%b==0 or z%c==0 or z%d==0:\r\n pass\r\n else:\r\n x-=1\r\nprint(x)", "k=int(input());l=int(input());m=int(input());n=int(input());d=int(input())\r\ncount=0\r\nfor i in range(1,d+1):\r\n if (i%k==0) or (i%l==0) or (i%m==0) or (i%n==0):\r\n count+=1\r\nprint(count)", "t=int(input())\r\nl=int(input())\r\nx=int(input())\r\ny=int(input())\r\nd=int(input())\r\nc=0\r\n\r\nfor i in range(1,d+1):\r\n if(i%t==0 or i %l==0 or i%x==0 or i%y==0):\r\n c+=1\r\nprint(c)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount = 0\r\nfor i in range(1,d+1):\r\n if (i%k==0):\r\n count = count + 1\r\n elif (i%l==0):\r\n count = count + 1\r\n elif (i%m==0):\r\n count = count + 1\r\n elif (i%n==0):\r\n count = count + 1\r\n else:\r\n pass\r\nprint(count)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\np=0\r\na = [0] * d\r\nj = [k, l , m ,n]\r\nfor i in j:\r\n for r in range(i,d+1,i):\r\n a[r-1]=1\r\n \r\n \r\nfor b in range(d):\r\n p+=a[b]\r\nprint(p)\r\n", "k_dragon = int(input())\r\nl_dragon = int(input())\r\nm_dragon = int(input())\r\nn_dragon = int(input())\r\ncol_dragons = int(input())\r\ndragons = [_ for _ in range(1, col_dragons + 1)]\r\nvictims_dragons = 0\r\n\r\nfor dragon in dragons:\r\n if dragon % k_dragon == 0:\r\n victims_dragons += 1\r\n continue\r\n elif dragon % l_dragon == 0:\r\n victims_dragons += 1\r\n continue\r\n elif dragon % m_dragon == 0:\r\n victims_dragons += 1\r\n continue\r\n elif dragon % n_dragon == 0:\r\n victims_dragons += 1\r\n continue\r\nprint(victims_dragons)\r\n\r\n\r\n", "def main():\r\n a=list()\r\n h=0\r\n a.append(int(input()))\r\n a.append(int(input()))\r\n a.append(int(input()))\r\n a.append(int(input()))\r\n nums=int(input())\r\n for num in range(nums):\r\n for k in a:\r\n if (num+1)%k==0:\r\n h+=1\r\n break\r\n print(h)\r\nif __name__ == \"__main__\":\r\n main()", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ndata = set()\r\n\r\nfor i in range(1, d+1):\r\n if (i%k == 0) or (i%l == 0) or (i%m == 0) or (i%n == 0):\r\n data.add(i)\r\n \r\nprint(len(data))", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nq=[k,l,m,n]\r\nx=0\r\nfor i in range (1,d+1):\r\n for j in q :\r\n if i%j!=0:\r\n continue\r\n else:\r\n break\r\n else: \r\n x+=1\r\nprint(d-x)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ndragons_list = [None]*d\r\n\r\nfor i in range(1,d+1):\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:\r\n dragons_list[i-1] = 1\r\nprint(d-dragons_list.count(None))\r\n\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\ntotal = int(input())\r\n\r\n\r\nif 1 in set([a, b, c, d]):\r\n print(total)\r\n\r\nelif [a, b, c, d] > [total, total, total, total]:\r\n print(0)\r\n\r\nelse:\r\n sum = 0\r\n for i in range(1, total+1):\r\n if i % a == 0:\r\n sum += 1\r\n elif i % b == 0:\r\n sum += 1\r\n elif i % c == 0:\r\n sum += 1\r\n elif i % d == 0:\r\n sum += 1\r\n print(sum)\r\n", "k, l, m, n, d =int(input()), int(input()), int(input()), int(input()), int(input())\r\nmylist = [k, l, m, n]\r\nnum_counter = 1; damged_dragons = 0\r\nwhile num_counter <= d:\r\n for num in mylist:\r\n if num_counter % num == 0:\r\n damged_dragons += 1\r\n break\r\n num_counter += 1\r\n\r\nprint(damged_dragons)", "k,l,m,n,d=map(int,[input() for i in range(5)])\r\na=set()\r\nk1,l1,m1,n1=k,l,m,n\r\nwhile(k<=d):\r\n\ta.add(k)\r\n\tk+=k1 \r\nwhile(l<=d):\r\n\ta.add(l)\r\n\tl+=l1 \r\nwhile(m<=d):\r\n\ta.add(m)\r\n\tm+=m1 \r\nwhile(n<=d):\r\n\ta.add(n)\r\n\tn+=n1 \r\nprint(len(a))", "dragons = []\r\nj = 0\r\n\r\nwhile j < 5:\r\n dragons.append(int(input()))\r\n j += 1\r\n\r\n\r\ncounter = 0\r\n\r\nfor i in range(1, dragons[-1] + 1):\r\n if any(i % dragon == 0 for dragon in dragons[0:4]):\r\n counter += 1\r\n\r\nprint(counter)\r\n", "ip=[]\r\nfor _ in range(5):\r\n ip.append(int(input()))\r\nk,l,m,n,d=ip\r\nif 1 in ip[:4]:\r\n print(d)\r\nelse:\r\n ret=0\r\n for i in range(1,d+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0:\r\n ret+=1\r\n print(ret)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nh = list(range(1, d+1))\r\nh1 = []\r\nfor i in range(d):\r\n if h[i] % k == 0 or h[i] % l == 0 or h[i] % m == 0 or h[i] % n ==0:\r\n h1.append(h[i])\r\nprint(len(h1))\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ndmg=0\r\nfor i in range(1,d+1,1):\r\n if (i%k==0) or (i%l==0) or (i%m==0) or (i%n==0):\r\n dmg=dmg+1\r\nprint(dmg)", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\na = set()\n[a.update(set(e)) for e in (range(k-1, d, k), range(l-1, d, l), range(m-1, d, m), range(n-1, d, n))]\n\nprint(len(a))\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n#ed=[k,l,m,n]\r\ndr=[]\r\ni=0\r\nwhile i<d:\r\n dr.append(1)\r\n i+=1\r\np=0\r\nwhile p+k<=d:\r\n dr[p+k-1]=0\r\n p+=k\r\np=0\r\nwhile p+l<=d:\r\n dr[p+l-1]=0\r\n p+=l\r\np=0\r\nwhile p+m<=d:\r\n dr[p+m-1]=0\r\n p+=m\r\np=0\r\nwhile p+n<=d:\r\n dr[p+n-1]=0\r\n p+=n\r\np=0\r\nfor i in dr:\r\n if i==0:\r\n p+=1\r\nprint(p)\r\n\r\n\r\n\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nnum=int(input())\r\ncount= 0\r\nfor i in range(1,num+1):\r\n if i%a== 0 or i%b== 0 or i%c== 0 or i%d== 0:\r\n count+= 1\r\nprint(count)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ndrgs = [1 for _ in range(d)]\r\narr = [k, l, m, n]\r\nfor i in range(1, d+1):\r\n if drgs[i-1] == 0:\r\n continue\r\n for let in arr:\r\n if i % let == 0:\r\n drgs[i-1] *= 0\r\nprint(d - sum(drgs))", "def hcf(a, b):\r\n while b:\r\n a, b= b, a%b\r\n return a\r\n\r\ndef lcm(a, b):\r\n a, b = max(a,b), min(a,b)\r\n return (a*b) // hcf(a,b)\r\n \r\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nlst = [k,l,m,n]\r\nif 1 in lst:\r\n print(d)\r\nelse:\r\n temp = lcm(lcm(k,l), lcm(m,n))\r\n print(d//k + d//l + d//m + d//n - ((d//lcm(k,l)) + (d//lcm(k,m)) + (d//lcm(k,n)) + (d//lcm(l,m)) + (d//lcm(l,n)) + (d//lcm(m,n))) + (d//lcm(k, lcm(l,m))) + (d//lcm(k, lcm(l,n))) + (d//lcm(k, lcm(m,n))) + (d//lcm(l, lcm(m,n))) - (d//lcm(lcm(k,l), lcm(m,n))))", "q = []\r\na = int(input())\r\nb = int(input())\r\nl = int(input())\r\nk = int(input()) \r\nd = int(input())\r\nfor i in range(1,d+1):\r\n if i % a == 0:\r\n q.append(i)\r\n elif i % b == 0:\r\n q.append(i)\r\n elif i % l == 0:\r\n q.append(i)\r\n elif i % k == 0:\r\n q.append(i)\r\nprint(len(q))", "from math import *\r\nk =int(input())\r\nl =int(input())\r\nm =int(input())\r\nn =int(input())\r\nd =int(input())\r\ndef lcm (*num):\r\n minimum = 1\r\n for i in num:\r\n minimum = i * minimum // gcd(i, minimum)\r\n return minimum\r\n\r\nres=(d//k\r\n +d//l\r\n -d//(lcm(k,l))\r\n +d//m\r\n -d//(lcm(k,m))\r\n -d//(lcm(l,m))\r\n +d//(lcm(k,l,m))\r\n +d//n\r\n -d //(lcm(k,n))\r\n -d //(lcm(l,n))\r\n -d //(lcm(m,n))\r\n +d //(lcm(k,l,n))\r\n +d //(lcm(k,m,n))\r\n +d //(lcm(l,m,n))\r\n -d //(lcm(k,l,m,n))\r\n)\r\nprint(res)\r\n", "z = [int(input()) for x in range(4)]\r\ncount = 0\r\nd = int(input())\r\nfor i in range(1 , d + 1) :\r\n if i % z[0] == 0 or i % z[1] == 0 or i % z[2] == 0 or i % z[3] == 0 :\r\n continue\r\n else : \r\n count += 1\r\nprint(d - count)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nck = 0\r\ncl = 0\r\ncm = 0\r\ncn = 0\r\nfinal = 0\r\ni = 0\r\nwhile i<d:\r\n \r\n for i in range(1,d+1):\r\n if i%k == 0:\r\n ck = ck +1 \r\n elif i%l == 0 :\r\n cl = cl+1\r\n elif i%m == 0 :\r\n cm= cm+1\r\n elif i%n == 0 :\r\n cn = cn+1\r\n\r\n final = ck + cl+cm+cn\r\n print(final)", "factors = []\r\nfor x in range(4):\r\n factors.append(int(input()))\r\ntotal = int(input())\r\nans = 0\r\nfor x in range(1, total + 1):\r\n for factor in factors:\r\n if x % factor == 0:\r\n ans += 1\r\n break\r\nprint(ans)\r\n ", "list=[]\r\nfor i in range(4):\r\n list.append(int(input()))\r\nn=int(input())\r\nnum=set()\r\nfor i in range(4):\r\n shu=list[i]\r\n former=list[i]\r\n while shu<=n :\r\n num.add(shu)\r\n shu+=former\r\nprint(len(num))", "k=int(input())\r\nj=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nl=[]\r\nc=0\r\nfor i in range(1,d+1):\r\n l.append(i)\r\nfor i in range(d): \r\n if l[i]%k==0:c+=1\r\n elif l[i]%j==0:c+=1\r\n elif l[i]%m==0:c+=1\r\n elif l[i]%n==0:c+=1\r\nprint(c)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\narr = [i+1 for i in range(d)]\r\n\r\nfor i in range(d):\r\n if arr[i] % k == 0 or arr[i] % l == 0 or arr[i] % m == 0 or arr[i] % n == 0:\r\n arr[i] = -1\r\n\r\nprint(arr.count(-1))\r\n", "e,f,g,h,m=map(int,(input() for i in range(5)))\nl=0\nfor i in range(1,m+1):\n if i%e and i%f and i%g and i%h:\n continue\n else:\n l+=1\nprint(l)\n \t \t \t \t \t \t\t\t\t\t\t \t\t \t\t \t", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nif k==1 or l==1 or m==1 or n==1:\r\n print(d)\r\nelse:\r\n c=0\r\n for j in range(1,d+1):\r\n if j%k!=0 and j%l!=0 and j%m!=0 and j%n!=0:\r\n continue\r\n else:c+=1\r\n print(c)\r\n ", "w=[]\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nw.extend([k,l,m,n])\r\nr=0\r\nfor d1 in range(d+1):\r\n for w1 in w:\r\n if d1%w1==0 and d1!=0:\r\n r+=1\r\n break\r\nprint(r)", "k,l,m,n,d=[int(input()) for i in range(5)]\r\nfor i in range(d):\r\n x=i+1\r\n if x%k!=0 and x%l!=0 and x%m!=0 and x%n!=0:\r\n d-=1\r\nprint(d)\r\n", "a = []\r\nfor i in range(4):\r\n a.append(int(input()))\r\n\r\nd = int(input())\r\nif 1 in a:\r\n print(d)\r\n exit()\r\ntmp = [False for _ in range(d + 1)]\r\n\r\nfor i in a:\r\n t = i\r\n while t <= d:\r\n tmp[t] = True\r\n t += i\r\nres = 0\r\nfor i in tmp:\r\n if i:\r\n res += 1\r\n\r\nprint(res)", "import sys\r\n\r\nk = int(sys.stdin.readline().split()[0])\r\nl = int(sys.stdin.readline().split()[0])\r\nm = int(sys.stdin.readline().split()[0])\r\nn = int(sys.stdin.readline().split()[0])\r\nd = int(sys.stdin.readline().split()[0])\r\n\r\ninjured_dragons = [0 for i in range(d)]\r\n\r\nindex_k = k - 1\r\nindex_l = l - 1\r\nindex_m = m - 1\r\nindex_n = n - 1\r\n\r\ni = 0\r\n\r\nwhile i < d:\r\n if index_k <= d - 1:\r\n injured_dragons[index_k] = 1\r\n if index_l <= d - 1:\r\n injured_dragons[index_l] = 1\r\n if index_m <= d - 1:\r\n injured_dragons[index_m] = 1\r\n if index_n <= d - 1:\r\n injured_dragons[index_n] = 1\r\n\r\n index_k += k\r\n index_l += l\r\n index_n += n\r\n index_m += m\r\n\r\n i += 1\r\n\r\nprint(sum(injured_dragons))", "w = int(input())\r\nx = int(input())\r\ny = int(input())\r\nz = int(input())\r\nq = int(input())\r\ns = 0\r\nfor i in range(1,q + 1):\r\n if i % w == 0 or i % x == 0 or i % y == 0 or i % z == 0:\r\n s += 1\r\nprint(s)", "damages = []\r\nfor _ in range(4):\r\n damages.append(int(input()))\r\nd = int(input())\r\ndamaged = set()\r\nfor damage in damages:\r\n for dragon in range(1,d+1):\r\n if not dragon%damage and dragon not in damaged:\r\n damaged.add(dragon)\r\nprint(len(damaged))\r\n", "from collections import *\r\n# from math import ceil, gcd,inf\r\nfrom functools import *\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\nZ=5\r\narr=[]\r\nfor _ in range(Z):\r\n arr.append(int(input()))\r\nlist1=list(range(1,arr[-1]+1)) \r\nlist1=[0]+list1 \r\nprint(len(set(list1[arr[0]::arr[0]]+list1[arr[1]::arr[1]]+list1[arr[2]::arr[2]]+list1[arr[3]::arr[3]])))\r\n \r\n ", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nlistd=[]\r\nfor i in range(1,d+1,1):\r\n listd.append(i)\r\nunh = []\r\nfor j in listd:\r\n if j%k!=0:\r\n if j % l != 0:\r\n if j % m != 0:\r\n if j % n != 0:\r\n unh.append(i)\r\nprint(len(listd)-len(unh))", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\nsimp = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\ndef main():\r\n k = int(input())\r\n l = int(input())\r\n m = int(input())\r\n n = int(input())\r\n d = int(input())\r\n cnt = 0\r\n for i in range(1, d+1, 1):\r\n if i % l == 0 or i % k == 0 or i % m == 0 or i % n == 0:\r\n cnt += 1\r\n print(cnt)\r\nif __name__ == \"__main__\":\r\n main()", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nv = int(input())\r\nn = int(input())\r\na1 = []\r\nb1 = []\r\nc1 = []\r\nv1 = []\r\nfor i in range(1,n+1):\r\n if i%a == 0:\r\n a1.append(i)\r\n elif i%b == 0:\r\n b1.append(i)\r\n elif i%c == 0:\r\n c1.append(i)\r\n elif i%v == 0:\r\n v1.append(i)\r\nprint(len(set(a1+b1+c1+v1)))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nnums = [num for num in range(1, d+1) if num % k != 0 and num % l != 0 and num % m != 0 and num % n != 0]\r\nprint(d-len(nums))\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\na = [0]*d\r\nans = 0\r\n\r\nfor i in range(1, d+1):\r\n if(i%k == 0 or i %l ==0 or i % m == 0 or i%n == 0):\r\n ans = ans +1 \r\n\r\nprint(ans)", "import sys\ninput = sys.stdin.readline()\nk = int(input)\ninput = sys.stdin.readline()\nl = int(input)\ninput = sys.stdin.readline()\nm = int(input)\ninput = sys.stdin.readline()\nn = int(input)\ninput = sys.stdin.readline()\nd = int(input)\n\narr = [False] * (1 + d)\nfor i in range(k, d + 1, k):\n arr[i] = True\nfor i in range(l, d + 1, l):\n arr[i] = True\nfor i in range(m, d + 1, m):\n arr[i] = True\nfor i in range(n, d + 1, n):\n arr[i] = True\nres = 0\nfor a in arr:\n if a:\n res += 1\nprint(res)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\ntotal = [0]*d\nfor i in range(d):\n total[i] = i+1\nharmed = []\nfor i in total:\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:\n harmed.append(1)\nprint(len(harmed))\n \t\t\t \t \t \t \t \t \t\t\t\t \t\t", "k,l,m,n,d = int(input()),int(input()),int(input()),int(input()),int(input())\r\ndiv = [k,l,m,n]\r\ncnt = 0\r\nfor i in range(1,d+1):\r\n for j in div:\r\n if i%j == 0:\r\n cnt += 1\r\n break\r\nprint(cnt)", "\r\ndef number():\r\n return(list(map(int,input().split())))\r\ndef strinp():\r\n return(list(input().split()))\r\n\r\ndef lcms(x, y):\r\n if x > y:\r\n greater = x\r\n else:\r\n greater = y\r\n while(True):\r\n if((greater % x == 0) and (greater % y == 0)):\r\n lcm = greater\r\n break\r\n greater += 1\r\n return lcm\r\n\r\n\r\nA=number()[0]\r\nB=number()[0]\r\nC=number()[0]\r\nD=number()[0]\r\ntot=number()[0]\r\n\r\ndef P(a,b,c=None):\r\n if c:\r\n return(tot//(lcms(lcms(a,b),c)))\r\n else:\r\n return(tot//lcms(a,b))\r\naa=tot//A\r\nbb=tot//B\r\ncc=tot//C\r\ndd=tot//D\r\n\r\nans = aa+bb+cc+dd-P(A,B)-P(A,C)-P(A,D)- P(B,C)-P(B,D)-P(C,D)+P(A,B,C)+P(A,B,D)+P(A,C,D)+P(B,C,D)-tot//(lcms(lcms(A,B),lcms(C,D)))\r\nprint(int(ans))", "ans=[]\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nk=int(input())\r\nfor i in range(a,k+1,a):\r\n if i<=k:\r\n ans+=[i]\r\nfor i in range(b,k+1,b):\r\n if i<=k:\r\n ans+=[i]\r\nfor i in range(c,k+1,c):\r\n if i<=k:\r\n ans+=[i]\r\nfor i in range(d,k+1,d):\r\n if i<=k:\r\n ans+=[i]\r\nprint(len(list(set(ans))))\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nlis=[]\r\nfor i in range(1,(d+1)):\r\n lis.append(i)\r\ncopy=[]\r\nfor i in lis:\r\n if (i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0):\r\n copy.append(i)\r\n\r\nprint(len(lis)-len(copy))", "cnt=0\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ncnt=d\r\nif k==0 or l==0 or m==0 or n==0:\r\n print(d)\r\nelse:\r\n for i in range(1,d+1):\r\n if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:\r\n cnt-=1\r\n print(cnt)\r\n \r\n ", "arr = [int(input()) for i in range(4)]\r\nn = int(input())\r\n\r\nans = 0\r\nfor i in range(1, n+1):\r\n for j in arr:\r\n if i % j == 0:\r\n ans += 1\r\n break\r\n \r\nprint(ans)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\nf = int(input())\r\ng = 0\r\nfor i in range(1, f + 1):\r\n if a == 1 or (a != 1 and i % a == 0) or i % b == 0 or i % c == 0 or i % d == 0:\r\n g += 1\r\n\r\nprint(g)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount = 0\r\nfor c in range(d, 0, -1):\r\n if c % k == 0 or c % l == 0 or c % m == 0 or c % n == 0:\r\n count += 1\r\nprint(count)\r\n", "a = int(input());b = int(input());c = int(input());d = int(input());e = int(input())\r\nres = 0\r\nfor i in range(1, e+1):\r\n if i % a == 0 or i % b == 0 or i % c == 0 or i % d == 0:res += 1\r\nprint(res)", "l = [int(input()) for d in range(5)]\r\ncounter = 0\r\ndragons = [i for i in range(1, l[-1]+1)]\r\nfor i in range(4):\r\n for j in range(l[i]-1, l[-1], l[i]):\r\n if dragons[j] > 0:\r\n counter += 1\r\n dragons[j] = -1\r\nprint(counter)\r\n", "\r\ndiv = [ int(input()) for i in range(4) ]\r\nnum = int(input())\r\n\r\ndef get_arr(arr):\r\n div = sorted(list(set(arr)))\r\n new = [arr[0]]\r\n \r\n for i in range(1 , 4):\r\n is_div = False \r\n for ele in new :\r\n if arr[i]%ele == 0 :\r\n is_div = True\r\n break\r\n if not is_div :\r\n new.append(arr[i] )\r\n \r\n return new\r\n\r\ndef func(div , num):\r\n \r\n div = get_arr( div )\r\n if div[0] == 1:\r\n print(num)\r\n return;\r\n \r\n s = 0\r\n \r\n for i in range(1 , num+1):\r\n \r\n is_div = 0 \r\n for ele in div:\r\n if i % ele == 0 :\r\n is_div = 1 \r\n break\r\n \r\n s += is_div\r\n \r\n print(s)\r\n\r\nfunc(div , num)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n# print(k,l,m,n,d,dragon)\r\ndragon = [1]*(d+1)\r\ncount = 0\r\n\r\nfor i in range(k, d+1, k):\r\n dragon[i] = 0\r\nfor i in range(l, d+1, l):\r\n dragon[i] = 0\r\nfor i in range(m, d+1, m):\r\n dragon[i] = 0\r\n\r\nfor i in range(n, d+1, n):\r\n dragon[i] = 0\r\n\r\nfor it in dragon:\r\n if it == 0:\r\n count += 1\r\n\r\n\r\nprint(count)\r\n", "def solve(k,l,m,n,d):\r\n ans=0\r\n for i in range(1,d+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0:\r\n ans+=1\r\n print(ans)\r\n\r\ndef main():\r\n\r\n k=int(input())\r\n l=int(input())\r\n m=int(input())\r\n n=int(input())\r\n d=int(input())\r\n solve(k,l,m,n,d)\r\nmain()", "alist = [] * 5\r\nfor i in range(5):\r\n alist.append(int(input()))\r\nk, li, m, n, d = alist\r\nalist = [i for i in range(1, d + 1)]\r\nans = 0\r\nfor value in alist:\r\n if value % k == 0:\r\n ans += 1\r\n elif value % li == 0:\r\n ans += 1\r\n elif value % m == 0:\r\n ans += 1\r\n elif value % n == 0:\r\n ans += 1\r\n\r\nif ans <= d:\r\n print(ans)\r\nelse:\r\n print(d)\r\n", "k, l, m, n, d = map(int, (input(),input(),input(),input(),input()))\r\nlst = []\r\n\r\nfor i in range(1, d+1):\r\n if i % k != 0 and i % l != 0 and i % m != 0 and i % n != 0:\r\n lst.append(i)\r\n\r\nprint(d-len(lst))", "\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ncount = 0 \r\n\r\nfor num in reversed(range(1, d+1)):\r\n if num % k == 0 or num % l == 0 or num % m == 0 or num % n == 0:\r\n count += 1\r\n \r\n \r\nprint(count)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne,z=int(input()),0\r\nfor i in range(1,e+1):\r\n if i%a==0 or i%b==0 or i%c==0 or i%d==0:\r\n z+=1\r\nprint(z)", "Uno = int(input())\r\nDos = int(input())\r\nTres = int(input())\r\nCuatro = int(input())\r\nTotal = int(input())\r\ncount = 0\r\nArray = []\r\n\r\nfor i in range(Total):\r\n if (i + 1) % Uno == 0 or (i + 1) % Dos == 0 or (i + 1) % Tres == 0 or (i + 1) % Cuatro == 0:\r\n count = count + 1\r\n\r\nprint(count)\r\n\r\n", "# x=[int(input()) for i in range(4)]\r\n# d=int(input())\r\n# dictt={}\r\n# for p in range(1,d+1):\r\n# \tdictt[p]=0\r\n\r\n# for j in x:\r\n# \ta=j\r\n# \twhile a<=d:\r\n# \t\tdictt[a]+=1\r\n# \t\ta+=j\r\n# y=0\r\n# for i in dictt:\r\n# \tif dictt[i]==0:\r\n# \t\ty+=1\r\n# print(d-y)\r\nl = [int(input()) for i in range(4)]\r\nm = int(input())\r\nprint(len(set([i for i in range(1, m+1) for j in l if i % j == 0])))", "def main():\r\n k, l, m, n, d = [int(input()) for _ in range(5)]\r\n count = 0\r\n if 1 in (k, l, m, n):\r\n print(d)\r\n return\r\n count = d\r\n for i in range(1, d+1):\r\n if i % k and i % l and i % m and i % n:\r\n count -= 1\r\n print(count)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "# 148A - Insomnia Cure\r\n# https://codeforces.com/problemset/problem/148/A\r\n\r\n# Inputs:\r\n# 1) k = k-ésimo dragón atacado con sartén \r\n# 2) l = l-ésimo dragón arrojado al balcón \r\n# 3) m = m-ésimo dragón aplastado con tacón \r\n# 4) n = n-ésimo dragón que huyó\r\n# 5) Número de dragones\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\ndragones = int(input())\r\n\r\n# Lista de dragones atacados con sartén (k)\r\ndragones_k = []\r\n\r\n# Saca los dragones atacados con sartén (k)\r\nfor d in range(k,dragones+1,k):\r\n dragones_k.append(d)\r\n\r\n# Lista de dragones arrojados al balcón (l)\r\ndragones_l = []\r\n\r\n# Saca los dragones arrojados al balcón (l)\r\nfor d in range(l,dragones+1,l):\r\n dragones_l.append(d)\r\n\r\n# Lista de dragones aplastados con tacón (m)\r\ndragones_m = []\r\n\r\n# Saca los dragones aplastados con tacón (m)\r\nfor d in range(m,dragones+1,m):\r\n dragones_m.append(d)\r\n\r\n# Lista de dragones que huyeron (n)\r\ndragones_n = []\r\n\r\n# Saca los dragones que huyeron (n)\r\nfor d in range(n,dragones+1,n):\r\n dragones_n.append(d)\r\n\r\n# Saca la unión de las 4 listas \r\n# La unión (U) eliminará los duplicados\r\n# Cuenta cuántos dragones fueron atacados\r\ndragones_atacados = len(list(set(dragones_k) | set(dragones_l) | set(dragones_m) | set(dragones_n)))\r\n\r\n# Imprime el número de dragones atacados\r\nprint(dragones_atacados)\r\n\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nl1=[]\r\nfor i in range(1,d+1):\r\n if(i%k==0) or (i%l==0) or (i%m==0) or (i%n==0):\r\n l1.append(i)\r\nprint(len(l1))\r\n \r\n ", "#### Решение задач проекта CODEFORSES, Задача 148A\r\n#\r\n# (C) 2023 Артур Ще, Москва, Россия\r\n# Released under GNU Public License (GPL)\r\n# email [email protected]\r\n# -----------------------------------------------------------\r\n\r\n'''\r\nA. Средство от бессонницы\r\nограничение по времени на тест2 seconds\r\nограничение по памяти на тест256 megabytes\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\n«Раз дракон. Два дракон. Три дракон», — считала принцесса. У нее была бессонница, а считать барашков ей надоело еще в\r\nдевять лет.\r\n\r\nВпрочем, считать драконов просто так тоже было скучно, поэтому она развлекалась как могла. Этой ночью она представляла,\r\nчто все посчитанные драконы явились сюда, чтобы ее украсть, а она отбивается от них, как может. Каждого k-ого дракона \r\nона била сковородкой по морде. Каждому l-ому — прищемляла хвост балконной дверью. Каждому m-ому — наступала на лапу\r\nострым каблучком. Наконец, каждому n-ому она грозила позвать мамочку, и он в ужасе ретировался.\r\n\r\nСкольким воображаемым драконам успела нанести моральный или физический ущерб принцесса, если всего она насчитала d драконов?\r\n\r\nВходные данные\r\nВходные данные содержат целые числа k, l, m, n и d, каждое число в отдельной строке (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).\r\n\r\nВыходные данные\r\nВыведите количество пострадавших драконов.\r\n'''\r\n\r\na1=int(input())\r\na2=int(input())\r\na3=int(input())\r\na4=int(input())\r\naall=int(input())\r\npos = 0\r\nfor q in range(1,aall+1):\r\n if q % a1 == 0:\r\n pos=pos+1\r\n continue\r\n if q % a2 == 0:\r\n pos=pos+1\r\n continue\r\n if q % a3 == 0:\r\n pos=pos+1\r\n continue\r\n if q % a4 == 0:pos=pos+1\r\nprint(pos)\r\n", "a = int(input())\nb = int(input())\nc = int(input())\nd = int(input())\ne = int(input())\n\ncount = 0\nfor i in range(1,e+1):\n if (i%a == 0 or i%b == 0 or i%c == 0 or i%d == 0):\n count+=1\nprint(count) \n\n \t\t \t\t\t\t\t\t \t \t \t\t \t \t\n \t \t \t\t \t\t\t\t\t\t \t\t \t\t \t\t \t \t", "k, l, m, n, d = [int(input()) for _ in range(5)]\r\nresult = sum(1 for i in range(1, d + 1) if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0)\r\nprint(result)\r\n", "k = int(input()) # k-th dragon gets punched\r\nl = int(input()) # l-th dragon gets tail shut\r\nm = int(input()) # m-th dragon gets paws trampled\r\nn = int(input()) # n-th dragon withdraws in panic\r\nd = int(input()) # Total number of dragons\r\n\r\ndamaged_dragons = 0 # Initialize the count of damaged dragons\r\n\r\nfor dragon in range(1, d + 1):\r\n if dragon % k == 0 or dragon % l == 0 or dragon % m == 0 or dragon % n == 0:\r\n damaged_dragons += 1\r\n\r\nprint(damaged_dragons)\r\n", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\nc = 0\nfor i in range(1,d+1):\n if i%k == 0 or i%l == 0 or i%m ==0 or i%n == 0:\n c = c+1\nprint(c)\n \t\t \t\t \t\t\t \t\t \t \t\t\t\t \t\t \t", "n=[int(input()) for x in range(5)]\r\nd=n.pop()\r\na=[0]*(d+1)\r\nfor x in n:\r\n a[::x]=[1]*len(a[::x])\r\nprint(sum(a)-1)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\nkList = []\nlList = []\nmList = []\nnList = []\ncountNot = 0\nfor i in range(k, d + 1, k):\n kList.append(i)\nfor i in range(l, d + 1, l):\n lList.append(i)\nfor i in range(m, d + 1, m):\n mList.append(i)\nfor i in range(n, d + 1, n):\n nList.append(i)\ntotalList = kList + lList + mList + nList\nmodifiedList = list(set(totalList))\nprint(len(modifiedList))", "count = 0\nvar_list = []\n\nwhile count != 5:\n b = int(input())\n var_list.append(b)\n count +=1\n\nd = var_list.pop(4)\ndamage = 0\nfor i in range(1, d+1):\n for j in var_list:\n if i%j == 0:\n damage += 1\n break\nprint(damage)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\na = [i for i in range(1, d+1)]\nb=[]\n\nfor i in a:\n if i%k==0:\n b.append(i)\n elif i%l==0:\n b.append(i)\n elif i%m==0:\n b.append(i)\n elif i%n==0:\n b.append(i)\n \n\n\nprint(len(b))\n\t \t \t \t \t \t \t \t \t \t \t", "c = 0\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nif (k or l or m or n) == 1 :\r\n print(d)\r\nelse :\r\n for i in range(1,d+1) :\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0 :\r\n c+=1 \r\n print(c)\r\n", "# Read input\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n# Initialize the counter for damaged dragons\r\ndamaged_count = 0\r\n\r\n# Iterate through each dragon\r\nfor dragon in range(1, d + 1):\r\n if dragon % k == 0 or dragon % l == 0 or dragon % m == 0 or dragon % n == 0:\r\n damaged_count += 1\r\n\r\n# Print the number of damaged dragons\r\nprint(damaged_count)\r\n", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\nt = [False] * d\r\ncount = 0\r\nfor i in range(d):\r\n if (i + 1) % k == 0 or (i + 1) % l == 0 or (i + 1) % m == 0 or (i + 1) % n == 0:\r\n t[i] = True\r\n count += 1\r\nprint(count)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nattacked = 0\r\nif k == 1 or l == 1 or m == 1 or n == 1:\r\n print(d)\r\nelse:\r\n for i in range(1, d+1):\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:\r\n attacked +=1\r\n print(attacked)\r\n", "\ndef solve():\n k = int(input())\n l = int(input())\n m = int(input())\n n = int(input())\n d = int(input())\n\n cnt = [0] * (d + 1)\n for i in range(k, d + 1, k): cnt[i] = 1\n for i in range(l, d + 1, l): cnt[i] = 1\n for i in range(m, d + 1, m): cnt[i] = 1\n for i in range(n, d + 1, n): cnt[i] = 1\n\n print(sum(cnt))\n\n\nif __name__ == '__main__':\n solve()\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nlista = [k,l,m,n]\r\nres = []\r\nfor x in range(1,d+1):\r\n for f in lista:\r\n if (x%f) == 0:\r\n res.append(x)\r\n break\r\n else:\r\n pass\r\n\r\nprint(len(res))", "pan = int(input())\r\nbalcony = int(input())\r\nheels = int(input())\r\nmom = int(input())\r\nnum_dragons = int(input())\r\n\r\ndamaged_dragons = 0\r\nfor dragon in range(1, num_dragons + 1):\r\n if dragon % pan == 0 or dragon % balcony == 0 or dragon % heels == 0 or dragon % mom == 0:\r\n damaged_dragons += 1\r\nprint(damaged_dragons)", "# URL: https://codeforces.com/problemset/problem/148/A\n\nimport io\nimport os\nimport sys\n\ninput_buffer = io.BytesIO(os.read(0, os.fstat(0).st_size))\ninp = lambda: input_buffer.readline().rstrip(b\"\\n\").rstrip(b\"\\r\")\nout = sys.stdout.write\n\nk, l, m, n = int(inp()), int(inp()), int(inp()), int(inp())\nans = 0\nfor i in range(1, int(inp()) + 1):\n if i % k and i % l and i % m and i % n:\n continue\n ans += 1\nprint(ans)\n", "#!/usr/local/bin/python\n\nk = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\nli = []\nfor i in range(1,d+1):\n if i%k == 0:\n li.append(i)\n if i%l == 0:\n li.append(i)\n if i%m == 0:\n li.append(i)\n if i%n == 0:\n li.append(i)\n\nprint(len(set(li)))\n", "n = [int(input()) for _ in range(4)]\r\nprint(sum(any([not t % y for y in n]) for t in range(1, int(input()) + 1)))\r\n", "# Read input values\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n# Initialize a variable to count damaged dragons\r\ndamaged_dragons = 0\r\n\r\n# Loop through all dragons from 1 to d\r\nfor i in range(1, d + 1):\r\n # Check each condition and increment the count if true\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n damaged_dragons += 1\r\n\r\n# Output the result\r\nprint(damaged_dragons)\r\n", "from functools import reduce\r\n\r\n\r\ndef main() :\r\n print(count_Of_Damaged_Dragons(input_Threat_Gaps(), input_Dragon_Count()))\r\n\r\n\r\ndef count_Of_Damaged_Dragons(threat_gaps, dragon_count) :\r\n return is_Dragon_Alives(threat_gaps, dragon_count).count(False)\r\n\r\ndef is_Dragon_Alives(threat_gaps, dragon_count) :\r\n return reduce(check_Deaded_Dragons, threat_gaps, initial_Is_Dragon_Alives(dragon_count))\r\n\r\ndef initial_Is_Dragon_Alives(dragon_count) :\r\n return [None] + [True] * dragon_count\r\n\r\ndef check_Deaded_Dragons(is_dragon_alives, threat_gap) :\r\n for dead_index in range(threat_gap, len(is_dragon_alives), threat_gap) :\r\n is_dragon_alives[dead_index] = False\r\n return is_dragon_alives\r\n\r\n\r\ndef input_Threat_Gaps() :\r\n return [input_Num() for _ in range(4)]\r\n\r\ndef input_Dragon_Count() :\r\n return input_Num()\r\n\r\ndef input_Num() :\r\n return int(input())\r\n\r\n\r\nmain()", "l=[]\r\nc=0\r\ncount=0\r\nfor a in range(5):\r\n n=int(input())\r\n l.append(n)\r\n if n==1:\r\n c=1\r\nif l[4]<l[0] or l[4]<l[1] or l[4]<l[2] or l[4]<l[3]:\r\n print(\"0\")\r\nelif c==1:\r\n print(l[4])\r\nelse:\r\n for i in range(1,l[4]+1):\r\n if i%l[0]==0 or i%l[1]==0 or i%l[2]==0 or i%l[3]==0:\r\n count+=1\r\n print(count)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nn=int(input())\r\nl=[]\r\nfor i in range(1,n+1):\r\n if (i%a==0) or (i%b==0) or (i%c==0) or (i%d==0):\r\n l.append(i)\r\nprint(len(l))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\ns=0\r\nfor i in range(1,e+1):\r\n if i%a==0 or i%b==0 or i%c==0 or i%d==0:\r\n s+=1\r\nprint(s)\r\n", "\"\"\"\r\ninp1 = lambda: map(int,input().split())\r\ninp2 = lambda: list(map(int,input().split()))\r\n\"\"\"\r\n\r\n\"\"\"\r\n$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\r\n\"\"\"\r\n\r\nmod = 10**9 + 7\r\n\r\ninp1 = lambda: map(int,input().split())\r\ninp2 = lambda: list(map(int,input().split()))\r\n\r\ndef compute_gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n \r\ndef compute_lcm(x, y):\r\n lcm = (x*y)//compute_gcd(x,y)\r\n return lcm\r\n\r\n\"\"\"\r\n$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\r\n\"\"\"\r\n \r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ncount = 0\r\nfor i in range(1, d + 1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n count += 1\r\n \r\nprint(count)", "# 李城岳生命科学学院 2300012106\r\nklmn = []\r\ndragons = []\r\nfor i in range(4):\r\n klmn.append(int(input()))\r\ndra = int(input())\r\nfor i in range(dra):\r\n dragons.append(0)\r\nfor i in klmn:\r\n tic = dra//i\r\n for e in range(1, tic+1):\r\n dragons[e*i-1] = 1\r\nprint(sum(dragons))", "if __name__ == \"__main__\":\r\n \r\n arr = [int(input()), int(input()), int(input()), int(input())]\r\n d = int(input())\r\n myArr = [0] * d\r\n \r\n for num in arr:\r\n value = num\r\n while value < d + 1:\r\n myArr[value-1] = value\r\n value += num\r\n result = 0\r\n for i in myArr:\r\n if i > 0:\r\n result += 1\r\n print(result)\r\n ", "a=int(input())\nb=int(input())\nc=int(input())\nd=int(input())\ne=int(input())\ncount=0\nfor i in range(1,e+1):\n if(i%a==0 or i%b==0 or i%c==0 or i%d==0):\n count+=1\nprint(count)\n\t\t \t\t\t \t\t \t \t\t\t\t\t \t\t \t \t \t", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nlis = [i for i in range(1, d+1)]\r\nres = 0\r\n\r\nfor i in lis:\r\n if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:\r\n res+=1\r\nprint(d-res)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nans=0\r\nfor i in range(1,d+1,1):\r\n if i%k==0:\r\n ans+=1\r\n elif i%l==0:\r\n ans+=1\r\n elif i%m==0:\r\n ans+=1\r\n elif i%n==0:\r\n ans+=1\r\nprint(ans)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nl1=[False]*d\r\nfor i in range(1, d+1):\r\n if(i%k==0 or i%l==0 or i%n==0 or i%m==0):\r\n l1[i-1]=True\r\nprint(l1.count((True)))", "kk=int(input())\r\nl=int(input())\r\nmn=int(input())\r\nn=int(input())\r\nd=int(input())\r\nhel = sum(\r\n 1 \r\n for i in range(1,d+1)\r\n if i % kk!=0 and i % l!=0 and i % mn!=0 and i % n!=0\r\n )\r\nprint(d-hel)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ndragon = {}\r\nfor i in range(0,d+1,k):\r\n if dragon.get(i) == None:\r\n dragon[i] = 1\r\n else:\r\n dragon[i] += 1\r\nfor i in range(0,d+1,l):\r\n if dragon.get(i) == None:\r\n dragon[i] = 1\r\n else:\r\n dragon[i] += 1\r\nfor i in range(0,d+1,m):\r\n if dragon.get(i) == None:\r\n dragon[i] = 1\r\n else:\r\n dragon[i] += 1\r\nfor i in range(0,d+1,n):\r\n if dragon.get(i) == None:\r\n dragon[i] = 1\r\n else:\r\n dragon[i] += 1\r\nans = (len(dragon) - 1)\r\nprint(ans)", "*a,p=map(int,open(0))\r\nprint(sum(any(i%j==0 for j in a)for i in range(1,p+1)))", "if __name__ == \"__main__\":\n hit = 0\n k = int(input())\n l = int(input())\n m = int(input())\n n = int(input())\n d = int(input())\n\n dragons = [0]\n dragons += [False for _ in range(d)]\n\n for i in range(k, d+1, k):\n dragons[i] = True\n\n for i in range(l, d+1, l):\n dragons[i] = True\n\n for i in range(m, d+1, m):\n dragons[i] = True\n\n for i in range(n, d+1, n):\n dragons[i] = True\n\n print(dragons.count(True))", "damage1 = int(input())\r\ndamage2 = int(input())\r\ndamage3 = int(input())\r\ndamage4 = int(input())\r\ntotalDragons = int(input())\r\n\r\n# List of the damaged positions so we can loop through it.\r\ndamagedPosition = [damage1, damage2, damage3, damage4]\r\n\r\n# Loop will remove duplicate numbers\r\nc = 0 \r\ngoAhead = True\r\nwhile(goAhead):\r\n position = damagedPosition[c]\r\n \r\n if damagedPosition.count(position) > 1:\r\n # if the number is >1, it's a dup and will be deleted.\r\n del damagedPosition[c]\r\n if damagedPosition.count(position) == 1:\r\n # if the number is == 1, it's unique and we move on to the next number.\r\n c += 1\r\n if c >= len(damagedPosition):\r\n # if we've gone through all the index values, we exit the loop.\r\n goAhead = False\r\n \r\n\r\ndamagedPosition.sort()\r\n\r\nc = 0 # counter for position 1.\r\nn = 1 # counter for position 2.\r\n# We divide position 2 by position 2 to see if position 1 is a common factor of position 2. If it is, we remove the value at position 2.\r\n\r\ngoAhead = True\r\nwhile(goAhead):\r\n # Was getting an error if the list had 4 duplicate numbers. This checks to see if we have only 1 number in the list, and if we do, then we break out of the loop.\r\n if len(damagedPosition) == 1:\r\n break\r\n\r\n lastNumber = False # we set this to false at the start. If we get to the beginning of the loop, it means we still have index values with [c] to loop through. Ie: we haven't tested the entire list for [c] yet.\r\n \r\n # Set up the variables we will use to look for common factors.\r\n position1 = damagedPosition[c]\r\n position2 = damagedPosition[n]\r\n \r\n # if p1 is a common factor of p2, remove p2 and loop again. By deleting p2, the number at p2[n+1] will take its place.\r\n if position2 % position1 == 0:\r\n del damagedPosition[n]\r\n \r\n else: \r\n # if p1 is not a common factor of p2, then we move on to the next number in the list and compare that number to p1 at [c]\r\n n += 1\r\n \r\n if n >= len(damagedPosition):\r\n # When we get to the end of the list, we increase the index value of C and we move N back to C+1 and restart the comparison.\r\n c += 1\r\n n = c + 1\r\n lastNumber = True # this means that [n] has reached the end of the list. Only if [c] has also reached the end will we stop the loop.\r\n \r\n if c+1 >= (len(damagedPosition)) and lastNumber == True:\r\n # Essentially we want to make sure that C has gone through all the numbers before we exit the loop. Because C is zero index based, we add 1 to it. The last c index value of the string is always going to be 1 less than the length of the string. So we need to add 1 to C to compensate for this. \r\n goAhead = False\r\n c = 0\r\n n = 0\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n# First, let's make a list full of empty strings as long as the totalDragons variable.\r\ndamagedDragons = [\"O\"] * totalDragons # O will mean a dragon is OK.\r\n\r\n# Next, we need to loop through each each index value and check whether that position is divisible by the damage type. We will compare the damagedPosition index value at 0 to every damagedDragons index value.\r\n\r\ndd = 0 # index value counter for damagedDragons.\r\ndp = 0 # index value counter for damagedPosition List.\r\n\r\n\r\ngoAhead = True\r\nwhile (goAhead):\r\n\r\n damageType = damagedPosition[dp]\r\n\r\n if (dd + 1) % damageType == 0:\r\n damagedDragons[dd] = \"D\"\r\n dd += 1 # moves on to the next dragon's position\r\n\r\n if dd == len(damagedDragons):\r\n dd = 0 # reset the dd index counter\r\n dp += 1 # increase the dp index counter\r\n # In other words, once we look at all the dragons in the list to see if they are affected by the damage position \"DP\" value, we move onto the next \"DP\" value in the loop.\r\n\r\n if dp >= len(damagedPosition):\r\n goAhead = False\r\n # If the \"DP\" counter is equal to the length of the list, or greater, then we have examined all the DP position values against all of the damaged dragon positions and we close the loop.\r\n\r\noutput = damagedDragons.count(\"D\") # count the number of damaged dragons.\r\n\r\nprint(output) # print the answer.\r\n\r\n\"\"\"\r\nThe first time I submitted this answer was here:\r\nhttps://codeforces.com/problemset/submission/148/226796658\r\n\r\nAfter analyzing this problem I think there are a few ways to improve performance:\r\n\r\n#1, we should have a section that tests whether any of the damagePosition values is = 1. If so, we don't even need to loop through anything because we know every dragon will take damage, so the output is equal to the sum of all dragons.\r\n\r\n#2, we should have a section that removes any duplicate damagePosition values, if there are any. This way we aren't doing the same work twice.\r\n\r\n#3, it might be faster to make the damagedDragons List into a series of numbers based on the position in the list rather than \"O\"s and turning them into \"D\"s. We could cycle through the list and look for values that have a % == 0, and then remove them from the list. This way, each time we loop through the list we're scanning a smaller and smaller set of numbers. For each position we delete, we'd want to add 1 to a counter representing the total number of dragons affected by damage and then output that number. I think this would be much faster, especially if we have a damage type like 2 which is going to remove 1/2 of the dragons anyway.\r\n\r\nInstead of doing another problem tomorrow, I think I'll try and redo this problem. The codeforces judge indicated my program's longest run time was 342 ms with a memory of 640 KB.\r\n\"\"\"\r\n", "first = int(input())\r\nsecond = int(input())\r\nthird = int(input())\r\nforth = int(input())\r\ncount = int(input()) \r\nall = 0\r\nfor i in range(1,count + 1):\r\n if i % first == 0 or i % second == 0 or i % third == 0 or i % forth == 0:\r\n all += 1\r\nprint(all)", "K = int(input(\"\"))\r\nL = int(input(\"\"))\r\nM = int(input(\"\"))\r\nN = int(input(\"\"))\r\nD = int(input(\"\"))\r\ncount = 0\r\nfor i in range(1,D+1):\r\n if i % K == 0 or i % L == 0 or i % M == 0 or i % N == 0 :\r\n count = count + 1 \r\n\r\nprint(count)", "def insomnia_cure ():\r\n k = int(input())\r\n l = int(input())\r\n m = int(input())\r\n n = int(input())\r\n d = int(input())\r\n dragon_damaged = 0\r\n for i in range (1,d+1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n dragon_damaged += 1\r\n return dragon_damaged\r\ndef main ():\r\n print(insomnia_cure())\r\nmain()\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nf = [k, l, m, n]\r\nprint(sum(any(i%j==0 for j in f)for i in range(1,d+1)))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\na = [0 for i in range(d+1)]\r\nfor i in range(k, d+1, k):\r\n a[i] = 1\r\nfor i in range(l, d+1, l):\r\n a[i] = 1\r\nfor i in range(m, d+1, m):\r\n a[i] = 1\r\nfor i in range(n, d+1, n):\r\n a[i] = 1\r\nprint(sum(a))\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ns=0\r\nfor i in range(1,d+1):\r\n for j in [k,l,m,n]:\r\n if i%j==0:\r\n s=s+1\r\n break\r\nprint(s)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\ne = int(input())\r\nfinal = []\r\nn=0\r\nwhile True:\r\n n = n + a\r\n if(n>e):\r\n break\r\n final.append(n)\r\nn=0\r\nwhile True:\r\n n = n + b\r\n if(n>e):\r\n break\r\n final.append(n)\r\nn=0\r\nwhile True:\r\n n = n + c\r\n if(n>e):\r\n break\r\n final.append(n)\r\nn=0\r\nwhile True:\r\n n = n + d\r\n if(n>e):\r\n break\r\n final.append(n)\r\n\r\nprint(len(set(final)))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount = 0\r\nfor nm in range(1,d+1):\r\n if nm%k==0 or nm%l==0 or nm%m==0 or nm%n==0:\r\n count += 1 \r\nprint(count)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nout=[]\r\nfor v in (range(1,d+1)):\r\n\tif v%k!=0 and v%l!=0 and v%m!=0 and v%n!=0:\r\n\t\tout.append(v)\r\nprint(d-len(out))", "k,l,m,n,d = int(input()),int(input()),int(input()),int(input()),int(input())\r\nc = d\r\nfor i in range(1,d+1):\r\n if (i % k and i % l and i % m and i % n):\r\n c -=1\r\nprint(c)", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x))\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10\r\n# from functools import cmp_to_key\r\n\r\np=[]\r\nfor i in range(4):\r\n p.append(int(input()))\r\nd=int(input())\r\nN=d+10\r\nst=[0]*N\r\nfor i in range(4):\r\n x=p[i]\r\n while x<=d:\r\n st[x]=1\r\n x+=p[i]\r\ncnt=0\r\nfor i in range(1,d+1):\r\n cnt+=st[i]\r\nprint(cnt)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nh = 0\r\nfor x in range(1, d+1):\r\n if x%k == 0 or x%l == 0 or x%m == 0 or x%n == 0:\r\n h += 1\r\nprint(h)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\ntotal = int(input())\r\nlistOfKDragons = []\r\nlistOfLDragons = []\r\nlistOfMDragons = []\r\nlistOfNDragons = []\r\nif k == 1 or l == 1 or m == 1 or n == 1:\r\n print(total)\r\nelse:\r\n i = k\r\n while i <= total and i != 1:\r\n listOfKDragons.append(i)\r\n i += k\r\n i = l\r\n while i <= total and i != 1:\r\n listOfLDragons.append(i)\r\n i += l\r\n i = m\r\n while i <= total and i != 1:\r\n listOfMDragons.append(i)\r\n i += m\r\n i = n\r\n while i <= total and i != 1:\r\n listOfNDragons.append(i)\r\n i += n\r\n print(len(list(set(listOfKDragons + listOfLDragons + listOfMDragons + listOfNDragons))))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\nk = int(input())\r\nsum1 = 0\r\nfor i in range(1, k + 1):\r\n if i % a == 0:\r\n sum1 += 1\r\n elif i % b == 0:\r\n sum1 += 1\r\n elif i % c == 0:\r\n sum1 += 1\r\n elif i % d == 0:\r\n sum1 += 1\r\nprint(sum1)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nh = sum(1 \r\n for i in range(1, d+1) \r\n if (i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0)\r\n )\r\nprint(d-h)", "def f(data):\r\n suffers = 0\r\n for i in range(1,data[-1]+1):\r\n if i%data[0] == 0 or i%data[1] == 0 or i%data[2] == 0 or i%data[3] == 0:\r\n suffers += 1 \r\n return suffers\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndata = []\r\nfor i in range(5):\r\n temp = int(input())\r\n data.append(temp)\r\nprint(f(data))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nhealthy = sum(\r\n 1\r\n for i in range(1,d+1)\r\n if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0\r\n ) \r\nprint(d-healthy)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\na = [0]*d\n\nfor i in range(1, d + 1):\n if any(i % j == 0 for j in (k, l, m, n)):\n a[i - 1] += 1\nprint(sum(bool(i) for i in a))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n\r\nlk = [i for i in range(d+1) if i%k == 0 and i!=0]\r\nll = [i for i in range(d+1) if i%l == 0 and i!=0]\r\nlm = [i for i in range(d+1) if i%m == 0 and i!=0]\r\nln = [i for i in range(d+1) if i%n == 0 and i!=0]\r\n\r\nx = lk + ll + lm + ln\r\n\r\nres = len(list(dict.fromkeys(x)))\r\nprint(res)\r\n", "from sys import stdin, stdout\r\ninput = lambda: stdin.readline().rstrip()\r\nprint = lambda *args, **kwargs: stdout.write(*args, **kwargs)\r\no = [int(input()) for _ in range(5)]\r\nprint(str(len(set((int(i) for i in range(1, o[-1]+1) if any(i % j == 0 for j in o[:-1]))))))", "f_p = int(input())\ns_d = int(input())\nnail = int(input())\nab = int(input())\nn_d = int(input())\ns = []\nfor i in range(f_p, n_d+1,f_p):\n s.append(i)\nfor i in range(s_d, n_d+1,s_d):\n s.append(i)\nfor i in range(nail, n_d+1,nail):\n s.append(i)\nfor i in range(ab, n_d+1,ab):\n s.append(i)\n\nprint(len(set(s)))\n\t\t \t \t \t\t\t \t \t\t \t\t \t\t", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\n\r\ndef lcm (a,b):\r\n return (a*b)//gcd(a,b)\r\n\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\n# K U L U M U N = K + L + M + N - K ∩ L - K ∩ M - K ∩ N - L ∩ M - L ∩ N - M ∩ N \r\n# + K ∩ L ∩ M + K ∩ L ∩ N + K ∩ M ∩ N + L ∩ M ∩ N - K ∩ L ∩ M ∩ N\r\n# ans is equal to K U L U M U N\r\n\r\nans=0\r\n\r\nans+=d//k\r\nans+=d//l\r\nans+=d//m\r\nans+=d//n\r\n\r\n\r\n\r\nans-=d//lcm(k,l)\r\nans-=d//lcm(k,m)\r\nans-=d//lcm(k,n)\r\nans-=d//lcm(l,m)\r\nans-=d//lcm(l,n)\r\nans-=d//lcm(m,n)\r\n\r\n\r\nans+=d//lcm(lcm(k,l),m)\r\nans+=d//lcm(lcm(k,l),n)\r\nans+=d//lcm(lcm(k,m),n)\r\nans+=d//lcm(lcm(l,m),n)\r\n\r\nans-=d//lcm(lcm(lcm(k,l),m),n)\r\n\r\nprint(ans)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nway = [0] * (d+1)\r\nfor ind,x in enumerate(way):\r\n if ind % k == 0 or ind % l == 0 or ind % m == 0 or ind % n == 0:\r\n way[ind] = 1\r\nprint(way.count(1)-1)", "a=4*[0]\r\nfor i in range(4):\r\n a[i]=int(input())\r\nn=int(input())\r\ns=0\r\nfor i in range(1,n+1):\r\n f=0\r\n for j in range(4):\r\n if i%a[j]==0:\r\n f=1\r\n break\r\n if f:\r\n s+=1\r\nprint(s)", "import sys\r\n*A,d = map(int,sys.stdin.read().split())\r\n\r\nc = 0\r\nfor i in range(1,d+1):c += any((i%p==0) for p in A)\r\n\r\nprint(c)\r\n\r\n", "arr = []\r\nfor _ in range(5):\r\n arr.append(int(input()))\r\ncounter = 0\r\nfor i in range(1, arr[-1]+1):\r\n if i%arr[0]==0 or i%arr[1]==0 or i%arr[2]==0 or i%arr[3]==0:\r\n counter += 1\r\nprint(counter)", "def main(k, l, m, n, d):\r\n a = 0\r\n\r\n for i in range(d):\r\n for el in [k, l, m, n]:\r\n if (i + 1) % el == 0:\r\n a += 1\r\n break\r\n\r\n return a\r\n\r\nif __name__ == \"__main__\":\r\n k, l = int(input()), int(input())\r\n m, n = int(input()), int(input())\r\n\r\n d = int(input())\r\n\r\n print(main(k, l, m, n, d))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nl1 = [0]*d\r\ni = 1\r\nwhile(k*i<=d or l*i<=d or m*i<=d or n*i<=d):\r\n if k*i<=d:\r\n l1[k*i -1]=1\r\n if l*i<=d:\r\n l1[l*i -1]=1\r\n if m*i<=d:\r\n l1[m*i -1]=1\r\n if n*i<=d:\r\n l1[n*i -1]=1\r\n i+=1\r\nprint(l1.count(1))", "k = int(input())\r\nl = int(input())\r\nm =int(input())\r\nn = int(input())\r\nd = int(input())\r\nr = 0\r\nfor i in range(1,d+1):\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:\r\n r+=1\r\nprint(r)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n# print(k,l,m,n,d,dragon)\r\n\r\ncount = 0\r\n\r\n# for i in range(k, d+1, k):\r\n# dragon[i] = 0\r\n# for i in range(l, d+1, l):\r\n# dragon[i] = 0\r\n# for i in range(m, d+1, m):\r\n# dragon[i] = 0\r\n\r\n# for i in range(n, d+1, n):\r\n# dragon[i] = 0\r\n\r\n# for it in dragon:\r\n# if it == 0:\r\nfor i in range(1,d+1):\r\n if i%k == 0 or i % l == 0 or i%m == 0 or i % n == 0:\r\n count += 1\r\n\r\n\r\nprint(count)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\npath = [0] * (d+1)\r\nfor ind,x in enumerate(path):\r\n if ind % k == 0 or ind % l == 0 or ind % m == 0 or ind % n == 0:\r\n path[ind] = 1\r\nprint(path.count(1)-1)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nx=[0]*d\r\nfor i in range(k,d+1,k):\r\n x[i-1]=1\r\nfor i in range(l,d+1,l):\r\n x[i-1]=1\r\nfor i in range(n,d+1,n):\r\n x[i-1]=1\r\nfor i in range(m,d+1,m):\r\n x[i-1]=1\r\nprint(d-x.count(0))", "*k,h = map(int,open(0))\r\nprint(sum(any(i % j == 0 for j in k)\r\nfor i in range(1, h + 1)))", "nums=[]\r\nfor i in range(5):\r\n nums.append(int(input()))\r\nvis=[0]*(nums[-1]+1)\r\nfor i in range(4):\r\n for x in range(nums[i],nums[-1]+1,nums[i]):\r\n vis[x]=1\r\nans=0\r\nfor i in range(1,nums[-1]+1):\r\n if vis[i]:\r\n ans+=1\r\nprint(ans)\r\n", "#«Раз дракон. Два дракон. Три дракон», — считала принцесса. У нее была бессонница, а считать барашков ей надоело еще в девять лет.\r\n#Впрочем, считать драконов просто так тоже было скучно, поэтому она развлекалась как могла. Этой ночью она представляла, что все посчитанные драконы явились сюда, чтобы ее украсть, а она отбивается от них, как может. Каждого k-ого дракона она била сковородкой по морде. Каждому l-ому — прищемляла хвост балконной дверью. Каждому m-ому — наступала на лапу острым каблучком. Наконец, каждому n-ому она грозила позвать мамочку, и он в ужасе ретировался.\r\n#Скольким воображаемым драконам успела нанести моральный или физический ущерб принцесса, если всего она насчитала d драконов?\r\n#148A\r\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\notv = [0]*d\r\nfor i in range(k-1, d, k):\r\n otv[i] = 1\r\nfor i in range(l-1, d, l):\r\n otv[i] = 1\r\nfor i in range(m-1, d, m):\r\n otv[i] = 1\r\nfor i in range(n-1, d, n):\r\n otv[i] = 1\r\n \r\n\r\nprint(sum(otv))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\np = 0\r\nwhile d > 0:\r\n if d % n == 0 or d % m == 0 or d % l == 0 or d % k == 0:\r\n p += 1\r\n d -= 1\r\nprint(p)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\nhurt = [False]*(d+1)\nflag = False\nif k==1:\n flag = True\n print(d)\nelse:\n for num in range(k,d+1,k):\n hurt[num] = True\n if l%k==0:\n pass\n else:\n for j in range(l,d+1,l):\n hurt[j] = True\n if m%k==0 or m%l==0:\n pass\n else:\n for i in range(m,d+1,m):\n hurt[i] = True\n if n%k==0 or n%l==0 or n%m ==0:\n pass\n else:\n for gg in range(n,d+1,n):\n hurt[gg] = True\nif flag == False:\n print(hurt.count(True))\n \t \t \t \t \t\t \t\t \t\t\t \t \t \t \t", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nkq = 0\r\nfor i in range(1,d+1):\r\n if (i % k == 0) or (i % l == 0) or (i % m == 0) or (i % n == 0):\r\n kq += 1\r\nprint(kq)\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nd_d=0\r\nfor dragon in range(1,d+1):\r\n if dragon%k==0 or dragon%l==0 or dragon%m==0 or dragon%n==0:\r\n d_d+=1\r\nprint(d_d)\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nj=int(input())\r\nd=int(input())\r\n\r\nindr= [0 for i in range(d)]\r\n\r\nik = k-1\r\nil = l-1\r\nim = m-1\r\nij = j-1\r\n\r\ni=0\r\n\r\nwhile i < d:\r\n if ik <= d-1:\r\n indr[ik] = 1\r\n if il <= d-1:\r\n indr[il] = 1\r\n if im <= d-1:\r\n indr[im] = 1\r\n if ij <= d-1:\r\n indr[ij] = 1\r\n ik+=k\r\n il+=l\r\n im+=m\r\n ij+=j\r\n i+=1\r\nprint(sum(indr))\r\n\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ndamage=0\r\nfor dr in range(1,d+1):\r\n if dr%k==0 or dr%l==0 or dr%m==0 or dr%n==0:\r\n damage+=1\r\nprint(damage)", "divisors = [int(input()) for i in range(4)]\r\nnumber_of_dragons = int(input())\r\nc = 0\r\nfor i in range(1, number_of_dragons+1):\r\n if i % divisors[0] == 0 or i % divisors[1] == 0 or i % divisors[2] == 0 or i % divisors[3] == 0:\r\n continue\r\n else:\r\n c += 1\r\nprint(number_of_dragons-c)", "*u,e=map(int,open(0))\nprint(sum(any(i%j==0 for j in u)for i in range(1,e+1)))\n \t\t \t \t \t\t \t \t\t\t\t\t \t \t\t", "str = []\r\nstr1 = []\r\n\r\nfor i in range (5):\r\n n = int(input())\r\n str.append(n)\r\n# print(type(str[1]))\r\ndef count(num1,num2):\r\n w = int(num2 / num1)\r\n for i in range(1,w+1):\r\n r = i * num1\r\n str1.append(r)\r\n # new_str = list(set(str1))\r\n # print(len(new_str))\r\n\r\n\r\ncount(str[0],str[4])\r\ncount(str[1],str[4])\r\ncount(str[2],str[4])\r\ncount(str[3],str[4])\r\nnew_str = list(set(str1))\r\nprint(len(new_str))\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n \r\ni = 1\r\naux = d\r\nif k == 1 or l == 1 or m == 1 or n == 1:\r\n print(aux)\r\nelse:\r\n while True:\r\n if (i % k != 0) and (i % l != 0) and (i % m != 0) and (i % n != 0):\r\n aux -= 1\r\n if i == d:\r\n print(aux)\r\n break\r\n i += 1\r\n \r\n\r\n \r\n \r\n ", "# 2\r\n# 3\r\n# 4\r\n# 5\r\n# 24\r\n\r\n# 17\r\n\r\n# 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24\r\n\r\n# 1 - - - - - 7 - - - 11 - 13 - - - 17 - 19 - - - 23 -\r\nz = []\r\nr = []\r\nfor i in range(4):\r\n z.append(int(input()))\r\nn = int(input())\r\nfor i in range(1, n+1):\r\n r.append(i)\r\nfor b in z:\r\n for i in range(1, len(r)+1):\r\n if b*i <= len(r):\r\n r[b*i-1] = '-'\r\n else: break\r\nprint(r.count('-'))", "k=int(input())\nl=int(input())\nm=int(input())\nn=int(input())\nd=int(input())\nc=0\nfor i in range(1,d+1):\n if(i%k==0):\n c+=1\n elif(i%l==0):\n c+=1\n elif(i%m==0):\n c+=1\n elif(i%n==0):\n c+=1\n\nprint(c)\n\t \t \t\t \t \t\t\t \t \t \t \t", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\nk = int(input())\r\ncount = 0\r\nif a == 1 or b == 1 or c == 1 or d == 1:\r\n print(k)\r\nelse:\r\n for i in range(1, k + 1):\r\n if i % a == 0 or i % b == 0 or i % c == 0 or i % d == 0:\r\n count += 1\r\n print(count)", "k = int(input()) # kth - punched in face by frying pan\nl = int(input()) # lth - tail shut into the balcony door\nm = int(input()) # mth - paws trampled with sharp heels\nn = int(input()) # nth - call her mom\n\nd = int(input()) # total dragons\n\ndamaged = 0\nfor i in range(1, 1 + d):\n if (k <= d) and (l <= d) and (m <= d) and (n <= d):\n if (i % k == 0) or (i % l == 0) or (i % m == 0) or (i % n == 0):\n damaged += 1\n else:\n damaged = 0\nprint(damaged)", "from sys import stdin, stdout\r\nk = int(stdin.readline()); l = int(stdin.readline()); m = int(stdin.readline()); n = int(stdin.readline()); d = int(stdin.readline()); a = [k,l,m,n]\r\nstdout.write(str(sum(any(i%j==0 for j in a) for i in range(1,d+1))))", "n = [int(input()) for _ in range(5)]\r\n\r\ncount = 0\r\n\r\nfor i in range(1, n[4] + 1):\r\n if i % n[0] == 0 or i % n[1] == 0 or i % n[2] == 0 or i % n[3] == 0:\r\n count += 1\r\n\r\nprint(count)", "l = [int(input()) for i in range(4)]\r\nm = int(input())\r\nprint(len(set([i for i in range(1, m+1) for j in l if i % j == 0])))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nx = set()\r\nnum = 0\r\nfor _ in range(d):\r\n num += 1\r\n x.add(num)\r\ncount = 0\r\nfor i in x:\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n count += 1\r\nprint(count)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\ne = int(input())\r\ntotal = e\r\nfor i in range(1 , e + 1):\r\n if (i % a) * (i % b) * (i % c) * (i % d) != 0:\r\n total -= 1\r\nprint(total)", "def cure(list1):\n count = 0\n if 1 in list1[:4]:\n return list1[4]\n else:\n for i in range(1, list1[4]+1):\n if i % list1[0] == 0 or i % list1[1] == 0 or i % list1[2] == 0 or i % list1[3] == 0:\n count = count+1\n return count\nlist1=[]\nfor i in range(5):\n a=int(input())\n list1.append(a)\nprint(cure(list1))\n\n\n\n", "k,l,m,n,d = [int(input()) for i in range(5)]\r\na = [1 if i%k==0 or i%l==0 or i%m==0 or i%n==0 else 0 for i in range(1,d+1)]\r\nprint(sum(a))\r\n", "import math\ndef main():\n k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\n print(len(set(list(range(k,d+1, k))+list(range(l,d+1, l))+list(range(m,d+1, m))+list(range(n,d+1, n)))))\n\nif __name__ == '__main__':\n main()", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\na=set()\r\nls=[k,l,m,n]\r\no=int(input())\r\nfor i in range(4):\r\n for j in range(1,o+1):\r\n if j%ls[i]==0:\r\n a.add(j)\r\nprint(len(a))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nk, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\nh = range(1,d+1); c = 0\r\nfor j in h:\r\n if j % k == 0 or j % l == 0 or j % m == 0 or j % n == 0:\r\n c+=1\r\nprint(c)", "from math import lcm\r\na,b,c,d,n=[int(input()) for i in range(5)]\r\nprint( n//a + n//b + n//c + n//d - n//lcm(a,b) - n//lcm(a,c) - n//lcm(a,d) - n//lcm(b,c) - n//lcm(b,d) - n//lcm(c,d) + n//lcm(a,b,c) + n//lcm(a,b,d) + n//lcm(a,c,d) + n//lcm(b,c,d) - n//lcm(a,b,c,d) )", "k = int(input())\r\nl= int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nlong =[]\r\nfor i in range(1, d+1):\r\n if i%k == 0 or i % l==0 or i %m==0 or i%n ==0:\r\n long.append(i)\r\nprint(len(long))", "k = int(input())\r\nm = int(input())\r\nl = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n\r\nj = 0\r\ni = 1\r\nwhile i <= d:\r\n if i%k == 0:\r\n j +=1\r\n elif i%m == 0:\r\n j +=1\r\n elif i%n == 0:\r\n j += 1\r\n elif i%l == 0:\r\n j +=1\r\n i +=1\r\n\r\nprint(j)", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\nif k == 1 or l == 1 or m == 1 or n == 1:\n print(d)\n exit()\n\ncount = 0\nfor i in range(d):\n check = i+1\n if check%k == 0 or check%l == 0 or check%m == 0 or check%n == 0:\n count += 1\n\nprint(count)\n", "k = int(input());#punched\r\nl = int(input());#tail\r\nm = int(input());#paws\r\nn = int(input());#mom\r\nd = int(input())\r\nsol = 0\r\nfor i in range(1,d+1):\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:sol+=1;\r\nprint(sol)", "a = [int(input()), int(input()), int(input()), int(input())]\r\nd = int(input())\r\nn = 0\r\nfor i in range(1,d + 1):\r\n if i % a[0] == 0 or i % a[1] == 0 or i % a[2] == 0 or i % a[3] == 0:\r\n n += 1\r\nprint(n)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nx=[k,l,m,n]\r\nd=int(input())\r\n# flag=True\r\n# for i in range(d):\r\n# \tfor j in x:\r\n# \t\tif d%x!=0:\r\n# \t\t\tflag=False\r\n# \t\telse:\r\n# \t\t\tflag=True\r\n# if flag==False:\r\ndictt={}\r\nfor p in range(1,d+1):\r\n\tdictt[p]=0\r\n\r\nfor j in x:\r\n\ta=j\r\n\twhile a<=d:\r\n\t\tdictt[a]+=1\r\n\t\ta+=j\r\ny=0\r\nfor i in dictt:\r\n\tif dictt[i]==0:\r\n\t\ty+=1\r\nprint(d-y)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nf=0\r\na=[]\r\nfor i in range(1,d+1):\r\n a.append(i)\r\nfor j in range(len(a)):\r\n if a[j]%k==0 or a[j]%l==0 or a[j]%m==0 or a[j]%n==0:\r\n f+=1\r\nprint(f) \r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nk_set = {i for i in range(1,d+1) if i % k == 0}\r\nl_set = {i for i in range(1,d+1) if i % l == 0}\r\nm_set = {i for i in range(1,d+1) if i % m == 0}\r\nn_set = {i for i in range(1,d+1) if i % n == 0}\r\n\r\nnew_set = {*k_set,*l_set,*m_set,*n_set}\r\nprint(len(new_set))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nk_a = [i for i in range(k, d+1, k)]\r\nl_a = [i for i in range(l, d+1, l)]\r\nm_a = [i for i in range(m, d+1, m)]\r\nn_a = [i for i in range(n, d+1, n)]\r\nprint(len(set(k_a+l_a+m_a+n_a)))", "x = []\r\nc = 0\r\nfor i in range(4):\r\n x.append(int(input()))\r\ndragon = int(input())\r\nfor i in range(1,dragon + 1):\r\n if i % x[0] == 0 or i % x[1] == 0 or i % x[2] == 0 or i % x[3] == 0:\r\n c += 1\r\nprint(c)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ninjured = [0 for i in range(d)]\r\nindex_k=k-1\r\nindex_l=l-1\r\nindex_m=m-1\r\nindex_n=n-1\r\n\r\n\r\ni=0\r\nwhile i<d:\r\n if index_k<=d-1:\r\n injured[index_k]=1\r\n if index_l<=d-1:\r\n injured[index_l]=1\r\n if index_m<=d-1:\r\n injured[index_m]=1\r\n if index_n<=d-1:\r\n injured[index_n]=1\r\n index_k+=k\r\n index_l+=l\r\n index_m+=m\r\n index_n+=n\r\n\r\n i+=1\r\n\r\nprint(sum(injured))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\nl1 = set([i for i in range(k,d+1,k)])\r\nl2 = set([i for i in range(l,d+1,l)])\r\nl3 = set([i for i in range(m,d+1,m)])\r\nl4 = set([i for i in range(n,d+1,n)])\r\n\r\nl1 = l1.union(l2)\r\nl1 = l1.union(l3)\r\nl1 = l1.union(l4)\r\n\r\nprint(len(l1))\r\n\r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nc = 0\r\nfor i in range(1,d+1):\r\n if i % k==0 or i % l==0 or i % m==0 or i % n==0:\r\n c+=1\r\nprint(c) ", "def fact(a,b,c,d,drag):\r\n i=1\r\n ctr=0\r\n while i<=drag:\r\n if i%a==0 or i%b==0 or i%c==0 or i%d==0 :\r\n ctr+=1\r\n i+=1\r\n return ctr\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ndrag=int(input())\r\nprint(fact(a,b,c,d,drag))\r\n\r\n", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\ndragons = [0] * d\n\nfor i in range(k - 1, d, k):\n dragons[i] = 1\n\nfor i in range(l - 1, d, l):\n dragons[i] = 1\n\nfor i in range(m - 1, d, m):\n dragons[i] = 1\n\nfor i in range(n - 1, d, n):\n dragons[i] = 1\n\nprint(sum(dragons))\n\n\n \t\t\t \t\t \t\t\t\t\t \t\t \t\t \t\t \t\t \t\t", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input()) \r\narr = []\r\nfor i in range(1 ,d + 1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n arr.append(i)\r\nprint(len(arr))", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ndamaged_dragons=0\r\nfor dragon in range(1,d+1):\r\n if dragon%k==0 or dragon%l==0 or dragon%m==0 or dragon%n==0:\r\n damaged_dragons+=1\r\nprint(damaged_dragons)\r\n", "def insomniaCure(k,l,m,n,d):\r\n count = 0\r\n \r\n for i in range(1,d+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0: \r\n count += 1\r\n \r\n return count\r\n \r\n\r\nif __name__ == \"__main__\":\r\n arr = []\r\n \r\n for _ in range(5):\r\n arr.append(int(input()))\r\n \r\n k,l,m,n,d = arr\r\n ans = insomniaCure(k,l,m,n,d)\r\n print(ans)\r\n ", "k = int(input())\r\nl = int(input())\r\nm = int(input()) \r\nn = int(input()) \r\nd = int(input()) + 1\r\nlimits = [k, l, m, n]\r\nexclusions = 0\r\ndamaged = 0\r\nfor i in range(1, d):\r\n excluded = False # assume that the number is not excluded by default\r\n for j in range(len(limits)): # loop through the four limits\r\n if i % limits[j] == 0: # check if the number meets the current limit\r\n excluded = True\r\n damaged += 1# if it does, mark it as excluded\r\n break # exit the inner loop early, since the number is already excluded\r\n if not excluded: # if the number was not excluded by any of the limits\r\n exclusions += 1 # add it to the list of excluded numbers\r\nprint(damaged)\r\n ", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nres=0\r\nfor i in range(1,d+1):\r\n if (i%k==0) or (i%l==0) or (i%m==0) or (i%n==0):\r\n res=res+1\r\nprint(res)", "k=input()\r\nl=input()\r\nm=input()\r\nn=input()\r\nd=input()\r\nk=int(k)\r\nl=int(l)\r\nm=int(m)\r\nn=int(n)\r\nd=int(d)\r\np=0\r\nfor i in range(1,d+1):\r\n if i%k==0 and (k<=d):\r\n p+=1\r\n elif i%l==0 and (l<=d):\r\n p+=1\r\n elif i%m==0 and (m<=d):\r\n p+=1\r\n elif i%n==0 and (n<=d):\r\n p+=1\r\n \r\nprint(p)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\ne = int(input())\r\ncount = 0\r\nfor i in range(1,e+1):\r\n if i%a == 0 or i%b == 0 or i%c == 0 or i%d == 0:\r\n count += 1 \r\nprint(count)", "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\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nans = 0\r\nvis = [0] * (d+1)\r\nfor i in range(k,d+1,k):\r\n if not vis[i]:\r\n ans += 1\r\n vis[i] = 1\r\nfor i in range(l,d+1,l):\r\n if not vis[i]:\r\n ans += 1\r\n vis[i] = 1\r\nfor i in range(m,d+1,m):\r\n if not vis[i]:\r\n ans += 1\r\n vis[i] = 1\r\nfor i in range(n,d+1,n):\r\n if not vis[i]:\r\n ans += 1\r\n vis[i] = 1\r\n \r\nprint(ans)", "a,s,d,f,g=int(input()),int(input()),int(input()),int(input()),int(input())\r\ncnt=0\r\nfor i in range(1,g+1):\r\n if i%a==0 or i%s==0 or i%d==0 or i%f==0:\r\n cnt+=1\r\nprint(cnt)", "w = set()\r\ndef fun(n,d):\r\n i = 1\r\n s = 1\r\n while s < d:\r\n s = n * i\r\n if s > d:\r\n break\r\n w.add(s)\r\n i = i + 1\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nif k == 1 or l == 1 or m == 1 or n == 1:\r\n print(d)\r\nelse:\r\n fun(k,d)\r\n fun(l,d)\r\n fun(m,d)\r\n fun(n,d)\r\n print(len(w))\r\n ", "k = int(input()) ; l = int(input()) ; m = int(input()) ; n = int(input()) ; d = int(input()) \r\na = 0\r\nfor i in range(1,d+1):\r\n if i%k == 0 or i%m == 0 or i%l == 0 or i%n == 0: a+=1\r\nprint(a)", "k=int(input()); l=int(input()); m=int(input()); n=int(input())\r\nd=int(input()); c=0\r\nif k==1 or l==1 or m==1 or n==1: print(d)\r\nelse:\r\n for i in range(1,d+1):\r\n if (i%k)==0 or (i%l)==0 or (i%m)==0 or (i%n)==0:\r\n c+=1\r\n print(c)\r\n", "c = 0\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n\r\nfor i in range(1,d+1):\r\n if (i%k) == 0 or (i%l)==0 or (i%m) == 0 or (i%n) == 0:\r\n c = c+1\r\nprint(c)\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\n\r\n\r\nramon=0\r\nfor i in range(1,e+1):\r\n # print(\"i is \",i)\r\n if i%a!=0 and i%b!=0 and i%c!=0 and i%d!=0:\r\n #print(i)\r\n ramon=ramon+1\r\nfinal=e-ramon\r\nprint(final)", "\r\na = eval(input())\r\nb = eval(input())\r\nc = eval(input())\r\nd = eval(input())\r\ntotal = eval(input())\r\n\r\nres = 0\r\nfor i in range(total):\r\n if (i+1) % a ==0 or (i+1) % b ==0 or (i+1) % c ==0 or (i+1) % d ==0:\r\n res+=1\r\nprint(res)", "# Read the input values\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\n# Initialize a variable to count damaged dragons\r\ndamaged_dragons = 0\r\n\r\n# Iterate through all dragons from 1 to d\r\nfor dragon in range(1, d + 1):\r\n # Check each condition and increment the count if the dragon suffers damage\r\n if dragon % k == 0 or dragon % l == 0 or dragon % m == 0 or dragon % n == 0:\r\n damaged_dragons += 1\r\n\r\n# Print the count of damaged dragons\r\nprint(damaged_dragons)\r\n", "def solve():\r\n k = int(input())\r\n l = int(input())\r\n m = int(input())\r\n n = int(input())\r\n d = int(input())\r\n cnt = 0\r\n for i in range(1, d+1):\r\n if i % k and i % l and i % m and i % n:\r\n cnt += 1\r\n print(d-cnt)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "count=0\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nc=int(input())\r\nfor i in range(1,c+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0:\r\n continue\r\n else:\r\n count=count+1\r\nprint(c-count)", "k = int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nc = 0\r\narr = [0] * (d + 1)\r\n\r\nfor i in range(1, d + 1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n arr[i] = 1\r\n\r\nfor i in range(1, d + 1):\r\n if arr[i] == 0:\r\n c += 1\r\n\r\nprint(d - c)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount=0\r\nk1 = []\r\nl1 = []\r\nm1 = []\r\nn1 = []\r\ns = []\r\nfor i in range(k, d+1,k):\r\n k1.append(i)\r\nfor i in range(l,d+1,l):\r\n l1.append(i)\r\nfor i in range(m, d+1,m):\r\n m1.append(i)\r\nfor i in range(n,d+1,n):\r\n n1.append(i)\r\ns = list(set(k1+l1+m1+n1))\r\nprint(len(s))\r\n \r\n \r\n \r\n \r\n", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\nA=[]\r\n\r\ni=1\r\nwhile (k*i<=d):\r\n A.append(k*i)\r\n i+=1\r\ni=1\r\nwhile (l*i<=d):\r\n A.append(l*i)\r\n i+=1\r\ni=1\r\nwhile (m*i<=d):\r\n A.append(m*i)\r\n i+=1\r\ni=1\r\nwhile (n*i<=d):\r\n A.append(n*i)\r\n i+=1\r\n\r\nprint(len(set(A)))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ni = 1\r\ncount = 0\r\nwhile i <= d:\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n count += 1\r\n i += 1\r\nprint(count)\r\n", "l=[int(input())for i in range(4)]\r\nd=int(input())\r\ncount=0\r\nfor i in range(1,d+1):\r\n for j in l:\r\n if i%j==0:\r\n count+=1\r\n break\r\nprint(count)", "k = int(input()) # Punch\r\nl = int(input()) # Tail shut\r\nm = int(input()) # Paws trampled\r\nn = int(input()) # Threatened\r\nd = int(input()) # Total number of dragons\r\n\r\ndamaged_dragons = 0\r\n\r\nfor i in range(1, d + 1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n damaged_dragons += 1\r\n\r\nprint(damaged_dragons)\r\n", "def main():\r\n k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\n if 1 in [k,l,m,n]:\r\n print(d)\r\n return\r\n \r\n dragons = set()\r\n \r\n i = k\r\n while i <= d:\r\n dragons.add(i) \r\n i += k\r\n \r\n i = l\r\n while i <= d:\r\n dragons.add(i) \r\n i += l\r\n \r\n\r\n i = m\r\n while i <= d:\r\n dragons.add(i) \r\n i += m\r\n \r\n i = n\r\n while i <= d:\r\n dragons.add(i) \r\n i += n\r\n \r\n print(len(dragons))\r\n \r\nmain()\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\nn = int(input())\r\nm = 0\r\nfor j in range(1, n+1):\r\n if j%a==0 or j%b==0 or j%c==0 or j%d==0:\r\n m+=1\r\nprint(m)", "k, l, m, n, d = int(input()),int(input()),int(input()),int(input()),int(input())\r\nans = 0\r\nfor i in range(1, d+1):\r\n if i%k==0:\r\n ans+=1\r\n elif i%l==0:\r\n ans+=1\r\n elif i%m==0:\r\n ans+=1\r\n elif i%n==0:\r\n ans+=1\r\nprint(ans)", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\na=[]\r\nb=[]\r\nc=[]\r\nf=[]\r\nz=[]\r\nfor i in range(k,d+1,k):\r\n a.append(i)\r\nfor i in range(l,d+1,l):\r\n b.append(i)\r\nfor i in range(m,d+1,m):\r\n c.append(i)\r\nfor i in range(n,d+1,n):\r\n f.append(i)\r\nfor i in range(1,d+1):\r\n z.append(i)\r\na=set(a)\r\nb=set(b)\r\nc=set(c)\r\nf=set(f)\r\nz=set(z)\r\nq=(z-a-b-c-f)\r\ns=len(q)\r\nprint(d-s)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/148/A\r\n\r\n\r\ndef main():\r\n damage_numbers = list()\r\n dragons_hurt = 0\r\n # add k, l, m, n, d to our damage_numbers list\r\n damage_numbers.append(int(input()))\r\n damage_numbers.append(int(input()))\r\n damage_numbers.append(int(input()))\r\n damage_numbers.append(int(input()))\r\n \r\n num_dragons = int(input())\r\n \r\n for dragon_num in range(num_dragons):\r\n for damage_number in damage_numbers:\r\n if (dragon_num + 1) % damage_number == 0:\r\n dragons_hurt += 1\r\n break\r\n \r\n print(dragons_hurt)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "arr = []\r\nn = 4\r\nwhile n > 0:\r\n arr.append(int(input()))\r\n n -=1\r\n \r\nd = int(input())\r\n\r\nif 1 in arr:\r\n print(d)\r\nelse:\r\n res = []\r\n for i in arr:\r\n res.extend(list(range(i-1, d, i)))\r\n print(len(set(res)))\r\n", "k=int(input()) #punched in the face with a frying pan\r\nl=int(input()) #got his tail shut into the balcony door\r\nm=int(input()) #got his paws trampled with sharp heels\r\nn=int(input()) #threatened every n-th dragon to call her mom, and he withdrew in panic\r\nd=int(input()) #total\r\n\r\ndamaged_dragons = 0\r\n\r\nfor i in range(1, d+1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n damaged_dragons += 1\r\n\r\nprint(damaged_dragons)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Mar 27 11:33:47 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\nx=[x for x in range(1,d+1) if x%k!=0 if x%l!=0 if x%m!=0 if x%n!=0]\r\nprint(d-len(x))", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nf=[0]*d\r\nres=0\r\nfor i in range(1,d+1):\r\n if f[i-1]==0:\r\n if i%k==0:\r\n f[i-1]=1\r\n res+=1\r\n elif i%l==0:\r\n f[i-1]=1\r\n res+=1\r\n elif i%m==0:\r\n f[i-1]=1\r\n res+=1\r\n elif i%n==0:\r\n f[i-1]=1\r\n res+=1\r\nprint(res)\r\n\r\n", "import sys\r\n*A,d = map(int,sys.stdin.read().split())\r\n\r\nprint(sum(any((i%p==0) for p in A) for i in range(1,d+1)))\r\n\r\n\r\n", "n = int(input())\r\nk = int(input())\r\na = int(input())\r\nm = int(input())\r\nd = int(input())\r\ncount = d\r\nfor i in range(1 ,d+1):\r\n if(i % n != 0 and i % k != 0 and i % a != 0 and i % m != 0):\r\n count -= 1\r\nprint(count)", "from math import lcm\r\n\r\nk, l, m, n, d = map(int, [input() for _ in range(5)])\r\nprint(d // k + d // l + d // m + d // n - (d // lcm(k, l) + d // lcm(k, m) + d // lcm(k, n) + d // lcm(l, m) + d // lcm(l, n) + d // lcm(m, n)) + d // lcm(k, l, m) + d // lcm(k, l, n) + d // lcm(k, m, n) + d // lcm(l, m, n) - d // lcm(k, l, m, n))", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\ntot=0\r\nfor i in range(1,d+1):\r\n c=0\r\n for j in [k,l,m,n]:\r\n if i%j==0:\r\n c=1\r\n break\r\n if c:\r\n tot+=1\r\nprint(tot)\r\n \r\n \r\n", "q=int(input())\r\nw=int(input())\r\ne=int(input())\r\nr=int(input())\r\nt=int(input())\r\ny=0\r\nfor dragon in range(1,t+1):\r\n if dragon %q == 0 or dragon % w ==0 or dragon % e ==0 or dragon % r == 0:\r\n y+=1\r\nprint(y) \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 4 21:12:31 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\nsum=0\r\nfor i in range(1,d+1):\r\n if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:\r\n sum=sum+1\r\n else:pass\r\nprint(d-sum)", "ns = list(set([int(input()) for x in range(4)]))\r\nd=int(input())\r\na=set()\r\n\r\nfor i in range(len(ns)):\r\n for j in range(ns[i],d+1,ns[i]):\r\n a.add(j)\r\nprint(len(a))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount = 0\r\nfor i in range(1,d+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0:\r\n count+=1\r\nprint(count)", "numbers=[]\r\nfor i in range(0,4):\r\n numbers.append(int(input()))\r\nd=int(input())\r\nexisted=[396]\r\nfor i in range(1,d+1):\r\n existed.append(0)\r\nfor i in numbers:\r\n p=1\r\n while(p*i<=d):\r\n existed[p*i]=1\r\n p+=1\r\nprint(existed.count(1))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount = 0\r\nwhile d>0:\r\n if d%k==0 or d%l==0 or d%m==0 or d%n==0:\r\n count = count + 1\r\n d = d-1\r\nprint(count)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ndragons = [False] * d\r\n\r\nfor i in range(1, d+1):\r\n if i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0:\r\n dragons[i-1] = True\r\n\r\ndamaged_dragons = dragons.count(True)\r\nprint(damaged_dragons)\r\n", "k,l,m,n,d=[int(input()) for i in range(5)]\r\nc=0\r\nfor i in range(1,d+1):\r\n if i%k==0 or i%l==0 or i%m==0 or i%n==0: c+=1\r\nprint(c)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nmas = []\r\nfor i in range(d):\r\n if (i+1)%k==0 or (i+1)%l==0 or (i+1)%m==0 or (i+1)%n==0:\r\n mas.append(i)\r\nprint(len(mas))", "\r\ndiv = [ int(input()) for i in range(4) ]\r\nnum = int(input())\r\n\r\n# div.sort()\r\ns = 0\r\n\r\nfor i in range(1 , num+1):\r\n \r\n is_div = False \r\n for ele in div:\r\n if i % ele == 0 :\r\n is_div = True \r\n # break\r\n \r\n if is_div :\r\n s += 1\r\n \r\n \r\nprint(s)\r\n\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ne = 0\r\nfor poor in range(1, d + 1):\r\n if poor % k == 0 or poor % l == 0 or poor % m == 0 or poor % n == 0:\r\n e += 1\r\nprint(e)\r\n", "# Get input values for the divisors and the count\r\ndivisor_1 = int(input())\r\ndivisor_2 = int(input())\r\ndivisor_3 = int(input())\r\ndivisor_4 = int(input())\r\ncount = int(input())\r\n\r\n# Initialize a variable to keep track of the numbers divisible by at least one of the divisors\r\ndivisible_count = 0\r\n\r\n# Iterate through numbers from 1 to the specified count\r\nfor i in range(1, count + 1):\r\n # Check if the current number is divisible by any of the divisors\r\n if i % divisor_1 == 0 or i % divisor_2 == 0 or i % divisor_3 == 0 or i % divisor_4 == 0:\r\n divisible_count += 1 # Increment the count if divisible\r\n\r\n# Print the total count of numbers divisible by at least one of the divisors\r\nprint(divisible_count)\r\n", "k, l, m, n, d=map(int, open(0).read().split())\r\na = list(filter(lambda x: x%k, list(range(1, d+1))))\r\na = list(filter(lambda x: x%l, a))\r\na = list(filter(lambda x: x%m, a))\r\na = list(filter(lambda x: x%n, a))\r\nprint(d-len(a))", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = list(range(1, int(input())+1))\r\nfor i in range(len(d)) : \r\n if d[i]%k == 0 or d[i]%l == 0 or d[i]%m == 0 or d[i]%n == 0 : \r\n d[i] = 0\r\nprint(len(d)-len(list(i for i in d if i != 0)))\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\ne=int(input())\r\ns=0\r\nfor i in range(1,e+1):\r\n if i%a!=0 and i%b!=0 and i%c!=0 and i%d!=0 :\r\n s+=1\r\n\r\nprint(e-s)\r\n", "slap=int(input())\r\ntail=int(input())\r\ninToHeal=int(input())\r\ncallToMom=int(input())\r\nnoDragons=int(input())\r\nsum=0\r\nfor i in range(1,noDragons+1):\r\n\tif i%slap==0:\r\n\t\tsum+=1\r\n\telif i%tail==0:\r\n\t\tsum+=1\r\n\telif i%inToHeal==0:\r\n\t\tsum+=1\r\n\telif i%callToMom==0:\r\n\t\tsum+=1\r\n\telse:\r\n\t\tcontinue\r\nprint(sum)", "k = int(input())\r\nl = int(input())\r\nn = int(input())\r\nm = int(input())\r\nd = int(input())\r\ndragons = 0\r\nfor i in range(d): \r\n if (i + 1) % l == 0 or (i + 1) % n == 0 or (i + 1) % m == 0 or (i + 1) % k == 0:\r\n dragons += 1\r\n \r\nprint(dragons) ", "# 148A - Insomnia Cure\r\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ncount = 0\r\nindex_dragon = 0\r\n\r\nfor dragon in range(d):\r\n index_dragon += 1\r\n if index_dragon % k == 0:\r\n count += 1\r\n elif index_dragon % l == 0:\r\n count += 1\r\n elif index_dragon % m == 0:\r\n count += 1\r\n elif index_dragon % n == 0:\r\n count += 1\r\n\r\nprint(count)", "Q=int(input())\r\nW=int(input())\r\nE=int(input())\r\nR=int(input())\r\nT=int(input())\r\nX=0\r\nfor Drag in range(1,T+1):\r\n if Drag %Q==0 or Drag %W==0 or Drag %E==0 or Drag %R==0:\r\n X+=1\r\nprint(X) ", "k = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\nX = 0\nlst = []\nfor i in range(d + 1):\n if (i % k == 0 and i // k != 0):\n lst.append(i)\nfor i in range(d + 1):\n if (i % l == 0 and i // l != 0):\n lst.append(i)\nfor i in range(d + 1):\n if (i % m == 0 and i // m != 0):\n lst.append(i)\nfor i in range(d + 1):\n if (i % n == 0 and i // n != 0):\n lst.append(i)\nlst.sort()\ntest_list = list(set(lst))\ny = len(test_list)\nprint(y)\n \t \t\t \t\t \t\t\t\t\t \t\t\t\t\t \t \t \t\t", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nans = 0\r\nif k == 1 or l == 1 or m == 1 or n == 1:\r\n print(d)\r\nelse:\r\n for x in range(1, d+1):\r\n if x % k == 0 or x % l == 0 or x % m == 0 or x % n == 0:\r\n ans += 1\r\n\r\n print(ans)\r\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount = d\r\n\r\nif k ==1 or m == 1 or n ==1 or l == 1:\r\n print(d)\r\nelse:\r\n for i in range(1,d+1):\r\n if i%k != 0 and i%l != 0 and i%m!=0 and i%n != 0:\r\n count-=1\r\n print(count)", "n1 = int(input())\r\nn2 = int(input())\r\nn3 = int(input())\r\nn4 = int(input())\r\nn5 = int(input())\r\nl = 0\r\nfor i in range(1,n5+1):\r\n if i%n1 == 0 or i%n2 == 0 or i%n3 == 0 or i%n4 == 0:\r\n l += 1\r\nprint(l)", "import math\r\ndef lcm_2(x, y):\r\n return x * y // math.gcd(x, y)\r\n\r\ndef lcm_3(x, y, z):\r\n return lcm_2(lcm_2(x, y), z)\r\n\r\ndef lcm_4(a, b, c, d):\r\n return lcm_2(lcm_2(lcm_2(a, b), c), d)\r\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\n\r\ndef count_divisible(x):\r\n return d // x\r\n\r\ndamaged_dragons = (\r\n count_divisible(k)\r\n + count_divisible(l)\r\n + count_divisible(m)\r\n + count_divisible(n)\r\n - count_divisible(lcm_2(k, l))\r\n - count_divisible(lcm_2(k, m))\r\n - count_divisible(lcm_2(k, n))\r\n - count_divisible(lcm_2(l, m))\r\n - count_divisible(lcm_2(l, n))\r\n - count_divisible(lcm_2(m, n))\r\n + count_divisible(lcm_3(k, l, m))\r\n + count_divisible(lcm_3(k, l, n))\r\n + count_divisible(lcm_3(k, m, n))\r\n + count_divisible(lcm_3(l, m, n))\r\n - count_divisible(lcm_4(k, l, m, n))\r\n)\r\n\r\nprint(damaged_dragons)\r\n\r\n", "k=int(input())\nl=int(input())\nm=int(input())\nn=int(input())\nd=int(input())\n\nlis=[]\nfor i in range(1,d+1):\n if k*i<=d:\n lis.append(k*i)\n if l*i<=d:\n lis.append(l*i)\n if m*i<=d:\n lis.append(m*i)\n if n*i<=d:\n lis.append(n*i)\nlis=list(set(lis))\nprint(len(lis))\n\t\t \t \t\t \t \t\t\t\t\t\t \t\t\t\t\t \t \t\t\t", "data = [int(input()) for _ in range(5)]\r\ndragons = [0] * data[-1]\r\nprint(sum(1 for n in range(1, len(dragons) + 1) if not n % data[0] or\r\n not n % data[1] or not n % data[2] or not n % data[3]))", "def no_of_damaged_dragons():\r\n fry_pan_on_face = int(input())\r\n tail_shut_balcony_door = int(input())\r\n paws_trampled_sharp_heels = int(input())\r\n mom_threat = int(input())\r\n total_dragon = int(input())\r\n damaged_dragons = []\r\n for i in range(1, total_dragon + 1):\r\n if i % fry_pan_on_face == 0 or i % tail_shut_balcony_door == 0 or i % paws_trampled_sharp_heels == 0 or i % mom_threat == 0:\r\n damaged_dragons.append(i)\r\n print(len(damaged_dragons))\r\n\r\n\r\nno_of_damaged_dragons()\r\n", "lst = [int(input()), int(input()), int(input()), int(input())]\r\nif 1 in lst:\r\n print(int(input()))\r\nelse:\r\n d = int(input())\r\n new_lst = []\r\n for i in lst:\r\n if i not in new_lst:\r\n for j in range(1,d//i+1):\r\n num = i*j\r\n if num not in new_lst:\r\n new_lst.append(num)\r\n print(len(new_lst)) \r\n \r\n \r\n\r\n", "res = []\r\nfor h in range(4):\r\n man= int(input())\r\n res.append(man)\r\n\r\nlearn = int(input())\r\n\r\ndef lest_nampor(d,res):\r\n lest = 0\r\n for nampr in range(1 , d+1):\r\n for gren in res:\r\n if nampr % gren == 0:\r\n lest +=1\r\n break\r\n return lest\r\n\r\ng = lest_nampor(learn,res)\r\nprint(g)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nks = []\r\nls = []\r\nms = []\r\nns = []\r\ndef f(chislo,lisok,d):\r\n k = chislo\r\n while chislo<=d:\r\n lisok.append(chislo)\r\n chislo+=k\r\n return lisok\r\nks = f(k,ks,d)\r\nls = f(l,ls,d)\r\nms = f(m,ms,d)\r\nns = f(n,ns,d)\r\nob = ks+ls+ms+ns\r\nq = set(ob)\r\ng = sorted(q)\r\nlistec = []\r\nfor i in range(1,(d+1)):\r\n listec.append(i)\r\nprint(len(g))", "k = int(input()) # Damage condition 1: punched in the face\r\nl = int(input()) # Damage condition 2: tail shut in the balcony door\r\nm = int(input()) # Damage condition 3: paws trampled with sharp heels\r\nn = int(input()) # Damage condition 4: threatened to call mom\r\nd = int(input()) # Total number of dragons\r\n\r\ndamaged_dragons = 0\r\n\r\nfor dragon in range(1, d + 1):\r\n if dragon % k == 0 or dragon % l == 0 or dragon % m == 0 or dragon % n == 0:\r\n damaged_dragons += 1\r\n\r\nprint(damaged_dragons)\r\n", "import math\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\ndef count_damaged_dragons(k, l, m, n, d):\r\n \"\"\"Counts the number of dragons that were damaged.\r\n\r\n Args:\r\n k: The number of dragons that were punched in the face with a frying pan.\r\n l: The number of dragons that got their tails shut into the balcony door.\r\n m: The number of dragons that got their paws trampled with sharp heels.\r\n n: The number of dragons that were threatened to be called out by the princess's mom.\r\n d: The total number of dragons.\r\n\r\n Returns:\r\n The number of dragons that were damaged.\r\n \"\"\"\r\n\r\n # Create a set to store the numbers of the dragons that were damaged.\r\n damaged_dragons = set()\r\n\r\n # Iterate over the dragons, starting from the first dragon.\r\n for dragon_number in range(1, d + 1):\r\n # Check if the dragon's number is divisible by k, l, m, or n.\r\n if dragon_number % k == 0 or dragon_number % l == 0 or dragon_number % m == 0 or dragon_number % n == 0:\r\n # If it is, add the dragon's number to the set.\r\n damaged_dragons.add(dragon_number)\r\n\r\n # Return the size of the set.\r\n return len(damaged_dragons)\r\n\r\n# Example usage:\r\n\r\ncount = count_damaged_dragons(k, l, m, n, d)\r\n\r\nprint(count)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=int(input())\r\nn=int(input())\r\nmas=[True]*(n+1)\r\nfor k in range(1,n+1):\r\n if (k%a==0 or k%b==0 or k%c==0 or k%d==0):\r\n mas[k]=False\r\nch=0\r\nfor k in range(1,n+1):\r\n if mas[k]==False:\r\n ch=ch+1\r\nprint(ch)\r\n", "s = set()\nk = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\n\na = k\nwhile a <= d:\n s.add(a)\n a += k\n\na = l\nwhile a <= d:\n s.add(a)\n a += l\n\na = m\nwhile a <= d:\n s.add(a)\n a += m\n\na = n\nwhile a <= d:\n s.add(a)\n a += n\n\nprint(len(s))\n\t\t\t \t \t \t\t \t \t \t\t \t\t\t\t\t\t", "def gint():\r\n return int(input())\r\nk,l,m,n,d = gint(),gint(),gint(),gint(),gint()\r\ncount = 0\r\nfor i in range(1,d+1):\r\n if (i%k==0 or i%l==0) or (i%m==0 or i%n==0):\r\n count +=1\r\nprint(count)", "k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\r\ncnt = 0\r\nfor _ in range(1, d + 1):\r\n if _ % k == 0 or _ % l == 0 or _ % m == 0 or _ % n ==0:\r\n cnt += 1\r\nprint(cnt)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\ncount = 0\r\n\r\nfor i in range(1,d+1):\r\n if i%k == 0:\r\n count +=1\r\n continue\r\n\r\n if i%l == 0:\r\n count +=1\r\n continue\r\n if i%m == 0:\r\n count +=1\r\n continue\r\n\r\n if i%n == 0:\r\n count +=1\r\n continue \r\nprint(count)\r\n\r\n\r\n\r\n\r\n", "k=int(input())\nl=int(input())\nm=int(input())\nn=int(input())\nd=int(input())+1\ns=set([i for i in range(k,d,k)])\ns.update([i for i in range(l,d,l)])\ns.update([i for i in range(m,d,m)])\ns.update([i for i in range(n,d,n)])\nprint(len(s))", "div = [ int(input()) for i in range(4) ]\r\nnum = int(input())\r\n\r\n\r\n# print(div)\r\n \r\ndef sol(div , num):\r\n \r\n div = sorted(list(set(div)) )\r\n \r\n if div[0] == 1 :\r\n return num\r\n \r\n arr = [False]*(num+1)\r\n for i in div:\r\n for ind in range(i, num+1 , i ):\r\n arr[ind] = True\r\n \r\n return sum(arr)\r\n \r\nprint(sol(div , num))\r\n ", "*s,v=map(int,open(0))\r\nprint(sum(any(i%j==0 for j in s)for i in range(1,v+1)))", "a1=int(input())\r\na2=int(input())\r\nb1=int(input())\r\nb2=int(input())\r\ndragons=int(input())\r\nc=0\r\nfor i in range(1,dragons+1):\r\n if i%a1==0 or i%a2==0 or i%b1==0 or i%b2==0:\r\n c+=1\r\nprint(c) \r\n ", "a,b,c,d,n=map(int,(input() for _ in range(5)))\nm=0\nfor i in range(1,n+1):\n if i%a and i%b and i%c and i%d:\n continue\n else:\n m+=1\nprint(m)\n \t \t \t\t \t\t\t \t\t \t \t \t \t \t", "from collections import Counter\r\n\r\nk = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nvis = [0] * (d + 1)\r\np = 1\r\nwhile p * k <= d:\r\n vis[p * k] = 1\r\n p += 1\r\np = 1\r\nwhile p * l <= d:\r\n vis[p * l] = 1\r\n p += 1\r\np = 1\r\nwhile p * m <= d:\r\n vis[p * m] = 1\r\n p += 1\r\np = 1\r\nwhile p * n <= d:\r\n vis[p * n] = 1\r\n p += 1\r\nprint(sum(vis))", "\r\nk=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\nc=d\r\nif( k==1 or l==1 or m==1 or n==1):\r\n print(d)\r\nelse:\r\n for i in range(1,d+1):\r\n if i % k != 0 and i % l != 0 and i % m != 0 and i % n != 0:\r\n c-=1\r\n print(c)\r\n", "ka=int(input())\r\nla=int(input())\r\nma=int(input())\r\nna=int(input())\r\nda=int(input())\r\n \r\ndragen=0\r\nfor i in range(1,da+1):\r\n if i%ka==0 or i%la==0 or i%ma==0 or i%na==0:\r\n dragen=dragen+1\r\nprint(dragen)", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = int(input())\r\nl1 = [i for i in range(1, d + 1)]\r\nc = 0\r\nfor i in l1:\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:\r\n c += 1\r\nprint(c)", "k, l, m, n, d = [int(input()) for _ in range(5)]\r\nprint(sum(any(i % j == 0 for j in [k, l, m, n]) for i in range(1, d + 1)))", "k=int(input())\r\nl=int(input())\r\nm=int(input())\r\nn=int(input())\r\nd=int(input())\r\n\r\nt=0\r\nfor i in range(1, d+1):\r\n if i%k==0: t+=1\r\n elif i%l==0: t+=1\r\n elif i%m==0: t+=1\r\n elif i%n==0: t+=1\r\n\r\nprint(t)", "def solve():\r\n k = int(input())\r\n l = int(input())\r\n m = int(input())\r\n n = int(input())\r\n d = int(input())\r\n\r\n if k==1 or l==1 or m==1 or n==1:\r\n print(d) \r\n else:\r\n count = 0\r\n for i in range(1, d+1):\r\n if i%k != 0 and i%l != 0 and i%m != 0 and i%n !=0:\r\n count += 1\r\n\r\n print(abs(d - count))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "a = int(input())\nb = int(input())\nc = int(input())\nd = int(input())\nn = int(input())\nif(a==1 or b==1 or c==1 or d==1):\n print(n)\nelse:\n m = [0 for i in range(n)]\n for i in range(a-1,n,a):\n m[i] = 1\n for i in range(b-1,n,b):\n m[i] = 1\n for i in range(c-1,n,c):\n m[i] = 1\n for i in range(d-1,n,d):\n m[i] = 1\n print(sum(m))\n\n\t\t\t\t\t\t \t\t\t \t\t\t \t \t \t \t \t \t \t\t", "n, n1, n2, n3 = int(input()), int(input()), int(input()), int(input())\r\nx = int(input())\r\ns = 0\r\nfor i in range(1, x + 1):\r\n if i % n == 0 or i % n1 == 0 or i % n2 == 0 or i % n3 == 0:\r\n s = s + 1\r\nprint(s)", "def solve():\n k, l, m, n, d = int(input()), int(input()), int(input()), int(input()), int(input())\n ans = 0\n dd = [0] * (d + 1)\n for i in range(1, d // k + 1):\n dd[k * i] = 1\n for i in range(1, d // l + 1):\n dd[l * i] = 1\n for i in range(1, d // m + 1):\n dd[m * i] = 1\n for i in range(1, d // n + 1):\n dd[n * i] = 1\n print(dd.count(1))\n\n# main\nif __name__ == \"__main__\":\n solve()\n", "k = int(input())\r\nl = int(input())\r\nm = int(input())\r\nn = int(input())\r\nd = [int(i) for i in range(1, int(input()) + 1)]\r\nkey = []\r\nkey.append(k)\r\nkey.append(l)\r\nkey.append(m)\r\nkey.append(n)\r\nfor y in range(len(d)):\r\n for j in key:\r\n if d[y] % j == 0:\r\n d[y] = 0\r\nprint(d.count(0))\r\n", "k, l, m, n, d = int(input()),int(input()),int(input()),int(input()),int(input())\r\nlst_num = [int(i) for i in range(1, d+1)]\r\ncount = 0\r\nfor i in lst_num:\r\n if i % k != 0 and i % l != 0 and i % m != 0 and i % n != 0:\r\n count += 1\r\nprint(d - count) \r\n \r\n", "\r\n\r\n# The input has 5 lines, or 5 inputs.\r\n# The first 4 represent a position in a list where a dragon will be hurt. \r\n# Find the number of dragons that are damaged and output it.\r\n\r\n# For example and input of 1 2 3 4 12 means that every 1st dragon takes damage, every 2nd dragon takes damage, every 3rd dragon takes damage, and every 4th dragon takes damage. And there are 4 total dragons.\r\n\r\n# If the input was 0 0 0 4 12, then only the 4th, 8th, and 12th dragon would take damage.\r\n\r\n# A thing to keep in mind when doing this problem is to keep track of duplicates. For example 2 4 0 0 12 would have duplicate damaged dragons because a dragon damaged by 4 would always be damaged by 2.\r\n\r\n# d = number of dragons\r\n\r\n# To solve I think I want to make a list of dragons and then check the damaged positions of each one. Then tag that dragon in some way--this way if a dragon is damaged twice because he's already tagged he wouldn't get double counted. Then at the end just count the total number of dragons.\r\n\r\ndamage1 = int(input())\r\ndamage2 = int(input())\r\ndamage3 = int(input())\r\ndamage4 = int(input())\r\ntotalDragons = int(input())\r\n\r\n# First, let's make a list full of empty strings as long as the totalDragons variable.\r\ndamagedDragons = [\"O\"]* totalDragons # O will mean a dragon is OK.\r\n\r\n# Next, let's make a list of the damaged positions so we can loop through it in a list.\r\ndamagedPosition = [damage1, damage2, damage3, damage4]\r\n\r\n# Next, we need to loop through each each index value and check whether that position is divisible by the damage type. We will compare the damagedPosition index value at 0 to every damagedDragons index value. \r\n\r\ndd = 0 # index value counter for damagedDragons.\r\ndp = 0 # index value counter for damagedPosition List.\r\n\r\n\r\ngoAhead = True\r\nwhile(goAhead):\r\n\r\n damageType = damagedPosition[dp]\r\n \r\n if (dd + 1) % damageType == 0:\r\n damagedDragons[dd] = \"D\"\r\n dd += 1 # moves on to the next dragon's position\r\n \r\n if dd == len(damagedDragons):\r\n dd = 0 # reset the dd index counter\r\n dp += 1 # increase the dp index counter\r\n # In other words, once we look at all the dragons in the list to see if they are affected by the damage position \"DP\" value, we move onto the next \"DP\" value in the loop.\r\n \r\n if dp >= len(damagedPosition):\r\n goAhead = False\r\n # If the \"DP\" counter is equal to the length of the list, or greater, then we have examined all the DP position values against all of the damaged dragon positions and we close the loop.\r\n\r\noutput = damagedDragons.count(\"D\") # count the number of damaged dragons.\r\n\r\nprint(output) # print the answer.\r\n\r\n", "from math import lcm\n\ndef solve():\n *a, d = map(int, open(0))\n print(sum(any(i % j == 0 for j in a) for i in range(1, d + 1)))\n\n\nif __name__ == '__main__':\n solve()\n", "div = [ int(input()) for i in range(4) ]\r\nnum = int(input())\r\n \r\narr = [False]*(num+1)\r\n \r\nfor i in div:\r\n \r\n for ind in range(i, num+1 , i ):\r\n \r\n arr[ind] = True\r\n # print(i , ind)\r\n \r\n # print( i , arr)\r\nprint(sum(arr))\r\n ", "k = int(input(\"\"))\r\nl = int(input(\"\"))\r\nm = int(input(\"\"))\r\nn = int(input(\"\"))\r\nqtd = int(input(\"\"))\r\n\r\nconta = 0\r\nfor i in range(1,qtd+1,1):\r\n if i%k == 0 or i%l == 0 or i%m == 0 or i%n ==0:\r\n conta +=1\r\nprint(conta)" ]

{"inputs": ["1\n2\n3\n4\n12", "2\n3\n4\n5\n24", "1\n1\n1\n1\n100000", "10\n9\n8\n7\n6", "8\n4\n4\n3\n65437", "8\n4\n1\n10\n59392", "4\n1\n8\n7\n44835", "6\n1\n7\n2\n62982", "2\n7\n4\n9\n56937", "2\n9\n8\n1\n75083", "8\n7\n7\n6\n69038", "4\n4\n2\n3\n54481", "6\n4\n9\n8\n72628", "9\n7\n8\n10\n42357", "5\n6\n4\n3\n60504", "7\n2\n3\n8\n21754", "1\n2\n10\n4\n39901", "3\n4\n7\n1\n58048", "9\n10\n4\n6\n52003", "5\n10\n9\n3\n70149", "5\n5\n5\n10\n55592", "1\n5\n2\n6\n49547", "3\n7\n7\n7\n84046", "10\n2\n1\n8\n63537", "7\n2\n10\n5\n81684", "7\n1\n6\n8\n99831", "3\n9\n3\n3\n61082", "5\n5\n8\n9\n79228", "1\n5\n5\n6\n89535", "5\n5\n2\n1\n7682", "7\n4\n8\n8\n25829", "3\n4\n3\n3\n87079", "5\n8\n4\n9\n5226", "4\n9\n6\n6\n1070", "10\n10\n10\n10\n100000", "1\n1\n1\n1\n1", "10\n10\n10\n10\n1", "10\n10\n1\n10\n10", "10\n10\n1\n10\n100", "2\n2\n2\n2\n1"], "outputs": ["12", "17", "100000", "0", "32718", "59392", "44835", "62982", "35246", "75083", "24656", "36320", "28244", "16540", "36302", "15539", "39901", "58048", "21956", "32736", "11118", "49547", "36019", "63537", "53678", "99831", "20360", "29931", "89535", "7682", "9224", "43539", "2438", "415", "10000", "1", "0", "10", "100", "0"]}

UNKNOWN

PYTHON3

CODEFORCES

410

913a723377dcbcee617e84424051c006

Guess the Array

This is an interactive problem. You should use flush operation after each printed line. For example, in C++ you should use fflush(stdout), in Java you should use System.out.flush(), and in Pascal — flush(output). In this problem you should guess an array *a* which is unknown for you. The only information you have initially is the length *n* of the array *a*. The only allowed action is to ask the sum of two elements by their indices. Formally, you can print two indices *i* and *j* (the indices should be distinct). Then your program should read the response: the single integer equals to *a**i*<=+<=*a**j*. It is easy to prove that it is always possible to guess the array using at most *n* requests. Write a program that will guess the array *a* by making at most *n* requests. none none Sample Input 5 9 7 9 11 6 Sample Output ? 1 5 ? 2 3 ? 4 1 ? 5 2 ? 3 4 ! 4 6 1 5 5

[ "nnums = int(input())\n\nans = [-1] * nnums\n\nprint(\"? 1 2\", flush = True)\na = int(input())\nprint(\"? 2 3\", flush = True)\nb = int(input())\nprint(\"? 3 1\", flush = True)\nc = int(input())\n\nans[0 : 3] = [(a-b+c)/2, (b-c+a)/2, (c-a+b)/2]\n\nfor i in range(3, nnums):\n print(\"? \" + str(i) + \" \" + str(i+1), flush = True)\n ans[i] = int(input()) - ans[i-1]\n\nprint('!', *map(int, ans))\n\t\t \t\t \t\t \t \t \t\t \t \t\t\t \t\t\t\t \t", "def ask (i, j):\n print (\"?\", i, j)\n resp = int(input())\n return resp\n\nn = int(input())\n\narr = {}\n\na = int(ask(1, 2))\nb = int(ask(1, 3))\nc = int(ask(2, 3))\n\narr[1] = int((a+b-c)/2)\narr[2] = int(a - arr[1])\narr[3] = int(b - arr[1])\n\n\nfor i in range(4, n+1):\n arr[i] = int(ask(i-1, i) - arr[i-1])\n\nprint(\"!\", *arr.values())\n \t \t \t\t\t \t \t \t \t \t\t\t\t \t\t\t", "import sys\n\nn = int(input())\n\nprint('? 1 2')\nsys.stdout.flush()\nsum_1_2 = int(input())\n\nprint('? 1 3')\nsys.stdout.flush()\nsum_1_3 = int(input())\n\nprint('? 2 3')\nsys.stdout.flush()\nsum_2_3 = int(input())\n\nvalue_3 = (sum_1_3 - sum_1_2 + sum_2_3) // 2\nvalue_2 = sum_2_3 - value_3\nvalue_1 = sum_1_2 - value_2\n\narray = [value_1, value_2, value_3]\n\nfor i in range(4, n+1):\n print('? 1 %d' % i)\n sys.stdout.flush()\n\n x = int(input())\n\n array.append(int(x - value_1))\n\nprint('! ', end='')\nprint(*array)\n\n\t\t\t \t \t \t\t \t\t\t \t\t \t \t\t\t \t", "n = int(input())\nprint(\"? 1 2\")\na = int(input())\nprint(\"? 1 3\")\nb = int(input())\nprint(\"? 2 3\")\nc = int(input())\nans = [(a + b - c) // 2]\nans.append(a - ans[0])\nans.append(b - ans[0])\nfor i in range(3, n):\n print(\"? 1\", i + 1)\n temp = int(input())\n ans.append(temp - ans[0])\nprint(\"! \", end=\"\")\nfor i in range(n):\n print(ans[i], end=\" \")\n \t\t \t\t \t \t\t\t\t \t\t\t \t\t\t \t\t\t", "n = int(input())\r\nlst = []\r\nprint(\"? 1 2\")\r\napb = int(input())\r\nprint(\"? 2 3\")\r\nbpc = int(input())\r\nprint(\"? 1 3\")\r\napc = int(input())\r\nlst.append(int((apb+apc-bpc)/2))\r\nlst.append(apb - lst[0])\r\nlst.append(bpc - lst[1])\r\nfor i in range(3, n):\r\n print(f\"? {i} {i+1}\")\r\n sum = int(input())\r\n lst.append(sum - lst[-1])\r\n\r\nprint(\"! \", end = \"\")\r\nfor i in lst:\r\n print(i, end=\" \")\r\nprint()", "n = int(input())\r\na=[0]*n\r\nprint('?',1,2,flush=1)\r\na1=int(int(input()))\r\nprint('?',2,3,flush=1)\r\na2=int(int(input()))\r\nprint('?',1,3,flush=1)\r\na3=int(input())\r\na[0]=(a1+a3-a2)//2\r\na[1]=a1-a[0]\r\na[2]=a3-a[0]\r\nfor i in range(3,n):\r\n print('?',1,i+1,flush=1)\r\n p=int(input())\r\n a[i]=p-a[0]\r\nprint('!',*a)\r\n\r\n", "import sys\n\nA = []\nn = int(input())\nprint(\"? 1 2\")\nsys.stdout.flush()\nr1 = int(input())\nprint(\"? 1 3\")\nsys.stdout.flush()\nr2 = int(input())\nprint(\"? 2 3\")\nsys.stdout.flush()\nr3 = int(input())\nA.append(str((r1 + r2 - r3)//2))\nA.append(str(r1 - int(A[0])))\nA.append(str(r2 - int(A[0])))\nfor i in range(3, n):\n print(\"? 1\", i + 1)\n sys.stdout.flush()\n A.append(str(int(input()) - int(A[0])))\ns = \" \".join(A)\nprint(\"!\", s)\n\t \t\t\t\t \t \t \t\t \t\t\t \t", "from sys import stdout\nn = int(input())\nprint('?', 1, 2)\na = int(input())\nstdout.flush()\nprint('?', 2, 3)\nb = int(input())\nstdout.flush()\nprint('?', 1, 3)\nc = int(input())\nstdout.flush()\nA = [(a + c - b) // 2, (a + b - c) // 2, (b + c - a) // 2]\nfor i in range(4, n + 1):\n print('?', 1, i)\n m = int(input())\n stdout.flush()\n A.append(m - A[0])\nprint('!', *A)\n\n\n", "n = int(input())\n\nprint(\"? 1 2\")\nn1 = int(input())\nprint(\"? 1 3\")\nn2 = int(input())\nprint(\"? 2 3\")\nn3 = int(input())\n\nnum1 = (n1 + n2 - n3) // 2\nnum2 = n1 - num1\nnum3 = n2 - num1\n\na = [num1, num2, num3]\nfor i in range(4, n + 1):\n print(\"? \" + \"1 \" + str(i))\n num = int(input())\n a.append(num - num1)\n\nprint(\"! \", end = \"\")\nprint(*a)\n\t\t\t\t \t \t \t\t\t \t\t \t\t \t\t \t \t\t", "n=int(input())\r\na=[0]*n\r\nprint('?',1,2)\r\na1=int(input())\r\nprint('?',2,3)\r\na2=int(input())\r\nprint('?',1,3)\r\na3=int(input())\r\na[0]=(a1+a3-a2)//2\r\na[1]=a1-a[0]\r\na[2]=a3-a[0]\r\nfor i in range(3,n):\r\n\tprint('?',1,i+1)\r\n\ta[i]=int(input())-a[0]\r\nprint('!',*a)", "n = int(input())\r\narr = [0 for i in range(n)]\r\nprint(\"? 1 2\")\r\na1 = int(input())\r\nprint(\"? 1 3\")\r\na2 = int(input())\r\nprint(\"? 2 3\")\r\na3 = int(input())\r\narr[0] = (a1+a2-a3) // 2\r\narr[1] = (a1-a2+a3) // 2\r\narr[2] = (-a1+a2+a3) // 2\r\nfor i in range(3,n):\r\n print(\"? 1 %d\"%(i+1))\r\n x = int(input())\r\n arr[i] = x - arr[0]\r\nprint(\"! \", end='')\r\nfor i in range(n):\r\n print(arr[i], end=' ')\r\n", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n nElements = int(input())\r\n dataRange = tuple(range(nElements+1))\r\n sumOfElements = list(map(int, (request(f'? {x} {y}') for x, y in\r\n zip(dataRange[1:-1], dataRange[2:]))))\r\n\r\n return guessForArrayFrom(dataRange, sumOfElements, int(request('? 1 3')))\r\n\r\n\r\ndef request(query):\r\n print(query, flush=True)\r\n return input()\r\n\r\n\r\ndef guessForArrayFrom(dataRange, subsequentElements, lastRequest):\r\n firstElement = prevElement = (subsequentElements[0] - subsequentElements[1] + lastRequest) // 2\r\n for i in dataRange[:-2]:\r\n subsequentElements[i] -= prevElement\r\n prevElement = subsequentElements[i]\r\n\r\n return f'! {firstElement} {\" \".join(map(str, subsequentElements))}'\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main(), flush=True)\r\n # main()\r\n", "n = int(input())\r\nprint(\"? 1 2\")\r\nx = int(input())\r\nprint(\"? 2 3\")\r\ny = int(input())\r\nprint(\"? 1 3\")\r\nz = int(input())\r\nlis = []\r\nc = (y+z-x)//2\r\na = (x+z-y)//2\r\nb = (x+y-z)//2\r\nlis.append(a)\r\nlis.append(b)\r\nlis.append(c)\r\n#print(lis)\r\nfor i in range(n-3):\r\n print(\"? \"+ str(i+3) + \" \"+ str(i+4))\r\n ii = int(input())\r\n next = ii-c\r\n lis.append(next)\r\n c = next\r\nprint(\"!\",*lis)\r\n", "n = int(input())\r\n \r\nprint('? 1 2', flush=True)\r\nx = int(input())\r\nprint('? 1 3', flush=True)\r\ny = int(input())\r\nprint('? 2 3', flush=True)\r\nz = int(input())\r\nl = []\r\nl.append(int((x + y - z)/2))\r\nl.append(x-l[0])\r\nl.append(y-l[0])\r\ncnt = 4\r\nwhile cnt <= n:\r\n print('? 1',cnt,flush=True)\r\n l.append(int(input())-l[0])\r\n cnt += 1\r\nres ='! '\r\nfor elem in l:\r\n res += str(elem) + ' '\r\n \r\nprint(res)", "#flush=True\r\nN=int(input())\r\narr=[0]*N\r\nprint(\"?\",1,2,flush=True)\r\na=int(input())\r\nprint(\"?\",2,3,flush=True)\r\nb=int(input())\r\nprint(\"?\",1,3,flush=True)\r\nc=int(input())\r\ns=(a+b+c)//2\r\narr[2]=s-a\r\narr[0]=s-b\r\narr[1]=s-c\r\nfor i in range(3,N):\r\n print(\"?\",1,i+1,flush=True)\r\n t=int(input())\r\n arr[i]=t-arr[0]\r\ns=\" \".join(str(x) for x in arr)\r\nprint(\"!\",s)", "\r\nimport sys\r\n\r\n\r\ndef query(i,j):\r\n print(\"?\",i,j)\r\n sys.stdout.flush()\r\n x=int(input())\r\n \r\n\r\n return x\r\ndef solve():\r\n n=int(input())\r\n arr=[0]*n\r\n x=query(1,2)\r\n y=query(2,3)\r\n z=query(1,3)\r\n arr[0]=(x-y+z)//2\r\n \r\n arr[2]=z-arr[0]\r\n arr[1]=y-arr[2]\r\n for i in range(4,n+1):\r\n x=query(1,i)\r\n arr[i-1]=x-arr[0]\r\n print(\"!\",*arr) \r\nsolve()\r\n\r\n\r\n\r\n\r\n\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\nprint(\"? 1 2\")\r\ns1 = int(input())\r\nprint(\"? 1 3\")\r\ns2 = int(input())\r\nprint(\"? 2 3\")\r\ns3 = int(input())\r\n\r\na1 = (s2-s3+s1)/2\r\na2 = s1-a1\r\na3 = s2-a1\r\nres = [int(a1),int(a2),int(a3)]\r\nfor i in range(4,n+1):\r\n print('? 1 ' + str(i))\r\n s = int(input())\r\n a = s - a1\r\n res.append(int(a))\r\n\r\nprint(\"! \" + \" \".join(map(str, res)))\r\n\r\n\r\n", "import sys\nfinal = []\ntamanho = int(input())\nprint(\"? 1 2\")\nsys.stdout.flush()\na = int(input())\nprint(\"? 2 3\")\nsys.stdout.flush()\nb = int(input())\nprint(\"? 1 3\")\nsys.stdout.flush()\nc = int(input())\nprimeiro = (a - b + c)/2\nsegundo = a - primeiro\nterceiro = c - primeiro\nfinal.append(\"!\")\nfinal.append(int(primeiro))\nfinal.append(int(segundo))\nfinal.append(int(terceiro))\nfor a in range(4,tamanho+1):\n print(\"? 1 %i\" %a)\n sys.stdout.flush()\n soma = int(input())\n atual = soma - primeiro\n final.append(int(atual))\nprint(*final)\n \t\t \t \t\t \t\t\t \t\t\t \t \t\t\t\t \t", "import sys \nshetchik = 3\nchislo = 0\nff = ''\na = ''\nn = input()\nn = int(n)\nff = '? 1 2 '\nprint(ff)\nsys.stdout.flush()\nb = input()\nb = int(b)\nff = '? 2 3 '\nprint(ff)\nsys.stdout.flush()\nc = input()\nc = int(c)\nf = c - b\nff = '? 1 3 '\nprint(ff)\nsys.stdout.flush()\nd = input()\nd = int(d)\npervoe = (d - f) // 2\ntretee = pervoe + f\nvtoroe = c - tretee\na = '! ' + str(pervoe) + ' ' + str(vtoroe) + ' ' + str(tretee)\nwhile shetchik < n :\n chislo = 0\n ff = '? 1 ' + str((shetchik+1))\n print(ff)\n sys.stdout.flush()\n h = input()\n h = int(h)\n chislo = h - pervoe\n a = a + ' ' + str(chislo)\n shetchik = shetchik + 1\nprint(a)\nsys.stdout.flush()\n", "n = int(input())\r\n \r\nprint('? 1 2')\r\na = int(input())\r\nprint('? 2 3')\r\nb = int(input())\r\nprint('? 1 3')\r\nc = int(input())\r\n \r\nx = (a - b + c) // 2\r\ny = a - x\r\nz = b - y\r\n \r\nans = \"! \" + str(x) + \" \" + str(y) + \" \" + str(z) + \" \"\r\n \r\nfor i in range(4, n + 1):\r\n print(\"? 1 \" + str(i))\r\n w = int(input())\r\n ans += str(w - x) + \" \"\r\n \r\nprint(ans.strip())", "n = int(input())\r\n\r\nprint(\"? 1 2\")\r\na = int(input())\r\nprint(\"? 2 3\")\r\nb = int(input())\r\nprint(\"? 1 3\")\r\nc = int(input())\r\n\r\nz = (c + b - a)//2\r\ny = b - z\r\nx = a - y\r\n\r\nlistt = [x, y, z]\r\n\r\nn -= 3\r\n\r\nfor i in range(n):\r\n print(\"? 1\", i + 4)\r\n q = int(input())\r\n q -= x\r\n listt.append(q)\r\n\r\nprint(\"!\", *listt)", "def ask(i, j):\r\n print('?', i, j)\r\n return int(input())\r\n\r\n\r\nn = int(input())\r\na = ask(1, 2)\r\nb = ask(2, 3)\r\nc = ask(1, 3)\r\nx = (a + b - c) // 2\r\nans = [a - x, x, c - a + x]\r\nfor i in range(4, n+1):\r\n ans += [ask(2, i) - x]\r\n\r\nprint('!', *ans)", "import sys\n\ndef query(i, j):\n print(f\"? {i} {j}\")\n sys.stdout.flush()\n soma = int(input())\n \n return soma\n\n\nn = int(input())\n\nx = query(1, 2)\ny = query(1, 3)\nz = query(2, 3)\n\npos_um = (x + y - z) // 2\npos_dois = x - pos_um\npos_tres = y - pos_um\n\narray = [pos_um, pos_dois, pos_tres]\n\nfor i in range(4, n + 1):\n array.append(query(1, i) - pos_um)\n\nprint('!' + \" \" + \" \".join(map(str, array)))\n\nprint()\n\t \t \t\t\t\t \t \t\t\t \t \t", "import sys\r\nfl = sys.stdout.flush\r\nr=[]\r\nn = int(input())\r\nprint('?',1,2)\r\nfl()\r\na = int(input())\r\nprint('?',2,3)\r\nfl()\r\nb = int(input())\r\nprint('?',1,3)\r\nfl()\r\nc = int(input())\r\nx = (a+c-b)//2\r\nr.append(x)\r\nr.append((a+b-c)//2)\r\nr.append((b+c-a)//2)\r\n\r\nfor i in range(4,n+1):\r\n print('?',1,i)\r\n fl()\r\n y = int(input())\r\n r.append(y-x)\r\nprint('!',*r)\r\nfl()", "#include <CodeforcesSolutions.h>\r\n#include <ONLINE_JUDGE <solution.cf(contestID = \"1418\",questionID = \"A\",method = \"GET\")>.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\n##########################################################################\r\n################# ---- THE ACTUAL CODE STARTS BELOW ---- #################\r\n\r\ndef solve():\r\n n = inp()\r\n print(\"?\",1,2,flush = True)\r\n q = inp()\r\n print(\"?\",2,3,flush = True)\r\n w = inp()\r\n print(\"?\",1,3,flush = True)\r\n qw = inp()\r\n qq = (q + w + qw) // 2\r\n a = [qq - w,qq - qw,qq - q]\r\n for i in range(3,n):\r\n print(\"?\",i,i + 1,flush = True)\r\n a.append(inp() - a[-1])\r\n print(\"!\",*a)\r\n\r\n################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################\r\n##########################################################################\r\n \r\ndef main():\r\n global tt\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(1,t + 1):\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\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#------------------ 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 counter_elements(a):\r\n q = dict()\r\n for i in range(len(a)):\r\n if a[i] not in q:\r\n q[a[i]] = 0\r\n q[a[i]] = q[a[i]] + 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\n \r\ndef factors(n):\r\n q = []\r\n for i in range(1,int(n ** 0.5) + 1):\r\n if n % i == 0: q.append(i); q.append(n // i)\r\n return(list(sorted(list(set(q)))))\r\n \r\ndef prime_factors(n):\r\n q = []\r\n while n % 2 == 0: q.append(2); n = n // 2\r\n for i in range(3,int(n ** 0.5) + 1,2):\r\n while n % i == 0: q.append(i); n = n // i\r\n if n > 2: q.append(n)\r\n return(list(sorted(q)))\r\n \r\ndef transpose(a):\r\n n,m = len(a),len(a[0])\r\n b = [[0] * n for i in range(m)]\r\n for i in range(m): \r\n for j in range(n): \r\n b[i][j] = a[j][i]\r\n return(b)\r\n\r\ndef factorial(n,m = 1000000007):\r\n q = 1\r\n for i in range(n):\r\n q = (q * (i + 1)) % m\r\n return(q)\r\n\r\ndef ceil(a,b):\r\n return -(-a // b)\r\n#-----------------------------------------------------------------------#\r\nONLINE_JUDGE = __debug__\r\nif ONLINE_JUDGE:\r\n input = sys.stdin.readline\r\n\r\n\r\n\r\nmain()", "def pergunte(i, j):\r\n print(\"? {} {}\".format(i, j))\r\n print()\r\n res = int(input())\r\n return res\r\n\r\nn = int(input())\r\n\r\narranjo = [0]*(n+3)\r\n\r\na = pergunte(1, 2)\r\nb = pergunte(1, 3)\r\nc = pergunte(2, 3)\r\n\r\narranjo[1] = (a + b - c) // 2\r\narranjo[2] = a - arranjo[1]\r\narranjo[3] = b - arranjo[1]\r\n\r\nfor i in range(4, n+1):\r\n arranjo[i] = pergunte(i-1, i) - arranjo[i-1]\r\n\r\nprint(\"!\", end=' ')\r\n\r\nfor i in range(1, n+1):\r\n print(arranjo[i], end=' ')\r\n\r\nprint()\r\n", "import sys\r\nfl = sys.stdout.flush\r\ndef get(x,y):\r\n print('?',x,y)\r\n fl()\r\n a = int(input())\r\n return a\r\n\r\ndef outl(x):\r\n print('!',*x)\r\n fl()\r\n\r\ndef out(x):\r\n print('!',x)\r\n fl()\r\n \r\nr=[]\r\nn = int(input())\r\na = get(1,2)\r\nb = get(2,3)\r\nc = get(1,3)\r\n\r\nx = (a+c-b)//2\r\nr.append(x)\r\nr.append((a+b-c)//2)\r\nr.append((b+c-a)//2)\r\n\r\nfor i in range(4,n+1):\r\n y = get(1,i)\r\n r.append(y-x)\r\noutl(r)", "import sys\r\n\r\nn = int(input())\r\nprint(\"? 1 2\")\r\nsys.stdout.flush()\r\ns12 = int(input())\r\nprint(\"? 2 3\")\r\nsys.stdout.flush()\r\ns23 = int(input())\r\nprint(\"? 1 3\")\r\nsys.stdout.flush()\r\ns13 = int(input())\r\n\r\na = [0] * n\r\na[0] = (s12 + s23 + s13) // 2 - s23\r\na[1] = (s12 + s23 + s13) // 2 - s13\r\na[2] = (s12 + s23 + s13) // 2 - s12\r\n\r\nfor i in range(3, n):\r\n print(\"?\", i, i + 1)\r\n sys.stdout.flush()\r\n s = int(input())\r\n a[i] = s - a[i - 1]\r\n\r\nprint(\"!\", \" \".join(map(str, a)))\r\n", "def g(i, j):\r\n print(\"? {} {}\".format(i, j))\r\n print()\r\n res = int(input())\r\n return res\r\n\r\nn = int(input())\r\n\r\najo = [0]*(n+3)\r\n\r\na = g(1, 2)\r\nb = g(1, 3)\r\nc = g(2, 3)\r\n\r\najo[1] = (a + b - c) // 2\r\najo[2] = a - ajo[1]\r\najo[3] = b - ajo[1]\r\n\r\nfor i in range(4, n+1):\r\n ajo[i] = g(i-1, i) - ajo[i-1]\r\n\r\nprint(\"!\", end=' ')\r\n\r\nfor i in range(1, n+1):\r\n print(ajo[i], end=' ')\r\n\r\nprint()\r\n", "if __name__ == '__main__':\r\n nr = int(input())\r\n # vector = []\r\n # for i in range(nr):\r\n # vector.append(0)\r\n vector = [0 for i in range(nr)]\r\n for i in range(1, nr):\r\n print(\"? 1\", i + 1)\r\n vector[i] = int(input())\r\n print(\"? 2 3\")\r\n m = int(input())\r\n val = (vector[1] - m + vector[2]) // 2\r\n print(\"!\", val, end = \" \")\r\n for i in range(1, nr):\r\n print(vector[i] - val, end = \" \")\r\n\r\n", "import sys\r\n\r\n\r\ndef perguntas(i, j):\r\n print(f\"? {i} {j}\")\r\n sys.stdout.flush()\r\n valor = int(input())\r\n return valor\r\n\r\n\r\nn = int(input())\r\nlista_num = [0] * (n + 1)\r\nx = perguntas(1, 2)\r\ny = perguntas(1, 3)\r\nz = perguntas(2, 3)\r\n\r\nlista_num[1] = (x + y - z) // 2\r\nlista_num[2] = (x - y + z) // 2\r\nlista_num[3] = (-x + y + z) // 2\r\n\r\nfor i in range(4, n + 1):\r\n num = perguntas(1, i)\r\n lista_num[i] = num - lista_num[1]\r\n\r\nprint(\"!\", *lista_num[1:], sep=\" \")\r\n", "'''Author- Akshit Monga'''\r\ndef query(i,j):\r\n print('?',i+1,j+1,flush=True)\r\n x=int(input())\r\n return x\r\nn=int(input())\r\nans=[0 for i in range(n)]\r\nval1=query(0,1)\r\nval2=query(1,2)\r\nval3=query(0,2)\r\nans[0]=(val1-val2+val3)//2\r\nans[1]=val1-ans[0]\r\nans[2]=val3-ans[0]\r\nfor i in range(3,n):\r\n temp=query(0,i)\r\n ans[i]=temp-ans[0]\r\nprint('!',*ans)", "from sys import stdout\r\n\r\nn = int(input())\r\nlista = []\r\n\r\nprint(f\"? {1} {2}\")\r\nstdout.flush()\r\nx = int(input())\r\n\r\nprint(f\"? {1} {3}\")\r\nstdout.flush()\r\ny = int(input())\r\n\r\nprint(f\"? {2} {3}\")\r\nstdout.flush()\r\nz = int(input())\r\n\r\nlista.append((x + y - z) // 2)\r\nlista.append((x - y + z) // 2)\r\nlista.append((-x + y + z) // 2)\r\n\r\nfor i in range(4, n + 1):\r\n print(f\"? {1} {i}\")\r\n stdout.flush()\r\n num = int(input())\r\n lista.append(num - lista[0])\r\n\r\nprint(\"!\", *lista, sep=\" \")\r\nstdout.flush()\r\n\r\n", "n = int(input())\r\nprint(\"? 1 2\")\r\na = int(input())\r\nprint(\"? 1 3\")\r\nb = int(input())\r\nprint(\"? 2 3\")\r\nc = int(input())\r\ns = [0] * n\r\ns[0] = (a + b + c) // 2 - c\r\ns[1] = (a + b + c) // 2 - b\r\ns[2] = (a + b + c) // 2 - a\r\nfor i in range(3, n):\r\n print(\"?\", 1, i + 1)\r\n a = int(input())\r\n s[i] = a - s[0]\r\nprint(\"!\", *s)", "n = int(input())\nar = []\n\nfor i in range(2, n+1):\n print('?', 1, i, flush=True)\n ar.append(int(input()))\n\n\nprint('?', 2, 3, flush=True)\n\nsum = int(input())\nar2 = []\nvar = ((ar[0]+sum+ar[1])//2)-sum\nar2.append(var)\n\n\nfor e in range(n-1):\n ar2.append(ar[e]-ar2[0])\n\n\nprint('!', *ar2)\n\n \t \t\t\t \t\t \t\t\t\t\t\t\t \t\t\t", "import math\nimport sys\n\ndef asks(a, b):\n print(f\"? {a} {b}\")\n sys.stdout.flush()\n ans = int(input())\n return ans\n\nsize = int(input())\nansArray = [0] * (size+3)\n\na = asks(1, 2)\nb = asks(1, 3)\nc = asks(2, 3)\nansArray[1] = (a+b-c)//2\nansArray[2] = a - ansArray[1]\nansArray[3] = b - ansArray[1]\n\nfor i in range(4, size+1):\n ansArray[i] = asks(i-1, i) - ansArray[i-1]\n\nprint(\"!\", *ansArray[1:size+1])\n\t\t \t \t\t \t\t\t\t \t\t \t\t\t \t \t", "import sys\r\n\r\ndef query(i, j):\r\n print(\"?\", i+1, j+1)\r\n sys.stdout.flush()\r\n res = int(input())\r\n return res\r\n\r\nn = int(input())\r\na = [0 for i in range(n)]\r\nq1 = query(0, 1)\r\nq2 = query(1, 2)\r\nq3 = query(0, 2)\r\na[0] = (q1 + q3 - q2)//2\r\na[1] = q1 - a[0]\r\na[2] = q3 - a[0]\r\nfor i in range(3, n): a[i] = query(0, i) - a[0]\r\nprint(\"!\", \" \".join([str(x) for x in a]))\r\nsys.stdout.flush()", "def g(i, j):\n print(\"? {} {}\".format(i, j))\n print()\n res = int(input())\n return res\n\nn = int(input())\n\najo = [0]*(n+3)\n\na = g(1, 2)\nb = g(1, 3)\nc = g(2, 3)\n\najo[1] = (a + b - c) // 2\najo[2] = a - ajo[1]\najo[3] = b - ajo[1]\n\nfor i in range(4, n+1):\n ajo[i] = g(i-1, i) - ajo[i-1]\n\nprint(\"!\", end=' ')\n\nfor i in range(1, n+1):\n print(ajo[i], end=' ')\n \t \t \t \t\t\t\t \t\t \t\t \t \t \t\t", "out = ['!']\n\nn = int(input())\na = int(input('? 1 2\\n'))\nb = int(input('? 2 3\\n'))\nc = int(input('? 1 3\\n'))\n\nf = (a - b + c) / 2\ns = a - f\nt = c - f\n\nout.append(int(f))\nout.append(int(s))\nout.append(int(t))\n\nfor i in range(4, n + 1):\n sum = int(input(f'? 1 {i}\\n'))\n out.append(int(sum - f))\n\nprint(*out)\n\t\t \t\t \t\t\t\t \t \t\t \t\t\t\t\t\t \t\t\t", "import sys\r\nn=int(input())\r\nw=[]\r\nfor i in range (2,n+1):\r\n print ('?',1,i)\r\n sys.stdout.flush()\r\n w.append(int(input()))\r\nprint ('?',2,3)\r\nsys.stdout.flush()\r\nx=int(input())\r\na=[]\r\na.append(((w[0]+x+w[1])//2)-x)\r\nfor i in range (n-1):\r\n a.append(w[i]-a[0])\r\nprint ('!', *a)\r\n \r\n", "t=1\r\nwhile t>0:\r\n t-=1\r\n n=int(input())\r\n a=[0]*5005\r\n sum=[0]*5005\r\n if n%2==1:\r\n for i in range(n-1):\r\n print('?',end=' ')\r\n print(i+1,end=' ')\r\n print(i+2,end=' ')\r\n x=int(input())\r\n sum[i+1]=x\r\n print('?',end=' ')\r\n print(1,end=' ')\r\n print(n)\r\n x=int(input())\r\n sum[n]=x\r\n num=0\r\n for i in range(1,n+1):\r\n num+=sum[i]\r\n num//=2\r\n for i in range(1,n,2):\r\n num-=sum[i]\r\n a[n]=num\r\n for i in range(n-1,0,-1):\r\n a[i]=sum[i]-a[i+1]\r\n print('!',end=' ')\r\n for i in range(1,n):\r\n print(a[i],end=' ')\r\n print(a[n])\r\n else:\r\n n-=1\r\n for i in range(n-1):\r\n print('?',end=' ')\r\n print(i+1,end=' ')\r\n print(i+2)\r\n x=int(input())\r\n sum[i+1]=x\r\n print('?',end=' ')\r\n print(1,end=' ')\r\n print(n)\r\n x=int(input())\r\n sum[n]=x\r\n num=0\r\n for i in range(1,n+1):\r\n num+=sum[i]\r\n num//=2\r\n for i in range(1,n,2):\r\n num-=sum[i]\r\n a[n]=num\r\n for i in range(n-1,0,-1):\r\n a[i]=sum[i]-a[i+1]\r\n print('?',end=' ')\r\n print(1,end=' ')\r\n print(n+1)\r\n x=int(input())\r\n sum[n+1]=x\r\n a[n+1]=sum[n+1]-a[1]\r\n print('!',end=' ')\r\n for i in range(1,n+1):\r\n print(a[i],end=' ')\r\n print(a[n+1])", "n = int(input())\n\nsaida = n*['']\n\nprint(\"? 1 2\")\num_dois = int(input())\n\nprint(\"? 2 3\")\ndois_tres = int(input())\n\nprint(\"? 3 1\")\ntres_um = int(input())\n\num = (tres_um - dois_tres + um_dois) // 2\nsaida[0] = str(um)\nsaida[1] = str(um_dois - um)\nsaida[2] = str(tres_um - um)\n\nfor i in range(4, n + 1):\n\tprint(f\"? {i} 1\")\n\tsaida[i -1] = str(int(input()) - um)\n\nprint(f\"! {' '.join(saida)}\")\n\n \t \t\t \t\t\t\t\t \t\t\t \t \t\t \t\t", "\nn = int(input())\n\nprint(\"? 1 2\")\nr1 = int(input())\nprint(\"? 2 3\")\nr2 = int(input())\nprint(\"? 1 3\")\nr3 = int(input())\nn1 = int((r1-r2+r3)/2)\na = [0 for i in range(n)]\na[0] = n1\na[1] = r1-n1\na[2] = r3-n1\n\nfor i in range(3,n):\n print(f\"? 1 {i+1}\")\n a[i]= int(input()) - n1 \n\nprint(\"!\",end=' ')\nprint(*a,sep=' ')\n\n\n \t\t\t \t \t \t \t \t\t \t \t \t\t", "import heapq,math\r\nfrom collections import defaultdict,deque\r\nfrom os import getcwd\r\nfrom itertools import permutations\r\n#from functools import cmp_to_key\r\n\r\nimport sys, os.path\r\n#sys.setrecursionlimit(10000000)\r\n\r\nif(os.path.exists('C:/Users/Dhanush/Desktop/cp/input.txt')):\r\n sys.stdout = open('C:/Users/Dhanush/Desktop/cp/output.txt', 'w')\r\n sys.stdin = open('C:/Users/Dhanush/Desktop/cp/input.txt', 'r')\r\n\r\n#input=sys.stdin.readline\r\ndef query(i,j):\r\n print('?',i,j)\r\n sys.stdout.flush()\r\n return int(input())\r\n\r\nn=int(input())\r\ns1=query(1,2)\r\ns2=query(2,3)\r\ns3=query(1,3)\r\nc=(s2+s3-s1)//2\r\nb=s2-c\r\na=s1-b\r\nres=[a,b,c]\r\nfor i in range(4,n+1):\r\n s=query(i-1,i)\r\n res.append(s-c)\r\n c=s-c\r\nprint('!',*res)\r\nsys.stdout.flush()", "n = int(input())\n\nprint(\"? 1 2\",flush=True)\nx = int(input())\nprint(\"? 2 3\",flush=True)\ny = int(input())\nprint(\"? 1 3\",flush=True)\nz = int(input())\n\nd = (x+y+z)//2\nans = []\nans.append(d-y)\nans.append(d-z)\nans.append(d-x)\nfor i in range(4,n+1):\n\tprint(\"? 1 {}\".format(i),flush=True)\n\ttemp = int(input())\n\tans.append(temp-ans[0])\n\t\nfinal = \"!\"\nfor i in ans:\n\tfinal += (\" \"+str(i))\nprint(final,flush=True)", "from sys import stdout\nn = int(input())\nc = []\nprint('? 1 2')\nstdout.flush()\nc.append(int(input()))\nprint('? 1 3')\nstdout.flush()\nc.append(int(input()))\nprint('? 2 3')\nstdout.flush()\nc.append(int(input()))\nt = (c[0]+c[1]-c[2])//2\na = [0,t,c[0]-t,c[1]-t]\nfor i in range(4,n+1):\n print('? 1 %d' % i)\n a.append(int(input())-a[1])\nprint('!',end=' ')\nprint(*a[1:])\n", "import sys\r\n\r\nn=int(input())\r\nprint('?',1,2)\r\nsys.stdout.flush()\r\ns1=int(input())\r\nprint('?',2,3)\r\nsys.stdout.flush()\r\ns2=int(input())\r\nprint('?',3,1)\r\nsys.stdout.flush()\r\ns3=int(input())\r\na=[0]*n\r\na[0]=(s1-s2+s3)//2\r\na[1]=s1-a[0]\r\na[2]=s3-a[0]\r\nfor i in range(3,n):\r\n print('?',1,i+1)\r\n sys.stdout.flush()\r\n s1=int(input())\r\n a[i]=s1-a[0]\r\nprint('!',*a)", "\r\n\r\n\r\n\r\n\r\n\r\nn = int(input().rstrip())\r\n\r\nprint('? 1 2')\r\nab = int(input().rstrip())\r\nprint('? 1 3')\r\nac = int(input().rstrip())\r\nprint('? 2 3')\r\nbc = int(input().rstrip())\r\n\r\na = (ac + ab - bc)//2\r\nb = ab - a\r\nc = ac - a\r\narr = [a, b, c]\r\n\r\nfor i in range(4,n+1):\r\n print(f'? 1 {i}')\r\n num = int(input().rstrip()) - a\r\n arr.append(num)\r\nprint('! ' + ' '.join(map(str,arr)))", "import sys\n\ndef guess():\n n = int(input())\n array = [0]*n\n sums = [0, 0, 0] # con los 3 primeros tendremos el resto.\n\n for i in range(3):\n if i == 0:\n index_1, index_2 = 1,2\n elif i == 1:\n index_1, index_2 = 2,3\n else:\n index_1, index_2 = 1,3\n\n print(f\"? {index_1} {index_2}\")\n sys.stdout.flush()\n res = int(input())\n sums[i] = res\n\n array[0] = (sums[0] + sums[2] - sums[1]) // 2\n array[2] = sums[2] - array[0]\n array[1] = sums[1] - array[2]\n\n for i in range(3, n):\n print(f\"? {i} {i + 1}\")\n sys.stdout.flush()\n res = int(input())\n array[i] = res - array[i - 1]\n print(f\"! {' '.join(map(str, array))}\")\n\nguess()\n\t \t \t \t \t\t\t \t \t \t\t\t\t\t \t\t \t\t", "n = int(input())\n\narr = [0] * n\n \ns1 = int(input('? 1 2 \\n'))\ns2 = int(input('? 2 3 \\n'))\ns3 = int(input('? 1 3 \\n'))\n \narr[0] = (s1 + s3 - s2) // 2\narr[1] = s1 - arr[0]\narr[2] = s3 - arr[0]\n \nfor i in range(3, n):\n print('? 1', i + 1)\n arr[i] = int(input()) - arr[0]\n \nprint('!', *arr)\n\t \t\t \t \t\t\t\t\t \t\t\t \t \t\t", "import os,sys\r\nfrom io import BytesIO, IOBase\r\n\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\n\r\nl=['a','e','i','o','u','y','A','E','O','I','U','Y']\r\n\r\nn=ii()\r\nl=[]\r\nprint(\"?\",1,2)\r\nsys.stdout.flush()\r\na=ii()\r\nprint(\"?\",1,3)\r\nsys.stdout.flush()\r\nb=ii()\r\nprint(\"?\",2,3)\r\nsys.stdout.flush()\r\nc=ii()\r\ne=(c+(a-b))//2 \r\nd=(b+(a-c))//2 \r\nf=(b+(c-a))//2 \r\nl.append(d)\r\nl.append(e)\r\nl.append(f)\r\nfor i in range(4,n+1):\r\n print(\"?\",1,i)\r\n sys.stdout.flush()\r\n g=ii()\r\n l.append(g-l[0])\r\nprint(\"!\",*l)", "n=int(input())\r\nprint(\"?\",1,2)\r\na=int(input())\r\nprint(\"?\",2,3)\r\nb=int(input())\r\nprint(\"?\",1,3)\r\nc=int(input())\r\nL=[0]*n\r\nL[0]=(a+c-b)//2\r\nL[1]=a-L[0]\r\nL[2]=b-L[1]\r\nfor i in range(3,n):\r\n print(\"?\",i+1,1)\r\n q=int(input())\r\n L[i]=q-L[0]\r\nprint(\"!\",*L)", "import sys\n\nn = int(input())\n\ndef print_flush(txt):\n print(txt)\n sys.stdout.flush()\n\nb = [0] * (n+1) # Index 1 is INDEX 1\n\nfor i in range(2, n+1):\n index1 = 1\n index2 = i\n\n print_flush(f\"? {index1} {index2}\")\n b[i-1] = int(input())\n\nprint_flush (f\"? {n-1} {n}\")\n\nb[n] = int(input())\n\n# Solving Ax = b, yielded the following pattern\n\nx = [0] * (n+1) # index i is INDEX i\n\nx_a = ( b[n-2] + b[n-1] - b[n]) // 2\nx_y = ( b[n-2] - b[n-1] + b[n]) // 2 \nx_z = (-b[n-2] + b[n-1] + b[n]) // 2\n\nfor i in range(2, n-1):\n x[i] = (2*b[i-1] - b[n-2] - b[n-1] + b[n]) // 2\n\nx[1] = x_a\nx[n-1] = x_y\nx[n] = x_z\n\n\nprintable = \" \".join([str(d) for d in x[1:]])\nprint_flush(f\"! {printable}\")\n\t\t\t\t\t \t\t\t \t \t \t \t\t\t\t \t\t\t \t", "import sys\r\nn=int(input())\r\narr=[]\r\nprint(\"?\",1,2)\r\narr.append(int(input()))\r\nsys.stdout.flush()\r\nprint(\"?\",2,3)\r\narr.append(int(input()))\r\nsys.stdout.flush()\r\nprint(\"?\",1,3)\r\narr.append(int(input()))\r\nsys.stdout.flush()\r\nfor i in range(3,n):\r\n print(\"?\",i,i+1)\r\n arr.append(int(input()))\r\n sys.stdout.flush()\r\nx=(arr[0]-arr[1]+arr[2])//2\r\ny=(arr[1]-arr[2]+arr[0])//2\r\nz=(arr[1]-arr[0]+arr[2])//2\r\nprint(\"!\",x,y,z,end=\" \")\r\nfor i in range(3,n):\r\n print(arr[i]-z,end=\" \")\r\n z=arr[i]-z\r\n", "n = int(input())\nprint(\"? 1 2\",flush=True)\nx = int(input())\nprint(\"? 2 3\",flush=True)\ny = int(input())\nprint(\"? 1 3\",flush=True)\nz = int(input())\na = (x - y + z) // 2\nb = (y - z + x) // 2\nc = (y + z - x) // 2\nA = f\"! {a} {b} {c}\"\nfor i in range(4,n+1):\n print(f\"? 1 {i}\",flush=True)\n s = int(input())\n A += f\" {s-a}\"\nprint(A)\n \t \t\t \t\t \t\t\t \t\t\t \t\t\t \t \t", "import sys\r\nn=int(input())\r\nl=[0 for i in range(n)]\r\nfor i in range(1,n):\r\n print(\"? 1\",i+1)\r\n sys.stdout.flush()\r\n l[i]=int(input())\r\nprint(\"? 2 3\")\r\nsys.stdout.flush()\r\na=int(input())\r\nt=(a+l[1]+l[2])//2\r\nl[0]=t-a\r\nprint(\"!\",l[0],end=\" \")\r\nsys.stdout.flush()\r\nfor i in range(1,n):\r\n print(l[i]-l[0],end=\" \")\r\n sys.stdout.flush()", "n=int(input())\r\nd=[]\r\nprint(\"?\",1,2,flush=1)\r\na=int(input())\r\nprint(\"?\",1,3, flush=1)\r\nb=int(input())\r\nprint(\"?\",2,3,flush=1)\r\nc=int(input())\r\nd.extend([(a+b-c)//2,(a-b+c)//2,(c-a+b)//2])\r\nfor i in range(3,n):\r\n print(\"?\",i,i+1,flush=1)\r\n x=int(input())\r\n d.append(x-d[-1])\r\nprint(\"!\",*d,flush=1)", "def 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\nn = inp()\r\n\r\nprint(\"? 1 2\")\r\nx1 = inp()\r\n\r\nprint(\"? 2 3\")\r\nx2 = inp()\r\n\r\nprint(\"? 1 3\")\r\nx3 = inp()\r\n\r\nfirst = (x1 + x2 + x3) // 2 - x2\r\nans = list()\r\nans.append(first)\r\nans.append(x1 - first)\r\nans.append(x3 - first)\r\nfor i in range(4, n + 1):\r\n print(\"? 1 \" + str(i))\r\n ans.append(inp() - first)\r\nprint(\"! \" + (\" \".join(map(str, ans))))\r\n", "from collections import Counter\r\nimport string\r\nimport bisect\r\n#import random\r\nimport math\r\nimport sys\r\n# sys.setrecursionlimit(10**6) \r\nfrom fractions import Fraction\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(arrber_of_variables):\r\n if arrber_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if arrber_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\ntestcases=1\r\nfor _ in range(testcases):\r\n n=vary(1)\r\n # solving three equations a1,a2,a3\r\n # a1+a2=x,a2+a3=y,a1+a3=z\r\n # a1=(x-y+z)//2,a2=(x+y-z)//2,a3=(z-x+y)//2\r\n ans=[]\r\n print('?',1,2,flush=True)\r\n x=vary(1)\r\n print('?',2,3,flush=True)\r\n y=vary(1)\r\n print('?',1,3,flush=True)\r\n z=vary(1)\r\n ans.extend(((x-y+z)//2,(x+y-z)//2,(z-x+y)//2))\r\n for i in range(3,n):\r\n print('?',i,i+1,flush=True)\r\n value=vary(1)\r\n ans.append(value-ans[-1])\r\n print('!',*ans)\r\n \r\n", "n = int(input())\nans = []\n\nprint(\"?\",1,2)\nq1 = int(input())\nprint(\"?\",1,3)\nq2 = int(input())\nprint(\"?\",2,3)\nq3 = int(input())\nd2 = q1 - q2\na3 = (q3 - d2)//2\na2 = a3 + d2\na1 = q1 - a2\n\nans += [a1,a2,a3]\nfor i in range(4,n+1):\n print(\"?\", 1, i)\n qi = int(input())\n ai = qi - a1\n ans.append(ai)\n\nprint(\"!\",*ans, sep=\" \")\n\t \t\t \t \t\t \t\t\t\t \t\t \t\t\t \t \t", "import sys\n \nn = int(input())\n \nprint('? 1 2')\nsys.stdout.flush()\nv1 = int(input())\n \nprint('? 1 3')\nsys.stdout.flush()\nv3 = int(input())\n \nprint('? 2 3')\nsys.stdout.flush()\nv2 = int(input())\n \na3 = (v3 - v1 + v2) // 2\na2 = v2 - a3\na1 = v1 - a2\n \nanswer = [a1, a2, a3] \nfor i in range(4, n+1):\n print('? 1 %d' % i)\n sys.stdout.flush()\n \n x = int(input())\n \n answer.append(int(x - a1))\n \nprint('! ', end='')\nprint(*answer)\n \t\t \t\t \t\t \t \t\t\t \t \t \t \t \t\t \t", "n = int(input())\r\n\r\nresult = [0]*(n+3)\r\n\r\nprint(\"? {} {}\".format(1, 2))\r\nprint()\r\na = int(input())\r\nprint(\"? {} {}\".format(1, 3))\r\nprint()\r\nb = int(input())\r\nprint(\"? {} {}\".format(2, 3))\r\nprint()\r\nc = int(input())\r\n\r\nresult[1] = (a + b - c) // 2\r\nresult[2] = a - result[1]\r\nresult[3] = b - result[1]\r\n\r\nfor i in range(4, n+1):\r\n print(\"? {} {}\".format(i-1, i))\r\n print()\r\n result[i] = int(input()) - result[i-1]\r\n\r\nprint(\"!\", end=' ')\r\n\r\nfor i in range(1, n+1):\r\n print(result[i], end=' ')\r\n", "n = int(input())\r\nprint('? 1 2')\r\nx = int(input())\r\nprint('? 2 3')\r\ny = int(input())\r\nprint('? 1 3')\r\nz = int(input())\r\nb = (x + y - z) // 2\r\na = [x - b, b, y - b]\r\nfor i in range(3, n):\r\n print(f'? {i} {i + 1}')\r\n a.append(int(input()) - a[-1])\r\nprint('!', *a)", "n = int(input())\nans = [0] * n\nprint('? 1 2')\na = int(input())\nprint('? 2 3')\nb = int(input())\nprint('? 1 3')\nc = int(input())\nans[0] = (a + c - b) // 2\nans[1] = a - ans[0]\nans[2] = b - ans[1]\nfor i in range(3, n):\n print('?', i + 1, i)\n a = int(input())\n ans[i] = a - ans[i - 1]\nprint('!', ' '.join(map(str, ans)))\n\t\t \t\t\t\t\t \t\t \t \t\t\t \t \t\t", "ls = []\r\nn = int(input())\r\nprint('? 1 2')\r\nn1 = int(input())\r\nprint('? 1 3')\r\nn2 = int(input())\r\nprint('? 2 3')\r\nn3 = int(input())\r\na = (n1 + n2 - n3)/2\r\nls.append(a)\r\nls.append(n1-a)\r\nls.append(n2-a)\r\nfor i in range(3,n):\r\n print('? 1 ' + str(i+1))\r\n nall = int(input())\r\n ls.append(nall-a)\r\n\r\nout = '! '\r\nfor x in ls:\r\n out += str(int(x)) + ' '\r\nprint(out[:-1])\r\n", "n = int(input())\nl = list(map(int, map(input, (\"? 2 3\\n\", \"? 1 3\\n\", \"? 1 2\\n\"))))\nl = [(l[i - 1] + l[i - 2] - l[i]) // 2 for i in (0, 1, 2)]\na, f = l[0], \"? 1 {}\\n\".format\nfor i in range(4, n + 1):\n l.append(int(input(f(i))) - a)\nprint(\"!\", \" \".join(map(str, l)))\n \t \t\t\t\t \t \t\t\t\t\t \t\t\t\t\t\t \t\t", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nn = int(input())\n\nans = [0]*3\n\nprint(\"?\",1,2)\nx = int(input())\n\nprint(\"?\",1,3)\ny = int(input())\n\nprint(\"?\",2,3)\nz = int(input())\n\nans[1]=((x+z)-y)//2\nans[0]=x-ans[1]\nans[2]=y-ans[0]\n\nfor i in range(4,n+1):\n print('?',i-1,i)\n x = int(input())\n ans.append(x-ans[i-2])\nprint('! ' + ' '.join(map(str,ans)))", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nn = int(input())\n\nr = [0]*3\n\nprint(\"?\",1,2)\nx = int(input())\n\nprint(\"?\",1,3)\ny = int(input())\n\nprint(\"?\",2,3)\nz = int(input())\n\nr[1]=((x+z)-y)//2\nr[0]=x-r[1]\nr[2]=y-r[0]\n\nfor i in range(4,n+1):\n print('?',i-1,i)\n x = int(input())\n r.append(x-r[i-2])\nprint('! ' + ' '.join(map(str,r)))\n \t\t \t \t\t\t \t\t\t \t\t\t \t\t \t\t \t \t \t", "\nimport sys\n \nn = int(input())\nlul = [0 for i in range(n)]\nprint('?', 1, 2)\nsys.stdout.flush()\na = int(input())\nprint('?', 2, 3)\nsys.stdout.flush()\nb = int(input())\nprint('?', 1, 3)\nsys.stdout.flush()\nc = int(input())\nlul[0] = (a + c - b) // 2\nlul[1] = a - lul[0]\nlul[2] = c - lul[0]\nfor i in range(4, n + 1):\n print('?', 1, i)\n sys.stdout.flush()\n k = int(input())\n lul[i - 1] = k - lul[0]\nprint('!', end=' ')\nprint(*lul)\nsys.stdout.flush()\n \t\t\t\t \t \t\t\t\t\t \t\t \t\t \t\t\t \t", "saida = ['!']\n\nn = int(input())\na = int(input('? 1 2\\n'))\nb = int(input('? 2 3\\n'))\nc = int(input('? 1 3\\n'))\n\nf = (a - b + c) / 2\ns = a - f\nt = c - f\n\nsaida.append(int(f))\nsaida.append(int(s))\nsaida.append(int(t))\n\nfor i in range(4, n + 1):\n sum = int(input(f'? 1 {i}\\n'))\n saida.append(int(sum - f))\n\nprint(*saida)\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\narr = []\r\nfor i in range(2,n+1):\r\n print(f\"? 1 {i}\")\r\n arr.append(int(input()))\r\nprint(\"? 2 3\")\r\nones = (arr[0] + arr[1] - int(input()))//2\r\nprint(f\"! {ones} {' '.join(str(a - ones) for a in arr)}\")\r\n", "# author: ankan2526\r\n\r\nimport math, bisect, heapq\r\n\r\nn=int(input())\r\nprint('?',1,2,flush=True)\r\nx=int(input())\r\nprint('?',2,3,flush=True)\r\ny=int(input())\r\nprint('?',1,3,flush=True)\r\nz=int(input())\r\n\r\na=[]\r\na.append((x-y+z)//2)\r\na.append(x-a[0])\r\na.append(z-a[0])\r\nfor i in range(4,n+1):\r\n print('?',1,i,flush=True)\r\n x=int(input())\r\n a.append(x-a[0])\r\nprint('!',*a,flush=True)\r\n", "from sys import stdout\n\ndef query(i,j):\n print('?',i+1,j+1)\n stdout.flush()\n return int(input())\n\nn = int(input())\narr = []\nfor i in range(1,n):\n arr.append(query(0,i))\n\ng = query(1,2)\nf = arr[1] - arr[0]\nth = (g+f)//2\nini = arr[1]-th\nans = [ini]\nfor i in range(1,n):\n ans.append(arr[i-1]-ini)\n\nprint('!',*ans)\nstdout.flush()\n", "def ask(i, j):\n print(f'? {i} {j}',flush=True)\n res = int(input())\n return res\n\nn = int(input())\n\na = ask(1,2)\nb = ask(1,3)\nc = ask(2,3)\n\nx = (a + b - c) // 2\ny = a - x\nz = b - x\nresp = f'{x} {y} {z}'\nfor i in range(4,n+1):\n resp += \" \" + str(ask(1,i) - x)\n\nprint(\"! \" + resp, flush=True)\n \t\t\t\t \t \t \t\t \t\t\t \t \t \t \t\t \t", "def gera_array():\n for i in range(4, n + 1):\n print(\"? \" + \"1 \" + str(i))\n num = int(input())\n lista.append(num - num1)\n\n\nn = int(input())\nprint(\"? 1 2\")\na = int(input())\nprint(\"? 1 3\")\nb = int(input())\nprint(\"? 2 3\")\nc = int(input())\n\nnum1 = int((a + b - c) // 2)\nnum2 = a - num1\nnum3 = b - num1\nlista = [num1, num2, num3]\n\ngera_array()\n\nprint(\"! \", end='')\nprint(*lista)\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\nanswer = []\r\nprint('? 1 2')\r\ns12 = int(input())\r\nprint('? 2 3')\r\ns23 = int(input())\r\nprint('? 3 1')\r\ns31 = int(input())\r\nanswer = [(s12+s31-s23)//2, (s12-s31+s23)//2, (-s12+s31+s23)//2]\r\nfor i in range(4, n+1):\r\n print('? 1', i)\r\n s = int(input())\r\n answer.append(s-answer[0])\r\nprint('!', *answer)", "import sys\r\n\r\nn = int(input())\r\na = [0 for i in range(n)]\r\n\r\nprint(\"?\", 1, 2)\r\nsys.stdout.flush()\r\nfirst = int(input())\r\nprint(\"?\", 1, 3)\r\nsys.stdout.flush()\r\nsecond = int(input())\r\ndiff = second-first\r\nprint(\"?\", 2, 3)\r\nsys.stdout.flush()\r\nthird = int(input())\r\nthird += diff\r\na[1] += third//2 - diff\r\na[2] += third//2\r\na[0] += first-a[1]\r\nfor i in range(3, n):\r\n print(\"?\", i, i+1)\r\n sys.stdout.flush()\r\n m = int(input())\r\n a[i] = m-a[i-1]\r\nprint(\"!\", *a)\r\nsys.stdout.flush()\r\n\r\n", "import sys\r\n\r\nn = int(input())\r\n\r\nsums = []\r\nfinal = [-1] * n\r\n\r\n# a1 + a2 = r1\r\nprint('?', 1, 2)\r\nsys.stdout.flush()\r\nsums.append(int(input()))\r\n\r\n# a1 + a3 = r2\r\nprint('?', 1, 3)\r\nsys.stdout.flush()\r\nsums.append(int(input()))\r\n\r\n# a2 + a3 = r3\r\nprint('?', 2, 3)\r\nsys.stdout.flush()\r\nsums.append(int(input()))\r\n\r\n# a3 = (r3 - r1 + r2) / 2\r\nfinal[2] = (sums[2] - sums[0] + sums[1]) / 2\r\n\r\n# a2 = a3 + r1 - r2\r\nfinal[1] = (final[2] + sums[0] - sums[1])\r\n\r\n# a1 = r1 - a2\r\nfinal[0] = (sums[0] - final[1])\r\n\r\n# para o restante, perguntar\r\nfor i in range(3, n):\r\n print('?', 1, i + 1)\r\n sys.stdout.flush()\r\n res = int(input())\r\n\r\n final[i] = res - final[0]\r\n\r\nprint('!', ' '.join(map(str, map(int, final))))\r\n", "import sys\r\nn=int(input())\r\nprint('? 1 2')\r\nsys.stdout.flush()\r\nx=int(input())\r\nprint('? 1 3')\r\nsys.stdout.flush()\r\ny=int(input())\r\nprint('? 2 3')\r\nsys.stdout.flush()\r\nz=int(input())\r\ns=(x+y+z)//2\r\na=[0]*n\r\na[0]=s-z\r\na[1]=s-y\r\na[2]=s-x\r\nfor i in range(4,n+1):\r\n print('? 1',i)\r\n sys.stdout.flush()\r\n x=int(input())\r\n a[i-1]=x-a[0]\r\nprint('!',end=' ')\r\nfor z in(a):\r\n print(z,end=' ')", "def ask(i, j):\r\n print(f'? {i} {j}',flush=True)\r\n res = int(input())\r\n return res\r\n\r\nn = int(input())\r\n\r\na = ask(1,2)\r\nb = ask(1,3)\r\nc = ask(2,3)\r\n\r\nx = (a + b - c) // 2\r\ny = a - x\r\nz = b - x\r\nresp = f'{x} {y} {z}'\r\nfor i in range(4,n+1):\r\n resp += \" \" + str(ask(1,i) - x)\r\n\r\nprint(\"! \" + resp, flush=True)", "n = int(input())\r\na = [0] * (n + 1)\r\nx, y, z = 0, 0, 0\r\n\r\nprint(\"? 1 2\")\r\nx = int(input())\r\nprint(\"? 1 3\")\r\ny = int(input())\r\nprint(\"? 2 3\")\r\nz = int(input())\r\n\r\na[1] = (x + y - z) // 2\r\na[2] = (x - y + z) // 2\r\na[3] = (-x + y + z) // 2\r\n\r\nfor p in range(4, n + 1):\r\n print(f\"? 1 {p}\")\r\n u = int(input())\r\n a[p] = u - a[1]\r\n\r\nprint(\"!\", end=\" \")\r\nfor p in range(1, n + 1):\r\n print(a[p], end=\" \")\r\nprint()", "import sys\r\nimport itertools\r\n\r\nn=int(input())\r\n\r\nprint(\"?\",1,2)\r\nsys.stdout.flush()\r\nab=int(input())\r\nprint(\"?\",2,3)\r\nsys.stdout.flush()\r\nbc=int(input())\r\nprint(\"?\",1,3)\r\nsys.stdout.flush()\r\nac=int(input())\r\n\r\nb=(ab+bc-ac)//2\r\na=ab-b\r\nc=ac-a\r\n\r\narr=[a,b,c]\r\n\r\nfor i in range(n-3):\r\n print(\"?\",i+3,i+4)\r\n q=int(input())\r\n arr.append(q-arr[-1])\r\n sys.stdout.flush()\r\n\r\nprint(\"!\",end=\" \")\r\nfor i in arr:\r\n print(i,end=\" \")\r\n sys.stdout.flush()\r\n\r\n", "import sys\r\n\r\nn = int(input())\r\nans = [-1]*n\r\nprint('? 1 2')\r\nsys.stdout.flush()\r\nx = int(input())\r\nprint('? 2 3')\r\nsys.stdout.flush()\r\ny = int(input())\r\nprint('? 1 3')\r\nsys.stdout.flush()\r\nz = int(input())\r\nans[0] = (x-y+z)//2\r\nans[1] = x-ans[0]\r\nans[2] = z-ans[0]\r\n\r\nfor i in range(3, n):\r\n print('? 1 '+str(i+1))\r\n sys.stdout.flush()\r\n ans[i] = int(input())-ans[0]\r\n \r\nprint('! '+' '.join(map(str, ans)))\r\nsys.stdout.flush()", "\nn = int(input())\narray = list(range(n+1))\n\nprint(f\"? 1 2\")\nsum12 = int(input())\n\nprint(f\"? 1 3\")\nsum13 = int(input())\n\nprint(f\"? 2 3\")\nsum23 = int(input())\n\nx = (sum12 + sum13 - sum23) // 2\n\narray[1] = x\narray[2] = sum12 - array[1]\narray[3] = sum13 - array[1]\n\n\nfor i in range(4, n+1):\n print(f\"? 1 {i}\")\n sum1i = int(input())\n array[i] = sum1i - array[1]\nprint(f\"! {' '.join(map(str,array[1:]))}\")\n\n\n\n\n", "n = int(input())\n\nprint('? 1 2')\nA = int(input())\nprint('? 1 3')\nB = int(input())\nprint('? 2 3')\nC = int(input())\n\nresult = []\n\nA1 = (A + B - C)//2\nA2 = (A + C - B)//2\nA3 = (B+C-A)//2\n\nresult = [str(A1), str(A2), str(A3)]\n\nif n > 3:\n for i in range(4, n+1):\n print('? 1 {}'.format(i))\n num = int(input())\n result.append(str(num - A1))\n\nprint('! {}'.format(' '.join(result)))\n", "import sys\r\n\r\n\r\ndef perguntas(i, j):\r\n print(f\"? {i} {j}\")\r\n sys.stdout.flush()\r\n valor = int(input())\r\n return valor\r\n\r\n\r\nn = int(input())\r\nlista_num = []\r\nprint(f\"? {1} {2}\")\r\nsys.stdout.flush()\r\nx = int(input())\r\nprint(f\"? {1} {3}\")\r\nsys.stdout.flush()\r\ny = int(input())\r\nprint(f\"? {2} {3}\")\r\nsys.stdout.flush()\r\nz = int(input())\r\n\r\nlista_num.append((x + y - z) // 2)\r\nlista_num.append((x - y + z) // 2)\r\nlista_num.append((-x + y + z) // 2)\r\n\r\nfor i in range(4, n + 1):\r\n num = perguntas(1, i)\r\n lista_num.append(num - lista_num[0])\r\n\r\nprint(\"!\", *lista_num, sep=\" \")\r\n\r\n# ! 2 7 3 5 2 2 6 3 8 3\r\n# ! 2 7 3 5 2 2 6 3 8 3\r\n", "#from sys import stdout\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n array = [0 for _ in range(n+1)]\r\n print('?', 1, 2, flush=True)\r\n first_plus_second = int(input())\r\n print('?', 1, 3, flush=True)\r\n first_plus_third = int(input())\r\n print('?', 2, 3, flush=True)\r\n second_plus_third = int(input())\r\n\r\n array[2] = (first_plus_second - first_plus_third + second_plus_third) // 2\r\n array[1] = first_plus_second - array[2]\r\n array[3] = second_plus_third - array[2]\r\n\r\n for i in range(4, n+1):\r\n print('?', 1, i, flush=True)\r\n array[i] = int(input()) - array[1]\r\n\r\n print('!', *array[1:], flush=True)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\na, b, c = [int(input('? ' + q + '\\n')) for q in ('1 2', '1 3', '2 3')]\r\nq = a + b - c >> 1\r\nt = [q, a - q, b - q]\r\nfor i in range(3, n): t += [int(input('? 1 ' + str(i + 1) + '\\n')) - q]\r\nprint('!', *t)", "import sys\r\n\r\nA = []\r\nn = int(input())\r\nprint(\"? 1 2\")\r\nsys.stdout.flush()\r\nr1 = int(input())\r\nprint(\"? 1 3\")\r\nsys.stdout.flush()\r\nr2 = int(input())\r\nprint(\"? 2 3\")\r\nsys.stdout.flush()\r\nr3 = int(input())\r\nA.append(str((r1 + r2 - r3)//2))\r\nA.append(str(r1 - int(A[0])))\r\nA.append(str(r2 - int(A[0])))\r\nfor i in range(3, n):\r\n print(\"? 1\", i + 1)\r\n sys.stdout.flush()\r\n A.append(str(int(input()) - int(A[0])))\r\ns = \" \".join(A)\r\nprint(\"!\", s)\r\n \t \t \t \t\t\t\t \t \t \t\t \t\t \t \t", "n = int(input())\n\narr = [0]*n\n\nprint(\"? 1 2\",flush=True)\na = int(input())\nprint(\"? 1 3\",flush=True)\nb = int(input())\nprint(\"? 2 3\",flush=True)\nc = int(input())\nsum = (a + b + c)//2\narr[0] = sum-c\narr[1] = sum-b\narr[2] = sum-a\n\nfor i in range(3,n):\n print(\"? 1 {}\".format(i+1))\n arr[i] = int(input()) - arr[0]\n\nprint(\"!\",end=\" \",flush=True)\nfor i in range(n):\n print(arr[i], end=\" \",flush=True)\n", "from sys import stdout\nn = int(input())\nnums = []\n\nfor i in range(2, n + 1):\n num = f'? 1 {i}'\n print(num)\n stdout.flush()\n ans = input()\n nums.append(int(ans))\n\nnum = f'? 2 3'\nprint(num)\nstdout.flush()\nans = input()\n\na1 = ((nums[0] + nums[1])-int(ans))/2\n\nwea = f'! {int(a1)}'\nfor i in range(n-1):\n nums[i] = nums[i] - a1\n wea += f' {int(nums[i])}'\n\n\nprint(wea)\n \t \t \t\t \t\t \t \t\t\t\t \t\t\t\t \t\t\t\t", "import math\r\nimport time\r\nfrom collections import defaultdict,deque\r\nfrom sys import stdin,stdout\r\nfrom bisect import bisect_left,bisect_right,bisect\r\nn=int(input())\r\nans=[0]*(n)\r\npre=[0]*(n-1)\r\nfor i in range(2,n+1):\r\n print(\"? 1\",i,flush=True)\r\n pre[i-2]=int(input())\r\n\r\na=pre[0]\r\nb=pre[1]\r\nprint(\"? 2 3\",flush=True)\r\nc=int(input())\r\nfirst=(a+b-c)//2\r\nans[0]=first\r\nfor i in range(n-1):\r\n ans[i+1]=pre[i]-first\r\nprint(\"!\",*ans)", "import sys\n\na = [0] * 5005\nn = 0\n\ndef ask(i, j):\n print(f\"? {i} {j}\", flush=True)\n return int(input())\n\ndef main():\n global n\n n = int(input())\n \n a1 = ask(1, 2)\n a2 = ask(2, 3)\n a3 = ask(1, 3)\n \n a[1] = (a1 + a2 + a3 - 2 * a2) // 2\n a[2] = (a1 + a2 + a3 - 2 * a3) // 2\n a[3] = (a1 + a2 + a3 - 2 * a1) // 2\n \n for i in range(4, n + 1):\n a1 = ask(1, i)\n a[i] = a1 - a[1]\n \n print('!', end='')\n \n for i in range(1, n + 1):\n print(f\" {a[i]}\", end='')\n \n print()\n sys.stdout.flush()\n\nif __name__ == \"__main__\":\n main()\n\n \t\t\t\t\t \t\t \t \t\t\t\t\t\t\t \t\t\t \t\t", "n = int(input())\npos1 = int(input('? 1 2\\n'))\npos2 = int(input('? 2 3\\n'))\npos3 = int(input('? 1 3\\n'))\n\nf = (pos1 - pos2 + pos3) // 2 \ns = pos1 - f\nt = pos3 - f\nresultado = ['!']\nresultado.append(str(f)) \nresultado.append(str(s))\nresultado.append(str(t))\n\nfor i in range(4, n + 1):\n print(f'? 1 {i}')\n soma = int(input())\n resultado.append(str(soma - f))\n\nprint(' '.join(resultado))\n \t\t\t \t \t\t\t\t \t \t\t \t \t \t\t\t\t", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\n\r\nprint(\"? 1 2\", flush=True)\r\nx = int(input())\r\nprint(\"? 2 3\", flush=True)\r\ny = int(input())\r\nprint(\"? 1 3\", flush=True)\r\nz = int(input())\r\n\r\nc = -(x - y - z) // 2\r\nb = y - c\r\na = z - c\r\nans = [a, b, c]\r\n\r\nfor i in range(4, n+1):\r\n print(\"?\", i-1, i, flush=True)\r\n q = int(input())\r\n ans.append(q - ans[-1])\r\n\r\nprint(\"!\", *ans)", "n = int(input())\r\na = [0 for i in range(n)]\r\nprint(\"? 1 2\")\r\nx = int(input())\r\nprint(\"? 2 3\")\r\ny = int(input())\r\nprint(\"? 1 3\")\r\nz = int(input())\r\na[2] = (y + z - x) // 2\r\na[0] = (x + z - y) // 2\r\na[1] = (x + y - z) // 2\r\nfor i in range(3, n):\r\n print(\"? 1 \" + str(i + 1))\r\n x = int(input())\r\n a[i] = x - a[0]\r\nprint(\"! \", end='')\r\nfor i in range(n):\r\n print(a[i], end=' ')# 1691410527.781079", "n = int(input())\na = [0] * n\n \nprint('? 1 2')\ns12 = int(input())\nprint('? 2 3')\ns23 = int(input())\nprint('? 1 3')\ns13 = int(input())\n \na[0] = (s12 + s13 - s23) // 2\na[1] = s12 - a[0]\na[2] = s13 - a[0]\n \nfor i in range(3, n):\n print('? 1', i + 1)\n a[i] = int(input()) - a[0]\n \nprint('! ' + ' '.join(map(str, a)))\n \t\t\t\t\t \t \t\t \t\t \t\t \t\t\t \t", "n = int(input())\r\nd = [0] * n\r\nprint('?', 1, 2)\r\na = int(input())\r\nprint('?', 2, 3)\r\nb = int(input())\r\nprint('?', 1, 3)\r\nc = int(input())\r\nx = (a+b+c)//2\r\nd[0] = x-b\r\nd[1] = x-c\r\nd[2] = x-a\r\nfor i in range(3, n):\r\n print('?', 1, i+1)\r\n x = int(input())\r\n d[i] = x-d[0]\r\n \r\nprint('!', *d)", "in1 = int(input())\narr = []\n\ncount = 1\nprint(\"? 1 2\")\nx = int(input())\nprint(\"? 2 3\")\ny = int(input())\nprint(\"? 3 1\")\nz = int(input())\n\narr = []\narr.append(int((x+z-y)/2))\nFIRST = arr[0]\narr.append(x-FIRST)\narr.append(z-FIRST)\n\nfor x in range(in1-3):\n print(\"? 1 \" + str(x+4))\n y = int(input())\n arr.append(y - FIRST)\n \nanswer = \"!\"\nfor x in arr:\n answer += \" \" + str(x)\n \nprint(answer)\n \t\t\t \t\t\t\t\t \t\t\t\t\t \t \t \t \t\t \t", "n = int(input())\n\nprint(\"? 1 2\")\nc1 = int(input())\nprint(\"? 2 3\")\nc2 = int(input())\nprint(\"? 1 3\")\nc3 = int(input())\nn1 = int((c1-c2+c3)/2)\na = [0 for i in range(n)]\na[0] = n1\na[1] = c1-n1\na[2] = c3-n1\nfor i in range(3,n):\n print(f\"? 1 {i+1}\")\n a[i] = int(input())-n1\nprint(\"!\",end=' ')\nprint(*a,sep= ' ')\n\t \t\t\t\t\t \t\t \t\t \t \t \t\t\t \t \t", "n = int(input())\r\nprint(\"? 1 2\",flush=\"\")\r\ns1 = int(input())\r\nprint(\"? 1 3\",flush=\"\")\r\ns2 = int(input())\r\nprint(\"? 2 3\",flush=\"\")\r\ns3 = int(input())\r\nx = int((s1-s3+s2)/2)\r\narr = [x,s1-x,s2-x]\r\nfor i in range(3,n):\r\n print(\"?\",1,i+1,flush=\"\")\r\n s = int(input())\r\n arr.append(s-arr[0])\r\nprint(\"!\", *arr)", "n = int(input())\n\nprint(\"? 1 2\")\nv1_2 = int(input())\nprint(\"? 1 3\")\nv1_3 = int(input())\nprint(\"? 2 3\")\nv2_3 = int(input())\n\na = (v1_3 - v2_3 + v1_2)//2\n\nresp = [''] * n \nresp[0] = str(a)\nresp[1] = str(v1_2 - a)\nresp[2] = str(v1_3 - a)\n\nfor c in range(4, n + 1):\n print(f\"? 1 {c}\")\n num = int(input())\n resp[c - 1] = str(num - a)\n\nprint(\"!\", end=' ')\nfor c in range(len(resp)):\n print(resp[c], end=' ')\n \n\t \t\t \t\t\t\t\t\t \t \t \t\t \t \t\t", "import sys\nflush = sys.stdout.flush\n\ndef leEntrada(a, b):\n print('?', a, b)\n flush()\n entrada = int(input())\n return entrada\n \ndef imprimeSaida(a):\n saida = ''\n for i in a:\n saida += str(i) + \" \"\n print('!', saida)\n flush()\n \ntamanho = int(input())\n\nlista = []\nentrada_a = leEntrada(1, 2)\nentrada_b = leEntrada(2, 3)\nentrada_c = leEntrada(1, 3)\n \naux1 = (entrada_a + entrada_c - entrada_b)//2\nlista.append(aux1)\nlista.append((entrada_a + entrada_b - entrada_c)//2)\nlista.append((entrada_b + entrada_c - entrada_a)//2)\n \nfor i in range(4, tamanho + 1):\n aux2 = leEntrada(1, i)\n lista.append(aux2 - aux1)\n\nimprimeSaida(lista)\n \t \t\t\t\t \t\t \t \t \t\t \t \t", "from sys import stdout\n\nn = int(input())\nlista = []\n\nprint(f\"? {1} {2}\")\nstdout.flush()\nx = int(input())\n\nprint(f\"? {1} {3}\")\nstdout.flush()\ny = int(input())\n\nprint(f\"? {2} {3}\")\nstdout.flush()\nz = int(input())\n\nlista.append((x + y - z) // 2)\nlista.append((x - y + z) // 2)\nlista.append((-x + y + z) // 2)\n\nfor i in range(4, n + 1):\n print(f\"? {1} {i}\")\n stdout.flush()\n num = int(input())\n lista.append(num - lista[0])\n\nprint(\"!\", *lista, sep=\" \")\nstdout.flush()\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 = [0] * n\r\nprint(\"? 1 2\")\r\na = int(input())\r\nprint(\"? 2 3\")\r\nb = int(input())\r\nprint(\"? 1 3\")\r\nc = int(input())\r\nans[0] = (a + b + c) // 2 - b\r\nans[1] = a - ans[0]\r\nans[2] = b - ans[1]\r\nfor i in range(3, n):\r\n print(f\"? {i} {i + 1}\")\r\n ans[i] = int(input()) - ans[i - 1]\r\nprint(\"!\", *ans)\r\n\n# Mon Aug 22 2022 11:06:09 GMT+0000 (Coordinated Universal Time)\n", "def main():\r\n n = int(input())\r\n arr = [0 for _ in range(n+1)]\r\n print('?', 1, 2)\r\n s1 = int(input())\r\n print('?', 1, 3)\r\n s2 = int(input())\r\n print('?', 2, 3)\r\n s3 = int(input())\r\n\r\n arr[2] = (s1 - s2 + s3) // 2\r\n arr[1] = s1 - arr[2]\r\n arr[3] = s3 - arr[2]\r\n\r\n for i in range(4, n+1):\r\n print('?', 1, i)\r\n arr[i] = int(input()) - arr[1]\r\n\r\n print('!', *arr[1:])\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\nkol=0\r\ni=0\r\nmass=[0,0,0]\r\na=sys.stdin.readline()\r\nn=int(a)\r\nsys.stdout.write('? 1 2'+'\\n')\r\nsys.stdout.flush()\r\na1=int(sys.stdin.readline())\r\nsys.stdout.write('? 2 3'+'\\n')\r\nsys.stdout.flush()\r\na2=int(sys.stdin.readline())\r\nsys.stdout.write('? 1 3'+'\\n')\r\nsys.stdout.flush()\r\na3=int(sys.stdin.readline())\r\nmass[0]=(a1+a2+a3)//2-a2\r\nmass[1]=(a1+a2+a3)//2-a3\r\nmass[2]=(a1+a2+a3)//2-a1\r\n\r\nfor i in range(3,n):\r\n sys.stdout.write('? 1 '+str(i+1)+'\\n')\r\n sys.stdout.flush()\r\n a=int(sys.stdin.readline())\r\n mass.append(a-mass[0])\r\ns=''\r\nfor i in mass:\r\n s+=' '+str(i)\r\nsys.stdout.write('!'+s+'\\n')\r\nsys.stdout.flush()\r\n \r\n", "n=int(input())\r\nanswer = []\r\ns12 = int(input('? 1 2\\n'))\r\ns23 = int(input('? 2 3\\n'))\r\ns31 = int(input('? 3 1\\n'))\r\nanswer = [(s12+s31-s23)//2, (s12-s31+s23)//2, (-s12+s31+s23)//2]\r\nfor i in range(4, n+1):\r\n s = int(input('? 1 {}\\n'.format(i)))\r\n answer.append(s-answer[0])\r\nprint('!', *answer)", "n = int(input())\r\nA = []\r\nprint('? 1 2')\r\nx = int(input())\r\nprint('? 1 3')\r\ny = int(input())\r\nprint('? 2 3')\r\nz = int(input())\r\nch_3 = (y+z-x)//2\r\nch_2 = z - ch_3\r\nch_1 = x - ch_2\r\nA.append(ch_1)\r\nA.append(ch_2)\r\nA.append(ch_3)\r\nfor i in range (4, n+1, 1):\r\n print('? 1', i)\r\n a = int(input())\r\n b = a - ch_1\r\n A.append(b)\r\nprint('!', *A)" ]

{"inputs": ["5\n4 6 1 5 5", "3\n1 1 1", "4\n100 1 100 1", "10\n9 5 10 7 4 4 8 5 10 5", "3\n1 1 1", "3\n100000 100000 100000", "3\n91906 50782 19777", "15\n5 10 10 7 7 6 4 6 8 10 8 4 10 9 4", "30\n2 3 3 4 3 2 4 4 4 3 3 2 4 2 3 4 4 2 4 3 4 2 2 4 3 3 4 4 4 4", "35\n4 2 2 2 4 4 3 2 4 2 2 4 2 2 3 2 3 4 4 2 3 2 2 4 3 3 3 3 4 2 3 2 2 2 3", "40\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3", "47\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3", "100\n76 92 53 18 65 98 100 65 93 72 100 44 70 62 78 61 89 89 80 32 88 64 67 27 46 30 75 14 78 94 8 86 41 9 68 38 76 29 69 44 23 23 14 24 97 14 7 98 45 80 55 71 58 35 41 100 60 54 64 85 56 98 87 93 40 62 92 6 7 27 88 85 10 94 25 43 99 65 82 65 39 34 17 100 49 27 4 15 84 10 35 76 98 52 72 17 43 10 49 5"], "outputs": ["5 out of 5", "3 out of 3", "4 out of 4", "10 out of 10", "3 out of 3", "3 out of 3", "3 out of 3", "15 out of 15", "30 out of 30", "35 out of 35", "40 out of 40", "47 out of 47", "100 out of 100"]}

UNKNOWN

PYTHON3

CODEFORCES

109

9143317c9ec97376be9a5c100718a323

Passwords

Vanya is managed to enter his favourite site Codehorses. Vanya uses *n* distinct passwords for sites at all, however he can't remember which one exactly he specified during Codehorses registration. Vanya will enter passwords in order of non-decreasing their lengths, and he will enter passwords of same length in arbitrary order. Just when Vanya will have entered the correct password, he is immediately authorized on the site. Vanya will not enter any password twice. Entering any passwords takes one second for Vanya. But if Vanya will enter wrong password *k* times, then he is able to make the next try only 5 seconds after that. Vanya makes each try immediately, that is, at each moment when Vanya is able to enter password, he is doing that. Determine how many seconds will Vanya need to enter Codehorses in the best case for him (if he spends minimum possible number of second) and in the worst case (if he spends maximum possible amount of seconds). The first line of the input contains two integers *n* and *k* (1<=≤<=*n*,<=*k*<=≤<=100) — the number of Vanya's passwords and the number of failed tries, after which the access to the site is blocked for 5 seconds. The next *n* lines contains passwords, one per line — pairwise distinct non-empty strings consisting of latin letters and digits. Each password length does not exceed 100 characters. The last line of the input contains the Vanya's Codehorses password. It is guaranteed that the Vanya's Codehorses password is equal to some of his *n* passwords. Print two integers — time (in seconds), Vanya needs to be authorized to Codehorses in the best case for him and in the worst case respectively. Sample Input 5 2 cba abc bb1 abC ABC abc 4 100 11 22 1 2 22 Sample Output 1 15 3 4

[ "import math\r\nn,k= map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n w= input()\r\n l.append(w)\r\nr= input()\r\nl.sort(key=len)\r\nle= len(r)\r\nm=[x for x in l if len(x)<le]\r\nprint((len(m)+1)+(len(m)//k)*5,end=\" \") #best\r\no= [x for x in l if len(x)<=le]\r\nprint(((len(o)-1)//k)*5+ len(o)) #worst\r\n\r\n", "def solution(passwords, correct_pass, k) -> None:\n # Init\n n = len(correct_pass)\n n1 = n2 = 0\n for x in passwords:\n l = len(x)\n if l < n: n1 += 1\n elif l == n: n2 += 1\n\n # Work\n res = (n1 // k) * (k + 5)\n extra = (n1 % k)\n\n # Best case\n best = res + extra + 1\n\n other = extra + n2 - 1\n\n # Worst case\n worst = (other // k) * (k + 5)\n worst += res + (other % k) + 1\n\n print(\"{} {}\".format(best, worst))\n\n\ndef main():\n p, q = map(int, input().split())\n passwords = []\n for i in range(p):\n passwords.append(input())\n correct_pass = input()\n solution(passwords, correct_pass, q)\n\n\nif __name__ == \"__main__\":\n main()\n", "def myFunc(e):\r\n return len(e)\r\nn ,k =map(int,input().split())\r\nliste = []\r\ncompteur = 1\r\ncompteurmax = 0\r\ni = 0\r\nr = 0\r\nfor loop in range(n):\r\n texte = input()\r\n liste.append(texte)\r\nliste.sort(reverse = False,key=myFunc)\r\nsolution = input()\r\nwhile len(liste[i]) != len(solution):\r\n compteur +=1\r\n i +=1\r\n r += 1\r\n if r%k==0:\r\n compteur +=5\r\ncompteurmax = compteur\r\ni +=1\r\nif i<len(liste):\r\n while len(liste[i]) == len(solution):\r\n i +=1\r\n r +=1\r\n compteurmax +=1\r\n if r%k == 0:\r\n compteurmax+=5\r\n if i ==len(liste):\r\n break\r\nprint(\"{} {}\".format(compteur,compteurmax))\r\n \r\n", "n,k=map(int,input().split())\r\nst=tuple(len(input())for i in range(n))\r\nn=len(input())\r\nr=0\r\nq=-1\r\nfor i in st:\r\n\tr+=n>i\r\n\tq+=n>=i\r\nprint(1+r+r//k*5,1+q+q//k*5)\r\n", "n, k = list(map(int, input().split()))\n\ncount_len_password = [0] * 101 # length password != 0\n\nfor _ in range(n):\n wrong_password = input()\n count_len_password[len(wrong_password)] += 1\n\ntrue_password = input()\n\nbest_case = 0\nworst_case = 0\n\ni = 1\nwhile i < len(true_password):\n best_case += count_len_password[i]\n i += 1\n\nworst_case += best_case + count_len_password[i] - 1\n\nbest_case += int(best_case / k) * 5 + 1\nworst_case += int(worst_case / k) * 5 + 1\n\nprint(best_case, worst_case)", "n, k = map(int, input().split())\r\na = [0] * n\r\nfor i in range(n):\r\n a[i] = len(input())\r\nrp = len(input())\r\na = sorted(a)\r\nc = a.index(rp) + 1\r\nb = n - a[::-1].index(rp)\r\nminatemps = c + (c - 1) // k * 5\r\nmaxatemps = b + (b - 1) // k * 5\r\nprint(minatemps, maxatemps)\r\n", "I=input\r\nn,k=map(int,I().split())\r\na=sorted(len(I())for _ in '0'*n)\r\np=len(I())\r\nt=a.index(p)\r\na,b=t,t+a.count(p)\r\nprint(1+a+a//k*5,b+(b-1)//k*5)", "n, k = [int(i) for i in input().split()]\npassws = []\nfor i in range(n):\n passws.append(input())\nmain = input()\nml = len(main)\n\nlens = [0] * 101\nfor i in passws:\n lens[len(i)] += 1\n\nmls = sum(lens[:ml])\nmls2 = sum(lens[:ml+1])\nprint(mls + (mls//k)*5 + 1, mls2 + ((mls2-1)//k)*5)", "n, k = list(map(int, input().split()))\r\nlst = []\r\nfor i in range(n+1):\r\n s = input()\r\n lst.append(s)\r\nvanya_password = lst[-1]\r\nlst.pop(-1)\r\nbest_case = 0\r\nworst_case = 0\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(len(lst)):\r\n if(len(lst[i]) < len(vanya_password)):\r\n count1+=1\r\n#for j in range(len(lst)):\r\n if(len(lst[i]) <= len(vanya_password)):\r\n count2+=1\r\n#print(count1,count2)\r\nbest_case = count1 + (count1//k)*5 + 1\r\nworst_case = count2 + ((count2-1)//k)*5\r\nprint('{0} {1}'.format(best_case,worst_case))\r\n#print(s)\r\n\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\nlist_pass = []\r\nfor i in range(0, n):\r\n list_pass.append(input())\r\ntrue_pass = input()\r\n\r\ntotal_minTime = total_maxTime = 0\r\n\r\nnumSameLen = 0\r\nnumSmallLen = 0\r\n\r\nfor i in range(0, n):\r\n if (len(list_pass[i]) < len(true_pass)):\r\n numSmallLen += 1\r\n elif (len(list_pass[i]) == len(true_pass)):\r\n numSameLen += 1\r\n\r\ntotal_minTime = (numSmallLen//k)*5 + 1 + numSmallLen\r\n\r\nnumSameLen += numSmallLen\r\ntotal_maxTime = ((numSameLen-1)//k)*5+numSameLen\r\n\r\nprint(total_minTime, total_maxTime)\r\n", "n, k = map(int, input().split())\r\nd = []\r\n\r\nfor _ in range(n):\r\n d.append(len(input()))\r\ns = input()\r\nd.sort()\r\nc = sum(i < len(s) for i in d)\r\nmi = c + (c//k)*5 + 1\r\n\r\nc = sum(i <= len(s) for i in d)\r\nma = c + ((c-1)//k)*5\r\n\r\nprint(mi, ma)\r\n", "import sys\r\nimport math\r\ninput=sys.stdin.readline\r\nq=[]\r\np=[0]*101\r\nn,k=map(int,input().strip().split(\" \"))\r\nfor i in range(n):\r\n s=input()\r\n q.append(s)\r\n p[len(s)-1]+=1\r\nr=input()\r\ncnt=0\r\nmcnt=0\r\nfor i in range(0,len(r)-1):\r\n cnt+=p[i]\r\nt=cnt+1+(cnt//k)*5\r\ncnt+=p[len(r)-1]\r\ncnt+=((cnt-1)//k)*5\r\nprint(t,cnt)", "n, k = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n\tinp = input()\r\n\ts.append(inp)\r\np = input()\r\ncnt_less = cnt_less_and_equal = time = 0\r\n\r\nfor i in s:\t\r\n\tif (len(i) < len(p)):\r\n\t\tcnt_less += 1\r\n\t\tcnt_less_and_equal += 1\r\n\r\n\telif (len(i) == len(p)):\r\n\t\tcnt_less_and_equal += 1\r\n \r\nprint(cnt_less + cnt_less//k * 5 + 1, cnt_less_and_equal + (cnt_less_and_equal - 1) // k * 5)", "# RawCoder : https://bit.ly/RCyouTube\r\n# Author : MehulYK\r\n\r\ndef lmap():\r\n return list(map(int, input().split()))\r\ndef mmap(): \r\n return map(int, input().split())\r\n\r\nn, k = mmap()\r\npsd = [] #array to store tried passwords\r\npsdl = [] #array to store password lengths\r\n\r\nfor i in range(n):\r\n ps = input() #password\r\n psd.append(ps)\r\n psdl.append(len(ps))\r\n\r\nops = input() #org password\r\nopsl = len(ops) #org password's length\r\n\r\npsdl.sort()\r\n\r\nind = psdl.index(opsl) #starting index of password of length opsl\r\n\r\nif(ind == 0):\r\n best = 1\r\n\r\nelse:\r\n pen = (ind // k) * 5 #penalty\r\n best = pen + ind + 1\r\n\r\ntem = psdl.count(opsl) #no of pswds of length opsl\r\ncnt = (ind + tem) #finding the position of ops in the worst case\r\n\r\npen = ((cnt - 1) // k) * 5 #penalty\r\nworst = pen + cnt\r\n\r\nprint(best, worst)", "n, k = map(int, input().split())\r\nlst = [input() for _ in range(n)]\r\ncorrect_password = input()\r\ncnt1 = 0\r\ncnt_le = 0\r\nfor pas in lst:\r\n if len(pas) < len(correct_password):\r\n cnt1 += 1\r\n if len(pas) <= len(correct_password):\r\n cnt_le += 1\r\n\r\nbest_case = cnt1 +(cnt1//k)*5 + 1\r\nworse_case = cnt_le + ((cnt_le-1)//k)*5\r\n\r\nprint(best_case, worse_case)", "n, k = map(int, input().split())\n\nmax_password_len = 100\npassword_len_freqs = [0 for i in range(max_password_len + 1)]\npasswords = []\nfor i in range(n):\n curr_password = input().strip()\n password_len_freqs[len(curr_password)] += 1\n passwords.append(curr_password)\n\ncorrect_password = input().strip()\ncorrect_password_len = len(correct_password)\nnum_passwords_before = sum(password_len_freqs[:correct_password_len])\n\nblocked_waiting_time = 5\n\nnum_entries_mn = num_passwords_before + 1\nnum_blocks_mn = (num_entries_mn - 1) // k\nmn_waiting_time = num_blocks_mn * blocked_waiting_time + num_entries_mn\n\nnum_entries_mx = num_passwords_before + password_len_freqs[correct_password_len]\nnum_blocks_mx = (num_entries_mx - 1) // k\nmx_waiting_time = num_blocks_mx * blocked_waiting_time + num_entries_mx\n\nprint(str(mn_waiting_time) + ' ' + str(mx_waiting_time))\n", "a,b=map(int,input().split())\r\nd=[len(input()) for x in range(a)]\r\nd.sort()\r\nc=len(input())\r\ni=d.index(c)\r\nr=i+d.count(c)\r\nprint(i+1+i//b*5,r+(r-1)//b*5)\r\n", "I=input\n \nn,k=map(int,I().split())\n \na=sorted(len(I())for _ in '0'*n)\n \np=len(I())\n \nt=a.index(p)\n \na,b=t,t+a.count(p)\n \nprint(1+a+a//k*5,b+(b-1)//k*5)\n\t\t\t\t\t \t \t \t\t \t \t \t\t\t\t \t", "def solve(passwords, k, correct):\r\n less_length_num = sum(1 for password in passwords if len(password) < len(correct))\r\n same_length_num = sum(1 for password in passwords if len(password) == len(correct))\r\n \r\n return \"{} {}\".format(compute_time(k, less_length_num), compute_time(k, less_length_num + same_length_num - 1))\r\n\r\ndef compute_time(k, before_num):\r\n return before_num + (before_num // k) * 5 + 1\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n passwords = [input() for _ in range(n)]\r\n correct = input()\r\n \r\n print(solve(passwords, k, correct))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,k=map(int,input().strip().split())\nv=[0]*101\nfor i in range(n):\n\ts=input()\n\tv[len(s)]+=1\ncorr=len(input())\ni=1\nc=0\nwhile i<corr:\n\tc+=v[i]\n\ti+=1\n\nbest= c+1+int(c/k)*5\nc+=v[corr]-1\nworst= c+1+int(c/k)*5\n\nprint(best,worst)\n\t \t \t\t \t \t\t\t\t \t \t\t\t\t\t\t\t\t", "number_of_passwords, number_of_failed_tries = map(int, input().split())\r\n\r\ncnt = [0] * 101\r\n\r\nfor _ in range(number_of_passwords):\r\n current_password = input()\r\n cnt[len(current_password)] += 1\r\n\r\ncorrect_password = input()\r\n\r\nbest_time = worst_time = 0\r\n\r\nfor i in range(len(correct_password)):\r\n best_time += cnt[i]\r\n\r\nworst_time = best_time + cnt[len(correct_password)] - 1\r\n\r\nbest_time += (best_time // number_of_failed_tries * 5) + 1\r\nworst_time += (worst_time // number_of_failed_tries * 5) + 1\r\n\r\nprint(f'{best_time} {worst_time}')\r\n", "n, k = map(int, input().split())\r\na = [input() for i in range(n)]\r\npa = input()\r\nfor i in range(len(a)):\r\n a[i] = [len(a[i])] + [a[i]]\r\na.sort()\r\nfor i in range(len(a)):\r\n if len(a[i][1]) == len(pa):\r\n ind1 = i\r\n break\r\nfor i in range(len(a)-1, -1, -1):\r\n if len(a[i][1]) == len(pa):\r\n ind2 = i\r\n break\r\nprint(ind1 + 1 + ind1 // k * 5, ind2 + 1 + ind2 // k * 5)\r\n", "import os\r\nimport sys\r\nimport math\r\nimport heapq\r\nfrom decimal import *\r\nfrom io import BytesIO, IOBase\r\nfrom collections import defaultdict, deque\r\n\r\ndef r():\r\n return int(input())\r\ndef rm():\r\n return map(int,input().split())\r\ndef rl():\r\n return list(map(int,input().split()))\r\n\r\nn,k=rm()\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\npassword = input()\r\n\r\npassLen = len(password)\r\ntime=0\r\nmin=0\r\nmax=0\r\ngotMin=False\r\ngotMax=False\r\n\r\nb = []\r\nfor i in a:\r\n b.append(len(i))\r\nb.sort()\r\nkii=0\r\n\r\nfor i in b:\r\n if i<passLen:\r\n time+=1\r\n kii+=1\r\n kiii=False\r\n elif i == passLen and not gotMin:\r\n time+=1\r\n kii+=1\r\n gotMin=True\r\n min=time\r\n kiii=False\r\n elif i== passLen:\r\n time+=1\r\n kii+=1\r\n kiii=False\r\n else:\r\n max=time\r\n gotMax=True\r\n break\r\n if kii==k:\r\n time+=5\r\n kiii=True\r\n kii=0\r\nif gotMax:\r\n if kiii==True:\r\n max-=5\r\nif not gotMax:\r\n if kiii==True:\r\n time-=5\r\n max=time\r\n\r\nprint(min, max)\r\n", "n, k = map(int, input().split())\r\npassword = []\r\nfor i in range(n):\r\n s = input()\r\n password.append(s)\r\nres = input()\r\nlower, upper = 0, 0\r\n\r\nfor i in range(n):\r\n lower += (len(password[i]) < len(res))\r\n upper += (len(password[i]) <= len(res))\r\nprint(lower + (lower//k) * 5 + 1, upper + ((upper - 1)//k) * 5)", "password, n_errors = input().split()\r\nlis = []\r\nfor x in range(int(password)):\r\n lis.append(input())\r\nlis = sorted(lis,key=len)\r\nvalid = input()\r\ncount = 0\r\nlower = 0\r\nfor x in lis:\r\n if len(x)< len(valid):\r\n lower += 1\r\n elif len(x)==len(valid) and x!= valid:\r\n count += 1\r\nprint(((lower)//int(n_errors)*5+(lower)+1),((lower+count)//int(n_errors)*(5)+(lower+count)+1))", "# your code goes here\r\n# your code goes here\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(input())\r\ns=input()\r\nlc=0#counts less length strings\r\nec=0#counts equal length strings:\r\nfor i in l:\r\n\tif(len(i)<len(s)):\r\n\t\tlc=lc+1\r\n\tif(len(i)==len(s)):\r\n\t\tec=ec+1\r\nbt=0#best case time\r\nwt=0#worst case time\r\nfor i in range(lc):\r\n\tif((i+1)%m==0):\r\n\t\tbt=bt+6\r\n\telse:\r\n\t\tbt=bt+1\r\nfor i in range(lc+ec-1):\r\n\tif((i+1)%m==0):\r\n\t\twt=wt+6\r\n\telse:\r\n\t\twt=wt+1\r\nprint(bt+1,wt+1)\r\n\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\nm = 105\r\nx = [set() for _ in range(m)]\r\nfor _ in range(n):\r\n s = input().rstrip().decode()\r\n x[len(s)].add(s)\r\ns = input().rstrip().decode()\r\nl = len(s)\r\nc = 0\r\nfor i in range(1, l):\r\n c += len(x[i])\r\nans = [0] * 2\r\nans[0] = c + 1 + c // k * 5\r\nc += len(x[l]) - 1\r\nans[1] = c + 1 + c // k * 5\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n,k=map(int,input().split())\r\nd=dict()\r\ndi=dict()\r\nfor i in range(n):\r\n\ts=input()\r\n\td[s]=len(s)\r\nfor i in d.values():\r\n\tif i in di:\r\n\t\tdi[i]+=1\r\n\telse:\r\n\t\tdi[i]=1\r\ncount=1\r\ncoun=0\r\npwd=input()\r\nfor i in sorted(di.items(),key=lambda x:x[0]):\r\n\tif len(pwd)>i[0]:\r\n\t\tcount+=i[1]\r\n\tif i[0]<=len(pwd):\r\n\t\tcoun+=i[1]\r\nif count%k==0:\r\n\tz=(count/k)-1\r\nelse:\r\n\tz=count//k\r\nif coun%k==0:\r\n\ty=(coun/k)-1\r\nelse:\r\n\ty=coun//k\r\ncoun+=(5*y)\r\ncount+=(5*z)\r\nprint(int(count),int(coun))", "N, K = list(map(int, input().split()))\r\nX = []\r\nfor i in range(N): X.append(input())\r\nP = len(input())\r\nX.sort(key=len)\r\nx, y = 0, 0\r\nfor i in X:\r\n if len(i) > P: break\r\n elif len(i) == P: y+=1\r\n else:\r\n y+=1\r\n x+=1 \r\nx+=1\r\nif x%K==0: print(x+(((x//K)-1)*5), end=\" \")\r\nelse: print(x+((x//K)*5), end=\" \")\r\nif y%K==0: print(y+(((y//K)-1)*5))\r\nelse: print(y+((y//K)*5))", "n, k = [int(i) for i in input().split()]\r\npasswords = list()\r\nfor i in range(n):\r\n word = input()\r\n passwords.append(word)\r\nresult = input()\r\nlower, upper = 0, 0\r\nfor i in range(n):\r\n lower += (len(passwords[i]) < len(result))\r\n upper += (len(passwords[i]) <= len(result))\r\nprint(lower + (lower // k) * 5 + 1, upper + ((upper - 1) // k) * 5)\r\n", "n, k = map(int, input().split())\n\npw_list = [len(input()) for _ in range(n)]\n\npw = len(input())\n\np = sorted(pw_list)\n\nhead = p.index(pw)\ntail = n - list(reversed(p)).index(pw) - 1\nworst_case = head + ((head)//k)*5 + 1\nbest_case = tail + (tail//k)*5 + 1\n\nprint(worst_case, best_case)\n\n \t \t\t\t\t\t\t\t \t\t\t \t\t \t \t\t\t", "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\nfor t in range(1):\r\n n, k = get_ints()\r\n strings = []\r\n \r\n for i in range(n):\r\n strings.append(input().strip())\r\n \r\n ans = input().strip()\r\n len_ans = len(ans)\r\n less_than_ans, equal_to_ans = 0, 0\r\n\r\n strings.sort(key = lambda x: len(x))\r\n \r\n for i in range(n):\r\n x = len(strings[i])\r\n if x < len_ans:\r\n less_than_ans += 1\r\n elif x == len_ans:\r\n equal_to_ans += 1\r\n else:\r\n break\r\n \r\n best_case_time = less_than_ans + (less_than_ans//k)*5 + 1\r\n worst_case_time = (less_than_ans + equal_to_ans - 1) + ((less_than_ans + equal_to_ans - 1)//k)*5 + 1\r\n \r\n print(best_case_time, worst_case_time)\r\n ", "from collections import Counter\r\n\r\nn,K = map(int, input().split())\r\n\r\ncounts = Counter()\r\nfor _ in range(n):\r\n\tcounts[len(input())] += 1\r\n\r\nans = input()\r\nsize=len(ans)\r\n\r\nbest=worst=0\r\nfor k in sorted(counts.keys()):\r\n\tif k == size:\r\n\t\tbest += 1\r\n\t\tworst += counts[k]\r\n\t\tbreak\r\n\telse:\r\n\t\tbest += counts[k]\r\n\t\tworst += counts[k]\r\n\t\r\nprint(best+((best-1)//K)*5,worst+((worst-1)//K)*5)", "n,k=map(int,input().split())\r\na=[input() for i in range(n)]\r\np=input()\r\nc=0\r\nd=0\r\nfor i in range(n):\r\n\tif len(a[i])==len(p):\r\n\t\td+=1\r\n\tif len(a[i])<len(p):\r\n\t\tc+=1\r\nx=c//k\r\nl=c+x*5+1\r\ny=(d+c-1)//k\r\nh=d+c+y*5\r\nprint(l,h)", "n,k = list(map(int,input().split()))\r\npasswords = []\r\nfor i in range(n):\r\n x = input()\r\n passwords.append(x)\r\npasswords.sort(key=lambda x: len(x))\r\nans = input()\r\nbestAns = 0\r\nworstAns = 0\r\n\r\nmark = 0\r\nfor i in passwords:\r\n if len(i) != len(ans):\r\n bestAns += 1\r\n if mark==k:\r\n bestAns += 5\r\n mark = 0\r\n else:\r\n bestAns += 1\r\n if mark==k:\r\n bestAns += 5\r\n mark = 0\r\n break\r\n mark += 1\r\n\r\nmark = 0\r\nfor i in passwords:\r\n if len(i)>len(ans):\r\n break\r\n if len(i) != len(ans):\r\n worstAns += 1\r\n if mark==k:\r\n worstAns += 5\r\n mark = 0\r\n else:\r\n worstAns += 1\r\n if mark==k:\r\n worstAns += 5\r\n mark = 0\r\n mark += 1\r\n\r\nprint(bestAns,worstAns)", "n,k=map(int,input().split())\r\na=[]\r\nfor i in range(n+1):\r\n a.append(len(input()))\r\nl=a[n]\r\n\r\na=a[:n]\r\na=sorted(a)\r\nr=0\r\nt=0\r\nfor i in range(n):\r\n if a[i]<=l:\r\n t+=1 \r\n if a[i]<l:\r\n r+=1\r\n\r\nd1=r+(r//k)*5+1 \r\nd2=t+((t-1)//k)*5\r\nprint(d1,d2,sep=\" \")", "n,k = map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(len(input()))\r\nl.sort()\r\np = len(input())\r\nrl = l.index(p)\r\nrr = n-1-l[::-1].index(p)\r\nprint(rl+1+((rl//k)*5),rr+1+((rr//k)*5))", "n,k=map(int,input().split())\r\na=[]\r\nfor _ in range(n):\r\n s=input()\r\n a.append(len(s))\r\nx=input()\r\ny=len(x)\r\na.sort()\r\ni=a.index(y)\r\nj=a.count(y)\r\np=i\r\nq=i+j-1\r\nprint((p//k)*5 + p + 1,(q//k)*5 + q + 1)", "n,k = map(int,input().split())\r\ns = []\r\nfor i in range(n):\r\n\tt = input()\r\n\tl = len(t)\r\n\tr = (t,l)\r\n\ts.append(r)\r\nr1 = sorted(s,key = lambda x:x[1])\r\nt = input()\r\nans = [0,0]\r\nlength = len(t)\r\n# print(*r1)\r\n# print(s[-1][-1])\r\nflag = 0\r\nfor i in range(n):\r\n\tif r1[i][1] == length and flag == 0:\r\n\t\tans[0] = i\r\n\t\tflag = 1\r\n\tif i == n-1 or r1[i+1][1] > length:\r\n\t\tans[1] = i\r\n\t\tbreak\r\nprint(ans[0]+5*((ans[0])//k)+1,ans[1]+5*((ans[1])//k)+1)\r\n", "t=input()\r\nn=int(t.split(' ')[0])\r\nk=int(t.split(' ')[1])\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\npassword = input()\r\nt=0\r\nl.sort(key=len)\r\nfor i in l:\r\n t+=1\r\n if len(i)==len(password):\r\n break\r\ndef getans(t):\r\n global k\r\n q=-1\r\n ans=0\r\n for i in range(t):\r\n q+=1\r\n ans+=1\r\n if q%k==0 and q>=k:\r\n ans+=5\r\n return ans\r\na=getans(t)\r\nt=0\r\nfor i in l:\r\n if len(i)>len(password):\r\n break\r\n t+=1\r\nb=getans(t)\r\nprint(a,b)\r\n", "n, k = map(int, input().split())\r\n\r\n\r\n#input\r\nlenLst = []\r\nfor i in range(n + 1):\r\n x = input()\r\n lenLst.append(len(x))\r\n\r\n#solve\r\nlen_true = lenLst[n]\r\nlenLst = lenLst[:n]\r\nlenLst.sort()\r\n\r\n\r\nidStart = lenLst.index(len_true)\r\na1 = len(lenLst[:idStart + 1])\r\na2 = lenLst.count(len_true) \r\n\r\n\r\nbest = a1 + 5 * (a1 // k - (a1 % k == 0 and a1 != 0)) \r\nz = a1 + a2 - 1\r\nworst = z + 5 * (z // k - (z % k == 0 and z != 0)) \r\nprint(best, worst)", "def solution(passwords, correct_pass, k):\n # Work\n less = passwords.index(correct_pass)\n same = passwords.count(correct_pass)\n print(less+((less//k)*5) + 1, same + ((same + less - 1)//k)*5 + less )\n\n\ndef main():\n p, q = map(int, input().split())\n # If a property satifies don't store the whole input\n passwords = sorted(len(input()) for i in range(p))\n correct_pass = len(input())\n solution(passwords, correct_pass, q)\n\n\nif __name__ == \"__main__\":\n main()\n", "n, k = map(int, input().split())\nl = [0] * 100\nfor i in range(n):\n l[len(input())-1] += 1\np = len(input())\nmin, max, i = 0, 0, 0\nwhile i + 1 != p:\n min += l[i]\n max += l[i]\n i += 1\nmax += l[p-1] - 1\nmin += 5*(min // k)\nmax += 5*(max // k)\nmin += 1\nmax += 1\nprint(min, max)\n", "n, k = map(int, input().split())\np = [len(input()) for _ in range(n)]\n\npassword = len(input())\n\np = sorted(p)\n\nfirst = p.index(password)\nlast = n - list(reversed(p)).index(password) - 1\n\nmn = first + ((first//k) * 5) + 1\nmx = last + ((last//k) * 5) + 1\nprint(mn, mx)\n\n\n\t \t \t\t \t \t\t\t\t \t\t \t \t\t\t \t", "n, k = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n s = input()\r\n a.append(s)\r\n\r\ns = input()\r\npwdlen = len(s)\r\n\r\nshorter_pwdlen = 0\r\nequal_pwdlen = 0\r\nfor i in range(n):\r\n if len(a[i]) < pwdlen:\r\n shorter_pwdlen += 1\r\n elif len(a[i]) == pwdlen:\r\n equal_pwdlen += 1\r\n\r\nmin_times = shorter_pwdlen + (shorter_pwdlen // k) * 5 + 1\r\nmax_times = (shorter_pwdlen + equal_pwdlen - 1) + ((shorter_pwdlen + equal_pwdlen - 1) // k) * 5 + 1\r\nprint(min_times, max_times)", "def solution(passwords, correct_pass, k):\n n1 = n2 = 0\n for x in passwords:\n if x < correct_pass: n1 += 1\n elif x == correct_pass: n2 += 1\n\n print(n1 + (n1 // k) * 5 + 1, n2 + (n1 + n2 -1)//k * 5 + n1)\n\n\ndef main():\n p, q = map(int, input().split())\n passwords = []\n for i in range(p):\n passwords.append(len(input()))\n correct_pass = len(input())\n solution(passwords, correct_pass, q)\n\n\nif __name__ == \"__main__\":\n main()\n", "n,k=map(int,input().split())\nl=[]\nfor i in range(n):\n\tl.append(input())\np=input()\na,b=0,0\nfor i in l:\n\tif(len(i)<len(p)):a+=1\n\tif(len(i)<=len(p)):b+=1\ndef fun(s,k):\n\ty=s%k\n\tif y==0:y=k\n\tx=(s-y)//k\n\treturn x*(k+5)+y\nprint(fun(a+1,k),fun(b,k))\n\n \t\t \t \t \t\t\t\t\t \t\t \t\t", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nHomura = [int(i) for i in input().split()]\r\nn = Homura[0]\r\nk = Homura[1]\r\n\r\n#lengths[i] contains the number of passwords of length i+1\r\nlengths = [0 for i in range(100)]\r\nfor i in range(n):\r\n\tlengths[len(input())-1] += 1\r\n#l is the length of the correct password\r\nl = len(input())\r\n\r\n#m is the minimum number of passwords needed\r\n#M is the maximum number of passwords needed\r\nM = 0\r\nfor i in range(l):\r\n\tM += lengths[i] #All passwords of length <= l\r\nm = M - lengths[l-1] + 1\r\n\r\n#w_m is the number of waits for m attempts\r\n#w_M is the number of waits for M attempts\r\nw_m = (m-1)//k\r\nw_M = (M-1)//k\r\n\r\n#t_m is the time taken for m attempts\r\n#t_M is the time taken for M attempts\r\nt_m = m + 5 * w_m\r\nt_M = M + 5 * w_M\r\n\r\nprint(t_m, t_M)\r\n", "n,k=map(int,input().split())\r\np=[]\r\nfor _ in range(n):\r\n\tp.append(len(input()))\r\nl=len(input())\r\np.sort()\r\nsmallLength = 0\r\nfor i in p:\r\n\tif i<l:\r\n\t\tsmallLength += 1\r\n\telse:\r\n\t\tbreak\r\nsameLength = p.count(l)\r\nprint (smallLength+smallLength//k*5+1,smallLength+((smallLength+sameLength-1)//k*5+sameLength))", "\r\n\r\nn,k=map(int,input().split())\r\npas=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\tpas.append(s)\r\ns=input()\r\narr1=list(filter(lambda x:len(x)<len(s),pas))\r\nbest=len(arr1)\r\narr2=list(filter(lambda x:len(x)<=len(s),pas))\r\nworst=len(arr2)\r\narr3=list(filter(lambda x:x==s,pas))\r\nsame=len(arr3)\r\nworst-=same\r\n#print(best,worst)\r\nif worst==0:\r\n\tprint((best+5*(best//k))+1,\"1\")\r\nelse:\r\n\tprint((best+5*(best//k))+1,worst+5*((worst)//k)+1)\r\n\t\t\t#unknown_2433\r\n", "n, k = map(int, input().split())\r\nlst = []\r\n\r\nfor i in range(n):\r\n lst.append(input())\r\n\r\nlenpass = len(input())\r\n\r\ncntless = 0\r\nnotlonger = 0\r\n\r\nfor item in lst:\r\n if len(item) < lenpass:\r\n cntless += 1\r\n notlonger += 1\r\n elif len(item) == lenpass:\r\n notlonger += 1\r\n\r\nbest = cntless + (cntless//k)*5 + 1\r\nworst = notlonger + ((notlonger-1)//k)*5\r\n\r\nprint(best, worst)", "import sys\n\n# def solution(a, b, c, d, k):\n\n\n\nn, k = sys.stdin.readline().split()\nn, k = int(n), int(k)\npasswords = []\n\n# 读密码n个\nfor i in range(n):\n pwd = sys.stdin.readline().strip()\n passwords.append(pwd)\n\ncorrect_pwd = sys.stdin.readline().strip()\ntarget_len = len(correct_pwd)\n\nnum_shorter = 0\nnum_equal = 0\nmin_time = 0\nmax_time = 0\n\nfor pwd in passwords:\n if len(pwd) < target_len:\n num_shorter += 1\n if len(pwd) <= target_len:\n num_equal += 1\n\nmin_time = num_shorter + 1\nmax_time = num_equal\n\nif min_time >= k:\n min_time = (min_time - 1) // k * 5 + min_time\nif max_time >= k:\n max_time = (max_time - 1) // k * 5 + max_time\n\nprint(\"%i %i\" % (min_time, max_time))\n\n \t\t\t\t\t \t \t\t \t\t \t\t \t \t\t\t \t", "n, k = map(int, input().split())\r\narr = [0] * 101\r\nfor i in range(n):\r\n st = input()\r\n arr[len(st)] += 1\r\nst = input()\r\nmin = 0\r\nfor i in range(1, len(st)): min += arr[i]\r\nprint(min + 5 * (min // k) + 1, 5 * ((min + arr[len(st)] - 1) // k) + min + arr[len(st)])\r\n", "from collections import defaultdict\r\nn,k=map(int,input().split())\r\nc=defaultdict(lambda:0)\r\nfor _ in range(n):\r\n s=input()\r\n c[len(s)]+=1\r\noriginal=input()\r\nans=0\r\nfor i in range(1,len(original)):\r\n ans+=c[i]\r\nprint(ans+((ans//k)*5)+1,end=\" \")\r\nans+=c[len(original)]-1\r\nprint(ans+((ans//k)*5)+1)\r\n", "n, k=map(int, input().split())\r\nl=[]\r\nfor x in range(n):\r\n\tl.append(len(input().strip()))\r\npassword=input()\r\nl.sort()\r\na=l.index(len(password))\r\nb=a+l.count(len(password))\r\nprint(1+a+(a//k)*5, b+((b-1)//k)*5)", "n, k = map(int, input().split())\nlst = []\nfor i in range(n):\n\tx = input()\n\tlst.append(x)\np = input()\nd = {}\nlst.sort()\nfor i in lst:\n\tif len(i) in d:\n\t\td[len(i)]+=1\n\telse:\n\t\td[len(i)]=1\nl = len(p)\ns = 1\ne = 0\nfor key in d.keys():\n\tif key < l:\n\t\ts += d[key]\n\tif key <= l:\n\t\te += d[key]\nif s % k != 0:\n s1 = s+((s//k)*5)\nelse:\n s1 = s+(((s-1)//k)*5)\nif e % k != 0:\n e1 = e+((e//k)*5)\nelse:\n e1 = e+(((e-1)//k)*5)\nprint(s1, e1)\n \t \t\t \t \t \t \t\t\t \t \t", "\r\nn,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(len(s))\r\ns=input()\r\nif n==1:\r\n print(1,1)\r\n exit()\r\nl.sort()\r\nh1=l.index(len(s))\r\nh2=-1\r\nfor i in range(h1+1,n):\r\n if l[i]>len(s):\r\n h2=i-1\r\n break\r\n# print(h2)\r\nif h2==-1:\r\n h2=n-1\r\n# print(h1,h2)\r\nh1=h1+1+(h1//k)*5\r\nh2=h2+1+(h2//k)*5 \r\nprint(h1,h2)\r\n", "n,k=map(int,input().split())\r\nq=sorted([len(input()) for i in range(n)])\r\np=input()\r\nc1,c2=q.index(len(p)),q.index(len(p))+q.count(len(p))\r\nprint(1+c1+c1//k*5,c2+(c2-1)//k*5)", "n,k=list(map(int,input().split()))\r\nL=[]\r\nfor _ in range(n+1):\r\n s=input()\r\n l=len(s)\r\n L.append((l,s))\r\npas=L.pop()\r\nL.sort()\r\nsz=pas[0]\r\nflag=True\r\ncnt1,cnt2=0,0\r\nfor i in range(n):\r\n if L[i][0]<sz:\r\n cnt1+=1\r\n if L[i][0]<=sz:\r\n cnt2+=1\r\nbest=(cnt1+1)+(cnt1//k)*5\r\nworst=cnt2+((cnt2-1)//k)*5\r\nprint(best,end=\" \")\r\nprint(worst)", "def shuru(t=0,s=0 ):\n in_item = input().strip()\n if not t:\n return in_item\n elif not s:\n str_t = t+\"(\"+in_item+\")\"\n in_item = eval(str_t)\n return in_item\n else:\n str_s = \"list(\"+s+\"(lambda x:int(x) ,in_item.split() ))\"\n return eval(str_s)\n\ndef fun1():\n import math\n n,k = shuru(\"int\",\"map\")\n mima = {}\n for i in range(n):\n temp = shuru()\n temp_l = len(temp)\n if temp_l not in mima:\n mima[temp_l] =0\n mima[temp_l]+=1\n zhengque = shuru()\n l = len(zhengque)\n min = 0\n max = 0\n for i in mima:\n if i <l:\n min +=mima[i]\n max +=mima[i]\n elif i == l:\n min += 1\n max += mima[i]\n print( math.floor((min-1)/k)*5+min, math.floor((max-1)/k)*5 +max)\n\n\nif __name__==\"__main__\":\n fun1()\n\n\t\t \t \t\t \t\t\t \t \t \t\t\t\t\t \t \t \t\t\t", "n, k = map(int,input().split())\r\nps = []\r\nfor _ in range(n):\r\n ps.append(len(input()))\r\nps.sort()\r\na = len(input())\r\nl = ps.index(a) \r\nr = n - 1 - ps[::-1].index(a)\r\nprint(l + 1 + ((l//k)*5),r + 1 + ((r//k)*5))\r\n\r\n", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A, k):\r\n d = [0 for i in range(103)]\r\n for w in A[:-1]:\r\n d[len(w)]+=1 \r\n l = len(A[-1])\r\n S = 0 \r\n for i in range(l+1):\r\n S+=d[i]\r\n a, b = S-d[l], S-1\r\n a = (a+(a//k)*5)+1 \r\n b = (b+(b//k)*5)+1\r\n sys.stdout.write(f'{a} {b}\\n')\r\n return \r\n\r\nn, k = [int(x) for x in input().split()]\r\nA = []\r\nfor i in range(n+1):\r\n S = input().decode().strip()\r\n A.append(S)\r\nprocess(A, k)", "# your code goes here\r\nn,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nl=[]\r\nfor i in range(n+1):\r\n\ts=input()\r\n\tl.append(s)\r\na=len(l[-1])\r\nt=0\r\nfor i in range(len(l)):\r\n\tif(len(l[i])<a):\r\n\t\tt+=1\r\nt=t+(t//k)*5\r\nprint(t+1,end=\" \")\r\nt=0\r\nfor i in range(len(l)):\r\n\tif(len(l[i])<=a and l[i]!=l[-1]):\r\n\t\tt+=1\r\nt=t+(t//k)*5\r\nprint(t+1)", "n, k = map(int, input().split())\r\npasswords = [input() for _ in range(n)]\r\nTargetPass = input()\r\n\r\nSamePass = 0\r\nShortPass = 0\r\n\r\nfor password in passwords:\r\n if len(password) < len(TargetPass):\r\n ShortPass += 1\r\n elif len(password) == len(TargetPass):\r\n SamePass += 1\r\n\r\nBest = ShortPass + (ShortPass // k) * 5 + 1\r\n\r\nWorst = (ShortPass + SamePass - 1) + ((ShortPass + SamePass - 1) // k) * 5 + 1\r\n\r\nprint(Best, Worst)\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef query_value(A, m):\r\n ans = 0\r\n cnt = 0\r\n for a in A:\r\n if cnt and cnt % m == 0:\r\n ans += 5\r\n ans += 1\r\n if a == 0:\r\n cnt += 1\r\n elif a == 1:\r\n return ans\r\n return ans\r\n\r\ndef query_maximum_value(d, s, m):\r\n A = []\r\n for key in sorted(d.keys()):\r\n B = []\r\n for t in d[key]:\r\n if t == s:\r\n B.append(1)\r\n else:\r\n B.append(0)\r\n B.sort()\r\n A.extend(B)\r\n return query_value(A, m)\r\n\r\ndef query_minimum_value(d, s, m):\r\n A = []\r\n for key in sorted(d.keys()):\r\n B = []\r\n for t in d[key]:\r\n if t == s:\r\n B.append(1)\r\n else:\r\n B.append(0)\r\n B.sort(reverse=True)\r\n A.extend(B)\r\n return query_value(A, m)\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n d = dict()\r\n for i in range(n):\r\n s = input()\r\n if len(s) not in d:\r\n d[len(s)] = []\r\n d[len(s)].append(s)\r\n s = input()\r\n min_val = query_minimum_value(d, s, m)\r\n max_val = query_maximum_value(d, s, m)\r\n print('%d %d' % (min_val, max_val))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int,input().split())\nl = sorted([len(input()) for i in range(n)])\np = len(input())\nk = l.index(p)\nb = k + 1\nb += (k//m)*5\nwk = n - l[::-1].index(p) -1\nw = wk + 1\nw += (wk//m)*5\nprint(b, w)\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\na = []\r\nfor i in range(n):\r\n a.append(input())\r\ns = input()\r\nkmn = 1\r\nkmx = 0\r\nfor i in range(n):\r\n if (len(a[i]) < len(s)):\r\n kmn += 1\r\n kmx += 1\r\n elif (len(a[i]) == len(s)):\r\n kmx += 1\r\nprint((kmn - 1) // k * 5 + kmn, (kmx - 1) // k * 5 + kmx)\r\n", "n,k=[int(i) for i in input().split()]\r\ns=[]\r\nfor i in range(n):\r\n s+=input().split()\r\npassw=input()\r\ns.sort(key=lambda x: len(x))\r\nb,w=1,0\r\nx=len(passw)\r\nfor i in range(n):\r\n if len(s[i])<x:\r\n b+=1\r\n w+=1\r\n elif len(s[i])==x:\r\n w+=1\r\n else:\r\n break\r\nif b%k==0:\r\n b+=((b//k)-1)*5\r\nelse:\r\n b+=(b//k)*5\r\nif w%k==0:\r\n w+=((w//k)-1)*5\r\nelse:\r\n w+=(w//k)*5\r\nprint( b,w )\r\n", "n, k = map(int, input().split())\npasswords = [input() for i in range(n)]\ntrue_password = input()\ntime_less, time_equal = 0, 0\ndelay = k\npasswords.sort(key=lambda x: len(x))\nfor element in passwords:\n if len(element) < len(true_password):\n time_less += 1\n k -= 1\n if k == 0:\n time_less += 5\n k = delay\n elif len(element) == len(true_password):\n if k == 0:\n time_equal += 5\n k = delay\n time_equal += 1\n k -= 1\n else:\n break\nprint(time_less + 1, time_less + time_equal)\n", "from math import floor\r\nn,k=map(int,input().split())\r\nm=dict()\r\nfor i in range(n):\r\n p=input()\r\n l=len(p)\r\n if l in m:\r\n m[l].append(p)\r\n else:\r\n m[l]=[p]\r\np=input()\r\nmx=0\r\nmn=0\r\nfor i in sorted(m.keys()):\r\n if i==len(p):\r\n break\r\n mn+=len(m[i])\r\nmn+=1\r\nmx=mn+len(m[len(p)])-1\r\nif(mn%k>0):\r\n mn+=floor(mn/k)*5\r\nelse:\r\n mn+=floor((mn-1)/k)*5\r\nif(mx%k>0):\r\n mx+=floor(mx/k)*5\r\nelse:\r\n mx+=floor((mx-1)/k)*5\r\nprint(mn,mx)", "n,k = map(int,input().split())\r\nl = []\r\np = {}\r\nfor i in range(n):\r\n temp = input()\r\n try:\r\n p[len(temp)].append(temp)\r\n except KeyError:\r\n p[len(temp)] = [temp]\r\nans = input()\r\nbest = 0\r\nworst = 0\r\nfor i in range(len(ans)):\r\n try:\r\n best += len(p[i])\r\n worst += len(p[i])\r\n except KeyError:\r\n continue\r\nz = best//k\r\nz = z*5\r\nbest += z\r\nbest+=1\r\n\r\nfor i in range(len(p[len(ans)])):\r\n temp = p[len(ans)].pop()\r\n if temp == ans:\r\n continue\r\n else:\r\n worst+=1\r\n\r\ny = worst//k\r\ny = y*5\r\nworst += y + 1\r\nprint(\"{} {}\".format(best,worst))", "n, k = map(int, input().split())\npasswords = []\nfor i in range(n):\n s = input()\n passwords.append(s)\ncpass = input()\n# print(passwords)\n# print(cpass)\ncountL = 0\ncountE = 0\nfor p in passwords:\n if len(p) < len(cpass):\n countL += 1\n elif len(p) == len(cpass):\n countE += 1\nbestcase = countL + 1 + 5 * (countL // k)\nworstcase = countL + countE + 5 * ((countL + countE - 1) // k)\nprint(bestcase, worstcase)\n", "import bisect\r\nn,k=map(int,input().split())\r\nl=[]\r\nt=[]\r\nfor i in range(n):\r\n s=input()\r\n t+=[s]\r\n l+=[len(s)]\r\ns=input()\r\nc=0\r\n\r\nl.sort()\r\nres1=bisect.bisect_left(l,len(s))+1\r\nres=bisect.bisect_right(l,len(s))\r\nmx=res\r\nwhile (res>0):\r\n res-=k\r\n if(res>0):\r\n c+=1\r\n else:\r\n break\r\nmx+=c*5\r\nmn=res1\r\nc=0\r\nwhile(res1>0):\r\n res1-=k\r\n if(res1>0):\r\n c+=1\r\n else:\r\n break\r\nmn+=c*5\r\nprint(mn,mx)\r\n\r\n", "n,k = map(int,input().split())\r\nl = [0]*110\r\nfor _ in range(n):\r\n s = input()\r\n l[len(s)] += 1\r\nm = len(input())\r\ntemp = sum(l[:m])+1 + (sum(l[:m])//k)*5\r\ntemp1 = sum(l[:m+1])\r\nif temp1%k==0:\r\n temp1 += ((temp1-1)//k)*5\r\nelse:\r\n temp1 += (temp1//k)*5\r\nprint(temp,temp1)", "import sys\n\ncount = 0\nr_list = []\ndic = {}\nfor line in sys.stdin:\n if count == 0:\n n = int(line.strip().split(' ')[0])\n k = int(line.strip().split(' ')[1])\n count += 1\n continue\n count += 1\n if count == n + 2:\n answer_len = len(line.strip())\n break\n tmp = line.strip()\n dic[len(tmp)] = dic.get(len(tmp), 0) + 1\n\n\nsorted_dic = sorted(dic.items(), key=lambda x:x[1])\n\n\nnum = 0\nfor tmp in sorted_dic:\n if tmp[0] < answer_len:\n num += tmp[1]\n\nmin = num + 1\nmax = num + dic[answer_len]\n\n\n\nmin_t = ((min - 1) // k)*5 + min\nmax_t = ((max - 1) // k)*5 + max\n\nprint(str(min_t) + ' '+ str(max_t))\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\ncnt = [0] * 101\r\n\r\nfor _ in range(n):\r\n s = input()\r\n cnt[len(s)] += 1\r\n\r\npassword = input()\r\nbest_time = worst_time = 0\r\n\r\nfor i in range(len(password)):\r\n best_time += cnt[i]\r\n\r\nworst_time = best_time + cnt[len(password)] - 1\r\n\r\nbest_time += (best_time // k) * 5\r\nworst_time += (worst_time // k) * 5\r\n\r\nprint(best_time + 1, worst_time + 1, sep=' ')", "n,k=map(int,input().split())\r\nworst=best=w=b=0\r\nl=[]\r\na=[0]*101\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nx=input()\r\nfor i in range(n):\r\n h=len(l[i])\r\n a[h]+=1\r\nh=len(x)\r\nfor i in range(h+1):\r\n w+=a[i]\r\nfor i in range(h):\r\n b+=a[i]\r\nworst=w+(((w-1)//k)*5)\r\nbest=b+(((b)//k)*5)\r\nprint(best+1,worst,sep=' ')", "I = input\r\nn , k = map(int , I().split())\r\na = sorted(len(I()) for _ in '0'*n)\r\np = len(I())\r\nt = a.index(p)\r\na , b = t , t + a.count(p)\r\nprint(1 + a + a // k * 5 , b + (b - 1) // k * 5)", "n, k = map(int, input().split())\r\ncnt = [0]*101\r\nfor _ in range(n):\r\n s = input()\r\n cnt[len(s)] += 1\r\n\r\nbest_time = worst_time = 0\r\n\r\npass_word = input()\r\nfor i in range(len(pass_word)):\r\n best_time += cnt[i]\r\n\r\nworst_time = best_time + cnt[len(pass_word)] - 1\r\n\r\nbest_time += best_time // k * 5\r\nworst_time += worst_time // k * 5\r\n\r\n\r\nprint(best_time + 1)\r\nprint(worst_time + 1)\r\n", "import bisect\r\nn,k=map(int,input().split())\r\na=[]\r\nst=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\tst.append(s)\r\n\ta.append(len(s))\r\npas=input()\r\nc=a.count(len(pas))-st.count(pas)\r\na.sort()\r\nws=bisect.bisect(a,len(pas)-1)\r\nprint((ws//k)*5+ws+1,end=\" \")\r\nws+=c\r\nprint((ws//k)*5+ws+1)", "n, k = map(int, input().split())\r\nPass = {}\r\nfor i in range(n):\r\n In = input()\r\n Pass[In] = len(In)\r\nCor = input()\r\nLens = list(sorted(Pass.values()))\r\nMin = (Lens.index(len(Cor)) + 1) + (Lens.index(len(Cor)) // k) * 5\r\nindex = n - list(reversed(Lens)).index(len(Cor)) - 1\r\ntime = index + 1 + (index // k * 5)\r\nprint(Min, time)\r\n", "n,k=map(int,input().split())\r\nS=[]\r\nLen=[]\r\nfor i in range(n):\r\n a=input()\r\n Len.append(len(a))\r\npw=input()\r\nLen.sort()\r\nD1=pwngan=Len.index(len(pw))\r\nD2=pwbang=Len.count(len(pw))\r\nD2+=(pwngan+pwbang-1)//k*5+D1\r\nD1+=pwngan//k*5+1\r\nprint(D1,D2)\r\n\r\n", "#password \r\nn,k=map(int, input().split())\r\nl=sorted(len(input()) for i in range(n))\r\nt=input()\r\nx=l.index(len(t))\r\ncount=l.count(len(t))\r\nprint(1+x+(x//k)*5,x+count+((x+count-1)//k)*5)", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\npa=input()\r\n\r\ncnt1=0\r\ncnt2=0\r\n\r\nfor i in l:\r\n if len(i)<len(pa):\r\n cnt1+=1\r\n if len(i)<=len(pa):\r\n cnt2+=1\r\n# print(cnt1,cnt2)\r\nprint(cnt1+(cnt1//k)*5 +1,cnt2+((cnt2-1)//k)*5)\r\n ", "n,k=map(int,input().split())\r\np=[]\r\nfor i in range(n):\r\n p.append(len(input()))\r\np.sort()\r\nr=len(input())\r\nl=p.index(r)\r\nm1=l+(l//k)*5+1\r\nl1=p.count(r)-1\r\nl+=l1\r\nm2=l+(l//k)*5+1\r\nprint(str(m1)+\" \"+str(m2))", "n,k=map(int,input().split())\r\ndata=[[] for i in range(101)]\r\nfor i in range(n):\r\n word=input()\r\n data[len(word)].append(word)\r\ncorrect=len(input())\r\ns=0\r\nfor i in range(1,correct):\r\n s=s+len(data[i])\r\nprint(s+1+s//k*5,s+len(data[correct])+(s+len(data[correct])-1)//k*5)\r\n\r\n", "a,b=map(int,input().split())\r\nz=[input() for _ in \" \"*a]\r\nx=input()\r\nz=sorted(z,key=len)\r\np=len(x)\r\nans,ans1=0,0\r\nfor i in z:\r\n if len(i)<len(x):ans+=1;ans1+=1\r\n elif len(i)==len(x):ans1+=1\r\nans1-=1\r\nprint(1+ans+5*(ans//b),1+ans1+5*(ans1//b))", "n, k = map(int, input().split())\r\npws = [input() for _ in range(n)]\r\np = input()\r\n \r\nl, e = 0, 0\r\nfor i in range(n):\r\n if len(pws[i]) == len(p):\r\n e += 1\r\n elif len(pws[i]) < len(p):\r\n l += 1\r\ne -= 1\r\n \r\ntm = lambda x : (x // k) * 5 + x + 1\r\nprint(tm(l), tm(l + e))", "n, k = map(int, input().split())\r\ncnt = [0] * 101\r\nfor i in range(n):\r\n\tcnt[len(input())] += 1\r\nx = len(input())\r\na = sum(cnt[:x]) #one step before beginning og required length\r\nb = sum(cnt[:x+1]) - 1 #x+1 to reach there and minus one to avoid extra time at that\r\n #position bcz once we reach there..we shud not count penalty\r\n #and game is over\r\n\r\nr1 = a // k * 5 + a + 1 #and find extra time and plus one to reach there\r\nr2 = b // k * 5 + b + 1 #find extra till b and then plus to reach there\r\nprint(r1, r2)\r\n#one thing to notice is that passwords arent repeated..\r\n#so we directly go to last and come one step back!!!!!", "def ints_get():\r\n return map(int, input().strip().split())\r\nn,k = ints_get()\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\narr.sort(key = len) \r\npsd = input()\r\nl = len(psd)\r\nlmo = 0\r\neql = 0\r\np,q= None, None\r\nfor i in range(n):\r\n if len(arr[i]) <l:\r\n lmo += 1\r\n elif len(arr[i]) == l:\r\n eql += 1\r\n\r\nif (lmo+1)%k == 0:\r\n p =((lmo+1)//k -1)*(k+5) + k\r\nelse:\r\n p = ((lmo+1)//k)*(k+5) + (lmo+1)%k\r\nte = lmo+eql\r\nif (te) % k == 0:\r\n q = ((te)//k - 1)*(k+5) + k\r\nelse:\r\n q = ((te)//k)*(k+5) + (te) % k\r\nprint(p,q) \r\n\r\n\r\n\r\n \r\n", "#Passwords\r\n\r\ncount = [0] * 105\r\nn, k = map(int, input().split())\r\nfor i in range(n):\r\n s = input()\r\n count[len(s)] += 1\r\n\r\npassword = input()\r\nsum = 0\r\nfor i in range(1, len(password)):\r\n sum += count[i]\r\n\r\n#khi tinh k_times phai - 1 so voi so luong password di qua de den password dung (tinh luon password dung)\r\n#vi du: so password la 2, k = 2, tinh k_times = 1 thi res1 = 2 + 1 * 5 = 7\r\n#dap an dung la 2 vi da ket thuc viec do tim password dung\r\nk_times = sum // k\r\nres1 = sum + 1 + k_times * 5\r\n\r\ncnt = count[len(password)]\r\nk_times = (sum + cnt - 1) // k\r\nres2 = sum + cnt + k_times * 5\r\n\r\nprint(res1, res2)", "a = input().split(\" \")\r\nn = int(a[0])\r\nk = int(a[1])\r\na = []\r\nfor i in range(n):\r\n a.append(len(input()))\r\na.sort()\r\ntar = len(input())\r\n\r\nres_min = 0\r\nres_max = 0\r\nfor i in range(n):\r\n if a[i] == tar and (i == 0 or a[i-1] != tar):\r\n t = i + 1\r\n res_min = t\r\n if (t % k == 0): res_min += (t // k - 1) * 5\r\n else: res_min += (t // k) * 5\r\n if a[i] == tar and (i == n - 1 or a[i + 1] > tar):\r\n t = i + 1\r\n res_max = t\r\n if (t % k == 0):\r\n res_max += (t // k - 1) * 5\r\n else:\r\n res_max += (t // k) * 5\r\nprint(res_min, res_max)", "# -*- coding: utf-8 -*-\n\n\nif __name__ == '__main__':\n\n n, m = map(int, input().strip().split())\n possible_list = []\n for i in range(n):\n possible_list.append(input().strip())\n answer = input().strip()\n answer_len = len(answer)\n possible_list = filter(lambda _: len(_) <= answer_len, possible_list)\n possible_list_sorted = sorted(possible_list, key=lambda _: len(_))\n possible_list_real_len = list(filter(lambda _: len(_) == answer_len, possible_list_sorted))\n possible_list_real_len_first = possible_list_real_len[0]\n min_result = possible_list_sorted.index(possible_list_real_len_first) + 1\n max_result = min_result + len(possible_list_real_len) - 1\n # print(possible_list_sorted)\n # print(min_result, max_result)\n if min_result >= m:\n punish_min = ((min_result - 1)//m) * 5\n min_result = min_result + punish_min\n if max_result >= m:\n punish = ((max_result-1)//m) * 5\n max_result = max_result + punish\n print(min_result, max_result)\n\n\n\n \t \t\t\t\t \t\t\t \t\t\t \t\t\t \t", "n, k = map(int, input().split())\n\na = sorted(len(input()) for i in range(n))\np = len(input())\n\nt = a.index(p)\n\na, b=t, t + a.count(p)\nprint(1 + a + a // k * 5, b + (b - 1) // k * 5)", "def ll(): return list(map(int, input().split())) \r\ndef lf(): return list(map(float, input().split())) \r\ndef ls(): return list(map(str, input().split())) \r\ndef mn(): return map(int, input().split()) \r\ndef nt(): return int(input()) \r\ndef ns(): return input()\r\n\r\nfrom collections import defaultdict\r\n\r\nd = defaultdict(int)\r\nn, m = mn()\r\nfor i in range(n):\r\n d[len(ns())] +=1\r\nl = len(ns()); same=0; less=0 \r\nfor k, v in d.items():\r\n if k<l:\r\n less+=v\r\n elif k==l:\r\n same+=v\r\nprint(\r\n ((less)//m)*5 + less+1,\r\n ((less+same-1)//m)*5 + less + same\r\n)\r\n\r\n\r\n\r\n", "n, k = map(int,input().split())\r\ntries = []\r\nfor _ in range(n):\r\n\ttries.append(input())\r\nkey = input()\r\n\r\nbest = 0\r\nworst = 0\r\nshort = 0\r\nequal = 0\r\nx = len(key)\r\nfor i in tries:\r\n\ta = len(i)\r\n\tif a<x:\r\n\t\tshort+=1\r\n\telif a==x:\r\n\t\tequal+=1\r\n\r\ndelay = short+1\r\nif delay%k==0:\r\n\tbest = (delay//k-1)*5+delay\r\nelse:\r\n\tbest = (delay//k)*5+delay\r\ndelay = short+equal\r\nif delay%k==0:\r\n\tworst = (delay//k-1)*5+delay\r\nelse:\r\n\tworst = (delay//k)*5+delay\r\n\r\nprint(best, worst)\r\n", "n, k = map(int, input().split())\r\na = [input() for i in range(n)]\r\np = input()\r\nc = 0\r\nd = 0\r\nfor i in range(n):\r\n if len(a[i]) == len(p):\r\n d += 1\r\n if len(a[i]) < len(p):\r\n c += 1\r\n\r\nl = c + (c // k) * 5 + 1\r\nh = d + c + ((d + c - 1) // k) * 5\r\nprint(l, h)", "n, k = map(int, input().split())\n\n\nl_l = list()\nfor _ in range(n):\n l_l.append(len(input()))\n\np = len(input())\n\nh_t = 0\nl_t = 0\nfor l in l_l:\n if l < p:\n h_t += 1\n l_t += 1\n elif l == p:\n h_t += 1\nl_t += 1\nprint(\"%d %d\" % (l_t + ((l_t - 1) // k) * 5, h_t + ((h_t - 1) // k) * 5))\n\t \t \t\t\t\t \t\t\t \t\t \t\t \t\t\t", "n, k = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(len(input()))\r\nm = len(input())\r\na.sort()\r\ni = a.index(m) + 1\r\nj = n - 1\r\nwhile a[j] != m:\r\n j -= 1\r\nj += 1\r\nprint(i + (i - 1) // k * 5, j + (j - 1) // k * 5)\r\n", "n, k = map(int, input().split())\r\n\r\n# if n == k:\r\n# ans2 = k\r\n# elif n // k == 0:\r\n# ans2 = n\r\n# else:\r\n# fator = (n // k) if k != 1 else n - 1\r\n# ans2 = (fator * 5) + n\r\n # print(ans2)\r\narray = []\r\nfor i in range(n):\r\n array.append(input())\r\n\r\ncont1, cont2 = [0,0]\r\n# i = 0\r\npassword = input()\r\n# print(array)\r\nfor item in array:\r\n if (len(item) < len(password)):\r\n cont1+=1\r\n if (len(item) <= len(password)):\r\n cont2+=1\r\n\r\nprint(cont1 + (cont1//k)*5 + 1, cont2 + ((cont2 - 1)//k)*5)\r\n\r\n\r\n\r\n", "a=list(map(int, input().split()))\r\nn=a[0]\r\nk=a[1]\r\nl=[]\r\nr=[]\r\nfor i in range(n+1):\r\n s=input()\r\n l.append(len(s))\r\nl1=l[-1]\r\nl.pop(-1)\r\nl.sort()\r\np1=l.index(l1)\r\nl.reverse()\r\np2=n-1-l.index(l1)\r\nif k>=n:\r\n r.append(p1+1)\r\n r.append(p2+1)\r\nelse:\r\n t1=(p1+1) + p1//k * 5\r\n t2=(p2+1) + p2//k * 5\r\n r.append(t1)\r\n r.append(t2)\r\nprint(' '.join(map(str, r)))", "def main():\r\n n, k = list(map(int, input().split()))\r\n arr = [input() for _ in range(n)]\r\n correct_length = len(input())\r\n\r\n less_length_passwords, same_length_passwords = 0, 0\r\n for element in arr:\r\n check_length = len(element)\r\n if check_length == correct_length:\r\n same_length_passwords += 1\r\n elif check_length < correct_length:\r\n less_length_passwords += 1\r\n\r\n min_time = (less_length_passwords // k) * 5 + less_length_passwords + 1\r\n max_time = (\r\n ((less_length_passwords + same_length_passwords - 1) // k) * 5\r\n + less_length_passwords\r\n + same_length_passwords\r\n )\r\n\r\n print(min_time, max_time)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from itertools import count\r\n\r\n\r\ninp = input().split(' ')\r\n\r\nno_key = int(inp[0])\r\ntrial = int(inp[1])\r\n\r\nkey = list()\r\nkey_len = list()\r\n\r\nfor i in range(no_key):\r\n key.append(input())\r\n key_len.append(len(key[i]))\r\n\r\ntrue_key = input()\r\n\r\nkey.sort(key = len)\r\nkey_len.sort()\r\n\r\nif len(true_key) == key_len[0]:\r\n print(1, end = ' ')\r\n same_len = key_len.count(len(true_key))\r\n max = same_len + ((same_len - 1) // trial) * 5\r\n print(max)\r\nelse:\r\n pos = key_len.index(len(true_key))\r\n min = pos + 1 + (pos // trial) * 5\r\n print(min, end = ' ')\r\n max = key_len.count(len(true_key)) + pos + ((key_len.count(len(true_key)) + pos - 1) // trial) * 5\r\n print(max)\r\n", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List\r\n# sys.setrecursionlimit(999)\r\n\r\n\r\nn,k = map(int,input().split())\r\nd = collections.defaultdict(int)\r\nfor _ in [0]*n:\r\n s = input()\r\n d[len(s)]+=1\r\np = input()\r\nw = 0\r\nfor dk in sorted(d.keys()):\r\n if dk<len(p):\r\n w+= d[dk]\r\n\r\nans1 = w+ (w//k)*5+1\r\n\r\nw+= d[len(p)]-1\r\nans2 = w+(w//k)*5+1\r\nprint(ans1,ans2)\r\n\r\n\r\n " ]

{"inputs": ["5 2\ncba\nabc\nbb1\nabC\nABC\nabc", "4 100\n11\n22\n1\n2\n22", "1 1\na1\na1", "1 100\na1\na1", "2 1\nabc\nAbc\nAbc", "2 2\nabc\nAbc\nabc", "2 1\nab\nabc\nab", "2 2\nab\nabc\nab", "2 1\nab\nabc\nabc", "2 2\nab\nabc\nabc", "10 3\nOIbV1igi\no\nZS\nQM\n9woLzI\nWreboD\nQ7yl\nA5Rb\nS9Lno72TkP\nfT97o\no", "10 3\nHJZNMsT\nLaPcH2C\nlrhqIO\n9cxw\noTC1XwjW\nGHL9Ul6\nUyIs\nPuzwgR4ZKa\nyIByoKR5\nd3QA\nPuzwgR4ZKa", "20 5\nvSyC787KlIL8kZ2Uv5sw\nWKWOP\n7i8J3E8EByIq\nNW2VyGweL\nmyR2sRNu\nmXusPP0\nf4jgGxra\n4wHRzRhOCpEt\npPz9kybGb\nOtSpePCRoG5nkjZ2VxRy\nwHYsSttWbJkg\nKBOP9\nQfiOiFyHPPsw3GHo8J8\nxB8\nqCpehZEeEhdq\niOLjICK6\nQ91\nHmCsfMGTFKoFFnv238c\nJKjhg\ngkEUh\nKBOP9", "15 2\nw6S9WyU\nMVh\nkgUhQHW\nhGQNOF\nUuym\n7rGQA\nBM8vLPRB\n9E\nDs32U\no\nz1aV2C5T\n8\nzSXjrqQ\n1FO\n3kIt\nBM8vLPRB", "20 2\ni\n5Rp6\nE4vsr\nSY\nORXx\nh13C\nk6tzC\ne\nN\nKQf4C\nWZcdL\ndiA3v\n0InQT\nuJkAr\nGCamp\nBuIRd\nY\nM\nxZYx7\n0a5A\nWZcdL", "20 2\naWLQ6\nSgQ9r\nHcPdj\n2BNaO\n3TjNb\nnvwFM\nqsKt7\nFnb6N\nLoc0p\njxuLq\nBKAjf\nEKgZB\nBfOSa\nsMIvr\nuIWcR\nIura3\nLAqSf\ntXq3G\n8rQ8I\n8otAO\nsMIvr", "20 15\n0ZpQugVlN7\nm0SlKGnohN\nRFXTqhNGcn\n1qm2ZbB\nQXtJWdf78P\nbc2vH\nP21dty2Z1P\nm2c71LFhCk\n23EuP1Dvh3\nanwri5RhQN\n55v6HYv288\n1u5uKOjM5r\n6vg0GC1\nDAPYiA3ns1\nUZaaJ3Gmnk\nwB44x7V4Zi\n4hgB2oyU8P\npYFQpy8gGK\ndbz\nBv\n55v6HYv288", "3 1\na\nb\naa\naa", "6 3\nab\nac\nad\nabc\nabd\nabe\nabc", "4 2\n1\n2\n11\n22\n22", "2 1\n1\n12\n12", "3 1\nab\nabc\nabd\nabc", "2 1\na\nab\nab", "5 2\na\nb\nc\nab\naa\naa", "6 1\n1\n2\n11\n22\n111\n2222\n22", "3 1\n1\n2\n11\n11", "10 4\na\nb\nc\nd\ne\nf\nab\ncd\nac\nad\nac", "4 2\na\nb\nc\nd\na", "4 1\n1\n2\n3\n4\n4", "5 1\na\nb\nc\nd\nef\nef", "6 4\n1\n2\n22\n33\n44\n555\n555", "5 2\na\nb\nc\nd\nab\nab", "6 2\n1\n2\n3\n4\n5\n23\n23", "4 2\na\nb\naa\nbb\naa", "5 4\na\nbb\ncc\ndd\nee\nbb", "4 1\na\nb\nc\nab\nab", "7 100\na\nb\nc\nd\ne\ng\nab\nab", "6 1\na\nb\nc\nd\ne\naa\naa", "4 1\na\nas\nasd\nasde\nasde", "5 2\n1\n2\n3\n11\n22\n22", "10 2\na\nb\nc\nd\nee\nff\ngg\nhh\nii\njj\nii", "3 1\na\nab\nbc\nab", "6 4\na\nb\nc\nbb\nbc\ncc\ncc"], "outputs": ["1 15", "3 4", "1 1", "1 1", "1 7", "1 2", "1 1", "1 1", "7 7", "2 2", "1 1", "25 25", "3 11", "44 50", "36 65", "1 65", "6 25", "13 13", "9 11", "8 9", "7 7", "7 13", "7 7", "9 15", "13 19", "13 13", "12 20", "1 9", "1 19", "25 25", "11 11", "15 15", "16 16", "8 9", "2 10", "19 19", "7 7", "31 31", "19 19", "9 15", "15 30", "7 13", "4 11"]}

UNKNOWN

PYTHON3

CODEFORCES

104

91615ecf5e80dbea491e2b190588ef2c

none

Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him. The area looks like a strip of cells 1<=×<=*n*. Each cell contains the direction for the next jump and the length of that jump. Grasshopper starts in the first cell and follows the instructions written on the cells. Grasshopper stops immediately if it jumps out of the strip. Now Artem wants to find out if this will ever happen. The first line of the input contains a single integer *n* (1<=≤<=*n*<=≤<=100<=000) — length of the strip. Next line contains a string of length *n* which consists of characters "<" and ">" only, that provide the direction of the jump from the corresponding cell. Next line contains *n* integers *d**i* (1<=≤<=*d**i*<=≤<=109) — the length of the jump from the *i*-th cell. Print "INFINITE" (without quotes) if grasshopper will continue his jumps forever. Otherwise print "FINITE" (without quotes). Sample Input 2 >< 1 2 3 >>< 2 1 1 Sample Output FINITE INFINITE

[ "n = int(input())\ns = str(input())\nL = list(map(int, input().split()))\nD = [0 for _ in range(n)]\nr = 0\nok = 1\nwhile r >= 0 and r < n:\n if D[r]:\n ok = 0\n break\n else:\n D[r] = 1\n if s[r] == \"<\":\n r = r - L[r]\n else:\n r = r + L[r]\nif ok:\n print(\"FINITE\")\nelse:\n print(\"INFINITE\")\n", "n = int(input())\r\nstr = input()\r\ninp = list(map(int, input().split()))\r\n\r\nfor i in range(len(str)):\r\n if str[i] == '<':\r\n inp[i] *= -1\r\n\r\nvisited = [0 for i in range(n)]\r\n\r\ncur = 0\r\n\r\nwhile cur >= 0 and cur < n and visited[cur] != 1:\r\n visited[cur] = 1\r\n cur += inp[cur]\r\n\r\nif cur >= 0 and cur < n:\r\n print(\"INFINITE\")\r\nelse:\r\n print(\"FINITE\")", "ans = 0\r\nn = int(input())\r\nS = list(input())\r\nl = list(map(int , input().split()))\r\nfor i in range(n+1):\r\n\r\n if S[ans] =='>':\r\n ans += l[ans]\r\n else :\r\n ans-=l[ans]\r\n if ans not in range(n):\r\n print('FINITE')\r\n break\r\n \r\n \r\nelse:\r\n print('INFINITE')", "n = int(input())\r\ndirection = list(input())\r\ntempstep = input().split(' ')\r\n\r\nstep = []\r\nswitch = [0] * n\r\n\r\nfor i in range(n):\r\n\tif direction[i] == \">\":\r\n\t\tstep.append(int(tempstep[i]))\r\n\telif direction[i] == \"<\":\r\n\t\tstep.append((-1) * int(tempstep[i]))\r\n\r\ncurrent = 0\r\n\r\nwhile True:\r\n\tswitch[current] = 1\r\n\tcurrent = current + step[current]\r\n\tif current < 0 or current >= n:\r\n\t\tprint(\"FINITE\")\r\n\t\tbreak\r\n\tif switch[current] == 1:\r\n\t\tprint(\"INFINITE\")\r\n\t\tbreak\r\n", "n = int(input())\r\ns = input(); a = len(s)\r\nj = list(map(int, input().split()))\r\nx = 1\r\nb = 'INFINITE'\r\ntmp = 0\r\nwhile tmp < n:\r\n\tif s[x-1] == '>':\r\n\t\tx += j[x-1]\r\n\t\tif x > n:\r\n\t\t\tb = 'FINITE'; break\r\n\telif s[x-1] == '<':\r\n\t\tx -= j[x-1]\r\n\t\tif x <= 0:\r\n\t\t\tb = 'FINITE'; break\r\n\ttmp += 1\r\nprint(b)", "num=int(input())\r\nl=input()\r\nsteps=list(map(int,input().split()))\r\nlights=[False]*num\r\ni=0\r\n\r\nwhile(i<num and i>=0):\r\n if lights[i]==True:\r\n print('INFINITE') \r\n break\r\n lights[i]=True\r\n if l[i]=='>':\r\n i=i+steps[i]\r\n else:\r\n i=i-steps[i] \r\nelse:\r\n print('FINITE')", "line_length = int(input())\r\ndirections = input()\r\ndistances = [int(distance) for distance in input().split()]\r\nvisited_cells = set()\r\ncurrent_cell = 0\r\nwhile 0 <= current_cell < line_length:\r\n if current_cell in visited_cells:\r\n break\r\n else:\r\n visited_cells.add(current_cell)\r\n if directions[current_cell] == '>':\r\n current_cell += distances[current_cell]\r\n else:\r\n current_cell -= distances[current_cell]\r\nif 0 <= current_cell < line_length:\r\n print(\"INFINITE\")\r\nelse:\r\n print(\"FINITE\")\r\n ", "n = int(input())\r\nl = [1 if x == \">\" else -1 for x in input()]\r\nc = list(map(int, input().split()))\r\nfor i in range(len(c)):\r\n l[i] *= c[i]\r\nret = True\r\ni = 0\r\nvis = {i}\r\nwhile True:\r\n if i < 0 or i >= n:\r\n ret = False\r\n break\r\n i += l[i]\r\n if i in vis:\r\n ret = True\r\n break\r\n vis.add(i)\r\nif ret:\r\n print(\"INFINITE\")\r\nelse:\r\n print(\"FINITE\")\r\n", "n = int(input())\r\ns = list(map(lambda x: 1 if x == '>' else -1, input().strip()))\r\nd = list(map(int, input().strip().split()))\r\nb = [False for _ in range(n)]\r\n\r\nc = 0\r\nwhile True:\r\n c += s[c] * d[c]\r\n if c >= n or c < 0:\r\n print('FINITE')\r\n exit()\r\n if b[c]:\r\n print('INFINITE')\r\n exit()\r\n b[c] = True\r\n", "l=int(input())\r\ns=input()\r\nj=list(map(int, input().split()))\r\nf=\"INFINITE\"\r\nk=0\r\ni=0\r\nwhile i<l :\r\n k=k+(j[k]*(s[k]==\">\")-j[k]*(s[k]==\"<\"))\r\n if k>=l or k<0:\r\n f=\"FINITE\"\r\n i=l\r\n i=i+1\r\nprint(f)\r\n", "def task():\r\n ln = int(input())\r\n s = input()\r\n d = [int(i) for i in input().split()]\r\n n = len(d)\r\n a = [0 for i in range(n)]\r\n i = 0\r\n while (i > -1 and i < n):\r\n if s[i] == \">\":\r\n if a[i] == 0:\r\n a[i] = 1\r\n i += d[i]\r\n else:\r\n print(\"INFINITE\")\r\n return\r\n else:\r\n if a[i] == 0:\r\n a[i] = 1\r\n i -= d[i]\r\n else:\r\n print(\"INFINITE\")\r\n return\r\n print(\"FINITE\")\r\n\r\ntask()\r\n", "n = int(input())-1\r\ns = input()\r\nd = [int(i) for i in input().split()]\r\nc = True\r\ncnt = 0\r\ni = 0\r\nz = 0\r\nwhile i<=n and i>=0:\r\n\tif s[i]:\r\n\t\tif s[i]==\">\":\r\n\t\t\ti+=d[i]\r\n\t\t\tz+=1\r\n\t\telif s[i]==\"<\":\r\n\t\t\ti-=d[i]\r\n\t\t\tz+=1\r\n\telse:\r\n\t\tbreak\r\n\tif z>=2*n:c=False;break\r\nif i>n or i<0:\r\n\tprint(\"FINITE\")\r\nelse:\r\n\tprint(\"INFINITE\")", "\r\nn = int(input())\r\ns = input()\r\narr = list(map(int, input().split()))\r\n\r\nseen = set()\r\n\r\ncurrent_index = 0\r\n\r\nwhile True:\r\n command = s[current_index]\r\n step = arr[current_index]\r\n if command == \">\":\r\n current_index += step\r\n else:\r\n current_index -= step\r\n # print(current_index)\r\n if current_index > n-1 or current_index < 0:\r\n # print(current_index)\r\n print(\"FINITE\")\r\n exit()\r\n else:\r\n if current_index in seen:\r\n print(\"INFINITE\")\r\n exit()\r\n seen.add(current_index)\r\n", "import math \r\n\r\ndef solve():\r\n\r\n\tn = int(input())\r\n\ts = input()\r\n\ta = list(map(int, input().split()))\r\n\r\n\tidx = 0\r\n\tvisited = [False for i in range(n)]\r\n\r\n\twhile idx >= 0 and idx < n:\r\n\r\n\t\tif visited[idx] == True:\r\n\t\t\tprint(\"INFINITE\")\r\n\t\t\treturn\r\n\r\n\t\tvisited[idx] = True\r\n\r\n\t\tif s[idx] == '>':\r\n\t\t\tidx += a[idx]\r\n\t\telse:\r\n\t\t\tidx -= a[idx]\r\n\r\n\tprint(\"FINITE\")\r\n\r\nfor _ in range(1):\r\n\tsolve()", "n = int(input())\ndir = list(map(lambda x : 1 if x == '>' else -1, input()))\ndist = list(map(int, input().split()))\nvis = [False for _ in range(n)]\n\ncell = 0\nwhile cell >= 0 and cell < n and not vis[cell]:\n vis[cell] = True\n cell += dist[cell] * dir[cell]\nprint('FINITE' if cell < 0 or cell >= n else 'INFINITE')\n", "# python3\n# utf-8\n\nfield_size = int(input())\nfield_idx___dir = input()\nfield_idx___jump_len = [int(x) for x in input().split()]\n\nfield_idx___was_visited = [False for x in range(field_size)]\n\ncurr_field_idx = 0\nwhile 0 <= curr_field_idx < field_size:\n if field_idx___was_visited[curr_field_idx]:\n print('INFINITE')\n quit()\n field_idx___was_visited[curr_field_idx] = True\n if field_idx___dir[curr_field_idx] == '>':\n curr_field_idx += field_idx___jump_len[curr_field_idx]\n else:\n curr_field_idx -= field_idx___jump_len[curr_field_idx]\nprint('FINITE')\n", "n = int(input())\r\ns = list(input())\r\nd = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if s[i] == '<':\r\n d[i] = -d[i]\r\n\r\nused = [0] * n\r\ncur = 0\r\nwhile 0 <= cur < n and not used[cur]:\r\n used[cur] = 1\r\n cur += d[cur]\r\n\r\nif 0 <= cur < n:\r\n print('INFINITE')\r\nelse:\r\n print('FINITE')\r\n", "n=int(input())\r\nv=input()\r\njmp=list(map(int, input().split()))\r\nk=0\r\ni=0\r\nwhile True:\r\n if v[i]=='>':\r\n i+=jmp[i]\r\n k+=1\r\n else:\r\n i-=jmp[i]\r\n k+=1\r\n if i<0 or i>n-1:\r\n print('FINITE')\r\n break\r\n if k>n:\r\n print('INFINITE')\r\n break\r\n", "import os\r\nimport sys\r\nimport math\r\nimport heapq\r\nfrom decimal import *\r\nfrom io import BytesIO, IOBase\r\nfrom collections import defaultdict, deque\r\n\r\ndef r():\r\n return int(input())\r\ndef rm():\r\n return map(int,input().split())\r\ndef rl():\r\n return list(map(int,input().split()))\r\n\r\nn = r()\r\na = input()\r\nb = rl()\r\nvisited = defaultdict(bool)\r\n\r\ni=0\r\nans = True\r\nwhile True:\r\n if visited[i]:\r\n break\r\n if a[i]=='>':\r\n dist = i+b[i]\r\n else:\r\n dist = i-b[i]\r\n visited[i]=True\r\n if dist < 0 or dist >= n:\r\n ans = False\r\n break\r\n i = dist\r\nif not ans:\r\n print(\"FINITE\")\r\nelse:\r\n print(\"INFINITE\")\r\n", "n=int(input())\r\ndir=input()\r\nstep=list(map(int,input().split()))\r\nk=0\r\ni=0\r\nwhile True:\r\n if dir[i]=='>':\r\n i+=step[i]\r\n k+=1\r\n else:\r\n i-=step[i]\r\n k+=1\r\n if i<0 or i>n-1:\r\n print('FINITE')\r\n break\r\n if k>n:\r\n print('INFINITE')\r\n break", "n = int(input())\r\nsteps = input()\r\nstep_qty = list(map(int,input().split()))\r\nbool_steps = [False] * n\r\n\r\ni = 0\r\n\r\nwhile(i < n and i >= 0):\r\n if bool_steps[i] == True:\r\n print('INFINITE')\r\n break\r\n bool_steps[i] = True\r\n if steps[i] == '>':\r\n i += step_qty[i]\r\n else:\r\n i -= step_qty[i]\r\nelse:\r\n print('FINITE')\r\n", "n=int(input())\r\ns=input()\r\nl=list(map(int,input().split()))\r\nd={}\r\ni=0\r\nwhile True:\r\n if d.get(i,0): print('INFINITE'); break\r\n if s[i]=='>':\r\n if l[i]+i>=n:\r\n print('FINITE')\r\n break\r\n d[i]=1\r\n i+=l[i]\r\n else:\r\n if i-l[i]<0:\r\n print('FINITE')\r\n break\r\n d[i]=1\r\n i-=l[i]", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\nw = list(map(int, input().split()))\r\n\r\nc = 0\r\ni = 0\r\nd = [0]*100000\r\nwhile True:\r\n if s[i] == '>':\r\n c += w[i]\r\n i = c\r\n else:\r\n c -= w[i]\r\n i = c\r\n if i < 0 or i > n-1:\r\n print(\"FINITE\")\r\n break\r\n else:\r\n if d[i] == 0:\r\n d[i] = 1\r\n else:\r\n print(\"INFINITE\")\r\n break", "import sys\nfrom bisect import bisect_left\ndef second():\n inp = sys.stdin.readline()\n n = int(inp)\n inp = sys.stdin.readline()\n line = []*n\n for i in range(n):\n cur = []\n cur.append(inp[i])\n cur.append(0)\n cur.append(0)\n line.append(cur)\n inp = sys.stdin.readline().strip().split(' ')\n for i in range(n):\n line[i][1] = int(inp[i])\n pos = 0\n line[0][2] = 1\n for i in range(n):\n if(line[pos][0] == '>'):\n pos += line[pos][1]\n else:\n pos -= line[pos][1]\n if(pos >= n or pos < 0):\n print('FINITE')\n break\n if(line[pos][2] == 1):\n print('INFINITE')\n break\n line[pos][2] = 1\n\nsecond()", "n = int(input())\r\ns = input()\r\na = list(map(int, input().split()))\r\nf = True\r\nb = [0] * len(a)\r\ni = 0\r\nwhile(f):\r\n if b[i] == 1:\r\n f = False\r\n b[i] = 1\r\n if s[i] == \">\":\r\n i+=a[i]\r\n else:\r\n i-=a[i]\r\n if(i>=n or i<0):\r\n break\r\n \r\nif f:\r\n print(\"FINITE\")\r\nelse:\r\n print(\"INFINITE\")\r\n", "a=int(input())\r\nb=input()\r\nc=list(map(int,input().split()))\r\nvis=[0]*a\r\ni=0\r\nwhile True:\r\n if i<0 or i>=a:print('FINITE');exit()\r\n if vis[i]==1:break\r\n vis[i]=1\r\n if b[i]=='>':i+=c[i]\r\n else:i-=c[i]\r\n \r\nprint('INFINITE')\r\n", "def main():\n n = int(input())\n l = [j - i if c == \"<\" else j + i for c, i, j in zip(input(), map(int, input().split()), range(n))]\n v, i = [True] * n, 0\n while 0 <= i < n:\n if v[i]:\n v[i] = False\n else:\n print(\"INFINITE\")\n return\n i = l[i]\n print(\"FINITE\")\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\nrow = [0]*(n+1)\r\nrow[1] = 1\r\ndire = input()\r\nsize_j = list(map(int,input().split()))\r\nnow_cell = 1\r\nwhile True:\r\n if dire[now_cell-1] == \">\":\r\n now_cell += size_j[now_cell-1]\r\n else:\r\n now_cell -= size_j[now_cell-1]\r\n\r\n if now_cell > n or now_cell < 1:\r\n print(\"FINITE\")\r\n break\r\n\r\n if row[now_cell] == 1:\r\n print(\"INFINITE\")\r\n break\r\n \r\n row[now_cell] = 1\r\n \r\n", "pos, visited = 1, set()\r\nn = int(input())\r\nmoves = input()\r\nlst = list(map(int, input().split()))\r\nwhile True:\r\n sgn = +1 if moves[pos-1] == \">\" else -1\r\n pos += lst[pos-1] * sgn\r\n if pos < 1 or pos > n:\r\n print(\"FINITE\")\r\n break\r\n if pos in visited:\r\n print(\"INFINITE\")\r\n break\r\n visited.add(pos)", "n = int(input())\r\ns = input()\r\nl = list(map(int, input().split()))\r\n\r\nx = []\r\np, t = 1, \"FINITE\"\r\n\r\nwhile 1 <= p <= n:\r\n\tx.append(p)\r\n\t\r\n\tif s[p - 1] == \">\":\r\n\t\tp += l[p - 1]\r\n\telse:\r\n\t\tp -= l[p - 1]\r\n\t\t\r\n\tif p in x:\r\n\t\tt = \"INFINITE\"\r\n\t\tbreak\r\n\t\t\t\t\r\nprint(t)\r\n\t\t", "n=int(input())\r\ns=input()\r\nl=list(map(int,input().split()))\r\nL=[0 for i in range(n)]\r\ni=0\r\nwhile (True):\r\n if L[i]==-1 :\r\n print(\"INFINITE\")\r\n exit()\r\n L[i]=-1\r\n if s[i]==\">\" :\r\n i+=l[i]\r\n else :\r\n i-=l[i]\r\n if i<=-1 or i>=n :\r\n print(\"FINITE\")\r\n exit()\r\n \r\n \r\n \r\n", "n=int(input())\n\na=input() #string input\ncount=0\nflag=0\n\n\n\nb=[int(r) for r in input().split()]\n\n#b=input().split()\n\ni=int()\nfor i in range(0,n,1):\n if i==0:\n if a[i]=='>':\n count=count+b[i]\n else:\n count=count-b[i]\n\n elif a[count]=='>':\n count+=b[count]\n else:\n count-=b[count];\n\n if count>=n or count<0:\n flag=1\n break\n\nif flag==1:\n print(\"FINITE\")\nelse:\n print(\"INFINITE\")\n\n\t \t\t\t\t\t\t \t\t \t \t \t\t\t \t \t", "n = int(input())\r\nb = [True] * n\r\ns = input()\r\na = list(map(int, input().split()))\r\nfor i in range(len(s)):\r\n if s[i] == '<':\r\n a[i] *= -1\r\nk = 0\r\nwhile 0 <= k <= n - 1 and b[k]:\r\n b[k] = False\r\n k += a[k]\r\nif 0 <= k <= n - 1:\r\n print('INFINITE')\r\nelse:\r\n print('FINITE')\r\n", "import sys\n\ninp = int(input())\n\ndirecs = input()\n\ndirec = []\ndirec.append(0)\nfor i in direcs:\n direc.append(i)\n\nlengs = input().split(\" \")\nleng = []\nleng.append(0)\nfor i in lengs:\n leng.append(i)\n\nalls = list(zip(direc, leng))\n\ntrace = {}\nthru = False\nact = 1\n\nwhile 0 < act <= inp:\n if alls[act][0] == \"<\":\n act -= int(alls[act][1])\n else:\n act += int(alls[act][1])\n if act in trace:\n print(\"INFINITE\")\n sys.exit()\n else:\n trace[act] = None\nprint(\"FINITE\")\n", "if __name__ == '__main__':\n n = int(input())\n d = input()\n w = [int(i) for i in input().split()]\n visited = set()\n i = 0\n while (i not in visited) and (i < n) and (i > -1):\n visited.add(i)\n if d[i] == '>':\n i += w[i]\n else:\n i -= w[i]\n if (i >= 0) and (i < n):\n print('INFINITE')\n else:\n print('FINITE')", "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\ns = list(S())\r\nstep = II()\r\nvisited = [False] * n\r\nnow = 0\r\nwhile True:\r\n if visited[now]:\r\n p(\"INFINITE\")\r\n exit(0)\r\n visited[now] = True\r\n if s[now] == '<':\r\n now -= step[now]\r\n else:\r\n now += step[now]\r\n if now < 0 or now >= n:\r\n break\r\np(\"FINITE\")", "# reading input\r\na=int(input())\r\nb=input()\r\nc=list(map(int,input().split()))\r\n\r\n#initializing\r\nvis=[0]*a\r\ni=0\r\nans = False\r\n\r\nwhile True:\r\n if i<0 or i>=a: ans = True; break;\r\n if vis[i]==1:break\r\n vis[i]=1\r\n if b[i]=='>':i+=c[i]\r\n else:i-=c[i]\r\n\r\nif(ans): \r\n\tprint('FINITE')\r\nelse:\r\n\tprint('INFINITE')", "n=int(input())\r\nc=[0]*n\r\nb=input()\r\na=list(map(int,input().split()))\r\nk=0\r\nwhile True:\r\n if c[k]==0:\r\n c[k]=1\r\n else:\r\n print(\"INFINITE\")\r\n break\r\n if b[k]==\">\":\r\n k+=a[k]\r\n if k>=n:\r\n print(\"FINITE\")\r\n break\r\n else:\r\n k-=a[k]\r\n if k<0:\r\n print(\"FINITE\")\r\n break\r\n \r\n", "\r\n\r\n\r\nif __name__=='__main__':\r\n n = int(input())\r\n st = input()\r\n dd = list(map(int,input().split()))\r\n vis = [False for i in range(n)]\r\n i = 0\r\n inf = False\r\n while True:\r\n if i>=n or i<0:\r\n #print(\"break\")\r\n break\r\n if vis[i]:\r\n inf = True\r\n break\r\n else:\r\n vis[i]=True\r\n \r\n if st[i]=='>':\r\n i+=dd[i]\r\n else:\r\n i-=dd[i]\r\n \r\n #print(\"i-> \",i)\r\n if inf:\r\n print(\"INFINITE\")\r\n else:\r\n print(\"FINITE\")\r\n", "n=int(input())\r\nl=list(input())\r\nm=list(map(int,input().split())) \r\na=0\r\nflag=0\r\nfor i in range(n):\r\n\tif(l[a]==\"<\"):\r\n\t\ta-=m[a]\r\n\telse:\r\n\t\ta+=m[a]\r\n\tif(a>=n or a<0):\r\n\t\tflag=1\r\n\t\tbreak\r\nif(flag==1):\r\n\tprint(\"FINITE\")\r\nelse:\r\n\tprint(\"INFINITE\")", "class graph():\r\n def __init__(self,n,v):\r\n self.G=dict()\r\n for i in range(1,n+1):\r\n self.G.update([(i,set())])\r\n self.v=v\r\n self.length=n\r\n def AppendEdge(self,a):\r\n self.G[a[0]].add(a[1])\r\n if not self.v:\r\n self.G[a[1]].add(a[0])\r\n def ShowAdjacent(self,a):\r\n return self.G[a]\r\n def ShowLength(self):\r\n return self.length\r\n def Show(self):\r\n print(self.G)\r\n\r\nn=int(input())\r\ns=input()\r\nf=[int(z) for z in input().split()]\r\n##G=graph(n+2,1)\r\nVis=[0]*n\r\nk=1\r\ni=0\r\nVis[0]=1\r\nwhile k!=0:\r\n\tif s[i]=='>':\r\n\t\tt=i+f[i]\r\n\t\tif t>=n:\r\n\t\t\tprint('FINITE')\r\n\t\t\tk=0\r\n\t\telif Vis[t]:\r\n\t\t\tprint('INFINITE')\r\n\t\t\tk=0\r\n\t\telse:\r\n\t\t\tVis[t]=1\r\n\t\t\ti=t\r\n\telse:\r\n\t\tt=i-f[i]\r\n\t\tif t<0:\r\n\t\t\tprint('FINITE')\r\n\t\t\tk=0\r\n\t\telif Vis[t]:\r\n\t\t\tprint('INFINITE')\r\n\t\t\tk=0\r\n\t\telse:\r\n\t\t\tVis[t]=1\r\n\t\t\ti=t", "def read_ints():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\ndef main():\r\n n = read_ints()[0]\r\n directions = input()\r\n distances = read_ints()\r\n\r\n visited = [False] * n\r\n current = 0\r\n while not visited[current]:\r\n visited[current] = True\r\n if directions[current] == '<':\r\n current -= distances[current]\r\n else:\r\n current += distances[current]\r\n if current < 0 or current >= n:\r\n break\r\n\r\n if current < 0 or current >= n:\r\n print(\"FINITE\")\r\n else:\r\n print(\"INFINITE\")\r\n\r\nmain()\r\n", "def main():\n n = int(input())\n s = input()\n a = list(map(int, input().split()))\n curr = 0\n was = set()\n while 0 <= curr <= n - 1:\n if curr in was:\n print(\"INFINITE\")\n exit()\n was.add(curr)\n if s[curr] == '>':\n curr += a[curr]\n else:\n curr -= a[curr]\n print(\"FINITE\")\n\nmain()", "n = int(input())\r\ns = input()\r\nd = list(map(int, input().split()))\r\n\r\nk = [False]*n\r\ni = 0\r\ninf = False\r\nwhile not inf and i >= 0 and i < n:\r\n\tif not k[i]:\r\n\t\tk[i] = True\r\n\telse:\r\n\t\tinf = True\r\n\t\r\n\tif s[i] == '<':\r\n\t\ti -= d[i]\r\n\telse:\r\n\t\ti += d[i]\r\n\r\nif inf:\r\n\tprint(\"INFINITE\")\r\nelse:\r\n\tprint(\"FINITE\")\r\n\t", "n = int(input())\n\ns = input()\n\narr = list(map(int, input().split()))\n\nk = 0\nst = {0}\n\nwhile True:\n if s[k] == '>':\n k += arr[k]\n else:\n k -= arr[k]\n if k in st:\n print('INFINITE')\n exit()\n st.add(k)\n if k >= n or k < 0:\n break\n\nprint('FINITE')\n", "_ = int(input())\ndir = list(map(lambda x: (-1 if x == '<' else 1), input()))\nval = list(map(int, input().split(' ')))\nparent = {0: None}\npos = val[0]*dir[0]\nwhile True:\n\tif pos<0 or pos >= len(dir):\n\t\tprint('FINITE')\n\t\tbreak\n\telse:\n\t\tif pos not in parent:\n\t\t\tparent[pos] = None\n\t\t\tif dir[pos] > 0:\n\t\t\t\tpos += val[pos]\n\t\t\telse:\n\t\t\t\tpos -= val[pos]\n\t\telse:\n\t\t\tprint(\"INFINITE\")\n\t\t\tbreak\n", "n = int(input())\r\ns = input()\r\np = 0\r\nk = 0\r\na = list(map(int, input().split()))\r\nfor i in range(2 * n):\r\n if s[p] == '>':\r\n p += a[p]\r\n else:\r\n p -= a[p]\r\n if (p > n - 1) or (p < 0):\r\n print(\"FINITE\")\r\n k = 1\r\n break\r\nif not k:\r\n print(\"INFINITE\")", "n = int(input())\r\ns = list(1 if x == '>' else -1 for x in input())\r\nl = list(map(int, input().split()))\r\nsumm = 1\r\ncur = 0\r\nnext = 0\r\nfor i in range(n):\r\n if cur < 0 or cur > n - 1:\r\n print('FINITE')\r\n exit()\r\n if l[cur] == 0:\r\n print('INFINITE')\r\n exit()\r\n next += l[cur] * s[cur]\r\n l[cur] = 0\r\n cur = next\r\nprint('INFINITE' if 0 <= cur < n else 'FINITE')", "n = int(input())\r\ns = input()\r\na = [int(x) for x in input().split()]\r\nv = [0]*n\r\nv[0] = 1\r\npos = 0\r\nwhile(True):\r\n if s[pos] == \">\":\r\n pos += a[pos]\r\n else:\r\n pos -= a[pos]\r\n if pos < 0 or pos >= n:\r\n print(\"FINITE\")\r\n break\r\n if v[pos] == 1:\r\n print(\"INFINITE\")\r\n break\r\n v[pos] = 1\r\n \r\n", "n = int(input())\r\ns = input()\r\nv = [int(i) for i in input().split(' ')]\r\nused = set()\r\ncurr = 0\r\nwhile True:\r\n if curr in used:\r\n print('INFINITE')\r\n break\r\n used.add(curr)\r\n curr += (v[curr])*(1 if s[curr]=='>' else -1)\r\n if curr<0 or curr>=n:\r\n print('FINITE')\r\n break\r\n\r\n", "n = int(input())\nd = input()\ns = [int(i) for i in input().split()]\nres = \"INFINITE\"\np = 0\nfor _ in range(n):\n p += (1 if d[p] == \">\" else -1) * s[p]\n if p >= n or p < 0:\n res = \"FINITE\"\n break\nprint(res)\n", "n = int(input())\ncells = input()\nlengths = list(map(int, input().split()))\nvisited = set()\ni = 0\nwhile (i not in visited) and (i < n) and (i > -1):\n\tvisited.add(i)\n\tif cells[i] == '>':\n\t\ti += lengths[i]\n\telse:\n\t\ti -= lengths[i]\n\t#print('new', i)\n\t\nif (i < n) and (i >= 0):\n\tprint(\"INFINITE\")\nelse:\n\tprint(\"FINITE\")\n\t\n", "n=int(input())\na=input()\nd=*map(int,input().split()),\nx=0\nv=[1,-1]\nfor i in range(n+1):\n x+=v[a[x]=='<']*d[x]\n if x<0 or x>=n:break\nprint('IN'*(i>=n)+'FINITE')\n\t \t\t \t\t \t \t\t \t \t\t \t\t \t", "n = int(input())\r\ns = input()\r\na = list(map(int, input().split()))\r\nused = [0] * n\r\nd = 0\r\nused[0] = 1\r\nfor i in range(n + 1):\r\n d = d + (-1) ** int(s[d] == '<') * a[d]\r\n if d < 0 or n <= d:\r\n print('FINITE')\r\n exit()\r\n else:\r\n if used[d] == 1:\r\n print('INFINITE')\r\n exit()\r\n else:\r\n used[d] = 1\r\n\r\n", "#\"from dust i have come, dust i will be\"\n\nn=int(input())\ns=str(input())\n\na=list(map(int,input().split()))\n\nvis=[0]*n\n\ni=0\nwhile 1:\n\n if i<0 or i>=n:\n print(\"FINITE\")\n exit(0)\n\n if vis[i]==1:\n print(\"INFINITE\")\n exit(0)\n\n else:\n vis[i]=1\n if s[i]=='>':\n i+=a[i]\n else:\n i-=a[i]\n\n \t\t \t\t\t\t \t \t \t\t\t \t \t", "n = int(input())\r\ns = input()\r\nnum = list(map(int, input().split()))\r\npos = 0\r\nb = [True] * n\r\nwhile n > pos >= 0 and b[pos]:\r\n b[pos] = False\r\n if s[pos] == \">\":\r\n pos += num[pos]\r\n else:\r\n pos -= num[pos]\r\nif n > pos >= 0:\r\n print(\"INFINITE\")\r\nelse:\r\n print(\"FINITE\")", "n = int(input())\r\nsign = input()\r\ndist = [int(x) for x in input().split()]\r\n\r\ncurrentCell = 1\r\nfinite = True\r\nwhile 1:\r\n\tif (currentCell < 1 or currentCell > n):\r\n\t\tfinite = True\r\n\t\tbreak\r\n\tif (dist[currentCell - 1] == -1):\r\n\t\tfinite = False\r\n\t\tbreak\r\n\tdistance = dist[currentCell - 1]\r\n\tdist[currentCell - 1] = -1\r\n\tif sign[currentCell - 1] == '>':\t\r\n\t\tcurrentCell += distance\r\n\telse:\r\n\t\tcurrentCell -= distance\r\nif finite:\r\n\tprint(\"FINITE\")\r\nelse:\r\n\tprint(\"INFINITE\")\r\n", "n = int(input())\ndirect = list(input())\nlength = list(map(int, input().split()))\n\nused = [0] * n\n\ncell = 0\nwhile True:\n if used[cell]:\n ans = 'INFINITE'\n break\n else:\n used[cell] = 1\n if direct[cell] == '>':\n if cell + length[cell] < n:\n cell += length[cell]\n else:\n ans = 'FINITE'\n break\n else:\n if cell - length[cell] >= 0:\n cell -= length[cell]\n else:\n ans = 'FINITE'\n break\n\nprint(ans)\n", "n = int(input())\ns = input()\no = [int(i) for i in input().split()]\ni = 0\nwhile o[i]:\n\tif s[i] == \"<\":\n\t\tk = i\n\t\ti-=o[i]\n\t\to[k] = 0\n\telse:\n\t\tk = i\n\t\ti+=o[i]\n\t\to[k] = 0\n\tif i>=n or i<0:\n\t\tprint(\"FINITE\")\n\t\tbreak\nelse:\n\tprint(\"INFINITE\")\n\t\n", "def solve(n, data, num):\r\n cur = 0\r\n res = []\r\n for i in range(n):\r\n res.append([data[i],0])\r\n while (cur >= 0) and (cur < n):\r\n res[cur][1] += 1\r\n if res[cur][1] == 2:\r\n return 'INFINITE'\r\n if res[cur][0] == '>':\r\n cur += num[cur]\r\n else:\r\n cur -= num[cur]\r\n return 'FINITE'\r\n \r\nn = int(input())\r\ndata = input()\r\nnum = [int(x) for x in input().split()]\r\n\r\nprint(solve(n, data, num))", "n = int(input())\r\ndirs = input()\r\nlens = list(map(int, input().split(' ')))\r\ncur = 0\r\nvisited = set()\r\nwhile True:\r\n visited.add(cur)\r\n goto = cur\r\n if dirs[cur] == '<':\r\n goto = cur - lens[cur]\r\n else:\r\n goto = cur + lens[cur]\r\n if goto in visited:\r\n print('INFINITE')\r\n break\r\n if goto < 0 or goto > n-1:\r\n print('FINITE')\r\n break\r\n cur = goto\r\n", "n=int(input())\r\na=input()\r\nb=[int(i) for i in input().split()]\r\ni=0\r\ntemp=0\r\nwhile True:\r\n if i < 0 or i >= n:\r\n print(\"FINITE\")\r\n break\r\n if b[i]==0:\r\n print(\"INFINITE\")\r\n break\r\n temp=b[i]\r\n if a[i]=='<':\r\n temp=-1*temp\r\n b[i]=0\r\n i+=temp", "class CodeforcesTask641ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.directions = []\n self.jump_lengths = []\n\n def read_input(self):\n self.n = int(input())\n self.directions = input()\n self.jump_lengths = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n jumps = 0\n pos = 1\n out = False\n while jumps < self.n * 10 and not out:\n jumps += 1\n pos += (-1 if self.directions[pos - 1] == \"<\" else 1) * self.jump_lengths[pos - 1]\n if pos < 1 or pos > self.n:\n out = True\n self.result = \"FINITE\" if out else \"INFINITE\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask641ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n=int(input())\r\ns=input()\r\na=list(map(int,input().split()))\r\nf=n*[False]\r\ni,j=0,0\r\nwhile True:\r\n # print(i,f[i])\r\n if i<0 or i>=n or n==1:\r\n print(\"FINITE\")\r\n break\r\n elif f[i]==True:\r\n print(\"INFINITE\")\r\n break\r\n else: \r\n f[i]=True\r\n if s[i]=='>':\r\n i+=a[i]\r\n else:\r\n i-=a[i]\r\n\r\n\r\n", "n=int(input())\r\ns=list(input())\r\na=list(map(int,input().split()))\r\nf=[0]*n\r\nx=0\r\nwhile(not f[x]):\r\n f[x]=1\r\n if(s[x]=='<'):\r\n x-=a[x]\r\n else:\r\n x+=a[x]\r\n if(x<0 or x>=n):\r\n print(\"FINITE\")\r\n exit()\r\nprint(\"INFINITE\")\r\n", "n=int(input())\r\ns=input()\r\nl=list(map(int, input().split()))\r\nx=1\r\nb='INFINITE'\r\nt=0\r\nfor i in range(n):\r\n\tif s[x-1]=='>':\r\n\t\tx += l[x-1]\r\n\t\tif x > n:\r\n\t\t\tb='FINITE'\r\n\t\t\tbreak\r\n\telif s[x-1]=='<':\r\n\t\tx -= l[x-1]\r\n\t\tif x <= 0:\r\n\t\t\tb = 'FINITE'\r\n\t\t\tbreak\r\nprint(b)", "tc=int(input())\r\nbruh=str(input())\r\nd=list(map(int,input().split()))\r\npogset=set({})\r\nbruhset=set({})\r\npog=True\r\ni=0\r\nwhile(i>=0 or i<=tc-1):\r\n if(bruh[i]==\">\"):\r\n pogset.add(i)\r\n if(len(pogset)==len(bruhset)):\r\n pog=False\r\n break\r\n else:\r\n bruhset.add(i)\r\n i=i+d[i]\r\n if(i>tc-1):\r\n break\r\n if(bruh[i]==\"<\"):\r\n pogset.add(i)\r\n if(len(pogset)==len(bruhset)):\r\n pog=False\r\n break\r\n else:\r\n bruhset.add(i)\r\n i=i-d[i]\r\n if(i<0):\r\n break\r\nif(pog):\r\n print(\"FINITE\")\r\nelse:\r\n print(\"INFINITE\")\r\n", "import math\r\ndef main_function():\r\n n = int(input())\r\n s = input()\r\n a = [int(i) for i in input().split(\" \")]\r\n current_position = 0\r\n hash = [0 for i in range(100000)]\r\n while True:\r\n if current_position < 0 or current_position > n - 1:\r\n print(\"FINITE\")\r\n break\r\n else:\r\n if hash[current_position] == 1:\r\n print(\"INFINITE\")\r\n break\r\n else:\r\n hash[current_position] = 1\r\n if s[current_position] == \">\":\r\n current_position += a[current_position]\r\n else:\r\n current_position -= a[current_position]\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "n=int(input())\r\ns=input()\r\nl=list(map(int, input().split()))\r\ni=0;c=0\r\nwhile c<=n+1:\r\n if s[i]=='>': i+=l[i]\r\n else: i-=l[i]\r\n if i<0 or i>=n:\r\n n=0\r\n break\r\n c+=1\r\nprint(\"FINITE\" if n==0 else \"INFINITE\")\r\n", "n = int(input())\r\nD = [d if ch=='>' else -d for ch,d in zip(input(), map(int, input().split()))]\r\ni = 0\r\nvisited = {0}\r\n\r\nwhile True:\r\n i += D[i]\r\n if i < 0 or i >= n:\r\n print('FINITE')\r\n break\r\n if i in visited:\r\n print('INFINITE')\r\n break\r\n visited.add(i)", "n=int(input())\r\ns=input()\r\nlist=[int(i) for i in input().split()]\r\nwaste,status,i=0,0,0\r\nwhile(True):\r\n if(s[status]=='>'):\r\n status+=list[status]\r\n else:\r\n status-=list[status]\r\n list[waste]=-1\r\n waste=status\r\n if(status>=n or status<0):\r\n print(\"FINITE\")\r\n exit()\r\n if(list[status]==-1):\r\n print(\"INFINITE\")\r\n exit()", "\r\n\r\nn = int(input())\r\ns = input()\r\nl = list(map(int, input().split()))\r\ncount = 0\r\nmas = [False for i in range(n)]\r\npos = 0\r\nans = 'INFINITE'\r\nfor i in range(n):\r\n if mas[pos]:\r\n break\r\n else:\r\n mas[pos] = True\r\n if s[pos] == '<':\r\n if pos - l[pos] < 0:\r\n ans = 'FINITE'\r\n else:\r\n pos -= l[pos]\r\n else:\r\n if pos + l[pos] >= n:\r\n ans = 'FINITE'\r\n else:\r\n pos += l[pos]\r\nprint(ans)", "N = int(input())\r\nstring = input()\r\narr = list(map(int,input().split()))\r\npointer = 0\r\nhashset = set()\r\nwhile(True):\r\n if pointer < 0 or pointer > N - 1:\r\n print(\"FINITE\")\r\n break\r\n elif string[pointer] == \"<\":\r\n if pointer in hashset:\r\n print(\"INFINITE\")\r\n break\r\n else:\r\n hashset.add(pointer)\r\n pointer -= arr[pointer]\r\n \r\n elif string[pointer] == \">\":\r\n if pointer in hashset:\r\n print(\"INFINITE\")\r\n break\r\n else:\r\n hashset.add(pointer)\r\n pointer += arr[pointer]", "n = int(input())\ninstructions = list(zip(input(), [int(i) for i in input().split()]))\n\nused = set()\npos = 0\nwhile True:\n if pos < 0 or pos >= n:\n print('FINITE')\n break\n if pos in used:\n print('INFINITE')\n break\n used.add(pos)\n\n direct, length = instructions[pos]\n if direct == '>':\n pos += length\n else:\n pos -= length\n", "a=int(input())\r\nb=input()\r\nc=list(map(int,input().split()))\r\nn=1\r\nd=[0]*(a)\r\nif '<' not in b or '>' not in b:\r\n print(\"FINITE\")\r\n exit(0)\r\nwhile n>=1 and n<=a :\r\n if b[n-1]=='<' and d[n-1]==0 and n>=1 and n<=a:\r\n d[n-1]=1\r\n n-=(c[n-1])\r\n elif b[n-1]=='>' and d[n-1]==0 and n>=1 and n<=a:\r\n d[n-1]=1\r\n n+=(c[n-1])\r\n elif d[n-1]==1:\r\n print(\"INFINITE\")\r\n exit(0)\r\n if (n)>a or n<1:\r\n print(\"FINITE\")\r\n exit(0)", "n=int(input())\r\ns=str(input())\r\n\r\narr=list(map(int,input().split()))\r\n\r\narr2=[0]*n\r\n\r\ni=0\r\nwhile 1:\r\n\r\n if i<0 or i>=n:\r\n print(\"FINITE\")\r\n exit(0)\r\n\r\n if arr2[i]==1:\r\n print(\"INFINITE\")\r\n exit(0)\r\n\r\n else:\r\n arr2[i]=1\r\n if s[i]=='>':\r\n i+=arr[i]\r\n else:\r\n i-=arr[i]", "n=int(input())\r\n\r\nvisited=[0]*n\r\ndirection=[\"+\" if x==\">\" else \"-\" for x in input()]\r\njump=input().split()\r\nx=0\r\nwhile True:\r\n if x>=n or x<0:\r\n print(\"FINITE\")\r\n break\r\n if visited[x]==1:\r\n print(\"INFINITE\")\r\n break\r\n \r\n visited[x]=1\r\n x=eval(str(x)+direction[x]+jump[x])", "n=int(input())\r\na=list(input())\r\nb=list(map(int,input().split()))\r\ni=0\r\nc=[0]*n\r\nwhile i>=0 and i<n:\r\n if c[i]==1:\r\n print('INFINITE')\r\n exit()\r\n c[i]=1\r\n if a[i]=='>':i+=b[i]\r\n else:i-=b[i]\r\nprint('FINITE')\r\n", "import sys\nsys.stderr = sys.stdout\n\n\ndef grasshop(n, s, D):\n i = 0\n while 0 <= i < n:\n d = D[i]\n if not d:\n return False\n D[i] = None\n i += -d if s[i] == '<' else d\n return True\n\n\ndef main():\n n = readint()\n s = input()\n D = readintl()\n print('FINITE' if grasshop(n, s, D) else 'INFINITE')\n\n##########\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.__stderr__)\n\n\nif __name__ == '__main__':\n main()\n", "def main():\r\n n = int(input())\r\n d = input()\r\n l = [int(c) for c in input().split()]\r\n visited = {0}\r\n i = 0\r\n while 0 <= i < n:\r\n di, li = d[i], l[i]\r\n i = i + li if di == '>' else i - li\r\n if i in visited:\r\n print('INFINITE')\r\n return\r\n visited.add(i)\r\n\r\n print('FINITE')\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\ndi = list(input())\r\njumps = list(map(int, input().split(' ')))\r\nvisited = {}\r\npos = 0\r\ni = 0\r\nwhile pos not in visited and i < n and pos >= 0 and pos < n:\r\n visited[pos] = 1\r\n pos += jumps[pos] if di[pos] == '>' else -jumps[pos] \r\n i+=1\r\nif pos in visited:\r\n print(\"INFINITE\")\r\nelse:\r\n print(\"FINITE\")\r\n", "n=int(input())\r\nstr=input()\r\na=list(map(int,input().split()))\r\ncrt=0\r\nflag=True\r\nfor i in range(n+10):\r\n\tif str[crt]=='>':\r\n\t\tcrt+=a[crt]\r\n\telse:\r\n\t\tcrt-=a[crt]\r\n\tif crt<0 or crt >=n:\r\n\t\tflag=False\r\n\t\tbreak\r\n\r\nif not flag:\r\n\tprint(\"FINITE\")\r\nelse:\r\n\tprint(\"INFINITE\")", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\n\r\ndef main():\r\n n = I()\r\n s = S()\r\n a = IA()\r\n j = 0\r\n for i in range(n):\r\n d = s[j]\r\n l = a[j]\r\n if d == '>':\r\n j += l\r\n else:\r\n j -= l\r\n if j < 0 or j >= n:\r\n return 'FINITE'\r\n return 'INFINITE'\r\n\r\nif __name__ == '__main__':\r\n print(main())", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn,s,i=int(input()),input(),0\r\nd=list(map(int,input().split()))\r\nfor _ in range(len(s)+1):\r\n if i<0 or i>=len(s):exit(print('FINITE'))\r\n i+=[d[i],-d[i]][s[i]=='<']\r\nprint('INFINITE')", "n=int(input())\r\na=list(input())\r\nb=list(map(int,input().split()))\r\ni=0\r\nflag=False\r\ncount=0\r\nwhile(True):\r\n if a[i]=='<':\r\n i = i-b[i]\r\n else:\r\n i = i+b[i]\r\n if i<0 or i>=n:\r\n flag=True\r\n break\r\n count+=1\r\n if count>n:\r\n break\r\n\r\nprint(\"FINITE\" if flag else \"INFINITE\")", "n=int(input())\r\na=input()\r\nd=*map(int,input().split()),\r\nx=0\r\nv=[1,-1]\r\nfor i in range(n+1):\r\n x+=v[a[x]=='<']*d[x]\r\n if x<0 or x>=n:break\r\nprint('IN'*(i>=n)+'FINITE')", "n,s,i=int(input()),input(),0\r\nd=list(map(int,input().split()))\r\nfor _ in range(len(s)+1):\r\n if i<0 or i>=len(s):exit(print('FINITE'))\r\n i+=[d[i],-d[i]][s[i]=='<']\r\nprint('INFINITE')\n", "n, s = int(input()), input()\r\na = [int(i) for i in input().split()]\r\nc = i = 0\r\nwhile True:\r\n if s[i] == '>':\r\n i += a[i]\r\n else:\r\n i -= a[i]\r\n if i < 0 or i >= n:\r\n print(\"FINITE\")\r\n exit()\r\n c += 1\r\n if c > n:\r\n print(\"INFINITE\")\r\n exit()", "n=int(input())\r\nl=list(input())\r\nm=list(map(int,input().split())) \r\na=0\r\nx=0\r\nfor i in range(n):\r\n\tif l[a]==\"<\" :\r\n\t\ta=a-m[a]\r\n\telse:\r\n\t\ta=a+m[a]\r\n\tif a>=n or a<0 :\r\n\t\tx=1\r\n\t\tbreak\r\nif x==1 :\r\n\tprint(\"FINITE\")\r\nelse:\r\n\tprint(\"INFINITE\")", "n=int(input())\r\ns = input()\r\nd = list(map(int, input().split()))\r\ni = 0\r\nfor _ in range(n+1):\r\n if i < 0 or i >= n:\r\n print(\"FINITE\")\r\n exit()\r\n if s[i] == '>':\r\n i += d[i]\r\n elif s[i] == '<':\r\n i -= d[i]\r\nprint(\"INFINITE\")", "n=int(input())\r\ns=input()\r\na=[int(i) for i in input().split(' ')]\r\nvs=set([])\r\ncur=0\r\nwhile True:\r\n if cur in vs:\r\n print('INFINITE')\r\n break\r\n else:\r\n vs.add(cur)\r\n if s[cur]=='>':\r\n if cur+a[cur]>=n:\r\n print('FINITE')\r\n break\r\n else:\r\n cur=cur+a[cur]\r\n else:\r\n if cur-a[cur]<0:\r\n print('FINITE')\r\n break\r\n else:\r\n cur-=a[cur]\r\n\r\n\r\n", "n=int(input())\ns=input()\nd=list(map(int, input().split()))\ni=0\nfor iteertert in range(len(s)+1):\n if i<0 or i>=len(s):\n print(\"FINITE\")\n exit()\n if s[i] is '>':\n i+=d[i]\n else:\n i-=d[i]\nprint(\"INFINITE\")\n", "n = int(input())\r\n\r\nway = list(input())\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\nvisit = {0}\r\npos = 0\r\ndest = 0\r\nwhile True:\r\n jump = daf[pos]\r\n if way[pos] == '<':\r\n dest = pos - jump\r\n else:\r\n dest = pos + jump\r\n\r\n if dest in visit:\r\n print(\"INFINITE\")\r\n break\r\n if dest < 0 or dest >= n:\r\n print(\"FINITE\")\r\n break\r\n \r\n pos = dest\r\n visit.add(dest)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\nd = list(map(int, input().split()))\r\nfor i in range(n):\r\n d[i] *= s[i] - 61\r\ni = 0\r\nans = \"INFINITE\"\r\nfor _ in range(n + 5):\r\n i += d[i]\r\n if not 0 <= i < n:\r\n ans = \"FINITE\"\r\n break\r\nprint(ans)", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nn = int(input())\r\ndirection = input()\r\ndist = [int(i) for i in input().split()]\r\nvisited = set()\r\n\r\ncycle = False\r\n\r\ni = 0\r\nwhile i >= 0 and i < n:\r\n\tvisited.add(i)\r\n\r\n\tif direction[i] == '<':\r\n\t\ti -= dist[i]\r\n\telif direction[i] == '>':\r\n\t\ti += dist[i]\r\n\r\n\tif i in visited:\r\n\t\tcycle = True\r\n\t\tbreak\r\n\t\r\nif cycle:\r\n\tprint('INFINITE')\r\nelse:\r\n\tprint('FINITE')\r\n", "n = int(input())\r\ns = input()\r\nA = list(map(int, input().split()))\r\nk = 1\r\nB = [True for i in range(n)]\r\nwhile True:\r\n napr = s[k - 1]\r\n if B[k - 1] == False:\r\n print('INFINITE')\r\n break\r\n elif napr == '>' and B[k - 1] == True:\r\n B[k - 1] = False\r\n k += A[k - 1]\r\n elif napr == '<' and B[k - 1] == True:\r\n B[k - 1] = False\r\n k -= A[k - 1]\r\n if k < 1 or k > n:\r\n print('FINITE')\r\n break\r\n" ]

{"inputs": ["2\n><\n1 2", "3\n>><\n2 1 1", "1\n>\n1000000000", "1\n<\n1000000000", "2\n>>\n1 1", "5\n>><><\n1 2 3 1 2", "5\n>><><\n1 2 2 1 2", "10\n>>>>>>>>><\n1 1 1 1 1 1 1 1 1 10", "10\n>>>>>>>>><\n1 1 1 1 1 1 1 1 1 5", "10\n>>>>>>>>><\n1 1 1 1 1 1 1 1 1 1", "3\n><<\n2 1 1", "10\n>>>>>>>>>>\n1 1 1 1 1 1 1 1 1 100", "3\n><<\n2 100 2", "3\n><<\n2 3 2", "3\n>><\n2 3 2", "3\n><>\n1 1 1", "3\n>><\n2 2 2", "4\n>><<\n2 100 2 100", "3\n><>\n1 1 3", "5\n><>>>\n1 1 10 10 10", "5\n><<<<\n500 1 2 3 4", "4\n><><\n2 1000 1 1", "3\n><<\n2 10 2", "3\n><<\n2 5 2", "2\n><\n5 5", "3\n>><\n1 10 10", "4\n><<>\n2 1 1 5", "5\n<<>>>\n1 1 1 1 1", "3\n><>\n1 1 12345", "4\n>>><\n3 2 2 3", "3\n><>\n1 1 100000"], "outputs": ["FINITE", "INFINITE", "FINITE", "FINITE", "FINITE", "FINITE", "INFINITE", "FINITE", "INFINITE", "INFINITE", "INFINITE", "FINITE", "INFINITE", "INFINITE", "INFINITE", "INFINITE", "INFINITE", "INFINITE", "INFINITE", "INFINITE", "FINITE", "INFINITE", "INFINITE", "INFINITE", "FINITE", "FINITE", "INFINITE", "FINITE", "INFINITE", "INFINITE", "INFINITE"]}

UNKNOWN

PYTHON3

CODEFORCES

96

9168c9068c3cb16956fa2cc4c969c235

none

A ski base is planned to be built in Walrusland. Recently, however, the project is still in the constructing phase. A large land lot was chosen for the construction. It contains *n* ski junctions, numbered from 1 to *n*. Initially the junctions aren't connected in any way. In the constructing process *m* bidirectional ski roads will be built. The roads are built one after another: first the road number 1 will be built, then the road number 2, and so on. The *i*-th road connects the junctions with numbers *a**i* and *b**i*. Track is the route with the following properties: - The route is closed, that is, it begins and ends in one and the same junction.- The route contains at least one road. - The route doesn't go on one road more than once, however it can visit any junction any number of times. Let's consider the ski base as a non-empty set of roads that can be divided into one or more tracks so that exactly one track went along each road of the chosen set. Besides, each track can consist only of roads from the chosen set. Ski base doesn't have to be connected. Two ski bases are considered different if they consist of different road sets. After building each new road the Walrusland government wants to know the number of variants of choosing a ski base based on some subset of the already built roads. The government asks you to help them solve the given problem. The first line contains two integers *n* and *m* (2<=≤<=*n*<=≤<=105,<=1<=≤<=*m*<=≤<=105). They represent the number of junctions and the number of roads correspondingly. Then on *m* lines follows the description of the roads in the order in which they were built. Each road is described by a pair of integers *a**i* and *b**i* (1<=≤<=*a**i*,<=*b**i*<=≤<=*n*,<=*a**i*<=≠<=*b**i*) — the numbers of the connected junctions. There could be more than one road between a pair of junctions. Print *m* lines: the *i*-th line should represent the number of ways to build a ski base after the end of construction of the road number *i*. The numbers should be printed modulo 1000000009 (109<=+<=9). Sample Input 3 4 1 3 2 3 1 2 1 2 Sample Output 0 0 1 3

[ "def find(f, x):\r\n if f[x] != x:\r\n f[x] = find(f, f[x])\r\n return f[x]\r\n\r\ndef un(f, x, y):\r\n x = find(f, x)\r\n y = find(f, y)\r\n if x != y: f[x] = y\r\n \r\nMOD = 10 ** 9 + 9\r\nn, m = map(int, input().split())\r\nf = list(range(n + 1))\r\nans = 1\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n if find(f, x) != find(f, y):\r\n un(f, x, y)\r\n else:\r\n ans = (ans * 2) % MOD\r\n print(ans - 1)# 1697805927.0401692", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef getp(a):\r\n\tif P[a] == a:\r\n\t\treturn a\r\n\tP[a] = getp(P[a])\r\n\treturn P[a]\r\n\r\ndef solve():\r\n\tglobal P\r\n\tn, m = map(int, input().split())\r\n\tP = list(range(n+1))\r\n\tMOD = int(1e9+9)\r\n\tr = 0\r\n\tfor i in range(m):\r\n\t\ta, b = map(int, input().split())\r\n\t\ta = getp(a)\r\n\t\tb = getp(b)\r\n\t\tif a == b:\r\n\t\t\tr += 1\r\n\t\telse:\r\n\t\t\tP[a] = b\r\n\t\tprint((pow(2, r, MOD)-1) % MOD)\r\n\r\nsolve()\r\n" ]

{"inputs": ["3 4\n1 3\n2 3\n1 2\n1 2", "15 29\n6 11\n14 3\n10 4\n14 7\n6 14\n7 15\n13 8\n10 13\n4 14\n15 8\n12 7\n3 5\n6 7\n8 1\n4 5\n11 5\n10 6\n11 3\n13 14\n7 10\n3 12\n7 14\n8 11\n7 15\n15 8\n12 7\n4 3\n9 4\n8 10", "34 27\n19 10\n8 31\n26 22\n2 30\n32 26\n30 4\n34 1\n2 31\n4 18\n33 11\n10 13\n20 23\n4 32\n23 27\n30 7\n10 17\n29 9\n18 10\n2 28\n3 12\n31 8\n3 25\n5 22\n3 16\n21 1\n10 30\n5 3", "29 27\n22 8\n6 2\n3 5\n23 29\n27 23\n18 23\n28 23\n23 12\n24 15\n13 6\n1 13\n9 7\n17 6\n4 16\n20 28\n23 3\n3 19\n16 23\n10 21\n15 2\n21 28\n3 9\n8 18\n10 28\n19 18\n17 18\n13 7", "27 28\n20 14\n21 5\n11 17\n14 9\n17 13\n7 19\n24 27\n16 9\n5 1\n2 12\n9 2\n15 7\n13 6\n15 17\n25 17\n2 3\n1 15\n12 25\n10 6\n1 8\n1 6\n5 24\n3 15\n12 7\n2 12\n16 15\n8 22\n8 18", "20 29\n8 13\n19 18\n5 20\n5 10\n14 11\n20 8\n12 11\n13 20\n18 10\n3 9\n7 18\n19 13\n2 6\n20 19\n9 3\n6 10\n14 18\n16 12\n17 20\n1 15\n14 12\n13 5\n11 4\n2 16\n3 1\n11 4\n17 5\n5 8\n18 12", "28 25\n17 28\n21 3\n4 7\n17 18\n13 12\n26 20\n1 17\n10 18\n10 16\n1 4\n15 3\n27 26\n11 14\n7 9\n1 13\n14 27\n14 23\n21 27\n8 7\n16 2\n5 25\n26 18\n21 2\n4 3\n4 10", "27 29\n12 11\n21 20\n19 26\n16 24\n22 4\n1 3\n23 5\n9 1\n4 3\n21 23\n22 8\n14 6\n25 13\n7 20\n9 16\n3 20\n23 19\n17 10\n13 18\n8 14\n23 25\n25 27\n19 15\n19 15\n17 24\n12 27\n18 11\n25 5\n22 17", "2 40\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2"], "outputs": ["0\n0\n1\n3", "0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n3\n3\n7\n15\n31\n63\n127\n255\n511\n1023\n2047\n4095\n8191\n16383\n32767\n32767\n65535", "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n1\n1\n3\n3", "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n3\n3\n7", "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n3\n7\n15\n31\n31\n31", "0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n1\n3\n3\n7\n15\n15\n15\n15\n15\n15\n31\n63\n63\n127\n127\n255\n511\n1023\n2047", "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n3\n7", "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1\n1\n1\n3\n7\n15", "0\n1\n3\n7\n15\n31\n63\n127\n255\n511\n1023\n2047\n4095\n8191\n16383\n32767\n65535\n131071\n262143\n524287\n1048575\n2097151\n4194303\n8388607\n16777215\n33554431\n67108863\n134217727\n268435455\n536870911\n73741814\n147483629\n294967259\n589934519\n179869030\n359738061\n719476123\n438952238\n877904477\n755808946"]}

UNKNOWN

PYTHON3

CODEFORCES

2

916e1fdc90023043052db3e6738ca240

Chores

Luba has to do *n* chores today. *i*-th chore takes *a**i* units of time to complete. It is guaranteed that for every the condition *a**i*<=≥<=*a**i*<=-<=1 is met, so the sequence is sorted. Also Luba can work really hard on some chores. She can choose not more than *k* any chores and do each of them in *x* units of time instead of *a**i* (). Luba is very responsible, so she has to do all *n* chores, and now she wants to know the minimum time she needs to do everything. Luba cannot do two chores simultaneously. The first line contains three integers *n*,<=*k*,<=*x* (1<=≤<=*k*<=≤<=*n*<=≤<=100,<=1<=≤<=*x*<=≤<=99) — the number of chores Luba has to do, the number of chores she can do in *x* units of time, and the number *x* itself. The second line contains *n* integer numbers *a**i* (2<=≤<=*a**i*<=≤<=100) — the time Luba has to spend to do *i*-th chore. It is guaranteed that , and for each *a**i*<=≥<=*a**i*<=-<=1. Print one number — minimum time Luba needs to do all *n* chores. Sample Input 4 2 2 3 6 7 10 5 2 1 100 100 100 100 100 Sample Output 13 302

[ "if __name__ == \"__main__\":\r\n n, k, x = list(map(int, input().split()))\r\n chore_times = list(map(int, input().split()))\r\n for i in range(1, k + 1):\r\n chore_times[-i] = x\r\n print(sum(chore_times))\r\n ", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nE=sum(a)\r\nfor i in range(min(n,k)):\r\n E-=a[-i-1]-x\r\nprint(E)", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(k*x+sum(a[0:n-k]))\r\n", "n,k,x=map(int,input().split())\na=list(map(int,input().split()))\nsum=0\nfor i in range(n-k):\n\tsum=sum+a[i]\nsum=sum+k*x\nprint(sum)", "inp = lambda: map(int, input().split())\r\nn,k,x = inp()\r\na = list(inp())\r\nprint(sum(a[: -k])+k*x)", "n, k, x = input().split()\nn = int(n)\nk = int(k)\nx = int(x)\nsum = 0\na = [int(i) for i in input().split()]\nfor i in range(n-1 , -1 , -1):\n if k > 0 :\n sum += x\n k -= 1\n else:\n sum +=a[i]\nprint(sum)\n \t\t\t\t\t\t \t\t \t\t\t \t \t \t", "n = [int(x) for x in input().split()]\r\nk = [int(x) for x in input().split()]\r\nk.sort()\r\ns = 0\r\nfor i in range(0,n[0]):\r\n if(n[0]-i>n[1]):\r\n s+=k[i]\r\n else: \r\n s+=min(k[i],n[2])\r\n #print(str(n[0])+\"-\"+str(i)+\">\"+str(n[1]))\r\n #print(s)\r\nprint(s)", "b, k, x = input().split()\nb = int(b)\nx = int(x)\nk = int(k)\na = [int(i) for i in input().split()]\nsum = 0\nfor i in range(b-1, -1, -1):\n if k > 0:\n sum += x\n k -= 1\n else:\n sum += a[i]\nprint(sum)\n\t \t\t \t\t\t \t\t \t\t \t \t \t \t", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nsm = 0\r\nfor i in range(n - k):\r\n sm += a[i]\r\nprint(sm + k * x)", "n, k, x = map(int,input().split())\r\n\r\nA = list(map(int,input().split()))\r\nA.sort()\r\n\r\nfor i in range(n-k,n):\r\n A[i] = x\r\n\r\nprint(sum(A))", "def minimum_time(n, k, x, chores):\n total_time = 0\n for i in range(n):\n if i < n - k:\n total_time += chores[i]\n else:\n total_time += min(chores[i], x)\n return total_time\n\nn, k, x = map(int, input().split())\nchores = list(map(int, input().split()))\n\nresult = minimum_time(n, k, x, chores)\nprint(result)\n\n\n\n \t\t\t \t \t \t\t \t \t \t", "n, k, x = map(int, input().split())\r\na = [int(c) for c in input().split()]\r\n\r\nfor i in range(1,k+1):\r\n a[-i] = x\r\n \r\nprint(sum(a))", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nprint(sum(a[k::])+k*x)\r\n", "if __name__ == \"__main__\":\n n, k, x = input().split()\n time =[int(x) for x in input().split()]\n total_time = 0\n for i in range(int(n) - int(k)):\n total_time += time[i]\n total_time = total_time + int(k) * int(x)\n print(total_time)\n", "n, k, x = map(int, input().split())\na = list(map(int, input().split()))\nprint(x * min(k, n) + sum(a[:max(0, n - k)]))\n", "n,k,x = [int(i) for i in input().split()]\r\ndurations = [int(i) for i in input().split()]\r\nprint( str(sum(durations[:-k])+k*x))", "n,k,x = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\nprint(sum(lis[:len(lis)-k]) + (k*x))", "n,k,x=map(int,(input().split()))\r\nt=list(map(int,input().split()))\r\nres=0\r\nfor i in range(n):\r\n if i<n-k:\r\n res+=t[i]\r\n else:\r\n res+=min(t[i],x)\r\nprint(res)", "n=(input())\r\nn=n.split()\r\nk=int(n[1])\r\nx=int(n[2])\r\nn=int(n[0])\r\na=input()\r\na=(a.split())\r\nc=n-1\r\nans=0\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\nwhile(k>0):\r\n ans+=x\r\n c-=1\r\n k-=1\r\nwhile(c>=0):\r\n ans+=a[c]\r\n c-=1\r\n\r\nprint(ans)\r\n", "R = lambda: map(int,input().split())\nn,k,x = R()\na = list(R())\na.sort(reverse=True)\nans = 0\nfor i in range(n):\n if k > 0:\n ans += x\n k -= 1\n else:\n ans += a[i]\n\nprint(ans)\n\n\n\n", "n,k,x = map(int, input().split())\na = list(map(int, input().split(' ')))\ntime = sum(a[:n-k]) + k*x\nprint(time)\n\t\t \t\t\t\t\t \t \t\t \t\t \t \t \t \t", "n, k , x = map(int, input().split())\r\nar = list(map(int, input().split()))\r\n\r\nprint (k*x + sum(ar[:-k]))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k, x = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\nprint(k * x + sum(data[:-k]))", "while True:\n try:\n n,k,x = map(int,input().split())\n arr = []\n\n for i in input().split():\n arr.append(int(i))\n\n if k >= n:\n print(n * x)\n else:\n ans = int(0)\n ans += k * x\n for i in range(0,n - k):\n ans += arr[i]\n print(ans)\n except:\n break\n \t\t \t\t\t \t \t \t \t \t\t \t\t", "n,k,x=[int(x) for x in input().split(\" \")]\r\nl = [int(x) for x in input().split(\" \")]\r\nl=l[::-1]\r\nfor i in range(k): l[i]=x\r\nprint(sum(l))", "a, b, c = map(int, input().split())\nsum = b*c\n\narr = list(map(int, input().split()))\n\nfor i in range(0, len(arr) - b) :\n sum = sum + arr[i]\n\nprint(sum)", "n,k,x = [int(i) for i in input().split()]\na = [int(i) for i in input().split(\" \")]\n\nfor i in range(k):\n a[-i-1] = x\n\nprint(sum(a))", "n,k,x = input().split()\r\na = input().split()\r\nn = int(n) \r\nk = int(k) \r\nx = int(x) \r\nhelper = 0\r\nhelper_2 = 0\r\nmassiv = []\r\n\r\nfor el in a: \r\n if el != \" \":\r\n el = int(el) \r\n massiv.append(el) \r\n \r\nwhile k > 0: \r\n helper -= 1\r\n massiv[helper] = x\r\n k -= 1\r\n \r\nfor el in massiv: \r\n helper_2 += el\r\nprint(helper_2) ", "f = lambda: map(int, input().split())\r\nn, k, x = f()\r\nprint(sum(list(f())[:n - k]) + k * x)", "n, k, x = (int(i) for i in input().split(' '))\r\nlst = [int(j) for j in input().split(' ')]\r\nprint(sum(lst[:(n-k)]) + k * x)", "#http://codeforces.com/problemset/problem/873/A\r\n\r\ndef minTime(n,k,x,choreArray):\r\n choreArray.sort()\r\n chores = choreArray[:n-k] + [x]*(k)\r\n RA = 0\r\n for item in chores:\r\n RA += item\r\n return RA\r\n\r\nwhile True:\r\n try:\r\n line1 = input().split(\" \")\r\n line2 = input().split(\" \")\r\n n,k,x = int(line1[0]),int(line1[1]),int(line1[2])\r\n for i in range(len(line2)):\r\n line2[i] = int(line2[i])\r\n print(minTime(n,k,x,line2))\r\n except EOFError:\r\n break\r\n", "# A. Chores\n\nn, k, x = map(int, input().split())\na = list(map(int, input().split()))\n\nans = sum(a[:n-k])\nans += k * x\n\nprint(ans)\n", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range (n) [::-1]:\r\n if a[i]>x and k>0:\r\n a[i] = x\r\n # sum += a\r\n k-=1\r\nprint(sum(a))\r\n", "n,k,x=input().split(' ')\r\nn=int(n)\r\nk=int(k)\r\nx=int(x)\r\nb=list(input().split(' '))\r\nb=[int(i) for i in b]\r\nfor i in range(1,k+1):\r\n b[-i]=x\r\nprint(sum(b))\r\n", "# -*- coding: utf-8 -*-\r\nn,k,x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nprint(sum(l[:-k])+k*x)\r\n", "n = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nfor i in range(1, n[1] + 1):\r\n a[-i] = n[2]\r\nprint(sum(a))\r\n ", "n, k, x = input().split()\r\na = input().split()\r\nn = int(n) \r\nk = int(k) \r\nx = int(x)\r\n\r\ntimes = []\r\n\r\nfor el in a: \r\n el = int(el) \r\n times.append(el)\r\n\r\ndef count_total_time(times, k, n, x):\r\n if k > n: \r\n return n * x\r\n\r\n total_time = 0\r\n for time in times[:len(times) - k]:\r\n total_time += time\r\n\r\n return total_time + k * x\r\n\r\nanswer = count_total_time(times, k, n, x)\r\n\r\nprint(answer)\r\n", "n,k,x=map(int,input().split());a=sorted(list(map(int,input().split())),reverse=True)\r\nprint(sum(a[k:])+x*k)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif len(a)<k:\r\n print(x*len(a))\r\nelse:\r\n for i in range(k):\r\n del a[-1]\r\n print(sum(a)+x*k)", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\nn,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nc=sum(a[k::])+k*x\r\nprint(c)", "read = lambda : map(int, input().split())\r\nn, k, x = read()\r\na = list(read())\r\nprint(sum(a[:n - k]) + k * x)\r\n", "n , k , x = map(int , input().split())\nl = input().split()\nfor i in range(len(l)):\n l[i]=int(l[i])\ncount = 0\nfor i in range(len(l)-k):\n count+=l[i]\nprint(count+(k*x))\n \t \t \t \t \t \t\t \t \t\t\t \t", "n, k, x = input().split(\" \")\r\nn, k, x = int(n), int(k), int(x)\r\na = input().split(\" \")\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\nsum = 0\r\nif k < len(a):\r\n for j in range(0, len(a)-k, 1):\r\n sum = sum + a[j]\r\n for j in range(-1*k, 0, 1):\r\n sum = sum + x\r\nelse:\r\n sum = len(a) * x\r\nprint(sum)", "n, k, x = [int(x) for x in input().split(' ')]\r\na = [int(x) for x in input().split(' ')]\r\na = a[:-k] + [min(a[-i], x) for i in range(1, k + 1)]\r\nprint(sum(a))", "n, k, x = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(len(a)):\n if i+1 <= n-k:\n ans += a[i]\n else:\n ans += x\n\nprint(ans)\n\t \t \t \t \t \t \t\t\t \t \t", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\na.reverse()\r\nbr=0\r\nfor i in range(n):\r\n if i+1<=k:\r\n br=br+x\r\n else:\r\n br=br+a[i]\r\nprint(br)\r\n \r\n", "n, k, x = list(map(int, input().split(' ')))\r\na = sorted(list(map(int, input().split(' '))))\r\nprint(sum(a[:n - k]) + k * x)", "inp = input().split()\r\ninp = [int(i) for i in inp]\r\nai = input().split()\r\nai = sorted([int(i) for i in ai])\r\nindex = -1\r\nfor i in range(inp[1]):\r\n\tai[index]=(inp[2])\r\n\tindex=index-1\r\nprint(sum(ai))\r\n", "# region smaller_fastio\r\nfrom sys import stdin, stdout\r\nfrom os import path\r\n\r\nif path.exists('input.txt'):\r\n # ------------------Sublime--------------------------------------#\r\n stdin = open('input.txt', 'r')\r\n stdout = open('output.txt', 'w')\r\n\r\n\r\n def I():\r\n return int(input())\r\n\r\n\r\n def In():\r\n return map(int, input().split())\r\nelse:\r\n # ------------------PYPY FAst I/o--------------------------------#\r\n def I():\r\n return int(stdin.readline())\r\n\r\n\r\n def In():\r\n return map(int, stdin.readline().split())\r\n\r\n\r\n def S():\r\n return stdin.readline().rstrip()\r\n\r\n\r\n def Sn():\r\n return stdin.readline().split(' ')\r\n\r\n\r\ndef Out(whatever):\r\n return stdout.write(whatever)\r\n\r\n\r\n# endregion\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k, x = In()\r\n arr = list(In())\r\n ans = sum(arr[:n - k]) + x * k\r\n Out(str(ans))\r\n", "line = input().split()\r\nn = int(line[0])\r\nk = int(line[1])\r\nx = int(line[2])\r\n\r\nline = input().split()\r\na = [int(i) for i in line]\r\n\r\nfor i in range(k):\r\n a[-(i+1)] = x\r\n\r\nprint(sum(a))\r\n", "n, k, s = map(int, input().split())\r\na = list(map(int, input().split())); j = len(a) - 1\r\nwhile k > 0:\r\n if k < 0:\r\n break\r\n a[j] = s\r\n j -= 1; k-=1\r\nprint(sum(a))", "n, k, x = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nres = k*x\r\nn-=k\r\nres+=sum(a[:n])\r\nprint(res)", "my_input = input()\r\nn,k,x = my_input.split()\r\nmy_chores = input()\r\nmy_list = my_chores.split()\r\nfor y in range(len(my_list)):\r\n my_list[y] = int(my_list[y])\r\nmy_list.sort(reverse=True)\r\n#print(my_list)\r\nfor i in range(int(k)):\r\n my_list[i] = int(x)\r\n#print(my_list)\r\n#for x in range(len(my_list)):\r\n # my_list[x] = int(my_list[x])\r\nprint(sum(my_list))\r\n", "n,k,x = map(int,input().split())\ne = list(map(int,input().split()))\ne.sort(reverse = True)\nq = 0\nfor i in range(0,k):\n e[i] = x\nfor i in range(0,len(e)):\n q += e[i]\nprint(q) ", "n,k,x=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\ntm=0\r\nfor i in range(0,n-k):\r\n tm+=a[i]\r\nwhile k!=0:\r\n tm+=x\r\n k-=1\r\nprint(tm)\r\n \r\n \r\n \r\n \r\n", "N , K , n = input().split()\nMyTasks = input().split()\nMinRes = 0\n\na = -1\nfor i in range(len(MyTasks)-1,len(MyTasks)-1-int(K),-1):\n MinRes += int(n)\n\nfor i in range(len(MyTasks)-int(K)):\n MinRes += int(MyTasks[i])\n\nprint(MinRes)\n \t \t\t\t\t\t\t \t\t \t\t\t \t\t\t \t", "I = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\nn, k, x = IL()\r\nA = IL()[::-1]\r\nfor i in range(k):\r\n A[i] = x\r\nprint(sum(A))", "def main():\r\n n,k,x = map(int,input().split())\r\n chores = list(map(int,input().split()))\r\n\r\n chores.reverse()\r\n ans = 0\r\n for i in range(k):\r\n ans += x\r\n chores.pop(0)\r\n\r\n ans += sum(chores)\r\n\r\n print(ans)\r\n\r\nmain()\r\n", "s=[int(n) for n in input().split()]\r\nz=[int(n) for n in input().split()]\r\nfor n in range(len(z)-s[1],s[0]):\r\n z[n]=s[2]\r\nprint(sum(z))", "n,k,x = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nprint(sum([l[i] for i in range(n-k)])+k*x)", "n,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nt=0\r\nfor i in range(n-1,-1,-1):\r\n if(k>0):\r\n t+=x\r\n k-=1\r\n else:\r\n t+=l[i]\r\nprint(t)\r\n", "\r\nn,k,x = map(int,input().split());\r\n\r\nRange=n-k;\r\nSum=0;\r\n\r\na= list(map(int,input().split()));\r\n\r\nfor i in range(Range):\r\n Sum+=a[i];\r\n'''\r\nSum=sum(a[:Range]);\r\n'''\r\nSum+=(k*x);\r\nprint (Sum);\r\n", "a,b,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint(sum(l[:a-b])+b*c)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n-k):\r\n ans+=a[i]\r\nprint(ans+k*x)\r\n", "N, K, X = map(int, input().split())\n\narr = list(map(int, input().split()))\n\nres = sum(arr[0:-K])\nres += X * K\nprint(res)\n", "n, k, x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nans = 0\r\nwhile k and arr and arr[-1] > x:\r\n arr.pop()\r\n ans += x\r\n k -= 1\r\n\r\nprint(ans + sum(arr))\r\n", "def main():\r\n\tn, k, x = list(map(int, input().split()))\r\n\ta = list(map(int, input().split()))\r\n\tif n == 1:\r\n\t\tprint(x)\r\n\telse:\r\n\t\tprint(sum(a[:-k]) + k * x)\r\n\r\nmain()", "n, k, x = map(int, input().split())\r\n*a, = map(int, input().split())\r\nh = 0\r\nwhile k > 0:\r\n k -= 1\r\n if x < a[-1]:\r\n h += 1\r\n else:\r\n a.insert(0, a[-1])\r\n del a[-1]\r\nprint(sum(a) + x * h)\r\n", "import sys\r\n\r\ndef main():\r\n n, k, x = map(int, input().split())\r\n ar = list(map(int, input().split()))\r\n print(k*x + sum(ar[:n-k]))\r\n \r\n\t\r\nif __name__ == '__main__':\r\n main() \r\n \r\n", "n,k,x=list(map(int,input().strip().split()))\r\nl=list(map(int,input().strip().split()))\r\nl.sort(reverse=True)\r\nt=l[k:]\r\np=sum(t)\r\nprint(p+k*x)\r\n", "def solve():\r\n n, k, x = map(int, input().split())\r\n numbers = list(map(int, input().split()))\r\n result = sum(numbers[:n - k]) + k * x\r\n \r\n print(result)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "n,k,x = map(int,input().split())\r\nai = list(map(int,input().split()))\r\nans = sum(ai)\r\nfor i in range(n-1,n-1-k,-1):\r\n ans -= (ai[i] - x)\r\nprint(ans)\r\n", "x,y,z=map(int,input().split())\r\nlist=[int(i) for i in input().split()]\r\nlist.sort()\r\nd=x-y\r\nn=0\r\nfor i in range(d):\r\n n+=list[i]\r\n\r\nprint(n+(y*z))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "tmp = list(map(int,input().split()))\r\nn,k,x = tmp[0],tmp[1],tmp[2]\r\na = list(map(int,input().split()))\r\nk1 = 0\r\nfor i in range(n-1,-1,-1):\r\n if k1 < k:\r\n a[i] = x\r\n k1 += 1\r\n else:\r\n break\r\nprint(sum(a))", "n,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans1=sum(l)\r\nans2=sum(l[0:n-k])+k*x\r\nprint(min(ans1,ans2))", "def solve(n, k, x, a):\n return k*x + sum(a[:-k])\n\n\ndef main():\n n, k, x = list(map(int, input().split()))\n a = list(map(int, input().split()))\n print(solve(n, k, x, a))\n\n\nmain()\n", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(len(a)):\r\n if i<len(a)-k:\r\n sum+=a[i]\r\n else:\r\n sum+=x\r\nprint(sum)", "n, k, x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\n\r\nprint(sum(arr[:-k]) + x * k)\r\n", "from bisect import bisect_right as br\r\n\r\nN, K, X = [int(c) for c in input().split()]\r\nA = [int(c) for c in input().split()]\r\n\r\nx_slower = br(A, X)\r\n\r\nans = sum(A[i] for i in range(x_slower))\r\n\r\nk = 0\r\nfor i in range(N-1, x_slower-1, -1):\r\n if k < K:\r\n ans += X\r\n k += 1\r\n else:\r\n ans += A[i]\r\n\r\nprint(ans)\r\n \r\n", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nq=0\r\nfor i in range(k):\r\n a[len(a)-q-1]=x\r\n q+=1\r\nprint(sum(a))", "#!/usr/bin/python\n\nn, k, x = list(map(int, input().strip().split(\" \")))\n\nl = list(map(float, input().strip().split(\" \")))\n\nprint(int(sum(l[0:n-k]) + x*k))\n", "x,y,z=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nprint(sum(p[0:x-y])+y*z)", "inp=lambda:map(int,input().split())\r\nn,k,x=input().split()\r\nn=int(n) \r\nk=int(k) \r\nx=int(x)\r\n\r\na=list(inp())\r\n\r\ncnt=k*x;\r\n\r\nfor i in range(n-k):\r\n cnt+=a[i]\r\n\r\nprint(cnt)\r\n\r\n\r\n\r\n\r\n\r\n", "\r\nn,k,x = [int(i) for i in input().split()]\r\n\r\na = [int(i) for i in input().split()]\r\n\r\nans = 0\r\n\r\nfor i in range(n-k):\r\n ans += a[i]\r\n\r\nans += x*k\r\n\r\nprint(ans)\r\n \r\n", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = k * x + sum(a[0:n - k])\r\nprint(s)\r\n", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\na=a[::-1]\r\nfor i in range(k):\r\n a[i]=x\r\nprint(sum(a))\r\n\r\n\r\n\r\n", "n, k , x = map(int, input().split())\r\na = k*x\r\nb = n - k\r\nc = 0\r\nli = list(map(int, input().split()))\r\nfor i in range(b):\r\n c += li[i]\r\nc += a\r\nprint(c)", "n, k, x = (int(el) for el in input().split())\r\na = [int(el) for el in input().split()]\r\n\r\nt = 0\r\nfor i in range(n - 1, n - k - 1, -1):\r\n t += a[i]\r\n \r\nif t > k * x:\r\n t = k * x\r\n \r\nfor i in range(n - k - 1, -1, -1):\r\n t += a[i]\r\n \r\nprint(t)", "n, k, x= map(int,input().split(' '))\r\nchores = list(map(int,input().split(' ')))\r\nprint(k*x+ sum(chores[0:n-k]))", "n,k,x=map(int,input().split())\r\nnums=list(map(int,input().split()))\r\nfor i in range(k):\r\n nums[n-i-1]=x\r\nprint(sum(nums))", "n = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nsum = 0\r\nfor i in range(n[1]):\r\n sum += n[2]\r\nfor i in a[:-n[1]]:\r\n sum += i\r\nprint(sum)", "import sys\r\n\r\ndef get_inputs():\r\n data = []\r\n for line in sys.stdin:\r\n data.append([int(i) for i in line.split()])\r\n\r\n return data[0][0], data[0][1], data[0][2], data[1]\r\n\r\nn, k, x, a = get_inputs()\r\n\r\nfor i in range(k):\r\n a[-(i+1)] = x\r\n\r\nprint(sum(a))\r\n", "n,c,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n-c):\r\n\tz=min(l)\r\n\ts+=z\r\n\tl.remove(z)\r\nprint(s+t*c)", "n,k,x = map(int,input().split())\r\nli = [*map(int,input().split())]\r\nprint(sum(li[0:n-k])+k*x)", "n,k,x = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n-k): ans += a[i]\r\nans += k*x\r\nprint(ans)", "n , k , x = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 0\r\n\r\ni = n - 1\r\nwhile k > 0 :\r\n ans += x\r\n l.remove(l[i])\r\n k -=1\r\n i-=1\r\n\r\nprint(ans + sum(l))", "class Work:\r\n def __init__(self, usedTime: int, _id: int):\r\n self.usedTime = usedTime\r\n self.id = _id\r\n\r\n def __lt__(self, other):\r\n if type(other) != Work:\r\n return\r\n return self.usedTime < other.usedTime\r\n\r\n\r\ndef main() -> None:\r\n n, k, x = map(int, str(input()).split())\r\n _3longestWorks = []\r\n a = list(map(int, str(input()).split()))\r\n for i in range(n):\r\n if len(_3longestWorks) < k or _3longestWorks[0].usedTime < a[i]:\r\n _3longestWorks.append(Work(a[i], i))\r\n _3longestWorks.sort()\r\n if len(_3longestWorks) > k:\r\n del _3longestWorks[0]\r\n for longestWork in _3longestWorks:\r\n a[longestWork.id] = x\r\n result = 0\r\n for time in a:\r\n result += time\r\n print(result)\r\n\r\n\r\nmain()\r\n", "def solution(n, a, k, x):\n min_time = 0\n for i in range(n-1, -1, -1):\n if k != 0:\n min_time += x\n k -= 1\n else:\n min_time += a[i]\n return min_time\n\n\nif __name__ == '__main__': \n n, k, x = [int(i) for i in input().split()]\n a = [int(i) for i in input().split()]\n print(solution(n,a, k, x))\n\t \t\t\t \t \t\t \t \t\t \t \t\t", "def solution(l1,l2):\r\n l2.reverse()\r\n ans=0\r\n for x in l2:\r\n if x>l1[2] and l1[1]!=0:\r\n ans+=l1[2]\r\n l1[1]-=1\r\n else:\r\n ans+=x\r\n return ans\r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n l2 = [int(x) for x in input().split()]\r\n print(solution(l1,l2))\r\nanswer()", "\r\ndef solve():\r\n n,k,x = list(map(int,input().split()))\r\n y = list(map(int,input().split()))\r\n ans = k*x \r\n for i in range(n-k):\r\n ans += y[i]\r\n print(ans)\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "#!/usr/bin/python\nimport sys\ninput = lambda: sys.stdin.readline().strip()\nn, k, x = [int(x) for x in input().split()]\na = sorted([int(x) for x in input().split()])\nans = 0\nfor ai in reversed(a):\n if ai > x and k > 0:\n ans += x\n k -= 1\n else:\n ans += ai\nprint(ans)\n", "n,k,x=map(int,input().split())\r\ns=0;\r\nlist1=list(map(int,input().split()))\r\nfor i in range(0,n-k):\r\n s=s+list1[i];\r\ns=s+k*x;\r\nprint(s)\r\n ", "f=lambda:map(int,input().split())\r\nn,k,x=f()\r\nl=list(f())\r\nprint(sum(l[:n-k])+k*x)", "n, k, x = map(int, input().split())\r\na = sorted(list(map(int, input().split())), reverse=True)\r\n\r\ncnt = 0\r\nans = 0\r\nfor i in a:\r\n if cnt < k:\r\n ans += x\r\n cnt += 1\r\n else:\r\n ans += i\r\n\r\nprint(ans)", "n,k,x=map(int,input().split())\r\na=[int(b) for b in input().split()]\r\nfor i in range(k):\r\n a.pop()\r\nfor i in range(k):\r\n a.append(x)\r\nprint(sum(a))", "n, k, x = [int(x) for x in input().split()]\r\nnums = [int(x) for x in input().split()]\r\n\r\npartial_sum = 0\r\nfor i in range(n - k):\r\n partial_sum += nums[i]\r\n\r\nprint(partial_sum + k * x)\r\n", "n,k,x = map(int,input().split())\r\nl = sum([*map(int,input().split())][:n-k])\r\nprint(l+k*x)", "n,k,x = map(int, input().split())\r\ntime = list(map(int, input().split()))\r\nsum = 0\r\nfor i in range(n-k):\r\n sum = time[i] + sum\r\n\r\ntotal = sum + k*x\r\nprint(total)", "a,b,c = map(int,input().split())\r\na1 = list(map(int,input().split()))\r\nprint(sum(a1[0:a-b])+b*c)", "n,k,x = list(map(int,input().split()))\r\nt = list(map(int,input().split()))\r\n\r\ne = k*x\r\nd = sum(t[:n-k])\r\n\r\nprint(e+d)", "n, k, x = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nresult=k*x\r\nfor i in range(n-k):\r\n\tresult+=a[i]\r\nprint(result)", "n,k,x=[int(x) for x in input().split()]\r\narr1=[int(y) for y in input().split()] \r\nsum1=0\r\nfor i in range(len(arr1)-k):\r\n sum1=sum1+arr1[i]\r\nsum1=sum1+(k*x) \r\nprint(sum1)", "n, k, x = [int(i) for i in input().split()]\r\ns = [int(i) for i in input().split()]\r\nc = 0\r\nfor i in range(n-k):\r\n c += s[i]\r\nc += k*x\r\nprint(c)", "n, k, x = map(int, input().split())\ntempo = list(map(int, input().split()))\ntempo.sort()\nsoma = sum(tempo[:n-k])\nans = k*x + soma\n\nprint(ans)\n", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = sum(a[:-k])\r\nprint(d + (k * x))\r\n# CodeForcesian\r\n# ♥\r\n# اگه میتونی تصور کنی پس حتما میتونی انجامش بدی\r\n", "n,k,x = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 0\r\nans+=sum(l[:len(l)-k])\r\nans+=k*x\r\nprint(ans)", "def inp(s,i):\r\n k = 0\r\n it = ''\r\n s = ' ' + s\r\n for j in s:\r\n if j == ' ':\r\n k += 1\r\n if (k == i) and not(j == ' '):\r\n it += j\r\n return it\r\ns = input()\r\nn = int(inp(s,1))\r\nk = int(inp(s,2))\r\nx = int(inp(s,3))\r\ns = input()\r\na = list()\r\nfor q in range(n):\r\n p = int(inp(s,q+1))\r\n a.append(p)\r\nm = 101\r\nt = 0\r\na.sort()\r\na.reverse()\r\nc = 0\r\nfor i in a:\r\n c+=1\r\n if c <= k:\r\n t += x\r\n else:\r\n t += i\r\nprint(t)\r\n", "n, k, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nprint(sum(l[:n - k]) + (k * x))", "n, k, x = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nans = 0\r\n\r\na.sort(reverse = True)\r\n\r\nfor i in a:\r\n if k > 0 and i > x:\r\n k -= 1\r\n ans += x\r\n else:\r\n ans += i\r\nprint(ans)\r\n", "\r\nn,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nsu=0\r\nfor i in range(n-k):\r\n\tsu+=l[i]\r\n\r\nprint(su+k*x)", "read=lambda : map(int,input().split())\r\nn,k,x=read()\r\na=list(read())\r\na.reverse()\r\nans=0\r\nfor i in range(n):\r\n if k>0 and a[i]>x:\r\n ans+=x\r\n k-=1\r\n else:\r\n ans+=a[i]\r\nprint(ans)\r\n\r\n\r\n", "n,k,x=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nans=0\r\nfor el in arr[::-1]:\r\n if el>x and k:\r\n ans+=x\r\n k-=1\r\n else :\r\n ans+=el\r\nprint(ans)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=a[::-1]\r\nb=b[:k]\r\nif(b[-1]<=x):\r\n print(sum(a))\r\nelse:\r\n c=a[:n-k]\r\n print(sum(c)+(k*x))\r\n", "n,k,x=list(map(int,input().split()))\r\n\r\n\r\nt=list(map(int,input().split()))\r\n\r\n\r\nprint(sum(t[:-k])+k*x)\r\n", "n,k,x=map(int,input().split())\r\na=list(sorted(map(int,input().split())))\r\nprint(sum(a[:(n-k)])+k*x)\r\n", "n, k, x = [int(i) for i in input().split(\" \")]\na = [int(i) for i in input().split(\" \")]\nprint(sum(a[:n-k])+k*x)", "n, k, x = map(int,input().split())\r\narr = list(map(int, input().split()))\r\nans = k * x\r\nfor i in range(n-k):\r\n ans += arr[i]\r\nprint(ans)", "n, k, x = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nprint(sum(w[:n-k])+ k*x)", "n,k,x=map(int,input().split())\ns=list(map(int,input().split()))\nif(k>n):\n print(sum(s[i] for i in range(0,n)))\nelse:\n print(min(sum(s[i] for i in range(0,n)),sum(s[i] for i in range(n-k))+k*x))\n\t\t\t\t\t\t \t \t \t \t \t \t\t \t\t \t\t\t\t", "n,k,x = map(int,input().split())\r\nai = [int(i) for i in input().split()]\r\nfor i in range(k):\r\n\tai[-i-1] = x\r\nprint(sum(ai))\r\n", "n,k,x=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nl=[]\r\nsum=0\r\nfor i in range(0,len(a)):\r\n if(a[i]<=x):\r\n sum=sum+a[i]\r\n else:\r\n l.append(a[i])\r\nl=sorted(l,reverse=True)\r\nfor i in range(0,len(l)):\r\n if(k>0):\r\n k=k-1\r\n sum=sum+x\r\n else:\r\n sum=sum+l[i]\r\nprint(sum)", "import sys\r\n\r\ndef main():\r\n n, k, x, *l = map(int, sys.stdin.read().strip().split())\r\n return sum(l[:-k]) + k*x\r\n \r\nprint(main())\r\n", "n,x,y=list(map(int,input().rstrip().split()))\r\nk=list(map(int,input().rstrip().split()))\r\nsum=0\r\nfor i in range(n-x):\r\n sum=sum+k[i]\r\nsum=sum+x*y\r\nprint(sum)", "n,k,x=map(int,input().split())\r\nr=[*map(int,input().split())]\r\nprint(sum(r[:n-k])+k*x)", "N,K,X = map(int,input().split())\r\nlst = sorted([int(i) for i in input().split()])\r\n\r\nfor i in range(1,K+1):\r\n lst[-i] = X\r\nprint(sum(lst))", "def main():\r\n n, k, x = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n res = sum(a[:-k]) + k*x\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,k,x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in range(n-k, n):\r\n a[i] = min(a[i], x)\r\nprint(sum(a))", "n, k, x = map(int, input().strip().split())\r\na = list(map(int, input().strip().split()))\r\n\r\nresult = sum(a[:len(a) - k])\r\nresult += sum(b if b < x else x for b in a[:k])\r\n\r\nprint(result)\r\n", "n, k, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(-1, (-1*n)-1, -1):\r\n if k != 0:\r\n ans += x\r\n k -= 1\r\n else:\r\n ans += l[i]\r\n\r\nprint(ans)", "n, k, x=map(int, input().split())\r\n\r\na=list(map(int, input().split()))\r\n\r\nfor i in range(n-1, n-k-1, -1):\r\n\ta[i]=x\r\n\r\nprint(sum(a))", "n,k,x=map(int,input().split())\na=map(int,input().split())\np=list(a)\nS=0\n\nfor s in range(0,k):\n g=max(p)\n #print(g)\n p.remove(g)\n S=S+x\n\nfor j in p:\n S=S+j\nprint(S)\n \n \n\n\n\t\t \t \t\t \t \t \t\t\t\t \t \t", "n,k,x=list(map(int,input().split()))\r\nnumbers=list(map(int,input().split()))\r\ns=0\r\ns+=k*x\r\nfor i in range(len(numbers)-k):\r\n s+=numbers[i]\r\nprint(s)", "n, k, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n - k):\r\n s += l[i]\r\ns += k * x\r\nprint(s)", "n, k, x = input().split()\nn = int(n)\nk = int(k)\nx = int(x)\na = [int(i) for i in input().split()]\nsum = 0\nfor i in range(n-1 , -1 , -1):\n if a[i] > x and k > 0:\n sum += x\n k -= 1\n else:\n sum += a[i]\nprint(sum)\n \t\t \t \t \t\t\t \t\t\t \t \t \t\t \t\t\t", "n,k,x=input().split()\nn=int(n)\nk=int(k)\nx=int(x)\nsum=0\na=[int(i) for i in input().split()]\nfor i in range(n-1,-1,-1):\n if k>0:\n sum+=x\n k-=1\n else:\n sum+=a[i]\nprint(sum)\n\t\t \t\t \t\t \t\t \t\t \t\t \t\t", "n, k, x =input().split()\nn =int(n)\nk =int(k)\nx =int(x)\nsum = 0\na = [int(i)for i in input().split()]\nfor i in range(n-1, -1, -1):\n if k > 0 :\n sum += x \n k-= 1\n else:\n sum +=a[i]\nprint(sum)\n\t \t\t\t \t\t\t\t \t\t\t \t \t \t \t", "n, k, x = list(map(int, input().split()))\na = list(map(int, input().split()))\n\nfor i in range(len(a) - 1, len(a) - 1 - k, -1):\n a[i] = x\n\nprint(sum(a))\n", "n, k, x = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nprint(sum(a[:n - k]) + x * k)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Apr 26 14:10:38 2020\nhttps://codeforces.com/contest/873/problem/A\n\n@author: neb0123\n\"\"\"\n\ndef answer(chores,n,k,x):\n total = 0\n for _ in range(n-k):\n total += next(chores)\n for _ in range(k):\n total += x\n return total\n\nif __name__ == \"__main__\": \n n, k, x = map(int, input().split(' '))\n chores = map(int, input().split(' '))\n\n print(answer(chores,n,k,x))", "n,k,x = map(int,input().split())\r\na = sorted(list(map(int,input().split())))\r\nn -= k\r\ns = sum(a[0:n])+ (k*x)\r\nprint(s)", "n,k,x=map(int,input().split())\narr=list(map(int,input().split()))\ncount=n-k-1\nsum=0\nwhile count>-1:\n sum+=arr[count]\n count-=1\n\nfor i in range(n-k,len(arr)):\n sum += x\nprint(sum)", "n, k, x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\n\r\ni = n - 1\r\nwhile i > -1 and a[i] > x and k > 0:\r\n k -= 1\r\n s -= a[i]\r\n s += x\r\n i -= 1\r\n\r\nprint(s)\r\n", "n, k, x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(k):\r\n\tif a[n - 1 - i] > x:\r\n\t\ta[n - 1 - i] = x\r\n\telse:\r\n\t\tbreak\r\n\r\nprint(sum(a))", "n, k, x = map(int, input().split())\r\n\r\narr = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n if k:\r\n ans += x\r\n k -= 1\r\n else:\r\n ans += arr[i]\r\nprint(ans)", "score = 0\r\nn, k, x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(k):\r\n a.append(x)\r\n\r\na.sort()\r\n\r\nfor j in range(n):\r\n score += a[j]\r\n\r\nprint(score)", "n, k, x = map(int, input().split())\r\nline = list(map(int, input().split()))\r\nsm = 0\r\nfor i in range(n - k):\r\n sm += line[i]\r\nfor i in range(n - k, n):\r\n sm += min(line[i], x)\r\nprint(sm)", "baris = input()\r\nstring = baris.split(' ')\r\nn = int(string[0])\r\nk = int(string[1])\r\nx = int(string[2])\r\n\r\nbaris = input()\r\nstring = baris.split(' ')\r\n\r\nangkaSekarang = []\r\nfor i in range(0, n):\r\n angkaSekarang.append(int(string[i]))\r\n\r\nangkaSekarang.sort()\r\n\r\nhasil = 0\r\nfor i in range(0, n-k):\r\n hasil = hasil + angkaSekarang[i]\r\nfor i in range(0, k):\r\n hasil = hasil + x\r\n\r\nprint(hasil)", "n,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n-k):\r\n c+=l[i]\r\nprint(c+k*x)\r\n", "a = tuple(map(int, input().split()))\r\nb = tuple(map(int, input().split()))\r\nprint(sum(b[:a[0] - a[1]]) + a[1] * a[2])", "n, k, x = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\nfor i in range(n - k, n):\n a[i] = min(a[i], x)\nres = sum(a)\nprint(res)\n", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[n, k, x] = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\na.sort(reverse=True)\r\nres = 0\r\nfor i in range(n):\r\n if i < k:\r\n res += x\r\n else:\r\n res += a[i]\r\nprint(res)\r\n", "n, k, x = tuple(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(k):\r\n a[-(i+1)] = x\r\n\r\nprint(sum(a))\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,bisect\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nn,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint(sum(l[:n-k])+k*x)\r\n", "n,k,x=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\ns=0\r\nfor i in range(0,n-k):\r\n\ts+=lst[i]\r\ns+=x*(k)\r\nprint(s)\r\n\r\n\r\n\r\n\r\n\r\n", "nkx = [int(i) for i in input().split(' ')]\r\nai = [int(i) for i in input().split(' ')]\r\nk = nkx[1]\r\nx = nkx[2]\r\nai = ai[:-k] + [x]*k\r\nprint(sum(ai))\r\n", "(n, k, x) = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\n\nfor i in range(k):\n a[~i] = x\n\nprint(sum(a))", "n, k, x = input().split()\nn = int(n)\nk = int(k)\nx = int(x)\nchores = [int(c) for c in input().split()]\n\ntime = 0\nfor i in range(n - k):\n time += chores[i]\n\ntime += k*x\n\nprint(time)\n", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nprint(sum(a[:n-k])+k*x)", "read = lambda: tuple(map(int, input().split()))\nn, k, x = read()\nl = list(read())\nfor i in range(k):\n l[-i-1] = x\n \nprint(sum(l))\n", "n, k, x = map(int, input().split())\r\ntime_list = list(map(int, input().split()))\r\n\r\nfor i in range(k):\r\n time_list.pop()\r\ntime_list.extend([x] * k)\r\n\r\ntotal_time = sum(time_list)\r\n\r\nprint(total_time)\r\n\r\n", "bb=input().split()\r\nn1=int(bb[0])\r\nn2=int(bb[1])\r\nn3=int(bb[2])\r\nnu=input().split()\r\nv=0\r\nfor r in range (n1-n2):\r\n v=v+int(nu[r])\r\nv=v+n2*n3\r\nprint(v)", "\r\nn, k, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nfor i in range(1, k + 1):\r\n\tl[-i] = x\r\n\r\nprint(sum(l))", "n,k,x=map(int,input().split())\r\n\r\nl=[int(x) for x in input().split()]\r\nprint(sum(l[:-k])+x*k)\r\n", "\r\n\r\n\r\ndef main_function():\r\n n, k, x = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n time = 0\r\n for i in range(len(a)):\r\n if i >=len(a) - k:\r\n time += x\r\n else:\r\n time += a[i]\r\n return time\r\n\r\n\r\n\r\n\r\nprint(main_function())\r\n", "# http://codeforces.com/contest/873/problem/A\n\nn, k, x = [int(x) for x in input().split()]\nt = [int(x) for x in input().split()]\n\nL = len(t)\nkk = min(L, k)\nres = sum(t[:L-kk]) + kk * x\nprint(res)\n", "n, k, x = map(int, input().split())\nk = min(k, n)\nprint(sum([int(s) for s in input().split()][:-k]) + k * x)", "(num_chores, num_x_chores, x) = [int(string) for string in input().split()]\nchore_times = [int(string) for string in input().split()]\n\ntotal = 0\nfor chore in reversed(chore_times):\n if chore > x and num_x_chores > 0:\n total += x\n num_x_chores -= 1\n else:\n total += chore\n\nprint(total)\n", "n, k, x = [int(k) for k in input().split()]\r\ntime_na_deli = [int(k) for k in input().split()]\r\ntime_na = 0\r\nfor deli in range(n):\r\n ost_vremya = n - deli\r\n if ost_vremya <= k and x < time_na_deli[deli]:\r\n time_na += x\r\n else:\r\n time_na += time_na_deli[deli]\r\nprint(time_na)", "line = list(map(int, input().split()))\r\nn, k, x = line[0], line[1], line[2]\r\na = list(map(int, input().split()))\r\n\r\nres = 0\r\nfor i in range(n):\r\n if i < n-k:\r\n res += a[i]\r\n else:\r\n res += x\r\n\r\nprint(res)", "input1 = input(\"\").split(\" \")\nchores = [int(num) for num in input(\"\").split(\" \")]\n\nnumChores = int(input1[0])\nnumWorkHard = int(input1[1])\nworkHardTime = int(input1[2])\n\nfor i in range(len(chores),0,-1):\n if numWorkHard > 0:\n chores[i-1] = workHardTime\n numWorkHard -= 1\n else:\n i = 0\n\nprint(sum(chores))\n", "n,k,x=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nif n==1:\r\n print(x)\r\nelif n==k:\r\n print(x*k)\r\nelse:\r\n L=sorted(L)\r\n for i in range(k):\r\n L.pop(len(L)-1)\r\n s=x*k\r\n for i in range(len(L)):\r\n s+=L[i]\r\n print(s)\r\n \r\n", "n, k, x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n-1, -1, -1):\r\n if k > 0 and a[i] > x:\r\n k -=1\r\n ans += x\r\n else:\r\n ans += a[i]\r\nprint(ans)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=sum(a[0:n-k])+k*x\r\nprint(s)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif k<=n:\r\n\tsu=k*x\r\nelse:\r\n\tsu=n*x\t\r\nsu+=sum(a[:-k])\r\nprint(su)", "n,k,x=map(int,input().split())\r\nls=list(map(int,input().split()))\r\nfor m in range(1,k+1):\r\n ls[-m]=x\r\nprint(sum(ls))\r\n ", "R=lambda:list(map(int,input().split()))\nn,k,x=R()\na=list(reversed(R()))\nprint(sum(x if i < k else a[i] for i in range(n))) \n", "n,k,x=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nl=l[::-1]\r\nmini=sum(l)\r\nloss= k*x \r\ngain=sum(l[:k])\r\nmini=min(mini,mini-gain+loss)\r\nprint(mini)", "n, k, x = map(int, input().split())\r\ndata = list(map(int, input().split()))[::-1]\r\n\r\nprint(sum(min(v, x) if index < k else v for index, v in enumerate(data)))\r\n", "X = list(map(int, input().split()))\r\nY = list(map(int, input().split()))\r\nprint(sum(Y[:-X[1]]) + (X[1] * X[2]))", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n-k):\r\n s+=a[i]\r\ns+=k*x\r\nprint(s)", "n, k, x = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n - k):\r\n temp = lst[i]\r\n ans += temp\r\nfor j in range(k):\r\n ans += x\r\nprint(ans)", "a,b,d = input().split()\r\n\r\nc= list(map(int, input().split()))\r\n\r\nc.sort()\r\nr=0\r\nwhile r<int(b):\r\n c.pop()\r\n r=r+1\r\n\r\nprint(sum(c)+ int(b)*int(d) )", "if __name__ == '__main__':\r\n\tarr = list(map(int, input().split()))\r\n\ta = list(map(int, input().split()))\r\n\tansw = arr[1]*arr[2]\r\n\tfor i in range(arr[0] - arr[1]):\t\t\r\n\t\tansw = answ + a[i]\r\n\tprint(answ)\r\n", "inp = lambda: map(int, input().split())\r\nn, k, x = inp()\r\n\r\nlst = [*inp()]\r\nlst.reverse()\r\n\r\nres = 0\r\n\r\nfor case in lst:\r\n if case > x and k != 0:\r\n res += x\r\n k -= 1\r\n else:\r\n res += case\r\n\r\nprint(res)\r\n", "input1=input()\ninput1=input1.split(' ')\nn=int(input1[0])\nk=int(input1[1])\nx=int(input1[2])\n\n\ntimes=input()\ntimes=times.split(' ')\ntimes=[int(x) for x in times]\n\n\ntotal=k*x+sum(times[0:n-k])\nprint(total)\n\t\t\t\t\t \t \t\t \t \t \t\t \t\t\t\t", "n, k, x = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na.sort(reverse = True)\r\nt = len(a[:k]) * x\r\nt += sum(a[k:])\r\nprint(t)", "n,k,x = map(int,input().split())\na = list(map(int,input().split()))\nprint(sum(a[:n-k]) + k*x)\n", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nres = 0\r\nfor i in range(n - k):\r\n\tres += a[i]\r\nprint(res+ k * x)\r\n", "# LUOGU_RID: 135590492\nn, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n# 首先计算不使用特殊努力的情况下，完成所有家务所需的时间\r\ntotal_time = sum(a)\r\n# 1\r\n# 如果可以使用特殊努力，则选择耗时最长的k个家务进行努力，并将其耗时替换为x\r\nif k > 0:\r\n # 找到耗时最长的k个家务\r\n max_a = sorted(a)[-k:]\r\n # 计算使用特殊努力后的总时间\r\n special_time = total_time - sum(max_a) + k * x\r\n # 取两种情况中的较小值作为最终结果\r\n result = min(total_time, special_time)\r\nelse:\r\n result = total_time\r\n\r\nprint(result)\r\n#2", "i=lambda:map(int,input().split())\r\nn,k,x=i()\r\na=sorted(i())[::-1]\r\nprint(k*x+sum(a[k:]))", "n,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\nprint(sum(l[:-k])+k*x)", "x,y,z= map(int, input().split(' '))\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nind = -1\r\nfor i in range(0,y):\r\n del arr[ind]\r\nres = sum(arr) + y*z\r\nprint(res)", "n,k,x = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\naa=sum(lis[:n-k])+(x*k)\r\nprint(aa)", "n,k,x=map(int,input().split())\nch=list(map(int,input().split()))\nwhile k>0:\n ch.pop()\n ch.insert(0,x)\n k-=1\nc=0\nfor el in ch:\n c+=el \nprint(c)\n \t\t \t\t\t\t\t\t\t \t \t \t \t\t\t\t \t\t \t", "n,k,x=map(int,input().split())\r\nl=list(map(int, input().split()))\r\nl.reverse()\r\nfor i in range(k):\r\n l[i]=x\r\nprint(sum(l))\r\n\r\n", "n,k,m=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nprint(k*m+sum(a[:n-k]))\r\n", "n,k,x = map(int,input().split())\r\ncosts = list(map(int, input().split()))\r\nfor i in range(k):\r\n costs[n-1-i] = x\r\nprint(sum(costs))", "R=lambda:map(int,input().split())\r\nn,k,x=R()\r\na=list(R())\r\nprint(sum(a[:n-k])+k*x)\r\n\r\n", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in range(k):\r\n if max(a) >= x:\r\n a.remove(max(a))\r\n a.append(x)\r\nprint(sum(a))\r\n", "n,k,x=map(int,input().split())\r\n\r\nA=list(map(int,input().split()))\r\n\r\nx = sum(A[:-k]) + x * k\r\nprint(x)", "read=lambda : map(int,input().split())\r\nn,k,x=read()\r\na=list(read())\r\nprint(sum(a[:n-k])+k*x)", "import io,os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nn, k, x = map(int, input().split())\r\nl = [int(x) for x in input().split()]\r\nans=0\r\nfor i in range(n-k):\r\n ans+=l[i]\r\n\r\nfor i in range(k):\r\n ans+=x\r\n\r\nprint(ans)", "n , k , x = map(int , input().split())\r\nl = input().split()\r\nfor i in range(len(l)):\r\n l[i]=int(l[i])\r\ncount = 0\r\nfor i in range(len(l)-k):\r\n count+=l[i]\r\nprint(count+(k*x))", "n,k,x=map(int,input().split())\r\nprint(sum(list(map(int,input().split()))[:n-k])+k*x)\r\n", "n,k,x = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\nprint(sum(a[:len(a)-k])+k*x)\r\n", "n,k,x=map(int,input().split())\r\na=[int(c) for c in input().split()]\r\n\r\nfor i in range(k):\r\n if max(a)>=x:\r\n a.remove(max(a))\r\n a.append(x)\r\nres=0\r\nfor i in a:\r\n res+=i\r\nprint(res)\r\n\r\n\r\n \r\n\r\n", "n,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)-sum(l[-k:])\r\nprint(s+(k*x))", "n,k,t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nans = 0\r\nfor i in range(n-k):\r\n ans += l[i]\r\nprint(ans+k*t)", "\r\nn , k , x = map(int , input().split())\r\n\r\ny = [int(y) for y in input().split()]\r\n\r\nprint(sum(y[:len(y) - k]) + k * x)", "b = list(map(int, input().split()))[:3]\r\na = list(map(int, input().split()))[:b[0]]\r\ns = 0\r\nfor i in range(0, b[0]-b[1]):\r\n s += a[i]\r\n \r\ns += b[1]*b[2]\r\nprint(s)\r\n", "n, special, t = map(int, input().split())\r\nchores = sorted(list(map(int, input().split())), reverse = True)\r\n\r\ntotal = 0\r\nfor ch in chores:\r\n if special > 0 and t < ch:\r\n special -= 1\r\n total += t\r\n else:\r\n total += ch\r\n\r\nprint(total)", "n,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=n-k\r\ns=0\r\nfor i in range(c):\r\n s=s+l[i]\r\nprint(s+k*x)\r\n", "n,k,x=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nd=0\r\nfor i in range(len(a)-k):\r\n d+=a[i]\r\nprint(d+k*x)\r\n \r\n", "n,k,x=[int(i) for i in input().split()]\r\nans=0\r\nl=[int(i) for i in input().split()]\r\nfor i in range(1,n+1):\r\n if (i<=n-k):\r\n ans+=l[i-1]\r\nans+=(x*k)\r\nprint(ans)", "line1 = input().split()\r\nn,k,x = int(line1[0]),int(line1[1]),int(line1[2])\r\nsuma = [int(i) for i in input().split()]\r\n\r\nprint(sum(suma[:len(suma) - k]) + x*k)\r\n", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(sum(a) + k * x - sum(a[i] for i in range(n - 1, n - k - 1, -1)))\r\n", "#873A\r\n\r\ngiven = input().split(\" \")\r\ntasks = input().split(\" \")\r\n\r\nnominal = 0\r\nfor i in range(len(tasks) - int(given[1])):\r\n nominal += int(tasks[i])\r\n\r\ntotal = nominal + int(given[1])*int(given[2])\r\n\r\nprint(total)", "n, k, x = map(int, input().split())\nl = [int(x) for x in input().split()]\nprint(sum(l[:-k]) + k * x)", "a,b,c=map(int,input().split());print(sum(map(int,input().split()[:a-b]))+b*c)", "n, k, x = map(int,input().split())\r\nmas = list(map(int,input().split()))\r\nprint(k*x + sum(mas[:-k]) )\r\n", "l = list(map(int, input().split()))\r\nn = l[0]\r\nk = l[1]\r\nx = l[2]\r\nFlag = 0\r\n\r\nscores = list(map(int, input().split()))\r\nscores = sorted(scores, reverse = True)\r\n\r\nwhile k > 0:\r\n scores[Flag] = x\r\n k -= 1\r\n Flag += 1\r\nprint(sum(scores))\r\n ", "# import sys\r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nN,K,X=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nlast=N-1\r\nwhile K:\r\n\tL[last]=X\r\n\tlast-=1\r\n\tK-=1\r\nans=0\r\nfor i in range(N):\r\n\tans+=L[i]\r\nprint(ans)\r\n\r\n", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nn,m,p=map(int,input().strip().split()[:3])\nl=list(map(int,input().strip().split()[:n]))\nk=len(l[n-m:])*p\nk1=sum(l[:n-m])\nprint(k1+k)", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))[:n]\r\ns = 0\r\nfor i in range(0, n-k):\r\n s += a[i]\r\n \r\ns += k*x\r\nprint(s)\r\n", "n,k,x = map(int, input().split())\r\nchores = list(map(int,input().split()))\r\n\r\nfor i in range(n-1,n-1-k,-1):\r\n chores[i] = x\r\nprint(sum(chores))", "n,k,x=map(int,input().split())\nchores_time=list(map(int,input().split()))\naddon=k*x\ntime_taken=0\nfor i in range(n-k):\n time_taken+=chores_time[i]\n\nprint((time_taken+addon)) \n\n\t \t \t\t\t \t\t\t \t \t \t \t\t\t\t \t", "n,k,x = map(int, input().split())\na = list(map(int, input().split()))\nprint(sum(a[:-k])+x*k)\n\n\n", "n,h,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nif h>n:\r\n\th=n\r\nprint(h*x+sum(l[h:]))", "s=input() #input string in the first line\nn,k,x=s.split()\nn=int(n)\nk=int(k)\nx=int(x)\ns=input()\nA=s.split()\nA= list(map(int, A))\nl=len(A)\nt=0 # minimum time taken\nwhile(k>0):\n t=t+x\n k=k-1\n A[l-1]=0\n l=l-1\nwhile(l>0):\n t=t+A[l-1]\n l=l-1\nprint(t)", "n, k, x = list(map(int, input().split()))\r\na = sum(int(val) for idx, val in enumerate(input().split()) if idx < n-k)\r\nprint(a + (k*x))\r\n", "import math\nn = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nsum1 = min(n[1],n[0])*n[2]\nfor i in range(0,max(0,n[0]-n[1])):\n\tsum1 += a[i]\nprint(sum1)\n\n\n", "def solve():\r\n n,a,b = list(map(int,input().split()))\r\n l = list(map(int,input().split()))\r\n l.sort(reverse = True)\r\n x = a * b\r\n for i in range (a,n):\r\n x += l[i]\r\n print(x)\r\nsolve()", "import heapq\r\n\r\nn, k, x = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nq = []\r\n\r\ns = 0\r\n\r\nfor v in a:\r\n if v > x:\r\n heapq.heappush(q, v)\r\n if len(q) > k:\r\n s += heapq.heappop(q)\r\n else:\r\n s += v\r\n\r\nprint(s + len(q) * x)", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/12 22:08\r\n\r\n\"\"\"\r\n\r\n\r\nn, k, x = map(int, input().split())\r\n\r\nts = [int(x) for x in input().split()]\r\n\r\nfor i in range(n-1, n-k-1, -1):\r\n ts[i] = min(ts[i], x)\r\n\r\nprint(sum(ts))", "n,k,x=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nx1=0\r\nfor z in range(n-k):\r\n x1+=a[z]\r\nx2=k*x\r\nprint(x1+x2)", "n, k, x = map(int, input().split());\r\na = list(map(int, input().split()));\r\n\r\na.sort(reverse = True);\r\n\r\nkq = k * x;\r\nfor i in range(k, n):\r\n kq += a[i];\r\nprint(kq);", "n, k, x = map(int, input().split())\r\ndela = [int(x) for x in input().split()]\r\nanswer = sum(dela[:-k]) + k*x\r\nprint(answer)", "def dela(lst, k, x):\r\n result = x * k\r\n for i in range(len(lst) - k):\r\n result += lst[i]\r\n return result\r\n\r\n\r\nN, K, X = [int(j) for j in input().split()]\r\na = [int(z) for z in input().split()]\r\nprint(dela(a, K, X))\r\n", "def main():\n [n, k, x] = [int(_) for _ in input().split()]\n\n t = [int(_) for _ in input().split()]\n t = t[::-1]\n\n for i in range(k):\n t[i] = x\n\n print(sum(t))\n\n\nif __name__ == '__main__':\n main()\n", "n,k,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.reverse()\r\nsum1=0\r\nfor i in range(k):\r\n\tl[i]=x\r\nfor i in l:\r\n\tsum1+=i\r\nprint(sum1)", "n,k,x=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nprint(sum(a)+k*x-sum(a[n-k:]))", "n, k, x = map(int, input().split())\r\ntimes = list(map(int, input().split()))\r\nfor i in range(n - 1, n - k - 1, -1):\r\n times[i] = x\r\nprint(sum(times))\r\n", "from collections import deque\r\nn, k, x = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\ndeq = deque(lst)\r\nres = 0\r\nfor _ in range(k):\r\n res += min(x, deq.pop())\r\nprint(res + sum(deq))", "b=list(map(int,input().split()))\na=list(map(int,input().split()))\nfor i in range(len(a)-1,len(a)-b[1]-1,-1):a[i]=b[2]\nprint(sum(a))\n", "n,k,x=map(int, input().split())\r\nl=list(map(int, input().split()))\r\ns=sum(l[0:n-k])+k*x\r\nprint(s)", "n,k,x = [int(x) for x in input().split()]\r\nchores= [int(x) for x in input().split()]\r\ntimes = sum(chores[:n-k]) + (k * x)\r\nprint(times)\r\n", "n,k,x = map(int,input().split())\r\na = list(map(int,input().split()))\r\na= sorted(a); a = a[::-1]\r\nfor i in range(k):\r\n a[i] = x;\r\nprint(sum(a))", "n,k,x=map(int, input().split())\r\na=list(map(int, input().split()))\r\nprint(sum(a[0:n-k])+k*x)\r\n", "n, k, x = map(int,input().split()) \nl= list(map(int, input().split()))\nsum1=0\nfor i in range (n) :\n if (k==0) :\n sum1+=l[-i-1]\n else :\n sum1=sum1+x\n k-=1\nprint(sum1)\n \t\t\t\t\t \t\t \t \t \t\t \t\t\t \t", "def numline(f = int):\r\n return map(f, input().split())\r\n \r\nn, k, x = numline()\r\na = [i for i in numline()]\r\n \r\nprint(sum(a[:len(a) - k]) + k * x)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=k*x\r\nprint(ans+sum(a[:n-k]))", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nprint(sum(a[0:n-k])+x*k)", "n, k, x = map(int, input().split())\r\nl = sorted([int(i) for i in input().split()])[::-1]\r\n\r\nlst = l[k:]\r\n\r\nprint(sum(lst) + k*x)\r\n\r\n", "n, k, x = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nfor i in range(1, k + 1):\r\n lst[-(i)] = x\r\nprint(sum(lst))", "n,k,x = [int(y) for y in input().split()]\r\nli = [int(y) for y in input().split()]\r\n\r\n\r\nprint(k*x + sum(li[:n-k]))\r\n\r\n", "\r\na,b,c=map(int, input().split())\r\nd=sorted(list(map(int, input().split())))\r\nf=a-b\r\n\r\ncnt=0\r\nfor i in range(f):\r\n cnt+=d[i]\r\nprint(cnt+(b*c))\r\n\r\n \r\n", "y=input().split()\r\nn = int(y[0])\r\nk=int(y[1])\r\nx=int(y[2])\r\na=[]\r\ns=0\r\na=input().split()\r\nfor i in range(len(a)-k):\r\n s+=int(a[i])\r\ns+=k*x\r\nprint(s)\r\n\r\n", "n,k,x = list(map(int,input().split()))\r\nl=sorted(list(map(int,input().split())))\r\na=sum(l[:n-k])+k*x\r\nprint(a)", "n,k,x = map(int, input().split())\r\na = list(map(int, input().split()))\r\na = a[::-1]\r\nfor i in range(k):\r\n a[i] = min(a[i], x)\r\nprint(sum(a))", "n,m,k = map(int,input().split())\nT = list(map(int,input().split()))\n \ntotal=0\nfor i in range(n-m):\n total+=T[i]\ntotal+=k*m\nprint(total)", "n = input()\nn = n.split()\nn,k,x = int(n[0]),int(n[1]),int(n[2])\n\n\na = input()\na = [int(x) for x in a.split()]\nres = 0\nfor i in range(n):\n\tif i < n-k:\n\t\tres += a[i]\n\telse:\n\t\tres += x\n\nprint(res)", "n,k,x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nost = n-k\r\nres = 0\r\nfor i in range(ost):\r\n res+=a[i]\r\nprint(res+k*x)\r\n", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=k*x\r\nfor i in range(n-k):\r\n\ts=s+a[i]\t\t\t\t\t\r\nprint(s)", "import sys\r\n\r\nn, k, x = map(int, input().split())\r\na = sorted(map(int, input().split()), reverse=True)\r\nfor i in range(k):\r\n a[i] = min(a[i], x)\r\n\r\nprint(sum(a))\r\n", "n,k,x = map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\nfor i in range(k):\r\n\tl[n-1-i] = x\r\nprint(sum(l))", "n, k, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nans = k * x\r\nfor i in range(0, n - k):\r\n\tans += c[i]\r\nprint(ans)", "\n\nfrom sys import stdin\n\ndef main():\n\tn, k, x = [int(tok) for tok in stdin.readline().strip().split()]\n\ta = [int(tok) for tok in stdin.readline().strip().split()]\n\tprint(sum(a[: n - k]) + x * k)\n\nif __name__ == \"__main__\":\n\tmain()\n", "[n,k,m] = [int(x) for x in input().split()]\n\nai = [int(x) for x in input().split()]\nsum = 0 \nfor x in range(0,n-k):\n sum = sum + ai[x]\nsum = sum + k*m\nprint(sum)\n", "n,k,x = map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\ns = 0\r\nfor i in range(n-k):\r\n s += a[i]\r\n\r\nfor i in range(k):\r\n s += x\r\n \r\nprint(s)", "I = lambda: map(int, input().split())\r\n\r\n_, k, x = I()\r\n\r\nprint(sum(list(I())[:-k]) + k*x)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=n-1\r\nc=0\r\nwhile i>=0:\r\n if a[i]>x:\r\n a[i]=x\r\n c=c+1\r\n if c==k:\r\n break\r\n i=i-1\r\nprint(sum(a))", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=n-1\r\nq=0\r\nwhile q!=k:\r\n a[i]=x\r\n i-=1\r\n q+=1\r\nprint(sum(a))\r\n \r\n", "line1 = input().split()\nn , k, x = int(line1[0]), int(line1[1]), int(line1[2])\n\nline2 = input().split()\nworks = []\n\nfor el in line2:\n works.append(int(el))\nfor i in range(1, k + 1):\n works[-i] = x\nprint(sum(works))\n", "n, k, x = map(int, input().split())\nA = list(map(int, input().split()))\nA.sort(reverse=True)\nans = sum(A)-sum(A[0:k])+k*x\nprint(ans)\n", "x,y,z=map(int,input().split())\r\na=list(map(int,input().split()))\r\nprint(sum(a[:x-y])+y*z)", "n,m,o = map(int,input().split())\r\nb = list(map(int,input().split()))\r\nfor i in range(m):\r\n\tb.pop()\r\nprint(sum(b)+(m*o))\r\n", "n, k, x = [int(x) for x in input().split()]\r\nl_tm = [int(x) for x in input().split()]\r\nfor i in range(1, k+1):\r\n l_tm[-i] = x\r\nprint(sum(l_tm))", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nc=0\r\nsu=sum(a)\r\nfor i in range(n-1,n-k-1,-1):\r\n\tsu-=a[i]\r\nprint(su+k*x)", "a = input().split()\nb = input().split()\nc = 0\nfor i in range(len(b)-int(a[1])):\n c+=int(b[i])\nc+= int(a[1])*int(a[2])\nprint(c)", "n,k,x=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\na.sort(reverse=True)\r\ntime=0\r\nfor i in range(n):\r\n if(k>0 and a[i]>x):\r\n time+=x\r\n k-=1\r\n else:\r\n time+=a[i]\r\nprint(time)", "n,k,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nprint(sum(a[0:(n-k)])+x*k)\r\n\r\n" ]

{"inputs": ["4 2 2\n3 6 7 10", "5 2 1\n100 100 100 100 100", "1 1 1\n100", "100 1 99\n100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100", "100 100 1\n100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100", "100 50 50\n51 51 52 53 55 55 55 55 56 56 56 57 57 58 58 59 59 59 60 60 61 61 62 62 63 64 64 64 64 65 65 65 65 66 66 66 67 68 68 68 69 69 70 70 70 70 71 71 71 71 71 71 72 72 76 76 76 76 77 79 79 81 81 81 81 82 82 82 82 83 84 85 86 87 87 88 88 88 89 89 89 90 90 90 91 91 91 92 92 93 95 95 96 96 96 97 97 98 99 100", "100 100 1\n2 4 4 4 5 5 5 6 10 10 11 11 12 12 13 13 13 14 17 18 20 20 21 21 22 22 23 24 24 25 26 29 29 32 32 34 34 35 38 39 39 40 40 42 42 43 45 47 48 49 51 52 52 54 57 59 59 60 61 61 62 63 63 64 65 65 68 70 70 72 74 75 75 76 76 77 77 78 78 78 79 80 81 82 82 83 83 83 84 89 90 92 92 93 94 96 96 97 98 99", "100 1 1\n3 3 5 7 8 8 8 9 9 9 11 13 14 15 18 18 19 20 21 22 22 25 27 27 29 31 32 33 33 34 36 37 37 38 40 42 44 44 46 47 47 48 48 48 50 50 51 51 54 54 54 55 55 56 56 56 60 61 62 62 63 64 65 65 68 70 70 71 71 71 71 75 75 76 76 79 79 79 79 81 81 82 82 86 86 86 86 88 90 90 92 96 97 97 98 98 98 98 100 100", "100 50 49\n50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51", "100 50 1\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3", "100 1 1\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2"], "outputs": ["13", "302", "1", "9999", "100", "5618", "100", "5202", "4950", "151", "199"]}

UNKNOWN

PYTHON3

CODEFORCES

291

9172cd6361befbdd0dd7efc95b7a917d

Haiku

Haiku is a genre of Japanese traditional poetry. A haiku poem consists of 17 syllables split into three phrases, containing 5, 7 and 5 syllables correspondingly (the first phrase should contain exactly 5 syllables, the second phrase should contain exactly 7 syllables, and the third phrase should contain exactly 5 syllables). A haiku masterpiece contains a description of a moment in those three phrases. Every word is important in a small poem, which is why haiku are rich with symbols. Each word has a special meaning, a special role. The main principle of haiku is to say much using a few words. To simplify the matter, in the given problem we will consider that the number of syllable in the phrase is equal to the number of vowel letters there. Only the following letters are regarded as vowel letters: "a", "e", "i", "o" and "u". Three phases from a certain poem are given. Determine whether it is haiku or not. The input data consists of three lines. The length of each line is between 1 and 100, inclusive. The *i*-th line contains the *i*-th phrase of the poem. Each phrase consists of one or more words, which are separated by one or more spaces. A word is a non-empty sequence of lowercase Latin letters. Leading and/or trailing spaces in phrases are allowed. Every phrase has at least one non-space character. See the example for clarification. Print "YES" (without the quotes) if the poem is a haiku. Otherwise, print "NO" (also without the quotes). Sample Input on codeforces beta round is running a rustling of keys how many gallons of edo s rain did you drink cuckoo Sample Output YESNO

[ "a = input()\r\ndamn = 0\r\ndamn += a.count('a')\r\ndamn += a.count('e')\r\ndamn += a.count('i')\r\ndamn += a.count('o')\r\ndamn += a.count('u')\r\nif damn != 5:\r\n print('NO')\r\n exit()\r\ndamn = 0\r\nb = input()\r\ndamn += b.count('a')\r\ndamn += b.count('e')\r\ndamn += b.count('i')\r\ndamn += b.count('o')\r\ndamn += b.count('u')\r\nif damn != 7:\r\n print('NO')\r\n exit()\r\ndamn = 0\r\nc = input()\r\ndamn += c.count('a')\r\ndamn += c.count('e')\r\ndamn += c.count('i')\r\ndamn += c.count('o')\r\ndamn += c.count('u')\r\nif damn != 5:\r\n print('NO')\r\n exit()\r\nelse:\r\n print('YES')", "a=input()\r\nb=input()\r\nc=input()\r\np=['a','e','i','o','u']\r\nd=0\r\ne=0\r\nf=0\r\nfor i in a:\r\n if i in p:\r\n d=d+1\r\nfor j in b:\r\n if j in p:\r\n e=e+1\r\nfor k in c:\r\n if k in p:\r\n f=f+1\r\nif d==5 and e==7 and f==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\nc=input()\r\nd=['a','e','i','o','u']\r\nans=cnt=count=0\r\nfor i in a:\r\n if i in d:\r\n ans+=1\r\nfor i in b:\r\n if i in d:\r\n cnt+=1\r\nfor i in c:\r\n if i in d:\r\n count+=1\r\nif ans==5 and cnt==7 and count==5:\r\n print(\"YES\")\r\nelse: print(\"NO\")\r\n", "import math\r\nimport sys\r\nimport re\r\n\r\ns1 = input().strip()\r\ns2 = input().strip()\r\ns3 = input().strip()\r\n\r\nv1 = s1.count('a') + s1.count('e') + s1.count('i') + s1.count('o') + s1.count('u')\r\nv2 = s2.count('a') + s2.count('e') + s2.count('i') + s2.count('o') + s2.count('u')\r\nv3 = s3.count('a') + s3.count('e') + s3.count('i') + s3.count('o') + s3.count('u')\r\n\r\nif v1 != 5 or v2 != 7 or v3 != 5:\r\n print('NO')\r\nelse:\r\n print('YES')", "r=0\r\nfor i in [0,1,2]:r|=sum(x in 'aeiou' for x in input())!=5+i%2*2\r\nprint('YNEOS'[r::2])", "n1 = input()\r\nn2 = input()\r\nn3 = input()\r\nl1 = list()\r\nl2 = list()\r\nl3 = list()\r\nv = \"auioe\"\r\nn1.strip().split()\r\nn2.strip().split()\r\nn3.strip().split()\r\nn1 = \"\".join(n1)\r\nn2 = \"\".join(n2)\r\nn3 = \"\".join(n3)\r\nn1 = list(n1)\r\nn2 = list(n2)\r\nn3 = list(n3)\r\n\r\nfor i in n1:\r\n if i in v:\r\n l1.append(i)\r\nfor j in n2:\r\n if j in v:\r\n l2.append(j)\r\nfor h in n3:\r\n if h in v:\r\n l3.append(h)\r\nif len(l1) == 5 and len(l2) == 7 and len(l3) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=[]\r\nm=[]\r\nfor i in range(3):\r\n l.append(input(''))\r\nfor j in l:\r\n k=list(j)\r\n a=k.count('a')\r\n b=k.count('e')\r\n c=k.count('i')\r\n d=k.count('o')\r\n e=k.count('u')\r\n s=a+b+c+d+e\r\n m.append(s)\r\n#print(m)\r\nif m[0]==5 and m[1]==7 and m[2]==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "x = input()\r\ny = input ()\r\nz = input ()\r\nans = 0\r\nlis = [5, 7, 5]\r\nlis2 = [x, y, z]\r\ndef check (str) :\r\n\tcnt = 0\r\n\tfor i in str :\r\n\t\tif i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u' :\r\n\t\t\tcnt += 1\r\n\treturn cnt\r\nfor i in range (len (lis)):\r\n\tif check (lis2[i]) == lis[i] :\r\n\t\tans += 1\r\nif ans == 3 :\r\n\tprint ('YES')\r\nelse :\r\n\tprint ('NO')", "def countVowel(s):\r\n res=0\r\n for i in s:\r\n if i in ('a','e','i','o','u'):\r\n res+=1 \r\n return res \r\ns1=input()\r\ns2=input()\r\ns3=input()\r\nif countVowel(s1)==5 and countVowel(s2)==7 and countVowel(s3)==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "A=input()\r\nB=input()\r\nC=input()\r\na=0\r\nb=0\r\nc=0\r\nD=['a','e','i','o','u']\r\nfor i in range(len(A)):\r\n if A[i] in D:\r\n a+=1\r\nfor i in range(len(B)):\r\n if B[i] in D:\r\n b+=1\r\nfor i in range(len(C)):\r\n if C[i] in D:\r\n c+=1\r\nif a==5 and b==7 and c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l1=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nk=0\r\ns=input()\r\nfor x in s :\r\n if x in l1 :\r\n k+=1\r\n \r\n \r\n \r\n\r\nif k!=5 :\r\n print(\"NO\")\r\n \r\n exit()\r\nk=0\r\ns=input()\r\nfor x in s :\r\n if x in l1 :\r\n k+=1\r\nif k!=7 :\r\n print(\"NO\")\r\n exit()\r\nk=0\r\ns=input()\r\nfor x in s :\r\n if x in l1 :\r\n k+=1\r\nif k!=5 :\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "# LUOGU_RID: 101454208\nprint([sum(s.count(c) for c in 'aeiou') for s in open(0)] == [5, 7, 5] and 'YES' or 'NO')", "x = input()\ny = input()\nz = input()\nc=0\ns=0\nv=0\nfor i in x:\n if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n c+=1\nfor i in y:\n if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n s+=1\nfor i in z:\n if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n v+=1\n \nif c==5 and s==7 and v==5:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t\t \t\t\t\t\t\t \t\t \t \t\t\t", "import sys\r\n\r\n\r\ns, t, r = input().strip(), input().strip(), input().strip()\r\nvowel = set('aeiou')\r\ns_counter = t_counter = r_counter = 0\r\nfor _ in s:\r\n if _ in vowel:\r\n s_counter += 1\r\nif s_counter != 5:\r\n print('NO')\r\n sys.exit()\r\nfor _ in t:\r\n if _ in vowel:\r\n t_counter += 1\r\nif t_counter != 7:\r\n print('NO')\r\n sys.exit()\r\nfor _ in r:\r\n if _ in vowel:\r\n r_counter += 1\r\nif r_counter != 5:\r\n print('NO')\r\n sys.exit()\r\nprint('YES')\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n A = sys.stdin.readlines()\r\n B = []\r\n for s in A:\r\n val = 0\r\n for c in s:\r\n if c in 'aeiou':\r\n val += 1\r\n B.append(val)\r\n if B == [5, 7, 5]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\nimport sys\r\nInput = sys.stdin.readline\r\ncounterList = []\r\ncounter = 0\r\nvowel = 'aeoui'\r\nfor i in range(3):\r\n s = Input()\r\n for j in s:\r\n if j in vowel:\r\n counter+=1\r\n counterList.append(counter)\r\n counter = 0\r\nif counterList[0] == 5 and counterList[1] == 7 and counterList[2] == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n# FMZJMSOMPMSL\r\n# Ravens ;)\r\n# Codeforcesian\r\n", "b=[]\r\nfor i in range(3):\r\n l=input()\r\n l=l.replace(\" \",\"\")\r\n b.append(l)\r\nc=0\r\nd=0\r\nf=0\r\na=\"aeiou\"\r\nfor i in range(len(b)):\r\n for j in range(len(b[i])):\r\n if b[i][j] in a and i==0:\r\n c=c+1\r\n elif b[i][j] in a and i==1:\r\n d=d+1\r\n elif b[i][j] in a and i==2:\r\n f=f+1\r\n else:\r\n continue\r\nif c==5 and d==7:\r\n if f==5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "poems = [input() for _ in range(3)]\r\n\r\nvowel = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\n\r\nflag = True\r\n\r\nfor i in range(len(poems)):\r\n line = poems[i]\r\n count = 0\r\n\r\n for item in line:\r\n if item.lower() in vowel:\r\n count += 1\r\n\r\n if i == 1 and count != 7:\r\n flag = False\r\n break\r\n if i != 1 and count != 5:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "d = {\"a\",\"e\",\"i\",\"o\",\"u\"} \r\nfor i in range(3):\r\n\tcount = 0\r\n\tt = input()\r\n\tfor j in t: \r\n\t\tif j in d:\t\t\r\n\t\t\tcount = count + 1\r\n\tif count == 5 and i == 0 or count == 5 and i == 2:\r\n\t\tcontinue\r\n\telif i == 0 or i == 2:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\tif count == 7 and i == 1:\r\n\t\tcontinue\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\r\nprint(\"YES\")", "def f(s):\n ans = 0\n for item in s:\n if item in \"aeiou\":\n ans += 1\n return ans\n\n\nwin = \"YES\"\ns = input()\nif f(s) != 5:\n win = \"NO\"\ns = input()\nif f(s) != 7:\n win = \"NO\"\ns = input()\nif f(s) != 5:\n win = \"NO\"\nprint(win)\n", "print('YES' if [sum(1 for i in j if i in 'aeiou') for j in [input(), input(), input()]] == [5,7,5] else 'NO')", "#a e i o u.\r\nn=input()\r\nm=input()\r\nd=input()\r\nk=n.count('a')+n.count('e')+n.count('i')+n.count('o')+n.count('u')\r\nk2=m.count('a')+m.count('e')+m.count('i')+m.count('o')+m.count('u')\r\nk3=d.count('a')+d.count('e')+d.count('i')+d.count('o')+d.count('u')\r\nif k==5 and k2==7 and k3==5:print('YES')\r\nelse:print('NO')\r\n", "str1 = input()\r\nstr2 = input()\r\nstr3 = input()\r\nstr1 = str1.strip()\r\nstr2 = str2.strip()\r\nstr3 = str3.strip()\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\nfor i in str1:\r\n if i == 'a':\r\n c1 += 1\r\n elif i == 'e':\r\n c1 += 1\r\n elif i == 'i':\r\n c1 += 1\r\n elif i == 'o':\r\n c1 += 1\r\n elif i == 'u':\r\n c1 += 1\r\nfor j in str2:\r\n if j == 'a':\r\n c2 += 1\r\n elif j == 'e':\r\n c2 += 1\r\n elif j == 'i':\r\n c2 += 1\r\n elif j == 'o':\r\n c2 += 1\r\n elif j == 'u':\r\n c2 += 1\r\nfor k in str3:\r\n if k == 'a':\r\n c3 += 1\r\n elif k == 'e':\r\n c3 += 1\r\n elif k == 'i':\r\n c3 += 1\r\n elif k == 'o':\r\n c3 += 1\r\n elif k == 'u':\r\n c3 += 1\r\nif c1 == 5 and c2 == 7 and c3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "print('NYOE S'[[sum(m in'aeiou'for m in input())for e in\"012\"]==[5,7,5]::2])", "l=[5,7,5]\r\nans=\"YES\"\r\nfor i in range(3):\r\n n=list(input())\r\n for j in n:\r\n if j==\"a\" or j==\"e\" or j==\"i\" or j==\"o\" or j==\"u\":\r\n l[i]-=1\r\n if l[i]!=0:\r\n ans=\"NO\"\r\n break\r\nprint(ans)", "s=input()\r\na='aeiou'\r\nc,d,e=0,0,0\r\nfor i in s:\r\n if i in a:\r\n c+=1\r\ns=input()\r\nfor i in s:\r\n if i in a:\r\n d+=1\r\ns=input()\r\nfor i in s:\r\n if i in a:\r\n e+=1\r\nif c==5 and d==7 and e==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "f=input()\r\ns=input()\r\nt=input()\r\nvow={'a','e','i','o','u'}\r\nf1={}\r\nc=0\r\nfor i in f:\r\n if i in vow:\r\n c+=1\r\nf1[1]=c\r\nc=0\r\nfor i in s:\r\n if i in vow:\r\n c+=1\r\nf1[2]=c\r\nc=0\r\nfor i in t:\r\n if i in vow:\r\n c+=1\r\nf1[3]=c\r\nif f1[1]==5 and f1[2]==7 and f1[3]==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nl = [a,b,c]\r\nv1 = l[0].count('a') + l[0].count('e')+l[0].count('i')+l[0].count('o') + l[0].count('u')\r\nv2 = l[1].count('a') + l[1].count('e')+l[1].count('i')+l[1].count('o') + l[1].count('u')\r\nv3 = l[2].count('a') + l[2].count('e')+l[2].count('i')+l[2].count('o') + l[2].count('u')\r\n\r\nif v1==5 and v2 == 7 and v3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 27 11:02:19 2021\r\n\r\n@author: cheehong\r\n\"\"\"\r\nk1=list(input())\r\nk2=list(input())\r\nk3=list(input())\r\nvowel=['a','e','i','o','u']\r\ncount1=0\r\ncount2=0\r\ncount3=0\r\nfor ele in k1:\r\n if ele in vowel:\r\n count1+=1\r\nfor ele in k2:\r\n if ele in vowel:\r\n count2+=1\r\nfor ele in k3:\r\n if ele in vowel:\r\n count3+=1\r\nif count1==5:\r\n if count2==7:\r\n if count3==5:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "lis=[]\r\nlis1=['a','e','i','o','u']\r\nfor i in range(3):\r\n x=input()\r\n lis.append(x)\r\ncount=0\r\ncount2=0\r\ncount3=0\r\nlis.append(x)\r\n\r\n\r\n\r\nfor ele in lis[0]:\r\n if ele in lis1:\r\n count+=1\r\nfor ele in lis[1]:\r\n if ele in lis1:\r\n count2+=1\r\nfor ele in lis[2]:\r\n if ele in lis1:\r\n count3+=1\r\nif count==5 and count2==7 and count3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ncount1 = s1.count('a') + s1.count('e') + s1.count('i') + s1.count('o') + s1.count('u')\r\ncount2 = s2.count('a') + s2.count('e') + s2.count('i') + s2.count('o') + s2.count('u')\r\ncount3 = s3.count('a') + s3.count('e') + s3.count('i') + s3.count('o') + s3.count('u')\r\n\r\nif count1 == 5 and count2 == 7 and count3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python3\n\nimport sys\n\n\ndef vowels(k):\n return k.count('a') \\\n + k.count('e') \\\n + k.count('i') \\\n + k.count('o') \\\n + k.count('u')\n\n\ndef main():\n a = sys.stdin.readlines()\n\n for line in a[3:]:\n if line.strip() != '':\n print(\"NO\")\n return\n\n if vowels(a[0]) != 5 or vowels(a[1]) != 7 or vowels(a[2]) != 5:\n print(\"NO\")\n return\n\n print(\"YES\")\n\nmain()\n", "inp1 = input()\r\ninp2 = input()\r\ninp3 = input()\r\nval1 = inp1.count('a')+inp1.count('e')+inp1.count('i')+inp1.count('o')+inp1.count('u')\r\nval2 = inp2.count('a')+inp2.count('e')+inp2.count('i')+inp2.count('o')+inp2.count('u')\r\nval3 = inp3.count('a')+inp3.count('e')+inp3.count('i')+inp3.count('o')+inp3.count('u')\r\nif val1==5 and val2==7 and val3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "c,ii=0,0\r\nv=[5,7,5]\r\no=\"YES\"\r\nfor i in range(3):\r\n temp=input()\r\n for i in temp:\r\n if (i in ['o','i','e','u','a']):\r\n c+=1\r\n if(v[ii]==c):\r\n ii+=1 \r\n c=0\r\n else:\r\n o=\"NO\"\r\n break \r\n\r\nprint(o)\r\n", "def count_vowels(line):\r\n vowels = 'aeiou'\r\n line = line.lower()\r\n count = 0\r\n for letter in line:\r\n if letter in vowels:\r\n count += 1\r\n return count\r\n\r\noutput = True\r\n\r\nline = input()\r\nnum_vowels = count_vowels(line)\r\nif num_vowels != 5:\r\n output = False\r\n\r\nline = input()\r\nnum_vowels = count_vowels(line)\r\nif num_vowels != 7:\r\n output = False\r\n\r\nline = input()\r\nnum_vowels = count_vowels(line)\r\nif num_vowels != 5:\r\n output = False\r\n\r\nif output:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l1 = input()\nl2 = input()\nl3 = input()\nc1, c2, c3 = 0, 0, 0\nvovels = ['a','e','i','o','u']\nfor letter in l1:\n\tif letter in vovels:\n\t\tc1+=1\nfor letter in l2:\n\tif letter in vovels:\n\t\tc2+=1\nfor letter in l3:\n\tif letter in vovels:\n\t\tc3+=1\nif c1 == 5 and c2 == 7 and c3 == 5:\n\tprint(\"YES\")\nelse :\n\tprint(\"NO\")", "ishaiku=0\r\nfor i in range(3):\r\n sentence=input().lower()\r\n if i==0 or i==2:\r\n if (sentence.count('a')+sentence.count('e')+sentence.count('i')+sentence.count('o')+sentence.count('u')==5):\r\n ishaiku+=1\r\n elif (sentence.count('a')+sentence.count('e')+sentence.count('i')+sentence.count('o')+sentence.count('u')==7):\r\n ishaiku+=1\r\nif ishaiku==3:print('YES')\r\nelse:print('NO')\r\n", "a = input()\r\nb = input()\r\nc = input()\r\n\r\nvol = \"aeiou\"\r\n\r\n\r\nx = len([i for i in a if i in vol])\r\ny = len([i for i in b if i in vol])\r\nz = len([i for i in c if i in vol])\r\n\r\n\r\n\r\nprint(\"YES\" if(x == z == 5 and y == 7) else \"NO\") ", "x=input()\r\ny=input()\r\nz=input()\r\n\r\nx1=x.count('a')+x.count('e')+x.count('i')+x.count('o')+x.count('u')\r\ny1=y.count('a')+y.count('e')+y.count('i')+y.count('o')+y.count('u')\r\nz1=z.count('a')+z.count('e')+z.count('i')+z.count('o')+z.count('u')\r\n\r\nif(x1==5 and y1==7 and z1==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\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\n\r\ndef main():\r\n ca = 0\r\n cb=0\r\n cc =0\r\n vo = \"aeiou\"\r\n sa = input()\r\n sb = input()\r\n sc = input()\r\n for c in sa:\r\n if c in vo: ca += 1\r\n for c in sb:\r\n if c in vo: cb += 1\r\n for x in sc:\r\n if x in vo: cc += 1\r\n\r\n if ca == 5 and cb == 7 and cc == 5:\r\n print(\"YES\")\r\n else: print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a, b, c = input(), input(), input()\r\nca, cb, cc = 0, 0, 0\r\nfor i in range(len(a)):\r\n ca = ca + (1 if a[i] in 'aeiou' else 0)\r\nfor i in range(len(b)):\r\n cb = cb + (1 if b[i] in 'aeiou' else 0)\r\nfor i in range(len(c)):\r\n cc = cc + (1 if c[i] in 'aeiou' else 0)\r\nprint(\"YES\" if (ca == 5 and cb == 7 and cc == 5) else \"NO\")", "n = input()\nn1 = input()\nn2 = input()\na = {'a','e','i','o','u'}\nc=0 \nc1 = 0\nc2 = 0\nfor i in n :\n if i in a:\n c += 1 \nfor j in n1:\n if j in a:\n c1 += 1 \nfor k in n2:\n if k in a:\n c2 += 1\nif c==5 and c1==7 and c2==5:\n print(\"YES\")\nelse:\n print(\"NO\")", "def count_vowels():\r\n s=input()\r\n vowels=0\r\n i=len(s)\r\n \r\n while i:\r\n i=i-1\r\n \r\n if s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u':\r\n vowels=vowels+1\r\n \r\n return vowels\r\n\r\nif count_vowels()==5 and count_vowels()==7 and count_vowels()==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "S = [str(input()) for _ in range(3)]\nC = [0]*3\nB = set(['a', 'e', 'i', 'o', 'u'])\nfor i in range(3):\n s = S[i]\n cnt = 0\n for j in range(len(s)):\n if s[j] in B:\n cnt += 1\n C[i] = cnt\nif C == [5, 7, 5]:\n print('YES')\nelse:\n print('NO')\n", "a = input()\nb = input()\nc = input()\n\nx = y = z = 0\n\nv = list('aeoui')\n\nfor i in a:\n if i in v:\n x += 1\nfor i in b:\n if i in v:\n y += 1\nfor i in c:\n if i in v:\n z += 1\nif (x==5 and y==7 and z==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\ncount1,count2,count3=0,0,0\r\nfor i in s1:\r\n if i in [\"a\",\"e\",\"i\",\"o\",\"u\"]:\r\n count1+=1\r\nfor i in s2:\r\n if i in [\"a\",\"e\",\"i\",\"o\",\"u\"]:\r\n count2+=1\r\nfor i in s3:\r\n if i in [\"a\",\"e\",\"i\",\"o\",\"u\"]:\r\n count3+=1\r\n\r\nif count1==5 and count2==7 and count3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\ndef check(x):\r\n c = Counter(''.join(x))\r\n return c.get('a',0)+c.get('e',0)+c.get('i',0)+c.get('o',0)+c.get('u',0)\r\nna,nb,nc = input().strip().split(' '),input().strip().split(' '),input().strip().split(' ')\r\nprint('YES') if check(na)==5 and check(nb)==7 and check(nc)==5 else print('NO')", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns = ['a','e','i','o','u']\r\na,b,c = 0,0,0\r\nfor i in s1:\r\n if i in s:\r\n a += 1\r\nfor i in s2:\r\n if i in s:\r\n b += 1\r\nfor i in s3:\r\n if i in s:\r\n c += 1\r\nif a==5 and b==7 and c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nif s1.count('a')+s1.count('e')+s1.count('i')+s1.count('o')+s1.count('u') == 5 and s3.count('a')+s3.count('e')+s3.count('i')+s3.count('o')+s3.count('u') == 5 and s2.count('a')+s2.count('e')+s2.count('i')+s2.count('o')+s2.count('u') == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s = input()\r\ns1 = input()\r\ns2 = input()\r\na = int(s.count('i') + s.count('e') + s.count('u') + s.count('a') + s.count('o') )\r\nb = int(s1.count('i') + s1.count('e') + s1.count('u') + s1.count('a') + s1.count('o') )\r\nc = int(s2.count('i') + s2.count('e') + s2.count('u') + s2.count('a') + s2.count('o') )\r\nif a == 5 and b == 7 and c == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a1=input()\r\na2=input()\r\na3=input()\r\ndef nvowel(a=' '):\r\n return a.count(\"a\")+a.count(\"e\")+a.count(\"i\")+a.count(\"o\")+a.count(\"u\")\r\nif(nvowel(a1)==5 and nvowel(a2)==7 and nvowel(a3)==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1=input()\r\ns2=input()\r\ns3=input()\r\nc1=s1.count('a')+s1.count('e')+s1.count('i')+s1.count('o')+s1.count('u')\r\nc2=s2.count('a')+s2.count('e')+s2.count('i')+s2.count('o')+s2.count('u')\r\nc3=s3.count('a')+s3.count('e')+s3.count('i')+s3.count('o')+s3.count('u')\r\nif(c1==5 and c2==7 and c3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = input()\r\nd = input()\r\ne1 = 0\r\ne2 = 0\r\ne3 = 0\r\nif 'a' in a:\r\n e1 += a.count('a')\r\nif 'e' in a:\r\n e1 += a.count('e')\r\nif 'i' in a:\r\n e1 += a.count('i')\r\nif 'o' in a:\r\n e1 += a.count('o')\r\nif 'u' in a:\r\n e1 += a.count('u')\r\nif 'a' in b:\r\n e2 += b.count('a')\r\nif 'e' in b:\r\n e2 += b.count('e')\r\nif 'i' in b:\r\n e2 += b.count('i')\r\nif 'o' in b:\r\n e2 += b.count('o')\r\nif 'u' in b:\r\n e2 += b.count('u')\r\nif 'a' in d:\r\n e3 += d.count('a')\r\nif 'e' in d:\r\n e3 += d.count('e')\r\nif 'i' in d:\r\n e3 += d.count('i')\r\nif 'o' in d:\r\n e3 += d.count('o')\r\nif 'u' in d:\r\n e3 += d.count('u')\r\nif e1 == 5 and e2 == 7 and e3 == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "import re\r\n\r\ndef count_vowels(s):\r\n vowels = \"aeiou\"\r\n return sum([1 for c in s if c in vowels])\r\n \r\ns1 = input().strip()\r\ns2 = input().strip()\r\ns3 = input().strip()\r\nvowels1 = count_vowels(s1)\r\nvowels2 = count_vowels(s2)\r\nvowels3 = count_vowels(s3)\r\nif vowels1 == 5 and vowels2 == 7 and vowels3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = (len(tuple(filter(lambda x: x in \"aeiou\", input()))) for i in range(3))\r\nprint((\"NO\", \"YES\")[tuple(a) == (5, 7, 5)])\r\n", "# LUOGU_RID: 101454266\nprint([sum(s.count(c) for c in 'aeiou') for s in open(0)] == [5, 7, 5] and 'YES' or 'NO')", "s = 'aeiou'\r\nr = \"YES\"\r\nfor i in range(3):\r\n c = 0\r\n for j in input():\r\n if j in s: c += 1\r\n if (c != 7 and i == 1) or (c != 5 and (i == 0 or i == 2)):\r\n r = \"NO\"\r\nprint(r)", "def func(x,y,z):\r\n if x.count(\"a\")+x.count(\"e\")+x.count(\"i\")+x.count(\"o\")+x.count(\"u\")!=5:\r\n return 'NO'\r\n if y.count(\"a\")+y.count(\"e\")+y.count(\"i\")+y.count(\"o\")+y.count(\"u\")!=7:\r\n return 'NO'\r\n if z.count(\"a\")+z.count(\"e\")+z.count(\"i\")+z.count(\"o\")+z.count(\"u\")!=5:\r\n return 'NO'\r\n return \"YES\"\r\ndef main():\r\n x=input()\r\n y=input()\r\n z=input()\r\n print(func(x,y,z))\r\n\r\nmain()\r\n", "a=input().replace(' ','')\r\nb=input().replace(' ','')\r\nc=input().replace(' ','')\r\nl=list('aeiou')\r\nf,d,e=0,0,0\r\nfor i in a:\r\n if i in l:\r\n f+=1\r\nfor i in b:\r\n if i in l:\r\n d+=1\r\nfor i in c:\r\n if i in l:\r\n e+=1\r\nif(f==5 and d==7 and e==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str_1=list(input().split())\nstr_2=list(input().split())\nstr_3=list(input().split())\nstr_01=[]\nstr_02=[]\nstr_03=[]\n# set_1=list(set(str_1))\nfor i in str_1:\n for _ in i:\n str_01.append(_)\nfor i in str_2:\n for _ in i:\n str_02.append(_)\nfor i in str_3:\n for _ in i:\n str_03.append(_)\n# list(set(str_01)\n# set(str_02)\n# set(str_03)\nstr5=str_01.count('a')+str_01.count('e')+str_01.count('i')+str_01.count('o')+str_01.count('u')\nstr7=str_02.count('a')+str_02.count('e')+str_02.count('i')+str_02.count('o')+str_02.count('u')\nstr05=str_03.count('a')+str_03.count('e')+str_03.count('i')+str_03.count('o')+str_03.count('u')\nif str5==5 and str7==7 and str05==5:\n print(\"YES\")\nelse:\n print(\"NO\")", "n=input()\r\nn2=input()\r\nn3=input()\r\nvowels='aeiou'\r\nc=0\r\nc2=0\r\nc3=0\r\nfor i in n:\r\n if i in vowels:\r\n c+=1\r\nfor i in n2:\r\n if i in vowels:\r\n c2+=1\r\nfor i in n3:\r\n if i in vowels:\r\n c3+=1\r\nif c==5 and c2==7 and c3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s1 = list(input())\r\ns2 = list(input())\r\ns3 = list(input())\r\n\r\nj = 0\r\nr = 0\r\nl = 0\r\nfor i in range(len(s1)):\r\n if s1[i] == \"a\" or s1[i] == \"e\" or s1[i] == \"i\" or s1[i] == \"o\" or s1[i] == \"u\":\r\n j += 1\r\nfor i in range(len(s2)):\r\n if s2[i] == \"a\" or s2[i] == \"e\" or s2[i] == \"i\" or s2[i] == \"o\" or s2[i] == \"u\":\r\n r += 1\r\nfor i in range(len(s3)):\r\n if s3[i] == \"a\" or s3[i] == \"e\" or s3[i] == \"i\" or s3[i] == \"o\" or s3[i] == \"u\":\r\n l += 1\r\nif j != 5 or r != 7 or l != 5:\r\n print(\"NO\")\r\n quit()\r\nprint(\"YES\")\r\n", "line = []\nfor i in range(3):\n line.append(input())\ncount = 0\noutput_jud = []\nfor i in line:\n for char in i:\n if char == \"a\"or \\\n char == \"e\"or\\\n char == \"i\"or \\\n char == \"o\" or \\\n char == \"u\" :\n count += 1\n output_jud.append(count)\n count = 0\nif output_jud[0] == 5 and output_jud[1] == 7 and output_jud[2] == 5:\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", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\na = ['a', 'e', 'i', 'o', 'u']\r\nkol1 = kol2 = kol3 = 0\r\nfor i in range(len(s1)):\r\n if s1[i] in a:\r\n kol1 += 1\r\nfor i in range(len(s2)):\r\n if s2[i] in a:\r\n kol2 += 1\r\nfor i in range(len(s3)):\r\n if s3[i] in a:\r\n kol3 += 1\r\nif kol1 == 5 and kol2 == 7 and kol3 == 5:print('YES')\r\nelse:print('NO')\r\n", "from re import sub\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\n\r\na = sub(r'[^aeiou]', '', a)\r\nb = sub(r'[^aeiou]', '', b)\r\nc = sub(r'[^aeiou]', '', c)\r\n\r\nx = len(a) == 5 and len(b) == 7 and len(c) == 5\r\nprint('YES' if x else 'NO')", "def count_gl(s):\r\n r = 0\r\n for x in s:\r\n if x in \"auioe\":\r\n r += 1\r\n return r\r\n\r\npoem = [input() for i in range(3)]\r\n\r\nn_gl = list(map(count_gl, poem))\r\nif n_gl == [5, 7, 5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = str(input())\r\ns2 = str(input())\r\ns3 = str(input())\r\n\r\nc1,c2,c3=0,0,0\r\n\r\nvowels = [\"a\",\"e\",\"i\",\"u\",\"o\"]\r\n\r\nfor i in s1:\r\n if i in vowels:\r\n c1 += 1\r\nfor j in s2:\r\n if j in vowels:\r\n c2 += 1\r\n\r\nfor x in s3:\r\n if x in vowels:\r\n c3 += 1\r\n\r\nif c1==5 and c2==7 and c3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l='aioue'\r\nx=input()\r\ny=input()\r\nz=input()\r\nxx,yy,zz=0,0,0\r\nfor i in x:\r\n if(i in l):\r\n xx+=1\r\nfor i in y:\r\n if(i in l):\r\n yy+=1\r\nfor i in z:\r\n if(i in l):\r\n zz+=1\r\nif(xx==5 and yy==7 and zz==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1, s2, s3 = input(), input(), input()\r\ncnt1 = 0\r\ncnt2 = 0\r\ncnt3 = 0\r\nstring = \"aeiou\"\r\nfor i in range(len(s1)):\r\n if s1[i] in string:\r\n cnt1 += 1\r\nfor i in range(len(s2)):\r\n if s2[i] in string:\r\n cnt2 += 1\r\nfor i in range(len(s3)):\r\n if s3[i] in string:\r\n cnt3 += 1\r\nif cnt1 == 5 and cnt3 == 5 and cnt2 == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "bien = True\nbuena = [5,7,5]\nvowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\nfor i in range(3):\n frase = input().strip()\n contador = 0\n for j in frase:\n if j in vowels:\n contador += 1\n if contador != buena[i]:\n bien = False\n\nif bien:\n print(\"YES\")\nelse:\n print(\"NO\")", "s1=input()\r\ns2=input()\r\ns3=input()\r\n\r\ns1.replace(' ','')\r\ns2.replace(' ','')\r\ns3.replace(' ','')\r\ncond=False\r\ncount=0\r\nfor i in range(0,len(s1)):\r\n if s1[i]=='a' or s1[i]=='e' or s1[i]=='i' or s1[i]=='o' or s1[i]=='u':\r\n count+=1\r\n\r\nif count==5:\r\n count=0\r\n for i in range(0,len(s2)):\r\n if s2[i]=='a' or s2[i]=='e' or s2[i]=='i' or s2[i]=='o' or s2[i]=='u':\r\n count+=1\r\n\r\nif count==7:\r\n count=0\r\n for i in range(0,len(s3)):\r\n if s3[i]=='a' or s3[i]=='e' or s3[i]=='i' or s3[i]=='o' or s3[i]=='u':\r\n count+=1\r\n\r\nif count==5:\r\n cond=True\r\n\r\nif cond:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a1=input()\r\na2=input()\r\na3=input()\r\nif a1.count('a')+a1.count('e')+a1.count('i')+a1.count('u')+a1.count('o')==5 and a2.count('a')+a2.count('e')+a2.count('i')+a2.count('u')+a2.count('o')==7 and a3.count('a')+a3.count('e')+a3.count('i')+a3.count('u')+a3.count('o')==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "def f(s):\r\n st = {\"a\", \"e\", \"i\", \"o\", \"u\"}\r\n d = 0\r\n for c in s:\r\n if(c in st):\r\n d += 1\r\n return d\r\nprint((\"NO\",\"YES\")[f(input()) == 5 and f(input()) == 7 and f(input()) == 5])\r\n \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 = get_string()\r\nb = get_string()\r\nc = get_string()\r\nvowel = set('aeiou')\r\nc1 = c2 = c3 = 0\r\nfor i in a:\r\n if i in vowel:\r\n c1 += 1\r\nfor i in b:\r\n if i in vowel:\r\n c2 += 1\r\nfor i in c:\r\n if i in vowel:\r\n c3 += 1\r\nif c1==5 and c2==7 and c3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "\r\nrow = input()\r\nrow1 = input()\r\nrow2 = input()\r\n\r\nvowel = ['a', 'e', 'u','i','o']\r\nnumf = 0\r\nnums = 0\r\nnumt = 0\r\n\r\nfor x in row.split():\r\n for j in x:\r\n if j in vowel: numf = numf+1\r\n\r\nif numf == 5:\r\n for x in row1.split():\r\n for j in x:\r\n if j in vowel: nums = nums + 1\r\n if nums ==7:\r\n for x in row2.split():\r\n for j in x:\r\n if j in vowel: numt = numt + 1\r\n if numt ==5: print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\n#Counts the number of vowels in a string\r\ndef count_vowels(s):\r\n\ta = s.count('a')\r\n\te = s.count('e')\r\n\ti = s.count('i')\r\n\to = s.count('o')\r\n\tu = s.count('u')\r\n\treturn a+e+i+o+u\r\n\r\nv1 = count_vowels(input())\r\nv2 = count_vowels(input())\r\nv3 = count_vowels(input())\r\n\r\nif v1 == 5 and v2 == 7 and v3 == 5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "line1 = input()\nline2 = input()\nline3 = input()\n\ns1 = line1.count(\"a\") + line1.count(\"e\") + line1.count(\"i\") + line1.count(\"o\") + line1.count(\"u\")\ns2 = line2.count(\"a\") + line2.count(\"e\") + line2.count(\"i\") + line2.count(\"o\") + line2.count(\"u\")\ns3 = line3.count(\"a\") + line3.count(\"e\") + line3.count(\"i\") + line3.count(\"o\") + line3.count(\"u\")\n\nif s1 != 5 or s2 != 7 or s3 != 5:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "vowels = ['a','e','i','o','u']\r\na = [i for i in str(input()) if i in vowels]\r\nb = [i for i in str(input()) if i in vowels]\r\nc = [i for i in str(input()) if i in vowels]\r\nif len(a)==len(c)==5 and len(b)==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n poems = [input() for _ in range(3)]\r\n vowels = ['a','e','i','o','u']\r\n flag = True\r\n\r\n for i in range(len(poems)):\r\n line = poems[i]\r\n count = 0\r\n\r\n for item in line:\r\n if item.lower() in vowels:\r\n count += 1\r\n \r\n if i == 1 and count != 7:\r\n flag = False\r\n break\r\n if i != 1 and count != 5:\r\n flag = False\r\n break\r\n \r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def vowels(s):\r\n c=0\r\n c=s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')\r\n return c\r\na=input()\r\nb=input()\r\nc=input()\r\nr1=vowels(a)\r\nr2=vowels(b)\r\nr3=vowels(c)\r\nif r1==5 and r2==7 and r3==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "v=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nl=[]\r\nfor i in range(1,4):\r\n s=input().replace(\" \",\"\")\r\n count=0\r\n for j in s:\r\n if j in v:\r\n count+=1\r\n l.append(count)\r\nif l[0]==5 and l[1]==7 and l[2]==5 and sum(l)==17:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nmsg = sys.stdin.readlines()\r\nf1,f2,f3=5,7,5\r\nfor i in range(len(msg)):\r\n if(i==0):\r\n for word in range(len(msg[i])):\r\n if msg[i][word]=='a' or msg[i][word]=='e' or msg[i][word]=='i'or msg[i][word]=='o' or msg[i][word]=='u':\r\n f1-=1\r\n \r\n if(i==1):\r\n for word in range(len(msg[i])):\r\n if msg[i][word]=='a' or msg[i][word]=='e' or msg[i][word]=='i'or msg[i][word]=='o' or msg[i][word]=='u':\r\n f2-=1\r\n \r\n if(i==2):\r\n for word in range(len(msg[i])):\r\n if msg[i][word]=='a' or msg[i][word]=='e' or msg[i][word]=='i'or msg[i][word]=='o' or msg[i][word]=='u':\r\n f3-=1\r\nif f1==0 and f2==0 and f3==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check(line):\r\n\treturn sum([line.count('o'), line.count('a'), line.count('e'), line.count('i'), line.count('u')])\r\n\r\nfirst = check(input())\r\nsecond = check(input())\r\nthird = check(input())\r\n\r\nif first != 5 or second != 7 or third !=5:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\r\n\r\n\r\n", "line1 = input()\r\nline2 = input()\r\nline3 = input()\r\n\r\nvowels_1 = line1.count('a') + line1.count('e') + line1.count('i') + line1.count('o') + line1.count('u')\r\nvowels_2 = line2.count('a') + line2.count('e') + line2.count('i') + line2.count('o') + line2.count('u')\r\nvowels_3 = line3.count('a') + line3.count('e') + line3.count('i') + line3.count('o') + line3.count('u')\r\n\r\nif vowels_1 ==5 and vowels_2 == 7 and vowels_3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a=input()\r\nb=input()\r\nc=input()\r\nq=0\r\nw=0\r\ne=0\r\na=a.replace(\" \",\"\")\r\nb=b.replace(\" \",\"\")\r\nc=c.replace(\" \",\"\")\r\nfor i in range(len(a)):\r\n if(a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' ):\r\n q+=1\r\nfor i in range(len(b)):\r\n if(b[i]=='a' or b[i]=='e' or b[i]=='i' or b[i]=='o' or b[i]=='u' ):\r\n w+=1\r\nfor i in range(len(c)):\r\n if(c[i]=='a' or c[i]=='e' or c[i]=='i' or c[i]=='o' or c[i]=='u' ):\r\n e+=1\r\nif(q==5 and w==7 and e==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "st=input()\nc1=0\nc2=0\nc3=0\nfor i in st:\n if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n c1+=1\n\nst=input()\nfor i in st:\n if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n c2+=1\n\nst=input()\nfor i in st:\n if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n c3+=1\n\nif(c1==5 and c2==7 and c3==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t\t\t\t \t \t\t \t\t\t\t\t\t", "l1 = input().lower()\r\nl2 = input().lower()\r\nl3 = input().lower()\r\nv = \"aeiou\"\r\nv_count = []\r\nlines = [l1, l2, l3]\r\nfor i in lines:\r\n count = 0\r\n for j in i:\r\n if j in v:\r\n count += 1\r\n v_count.append(count)\r\nif v_count == [5, 7, 5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n boins=['a','i','u','e','o']\n a=S()\n b=S()\n c=S()\n\n c1=c2=c3=0\n\n for x in a:\n if x in boins:\n c1+=1\n\n for x in b:\n if x in boins:\n c2+=1\n\n for x in c:\n if x in boins:\n c3+=1\n\n if c1==5 and c2==7 and c3==5:\n return 'YES'\n return 'NO'\n\n# main()\nprint(main())\n", "a = input()\r\nb = input()\r\nc = input()\r\nv1 = a.count('a')+a.count('e')+a.count('i')+a.count('o')+a.count('u')\r\nv2 = b.count('a')+b.count('e')+b.count('i')+b.count('o')+b.count('u')\r\nv3 = c.count('a')+c.count('e')+c.count('i')+c.count('o')+c.count('u')\r\nif v1 == 5 and v2 == 7 and v3 == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = 3\nhaiku = True\nfor i in range(3):\n line = input()\n t = 0\n vowels = ['a', 'e', 'i', 'o', 'u']\n for c in line:\n if c in vowels:\n t += 1\n if i % 2 == 0:\n if t != 5:\n haiku = False\n else:\n if t != 7:\n haiku = False\nif haiku:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t \t\t \t\t \t\t \t\t\t\t \t\t \t\t\t\t \t", "s1=input().strip()\r\ns2=input().strip()\r\ns3=input().strip()\r\ncount1=count2=count3=0\r\n\r\nfor i in range(len(s1)):\r\n# print(s1[i])\r\n if s1[i]==\"a\" or s1[i]==\"e\" or s1[i]==\"i\" or s1[i]==\"u\" or s1[i]==\"o\":\r\n\r\n count1+=1\r\n\r\nfor i in range(len(s2)):\r\n if s2[i]==\"a\" or s2[i]==\"e\" or s2[i]==\"i\"or s2[i]==\"u\"or s2[i]==\"o\":\r\n count2+=1\r\n\r\n\r\nfor i in range(len(s3)):\r\n if s3[i]==\"a\" or s3[i]==\"e\" or s3[i]==\"i\"or s3[i]==\"u\"or s3[i]==\"o\":\r\n count3+=1\r\n\r\n elif s3[i]==\" \":\r\n continue\r\n\r\nif count1==5 and count2==7 and count3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\n\r\nc1=0\r\nc2=0\r\nc3=0\r\n\r\nfor i in a:\r\n if i=='a' or i== 'e' or i== 'i' or i=='o' or i=='u':\r\n c1=c1+1\r\n \r\nfor i in b:\r\n if i=='a' or i== 'e' or i== 'i' or i=='o' or i=='u':\r\n c2=c2+1\r\nfor i in c:\r\n if i=='a' or i== 'e' or i== 'i' or i=='o' or i=='u':\r\n c3=c3+1\r\n \r\nprint(\"YES\" if (c1== 5 and c2== 7 and c3== 5) else \"NO\")", "h = []\r\nh.extend(input() for _ in range(3))\r\nv = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\ns = [sum(line.count(e) for e in v) for line in h]\r\nprint('YES' if s == [5, 7, 5] else 'NO')", "l = list(input())\r\nn = list(input())\r\ng = list(input())\r\ncount1 = 0\r\ncount2 = 0\r\ncount3 = 0\r\nfor i in l:\r\n if i == \"a\" or i == \"e\"or i == \"i\"or i == \"o\"or i == \"u\":\r\n count1 += 1\r\nfor j in n:\r\n if j == \"a\" or j == \"e\"or j == \"i\"or j == \"o\"or j == \"u\":\r\n count2 += 1\r\nfor k in g:\r\n if k == \"a\" or k == \"e\"or k == \"i\"or k == \"o\"or k == \"u\":\r\n count3 += 1\r\nif count1 == 5 and count2 == 7 and count3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\nif a.count('a')+a.count('e')+a.count('i')+a.count('o')+a.count('u')==5 and b.count('a')+b.count('e')+b.count('i')+b.count('o')+b.count('u')==7 and c.count('a')+c.count('e')+c.count('i')+c.count('o')+c.count('u')==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "vowels = [\"a\",\"e\",\"i\",\"o\",\"u\"]\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\na,b,c = 0,0,0\r\nfor i in s1:\r\n\tif i in vowels:\r\n\t\ta+=1\r\nfor i in s2:\r\n\tif i in vowels:\r\n\t\tb+=1\r\nfor i in s3:\r\n\tif i in vowels:\r\n\t\tc+=1\r\nif a == 5 and b == 7 and c == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "from functools import reduce\r\n\r\nvow = 'aeiou'\r\na, b, c = input(), input(), input()\r\ncount_a = reduce(lambda aa, bb: aa + a.count(bb), vow, 0)\r\ncount_b = reduce(lambda aa, bb: aa + b.count(bb), vow, 0)\r\ncount_c = reduce(lambda aa, bb: aa + c.count(bb), vow, 0)\r\n\r\nif (count_a, count_b, count_c) == (5, 7, 5):\r\n print('YES')\r\nelse:\r\n print('NO')", "x=input()\r\ny=input()\r\nz=input()\r\nc1=x.count(\"a\")+x.count(\"e\")+x.count(\"i\")+x.count(\"o\")+x.count(\"u\")\r\nc2=y.count(\"a\")+y.count(\"e\")+y.count(\"i\")+y.count(\"o\")+y.count(\"u\")\r\nc3=z.count(\"a\")+z.count(\"e\")+z.count(\"i\")+z.count(\"o\")+z.count(\"u\")\r\nif c1==5 and c2==7 and c3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, b, c = list(input()), list(input()), list(input())\r\nt1, t2, t3 = 0, 0, 0\r\nfor i in a:\r\n if i=='a' or i=='i' or i=='o' or i=='e' or i=='u':\r\n t1+=1\r\nfor i in b:\r\n if i=='a' or i=='i' or i=='o' or i=='e' or i=='u':\r\n t2+=1\r\nfor i in c:\r\n if i=='a' or i=='i' or i=='o' or i=='e' or i=='u':\r\n t3+=1\r\nif t1==5 and t2==7 and t3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def haiku(n1,n2,n3):\r\n vowels = {'a','e','i','o','u'}\r\n count = 0\r\n for i in n1:\r\n if i in vowels:\r\n count += 1\r\n if count != 5:\r\n return False\r\n \r\n count = 0\r\n for i in n2:\r\n if i in vowels:\r\n count += 1\r\n if count != 7:\r\n return False\r\n \r\n count = 0\r\n for i in n3:\r\n if i in vowels:\r\n count += 1\r\n if count != 5:\r\n return False\r\n \r\n return True\r\n\r\n\r\nif __name__ == '__main__':\r\n n1 = input()\r\n n2 = input()\r\n n3 = input()\r\n \r\n if haiku(n1,n2,n3):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "vowel = [ \"a\", \"e\", \"i\", \"o\", \"u\"]\r\ncount = 0\r\nfor i in range(3):\r\n count = 0\r\n a = input()\r\n if i == 0 or i == 2:\r\n for j in vowel:\r\n count += a.count(j)\r\n if count != 5:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n for j in vowel:\r\n count += a.count(j)\r\n if count != 7:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n\r\n\r\n\r\n\r\n", "s = input()\r\ns2 = input()\r\ns3 = input()\r\n\r\ns = s.replace(\" \",\"\")\r\ns2 = s2.replace(\" \",\"\")\r\ns3 = s3.replace(\" \",\"\")\r\n\r\nl1 = 0\r\nl2 = 0\r\nl3 = 0\r\n\r\nfor i in s:\r\n if i== \"a\" or i== \"e\" or i== \"o\" or i== \"i\" or i== \"u\":\r\n l1 += 1\r\n\r\nfor i in s2:\r\n if i== \"a\" or i== \"e\" or i== \"o\" or i== \"i\" or i== \"u\":\r\n l2 += 1\r\n\r\nfor i in s3:\r\n if i== \"a\" or i== \"e\" or i== \"o\" or i== \"i\" or i== \"u\":\r\n l3 += 1\r\n\r\nif l1 == 5 and l2 == 7 and l3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\ncnt1 = 0\r\ncnt2 = 0\r\ncnt3 = 0\r\n*ar, = 'aeuio'\r\nfor i in s1:\r\n if i in ar:\r\n cnt1 += 1\r\nfor i in s2:\r\n if i in ar:\r\n cnt2 += 1\r\nfor i in s3:\r\n if i in ar:\r\n cnt3 += 1\r\nif cnt1 == cnt3 == 5 and cnt2 == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "################### -*- coding: utf-8 -*- ###################\r\n # > File Name : a.py\r\n # > Author : omemi\r\n # > Created Time : 2022/1/30 14:16:40\r\n#############################################################\r\n\r\na, b, c = input(), input(), input()\r\nx, y, z = 0, 0, 0\r\n\r\nfor i in a:\r\n if i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n x += 1\r\nfor i in b:\r\n if i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n y += 1\r\nfor i in c:\r\n if i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n z += 1\r\nif x == 5 and y == 7 and z == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "b = True\nfor i in range(3):\n\ts = input()\n\tcnt = 0\n\tfor j in s:\n\t\tif j == 'a' or j == 'e' or j == 'i' or j == 'o' or j == 'u':\n\t\t\tcnt += 1\n\tif ((i == 0 or i == 2) and cnt != 5) or (i == 1 and cnt != 7):\n\t\tb = False\nif b:\n\tprint('YES')\nelse:\n\tprint('NO')", "d = ['a', 'e', 'i', 'u', 'o']\r\na = input()\r\nif sum(a.count(e) for e in d)!=5:\r\n\tprint(\"NO\")\r\n\texit(0)\r\nb = input()\r\nif sum(b.count(e) for e in d)!=7:\r\n\tprint(\"NO\")\r\n\texit(0)\r\nc = input()\r\nif sum(c.count(e) for e in d)!=5:\r\n\tprint(\"NO\")\r\n\texit(0)\r\nprint(\"YES\")", "s = [0]*3\r\nslog = [0]*3\r\nfor i in range(3):\r\n s[i] = input()\r\n slog[i] = s[i].count(\"a\") + s[i].count(\"e\") + s[i].count(\"i\") + s[i].count(\"o\") + s[i].count(\"u\")\r\nif slog[0] == 5 and slog[1] == 7 and slog[2] == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=[input() for i in range(3)]\r\nvo=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nfor i in range(3):\r\n\tv=0\r\n\tfor j in a[i]:\r\n\t\tif j in vo:\r\n\t\t\tv+=1\r\n\tif i%2==0 and v!=5:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\telif i==1 and v!=7:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "def is_v(c):\r\n if(c=='a' or c=='e' or c=='i' or c=='o' or c=='u'):\r\n return 1\r\n else:\r\n return 0\r\na = input()\r\nb = input()\r\nc = input()\r\nc_a = 0\r\nc_b = 0\r\nc_c = 0\r\nfor i in range(len(a)):\r\n if(is_v(a[i])):\r\n c_a+=1\r\nfor i in range(len(b)):\r\n if(is_v(b[i])):\r\n c_b+=1\r\nfor i in range(len(c)):\r\n if(is_v(c[i])):\r\n c_c+=1\r\nif(c_a==5 and c_b==7 and c_c==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "import re\r\n\r\ns1=input()\r\ns2=input()\r\ns3=input()\r\n\r\nif(len(re.findall(r'[a,e,i,o,u]{1}',s1))==5 and len(re.findall(r'[a,e,i,o,u]{1}',s2))==7 and len(re.findall(r'[a,e,i,o,u]{1}',s3))==5):\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "\r\ns1 =input()\r\ns2=input()\r\ns3=input()\r\nvow=0\r\nvow1=0\r\nvow2=0\r\nl = ['a' , 'e' , 'i', 'o', 'u']\r\nfor i in range(len(s1)):\r\n if(s1[i]=='a' or s1[i]=='e' or s1[i]=='i' or s1[i]=='o' or s1[i]=='u' ):\r\n vow+=1\r\nfor j in range(len(s2)):\r\n if(s2[j]=='a' or s2[j]=='e' or s2[j]=='i' or s2[j]=='o' or s2[j]=='u' ):\r\n vow1+=1\r\nfor k in range(len(s3)):\r\n if(s3[k]=='a' or s3[k]=='e' or s3[k]=='i' or s3[k]=='o' or s3[k]=='u' ):\r\n vow2+=1\r\nif(vow==5 and vow1==7 and vow2==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\n\ns1 = input()\ns2 = input()\ns3 = input()\n\nif(len(re.findall(r'[a,e,i,o,u]{1}',s1))==5 and len(re.findall(r'[a,e,i,o,u]{1}',s2))==7 and len(re.findall(r'[a,e,i,o,u]{1}',s3))==5):\n print('YES')\nelse:\n print(\"NO\")\n", "\r\nvowel_list = ['a','e','i','o','u']\r\nl1 = len([i for i in input() if i in vowel_list])\r\nl2 = len([i for i in input() if i in vowel_list])\r\nl3 = len([i for i in input() if i in vowel_list])\r\n\r\nprint(\"YES\" if l1 == 5 and l2 == 7 and l3 == 5 else \"NO\")", "haiku = []\r\nsyllable = [5, 7, 5]\r\nvowel = ['a', 'e', 'i', 'o', 'u']\r\nv = 1\r\n\r\nfor i in range(3):\r\n haiku.append(input())\r\n\r\nfor i in range(3):\r\n s = 0\r\n for j in range(5):\r\n s += haiku[i].count(vowel[j]) \r\n if s != syllable[i]:\r\n v = 0\r\n\r\nif v:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def count_vowels(s):\n vowels = 'aeiou'\n c = 0\n for i in s :\n if i in vowels:\n c+=1\n return c\nres = True\nfor i in range(3):\n if i ==1:\n res = count_vowels(input()) == 7 and res\n else:\n res = count_vowels(input()) == 5 and res\nif res :\n print('YES')\nelse :\n print('NO')", "def haiku(line):\n\tvowel = 'aiueo'\n\tcount = 0\n\tfor i in line:\n\t\tif i in vowel:\n\t\t\tcount = count + 1\n\treturn count\n\n\nfirst = input().lower()\nsecond = input().lower()\nthird = input().lower()\n\n\n\nif haiku(first) == 5 and haiku(second) == 7 and haiku(third) == 5:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n ", "l1 = input()\r\nl2 = input()\r\nl3 = input()\r\nl1vow = 0\r\nl2vow = 0\r\nl3vow = 0\r\nfor c in l1:\r\n if c in 'aeiou':\r\n l1vow += 1\r\nfor c in l2:\r\n if c in 'aeiou':\r\n l2vow += 1\r\nfor c in l3:\r\n if c in 'aeiou':\r\n l3vow += 1\r\nif l1vow == 5 and l2vow == 7 and l3vow == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "p = [input() for i in range(3)]\r\ncount = lambda x: sum(p[x].count(c) for c in \"aeiou\")\r\nprint(\"YNEOS\"[count(0)!=5 or count(1)!=7 or count(2)!=5::2])\r\n\r\n## new ", "a = [5,7,5]\r\nv = \"aeiou\"\r\nr = True\r\nfor i in range(3):\r\n s = input()\r\n c = 0\r\n for x in s:\r\n if x in v:\r\n c += 1\r\n if c != a[i]:\r\n print('NO')\r\n r = False\r\n break\r\nif r == True:\r\n print('YES')", "s1 = list(input())\r\ns2 = list(input())\r\ns3 = list(input())\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\nfor cur in s1:\r\n if cur == \"a\" or cur == \"e\" or cur == \"i\" or cur == \"o\" or cur == \"u\":\r\n c1 += 1\r\nfor cur in s2:\r\n if cur == \"a\" or cur == \"e\" or cur == \"i\" or cur == \"o\" or cur == \"u\":\r\n c2 += 1\r\nfor cur in s3:\r\n if cur == \"a\" or cur == \"e\" or cur == \"i\" or cur == \"o\" or cur == \"u\":\r\n c3 += 1\r\n\r\nif c1 == 5 and c2 == 7 and c3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "flag = \"YES\"\r\nvowels = \"aeiou\"\r\ncheck = set(vowels)\r\nfor i in range(3):\r\n line = str(input())\r\n vowel_count = 0\r\n for j in line:\r\n if j in check:\r\n vowel_count += 1\r\n\r\n if i == 0 and vowel_count != 5 or i == 1 and vowel_count != 7 or i == 2 and vowel_count != 5:\r\n flag = \"NO\"\r\n\r\nprint(flag)", "l1=list(input().split())\r\nl2=list(input().split())\r\nl3=list(input().split())\r\ncount=0\r\nfor i in l1:\r\n for j in range(len(i)):\r\n if(i[j]=='a' or i[j]=='e' or i[j]=='i' or i[j]=='o' or i[j]=='u'):\r\n count+=1\r\n \r\n \r\nif(count==5):\r\n count=0\r\n for i in l2:\r\n for j in range(len(i)):\r\n if(i[j]=='a' or i[j]=='e' or i[j]=='i' or i[j]=='o' or i[j]=='u'):\r\n count+=1\r\n if(count==7):\r\n count=0\r\n for i in l3:\r\n for j in range(len(i)):\r\n if(i[j]=='a' or i[j]=='e' or i[j]=='i' or i[j]=='o' or i[j]=='u'):\r\n count+=1\r\n if(count==5):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n ", "isOk = \"YES\"\r\ns = input()\r\nif s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')!=5 : isOk = \"NO\" \r\ns = input()\r\nif s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')!=7 : isOk = \"NO\" \r\ns = input()\r\nif s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')!=5 : isOk = \"NO\" \r\nprint(isOk)", "a=input();a=sum(map(lambda x: True if x in \"aeiuo\" else False, a))\r\nb=input();b=sum(map(lambda x: True if x in \"aeiuo\" else False, b))\r\nc=input();c=sum(map(lambda x: True if x in \"aeiuo\" else False, c))\r\nprint(\"YES\" if (a,b,c) == (5,7,5) else \"NO\")", "vowels = ['a', 'e', 'i', 'o', 'u']\r\n\r\n\r\ndef haiku(x):\r\n count = 0\r\n for elem in x:\r\n if elem in vowels:\r\n count += 1\r\n return count\r\n\r\n\r\ns = input()\r\nt = input()\r\nw = input()\r\nif haiku(s) == 5 and haiku(t) == 7 and haiku(w) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\n\r\ndef haiku(s):\r\n ans = 0\r\n ans += s.count(\"a\", 0, len(s))\r\n ans += s.count(\"e\", 0, len(s))\r\n ans += s.count(\"i\", 0, len(s))\r\n ans += s.count(\"o\", 0, len(s))\r\n ans += s.count(\"u\", 0, len(s))\r\n return ans\r\n \r\ns = str(input())\r\nif haiku(s) != 5:\r\n print(\"NO\")\r\n sys.exit()\r\ns = str(input())\r\nif haiku(s) != 7:\r\n print(\"NO\")\r\n sys.exit()\r\ns = str(input())\r\nif haiku(s) != 5:\r\n print(\"NO\")\r\n sys.exit()\r\nprint(\"YES\")\r\n", "l1 = input()\r\nl2 = input()\r\nl3 = input()\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor i in l1:\r\n if i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n c1 += 1\r\nfor i in l2:\r\n if i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n c2 += 1\r\nfor i in l3:\r\n if i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n c3 += 1\r\nif c1==5 and c2==7 and c3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\na=input()\r\nb=input()\r\nc=input()\r\nx=0\r\ny=0\r\nz=0\r\nfor i in t:\r\n x+=a.count(i)\r\n y+=b.count(i)\r\n z+=c.count(i)\r\nif(x==5 and y==7 and z==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "print('YES' if [sum(s.count(x) for x in \"aeiou\") for s in [input() for _ in range(3)]]==[5,7,5] else 'NO')\n \t\t\t\t \t\t \t \t \t \t \t\t\t\t\t\t \t\t", "from collections import Counter\r\nt = 'aioue'\r\nq = input()\r\nw = input()\r\nr = input()\r\np = Counter(q)\r\nv = Counter(w)\r\nb = Counter(r)\r\nif (p['a'] + p['i'] + p['o'] + p['u'] + p['e']) == 5 and (v['a'] + v['i'] + v['o'] + v['u'] + v['e']) == 7 and (b['a'] + b['i'] + b['o'] + b['u'] + b['e']) == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# Хайку\r\n\r\ndef skolko_slogov_v_str(str):\r\n\tcnt = 0\r\n\tfor bukva in str:\r\n\t\tfor glas in ['a','e','i','o','u']:\r\n\t\t\tif bukva == glas:\r\n\t\t\t\tcnt += 1\r\n\treturn cnt\r\n\r\nstatus = \"NO\"\r\nif skolko_slogov_v_str(input()) == 5:\r\n\tif skolko_slogov_v_str(input()) == 7:\r\n\t\tif skolko_slogov_v_str(input()) == 5:\r\n\t\t\tstatus =\"YES\"\r\n\r\nprint(status)", "a = input()\r\nb = input()\r\nc = input()\r\nx, y, z = 0, 0, 0\r\nfor ch in a:\r\n if ch in 'aeiou':\r\n x += 1\r\nfor ch in b:\r\n if ch in 'aeiou':\r\n y += 1\r\nfor ch in c:\r\n if ch in 'aeiou':\r\n z += 1\r\nif x == 5 and y == 7 and z == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "first = 0\r\nsecond = 0\r\nthird = 0\r\n\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\nfor cur in s1:\r\n if cur in \"aeiou\":\r\n first += 1\r\nfor cur in s2:\r\n if cur in \"aeiou\":\r\n second += 1\r\nfor cur in s3:\r\n if cur in \"aeiou\":\r\n third += 1 \r\n\r\nif first==5 and second==7 and third==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def countVowels(string) :\r\n vowels = \"aeiou\"\r\n count = 0\r\n for i in string:\r\n if i in vowels:\r\n count+=1\r\n return count\r\n \r\npoem = []\r\nfor i in range(3) :\r\n poem.append(input())\r\n \r\nisHaiku = True \r\nfor i in range(len(poem)) :\r\n temp = poem[i].lower()\r\n count = countVowels(temp)\r\n if i == 0 or i == 2 :\r\n if count == 5 :\r\n pass\r\n else: \r\n isHaiku = False\r\n break\r\n else :\r\n if count == 7 :\r\n pass\r\n else :\r\n isHaiku = False\r\n break\r\nprint(\"YES\" if isHaiku else \"NO\")", "a = str(input())\r\nb = str(input())\r\nc = str(input())\r\ndef fun(f):\r\n x = 0\r\n for i in range(0, len(f)):\r\n if f[i] == 'a'or f[i] == 'e' or f[i] == 'i'or f[i] == 'o' or f[i] == 'u':\r\n x+=1\r\n return x\r\nif fun(a) == 5 and fun(b) == 7 and fun(c) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "l=[0]*3\r\n\r\nfor i in range(3):\r\n n=input()\r\n l[i]=sum(n.count(x) for x in 'aeiou')\r\n\r\n \r\na,b,c=l \r\nprint('YES' if a==5 and b==7 and c==5 else 'NO')\r\n", "a,b,c=input(),input(),input()\r\ndef cnt(s):\r\n ans=0\r\n for e in s:\r\n ans+= e in \"aeiou\"\r\n return ans\r\nprint(\"YES\" if cnt(a)==cnt(c)==5 and cnt(b)==7 else \"NO\")\r\n", "s = input()\r\ns1 = input()\r\ns2 =input()\r\ncount = 0 \r\ncount1 =0\r\ncount2 =0 \r\nfor i in (s) : \r\n if i in [\"a\", \"e\", \"i\", \"o\" ,\"u\"] : \r\n count += 1 \r\nfor i in (s1) : \r\n if i in [\"a\", \"e\", \"i\", \"o\" ,\"u\"] : \r\n count1 += 1 \r\nfor i in (s2) : \r\n if i in [\"a\", \"e\", \"i\", \"o\" ,\"u\"] : \r\n count2 += 1 \r\nif count ==5 and count1 == 7 and count2 == 5 : \r\n print(\"YES\")\r\nelse : \r\n print(\"NO\")", "syllables = ['a','i','e','o','u']\r\nfor i in range(3):\r\n count=0\r\n sentence = input().strip().lower()\r\n for j in sentence:\r\n if (j in syllables):\r\n count+=1\r\n if i==0 and count!=5:\r\n print(\"NO\")\r\n break\r\n elif i==1 and count!=7:\r\n print(\"NO\")\r\n break\r\n elif i==2 and count!=5:\r\n print(\"NO\")\r\n elif i==2:\r\n print(\"YES\")\r\n", "#!/usr/bin/env python3 \r\n\r\nvowels = ['a', 'e', 'i', 'o', 'u']\r\n\r\nline1 = input()\r\nline2 = input()\r\nline3 = input()\r\n\r\ndef nr_vowels(line):\r\n return sum(line.count(letter) for letter in vowels)\r\n\r\nif (nr_vowels(line1) == 5) and (nr_vowels(line2) == 7) and (nr_vowels(line3) == 5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nk1=0\r\nk2=0\r\nk3=0\r\nfor i in range(len(s1)):\r\n if s1[i]=='a' or s1[i]=='e' or s1[i]=='i' or s1[i]=='o' or s1[i]=='u':\r\n k1=k1+1\r\nfor i in range(len(s2)):\r\n if s2[i]=='a' or s2[i]=='e' or s2[i]=='i' or s2[i]=='o' or s2[i]=='u':\r\n k2=k2+1\r\nfor i in range(len(s3)):\r\n if s3[i]=='a' or s3[i]=='e' or s3[i]=='i' or s3[i]=='o' or s3[i]=='u':\r\n k3=k3+1\r\nif k1==5 and k2==7 and k3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "ans = True\r\n\r\nfor i in range(3):\r\n s = input()\r\n t = s.count(\"a\")+s.count(\"e\")+s.count(\"i\")+s.count(\"o\")+s.count(\"u\")\r\n if t != [5,7,5][i]:\r\n ans = False\r\n\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def count_syllables(sent):\n vowels = 0\n for letter in sent:\n if (letter.lower() in ['a', 'e', 'i', 'o', 'u']):\n vowels += 1\n return vowels\n\n\nsent1 = input()\nsent2 = input()\nsent3 = input()\n\nif (count_syllables(sent1) == 5 and count_syllables(sent2) == 7 and count_syllables(sent3) == 5):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\t\t\t \t\t \t \t \t\t \t \t\t \t \t\t \t \t\t", "def syllables(s):\r\n return s.count(\"a\") + s.count(\"e\") + s.count(\"i\") + s.count(\"o\") + s.count(\"u\")\r\n\r\nphrase1 = input()\r\nphrase2 = input()\r\nphrase3 = input()\r\n\r\nif syllables(phrase1) == 5 and syllables(phrase2) == 7 and syllables(phrase3) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\ns2 = input()\ns3 = input()\nv = [\"a\", \"e\", \"i\", \"o\",\"u\"]\nisValid = True\nv1,v2,v3 = 0,0,0\nfor i in s1:\n if i in v:\n v1+=1\nfor i in s2:\n if i in v:\n v2+=1\nfor i in s3:\n if i in v:\n v3+=1\nif v1 != 5:\n isValid = False\nif v2 != 7:\n isValid = False\nif v3 != 5:\n isValid = False\n\nprint(\"YES\" if isValid else \"NO\")\n", "temp = [\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nl1 = input()\r\nl2 = input()\r\nl3 = input()\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\nfor i in range(len(l1)):\r\n if l1[i] in temp:\r\n c1 = c1+1\r\n \r\nfor j in range(len(l2)):\r\n if l2[j] in temp:\r\n c2= c2+1\r\n\r\nfor k in range(len(l3)):\r\n if l3[k] in temp:\r\n c3 = c3+1\r\n\r\nif (c1==5 and c2==7 and c3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "ans = [False] * 3\r\nfor i in range(3):\r\n line = input().lower()\r\n count = 0\r\n for char in line:\r\n if char in [\"a\", \"e\", \"i\", \"o\", \"u\"]:\r\n count += 1\r\n\r\n if (i != 1 and count == 5) or (i == 1 and count == 7):\r\n ans[i] = True\r\n\r\nif all(a for a in ans):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def countVowel(x):\r\n\tcnt = 0\r\n\tfor i in x:\r\n\t\tif i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n\t\t\tcnt+=1\r\n\treturn cnt\r\n\r\na = input()\r\nb = input()\r\nc = input().strip()\r\n\r\nflag = False\r\n\r\nif (countVowel(a)==5 and countVowel(b)==7 and countVowel(c)==5):\r\n\tflag = True\r\nelse:\r\n\tflag = False\r\n\r\nif flag:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "a, a1 = input(), 0\r\nb, b1 = input(), 0\r\nc, c1 = input(), 0\r\nd = ['a', 'e', 'i', 'o', 'u']\r\nfor i in a:\r\n\tif(i in d):\r\n\t\ta1 += 1\r\nfor i in b:\r\n\tif(i in d):\r\n\t\tb1 += 1\r\nfor i in c:\r\n\tif(i in d):\r\n\t\tc1 += 1\r\nif(a1 == 5 and b1 == 7 and c1 == 5):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\r\n", "res1=[5,7,5]\r\n\r\nres2=[]\r\nc=0\r\nfor i in range(3):\r\n \r\n res=list(input().strip().split())\r\n for it in res:\r\n for i in it:\r\n if i =='a' or i=='e' or i=='o' or i=='i' or i=='u':\r\n c=c+1\r\n res2.append(c)\r\n c=0\r\nif(res2==res1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n\r\n\r\n \r\n", "# from collections import defaultdict, deque, Counter\n# from sortedcontainers import SortedDict, SortedList, SortedSet\n# import bisect\n# from heapq import heappop, heappush\n# =======================================\n\nI = lambda : map(int, input().split())\n\n# ========================================\n\n# T = int(input())\n\nD = dict()\nD['purple'] = 'Power'\nD['green'] = 'Time'\nD['blue'] = 'Space'\nD['orange'] = 'Soul'\nD['red'] = 'Reality'\nD['yellow'] = 'Mind'\n\n\nfor _ in range(1):\n F = str(input())\n S = str(input())\n T = str(input())\n \n cf,sf,tf = 0,0,0\n for c in F:\n if c in 'aeiou':\n cf += 1\n for c in S:\n if c in 'aeiou':\n sf += 1\n for c in T:\n if c in 'aeiou':\n tf += 1\n \n if cf == 5 and sf == 7 and tf == 5:\n print('YES')\n else:\n print('NO')\n \n'''\n\n1 2 3 4 5 6\n\n\n'''\n", "def cnt(s):\n return s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')\ns1=input()\ns2=input()\ns3=input()\nprint('YES' if cnt(s1)==5 and cnt(s2)==7 and cnt(s3)==5 else 'NO')", "b=input()\r\nc=input()\r\nd=input()\r\nx1=b.count('a')+b.count('e')+b.count('i')+b.count('o')+b.count('u')\r\nx2=c.count('a')+c.count('e')+c.count('i')+c.count('o')+c.count('u')\r\nx3=d.count('a')+d.count('e')+d.count('i')+d.count('o')+d.count('u')\r\nif x1==5 and x2==7 and x3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "l = []\r\n\r\nfor _ in range(3):\r\n l.append(input())\r\n\r\nfor i in range(3):\r\n c = 0\r\n if i == 1:\r\n for j in l[i]:\r\n if j == 'a' or j == 'e' or j == 'i' or j == 'o' or j == 'u':\r\n c += 1\r\n\r\n if c != 7:\r\n print(\"NO\") \r\n break\r\n\r\n else:\r\n for j in l[i]:\r\n if j == 'a' or j == 'e' or j == 'i' or j == 'o' or j == 'u':\r\n c += 1\r\n\r\n if c != 5:\r\n print(\"NO\") \r\n break\r\nelse:\r\n print(\"YES\") ", "haiku = []\r\ncounter = [0, 0, 0]\r\nvowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\n\r\nfor i in range(3):\r\n\thaiku.append(input().split())\r\n\r\nfor i in range(3):\r\n\tfor j in list(\"\".join(haiku[i])):\r\n\t\tif j in vowels:\r\n\t\t\tcounter[i] += 1\r\n\r\nif counter == [5, 7, 5]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "\n\ndef vowels(pt):\n n = 0\n for symbol in pt.lower():\n if symbol in 'aeiou':\n n += 1\n return n\n\npart1 = input()\npart2 = input()\npart3 = input()\n\nif vowels(part1) == 5 and vowels(part2) == 7 and vowels(part3) == 5:\n print('YES')\nelse:\n print('NO')\n\n", "import re\r\n \r\nprint(['NO', 'YES'][[len(re.findall(r'[aeiou]', item)) for item in [input() for i in range(3)]] == [5, 7, 5]])", "string=str(input())\nstring_1=str(input())\nstring_2=str(input())\na=0;b=0;c=0\nfor i in range(len(string)):\n if(\"a\" in string[i] or \"e\" in string[i] or \"i\" in string[i] or \"o\" in string[i] or \"u\" in string[i]):\n a=a+1\nfor i in range(len(string_1)):\n if(\"a\" in string_1[i] or \"e\" in string_1[i] or \"i\" in string_1[i] or \"o\" in string_1[i] or \"u\" in string_1[i]):\n b=b+1\nfor i in range(len(string_2)):\n if(\"a\" in string_2[i] or \"e\" in string_2[i] or \"i\" in string_2[i] or \"o\" in string_2[i] or \"u\" in string_2[i]):\n c=c+1\nif(a==5 and b==7 and c==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t \t \t \t\t\t \t \t\t \t \t \t", "l1 = input()\r\nl2 = input()\r\nl3 = input()\r\nhaiku = [l1, l2, l3]\r\n# print(haiku)\r\nfor line in haiku:\r\n count = 0\r\n for c in line:\r\n if c=='a' or c=='e' or c=='i' or c=='o' or c=='u':\r\n count+=1\r\n if (line==haiku[0] and count > 5) or (line==haiku[0] and count < 5):\r\n print(\"NO\")\r\n break\r\n elif (line==haiku[1] and count > 7) or (line==haiku[1] and count < 7):\r\n print(\"NO\")\r\n break\r\n elif (line==haiku[2] and count > 5) or (line==haiku[2] and count < 5):\r\n print(\"NO\")\r\n break\r\n\r\nif count == 5:\r\n print(\"YES\")", "vocals = ['a', 'e', 'i', 'o', 'u']\r\n\r\ndef f(x):\r\n s = 0\r\n for i in range(5):\r\n s += x.count(vocals[i])\r\n return s\r\n\r\ndef g(s):\r\n A = []\r\n for i in range(len(s)):\r\n A.append(s[i])\r\n return A\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\na = g(a)\r\nb = g(b)\r\nc = g(c)\r\n\r\nif f(a) == 5 and f(b) == 7 and f(c) == 5:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "l = [ ]\r\nfor i in range(3):\r\n l.append(input())\r\ni = 0\r\nk = 0\r\nh = 0\r\nfor j in range(3):\r\n for i in range(len(l[j])):\r\n if ( l[j][i] == \"a\" ) or ( l[j][i] == \"e\" ) or ( l[j][i] == \"i\" ) or ( l[j][i] == \"o\" ) or ( l[j][i] == \"u\" ) :\r\n k += 1\r\n if ((j == 0)or(j == 2)) and (k == 5) :\r\n h += 1\r\n if j == 1 and k == 7 :\r\n h += 1\r\n k = 0\r\nif h == 3 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\ndef counter(d):\r\n count=0\r\n for i in range(len(d)):\r\n if d[i]=='a' or d[i]=='e' or d[i]=='i' or d[i]=='o' or d[i]=='u':\r\n count+=1\r\n return count\r\nif counter(a)==5 and counter(b)==7 and counter(c)==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "vowels = set('aeiou')\r\ncount = lambda: sum(1 for c in input() if c in vowels)\r\nprint('YES' if count() == 5 and count() == 7 and count() == 5 else 'NO')\r\n", "w = 'aeiou'\r\ns = ''\r\na = []\r\nfor i in range(3):\r\n s = input()\r\n r = 0\r\n for j in w: r += s.count(j)\r\n a += [r]\r\nif a == [5, 7, 5]:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = ''.join(input().split())\r\na = 0\r\nfor i in n:\r\n if i == 'a' or i == 'o' or i == 'u' or i == 'e' or i == 'i':\r\n a += 1\r\nn = ''.join(input().split())\r\nc = 0\r\nfor i in n:\r\n if i == 'a' or i == 'o' or i == 'u' or i == 'e' or i == 'i':\r\n c += 1\r\nn = ''.join(input().split())\r\nb = 0\r\nfor i in n:\r\n if i == 'a' or i == 'o' or i == 'u' or i == 'e' or i == 'i':\r\n b += 1\r\nif a == 5 and c == 7 and b == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "cont=[]\r\nfor i in range(0,3):\r\n a=input()\r\n vo=0\r\n for x in \"aeiou\":\r\n vo=vo+a.count(x)\r\n cont.append(vo)\r\n\r\nif cont == [5,7,5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=list(input())\r\nm=list(input())\r\nn=list(input())\r\nl1=l.count('a')+l.count('e')+l.count('i')+l.count('o')+l.count('u')\r\nl2=m.count('a')+m.count('e')+m.count('i')+m.count('o')+m.count('u')\r\nl3=n.count('a')+n.count('e')+n.count('i')+n.count('o')+n.count('u')\r\nif(l1==5 and l2==7 and l3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l='aeiou'\r\nn=input()\r\nn2=input()\r\nn3=input()\r\nd=' '\r\ne=' '\r\nf=' '\r\nlo=''\r\ndo=[]\r\nfor i in n:\r\n if i in l:\r\n d+=i\r\nfor j in n2:\r\n if j in l:\r\n e+=j\r\nfor m in n3:\r\n if m in l:\r\n f+=m\r\nif len(d)==6 and len(e)==8 and len(f)==6:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "x = 0\r\nl1 = list(input())\r\nif l1.count('a') + l1.count('e') + l1.count('i') + l1.count('o') + l1.count('u') != 5:\r\n x = 1\r\nl2 = list(input())\r\nif l2.count('a') + l2.count('e') + l2.count('i') + l2.count('o') + l2.count('u') != 7:\r\n x = 1\r\nl3 = list(input())\r\nif l3.count('a') + l3.count('e') + l3.count('i') + l3.count('o') + l3.count('u') != 5:\r\n x = 1\r\nif x == 0:\r\n print('YES')\r\nif x == 1:\r\n print('NO')\r\n", "def sum(s):\r\n sum_s1 = 0\r\n L = ['a','e','i','o','u']\r\n for i in s:\r\n if i in L:\r\n sum_s1 += 1\r\n \r\n return sum_s1\r\n\r\n\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\n\r\nsum_s1 = sum(s1)\r\nsum_s2 = sum(s2)\r\nsum_s3 = sum(s3)\r\nif(sum_s1 == 5 and sum_s2 == 7 and sum_s3 == 5):\r\n print('YES')\r\nelse:\r\n print('NO')", "x = list(input())\r\ny = list(input())\r\nz = list(input())\r\n# a e i o u\r\n\r\na1 = x.count('a')\r\na2 = y.count('a')\r\na3 = z.count('a')\r\nb1 = x.count('e')\r\nb2 = y.count('e')\r\nb3 = z.count('e')\r\nc1 = x.count('i')\r\nc2 = y.count('i')\r\nc3 = z.count('i')\r\nd1 = x.count('o')\r\nd2 = y.count('o')\r\nd3 = z.count('o')\r\ne1 = x.count('u')\r\ne2 = y.count('u')\r\ne3 = z.count('u')\r\n\r\na = a1+b1+c1+d1+e1\r\nb = a2+b2+c2+d2+e2\r\nc = a3+b3+c3+d3+e3\r\n\r\nif a == 5 and b == 7 and c == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=str(input())\ns1=str(input())\ns2=str(input())\nsum=0\ncount=0\nf=0\nfor i in range(0,len(s),1):\n if(s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u'):\n count+=1\nfor i in range(0,len(s1),1):\n if(s1[i]=='a' or s1[i]=='e' or s1[i]=='i' or s1[i]=='o' or s1[i]=='u'):\n sum+=1\nfor i in range(0,len(s2),1):\n if(s2[i]=='a' or s2[i]=='e' or s2[i]=='i' or s2[i]=='o' or s2[i]=='u'):\n f+=1\nif(count==5 and sum==7 and f==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t \t\t \t\t\t\t \t \t \t \t\t\t", "\r\nfor i in range(3):\r\n n=input()\r\n n=n.strip()\r\n n=n.split()\r\n count=0\r\n for j in n:\r\n count+=j.count('a')+j.count('e')+j.count('i')+j.count('o')+j.count('u')\r\n \r\n if i%2==0 and count!=5:\r\n print(\"NO\")\r\n break\r\n if i%2!=0 and count!=7:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "a=input().split()\r\nb=input().split()\r\nc=input().split()\r\nt=0\r\nt1=0\r\nt2=0\r\nfor j in a:\r\n for i in j:\r\n #print(i)\r\n if i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n t+=1\r\nfor j in b:\r\n for i in j:\r\n #print(i)\r\n if i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n t1+=1\r\nfor j in c:\r\n for i in j:\r\n #print(i)\r\n if i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n t2+=1\r\n#print(t,t1,t2)\r\nif(t==5 and t1==7 and t2==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def check(g,m):\r\n c=0\r\n for i in g:\r\n if i in ['a','e','i','o','u']:\r\n c+=1\r\n return 1 if c==m else 0\r\ndef main():\r\n mode=\"filee\"\r\n if mode==\"file\":f=open(\"test.txt\",\"r\")\r\n get = lambda :[int(x) for x in (f.readline() if mode==\"file\" else input()).split()]\r\n g=[]\r\n for i in range(3):\r\n g.append(input())\r\n if check(g[0],5) == 1 and check(g[1],7) == 1 and check(g[2],5) == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n if mode==\"file\":f.close()\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n\r\n", "def count(a):\n c=0\n for i in a:\n if i in ('a','e','u','i','o'):c+=1\n return c\n\nprint(\"YES\" if count(input())==5 and count(input())==7 and count(input())==5 else \"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\ncount1=0\r\ncount2=0\r\ncount3=0\r\nfor i in range (len(a)):\r\n if a[i]==\"a\":\r\n count1+=1\r\n if a[i]==\"e\":\r\n count1+=1\r\n if a[i]==\"i\":\r\n count1+=1\r\n if a[i]==\"o\":\r\n count1+=1\r\n if a[i]==\"u\":\r\n count1+=1\r\nfor i in range (len(b)):\r\n if b[i]==\"a\":\r\n count2+=1\r\n if b[i]==\"e\":\r\n count2+=1\r\n if b[i]==\"i\":\r\n count2+=1\r\n if b[i]==\"o\":\r\n count2+=1\r\n if b[i]==\"u\":\r\n count2+=1\r\nfor i in range (len(c)):\r\n if c[i]==\"a\":\r\n count3+=1\r\n if c[i]==\"e\":\r\n count3+=1\r\n if c[i]==\"i\":\r\n count3+=1\r\n if c[i]==\"o\":\r\n count3+=1\r\n if c[i]==\"u\":\r\n count3+=1\r\nif count1==5 and count2==7 and count3==5:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "def is_haiku(a,b,c):\r\n count=0\r\n for i in range(len(a)):\r\n if a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u':\r\n count=count+1\r\n if count>5:\r\n print(\"NO\")\r\n return \r\n\r\n if count!=5:\r\n print(\"NO\")\r\n return\r\n\r\n count=0\r\n for i in range(len(b)):\r\n if b[i]=='a' or b[i]=='e' or b[i]=='i' or b[i]=='o' or b[i]=='u':\r\n count=count+1\r\n if count>7:\r\n print(\"NO\")\r\n return \r\n\r\n if count!=7:\r\n print(\"NO\")\r\n return\r\n \r\n count=0\r\n for i in range(len(c)):\r\n if c[i]=='a' or c[i]=='e' or c[i]=='i' or c[i]=='o' or c[i]=='u':\r\n count=count+1\r\n if count>5:\r\n print(\"NO\")\r\n return \r\n\r\n if count!=5:\r\n print(\"NO\")\r\n return\r\n\r\n print(\"YES\")\r\n\r\na=input('')\r\nb=input('')\r\nc=input('')\r\nis_haiku(list(a),list(b),list(c))", "s1 = ''.join(filter(lambda x: x.lower() in 'aiueo', input()))\r\ns2 = ''.join(filter(lambda x: x.lower() in 'aiueo', input()))\r\ns3 = ''.join(filter(lambda x: x.lower() in 'aiueo', input()))\r\n\r\nif len(s1) == 5 and len(s2) == 7 and len(s3) == 5 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def cnt(s):\r\n return s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')\r\nst1=input()\r\nst2=input()\r\nst3=input()\r\nif cnt(st1)==5 and cnt(st2)==7 and cnt(st3)==5:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "print('YES' if len([i for i in input() if i in 'aeiou']) == 5 and len([i for i in input() if i in 'aeiou']) == 7 and len([i for i in input() if i in 'aeiou']) == 5 else 'NO')", "a=input();b=input();c=input();c1,c2,c3=0,0,0;d={'a':0,'e':0,'i':0,'o':0,'u':0}\r\nfor i in a:\r\n\tif i in d:c1+=1\r\nfor i in b:\r\n\tif i in d:c2+=1\r\nfor i in c:\r\n\tif i in d:c3+=1\r\nif c1==c3==5 and c2==7:print('YES')\r\nelse:print('NO')", "a,b,c=input(),input(),input()\r\nv=['a','e','i','o','u']\r\np1,p2,p3=0,0,0\r\nfor i in a:\r\n if i in v:\r\n p1+=1\r\nfor i in b:\r\n if i in v:\r\n p2+=1\r\nfor i in c:\r\n if i in v:\r\n p3+=1\r\nif p1==5 and p2==7 and p3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l = 'aeiou'\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\nca, cb, cc = 0, 0, 0\r\nfor i in a:\r\n if i in l:\r\n ca += 1\r\nfor i in b:\r\n if i in l:\r\n cb += 1\r\nfor i in c:\r\n if i in l:\r\n cc += 1\r\nif ca != 5 or cb != 7 or cc != 5:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "for i in range(0, 3):\n s = input()\n count = 0\n for j in range(0, len(s)):\n if s[j] == \"a\" or s[j] == \"e\" or s[j] == \"i\" or s[j] == \"o\" or s[j] == \"u\":\n count += 1\n if (i == 1 and count != 7) or (i != 1 and count != 5):\n print(\"NO\")\n exit()\n\nprint(\"YES\")", "\r\nline1 = input()\r\nline2 = input()\r\nline3 = input()\r\nena = (line1.count('a') + line1.count('e') + line1.count('i') + line1.count('o') + line1.count('u')) == 5\r\nduo = (line2.count('a') + line2.count('e') + line2.count('i') + line2.count('o') + line2.count('u')) == 7\r\ntria = (line3.count('a') + line3.count('e') + line3.count('i') + line3.count('o') + line3.count('u')) == 5\r\n\r\nif (ena and duo and tria):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nk = [\"a\", \"e\", \"i\", \"o\",\"u\"]\r\nl=0\r\nfor i in a:\r\n for j in k:\r\n if i==j:\r\n l+=1\r\nm=0\r\nfor i in b:\r\n for j in k:\r\n if i==j:\r\n m+=1\r\nq=0\r\nfor i in c:\r\n for j in k:\r\n if i==j:\r\n q+=1\r\nif (l==5 and m==7 and q==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from re import sub\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\n\r\na = sub(r'[aeiou]', '-', a)\r\nb = sub(r'[aeiou]', '-', b)\r\nc = sub(r'[aeiou]', '-', c)\r\n\r\nx = a.count('-') == 5 and b.count('-') == 7 and c.count('-') == 5\r\nprint('YES' if x else 'NO')\r\n", "x = str(input())\r\ny = str(input())\r\nz = str(input())\r\n\r\nv = [ \"a\", \"e\", \"i\", \"o\",\"u\"]\r\ncount_x = 0\r\ncount_y = 0\r\ncount_z = 0\r\nfor i in v:\r\n for j in x:\r\n if i == j :\r\n count_x += 1\r\n\r\n for j in y:\r\n if i == j :\r\n count_y += 1\r\n\r\n for j in z:\r\n if i == j :\r\n count_z += 1\r\n\r\nif count_x == 5 and count_y == 7 and count_z ==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "gl=\"aeiou\"\r\na=list(map(str,input().split()))\r\nb=list(map(str,input().split()))\r\nc=list(map(str,input().split()))\r\nt=[]\r\ns=0\r\nfor i in a:\r\n for j in i:\r\n if j in gl:\r\n s+=1\r\nt+=[s]\r\ns=0\r\nfor k in b:\r\n for l in k:\r\n if l in gl:\r\n s+=1\r\nt+=[s]\r\ns=0\r\nfor m in c:\r\n for n in m:\r\n if n in gl:\r\n s+=1\r\nt+=[s]\r\ns=0\r\nif t[0]==5 and t[1]==7 and t[2]==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nc0 = 0\r\nc1 = 0\r\nc2 = 0\r\n\r\n\r\nl = ['a', 'i', 'o', 'u', 'e']\r\nfor i in l:\r\n for j in s1:\r\n if i == j:\r\n c0 += 1\r\nif c0 != 5:\r\n print('NO')\r\n exit()\r\n \r\nfor i in l:\r\n for j in s2:\r\n if i == j:\r\n c1 += 1\r\nif c1 != 7:\r\n print('NO')\r\n exit()\r\n \r\nfor i in l:\r\n for j in s3:\r\n if i == j:\r\n c2 += 1\r\nif c2 != 5:\r\n print('NO')\r\n exit()\r\n \r\nelse:\r\n print('YES')\r\n \r\n\r\n ", "def count_vowels(s):\r\n return sum(1 for c in s if c in 'aeiou')\r\n\r\ns1 = input().strip()\r\ns2 = input().strip()\r\ns3 = input().strip()\r\n\r\nif count_vowels(s1) == 5 and count_vowels(s2) == 7 and count_vowels(s3) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\ncnt=0\r\ncnd=0\r\ncnu=0\r\nd=['a', 'e', 'i', 'o', 'u']\r\n\r\nfor i in a:\r\n if i in d:\r\n cnt+=1\r\nfor j in b:\r\n if j in d:\r\n cnd+=1\r\nfor k in c:\r\n if k in d:\r\n cnu+=1\r\nif cnt==5 and cnd==7 and cnu==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = str(input())\nb = str(input())\nc = str(input())\n\ndef isVowel(ch):\n return ch.lower() in ['a','e','i','o','u']\n\ndef countVowels(string):\n count = 0\n for i in range(len(string)):\n if isVowel(string[i]):\n count+=1\n return count\n\nif (countVowels(a)==5 and countVowels(b)==7 and countVowels(c)==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nnum = [5, 7, 5]\r\nres = True\r\nfor i in range(3):\r\n s = input()\r\n cnt = 0\r\n for c in s:\r\n cnt += c in 'aeiou'\r\n if cnt != num[i]:\r\n res = False\r\nprint('YES' if res else 'NO')", "s1=input()\r\ns2=input()\r\ns3=input()\r\ncount1=s1.count('a')+s1.count('e')+s1.count('i')+s1.count('o')+s1.count('u')\r\ncount2=s2.count('a')+s2.count('e')+s2.count('i')+s2.count('o')+s2.count('u')\r\ncount3=s3.count('a')+s3.count('e')+s3.count('i')+s3.count('o')+s3.count('u')\r\nif count1==5 and count2==7 and count3==5: \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "vowels = {\"a\", \"e\", \"i\", \"o\",\"u\"}\r\ndef count(s):\r\n c = 0\r\n for i in s:\r\n if(i in vowels):\r\n c += 1\r\n return c\r\nl1 = count(input())\r\nl2 = count(input())\r\nl3 = count(input())\r\n\r\nif(l1 == 5 and l3 == 5 and l2 == 7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nw = set(list(\"aeiou\"))\r\nx = [5, 7, 5]\r\nans = \"YES\"\r\nfor i in range(3):\r\n s = list(input().rstrip())\r\n c = 0\r\n for j in s:\r\n if j in w:\r\n c += 1\r\n if c ^ x[i]:\r\n ans = \"NO\"\r\nprint(ans)", "l = [\"a\", \"e\", \"u\", \"o\", \"i\"]\r\nfor i in range(3):\r\n s = input()\r\n if i == 1:\r\n if s.count(l[0]) + s.count(l[1]) + s.count(l[2]) + s.count(l[3]) + s.count(l[4]) != 7:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n if s.count(l[0]) + s.count(l[1]) + s.count(l[2]) + s.count(l[3]) + s.count(l[4]) != 5:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "# ===============================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===============================\r\nimport math, fractions\r\n# ===============================\r\ns = \"\"\r\nfor _ in range(3):\r\n\tx = str(input())\r\n\ts += str(sum([1 for vowel in x if vowel in \"aiueo\"]))\r\nprint(\"YES\" if s == \"575\" else \"NO\")", "import sys, math\r\n\r\ninput=sys.stdin.readline\r\n\r\np = []\r\nfor i in range(3):\r\n l = input().rstrip(\"\\n\")\r\n k = 0\r\n for i in l:\r\n if i in \"aeiou\":\r\n k += 1\r\n p.append(k)\r\nprint(\"YES\" if p == [5, 7, 5] else \"NO\")", "a,b,c=[input(),input(),input()]\r\np={'a','e','i','o','u'}\r\nans=0\r\nfor i in a:\r\n if i in p:\r\n ans+=1\r\nif ans!=5:\r\n print('NO')\r\n exit()\r\nans=0\r\nfor i in b:\r\n if i in p:\r\n ans+=1\r\nif ans!=7:\r\n print('NO')\r\n exit()\r\nans=0\r\nfor i in c:\r\n if i in p:\r\n ans+=1\r\nif ans!=5:\r\n print('NO')\r\n exit()\r\nprint('YES')", "import sys\r\ndata = sys.stdin.readlines()\r\np1 = data[0].strip()\r\np2 = data[1].strip()\r\np3 = data[2].strip()\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\ncheck = False\r\nfor ch in p1:\r\n if ch in 'aeiou':\r\n c1 += 1\r\nif c1 == 5:\r\n for ch in p2:\r\n if ch in 'aeiou':\r\n c2 += 1\r\nif c2 == 7:\r\n for ch in p3:\r\n if ch in 'aeiou':\r\n c3 += 1\r\nif c3 == 5:\r\n check = True\r\nif check == True:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "vowels = set(['a', 'e', 'i', 'o', 'u'])\r\n\r\n\r\ndef occ(string, chars):\r\n cnt = 0\r\n for char in string:\r\n if char in chars:\r\n cnt += 1\r\n return cnt\r\n\r\n\r\ns = [input() for i in range(3)]\r\n\r\nif [occ(s[i], vowels) for i in range(3)] == [5, 7, 5]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "d = input()\r\nb = input()\r\nc = input()\r\n\r\nif d.count('a') + d.count('e') + d.count('i') + d.count('u') + d.count('o') == 5 and b.count('a') + b.count('e') + b.count('i') + b.count('u') + b.count('o') == 7 and c.count('a') + c.count('e') + c.count('i') + c.count('u') + c.count('o') == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "lst=['a','e','i','o','u']\r\na=0\r\ns=0\r\nfor i in range(3):\r\n x=input()\r\n for j in range(5):\r\n a+=x.count(lst[j]) \r\n if i==0 or i==2:\r\n if a!=5:\r\n s+=1\r\n else:\r\n if a!=7:\r\n s+=1\r\n a=0 \r\nprint(['NO','YES'][s==0])\r\n", "print('NYOE S'[[sum(i in'aeiou'for i in input())for f in\"012\"]==[5,7,5]::2])", "s1=input()\r\ns2=input()\r\ns3=input()\r\nno_s1=0\r\nno_s2=0\r\nno_s3=0\r\nfor i in range(len(s1)):\r\n if(s1[i]==\"a\" or s1[i]==\"e\" or s1[i]==\"i\" or s1[i]==\"o\" or s1[i]==\"u\"):\r\n no_s1=no_s1+1 \r\nfor i in range(len(s2)):\r\n if(s2[i]==\"a\" or s2[i]==\"e\" or s2[i]==\"i\" or s2[i]==\"o\" or s2[i]==\"u\"):\r\n no_s2=no_s2+1 \r\nfor i in range(len(s3)):\r\n if(s3[i]==\"a\" or s3[i]==\"e\" or s3[i]==\"i\" or s3[i]==\"o\" or s3[i]==\"u\"):\r\n no_s3=no_s3+1 \r\nif(no_s3==5 and no_s2==7 and no_s1==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str1 = input()\r\nstr2 = input()\r\nstr3 = input()\r\n\r\ncnt1 = 0\r\ncnt2 = 0\r\ncnt3 = 0\r\n\r\nfor i in str1:\r\n if i in ['a', 'e', 'i', 'o', 'u' ]:\r\n cnt1 += 1\r\nfor i in str2:\r\n if i in ['a', 'e', 'i', 'o', 'u' ]:\r\n cnt2 += 1\r\nfor i in str3:\r\n if i in ['a', 'e', 'i', 'o', 'u' ]:\r\n cnt3 += 1\r\nif (cnt1 == 5 and cnt2 == 7 and cnt3 == 5):\r\n print('YES')\r\nelse:\r\n print('NO')", "from sys import stdin, stdout\r\n\r\n\r\ndef count(s):\r\n return s.count('i') + s.count('e') + s.count('u') + s.count('a') + s.count('o')\r\n\r\n\r\nfirst, second, third = stdin.readline().strip(), stdin.readline().strip(), stdin.readline().strip()\r\n\r\nif count(first) == 5 and count(second) == 7 and count(third) == 5:\r\n stdout.write('YES')\r\nelse:\r\n stdout.write('NO')", "a = input()\r\nb = input()\r\nc = input()\r\n\r\nis_haiku = True\r\ncount = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i] in {'a', 'e', 'i', 'o', 'u'}:\r\n count += 1\r\nif count != 5:\r\n is_haiku = False\r\n\r\ncount = 0\r\n\r\nfor i in range(len(b)):\r\n if b[i] in {'a', 'e', 'i', 'o', 'u'}:\r\n count += 1\r\nif count != 7:\r\n is_haiku = False\r\n\r\ncount = 0 \r\n\r\nfor i in range(len(c)):\r\n if c[i] in {'a', 'e', 'i', 'o', 'u'}:\r\n count += 1\r\nif count != 5:\r\n is_haiku = False\r\n\r\nif is_haiku:\r\n print(\"YES\")\r\nif not is_haiku:\r\n print(\"NO\")", "def nihar(s):\r\n c=0\r\n c=c+s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')\r\n return c\r\ns1=input()\r\ns2=input()\r\ns3=input()\r\nk1=nihar(s1)\r\nk2=nihar(s2)\r\nk3=nihar(s3)\r\nif k1==5 and k2==7 and k3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "'''\nhttps://codeforces.com/problemset/problem/78/A\n'''\n\nrules = [5, 7, 5]\nsyllabes_num = []\n\nfor _ in range(3):\n phrase = input()\n syllabes_num.append(sum([*map(phrase.lower().count, \"aeiou\")]))\n\nif rules == syllabes_num:\n print('YES')\nelse:\n print('NO')\n\n\n\n\n\n", "d = {0:5, 1:7, 2:5}\r\nres= \"YES\"\r\nfor i in range(3):\r\n ans = 0\r\n s = input()\r\n for k in s:\r\n if k in \"aeiou\":\r\n ans+=1\r\n if ans != d[i]:\r\n res = \"NO\"\r\nprint(res)", "from sys import stdin\r\n\r\nvowels = 'aeiou'\r\n\r\nfor i in range(3):\r\n line = stdin.readline()\r\n count = 0\r\n for char in line:\r\n if char in vowels:\r\n count +=1\r\n if(i==0 or i==2):\r\n if(count!=5):\r\n print(\"NO\")\r\n exit()\r\n if(i==1):\r\n if(count != 7):\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\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 ###############################\na = input()\nb = input()\nc = input()\nv = ['a', 'i', 'e', 'o', 'u']\ncnt = [5, 7, 5]\nprint(\"YES\" if [sum(a.count(x) for x in v),\n sum(b.count(x) for x in v),\n sum(c.count(x) for x in v)] == cnt\n else \"NO\"\n )\n", "a = [\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nq =\"\"\r\nfor i in range(3):\r\n\ts =0\r\n\tz = input()\r\n\tfor i in z:\r\n\t\tif i.isalpha():\r\n\t\t\tif i in a:s+=1\r\n\tq+=str(s)\r\n\r\nif q ==\"575\":print(\"YES\")\r\nelse:print(\"NO\")", "line1 = input()\r\nline2 = input()\r\nline3 = input()\r\ncount1 = 0\r\ncount2 = 0\r\ncount3 = 0\r\nfor i in line1:\r\n if i==\"a\" or i=='e' or i=='i' or i=='o' or i=='u':\r\n count1+=1\r\nfor i in line2:\r\n if i==\"a\" or i=='e' or i=='i' or i=='o' or i=='u':\r\n count2+=1\r\nfor i in line3:\r\n if i==\"a\" or i=='e' or i=='i' or i=='o' or i=='u':\r\n count3+=1\r\nif count1==5 and count2==7 and count3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def isvowel(x):\r\n ans = False\r\n if x == 'a' or x == 'e' or x == 'i' or x == 'o' or x == 'u':\r\n ans = True\r\n return ans \r\na = input()\r\nb = input()\r\nc = input()\r\nA = []\r\nB = []\r\nC = []\r\nans = 'NO'\r\nfor t in a:\r\n if isvowel(t):\r\n A.append(t)\r\nfor t in b:\r\n if isvowel(t):\r\n B.append(t)\r\nfor t in c:\r\n if isvowel(t):\r\n C.append(t)\r\nif len(A) == 5 and len(B) == 7 and len(C) == 5:\r\n ans = 'YES'\r\nprint(ans) \r\n ", "\r\ndef solve():\r\n a = [input().split() for _ in range(3)]\r\n v = 'aeiou'\r\n ans = []\r\n for s in a:\r\n cnt = 0\r\n for w in s:\r\n for c in w:\r\n if c in v:\r\n cnt += 1\r\n ans.append(cnt)\r\n if ans[0] == 5 and ans[1] == 7 and ans[2] == 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nfor _ in range(1):\r\n solve()", "pha_1=input().strip()\r\npha_2=input().strip()\r\npha_3=input().strip()\r\ndef count_vowels(word):\r\n vowel_letter=\"aeiou\"\r\n return sum(1 for letter in word if letter in vowel_letter)\r\ndef is_haiku_phrase(phrase,exp_syll):\r\n syllables = count_vowels(phrase)\r\n return syllables == exp_syll\r\nif is_haiku_phrase(pha_1,5) and is_haiku_phrase(pha_2,7) and is_haiku_phrase(pha_3,5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = []\r\nvowels = ['a', 'e', 'i', 'o', 'u']\r\nfor i in range(3):\r\n n = input()\r\n if i == 0 or i == 2:\r\n count = 0\r\n for j in n:\r\n if j in vowels:\r\n count += 1\r\n a.append(count)\r\n if i == 1:\r\n count = 0\r\n for j in n:\r\n if j in vowels:\r\n count += 1\r\n a.append(count)\r\nif a == [5, 7, 5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "x = (input())\r\ny = (input())\r\nz = (input())\r\n\r\nk = 0\r\n\r\na = 0\r\ne = 0\r\ni = 0\r\no = 0\r\nu = 0\r\n\r\na+=x.count('a')\r\ne+=x.count('e')\r\ni+=x.count('i')\r\no+=x.count('o')\r\nu+=x.count('u')\r\n\r\nc = a+e+i+o+u\r\n\r\nif c == 5:\r\n k+=1\r\n \r\nc = 0\r\n\r\na = 0\r\ne = 0\r\ni = 0\r\no = 0\r\nu = 0\r\n\r\na+=y.count('a')\r\ne+=y.count('e')\r\ni+=y.count('i')\r\no+=y.count('o')\r\nu+=y.count('u')\r\n\r\nc = a+e+i+o+u\r\n\r\nif c == 7:\r\n k+=1\r\n\r\nc = 0\r\n\r\na = 0\r\ne = 0\r\ni = 0\r\no = 0\r\nu = 0\r\n\r\na+=z.count('a')\r\ne+=z.count('e')\r\ni+=z.count('i')\r\no+=z.count('o')\r\nu+=z.count('u')\r\n\r\nc = a+e+i+o+u\r\n\r\nif c == 5:\r\n k+=1\r\n\r\nprint('YES' if k==3 else 'NO')\r\n\r\n", "def countVowels(s):\r\n\tcnt = 0\r\n\tfor i in s:\r\n\t\tif i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n\t\t\tcnt += 1\r\n\treturn cnt\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\nif countVowels(s1) == 5 and countVowels(s2) == 7 and countVowels(s3) == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "c1 = 0\r\nc2 = 0\r\nc3 = 0\r\n\r\ns1 = input().lower()\r\ns2 = input().lower()\r\ns3 = input().lower()\r\n\r\nfor i in s1 :\r\n if i == 'a' or i == 'e' or i == 'o'or i == 'i' or i == 'u':\r\n c1 +=1\r\n\r\nfor i in s2:\r\n if i == 'a' or i == 'e' or i == 'o' or i == 'i' or i == 'u':\r\n c2 += 1\r\n\r\nfor i in s3:\r\n if i == 'a' or i == 'e' or i == 'o' or i == 'i' or i == 'u':\r\n c3 += 1\r\n\r\n\r\nif c1 == 5 and c2 == 7 and c3 == 5 :\r\n print('YES')\r\n exit(0)\r\nelse:\r\n print('NO')\r\n exit(0)\r\n\r\n", "word = []\r\nfor i in range(3):\r\n word.append(input())\r\n \r\nvowels = ['a','e','i','o','u']\r\nsyllables=[5,7,5]\r\n\r\nflag=0\r\n\r\nfor i in range(len(word)):\r\n count=0\r\n for j in (word[i]):\r\n if j in vowels:\r\n count+=1\r\n if count !=syllables[i]:\r\n flag=1\r\n break\r\n \r\nif flag==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nx=0\r\ny=0\r\nz=0\r\nfor i in a:\r\n if(i in 'aeiou'):\r\n z+=1\r\nfor j in b:\r\n if(j in 'aeiou'):\r\n y+=1\r\nfor k in c:\r\n if(k in 'aeiou'):\r\n x+=1\r\nif(x==5 and y==7 and z==5):\r\n print('YES')\r\nelse:\r\n print('NO')", "p1=input()\r\np2=input()\r\np3=input()\r\nc1=c2=c3=0\r\nfor i in p1.strip():\r\n if i in ['a','e','i','o','u']:\r\n c1+=1\r\nfor i in p2.strip():\r\n if i in ['a','e','i','o','u']:\r\n c2+=1\r\nfor i in p3.strip():\r\n if i in ['a','e','i','o','u']:\r\n c3+=1\r\nif c1==5 and c2==7 and c3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "f = input().strip().split()\r\ns = input().strip().split()\r\nt = input().strip().split()\r\n\r\nv = ['a','e','i','o','u']\r\n\r\nfc = 0\r\nfor i in f:\r\n\tfor j in i:\r\n\t\tif j in v:\r\n\t\t\tfc += 1\r\nsc = 0\r\nfor i in s:\r\n\tfor j in i:\r\n\t\tif j in v:\r\n\t\t\tsc += 1\r\n\r\ntc = 0\r\nfor i in t:\r\n\tfor j in i:\r\n\t\tif j in v:\r\n\t\t\ttc += 1\r\n\r\nif fc == 5 and sc == 7 and tc == 5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "def count_vowels(phrase):\r\n vowels = \"aeiou\"\r\n return sum(1 for char in phrase if char in vowels)\r\n\r\ndef is_haiku(phrase1, phrase2, phrase3):\r\n syllable_counts = [count_vowels(phrase1), count_vowels(phrase2), count_vowels(phrase3)]\r\n\r\n if syllable_counts == [5, 7, 5]:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Read input\r\nphrase1 = input().strip()\r\nphrase2 = input().strip()\r\nphrase3 = input().strip()\r\n\r\nresult = is_haiku(phrase1, phrase2, phrase3)\r\nprint(result)\r\n", "def main():\r\n v = set(['a', 'e', 'i', 'o', 'u'])\r\n\r\n ss = []\r\n for _ in range(3):\r\n ss.append(input().strip())\r\n\r\n cs = [0 for _ in range(3)]\r\n\r\n for i in range(3):\r\n c = 0\r\n for e in ss[i]:\r\n if e in v:\r\n c += 1\r\n cs[i] = c\r\n\r\n if cs[0] == 5 and cs[1] == 7 and cs[2] == 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n", "a = input()\r\nb = input()\r\nc = input()\r\nl=[i for i in a]\r\nm=[i for i in b]\r\nn=[i for i in c]\r\ne = ['a','e','i','o','u']\r\nA = 0\r\nB = 0\r\nC = 0\r\nfor i in l:\r\n if i in e:\r\n A+=1\r\nfor i in m:\r\n if i in e:\r\n B+=1\r\nfor i in n:\r\n if i in e:\r\n C+=1\r\nif A == 5 and B == 7 and C == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "import sys\nimport math\ninput = sys.stdin.readline\ndef f(s):\n\tc=0\n\tfor x in s:\n\t\tif x in \"aeiou\":\n\t\t\tc+=1\n\treturn c\na=input()\nb=input()\nc=input()\nprint((\"NO\",\"YES\")[f(a)==5 and f(b)==7 and f(c)==5])\n\t\t\t\t\t\t\t\t\t \t\t\t\t\t \t\t\t \t \t\t \t", "q='aeiou'\r\na=list(input())\r\nb=list(input())\r\nc=list(input())\r\ns=0\r\ns1=0\r\ns2=0\r\nfor i in a:\r\n if i in q:\r\n s+=1\r\nfor j in b:\r\n if j in q:\r\n s1+=1\r\nfor k in c:\r\n if k in q:\r\n s2+=1\r\nif s==5 and s1==7 and s2==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "for j in range(3):\n n = 0\n a = input()\n for i in a :\n if i == 'a' or i =='e' or i == 'i' or i == 'o' or i == 'u' :\n n += 1\n if j == 1 :\n if n == 7 :\n b = True\n else :\n b = False\n break\n else :\n if n == 5 :\n b = True\n else :\n b = False\n break\nif b == True :\n print('YES')\nelse :\n print('NO')", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nq = 0\r\nq1 = 0\r\nq2 = 0\r\n*ar, = 'aeuio'\r\nfor i in s1:\r\n if i in ar:\r\n q += 1\r\nfor i in s2:\r\n if i in ar:\r\n q1 += 1\r\nfor i in s3:\r\n if i in ar:\r\n q2 += 1\r\nif q==q2== 5 and q1== 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l=[5,7,5]\r\nt=0\r\nfor num in range(len(l)):\r\n line=input()\r\n c=0\r\n for char in line:\r\n if char in 'aeiou':\r\n c+=1\r\n \r\n if c == l[num]:\r\n t+=1\r\n\r\nif t == 3:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "\r\ndef f(x):\r\n if x=='a' or x=='e' or x=='i' or x=='o' or x=='u':\r\n return 1\r\n else:\r\n return 0\r\ns1=[f(n) for n in input()]\r\ns2=[f(n) for n in input()]\r\ns3=[f(n) for n in input()]\r\n\r\nif sum(s1)==5 and sum(s2)==7 and sum(s3)==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "def countVowel(para):\r\n vowel=['a','e','i','o','u']\r\n count=0\r\n for letter in para:\r\n if letter in vowel:\r\n count+=1\r\n return count\r\n\r\nhaiku=[]\r\nfor i in range(3):\r\n line=input().lower()\r\n haiku.append(line)\r\nsyllable=[]\r\nfor i in haiku:\r\n syllable.append(countVowel(i))\r\nif syllable==[5,7,5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "N = 3\r\ni = 0\r\nvowels = 'aeiou'\r\nex = [5, 7, 5]\r\nop = []\r\n\r\nwhile i < N:\r\n line = input()\r\n cnt = len([c for c in line if c in vowels])\r\n op.append(cnt)\r\n i += 1\r\nif op != ex:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import re\n\ndef check(s):\n return len(re.findall('(a|e|i|o|u)', s))\n\nif [5,7,5] == [check(input()), check(input()), check(input())]:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\nl1=len(s1)\r\nl2=len(s2)\r\nl3=len(s3)\r\nc1,c2,c3=0,0,0\r\nfor i in range(0,l1):\r\n if s1[i]=='a' or s1[i]=='e' or s1[i]=='i' or s1[i]=='o' or s1[i]=='u':\r\n c1=c1+1\r\nif c1!=5:\r\n print('NO')\r\nelse:\r\n for i in range(0,l2):\r\n if s2[i]=='a' or s2[i]=='e' or s2[i]=='i' or s2[i]=='o' or s2[i]=='u':\r\n c2=c2+1\r\n if c2!=7:\r\n print('NO')\r\n else:\r\n for i in range(0,l3):\r\n if s3[i]=='a' or s3[i]=='e' or s3[i]=='i' or s3[i]=='o' or s3[i]=='u':\r\n c3=c3+1\r\n if c3!=5:\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "v=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\ns1=input().strip()\r\ns2=input().strip()\r\ns3=input().strip()\r\nc1=c2=c3=0\r\nfor i in s1:\r\n if i in v:\r\n c1=c1+1\r\nfor i in s2:\r\n if i in v:\r\n c2=c2+1\r\nfor i in s3:\r\n if i in v:\r\n c3=c3+1\r\nif c1==5 and c2==7 and c3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "L1 = str(input())\nL2 = str(input()) \nL3 = str(input())\nL1 = list(L1)\nL2 = list(L2)\nL3 = list(L3)\nsu1 = 0\nsu2 = 0\nsu3 = 0\na = b = c = False\nfor i in range(len(L1)):\n if L1[i] == \"a\" or L1[i] == \"e\" or L1[i] == \"i\" or L1[i] == \"o\" or L1[i] == \"u\":\n su1 += 1\n else:\n continue\ni = 0\nif su1 ==5:\n a = True\nfor i in range(len(L2)):\n if L2[i] == \"a\" or L2[i] == \"e\" or L2[i] == \"i\" or L2[i] == \"o\" or L2[i] == \"u\":\n su2 += 1\n else:\n continue\ni = 0\nif su2 == 7:\n b = True\nfor i in range(len(L3)):\n if L3[i] == \"a\" or L3[i] == \"e\" or L3[i] == \"i\" or L3[i] == \"o\" or L3[i] == \"u\":\n su3 += 1\n else:\n continue\nif su3 ==5:\n c = True\nif a == True and b ==True and c ==True:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t\t \t \t \t\t\t \t \t\t \t", "import sys\r\nimport re\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef inlt():\r\n return list(map(str, input().split()))\r\n\r\n\r\ndef count(s):\r\n i = 0\r\n a = len(s)\r\n b = re.sub(r\"(a+)|(e+)|(i+)|(o+)|(u+)\", \"\", s)\r\n return a-len(b)\r\n\r\n\r\ns = [\r\n re.sub(r\"\\s+\", \"\", input()),\r\n re.sub(r\"\\s+\", \"\", input()),\r\n re.sub(r\"\\s+\", \"\", input())\r\n]\r\nc = [count(x) for x in s]\r\nprint(\"YES\" if c == [5, 7, 5] else \"NO\")\r\n", "# Haiku\r\np1 = input()\r\np2 = input()\r\np3 = input()\r\nsyllaList = ['a', 'e', 'i', 'o', 'u']\r\nc1 = c2 = c3 = 0\r\nfor i in p1:\r\n if i in syllaList:\r\n c1 += 1\r\nfor i in p2:\r\n if i in syllaList:\r\n c2 += 1\r\nfor i in p3:\r\n if i in syllaList:\r\n c3 += 1\r\nif c1 == c3 == 5 and c2 == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = input()\r\nc = input()\r\n\r\ndef isVowel(c):\r\n\treturn c == 'a' or c == 'e' or c == 'i' or c == 'o' or c == 'u'\r\n\r\ndef vowelNo(s):\r\n\tc = 0\r\n\tfor i in s:\r\n\t\tif isVowel(i):\r\n\t\t\tc += 1\r\n\treturn c\r\n\r\nif vowelNo(a) == 5 and vowelNo(b) == 7 and vowelNo(c) == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "l1 = input()\r\nl2 = input()\r\nl3 = input()\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\nfor i in l1:\r\n if i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n c1 = c1 +1\r\nfor i in l2:\r\n if i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n c2 = c2 +1\r\nfor i in l3:\r\n if i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n c3 = c3 +1\r\nif c1 == 5 and c2 == 7 and c3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-02 23:33:05\nLastEditTime: 2021-11-02 23:41:59\nDescription: Haiku\nFilePath: CF78A.py\n'''\n\n\ndef func():\n haiku = []\n for _ in range(3):\n haiku.append(input().strip())\n\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\n lst = []\n for item in haiku:\n count = 0\n for vowel in vowels:\n count += item.count(vowel)\n lst.append(count)\n \n return \"YES\" if lst == [5, 7, 5] else \"NO\"\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "h1=input()\r\nh2=input()\r\nh3=input()\r\ndef count(string):\r\n\tglobal ans\r\n\tans=0\r\n\tfor i in string:\r\n\t\tif i ==\"a\":\r\n\t\t\tans+=1\r\n\tfor i in string:\r\n\t\tif i ==\"e\":\r\n\t\t\tans+=1\r\n\tfor i in string:\r\n\t\tif i ==\"i\":\r\n\t\t\tans+=1\r\n\tfor i in string:\r\n\t\tif i ==\"o\":\r\n\t\t\tans+=1\r\n\tfor i in string:\r\n\t\tif i ==\"u\":\r\n\t\t\tans+=1\r\n\treturn ans\r\nif(count(h1)==5 and count(h2)==7 and count(h3)==5):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "mas = [5,7,5]\r\ng = ['a', 'e', 'i', 'o','u']\r\nfor x in range(3):\r\n a = input().split()\r\n k = 0\r\n for i in a:\r\n for j in i:\r\n if j in g:\r\n k += 1\r\n if k != mas[x]:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "x,y,z = input(),input(),input()\r\nif sum([x.count(i) for i in \"aeiou\"]) == 5 and sum([y.count(i) for i in \"aeiou\"]) == 7 and sum([z.count(i) for i in \"aeiou\"]) == 5:\r\n\tprint('YES')\r\nelse:\r\n\tprint(\"NO\")", "o=input().replace(\" \",\"\")\r\nt=input().replace(\" \",\"\")\r\ne=input().replace(\" \",\"\")\r\ndef vo(n):\r\n k=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\n v=0\r\n for i in n:\r\n if i in k:\r\n v+=1\r\n return v\r\nif vo(o)==5 and vo(t)==7 and vo(e)==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "def myCount (s, g):\n c = 0\n for i in g:\n c += s.count (i)\n return c\n\na, b, c = input(), input(), input()\ng = ['a','e','i','o','u']\nn = myCount (a, g)\nm = myCount (b, g)\nk = myCount (c, g)\nif n == 5 and m == 7 and k == 5:\n print ('YES')\nelse:\n print ('NO')\n", "a = str(input())\r\nb = str(input())\r\nc = str(input())\r\nvowelsA = a.count(\"o\")+a.count(\"i\")+a.count(\"e\")+a.count(\"u\")+a.count(\"a\")\r\nvowelsB = b.count(\"o\")+b.count(\"i\")+b.count(\"e\")+b.count(\"u\")+b.count(\"a\")\r\nvowelsC = c.count(\"o\")+c.count(\"i\")+c.count(\"e\")+c.count(\"u\")+c.count(\"a\")\r\nif vowelsA == 5 and vowelsB == 7 and vowelsC == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "if [sum(1 for ch in input() if ch in ['a', 'e', 'i', 'o', 'u']) for i in range(3) ] == [5, 7, 5] :\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "print('NYOE S'[[sum(c in'aeiou'for c in input())for f in\"012\"]==[5,7,5]::2])", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nans = []\r\nfor _ in range(3):\r\n cnt = 0\r\n data = input().rstrip()\r\n for i in data:\r\n if i in ['a', 'e', 'i', 'o', 'u']:\r\n cnt += 1\r\n ans.append(cnt)\r\n\r\nif ans == [5, 7, 5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def count_syllables(word):\r\n vowels = \"aeiou\"\r\n return sum(1 for char in word if char in vowels)\r\n\r\ndef is_haiku(phrase1, phrase2, phrase3):\r\n haiku_format = [5, 7, 5]\r\n phrases = [phrase1.strip(), phrase2.strip(), phrase3.strip()]\r\n \r\n for i in range(3):\r\n num_syllables = count_syllables(phrases[i])\r\n if num_syllables != haiku_format[i]:\r\n return False\r\n \r\n return True\r\n\r\n# Read input\r\nphrase1 = input().strip()\r\nphrase2 = input().strip()\r\nphrase3 = input().strip()\r\n\r\n# Check if the poem is a haiku\r\nif is_haiku(phrase1, phrase2, phrase3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nimport re\r\n\r\ndef main():\r\n s = sys.stdin.read().strip().split('\\n')\r\n return ('NO', 'YES')[[len(re.findall('[aeiou]', i)) for i in s] == [5, 7, 5]]\r\n\r\nprint(main())\r\n", "l=[]\r\nfor i in range(3):\r\n s=input()\r\n s=s.strip()\r\n l.append(s)\r\nflag=1\r\nfor j in range(3):\r\n a=l[j].count('a')\r\n e=l[j].count('e')\r\n i=l[j].count('i')\r\n o=l[j].count('o')\r\n u=l[j].count('u')\r\n summ=a+e+i+o+u\r\n #print (j,summ)\r\n if(j==0 and summ==5):\r\n continue\r\n elif(j==1 and summ==7):\r\n continue\r\n elif(j==2 and summ==5):\r\n continue\r\n else:\r\n #print(i)\r\n flag=0\r\n break\r\nif(flag):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import deque\nimport re\n\nhaiku = deque()\n\nhaiku.append(len(re.findall('(a|e|o|i|u)',input())))\nhaiku.append(len(re.findall('(a|e|o|i|u)',input())))\nhaiku.append(len(re.findall('(a|e|o|i|u)',input())))\n\nif [5,7,5] == [haiku.pop(), haiku.pop(), haiku.pop()]:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "a=list(input())\r\nb=list(input())\r\nc=list(input())\r\nv=['a','e','i','o','u']\r\nk=0\r\nflag=0\r\nfor i in range(len(a)):\r\n if a[i] in v:\r\n k+=1\r\nif k!=5:\r\n flag=1\r\nk=0\r\nfor i in range(len(b)):\r\n if b[i] in v:\r\n k+=1\r\nif k!=7:\r\n flag=1\r\nk=0\r\nfor i in range(len(c)):\r\n if c[i] in v:\r\n k+=1\r\nif k!=5:\r\n flag=1\r\nif flag==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys \r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w') \r\n \r\ndef countVowel(st):\r\n aa=0\r\n for i in range(len(st)):\r\n if st[i]=='a' or st[i]=='e' or st[i]=='i' or st[i]=='o' or st[i]=='u' :\r\n aa+=1\r\n return aa\r\n\r\n# T = int(input())\r\n# for t in range(T):\r\n# n,c = map(int,input().split())\r\nhk = []\r\nfor i in range(3):\r\n a = input().strip()\r\n hk.append(a)\r\ncount = []\r\nchcount = [5,7,5]\r\nfor i in hk:\r\n a = countVowel(i)\r\n count.append(a)\r\nif count==chcount:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "line1 = input()\r\nline2 = input()\r\nline3 = input()\r\ncount1 = 0\r\ncount2 = 0\r\ncount3 = 0\r\nfor i in range(0,len(line1)):\r\n if(line1[i] == 'a' or line1[i] == 'e' or line1[i] == 'i' or line1[i] == 'o' or line1[i] == 'u'):\r\n count1 = count1+1\r\n\r\nfor i in range(0,len(line2)):\r\n if(line2[i] == 'a' or line2[i] == 'e' or line2[i] == 'i' or line2[i] == 'o' or line2[i] == 'u'):\r\n count2 = count2+1 \r\n\r\nfor i in range(0,len(line3)):\r\n if(line3[i] == 'a' or line3[i] == 'e' or line3[i] == 'i' or line3[i] == 'o' or line3[i] == 'u'):\r\n count3 = count3+1 \r\n\r\nif(count1==5 and count2==7 and count3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "v1 = input()\r\nv2 = input()\r\nv3 = input()\r\ns=0\r\nfor i in range(len(v1)):\r\n if v1[i] == 'a' or v1[i] == 'e' or v1[i] == 'i' or v1[i] == 'o' or v1[i] == 'u':\r\n s+=1\r\nif s==5:\r\n s=0;\r\n v1 = v2\r\n for i in range(len(v1)):\r\n if v1[i] == 'a' or v1[i] == 'e' or v1[i] == 'i' or v1[i] == 'o' or v1[i] == 'u':\r\n s+=1\r\n if s==7:\r\n s=0\r\n v1 = v3\r\n for i in range(len(v1)):\r\n if v1[i] == 'a' or v1[i] == 'e' or v1[i] == 'i' or v1[i] == 'o' or v1[i] == 'u':\r\n s+=1\r\n if s==5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "def main():\n res = True\n for n in 5, 7, 5:\n res &= sum(c in ('a', 'e', 'i', 'o', 'u') for c in input()) == n\n print(('NO', 'YES')[res])\n\n\nif __name__ == '__main__':\n main()\n\n\n\n", "line1 = list(input().split())\nline2 = list(input().split())\nline3 = list(input().split())\n\ncounter = 0\ncounter1 = 0\ncounter2 = 0\n\nfor i in range(len(line1)):\n for j in range(len(line1[i])):\n if line1[i][j] == 'a' or line1[i][j] == 'e' or line1[i][j] == 'i' or line1[i][j] == 'o' or line1[i][j] == 'u':\n counter += 1\n\nfor i in range(len(line2)):\n for j in range(len(line2[i])):\n if line2[i][j] == 'a' or line2[i][j] == 'e' or line2[i][j] == 'i' or line2[i][j] == 'o' or line2[i][j] == 'u':\n counter1 += 1\n\nfor i in range(len(line3)):\n for j in range(len(line3[i])):\n if line3[i][j] == 'a' or line3[i][j] == 'e' or line3[i][j] == 'i' or line3[i][j] == 'o' or line3[i][j] == 'u':\n counter2 += 1\n\nif counter == 5 and counter1 == 7 and counter2 == 5:\n print(\"YES\")\nelse:\n print(\"NO\")", "x=['a','e','i','o','u']\r\na=input().strip()\r\nb=input().strip()\r\nc=input().strip()\r\nm,n,o=0,0,0\r\nfor i in range(len(a)):\r\n\tif a[i] in x:\r\n\t\tm+=1\r\nfor i in range(len(b)):\r\n\tif b[i] in x:\r\n\t\tn+=1\r\nfor i in range(len(c)):\r\n\tif c[i] in x:\r\n\t\to+=1\r\nif m==5 and n==7 and o==5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "string_1=input(\"\")\r\nstring_2=input(\"\")\r\nstring_3=input(\"\")\r\nvowels=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\ncounter1=0\r\ncounter2=0\r\ncounter3=0\r\nfor i in range(len(string_1)):\r\n if string_1[i] in vowels:\r\n counter1+=1\r\nfor i in range(len(string_2)):\r\n if string_2[i] in vowels:\r\n counter2+=1\r\nfor i in range(len(string_3)):\r\n if string_3[i] in vowels:\r\n counter3+=1\r\nif counter1==5 and counter2==7 and counter3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\nI1 = lambda :map(int,input().split())\nI = lambda: input()\ndef cal(s,vowel):\n c = 0\n for i in s:\n if i in vowel:\n c+=1\n return c\na1,a2,a3 = I(),I(),I()\nvowel = \"aeiou\"\nprint(\"YES\"if cal(a1,vowel) == 5 and cal(a2,vowel) == 7 and cal(a3,vowel) == 5 else \"NO\")\n\n", "a=[]\r\nb=[]\r\nfor i in range(3):\r\n a+=[input()]\r\nfor i in a:\r\n b+=[len([j for j in i if j in'aeiou'])]\r\nif b==[5,7,5]:\r\n print('YES')\r\nelse:\r\n print('NO')", "line1 = input()\r\nline2 = input()\r\nline3 = input()\r\nlist = [line1, line2, line3]\r\n\r\nvowelcount1 = 0\r\nvowelcount2 = 0\r\nvowelcount3 = 0\r\n\r\nvowelist = [\"a\", 'e', 'i', 'o', 'u']\r\n\r\nfor i in range(3):\r\n vowelcount = 0\r\n for j in range(len(list[i])):\r\n if list[i][j] in vowelist:\r\n vowelcount += 1\r\n if i == 0:\r\n vowelcount1 = vowelcount\r\n elif i == 1:\r\n vowelcount2 = vowelcount\r\n elif i == 2:\r\n vowelcount3 = vowelcount\r\n\r\nif vowelcount1 == 5 and vowelcount2 == 7 and vowelcount3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "count_vowels = lambda s: sum(ch in 'aeiou' for ch in s)\r\n\r\nprint('YES' if (count_vowels(input()) == 5 and\r\n count_vowels(input()) == 7 and\r\n count_vowels(input()) == 5) else 'NO')", "verified = 0\nvowels = ['a', 'e', 'i', 'o', 'u']\n\nfor i in range(3):\n line = input()\n count = 0\n for j in range(len(line)):\n if line[j] in vowels:\n count += 1\n if i % 2 == 0:\n if count == 5:\n verified += 1\n else:\n if count == 7:\n verified += 1\n\nif verified == 3:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "VOWELS = set(\"aeiou\")\n\n\nfirst = input()\nsecond = input()\nthird = input()\n\nfirst_counter = 0\nfor c in first:\n if c in VOWELS:\n first_counter += 1\n\nsecond_counter = 0\nfor c in second:\n if c in VOWELS:\n second_counter += 1\n\nthird_counter = 0\nfor c in third:\n if c in VOWELS:\n third_counter += 1\n\nif (first_counter, second_counter, third_counter) == (5, 7, 5):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "li=['a','e','i','o','u']\r\nki=[5,7,5]\r\ndi=[]\r\nc=0\r\nfor i in range(3):\r\n sr=input()\r\n for j in sr:\r\n if j in li:\r\n c=c+1;\r\n di.append(c)\r\n c=0\r\nif di==ki:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n ", "def count_vowels(word):\r\n vowels = \"aeiou\"\r\n return sum(1 for letter in word if letter in vowels)\r\ndef is_haiku(phrase1, phrase2, phrase3):\r\n syllables1 = sum(count_vowels(word) for word in phrase1.split())\r\n syllables2 = sum(count_vowels(word) for word in phrase2.split())\r\n syllables3 = sum(count_vowels(word) for word in phrase3.split())\r\n return syllables1 == 5 and syllables2 == 7 and syllables3 == 5\r\nphrase1 = input().strip()\r\nphrase2 = input().strip()\r\nphrase3 = input().strip()\r\nif is_haiku(phrase1, phrase2, phrase3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nfrases = []\r\nes_haiku = True\r\n\r\nfor i in range(3):\r\n frases.append(input())\r\n\r\ni = 0\r\nwhile es_haiku and i<3:\r\n minusculas = 0\r\n for j in range(len(frases[i])):\r\n if (frases[i][j] == 'a' or\r\n frases[i][j] == 'e' or\r\n frases[i][j] == 'i' or\r\n frases[i][j] == 'o' or\r\n frases[i][j] == 'u'):\r\n minusculas = minusculas+1\r\n if (((i == 0 or i == 2) and minusculas > 5) or (i == 1 and minusculas > 7)):\r\n es_haiku = False\r\n if (es_haiku and ((i == 0 or i == 2) and minusculas != 5) or (i == 1 and minusculas != 7)): \r\n es_haiku = False\r\n i = i+1\r\nif es_haiku:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\nfrom itertools import *\r\nfrom cmath import *\r\n\r\ninput = sys.stdin.readline\r\nfrom math import *\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return int(input().strip())\r\n\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return list(s[:len(s) - 1])\r\n\r\n\r\ndef invr():\r\n return map(int, input().split())\r\n\r\n\r\nvowels = \"aeiou\"\r\ncnt = 0\r\nans = 0\r\ns = \"\"\r\ns = str(input())\r\nfor char in s:\r\n if char in vowels:\r\n cnt += 1\r\nif cnt == 5:\r\n ans += 1\r\ncnt = 0\r\ns = str(input())\r\nfor char in s:\r\n if char in vowels:\r\n cnt += 1\r\nif cnt == 7:\r\n ans += 1\r\ncnt = 0\r\ns = str(input())\r\nfor char in s:\r\n if char in vowels:\r\n cnt += 1\r\nif cnt == 5:\r\n ans += 1\r\n\r\nprint(\"YES\" if ans == 3 else \"NO\")\r\n", "import random\r\nletter= []\r\nfor i in range(3):\r\n row = input()\r\n letter.append(row)\r\nif letter[0].count('a')+letter[0].count('e')+letter[0].count('o')+letter[0].count('i')+letter[0].count('u') ==5 and letter[1].count('a')+letter[1].count('e')+letter[1].count('o')+letter[1].count('i')+letter[1].count('u') ==7 and letter[2].count('a')+letter[2].count('e')+letter[2].count('o')+letter[2].count('i')+letter[2].count('u') ==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\nans = 'YES'\r\nres = [5, 7, 5]\r\nfor i in range(3):\r\n n = input()\r\n s = Counter(n)\r\n if s['a'] + s['e'] + s['i'] + s['o'] + s['u'] != res[i]:\r\n ans = 'NO'\r\n break\r\nprint(ans)", "l = []\r\nl1 = [\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nfor i in range(3):\r\n\tcount = 0\r\n\ts = input().split()\r\n\tfor k in s:\r\n\t\tfor j in k:\r\n\t\t\tif j in l1:\r\n\t\t\t\tcount += 1\r\n\tl.append(count)\r\nif l==[5,7,5]:\r\n\tprint(\"YES\")\r\nelse:print(\"NO\")\t\t\t\t\t\r\n", "\"\"\" \r\n\r\n///░░░░░░░░░░░░░▄░░░░░░░░░░░░░░░░░░░░░\r\n///░░░░░░░░░░░▄▐░▄▄█████▄▄░░░░░░░░░░░░░░\r\n///░░░░░░░░░▄█████████████▄▀▄▄░▄▄▄░░░░░░░\r\n///░░░░░░░░█████████████████▄██████░░░░░░░\r\n///░░░░░░░████▐█████▌████████▌█████▌░░░░░░░\r\n///░░░░░░████▌█████▌█░████████▐▀██▀░░░░░░░\r\n///░░░░▄█████░█████▌░█░▀██████▌█▄▄▀▄░░░░░░░\r\n///░░░░▌███▌█░▐███▌▌░░▄▄░▌█▌███▐███░▀░░░░░░░\r\n///░░░▐░▐██░░▄▄▐▀█░░░▐▄█▀▌█▐███▐█░░░░░░░\r\n///░░░░░███░▌▄█▌░░▀░░▀██░░▀██████▌░░░░░░░\r\n///░░░░░░▀█▌▀██▀░▄░░░░░░░░░███▐███░░░░░░░░\r\n///░░░░░░░██▌░░░░░░░░░░░░░▐███████▌░░░░░░░░\r\n///░░░░░░░███░░░░░▀█▀░░░░░▐██▐███▀▌░░░░░░░\r\n///░░░░░░░▌█▌█▄░░░░░░░░░▄▄████▀░▀░░░░░░░\r\n///░░░░░░░░░█▀██▄▄▄░▄▄▀▀▒█▀█░▀░░░░░░░\r\n///░░░░░░░░░░░░▀░▀█▀▌▒▒▒░▐▄▄░░░░░░░\r\n///░░░░░░░░░░░▄▄▀▀▄░░░░░░▄▀░▀▀▄▄░░░░░░░\r\n///░░░░░░░░░▄▀░▄▀▄░▌░░░▄▀░░░░░░▄▀▀▄░░░░░░░\r\n///░░░░░░░░▐▒▄▀▄▀░▌▀▄▄▀░░░░░░▄▀▒▒▒▐░░░░░░░\r\n///░░░░░░░▐▒▒▌▀▄░░░░░▌░░░░▄▄▀▒▐▒▒▒▒▌░░░░░░░\r\n///░░░░░░▐▒▒▐░▌░▀▄░░▄▀▀▄▀▀▒▌▒▐▒▒▒▒▐▐░░░░░░░░\r\n///░░░░░░▌▄▀░░░▄▀░█▀▒▒▒▒▀▄▒▌▐▒▒▒▒▒▌▌░░░░░░░\r\n///░░░░░▄▀▒▐░▄▀░░░▌▒▐▒▐▒▒▒▌▀▒▒▒▒▒▐▒▌░░░░░░ \r\n\r\n\"\"\"\r\n\"\"\"define ja bsdk hila le ladki ko dekh ke\"\"\" \r\n\r\na=input()\r\nb=input()\r\nc=input()\r\ntemp=0\r\nt=0\r\np=0\r\nfor i in range(len(a)):\r\n if a[i]=='a' or a[i]=='i' or a[i]=='e'or a[i]=='o' or a[i]=='u':\r\n temp+=1\r\nfor i in range(len(b)):\r\n if b[i]=='a' or b[i]=='i' or b[i]=='e'or b[i]=='o' or b[i]=='u':\r\n t+=1 \r\nfor i in range(len(c)):\r\n if c[i]=='a' or c[i]=='i' or c[i]=='e'or c[i]=='o' or c[i]=='u':\r\n p+=1 \r\nif temp==5 and t==7 and p==5 and temp+t+p==17:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\"\"\"\r\n//ascii of a=97\r\n//ascii of A=65\r\n//ascii of 0=48\r\n//lower_bound and upper_bound\r\n/* Har Har Mahadev!! */\r\n\r\n\"\"\"", "def solve():\n target = [5, 7, 5]\n ans = 'YES'\n for i in range(3):\n s = input()\n cnt = 0\n for x in s:\n if x in 'aeiou':\n cnt += 1\n if cnt != target[i]:\n ans = 'NO'\n return ans\n\nprint(solve())", "from sys import stdin\r\nimport math\r\n\r\nA = stdin.readline()\r\nB = stdin.readline()\r\nC = stdin.readline()\r\ncount = 0\r\nK =0\r\n\r\nfor j in A:\r\n if (j=='a' or j=='e') or (j=='i' or (j=='o' or j=='u')):\r\n count+=1\r\n if count>5:\r\n K = 1\r\n break\r\n\r\nif count!=5 or K==1:\r\n print('NO')\r\nelse:\r\n\r\n count = 0\r\n for j in B:\r\n if (j == 'a' or j == 'e') or (j == 'i' or (j == 'o' or j == 'u')):\r\n count += 1\r\n if count > 7:\r\n K = 1\r\n break\r\n if count!=7 or K==1:\r\n print('NO')\r\n else:\r\n count = 0\r\n for j in C:\r\n if (j == 'a' or j == 'e') or (j == 'i' or (j == 'o' or j == 'u')):\r\n count += 1\r\n if count > 5:\r\n K = 1\r\n break\r\n if count!=5 or K==1:\r\n print('NO')\r\n else:\r\n print('YES')", "s1=input().replace(' ','')\r\ns2=input().replace(' ','')\r\ns3=input().replace(' ','')\r\nv1=0\r\nv2=0\r\nv3=0\r\nvowels=['a','e','i','o','u']\r\nfor i in range(len(s1)):\r\n if s1[i] in vowels:\r\n v1+=1\r\nfor j in range(len(s2)):\r\n if s2[j] in vowels:\r\n v2+=1\r\nfor k in range(len(s3)):\r\n if s3[k] in vowels:\r\n v3+=1\r\nif v1==5 and v2==7 and v3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "x=[]\r\nfor i in range(3):\r\n s=input()\r\n c=0\r\n for j in s:\r\n if(j=='a' or j=='e' or j=='i' or j=='o' or j=='u'):\r\n c+=1 \r\n x.append(c)\r\nif(x[0]==5 and x[1]==7 and x[2]==5 ):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nfinal = 0\r\nvowel = ['a', 'e', 'i', 'o', 'u']\r\ncount = 0\r\nfor i in range(len(s1)):\r\n if s1[i].isalpha() and s1[i] in vowel:\r\n count += 1\r\nif count == 5:\r\n final += 1\r\n count = 0\r\n for i in range(len(s2)):\r\n if s2[i].isalpha() and s2[i] in vowel:\r\n count += 1\r\n if count == 7:\r\n final += 1\r\n count = 0\r\n for i in range(len(s3)):\r\n if s3[i].isalpha() and s3[i] in vowel:\r\n count += 1\r\n if count == 5:\r\n final += 1\r\nif final == 3:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n", "good = True\r\n\r\nv = {'a', 'e', 'i', 'o', 'u'}\r\n\r\ndef cv(st):\r\n t = 0\r\n for c in st:\r\n if c in v:\r\n t += 1\r\n return t\r\n\r\nfor cnt in [5, 7, 5]:\r\n s = input()\r\n\r\n if good and cv(s) != cnt:\r\n good = False\r\n\r\nprint(\"YES\" if good else \"NO\")", "a, b, c = input(), input(), input()\r\nres = [sum(line.count(v) for v in 'aeiou') for line in [a,b,c]] \r\nprint([\"NO\",\"YES\"][res == [5,7,5]])", "a=input()\r\nb=input()\r\nc=input()\r\ncnt1=0\r\ncnt2=0\r\ncnt3=0\r\nfor i in a:\r\n if i in \"aeiou\":\r\n cnt1+=1\r\nfor i in b:\r\n if i in \"aeiou\":\r\n cnt2+=1\r\nfor i in c:\r\n if i in \"aeiou\":\r\n cnt3+=1\r\nif cnt1==5 and cnt2==7 and cnt3==5:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\ndef s(x):\r\n index=\"aeiou\"\r\n l=0\r\n for i in x:\r\n if i in index:\r\n l=l+1\r\n return l\r\nls1=list(a)\r\nls2=list(b)\r\nls3=list(c)\r\nif s(ls1)==5 and s(ls2)==7 and s(ls3)==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def countVowels(string):\r\n vowels = ['a','e','i','o','u']\r\n total = 0\r\n for s in string:\r\n if s in vowels:\r\n total += 1\r\n return total\r\n\r\na1 = input()\r\na2 = input()\r\na3 = input()\r\n\r\nprint(\"YES\" if countVowels(a1) == 5 and countVowels(a2) == 7 and countVowels(a3) == 5 else \"NO\")\r\n", "n = []\r\n[n.append(input()) for i in range(3)]\r\nflag = True\r\nif n[0].count('a') + n[0].count('e') + n[0].count('i') + n[0].count('o') + n[0].count('u') != 5:\r\n flag = False\r\nif n[1].count('a') + n[1].count('e') + n[1].count('i') + n[1].count('o') + n[1].count('u') != 7:\r\n flag = False\r\nif n[2].count('a') + n[2].count('e') + n[2].count('i') + n[2].count('o') + n[2].count('u') != 5:\r\n flag = False\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "li=[input()for i in range(3)]\r\nfor i in range(3):\r\n cnt=0\r\n for j in li[i]:\r\n if j in 'aieou':\r\n cnt+=1\r\n if cnt not in(5,7):print('NO');break\r\n else:\r\n if cnt==5:\r\n if i not in (0,2):print('NO');break\r\n elif cnt==7:\r\n if i != 1:print('NO');break\r\n else:break\r\nelse:print('YES')", "l1=input()\nl2=input()\nl3=input()\ncount1=0\ncount2=0\ncount3=0\nvow=[\"a\",\"e\",\"i\",\"o\",\"u\"]\nfor i in l1:\n if i in vow:\n count1+=1\nfor i in l2:\n if i in vow:\n count2+=1\nfor i in l3:\n if i in vow:\n count3+=1\nif count1==5 and count2==7 and count3==5:\n print(\"YES\")\nelse:\n print(\"NO\") \n\n\n\t\t\t \t \t\t \t \t\t\t\t\t\t\t\t\t \t\t \t\t\t", "poem = [input() for i in range(3)]\n\nvowels = \"aeiou\"\n\nif ([len([v for v in line if v in vowels]) for line in poem]) == [5,7,5] :\n print(\"YES\")\nelse :\n print(\"NO\")\n", "vowels = {'a','e','i','o','u'}\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\ncount1 = 0\r\ncount2 = 0\r\ncount3 = 0\r\nfor i in s1:\r\n if i in vowels:\r\n count1 += 1\r\nfor i in s2:\r\n if i in vowels:\r\n count2 += 1\r\nfor i in s3:\r\n if i in vowels:\r\n count3 += 1\r\nif(count1 == 5 and count2 == 7 and count3 == 5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=list(input())\r\nb=list(input())\r\nc=list(input())\r\n\r\n\r\nv =[\"a\", \"e\", \"i\", \"o\",\"u\"]\r\n\r\nd,t,y=0,0,0\r\nfor j in a:\r\n if j in v:\r\n d+=1\r\nfor k in b:\r\n if k in v:\r\n t+=1\r\nfor s in c:\r\n if s in v:\r\n y+=1\r\n\r\n\r\nif d==5 and t==7 and y==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import re\r\ndef f(s):\r\n\treturn len(re.findall('(a|e|i|o|u)', s))\r\nif [5, 7, 5] == [f(input()), f(input()), f(input())]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = []\r\nfor i in range(3):\r\n s.append(sum([1 for i in input() if i in 'aeiou']))\r\nprint('YES') if s == [5, 7, 5] else print('NO')\r\n", "print(('NO', 'YES')[[sum(c in 'aeiou' for c in input()) for _ in \"012\"] == [5, 7, 5]])", "ans = \"\"\r\nfor i in range(3):\r\n s = input()\r\n vowels = [\"a\",'e', 'i', 'o', 'u']\r\n cnt = 0\r\n for ch in s:\r\n if ch in vowels:\r\n cnt += 1\r\n if ((i == 0 or i == 2) and (cnt == 5)) or ((i==1) and cnt == 7):\r\n ans = \"YES\"\r\n else:\r\n ans = \"NO\"\r\n break\r\nprint(ans)\r\n ", "flag = True\r\nfor i in range(3):\r\n a = input()\r\n count = a.count('a') + a.count('e') + a.count('u') + a.count('o') + a.count('i')\r\n if i == 0 or i == 2:\r\n if count != 5:\r\n flag = False\r\n break\r\n if i == 1:\r\n if count != 7:\r\n flag = False\r\n break\r\nprint('YES' if flag else 'NO')", "l1 = input()\r\nl2 = input()\r\nl3 = input()\r\nc1 = len(l1)\r\nc2 = len(l2)\r\nc3 = len(l3)\r\nc11, c22, c33 = 0, 0, 0\r\nfor i in range(c1):\r\n if l1[i]=='a' or l1[i]=='e' or l1[i]=='i' or l1[i]=='o' or l1[i]=='u':\r\n c11 = c11+1\r\nfor j in range(c2):\r\n if l2[j]=='a' or l2[j]=='e' or l2[j]=='i' or l2[j]=='o' or l2[j]=='u':\r\n c22 = c22+1 \r\nfor k in range(c3):\r\n if l3[k]=='a' or l3[k]=='e' or l3[k]=='i' or l3[k]=='o' or l3[k]=='u':\r\n c33 = c33+1\r\nif c11==5 and c22==7 and c33==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = [5, 7, 5]\r\nhaiku = True\r\nfor i in range(3):\r\n s = input().strip()\r\n vowel = sum(1 for i in s if i in \"aeiou\")\r\n if vowel != n[i]:\r\n haiku = False\r\n break\r\nprint(\"YES\" if haiku else \"NO\")", "import math\r\n\r\ndef main_function():\r\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\n inputs = [input() for i in range(3)]\r\n counters = [0 for i in range(3)]\r\n for i in range(len(inputs)):\r\n for j in inputs[i]:\r\n for h in vowels:\r\n if h == j:\r\n counters[i] += 1\r\n if counters == [5, 7, 5]:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nprint(main_function())", "a=[]\r\nfor i in range(3):\r\n s=input()\r\n a.append(s)\r\ndef fn(a):\r\n vow=['a','e','i','o','u']\r\n c1,c2,c3=0,0,0\r\n for i in range(3):\r\n for j in a[i]:\r\n if j in vow and i==0:c1+=1\r\n elif j in vow and i==1:c2+=1\r\n elif j in vow and i==2:c3+=1\r\n if c1==5 and c2==7 and c3==5:return 'YES'\r\n else:return 'NO'\r\nprint(fn(a))\r\n", "a = input()\r\nb = input()\r\nc = input()\r\nasum = a.count('a') + a.count('e') + a.count('i') + a.count('o') + a.count('u')\r\nbsum = b.count('a') + b.count('e') + b.count('i') + b.count('o') + b.count('u')\r\ncsum = c.count('a') + c.count('e') + c.count('i') + c.count('o') + c.count('u')\r\nif(asum==5 and bsum==7 and csum==5):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "print('NYOE S'[[sum(c in'aeiou'for c in input())for _ in\"012\"]==[5,7,5]::2])", "def main():\r\n syllables = [5, 7, 5]\r\n haiku = True\r\n\r\n for i in range(3):\r\n ch = input()\r\n n = sum(ch.count(vowel) for vowel in 'aeiou')\r\n\r\n if n != syllables[i]:\r\n haiku = False\r\n\r\n print(\"YES\" if haiku else \"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "v = []\nfor _ in range(0, 3):\n v.append(sum(x in 'aeiou' for x in input()))\nprint(['NO', 'YES'][v == [5, 7, 5]])\n", "s1 = list(input())\r\ns2 = list(input())\r\ns3 = list(input())\r\n\r\nans = [0 for _ in range(3)]\r\nfor i in range(len(s1)):\r\n if s1[i] == 'a' or s1[i] == 'e' or s1[i] == 'i' or s1[i] == 'o' or s1[i] == 'u':\r\n ans[0] += 1\r\n\r\nfor i in range(len(s2)):\r\n if s2[i] == 'a' or s2[i] == 'e' or s2[i] == 'i' or s2[i] == 'o' or s2[i] == 'u':\r\n ans[1] += 1\r\n\r\nfor i in range(len(s3)):\r\n if s3[i] == 'a' or s3[i] == 'e' or s3[i] == 'i' or s3[i] == 'o' or s3[i] == 'u':\r\n ans[2] += 1\r\n\r\nif ans == [5, 7, 5]:\r\n print('YES')\r\nelse:\r\n print('NO')", "l=[5,7,5]\r\nd=0\r\nfor i in range(3):\r\n s=str(input())\r\n if s.count(\"a\")+s.count(\"e\")+s.count(\"i\")+s.count(\"o\")+s.count(\"u\")==l[i]:\r\n d+=1\r\nif d==3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\ns1 = a.count('a')+a.count('o')+a.count('u')+a.count('e')+a.count('i')\r\ns2 = b.count('a')+b.count('o')+b.count('u')+b.count('e')+b.count('i')\r\ns3 = c.count('a')+c.count('o')+c.count('u')+c.count('e')+c.count('i')\r\nif s1==5 and s2==7 and s3==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "haiku=[0,0,0]\r\nvowel=\"aeiou\"\r\n\r\nfor i in range(3):\r\n\tpoem=list(input().split())\r\n\tfor j in poem:\r\n\t\tfor k in j:\r\n\t\t\tfor l in vowel:\r\n\t\t\t\tif k==l:\r\n\t\t\t\t\thaiku[i]+=1;\r\nif haiku==[5,7,5]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nc1=0\r\nc2=0\r\nc3=0\r\nx=input()\r\ny=input()\r\nz=input()\r\nfor i in a:\r\n c1=c1+x.count(i)\r\nfor i in a:\r\n c2=c2+y.count(i)\r\nfor i in a:\r\n c3=c3+z.count(i)\r\nif(c1==5 and c2==7 and c3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nz=0\r\nfor i in range(3):\r\n\tcount=0\r\n\ts=input()\r\n\tfor x in s:\r\n\t\tif x==\"a\" or x==\"e\" or x==\"i\" or x==\"o\" or x==\"u\":\r\n\t\t\tcount+=1\r\n\t\telse:\r\n\t\t\tcontinue\r\n\tif i==1:\r\n\t\tif count==7:\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tz=1\r\n\telse:\r\n\t\tif count==5:\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tz=1\r\nif z==1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n", "# 78A Haiku\r\n\r\n# phrase_1 = input()\r\n# phrase_2 = input()\r\n# phrase_3 = input()\r\n\r\n# count_1 = 0\r\n# count_2 = 0\r\n# count_3 = 0\r\n\r\n# for i in phrase_1:\r\n# \tif i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n# \t\tcount_1 += 1\r\n\r\n# for i in phrase_2:\r\n# \tif i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n# \t\tcount_2 += 1\r\n\r\n# for i in phrase_3:\r\n# \tif i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n# \t\tcount_3 += 1\r\n\r\n# if count_1 == 5 and count_2 == 7 and count_3 == 5:\r\n# \tprint(\"YES\")\r\n# else:\r\n# \tprint(\"NO\")\r\n\r\n\r\n\r\n\r\n#Alternate way\r\nvowel = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\n\r\nphrase_1 = input()\r\nphrase_2 = input()\r\nphrase_3 = input()\r\n\r\ncount_1 = 0\r\ncount_2 = 0\r\ncount_3 = 0\r\n\r\nfor i in range(len(phrase_1)):\r\n\tif phrase_1[i] in vowel:\r\n\t\tcount_1 += 1\r\n\r\nfor i in range(len(phrase_2)):\r\n\tif phrase_2[i] in vowel:\r\n\t\tcount_2 += 1\r\n\r\nfor i in range(len(phrase_3)):\r\n\tif phrase_3[i] in vowel:\r\n\t\tcount_3 += 1\r\n\r\nif count_1 == 5 and count_2 == 7 and count_3 == 5:\r\n\tprint(\"YES\")\r\n\r\nelse:\r\n\tprint(\"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", "vowels = ['a', 'e', 'i', 'o', 'u']\ncountVowels = lambda : len(list(filter(lambda c : c in vowels, input())))\nprint([\"NO\", \"YES\"][countVowels()==5 and countVowels()==7 and countVowels()==5])\n\n", "a=input()\r\nc1=0;\r\nvowels={'A','E','I','O','U','a','e','i','o','u'}\r\nfor letter in a:\r\n\tif(letter in vowels):\r\n\t\tc1+=1\r\nb=input()\r\nc2=0;\r\nfor letter in b:\r\n\tif(letter in vowels):\r\n\t\tc2+=1\r\nc=input()\r\nc3=0\r\nfor letter in c:\r\n\tif(letter in vowels):\r\n\t\tc3+=1\r\nif(c1==5 and c2==7 and c3==5):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n ", "vowels = ('a','e','i','o','u')\r\nans=\"YES\"\r\nh=[]\r\nfor t in range(3):\r\n cnt=0\r\n s = input()\r\n for i in s:\r\n if i in vowels:\r\n cnt+=1\r\n h.append(cnt)\r\nif h[0]==5 and h[1]==7 and h[2]==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def cv(s):\r\n return sum(s.count(x) for x in \"aeiou\")\r\n\r\nans = \"YES\"\r\ncnt = [5,7,5]\r\nfor i in range(3):\r\n if cv(input())!=cnt[i]:\r\n ans= \"NO\"\r\nprint(ans)", "x = []\r\nfor _ in range(3):\r\n count = 0\r\n s = input().replace(\" \", '')\r\n for i in range(len(s)):\r\n if s[i] in \"aeiou\":\r\n count += 1\r\n x.append(count)\r\n\r\nif x == [5, 7, 5]:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "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\na = [input().rstrip() for _ in range(3)]\r\ncnt = [sum(s.count(c) for c in 'aeiou') for s in a]\r\nif cnt == [5, 7, 5]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "vowel = 'aiueo'\r\ndata = []\r\nfor j in range(3):\r\n pharse = input()\r\n data.append(pharse)\r\ndata1 = []\r\nfor i in data:\r\n count = 0\r\n for j in i:\r\n if j in vowel:\r\n count += 1\r\n data1.append(count)\r\nif data1 == [5,7,5]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "list1 = []\r\nfor i in range(3):\r\n iterator = 1\r\n phrase = input()\r\n vowels = 'aeiou'\r\n count = 0\r\n for i in phrase:\r\n if i in vowels:\r\n count+=1\r\n list1.append(count)\r\nif list1[0]==5 and list1[1]==7 and list1[2]==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = list(input())\r\nb = list(input())\r\nc = list(input())\r\nflag='YES'\r\ncount=0\r\nfor i in a:\r\n if i in 'aeoui':\r\n count+=1\r\nif count!=5:\r\n flag='NO'\r\ncount=0\r\nfor i in b:\r\n if i in 'aeoui':\r\n count+=1\r\nif count!=7:\r\n flag='NO'\r\ncount=0\r\nfor i in c:\r\n if i in 'aeoui':\r\n count+=1\r\n\r\nif count!=5:\r\n flag='NO'\r\nprint(flag)", "from sys import stdin\ni=0\nans=True\nc=[5,7,5]\nfor line in stdin:\n if len([x for x in line if x in \"aeiou\"]) != c[i]:\n ans=False\n i+=1\n \nprint('YES' if ans else 'NO')\n \n", "first = input()\r\nsecond = input()\r\nthird = input()\r\nvowel = ['a' , 'e' , 'i' , 'o' , 'u']\r\ncounter =0\r\nflag = True\r\nfor i in range (len(first)):\r\n if first[i] in vowel :\r\n counter+=1\r\nif (counter != 5):\r\n flag = False\r\n print(\"NO\")\r\nif (flag):\r\n for i in range(len(second)):\r\n if second[i] in vowel:\r\n counter+=1\r\n if counter != 12:\r\n print(\"NO\")\r\n flag = False\r\n if (flag):\r\n for i in range (len(third)):\r\n if third[i] in vowel:\r\n counter+=1\r\n if counter != 17:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "# LUOGU_RID: 113222172\ndef yy(a):\r\n return a.count('a')+a.count('e')+a.count('i')+a.count('o')+a.count('u')\r\nif yy(input())==5 and yy(input())==7 and yy(input())==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nb = input()\r\nc = input()\r\ndef c_v(s):\r\n\tl = ['a','e','i','o','u']\r\n\tcnt = 0\r\n\tfor i in range(len(s)):\r\n\t\tif s[i] in l:\r\n\t\t\tcnt+=1\r\n\treturn cnt\r\nif c_v(a) == 5 and c_v(b) == 7 and c_v(c) == 5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "syllables = ['a','i','e','o','u']\r\nd = {1:5,2:7,3:5}\r\noutput = {}\r\nfor i in range(3):\r\n count=0\r\n sentence = input().strip().lower()\r\n for j in sentence:\r\n if (j in syllables):\r\n count+=1\r\n output[i+1]=count\r\nif d == output:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\nl=['a','e','i','o','u']\r\nd=0;e=0;f=0\r\nfor i in a:\r\n if i in l:\r\n d += 1\r\nfor i in b:\r\n if i in l:\r\n e += 1\r\nfor i in c:\r\n if i in l:\r\n f += 1\r\nif d==5 and e==7 and f==5:\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def count(s):\r\n return s.count(\"a\") + s.count(\"e\") + s.count(\"i\") + s.count(\"o\") + s.count(\"u\")\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\nif count(s1) == 5 and count(s2) == 7 and count(s3) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=input()\r\ny=input()\r\nz=input()\r\nx=list(x) ; y=list(y) ; z=list(z)\r\nvo=['a','e','i','o','u']\r\nc1=0 ; c2=0 ; c3=0\r\nfor i in x:\r\n if i in vo:\r\n c1=c1+1\r\nfor i in y:\r\n if i in vo:\r\n c2=c2+1\r\nfor i in z:\r\n if i in vo:\r\n c3=c3+1\r\nif((c1==5)and(c2==7)and(c3==5)):\r\n print('YES')\r\nelse:\r\n print('NO')", "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\txs=[5,7,5]\r\n\tflag=False\r\n\tfor i in range(3):\r\n\t\ta=read()\r\n\t\tcnt=0\r\n\t\tfor c in a:\r\n\t\t\tif c in \"aeiou\":\r\n\t\t\t\tcnt+=1\r\n\t\tif cnt!=xs[i]:\r\n\t\t\tprint(\"NO\")\r\n\t\t\treturn\r\n\tprint(\"YES\")\r\n\r\nsolve()\r\n", "a=input()\r\nb=input()\r\nc=input()\r\nfirst=a.count('a')+a.count('e')+a.count('i')+a.count('o')+a.count('u')\r\nsecond=b.count('a')+b.count('e')+b.count('i')+b.count('o')+b.count('u')\r\nthird=c.count('a')+c.count('e')+c.count('i')+c.count('o')+c.count('u')\r\nif first==5 and second==7 and third==5: print(\"YES\")\r\nelse: print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\ns=0\r\nso=0\r\nfor i in a:\r\n if i in 'aeiou' or i in 'AEIOU':\r\n s+=1\r\nso+=s\r\nif s==5:\r\n s=0\r\n for i in b:\r\n if i in 'aeiou' or i in 'AEIOU':\r\n s += 1\r\nso+=s\r\nif s==7:\r\n s = 0\r\n for i in c:\r\n if i in 'aeiou' or i in 'AEIOU':\r\n s += 1\r\nso+=s\r\nif s==5 and so==17:\r\n print('YES')\r\nelse:\r\n print('NO')", "g = ['a', 'e', 'i', 'o', 'u']\r\nans = [0]*3\r\nh = [5,7,5]\r\nfor i in range(3):\r\n s = input()\r\n for j in s:\r\n if j in g:\r\n ans[i] += 1\r\nif ans == h:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "for i in range(3):\r\n line = input()\r\n o = \"YES\"\r\n count = 0\r\n count += line.count(\"a\")\r\n count += line.count(\"e\")\r\n count += line.count(\"i\")\r\n count += line.count(\"o\")\r\n count += line.count(\"u\")\r\n if i == 1:\r\n if count != 7:\r\n o = \"NO\"\r\n break\r\n else:\r\n continue\r\n else:\r\n if count != 5:\r\n o = \"NO\"\r\n break\r\n else:\r\n continue\r\nprint(o)\r\n", "vowels=['a','i','o','u','e']\r\ndef solve():\r\n\ta=str(input())\r\n\tb=str(input())\r\n\tc=str(input())\r\n\tx=0\r\n\ty=0\r\n\tz=0\r\n\tfor i in a:\r\n\t\tif i in vowels:\r\n\t\t\tx=x+1\r\n\tfor i in b:\r\n\t\tif i in vowels:\r\n\t\t\ty=y+1\r\n\tfor i in c:\r\n\t\tif i in vowels:\r\n\t\t\tz=z+1\r\n\t# print(x,y,z)\r\n\tif(x==5 and y==7 and z==5):\r\n\t\tprint(\"YES\")\r\n\telse: print(\"NO\")\r\n\r\n# print(\"HELO\")\r\n\r\nsolve()\r\n\r\n\r\n\r\n# t=int(input())\r\n# while t--:\r\n# \tsolve()", "a = input()\r\na1 = 0\r\nfor i in a.strip():\r\n if i in \"aeiou\":\r\n a1 += 1\r\nb = input()\r\nb1 = 0\r\nfor i in b.strip():\r\n if i in \"aeiou\":\r\n b1 += 1\r\nc = input()\r\nc1 = 0\r\nfor i in c.strip():\r\n if i in \"aeiou\":\r\n c1 += 1\r\n\r\nif a1 == 5 and b1 == 7 and c1 == 5:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\nquit()", "a=[5,7,5]\r\nfor i in range(3):\r\n s,count=input(),0\r\n for j in s:\r\n if j in \"aoeiu\":count+=1\r\n if count!=a[i]:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "def count_syllables(line: str) -> int:\n return sum(c in vowels for c in line)\n\n\ndef is_haiku(lines: [str]) -> bool:\n return len(lines) == 3 and \\\n count_syllables(lines[0]) == 5 and \\\n count_syllables(lines[1]) == 7 and \\\n count_syllables(lines[2]) == 5\n\n\ndef main():\n print('YES' if is_haiku([input() for _ in range(3)]) else 'NO')\n\n\nif __name__ == '__main__':\n vowels = 'aeiou'\n main()\n", "def f(s,x):\r\n\ta=0\r\n\tfor i in s:\r\n\t\tif i in ['a','e','i','o','u','A','E','I','O','U']:\r\n\t\t\ta+=1\r\n\tif a!=x:\r\n\t\treturn False\r\n\treturn True\r\nl=[]\r\nfor i in range(3):\r\n\ts=input()\r\n\tif i==1:\r\n\t\tx=7\r\n\telse:\r\n\t\tx=5\r\n\tl.append(f(s,x))\r\nif all(l):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s1 =input()\ns2=input()\ns3=input()\nvow=0\nvow1=0\nvow2=0\nl = ['a' , 'e' , 'i', 'o', 'u']\nfor i in range(len(s1)):\n if(s1[i]=='a' or s1[i]=='e' or s1[i]=='i' or s1[i]=='o' or s1[i]=='u' ):\n vow+=1\nfor j in range(len(s2)):\n if(s2[j]=='a' or s2[j]=='e' or s2[j]=='i' or s2[j]=='o' or s2[j]=='u' ):\n vow1+=1\nfor k in range(len(s3)):\n if(s3[k]=='a' or s3[k]=='e' or s3[k]=='i' or s3[k]=='o' or s3[k]=='u' ):\n vow2+=1\nif(vow==5 and vow1==7 and vow2==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t \t \t\t\t\t \t\t \t\t\t\t \t\t \t", "def count(s):\r\n\tc = 0\r\n\tfor i in s:\r\n\t\tif (i == 'a' or i == 'e' or i == 'i' or i==\"o\" or i == \"u\"):\r\n\t\t\tc += 1\r\n\treturn c\r\na = input()\r\nb = input()\r\nc = input()\r\nif (count(a) == 5 and count(b) == 7 and count(c) == 5):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "x = list(input())\r\ny = list(input())\r\nz = list(input())\r\na = x.count('a')\r\ne = x.count('e')\r\ni = x.count('i')\r\no = x.count('o')\r\nu = x.count('u')\r\nA = y.count('a')\r\nE = y.count('e')\r\nI = y.count('i')\r\nO = y.count('o')\r\nU = y.count('u')\r\na1 = z.count('a')\r\ne1 = z.count('e')\r\ni1 = z.count('i')\r\no1 = z.count('o')\r\nu1 = z.count('u')\r\np = a+e+i+o+u\r\nq = A+E+I+O+U\r\nr = a1+e1+i1+o1+u1\r\nif p==r==5 and q==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,r=[5,7,5],True\r\nfor z in range(3):\r\n s=input()\r\n vocales=0\r\n for i in range(len(s)):\r\n if(s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u'): vocales+=1\r\n if(vocales!=a[z]): r=False\r\nprint(\"YES\" if r else \"NO\")\r\n", "s=0\r\nk=0\r\nfor i in (5,7,5):\r\n s=0\r\n n=input().split()\r\n for m in n:\r\n for j in m:\r\n if(j in ('a','i','o','e','u')):\r\n s=s+1\r\n if(s==i):\r\n k=k+1\r\nif(k==3):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "s=str(input())\r\nt=str(input())\r\nu=str(input())\r\nL=['a','e','i','o','u']\r\nl1=0\r\nl2=0\r\nl3=0\r\nfor i in range(0,len(s)):\r\n\tif(s[i] in L):\r\n\t\tl1+=1\r\nif(l1!=5):\r\n\tprint(\"NO\")\r\nelse:\r\n\tfor i in range(0,len(t)):\r\n\t\tif(t[i] in L):\r\n\t\t\tl2+=1\r\n\tif(l2!=7):\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tfor i in range(0,len(u)):\r\n\t\t\tif(u[i] in L):\r\n\t\t\t\tl3+=1\r\n\t\tif(l3==5):\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\r\n", "lines = []\nfor i in range(3):\n lines.append(input().split())\n\nresults = []\n\nfor line in lines:\n vowelCount = 0\n for word in line:\n for letter in word:\n if letter in 'aeiou':\n vowelCount += 1\n results.append(vowelCount)\n\nif results[0] == 5 and results[1] == 7 and results[2] == 5:\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", "str1=input()\nstr2=input()\nstr3=input()\nls=[str1,str2,str3]\nvow=['a','e','i','o','u']\nc1,c2,c3=0,0,0\nfor str in ls:\n str.lower()\n str.strip()\n if (not(1<=len(str)<=100)):\n exit()\nfor i in range(0,len(str1)):\n if (str1[i] in vow):\n c1=c1+1\nfor i in range(0,len(str2)):\n if (str2[i] in vow):\n c2=c2+1\nfor i in range(0,len(str3)):\n if (str3[i] in vow):\n c3=c3+1\nif(c1==5 and c2==7 and c3==5):\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", "vowel=['a','e','i','o','u']\r\ns,cnt=input(),0\r\nfor i in range(len(s)):\r\n if s[i] in vowel:\r\n cnt+=1\r\nif(cnt!=5):\r\n print(\"NO\")\r\n exit()\r\ns,cnt=input(),0\r\nfor i in range(len(s)):\r\n if s[i] in vowel:\r\n cnt+=1 \r\nif(cnt!=7):\r\n print(\"NO\")\r\n exit()\r\ns,cnt=input(),0\r\nfor i in range(len(s)):\r\n if s[i] in vowel:\r\n cnt+=1 \r\nif(cnt!=5):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "slog = [\"a\" , \"e\" , \"i\" , \"o\" , \"u\"]\r\n\r\na = list(map(str,input().split()))\r\nb = list(map(str,input().split()))\r\nc = list(map(str,input().split()))\r\n\r\n#print(a , b , c)\r\n\r\nA = \"\".join(a)\r\nB = \"\".join(b)\r\nC = \"\".join(c)\r\n\r\n#print(A , B , C)\r\n\r\ncnt1 , cnt2 , cnt3 = 0 , 0 , 0\r\n\r\nfor i in range(len(A)):\r\n for j in range(len(slog)):\r\n if(A[i] == slog[j]):\r\n cnt1 += 1\r\n\r\nfor i in range(len(B)):\r\n for j in range(len(slog)):\r\n if(B[i] == slog[j]):\r\n cnt2 += 1\r\n\r\nfor i in range(len(C)):\r\n for j in range(len(slog)):\r\n if(C[i] == slog[j]):\r\n cnt3 += 1\r\n\r\n#print(cnt1 , cnt2 , cnt3)\r\n\r\nif(cnt1 == 5 and cnt2 == 7 and cnt3 == 5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n# «a» , «e» , «i» , «o» , «u»\r\n# 5 7 5", "import re\r\na=input()\r\nb=input()\r\nc=input()\r\nr=re.compile(r'[aeiou]')\r\nl1=r.findall(a)\r\nl2=r.findall(b)\r\nl3=r.findall(c)\r\nif(len(l1)==5 and len(l2)==7 and len(l3)==5):\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nb = input()\r\nc = input()\r\nans_a = 0\r\nans_b = 0\r\nans_c = 0\r\nfor i in range(len(a)):\r\n if a[i] in 'aeiou':\r\n ans_a += 1\r\nfor i in range(len(b)):\r\n if b[i] in 'aeiou':\r\n ans_b += 1\r\nfor i in range(len(c)):\r\n if c[i] in 'aeiou':\r\n ans_c += 1\r\nif ans_a == 5 and ans_b == 7 and ans_c == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "res = [sum(1 for c in input() if c in \"aeiou\") for _ in range(3)] == [5, 7, 5]\nprint(\"YES\" if res else \"NO\")\n", "samoglasnici = ['a', 'e', 'i', 'o', 'u']\r\nult = 0\r\n\r\nfor i in range(0, 3):\r\n s = input()\r\n br = 0\r\n \r\n for j in range(len(s)):\r\n if s[j] in samoglasnici:\r\n br += 1\r\n \r\n if i == 0 or i == 2:\r\n if br == 5:\r\n ult += 1\r\n\r\n if i == 1:\r\n if br == 7:\r\n ult += 1\r\n\r\nif ult == 3:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')\r\n", "l1 = input()\nl2 = input()\nl3 = input()\nl = [l1, l2, l3]\nflag = True\nk = [5, 7, 5]\nt = 0\nfor s in l:\n vow = []\n for ch in s:\n if(ch in ['a', 'e', 'i', 'o', 'u']):\n vow.append(ch)\n if(k[t] != len(vow)):\n flag = False\n break\n t += 1\nif(flag):\n print(\"YES\")\nelse:\n print(\"NO\")\n \n", "list1=['a','e','i','o','u']\r\nfor i in range(0,3):\r\n\tcount=0\r\n\ts=\"\".join(input().split())\r\n\tfor j in s:\r\n\t\tif j in list1:\r\n\t\t\tcount+=1\r\n\tif i==0 and count==5:\r\n\t\tcontinue\r\n\telif i==1 and count==7:\r\n\t\tcontinue\r\n\telif i==2 and count==5:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\tbreak", "list = []\r\nfor i in range(3):\r\n list.append(str(input()))\r\ncheck = 0 \r\nfor i in range(3):\r\n count = 0\r\n for j in range(len(list[i])):\r\n if list[i][j] == 'a' or list[i][j] == 'e' or list[i][j] == 'o' or list[i][j] == 'u' or list[i][j] == 'i':\r\n count += 1\r\n if i % 2 == 0:\r\n if count == 5:\r\n check += 1\r\n else:\r\n if count == 7:\r\n check += 1\r\n\r\n\r\n\r\n\r\nif check == 3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check_vowels(s,i=0):\r\n if i == len(s):\r\n return 0\r\n if s[i] == \"a\":\r\n return check_vowels(s,i+1) + 1\r\n elif s[i] == \"e\":\r\n return check_vowels(s,i+1) + 1\r\n elif s[i] == \"i\":\r\n return check_vowels(s,i+1) + 1\r\n elif s[i] == \"o\":\r\n return check_vowels(s,i+1) + 1\r\n elif s[i] == \"u\":\r\n return check_vowels(s,i+1)+1\r\n return check_vowels(s,i+1)\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\nx = check_vowels(s1)\r\ny = check_vowels(s2)\r\nz = check_vowels(s3)\r\nif x == 5:\r\n if y == 7:\r\n if z == 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "first=input().strip(' ')\r\nsecond=input().strip(' ')\r\nthird=input().strip(' ')\r\none,two,three=0,0,0\r\nvowels=['a','i','o','e','u']\r\nfor i in first:\r\n if i in vowels:\r\n one+=1\r\nfor i in second:\r\n if i in vowels:\r\n two+=1\r\nfor i in third:\r\n if i in vowels:\r\n three+=1\r\nif one==5 and two==7 and three==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "slogov_1 = 0\r\nslogov_2 = 0\r\nslogov_3 = 0\r\nc = 0\r\nhaiku = 0\r\nfor i in range(3):\r\n c += 1\r\n string = str(input())\r\n for g in range(len(string)):\r\n if string[g] == 'a' or string[g] == 'e' or string[g] == 'i' or string[g] == 'o' or string[g] == 'u':\r\n if c == 1:\r\n slogov_1 += 1\r\n elif c == 2:\r\n slogov_2 += 1\r\n elif c == 3:\r\n slogov_3 += 1\r\n if c == 1 and slogov_1 == 5:\r\n haiku += 1\r\n elif c == 2 and slogov_2 == 7:\r\n haiku += 1\r\n elif c == 3 and slogov_3 == 5:\r\n haiku += 1\r\nif haiku == 3:\r\n print('YES')\r\nelif haiku != 3:\r\n print('NO')", "x=input().strip()\r\ny=input().strip()\r\nz=input().strip()\r\nc=0\r\nfor i in x:\r\n if i in ['a','e','i','o','u']:\r\n c+=1\r\nif c!=5:\r\n print('NO')\r\nelse:\r\n c=0\r\n for i in y:\r\n if i in ['a','e','i','o','u']:\r\n c+=1\r\n if c!=7:\r\n print('NO')\r\n else:\r\n c=0\r\n for i in z:\r\n if i in ['a','e','i','o','u']:\r\n c+=1\r\n #print(c)\r\n if c!=5:\r\n print('NO')\r\n else:\r\n print('YES')\r\n \r\n", "g1 = input()\r\ng2 = input()\r\ng3 = input()\r\nif g1.count(\"a\") + g1.count(\"e\") + g1.count(\"i\") + g1.count(\"o\") + g1.count(\"u\") == 5 and \\\r\n g2.count(\"a\") + g2.count(\"e\") + g2.count(\"i\") + g2.count(\"o\") + g2.count(\"u\") == 7 and \\\r\n g3.count(\"a\") + g3.count(\"e\") + g3.count(\"i\") + g3.count(\"o\") + g3.count(\"u\") == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "v=\"aeiou\"\r\ns1=input()\r\ns2=input()\r\ns3=input()\r\nsyl1=sum(i in v for i in s1)\r\nsyl2=sum(i in v for i in s2)\r\nsyl3=sum(i in v for i in s3)\r\nif syl1==5 and syl2==7 and syl3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\n\r\ns1 = str(input())\r\ns2 = str(input())\r\ns3 = str(input())\r\nr1 = 0\r\nr2 = 0\r\nr3 = 0\r\n\r\nfor i in s1:\r\n if i == \"u\" or i == \"i\" or i == \"a\" or i == \"e\" or i == \"o\":\r\n r1 += 1\r\n\r\nif r1 != 5:\r\n print(\"NO\")\r\n sys.exit()\r\n\r\nfor i in s2:\r\n if i == \"u\" or i == \"i\" or i == \"a\" or i == \"e\" or i == \"o\":\r\n r2 += 1\r\n\r\nif r2 != 7:\r\n print(\"NO\")\r\n sys.exit()\r\n\r\nfor i in s3:\r\n if i == \"u\" or i == \"i\" or i == \"a\" or i == \"e\" or i == \"o\":\r\n r3 += 1\r\n\r\nif r3 != 5:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a=str(input())\r\nb=str(input())\r\nc=str(input())\r\n#print(len(a),len(b),len(c))\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor j in a:\r\n if j==\"a\" or j==\"e\" or j==\"i\" or j==\"o\" or j==\"u\":\r\n c1=c1+1\r\n# print(c1) \r\nfor j in b:\r\n if j==\"a\" or j==\"e\" or j==\"i\" or j==\"o\" or j==\"u\":\r\n c2=c2+1\r\n# print(c2) \r\nfor j in c:\r\n if j==\"a\" or j==\"e\" or j==\"i\" or j==\"o\" or j==\"u\":\r\n c3=c3+1\r\n# print(c3) \r\nif(c1==5 and c2==7 and c3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "vowel = ['a', 'e', 'i', 'o', 'u']\r\nlength = [5, 7, 5]\r\n\r\nfor _ in range(3):\r\n line = input()\r\n \r\n cnt = 0\r\n for char in line:\r\n if char in vowel:\r\n cnt += 1\r\n\r\n if cnt != length[_]:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")\r\n", "s = []\r\nfor i in range(3):\r\n tmp = (input())\r\n s.append(tmp)\r\n\r\ncount = []\r\nfor i in s:\r\n tmp_count = i.count('a')\r\n tmp_count += i.count('e')\r\n tmp_count += i.count('o')\r\n tmp_count += i.count('i')\r\n tmp_count += i.count('u')\r\n\r\n count.append(tmp_count)\r\nif count == [5, 7, 5]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "Line1=input()\r\nLine2=input()\r\nLine3=input()\r\n\r\nVowels1=0\r\nVowels2=0\r\nVowels3=0\r\n\r\nfor letter in Line1:\r\n if(letter in 'aieou'):\r\n Vowels1+=1\r\nfor letter in Line2:\r\n if(letter in 'aieou'):\r\n Vowels2+=1\r\nfor letter in Line3:\r\n if(letter in 'aieou'):\r\n Vowels3+=1\r\n\r\nif(Vowels1==5 and Vowels2==7 and Vowels3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\nv=\"aeiou\"\r\nc=p=k=0\r\nfor i in s1:\r\n if i in v:\r\n c+=1\r\nfor i in s2:\r\n if i in v:\r\n p+=1\r\nfor i in s3:\r\n if i in v:\r\n k+=1\r\nif c==5 and p==7 and k==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_haiku(l1, l2, l3):\r\n vowel = ['a', 'e', 'i', 'o', 'u']\r\n lines = [l1, l2, l3]\r\n vowel_count = [0, 0, 0]\r\n\r\n for index in range(len(lines)):\r\n for char in lines[index]:\r\n if char in vowel:\r\n vowel_count[index] += 1\r\n \r\n return vowel_count == [5, 7, 5]\r\n\r\nprint(\"YES\" if is_haiku(input(), input(), input()) else \"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\n \r\nsum = s1.count('a') + s1.count('e') + s1.count('i') + s1.count('o') + s1.count('u')\r\nsum2 = s2.count('a') + s2.count('e') + s2.count('i') + s2.count('o') + s2.count('u')\r\nsum3 = s3.count('a') + s3.count('e') + s3.count('i') + s3.count('o') + s3.count('u')\r\n \r\nif sum == 5 and sum2 == 7 and sum3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Codeforces A. Haiku\r\n# Created by Abdulrahman Elsayed on 13/01/2021\r\n\r\nl1 = input()\r\nl2 = input()\r\nl3 = input()\r\nw1 = 0\r\nw2 = 0\r\nw3 = 0\r\n\r\nfor c in l1:\r\n if ((c == 'a') or (c == 'e') or (c == 'i') or (c == 'o') or (c == 'u')):\r\n w1 += 1\r\nfor c in l2:\r\n if ((c == 'a') or (c == 'e') or (c == 'i') or (c == 'o') or (c == 'u')):\r\n w2 += 1\r\nfor c in l3:\r\n if ((c == 'a') or (c == 'e') or (c == 'i') or (c == 'o') or (c == 'u')):\r\n w3 += 1 \r\n\r\nif ((w1 == 5) and (w2 == 7) and (w3 == 5)):\r\n print('YES')\r\nelse:\r\n print('NO')", "s1=input()\r\ns2=input()\r\ns3=input()\r\ns1=s1.strip()\r\ns2=s2.strip()\r\ns3=s3.strip()\r\nsyllables = set(\"AEIOUaeiou\")\r\n##print(s1)\r\n##print(s2)\r\n##print(s3)\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor i in s1:\r\n if(i in syllables):\r\n c1+=1\r\n\r\nfor i in s2:\r\n if(i in syllables):\r\n c2+=1\r\n\r\nfor i in s3:\r\n if(i in syllables):\r\n c3+=1\r\n\r\nif(c1==5 and c2==7 and c3==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "dem, a, b, c = 0, input(), input(), input()\r\nfor x in a:\r\n if x in ['u', 'e', 'o', 'a', 'i']: dem += 1\r\nif dem != 5: print(\"NO\")\r\nelse:\r\n for x in b:\r\n if x in ['u', 'e', 'o', 'a', 'i']: dem += 1\r\n if dem != 12: print(\"NO\")\r\n else:\r\n for x in c:\r\n if x in ['u', 'e', 'o', 'a', 'i']: dem += 1\r\n if dem != 17: print(\"NO\")\r\n else: print(\"YES\")", "#!/usr/bin/python3\r\n\r\nis_haiku = True\r\n\r\nfor x in range(0, 3):\r\n phrase = input()\r\n phrase = phrase.strip()\r\n \r\n # count the number of vowels in the phrase\r\n vowel_cnt = phrase.count('a') + phrase.count('e') + phrase.count('i') + phrase.count('o') + phrase.count('u')\r\n \r\n if (x == 0 and vowel_cnt != 5) or (x == 1 and vowel_cnt != 7) or (x == 2 and vowel_cnt != 5):\r\n is_haiku = False\r\n break\r\n\r\nif is_haiku:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "def ishaiku(s1,s2,s3):\n\tcnt_s1=0\n\tcnt_s2=0\n\tcnt_s3=0\n\n\tfor i in s1:\n\t\tif(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n\t\t\tcnt_s1+=1\n\tfor i in s2:\n\t\tif(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n\t\t\tcnt_s2+=1\n\tfor i in s3:\n\t\tif(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n\t\t\tcnt_s3+=1\n\n\tif(cnt_s1==5 and cnt_s2==7 and cnt_s3==5):\n\t\treturn True \n\treturn False \n\n\ndef main():\n\ts1=str(input()).replace(\" \",\"\")\n\ts2=str(input()).replace(\" \",\"\")\n\ts3=str(input()).replace(\" \",\"\")\n\n\tif(ishaiku(s1,s2,s3)):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\nif __name__=='__main__':\n\tmain()\n", "def main():\r\n ans=''\r\n for i in range(3):\r\n s=input()\r\n count=0\r\n if(i==0 or i==2):\r\n for j in range(len(s)):\r\n if (s[j]=='a' or s[j]=='e' or s[j]=='i' or s[j]=='o' or s[j]=='u'):\r\n count+=1\r\n\r\n if count!=5: \r\n ans='NO'\r\n else:\r\n for j in range(len(s)):\r\n if (s[j]=='a' or s[j]=='e' or s[j]=='i' or s[j]=='o' or s[j]=='u'):\r\n count+=1\r\n\r\n if count!=7:\r\n ans='NO'\r\n\r\n print('NO') if ans==\"NO\" else print('YES')\r\n\r\n \r\nmain()", "x=0\r\nfor i in range(3):\r\n s=input()\r\n c=0\r\n if i==0 or i==2:\r\n for i in s:\r\n if i in 'aeiou':\r\n c+=1\r\n if c!=5:\r\n x+=1\r\n else:\r\n for i in s:\r\n if i in 'aeiou':\r\n c+=1\r\n if c!=7:\r\n x+=1 \r\nif not x:\r\n print(\"YES\")\r\nelse:print(\"NO\")", "import re\r\npattern = re.compile('[a,e,i,o,u]')\r\na = len(pattern.findall(str(input())))\r\nb = len(pattern.findall(str(input())))\r\nc = len(pattern.findall(str(input())))\r\nprint('YES' if a == 5 and b == 7 and c == 5 else 'NO')", "v = set('aeiou')\r\narr = [5,7,5]\r\nfor i in range(3):\r\n\ts = input()\r\n\ttemp = 0\r\n\tfor letter in s:\r\n\t\tif letter in v:\r\n\t\t\ttemp+=1\r\n\tif temp != arr[i]:\r\n\t\tprint('NO')\r\n\t\texit()\r\nprint('YES')\r\n\r\n", "#https://codeforces.com/problemset/problem/78/A\nv='aeiou'\nf=1\nfor i in range(3):\n\tc=0\n\tfor j in input():\n\t\tif j in v:\n\t\t\tc+=1\n\tif i&1 and c!=7:\n\t\tf=0\n\tif (not i&1) and c!=5:\n\t\tf=0\nif f:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "vs=set('a e i o u'.split())\r\n\r\ndef cov(s):\r\n\t\"\"\"count of vowels\"\"\"\r\n\tr=0\r\n\tfor c in s:\r\n\t\tif c in vs or c.lower() in vs:\r\n\t\t\tr+=1\r\n\treturn r\r\n\r\ndef ih(v):\r\n\t\"\"\"is haiku\"\"\"\r\n\tnv=[5,7,5]\r\n\tfor c in range(len(v)):\r\n\t\tif cov(v[c])!=nv[c]:\r\n\t\t\treturn 0\r\n\treturn 1\r\n\r\nv=[]\r\nfor c in range(3):\r\n\tv.append(input())\r\ns='YES' if ih(v) else 'NO'\r\nprint(s)", "s=input()\r\ns1=input()\r\ns2=input()\r\nsum1=sum2=sum3=0\r\nlst=['a','e','i','o','u']\r\nfor i in lst:\r\n sum1+=s.count(i)\r\n sum2+=s1.count(i)\r\n sum3+=s2.count(i)\r\nif sum1==5 and sum2==7 and sum3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nfor i in range(1,4):\r\n s=input()\r\n sum=s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')\r\n if((i==2 and sum!=7)or(i!=2 and sum!=5)):\r\n exit(print('NO'))\r\nprint('YES')\r\n\r\n", "str1 = input()\r\nstr2 = input()\r\nstr3 = input()\r\ncnt1, cnt2, cnt3 = 0, 0, 0\r\nfor i in str1:\r\n if i in 'aeiou':\r\n cnt1 += 1\r\nfor i in str2:\r\n if i in 'aeiou':\r\n cnt2 += 1\r\nfor i in str3:\r\n if i in 'aeiou':\r\n cnt3 += 1\r\nif cnt1==5 and cnt2==7 and cnt3==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "for i in range(3):\r\n if (sum(j in set('aeiou') for j in input())!=-abs(i-1)*2+7):\r\n print('NO')\r\n exit(0)\r\nprint('YES')\r\n", "# https://codeforces.com/contest/78/problem/A\r\n\r\n\r\ndef single_integer():\r\n return int(input())\r\n\r\n\r\ndef multi_integer():\r\n return map(int, input().split())\r\n\r\n\r\ndef string():\r\n return input()\r\n\r\n\r\ndef multi_string():\r\n return input().split()\r\n\r\n\r\nvowels = {\"a\", \"e\", \"i\", \"o\", \"u\"}\r\nanswers = (5, 7, 5)\r\nfor j in answers:\r\n temp = 0\r\n s = input()\r\n for i in s:\r\n if i in vowels:\r\n temp += 1\r\n\r\n if temp != j :\r\n print(\"NO\")\r\n break\r\n\r\nelse:\r\n print(\"YES\")\r\n", "def checkVowel(str1):\n\tcnt=0\n\tfor i in str1:\n\t\tif (i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\n\t\t\tcnt+=1\n\treturn cnt \n\n\ndef checkHaiku(str1:str,str2:str,str3:str)->bool:\n\tv1=checkVowel(str1)\n\tv2=checkVowel(str2)\n\tv3=checkVowel(str3)\n\n\tif(v1==5 and v2==7 and v3==5):\n\t\treturn True \n\telse:\n\t\treturn False \n\n\ndef main():\n\tstr1=str(input())\n\tstr2=str(input())\n\tstr3=str(input())\n\n\tif(checkHaiku(str1,str2,str3)==True):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\nif __name__=='__main__':\n\tmain()", "def syllable(s,n):\r\n c=0\r\n for x in s:\r\n if x=='a' or x=='e' or x=='i' or x=='o' or x=='u':c+=1\r\n return True if c==n else False\r\ns1,s2,s3=input().strip(),input().strip(),input().strip()\r\nprint('YES' if syllable(s1,5) and syllable(s2,7) and syllable(s3,5) else 'NO')", "def answer():\r\n vowels=\"aeiou\"\r\n\r\n l1=len([x for x in list(input()) if x in vowels])\r\n l2=len([x for x in list(input()) if x in vowels])\r\n l3=len([x for x in list(input()) if x in vowels])\r\n\r\n if l1==5 and l2==7 and l3==5: print(\"YES\")\r\n else: print(\"NO\")\r\nanswer()", "def vowels(s):\r\n ans = 0\r\n for ch in s:\r\n if ch in \"aeiou\":\r\n ans += 1\r\n return ans\r\nx, y, z = (input() for _ in range(3))\r\nif vowels(x) == 5 and vowels(y) == 7 and vowels(z) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "line1 = list(map(str,input().strip()))\nline2 = list(map(str,input().strip()))\nline3 = list(map(str,input().strip()))\n#print(line1)\nsum1 = 0\nfor i in line1:\n if i == \"a\" or i == \"e\"or i == \"i\"or i == \"o\" or i ==\"u\":\n sum1 = sum1 + 1\n\n\nsum2 = 0\n\nfor i in line2:\n if i == \"a\" or i == \"e\"or i == \"i\"or i == \"o\" or i ==\"u\":\n sum2 = sum2 + 1\n\n\n\nsum3 = 0\n\nfor i in line3:\n if i == \"a\" or i == \"e\"or i == \"i\"or i == \"o\" or i ==\"u\":\n sum3 = sum3 + 1\n\nif sum1 != 5 or sum3 != 5 or sum2 != 7:\n print(\"NO\")\nelse:\n print(\"YES\")\n\t\t \t\t \t \t\t \t \t\t \t", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\na = s1.count(\"a\") + s1.count(\"o\") + s1.count(\"e\") + s1.count(\"i\") + s1.count(\"u\") \r\nb = s2.count(\"a\") + s2.count(\"o\") + s2.count(\"e\") + s2.count(\"i\") + s2.count(\"u\")\r\nc = s3.count(\"a\") + s3.count(\"o\") + s3.count(\"e\") + s3.count(\"i\") + s3.count(\"u\")\r\nprint (\"YES\" if a == 5 and b == 7 and c == 5 else \"NO\")", "a= input()\r\nb= input()\r\nc= input()\r\nd=['a','e','i','o','u']\r\np=0\r\nq=0\r\nr=0\r\nfor i in range(len(a)):\r\n if(a[i] in d):\r\n p=p+1\r\nfor i in range(len(b)):\r\n if(b[i] in d):\r\n q+=1\r\nfor i in range(len(c)):\r\n if(c[i] in d):\r\n r+=1\r\nif(p==5 and q==7 and r==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l = [input().strip() for i in range(3)]\n\nk = [0]*3\nfor i in range(len(l)):\n\tfor j in l[i]:\n\t\tif j in 'aeiou':\n\t\t\tk[i] += 1\nif k == [5, 7, 5]:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "phaseOne = list(input().replace(\" \", \"\"))\r\nphaseTwo = list(input().replace(\" \", \"\"))\r\nphaseThree = list(input().replace(\" \", \"\"))\r\nsyllOne = 0\r\nsyllTwo = 0\r\nsyllThree = 0\r\nok = True\r\nvowels = ['a', 'e', 'i', 'o', 'u']\r\nfor i in range(len(phaseOne)):\r\n tempChr = phaseOne[i]\r\n if(tempChr in vowels):\r\n syllOne += 1\r\nif(syllOne == 5):\r\n for j in range(len(phaseTwo)):\r\n tempChr = phaseTwo[j]\r\n if(tempChr in vowels):\r\n syllTwo += 1\r\n if(syllTwo == 7):\r\n for z in range(len(phaseThree)):\r\n tempChr = phaseThree[z]\r\n if(tempChr in vowels):\r\n syllThree += 1\r\n if(syllThree != 5):\r\n ok = False\r\n else:\r\n ok = False \r\nelse:\r\n ok = False \r\nprint(\"YES\" if ok else \"NO\")", "def fun(x):\r\n\tn = 0\r\n\tfor i in x:\r\n\t\tif i in ('a', 'e', 'i', 'o', 'u'):\r\n\t\t\tn += 1\r\n\t\t\t\r\n\treturn(n)\r\n\r\na, b, c = input(), input(), input()\r\n\r\nif fun(a) == 5 and fun(b) == 7 and fun(c) == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "vowels = \"aeiouAEIOU\"\r\n\r\nl1 = input().strip()\r\nl2 = input().strip()\r\nl3 = input().strip()\r\n\r\nc1, c2, c3 = 0, 0, 0\r\nfor i in l1:\r\n if i in vowels:\r\n c1 += 1\r\n \r\nfor i in l2:\r\n if i in vowels:\r\n c2 += 1\r\n \r\nfor i in l3:\r\n if i in vowels:\r\n c3 += 1\r\n#print(c1, c2, c3)\r\nif c1 == 5 and c2 == 7 and c3 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "cases = 3\r\n\r\nvows = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\n\r\nans = []\r\ntarget = [5, 7, 5]\r\nwhile cases:\r\n cases -= 1\r\n ct = 0\r\n s = input()\r\n\r\n for char in s:\r\n if char in vows:\r\n ct += 1\r\n ans.append(ct)\r\n\r\nif ans == target:\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", "s1= input()\r\ns2= input()\r\ns3= input()\r\nvow= ['a','e','i','o','u']\r\nc1,c2,c3=0,0,0\r\nfor i in range(len(s1)):\r\n if (s1[i] in vow):\r\n c1+=1\r\nfor i in range(len(s2)):\r\n if (s2[i] in vow):\r\n c2+=1\r\nfor i in range(len(s3)):\r\n if (s3[i] in vow):\r\n c3+=1\r\nif (c1==c3==5 and c2==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\ns='aeiou'\r\nq=' '\r\nw=' '\r\ne=' '\r\nfor i in a:\r\n if i in s:\r\n q+=i\r\nfor j in b:\r\n if j in s:\r\n w+=j\r\nfor h in c:\r\n if h in s:\r\n e+=h\r\nif len(q)==5+1 and len(w)==7+1 and len(e)==5+1:\r\n print('YES')\r\nelse:\r\n print('NO')", "vowels = \"aeiou\"\r\n\r\nanswer = True\r\n\r\ndef good(line, n):\r\n count = 0\r\n for i in range(len(line)):\r\n if line[i] in vowels:\r\n count += 1\r\n if count == n:\r\n return True\r\n else:\r\n return False\r\nfor i in range(3):\r\n line = input()\r\n if i % 2 == 0:\r\n if good(line, 5) == True:\r\n continue\r\n else:\r\n answer = False\r\n break\r\n else:\r\n if good(line, 7) == True:\r\n continue\r\n else:\r\n answer = False\r\n break\r\nif answer:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t = [\"a\",\"e\",\"i\",\"o\",\"u\"]\r\na = input()\r\nb = input()\r\nc = input()\r\nx = 0\r\ny = 0\r\nz = 0\r\nfor i in t:\r\n x += a.count(i)\r\n y += b.count(i)\r\n z += c.count(i)\r\n\r\nif( x == 5 and y == 7 and z == 5 ):\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "# cook your dish here\r\ns1=input()\r\ns2=input()\r\ns3=input()\r\ntmp=['a','e','i','o','u']\r\nl1=len(s1)\r\nl2=len(s2)\r\nl3=len(s3)\r\nc1=c2=c3=0\r\nfor i in range(l1):\r\n if s1[i] in tmp:\r\n c1=c1+1\r\nfor i in range(l2):\r\n if s2[i] in tmp:\r\n c2=c2+1\r\nfor i in range(l3):\r\n if s3[i] in tmp:\r\n c3=c3+1\r\n#print(c1,c2,c3)\r\nif c1==5 and c2==7 and c3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1=input()\r\ns2=input()\r\ns3=input()\r\np1,p2,p3=0,0,0\r\nfor i in s1:\r\n if i==\"a\" or i==\"e\" or i==\"i\" or i==\"o\" or i==\"u\":\r\n p1=p1+1\r\nfor i in s2:\r\n if i==\"a\" or i==\"e\" or i==\"i\" or i==\"o\" or i==\"u\":\r\n p2=p2+1\r\nfor i in s3:\r\n if i==\"a\" or i==\"e\" or i==\"i\" or i==\"o\" or i==\"u\":\r\n p3=p3+1\r\nif p1==5 and p2==7 and p3==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "res=\"YES\"\r\na=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nfor i in range(3):\r\n count=0\r\n n=input().strip()\r\n for j in range(len(n)):\r\n if n[j] in a:\r\n count+=1\r\n if i==0 and count!=5:\r\n res=\"NO\"\r\n \r\n if i==1 and count!=7:\r\n res=\"NO\"\r\n \r\n if i==2 and count!=5:\r\n res=\"NO\"\r\n \r\nprint(res)", "def main():\r\n\tvowel = ['a', 'i', 'u', 'e', 'o']\r\n\r\n\ts1 = str(input())\r\n\ts2 = str(input())\r\n\ts3 = str(input())\r\n\r\n\tn1 = 0\r\n\tn2 = 0\r\n\tn3 = 0\r\n\r\n\tfor el in s1:\r\n\t\tif el in vowel:\r\n\t\t\tn1 += 1\r\n\tfor el in s2:\r\n\t\tif el in vowel:\r\n\t\t\tn2 += 1\r\n\tfor el in s3:\r\n\t\tif el in vowel:\r\n\t\t\tn3 += 1\r\n\r\n\tif n1 == 5 and n2 == 7 and n3 == 5:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "l=input()\r\nl2=input()\r\nl3=input()\r\ncount=0\r\ncount2=0\r\ncount3=0\r\n# print(l2[1])\r\nfor i in range(len(l)):\r\n\tif l[i]=='a' or l[i]==\"e\" or l[i]==\"i\" or l[i]==\"o\" or l[i]==\"u\":\r\n\t\tcount+=1\r\nfor i in range(len(l2)):\r\n\tif l2[i]==\"a\" or l2[i]==\"e\" or l2[i]==\"i\" or l2[i]==\"o\" or l2[i]==\"u\":\r\n\t\tcount2+=1\r\nfor i in range(len(l3)):\r\n\tif l3[i]==\"a\" or l3[i]==\"e\" or l3[i]==\"i\" or l3[i]==\"o\" or l3[i]==\"u\":\r\n\t\tcount3+=1\r\nif count==5 and count2==7 and count3==5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "from collections import Counter\r\nans = 'YES'\r\nq = [5, 7, 5]\r\nfor i in range(3):\r\n n = input()\r\n p = Counter(n)\r\n if (p['a'] + p['e'] + p['i'] + p['o'] + p['u']) != q[i]:\r\n ans = 'NO'\r\n break\r\nprint(ans)", "l1=input()\r\nl2=input()\r\nl3=input()\r\nc1=c2=c3=0\r\nl=['a','e','i','o','u']\r\nfor i in l1:\r\n if i in l:\r\n c1=c1+1\r\nif c1==5:\r\n for j in l2:\r\n if j in l:\r\n c2=c2+1\r\n if c2==7:\r\n for k in l3:\r\n if k in l:\r\n c3=c3+1\r\n if c3==5:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "ok = True\r\nfor i in range(3):\r\n s = input()\r\n ok &= len(list(filter(lambda x: x in \"aiueo\", s))) == 5 + (i % 2) * 2\r\nprint([\"NO\", \"YES\"][ok])", "import re\nregex = re.compile(r\"[a|e|i|o|u]\")\n\nfirst_line = len(regex.findall(input()))\nsecond_line = len(regex.findall(input()))\nthird_line = len(regex.findall(input()))\n\n# print(first_line, second_line, third_line)\n\nif (first_line == 5 and second_line == 7 and third_line == 5):\n print('YES')\nelse:\n print('NO')\n", "first = input()\r\nsecond = input()\r\nthird = input()\r\nvowel = \"aeiou\"\r\ncount1 = 0\r\ncount2 = 0\r\ncount3 = 0\r\nfor c in first :\r\n if c in vowel :\r\n count1 += 1\r\nfor c in second :\r\n if c in vowel :\r\n count2 += 1\r\nfor c in third :\r\n if c in vowel :\r\n count3 += 1\r\n \r\nif count1==5 and count2==7 and count3==5 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\n\r\na_c=0\r\nb_c=0\r\nc_c=0\r\n\r\nfor i in range(len(a)):\r\n if a[i] in \"aeiou\":\r\n a_c+=1\r\n\r\nfor i in range(len(b)):\r\n if b[i] in \"aeiou\":\r\n b_c+=1\r\n\r\nfor i in range(len(c)):\r\n if c[i] in \"aeiou\":\r\n c_c+=1\r\n\r\nif(a_c==5 and b_c==7 and c_c==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nfor _ in range(3):\r\n a=input()\r\n w=[5,7,5]\r\n l=['a','e','i','o','u']\r\n p=0\r\n for i in a:\r\n if i in l:\r\n p+=1\r\n if p==w[_]:\r\n continue\r\n else:\r\n print('NO')\r\n sys.exit()\r\nprint('YES')", "a=input().strip()\r\nb=input().strip()\r\nc=input().strip()\r\no=p=q=0\r\nfor i in a:\r\n\tif i in ['a','e','i','o','u']:\r\n\t\to+=1\r\nfor i in b:\r\n\tif i in ['a','e','i','o','u']:\r\n\t\tp+=1\r\nfor i in c:\r\n\tif i in ['a','e','i','o','u']:\r\n\t\tq+=1\r\nif o==5 & p==7 &q==5:\r\n\tprint('YES')\r\nelse:print('NO')", "def count_syllables(phrase):\r\n vowels = \"aeiou\"\r\n count = 0\r\n for letter in phrase:\r\n if letter in vowels:\r\n count += 1\r\n return count\r\n\r\n# Read three input lines\r\nphrases = [input().strip() for _ in range(3)]\r\n\r\n# Count syllables in each phrase\r\nsyllable_counts = [count_syllables(phrase) for phrase in phrases]\r\n\r\n# Check if it's a haiku (5-7-5 pattern)\r\nif syllable_counts == [5, 7, 5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "try:\r\n a = input()\r\n b = input()\r\n c = input()\r\n x = a.count(\"a\") + a.count(\"u\") + a.count(\"o\") + a.count(\"i\") + a.count(\"e\")\r\n y = b.count(\"a\") + b.count(\"u\") + b.count(\"o\") + b.count(\"i\") + b.count(\"e\")\r\n z = c.count(\"a\") + c.count(\"u\") + c.count(\"o\") + c.count(\"i\") + c.count(\"e\")\r\n if x == 5 and y == 7 and z == 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nexcept:\r\n pass", "def count_vowels(s):\r\n return sum(c in set('aeoui') for c in s)\r\n\r\ncounts = [count_vowels(input()) for _ in range(3)]\r\n\r\nprint(('NO', 'YES')[counts == [5, 7, 5]])\r\n" ]

{"inputs": ["on codeforces \nbeta round is running\n a rustling of keys ", "how many gallons\nof edo s rain did you drink\n cuckoo", " hatsu shigure\n saru mo komino wo\nhoshige nari", "o vetus stagnum\n rana de ripa salit\n ac sonant aquae", " furuike ya\nkawazu tobikomu\nmizu no oto ", " noch da leich\na stamperl zum aufwaerma\n da pfarrer kimmt a ", " sommerfuglene \n hvorfor bruge mange ord\n et kan gore det", " ab der mittagszeit\n ist es etwas schattiger\n ein wolkenhimmel", "tornando a vederli\ni fiori di ciliegio la sera\nson divenuti frutti", "kutaburete\nyado karu koro ya\nfuji no hana", " beginnings of poetry\n the rice planting songs \n of the interior", " door zomerregens\n zijn de kraanvogelpoten\n korter geworden", " derevo na srub\na ptitsi bezzabotno\n gnezdishko tam vyut", "writing in the dark\nunaware that my pen\nhas run out of ink", "kusaaiu\nuieueua\nuo efaa", "v\nh\np", "i\ni\nu", "awmio eoj\nabdoolceegood\nwaadeuoy", "xzpnhhnqsjpxdboqojixmofawhdjcfbscq\nfoparnxnbzbveycoltwdrfbwwsuobyoz hfbrszy\nimtqryscsahrxpic agfjh wvpmczjjdrnwj mcggxcdo", "wxjcvccp cppwsjpzbd dhizbcnnllckybrnfyamhgkvkjtxxfzzzuyczmhedhztugpbgpvgh\nmdewztdoycbpxtp bsiw hknggnggykdkrlihvsaykzfiiw\ndewdztnngpsnn lfwfbvnwwmxoojknygqb hfe ibsrxsxr", "nbmtgyyfuxdvrhuhuhpcfywzrbclp znvxw synxmzymyxcntmhrjriqgdjh xkjckydbzjbvtjurnf\nhhnhxdknvamywhsrkprofnyzlcgtdyzzjdsfxyddvilnzjziz qmwfdvzckgcbrrxplxnxf mpxwxyrpesnewjrx ajxlfj\nvcczq hddzd cvefmhxwxxyqcwkr fdsndckmesqeq zyjbwbnbyhybd cta nsxzidl jpcvtzkldwd", "rvwdsgdsrutgjwscxz pkd qtpmfbqsmctuevxdj kjzknzghdvxzlaljcntg jxhvzn yciktbsbyscfypx x xhkxnfpdp\nwdfhvqgxbcts mnrwbr iqttsvigwdgvlxwhsmnyxnttedonxcfrtmdjjmacvqtkbmsnwwvvrlxwvtggeowtgsqld qj\nvsxcdhbzktrxbywpdvstr meykarwtkbm pkkbhvwvelclfmpngzxdmblhcvf qmabmweldplmczgbqgzbqnhvcdpnpjtch ", "brydyfsmtzzkpdsqvvztmprhqzbzqvgsblnz naait tdtiprjsttwusdykndwcccxfmzmrmfmzjywkpgbfnjpypgcbcfpsyfj k\nucwdfkfyxxxht lxvnovqnnsqutjsyagrplb jhvtwdptrwcqrovncdvqljjlrpxcfbxqgsfylbgmcjpvpl ccbcybmigpmjrxpu\nfgwtpcjeywgnxgbttgx htntpbk tkkpwbgxwtbxvcpkqbzetjdkcwad tftnjdxxjdvbpfibvxuglvx llyhgjvggtw jtjyphs", "nyc aqgqzjjlj mswgmjfcxlqdscheskchlzljlsbhyn iobxymwzykrsnljj\nnnebeaoiraga\nqpjximoqzswhyyszhzzrhfwhf iyxysdtcpmikkwpugwlxlhqfkn", "lzrkztgfe mlcnq ay ydmdzxh cdgcghxnkdgmgfzgahdjjmqkpdbskreswpnblnrc fmkwziiqrbskp\np oukeaz gvvy kghtrjlczyl qeqhgfgfej\nwfolhkmktvsjnrpzfxcxzqmfidtlzmuhxac wsncjgmkckrywvxmnjdpjpfydhk qlmdwphcvyngansqhl", "yxcboqmpwoevrdhvpxfzqmammak\njmhphkxppkqkszhqqtkvflarsxzla pbxlnnnafqbsnmznfj qmhoktgzix qpmrgzxqvmjxhskkksrtryehfnmrt dtzcvnvwp\nscwymuecjxhw rdgsffqywwhjpjbfcvcrnisfqllnbplpadfklayjguyvtrzhwblftclfmsr", "qfdwsr jsbrpfmn znplcx nhlselflytndzmgxqpgwhpi ghvbbxrkjdirfghcybhkkqdzmyacvrrcgsneyjlgzfvdmxyjmph\nylxlyrzs drbktzsniwcbahjkgohcghoaczsmtzhuwdryjwdijmxkmbmxv yyfrokdnsx\nyw xtwyzqlfxwxghugoyscqlx pljtz aldfskvxlsxqgbihzndhxkswkxqpwnfcxzfyvncstfpqf", "g rguhqhcrzmuqthtmwzhfyhpmqzzosa\nmhjimzvchkhejh irvzejhtjgaujkqfxhpdqjnxr dvqallgssktqvsxi\npcwbliftjcvuzrsqiswohi", " ngxtlq iehiise vgffqcpnmsoqzyseuqqtggokymol zn\nvjdjljazeujwoubkcvtsbepooxqzrueaauokhepiquuopfild\ngoabauauaeotoieufueeknudiilupouaiaexcoapapu", "ycnvnnqk mhrmhctpkfbc qbyvtjznmndqjzgbcxmvrpkfcll zwspfptmbxgrdv dsgkk nfytsqjrnfbhh pzdldzymvkdxxwh\nvnhjfwgdnyjptsmblyxmpzylsbjlmtkkwjcbqwjctqvrlqqkdsrktxlnslspvnn mdgsmzblhbnvpczmqkcffwhwljqkzmk hxcm\nrghnjvzcpprrgmtgytpkzyc mrdnnhpkwypwqbtzjyfwvrdwyjltbzxtbstzs xdjzdmx yjsqtzlrnvyssvglsdjrmsrfrcdpqt", "ioeeaioeiuoeaeieuuieooaouiuouiioaueeaiaiuoaoiioeeaauooiuuieeuaeeoauieeaiuoieiaieuoauaaoioooieueueuai\nuooaoeeaoiuuoeioaoouaououoeioiaeueoioaiouaeaoioiuuaueeuaiuoiueoiuaoeeieeouaeeaeeieioeoiiieuuueuuieuo\naeeouieeieoueaioeoioooiouaeeeiaaioueauaueiouuuaieuuioiaeiueauueaoieauauoeueuaiueuuaueeoueauaeaoieeoo", "mkgycgmrqtmlwj vddlbsgdptyfrcj nmrddjchydvbsyhgzytfzvwbhqmmhkpsyrcnknpsqrr wcnf wfvgskrnsmnrcqgcnc q\npn cclcyjjdp rqkpgyrvyyd hhynrochfa pthyffqvskazfshvzcmvhmsrxvquzkdvivlbfypwbgltfbjmhzljvgzmxjlrjdjq\nauuouieuaaauoooeoiuoaueuueauiuuuiaeuwuoiaeoeaieauieouoaeiiieiioiuuuiuauioiiuoeauueieaueiaioeuaoaaau", "ab\na\na", "on codeforcs\nbeta round is runnineg\na rustling of keys", "coooooooooooooooood\nd\nd", "on codeforces \nbeta round is runninog\n a rustling of keys", "aaaaaaaaaaaaaaa\na\na", "aaaaaccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc\naaaaaaaccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc\naaaaaccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc", "cccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc\ncccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc\ncccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc", "aaaaaa\naaaaaa\naaaaa"], "outputs": ["YES", "NO", "YES", "NO", "YES", "NO", "YES", "NO", "NO", "YES", "NO", "NO", "YES", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO"]}

UNKNOWN

PYTHON3

CODEFORCES

426

9193fd7c419ef9dff9dc9dcd79640cdc

Card Game Again

Vova again tries to play some computer card game. The rules of deck creation in this game are simple. Vova is given an existing deck of *n* cards and a magic number *k*. The order of the cards in the deck is fixed. Each card has a number written on it; number *a**i* is written on the *i*-th card in the deck. After receiving the deck and the magic number, Vova removes *x* (possibly *x*<==<=0) cards from the top of the deck, *y* (possibly *y*<==<=0) cards from the bottom of the deck, and the rest of the deck is his new deck (Vova has to leave at least one card in the deck after removing cards). So Vova's new deck actually contains cards *x*<=+<=1, *x*<=+<=2, ... *n*<=-<=*y*<=-<=1, *n*<=-<=*y* from the original deck. Vova's new deck is considered valid iff the product of all numbers written on the cards in his new deck is divisible by *k*. So Vova received a deck (possibly not a valid one) and a number *k*, and now he wonders, how many ways are there to choose *x* and *y* so the deck he will get after removing *x* cards from the top and *y* cards from the bottom is valid? The first line contains two integers *n* and *k* (1<=≤<=*n*<=≤<=100<=000, 1<=≤<=*k*<=≤<=109). The second line contains *n* integers *a*1, *a*2, ..., *a**n* (1<=≤<=*a**i*<=≤<=109) — the numbers written on the cards. Print the number of ways to choose *x* and *y* so the resulting deck is valid. Sample Input 3 4 6 2 8 3 6 9 1 14 Sample Output 4 1

[ "R,G=lambda:map(int,input().split()),range\r\nn,k=R();a=[0]+[*R()];z,l,p=0,1,1\r\nfor r in G(1,n+1):\r\n p=p*a[r]%k\r\n if p==0:\r\n p=1;i=r\r\n while p*a[i]%k:p=p*a[i]%k;i-=1\r\n z+=(n-r+1)*(i-l+1);l=i+1\r\nprint(z)", "def gcd(a,b):\r\n if a == 0:\r\n return b\r\n return gcd(b%a,a)\r\n\r\nn,k = [int(x) for x in input().split()]\r\na = [gcd(int(x),k) for x in input().split()]\r\n\r\nif k == 1:\r\n print(((n+1)*(n+2))//2-n-1)\r\nelse:\r\n s = 0\r\n e = 0\r\n total = ((n+1)*(n+2))//2-1-n\r\n #print(total)\r\n #extra = {}\r\n c = 1\r\n \r\n while e < n:\r\n flag = False\r\n while c%k != 0 and e < n:\r\n total -= e-s\r\n c *= a[e]\r\n e += 1\r\n while c%k == 0 and s < e:\r\n c //= a[s]\r\n s += 1\r\n total -= e-s\r\n print(total)\r\n", "import bisect\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef prime_factorize(n):\r\n ans = []\r\n for i in range(2, int(n ** (1 / 2)) + 1):\r\n while True:\r\n if n % i:\r\n break\r\n ans.append(i)\r\n n //= i\r\n if n == 1:\r\n break\r\n if not n == 1:\r\n ans.append(n)\r\n return ans\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = list(set(prime_factorize(k)))\r\nl = len(s)\r\ncnt = []\r\nfor i in s:\r\n cnt0 = [0] * (n + 1)\r\n c = 0\r\n for j in range(n):\r\n aj = a[j]\r\n while not aj % i:\r\n aj //= i\r\n c += 1\r\n cnt0[j + 1] = c\r\n cnt.append(cnt0)\r\nt = []\r\nfor i in s:\r\n c = 0\r\n while not k % i:\r\n k //= i\r\n c += 1\r\n t.append(c)\r\nans = 0\r\nfor i in range(1, n + 1):\r\n m = i\r\n for j in range(l):\r\n m = min(m, bisect.bisect_left(cnt[j], cnt[j][i] - t[j] + 0.5))\r\n ans += m\r\nprint(ans)" ]

{"inputs": ["3 4\n6 2 8", "3 6\n9 1 14", "5 1\n1 3 1 3 1", "5 1\n5 5 5 5 5", "5 1\n5 4 4 4 4", "100 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "100 1\n3 3 2 1 1 2 1 2 3 4 1 5 2 4 5 1 1 3 2 3 4 2 1 3 4 4 5 5 1 5 2 5 3 3 1 1 1 3 2 2 3 4 4 4 4 3 1 3 5 3 3 3 3 2 3 2 2 3 3 1 2 4 3 2 2 5 3 1 5 2 2 5 1 2 1 1 5 1 5 2 4 5 3 4 2 5 4 2 2 5 5 5 3 3 5 3 4 3 3 1", "100 5\n4 4 3 2 4 4 1 2 2 1 5 3 2 5 5 3 2 3 4 5 2 2 3 4 2 4 3 1 2 3 5 5 1 3 3 5 2 3 3 4 1 3 1 5 4 4 2 1 5 1 4 4 1 5 1 1 5 5 5 4 1 3 1 2 3 2 4 5 5 1 3 4 3 3 1 2 2 4 1 5 1 1 2 4 4 4 5 5 5 3 4 3 3 3 3 2 1 1 5 5", "100 6\n4 4 1 1 1 1 3 3 5 5 4 2 2 4 3 4 4 5 5 4 5 1 3 1 5 4 5 1 2 5 5 2 2 4 2 4 4 2 5 5 3 3 1 3 3 5 2 3 1 4 1 4 4 1 5 5 1 2 3 2 3 3 5 3 4 2 3 4 3 1 5 3 5 5 3 5 4 4 3 1 1 2 1 2 1 3 2 4 3 2 1 4 3 1 1 5 1 5 4 3", "100 72\n8 8 7 9 6 1 4 5 3 7 5 10 5 4 1 3 4 1 3 1 6 6 4 5 4 5 6 1 10 7 9 1 6 10 6 6 9 3 3 4 5 9 4 9 8 1 5 9 3 7 1 8 5 2 1 1 7 7 7 6 6 4 2 9 10 2 8 3 1 1 4 8 5 9 7 10 9 4 2 3 7 7 6 7 8 5 1 3 8 5 1 8 9 10 3 7 1 8 10 5", "100 72\n3 2 1 3 3 3 4 3 5 5 2 5 1 2 2 2 1 4 1 5 1 4 5 4 3 1 4 3 4 4 1 4 4 3 4 1 4 4 5 2 2 3 3 5 4 5 4 2 4 3 1 1 1 4 5 5 3 1 5 3 4 4 5 3 5 1 4 3 2 2 1 4 2 1 3 2 4 2 1 4 4 1 3 4 4 4 1 5 5 2 5 2 3 1 5 1 1 1 2 3", "2 999634589\n31607 31627", "1 1\n1", "1 2\n1", "1 3\n1", "1 4\n1", "1 5\n3", "1 6\n4", "1 7\n2", "1 8\n3", "1 9\n5", "1 10\n3", "2 1\n1 1", "2 2\n2 2", "2 3\n1 2", "2 4\n1 2", "2 5\n1 1", "2 6\n2 1", "2 7\n1 4", "2 8\n5 3", "2 9\n2 2", "2 10\n6 1", "3 1\n1 1 1", "3 2\n2 2 1", "3 3\n2 1 2", "3 4\n2 2 2", "3 5\n1 1 2", "3 6\n4 3 2", "3 7\n3 4 1", "3 8\n5 1 4", "3 9\n3 2 1", "3 10\n6 5 5", "4 1\n1 1 1 1", "4 2\n2 2 1 2", "4 3\n2 1 1 1", "4 4\n2 2 1 1", "4 5\n2 3 2 1", "4 6\n1 1 3 3", "4 7\n1 1 2 2", "4 8\n5 4 5 5", "4 9\n1 1 4 2", "4 10\n2 6 2 1", "5 1\n1 1 1 1 1", "5 2\n2 2 1 2 1", "5 3\n2 1 1 2 1", "5 4\n2 2 1 3 1", "5 5\n2 3 1 1 3", "5 6\n3 4 3 4 3", "5 7\n3 1 3 2 4", "5 8\n2 2 3 3 1", "5 9\n3 1 3 3 4", "5 10\n3 6 6 1 5", "6 1\n1 1 1 1 1 1", "6 2\n1 2 2 1 1 1", "6 3\n2 2 2 2 1 2", "6 4\n1 3 3 3 3 2", "6 5\n2 3 3 2 1 2", "6 6\n1 2 4 1 4 4", "6 7\n2 2 4 3 2 1", "6 8\n3 2 3 5 5 3", "6 9\n1 4 1 2 1 1", "6 10\n1 2 5 6 6 6", "7 1\n1 1 1 1 1 1 1", "7 2\n1 1 2 2 2 2 1", "7 3\n2 2 1 1 2 2 2", "7 4\n3 2 1 2 1 1 1", "7 5\n2 3 3 3 2 3 2", "7 6\n3 4 4 1 4 3 2", "7 7\n4 2 4 4 1 4 4", "7 8\n4 4 2 4 2 5 3", "7 9\n2 1 3 4 4 5 4", "7 10\n6 3 3 5 3 6 1", "8 1\n1 1 1 1 1 1 1 1", "8 2\n1 1 1 1 1 1 1 2", "8 3\n1 1 2 2 1 1 2 2", "8 4\n2 3 2 3 3 3 2 3", "8 5\n1 3 1 2 2 2 1 3", "8 6\n4 2 4 2 1 2 1 4", "8 7\n2 2 1 4 4 4 2 2", "8 8\n5 2 1 2 4 2 2 4", "8 9\n4 4 2 2 5 5 4 1", "8 10\n2 1 4 4 3 4 4 6", "9 1\n1 1 1 1 1 1 1 1 1", "9 2\n1 1 1 2 1 1 2 2 2", "9 3\n1 1 1 2 2 1 1 2 1", "9 4\n1 1 2 1 2 1 1 1 1", "9 5\n3 2 3 2 3 1 1 3 2", "9 6\n2 1 1 3 2 4 1 2 2", "9 7\n4 3 2 1 2 3 3 4 4", "9 8\n5 5 2 1 3 1 3 1 3", "9 9\n2 4 1 4 4 3 3 4 1", "9 10\n4 3 2 5 2 2 2 2 6", "10 1\n1 1 1 1 1 1 1 1 1 1", "10 2\n2 2 2 2 2 2 2 1 2 1", "10 3\n2 2 1 1 2 2 2 2 1 2", "10 4\n1 1 2 3 3 1 2 2 2 3", "10 5\n3 3 2 2 3 1 1 1 3 1", "10 6\n4 4 4 3 2 1 1 1 2 4", "10 7\n4 2 2 2 3 3 2 4 4 3", "10 8\n5 4 1 4 3 2 1 2 3 3", "10 9\n1 2 3 4 5 2 3 5 5 4", "10 10\n5 3 2 5 1 2 5 1 5 1", "1 1000000000\n1", "1 1000000000\n1000000000", "1 100000000\n1000000000", "1 1\n1000000000"], "outputs": ["4", "1", "15", "15", "15", "5050", "5050", "4713", "4580", "4549", "4123", "1", "1", "0", "0", "0", "0", "0", "0", "0", "0", "0", "3", "3", "0", "0", "0", "0", "0", "0", "0", "0", "6", "5", "0", "3", "0", "3", "0", "0", "0", "2", "10", "9", "0", "3", "0", "0", "0", "0", "0", "0", "15", "13", "0", "4", "0", "10", "0", "0", "7", "3", "21", "14", "0", "0", "0", "0", "0", "0", "0", "11", "28", "24", "0", "8", "0", "15", "0", "18", "0", "10", "36", "8", "0", "10", "0", "0", "0", "21", "0", "0", "45", "36", "0", "15", "0", "21", "0", "0", "18", "23", "55", "53", "0", "26", "0", "27", "0", "24", "12", "35", "0", "1", "1", "1"]}

UNKNOWN

PYTHON3

CODEFORCES

3

919a173054ff13c4de2e0f84f05b8cbb

The Labyrinth

You are given a rectangular field of *n*<=×<=*m* cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's call two empty cells adjacent if they share a side. Let's call a connected component any non-extendible set of cells such that any two of them are connected by the path of adjacent cells. It is a typical well-known definition of a connected component. For each impassable cell (*x*,<=*y*) imagine that it is an empty cell (all other cells remain unchanged) and find the size (the number of cells) of the connected component which contains (*x*,<=*y*). You should do it for each impassable cell independently. The answer should be printed as a matrix with *n* rows and *m* columns. The *j*-th symbol of the *i*-th row should be "." if the cell is empty at the start. Otherwise the *j*-th symbol of the *i*-th row should contain the only digit —- the answer modulo 10. The matrix should be printed without any spaces. To make your output faster it is recommended to build the output as an array of *n* strings having length *m* and print it as a sequence of lines. It will be much faster than writing character-by-character. As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java. The first line contains two integers *n*,<=*m* (1<=≤<=*n*,<=*m*<=≤<=1000) — the number of rows and columns in the field. Each of the next *n* lines contains *m* symbols: "." for empty cells, "*" for impassable cells. Print the answer as a matrix as described above. See the examples to precise the format of the output. Sample Input 3 3 *.* .*. *.* 4 5 **..* ..*** .*.*. *.*.* Sample Output 3.3 .5. 3.3 46..3 ..732 .6.4. 5.4.3

[ "# n=int(input())\r\n# n,k=map(int,input().split())\r\n# arr=list(map(int,input().split()))\r\n#ls=list(map(int,input().split()))\r\n#for i in range(m):\r\n# for _ in range(int(input())):\r\nfrom collections import Counter\r\n#from fractions import Fraction\r\n#n=int(input())\r\n#arr=list(map(int,input().split()))\r\n#ls = [list(map(int, input().split())) for i in range(n)]\r\nfrom math import log2\r\n#for _ in range(int(input())):\r\n#n, m = map(int, input().split())\r\n# for _ in range(int(input())):\r\nfrom math import gcd\r\n#n=int(input())\r\n# for i in range(m):\r\n# for i in range(int(input())):\r\n# n,k= map(int, input().split())\r\n# arr=list(map(int,input().split()))\r\n# n=sys.stdin.readline()\r\n# n=int(n)\r\n# n,k= map(int, input().split())\r\n# arr=list(map(int,input().split()))\r\n# n=int(inaput())\r\n#for _ in range(int(input())):\r\n#arr=list(map(int,input().split()))\r\nfrom collections import deque\r\ndx=[-1,0,0,1]\r\ndy=[0,-1,1,0]\r\n\r\ndef bfs(x,y):\r\n\tglobal total\r\n\ttotal+=1\r\n\tq=deque([(x,y)])\r\n\tv[x][y]=True\r\n\th[x][y]=comp\r\n\t#q.append()\r\n\twhile q:\r\n\t\tx,y=q.pop()\r\n\t\tfor i in range(4):\r\n\t\t\tnx=x+dx[i]\r\n\t\t\tny=y+dy[i]\r\n\t\t\t#print(\"nx,y\",nx, ny)\r\n\t\t\tif (nx>=0 and nx<n) and (ny>=0 and ny<m) and (v[nx][ny]==False) and (g[nx][ny]==\".\"):\r\n\t\t\t\tq.appendleft((nx,ny))\r\n\t\t\t\ttotal+=1\r\n\t\t\t\tv[nx][ny]=True\r\n\t\t\t\th[nx][ny]=comp\r\n\r\n#global g,h,r,comp,total\r\nn, m = map(int, input().split())\r\nh=[[-1 for i in range(m)] for j in range(n)]\r\ng=[]\r\nv=[[False for i in range(m)]for j in range(n)]\r\nfor i in range(n):\r\n\tg.append(list(input()))\r\ncomponent=[]\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif v[i][j]==False and g[i][j]==\".\":############\r\n\t\t\tcomp=len(component)\r\n\t\t\t#global total\r\n\t\t\ttotal=0\r\n\t\t\tbfs(i,j)\r\n\t\t\tcomponent.append(total)\r\n#print(component)\r\nfor x in range(n):\r\n\tfor y in range(m):\r\n\t\tif g[x][y] == \"*\":\r\n\t\t\tans = 0\r\n\t\t\ts = set()\r\n\t\t\tfor k in range(4):\r\n\t\t\t\tnx = x + dx[k]\r\n\t\t\t\tny = y + dy[k]\r\n\t\t\t\tif nx >= 0 and nx < n and ny >= 0 and ny < m and g[nx][ny] == \".\":\r\n\t\t\t\t\ts.add(h[nx][ny])\r\n\t\t\tfor itm in s:\r\n\t\t\t\tans += component[itm]\r\n\t\t\tans += 1\r\n\t\t\tans %= 10\r\n\t\t\tg[x][y] = str(ans)\r\nfor i in range(n):\r\n\tprint(\"\".join(g[i]))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from sys import stdin, stdout\r\n\r\nn, m = map(int, stdin.readline().split())\r\n\r\nmtx = [[ch for ch in stdin.readline()] for _ in range(n)]\r\n\r\ngroups = [[0 for _ in range(m)] for _ in range(n)]\r\nsizes = [0]\r\nshard_id = 1\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if mtx[i][j] == '*':\r\n continue\r\n if groups[i][j] != 0:\r\n continue\r\n\r\n stack = [(i, j)]\r\n size = 1\r\n groups[i][j] = shard_id\r\n while stack:\r\n x, y = stack.pop()\r\n for xi, yi in ((x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)):\r\n if xi < 0 or n <= xi:\r\n continue\r\n if yi < 0 or m <= yi:\r\n continue\r\n if mtx[xi][yi] != \".\":\r\n continue\r\n if groups[xi][yi] != 0:\r\n continue\r\n \r\n groups[xi][yi] = shard_id\r\n stack.append((xi, yi))\r\n size += 1\r\n sizes.append(size)\r\n shard_id += 1\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if mtx[i][j] != '*':\r\n continue\r\n \r\n groups_id = set()\r\n for xi, yi in ((i + 1, j), (i - 1, j), (i, j + 1), (i, j - 1)):\r\n if xi < 0 or n <= xi:\r\n continue\r\n if yi < 0 or m <= yi:\r\n continue\r\n if mtx[xi][yi] != \".\":\r\n continue\r\n groups_id.add(groups[xi][yi])\r\n \r\n size = 1\r\n for gid in groups_id:\r\n size += sizes[gid]\r\n\r\n mtx[i][j] = str(size)[-1]\r\n\r\n\r\nstdout.write(('\\n'.join(''.join(row) for row in mtx)))\r\n", "from collections import Counter\r\nfrom math import log2\r\nfrom math import gcd\r\nfrom collections import deque\r\ndx=[-1,0,0,1]\r\ndy=[0,-1,1,0]\r\n\r\ndef bfs(x,y):\r\n\tglobal total\r\n\ttotal+=1\r\n\tq=deque([(x,y)])\r\n\tv[x][y]=True\r\n\th[x][y]=comp\r\n\twhile q:\r\n\t\tx,y=q.pop()\r\n\t\tfor i in range(4):\r\n\t\t\tnx=x+dx[i]\r\n\t\t\tny=y+dy[i]\r\n\t\t\tif (nx>=0 and nx<n) and (ny>=0 and ny<m) and (v[nx][ny]==False) and (g[nx][ny]==\".\"):\r\n\t\t\t\tq.appendleft((nx,ny))\r\n\t\t\t\ttotal+=1\r\n\t\t\t\tv[nx][ny]=True\r\n\t\t\t\th[nx][ny]=comp\r\n\r\nn, m = map(int, input().split())\r\nh=[[-1 for i in range(m)] for j in range(n)]\r\ng=[]\r\nv=[[False for i in range(m)]for j in range(n)]\r\nfor i in range(n):\r\n\tg.append(list(input()))\r\ncomponent=[]\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif v[i][j]==False and g[i][j]==\".\":\r\n\t\t\tcomp=len(component)\r\n\t\t\ttotal=0\r\n\t\t\tbfs(i,j)\r\n\t\t\tcomponent.append(total)\r\n\r\nfor x in range(n):\r\n\tfor y in range(m):\r\n\t\tif g[x][y] == \"*\":\r\n\t\t\tans = 0\r\n\t\t\ts = set()\r\n\t\t\tfor k in range(4):\r\n\t\t\t\tnx = x + dx[k]\r\n\t\t\t\tny = y + dy[k]\r\n\t\t\t\tif nx >= 0 and nx < n and ny >= 0 and ny < m and g[nx][ny] == \".\":\r\n\t\t\t\t\ts.add(h[nx][ny])\r\n\t\t\tfor itm in s:\r\n\t\t\t\tans += component[itm]\r\n\t\t\tans += 1\r\n\t\t\tans %= 10\r\n\t\t\tg[x][y] = str(ans)\r\nfor i in range(n):\r\n\tprint(\"\".join(g[i]))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\n\r\nclass DisjointSetUnion:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n self.size = [1] * n\r\n self.num_sets = n\r\n\r\n def find(self, a):\r\n acopy = a\r\n while a != self.parent[a]:\r\n a = self.parent[a]\r\n while acopy != a:\r\n self.parent[acopy], acopy = a, self.parent[acopy]\r\n return a\r\n\r\n def union(self, a, b):\r\n a, b = self.find(a), self.find(b)\r\n if a != b:\r\n if self.size[a] < self.size[b]:\r\n a, b = b, a\r\n\r\n self.num_sets -= 1\r\n self.parent[b] = a\r\n self.size[a] += self.size[b]\r\n\r\n def set_size(self, a):\r\n return self.size[self.find(a)]\r\n\r\n def __len__(self):\r\n return self.num_sets\r\n\r\n\r\nl = []\r\nfor i in range(n):\r\n l.append(input().strip())\r\n\r\nUF = DisjointSetUnion(n * m)\r\nfor i in range(n):\r\n for j in range(m):\r\n if i < n - 1:\r\n if l[i][j] == '.' and l[i+1][j] == '.':\r\n UF.union(m * i + j, m * i + m + j)\r\n if j < m - 1:\r\n if l[i][j] == '.' and l[i][j+1] =='.':\r\n UF.union(m * i + j, m * i + j + 1)\r\n\r\nout = []\r\nfor i in range(n):\r\n curr = []\r\n for j in range(m):\r\n if l[i][j] == '.':\r\n curr.append('.')\r\n else:\r\n dx = [0,0,-1,1]\r\n dy = [-1,1,0,0]\r\n adj = set()\r\n for d in range(4):\r\n nx = i + dx[d]\r\n ny = j + dy[d]\r\n if 0 <= nx < n and 0 <= ny < m and l[nx][ny] == '.':\r\n adj.add(UF.find(m * nx + ny))\r\n \r\n outV = 1\r\n for v in adj:\r\n outV += UF.set_size(v)\r\n curr.append(str(outV % 10))\r\n out.append(''.join(curr))\r\nprint('\\n'.join(out))\r\n \r\n \r\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.table = [-1] * n\r\n \r\n def root(self, x):\r\n stack = []\r\n tbl = self.table\r\n while tbl[x] >= 0:\r\n stack.append(x)\r\n x = tbl[x]\r\n for y in stack:\r\n tbl[y] = x\r\n return x\r\n \r\n def find(self, x, y):\r\n return self.root(x) == self.root(y)\r\n \r\n def unite(self, x, y):\r\n r1 = self.root(x)\r\n r2 = self.root(y)\r\n if r1 == r2:\r\n return\r\n d1 = self.table[r1]\r\n d2 = self.table[r2]\r\n if d1 <= d2:\r\n self.table[r2] = r1\r\n self.table[r1] += d2\r\n else:\r\n self.table[r1] = r2\r\n self.table[r2] += d1\r\n \r\n def get_size(self, x):\r\n return -self.table[self.root(x)]\r\nn,m=map(int,input().split())\r\na=[list(input().rstrip()) for i in range(n)]\r\nuf=UnionFind(n*m)\r\ndx=[1,0,-1,0]\r\ndy=[0,1,0,-1]\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]==\".\":\r\n for k in range(4):\r\n ni=i+dy[k];nj=j+dx[k]\r\n if 0<=ni<n and 0<=nj<m and a[ni][nj]==\".\":\r\n uf.unite(m*i+j,m*ni+nj)\r\nans=[[\"\"]*m for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]==\".\":\r\n ans[i][j]=\".\"\r\n else:\r\n tmp=0\r\n use=[]\r\n for k in range(4):\r\n ni,nj=i+dy[k],j+dx[k]\r\n if 0<=ni<n and 0<=nj<m and a[ni][nj]==\".\":\r\n flag=True\r\n for val in use:\r\n if uf.find(val,m*ni+nj):\r\n flag=False\r\n if flag:\r\n use.append(m*ni+nj)\r\n tmp+=uf.get_size(m*ni+nj)\r\n ans[i][j]=str((tmp+1)%10)\r\nfor i in range(n):\r\n print(\"\".join(ans[i]))", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nfrom collections import defaultdict\r\n\r\nclass UnionFind():\r\n def __init__(self,n):\r\n self.n=n\r\n self.parents=[-1]*n\r\n\r\n def find(self,x):\r\n if self.parents[x]<0:\r\n return x\r\n else:\r\n self.parents[x]=self.find(self.parents[x])\r\n return self.parents[x]\r\n\r\n def union(self,x,y):\r\n x=self.find(x)\r\n y=self.find(y)\r\n\r\n if x==y:\r\n return\r\n\r\n if self.parents[x]>self.parents[y]:\r\n x,y=y,x\r\n\r\n self.parents[x]+=self.parents[y]\r\n self.parents[y]=x\r\n\r\n def size(self,x):\r\n return -self.parents[self.find(x)]\r\n\r\n def same(self,x,y):\r\n return self.find(x)==self.find(y)\r\n\r\n def members(self,x):\r\n root=self.find(x)\r\n return [i for i in range(self.n) if self.find(i)==root]\r\n\r\n def roots(self):\r\n return [i for i, x in enumerate(self.parents) if x< 0]\r\n\r\n def group_count(self):\r\n return len(self.roots())\r\n\r\n def all_group_members(self):\r\n group_members=defaultdict(list)\r\n for member in range(self.n):\r\n group_members[self.find(member)].append(member)\r\n return group_members\r\n\r\nh,w=map(int,input().split())\r\ns=[input() for _ in range(h)]\r\nuf=UnionFind(h*w)\r\ndxdy=[(1,0),(0,1),(-1,0),(0,-1)]\r\ndef conv(x,y):\r\n return x*w+y\r\n\r\nfor x in range(h):\r\n for y in range(w):\r\n if s[x][y]=='.':\r\n for dx,dy in dxdy:\r\n nx,ny=x+dx,y+dy\r\n if 0<=nx<h and 0<=ny<w and s[nx][ny]=='.':\r\n uf.union(conv(x,y),conv(nx,ny))\r\n\r\nans=[['.']*w for i in range(h)]\r\nfor x in range(h):\r\n for y in range(w):\r\n if s[x][y]=='*':\r\n S=set()\r\n for dx,dy in dxdy:\r\n nx,ny=x+dx,y+dy\r\n if 0<=nx<h and 0<=ny<w and s[nx][ny]=='.':\r\n S.add(uf.find(conv(nx,ny)))\r\n res=1\r\n for i in S:\r\n res+=uf.size(i)\r\n ans[x][y]=str(res%10)\r\n \r\nfor row in ans:\r\n print(''.join(row))", "from collections import defaultdict, Counter,deque\r\nfrom math import sqrt, log10, log, floor, factorial,gcd\r\nfrom bisect import bisect_left, bisect_right\r\nfrom itertools import permutations,combinations\r\nimport sys, io, os\r\ninput = sys.stdin.readline\r\n# input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n# sys.setrecursionlimit(10000) \r\ninf = float('inf')\r\nmod = 10 ** 9 + 7\r\ndef yn(a): print(\"YES\" if a else \"NO\")\r\nceil = lambda a, b: (a + b - 1) // b\r\nclass DisjointSetUnion:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n self.size = [1] * n\r\n self.num_sets = n\r\n\r\n def find(self, a):\r\n acopy = a\r\n while a != self.parent[a]:\r\n a = self.parent[a]\r\n while acopy != a:\r\n self.parent[acopy], acopy = a, self.parent[acopy]\r\n return a\r\n\r\n def union(self, a, b):\r\n a, b = self.find(a), self.find(b)\r\n if a != b:\r\n if self.size[a] < self.size[b]:\r\n a, b = b, a\r\n\r\n self.num_sets -= 1\r\n self.parent[b] = a\r\n self.size[a] += self.size[b]\r\n return 1\r\n return 0\r\n\r\n def set_size(self, a):\r\n return self.size[self.find(a)]\r\n\r\n def __len__(self):\r\n return self.num_sets\r\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\nfor i in range(1):\r\n n,m=[int(i) for i in input().split()]\r\n l=[]\r\n for i in range(n):\r\n l.append(input().strip())\r\n dsu=DisjointSetUnion(n*m)\r\n for i in range(n):\r\n for j in range(m):\r\n if l[i][j]=='.':\r\n if i+1<n:\r\n if l[i+1][j]=='.':\r\n dsu.union(i*m+j,(i+1)*m+j)\r\n if j+1<m:\r\n if l[i][j+1]=='.':\r\n dsu.union(i*m+j,i*m+j+1)\r\n out=[list(i) for i in l]\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if l[i][j]=='*':\r\n i1,j1=i,j\r\n s=set()\r\n out[i][j]=1\r\n for i,j in [[i-1,j],[i+1,j],[i,j+1],[i,j-1]]:\r\n if 0<=i<n and 0<=j<m and l[i][j]=='.':\r\n if dsu.find(i*m+j) in s:\r\n continue\r\n\r\n out[i1][j1]+=dsu.set_size(i*m+j)\r\n s.add(dsu.find((i)*m+j))\r\n out[i1][j1]%=10\r\n for i in out:\r\n print(*i,sep=\"\")\r\n\r\n\r\n\r\n\r\n", "from collections import defaultdict\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.n = n\r\n self.p = [-1] * (n+1)\r\n \r\n def find(self, x):\r\n if self.p[x] < 0:\r\n return x\r\n else:\r\n self.p[x] = self.find(self.p[x])\r\n return self.p[x]\r\n \r\n def union(self,x,y):\r\n x = self.find(x)\r\n y = self.find(y)\r\n if x == y: return \r\n if self.p[x] > self.p[y]:\r\n x,y = y,x\r\n self.p[x] += self.p[y]\r\n self.p[y] = x\r\n\r\n def same(self, a,b):\r\n return self.find(a) == self.find(b)\r\n \r\n def group(self):\r\n d = defaultdict(list)\r\n for i in range(1,self.n+1):\r\n par = self.find(i)\r\n d[par].append(i)\r\n return d\r\n\r\n\r\n\r\n\r\nimport 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\n\r\nn,m = map(int,input().split())\r\ng = [input().rstrip() for i in range(n)]\r\nuf = UnionFind(n*m)\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == \"*\": continue\r\n if i != n-1 and g[i+1][j] == \".\":\r\n uf.union(i*m+j, (i+1)*m+j)\r\n if j != m-1 and g[i][j+1] == \".\":\r\n uf.union(i*m+j, i*m+(j+1))\r\n\r\nans = [[] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == \".\":\r\n ans[i].append(\".\")\r\n else:\r\n s = set()\r\n for dx,dy in [[0,1],[0,-1],[1,0],[-1,0]]:\r\n nx,ny = i+dx , j+dy\r\n if not (0<=nx < n and 0 <= ny < m): continue\r\n if g[nx][ny] == \"*\": continue\r\n s.add(uf.find(nx*m+ny))\r\n tmp = 1\r\n for num in s:\r\n tmp -= uf.p[num]\r\n ans[i].append(str(tmp%10))\r\n\r\nfor i in ans:\r\n print(\"\".join(i))\r\n\r\n \r\n\r\n \r\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef 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 root_s = get_root(s)\r\n root_t = get_root(t)\r\n if not root_s == root_t:\r\n if rank[s] == rank[t]:\r\n root[root_t] = root_s\r\n rank[root_s] += 1\r\n size[root_s] += size[root_t]\r\n elif rank[s] > rank[t]:\r\n root[root_t] = root_s\r\n size[root_s] += size[root_t]\r\n else:\r\n root[root_s] = root_t\r\n size[root_t] += size[root_s]\r\n\r\ndef same(s, t):\r\n if get_root(s) == get_root(t):\r\n return True\r\n else:\r\n return False\r\n\r\nn, m = map(int, input().split())\r\nl = n * m\r\nroot = [i for i in range(l)]\r\nrank = [1 for _ in range(l)]\r\nsize = [1 for _ in range(l)]\r\ns = []\r\nfor i in range(n):\r\n s0 = list(input().rstrip())\r\n for j in range(m - 1):\r\n if s0[j] == s0[j + 1] == \".\":\r\n unite(m * i + j, m * i + j + 1)\r\n s.append(s0)\r\nfor i in range(n - 1):\r\n for j in range(m):\r\n if s[i][j] == s[i + 1][j] == \".\":\r\n if not same(m * i + j, m * (i + 1) + j):\r\n unite(m * i + j, m * (i + 1) + j)\r\ncnt = defaultdict(lambda : 0)\r\nr = [0] * l\r\nfor i in range(l):\r\n x = get_root(i)\r\n r[i] = x\r\n cnt[x] += 1\r\nv = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if not s[i][j] == \"*\":\r\n continue\r\n s0 = set()\r\n for di, dj in v:\r\n ni, nj = i + di, j + dj\r\n if 0 <= ni < n and 0 <= nj < m:\r\n if s[ni][nj] == \".\":\r\n s0.add(r[m * ni + nj])\r\n ans = 1\r\n for k in s0:\r\n ans += cnt[k]\r\n s[i][j] = str(ans % 10)\r\nfor s0 in s:\r\n print(\"\".join(s0))", "from collections import deque\r\n\r\ndirs = [[1, 0], [-1, 0], [0, 1], [0, -1]]\r\n\r\ncomponentsizes = {}\r\ncomponentid = 0\r\n\r\nn, m = map(int, input().split())\r\nfield = [list(input()) for _ in range(n)]\r\n\r\ndef valid(y, x):\r\n return y >= 0 and x >= 0 and y < n and x < m\r\n\r\ndef component(y, x):\r\n size = 1\r\n q = deque([(y, x)])\r\n field[y][x] = componentid\r\n while q:\r\n y, x = q.pop()\r\n for i, j in dirs:\r\n if valid(y+i, x+j) and field[y+i][x+j] == \".\":\r\n q.appendleft((y+i, x+j))\r\n field[y+i][x+j] = componentid\r\n size += 1\r\n return size\r\n\r\ndef solve(y, x):\r\n connected = set()\r\n for i, j in dirs:\r\n if valid(y+i, x+j) and type(field[y+i][x+j]) is int:\r\n connected.add(field[y+i][x+j])\r\n return (sum(componentsizes[i] for i in connected)+1)%10\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if field[i][j] == \".\":\r\n componentsizes[componentid] = component(i, j)\r\n componentid += 1\r\n\r\noutput = [[] for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n output[i].append(str(solve(i, j)) if field[i][j] == \"*\" else \".\")\r\n\r\nprint(\"\\n\".join([\"\".join(row) for row in output]))\r\n" ]

{"inputs": ["3 3\n*.*\n.*.\n*.*", "4 5\n**..*\n..***\n.*.*.\n*.*.*", "1 1\n*", "1 1\n.", "1 10\n**********", "1 10\n*.***.**.*", "10 1\n*\n*\n*\n*\n*\n.\n*\n.\n*\n*", "10 1\n.\n.\n.\n.\n.\n.\n.\n.\n.\n."], "outputs": ["3.3\n.5.\n3.3", "46..3\n..732\n.6.4.\n5.4.3", "1", ".", "1111111111", "2.212.22.2", "1\n1\n1\n1\n2\n.\n3\n.\n2\n1", ".\n.\n.\n.\n.\n.\n.\n.\n.\n."]}

UNKNOWN

PYTHON3

CODEFORCES

10

91b19792c755370d0bb363b9e826e496

Message

Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string *s*. String *p* is called a substring of string *s* if you can read it starting from some position in the string *s*. For example, string "aba" has six substrings: "a", "b", "a", "ab", "ba", "aba". Dr. Moriarty plans to take string *s* and cut out some substring from it, let's call it *t*. Then he needs to change the substring *t* zero or more times. As a result, he should obtain a fixed string *u* (which is the string that should be sent to Sherlock Holmes). One change is defined as making one of the following actions: - Insert one letter to any end of the string. - Delete one letter from any end of the string. - Change one letter into any other one. Moriarty is very smart and after he chooses some substring *t*, he always makes the minimal number of changes to obtain *u*. Help Moriarty choose the best substring *t* from all substrings of the string *s*. The substring *t* should minimize the number of changes Moriarty should make to obtain the string *u* from it. The first line contains a non-empty string *s*, consisting of lowercase Latin letters. The second line contains a non-empty string *u*, consisting of lowercase Latin letters. The lengths of both strings are in the range from 1 to 2000, inclusive. Print the only integer — the minimum number of changes that Dr. Moriarty has to make with the string that you choose. Sample Input aaaaa aaa abcabc bcd abcdef klmnopq Sample Output 0 1 7

[ "# 156A - Message\r\nx, y = input(), input()\r\nz = len(y)\r\nx = \"0\"*z+x+\"0\"*z\r\nm = 0\r\nfor i in range(len(x)-z):\r\n w = x[i:i+z]\r\n a = 0\r\n for j in range(z):\r\n if w[j] == y[j]:\r\n a += 1\r\n m = max(m, a)\r\nprint(z-m)\r\n", "s = input()\r\nu = input()\r\n\r\ns = '#' * 2005 + s + '#' * 2005\r\nmin_dist = 5000\r\n\r\nfor i in range(len(s) - len(u)):\r\n ptr1, ptr2 = i, 0\r\n md = 0\r\n while ptr2 < len(u):\r\n md += 1 if s[ptr1] != u[ptr2] else 0\r\n ptr1 += 1\r\n ptr2 += 1\r\n min_dist = min(md, min_dist)\r\n\r\nprint(min_dist)\r\n", "x,y=input(),input()\r\nt=[0]*len(x)\r\np={i:[] for i in \"abcdefghijklmnopqrstuvwxyz\"}\r\nfor i,j in enumerate(x):\r\n p[j].append(i)\r\n#print(p)\r\nfor i in y:\r\n for j in p[i]:\r\n t[j]+=1\r\n t=[0]+t\r\nprint(len(y)-max(t))\r\n \r\n ", "s = input()\r\nu = input()\r\nt = [0] * len(s)\r\nd = {chr(i) : [] for i in range(ord('a'), ord('z')+1)}\r\nfor i, j in enumerate(s) :\r\n d[j].append(i)\r\nfor i in u:\r\n for j in d[i]:\r\n t[j] += 1\r\n t = [0] + t\r\nprint(len(u) - max(t))\r\n", "\r\ndef solve(a, b):\r\n ans = 0\r\n for i in range(len(a)):\r\n if a[i] == b[i]:\r\n ans += 1\r\n return ans\r\n\r\na = input()\r\nb = input()\r\ntot = len(a)+len(b)\r\nsm = 0\r\nfor i in range(1, tot):\r\n f = max(0, len(a)-i)\r\n s = max(0, i-len(a))\r\n sz = min(i, tot-i, len(a), len(b))\r\n sm = max(sm, solve(a[f:f+sz], b[s:s+sz]))\r\nprint(len(b)-sm)\r\n", "import sys\r\ns=input()\r\nu=input()\r\nmax=0\r\ndef match(a,b):\r\n num=0\r\n for i in range(min(len(a),len(b))):\r\n if a[i]==b[i]:num+=1\r\n return num\r\nfor i in range(len(s)):\r\n temp=match(s[i:],u)\r\n if temp>max:\r\n max=temp\r\n if max==len(u):\r\n break\r\nfor i in range(len(u)):\r\n temp=match(s,u[i:])\r\n if temp>max:\r\n max=temp\r\n if max==len(u):\r\n break\r\nprint(len(u)-max)", "s, u = input(), input()\r\nt = [0] * len(s)\r\np = {i: [] for i in 'abcdefghijklmnopqrstuvwxyz'}\r\nfor i, j in enumerate(s): p[j].append(i)\r\nfor j in u:\r\n for i in p[j]: t[i] += 1\r\n t = [0] + t\r\nprint(len(u) - max(t))", "from sys import stdin\r\n\r\nfirst = stdin.readline().strip()\r\nsecond = stdin.readline().strip()\r\n\r\nminChange = 2001\r\n\r\nfirst = '@' * (len(second) - 1) + first + '@' * (len(second) - 1)\r\ndiff = len(first) - len(second)\r\n\r\nfor i in range(0, diff + 1):\r\n line = '@' * i + second + '@' * (diff - i)\r\n result = 0\r\n for i in range(i, i + len(second)):\r\n if first[i] != line[i]:\r\n result += 1\r\n if minChange > result:\r\n minChange = result\r\n\r\nprint(minChange)\r\n\r\n\r\n", "x,y = input(),input()\r\nres = [0] * len(x)\r\ndata = {i:[] for i in \"abcdefghijklmnopqrstuvwxyz\"}\r\nfor i,j in enumerate(x):\r\n data[j].append(i)\r\n\r\nfor i in y:\r\n for j in data[i]:\r\n res[j]+=1\r\n res = [0] + res\r\nprint(len(y)-max(res))\r\n \r\n ", "a = input()\r\nb = input()\r\na = '.' * len(b) + a + '.' * len(b)\r\nans = len(b)\r\nfor i in range(len(a)):\r\n if i + len(b) <= len(a): \r\n cnt = 0\r\n for j in range(len(b)):\r\n cnt += (1 if a[i + j] != b[j] else 0)\r\n \r\n ans = min(ans, cnt)\r\n\r\nprint(ans)", "x,y=input(),input()\r\n \r\nres=[0]*len(x)\r\n \r\ndicc ={i:[] for i in \"abcdefghijklmnopqrstuvwxyz\"}\r\n \r\nfor i,j in enumerate(x):\r\n \r\n dicc[j].append(i)\r\n \r\nfor i in y:\r\n \r\n for j in dicc[i]:\r\n \r\n res[j]+=1\r\n \r\n res=[0]+res\r\n\r\n \r\nprint(len(y)-max(res))", "def cnt(s, t):\r\n ans = 0\r\n for i in range(len(s)):\r\n ans += s[i] != t[i]\r\n \r\n return ans\r\n\r\n\r\ns = input()\r\nu = input()\r\n\r\ns = 2000 * '.' + s + 2000 * '.'\r\nmn = 10 ** 10\r\nfor i in range(len(s) - len(u)):\r\n cur = s[i: i + len(u)]\r\n mn = min(mn, cnt(cur, u))\r\n\r\nprint(mn)" ]

{"inputs": ["aaaaa\naaa", "abcabc\nbcd", "abcdef\nklmnopq", "aaabbbaaa\naba", "a\na", "z\nz", "a\nz", "d\nt", "o\nu", "a\nm", "t\nv", "n\ng", "c\nh", "r\ni", "h\nb", "r\na", "c\np", "wbdbzf\nfpvlerhsuf", "zafsqbsu\nhl", "juhlp\nycqugugk", "ladfasxt\ncpvtd", "ally\ncjidwuj", "rgug\npgqwslo", "wmjwu\nrfew", "cpnwcdqff\nq", "dkwh\nm", "zfinrlju\nwiiegborjl", "swconajiqpgziitbpwjsfcalqvmwbfed\nridfnsyumichlhpnurrnwkyjcdzchznpmno", "vfjofvgkdwgqdlomtmcvedtmimdnxavhfirienxfdflldkbwjsynablhdvgaipvcghgaxipotwmmlzxekipgbvpfivlgzfwqz\njkdfjnessjfgcqpnxgtqdxtqimolbdlnipkoqht", "dtvxepnxfkzcaoh\nkpdzbtwjitzlyzvsbwcsrfglaycrhzwsdtidrelndsq", "sweaucynwsnduofyaqunoxttbipgrbfpssplfp\nuifmuxmczznobefdsyoclwzekewxmcwfqryuevnxxlgxsuhoytkaddorbdaygo", "eohztfsxoyhirnzxgwaevfqstinlxeiyywmpmlbedkjihaxfdtsocof\nbloqrjbidxiqozvwregxxgmxuqcvhwzhytfckbafd", "ybshzefoxkqdigcjafs\nnffvaxdmditsolfxbyquira", "ytfqnuhqzbjjheejjbzcaorilcyvuxvviaiba\nxnhgkdfceialuujgcxmrhjbzvibcoknofafmdjnhij", "ibdjtvgaveujdyidqldrxgwhsammmfpgxwljkptmeyejdvudhctmqjazalyzmzfgebetyqncu\nercdngwctdarcennbuqhsjlwfwrcqjbcjxqftycoulrhrimwhznogjmrrqdygtmllottpjgmkndraearezvxxmdhcuokhyngu", "bwhvaanyxupicwobeevcwewhcriwowfovnylalpuhxzqxtzyjrzlxcmejujvliomdfedgtaioauwrcluhfxtzu\nplinvtsvytepojsecnjisxlmqkfhgknitvuw", "sjxykdmrzpescabubcjflhnpckgytklc\nsxirpuqnmjqhlnvdeyvxvzzcygkpsujyifzgzmtvxsimddjahiephqlgfzngrzjtcrgrimewsxipczsgu", "ksmbytfyhhnstlecripupiwdhbkhfpfmimrbqgszohcqnezcybvwasxmkxfupvuecsctcpadccnqexsglwaiyxcoyheefcjmdedesgjqdtqgrvfjonzesffousooutsjumrxl\nhgjqihcfbnmgufonaiudbjegexexthrzcdkuimwogpbyovemztzcmqnrbhabxyyxyfuzpyhjgnioexbezzupcxlyzuuncstiiqsjzdtqppqhxilvqimlpjejiqbwpeekzweeyvthvjffgfvqauqrugajjjzibgzhxphcvtncjzecbtupwkehcrgsgfgkvwwnifglyamjkzfvabybsstwrwugnmiwflhemgnfbrtskzfxcepqhtelgiowzeuujpkuzsfsipcvtfoeshawvryaubilcbwukdhlwamsqenzvr", "abcd\ndabc", "medxx\nahmed", "ab\ndab", "nasldkfnsb\nyyyynasld", "abcde\ncabc", "a\nzzzzzzzzzza", "abcde\nabde", "bac\ntbdca", "abcdef\nxyzabc", "abcdef\nbctsf", "xxxabaxxx\nxxxaaxxx", "bcd\nabc", "d\nabcdef"], "outputs": ["0", "1", "7", "1", "0", "0", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "9", "2", "7", "4", "7", "6", "3", "0", "1", "9", "32", "34", "41", "57", "37", "19", "37", "90", "28", "76", "287", "1", "2", "1", "4", "1", "10", "2", "3", "3", "2", "2", "1", "5"]}

UNKNOWN

PYTHON3

CODEFORCES

12

91c3babe38f68cd3ad2fb4f40f35e2f3

Restoring Table

Recently Polycarpus has learned the "bitwise AND" operation (which is also called "AND") of non-negative integers. Now he wants to demonstrate the school IT teacher his superb manipulation with the learned operation. For that Polycarpus came to school a little earlier and wrote on the board a sequence of non-negative integers *a*1,<=*a*2,<=...,<=*a**n*. He also wrote a square matrix *b* of size *n*<=×<=*n*. The element of matrix *b* that sits in the *i*-th row in the *j*-th column (we'll denote it as *b**ij*) equals: - the "bitwise AND" of numbers *a**i* and *a**j* (that is, *b**ij*<==<=*a**i* & *a**j*), if *i*<=≠<=*j*; - -1, if *i*<==<=*j*. Having written out matrix *b*, Polycarpus got very happy and wiped *a* off the blackboard. But the thing is, the teacher will want this sequence to check whether Polycarpus' calculations were correct. Polycarus urgently needs to restore the removed sequence of integers, or else he won't prove that he can count correctly. Help Polycarpus, given matrix *b*, restore the sequence of numbers *a*1,<=*a*2,<=...,<=*a**n*, that he has removed from the board. Polycarpus doesn't like large numbers, so any number in the restored sequence mustn't exceed 109. The first line contains a single integer *n* (1<=≤<=*n*<=≤<=100) — the size of square matrix *b*. Next *n* lines contain matrix *b*. The *i*-th of these lines contains *n* space-separated integers: the *j*-th number represents the element of matrix *b**ij*. It is guaranteed, that for all *i* (1<=≤<=*i*<=≤<=*n*) the following condition fulfills: *b**ii* = -1. It is guaranteed that for all *i*,<=*j* (1<=≤<=*i*,<=*j*<=≤<=*n*; *i*<=≠<=*j*) the following condition fulfills: 0<=≤<=*b**ij*<=≤<=109, *b**ij*<==<=*b**ji*. Print *n* non-negative integers *a*1,<=*a*2,<=...,<=*a**n* (0<=≤<=*a**i*<=≤<=109) — the sequence that Polycarpus wiped off the board. Separate the numbers by whitespaces. It is guaranteed that there is sequence *a* that satisfies the problem conditions. If there are multiple such sequences, you are allowed to print any of them. Sample Input 1 -1 3 -1 18 0 18 -1 0 0 0 -1 4 -1 128 128 128 128 -1 148 160 128 148 -1 128 128 160 128 -1 Sample Output 0 18 18 0 128 180 148 160

[ "n=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n q=0\r\n for i in map(int,input().split()):\r\n if i!=-1:q|=i\r\n l+=[q]\r\nprint(*l)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nans = [0]*n\r\nfor i in range(n):\r\n for j in range(n):\r\n if j!=i:\r\n ans[i] |= a[i][j]\r\n print(ans[i],end = ' ')\r\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = [0]*n\r\nfor i in range(n):\r\n s = list(map(int, input().split()))\r\n for j in range(i+1, n):\r\n d[i] |= s[j]\r\n d[j] |= s[j]\r\n\r\nprint(' '.join(map(str, d)))\r\n", "n = int(input())\na = [0]*n\nfor i in range(n):\n for x in map(int, input().split()):\n if x!=-1:\n a[i]|=x\nprint(*a)\n", "def str_from_list(row):\r\n result = \"\"\r\n for number in row:\r\n result += str(number) + \" \"\r\n return result[0:len(result)-1]\r\n\r\ndef table_restore(size, table):\r\n table_rows = table.split('\\n')\r\n current_size = int(size)\r\n result = [0]*current_size\r\n for i in range(current_size):\r\n for x in map(int, table_rows[i].split()):\r\n if x != -1:\r\n #побитовое или\r\n result[i] |= x\r\n return str_from_list(result) \r\n\r\nsize = input()\r\ntable = \"\"\r\nfor _ in range(int(size)):\r\n table += input() + \"\\n\"\r\n\r\ntable = str(table[0:len(table)-1])\r\n\r\nprint(table_restore(size, table))", "n = int(input())\r\np = [0] * n\r\nfor i in range(n):\r\n t = list(map(int, input().split()))\r\n t.pop(i)\r\n s = 0\r\n for j in t:\r\n s |= j\r\n p[i] = s\r\nprint(' '.join(map(str, p)))", "n = int(input())\r\nrow = [0] * n\r\nres = [0] * n\r\nfor i in range(n):\r\n row[i] = map(int, input().split())\r\n for y in row[i]:\r\n if y != -1:\r\n res[i] |= y\r\nfor r in res:\r\n print(r, end=' ')# 1698100805.8303063", "n = int(input())\na = [0]*n\nfor i in range(n):\n\tfor j, aij in enumerate(map(int, input().split())):\n\t\tif i==j: continue\n\t\ta[i] |= aij\n\t\ta[j] |= aij\n\nprint(' '.join(map(str, a)))\n", "n = int(input())\r\nls = []\r\nfor i in range(n) :\r\n ls.append(list(map(int,input().split())))\r\nfor i in range(n) :\r\n val = 0\r\n for j in range(n) :\r\n if i != j :\r\n val |= ls[i][j]\r\n print(val,end=\" \")", "n = int(input())\r\nfor i in range(n):\r\n r = 0\r\n for b in input().split():\r\n if b != '-1':\r\n r |= int(b)\r\n print(r, end=' ')\r\n", "from sys import stdin\r\nimport math\r\nimport zlib\r\n\r\nn = int(stdin.readline().rstrip())\r\nm = [list(map(int, stdin.readline().rstrip().split(' '))) for _ in range(n)]\r\n\r\nans = [0] * 110\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n ans[i] |= m[i][j]\r\n\r\nfor i in range(n):\r\n print(ans[i], end=' ')", "n=int(input())\r\nA=[0]*n\r\nans=[0]*n\r\nfor i in range(n):\r\n\tA[i]=list(map(int,input().split()))\r\n\tfor j in range(n):\r\n\t\tif(j==i):continue\r\n\t\tans[i]|=A[i][j]\r\nfor i in range(n):\r\n\tprint(ans[i],' ',end='')\r\n" ]

{"inputs": ["1\n-1", "3\n-1 18 0\n18 -1 0\n0 0 -1", "4\n-1 128 128 128\n128 -1 148 160\n128 148 -1 128\n128 160 128 -1", "5\n-1 0 0 0 0\n0 -1 1 0 0\n0 1 -1 0 0\n0 0 0 -1 0\n0 0 0 0 -1", "6\n-1 1835024 1966227 34816 68550800 34832\n1835024 -1 18632728 306185992 324272924 289412624\n1966227 18632728 -1 40 555155640 16846864\n34816 306185992 40 -1 306185000 272666176\n68550800 324272924 555155640 306185000 -1 289481232\n34832 289412624 16846864 272666176 289481232 -1", "7\n-1 1000000000 999999488 999999488 1000000000 1000000000 999999488\n1000000000 -1 999999488 999999488 1000000000 1000000000 999999488\n999999488 999999488 -1 999999999 999999488 999999488 999999999\n999999488 999999488 999999999 -1 999999488 999999488 999999999\n1000000000 1000000000 999999488 999999488 -1 1000000000 999999488\n1000000000 1000000000 999999488 999999488 1000000000 -1 999999488\n999999488 999999488 999999999 999999999 999999488 999999488 -1", "8\n-1 56086 2560 35584 6402 18688 22530 256\n56086 -1 2697 35592 6410 18696 22667 257\n2560 2697 -1 10824 10280 10248 10377 8193\n35584 35592 10824 -1 76040 76040 10248 73984\n6402 6410 10280 76040 -1 76040 14346 73984\n18688 18696 10248 76040 76040 -1 26632 73984\n22530 22667 10377 10248 14346 26632 -1 9217\n256 257 8193 73984 73984 73984 9217 -1", "9\n-1 0 0 2 0 2 10 2 0\n0 -1 17 16 16 17 0 17 16\n0 17 -1 16 16 17 0 17 16\n2 16 16 -1 16 18 2 18 16\n0 16 16 16 -1 16 0 16 16\n2 17 17 18 16 -1 2 19 16\n10 0 0 2 0 2 -1 2 0\n2 17 17 18 16 19 2 -1 16\n0 16 16 16 16 16 0 16 -1", "10\n-1 16 16 0 0 0 0 16 16 16\n16 -1 16 3 3 2 0 17 18 16\n16 16 -1 0 0 0 0 16 16 16\n0 3 0 -1 15 10 12 1 2 0\n0 3 0 15 -1 10 12 1 2 0\n0 2 0 10 10 -1 8 0 2 0\n0 0 0 12 12 8 -1 0 0 0\n16 17 16 1 1 0 0 -1 16 16\n16 18 16 2 2 2 0 16 -1 16\n16 16 16 0 0 0 0 16 16 -1", "2\n-1 0\n0 -1"], "outputs": ["0 ", "18 18 0 ", "128 180 148 160 ", "0 1 1 0 0 ", "69109907 324818716 555700411 306220904 928457660 289521232 ", "1000000000 1000000000 999999999 999999999 1000000000 1000000000 999999999 ", "56086 56223 10985 109384 80170 92424 31883 75009 ", "10 17 17 18 16 19 10 19 16 ", "16 19 16 15 15 10 12 17 18 16 ", "0 0 "]}

UNKNOWN

PYTHON3

CODEFORCES

12

91c49eb218a529b816dfd941b351be69

Queue

Little girl Susie went shopping with her mom and she wondered how to improve service quality. There are *n* people in the queue. For each person we know time *t**i* needed to serve him. A person will be disappointed if the time he waits is more than the time needed to serve him. The time a person waits is the total time when all the people who stand in the queue in front of him are served. Susie thought that if we swap some people in the queue, then we can decrease the number of people who are disappointed. Help Susie find out what is the maximum number of not disappointed people can be achieved by swapping people in the queue. The first line contains integer *n* (1<=≤<=*n*<=≤<=105). The next line contains *n* integers *t**i* (1<=≤<=*t**i*<=≤<=109), separated by spaces. Print a single number — the maximum number of not disappointed people in the queue. Sample Input 5 15 2 1 5 3 Sample Output 4

[ "n = int(input())\r\ntlist = list(map(int, input().split()))\r\ntlist.sort()\r\ncount = 0\r\nsum1 = tlist[0]\r\nfor i in range(1,n):\r\n if sum1 <= tlist[i]:\r\n count += 1\r\n sum1 += tlist[i]\r\nprint(count+1) ", "'''\r\n2300015897\r\n吴杰稀\r\n光华管理学院\r\n'''\r\nn = int(input())\r\nnum_list = list(map(int,input().split()))\r\nnum_list.sort()\r\ni = 0\r\nhappy_num = 0\r\ntotal_time = 0\r\nwhile i <= len(num_list) - 1:\r\n if num_list[i] >= total_time:\r\n total_time += num_list[i]\r\n happy_num += 1\r\n i += 1\r\nprint(happy_num)\r\n", "s=t=0\r\nfor i in sorted(map(int,[*open(0)][1].split())):\r\n if i>=s:t+=1;s+=i\r\nprint(t)", "n = int(input())\r\nline = list(map(int,input().split()))\r\n\r\nline.sort()\r\nqueue = []\r\nfor i in line:\r\n if i >= sum(queue):\r\n queue.append(i)\r\nprint(len(queue))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 31 22:20:45 2023\r\n\r\n@author: 袁兆瑞\r\n\"\"\"\r\n\r\n# 读取输入\r\nn = int(input())\r\ntimes = list(map(int, input().split()))\r\n\r\n# 对时间列表进行排序\r\ntimes.sort()\r\n\r\n# 初始化变量\r\ncount = 0\r\nsum_time = 0\r\n\r\n# 计算最大不失望人数\r\nfor i in range(n):\r\n if sum_time <= times[i]:\r\n count += 1\r\n sum_time += times[i]\r\n\r\n# 输出结果\r\nprint(count)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=1\r\nb=[a[0]]\r\nfor i in range(1,n):\r\n if a[i]>=sum(b):\r\n ans+=1\r\n b.append(a[i])\r\nprint(ans)", "# Asif Islam - asifislam510\nn = int(input())\narr = sorted(map(int, input().split()))\ns = 0\noutput = 0\n\nfor i in arr:\n if i >= s:\n output += 1\n s += i\n\nprint(output)\n\n\t \t\t\t\t \t \t \t\t\t\t\t \t\t \t\t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Oct 28 19:02:05 2023\r\n\r\n@author: 20311\r\n\"\"\"\r\n\r\nn=int(input())\r\nqueue=list(map(int,input().split()))\r\nqueue.sort()\r\ns=0\r\ncount=0\r\nfor i in range(len(queue)):\r\n if queue[i]>=s:\r\n count+=1\r\n s+=queue[i]\r\n\r\nprint(count)", "n=int(input())\r\ntime=list(map(int,input().split()))\r\n\r\ntime.sort()\r\nfin_line=[]\r\nfor i in range(n):\r\n if time[i]>=sum(fin_line):\r\n fin_line.append(time[i])\r\nprint(len(fin_line))", "def lavkush(l):\r\n l.sort()\r\n k=0\r\n c=0\r\n for i in l:\r\n if k<=i:\r\n c=c+1\r\n k=k+i\r\n return c\r\nn=int(input())\r\nl=[int(i) for i in input().split()][:n]\r\nprint(lavkush(l))", "n=int(input())\r\nli=[int(i) for i in input().split()]\r\nli.sort()\r\nwait=0\r\nans=0\r\nfor i in range(n):\r\n if li[i]>=wait:\r\n ans+=1\r\n wait+=li[i]\r\nprint(ans)\r\n", "def solve(n):\n n.sort()\n count = 0\n curr = 0\n for num in n:\n if num < curr:\n continue\n count += 1\n curr += num\n return count\n\ndef main():\n t = int(input())\n print(solve([int(x) for x in input().split()]))\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=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nsm=0\r\nn=len(lst)\r\nnd=0\r\nfor i in range(n):\r\n if lst[i]>=sm:\r\n nd+=1\r\n sm+=lst[i]\r\nprint(nd)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nsotred_arr = sorted(arr)\r\nres = 0\r\ntime = 0\r\nfor i in range(len(sotred_arr)):\r\n if time <= sotred_arr[i]:\r\n res += 1\r\n time += sotred_arr[i]\r\n\r\n \r\n\r\nprint(res)", "#游敬恩，2300012555\r\nn = int(input())\r\nlis = list(map(int, input().split()))\r\nlis.sort()\r\nsum = 0\r\nsatis = 0\r\nfor i in range(n):\r\n if sum <= lis[i]:\r\n satis += 1\r\n sum += lis[i]\r\nprint(satis)", "n=int(input())\r\ntime=[int(x)for x in input().split()]\r\ntime.sort()\r\ntot=0\r\nans=0\r\nfor i in range(n):\r\n if tot <= (t:=time[i]):\r\n ans+=1\r\n tot+=t\r\nprint(ans)", "n = int(input())\r\nservice_times = list(map(int, input().split()))\r\n\r\nservice_times.sort() # Sort the service times in ascending order\r\n\r\nnot_disappointed_count = 0\r\nwaiting_time = 0\r\n\r\nfor i in range(n):\r\n if waiting_time <= service_times[i]:\r\n not_disappointed_count += 1\r\n waiting_time += service_times[i]\r\n\r\nprint(not_disappointed_count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 27 15:31:33 2023\r\n\r\n@author: Amanda\r\n\"\"\"\r\n\r\nn=int(input())\r\nqueue=list(map(int,input().split()))\r\nqueue.sort()\r\nx = 0\r\nsum = 0\r\nfor i in range(n):\r\n if sum <= queue[i]:\r\n x += 1\r\n sum += queue[i]\r\nprint(x)", "n = int(input())\r\nti = list(map(int, input().split()))\r\nti.sort()\r\nresult = []\r\n\r\nfor i in range(len(ti)):\r\n if ti[i] >= sum(result[:i]):\r\n result.append(ti[i])\r\n\r\nprint(len(result))\r\n", "n = int(input())\r\ntime = list(map(int,input().split()))\r\ntime = sorted(time)\r\n\r\nwait_time = 0\r\nppl = 0\r\n\r\nfor i in range(n):\r\n if time[i] >= wait_time:\r\n ppl += 1\r\n wait_time += time[i]\r\n\r\nprint(ppl)", "def max_happy_people(n, times):\r\n times.sort() # Сортировка времен обслуживания по возрастанию\r\n happy_count = 0 # Счетчик довольных людей\r\n total_waiting_time = 0 # Общее время ожидания\r\n\r\n for i in range(n):\r\n if times[i] >= total_waiting_time: # Проверка условия для довольного человека\r\n happy_count += 1\r\n total_waiting_time += times[i] # Обновление общего времени ожидания\r\n else:\r\n # Человек будет недоволен, переносим его в конец очереди без увеличения времени ожидания\r\n times.append(times[i])\r\n\r\n return happy_count\r\n\r\n\r\n# Чтение входных данных\r\nn = int(input())\r\ntimes = list(map(int, input().split()))\r\n\r\n# Вызов функции и вывод результата\r\nprint(max_happy_people(n, times))", "n=int(input())\r\nt=list(map(int,input().split()))\r\nt.sort()\r\ntime=t[0]\r\nnum=1\r\nfor i in range(1,n):\r\n if t[i]>=time:\r\n num+=1\r\n time+=t[i]\r\n else:\r\n continue\r\nprint(num)", "n=int(input())\r\na=list(map(int, input().split()))\r\na.sort()\r\nc,t=0,0\r\nfor i in range(n):\r\n if a[i]>=t:\r\n t+=a[i]\r\n c+=1\r\nprint(c)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nsatis=[1]*n\r\ncnt=0\r\nfor i in range(0,len(a)):\r\n if cnt>a[i]:\r\n satis[i]=0\r\n cnt+=a[i]\r\n\r\ntot=0\r\nans=0\r\nfor j in range(0,len(a)):\r\n if satis[j]==1:\r\n ans+=1\r\n tot+=a[j]\r\n else:\r\n if tot<=a[j]:\r\n tot+=a[j]\r\n ans+=1\r\n else:\r\n continue\r\n\r\nprint(ans)\r\n", "lentgh = input()\r\ncount = time = 0\r\nfor t in sorted(map(int,input().split())) :\r\n if time <= t : \r\n count += 1\r\n time += t \r\nprint(count)", "n = int(input())\r\narr = sorted([int(i) for i in input().split()]) \r\nsm = ans = 0\r\nfor i in range(n) : \r\n if arr[i] >= sm : \r\n ans += 1\r\n sm += arr[i]\r\nprint(ans)\r\n", "n = int(input())\r\nservice_times = list(map(int, input().split()))\r\n\r\n# 步骤1：按升序排序服务时间\r\nservice_times.sort()\r\n\r\n# 步骤2：初始化变量\r\ntotal_time = 0\r\nsatisfied_count = 0\r\n\r\n# 步骤3：计算满意人数上限\r\nfor time in service_times:\r\n if time >= total_time:\r\n satisfied_count += 1\r\n total_time += time\r\n\r\n# 步骤4：输出最大满意人数\r\nprint(satisfied_count)", "n = int(input())\ntimes = list(map(int, input().split()))\ntimes.sort()\n\na, tt = 0, 0\nfor t in times:\n if t >= tt:\n tt += t\n a += 1\n\nprint(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\nm=list(map(int,input().split()))\r\nm=sorted(m)\r\ny=len(m)\r\ncount=0\r\ns=0\r\nfor i in range(0, y):\r\n if m[i]>=s:\r\n count+=1\r\n else:\r\n m[i]=0\r\n s+=m[i]\r\n \r\nprint(count)", "# LUOGU_RID: 131344718\ninput();a=sorted(map(int,input().split()));c=d=0\nfor i in a:\n if i>=c:d+=1;c+=i\nprint(d)", "\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nxiao=0\r\nfor i in range(n):\r\n if l[i]>=xiao:\r\n c+=1\r\n xiao+=l[i]\r\nprint(c)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nans=k=0\r\ns.sort()\r\nfor i in s :\r\n if k<=i:\r\n ans+=1\r\n k+=i\r\n\r\nprint(ans)", "a=input()\r\nlist=list(map(int,input().split()))\r\nlist.sort()\r\nsum=0\r\np=0\r\nfor n in range(len(list)) :\r\n if sum<=int(list[n]):\r\n sum += int(list[n])\r\n p+=1\r\nprint(p)", "n = int(input())\r\ninfo = list(map(int,input().split()))\r\ninfo.sort()\r\ns = 0\r\nans = 0\r\n\r\nfor x in info:\r\n if x >= s:\r\n s += x\r\n ans += 1\r\n\r\nprint(ans)", "#周家恒化学与分子工程学院 2023年秋\r\nn=int(input())\r\naa=list(map(int,input().split()))\r\naa.sort()\r\nt=aa[0]\r\nm=1\r\nfor i in range(1,n):\r\n if aa[i]>=t:\r\n t+=aa[i]\r\n m+=1\r\nprint(m)", "n=int(input())\r\npersons=list(map(int,input().split()))\r\npersons.sort()\r\nindex=0\r\ntime=0\r\nr=0\r\nwhile index!=n:\r\n if time<=persons[index]:\r\n r+=1\r\n time+=persons[index]\r\n index+=1\r\n else:\r\n index+=1\r\nprint(r)", "# Compiled by zhou_tian from pku\r\n\r\nn = int(input())\r\ntimes = [int(i) for i in input().split()]\r\ntimes.sort()\r\n\r\ntts = times[0] # temporary_time_sum\r\nndp = 1 # not_disappointed_people\r\n\r\nfor i in range(1, n):\r\n if times[i] >= tts:\r\n ndp += 1\r\n tts += times[i]\r\n\r\nprint(ndp)", "n = int(input())\r\ns = list(map(int, input().split()))\r\ns = sorted(s)\r\nsu = 0\r\nans = 0\r\nfor i in range(n):\r\n if su <= s[i]:\r\n ans += 1\r\n su += s[i]\r\nprint(ans)", "# Queue\r\nn = int(input())\r\ns = list(map(int,input().split(\" \")))\r\ns.sort()\r\nx = [0]\r\ncount = 0\r\nz = []\r\nfor i in range(n):\r\n if s[i] < x[i]:\r\n x.append(x[i])\r\n z.append(s[i])\r\n else:\r\n count += 1\r\n x.append(x[i]+s[i])\r\nprint(count)", "n = int(input())\r\nT = list(map(int, input().split()))\r\nT.sort()\r\ntime = 0\r\nx = 0\r\nfor i in range(n):\r\n if T[i] >= time:\r\n time += T[i]\r\n x += 1\r\n else:\r\n pass\r\nprint(x)\r\n", "def max_not_disappoint(people):\r\n people.sort()\r\n result = 0\r\n cumulative_time = 0\r\n for i in range(n):\r\n if cumulative_time <= people[i]:\r\n result += 1\r\n cumulative_time += people[i]\r\n\r\n return result\r\n\r\n\r\nn = int(input())\r\nt_i = list(map(int, input().split()))\r\nprint(max_not_disappoint(t_i))", "#刘乐天 2300012105 生命科学学院\r\nn=int(input())\r\nt=list(map(int,input().split()))\r\nt.sort()\r\na=1\r\ns=[t[0]]\r\nfor i in range(1,n):\r\n if t[i]>=sum(s):\r\n s.append(t[i])\r\n a+=1\r\nprint(a)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 26 16:09:00 2023\r\n\r\n@author: masiyu004\r\n\"\"\"\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nsum=0\r\nx=0\r\nfor i in a:\r\n if i>=sum:\r\n sum+=i\r\n x+=1\r\nprint(x)", "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# For fast IO use sys.stdout.write(str(x) + \"\\n\") instead of print\r\nimport sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nfor t in range(1):\r\n n = int(input().strip())\r\n arr = get_list()\r\n \r\n arr.sort()\r\n prefix_sum = 0\r\n count = 0\r\n # print(arr)\r\n \r\n for i in range(0, n):\r\n if prefix_sum <= arr[i]:\r\n count += 1\r\n prefix_sum += arr[i]\r\n print(count)", "def li(): return list(map(int,input().split()))\r\n\r\ndef nt(): return int(input())\r\n\r\ndef st(): return input()\r\n\r\nn=nt()\r\nL=li()\r\ncheck=list(L)\r\ncheck.sort()\r\nans=0\r\npre=0\r\nfor i in range(n):\r\n# print(pre,check[i])\r\n if check[i]>=pre:\r\n ans+=1\r\n pre+=check[i] \r\nprint(ans)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\nt=1\r\nsum=l[0]\r\nfor i in range(1,n):\r\n if l[i]>=sum:\r\n t+=1\r\n sum+=l[i]\r\n else:\r\n l[i]=0\r\nprint(t)", "#author 沈天健 2300011417\r\nn=int(input())\r\nt=[0]+[*map(int,input().split())]\r\nt.sort()\r\nans=0\r\nsumm=0\r\nfor i in range(1,n+1):\r\n if t[i]<summ:\r\n continue\r\n ans+=1\r\n summ+=t[i]\r\nprint(ans)\r\n", "n = int(input())\r\npeople = [int(i) for i in input().split()]\r\npeople.sort()\r\ntime = 0\r\nsatisfaction = 0\r\nfor j in people:\r\n if j >= time:\r\n satisfaction += 1\r\n time += j\r\nprint(satisfaction)", "n = int(input())\nwaiters = list(map(int, input().split()))\nwaiters.sort()\ncounter, total_wait = 1, waiters[0]\n\nfor i in range(1, len(waiters)):\n if waiters[i] >= total_wait:\n total_wait += waiters[i]\n counter += 1\n\nprint(counter)", "n = int(input())\r\ntimelist = sorted(list(map(int,input().split())))\r\ntotal_time = 0\r\ncount = 0\r\nfor i in range(n):\r\n if total_time <= timelist[i]:\r\n count += 1\r\n total_time += timelist[i]\r\nprint(count)", "n = int(input())\r\nnum = list(map(int, input().split()))\r\nnum.sort()\r\nindex = 1\r\nans = 1\r\ntotal = num[0]\r\nwhile index < n:\r\n if num[index] >= total:\r\n ans += 1\r\n total += num[index]\r\n index += 1\r\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 30 16:51:35 2023\r\n\r\n@author: ZHAO XUDI\r\n\"\"\"\r\n\r\nn = int(input())\r\nti_list = list(map(int,input().split()))\r\n\r\nti_count=0\r\nnot_disappointed_count = 0\r\n\r\nnew_ti = sorted(ti_list)\r\nfor ti in new_ti:\r\n if ti_count<=ti:\r\n not_disappointed_count+=1\r\n ti_count+=ti\r\nprint(not_disappointed_count)\r\n \r\n", "n = int(input()) # ��е��\r\nserve_times = list(map(int, input().split())) # ��ʱ��б�\r\n\r\nserve_times.sort() # ��շ��ʱ��\r\n\r\nmax_not_disappointed = 0\r\ncurrent_wait_time = 0\r\n\r\nfor i in range(n):\r\n if current_wait_time <= serve_times[i]:\r\n max_not_disappointed += 1\r\n current_wait_time += serve_times[i]\r\n\r\nprint(max_not_disappointed)", "n = int(input())\r\nts = sorted([int(i) for i in input().split()])\r\ns = 0\r\nc = 0\r\nfor i in range(n):\r\n if ts[i] >= s:\r\n s += ts[i]\r\n c += 1\r\nprint(c)\r\n", "n = int(input())\r\nt = sorted(list(map(int, input().split())))\r\ntotal_time, total = 0, 0\r\ni, j = 0, -1\r\nfor i in range(n):\r\n while j < n - 1:\r\n j += 1\r\n if t[j] >= total_time:\r\n total += 1\r\n break\r\n total_time += t[j]\r\nprint(total)", "n = int(input())\r\nt = [int(i) for i in input().split()]\r\nt.sort()\r\ncnt = 0\r\npresum = 0\r\nfor a in t:\r\n if presum <= a:\r\n presum += a\r\n cnt += 1\r\nprint(cnt)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 24 16:21:19 2023\r\n\r\n@author: 2300011794\r\n\"\"\"\r\nn=int(input())\r\nq=list(map(int,input().split()))\r\nq.sort()\r\nsm=0\r\nfor i in range(1,n-1):\r\n sm+=q[i-1]\r\n if sm>q[i+1]:\r\n q[i]=0\r\n elif sm>q[i]:\r\n q[i]=0\r\nif sum(q[0:n-1])>q[-1]:\r\n q[-1]=0\r\nprint(n-q.count(0))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\npre=[0]\r\nans=0\r\nfor i in range(0,n):\r\n\tif pre[i]>l[i]:\r\n\t\tpre.append(pre[i])\r\n\telse:\r\n\t\tpre.append(pre[i]+l[i])\r\n\t\tans+=1\r\nprint(ans)\r\n", "people_quantity = int(input())\r\nwaiting_time_sequence = list(map(int, input().split()))\r\n\r\nwaiting_time_sequence.sort()\r\nwaiting_time = 0\r\nsatisfied_quantity = 0\r\n#print(waiting_time_sequence)\r\nfor i in range(0, people_quantity):\r\n if waiting_time <= waiting_time_sequence[i]:\r\n satisfied_quantity += 1\r\n else:\r\n waiting_time_sequence[i] = 0\r\n waiting_time += waiting_time_sequence[i]\r\n\r\nprint(satisfied_quantity)", "input();r,c=0,0\r\nfor i in sorted(map(int,input().split())):\r\n if r<=i:r+=i;c+=1\r\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sorted(a)\r\nt,l=0,0\r\nfor i in range(n):\r\n if t<=b[i]:\r\n t+=b[i]\r\n l+=1\r\nprint(l)", "n = int(input())\r\nwaiting_queue = list(map(int,input().split()))\r\nwaiting_queue.sort()\r\ntimes = 0\r\ni = 0\r\nsatisfy_man = 0\r\nwhile i < n:\r\n if times > waiting_queue[i]:\r\n i += 1\r\n else:\r\n times += waiting_queue[i]\r\n satisfy_man += 1\r\n i += 1\r\n\r\nprint(satisfy_man)", "n=int(input())\r\na=input().split()\r\ntime=[int(i) for i in a]\r\ntime.sort()\r\ncount=1\r\na=time[0]\r\nsum=a\r\nfor i in range(1,n):\r\n if time[i]>=sum:\r\n count+=1\r\n sum=sum+time[i]\r\n else:\r\n continue\r\nprint(count)", "import heapq\r\n\r\nn = int(input())\r\nt = list(map(int, input().split()))\r\n\r\npq = [] # priority queue of people (ti, i)\r\nfor i in range(n):\r\n heapq.heappush(pq, (t[i], i))\r\n\r\nnot_disappointed = 0\r\ntotal_waiting_time = 0\r\nwhile pq:\r\n ti, i = heapq.heappop(pq)\r\n if total_waiting_time <= ti:\r\n not_disappointed += 1\r\n total_waiting_time += ti\r\n else:\r\n continue # discard disappointed person\r\n\r\nprint(not_disappointed)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 26 17:16:27 2023\r\n\r\n@author: 程卓 2300011733\r\n\"\"\"\r\n\r\nn = int(input())\r\nqueue = sorted([int(i) for i in input().split()])\r\nanswer = 0\r\nlength = 0\r\nfor i in range(n):\r\n if length <= queue[i]:\r\n length += queue[i]\r\n answer += 1\r\nprint(answer)\r\n#如果一个人已经不满意了，就把他放到队尾\r\n#没有的，连他所有的也要夺过来。——《新约·马太福音》", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 26 15:33:24 2023\r\n\r\n@author: 苏柔德 2300011012\r\n\"\"\"\r\nn=int(input())\r\nqueue=list(map(int, input().split()))\r\nqueue=sorted(queue)\r\ntotal=0\r\ncount=0\r\nfor i in range(n):\r\n if queue[i]>=total:\r\n total+=queue[i]\r\n count+=1\r\nprint(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 24 15:28:09 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nn = int(input())\r\nls = list(map(int,input().split()))\r\nls.sort()\r\nwait = 0\r\nans = 0\r\nfor i in range(len(ls)) :\r\n if ls[i] >= wait :\r\n wait += ls[i]\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort();t=0;k=0\r\nfor i in range(n):\r\n if a[i]>=t:\r\n t+=a[i]\r\n k+=1\r\n else:\r\n a[i]=0\r\nprint(k)", "n=int(input())\r\nt_list=list(map(int,input().split()))\r\nt_list.sort()\r\nind=0;num=0\r\nfor i in range(n):\r\n if t_list[i]>=ind:\r\n num+=1\r\n ind+=t_list[i]\r\n else:\r\n num+=0\r\nprint(num)\r\n", "import bisect\r\ndef solve():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n a.sort()\r\n psum=a[0]\r\n count=1\r\n for i in range(1,n):\r\n if psum<=a[i]:\r\n count+=1\r\n psum+=a[i]\r\n print(count)\r\n \r\nsolve()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 26 19:43:14 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\nn=int(input())\r\nqueue=list(map(int,input().split()))\r\nqueue.sort()\r\ntime=0\r\npeople_not_mad=0\r\nfor i in queue:\r\n if time<=i:\r\n time+=i\r\n people_not_mad+=1\r\n else:\r\n pass\r\nprint(people_not_mad)", "int(input())\r\nqueue = list(map(int,input().split()))\r\nqueue.sort()\r\nsumm = 0\r\nfor i in range(len(queue)-1):\r\n flag = True\r\n summ += queue[i]\r\n for j in range(i+1,len(queue)):\r\n if queue[j] >= summ:\r\n a = queue.pop(j)\r\n queue.insert(i+1,a)\r\n flag = False\r\n break\r\n if flag:\r\n break\r\nsum_ = i = disappointed = 0\r\nwhile i < len(queue)-1:\r\n sum_ += queue[i]\r\n if sum_ > queue[i+1]:\r\n disappointed += 1\r\n i += 1\r\nprint(len(queue)-disappointed)\r\n\r\n\r\n", "\r\nn=int(input())\r\ntime=list(map(int,input().split()))\r\ntime.sort()\r\nanswer=0\r\ncurrent=0\r\nfor value in time:\r\n if value>=current:\r\n answer+=1\r\n current+=value\r\nprint(answer)\r\n\r\n\r\n", "n = int(input())\r\nm = sorted([int(i) for i in input().split()])\r\ns,t = 0,0\r\nfor i in range(n):\r\n if t <= m[i]:\r\n t += m[i]\r\n s += 1\r\nprint(s)", "#王天,2300011878\r\n#n个人，每个人ti时间，使等待时间少于ti的人最多\r\nn=int(input())\r\nt=list(map(int,input().split()))\r\nt.sort()\r\na=[]\r\nans=0\r\nfor i in range(n):\r\n if t[i]>=sum(a):\r\n ans+=1\r\n a.append(t[i])\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nmax1=0\r\nwait=0\r\nfor i in range(len(a)):\r\n if a[i]>=wait:\r\n max1+=1\r\n wait+=a[i]\r\nprint(max1)", "n = int(input())\r\nq = [int(x) for x in input().split()]\r\nq.sort()\r\nans = 0\r\ntime = 0\r\nfor x in q:\r\n if time <= x:\r\n ans += 1\r\n time += x\r\nprint(ans)", "N=int(input())\na = list(map(int, input().split()))\na.sort()\nsum=0\nans=0\nfor _ in a:\n if(sum<=_):\n ans+=1\n sum+=_\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\na=sorted(a)\r\nt=0;ans=0\r\nfor i in range(n):\r\n if a[i]>=t:\r\n ans+=1\r\n t+=a[i]\r\nprint(ans)\r\n#不满意的人直接踢到队尾去，相当于不满意的人不算服务时间", "n = int(input())\r\nd = sorted(list(map(int, input().split())))\r\n\r\nhappy = 0\r\n\r\nt = 0\r\nfor person in d:\r\n if t <= person:\r\n happy += 1\r\n t += person\r\n\r\nprint(happy)", "n = int(input())\r\nqueue = sorted(list(map(int, input().split())))\r\nwait_time = 0\r\nsatisfy = 0\r\nfor man in queue:\r\n if man >= wait_time:\r\n satisfy += 1\r\n wait_time += man\r\nprint(satisfy)", "n=int(input())\r\ntime=0\r\nnumber=0\r\na=[int(i) for i in input().split()]\r\na=sorted(a)\r\nfor i in a:\r\n if time<=i:\r\n time+=i\r\n number+=1\r\nprint(number)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 24 13:14:03 2023\r\n\r\n@author: zinc 2300012115\r\n\"\"\"\r\n\r\nn = int(input())\r\ntimes = [int(x) for x in input().split()]\r\ntimes.sort()\r\ndp = [0]*(n+1)\r\ncnt = 0\r\nfor i in range(n):\r\n if times[i] >= dp[i-1]:\r\n cnt += 1\r\n dp[i] = dp[i-1] + times[i]\r\n else:\r\n dp[i] = dp[i-1]\r\nprint(cnt)\r\n", "t = int(input())\r\nc = 0\r\ns = 0\r\nfor i in sorted(map(int, input().split())) :\r\n if s <= i : s += i; c += 1\r\n\r\nprint(c)", "n=int(input())\r\nservetime=sorted(list(map(int,input().split())))\r\nwaittime,cnt=0,n\r\nfor i in range(n):\r\n if servetime[i]>=waittime:\r\n waittime+=servetime[i]\r\n else:\r\n cnt-=1\r\nprint(cnt)", "n=int(input())\r\narr=sorted(list(map(int,input().split())))\r\nr=0\r\nc=0\r\nfor i in arr:\r\n if r<=i:\r\n c+=1\r\n r+=i\r\n \r\nprint(c)\r\n", "n=int(input())\r\ntime=list(map(int,input().split()))\r\ntime.sort()\r\nline=time.copy()\r\nwaiting_time=time[0]\r\nfor i in range(1,n):\r\n if time[i]>=waiting_time:\r\n waiting_time+=time[i]\r\n else:\r\n line[i]=0\r\nprint(n-line.count(0))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 24 15:13:01 2023\r\n\r\n@author: ghp\r\n\"\"\"\r\n\r\nn=int(input())\r\ntime=list(map(int,input().split()))\r\ntime.sort()\r\nk=0\r\nx=0\r\nfor i in range(n):\r\n if k<=time[i]:\r\n k+=time[i]\r\n x+=1\r\nprint(x)", "n = int(input())\r\nserve_time = list(map(int, input().split()))\r\nserve_time.sort()\r\n\r\nans = 0\r\nsum_time = 0\r\n\r\nfor time in serve_time:\r\n if sum_time <= time:\r\n ans += 1\r\n sum_time += time\r\n\r\nprint(ans)\r\n", "n=int(input())\r\narr=[int(h) for h in input().split()]\r\narr.sort()\r\nans=0\r\nsum=0\r\nh=0\r\nwhile h<n:\r\n if sum<=arr[h]:\r\n ans+=1\r\n sum+=arr[h]\r\n h+=1 \r\nprint(ans) \r\n ", "n=int(input())\npeople_time=list(map(int,input().split()))\npeople_time=sorted(people_time)\npeople_chart=[]\nsum_of_before_time=0\ndisappointed_people=0 \nsum_of_before_time=people_time[0]\nfor i in range(1,n):\n if people_time[i]>=sum_of_before_time:\n # print(sum_of_before_time,people_time[i],sep=\",\")\n sum_of_before_time+=people_time[i]\n else:\n #print(\"disappointes people are\",people_time[i])\n disappointed_people+=1 \n\nprint(n-disappointed_people)\n\n ", "n=int(input())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\nm=1\r\nt=s[0]\r\nfor i in s[1:]:\r\n if i>=t:\r\n t+=i\r\n m+=1\r\nprint(m)", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\na=list(map(int,input().strip().split()))\r\na.sort()\r\ncur=ans=0\r\nfor i in range(n):\r\n if a[i]>=cur:\r\n ans+=1\r\n cur+=a[i]\r\nprint(ans)", "#蒋世刚2300016304\r\nn=input()\r\na=list(map(int,input().split()))\r\na.sort()\r\nt=0\r\nnum=0\r\nfor i in a:\r\n if i>=t:\r\n t=t+i\r\n num+=1\r\nprint(num)\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nqueue = list(map(int, input().split()))\r\n\r\n# Sort queue in ascending order\r\nqueue.sort()\r\n\r\ncount = 0\r\nwaiting_time = 0\r\n\r\nfor i in range(n):\r\n if waiting_time <= queue[i]:\r\n count += 1\r\n waiting_time += queue[i]\r\n \r\nprint(count)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\n\r\ntime_passed = 0\r\ncount = 0\r\nfor i in a:\r\n if i >= time_passed:\r\n time_passed += i\r\n count += 1\r\n\r\nprint(count)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ntimes = sorted([int(x) for x in input().split()])\r\n\r\ntot = 0\r\ncnt = 0\r\n\r\nfor idx, t in enumerate(times):\r\n if tot <= times[idx]:\r\n cnt += 1\r\n tot += times[idx]\r\n\r\nprint(cnt)", "# 李城岳生命科学学院 2300012106\r\nnumber = int(input())\r\norigin = list(map(int, input().split()))\r\norigin.sort()\r\nwait = 0\r\ncount = 0\r\nfor e in range(number):\r\n if origin[e] >= wait:\r\n wait += origin[e]\r\n count += 1\r\n else:\r\n continue\r\nprint(count)\r\n", "n = int(input())\r\nl = list(map(int , input().split()))\r\nl.sort()\r\nl0 = []\r\nsum = 0\r\n\r\nfor i in range(n):\r\n if l[i] >= sum:\r\n l0.append(l[i])\r\n sum += l[i]\r\n\r\nprint(str(len(l0)))", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Oct 24 16:34:03 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\n#此题思路有一点难想，就是让满意的人先等。看了题解后明白的\nn=int(input())\nnums=list(map(int,input().split()))\nnums.sort()\nk=0\ntime=0\nfor i in range(n):\n if nums[i]>=time:\n time+=nums[i]\n k+=1\nprint(k)\n \n", "# 2300012142 林烨\r\nn = input()\r\nn = 0\r\nqueue = sorted(list(map(int,input().split())))\r\nwaiting_time = 0\r\nfor i in queue:\r\n if i >= waiting_time:\r\n waiting_time += i\r\n n += 1\r\nprint(n)", "n = int(input())\r\ntime = list(map(int, input().split(\" \")))\r\ntime.sort()\r\nt = 0\r\nsatisfy_n = 0\r\n\r\nfor i in range(n):\r\n if t <= time[i]:\r\n t += time[i]\r\n satisfy_n += 1\r\n\r\nprint(satisfy_n)", "# import sys\r\n# input=sys.stdin.buffer.readline\r\nfrom functools import reduce\r\nfrom math import gcd\r\nfrom math import floor\r\nfrom math import inf\r\ninf = float('inf')\r\nfrom math import ceil\r\nfrom collections import Counter\r\n# for _ in range(int(input())):\r\n # W,H=map(int,input().split())\r\n # n,k=map(int,input().split())\r\n # =map(int,input().split())\r\n # n=int(input())\r\n # ans=0\r\n # for _ in range(n):\r\n # x,y=map(int,input().split())\r\n # if not(k<=y and k>=x):\r\n # ans+=1\r\n # if n>ans and ans!=0:\r\n # print(\"YES\")\r\n # else:\r\n # print(\"NO\") \r\nn=input()\r\nnums=list(map(int,input().split()))\r\nnums.sort()\r\nans=0\r\ncount=0\r\nfor item in nums:\r\n if ans<=item:\r\n count+=1\r\n ans+=item\r\nprint(count) \r\n\r\n \r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 24 16:03:31 2023\r\n\r\n@author: LiuzhiyuanPKUCoE\r\n\r\n\"\"\"\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\nt=x=0\r\nfor i in l:\r\n if i>=t:\r\n t+=i\r\n x+=1\r\n else:\r\n continue\r\nprint(x)\r\n ", "x=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nsum=l[0]\r\ndis=0\r\nfor i in range(1,x):\r\n if sum>l[i]:\r\n i+=1\r\n dis+=1\r\n else:\r\n sum+=l[i]\r\n \r\nprint(x-dis) ", "n = int(input())\nq = sorted(list(map(int, input().split())))\nsum = q[0]\nsatisfied = 1\nfor i in range(1, n):\n if q[i] >= sum:\n satisfied += 1\n sum += q[i]\nprint(satisfied)\n", "n = int(input())\na = list(map(int, input().split()))\n\na.sort()\nans = 1\n\ntime = a[0]\n\n#print(a)\nfor i in range(1, n):\n #print(a[i], time)\n if(a[i] >= time):\n time += a[i]\n ans += 1\n\nprint(ans)\n\n\t\t \t \t \t\t \t \t \t \t\t \t \t\t", "input()\r\nc = 0\r\nt = 0\r\nfor i in sorted(map(int,input().split())):\r\n if t <= i:\r\n t += i\r\n c += 1\r\nprint(c)", "n = int(input())\r\nt = list(map(int,input().split()))\r\nt.sort()\r\ntsum = 0\r\nwhile len(t) > 0 and tsum <= t[-1]:\r\n for i in range(len(t)):\r\n if t[i] >= tsum:\r\n tsum += t[i]\r\n t.remove(t[i])\r\n break\r\nprint(n - len(t))", "n = int(input())\r\ntime = list(map(int, input().split()))\r\ntime.sort()\r\ntot = 0\r\nans = 0\r\nfor i in range(0, n):\r\n if tot <= time[i]:\r\n ans += 1\r\n tot += time[i]\r\nprint(ans)\r\n# 化院荆屹然 2300011884\r\n", "def max_not_disappointed(n, times):\n times.sort() # Sort the list of service times.\n total_time = 0\n count = 0\n for t in times:\n if total_time <= t: # Check if the person is not disappointed.\n count += 1\n total_time += t\n return count\n\n# Input\nn = int(input())\ntimes = list(map(int, input().split()))\n\n# Process\nresult = max_not_disappointed(n, times)\n\n# Output\nprint(result)\n\n\t \t\t \t\t \t \t \t \t\t \t\t\t\t\t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 24 18:41:08 2023\r\n\r\n@author: 赵语涵2300012254\r\n\"\"\"\r\n\r\nn = int(input())\r\nnum = sorted(list(map(int,input().split())))\r\ntotal,i,count = num[0],1,1\r\nwhile i <= n-1:\r\n if num[i]>=total:\r\n total += num[i]\r\n i += 1\r\n count += 1\r\n else:\r\n i += 1\r\nprint(count)", "import bisect as bi\r\nn=int(input())-1;A=sorted(map(int,input().split()));b=A[0];t=1;i=0;del A[0]\r\nwhile i<n:b+=A[i];i=bi.bisect_left(A,b);t+=1\r\nprint(t)", "n = int(input()) # 输入队伍数量\ntimes = list(map(int, input().split())) # 输入每支队伍完成比赛所需的时间\ntimes.sort() # 将完成时间从小到大排序\n\nresult = 0 # 初始化完成比赛的队伍数量为0\nlast_time = 0 # 初始化上一支队伍的完成时间为0\nfor i in range(n):\n if times[i] >= last_time:\n result += 1 # 如果下一支队伍的完成时间大于等于上一支队伍的完成时间，则认为他们可以同时进行比赛\n last_time += times[i] # 更新上一支队伍的完成时间为下一支队伍的完成时间\n\nprint(result) # 输出最大可以同时进行比赛的队伍数量\n\n\n \n \n \n \n \n \n \n\n\n\n\n\n\n", "# https://codeforces.com/problemset/problem/545/D\n\ndef handle() -> int:\n input()\n values = sorted([int(s) for s in input().split(\" \")])\n\n total_wait_time = 0\n total = 0\n\n for value in values:\n if total_wait_time <= value:\n total_wait_time += value\n total += 1\n return total\n\nprint(handle())\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\np = [(t[i], i) for i in range(n)]\r\np.sort()\r\n\r\nnot_disappointed = 0\r\ntotal_waiting_time = 0\r\nfor ti, i in p:\r\n if total_waiting_time <= ti:\r\n not_disappointed += 1\r\n total_waiting_time += ti\r\n else:\r\n continue \r\nprint(not_disappointed)", "n=int(input())\r\ns=[int(i) for i in input().split()]\r\ns.sort()\r\nsumm=0\r\nnum=0\r\nfor i in range(n):\r\n if summ>s[i]:\r\n num+=1\r\n else:\r\n summ+=s[i]\r\n \r\nprint(n-num)", "n = int(input())\r\nt = list(map(int, input().split()))\r\nt.sort()\r\n\r\ndef find(v, x):\r\n l, r = x, n - 1\r\n while l != r:\r\n mid = l + r >> 1\r\n if t[mid] >= v:\r\n r = mid\r\n else:\r\n l = mid + 1\r\n return l\r\n\r\ns, cnt = 0, 0\r\nfor i in range(n):\r\n if s > t[n - 1]:\r\n break \r\n if s > t[i]:\r\n x = find(s, i + 1)\r\n tmp = t[x]\r\n t[x] = t[i]\r\n t[i] = tmp\r\n s += t[i]\r\n cnt += 1\r\nprint(cnt)", "#王铭健，工学院 2300011118\r\nn = int(input())\r\ncount = 1\r\nif n == 1:\r\n print(\"1\")\r\n exit()\r\nnum_list = sorted(list(map(int, input().split())))\r\nsum = num_list[0]\r\nfor i in range(1, n):\r\n if num_list[i] >= sum:\r\n count += 1\r\n sum += num_list[i]\r\nprint(count)", "n = int(input())\r\ntime = 0\r\nans = 0\r\nqueue = sorted(list(map(int,input().split())))\r\nfor i in queue:\r\n if time <= i:\r\n time += i\r\n ans += 1\r\nprint(ans)", "comp = [0]\r\nn = int(input())\r\nsatis = 0\r\nvalores = list(map(int,(input().strip().split())))\r\nvalores.sort()\r\ntiempo = 0\r\nfor valor in valores:\r\n if valor >= tiempo:\r\n tiempo += valor\r\n satis += 1\r\n else:\r\n continue\r\nprint(satis)", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nlist1.sort()\r\nans=0\r\nt=0\r\nfor i in list1:\r\n if i >= t:\r\n t+=i\r\n ans+=1\r\n else:\r\n continue\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nx=0\r\nm=0\r\nwhile l:\r\n while l and l[-1]<x:\r\n l.pop()\r\n if l:\r\n x+=l[-1]\r\n l.pop()\r\n m+=1\r\nprint(m)", "#!/usr/bin/python\r\nn=int(input())\r\ntime=list(map(int,input().split()))\r\ntime.sort()\r\nsatisfied=1\r\nsat_sum=time[0]\r\nfor i in range(1,n):\r\n if time[i] >= sat_sum:\r\n satisfied+=1\r\n sat_sum+=time[i]\r\nprint(satisfied)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nt = list(map(int, input().split()))\r\nt.sort()\r\ns = 0\r\nans = 0\r\nfor i in t:\r\n if s <= i:\r\n s += i\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\nservetime=list(map(int,input().split()))\r\nservetime.sort()\r\nwaittime=[0 for _ in range(n)]\r\ncnt=n\r\nfor i in range(n):\r\n if servetime[i]>=waittime[i-1]:\r\n waittime[i]=waittime[i-1]+servetime[i]\r\n else:\r\n waittime[i]=waittime[i-1]\r\n cnt-=1\r\nprint(cnt)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ncount=1#1st yes\r\ns=0\r\nfor i in range(1,n):\r\n s+=l[i-1]\r\n if s>l[i]:\r\n l[i]=0\r\n else:\r\n count+=1\r\nprint(count)", "n=int(input())\r\ntimes=list(map(int,input().split()))\r\ntimes.sort()\r\ntotal_time=0\r\nfor i in range(n): \r\n if total_time>times[i]:\r\n times[i]=0\r\n total_time+=times[i]\r\nprint(len(times)-times.count(0))", "n = int(input())\r\n\r\na = sorted(list(map(int, input().split())))\r\n\r\nsm = 0\r\nans = 0\r\n\r\nfor i in range(n):\r\n if sm <= a[i]:\r\n sm += a[i]\r\n ans += 1\r\n\r\nprint(ans)\r\n", "input()\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nsum,satis=0,0\r\nfor i in range(len(l)):\r\n if l[i]>=sum:\r\n satis+=1\r\n sum+=l[i]\r\nprint(satis)", "from sys import stdin;input = lambda: stdin.readline().rstrip('\\r\\n')\r\ninput();r,s=0,0\r\nfor i in sorted(map(int,input().split())):\r\n if s<=i:s+=i;r+=1\r\nprint(r)\r\n", "n = int(input())\r\nori_que = list(map(int, input().split()))\r\nque = sorted(ori_que)\r\nwait = 0\r\ndis = 0\r\nfor i in range(n):\r\n if wait <= que[i]:\r\n wait += que[i]\r\n else:\r\n dis += 1\r\nprint(n - dis)", "n=int(input())\r\ntime=list(map(int,input().split()))\r\ntime.sort()\r\ns=0\r\ncount=0\r\nfor i in range(n):\r\n if time[i]>=s:\r\n s+=time[i]\r\n count+=1\r\nprint(count)", "n = int(input())\r\nif n == 1:\r\n print(1)\r\nelse:\r\n queue = list(map(int, input().split()))\r\n least = min(queue) # 对于最小元问题单独处理\r\n number_least = queue.count(least)\r\n queue2 = set()\r\n queue2.update(queue)\r\n most=max(queue2)\r\n queue = sorted(queue2)\r\n sum_ = 0\r\n ans = 0\r\n if number_least > 1:\r\n sum_ += least\r\n ans += 1\r\n i = 1\r\n while True:\r\n sum_ += least\r\n ans += 1\r\n if sum_ > most:\r\n break\r\n while queue[i] < sum_:\r\n i += 1\r\n least = queue[i]\r\n print(ans)", "n=int(input())\r\ntlis=list(map(int,input().split()))\r\ntlis.sort()\r\n#print(tlis)\r\nk=0\r\nsuum=0\r\nfor i in range(0,len(tlis)):#至少可以保证一个人满意\r\n if tlis[i]>=suum:#-tlis[0]\r\n suum+=tlis[i]\r\n #print(tlis[i],\"tlis[i]\")\r\n #print(suum,\"suum\")\r\n k+=1\r\n else:\r\n #print(tlis[i],\"else\")\r\n continue\r\nprint(k)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nm=[0]\r\nt=len(l)\r\ni=0\r\ns=0\r\nwhile i < t:\r\n if l[i]>=m[-1]:\r\n s+=l[i]\r\n m.append(s)\r\n i+=1\r\nprint(len(m)-1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 24 20:48:13 2023\r\n\r\n@author: tmh\r\n\"\"\"\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\n\r\nsum_time = 0\r\nresult = 0\r\n\r\nfor i in range(n):\r\n if sum_time <= lst[i]:\r\n sum_time += lst[i]\r\n result += 1\r\n\r\nprint(result)\r\n", "n = int(input())\r\ns = input()\r\ns = list(map(int, s.split()))\r\ns.sort()\r\ncount = 0\r\ntime = 0\r\nindex = 0\r\nwhile index < n:\r\n if s[index] >= time:\r\n time += s[index]\r\n count += 1\r\n index += 1\r\nprint(count)\r\n", "num=int(input())\nlisttemp=[int(x) for x in input().split()]\nlisttemp.sort()\noklist=listtemp[0]\nans=1\nfor i in range(1,num):\n if listtemp[i]>=oklist:\n oklist+=listtemp[i]\n ans+=1\nprint(ans)\n\n", "input()\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nsums = 0\r\ncnt = 0\r\nfor i in l:\r\n if i >= sums:\r\n cnt += 1\r\n sums += i\r\nprint(cnt)", "n = int(input())\n\ntimes = list(map(int, input().split()))\n\ntimes.sort()\ntotTime = 0\nres = 0\n\nfor time in times:\n if totTime <= time:\n res+=1\n totTime+=time\n\nprint(res)\n\t \t \t\t\t \t \t \t\t\t \t\t \t", "n=int(input())\r\ntime=list(map(int,input().split()))\r\ntime.sort()\r\ndis=[]\r\nnum=0\r\nsumi=0\r\nsumdis=0\r\nfor i in range(n):\r\n if time[i]>=sumi-sumdis:\r\n num+=1\r\n else:\r\n sumdis+=time[i]\r\n sumi+=time[i]\r\nprint(num)", "n=int(input())\r\nqueue=sorted(list(map(int,input().split())))\r\n\r\ndef Sort(queue):\r\n new_queue=[]\r\n wait=0\r\n \r\n for i in range(n):\r\n if queue[i]>=wait:\r\n new_queue.append(queue[i])\r\n wait+=queue[i]\r\n return len(new_queue) \r\n\r\nprint(Sort(queue))", "n = int(input())\r\nt = list(map(int, input().split()))\r\nt.sort()\r\nA=0\r\nwait = 0\r\nfor ts in t:\r\n if wait <= ts:\r\n A += 1\r\n wait += ts \r\nprint(A) ", "input()\na = list(map(int, input().split()))\nwait = 0\nans = 0\nfor n in sorted(a):\n if n >= wait:\n ans += 1\n wait += n\nprint(ans)\n", "n = int(input())\r\nx = ([int(i) for i in input().split()])\r\nx.sort()\r\n#print(x)\r\nc, s = 0, 0\r\nfor i in range(n):\r\n if s <= x[i]:\r\n c += 1\r\n s += x[i]\r\n #print(s)\r\nprint(c)", "people_num=int(input())\r\npeople_time=[]\r\nfor i in input().split():\r\n people_time.append(int(i))\r\npeople_time.sort()\r\ntest=True\r\nfor j in range(people_num-1):\r\n test_num=0\r\n for k in range(j):\r\n test_num+=people_time[k]\r\n test_num+=people_time[j]\r\n if test_num in people_time:\r\n position=people_time.index(test_num)\r\n people_time[j+1] , people_time[position] = test_num , people_time[j+1]\r\n elif test_num > people_time[-1]:\r\n test=False\r\n break\r\n else:\r\n for p in range(j,people_num):\r\n if people_time[p] > test_num:\r\n people_time[j+1] , people_time[p] = people_time[p] , people_time[j+1]\r\n break\r\nif test:\r\n print(people_num)\r\nelse:\r\n print(j+1)\r\n", "n=int(input())\r\ntimes=list(map(int,input().split()))\r\ntimes.sort()\r\nans=0\r\ntime=0\r\nfor i in range(n):\r\n if times[i]>=time:\r\n ans+=1\r\n time+=times[i]\r\nprint(ans)\r\n", "n = int(input())\r\nqueue = list(map(int,input().split()))\r\nqueue.sort()\r\ntime = 0;num=0\r\nfor i in range (n):\r\n if queue[i]>= time :\r\n num+=1\r\n time+=queue[i]\r\nprint(num)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\ntime = 0\r\nans = 0\r\nfor i in range(n):\r\n if time <= l[i]:\r\n ans += 1\r\n time += l[i]\r\nprint(ans)\r\n", "#梁慧婷 2300012153 生命科学学院\r\nn = int(input())\r\nqueue = sorted(list(map(int,input().split())))\r\ntime = 0\r\npeople = len(queue)\r\nfor i in range(n):\r\n if queue[i]>=time:\r\n time += queue[i]\r\n else:\r\n people -= 1\r\nprint(people)", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nsum = 0\r\nans = 0\r\nfor i in a:\r\n if (i >= sum):\r\n ans += 1\r\n sum += i\r\nprint(ans)", "n = int(input())\r\nqueue = list(map(int,input().split()))\r\nqueue.sort()\r\nqueue1 = [queue[0]]\r\nfor i in queue[1:]:\r\n if sum(queue1) <= i:\r\n queue1.append(i)\r\nprint(len(queue1))", "input()\nr,s=0,0\nfor i in sorted(map(int,input().split())):\n if s<=i:s+=i;r+=1\nprint(r)\n\n\t \t\t\t \t\t\t \t\t\t\t \t \t \t\t\t \t", "from collections import defaultdict, deque, Counter\r\nfrom heapq import heapify, heappop, heappush\r\n\r\ndef I(): return int(input())\r\ndef II(): return map(int, input().split())\r\ndef IL(): return list(map(int, input().split()))\r\ndef SIL(): return sorted(map(int, input().split()))\r\n\r\ndef main():\r\n t = 1\r\n # t = int(input())\r\n for _ in range(t):\r\n run_test_case()\r\n\r\ndef run_test_case():\r\n n = I()\r\n arr = SIL()\r\n result, running_sum = n, 0\r\n for i in range(n):\r\n if running_sum > arr[i]:\r\n result -= 1\r\n continue\r\n running_sum += arr[i]\r\n print(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "n=int(input())\r\nlt=list(map(int,input().split()))\r\nlt.sort()\r\nSum,ans=0,0\r\nfor i in lt:\r\n if i>=Sum:\r\n Sum+=i\r\n ans+=1\r\nprint(ans)", "\r\nn = int(input())\r\nque = list(map(int,input().split()))\r\nque.sort()\r\n\r\nsum = 0\r\nindex = 0\r\ncnt = 0\r\nwhile index<n:\r\n if que[index]>=sum:\r\n cnt+=1\r\n sum+=que[index]\r\n index+=1\r\nprint(cnt)", "n=int(input())\nans=1\nqueue=list(map(int,input().split()))\nqueue.sort()\nsum=queue[0]\nfor i in range(1,len(queue)):\n if queue[i]<sum:\n queue[i]=0\n sum+=queue[i]\nsum=queue[0]\nfor i in range(1,len(queue)):\n if queue[i]>=sum:\n ans+=1\n sum+=queue[i]\nprint(ans)" ]

{"inputs": ["5\n15 2 1 5 3", "15\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "10\n13 2 5 55 21 34 1 8 1 3", "10\n8 256 16 1 2 1 64 4 128 32", "10\n10000 40000 10000 50000 20000 100000 10000 100 30000 500", "1\n1000000000", "15\n9 11 45 86 52 65 35 3 93 7 21 45 15 11 39", "20\n16839799 17525904 91276752 42650694 60106463 12243176 54892123 25142243 16015971 41250998 11150057 6994983 67700784 16562412 82163675 46178521 33914268 91966607 93976858 84100064", "26\n1000 4110030 64221 131521030 942374833 1003 2055015 32110 513757 16440130 263042057 32880256 128439 557559573 16051 8220066 469240078 65760513 256878 790176315 4012 2005 1027508 928528684 8030 805074697"], "outputs": ["4", "2", "6", "10", "6", "1", "6", "5", "21"]}

UNKNOWN

PYTHON3

CODEFORCES

158

91ddbbe8aa042ec08491c7c25d7aba7b

Triangle

At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper he drew three points with integer coordinates, and joined them with segments of straight lines, then he showed the triangle to Peter. Peter said that Bob's triangle is not right-angled, but is almost right-angled: the triangle itself is not right-angled, but it is possible to move one of the points exactly by distance 1 so, that all the coordinates remain integer, and the triangle become right-angled. Bob asks you to help him and find out if Peter tricks him. By the given coordinates of the triangle you should find out if it is right-angled, almost right-angled, or neither of these. The first input line contains 6 space-separated integers *x*1,<=*y*1,<=*x*2,<=*y*2,<=*x*3,<=*y*3 — coordinates of the triangle's vertices. All the coordinates are integer and don't exceed 100 in absolute value. It's guaranteed that the triangle is nondegenerate, i.e. its total area is not zero. If the given triangle is right-angled, output RIGHT, if it is almost right-angled, output ALMOST, and if it is neither of these, output NEITHER. Sample Input 0 0 2 0 0 1 2 3 4 5 6 6 -1 0 2 0 0 1 Sample Output RIGHT NEITHER ALMOST

[ "class point:\n\tdef __init__(self, x=0, y=0):\n\t\tself.x = x\n\t\tself.y = y\n\tdef trans(self, d):\n\t\treturn point(self.x + d[0], self.y + d[1])\ndef cross(a, b, c): return (a.x-c.x) * (b.y-c.y) - (a.y-c.y) * (b.x-c.x)\ndef dot(a, b, c): return (a.x-c.x) * (b.x-c.x) + (a.y-c.y) * (b.y-c.y)\ndef isRight(a, b, c):\n\tif cross(a, b, c) == 0: return False\n\treturn dot(a, b, c) == 0 or dot(a, c, b) == 0 or dot(b, c, a) == 0\nd = ((0, 1), (0, -1), (1, 0), (-1, 0))\ndef solve(a, b, c):\n\tif isRight(a, b, c): return 'RIGHT'\n\tfor i in d:\n\t\tif isRight(a.trans(i), b, c): return 'ALMOST'\n\tfor i in d:\n\t\tif isRight(a, b.trans(i), c): return 'ALMOST'\n\tfor i in d:\n\t\tif isRight(a, b, c.trans(i)): return 'ALMOST'\n\treturn 'NEITHER'\n\nx1, y1, x2, y2, x3, y3 = map(int, input().split())\nprint(solve(point(x1, y1), point(x2, y2), point(x3, y3)))\n\t\t\t\t \t \t\t \t\t\t \t \t\t\t\t \t\t", "def sizeSq(x1,y1,x2,y2):\r\n return (x1-x2)**2 + (y1-y2)**2 \r\n\r\ndef isRight(lst):\r\n ssq = [sizeSq(lst[2*i % 6], lst[(2*i+1) % 6], lst[(2*i+2) % 6], lst[(2*i+3) % 6]) for i in range(3)]\r\n ssq.sort()\r\n return ssq[0] > 0 and ssq[0] + ssq[1] == ssq[2] \r\n\r\nlst = list(map(int, input().split()))\r\n\r\nif isRight(lst):\r\n print(\"RIGHT\")\r\nelse:\r\n for i in range(6):\r\n cpy = lst.copy()\r\n cpy[i] += 1\r\n if isRight(cpy):\r\n print(\"ALMOST\")\r\n break\r\n cpy[i] -= 2\r\n if isRight(cpy):\r\n print(\"ALMOST\")\r\n break\r\n else:\r\n print(\"NEITHER\")", "def dist(x1, y1, x2, y2):\r\n return (x2 - x1) ** 2 + (y2 - y1) ** 2\r\n \r\ndef right_triangle(x1,y1,x2,y2,x3,y3):\r\n first = dist(x1, y1, x2, y2)\r\n second = dist(x1, y1, x3, y3)\r\n third = dist(x2, y2, x3, y3)\r\n mas1 = [first, second, third]\r\n mas1.sort()\r\n if mas1[0] + mas1[1] == mas1[2] and mas1[0] * mas1[1] * mas1[2]:\r\n return True\r\n else:\r\n return False\r\n \r\nx1,y1,x2,y2,x3,y3 = map(int,input().split())\r\nres = right_triangle(x1,y1,x2,y2,x3,y3)\r\n \r\nmas2 = []\r\n \r\nif res :\r\n print('RIGHT')\r\nelse:\r\n mas2.append(right_triangle(x1 + 1, y1, x2, y2, x3, y3))\r\n mas2.append(right_triangle(x1 - 1, y1, x2, y2, x3, y3))\r\n mas2.append(right_triangle(x1, y1 + 1, x2, y2, x3, y3))\r\n mas2.append(right_triangle(x1, y1 - 1, x2, y2, x3, y3))\r\n mas2.append(right_triangle(x1, y1, x2 + 1, y2, x3, y3))\r\n mas2.append(right_triangle(x1, y1, x2 - 1, y2, x3, y3))\r\n mas2.append(right_triangle(x1, y1, x2, y2 + 1, x3, y3))\r\n mas2.append(right_triangle(x1, y1, x2, y2 - 1, x3, y3))\r\n mas2.append(right_triangle(x1, y1, x2, y2, x3 + 1, y3))\r\n mas2.append(right_triangle(x1, y1, x2, y2, x3 - 1, y3))\r\n mas2.append(right_triangle(x1, y1, x2, y2, x3, y3 + 1))\r\n mas2.append(right_triangle(x1, y1, x2, y2, x3, y3 - 1))\r\n if True in mas2: print('ALMOST')\r\n else: print('NEITHER')\n# Fri Oct 16 2020 22:31:04 GMT+0300 (Москва, стандартное время)\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\ndef right(x1,y1,x2,y2,x3,y3):\r\n\tx2-=x1\r\n\ty2-=y1\r\n\tx3-=x1\r\n\ty3-=y1\r\n\tif x2*y3-x3*y2 == 0:\r\n\t\treturn False\r\n\tl1 = x2**2+y2**2\r\n\tl2 = x3**2+y3**2\r\n\tl3 = (x3-x2)**2+(y3-y2)**2\r\n\tif l1+l2 == l3 or l2+l3 == l1 or l1+l3 == l2:\r\n\t\treturn True\r\n\treturn False\r\n\r\nx = list(mints())\r\nif right(*x):\r\n\tprint(\"RIGHT\")\r\n\texit(0)\r\nfor i in range(3):\r\n\tfor dx,dy in (1,0),(-1,0),(0,1),(0,-1):\r\n\t\tx[2*i] += dx\r\n\t\tx[2*i+1] += dy\r\n\t\tif right(*x):\r\n\t\t\tprint(\"ALMOST\")\r\n\t\t\texit(0)\r\n\t\tx[2*i] -= dx\r\n\t\tx[2*i+1] -= dy\r\nprint(\"NEITHER\")\r\n", "def check(a1, a2, b1, b2, c1, c2):\r\n x = (a1 - b1) ** 2 + (a2 - b2) ** 2\r\n y = (b1 - c1) ** 2 + (c2 - b2) ** 2\r\n z = (a1 - c1) **2 + (c2 - a2) ** 2\r\n l1 = [x,y,z]\r\n l1.sort()\r\n if l1[0] + l1[1] == l1[2] and x != 0 and y != 0 and z != 0:\r\n return True\r\n else :\r\n return False\r\n\r\na1, a2, b1, b2, c1, c2 = map(int, input().split())\r\n\r\nif check(a1,a2,b1,b2,c1,c2):\r\n print(\"RIGHT\")\r\nelif check(a1+1,a2,b1,b2,c1,c2) or check(a1-1,a2,b1,b2,c1,c2):\r\n print(\"ALMOST\")\r\nelif check(a1,a2+1,b1,b2,c1,c2) or check(a1,a2-1,b1,b2,c1,c2):\r\n print(\"ALMOST\")\r\nelif check(a1,a2,b1+1,b2,c1,c2) or check(a1,a2,b1-1,b2,c1,c2):\r\n print(\"ALMOST\")\r\nelif check(a1,a2,b1,b2+1,c1,c2) or check(a1,a2,b1,b2-1,c1,c2):\r\n print(\"ALMOST\")\r\nelif check(a1,a2,b1,b2,c1+1,c2) or check(a1,a2,b1,b2,c1-1,c2):\r\n print(\"ALMOST\")\r\nelif check(a1,a2,b1,b2,c1,c2+1) or check(a1,a2,b1,b2,c1,c2-1):\r\n print(\"ALMOST\")\r\nelse :\r\n print(\"NEITHER\")\r\n", "###################################################################\n# .\"-,.__\n# `. `. ,\n# .--' .._,'\"-' `.\n# . .' `'\n# `. / ,'\n# ` '--. ,-\"'\n# `\"` | \\\n# -. \\, |\n# `--Y.' ___.\n# \\ L._, \\\n# _., `. < <\\ _\n# ,' ' `, `. | \\ ( `\n# ../, `. ` | .\\`. \\ \\_\n# ,' ,.. . _.,' ||\\l ) '\".\n# , ,' \\ ,'.-.`-._,' | . _._`.\n# ,' / \\ \\ `' ' `--/ | \\ / / ..\\\n# .' / \\ . |\\__ - _ ,'` ` / / `.`.\n# | ' .. `-...-\" | `-' / / . `.\n# | / |L__ | | / / `. `.\n# , / . . | | / / ` `\n# / / ,. ,`._ `-_ | | _ ,-' / ` \\\n# / . \\\"`_/. `-_ \\_,. ,' +-' `-' _, ..,-. \\`.\n# . ' .-f ,' ` '. \\__.---' _ .' ' \\ \\\n# ' / `.' l .' / \\.. ,_|/ `. ,'` L`\n# |' _.-\"\"` `. \\ _,' ` \\ `.___`.'\"`-. , | | | \\\n# || ,' `. `. ' _,...._ ` | `/ ' | ' .|\n# || ,' `. ;.,.---' ,' `. `.. `-' .-' /_ .' ;_ ||\n# || ' V / / ` | ` ,' ,' '. ! `. ||\n# ||/ _,-------7 ' . | `-' l / `||\n# . | ,' .- ,' || | .-. `. .' ||\n# `' ,' `\".' | | `. '. -.' `'\n# / ,' | |,' \\-.._,.'/'\n# . / . . \\ .''\n# .`. | `. / :_,'.'\n# \\ `...\\ _ ,'-. .' /_.-'\n# `-.__ `, `' . _.>----''. _ __ /\n# .' /\"' | \"' '_\n# /_|.-'\\ ,\". '.'`__'-( \\\n# / ,\"'\"\\,' `/ `-.|\" \n###################################################################\n\nfrom sys import stdin, stdout\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\n \nmod = pow(10, 9) + 7\nmod2 = 998244353\n \ndef inp(): return stdin.readline().strip()\ndef iinp(): return int(inp())\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(*var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return map(int, inp().split())\ndef smp(): return map(str, inp().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(m, val) for j in range(n)]\ndef remadd(x, y): return 1 if x%y else 0\ndef ceil(a,b): return (a+b-1)//b\n \ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n \ndef chk(l):\n a = (l[0]-l[2])**2+(l[1]-l[3])**2\n b = (l[4]-l[2])**2+(l[3]-l[5])**2\n c = (l[0]-l[4])**2+(l[1]-l[5])**2\n ml = [a, b, c]\n ml.sort()\n return ml[0]+ml[1]==ml[2] and all(ml)\n\nl = lmp()\nif chk(l):\n print(\"RIGHT\")\nelse:\n flg=False\n for i in range(3):\n for j in range(4):\n jx = [0, 1, 0, -1]\n jy = [1, 0, -1, 0]\n k = l.copy()\n k[2*i] += jx[j]\n k[2*i+1] += jy[j]\n if(chk(k)):\n flg = True\n break\n if flg: break\n print(\"ALMOST\" if flg else \"NEITHER\")\n", "def right(p):\r\n a = (p[0] - p[2]) ** 2 + (p[1] - p[3]) ** 2\r\n b = (p[0] - p[4]) ** 2 + (p[1] - p[5]) ** 2\r\n c = (p[2] - p[4]) ** 2 + (p[3] - p[5]) ** 2\r\n return a and b and c and (a + b == c or a + c == b or b + c == a)\r\n\r\n\r\ndef solve(p):\r\n if right(p):\r\n return 'RIGHT'\r\n for i in range(6):\r\n p[i] -= 1\r\n if right(p):\r\n return 'ALMOST'\r\n p[i] += 2\r\n if right(p):\r\n return 'ALMOST'\r\n p[i] -= 1\r\n return 'NEITHER'\r\n\r\n\r\nprint(solve(list(map(int, input().split()))))", "import math\n\nepsilon = 10**-9\ndx = [1, 0, -1, 0]\ndy = [0, 1, 0, -1]\n\n\ndef is_right(ps):\n fator1 = ps[0][0] - ps[1][0]\n fator11 = ps[0][1] - ps[1][1]\n\n fator2 = ps[0][0] - ps[2][0]\n fator22 = ps[0][1] - ps[2][1]\n\n fator3 = ps[1][0] - ps[2][0]\n fator33 = ps[1][1] - ps[2][1]\n\n l1 = math.sqrt(fator1 * fator1 + fator11 * fator11)\n l2 = math.sqrt(fator2 * fator2 + fator22 * fator22)\n l3 = math.sqrt(fator3 * fator3 + fator33 * fator33)\n\n if (((l1 + l2 - l3) < epsilon) \n or ((l1 + l3 - l2) < epsilon) \n or ((l3 + l2 - l1) < epsilon)): \n return False\n\n sl1, sl2, sl3= l1 * l1, l2 * l2, l3 * l3 \n \n if (abs(sl1 + sl2 - sl3) < epsilon) or (abs(sl3 + sl2 - sl1) < epsilon) or (abs(sl1 + sl3 - sl2) < epsilon): \n return True\n\n return False\n\n\ndef is_almost(ps):\n pi = []\n for i in range(0, 3):\n for k in range(0, 4):\n pi = ((ps[i][0] + dx[k], ps[i][1] + dy[k]), ps[(i + 1) % 3], ps[(i + 2) % 3])\n if (is_right(pi)):\n return True\n\n return False\n\n \n\nps = []\na,b,c,d,e,f = map(int, input().split())\nps.append((a,b))\nps.append((c,d))\nps.append((e,f))\nif (is_right(ps)):\n print('RIGHT')\nelif is_almost(ps):\n print('ALMOST')\nelse:\n print('NEITHER')\n\n\t\t \t \t \t \t\t \t\t\t \t\t\t \t\t\t \t", "#------------------------template--------------------------#\r\nimport os\r\nimport sys\r\nfrom math import *\r\nfrom collections import *\r\nfrom fractions import *\r\nfrom bisect import *\r\nfrom io import BytesIO, IOBase\r\ndef vsInput():\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef value():return tuple(map(int,input().split()))\r\ndef array():return [int(i) for i in input().split()]\r\ndef Int():return int(input())\r\ndef Str():return input()\r\ndef arrayS():return [i for i in input().split()]\r\n\r\n#-------------------------code---------------------------#\r\n#vsInput()\r\n\r\ndef dist(x1, y1, x2, y2):\r\n return (x1 - x2)** 2 + (y1 - y2)** 2\r\ndef check(x1,y1,x2,y2,x3,y3):\r\n #print(x1,y1,x2,y2,x3,y3,p)\r\n a = dist(x1, y1, x2, y2)\r\n b = dist(x1, y1, x3, y3)\r\n c = dist(x3, y3, x2, y2)\r\n if a == 0 or b == 0 or c == 0:\r\n return False\r\n maxm = max(a, b, c)\r\n if maxm == a + b + c - maxm:\r\n return True\r\n return False\r\n \r\n\r\nx1,y1,x2,y2,x3,y3=value()\r\np1=[x1,y1]\r\np2=[x2,y2]\r\np3=[x3,y3]\r\npoints=[p1,p2,p3]\r\nif(check(points[0][0],points[0][1],points[1][0],points[1][1],points[2][0],points[2][1])):\r\n print(\"RIGHT\")\r\n exit()\r\nfor p in range(3):\r\n for c in range(2):\r\n points[p][c]+=1\r\n if(check(points[0][0],points[0][1],points[1][0],points[1][1],points[2][0],points[2][1])):\r\n print(\"ALMOST\")\r\n exit()\r\n points[p][c]-=2\r\n if(check(points[0][0],points[0][1],points[1][0],points[1][1],points[2][0],points[2][1])):\r\n print(\"ALMOST\")\r\n exit()\r\n points[p][c]+=1\r\nprint(\"NEITHER\")\r\n \r\n\r\n", "# -*- coding: utf-8 -*-\r\n\r\n'''\r\nNome: Ivan Rosa Soares Júnior\r\nMatrícula: 2015083590\r\nSolução: Se um triângulo é retângulo, seus lados satisfazem a relação do teorema\r\nde pitágoras. Utilizei esse fato para realizar o teste.\r\n\r\nTambém realizei o teste somando e subtraindo 1 de cada uma das coordenadas\r\n(para cumprir a parte de distância = 1 da especificação para o \"quase\").\r\n'''\r\n\r\n\r\ndef check_right_triangle(coords):\r\n x1, y1, x2, y2, x3, y3 = coords\r\n\r\n sl12 = (x1 - x2)**2 + (y1 - y2)**2\r\n sl13 = (x1 - x3)**2 + (y1 - y3)**2\r\n sl23 = (x2 - x3)**2 + (y2 - y3)**2\r\n\r\n return sl12 != 0 and sl13 != 0 and sl23 != 0 and (\r\n sl12 == sl13 + sl23 or\r\n sl13 == sl12 + sl23 or\r\n sl23 == sl12 + sl13\r\n )\r\n\r\n\r\ndef main():\r\n coords = list(map(int, input().strip().split()))\r\n\r\n if check_right_triangle(coords):\r\n print('RIGHT')\r\n return\r\n\r\n for i in range(6):\r\n ori = coords[i]\r\n\r\n coords[i] = ori + 1\r\n if check_right_triangle(coords):\r\n print('ALMOST')\r\n return\r\n\r\n coords[i] = ori - 1\r\n if check_right_triangle(coords):\r\n print('ALMOST')\r\n return\r\n\r\n coords[i] = ori\r\n\r\n print('NEITHER')\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "l = list(map(int,input().split()))\r\n\r\nx1 = l[0]\r\ny1 = l[1]\r\nx2 = l[2]\r\ny2 = l[3]\r\nx3 = l[4]\r\ny3 = l[5]\r\n\r\n\r\ndef rightAngled(x1,y1,x2,y2,x3,y3,fl):\r\n \r\n cx = [0, 1, 0, -1]\r\n cy = [1, 0, -1, 0]\r\n \r\n a2,b2,c2 = distances(x1,y1,x2,y2,x3,y3) \r\n \r\n if (a2!= 0 and b2!=0 and c2!=0):\r\n if (a2 + b2 == c2 or b2 + c2 == a2 or a2 + c2 == b2):\r\n print(\"RIGHT\")\r\n fl = 0\r\n return\r\n \r\n else: \r\n for i in range(4):\r\n x = x1 + cx[i]\r\n y = y1 + cy[i]\r\n a2,b2,c2 = distances(x,y,x2,y2,x3,y3)\r\n if (a2!= 0 and b2!=0 and c2!=0):\r\n if (a2 + b2 == c2 or b2 + c2 == a2 or a2 + c2 == b2):\r\n print(\"ALMOST\")\r\n fl = 0\r\n return\r\n \r\n for i in range(4):\r\n x = x2 + cx[i]\r\n y = y2 + cy[i]\r\n a2,b2,c2 = distances(x1,y1,x,y,x3,y3)\r\n if (a2!= 0 and b2!=0 and c2!=0):\r\n if (a2 + b2 == c2 or b2 + c2 == a2 or a2 + c2 == b2):\r\n print(\"ALMOST\")\r\n fl = 0\r\n return\r\n \r\n for i in range(4):\r\n x = x3 + cx[i]\r\n y = y3 + cy[i]\r\n a2,b2,c2 = distances(x1,y1,x2,y2,x,y)\r\n if (a2!= 0 and b2!=0 and c2!=0):\r\n if (a2 + b2 == c2 or b2 + c2 == a2 or a2 + c2 == b2):\r\n print(\"ALMOST\")\r\n fl = 0\r\n return\r\n\r\n if (fl == 1):\r\n print(\"NEITHER\")\r\n return\r\n\r\ndef distances(x1, y1, x2, y2, x3, y3):\r\n a2 = (x2 - x1)**2 + (y2 - y1)**2\r\n b2 = (x3 - x2)**2 + (y3 - y2)**2\r\n c2 = (x1 - x3)**2 + (y1 - y3)**2\r\n return a2, b2, c2\r\n\r\n\r\nfl = 1\r\nrightAngled(x1, y1, x2, y2, x3, y3, fl)\r\n\r\n", "def if_right(x1, y1, x2, y2, x3, y3):\r\n a = ((x1 - x2) * (x1 - x2)) + \\\r\n ((y1 - y2) * (y1 - y2))\r\n b = ((x1 - x3) * (x1 - x3)) + \\\r\n ((y1 - y3) * (y1 - y3))\r\n c = ((x2 - x3) * (x2 - x3)) + \\\r\n ((y2 - y3) * (y2 - y3))\r\n if ((a == (b + c) and a != 0 and b != 0 and c != 0) or (b == (a + c) and b != 0 and a != 0 and c != 0) or (c == (a + b) and c != 0 and b != 0 and a != 0)):\r\n return 1\r\n\r\nx1, y1, x2, y2, x3, y3 = map(int,input().split())\r\n\r\nif (if_right(x1, y1, x2, y2, x3, y3)):\r\n print(\"RIGHT\") #if it is exactly right-angle triangle\r\nelif(if_right(x1+1, y1, x2, y2, x3, y3) or if_right(x1-1, y1, x2, y2, x3, y3) or if_right(x1, y1+1, x2, y2, x3, y3) or\r\n if_right(x1, y1-1, x2, y2, x3, y3) or if_right(x1, y1, x2+1, y2, x3, y3) or if_right(x1, y1, x2-1, y2, x3, y3) or\r\n if_right(x1, y1, x2, y2+1, x3, y3) or if_right(x1, y1, x2, y2-1, x3, y3) or if_right(x1, y1, x2, y2, x3+1, y3) or\r\n if_right(x1, y1, x2, y2, x3-1, y3) or if_right(x1, y1, x2, y2, x3, y3+1) or if_right(x1, y1, x2, y2, x3, y3-1)):\r\n print(\"ALMOST\") #if it is necessary to change one coordinate with 1 to get right-angle triangle\r\nelse:\r\n print(\"NEITHER\") #if it is not a right-angle triangle", "import sys\r\n\r\n# sys.stdin = open(\"3.in\", \"r\")\r\n\r\ncoor = list(map(int, input().split()))\r\n\r\ndef f_equal(a, b):\r\n return abs(a-b)<0.001\r\n\r\ndef is_right(coor):\r\n x1, y1, x2, y2, x3, y3 = coor\r\n a2 = ((x1-x2)**2 + (y1-y2)**2)\r\n b2 = ((x1-x3)**2 + (y1-y3)**2)\r\n c2 = ((x2-x3)**2 + (y2-y3)**2)\r\n\r\n a = a2**0.5\r\n b = b2**0.5\r\n c = c2**0.5\r\n\r\n if f_equal(a+b, c) or f_equal(a+c, b) or f_equal(b+c, a):\r\n return False\r\n \r\n if a2 + b2 == c2 or a2 + c2 == b2 or b2 + c2 == a2:\r\n return True\r\n else:\r\n return False\r\n\r\ndef is_almost(coor):\r\n for i in range(len(coor)):\r\n if is_right(coor[:i] + [coor[i]-1] + coor[i+1:]):\r\n return True\r\n elif is_right(coor[:i] + [coor[i]+1] + coor[i+1:]):\r\n return True\r\n \r\n return False\r\n\r\n\r\nif is_right(coor):\r\n print(\"RIGHT\")\r\nelif is_almost(coor):\r\n print(\"ALMOST\")\r\nelse:\r\n print(\"NEITHER\")\r\n ", "uASei = range\r\nuASeU = print\r\nuASeg = list\r\nuASeo = map\r\nuASey = int\r\nuASeH = input\r\n\r\n\r\ndef uASef(p):\r\n a = (p[0]-p[2])**2+(p[1]-p[3])**2\r\n b = (p[0]-p[4])**2+(p[1]-p[5])**2\r\n c = (p[2]-p[4])**2+(p[3]-p[5])**2\r\n return a and b and c and (a + b == c or a + c == b or b + c == a)\r\n\r\n\r\ndef uASex(p):\r\n if uASef(p):\r\n return 'RIGHT'\r\n for i in uASei(6):\r\n p[i] -= 1\r\n if uASef(p):\r\n return 'ALMOST'\r\n p[i] += 2\r\n if uASef(p):\r\n return 'ALMOST'\r\n p[i] -= 1\r\n return 'NEITHER'\r\n\r\n\r\nuASeU(uASex(uASeg(uASeo(uASey, uASeH().split()))))\r\n", "s = list(map(int, input().split()))\ndef kc2(a,b,c,d):\n return (a-c)**2 + (b-d)**2\ndef r(s):\n a,b,c,d,e,f = s\n AB = kc2(a,b,c,d)\n BC = kc2(c,d,e,f)\n CA = kc2(e,f,a,b)\n x = max(AB, BC, CA)\n return 2*x == AB + BC + CA and AB and BC and CA\nif r(s): print('RIGHT'); exit()\nfor i in range(6):\n s[i]-=1\n if r(s): print('ALMOST'); exit()\n s[i]+=2\n if r(s): print('ALMOST'); exit()\n s[i]-=1\nprint('NEITHER')\n\n \t \t\t\t\t \t \t \t \t \t", "import sys\r\nfrom array import array # noqa: F401\r\nfrom itertools import permutations\r\nfrom copy import deepcopy\r\nfrom math import hypot, sqrt\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\neps = 1e-9\r\n\r\n\r\ndef solve(points):\r\n for ps in permutations(points):\r\n a, b, c = hypot(ps[0][0] - ps[1][0], ps[0][1] - ps[1][1]), hypot(ps[1][0] - ps[2][0], ps[1][1] - ps[2][1]), hypot(ps[0][0] - ps[2][0], ps[0][1] - ps[2][1])\r\n s = (a + b + c) / 2\r\n S = sqrt(s * (s - a) * (s - b) * (s - c))\r\n if abs(a**2 + b**2 - c**2) < eps and S > eps:\r\n return True\r\n return False\r\n\r\n\r\na = list(map(int, input().split()))\r\npts = [[a[0], a[1]], [a[2], a[3]], [a[4], a[5]]]\r\n\r\nif solve(pts):\r\n print('RIGHT')\r\nelse:\r\n for i in range(3):\r\n for j in range(2):\r\n for k in range(-1, 2):\r\n _pts = deepcopy(pts)\r\n _pts[i][j] += k\r\n if solve(_pts):\r\n print('ALMOST')\r\n exit()\r\n print('NEITHER')\r\n", "\r\ndef check_right_triangle(coords):\r\n x1, y1, x2, y2, x3, y3 = coords\r\n#finding out the distances in order to get the sides of our triangle\r\n s12 = (x1 - x2)**2 + (y1 - y2)**2\r\n s13 = (x1 - x3)**2 + (y1 - y3)**2\r\n s23 = (x2 - x3)**2 + (y2 - y3)**2\r\n#no degenrate traingles will pass xD\r\n return s12 != 0 and s13 != 0 and s23 != 0 and (\r\n s12 == s13 + s23 or\r\n s13 == s12 + s23 or\r\n s23 == s12 + s13\r\n )\r\n\r\ndef answer():\r\n if check_right_triangle(coords):\r\n print('RIGHT')\r\n return\r\n\r\n for i in range(6):\r\n p = coords[i]\r\n#here is the test for the \"almost\" right-angle triangle\r\n#where we check every coordinate changed by adding 1\r\n coords[i] = p + 1\r\n if check_right_triangle(coords):\r\n print('ALMOST')\r\n return\r\n#here is the test for the \"almost\" right-angle triangle\r\n#where we check every coordinate changed by subtracting 1\r\n coords[i] = p - 1\r\n if check_right_triangle(coords):\r\n print('ALMOST')\r\n return\r\n\r\n coords[i] = p\r\n\r\n print('NEITHER')\r\ncoords = list(map(int, input().strip().split()))\r\nanswer()\r\n", "def is_right(coords):\r\n\tx1, y1, x2, y2, x3, y3 = coords\r\n\r\n\tsl12 = (x1 - x2)**2 + (y1 - y2)**2\r\n\tsl13 = (x1 - x3)**2 + (y1 - y3)**2\r\n\tsl23 = (x2 - x3)**2 + (y2 - y3)**2\r\n\r\n\treturn sl12 != 0 and sl13 != 0 and sl23 != 0 and (\r\n\t\tsl12 == sl13 + sl23 or\r\n\t\tsl13 == sl12 + sl23 or\r\n\t\tsl23 == sl12 + sl13\r\n\t)\r\n\r\n\r\ndef main():\r\n\tcoords = list(map(int, input().strip().split()))\r\n\r\n\tif is_right(coords):\r\n\t\tprint('RIGHT')\r\n\t\treturn\r\n\r\n\tfor i in range(6):\r\n\t\tori = coords[i]\r\n\r\n\t\tcoords[i] = ori + 1\r\n\t\tif is_right(coords):\r\n\t\t\tprint('ALMOST')\r\n\t\t\treturn\r\n\r\n\t\tcoords[i] = ori - 1\r\n\t\tif is_right(coords):\r\n\t\t\tprint('ALMOST')\r\n\t\t\treturn\r\n\r\n\t\tcoords[i] = ori\r\n\r\n\tprint('NEITHER')\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "#18A - Triangle\r\n#Function to calculate the sides of the triangle\r\n#and if they are actually sides of a right-angled triangle: the sum of 2 sides !> 3rd side\r\ndef sides(p): #p - point coordinates\r\n a = (p[0] - p[2]) ** 2 + (p[1] - p[3]) ** 2\r\n b = (p[0] - p[4]) ** 2 + (p[1] - p[5]) ** 2\r\n c = (p[2] - p[4]) ** 2 + (p[3] - p[5]) ** 2\r\n return a and b and c and (a + b == c or a + c == b or b + c == a)\r\n#Function that says if it's a right-angled triangle, based on the outcome of the previous function\r\ndef assertion(p):\r\n if sides(p):\r\n return 'RIGHT'\r\n for i in range(6):\r\n p[i] -= 1\r\n if sides(p):\r\n return 'ALMOST'\r\n p[i] += 2\r\n if sides(p):\r\n return 'ALMOST'\r\n p[i] -= 1\r\n return 'NEITHER'\r\n#We print the decision:\r\nprint(assertion(list(map(int, input().split()))))", "#function checks if coordinates of vertices belong to the right-angle triangle\r\ndef triangle(x1, y1, x2, y2, x3, y3):\r\n a2 = (x1 - x2)**2+(y1-y2)**2 #first side^2\r\n b2 = (x1 - x3)**2+(y1-y3)**2 #second side^2\r\n c2 = (x3 - x2)**2+(y3-y2)**2 #third side^2\r\n return ((a2+b2 == c2 or c2+b2 == a2 or a2+c2 == b2) and (a2*b2*c2 != 0)) #if the sum of squares of legs is equal to the hypotenuse^2, then it is a right-angle triangle\r\n\r\nx1, y1, x2, y2, x3, y3 = map(int,input().split())\r\n\r\nif ( triangle(x1, y1, x2, y2, x3, y3)):\r\n print(\"RIGHT\") #if it is exactly right-angle triangle\r\nelif( triangle(x1+1, y1, x2, y2, x3, y3) or triangle(x1-1, y1, x2, y2, x3, y3) or triangle(x1, y1+1, x2, y2, x3, y3) or triangle(x1, y1-1, x2, y2, x3, y3) or triangle(x1, y1, x2+1, y2, x3, y3) or triangle(x1, y1, x2-1, y2, x3, y3) or triangle(x1, y1, x2, y2+1, x3, y3) or triangle(x1, y1, x2, y2-1, x3, y3) or triangle(x1, y1, x2, y2, x3+1, y3) or triangle(x1, y1, x2, y2, x3-1, y3) or triangle(x1, y1, x2, y2, x3, y3+1) or triangle(x1, y1, x2, y2, x3, y3-1)):\r\n print(\"ALMOST\") #if it is necessary to change one coordinate with 1 to get right-angle triangle\r\nelse:\r\n print(\"NEITHER\") #if it is not a right-angle triangle", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef chk(c) -> bool:\r\n ch = sorted([(c[4] - c[2]) * (c[4] - c[2]) + (c[5] - c[3]) * (c[5] - c[3]), (c[4] - c[0]) * (c[4] - c[0]) + (c[5] - c[1]) * (c[5] - c[1]), (c[2] - c[0]) * (c[2] - c[0]) + (c[3] - c[1]) * (c[3] - c[1])])\r\n return ch[0] > 0 and ch[2] == ch[0] + ch[1]\r\n\r\n\r\ns, res = list(map(int, input().split())), 'NEITHER'\r\nif chk(s): res = 'RIGHT'\r\nelse:\r\n for i in range(6):\r\n s[i] += 1\r\n if chk(s): res = 'ALMOST'; break\r\n s[i] -= 2\r\n if chk(s): res = 'ALMOST'; break\r\n s[i] += 1\r\nprint(res)", "def triangle_check(x1, y1, x2, y2, x3, y3):\r\n if (x1 == x2 and y1 == y2) or (x3 == x2 and y3 == y2) or (x1 == x3 and y1 == y3):\r\n return False\r\n if ((x1-x2)*(x3-x2) == -(y1-y2)*(y3-y2)) or ((x2-x1)*(x3-x1) == -(y2-y1)*(y3-y1)) or ((x1-x3)*(x2-x3) == -(y1-y3)*(y2-y3)):\r\n return True\r\n else:\r\n return False\r\n\r\n\r\n# manual check.\r\nx1, y1, x2, y2, x3, y3 = map(int, input().split())\r\nif triangle_check(x1, y1, x2, y2, x3, y3):\r\n print('RIGHT')\r\nelse:\r\n if triangle_check(x1 - 1, y1, x2, y2, x3, y3) or triangle_check(x1 + 1, y1, x2, y2, x3, y3) or triangle_check(x1, y1 - 1, x2, y2, x3, y3) or triangle_check(x1, y1 + 1, x2, y2, x3, y3) or triangle_check(x1, y1, x2 - 1, y2, x3, y3) or triangle_check(x1, y1, x2 + 1, y2, x3, y3) or triangle_check(x1, y1, x2, y2 - 1, x3, y3) or triangle_check(x1, y1, x2, y2 + 1, x3, y3) or triangle_check(x1, y1, x2, y2, x3 - 1, y3) or triangle_check(x1, y1, x2, y2, x3 + 1, y3) or triangle_check(x1, y1, x2, y2, x3, y3 + 1) or triangle_check(x1, y1, x2, y2, x3, y3 - 1):\r\n print('ALMOST')\r\n else:\r\n print('NEITHER')", "dx=(0, 0, -1, 1)\r\ndy=(1, -1, 0, 0)\r\ndef isright(x1, y1, x2, y2, x3, y3):\r\n\thi1=x2-x1\r\n\thi2=y2-y1\r\n\thi3=x3-x1\r\n\thi4=y3-y1\r\n\tif (x1==x2 and y1==y2) or (x1==x3 and y1==y3) or (x2==x3 and y2==y3):\r\n\t\treturn False\r\n\tif (hi1*hi3)+(hi2*hi4)==0:\r\n\t\treturn True\r\n\thi1, hi2, hi3, hi4=x1-x2, y1-y2, x3-x2, y3-y2\r\n\tif (hi1*hi3)+(hi2*hi4)==0:\r\n\t\treturn True\r\n\thi1, hi2, hi3, hi4=x2-x3, y2-y3, x1-x3, y1-y3\r\n\tif (hi1*hi3)+(hi2*hi4)==0:\r\n\t\treturn True\r\n\treturn False\r\nx1, y1, x2, y2, x3, y3=map(int, input().split())\r\nif isright(x1, y1, x2, y2, x3, y3):\r\n\tprint(\"RIGHT\")\r\n\texit()\r\nfor i in range(4):\r\n\tif isright(x1+dx[i], y1+dy[i], x2, y2, x3, y3):\r\n\t\tprint(\"ALMOST\")\r\n\t\texit()\r\n\tif isright(x1, y1, x2+dx[i], y2+dy[i], x3, y3):\r\n\t\tprint(\"ALMOST\")\r\n\t\texit()\r\n\tif isright(x1, y1, x2, y2, x3+dx[i], y3+dy[i]):\r\n\t\tprint(\"ALMOST\")\r\n\t\texit()\r\nprint(\"NEITHER\")", "\r\ndef is_right(l):\r\n k = []\r\n k.append((l[0]-l[2])**2 + (l[1]-l[3])**2)\r\n k.append((l[4]-l[2])**2 + (l[5]-l[3])**2)\r\n k.append((l[0]-l[4])**2 + (l[1]-l[5])**2)\r\n k.sort()\r\n if k[0]==0:\r\n return False\r\n return k[0]+k[1]==k[2]\r\n\r\n\r\ndef is_almost(l):\r\n for i in range(6):\r\n l[i]+=1\r\n res = is_right(l)\r\n l[i]-=1\r\n if res:\r\n return True\r\n for i in range(6):\r\n l[i]-=1\r\n res = is_right(l)\r\n l[i]+=1\r\n if res:\r\n return True\r\n return False\r\n\r\n\r\n\r\ns = map(int,input().split())\r\nlis = []\r\nfor k in s:\r\n lis.append(k)\r\n\r\nif is_right(lis):\r\n print(\"RIGHT\")\r\nelif is_almost(lis):\r\n print(\"ALMOST\")\r\nelse:\r\n print(\"NEITHER\")", "def triangle(point):\r\n a=(point[0]-point[2])**2+(point[1]-point[3])**2\r\n b=(point[0]-point[4])**2+(point[1]-point[5])**2\r\n c=(point[2]-point[4])**2+(point[3]-point[5])**2\r\n return a and b and c and (a+b == c or a+c == b or b+c == a)\r\ndef main():\r\n\tpoint = list(map(int, input().strip().split()))\r\n \r\n\tif triangle(point):\r\n\t\tprint('RIGHT')\r\n\t\treturn\r\n \r\n\tfor i in range(6):\r\n\t\tp = point[i]\r\n \r\n\t\tpoint[i] = p + 1\r\n\t\tif triangle(point):\r\n\t\t\tprint('ALMOST')\r\n\t\t\treturn\r\n \r\n\t\tpoint[i] = p - 1\r\n\t\tif triangle(point):\r\n\t\t\tprint('ALMOST')\r\n\t\t\treturn\r\n \r\n\t\tpoint[i] = p\r\n \r\n\tprint('NEITHER')\r\nif __name__ == '__main__':\r\n\tmain()", "\n\n\nx1,y1,x2,y2,x3,y3 = map(int,input().split())\n\na = (x1 - x2)**2 + (y2 - y1)**2\n\nb = (x1 - x3)**2 + (y3 - y1)**2\n\nc = (x2 - x3)**2 + (y3 - y2)**2\n\na,b,c = sorted([a,b,c])\ntemp = 0\nif abs(a + b - c) == 0:\n temp = 1\n print('RIGHT')\n\nif temp == 0:\n halo = x1\n x1+=1\n a = (x1 - x2)**2 + (y2 - y1)**2\n\n b = (x1 - x3)**2 + (y3 - y1)**2\n\n c = (x2 - x3)**2 + (y3 - y2)**2\n x1 = halo\n a,b,c = sorted([a,b,c])\n\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n\n print('ALMOST')\n\nif temp == 0:\n halo = y1\n y1+=1\n a = (x1 - x2)**2 + (y2 - y1)**2\n\n b = (x1 - x3)**2 + (y3 - y1)**2\n\n c = (x2 - x3)**2 + (y3 - y2)**2\n y1 = halo\n a,b,c = sorted([a,b,c])\n\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n\n print('ALMOST')\n\nif temp == 0:\n halo = x2\n x2+=1\n a = (x1 - x2)**2 + (y2 - y1)**2\n\n b = (x1 - x3)**2 + (y3 - y1)**2\n\n c = (x2 - x3)**2 + (y3 - y2)**2\n\n a,b,c = sorted([a,b,c])\n x2 = halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\nif temp == 0:\n halo = y2\n y2+=1\n a = (x1 - x2)**2 + (y2 - y1)**2\n\n b = (x1 - x3)**2 + (y3 - y1)**2\n\n c = (x2 - x3)**2 + (y3 - y2)**2\n\n a,b,c = sorted([a,b,c])\n y2 = halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\n\nif temp == 0:\n halo = x3\n x3+=1\n a = (x1 - x2)**2 + (y2 - y1)**2\n\n b = (x1 - x3)**2 + (y3 - y1)**2\n\n c = (x2 - x3)**2 + (y3 - y2)**2\n\n a,b,c = sorted([a,b,c])\n x3 = halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\nif temp == 0:\n halo = y3\n y3+=1\n a = (x1 - x2)**2 + (y2 - y1)**2\n\n b = (x1 - x3)**2 + (y3 - y1)**2\n\n c = (x2 - x3)**2 + (y3 - y2)**2\n\n a,b,c = sorted([a,b,c])\n y3= halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\n\n\n\n\nif temp == 0:\n halo = x1\n x1-=1\n a = (x1 - x2)**2 + (y2 - y1)**2\n\n b = (x1 - x3)**2 + (y3 - y1)**2\n\n c = (x2 - x3)**2 + (y3 - y2)**2\n x1 = halo\n a,b,c = sorted([a,b,c])\n\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n\n print('ALMOST')\n\nif temp == 0:\n halo = y1\n y1-=1\n a = (x1 - x2)**2 + (y2 - y1)**2\n\n b = (x1 - x3)**2 + (y3 - y1)**2\n\n c = (x2 - x3)**2 + (y3 - y2)**2\n y1 = halo\n a,b,c = sorted([a,b,c])\n\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n\n print('ALMOST')\n\nif temp == 0:\n halo = x2\n x2-=1\n a = (x1 - x2)**2 + (y2 - y1)**2\n\n b = (x1 - x3)**2 + (y3 - y1)**2\n\n c = (x2 - x3)**2 + (y3 - y2)**2\n\n a,b,c = sorted([a,b,c])\n x2 = halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\nif temp == 0:\n halo = y2\n y2-=1\n a = (x1 - x2)**2 + (y2 - y1)**2\n\n b = (x1 - x3)**2 + (y3 - y1)**2\n\n c = (x2 - x3)**2 + (y3 - y2)**2\n\n a,b,c = sorted([a,b,c])\n y2 = halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\n\nif temp == 0:\n halo = x3\n x3-=1\n a = (x1 - x2)**2 + (y2 - y1)**2\n\n b = (x1 - x3)**2 + (y3 - y1)**2\n\n c = (x2 - x3)**2 + (y3 - y2)**2\n\n a,b,c = sorted([a,b,c])\n x3 = halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\nif temp == 0:\n halo = y3\n y3-=1\n a = (x1 - x2)**2 + (y2 - y1)**2\n\n b = (x1 - x3)**2 + (y3 - y1)**2\n\n c = (x2 - x3)**2 + (y3 - y2)**2\n\n a,b,c = sorted([a,b,c])\n y3= halo\n if abs(a + b - c) == 0 and a!=0 and b!=0 and c!=0:\n temp = 1\n print('ALMOST')\n\n\nif temp == 0:\n print('NEITHER')\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef check(A):\r\n a = (A[0]-A[2])**2 + (A[1]-A[3])**2\r\n b = (A[0]-A[4])**2 + (A[1]-A[5])**2\r\n c = (A[2]-A[4])**2 + (A[3]-A[5])**2\r\n \r\n if a>0 and b>0 and c>0 and (a+b==c or a+c==b or a==b+c):\r\n return True\r\n return False\r\n\r\nA = list(map(int, input().split()))\r\nN = 3\r\nif check(A):\r\n exit(print('RIGHT'))\r\n \r\nfor i in range(len(A)):\r\n B = A[::]\r\n B[i]+=1\r\n if check(B):\r\n #print(B)\r\n exit(print('ALMOST'))\r\n B = A[::]\r\n B[i]-=1\r\n if check(B):\r\n #print(B)\r\n exit(print('ALMOST'))\r\n \r\nprint('NEITHER')\r\n\r\n", "# LUOGU_RID: 116504355\ndef is_right_triangle(x1, y1, x2, y2, x3, y3):\r\n if (x1 - x2) * (y1 - y3) == (x1 - x3) * (y1 - y2):\r\n return False\r\n\r\n a2 = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)\r\n b2 = (x1 - x3) * (x1 - x3) + (y1 - y3) * (y1 - y3)\r\n c2 = (x2 - x3) * (x2 - x3) + (y2 - y3) * (y2 - y3)\r\n\r\n if a2 + b2 == c2 or a2 + c2 == b2 or b2 + c2 == a2:\r\n return True\r\n\r\n return False\r\n\r\n\r\nx1, y1, x2, y2, x3, y3 = map(int, input().split())\r\n\r\nif is_right_triangle(x1, y1, x2, y2, x3, y3):\r\n print(\"RIGHT\")\r\nelif any([\r\n is_right_triangle(x1 + 1, y1, x2, y2, x3, y3),\r\n is_right_triangle(x1, y1 + 1, x2, y2, x3, y3),\r\n is_right_triangle(x1, y1, x2 + 1, y2, x3, y3),\r\n is_right_triangle(x1, y1, x2, y2 + 1, x3, y3),\r\n is_right_triangle(x1, y1, x2, y2, x3 + 1, y3),\r\n is_right_triangle(x1, y1, x2, y2, x3, y3 + 1),\r\n is_right_triangle(x1 - 1, y1, x2, y2, x3, y3),\r\n is_right_triangle(x1, y1 - 1, x2, y2, x3, y3),\r\n is_right_triangle(x1, y1, x2 - 1, y2, x3, y3),\r\n is_right_triangle(x1, y1, x2, y2 - 1, x3, y3),\r\n is_right_triangle(x1, y1, x2, y2, x3 - 1, y3),\r\n is_right_triangle(x1, y1, x2, y2, x3, y3 - 1)\r\n]):\r\n print(\"ALMOST\")\r\nelse:\r\n print(\"NEITHER\")\r\n", "a,b,c,d,e,f=map(int,input().split())\r\n\r\ndef right(a,b,c,d,e,f):\r\n if (a,b)==(c,d):\r\n return False\r\n if (a,b)==(e,f):\r\n return False\r\n if (c,d)==(e,f):\r\n return False\r\n\r\n if (c-a)*(e-a)+(d-b)*(f-b)==0:\r\n return True\r\n\r\n if (a-c)*(e-c)+(b-d)*(f-d)==0:\r\n return True\r\n\r\n if (a-e)*(c-e)+(b-f)*(d-f)==0:\r\n return True\r\n\r\n return False\r\n\r\nif right(a,b,c,d,e,f)==True:\r\n print(\"RIGHT\")\r\n exit()\r\n\r\nfor x in range(a-1,a+2):\r\n if right(x,b,c,d,e,f)==True:\r\n print(\"ALMOST\")\r\n exit()\r\nfor x in range(b-1,b+2):\r\n if right(a,x,c,d,e,f)==True:\r\n print(\"ALMOST\")\r\n exit()\r\nfor x in range(c-1,c+2):\r\n if right(a,b,x,d,e,f)==True:\r\n print(\"ALMOST\")\r\n exit()\r\nfor x in range(d-1,d+2):\r\n if right(a,b,c,x,e,f)==True:\r\n print(\"ALMOST\")\r\n exit()\r\nfor x in range(e-1,e+2):\r\n if right(a,b,c,d,x,f)==True:\r\n print(\"ALMOST\")\r\n exit()\r\nfor x in range(f-1,f+2):\r\n if right(a,b,c,d,e,x)==True:\r\n print(\"ALMOST\")\r\n exit()\r\n\r\nprint(\"NEITHER\")\r\n", "from math import *\r\nx1,y1,x2,y2,x3,y3=list(map(int,input().split()))\r\ndef a(x1,y1,x2,y2,x3,y3):\r\n if x1!=x2:\r\n a1=degrees(atan((y2-y1)/(x2-x1)))\r\n else:\r\n if y2>y1:\r\n a1=degrees(pi/2)\r\n else:\r\n a1=degrees(-pi/2)\r\n if x1!=x3:\r\n a2=degrees(atan((y3-y1)/(x3-x1)))\r\n else:\r\n if y3>y1:\r\n a2=degrees(pi/2)\r\n else:\r\n a2=degrees(-pi/2)\r\n if x2!=x3:\r\n a3=degrees(atan((y2-y3)/(x2-x3)))\r\n else:\r\n if y2>y3:\r\n a3=degrees(pi/2)\r\n else:\r\n a3=degrees(-pi/2)\r\n if x2>=x1:\r\n if x3>=x1:\r\n b1=abs(a1-a2)\r\n if x3>=x2:\r\n b2=abs(a1+180-a3)\r\n else:\r\n b2=abs(a1-a3)\r\n else:\r\n b1=abs(180+a2-a1)\r\n b2=abs(a1-a3)\r\n else:\r\n if x3>=x1:\r\n b1=abs(180+a1-a2)\r\n b2=abs(a3-a1)\r\n else:\r\n b1=abs(a1-a2)\r\n if x3>=x2:\r\n b2=abs(a3-a1)\r\n else:\r\n b2=abs(180+a3-a1)\r\n b1=min(b1,360-b1)\r\n b2=min(b2,360-b2)\r\n b3=180-b1-b2\r\n b1=round(b1*1000000)/1000000\r\n b2=round(b2*1000000)/1000000\r\n b3=round(b3*1000000)/1000000\r\n if b1==90 or b2==90 or b3==90:\r\n return True\r\n else:\r\n return False\r\nif a(x1,y1,x2,y2,x3,y3):\r\n print('RIGHT')\r\nelif a(x1+1,y1,x2,y2,x3,y3) or a(x1-1,y1,x2,y2,x3,y3) or a(x1,y1+1,x2,y2,x3,y3) or a(x1,y1-1,x2,y2,x3,y3) or a(x1,y1,x2+1,y2,x3,y3) or a(x1,y1,x2-1,y2,x3,y3) or a(x1,y1,x2,y2+1,x3,y3) or a(x1,y1,x2,y2-1,x3,y3) or a(x1,y1,x2,y2,x3+1,y3) or a(x1,y1,x2,y2,x3-1,y3) or a(x1,y1,x2,y2,x3,y3+1) or a(x1,y1,x2,y2,x3,y3-1):\r\n print('ALMOST')\r\nelse:\r\n print('NEITHER')", "class pt:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n\r\ndef add(B, A):\r\n return pt(B.x + A.x, B.y + A.y)\r\ndef sub(B, A):\r\n return pt(B.x - A.x, B.y - A.y)\r\n\r\ndef scal(B, A):\r\n return B.x * A.x + B.y * A.y==0\r\n\r\ndef eq (A, B):\r\n return A.x == B.x and A.y == B.y\r\n\r\nx1,y1,x2,y2,x3,y3 = [int(x) for x in input().split()]\r\na = pt(x1, y1)\r\nb = pt(x2, y2)\r\nc = pt(x3, y3)\r\n\r\ndef tr(a,b,c):\r\n if (eq(a,c) or eq(a,b) or eq(c,b)):\r\n return 0\r\n # if scal(sub(a,b),sub(a,c)):\r\n if scal(sub(a,b),sub(a,c)):\r\n return 1\r\n if scal(sub(b,a),sub(b,c)):\r\n return 1 \r\n if scal(sub(c,b),sub(c,a)):\r\n return 1\r\n return 0\r\n\r\ndef check_almost(a, b, c):\r\n if tr(a.add(pt(0, 1)), b, c): return 1\r\n if tr(a.add(pt(0, -1)), b, c): return 1\r\n if tr(a.add(pt(1, 0)), b, c): return 1\r\n if tr(a.add(pt(-1, 0)), b, c): return 1\r\n\r\n\r\n return 0\r\n \r\nk=0\r\n \r\nif (tr(a,b,c)and k==0): \r\n print('RIGHT')\r\n k=1\r\na.x=a.x+1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\na.x=a.x-1\r\na.x=a.x-1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\na.x=a.x+1\r\na.y=a.y+1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\na.y=a.y-1\r\na.y=a.y-1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\na.y=a.y+1\r\n\r\n\r\n\r\nb.x=b.x+1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nb.x=b.x-1\r\nb.x=b.x-1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nb.x=b.x+1\r\nb.y=b.y+1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nb.y=b.y-1\r\nb.y=b.y-1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nb.y=a.y+1\r\n\r\n\r\nc.x=c.x+1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nc.x=c.x-1\r\nc.x=c.x-1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nc.x=c.x+1\r\nc.y=c.y+1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nc.y=c.y-1\r\nc.y=c.y-1\r\nif (tr(a,b,c)and k==0): \r\n print('ALMOST')\r\n k=1\r\nc.y=c.y+1\r\nif (k==0):\r\n print ('NEITHER')\r\n# def vk (x11,y11,x22,y22):\r\n# return (x22-x11,y22-y11)\r\n# def sk (x11,y11,x22,y22)\r\n# return(x11*x22+y11*y22==0)\r\n# def tr ()\r\n# x,y=vk(x1,y1,x2,y2)\r\n# x4,y4=vk(x1,y1,x3,y3)\r\n# if sk(x,y,x4,y4)\r\n# print('RIGHT')\r\n# print(k)\r\n\r\n\r\n", "import math\r\n\r\n\r\ndef fun(ls: tuple) -> bool:\r\n for i in range(3):\r\n v1 = (ls[i][0] - ls[(i + 1) % 3][0], ls[i][1] - ls[(i + 1) % 3][1])\r\n v2 = (ls[(i + 1) % 3][0] - ls[(i + 2) % 3][0], ls[(i + 1) % 3][1] - ls[(i + 2) % 3][1])\r\n if v1[0] * v2[0] + v1[1] * v2[1] == 0:\r\n return True\r\n return False\r\n\r\n\r\nx1, y1, x2, y2, x3, y3 = map(int, input().split(' '))\r\ntp = ([x1, y1], [x2, y2], [x3, y3])\r\nif fun(tp):\r\n print('RIGHT')\r\nelse:\r\n almost = False\r\n for i in range(3):\r\n x, y = tp[i][0], tp[i][1]\r\n dire = ((-1, 0), (1, 0), (0, 1), (0, -1))\r\n for d in dire:\r\n tx, ty = x + d[0], y + d[1]\r\n if [tx, ty] in tp:\r\n continue\r\n tp[i][0] = tx\r\n tp[i][1] = ty\r\n if fun(tp):\r\n almost = True\r\n break\r\n if almost:\r\n break\r\n tp[i][0] = x\r\n tp[i][1] = y\r\n print('ALMOST' if almost else 'NEITHER')\r\n", "s = list(map(int,input().split()))\r\n \r\n \r\ndef dis(a,b,c,d):\r\n\t return ((a-c)**2 + (b-d)**2)\r\n \r\ndef ass(s):\r\n\ta,b,c,d,e,f = s\r\n\tAB = dis(a,b,c,d)\r\n\tBC = dis(c,d,e,f)\r\n\tCA = dis(e,f,a,b)\r\n \r\n\tx = max(AB,BC,CA)\r\n\t\r\n\treturn x == AB+BC+CA-x and AB and BC and CA\r\n \r\nif ass(s):\r\n\tprint(\"RIGHT\") \r\n\texit()\r\n \r\nfor i in range(6):\r\n\ts[i] -= 1\r\n\tif ass(s): print(\"ALMOST\");exit()\r\n\ts[i] += 2\r\n\tif ass(s): print(\"ALMOST\");exit()\r\n\ts[i] -=1\r\n \r\nprint(\"NEITHER\") ", "list1 = list(map(int,input().split()))\r\n \r\n \r\ndef displayy(a,b,c,d):\r\n\t return ((a-c)**2 + (b-d)**2)\r\n \r\ndef fun1(list1):\r\n\ta,b,c,d,e,f = list1\r\n\tAB = displayy(a,b,c,d)\r\n\tBC = displayy(c,d,e,f)\r\n\tCA = displayy(e,f,a,b)\r\n \r\n\tx = max(AB,BC,CA)\r\n\t\r\n\treturn x == AB+BC+CA-x and AB and BC and CA\r\n \r\nif fun1(list1):\r\n\tprint(\"RIGHT\") \r\n\texit()\r\n \r\nfor i in range(6):\r\n\tlist1[i] -= 1\r\n\tif fun1(list1): print(\"ALMOST\");exit()\r\n\tlist1[i] += 2\r\n\tif fun1(list1): print(\"ALMOST\");exit()\r\n\tlist1[i] -=1\r\n \r\nprint(\"NEITHER\") ", "def dist(a, b):\n return (a[0] - b[0])**2 + (a[1] - b[1])**2\n\ndef check_tri(l):\n l.sort()\n if l[0] == 0:\n return False\n if l[0] + l[1] == l[2]:\n return True\n return False\n\np = [[0,0], [0,0], [0,0]]\np[0][0], p[0][1], p[1][0], p[1][1], p[2][0], p[2][1] = map(int, input().split())\n\nif check_tri([dist(p[0], p[1]), dist(p[0], p[2]), dist(p[2], p[1])]):\n print('RIGHT')\nelse:\n for i in range(3):\n for j in [[0,1], [1,-1], [-1,-1], [-1,1]]:\n p[i][0] += j[0]\n p[i][1] += j[1]\n if check_tri([dist(p[0], p[1]), dist(p[0], p[2]), dist(p[2], p[1])]):\n print(\"ALMOST\")\n quit()\n p[i][0] += 1\n print(\"NEITHER\")\n\n\n\n\n \t\t\t\t \t\t \t \t \t \t\t\t\t\t \t \t\t\t\t", "'''Problem 18A - Triangle'''\r\nimport math\r\na1,a2,b1,b2,c1,c2 = map(int, input().split()) # citim coordinatele punctelor\r\n\r\n# functie ce verifica daca laturile unui triunghi formeaza un triunghi dreptunghic\r\ndef is_triangle(ip,c1,c2):\r\n if c1 == 0 or c2 == 0 : return False # in caz ca una din catete are lungime egala cu zero\r\n # folosim trunc pentru a scapa de erroarea in calculul radicalului din teorema lui pitagora\r\n return math.trunc(ip*100000)/100000 == math.trunc(math.sqrt(pow(c1,2) + pow(c2,2))*100000)/100000 # retutunam valoarea booleana respectiva (True sau False)\r\n\r\n# functie ce calculeaza lungimile laturiloe dupa punctele lor pe axa\r\n# ca argument i se transmite o lista , elementele careia sunt 0,1 si -1, pentru a putea calcula lungimile\r\n# laturilor cu punctele diferite de o unitate\r\ndef pitagora_th(n=[0]*6):\r\n # in fiecare formula punctele de la input se aduna cu elementele listei n\r\n ab = math.sqrt((a1 + n[0] - (b1 + n[2]))**2 + (a2 + n[1] - (b2 + n[3]))**2)\r\n bc = math.sqrt((b1 + n[2] - (c1 + n[4]))**2 + (b2 + n[3] - (c2 + n[5]))**2)\r\n ca = math.sqrt((c1 + n[4] - (a1 + n[0]))**2 + (c2 + n[5] - (a2 + n[1]))**2)\r\n e = [ab,bc,ca] # salvam in lista pentru a le sorta\r\n e.sort()\r\n return e[0], e[1], e[2] # returnam ipotenuza , cateta1, cateta2\r\n\r\n# verificam daca punctele introduse formeaza un triunghi drept\r\na3, b3, c3 = pitagora_th()\r\nif is_triangle(c3, a3, b3):\r\n print('RIGHT')\r\n exit()\r\n# verificam pentru conditia a doua 'ALMOST'\r\nelse:\r\n for i in range(6):\r\n moves ,movess = [0]*6, [0]*6 # 2 tabele de zerouri\r\n moves[i] = 1 # pe rand axtualizam al i-lea zerou in 1\r\n movess[i] =-1 # pentru tablelul 2 , i-lea punct il transformam in -1\r\n a, b, c = pitagora_th(moves) # verificam daca nu e dreptunghic inlocuind tabelul de zerouri cu cel de 1\r\n g, f, d = pitagora_th(movess)\r\n if is_triangle(c,b,a) or is_triangle(d,f,g): # afisam daca valoarea returnata e True\r\n print('ALMOST')\r\n exit()\r\n '''\r\n a, b, c = pitagora_th(movess) # la fel verificam si pentru tabelul ce contine -1\r\n if is_triangle(c,b,a):\r\n print('ALMOST')\r\n exit()'''\r\n# in caz ca nu e satisfacuta nici o conditie\r\nprint('NEITHER')\r\n" ]

{"inputs": ["0 0 2 0 0 1", "2 3 4 5 6 6", "-1 0 2 0 0 1", "27 74 85 23 100 99", "-97 -19 17 62 30 -76", "28 -15 86 32 98 -41", "-66 24 8 -29 17 62", "-83 40 -80 52 -71 43", "-88 67 -62 37 -49 75", "58 45 6 22 13 79", "75 86 -82 89 -37 -35", "34 74 -2 -95 63 -33", "-7 63 78 74 -39 -30", "-49 -99 7 92 61 -28", "-90 90 87 -92 -40 -26", "-100 -100 100 -100 0 73", "39 22 94 25 69 -23", "100 100 -100 100 1 -73", "0 0 0 1 1 0", "-100 -100 100 100 -100 100", "29 83 35 35 74 65", "28 -15 86 32 -19 43", "-28 12 -97 67 -83 -57", "-83 40 -80 52 -79 39", "30 8 49 13 25 27", "23 6 63 -40 69 46", "49 -7 19 -76 26 3", "0 0 1 0 2 1", "0 0 1 0 3 1", "0 0 1 0 2 2", "0 0 1 0 4 1", "0 0 1 0 100 1", "60 4 90 -53 32 -12", "52 -34 -37 -63 23 54", "39 22 95 25 42 -33", "-10 -11 62 6 -12 -3", "22 -15 -24 77 -69 -60", "99 85 90 87 64 -20", "-50 -37 -93 -6 -80 -80", "4 -13 4 -49 -24 -13", "0 -3 -3 -10 4 -7", "-45 -87 -34 -79 -60 -62", "-67 49 89 -76 -37 87", "22 32 -33 -30 -18 68", "36 1 -17 -54 -19 55", "55 44 15 14 23 83", "-19 0 -89 -54 25 -57", "69 -45 1 11 56 -63", "72 68 56 72 33 -88", "59 86 74 -49 77 88", "-50 0 0 50 0 -50", "-50 0 0 50 0 -51", "-50 0 0 50 0 -49", "-50 0 0 50 1 -50", "-50 0 0 50 -1 -50", "-50 0 0 49 0 -50", "-50 0 0 51 0 -50", "-50 0 1 50 0 -50", "-50 0 -1 50 0 -50", "-50 1 0 50 0 -50", "-50 -1 0 50 0 -50", "-51 0 0 50 0 -50", "-49 0 0 50 0 -50"], "outputs": ["RIGHT", "NEITHER", "ALMOST", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "RIGHT", "RIGHT", "NEITHER", "RIGHT", "RIGHT", "RIGHT", "RIGHT", "RIGHT", "RIGHT", "ALMOST", "ALMOST", "ALMOST", "NEITHER", "NEITHER", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "RIGHT", "NEITHER", "NEITHER", "NEITHER", "NEITHER", "ALMOST", "NEITHER", "NEITHER", "NEITHER", "RIGHT", "RIGHT", "RIGHT", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST", "ALMOST"]}

UNKNOWN

PYTHON3

CODEFORCES

36

91e81a621aec1c42e9fa4f1997c14bf9

Luck is in Numbers

Vasya has been collecting transport tickets for quite a while now. His collection contains several thousands of tram, trolleybus and bus tickets. Vasya is already fed up with the traditional definition of what a lucky ticket is. Thus, he's looking for new perspectives on that. Besides, Vasya cannot understand why all tickets are only divided into lucky and unlucky ones. He thinks that all tickets are lucky but in different degrees. Having given the matter some thought, Vasya worked out the definition of a ticket's degree of luckiness. Let a ticket consist of 2*n* digits. Let's regard each digit as written as is shown on the picture: You have seen such digits on electronic clocks: seven segments are used to show digits. Each segment can either be colored or not. The colored segments form a digit. Vasya regards the digits as written in this very way and takes the right half of the ticket and puts it one the left one, so that the first digit coincides with the *n*<=+<=1-th one, the second digit coincides with the *n*<=+<=2-th one, ..., the *n*-th digit coincides with the 2*n*-th one. For each pair of digits, put one on another, he counts the number of segments colored in both digits and summarizes the resulting numbers. The resulting value is called the degree of luckiness of a ticket. For example, the degree of luckiness of ticket 03 equals four and the degree of luckiness of ticket 2345 equals six. You are given the number of a ticket containing 2*n* digits. Your task is to find among the tickets whose number exceeds the number of this ticket but also consists of 2*n* digits such ticket, whose degree of luckiness exceeds the degrees of luckiness of the given ticket. Moreover, if there are several such tickets, you should only choose the one with the smallest number. The first line contains the number of the ticket that consists of *k* characters (*k*<==<=2*n*,<=1<=≤<=*n*<=≤<=105). Print the number of the sought ticket or "-1" (without the quotes) if no such ticket exists. Sample Input 13 2345 88 Sample Output 20 2348 -1

[ "import sys\r\n\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\n\r\ns = input()\r\nn = len(s) // 2\r\n\r\nlines = [\"1111110\", \"0110000\", \"1101101\", \"1111001\", \"0110011\", \"1011011\", \"1011111\", \"1110000\", \"1111111\", \"1111011\"]\r\ncommon = [[0] * 10 for _ in range(10)]\r\nfor i in range(10):\r\n for j in range(10):\r\n for k in range(7):\r\n common[i][j] += 1 if lines[i][k] == '1' and lines[j][k] == '1' else 0\r\n\r\nleft = list(map(int, list(s[:n])))\r\nright = list(map(int, list(s[n:])))\r\n\r\nstart = 0\r\nstartVals = [0] * (n + 1)\r\nfor i in range(n):\r\n start += common[left[i]][right[i]]\r\n startVals[i + 1] = start\r\ncur = start\r\n\r\nmaxVals = [0] * (n + 1)\r\nfor k in reversed(range(n)):\r\n maxVals[k] = maxVals[k+1] + max(common[left[k]])\r\n\r\nfor k in reversed(range(n)):\r\n for num in range(right[k] + 1, 10):\r\n if common[left[k]][num] + maxVals[k + 1] + startVals[k] > start:\r\n startVals[k + 1] = startVals[k] + common[left[k]][num]\r\n right[k] = num\r\n for j in range(k + 1, n):\r\n for num2 in range(0, 10):\r\n if common[left[j]][num2] + maxVals[j + 1] + startVals[j] > start:\r\n startVals[j + 1] = startVals[j] + common[left[j]][num2]\r\n right[j] = num2\r\n break\r\n print(\"\".join(map(str, left)) + \"\".join(map(str, right)))\r\n exit()\r\n\r\nmaxVals = [0] * (n + 1)\r\nfor k in range(n):\r\n maxVals[k + 1] = maxVals[k] + max(common[left[k]])\r\n\r\nfor k in reversed(range(n)):\r\n for num in range(left[k] + 1, 10):\r\n if max(common[num]) + maxVals[k] + 7 * (n - 1 - k) > start:\r\n maxVals[k + 1] = maxVals[k] + max(common[num])\r\n left[k] = num\r\n\r\n for j in range(k + 1, n):\r\n for num2 in range(0, 10):\r\n if max(common[num2]) + maxVals[j] + 7 * (n - 1 - j) > start:\r\n maxVals[j + 1] = maxVals[j] + max(common[num2])\r\n left[j] = num2\r\n break\r\n\r\n maxVals = [0] * (n + 1)\r\n for j in reversed(range(n)):\r\n maxVals[j] = maxVals[j + 1] + max(common[left[j]])\r\n\r\n for j in range(n):\r\n for num2 in range(0, 10):\r\n if common[left[j]][num2] + maxVals[j + 1] + startVals[j] > start:\r\n startVals[j + 1] = startVals[j] + common[left[j]][num2]\r\n right[j] = num2\r\n break\r\n print(\"\".join(map(str, left)) + \"\".join(map(str, right)))\r\n exit()\r\n\r\nprint(-1)\r\n" ]

{"inputs": ["13", "2345", "88", "682444", "685116", "576079", "569631", "662302", "453066", "659821", "26592659", "47699969", "09980988", "69886888", "9588995888", "39930089893999008989", "84163081988476808998", "88898888988889888898", "01273988890029888889", "18858998881886898888", "8259988583", "5898888944", "855889831888", "439968658988", "335598338288", "43223543566815212912981204669368711837288602368426888989998989988898989999998988988988999998999899984322884358881924880288488486998884783928868286842888888998888898888898889898888898898888888898889888", "99393666387527964893713203630389899998898999889989898999898899999899899899998889899998898989989889998888368888898788888990888868038988989889889888898989888889889998989989889899888888989888898998988899", "40724501726491585262016953677772948189547459145312538682757304290442786808955140603033718167250989898098898078698368686201885869883288848858845889691868888805988428844298880895618068983393806889898888", "79088264099789040101338987288228743957988889999888988998999888988999988999899889889999999898888899889988886808878908600889888328888899889798888998981888888899888888878998898888888958898899988888889988", "51974056597584768542734492125108488334626378590999898888998889899888898998889989988889898988999988899790085898898976884233448882618888038888883899099888888888888989888888888888988888888889888819998888", "496198999898", "09989988", "748989888889", "6984899899", "68623695792730582626313022231731418370802097728016898999999888889889989888989999898988988898888988888868389688838098868896902888793384830880209692808589899898888888888988888898888888898898888888898888", "34740506804988021948888998989898988889889889898888899989999999888988998998998889898989899998899998888439088688898808894888899898888898880988888989888889898989999988898898889899888989898989899888888888", "22938645962769613028898841128696546129021084561286040502773858728727299998988899899898989998888888888889889986296978908889880418888689802802008858828808868208988898888988999888889889989898898888888888", "34746525584443243456003041207650137412317331793360297058977077354535244802188888988888998998888889893498898958888388396600804028869848940893993789898089309887308898469904880874888898808889898888888888", "85134786461893350509517211574918339368780716712903244472148878199438599584095845405384064998889998998978978848989896088984387453988889938838099684288884488234888898993888858909888643588888493888998888", "0380023162775902996798876281379973370849", "3317497200125434836799763396859317396410", "5212759368584085865703568602327752094982", "547226955080909274578712855056537756831350123450633621352615", "090134011009710349472352007887283047446420798236414107901761"], "outputs": ["20", "2348", "-1", "682445", "685120", "576086", "569632", "662362", "453068", "659822", "26602660", "47804080", "28882888", "80888088", "9608886088", "39930098883883008888", "84163082000406308200", "88988888888888888888", "01274888880020488888", "18859888880885888888", "8259988588", "5898888945", "855889832088", "439968688868", "335598338388", "43223543566815212912981204669368711837288602368426888989998989988898989999998988988988999998999908884322354356680520280288020466836800083028860236842688888888888888888888888888888888888888888888880888", "99393666387527964893713203630389899998898999889989898999898899999899899899998889899998898989989890888838366638052086488300320363038888888888888888888888888888888888888888888888888888888888888888888088", "40724501726491585262016953677772948189547459145312538682757304290442786808955140603033718167250998884002450002648058526200685360000284808854045804530253868205030428044208680885504060303300806025088888", "79088264099789040101338987288228743957988889999888988998999888988999988999899889889999999898888899889988886808878908600889888328888899889798888998981888888899888888878998898888888968888888888888888888", "51974056597584768542734492125108488334626378590999898888998889899888898998889989988889898988999988899790085898898976884233448882618888038888883899099888888888888989888888888888988888888889888820888888", "496200006200", "20882088", "749888048888", "6984968848", "68623695792730582626313022231731418370802097728016898999999888889889989888989999898988988898888988888868389688838098868896902888793384830880209692808688888888888888888888888888888888888888888888888888", "34740506804988021948888998989898988889889889898888899989999999888988998998998889898989899998899998888439088688898808894888899898888898888888888888888888888888888888888888888888888888888888888888888888", "22938645962769613028898841128696546129021084561286040502773858728727299998988899899898989998888888888889889986296978908889884002868654602802008456028604050200385802802028888888888888888888888888888888", "34746525584443243456003041207650137412317331793360297058977077354535244802188888988888998998888889893498898958888388396600804028869848940893993789898089309887308898469904880874888898888888888888888888", "85134786461893350509517211574918339368780716712903244472148878199438599584095845405384064998889998998978978848989896088984387453988889938838099684288884488234888898993888858909888643588888498888888888", "0380023162775902996798876281379973370850", "3317497200125434836799763396859317396420", "5212759368584085865703568602327752094983", "547226955080909274578712855056537756831350123450633621352616", "090134011009710349472352007887283047446420798236414107901763"]}

UNKNOWN

PYTHON3

CODEFORCES

1

91f7cff482b2b493374285494a5a7025

Beautiful Sets of Points

Manao has invented a new mathematical term — a beautiful set of points. He calls a set of points on a plane beautiful if it meets the following conditions: 1. The coordinates of each point in the set are integers. 1. For any two points from the set, the distance between them is a non-integer. Consider all points (*x*,<=*y*) which satisfy the inequations: 0<=≤<=*x*<=≤<=*n*; 0<=≤<=*y*<=≤<=*m*; *x*<=+<=*y*<=><=0. Choose their subset of maximum size such that it is also a beautiful set of points. The single line contains two space-separated integers *n* and *m* (1<=≤<=*n*,<=*m*<=≤<=100). In the first line print a single integer — the size *k* of the found beautiful set. In each of the next *k* lines print a pair of space-separated integers — the *x*- and *y*- coordinates, respectively, of a point from the set. If there are several optimal solutions, you may print any of them. Sample Input 2 2 4 3 Sample Output 3 0 1 1 2 2 0 4 0 3 2 1 3 0 4 2

[ "import sys\ninput = lambda:sys.stdin.readline().strip()\nn,m = map(int,input().split())\nx = min(n,m)\nprint(x+1)\nfor i in range(x+1):\n print(i,x-i)\n\t \t\t\t \t\t\t\t\t \t \t\t\t \t\t\t\t\t\t \t \t", "from math import *\r\nn,m=map(int,input().split())\r\nt=min(n,m)\r\nprint(t+1)\r\nfor i in range(t+1):\r\n\tprint(t-i,i)", "n, m = map(int, input().split())\r\nprint(min(n, m) + 1)\r\nif n > m:\r\n for i in range(m+1):\r\n print(i, m-i)\r\nelse:\r\n for i in range(n+1):\r\n print(i, n-i)\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\n\nN,M = map(int,input().split())\nx,y = 0,M\nans = []\nfor i in range(min(N,M)+1):\n ans.append([x+i,y-i])\nprint(len(ans))\nfor i in ans:\n print(*i)", "row, col = list(map(int, input().split()))\r\nprint(min(row, col)+1)\r\nfor i in range(0, min(row, col)+1):\r\n print(i, col-i)", "n,m=map(int,input().split())\r\nmnn=min(m,n)\r\nprint(mnn+1)\r\nfor i in range(mnn+1):\r\n print(i,mnn-i)", "n,m=map(int,input().split())\r\ns=min(m,n)+1\r\nprint(s)\r\nfor i in range(s):\r\n print( i, s-i-1)\r\n\r\n", "def solve(n,m):\n val = min(n,m)\n print(val+1)\n for i in range(val+1):\n print(i,val-i)\n\n\nn,m = [int(ele) for ele in input().split()]\nsolve(n,m)", "lst = list(map(int, input().split(' ')))\nn, m = lst\nprint(min(n, m) + 1)\nx = 0\ny = m\nwhile(x <= n and y >= 0):\n\tprint(x, y)\n\tx += 1\n\ty -= 1", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\ndiagonals = min(n,m)\r\npoints = []\r\nfor x in range(diagonals+1):\r\n points.append(str(x)+\" \"+str(diagonals-x))\r\nprint(len(points))\r\nfor x in range(len(points)):\r\n print(points[x])", "x=min(map(int,input().split()))\r\nprint(x+1)\r\nfor i in range(x+1):\r\n print(i, x-i)\r\n", "n = min(map(int, input().split()))\r\nprint(n+1)\r\nfor i in range(n+1):\r\n print(i, n-i)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nk = min(n, m)\r\nprint(k + 1)\r\nfor i in range(k + 1):\r\n\tprint(k - i, i)", "# LUOGU_RID: 129559212\nimport sys\r\ninput = lambda:sys.stdin.readline().strip()\r\nn,m = map(int,input().split())\r\nx = min(n,m)\r\nprint(x+1)\r\nfor i in range(x+1):\r\n print(i,x-i)", "s=min(map(int,input().split()))\r\nprint(s+1)\r\nfor i in range(s+1): print(i,s-i)", "s=min(map(int,input().split()))\nprint(s+1)\nfor i in range(s+1):print(i,s-i)\n\n\t \t \t \t \t\t \t \t\t\t \t \t", "def clc(): \r\n n,m= map(int,input().split())\r\n n,m = min(n,m),max(n,m)\r\n out= []\r\n \r\n for i in range(n+1):\r\n out.append((i,n-i))\r\n print(len(out))\r\n for i in range(len(out)):\r\n print(out[i][0],out[i][1])\r\n\r\n\r\n\r\nclc()\r\n ", "n,m=map(int,input().split())\r\nz=min(n,m)\r\nprint(z+1)\r\nfor i in range(z+1):\r\n print(i,z-i)", "n, m = map(int,input().split())\n\nans = min(n,m)+1\nprint(ans)\nfor i in range(ans):\n print(i, ans-1-i)", "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 Beautiful_Sets_of_Points():\r\n n, m = invr()\r\n\r\n num_points = min(n,m) + 1 \r\n\r\n outputStr = ''\r\n if n == min(n,m):\r\n\r\n start_x = n \r\n start_y = 0 \r\n\r\n for i in range(num_points):\r\n outputStr += str(start_x) + ' ' + str(start_y) + '\\n'\r\n start_x -= 1\r\n start_y += 1 \r\n \r\n else:\r\n start_x = 0 \r\n start_y = m \r\n\r\n for i in range(num_points):\r\n outputStr += str(start_x) + ' ' + str(start_y) + '\\n'\r\n start_x += 1\r\n start_y -= 1 \r\n \r\n outputStr = outputStr.strip()\r\n print(num_points)\r\n print(outputStr)\r\n return \r\n\r\n\r\nBeautiful_Sets_of_Points()" ]

{"inputs": ["2 2", "4 3", "21 21", "10 1", "4 4", "1 1", "5 5", "100 100", "96 96", "99 100", "67 58", "67 59", "80 91", "100 11", "16 55", "13 71", "30 40", "77 77", "6 6", "37 42", "88 88", "95 99", "93 70", "4 6", "1 4", "2 10", "6 7", "28 28", "10 6", "85 48", "9 6", "2 6", "6 4", "6 10", "16 5", "7 6", "3 4", "13 18", "5 100", "11 9", "13 13", "1 5", "3 19", "10 10", "3 7", "98 76", "10 100"], "outputs": ["3\n0 1\n1 2\n2 0", "4\n0 3\n2 1\n3 0\n4 2", "22\n21 0\n20 1\n19 2\n18 3\n17 4\n16 5\n15 6\n14 7\n13 8\n12 9\n11 10\n10 11\n9 12\n8 13\n7 14\n6 15\n5 16\n4 17\n3 18\n2 19\n1 20\n0 21", "2\n1 0\n0 1", "5\n4 0\n3 1\n2 2\n1 3\n0 4", "2\n1 0\n0 1", "6\n5 0\n4 1\n3 2\n2 3\n1 4\n0 5", "101\n100 0\n99 1\n98 2\n97 3\n96 4\n95 5\n94 6\n93 7\n92 8\n91 9\n90 10\n89 11\n88 12\n87 13\n86 14\n85 15\n84 16\n83 17\n82 18\n81 19\n80 20\n79 21\n78 22\n77 23\n76 24\n75 25\n74 26\n73 27\n72 28\n71 29\n70 30\n69 31\n68 32\n67 33\n66 34\n65 35\n64 36\n63 37\n62 38\n61 39\n60 40\n59 41\n58 42\n57 43\n56 44\n55 45\n54 46\n53 47\n52 48\n51 49\n50 50\n49 51\n48 52\n47 53\n46 54\n45 55\n44 56\n43 57\n42 58\n41 59\n40 60\n39 61\n38 62\n37 63\n36 64\n35 65\n34 66\n33 67\n32 68\n31 69\n30 70\n29 71\n28 72\n27 7...", "97\n96 0\n95 1\n94 2\n93 3\n92 4\n91 5\n90 6\n89 7\n88 8\n87 9\n86 10\n85 11\n84 12\n83 13\n82 14\n81 15\n80 16\n79 17\n78 18\n77 19\n76 20\n75 21\n74 22\n73 23\n72 24\n71 25\n70 26\n69 27\n68 28\n67 29\n66 30\n65 31\n64 32\n63 33\n62 34\n61 35\n60 36\n59 37\n58 38\n57 39\n56 40\n55 41\n54 42\n53 43\n52 44\n51 45\n50 46\n49 47\n48 48\n47 49\n46 50\n45 51\n44 52\n43 53\n42 54\n41 55\n40 56\n39 57\n38 58\n37 59\n36 60\n35 61\n34 62\n33 63\n32 64\n31 65\n30 66\n29 67\n28 68\n27 69\n26 70\n25 71\n24 72\n23 73\n...", "100\n99 0\n98 1\n97 2\n96 3\n95 4\n94 5\n93 6\n92 7\n91 8\n90 9\n89 10\n88 11\n87 12\n86 13\n85 14\n84 15\n83 16\n82 17\n81 18\n80 19\n79 20\n78 21\n77 22\n76 23\n75 24\n74 25\n73 26\n72 27\n71 28\n70 29\n69 30\n68 31\n67 32\n66 33\n65 34\n64 35\n63 36\n62 37\n61 38\n60 39\n59 40\n58 41\n57 42\n56 43\n55 44\n54 45\n53 46\n52 47\n51 48\n50 49\n49 50\n48 51\n47 52\n46 53\n45 54\n44 55\n43 56\n42 57\n41 58\n40 59\n39 60\n38 61\n37 62\n36 63\n35 64\n34 65\n33 66\n32 67\n31 68\n30 69\n29 70\n28 71\n27 72\n26 73...", "59\n58 0\n57 1\n56 2\n55 3\n54 4\n53 5\n52 6\n51 7\n50 8\n49 9\n48 10\n47 11\n46 12\n45 13\n44 14\n43 15\n42 16\n41 17\n40 18\n39 19\n38 20\n37 21\n36 22\n35 23\n34 24\n33 25\n32 26\n31 27\n30 28\n29 29\n28 30\n27 31\n26 32\n25 33\n24 34\n23 35\n22 36\n21 37\n20 38\n19 39\n18 40\n17 41\n16 42\n15 43\n14 44\n13 45\n12 46\n11 47\n10 48\n9 49\n8 50\n7 51\n6 52\n5 53\n4 54\n3 55\n2 56\n1 57\n0 58", "60\n59 0\n58 1\n57 2\n56 3\n55 4\n54 5\n53 6\n52 7\n51 8\n50 9\n49 10\n48 11\n47 12\n46 13\n45 14\n44 15\n43 16\n42 17\n41 18\n40 19\n39 20\n38 21\n37 22\n36 23\n35 24\n34 25\n33 26\n32 27\n31 28\n30 29\n29 30\n28 31\n27 32\n26 33\n25 34\n24 35\n23 36\n22 37\n21 38\n20 39\n19 40\n18 41\n17 42\n16 43\n15 44\n14 45\n13 46\n12 47\n11 48\n10 49\n9 50\n8 51\n7 52\n6 53\n5 54\n4 55\n3 56\n2 57\n1 58\n0 59", "81\n80 0\n79 1\n78 2\n77 3\n76 4\n75 5\n74 6\n73 7\n72 8\n71 9\n70 10\n69 11\n68 12\n67 13\n66 14\n65 15\n64 16\n63 17\n62 18\n61 19\n60 20\n59 21\n58 22\n57 23\n56 24\n55 25\n54 26\n53 27\n52 28\n51 29\n50 30\n49 31\n48 32\n47 33\n46 34\n45 35\n44 36\n43 37\n42 38\n41 39\n40 40\n39 41\n38 42\n37 43\n36 44\n35 45\n34 46\n33 47\n32 48\n31 49\n30 50\n29 51\n28 52\n27 53\n26 54\n25 55\n24 56\n23 57\n22 58\n21 59\n20 60\n19 61\n18 62\n17 63\n16 64\n15 65\n14 66\n13 67\n12 68\n11 69\n10 70\n9 71\n8 72\n7 73\n6 ...", "12\n11 0\n10 1\n9 2\n8 3\n7 4\n6 5\n5 6\n4 7\n3 8\n2 9\n1 10\n0 11", "17\n16 0\n15 1\n14 2\n13 3\n12 4\n11 5\n10 6\n9 7\n8 8\n7 9\n6 10\n5 11\n4 12\n3 13\n2 14\n1 15\n0 16", "14\n13 0\n12 1\n11 2\n10 3\n9 4\n8 5\n7 6\n6 7\n5 8\n4 9\n3 10\n2 11\n1 12\n0 13", "31\n30 0\n29 1\n28 2\n27 3\n26 4\n25 5\n24 6\n23 7\n22 8\n21 9\n20 10\n19 11\n18 12\n17 13\n16 14\n15 15\n14 16\n13 17\n12 18\n11 19\n10 20\n9 21\n8 22\n7 23\n6 24\n5 25\n4 26\n3 27\n2 28\n1 29\n0 30", "78\n77 0\n76 1\n75 2\n74 3\n73 4\n72 5\n71 6\n70 7\n69 8\n68 9\n67 10\n66 11\n65 12\n64 13\n63 14\n62 15\n61 16\n60 17\n59 18\n58 19\n57 20\n56 21\n55 22\n54 23\n53 24\n52 25\n51 26\n50 27\n49 28\n48 29\n47 30\n46 31\n45 32\n44 33\n43 34\n42 35\n41 36\n40 37\n39 38\n38 39\n37 40\n36 41\n35 42\n34 43\n33 44\n32 45\n31 46\n30 47\n29 48\n28 49\n27 50\n26 51\n25 52\n24 53\n23 54\n22 55\n21 56\n20 57\n19 58\n18 59\n17 60\n16 61\n15 62\n14 63\n13 64\n12 65\n11 66\n10 67\n9 68\n8 69\n7 70\n6 71\n5 72\n4 73\n3 74\n...", "7\n6 0\n5 1\n4 2\n3 3\n2 4\n1 5\n0 6", "38\n37 0\n36 1\n35 2\n34 3\n33 4\n32 5\n31 6\n30 7\n29 8\n28 9\n27 10\n26 11\n25 12\n24 13\n23 14\n22 15\n21 16\n20 17\n19 18\n18 19\n17 20\n16 21\n15 22\n14 23\n13 24\n12 25\n11 26\n10 27\n9 28\n8 29\n7 30\n6 31\n5 32\n4 33\n3 34\n2 35\n1 36\n0 37", "89\n88 0\n87 1\n86 2\n85 3\n84 4\n83 5\n82 6\n81 7\n80 8\n79 9\n78 10\n77 11\n76 12\n75 13\n74 14\n73 15\n72 16\n71 17\n70 18\n69 19\n68 20\n67 21\n66 22\n65 23\n64 24\n63 25\n62 26\n61 27\n60 28\n59 29\n58 30\n57 31\n56 32\n55 33\n54 34\n53 35\n52 36\n51 37\n50 38\n49 39\n48 40\n47 41\n46 42\n45 43\n44 44\n43 45\n42 46\n41 47\n40 48\n39 49\n38 50\n37 51\n36 52\n35 53\n34 54\n33 55\n32 56\n31 57\n30 58\n29 59\n28 60\n27 61\n26 62\n25 63\n24 64\n23 65\n22 66\n21 67\n20 68\n19 69\n18 70\n17 71\n16 72\n15 73\n...", "96\n95 0\n94 1\n93 2\n92 3\n91 4\n90 5\n89 6\n88 7\n87 8\n86 9\n85 10\n84 11\n83 12\n82 13\n81 14\n80 15\n79 16\n78 17\n77 18\n76 19\n75 20\n74 21\n73 22\n72 23\n71 24\n70 25\n69 26\n68 27\n67 28\n66 29\n65 30\n64 31\n63 32\n62 33\n61 34\n60 35\n59 36\n58 37\n57 38\n56 39\n55 40\n54 41\n53 42\n52 43\n51 44\n50 45\n49 46\n48 47\n47 48\n46 49\n45 50\n44 51\n43 52\n42 53\n41 54\n40 55\n39 56\n38 57\n37 58\n36 59\n35 60\n34 61\n33 62\n32 63\n31 64\n30 65\n29 66\n28 67\n27 68\n26 69\n25 70\n24 71\n23 72\n22 73\n...", "71\n70 0\n69 1\n68 2\n67 3\n66 4\n65 5\n64 6\n63 7\n62 8\n61 9\n60 10\n59 11\n58 12\n57 13\n56 14\n55 15\n54 16\n53 17\n52 18\n51 19\n50 20\n49 21\n48 22\n47 23\n46 24\n45 25\n44 26\n43 27\n42 28\n41 29\n40 30\n39 31\n38 32\n37 33\n36 34\n35 35\n34 36\n33 37\n32 38\n31 39\n30 40\n29 41\n28 42\n27 43\n26 44\n25 45\n24 46\n23 47\n22 48\n21 49\n20 50\n19 51\n18 52\n17 53\n16 54\n15 55\n14 56\n13 57\n12 58\n11 59\n10 60\n9 61\n8 62\n7 63\n6 64\n5 65\n4 66\n3 67\n2 68\n1 69\n0 70", "5\n4 0\n3 1\n2 2\n1 3\n0 4", "2\n1 0\n0 1", "3\n2 0\n1 1\n0 2", "7\n6 0\n5 1\n4 2\n3 3\n2 4\n1 5\n0 6", "29\n28 0\n27 1\n26 2\n25 3\n24 4\n23 5\n22 6\n21 7\n20 8\n19 9\n18 10\n17 11\n16 12\n15 13\n14 14\n13 15\n12 16\n11 17\n10 18\n9 19\n8 20\n7 21\n6 22\n5 23\n4 24\n3 25\n2 26\n1 27\n0 28", "7\n6 0\n5 1\n4 2\n3 3\n2 4\n1 5\n0 6", "49\n48 0\n47 1\n46 2\n45 3\n44 4\n43 5\n42 6\n41 7\n40 8\n39 9\n38 10\n37 11\n36 12\n35 13\n34 14\n33 15\n32 16\n31 17\n30 18\n29 19\n28 20\n27 21\n26 22\n25 23\n24 24\n23 25\n22 26\n21 27\n20 28\n19 29\n18 30\n17 31\n16 32\n15 33\n14 34\n13 35\n12 36\n11 37\n10 38\n9 39\n8 40\n7 41\n6 42\n5 43\n4 44\n3 45\n2 46\n1 47\n0 48", "7\n6 0\n5 1\n4 2\n3 3\n2 4\n1 5\n0 6", "3\n2 0\n1 1\n0 2", "5\n4 0\n3 1\n2 2\n1 3\n0 4", "7\n6 0\n5 1\n4 2\n3 3\n2 4\n1 5\n0 6", "6\n5 0\n4 1\n3 2\n2 3\n1 4\n0 5", "7\n6 0\n5 1\n4 2\n3 3\n2 4\n1 5\n0 6", "4\n3 0\n2 1\n1 2\n0 3", "14\n13 0\n12 1\n11 2\n10 3\n9 4\n8 5\n7 6\n6 7\n5 8\n4 9\n3 10\n2 11\n1 12\n0 13", "6\n5 0\n4 1\n3 2\n2 3\n1 4\n0 5", "10\n9 0\n8 1\n7 2\n6 3\n5 4\n4 5\n3 6\n2 7\n1 8\n0 9", "14\n13 0\n12 1\n11 2\n10 3\n9 4\n8 5\n7 6\n6 7\n5 8\n4 9\n3 10\n2 11\n1 12\n0 13", "2\n1 0\n0 1", "4\n3 0\n2 1\n1 2\n0 3", "11\n10 0\n9 1\n8 2\n7 3\n6 4\n5 5\n4 6\n3 7\n2 8\n1 9\n0 10", "4\n3 0\n2 1\n1 2\n0 3", "77\n76 0\n75 1\n74 2\n73 3\n72 4\n71 5\n70 6\n69 7\n68 8\n67 9\n66 10\n65 11\n64 12\n63 13\n62 14\n61 15\n60 16\n59 17\n58 18\n57 19\n56 20\n55 21\n54 22\n53 23\n52 24\n51 25\n50 26\n49 27\n48 28\n47 29\n46 30\n45 31\n44 32\n43 33\n42 34\n41 35\n40 36\n39 37\n38 38\n37 39\n36 40\n35 41\n34 42\n33 43\n32 44\n31 45\n30 46\n29 47\n28 48\n27 49\n26 50\n25 51\n24 52\n23 53\n22 54\n21 55\n20 56\n19 57\n18 58\n17 59\n16 60\n15 61\n14 62\n13 63\n12 64\n11 65\n10 66\n9 67\n8 68\n7 69\n6 70\n5 71\n4 72\n3 73\n2 74\n...", "11\n10 0\n9 1\n8 2\n7 3\n6 4\n5 5\n4 6\n3 7\n2 8\n1 9\n0 10"]}

UNKNOWN

PYTHON3

CODEFORCES

20

92033556eb9354fb8e42ff803e338e16

Polycarp at the Radio

Polycarp is a music editor at the radio station. He received a playlist for tomorrow, that can be represented as a sequence *a*1,<=*a*2,<=...,<=*a**n*, where *a**i* is a band, which performs the *i*-th song. Polycarp likes bands with the numbers from 1 to *m*, but he doesn't really like others. We define as *b**j* the number of songs the group *j* is going to perform tomorrow. Polycarp wants to change the playlist in such a way that the minimum among the numbers *b*1,<=*b*2,<=...,<=*b**m* will be as large as possible. Find this maximum possible value of the minimum among the *b**j* (1<=≤<=*j*<=≤<=*m*), and the minimum number of changes in the playlist Polycarp needs to make to achieve it. One change in the playlist is a replacement of the performer of the *i*-th song with any other group. The first line of the input contains two integers *n* and *m* (1<=≤<=*m*<=≤<=*n*<=≤<=2000). The second line contains *n* integers *a*1,<=*a*2,<=...,<=*a**n* (1<=≤<=*a**i*<=≤<=109), where *a**i* is the performer of the *i*-th song. In the first line print two integers: the maximum possible value of the minimum among the *b**j* (1<=≤<=*j*<=≤<=*m*), where *b**j* is the number of songs in the changed playlist performed by the *j*-th band, and the minimum number of changes in the playlist Polycarp needs to make. In the second line print the changed playlist. If there are multiple answers, print any of them. Sample Input 4 2 1 2 3 2 7 3 1 3 2 2 2 2 1 4 4 1000000000 100 7 1000000000 Sample Output 2 1 1 2 1 2 2 1 1 3 3 2 2 2 1 1 4 1 2 3 4

[ "n,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ntot,ans,s=n//m,0,dict()\r\nfor i in range(m):\r\n s[i+1]=0\r\nfor i in range(n):\r\n if a[i]<=m:\r\n s[a[i]]+=1\r\ni,j=0,0\r\nwhile i<m:\r\n while s[i+1]<tot:\r\n if a[j]>m:\r\n a[j]=i+1\r\n ans+=1\r\n s[i+1]+=1\r\n elif s[a[j]]>tot:\r\n s[a[j]]-=1\r\n a[j]=i+1\r\n ans+=1\r\n s[i+1]+=1\r\n j+=1\r\n i+=1\r\nprint(tot,ans)\r\nprint(*a)", "#!/usr/bin/env\tpython\r\n#-*-coding:utf-8 -*-\r\nn,m=map(int,input().split())\r\nn//=m\r\nA=list(map(int,input().split()))\r\nS=[n]*m\r\nL=[]\r\nfor i,a in enumerate(A):\r\n\ta-=1\r\n\tif m>a and S[a]:S[a]-=1\r\n\telse:L.append(i)\r\nfor i,s in enumerate(S,1):\r\n\tfor _ in range(s):A[L.pop()]=i\r\nprint(n,sum(S))\r\nprint(*A)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN,M = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nothers = []\r\nlib = defaultdict(list)\r\nt = N//M\r\nm = N%M\r\nfor i in range(N):\r\n if A[i]<=M:\r\n if len(lib[A[i]])<t:\r\n lib[A[i]].append(i)\r\n elif m>0:\r\n lib[A[i]].append(i)\r\n m-=1\r\n else:\r\n others.append(i)\r\n else:\r\n others.append(i)\r\n \r\nans = 0\r\nfor i in range(1,M+1):\r\n while len(lib[i])<t:\r\n j = others.pop()\r\n lib[i].append(j)\r\n A[j]=i\r\n ans+=1\r\n\r\nprint(t,ans)\r\nprint(*A)" ]

{"inputs": ["4 2\n1 2 3 2", "7 3\n1 3 2 2 2 2 1", "4 4\n1000000000 100 7 1000000000", "1 1\n1", "1 1\n381183829", "2 1\n234089514 461271539", "5 4\n3 1 495987801 522279660 762868488", "10 2\n20515728 1 580955166 856585851 1 738372422 1 2 1 900189620", "20 3\n3 2 2 3 3 3 2 3 3 3 2 748578511 149249674 844954396 321901094 3 255089924 244803836 3 943090472", "50 10\n820558149 7 10 7 9 9 7 7 7 9 7 10 8 8 10 8 6 8 9 9 8 971788012 9 8 9 10 6 5 871178015 4 10 5 7 9 10 9 10 4 643998638 8 10 9 10 766953454 5 9 10 10 8 10", "80 79\n17 59 54 75 68 69 69 67 62 77 65 78 54 69 59 73 68 57 65 54 66 46 68 68 67 65 75 39 62 63 45 78 72 62 78 34 74 68 78 68 79 60 64 56 68 76 66 44 43 69 74 75 44 66 71 78 41 75 71 77 59 56 78 52 61 64 64 53 79 34 79 79 65 45 79 67 65 78 68 74", "2 1\n1 1000000000", "9 2\n4681851 569491424 579550098 1 554288395 496088833 49710380 904873068 189406728", "7 4\n1 1 1 1 1 1 1", "10 4\n1 1 2 2 3 3 4 4 4 4", "9 5\n1 1 1 1 1 2 3 4 5", "5 4\n10 1 1 1 1", "4 2\n1 1 1 1", "7 3\n2 2 2 1 3 7 6", "8 3\n1 1 1 1 2 2 2 2", "12 4\n1 1 1 1 2 2 2 2 3 3 4 4", "7 2\n2 2 2 2 2 2 3", "6 3\n3 3 3 100 1 2", "13 4\n1 1 1 1 2 2 2 2 3 3 4 4 4", "10 2\n1 1 1 1 1 1 3 4 5 6"], "outputs": ["2 1\n1 2 1 2 ", "2 1\n1 3 3 2 2 2 1 ", "1 4\n1 2 3 4 ", "1 0\n1 ", "1 1\n1 ", "2 2\n1 1 ", "1 2\n3 1 2 4 762868488 ", "5 5\n1 1 2 2 1 2 1 2 1 2 ", "6 8\n2 2 2 3 3 3 2 3 3 3 2 1 1 1 1 3 1 1 3 2 ", "5 23\n1 2 4 2 3 3 7 7 7 3 7 4 2 2 5 2 6 8 3 3 8 1 4 8 9 5 6 5 1 4 6 5 7 9 6 9 6 4 1 8 10 9 10 1 5 9 10 10 8 10 ", "1 46\n17 7 4 36 22 29 30 20 9 40 13 42 5 31 8 73 23 57 14 54 18 46 24 25 21 15 37 39 10 63 3 47 72 62 48 1 33 26 49 27 55 60 11 6 28 76 19 2 43 69 35 38 44 66 32 50 41 75 71 77 59 56 51 52 61 12 64 53 58 34 70 79 16 45 79 67 65 78 68 74 ", "2 1\n1 1 ", "4 7\n1 1 1 1 2 2 2 2 189406728 ", "1 3\n2 3 4 1 1 1 1 ", "2 0\n1 1 2 2 3 3 4 4 4 4 ", "1 0\n1 1 1 1 1 2 3 4 5 ", "1 3\n2 3 4 1 1 ", "2 2\n2 2 1 1 ", "2 2\n2 2 2 1 3 1 3 ", "2 2\n3 3 1 1 2 2 2 2 ", "3 2\n3 1 1 1 4 2 2 2 3 3 4 4 ", "3 3\n1 1 2 2 2 2 1 ", "2 2\n2 3 3 1 1 2 ", "3 1\n3 1 1 1 2 2 2 2 3 3 4 4 4 ", "5 5\n2 1 1 1 1 1 2 2 2 2 "]}

UNKNOWN

PYTHON3

CODEFORCES

3

9220b32c3435f2ebc62e4b87277d09cc

Ciel and Robot

Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string *s*. Each character of *s* is one move operation. There are four move operations at all: - 'U': go up, (x, y) <=→<= (x, y+1); - 'D': go down, (x, y) <=→<= (x, y-1); - 'L': go left, (x, y) <=→<= (x-1, y); - 'R': go right, (x, y) <=→<= (x+1, y). The robot will do the operations in *s* from left to right, and repeat it infinite times. Help Fox Ciel to determine if after some steps the robot will located in (*a*,<=*b*). The first line contains two integers *a* and *b*, (<=-<=109<=≤<=*a*,<=*b*<=≤<=109). The second line contains a string *s* (1<=≤<=|*s*|<=≤<=100, *s* only contains characters 'U', 'D', 'L', 'R') — the command. Print "Yes" if the robot will be located at (*a*,<=*b*), and "No" otherwise. Sample Input 2 2 RU 1 2 RU -1 1000000000 LRRLU 0 0 D Sample Output Yes No Yes Yes

[ "#!/usr/bin/python3\nimport sys\n\nMAPPING = {\n 'U': (0, 1),\n 'D': (0, -1),\n 'L': (-1, 0),\n 'R': (1, 0),\n}\n\n\ndef read_ints():\n return [int(x) for x in input().split()]\n\n\ndef get_vectors(moves):\n vector = (0, 0)\n yield vector\n for move in moves:\n delta = MAPPING[move]\n vector = (vector[0] + delta[0], vector[1] + delta[1])\n yield vector\n\n\ndef mul(pair, a):\n return pair[0] * a, pair[1] * a\n\n\ndef is_achievable(diff, period):\n if diff == (0, 0):\n return True\n if period == (0, 0):\n return False\n if period[0] != 0:\n if diff[0] % period[0] == 0:\n times = diff[0] // period[0]\n if times > 0 and mul(period, times) == diff:\n return True\n if period[1] != 0:\n if diff[1] % period[1] == 0:\n times = diff[1] // period[1]\n if times > 0 and mul(period, times) == diff:\n return True\n return False\n\n\ndef main():\n a, b = read_ints()\n moves = input().strip()\n vectors = list(get_vectors(moves))\n period = vectors[-1]\n for vector in vectors:\n diff = (a - vector[0], b - vector[1])\n if is_achievable(diff, period):\n print('Yes')\n sys.exit(0)\n print('No')\n\n\nif __name__ == '__main__':\n main()\n", "#!/usr/bin/env python3\nimport operator\ntable = {\n 'U' : ( 0, 1),\n 'D' : ( 0, -1),\n 'L' : (-1, 0),\n 'R' : ( 1, 0) }\n\na, b = map(int,input().split())\ns = list(input())\n\nzs = set()\nx, y = 0, 0\nzs.add((x, y))\nfor c in s:\n x, y = map(operator.add, (x, y), table[c])\n zs.add((x, y))\n\nresult = False\nfor (zx, zy) in zs:\n p, q = a - zx, b - zy\n if (x == 0 and p != 0) or (x != 0 and p % x != 0) or (x != 0 and p // x < 0): continue\n if (y == 0 and q != 0) or (y != 0 and q % y != 0) or (y != 0 and q // y < 0): continue\n if x != 0 and y != 0 and p // x != q // y: continue\n result = True\n\nprint('Yes' if result else 'No')\n", "R = lambda: map(int, input().split())\r\na, b = R()\r\ncs = [[0, 0]]\r\nd = {'R': (1, 0), 'L': (-1, 0), 'U': (0, 1), 'D': (0, -1)}\r\nfor c in input():\r\n cs.append([cs[-1][0] + d[c][0], cs[-1][1] + d[c][1]])\r\npx, py = cs[-1][0], cs[-1][1]\r\nfor x, y in cs:\r\n k = 0\r\n if px:\r\n k = (a - x) // px\r\n elif py:\r\n k = (b - y) // py\r\n if k >= 0 and x + k * px == a and y + k * py == b:\r\n print('Yes')\r\n exit(0)\r\nprint('No')", "from math import hypot\r\na,b = map(int,input().split())\r\ns = input().strip()\r\ndx,dy = 0,0\r\nfor i in s:\r\n if dx==a and dy==b:\r\n print('Yes')\r\n exit()\r\n if i =='R':\r\n dx+=1\r\n if i=='L':\r\n dx-=1\r\n if i=='D':\r\n dy-=1\r\n if i=='U':\r\n dy+=1\r\n if dx==a and dy==b:\r\n print('Yes')\r\n exit(0)\r\nif dx==dy==0:\r\n print('No')\r\n exit(0)\r\nlngt = int(max(0,hypot(a,b)/hypot(dx,dy)-500))\r\nx,y = dx*lngt,dy*lngt\r\nfor j in range(1000):\r\n for i in s:\r\n if x==a and y==b:\r\n print('Yes')\r\n exit(0) \r\n if i =='R':\r\n x+=1\r\n if i=='L':\r\n x-=1\r\n if i=='D':\r\n y-=1\r\n if i=='U':\r\n y+=1 \r\n if x==a and y==b:\r\n print('Yes')\r\n exit(0) \r\nprint('No')\r\n \r\n", "a,b=input().split()\n\na=int(a)\nb=int(b)\n\ns=input()\nn=len(s)\nL=[]\n\nx=0\ny=0\nhor=s.count('R')-s.count('L')\nver=s.count('U')-s.count('D')\nL=[[0,0]]\nfor i in range(n):\n if(s[i]=='U'):\n y+=1\n elif(s[i]=='D'):\n y-=1\n elif(s[i]=='R'):\n x+=1\n else:\n x-=1\n L.append([x,y])\nk=True\nfor i in range(n+1):\n x=L[i][0]\n y=L[i][1]\n if(hor==0 and ver==0 and x==a and b==y):\n print('Yes')\n k=False\n break\n elif(hor==0 and ver!=0 and x==a and (b-y)%ver==0 and (b-y)*ver>=0):\n print('Yes')\n k=False\n break\n elif(ver==0 and hor!=0 and y==b and (a-x)%hor==0 and (a-x)*hor>=0):\n print('Yes')\n k=False\n break\n elif(ver!=0 and hor!=0 and(b-y)%ver==0 and ver*(b-y)>=0 and (a-x)%hor==0 and hor*(a-x)>=0 and(b-y)//ver==(a-x)//hor):\n print('Yes')\n k=False\n break\n\nif(k):\n print('No')\n\n \n", "def main():\n a, b = map(int, input().split())\n steps, t = [((-1, 1, 0)[\"LR\".find(c)], (-1, 1, 0)[\"DU\".find(c)]) for c in input()], -25\n x = sum(e[0] for e in steps)\n y = sum(e[1] for e in steps)\n if x and y:\n t += min(a // x, b // y)\n elif x:\n t += a // x\n elif y:\n t += b // y\n if t > 0:\n a -= t * x\n b -= t * y\n for _ in range(26):\n for dx, dy in steps:\n if not (a or b):\n print(\"Yes\")\n return\n a -= dx\n b -= dy\n print(\"No\")\n\n\nif __name__ == '__main__':\n main()\n", "go = {'U' : (0, 1), 'D' : (0, -1), 'R' : (1, 0), 'L' : (-1, 0)}\r\na, b = map(int, input().split())\r\ns = input()\r\ndx = dy = x = y = cx = cy = 0\r\nfor c in s: \r\n dx += go[c][0]\r\n dy += go[c][1]\r\nans = a == b == 0\r\nfor c in s:\r\n x += go[c][0]\r\n y += go[c][1]\r\n cx, cy = a - x, b - y\r\n flg = False\r\n if dx: flg = not cx % dx and cx // dx >= 0\r\n else: flg = not cx\r\n if dy: flg = flg and not cy % dy and cy // dy >= 0\r\n else: flg = flg and not cy\r\n flg = flg and (not dx or not dy or cx // dx == cy // dy)\r\n if flg:\r\n ans = True\r\n break\r\nprint(\"Yes\" if ans else \"No\")\r\n ", "fx, fy = map(int, input().split())\r\ns = input()\r\ndx = dy= 0\r\ndistance_chunks=[[0,0]]\r\nn = len(s)\r\n\r\nfor c in s:\r\n if(c=='L'): dx-=1\r\n elif(c=='R'): dx+=1\r\n elif(c=='U'): dy+=1\r\n elif(c=='D'): dy-=1\r\n distance_chunks.append([dx,dy])\r\n#print(distance_chunks)\r\ndxmax, dymax = distance_chunks[-1][0], distance_chunks[-1][1]\r\n\r\nfor i in range(n):\r\n k=0\r\n if dxmax:\r\n k = (fx - distance_chunks[i][0]) // dxmax\r\n \r\n elif dymax:\r\n k = (fy - distance_chunks[i][1]) // dymax\r\n \r\n #print(k, dxmax, dymax)\r\n \r\n if(k>=0 and k*dxmax == fx - distance_chunks[i][0] and k*dymax == fy - distance_chunks[i][1]):\r\n print(\"Yes\")\r\n exit()\r\n\r\n\r\nprint(\"No\")\r\n\r\n" ]

{"inputs": ["2 2\nRU", "1 2\nRU", "-1 1000000000\nLRRLU", "0 0\nD", "0 0\nUURRDL", "987654321 987654321\nUURRDL", "4 2\nUURRDL", "4 3\nUURRDL", "4 4\nUURRDL", "4 6\nUURRDL", "4 7\nUURRDL", "1000000000 1000000000\nUURRDL", "-1 -1\nUR", "1 1\nUURRDDLL", "987654321 2\nUURDD", "0 123456789\nRRULL", "4 4\nUUUURRRRDDDDLLLL", "-491226083 -49122610\nUDRLDURLDLLLDUDURLRDUUDDUUULUDRDRDUULURDRLLDDDLUDUURLUUDLLDULLLLDDLDDUU", "-261597957 418556728\nLLLDLUDUULLRDDULLRRUDRDLULRLRLLRRUUDRRLRUDLRRLUDRDLLUUDUULRURLDLULUUULDDUURLRUDURRL", "-771928144 -3\nRUDULULDRDLLLULDDUDDDDUDULRULRUULDDDURUDLUURULLLDLLDDRDDRLRURUULRUURRUDLDLDDRLLULRRDRRLLUULUDRUUDRRD", "397346346 1\nDDURRUURLDLRRLULD", "-528551525 0\nUDRLRRLDLDLURRRRULDLRLRLURUUDDLRLLDRRULLUDLURDLUUULLLRUUUDRRURLDUDULDDRDDDRDL", "311692421 -129871846\nLLLDURULDDDDUDDURRLUUDRLDDRDURDDRUDUURLUDUDLDRUDDDUUURDRRUDRDRDURLLDURUUDRLDLDURRRRRRDULURDRU", "485940814 728911221\nURURU", "-843450986 632588242\nLURLULULRUDUDULRDDLUL", "647999516 -809999401\nUDLDDLLULUDDLLDUULRRRDLUDDLDDLRLRRDRURURDRRDRULUDRDULRULLRRLLDDRLRRUDRURDUULUDLRRLRDR", "352820537 -764444491\nRDDUDLUDDUDLRRRDRRRDRRDUDUDDURLRRLDRLLRLLLLUULUDRURRDRLDDLLDRDURDUDRUDDLUDRLURUDRURDRDDLDRLDLDLLU", "-284973644 -1\nDLULLDLRUUDRR", "356922591 -2\nRRLDLDUDRUUUULUUDDULDDUDD", "27033101 54066203\nUDDDRDLLLRUUDDLRDLDRLRUDDULRLLRULR", "-199335150 39867031\nLLURRDUULRUDDRDUUULDLDRDDLURDRLDRLLLRRRRRULRRRUUDD", "609504072 609504074\nULRLUDLDDR", "497684357 829473929\nRRLDUUURULURRLLRRLRLURRLDU", "551922835 183974295\nDUDUUULDRLRURRDULRRUDDLRLLUULLRLRDRDRR", "825368095 -825368096\nRD", "-458990423 -229495204\nDLLDDRLUDLRLUL", "285102789 570205594\nRRDULRULULRRDUURRLURUDDULLRDUL", "109928480 219856920\nLRURLRLURDRDLDRDLRDDUUDDLULDRRUUURRUDLLUULUUUR", "-532674020 532674026\nUURLLL", "999999999 0\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "0 0\nUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLR", "1 1\nUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLRUDLR", "-1000000000 -1000000000\nDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDLDL", "3 3\nUURR", "-2 -2\nUR", "5 5\nUDLR", "0 -1\nU", "-1 0\nR", "1000000000 1000000000\nURURURUR", "-1 -1\nRU", "1 1\nLD", "-2 -2\nUURR", "1000000000 0\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR", "2 6\nRUUUURLDDDL", "0 1\nLUUR", "1 1\nURDLDL", "-10 -10\nRU", "1000000000 1000000000\nRURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURURU", "-1000000000 -500000000\nURR", "-2 0\nULLLDDRRRR", "999999999 -999999999\nRRRRRRRRRRRRRRRRRRRRRRRRRDDDDDDDDDDDDDDDDDDDDDDDDDLLLLLLLLLLLLLLLLLLLLLLLUUUUUUUUUUUUUUUUUUUUUUU", "-100 -100\nRU", "100 100\nRUL", "0 1\nUDLR", "0 1\nD", "0 -3\nRDDL"], "outputs": ["Yes", "No", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "Yes", "Yes", "No", "Yes", "No", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "No", "No", "No", "No", "Yes", "No", "No", "No", "No", "No", "No", "Yes", "Yes", "No", "Yes", "No", "No", "No", "No", "No", "Yes", "No", "No", "No", "Yes", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "Yes", "No", "No", "Yes", "No", "No"]}

UNKNOWN

PYTHON3

CODEFORCES

8

9220f6088bde1e658f48d2c43eca3a2e

Transformation: from A to B

Vasily has a number *a*, which he wants to turn into a number *b*. For this purpose, he can do two types of operations: - multiply the current number by 2 (that is, replace the number *x* by 2·*x*); - append the digit 1 to the right of current number (that is, replace the number *x* by 10·*x*<=+<=1). You need to help Vasily to transform the number *a* into the number *b* using only the operations described above, or find that it is impossible. Note that in this task you are not required to minimize the number of operations. It suffices to find any way to transform *a* into *b*. The first line contains two positive integers *a* and *b* (1<=≤<=*a*<=<<=*b*<=≤<=109) — the number which Vasily has and the number he wants to have. If there is no way to get *b* from *a*, print "NO" (without quotes). Otherwise print three lines. On the first line print "YES" (without quotes). The second line should contain single integer *k* — the length of the transformation sequence. On the third line print the sequence of transformations *x*1,<=*x*2,<=...,<=*x**k*, where: - *x*1 should be equal to *a*, - *x**k* should be equal to *b*, - *x**i* should be obtained from *x**i*<=-<=1 using any of two described operations (1<=<<=*i*<=≤<=*k*). If there are multiple answers, print any of them. Sample Input 2 162 4 42 100 40021 Sample Output YES 5 2 4 8 81 162 NO YES 5 100 200 2001 4002 40021

[ "def fc(a,b,re,bl,tmp):\r\n if(a>b):\r\n return\r\n if(a==b):\r\n bl[0]=False\r\n # tmp.append(a)\r\n re.append(tmp)\r\n return\r\n if(bl[0]):\r\n \r\n \r\n fc(a*2,b,re,bl,tmp+[a*2])\r\n fc(a*10+1,b,re,bl,tmp+[a*10+1])\r\nre=[]\r\nbl=[True]\r\n# fc(2,162,re,bl,[])\r\na,b=map(int,input().split())\r\nfc(a,b,re,bl,[])\r\nif(len(re)==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(1+len(re[0]))\r\n ans=[[a]+re[0]]\r\n print(a,end=\" \")\r\n for i in re[0]:\r\n print(i,end=\" \")\r\n print()", "a, b = map(int, input().split())\r\n\r\nseq = []\r\n\r\ndef d(s):\r\n if s > b:\r\n return False\r\n if s == b:\r\n return True\r\n \r\n for i in range(2):\r\n if i==0:\r\n hit = d(2*s)\r\n if hit:\r\n seq.append(2*s)\r\n return True\r\n \r\n if i == 1:\r\n hit = d(10*s +1)\r\n if hit:\r\n seq.append(10*s + 1)\r\n return True\r\nd(a) \r\nif len(seq) > 0:\r\n print(\"YES\")\r\n # seq += [a]\r\n seq.append(a)\r\n print(len(seq))\r\n \r\n for i in reversed(seq):\r\n print(i, end = \" \")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "a, b = list(map(int, input().split()))\n\nlista = []\nlista.append(b)\nflag = False\n\nwhile a <= b:\n # print(\"~~\", a, b)\n if a == b:\n flag = True\n break\n elif b % 2 == 0:\n b = b // 2\n lista.append(b)\n elif b % 10 == 1:\n b = (b - 1) // 10\n lista.append(b)\n else:\n break\n\nif not (flag):\n print(\"NO\")\nelse:\n rev = reversed(lista)\n print(\"YES\")\n print(len(lista))\n print(*rev)\n\n \t \t\t\t \t \t\t \t\t \t\t\t \t\t\t", "\r\nimport math\r\nfrom math import gcd,floor,sqrt,log\r\ndef iin(): return int(input())\r\ndef sin(): return input().strip()\r\ndef listin(): return list(map(int,input().strip().split()))\r\ndef liststr(): return list(map(str,input().strip().split()))\r\ndef ceill(x): return int(x) if(x==int(x)) else int(x)+1\r\ndef ceilldiv(x,d): x//d if(x%d==0) else x//d+1\r\ndef LCM(a,b): return (a*b)//gcd(a,b)\r\n\r\n\r\ndef solve():\r\n a,b = listin()\r\n temp = [b]\r\n while b>=a:\r\n if b==a:\r\n break\r\n if str(b)[-1]=='1':\r\n b = int(str(b)[:len(str(b))-1])\r\n temp.append(b)\r\n elif b%2==0:\r\n b//=2\r\n temp.append(b)\r\n else:\r\n print(\"NO\")\r\n # print(temp,b)\r\n return\r\n if b==a:\r\n print(\"YES\")\r\n print(len(temp))\r\n for i in range(len(temp)-1,-1,-1):\r\n print(temp[i],end = \" \")\r\n else:\r\n print(\"NO\")\r\n # print(temp,b)\r\n \r\nt = 1 \r\n# t = int(input()) \r\nfor hula in range(t):\r\n\tsolve()\r\n", "a, b = map(int, input().split())\nA = [b]\nwhile b > a:\n if b % 2 == 0:\n b //= 2\n elif b % 10 == 1:\n b //= 10\n else:\n break\n A.append(b)\nif A[-1] == a:\n print('YES')\n print(len(A))\n print(*A[::-1])\nelse:\n print('NO')", "n, alvo = map(int,input().split())\n\nlista = []\ndef func(val):\n if val > alvo:\n return False\n if val == alvo:\n lista.append(val)\n return True\n \n if func(10*val + 1) or func(2*val):\n lista.append(val)\n return True\n \n return False\n\nif func(n):\n print(f'YES\\n{len(lista)}')\n print(*lista[::-1])\nelse:\n print('NO')\n\n \t \t\t \t \t \t\t \t \t\t\t\t \t\t\t\t", "n = []\r\n\r\n\r\ndef a_to_b(a, b):\r\n if b % 2 == 0:\r\n b = b / 2\r\n if b >= a:\r\n n.insert(0, int(b))\r\n a_to_b(a, b)\r\n\r\n elif b % 10 == 1:\r\n b = b // 10\r\n if b >= a:\r\n n.insert(0, int(b))\r\n a_to_b(a, b)\r\n\r\n\r\na, b = map(int, input().split())\r\na_to_b(a, b)\r\nn.append(b)\r\nif a in n:\r\n print(\"YES\")\r\n print(len(n))\r\n print(\" \".join(map(str, n)))\r\nelse:\r\n print(\"NO\")\r\n", "a,b=map(int,input().split())\r\nqueue=[a]\r\nflag=0\r\ndict={a:1}\r\nwhile len(queue)>0:\r\n if(queue[0]==b):\r\n flag=1\r\n break\r\n if(queue[0]*2<=b):\r\n queue.append(queue[0]*2)\r\n dict[queue[0]*2]=1\r\n if(queue[0]*10+1<=b):\r\n queue.append(queue[0]*10+1)\r\n dict[queue[0]*10+1]=1\r\n queue.pop(0)\r\nx=b\r\nstack=[b]\r\nadd=0\r\nwhile(x>a and flag==1):\r\n if((x-1)%10==0 and (x-1)//10 in dict):\r\n stack.append((x-1)//10)\r\n x=(x-1)//10\r\n add+=1\r\n elif(x%2==0 and (x//2) in dict):\r\n stack.append(x//2)\r\n x=x//2\r\n add+=1\r\nstack.append(a)\r\nif(flag==0):\r\n print(\"NO\")\r\nelse:\r\n i=add\r\n print(\"YES\")\r\n print(add+1)\r\n for j in range(i,-1,-1):\r\n print(stack[j],end=' ')\r\n", "def f(l):\r\n u = l[-1]\r\n if u > l[0]:\r\n if u % 10 == 1:\r\n l.append(u // 10)\r\n f(l)\r\n elif not u % 2:\r\n l.append(u // 2)\r\n f(l)\r\n \r\nl = list(map(int, input().split()))\r\nf(l)\r\nif l.pop(0) == l[-1]:\r\n print(\"YES\", len(l), sep='\\n')\r\n print(*l[::-1])\r\nelse:\r\n print(\"NO\")", "def fun(x, y, d):\r\n d.append(y)\r\n if x == y:\r\n return True\r\n elif y % 10 == 1:\r\n return fun(x, y // 10, d)\r\n elif y % 2 == 0 and y != 0:\r\n return fun(x, y // 2, d)\r\n else:\r\n return False\r\n\r\n\r\na, b = map(int, input().split())\r\nd = []\r\nif fun(a, b, d):\r\n print(\"YES\")\r\n print(len(d))\r\n print(*d[::-1])\r\nelse:\r\n print(\"NO\")\r\n", "import fractions\r\nimport gc\r\nimport heapq\r\nimport itertools\r\nfrom itertools import combinations, permutations\r\nimport math\r\nimport random\r\nfrom collections import Counter, deque, defaultdict\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nimport threading\r\nfrom heapq import *\r\nfrom fractions import Fraction\r\nfrom bisect import bisect_left, bisect_right\r\n\r\n\r\ndef S():\r\n\treturn sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n\treturn [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n\treturn int(sys.stdin.readline())\r\n\r\n\r\ndef IS():\r\n\treturn sys.stdin.readline().replace('\\n', '')\r\n\r\n\r\ndef main():\r\n\ta, b = I()\r\n\tqueue = deque([a])\r\n\td = {}\r\n\tans = 'NO'\r\n\twhile queue:\r\n\t\tv = queue.pop()\r\n\t\tif v == b:\r\n\t\t\tans = 'YES'\r\n\t\t\tbreak\r\n\t\tif 2 * v <= b:\r\n\t\t\td[2 * v] = v\r\n\t\t\tqueue.append(2 * v)\r\n\t\tif 10 * v + 1 <= b:\r\n\t\t\td[10 * v + 1] = v\r\n\t\t\tqueue.append(10 * v + 1)\r\n\tprint(ans)\r\n\tif ans == 'YES':\r\n\t\tg = [b]\r\n\t\tlast = b\r\n\t\twhile last > a:\r\n\t\t\tlast = d[last]\r\n\t\t\tg.append(last)\r\n\t\tprint(len(g))\r\n\t\tprint(*g[::-1])\r\n\t\r\n\t\r\nif __name__ == '__main__':\r\n\t# for _ in range(II()):\r\n\t# \tmain()\r\n\tmain()\r\n\t", "c=[0]\r\ndef func(a,b,l):\r\n if(a==b):\r\n c[0]=1\r\n print(\"YES\")\r\n print(len(l))\r\n print(*l)\r\n if(a>b):\r\n return\r\n f1=2*a\r\n f2=10*a+1\r\n func(f1,b,l+[f1])\r\n func(f2,b,l+[f2])\r\n\r\na,b=map(int,input().split())\r\nl=[a]\r\nl1=func(a,b,l)\r\nif(c[0]==0):\r\n print(\"NO\")", "a, b = [int(i) for i in input().split()]\r\np = []\r\np.append(b)\r\nk = 1\r\nwhile b > a:\r\n\tif b % 2 == 0:\r\n\t\tk += 1\r\n\t\tp.append(b//2)\r\n\t\tb //= 2\r\n\telif b % 10 == 1:\r\n\t\tk += 1\r\n\t\tp.append((b-1)//10)\r\n\t\tb -= 1\r\n\t\tb //= 10\r\n\telse:\r\n\t\tbreak\r\nif b == a:\r\n\tprint('YES')\r\n\tprint(k)\r\n\tp.reverse()\r\n\tp = [str(i) for i in p]\r\n\tprint(' '.join(p))\r\nelse:\r\n\tprint('NO')\r\n\t", "a,b = map(int,input().split())\r\nlst = []\r\nwhile b > a:\r\n lst.append(b)\r\n if str(b)[-1] == '1':\r\n b = int(str(b)[:-1])\r\n else:\r\n if b%2 == 0:\r\n b //= 2\r\n else:\r\n print('NO')\r\n exit()\r\n \r\nlst.append(a)\r\nif b == a:\r\n print('YES')\r\n print(len(lst))\r\n print(*lst[::-1])\r\nelse:\r\n print('NO')", "def from_a_2_b(a, b):\r\n count = 1\r\n nums = [b]\r\n\r\n while(a < b):\r\n if b % 2 == 0:\r\n b = b / 2\r\n count += 1\r\n nums.insert(0, int(b))\r\n elif b % 10 == 1:\r\n b = b // 10\r\n count += 1\r\n nums.insert(0, int(b))\r\n else:\r\n b = 0\r\n\r\n if(a != b):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n print(count)\r\n print(\" \".join(map(str, nums)))\r\n\r\n\r\na, b = map(int, input().split())\r\nfrom_a_2_b(a, b)\r\n", "a,b = map(int, input().split())\r\n\r\nso = []\r\ndef f(x):\r\n if x == b:\r\n so.append(b)\r\n return True\r\n if x > b:\r\n return False\r\n else:\r\n return f(x*2) or f(x*10 + 1)\r\n\r\nif f(a) == False:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n x = b\r\n while x > a:\r\n if x % 2 == 0:\r\n so.append(x//2)\r\n x = x//2\r\n else:\r\n so.append((x-1)//10)\r\n x = (x-1)//10\r\n print(len(so))\r\n so.reverse()\r\n print(*so,sep=' ')", "a, b = map(int, input().split())\n \narr = [b] \nwhile b > a:\n if (b % 10) == 1:\n b //= 10\n arr.append(b)\n elif (b % 2 == 0):\n b //= 2\n arr.append(b)\n else:\n print('NO')\n exit()\n \nif b == a:\n print('YES')\n print(len(arr))\n for i in reversed(arr):\n print(i, end=\" \")\nelse:\n print ('NO')\n\t\t\t\t \t \t \t\t\t\t \t \t \t \t \t\t", "def 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\na,b=getint()\r\nans=[]\r\nres=[]\r\nflag=1\r\ndef dfs(x,ans):\r\n xx=ans.copy()\r\n global flag,res\r\n #print(ans)\r\n if x>b:\r\n return\r\n if x==b:\r\n flag=0\r\n res=xx\r\n return xx\r\n dfs(2*x,ans+[2*x])\r\n dfs(10*x+1,ans+[10*x+1])\r\n\r\n \r\nans=dfs(a,[a])\r\nif flag==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(res))\r\n print(*res)\r\n#solve()\r\n#S()", "a, b = map(int, input().split())\r\nresult = [b]\r\n\r\nwhile (b > a):\r\n if (b % 2 == 0):\r\n b //= 2\r\n result.append(b)\r\n elif (b % 10 == 1):\r\n b //= 10\r\n result.append(b)\r\n else:\r\n break\r\n\r\nif (b == a):\r\n print('YES')\r\n print(len(result))\r\n print(*reversed(result))\r\nelse:\r\n print('NO')", "n, k = map(int, input().split())\r\nans = [k]\r\nflag = False\r\nwhile k > 0:\r\n if k == n:\r\n flag = True\r\n break\r\n else:\r\n if k % 2 == 0:\r\n k = k // 2\r\n ans.append(k)\r\n else:\r\n if k % 10 == 1:\r\n k = str(k)\r\n k = k[:-1]\r\n if k == \"\":\r\n k = -1\r\n continue\r\n else:\r\n k = int(k)\r\n ans.append(k)\r\n else:\r\n break\r\nif flag == False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(ans))\r\n print(*ans[::-1])\r\n", "#a, b = map(int,input().split())\r\n#x = 0\r\n#e = b\r\n#if b % a == 0:\r\n# print(\"YES\")\r\n# while b // a != a:\r\n# b = b // a\r\n # x = x + 1\r\n # if b // a == a:\r\n # print(x)\r\n # print(e, end=\" \")\r\n # e = e / 2\r\n # print(i, end=\" \")\r\n # if e == a:\r\n # break\r\n\r\na,b=map(int,input().split())\r\nl=[b]\r\nflag=False\r\nwhile a<=b:\r\n if b==a:\r\n print(\"YES\")\r\n print(len(l))\r\n print(*reversed(l)) \r\n flag=True\r\n break\r\n elif b%2 ==0:\r\n b = b//2\r\n l.append(b)\r\n elif b%10 ==1:\r\n b =(b-1)//10\r\n l.append(b)\r\n else:\r\n break\r\nif not flag:\r\n print(\"NO\") \r\n", "def transform_from_a_to_b(sequence, a, b):\n if(a==b):\n print('YES')\n print(len(sequence))\n print(' '.join(map(str,sequence)))\n success=1\n raise SystemExit\n if(a>b):\n return\n transform_from_a_to_b(sequence + [a*2], a*2, b)\n transform_from_a_to_b(sequence + [10*a + 1], 10*a + 1, b)\n\na, b = map(int, input().split())\ntransform_from_a_to_b([a], a, b)\nprint('NO')\n\t \t\t \t \t\t\t \t\t\t \t \t\t \t\t\t", "# Mateus Brito de Sousa Rangel - 117110914\n \ndef solve(a, b, l):\n if(a > b):\n return False\n if a == b:\n return True\n \n x = solve(a * 2, b, l)\n y = solve(a * 10 + 1, b, l)\n \n if x or y:\n arr.append(a)\n \n return x | y\n\nInput = map(int, input().split())\n \nn, m = list(Input)\narr = []\n \nif solve(n, m, arr):\n print(\"YES\")\n arr.reverse()\n arr.append(m)\n print(len(arr))\n \n for i in arr:\n print(i, end=\" \")\n\nelse:\n print(\"NO\")\n\n \t\t \t \t \t\t\t \t \t\t \t\t \t \t\t", "a, b = map(int, input().split())\npre = {}\nf = [a]\nwhile f:\n v = f.pop(0)\n if 2*v not in pre and 2*v <= b:\n f.append(2*v)\n pre[2*v] = v\n if 10*v+1 not in pre and 10*v+1 <= b:\n f.append(10*v+1)\n pre[10*v+1] = v\n \nsq = [b]\nif b not in pre:\n print(\"NO\")\nelse:\n print(\"YES\")\n x = b\n while x != a:\n x = pre[x]\n sq.append(x)\n print(len(sq))\n for i in sq[::-1]:\n print(i, end=\" \")\n print()\n \t \t \t\t\t \t\t \t\t \t \t", "number1,number2=map(int, input().split())\narray=[]\narray.append(number2)\nwhile number2 > number1:\n if (number2 % 10==1):\n number2 //= 10\n elif (number2 % 2==0):\n number2 //= 2\n else:\n break\n array.append(number2)\nif number2 != number1:\n print('NO')\nelse:\n array.reverse()\n print('YES')\n print(len(array))\n print(*array)\n\t\t\t \t\t\t \t\t \t\t\t\t\t\t\t\t \t\t \t", "def aMagica_acontece(a, b):\n\n if a == b: return True\n elif a > b: return False\n else:\n \n if aMagica_acontece(int(f'{a}1'), b) or aMagica_acontece(a*2, b):\n operacoes.append(str(a))\n return True\n \n return False\n\noperacoes: list = []\nn1m, n2m = map(int, input().split())\n\nif aMagica_acontece(n1m, n2m):\n \n operacoes.append(str(n2m))\n operacoes.sort(key=int)\n print('YES')\n print(len(operacoes))\n print(' '.join(operacoes))\n \nelse: print('NO')\n\n\t \t \t \t\t\t \t\t\t \t \t \t\t \t \t", "a,b = map(int, input().split())\r\n\r\ndef transformation(x,y, sequence):\r\n new_list = sequence[:]\r\n if (x == y):\r\n new_list.append(x)\r\n return new_list\r\n elif (x > y):\r\n return False\r\n else:\r\n new_list.append(x)\r\n return transformation(2*x, y, new_list) or transformation(10*x + 1, y, new_list)\r\n\r\nresult = transformation(a,b,[])\r\nif(result == False):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(result))\r\n response = \"\"\r\n for i in result:\r\n response += str(i) + \" \"\r\n print(response)\r\n", "a,b=map(int,input().split())\r\ndef dfs(x,arr):\r\n if x==b:\r\n print(\"YES\")\r\n print(len(arr))\r\n print(*arr)\r\n exit()\r\n elif x>b:\r\n return\r\n else:\r\n dfs(2*x,arr+[2*x])\r\n dfs(10*x+1,arr+[10*x+1])\r\ndfs(a,[a])\r\nprint(\"NO\")", "X = list(map(int, input().split()))\r\nAnswer = [X[0]]\r\nCheck = False\r\n\r\n\r\ndef DFS(Num, Type):\r\n if Num > X[1]:\r\n return\r\n if Num == X[1]:\r\n Check = True\r\n print(\"YES\")\r\n print(len(Answer))\r\n print(*Answer)\r\n exit()\r\n Num = (Num * 2 if Type == 0 else Num * 10 + 1)\r\n Answer.append(Num)\r\n DFS(Num, 0)\r\n Answer.pop()\r\n Answer.append(Num)\r\n DFS(Num, 1)\r\n Answer.pop()\r\n\r\n\r\nDFS(X[0], 0)\r\nDFS(X[0], 1)\r\nprint(\"NO\")\r\n", "a, b = map(int, input().split())\n\nlista = [b]\n\n\nwhile (b != a):\n\tif (b % 10 == 1):\n\t\tb //= 10\n\telif (b % 2 == 0 and b > 0):\n\t\tb //= 2\n\telse:\n\t\tbreak\n\n\tlista.append(b)\n\nif (a == b):\n\t\n\tlista.reverse()\n\tprint('YES')\n\tprint(len(lista))\n\n\tfor i in lista:\n\t\tprint(i, end = ' ')\nelse:\n\tprint('NO')\n\t\t\t\t\t \t\t\t \t \t \t \t\t\t\t \t\t \t \t", "a,b=list(map(int,input().split()))\r\ny=''\r\nl=[b]\r\nwhile b!=a:\r\n if a>b:\r\n y='NO'\r\n break\r\n if b%2==0:\r\n b=int(b/2)\r\n if b==a:\r\n l.append(b)\r\n break\r\n else:\r\n l.append(b)\r\n elif str(b)[-1]=='1':\r\n b=str(b)[:-1]\r\n b=int(b)\r\n l.append(b)\r\n else:\r\n y='NO'\r\n break\r\nif y=='NO':\r\n print(y)\r\nelse:\r\n print(\"YES\")\r\n print(len(l))\r\n print(*l[::-1])", "a, b = map(int,input().split())\r\nans, f = [b], 0\r\nwhile True:\r\n if b<a:\r\n break\r\n if a==b:\r\n f = 1\r\n break\r\n if b%2==0:\r\n b//=2\r\n ans.append(b)\r\n else:\r\n if b%10==1:\r\n b//=10\r\n ans.append(b)\r\n else:\r\n break\r\n\r\nif f==1:\r\n print('YES')\r\n print(len(ans))\r\n print(*ans[::-1])\r\nelse:\r\n print('NO')", "from collections import deque\n \na,b = list(map(int,input().split()))\nvisited = {}\nq = deque([a])\nwhile len(q) > 0:\n v = q.popleft()\n w = 2*v\n x = 10*v + 1\n if w not in visited and w <= b:\n q.append(w)\n visited[w] = v\n if x not in visited and x <= b:\n q.append(x)\n visited[x] = v\npath = [b]\nif b not in visited:\n print(\"NO\")\nelse:\n print(\"YES\")\n node = b\n while node > a:\n node = visited[node]\n path.append(node)\n print(len(path))\n out = \"\"\n for i in range(len(path)-1,-1,-1):\n out += f\"{path[i]}\"\n if i > 0:\n out += \" \"\n print(out)\n \t\t \t\t\t\t\t\t\t \t \t\t \t\t", "import queue\n\na, b = map(int, input().split())\nfila = queue.Queue()\npre = {}\n\nfila.put(a)\n\nwhile fila.qsize() > 0:\n v = fila.get()\n if 2*v not in pre and 2*v <=b:\n fila.put(2*v)\n pre[2*v] = v\n if 10*v+1 not in pre and 10*v+1 <=b:\n fila.put(10*v+1)\n pre[10*v+1] = v\n\nans = [b]\n\nif b in pre:\n while pre[ans[-1]] in pre:\n ans.append(pre[ans[-1]])\n ans.append(a)\n\n print(\"YES\")\n print(len(ans))\n print(*ans[::-1])\nelse:\n print(\"NO\")\n\n\n \t \t \t \t\t\t\t\t \t\t\t \t\t \t \t", "buf = []\r\n\r\ndef cal(b, a):\r\n buf.append(b)\r\n if a == b:\r\n return True\r\n elif b < a:\r\n return False\r\n elif b % 2 == 0:\r\n return cal(b // 2, a)\r\n elif b % 10 == 1:\r\n return cal((b - 1) // 10, a)\r\n\r\na, b = map(int, input().split())\r\nif cal(b, a):\r\n print('YES')\r\n print(len(buf))\r\n print(' '.join(str(x) for x in buf[::-1]))\r\nelse:\r\n print('NO')", "input_ = input().split()\n\na, b = int(input_[0]),int(input_[1])\n\nsolutions = [b]\n\nwhile (b > 0):\n if (b % 2 == 0):\n b = b / 2\n solutions.append(b)\n\n elif ((b-1) % 10 == 0):\n b = (b - 1) / 10\n solutions.append(b)\n\n else:\n break\n\n if (a == b):\n break\n\nif (solutions[-1] != a):\n print('NO')\nelse:\n print('YES')\n print(len(solutions))\n result = \"\"\n for i in range(len(solutions) -1, -1, -1):\n result += str(int(solutions[i]))\n if(i < (len(solutions))):\n result += \" \"\n print(result)\n\t\t \t \t \t\t \t \t \t \t \t \t \t\t\t\t \t\t", "from collections import deque\n\na, b = map(int, input().split())\nstart = {}\nqueue = deque([a])\n\nwhile queue:\n value = queue.popleft()\n\n if 2 * value not in start and 2 * value <= b:\n queue.append(2 * value)\n start[2 * value] = value\n if 10 * value + 1 not in start and 10 * value + 1 <= b:\n queue.append(10 * value + 1)\n start[10 * value + 1] = value\n\nseq = [str(b)]\n\nif b not in start:\n print(\"NO\")\nelse:\n print(\"YES\")\n x = b\n while x != a:\n x = start[x]\n seq.append(str(x))\n\n print(len(seq))\n print(' '.join(seq[::-1]))\n\n\n\t \t \t\t\t \t \t\t\t \t\t\t\t\t \t\t \t", "m,n=map(int,input().split())\r\nmylist=[]\r\nflag=True\r\nmylist.append(n)\r\nwhile n>=m:\r\n if n%2==0:\r\n n=int(n/2)\r\n mylist.append(n)\r\n else:\r\n n=n-1\r\n if n%10!=0:\r\n flag=False\r\n break\r\n else:\r\n n=int(n/10)\r\n mylist.append(n)\r\n \r\n \r\n if n==m:\r\n break\r\nif m==mylist[-1] and flag==True:\r\n print(\"YES\")\r\n print(len(mylist))\r\n mylist=mylist[::-1]\r\n for num in mylist:\r\n print(num,end=\" \")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n ", "def isEndingone(num):\r\n return str(num)[-1] == '1'\r\n\r\ndef solve():\r\n a, b = map(int, input().split())\r\n arr = [b]\r\n while b > a:\r\n if not isEndingone(b) and b & 1:\r\n print(\"NO\")\r\n return\r\n if isEndingone(b):\r\n b = (b-1)//10\r\n else:\r\n b//=2\r\n arr.append(b)\r\n if arr[-1] != a:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n print(len(arr))\r\n print(*arr[::-1])\r\n\r\nsolve()\r\n", "a,b=map(int,input(\"\").split())\noplst=[]\noplst.append(b)\nfor i in range(b):\n if(b%10==1):\n b=b//10\n oplst.append(b)\n if(b==a):\n print(\"YES\")\n print(len(oplst))\n oplst.reverse()\n print(*oplst, sep=\" \")\n break\n elif(b<a):\n print(\"NO\")\n break\n elif(b%2==0):\n b=b//2\n oplst.append(b)\n if(b==a):\n print(\"YES\")\n print(len(oplst))\n oplst.reverse()\n print(*oplst, sep=\" \")\n break\n elif(b<a):\n print(\"NO\")\n break\n else:\n print(\"NO\")\n break\n \t\t \t\t \t \t\t \t\t \t \t\t \t \t \t", "a,b=map(int,input().split())\r\nres=[b]\r\nwhile(b>a):\r\n if(b%2==0):\r\n b=b//2\r\n res.append(b)\r\n elif(b%10==1):\r\n b=b//10\r\n res.append(b)\r\n else:\r\n break\r\nif(b==a):\r\n res.sort()\r\n print(\"YES\")\r\n print(len(res))\r\n for i in res:\r\n print(i,end=\" \")\r\nelse:\r\n print(\"NO\")\r\n", "def transform(start_num,count,arr):\r\n global b,found\r\n\r\n if found:\r\n return\r\n\r\n if start_num>b:\r\n return\r\n\r\n if start_num==b:\r\n found = True\r\n print('YES')\r\n print(count+1)\r\n print(*arr)\r\n return\r\n\r\n n_arr_1 = arr.copy()\r\n n_arr_1.append(2*start_num)\r\n transform(2*start_num,count+1,n_arr_1)\r\n\r\n n_arr_2 = arr.copy()\r\n n_arr_2.append(10*start_num+1)\r\n transform(10*start_num+1,count+1,n_arr_2)\r\n\r\n return\r\nif __name__ == '__main__':\r\n a,b = map(int,input().split())\r\n found = False\r\n arr = [a]\r\n transform(a,0,arr)\r\n if not found:\r\n print('NO')\r\n ", "a, b = map(int, input().split())\n\nans = []\ncheck = True\nwhile True:\n\tans.insert(0, b)\n\n\tif b%2 == 0:\n\t\tb //= 2\n\telif str(b)[-1] == '1':\n\t\tb = int(str(b)[:-1])\n\telse:\n\t\tcheck = False\n\t\tbreak\n\n\tif b == a:\n\t\tans.insert(0, b)\n\t\tbreak\n\telif a > b:\n\t\tcheck = False\n\t\tbreak\n\nif check:\n\tprint('YES')\n\tprint(len(ans))\n\tfor x in ans:\n\t\tprint(x, end=' ')\nelse:\n\tprint('NO')", "from sys import setrecursionlimit\nsetrecursionlimit(10**6)\ndef dfs(a,b):\n res.append(a)\n if a > b:\n res.pop()\n return\n elif a == b:\n print('YES')\n print(len(res))\n print(*res)\n exit()\n\n dfs(a*2,b) \n dfs(a*10+1,b)\n res.pop() \n\na,b = map(int,input().split())\nres = [a]\ndfs(a*2,b)\ndfs(a*10+1,b)\nprint('NO')", "a, b = list(map(int, input().split()))\nrecord = []\n\nwhile True:\n if b < a:\n print(\"NO\")\n break\n elif b % 2 == 0 and b != a:\n record.insert(0, str(b))\n b //= 2\n elif b % 10 == 1 and b != a:\n record.insert(0, str(b))\n b = (b - 1) // 10\n elif b == a:\n record.insert(0, str(a))\n print(\"YES\")\n print(len(record))\n print(' '.join(record))\n break\n else:\n print(\"NO\")\n break\n\t \t\t\t \t \t \t \t\t\t\t\t \t\t \t \t\t\t", "a, b = map(int, input().split())\n \nseq = [b]\nwhile b > a:\n if b % 2 == 0:\n b //= 2\n seq.append(b)\n elif b % 10 == 1:\n b //= 10\n seq.append(b)\n else:\n print(\"NO\")\n exit(0)\n \nif b != a:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(len(seq))\n print(' '.join(map(str, seq[::-1])))\n\n\t \t \t \t \t \t \t \t\t \t \t\t", "from collections import deque\n\na, b = map(int, input().split())\n\npre = {}\nfila = deque([a])\n\nwhile fila:\n\tv = fila.popleft()\n\t\n\tif 2 * v not in pre and 2 * v <=b:\n\t\tfila.append(2 * v)\n\t\tpre[2 * v] = v\n\tif 10 * v + 1 not in pre and 10 * v + 1 <= b:\n\t\tfila.append(10 * v + 1)\n\t\tpre[10 * v + 1] = v\n\nseq = [str(b)]\n\nif b not in pre: print(\"NO\")\nelse:\n\tprint(\"YES\")\n\tx = b\n\twhile x != a:\n\t\tx = pre[x]\n\t\tseq.append(str(x))\n\t\n\tprint(len(seq))\n\tprint(' '.join(seq[::-1])) \n\n \t\t \t\t\t\t\t \t\t \t \t \t\t\t\t\t\t", "a, b = map(int, input().split())\nv = [b]\n\nwhile a != b and b > a:\n if b % 2 == 0 and b // 2 >= a:\n b = b // 2\n v.append(b)\n else:\n if b % 10 != 1 or (b - 1) // 10 < a:\n print(\"NO\")\n exit(0)\n b = (b - 1) // 10\n v.append(b)\n\nprint(\"YES\")\nprint(len(v))\nprint(' '.join(map(str, reversed(v))))\n\t\t \t \t\t\t \t\t\t \t \t\t\t\t \t \t", "a,b = map(int, input().split())\narr = [b]\nwhile b >= a:\n\tif b == a:\n\t\tprint('YES')\n\t\tprint(len(arr))\n\t\tprint(*arr[::-1])\n\t\texit()\n\tif b%2 == 0:\n\t\tb/=2\n\t\tarr.append(int(b))\n\telif b%10 == 1:\n\t\tb = b//10\n\t\tarr.append(int(b))\n\telse:\n\t\tprint('NO')\n\t\texit()\nprint('NO')\n\t\t\t\t\t\t \t \t \t \t\t\t\t\t \t \t \t \t", "a,b=map(int,input().split())\r\nh=[b]\r\nwhile b!=a:\r\n\tif b%10==1:\r\n\t\tb=b//10\r\n\telif b%2==0:\r\n\t\tb=b//2\r\n\telse:\r\n\t\tbreak\r\n\tif a>b:\r\n\t\tbreak\r\n\th=h+[b]\r\nif a!=b:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n\tprint(len(h))\r\n\tfor i in range(1,len(h)+1):\r\n\t\tprint(h[-i],end=' ')", "import sys\r\n\r\na, b = list(input().split())\r\nc = 1\r\nh = [int(b), ]\r\n\r\nwhile int(a) <= int(b):\r\n if a == b:\r\n print(\"YES\")\r\n print(c)\r\n print(*h[-1::-1])\r\n sys.exit()\r\n if b[-1] == \"1\":\r\n b = b[:-1]\r\n h.append(int(b))\r\n c += 1\r\n elif int(b) % 2 == 0:\r\n h.append(int(b) // 2)\r\n b = str(int(b) // 2)\r\n c += 1\r\n else:\r\n print(\"NO\")\r\n sys.exit()\r\nprint(\"NO\")\r\n\r\n", "a, b = map(int, input().split())\r\nl = [b]\r\nc =1\r\nif a == b:\r\n print(\"YES\")\r\n print(0)\r\n print(a, b)\r\n exit()\r\n\r\nwhile a != b:\r\n if a > b:\r\n print(\"NO\")\r\n exit()\r\n\r\n else:\r\n if b%10 == 3 or b%10 == 5 or b%10 ==7 or b%10 == 9:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n if b % 2 == 0:\r\n b = b // 2\r\n l.append(b)\r\n c = c+1\r\n else:\r\n b = b//10\r\n l.append(b)\r\n c = c + 1\r\n\r\n\r\n\r\n\r\nprint(\"YES\")\r\nprint(len(l))\r\nprint(*l[::-1])\r\nexit()", "a, b = map(int, input().split())\r\n\r\nseq = [b]\r\nwhile seq[-1] > a:\r\n if seq[-1] % 2 == 0 and seq[-1] // 2 >= a:\r\n seq.append(seq[-1] // 2)\r\n else:\r\n if seq[-1] % 10 != 1:\r\n break\r\n seq.append((seq[-1] - 1) // 10)\r\n\r\nif seq[-1] == a:\r\n seq.reverse()\r\n print(\"YES\")\r\n print(len(seq))\r\n print(*seq)\r\nelse:\r\n print(\"NO\")\r\n", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sat Aug 14 21:59:31 2021\n\n@author: lcarv\n\"\"\"\n\nfrom collections import deque\n\nseq = list(map(int,input().strip().split()))[:2]\n\na = seq[0]\nb = seq[1]\n\np = {}\nf = deque([a])\n\n\n\nwhile f:\n v = f.popleft()\n if 2*v not in p and 2*v <= b:\n f.append(2*v)\n p[2*v] = v\n \n if 10*v+1 not in p and 10*v+1 <= b:\n f.append(10*v+1)\n p[10*v+1] = v\n\n\nseq = [b]\n\nif b not in p:\n print(\"NO\")\n \nelse:\n print(\"YES\")\n x = b\n while x != a:\n x = p[x]\n seq.append(x)\n \n print(len(seq))\n saida = \"\"\n for i in seq[::-1]:\n saida += str(i)+ \" \"\n print(saida)\n\t\t\t \t \t\t\t \t \t \t\t \t\t\t\t\t \t \t", "a,b=map(int,input().split())\r\nl=[b]\r\nwhile(a<b):\r\n if b%2:\r\n if b%10==1:\r\n b//=10\r\n l.append(b)\r\n else:\r\n break\r\n else:\r\n b//=2\r\n l.append(b)\r\nif a==b:print(\"YES\");print(len(l));print(*l[::-1])\r\nelse:print(\"NO\")", "def smart():\n a, b = map(int, input().split())\n\n\ndef bruteForce():\n a, b = map(int, input().split())\n path = [a]\n\n def dfs(a):\n if a == b:\n print(\"YES\", len(path), ' '.join(map(str, path)), sep=\"\\n\")\n exit()\n elif a > b:\n return\n else:\n for d_a in (a * 10 + 1, a * 2):\n path.append(d_a)\n dfs(d_a)\n path.pop()\n dfs(a)\n print(\"NO\")\n\n\nbruteForce()\n", "a,b=map(int,input().split())\r\ndef change(a,arr):\r\n #print(arr)\r\n if a>b:\r\n return []\r\n if a==b:\r\n return arr\r\n return change(2*a,arr+[2*a])+change(10*a+1,arr+[10*a+1])\r\n \r\nans=(change(a,[a]))\r\nif ans==[]:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(len(ans))\r\n print(*ans)\r\n", "def b_to_a(a, b, num):\n if b != a:\n if b % 2 == 0:\n b = b / 2\n if b >= a:\n num.insert(0, int(b))\n b_to_a(a, b, num)\n\n elif b % 10 == 1:\n b = b // 10\n if b >= a:\n num.insert(0, int(b))\n b_to_a(a, b, num)\n\na, b = map(int, input().split())\nnum = []\nb_to_a(a, b, num)\nnum.append(b)\nif a in num:\n print(\"YES\")\n print(len(num))\n print(\" \".join(map(str, num)))\nelse:\n print(\"NO\")\n\t \t \t\t \t\t \t\t \t \t\t \t\t", "u, f = map(int, input().split())\r\n\r\ncheck = False\r\ndef solve(u, f, p):\r\n global check\r\n if u == f:\r\n check = True\r\n print(\"YES\")\r\n print(len(p))\r\n print(*p)\r\n return\r\n if(u < f):\r\n solve(2*u, f, p + [2*u])\r\n solve(10*u + 1, f, p + [10*u+1])\r\n\r\n#backtracking\r\n\r\n\r\nsolve(u, f, [u])\r\nif not check:\r\n print(\"NO\")", "import heapq\r\n\r\na, b = map(int, input().split())\r\n\r\nflag = True\r\ntmp = b\r\ncnt = 0\r\nans = [b]\r\nwhile True:\r\n if tmp % 10 == 1:\r\n tmp = tmp // 10\r\n elif tmp % 2 == 0:\r\n tmp //= 2\r\n elif tmp != a:\r\n flag = False\r\n break\r\n\r\n cnt += 1\r\n heapq.heappush(ans, tmp)\r\n if tmp == a:\r\n break\r\n if tmp < a:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\n print(len(ans))\r\n while ans:\r\n print(heapq.heappop(ans), end=' ')\r\n print()\r\nelse:\r\n print(\"NO\")", "def transform(key, counter):\n if (key > b):\n return False\n if (key == b):\n output_dict[counter] = key\n cnt = counter\n return True\n aux = False\n aux = transform(key * 2, counter + 1)\n if (aux):\n output_dict[counter] = key\n return True\n aux = transform((key*10) + 1, counter + 1)\n if (aux):\n output_dict[counter] = key\n return True\n return False\n\nif __name__ == '__main__':\n a, b = input().split()\n a = int(a)\n b = int(b)\n output_dict = {}\n cnt = 0\n if ((a, b) >= (1, 1) and (a,b) <= (10**9, 10**9)):\n if (transform(a,1)):\n print('YES')\n output = ''\n print(len(output_dict))\n for key in range(1, len(output_dict) + 1):\n output += str(output_dict[key])+ ' '\n output = output.rstrip()\n print(output)\n \n else:\n print('NO')\n \t \t\t\t\t \t \t \t \t\t \t \t \t\t", "def solut(a,b):\n global final,ans,answer\n answer = True\n if a == b :\n cc = ans.copy()\n final.append(cc)\n answer = False\n return\n if answer :\n if a>b:\n return\n ans.append(a*2)\n solut(a*2,b)\n del(ans[-1])\n ans.append(a*10+1)\n solut(a*10+1,b)\n del(ans[-1])\n\n\na,b = map(int,input().split())\nfinal = []\nans = [a]\nsolut(a,b)\nif len(final) == 0:\n print('NO')\nelse:\n print('YES')\n print(len(final[0]))\n for i in final[0]:\n print(i,end = ' ')", "def transforma(origem, destino):\n if origem[-1] == destino:\n return origem, destino\n elif origem[-1] > destino:\n return None\n else:\n numero = origem[-1]\n dest = numero * 2\n retorno = transforma(origem + [dest], destino)\n if retorno is None:\n numero = int(str(numero) + \"1\")\n return transforma(origem + [numero], destino)\n else:\n return retorno\n\n\norigem, destino = map(int, input().split())\n\ntransformacao = transforma([origem], destino)\nif transformacao is None:\n print('NO')\nelse:\n transformacao, destino = transformacao\n print('YES')\n print(len(transformacao))\n print(\" \".join(map(str, transformacao)))\n", "'''input\r\n4 42\r\n2 162\r\n101111100101\r\n'''\r\na,b = map(int,input().split())\r\n\r\npossible = True\r\nl = [str(b)]\r\nwhile a<b:\r\n\tif b%2==0:\r\n\t\tb>>=1\r\n\telif b%10 == 1:\r\n\t\tb=int(b/10)\r\n\telse:\r\n\t\tpossible = False\r\n\t\tbreak\r\n\tl.append(str(b))\r\n\r\nif a>b:\r\n\tpossible = False\r\n\r\nif possible:\r\n\tprint('YES')\r\n\tprint(len(l))\r\n\tprint(' '.join(reversed(l)))\r\n\t# print(l)\r\nelse:\r\n\tprint('NO')\r\n", "a, b = map(int, input().split())\n\ndef find_transformation(a, b):\n transformations = [b]\n \n while b > a:\n if b % 10 == 1:\n b //= 10\n transformations.append(b)\n elif b % 2 == 0:\n b //= 2\n transformations.append(b)\n else:\n break\n \n if transformations[-1] == a:\n transformations.reverse()\n print(\"YES\")\n print(len(transformations))\n print(\" \".join(map(str, transformations)))\n else:\n print(\"NO\")\n\nfind_transformation(a, b)\n\n\t\t \t \t \t \t\t \t\t \t\t\t \t\t \t \t \t", "z, w = map(int, input().split())\ny = [w]\n\nwhile z < w:\n if w%2:\n w, m = divmod(w, 10)\n\n if m!=1:\n break\n else:\n w//=2\n\n y.append(w)\n\nif z!=w:\n print('NO')\n\nelse:\n print('YES')\n print(len(y))\n print(*reversed(y))\n\t \t\t\t \t \t\t\t \t\t\t \t\t\t \t \t \t", "def translate(n, b):\n if n > b:\n return False\n if n == b:\n return n,\n x = translate(n*2, b)\n if x:\n return (n, *x)\n y = translate(n * 10 + 1, b)\n if y:\n return (n, *y)\n return False\n\n\na, b = map(int, input().split())\nans = translate(a, b)\nif ans:\n print(\"YES\")\n print(len(ans))\n print(*ans)\nelse:\n print(\"NO\")\n", "a, b = [int(x) for x in input().split()]\n\nseq = []\nwhile a != b:\n seq.append(b)\n if a > b:\n print('NO')\n exit()\n if b % 2 == 1 and b%10 != 1:\n print('NO')\n exit()\n if b % 2 == 0:\n b = b // 2\n else:\n b = b // 10\nseq.append(b)\nprint('YES')\nprint(len(seq))\nprint(*reversed(seq))\n \t\t \t \t \t \t \t \t\t \t\t\t\t \t \t", "def solve(atual,fim):\r\n if atual > fim: return False\r\n\r\n if atual == fim:\r\n return True\r\n \r\n operacoes = [2*atual, 10*atual+1]\r\n for op in operacoes:\r\n if solve(op, fim):\r\n ans.append(op)\r\n return True\r\n\r\n return False\r\n\r\ninicio, fim = map(int, input().split())\r\n\r\nans = []\r\nif solve(inicio,fim):\r\n print(\"YES\")\r\n ans.append(inicio)\r\n print(len(ans))\r\n print(*reversed(ans))\r\nelse:\r\n print(\"NO\")", "a,b=map(int,input().split())\r\nl=[b]\r\nwhile a<b:\r\n if b%10==1:\r\n b=b//10\r\n l.append(b)\r\n elif (b%10)%2!=0:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n b=b//2\r\n l.append(b)\r\n if b==a:\r\n print(\"YES\")\r\n print(len(l))\r\n l.reverse()\r\n print(*l)\r\n exit()\r\n\r\nprint(\"NO\")\r\n\r\n", "a, b = list(map(int, input().split(' ')))\r\nlist = [b]\r\nwhile b > a and (b%2 == 0 or b%10 == 1):\r\n if b % 2 == 0:\r\n b //= 2\r\n else:\r\n b //= 10\r\n list.append(b)\r\nif b != a:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(len(list))\r\n for i in list[::-1]:\r\n print(i, end=' ')\r\n print()", "\r\n\r\n#start the code from here\r\na,b=map(int,input().split())\r\nstack=[b]\r\nans=[]\r\nh=0\r\nwhile stack:\r\n\tp=stack.pop()\r\n\tans.append(p)\r\n\tif p==a:\r\n\t\tbreak\r\n\telse:\r\n\t\tif p<a:\r\n\t\t\th=1\r\n\t\t\tbreak\r\n\tif p%10==1:\r\n\t\tp=p//10\r\n\t\tstack.append(p)\r\n\telif p%2==0:\r\n\t\tp=p//2\r\n\t\tstack.append(p)\r\n\telse:\r\n\t\th=1\r\n\t\tbreak\r\nans.reverse()\r\nif h==1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint(len(ans))\r\n\tprint(*ans)", "def transA2B(a, b): \r\n def genFolwingNumbers(num):\r\n next_numbers = []\r\n next_numbers.append(num * 2) \r\n next_numbers.append(num * 10 + 1) \r\n return next_numbers \r\n queue = [(a, [a])] \r\n while queue:\r\n curr_num, sequence = queue.pop(0)\r\n if curr_num == b:\r\n return sequence \r\n next_numbers = genFolwingNumbers(curr_num)\r\n for num in next_numbers:\r\n if num <= b: \r\n queue.append((num, sequence + [num]))\r\n \r\n return [] \r\na, b = map(int, input().split())\r\nsequence = transA2B(a, b)\r\nif sequence:\r\n print(\"YES\")\r\n print(len(sequence))\r\n print(*sequence)\r\nelse:\r\n print(\"NO\")", "from collections import deque\n\na, b = map(int, input().split())\np = {}\nfila = deque([a])\n\nwhile fila:\n v = fila.popleft()\n if v*2 not in p and 2*v <= b:\n fila.append(v*2)\n p[v*2] = v\n if 10*v+1 not in p and 10*v+1 <= b:\n fila.append(10*v+1)\n p[10*v+1] = v\n\ns = []\nif b in p:\n print (\"YES\")\n while True:\n s.append(b)\n b = p[b]\n if b == a:\n s.append(b)\n break\n print (len(s))\n s1 = []\n for i in range(len(s)-1, -1, -1):\n s1.append(s[i])\n print (*s1)\nelse:\n print(\"NO\")\n \t\t \t\t\t \t \t\t\t \t \t \t \t\t\t \t", "a,b=input().split()\ns=[b]\nk=0\nwhile True:\n if b[-1]=='1' and int(b)>int(a):\n b=list(b)\n del b[-1]\n b=''.join(b)\n s.append(b)\n elif int(b)%2==0 and int(b)>int(a):\n b=int(b)/2\n b=int(b)\n s.append(b)\n b=str(b)\n elif int(a)==int(b):\n\n break\n else:\n k+=1\n break\ns.reverse()\n\nif k==0:\n print('YES')\n print(len(s))\n print(*s)\nelse:\n print('NO')\n", "class handle_input():\n\n def __init__(self, mode):\n if mode == \"multiple_lines\":\n self.input_from_user = self.__read_multiple_lines()\n\n def __read_multiple_lines(self):\n contents = []\n while True:\n try:\n line = input()\n if line in [\"\\n\", \"\"]:\n break\n \n except EOFError:\n break\n contents.append(line)\n\n return contents\n\ninput_handler = handle_input(\"multiple_lines\")\nlist_lines = input_handler.input_from_user\n\nini, end = (int(list_lines[0].split(\" \")[0]), int(list_lines[0].split(\" \")[1]))\n\nlista = []\npossible = True\nwhile (end >= ini) and (end != ini):\n if str(end)[-1] == \"1\":\n lista += [end]\n end = int(str(end)[:-1])\n elif (end % 2 == 0):\n lista += [end]\n end = end // 2\n else:\n possible = False\n break\n\nif (possible == False) or end != ini:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(len(lista)+ 1)\n output = str(ini)\n for j in range (len(lista) - 1, -1 ,-1):\n output += \" \" + str(lista[j])\n print(output.strip())\n\n\t \t\t \t \t \t \t \t\t \t\t\t\t \t", "def solve(l, x, a):\r\n if(x < a):\r\n # print(\"aqui\")\r\n print(\"NO\")\r\n elif x == a:\r\n l.append(x)\r\n print(\"YES\")\r\n print(len(l))\r\n for i in range(len(l) - 1, 0, -1):\r\n print(l[i], end=\" \")\r\n print(l[0])\r\n elif(str(x)[-1] == '1'):\r\n l.append(x)\r\n x = int(str(x)[0:-1])\r\n solve(l, x, a)\r\n elif((x % 2 == 1)):\r\n # print(\"aqio\")\r\n # print(x)\r\n print(\"NO\")\r\n else:\r\n l.append(x)\r\n solve(l, int(x / 2), a)\r\ndef main():\r\n a, b = [int(x) for x in input().split()]\r\n solve([], b, a)\r\n\r\nmain()", "import sys\nfrom collections import defaultdict\ninput = sys.stdin.readline\n\na, b = list(map(int, input().split()))\nans = [b]\ndef backtrack(a, b):\n if b == a:\n # ans.append(b)\n return True\n elif b < a:\n return False\n if b%2 == 0:\n ans.append(b//2)\n if backtrack(a, b//2):\n return True\n ans.pop()\n if(b-1)%10 == 0:\n ans.append((b-1)//10)\n if backtrack(a, ((b-1)//10)):\n return True\n ans.pop()\n \n return False\n# ans.revers\nif backtrack(a, b):\n print(\"YES\")\n ans.reverse()\n print(len(ans))\n print(*ans)\nelse:\n print(\"NO\")\n\n\n ", "from collections import deque\r\n\r\na, b = map(int, input().split())\r\n\r\npre = {}\r\nfila = deque([a])\r\n\r\nwhile fila:\r\n v = fila.popleft()\r\n if v*2 not in pre and v*2 <= b:\r\n fila.append(v*2)\r\n pre[v*2] = v\r\n if v*10 not in pre and v*10 <= b:\r\n fila.append(10*v + 1)\r\n pre[10*v + 1] = v\r\n\r\nseq = [b]\r\nif b not in pre:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n x = b\r\n while x != a:\r\n x = pre[x]\r\n seq.append(x)\r\n\r\n print(len(seq))\r\n print(' '.join(map(str, seq[::-1])))", "a,b = map(int, input().split())\r\n\r\nresposta = [b]\r\nwhile b > a:\r\n\tif b % 2 == 0:\r\n\t\tb /= 2\r\n\t\tresposta.append(b)\r\n\t\t\r\n\telif b % 10 == 1:\r\n\t\tb = (b-1) / 10\r\n\t\tresposta.append(b)\r\n\t\t\r\n\telse: break\r\n\r\nif b != a:\r\n\tprint('NO')\r\n\r\nelse:\r\n\tprint('YES')\r\n\tprint(len(resposta))\r\n\tfor i in range(len(resposta)-1, -1, -1):\r\n\t\tif i == 0:\r\n\t\t\tprint(int(resposta[i]))\r\n\t\t\t\r\n\t\telse:\r\n\t\t\tprint(int(resposta[i]), end = ' ')\r\n", "def read(): return(list(map(int, input().strip().split(\" \"))))\r\n\r\ndef dfs(lis, b):\r\n# print(lis)\r\n if lis[-1] == b:arr.append(lis);return\r\n if lis[-1] > b:return\r\n dfs(lis+[lis[-1]*2], b)\r\n dfs(lis+[lis[-1]*10 +1], b)\r\n\r\narr = []\r\n\r\na, b = read()\r\ndfs([a], b)\r\nif arr:\r\n print(\"YES\")\r\n print(len(arr[0]))\r\n print(*arr[0])\r\nelse:\r\n print(\"NO\")\r\n\r\n ", "m,goal=map(int,input().split())\r\na=[m]\r\nsum_=0\r\n\r\ndef dfs(init):\r\n global sum_,goal,a\r\n if init>goal:\r\n \r\n if(a!=[]):\r\n a.pop()\r\n else:\r\n pass\r\n return False\r\n if init==goal:\r\n return True\r\n \r\n k=init*2\r\n a.append(k)\r\n \r\n if dfs(k)==True:\r\n return True\r\n else:\r\n \r\n k=init*10+1\r\n a.append(k)\r\n \r\n if dfs(k)==True:\r\n return True\r\n else:\r\n \r\n if(a!=[]):\r\n a.pop()\r\n else:\r\n pass\r\n return False\r\n \r\n \r\n \r\n\r\n \r\nq=dfs(m)\r\nif q==True:\r\n print('YES')\r\n print(len(a))\r\n for i in range(len(a)):\r\n if i!=len(a)-1:\r\n print(a[i],'',end='')\r\n else:\r\n print(a[i])\r\nelse:\r\n print('NO')", "def reach(a, b, path=[]):\n if a > b: return\n if a == b:\n path.append(a)\n print(\"YES\")\n print(len(path))\n print(*path)\n exit(0)\n reach(a*2,b,path+[a])\n reach(a*10+1,b,path+[a])\na,b=map(int,input().split())\nreach(a,b,[])\nprint(\"NO\")\n", "def transform_a_to_b(a, b, res, count):\r\n if a == b:\r\n return res, count\r\n if a > b:\r\n return False\r\n if a < b:\r\n return transform_a_to_b(2*a, b, res+str(2*a)+\" \", count+1) or transform_a_to_b(10*a+1, b, res+str(10*a+1)+\" \", count+1)\r\n\r\n\r\ndata = [int(i) for i in input().split(\" \")]\r\ncount = 1\r\nres = transform_a_to_b(data[0], data[1], str(data[0])+\" \", count)\r\nif res:\r\n print(\"YES\")\r\n print(res[1])\r\n print(res[0])\r\nelse:\r\n print(\"NO\")", "data = [int(x) for x in input().split()]\r\na = data[0]\r\nb = data[1]\r\n\r\ndef anidar(arbol,nodo):\r\n arbol[nodo[0]] = [nodo[0]*2,nodo[0]*10+1]\r\n arbol[nodo[1]] = [nodo[1]*2,nodo[1]*10+1]\r\n if nodo[0] < b: \r\n anidar(arbol,arbol[nodo[0]])\r\n if nodo[1] < b:\r\n anidar(arbol,arbol[nodo[1]])\r\n \r\ntree = {a:[2*a,10*a+1]}\r\nanidar(tree,tree[a])\r\npath = []\r\nans = \"\"\r\nfor key in tree:\r\n if b in tree[key]:\r\n path.append(b)\r\n path.append(key)\r\n ans = \"YES\"\r\n break\r\nelse:\r\n ans = \"NO\"\r\n print(ans)\r\n \r\nif ans == \"YES\":\r\n cond = True\r\n while a not in path:\r\n for key in tree:\r\n if path[len(path)-1] in tree[key]:\r\n path.append(key)\r\n break\r\n \r\n path.reverse()\r\n print(ans)\r\n print(len(path))\r\n for i in range(0,len(path)):\r\n print(path[i],end=\"\" if i == len(path)-1 else \" \") \r\n \r\n \r\n", "from collections import deque\n\na,b = map(int, input().split())\npre = {}\nfila = deque([a])\n\nwhile fila:\n v = fila.popleft()\n if v*2 not in pre and v*2 <= b: \n fila.append(v*2)\n pre[v*2] = v\n if v*10+1 not in pre and v*10+1 <= b:\n fila.append(v*10+1)\n pre[v*10+1] = v\n \nseq = [b]\nif b not in pre:\n print(\"NO\")\nelse:\n print(\"YES\")\n x = b\n while x != a:\n x = pre[x]\n seq.append(x)\n print(len(seq))\n for i in seq[::-1]:\n print(i),\n\t \t\t \t \t\t \t \t\t\t\t \t\t \t \t \t", "a_input, b_input = map(int, input().split())\n\nresult = [str(b_input)]\n\nwhile b_input > a_input:\n if b_input % 2 == 0:\n b_input //= 2\n elif b_input % 10 == 1:\n b_input //= 10\n else:\n break\n result.insert(0,str(b_input))\n\nif a_input != b_input:\n print('NO')\nelse:\n print(f'YES\\n{str(len(result))}\\n{\" \".join(result)}')\n \t \t\t \t \t\t \t\t\t \t\t \t\t\t\t\t\t", "a, b = map(int, input().split())\r\nmoves = []\r\nmoves.append(b)\r\nwhile(b>a):\r\n\tif b%2==0:\r\n\t\tb = int(b/2)\r\n\t\tmoves.append(b)\r\n\telse:\r\n\t\tif str(b)[-1]=='1':\r\n\t\t\tb = int(str(b)[:-1])\r\n\t\t\tmoves.append(b)\r\n\t\telse:\r\n\t\t\tbreak\r\n \r\n \r\nif b!=a:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n\tprint(len(moves))\r\n\tfor i in range(len(moves)-1,-1,-1):\r\n\t\tprint(moves[i])", "a,b=map(int,input().split())\r\nl=[b]\r\nwhile b>a:\r\n\tif b%2==0:\r\n\t\tb=b//2\r\n\telif b%10==1:\r\n\t\tb//=10\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\tl.append(b)\r\nif b!=a:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint(len(l))\r\n\tprint(*(l[::-1]))", "n,k=map(int,input().strip().split())\r\nans=[k]\r\nwhile k>0 and k!=n:\r\n s=str(k)\r\n if k%2==0:k//=2\r\n elif s[-1]==\"1\" and len(s)>1:k=int(s[:-1])\r\n else:k=0\r\n ans.append(k)\r\nif n==k:print(\"YES\");print(len(ans));print(*ans[::-1])\r\nelse:print(\"NO\")", "from collections import deque\r\na,b = map(int,input().split())\r\n\r\nfila = deque([a])\r\nprevious = {}\r\n\r\nwhile fila:\r\n v = fila.popleft()\r\n if (2*v <= b and 2*v not in previous):\r\n fila.append(2*v)\r\n previous[2*v] = v\r\n if((10*v + 1 not in previous) and (10*v + 1 <= b)):\r\n fila.append(10*v + 1)\r\n previous[10*v + 1] = v\r\n\r\nif(b not in previous):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n res = [b]\r\n x = b\r\n while(x != a):\r\n x = previous[x]\r\n res.append(x)\r\n print(len(res))\r\n print(' '.join(map(str,reversed(res))))\r\n ", "inicio, sonho=list(map(int, input().split(' ')))\n\nanterior, fila = {}, []\nfila.append(inicio)\n\nisPossible = \"NO\"\n\nwhile len(fila)>0 and isPossible == \"NO\":\n ponteiro = fila[0]\n\n if(ponteiro*2 <= sonho): \n fila.append(ponteiro*2)\n anterior[ponteiro*2] = ponteiro\n if(ponteiro*10 + 1 <= sonho): \n fila.append(ponteiro*10 + 1)\n anterior[ponteiro*10 +1] = ponteiro\n\n if(ponteiro == sonho):\n isPossible= \"YES\"\n break\n fila.pop(0)\n\nprint(isPossible)\nif(isPossible==\"YES\"):\n ponteiro=fila[0]\n sequencia=[]\n while(ponteiro != inicio):\n sequencia.append(ponteiro)\n ponteiro= anterior[ponteiro]\n #inteirando do ultimo para o inicio\n #adciona a uma fila2 para tem len e sequencia\n sequencia.append(inicio)\n print(len(sequencia))\n for numero in range(len(sequencia)-1,-1,-1):\n print(str(sequencia[numero])+ \" \", end=\"\")\n\t \t\t \t\t\t\t \t\t \t \t \t \t", "a, b = map(int, input().split())\nthereIsResult = False\nseq = list()\nseq.append(b)\n\nwhile a < b:\n\n if b % 2 == 0:\n b = b // 2\n elif (b - 1) % 10 == 0:\n b = (b - 1) // 10\n else:\n break\n seq.append(b)\n\n if b == a:\n thereIsResult = True\n\nif thereIsResult:\n print(\"YES\")\n print(len(seq))\n seq.reverse()\n for a in seq:\n print(a, end = \" \")\n print()\nelse:\n print(\"NO\")\n \t\t \t \t \t\t \t \t\t\t \t\t \t \t\t", "import queue\n\na, b = map(int, input().split())\nfila = queue.Queue()\npre = {}\n\nfila.put(a)\n\nwhile fila.qsize() > 0:\n v = fila.get()\n if 2 * v not in pre and 2 * v <= b:\n fila.put(2 * v)\n pre[2 * v] = v\n if 10 * v + 1 not in pre and 10 * v + 1 <= b:\n fila.put(10 * v + 1)\n pre[10 * v + 1] = v\n\nans = [b]\n\nif b in pre:\n while pre[ans[-1]] in pre:\n ans.append(pre[ans[-1]])\n ans.append(a)\n \n print(\"YES\")\n print(len(ans))\n print(*ans[::-1])\nelse:\n print(\"NO\")\n\n\t\t\t \t\t\t\t\t\t\t\t \t \t\t\t\t\t\t \t\t\t \t \t", "from collections import defaultdict, deque\r\n\r\na, b = [int(n) for n in input().split()]\r\nq = deque([(a)])\r\npath = defaultdict(int)\r\npath[a] = None\r\nans = []\r\n\r\nwhile q:\r\n num = q.popleft()\r\n\r\n if num == b:\r\n cur = num\r\n while cur:\r\n ans.append(cur)\r\n cur = path[cur]\r\n break\r\n\r\n if num * 2 not in path and num * 2 <= b:\r\n path[num * 2] = num\r\n q.append(num * 2)\r\n if (num * 10) + 1 not in path and (num * 10) + 1 <= b:\r\n path[(num * 10) + 1] = num\r\n q.append((num * 10) + 1)\r\n\r\nif ans:\r\n ans.reverse()\r\n print('YES')\r\n print(len(ans))\r\n print(*ans)\r\nelse:\r\n print('NO')\r\n ", "from collections import deque\r\na,b=map(int,input().split(' '))\r\nlis=deque([b])\r\n\r\ndef transform(a,b):\r\n c=0\r\n while(b!=a):\r\n if b<a:\r\n print('NO')\r\n return\r\n if b%2==0:\r\n b=b/2\r\n lis.appendleft(int(b))\r\n else:\r\n b=(b-1)/10\r\n lis.appendleft(int(b))\r\n c+=1\r\n print('YES')\r\n print(c+1)\r\n \r\n print(*lis)\r\ntransform(a,b)", "a,b=map(int,input().split())\r\nk=str(b)\r\nL=[]\r\nwhile(b!=a and b>1):\r\n L.append(b)\r\n if(int(k[-1])%2==0):\r\n b=b//2\r\n k=str(b)\r\n elif(int(k[-1])==1):\r\n k=k[:len(k)-1]\r\n b=int(k)\r\n else:\r\n c=1\r\n break\r\nif(b==a):\r\n L.append(a)\r\n L=L[::-1]\r\n print('YES')\r\n print(len(L))\r\n print(*L)\r\nelse:\r\n print('NO')", "# a = [0] * 34\r\n# a[10] = 1\r\n# for i in range(10, 34):\r\n# \tif i + 1 <= 33:\r\n# \t\ta[i + 1] += a[i]\r\n# \tif i + 10 <= 33:\r\n# \t\ta[i + 10] += a[i]\r\n\r\n# print(a[33])\r\n\r\n\r\nx, y = map(int, input().split())\r\na = [y]\r\nwhile y > x:\r\n\tif y % 2 == 0:\r\n\t\ty//=2\r\n\t\ta.append(y)\r\n\telif y % 10 == 1:\r\n\t\ty //= 10\r\n\t\ta.append(y)\r\n\telse:\r\n\t\tbreak\r\n\r\nif x == y:\r\n\tprint(\"YES\")\r\n\tprint(len(a))\r\n\tprint(\" \".join(map(str, a[::-1])))\r\nelse:\r\n\tprint(\"NO\")\t\t\r\n", "a, b= map(int, input().split())\r\nrez=0\r\nress=[b]\r\nc=False\r\nwhile b>a:\r\n if b%2==0:\r\n b=b//2\r\n elif b%2==1 and b%10==1:\r\n b=b//10\r\n else:\r\n print(\"NO\")\r\n c=True\r\n break\r\n ress.append(b)\r\n rez+=1\r\nif c==False:\r\n if b!=a:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n print(rez+1)\r\n for i in range(rez, -1, -1):\r\n print(ress[i], end=\" \")", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\na, b = map(int, input().split())\r\n\r\nans = []\r\nfound = False\r\nwhile b:\r\n ans.append(b)\r\n if b%2 == 0:\r\n b //= 2\r\n else:\r\n if b % 10 != 1:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n b //= 10\r\n if b == a:\r\n found = True\r\n ans.append(b)\r\n print(\"YES\")\r\n break\r\nif found:\r\n print(len(ans))\r\n ans = ans[::-1]\r\n print(*ans)\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "path=[]\r\n\r\ndef func(x,b):\r\n if x>b:\r\n return False\r\n\r\n if x==b:\r\n path.append(x)\r\n return True\r\n\r\n if func(2*x,b):\r\n path.append(x)\r\n return True\r\n\r\n if func(10*x+1,b):\r\n path.append(x)\r\n return True\r\n\r\n return False \r\n\r\n \r\n\r\na,b=map(int,input().split())\r\nfunc(a,b)\r\n\r\nif len(path):\r\n print(\"YES\")\r\n print(len(path))\r\n print(*path[::-1])\r\nelse:\r\n print(\"NO\")\r\n", "values = input().split(' ')\nvalueA = int(values[0])\nvalueB = int(values[1])\narray = [valueB]\n\nwhile valueB != valueA:\n if(valueB % 10 == 1):\n valueB = valueB//10\n elif(valueB % 2 == 0 and valueB > 0):\n valueB = valueB//2\n else:\n break\n array.append(valueB)\n\nif(valueA == valueB):\n array.reverse()\n print('YES')\n print(len(array))\n for i in array:\n print(i, end = ' ')\nelse:\n print('NO')\n\t \t \t \t \t\t \t \t\t\t \t\t \t", "def solve(a,b,l):\r\n if(a>b):\r\n return False\r\n if(a==b):\r\n return True\r\n x=solve(a*2,b,l)\r\n y=solve(a*10+1,b,l)\r\n if(x or y):\r\n l.append(a)\r\n return x|y\r\n\r\nn,m=list(map(int,input().split()))\r\nl=[]\r\nif(solve(n,m,l)):\r\n print(\"YES\")\r\n l.reverse()\r\n l.append(m)\r\n print(len(l))\r\n print(*l)\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\n\nnumbers = []\n\nis_B = True\n\nnumbers.append(b)\n\nwhile b > a and is_B:\n if str(b)[len(str(b)) - 1] == '1':\n b = int((b - 1) / 10)\n elif b % 2 == 0:\n b = int(b / 2)\n else:\n is_B = False\n\n numbers.append(b)\n\nif b < a:\n is_B = False\n\nanswer = \"\"\n\nif (is_B):\n print('YES')\n print(len(numbers))\n\n for n in range(len(numbers) - 1, -1, -1):\n answer += str(numbers[n])\n if (n > 0):\n answer += \" \"\n\n print(answer)\n\nelse:\n print('NO')\n \t\t \t \t\t\t \t\t \t \t \t\t \t\t\t\t\t", "def ab():\r\n if a[0]>b:\r\n return\r\n if a[0]==b:\r\n print('YES')\r\n print(len(res))\r\n for r in res:\r\n print(r, end=' ')\r\n print()\r\n found[0]=True\r\n return\r\n a[0]*=2\r\n res.append(a[0])\r\n ab()\r\n if found[0]:\r\n return\r\n res.pop()\r\n a[0]//=2\r\n a[0]=10*a[0]+1\r\n res.append(a[0])\r\n ab()\r\n if found[0]:\r\n return\r\n res.pop()\r\n a[0]=(a[0]-1)//10\r\nal,b=[int(x) for x in input().split()]\r\nres=[]\r\nres.append(al)\r\nfound=[False]\r\na=[al]\r\nab()\r\nif not found[0]:\r\n print('NO')\r\n", "a,b=map(int,input().split())\r\n\r\nans=[]\r\nmoze= False\r\n\r\nwhile b > a:\r\n ans.append(b)\r\n if b%10 == 1:\r\n b=b//10\r\n elif b%2==0:\r\n b=b//2\r\n else:\r\n break\r\n\r\nif b==a:\r\n ans.append(b)\r\n moze=True\r\n\r\nif moze:\r\n print('YES')\r\n print(len(ans))\r\n print(*ans[::-1])\r\n\r\nelse:\r\n print('NO')\r\n \r\n", "from collections import deque\n\na, b = map(int, input().split())\n\nans = deque([b])\n\nwhile b > a:\n if b % 10 == 1:\n b //= 10\n ans.appendleft(b)\n elif b % 2 == 0:\n b //= 2\n ans.appendleft(b)\n else:\n print(\"NO\")\n exit()\n\nif b == a:\n print(\"YES\")\n print(len(ans))\n\n for i in ans: print(i, end=\" \")\n\nelse: print(\"NO\")\n \t \t\t \t \t \t \t\t\t\t \t \t", "n,m=map(int,input().split())\r\nl=[m]\r\nboo=True\r\nwhile m>=n:\r\n if m==n:\r\n \r\n break\r\n if m%10==1:\r\n m=m//10\r\n l.append(m)\r\n elif m%2==0:\r\n m=m//2\r\n l.append(m)\r\n else:\r\n boo=False\r\n break\r\nif m!=n:\r\n boo=False\r\nif boo:\r\n print('YES')\r\n print(len(l))\r\n l=l[::-1]\r\n print(*l)\r\nelse:\r\n print('NO')", "from collections import deque\r\na, b = list(map(int, input().split()))\r\nqueue = deque([(a, [])])\r\nlevel = 1\r\nvalid = False\r\nwhile queue:\r\n for i in range(len(queue)):\r\n cur, path = queue.popleft()\r\n path.append(str(cur))\r\n if cur == b:\r\n valid = True\r\n break\r\n if cur < b:\r\n queue.append((2 * cur, path.copy()))\r\n queue.append((10 * cur + 1, path.copy()))\r\n if valid:\r\n break\r\n level += 1\r\n\r\nif not valid:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(level)\r\n print(\" \".join(path))\r\n", "ij, n = map(int, input().split())\r\n\r\ncheck = False\r\ndef solve(ij, n, p):\r\n global check\r\n if ij == n:\r\n check = True\r\n print(\"YES\")\r\n print(len(p))\r\n print(*p)\r\n return\r\n if(ij < n):\r\n solve(2*ij, n, p + [2*ij])\r\n solve(10*ij + 1, n, p + [10*ij+1])\r\n#backtracking\r\n\r\nsolve(ij, n, [ij])\r\nif not check:\r\n print(\"NO\")", "# cook your dish here\r\na,b=list(map(int,input().split()))\r\nans=list()\r\nflag=False\r\ndef solve(x,b,v):\r\n if x==b:\r\n global ans\r\n \r\n ans=[x for x in v]\r\n # print(ans)\r\n global flag\r\n flag=True\r\n # print(ans)\r\n return\r\n \r\n # print(ans)\r\n if 2*x<=b:\r\n # print(2*x)\r\n v.append(2*x)\r\n solve(2*x,b,v)\r\n v.pop()\r\n if 10*x+1<=b:\r\n # print(10*x+1)\r\n v.append(10*x+1)\r\n solve(10*x+1,b,v)\r\n v.pop()\r\n return\r\n\r\ntemp=[a]\r\nsolve(a,b,temp)\r\n\r\nif flag==True:\r\n print('YES')\r\n print(len(ans))\r\n for x in ans:\r\n print(x,end=\" \")\r\nelse :\r\n print(\"NO\")\r\n ", "y, n = map(int, input().split())\r\n\r\ncheck = False\r\ndef solve(y, n, p):\r\n global check\r\n if y == n:\r\n check = True\r\n print(\"YES\")\r\n print(len(p))\r\n print(*p)\r\n return\r\n if(y < n):\r\n solve(2*y, n, p + [2*y])\r\n solve(10*y + 1, n, p + [10*y+1])\r\n\r\n#backtracking\r\n\r\n\r\nsolve(y, n, [y])\r\nif not check:\r\n print(\"NO\")", "a,b = map(int, input().split())\r\nans = []\r\nwhile b>a:\r\n ans.append(b)\r\n if b%2 == 0:\r\n b //= 2\r\n else:\r\n b -= 1\r\n if b%10 == 0:\r\n b //= 10\r\n else:\r\n b = 0\r\nif b==a:\r\n ans.append(b)\r\n print(\"YES\")\r\n print(len(ans))\r\n for i in range(len(ans)-1,-1,-1):\r\n print(ans[i], end = \" \")\r\nelse:\r\n print(\"NO\")", "i, n = map(int, input().split())\r\n\r\nch = False\r\ndef solve(i, n, p):\r\n global ch\r\n if i == n:\r\n ch = True\r\n print(\"YES\")\r\n print(len(p))\r\n print(*p)\r\n return\r\n if(i < n):\r\n solve(2*i, n, p + [2*i])\r\n solve(10*i + 1, n, p + [10*i+1])\r\n\r\n#backtracking\r\n\r\n\r\nsolve(i, n, [i])\r\nif not ch:\r\n print(\"NO\")", "\ndef get_ops_list(a, b):\n if a == b:\n return [a]\n elif a > b:\n return []\n\n k = a * 2\n ops = get_ops_list(k, b)\n \n if len(ops) > 0:\n return [a, *ops]\n else:\n k = 10 * a + 1\n ops = get_ops_list(k, b)\n if len(ops) > 0:\n return [a, *ops]\n else:\n return []\n\na, b = list(map(int, input().split()))\n\nops = get_ops_list(a, b)\n\nif len(ops) > 0:\n print(\"YES\")\n print(len(ops))\n for n in ops:\n print(n, end=\" \")\n print(\"\")\nelse:\n print(\"NO\")\n\n\t\t \t \t\t \t\t\t\t\t\t \t\t\t\t\t \t\t\t", "a,b = map(int,input().split())\r\nl = [b]\r\nwhile b % 2 == 0 or b % 10 == 1:\r\n if b == 0 or b == 1:\r\n break\r\n if b == a:\r\n break\r\n elif b % 2 == 0:\r\n b = int(b/2)\r\n l.append(b)\r\n else:\r\n b = int((b-1)/10)\r\n l.append(b)\r\n \r\nif b == a:\r\n print(\"YES\")\r\n print(len(l))\r\n print(*reversed(l))\r\nelse:\r\n print(\"NO\")", "def dfs(x, b, path):\r\n if x == b:\r\n return path\r\n if 2 * x <= b:\r\n res = dfs(2 * x, b, path + [2 * x])\r\n if res is not None:\r\n return res\r\n if 10 * x + 1 <= b:\r\n res = dfs(10 * x + 1, b, path + [10 * x + 1])\r\n if res is not None:\r\n return res\r\n return None\r\n\r\na, b = map(int, input().split())\r\npath = dfs(a, b, [a])\r\nif path is None:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(path))\r\n print(*path)\r\n", "a, b = map(int, input().split())\naux = []\naux.append(b)\n\nwhile(b > 0):\n if(b % 2 == 0):\n b /= 2\n aux.append(b)\n elif((b-1) % 10 == 0):\n b -= 1\n b /= 10\n aux.append(b)\n else:\n break\n \n if(b == a): \n break\n\nif(aux[len(aux) - 1] == a):\n print(\"YES\")\n print(len(aux))\n size = len(aux)\n for i in range(size - 1, -1, -1):\n print(int(aux[i]), end=\" \")\nelse:\n print(\"NO\")\n \t\t\t\t \t \t \t\t\t \t \t\t\t\t\t\t\t", "from collections import deque\n\na, b = map(int, input().split())\naux = dict()\nfila = deque([a])\nwhile fila != deque():\n \n e = fila.popleft()\n temp = e * 2\n if temp not in aux and temp <= b:\n fila.append(temp)\n aux[temp] = e\n temp = 10 * e + 1\n if temp not in aux and temp <= b:\n fila.append(temp)\n aux[temp] = e\nif b not in aux:\n print('NO')\nelse:\n resp = [str(b)]\n temp = b\n while temp != a:\n temp = aux[temp]\n resp.append(str(temp))\n print('YES')\n print(len(resp))\n print(' '.join(resp[::-1]))\n \t \t\t \t\t\t \t \t\t \t\t \t \t\t\t\t\t", "def transformation(a, b):\n sequence = [b]\n while (b != a):\n if (b % 10 == 1):\n b = b // 10\n elif (b % 2 == 0 and b > 0):\n b = b // 2\n else:\n break\n sequence.append(b)\n if (a == b):\n sequence.reverse()\n print('YES')\n print(len(sequence))\n for i in sequence:\n print(i, end = ' ')\n else:\n print('NO')\n\na, b = map(int, input().split())\ntransformation(a, b)\n \t \t\t\t\t \t \t \t \t\t\t\t\t\t \t\t\t", "def bfs(a, b, steps):\n if a > b:\n return False\n if a == b:\n return steps\n\n return bfs(2*a, b, steps + [2*a]) or \\\n bfs(10*a + 1, b, steps + [10*a + 1])\n\n\na, b = map(int, input().split())\n\nsteps = bfs(a, b, [a])\n\nif not steps:\n print('NO')\nelse:\n print('YES')\n print(len(steps))\n print(*steps)\n\n\t\t \t\t\t\t\t \t\t\t \t \t \t \t", "def first_operation(x):\r\n return 2*x\r\n \r\ndef second_operation(x):\r\n return (10*x + 1)\r\n \r\ndef transform(x,y,z):\r\n first = first_operation(x)\r\n second = second_operation(x)\r\n \r\n if(x > y):\r\n return False\r\n if(x == y):\r\n return True\r\n \r\n firstOp = transform(first,y,z)\r\n \r\n if(firstOp):\r\n z.append(first)\r\n return True\r\n \r\n else:\r\n secondOp = transform(second,y,z)\r\n \r\n if(secondOp):\r\n z.append(second)\r\n return True\r\n \r\n return False\r\n \r\na,b = [int(e) for e in input().split()]\r\n \r\nz = []\r\n \r\nsequence = transform(a,b,z)\r\n \r\nif(len(z) == 0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n z.append(a)\r\n z.reverse()\r\n print(len(z))\r\n print(*z, sep=\" \")", "a, b = map(int, input().split())\r\nX = [b]\r\n \r\nwhile a < b:\r\n if b % 2:\r\n b, m = divmod(b, 10)\r\n if m != 1:\r\n break\r\n else:\r\n b //= 2\r\n X.append(b)\r\n \r\nif a != b:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(len(X))\r\n print(*reversed(X))", "a,b = [int(x) for x in input().split()]\r\ncheck = False\r\ndef solve(i,path):\r\n # nonlocal check\r\n if i>b:\r\n return False\r\n elif i==b:\r\n print(\"YES\")\r\n print(len(path))\r\n print(*path)\r\n return True\r\n else:\r\n option1 = solve(2*i,path + [2*i])\r\n option2 = solve(10*i + 1,path+ [10*i+1])\r\n \r\n return option1 or option2\r\n \r\nif not (solve(a,[a])):\r\n print(\"NO\")", "import sys\na, b = map(int, input().split())\nanscnt = 1\nans = []\nans.append(b)\nwhile b != a:\n if b < a:\n print('NO')\n exit(0)\n elif b % 10 == 1:\n b = (b-1)//10\n elif b % 2 == 0:\n b //= 2\n else:\n print('NO')\n exit(0)\n anscnt += 1\n ans.append(b)\nprint('YES')\nprint(anscnt)\nprint(*ans[::-1])\n", "\n\ndef verify(num, lista):\n if num == target:\n return True, lista\n elif num > target:\n return False, lista\n aux1 = lista.copy()\n aux2 = lista.copy()\n aux1.append(num*2)\n aux2.append((num*10+1))\n r1,l1 = verify(num*2, aux1)\n r2,l2 = verify((num*10) + 1, aux2)\n if r1:\n return True, l1\n if r2:\n return True, l2\n else:\n return False, []\n\nnum, target = map(int,input().split())\nr, vals = verify(num,[num])\n\nif r:\n print(\"YES\")\n print(len(vals))\n for i in range(len(vals)):\n print(vals[i],end = \" \\n\"[i==len(vals)-1])\nelse:\n print('NO')", "a, b = list(map(int, input().split()))\n\nfila = [(a, [a])]\nflag = False\n\nwhile fila:\n atual, caminho = fila.pop(0)\n\n if atual == b:\n flag = True\n print(\"YES\")\n print(len(caminho))\n print(' '.join(map(str, caminho)))\n break\n\n if atual < b:\n fila.append((atual * 2, caminho + [atual * 2]))\n fila.append((atual * 10 + 1, caminho + [atual * 10 + 1]))\n\nif not flag:\n print(\"NO\")\n\n \t\t \t \t \t \t\t \t \t \t \t", "a, s = map(int, input().split())\r\nc = [s]\r\nwhile s != a:\r\n\tif s % 10 == 1:\r\n\t\ts //= 10\r\n\telif s % 2 == 0 and s > 0:\r\n\t\ts //= 2\r\n\telse:\r\n\t\tbreak\r\n\tc.append(s)\r\nif a == s:\r\n\tc.reverse()\r\n\tprint('YES')\r\n\tprint(len(c))\r\n\tfor i in c:\r\n\t\tprint(i, end = ' ')\r\nelse:\r\n\tprint('NO')", "numbers = [int(x) for x in input().split()]\n \na = numbers[0]\nb = numbers[1]\n\nresult = []\n\nresult.append(int(b))\n\nwhile b > 0:\n if b%2==0:\n b =b/2\n result.append(int(b))\n\n elif((b-1)%10==0):\n b -=1\n b = b/10\n result.append(int(b))\n else:\n break\n\n if b==a :\n break\n \ntam = len(result)\n\nif result[tam-1] != a:\n print(\"NO\")\nelse:\n result.reverse()\n print(\"YES\")\n print(tam)\n print(*result)\n \t \t \t \t \t \t\t \t \t\t\t", "def dfs(t):\r\n if t>b:\r\n return \r\n if t==b:\r\n ans.append(t)\r\n return True\r\n if dfs(2*t):\r\n ans.append(t)\r\n return True\r\n \r\n if dfs(10*t+1):\r\n ans.append(t)\r\n return True\r\n \r\n return False\r\n \r\n \r\nans=[]\r\na,b=map(int,input().split())\r\n#ans.append(a)\r\nif dfs(a):\r\n print('YES')\r\n print(len(ans))\r\n ans.reverse()\r\n print(*ans)\r\n \r\nelse:\r\n print('NO')\r\n", "a,b=map(int,input().split())\r\n\r\nans=1\r\nans2=[b]\r\nwhile b!=a:\r\n if str(b)[-1]==\"1\": \r\n b=b//10\r\n ans2.append(b)\r\n ans+=1\r\n else:\r\n if b%2==0:\r\n b=b//2\r\n ans2.append(b)\r\n ans+=1\r\n else:\r\n print(\"NO\")\r\n exit()\r\n if b<a:\r\n print(\"NO\")\r\n exit()\r\nans2.reverse()\r\nprint(\"YES\")\r\nprint(ans)\r\nprint(*ans2)\r\n\r\n ", "a, b = map(int,input().split())\r\nresult=[b]\r\n \r\nwhile(a < b):\r\n\tif(b % 10 == 1):\r\n\t\tb = b // 10\r\n\telif(b % 2 == 0):\r\n\t\tb = b//2\r\n\telse:\r\n\t\tbreak\r\n\tresult.append(b)\r\nresult.reverse()\r\n\r\nif(a == b):\r\n print(\"YES\")\r\n print(len(result))\r\n print(*result)\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\nlista = []\n\ndef transformAtoB(a, b, lista=[]):\n \n if b % 2 == 0:\n b = b / 2\n if b >= a:\n lista.insert(0, int(b))\n transformAtoB(a, b, lista)\n\n elif b % 10 == 1:\n b = b // 10\n if b >= a:\n lista.insert(0, int(b))\n transformAtoB(a, b, lista)\n \ntransformAtoB(a, b, lista)\nlista.append(b)\n\nif a in lista:\n \n print(\"YES\")\n print(len(lista))\n print(\" \".join(map(str, lista)))\n \nelse:\n \n print(\"NO\")\n\t\t \t\t\t\t \t \t\t\t \t\t\t \t\t\t \t\t \t \t", "a, b = list(map(int, input().split()))\r\n\r\nvis = set()\r\nachou = False\r\n\r\ndef tentar(curr):\r\n global b\r\n global achou\r\n if achou:\r\n return None\r\n \r\n ret = None\r\n qtd = len(vis)\r\n vis.add(curr)\r\n if len(vis) == qtd or curr > b:\r\n return None\r\n \r\n if curr == b:\r\n achou = True\r\n return [curr]\r\n branch1 = tentar(curr * 2)\r\n branch2 = tentar(curr * 10 + 1)\r\n if branch1 != None:\r\n branch1.append(curr)\r\n ret = branch1\r\n if branch2 != None:\r\n branch2.append(curr)\r\n ret = branch2\r\n \r\n return ret\r\n \r\nresp = tentar(a)\r\n\r\nif resp == None:\r\n print('NO')\r\nelse:\r\n print('YES' )\r\n print(len(resp))\r\n print(' '.join(map(str, resp[::-1])))", "v = []\r\n\r\na, b = map(int, input().split())\r\n\r\nv.append(int(b))\r\n\r\nwhile b > 0:\r\n if b%2 == 0:\r\n b/=2\r\n v.append(int(b))\r\n elif (b-1)%10==0:\r\n b -= 1\r\n b /= 10\r\n v.append(int(b))\r\n else:\r\n break\r\n if b == a:\r\n break\r\nif v[len(v)-1] != a:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(len(v))\r\n res = v[::-1]\r\n print(*res,sep=\" \")", "m=list(input().split(' '))\r\na=int(m[0])\r\nb=int(m[1])\r\nn=[]\r\nwhile b>a :\r\n n.append(b)\r\n if b%2==0:b=int(b/2)\r\n elif b%10==1:b=int(b//10)\r\n else:break\r\nn.append(a)\r\nif a==b:\r\n print('YES')\r\n print(len(n))\r\n for i in range(1,len(n)+1):\r\n print(n[len(n)-i],'',end='')\r\nelse:print('NO')", "a, b = input().split()\n\na = int(a)\nb = int(b)\n\nlista = []\nlista.append(b)\n\nwhile (b > 0):\n if (b % 2 == 0):\n b = b / 2\n lista.append(b)\n \n elif ((b-1) % 10 == 0):\n b = b - 1\n b = b / 10\n lista.append(b)\n \n else:\n break\n\n if (a == b):\n break\n\nif (lista[-1] != a):\n print('NO')\nelse:\n print('YES')\n print(len(lista))\n list_size = len(lista)\n for i in range(list_size - 1, -1, -1):\n print(int(lista[i]), end=\" \")\n print()\n\t\t \t \t\t \t \t \t\t \t \t", "a,b=map(int,input().split())\r\nk=[b]\r\nif len(str(b))<=9:\r\n while b>a:\r\n if b%2==0:\r\n b=int(b/2)\r\n k.append(b)\r\n else:\r\n b=int(b//10)\r\n k.append(b)\r\n k.reverse()\r\n if min(k)==a:\r\n print('YES')\r\n print(len(k))\r\n for item in k:\r\n print(item, end=\" \")\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "def get(a, b):\r\n if a > b:\r\n return None\r\n if a==b:\r\n return [b]\r\n c = get(a * 2, b)\r\n if c != None:\r\n return [a] + c\r\n c = get(a * 10+1, b)\r\n if c != None:\r\n return [a] + c\r\n return None\r\n \r\n \r\na, b=map(int, input().split())\r\nc = get(a, b)\r\nif c != None:\r\n print('YES')\r\n print(len(c))\r\n for x in c:\r\n print(x, end = ' ')\r\nelse:\r\n print('NO')", "num1, num2 = map(int, input().split())\narray=[]\narray.append(num2)\nwhile num2 > num1:\n if (num2 % 10 == 1):\n num2 = num2 // 10\n elif (num2 % 2 == 0):\n num2 = num2 // 2\n else:\n break\n array.append(num2)\nif num2 == num1:\n array.reverse()\n print(\"YES\")\n print(len(array))\n print(*array)\nelse:\n print(\"NO\") \n \t \t\t \t\t \t \t \t \t \t\t\t", "n,m=map(int, input().split())\r\na=[]\r\na.append(m)\r\nwhile m>n:\r\n if m%10==1:\r\n m//=10\r\n elif m%2==0:\r\n m//=2\r\n else:\r\n break\r\n a.append(m)\r\nif m==n:\r\n a.reverse()\r\n print('YES')\r\n print(len(a))\r\n print(*a)\r\nelse:\r\n print('NO')", "def fn(n):\r\n if n%10==1:\r\n n=(n-1)/10\r\n elif n%2==0:\r\n n=n/2\r\n else:\r\n n=-1\r\n return int(n)\r\ndef transformation(a,b):\r\n L=[]\r\n while a<b:\r\n L.append(fn(b))\r\n b=fn(b)\r\n return L\r\nL=list(map(int,input().split()))\r\nif transformation(L[0],L[1])[len(transformation(L[0],L[1]))-1]==-1 or transformation(L[0],L[1])[len(transformation(L[0],L[1]))-1]!=L[0]:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(len(transformation(L[0],L[1]))+1)\r\n for j in range(len(transformation(L[0],L[1])+[L[1]])-1,-1,-1):\r\n print(([L[1]]+transformation(L[0],L[1]))[j],end=' ')\r\n", "a,b=map(int,input().split())\r\nf=0\r\nl=[b]\r\nwhile b>a:\r\n\tif b%2==1 and b%10!=1:\r\n\t\tf=1\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\n\telif b%10==1:\r\n\t\tb=(b-1)//10\r\n\t\tl.insert(0,b)\r\n\telse:\r\n\t\tb=b//2\r\n\t\tl.insert(0,b)\r\nif f==0 and b==a:\r\n\tprint(\"YES\")\r\n\tprint(len(l))\r\n\tprint(*l)\r\nelif f==0:\r\n\tprint(\"NO\")\r\n", "a, b = [int(x) for x in input().split()]\nsteps = []\n\ndef op1(n):\n return 2 * n\n\ndef op2(n):\n return (10 * n) + 1\n\ndef steps_for(acc, a, b):\n\n if op1(a) == b:\n acc.append(1)\n return((acc, True))\n\n if op2(a) == b:\n acc.append(2)\n return((acc, True))\n\n result = []\n\n # try 1\n if op1(a) < b:\n tmp = acc.copy()\n tmp.append(1)\n result = steps_for(tmp, op1(a), b)\n if result[1]:\n return(result)\n\n\n # try 2\n if op2(a) < b:\n tmp = acc.copy()\n tmp.append(2)\n result = steps_for(tmp, op2(a), b)\n if result[1]:\n return(result)\n \n return((acc, False))\n\ndef test(sequence):\n if len(sequence) > 3:\n print(sequence)\n return\n\n test(sequence + \"1\")\n\n test(sequence + \"0\")\n\n(steps, possible) = steps_for([],a, b)\n\nif not possible:\n print(\"NO\")\nelse:\n result = [a]\n\n for s in steps:\n if s == 1:\n result.append(op1(result[-1]))\n if s == 2:\n result.append(op2(result[-1]))\n \n print(\"YES\")\n print(len(result))\n print(*result)\n\t \t\t \t\t \t\t \t \t \t\t \t \t\t \t", "a, b = map(int, input().split())\r\n\r\nc = False\r\ndef sai(a, b, p):\r\n global c\r\n if a == b:\r\n c = True\r\n print(\"YES\")\r\n print(len(p))\r\n print(*p)\r\n return\r\n if(a < b):\r\n sai(2*a, b, p + [2*a])\r\n sai(10*a + 1, b, p + [10*a+1])\r\n\r\n\r\n\r\nsai(a, b, [a])\r\nif c!=True:\r\n print(\"NO\")", "a,b=map(int, input().split())\r\nx=[b]\r\nwhile a<b:\r\n if b%2==1 and b%10!=1: break\r\n if b%10==1: b=b//10\r\n else: b=b//2\r\n x.append(b)\r\nif a!=b: print(\"NO\")\r\nelse: \r\n print(\"YES\")\r\n print(len(x))\r\n print(*x[::-1])", "def solution(a, b):\r\n ans = [b]\r\n while b > a:\r\n if b % 10 == 1:\r\n ans.append(b // 10)\r\n b //= 10\r\n elif b % 2 == 0:\r\n ans.append(b // 2)\r\n b //= 2\r\n else:\r\n return []\r\n return ans if b == a else []\r\n\r\na, b = map(int, input().split())\r\n\r\nans = solution(a, b)\r\nif len(ans) == 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(len(ans))\r\n print(' '.join(map(str, ans[::-1])))", "from functools import lru_cache\r\nclass Solution:\r\n def transformation(self, a, b):\r\n # TODO write an algorithm here\r\n \"\"\"\r\n Time complexity: O(n)\r\n space complexity: O(1)\r\n \"\"\"\r\n self.answer = []\r\n def dfs(a, path):\r\n if path[-1] > b:\r\n return self.answer\r\n if path[-1] == b:\r\n self.answer = path\r\n return self.answer\r\n dfs(a*2, path+[a*2])\r\n dfs(10*a+1, path+[10*a+1])\r\n return self.answer\r\n return dfs(a, [a])\r\n \r\nif __name__ == \"__main__\":\r\n solution = Solution()\r\n a, b = list(map(int, input().split()))\r\n \r\n answer = solution.transformation(a, b)\r\n if answer:\r\n print(\"YES\")\r\n print(len(answer))\r\n for i in range(len(answer)):\r\n print(answer[i], end=\" \")\r\n else:\r\n print(\"NO\")", "achou = False\nsolucao = []\n\ndef caminho(a, b, seq):\n global achou\n global solucao\n if(a == b): \n achou = True\n solucao = seq\n # solucao.append(b)\n return\n \n if(a > b):\n return \n\n seq_1 = seq.copy()\n a1 = a * 2\n seq_1.append(a1)\n caminho(a1, b, seq_1)\n \n if(achou):\n return\n \n seq_2 = seq.copy()\n a2 = (a*10) + 1\n seq_2.append(a2)\n caminho(a2, b, seq_2)\n \n\na, b = list(map(int, input().split()))\n\ncaminho(a, b, [a])\nif(achou):\n print(\"YES\")\n print(len(solucao))\n print(*solucao)\nelse:\n print(\"NO\")\n \t\t \t \t\t\t \t\t \t\t\t \t\t \t \t", "def f(a,b,L):\r\n if a==b: \r\n return \"YES\"\r\n elif a > b:\r\n L.clear()\r\n return \"NO\"\r\n if f(a*10 + 1, b, L) == \"YES\":\r\n L.append(a*10+1)\r\n return \"YES\"\r\n elif f(2*a,b,L) == \"YES\":\r\n L.append(2*a)\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\na,b = map(int,input().split())\r\nL = []\r\nsol = f(a,b,L)\r\nprint(sol)\r\nL.append(a)\r\nL.sort()\r\nif sol!=\"NO\":\r\n print(len(L))\r\n for i in L:\r\n print(i,end=\" \")", "from sys import exit\r\na,b=[int(e) for e in input().split()]\r\ndef f(s,x):\r\n s+=[x]\r\n if x==a:\r\n print(\"YES\")\r\n print(len(s))\r\n print(*s[::-1])\r\n exit()\r\n elif x>a:\r\n if x%2==0:\r\n f(s,x//2)\r\n if (x-1)%10==0:\r\n f(s,(x-1)//10)\r\nf([],b)\r\nprint(\"NO\")", "a, b = input().split(\" \")\n\na = int(a)\nb = int(b)\n\ndef promissor(n):\n return n < b\n\ndef solucao(a,b):\n if a == b:\n print(\"YES\")\n print(\"0\")\n elif a > b:\n print(\"NO\")\n else:\n sol = \"\"\n r = find(a,b,sol)\n if r == -1:\n print(\"NO\")\n\n\ndef find(n, b, sol):\n sol += str(n)\n\n if n == b:\n print(\"YES\")\n print(len(sol.split(\" \")))\n print(sol)\n\n exit() \n else:\n sol += \" \"\n if promissor(n):\n find(2 * n,b,sol)\n find(10 * n + 1,b,sol)\n\n return -1\n\nsolucao(a,b)\n \t \t \t\t \t \t\t \t \t \t\t \t", "a_input, b_input = map(int, input().split())\n\ndef transform_a_b(a,b):\n if(a >= b):\n return [str(b)]\n if b % 2 == 0:\n return transform_a_b(a, b//2) + [str(b)]\n elif b % 10 == 1:\n return transform_a_b(a, b//10) + [str(b)]\n else:\n return [str(b)]\n\na_to_b = transform_a_b(a_input, b_input)\n\nif str(a_input) != a_to_b[0]:\n print('NO')\nelse:\n print(f'YES\\n{str(len(a_to_b))}\\n{\" \".join(a_to_b)}')\n\t\t \t \t \t \t \t\t\t \t \t\t", "a, b = map(int, input().split())\r\n\r\ndaf_set = {a}\r\nnot_yet = {a}\r\n\r\n\r\nwhile len(not_yet) > 0:\r\n if min(not_yet) > b:\r\n break\r\n not_yet2 = set()\r\n for x in not_yet:\r\n if 2*x <= b:\r\n not_yet2.add(2*x)\r\n daf_set.add(2*x)\r\n if 10*x + 1 <= b:\r\n not_yet2.add(10*x + 1)\r\n daf_set.add(10*x + 1)\r\n not_yet = not_yet2\r\n\r\nif b in daf_set:\r\n print(\"YES\")\r\n has = []\r\n while b > a:\r\n has.append(b)\r\n if b%2 == 1:\r\n b = b//10\r\n else:\r\n if b // 2 in daf_set:\r\n b = b // 2\r\n else:\r\n b = b // 10\r\n has.append(a)\r\n print(len(has))\r\n print(*has[::-1])\r\nelse:\r\n print(\"NO\")\r\n", "a,b=map(int,input().split())\r\nr=[b]\r\nwhile b>a:\r\n d=b%10\r\n if d==1:b//=10\r\n elif d%2:break\r\n else:b//=2\r\n r+=[b]\r\nr=r[::-1]\r\nprint([f'YES\\n{len(r)}\\n{\" \".join(map(str,r))}','NO'][a!=b])", "def Vasily(a, b, historico):\n if a > b:\n print('NO', end='')\n return 0\n \n if b%2 == 0:\n historico.insert(0, int(b/2))\n elif (b-1)%10 == 0:\n historico.insert(0, int((b-1)/10))\n else:\n print('NO', end='')\n return 0\n \n #print(a, historico, a==historico[0])\n \n if a == historico[0]:\n print('YES')\n l = len(historico)\n print(l)\n for n in range(0, l):\n print(historico[n], '', end='')\n return 0\n \n Vasily(a, historico[0], historico)\n\n\nscan = input().split(' ')\n \na = int(scan[0])\nb = int(scan[1])\nhistorico = [b]\n\nVasily(a, b, historico)\nprint()\n\n\t\t \t\t\t \t\t \t\t\t\t\t\t \t\t \t \t\t", "a,b=map(int,input().split())\r\nc=10\r\nx=[b]\r\n\r\nwhile a<b:\r\n\tif (1>1&b):\r\n\t b>>=1\r\n\telif (2>b%c):\r\n\t b//=c\r\n\telse:\r\n\t break\r\n\tx.append(b)\r\n\r\nif (a!=b):\r\n print('NO')\r\n\r\nelse:\r\n\tprint('YES')\r\n\tprint(len(x))\r\n\tprint(*reversed(x))", "a,b = map(int,input().split())\r\ncnt = 0\r\nc = True\r\ns = [b]\r\nwhile b>a:\r\n\tif str(b)[-1]==\"1\":\r\n\t\tb//=10\r\n\t\ts.append(b)\r\n\telif b%2==0:\r\n\t\tb//=2\r\n\t\ts.append(b)\r\n\telse:\r\n\t\tc=False\r\n\t\tbreak\r\nif c and a==b:\r\n\tprint(\"YES\")\r\n\tprint(len(s))\r\n\tprint(*s[::-1])\r\nelse:\r\n\tprint(\"NO\")", "a, b = list(map(int, input().split()))\n\nfila = [(a, [a])]\nflag = 0\nwhile fila:\n atual, caminho = fila.pop(0)\n\n if atual == b:\n flag = 1\n print(\"YES\")\n print(len(caminho))\n print(' '.join(map(str,caminho)))\n break\n if atual < b:\n fila.append((atual * 2, caminho + [atual*2]))\n fila.append((atual * 10+1, caminho + [atual*10+1]))\n\nif(flag == 0):\n print(\"NO\")\n \t\t\t \t\t\t\t \t\t \t \t \t\t\t \t \t", "a, b = map(int,input().split())\r\nk = []\r\nwhile b > a:\r\n k.append(b)\r\n if b%10==1:\r\n b-=1\r\n b//=10\r\n elif b%2==0:\r\n b//=2\r\n else:\r\n print(\"NO\")\r\n exit()\r\nif a==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n exit()\r\nk = k[::-1]\r\nprint(len(k) + 1)\r\nprint(a,end=' ')\r\nprint(*k,end=' ')\r\n", "A, B = 0, 0\nMAXN = 1e9 + 7\n\nappend = lambda x : (x * 10) + 1\nmultiply = lambda x : x * 2\n\ndef entrypoint():\n global A, B\n A, B = list(map(int, input().split()))\n\ndef search(x):\n if x >= MAXN:\n return None\n if x == B:\n return { 'trace': [x], 'steps': 1 }\n \n x1 = append(x)\n x2 = multiply(x)\n\n search1 = search(x1)\n search2 = search(x2)\n\n for result in [search1, search2]:\n if result != None:\n result['trace'].insert(0, x)\n result['steps'] += 1\n return result\n else:\n continue\n \n return None\n\ndef run():\n result = search(A)\n if result == None:\n print('NO')\n else:\n print('YES')\n print(result['steps'])\n print(' '.join(list(map(str, result['trace']))))\n\n\ndef main():\n entrypoint()\n run()\n\nif __name__ == '__main__':\n main()\n\t\t\t \t\t \t\t\t\t \t \t\t \t \t\t\t\t \t", "a,b=map(int,input().split())\nresult=[b]\n \nwhile a<b:\n\tif b%10==1:\n\t\tb=b//10\n\telif b%2==0:\n\t\tb=b//2\n\telse:\n\t\tbreak\n\tresult.append(b)\n\nresult.reverse()\nif(a ==b):\n print(\"YES\")\n print(len(result))\n print(*result)\nelse:\n print(\"NO\")", "from collections import *\r\nfrom math import *\r\n\r\na,b = list(map(int,input().split()))\r\nans = [b]\r\nwhile(b > a):\r\n\tif(b%10 == 1):\r\n\t\tb //= 10\r\n\telif((b%10)&1):\r\n\t\tprint(\"NO\")\r\n\t\texit(0)\r\n\telse:\r\n\t\tb //= 2\r\n\tans.append(b)\r\nif(a != b):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tans = ans[::-1]\r\n\tprint(len(ans))\r\n\tprint(*ans)\r\n", "def transformation(x, y, solution):\n solution.append(x)\n if(x == y):\n return solution\n else:\n if(x < y):\n has_solution1 = transformation(x*2, y, solution[:])\n has_solution2 = transformation(int(str(x) + '1'), y, solution[:])\n return has_solution1 or has_solution2\n\n[n, m] = list(map(int, input().split()))\nresult = transformation(n, m, [])\nif(result):\n print('YES')\n print(len(result))\n print(' '.join(map(str, result)))\nelse:\n print('NO')", "def transform(a, b, output):\n\n if a > b:\n return False\n\n if a == b:\n return True\n \n newv = 2*a\n op1 = transform(newv, b, output)\n\n if op1:\n\n output.append(newv)\n return True\n \n else:\n\n newv = 10*a + 1\n op2 = transform(newv, b, output)\n\n if op2:\n output.append(newv)\n return True\n \n return False\n\na, b = map(int, input().split())\nout = []\n\ntransform(a, b, out)\n\nif len(out) == 0:\n print(\"NO\")\nelse:\n out.append(a)\n out.reverse()\n print(f\"YES\\n{len(out)}\")\n print(\" \".join([str(o) for o in out]))\n", "def x_to_y(x, y, ans=[], ind=0):\n if (ind == 0):\n ans.append(x)\n\n if (x >= y):\n if (x == y):\n return ans\n return []\n\n if (x*2 <= y):\n op1 = x_to_y(x*2, y, ans + [x*2], ind + 1)\n if (op1):\n return op1\n\n if (x*10 + 1 <= y):\n op2 = x_to_y(x*10 + 1, y, ans + [x*10 + 1], ind + 1)\n if (op2):\n return op2\n\n else:\n return []\n\n\na, b = map(int, input().split())\n\n\nresult = x_to_y(a, b)\n\n\nif (result):\n print(\"YES\")\n print(len(result))\n print(' '.join(map(str, result)))\nelse:\n print(\"NO\")\n\n \t\t\t\t\t \t \t\t\t\t\t \t \t\t \t \t \t", "def get_next_seq(a,b,sequence):\r\n if(sequence[-1] == b):\r\n return sequence\r\n elif(sequence[-1] < b):\r\n var1 = get_next_seq(a,b,sequence+[2*sequence[-1]])\r\n var2 = get_next_seq(a,b,sequence+[10*sequence[-1]+1])\r\n if var1:\r\n return var1\r\n elif var2:\r\n return var2\r\n else:\r\n return []\r\n\r\na, b = map(int, input().split())\r\nres = get_next_seq(a,b,[a])\r\n\r\nif res:\r\n print(\"YES\")\r\n print(len(res))\r\n print(*res)\r\nelse:\r\n print(\"NO\")", "from itertools import accumulate\r\nfrom collections import defaultdict\r\n\r\ndef I(): return int(input())\r\ndef ST(): return input()\r\ndef IL(): return list(map(int, input().split()))\r\ndef ILS(): return sorted(map(int, input().split()))\r\n\r\na,b = IL()\r\nres = [b]\r\nans = True\r\nwhile a < b:\r\n if b%2 == 0:\r\n b //= 2\r\n res.append(b)\r\n elif b%10 == 1:\r\n b //= 10\r\n res.append(b)\r\n else:\r\n ans = False\r\n break\r\n \r\nif ans and a == b:\r\n print(\"YES\")\r\n print(len(res))\r\n print(*reversed(res))\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def t(a, b, seq):\r\n seq.append(a)\r\n\r\n if a > b:\r\n seq.pop()\r\n return\r\n elif a == b:\r\n return seq\r\n\r\n if t(2 * a, b, seq) != None or t(10 * a + 1, b, seq) != None:\r\n return seq\r\n \r\n seq.pop()\r\n\r\na, b = map(int, input().split())\r\n\r\ns = t(a, b, [])\r\n\r\nif s != None:\r\n print(\"YES\")\r\n print(len(s))\r\n print(\" \".join(str(x) for x in s))\r\nelse:\r\n print(\"NO\")", "def transform(a, b, passos):\n if(a>b):\n return\n elif (a == b):\n passos.append(a)\n print(\"YES\")\n print(len(passos))\n array = \"\"\n for i in passos:\n array += str(i) + \" \"\n print(array.strip())\n return\n else:\n passos.append(a)\n transform(2*a,b, passos)\n transform((10*a) + 1,b, passos)\n passos.remove(a)\n if(len(passos) == 0):\n print(\"NO\")\n return\n \n\nab = list(map(int,input().strip().split()))[:2]\na = ab[0]\nb = ab[1]\npassos = []\ntransform(a,b,passos)\n\t \t\t \t \t\t\t \t \t\t \t\t\t\t \t \t\t \t", "def solve():\n i, n = map(int, input().split())\n check = False\n \n def backtrack(p, i):\n nonlocal check\n if i == n:\n check = True\n print(\"YES\")\n print(len(p))\n print(*p)\n return\n if i < n:\n backtrack(p + [2*i], 2*i)\n backtrack(p + [10*i+1], 10*i+1)\n\n backtrack([i], i)\n if not check:\n print(\"NO\")\n\nsolve()\n\n\t \t \t \t \t\t \t\t \t \t \t", "\r\na,b=map(int,input().split())\r\nresult=[b]\r\n \r\nwhile a<b:\r\n\tif b%10==1:\r\n\t\tb=b//10\r\n\telif b%2==0:\r\n\t\tb=b//2\r\n\telse:\r\n\t\tbreak\r\n\tresult.append(b)\r\n \r\nresult.reverse()\r\nif(a ==b):\r\n print(\"YES\")\r\n print(len(result))\r\n print(*result)\r\nelse:\r\n print(\"NO\")", "n,m=map(int, input().split())\r\na=[m]\r\nwhile m>n:\r\n if m%10==1:m//=10\r\n elif m%2==0:m//=2\r\n else:break\r\n a.append(m)\r\nif m==n:\r\n a.reverse()\r\n print('YES')\r\n print(len(a))\r\n print(*a)\r\nelse:print('NO')", "a, b = map(int, input().split())\nv = []\nok = 1\nwhile b > a:\n v.append(b)\n if b & 1 == 0:\n b //= 2\n elif b % 10 == 1:\n b //= 10\n else:\n ok = 0\n break\nif b != a:\n ok = 0\nelse:\n v.append(a)\nif not ok:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(len(v))\n print(*v[::-1])\n\t\t \t \t \t \t \t\t \t\t \t\t\t\t \t\t \t", "a,b=map(int, input().split())\r\nlst=[b]\r\nwhile b>a:\r\n if b%10==1:\r\n b//=10\r\n elif b%2!=0:\r\n break\r\n else:\r\n b//=2\r\n lst.append(b)\r\nlst.reverse()\r\nprint('YES'+'\\n'+str(len(lst))+'\\n'+' '.join(map(str, lst)) if a==b else 'NO')", "import sys\nsys.setrecursionlimit(100000)\n\ndone = False\n\ndef rc(a, b, l):\n\tif a > b:\n\t\treturn\n\tif a == b:\n\t\tglobal done\n\t\tdone = l+[a]\n\tif not done:\n\t\trc(a*10+1, b, l+[a])\n\t\trc(a*2, b, l+[a])\n\na, b = map(int,input().split())\nrc(a, b, [])\nif done:\n\tprint('YES',len(done),sep='\\n')\n\tprint(*done)\nelse:\n\tprint('NO')\n", "def f(t):\r\n u = t[0]\r\n if u == a:\r\n print(\"YES\", len(t), sep='\\n')\r\n print(*t)\r\n raise TabError\r\n if u > a:\r\n if u % 10 == 1:\r\n f((u // 10, *t))\r\n if not u % 2:\r\n f((u // 2, *t))\r\n \r\na, b = map(int, input().split())\r\ntry:\r\n f((b,))\r\nexcept:\r\n pass\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\r\n\r\nflag = True\r\n\r\nlistt = []\r\n\r\nwhile a < b and flag:\r\n \r\n if b % 2 == 0:\r\n b //= 2\r\n listt.append(True)\r\n elif b % 10 == 1:\r\n b = (b - 1)//10\r\n listt.append(False)\r\n else:\r\n flag = False\r\n break\r\n\r\nif a != b:\r\n flag = False\r\n\r\nlistt.reverse()\r\n\r\nif flag:\r\n print(\"YES\")\r\n print(len(listt) + 1)\r\n print(a, end=\" \")\r\n for i in listt:\r\n if i:\r\n a *= 2\r\n else:\r\n a = a*10 + 1\r\n print(a, end=\" \")\r\n\r\nelse:\r\n print(\"NO\")", "from collections import deque\r\n\r\ndef main():\r\n a, b = map(int, input().split())\r\n\r\n q = deque()\r\n q.append((a, [a]))\r\n\r\n while q:\r\n now, root = q.popleft()\r\n\r\n if now == b:\r\n print(\"YES\")\r\n print(len(root))\r\n print(*root)\r\n return 0\r\n\r\n if now * 2 <= b:\r\n r = root[:]\r\n r.append(now * 2)\r\n q.append((now * 2, r))\r\n if now * 10 + 1 <= b:\r\n r = root[:]\r\n r.append(now * 10 + 1)\r\n q.append((now * 10 + 1, r))\r\n\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\nmain()", "num_inicial, num_alvo = map(int, input().split())\nlista = [num_alvo]\nresultado_encontrado = False\n\nwhile num_inicial <= num_alvo:\n\n if num_alvo == num_inicial:\n print(\"YES\")\n print(len(lista))\n print(*reversed(lista))\n resultado_encontrado = True\n break\n\n elif num_alvo % 2 == 0:\n num_alvo = num_alvo // 2\n lista.append(num_alvo)\n\n elif num_alvo % 10 == 1:\n num_alvo = (num_alvo - 1) // 10\n lista.append(num_alvo)\n \n else:\n break\n\nif not resultado_encontrado:\n print(\"NO\")\n \t\t\t\t \t \t\t\t \t\t\t \t\t\t\t\t\t \t\t\t", "def a_to_b(a, b, sequence=[]):\n _list = sequence[:]\n if (a == b):\n _list.append(a)\n return _list\n elif (a > b):\n return False\n else:\n _list.append(a)\n return a_to_b(2*a, b, _list) or a_to_b(10*a + 1, b, _list)\n\na, b = map(int, input().split())\nresult = a_to_b(a, b)\nif result == False: print(\"NO\")\nelse:\n print(\"YES\")\n print(len(result))\n response = ' '.join(str(i) for i in result)\n print(response)\n \t \t \t\t\t \t\t \t\t \t\t \t \t\t", "a, b = map(int, input().split())\r\n\r\n\r\ndef backTrack(i, path):\r\n # print(i, b)\r\n if i > b:\r\n return False\r\n elif i == b:\r\n print(\"YES\")\r\n print(len(path))\r\n print(*path)\r\n return True\r\n else:\r\n left = backTrack(2*i, path + [2*i])\r\n right = backTrack(10*i + 1, path + [10*i + 1])\r\n\r\n return left or right\r\n\r\n\r\nif not backTrack(a, [a]):\r\n print(\"NO\")\r\n", "def transform_number(a, b):\n if a == b:\n return [a]\n \n if a > b:\n return []\n \n multiply_result = transform_number(a * 2, b)\n if multiply_result:\n return [a] + multiply_result\n \n append_result = transform_number(a * 10 + 1, b)\n if append_result:\n return [a] + append_result\n \n return []\n\na, b = map(int, input().split())\nresult = transform_number(a, b)\n\nif result:\n print(\"YES\")\n print(len(result))\n print(*result)\nelse:\n print(\"NO\") \n\n\t\t \t\t \t \t \t\t\t\t\t \t \t \t\t \t \t", "n, m = map(int, input().split())\n\nsteps = [m]\n\nwhile m > n:\n if m % 2 == 0:\n m //= 2\n elif m % 10 == 1:\n m //= 10\n else:\n break\n steps.append(m)\n\nif m != n:\n print(\"NO\")\nelse:\n print(\"YES\")\n steps.reverse()\n print(len(steps))\n print(*steps)\n \t\t\t \t \t \t\t\t \t \t\t \t \t\t\t \t", "a,target=list(map(int,input().split()))\r\ndef isReachable(a,target,i):\r\n if(a>target):\r\n return \"NO\"\r\n if(a==target):\r\n print(\"YES\")\r\n print(i+1)\r\n print(target,end=\" \")\r\n return \"YES\"\r\n if(target%2==0 and isReachable(a,target//2,i+1)==\"YES\"):\r\n print(target,end=\" \")\r\n return \"YES\"\r\n if(target%10==1 and (target-1)%10==0 and isReachable(a,target//10,i+1)==\"YES\"):\r\n print(target,end=\" \")\r\n return \"YES\"\r\n return \"NO\"\r\nans=isReachable(a,target,0)\r\nif(ans==\"NO\"):\r\n print(\"NO\")\r\nelse:\r\n print()\r\n", "a,b=map(int,input().split())\r\nl=[b]\r\nflag=\"NO\"\r\nwhile a<b:\r\n\tif b%2==0:\r\n\t\tb=b//2\r\n\telse:\r\n\t\tt=str(b)\r\n\t\tif t[-1]=='1':\r\n\t\t\tt=t[:-1]\r\n\t\t\tb=int(t)\r\n\t\telse:\r\n\t\t\tbreak\r\n\tl.append(b)\r\n\tif a==b:\r\n\t\tflag=\"YES\"\r\n\t\tbreak\r\n\t# print(b)\r\nprint(flag)\r\nif len(l)==1 and l[-1]==a:\r\n\tprint(2)\r\n\tprint(a,a)\r\nelif l[-1]==a:\r\n\tprint(len(l))\r\n\tl.reverse()\r\n\tprint(*l)\r\n", "aa,bb=input().split()\r\na=int(aa)\r\nb=int(bb)\r\nv=[]\r\nv.append(b)\r\nwhile b>a:\r\n if b%2==0:\r\n b=b//2\r\n v.append(b)\r\n else:\r\n r=b%10\r\n if r!=1:\r\n break\r\n b=b//10\r\n v.append(b)\r\n if b==a:\r\n break\r\nv.sort()\r\nif b==a:\r\n print(\"YES\",end='\\n')\r\n print(len(v))\r\n for i in v:\r\n print(i,end=' ')\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "a, b = map(int, input().split())\r\nans = []\r\nflag = True\r\nwhile b > a and flag:\r\n if (b - 1) % 10 == 0:\r\n ans.append(str(b))\r\n b = (b - 1) // 10\r\n elif b % 2 == 0:\r\n ans.append(str(b))\r\n b //= 2\r\n else:\r\n flag = False\r\n\r\nif b < a:\r\n flag = False\r\nif flag:\r\n ans += [str(a)]\r\n print('YES')\r\n print(len(ans))\r\n print(' '.join(reversed(ans)))\r\nelse:\r\n print('NO')", "a, b = map(int, input().split())\r\n\r\ndef transform(a, path):\r\n if a > b:\r\n return False\r\n \r\n elif a == b:\r\n print('YES')\r\n print(len(path))\r\n print(*path)\r\n return True\r\n \r\n return transform(a*2, path + [a * 2]) or transform(a*10 + 1, path + [a*10 + 1])\r\n\r\nif not transform(a, [a]):\r\n print('NO')\r\n ", "from sys import stdin, stdout\na, b = map(int,stdin.readline().split())\nq = [ [a,[a]] ]\nans = []\nwhile len(q):\n f = q.pop(0)\n cur,l = f[0],f[1]\n if cur == b:\n ans = l\n break\n n1,n2 = 2*cur, int(str(cur)+'1')\n if n1<=b:\n q.append([ n1,l+[n1] ])\n if n2<=b:\n q.append( [n2,l+[n2]] )\nif len(ans):\n stdout.write(\"YES\\n\")\n stdout.write(\"{}\\n\".format(len(ans)))\n for x in ans:\n stdout.write(\"{} \".format(x))\n stdout.write(\"\\n\")\nelse:\n stdout.write(\"NO\\n\")", "a, b = [int(x) for x in input().split()]\r\n\r\nlista = []\r\naux = b\r\nresp = 'NO'\r\nwhile aux > a:\r\n\tlista.append(str(int(aux)))\r\n\t\r\n\tif aux % 2 == 0:\r\n\t\taux /= 2\r\n\telse:\r\n\t\taux -= 1\r\n\t\tif aux % 10 == 0:\r\n\t\t\taux /= 10\r\n\t\telse:\r\n\t\t\tbreak\r\n\t\r\n\tif aux == a:\r\n\t\tresp = 'YES'\r\n\t\tlista.append(str(int(aux)))\r\n\t\t\r\n\t\t\r\nif resp == 'YES':\r\n\tprint(resp)\r\n\tprint(len(lista))\r\n\tlista.reverse()\r\n\tprint(\" \".join(lista))\r\n\r\nelse:\r\n\tprint(resp)\r\n\t\r\n\t\t\r\n", "a, b = list(map(int, input().split(' ')))\n\nnumbers = []\npossible = 1\n\nwhile b > a:\n numbers.append(b)\n if b % 2 == 0:\n b = b/2\n elif b % 10 == 1:\n b = b // 10\n else: \n possible = 0\n break\n\nif b != a:\n print('NO')\nelse:\n numbers.append(b)\n print('YES')\n k = len(numbers)\n print(k)\n for i in range(k-1, -1, -1):\n print(int(numbers[i]), end=' ')\n \t\t \t\t\t\t\t \t\t\t\t\t\t\t\t \t\t \t \t", "a,b=map(int,input().split())\r\nl=[b]\r\nwhile a<b:\r\n if b%2:\r\n b-=1\r\n if b%10==0:b//=10\r\n else:exit(print(\"NO\"))\r\n else:b//=2\r\n l+=[b]\r\nif b<a:print(\"NO\")\r\nelse:print(\"YES\\n\",len(l),\"\\n\",*l[::-1])", "from collections import *\r\nimport heapq as hq\r\n\r\na,b = [int(x) for x in input().split()]\r\n\r\nh = Counter()\r\nl = [] \r\nhq.heapify(l)\r\n\r\nele = a\r\nh[a] = 0\r\nwhile ele < b:\r\n ele1 = 2*ele\r\n ele2 = 10*ele+1\r\n hq.heappush(l,ele1)\r\n hq.heappush(l,ele2)\r\n h[ele1] = ele\r\n h[ele2] = ele\r\n ele = hq.heappop(l)\r\nif ele == b:\r\n q = deque()\r\n print(\"YES\")\r\n count = 0 \r\n while ele in h:\r\n count+=1\r\n q.append(ele)\r\n ele = h[ele]\r\n print(count)\r\n while q:\r\n print(q.pop(),end = \" \")\r\nelse:\r\n print(\"NO\")", "entrada1,entrada2=map(int, input().split())\nlista=[]\nlista.append(entrada2)\nwhile entrada2 > entrada1:\n if (entrada2 % 10==1):\n entrada2 //= 10\n elif (entrada2 % 2==0):\n entrada2 //= 2\n else:\n break\n lista.append(entrada2)\nif entrada2 != entrada1:\n print('NO')\nelse:\n lista.reverse()\n print('YES')\n print(len(lista))\n print(*lista)\n \t\t \t \t\t \t \t\t\t\t\t \t \t \t \t\t", "def min(st,val,targ):\r\n if val==targ:\r\n st.append(val)\r\n return True\r\n if val>targ:\r\n return False\r\n if min(st,val*2,targ) or min(st,val*10+1,targ):\r\n st.append(val)\r\n return True\r\n return False\r\nst=[]\r\nval,targ=[int(a) for a in input().split()]\r\nif min(st,val,targ):\r\n print(\"YES\")\r\n print(len(st))\r\n print(*st[::-1])\r\nelse:\r\n print(\"NO\")", "a, b = list(map(int, input().split()))\r\n\r\nstack = [a]\r\nreached = False\r\ndef dfs(a, b, stack):\r\n global reached\r\n if a >= b:\r\n if a == b:\r\n reached = True\r\n print(\"YES\")\r\n print(len(stack))\r\n print(*stack)\r\n return\r\n else:\r\n dfs(a*2, b, stack+[a*2])\r\n dfs(a*10 + 1, b, stack+[a*10 + 1])\r\n \r\n \r\ndfs(a, b, stack)\r\nif not reached:\r\n print(\"NO\")", "a, b = map(int, input().split())\r\nx = [b]\r\nj = b\r\np = True\r\nwhile a not in x and j >= a:\r\n if j % 2 == 0:\r\n j = int(j/2)\r\n x.append(j)\r\n elif (j - 1) % 10 == 0:\r\n j = int((j-1)/10)\r\n x.append(j)\r\n else:\r\n print(\"NO\")\r\n p = False\r\n break\r\nif a in x and b in x:\r\n print(\"YES\")\r\n print(len(x))\r\n x = sorted(x)\r\n for i in x:\r\n print(i, end=\" \")\r\nelif p:\r\n print(\"NO\")\r\n\r\n \r\n", "'''2 162\r\n 2\r\n 8 21 \r\n 16 81 \r\n 32 161 \r\n 64 xx xx\r\n 128 xx\r\n xx xx\r\n'''\r\n\r\n\r\nans = []\r\nflag = 1\r\n\r\ndef dfs(i):\r\n global flag, m, n, ans \r\n \r\n if flag == 0:\r\n return\r\n \r\n if i == m:\r\n flag = 0\r\n print(\"YES\")\r\n print(len(ans) + 1, end = '\\n')\r\n print(n , end = ' ')\r\n for j in range(len(ans)):\r\n print(ans[j], end = ' ')\r\n return\r\n\r\n if i > m:\r\n return\r\n\r\n ans.append(i * 2)\r\n dfs(i * 2)\r\n ans.pop()\r\n \r\n ans.append(i * 10 + 1)\r\n dfs(i * 10 + 1)\r\n ans.pop()\r\n\r\nn, m = map(int, input().split())\r\ndfs(n)\r\nif flag == 1:\r\n print('NO')", "def trans(a,b):\r\n l = [b]\r\n while True:\r\n if l[-1]==a:\r\n l.reverse()\r\n return l\r\n if l[-1]<a:\r\n return [] #means NO\r\n if l[-1]%10 == 1:\r\n l.append(l[-1]//10)\r\n continue\r\n if l[-1]%2 == 0:\r\n l.append(l[-1]//2)\r\n continue\r\n return [] #means NO\r\n\r\na,b = list(map(int,input().split()))\r\nr = trans(a,b)\r\nif len(r)>0:\r\n print('YES')\r\n print(len(r))\r\n print(*r)\r\nelse:\r\n print('NO')\r\n", "a,b = [int(x) for x in input().split()]\r\ndef solve(i,prev):\r\n if i>b:\r\n return False\r\n elif i<b:\r\n return solve(2*i,prev + [2*i]) or solve(10*i + 1,prev + [10*i+1])\r\n \r\n elif i==b:\r\n print(\"YES\")\r\n print(len(prev))\r\n print(*prev)\r\n return True\r\n\r\n \r\n \r\n \r\nif not (solve(a,[a])):\r\n print(\"NO\")", "from collections import deque\n\na, b = map(int, input().split())\n\nfila = deque([a])\npai = {}\n\nwhile len(fila) > 0:\n atual = fila.popleft()\n dois = 2*atual\n dez = 10*atual+1\n\n if dois not in pai and dois <= b:\n pai[dois] = atual\n fila.append(dois)\n if dez not in pai and dez <= b:\n pai[dez] = atual\n fila.append(dez)\n\nout = [b]\nif b not in pai:\n print('NO')\nelse:\n print('YES')\n elem = b\n while elem != a:\n elem = pai[elem]\n out.append(elem)\n\n print(len(out))\n string = ''\n for i in range(len(out)-1,-1,-1):\n if i == len(out)-1:\n string += str(out[i])\n else:\n string += ' ' + str(out[i])\n print(string)\n \t \t \t \t \t \t \t\t \t \t\t\t \t", "from collections import deque\n\nseqa = list(map(int, input().split()))\na = seqa[0]\nb = seqa[1]\npre = {}\nfila = deque([a])\nwhile fila:\n v = fila.popleft()\n if 2 *v not in pre and 2*v <= b:\n fila.append(2*v)\n pre[2*v] = v\n if 10 *v +1 not in pre and 1+10*v <= b:\n fila.append(10*v+1)\n pre[10*v+1] = v\nseq =[b]\nif b not in pre:\n print(\"NO\")\nelse:\n print(\"YES\")\n x = b\n while x!=a:\n x = pre[x]\n seq.append(x)\n print(len(seq))\n fim = []\n for i in seq[::-1]:\n fim.append(i)\n print(*fim)\n\n\n\t \t \t \t \t\t \t\t\t\t\t \t \t\t \t \t\t\t\t", "a,b=tuple(map(int, input().split()))\n\ndef ans(solvable,path):\n if solvable:\n print(f\"YES\\n{len(path)}\")\n print(path[0], end=\"\")\n for i in range(1,len(path)): \n print(f\" {path[i]}\", end=\"\")\n print()\n\ndef rec(a,b,path):\n if a==b: \n ans(True, path)\n return True\n elif a>b: return False\n else:\n return rec(a<<1,b,path[:]+[2*a]) or \\\n rec(a*10+1,b,path[:]+[10*a+1])\n\nif not rec(a,b,[a]): print(\"NO\")\n\n\t \t \t \t\t\t \t\t \t \t\t \t\t", "a, b = map(int, input().split())\r\n\r\nres = [b]\r\nf = True\r\nwhile b > a:\r\n if b & 1:\r\n b -= 1\r\n if b % 10 != 0:\r\n f = False\r\n break\r\n b //= 10\r\n else:\r\n b //= 2\r\n res.append(b)\r\n\r\nif not f or res[-1] != a:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(res))\r\n print(*res[::-1])\r\n\r\n\r\n\r\n\r\n\r\n", "def solucao(arr, target):\r\n global done\r\n if (arr == [] or done or arr[-1] > target):\r\n return\r\n if (arr[-1] == target):\r\n done = True\r\n return\r\n\r\n n = arr[-1]\r\n \r\n arr.append(2 * n)\r\n solucao(arr, target)\r\n if (done):\r\n return\r\n else:\r\n arr.pop(-1)\r\n \r\n arr.append(10 * n + 1)\r\n solucao(arr, target)\r\n if (done):\r\n return\r\n else:\r\n arr.pop(-1)\r\n \r\n return\r\n\r\nipt = input().split(\" \")\r\na, b = int(ipt[0]), int(ipt[1])\r\ndone = False\r\narr = [a]\r\nsolucao(arr, b)\r\n\r\nif done:\r\n print(\"YES\")\r\n print(len(arr))\r\n for e in arr:\r\n print(e, end=\" \")\r\n print()\r\nelse:\r\n print(\"NO\")", "a, b = input().split()\na = int(a)\nb = int(b)\narr = [b]\n\nwhile(b > 0):\n if b % 2 == 0:\n b //= 2\n arr.append(b)\n\n elif ((b - 1) % 10) == 0:\n b -= 1\n b //= 10\n arr.append(b)\n \n else:\n break\n \n if b == a:\n break\n\n\nif arr[len(arr) - 1] != a:\n print('NO')\n\nelse:\n print('YES')\n print(len(arr))\n\n for i in range(len(arr) - 1, -1, -1):\n print(arr[i], end=\" \")\n print()\n \t \t \t \t\t \t \t \t \t \t \t\t", "import sys, math\n\n\ndef is_possible(num1, num2):\n if num1 > num2:\n return False\n elif num1 == num2:\n return True\n else:\n if is_possible(num1 * 2, num2):\n arr.append(num1 * 2)\n return True\n elif is_possible(num1 * 10 + 1, num2):\n arr.append(num1 * 10 + 1)\n return True\n return False\n\n\na, b = list(map(int, sys.stdin.readline().rstrip().split()))\narr = []\nif is_possible(a, b):\n print(\"YES\")\n print(len(arr) + 1)\n arr.reverse()\n print(f\"{a} \" + \" \".join([str(i) for i in arr]))\nelse:\n print(\"NO\")\n", "a,b=map(int,input().split())\r\ndef rec(curr,tar,res):\r\n if(curr>tar):\r\n return False\r\n if(curr==tar):\r\n return True\r\n else:\r\n res.append(curr*2)\r\n bool=rec(curr*2,tar,res)\r\n if(not bool):\r\n res.pop(len(res)-1)\r\n res.append(curr*10+1)\r\n bool2=rec(curr*10+1,tar,res)\r\n if(not bool2):\r\n res.pop(len(res)-1)\r\n return bool2\r\n else:\r\n return True\r\nres=[a]\r\nb=rec(a,b,res)\r\nif(b):\r\n print(\"YES\")\r\n print(len(res))\r\n for i in res:\r\n print(i,end=\" \")\r\nelse:\r\n print(\"NO\")", "def generateTracking(start, end, i, seq):\n if (start == end):\n return seq\n if (start > end):\n return []\n else:\n double = start*2\n digit = start*10 + 1\n return generateTracking(double, end, i+1, [*seq, double]) or generateTracking(digit, end, i+1, [*seq, digit])\n\na, b = list(map(int, input().split()))\nsequence = generateTracking(a, b, 1, [a])\n\nif (len(sequence) == 0):\n print('NO')\nelse:\n print('YES')\n print(len(sequence))\n print(*sequence, sep = \" \")", "a, b = map(int, input().split())\r\nans = [b]\r\nwhile (b % 10 == 1 or b % 2 == 0) and b > 0 and b > a:\r\n if b % 2 == 0:\r\n b //= 2\r\n ans.append(b)\r\n elif b % 10 == 1 and b != 1:\r\n b = int(str(b)[:-1])\r\n ans.append(b)\r\n elif b == 1:\r\n ans.append(1)\r\n break\r\n \r\nif a == b:\r\n print('YES')\r\n print(len(ans))\r\n print(*(reversed(ans)))\r\nelse:\r\n print('NO')", "i,n=map(int,input().split())\r\n\r\ncheck =False\r\ndef solve(i,n,p):\r\n global check\r\n if i==n:\r\n check=True\r\n print(\"YES\")\r\n print(len(p))\r\n print(*p)\r\n return\r\n if(i<n):\r\n solve(2*i,n,p+[2*i])\r\n solve(10*i+1,n,p+[10*i+1])\r\n \r\nsolve(i,n,[i])\r\nif not check:\r\n print(\"NO\")", "enter = input().split()\na = int(enter[0])\nb = int(enter[1])\n\noutput = \"%i\" % a\nnumber = 1\nfound = []\nfinal_out = []\nfinal_number = [] \n\ndef transformation(a, b, found, output, number, final_out, final_number):\n if (a < b):\n for i in [0, 1]:\n if (i == 0):\n transformation(a*2, b, found, (output+\" %i\" % (a*2)), number + 1, final_out, final_number) \n else:\n transformation(a*10+1, b, found, (output+\" %i\" % (a*10+1)), number + 1, final_out, final_number)\n else:\n if(a == b):\n found.append(1)\n final_out.append(output)\n final_number.append(number)\n\n\n\ntransformation(a, b, found, output, number, final_out, final_number)\n\nif (1 in found):\n print(\"YES\")\n print(final_number[0])\n print(final_out[0])\n\nelse:\n print(\"NO\")\n\t \t\t\t\t \t \t \t\t \t", "from collections import deque\n\na, b = list(map(int, input().split()))\nres = {}\nqueue = deque([a])\n\nwhile queue:\n x = queue.popleft()\n if 2 * x not in res and 2 * x <= b:\n queue.append(2 * x)\n res[2 * x] = x\n if 10 * x + 1 not in res and 10 * x + 1 <= b:\n queue.append(10 * x + 1)\n res[10 * x + 1] = x\n sequence = [b]\nif b not in res:\n print(\"NO\")\nelse:\n print(\"YES\")\n z = b\n while z != a:\n z = res[z]\n sequence.append(z)\n\n print(len(sequence))\n\n ans = \"\"\n for j in range(len(sequence) - 1, -1, -1):\n if j != 0:\n ans += str(sequence[j]) + \" \"\n else:\n ans += str(sequence[j])\n\n print(ans)\n\t \t \t \t\t\t\t \t\t\t\t\t\t \t\t \t \t \t", "from collections import deque\r\nimport sys\r\nsys.setrecursionlimit(5000)\r\n\r\n# ~ class Graph(object):\r\n # ~ def __init__(self, vertices, adj):\r\n # ~ self.vertices = vertices#[v for v in range(1, vertices+1)]\r\n # ~ self.dist = self.init_dist(vertices)\r\n # ~ self.adj = adj\r\n \r\n # ~ def init_dist(self, v):\r\n # ~ d = {}\r\n # ~ for i in range(1, v+1):\r\n # ~ d[i] = 0\r\n # ~ return d\r\n \r\n \r\n # ~ def iter_vertices(self):\r\n # ~ for v in range(1,self.vertices+1):\r\n # ~ yield v\r\n \r\n # ~ def adj_list(self, v):\r\n # ~ return self.adj[v]\r\n\r\n\t\t\r\nclass dfs_result:\r\n def __init__(self):\r\n self.parent = {}\r\n self.finish_time = {}\r\n self.start_time = {}\r\n self.edges = {}\r\n self.order = []\r\n self.t = 0\r\n self.found = False\r\n\r\n \r\n \r\n \r\n# ~ def dfs(g):\r\n # ~ result = dfs_result()\r\n # ~ for vertex in g.iter_vertices():\r\n # ~ if vertex not in result.parent:\r\n # ~ dfs_visit(g, vertex, result )\r\n # ~ return result\r\n \r\ndef adj_list(v):\r\n l = []\r\n l.append(v*10+1)\r\n l.append(2*v)\r\n return l\r\n\t\t\t\r\ndef dfs_visit(v, result, dest, parent = None):\r\n result.parent[v] = parent\r\n result.t += 1\r\n result.start_time[v] = result.t\r\n if v == dest:\r\n result.found = True\r\n if parent:\r\n result.edges[(parent, v)] = 'tree'\r\n if result.found or v>dest:\r\n return \r\n else:\r\n for n in adj_list(v):\r\n if n not in result.parent:\r\n dfs_visit(n, result, dest, v)\r\n elif (n not in result.finish_time):\r\n if (n,v) not in result.edges:\r\n result.edges[(v, n)] = 'back'\r\n result.loop = [v, n]\r\n elif result.start_time[v] < result.finish_time[n]:\r\n result.edges[(v, n)] = 'forward'\r\n else:\r\n result.edges[(v, n)] = 'cross'\r\n result.t += 1\r\n result.finish_time[v] = result.t\r\n result.order.append(v)\r\n \r\n# ~ class BFSResult:\r\n # ~ def __init__(self):\r\n # ~ self.level = {}\r\n # ~ self.parent = {}\r\n \r\n# ~ def bfs(g, r, loop_dict, s):\r\n # ~ r.parent = {s:None}\r\n # ~ r.level = {s:0}\t\r\n\r\n # ~ queue = deque()\r\n # ~ queue.append(s)\r\n # ~ while queue:\r\n # ~ u = queue.popleft()\r\n # ~ for n in g.adj_list(u):\r\n # ~ if (n not in r.level) and n not in loop_dict:\r\n # ~ r.parent[n] = u\r\n # ~ r.level[n] = r.level[u] + 1\r\n # ~ g.dist[n] = r.level[n]\r\n # ~ queue.append(n)\r\n \r\nif __name__ == '__main__':\r\n s, d = list(map(int, input().rstrip().split()))\r\n r = dfs_result()\r\n dfs_visit(s, r, d)\r\n # ~ print(r.parent)\r\n ans = []\r\n if r.found:\r\n print('YES')\r\n ans.append(d)\r\n while r.parent[d]!=s:\r\n ans.append(r.parent[d])\r\n d = r.parent[d]\r\n ans.append(s)\r\n print(len(ans))\r\n for i in range(len(ans)-1, -1, -1):\r\n print(ans[i], end = ' ')\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", "a,b = list(map(int,input().strip().split()))\r\nlst = []\r\ncnt = [0]\r\n\r\ndef transform(a,b,cnt,lst):\r\n if a==b:\r\n cnt[0]+=1\r\n lst.append(a)\r\n return True\r\n if a>b:\r\n return False\r\n if transform(2*a,b,cnt,lst) :\r\n cnt[0]+=1\r\n lst.append(a)\r\n return True\r\n if transform((10*a)+1,b,cnt,lst):\r\n cnt[0]+=1\r\n lst.append(a)\r\n return True\r\n \r\nif transform(a,b,cnt,lst):\r\n print(\"YES\")\r\n print(cnt[0])\r\n lst.reverse()\r\n print(str(lst).replace('[','').replace(']','').replace(',',' '))\r\nelse:\r\n print(\"NO\")\r\n", "def find(a, b):\r\n if a == b:\r\n return [-1]\r\n \r\n if a > b: \r\n return []\r\n\r\n option_a = [int(str(a)+\"1\")] + find(int(str(a)+\"1\"), b)\r\n option_b = [a*2] + find(a*2, b)\r\n \r\n if len(option_a) == 1 and len(option_b) == 1: return []\r\n elif len(option_a) == 1 and len(option_b) != 1: return option_b\r\n elif len(option_a) != 1 and len(option_b) == 1: return option_a\r\n else: return option_a\r\n\r\n\r\na, b = list(map(int, input().split()))\r\n\r\nresp = find(a, b)\r\nif len(resp): \r\n print(\"YES\")\r\n print(len(resp))\r\n print(a, end=\" \")\r\n for i in resp[:-1]: print(i, end=\" \")\r\n \r\nelse: print(\"NO\")", "# To convert number A into B\n#with given operations: 1. multiply the current number by 2 (that is, replace the number x by 2·x).......\n#2. append the digit 1 to the right of current number (that is, replace the number x by 10·x + 1).\na, b = map(int,input().split())\nlst = []\ncounter = 0\n\ndef recrusion(a, b, counter):\n lst.append(a)\n\n if a > b:\n return -1\n\n if a == b:\n print(\"YES\")\n print(counter)\n print(*lst)\n lst[0] = b\n return 0\n else:\n counter = counter + 1\n # multiply with 2\n temp = a*2\n recrusion(temp,b, counter)\n lst.pop()\n # append 1\n temp = a*10 + 1\n recrusion(temp, b, counter)\n lst.pop()\n\n\nrecrusion(a, b, 1)\nif lst[-1] != b:\n print(\"NO\")\n", "from collections import deque\n\na, b = map(int, input().split())\nvisited = set()\nparent = {}\nqueue = deque()\nqueue.append(a)\nvisited.add(a)\n\nwhile queue:\n current = queue.popleft()\n \n if current == b:\n break\n\n double = current * 2\n if double <= b and double not in visited:\n visited.add(double)\n parent[double] = current\n queue.append(double)\n\n append_one = current * 10 + 1\n if append_one <= b and append_one not in visited:\n visited.add(append_one)\n parent[append_one] = current\n queue.append(append_one)\n\nif b not in visited:\n print(\"NO\")\nelse:\n path = [b]\n while b != a:\n b = parent[b]\n path.append(b)\n \n path.reverse()\n \n print(\"YES\")\n print(len(path))\n print(*path)\n\n\t\t\t\t\t \t\t\t\t\t\t \t\t\t\t \t\t \t\t\t", "a, b = map(int, input().split())\r\nout = [b]\r\n \r\nwhile a < b:\r\n\tif b % 10 == 1:\r\n\t\tb = b // 10\r\n\telif b % 2 == 0:\r\n\t\tb = b // 2\r\n\telse:\r\n\t\tbreak\r\n\tout.append(b)\r\n \r\nout.reverse()\r\n\r\nif a == b:\r\n print(\"YES\")\r\n print(len(out))\r\n print(*out)\r\nelse:\r\n print(\"NO\")\r\n", "a,b=map(int,input().split())\r\nS=[]\r\nk=0\r\nZ=''\r\nwhile b>a :\r\n S.append(str('%.0f'%(b)))\r\n if b%2==0 :\r\n b=b//2\r\n else :\r\n b=(b-1)/10\r\n k=k+1\r\nS.append(str('%.0f'%(b)))\r\nfor i in range(k+1) :\r\n Z=S[i]+' '+Z\r\nif a==b :\r\n print('YES')\r\n print(k+1)\r\n print(Z)\r\nelse :\r\n print('NO')", "a,b = map(int,input().split())\r\ndef recur(a,b,tmp,f):\r\n if f[0]:\r\n return \r\n if a==b:\r\n print(\"YES\")\r\n print(len(tmp))\r\n print(\" \".join([str(i) for i in tmp]))\r\n f[0]=1\r\n return\r\n \r\n elif a>b:\r\n return\r\n \r\n tmp.append(2*a)\r\n recur(2*a,b,tmp,f)\r\n tmp.pop()\r\n tmp.append(10*a+1)\r\n recur(10*a+1,b,tmp,f)\r\n tmp.pop()\r\ntmp = [a]\r\nf = [0]\r\nrecur(a,b,tmp,f)\r\nif not f[0]:\r\n print(\"NO\")", "i, n = map(int, input().split())\r\nflag = False\r\ndef solve(i, n, m):\r\n global flag\r\n if i == n:\r\n flag = True\r\n print(\"YES\")\r\n print(len(m))\r\n print(*m)\r\n return\r\n if(i < n):\r\n solve(2*i, n, m+ [2*i])\r\n solve(10*i + 1, n, m + [10*i+1])\r\nsolve(i, n, [i])\r\nif not flag:\r\n print(\"NO\")", "from collections import deque #Importa \"fila\" do Python\n\na, b = input().split() #Lê na mesma linha A e B\na = int(a) #Converte A em INT\nb = int(b) #Converte B em INT\nant = {} #Cria um map que guarda o anterior\nfila = deque([a]) #\"fila\" é uma fila que já começa com A\n\nwhile fila: #Enquanto tiver coisa na fila\n v = fila.popleft() #V recebe o primeiro valor e já retira da fila\n if(2*v not in ant and 2*v <=b): #Se 2*v não está no map e 2*v é menor que B\n fila.append(2*v) #Adicione ao final da fila \n ant[2*v]=v #Anterior na posição [2*v] = v\n\n if(10*v+1 not in ant and 10*v+1 <=b):\n fila.append(10*v+1)\n ant[10*v+1] = v\n\nseq = [b] #Sequência recebe o valor final B\n\nif(b not in ant): #Se não tiver B no array de anterior\n print(\"NO\") #Printe \"não\"\n\nelse:\n print(\"YES\")\n x = b\n while x != a:\n x = ant[x]\n seq.append(x)\n print(len(seq))\n for i in range(len(seq)-1, -1, -1):\n print(seq[i], end=\" \")\n print()\n\t \t \t \t\t \t\t \t \t \t \t", "start, end = map(int, input().split())\ncurrent = end\nsequence = []\nwhile end > start:\n if end % 10 == 1:\n end = end // 10\n sequence.append(end)\n elif end % 2 == 0:\n end = end // 2\n sequence.append(end)\n else:\n break\n\nif start == end:\n print(\"YES\")\n sequence = sequence[::-1]\n sequence.append(current)\n print(len(sequence))\n print(*sequence)\nelse:\n print(\"NO\")\n\n\t \t\t\t\t\t \t\t\t \t \t\t\t\t \t \t\t\t\t\t\t", "a, b = map(int, input().split())\r\n\r\ndef make_tree(a, b, tree):\r\n c1 = -1\r\n c2 = -1\r\n \r\n # tree.append('layer')\r\n if b % 2 == 0:\r\n c1 = b // 2\r\n tree.append(c1)\r\n elif (b - 1) % 10 == 0:\r\n c2 = (b - 1) // 10\r\n tree.append(c2)\r\n else:\r\n return []\r\n\r\n if c1 == a or c2 == a:\r\n return tree\r\n else:\r\n if c1:\r\n make_tree(a, c1, tree)\r\n if c2:\r\n make_tree(a, c2, tree)\r\n\r\ntree = [b]\r\nmake_tree(a, b, tree)\r\n\r\nif tree[-1] == a:\r\n print('YES')\r\n print(len(tree))\r\n print(' '.join(map(str, tree[::-1])))\r\nelse:\r\n print('NO')\r\n", "res = []\ndef f(atual, objetivo):\n global res\n if (atual <= objetivo) and (atual == objetivo or f(2*atual, objetivo) or f(10*atual + 1, objetivo)):\n res += [atual]\n return True\n return False\na, b = input().split()\na, b = int(a), int(b)\nif f(a, b):\n print(\"YES\")\n print(len(res))\n print(*reversed(res), sep=\" \", end=\"\\n\")\nelse:\n print(\"NO\")\n \t\t\t \t \t \t\t \t\t \t\t \t\t \t", "a, b = map(int, input().split())\r\n\r\nv = [b]\r\nwhile b > a:\r\n if b % 2 == 0:\r\n b //= 2\r\n elif (b - 1) % 10 == 0:\r\n b = (b - 1) // 10\r\n else:\r\n break\r\n v.append(b)\r\n\r\nif v[-1] != a:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(v))\r\n print(*reversed(v))\r\n", "a, b = list(map(int, input().split()))\r\ndef dfs(a, b, ans = []):\r\n if a == b:\r\n ans.append(a)\r\n return ans\r\n \r\n if a > b:\r\n return False\r\n \r\n ans.append(a)\r\n l = dfs(a * 2, b, ans)\r\n if l:\r\n return l\r\n \r\n r = dfs(a * 10 + 1, b, ans)\r\n if r:\r\n return r\r\n ans.pop()\r\n return False\r\n\r\nans = dfs(a, b)\r\nif ans == False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(ans))\r\n print(*ans)", "a,b=list(map(int,input().split(\" \")))\r\nl=[]\r\nl.append(b)\r\nans=False\r\nwhile b>0:\r\n if b%2==0: \r\n b=b//2\r\n l.append(b)\r\n elif (b-1)%10==0: \r\n b=b-1\r\n b=b//10\r\n l.append(b)\r\n else:\r\n break\r\n if a==b: \r\n ans=True\r\n break\r\nif ans==True:\r\n print(\"YES\")\r\n print(len(l))\r\n print(*l[::-1])\r\nelse:\r\n print(\"NO\")", "inn, ni = map(int, input().split())\r\n\r\ncheck = False\r\ndef solve(inn, ni, pa):\r\n global check\r\n if inn == ni:\r\n check = True\r\n print(\"YES\")\r\n print(len(pa))\r\n print(*pa)\r\n return\r\n if(inn < ni):\r\n solve(2*inn, ni, pa + [2*inn])\r\n solve(10*inn + 1, ni, pa + [10*inn+1])\r\n\r\n#backtracking\r\n\r\n\r\nsolve(inn, ni, [inn])\r\nif not check:\r\n print(\"NO\")", "a,b = map(int,input().split())\r\nc = 1\r\nk = 'YES'\r\narr = [b]\r\nwhile True:\r\n if str(b)[-1] == '1':\r\n b //= 10\r\n c+=1\r\n arr.append(b)\r\n elif b%2==0:\r\n b //= 2\r\n arr.append(b)\r\n c+=1\r\n else:\r\n k = 'NO'\r\n break\r\n if b==a:\r\n break\r\n if b<a:\r\n k = 'NO'\r\n break\r\nprint(k)\r\nif k=='YES':\r\n print(c)\r\n print(*arr[::-1])", "from sys import stdin as fin\n# fin = open(\"tc1a.in\")\n \n# n = int(fin.readline())\na, b = map(int, fin.readline().split())\n# line = tuple(fin.readline().strip())\n# line = fin.readline()\n \nchain = []\nwhile a < b:\n chain.append(str(b))\n if b % 10 == 1:\n b //= 10\n elif b % 2 == 0:\n b //= 2\n else:\n break\nif a == b:\n print(\"YES\")\n print(len(chain) + 1)\n print(a, ' '.join(reversed(chain)))\nelse:\n print(\"NO\")", "global isprint\r\nisprint = False\r\ndef f(x, y, list):\r\n global isprint\r\n if isprint == True:\r\n return\r\n if x == y:\r\n print('YES')\r\n print(len(list))\r\n for i in list:\r\n print(i, end = ' ')\r\n isprint = True\r\n return\r\n if x > y:\r\n return\r\n list.append(x * 2)\r\n f(x * 2, y, list)\r\n list.pop()\r\n list.append(x * 10 + 1)\r\n f(x * 10 + 1, y, list)\r\n list.pop()\r\na, b = list(map(int, input().split(\" \")))\r\nf(a, b, [a])\r\nif isprint == False:\r\n print(\"NO\")", "start, end = input().split()\r\nstart = int(start)\r\nend = int(end)\r\ntab = []\r\ndef operation(num, tab):\r\n if num > end:\r\n return False\r\n if num == end:\r\n return True\r\n a = num*2\r\n b = num*10 + 1\r\n\r\n if operation(a, tab) or operation(b, tab):\r\n tab.append(num)\r\n return True\r\n else:\r\n return False\r\n\r\na = operation(start, tab)\r\nif a:\r\n print(\"YES\")\r\n tab.append(end)\r\n tab.sort()\r\n print(len(tab))\r\n for i in range(len(tab)):\r\n print(tab[i], end = \" \")\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\r\n\r\nans = [b]\r\n\r\nwhile a < b:\r\n if b % 10 == 1:\r\n b //= 10\r\n elif b % 2 == 0:\r\n b //= 2\r\n else:\r\n print(\"NO\")\r\n break\r\n ans.append(b)\r\nelse:\r\n if a > b:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n print(len(ans))\r\n print(' '.join(map(str, ans[::-1])))\r\n\r\n", "n1, n2=map(int,input().split())\nans=[n2]\nwhile n2>n1:\n d=n2%10\n if d==1:n2//=10\n elif d%2: break\n else: n2//=2\n ans+=[n2]\nans=ans[::-1]\nprint([f'YES\\n{len(ans)}\\n{\" \".join(map(str,ans))}','NO'][n1 != n2])\n\t\t \t\t\t\t\t \t \t \t \t \t \t\t \t \t", "cur,final = map(int,input().split())\r\nstatus = True\r\ndef solve(num,path):\r\n global status\r\n if num>final:\r\n return \r\n if num==final:\r\n print(\"YES\")\r\n status = False\r\n print(len(path))\r\n print(*path)\r\n\r\n solve(2*num,path+[2*num])\r\n if status:\r\n solve(num*10+1,path+[num*10+1])\r\n\r\nsolve(cur,[cur])\r\nif status:\r\n print(\"NO\")", "inputs = [int(items) for items in input().split()]\r\ninital = inputs[0]\r\ntarget = inputs[1]\r\n\r\ndef find_results(result,initial,target,elements):\r\n if initial > target:\r\n return -1,None\r\n if initial == target:\r\n result.append(initial)\r\n return len(result),result\r\n result.append(initial)\r\n status, arr = find_results(result, 10 * initial + 1, target,elements+1)\r\n if status !=-1:\r\n return status,arr\r\n result = result[:elements]\r\n status,arr=find_results(result,2*initial,target,elements+1)\r\n return status,arr\r\n\r\nstatus,data=find_results([],inital,target,1)\r\nif status ==-1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(status)\r\n print(' '.join([str(elem) for elem in data]))", "a,b=map(int,input().split())\r\nflag=True\r\ncnt=1\r\nans=[b]\r\nwhile a<b:\r\n if b%2==0:\r\n b=b//2\r\n else:\r\n if str(b)[-1]=='1':\r\n b=int(str(b)[:-1])\r\n else:\r\n flag=False\r\n break\r\n cnt+=1\r\n ans.append(b)\r\nif flag==False or a>b:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(cnt)\r\n print(*reversed(ans))", "from collections import deque\na, b = map(int, input().split(\" \"))\np = {}\nq = deque([a])\nwhile q:\n v = q.popleft()\n if 2*v not in p and 2*v <= b:\n q.append(2*v)\n p[2*v] = v\n if 10*v+1 not in p and 10*v+1 <= b:\n q.append(10*v+1)\n p[10*v+1] = v\n\ns = [b]\nif b not in p:\n print(\"NO\")\nelse:\n print(\"YES\")\n x = b\n while x != a:\n x = p[x]\n s.append(x)\n print(len(s))\n s.reverse()\n print(' '.join(map(str, s)))\n\n \t \t \t\t \t\t \t \t \t\t\t \t \t\t \t \t\t", "num_possuido, num_desejado = map(int, input().split())\n\naux = []\naux.append(num_desejado)\nwhile(num_desejado > num_possuido):\n if (num_desejado % 10) == 1:\n num_desejado = num_desejado // 10\n aux.append(num_desejado)\n elif (num_desejado % 2 == 0):\n num_desejado = num_desejado // 2\n aux.append(num_desejado)\n else:\n print(\"NO\")\n exit()\n\ntamanho_da_seq = len(aux)\nseq = \"\"\naux.reverse()\nfor i in aux:\n seq += str(i) + \" \"\n\nif(num_desejado == num_possuido):\n print(\"YES\")\n print(tamanho_da_seq)\n print(seq)\nelse:\n print(\"NO\")\n\t \t\t\t \t \t \t\t \t\t \t\t\t \t", "a,b=list(map(int,input().split()))\ntmp=b\n\narr=[str(b)]\nc=0\nwhile(tmp>=a):\n\tif(tmp==a):\n\t\tprint(\"YES\")\n\t\tprint(len(arr))\n\t\tarr=arr[::-1]\n\t\tprint(' '.join(arr))\n\t\texit()\n\t\t\n\tif(tmp%2!=0):\n\t\tif(str(tmp)[-1]!='1'):\n\t\t\tprint(\"NO\")\n\t\t\texit()\n\t\telse:\n\t\t\ttmp=int(str(tmp)[:-1])\n\telse:\n\t\ttmp=tmp//2\n\n\tarr.append(str(tmp))\n\t# c+=1\nprint(\"NO\")", "a,b=map(int,input().split())\nl=[b]\nflag=False\nwhile a<=b:\n if b==a:\n print(\"YES\")\n print(len(l))\n print(*reversed(l)) \n flag=True\n break\n elif b%2 ==0:\n b = b//2\n l.append(b)\n elif b%10 ==1:\n b =(b-1)//10\n l.append(b)\n else:\n break\nif not flag:\n print(\"NO\") \n\t \t \t \t\t \t\t \t\t\t \t\t\t \t", "a,b = map(int,input().split())\r\norder = [b]\r\nwhile order[-1]>a:\r\n\tif order[-1]%2==0:\r\n\t\torder.append(order[-1]//2)\r\n\telif order[-1]%10==1:\r\n\t\torder.append(order[-1]//10)\r\n\telse:\r\n\t\torder.append(0)\r\nif order[-1]==a:\r\n\tprint(\"YES\")\r\n\tprint(len(order))\r\n\tprint(' '.join(map(str,order[::-1])))\r\nelse:\r\n\tprint(\"NO\")", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nf=0\r\nl=[]\r\nwhile(b>a):\r\n if (b%2==1):\r\n if (b-1)%10==0:\r\n l.append(b)\r\n b=(b-1)//10\r\n else:\r\n print(\"NO\")\r\n f=1\r\n break\r\n else:\r\n l.append(b)\r\n b=b//2\r\nif (f==0):\r\n if a==b:\r\n print(\"YES\")\r\n l.append(a)\r\n print(len(l))\r\n for i in range (len(l)):\r\n print(l[len(l)-i-1],end=' ')\r\n else:\r\n print(\"NO\")\r\n", "lis = input().split()\r\na,b = int(lis[0]),int(lis[1])\r\nparent = {}\r\nparent[a]=None\r\nstack = [a]\r\nflag = False\r\nwhile stack:\r\n\tnode = stack.pop()\r\n\tif(node==b):\r\n\t\tflag = True\r\n\t\tbreak\r\n\telif(node<b):\r\n\t\tn = [2*node,10*node+1]\r\n\t\tfor i in n:\r\n\t\t\tparent[i]=node\r\n\t\t\tstack.append(i)\r\nif not flag:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tlis = []\r\n\tcurr = b\r\n\twhile(curr!=None):\r\n\t\tlis.append(curr)\r\n\t\tcurr = parent[curr]\r\n\tlis.reverse()\r\n\tprint(len(lis))\r\n\tfor i in lis:\r\n\t\tprint(i,end = \" \")\r\n\tprint()", "def get_user_input():\n user_input = input().split()\n x = int(user_input[0])\n n = int(user_input[1])\n return x, n\n\ndef is_valid(x, n):\n\treturn x <= n\n\nresults = []\n\ndef transformation(x, n, seq, i):\n\tif x == n:\n\t\tresults.append((i, seq))\n\telse:\n\t\tvalue_append = (10 * x) + 1\n\t\tvalue_double = 2 * x\n\t\tif is_valid(value_append, n):\n\t\t\ttransformation(value_append, n, [*seq, str(value_append)], i + 1)\n\t\tif is_valid(value_double, n):\n\t\t\ttransformation(value_double, n, [*seq, str(value_double)], i + 1)\n\nx, n = get_user_input()\ntransformation(x, n, [str(x)], 1)\n\nif len(results) > 0:\n\tprint(\"YES\")\n\tfor result in results:\n\t\tprint(result[0])\n\t\tprint(\" \".join(result[1]))\nelse:\n\tprint(\"NO\")\n\n \t \t \t\t \t\t \t \t\t \t\t \t\t\t", "#/usr/bin/env python3\r\na, b = input().split(' ')\r\na = int(a)\r\nb = int(b)\r\nseq = list()\r\nseq.append(b)\r\nwhile a!=b and b and b%10 not in (3, 5, 7, 9):\r\n if b%10==1:\r\n b = b//10\r\n else:\r\n b = b//2\r\n seq.append(b)\r\nif a==b:\r\n seq.reverse()\r\n print('YES')\r\n n = len(seq)\r\n print(n)\r\n for i in seq:\r\n print(i, end = ' ', flush = True)\r\nelse:\r\n print('NO')", "ls = []\r\nnum,aim = map(int,input().split())\r\nflag = True\r\nwhile num!=aim:\r\n if aim<num:\r\n flag = False\r\n break\r\n ls.append(aim)\r\n if aim%2 == 0:\r\n aim //= 2\r\n elif aim%10 == 1:\r\n aim //= 10\r\n else:\r\n flag = False\r\n break\r\nls.append(num)\r\nans = len(ls)\r\nif flag==False:print('NO')\r\nelse:\r\n print('YES')\r\n print(ans)\r\n for i in ls[::-1]:\r\n print(i,end=' ')", "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 # 1 2 3 -> [1, 2, 3]\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n # abc -> [\"a\", \"b\", \"c\"]\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# Definitions\r\n\r\ndef output_list(l):\r\n print(\" \".join(list(map(str, l))))\r\n\r\nclass Node:\r\n def __init__(self, i, next):\r\n self.i = i\r\n self.next = next\r\n def __str__(self):\r\n return str(self.i)\r\n\r\nfrom collections import deque\r\n\r\ndef test_case():\r\n a, b = inlt()\r\n\r\n visited = set()\r\n routes = {a: [a]}\r\n\r\n q = deque([])\r\n q.append(a)\r\n\r\n while q:\r\n val = q.popleft()\r\n visited.add(val)\r\n \r\n if val == b:\r\n print(\"YES\")\r\n print(len(routes[val]))\r\n output_list(routes[val])\r\n return\r\n\r\n if 2*val not in visited and 2*val <= b:\r\n q.append(2*val)\r\n routes[2*val] = routes[val][:]\r\n routes[2*val].append(2*val)\r\n\r\n if 10*val+1 not in visited and 2*val <= b:\r\n q.append(10*val+1)\r\n routes[10*val+1] = routes[val][:]\r\n routes[10*val+1].append(10*val+1)\r\n\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n test_case()\r\n", "def fun(x, y, d):\r\n if x > y:\r\n return False\r\n if x == y:\r\n d.append(x)\r\n print(\"YES\")\r\n print(len(d))\r\n print(*d)\r\n return True\r\n d.append(x)\r\n if fun(2 * x, y, d[:]) or fun(10 * x + 1, y, d[:]):\r\n return True\r\n return False\r\n\r\n\r\na, b = map(int, input().split())\r\nd = []\r\nif not fun(a, b, d[:]):\r\n print(\"NO\")\r\n", "#!/opt/homebrew/bin/python3\n\ndef is_odd(n: int) -> bool:\n return n % 2 == 1\n\ndef is_even(n: int) -> bool:\n return not is_odd(n)\n\ndef last_digit(n: int) -> int:\n return n % 10\n\ndef main():\n a, b = map(int, input().split())\n\n numbers = [b]\n\n while True:\n last_number = numbers[-1]\n if last_number <= a:\n break\n\n if is_even(last_number):\n numbers.append(last_number // 2)\n\n elif is_odd(last_number) and last_digit(last_number) == 1:\n numbers.append(last_number // 10) # remove last digit\n\n else:\n break\n\n\n if numbers[-1] == a:\n print('YES')\n print(len(numbers))\n print(*numbers[::-1])\n else:\n print('NO')\n\n\nif __name__ == '__main__':\n main()", "a,b=map(int,input().split())\r\nans= [b]\r\nwhile True:\r\n if b%10==1:\r\n b=b//10\r\n elif b%2==0:\r\n b=b//2\r\n else:\r\n break\r\n if a>=b:\r\n break\r\n ans.append(b)\r\nans.append(a)\r\nif a!=b:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(len(ans))\r\n print(*ans[::-1])", "import sys\n\n\ndef solution(ins):\n a, b = [int(v) for v in ins.split(\" \")]\n ret = []\n\n def util(n):\n ret.append(n)\n if n > b:\n return False\n if n == b:\n return True\n n1 = n*10+1\n if util(n1):\n return True\n ret.pop()\n n2 = n*2\n if util(n2):\n return True\n ret.pop()\n return False\n util(a)\n return ret\n\n\nif __name__ == \"__main__\":\n if sys.argv[-1] == 't':\n cases = [\n [\"2 162\", []],\n [\"4 42\", []],\n [\"100 40021\", []]\n ]\n for case in cases:\n r = solution(*case[:-1])\n if r != case[-1]:\n print(case, r)\n else:\n ret = solution(input())\n if len(ret) > 1:\n print(\"YES\")\n print(len(ret))\n print(\" \".join([str(d) for d in ret]))\n else:\n print(\"NO\")\n\n\t \t\t \t \t\t\t \t\t\t \t \t\t \t", "a, b = map(int, input().split())\r\n \r\nc = [b]\r\nwhile b != a:\r\n\tif b % 10 == 1:\r\n\t\tb //= 10\r\n\telif b % 2 == 0 and b > 0:\r\n\t\tb //= 2\r\n\telse:\r\n\t\tbreak\r\n\tc.append(b)\r\nif (a == b):\r\n\tc.reverse()\r\n\tprint('YES')\r\n\tprint(len(c))\r\n\tfor i in c:\r\n\t\tprint(i, end = ' ')\r\nelse:\r\n\tprint('NO')", "a, b = map(int, input().split())\nl = []\naux = 1\n\nwhile b > a:\n l.append(b)\n if b % 2 == 0:\n b = b // 2\n elif b % 10 == 1:\n b = b // 10\n else:\n ok = 0\n break\n\nif b != a:\n aux = 0\nelse:\n l.append(a)\n\nif not aux:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(len(l))\n for i in range(len(l) - 1, 0, -1):\n print(l[i], end=\" \")\n\n print(l[0])\n\t \t\t \t\t\t \t \t\t\t \t \t\t\t", "mem = {}\n\na,b = map(int, input().split())\n\ndef possible(n):\n if n == b: \n return True\n if n > b: \n return False\n if n in mem:\n return mem[n]\n\n mem[n] = possible(n*2) or possible(n*10 + 1)\n return mem[n]\n\nif not possible(a):\n print('NO')\nelse:\n print('YES')\n ans = []\n while b >= a:\n ans.append(b)\n if b % 2 == 1:\n b = int(b/10)\n else:\n b = int(b/2)\n ans.reverse()\n print(len(ans))\n print(' '.join(map(str, ans)))\n \t\t \t \t\t \t \t\t \t\t \t\t\t \t\t\t\t", "def AtoB(a, b, caminho):\n caminho.append(b)\n if( a == b):\n return True\n elif(a > b):\n return False\n \n if(b % 2 == 0):\n return AtoB(a, int(b/2), caminho)\n elif(str(b)[-1] == '1'):\n return AtoB(a, int((b - 1)/10), caminho)\n \n return False\n\ndef main():\n entrada = input().split()\n a = int(entrada[0])\n b = int(entrada[1])\n\n caminho = []\n if(AtoB(a, b, caminho)):\n print(\"YES\")\n print(len(caminho))\n for i in range(len(caminho) - 1, 0, -1):\n print(caminho[i], end = \" \")\n print(caminho[0])\n else:\n print(\"NO\")\n\nmain()\n \t \t \t \t \t\t\t \t \t \t \t \t\t\t\t", "a,b=[int(x) for x in input().split()]\r\na,b=str(a),str(b)\r\n\r\nl=[b]\r\ncount=1\r\nflag=0\r\n\r\nwhile int(b)>int(a):\r\n \r\n b=str(b)\r\n if b[-1]=='1':\r\n b=b[0:-1]\r\n l.append(b)\r\n count+=1\r\n \r\n elif int(b)%2==0: \r\n b=str(int(int(b)/2))\r\n l.append(b)\r\n count+=1\r\n \r\n else:\r\n flag=1\r\n break\r\n \r\n\r\nif flag==1 or b<a:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(count)\r\n for i in l[::-1]:\r\n print(i,end=\" \")\r\n \r\n ", "# Transformation from A to B\n# (c) Alexandre Corlet\n\nfrom collections import deque\nfrom sys import stdin\n\npredecessor = dict()\n\ndef readints():\n return [int(i) for i in stdin.readline().split()]\n\n\ndef BFS(s, u):\n Q = deque()\n\n Q.append(s)\n predecessor[s] = -1\n\n while Q:\n v = Q.popleft()\n\n x = v * 2\n y = v * 10 + 1\n\n if x <= u and x not in predecessor:\n predecessor[x] = v\n Q.append(x)\n if y <= u and y not in predecessor:\n predecessor[y] = v\n Q.append(y)\n\n\ndef print_predecessors(v):\n ans = []\n\n p = predecessor[v]\n\n ans.append(v)\n while p != - 1:\n ans.append(p)\n p = predecessor[p]\n \n print(len(ans))\n print(*ans[::-1]) \n\n\ndef main():\n a, b = readints()\n \n BFS(a, b)\n \n if b in predecessor:\n print(\"YES\")\n print_predecessors(b)\n else:\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n main()\n\n", "from queue import Queue as q\r\na, b = map(int, input().split())\r\nQ = q()\r\nq.put(Q, (a, [a]))\r\nwhile not Q.empty():\r\n i = Q.get()\r\n if i[0] == b:\r\n print('YES')\r\n print(len(i[1]))\r\n print(*i[1])\r\n break\r\n elif i[0] < b:\r\n Q.put((i[0]*2, i[1]+[i[0]*2]))\r\n Q.put((i[0]*10+1, i[1]+[i[0]*10+1]))\r\nelse:\r\n print('NO')\r\n", "n, target = map(int, input().split())\r\nans = []\r\ndef fun(n, ds):\r\n global ans1\r\n \r\n if n > target:\r\n return \r\n \r\n if n == target:\r\n ds.append(n)\r\n ans.append(ds.copy())\r\n return \r\n \r\n \r\n \r\n fun(n * 2, ds + [n])\r\n \r\n \r\n fun(int(str(n) + \"1\"), ds + [n])\r\n \r\n\r\n \r\nfun(n, []) \r\nif ans:\r\n print(\"YES\")\r\n print(len(ans[0]))\r\n for i in ans[0]:\r\n print(i, end = \" \")\r\nelse:\r\n print(\"NO\")", "\r\ndef solve(lista, alvo):\r\n global done\r\n if (lista == [] or done or lista[-1] > alvo):\r\n return\r\n if (lista[-1] == alvo):\r\n done = True\r\n return\r\n\r\n n = lista[-1]\r\n lista.append(2 * n)\r\n solve(lista, alvo)\r\n if (done):\r\n return\r\n else:\r\n lista.pop(-1)\r\n \r\n lista.append(10 * n + 1)\r\n solve(lista, alvo)\r\n if (done):\r\n return\r\n else:\r\n lista.pop(-1)\r\n \r\n return\r\n\r\n\r\n\r\nipt = input().split(\" \")\r\na, b = int(ipt[0]), int(ipt[1])\r\ndone = False\r\nlista = [a]\r\n\r\n\r\nsolve(lista, b)\r\n\r\nif done:\r\n print(\"YES\")\r\n print(len(lista))\r\n for e in lista:\r\n print(e, end=\" \")\r\n print()\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\nans = [b]\n \nwhile (b > a):\n if (b % 2 == 0):\n b //= 2\n ans.append(b)\n elif (b % 10 == 1):\n b //= 10\n ans.append(b)\n else:\n break\n \nif (b == a):\n print('YES')\n print(len(ans))\n print(*reversed(ans))\nelse:\n print('NO')\n\t\t\t\t\t \t \t \t\t \t\t \t \t\t \t\t\t", "a, b = map(int, input().split())\r\n\r\nk = 1\r\nnumbers = str(b)\r\n\r\nwhile(a < b):\r\n\tif(b % 2 == 0):\r\n\t\tb = b/2\r\n\t\tk+= 1\r\n\t\tnumbers = str(int(b)) + \" \" + numbers\r\n\t\t\t\r\n\telif(b % 10 == 1):\r\n\t\tb = b//10\r\n\t\tk+= 1\r\n\t\tnumbers = str(int(b)) + \" \" + numbers\r\n\t\r\n\telse:\r\n\t\tb = 0\r\n\t\t\t\r\n\r\nif(a == b):\r\n\tprint(\"YES\")\r\n\tprint(k)\r\n\tprint(numbers)\r\n\t\r\nelse:\t\r\n\tprint(\"NO\")", "def primeiraOperacao(valor):\n return 2 * valor\n\ndef segundaOperacao(valor):\n return 10 * valor + 1\n\ndef transformacao(x,y,arrayAux):\n resultadoPrimeiraOperacao = primeiraOperacao(x)\n resultadoSegundaOperacao = segundaOperacao(x)\n\n if(x > y):\n return False\n if(x == y):\n return True\n\n aux1 = transformacao(resultadoPrimeiraOperacao,y,arrayAux)\n\n if(aux1):\n arrayAux.append(resultadoPrimeiraOperacao)\n return True\n\n else:\n aux2 = transformacao(resultadoSegundaOperacao,y,arrayAux)\n\n if(aux2):\n arrayAux.append(resultadoSegundaOperacao)\n return True\n\n return False\n\nvalor1,valor2 = [int(e) for e in input().split()]\n\narrayAux = []\n\nsequence = transformacao(valor1,valor2,arrayAux)\n\nif(len(arrayAux) == 0):\n print(\"NO\")\nelse:\n print(\"YES\")\n arrayAux.append(valor1)\n arrayAux.reverse()\n print(len(arrayAux))\n print(*arrayAux, sep=\" \")", "a, b = map(int, input().split(\" \"))\niterations = [b]\n\nwhile (b > 0):\n if (b % 2 == 0):\n b = b // 2\n iterations = [b] + iterations\n elif ((b - 1) % 10 == 0):\n b = b // 10\n iterations = [b] + iterations\n else:\n break\n if (b == a):\n break\n\nif (iterations[0] == a):\n print(\"YES\")\n print(len(iterations))\n result = \"\"\n for i in range(len(iterations)):\n result += str(iterations[i]) + (\" \" if (i < len(iterations) - 1) else \"\")\n print(result)\nelse:\n print(\"NO\")\n", "a, b = map(int, input().split())\r\n\r\nt = []\r\ny = True\r\nwhile b > a:\r\n if b % 10 == 1:\r\n t.append(b)\r\n b //= 10\r\n elif b % 2 == 0:\r\n t.append(b)\r\n b //= 2\r\n else:\r\n y = False\r\n break\r\nt.append(b)\r\n\r\nif b == a and y:\r\n print(\"YES\")\r\n print(len(t))\r\n for i in range(len(t) - 1, -1, -1):\r\n print(t[i], end=\" \")\r\nelse:\r\n print(\"NO\")", "a,b = map(int,input().split())\r\nq,s=[b],0\r\nwhile b>a:\r\n if b%2==0:b=b//2\r\n elif str(b)[-1]=='1': b = int(str(b)[0:len(str(b))-1])\r\n else:break\r\n q.append(b)\r\nif a==b:\r\n print('YES')\r\n print(len(q))\r\n print(*reversed(q))\r\nelse: print('NO')", "a,b = [int(x) for x in input().split()]\r\ndef solve(a, b, string, count):\r\n if a > b:\r\n pass\r\n elif a == b:\r\n print(\"YES\")\r\n print(count + 1)\r\n print(string + str(a))\r\n exit()\r\n else:\r\n solve(2*a, b, string + str(a) + \" \", count + 1)\r\n solve(10*a + 1, b, string + str(a) + \" \", count + 1)\r\nsolve(a,b,\"\",0)\r\nprint(\"NO\")", "def transformABHelper(a, b, level,ans):\n global minSteps, dictionary \n if(a>b):\n return\n \n if(a==b):\n minSteps = min(minSteps, level)\n ans.append(a)\n dictionary[minSteps]=ans\n return\n \n \n transformABHelper(a*2,b,level+1,ans+[a])\n transformABHelper((a*10)+1,b,level+1,ans+[a])\n\n\n\ndef transformAB(a,b):\n global minSteps, dictionary\n minSteps = float('inf')\n level = 1\n ans=[]\n dictionary={}\n transformABHelper(a,b,level,ans)\n if(minSteps==float('inf')):\n print('NO')\n else:\n print('YES')\n print(minSteps)\n for i in dictionary[minSteps]:\n print(i, end=\" \")\n\n\n\na, b = map(int, input().split())\ntransformAB(a,b)\n\n", "from collections import deque\na,b = map(int, input().split())\npre = {}\nfila = deque([a])\nwhile fila:\n v = fila.popleft()\n if 2*v not in pre and 2*v <= b:\n fila.append(2*v)\n pre[2*v] = v\n if 10*v+1 not in pre and 10*v+1 <=b:\n fila.append(10*v+1)\n pre[10*v+1] = v\nseq = [b]\nif b not in pre:\n print(\"NO\")\nelse:\n print(\"YES\")\n x = b\n while x != a:\n x = pre[x]\n seq.append(x)\n print(len(seq))\n for i in seq[::-1]:\n print(f'{i} ', end=\"\")\n\t \t\t\t \t \t\t\t\t \t\t\t\t\t", "# coding: utf-8\na, b = input().split(\" \")\na, b = int(a), int(b)\n\nMULTIPLY = 0\nAPPEND = 1\n\ndef a_to_b(array, op, target):\n x = array[-1]\n\n if x == target:\n print(\"YES\")\n print(len(array))\n print(\" \".join([str(i) for i in array]))\n return True\n elif x > target:\n return False\n else:\n if op == MULTIPLY:\n x = x * 2\n else:\n x = 10 * x + 1\n\n return a_to_b(array + [x], MULTIPLY, target) or a_to_b(array + [x], APPEND, target)\n \ndef transform_a_to_b(a, b):\n m_branch = a_to_b([a], MULTIPLY, b)\n a_branch = a_to_b([a], APPEND, b)\n\n if not m_branch and not a_branch:\n print(\"NO\")\n\ntransform_a_to_b(a, b)\n \n \t\t\t\t \t\t\t \t \t \t", "a,b = map(int, input().split())\r\narr = []\r\narr.append(b)\r\nwhile a < b:\r\n if b % 2 == 0:\r\n b //= 2\r\n elif b % 10 == 1:\r\n b //= 10\r\n else:\r\n break\r\n arr.append(b)\r\narr.sort()\r\nif a == b:\r\n print(\"YES\")\r\n print(len(arr))\r\n print(*arr)\r\nelse:\r\n print(\"NO\")" ]

{"inputs": ["2 162", "4 42", "100 40021", "1 111111111", "1 1000000000", "999999999 1000000000", "1 2", "1 536870912", "11111 11111111", "59139 946224", "9859 19718", "25987 51974222", "9411 188222222", "25539 510782222", "76259 610072", "92387 184774", "8515 85151111", "91939 9193911", "30518 610361", "46646 373168844", "30070 300701", "13494 1079528", "96918 775344422", "13046 260921", "29174 5834811", "79894 319576421", "96022 1920442", "79446 6355681", "5440 27853056", "250000000 705032705", "17 35", "1 3", "2 11"], "outputs": ["YES\n5\n2 4 8 81 162 ", "NO", "YES\n5\n100 200 2001 4002 40021 ", "YES\n9\n1 11 111 1111 11111 111111 1111111 11111111 111111111 ", "NO", "NO", "YES\n2\n1 2 ", "YES\n30\n1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 131072 262144 524288 1048576 2097152 4194304 8388608 16777216 33554432 67108864 134217728 268435456 536870912 ", "YES\n4\n11111 111111 1111111 11111111 ", "YES\n5\n59139 118278 236556 473112 946224 ", "YES\n2\n9859 19718 ", "YES\n5\n25987 259871 2598711 25987111 51974222 ", "YES\n6\n9411 94111 941111 9411111 94111111 188222222 ", "YES\n6\n25539 255391 2553911 25539111 255391111 510782222 ", "YES\n4\n76259 152518 305036 610072 ", "YES\n2\n92387 184774 ", "YES\n5\n8515 85151 851511 8515111 85151111 ", "YES\n3\n91939 919391 9193911 ", "YES\n3\n30518 61036 610361 ", "YES\n7\n46646 466461 932922 9329221 93292211 186584422 373168844 ", "YES\n2\n30070 300701 ", "YES\n5\n13494 134941 269882 539764 1079528 ", "YES\n7\n96918 193836 1938361 3876722 38767221 387672211 775344422 ", "YES\n3\n13046 26092 260921 ", "YES\n4\n29174 58348 583481 5834811 ", "YES\n6\n79894 798941 1597882 15978821 31957642 319576421 ", "YES\n3\n96022 960221 1920442 ", "YES\n5\n79446 158892 317784 635568 6355681 ", "YES\n11\n5440 10880 108801 217602 435204 870408 1740816 3481632 6963264 13926528 27853056 ", "NO", "NO", "NO", "NO"]}

UNKNOWN

PYTHON3

CODEFORCES

275

9244db8730fb75772e42e09626cc70a0

Lucky Transformation

Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not. Petya has a number consisting of *n* digits without leading zeroes. He represented it as an array of digits without leading zeroes. Let's call it *d*. The numeration starts with 1, starting from the most significant digit. Petya wants to perform the following operation *k* times: find the minimum *x* (1<=≤<=*x*<=<<=*n*) such that *d**x*<==<=4 and *d**x*<=+<=1<==<=7, if *x* is odd, then to assign *d**x*<==<=*d**x*<=+<=1<==<=4, otherwise to assign *d**x*<==<=*d**x*<=+<=1<==<=7. Note that if no *x* was found, then the operation counts as completed and the array doesn't change at all. You are given the initial number as an array of digits and the number *k*. Help Petya find the result of completing *k* operations. The first line contains two integers *n* and *k* (1<=≤<=*n*<=≤<=105,<=0<=≤<=*k*<=≤<=109) — the number of digits in the number and the number of completed operations. The second line contains *n* digits without spaces representing the array of digits *d*, starting with *d*1. It is guaranteed that the first digit of the number does not equal zero. In the single line print the result without spaces — the number after the *k* operations are fulfilled. Sample Input 7 4 4727447 4 2 4478 Sample Output 4427477 4478

[ "n,k=map(int,input().split())\r\ns=[*input()]+[0,0]\r\ni=1\r\nwhile k and i<=n:\r\n if s[i-1]==\"4\" and s[i]==\"7\" and s[i+1]==\"7\" and i%2:\r\n if k%2:\r\n s[i]=\"4\"\r\n break\r\n elif s[i-1]==\"4\" and s[i]==\"4\" and s[i+1]==\"7\" and i%2:\r\n if k%2:\r\n s[i]=\"7\"\r\n break\r\n elif s[i-1]==\"4\" and s[i]==\"7\":\r\n if i%2:\r\n s[i]=\"4\"\r\n else:\r\n s[i-1]=\"7\"\r\n k-=1\r\n i+=1\r\nprint(\"\".join(s[:n]))", "n, k = map(int, input().split())\r\ns = list(input())\r\nfor i in range(10):\r\n s.append('0')\r\ni = 0\r\nwhile i < n and k:\r\n if s[i] == '4' and s[i+1] == '7' and s[i+2] == '7' and not (i & 1):\r\n k %= 2\r\n if k and s[i] == '4' and s[i+1] == '7':\r\n if i & 1:\r\n s[i] = s[i+1]\r\n else:\r\n s[i+1] = s[i]\r\n i -= 2\r\n k -= 1\r\n i += 1\r\nans = ''\r\nfor i in range(n):\r\n ans += s[i]\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def b3_lucky_transformation(n, k, s):\n i = 1\n while k and i < n:\n if s[i] == '4' and s[i+1] == '7':\n if s[i-1] == '4' and i % 2 == 0:\n if k % 2 == 1:\n s[i] = '7'\n k = 0\n else:\n if i % 2 == 0:\n s[i] = '7'\n i += 2\n k -= 1\n else:\n s[i+1] = '4'\n i +=1\n k -=1\n else:\n i +=1\n return s\n\nif __name__ == \"__main__\":\n [n, k] = map(int, input().split())\n s = input()\n s = ' ' + s\n s = list(s)\n result = b3_lucky_transformation(n, k, s)\n for i in range (1,n+1):\n print(result[i],end='')\n", "import heapq\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\nd = list(input().rstrip())\r\nh = []\r\nfor i in range(n - 1):\r\n if d[i] == 52 and d[i + 1] == 55:\r\n heapq.heappush(h, i)\r\nk = min(k, 2 * n + k % 2)\r\nfor _ in range(k):\r\n ok = 0\r\n while not ok and h:\r\n i = heapq.heappop(h)\r\n if d[i] ^ 52 or d[i + 1] ^ 55:\r\n continue\r\n ok = 1\r\n if not i % 2:\r\n d[i + 1] -= 3\r\n else:\r\n d[i] += 3\r\n for j in range(i - 1, i + 2):\r\n if not 0 <= j < n - 1:\r\n continue\r\n if d[j] == 52 and d[j + 1] == 55:\r\n heapq.heappush(h, j)\r\nans = \"\".join(map(str, [chr(i) for i in d]))\r\nsys.stdout.write(ans)", "# 447 or 477 start with odd\n\n\nn, k = map(int, input().split())\ns = input()\ns = list(s)\n\nfor i in range(n - 1):\n if not k:\n break\n if s[i] != '4':\n continue\n tt = ''.join(s[i:i + 3])\n if tt in ('447', '477') and i % 2 == 0:\n if k % 2 == 1 and tt == '447':\n s[i + 1] = '7'\n if k % 2 == 1 and tt == '477':\n s[i + 1] = '4'\n break\n if s[i] == '4' and s[i + 1] == '7':\n if i % 2 == 0:\n s[i + 1] = '4'\n else:\n s[i] = '7'\n k -= 1\n\nprint(''.join(s))\n", "n, k = map(int, input().split())\nt = list(input())\ni, m = 0, n // 2\nif k > m: k = m + ((m + k) & 1)\nwhile k and i < n - 1:\n if t[i] == '4' and t[i + 1] == '7':\n k -= 1\n if i & 1 == 0: t[i + 1] = '4'\n else:\n t[i] = '7'\n i -= 2\n i += 1\nprint(''.join(t))\n\n\t \t \t\t\t\t\t \t \t \t\t \t\t\t\t\t \t \t\t\t", "n,k=map(int,input().split())\r\ns = list(input())\r\ni=0\r\nwhile i<n-1 and k>0:\r\n if s[i]=='4' and s[i+1]=='7':\r\n k-=1\r\n if (i%2)==0:\r\n s[i]='4'\r\n s[i+1]='4'\r\n else:\r\n s[i]='7'\r\n if i-1>=0 and s[i-1]=='4':\r\n i -= 2\r\n k = k%2\r\n i+=1\r\nprint (''.join(s))\r\n" ]

{"inputs": ["7 4\n4727447", "4 2\n4478", "7 7\n4211147", "7 6\n4747477", "10 2\n9474444474", "10 47\n4214777477", "3 99\n447", "4 1000000000\n7747", "3 1000000000\n447", "3 100\n447", "7 74\n4777774", "10 200\n6860544593", "10 477\n5837934237", "47 7477\n83492039276961836565341994102530448486552156001", "100 0\n9179665522184092255095619209953008761499858159751083177424923082479016015954927554823400601862864827", "485 9554485\n77591213686327368525391827531734680282181149581181587323024775516707756080151536104831756264659461447807315739541829004122483827102803764919259852061561098901393332937462039404423475012940096002301663119780442182470831027122573263011092200024968051233448164275142862251531399243063800892848783227559284462449919786387761960941614255036371684927500361571685732032325070607701306810264624073744998990612133986362972207072576588540217974702060321406370425911824802563123926135054749895722", "74 7\n47437850490316923506619313479471062875964157742919669484484624083960118773", "47 7\n77774477747474477477477774747747447447774777474", "100 2\n7477774774777474774777777474474474744477777477774444477444774474477774777474774744477474744474777444", "99 1\n474747444774447474444477474747774774447444477744774744477747777474777774777474477744447447447447477", "74 1000000000\n77474447774774747474777447474777777477474444477747444777447444474744744444", "74 999999999\n47474777744447477747777774774777447474747747447744474777477474777774774447", "100 47\n4346440647444704624490777777537777677744747437443404484777536674477779371445774947477174444474400267", "100 1000000000\n5849347454478644774747479437170493249634474874684784475734456487776740780444477442497447771444047377", "154 96\n7967779274474413067517474773015431177704444740654941743448963746454006444442746745494233876247994374947948475494434494479684421447774484909784471488747487", "2 0\n47", "5 0\n12473"], "outputs": ["4427477", "4478", "4211177", "4444477", "9774444774", "4217777777", "477", "7744", "447", "447", "4777774", "6860544593", "5837934237", "83492039276961836565341994102530448486552156001", "9179665522184092255095619209953008761499858159751083177424923082479016015954927554823400601862864827", "77591213686327368525391827531734680282181149581181587323024475516707756080151536104831756264659461447807315739541829004122483827102803764919259852061561098901393332937462039404423475012940096002301663119780442182470831027122573263011092200024968051233448164275142862251531399243063800892848783227559284462449919786387761960941614255036371684927500361571685732032325070607701306810264624073744998990612133986362972207072576588540217974702060321406370425911824802563123926135054749895722", "44437850490316923506619313449771062875964157742919669484484624083960118773", "77774777747474477477477774747747447447774777474", "7777774474777474774777777474474474744477777477774444477444774474477774777474774744477474744474777444", "444747444774447474444477474747774774447444477744774744477747777474777774777474477744447447447447477", "77444444774774747474777447474777777477474444477747444777447444474744744444", "44444477744447477747777774774777447474747747447744474777477474777774774447", "4346440644444404624490777777537777677747747437443404484777536674477779371445774947477174444474400267", "5849377454448644774747479437170493249634474874684784475734456487776740780444477442497447771444047377", "7967779274444413067517444773015431177704444740654941743448963746454006444442746745494233876247994374947948475494434494479684421447774484909784471488747487", "47", "12473"]}

UNKNOWN

PYTHON3

CODEFORCES

7

924ee6af45d93e3e9e8d31fd75d78f25

Palindromic Supersequence

You are given a string *A*. Find a string *B*, where *B* is a palindrome and *A* is a subsequence of *B*. A subsequence of a string is a string that can be derived from it by deleting some (not necessarily consecutive) characters without changing the order of the remaining characters. For example, "cotst" is a subsequence of "contest". A palindrome is a string that reads the same forward or backward. The length of string *B* should be at most 104. It is guaranteed that there always exists such string. You do not need to find the shortest answer, the only restriction is that the length of string *B* should not exceed 104. First line contains a string *A* (1<=≤<=|*A*|<=≤<=103) consisting of lowercase Latin letters, where |*A*| is a length of *A*. Output single line containing *B* consisting of only lowercase Latin letters. You do not need to find the shortest answer, the only restriction is that the length of string *B* should not exceed 104. If there are many possible *B*, print any of them. Sample Input aba ab Sample Output abaaabaa

[ "a=input()\r\na1,c=a[::-1],-1\r\nif a==a1:\r\n print(a)\r\n quit()\r\nfor i in range(len(a)):\r\n if a[i:]==a1[:-i]:\r\n c=i\r\n break\r\nif c==-1:\r\n print(a+a1)\r\n quit()\r\nprint(a+a[:c][::-1])\r\n", "A = input()\r\n\r\nprint(A+A[::-1])", "def pal(s):\r\n if(s==s[::-1]):\r\n return 1;\r\n else:\r\n return 0\r\nk=input()\r\nif(pal(k)==1):\r\n print(k)\r\nelse:\r\n print(k+k[::-1])", "s=input()\nprint(s+''.join(reversed(s)))\n", "s=input()\nx=s[::-1]\nif(s==x):\n\tprint(s)\nelse:\n\tprint(s+x)\n", "n=input()\r\na=n[::-1]\r\nif n==a:\r\n print(n)\r\nelse:\r\n print(n+a)", "a = input()\r\nb = list()\r\nfor i in range(len(a)):\r\n b.append(a[i])\r\n\r\nr = len(a) - 1\r\nfor i in range(len(a)):\r\n if a[i] != a[r - i]:\r\n b.insert(r - i, a[i])\r\n\r\nres = ''\r\nfor i in range(len(b)):\r\n res += b[i]\r\n\r\nprint(res)", "A = input().strip()\r\nprint(A + A[::-1])\r\n", "n=input()\r\nn=list(n)\r\nk=reversed(n)\r\nk=list(k)\r\nn=n+k\r\nabc=\"\"\r\nfor i in n:\r\n abc=abc+i\r\nprint(abc)", "str = input()\r\nprint(str+str[::-1])", "def line_is_palindrome(input_line):\r\n for i in range(0, len(input_line) // 2):\r\n if input_line[i] != input_line[-(i+1)]:\r\n return False\r\n return True\r\n\r\n\r\ndef get_lenght_base_palindrome(input_line):\r\n i = 0\r\n while True:\r\n if input_line[i] != input_line[-(i+1)]:\r\n return i\r\n i += 1\r\n\r\n\r\ndef create_palindrome(input_line, length_base_palindrome):\r\n if length_base_palindrome != 0:\r\n none_palindrome_subline = input_line[length_base_palindrome: -(length_base_palindrome + 1)]\r\n return input_line[:length_base_palindrome] + none_palindrome_subline + none_palindrome_subline[::-1] + input_line[:length_base_palindrome]\r\n return input_line + input_line[::-1]\r\n\r\n\r\ndef main():\r\n input_line = input()\r\n if line_is_palindrome(input_line):\r\n return input_line\r\n length_base_palindrome = get_lenght_base_palindrome(input_line)\r\n return create_palindrome(input_line, length_base_palindrome)\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "N = input().strip()\r\nprint( N + N[::-1] )\r\n", "s=input()\r\nN=len(s)\r\nfor i in range(2*N):\r\n if(i<N):\r\n print(s[i],end=\"\")\r\n else:\r\n print(s[2*N-i-1],end=\"\")", "s = input()\r\nif(s==s[::-1]):\r\n print(s)\r\nelse:\r\n print(s,end='')\r\n print(s[::-1])", "s = input()\ns1 = s[::-1]\nprint(s, s1, sep = '')", "n=input(\"\")\r\nm=n[::-1]\r\nif n==m:\r\n print(n)\r\nelse:\r\n print(n+m)", "A = input()\nC = []\nnum = len(A)\nfor i in range(num):\n C.append(A[num - i - 1])\nC = \"\".join(C)\nprint(A,end = \"\")\nprint(C)\n \t \t \t \t \t\t \t\t\t\t\t \t\t \t\t", "def palindrom(x):\r\n f=0\r\n while True :\r\n if x[f]==x[-f-1] :\r\n f+=1\r\n else :\r\n return f\r\n if f==len(x)//2 :\r\n return 'true'\r\ninp=input()\r\nwhile palindrom(inp)!='true' :\r\n inp=inp[:len(inp)-palindrom(inp)]+inp[palindrom(inp)]+inp[-palindrom(inp)+len(inp):]\r\nprint(inp)\r\n", "l=[char for char in input()]\r\nn=len(l)\r\nfor x in l:\r\n print(x,end=\"\")\r\n\r\nfor i in range(n-2,-1,-1):\r\n print(l[i],end=\"\")\r\n\r\nprint()", "s=input()\r\nl=len(s)\r\nfor i in range(l-1,-1,-1):\r\n s+=s[i]\r\nprint(s)\r\n", "line = input()\r\nprint(line + line[::-1])", "s = input()\ns = list(s)\nlength = len(s)\n\n#abcfff \n# if the origin string's length is 7000, we can only add 3000 elements, which means the par has to start from 3000 \n\nif length<5000:\n for i in range(length):\n s.append(s[length-1-i])\n print(''.join(s))\nelse: ## either add element from left or from right\n print (s)", "s=input()\r\ns1=s+s[::-1]\r\nprint(s1)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\na = input().rstrip()\r\nprint(a + a[::-1])", "x=list(input())\r\nfor i in x:\r\n print(i,end=\"\")\r\nx.reverse()\r\nfor i in x:\r\n print(i,end=\"\")", "a=input()\r\nwhile True:\r\n if a==a[::-1] and len(a)<10000:\r\n print(a)\r\n break\r\n else:\r\n a=a+a[::-1]\r\n", "a=input()\nif a==a[::-1]:\n print(a)\nelse:\n print(a[::-1]+a)", "import sys\nfor line in sys.stdin:\n if line == None or line == '\\n':\n break\n \n \n # first if it is already a palindrome then just ouput itself\n first, last = 0, len(line) - 1\n is_palin = True\n while first < last:\n if line[first] != line[last]:\n is_palin = False\n break\n first += 1\n last -= 1\n\n if is_palin:\n print(line)\n continue\n \n # dumbest move\n str_builder = ''\n for i in range(len(line) - 1, -1, -1):\n str_builder += line[i]\n print(str_builder + line)", "a = input()\r\nb = list(a)\r\nif list(a) != list(reversed(a)):\r\n for i in range(len(a)):\r\n b.insert(len(a),a[i])\r\n if b == list(reversed(b)):\r\n #print(b)\r\n break\r\n for e in b[:-1]:\r\n print(e, end='')\r\n print(b[-1])\r\nelse:\r\n print(a)", "s = input()\r\nd = s\r\nn = len(s)\r\nfor i in range(len(s)):\r\n d += s[n-1-i]\r\nprint(d)", "a=input()\r\nc=a\r\nb=a[::-1]\r\nprint(c+b)\r\n", "t = input()\r\nn = len(t)\r\ndef check_pal(st,n):\r\n for i in range(int(n/2)):\r\n if st[i] != st[n-i-1]:\r\n return construct_pal(st,n)\r\n return st\r\n\r\ndef construct_pal(st,n):\r\n ans = st\r\n if n <= 5000:\r\n for i in range(n):\r\n ans += st[n-i-1]\r\n return ans\r\n return\r\n\r\nprint(check_pal(t,n))", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\ns = input()\r\nans = \"\"\r\nfor i in range(1, len(s) + 1):\r\n\tans += s[-i]\r\nprint(s + ans) \r\n", "str1=input()\nlist0=list(str1)\nfor i in list0[::-1]:\n list0.append(i)\nstr2=''.join(list0)\nprint(str2)\n\t\t \t\t\t \t \t\t\t \t\t \t \t\t\t \t \t\t\t", "import sys\r\ninput = sys.stdin.readline\r\nins = lambda: input().rstrip()\r\nini = lambda: int(input().rstrip())\r\ninm = lambda: map(int, input().rstrip().split())\r\ninl = lambda: list(map(int, input().split()))\r\nout = lambda x, s='\\n': print(s.join(map(str, x)))\r\n\r\ns = ins()\r\nprint(s + s[::-1])", "s = input()\r\nn = len(s)\r\nc = [0 for i in range(2*len(s))]\r\nfor i in range(len(s)):\r\n c[i] = s[i]\r\n c[2*n-i-1] = s[i]\r\nprint(''.join(c))\r\n", "a = input().strip()\r\nprint(a, a[::-1], sep='')", "x = input().strip()\n\ndef test_3(x):\n return x + x[::-1]\n\n\naa = test_3(x)\nprint(aa)\n\n\t \t \t\t\t \t \t\t\t \t\t \t\t \t\t\t\t\t\t\t", "i = input()\r\nprint(i + ''.join(reversed(i)))", "def is_palindrome(str):\r\n return str == str[::-1]\r\n\r\nins = input()\r\nans = \"\"\r\ni = len(ins) - 1\r\nwhile not is_palindrome(ans + ins):\r\n ans+= ins[i]\r\n i -= 1\r\nprint(ans + ins)", "n=str(input())\r\nprint(n,end=\"\")\r\nl=len(n)\r\nfor i in range(l):\r\n\tprint(n[l-i-1],end=\"\")", "'''input\r\naba\r\n'''\r\ns=input()\r\nprint(s+s[::-1])", "s=input()\nprint(s,end=\"\")\nfor i in range(len(s)-1):\n\tprint(s[len(s)-2-i],end=\"\")\nprint()\n", "s=input()\r\nif(s==s[::-1]):\r\n print(s)\r\nelse:\r\n n=len(s)\r\n print(s+(s[:n-1])[::-1])\r\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\ta=read()\n\tprint(a+a[::-1])\n\nsolve()\n", "IL = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\ns = input()\r\nprint(s+s[::-1])", "a=input()\r\nl=list(a)\r\nprint(a,end=\"\")\r\nfor i in range(len(l)-2,-1,-1):\r\n\tprint(l[i],end=\"\") ", "# Palindromic Supersequence\n\na = input()\nb = a\nif a != a[::-1]:\n b = a + a[::-1]\nprint(b)", "st=str(input())\r\nprint(st,end=\"\")\r\nfor i in range(len(st)-1,-1,-1):\r\n\tprint(st[i],end=\"\")", "def isP(s):\n return s==s[::-1]\nx=list(input())\nk=x.copy()\nel=1\nwhile el <= len(x) and not isP(k) :\n k.append(x[len(x)-el-1])\n #print(str(k),el)\n el+=1\nprint(''.join(k))\n ", "s = input()\n# s = \"cotst\"\nb = \"\"\ni,j = 0,len(s)-1\nwhile i<j:\n if s[i]==s[j]:\n j-=1\n b = s[i] + b\n i+=1\nprint(s[:i+1] + b)\n", "from typing import Counter\r\n\r\n\r\ns = input()\r\ns += ''.join(reversed(s))\r\nprint(s)", "import difflib\n\ndef main():\n A = input()\n\n rev = A[::-1]\n print(A + rev[1:])\n\nmain()\n", "\r\n#m,n=list(map(int,input().split()))\r\na=input()\r\nprint(a+a[::-1])", "#!/usr/bin/env python3\n\nimport sys\n\ns = sys.stdin.readline().strip()\n\nprint (s + s[::-1])\n", "s = input()\r\ns2 = \"\".join(list(reversed(s)))\r\nprint(s + s2)", "\r\n\r\ndef main():\r\n a = input()\r\n print(a + a[::-1])\r\n\r\n\r\nif __name__ == '__main__':\r\n t = 1\r\n for i in range(t):\r\n main()\r\n\r\n\"\"\"\r\n4 5 6 7 8 9 10 11\r\n\"\"\"\r\n", "s = input()\r\nprint(s + ''.join(s[-i - 1] for i in range(len(s))))\r\n", "b=input()\r\nn=len(b)\r\na=b\r\ni=0\r\nj=n-1\r\nwhile i<=j:\r\n if b[i]==b[j]:\r\n i+=1\r\n j-=1\r\n else:\r\n b=b[:i]+b[j]+b[i:] \r\n i+=1 \r\n\r\nprint(b) \r\n ", "s = input()\r\nprint(s, ''.join(list(reversed(s))), sep=\"\")\r\n", "a = input()\r\ndef check_polindrom(a):\r\n for i in range(int(len(a) / 2)):\r\n if a[i] != a[len(a) - 1 - i]:\r\n return False\r\n return True\r\nif check_polindrom(a):\r\n print(a)\r\nelif len(a) * 2 < 10000:\r\n a += a[::-1]\r\n print(a)\r\n\r\n\r\n", "n=str(input())\r\nprint(n[::-1]+n)\r\n", "# Hello World !\n# Va Hamana Bazgashte Hame Be Sooye Oost\n\nstr = input()\nlength = len(str)\nfor i in range ( length - 1 , -1 , -1 ) :\n\tstr += str[i]\nprint(str)\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na = input().rstrip().decode()\r\nans = a + a[::-1]\r\nsys.stdout.write(ans)", "s=input()\r\nt=list(reversed(s))\r\na=\"\"\r\nfor i in range(len(t)):\r\n a=a+t[i]\r\nif a==s:\r\n print(a)\r\nelse:\r\n print(a+s)", "a = input()\nif a == a[::-1]:\n print(a)\nelse:\n x = a[1: 10 ** 4]\n b = x[::-1] + a\n print(b)", "s=input()\r\nl=list(s)\r\nr=l[::-1]\r\nr=''.join(r)\r\nprint(s+r)", "a = input()\r\nb = a + a[::-1]\r\nprint(b)", "s = input()\r\nif s == s[::-1]:\r\n print(s)\r\nelse:\r\n s2 = s[::-1]\r\n print(s+s2)", "from audioop import reverse\r\nfrom cmath import *\r\nfrom dataclasses import dataclass\r\nfrom decimal import *\r\n\r\ndef solves():\r\n n=list(input())\r\n s=reversed(n)\r\n if (s==n):\r\n print(n)\r\n else:\r\n n=''.join(n)\r\n s=''.join(s)\r\n print(n+s)\r\n\r\n\r\nt=1\r\n#t =int(input())\r\nfor _ in range(0,t):\r\n solves()\r\n", "s=str(input())\r\n\r\ndef p(s):\r\n if s== s[::-1]:\r\n return s\r\n \r\n else:\r\n x=s[0:len(s)-1][::-1]\r\n return s+x\r\n \r\n \r\nprint(p(s))\r\n", "st=input()\nprint(st[::-1],end=\"\")\nprint(st)\n", "a = input().strip()\nprint(\"{}{}\".format(a, a[::-1]))\n", "s=[x for x in input()]\r\ns1=list(reversed(s))\r\nprint(*s,*s1,sep=\"\")\r\n", "a = input()\r\nif a == a[::-1]:\r\n print(a)\r\nelse:\r\n print(a + a[len(a) - 2::-1])", "# maa chudaaye duniya\r\nx = input()\r\nprint(x + x[::-1])", "S = input()\rL = [s for s in S]\rL.reverse()\rprint(S+''.join(L))\r", "a=list(input())\r\nb=''\r\nfor i in a:\r\n b+=i\r\na.reverse()\r\nfor i in a:\r\n b+=i\r\nprint(b)", "line= input()\nlen1=len(line)\nstring = line[::-1]\nprint(line+string)", "a=input()\r\nif a==a[::-1]:\r\n print(a)\r\nelse:\r\n print(a+a[::-1])", "s=input()\r\nn=len(s)\r\ni,j=0,n-1\r\nc=[]\r\nwhile i<=j:\r\n c.append(s[i])\r\n if s[i]!=s[j]:\r\n c.append(s[j])\r\n i+=1\r\n j-=1\r\n#print(c)\r\nprint(''.join(c)+''.join(reversed(c)))", "if __name__ == '__main__' :\r\n s = input()\r\n print(s, end = '')\r\n for i in range(len(s)-1,-1,-1):\r\n print(s[i], end = '')", "import sys\r\n\r\ndef main():\r\n s = sys.stdin.read().strip()\r\n return s + s[::-1]\r\n \r\nprint(main())\r\n", "s=input()\r\na=''\r\nn=len(s)\r\ni=-1\r\nwhile i>=-n:\r\n a+=s[i]\r\n i=i-1\r\nif s==a:\r\n print(s)\r\nelse:\r\n for i in s:\r\n print(i,end='')\r\n i=0\r\n while i<len(a):\r\n if i==0:\r\n pass\r\n else:\r\n print(a[i],end='')\r\n i=i+1\r\n print()", "#This code sucks, you know it and I know it. \r\n#Move on and call me an idiot later.\r\n\r\na = input()\r\nb = \"\".join(reversed(a))\r\nprint(a+b)", "def is_palindrome(input):\n if(len(input) == 0):\n return False\n for i in range(int(len(input)/2)):\n if not(input[i] == input[len(input)-1-i]):\n return False\n return True\n\n\nin_string = input()\n\ncurr_string = in_string\nindex = len(curr_string) - 2\nwhile index >= 0 and not(is_palindrome(curr_string)):\n curr_string += in_string[index]\n index -= 1\nprint(curr_string)\n", "str = str(input())\r\nprint(str+str[::-1])", "inp = list(map(str,input()))\r\noutput = ''\r\ns = len(inp)\r\na=int(s/2)\r\nflag=1\r\nfor i in range(a):\r\n if inp[0+i]!=inp[s-1-i]:\r\n flag=0\r\n break\r\nif flag==0:\r\n for i in range(0,2*s):\r\n if i<s:\r\n output = output + inp[i]\r\n else:\r\n output = output + inp[s-i-1]\r\nelse:\r\n for i in range(s):\r\n output = output + inp[i]\r\nprint(output)\r\n", "word = str(input())\r\ni = len(word)-1\r\nwhile i >=0:\r\n word = word + word[i]\r\n i-=1\r\nprint(word)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a = input()\r\ndef control(x): return x == x[::-1]\r\na_len = len(a)\r\n\r\nmid1 = list(a[0: a_len // 2])\r\nmid2 = list(a[a_len // 2 + (a_len) % 2:: ])\r\nmid2 = mid2[:: -1]\r\n\r\nind = 0\r\nmid1_len = len(mid1)\r\nmid2_len = len(mid2)\r\nwhile(1):\r\n if(mid1 == mid2 and ind >= mid1_len): break\r\n if(mid1_len >= mid2_len): mid2.insert(ind, mid1[ind]); mid2_len += 1\r\n else: mid1.insert(ind, mid2[ind]); mid1_len += 1\r\n ind += 1\r\nf = \"\".join(mid1 + list(a[a_len // 2 : a_len // 2 + (a_len) % 2]) + mid2[::-1])\r\nprint(f)", "s = input()\nprint(s, *reversed(s), sep='')\n", "a = input()\nb = list(a)\nb.reverse()\nprint(a , end = \"\")\nfor i in b:\n\tprint(i , end = \"\")\n", "#\r\n# @author\tMoe_Sakiya \t[email protected]\r\n# @date \t2018-02-21 00:40:32\r\n#\r\n\r\nstring=input()\r\n\r\nprint(string+string[::-1])", "tr = input()\nprint(tr + tr[::-1])\n", "t=input()\r\ns=t[::-1]\r\nf=True\r\nfor i in range(len(t)):\r\n if(s[i]!=t[i]):\r\n f=False\r\n break\r\nif(f):\r\n print(t)\r\nelse:\r\n print(t+s)", "s = input()\nfor i in s:\n print(i, end='')\nprint(s[-1::-1])\n \t \t \t \t\t \t\t\t\t \t\t \t", "s=input()\r\ntemp=s[0:-1]\r\ntemp1=list(temp)\r\ntemp1.reverse()\r\ns=list(s)\r\nx=s+temp1\r\nprint(\"\".join(x))", "\"\"\"\r\n\thttps://codeforces.com/problemset/problem/932/A\r\n\tInput\r\n\t\tA\ta string\r\n\tOutput\r\n\t\tB\ta string, a palindrome from which A is a subsequence\r\n\tDefinition\r\n\t\tSubsequence\r\n\t\t\tstring that can be derived from it by deleting some\r\n\t\t\tcharacters without changing the order of the \r\n\t\t\tremaining characters.\r\n\t\t\ti.e.\t\"cotst\" is a subsequence of \"contest\"\r\n\t\tPalindrome\r\n\t\t\tstring that reads the same forward or backward\r\n\"\"\"\r\n\r\nA = input()\r\n\r\nprint(A + A[::-1])", "s=input()\r\ns=list(s)\r\nl=len(s)\r\nfor i in range(l):\r\n if s[i] != s[l-i-1]:\r\n s.insert(l-i,s[i])\r\n l+=1\r\nprint(''.join(s))", "o=input()\nprint(o+o[::-1])", "N = input()\r\nans1 = N[0:-1]\r\nans2 = list(ans1)\r\nans2.reverse()\r\nN = list(N)\r\nx = N + ans2\r\nprint(\"\".join(x))", "s=input()\r\nres=s[::-1]\r\nprint(s+res)", "s = input()\nt = s[::-1]\nprint(s, t, sep='')\n", "s = input()\r\ns2 = s\r\nprint(s + s2[::-1])\r\n", "import sys\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\nA = input()\r\nprint(A+''.join(str(c) for c in reversed(A)))\r\n\r\n\r\n", "s=input()\r\ns+=s[::-1]\r\nprint(s)", "import sys\nif sys.version_info < (3, 0):\n lrange = range\n input = raw_input\n range = xrange\n\ns = input()\n\nprint(s+s[::-1])\n", "import math\r\ntext = input()\r\nif (text[math.ceil(len(text)/2):][::-1] == text[:len(text)//2]):\r\n print(text)\r\nelse:\r\n print(text+text[::-1])", "def is_palindrome(string):\r\n length = len(string)\r\n\r\n if length%2 == 0 :\r\n l_half = string[int(length/2):]\r\n if string[:int(length/2) ] == l_half[::-1] :\r\n return True\r\n else:\r\n return False\r\n else:\r\n l_half = string[int(length/2):]\r\n if string[:int(length/2)+1 ] == l_half[::-1] :\r\n return True\r\n else:\r\n return False\r\ndef is_subsequence(string1,string2):\r\n for sub in string1:\r\n index = string2.find(sub)\r\n if index != -1:\r\n string2 = string2[index:]\r\n else:\r\n return False\r\n return True\r\n\r\nstring1 = input()\r\nif is_palindrome(string1):\r\n print(string1)\r\nelse:\r\n print(string1+string1[::-1])\r\n", "s = input()\ns = s + s[::-1]\nprint(s)\n\t \t\t\t\t \t \t\t\t\t\t \t \t \t \t \t", "line = input()\nlen1 = len(line)\nstring = line[::-1]\nprint(line+string)\n", "s=[c for c in input()]\r\nn=len(s)-1\r\ni=0\r\nwhile i <= n//2:\r\n\tif s[n-i]!=s[i]:\r\n\t\ts.insert(n-i+1,s[i])\r\n\t\tn+=1\r\n\ti+=1\r\nres=\"\"\r\nfor c in s:\r\n\tres+=c\r\nprint(res)\r\n", "\"\"\"\nBrandt Smith, Lemuel Gorion and Peter Haddad\n\ncodeforces.com\n\nProblem 932A\n\"\"\"\nimport sys\n\nn = input()\nr = n [::-1]\nprint (str(n+r))\n\n", "a = input()\nprint(a + a[::-1])\n", "a=input()\r\nb=''\r\nn=len(a)\r\ni=-1\r\nwhile i>=-n:\r\n b+=a[i]\r\n i=i-1\r\nif a==b:\r\n print(a)\r\nelse:\r\n for i in a:\r\n print(i,end='')\r\n i=0\r\n while i<len(b):\r\n if i==0:\r\n pass\r\n else:\r\n print(b[i],end='')\r\n i=i+1\r\n print()", "n=input()\r\nm=n[::-1]\r\nprint(n+m)\r\n", "# cook your dish here\r\ns=input()\r\nd={}\r\nfor i in s:\r\n d[i]=0\r\nfor i in s:\r\n d[i]=d[i]+1\r\ncount=0\r\nfor i,j in d.items():\r\n if(j%2==1):\r\n count=count+1\r\n if(count >1):\r\n break\r\np=[0]*len(s)\r\npk=0\r\nok=0\r\nfor i in range(int(len(s)/2)):\r\n if(s[pk]!=s[-(pk+1)]):\r\n ok=1\r\n break\r\n pk=pk+1\r\nif(ok==0):\r\n print(s)\r\nelse:\r\n m=reversed(s)\r\n m=list(m)\r\n m=''.join(m)\r\n print(s,m,sep='')\r\n \r\n \r\n ", "import getpass\r\nimport sys\r\nimport math\r\nimport functools\r\nimport string\r\n\r\n\r\ndef ria():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\nfiles = True\r\n\r\nif getpass.getuser() == 'frohenk' and files:\r\n sys.stdin = open(\"test.in\")\r\n # sys.stdout = open('test.out', 'w')\r\n\r\nst = input()\r\n\r\nfor i in range(len(st) - 1, -1, -1):\r\n st+=st[i]\r\nprint(st)\r\n\r\nsys.stdout.close()\r\n", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math, fractions, collections\r\n# ===================================\r\na = str(input())\r\nprint(a+a[::-1])", "s = str(input())\r\nprint(s + s[::-1])", "a=input()\r\nb=a[::-1]\r\nif a==b:\r\n print(b)\r\nelse:\r\n print(a+b)\r\n", "a = input()\r\nb = ''\r\nfor i in range(len(a)):\r\n b = a[i] + b\r\nprint(a + b)", "def main():\n a = input()\n print(a + ''.join(reversed(a)))\n\n\nif __name__ == '__main__':\n main()", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\ns = input()\r\ntemp = s[0:-1]\r\ntemp1 = list(temp)\r\ntemp1.reverse()\r\ns = list(s)\r\nx = s + temp1\r\nprint(\"\".join(x))\r\n", "tr = input()\nprint (tr+tr[::-1])\n", "s=input()\r\ns2 = s[::-1]\r\nif (s==s2):print(s)\r\nelse:print (s+s2)", "s = input()\r\nprint(s + ''.join(reversed(list(s))))", "s = input()\r\nprint ( s + s[::-1])\r\n", "class Main:\r\n a = input()\r\n print(a + a[::-1])\r\n\r\n\r\nif __name__ == \"main\":\r\n Main()", "A = input()\r\n\r\nl = len(A)\r\n\r\nif l % 2 == 1:\r\n\ta1 = A[0:l // 2]\r\n\tmid = A[l//2]\r\n\ta2 = A[(l//2)+1:]\r\n\tans = a1 + a2[::-1] + mid + a2 + a1[::-1]\r\n\r\nelse:\r\n\ta1 = A[0:l//2]\r\n\ta2 = A[l//2:]\r\n\tans = a1 + a2[::-1] + a2 + a1[::-1]\r\n\r\n\r\n\r\nprint(ans)", "a=input()\na1=[]\na2=[]\nfor i in a:\n\ta1.append(i)\n\ta2.append(i)\na2.reverse()\nif a1==a2:\n\tprint(a)\nelse:\n\ta3=a1+a2\n\tprint(*a3,sep='')\n", "x=input()\r\nr=x[::-1]\r\nif r==x:\r\n print(x)\r\nelse:\r\n a=x[1:]\r\n new=a[::-1]+x\r\n print(new)", "a=input()\r\nprint(a,end='')\r\na=a[::-1]\r\nprint(a)", "a=input();b=\"\"\r\nfor i in range(len(a)-1,-1,-1) :\r\n b+=a[i]\r\nif a==b :\r\n print(a)\r\nelse :\r\n print(a+b)\r\n", "s=input()\r\nv=''\r\nfor i in range(len(s)-1,-1,-1):\r\n v+=s[i]\r\n\r\nprint(s+v)\r\n \r\n", "def isPalindrom(s):\r\n s_len = len(s)\r\n if s_len == 1:\r\n return (True, 0)\r\n else:\r\n mid_pt = s_len // 2\r\n for i in range(mid_pt):\r\n if s[i] != s[s_len-i-1]:\r\n return (False, i)\r\n return (True, 0)\r\n \r\ns = list(input())\r\nis_palin, idx = isPalindrom(s)\r\nwhile not is_palin:\r\n s.insert(len(s)-idx, s[idx]);\r\n is_palin, idx = isPalindrom(s)\r\n \r\nprint(''.join(s))\r\n", "import sys\r\nfrom math import sqrt, floor, factorial\r\nfrom collections import deque, Counter\r\ninp = sys.stdin.readline\r\nread = lambda: list(map(int, inp().strip().split()))\r\n\r\ndef solve():\r\n\ts = inp().strip();ans = \"\"\r\n\ti,j = 0, len(s)-1\r\n\twhile i < j:\r\n\t\tif s[i] == s[j]:\r\n\t\t\tans += s[j]\r\n\t\t\tj -=1; i += 1\r\n\t\telse:\r\n\t\t\tans += s[j]\r\n\t\t\tj-=1\r\n\tans += s[i:]\r\n\tprint(ans)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsolve()\r\n# addcbcdda\r\n# addcbcdda", "a = input()\nb = a+a[-2::-1]\n\nprint(b)\n", "str1=input()\nlist0=list(str1)\nlist1=list(str1)\nlist0.pop()\nfor i in list0[::-1]:\n list1.append(i)\nstr2=''.join(list1)\nprint(str2)\n\t \t \t \t \t \t\t \t\t\t \t\t\t \t", "s=input()\r\nl=list(s)\r\nl.reverse()\r\ns1=''.join(l)\r\nprint(s+s1)", "def solve(A):\n return A + A[::-1]\n\n\ndef main():\n A = input()\n print(solve(A))\n\n\nmain()\n", "s=input()\r\ns1=s[::-1]\r\nprint(s+s1)", "s=str(input())\r\nl=list(s)\r\nll=l+l[::-1]\r\nss=''.join(ll)\r\nprint(ss)", "s = input()\r\nq = s[::-1]\r\nr = s+q\r\nprint(r)", "l=input()\r\nprint(l+l[::-1])", "a = input()\r\nprint (a+a[::-1])", "x = input()\n\n\nprint(x+x[::-1])\n", "n=input()\r\nz=''\r\nfor i in range(len(n)-1,-1,-1):\r\n z+=n[i]\r\nprint(n+z)\r\n", "def solve(inp):\n return inp + inp[::-1]\n\n\nif __name__ == \"__main__\":\n print(solve(input()))\n", "n=input()\r\nif n[:len(n)//2+1]==n[len(n)//2:][::-1]:\r\n print(n)\r\nelse:\r\n print(n+n[:-1][::-1])", "n = input()\r\nif n == n[::-1]:\r\n print(n)\r\nelse:\r\n print(n+n[::-1])\r\n\r\n", "a = input()\r\nb = reversed(a)\r\nprint(a, *b, sep='')\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n", "w= input()\r\ni=0\r\nn = len(w)\r\no= n-1\r\nf =True\r\nb =w[::-1]\r\nwhile (i<=(n//2)):\r\n if(w[i]==w[o]):\r\n i+=1\r\n o-=1\r\n f =True\r\n else:\r\n f = False\r\n break\r\nif f == True:\r\n print (w)\r\nelse:\r\n a = w + b\r\n print( a)\r\n \r\n \r\n \r\n", "A=input()\nprint(A,end=\"\")\nprint(A[::-1])\n#abba\n#afjhhjfa", "s=input().strip()\r\nprint(s+s[::-1])", "s = input()\r\ns2 = s\r\n\r\nfor k in range(len(s) - 1, -1, -1):\r\n s += s2[k]\r\n\r\nprint(s)\r\n", "s=str(input())\r\nif(s==s[::-1]):\r\n print(s)\r\nelse:\r\n d=s[::-1]\r\n print(s+d)", "s=input()\r\nt=s[::-1]\r\ns=s+t\r\nprint(s)", "s=input()\r\nif s==s[-1::-1]:\r\n print(s)\r\nelse:\r\n print(s+s[-1::-1])", "a = input()\n\nb = a[len(a) - 2:0:-1] + a[0]\n\nprint(a + b)", "a = input()\r\nb = a[::-1]\r\nprint(a + b)", "def isPal(s):\r\n return s == s[::-1]\r\n\r\n\r\nif __name__ == '__main__':\r\n s = input().strip()\r\n if isPal(s):\r\n print(s)\r\n else:\r\n print(s + s[::-1])\r\n", "import sys,math\ninput=sys.stdin.readline\nL=lambda : list(map(int,input().split().strip()))\nM=lambda : map(int,input().split())\nn=input().strip()\nprint(n+n[-1::-1])\n", "s = input()\nfor i in reversed(range(len(s)-1)):\n s += s[i]\nprint(s)", "def solve():\r\n s = input()\r\n \r\n print(s + s[::-1])\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "s = list(input())\r\nr = s.copy()\r\nr.reverse()\r\nprint(''.join(s+r[1:]))\r\n", "line = input()\n\noutput = line + line[::-1]\n\nprint(output)", "s = input()\r\ns1 = s[::-1]\r\nprint(s + s1)", "#it is python now\ns=input()\ns1=s[::-1]\nprint(s+s1)", "n = input()\r\nif n==n[::-1]:\r\n print(n)\r\nelse:\r\n n+=n[::-1]\r\n print(n)", "def main():\r\n s = input()\r\n print(end=s)\r\n s = s[::-1]\r\n print(s, \"\\n\")\r\nmain()\r\n", "from math import sqrt\r\n\r\n\r\n\r\ndef main():\r\n d = input()\r\n print(d+\"\".join(reversed(d)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import copy\r\na = list(input())\r\nb = copy.copy(a)\r\nb.reverse()\r\nprint(\"\".join(str(i) for i in a + b))", "s = input()\r\nprint(s + ''.join(s[::-1]))\r\n", "a = input()\r\nif a == a[::-1]:\r\n print(a)\r\nelse:\r\n print(a+a[:len(a)-1][::-1])", "s = input()\r\n\r\nprint(str(s) + str(s[::-1]))\r\n", "s=input()\r\nif ''.join(reversed(s))==s:\r\n\tprint(s)\r\nelse:\r\n\ts=''.join(reversed(s))+s\r\n\tprint(s)", "s = list(input())\nt = s.copy()\nt.reverse()\ns = s + t\nprint(*[x for x in s], sep='')\n", "a=input();print(a+a[::-1])\n\n\n\n# Made By Mostafa_Khaled", "import math\r\n\r\n\r\ndef palindromo(mot):\r\n\r\n for n in range(math.ceil(len(mot)/2)):\r\n\r\n if mot[n] == mot[-1-n]:\r\n pass\r\n else:\r\n return False\r\n\r\n return True\r\n\r\npalabra = input()\r\npalabra2 = palabra\r\n\r\nif palindromo(palabra):\r\n print(palabra)\r\nelse:\r\n for n in range(len(palabra)-1):\r\n\r\n palabra2 = palabra2 + palabra[-n-2]\r\n\r\n print(palabra2)\r\n", "a = input()\r\nb= a+ a[::-1]\r\nprint(b)", "s = input()\nif s == s[::-1]: print(s)\nelse:\n print(s + s[::-1])\n", "s=input()\r\np=''\r\nfor i in s:\r\n p=i+p\r\nprint(s+p)", "s=input()\r\nprint(s+s[-1::-1])", "a = input()\r\nb = a + ''.join(list(reversed(a)))\r\nprint(b)\r\n", "t=input()\r\nrev = ''.join(reversed(t))\r\n\r\nif t == rev:\r\n\tprint(t)\r\nelse:\r\n\tprint(t+rev)\r\n\t\r\n\r\n\r\n\t ", "\r\nt=(input())\r\ns=t[::-1]\r\nprint(t,s,sep=\"\")", "\r\n\r\na=list(input())\r\nb=a[0:]\r\na.reverse()\r\nfor i in a:\r\n\tb.append(i)\r\nprint (''.join(b))", "def ispalindrome(s):\r\n return s == s[-1::-1]\r\n\r\nA = input()\r\n\r\nif ispalindrome(A):\r\n\tprint(A)\r\nelif len(A) <= 10**4 / 2:\r\n\tprint(A + A[-1::-1])\r\nelse:\r\n\tn = len(s)\r\n\tp1 = n-[ispalindrome(s[:i]) for i in range(n,0,-1)].index(True)\r\n\tp2 = n-[ispalindrome(s[i:]) for i in range(1,n)].index(True)-1\r\n\tif p1 > p2:\r\n\t\tprint(s[p1:] + s)\r\n\telse:\r\n\t\tprint(s + s[n-p2-1::-1])", "def is_palin(inp):\r\n return inp == inp[::-1]\r\n\r\ndef generate(inp):\r\n if (not inp):\r\n return ''\r\n \r\n return inp[0] + generate(inp[1:]) + inp[0]\r\n\r\na = input()\r\n\r\nif (is_palin(a)):\r\n print(a)\r\nelse:\r\n print(generate(a))", "a = input()\r\nt = a\r\na = ' '.join(a)\r\na = a.split()\r\na.reverse()\r\nprint(t+''.join(a))\r\n \r\n \r\n", "def ishuiwen(x):\n if x==x[::-1]:\n return True\n else:\n return False\nif __name__=='__main__':\n a=input()\n if ishuiwen(a)==True:\n print(a)\n else:\n b=a+a[::-1]\n print(b)\n\t \t \t \t \t\t \t \t \t \t\t\t", "def rev(s):\r\n b=[]\r\n for elem in reversed(s):\r\n b.append(elem)\r\n return b\r\n\r\na=input()\r\n\r\nres=[]\r\nfor char in a:\r\n res.append(char)\r\n\r\nif(rev(res)==res):\r\n for elem in res:\r\n print(elem,end='')\r\n\r\n \r\nelse:\r\n for i in range(len(res)):\r\n if(rev(res)==res):\r\n break \r\n else:\r\n l=len(res)\r\n res.append(res[l-2*i-2])\r\n\r\n\r\n\r\n for elem in res:\r\n print(elem,end='')\r\n", "s = input()\r\nn = len(s)\r\ns2 = s\r\nif n % 2 == 0:\r\n for i in range(n - 1, -1, -1):\r\n s2 += s[i]\r\nelse:\r\n for i in range(n - 2, -1, -1):\r\n s2 += s[i] \r\nprint(s2)", "s = str(input())\r\nx =\"\"\r\nfor i in range(len(s)-1,-1,-1):\r\n x+=s[i]\r\nprint(s+x)\r\n\r\n", "A = input()\r\nA_reversed = A[::-1]\r\nB = A + A_reversed\r\nprint(B)", "str1 = input() \nstr2 = str1[::-1]\nprint(str1+str2)\n\t \t\t \t\t\t \t \t\t \t\t\t\t\t\t \t \t\t", "n = input()\r\nr = n + n[::-1]\r\nprint(r)", "from pathlib import Path\r\nimport sys\r\nimport functools\r\nimport itertools\r\nimport re\r\n\r\ndef solve():\r\n # code goes here!! \r\n s = str(input())\r\n print(s,s[::-1],sep = \"\");\r\n \r\n\r\ndef main():\r\n if Path('test.inp').exists():\r\n sys.stdin = open(\"test.inp\",\"r\")\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n", "a = input()\nl1 = list(a);l2 = list(a)\nl2.reverse()\nfor i in range(len(l2)):\n l1.append(l2[i])\nfor i in range(len(l1)):\n print(l1[i],sep = '',end = '')\n\n \t \t\t \t \t\t\t\t\t \t\t \t \t\t\t", "class SuperPolindrom:\r\n def __init__(self,str):\r\n self.__str=str\r\n def IsPolindrom(self):\r\n return self.__str==self.__str[::-1]\r\n def __str__(self):\r\n return self.__str if self.IsPolindrom() else \"{0}{1}\".format(self.__str,self.__str[-2:-len(self.__str)-1:-1])\r\nprint(SuperPolindrom(input()))\r\n\r\n", "o=input()\nprint(o,o[::-1],sep='')", "a=input()\r\nprint(a+a[-1::-1])\r\n", "s = input()\r\nif s == s[::-1]:\r\n\tprint (s)\r\nelse:\r\n\tprint (s + s[::-1])", "s1 = list(input())\r\ns2 = s1[::-1]\r\nprint(''.join(s1) + ''.join(s2))\r\n", "a = str(input())\r\nprint(a + ''.join(reversed(a)))", "# cook your dish here\r\nx = input()\r\nprint(x, end=\"\")\r\nx = x[::-1]\r\nprint(x)", "s=input()\r\nt=s+s[::-1]\r\nprint(t)", "A = str(input())\nB=A[::-1]\nfor i in range(len(B)):\n A=A+B[i]\nprint(A)\n \t\t\t \t\t\t \t\t\t \t \t \t\t\t\t\t", "n=input()\r\nt=n[::-1]\r\nprint(n+t)", "s = list(input())\r\ni,j = 0,len(s)-1\r\nwhile i<j:\r\n if s[i] == s[j]:\r\n i+=1\r\n j-=1\r\n else:\r\n s.insert(j+1,s[i])\r\n i+=1\r\nprint(''.join(s))", "s = input()\r\n\r\nprint(s + \"\".join(list(reversed(s))))", "s=str(input())\r\nrev=s[::-1]\r\nprint(s+rev)", "a = list(str(input()))\r\nb = []\r\nfor i in range(len(a)):\r\n b.append(a[i])\r\n b.append(a[-i-1])\r\nprint(''.join(b))", "\nimport sys\nimport os\nimport math\nimport re\n\n\ns = input()\n\ns += s[::-1]\n\nprint(s)\n", "z=input()\nl=z+z[::-1]\nprint(l)\n \n \n\n\n \n\n#sdfh\n\t\t\t\t\t\t \t\t\t\t \t \t \t\t\t \t \t\t\t\t \t", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\na=str(input())\r\nprint(a+a[::-1])", "s=input()\r\nss=s[::-1]\r\ns+=ss\r\nprint(s)", "n=list(input())\r\nans=\"\"\r\nfor i in range(len(n)):\r\n ans+=n[i]\r\nn.reverse()\r\nfor i in range(len(n)):\r\n ans+=n[i]\r\nprint(ans)", "a = input()\r\nprint(a, end='')\r\nprint(a[::-1])", "str = input()\r\nprint(str + ''.join(reversed(str)))\r\n", "a = input()\r\nif len(a) * 2 <= 10 ** 4:\r\n print(a + a[::-1])\r\nelse:\r\n print(a)", "s=input()\r\ns1=s[::-1]\r\n\r\nif s1==s:\r\n\tprint(s)\r\nelse:\r\n\tp=s[:-1]\r\n\tp=p[::-1]\r\n\ts2=s+p\r\n\tprint(s2)", "s=input()\r\nk=s[::-1]\r\nprint(s+k)", "a=input()\r\nn=len(a)//2\r\nprint(a+a[len(a):0:-1]+a[0])", "x=input()\r\na=len(x)-1\r\nwhile 0<=a:\r\n x=x+x[a]\r\n a-=1\r\nprint(x)\r\n", "str = input()\r\ns1 = str[:-1]\r\ns2 = s1[::-1]\r\nprint (str + s2)", "a = input()\nif a == a[::-1]:\n print(a)\nelse:\n print(a[::-1] + a)\n", "a = input().strip()\nb = list(a[:])\nb.reverse()\nprint(a+\"\".join(b))\n", "s=input()\r\nl=len(s)\r\nt=''\r\nfor i in range(1,l+1):\r\n\tt=t+s[-i]\r\nprint(\"%s%s\"%(s,t))", "s = str(input())\r\nprint(end = s)\r\nfor j in range(len(s) - 1, -1, -1):\r\n print(end = s[j])\r\n", "a = input()\r\nprint(a+a[::-1]) #take all the values but do it reversely ", "x = input()\n\nprint(x+\"\".join([x[_] for _ in range(len(x)-1,-1,-1)]))\n", "A=input()\r\nprint(A+A[::-1])", "s=input()\r\nl=list(s)\r\nl.reverse()\r\ns1=\"\".join(l)\r\nif s1 == s:\r\n\tprint(s)\r\nelse:\r\n\tprint(s+s1)", "a = list(str(input()))\r\nb = a+list(reversed(a))\r\nb = ''.join(b)\r\nprint(b)\r\n", "given = input()\r\nprint(given, given[::-1], sep = \"\")", "def check(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\n\r\ns = input().strip()\r\nt = s + s[::-1]\r\nif check(t) is not True:\r\n print(-1)\r\n exit(0)\r\nprint(t)", "a = input().strip()\nprint(a+a[::-1])\n", "import sys\r\n\r\ndef main():\r\n s = input()\r\n t = \"a\" if len(s) % 2 == 1 else \"\"\r\n print(s+t+s[::-1])\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\n\ns = sys.stdin.read().strip()\nprint(s + s[::-1])\n", "a = input()\r\nprint(a,end=\"\")\r\nfor i in range(len(a)-1,-1,-1):\r\n print(a[i],end=\"\")\r\n", " \n#!/usr/bin/python3\n\nimport sys\n\ns = sys.stdin.readline().strip()\nprint(s + s[::-1][1:])\n\nsys.exit()\n", "a = input()\r\nfor i in a:\r\n\ta = i + a\r\n\r\nprint(a)\r\n", "s=input();m=(' '.join(s)).split()\r\nn='';m=list(reversed(m))\r\nfor i in range(0,len(s)):\r\n n=n+m[i]\r\nprint(s+n)", "########################## lajsfd;ljdsakfjalkdsjflsajdf\n################### asd;lfjlksajfd\nstrlist = input()\nprint(strlist+strlist[::-1])", "# https://codeforces.com/problemset/problem/932/A\r\n\r\ns = input()\r\n\r\nprint(s+s[::-1])", "print((lambda s: s + s[::-1])(input()))", "string = list(input())\r\nz = string[::-1]\r\nif z==string:\r\n print(''.join(z))\r\nelse:\r\n lst = string[0:len(string)-1]\r\n lst = lst[::-1]\r\n string+=lst\r\n z=string.reverse()\r\n print(''.join(string))\r\n\r\n", "ls=list(map(str,input()))\nls1=ls.copy()\nfor i in range(len(ls)):\n ls1.append(ls[len(ls)-i-1])\nfor i in range(len(ls1)):\n print(ls1[i],end='')\n\t\t \t\t\t \t\t\t\t \t\t \t\t\t\t \t \t \t", "a=input()\ns=''\ns+=a\na=list(a)\ndel a[-1]\na.reverse()\na=''.join(a)\n\ns+=a\nprint(s)\n", "if __name__ == '__main__':\r\n s = input()\r\n if s == s[::-1]:\r\n print(s)\r\n else:\r\n s1 = list(s)\r\n s1.reverse()\r\n s1 = ''.join(s1)\r\n print(s,end = \"\")\r\n print(s1)", "a = input()\nb = a + a[::-1]\nprint(b)\n", "from collections import deque\r\ns = input()\r\n\r\ndef IsPall(s):\r\n valid = True\r\n for i in range(len(s)):\r\n if s[i] != s[len(s)-1-i]:\r\n valid = False\r\n break\r\n return valid\r\n \r\n\r\nif IsPall(s):\r\n print(s)\r\nelse:\r\n left = s[0:-1]\r\n right = left[::-1]\r\n print( left+s[-1]+right )\r\n ", "import sys\n\nsubStr = sys.stdin.readline().strip()\nprint(subStr+subStr[::-1])", "s = list(input())\r\nq = s[::-1]\r\nprint(*s,sep=\"\",end=\"\")\r\nprint(*q,sep=\"\")", "word = input()\r\nprint(word + word[::-1])", "s=input()\r\nprint(\"zrmtcl\"+s+s[::-1]+\"lctmrz\")", "a = list(input())\na.extend(a[len(a)-2::-1])\nfor i in a:\n print(i, end='')\n", "def supersecuencia(cuerda_A):\r\n A=\"\"\r\n B=\"\"\r\n c=cuerda_A[0]\r\n if len(cuerda_A)%2==0:\r\n A=cuerda_A[:len(cuerda_A)//2]\r\n B=cuerda_A[len(cuerda_A)//2:]\r\n else:\r\n A=cuerda_A[:len(cuerda_A)//2]\r\n B=cuerda_A[(len(cuerda_A)//2)+1:]\r\n if A==B[::-1]:\r\n return cuerda_A\r\n else:\r\n return c+cuerda_A+cuerda_A[::-1]+c\r\n\r\ndef main():\r\n cuerda=input()\r\n print(supersecuencia(cuerda))\r\nmain()", "actual = str(input())\r\nrev = actual[::-1]\r\nif actual == rev:\r\n print(actual)\r\nelse:\r\n substr = actual[:-1]\r\n substr = substr[::-1]\r\n print(actual+substr)", "lst_A = input()\nlst_B = lst_A[::-1]\nif lst_A == lst_B:\n print(lst_A)\nelse:\n print(lst_A + lst_B)\n\t\t \t\t\t\t \t\t \t \t \t\t \t \t \t", "s = list(input())\r\nl = s[::-1]\r\n\r\nprint(''.join(s+l))", "a = input()\nb = ''\nc = len(a)\nd = 0\nfor i in range(int(c/2)):\n if a[i] == a[c-1]:\n d+=1\nif d == int(c/2):\n print(a)\nelse:\n b = b + a\n b = b[::-1]\n b = a + b\n print(b)\n \t\t \t\t\t\t \t\t\t \t \t \t\t\t\t", "string = input()\r\n\r\nprint(string + string[::-1]\r\n)", "s= input()\r\nn= len(s)\r\nif n%2: \r\n print(s+ s[::-1])\r\nelse:\r\n print(s+ s[::-1][1:])\r\n \r\n \r\n ", "a = list(input())\r\nprint(''.join(a + a[::-1]))", "a = input()\n\nif(str(a)==str(a)[::-1]):\n print(a)\nelse:\n print(str(a)+(a[::-1]))", "a = input()\nlo, hi = 0, len(a) - 1\nwhile lo < hi:\n if a[lo] == a[hi]:\n hi -= 1\n lo += 1\nres = a[:lo] + a[lo::-1]\nprint(res)\n", "a = input()\r\nb = \"\"\r\nc = \"\"\r\ni = 0\r\nj = len(a) - 1\r\np = len(a) - 1\r\nk = len(a)\r\npali = True\r\n\r\nwhile(i < (k//2)):\r\n if(a[i] != a[j]):\r\n pali = False\r\n i += 1\r\n j -= 1\r\n\r\nif(pali == False):\r\n while(p >= 0):\r\n c = c + a[p]\r\n p -= 1\r\n\r\nb = a + c \r\n\r\nif(pali):\r\n print(a)\r\nelse:\r\n print(b)\r\n", "a= input()\r\nli1= list(a)\r\nli1.insert(-1,'x')\r\nin1= ''.join(i for i in li1)\r\nprint(in1+in1[::-1])", "a = input()\na = list(a)\nfor i in range(len(a)):\n print(a[i],end='')\na.reverse()\nfor i in range(len(a)):\n print(a[i],end='')\n \t\t \t\t \t \t\t \t \t \t \t\t", "def process(A):\r\n return A+A[::-1]\r\n\r\nA = input()\r\nprint(process(A))", "s=input()\r\ns1=''\r\nfor i in range(len(s)-2, -1, -1):\r\n s1+=s[i]\r\nprint(s+s1)", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\n\r\na=input()\r\n\r\nprint(a,end='')\r\nfor i in range(len(a)-1,-1,-1):\r\n print(a[i],end='')", "A = str(input())\nx = len(A)\ni = 0\nx = x - 1\nk = 0\nwhile x - i >= i:\n if A[x - i] == A[i]:\n i += 1\n else:\n k = 1\n break\nif k == 1:\n B = A+A[::-1]\n print(B)\nelse:\n print(A)", "import sys, math\n\n#f = open('input', 'r')\nf = sys.stdin\ns = f.readline().strip()\nprint(s+s[::-1])\n", "str=input()\nres=[]\nres.append(list(str))\nres.append(list(reversed(list(str))))\nfor i in res[0]:\n print(i,end='')\nfor i in res[1]:\n print(i,end='')\n\n \t \t\t\t \t\t\t\t\t\t \t\t \t\t\t \t\t \t", "s=input() \r\ns1=s[::-1]\r\nif s==s1:\r\n print(s)\r\nelse:\r\n s1=\"\"\r\n i=len(s)\r\n x=s[:(i-1)]\r\n x=x[::-1]\r\n s1=s+x\r\n print(s1)", "A = input();\r\nprint(A) if A == A[::-1] else print(A+A[::-1])", "line = input()\n\npal = line\nfor i in range(len(line)-2,-1,-1):\n pal += line[i]\n\nprint(pal)", "#print('Hare Krishna')\r\ndef I():\r\n return int(input())\r\ndef IL():\r\n return [int(i) for i in input().split()]\r\ndef IM():\r\n return map(int,input().split())\r\ndef IS():\r\n return input()\r\ns=IS()\r\nprint(s+s[::-1])\r\n", "a = input()\r\nl = 0\r\nif a == a[::-1]:\r\n print(a)\r\nelse:\r\n for i in range(len(a)-1,-1,-1):\r\n d = a + a[i:]\r\n if d == d[::-1]:\r\n l = 1\r\n print(d)\r\n break\r\n if l == 0:\r\n print(a + a[len(a) - 1::-1])", "s=input()\r\nb=list(s)\r\nb.reverse()\r\nd=''.join(b)\r\nprint(s+d)\r\n", "s = input()\r\nd = \"\"\r\nfor i in range(len(s) - 1, -1, -1):\r\n d += s[i]\r\nprint(s + d)", "# Problem URL: https://codeforces.com/problemset/problem/932/A\r\n\r\na = input()\r\nprint(a+\"\".join(reversed(a)))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Feb 15 21:01:05 2018\r\n\r\n@author: DNARNAprotein\r\n\"\"\"\r\n\r\n\"\"\"\r\nCODEFORCES\r\nhttp://codeforces.com/contest/932/problem/A\r\n\"\"\"\r\n\r\ndef pikachu(a,c,n): #c is original string\r\n prefixes=[a[0:i+1] for i in range(n+1)]\r\n suffixes=[a[i:n+1] for i in range(n+1)]\r\n maxi=0\r\n for i in range(n//2):\r\n for j in suffixes:\r\n if prefixes[i]==j:\r\n maxi=i+1\r\n ans=c[maxi::][::-1]+c\r\n l=len(ans)\r\n return ((ans,l))\r\n \r\na=input()\r\nc=a\r\nb=a[::-1]+'#'+a\r\na=a+'#'+a[::-1]\r\n\r\nn=len(c*2)\r\nx=pikachu(a,c,n)\r\nc=c[::-1]\r\ny=pikachu(b,c,n)\r\nif x[1]<y[1]:\r\n print(x[0])\r\nelse:\r\n print(y[0])", "ar = input()\r\nabu = len(ar) - 1\r\nwhile abu > -1:\r\n ar += ar[abu]\r\n abu -= 1\r\nprint(ar)\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n s = input()\r\n print(s + s[::-1])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = input()\r\nb = a\r\nfor i in range(len(a)):\r\n b=b+(a[len(a)-i-1])\r\nprint(b) \r\n \r\n\r\n \r\n", "x = input()\nprint(x+x[::-1])\n", "A = input()\r\nrev = A[::-1]\r\nprint( A + rev)\r\n", "#author @karngyan\r\n\r\n\r\ns=input()\r\ns=s+s[-1:-len(s)-1:-1]\r\nprint(s)\r\n\r\n ", "class SuperPolindrom:\r\n def __init__(self,str):\r\n self.__str=str\r\n def IsPolindrom(self):\r\n return self.__str==self.__str[::-1]\r\n def __str__(self):\r\n return self.__str if self.IsPolindrom() else \"{0}{1}{2}\".format(self.__str,self.__str[-2:0:-1],self.__str[0])\r\n\r\nprint(SuperPolindrom(input()))\r\n\r\n", "s = input();\r\ns1 = s;\r\nfor q in range(len(s1)):\r\n s = s + s1[len(s1) - q - 1];\r\nprint(s);", "A = input()\nnum = len(A)\nA = list(A)\nfor i in range(num):\n A.append(A[num - i - 1])\nA = \"\".join(A)\nprint(A)\n \t \t\t \t \t \t\t\t \t \t\t\t\t \t\t\t \t", "import sys\r\n# from io import StringIO\r\n#\r\n# sys.stdin = StringIO(open(__file__.replace('.py', '.in')).read())\r\n\r\ns = input()\r\n\r\nif s == s[::-1]:\r\n print(s)\r\n sys.exit()\r\n\r\nprint(s + s[::-1])", "from sys import stdin\r\nword=list(stdin.readline())\r\nword= word[:len(word)-1]\r\nreverse=word[::-1]\r\nprint(\"\".join(word)+\"\".join(reverse))", "x=input();print(x+x[::-1])\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness", "N = input()\nprint(N[::]+N[::-1])\n", "#\r\ndef solution(l1):\r\n c_out=\"\"\r\n for x in l1:\r\n c_out+=x\r\n l1.reverse()\r\n for x in l1:\r\n c_out+=x\r\n return c_out\r\ndef answer():\r\n l1 = list(input())\r\n print(solution(l1))\r\nanswer()", "s=input()\r\nprint(s,s[-1::-1],sep=\"\")", "s = input(\"\")\r\nfor i in range(len(s)-1,-1,-1):\r\n s = s+s[i]\r\nprint (s)", "#Insert characters to make palindrome.\r\ngiven = input()\r\nresult = [c for c in given]\r\n\r\nfor letter in reversed(given):\r\n result.append(letter)\r\nprint(\"\".join(result))\r\n", "from sys import stdin, stdout\r\nfrom random import randrange\r\n\r\ns = stdin.readline().strip()\r\nstdout.write(s + s[::-1])", "a = list(input())\r\nb = reversed(a)\r\nprint(*a, *b, sep='')", "import sys\r\nfrom itertools import permutations\r\n#a=list(map(int,input().strip().split(' ')))\r\n#n,k,s= map(int, sys.stdin.readline().split(' '))\r\ns=str(input())\r\nsr=s[::-1]\r\nprint(s+sr)\r\n", "a = input()\r\n\r\nif a == a[::-1]:\r\n print(a)\r\nelse:\r\n print(a + a[-2::-1])\r\n", "a = input()\r\nb = a[:-1]\r\nb = list(b)\r\n\r\nwhile (a != a[::-1]):\r\n a += b.pop()\r\n \r\nprint(a)\r\n", "def palindromeSupersequence(s):\r\n return s + s[::-1]\r\n\r\ns = input()\r\nprint(palindromeSupersequence(s))", "a = input()\r\nb = \"\"\r\nfor i in range(len(a) - 1,-1,-1):\r\n b += a[i]\r\nprint(a + b)", "\r\n\r\n\r\n\r\nn = input()\r\n\r\n\r\nif n==n[::-1]:\r\n print(n)\r\nelse:\r\n\r\n print(n+n[::-1])\r\n", "A = input()\r\ntemp = A[1:len(A)][::-1]\r\nA = temp + A\r\nprint(A)", "def is_palindromic(x):\r\n\r\n p = len(x)\r\n q = int(p/2)\r\n count = 0\r\n\r\n for i in range(0, q):\r\n if x[i] == x[p-1-i]:\r\n count += 1\r\n else:\r\n pass\r\n\r\n if (count) == (p - count) or (count + 1) == (p - count):\r\n return(True)\r\n else:\r\n return(False)\r\n\r\n\r\n\r\nA = input()\r\nb = is_palindromic(A)\r\n\r\nif (b == True):\r\n print(A)\r\nelse:\r\n w = len(A) - 2\r\n for k in range(w, -1, -1):\r\n y = A[k]\r\n A = A + y\r\n print(A)\r\n", "def creat_pali(s):\r\n return s+s[::-1]\r\na=input()\r\nprint(creat_pali(a))", "A = input()\r\nprint('{}{}'.format(A, A[::-1]))\r\n" ]

{"inputs": ["aba", "ab", "krnyoixirslfszfqivgkaflgkctvbvksipwomqxlyqxhlbceuhbjbfnhofcgpgwdseffycthmlpcqejgskwjkbkbbmifnurnwyhevsoqzmtvzgfiqajfrgyuzxnrtxectcnlyoisbglpdbjbslxlpoymrcxmdtqhcnlvtqdwftuzgbdxsyscwbrguostbelnvtaqdmkmihmoxqtqlxvlsssisvqvvzotoyqryuyqwoknnqcqggysrqpkrccvyhxsjmhoqoyocwcriplarjoyiqrmmpmueqbsbljddwrumauczfziodpudheexalbwpiypmdjlmwtgdrzhpxneofhqzjdmurgvmrwdotuwyknlrbvuvtnhiouvqitgyfgfieonbaapyhwpcrmehxcpkijzfiayfvoxkpa", "mgrfmzxqpejcixxppqgvuawutgrmezjkteofjbnrvzzkvjtacfxjjokisavsgrslryxfqgrmdsqwptajbqzvethuljbdatxghfzqrwvfgakwmoawlzqjypmhllbbuuhbpriqsnibywlgjlxowyzagrfnqafvcqwktkcjwejevzbnxhsfmwojshcdypnvbuhhuzqmgovmvgwiizatoxgblyudipahfbkewmuneoqhjmbpdtwnznblwvtjrniwlbyblhppndspojrouffazpoxtqdfpjuhitvijrohavpqatofxwmksvjcvhdecxwwmosqiczjpkfafqlboxosnjgzgdraehzdltthemeusxhiiimrdrugabnxwsygsktkcslhjebfexucsyvlwrptebkjhefsvfrmcqqdlanbetrgzwylizmrystvpgrkhlicfadco", "hdmasfcjuigrwjchmjslmpynewnzpphmudzcbxzdexjuhktdtcoibzvevsmwaxakrtdfoivkvoooypyemiidadquqepxwqkesdnakxkbzrcjkgvwwxtqxvfpxcwitljyehldgsjytmekimkkndjvnzqtjykiymkmdzpwakxdtkzcqcatlevppgfhyykgmipuodjrnfjzhcmjdbzvhywprbwdcfxiffpzbjbmbyijkqnosslqbfvvicxvoeuzruraetglthgourzhfpnubzvblfzmmbgepjjyshchthulxar", "fggbyzobbmxtwdajawqdywnppflkkmtxzjvxopqvliwdwhzepcuiwelhbuotlkvesexnwkytonfrpqcxzzqzdvsmbsjcxxeugavekozfjlolrtqgwzqxsfgrnvrgfrqpixhsskbpzghndesvwptpvvkasfalzsetopervpwzmkgpcexqnvtnoulprwnowmsorscecvvvrjfwumcjqyrounqsgdruxttvtmrkivtxauhosokdiahsyrftzsgvgyveqwkzhqstbgywrvmsgfcfyuxpphvmyydzpohgdicoxbtjnsbyhoidnkrialowvlvmjpxcfeygqzphmbcjkupojsmmuqlydixbaluwezvnfasjfxilbyllwyipsmovdzosuwotcxerzcfuvxprtziseshjfcosalyqglpotxvxaanpocypsiyazsejjoximnbvqucftuvdksaxutvjeunodbipsumlaymjnzljurefjg", "qyyxqkbxsvfnjzttdqmpzinbdgayllxpfrpopwciejjjzadguurnnhvixgueukugkkjyghxknedojvmdrskswiotgatsajowionuiumuhyggjuoympuxyfahwftwufvocdguxmxabbxnfviscxtilzzauizsgugwcqtbqgoosefhkumhodwpgolfdkbuiwlzjydonwbgyzzrjwxnceltqgqelrrljmzdbftmaogiuosaqhngmdzxzlmyrwefzhqawmkdckfnyyjgdjgadtfjvrkdwysqofcgyqrnyzutycvspzbjmmesobvhshtqlrytztyieknnkporrbcmlopgtknlmsstzkigreqwgsvagmvbrvwypoxttmzzsgm", "scvlhflaqvniyiyofonowwcuqajuwscdrzhbvasymvqfnthzvtjcfuaftrbjghhvslcohwpxkggrbtatjtgehuqtorwinwvrtdldyoeeozxwippuahgkuehvsmyqtodqvlufqqmqautaqirvwzvtodzxtgxiinubhrbeoiybidutrqamsdnasctxatzkvkjkrmavdravnsxyngjlugwftmhmcvvxdbfndurrbmcpuoigjpssqcortmqoqttrabhoqvopjkxvpbqdqsilvlplhgqazauyvnodsxtwnomlinjpozwhrgrkqwmlwcwdkxjxjftexiavwrejvdjcfptterblxysjcheesyqsbgdrzjxbfjqgjgmvccqcyj", "oohkqxxtvxzmvfjjxyjwlbqmeqwwlienzkdbhswgfbkhfygltsucdijozwaiewpixapyazfztksjeoqjugjfhdbqzuezbuajfvvffkwprroyivfoocvslejffgxuiofisenroxoeixmdbzonmreikpflciwsbafrdqfvdfojgoziiibqhwwsvhnzmptgirqqulkgmyzrfekzqqujmdumxkudsgexisupedisgmdgebvlvrpyfrbrqjknrxyzfpwmsxjxismgd", "gilhoixzjgidfanqrmekjelnvicpuujlpxittgadgrhqallnkjlemwazntwfywjnrxdkgrnczlwzjyeyfktduzdjnivcldjjarfzmmdbyytvipbbnjqolfnlqjpidotxxfobgtgpvjmpddcyddwdcjsxxumuoyznhpvpqccgqnuouzojntanfwctthcgynrukcvshsuuqrxfdvqqggaatwytikkitywtaaggqqvdfxrquushsvckurnygchttcwfnatnjozuounqgccqpvphnzyoumuxxsjcdwddycddpmjvpgtgbofxxtodipjqlnfloqjnbbpivtyybdmmzfrajjdlcvinjdzudtkfyeyjzwlzcnrgkdxrnjwyfwtnzawmeljknllaqhrgdagttixpljuupcivnlejkemrqnafdigjzxiohlig", "abcab", "baaaaaaa", "baaaaaa", "baaaaaaaaa", "baaaaaaaa"], "outputs": ["abaaba", "abba", "krnyoixirslfszfqivgkaflgkctvbvksipwomqxlyqxhlbceuhbjbfnhofcgpgwdseffycthmlpcqejgskwjkbkbbmifnurnwyhevsoqzmtvzgfiqajfrgyuzxnrtxectcnlyoisbglpdbjbslxlpoymrcxmdtqhcnlvtqdwftuzgbdxsyscwbrguostbelnvtaqdmkmihmoxqtqlxvlsssisvqvvzotoyqryuyqwoknnqcqggysrqpkrccvyhxsjmhoqoyocwcriplarjoyiqrmmpmueqbsbljddwrumauczfziodpudheexalbwpiypmdjlmwtgdrzhpxneofhqzjdmurgvmrwdotuwyknlrbvuvtnhiouvqitgyfgfieonbaapyhwpcrmehxcpkijzfiayfvoxkpaapkxovfyaifzjikpcxhemrcpwhypaabnoeifgfygtiqvuoihntvuvbrlnkywutodwrmvgrumdjzqhfoenxphzrdgtwmljdm...", "mgrfmzxqpejcixxppqgvuawutgrmezjkteofjbnrvzzkvjtacfxjjokisavsgrslryxfqgrmdsqwptajbqzvethuljbdatxghfzqrwvfgakwmoawlzqjypmhllbbuuhbpriqsnibywlgjlxowyzagrfnqafvcqwktkcjwejevzbnxhsfmwojshcdypnvbuhhuzqmgovmvgwiizatoxgblyudipahfbkewmuneoqhjmbpdtwnznblwvtjrniwlbyblhppndspojrouffazpoxtqdfpjuhitvijrohavpqatofxwmksvjcvhdecxwwmosqiczjpkfafqlboxosnjgzgdraehzdltthemeusxhiiimrdrugabnxwsygsktkcslhjebfexucsyvlwrptebkjhefsvfrmcqqdlanbetrgzwylizmrystvpgrkhlicfadcoocdafcilhkrgpvtsyrmzilywzgrtebnaldqqcmrfvsfehjkbetprwlvyscuxef...", "hdmasfcjuigrwjchmjslmpynewnzpphmudzcbxzdexjuhktdtcoibzvevsmwaxakrtdfoivkvoooypyemiidadquqepxwqkesdnakxkbzrcjkgvwwxtqxvfpxcwitljyehldgsjytmekimkkndjvnzqtjykiymkmdzpwakxdtkzcqcatlevppgfhyykgmipuodjrnfjzhcmjdbzvhywprbwdcfxiffpzbjbmbyijkqnosslqbfvvicxvoeuzruraetglthgourzhfpnubzvblfzmmbgepjjyshchthulxarraxluhthchsyjjpegbmmzflbvzbunpfhzruoghtlgtearurzueovxcivvfbqlssonqkjiybmbjbzpffixfcdwbrpwyhvzbdjmchzjfnrjdoupimgkyyhfgppveltacqczktdxkawpzdmkmyikyjtqznvjdnkkmikemtyjsgdlheyjltiwcxpfvxqtxwwvgkjcrzbkxkandsekqwxpequ...", "fggbyzobbmxtwdajawqdywnppflkkmtxzjvxopqvliwdwhzepcuiwelhbuotlkvesexnwkytonfrpqcxzzqzdvsmbsjcxxeugavekozfjlolrtqgwzqxsfgrnvrgfrqpixhsskbpzghndesvwptpvvkasfalzsetopervpwzmkgpcexqnvtnoulprwnowmsorscecvvvrjfwumcjqyrounqsgdruxttvtmrkivtxauhosokdiahsyrftzsgvgyveqwkzhqstbgywrvmsgfcfyuxpphvmyydzpohgdicoxbtjnsbyhoidnkrialowvlvmjpxcfeygqzphmbcjkupojsmmuqlydixbaluwezvnfasjfxilbyllwyipsmovdzosuwotcxerzcfuvxprtziseshjfcosalyqglpotxvxaanpocypsiyazsejjoximnbvqucftuvdksaxutvjeunodbipsumlaymjnzljurefjggjferujlznjmyalmuspib...", "qyyxqkbxsvfnjzttdqmpzinbdgayllxpfrpopwciejjjzadguurnnhvixgueukugkkjyghxknedojvmdrskswiotgatsajowionuiumuhyggjuoympuxyfahwftwufvocdguxmxabbxnfviscxtilzzauizsgugwcqtbqgoosefhkumhodwpgolfdkbuiwlzjydonwbgyzzrjwxnceltqgqelrrljmzdbftmaogiuosaqhngmdzxzlmyrwefzhqawmkdckfnyyjgdjgadtfjvrkdwysqofcgyqrnyzutycvspzbjmmesobvhshtqlrytztyieknnkporrbcmlopgtknlmsstzkigreqwgsvagmvbrvwypoxttmzzsgmmgszzmttxopywvrbvmgavsgwqergikztssmlnktgpolmcbrropknnkeiytztyrlqthshvbosemmjbzpsvcytuzynrqygcfoqsywdkrvjftdagjdgjyynfkcdkmwaqhzfewry...", "scvlhflaqvniyiyofonowwcuqajuwscdrzhbvasymvqfnthzvtjcfuaftrbjghhvslcohwpxkggrbtatjtgehuqtorwinwvrtdldyoeeozxwippuahgkuehvsmyqtodqvlufqqmqautaqirvwzvtodzxtgxiinubhrbeoiybidutrqamsdnasctxatzkvkjkrmavdravnsxyngjlugwftmhmcvvxdbfndurrbmcpuoigjpssqcortmqoqttrabhoqvopjkxvpbqdqsilvlplhgqazauyvnodsxtwnomlinjpozwhrgrkqwmlwcwdkxjxjftexiavwrejvdjcfptterblxysjcheesyqsbgdrzjxbfjqgjgmvccqcyjjycqccvmgjgqjfbxjzrdgbsqyseehcjsyxlbrettpfcjdvjerwvaixetfjxjxkdwcwlmwqkrgrhwzopjnilmonwtxsdonvyuazaqghlplvlisqdqbpvxkjpovqohbarttqoqm...", "oohkqxxtvxzmvfjjxyjwlbqmeqwwlienzkdbhswgfbkhfygltsucdijozwaiewpixapyazfztksjeoqjugjfhdbqzuezbuajfvvffkwprroyivfoocvslejffgxuiofisenroxoeixmdbzonmreikpflciwsbafrdqfvdfojgoziiibqhwwsvhnzmptgirqqulkgmyzrfekzqqujmdumxkudsgexisupedisgmdgebvlvrpyfrbrqjknrxyzfpwmsxjxismgddgmsixjxsmwpfzyxrnkjqrbrfyprvlvbegdmgsidepusixegsdukxmudmjuqqzkefrzymgkluqqrigtpmznhvswwhqbiiizogjofdvfqdrfabswiclfpkiermnozbdmxieoxornesifoiuxgffjelsvcoofviyorrpwkffvvfjaubzeuzqbdhfjgujqoejsktzfzaypaxipweiawzojidcustlgyfhkbfgwshbdkzneilwwqemqblw...", "gilhoixzjgidfanqrmekjelnvicpuujlpxittgadgrhqallnkjlemwazntwfywjnrxdkgrnczlwzjyeyfktduzdjnivcldjjarfzmmdbyytvipbbnjqolfnlqjpidotxxfobgtgpvjmpddcyddwdcjsxxumuoyznhpvpqccgqnuouzojntanfwctthcgynrukcvshsuuqrxfdvqqggaatwytikkitywtaaggqqvdfxrquushsvckurnygchttcwfnatnjozuounqgccqpvphnzyoumuxxsjcdwddycddpmjvpgtgbofxxtodipjqlnfloqjnbbpivtyybdmmzfrajjdlcvinjdzudtkfyeyjzwlzcnrgkdxrnjwyfwtnzawmeljknllaqhrgdagttixpljuupcivnlejkemrqnafdigjzxiohliggilhoixzjgidfanqrmekjelnvicpuujlpxittgadgrhqallnkjlemwazntwfywjnrxdkgrnczlw...", "abcabbacba", "baaaaaaaaaaaaaab", "baaaaaaaaaaaab", "baaaaaaaaaaaaaaaaaab", "baaaaaaaaaaaaaaaab"]}

UNKNOWN

PYTHON3

CODEFORCES

316